1 | /* |
---|
2 | * Copyright (c) 1990, 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 | * Modified (removed locale) for use in Micromonitor |
---|
35 | */ |
---|
36 | |
---|
37 | #if defined(LIBC_SCCS) && !defined(lint) |
---|
38 | static char sccsid[] = "@(#)strtoul.c 8.1 (Berkeley) 6/4/93"; |
---|
39 | #endif /* LIBC_SCCS and not lint */ |
---|
40 | #include <sys/cdefs.h> |
---|
41 | __FBSDID("$FreeBSD$"); |
---|
42 | |
---|
43 | #include <limits.h> |
---|
44 | #include <ctype.h> |
---|
45 | #include <errno.h> |
---|
46 | #include <stdlib.h> |
---|
47 | |
---|
48 | #define HAVE_ERRNO 0 |
---|
49 | |
---|
50 | /* |
---|
51 | * Convert a string to an unsigned long integer. |
---|
52 | * |
---|
53 | * Assumes that the upper and lower case |
---|
54 | * alphabets and digits are each contiguous. |
---|
55 | */ |
---|
56 | unsigned long |
---|
57 | strtoul(const char *__restrict nptr, char **__restrict endptr, int base) |
---|
58 | { |
---|
59 | const char *s; |
---|
60 | unsigned long acc; |
---|
61 | char c; |
---|
62 | unsigned long cutoff; |
---|
63 | int neg, any, cutlim; |
---|
64 | |
---|
65 | /* |
---|
66 | * See strtol for comments as to the logic used. |
---|
67 | */ |
---|
68 | s = nptr; |
---|
69 | do { |
---|
70 | c = *s++; |
---|
71 | } while(isspace((unsigned char)c)); |
---|
72 | if(c == '-') { |
---|
73 | neg = 1; |
---|
74 | c = *s++; |
---|
75 | } else { |
---|
76 | neg = 0; |
---|
77 | if(c == '+') { |
---|
78 | c = *s++; |
---|
79 | } |
---|
80 | } |
---|
81 | if((base == 0 || base == 16) && |
---|
82 | c == '0' && (*s == 'x' || *s == 'X') && |
---|
83 | ((s[1] >= '0' && s[1] <= '9') || |
---|
84 | (s[1] >= 'A' && s[1] <= 'F') || |
---|
85 | (s[1] >= 'a' && s[1] <= 'f'))) { |
---|
86 | c = s[1]; |
---|
87 | s += 2; |
---|
88 | base = 16; |
---|
89 | } |
---|
90 | if(base == 0) { |
---|
91 | base = c == '0' ? 8 : 10; |
---|
92 | } |
---|
93 | acc = any = 0; |
---|
94 | if(base < 2 || base > 36) { |
---|
95 | goto noconv; |
---|
96 | } |
---|
97 | |
---|
98 | cutoff = ULONG_MAX / base; |
---|
99 | cutlim = ULONG_MAX % base; |
---|
100 | for(; ; c = *s++) { |
---|
101 | if(c >= '0' && c <= '9') { |
---|
102 | c -= '0'; |
---|
103 | } else if(c >= 'A' && c <= 'Z') { |
---|
104 | c -= 'A' - 10; |
---|
105 | } else if(c >= 'a' && c <= 'z') { |
---|
106 | c -= 'a' - 10; |
---|
107 | } else { |
---|
108 | break; |
---|
109 | } |
---|
110 | if(c >= base) { |
---|
111 | break; |
---|
112 | } |
---|
113 | if(any < 0 || acc > cutoff || (acc == cutoff && c > cutlim)) { |
---|
114 | any = -1; |
---|
115 | } else { |
---|
116 | any = 1; |
---|
117 | acc *= base; |
---|
118 | acc += c; |
---|
119 | } |
---|
120 | } |
---|
121 | if(any < 0) { |
---|
122 | acc = ULONG_MAX; |
---|
123 | #if HAVE_ERRNO |
---|
124 | errno = ERANGE; |
---|
125 | #endif |
---|
126 | } else if(!any) { |
---|
127 | #if HAVE_ERRNO |
---|
128 | noconv: |
---|
129 | errno = EINVAL; |
---|
130 | #endif |
---|
131 | } else if(neg) { |
---|
132 | acc = -acc; |
---|
133 | } |
---|
134 | #if !HAVE_ERRNO |
---|
135 | noconv: |
---|
136 | #endif |
---|
137 | if(endptr != NULL) { |
---|
138 | *endptr = (char *)(any ? s - 1 : nptr); |
---|
139 | } |
---|
140 | return (acc); |
---|
141 | } |
---|