Chameleon

Chameleon Svn Source Tree

Root/branches/ErmaC/Trunk/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/*␊
78 * Convert a string to a long integer.␊
79 *␊
80 * Ignores `locale' stuff. Assumes that the upper and lower case␊
81 * alphabets and digits are each contiguous.␊
82 */␊
83long␊
84strtol(nptr, endptr, base)␊
85␉const char *nptr;␊
86␉char **endptr;␊
87␉register int base;␊
88{␊
89␉register const char *s = nptr;␊
90␉register unsigned long acc;␊
91␉register int c;␊
92␉register unsigned long cutoff;␊
93␉register int neg = 0, any, cutlim;␊
94␊
95␉/*␊
96␉ * Skip white space and pick up leading +/- sign if any.␊
97␉ * If base is 0, allow 0x for hex and 0 for octal, else␊
98␉ * assume decimal; if base is already 16, allow 0x.␊
99␉ */␊
100␉do␊
101␉{␊
102␉␉c = *s++;␊
103␉} while (isspace(c));␊
104␊
105␉if (c == '-')␊
106␉{␊
107␉␉neg = 1;␊
108␉␉c = *s++;␊
109␉}␊
110␉else if (c == '+')␊
111␉{␊
112␉␉c = *s++;␊
113␉}␊
114␊
115␉if ((base == 0 || base == 16) && c == '0' && (*s == 'x' || *s == 'X'))␊
116␉{␊
117␉␉c = s[1];␊
118␉␉s += 2;␊
119␉␉base = 16;␊
120␉}␊
121␉else if ((base == 0 || base == 2) && c == '0' && (*s == 'b' || *s == 'B'))␊
122␉{␊
123␉␉c = s[1];␊
124␉␉s += 2;␊
125␉␉base = 2;␊
126␉}␊
127␉if (base == 0)␊
128␉{␊
129␉␉base = c == '0' ? 8 : 10;␊
130␉}␊
131␊
132␉/*␊
133␉ * Compute the cutoff value between legal numbers and illegal␊
134␉ * numbers. That is the largest legal value, divided by the␊
135␉ * base. An input number that is greater than this value, if␊
136␉ * followed by a legal input character, is too big. One that␊
137␉ * is equal to this value may be valid or not; the limit␊
138␉ * between valid and invalid numbers is then based on the last␊
139␉ * digit. For instance, if the range for longs is␊
140␉ * [-2147483648..2147483647] and the input base is 10,␊
141␉ * cutoff will be set to 214748364 and cutlim to either␊
142␉ * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated␊
143␉ * a value > 214748364, or equal but the next digit is > 7 (or 8),␊
144␉ * the number is too big, and we will return a range error.␊
145␉ *␊
146␉ * Set any if any `digits' consumed; make it negative to indicate␊
147␉ * overflow.␊
148␉ */␊
149␉cutoff = neg ? -(unsigned long)LONG_MIN : LONG_MAX;␊
150␉cutlim = cutoff % (unsigned long)base;␊
151␉cutoff /= (unsigned long)base;␊
152␉for (acc = 0, any = 0;; c = *s++)␊
153␉{␊
154␉␉if (isdigit(c))␊
155␉␉␉c -= '0';␊
156␉␉else if (isalpha(c))␊
157␉␉␉c -= isupper(c) ? 'A' - 10 : 'a' - 10;␊
158␉␉else␊
159␉␉␉break;␊
160␉␉if (c >= base)␊
161␉␉␉break;␊
162␉␉if ((any < 0 || acc > cutoff) || (acc == cutoff && c > cutlim))␊
163␉␉␉any = -1;␊
164␉␉else {␊
165␉␉␉any = 1;␊
166␉␉␉acc *= base;␊
167␉␉␉acc += c;␊
168␉␉}␊
169␉}␊
170␉if (any < 0)␊
171␉{␊
172␉␉acc = neg ? LONG_MIN : LONG_MAX;␊
173//␉␉errno = ERANGE;␊
174␉}␊
175␉else if (neg)␊
176␉␉acc = -acc;␊
177␉if (endptr != 0)␊
178␉␉*endptr = (char *)(any ? s - 1 : nptr);␊
179␉return (acc);␊
180}␊
181␊
182␊
183/*␊
184 * Convert a string to an unsigned long integer.␊
185 *␊
186 * Ignores `locale' stuff. Assumes that the upper and lower case␊
187 * alphabets and digits are each contiguous.␊
188 */␊
189unsigned long␊
190strtoul(nptr, endptr, base)␊
191␉const char *nptr;␊
192␉char **endptr;␊
193␉register int base;␊
194{␊
195␉register const char *s = nptr;␊
196␉register unsigned long acc;␊
197␉register int c;␊
198␉register unsigned long cutoff;␊
199␉register int neg = 0, any, cutlim;␊
200␊
201␉/*␊
202␉ * See strtol for comments as to the logic used.␊
203␉ */␊
204␉do {␊
205␉␉c = *s++;␊
206␉} while (isspace(c));␊
207␉if (c == '-')␊
208␉{␊
209␉␉neg = 1;␊
210␉␉c = *s++;␊
211␉}␊
212␉else if (c == '+')␊
213␉{␊
214␉␉c = *s++;␊
215␉}␊
216␉if ((base == 0 || base == 16) && c == '0' && (*s == 'x' || *s == 'X'))␊
217␉{␊
218␉␉c = s[1];␊
219␉␉s += 2;␊
220␉␉base = 16;␊
221␉}␊
222␉else if ((base == 0 || base == 2) && c == '0' && (*s == 'b' || *s == 'B'))␊
223␉{␊
224␉␉c = s[1];␊
225␉␉s += 2;␊
226␉␉base = 2;␊
227␉}␊
228␉if (base == 0)␊
229␉{␊
230␉␉base = c == '0' ? 8 : 10;␊
231␉}␊
232␉cutoff = (unsigned long)ULONG_MAX / (unsigned long)base;␊
233␉cutlim = (unsigned long)ULONG_MAX % (unsigned long)base;␊
234␉for (acc = 0, any = 0;; c = *s++)␊
235␉{␊
236␉␉if (isdigit(c))␊
237␉␉{␊
238␉␉␉c -= '0';␊
239␉␉}␊
240␉␉else if (isalpha(c))␊
241␉␉{␊
242␉␉␉c -= isupper(c) ? 'A' - 10 : 'a' - 10;␊
243␉␉}␊
244␉␉else␊
245␉␉{␊
246␉␉␉break;␊
247␉␉}␊
248␉␉if (c >= base)␊
249␉␉{␊
250␉␉␉break;␊
251␉␉}␊
252␉␉if ((any < 0 || acc > cutoff) || (acc == cutoff && c > cutlim))␊
253␉␉{␊
254␉␉␉any = -1;␊
255␉␉}␊
256␉␉else␊
257␉␉{␊
258␉␉␉any = 1;␊
259␉␉␉acc *= base;␊
260␉␉␉acc += c;␊
261␉␉}␊
262␉}␊
263␉if (any < 0)␊
264␉{␊
265␉␉acc = ULONG_MAX;␊
266//␉␉errno = ERANGE;␊
267␉}␊
268␉else if (neg)␊
269␉{␊
270␉␉acc = -acc;␊
271␉}␊
272␉if (endptr != 0)␊
273␉{␊
274␉␉*endptr = (char *)(any ? s - 1 : nptr);␊
275␉}␊
276␉return (acc);␊
277}␊
278␊
279/*␊
280 * Convert a string to an unsigned quad integer.␊
281 *␊
282 * Ignores `locale' stuff. Assumes that the upper and lower case␊
283 * alphabets and digits are each contiguous.␊
284 */␊
285unsigned long long␊
286strtouq(nptr, endptr, base)␊
287␉const char *nptr;␊
288␉char **endptr;␊
289␉register int base;␊
290{␊
291␉register const char *s = nptr;␊
292␉register unsigned long long acc;␊
293␉register int c;␊
294␉register unsigned long long qbase, cutoff;␊
295␉register int neg, any, cutlim;␊
296␊
297␉/*␊
298␉ * See strtoq for comments as to the logic used.␊
299␉ */␊
300␉s = nptr;␊
301␉do␊
302␉{␊
303␉␉c = *s++;␊
304␉} while (isspace(c));␊
305␉if (c == '-')␊
306␉{␊
307␉␉neg = 1;␊
308␉␉c = *s++;␊
309␉}␊
310␉else␊
311␉{ ␊
312␉␉neg = 0;␊
313␉␉if (c == '+')␊
314␉␉{␊
315␉␉␉c = *s++;␊
316␉␉}␊
317␉}␊
318␉if ((base == 0 || base == 16) && c == '0' && (*s == 'x' || *s == 'X'))␊
319␉{␊
320␉␉c = s[1];␊
321␉␉s += 2;␊
322␉␉base = 16;␊
323␉}␊
324␉if (base == 0)␊
325␉{␊
326␉␉base = c == '0' ? 8 : 10;␊
327␉}␊
328␉qbase = (unsigned)base;␊
329␉cutoff = (unsigned long long)UQUAD_MAX / qbase;␊
330␉cutlim = (unsigned long long)UQUAD_MAX % qbase;␊
331␉for (acc = 0, any = 0;; c = *s++)␊
332␉{␊
333␉␉if (isdigit(c))␊
334␉␉{␊
335␉␉␉c -= '0';␊
336␉␉}␊
337␉␉else if (isalpha(c))␊
338␉␉{␊
339␉␉␉c -= isupper(c) ? 'A' - 10 : 'a' - 10;␊
340␉␉}␊
341␉␉else␊
342␉␉{␊
343␉␉␉break;␊
344␉␉}␊
345␉␉if (c >= base)␊
346␉␉{␊
347␉␉␉break;␊
348␉␉}␊
349␉␉if ((any < 0 || acc > cutoff) || (acc == cutoff && c > cutlim))␊
350␉␉{␊
351␉␉␉any = -1;␊
352␉␉}␊
353␉␉else␊
354␉␉{␊
355␉␉␉any = 1;␊
356␉␉␉acc *= qbase;␊
357␉␉␉acc += c;␊
358␉␉}␊
359␉}␊
360␉if (any < 0)␊
361␉{␊
362␉␉acc = UQUAD_MAX;␊
363//␉␉errno = ERANGE;␊
364␉}␊
365␉else if (neg)␊
366␉{␊
367␉␉acc = -acc;␊
368␉}␊
369␉if (endptr != 0)␊
370␉{␊
371␉␉*endptr = (char *)(any ? s - 1 : nptr);␊
372␉}␊
373␉return (acc);␊
374}␊
375

Archive Download this file

Revision: 2045