xref: /haiku/src/system/libroot/posix/stdlib/strtoull.c (revision 1e36cfc2721ef13a187c6f7354dc9cbc485e89d3)
1 /*-
2  * Copyright (c) 1992, 1993
3  *	The Regents of the University of California.  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 
35 #include <limits.h>
36 #include <errno.h>
37 #include <ctype.h>
38 #include <stdlib.h>
39 
40 
41 /*
42  * Convert a string to an unsigned long long integer.
43  *
44  * Assumes that the upper and lower case
45  * alphabets and digits are each contiguous.
46  */
47 
48 unsigned long long
49 strtoull(const char * __restrict nptr, char ** __restrict endptr, int base)
50 {
51 	const char *s;
52 	unsigned long long acc;
53 	char c;
54 	unsigned long long cutoff;
55 	int neg, any, cutlim;
56 
57 	/*
58 	 * See strtoq for comments as to the logic used.
59 	 */
60 	s = nptr;
61 	do {
62 		c = *s++;
63 	} while (isspace((unsigned char)c));
64 	if (c == '-') {
65 		neg = 1;
66 		c = *s++;
67 	} else {
68 		neg = 0;
69 		if (c == '+')
70 			c = *s++;
71 	}
72 	if ((base == 0 || base == 16) &&
73 	    c == '0' && (*s == 'x' || *s == 'X')) {
74 		c = s[1];
75 		s += 2;
76 		base = 16;
77 	}
78 	if (base == 0)
79 		base = c == '0' ? 8 : 10;
80 	acc = any = 0;
81 	if (base < 2 || base > 36)
82 		goto noconv;
83 
84 	cutoff = ULONGLONG_MAX / base;
85 	cutlim = ULONGLONG_MAX % base;
86 	for ( ; ; c = *s++) {
87 		if (c >= '0' && c <= '9')
88 			c -= '0';
89 		else if (c >= 'A' && c <= 'Z')
90 			c -= 'A' - 10;
91 		else if (c >= 'a' && c <= 'z')
92 			c -= 'a' - 10;
93 		else
94 			break;
95 		if (c >= base)
96 			break;
97 		if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
98 			any = -1;
99 		else {
100 			any = 1;
101 			acc *= base;
102 			acc += c;
103 		}
104 	}
105 	if (any < 0) {
106 		acc = ULONGLONG_MAX;
107 		errno = ERANGE;
108 	} else if (!any) {
109 noconv:
110 		errno = EINVAL;
111 	} else if (neg)
112 		acc = -acc;
113 	if (endptr != NULL)
114 		*endptr = (char *)(any ? s - 1 : nptr);
115 
116 	return acc;
117 }
118 
119 
120 unsigned long long __strtoull_internal(const char *number, char **_end, int base, int group);
121 
122 unsigned long long
123 __strtoull_internal(const char *number, char **_end, int base, int group)
124 {
125 	// ToDo: group is currently not supported!
126 	(void)group;
127 
128 	return strtoull(number, _end, base);
129 }
130 
131