19c5cbc30SBill Fenner /*- 29c5cbc30SBill Fenner * Copyright (c) 1992, 1993 39c5cbc30SBill Fenner * The Regents of the University of California. All rights reserved. 49c5cbc30SBill Fenner * 59c5cbc30SBill Fenner * Redistribution and use in source and binary forms, with or without 69c5cbc30SBill Fenner * modification, are permitted provided that the following conditions 79c5cbc30SBill Fenner * are met: 89c5cbc30SBill Fenner * 1. Redistributions of source code must retain the above copyright 99c5cbc30SBill Fenner * notice, this list of conditions and the following disclaimer. 109c5cbc30SBill Fenner * 2. Redistributions in binary form must reproduce the above copyright 119c5cbc30SBill Fenner * notice, this list of conditions and the following disclaimer in the 129c5cbc30SBill Fenner * documentation and/or other materials provided with the distribution. 139c5cbc30SBill Fenner * 3. All advertising materials mentioning features or use of this software 149c5cbc30SBill Fenner * must display the following acknowledgement: 159c5cbc30SBill Fenner * This product includes software developed by the University of 169c5cbc30SBill Fenner * California, Berkeley and its contributors. 179c5cbc30SBill Fenner * 4. Neither the name of the University nor the names of its contributors 189c5cbc30SBill Fenner * may be used to endorse or promote products derived from this software 199c5cbc30SBill Fenner * without specific prior written permission. 209c5cbc30SBill Fenner * 219c5cbc30SBill Fenner * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 229c5cbc30SBill Fenner * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 239c5cbc30SBill Fenner * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 249c5cbc30SBill Fenner * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 259c5cbc30SBill Fenner * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 269c5cbc30SBill Fenner * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 279c5cbc30SBill Fenner * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 289c5cbc30SBill Fenner * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 299c5cbc30SBill Fenner * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 309c5cbc30SBill Fenner * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 319c5cbc30SBill Fenner * SUCH DAMAGE. 329c5cbc30SBill Fenner */ 339c5cbc30SBill Fenner 349c5cbc30SBill Fenner #if defined(LIBC_SCCS) && !defined(lint) 359c5cbc30SBill Fenner static char sccsid[] = "from @(#)strtol.c 8.1 (Berkeley) 6/4/93"; 369c5cbc30SBill Fenner #endif /* LIBC_SCCS and not lint */ 37333fc21eSDavid E. O'Brien #include <sys/cdefs.h> 38333fc21eSDavid E. O'Brien __FBSDID("$FreeBSD$"); 399c5cbc30SBill Fenner 409c5cbc30SBill Fenner #include <ctype.h> 419c5cbc30SBill Fenner #include <errno.h> 429c5cbc30SBill Fenner #include <stdlib.h> 439c5cbc30SBill Fenner #include <inttypes.h> 449c5cbc30SBill Fenner 459c5cbc30SBill Fenner /* 469d5abbddSJens Schweikhardt * Convert a string to an intmax_t integer. 479c5cbc30SBill Fenner * 489c5cbc30SBill Fenner * Assumes that the upper and lower case 499c5cbc30SBill Fenner * alphabets and digits are each contiguous. 509c5cbc30SBill Fenner */ 519c5cbc30SBill Fenner intmax_t 525618f724SRobert Drehmel strtoimax(const char * __restrict nptr, char ** __restrict endptr, int base) 539c5cbc30SBill Fenner { 549c5cbc30SBill Fenner const char *s; 559c5cbc30SBill Fenner uintmax_t acc; 56f34b139cSAndrey A. Chernov char c; 579c5cbc30SBill Fenner uintmax_t cutoff; 58f34b139cSAndrey A. Chernov int neg, any, cutlim; 599c5cbc30SBill Fenner 609c5cbc30SBill Fenner /* 619c5cbc30SBill Fenner * Skip white space and pick up leading +/- sign if any. 629c5cbc30SBill Fenner * If base is 0, allow 0x for hex and 0 for octal, else 639c5cbc30SBill Fenner * assume decimal; if base is already 16, allow 0x. 649c5cbc30SBill Fenner */ 659c5cbc30SBill Fenner s = nptr; 669c5cbc30SBill Fenner do { 679c5cbc30SBill Fenner c = *s++; 68f34b139cSAndrey A. Chernov } while (isspace((unsigned char)c)); 699c5cbc30SBill Fenner if (c == '-') { 709c5cbc30SBill Fenner neg = 1; 719c5cbc30SBill Fenner c = *s++; 729c5cbc30SBill Fenner } else { 739c5cbc30SBill Fenner neg = 0; 749c5cbc30SBill Fenner if (c == '+') 759c5cbc30SBill Fenner c = *s++; 769c5cbc30SBill Fenner } 779c5cbc30SBill Fenner if ((base == 0 || base == 16) && 782571c7f7SAndrey A. Chernov c == '0' && (*s == 'x' || *s == 'X') && 79db0e25eeSAndrey A. Chernov ((s[1] >= '0' && s[1] <= '9') || 802571c7f7SAndrey A. Chernov (s[1] >= 'A' && s[1] <= 'F') || 81db0e25eeSAndrey A. Chernov (s[1] >= 'a' && s[1] <= 'f'))) { 829c5cbc30SBill Fenner c = s[1]; 839c5cbc30SBill Fenner s += 2; 849c5cbc30SBill Fenner base = 16; 859c5cbc30SBill Fenner } 869c5cbc30SBill Fenner if (base == 0) 879c5cbc30SBill Fenner base = c == '0' ? 8 : 10; 889c5cbc30SBill Fenner acc = any = 0; 899c5cbc30SBill Fenner if (base < 2 || base > 36) 909c5cbc30SBill Fenner goto noconv; 919c5cbc30SBill Fenner 929c5cbc30SBill Fenner /* 939c5cbc30SBill Fenner * Compute the cutoff value between legal numbers and illegal 949c5cbc30SBill Fenner * numbers. That is the largest legal value, divided by the 959c5cbc30SBill Fenner * base. An input number that is greater than this value, if 969c5cbc30SBill Fenner * followed by a legal input character, is too big. One that 979c5cbc30SBill Fenner * is equal to this value may be valid or not; the limit 989c5cbc30SBill Fenner * between valid and invalid numbers is then based on the last 999c5cbc30SBill Fenner * digit. For instance, if the range for intmax_t is 1009c5cbc30SBill Fenner * [-9223372036854775808..9223372036854775807] and the input base 1019c5cbc30SBill Fenner * is 10, cutoff will be set to 922337203685477580 and cutlim to 1029c5cbc30SBill Fenner * either 7 (neg==0) or 8 (neg==1), meaning that if we have 1039c5cbc30SBill Fenner * accumulated a value > 922337203685477580, or equal but the 1049c5cbc30SBill Fenner * next digit is > 7 (or 8), the number is too big, and we will 1059c5cbc30SBill Fenner * return a range error. 1069c5cbc30SBill Fenner * 1079c5cbc30SBill Fenner * Set 'any' if any `digits' consumed; make it negative to indicate 1089c5cbc30SBill Fenner * overflow. 1099c5cbc30SBill Fenner */ 1109c5cbc30SBill Fenner cutoff = neg ? (uintmax_t)-(INTMAX_MIN + INTMAX_MAX) + INTMAX_MAX 1119c5cbc30SBill Fenner : INTMAX_MAX; 1129c5cbc30SBill Fenner cutlim = cutoff % base; 1139c5cbc30SBill Fenner cutoff /= base; 1149c5cbc30SBill Fenner for ( ; ; c = *s++) { 115f34b139cSAndrey A. Chernov if (c >= '0' && c <= '9') 116f34b139cSAndrey A. Chernov c -= '0'; 117f34b139cSAndrey A. Chernov else if (c >= 'A' && c <= 'Z') 118f34b139cSAndrey A. Chernov c -= 'A' - 10; 119f34b139cSAndrey A. Chernov else if (c >= 'a' && c <= 'z') 120f34b139cSAndrey A. Chernov c -= 'a' - 10; 1219c5cbc30SBill Fenner else 1229c5cbc30SBill Fenner break; 123f34b139cSAndrey A. Chernov if (c >= base) 1249c5cbc30SBill Fenner break; 125f34b139cSAndrey A. Chernov if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim)) 1269c5cbc30SBill Fenner any = -1; 1279c5cbc30SBill Fenner else { 1289c5cbc30SBill Fenner any = 1; 1299c5cbc30SBill Fenner acc *= base; 130f34b139cSAndrey A. Chernov acc += c; 1319c5cbc30SBill Fenner } 1329c5cbc30SBill Fenner } 1339c5cbc30SBill Fenner if (any < 0) { 1349c5cbc30SBill Fenner acc = neg ? INTMAX_MIN : INTMAX_MAX; 1359c5cbc30SBill Fenner errno = ERANGE; 1369c5cbc30SBill Fenner } else if (!any) { 1379c5cbc30SBill Fenner noconv: 1389c5cbc30SBill Fenner errno = EINVAL; 1399c5cbc30SBill Fenner } else if (neg) 1409c5cbc30SBill Fenner acc = -acc; 1419c5cbc30SBill Fenner if (endptr != NULL) 1429c5cbc30SBill Fenner *endptr = (char *)(any ? s - 1 : nptr); 1439c5cbc30SBill Fenner return (acc); 1449c5cbc30SBill Fenner } 145