2 * Copyright (c) Ian F. Darwin 1986-1995.
3 * Software written by Ian F. Darwin and others;
4 * maintained 1995-present by Christos Zoulas and others.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice immediately at the beginning of the file, without modification,
11 * this list of conditions, and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
20 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 /*###########################################################################
32 # Copyright (c) 2002-2005 David TAILLANDIER #
34 ###########################################################################*/
38 This software is distributed under the "modified BSD licence".
40 This software is also released with GNU license (GPL) in another file (same
41 source-code, only license differ).
45 Redistribution and use in source and binary forms, with or without
46 modification, are permitted provided that the following conditions are met:
48 Redistributions of source code must retain the above copyright notice, this
49 list of conditions and the following disclaimer. Redistributions in binary
50 form must reproduce the above copyright notice, this list of conditions and
51 the following disclaimer in the documentation and/or other materials
52 provided with the distribution. The name of the author may not be used to
53 endorse or promote products derived from this software without specific
54 prior written permission.
56 THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
57 WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
58 MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
59 EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
60 SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
61 PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
62 OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
63 WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
64 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
65 ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
69 Hacked from xnprintf version of 26th February 2005 to provide only
70 vasprintf by Reuben Thomas <rrt@sc3d.org>.
75 'printf' function family use the following format string:
77 %[flag][width][.prec][modifier]type
79 %% is the escape sequence to print a '%'
80 % followed by an unknown format will print the characters without
81 trying to do any interpretation
83 flag: none + - # (blank)
86 modifier: F N L h l ll z t ('F' and 'N' are ms-dos/16-bit specific)
87 type: d i o u x X f e g E G c s p n
90 The function needs to allocate memory to store the full text before to
91 actually writing it. i.e if you want to fnprintf() 1000 characters, the
92 functions will allocate 1000 bytes.
93 This behaviour can be modified: you have to customise the code to flush the
94 internal buffer (writing to screen or file) when it reach a given size. Then
95 the buffer can have a shorter length. But what? If you really need to write
96 HUGE string, don't use printf!
97 During the process, some other memory is allocated (1024 bytes minimum)
98 to handle the output of partial sprintf() calls. If you have only 10000 bytes
99 free in memory, you *may* not be able to nprintf() a 8000 bytes-long text.
101 note: if a buffer overflow occurs, exit() is called. This situation should
102 never appear ... but if you want to be *really* sure, you have to modify the
103 code to handle those situations (only one place to modify).
104 A buffer overflow can only occur if your sprintf() do strange things or when
105 you use strange formats.
111 FILE_RCSID("@(#)$File: vasprintf.c,v 1.16 2018/10/01 18:45:39 christos Exp $")
122 #define ALLOC_CHUNK 2048
123 #define ALLOC_SECURITY_MARGIN 1024 /* big value because some platforms have very big 'G' exponent */
124 #if ALLOC_CHUNK < ALLOC_SECURITY_MARGIN
125 # error !!! ALLOC_CHUNK < ALLOC_SECURITY_MARGIN !!!
127 /* note: to have some interest, ALLOC_CHUNK should be much greater than ALLOC_SECURITY_MARGIN */
130 * To save a lot of push/pop, every variable are stored into this
131 * structure, which is passed among nearly every sub-functions.
134 const char * src_string; /* current position into intput string */
135 char * buffer_base; /* output buffer */
136 char * dest_string; /* current position into output string */
137 size_t buffer_len; /* length of output buffer */
138 size_t real_len; /* real current length of output text */
139 size_t pseudo_len; /* total length of output text if it were not limited in size */
141 va_list vargs; /* pointer to current position into vargs */
142 char * sprintf_string;
147 * Realloc buffer if needed
148 * Return value: 0 = ok
149 * EOF = not enought memory
151 static int realloc_buff(xprintf_struct *s, size_t len)
155 if (len + ALLOC_SECURITY_MARGIN + s->real_len > s->buffer_len) {
156 len += s->real_len + ALLOC_CHUNK;
157 ptr = (char *)realloc((void *)(s->buffer_base), len);
159 s->buffer_base = NULL;
163 s->dest_string = ptr + (size_t)(s->dest_string - s->buffer_base);
164 s->buffer_base = ptr;
167 (s->buffer_base)[s->buffer_len - 1] = 1; /* overflow marker */
174 * Prints 'usual' characters up to next '%'
175 * or up to end of text
177 static int usual_char(xprintf_struct * s)
181 len = strcspn(s->src_string, "%"); /* reachs the next '%' or end of input string */
182 /* note: 'len' is never 0 because the presence of '%' */
183 /* or end-of-line is checked in the calling function */
185 if (realloc_buff(s,len) == EOF)
188 memcpy(s->dest_string, s->src_string, len);
189 s->src_string += len;
190 s->dest_string += len;
192 s->pseudo_len += len;
198 * Return value: 0 = ok
201 static int print_it(xprintf_struct *s, size_t approx_len,
202 const char *format_string, ...)
208 if (realloc_buff(s,approx_len) == EOF)
211 va_start(varg, format_string);
212 vsprintf_len = vsprintf(s->dest_string, format_string, varg);
215 /* Check for overflow */
216 assert((s->buffer_base)[s->buffer_len - 1] == 1);
218 if (vsprintf_len == EOF) /* must be done *after* overflow-check */
221 s->pseudo_len += vsprintf_len;
222 len = strlen(s->dest_string);
224 s->dest_string += len;
230 * Prints a string (%s)
231 * We need special handling because:
232 * a: the length of the string is unknown
233 * b: when .prec is used, we must not access any extra byte of the
234 * string (of course, if the original sprintf() does... what the
235 * hell, not my problem)
237 * Return value: 0 = ok
240 static int type_s(xprintf_struct *s, int width, int prec,
241 const char *format_string, const char *arg_string)
245 if (arg_string == NULL)
246 return print_it(s, (size_t)6, "(null)", 0);
248 /* hand-made strlen() whitch stops when 'prec' is reached. */
249 /* if 'prec' is -1 then it is never reached. */
251 while (arg_string[string_len] != 0 && (size_t)prec != string_len)
254 if (width != -1 && string_len < (size_t)width)
255 string_len = (size_t)width;
257 return print_it(s, string_len, format_string, arg_string);
261 * Read a serie of digits. Stop when non-digit is found.
262 * Return value: the value read (between 0 and 32767).
263 * Note: no checks are made against overflow. If the string contain a big
264 * number, then the return value won't be what we want (but, in this case,
265 * the programmer don't know whatr he wants, then no problem).
267 static int getint(const char **string)
271 while (isdigit((unsigned char)**string) != 0) {
272 i = i * 10 + (**string - '0');
276 if (i < 0 || i > 32767)
277 i = 32767; /* if we have i==-10 this is not because the number is */
278 /* negative; this is because the number is big */
283 * Read a part of the format string. A part is 'usual characters' (ie "blabla")
284 * or '%%' escape sequence (to print a single '%') or any combination of
285 * format specifier (ie "%i" or "%10.2d").
286 * After the current part is managed, the function returns to caller with
287 * everything ready to manage the following part.
288 * The caller must ensure than the string is not empty, i.e. the first byte
291 * Return value: 0 = ok
294 static int dispatch(xprintf_struct *s)
296 const char *initial_ptr;
297 char format_string[24]; /* max length may be something like "% +-#032768.32768Ld" */
299 int flag_plus, flag_minus, flag_space, flag_sharp, flag_zero;
300 int width, prec, modifier, approx_width;
302 /* most of those variables are here to rewrite the format string */
304 #define SRCTXT (s->src_string)
305 #define DESTTXT (s->dest_string)
307 /* incoherent format string. Characters after the '%' will be printed with the next call */
308 #define INCOHERENT() do {SRCTXT=initial_ptr; return 0;} while (0) /* do/while to avoid */
309 #define INCOHERENT_TEST() do {if(*SRCTXT==0) INCOHERENT();} while (0) /* a null statement */
313 return usual_char(s);
315 /* we then have a '%' */
317 /* don't check for end-of-string ; this is done later */
319 /* '%%' escape sequence */
320 if (*SRCTXT == '%') {
321 if (realloc_buff(s, (size_t)1) == EOF) /* because we can have "%%%%%%%%..." */
332 initial_ptr = SRCTXT; /* save current pointer in case of incorrect */
333 /* 'decoding'. Points just after the '%' so the '%' */
334 /* won't be printed in any case, as required. */
337 flag_plus = flag_minus = flag_space = flag_sharp = flag_zero = 0;
342 else if (*SRCTXT == '+')
344 else if (*SRCTXT == '-')
346 else if (*SRCTXT == '#')
348 else if (*SRCTXT == '0')
354 INCOHERENT_TEST(); /* here is the first test for end of string */
357 if (*SRCTXT == '*') { /* width given by next argument */
359 width = va_arg(s->vargs, int);
360 if ((size_t)width > 0x3fffU) /* 'size_t' to check against negative values too */
362 } else if (isdigit((unsigned char)*SRCTXT)) /* width given as ASCII number */
363 width = getint(&SRCTXT);
365 width = -1; /* no width specified */
370 if (*SRCTXT == '.') {
372 if (*SRCTXT == '*') { /* .prec given by next argument */
374 prec = va_arg(s->vargs, int);
375 if ((size_t)prec >= 0x3fffU) /* 'size_t' to check against negative values too */
377 } else { /* .prec given as ASCII number */
378 if (isdigit((unsigned char)*SRCTXT) == 0)
380 prec = getint(&SRCTXT);
384 prec = -1; /* no .prec specified */
395 if (modifier=='l' && *SRCTXT=='l') {
397 modifier = 'L'; /* 'll' == 'L' long long == long double */
398 } /* only for compatibility ; not portable */
402 modifier = -1; /* no modifier specified */
408 if (strchr("diouxXfegEGcspn",type) == NULL)
409 INCOHERENT(); /* unknown type */
412 /* rewrite format-string */
413 format_string[0] = '%';
414 format_ptr = &(format_string[1]);
435 } /* '0' *must* be the last one */
438 sprintf(format_ptr, "%i", width);
439 format_ptr += strlen(format_ptr);
445 sprintf(format_ptr, "%i", prec);
446 format_ptr += strlen(format_ptr);
449 if (modifier != -1) {
450 if (modifier == 'L' && strchr("diouxX",type) != NULL) {
456 *format_ptr = modifier;
465 /* vague approximation of minimal length if width or prec are specified */
466 approx_width = width + prec;
467 if (approx_width < 0) /* because width == -1 and/or prec == -1 */
480 return print_it(s, (size_t)approx_width, format_string, va_arg(s->vargs, int));
482 return print_it(s, (size_t)approx_width, format_string, va_arg(s->vargs, long long int));
484 return print_it(s, (size_t)approx_width, format_string, va_arg(s->vargs, long int));
486 return print_it(s, (size_t)approx_width, format_string, va_arg(s->vargs, int));
488 return print_it(s, (size_t)approx_width, format_string, va_arg(s->vargs, size_t));
490 return print_it(s, (size_t)approx_width, format_string, va_arg(s->vargs, ptrdiff_t));
491 /* 'int' instead of 'short int' because default promotion is 'int' */
500 return print_it(s, (size_t)approx_width, format_string, va_arg(s->vargs, int));
501 /* 'int' instead of 'char' because default promotion is 'int' */
510 case -1 : /* because of default promotion, no modifier means 'l' */
512 return print_it(s, (size_t)approx_width, format_string, va_arg(s->vargs, double));
514 return print_it(s, (size_t)approx_width, format_string, va_arg(s->vargs, long double));
521 return type_s(s, width, prec, format_string, va_arg(s->vargs, const char*));
526 return print_it(s, (size_t)approx_width, format_string, va_arg(s->vargs, void *));
531 if (modifier == -1) {
533 p = va_arg(s->vargs, int *);
544 INCOHERENT(); /* unknown type */
547 #undef INCOHERENT_TEST
553 * Return value: number of *virtually* written characters
556 static int core(xprintf_struct *s)
562 if ((int)(s->maxlen) <= 0) /* 'int' to check against some conversion */
563 return EOF; /* error for example if value is (int)-10 */
564 s->maxlen--; /* because initial maxlen counts final 0 */
565 /* note: now 'maxlen' _can_ be zero */
567 if (s->src_string == NULL)
568 s->src_string = "(null)";
570 /* struct init and memory allocation */
571 s->buffer_base = NULL;
575 if (realloc_buff(s, (size_t)0) == EOF)
577 s->dest_string = s->buffer_base;
579 /* process source string */
581 /* up to end of source string */
582 if (*(s->src_string) == 0) {
583 *(s->dest_string) = '\0'; /* final NUL */
587 if (dispatch(s) == EOF)
590 /* up to end of dest string */
591 if (s->real_len >= s->maxlen) {
592 (s->buffer_base)[s->maxlen] = '\0'; /* final NUL */
597 /* for (v)asnprintf */
598 dummy_base = s->buffer_base;
600 dummy_base = s->buffer_base + s->real_len;
601 save_len = s->real_len;
603 /* process the remaining of source string to compute 'pseudo_len'. We
604 * overwrite again and again, starting at 'dummy_base' because we don't
605 * need the text, only char count. */
606 while(*(s->src_string) != 0) { /* up to end of source string */
608 s->dest_string = dummy_base;
609 if (dispatch(s) == EOF)
613 s->buffer_base = (char *)realloc((void *)(s->buffer_base), save_len + 1);
614 if (s->buffer_base == NULL)
615 return EOF; /* should rarely happen because we shrink the buffer */
616 return s->pseudo_len;
619 free(s->buffer_base);
623 int vasprintf(char **ptr, const char *format_string, va_list vargs)
628 s.src_string = format_string;
630 va_copy (s.vargs, vargs);
633 __va_copy (s.vargs, vargs);
638 memcpy (&s.vargs, &vargs, sizeof (s.va_args));
640 # endif /* __va_copy */
642 s.maxlen = (size_t)INT_MAX;
651 *ptr = s.buffer_base;