]>
Commit | Line | Data |
---|---|---|
9385eb3d | 1 | /*- |
224c7076 | 2 | * Copyright (c) 1992, 1993 |
e9ce8d39 A |
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 | ||
5b2abdfb | 34 | #if defined(LIBC_SCCS) && !defined(lint) |
224c7076 | 35 | static char sccsid[] = "@(#)strtouq.c 8.1 (Berkeley) 6/4/93"; |
5b2abdfb | 36 | #endif /* LIBC_SCCS and not lint */ |
9385eb3d | 37 | #include <sys/cdefs.h> |
224c7076 | 38 | __FBSDID("$FreeBSD: src/lib/libc/stdlib/strtoull.c,v 1.18 2002/09/06 11:23:59 tjr Exp $"); |
e9ce8d39 | 39 | |
224c7076 A |
40 | #include "xlocale_private.h" |
41 | ||
42 | #include <limits.h> | |
43 | #include <errno.h> | |
44 | #include <ctype.h> | |
45 | #include <stdlib.h> | |
e9ce8d39 A |
46 | |
47 | /* | |
224c7076 A |
48 | * Convert a string to an unsigned long long integer. |
49 | * | |
50 | * Assumes that the upper and lower case | |
51 | * alphabets and digits are each contiguous. | |
e9ce8d39 | 52 | */ |
224c7076 A |
53 | unsigned long long |
54 | strtoull_l(const char * __restrict nptr, char ** __restrict endptr, int base, | |
55 | locale_t loc) | |
e9ce8d39 | 56 | { |
224c7076 A |
57 | const char *s; |
58 | unsigned long long acc; | |
59 | char c; | |
60 | unsigned long long cutoff; | |
61 | int neg, any, cutlim; | |
62 | ||
63 | NORMALIZE_LOCALE(loc); | |
64 | /* | |
65 | * See strtoq for comments as to the logic used. | |
66 | */ | |
67 | s = nptr; | |
68 | do { | |
69 | c = *s++; | |
70 | } while (isspace_l((unsigned char)c, loc)); | |
71 | if (c == '-') { | |
72 | neg = 1; | |
73 | c = *s++; | |
74 | } else { | |
75 | neg = 0; | |
76 | if (c == '+') | |
77 | c = *s++; | |
78 | } | |
79 | if ((base == 0 || base == 16) && | |
80 | c == '0' && (*s == 'x' || *s == 'X')) { | |
81 | c = s[1]; | |
82 | s += 2; | |
83 | base = 16; | |
84 | } | |
85 | if (base == 0) | |
86 | base = c == '0' ? 8 : 10; | |
87 | acc = any = 0; | |
88 | if (base < 2 || base > 36) | |
89 | goto noconv; | |
e9ce8d39 | 90 | |
224c7076 A |
91 | cutoff = ULLONG_MAX / base; |
92 | cutlim = ULLONG_MAX % base; | |
93 | for ( ; ; c = *s++) { | |
94 | if (c >= '0' && c <= '9') | |
95 | c -= '0'; | |
96 | else if (c >= 'A' && c <= 'Z') | |
97 | c -= 'A' - 10; | |
98 | else if (c >= 'a' && c <= 'z') | |
99 | c -= 'a' - 10; | |
100 | else | |
101 | break; | |
102 | if (c >= base) | |
103 | break; | |
104 | if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim)) | |
105 | any = -1; | |
106 | else { | |
107 | any = 1; | |
108 | acc *= base; | |
109 | acc += c; | |
110 | } | |
111 | } | |
112 | if (any < 0) { | |
113 | acc = ULLONG_MAX; | |
114 | errno = ERANGE; | |
115 | } else if (!any) { | |
116 | noconv: | |
117 | errno = EINVAL; | |
118 | } else if (neg) | |
119 | acc = -acc; | |
120 | if (endptr != NULL) | |
121 | *endptr = (char *)(any ? s - 1 : nptr); | |
122 | return (acc); | |
123 | } | |
124 | ||
125 | unsigned long long | |
126 | strtoull(const char * __restrict nptr, char ** __restrict endptr, int base) | |
127 | { | |
128 | return strtoull_l(nptr, endptr, base, __current_locale()); | |
e9ce8d39 | 129 | } |