/*-
Copyright (c) 2010 - 2011, Intel Corporation. All rights reserved.<BR>
This program and the accompanying materials are licensed and made available under
the terms and conditions of the BSD License that accompanies this distribution.
The full text of the license may be found at
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
* 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
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 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.
FreeBSD: src/lib/libc/stdio/vfwscanf.c,v 1.12 2004/05/02 20:13:29 obrien Exp
NetBSD: vfwscanf.c,v 1.2 2005/06/12 05:48:41 lukem Exp
*/
#include <LibConfig.h>
#include <sys/EfiCdefs.h>
#include "namespace.h"
#include <ctype.h>
#include <inttypes.h>
#include <stdio.h>
#include <stdlib.h>
#include <stddef.h>
#include <stdarg.h>
#include <string.h>
#include <limits.h>
#include <wchar.h>
#include <wctype.h>
#include "reentrant.h"
#include "local.h"
#ifndef NO_FLOATING_POINT
#include <locale.h>
#endif
#if defined(_MSC_VER) /* Handle Microsoft VC++ compiler specifics. */
#endif
/*
* Flags used during conversion.
*/
/*
* The following are used in integral conversions only:
* SIGNOK, NDIGITS, PFXOK, and NZDIGITS
*/
/*
* Conversion types.
*/
/*
* MT-safe version.
*/
int
{
int ret;
return (ret);
}
/*
* Non-MT-safe version.
*/
int
{
wint_t c; /* character from format, or conversion */
wchar_t *p; /* points into all kinds of strings */
int n; /* handy integer */
/* `basefix' is used to avoid `if' tests in the integer scanner */
{ 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
nassigned = 0;
nconversions = 0;
nread = 0;
base = 0;
cclcompl = 0;
for (;;) {
c = *fmt++;
if (c == 0)
return (nassigned);
if (iswspace(c)) {
iswspace(c))
;
if (c != WEOF)
continue;
}
if (c != '%')
goto literal;
width = 0;
flags = 0;
/*
* switch on the format. continue if done;
* break once format type is derived.
*/
switch (c) {
case '%':
goto input_failure;
if (wi != c) {
goto match_failure;
}
nread++;
continue;
case '*':
goto again;
case 'j':
goto again;
case 'l':
} else
goto again;
case 'q':
goto again;
case 't':
goto again;
case 'z':
goto again;
case 'L':
goto again;
case 'h':
flags |= SHORTSHORT;
} else
goto again;
case '0': case '1': case '2': case '3': case '4':
case '5': case '6': case '7': case '8': case '9':
goto again;
/*
* Conversions.
*/
case 'd':
c = CT_INT;
base = 10;
break;
case 'i':
c = CT_INT;
base = 0;
break;
case 'o':
c = CT_INT;
base = 8;
break;
case 'u':
c = CT_INT;
base = 10;
break;
case 'X':
case 'x':
c = CT_INT;
base = 16;
break;
#ifndef NO_FLOATING_POINT
//case 'A':
case 'E': case 'F': case 'G':
//case 'a':
case 'e': case 'f': case 'g':
c = CT_FLOAT;
break;
#endif
case 'S':
/* FALLTHROUGH */
case 's':
c = CT_STRING;
break;
case '[':
if (*fmt == '^') {
cclcompl = 1;
fmt++;
} else
cclcompl = 0;
if (*fmt == ']')
fmt++;
fmt++;
fmt++;
c = CT_CCL;
break;
case 'C':
/* FALLTHROUGH */
case 'c':
c = CT_CHAR;
break;
case 'p': /* pointer format is like hex */
c = CT_INT; /* assumes sizeof(uintmax_t) */
base = 16;
break;
case 'n':
nconversions++;
continue;
if (flags & SHORTSHORT)
else
continue;
default:
goto match_failure;
/*
* Disgusting backwards compatibility hack. XXX
*/
case '\0': /* compat */
return (EOF);
}
/*
* Consume leading white space, except for formats
* that suppress this.
*/
nread++;
goto input_failure;
}
/*
* Do the conversion.
*/
switch (c) {
case CT_CHAR:
/* scan arbitrary characters (sets NOSKIP) */
if (width == 0)
width = 1;
n = 0;
while (width-- != 0 &&
n++;
}
if (n == 0)
goto input_failure;
nread += n;
nassigned++;
} else {
n = 0;
while (width != 0 &&
if (width >= MB_CUR_MAX &&
goto input_failure;
} else {
&mbs);
goto input_failure;
break;
}
nconv);
}
n++;
}
if (n == 0)
goto input_failure;
nread += n;
nassigned++;
}
nconversions++;
break;
case CT_CCL:
/* scan a (nonempty) character class (sets NOSKIP) */
if (width == 0)
/* take only those things in the class */
n = 0;
n++;
if (n == 0)
goto match_failure;
n = p - p0;
if (n == 0)
goto match_failure;
*p = 0;
nassigned++;
} else {
n = 0;
if (width >= MB_CUR_MAX &&
goto input_failure;
} else {
&mbs);
goto input_failure;
break;
nconv);
}
n++;
}
*mbp = 0;
nassigned++;
}
}
nread += n;
nconversions++;
break;
case CT_STRING:
/* like CCL, but zero-length string OK, & no NOSKIP */
if (width == 0)
width-- != 0 &&
nread++;
width-- != 0 &&
nread++;
}
*p = '\0';
nassigned++;
} else {
width != 0 &&
if (width >= MB_CUR_MAX &&
goto input_failure;
} else {
&mbs);
goto input_failure;
break;
nconv);
}
nread++;
}
*mbp = 0;
nassigned++;
}
}
nconversions++;
continue;
case CT_INT:
/* scan an integer as if by the conversion function */
sizeof(*buf) - 1)
c = __fgetwc_unlock(fp);
/*
* Switch on the character; `goto ok'
* if we accept it as a part of number.
*/
switch (c) {
/*
* The digit 0 is always legal, but is
* special. For %i conversions, if no
* digits (zero or nonzero) have been
* scanned (only signs), we will have
* base==0. In that case, we should set
* it to 8 and enable 0x prefixing.
* Also, if we have not scanned zero digits
* before this, do not turn off prefixing
* (someone else will turn it off if we
* have scanned any nonzero digits).
*/
case '0':
if (base == 0) {
base = 8;
}
else
goto ok;
/* 1 through 7 always legal */
case '1': case '2': case '3':
case '4': case '5': case '6': case '7':
goto ok;
/* digits 8 and 9 ok iff decimal or hex */
case '8': case '9':
if (base <= 8)
break; /* not legal here */
goto ok;
/* letters ok iff hex */
case 'A': case 'B': case 'C':
case 'D': case 'E': case 'F':
case 'a': case 'b': case 'c':
case 'd': case 'e': case 'f':
/* no need to fix base here */
if (base <= 10)
break; /* not legal here */
goto ok;
/* sign ok only as first character */
case '+': case '-':
goto ok;
}
break;
/*
* x ok iff flag still set & 2nd char (or
* 3rd char if we have a sign).
*/
case 'x': case 'X':
goto ok;
}
break;
}
/*
* If we got here, c is not a legal character
* for a number. Stop accumulating digits.
*/
if (c != WEOF)
break;
ok:
/*
* c is legal: store it and look at the next.
*/
*p++ = (wchar_t)c;
}
/*
* If we had only a sign, it is no good; push
* back the sign. If the number ends in `x',
* it was [sign] '0' 'x', so push back the x
* and treat it as [sign] '0'.
*/
if (p > buf)
goto match_failure;
}
c = p[-1];
if (c == 'x' || c == 'X') {
--p;
}
*p = 0;
else
}
else if (flags & SHORTSHORT) {
}
}
}
}
}
}
}
else {
}
nassigned++;
}
nconversions++;
break;
#ifndef NO_FLOATING_POINT
case CT_FLOAT:
/* scan a floating point number as if by strtod */
sizeof(*buf) - 1)
goto match_failure;
#ifdef REAL_LONG_DOUBLE_SUPPORT
} else
#endif
}
else {
}
#ifdef DEBUG
abort();
#endif
nassigned++;
}
nconversions++;
break;
#endif /* !NO_FLOATING_POINT */
}
}
return (nassigned);
}
#ifndef NO_FLOATING_POINT
static int
{
int infnanpos = 0;
enum {
wchar_t c;
/*
* We set commit = p whenever the string we have read so far
* constitutes a valid representation of a floating point
* number by itself. At some point, the parse will complete
* or fail, and we will ungetc() back to the last commit point.
* To ensure that the file offset gets updated properly, it is
* always necessary to read at least one character that doesn't
* match; thus, we can't short-circuit "infinity" or "nan(...)".
*/
break;
switch (state) {
case S_START:
if (c == '-' || c == '+')
break;
else
goto reswitch;
case S_GOTSIGN:
switch (c) {
case '0':
state = S_MAYBEHEX;
commit = p;
break;
case 'I':
case 'i':
break;
case 'N':
case 'n':
break;
default:
goto reswitch;
}
break;
case S_INF:
if (infnanpos > 6 ||
(c != "nfinity"[infnanpos] &&
c != "NFINITY"[infnanpos]))
goto parsedone;
commit = p; /* inf or infinity */
infnanpos++;
break;
case S_NAN:
switch (infnanpos) {
case -1: /* XXX kludge to deal with nan(...) */
goto parsedone;
case 0:
if (c != 'A' && c != 'a')
goto parsedone;
break;
case 1:
if (c != 'N' && c != 'n')
goto parsedone;
else
commit = p;
break;
case 2:
if (c != '(')
goto parsedone;
break;
default:
if (c == ')') {
commit = p;
infnanpos = -2;
} else if (!iswalnum(c) && c != '_')
goto parsedone;
break;
}
infnanpos++;
break;
case S_MAYBEHEX:
if (c == 'X' || c == 'x') {
ishex = 1;
break;
} else { /* we saw a '0', but no 'x' */
gotmantdig = 1;
goto reswitch;
}
case S_DIGITS:
gotmantdig = 1;
else {
if (c != decpt)
goto reswitch;
}
if (gotmantdig)
commit = p;
break;
case S_FRAC:
if (!gotmantdig)
goto parsedone;
else
commit = p;
gotmantdig = 1;
} else
goto parsedone;
break;
case S_EXP:
state = S_EXPDIGITS;
if (c == '-' || c == '+')
break;
else
goto reswitch;
case S_EXPDIGITS:
if (iswdigit(c))
commit = p;
else
goto parsedone;
break;
default:
abort();
}
*p++ = c;
}
while (commit < --p)
*++commit = '\0';
}
#endif