Details | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
6607 | serge | 1 | /* |
2 | FUNCTION |
||
3 | < |
||
4 | |||
5 | INDEX |
||
6 | wcstoul |
||
7 | INDEX |
||
8 | _wcstoul_r |
||
9 | |||
10 | ANSI_SYNOPSIS |
||
11 | #include |
||
12 | unsigned long wcstoul(const wchar_t *__restrict <[s]>, |
||
13 | wchar_t **__restrict <[ptr]>, int <[base]>); |
||
14 | |||
15 | unsigned long _wcstoul_r(void *<[reent]>, const wchar_t *<[s]>, |
||
16 | wchar_t **<[ptr]>, int <[base]>); |
||
17 | |||
18 | TRAD_SYNOPSIS |
||
19 | #include |
||
20 | unsigned long wcstoul(<[s]>, <[ptr]>, <[base]>) |
||
21 | wchar_t *__restrict <[s]>; |
||
22 | wchar_t **__restrict <[ptr]>; |
||
23 | int <[base]>; |
||
24 | |||
25 | unsigned long _wcstoul_r(<[reent]>, <[s]>, <[ptr]>, <[base]>) |
||
26 | wchar_t *<[reent]>; |
||
27 | wchar_t *<[s]>; |
||
28 | wchar_t **<[ptr]>; |
||
29 | int <[base]>; |
||
30 | |||
31 | DESCRIPTION |
||
32 | The function < |
||
33 | an < |
||
34 | leading whitespace, which is ignored; a subject string consisting |
||
35 | of the digits meaningful in the radix specified by <[base]> |
||
36 | (for example, <<0>> through <<7>> if the value of <[base]> is 8); |
||
37 | and a trailing portion consisting of one or more unparseable characters, |
||
38 | which always includes the terminating null character. Then, it attempts |
||
39 | to convert the subject string into an unsigned long integer, and returns the |
||
40 | result. |
||
41 | |||
42 | If the value of <[base]> is zero, the subject string is expected to look |
||
43 | like a normal C integer constant (save that no optional sign is permitted): |
||
44 | a possible <<0x>> indicating hexadecimal radix, and a number. |
||
45 | If <[base]> is between 2 and 36, the expected form of the subject is a |
||
46 | sequence of digits (which may include letters, depending on the |
||
47 | base) representing an integer in the radix specified by <[base]>. |
||
48 | The letters <>--< |
||
49 | 10 to 35. If <[base]> is 16, a leading <<0x>> is permitted. |
||
50 | |||
51 | The subject sequence is the longest initial sequence of the input |
||
52 | string that has the expected form, starting with the first |
||
53 | non-whitespace character. If the string is empty or consists entirely |
||
54 | of whitespace, or if the first non-whitespace character is not a |
||
55 | permissible digit, the subject string is empty. |
||
56 | |||
57 | If the subject string is acceptable, and the value of <[base]> is zero, |
||
58 | < |
||
59 | string with a leading <<0x>> is treated as a hexadecimal value; a string with |
||
60 | a leading <<0>> and no < |
||
61 | treated as decimal. If <[base]> is between 2 and 36, it is used as the |
||
62 | conversion radix, as described above. Finally, a pointer to the first |
||
63 | character past the converted subject string is stored in <[ptr]>, if |
||
64 | <[ptr]> is not < |
||
65 | |||
66 | If the subject string is empty (that is, if <<*>><[s]> does not start |
||
67 | with a substring in acceptable form), no conversion |
||
68 | is performed and the value of <[s]> is stored in <[ptr]> (if <[ptr]> is |
||
69 | not < |
||
70 | |||
71 | The alternate function <<_wcstoul_r>> is a reentrant version. The |
||
72 | extra argument <[reent]> is a pointer to a reentrancy structure. |
||
73 | |||
74 | |||
75 | RETURNS |
||
76 | < |
||
77 | made, <<0>> is returned. |
||
78 | |||
79 | < |
||
80 | value is too large, and sets < |
||
81 | |||
82 | PORTABILITY |
||
83 | < |
||
84 | |||
85 | < |
||
86 | */ |
||
87 | |||
88 | /* |
||
89 | * Copyright (c) 1990 Regents of the University of California. |
||
90 | * All rights reserved. |
||
91 | * |
||
92 | * Redistribution and use in source and binary forms, with or without |
||
93 | * modification, are permitted provided that the following conditions |
||
94 | * are met: |
||
95 | * 1. Redistributions of source code must retain the above copyright |
||
96 | * notice, this list of conditions and the following disclaimer. |
||
97 | * 2. Redistributions in binary form must reproduce the above copyright |
||
98 | * notice, this list of conditions and the following disclaimer in the |
||
99 | * documentation and/or other materials provided with the distribution. |
||
100 | * 3. All advertising materials mentioning features or use of this software |
||
101 | * must display the following acknowledgement: |
||
102 | * This product includes software developed by the University of |
||
103 | * California, Berkeley and its contributors. |
||
104 | * 4. Neither the name of the University nor the names of its contributors |
||
105 | * may be used to endorse or promote products derived from this software |
||
106 | * without specific prior written permission. |
||
107 | * |
||
108 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
||
109 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
||
110 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
||
111 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
||
112 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
||
113 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
||
114 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
||
115 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
||
116 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
||
117 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
||
118 | * SUCH DAMAGE. |
||
119 | */ |
||
120 | |||
121 | #include <_ansi.h> |
||
122 | #include |
||
123 | #include |
||
124 | #include |
||
125 | #include |
||
126 | #include |
||
127 | #include |
||
128 | |||
129 | /* |
||
130 | * Convert a wide string to an unsigned long integer. |
||
131 | * |
||
132 | * Ignores `locale' stuff. Assumes that the upper and lower case |
||
133 | * alphabets and digits are each contiguous. |
||
134 | */ |
||
135 | unsigned long |
||
136 | _DEFUN (_wcstoul_r, (rptr, nptr, endptr, base), |
||
137 | struct _reent *rptr _AND |
||
138 | _CONST wchar_t *nptr _AND |
||
139 | wchar_t **endptr _AND |
||
140 | int base) |
||
141 | { |
||
142 | register const wchar_t *s = nptr; |
||
143 | register unsigned long acc; |
||
144 | register int c; |
||
145 | register unsigned long cutoff; |
||
146 | register int neg = 0, any, cutlim; |
||
147 | |||
148 | /* |
||
149 | * See strtol for comments as to the logic used. |
||
150 | */ |
||
151 | do { |
||
152 | c = *s++; |
||
153 | } while (iswspace(c)); |
||
154 | if (c == L'-') { |
||
155 | neg = 1; |
||
156 | c = *s++; |
||
157 | } else if (c == L'+') |
||
158 | c = *s++; |
||
159 | if ((base == 0 || base == 16) && |
||
160 | c == L'0' && (*s == L'x' || *s == L'X')) { |
||
161 | c = s[1]; |
||
162 | s += 2; |
||
163 | base = 16; |
||
164 | } |
||
165 | if (base == 0) |
||
166 | base = c == L'0' ? 8 : 10; |
||
167 | cutoff = (unsigned long)ULONG_MAX / (unsigned long)base; |
||
168 | cutlim = (unsigned long)ULONG_MAX % (unsigned long)base; |
||
169 | for (acc = 0, any = 0;; c = *s++) { |
||
170 | if (iswdigit(c)) |
||
171 | c -= L'0'; |
||
172 | else if (iswalpha(c)) |
||
173 | c -= iswupper(c) ? L'A' - 10 : L'a' - 10; |
||
174 | else |
||
175 | break; |
||
176 | if (c >= base) |
||
177 | break; |
||
178 | if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim)) |
||
179 | any = -1; |
||
180 | else { |
||
181 | any = 1; |
||
182 | acc *= base; |
||
183 | acc += c; |
||
184 | } |
||
185 | } |
||
186 | if (any < 0) { |
||
187 | acc = ULONG_MAX; |
||
188 | rptr->_errno = ERANGE; |
||
189 | } else if (neg) |
||
190 | acc = -acc; |
||
191 | if (endptr != 0) |
||
192 | *endptr = (wchar_t *) (any ? s - 1 : nptr); |
||
193 | return (acc); |
||
194 | } |
||
195 | |||
196 | #ifndef _REENT_ONLY |
||
197 | |||
198 | unsigned long |
||
199 | _DEFUN (wcstoul, (s, ptr, base), |
||
200 | _CONST wchar_t *__restrict s _AND |
||
201 | wchar_t **__restrict ptr _AND |
||
202 | int base) |
||
203 | { |
||
204 | return _wcstoul_r (_REENT, s, ptr, base); |
||
205 | } |
||
206 | |||
207 | #endif>> |