00001 /* 00002 * Copyright (C) 2004 by egnite Software GmbH. All rights reserved. 00003 * 00004 * Redistribution and use in source and binary forms, with or without 00005 * modification, are permitted provided that the following conditions 00006 * are met: 00007 * 00008 * 1. Redistributions of source code must retain the above copyright 00009 * notice, this list of conditions and the following disclaimer. 00010 * 2. Redistributions in binary form must reproduce the above copyright 00011 * notice, this list of conditions and the following disclaimer in the 00012 * documentation and/or other materials provided with the distribution. 00013 * 3. Neither the name of the copyright holders nor the names of 00014 * contributors may be used to endorse or promote products derived 00015 * from this software without specific prior written permission. 00016 * 00017 * THIS SOFTWARE IS PROVIDED BY EGNITE SOFTWARE GMBH AND CONTRIBUTORS 00018 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 00019 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 00020 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL EGNITE 00021 * SOFTWARE GMBH OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 00022 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 00023 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS 00024 * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED 00025 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 00026 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF 00027 * THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00028 * SUCH DAMAGE. 00029 * 00030 * For additional information see http://www.ethernut.de/ 00031 * 00032 *- 00033 * Copyright (c) 1990 The Regents of the University of California. 00034 * All rights reserved. 00035 * 00036 * Redistribution and use in source and binary forms, with or without 00037 * modification, are permitted provided that the following conditions 00038 * are met: 00039 * 1. Redistributions of source code must retain the above copyright 00040 * notice, this list of conditions and the following disclaimer. 00041 * 2. Redistributions in binary form must reproduce the above copyright 00042 * notice, this list of conditions and the following disclaimer in the 00043 * documentation and/or other materials provided with the distribution. 00044 * 3. Neither the name of the University nor the names of its contributors 00045 * may be used to endorse or promote products derived from this software 00046 * without specific prior written permission. 00047 * 00048 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 00049 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00050 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00051 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 00052 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00053 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 00054 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00055 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00056 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 00057 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00058 * SUCH DAMAGE. 00059 */ 00060 00061 /* 00062 * $Log: strtol.c,v $ 00063 * Revision 1.4 2008/02/15 17:13:01 haraldkipp 00064 * Use configurable constant attribute. 00065 * 00066 * Revision 1.3 2006/10/08 16:48:08 haraldkipp 00067 * Documentation fixed 00068 * 00069 * Revision 1.2 2005/08/02 17:46:47 haraldkipp 00070 * Major API documentation update. 00071 * 00072 * Revision 1.1 2004/09/08 10:23:35 haraldkipp 00073 * Generic C stdlib added 00074 * 00075 */ 00076 00077 #include <ctype.h> 00078 #include <errno.h> 00079 #include <limits.h> 00080 #include <stdlib.h> 00081 00086 00098 long strtol(CONST char *nptr, char **endptr, int base) 00099 { 00100 register CONST char *s; 00101 register long acc, cutoff; 00102 register int c; 00103 register int neg, any, cutlim; 00104 00105 /* 00106 * Skip white space and pick up leading +/- sign if any. 00107 * If base is 0, allow 0x for hex and 0 for octal, else 00108 * assume decimal; if base is already 16, allow 0x. 00109 */ 00110 s = nptr; 00111 do { 00112 c = (unsigned char) *s++; 00113 } while (isspace(c)); 00114 if (c == '-') { 00115 neg = 1; 00116 c = *s++; 00117 } else { 00118 neg = 0; 00119 if (c == '+') 00120 c = *s++; 00121 } 00122 if ((base == 0 || base == 16) && c == '0' && (*s == 'x' || *s == 'X')) { 00123 c = s[1]; 00124 s += 2; 00125 base = 16; 00126 } 00127 if (base == 0) 00128 base = c == '0' ? 8 : 10; 00129 00130 /* 00131 * Compute the cutoff value between legal numbers and illegal 00132 * numbers. That is the largest legal value, divided by the 00133 * base. An input number that is greater than this value, if 00134 * followed by a legal input character, is too big. One that 00135 * is equal to this value may be valid or not; the limit 00136 * between valid and invalid numbers is then based on the last 00137 * digit. For instance, if the range for longs is 00138 * [-2147483648..2147483647] and the input base is 10, 00139 * cutoff will be set to 214748364 and cutlim to either 00140 * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated 00141 * a value > 214748364, or equal but the next digit is > 7 (or 8), 00142 * the number is too big, and we will return a range error. 00143 * 00144 * Set any if any `digits' consumed; make it negative to indicate 00145 * overflow. 00146 */ 00147 cutoff = neg ? LONG_MIN : LONG_MAX; 00148 cutlim = cutoff % base; 00149 cutoff /= base; 00150 if (neg) { 00151 if (cutlim > 0) { 00152 cutlim -= base; 00153 cutoff += 1; 00154 } 00155 cutlim = -cutlim; 00156 } 00157 for (acc = 0, any = 0;; c = (unsigned char) *s++) { 00158 if (isdigit(c)) 00159 c -= '0'; 00160 else if (isalpha(c)) 00161 c -= isupper(c) ? 'A' - 10 : 'a' - 10; 00162 else 00163 break; 00164 if (c >= base) 00165 break; 00166 if (any < 0) 00167 continue; 00168 if (neg) { 00169 if ((acc < cutoff || acc == cutoff) && c > cutlim) { 00170 any = -1; 00171 acc = LONG_MIN; 00172 errno = ERANGE; 00173 } else { 00174 any = 1; 00175 acc *= base; 00176 acc -= c; 00177 } 00178 } else { 00179 if ((acc > cutoff || acc == cutoff) && c > cutlim) { 00180 any = -1; 00181 acc = LONG_MAX; 00182 errno = ERANGE; 00183 } else { 00184 any = 1; 00185 acc *= base; 00186 acc += c; 00187 } 00188 } 00189 } 00190 if (endptr != 0) 00191 *endptr = (char *) (any ? s - 1 : nptr); 00192 return (acc); 00193 } 00194