forked from libdfp/libdfp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
strtod32.c
1040 lines (914 loc) · 26.9 KB
/
strtod32.c
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
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* Convert string representing a number to Decimal Float value, using given locale.
Copyright (C) 1997-2014, Free Software Foundation, Inc.
This file is part of the Decimal Floating Point C Library.
Author(s): Joseph Kerian <[email protected]>
Pete Eberlein <[email protected]>
Ryan S. Arnold <[email protected]>
The Decimal Floating Point C Library is free software; you can
redistribute it and/or modify it under the terms of the GNU Lesser
General Public License version 2.1.
The Decimal Floating Point C Library is distributed in the hope that
it will be useful, but WITHOUT ANY WARRANTY; without even the implied
warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
the GNU Lesser General Public License version 2.1 for more details.
You should have received a copy of the GNU Lesser General Public
License version 2.1 along with the Decimal Floating Point C Library;
if not, write to the Free Software Foundation, Inc., 59 Temple Place,
Suite 330, Boston, MA 02111-1307 USA.
Please see libdfp/COPYING.txt for more information. */
/* Adapted primarily from stdlib/strtod_l.c by Ulrich Drepper
<[email protected]> */
/*
* TODO: SET_MANTISSA macro for preserving NaN info (or parse as mantissa)
* TODO: Check that hexadecimal input is done properly... particularly hex
* exponants
*/
#define _GNU_SOURCE
#include <features.h>
//#include <unistd.h>
/* wchar.h has to be included BEFORE stdio.h or it loses function
* definitions when dfp/wchar.h uses #include_next <wchar.h>. */
#include <wchar.h>
#include <stdlib.h> /* Pick up the strtod* prototypes. */
#include <stdio.h>
#include <locale.h> /* For newlocale prototype. */
#include <langinfo.h> /* For nl_langinfo prototype. */
#include <ctype.h> /* isspace_l et. al. */
#include <string.h> /* strncasecmp_l */
#include <dfpwchar_private.h> /* wcstod* internal interfaces */
#include <dfpstdlib_private.h> /* strtod* internal interfaces. */
//#include <wctype.h>
#include <math.h> /* HUGE_VAL_D32, etc. */
#include <errno.h>
#define __set_errno(the_errno) *__errno_location() = the_errno
//#include <float.h>
#include <limits.h> /* For CHAR_MAX */
#include <alloca.h>
#ifndef FLOAT
# define FLOAT _Decimal32
# define FLOAT_HUGE_VAL HUGE_VAL_D32
# define FLOAT_SIZE 32
# define FLT DEC32
# define FLOAT_ZERO 0.DF
# define SET_MANTISSA(x,y)
# define PRINTF_SPEC "%Hf"
# define __DEC_MANT_DIG__ __DEC32_MANT_DIG__
# define __DEC_MAX_EXP__ __DEC32_MAX_EXP__
# define __DEC_MIN_EXP__ __DEC32_MIN_EXP__
#endif
#define DEC_TYPE FLOAT
#define _DECIMAL_SIZE FLOAT_SIZE
#include <numdigits.h>
#ifdef USE_WIDE_CHAR
extern unsigned long long int ____wcstoull_l_internal (const wchar_t *, wchar_t **,
int, int, __locale_t);
# include <wctype.h>
# define STRTO_PREFIX wcsto
# define STRING_TYPE wchar_t
# define CHAR_TYPE wint_t
# define L_(Ch) L##Ch
# define ISSPACE(Ch) iswspace_l ((Ch), loc)
# define ISDIGIT(Ch) iswdigit_l ((Ch), loc)
# define ISXDIGIT(Ch) iswxdigit_l ((Ch), loc)
# define TOLOWER(Ch) towlower_l ((Ch), loc)
//# define TOLOWER_C(Ch) towlower_l ((Ch), nl_C_locobj_ptr)
# define TOLOWER_C(Ch) towlower_l ((Ch), C_locale)
# define STRNCASECMP(S1, S2, N) \
wcsncasecmp_l ((S1), (S2), (N), C_locale)
//__wcsncasecmp_l ((S1), (S2), (N), C_locale)
// __wcsncasecmp_l ((S1), (S2), (N), _nl_C_locobj_ptr)
//# define STRTOULL(S, E, B) ____wcstoull_l_internal ((S), (E), (B), 0, loc)
# define STRTOULL(S, E, B) wcstoull_l ((S), (E), (B), loc)
#else
# define STRTO_PREFIX strto
# define STRING_TYPE char
# define CHAR_TYPE char
# define L_(Ch) Ch
# define ISSPACE(Ch) isspace_l ((Ch), loc)
# define ISDIGIT(Ch) isdigit_l ((Ch), loc)
# define ISXDIGIT(Ch) isxdigit_l ((Ch), loc)
# define TOLOWER(Ch) tolower_l ((Ch), loc)
# define TOLOWER_C(Ch) tolower_l ((Ch), C_locale)
//# define TOLOWER_C(Ch) tolower_l ((Ch), _nl_C_locobj_ptr)
# define STRNCASECMP(S1, S2, N) \
strncasecmp_l ((S1), (S2), (N), C_locale)
//__strncasecmp_l ((S1), (S2), (N), C_locale)
// __strncasecmp_l ((S1), (S2), (N), _nl_C_locobj_ptr)
//# define STRTOULL(S, E, B) ____strtoull_l_internal ((S), (E), (B), 0, loc)
# define STRTOULL(S, E, B) strtoull_l ((S), (E), (B), loc)
#endif
/* Constants we need from float.h; select the set for the FLOAT precision. */
#define MANT_DIG PASTE(PASTE(__,FLT),_MANT_DIG__)
#define DIG PASTE(PASTE(__,FLT),_DIG__)
//#define MAX_EXP PASTE(FLT,_MAX_EXP)
//#define MIN_EXP PASTE(FLT,_MIN_EXP)
#define MAX_10_EXP PASTE(PASTE(__,FLT),_MAX_EXP__)
#define MIN_10_EXP PASTE(PASTE(__,FLT),_MIN_EXP__)
#define FUNCTION_NAME PASTE(PASTE(STRTO_PREFIX,d),FLOAT_SIZE)
#define __FUNCTION_NAME PASTE(__,FUNCTION_NAME)
#define FUNCTION_INTERNAL PASTE(__FUNCTION_NAME,_internal)
#define FUNCTION_L_INTERNAL PASTE(__FUNCTION_NAME,_l_internal)
/* Extra macros required to get FLT expanded before the pasting. */
#ifndef PASTE
# define PASTE(a,b) PASTE1(a,b)
# define PASTE1(a,b) a##b
#endif
#ifndef FUNC_D
# define FUNC_D(x) PASTE(x,PASTE(d,_DECIMAL_SIZE))
#endif
#define RETURN(val,end) \
do { if (endptr != NULL) *endptr = (STRING_TYPE *) (end); \
return val; } while (0)
#define NDEBUG 1
#include <assert.h>
/* From glibc's stdlib/grouping.c */
#ifndef MAX
#define MAX(a,b) ({ typeof(a) _a = (a); typeof(b) _b = (b); \
_a > _b ? _a : _b; })
#endif
/* Find the maximum prefix of the string between BEGIN and END which
satisfies the grouping rules. It is assumed that at least one digit
follows BEGIN directly. */
static const STRING_TYPE *
#ifdef USE_WIDE_CHAR
__correctly_grouped_prefixwc (const STRING_TYPE *begin, const STRING_TYPE *end,
wchar_t thousands,
#else
__correctly_grouped_prefixmb (const STRING_TYPE *begin, const STRING_TYPE *end,
const char *thousands,
#endif
const char *grouping)
{
#ifndef USE_WIDE_CHAR
size_t thousands_len;
int cnt;
#endif
if (grouping == NULL)
return end;
#ifndef USE_WIDE_CHAR
thousands_len = strlen (thousands);
#endif
while (end > begin)
{
const STRING_TYPE *cp = end - 1;
const char *gp = grouping;
/* Check first group. */
while (cp >= begin)
{
#ifdef USE_WIDE_CHAR
if (*cp == thousands)
break;
#else
if (cp[thousands_len - 1] == *thousands)
{
for (cnt = 1; thousands[cnt] != '\0'; ++cnt)
if (thousands[cnt] != cp[thousands_len - 1 - cnt])
break;
if (thousands[cnt] == '\0')
break;
}
#endif
--cp;
}
/* We allow the representation to contain no grouping at all even if
the locale specifies we can have grouping. */
if (cp < begin)
return end;
if (end - cp == (int) *gp + 1)
{
/* This group matches the specification. */
const STRING_TYPE *new_end;
if (cp < begin)
/* There is just one complete group. We are done. */
return end;
/* CP points to a thousands separator character. The preceding
remainder of the string from BEGIN to NEW_END is the part we
will consider if there is a grouping error in this trailing
portion from CP to END. */
new_end = cp - 1;
/* Loop while the grouping is correct. */
while (1)
{
/* Get the next grouping rule. */
++gp;
if (*gp == 0)
/* If end is reached use last rule. */
--gp;
/* Skip the thousands separator. */
--cp;
if (*gp == CHAR_MAX
#if CHAR_MIN < 0
|| *gp < 0
#endif
)
{
/* No more thousands separators are allowed to follow. */
while (cp >= begin)
{
#ifdef USE_WIDE_CHAR
if (*cp == thousands)
break;
#else
for (cnt = 0; thousands[cnt] != '\0'; ++cnt)
if (thousands[cnt] != cp[thousands_len - cnt - 1])
break;
if (thousands[cnt] == '\0')
break;
#endif
--cp;
}
if (cp < begin)
/* OK, only digits followed. */
return end;
}
else
{
/* Check the next group. */
const STRING_TYPE *group_end = cp;
while (cp >= begin)
{
#ifdef USE_WIDE_CHAR
if (*cp == thousands)
break;
#else
for (cnt = 0; thousands[cnt] != '\0'; ++cnt)
if (thousands[cnt] != cp[thousands_len - cnt - 1])
break;
if (thousands[cnt] == '\0')
break;
#endif
--cp;
}
if (cp < begin && group_end - cp <= (int) *gp)
/* Final group is correct. */
return end;
if (cp < begin || group_end - cp != (int) *gp)
/* Incorrect group. Punt. */
break;
}
}
/* The trailing portion of the string starting at NEW_END
contains a grouping error. So we will look for a correctly
grouped number in the preceding portion instead. */
end = new_end;
}
else
{
/* Even the first group was wrong; determine maximum shift. */
if (end - cp > (int) *gp + 1)
end = cp + (int) *gp + 1;
else if (cp < begin)
/* This number does not fill the first group, but is correct. */
return end;
else
/* CP points to a thousands separator character. */
end = cp;
}
}
return MAX (begin, end);
}
/* This is of the form __strtod32_l_internal() */
FLOAT
FUNCTION_L_INTERNAL (const STRING_TYPE * nptr, STRING_TYPE ** endptr,
int group, locale_t loc)
{
FLOAT d32 = FLOAT_ZERO;
int negative; /* The sign of the number. */
int exponent; /* Exponent of the number. */
/* Numbers starting `0X' or `0x' have to be processed with base 16. */
int base = 10;
/* Running pointer after the last character processed in the string. */
const STRING_TYPE *cp, *tp;
/* Start of significant part of the number. */
const STRING_TYPE *startp, *start_of_digits;
/* Points at the character following the integer and fractional digits. */
const STRING_TYPE *expp;
/* Total number of digit and number of digits in integer part. */
int dig_no, int_no, lead_zero;
/* Contains the last character read. */
CHAR_TYPE c;
__locale_t C_locale;
/* We should get wint_t from <stddef.h>, but not all GCC versions define it
there. So define it ourselves if it remains undefined. */
#ifndef _WINT_T
typedef unsigned int wint_t;
#endif
/* The radix character of the current locale. */
#ifdef USE_WIDE_CHAR
const char *decimalmb;
wchar_t decimal;
#else
const char *decimal;
size_t decimal_len;
#endif
/* The thousands character of the current locale. */
#ifdef USE_WIDE_CHAR
const char *thousandsmb = NULL;
wchar_t thousands = L'\0';
#else
const char *thousands = NULL;
/* Used in several places. */
int cnt;
#endif
/* The numeric grouping specification of the current locale,
in the format described in <locale.h>. */
const char *grouping;
C_locale = newlocale(LC_ALL_MASK, setlocale (LC_ALL, NULL),NULL);
if (group)
{
//grouping = _NL_CURRENT (LC_NUMERIC, GROUPING);
grouping = nl_langinfo (__GROUPING);
if (*grouping <= 0 || *grouping == CHAR_MAX)
grouping = NULL;
else
{
/* Figure out the thousands separator character. */
#ifdef USE_WIDE_CHAR
thousandsmb = nl_langinfo(_NL_NUMERIC_THOUSANDS_SEP_WC);
mbrtowc(&thousands,thousandsmb, CHAR_MAX, NULL);
if (thousands == L'\0')
grouping = NULL;
#else
thousands = nl_langinfo (__THOUSANDS_SEP);
if (*thousands == '\0')
{
thousands = NULL;
grouping = NULL;
}
#endif
}
}
else
grouping = NULL;
/* Find the locale's decimal point character. */
#ifdef USE_WIDE_CHAR
decimalmb = nl_langinfo(_NL_NUMERIC_DECIMAL_POINT_WC);
mbrtowc(&decimal,decimalmb, CHAR_MAX, NULL);
assert (decimal != L'\0');
# define decimal_len 1
#else
// decimal = _NL_CURRENT (LC_NUMERIC, DECIMAL_POINT);
decimal = nl_langinfo(__DECIMAL_POINT);
decimal_len = strlen (decimal);
assert (decimal_len > 0);
#endif
/* Prepare number representation. */
exponent = 0;
negative = 0;
/* Parse string to get maximal legal prefix. We need the number of
characters of the integer part, the fractional part and the exponent. */
cp = nptr - 1;
/* Ignore leading white space. */
do
c = *++cp; /* c is last character read, cp is last character processed. */
while (ISSPACE (c));
/* Get sign of the result. */
if (c == L_('-'))
{
negative = 1;
c = *++cp;
}
else if (c == L_('+'))
c = *++cp;
/* Return 0.0 if no legal string is found.
No character is used even if a sign was found. */
#ifdef USE_WIDE_CHAR
if (c == (wint_t) decimal
&& (wint_t) cp[1] >= L'0' && (wint_t) cp[1] <= L'9')
{
/* We accept it. This funny construct is here only to indent
the code directly. */
}
#else
for (cnt = 0; decimal[cnt] != '\0'; ++cnt)
if (cp[cnt] != decimal[cnt])
break;
if (decimal[cnt] == '\0' && cp[cnt] >= '0' && cp[cnt] <= '9')
{
/* We accept it. This funny construct is here only to indent
the code directly. */
}
#endif
else if (c < L_('0') || c > L_('9'))
{
/* Check for `INF' or `INFINITY'. */
if (TOLOWER_C (c) == L_('i') && STRNCASECMP (cp, L_("inf"), 3) == 0)
{
/* Return +/- infinity. */
if (endptr != NULL)
*endptr = (STRING_TYPE *)
(cp + (STRNCASECMP (cp + 3, L_("inity"), 5) == 0
? 8 : 3));
freelocale(C_locale);
return negative ? -FLOAT_HUGE_VAL : FLOAT_HUGE_VAL;
}
if (TOLOWER_C (c) == L_('n') && STRNCASECMP (cp, L_("nan"), 3) == 0)
{
/* Return NaN. */
FLOAT retval = DEC_NAN;
cp += 3;
/* Match `(n-char-sequence-digit)'. */
if (*cp == L_('('))
{
startp = cp;
do
++cp;
while ((*cp >= L_('0') && *cp <= L_('9'))
|| (TOLOWER (*cp) >= L_('a') && TOLOWER (*cp) <= L_('z'))
|| *cp == L_('_'));
if (*cp != L_(')'))
/* The closing brace is missing. Only match the NAN
part. */
cp = startp;
#if 0
else
{
/* This is a system-dependent way to specify the
bitmask used for the NaN. We expect it to be
a number which is put in the mantissa of the
number. */
STRING_TYPE *endp;
unsigned long long int mant;
mant = STRTOULL (startp + 1, &endp, 0);
if (endp == cp)
{
SET_MANTISSA (retval, mant);
}
}
#endif
}
if (endptr != NULL)
*endptr = (STRING_TYPE *) cp;
freelocale(C_locale);
return retval;
}
/* It is really a text we do not recognize. */
RETURN (0.0, nptr);
}
/* First look whether we are faced with a hexadecimal number. */
if (c == L_('0') && TOLOWER (cp[1]) == L_('x'))
{
/* Okay, it is a hexa-decimal number. Remember this and skip
the characters. BTW: hexadecimal numbers must not be
grouped. */
base = 16;
cp += 2;
c = *cp;
grouping = NULL;
}
/* Record the start of the digits, in case we will check their grouping. */
start_of_digits = startp = cp;
/* Ignore leading zeroes. This helps us to avoid useless computations. */
#ifdef USE_WIDE_CHAR
while (c == L'0' || ((wint_t) thousands != L'\0' && c == (wint_t) thousands))
c = *++cp;
#else
if (thousands == NULL)
while (c == '0')
c = *++cp;
else
{
/* We also have the multibyte thousands string. */
while (1)
{
if (c != '0')
{
for (cnt = 0; thousands[cnt] != '\0'; ++cnt)
if (c != thousands[cnt])
break;
if (thousands[cnt] != '\0')
break;
}
c = *++cp;
}
}
#endif
/* If no other digit but a '0' is found the result is 0.0.
Return current read pointer. */
if ((c < L_('0') || c > L_('9'))
&& (base == 16 && (c < (CHAR_TYPE) TOLOWER (L_('a'))
|| c > (CHAR_TYPE) TOLOWER (L_('f'))))
#ifdef USE_WIDE_CHAR
&& c != (wint_t) decimal
#else
&& ({ for (cnt = 0; decimal[cnt] != '\0'; ++cnt)
if (decimal[cnt] != cp[cnt])
break;
decimal[cnt] != '\0'; })
#endif
&& (base == 16 && (cp == start_of_digits
|| (CHAR_TYPE) TOLOWER (c) != L_('p')))
&& (base != 16 && (CHAR_TYPE) TOLOWER (c) != L_('e')))
{
#ifdef USE_WIDE_CHAR
tp = __correctly_grouped_prefixwc (start_of_digits, cp, thousands,
grouping);
#else
tp = __correctly_grouped_prefixmb (start_of_digits, cp, thousands,
grouping);
#endif
/* If TP is at the start of the digits, there was no correctly
grouped prefix of the string; so no number found. */
RETURN (negative ? -FLOAT_ZERO : FLOAT_ZERO,
tp == start_of_digits ? (base == 16 ? cp - 1 : nptr) : tp);
}
/* Remember first significant digit and read following characters until the
decimal point, exponent character or any non-FP number character. */
startp = cp;
dig_no = 0;
while (1)
{
if ((c >= L_('0') && c <= L_('9'))
|| (base == 16 && (wint_t) TOLOWER (c) >= L_('a')
&& (wint_t) TOLOWER (c) <= L_('f')))
++dig_no;
else
{
#ifdef USE_WIDE_CHAR
if ((wint_t) thousands == L'\0' || c != (wint_t) thousands)
/* Not a digit or separator: end of the integer part. */
break;
#else
if (thousands == NULL)
break;
else
{
for (cnt = 0; thousands[cnt] != '\0'; ++cnt)
if (thousands[cnt] != cp[cnt])
break;
if (thousands[cnt] != '\0')
break;
}
#endif
}
c = *++cp;
}
if (grouping && dig_no > 0)
{
/* Check the grouping of the digits. */
#ifdef USE_WIDE_CHAR
tp = __correctly_grouped_prefixwc (start_of_digits, cp, thousands,
grouping);
#else
tp = __correctly_grouped_prefixmb (start_of_digits, cp, thousands,
grouping);
#endif
if (cp != tp)
{
/* Less than the entire string was correctly grouped. */
if (tp == start_of_digits)
/* No valid group of numbers at all: no valid number. */
RETURN (FLOAT_ZERO, nptr);
if (tp < startp)
/* The number is validly grouped, but consists
only of zeroes. The whole value is zero. */
RETURN (negative ? -FLOAT_ZERO : FLOAT_ZERO, tp);
/* Recompute DIG_NO so we won't read more digits than
are properly grouped. */
cp = tp;
dig_no = 0;
for (tp = startp; tp < cp; ++tp)
if (*tp >= L_('0') && *tp <= L_('9'))
++dig_no;
int_no = dig_no;
lead_zero = 0;
goto number_parsed;
}
}
/* We have the number digits in the integer part. Whether these are all or
any is really a fractional digit will be decided later. */
int_no = dig_no;
lead_zero = int_no == 0 ? -1 : 0; /* FIXME: Why was this -1 */
/* Read the fractional digits. A special case are the 'american style'
numbers like `16.' i.e. with decimal but without trailing digits. */
if (
#ifdef USE_WIDE_CHAR
c == (wint_t) decimal
#else
({ for (cnt = 0; decimal[cnt] != '\0'; ++cnt)
if (decimal[cnt] != cp[cnt])
break;
decimal[cnt] == '\0'; })
#endif
)
{
cp += decimal_len;
c = *cp;
while ((c >= L_('0') && c <= L_('9')) ||
(base == 16 && TOLOWER (c) >= L_('a') && TOLOWER (c) <= L_('f')))
{
if (c != L_('0') && lead_zero == -1)
lead_zero = dig_no - int_no;
++dig_no;
c = *++cp;
}
}
/* Remember start of exponent (if any). */
expp = cp;
/* Read exponent. */
if ((base == 16 && TOLOWER (c) == L_('p'))
|| (base != 16 && TOLOWER (c) == L_('e')))
{
int exp_negative = 0;
c = *++cp;
if (c == L_('-'))
{
exp_negative = 1;
c = *++cp;
}
else if (c == L_('+'))
c = *++cp;
if (c >= L_('0') && c <= L_('9'))
{
int exp_limit;
/* Get the exponent limit. */
#if 0
if (base == 16)
exp_limit = (exp_negative ?
-MIN_EXP + MANT_DIG + 4 * int_no :
MAX_EXP - 4 * int_no + lead_zero);
else
#endif
exp_limit = (exp_negative ?
-MIN_10_EXP + MANT_DIG + int_no :
MAX_10_EXP - int_no + lead_zero);
do
{
exponent *= 10;
if (exponent > exp_limit)
/* The exponent is too large/small to represent a valid
number. */
{
FLOAT result;
/* We have to take care for special situation: a joker
might have written "0.0e100000" which is in fact
zero. */
if (lead_zero == -1)
result = negative ? -FLOAT_ZERO : FLOAT_ZERO;
else
{
/* Overflow or underflow. */
__set_errno (ERANGE);
result = (exp_negative ? FLOAT_ZERO :
negative ? -FLOAT_HUGE_VAL : FLOAT_HUGE_VAL);
}
/* Accept all following digits as part of the exponent. */
do
++cp;
while (*cp >= L_('0') && *cp <= L_('9'));
RETURN (result, cp);
/* NOTREACHED */
}
exponent += c - L_('0');
c = *++cp;
}
while (c >= L_('0') && c <= L_('9'));
if (exp_negative)
exponent = -exponent;
}
else
cp = expp;
}
/* We don't want to have to work with trailing zeroes after the radix. */
#if 0 /* Actually, for DFP, we do. */
if (dig_no > int_no)
{
while (expp[-1] == L_('0'))
{
--expp;
/*--exponent;*/ /* FIXME: This can't be here */
--dig_no;
}
assert (dig_no >= int_no);
}
if (dig_no == int_no && dig_no > 0 && exponent < 0)
do
{
while (! (base == 16 ? ISXDIGIT (expp[-1]) : ISDIGIT (expp[-1])))
--expp;
if (expp[-1] != L_('0'))
break;
--expp;
--dig_no;
--int_no;
++exponent;
}
while (dig_no > 0 && exponent < 0);
#endif
number_parsed:
/* The whole string is parsed. Store the address of the next character. */
if (endptr)
*endptr = (STRING_TYPE *) cp;
if (dig_no == 0)
{
if (exponent == 0)
{
freelocale(C_locale);
return negative ? -FLOAT_ZERO : FLOAT_ZERO;
}
#if NUMDIGITS_SUPPORT==0
d32 += 1;
while(exponent-- > 0) /* FIXME: this doesn't work right for exponent>0 */
d32 *= 10;
while(++exponent < 0)
d32 /= 10;
d32 -= d32;
#else
d32 = FUNC_D(setexp) (d32, exponent);
#endif
freelocale(C_locale);
return negative ? -d32 : d32;
}
if (lead_zero)
{
/* Find the decimal point */
#ifdef USE_WIDE_CHAR
while (*startp != decimal)
++startp;
#else
while (1)
{
if (*startp == decimal[0])
{
for (cnt = 1; decimal[cnt] != '\0'; ++cnt)
if (decimal[cnt] != startp[cnt])
break;
if (decimal[cnt] == '\0')
break;
}
++startp;
}
#endif
lead_zero = (lead_zero < 0? 0 : lead_zero);
startp += lead_zero + decimal_len;
exponent -= base == 16 ? 4 * lead_zero : lead_zero;
dig_no -= lead_zero;
}
/* Now we have the number of digits in total and the integer digits as well
as the exponent and its sign. We can decide whether the read digits are
really integer digits or belong to the fractional part; i.e. we normalize
123e-2 to 1.23. */
{
register int incr = (exponent < 0 ? MAX (-int_no, exponent)
: MIN (dig_no - int_no, exponent));
int_no += incr;
exponent -= incr;
}
if (int_no + exponent > MAX_10_EXP + 1)
{
__set_errno (ERANGE);
freelocale(C_locale);
return negative ? -FLOAT_HUGE_VAL : FLOAT_HUGE_VAL;
}
/* Obvious underflow before normalization. */
if (exponent < MIN_10_EXP - MANT_DIG + 1 )
{
__set_errno (ERANGE);
freelocale(C_locale);
return FLOAT_ZERO;
}
/* Read in the integer portion of the input string */
if (int_no > 0)
{
/* Read the integer part as a d32. */
int digcnt = int_no;
while (int_no > MAX_10_EXP + 1)
{
digcnt--;
exponent++;
}
do
{
/* There might be thousands separators or radix characters in
the string. But these all can be ignored because we know the
format of the number is correct and we have an exact number
of characters to read. */
#ifdef USE_WIDE_CHAR
if (*startp < L_('0') || *startp > L_('9'))
if (base==10 || (*startp < L_('a') || *startp > L_('h')))
++startp;
#else
if (*startp < L_('0') || *startp > L_('9'))
if (base==10 || (*startp < L_('a') || *startp > L_('h')))
{
int inner = 0;
if (thousands != NULL && *startp == *thousands
&& ({ for (inner = 1; thousands[inner] != '\0'; ++inner)
if (thousands[inner] != startp[inner])
break;
thousands[inner] == '\0'; }))
startp += inner;
else
startp += decimal_len;
}
#endif
if(base == 10)
d32 = d32 * base + (*startp - L_('0'));
else
d32 = d32 * base + (*startp >= L_('0') && *startp <= L_('9') ?
-L_('0') : 10-L_('a')) + *startp;
++startp;
}
while (--digcnt > 0);
}
/* If we haven't filled our datatype, read in the fractional digits */
if (int_no <= MANT_DIG && dig_no > int_no)
{
/* Read the decimal part as a FLOAT. */
int digcnt = dig_no - int_no;
/* There might be radix characters in
the string. But these all can be ignored because we know the
format of the number is correct and we have an exact number
of characters to read. */
/*do
{
if(base == 10)
frac = frac/10 + *(startp+digcnt-1) - L_('0');
else
frac = frac/10 + (*(startp+digcnt-1) >= L_('0') &&
*(startp+digcnt-1) <= L_('9') ? -L_('0') : 10-L_('a'))
+ *(startp+digcnt-1);
}
while (--digcnt > 0);
frac /= 10;
d32 += frac;*/
int_no = 0;
do
{
#ifdef USE_WIDE_CHAR
if (*startp < L_('0') || *startp > L_('9'))
++startp;
#else
if (*startp < '0' || *startp > '9')
startp += decimal_len;
#endif
/* We need the extra digit to get proper rounding. */
if (int_no < MANT_DIG + 1)
{
if(base == 10)
d32 = d32*10 + (*startp - L_('0'));
else
d32 = d32*10 + (*startp >= L_('0') &&
*startp <= L_('9') ? -L_('0') : 10-L_('a'))
+ *startp;
++startp;
--exponent;
int_no++;
}
}
while (--digcnt > 0);
}
#if NUMDIGITS_SUPPORT==0
while(exponent-- > 0)
d32 *= 10;
while(++exponent < 0)
d32 /= 10;
#else
/* Computed underflow after normalization. */
if ( exponent < (__DEC_MIN_EXP__ - __DEC_MANT_DIG__))
{
__set_errno (ERANGE);
freelocale(C_locale);
return FLOAT_ZERO;
}
/* Left justification allows us to set a positive exponent that's near
* __DEC*_MAX_EXP__, i.e. _almost_ overflowing. Complete left justification
* may be overkill for most numbers in this situation, so perhaps a specific
* digit shift will be a better solution in the future. */
if (exponent > (__DEC_MAX_EXP__ - __DEC_MANT_DIG__))
d32 = FUNC_D(left_justify) (d32);
d32 = FUNC_D(setexp) (d32, FUNC_D (getexp) (d32) + exponent);
#endif