s3:libads: make use of talloc_stackframe() in ads_setup_tls_wrapping()
[Samba.git] / source3 / lib / util_str.c
blob3ac1e554246f5d044ad6cdeec204280344130016
1 /*
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
8 Copyright (C) James Peach 2006
9 Copyright (C) Jeremy Allison 1992-2007
11 This program is free software; you can redistribute it and/or modify
12 it under the terms of the GNU General Public License as published by
13 the Free Software Foundation; either version 3 of the License, or
14 (at your option) any later version.
16 This program is distributed in the hope that it will be useful,
17 but WITHOUT ANY WARRANTY; without even the implied warranty of
18 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 GNU General Public License for more details.
21 You should have received a copy of the GNU General Public License
22 along with this program. If not, see <http://www.gnu.org/licenses/>.
25 #include "includes.h"
26 #include "lib/param/loadparm.h"
27 #include "lib/util/smb_strtox.h"
29 static const char toupper_ascii_fast_table[128] = {
30 0x0, 0x1, 0x2, 0x3, 0x4, 0x5, 0x6, 0x7, 0x8, 0x9, 0xa, 0xb, 0xc, 0xd, 0xe, 0xf,
31 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f,
32 0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28, 0x29, 0x2a, 0x2b, 0x2c, 0x2d, 0x2e, 0x2f,
33 0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f,
34 0x40, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, 0x48, 0x49, 0x4a, 0x4b, 0x4c, 0x4d, 0x4e, 0x4f,
35 0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57, 0x58, 0x59, 0x5a, 0x5b, 0x5c, 0x5d, 0x5e, 0x5f,
36 0x60, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, 0x48, 0x49, 0x4a, 0x4b, 0x4c, 0x4d, 0x4e, 0x4f,
37 0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57, 0x58, 0x59, 0x5a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f
40 /**
41 * Compare 2 strings up to and including the nth char.
43 * @note The comparison is case-insensitive.
44 **/
45 bool strnequal(const char *s1,const char *s2,size_t n)
47 if (s1 == s2)
48 return(true);
49 if (!s1 || !s2 || !n)
50 return(false);
52 return(strncasecmp_m(s1,s2,n)==0);
55 /**
56 Skip past a string in a buffer. Buffer may not be
57 null terminated. end_ptr points to the first byte after
58 then end of the buffer.
59 **/
61 char *skip_string(const char *base, size_t len, char *buf)
63 const char *end_ptr = base + len;
65 if (end_ptr < base || !base || !buf || buf >= end_ptr) {
66 return NULL;
69 /* Skip the string */
70 while (*buf) {
71 buf++;
72 if (buf >= end_ptr) {
73 return NULL;
76 /* Skip the '\0' */
77 buf++;
78 return buf;
81 /**
82 Count the number of characters in a string. Normally this will
83 be the same as the number of bytes in a string for single byte strings,
84 but will be different for multibyte.
85 **/
87 size_t str_charnum(const char *s)
89 size_t ret, converted_size;
90 smb_ucs2_t *tmpbuf2 = NULL;
91 if (!push_ucs2_talloc(talloc_tos(), &tmpbuf2, s, &converted_size)) {
92 return 0;
94 ret = strlen_w(tmpbuf2);
95 TALLOC_FREE(tmpbuf2);
96 return ret;
99 bool trim_char(char *s,char cfront,char cback)
101 bool ret = false;
102 char *ep;
103 char *fp = s;
105 /* Ignore null or empty strings. */
106 if (!s || (s[0] == '\0'))
107 return false;
109 if (cfront) {
110 while (*fp && *fp == cfront)
111 fp++;
112 if (!*fp) {
113 /* We ate the string. */
114 s[0] = '\0';
115 return true;
117 if (fp != s)
118 ret = true;
121 ep = fp + strlen(fp) - 1;
122 if (cback) {
123 /* Attempt ascii only. Bail for mb strings. */
124 while ((ep >= fp) && (*ep == cback)) {
125 ret = true;
126 if ((ep > fp) && (((unsigned char)ep[-1]) & 0x80)) {
127 /* Could be mb... bail back to tim_string. */
128 char fs[2], bs[2];
129 if (cfront) {
130 fs[0] = cfront;
131 fs[1] = '\0';
133 bs[0] = cback;
134 bs[1] = '\0';
135 return trim_string(s, cfront ? fs : NULL, bs);
136 } else {
137 ep--;
140 if (ep < fp) {
141 /* We ate the string. */
142 s[0] = '\0';
143 return true;
147 ep[1] = '\0';
148 memmove(s, fp, ep-fp+2);
149 return ret;
153 Check if a string is part of a list.
156 bool in_list(const char *s, const char *list, bool casesensitive)
158 char *tok = NULL;
159 bool ret = false;
160 TALLOC_CTX *frame;
162 if (!list) {
163 return false;
166 frame = talloc_stackframe();
167 while (next_token_talloc(frame, &list, &tok,LIST_SEP)) {
168 if (casesensitive) {
169 if (strcmp(tok,s) == 0) {
170 ret = true;
171 break;
173 } else {
174 if (strcasecmp_m(tok,s) == 0) {
175 ret = true;
176 break;
180 TALLOC_FREE(frame);
181 return ret;
185 Truncate a string at a specified length.
188 char *string_truncate(char *s, unsigned int length)
190 if (s && strlen(s) > length)
191 s[length] = 0;
192 return s;
196 /***********************************************************************
197 Return the equivalent of doing strrchr 'n' times - always going
198 backwards.
199 ***********************************************************************/
201 char *strnrchr_m(const char *s, char c, unsigned int n)
203 smb_ucs2_t *ws = NULL;
204 char *s2 = NULL;
205 smb_ucs2_t *p;
206 char *ret;
207 size_t converted_size;
209 if (!push_ucs2_talloc(talloc_tos(), &ws, s, &converted_size)) {
210 /* Too hard to try and get right. */
211 return NULL;
213 p = strnrchr_w(ws, UCS2_CHAR(c), n);
214 if (!p) {
215 TALLOC_FREE(ws);
216 return NULL;
218 *p = 0;
219 if (!pull_ucs2_talloc(talloc_tos(), &s2, ws, &converted_size)) {
220 TALLOC_FREE(ws);
221 /* Too hard to try and get right. */
222 return NULL;
224 ret = discard_const_p(char, (s+strlen(s2)));
225 TALLOC_FREE(ws);
226 TALLOC_FREE(s2);
227 return ret;
230 static bool unix_strlower(const char *src, size_t srclen, char *dest, size_t destlen)
232 size_t size;
233 smb_ucs2_t *buffer = NULL;
234 bool ret;
236 if (!convert_string_talloc(talloc_tos(), CH_UNIX, CH_UTF16LE, src, srclen,
237 (void **)(void *)&buffer, &size))
239 return false;
241 if (!strlower_w(buffer) && (dest == src)) {
242 TALLOC_FREE(buffer);
243 return true;
245 ret = convert_string(CH_UTF16LE, CH_UNIX, buffer, size, dest, destlen, &size);
246 TALLOC_FREE(buffer);
247 return ret;
250 #if 0 /* Alternate function that avoid talloc calls for ASCII and non ASCII */
253 Convert a string to lower case.
255 _PUBLIC_ void strlower_m(char *s)
257 char *d;
258 struct smb_iconv_handle *iconv_handle;
260 iconv_handle = get_iconv_handle();
262 d = s;
264 while (*s) {
265 size_t c_size, c_size2;
266 codepoint_t c = next_codepoint_handle(iconv_handle, s, &c_size);
267 c_size2 = push_codepoint_handle(iconv_handle, d, tolower_m(c));
268 if (c_size2 > c_size) {
269 DEBUG(0,("FATAL: codepoint 0x%x (0x%x) expanded from %d to %d bytes in strlower_m\n",
270 c, tolower_m(c), (int)c_size, (int)c_size2));
271 smb_panic("codepoint expansion in strlower_m\n");
273 s += c_size;
274 d += c_size2;
276 *d = 0;
279 #endif
282 Convert a string to lower case.
285 bool strlower_m(char *s)
287 size_t len;
288 int errno_save;
289 bool ret = false;
291 /* this is quite a common operation, so we want it to be
292 fast. We optimise for the ascii case, knowing that all our
293 supported multi-byte character sets are ascii-compatible
294 (ie. they match for the first 128 chars) */
296 while (*s && !(((unsigned char)s[0]) & 0x80)) {
297 *s = tolower_m((unsigned char)*s);
298 s++;
301 if (!*s)
302 return true;
304 /* I assume that lowercased string takes the same number of bytes
305 * as source string even in UTF-8 encoding. (VIV) */
306 len = strlen(s) + 1;
307 errno_save = errno;
308 errno = 0;
309 ret = unix_strlower(s,len,s,len);
310 /* Catch mb conversion errors that may not terminate. */
311 if (errno) {
312 s[len-1] = '\0';
314 errno = errno_save;
315 return ret;
318 static bool unix_strupper(const char *src, size_t srclen, char *dest, size_t destlen)
320 size_t size;
321 smb_ucs2_t *buffer;
322 bool ret;
324 if (!push_ucs2_talloc(talloc_tos(), &buffer, src, &size)) {
325 return false;
328 if (!strupper_w(buffer) && (dest == src)) {
329 TALLOC_FREE(buffer);
330 return true;
333 ret = convert_string(CH_UTF16LE, CH_UNIX, buffer, size, dest, destlen, &size);
334 TALLOC_FREE(buffer);
335 return ret;
338 #if 0 /* Alternate function that avoid talloc calls for ASCII and non ASCII */
341 Convert a string to UPPER case.
343 _PUBLIC_ void strupper_m(char *s)
345 char *d;
346 struct smb_iconv_handle *iconv_handle;
348 iconv_handle = get_iconv_handle();
350 d = s;
352 while (*s) {
353 size_t c_size, c_size2;
354 codepoint_t c = next_codepoint_handle(iconv_handle, s, &c_size);
355 c_size2 = push_codepoint_handle(iconv_handle, d, toupper_m(c));
356 if (c_size2 > c_size) {
357 DEBUG(0,("FATAL: codepoint 0x%x (0x%x) expanded from %d to %d bytes in strupper_m\n",
358 c, toupper_m(c), (int)c_size, (int)c_size2));
359 smb_panic("codepoint expansion in strupper_m\n");
361 s += c_size;
362 d += c_size2;
364 *d = 0;
367 #endif
370 Convert a string to upper case.
373 bool strupper_m(char *s)
375 size_t len;
376 bool ret = false;
378 /* this is quite a common operation, so we want it to be
379 fast. We optimise for the ascii case, knowing that all our
380 supported multi-byte character sets are ascii-compatible
381 (ie. they match for the first 128 chars) */
383 while (*s && !(((unsigned char)s[0]) & 0x80)) {
384 *s = toupper_ascii_fast_table[(unsigned char)s[0]];
385 s++;
388 if (!*s)
389 return true;
391 /* I assume that uppercased string takes the same number of bytes
392 * as source string even in multibyte encoding. (VIV) */
393 len = strlen(s) + 1;
394 ret = unix_strupper(s,len,s,len);
395 /* Catch mb conversion errors that may not terminate. */
396 if (!ret) {
397 s[len-1] = '\0';
399 return ret;
403 Just a typesafety wrapper for snprintf into a fstring.
406 int fstr_sprintf(fstring s, const char *fmt, ...)
408 va_list ap;
409 int ret;
411 va_start(ap, fmt);
412 ret = vsnprintf(s, FSTRING_LEN, fmt, ap);
413 va_end(ap);
414 return ret;
417 /* read a SMB_BIG_UINT from a string */
418 uint64_t STR_TO_SMB_BIG_UINT(const char *nptr, const char **entptr)
421 uint64_t val = (uint64_t)-1;
422 const char *p = nptr;
424 if (!p) {
425 if (entptr) {
426 *entptr = p;
428 return val;
431 while (*p && isspace(*p))
432 p++;
434 sscanf(p,"%"SCNu64,&val);
435 if (entptr) {
436 while (*p && isdigit(*p))
437 p++;
438 *entptr = p;
441 return val;
444 /* Convert a size specification to a count of bytes. We accept the following
445 * suffixes:
446 * bytes if there is no suffix
447 * kK kibibytes
448 * mM mebibytes
449 * gG gibibytes
450 * tT tibibytes
451 * pP whatever the ISO name for petabytes is
453 * Returns 0 if the string can't be converted.
455 uint64_t conv_str_size(const char * str)
457 uint64_t lval;
458 char *end;
459 int error = 0;
461 if (str == NULL || *str == '\0') {
462 return 0;
465 lval = smb_strtoull(str, &end, 10, &error, SMB_STR_STANDARD);
467 if (error != 0) {
468 return 0;
471 if (*end == '\0') {
472 return lval;
475 if (strwicmp(end, "K") == 0) {
476 lval *= 1024ULL;
477 } else if (strwicmp(end, "M") == 0) {
478 lval *= (1024ULL * 1024ULL);
479 } else if (strwicmp(end, "G") == 0) {
480 lval *= (1024ULL * 1024ULL *
481 1024ULL);
482 } else if (strwicmp(end, "T") == 0) {
483 lval *= (1024ULL * 1024ULL *
484 1024ULL * 1024ULL);
485 } else if (strwicmp(end, "P") == 0) {
486 lval *= (1024ULL * 1024ULL *
487 1024ULL * 1024ULL *
488 1024ULL);
489 } else {
490 return 0;
493 return lval;
496 char *talloc_asprintf_strupper_m(TALLOC_CTX *t, const char *fmt, ...)
498 va_list ap;
499 char *ret;
501 va_start(ap, fmt);
502 ret = talloc_vasprintf(t, fmt, ap);
503 va_end(ap);
505 if (ret == NULL) {
506 return NULL;
508 if (!strupper_m(ret)) {
509 TALLOC_FREE(ret);
510 return NULL;
512 return ret;
515 char *talloc_asprintf_strlower_m(TALLOC_CTX *t, const char *fmt, ...)
517 va_list ap;
518 char *ret;
520 va_start(ap, fmt);
521 ret = talloc_vasprintf(t, fmt, ap);
522 va_end(ap);
524 if (ret == NULL) {
525 return NULL;
527 if (!strlower_m(ret)) {
528 TALLOC_FREE(ret);
529 return NULL;
531 return ret;
535 /********************************************************************
536 Check a string for any occurrences of a specified list of invalid
537 characters.
538 ********************************************************************/
540 bool validate_net_name( const char *name,
541 const char *invalid_chars,
542 int max_len)
544 int i;
546 if (!name) {
547 return false;
550 for ( i=0; i<max_len && name[i]; i++ ) {
551 /* fail if strchr_m() finds one of the invalid characters */
552 if ( name[i] && strchr_m( invalid_chars, name[i] ) ) {
553 return false;
557 return true;
561 /*******************************************************************
562 Add a shell escape character '\' to any character not in a known list
563 of characters. UNIX charset format.
564 *******************************************************************/
566 #define INCLUDE_LIST "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz_/ \t.,"
567 #define INSIDE_DQUOTE_LIST "$`\n\"\\"
569 char *escape_shell_string(const char *src)
571 size_t srclen = strlen(src);
572 char *ret = SMB_MALLOC_ARRAY(char, (srclen * 2) + 1);
573 char *dest = ret;
574 bool in_s_quote = false;
575 bool in_d_quote = false;
576 bool next_escaped = false;
578 if (!ret) {
579 return NULL;
582 while (*src) {
583 size_t c_size;
584 codepoint_t c = next_codepoint(src, &c_size);
586 if (c == INVALID_CODEPOINT) {
587 SAFE_FREE(ret);
588 return NULL;
591 if (c_size > 1) {
592 memcpy(dest, src, c_size);
593 src += c_size;
594 dest += c_size;
595 next_escaped = false;
596 continue;
600 * Deal with backslash escaped state.
601 * This only lasts for one character.
604 if (next_escaped) {
605 *dest++ = *src++;
606 next_escaped = false;
607 continue;
611 * Deal with single quote state. The
612 * only thing we care about is exiting
613 * this state.
616 if (in_s_quote) {
617 if (*src == '\'') {
618 in_s_quote = false;
620 *dest++ = *src++;
621 continue;
625 * Deal with double quote state. The most
626 * complex state. We must cope with \, meaning
627 * possibly escape next char (depending what it
628 * is), ", meaning exit this state, and possibly
629 * add an \ escape to any unprotected character
630 * (listed in INSIDE_DQUOTE_LIST).
633 if (in_d_quote) {
634 if (*src == '\\') {
636 * Next character might be escaped.
637 * We have to peek. Inside double
638 * quotes only INSIDE_DQUOTE_LIST
639 * characters are escaped by a \.
642 char nextchar;
644 c = next_codepoint(&src[1], &c_size);
645 if (c == INVALID_CODEPOINT) {
646 SAFE_FREE(ret);
647 return NULL;
649 if (c_size > 1) {
651 * Don't escape the next char.
652 * Just copy the \.
654 *dest++ = *src++;
655 continue;
658 nextchar = src[1];
660 if (nextchar && strchr(INSIDE_DQUOTE_LIST,
661 (int)nextchar)) {
662 next_escaped = true;
664 *dest++ = *src++;
665 continue;
668 if (*src == '\"') {
669 /* Exit double quote state. */
670 in_d_quote = false;
671 *dest++ = *src++;
672 continue;
676 * We know the character isn't \ or ",
677 * so escape it if it's any of the other
678 * possible unprotected characters.
681 if (strchr(INSIDE_DQUOTE_LIST, (int)*src)) {
682 *dest++ = '\\';
684 *dest++ = *src++;
685 continue;
689 * From here to the end of the loop we're
690 * not in the single or double quote state.
693 if (*src == '\\') {
694 /* Next character must be escaped. */
695 next_escaped = true;
696 *dest++ = *src++;
697 continue;
700 if (*src == '\'') {
701 /* Go into single quote state. */
702 in_s_quote = true;
703 *dest++ = *src++;
704 continue;
707 if (*src == '\"') {
708 /* Go into double quote state. */
709 in_d_quote = true;
710 *dest++ = *src++;
711 continue;
714 /* Check if we need to escape the character. */
716 if (!strchr(INCLUDE_LIST, (int)*src)) {
717 *dest++ = '\\';
719 *dest++ = *src++;
721 *dest++ = '\0';
722 return ret;
726 * This routine improves performance for operations temporarily acting on a
727 * full path. It is equivalent to the much more expensive
729 * talloc_asprintf(talloc_tos(), "%s/%s", dir, name)
731 * This actually does make a difference in metadata-heavy workloads (i.e. the
732 * "standard" client.txt nbench run.
735 ssize_t full_path_tos(const char *dir, const char *name,
736 char *tmpbuf, size_t tmpbuf_len,
737 char **pdst, char **to_free)
739 size_t dirlen, namelen, len;
740 char *dst;
742 dirlen = strlen(dir);
743 namelen = strlen(name);
744 len = dirlen + namelen + 1;
746 if (len < tmpbuf_len) {
747 dst = tmpbuf;
748 *to_free = NULL;
749 } else {
750 dst = talloc_array(talloc_tos(), char, len+1);
751 if (dst == NULL) {
752 return -1;
754 *to_free = dst;
757 memcpy(dst, dir, dirlen);
758 dst[dirlen] = '/';
759 memcpy(dst+dirlen+1, name, namelen+1);
760 *pdst = dst;
761 return len;