288466113fe860303f72b8cdecfc31b13c2e45fb
[exim.git] / src / src / string.c
1 /*************************************************
2 * Exim - an Internet mail transport agent *
3 *************************************************/
4
5 /* Copyright (c) University of Cambridge 1995 - 2018 */
6 /* See the file NOTICE for conditions of use and distribution. */
7
8 /* Miscellaneous string-handling functions. Some are not required for
9 utilities and tests, and are cut out by the COMPILE_UTILITY macro. */
10
11
12 #include "exim.h"
13 #include <assert.h>
14
15 static void gstring_rebuffer(gstring * g);
16
17 #ifndef COMPILE_UTILITY
18 /*************************************************
19 * Test for IP address *
20 *************************************************/
21
22 /* This used just to be a regular expression, but with IPv6 things are a bit
23 more complicated. If the address contains a colon, it is assumed to be a v6
24 address (assuming HAVE_IPV6 is set). If a mask is permitted and one is present,
25 and maskptr is not NULL, its offset is placed there.
26
27 Arguments:
28 s a string
29 maskptr NULL if no mask is permitted to follow
30 otherwise, points to an int where the offset of '/' is placed
31 if there is no / followed by trailing digits, *maskptr is set 0
32
33 Returns: 0 if the string is not a textual representation of an IP address
34 4 if it is an IPv4 address
35 6 if it is an IPv6 address
36 */
37
38 int
39 string_is_ip_address(const uschar *s, int *maskptr)
40 {
41 int yield = 4;
42
43 /* If an optional mask is permitted, check for it. If found, pass back the
44 offset. */
45
46 if (maskptr)
47 {
48 const uschar *ss = s + Ustrlen(s);
49 *maskptr = 0;
50 if (s != ss && isdigit(*(--ss)))
51 {
52 while (ss > s && isdigit(ss[-1])) ss--;
53 if (ss > s && *(--ss) == '/') *maskptr = ss - s;
54 }
55 }
56
57 /* A colon anywhere in the string => IPv6 address */
58
59 if (Ustrchr(s, ':') != NULL)
60 {
61 BOOL had_double_colon = FALSE;
62 BOOL v4end = FALSE;
63
64 yield = 6;
65
66 /* An IPv6 address must start with hex digit or double colon. A single
67 colon is invalid. */
68
69 if (*s == ':' && *(++s) != ':') return 0;
70
71 /* Now read up to 8 components consisting of up to 4 hex digits each. There
72 may be one and only one appearance of double colon, which implies any number
73 of binary zero bits. The number of preceding components is held in count. */
74
75 for (int count = 0; count < 8; count++)
76 {
77 /* If the end of the string is reached before reading 8 components, the
78 address is valid provided a double colon has been read. This also applies
79 if we hit the / that introduces a mask or the % that introduces the
80 interface specifier (scope id) of a link-local address. */
81
82 if (*s == 0 || *s == '%' || *s == '/') return had_double_colon ? yield : 0;
83
84 /* If a component starts with an additional colon, we have hit a double
85 colon. This is permitted to appear once only, and counts as at least
86 one component. The final component may be of this form. */
87
88 if (*s == ':')
89 {
90 if (had_double_colon) return 0;
91 had_double_colon = TRUE;
92 s++;
93 continue;
94 }
95
96 /* If the remainder of the string contains a dot but no colons, we
97 can expect a trailing IPv4 address. This is valid if either there has
98 been no double-colon and this is the 7th component (with the IPv4 address
99 being the 7th & 8th components), OR if there has been a double-colon
100 and fewer than 6 components. */
101
102 if (Ustrchr(s, ':') == NULL && Ustrchr(s, '.') != NULL)
103 {
104 if ((!had_double_colon && count != 6) ||
105 (had_double_colon && count > 6)) return 0;
106 v4end = TRUE;
107 yield = 6;
108 break;
109 }
110
111 /* Check for at least one and not more than 4 hex digits for this
112 component. */
113
114 if (!isxdigit(*s++)) return 0;
115 if (isxdigit(*s) && isxdigit(*(++s)) && isxdigit(*(++s))) s++;
116
117 /* If the component is terminated by colon and there is more to
118 follow, skip over the colon. If there is no more to follow the address is
119 invalid. */
120
121 if (*s == ':' && *(++s) == 0) return 0;
122 }
123
124 /* If about to handle a trailing IPv4 address, drop through. Otherwise
125 all is well if we are at the end of the string or at the mask or at a percent
126 sign, which introduces the interface specifier (scope id) of a link local
127 address. */
128
129 if (!v4end)
130 return (*s == 0 || *s == '%' ||
131 (*s == '/' && maskptr != NULL && *maskptr != 0))? yield : 0;
132 }
133
134 /* Test for IPv4 address, which may be the tail-end of an IPv6 address. */
135
136 for (int i = 0; i < 4; i++)
137 {
138 long n;
139 uschar * end;
140
141 if (i != 0 && *s++ != '.') return 0;
142 n = strtol(CCS s, CSS &end, 10);
143 if (n > 255 || n < 0 || end <= s || end > s+3) return 0;
144 s = end;
145 }
146
147 return !*s || (*s == '/' && maskptr && *maskptr != 0) ? yield : 0;
148 }
149 #endif /* COMPILE_UTILITY */
150
151
152 /*************************************************
153 * Format message size *
154 *************************************************/
155
156 /* Convert a message size in bytes to printing form, rounding
157 according to the magnitude of the number. A value of zero causes
158 a string of spaces to be returned.
159
160 Arguments:
161 size the message size in bytes
162 buffer where to put the answer
163
164 Returns: pointer to the buffer
165 a string of exactly 5 characters is normally returned
166 */
167
168 uschar *
169 string_format_size(int size, uschar *buffer)
170 {
171 if (size == 0) Ustrcpy(buffer, US" ");
172 else if (size < 1024) sprintf(CS buffer, "%5d", size);
173 else if (size < 10*1024)
174 sprintf(CS buffer, "%4.1fK", (double)size / 1024.0);
175 else if (size < 1024*1024)
176 sprintf(CS buffer, "%4dK", (size + 512)/1024);
177 else if (size < 10*1024*1024)
178 sprintf(CS buffer, "%4.1fM", (double)size / (1024.0 * 1024.0));
179 else
180 sprintf(CS buffer, "%4dM", (size + 512 * 1024)/(1024*1024));
181 return buffer;
182 }
183
184
185
186 #ifndef COMPILE_UTILITY
187 /*************************************************
188 * Convert a number to base 62 format *
189 *************************************************/
190
191 /* Convert a long integer into an ASCII base 62 string. For Cygwin the value of
192 BASE_62 is actually 36. Always return exactly 6 characters plus zero, in a
193 static area.
194
195 Argument: a long integer
196 Returns: pointer to base 62 string
197 */
198
199 uschar *
200 string_base62(unsigned long int value)
201 {
202 static uschar yield[7];
203 uschar *p = yield + sizeof(yield) - 1;
204 *p = 0;
205 while (p > yield)
206 {
207 *(--p) = base62_chars[value % BASE_62];
208 value /= BASE_62;
209 }
210 return yield;
211 }
212 #endif /* COMPILE_UTILITY */
213
214
215
216 /*************************************************
217 * Interpret escape sequence *
218 *************************************************/
219
220 /* This function is called from several places where escape sequences are to be
221 interpreted in strings.
222
223 Arguments:
224 pp points a pointer to the initiating "\" in the string;
225 the pointer gets updated to point to the final character
226 Returns: the value of the character escape
227 */
228
229 int
230 string_interpret_escape(const uschar **pp)
231 {
232 #ifdef COMPILE_UTILITY
233 const uschar *hex_digits= CUS"0123456789abcdef";
234 #endif
235 int ch;
236 const uschar *p = *pp;
237 ch = *(++p);
238 if (isdigit(ch) && ch != '8' && ch != '9')
239 {
240 ch -= '0';
241 if (isdigit(p[1]) && p[1] != '8' && p[1] != '9')
242 {
243 ch = ch * 8 + *(++p) - '0';
244 if (isdigit(p[1]) && p[1] != '8' && p[1] != '9')
245 ch = ch * 8 + *(++p) - '0';
246 }
247 }
248 else switch(ch)
249 {
250 case 'b': ch = '\b'; break;
251 case 'f': ch = '\f'; break;
252 case 'n': ch = '\n'; break;
253 case 'r': ch = '\r'; break;
254 case 't': ch = '\t'; break;
255 case 'v': ch = '\v'; break;
256 case 'x':
257 ch = 0;
258 if (isxdigit(p[1]))
259 {
260 ch = ch * 16 +
261 Ustrchr(hex_digits, tolower(*(++p))) - hex_digits;
262 if (isxdigit(p[1])) ch = ch * 16 +
263 Ustrchr(hex_digits, tolower(*(++p))) - hex_digits;
264 }
265 break;
266 }
267 *pp = p;
268 return ch;
269 }
270
271
272
273 #ifndef COMPILE_UTILITY
274 /*************************************************
275 * Ensure string is printable *
276 *************************************************/
277
278 /* This function is called for critical strings. It checks for any
279 non-printing characters, and if any are found, it makes a new copy
280 of the string with suitable escape sequences. It is most often called by the
281 macro string_printing(), which sets allow_tab TRUE.
282
283 Arguments:
284 s the input string
285 allow_tab TRUE to allow tab as a printing character
286
287 Returns: string with non-printers encoded as printing sequences
288 */
289
290 const uschar *
291 string_printing2(const uschar *s, BOOL allow_tab)
292 {
293 int nonprintcount = 0;
294 int length = 0;
295 const uschar *t = s;
296 uschar *ss, *tt;
297
298 while (*t != 0)
299 {
300 int c = *t++;
301 if (!mac_isprint(c) || (!allow_tab && c == '\t')) nonprintcount++;
302 length++;
303 }
304
305 if (nonprintcount == 0) return s;
306
307 /* Get a new block of store guaranteed big enough to hold the
308 expanded string. */
309
310 ss = store_get(length + nonprintcount * 3 + 1, is_tainted(s));
311
312 /* Copy everything, escaping non printers. */
313
314 t = s;
315 tt = ss;
316
317 while (*t != 0)
318 {
319 int c = *t;
320 if (mac_isprint(c) && (allow_tab || c != '\t')) *tt++ = *t++; else
321 {
322 *tt++ = '\\';
323 switch (*t)
324 {
325 case '\n': *tt++ = 'n'; break;
326 case '\r': *tt++ = 'r'; break;
327 case '\b': *tt++ = 'b'; break;
328 case '\v': *tt++ = 'v'; break;
329 case '\f': *tt++ = 'f'; break;
330 case '\t': *tt++ = 't'; break;
331 default: sprintf(CS tt, "%03o", *t); tt += 3; break;
332 }
333 t++;
334 }
335 }
336 *tt = 0;
337 return ss;
338 }
339 #endif /* COMPILE_UTILITY */
340
341 /*************************************************
342 * Undo printing escapes in string *
343 *************************************************/
344
345 /* This function is the reverse of string_printing2. It searches for
346 backslash characters and if any are found, it makes a new copy of the
347 string with escape sequences parsed. Otherwise it returns the original
348 string.
349
350 Arguments:
351 s the input string
352
353 Returns: string with printing escapes parsed back
354 */
355
356 uschar *
357 string_unprinting(uschar *s)
358 {
359 uschar *p, *q, *r, *ss;
360 int len, off;
361
362 p = Ustrchr(s, '\\');
363 if (!p) return s;
364
365 len = Ustrlen(s) + 1;
366 ss = store_get(len, is_tainted(s));
367
368 q = ss;
369 off = p - s;
370 if (off)
371 {
372 memcpy(q, s, off);
373 q += off;
374 }
375
376 while (*p)
377 {
378 if (*p == '\\')
379 {
380 *q++ = string_interpret_escape((const uschar **)&p);
381 p++;
382 }
383 else
384 {
385 r = Ustrchr(p, '\\');
386 if (!r)
387 {
388 off = Ustrlen(p);
389 memcpy(q, p, off);
390 p += off;
391 q += off;
392 break;
393 }
394 else
395 {
396 off = r - p;
397 memcpy(q, p, off);
398 q += off;
399 p = r;
400 }
401 }
402 }
403 *q = '\0';
404
405 return ss;
406 }
407
408
409
410
411 #ifdef HAVE_LOCAL_SCAN
412 /*************************************************
413 * Copy and save string *
414 *************************************************/
415
416 /*
417 Argument: string to copy
418 Returns: copy of string in new store with the same taint status
419 */
420
421 uschar *
422 string_copy_function(const uschar *s)
423 {
424 return string_copy_taint(s, is_tainted(s));
425 }
426
427 /* This function assumes that memcpy() is faster than strcpy().
428 As above, but explicitly specifying the result taint status
429 */
430
431 uschar *
432 string_copy_taint(const uschar * s, BOOL tainted)
433 {
434 int len = Ustrlen(s) + 1;
435 uschar *ss = store_get(len, tainted);
436 memcpy(ss, s, len);
437 return ss;
438 }
439
440
441
442 /*************************************************
443 * Copy and save string, given length *
444 *************************************************/
445
446 /* It is assumed the data contains no zeros. A zero is added
447 onto the end.
448
449 Arguments:
450 s string to copy
451 n number of characters
452
453 Returns: copy of string in new store
454 */
455
456 uschar *
457 string_copyn_function(const uschar *s, int n)
458 {
459 uschar *ss = store_get(n + 1, is_tainted(s));
460 Ustrncpy(ss, s, n);
461 ss[n] = 0;
462 return ss;
463 }
464 #endif
465
466
467 /*************************************************
468 * Copy and save string in malloc'd store *
469 *************************************************/
470
471 /* This function assumes that memcpy() is faster than strcpy().
472
473 Argument: string to copy
474 Returns: copy of string in new store
475 */
476
477 uschar *
478 string_copy_malloc(const uschar *s)
479 {
480 int len = Ustrlen(s) + 1;
481 uschar *ss = store_malloc(len);
482 memcpy(ss, s, len);
483 return ss;
484 }
485
486
487
488 /*************************************************
489 * Copy string if long, inserting newlines *
490 *************************************************/
491
492 /* If the given string is longer than 75 characters, it is copied, and within
493 the copy, certain space characters are converted into newlines.
494
495 Argument: pointer to the string
496 Returns: pointer to the possibly altered string
497 */
498
499 uschar *
500 string_split_message(uschar *msg)
501 {
502 uschar *s, *ss;
503
504 if (msg == NULL || Ustrlen(msg) <= 75) return msg;
505 s = ss = msg = string_copy(msg);
506
507 for (;;)
508 {
509 int i = 0;
510 while (i < 75 && *ss != 0 && *ss != '\n') ss++, i++;
511 if (*ss == 0) break;
512 if (*ss == '\n')
513 s = ++ss;
514 else
515 {
516 uschar *t = ss + 1;
517 uschar *tt = NULL;
518 while (--t > s + 35)
519 {
520 if (*t == ' ')
521 {
522 if (t[-1] == ':') { tt = t; break; }
523 if (tt == NULL) tt = t;
524 }
525 }
526
527 if (tt == NULL) /* Can't split behind - try ahead */
528 {
529 t = ss + 1;
530 while (*t != 0)
531 {
532 if (*t == ' ' || *t == '\n')
533 { tt = t; break; }
534 t++;
535 }
536 }
537
538 if (tt == NULL) break; /* Can't find anywhere to split */
539 *tt = '\n';
540 s = ss = tt+1;
541 }
542 }
543
544 return msg;
545 }
546
547
548
549 /*************************************************
550 * Copy returned DNS domain name, de-escaping *
551 *************************************************/
552
553 /* If a domain name contains top-bit characters, some resolvers return
554 the fully qualified name with those characters turned into escapes. The
555 convention is a backslash followed by _decimal_ digits. We convert these
556 back into the original binary values. This will be relevant when
557 allow_utf8_domains is set true and UTF-8 characters are used in domain
558 names. Backslash can also be used to escape other characters, though we
559 shouldn't come across them in domain names.
560
561 Argument: the domain name string
562 Returns: copy of string in new store, de-escaped
563 */
564
565 uschar *
566 string_copy_dnsdomain(uschar *s)
567 {
568 uschar *yield;
569 uschar *ss = yield = store_get(Ustrlen(s) + 1, is_tainted(s));
570
571 while (*s != 0)
572 {
573 if (*s != '\\')
574 {
575 *ss++ = *s++;
576 }
577 else if (isdigit(s[1]))
578 {
579 *ss++ = (s[1] - '0')*100 + (s[2] - '0')*10 + s[3] - '0';
580 s += 4;
581 }
582 else if (*(++s) != 0)
583 {
584 *ss++ = *s++;
585 }
586 }
587
588 *ss = 0;
589 return yield;
590 }
591
592
593 #ifndef COMPILE_UTILITY
594 /*************************************************
595 * Copy space-terminated or quoted string *
596 *************************************************/
597
598 /* This function copies from a string until its end, or until whitespace is
599 encountered, unless the string begins with a double quote, in which case the
600 terminating quote is sought, and escaping within the string is done. The length
601 of a de-quoted string can be no longer than the original, since escaping always
602 turns n characters into 1 character.
603
604 Argument: pointer to the pointer to the first character, which gets updated
605 Returns: the new string
606 */
607
608 uschar *
609 string_dequote(const uschar **sptr)
610 {
611 const uschar *s = *sptr;
612 uschar *t, *yield;
613
614 /* First find the end of the string */
615
616 if (*s != '\"')
617 while (*s != 0 && !isspace(*s)) s++;
618 else
619 {
620 s++;
621 while (*s && *s != '\"')
622 {
623 if (*s == '\\') (void)string_interpret_escape(&s);
624 s++;
625 }
626 if (*s) s++;
627 }
628
629 /* Get enough store to copy into */
630
631 t = yield = store_get(s - *sptr + 1, is_tainted(*sptr));
632 s = *sptr;
633
634 /* Do the copy */
635
636 if (*s != '\"')
637 while (*s != 0 && !isspace(*s)) *t++ = *s++;
638 else
639 {
640 s++;
641 while (*s != 0 && *s != '\"')
642 {
643 *t++ = *s == '\\' ? string_interpret_escape(&s) : *s;
644 s++;
645 }
646 if (*s) s++;
647 }
648
649 /* Update the pointer and return the terminated copy */
650
651 *sptr = s;
652 *t = 0;
653 return yield;
654 }
655 #endif /* COMPILE_UTILITY */
656
657
658
659 /*************************************************
660 * Format a string and save it *
661 *************************************************/
662
663 /* The formatting is done by string_vformat, which checks the length of
664 everything.
665
666 Arguments:
667 format a printf() format - deliberately char * rather than uschar *
668 because it will most usually be a literal string
669 ... arguments for format
670
671 Returns: pointer to fresh piece of store containing sprintf'ed string
672 */
673
674 uschar *
675 string_sprintf_trc(const char *format, const uschar * func, unsigned line, ...)
676 {
677 gstring * g;
678 va_list ap;
679
680 va_start(ap, line);
681 g = string_vformat_trc(NULL, func, line, STRING_SPRINTF_BUFFER_SIZE,
682 SVFMT_REBUFFER|SVFMT_EXTEND, format, ap);
683 va_end(ap);
684
685 if (!g)
686 log_write(0, LOG_MAIN|LOG_PANIC_DIE,
687 "string_sprintf expansion was longer than %d; format string was (%s)\n"
688 " called from %s %d\n",
689 STRING_SPRINTF_BUFFER_SIZE, format, func, line);
690
691 gstring_release_unused(g);
692 return string_from_gstring(g);
693 }
694
695
696
697 /*************************************************
698 * Case-independent strncmp() function *
699 *************************************************/
700
701 /*
702 Arguments:
703 s first string
704 t second string
705 n number of characters to compare
706
707 Returns: < 0, = 0, or > 0, according to the comparison
708 */
709
710 int
711 strncmpic(const uschar *s, const uschar *t, int n)
712 {
713 while (n--)
714 {
715 int c = tolower(*s++) - tolower(*t++);
716 if (c) return c;
717 }
718 return 0;
719 }
720
721
722 /*************************************************
723 * Case-independent strcmp() function *
724 *************************************************/
725
726 /*
727 Arguments:
728 s first string
729 t second string
730
731 Returns: < 0, = 0, or > 0, according to the comparison
732 */
733
734 int
735 strcmpic(const uschar *s, const uschar *t)
736 {
737 while (*s != 0)
738 {
739 int c = tolower(*s++) - tolower(*t++);
740 if (c != 0) return c;
741 }
742 return *t;
743 }
744
745
746 /*************************************************
747 * Case-independent strstr() function *
748 *************************************************/
749
750 /* The third argument specifies whether whitespace is required
751 to follow the matched string.
752
753 Arguments:
754 s string to search
755 t substring to search for
756 space_follows if TRUE, match only if whitespace follows
757
758 Returns: pointer to substring in string, or NULL if not found
759 */
760
761 uschar *
762 strstric(uschar *s, uschar *t, BOOL space_follows)
763 {
764 uschar *p = t;
765 uschar *yield = NULL;
766 int cl = tolower(*p);
767 int cu = toupper(*p);
768
769 while (*s)
770 {
771 if (*s == cl || *s == cu)
772 {
773 if (yield == NULL) yield = s;
774 if (*(++p) == 0)
775 {
776 if (!space_follows || s[1] == ' ' || s[1] == '\n' ) return yield;
777 yield = NULL;
778 p = t;
779 }
780 cl = tolower(*p);
781 cu = toupper(*p);
782 s++;
783 }
784 else if (yield != NULL)
785 {
786 yield = NULL;
787 p = t;
788 cl = tolower(*p);
789 cu = toupper(*p);
790 }
791 else s++;
792 }
793 return NULL;
794 }
795
796
797
798 #ifdef COMPILE_UTILITY
799 /* Dummy version for this function; it should never be called */
800 static void
801 gstring_grow(gstring * g, int count)
802 {
803 assert(FALSE);
804 }
805 #endif
806
807
808
809 #ifndef COMPILE_UTILITY
810 /*************************************************
811 * Get next string from separated list *
812 *************************************************/
813
814 /* Leading and trailing space is removed from each item. The separator in the
815 list is controlled by the int pointed to by the separator argument as follows:
816
817 If the value is > 0 it is used as the separator. This is typically used for
818 sublists such as slash-separated options. The value is always a printing
819 character.
820
821 (If the value is actually > UCHAR_MAX there is only one item in the list.
822 This is used for some cases when called via functions that sometimes
823 plough through lists, and sometimes are given single items.)
824
825 If the value is <= 0, the string is inspected for a leading <x, where x is an
826 ispunct() or an iscntrl() character. If found, x is used as the separator. If
827 not found:
828
829 (a) if separator == 0, ':' is used
830 (b) if separator <0, -separator is used
831
832 In all cases the value of the separator that is used is written back to the
833 int so that it is used on subsequent calls as we progress through the list.
834
835 A literal ispunct() separator can be represented in an item by doubling, but
836 there is no way to include an iscntrl() separator as part of the data.
837
838 Arguments:
839 listptr points to a pointer to the current start of the list; the
840 pointer gets updated to point after the end of the next item
841 separator a pointer to the separator character in an int (see above)
842 buffer where to put a copy of the next string in the list; or
843 NULL if the next string is returned in new memory
844 buflen when buffer is not NULL, the size of buffer; otherwise ignored
845
846 Returns: pointer to buffer, containing the next substring,
847 or NULL if no more substrings
848 */
849
850 uschar *
851 string_nextinlist(const uschar **listptr, int *separator, uschar *buffer, int buflen)
852 {
853 int sep = *separator;
854 const uschar *s = *listptr;
855 BOOL sep_is_special;
856
857 if (!s) return NULL;
858
859 /* This allows for a fixed specified separator to be an iscntrl() character,
860 but at the time of implementation, this is never the case. However, it's best
861 to be conservative. */
862
863 while (isspace(*s) && *s != sep) s++;
864
865 /* A change of separator is permitted, so look for a leading '<' followed by an
866 allowed character. */
867
868 if (sep <= 0)
869 {
870 if (*s == '<' && (ispunct(s[1]) || iscntrl(s[1])))
871 {
872 sep = s[1];
873 if (*++s) ++s;
874 while (isspace(*s) && *s != sep) s++;
875 }
876 else
877 sep = sep ? -sep : ':';
878 *separator = sep;
879 }
880
881 /* An empty string has no list elements */
882
883 if (!*s) return NULL;
884
885 /* Note whether whether or not the separator is an iscntrl() character. */
886
887 sep_is_special = iscntrl(sep);
888
889 /* Handle the case when a buffer is provided. */
890
891 if (buffer)
892 {
893 int p = 0;
894 for (; *s; s++)
895 {
896 if (*s == sep && (*(++s) != sep || sep_is_special)) break;
897 if (p < buflen - 1) buffer[p++] = *s;
898 }
899 while (p > 0 && isspace(buffer[p-1])) p--;
900 buffer[p] = '\0';
901 }
902
903 /* Handle the case when a buffer is not provided. */
904
905 else
906 {
907 gstring * g = NULL;
908
909 /* We know that *s != 0 at this point. However, it might be pointing to a
910 separator, which could indicate an empty string, or (if an ispunct()
911 character) could be doubled to indicate a separator character as data at the
912 start of a string. Avoid getting working memory for an empty item. */
913
914 if (*s == sep)
915 {
916 s++;
917 if (*s != sep || sep_is_special)
918 {
919 *listptr = s;
920 return string_copy(US"");
921 }
922 }
923
924 /* Not an empty string; the first character is guaranteed to be a data
925 character. */
926
927 for (;;)
928 {
929 const uschar * ss;
930 for (ss = s + 1; *ss && *ss != sep; ) ss++;
931 g = string_catn(g, s, ss-s);
932 s = ss;
933 if (!*s || *++s != sep || sep_is_special) break;
934 }
935 while (g->ptr > 0 && isspace(g->s[g->ptr-1])) g->ptr--;
936 buffer = string_from_gstring(g);
937 gstring_release_unused(g);
938 }
939
940 /* Update the current pointer and return the new string */
941
942 *listptr = s;
943 return buffer;
944 }
945
946
947 static const uschar *
948 Ustrnchr(const uschar * s, int c, unsigned * len)
949 {
950 unsigned siz = *len;
951 while (siz)
952 {
953 if (!*s) return NULL;
954 if (*s == c)
955 {
956 *len = siz;
957 return s;
958 }
959 s++;
960 siz--;
961 }
962 return NULL;
963 }
964
965
966 /************************************************
967 * Add element to separated list *
968 ************************************************/
969 /* This function is used to build a list, returning an allocated null-terminated
970 growable string. The given element has any embedded separator characters
971 doubled.
972
973 Despite having the same growable-string interface as string_cat() the list is
974 always returned null-terminated.
975
976 Arguments:
977 list expanding-string for the list that is being built, or NULL
978 if this is a new list that has no contents yet
979 sep list separator character
980 ele new element to be appended to the list
981
982 Returns: pointer to the start of the list, changed if copied for expansion.
983 */
984
985 gstring *
986 string_append_listele(gstring * list, uschar sep, const uschar * ele)
987 {
988 uschar * sp;
989
990 if (list && list->ptr)
991 list = string_catn(list, &sep, 1);
992
993 while((sp = Ustrchr(ele, sep)))
994 {
995 list = string_catn(list, ele, sp-ele+1);
996 list = string_catn(list, &sep, 1);
997 ele = sp+1;
998 }
999 list = string_cat(list, ele);
1000 (void) string_from_gstring(list);
1001 return list;
1002 }
1003
1004
1005 gstring *
1006 string_append_listele_n(gstring * list, uschar sep, const uschar * ele,
1007 unsigned len)
1008 {
1009 const uschar * sp;
1010
1011 if (list && list->ptr)
1012 list = string_catn(list, &sep, 1);
1013
1014 while((sp = Ustrnchr(ele, sep, &len)))
1015 {
1016 list = string_catn(list, ele, sp-ele+1);
1017 list = string_catn(list, &sep, 1);
1018 ele = sp+1;
1019 len--;
1020 }
1021 list = string_catn(list, ele, len);
1022 (void) string_from_gstring(list);
1023 return list;
1024 }
1025
1026
1027
1028 /* A slightly-bogus listmaker utility; the separator is a string so
1029 can be multiple chars - there is no checking for the element content
1030 containing any of the separator. */
1031
1032 gstring *
1033 string_append2_listele_n(gstring * list, const uschar * sepstr,
1034 const uschar * ele, unsigned len)
1035 {
1036 if (list && list->ptr)
1037 list = string_cat(list, sepstr);
1038
1039 list = string_catn(list, ele, len);
1040 (void) string_from_gstring(list);
1041 return list;
1042 }
1043
1044
1045
1046 /************************************************/
1047 /* Add more space to a growable-string. The caller should check
1048 first if growth is required. The gstring struct is modified on
1049 return; specifically, the string-base-pointer may have been changed.
1050
1051 Arguments:
1052 g the growable-string
1053 count amount needed for g->ptr to increase by
1054 */
1055
1056 static void
1057 gstring_grow(gstring * g, int count)
1058 {
1059 int p = g->ptr;
1060 int oldsize = g->size;
1061 BOOL tainted = is_tainted(g->s);
1062
1063 /* Mostly, string_cat() is used to build small strings of a few hundred
1064 characters at most. There are times, however, when the strings are very much
1065 longer (for example, a lookup that returns a vast number of alias addresses).
1066 To try to keep things reasonable, we use increments whose size depends on the
1067 existing length of the string. */
1068
1069 unsigned inc = oldsize < 4096 ? 127 : 1023;
1070
1071 if (count <= 0) return;
1072 g->size = (p + count + inc + 1) & ~inc; /* one for a NUL */
1073
1074 /* Try to extend an existing allocation. If the result of calling
1075 store_extend() is false, either there isn't room in the current memory block,
1076 or this string is not the top item on the dynamic store stack. We then have
1077 to get a new chunk of store and copy the old string. When building large
1078 strings, it is helpful to call store_release() on the old string, to release
1079 memory blocks that have become empty. (The block will be freed if the string
1080 is at its start.) However, we can do this only if we know that the old string
1081 was the last item on the dynamic memory stack. This is the case if it matches
1082 store_last_get. */
1083
1084 if (!store_extend(g->s, tainted, oldsize, g->size))
1085 g->s = store_newblock(g->s, tainted, g->size, p);
1086 }
1087
1088
1089
1090 /*************************************************
1091 * Add chars to string *
1092 *************************************************/
1093 /* This function is used when building up strings of unknown length. Room is
1094 always left for a terminating zero to be added to the string that is being
1095 built. This function does not require the string that is being added to be NUL
1096 terminated, because the number of characters to add is given explicitly. It is
1097 sometimes called to extract parts of other strings.
1098
1099 Arguments:
1100 string points to the start of the string that is being built, or NULL
1101 if this is a new string that has no contents yet
1102 s points to characters to add
1103 count count of characters to add; must not exceed the length of s, if s
1104 is a C string.
1105
1106 Returns: pointer to the start of the string, changed if copied for expansion.
1107 Note that a NUL is not added, though space is left for one. This is
1108 because string_cat() is often called multiple times to build up a
1109 string - there's no point adding the NUL till the end.
1110
1111 */
1112 /* coverity[+alloc] */
1113
1114 gstring *
1115 string_catn(gstring * g, const uschar *s, int count)
1116 {
1117 int p;
1118 BOOL srctaint = is_tainted(s);
1119
1120 if (!g)
1121 {
1122 unsigned inc = count < 4096 ? 127 : 1023;
1123 unsigned size = ((count + inc) & ~inc) + 1;
1124 g = string_get_tainted(size, srctaint);
1125 }
1126 else if (srctaint && !is_tainted(g->s))
1127 gstring_rebuffer(g);
1128
1129 p = g->ptr;
1130 if (p + count >= g->size)
1131 gstring_grow(g, count);
1132
1133 /* Because we always specify the exact number of characters to copy, we can
1134 use memcpy(), which is likely to be more efficient than strncopy() because the
1135 latter has to check for zero bytes. */
1136
1137 memcpy(g->s + p, s, count);
1138 g->ptr = p + count;
1139 return g;
1140 }
1141
1142
1143 gstring *
1144 string_cat(gstring *string, const uschar *s)
1145 {
1146 return string_catn(string, s, Ustrlen(s));
1147 }
1148
1149
1150
1151 /*************************************************
1152 * Append strings to another string *
1153 *************************************************/
1154
1155 /* This function can be used to build a string from many other strings.
1156 It calls string_cat() to do the dirty work.
1157
1158 Arguments:
1159 string expanding-string that is being built, or NULL
1160 if this is a new string that has no contents yet
1161 count the number of strings to append
1162 ... "count" uschar* arguments, which must be valid zero-terminated
1163 C strings
1164
1165 Returns: pointer to the start of the string, changed if copied for expansion.
1166 The string is not zero-terminated - see string_cat() above.
1167 */
1168
1169 __inline__ gstring *
1170 string_append(gstring *string, int count, ...)
1171 {
1172 va_list ap;
1173
1174 va_start(ap, count);
1175 while (count-- > 0)
1176 {
1177 uschar *t = va_arg(ap, uschar *);
1178 string = string_cat(string, t);
1179 }
1180 va_end(ap);
1181
1182 return string;
1183 }
1184 #endif
1185
1186
1187
1188 /*************************************************
1189 * Format a string with length checks *
1190 *************************************************/
1191
1192 /* This function is used to format a string with checking of the length of the
1193 output for all conversions. It protects Exim from absent-mindedness when
1194 calling functions like debug_printf and string_sprintf, and elsewhere. There
1195 are two different entry points to what is actually the same function, depending
1196 on whether the variable length list of data arguments are given explicitly or
1197 as a va_list item.
1198
1199 The formats are the usual printf() ones, with some omissions (never used) and
1200 three additions for strings: %S forces lower case, %T forces upper case, and
1201 %#s or %#S prints nothing for a NULL string. Without the # "NULL" is printed
1202 (useful in debugging). There is also the addition of %D and %M, which insert
1203 the date in the form used for datestamped log files.
1204
1205 Arguments:
1206 buffer a buffer in which to put the formatted string
1207 buflen the length of the buffer
1208 format the format string - deliberately char * and not uschar *
1209 ... or ap variable list of supplementary arguments
1210
1211 Returns: TRUE if the result fitted in the buffer
1212 */
1213
1214 BOOL
1215 string_format_trc(uschar * buffer, int buflen,
1216 const uschar * func, unsigned line, const char * format, ...)
1217 {
1218 gstring g = { .size = buflen, .ptr = 0, .s = buffer }, *gp;
1219 va_list ap;
1220 va_start(ap, format);
1221 gp = string_vformat_trc(&g, func, line, STRING_SPRINTF_BUFFER_SIZE,
1222 0, format, ap);
1223 va_end(ap);
1224 g.s[g.ptr] = '\0';
1225 return !!gp;
1226 }
1227
1228
1229
1230 /* Copy the content of a string to tainted memory */
1231 static void
1232 gstring_rebuffer(gstring * g)
1233 {
1234 uschar * s = store_get(g->size, TRUE);
1235 memcpy(s, g->s, g->ptr);
1236 g->s = s;
1237 }
1238
1239
1240
1241 /* Build or append to a growing-string, sprintf-style.
1242
1243 If the "extend" flag is true, the string passed in can be NULL,
1244 empty, or non-empty. Growing is subject to an overall limit given
1245 by the size_limit argument.
1246
1247 If the "extend" flag is false, the string passed in may not be NULL,
1248 will not be grown, and is usable in the original place after return.
1249 The return value can be NULL to signify overflow.
1250
1251 Returns the possibly-new (if copy for growth was needed) string,
1252 not nul-terminated.
1253 */
1254
1255 gstring *
1256 string_vformat_trc(gstring * g, const uschar * func, unsigned line,
1257 unsigned size_limit, unsigned flags, const char *format, va_list ap)
1258 {
1259 enum ltypes { L_NORMAL=1, L_SHORT=2, L_LONG=3, L_LONGLONG=4, L_LONGDOUBLE=5, L_SIZE=6 };
1260
1261 int width, precision, off, lim, need;
1262 const char * fp = format; /* Deliberately not unsigned */
1263 BOOL dest_tainted = FALSE;
1264
1265 string_datestamp_offset = -1; /* Datestamp not inserted */
1266 string_datestamp_length = 0; /* Datestamp not inserted */
1267 string_datestamp_type = 0; /* Datestamp not inserted */
1268
1269 #ifdef COMPILE_UTILITY
1270 assert(!(flags & SVFMT_EXTEND));
1271 assert(g);
1272 #else
1273
1274 /* Ensure we have a string, to save on checking later */
1275 if (!g) g = string_get(16);
1276 else if (!(flags & SVFMT_TAINT_NOCHK)) dest_tainted = is_tainted(g->s);
1277
1278 if (!(flags & SVFMT_TAINT_NOCHK) && !dest_tainted && is_tainted(format))
1279 {
1280 #ifndef MACRO_PREDEF
1281 if (!(flags & SVFMT_REBUFFER))
1282 die_tainted(US"string_vformat", func, line);
1283 #endif
1284 gstring_rebuffer(g);
1285 dest_tainted = TRUE;
1286 }
1287 #endif /*!COMPILE_UTILITY*/
1288
1289 lim = g->size - 1; /* leave one for a nul */
1290 off = g->ptr; /* remember initial offset in gstring */
1291
1292 /* Scan the format and handle the insertions */
1293
1294 while (*fp)
1295 {
1296 int length = L_NORMAL;
1297 int *nptr;
1298 int slen;
1299 const char *null = "NULL"; /* ) These variables */
1300 const char *item_start, *s; /* ) are deliberately */
1301 char newformat[16]; /* ) not unsigned */
1302 char * gp = CS g->s + g->ptr; /* ) */
1303
1304 /* Non-% characters just get copied verbatim */
1305
1306 if (*fp != '%')
1307 {
1308 /* Avoid string_copyn() due to COMPILE_UTILITY */
1309 if ((need = g->ptr + 1) > lim)
1310 {
1311 if (!(flags & SVFMT_EXTEND) || need > size_limit) return NULL;
1312 gstring_grow(g, 1);
1313 lim = g->size - 1;
1314 }
1315 g->s[g->ptr++] = (uschar) *fp++;
1316 continue;
1317 }
1318
1319 /* Deal with % characters. Pick off the width and precision, for checking
1320 strings, skipping over the flag and modifier characters. */
1321
1322 item_start = fp;
1323 width = precision = -1;
1324
1325 if (strchr("-+ #0", *(++fp)) != NULL)
1326 {
1327 if (*fp == '#') null = "";
1328 fp++;
1329 }
1330
1331 if (isdigit((uschar)*fp))
1332 {
1333 width = *fp++ - '0';
1334 while (isdigit((uschar)*fp)) width = width * 10 + *fp++ - '0';
1335 }
1336 else if (*fp == '*')
1337 {
1338 width = va_arg(ap, int);
1339 fp++;
1340 }
1341
1342 if (*fp == '.')
1343 if (*(++fp) == '*')
1344 {
1345 precision = va_arg(ap, int);
1346 fp++;
1347 }
1348 else
1349 for (precision = 0; isdigit((uschar)*fp); fp++)
1350 precision = precision*10 + *fp - '0';
1351
1352 /* Skip over 'h', 'L', 'l', 'll' and 'z', remembering the item length */
1353
1354 if (*fp == 'h')
1355 { fp++; length = L_SHORT; }
1356 else if (*fp == 'L')
1357 { fp++; length = L_LONGDOUBLE; }
1358 else if (*fp == 'l')
1359 if (fp[1] == 'l')
1360 { fp += 2; length = L_LONGLONG; }
1361 else
1362 { fp++; length = L_LONG; }
1363 else if (*fp == 'z')
1364 { fp++; length = L_SIZE; }
1365
1366 /* Handle each specific format type. */
1367
1368 switch (*fp++)
1369 {
1370 case 'n':
1371 nptr = va_arg(ap, int *);
1372 *nptr = g->ptr - off;
1373 break;
1374
1375 case 'd':
1376 case 'o':
1377 case 'u':
1378 case 'x':
1379 case 'X':
1380 width = length > L_LONG ? 24 : 12;
1381 if ((need = g->ptr + width) > lim)
1382 {
1383 if (!(flags & SVFMT_EXTEND) || need >= size_limit) return NULL;
1384 gstring_grow(g, width);
1385 lim = g->size - 1;
1386 gp = CS g->s + g->ptr;
1387 }
1388 strncpy(newformat, item_start, fp - item_start);
1389 newformat[fp - item_start] = 0;
1390
1391 /* Short int is promoted to int when passing through ..., so we must use
1392 int for va_arg(). */
1393
1394 switch(length)
1395 {
1396 case L_SHORT:
1397 case L_NORMAL:
1398 g->ptr += sprintf(gp, newformat, va_arg(ap, int)); break;
1399 case L_LONG:
1400 g->ptr += sprintf(gp, newformat, va_arg(ap, long int)); break;
1401 case L_LONGLONG:
1402 g->ptr += sprintf(gp, newformat, va_arg(ap, LONGLONG_T)); break;
1403 case L_SIZE:
1404 g->ptr += sprintf(gp, newformat, va_arg(ap, size_t)); break;
1405 }
1406 break;
1407
1408 case 'p':
1409 {
1410 void * ptr;
1411 if ((need = g->ptr + 24) > lim)
1412 {
1413 if (!(flags & SVFMT_EXTEND || need >= size_limit)) return NULL;
1414 gstring_grow(g, 24);
1415 lim = g->size - 1;
1416 gp = CS g->s + g->ptr;
1417 }
1418 /* sprintf() saying "(nil)" for a null pointer seems unreliable.
1419 Handle it explicitly. */
1420 if ((ptr = va_arg(ap, void *)))
1421 {
1422 strncpy(newformat, item_start, fp - item_start);
1423 newformat[fp - item_start] = 0;
1424 g->ptr += sprintf(gp, newformat, ptr);
1425 }
1426 else
1427 g->ptr += sprintf(gp, "(nil)");
1428 }
1429 break;
1430
1431 /* %f format is inherently insecure if the numbers that it may be
1432 handed are unknown (e.g. 1e300). However, in Exim, %f is used for
1433 printing load averages, and these are actually stored as integers
1434 (load average * 1000) so the size of the numbers is constrained.
1435 It is also used for formatting sending rates, where the simplicity
1436 of the format prevents overflow. */
1437
1438 case 'f':
1439 case 'e':
1440 case 'E':
1441 case 'g':
1442 case 'G':
1443 if (precision < 0) precision = 6;
1444 if ((need = g->ptr + precision + 8) > lim)
1445 {
1446 if (!(flags & SVFMT_EXTEND || need >= size_limit)) return NULL;
1447 gstring_grow(g, precision+8);
1448 lim = g->size - 1;
1449 gp = CS g->s + g->ptr;
1450 }
1451 strncpy(newformat, item_start, fp - item_start);
1452 newformat[fp-item_start] = 0;
1453 if (length == L_LONGDOUBLE)
1454 g->ptr += sprintf(gp, newformat, va_arg(ap, long double));
1455 else
1456 g->ptr += sprintf(gp, newformat, va_arg(ap, double));
1457 break;
1458
1459 /* String types */
1460
1461 case '%':
1462 if ((need = g->ptr + 1) > lim)
1463 {
1464 if (!(flags & SVFMT_EXTEND || need >= size_limit)) return NULL;
1465 gstring_grow(g, 1);
1466 lim = g->size - 1;
1467 }
1468 g->s[g->ptr++] = (uschar) '%';
1469 break;
1470
1471 case 'c':
1472 if ((need = g->ptr + 1) > lim)
1473 {
1474 if (!(flags & SVFMT_EXTEND || need >= size_limit)) return NULL;
1475 gstring_grow(g, 1);
1476 lim = g->size - 1;
1477 }
1478 g->s[g->ptr++] = (uschar) va_arg(ap, int);
1479 break;
1480
1481 case 'D': /* Insert daily datestamp for log file names */
1482 s = CS tod_stamp(tod_log_datestamp_daily);
1483 string_datestamp_offset = g->ptr; /* Passed back via global */
1484 string_datestamp_length = Ustrlen(s); /* Passed back via global */
1485 string_datestamp_type = tod_log_datestamp_daily;
1486 slen = string_datestamp_length;
1487 goto INSERT_STRING;
1488
1489 case 'M': /* Insert monthly datestamp for log file names */
1490 s = CS tod_stamp(tod_log_datestamp_monthly);
1491 string_datestamp_offset = g->ptr; /* Passed back via global */
1492 string_datestamp_length = Ustrlen(s); /* Passed back via global */
1493 string_datestamp_type = tod_log_datestamp_monthly;
1494 slen = string_datestamp_length;
1495 goto INSERT_STRING;
1496
1497 case 's':
1498 case 'S': /* Forces *lower* case */
1499 case 'T': /* Forces *upper* case */
1500 s = va_arg(ap, char *);
1501
1502 if (!s) s = null;
1503 slen = Ustrlen(s);
1504
1505 if (!(flags & SVFMT_TAINT_NOCHK) && !dest_tainted && is_tainted(s))
1506 if (flags & SVFMT_REBUFFER)
1507 {
1508 gstring_rebuffer(g);
1509 gp = CS g->s + g->ptr;
1510 dest_tainted = TRUE;
1511 }
1512 #ifndef MACRO_PREDEF
1513 else
1514 die_tainted(US"string_vformat", func, line);
1515 #endif
1516
1517 INSERT_STRING: /* Come to from %D or %M above */
1518
1519 {
1520 BOOL truncated = FALSE;
1521
1522 /* If the width is specified, check that there is a precision
1523 set; if not, set it to the width to prevent overruns of long
1524 strings. */
1525
1526 if (width >= 0)
1527 {
1528 if (precision < 0) precision = width;
1529 }
1530
1531 /* If a width is not specified and the precision is specified, set
1532 the width to the precision, or the string length if shorted. */
1533
1534 else if (precision >= 0)
1535 width = precision < slen ? precision : slen;
1536
1537 /* If neither are specified, set them both to the string length. */
1538
1539 else
1540 width = precision = slen;
1541
1542 if ((need = g->ptr + width) >= size_limit || !(flags & SVFMT_EXTEND))
1543 {
1544 if (g->ptr == lim) return NULL;
1545 if (need > lim)
1546 {
1547 truncated = TRUE;
1548 width = precision = lim - g->ptr - 1;
1549 if (width < 0) width = 0;
1550 if (precision < 0) precision = 0;
1551 }
1552 }
1553 else if (need > lim)
1554 {
1555 gstring_grow(g, width);
1556 lim = g->size - 1;
1557 gp = CS g->s + g->ptr;
1558 }
1559
1560 g->ptr += sprintf(gp, "%*.*s", width, precision, s);
1561 if (fp[-1] == 'S')
1562 while (*gp) { *gp = tolower(*gp); gp++; }
1563 else if (fp[-1] == 'T')
1564 while (*gp) { *gp = toupper(*gp); gp++; }
1565
1566 if (truncated) return NULL;
1567 break;
1568 }
1569
1570 /* Some things are never used in Exim; also catches junk. */
1571
1572 default:
1573 strncpy(newformat, item_start, fp - item_start);
1574 newformat[fp-item_start] = 0;
1575 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "string_format: unsupported type "
1576 "in \"%s\" in \"%s\"", newformat, format);
1577 break;
1578 }
1579 }
1580
1581 if (g->ptr > g->size)
1582 log_write(0, LOG_MAIN|LOG_PANIC_DIE,
1583 "string_format internal error: caller %s %d", func, line);
1584 return g;
1585 }
1586
1587
1588
1589 #ifndef COMPILE_UTILITY
1590 /*************************************************
1591 * Generate an "open failed" message *
1592 *************************************************/
1593
1594 /* This function creates a message after failure to open a file. It includes a
1595 string supplied as data, adds the strerror() text, and if the failure was
1596 "Permission denied", reads and includes the euid and egid.
1597
1598 Arguments:
1599 eno the value of errno after the failure
1600 format a text format string - deliberately not uschar *
1601 ... arguments for the format string
1602
1603 Returns: a message, in dynamic store
1604 */
1605
1606 uschar *
1607 string_open_failed_trc(int eno, const uschar * func, unsigned line,
1608 const char *format, ...)
1609 {
1610 va_list ap;
1611 gstring * g = string_get(1024);
1612
1613 g = string_catn(g, US"failed to open ", 15);
1614
1615 /* Use the checked formatting routine to ensure that the buffer
1616 does not overflow. It should not, since this is called only for internally
1617 specified messages. If it does, the message just gets truncated, and there
1618 doesn't seem much we can do about that. */
1619
1620 va_start(ap, format);
1621 (void) string_vformat_trc(g, func, line, STRING_SPRINTF_BUFFER_SIZE,
1622 0, format, ap);
1623 string_from_gstring(g);
1624 gstring_release_unused(g);
1625 va_end(ap);
1626
1627 return eno == EACCES
1628 ? string_sprintf("%s: %s (euid=%ld egid=%ld)", g->s, strerror(eno),
1629 (long int)geteuid(), (long int)getegid())
1630 : string_sprintf("%s: %s", g->s, strerror(eno));
1631 }
1632 #endif /* COMPILE_UTILITY */
1633
1634
1635
1636
1637
1638 #ifndef COMPILE_UTILITY
1639 /* qsort(3), currently used to sort the environment variables
1640 for -bP environment output, needs a function to compare two pointers to string
1641 pointers. Here it is. */
1642
1643 int
1644 string_compare_by_pointer(const void *a, const void *b)
1645 {
1646 return Ustrcmp(* CUSS a, * CUSS b);
1647 }
1648 #endif /* COMPILE_UTILITY */
1649
1650
1651
1652
1653 /*************************************************
1654 **************************************************
1655 * Stand-alone test program *
1656 **************************************************
1657 *************************************************/
1658
1659 #ifdef STAND_ALONE
1660 int main(void)
1661 {
1662 uschar buffer[256];
1663
1664 printf("Testing is_ip_address\n");
1665
1666 while (fgets(CS buffer, sizeof(buffer), stdin) != NULL)
1667 {
1668 int offset;
1669 buffer[Ustrlen(buffer) - 1] = 0;
1670 printf("%d\n", string_is_ip_address(buffer, NULL));
1671 printf("%d %d %s\n", string_is_ip_address(buffer, &offset), offset, buffer);
1672 }
1673
1674 printf("Testing string_nextinlist\n");
1675
1676 while (fgets(CS buffer, sizeof(buffer), stdin) != NULL)
1677 {
1678 uschar *list = buffer;
1679 uschar *lp1, *lp2;
1680 uschar item[256];
1681 int sep1 = 0;
1682 int sep2 = 0;
1683
1684 if (*list == '<')
1685 {
1686 sep1 = sep2 = list[1];
1687 list += 2;
1688 }
1689
1690 lp1 = lp2 = list;
1691 for (;;)
1692 {
1693 uschar *item1 = string_nextinlist(&lp1, &sep1, item, sizeof(item));
1694 uschar *item2 = string_nextinlist(&lp2, &sep2, NULL, 0);
1695
1696 if (item1 == NULL && item2 == NULL) break;
1697 if (item == NULL || item2 == NULL || Ustrcmp(item1, item2) != 0)
1698 {
1699 printf("***ERROR\nitem1=\"%s\"\nitem2=\"%s\"\n",
1700 (item1 == NULL)? "NULL" : CS item1,
1701 (item2 == NULL)? "NULL" : CS item2);
1702 break;
1703 }
1704 else printf(" \"%s\"\n", CS item1);
1705 }
1706 }
1707
1708 /* This is a horrible lash-up, but it serves its purpose. */
1709
1710 printf("Testing string_format\n");
1711
1712 while (fgets(CS buffer, sizeof(buffer), stdin) != NULL)
1713 {
1714 void *args[3];
1715 long long llargs[3];
1716 double dargs[3];
1717 int dflag = 0;
1718 int llflag = 0;
1719 int n = 0;
1720 int count;
1721 int countset = 0;
1722 uschar format[256];
1723 uschar outbuf[256];
1724 uschar *s;
1725 buffer[Ustrlen(buffer) - 1] = 0;
1726
1727 s = Ustrchr(buffer, ',');
1728 if (s == NULL) s = buffer + Ustrlen(buffer);
1729
1730 Ustrncpy(format, buffer, s - buffer);
1731 format[s-buffer] = 0;
1732
1733 if (*s == ',') s++;
1734
1735 while (*s != 0)
1736 {
1737 uschar *ss = s;
1738 s = Ustrchr(ss, ',');
1739 if (s == NULL) s = ss + Ustrlen(ss);
1740
1741 if (isdigit(*ss))
1742 {
1743 Ustrncpy(outbuf, ss, s-ss);
1744 if (Ustrchr(outbuf, '.') != NULL)
1745 {
1746 dflag = 1;
1747 dargs[n++] = Ustrtod(outbuf, NULL);
1748 }
1749 else if (Ustrstr(outbuf, "ll") != NULL)
1750 {
1751 llflag = 1;
1752 llargs[n++] = strtoull(CS outbuf, NULL, 10);
1753 }
1754 else
1755 {
1756 args[n++] = (void *)Uatoi(outbuf);
1757 }
1758 }
1759
1760 else if (Ustrcmp(ss, "*") == 0)
1761 {
1762 args[n++] = (void *)(&count);
1763 countset = 1;
1764 }
1765
1766 else
1767 {
1768 uschar *sss = malloc(s - ss + 1);
1769 Ustrncpy(sss, ss, s-ss);
1770 args[n++] = sss;
1771 }
1772
1773 if (*s == ',') s++;
1774 }
1775
1776 if (!dflag && !llflag)
1777 printf("%s\n", string_format(outbuf, sizeof(outbuf), CS format,
1778 args[0], args[1], args[2])? "True" : "False");
1779
1780 else if (dflag)
1781 printf("%s\n", string_format(outbuf, sizeof(outbuf), CS format,
1782 dargs[0], dargs[1], dargs[2])? "True" : "False");
1783
1784 else printf("%s\n", string_format(outbuf, sizeof(outbuf), CS format,
1785 llargs[0], llargs[1], llargs[2])? "True" : "False");
1786
1787 printf("%s\n", CS outbuf);
1788 if (countset) printf("count=%d\n", count);
1789 }
1790
1791 return 0;
1792 }
1793 #endif
1794
1795 /* End of string.c */