| 1 |
/* |
| 2 |
* Copyright (c) 1992, 1993 |
| 3 |
* The Regents of the University of California. All rights reserved. |
| 4 |
* |
| 5 |
* Copyright (c) 2011 The FreeBSD Foundation |
| 6 |
* All rights reserved. |
| 7 |
* Portions of this software were developed by David Chisnall |
| 8 |
* under sponsorship from the FreeBSD Foundation. |
| 9 |
* |
| 10 |
* Redistribution and use in source and binary forms, with or without |
| 11 |
* modification, are permitted provided that the following conditions |
| 12 |
* are met: |
| 13 |
* 1. Redistributions of source code must retain the above copyright |
| 14 |
* notice, this list of conditions and the following disclaimer. |
| 15 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 16 |
* notice, this list of conditions and the following disclaimer in the |
| 17 |
* documentation and/or other materials provided with the distribution. |
| 18 |
* 4. Neither the name of the University nor the names of its contributors |
| 19 |
* may be used to endorse or promote products derived from this software |
| 20 |
* without specific prior written permission. |
| 21 |
* |
| 22 |
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
| 23 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 24 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 25 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
| 26 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 27 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 28 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 29 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 30 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 31 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 32 |
* SUCH DAMAGE. |
| 33 |
*/ |
| 34 |
|
| 35 |
#include <config.h> |
| 36 |
|
| 37 |
#include <string.h> |
| 38 |
|
| 39 |
#include "roken.h" |
| 40 |
|
| 41 |
#ifndef HAVE_STRTOLL |
| 42 |
|
| 43 |
/* #include <sys/cdefs.h> */ |
| 44 |
|
| 45 |
#include <limits.h> |
| 46 |
#include <errno.h> |
| 47 |
#include <ctype.h> |
| 48 |
#include <stdlib.h> |
| 49 |
#include <stdint.h> |
| 50 |
|
| 51 |
/* |
| 52 |
* Convert a string to a long long integer. |
| 53 |
* |
| 54 |
* Assumes that the upper and lower case |
| 55 |
* alphabets and digits are each contiguous. |
| 56 |
*/ |
| 57 |
ROKEN_LIB_FUNCTION long long ROKEN_LIB_CALL |
| 58 |
strtoll(const char * nptr, char ** endptr, int base) |
| 59 |
{ |
| 60 |
const char *s; |
| 61 |
unsigned long long acc; |
| 62 |
char c; |
| 63 |
unsigned long long cutoff; |
| 64 |
int neg, any, cutlim; |
| 65 |
|
| 66 |
/* |
| 67 |
* Skip white space and pick up leading +/- sign if any. |
| 68 |
* If base is 0, allow 0x for hex and 0 for octal, else |
| 69 |
* assume decimal; if base is already 16, allow 0x. |
| 70 |
*/ |
| 71 |
s = nptr; |
| 72 |
do { |
| 73 |
c = *s++; |
| 74 |
} while (isspace((unsigned char)c)); |
| 75 |
if (c == '-') { |
| 76 |
neg = 1; |
| 77 |
c = *s++; |
| 78 |
} else { |
| 79 |
neg = 0; |
| 80 |
if (c == '+') |
| 81 |
c = *s++; |
| 82 |
} |
| 83 |
if ((base == 0 || base == 16) && |
| 84 |
c == '0' && (*s == 'x' || *s == 'X') && |
| 85 |
((s[1] >= '0' && s[1] <= '9') || |
| 86 |
(s[1] >= 'A' && s[1] <= 'F') || |
| 87 |
(s[1] >= 'a' && s[1] <= 'f'))) { |
| 88 |
c = s[1]; |
| 89 |
s += 2; |
| 90 |
base = 16; |
| 91 |
} |
| 92 |
if (base == 0) |
| 93 |
base = c == '0' ? 8 : 10; |
| 94 |
acc = any = 0; |
| 95 |
if (base < 2 || base > 36) |
| 96 |
goto noconv; |
| 97 |
|
| 98 |
/* |
| 99 |
* Compute the cutoff value between legal numbers and illegal |
| 100 |
* numbers. That is the largest legal value, divided by the |
| 101 |
* base. An input number that is greater than this value, if |
| 102 |
* followed by a legal input character, is too big. One that |
| 103 |
* is equal to this value may be valid or not; the limit |
| 104 |
* between valid and invalid numbers is then based on the last |
| 105 |
* digit. For instance, if the range for quads is |
| 106 |
* [-9223372036854775808..9223372036854775807] and the input base |
| 107 |
* is 10, cutoff will be set to 922337203685477580 and cutlim to |
| 108 |
* either 7 (neg==0) or 8 (neg==1), meaning that if we have |
| 109 |
* accumulated a value > 922337203685477580, or equal but the |
| 110 |
* next digit is > 7 (or 8), the number is too big, and we will |
| 111 |
* return a range error. |
| 112 |
* |
| 113 |
* Set 'any' if any `digits' consumed; make it negative to indicate |
| 114 |
* overflow. |
| 115 |
*/ |
| 116 |
cutoff = neg ? (unsigned long long)-(LLONG_MIN + LLONG_MAX) + LLONG_MAX |
| 117 |
: LLONG_MAX; |
| 118 |
cutlim = cutoff % base; |
| 119 |
cutoff /= base; |
| 120 |
for ( ; ; c = *s++) { |
| 121 |
if (c >= '0' && c <= '9') |
| 122 |
c -= '0'; |
| 123 |
else if (c >= 'A' && c <= 'Z') |
| 124 |
c -= 'A' - 10; |
| 125 |
else if (c >= 'a' && c <= 'z') |
| 126 |
c -= 'a' - 10; |
| 127 |
else |
| 128 |
break; |
| 129 |
if (c >= base) |
| 130 |
break; |
| 131 |
if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim)) |
| 132 |
any = -1; |
| 133 |
else { |
| 134 |
any = 1; |
| 135 |
acc *= base; |
| 136 |
acc += c; |
| 137 |
} |
| 138 |
} |
| 139 |
if (any < 0) { |
| 140 |
acc = neg ? LLONG_MIN : LLONG_MAX; |
| 141 |
errno = ERANGE; |
| 142 |
} else if (!any) { |
| 143 |
noconv: |
| 144 |
errno = EINVAL; |
| 145 |
} else if (neg) |
| 146 |
acc = -acc; |
| 147 |
if (endptr != NULL) |
| 148 |
*endptr = (char *)(any ? s - 1 : nptr); |
| 149 |
return (acc); |
| 150 |
} |
| 151 |
#endif /* !HAVE_STRTOLL */ |