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