1*1debfc3dSmrg /*
2*1debfc3dSmrg * Copyright (c) 2014 Regents of the University of California.
3*1debfc3dSmrg * All rights reserved.
4*1debfc3dSmrg *
5*1debfc3dSmrg * Redistribution and use in source and binary forms, with or without
6*1debfc3dSmrg * modification, are permitted provided that the following conditions
7*1debfc3dSmrg * are met:
8*1debfc3dSmrg * 1. Redistributions of source code must retain the above copyright
9*1debfc3dSmrg * notice, this list of conditions and the following disclaimer.
10*1debfc3dSmrg * 2. Redistributions in binary form must reproduce the above copyright
11*1debfc3dSmrg * notice, this list of conditions and the following disclaimer in the
12*1debfc3dSmrg * documentation and/or other materials provided with the distribution.
13*1debfc3dSmrg * 3. [rescinded 22 July 1999]
14*1debfc3dSmrg * 4. Neither the name of the University nor the names of its contributors
15*1debfc3dSmrg * may be used to endorse or promote products derived from this software
16*1debfc3dSmrg * without specific prior written permission.
17*1debfc3dSmrg *
18*1debfc3dSmrg * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
19*1debfc3dSmrg * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20*1debfc3dSmrg * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21*1debfc3dSmrg * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22*1debfc3dSmrg * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23*1debfc3dSmrg * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24*1debfc3dSmrg * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25*1debfc3dSmrg * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26*1debfc3dSmrg * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27*1debfc3dSmrg * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28*1debfc3dSmrg * SUCH DAMAGE.
29*1debfc3dSmrg */
30*1debfc3dSmrg
31*1debfc3dSmrg #ifdef HAVE_CONFIG_H
32*1debfc3dSmrg #include "config.h"
33*1debfc3dSmrg #endif
34*1debfc3dSmrg #ifdef HAVE_LIMITS_H
35*1debfc3dSmrg #include <limits.h>
36*1debfc3dSmrg #endif
37*1debfc3dSmrg #ifdef HAVE_SYS_PARAM_H
38*1debfc3dSmrg #include <sys/param.h>
39*1debfc3dSmrg #endif
40*1debfc3dSmrg #include <errno.h>
41*1debfc3dSmrg #ifdef NEED_DECLARATION_ERRNO
42*1debfc3dSmrg extern int errno;
43*1debfc3dSmrg #endif
44*1debfc3dSmrg #if 0
45*1debfc3dSmrg #include <stdlib.h>
46*1debfc3dSmrg #endif
47*1debfc3dSmrg #include "ansidecl.h"
48*1debfc3dSmrg #include "safe-ctype.h"
49*1debfc3dSmrg
50*1debfc3dSmrg #ifdef HAVE_LONG_LONG
51*1debfc3dSmrg
52*1debfc3dSmrg __extension__
53*1debfc3dSmrg typedef unsigned long long ullong_type;
54*1debfc3dSmrg
55*1debfc3dSmrg #ifndef ULLONG_MAX
56*1debfc3dSmrg #define ULLONG_MAX (~(ullong_type)0) /* 0xFFFFFFFFFFFFFFFF */
57*1debfc3dSmrg #endif
58*1debfc3dSmrg
59*1debfc3dSmrg /*
60*1debfc3dSmrg * Convert a string to an unsigned long long integer.
61*1debfc3dSmrg *
62*1debfc3dSmrg * Ignores `locale' stuff. Assumes that the upper and lower case
63*1debfc3dSmrg * alphabets and digits are each contiguous.
64*1debfc3dSmrg */
65*1debfc3dSmrg ullong_type
strtoull(const char * nptr,char ** endptr,register int base)66*1debfc3dSmrg strtoull(const char *nptr, char **endptr, register int base)
67*1debfc3dSmrg {
68*1debfc3dSmrg register const char *s = nptr;
69*1debfc3dSmrg register ullong_type acc;
70*1debfc3dSmrg register int c;
71*1debfc3dSmrg register ullong_type cutoff;
72*1debfc3dSmrg register int neg = 0, any, cutlim;
73*1debfc3dSmrg
74*1debfc3dSmrg /*
75*1debfc3dSmrg * See strtol for comments as to the logic used.
76*1debfc3dSmrg */
77*1debfc3dSmrg do {
78*1debfc3dSmrg c = *s++;
79*1debfc3dSmrg } while (ISSPACE(c));
80*1debfc3dSmrg if (c == '-') {
81*1debfc3dSmrg neg = 1;
82*1debfc3dSmrg c = *s++;
83*1debfc3dSmrg } else if (c == '+')
84*1debfc3dSmrg c = *s++;
85*1debfc3dSmrg if ((base == 0 || base == 16) &&
86*1debfc3dSmrg c == '0' && (*s == 'x' || *s == 'X')) {
87*1debfc3dSmrg c = s[1];
88*1debfc3dSmrg s += 2;
89*1debfc3dSmrg base = 16;
90*1debfc3dSmrg }
91*1debfc3dSmrg if (base == 0)
92*1debfc3dSmrg base = c == '0' ? 8 : 10;
93*1debfc3dSmrg cutoff = (ullong_type)ULLONG_MAX / (ullong_type)base;
94*1debfc3dSmrg cutlim = (ullong_type)ULLONG_MAX % (ullong_type)base;
95*1debfc3dSmrg for (acc = 0, any = 0;; c = *s++) {
96*1debfc3dSmrg if (ISDIGIT(c))
97*1debfc3dSmrg c -= '0';
98*1debfc3dSmrg else if (ISALPHA(c))
99*1debfc3dSmrg c -= ISUPPER(c) ? 'A' - 10 : 'a' - 10;
100*1debfc3dSmrg else
101*1debfc3dSmrg break;
102*1debfc3dSmrg if (c >= base)
103*1debfc3dSmrg break;
104*1debfc3dSmrg if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
105*1debfc3dSmrg any = -1;
106*1debfc3dSmrg else {
107*1debfc3dSmrg any = 1;
108*1debfc3dSmrg acc *= base;
109*1debfc3dSmrg acc += c;
110*1debfc3dSmrg }
111*1debfc3dSmrg }
112*1debfc3dSmrg if (any < 0) {
113*1debfc3dSmrg acc = ULLONG_MAX;
114*1debfc3dSmrg errno = ERANGE;
115*1debfc3dSmrg } else if (neg)
116*1debfc3dSmrg acc = -acc;
117*1debfc3dSmrg if (endptr != 0)
118*1debfc3dSmrg *endptr = (char *) (any ? s - 1 : nptr);
119*1debfc3dSmrg return (acc);
120*1debfc3dSmrg }
121*1debfc3dSmrg
122*1debfc3dSmrg #endif /* ifdef HAVE_LONG_LONG */
123