Solve #16 Multiple Identical Capabilities
Now it is possible to have pattern OUT#:FREQuency
and commands OUT1:FREQ, OUT2:FREQ and OUT:FREQ
Unsupported range is up to user
In handler function, just call SCPI_CommandNumbers and it will fill
appropriate array
| | |
| | | } |
| | | |
| | | static scpi_result_t TEST_Numbers(scpi_t * context) { |
| | | int32_t numbers[2]; |
| | | |
| | | fprintf(stderr, "RAW CMD %.*s\r\n", (int)context->param_list.cmd_raw.length, context->param_list.cmd_raw.data); |
| | | SCPI_CommandNumbers(context, numbers, 2); |
| | | |
| | | fprintf(stderr, "TEST numbers %d %d\r\n", numbers[0], numbers[1]); |
| | | |
| | | return SCPI_RES_OK; |
| | | } |
| | |
| | | scpi_bool_t SCPI_IsCmd(scpi_t * context, const char * cmd); |
| | | int32_t SCPI_CmdTag(scpi_t * context); |
| | | scpi_bool_t SCPI_Match(const char * pattern, const char * value, size_t len); |
| | | scpi_bool_t SCPI_CommandNumbers(scpi_t * context, int32_t * numbers, size_t len); |
| | | |
| | | #ifdef __cplusplus |
| | | } |
| | |
| | | |
| | | for (i = 0; context->cmdlist[i].pattern != NULL; i++) { |
| | | cmd = &context->cmdlist[i]; |
| | | if (matchCommand(cmd->pattern, header, len)) { |
| | | if (matchCommand(cmd->pattern, header, len, NULL, 0)) { |
| | | context->param_list.cmd = cmd; |
| | | return TRUE; |
| | | } |
| | |
| | | |
| | | if (parameter->type == SCPI_TOKEN_PROGRAM_MNEMONIC) { |
| | | for (res = 0; options[res].name; ++res) { |
| | | if (matchPattern(options[res].name, strlen(options[res].name), parameter->ptr, parameter->len)) { |
| | | if (matchPattern(options[res].name, strlen(options[res].name), parameter->ptr, parameter->len, NULL)) { |
| | | *value = options[res].tag; |
| | | result = TRUE; |
| | | break; |
| | |
| | | } |
| | | |
| | | const char * pattern = context->param_list.cmd->pattern; |
| | | return matchCommand(pattern, cmd, strlen(cmd)); |
| | | return matchCommand (pattern, cmd, strlen (cmd), NULL, 0); |
| | | } |
| | | |
| | | /** |
| | |
| | | } |
| | | |
| | | scpi_bool_t SCPI_Match(const char * pattern, const char * value, size_t len) { |
| | | return matchCommand (pattern, value, len); |
| | | return matchCommand (pattern, value, len, NULL, 0); |
| | | } |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | scpi_bool_t SCPI_CommandNumbers(scpi_t * context, int32_t * numbers, size_t len) { |
| | | return matchCommand (context->param_list.cmd->pattern, context->param_list.cmd_raw.data, context->param_list.cmd_raw.length, numbers, len); |
| | | } |
| | |
| | | * @param len2 |
| | | * @return TRUE if strings match |
| | | */ |
| | | scpi_bool_t compareStrAndNum(const char * str1, size_t len1, const char * str2, size_t len2) { |
| | | scpi_bool_t compareStrAndNum(const char * str1, size_t len1, const char * str2, size_t len2, int32_t * num) { |
| | | scpi_bool_t result = FALSE; |
| | | size_t i; |
| | | |
| | |
| | | |
| | | if (SCPIDEFINE_strncasecmp(str1, str2, len1) == 0) { |
| | | result = TRUE; |
| | | } |
| | | |
| | | if (num) { |
| | | if (len1 == len2) { |
| | | *num = 1; |
| | | } else { |
| | | int32_t tmpNum; |
| | | i = len1 + strToLong(str2 + len1, &tmpNum, 10); |
| | | if (i != len2) { |
| | | result = FALSE; |
| | | } else { |
| | | *num = tmpNum; |
| | | } |
| | | } |
| | | } else { |
| | | for (i = len1; i < len2; i++) { |
| | | if (!isdigit(str2[i])) { |
| | | if (!isdigit((int) str2[i])) { |
| | | result = FALSE; |
| | | break; |
| | | } |
| | | } |
| | | } |
| | | } |
| | | |
| | |
| | | * @param str_len |
| | | * @return |
| | | */ |
| | | scpi_bool_t matchPattern(const char * pattern, size_t pattern_len, const char * str, size_t str_len) { |
| | | scpi_bool_t matchPattern(const char * pattern, size_t pattern_len, const char * str, size_t str_len, int32_t * num) { |
| | | int pattern_sep_pos_short; |
| | | |
| | | if (pattern[pattern_len - 1] == '#') { |
| | |
| | | |
| | | pattern_sep_pos_short = patternSeparatorShortPos(pattern, new_pattern_len); |
| | | |
| | | return compareStrAndNum(pattern, new_pattern_len, str, str_len) || |
| | | compareStrAndNum(pattern, pattern_sep_pos_short, str, str_len); |
| | | return compareStrAndNum(pattern, new_pattern_len, str, str_len, num) || |
| | | compareStrAndNum(pattern, pattern_sep_pos_short, str, str_len, num); |
| | | } else { |
| | | |
| | | pattern_sep_pos_short = patternSeparatorShortPos(pattern, pattern_len); |
| | |
| | | * @param len - max search length |
| | | * @return TRUE if pattern matches, FALSE otherwise |
| | | */ |
| | | scpi_bool_t matchCommand(const char * pattern, const char * cmd, size_t len) { |
| | | scpi_bool_t matchCommand(const char * pattern, const char * cmd, size_t len, int32_t *numbers, size_t numbers_len) { |
| | | scpi_bool_t result = FALSE; |
| | | int leftFlag = 0; // flag for '[' on left |
| | | int rightFlag = 0; // flag for ']' on right |
| | | int cmd_sep_pos = 0; |
| | | |
| | | size_t numbers_idx = -1; |
| | | int32_t *number_ptr = NULL; |
| | | |
| | | const char * pattern_ptr = pattern; |
| | | int pattern_len = strlen(pattern); |
| | |
| | | cmd_sep_pos = cmdSeparatorPos(cmd_ptr, cmd_end - cmd_ptr); |
| | | } |
| | | |
| | | if (matchPattern(pattern_ptr, pattern_sep_pos, cmd_ptr, cmd_sep_pos)) { |
| | | if (pattern_ptr[pattern_sep_pos - 1] == '#') { |
| | | numbers_idx++; |
| | | if (numbers && (numbers_idx < numbers_len)) { |
| | | number_ptr = numbers + numbers_idx; |
| | | *number_ptr = 1; // default value |
| | | } else { |
| | | number_ptr = NULL; |
| | | } |
| | | } else { |
| | | number_ptr = NULL; |
| | | } |
| | | |
| | | if (matchPattern(pattern_ptr, pattern_sep_pos, cmd_ptr, cmd_sep_pos, number_ptr)) { |
| | | pattern_ptr = pattern_ptr + pattern_sep_pos; |
| | | cmd_ptr = cmd_ptr + cmd_sep_pos; |
| | | result = TRUE; |
| | |
| | | |
| | | char * strnpbrk(const char *str, size_t size, const char *set) LOCAL; |
| | | scpi_bool_t compareStr(const char * str1, size_t len1, const char * str2, size_t len2) LOCAL; |
| | | scpi_bool_t compareStrAndNum(const char * str1, size_t len1, const char * str2, size_t len2) LOCAL; |
| | | scpi_bool_t compareStrAndNum(const char * str1, size_t len1, const char * str2, size_t len2, int32_t * num) LOCAL; |
| | | size_t strToLong(const char * str, int32_t * val, int8_t base) LOCAL; |
| | | size_t strToDouble(const char * str, double * val) LOCAL; |
| | | scpi_bool_t locateText(const char * str1, size_t len1, const char ** str2, size_t * len2) LOCAL; |
| | | scpi_bool_t locateStr(const char * str1, size_t len1, const char ** str2, size_t * len2) LOCAL; |
| | | size_t skipWhitespace(const char * cmd, size_t len) LOCAL; |
| | | scpi_bool_t matchPattern(const char * pattern, size_t pattern_len, const char * str, size_t str_len) LOCAL; |
| | | scpi_bool_t matchCommand(const char * pattern, const char * cmd, size_t len) LOCAL; |
| | | scpi_bool_t matchPattern(const char * pattern, size_t pattern_len, const char * str, size_t str_len, int32_t * num) LOCAL; |
| | | scpi_bool_t matchCommand(const char * pattern, const char * cmd, size_t len, int32_t *numbers, size_t numbers_len) LOCAL; |
| | | scpi_bool_t composeCompoundCommand(const scpi_token_t * prev, scpi_token_t * current) LOCAL; |
| | | |
| | | #if !HAVE_STRNLEN |
| | |
| | | |
| | | } |
| | | |
| | | |
| | | |
| | | static void test_longToStr() { |
| | | char str[32]; |
| | | size_t len; |
| | |
| | | } |
| | | |
| | | static void test_compareStrAndNum() { |
| | | int32_t num; |
| | | |
| | | CU_ASSERT_TRUE(compareStrAndNum("abcd", 1, "afgh", 1)); |
| | | CU_ASSERT_TRUE(compareStrAndNum("ABCD", 4, "abcd", 4)); |
| | | CU_ASSERT_TRUE(compareStrAndNum("AbCd", 3, "AbCE", 3)); |
| | | CU_ASSERT_TRUE(compareStrAndNum("ABCD", 1, "a", 1)); |
| | | CU_ASSERT_TRUE(compareStrAndNum("abcd", 1, "afgh", 1, NULL)); |
| | | CU_ASSERT_TRUE(compareStrAndNum("ABCD", 4, "abcd", 4, NULL)); |
| | | CU_ASSERT_TRUE(compareStrAndNum("AbCd", 3, "AbCE", 3, NULL)); |
| | | CU_ASSERT_TRUE(compareStrAndNum("ABCD", 1, "a", 1, NULL)); |
| | | |
| | | CU_ASSERT_FALSE(compareStrAndNum("abcd", 1, "efgh", 1)); |
| | | CU_ASSERT_FALSE(compareStrAndNum("ABCD", 4, "abcd", 3)); |
| | | CU_ASSERT_FALSE(compareStrAndNum("abcd", 1, "efgh", 1, NULL)); |
| | | CU_ASSERT_FALSE(compareStrAndNum("ABCD", 4, "abcd", 3, NULL)); |
| | | |
| | | CU_ASSERT_TRUE(compareStrAndNum("abcd", 4, "abcd1", 5)); |
| | | CU_ASSERT_TRUE(compareStrAndNum("abcd", 4, "abcd123", 7)); |
| | | CU_ASSERT_FALSE(compareStrAndNum("abcd", 4, "abcd12A", 7)); |
| | | CU_ASSERT_FALSE(compareStrAndNum("abcd", 4, "abcdB12", 7)); |
| | | CU_ASSERT_FALSE(compareStrAndNum("abdd", 4, "abcd132", 7)); |
| | | CU_ASSERT_TRUE(compareStrAndNum("abcd", 4, "abcd1", 5, NULL)); |
| | | CU_ASSERT_TRUE(compareStrAndNum("abcd", 4, "abcd123", 7, NULL)); |
| | | CU_ASSERT_FALSE(compareStrAndNum("abcd", 4, "abcd12A", 7, NULL)); |
| | | CU_ASSERT_FALSE(compareStrAndNum("abcd", 4, "abcdB12", 7, NULL)); |
| | | CU_ASSERT_FALSE(compareStrAndNum("abdd", 4, "abcd132", 7, NULL)); |
| | | |
| | | #define TEST_COMPARE_STR_AND_NUM(s1, l1, s2, l2, v, r) \ |
| | | do { \ |
| | | num = 0; \ |
| | | CU_ASSERT_EQUAL(compareStrAndNum(s1, l1, s2, l2, &num),r); \ |
| | | CU_ASSERT_EQUAL(num, v); \ |
| | | } while(0); \ |
| | | |
| | | TEST_COMPARE_STR_AND_NUM("abcd", 4, "abcd", 4, 1, TRUE); |
| | | TEST_COMPARE_STR_AND_NUM("abcd", 4, "abcd1", 5, 1, TRUE); |
| | | TEST_COMPARE_STR_AND_NUM("abcd", 4, "abcd123", 7, 123, TRUE); |
| | | TEST_COMPARE_STR_AND_NUM("abcd", 4, "abcd12A", 7, 0, FALSE); |
| | | TEST_COMPARE_STR_AND_NUM("abcd", 4, "abcdB12", 7, 0, FALSE); |
| | | TEST_COMPARE_STR_AND_NUM("abdd", 4, "abcd132", 7, 0, FALSE); |
| | | } |
| | | |
| | | static void test_matchPattern() { |
| | |
| | | |
| | | #define TEST_MATCH_PATTERN(p, s, r) \ |
| | | do { \ |
| | | result = matchPattern(p, strlen(p), s, strlen(s)); \ |
| | | result = matchPattern(p, strlen(p), s, strlen(s), NULL);\ |
| | | CU_ASSERT_EQUAL(result, r); \ |
| | | } while(0) \ |
| | | |
| | |
| | | TEST_MATCH_PATTERN("Ab", "ab", TRUE); |
| | | TEST_MATCH_PATTERN("Ab", "aB", TRUE); |
| | | TEST_MATCH_PATTERN("AB", "a", FALSE); |
| | | TEST_MATCH_PATTERN("Ab#", "aB", TRUE); |
| | | TEST_MATCH_PATTERN("Ab#", "aB10", TRUE); |
| | | TEST_MATCH_PATTERN("Ab#", "a10", TRUE); |
| | | } |
| | | |
| | | static void test_matchCommand() { |
| | | scpi_bool_t result; |
| | | int32_t values[20]; |
| | | |
| | | #define TEST_MATCH_COMMAND(p, s, r) \ |
| | | do { \ |
| | | result = matchCommand(p, s, strlen(s)); \ |
| | | result = matchCommand(p, s, strlen(s), NULL, 0); \ |
| | | CU_ASSERT_EQUAL(result, r); \ |
| | | } while(0) \ |
| | | |
| | | #define TEST_MATCH_COMMAND2(p, s, r, ...) \ |
| | | do { \ |
| | | int32_t evalues[] = {__VA_ARGS__}; \ |
| | | unsigned int cnt = (sizeof(evalues)/4); \ |
| | | result = matchCommand(p, s, strlen(s), values, 20); \ |
| | | CU_ASSERT_EQUAL(result, r); \ |
| | | if (cnt > 0) CU_ASSERT_EQUAL(evalues[0], values[0]); \ |
| | | if (cnt > 1) CU_ASSERT_EQUAL(evalues[1], values[1]); \ |
| | | if (cnt > 2) CU_ASSERT_EQUAL(evalues[2], values[2]); \ |
| | | if (cnt > 3) CU_ASSERT_EQUAL(evalues[3], values[3]); \ |
| | | if (cnt > 4) CU_ASSERT_EQUAL(evalues[4], values[4]); \ |
| | | if (cnt > 5) CU_ASSERT_EQUAL(evalues[5], values[5]); \ |
| | | if (cnt > 6) CU_ASSERT_EQUAL(evalues[6], values[6]); \ |
| | | } while(0) \ |
| | | |
| | | TEST_MATCH_COMMAND("A", "a", TRUE); |
| | |
| | | TEST_MATCH_COMMAND("OUTPut#[:MODulation#]:FM#", "outp1:mod10:fm", TRUE); // test numeric parameter |
| | | TEST_MATCH_COMMAND("OUTPut#[:MODulation#]:FM#", "outp1:fm2", TRUE); // test numeric parameter |
| | | TEST_MATCH_COMMAND("OUTPut#[:MODulation#]:FM#", "output:fm", TRUE); // test numeric parameter |
| | | |
| | | TEST_MATCH_COMMAND2("OUTPut#:MODulation#:FM#", "outp3:mod10:fm", TRUE, 3, 10, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#:MODulation#:FM#", "output3:mod10:fm", TRUE, 3, 10, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#:MODulation#:FM#", "outp30:modulation:fm5", TRUE, 30, 1, 5); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#:MODulation#:FM#", "output:mod:fm", TRUE, 1, 1, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#[:MODulation#]:FM#", "outp3:fm", TRUE, 3, 1, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#[:MODulation#]:FM#", "outp3:mod10:fm", TRUE, 3, 10, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#[:MODulation#]:FM#", "outp3:fm2", TRUE, 3, 1, 2); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#[:MODulation#]:FM#", "output:fm", TRUE, 1, 1, 1); // test numeric parameter |
| | | |
| | | TEST_MATCH_COMMAND2("OUTPut#:MODulation:FM#", "outp3:mod:fm", TRUE, 3, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#:MODulation:FM#", "output3:mod:fm", TRUE, 3, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#:MODulation:FM#", "outp30:modulation:fm5", TRUE, 30, 5); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#:MODulation:FM#", "output:mod:fm", TRUE, 1, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#[:MODulation]:FM#", "outp3:fm", TRUE, 3, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#[:MODulation]:FM#", "outp3:mod:fm", TRUE, 3, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#[:MODulation]:FM#", "outp3:fm2", TRUE, 3, 2); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#[:MODulation]:FM#", "output:fm", TRUE, 1, 1); // test numeric parameter |
| | | |
| | | TEST_MATCH_COMMAND2("OUTPut#:MODulation#:FM", "outp3:mod10:fm", TRUE, 3, 10); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#:MODulation#:FM", "output3:mod10:fm", TRUE, 3, 10); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#:MODulation#:FM", "outp30:modulation:fm", TRUE, 30, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#:MODulation#:FM", "output:mod:fm", TRUE, 1, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#[:MODulation#]:FM", "outp3:fm", TRUE, 3, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#[:MODulation#]:FM", "outp3:mod10:fm", TRUE, 3, 10); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#[:MODulation#]:FM", "outp3:fm", TRUE, 3, 1); // test numeric parameter |
| | | TEST_MATCH_COMMAND2("OUTPut#[:MODulation#]:FM", "output:fm", TRUE, 1, 1); // test numeric parameter |
| | | } |
| | | |
| | | static void test_composeCompoundCommand(void) { |
| | | |
| | | #define TEST_COMPOSE_COMMAND(b, c1_len, c2_pos, c2_len, c2_final, r) \ |
| | | { \ |
| | | char buffer[100]; \ |
| | | scpi_token_t cmd_prev, cmd_curr; \ |
| | | cmd_prev.ptr = buffer; \ |
| | | cmd_prev.len = c1_len; \ |
| | | cmd_curr.ptr = buffer + c2_pos; \ |
| | | cmd_curr.len = c2_len; \ |
| | | scpi_bool_t res; \ |
| | | \ |
| | | strcpy(buffer, b); \ |
| | | res = composeCompoundCommand(&cmd_prev, &cmd_curr); \ |
| | | CU_ASSERT_EQUAL(res, r); \ |
| | | CU_ASSERT_EQUAL(cmd_curr.len, strlen(c2_final)); \ |
| | | CU_ASSERT_STRING_EQUAL(cmd_curr.ptr, c2_final); \ |
| | | }\ |
| | | |
| | | TEST_COMPOSE_COMMAND("A:B;C", 3, 4, 1, "A:C", TRUE); |
| | | TEST_COMPOSE_COMMAND("A:B;DD", 3, 4, 2, "A:DD", TRUE); |
| | | TEST_COMPOSE_COMMAND("A:B", 0, 0, 3, "A:B", TRUE); |
| | | TEST_COMPOSE_COMMAND("*IDN? ; ABC", 5, 8, 3, "ABC", TRUE); |
| | | TEST_COMPOSE_COMMAND("A:B;*IDN?", 3, 4, 5, "*IDN?", TRUE); |
| | | TEST_COMPOSE_COMMAND("A:B;:C", 3, 4, 2, ":C", TRUE); |
| | | TEST_COMPOSE_COMMAND("B;C", 1, 2, 1, "C", TRUE); |
| | | TEST_COMPOSE_COMMAND("A:B;C:D", 3, 4, 3, "A:C:D", TRUE); |
| | | TEST_COMPOSE_COMMAND(":A:B;C", 4, 5, 1, ":A:C", TRUE); |
| | | TEST_COMPOSE_COMMAND(":A:B;:C", 4, 5, 2, ":C", TRUE); |
| | | TEST_COMPOSE_COMMAND(":A;C", 2, 3, 1, ":C", TRUE); |
| | | } |
| | | |
| | | int main() { |
| | |
| | | || (NULL == CU_add_test(pSuite, "compareStrAndNum", test_compareStrAndNum)) |
| | | || (NULL == CU_add_test(pSuite, "matchPattern", test_matchPattern)) |
| | | || (NULL == CU_add_test(pSuite, "matchCommand", test_matchCommand)) |
| | | || (NULL == CU_add_test(pSuite, "composeCompoundCommand", test_composeCompoundCommand)) |
| | | ) { |
| | | CU_cleanup_registry(); |
| | | return CU_get_error(); |