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