| | |
| | | /*- |
| | | * Copyright (c) 2012-2013 Jan Breuer, |
| | | * Copyright (c) 2013 Jan Breuer |
| | | * Richard.hmm |
| | | * Copyright (c) 2012 Jan Breuer |
| | | * |
| | | * All Rights Reserved |
| | | * |
| | |
| | | #include "utils.h" |
| | | |
| | | static size_t patternSeparatorShortPos(const char * pattern, size_t len); |
| | | static size_t patternSeparatorPos(const char * pattern, size_t len); |
| | | static size_t cmdSeparatorPos(const char * cmd, size_t len); |
| | | |
| | | /** |
| | | * Find the first occurrence in str of a character in set. |
| | |
| | | * @param len string buffer length |
| | | * @return number of bytes written to str (without '\0') |
| | | */ |
| | | size_t longToStr(int32_t val, char * str, size_t len) { |
| | | // TODO: add support for other bases |
| | | |
| | | size_t longToStr(int32_t val, char * str, size_t len, int8_t base) { |
| | | uint32_t x = 1000000000L; |
| | | int_fast8_t digit; |
| | | size_t pos = 0; |
| | |
| | | * @param val 32bit integer result |
| | | * @return number of bytes used in string |
| | | */ |
| | | size_t strToLong(const char * str, int32_t * val) { |
| | | size_t strToLong(const char * str, int32_t * val, int8_t base) { |
| | | char * endptr; |
| | | *val = strtol(str, &endptr, 0); |
| | | *val = strtol(str, &endptr, base); |
| | | return endptr - str; |
| | | } |
| | | |
| | |
| | | return FALSE; |
| | | } |
| | | |
| | | if (strncasecmp(str1, str2, len2) == 0) { |
| | | if (SCPI_strncasecmp(str1, str2, len2) == 0) { |
| | | return TRUE; |
| | | } |
| | | |
| | | return FALSE; |
| | | } |
| | | |
| | | bool_t locateText(const char * str1, size_t len1, char ** str2, size_t * len2) { |
| | | size_t i; |
| | | int quot = 0; |
| | | int32_t strStart = -1; |
| | | int32_t strStop = -1; |
| | | int valid = 0; |
| | | |
| | | |
| | | for (i = 0; i < len1; i++) { |
| | | if ((strStart < 0) && isspace((unsigned char)str1[i])) { |
| | | continue; |
| | | } |
| | | |
| | | if ((strStart < 0) && !quot && (str1[i] == '"')) { |
| | | quot = 1; |
| | | continue; |
| | | } |
| | | |
| | | if (strStart < 0) { |
| | | strStart = i; |
| | | } |
| | | |
| | | if ((strStop < 0) && quot && (str1[i] == '"')) { |
| | | strStop = i; |
| | | valid = 1; |
| | | continue; |
| | | } |
| | | |
| | | if ((strStop >= 0) && quot && (str1[i] == ',')) { |
| | | break; |
| | | } |
| | | |
| | | if ((strStop >= 0) && quot && !isspace((unsigned char)str1[i])) { |
| | | valid = 0; |
| | | } |
| | | |
| | | if (!quot && !isspace((unsigned char)str1[i]) && (str1[i] != ',')) { |
| | | strStop = i; |
| | | } |
| | | |
| | | if (isspace((unsigned char)str1[i])) { |
| | | continue; |
| | | } |
| | | |
| | | if ((strStop >= 0) && (str1[i] == ',')) { |
| | | valid = 1; |
| | | break; |
| | | } |
| | | } |
| | | |
| | | if ((i == len1) && !quot) { |
| | | valid = 1; |
| | | if (strStop < 0) { |
| | | strStop = i; |
| | | } else { |
| | | strStop++; |
| | | } |
| | | if (strStart < 0) { |
| | | strStart = i; |
| | | } |
| | | } else if (!quot) { |
| | | strStop++; |
| | | } |
| | | |
| | | |
| | | if (valid) { |
| | | if (str2) { |
| | | *str2 = (char *) &str1[strStart]; |
| | | } |
| | | |
| | | if (len2) { |
| | | *len2 = strStop - strStart; |
| | | } |
| | | } |
| | | |
| | | return valid; |
| | | } |
| | | |
| | | bool_t locateStr(const char * str1, size_t len1, char ** str2, size_t * len2) { |
| | | size_t i; |
| | | int32_t strStart = -1; |
| | | int32_t strStop = -1; |
| | | int valid = 0; |
| | | |
| | | |
| | | for (i = 0; i < len1; i++) { |
| | | if ((strStart < 0) && isspace((unsigned char)str1[i])) { |
| | | continue; |
| | | } |
| | | |
| | | if (strStart < 0) { |
| | | strStart = i; |
| | | } |
| | | |
| | | if (!isspace((unsigned char)str1[i]) && (str1[i] != ',')) { |
| | | strStop = i; |
| | | } |
| | | |
| | | if (isspace((unsigned char)str1[i])) { |
| | | continue; |
| | | } |
| | | |
| | | if (str1[i] == ',') { |
| | | valid = 1; |
| | | |
| | | if (strStop < 0) { |
| | | strStop = i; |
| | | } |
| | | break; |
| | | } |
| | | } |
| | | |
| | | if (i == len1) { |
| | | valid = 1; |
| | | if (strStop < 0) { |
| | | strStop = i; |
| | | } else { |
| | | strStop++; |
| | | } |
| | | if (strStart < 0) { |
| | | strStart = i; |
| | | } |
| | | } else { |
| | | strStop++; |
| | | } |
| | | |
| | | |
| | | if (valid) { |
| | | if (str2) { |
| | | *str2 = (char *) &str1[strStart]; |
| | | } |
| | | |
| | | if (len2) { |
| | | *len2 = strStop - strStart; |
| | | } |
| | | } |
| | | |
| | | return valid; |
| | | } |
| | | |
| | | /** |
| | |
| | | size_t skipWhitespace(const char * cmd, size_t len) { |
| | | size_t i; |
| | | for (i = 0; i < len; i++) { |
| | | if (!isspace((unsigned char)cmd[i])) { |
| | | if (!isspace((unsigned char) cmd[i])) { |
| | | return i; |
| | | } |
| | | } |
| | | return len; |
| | | } |
| | | |
| | | |
| | | /** |
| | | * Pattern is composed from upper case an lower case letters. This function |
| | |
| | | size_t patternSeparatorShortPos(const char * pattern, size_t len) { |
| | | size_t i; |
| | | for (i = 0; (i < len) && pattern[i]; i++) { |
| | | if (islower((unsigned char)pattern[i])) { |
| | | if (islower((unsigned char) pattern[i])) { |
| | | return i; |
| | | } |
| | | } |
| | | return i; |
| | | } |
| | | |
| | | /** |
| | | * Find pattern separator position |
| | | * @param pattern |
| | | * @param len - max search length |
| | | * @return position of separator or len |
| | | */ |
| | | size_t patternSeparatorPos(const char * pattern, size_t len) { |
| | | |
| | | char * separator = strnpbrk(pattern, len, "?:[]"); |
| | | if (separator == NULL) { |
| | | return len; |
| | | } else { |
| | | return separator - pattern; |
| | | } |
| | | } |
| | | |
| | | /** |
| | | * Find command separator position |
| | | * @param cmd - input command |
| | | * @param len - max search length |
| | | * @return position of separator or len |
| | | */ |
| | | size_t cmdSeparatorPos(const char * cmd, size_t len) { |
| | | char * separator = strnpbrk(cmd, len, ":?"); |
| | | size_t result; |
| | | if (separator == NULL) { |
| | | result = len; |
| | | } else { |
| | | result = separator - cmd; |
| | | } |
| | | |
| | | return result; |
| | | } |
| | | |
| | | /** |
| | |
| | | return compareStr(pattern, pattern_len, str, str_len) || |
| | | compareStr(pattern, pattern_sep_pos_short, str, str_len); |
| | | } |
| | | |
| | | /** |
| | | * Compare pattern and command |
| | | * @param pattern |
| | | * @param cmd - command |
| | | * @param len - max search length |
| | | * @return TRUE if pattern matches, FALSE otherwise |
| | | */ |
| | | bool_t matchCommand(const char * pattern, const char * cmd, size_t len) { |
| | | bool_t result = FALSE; |
| | | int leftFlag = 0; // flag for '[' on left |
| | | int rightFlag = 0; // flag for ']' on right |
| | | |
| | | const char * pattern_ptr = pattern; |
| | | int pattern_len = strlen(pattern); |
| | | const char * pattern_end = pattern + pattern_len; |
| | | |
| | | const char * cmd_ptr = cmd; |
| | | size_t cmd_len = SCPI_strnlen(cmd, len); |
| | | const char * cmd_end = cmd + cmd_len; |
| | | |
| | | /* TODO: now support optional keywords in pattern style, e.g. [:MEASure]:VOLTage:DC? */ |
| | | if (pattern_ptr[0] == '[') { // skip first '[' |
| | | pattern_len--; |
| | | pattern_ptr++; |
| | | leftFlag++; |
| | | } |
| | | if (pattern_ptr[0] == ':') { // skip first ':' |
| | | pattern_len--; |
| | | pattern_ptr++; |
| | | } |
| | | |
| | | /* errornouse ":*IDN?" is handled in parser */ |
| | | if (cmd_ptr[0] == ':') { |
| | | cmd_len--; |
| | | cmd_ptr++; |
| | | } |
| | | |
| | | while (1) { |
| | | int pattern_sep_pos = patternSeparatorPos(pattern_ptr, pattern_end - pattern_ptr); |
| | | int cmd_sep_pos; |
| | | |
| | | if ((leftFlag > 0) && (rightFlag > 0)) { |
| | | leftFlag--; |
| | | rightFlag--; |
| | | } else { |
| | | cmd_sep_pos = cmdSeparatorPos(cmd_ptr, cmd_end - cmd_ptr); |
| | | } |
| | | |
| | | if (matchPattern(pattern_ptr, pattern_sep_pos, cmd_ptr, cmd_sep_pos)) { |
| | | pattern_ptr = pattern_ptr + pattern_sep_pos; |
| | | cmd_ptr = cmd_ptr + cmd_sep_pos; |
| | | result = TRUE; |
| | | |
| | | /* command is complete */ |
| | | if ((pattern_ptr == pattern_end) && (cmd_ptr >= cmd_end)) { |
| | | break; |
| | | } |
| | | |
| | | /* pattern complete, but command not */ |
| | | if ((pattern_ptr == pattern_end) && (cmd_ptr < cmd_end)) { |
| | | result = FALSE; |
| | | break; |
| | | } |
| | | |
| | | /* command complete, but pattern not */ |
| | | if (cmd_ptr >= cmd_end) { |
| | | if (cmd_end == cmd_ptr) { |
| | | if (cmd_ptr[0] == pattern_ptr[pattern_end - pattern_ptr - 1]) { |
| | | break; /* exist optional keyword, command is complete */ |
| | | } |
| | | if (']' == pattern_ptr[pattern_end - pattern_ptr - 1]) { |
| | | break; /* exist optional keyword, command is complete */ |
| | | } |
| | | } |
| | | result = FALSE; |
| | | break; |
| | | } |
| | | |
| | | /* both command and patter contains command separator at this position */ |
| | | if ((pattern_ptr[0] == cmd_ptr[0]) && ((pattern_ptr[0] == ':') || (pattern_ptr[0] == '?'))) { |
| | | pattern_ptr = pattern_ptr + 1; |
| | | cmd_ptr = cmd_ptr + 1; |
| | | } else if ((pattern_ptr[1] == cmd_ptr[0]) |
| | | && (pattern_ptr[0] == '[') |
| | | && (pattern_ptr[1] == ':')) { |
| | | pattern_ptr = pattern_ptr + 2; // for skip '[' in "[:" |
| | | cmd_ptr = cmd_ptr + 1; |
| | | leftFlag++; |
| | | } else if ((pattern_ptr[1] == cmd_ptr[0]) |
| | | && (pattern_ptr[0] == ']') |
| | | && (pattern_ptr[1] == ':')) { |
| | | pattern_ptr = pattern_ptr + 2; // for skip ']' in "]:" |
| | | cmd_ptr = cmd_ptr + 1; |
| | | } else if ((pattern_ptr[2] == cmd_ptr[0]) |
| | | && (pattern_ptr[0] == ']') |
| | | && (pattern_ptr[1] == '[') |
| | | && (pattern_ptr[2] == ':')) { |
| | | pattern_ptr = pattern_ptr + 3; // for skip '][' in "][:" |
| | | cmd_ptr = cmd_ptr + 1; |
| | | leftFlag++; |
| | | } else if (((pattern_ptr[0] == ']') |
| | | || (pattern_ptr[0] == '[')) |
| | | && (*(pattern_end - 1) == '?') // last is '?' |
| | | && (cmd_ptr[0] == '?')) { |
| | | result = TRUE; // exist optional keyword, and they are end with '?' |
| | | break; // command is complete OK |
| | | } else { |
| | | result = FALSE; |
| | | break; |
| | | } |
| | | } else { |
| | | pattern_ptr = pattern_ptr + pattern_sep_pos; |
| | | if ((pattern_ptr[0] == ']') && (pattern_ptr[1] == ':')) { |
| | | pattern_ptr = pattern_ptr + 2; // for skip ']' in "]:" , pattern_ptr continue, while cmd_ptr remain unchanged |
| | | rightFlag++; |
| | | } else if ((pattern_ptr[0] == ']') |
| | | && (pattern_ptr[1] == '[') |
| | | && (pattern_ptr[2] == ':')) { |
| | | pattern_ptr = pattern_ptr + 3; // for skip ']' in "][:" , pattern_ptr continue, while cmd_ptr remain unchanged |
| | | rightFlag++; |
| | | } else { |
| | | result = FALSE; |
| | | break; |
| | | } |
| | | } |
| | | } |
| | | |
| | | return result; |
| | | } |
| | | |
| | | |
| | | #if !HAVE_STRNLEN |
| | | /* use FreeBSD strnlen */ |
| | | |
| | | /*- |
| | | * Copyright (c) 2009 David Schultz <das@FreeBSD.org> |
| | | * All rights reserved. |
| | | */ |
| | | size_t |
| | | BSD_strnlen(const char *s, size_t maxlen) { |
| | | size_t len; |
| | | |
| | | for (len = 0; len < maxlen; len++, s++) { |
| | | if (!*s) |
| | | break; |
| | | } |
| | | return (len); |
| | | } |
| | | #endif |
| | | |