]>
git.ipfire.org Git - thirdparty/squid.git/blob - compat/strtoll.c
2 * Copyright (C) 1996-2023 The Squid Software Foundation and contributors
4 * Squid software is distributed under GPLv2+ license and includes
5 * contributions from numerous individuals and organizations.
6 * Please see the COPYING and CONTRIBUTORS files for details.
10 * Copyright (c) 1990 The Regents of the University of California.
11 * All rights reserved.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. All advertising materials mentioning features or use of this software
22 * must display the following acknowledgement:
23 * This product includes software developed by the University of
24 * California, Berkeley and its contributors.
25 * 4. Neither the name of the University nor the names of its contributors
26 * may be used to endorse or promote products derived from this software
27 * without specific prior written permission.
29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
42 /* modified for long long <mgd@swarm.org> 1999-08-12 */
45 #include "compat/strtoll.h"
55 * Convert a string to a int64 integer.
57 * Ignores `locale' stuff. Assumes that the upper and lower case
58 * alphabets and digits are each contiguous.
61 strtoll (const char *nptr
, char **endptr
, int base
)
63 register const char *s
= nptr
;
64 register uint64_t acc
;
66 register uint64_t cutoff
;
67 register int neg
= 0, any
, cutlim
;
70 * Skip white space and pick up leading +/- sign if any.
71 * If base is 0, allow 0x for hex and 0 for octal, else
72 * assume decimal; if base is already 16, allow 0x.
76 } while (xisspace(c
));
82 if ((base
== 0 || base
== 16) && c
== '0' && (*s
== 'x' || *s
== 'X')) {
88 base
= c
== '0' ? 8 : 10;
91 * Compute the cutoff value between legal numbers and illegal
92 * numbers. That is the largest legal value, divided by the
93 * base. An input number that is greater than this value, if
94 * followed by a legal input character, is too big. One that
95 * is equal to this value may be valid or not; the limit
96 * between valid and invalid numbers is then based on the last
97 * digit. For instance, if the range for longs is
98 * [-2147483648..2147483647] and the input base is 10,
99 * cutoff will be set to 214748364 and cutlim to either
100 * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
101 * a value > 214748364, or equal but the next digit is > 7 (or 8),
102 * the number is too big, and we will return a range error.
104 * Set any if any `digits' consumed; make it negative to indicate
107 cutoff
= neg
? -(uint64_t) INT64_MIN
: INT64_MAX
;
108 cutlim
= cutoff
% (uint64_t) base
;
109 cutoff
/= (uint64_t) base
;
110 for (acc
= 0, any
= 0;; c
= *s
++) {
113 else if (xisalpha(c
))
114 c
-= xisupper(c
) ? 'A' - 10 : 'a' - 10;
119 if (any
< 0 || acc
> cutoff
|| (acc
== cutoff
&& c
> cutlim
))
128 acc
= neg
? INT64_MIN
: INT64_MAX
;
133 *endptr
= (char *) (any
? s
- 1 : nptr
);