1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438
|
/*-
* Copyright (c) 1990 The Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms are permitted
* provided that the above copyright notice and this paragraph are
* duplicated in all such forms and that any documentation,
* and/or other materials related to such
* distribution and use acknowledge that the software was developed
* by the University of California, Berkeley. The name of the
* University may not be used to endorse or promote products derived
* from this software without specific prior written permission.
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*/
/*
* Copyright (c) 2012-2014 ARM Ltd
* All rights reserved.
*
* 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.
* 3. The name of the company may not be used to endorse or promote
* products derived from this software without specific prior written
* permission.
*
* THIS SOFTWARE IS PROVIDED BY ARM LTD ``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 ARM LTD 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.
*/
/*
FUNCTION
<<vfscanf>>, <<vscanf>>, <<vsscanf>>---format argument list
INDEX
vfscanf
INDEX
_vfscanf_r
INDEX
vscanf
INDEX
_vscanf_r
INDEX
vsscanf
INDEX
_vsscanf_r
SYNOPSIS
#include <stdio.h>
#include <stdarg.h>
int vscanf(const char *<[fmt]>, va_list <[list]>);
int vfscanf(FILE *<[fp]>, const char *<[fmt]>, va_list <[list]>);
int vsscanf(const char *<[str]>, const char *<[fmt]>, va_list <[list]>);
int vscanf( const char *<[fmt]>,
va_list <[list]>);
int vfscanf( FILE *<[fp]>, const char *<[fmt]>,
va_list <[list]>);
int vsscanf( const char *<[str]>,
const char *<[fmt]>, va_list <[list]>);
DESCRIPTION
<<vscanf>>, <<vfscanf>>, and <<vsscanf>> are (respectively) variants
of <<scanf>>, <<fscanf>>, and <<sscanf>>. They differ only in
allowing their caller to pass the variable argument list as a
<<va_list>> object (initialized by <<va_start>>) rather than
directly accepting a variable number of arguments.
RETURNS
The return values are consistent with the corresponding functions:
<<vscanf>> returns the number of input fields successfully scanned,
converted, and stored; the return value does not include scanned
fields which were not stored.
If <<vscanf>> attempts to read at end-of-file, the return value
is <<EOF>>.
If no fields were stored, the return value is <<0>>.
The routines <<_vscanf_r>>, <<_vfscanf_f>>, and <<_vsscanf_r>> are
reentrant versions which take an additional first parameter which points to the
reentrancy structure.
PORTABILITY
These are GNU extensions.
Supporting OS subroutines required:
*/
#define _DEFAULT_SOURCE
#include <_ansi.h>
#include <newlib.h>
#include <ctype.h>
#include <wctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <limits.h>
#include <wchar.h>
#include <string.h>
#include <stdarg.h>
#include <errno.h>
#include "local.h"
#include "../stdlib/local.h"
#include "nano-vfscanf_local.h"
#define VFSCANF vfscanf
#ifdef STRING_ONLY
# define _SVFSCANF _ssvfscanf
#else
# define _SVFSCANF _svfscanf
#endif
/* vfscanf. */
#ifndef STRING_ONLY
int
VFSCANF (
register FILE *fp,
const char *fmt,
va_list ap)
{
CHECK_INIT(data, fp);
return _SVFSCANF (fp, fmt, ap);
}
int __nonnull((2))
vfiscanf ( FILE *, const char *, __VALIST)
_ATTRIBUTE ((__alias__("vfscanf")));
#endif /* !STRING_ONLY. */
#if defined (STRING_ONLY)
/* When dealing with the sscanf family, we don't want to use the
regular ungetc which will drag in file I/O items we don't need.
So, we create our own trimmed-down version. */
int
sungetc (
int c,
register FILE *fp)
{
if (c == EOF)
return (EOF);
/* After ungetc, we won't be at eof anymore. */
fp->_flags &= ~__SEOF;
c = (unsigned char) c;
/* If we are in the middle of ungetc'ing, just continue.
This may require expanding the current ungetc buffer. */
if (HASUB (fp))
{
if (fp->_r >= fp->_ub._size && __submore (fp))
return EOF;
*--fp->_p = c;
fp->_r++;
return c;
}
/* If we can handle this by simply backing up, do so,
but never replace the original character.
(This makes sscanf() work when scanning `const' data). */
if (fp->_bf._base != NULL && fp->_p > fp->_bf._base && fp->_p[-1] == c)
{
fp->_p--;
fp->_r++;
return c;
}
/* Create an ungetc buffer.
Initially, we will use the `reserve' buffer. */
fp->_ur = fp->_r;
fp->_up = fp->_p;
fp->_ub._base = fp->_ubuf;
fp->_ub._size = sizeof (fp->_ubuf);
fp->_ubuf[sizeof (fp->_ubuf) - 1] = c;
fp->_p = &fp->_ubuf[sizeof (fp->_ubuf) - 1];
fp->_r = 1;
return c;
}
/* String only version of __srefill_r for sscanf family. */
int
_ssrefill (
register FILE * fp)
{
/* Our only hope of further input is the ungetc buffer.
If there is anything in that buffer to read, return. */
if (HASUB (fp))
{
FREEUB (ptr, fp);
if ((fp->_r = fp->_ur) != 0)
{
fp->_p = fp->_up;
return 0;
}
}
/* Otherwise we are out of character input. */
fp->_p = fp->_bf._base;
fp->_r = 0;
fp->_flags |= __SEOF;
return EOF;
}
#else
int sungetc ( int, register FILE *);
int _ssrefill ( register FILE *);
size_t sfread ( void *buf, size_t, size_t, FILE *);
#endif /* !STRING_ONLY. */
int
_SVFSCANF (
register FILE *fp,
char const *fmt0,
va_list ap)
{
register u_char *fmt = (u_char *) fmt0;
register int c; /* Character from format, or conversion. */
register char *p; /* Points into all kinds of strings. */
char ccltab[256]; /* Character class table for %[...]. */
va_list ap_copy;
int ret;
char *cp;
struct _scan_data_t scan_data;
_newlib_flockfile_start (fp);
scan_data.nassigned = 0;
scan_data.nread = 0;
scan_data.ccltab = ccltab;
scan_data.pfn_ungetc = ungetc;
scan_data.pfn_refill = _srefill;
/* GCC PR 14577 at https://gcc.gnu.org/bugzilla/show_bug.cgi?id=14557 */
va_copy (ap_copy, ap);
for (;;)
{
if (*fmt == 0)
goto all_done;
if (isspace (*fmt))
{
while ((fp->_r > 0 || !scan_data.pfn_refill(fp))
&& isspace (*fp->_p))
{
scan_data.nread++;
fp->_r--;
fp->_p++;
}
fmt++;
continue;
}
if ((c = *fmt++) != '%')
goto literal;
scan_data.width = 0;
scan_data.flags = 0;
if (*fmt == '*')
{
scan_data.flags |= SUPPRESS;
fmt++;
}
for (; is_digit (*fmt); fmt++)
scan_data.width = 10 * scan_data.width + to_digit (*fmt);
/* The length modifiers. */
p = "hlL";
if ((cp = memchr (p, *fmt, 3)) != NULL) {
scan_data.flags |= (SHORT << (cp - p));
fmt++;
}
/* Switch on the format. continue if done; break once format
type is derived. */
c = *fmt++;
switch (c)
{
case '%':
literal:
if ((fp->_r <= 0 && scan_data.pfn_refill(fp)))
goto input_failure;
if (*fp->_p != c)
goto match_failure;
fp->_r--, fp->_p++;
scan_data.nread++;
continue;
case 'p':
scan_data.flags |= POINTER;
FALLTHROUGH;
case 'x':
case 'X':
scan_data.flags |= PFXOK;
scan_data.base = 16;
goto number;
case 'd':
case 'u':
scan_data.base = 10;
goto number;
case 'i':
scan_data.base = 0;
goto number;
case 'o':
scan_data.base = 8;
number:
scan_data.code = (c < 'o') ? CT_INT : CT_UINT;
break;
case '[':
fmt = (u_char *) __sccl (ccltab, (unsigned char *) fmt);
scan_data.flags |= NOSKIP;
scan_data.code = CT_CCL;
break;
case 'c':
scan_data.flags |= NOSKIP;
scan_data.code = CT_CHAR;
break;
case 's':
scan_data.code = CT_STRING;
break;
case 'n':
if (scan_data.flags & SUPPRESS) /* ??? */
continue;
if (scan_data.flags & SHORT)
*GET_ARG (N, ap_copy, short *) = scan_data.nread;
else if (scan_data.flags & LONG)
*GET_ARG (N, ap_copy, long *) = scan_data.nread;
else
*GET_ARG (N, ap_copy, int *) = scan_data.nread;
continue;
/* Disgusting backwards compatibility hacks. XXX. */
case '\0': /* compat. */
_newlib_flockfile_exit (fp);
va_end (ap_copy);
return EOF;
#ifdef FLOATING_POINT
case 'e': case 'E':
case 'f': case 'F':
case 'g': case 'G':
scan_data.code = CT_FLOAT;
break;
#endif
default: /* compat. */
scan_data.code = CT_INT;
scan_data.base = 10;
break;
}
/* We have a conversion that requires input. */
if ((fp->_r <= 0 && scan_data.pfn_refill (fp)))
goto input_failure;
/* Consume leading white space, except for formats that
suppress this. */
if ((scan_data.flags & NOSKIP) == 0)
{
while (isspace (*fp->_p))
{
scan_data.nread++;
if (--fp->_r > 0)
fp->_p++;
else if (scan_data.pfn_refill (fp))
goto input_failure;
}
/* Note that there is at least one character in the
buffer, so conversions that do not set NOSKIP ca
no longer result in an input failure. */
}
ret = 0;
if (scan_data.code < CT_INT)
ret = _scanf_chars (&scan_data, fp, &ap_copy);
else if (scan_data.code < CT_FLOAT)
ret = _scanf_i (&scan_data, fp, &ap_copy);
#ifdef FLOATING_POINT
else if (_scanf_float)
ret = _scanf_float (rptr, &scan_data, fp, &ap_copy);
#endif
if (ret == MATCH_FAILURE)
goto match_failure;
else if (ret == INPUT_FAILURE)
goto input_failure;
}
input_failure:
/* On read failure, return EOF failure regardless of matches; errno
should have been set prior to here. On EOF failure (including
invalid format string), return EOF if no matches yet, else number
of matches made prior to failure. */
_newlib_flockfile_exit (fp);
va_end (ap_copy);
return scan_data.nassigned && !(fp->_flags & __SERR) ? scan_data.nassigned
: EOF;
match_failure:
all_done:
/* Return number of matches, which can be 0 on match failure. */
_newlib_flockfile_end (fp);
va_end (ap_copy);
return scan_data.nassigned;
}
#ifdef STRING_ONLY
int
_ssvfiscanf ( FILE *, const char *, __VALIST)
_ATTRIBUTE ((__alias__("_ssvfscanf")));
#else
int
_svfiscanf ( FILE *, const char *, __VALIST)
_ATTRIBUTE ((__alias__("_svfscanf")));
#endif
|