]>
Commit | Line | Data |
---|---|---|
5b2abdfb | 1 | /*- |
e9ce8d39 A |
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. | |
e9ce8d39 A |
13 | * 4. Neither the name of the University nor the names of its contributors |
14 | * may be used to endorse or promote products derived from this software | |
15 | * without specific prior written permission. | |
16 | * | |
17 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
18 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
19 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
20 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
21 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
22 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
23 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
24 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
25 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
26 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
27 | * SUCH DAMAGE. | |
28 | */ | |
29 | ||
9385eb3d A |
30 | #include <sys/cdefs.h> |
31 | #if 0 | |
5b2abdfb | 32 | #if defined(LIBC_SCCS) && !defined(lint) |
9385eb3d | 33 | static char sccsid[] = "from @(#)strtol.c 8.1 (Berkeley) 6/4/93"; |
5b2abdfb | 34 | #endif /* LIBC_SCCS and not lint */ |
9385eb3d | 35 | __FBSDID("FreeBSD: src/lib/libc/stdlib/strtoimax.c,v 1.8 2002/09/06 11:23:59 tjr Exp "); |
5b2abdfb | 36 | #endif |
1f2f436a | 37 | __FBSDID("$FreeBSD: src/lib/libc/locale/wcstoimax.c,v 1.3 2007/01/09 00:28:01 imp Exp $"); |
e9ce8d39 | 38 | |
e9ce8d39 | 39 | #include <errno.h> |
9385eb3d | 40 | #include <inttypes.h> |
e9ce8d39 | 41 | #include <stdlib.h> |
9385eb3d A |
42 | #include <wchar.h> |
43 | #include <wctype.h> | |
e9ce8d39 A |
44 | |
45 | /* | |
9385eb3d | 46 | * Convert a wide character string to an intmax_t integer. |
e9ce8d39 | 47 | */ |
9385eb3d A |
48 | intmax_t |
49 | wcstoimax(const wchar_t * __restrict nptr, wchar_t ** __restrict endptr, | |
50 | int base) | |
e9ce8d39 | 51 | { |
9385eb3d A |
52 | const wchar_t *s; |
53 | uintmax_t acc; | |
54 | wchar_t c; | |
55 | uintmax_t cutoff; | |
56 | int neg, any, cutlim; | |
e9ce8d39 A |
57 | |
58 | /* | |
9385eb3d | 59 | * See strtoimax for comments as to the logic used. |
e9ce8d39 A |
60 | */ |
61 | s = nptr; | |
62 | do { | |
63 | c = *s++; | |
9385eb3d A |
64 | } while (iswspace(c)); |
65 | if (c == L'-') { | |
e9ce8d39 A |
66 | neg = 1; |
67 | c = *s++; | |
5b2abdfb | 68 | } else { |
e9ce8d39 | 69 | neg = 0; |
9385eb3d | 70 | if (c == L'+') |
e9ce8d39 A |
71 | c = *s++; |
72 | } | |
73 | if ((base == 0 || base == 16) && | |
9385eb3d | 74 | c == L'0' && (*s == L'x' || *s == L'X')) { |
e9ce8d39 A |
75 | c = s[1]; |
76 | s += 2; | |
77 | base = 16; | |
78 | } | |
79 | if (base == 0) | |
9385eb3d A |
80 | base = c == L'0' ? 8 : 10; |
81 | acc = any = 0; | |
82 | if (base < 2 || base > 36) | |
83 | goto noconv; | |
84 | ||
85 | cutoff = neg ? (uintmax_t)-(INTMAX_MIN + INTMAX_MAX) + INTMAX_MAX | |
86 | : INTMAX_MAX; | |
87 | cutlim = cutoff % base; | |
88 | cutoff /= base; | |
89 | for ( ; ; c = *s++) { | |
90 | #ifdef notyet | |
91 | if (iswdigit(c)) | |
92 | c = digittoint(c); | |
93 | else | |
94 | #endif | |
95 | if (c >= L'0' && c <= L'9') | |
96 | c -= L'0'; | |
97 | else if (c >= L'A' && c <= L'Z') | |
98 | c -= L'A' - 10; | |
99 | else if (c >= 'a' && c <= 'z') | |
100 | c -= L'a' - 10; | |
e9ce8d39 A |
101 | else |
102 | break; | |
103 | if (c >= base) | |
104 | break; | |
5b2abdfb | 105 | if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim)) |
e9ce8d39 A |
106 | any = -1; |
107 | else { | |
108 | any = 1; | |
9385eb3d | 109 | acc *= base; |
e9ce8d39 A |
110 | acc += c; |
111 | } | |
112 | } | |
113 | if (any < 0) { | |
9385eb3d | 114 | acc = neg ? INTMAX_MIN : INTMAX_MAX; |
e9ce8d39 | 115 | errno = ERANGE; |
9385eb3d A |
116 | } else if (!any) { |
117 | noconv: | |
118 | errno = EINVAL; | |
e9ce8d39 A |
119 | } else if (neg) |
120 | acc = -acc; | |
9385eb3d A |
121 | if (endptr != NULL) |
122 | *endptr = (wchar_t *)(any ? s - 1 : nptr); | |
e9ce8d39 A |
123 | return (acc); |
124 | } |