2
* Portions Copyright (c) 1996-2005, PostgreSQL Global Development Group
3
* Portions Copyright (c) 1990 The Regents of the University of California.
6
* Redistribution and use in source and binary forms, with or without
7
* modification, are permitted provided that the following conditions
9
* 1. Redistributions of source code must retain the above copyright
10
* notice, this list of conditions and the following disclaimer.
11
* 2. Redistributions in binary form must reproduce the above copyright
12
* notice, this list of conditions and the following disclaimer in the
13
* documentation and/or other materials provided with the distribution.
14
* 3. All advertising materials mentioning features or use of this software
15
* must display the following acknowledgement:
16
* This product includes software developed by the University of
17
* California, Berkeley and its contributors.
18
* 4. Neither the name of the University nor the names of its contributors
19
* may be used to endorse or promote products derived from this software
20
* without specific prior written permission.
22
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35
#if defined(LIBC_SCCS) && !defined(lint)
36
static char sccsid[] = "@(#)strtol.c 5.4 (Berkeley) 2/23/91";
37
#endif /* LIBC_SCCS and not lint */
47
* Convert a string to a long integer.
49
* Ignores `locale' stuff. Assumes that the upper and lower case
50
* alphabets and digits are each contiguous.
53
strtol(nptr, endptr, base)
67
* Skip white space and pick up leading +/- sign if any. If base is 0,
68
* allow 0x for hex and 0 for octal, else assume decimal; if base is
69
* already 16, allow 0x.
82
if ((base == 0 || base == 16) &&
83
c == '0' && (*s == 'x' || *s == 'X'))
90
base = c == '0' ? 8 : 10;
93
* Compute the cutoff value between legal numbers and illegal numbers.
94
* That is the largest legal value, divided by the base. An input
95
* number that is greater than this value, if followed by a legal
96
* input character, is too big. One that is equal to this value may
97
* be valid or not; the limit between valid and invalid numbers is
98
* then based on the last digit. For instance, if the range for longs
99
* is [-2147483648..2147483647] and the input base is 10, cutoff will
100
* be set to 214748364 and cutlim to either 7 (neg==0) or 8 (neg==1),
101
* meaning that if we have accumulated a value > 214748364, or equal
102
* but the next digit is > 7 (or 8), the number is too big, and we
103
* will return a range error.
105
* Set any if any `digits' consumed; make it negative to indicate
108
cutoff = neg ? -(unsigned long) LONG_MIN : LONG_MAX;
109
cutlim = cutoff % (unsigned long) base;
110
cutoff /= (unsigned long) base;
111
for (acc = 0, any = 0;; c = *s++)
116
c -= isupper(c) ? 'A' - 10 : 'a' - 10;
121
if (any < 0 || acc > cutoff || acc == cutoff && (int) c > cutlim)
132
acc = neg ? LONG_MIN : LONG_MAX;
138
*endptr = any ? s - 1 : (char *) nptr;