10 #if LDBL_MANT_DIG == 53 && LDBL_MAX_EXP == 1024
13 #define LD_B1B_MAX 9007199, 254740991
16 #else /* LDBL_MANT_DIG == 64 && LDBL_MAX_EXP == 16384 */
19 #define LD_B1B_MAX 18, 446744073, 709551615
27 static long long scanexp(FILE *f, int pok)
35 if (c=='+' || c=='-') {
38 if (c-'0'>=10U && pok) shunget(f);
44 for (x=0; c-'0'<10U && x<INT_MAX/10; c = shgetc(f))
46 for (y=x; c-'0'<10U && x<LLONG_MAX/10; c = shgetc(f))
48 for (; c-'0'<10U; c = shgetc(f));
54 static long double decfloat(FILE *f, int bits, int emin, int sign, int pok)
57 static const uint32_t th[] = { LD_B1B_MAX };
59 long long lrp=-1, dc=0;
74 /* Don't let leading zeros consume buffer space */
75 for (; c=='0'; c = shgetc(f)) gotdig=1;
78 for (; c-'0'<10U || c=='.'; c = shgetc(f)) {
82 } else if (k < KMAX) {
84 if (j) x[k] = x[k]*10 + c-'0';
98 if (gotdig && (c|32)=='e') {
99 e10 = scanexp(f, pok);
100 if (e10 == LLONG_MIN) {
120 if (lrp==dc && (!k || (k==1 && !j)) && (bits>30 || x[0]>>bits==0))
121 return sign * (long double)x[0];
123 return sign * LDBL_MAX * LDBL_MAX;
124 if (lrp < emin-2*LDBL_MANT_DIG)
125 return sign * LDBL_MIN * LDBL_MIN;
128 for (; j<9; j++) x[k]*=10;
138 while (rp < 18+9*LD_B1B_DIG) {
141 for (k=(z-1 & MASK); ; k=(k-1 & MASK)) {
142 uint64_t tmp = ((uint64_t)x[k] << 29) + carry;
143 if (tmp > 1000000000) {
144 carry = tmp / 1000000000;
145 x[k] = tmp % 1000000000;
150 if (k==(z-1 & MASK) && k!=a && !x[k]) z = k;
157 x[z-1 & MASK] |= x[z];
165 static const int p10s[] = {
166 100000000, 10000000, 1000000, 100000,
170 int p10 = p10s[rpm9-1];
172 for (k=a; k!=z; k=(k+1 & MASK)) {
173 uint32_t tmp = x[k] % p10;
174 x[k] = x[k]/p10 + carry;
175 carry = 1000000000/p10 * tmp;
182 if ((z+1 & MASK) != a) {
185 } else x[z-1 & MASK] |= 1;
193 for (i=0; i<LD_B1B_DIG; i++) {
195 if (k == z || x[k] < th[i]) {
199 if (x[a+i & MASK] > th[i]) break;
201 if (i==LD_B1B_DIG && rp==9*LD_B1B_DIG) break;
202 /* FIXME: find a way to compute optimal sh */
203 if (rp > 9+9*LD_B1B_DIG) sh = 9;
205 for (k=a; k!=z; k=(k+1 & MASK)) {
206 uint32_t tmp = x[k] & (1<<sh)-1;
207 x[k] = (x[k]>>sh) + carry;
208 carry = (1000000000>>sh) * tmp;
215 if ((z+1 & MASK) != a) {
218 } else x[z-1 & MASK] |= 1;
222 for (y=i=0; i<LD_B1B_DIG && (a+i & MASK)!=z; i++)
223 y = 1000000000.0L * y + x[a+i & MASK];
227 if (bits > LDBL_MANT_DIG+e2-emin) {
228 bits = LDBL_MANT_DIG+e2-emin;
232 if (bits < LDBL_MANT_DIG) {
233 bias = copysignl(scalbn(1, 2*LDBL_MANT_DIG-bits-1), y);
234 frac = fmodl(y, scalbn(1, LDBL_MANT_DIG-bits));
239 if ((a+i & MASK) != z) {
240 uint32_t t = x[a+i & MASK];
241 if (t < 500000000 && (t || (a+i+1 & MASK) != z))
243 else if (t > 500000000)
245 else if (t == 500000000) {
246 if ((a+i+1 & MASK) == z)
251 if (LDBL_MANT_DIG-bits >= 2 && !fmodl(frac, 1))
263 static long double hexfloat(FILE *f, int bits, int emin, int sign, int pok)
267 long double scale = 1;
268 long double bias = 0;
269 int gottail = 0, gotrad = 0, gotdig = 0;
278 /* Skip leading zeros */
279 for (; c=='0'; c = shgetc(f)) gotdig = 1;
284 /* Count zeros after the radix point before significand */
285 for (rp=0; c=='0'; c = shgetc(f), rp--) gotdig = 1;
288 for (; c-'0'<10U || (c|32)-'a'<6U || c=='.'; c = shgetc(f)) {
295 if (c > '9') d = (c|32)+10-'a';
299 } else if (dc < LDBL_MANT_DIG/4+1) {
301 } else if (d && !gottail) {
312 if (gotrad) shunget(f);
318 if (!gotrad) rp = dc;
319 while (dc<8) x *= 16, dc++;
321 e2 = scanexp(f, pok);
322 if (e2 == LLONG_MIN) {
334 if (!x) return sign * 0.0;
335 if (e2 > -emin) return sign * LDBL_MAX * LDBL_MAX;
336 if (e2 < emin-2*LDBL_MANT_DIG) return sign * LDBL_MIN * LDBL_MIN;
338 while (x < 0x80000000) {
349 if (bits > 32+e2-emin) {
354 if (bits < LDBL_MANT_DIG)
355 bias = copysignl(scalbn(1, 32+LDBL_MANT_DIG-bits-1), sign);
357 if (bits<32 && y && !(x&1)) x++, y=0;
359 y = bias + sign*(long double)x + sign*y;
362 return scalbnl(y, e2);
365 long double __floatscan(FILE *f, int c, int prec, int pok)
382 bits = LDBL_MANT_DIG;
389 if (c<0) c = shgetc(f);
391 if (c=='+' || c=='-') {
396 for (i=0; i<8 && (c|32)=="infinity"[i]; i++)
397 if (i<7) c = shgetc(f);
398 if (i==3 || i==8 || (i>3 && pok)) {
399 if (i==3) shunget(f);
400 if (pok) for (; i>3; i--) shunget(f);
402 return sign * INFINITY;
404 if (!i) for (i=0; i<3 && (c|32)=="nan"[i]; i++)
405 if (i<3) c = shgetc(f);
419 return hexfloat(f, bits, emin, sign, pok);
424 return decfloat(f, bits, emin, sign, pok);