]> git.ipfire.org Git - thirdparty/squid.git/blame - lib/strtoll.c
Updates for running on squid-cache.org
[thirdparty/squid.git] / lib / strtoll.c
CommitLineData
4a8c6acc 1/*-
2 * Copyright (c) 1990 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. 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.
20 *
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.
32 */
33
34/* modified for long long <mgd@swarm.org> 1999-08-12 */
35
36#ifdef HAVE_CONFIG_H
37#include <config.h>
38#endif
39#if HAVE_CTYPE_H
40#include <ctype.h>
41#endif
42#if HAVE_ERRNO_H
43#include <errno.h>
44#endif
45
46/* Specification. */
47#include "strtoll.h"
48
49
50#ifndef INT64_MIN
51/* Native 64 bit system without strtoll() */
52#if defined(LONG_MIN) && (SIZEOF_LONG == 8)
53#define INT64_MIN LONG_MIN
54#else
55/* 32 bit system */
56#define INT64_MIN -9223372036854775807L-1L
57#endif
58#endif
59
60#ifndef INT64_MAX
61/* Native 64 bit system without strtoll() */
62#if defined(LONG_MAX) && (SIZEOF_LONG == 8)
63#define INT64_MAX LONG_MAX
64#else
65/* 32 bit system */
66#define INT64_MAX 9223372036854775807L
67#endif
68#endif
69
70
71/*
72 * Convert a string to a int64 integer.
73 *
74 * Ignores `locale' stuff. Assumes that the upper and lower case
75 * alphabets and digits are each contiguous.
76 */
77int64_t
78strtoll (const char *nptr, char **endptr, int base)
79{
80 register const char *s = nptr;
81 register u_int64_t acc;
82 register int c;
83 register u_int64_t cutoff;
84 register int neg = 0, any, cutlim;
85
86 /*
87 * Skip white space and pick up leading +/- sign if any.
88 * If base is 0, allow 0x for hex and 0 for octal, else
89 * assume decimal; if base is already 16, allow 0x.
90 */
91 do
92 {
93 c = *s++;
94 } while (xisspace(c));
95 if (c == '-')
96 {
97 neg = 1;
98 c = *s++;
99 }
100 else if (c == '+')
101 c = *s++;
102 if ((base == 0 || base == 16) && c == '0' && (*s == 'x' || *s == 'X'))
103 {
104 c = s[1];
105 s += 2;
106 base = 16;
107 }
108 if (base == 0)
109 base = c == '0' ? 8 : 10;
110
111 /*
112 * Compute the cutoff value between legal numbers and illegal
113 * numbers. That is the largest legal value, divided by the
114 * base. An input number that is greater than this value, if
115 * followed by a legal input character, is too big. One that
116 * is equal to this value may be valid or not; the limit
117 * between valid and invalid numbers is then based on the last
118 * digit. For instance, if the range for longs is
119 * [-2147483648..2147483647] and the input base is 10,
120 * cutoff will be set to 214748364 and cutlim to either
121 * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
122 * a value > 214748364, or equal but the next digit is > 7 (or 8),
123 * the number is too big, and we will return a range error.
124 *
125 * Set any if any `digits' consumed; make it negative to indicate
126 * overflow.
127 */
128 cutoff = neg ? -(u_int64_t) INT64_MIN : INT64_MAX;
129 cutlim = cutoff % (u_int64_t) base;
130 cutoff /= (u_int64_t) base;
131 for (acc = 0, any = 0;; c = *s++)
132 {
133 if (xisdigit(c))
134 c -= '0';
135 else if (xisalpha(c))
136 c -= xisupper(c) ? 'A' - 10 : 'a' - 10;
137 else
138 break;
139 if (c >= base)
140 break;
141 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
142 any = -1;
143 else
144 {
145 any = 1;
146 acc *= base;
147 acc += c;
148 }
149 }
150 if (any < 0)
151 {
152 acc = neg ? INT64_MIN : INT64_MAX;
153 errno = ERANGE;
154 }
155 else if (neg)
156 acc = -acc;
157 if (endptr != 0)
158 *endptr = (char *) (any ? s - 1 : nptr);
159 return acc;
160}
161