Chameleon

Chameleon Svn Source Tree

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

Archive Download this file

Revision: 2825