/* * Copyright (C) 2002 - 2005 Tomasz Kojm * cli_strrcpy(): Copyright (C) 2002 Nigel Horne * cli_strtokenize(): Copyright (C) 2007 Edwin Torok * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, * MA 02110-1301, USA. */ #if HAVE_CONFIG_H #include "clamav-config.h" #endif #include "str.h" #include #include #include #include #include #include "clamav.h" #include "others.h" #include "matcher.h" #include "cltypes.h" static int cli_hex2int(int c) { int l; if(!isascii(c)) return -1; if(isdigit(c)) return c - '0'; l = tolower(c); if((l >= 'a') && (l <= 'f')) return l + 10 - 'a'; cli_errmsg("hex2int() translation problem (%d)\n", l); return -1; } uint16_t *cli_hex2ui(const char *hex) { uint16_t *str, *ptr, val; unsigned int i, len; int c; len = strlen(hex); if(len % 2 != 0) { cli_errmsg("cli_hex2si(): Malformed hexstring: %s (length: %u)\n", hex, len); return NULL; } str = cli_calloc((len / 2) + 1, sizeof(uint16_t)); if(!str) return NULL; ptr = str; for(i = 0; i < len; i += 2) { val = 0; if(hex[i] == '?' && hex[i + 1] == '?') { val |= CLI_MATCH_IGNORE; } else if(hex[i + 1] == '?') { if((c = cli_hex2int(hex[i])) >= 0) { val = c << 4; } else { free(str); return NULL; } val |= CLI_MATCH_NIBBLE_HIGH; } else if(hex[i] == '?') { if((c = cli_hex2int(hex[i + 1])) >= 0) { val = c; } else { free(str); return NULL; } val |= CLI_MATCH_NIBBLE_LOW; } else if(hex[i] == '(') { val |= CLI_MATCH_ALTERNATIVE; } else { if((c = cli_hex2int(hex[i])) >= 0) { val = c; if((c = cli_hex2int(hex[i+1])) >= 0) { val = (val << 4) + c; } else { free(str); return NULL; } } else { free(str); return NULL; } } *ptr++ = val; } return str; } char *cli_hex2str(const char *hex) { char *str, *ptr, val, c; int i, len; len = strlen(hex); if(len % 2 != 0) { cli_errmsg("cli_hex2str(): Malformed hexstring: %s (length: %d)\n", hex, len); return NULL; } str = cli_calloc((len / 2) + 1, sizeof(char)); if(!str) return NULL; ptr = str; for(i = 0; i < len; i += 2) { if((c = cli_hex2int(hex[i])) >= 0) { val = c; if((c = cli_hex2int(hex[i+1])) >= 0) { val = (val << 4) + c; } else { free(str); return NULL; } } else { free(str); return NULL; } *ptr++ = val; } return str; } int cli_hex2num(const char *hex) { int hexval, ret = 0, len, i; len = strlen(hex); if(len % 2 != 0) { cli_errmsg("cli_hex2num(): Malformed hexstring: %s (length: %d)\n", hex, len); return -1; } for(i = 0; i < len; i++) { if((hexval = cli_hex2int(hex[i])) < 0) break; ret = (ret << 4) | hexval; } return ret; } char *cli_str2hex(const char *string, unsigned int len) { char *hexstr; char HEX[] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f' }; unsigned int i, j; if((hexstr = (char *) cli_calloc(2 * len + 1, sizeof(char))) == NULL) return NULL; for(i = 0, j = 0; i < len; i++, j += 2) { hexstr[j] = HEX[(string[i] >> 4) & 0xf]; hexstr[j + 1] = HEX[string[i] & 0xf]; } return hexstr; } char *cli_utf16toascii(const char *str, unsigned int length) { char *decoded; unsigned int i, j; if(length < 2) { cli_warnmsg("cli_utf16toascii: length < 2\n"); return NULL; } if(length % 2) length--; if(!(decoded = cli_calloc(length / 2 + 1, sizeof(char)))) return NULL; for(i = 0, j = 0; i < length; i += 2, j++) { decoded[j] = str[i + 1] << 4; decoded[j] += str[i]; } return decoded; } int cli_strbcasestr(const char *haystack, const char *needle) { const char *pt = haystack; int i, j; i = strlen(haystack); j = strlen(needle); if(i < j) return 0; pt += i - j; return !strcasecmp(pt, needle); } /* * Remove trailing NL and CR characters from the end of the given string. * Return the new length of the string (ala strlen) */ int cli_chomp(char *string) { int l; if(string == NULL) return -1; l = strlen(string); if(l == 0) return 0; --l; while((l >= 0) && ((string[l] == '\n') || (string[l] == '\r'))) string[l--] = '\0'; return l + 1; } /* * char *cli_strok(const char *line, int fieldno, char *delim) * Return a copy of field from the string , where * fields are delimited by any char from , or NULL if * doesn't have fields or not enough memory is available. * The caller has to free() the result afterwards. */ char *cli_strtok(const char *line, int fieldno, const char *delim) { int counter = 0, i, j; char *buffer = NULL; /* step to arg # */ for (i=0; line[i] && counter != fieldno; i++) { if (strchr(delim, line[i])) { counter++; while(line[i+1] && strchr(delim, line[i+1])) { i++; } } } if (!line[i]) { /* end of buffer before field reached */ return NULL; } for (j=i; line[j]; j++) { if (strchr(delim, line[j])) { break; } } if (i == j) { return NULL; } buffer = cli_malloc(j-i+1); if(!buffer) return NULL; strncpy(buffer, line+i, j-i); buffer[j-i] = '\0'; return buffer; } /* * Like cli_strtok, but this puts the output into a given argument, rather * than allocating fresh memory * Returns NULL for error, or a pointer to output * njh@bandsman.co.uk */ char *cli_strtokbuf(const char *input, int fieldno, const char *delim, char *output) { int counter = 0, i, j; /* step to arg # */ for (i=0; input[i] && counter != fieldno; i++) { if (strchr(delim, input[i])) { counter++; while(input[i+1] && strchr(delim, input[i+1])) { i++; } } } if (input[i] == '\0') { /* end of buffer before field reached */ return NULL; } for (j=i; input[j]; j++) { if (strchr(delim, input[j])) { break; } } if (i == j) { return NULL; } strncpy(output, input+i, j-i); output[j-i] = '\0'; return output; } const char *cli_memstr(const char *haystack, int hs, const char *needle, int ns) { const char *pt, *hay; int n; if(hs < ns) return NULL; if(haystack == needle) return haystack; if(!memcmp(haystack, needle, ns)) return haystack; pt = hay = haystack; n = hs; while((pt = memchr(hay, needle[0], n)) != NULL) { n -= (int) (pt - hay); if(n < ns) break; if(!memcmp(pt, needle, ns)) return pt; if(hay == pt) { n--; hay++; } else { hay = pt; } } return NULL; } char *cli_strrcpy(char *dest, const char *source) /* by NJH */ { if(!dest || !source) { cli_errmsg("cli_strrcpy: NULL argument\n"); return NULL; } while((*dest++ = *source++)); return --dest; } void cli_strtokenize(char *buffer, const char delim, const size_t token_count, const char **tokens) { size_t tokens_found; for(tokens_found = 0; tokens_found < token_count; ) { tokens[tokens_found++] = buffer; buffer = strchr(buffer, delim); if(buffer) { *buffer++ = '\0'; } else { while(tokens_found < token_count) tokens[tokens_found++] = NULL; return; } } }