1 #include "stdio_impl.h"
12 /* Some useful macros */
14 #define MAX(a,b) ((a)>(b) ? (a) : (b))
15 #define MIN(a,b) ((a)<(b) ? (a) : (b))
16 #define CONCAT2(x,y) x ## y
17 #define CONCAT(x,y) CONCAT2(x,y)
19 /* Convenient bit representation for modifier flags, which all fall
20 * within 31 codepoints of the space character. */
22 #define ALT_FORM (1U<<'#'-' ')
23 #define ZERO_PAD (1U<<'0'-' ')
24 #define LEFT_ADJ (1U<<'-'-' ')
25 #define PAD_POS (1U<<' '-' ')
26 #define MARK_POS (1U<<'+'-' ')
27 #define GROUPED (1U<<'\''-' ')
29 #define FLAGMASK (ALT_FORM|ZERO_PAD|LEFT_ADJ|PAD_POS|MARK_POS|GROUPED)
31 #if UINT_MAX == ULONG_MAX
35 #if SIZE_MAX != ULONG_MAX || UINTMAX_MAX != ULLONG_MAX
39 /* State machine to accept length modifiers + conversion specifiers.
40 * Result is 0 on failure, or an argument type to pop on success. */
43 BARE, LPRE, LLPRE, HPRE, HHPRE, BIGLPRE,
46 PTR, INT, UINT, ULLONG,
53 SHORT, USHORT, CHAR, UCHAR,
55 LLONG, SIZET, IMAX, UMAX, PDIFF, UIPTR,
69 #define S(x) [(x)-'A']
71 static const unsigned char states[]['z'-'A'+1] = {
73 S('d') = INT, S('i') = INT,
74 S('o') = UINT, S('u') = UINT, S('x') = UINT, S('X') = UINT,
75 S('e') = DBL, S('f') = DBL, S('g') = DBL, S('a') = DBL,
76 S('E') = DBL, S('F') = DBL, S('G') = DBL, S('A') = DBL,
77 S('c') = CHAR, S('C') = INT,
78 S('s') = PTR, S('S') = PTR, S('p') = UIPTR, S('n') = PTR,
80 S('l') = LPRE, S('h') = HPRE, S('L') = BIGLPRE,
81 S('z') = ZTPRE, S('j') = JPRE, S('t') = ZTPRE,
82 }, { /* 1: l-prefixed */
83 S('d') = LONG, S('i') = LONG,
84 S('o') = ULONG, S('u') = ULONG, S('x') = ULONG, S('X') = ULONG,
85 S('e') = DBL, S('f') = DBL, S('g') = DBL, S('a') = DBL,
86 S('E') = DBL, S('F') = DBL, S('G') = DBL, S('A') = DBL,
87 S('c') = INT, S('s') = PTR, S('n') = PTR,
89 }, { /* 2: ll-prefixed */
90 S('d') = LLONG, S('i') = LLONG,
91 S('o') = ULLONG, S('u') = ULLONG,
92 S('x') = ULLONG, S('X') = ULLONG,
94 }, { /* 3: h-prefixed */
95 S('d') = SHORT, S('i') = SHORT,
96 S('o') = USHORT, S('u') = USHORT,
97 S('x') = USHORT, S('X') = USHORT,
100 }, { /* 4: hh-prefixed */
101 S('d') = CHAR, S('i') = CHAR,
102 S('o') = UCHAR, S('u') = UCHAR,
103 S('x') = UCHAR, S('X') = UCHAR,
105 }, { /* 5: L-prefixed */
106 S('e') = LDBL, S('f') = LDBL, S('g') = LDBL, S('a') = LDBL,
107 S('E') = LDBL, S('F') = LDBL, S('G') = LDBL, S('A') = LDBL,
109 }, { /* 6: z- or t-prefixed (assumed to be same size) */
110 S('d') = PDIFF, S('i') = PDIFF,
111 S('o') = SIZET, S('u') = SIZET,
112 S('x') = SIZET, S('X') = SIZET,
114 }, { /* 7: j-prefixed */
115 S('d') = IMAX, S('i') = IMAX,
116 S('o') = UMAX, S('u') = UMAX,
117 S('x') = UMAX, S('X') = UMAX,
122 #define OOB(x) ((unsigned)(x)-'A' > 'z'-'A')
131 static void pop_arg(union arg *arg, int type, va_list *ap)
133 /* Give the compiler a hint for optimizing the switch. */
134 if ((unsigned)type > MAXSTATE) return;
136 case PTR: arg->p = va_arg(*ap, void *);
137 break; case INT: arg->i = va_arg(*ap, int);
138 break; case UINT: arg->i = va_arg(*ap, unsigned int);
140 break; case LONG: arg->i = va_arg(*ap, long);
141 break; case ULONG: arg->i = va_arg(*ap, unsigned long);
143 break; case ULLONG: arg->i = va_arg(*ap, unsigned long long);
144 break; case SHORT: arg->i = (short)va_arg(*ap, int);
145 break; case USHORT: arg->i = (unsigned short)va_arg(*ap, int);
146 break; case CHAR: arg->i = (signed char)va_arg(*ap, int);
147 break; case UCHAR: arg->i = (unsigned char)va_arg(*ap, int);
149 break; case LLONG: arg->i = va_arg(*ap, long long);
150 break; case SIZET: arg->i = va_arg(*ap, size_t);
151 break; case IMAX: arg->i = va_arg(*ap, intmax_t);
152 break; case UMAX: arg->i = va_arg(*ap, uintmax_t);
153 break; case PDIFF: arg->i = va_arg(*ap, ptrdiff_t);
154 break; case UIPTR: arg->i = (uintptr_t)va_arg(*ap, void *);
156 break; case DBL: arg->f = va_arg(*ap, double);
157 break; case LDBL: arg->f = va_arg(*ap, long double);
161 static void out(FILE *f, const char *s, size_t l)
163 __fwritex((void *)s, l, f);
166 static void pad(FILE *f, char c, int w, int l, int fl)
169 if (fl & (LEFT_ADJ | ZERO_PAD) || l >= w) return;
171 memset(pad, c, l>sizeof pad ? sizeof pad : l);
172 for (; l >= sizeof pad; l -= sizeof pad)
173 out(f, pad, sizeof pad);
177 static const char xdigits[16] = {
181 static char *fmt_x(uintmax_t x, char *s, int lower)
183 for (; x; x>>=4) *--s = xdigits[(x&15)]|lower;
187 static char *fmt_o(uintmax_t x, char *s)
189 for (; x; x>>=3) *--s = '0' + (x&7);
193 static char *fmt_u(uintmax_t x, char *s)
196 for ( ; x>ULONG_MAX; x/=10) *--s = '0' + x%10;
197 for (y=x; y; y/=10) *--s = '0' + y%10;
201 /* Do not override this check. The floating point printing code below
202 * depends on the float.h constants being right. If they are wrong, it
203 * may overflow the stack. */
204 #if LDBL_MANT_DIG == 53
205 typedef char compiler_defines_long_double_incorrectly[9-(int)sizeof(long double)];
208 static int fmt_fp(FILE *f, long double y, int w, int p, int fl, int t)
210 uint32_t big[(LDBL_MANT_DIG+28)/29 + 1 // mantissa expansion
211 + (LDBL_MAX_EXP+LDBL_MANT_DIG+28+8)/9]; // exponent expansion
212 uint32_t *a, *d, *r, *z;
213 int e2=0, e, i, j, l;
214 char buf[9+LDBL_MANT_DIG/4], *s;
215 const char *prefix="-0X+0X 0X-0x+0x 0x";
217 char ebuf0[3*sizeof(int)], *ebuf=&ebuf0[3*sizeof(int)], *estr;
222 } else if (fl & MARK_POS) {
224 } else if (fl & PAD_POS) {
226 } else prefix++, pl=0;
229 char *s = (t&32)?"inf":"INF";
230 if (y!=y) s=(t&32)?"nan":"NAN", pl=0;
231 pad(f, ' ', w, 3+pl, fl&~ZERO_PAD);
234 pad(f, ' ', w, 3+pl, fl^LEFT_ADJ);
238 y = frexpl(y, &e2) * 2;
242 long double round = 8.0;
245 if (t&32) prefix += 9;
248 if (p<0 || p>=LDBL_MANT_DIG/4-1) re=0;
249 else re=LDBL_MANT_DIG/4-1-p;
252 while (re--) round*=16;
264 estr=fmt_u(e2<0 ? -e2 : e2, ebuf);
265 if (estr==ebuf) *--estr='0';
266 *--estr = (e2<0 ? '-' : '+');
267 *--estr = t+('p'-'a');
272 *s++=xdigits[x]|(t&32);
274 if (s-buf==1 && (y||p>0||(fl&ALT_FORM))) *s++='.';
277 if (p && s-buf-2 < p)
278 l = (p+2) + (ebuf-estr);
280 l = (s-buf) + (ebuf-estr);
282 pad(f, ' ', w, pl+l, fl);
284 pad(f, '0', w, pl+l, fl^ZERO_PAD);
286 pad(f, '0', l-(ebuf-estr)-(s-buf), 0, 0);
287 out(f, estr, ebuf-estr);
288 pad(f, ' ', w, pl+l, fl^LEFT_ADJ);
293 if (y) y *= 0x1p28, e2-=28;
296 else a=r=z=big+sizeof(big)/sizeof(*big) - LDBL_MANT_DIG - 1;
300 y = 1000000000*(y-*z++);
306 for (d=z-1; d>=a; d--) {
307 uint64_t x = ((uint64_t)*d<<sh)+carry;
309 carry = x / 1000000000;
311 if (!z[-1] && z>a) z--;
312 if (carry) *--a = carry;
316 uint32_t carry=0, *b;
317 int sh=MIN(9,-e2), need=1+(p+LDBL_MANT_DIG/3+8)/9;
318 for (d=a; d<z; d++) {
319 uint32_t rm = *d & (1<<sh)-1;
320 *d = (*d>>sh) + carry;
321 carry = (1000000000>>sh) * rm;
324 if (carry) *z++ = carry;
325 /* Avoid (slow!) computation past requested precision */
326 b = (t|32)=='f' ? r : a;
327 if (z-b > need) z = b+need;
331 if (a<z) for (i=10, e=9*(r-a); *a>=i; i*=10, e++);
334 /* Perform rounding: j is precision after the radix (possibly neg) */
335 j = p - ((t|32)!='f')*e - ((t|32)=='g' && p);
338 /* We avoid C's broken division of negative numbers */
339 d = r + 1 + ((j+9*LDBL_MAX_EXP)/9 - LDBL_MAX_EXP);
342 for (i=10, j++; j<9; i*=10, j++);
344 /* Are there any significant digits past j? */
346 long double round = CONCAT(0x1p,LDBL_MANT_DIG);
348 if (*d/i & 1) round += 2;
349 if (x<i/2) small=0x0.8p0;
350 else if (x==i/2 && d+1==z) small=0x1.0p0;
352 if (pl && *prefix=='-') round*=-1, small*=-1;
354 /* Decide whether to round by probing round+small */
355 if (round+small != round) {
357 while (*d > 999999999) {
362 for (i=10, e=9*(r-a); *a>=i; i*=10, e++);
366 for (; !z[-1] && z>a; z--);
378 if (!(fl&ALT_FORM)) {
379 /* Count trailing zeros in last place */
380 if (z>a && z[-1]) for (i=10, j=0; z[-1]%i==0; i*=10, j++);
383 p = MIN(p,MAX(0,9*(z-r-1)-j));
385 p = MIN(p,MAX(0,9*(z-r-1)+e-j));
388 l = 1 + p + (p || (fl&ALT_FORM));
392 estr=fmt_u(e<0 ? -e : e, ebuf);
393 while(ebuf-estr<2) *--estr='0';
394 *--estr = (e<0 ? '-' : '+');
399 pad(f, ' ', w, pl+l, fl);
401 pad(f, '0', w, pl+l, fl^ZERO_PAD);
405 for (d=a; d<=r; d++) {
406 char *s = fmt_u(*d, buf+9);
407 if (d!=a) while (s>buf) *--s='0';
408 else if (s==buf+9) *--s='0';
411 if (p || (fl&ALT_FORM)) out(f, ".", 1);
412 for (; d<z && p>0; d++, p-=9) {
413 char *s = fmt_u(*d, buf+9);
414 while (s>buf) *--s='0';
417 pad(f, '0', p+9, 9, 0);
420 for (d=a; d<z && p>=0; d++) {
421 char *s = fmt_u(*d, buf+9);
422 if (s==buf+9) *--s='0';
423 if (d!=a) while (s>buf) *--s='0';
426 if (p>0||(fl&ALT_FORM)) out(f, ".", 1);
428 out(f, s, MIN(buf+9-s, p));
431 pad(f, '0', p+18, 18, 0);
432 out(f, estr, ebuf-estr);
435 pad(f, ' ', w, pl+l, fl^LEFT_ADJ);
440 static int getint(char **s) {
442 for (i=0; isdigit(**s); (*s)++)
443 i = 10*i + (**s-'0');
447 static int printf_core(FILE *f, const char *fmt, va_list *ap, union arg *nl_arg, int *nl_type)
449 char *a, *z, *s=(char *)fmt;
457 char buf[sizeof(uintmax_t)*3+3+LDBL_MANT_DIG/4];
464 /* Update output count, end loop when fmt is exhausted */
466 if (l > INT_MAX - cnt) {
473 /* Handle literal text and %% format specifiers */
474 for (a=s; *s && *s!='%'; s++);
475 for (z=s; s[0]=='%' && s[1]=='%'; z++, s+=2);
480 if (isdigit(s[1]) && s[2]=='$') {
489 /* Read modifier flags */
490 for (fl=0; (unsigned)*s-' '<32 && (FLAGMASK&(1U<<*s-' ')); s++)
493 /* Read field width */
495 if (isdigit(s[1]) && s[2]=='$') {
497 nl_type[s[1]-'0'] = INT;
498 w = nl_arg[s[1]-'0'].i;
501 w = f ? va_arg(*ap, int) : 0;
504 if (w<0) fl|=LEFT_ADJ, w=-w;
505 } else if ((w=getint(&s))<0) return -1;
508 if (*s=='.' && s[1]=='*') {
509 if (isdigit(s[2]) && s[3]=='$') {
510 nl_type[s[2]-'0'] = INT;
511 p = nl_arg[s[2]-'0'].i;
514 p = f ? va_arg(*ap, int) : 0;
517 } else if (*s=='.') {
522 /* Format specifier state machine */
525 if (OOB(*s)) return -1;
527 st=states[st]S(*s++);
531 /* Check validity of argument type (nl/normal) */
533 if (argpos>=0) return -1;
535 if (argpos>=0) nl_type[argpos]=st, arg=nl_arg[argpos];
536 else if (f) pop_arg(&arg, st, ap);
542 z = buf + sizeof(buf);
547 /* Transform ls,lc -> S,C */
548 if (ps && (t&15)==3) t&=~32;
550 /* - and 0 flags are mutually exclusive */
551 if (fl & LEFT_ADJ) fl &= ~ZERO_PAD;
556 case BARE: *(int *)arg.p = cnt; break;
557 case LPRE: *(long *)arg.p = cnt; break;
558 case LLPRE: *(long long *)arg.p = cnt; break;
559 case HPRE: *(unsigned short *)arg.p = cnt; break;
560 case HHPRE: *(unsigned char *)arg.p = cnt; break;
561 case ZTPRE: *(size_t *)arg.p = cnt; break;
562 case JPRE: *(uintmax_t *)arg.p = cnt; break;
566 p = MAX(p, 2*sizeof(void*));
570 a = fmt_x(arg.i, z, t&32);
571 if (arg.i && (fl & ALT_FORM)) prefix+=(t>>4), pl=2;
575 if ((fl&ALT_FORM) && arg.i) prefix+=5, pl=1;
579 if (arg.i>INTMAX_MAX) {
581 } else if (fl & MARK_POS) {
583 } else if (fl & PAD_POS) {
589 if (p>=0) fl &= ~ZERO_PAD;
594 p = MAX(p, z-a + !arg.i);
601 if (1) a = strerror(errno); else
603 a = arg.p ? arg.p : "(null)";
616 for (i=l=0; i<0U+p && *ws && (l=wctomb(mb, *ws++))>=0 && l<=0U+p-i; i+=l);
619 pad(f, ' ', w, p, fl);
621 for (i=0; i<0U+p && *ws && i+(l=wctomb(mb, *ws++))<=p; i+=l)
623 pad(f, ' ', w, p, fl^LEFT_ADJ);
626 case 'e': case 'f': case 'g': case 'a':
627 case 'E': case 'F': case 'G': case 'A':
628 l = fmt_fp(f, arg.f, w, p, fl, t);
632 if (p < z-a) p = z-a;
633 if (w < pl+p) w = pl+p;
635 pad(f, ' ', w, pl+p, fl);
637 pad(f, '0', w, pl+p, fl^ZERO_PAD);
638 pad(f, '0', p, z-a, 0);
640 pad(f, ' ', w, pl+p, fl^LEFT_ADJ);
648 for (i=1; i<=NL_ARGMAX && nl_type[i]; i++)
649 pop_arg(nl_arg+i, nl_type[i], ap);
650 for (; i<=NL_ARGMAX && !nl_type[i]; i++);
651 if (i<=NL_ARGMAX) return -1;
655 int vfprintf(FILE *restrict f, const char *restrict fmt, va_list ap)
658 int nl_type[NL_ARGMAX+1] = {0};
659 union arg nl_arg[NL_ARGMAX+1];
660 unsigned char internal_buf[80], *saved_buf = 0;
663 /* the copy allows passing va_list* even if va_list is an array */
665 if (printf_core(0, fmt, &ap2, nl_arg, nl_type) < 0) {
673 f->wpos = f->wbase = f->buf = internal_buf;
674 f->buf_size = sizeof internal_buf;
675 f->wend = internal_buf + sizeof internal_buf;
677 ret = printf_core(f, fmt, &ap2, nl_arg, nl_type);
680 if (!f->wpos) ret = -1;
683 f->wpos = f->wbase = f->wend = 0;