1
0

vfscanf.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336
  1. #include <stdlib.h>
  2. #include <stdarg.h>
  3. #include <ctype.h>
  4. #include <wchar.h>
  5. #include <wctype.h>
  6. #include <limits.h>
  7. #include <string.h>
  8. #include <stdint.h>
  9. #include "stdio_impl.h"
  10. #include "shgetc.h"
  11. #include "intscan.h"
  12. #include "floatscan.h"
  13. #define SIZE_hh -2
  14. #define SIZE_h -1
  15. #define SIZE_def 0
  16. #define SIZE_l 1
  17. #define SIZE_L 2
  18. #define SIZE_ll 3
  19. static void store_int(void *dest, int size, unsigned long long i)
  20. {
  21. if (!dest) return;
  22. switch (size) {
  23. case SIZE_hh:
  24. *(char *)dest = i;
  25. break;
  26. case SIZE_h:
  27. *(short *)dest = i;
  28. break;
  29. case SIZE_def:
  30. *(int *)dest = i;
  31. break;
  32. case SIZE_l:
  33. *(long *)dest = i;
  34. break;
  35. case SIZE_ll:
  36. *(long long *)dest = i;
  37. break;
  38. }
  39. }
  40. static void *arg_n(va_list ap, unsigned int n)
  41. {
  42. void *p;
  43. unsigned int i;
  44. va_list ap2;
  45. va_copy(ap2, ap);
  46. for (i=n; i>1; i--) va_arg(ap2, void *);
  47. p = va_arg(ap2, void *);
  48. va_end(ap2);
  49. return p;
  50. }
  51. int vfscanf(FILE *restrict f, const char *restrict fmt, va_list ap)
  52. {
  53. int width;
  54. int size;
  55. int alloc;
  56. int base;
  57. const unsigned char *p;
  58. int c, t;
  59. char *s;
  60. wchar_t *wcs;
  61. mbstate_t st;
  62. void *dest=NULL;
  63. int invert;
  64. int matches=0;
  65. unsigned long long x;
  66. long double y;
  67. off_t pos = 0;
  68. unsigned char scanset[257];
  69. size_t i, k;
  70. wchar_t wc;
  71. FLOCK(f);
  72. for (p=(const unsigned char *)fmt; *p; p++) {
  73. alloc = 0;
  74. if (isspace(*p)) {
  75. while (isspace(p[1])) p++;
  76. shlim(f, 0);
  77. while (isspace(shgetc(f)));
  78. shunget(f);
  79. pos += shcnt(f);
  80. continue;
  81. }
  82. if (*p != '%' || p[1] == '%') {
  83. shlim(f, 0);
  84. if (*p == '%') {
  85. p++;
  86. while (isspace((c=shgetc(f))));
  87. } else {
  88. c = shgetc(f);
  89. }
  90. if (c!=*p) {
  91. shunget(f);
  92. if (c<0) goto input_fail;
  93. goto match_fail;
  94. }
  95. pos += shcnt(f);
  96. continue;
  97. }
  98. p++;
  99. if (*p=='*') {
  100. dest = 0; p++;
  101. } else if (isdigit(*p) && p[1]=='$') {
  102. dest = arg_n(ap, *p-'0'); p+=2;
  103. } else {
  104. dest = va_arg(ap, void *);
  105. }
  106. for (width=0; isdigit(*p); p++) {
  107. width = 10*width + *p - '0';
  108. }
  109. if (*p=='m') {
  110. wcs = 0;
  111. s = 0;
  112. alloc = !!dest;
  113. p++;
  114. } else {
  115. alloc = 0;
  116. }
  117. size = SIZE_def;
  118. switch (*p++) {
  119. case 'h':
  120. if (*p == 'h') p++, size = SIZE_hh;
  121. else size = SIZE_h;
  122. break;
  123. case 'l':
  124. if (*p == 'l') p++, size = SIZE_ll;
  125. else size = SIZE_l;
  126. break;
  127. case 'j':
  128. size = SIZE_ll;
  129. break;
  130. case 'z':
  131. case 't':
  132. size = SIZE_l;
  133. break;
  134. case 'L':
  135. size = SIZE_L;
  136. break;
  137. case 'd': case 'i': case 'o': case 'u': case 'x':
  138. case 'a': case 'e': case 'f': case 'g':
  139. case 'A': case 'E': case 'F': case 'G': case 'X':
  140. case 's': case 'c': case '[':
  141. case 'S': case 'C':
  142. case 'p': case 'n':
  143. p--;
  144. break;
  145. default:
  146. goto fmt_fail;
  147. }
  148. t = *p;
  149. /* C or S */
  150. if ((t&0x2f) == 3) {
  151. t |= 32;
  152. size = SIZE_l;
  153. }
  154. switch (t) {
  155. case 'c':
  156. if (width < 1) width = 1;
  157. case '[':
  158. break;
  159. case 'n':
  160. store_int(dest, size, pos);
  161. /* do not increment match count, etc! */
  162. continue;
  163. default:
  164. shlim(f, 0);
  165. while (isspace(shgetc(f)));
  166. shunget(f);
  167. pos += shcnt(f);
  168. }
  169. shlim(f, width);
  170. if (shgetc(f) < 0) goto input_fail;
  171. shunget(f);
  172. switch (t) {
  173. case 's':
  174. case 'c':
  175. case '[':
  176. if (t == 'c' || t == 's') {
  177. memset(scanset, -1, sizeof scanset);
  178. scanset[0] = 0;
  179. if (t == 's') {
  180. scanset[1+'\t'] = 0;
  181. scanset[1+'\n'] = 0;
  182. scanset[1+'\v'] = 0;
  183. scanset[1+'\f'] = 0;
  184. scanset[1+'\r'] = 0;
  185. scanset[1+' '] = 0;
  186. }
  187. } else {
  188. if (*++p == '^') p++, invert = 1;
  189. else invert = 0;
  190. memset(scanset, invert, sizeof scanset);
  191. scanset[0] = 0;
  192. if (*p == '-') p++, scanset[1+'-'] = 1-invert;
  193. else if (*p == ']') p++, scanset[1+']'] = 1-invert;
  194. for (; *p != ']'; p++) {
  195. if (!*p) goto fmt_fail;
  196. if (*p=='-' && p[1] && p[1] != ']')
  197. for (c=p++[-1]; c<*p; c++)
  198. scanset[1+c] = 1-invert;
  199. scanset[1+*p] = 1-invert;
  200. }
  201. }
  202. wcs = 0;
  203. s = 0;
  204. i = 0;
  205. k = t=='c' ? width+1U : 31;
  206. if (size == SIZE_l) {
  207. if (alloc) {
  208. wcs = malloc(k*sizeof(wchar_t));
  209. if (!wcs) goto alloc_fail;
  210. } else {
  211. wcs = dest;
  212. }
  213. st = (mbstate_t){0};
  214. while (scanset[(c=shgetc(f))+1]) {
  215. switch (mbrtowc(&wc, &(char){c}, 1, &st)) {
  216. case -1:
  217. goto input_fail;
  218. case -2:
  219. continue;
  220. }
  221. if (wcs) wcs[i++] = wc;
  222. if (alloc && i==k) {
  223. k+=k+1;
  224. wchar_t *tmp = realloc(wcs, k*sizeof(wchar_t));
  225. if (!tmp) goto alloc_fail;
  226. wcs = tmp;
  227. }
  228. }
  229. if (!mbsinit(&st)) goto input_fail;
  230. } else if (alloc) {
  231. s = malloc(k);
  232. if (!s) goto alloc_fail;
  233. while (scanset[(c=shgetc(f))+1]) {
  234. s[i++] = c;
  235. if (i==k) {
  236. k+=k+1;
  237. char *tmp = realloc(s, k);
  238. if (!tmp) goto alloc_fail;
  239. s = tmp;
  240. }
  241. }
  242. } else if ((s = dest)) {
  243. while (scanset[(c=shgetc(f))+1])
  244. s[i++] = c;
  245. } else {
  246. while (scanset[(c=shgetc(f))+1]);
  247. }
  248. shunget(f);
  249. if (!shcnt(f)) goto match_fail;
  250. if (t == 'c' && shcnt(f) != width) goto match_fail;
  251. if (alloc) {
  252. if (size == SIZE_l) *(wchar_t **)dest = wcs;
  253. else *(char **)dest = s;
  254. }
  255. if (t != 'c') {
  256. if (wcs) wcs[i] = 0;
  257. if (s) s[i] = 0;
  258. }
  259. break;
  260. case 'p':
  261. case 'X':
  262. case 'x':
  263. base = 16;
  264. goto int_common;
  265. case 'o':
  266. base = 8;
  267. goto int_common;
  268. case 'd':
  269. case 'u':
  270. base = 10;
  271. goto int_common;
  272. case 'i':
  273. base = 0;
  274. int_common:
  275. x = __intscan(f, base, 0, ULLONG_MAX);
  276. if (!shcnt(f)) goto match_fail;
  277. if (t=='p' && dest) *(void **)dest = (void *)(uintptr_t)x;
  278. else store_int(dest, size, x);
  279. break;
  280. case 'a': case 'A':
  281. case 'e': case 'E':
  282. case 'f': case 'F':
  283. case 'g': case 'G':
  284. y = __floatscan(f, size, 0);
  285. if (!shcnt(f)) goto match_fail;
  286. if (dest) switch (size) {
  287. case SIZE_def:
  288. *(float *)dest = y;
  289. break;
  290. case SIZE_l:
  291. *(double *)dest = y;
  292. break;
  293. case SIZE_L:
  294. *(long double *)dest = y;
  295. break;
  296. }
  297. break;
  298. }
  299. pos += shcnt(f);
  300. if (dest) matches++;
  301. }
  302. if (0) {
  303. fmt_fail:
  304. alloc_fail:
  305. input_fail:
  306. if (!matches) matches--;
  307. match_fail:
  308. if (alloc) {
  309. free(s);
  310. free(wcs);
  311. }
  312. }
  313. FUNLOCK(f);
  314. return matches;
  315. }
  316. weak_alias(vfscanf,__isoc99_vfscanf);