2 Unix SMB/CIFS implementation.
3 Samba utility functions
5 Copyright (C) Andrew Tridgell 1992-2001
6 Copyright (C) Simo Sorce 2001-2002
7 Copyright (C) Martin Pool 2003
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
28 * @brief String utilities.
32 * Get the next token from a string, return False if none found.
33 * Handles double-quotes.
35 * Based on a routine by GJC@VILLAGE.COM.
36 * Extensively modified by Andrew.Tridgell@anu.edu.au
38 BOOL next_token(const char **ptr,char *buff, const char *sep, size_t bufsize)
50 /* default to simple separators */
54 /* find the first non sep char */
55 while (*s && strchr_m(sep,*s))
62 /* copy over the token */
64 for (quoted = False; len < bufsize && *s && (quoted || !strchr_m(sep,*s)); s++) {
73 *ptr = (*s) ? s+1 : s;
80 This is like next_token but is not re-entrant and "remembers" the first
81 parameter so you can pass NULL. This is useful for user interface code
82 but beware the fact that it is not re-entrant!
85 static const char *last_ptr=NULL;
87 BOOL next_token_nr(const char **ptr,char *buff, const char *sep, size_t bufsize)
93 ret = next_token(ptr, buff, sep, bufsize);
98 static uint16 tmpbuf[sizeof(pstring)];
100 void set_first_token(char *ptr)
106 Convert list of tokens to array; dependent on above routine.
107 Uses last_ptr from above - bit of a hack.
110 char **toktocliplist(int *ctok, const char *sep)
112 char *s=(char *)last_ptr;
119 while(*s && strchr_m(sep,*s))
128 while(*s && (!strchr_m(sep,*s)))
130 while(*s && strchr_m(sep,*s))
137 if (!(ret=iret=SMB_MALLOC_ARRAY(char *,ictok+1)))
155 * Case insensitive string compararison.
157 * iconv does not directly give us a way to compare strings in
158 * arbitrary unix character sets -- all we can is convert and then
159 * compare. This is expensive.
161 * As an optimization, we do a first pass that considers only the
162 * prefix of the strings that is entirely 7-bit. Within this, we
163 * check whether they have the same value.
165 * Hopefully this will often give the answer without needing to copy.
166 * In particular it should speed comparisons to literal ascii strings
167 * or comparisons of strings that are "obviously" different.
169 * If we find a non-ascii character we fall back to converting via
172 * This should never be slower than convering the whole thing, and
175 * A different optimization would be to compare for bitwise equality
176 * in the binary encoding. (It would be possible thought hairy to do
177 * both simultaneously.) But in that case if they turn out to be
178 * different, we'd need to restart the whole thing.
180 * Even better is to implement strcasecmp for each encoding and use a
183 int StrCaseCmp(const char *s, const char *t)
186 const char * ps, * pt;
188 smb_ucs2_t *buffer_s, *buffer_t;
191 for (ps = s, pt = t; ; ps++, pt++) {
195 return 0; /* both ended */
197 return -1; /* s is a prefix */
199 return +1; /* t is a prefix */
200 else if ((*ps & 0x80) || (*pt & 0x80))
201 /* not ascii anymore, do it the hard way from here on in */
214 size = push_ucs2_allocate(&buffer_s, s);
215 if (size == (size_t)-1) {
217 /* Not quite the right answer, but finding the right one
218 under this failure case is expensive, and it's pretty close */
221 size = push_ucs2_allocate(&buffer_t, t);
222 if (size == (size_t)-1) {
225 /* Not quite the right answer, but finding the right one
226 under this failure case is expensive, and it's pretty close */
229 ret = strcasecmp_w(buffer_s, buffer_t);
237 Case insensitive string compararison, length limited.
239 int StrnCaseCmp(const char *s, const char *t, size_t n)
242 unix_strupper(s, strlen(s)+1, buf1, sizeof(buf1));
243 unix_strupper(t, strlen(t)+1, buf2, sizeof(buf2));
244 return strncmp(buf1,buf2,n);
250 * @note The comparison is case-insensitive.
252 BOOL strequal(const char *s1, const char *s2)
259 return(StrCaseCmp(s1,s2)==0);
263 * Compare 2 strings up to and including the nth char.
265 * @note The comparison is case-insensitive.
267 BOOL strnequal(const char *s1,const char *s2,size_t n)
271 if (!s1 || !s2 || !n)
274 return(StrnCaseCmp(s1,s2,n)==0);
278 Compare 2 strings (case sensitive).
281 BOOL strcsequal(const char *s1,const char *s2)
288 return(strcmp(s1,s2)==0);
292 Do a case-insensitive, whitespace-ignoring string compare.
295 int strwicmp(const char *psz1, const char *psz2)
297 /* if BOTH strings are NULL, return TRUE, if ONE is NULL return */
298 /* appropriate value. */
301 else if (psz1 == NULL)
303 else if (psz2 == NULL)
306 /* sync the strings on first non-whitespace */
308 while (isspace((int)*psz1))
310 while (isspace((int)*psz2))
312 if (toupper(*psz1) != toupper(*psz2) || *psz1 == '\0'
318 return (*psz1 - *psz2);
323 Convert a string to upper case, but don't modify it.
326 char *strupper_static(const char *s)
337 Convert a string to "normal" form.
340 void strnorm(char *s, int case_default)
342 if (case_default == CASE_UPPER)
349 Check if a string is in "normal" case.
352 BOOL strisnormal(const char *s, int case_default)
354 if (case_default == CASE_UPPER)
355 return(!strhaslower(s));
357 return(!strhasupper(s));
363 NOTE: oldc and newc must be 7 bit characters
366 void string_replace( pstring s, char oldc, char newc )
370 /* this is quite a common operation, so we want it to be
371 fast. We optimise for the ascii case, knowing that all our
372 supported multi-byte character sets are ascii-compatible
373 (ie. they match for the first 128 chars) */
375 for (p = s; *p; p++) {
376 if (*p & 0x80) /* mb string - slow path. */
385 /* Slow (mb) path. */
386 #ifdef BROKEN_UNICODE_COMPOSE_CHARACTERS
387 /* With compose characters we must restart from the beginning. JRA. */
390 push_ucs2(NULL, tmpbuf, p, sizeof(tmpbuf), STR_TERMINATE);
391 string_replace_w(tmpbuf, UCS2_CHAR(oldc), UCS2_CHAR(newc));
392 pull_ucs2(NULL, p, tmpbuf, -1, sizeof(tmpbuf), STR_TERMINATE);
396 Skip past some strings in a buffer.
399 char *skip_string(char *buf,size_t n)
402 buf += strlen(buf) + 1;
407 Count the number of characters in a string. Normally this will
408 be the same as the number of bytes in a string for single byte strings,
409 but will be different for multibyte.
412 size_t str_charnum(const char *s)
414 uint16 tmpbuf2[sizeof(pstring)];
415 push_ucs2(NULL, tmpbuf2,s, sizeof(tmpbuf2), STR_TERMINATE);
416 return strlen_w(tmpbuf2);
420 Count the number of characters in a string. Normally this will
421 be the same as the number of bytes in a string for single byte strings,
422 but will be different for multibyte.
425 size_t str_ascii_charnum(const char *s)
428 push_ascii(tmpbuf2, s, sizeof(tmpbuf2), STR_TERMINATE);
429 return strlen(tmpbuf2);
432 BOOL trim_char(char *s,char cfront,char cback)
438 /* Ignore null or empty strings. */
439 if (!s || (s[0] == '\0'))
443 while (*fp && *fp == cfront)
446 /* We ate the string. */
454 ep = fp + strlen(fp) - 1;
456 /* Attempt ascii only. Bail for mb strings. */
457 while ((ep >= fp) && (*ep == cback)) {
459 if ((ep > fp) && (((unsigned char)ep[-1]) & 0x80)) {
460 /* Could be mb... bail back to tim_string. */
468 return trim_string(s, cfront ? fs : NULL, bs);
474 /* We ate the string. */
481 memmove(s, fp, ep-fp+2);
486 Trim the specified elements off the front and back of a string.
489 BOOL trim_string(char *s,const char *front,const char *back)
496 /* Ignore null or empty strings. */
497 if (!s || (s[0] == '\0'))
500 front_len = front? strlen(front) : 0;
501 back_len = back? strlen(back) : 0;
506 while (len && strncmp(s, front, front_len)==0) {
507 /* Must use memmove here as src & dest can
508 * easily overlap. Found by valgrind. JRA. */
509 memmove(s, s+front_len, (len-front_len)+1);
516 while ((len >= back_len) && strncmp(s+len-back_len,back,back_len)==0) {
517 s[len-back_len]='\0';
526 Does a string have any uppercase chars in it?
529 BOOL strhasupper(const char *s)
532 push_ucs2(NULL, tmpbuf,s, sizeof(tmpbuf), STR_TERMINATE);
533 for(ptr=tmpbuf;*ptr;ptr++)
540 Does a string have any lowercase chars in it?
543 BOOL strhaslower(const char *s)
546 push_ucs2(NULL, tmpbuf,s, sizeof(tmpbuf), STR_TERMINATE);
547 for(ptr=tmpbuf;*ptr;ptr++)
554 Find the number of 'c' chars in a string
557 size_t count_chars(const char *s,char c)
561 smb_ucs2_t *alloc_tmpbuf = NULL;
563 if (push_ucs2_allocate(&alloc_tmpbuf, s) == (size_t)-1) {
567 for(count=0,ptr=alloc_tmpbuf;*ptr;ptr++)
568 if(*ptr==UCS2_CHAR(c))
571 SAFE_FREE(alloc_tmpbuf);
576 Safe string copy into a known length string. maxlength does not
577 include the terminating zero.
580 char *safe_strcpy_fn(const char *fn, int line, char *dest,const char *src, size_t maxlength)
585 DEBUG(0,("ERROR: NULL dest in safe_strcpy, called from [%s][%d]\n", fn, line));
590 clobber_region(fn,line,dest, maxlength+1);
598 len = strnlen(src, maxlength+1);
600 if (len > maxlength) {
601 DEBUG(0,("ERROR: string overflow by %lu (%lu - %lu) in safe_strcpy [%.50s]\n",
602 (unsigned long)(len-maxlength), (unsigned long)len,
603 (unsigned long)maxlength, src));
607 memmove(dest, src, len);
613 Safe string cat into a string. maxlength does not
614 include the terminating zero.
616 char *safe_strcat_fn(const char *fn, int line, char *dest, const char *src, size_t maxlength)
618 size_t src_len, dest_len;
621 DEBUG(0,("ERROR: NULL dest in safe_strcat, called from [%s][%d]\n", fn, line));
628 src_len = strnlen(src, maxlength + 1);
629 dest_len = strnlen(dest, maxlength + 1);
632 clobber_region(fn, line, dest + dest_len, maxlength + 1 - dest_len);
635 if (src_len + dest_len > maxlength) {
636 DEBUG(0,("ERROR: string overflow by %d in safe_strcat [%.50s]\n",
637 (int)(src_len + dest_len - maxlength), src));
638 if (maxlength > dest_len) {
639 memcpy(&dest[dest_len], src, maxlength - dest_len);
645 memcpy(&dest[dest_len], src, src_len);
646 dest[dest_len + src_len] = 0;
651 Paranoid strcpy into a buffer of given length (includes terminating
652 zero. Strips out all but 'a-Z0-9' and the character in other_safe_chars
653 and replaces with '_'. Deliberately does *NOT* check for multibyte
654 characters. Don't change it !
656 char *alpha_strcpy_fn(const char *fn, int line, char *dest, const char *src, const char *other_safe_chars, size_t maxlength)
661 clobber_region(fn, line, dest, maxlength);
665 DEBUG(0,("ERROR: NULL dest in alpha_strcpy, called from [%s][%d]\n", fn, line));
675 if (len >= maxlength)
678 if (!other_safe_chars)
679 other_safe_chars = "";
681 for(i = 0; i < len; i++) {
682 int val = (src[i] & 0xff);
683 if (isupper(val) || islower(val) || isdigit(val) || strchr_m(other_safe_chars, val))
695 Like strncpy but always null terminates. Make sure there is room!
696 The variable n should always be one less than the available size.
698 char *StrnCpy_fn(const char *fn, int line,char *dest,const char *src,size_t n)
703 clobber_region(fn, line, dest, n+1);
707 DEBUG(0,("ERROR: NULL dest in StrnCpy, called from [%s][%d]\n", fn, line));
716 while (n-- && (*d = *src)) {
727 Like strncpy but copies up to the character marker. always null terminates.
728 returns a pointer to the character marker in the source string (src).
731 static char *strncpyn(char *dest, const char *src, size_t n, char c)
737 clobber_region(dest, n+1);
739 p = strchr_m(src, c);
741 DEBUG(5, ("strncpyn: separator character (%c) not found\n", c));
745 str_len = PTR_DIFF(p, src);
746 strncpy(dest, src, MIN(n, str_len));
747 dest[str_len] = '\0';
754 Routine to get hex characters and turn them into a 16 byte array.
755 the array can be variable length, and any non-hex-numeric
756 characters are skipped. "0xnn" or "0Xnn" is specially catered
759 valid examples: "0A5D15"; "0x15, 0x49, 0xa2"; "59\ta9\te3\n"
763 size_t strhex_to_str(char *p, size_t len, const char *strhex)
766 size_t num_chars = 0;
767 unsigned char lonybble, hinybble;
768 const char *hexchars = "0123456789ABCDEF";
769 char *p1 = NULL, *p2 = NULL;
771 for (i = 0; i < len && strhex[i] != 0; i++) {
772 if (strnequal(hexchars, "0x", 2)) {
773 i++; /* skip two chars */
777 if (!(p1 = strchr_m(hexchars, toupper(strhex[i]))))
780 i++; /* next hex digit */
782 if (!(p2 = strchr_m(hexchars, toupper(strhex[i]))))
785 /* get the two nybbles */
786 hinybble = PTR_DIFF(p1, hexchars);
787 lonybble = PTR_DIFF(p2, hexchars);
789 p[num_chars] = (hinybble << 4) | lonybble;
798 DATA_BLOB strhex_to_data_blob(const char *strhex)
800 DATA_BLOB ret_blob = data_blob(NULL, strlen(strhex)/2+1);
802 ret_blob.length = strhex_to_str((char*)ret_blob.data,
810 * Routine to print a buffer as HEX digits, into an allocated string.
813 void hex_encode(const unsigned char *buff_in, size_t len, char **out_hex_buffer)
818 *out_hex_buffer = SMB_XMALLOC_ARRAY(char, (len*2)+1);
819 hex_buffer = *out_hex_buffer;
821 for (i = 0; i < len; i++)
822 slprintf(&hex_buffer[i*2], 3, "%02X", buff_in[i]);
826 Check if a string is part of a list.
829 BOOL in_list(const char *s, const char *list, BOOL casesensitive)
837 while (next_token(&p,tok,LIST_SEP,sizeof(tok))) {
839 if (strcmp(tok,s) == 0)
842 if (StrCaseCmp(tok,s) == 0)
849 /* this is used to prevent lots of mallocs of size 1 */
850 static char *null_string = NULL;
853 Set a string value, allocing the space for the string
856 static BOOL string_init(char **dest,const char *src)
866 if((null_string = (char *)SMB_MALLOC(1)) == NULL) {
867 DEBUG(0,("string_init: malloc fail for null_string.\n"));
874 (*dest) = SMB_STRDUP(src);
875 if ((*dest) == NULL) {
876 DEBUG(0,("Out of memory in string_init\n"));
887 void string_free(char **s)
891 if (*s == null_string)
897 Set a string value, deallocating any existing space, and allocing the space
901 BOOL string_set(char **dest,const char *src)
904 return(string_init(dest,src));
908 Substitute a string for a pattern in another string. Make sure there is
911 This routine looks for pattern in s and replaces it with
912 insert. It may do multiple replacements.
914 Any of " ; ' $ or ` in the insert string are replaced with _
915 if len==0 then the string cannot be extended. This is different from the old
916 use of len==0 which was for no length checks to be done.
919 void string_sub2(char *s,const char *pattern, const char *insert, size_t len, BOOL remove_unsafe_characters)
924 if (!insert || !pattern || !*pattern || !s)
927 ls = (ssize_t)strlen(s);
928 lp = (ssize_t)strlen(pattern);
929 li = (ssize_t)strlen(insert);
932 len = ls + 1; /* len is number of *bytes* */
934 while (lp <= ls && (p = strstr_m(s,pattern))) {
935 if (ls + (li-lp) >= len) {
936 DEBUG(0,("ERROR: string overflow by %d in string_sub(%.50s, %d)\n",
937 (int)(ls + (li-lp) - len),
942 memmove(p+li,p+lp,strlen(p+lp)+1);
954 if ( remove_unsafe_characters ) {
956 /* yes this break should be here since we want to
957 fall throw if not replacing unsafe chars */
969 void string_sub(char *s,const char *pattern, const char *insert, size_t len)
971 string_sub2( s, pattern, insert, len, True );
974 void fstring_sub(char *s,const char *pattern,const char *insert)
976 string_sub(s, pattern, insert, sizeof(fstring));
979 void pstring_sub(char *s,const char *pattern,const char *insert)
981 string_sub(s, pattern, insert, sizeof(pstring));
985 Similar to string_sub, but it will accept only allocated strings
986 and may realloc them so pay attention at what you pass on no
987 pointers inside strings, no pstrings or const may be passed
991 char *realloc_string_sub(char *string, const char *pattern, const char *insert)
995 ssize_t ls,lp,li,ld, i;
997 if (!insert || !pattern || !*pattern || !string || !*string)
1002 in = SMB_STRDUP(insert);
1004 DEBUG(0, ("realloc_string_sub: out of memory!\n"));
1007 ls = (ssize_t)strlen(s);
1008 lp = (ssize_t)strlen(pattern);
1009 li = (ssize_t)strlen(insert);
1011 for (i=0;i<li;i++) {
1028 while ((p = strstr_m(s,pattern))) {
1030 int offset = PTR_DIFF(s,string);
1031 char *t = SMB_REALLOC(string, ls + ld + 1);
1033 DEBUG(0, ("realloc_string_sub: out of memory!\n"));
1038 p = t + offset + (p - s);
1041 memmove(p+li,p+lp,strlen(p+lp)+1);
1052 Similar to string_sub() but allows for any character to be substituted.
1054 if len==0 then the string cannot be extended. This is different from the old
1055 use of len==0 which was for no length checks to be done.
1058 void all_string_sub(char *s,const char *pattern,const char *insert, size_t len)
1063 if (!insert || !pattern || !s)
1066 ls = (ssize_t)strlen(s);
1067 lp = (ssize_t)strlen(pattern);
1068 li = (ssize_t)strlen(insert);
1074 len = ls + 1; /* len is number of *bytes* */
1076 while (lp <= ls && (p = strstr_m(s,pattern))) {
1077 if (ls + (li-lp) >= len) {
1078 DEBUG(0,("ERROR: string overflow by %d in all_string_sub(%.50s, %d)\n",
1079 (int)(ls + (li-lp) - len),
1080 pattern, (int)len));
1084 memmove(p+li,p+lp,strlen(p+lp)+1);
1086 memcpy(p, insert, li);
1093 Similar to all_string_sub but for unicode strings.
1094 Return a new allocated unicode string.
1095 similar to string_sub() but allows for any character to be substituted.
1099 static smb_ucs2_t *all_string_sub_w(const smb_ucs2_t *s, const smb_ucs2_t *pattern,
1100 const smb_ucs2_t *insert)
1103 const smb_ucs2_t *sp;
1104 size_t lr, lp, li, lt;
1106 if (!insert || !pattern || !*pattern || !s)
1109 lt = (size_t)strlen_w(s);
1110 lp = (size_t)strlen_w(pattern);
1111 li = (size_t)strlen_w(insert);
1114 const smb_ucs2_t *st = s;
1116 while ((sp = strstr_w(st, pattern))) {
1122 r = rp = SMB_MALLOC_ARRAY(smb_ucs2_t, lt + 1);
1124 DEBUG(0, ("all_string_sub_w: out of memory!\n"));
1128 while ((sp = strstr_w(s, pattern))) {
1129 memcpy(rp, s, (sp - s));
1130 rp += ((sp - s) / sizeof(smb_ucs2_t));
1131 memcpy(rp, insert, (li * sizeof(smb_ucs2_t)));
1135 lr = ((rp - r) / sizeof(smb_ucs2_t));
1137 memcpy(rp, s, ((lt - lr) * sizeof(smb_ucs2_t)));
1145 smb_ucs2_t *all_string_sub_wa(smb_ucs2_t *s, const char *pattern,
1150 if (!insert || !pattern || !s)
1152 push_ucs2(NULL, p, pattern, sizeof(wpstring) - 1, STR_TERMINATE);
1153 push_ucs2(NULL, i, insert, sizeof(wpstring) - 1, STR_TERMINATE);
1154 return all_string_sub_w(s, p, i);
1159 Splits out the front and back at a separator.
1162 static void split_at_last_component(char *path, char *front, char sep, char *back)
1164 char *p = strrchr_m(path, sep);
1170 pstrcpy(front, path);
1184 Write an octal as a string.
1187 const char *octal_string(int i)
1189 static char ret[64];
1192 slprintf(ret, sizeof(ret)-1, "0%o", i);
1198 Truncate a string at a specified length.
1201 char *string_truncate(char *s, unsigned int length)
1203 if (s && strlen(s) > length)
1209 Strchr and strrchr_m are very hard to do on general multi-byte strings.
1210 We convert via ucs2 for now.
1213 char *strchr_m(const char *src, char c)
1220 /* characters below 0x3F are guaranteed to not appear in
1221 non-initial position in multi-byte charsets */
1222 if ((c & 0xC0) == 0) {
1223 return strchr(src, c);
1226 /* this is quite a common operation, so we want it to be
1227 fast. We optimise for the ascii case, knowing that all our
1228 supported multi-byte character sets are ascii-compatible
1229 (ie. they match for the first 128 chars) */
1231 for (s = src; *s && !(((unsigned char)s[0]) & 0x80); s++) {
1239 #ifdef BROKEN_UNICODE_COMPOSE_CHARACTERS
1240 /* With compose characters we must restart from the beginning. JRA. */
1244 push_ucs2(NULL, ws, s, sizeof(ws), STR_TERMINATE);
1245 p = strchr_w(ws, UCS2_CHAR(c));
1249 pull_ucs2_pstring(s2, ws);
1250 return (char *)(s+strlen(s2));
1253 char *strrchr_m(const char *s, char c)
1255 /* characters below 0x3F are guaranteed to not appear in
1256 non-initial position in multi-byte charsets */
1257 if ((c & 0xC0) == 0) {
1258 return strrchr(s, c);
1261 /* this is quite a common operation, so we want it to be
1262 fast. We optimise for the ascii case, knowing that all our
1263 supported multi-byte character sets are ascii-compatible
1264 (ie. they match for the first 128 chars). Also, in Samba
1265 we only search for ascii characters in 'c' and that
1266 in all mb character sets with a compound character
1267 containing c, if 'c' is not a match at position
1268 p, then p[-1] > 0x7f. JRA. */
1271 size_t len = strlen(s);
1273 BOOL got_mb = False;
1280 /* Could be a match. Part of a multibyte ? */
1281 if ((cp > s) && (((unsigned char)cp[-1]) & 0x80)) {
1282 /* Yep - go slow :-( */
1286 /* No - we have a match ! */
1289 } while (cp-- != s);
1294 /* String contained a non-ascii char. Slow path. */
1300 push_ucs2(NULL, ws, s, sizeof(ws), STR_TERMINATE);
1301 p = strrchr_w(ws, UCS2_CHAR(c));
1305 pull_ucs2_pstring(s2, ws);
1306 return (char *)(s+strlen(s2));
1310 /***********************************************************************
1311 Return the equivalent of doing strrchr 'n' times - always going
1313 ***********************************************************************/
1315 char *strnrchr_m(const char *s, char c, unsigned int n)
1321 push_ucs2(NULL, ws, s, sizeof(ws), STR_TERMINATE);
1322 p = strnrchr_w(ws, UCS2_CHAR(c), n);
1326 pull_ucs2_pstring(s2, ws);
1327 return (char *)(s+strlen(s2));
1330 /***********************************************************************
1331 strstr_m - We convert via ucs2 for now.
1332 ***********************************************************************/
1334 char *strstr_m(const char *src, const char *findstr)
1337 smb_ucs2_t *src_w, *find_w;
1342 size_t findstr_len = 0;
1344 /* for correctness */
1349 /* Samba does single character findstr calls a *lot*. */
1350 if (findstr[1] == '\0')
1351 return strchr_m(src, *findstr);
1353 /* We optimise for the ascii case, knowing that all our
1354 supported multi-byte character sets are ascii-compatible
1355 (ie. they match for the first 128 chars) */
1357 for (s = src; *s && !(((unsigned char)s[0]) & 0x80); s++) {
1358 if (*s == *findstr) {
1360 findstr_len = strlen(findstr);
1362 if (strncmp(s, findstr, findstr_len) == 0) {
1371 #if 1 /* def BROKEN_UNICODE_COMPOSE_CHARACTERS */
1372 /* 'make check' fails unless we do this */
1374 /* With compose characters we must restart from the beginning. JRA. */
1378 if (push_ucs2_allocate(&src_w, src) == (size_t)-1) {
1379 DEBUG(0,("strstr_m: src malloc fail\n"));
1383 if (push_ucs2_allocate(&find_w, findstr) == (size_t)-1) {
1385 DEBUG(0,("strstr_m: find malloc fail\n"));
1389 p = strstr_w(src_w, find_w);
1398 if (pull_ucs2_allocate(&s2, src_w) == (size_t)-1) {
1401 DEBUG(0,("strstr_m: dest malloc fail\n"));
1404 retp = (char *)(s+strlen(s2));
1412 Convert a string to lower case.
1415 void strlower_m(char *s)
1420 /* this is quite a common operation, so we want it to be
1421 fast. We optimise for the ascii case, knowing that all our
1422 supported multi-byte character sets are ascii-compatible
1423 (ie. they match for the first 128 chars) */
1425 while (*s && !(((unsigned char)s[0]) & 0x80)) {
1426 *s = tolower((unsigned char)*s);
1433 /* I assume that lowercased string takes the same number of bytes
1434 * as source string even in UTF-8 encoding. (VIV) */
1435 len = strlen(s) + 1;
1438 unix_strlower(s,len,s,len);
1439 /* Catch mb conversion errors that may not terminate. */
1446 Convert a string to upper case.
1449 void strupper_m(char *s)
1454 /* this is quite a common operation, so we want it to be
1455 fast. We optimise for the ascii case, knowing that all our
1456 supported multi-byte character sets are ascii-compatible
1457 (ie. they match for the first 128 chars) */
1459 while (*s && !(((unsigned char)s[0]) & 0x80)) {
1460 *s = toupper((unsigned char)*s);
1467 /* I assume that lowercased string takes the same number of bytes
1468 * as source string even in multibyte encoding. (VIV) */
1469 len = strlen(s) + 1;
1472 unix_strupper(s,len,s,len);
1473 /* Catch mb conversion errors that may not terminate. */
1480 Return a RFC2254 binary string representation of a buffer.
1481 Used in LDAP filters.
1485 char *binary_string(char *buf, int len)
1489 const char *hex = "0123456789ABCDEF";
1490 s = SMB_MALLOC(len * 3 + 1);
1493 for (j=i=0;i<len;i++) {
1495 s[j+1] = hex[((unsigned char)buf[i]) >> 4];
1496 s[j+2] = hex[((unsigned char)buf[i]) & 0xF];
1504 Just a typesafety wrapper for snprintf into a pstring.
1507 int pstr_sprintf(pstring s, const char *fmt, ...)
1513 ret = vsnprintf(s, PSTRING_LEN, fmt, ap);
1520 Just a typesafety wrapper for snprintf into a fstring.
1523 int fstr_sprintf(fstring s, const char *fmt, ...)
1529 ret = vsnprintf(s, FSTRING_LEN, fmt, ap);
1535 #if !defined(HAVE_STRNDUP) || defined(BROKEN_STRNDUP)
1537 Some platforms don't have strndup.
1539 #if defined(PARANOID_MALLOC_CHECKER)
1543 char *strndup(const char *s, size_t n)
1548 ret = SMB_MALLOC(n+1);
1557 #if defined(PARANOID_MALLOC_CHECKER)
1558 #define strndup(s,n) __ERROR_DONT_USE_STRNDUP_DIRECTLY
1563 #if !defined(HAVE_STRNLEN) || defined(BROKEN_STRNLEN)
1565 Some platforms don't have strnlen
1568 size_t strnlen(const char *s, size_t n)
1571 for (i=0; i<n && s[i] != '\0'; i++)
1578 List of Strings manipulation functions
1581 #define S_LIST_ABS 16 /* List Allocation Block Size */
1583 char **str_list_make(const char *string, const char *sep)
1585 char **list, **rlist;
1591 if (!string || !*string)
1593 s = SMB_STRDUP(string);
1595 DEBUG(0,("str_list_make: Unable to allocate memory"));
1598 if (!sep) sep = LIST_SEP;
1604 while (next_token(&str, tok, sep, sizeof(tok))) {
1606 lsize += S_LIST_ABS;
1607 rlist = SMB_REALLOC_ARRAY(list, char *, lsize +1);
1609 DEBUG(0,("str_list_make: Unable to allocate memory"));
1610 str_list_free(&list);
1615 memset (&list[num], 0, ((sizeof(char**)) * (S_LIST_ABS +1)));
1618 list[num] = SMB_STRDUP(tok);
1620 DEBUG(0,("str_list_make: Unable to allocate memory"));
1621 str_list_free(&list);
1633 BOOL str_list_copy(char ***dest, const char **src)
1635 char **list, **rlist;
1647 lsize += S_LIST_ABS;
1648 rlist = SMB_REALLOC_ARRAY(list, char *, lsize +1);
1650 DEBUG(0,("str_list_copy: Unable to re-allocate memory"));
1651 str_list_free(&list);
1655 memset (&list[num], 0, ((sizeof(char **)) * (S_LIST_ABS +1)));
1658 list[num] = SMB_STRDUP(src[num]);
1660 DEBUG(0,("str_list_copy: Unable to allocate memory"));
1661 str_list_free(&list);
1673 * Return true if all the elements of the list match exactly.
1675 BOOL str_list_compare(char **list1, char **list2)
1679 if (!list1 || !list2)
1680 return (list1 == list2);
1682 for (num = 0; list1[num]; num++) {
1685 if (!strcsequal(list1[num], list2[num]))
1689 return False; /* if list2 has more elements than list1 fail */
1694 void str_list_free(char ***list)
1698 if (!list || !*list)
1701 for(; *tlist; tlist++)
1706 /******************************************************************************
1707 *****************************************************************************/
1709 int str_list_count( const char **list )
1713 /* count the number of list members */
1715 for ( i=0; *list; i++, list++ );
1720 /******************************************************************************
1721 version of standard_sub_basic() for string lists; uses alloc_sub_basic()
1723 *****************************************************************************/
1725 BOOL str_list_sub_basic( char **list, const char *smb_name )
1731 tmpstr = alloc_sub_basic(smb_name, s);
1733 DEBUG(0,("str_list_sub_basic: alloc_sub_basic() return NULL!\n"));
1746 /******************************************************************************
1747 substritute a specific pattern in a string list
1748 *****************************************************************************/
1750 BOOL str_list_substitute(char **list, const char *pattern, const char *insert)
1753 ssize_t ls, lp, li, ld, i, d;
1762 lp = (ssize_t)strlen(pattern);
1763 li = (ssize_t)strlen(insert);
1768 ls = (ssize_t)strlen(s);
1770 while ((p = strstr_m(s, pattern))) {
1774 t = (char *) SMB_MALLOC(ls +ld +1);
1776 DEBUG(0,("str_list_substitute: Unable to allocate memory"));
1779 memcpy(t, *list, d);
1780 memcpy(t +d +li, p +lp, ls -d -lp +1);
1787 for (i = 0; i < li; i++) {
1788 switch (insert[i]) {
1800 t[d +i] = insert[i];
1813 #define IPSTR_LIST_SEP ","
1814 #define IPSTR_LIST_CHAR ','
1817 * Add ip string representation to ipstr list. Used also
1818 * as part of @function ipstr_list_make
1820 * @param ipstr_list pointer to string containing ip list;
1821 * MUST BE already allocated and IS reallocated if necessary
1822 * @param ipstr_size pointer to current size of ipstr_list (might be changed
1823 * as a result of reallocation)
1824 * @param ip IP address which is to be added to list
1825 * @return pointer to string appended with new ip and possibly
1826 * reallocated to new length
1829 char* ipstr_list_add(char** ipstr_list, const struct ip_service *service)
1831 char* new_ipstr = NULL;
1833 /* arguments checking */
1834 if (!ipstr_list || !service) return NULL;
1836 /* attempt to convert ip to a string and append colon separator to it */
1838 asprintf(&new_ipstr, "%s%s%s:%d", *ipstr_list, IPSTR_LIST_SEP,
1839 inet_ntoa(service->ip), service->port);
1840 SAFE_FREE(*ipstr_list);
1842 asprintf(&new_ipstr, "%s:%d", inet_ntoa(service->ip), service->port);
1844 *ipstr_list = new_ipstr;
1850 * Allocate and initialise an ipstr list using ip adresses
1851 * passed as arguments.
1853 * @param ipstr_list pointer to string meant to be allocated and set
1854 * @param ip_list array of ip addresses to place in the list
1855 * @param ip_count number of addresses stored in ip_list
1856 * @return pointer to allocated ip string
1859 char* ipstr_list_make(char** ipstr_list, const struct ip_service* ip_list, int ip_count)
1863 /* arguments checking */
1864 if (!ip_list && !ipstr_list) return 0;
1868 /* process ip addresses given as arguments */
1869 for (i = 0; i < ip_count; i++)
1870 *ipstr_list = ipstr_list_add(ipstr_list, &ip_list[i]);
1872 return (*ipstr_list);
1877 * Parse given ip string list into array of ip addresses
1878 * (as ip_service structures)
1879 * e.g. 192.168.1.100:389,192.168.1.78, ...
1881 * @param ipstr ip string list to be parsed
1882 * @param ip_list pointer to array of ip addresses which is
1883 * allocated by this function and must be freed by caller
1884 * @return number of succesfully parsed addresses
1887 int ipstr_list_parse(const char* ipstr_list, struct ip_service **ip_list)
1893 if (!ipstr_list || !ip_list)
1896 count = count_chars(ipstr_list, IPSTR_LIST_CHAR) + 1;
1897 if ( (*ip_list = SMB_MALLOC_ARRAY(struct ip_service, count)) == NULL ) {
1898 DEBUG(0,("ipstr_list_parse: malloc failed for %lu entries\n", (unsigned long)count));
1903 next_token(&ipstr_list, token_str, IPSTR_LIST_SEP, FSTRING_LEN) && i<count;
1906 struct in_addr addr;
1908 char *p = strchr(token_str, ':');
1915 /* convert single token to ip address */
1916 if ( (addr.s_addr = inet_addr(token_str)) == INADDR_NONE )
1919 (*ip_list)[i].ip = addr;
1920 (*ip_list)[i].port = port;
1928 * Safely free ip string list
1930 * @param ipstr_list ip string list to be freed
1933 void ipstr_list_free(char* ipstr_list)
1935 SAFE_FREE(ipstr_list);
1940 Unescape a URL encoded string, in place.
1943 void rfc1738_unescape(char *buf)
1947 while (p && *p && (p=strchr_m(p,'%'))) {
1951 if (c1 >= '0' && c1 <= '9')
1953 else if (c1 >= 'A' && c1 <= 'F')
1955 else if (c1 >= 'a' && c1 <= 'f')
1957 else {p++; continue;}
1959 if (c2 >= '0' && c2 <= '9')
1961 else if (c2 >= 'A' && c2 <= 'F')
1963 else if (c2 >= 'a' && c2 <= 'f')
1965 else {p++; continue;}
1969 memmove(p+1, p+3, strlen(p+3)+1);
1974 static const char *b64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
1977 * Decode a base64 string into a DATA_BLOB - simple and slow algorithm
1979 DATA_BLOB base64_decode_data_blob(const char *s)
1981 int bit_offset, byte_offset, idx, i, n;
1982 DATA_BLOB decoded = data_blob(s, strlen(s)+1);
1983 unsigned char *d = decoded.data;
1988 while (*s && (p=strchr_m(b64,*s))) {
1989 idx = (int)(p - b64);
1990 byte_offset = (i*6)/8;
1991 bit_offset = (i*6)%8;
1992 d[byte_offset] &= ~((1<<(8-bit_offset))-1);
1993 if (bit_offset < 3) {
1994 d[byte_offset] |= (idx << (2-bit_offset));
1997 d[byte_offset] |= (idx >> (bit_offset-2));
1998 d[byte_offset+1] = 0;
1999 d[byte_offset+1] |= (idx << (8-(bit_offset-2))) & 0xFF;
2005 if ((n > 0) && (*s == '=')) {
2015 * Decode a base64 string in-place - wrapper for the above
2017 void base64_decode_inplace(char *s)
2019 DATA_BLOB decoded = base64_decode_data_blob(s);
2021 if ( decoded.length != 0 ) {
2022 memcpy(s, decoded.data, decoded.length);
2024 /* null terminate */
2025 s[decoded.length] = '\0';
2030 data_blob_free(&decoded);
2034 * Encode a base64 string into a malloc()ed string caller to free.
2036 *From SQUID: adopted from http://ftp.sunet.se/pub2/gnu/vm/base64-encode.c with adjustments
2038 char * base64_encode_data_blob(DATA_BLOB data)
2042 size_t out_cnt, len, output_len;
2045 if (!data.length || !data.data)
2050 output_len = data.length * 2;
2051 result = SMB_MALLOC(output_len); /* get us plenty of space */
2053 while (len-- && out_cnt < (data.length * 2) - 5) {
2054 int c = (unsigned char) *(data.data++);
2057 if (char_count == 3) {
2058 result[out_cnt++] = b64[bits >> 18];
2059 result[out_cnt++] = b64[(bits >> 12) & 0x3f];
2060 result[out_cnt++] = b64[(bits >> 6) & 0x3f];
2061 result[out_cnt++] = b64[bits & 0x3f];
2068 if (char_count != 0) {
2069 bits <<= 16 - (8 * char_count);
2070 result[out_cnt++] = b64[bits >> 18];
2071 result[out_cnt++] = b64[(bits >> 12) & 0x3f];
2072 if (char_count == 1) {
2073 result[out_cnt++] = '=';
2074 result[out_cnt++] = '=';
2076 result[out_cnt++] = b64[(bits >> 6) & 0x3f];
2077 result[out_cnt++] = '=';
2080 result[out_cnt] = '\0'; /* terminate */
2084 /* read a SMB_BIG_UINT from a string */
2085 SMB_BIG_UINT STR_TO_SMB_BIG_UINT(const char *nptr, const char **entptr)
2088 SMB_BIG_UINT val = -1;
2089 const char *p = nptr;
2091 while (p && *p && isspace(*p))
2093 #ifdef LARGE_SMB_OFF_T
2094 sscanf(p,"%llu",&val);
2095 #else /* LARGE_SMB_OFF_T */
2096 sscanf(p,"%lu",&val);
2097 #endif /* LARGE_SMB_OFF_T */
2099 while (p && *p && isdigit(*p))
2107 void string_append(char **left, const char *right)
2109 int new_len = strlen(right) + 1;
2111 if (*left == NULL) {
2112 *left = SMB_MALLOC(new_len);
2115 new_len += strlen(*left);
2116 *left = SMB_REALLOC(*left, new_len);
2122 safe_strcat(*left, right, new_len-1);
2125 BOOL add_string_to_array(TALLOC_CTX *mem_ctx,
2126 const char *str, const char ***strings,
2129 char *dup_str = talloc_strdup(mem_ctx, str);
2131 *strings = TALLOC_REALLOC_ARRAY(mem_ctx, *strings, const char *, (*num)+1);
2133 if ((*strings == NULL) || (dup_str == NULL))
2136 (*strings)[*num] = dup_str;
2141 /* Append an sprintf'ed string. Double buffer size on demand. Usable without
2142 * error checking in between. The indiation that something weird happened is
2145 void sprintf_append(TALLOC_CTX *mem_ctx, char **string, ssize_t *len,
2146 size_t *bufsize, const char *fmt, ...)
2153 /* len<0 is an internal marker that something failed */
2157 if (*string == NULL) {
2161 if (mem_ctx != NULL)
2162 *string = TALLOC_ARRAY(mem_ctx, char, *bufsize);
2164 *string = SMB_MALLOC_ARRAY(char, *bufsize);
2166 if (*string == NULL)
2171 ret = vasprintf(&newstr, fmt, ap);
2179 while ((*len)+ret >= *bufsize) {
2182 if (*bufsize >= (1024*1024*256))
2187 if (mem_ctx != NULL)
2188 *string = TALLOC_REALLOC_ARRAY(mem_ctx, *string, char,
2191 *string = SMB_REALLOC_ARRAY(*string, char, *bufsize);
2193 if (*string == NULL)
2197 StrnCpy((*string)+(*len), newstr, ret);
2208 Returns the substring from src between the first occurrence of
2209 the char "front" and the first occurence of the char "back".
2210 Mallocs the return string which must be freed. Not for use
2211 with wide character strings.
2213 char *sstring_sub(const char *src, char front, char back)
2215 char *temp1, *temp2, *temp3;
2218 temp1 = strchr(src, front);
2219 if (temp1 == NULL) return NULL;
2220 temp2 = strchr(src, back);
2221 if (temp2 == NULL) return NULL;
2222 len = temp2 - temp1;
2223 if (len <= 0) return NULL;
2224 temp3 = (char*)SMB_MALLOC(len);
2225 if (temp3 == NULL) {
2226 DEBUG(1,("Malloc failure in sstring_sub\n"));
2229 memcpy(temp3, temp1+1, len-1);
2230 temp3[len-1] = '\0';