1235 lines
30 KiB
C
1235 lines
30 KiB
C
/*-
|
|
* Copyright (c) 1990, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Chris Torek.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
|
static char sccsid[] = "@(#)vfprintf.c 8.1 (Berkeley) 6/4/93";
|
|
#endif /* LIBC_SCCS and not lint */
|
|
#include <sys/cdefs.h>
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
/*
|
|
* Actual printf innards.
|
|
*
|
|
* This code is large and complicated...
|
|
*/
|
|
|
|
#include "namespace.h"
|
|
#include <sys/types.h>
|
|
|
|
#include <ctype.h>
|
|
#include <limits.h>
|
|
#include <locale.h>
|
|
#include <stddef.h>
|
|
#include <stdint.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <wchar.h>
|
|
#include <printf.h>
|
|
|
|
#include <stdarg.h>
|
|
#include "un-namespace.h"
|
|
|
|
#include "libc_private.h"
|
|
#include "local.h"
|
|
#include "fvwrite.h"
|
|
#include "printflocal.h"
|
|
|
|
static int __sprint(FILE *, struct __suio *);
|
|
static int __sbprintf(FILE *, const char *, va_list) __printflike(2, 0);
|
|
static char *__ujtoa(uintmax_t, char *, int, int, const char *, int, char,
|
|
const char *);
|
|
static char *__ultoa(u_long, char *, int, int, const char *, int, char,
|
|
const char *);
|
|
static char *__wcsconv(wchar_t *, int);
|
|
|
|
/*
|
|
* Flush out all the vectors defined by the given uio,
|
|
* then reset it so that it can be reused.
|
|
*/
|
|
static int
|
|
__sprint(FILE *fp, struct __suio *uio)
|
|
{
|
|
int err;
|
|
|
|
if (uio->uio_resid == 0) {
|
|
uio->uio_iovcnt = 0;
|
|
return (0);
|
|
}
|
|
err = __sfvwrite(fp, uio);
|
|
uio->uio_resid = 0;
|
|
uio->uio_iovcnt = 0;
|
|
return (err);
|
|
}
|
|
|
|
/*
|
|
* Helper function for `fprintf to unbuffered unix file': creates a
|
|
* temporary buffer. We only work on write-only files; this avoids
|
|
* worries about ungetc buffers and so forth.
|
|
*/
|
|
static int
|
|
__sbprintf(FILE *fp, const char *fmt, va_list ap)
|
|
{
|
|
int ret;
|
|
FILE fake;
|
|
unsigned char buf[BUFSIZ];
|
|
|
|
/* copy the important variables */
|
|
fake._flags = fp->_flags & ~__SNBF;
|
|
fake._file = fp->_file;
|
|
fake._cookie = fp->_cookie;
|
|
fake._write = fp->_write;
|
|
fake._orientation = fp->_orientation;
|
|
fake._mbstate = fp->_mbstate;
|
|
|
|
/* set up the buffer */
|
|
fake._bf._base = fake._p = buf;
|
|
fake._bf._size = fake._w = sizeof(buf);
|
|
fake._lbfsize = 0; /* not actually used, but Just In Case */
|
|
|
|
/* do the work, then copy any error status */
|
|
ret = __vfprintf(&fake, fmt, ap);
|
|
if (ret >= 0 && __fflush(&fake))
|
|
ret = EOF;
|
|
if (fake._flags & __SERR)
|
|
fp->_flags |= __SERR;
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* Convert an unsigned long to ASCII for printf purposes, returning
|
|
* a pointer to the first character of the string representation.
|
|
* Octal numbers can be forced to have a leading zero; hex numbers
|
|
* use the given digits.
|
|
*/
|
|
static char *
|
|
__ultoa(u_long val, char *endp, int base, int octzero, const char *xdigs,
|
|
int needgrp, char thousep, const char *grp)
|
|
{
|
|
char *cp = endp;
|
|
long sval;
|
|
int ndig;
|
|
|
|
/*
|
|
* Handle the three cases separately, in the hope of getting
|
|
* better/faster code.
|
|
*/
|
|
switch (base) {
|
|
case 10:
|
|
if (val < 10) { /* many numbers are 1 digit */
|
|
*--cp = to_char(val);
|
|
return (cp);
|
|
}
|
|
ndig = 0;
|
|
/*
|
|
* On many machines, unsigned arithmetic is harder than
|
|
* signed arithmetic, so we do at most one unsigned mod and
|
|
* divide; this is sufficient to reduce the range of
|
|
* the incoming value to where signed arithmetic works.
|
|
*/
|
|
if (val > LONG_MAX) {
|
|
*--cp = to_char(val % 10);
|
|
ndig++;
|
|
sval = val / 10;
|
|
} else
|
|
sval = val;
|
|
do {
|
|
*--cp = to_char(sval % 10);
|
|
ndig++;
|
|
/*
|
|
* If (*grp == CHAR_MAX) then no more grouping
|
|
* should be performed.
|
|
*/
|
|
if (needgrp && ndig == *grp && *grp != CHAR_MAX
|
|
&& sval > 9) {
|
|
*--cp = thousep;
|
|
ndig = 0;
|
|
/*
|
|
* If (*(grp+1) == '\0') then we have to
|
|
* use *grp character (last grouping rule)
|
|
* for all next cases
|
|
*/
|
|
if (*(grp+1) != '\0')
|
|
grp++;
|
|
}
|
|
sval /= 10;
|
|
} while (sval != 0);
|
|
break;
|
|
|
|
case 8:
|
|
do {
|
|
*--cp = to_char(val & 7);
|
|
val >>= 3;
|
|
} while (val);
|
|
if (octzero && *cp != '0')
|
|
*--cp = '0';
|
|
break;
|
|
|
|
case 16:
|
|
do {
|
|
*--cp = xdigs[val & 15];
|
|
val >>= 4;
|
|
} while (val);
|
|
break;
|
|
|
|
default: /* oops */
|
|
abort();
|
|
}
|
|
return (cp);
|
|
}
|
|
|
|
/* Identical to __ultoa, but for intmax_t. */
|
|
static char *
|
|
__ujtoa(uintmax_t val, char *endp, int base, int octzero, const char *xdigs,
|
|
int needgrp, char thousep, const char *grp)
|
|
{
|
|
char *cp = endp;
|
|
intmax_t sval;
|
|
int ndig;
|
|
|
|
/* quick test for small values; __ultoa is typically much faster */
|
|
/* (perhaps instead we should run until small, then call __ultoa?) */
|
|
if (val <= ULONG_MAX)
|
|
return (__ultoa((u_long)val, endp, base, octzero, xdigs,
|
|
needgrp, thousep, grp));
|
|
switch (base) {
|
|
case 10:
|
|
if (val < 10) {
|
|
*--cp = to_char(val % 10);
|
|
return (cp);
|
|
}
|
|
ndig = 0;
|
|
if (val > INTMAX_MAX) {
|
|
*--cp = to_char(val % 10);
|
|
ndig++;
|
|
sval = val / 10;
|
|
} else
|
|
sval = val;
|
|
do {
|
|
*--cp = to_char(sval % 10);
|
|
ndig++;
|
|
/*
|
|
* If (*grp == CHAR_MAX) then no more grouping
|
|
* should be performed.
|
|
*/
|
|
if (needgrp && *grp != CHAR_MAX && ndig == *grp
|
|
&& sval > 9) {
|
|
*--cp = thousep;
|
|
ndig = 0;
|
|
/*
|
|
* If (*(grp+1) == '\0') then we have to
|
|
* use *grp character (last grouping rule)
|
|
* for all next cases
|
|
*/
|
|
if (*(grp+1) != '\0')
|
|
grp++;
|
|
}
|
|
sval /= 10;
|
|
} while (sval != 0);
|
|
break;
|
|
|
|
case 8:
|
|
do {
|
|
*--cp = to_char(val & 7);
|
|
val >>= 3;
|
|
} while (val);
|
|
if (octzero && *cp != '0')
|
|
*--cp = '0';
|
|
break;
|
|
|
|
case 16:
|
|
do {
|
|
*--cp = xdigs[val & 15];
|
|
val >>= 4;
|
|
} while (val);
|
|
break;
|
|
|
|
default:
|
|
abort();
|
|
}
|
|
return (cp);
|
|
}
|
|
|
|
/*
|
|
* Convert a wide character string argument for the %ls format to a multibyte
|
|
* string representation. If not -1, prec specifies the maximum number of
|
|
* bytes to output, and also means that we can't assume that the wide char.
|
|
* string ends is null-terminated.
|
|
*/
|
|
static char *
|
|
__wcsconv(wchar_t *wcsarg, int prec)
|
|
{
|
|
static const mbstate_t initial;
|
|
mbstate_t mbs;
|
|
char buf[MB_LEN_MAX];
|
|
wchar_t *p;
|
|
char *convbuf;
|
|
size_t clen, nbytes;
|
|
|
|
/* Allocate space for the maximum number of bytes we could output. */
|
|
if (prec < 0) {
|
|
p = wcsarg;
|
|
mbs = initial;
|
|
nbytes = wcsrtombs(NULL, (const wchar_t **)&p, 0, &mbs);
|
|
if (nbytes == (size_t)-1)
|
|
return (NULL);
|
|
} else {
|
|
/*
|
|
* Optimisation: if the output precision is small enough,
|
|
* just allocate enough memory for the maximum instead of
|
|
* scanning the string.
|
|
*/
|
|
if (prec < 128)
|
|
nbytes = prec;
|
|
else {
|
|
nbytes = 0;
|
|
p = wcsarg;
|
|
mbs = initial;
|
|
for (;;) {
|
|
clen = wcrtomb(buf, *p++, &mbs);
|
|
if (clen == 0 || clen == (size_t)-1 ||
|
|
nbytes + clen > prec)
|
|
break;
|
|
nbytes += clen;
|
|
}
|
|
}
|
|
}
|
|
if ((convbuf = malloc(nbytes + 1)) == NULL)
|
|
return (NULL);
|
|
|
|
/* Fill the output buffer. */
|
|
p = wcsarg;
|
|
mbs = initial;
|
|
if ((nbytes = wcsrtombs(convbuf, (const wchar_t **)&p,
|
|
nbytes, &mbs)) == (size_t)-1) {
|
|
free(convbuf);
|
|
return (NULL);
|
|
}
|
|
convbuf[nbytes] = '\0';
|
|
return (convbuf);
|
|
}
|
|
|
|
/*
|
|
* MT-safe version
|
|
*/
|
|
int
|
|
vfprintf(FILE * __restrict fp, const char * __restrict fmt0, va_list ap)
|
|
|
|
{
|
|
int ret;
|
|
|
|
FLOCKFILE(fp);
|
|
ret = __vfprintf(fp, fmt0, ap);
|
|
FUNLOCKFILE(fp);
|
|
return (ret);
|
|
}
|
|
|
|
#ifndef NO_FLOATING_POINT
|
|
|
|
#define dtoa __dtoa
|
|
#define freedtoa __freedtoa
|
|
|
|
#include <float.h>
|
|
#include <math.h>
|
|
#include "floatio.h"
|
|
#include "gdtoa.h"
|
|
|
|
#define DEFPREC 6
|
|
|
|
static int exponent(char *, int, int);
|
|
|
|
#endif /* !NO_FLOATING_POINT */
|
|
|
|
/*
|
|
* The size of the buffer we use as scratch space for integer
|
|
* conversions, among other things. Technically, we would need the
|
|
* most space for base 10 conversions with thousands' grouping
|
|
* characters between each pair of digits. 100 bytes is a
|
|
* conservative overestimate even for a 128-bit uintmax_t.
|
|
*/
|
|
#define BUF 100
|
|
|
|
/*
|
|
* Non-MT-safe version
|
|
*/
|
|
int
|
|
__vfprintf(FILE *fp, const char *fmt0, va_list ap)
|
|
{
|
|
char *fmt; /* format string */
|
|
int ch; /* character from fmt */
|
|
int n, n2; /* handy integer (short term usage) */
|
|
char *cp; /* handy char pointer (short term usage) */
|
|
struct __siov *iovp; /* for PRINT macro */
|
|
int flags; /* flags as above */
|
|
int ret; /* return value accumulator */
|
|
int width; /* width from format (%8d), or 0 */
|
|
int prec; /* precision from format; <0 for N/A */
|
|
char sign; /* sign prefix (' ', '+', '-', or \0) */
|
|
char thousands_sep; /* locale specific thousands separator */
|
|
const char *grouping; /* locale specific numeric grouping rules */
|
|
|
|
if (__use_xprintf == 0 && getenv("USE_XPRINTF"))
|
|
__use_xprintf = 1;
|
|
if (__use_xprintf > 0)
|
|
return (__xvprintf(fp, fmt0, ap));
|
|
|
|
#ifndef NO_FLOATING_POINT
|
|
/*
|
|
* We can decompose the printed representation of floating
|
|
* point numbers into several parts, some of which may be empty:
|
|
*
|
|
* [+|-| ] [0x|0X] MMM . NNN [e|E|p|P] [+|-] ZZ
|
|
* A B ---C--- D E F
|
|
*
|
|
* A: 'sign' holds this value if present; '\0' otherwise
|
|
* B: ox[1] holds the 'x' or 'X'; '\0' if not hexadecimal
|
|
* C: cp points to the string MMMNNN. Leading and trailing
|
|
* zeros are not in the string and must be added.
|
|
* D: expchar holds this character; '\0' if no exponent, e.g. %f
|
|
* F: at least two digits for decimal, at least one digit for hex
|
|
*/
|
|
char *decimal_point; /* locale specific decimal point */
|
|
int signflag; /* true if float is negative */
|
|
union { /* floating point arguments %[aAeEfFgG] */
|
|
double dbl;
|
|
long double ldbl;
|
|
} fparg;
|
|
int expt; /* integer value of exponent */
|
|
char expchar; /* exponent character: [eEpP\0] */
|
|
char *dtoaend; /* pointer to end of converted digits */
|
|
int expsize; /* character count for expstr */
|
|
int lead; /* sig figs before decimal or group sep */
|
|
int ndig; /* actual number of digits returned by dtoa */
|
|
char expstr[MAXEXPDIG+2]; /* buffer for exponent string: e+ZZZ */
|
|
char *dtoaresult; /* buffer allocated by dtoa */
|
|
int nseps; /* number of group separators with ' */
|
|
int nrepeats; /* number of repeats of the last group */
|
|
#endif
|
|
u_long ulval; /* integer arguments %[diouxX] */
|
|
uintmax_t ujval; /* %j, %ll, %q, %t, %z integers */
|
|
int base; /* base for [diouxX] conversion */
|
|
int dprec; /* a copy of prec if [diouxX], 0 otherwise */
|
|
int realsz; /* field size expanded by dprec, sign, etc */
|
|
int size; /* size of converted field or string */
|
|
int prsize; /* max size of printed field */
|
|
const char *xdigs; /* digits for %[xX] conversion */
|
|
#define NIOV 8
|
|
struct __suio uio; /* output information: summary */
|
|
struct __siov iov[NIOV];/* ... and individual io vectors */
|
|
char buf[BUF]; /* buffer with space for digits of uintmax_t */
|
|
char ox[2]; /* space for 0x; ox[1] is either x, X, or \0 */
|
|
union arg *argtable; /* args, built due to positional arg */
|
|
union arg statargtable [STATIC_ARG_TBL_SIZE];
|
|
int nextarg; /* 1-based argument index */
|
|
va_list orgap; /* original argument pointer */
|
|
char *convbuf; /* wide to multibyte conversion result */
|
|
|
|
/*
|
|
* Choose PADSIZE to trade efficiency vs. size. If larger printf
|
|
* fields occur frequently, increase PADSIZE and make the initialisers
|
|
* below longer.
|
|
*/
|
|
#define PADSIZE 16 /* pad chunk size */
|
|
static char blanks[PADSIZE] =
|
|
{' ',' ',' ',' ',' ',' ',' ',' ',' ',' ',' ',' ',' ',' ',' ',' '};
|
|
static char zeroes[PADSIZE] =
|
|
{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0'};
|
|
|
|
static const char xdigs_lower[16] = "0123456789abcdef";
|
|
static const char xdigs_upper[16] = "0123456789ABCDEF";
|
|
|
|
/*
|
|
* BEWARE, these `goto error' on error, and PAD uses `n'.
|
|
*/
|
|
#define PRINT(ptr, len) { \
|
|
iovp->iov_base = (ptr); \
|
|
iovp->iov_len = (len); \
|
|
uio.uio_resid += (len); \
|
|
iovp++; \
|
|
if (++uio.uio_iovcnt >= NIOV) { \
|
|
if (__sprint(fp, &uio)) \
|
|
goto error; \
|
|
iovp = iov; \
|
|
} \
|
|
}
|
|
#define PAD(howmany, with) { \
|
|
if ((n = (howmany)) > 0) { \
|
|
while (n > PADSIZE) { \
|
|
PRINT(with, PADSIZE); \
|
|
n -= PADSIZE; \
|
|
} \
|
|
PRINT(with, n); \
|
|
} \
|
|
}
|
|
#define PRINTANDPAD(p, ep, len, with) do { \
|
|
n2 = (ep) - (p); \
|
|
if (n2 > (len)) \
|
|
n2 = (len); \
|
|
if (n2 > 0) \
|
|
PRINT((p), n2); \
|
|
PAD((len) - (n2 > 0 ? n2 : 0), (with)); \
|
|
} while(0)
|
|
#define FLUSH() { \
|
|
if (uio.uio_resid && __sprint(fp, &uio)) \
|
|
goto error; \
|
|
uio.uio_iovcnt = 0; \
|
|
iovp = iov; \
|
|
}
|
|
|
|
/*
|
|
* Get the argument indexed by nextarg. If the argument table is
|
|
* built, use it to get the argument. If its not, get the next
|
|
* argument (and arguments must be gotten sequentially).
|
|
*/
|
|
#define GETARG(type) \
|
|
((argtable != NULL) ? *((type*)(&argtable[nextarg++])) : \
|
|
(nextarg++, va_arg(ap, type)))
|
|
|
|
/*
|
|
* To extend shorts properly, we need both signed and unsigned
|
|
* argument extraction methods.
|
|
*/
|
|
#define SARG() \
|
|
(flags&LONGINT ? GETARG(long) : \
|
|
flags&SHORTINT ? (long)(short)GETARG(int) : \
|
|
flags&CHARINT ? (long)(signed char)GETARG(int) : \
|
|
(long)GETARG(int))
|
|
#define UARG() \
|
|
(flags&LONGINT ? GETARG(u_long) : \
|
|
flags&SHORTINT ? (u_long)(u_short)GETARG(int) : \
|
|
flags&CHARINT ? (u_long)(u_char)GETARG(int) : \
|
|
(u_long)GETARG(u_int))
|
|
#define INTMAX_SIZE (INTMAXT|SIZET|PTRDIFFT|LLONGINT)
|
|
#define SJARG() \
|
|
(flags&INTMAXT ? GETARG(intmax_t) : \
|
|
flags&SIZET ? (intmax_t)GETARG(size_t) : \
|
|
flags&PTRDIFFT ? (intmax_t)GETARG(ptrdiff_t) : \
|
|
(intmax_t)GETARG(long long))
|
|
#define UJARG() \
|
|
(flags&INTMAXT ? GETARG(uintmax_t) : \
|
|
flags&SIZET ? (uintmax_t)GETARG(size_t) : \
|
|
flags&PTRDIFFT ? (uintmax_t)GETARG(ptrdiff_t) : \
|
|
(uintmax_t)GETARG(unsigned long long))
|
|
|
|
/*
|
|
* Get * arguments, including the form *nn$. Preserve the nextarg
|
|
* that the argument can be gotten once the type is determined.
|
|
*/
|
|
#define GETASTER(val) \
|
|
n2 = 0; \
|
|
cp = fmt; \
|
|
while (is_digit(*cp)) { \
|
|
n2 = 10 * n2 + to_digit(*cp); \
|
|
cp++; \
|
|
} \
|
|
if (*cp == '$') { \
|
|
int hold = nextarg; \
|
|
if (argtable == NULL) { \
|
|
argtable = statargtable; \
|
|
if (__find_arguments (fmt0, orgap, &argtable)) { \
|
|
ret = EOF; \
|
|
goto error; \
|
|
} \
|
|
} \
|
|
nextarg = n2; \
|
|
val = GETARG (int); \
|
|
nextarg = hold; \
|
|
fmt = ++cp; \
|
|
} else { \
|
|
val = GETARG (int); \
|
|
}
|
|
|
|
|
|
thousands_sep = '\0';
|
|
grouping = NULL;
|
|
convbuf = NULL;
|
|
#ifndef NO_FLOATING_POINT
|
|
dtoaresult = NULL;
|
|
decimal_point = localeconv()->decimal_point;
|
|
#endif
|
|
/* sorry, fprintf(read_only_file, "") returns EOF, not 0 */
|
|
if (prepwrite(fp) != 0)
|
|
return (EOF);
|
|
|
|
/* optimise fprintf(stderr) (and other unbuffered Unix files) */
|
|
if ((fp->_flags & (__SNBF|__SWR|__SRW)) == (__SNBF|__SWR) &&
|
|
fp->_file >= 0)
|
|
return (__sbprintf(fp, fmt0, ap));
|
|
|
|
fmt = (char *)fmt0;
|
|
argtable = NULL;
|
|
nextarg = 1;
|
|
va_copy(orgap, ap);
|
|
uio.uio_iov = iovp = iov;
|
|
uio.uio_resid = 0;
|
|
uio.uio_iovcnt = 0;
|
|
ret = 0;
|
|
|
|
/*
|
|
* Scan the format for conversions (`%' character).
|
|
*/
|
|
for (;;) {
|
|
for (cp = fmt; (ch = *fmt) != '\0' && ch != '%'; fmt++)
|
|
/* void */;
|
|
if ((n = fmt - cp) != 0) {
|
|
if ((unsigned)ret + n > INT_MAX) {
|
|
ret = EOF;
|
|
goto error;
|
|
}
|
|
PRINT(cp, n);
|
|
ret += n;
|
|
}
|
|
if (ch == '\0')
|
|
goto done;
|
|
fmt++; /* skip over '%' */
|
|
|
|
flags = 0;
|
|
dprec = 0;
|
|
width = 0;
|
|
prec = -1;
|
|
sign = '\0';
|
|
ox[1] = '\0';
|
|
|
|
rflag: ch = *fmt++;
|
|
reswitch: switch (ch) {
|
|
case ' ':
|
|
/*-
|
|
* ``If the space and + flags both appear, the space
|
|
* flag will be ignored.''
|
|
* -- ANSI X3J11
|
|
*/
|
|
if (!sign)
|
|
sign = ' ';
|
|
goto rflag;
|
|
case '#':
|
|
flags |= ALT;
|
|
goto rflag;
|
|
case '*':
|
|
/*-
|
|
* ``A negative field width argument is taken as a
|
|
* - flag followed by a positive field width.''
|
|
* -- ANSI X3J11
|
|
* They don't exclude field widths read from args.
|
|
*/
|
|
GETASTER (width);
|
|
if (width >= 0)
|
|
goto rflag;
|
|
width = -width;
|
|
/* FALLTHROUGH */
|
|
case '-':
|
|
flags |= LADJUST;
|
|
goto rflag;
|
|
case '+':
|
|
sign = '+';
|
|
goto rflag;
|
|
case '\'':
|
|
flags |= GROUPING;
|
|
thousands_sep = *(localeconv()->thousands_sep);
|
|
grouping = localeconv()->grouping;
|
|
goto rflag;
|
|
case '.':
|
|
if ((ch = *fmt++) == '*') {
|
|
GETASTER (prec);
|
|
goto rflag;
|
|
}
|
|
prec = 0;
|
|
while (is_digit(ch)) {
|
|
prec = 10 * prec + to_digit(ch);
|
|
ch = *fmt++;
|
|
}
|
|
goto reswitch;
|
|
case '0':
|
|
/*-
|
|
* ``Note that 0 is taken as a flag, not as the
|
|
* beginning of a field width.''
|
|
* -- ANSI X3J11
|
|
*/
|
|
flags |= ZEROPAD;
|
|
goto rflag;
|
|
case '1': case '2': case '3': case '4':
|
|
case '5': case '6': case '7': case '8': case '9':
|
|
n = 0;
|
|
do {
|
|
n = 10 * n + to_digit(ch);
|
|
ch = *fmt++;
|
|
} while (is_digit(ch));
|
|
if (ch == '$') {
|
|
nextarg = n;
|
|
if (argtable == NULL) {
|
|
argtable = statargtable;
|
|
if (__find_arguments (fmt0, orgap,
|
|
&argtable)) {
|
|
ret = EOF;
|
|
goto error;
|
|
}
|
|
}
|
|
goto rflag;
|
|
}
|
|
width = n;
|
|
goto reswitch;
|
|
#ifndef NO_FLOATING_POINT
|
|
case 'L':
|
|
flags |= LONGDBL;
|
|
goto rflag;
|
|
#endif
|
|
case 'h':
|
|
if (flags & SHORTINT) {
|
|
flags &= ~SHORTINT;
|
|
flags |= CHARINT;
|
|
} else
|
|
flags |= SHORTINT;
|
|
goto rflag;
|
|
case 'j':
|
|
flags |= INTMAXT;
|
|
goto rflag;
|
|
case 'l':
|
|
if (flags & LONGINT) {
|
|
flags &= ~LONGINT;
|
|
flags |= LLONGINT;
|
|
} else
|
|
flags |= LONGINT;
|
|
goto rflag;
|
|
case 'q':
|
|
flags |= LLONGINT; /* not necessarily */
|
|
goto rflag;
|
|
case 't':
|
|
flags |= PTRDIFFT;
|
|
goto rflag;
|
|
case 'z':
|
|
flags |= SIZET;
|
|
goto rflag;
|
|
case 'C':
|
|
flags |= LONGINT;
|
|
/*FALLTHROUGH*/
|
|
case 'c':
|
|
if (flags & LONGINT) {
|
|
static const mbstate_t initial;
|
|
mbstate_t mbs;
|
|
size_t mbseqlen;
|
|
|
|
mbs = initial;
|
|
mbseqlen = wcrtomb(cp = buf,
|
|
(wchar_t)GETARG(wint_t), &mbs);
|
|
if (mbseqlen == (size_t)-1) {
|
|
fp->_flags |= __SERR;
|
|
goto error;
|
|
}
|
|
size = (int)mbseqlen;
|
|
} else {
|
|
*(cp = buf) = GETARG(int);
|
|
size = 1;
|
|
}
|
|
sign = '\0';
|
|
break;
|
|
case 'D':
|
|
flags |= LONGINT;
|
|
/*FALLTHROUGH*/
|
|
case 'd':
|
|
case 'i':
|
|
if (flags & INTMAX_SIZE) {
|
|
ujval = SJARG();
|
|
if ((intmax_t)ujval < 0) {
|
|
ujval = -ujval;
|
|
sign = '-';
|
|
}
|
|
} else {
|
|
ulval = SARG();
|
|
if ((long)ulval < 0) {
|
|
ulval = -ulval;
|
|
sign = '-';
|
|
}
|
|
}
|
|
base = 10;
|
|
goto number;
|
|
#ifndef NO_FLOATING_POINT
|
|
case 'a':
|
|
case 'A':
|
|
if (ch == 'a') {
|
|
ox[1] = 'x';
|
|
xdigs = xdigs_lower;
|
|
expchar = 'p';
|
|
} else {
|
|
ox[1] = 'X';
|
|
xdigs = xdigs_upper;
|
|
expchar = 'P';
|
|
}
|
|
if (prec >= 0)
|
|
prec++;
|
|
if (dtoaresult != NULL)
|
|
freedtoa(dtoaresult);
|
|
if (flags & LONGDBL) {
|
|
fparg.ldbl = GETARG(long double);
|
|
dtoaresult = cp =
|
|
__hldtoa(fparg.ldbl, xdigs, prec,
|
|
&expt, &signflag, &dtoaend);
|
|
} else {
|
|
fparg.dbl = GETARG(double);
|
|
dtoaresult = cp =
|
|
__hdtoa(fparg.dbl, xdigs, prec,
|
|
&expt, &signflag, &dtoaend);
|
|
}
|
|
if (prec < 0)
|
|
prec = dtoaend - cp;
|
|
if (expt == INT_MAX)
|
|
ox[1] = '\0';
|
|
goto fp_common;
|
|
case 'e':
|
|
case 'E':
|
|
expchar = ch;
|
|
if (prec < 0) /* account for digit before decpt */
|
|
prec = DEFPREC + 1;
|
|
else
|
|
prec++;
|
|
goto fp_begin;
|
|
case 'f':
|
|
case 'F':
|
|
expchar = '\0';
|
|
goto fp_begin;
|
|
case 'g':
|
|
case 'G':
|
|
expchar = ch - ('g' - 'e');
|
|
if (prec == 0)
|
|
prec = 1;
|
|
fp_begin:
|
|
if (prec < 0)
|
|
prec = DEFPREC;
|
|
if (dtoaresult != NULL)
|
|
freedtoa(dtoaresult);
|
|
if (flags & LONGDBL) {
|
|
fparg.ldbl = GETARG(long double);
|
|
dtoaresult = cp =
|
|
__ldtoa(&fparg.ldbl, expchar ? 2 : 3, prec,
|
|
&expt, &signflag, &dtoaend);
|
|
} else {
|
|
fparg.dbl = GETARG(double);
|
|
dtoaresult = cp =
|
|
dtoa(fparg.dbl, expchar ? 2 : 3, prec,
|
|
&expt, &signflag, &dtoaend);
|
|
if (expt == 9999)
|
|
expt = INT_MAX;
|
|
}
|
|
fp_common:
|
|
if (signflag)
|
|
sign = '-';
|
|
if (expt == INT_MAX) { /* inf or nan */
|
|
if (*cp == 'N') {
|
|
cp = (ch >= 'a') ? "nan" : "NAN";
|
|
sign = '\0';
|
|
} else
|
|
cp = (ch >= 'a') ? "inf" : "INF";
|
|
size = 3;
|
|
flags &= ~ZEROPAD;
|
|
break;
|
|
}
|
|
flags |= FPT;
|
|
ndig = dtoaend - cp;
|
|
if (ch == 'g' || ch == 'G') {
|
|
if (expt > -4 && expt <= prec) {
|
|
/* Make %[gG] smell like %[fF] */
|
|
expchar = '\0';
|
|
if (flags & ALT)
|
|
prec -= expt;
|
|
else
|
|
prec = ndig - expt;
|
|
if (prec < 0)
|
|
prec = 0;
|
|
} else {
|
|
/*
|
|
* Make %[gG] smell like %[eE], but
|
|
* trim trailing zeroes if no # flag.
|
|
*/
|
|
if (!(flags & ALT))
|
|
prec = ndig;
|
|
}
|
|
}
|
|
if (expchar) {
|
|
expsize = exponent(expstr, expt - 1, expchar);
|
|
size = expsize + prec;
|
|
if (prec > 1 || flags & ALT)
|
|
++size;
|
|
} else {
|
|
/* space for digits before decimal point */
|
|
if (expt > 0)
|
|
size = expt;
|
|
else /* "0" */
|
|
size = 1;
|
|
/* space for decimal pt and following digits */
|
|
if (prec || flags & ALT)
|
|
size += prec + 1;
|
|
if (grouping && expt > 0) {
|
|
/* space for thousands' grouping */
|
|
nseps = nrepeats = 0;
|
|
lead = expt;
|
|
while (*grouping != CHAR_MAX) {
|
|
if (lead <= *grouping)
|
|
break;
|
|
lead -= *grouping;
|
|
if (*(grouping+1)) {
|
|
nseps++;
|
|
grouping++;
|
|
} else
|
|
nrepeats++;
|
|
}
|
|
size += nseps + nrepeats;
|
|
} else
|
|
lead = expt;
|
|
}
|
|
break;
|
|
#endif /* !NO_FLOATING_POINT */
|
|
case 'n':
|
|
/*
|
|
* Assignment-like behavior is specified if the
|
|
* value overflows or is otherwise unrepresentable.
|
|
* C99 says to use `signed char' for %hhn conversions.
|
|
*/
|
|
if (flags & LLONGINT)
|
|
*GETARG(long long *) = ret;
|
|
else if (flags & SIZET)
|
|
*GETARG(ssize_t *) = (ssize_t)ret;
|
|
else if (flags & PTRDIFFT)
|
|
*GETARG(ptrdiff_t *) = ret;
|
|
else if (flags & INTMAXT)
|
|
*GETARG(intmax_t *) = ret;
|
|
else if (flags & LONGINT)
|
|
*GETARG(long *) = ret;
|
|
else if (flags & SHORTINT)
|
|
*GETARG(short *) = ret;
|
|
else if (flags & CHARINT)
|
|
*GETARG(signed char *) = ret;
|
|
else
|
|
*GETARG(int *) = ret;
|
|
continue; /* no output */
|
|
case 'O':
|
|
flags |= LONGINT;
|
|
/*FALLTHROUGH*/
|
|
case 'o':
|
|
if (flags & INTMAX_SIZE)
|
|
ujval = UJARG();
|
|
else
|
|
ulval = UARG();
|
|
base = 8;
|
|
goto nosign;
|
|
case 'p':
|
|
/*-
|
|
* ``The argument shall be a pointer to void. The
|
|
* value of the pointer is converted to a sequence
|
|
* of printable characters, in an implementation-
|
|
* defined manner.''
|
|
* -- ANSI X3J11
|
|
*/
|
|
ujval = (uintmax_t)(uintptr_t)GETARG(void *);
|
|
base = 16;
|
|
xdigs = xdigs_lower;
|
|
flags = flags | INTMAXT;
|
|
ox[1] = 'x';
|
|
goto nosign;
|
|
case 'S':
|
|
flags |= LONGINT;
|
|
/*FALLTHROUGH*/
|
|
case 's':
|
|
if (flags & LONGINT) {
|
|
wchar_t *wcp;
|
|
|
|
if (convbuf != NULL)
|
|
free(convbuf);
|
|
if ((wcp = GETARG(wchar_t *)) == NULL)
|
|
cp = "(null)";
|
|
else {
|
|
convbuf = __wcsconv(wcp, prec);
|
|
if (convbuf == NULL) {
|
|
fp->_flags |= __SERR;
|
|
goto error;
|
|
}
|
|
cp = convbuf;
|
|
}
|
|
} else if ((cp = GETARG(char *)) == NULL)
|
|
cp = "(null)";
|
|
if (prec >= 0) {
|
|
/*
|
|
* can't use strlen; can only look for the
|
|
* NUL in the first `prec' characters, and
|
|
* strlen() will go further.
|
|
*/
|
|
char *p = memchr(cp, 0, (size_t)prec);
|
|
|
|
if (p != NULL) {
|
|
size = p - cp;
|
|
if (size > prec)
|
|
size = prec;
|
|
} else
|
|
size = prec;
|
|
} else
|
|
size = strlen(cp);
|
|
sign = '\0';
|
|
break;
|
|
case 'U':
|
|
flags |= LONGINT;
|
|
/*FALLTHROUGH*/
|
|
case 'u':
|
|
if (flags & INTMAX_SIZE)
|
|
ujval = UJARG();
|
|
else
|
|
ulval = UARG();
|
|
base = 10;
|
|
goto nosign;
|
|
case 'X':
|
|
xdigs = xdigs_upper;
|
|
goto hex;
|
|
case 'x':
|
|
xdigs = xdigs_lower;
|
|
hex:
|
|
if (flags & INTMAX_SIZE)
|
|
ujval = UJARG();
|
|
else
|
|
ulval = UARG();
|
|
base = 16;
|
|
/* leading 0x/X only if non-zero */
|
|
if (flags & ALT &&
|
|
(flags & INTMAX_SIZE ? ujval != 0 : ulval != 0))
|
|
ox[1] = ch;
|
|
|
|
flags &= ~GROUPING;
|
|
/* unsigned conversions */
|
|
nosign: sign = '\0';
|
|
/*-
|
|
* ``... diouXx conversions ... if a precision is
|
|
* specified, the 0 flag will be ignored.''
|
|
* -- ANSI X3J11
|
|
*/
|
|
number: if ((dprec = prec) >= 0)
|
|
flags &= ~ZEROPAD;
|
|
|
|
/*-
|
|
* ``The result of converting a zero value with an
|
|
* explicit precision of zero is no characters.''
|
|
* -- ANSI X3J11
|
|
*
|
|
* ``The C Standard is clear enough as is. The call
|
|
* printf("%#.0o", 0) should print 0.''
|
|
* -- Defect Report #151
|
|
*/
|
|
cp = buf + BUF;
|
|
if (flags & INTMAX_SIZE) {
|
|
if (ujval != 0 || prec != 0 ||
|
|
(flags & ALT && base == 8))
|
|
cp = __ujtoa(ujval, cp, base,
|
|
flags & ALT, xdigs,
|
|
flags & GROUPING, thousands_sep,
|
|
grouping);
|
|
} else {
|
|
if (ulval != 0 || prec != 0 ||
|
|
(flags & ALT && base == 8))
|
|
cp = __ultoa(ulval, cp, base,
|
|
flags & ALT, xdigs,
|
|
flags & GROUPING, thousands_sep,
|
|
grouping);
|
|
}
|
|
size = buf + BUF - cp;
|
|
if (size > BUF) /* should never happen */
|
|
abort();
|
|
break;
|
|
default: /* "%?" prints ?, unless ? is NUL */
|
|
if (ch == '\0')
|
|
goto done;
|
|
/* pretend it was %c with argument ch */
|
|
cp = buf;
|
|
*cp = ch;
|
|
size = 1;
|
|
sign = '\0';
|
|
break;
|
|
}
|
|
|
|
/*
|
|
* All reasonable formats wind up here. At this point, `cp'
|
|
* points to a string which (if not flags&LADJUST) should be
|
|
* padded out to `width' places. If flags&ZEROPAD, it should
|
|
* first be prefixed by any sign or other prefix; otherwise,
|
|
* it should be blank padded before the prefix is emitted.
|
|
* After any left-hand padding and prefixing, emit zeroes
|
|
* required by a decimal [diouxX] precision, then print the
|
|
* string proper, then emit zeroes required by any leftover
|
|
* floating precision; finally, if LADJUST, pad with blanks.
|
|
*
|
|
* Compute actual size, so we know how much to pad.
|
|
* size excludes decimal prec; realsz includes it.
|
|
*/
|
|
realsz = dprec > size ? dprec : size;
|
|
if (sign)
|
|
realsz++;
|
|
if (ox[1])
|
|
realsz += 2;
|
|
|
|
prsize = width > realsz ? width : realsz;
|
|
if ((unsigned)ret + prsize > INT_MAX) {
|
|
ret = EOF;
|
|
goto error;
|
|
}
|
|
|
|
/* right-adjusting blank padding */
|
|
if ((flags & (LADJUST|ZEROPAD)) == 0)
|
|
PAD(width - realsz, blanks);
|
|
|
|
/* prefix */
|
|
if (sign)
|
|
PRINT(&sign, 1);
|
|
|
|
if (ox[1]) { /* ox[1] is either x, X, or \0 */
|
|
ox[0] = '0';
|
|
PRINT(ox, 2);
|
|
}
|
|
|
|
/* right-adjusting zero padding */
|
|
if ((flags & (LADJUST|ZEROPAD)) == ZEROPAD)
|
|
PAD(width - realsz, zeroes);
|
|
|
|
/* leading zeroes from decimal precision */
|
|
PAD(dprec - size, zeroes);
|
|
|
|
/* the string or number proper */
|
|
#ifndef NO_FLOATING_POINT
|
|
if ((flags & FPT) == 0) {
|
|
PRINT(cp, size);
|
|
} else { /* glue together f_p fragments */
|
|
if (!expchar) { /* %[fF] or sufficiently short %[gG] */
|
|
if (expt <= 0) {
|
|
PRINT(zeroes, 1);
|
|
if (prec || flags & ALT)
|
|
PRINT(decimal_point, 1);
|
|
PAD(-expt, zeroes);
|
|
/* already handled initial 0's */
|
|
prec += expt;
|
|
} else {
|
|
PRINTANDPAD(cp, dtoaend, lead, zeroes);
|
|
cp += lead;
|
|
if (grouping) {
|
|
while (nseps>0 || nrepeats>0) {
|
|
if (nrepeats > 0)
|
|
nrepeats--;
|
|
else {
|
|
grouping--;
|
|
nseps--;
|
|
}
|
|
PRINT(&thousands_sep,
|
|
1);
|
|
PRINTANDPAD(cp,dtoaend,
|
|
*grouping, zeroes);
|
|
cp += *grouping;
|
|
}
|
|
if (cp > dtoaend)
|
|
cp = dtoaend;
|
|
}
|
|
if (prec || flags & ALT)
|
|
PRINT(decimal_point,1);
|
|
}
|
|
PRINTANDPAD(cp, dtoaend, prec, zeroes);
|
|
} else { /* %[eE] or sufficiently long %[gG] */
|
|
if (prec > 1 || flags & ALT) {
|
|
buf[0] = *cp++;
|
|
buf[1] = *decimal_point;
|
|
PRINT(buf, 2);
|
|
PRINT(cp, ndig-1);
|
|
PAD(prec - ndig, zeroes);
|
|
} else /* XeYYY */
|
|
PRINT(cp, 1);
|
|
PRINT(expstr, expsize);
|
|
}
|
|
}
|
|
#else
|
|
PRINT(cp, size);
|
|
#endif
|
|
/* left-adjusting padding (always blank) */
|
|
if (flags & LADJUST)
|
|
PAD(width - realsz, blanks);
|
|
|
|
/* finally, adjust ret */
|
|
ret += prsize;
|
|
|
|
FLUSH(); /* copy out the I/O vectors */
|
|
}
|
|
done:
|
|
FLUSH();
|
|
error:
|
|
va_end(orgap);
|
|
#ifndef NO_FLOATING_POINT
|
|
if (dtoaresult != NULL)
|
|
freedtoa(dtoaresult);
|
|
#endif
|
|
if (convbuf != NULL)
|
|
free(convbuf);
|
|
if (__sferror(fp))
|
|
ret = EOF;
|
|
if ((argtable != NULL) && (argtable != statargtable))
|
|
free (argtable);
|
|
return (ret);
|
|
/* NOTREACHED */
|
|
}
|
|
|
|
|
|
#ifndef NO_FLOATING_POINT
|
|
|
|
static int
|
|
exponent(char *p0, int exp, int fmtch)
|
|
{
|
|
char *p, *t;
|
|
char expbuf[MAXEXPDIG];
|
|
|
|
p = p0;
|
|
*p++ = fmtch;
|
|
if (exp < 0) {
|
|
exp = -exp;
|
|
*p++ = '-';
|
|
}
|
|
else
|
|
*p++ = '+';
|
|
t = expbuf + MAXEXPDIG;
|
|
if (exp > 9) {
|
|
do {
|
|
*--t = to_char(exp % 10);
|
|
} while ((exp /= 10) > 9);
|
|
*--t = to_char(exp);
|
|
for (; t < expbuf + MAXEXPDIG; *p++ = *t++);
|
|
}
|
|
else {
|
|
/*
|
|
* Exponents for decimal floating point conversions
|
|
* (%[eEgG]) must be at least two characters long,
|
|
* whereas exponents for hexadecimal conversions can
|
|
* be only one character long.
|
|
*/
|
|
if (fmtch == 'e' || fmtch == 'E')
|
|
*p++ = '0';
|
|
*p++ = to_char(exp);
|
|
}
|
|
return (p - p0);
|
|
}
|
|
#endif /* !NO_FLOATING_POINT */
|