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