Chameleon

Chameleon Svn Source Tree

Root/branches/cparm/i386/libsa/strtol.c

1/*␊
2 * Copyright (c) 1999-2003 Apple Computer, Inc. All rights reserved.␊
3 *␊
4 * @APPLE_LICENSE_HEADER_START@␊
5 * ␊
6 * Portions Copyright (c) 1999-2003 Apple Computer, Inc. All Rights␊
7 * Reserved. This file contains Original Code and/or Modifications of␊
8 * Original Code as defined in and that are subject to the Apple Public␊
9 * Source License Version 2.0 (the "License"). You may not use this file␊
10 * except in compliance with the License. Please obtain a copy of the␊
11 * License at http://www.apple.com/publicsource and read it before using␊
12 * this file.␊
13 * ␊
14 * The Original Code and all software distributed under the License are␊
15 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER␊
16 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,␊
17 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,␊
18 * FITNESS FOR A PARTICULAR PURPOSE OR NON- INFRINGEMENT. Please see the␊
19 * License for the specific language governing rights and limitations␊
20 * under the License.␊
21 * ␊
22 * @APPLE_LICENSE_HEADER_END@␊
23 */␊
24/*-␊
25 * Copyright (c) 1990, 1993␊
26 *␉The Regents of the University of California. All rights reserved.␊
27 *␊
28 * Redistribution and use in source and binary forms, with or without␊
29 * modification, are permitted provided that the following conditions␊
30 * are met:␊
31 * 1. Redistributions of source code must retain the above copyright␊
32 * notice, this list of conditions and the following disclaimer.␊
33 * 2. Redistributions in binary form must reproduce the above copyright␊
34 * notice, this list of conditions and the following disclaimer in the␊
35 * documentation and/or other materials provided with the distribution.␊
36 * 3. All advertising materials mentioning features or use of this software␊
37 * must display the following acknowledgement:␊
38 *␉This product includes software developed by the University of␊
39 *␉California, Berkeley and its contributors.␊
40 * 4. Neither the name of the University nor the names of its contributors␊
41 * may be used to endorse or promote products derived from this software␊
42 * without specific prior written permission.␊
43 *␊
44 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND␊
45 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE␊
46 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE␊
47 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE␊
48 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL␊
49 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS␊
50 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)␊
51 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT␊
52 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY␊
53 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF␊
54 * SUCH DAMAGE.␊
55 */␊
56␊
57/* Copyright (c) 1995 NeXT Computer, Inc. All rights reserved.␊
58 *␊
59 * HISTORY␊
60 * ␉Modified by Curtis Galloway at NeXT June 1993,␊
61 * ␉for use in the standalone library.␊
62 *␊
63 * 30-Nov-1995 Dean Reece at NeXT␊
64 * Created based on BSD4.4's strtol.c & strtoul.c.␊
65 * Removed dependency on _ctype_ by static versions of isupper()...␊
66 * Added support for "0b101..." binary constants.␊
67 * Commented out references to errno.␊
68 */␊
69␊
70#if defined(LIBC_SCCS) && !defined(lint)␊
71static char sccsid[] = "@(#)strtol.c␉5.4 (Berkeley) 2/23/91";␊
72#endif /* LIBC_SCCS and not lint */␊
73␊
74#include "libsa.h"␊
75#include <limits.h>␊
76␊
77#ifndef UQUAD_MAX␊
78#define UQUAD_MAX 0xffffffffffffffffUL ␊
79#endif␊
80␊
81/*␊
82 * Convert a string to a long integer.␊
83 *␊
84 * Ignores `locale' stuff. Assumes that the upper and lower case␊
85 * alphabets and digits are each contiguous.␊
86 */␊
87long␊
88strtol(const char *nptr, char **endptr, int base)␊
89{␊
90␉register const char *s = nptr;␊
91␉register unsigned long acc;␊
92␉register int c;␊
93␉register unsigned long cutoff;␊
94␉register int neg = 0, any, cutlim;␊
95␉␊
96␉/*␊
97␉ * Skip white space and pick up leading +/- sign if any.␊
98␉ * If base is 0, allow 0x for hex and 0 for octal, else␊
99␉ * assume decimal; if base is already 16, allow 0x.␊
100␉ */␊
101␉do {␊
102␉␉c = *s++;␊
103␉} while (isspace(c));␊
104␉if (c == '-') {␊
105␉␉neg = 1;␊
106␉␉c = *s++;␊
107␉} else if (c == '+')␊
108␉␉c = *s++;␊
109␉if ((base == 0 || base == 16) &&␊
110␉ c == '0' && (*s == 'x' || *s == 'X')) {␊
111␉␉c = s[1];␊
112␉␉s += 2;␊
113␉␉base = 16;␊
114␉} else if ((base == 0 || base == 2) &&␊
115␉␉␉ c == '0' && (*s == 'b' || *s == 'B')) {␊
116␉␉c = s[1];␊
117␉␉s += 2;␊
118␉␉base = 2;␊
119␉}␊
120␉if (base == 0)␊
121␉␉base = c == '0' ? 8 : 10;␊
122␉␊
123␉/*␊
124␉ * Compute the cutoff value between legal numbers and illegal␊
125␉ * numbers. That is the largest legal value, divided by the␊
126␉ * base. An input number that is greater than this value, if␊
127␉ * followed by a legal input character, is too big. One that␊
128␉ * is equal to this value may be valid or not; the limit␊
129␉ * between valid and invalid numbers is then based on the last␊
130␉ * digit. For instance, if the range for longs is␊
131␉ * [-2147483648..2147483647] and the input base is 10,␊
132␉ * cutoff will be set to 214748364 and cutlim to either␊
133␉ * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated␊
134␉ * a value > 214748364, or equal but the next digit is > 7 (or 8),␊
135␉ * the number is too big, and we will return a range error.␊
136␉ *␊
137␉ * Set any if any `digits' consumed; make it negative to indicate␊
138␉ * overflow.␊
139␉ */␊
140␉cutoff = neg ? -(unsigned long)LONG_MIN : LONG_MAX;␊
141␉cutlim = cutoff % (unsigned long)base;␊
142␉cutoff /= (unsigned long)base;␊
143␉for (acc = 0, any = 0;; c = *s++) {␊
144␉␉if (isdigit(c))␊
145␉␉␉c -= '0';␊
146␉␉else if (isalpha(c))␊
147␉␉␉c -= isupper(c) ? 'A' - 10 : 'a' - 10;␊
148␉␉else␊
149␉␉␉break;␊
150␉␉if (c >= base)␊
151␉␉␉break;␊
152␉␉if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim) )␊
153␉␉␉any = -1;␊
154␉␉else {␊
155␉␉␉any = 1;␊
156␉␉␉acc *= base;␊
157␉␉␉acc += c;␊
158␉␉}␊
159␉}␊
160␉if (any < 0) {␊
161␉␉acc = neg ? LONG_MIN : LONG_MAX;␊
162␉␉//␉␉errno = ERANGE;␊
163␉} else if (neg)␊
164␉␉acc = -acc;␊
165␉if (endptr != 0)␊
166␉{␊
167␉␉if(any)␊
168␉␉{␊
169␉␉␉*endptr = __CAST_AWAY_QUALIFIER(s - 1, const, char *);␊
170␉␉}␊
171␉␉else␊
172␉␉{␊
173␉␉␉*endptr = __CAST_AWAY_QUALIFIER(nptr, const, char *);␊
174␉␉}␊
175␉}␊
176␉return (acc);␊
177}␊
178␊
179␊
180/*␊
181 * Convert a string to an unsigned long integer.␊
182 *␊
183 * Ignores `locale' stuff. Assumes that the upper and lower case␊
184 * alphabets and digits are each contiguous.␊
185 */␊
186unsigned long␊
187strtoul(const char *nptr, char **endptr, int base)␊
188{␊
189␉register const char *s = nptr;␊
190␉register unsigned long acc;␊
191␉register int c;␊
192␉register unsigned long cutoff;␊
193␉register int neg = 0, any, cutlim;␊
194␉␊
195␉/*␊
196␉ * See strtol for comments as to the logic used.␊
197␉ */␊
198␉do {␊
199␉␉c = *s++;␊
200␉} while (isspace(c));␊
201␉if (c == '-') {␊
202␉␉neg = 1;␊
203␉␉c = *s++;␊
204␉} else if (c == '+')␊
205␉␉c = *s++;␊
206␉if ((base == 0 || base == 16) &&␊
207␉ c == '0' && (*s == 'x' || *s == 'X')) {␊
208␉␉c = s[1];␊
209␉␉s += 2;␊
210␉␉base = 16;␊
211␉} else if ((base == 0 || base == 2) &&␊
212␉␉␉ c == '0' && (*s == 'b' || *s == 'B')) {␊
213␉␉c = s[1];␊
214␉␉s += 2;␊
215␉␉base = 2;␊
216␉}␊
217␉if (base == 0)␊
218␉␉base = c == '0' ? 8 : 10;␊
219␉cutoff = (unsigned long)ULONG_MAX / (unsigned long)base;␊
220␉cutlim = (unsigned long)ULONG_MAX % (unsigned long)base;␊
221␉for (acc = 0, any = 0;; c = *s++) {␊
222␉␉if (isdigit(c))␊
223␉␉␉c -= '0';␊
224␉␉else if (isalpha(c))␊
225␉␉␉c -= isupper(c) ? 'A' - 10 : 'a' - 10;␊
226␉␉else␊
227␉␉␉break;␊
228␉␉if (c >= base)␊
229␉␉␉break;␊
230␉␉if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim) )␊
231␉␉␉any = -1;␊
232␉␉else {␊
233␉␉␉any = 1;␊
234␉␉␉acc *= base;␊
235␉␉␉acc += c;␊
236␉␉}␊
237␉}␊
238␉if (any < 0) {␊
239␉␉acc = ULONG_MAX;␊
240␉␉//␉␉errno = ERANGE;␊
241␉} else if (neg)␊
242␉␉acc = -acc;␊
243␉if (endptr != 0)␊
244␉{␊
245␉␉if(any)␊
246␉␉{␊
247␉␉␉*endptr = __CAST_AWAY_QUALIFIER(s - 1, const, char *);␊
248␉␉}␊
249␉␉else␊
250␉␉{␊
251␉␉␉*endptr = __CAST_AWAY_QUALIFIER(nptr, const, char *);␊
252␉␉}␊
253␉}␊
254␉␊
255␉return (acc);␊
256}␊
257#if UNUSED␊
258/*␊
259 * Convert a string to an unsigned quad integer.␊
260 *␊
261 * Ignores `locale' stuff. Assumes that the upper and lower case␊
262 * alphabets and digits are each contiguous.␊
263 */␊
264unsigned long long␊
265strtouq(const char *nptr,␊
266␉␉char **endptr,␊
267␉␉register int base)␊
268{␊
269␉register const char *s = nptr;␊
270␉register unsigned long long acc;␊
271␉register int c;␊
272␉register unsigned long long qbase, cutoff;␊
273␉register int neg, any, cutlim;␊
274␉␊
275␉/*␊
276␉ * See strtoq for comments as to the logic used.␊
277␉ */␊
278␉s = nptr;␊
279␉do {␊
280␉␉c = *s++;␊
281␉} while (isspace(c));␊
282␉if (c == '-') {␊
283␉␉neg = 1;␊
284␉␉c = *s++;␊
285␉} else { ␊
286␉␉neg = 0;␊
287␉␉if (c == '+')␊
288␉␉␉c = *s++;␊
289␉}␊
290␉if ((base == 0 || base == 16) &&␊
291␉ c == '0' && (*s == 'x' || *s == 'X')) {␊
292␉␉c = s[1];␊
293␉␉s += 2;␊
294␉␉base = 16;␊
295␉}␊
296␉if (base == 0)␊
297␉␉base = c == '0' ? 8 : 10;␊
298␉qbase = (unsigned)base;␊
299␉cutoff = (unsigned long long)UQUAD_MAX / qbase;␊
300␉cutlim = (unsigned long long)UQUAD_MAX % qbase;␊
301␉for (acc = 0, any = 0;; c = *s++) {␊
302␉␉if (isdigit(c))␊
303␉␉␉c -= '0';␊
304␉␉else if (isalpha(c))␊
305␉␉␉c -= isupper(c) ? 'A' - 10 : 'a' - 10;␊
306␉␉else␊
307␉␉␉break;␊
308␉␉if (c >= base)␊
309␉␉␉break;␊
310␉␉if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))␊
311␉␉␉any = -1;␊
312␉␉else {␊
313␉␉␉any = 1;␊
314␉␉␉acc *= qbase;␊
315␉␉␉acc += c;␊
316␉␉}␊
317␉}␊
318␉if (any < 0) {␊
319␉␉acc = UQUAD_MAX;␊
320␉␉//␉␉errno = ERANGE;␊
321␉} else if (neg)␊
322␉␉acc = -acc;␊
323␉if (endptr != 0)␊
324␉{␊
325␉␉if(any)␊
326␉␉{␊
327␉␉␉*endptr = __CAST_AWAY_QUALIFIER(s - 1, const, char *);␊
328␉␉}␊
329␉␉else␊
330␉␉{␊
331␉␉␉*endptr = __CAST_AWAY_QUALIFIER(nptr, const, char *);␊
332␉␉}␊
333␉}␊
334␉␊
335␉return (acc);␊
336}␊
337#endif␊
338

Archive Download this file

Revision: 2006