/* * ***** BEGIN LICENSE BLOCK ***** Copyright (C) 2009-2018 Olof Hagsand and Benny Holmgren This file is part of CLIXON. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. Alternatively, the contents of this file may be used under the terms of the GNU General Public License Version 3 or later (the "GPL"), in which case the provisions of the GPL are applicable instead of those above. If you wish to allow use of your version of this file only under the terms of the GPL, and not to allow others to use your version of this file under the terms of Apache License version 2, indicate your decision by deleting the provisions above and replace them with the notice and other provisions required by the GPL. If you do not delete the provisions above, a recipient may use your version of this file under the terms of any one of the Apache License version 2 or the GPL. ***** END LICENSE BLOCK ***** */ /* Error handling: dont use clicon_err, treat as unix system calls. That is, ensure errno is set and return -1/NULL */ #ifdef HAVE_CONFIG_H #include "clixon_config.h" #endif #include #include #include #include #include #include #include #include /* clicon */ #include "clixon_queue.h" #include "clixon_string.h" #include "clixon_err.h" /*! Split string into a vector based on character delimiters. Using malloc * * The given string is split into a vector where the delimiter can be * any of the characters in the specified delimiter string. * * The vector returned is one single memory block that must be freed * by the caller * * @code * char **vec = NULL; * int nvec; * if ((vec = clicon_strsep("/home/user/src/clixon", "/", &nvec)) == NULL) * err; * for (i=0; i 2 && isxdigit(esc[i+1]) && isxdigit(esc[i+2])){ hstr[0] = esc[i+1]; hstr[1] = esc[i+2]; hstr[2] = 0; str[j] = strtoul(hstr, &ptr, 16); i += 2; } else str[j] = esc[i]; j++; } str[j++] = '\0'; *strp = str; retval = 0; done: if (retval < 0 && str) free(str); return retval; } /*! Escape characters according to XML definition * @param[in] str Not-encoded input string * @param[out] escp Encoded/escaped malloced output string * @retval 0 OK * @retval -1 Error * @see https://www.w3.org/TR/2008/REC-xml-20081126/#syntax chapter 2.6 * @see uri_percent_encode * @see AMPERSAND mode in clixon_xml_parse.l * @code * char *encstr = NULL; * char *val = "a<>b"; * if (xml_chardata_encode(str, &encstr) < 0) * err; * if (encstr) * free(encstr); * @endcode * Essentially encode as follows: * & -> "& " must * < -> "< " must * > -> "> " must for backward compatibility * ' -> "' " may * ' -> "" " may * Optionally > */ int xml_chardata_encode(char *str, char **escp) { int retval = -1; char *esc = NULL; int l; int len; int i, j; int cdata; /* when set, skip encoding */ /* First compute length (do nothing) */ len = 0; cdata = 0; for (i=0; i", strlen("]]>")) == 0) cdata = 0; len++; } else switch (str[i]){ case '&': len += strlen("& "); break; case '<': if (strncmp(&str[i], "': len += strlen("> "); break; default: len++; } } len++; /* trailing \0 */ /* We know length, allocate encoding buffer */ if ((esc = malloc(len)) == NULL){ clicon_err(OE_UNIX, errno, "malloc"); goto done; } memset(esc, 0, len); /* Same code again, but now actually encode into output buffer */ j = 0; cdata = 0; for (i=0; i", strlen("]]>")) == 0){ cdata = 0; esc[j++] = str[i++]; esc[j++] = str[i++]; } esc[j++] = str[i]; } else switch (str[i]){ case '&': if ((l=snprintf(&esc[j], 7, "& ")) < 0){ clicon_err(OE_UNIX, errno, "snprintf"); goto done; } j += l; break; case '<': if (strncmp(&str[i], "': if ((l=snprintf(&esc[j], 6, "> ")) < 0){ clicon_err(OE_UNIX, errno, "snprintf"); goto done; } j += l; break; default: esc[j++] = str[i]; } } *escp = esc; retval = 0; done: if (retval < 0 && esc) free(esc); return retval; } /*! Split a string into a cligen variable vector using 1st and 2nd delimiter * Split a string first into elements delimited by delim1, then into * pairs delimited by delim2. * @param[in] string String to split * @param[in] delim1 First delimiter char that delimits between elements * @param[in] delim2 Second delimiter char for pairs within an element * @param[out] cvp Created cligen variable vector, deallocate w cvec_free * @retval 0 on OK * @retval -1 error * * @example, * Assuming delim1 = '&' and delim2 = '=' * a=b&c=d -> [[a,"b"][c="d"] * kalle&c=d -> [[c="d"]] # Discard elements with no delim2 * XXX differentiate between error and null cvec. */ int str2cvec(char *string, char delim1, char delim2, cvec **cvp) { int retval = -1; char *s; char *s0 = NULL;; char *val; /* value */ char *valu; /* unescaped value */ char *snext; /* next element in string */ cvec *cvv = NULL; cg_var *cv; if ((s0 = strdup(string)) == NULL){ clicon_err(OE_UNIX, errno, "strdup"); goto err; } s = s0; if ((cvv = cvec_new(0)) ==NULL){ clicon_err(OE_UNIX, errno, "cvec_new"); goto err; } while (s != NULL) { /* * In the pointer algorithm below: * name1=val1; name2=val2; * ^ ^ ^ * | | | * s val snext */ if ((snext = index(s, delim1)) != NULL) *(snext++) = '\0'; if ((val = index(s, delim2)) != NULL){ *(val++) = '\0'; if (uri_percent_decode(val, &valu) < 0) goto err; if ((cv = cvec_add(cvv, CGV_STRING)) == NULL){ clicon_err(OE_UNIX, errno, "cvec_add"); goto err; } while ((strlen(s) > 0) && isblank(*s)) s++; cv_name_set(cv, s); cv_string_set(cv, valu); free(valu); valu = NULL; } else{ if (strlen(s)){ if ((cv = cvec_add(cvv, CGV_STRING)) == NULL){ clicon_err(OE_UNIX, errno, "cvec_add"); goto err; } cv_name_set(cv, s); cv_string_set(cv, ""); } } s = snext; } retval = 0; done: *cvp = cvv; if (s0) free(s0); return retval; err: if (cvv){ cvec_free(cvv); cvv = NULL; } goto done; } /*! Map from int to string using str2int map * @param[in] ms String, integer map * @param[in] i Input integer * @retval str String value * @retval NULL Error, not found * @note linear search */ const char * clicon_int2str(const map_str2int *mstab, int i) { const struct map_str2int *ms; for (ms = &mstab[0]; ms->ms_str; ms++) if (ms->ms_int == i) return ms->ms_str; return NULL; } /*! Map from string to int using str2int map * @param[in] ms String, integer map * @param[in] str Input string * @retval int Value * @retval -1 Error, not found * @note linear search */ int clicon_str2int(const map_str2int *mstab, char *str) { const struct map_str2int *ms; for (ms = &mstab[0]; ms->ms_str; ms++) if (strcmp(ms->ms_str, str) == 0) return ms->ms_int; return -1; } /*! strndup() for systems without it, such as xBSD */ #ifndef HAVE_STRNDUP char * clicon_strndup(const char *str, size_t len) { char *new; size_t slen; slen = strlen(str); len = (len < slen ? len : slen); new = malloc(len + 1); if (new == NULL) return NULL; new[len] = '\0'; memcpy(new, str, len); return new; } #endif /* ! HAVE_STRNDUP */ /* * Turn this on for uni-test programs * Usage: clixon_string join * Example compile: gcc -g -o clixon_string -I. -I../clixon ./clixon_string.c -lclixon -lcligen * Example run: */ #if 0 /* Test program */ static int usage(char *argv0) { fprintf(stderr, "usage:%s \n", argv0); exit(0); } int main(int argc, char **argv) { int nvec; char **vec; char *str0; char *str1; int i; if (argc != 2){ usage(argv[0]); return 0; } str0 = argv[1]; if ((vec = clicon_strsep(str0, " \t", &nvec)) == NULL) return -1; fprintf(stderr, "nvec: %d\n", nvec); for (i=0; i