]>
git.saurik.com Git - apple/libc.git/blob - stdio.subproj/vfscanf.c
2 * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
4 * @APPLE_LICENSE_HEADER_START@
6 * The contents of this file constitute Original Code as defined in and
7 * are subject to the Apple Public Source License Version 1.1 (the
8 * "License"). You may not use this file except in compliance with the
9 * License. Please obtain a copy of the License at
10 * http://www.apple.com/publicsource and read it before using this file.
12 * This Original Code and all software distributed under the License are
13 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17 * License for the specific language governing rights and limitations
20 * @APPLE_LICENSE_HEADER_END@
23 * Copyright (c) 1990, 1993
24 * The Regents of the University of California. All rights reserved.
26 * This code is derived from software contributed to Berkeley by
29 * Redistribution and use in source and binary forms, with or without
30 * modification, are permitted provided that the following conditions
32 * 1. Redistributions of source code must retain the above copyright
33 * notice, this list of conditions and the following disclaimer.
34 * 2. Redistributions in binary form must reproduce the above copyright
35 * notice, this list of conditions and the following disclaimer in the
36 * documentation and/or other materials provided with the distribution.
37 * 3. All advertising materials mentioning features or use of this software
38 * must display the following acknowledgement:
39 * This product includes software developed by the University of
40 * California, Berkeley and its contributors.
41 * 4. Neither the name of the University nor the names of its contributors
42 * may be used to endorse or promote products derived from this software
43 * without specific prior written permission.
45 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
46 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
47 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
48 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
49 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
50 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
51 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
52 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
53 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
54 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
69 #define FLOATING_POINT
72 #define BUF 513 /* Maximum length of numeric string. */
75 * Flags used during conversion.
77 #define LONG 0x01 /* l: long or double */
78 #define LONGDBL 0x02 /* L: long double; unimplemented */
79 #define SHORT 0x04 /* h: short */
80 #define SUPPRESS 0x08 /* suppress assignment */
81 #define POINTER 0x10 /* weird %p pointer (`fake hex') */
82 #define NOSKIP 0x20 /* do not skip blanks */
85 * The following are used in numeric conversions only:
86 * SIGNOK, NDIGITS, DPTOK, and EXPOK are for floating point;
87 * SIGNOK, NDIGITS, PFXOK, and NZDIGITS are for integral.
89 #define SIGNOK 0x40 /* +/- is (still) legal */
90 #define NDIGITS 0x80 /* no digits detected */
92 #define DPTOK 0x100 /* (float) decimal point is still legal */
93 #define EXPOK 0x200 /* (float) exponent (e+3, etc) still legal */
95 #define PFXOK 0x100 /* 0x prefix is (still) legal */
96 #define NZDIGITS 0x200 /* no zero digits detected */
101 #define CT_CHAR 0 /* %c conversion */
102 #define CT_CCL 1 /* %[...] conversion */
103 #define CT_STRING 2 /* %s conversion */
104 #define CT_INT 3 /* integer, i.e., strtol or strtoul */
105 #define CT_FLOAT 4 /* floating, i.e., strtod */
107 #define u_char unsigned char
108 #define u_long unsigned long
110 static u_char
*__sccl();
116 __svfscanf(fp
, fmt0
, ap
)
121 register u_char
*fmt
= (u_char
*)fmt0
;
122 register int c
; /* character from format, or conversion */
123 register size_t width
; /* field width, or 0 */
124 register char *p
; /* points into all kinds of strings */
125 register int n
; /* handy integer */
126 register int flags
; /* flags as defined above */
127 register char *p0
; /* saves original value of p when necessary */
128 int nassigned
; /* number of fields assigned */
129 int nread
; /* number of characters consumed from fp */
130 int base
; /* base argument to strtol/strtoul */
131 u_long (*ccfn
)(); /* conversion function (strtol/strtoul) */
132 char ccltab
[256]; /* character class table for %[...] */
133 char buf
[BUF
]; /* buffer for numeric conversions */
135 /* `basefix' is used to avoid `if' tests in the integer scanner */
136 static short basefix
[17] =
137 { 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
141 base
= 0; /* XXX just to keep gcc happy */
142 ccfn
= NULL
; /* XXX just to keep gcc happy */
149 if (fp
->_r
<= 0 && __srefill(fp
))
151 if (!isspace(*fp
->_p
))
153 nread
++, fp
->_r
--, fp
->_p
++;
162 * switch on the format. continue if done;
163 * break once format type is derived.
169 if (fp
->_r
<= 0 && __srefill(fp
))
190 case '0': case '1': case '2': case '3': case '4':
191 case '5': case '6': case '7': case '8': case '9':
192 width
= width
* 10 + c
- '0';
197 * Those marked `compat' are for 4.[123]BSD compatibility.
199 * (According to ANSI, E and X formats are supposed
200 * to the same as e and x. Sorry about that.)
202 case 'D': /* compat */
207 ccfn
= (u_long (*)())strtol
;
213 ccfn
= (u_long (*)())strtol
;
217 case 'O': /* compat */
232 case 'X': /* compat XXX */
236 flags
|= PFXOK
; /* enable 0x prefixing */
242 #ifdef FLOATING_POINT
243 case 'E': /* compat XXX */
244 case 'F': /* compat */
247 case 'e': case 'f': case 'g':
257 fmt
= __sccl(ccltab
, fmt
);
267 case 'p': /* pointer format is like hex */
268 flags
|= POINTER
| PFXOK
;
275 if (flags
& SUPPRESS
) /* ??? */
278 *va_arg(ap
, short *) = nread
;
279 else if (flags
& LONG
)
280 *va_arg(ap
, long *) = nread
;
282 *va_arg(ap
, int *) = nread
;
286 * Disgusting backwards compatibility hacks. XXX
288 case '\0': /* compat */
291 default: /* compat */
295 ccfn
= (u_long (*)())strtol
;
301 * We have a conversion that requires input.
303 if (fp
->_r
<= 0 && __srefill(fp
))
307 * Consume leading white space, except for formats
308 * that suppress this.
310 if ((flags
& NOSKIP
) == 0) {
311 while (isspace(*fp
->_p
)) {
315 else if (__srefill(fp
))
319 * Note that there is at least one character in
320 * the buffer, so conversions that do not set NOSKIP
321 * ca no longer result in an input failure.
331 /* scan arbitrary characters (sets NOSKIP) */
334 if (flags
& SUPPRESS
) {
337 if ((n
= fp
->_r
) < width
) {
355 size_t r
= fread((void *)va_arg(ap
, char *), 1,
366 /* scan a (nonempty) character class (sets NOSKIP) */
368 width
= ~0; /* `infinity' */
369 /* take only those things in the class */
370 if (flags
& SUPPRESS
) {
372 while (ccltab
[*fp
->_p
]) {
373 n
++, fp
->_r
--, fp
->_p
++;
376 if (fp
->_r
<= 0 && __srefill(fp
)) {
385 p0
= p
= va_arg(ap
, char *);
386 while (ccltab
[*fp
->_p
]) {
391 if (fp
->_r
<= 0 && __srefill(fp
)) {
407 /* like CCL, but zero-length string OK, & no NOSKIP */
410 if (flags
& SUPPRESS
) {
412 while (!isspace(*fp
->_p
)) {
413 n
++, fp
->_r
--, fp
->_p
++;
416 if (fp
->_r
<= 0 && __srefill(fp
))
421 p0
= p
= va_arg(ap
, char *);
422 while (!isspace(*fp
->_p
)) {
427 if (fp
->_r
<= 0 && __srefill(fp
))
437 /* scan an integer as if by strtol/strtoul */
439 if (width
== 0 || width
> sizeof(buf
) - 1)
440 width
= sizeof(buf
) - 1;
442 /* size_t is unsigned, hence this optimisation */
443 if (--width
> sizeof(buf
) - 2)
444 width
= sizeof(buf
) - 2;
447 flags
|= SIGNOK
| NDIGITS
| NZDIGITS
;
448 for (p
= buf
; width
; width
--) {
451 * Switch on the character; `goto ok'
452 * if we accept it as a part of number.
457 * The digit 0 is always legal, but is
458 * special. For %i conversions, if no
459 * digits (zero or nonzero) have been
460 * scanned (only signs), we will have
461 * base==0. In that case, we should set
462 * it to 8 and enable 0x prefixing.
463 * Also, if we have not scanned zero digits
464 * before this, do not turn off prefixing
465 * (someone else will turn it off if we
466 * have scanned any nonzero digits).
473 if (flags
& NZDIGITS
)
474 flags
&= ~(SIGNOK
|NZDIGITS
|NDIGITS
);
476 flags
&= ~(SIGNOK
|PFXOK
|NDIGITS
);
479 /* 1 through 7 always legal */
480 case '1': case '2': case '3':
481 case '4': case '5': case '6': case '7':
482 base
= basefix
[base
];
483 flags
&= ~(SIGNOK
| PFXOK
| NDIGITS
);
486 /* digits 8 and 9 ok iff decimal or hex */
488 base
= basefix
[base
];
490 break; /* not legal here */
491 flags
&= ~(SIGNOK
| PFXOK
| NDIGITS
);
494 /* letters ok iff hex */
495 case 'A': case 'B': case 'C':
496 case 'D': case 'E': case 'F':
497 case 'a': case 'b': case 'c':
498 case 'd': case 'e': case 'f':
499 /* no need to fix base here */
501 break; /* not legal here */
502 flags
&= ~(SIGNOK
| PFXOK
| NDIGITS
);
505 /* sign ok only as first character */
507 if (flags
& SIGNOK
) {
513 /* x ok iff flag still set & 2nd char */
515 if (flags
& PFXOK
&& p
== buf
+ 1) {
516 base
= 16; /* if %i */
524 * If we got here, c is not a legal character
525 * for a number. Stop accumulating digits.
530 * c is legal: store it and look at the next.
535 else if (__srefill(fp
))
539 * If we had only a sign, it is no good; push
540 * back the sign. If the number ends in `x',
541 * it was [sign] '0' 'x', so push back the x
542 * and treat it as [sign] '0'.
544 if (flags
& NDIGITS
) {
546 (void) ungetc(*(u_char
*)--p
, fp
);
549 c
= ((u_char
*)p
)[-1];
550 if (c
== 'x' || c
== 'X') {
552 (void) ungetc(c
, fp
);
554 if ((flags
& SUPPRESS
) == 0) {
558 res
= (*ccfn
)(buf
, (char **)NULL
, base
);
560 *va_arg(ap
, void **) = (void *)res
;
561 else if (flags
& SHORT
)
562 *va_arg(ap
, short *) = res
;
563 else if (flags
& LONG
)
564 *va_arg(ap
, long *) = res
;
566 *va_arg(ap
, int *) = res
;
572 #ifdef FLOATING_POINT
574 /* scan a floating point number as if by strtod */
576 if (width
== 0 || width
> sizeof(buf
) - 1)
577 width
= sizeof(buf
) - 1;
579 /* size_t is unsigned, hence this optimisation */
580 if (--width
> sizeof(buf
) - 2)
581 width
= sizeof(buf
) - 2;
584 flags
|= SIGNOK
| NDIGITS
| DPTOK
| EXPOK
;
585 for (p
= buf
; width
; width
--) {
588 * This code mimicks the integer conversion
589 * code, but is much simpler.
593 case '0': case '1': case '2': case '3':
594 case '4': case '5': case '6': case '7':
596 flags
&= ~(SIGNOK
| NDIGITS
);
600 if (flags
& SIGNOK
) {
607 flags
&= ~(SIGNOK
| DPTOK
);
612 /* no exponent without some digits */
613 if ((flags
&(NDIGITS
|EXPOK
)) == EXPOK
) {
615 (flags
& ~(EXPOK
|DPTOK
)) |
626 else if (__srefill(fp
))
630 * If no digits, might be missing exponent digits
631 * (just give back the exponent) or might be missing
632 * regular digits, but had sign and/or decimal point.
634 if (flags
& NDIGITS
) {
636 /* no digits at all */
638 ungetc(*(u_char
*)--p
, fp
);
641 /* just a bad exponent (e and maybe sign) */
643 if (c
!= 'e' && c
!= 'E') {
644 (void) ungetc(c
, fp
);/* sign */
647 (void) ungetc(c
, fp
);
649 if ((flags
& SUPPRESS
) == 0) {
653 res
= strtod(buf
,(char **) NULL
);
655 *va_arg(ap
, double *) = res
;
657 *va_arg(ap
, float *) = res
;
662 #endif /* FLOATING_POINT */
666 return (nassigned
? nassigned
: -1);
672 * Fill in the given table from the scanset at the given format
673 * (just after `['). Return a pointer to the character past the
674 * closing `]'. The table has a 1 wherever characters should be
675 * considered part of the scanset.
680 register u_char
*fmt
;
682 register int c
, n
, v
;
684 /* first `clear' the whole table */
685 c
= *fmt
++; /* first char hat => negated scanset */
687 v
= 1; /* default => accept */
688 c
= *fmt
++; /* get new first char */
690 v
= 0; /* default => reject */
691 /* should probably use memset here */
692 for (n
= 0; n
< 256; n
++)
695 return (fmt
- 1);/* format ended before closing ] */
698 * Now set the entries corresponding to the actual scanset
699 * to the opposite of the above.
701 * The first character may be ']' (or '-') without being special;
702 * the last character may be '-'.
706 tab
[c
] = v
; /* take character c */
708 n
= *fmt
++; /* and examine the next */
711 case 0: /* format ended too soon */
716 * A scanset of the form
718 * is defined as `the digit 0, the digit 1,
719 * the character +, the character -', but
720 * the effect of a scanset such as
722 * is implementation defined. The V7 Unix
723 * scanf treats `a-z' as `the letters a through
724 * z', but treats `a-a' as `the letter a, the
725 * character -, and the letter a'.
727 * For compatibility, the `-' is not considerd
728 * to define a range if the character following
729 * it is either a close bracket (required by ANSI)
730 * or is not numerically greater than the character
731 * we just stored in the table (c).
734 if (n
== ']' || n
< c
) {
736 break; /* resume the for(;;) */
739 do { /* fill in the range */
742 #if 1 /* XXX another disgusting compatibility hack */
744 * Alas, the V7 Unix scanf also treats formats
745 * such as [a-c-e] as `the letters a through e'.
746 * This too is permitted by the standard....
758 case ']': /* end of scanset */
761 default: /* just another character */