1 /*- 2 * Copyright (c) 1990, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Chris Torek. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. All advertising materials mentioning features or use of this software 17 * must display the following acknowledgement: 18 * This product includes software developed by the University of 19 * California, Berkeley and its contributors. 20 * 4. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 */ 36 37 #if defined(LIBC_SCCS) && !defined(lint) 38 static char sccsid[] = "@(#)vfscanf.c 8.1 (Berkeley) 6/4/93"; 39 #endif /* LIBC_SCCS and not lint */ 40 #include <sys/cdefs.h> 41 __FBSDID("$FreeBSD$"); 42 43 #include "namespace.h" 44 #include <ctype.h> 45 #include <inttypes.h> 46 #include <stdio.h> 47 #include <stdlib.h> 48 #include <stddef.h> 49 #include <stdarg.h> 50 #include <string.h> 51 #include <wchar.h> 52 #include <wctype.h> 53 #include "un-namespace.h" 54 55 #include "collate.h" 56 #include "libc_private.h" 57 #include "local.h" 58 59 #ifndef NO_FLOATING_POINT 60 #include <locale.h> 61 #endif 62 63 #define BUF 513 /* Maximum length of numeric string. */ 64 65 /* 66 * Flags used during conversion. 67 */ 68 #define LONG 0x01 /* l: long or double */ 69 #define LONGDBL 0x02 /* L: long double */ 70 #define SHORT 0x04 /* h: short */ 71 #define SUPPRESS 0x08 /* *: suppress assignment */ 72 #define POINTER 0x10 /* p: void * (as hex) */ 73 #define NOSKIP 0x20 /* [ or c: do not skip blanks */ 74 #define LONGLONG 0x400 /* ll: long long (+ deprecated q: quad) */ 75 #define INTMAXT 0x800 /* j: intmax_t */ 76 #define PTRDIFFT 0x1000 /* t: ptrdiff_t */ 77 #define SIZET 0x2000 /* z: size_t */ 78 #define SHORTSHORT 0x4000 /* hh: char */ 79 #define UNSIGNED 0x8000 /* %[oupxX] conversions */ 80 81 /* 82 * The following are used in integral conversions only: 83 * SIGNOK, NDIGITS, PFXOK, and NZDIGITS 84 */ 85 #define SIGNOK 0x40 /* +/- is (still) legal */ 86 #define NDIGITS 0x80 /* no digits detected */ 87 #define PFXOK 0x100 /* 0x prefix is (still) legal */ 88 #define NZDIGITS 0x200 /* no zero digits detected */ 89 #define HAVESIGN 0x10000 /* sign detected */ 90 91 /* 92 * Conversion types. 93 */ 94 #define CT_CHAR 0 /* %c conversion */ 95 #define CT_CCL 1 /* %[...] conversion */ 96 #define CT_STRING 2 /* %s conversion */ 97 #define CT_INT 3 /* %[dioupxX] conversion */ 98 #define CT_FLOAT 4 /* %[efgEFG] conversion */ 99 100 static const u_char *__sccl(char *, const u_char *); 101 static int parsefloat(FILE *, char *, char *); 102 103 int __scanfdebug = 0; 104 105 __weak_reference(__vfscanf, vfscanf); 106 107 /* 108 * __vfscanf - MT-safe version 109 */ 110 int 111 __vfscanf(FILE *fp, char const *fmt0, va_list ap) 112 { 113 int ret; 114 115 FLOCKFILE(fp); 116 ret = __svfscanf(fp, fmt0, ap); 117 FUNLOCKFILE(fp); 118 return (ret); 119 } 120 121 /* 122 * __svfscanf - non-MT-safe version of __vfscanf 123 */ 124 int 125 __svfscanf(FILE *fp, const char *fmt0, va_list ap) 126 { 127 const u_char *fmt = (const u_char *)fmt0; 128 int c; /* character from format, or conversion */ 129 size_t width; /* field width, or 0 */ 130 char *p; /* points into all kinds of strings */ 131 int n; /* handy integer */ 132 int flags; /* flags as defined above */ 133 char *p0; /* saves original value of p when necessary */ 134 int nassigned; /* number of fields assigned */ 135 int nconversions; /* number of conversions */ 136 int nread; /* number of characters consumed from fp */ 137 int base; /* base argument to conversion function */ 138 char ccltab[256]; /* character class table for %[...] */ 139 char buf[BUF]; /* buffer for numeric and mb conversions */ 140 wchar_t *wcp; /* handy wide character pointer */ 141 size_t nconv; /* length of multibyte sequence converted */ 142 static const mbstate_t initial; 143 mbstate_t mbs; 144 145 /* `basefix' is used to avoid `if' tests in the integer scanner */ 146 static short basefix[17] = 147 { 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 }; 148 149 ORIENT(fp, -1); 150 151 nassigned = 0; 152 nconversions = 0; 153 nread = 0; 154 for (;;) { 155 c = *fmt++; 156 if (c == 0) 157 return (nassigned); 158 if (isspace(c)) { 159 while ((fp->_r > 0 || __srefill(fp) == 0) && isspace(*fp->_p)) 160 nread++, fp->_r--, fp->_p++; 161 continue; 162 } 163 if (c != '%') 164 goto literal; 165 width = 0; 166 flags = 0; 167 /* 168 * switch on the format. continue if done; 169 * break once format type is derived. 170 */ 171 again: c = *fmt++; 172 switch (c) { 173 case '%': 174 literal: 175 if (fp->_r <= 0 && __srefill(fp)) 176 goto input_failure; 177 if (*fp->_p != c) 178 goto match_failure; 179 fp->_r--, fp->_p++; 180 nread++; 181 continue; 182 183 case '*': 184 flags |= SUPPRESS; 185 goto again; 186 case 'j': 187 flags |= INTMAXT; 188 goto again; 189 case 'l': 190 if (flags & LONG) { 191 flags &= ~LONG; 192 flags |= LONGLONG; 193 } else 194 flags |= LONG; 195 goto again; 196 case 'q': 197 flags |= LONGLONG; /* not quite */ 198 goto again; 199 case 't': 200 flags |= PTRDIFFT; 201 goto again; 202 case 'z': 203 flags |= SIZET; 204 goto again; 205 case 'L': 206 flags |= LONGDBL; 207 goto again; 208 case 'h': 209 if (flags & SHORT) { 210 flags &= ~SHORT; 211 flags |= SHORTSHORT; 212 } else 213 flags |= SHORT; 214 goto again; 215 216 case '0': case '1': case '2': case '3': case '4': 217 case '5': case '6': case '7': case '8': case '9': 218 width = width * 10 + c - '0'; 219 goto again; 220 221 /* 222 * Conversions. 223 */ 224 case 'd': 225 c = CT_INT; 226 base = 10; 227 break; 228 229 case 'i': 230 c = CT_INT; 231 base = 0; 232 break; 233 234 case 'o': 235 c = CT_INT; 236 flags |= UNSIGNED; 237 base = 8; 238 break; 239 240 case 'u': 241 c = CT_INT; 242 flags |= UNSIGNED; 243 base = 10; 244 break; 245 246 case 'X': 247 case 'x': 248 flags |= PFXOK; /* enable 0x prefixing */ 249 c = CT_INT; 250 flags |= UNSIGNED; 251 base = 16; 252 break; 253 254 #ifndef NO_FLOATING_POINT 255 case 'A': case 'E': case 'F': case 'G': 256 case 'a': case 'e': case 'f': case 'g': 257 c = CT_FLOAT; 258 break; 259 #endif 260 261 case 'S': 262 flags |= LONG; 263 /* FALLTHROUGH */ 264 case 's': 265 c = CT_STRING; 266 break; 267 268 case '[': 269 fmt = __sccl(ccltab, fmt); 270 flags |= NOSKIP; 271 c = CT_CCL; 272 break; 273 274 case 'C': 275 flags |= LONG; 276 /* FALLTHROUGH */ 277 case 'c': 278 flags |= NOSKIP; 279 c = CT_CHAR; 280 break; 281 282 case 'p': /* pointer format is like hex */ 283 flags |= POINTER | PFXOK; 284 c = CT_INT; /* assumes sizeof(uintmax_t) */ 285 flags |= UNSIGNED; /* >= sizeof(uintptr_t) */ 286 base = 16; 287 break; 288 289 case 'n': 290 nconversions++; 291 if (flags & SUPPRESS) /* ??? */ 292 continue; 293 if (flags & SHORTSHORT) 294 *va_arg(ap, char *) = nread; 295 else if (flags & SHORT) 296 *va_arg(ap, short *) = nread; 297 else if (flags & LONG) 298 *va_arg(ap, long *) = nread; 299 else if (flags & LONGLONG) 300 *va_arg(ap, long long *) = nread; 301 else if (flags & INTMAXT) 302 *va_arg(ap, intmax_t *) = nread; 303 else if (flags & SIZET) 304 *va_arg(ap, size_t *) = nread; 305 else if (flags & PTRDIFFT) 306 *va_arg(ap, ptrdiff_t *) = nread; 307 else 308 *va_arg(ap, int *) = nread; 309 continue; 310 311 default: 312 goto match_failure; 313 314 /* 315 * Disgusting backwards compatibility hack. XXX 316 */ 317 case '\0': /* compat */ 318 return (EOF); 319 } 320 321 /* 322 * We have a conversion that requires input. 323 */ 324 if (fp->_r <= 0 && __srefill(fp)) 325 goto input_failure; 326 327 /* 328 * Consume leading white space, except for formats 329 * that suppress this. 330 */ 331 if ((flags & NOSKIP) == 0) { 332 while (isspace(*fp->_p)) { 333 nread++; 334 if (--fp->_r > 0) 335 fp->_p++; 336 else if (__srefill(fp)) 337 goto input_failure; 338 } 339 /* 340 * Note that there is at least one character in 341 * the buffer, so conversions that do not set NOSKIP 342 * ca no longer result in an input failure. 343 */ 344 } 345 346 /* 347 * Do the conversion. 348 */ 349 switch (c) { 350 351 case CT_CHAR: 352 /* scan arbitrary characters (sets NOSKIP) */ 353 if (width == 0) 354 width = 1; 355 if (flags & LONG) { 356 if ((flags & SUPPRESS) == 0) 357 wcp = va_arg(ap, wchar_t *); 358 else 359 wcp = NULL; 360 n = 0; 361 while (width != 0) { 362 if (n == MB_CUR_MAX) { 363 fp->_flags |= __SERR; 364 goto input_failure; 365 } 366 buf[n++] = *fp->_p; 367 fp->_p++; 368 fp->_r--; 369 mbs = initial; 370 nconv = mbrtowc(wcp, buf, n, &mbs); 371 if (nconv == (size_t)-1) { 372 fp->_flags |= __SERR; 373 goto input_failure; 374 } 375 if (nconv == 0 && !(flags & SUPPRESS)) 376 *wcp = L'\0'; 377 if (nconv != (size_t)-2) { 378 nread += n; 379 width--; 380 if (!(flags & SUPPRESS)) 381 wcp++; 382 n = 0; 383 } 384 if (fp->_r <= 0 && __srefill(fp)) { 385 if (n != 0) { 386 fp->_flags |= __SERR; 387 goto input_failure; 388 } 389 break; 390 } 391 } 392 if (!(flags & SUPPRESS)) 393 nassigned++; 394 } else if (flags & SUPPRESS) { 395 size_t sum = 0; 396 for (;;) { 397 if ((n = fp->_r) < width) { 398 sum += n; 399 width -= n; 400 fp->_p += n; 401 if (__srefill(fp)) { 402 if (sum == 0) 403 goto input_failure; 404 break; 405 } 406 } else { 407 sum += width; 408 fp->_r -= width; 409 fp->_p += width; 410 break; 411 } 412 } 413 nread += sum; 414 } else { 415 size_t r = __fread((void *)va_arg(ap, char *), 1, 416 width, fp); 417 418 if (r == 0) 419 goto input_failure; 420 nread += r; 421 nassigned++; 422 } 423 nconversions++; 424 break; 425 426 case CT_CCL: 427 /* scan a (nonempty) character class (sets NOSKIP) */ 428 if (width == 0) 429 width = (size_t)~0; /* `infinity' */ 430 /* take only those things in the class */ 431 if (flags & LONG) { 432 wchar_t twc; 433 int nchars; 434 435 if ((flags & SUPPRESS) == 0) 436 wcp = va_arg(ap, wchar_t *); 437 else 438 wcp = &twc; 439 n = 0; 440 nchars = 0; 441 while (width != 0) { 442 if (n == MB_CUR_MAX) { 443 fp->_flags |= __SERR; 444 goto input_failure; 445 } 446 buf[n++] = *fp->_p; 447 fp->_p++; 448 fp->_r--; 449 mbs = initial; 450 nconv = mbrtowc(wcp, buf, n, &mbs); 451 if (nconv == (size_t)-1) { 452 fp->_flags |= __SERR; 453 goto input_failure; 454 } 455 if (nconv == 0) 456 *wcp = L'\0'; 457 if (nconv != (size_t)-2) { 458 if (wctob(*wcp) != EOF && 459 !ccltab[wctob(*wcp)]) { 460 while (n != 0) { 461 n--; 462 __ungetc(buf[n], 463 fp); 464 } 465 break; 466 } 467 nread += n; 468 width--; 469 if (!(flags & SUPPRESS)) 470 wcp++; 471 nchars++; 472 n = 0; 473 } 474 if (fp->_r <= 0 && __srefill(fp)) { 475 if (n != 0) { 476 fp->_flags |= __SERR; 477 goto input_failure; 478 } 479 break; 480 } 481 } 482 if (n != 0) { 483 fp->_flags |= __SERR; 484 goto input_failure; 485 } 486 n = nchars; 487 if (n == 0) 488 goto match_failure; 489 if (!(flags & SUPPRESS)) { 490 *wcp = L'\0'; 491 nassigned++; 492 } 493 } else if (flags & SUPPRESS) { 494 n = 0; 495 while (ccltab[*fp->_p]) { 496 n++, fp->_r--, fp->_p++; 497 if (--width == 0) 498 break; 499 if (fp->_r <= 0 && __srefill(fp)) { 500 if (n == 0) 501 goto input_failure; 502 break; 503 } 504 } 505 if (n == 0) 506 goto match_failure; 507 } else { 508 p0 = p = va_arg(ap, char *); 509 while (ccltab[*fp->_p]) { 510 fp->_r--; 511 *p++ = *fp->_p++; 512 if (--width == 0) 513 break; 514 if (fp->_r <= 0 && __srefill(fp)) { 515 if (p == p0) 516 goto input_failure; 517 break; 518 } 519 } 520 n = p - p0; 521 if (n == 0) 522 goto match_failure; 523 *p = 0; 524 nassigned++; 525 } 526 nread += n; 527 nconversions++; 528 break; 529 530 case CT_STRING: 531 /* like CCL, but zero-length string OK, & no NOSKIP */ 532 if (width == 0) 533 width = (size_t)~0; 534 if (flags & LONG) { 535 wchar_t twc; 536 537 if ((flags & SUPPRESS) == 0) 538 wcp = va_arg(ap, wchar_t *); 539 else 540 wcp = &twc; 541 n = 0; 542 while (!isspace(*fp->_p) && width != 0) { 543 if (n == MB_CUR_MAX) { 544 fp->_flags |= __SERR; 545 goto input_failure; 546 } 547 buf[n++] = *fp->_p; 548 fp->_p++; 549 fp->_r--; 550 mbs = initial; 551 nconv = mbrtowc(wcp, buf, n, &mbs); 552 if (nconv == (size_t)-1) { 553 fp->_flags |= __SERR; 554 goto input_failure; 555 } 556 if (nconv == 0) 557 *wcp = L'\0'; 558 if (nconv != (size_t)-2) { 559 if (iswspace(*wcp)) { 560 while (n != 0) { 561 n--; 562 __ungetc(buf[n], 563 fp); 564 } 565 break; 566 } 567 nread += n; 568 width--; 569 if (!(flags & SUPPRESS)) 570 wcp++; 571 n = 0; 572 } 573 if (fp->_r <= 0 && __srefill(fp)) { 574 if (n != 0) { 575 fp->_flags |= __SERR; 576 goto input_failure; 577 } 578 break; 579 } 580 } 581 if (!(flags & SUPPRESS)) { 582 *wcp = L'\0'; 583 nassigned++; 584 } 585 } else if (flags & SUPPRESS) { 586 n = 0; 587 while (!isspace(*fp->_p)) { 588 n++, fp->_r--, fp->_p++; 589 if (--width == 0) 590 break; 591 if (fp->_r <= 0 && __srefill(fp)) 592 break; 593 } 594 nread += n; 595 } else { 596 p0 = p = va_arg(ap, char *); 597 while (!isspace(*fp->_p)) { 598 fp->_r--; 599 *p++ = *fp->_p++; 600 if (--width == 0) 601 break; 602 if (fp->_r <= 0 && __srefill(fp)) 603 break; 604 } 605 *p = 0; 606 nread += p - p0; 607 nassigned++; 608 } 609 nconversions++; 610 continue; 611 612 case CT_INT: 613 /* scan an integer as if by the conversion function */ 614 #ifdef hardway 615 if (width == 0 || width > sizeof(buf) - 1) 616 width = sizeof(buf) - 1; 617 #else 618 /* size_t is unsigned, hence this optimisation */ 619 if (--width > sizeof(buf) - 2) 620 width = sizeof(buf) - 2; 621 width++; 622 #endif 623 flags |= SIGNOK | NDIGITS | NZDIGITS; 624 for (p = buf; width; width--) { 625 c = *fp->_p; 626 /* 627 * Switch on the character; `goto ok' 628 * if we accept it as a part of number. 629 */ 630 switch (c) { 631 632 /* 633 * The digit 0 is always legal, but is 634 * special. For %i conversions, if no 635 * digits (zero or nonzero) have been 636 * scanned (only signs), we will have 637 * base==0. In that case, we should set 638 * it to 8 and enable 0x prefixing. 639 * Also, if we have not scanned zero digits 640 * before this, do not turn off prefixing 641 * (someone else will turn it off if we 642 * have scanned any nonzero digits). 643 */ 644 case '0': 645 if (base == 0) { 646 base = 8; 647 flags |= PFXOK; 648 } 649 if (flags & NZDIGITS) 650 flags &= ~(SIGNOK|NZDIGITS|NDIGITS); 651 else 652 flags &= ~(SIGNOK|PFXOK|NDIGITS); 653 goto ok; 654 655 /* 1 through 7 always legal */ 656 case '1': case '2': case '3': 657 case '4': case '5': case '6': case '7': 658 base = basefix[base]; 659 flags &= ~(SIGNOK | PFXOK | NDIGITS); 660 goto ok; 661 662 /* digits 8 and 9 ok iff decimal or hex */ 663 case '8': case '9': 664 base = basefix[base]; 665 if (base <= 8) 666 break; /* not legal here */ 667 flags &= ~(SIGNOK | PFXOK | NDIGITS); 668 goto ok; 669 670 /* letters ok iff hex */ 671 case 'A': case 'B': case 'C': 672 case 'D': case 'E': case 'F': 673 case 'a': case 'b': case 'c': 674 case 'd': case 'e': case 'f': 675 /* no need to fix base here */ 676 if (base <= 10) 677 break; /* not legal here */ 678 flags &= ~(SIGNOK | PFXOK | NDIGITS); 679 goto ok; 680 681 /* sign ok only as first character */ 682 case '+': case '-': 683 if (flags & SIGNOK) { 684 flags &= ~SIGNOK; 685 flags |= HAVESIGN; 686 goto ok; 687 } 688 break; 689 690 /* 691 * x ok iff flag still set & 2nd char (or 692 * 3rd char if we have a sign). 693 */ 694 case 'x': case 'X': 695 if (flags & PFXOK && p == 696 buf + 1 + !!(flags & HAVESIGN)) { 697 base = 16; /* if %i */ 698 flags &= ~PFXOK; 699 goto ok; 700 } 701 break; 702 } 703 704 /* 705 * If we got here, c is not a legal character 706 * for a number. Stop accumulating digits. 707 */ 708 break; 709 ok: 710 /* 711 * c is legal: store it and look at the next. 712 */ 713 *p++ = c; 714 if (--fp->_r > 0) 715 fp->_p++; 716 else if (__srefill(fp)) 717 break; /* EOF */ 718 } 719 /* 720 * If we had only a sign, it is no good; push 721 * back the sign. If the number ends in `x', 722 * it was [sign] '0' 'x', so push back the x 723 * and treat it as [sign] '0'. 724 */ 725 if (flags & NDIGITS) { 726 if (p > buf) 727 (void) __ungetc(*(u_char *)--p, fp); 728 goto match_failure; 729 } 730 c = ((u_char *)p)[-1]; 731 if (c == 'x' || c == 'X') { 732 --p; 733 (void) __ungetc(c, fp); 734 } 735 if ((flags & SUPPRESS) == 0) { 736 uintmax_t res; 737 738 *p = 0; 739 if ((flags & UNSIGNED) == 0) 740 res = strtoimax(buf, (char **)NULL, base); 741 else 742 res = strtoumax(buf, (char **)NULL, base); 743 if (flags & POINTER) 744 *va_arg(ap, void **) = 745 (void *)(uintptr_t)res; 746 else if (flags & SHORTSHORT) 747 *va_arg(ap, char *) = res; 748 else if (flags & SHORT) 749 *va_arg(ap, short *) = res; 750 else if (flags & LONG) 751 *va_arg(ap, long *) = res; 752 else if (flags & LONGLONG) 753 *va_arg(ap, long long *) = res; 754 else if (flags & INTMAXT) 755 *va_arg(ap, intmax_t *) = res; 756 else if (flags & PTRDIFFT) 757 *va_arg(ap, ptrdiff_t *) = res; 758 else if (flags & SIZET) 759 *va_arg(ap, size_t *) = res; 760 else 761 *va_arg(ap, int *) = res; 762 nassigned++; 763 } 764 nread += p - buf; 765 nconversions++; 766 break; 767 768 #ifndef NO_FLOATING_POINT 769 case CT_FLOAT: 770 /* scan a floating point number as if by strtod */ 771 if (width == 0 || width > sizeof(buf) - 1) 772 width = sizeof(buf) - 1; 773 if ((width = parsefloat(fp, buf, buf + width)) == 0) 774 goto match_failure; 775 if ((flags & SUPPRESS) == 0) { 776 if (flags & LONGDBL) { 777 long double res = strtold(buf, &p); 778 *va_arg(ap, long double *) = res; 779 } else if (flags & LONG) { 780 double res = strtod(buf, &p); 781 *va_arg(ap, double *) = res; 782 } else { 783 float res = strtof(buf, &p); 784 *va_arg(ap, float *) = res; 785 } 786 if (__scanfdebug && p - buf != width) 787 abort(); 788 nassigned++; 789 } 790 nread += width; 791 nconversions++; 792 break; 793 #endif /* !NO_FLOATING_POINT */ 794 } 795 } 796 input_failure: 797 return (nconversions != 0 ? nassigned : EOF); 798 match_failure: 799 return (nassigned); 800 } 801 802 /* 803 * Fill in the given table from the scanset at the given format 804 * (just after `['). Return a pointer to the character past the 805 * closing `]'. The table has a 1 wherever characters should be 806 * considered part of the scanset. 807 */ 808 static const u_char * 809 __sccl(tab, fmt) 810 char *tab; 811 const u_char *fmt; 812 { 813 int c, n, v, i; 814 815 /* first `clear' the whole table */ 816 c = *fmt++; /* first char hat => negated scanset */ 817 if (c == '^') { 818 v = 1; /* default => accept */ 819 c = *fmt++; /* get new first char */ 820 } else 821 v = 0; /* default => reject */ 822 823 /* XXX: Will not work if sizeof(tab*) > sizeof(char) */ 824 (void) memset(tab, v, 256); 825 826 if (c == 0) 827 return (fmt - 1);/* format ended before closing ] */ 828 829 /* 830 * Now set the entries corresponding to the actual scanset 831 * to the opposite of the above. 832 * 833 * The first character may be ']' (or '-') without being special; 834 * the last character may be '-'. 835 */ 836 v = 1 - v; 837 for (;;) { 838 tab[c] = v; /* take character c */ 839 doswitch: 840 n = *fmt++; /* and examine the next */ 841 switch (n) { 842 843 case 0: /* format ended too soon */ 844 return (fmt - 1); 845 846 case '-': 847 /* 848 * A scanset of the form 849 * [01+-] 850 * is defined as `the digit 0, the digit 1, 851 * the character +, the character -', but 852 * the effect of a scanset such as 853 * [a-zA-Z0-9] 854 * is implementation defined. The V7 Unix 855 * scanf treats `a-z' as `the letters a through 856 * z', but treats `a-a' as `the letter a, the 857 * character -, and the letter a'. 858 * 859 * For compatibility, the `-' is not considerd 860 * to define a range if the character following 861 * it is either a close bracket (required by ANSI) 862 * or is not numerically greater than the character 863 * we just stored in the table (c). 864 */ 865 n = *fmt; 866 if (n == ']' 867 || (__collate_load_error ? n < c : 868 __collate_range_cmp (n, c) < 0 869 ) 870 ) { 871 c = '-'; 872 break; /* resume the for(;;) */ 873 } 874 fmt++; 875 /* fill in the range */ 876 if (__collate_load_error) { 877 do { 878 tab[++c] = v; 879 } while (c < n); 880 } else { 881 for (i = 0; i < 256; i ++) 882 if ( __collate_range_cmp (c, i) < 0 883 && __collate_range_cmp (i, n) <= 0 884 ) 885 tab[i] = v; 886 } 887 #if 1 /* XXX another disgusting compatibility hack */ 888 c = n; 889 /* 890 * Alas, the V7 Unix scanf also treats formats 891 * such as [a-c-e] as `the letters a through e'. 892 * This too is permitted by the standard.... 893 */ 894 goto doswitch; 895 #else 896 c = *fmt++; 897 if (c == 0) 898 return (fmt - 1); 899 if (c == ']') 900 return (fmt); 901 #endif 902 break; 903 904 case ']': /* end of scanset */ 905 return (fmt); 906 907 default: /* just another character */ 908 c = n; 909 break; 910 } 911 } 912 /* NOTREACHED */ 913 } 914 915 #ifndef NO_FLOATING_POINT 916 static int 917 parsefloat(FILE *fp, char *buf, char *end) 918 { 919 char *commit, *p; 920 int infnanpos = 0; 921 enum { 922 S_START, S_GOTSIGN, S_INF, S_NAN, S_MAYBEHEX, 923 S_DIGITS, S_FRAC, S_EXP, S_EXPDIGITS 924 } state = S_START; 925 unsigned char c; 926 char decpt = *localeconv()->decimal_point; 927 _Bool gotmantdig = 0, ishex = 0; 928 929 /* 930 * We set commit = p whenever the string we have read so far 931 * constitutes a valid representation of a floating point 932 * number by itself. At some point, the parse will complete 933 * or fail, and we will ungetc() back to the last commit point. 934 * To ensure that the file offset gets updated properly, it is 935 * always necessary to read at least one character that doesn't 936 * match; thus, we can't short-circuit "infinity" or "nan(...)". 937 */ 938 commit = buf - 1; 939 for (p = buf; p < end; ) { 940 c = *fp->_p; 941 reswitch: 942 switch (state) { 943 case S_START: 944 state = S_GOTSIGN; 945 if (c == '-' || c == '+') 946 break; 947 else 948 goto reswitch; 949 case S_GOTSIGN: 950 switch (c) { 951 case '0': 952 state = S_MAYBEHEX; 953 commit = p; 954 break; 955 case 'I': 956 case 'i': 957 state = S_INF; 958 break; 959 case 'N': 960 case 'n': 961 state = S_NAN; 962 break; 963 default: 964 state = S_DIGITS; 965 goto reswitch; 966 } 967 break; 968 case S_INF: 969 if (infnanpos > 6 || 970 (c != "nfinity"[infnanpos] && 971 c != "NFINITY"[infnanpos])) 972 goto parsedone; 973 if (infnanpos == 1 || infnanpos == 6) 974 commit = p; /* inf or infinity */ 975 infnanpos++; 976 break; 977 case S_NAN: 978 switch (infnanpos) { 979 case -1: /* XXX kludge to deal with nan(...) */ 980 goto parsedone; 981 case 0: 982 if (c != 'A' && c != 'a') 983 goto parsedone; 984 break; 985 case 1: 986 if (c != 'N' && c != 'n') 987 goto parsedone; 988 else 989 commit = p; 990 break; 991 case 2: 992 if (c != '(') 993 goto parsedone; 994 break; 995 default: 996 if (c == ')') { 997 commit = p; 998 infnanpos = -2; 999 } else if (!isalnum(c) && c != '_') 1000 goto parsedone; 1001 break; 1002 } 1003 infnanpos++; 1004 break; 1005 case S_MAYBEHEX: 1006 state = S_DIGITS; 1007 if (c == 'X' || c == 'x') { 1008 ishex = 1; 1009 break; 1010 } else { /* we saw a '0', but no 'x' */ 1011 gotmantdig = 1; 1012 goto reswitch; 1013 } 1014 case S_DIGITS: 1015 if ((ishex && isxdigit(c)) || isdigit(c)) 1016 gotmantdig = 1; 1017 else { 1018 state = S_FRAC; 1019 if (c != decpt) 1020 goto reswitch; 1021 } 1022 if (gotmantdig) 1023 commit = p; 1024 break; 1025 case S_FRAC: 1026 if (((c == 'E' || c == 'e') && !ishex) || 1027 ((c == 'P' || c == 'p') && ishex)) { 1028 if (!gotmantdig) 1029 goto parsedone; 1030 else 1031 state = S_EXP; 1032 } else if ((ishex && isxdigit(c)) || isdigit(c)) { 1033 commit = p; 1034 gotmantdig = 1; 1035 } else 1036 goto parsedone; 1037 break; 1038 case S_EXP: 1039 state = S_EXPDIGITS; 1040 if (c == '-' || c == '+') 1041 break; 1042 else 1043 goto reswitch; 1044 case S_EXPDIGITS: 1045 if (isdigit(c)) 1046 commit = p; 1047 else 1048 goto parsedone; 1049 break; 1050 default: 1051 abort(); 1052 } 1053 *p++ = c; 1054 if (--fp->_r > 0) 1055 fp->_p++; 1056 else if (__srefill(fp)) 1057 break; /* EOF */ 1058 } 1059 1060 parsedone: 1061 while (commit < --p) 1062 __ungetc(*(u_char *)p, fp); 1063 *++commit = '\0'; 1064 return (commit - buf); 1065 } 1066 #endif 1067