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
45 #define min(a, b) ((a) > (b) ? (b) : (a))
48 #define max(a, b) ((a) < (b) ? (b) : (a))
66 unsigned char *theend;
69 int (*append_char)(struct state *, unsigned char);
70 int (*reserve)(struct state *, size_t);
74 #ifndef HAVE_VSNPRINTF
76 sn_reserve (struct state *state, size_t n)
78 return state->s + n > state->theend;
82 sn_append_char (struct state *state, unsigned char c)
84 if (sn_reserve (state, 1)) {
94 as_reserve (struct state *state, size_t n)
96 if (state->s + n > state->theend) {
97 int off = state->s - state->str;
100 if (state->max_sz && state->sz >= state->max_sz)
103 state->sz = max(state->sz * 2, state->sz + n);
105 state->sz = min(state->sz, state->max_sz);
106 tmp = realloc (state->str, state->sz);
110 state->s = state->str + off;
111 state->theend = state->str + state->sz - 1;
117 as_append_char (struct state *state, unsigned char c)
119 if(as_reserve (state, 1))
128 append_number(struct state *state,
129 unsigned long num, unsigned base, char *rep,
130 int width, int prec, int flags, int minusp)
135 /* given precision, ignore zero flag */
140 /* zero value with zero precision -> "" */
141 if(prec == 0 && num == 0)
144 if((*state->append_char)(state, rep[num % base]))
150 /* pad with prec zeros */
152 if((*state->append_char)(state, '0'))
156 /* add length of alternate prefix (added later) to len */
157 if(flags & alternate_flag && (base == 16 || base == 8))
160 if(flags & zero_flag){
162 if(minusp || (flags & space_flag) || (flags & plus_flag))
165 if((*state->append_char)(state, '0'))
170 /* add alternate prefix */
171 if(flags & alternate_flag && (base == 16 || base == 8)){
173 if((*state->append_char)(state, rep[10] + 23)) /* XXX */
175 if((*state->append_char)(state, '0'))
180 if((*state->append_char)(state, '-'))
183 } else if(flags & plus_flag) {
184 if((*state->append_char)(state, '+'))
187 } else if(flags & space_flag) {
188 if((*state->append_char)(state, ' '))
192 if(flags & minus_flag)
193 /* swap before padding with spaces */
194 for(i = 0; i < len / 2; i++){
195 char c = state->s[-i-1];
196 state->s[-i-1] = state->s[-len+i];
197 state->s[-len+i] = c;
201 if((*state->append_char)(state, ' '))
205 if(!(flags & minus_flag))
206 /* swap after padding with spaces */
207 for(i = 0; i < len / 2; i++){
208 char c = state->s[-i-1];
209 state->s[-i-1] = state->s[-len+i];
210 state->s[-len+i] = c;
217 append_string (struct state *state,
224 arg = (unsigned char*)"(null)";
229 width -= strlen((char *)arg);
230 if(!(flags & minus_flag))
232 if((*state->append_char) (state, ' '))
235 while (*arg && prec--)
236 if ((*state->append_char) (state, *arg++))
240 if ((*state->append_char) (state, *arg++))
243 if(flags & minus_flag)
245 if((*state->append_char) (state, ' '))
251 append_char(struct state *state,
256 while(!(flags & minus_flag) && --width > 0)
257 if((*state->append_char) (state, ' '))
260 if((*state->append_char) (state, arg))
262 while((flags & minus_flag) && --width > 0)
263 if((*state->append_char) (state, ' '))
270 * This can't be made into a function...
273 #define PARSE_INT_FORMAT(res, arg, unsig) \
275 res = (unsig long)va_arg(arg, unsig long); \
276 else if (short_flag) \
277 res = (unsig short)va_arg(arg, unsig int); \
279 res = (unsig int)va_arg(arg, unsig int)
282 * zyxprintf - return 0 or -1
286 xyzprintf (struct state *state, const char *char_format, va_list ap)
288 const unsigned char *format = (const unsigned char *)char_format;
291 while((c = *format++)) {
300 while((c = *format++)){
308 flags |= alternate_flag;
315 if((flags & space_flag) && (flags & plus_flag))
318 if((flags & minus_flag) && (flags & zero_flag))
324 width = width * 10 + c - '0';
328 width = va_arg(ap, int);
338 prec = prec * 10 + c - '0';
342 prec = va_arg(ap, int);
352 } else if (c == 'l') {
359 if(append_char(state, va_arg(ap, int), width, flags))
363 if (append_string(state,
364 va_arg(ap, unsigned char*),
376 PARSE_INT_FORMAT(arg, ap, signed);
384 if (append_number (state, num, 10, "0123456789",
385 width, prec, flags, minusp))
392 PARSE_INT_FORMAT(arg, ap, unsigned);
394 if (append_number (state, arg, 10, "0123456789",
395 width, prec, flags, 0))
402 PARSE_INT_FORMAT(arg, ap, unsigned);
404 if (append_number (state, arg, 010, "01234567",
405 width, prec, flags, 0))
412 PARSE_INT_FORMAT(arg, ap, unsigned);
414 if (append_number (state, arg, 0x10, "0123456789abcdef",
415 width, prec, flags, 0))
422 PARSE_INT_FORMAT(arg, ap, unsigned);
424 if (append_number (state, arg, 0x10, "0123456789ABCDEF",
425 width, prec, flags, 0))
430 unsigned long arg = (unsigned long)va_arg(ap, void*);
432 if (append_number (state, arg, 0x10, "0123456789ABCDEF",
433 width, prec, flags, 0))
438 int *arg = va_arg(ap, int*);
439 *arg = state->s - state->str;
446 if ((*state->append_char)(state, c))
450 if ( (*state->append_char)(state, '%')
451 || (*state->append_char)(state, c))
456 if ((*state->append_char) (state, c))
462 #ifndef HAVE_SNPRINTF
464 snprintf (char *str, size_t sz, const char *format, ...)
469 va_start(args, format);
470 ret = vsnprintf (str, sz, format, args);
481 ret2 = vsprintf (tmp, format, args);
482 if (ret != ret2 || strcmp(str, tmp))
493 #ifndef HAVE_ASPRINTF
495 asprintf (char **ret, const char *format, ...)
500 va_start(args, format);
501 val = vasprintf (ret, format, args);
507 tmp = malloc (val + 1);
511 ret2 = vsprintf (tmp, format, args);
512 if (val != ret2 || strcmp(*ret, tmp))
523 #ifndef HAVE_ASNPRINTF
525 asnprintf (char **ret, size_t max_sz, const char *format, ...)
530 va_start(args, format);
531 val = vasnprintf (ret, max_sz, format, args);
537 tmp = malloc (val + 1);
541 ret2 = vsprintf (tmp, format, args);
542 if (val != ret2 || strcmp(*ret, tmp))
553 #ifndef HAVE_VASPRINTF
555 vasprintf (char **ret, const char *format, va_list args)
557 return vasnprintf (ret, 0, format, args);
562 #ifndef HAVE_VASNPRINTF
564 vasnprintf (char **ret, size_t max_sz, const char *format, va_list args)
570 state.max_sz = max_sz;
572 state.str = malloc(state.sz);
573 if (state.str == NULL) {
578 state.theend = state.s + state.sz - 1;
579 state.append_char = as_append_char;
580 state.reserve = as_reserve;
582 st = xyzprintf (&state, format, args);
591 len = state.s - state.str;
592 tmp = realloc (state.str, len+1);
604 #ifndef HAVE_VSNPRINTF
606 vsnprintf (char *str, size_t sz, const char *format, va_list args)
610 unsigned char *ustr = (unsigned char *)str;
616 state.theend = ustr + sz - 1;
617 state.append_char = sn_append_char;
618 state.reserve = sn_reserve;
620 ret = xyzprintf (&state, format, args);
625 return state.s - state.str;