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.
25 #include "system/iconv.h"
30 * @brief String utilities.
34 * Get the next token from a string, return False if none found.
35 * Handles double-quotes.
37 * Based on a routine by GJC@VILLAGE.COM.
38 * Extensively modified by Andrew.Tridgell@anu.edu.au
40 BOOL next_token(const char **ptr,char *buff, const char *sep, size_t bufsize)
51 /* default to simple separators */
55 /* find the first non sep char */
56 while (*s && strchr_m(sep,*s))
63 /* copy over the token */
64 for (quoted = False; len < bufsize && *s && (quoted || !strchr_m(sep,*s)); s++) {
73 *ptr = (*s) ? s+1 : s;
80 Case insensitive string compararison
82 int StrCaseCmp(const char *s1, const char *s2)
84 codepoint_t c1=0, c2=0;
88 c1 = next_codepoint(s1, &size1);
89 c2 = next_codepoint(s2, &size2);
98 if (c1 == INVALID_CODEPOINT ||
99 c2 == INVALID_CODEPOINT) {
100 /* what else can we do?? */
104 if (toupper_w(c1) != toupper_w(c2)) {
115 * @note The comparison is case-insensitive.
117 BOOL strequal(const char *s1, const char *s2)
124 return StrCaseCmp(s1,s2) == 0;
128 Compare 2 strings (case sensitive).
130 BOOL strcsequal(const char *s1,const char *s2)
137 return strcmp(s1,s2) == 0;
142 Do a case-insensitive, whitespace-ignoring string compare.
144 int strwicmp(const char *psz1, const char *psz2)
146 /* if BOTH strings are NULL, return TRUE, if ONE is NULL return */
147 /* appropriate value. */
150 else if (psz1 == NULL)
152 else if (psz2 == NULL)
155 /* sync the strings on first non-whitespace */
157 while (isspace((int)*psz1))
159 while (isspace((int)*psz2))
161 if (toupper(*psz1) != toupper(*psz2) || *psz1 == '\0'
167 return (*psz1 - *psz2);
172 NOTE: oldc and newc must be 7 bit characters
174 void string_replace(char *s, char oldc, char newc)
178 codepoint_t c = next_codepoint(s, &size);
187 Trim the specified elements off the front and back of a string.
189 BOOL trim_string(char *s,const char *front,const char *back)
196 /* Ignore null or empty strings. */
197 if (!s || (s[0] == '\0'))
200 front_len = front? strlen(front) : 0;
201 back_len = back? strlen(back) : 0;
206 while (len && strncmp(s, front, front_len)==0) {
207 /* Must use memmove here as src & dest can
208 * easily overlap. Found by valgrind. JRA. */
209 memmove(s, s+front_len, (len-front_len)+1);
216 while ((len >= back_len) && strncmp(s+len-back_len,back,back_len)==0) {
217 s[len-back_len]='\0';
226 Find the number of 'c' chars in a string
228 size_t count_chars(const char *s, char c)
234 codepoint_t c2 = next_codepoint(s, &size);
235 if (c2 == c) count++;
243 Safe string copy into a known length string. maxlength does not
244 include the terminating zero.
246 char *safe_strcpy(char *dest,const char *src, size_t maxlength)
251 DEBUG(0,("ERROR: NULL dest in safe_strcpy\n"));
256 /* We intentionally write out at the extremity of the destination
257 * string. If the destination is too short (e.g. pstrcpy into mallocd
258 * or fstring) then this should cause an error under a memory
260 dest[maxlength] = '\0';
261 if (PTR_DIFF(&len, dest) > 0) { /* check if destination is on the stack, ok if so */
262 log_suspicious_usage("safe_strcpy", src);
273 if (len > maxlength) {
274 DEBUG(0,("ERROR: string overflow by %u (%u - %u) in safe_strcpy [%.50s]\n",
275 (uint_t)(len-maxlength), len, maxlength, src));
279 memmove(dest, src, len);
285 Safe string cat into a string. maxlength does not
286 include the terminating zero.
288 char *safe_strcat(char *dest, const char *src, size_t maxlength)
290 size_t src_len, dest_len;
293 DEBUG(0,("ERROR: NULL dest in safe_strcat\n"));
301 if (PTR_DIFF(&src_len, dest) > 0) { /* check if destination is on the stack, ok if so */
302 log_suspicious_usage("safe_strcat", src);
305 src_len = strlen(src);
306 dest_len = strlen(dest);
308 if (src_len + dest_len > maxlength) {
309 DEBUG(0,("ERROR: string overflow by %d in safe_strcat [%.50s]\n",
310 (int)(src_len + dest_len - maxlength), src));
311 if (maxlength > dest_len) {
312 memcpy(&dest[dest_len], src, maxlength - dest_len);
318 memcpy(&dest[dest_len], src, src_len);
319 dest[dest_len + src_len] = 0;
324 Paranoid strcpy into a buffer of given length (includes terminating
325 zero. Strips out all but 'a-Z0-9' and the character in other_safe_chars
326 and replaces with '_'. Deliberately does *NOT* check for multibyte
327 characters. Don't change it !
330 char *alpha_strcpy(char *dest, const char *src, const char *other_safe_chars, size_t maxlength)
334 if (maxlength == 0) {
335 /* can't fit any bytes at all! */
340 DEBUG(0,("ERROR: NULL dest in alpha_strcpy\n"));
350 if (len >= maxlength)
353 if (!other_safe_chars)
354 other_safe_chars = "";
356 for(i = 0; i < len; i++) {
357 int val = (src[i] & 0xff);
358 if (isupper(val) || islower(val) || isdigit(val) || strchr_m(other_safe_chars, val))
370 Like strncpy but always null terminates. Make sure there is room!
371 The variable n should always be one less than the available size.
374 char *StrnCpy(char *dest,const char *src,size_t n)
383 while (n-- && (*d++ = *src++))
391 Routine to get hex characters and turn them into a 16 byte array.
392 the array can be variable length, and any non-hex-numeric
393 characters are skipped. "0xnn" or "0Xnn" is specially catered
396 valid examples: "0A5D15"; "0x15, 0x49, 0xa2"; "59\ta9\te3\n"
399 size_t strhex_to_str(char *p, size_t len, const char *strhex)
402 size_t num_chars = 0;
403 uint8_t lonybble, hinybble;
404 const char *hexchars = "0123456789ABCDEF";
405 char *p1 = NULL, *p2 = NULL;
407 for (i = 0; i < len && strhex[i] != 0; i++) {
408 if (strncasecmp(hexchars, "0x", 2) == 0) {
409 i++; /* skip two chars */
413 if (!(p1 = strchr_m(hexchars, toupper(strhex[i]))))
416 i++; /* next hex digit */
418 if (!(p2 = strchr_m(hexchars, toupper(strhex[i]))))
421 /* get the two nybbles */
422 hinybble = PTR_DIFF(p1, hexchars);
423 lonybble = PTR_DIFF(p2, hexchars);
425 p[num_chars] = (hinybble << 4) | lonybble;
434 DATA_BLOB strhex_to_data_blob(const char *strhex)
436 DATA_BLOB ret_blob = data_blob(NULL, strlen(strhex)/2+1);
438 ret_blob.length = strhex_to_str(ret_blob.data,
447 * Routine to print a buffer as HEX digits, into an allocated string.
449 void hex_encode(const unsigned char *buff_in, size_t len, char **out_hex_buffer)
454 *out_hex_buffer = smb_xmalloc((len*2)+1);
455 hex_buffer = *out_hex_buffer;
457 for (i = 0; i < len; i++)
458 slprintf(&hex_buffer[i*2], 3, "%02X", buff_in[i]);
462 Check if a string is part of a list.
464 BOOL in_list(const char *s, const char *list, BOOL casesensitive)
472 while (next_token(&p,tok,LIST_SEP,sizeof(tok))) {
474 if (strcmp(tok,s) == 0)
477 if (StrCaseCmp(tok,s) == 0)
485 Set a string value, allocing the space for the string
487 static BOOL string_init(char **dest,const char *src)
491 (*dest) = strdup(src);
492 if ((*dest) == NULL) {
493 DEBUG(0,("Out of memory in string_init\n"));
502 void string_free(char **s)
504 if (s) SAFE_FREE(*s);
508 Set a string value, deallocating any existing space, and allocing the space
511 BOOL string_set(char **dest, const char *src)
514 return string_init(dest,src);
518 Substitute a string for a pattern in another string. Make sure there is
521 This routine looks for pattern in s and replaces it with
522 insert. It may do multiple replacements.
524 Any of " ; ' $ or ` in the insert string are replaced with _
525 if len==0 then the string cannot be extended. This is different from the old
526 use of len==0 which was for no length checks to be done.
529 void string_sub(char *s,const char *pattern, const char *insert, size_t len)
534 if (!insert || !pattern || !*pattern || !s)
537 ls = (ssize_t)strlen(s);
538 lp = (ssize_t)strlen(pattern);
539 li = (ssize_t)strlen(insert);
542 len = ls + 1; /* len is number of *bytes* */
544 while (lp <= ls && (p = strstr(s,pattern))) {
545 if (ls + (li-lp) >= len) {
546 DEBUG(0,("ERROR: string overflow by %d in string_sub(%.50s, %d)\n",
547 (int)(ls + (li-lp) - len),
552 memmove(p+li,p+lp,strlen(p+lp)+1);
577 Similar to string_sub() but allows for any character to be substituted.
579 if len==0 then the string cannot be extended. This is different from the old
580 use of len==0 which was for no length checks to be done.
583 void all_string_sub(char *s,const char *pattern,const char *insert, size_t len)
588 if (!insert || !pattern || !s)
591 ls = (ssize_t)strlen(s);
592 lp = (ssize_t)strlen(pattern);
593 li = (ssize_t)strlen(insert);
599 len = ls + 1; /* len is number of *bytes* */
601 while (lp <= ls && (p = strstr(s,pattern))) {
602 if (ls + (li-lp) >= len) {
603 DEBUG(0,("ERROR: string overflow by %d in all_string_sub(%.50s, %d)\n",
604 (int)(ls + (li-lp) - len),
609 memmove(p+li,p+lp,strlen(p+lp)+1);
611 memcpy(p, insert, li);
619 Strchr and strrchr_m are a bit complex on general multi-byte strings.
621 char *strchr_m(const char *s, char c)
623 /* characters below 0x3F are guaranteed to not appear in
624 non-initial position in multi-byte charsets */
625 if ((c & 0xC0) == 0) {
631 codepoint_t c2 = next_codepoint(s, &size);
633 return discard_const(s);
641 char *strrchr_m(const char *s, char c)
645 /* characters below 0x3F are guaranteed to not appear in
646 non-initial position in multi-byte charsets */
647 if ((c & 0xC0) == 0) {
648 return strrchr(s, c);
653 codepoint_t c2 = next_codepoint(s, &size);
655 ret = discard_const(s);
664 Convert a string to lower case, allocated with talloc
666 char *strlower_talloc(TALLOC_CTX *ctx, const char *src)
671 /* this takes advantage of the fact that upper/lower can't
672 change the length of a character by more than 1 byte */
673 dest = talloc_size(ctx, 2*(strlen(src))+1);
680 codepoint_t c = next_codepoint(src, &c_size);
685 c_size = push_codepoint(dest+size, c);
699 Convert a string to UPPER case, allocated with talloc
701 char *strupper_talloc(TALLOC_CTX *ctx, const char *src)
706 /* this takes advantage of the fact that upper/lower can't
707 change the length of a character by more than 1 byte */
708 dest = talloc_size(ctx, 2*(strlen(src))+1);
715 codepoint_t c = next_codepoint(src, &c_size);
720 c_size = push_codepoint(dest+size, c);
734 Convert a string to lower case.
736 void strlower_m(char *s)
740 /* this is quite a common operation, so we want it to be
741 fast. We optimise for the ascii case, knowing that all our
742 supported multi-byte character sets are ascii-compatible
743 (ie. they match for the first 128 chars) */
744 while (*s && !(((uint8_t)s[0]) & 0x7F)) {
745 *s = tolower((uint8_t)*s);
755 size_t c_size, c_size2;
756 codepoint_t c = next_codepoint(s, &c_size);
757 c_size2 = push_codepoint(d, tolower_w(c));
758 if (c_size2 > c_size) {
759 DEBUG(0,("FATAL: codepoint 0x%x (0x%x) expanded from %d to %d bytes in strlower_m\n",
760 c, tolower_w(c), c_size, c_size2));
761 smb_panic("codepoint expansion in strlower_m\n");
770 Convert a string to UPPER case.
772 void strupper_m(char *s)
776 /* this is quite a common operation, so we want it to be
777 fast. We optimise for the ascii case, knowing that all our
778 supported multi-byte character sets are ascii-compatible
779 (ie. they match for the first 128 chars) */
780 while (*s && !(((uint8_t)s[0]) & 0x7F)) {
781 *s = toupper((uint8_t)*s);
791 size_t c_size, c_size2;
792 codepoint_t c = next_codepoint(s, &c_size);
793 c_size2 = push_codepoint(d, toupper_w(c));
794 if (c_size2 > c_size) {
795 DEBUG(0,("FATAL: codepoint 0x%x (0x%x) expanded from %d to %d bytes in strupper_m\n",
796 c, toupper_w(c), c_size, c_size2));
797 smb_panic("codepoint expansion in strupper_m\n");
806 Count the number of UCS2 characters in a string. Normally this will
807 be the same as the number of bytes in a string for single byte strings,
808 but will be different for multibyte.
810 size_t strlen_m(const char *s)
818 while (*s && !(((uint8_t)s[0]) & 0x7F)) {
829 codepoint_t c = next_codepoint(s, &c_size);
842 Work out the number of multibyte chars in a string, including the NULL
845 size_t strlen_m_term(const char *s)
851 return strlen_m(s) + 1;
855 Return a RFC2254 binary string representation of a buffer.
856 Used in LDAP filters.
859 char *binary_string(char *buf, int len)
863 const char *hex = "0123456789ABCDEF";
864 s = malloc(len * 3 + 1);
867 for (j=i=0;i<len;i++) {
869 s[j+1] = hex[((uint8_t)buf[i]) >> 4];
870 s[j+2] = hex[((uint8_t)buf[i]) & 0xF];
878 Unescape a URL encoded string, in place.
881 void rfc1738_unescape(char *buf)
885 while ((p=strchr_m(p,'+')))
890 while (p && *p && (p=strchr_m(p,'%'))) {
894 if (c1 >= '0' && c1 <= '9')
896 else if (c1 >= 'A' && c1 <= 'F')
898 else if (c1 >= 'a' && c1 <= 'f')
900 else {p++; continue;}
902 if (c2 >= '0' && c2 <= '9')
904 else if (c2 >= 'A' && c2 <= 'F')
906 else if (c2 >= 'a' && c2 <= 'f')
908 else {p++; continue;}
912 memmove(p+1, p+3, strlen(p+3)+1);
918 * Decode a base64 string into a DATA_BLOB - simple and slow algorithm
920 DATA_BLOB base64_decode_data_blob(const char *s)
922 const char *b64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
924 int bit_offset, byte_offset, idx, i, n;
925 DATA_BLOB decoded = data_blob(s, strlen(s)+1);
926 uint8_t *d = decoded.data;
931 while (*s && (p=strchr_m(b64,*s))) {
932 idx = (int)(p - b64);
933 byte_offset = (i*6)/8;
934 bit_offset = (i*6)%8;
935 d[byte_offset] &= ~((1<<(8-bit_offset))-1);
936 if (bit_offset < 3) {
937 d[byte_offset] |= (idx << (2-bit_offset));
940 d[byte_offset] |= (idx >> (bit_offset-2));
941 d[byte_offset+1] = 0;
942 d[byte_offset+1] |= (idx << (8-(bit_offset-2))) & 0xFF;
954 * Decode a base64 string in-place - wrapper for the above
956 void base64_decode_inplace(char *s)
958 DATA_BLOB decoded = base64_decode_data_blob(s);
959 memcpy(s, decoded.data, decoded.length);
960 data_blob_free(&decoded);
963 s[decoded.length] = '\0';
967 * Encode a base64 string into a malloc()ed string caller to free.
969 *From SQUID: adopted from http://ftp.sunet.se/pub2/gnu/vm/base64-encode.c with adjustments
971 char * base64_encode_data_blob(DATA_BLOB data)
973 const char *b64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
977 size_t len = data.length;
978 size_t output_len = data.length * 2;
979 char *result = malloc(output_len); /* get us plenty of space */
981 while (len-- && out_cnt < (data.length * 2) - 5) {
982 int c = (uint8_t) *(data.data++);
985 if (char_count == 3) {
986 result[out_cnt++] = b64[bits >> 18];
987 result[out_cnt++] = b64[(bits >> 12) & 0x3f];
988 result[out_cnt++] = b64[(bits >> 6) & 0x3f];
989 result[out_cnt++] = b64[bits & 0x3f];
996 if (char_count != 0) {
997 bits <<= 16 - (8 * char_count);
998 result[out_cnt++] = b64[bits >> 18];
999 result[out_cnt++] = b64[(bits >> 12) & 0x3f];
1000 if (char_count == 1) {
1001 result[out_cnt++] = '=';
1002 result[out_cnt++] = '=';
1004 result[out_cnt++] = b64[(bits >> 6) & 0x3f];
1005 result[out_cnt++] = '=';
1008 result[out_cnt] = '\0'; /* terminate */
1013 size_t valgrind_strlen(const char *s)
1016 for(count = 0; *s++; count++)
1024 format a string into length-prefixed dotted domain format, as used in NBT
1025 and in some ADS structures
1027 const char *str_format_nbt_domain(TALLOC_CTX *mem_ctx, const char *s)
1032 return talloc_strdup(mem_ctx, "");
1034 ret = talloc_size(mem_ctx, strlen(s)+2);
1039 memcpy(ret+1, s, strlen(s)+1);
1042 for (i=0;ret[i];i++) {
1043 if (ret[i] == '.') {
1044 char *p = strchr(ret+i+1, '.');
1046 ret[i] = p-(ret+i+1);
1048 ret[i] = strlen(ret+i+1);
1056 BOOL add_string_to_array(TALLOC_CTX *mem_ctx,
1057 const char *str, const char ***strings, int *num)
1059 char *dup_str = talloc_strdup(mem_ctx, str);
1061 *strings = talloc_realloc(mem_ctx,
1063 const char *, ((*num)+1));
1065 if ((*strings == NULL) || (dup_str == NULL))
1068 (*strings)[*num] = dup_str;
1077 varient of strcmp() that handles NULL ptrs
1079 int strcmp_safe(const char *s1, const char *s2)
1084 if (s1 == NULL || s2 == NULL) {
1087 return strcmp(s1, s2);
1091 /*******************************************************************
1092 return the number of bytes occupied by a buffer in ASCII format
1093 the result includes the null termination
1094 limited by 'n' bytes
1095 ********************************************************************/
1096 size_t ascii_len_n(const char *src, size_t n)
1100 len = strnlen(src, n);
1109 /*******************************************************************
1110 Return a string representing a CIFS attribute for a file.
1111 ********************************************************************/
1112 char *attrib_string(TALLOC_CTX *mem_ctx, uint32_t attrib)
1119 {'V', FILE_ATTRIBUTE_VOLUME},
1120 {'D', FILE_ATTRIBUTE_DIRECTORY},
1121 {'A', FILE_ATTRIBUTE_ARCHIVE},
1122 {'H', FILE_ATTRIBUTE_HIDDEN},
1123 {'S', FILE_ATTRIBUTE_SYSTEM},
1124 {'N', FILE_ATTRIBUTE_NORMAL},
1125 {'R', FILE_ATTRIBUTE_READONLY},
1126 {'d', FILE_ATTRIBUTE_DEVICE},
1127 {'t', FILE_ATTRIBUTE_TEMPORARY},
1128 {'s', FILE_ATTRIBUTE_SPARSE},
1129 {'r', FILE_ATTRIBUTE_REPARSE_POINT},
1130 {'c', FILE_ATTRIBUTE_COMPRESSED},
1131 {'o', FILE_ATTRIBUTE_OFFLINE},
1132 {'n', FILE_ATTRIBUTE_NONINDEXED},
1133 {'e', FILE_ATTRIBUTE_ENCRYPTED}
1137 ret = talloc_size(mem_ctx, ARRAY_SIZE(attr_strs)+1);
1142 for (len=i=0; i<ARRAY_SIZE(attr_strs); i++) {
1143 if (attrib & attr_strs[i].attr) {
1144 ret[len++] = attr_strs[i].c;