2 * Copyright (c) 1995-2000 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
44 #define min(a, b) ((a) > (b) ? (b) : (a))
47 #define max(a, b) ((a) < (b) ? (b) : (a))
65 unsigned char *theend;
68 int (*append_char) (struct state *, unsigned char);
69 int (*reserve) (struct state *, size_t);
73 #ifndef HAVE_VSNPRINTF
75 sn_reserve(struct state *state, size_t n)
77 return state->s + n > state->theend;
81 sn_append_char(struct state *state, unsigned char c)
83 if (sn_reserve(state, 1)) {
93 as_reserve(struct state *state, size_t n)
95 if (state->s + n > state->theend) {
96 int off = state->s - state->str;
99 if (state->max_sz && state->sz >= state->max_sz)
102 state->sz = max(state->sz * 2, state->sz + n);
104 state->sz = min(state->sz, state->max_sz);
105 tmp = realloc(state->str, state->sz);
109 state->s = state->str + off;
110 state->theend = state->str + state->sz - 1;
116 as_append_char(struct state *state, unsigned char c)
118 if (as_reserve(state, 1))
127 append_number(struct state *state, unsigned long num, unsigned base,
128 char *rep, int width, int prec, int flags, int minusp)
133 /* given precision, ignore zero flag */
138 /* zero value with zero precision -> "" */
139 if (prec == 0 && num == 0)
142 if ((*state->append_char) (state, rep[num % base]))
148 /* pad with prec zeros */
150 if ((*state->append_char) (state, '0'))
154 /* add length of alternate prefix (added later) to len */
155 if (flags & alternate_flag && (base == 16 || base == 8))
158 if (flags & zero_flag) {
160 if (minusp || (flags & space_flag) || (flags & plus_flag))
162 while (width-- > 0) {
163 if ((*state->append_char) (state, '0'))
168 /* add alternate prefix */
169 if (flags & alternate_flag && (base == 16 || base == 8)) {
171 if ((*state->append_char) (state, rep[10] + 23)) /* XXX */
173 if ((*state->append_char) (state, '0'))
178 if ((*state->append_char) (state, '-'))
181 } else if (flags & plus_flag) {
182 if ((*state->append_char) (state, '+'))
185 } else if (flags & space_flag) {
186 if ((*state->append_char) (state, ' '))
190 if (flags & minus_flag)
191 /* swap before padding with spaces */
192 for (i = 0; i < len / 2; i++) {
193 char c = state->s[-i - 1];
194 state->s[-i - 1] = state->s[-len + i];
195 state->s[-len + i] = c;
198 while (width-- > 0) {
199 if ((*state->append_char) (state, ' '))
203 if (!(flags & minus_flag))
204 /* swap after padding with spaces */
205 for (i = 0; i < len / 2; i++) {
206 char c = state->s[-i - 1];
207 state->s[-i - 1] = state->s[-len + i];
208 state->s[-len + i] = c;
215 append_string(struct state *state, unsigned char *arg, int width, int prec,
219 arg = (unsigned char *)"(null)";
224 width -= strlen((char *)arg);
225 if (!(flags & minus_flag))
227 if ((*state->append_char) (state, ' '))
230 while (*arg && prec--)
231 if ((*state->append_char) (state, *arg++))
235 if ((*state->append_char) (state, *arg++))
238 if (flags & minus_flag)
240 if ((*state->append_char) (state, ' '))
246 append_char(struct state *state, unsigned char arg, int width, int flags)
248 while (!(flags & minus_flag) && --width > 0)
249 if ((*state->append_char) (state, ' '))
252 if ((*state->append_char) (state, arg))
254 while ((flags & minus_flag) && --width > 0)
255 if ((*state->append_char) (state, ' '))
262 * This can't be made into a function...
265 #define PARSE_INT_FORMAT(res, arg, unsig) \
267 res = (unsig long)va_arg(arg, unsig long); \
268 else if (short_flag) \
269 res = (unsig short)va_arg(arg, unsig int); \
271 res = (unsig int)va_arg(arg, unsig int)
274 * zyxprintf - return 0 or -1
278 xyzprintf(struct state *state, const char *char_format, va_list ap)
280 const unsigned char *format = (const unsigned char *)char_format;
283 while ((c = *format++)) {
292 while ((c = *format++)) {
300 flags |= alternate_flag;
307 if ((flags & space_flag) && (flags & plus_flag))
310 if ((flags & minus_flag) && (flags & zero_flag))
316 width = width * 10 + c - '0';
318 } while (isdigit(c));
320 width = va_arg(ap, int);
330 prec = prec * 10 + c - '0';
332 } while (isdigit(c));
334 prec = va_arg(ap, int);
344 } else if (c == 'l') {
351 if (append_char(state, va_arg(ap, int), width, flags))
356 (state, va_arg(ap, unsigned char *), width, prec, flags))
365 PARSE_INT_FORMAT(arg, ap, signed);
374 (state, num, 10, "0123456789", width, prec, flags,
382 PARSE_INT_FORMAT(arg, ap, unsigned);
385 (state, arg, 10, "0123456789", width, prec, flags, 0))
392 PARSE_INT_FORMAT(arg, ap, unsigned);
395 (state, arg, 010, "01234567", width, prec, flags, 0))
402 PARSE_INT_FORMAT(arg, ap, unsigned);
405 (state, arg, 0x10, "0123456789abcdef", width, prec,
413 PARSE_INT_FORMAT(arg, ap, unsigned);
416 (state, arg, 0x10, "0123456789ABCDEF", width, prec,
422 unsigned long arg = (unsigned long)va_arg(ap, void *);
425 (state, arg, 0x10, "0123456789ABCDEF", width, prec,
431 int *arg = va_arg(ap, int *);
432 *arg = state->s - state->str;
439 if ((*state->append_char) (state, c))
443 if ((*state->append_char) (state, '%')
444 || (*state->append_char) (state, c))
448 } else if ((*state->append_char) (state, c))
454 #ifndef HAVE_SNPRINTF
456 snprintf(char *str, size_t sz, const char *format, ...)
461 va_start(args, format);
462 ret = vsnprintf(str, sz, format, args);
473 ret2 = vsprintf(tmp, format, args);
474 if (ret != ret2 || strcmp(str, tmp))
485 #ifndef HAVE_ASPRINTF
487 asprintf(char **ret, const char *format, ...)
492 va_start(args, format);
493 val = vasprintf(ret, format, args);
499 tmp = malloc(val + 1);
503 ret2 = vsprintf(tmp, format, args);
504 if (val != ret2 || strcmp(*ret, tmp))
515 #ifndef HAVE_ASNPRINTF
517 asnprintf(char **ret, size_t max_sz, const char *format, ...)
522 va_start(args, format);
523 val = vasnprintf(ret, max_sz, format, args);
529 tmp = malloc(val + 1);
533 ret2 = vsprintf(tmp, format, args);
534 if (val != ret2 || strcmp(*ret, tmp))
545 #ifndef HAVE_VASPRINTF
547 vasprintf(char **ret, const char *format, va_list args)
549 return vasnprintf(ret, 0, format, args);
554 #ifndef HAVE_VASNPRINTF
556 vasnprintf(char **ret, size_t max_sz, const char *format, va_list args)
562 state.max_sz = max_sz;
564 state.str = malloc(state.sz);
565 if (state.str == NULL) {
570 state.theend = state.s + state.sz - 1;
571 state.append_char = as_append_char;
572 state.reserve = as_reserve;
574 st = xyzprintf(&state, format, args);
583 len = state.s - state.str;
584 tmp = realloc(state.str, len + 1);
596 #ifndef HAVE_VSNPRINTF
598 vsnprintf(char *str, size_t sz, const char *format, va_list args)
602 unsigned char *ustr = (unsigned char *)str;
608 state.theend = ustr + sz - 1;
609 state.append_char = sn_append_char;
610 state.reserve = sn_reserve;
612 ret = xyzprintf(&state, format, args);
617 return state.s - state.str;