summaryrefslogtreecommitdiff
path: root/src/lib/libc/stdlib/strtoll.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libc/stdlib/strtoll.c')
-rw-r--r--src/lib/libc/stdlib/strtoll.c156
1 files changed, 156 insertions, 0 deletions
diff --git a/src/lib/libc/stdlib/strtoll.c b/src/lib/libc/stdlib/strtoll.c
new file mode 100644
index 0000000000..fa4d30ef5a
--- /dev/null
+++ b/src/lib/libc/stdlib/strtoll.c
@@ -0,0 +1,156 @@
1/*-
2 * Copyright (c) 1992 The Regents of the University of California.
3 * All rights reserved.
4 *
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. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 */
29
30#if defined(LIBC_SCCS) && !defined(lint)
31static const char rcsid[] = "$OpenBSD: strtoll.c,v 1.4 2005/03/30 18:51:49 pat Exp $";
32#endif /* LIBC_SCCS and not lint */
33
34#include <sys/types.h>
35
36#include <ctype.h>
37#include <errno.h>
38#include <limits.h>
39#include <stdlib.h>
40
41/*
42 * Convert a string to a long long.
43 *
44 * Ignores `locale' stuff. Assumes that the upper and lower case
45 * alphabets and digits are each contiguous.
46 */
47long long
48strtoll(const char *nptr, char **endptr, int base)
49{
50 const char *s;
51 long long acc, cutoff;
52 int c;
53 int neg, any, cutlim;
54
55 /*
56 * Skip white space and pick up leading +/- sign if any.
57 * If base is 0, allow 0x for hex and 0 for octal, else
58 * assume decimal; if base is already 16, allow 0x.
59 */
60 s = nptr;
61 do {
62 c = (unsigned char) *s++;
63 } while (isspace(c));
64 if (c == '-') {
65 neg = 1;
66 c = *s++;
67 } else {
68 neg = 0;
69 if (c == '+')
70 c = *s++;
71 }
72 if ((base == 0 || base == 16) &&
73 c == '0' && (*s == 'x' || *s == 'X')) {
74 c = s[1];
75 s += 2;
76 base = 16;
77 }
78 if (base == 0)
79 base = c == '0' ? 8 : 10;
80
81 /*
82 * Compute the cutoff value between legal numbers and illegal
83 * numbers. That is the largest legal value, divided by the
84 * base. An input number that is greater than this value, if
85 * followed by a legal input character, is too big. One that
86 * is equal to this value may be valid or not; the limit
87 * between valid and invalid numbers is then based on the last
88 * digit. For instance, if the range for long longs is
89 * [-9223372036854775808..9223372036854775807] and the input base
90 * is 10, cutoff will be set to 922337203685477580 and cutlim to
91 * either 7 (neg==0) or 8 (neg==1), meaning that if we have
92 * accumulated a value > 922337203685477580, or equal but the
93 * next digit is > 7 (or 8), the number is too big, and we will
94 * return a range error.
95 *
96 * Set any if any `digits' consumed; make it negative to indicate
97 * overflow.
98 */
99 cutoff = neg ? LLONG_MIN : LLONG_MAX;
100 cutlim = cutoff % base;
101 cutoff /= base;
102 if (neg) {
103 if (cutlim > 0) {
104 cutlim -= base;
105 cutoff += 1;
106 }
107 cutlim = -cutlim;
108 }
109 for (acc = 0, any = 0;; c = (unsigned char) *s++) {
110 if (isdigit(c))
111 c -= '0';
112 else if (isalpha(c))
113 c -= isupper(c) ? 'A' - 10 : 'a' - 10;
114 else
115 break;
116 if (c >= base)
117 break;
118 if (any < 0)
119 continue;
120 if (neg) {
121 if (acc < cutoff || (acc == cutoff && c > cutlim)) {
122 any = -1;
123 acc = LLONG_MIN;
124 errno = ERANGE;
125 } else {
126 any = 1;
127 acc *= base;
128 acc -= c;
129 }
130 } else {
131 if (acc > cutoff || (acc == cutoff && c > cutlim)) {
132 any = -1;
133 acc = LLONG_MAX;
134 errno = ERANGE;
135 } else {
136 any = 1;
137 acc *= base;
138 acc += c;
139 }
140 }
141 }
142 if (endptr != 0)
143 *endptr = (char *) (any ? s - 1 : nptr);
144 return (acc);
145}
146
147#ifdef __weak_alias
148__weak_alias(strtoq, strtoll);
149#else
150quad_t
151strtoq(const char *nptr, char **endptr, int base)
152{
153
154 return ((quad_t)strtoll(nptr, endptr, base));
155}
156#endif