25bd15a151e9f5c64a27d89fc106c2c71684762a
7 strtol(const char *nptr
, char **endptr
, int base
)
13 int neg
= 0, any
, cutlim
;
16 * Skip white space and pick up leading +/- sign if any.
17 * If base is 0, allow 0x for hex and 0 for octal, else
18 * assume decimal; if base is already 16, allow 0x.
30 if ((base
== 0 || base
== 16) &&
31 c
== '0' && (*s
== 'x' || *s
== 'X'))
38 base
= c
== '0' ? 8 : 10;
41 * Compute the cutoff value between legal numbers and illegal
42 * numbers. That is the largest legal value, divided by the
43 * base. An input number that is greater than this value, if
44 * followed by a legal input character, is too big. One that
45 * is equal to this value may be valid or not; the limit
46 * between valid and invalid numbers is then based on the last
47 * digit. For instance, if the range for longs is
48 * [-2147483648..2147483647] and the input base is 10,
49 * cutoff will be set to 214748364 and cutlim to either
50 * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
51 * a value > 214748364, or equal but the next digit is > 7 (or 8),
52 * the number is too big, and we will return a range error.
54 * Set any if any `digits' consumed; make it negative to indicate
57 cutoff
= neg
? ((unsigned long)LONG_MAX
+1) : LONG_MAX
;
58 cutlim
= cutoff
% (unsigned long)base
;
59 cutoff
/= (unsigned long)base
;
60 for (acc
= 0, any
= 0;; c
= *s
++)
65 c
-= isupper(c
) ? 'A' - 10 : 'a' - 10;
70 if (any
< 0 || acc
> cutoff
|| (acc
== cutoff
&& c
> cutlim
))
81 acc
= neg
? LONG_MIN
: LONG_MAX
;
89 *endptr
= any
? (char *)((size_t)(s
- 1)) : (char *)((size_t)nptr
);