Assorted whitespace cleanup and typo fixes.
[haiku.git] / src / system / libroot / posix / stdlib / strtoll.c
blob59d5cd72f81691fe48eb86c54cac8e418286aaaa
1 /*-
2 * Copyright (c) 1992, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
35 #include <limits.h>
36 #include <errno.h>
37 #include <ctype.h>
38 #include <stdlib.h>
40 #include <errno_private.h>
44 * Convert a string to a long long integer.
46 * Assumes that the upper and lower case
47 * alphabets and digits are each contiguous.
50 long long
51 strtoll(const char * __restrict nptr, char ** __restrict endptr, int base)
53 const char *s;
54 unsigned long long acc;
55 char c;
56 unsigned long long cutoff;
57 int neg, any, cutlim;
60 * Skip white space and pick up leading +/- sign if any.
61 * If base is 0, allow 0x for hex and 0 for octal, else
62 * assume decimal; if base is already 16, allow 0x.
64 s = nptr;
65 do {
66 c = *s++;
67 } while (isspace((unsigned char)c));
68 if (c == '-') {
69 neg = 1;
70 c = *s++;
71 } else {
72 neg = 0;
73 if (c == '+')
74 c = *s++;
76 if ((base == 0 || base == 16) &&
77 c == '0' && (*s == 'x' || *s == 'X')) {
78 c = s[1];
79 s += 2;
80 base = 16;
82 if (base == 0)
83 base = c == '0' ? 8 : 10;
84 acc = any = 0;
85 if (base < 2 || base > 36)
86 goto noconv;
89 * Compute the cutoff value between legal numbers and illegal
90 * numbers. That is the largest legal value, divided by the
91 * base. An input number that is greater than this value, if
92 * followed by a legal input character, is too big. One that
93 * is equal to this value may be valid or not; the limit
94 * between valid and invalid numbers is then based on the last
95 * digit. For instance, if the range for quads is
96 * [-9223372036854775808..9223372036854775807] and the input base
97 * is 10, cutoff will be set to 922337203685477580 and cutlim to
98 * either 7 (neg==0) or 8 (neg==1), meaning that if we have
99 * accumulated a value > 922337203685477580, or equal but the
100 * next digit is > 7 (or 8), the number is too big, and we will
101 * return a range error.
103 * Set 'any' if any `digits' consumed; make it negative to indicate
104 * overflow.
106 cutoff = neg ? (unsigned long long)-(LONGLONG_MIN + LONGLONG_MAX) + LONGLONG_MAX
107 : LONGLONG_MAX;
108 cutlim = cutoff % base;
109 cutoff /= base;
110 for ( ; ; c = *s++) {
111 if (c >= '0' && c <= '9')
112 c -= '0';
113 else if (c >= 'A' && c <= 'Z')
114 c -= 'A' - 10;
115 else if (c >= 'a' && c <= 'z')
116 c -= 'a' - 10;
117 else
118 break;
119 if (c >= base)
120 break;
121 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
122 any = -1;
123 else {
124 any = 1;
125 acc *= base;
126 acc += c;
129 if (any < 0) {
130 acc = neg ? LONGLONG_MIN : LONGLONG_MAX;
131 __set_errno(ERANGE);
132 } else if (!any) {
133 noconv:
134 __set_errno(EINVAL);
135 } else if (neg)
136 acc = -acc;
137 if (endptr != NULL)
138 *endptr = (char *)(any ? s - 1 : nptr);
140 return acc;
144 long long __strtoll_internal(const char *number, char **_end, int base, int group);
146 long long
147 __strtoll_internal(const char *number, char **_end, int base, int group)
149 // ToDo: group is currently not supported!
150 (void)group;
152 return strtoll(number, _end, base);