2004-01-05 23:39:46 +01:00
|
|
|
/***************************************************************************
|
2004-10-08 11:39:37 +02:00
|
|
|
* _ _ ____ _
|
|
|
|
* Project ___| | | | _ \| |
|
|
|
|
* / __| | | | |_) | |
|
|
|
|
* | (__| |_| | _ <| |___
|
2004-01-05 23:39:46 +01:00
|
|
|
* \___|\___/|_| \_\_____|
|
|
|
|
*
|
2011-04-20 15:17:42 +02:00
|
|
|
* Copyright (C) 1998 - 2011, Daniel Stenberg, <daniel@haxx.se>, et al.
|
2004-01-05 23:39:46 +01:00
|
|
|
*
|
|
|
|
* This software is licensed as described in the file COPYING, which
|
|
|
|
* you should have received as part of this distribution. The terms
|
|
|
|
* are also available at http://curl.haxx.se/docs/copyright.html.
|
2004-10-08 11:39:37 +02:00
|
|
|
*
|
2004-01-05 23:39:46 +01:00
|
|
|
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
|
|
|
* copies of the Software, and permit persons to whom the Software is
|
|
|
|
* furnished to do so, under the terms of the COPYING file.
|
|
|
|
*
|
|
|
|
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
|
|
|
* KIND, either express or implied.
|
|
|
|
*
|
|
|
|
***************************************************************************/
|
|
|
|
|
2013-01-06 19:06:49 +01:00
|
|
|
#include "curl_setup.h"
|
2011-07-26 17:23:27 +02:00
|
|
|
|
2013-01-04 02:50:28 +01:00
|
|
|
#include "strtoofft.h"
|
2004-01-05 23:39:46 +01:00
|
|
|
|
2005-08-11 22:42:02 +02:00
|
|
|
/*
|
|
|
|
* NOTE:
|
|
|
|
*
|
|
|
|
* In the ISO C standard (IEEE Std 1003.1), there is a strtoimax() function we
|
|
|
|
* could use in case strtoll() doesn't exist... See
|
|
|
|
* http://www.opengroup.org/onlinepubs/009695399/functions/strtoimax.html
|
|
|
|
*/
|
|
|
|
|
2004-01-05 23:39:46 +01:00
|
|
|
#ifdef NEED_CURL_STRTOLL
|
|
|
|
|
2007-08-04 22:47:59 +02:00
|
|
|
/* Range tests can be used for alphanum decoding if characters are consecutive,
|
|
|
|
like in ASCII. Else an array is scanned. Determine this condition now. */
|
|
|
|
|
2007-11-05 10:45:09 +01:00
|
|
|
#if('9' - '0') != 9 || ('Z' - 'A') != 25 || ('z' - 'a') != 25
|
2007-08-04 22:47:59 +02:00
|
|
|
|
|
|
|
#define NO_RANGE_TEST
|
|
|
|
|
|
|
|
static const char valchars[] =
|
|
|
|
"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
|
|
|
|
#endif
|
|
|
|
|
2004-01-05 23:39:46 +01:00
|
|
|
static int get_char(char c, int base);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Emulated version of the strtoll function. This extracts a long long
|
|
|
|
* value from the given input string and returns it.
|
|
|
|
*/
|
2004-01-22 15:31:46 +01:00
|
|
|
curl_off_t
|
2004-02-19 09:12:13 +01:00
|
|
|
curlx_strtoll(const char *nptr, char **endptr, int base)
|
2004-01-05 23:39:46 +01:00
|
|
|
{
|
|
|
|
char *end;
|
|
|
|
int is_negative = 0;
|
|
|
|
int overflow;
|
|
|
|
int i;
|
2004-01-22 15:31:46 +01:00
|
|
|
curl_off_t value = 0;
|
|
|
|
curl_off_t newval;
|
2004-01-05 23:39:46 +01:00
|
|
|
|
|
|
|
/* Skip leading whitespace. */
|
|
|
|
end = (char *)nptr;
|
2007-11-05 10:45:09 +01:00
|
|
|
while(ISSPACE(end[0])) {
|
2004-01-05 23:39:46 +01:00
|
|
|
end++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Handle the sign, if any. */
|
2007-11-05 10:45:09 +01:00
|
|
|
if(end[0] == '-') {
|
2004-01-05 23:39:46 +01:00
|
|
|
is_negative = 1;
|
|
|
|
end++;
|
2004-01-22 15:37:06 +01:00
|
|
|
}
|
2007-11-05 10:45:09 +01:00
|
|
|
else if(end[0] == '+') {
|
2004-01-05 23:39:46 +01:00
|
|
|
end++;
|
2004-01-22 15:37:06 +01:00
|
|
|
}
|
2007-11-05 10:45:09 +01:00
|
|
|
else if(end[0] == '\0') {
|
2004-01-05 23:39:46 +01:00
|
|
|
/* We had nothing but perhaps some whitespace -- there was no number. */
|
2007-11-05 10:45:09 +01:00
|
|
|
if(endptr) {
|
2004-01-05 23:39:46 +01:00
|
|
|
*endptr = end;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Handle special beginnings, if present and allowed. */
|
2007-11-05 10:45:09 +01:00
|
|
|
if(end[0] == '0' && end[1] == 'x') {
|
|
|
|
if(base == 16 || base == 0) {
|
2004-01-05 23:39:46 +01:00
|
|
|
end += 2;
|
|
|
|
base = 16;
|
|
|
|
}
|
2004-01-22 15:37:06 +01:00
|
|
|
}
|
2007-11-05 10:45:09 +01:00
|
|
|
else if(end[0] == '0') {
|
|
|
|
if(base == 8 || base == 0) {
|
2004-01-05 23:39:46 +01:00
|
|
|
end++;
|
|
|
|
base = 8;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Matching strtol, if the base is 0 and it doesn't look like
|
|
|
|
* the number is octal or hex, we assume it's base 10.
|
|
|
|
*/
|
2007-11-05 10:45:09 +01:00
|
|
|
if(base == 0) {
|
2004-01-05 23:39:46 +01:00
|
|
|
base = 10;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Loop handling digits. */
|
|
|
|
value = 0;
|
|
|
|
overflow = 0;
|
2011-04-20 15:17:42 +02:00
|
|
|
for(i = get_char(end[0], base);
|
|
|
|
i != -1;
|
|
|
|
end++, i = get_char(end[0], base)) {
|
2004-01-05 23:39:46 +01:00
|
|
|
newval = base * value + i;
|
2007-11-05 10:45:09 +01:00
|
|
|
if(newval < value) {
|
2004-01-05 23:39:46 +01:00
|
|
|
/* We've overflowed. */
|
|
|
|
overflow = 1;
|
|
|
|
break;
|
|
|
|
}
|
2004-01-22 15:37:06 +01:00
|
|
|
else
|
|
|
|
value = newval;
|
2004-01-05 23:39:46 +01:00
|
|
|
}
|
|
|
|
|
2007-11-05 10:45:09 +01:00
|
|
|
if(!overflow) {
|
|
|
|
if(is_negative) {
|
2004-01-05 23:39:46 +01:00
|
|
|
/* Fix the sign. */
|
|
|
|
value *= -1;
|
|
|
|
}
|
2004-01-22 15:37:06 +01:00
|
|
|
}
|
|
|
|
else {
|
2007-11-05 10:45:09 +01:00
|
|
|
if(is_negative)
|
2010-05-29 21:28:16 +02:00
|
|
|
value = CURL_OFF_T_MIN;
|
2004-01-22 15:37:06 +01:00
|
|
|
else
|
2010-05-29 21:28:16 +02:00
|
|
|
value = CURL_OFF_T_MAX;
|
2004-01-05 23:39:46 +01:00
|
|
|
|
2007-02-16 19:19:35 +01:00
|
|
|
SET_ERRNO(ERANGE);
|
2004-01-05 23:39:46 +01:00
|
|
|
}
|
|
|
|
|
2007-11-05 10:45:09 +01:00
|
|
|
if(endptr)
|
2004-01-05 23:39:46 +01:00
|
|
|
*endptr = end;
|
|
|
|
|
|
|
|
return value;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns the value of c in the given base, or -1 if c cannot
|
|
|
|
* be interpreted properly in that base (i.e., is out of range,
|
|
|
|
* is a null, etc.).
|
|
|
|
*
|
|
|
|
* @param c the character to interpret according to base
|
|
|
|
* @param base the base in which to interpret c
|
|
|
|
*
|
|
|
|
* @return the value of c in base, or -1 if c isn't in range
|
|
|
|
*/
|
2004-01-22 15:37:06 +01:00
|
|
|
static int get_char(char c, int base)
|
|
|
|
{
|
2007-08-04 22:47:59 +02:00
|
|
|
#ifndef NO_RANGE_TEST
|
2004-01-22 15:37:06 +01:00
|
|
|
int value = -1;
|
2007-11-05 10:45:09 +01:00
|
|
|
if(c <= '9' && c >= '0') {
|
2004-01-22 15:37:06 +01:00
|
|
|
value = c - '0';
|
|
|
|
}
|
2007-11-05 10:45:09 +01:00
|
|
|
else if(c <= 'Z' && c >= 'A') {
|
2004-01-22 15:37:06 +01:00
|
|
|
value = c - 'A' + 10;
|
|
|
|
}
|
2007-11-05 10:45:09 +01:00
|
|
|
else if(c <= 'z' && c >= 'a') {
|
2004-01-22 15:37:06 +01:00
|
|
|
value = c - 'a' + 10;
|
|
|
|
}
|
2007-08-04 22:47:59 +02:00
|
|
|
#else
|
|
|
|
const char * cp;
|
|
|
|
int value;
|
|
|
|
|
|
|
|
cp = memchr(valchars, c, 10 + 26 + 26);
|
|
|
|
|
2007-11-05 10:45:09 +01:00
|
|
|
if(!cp)
|
2007-08-04 22:47:59 +02:00
|
|
|
return -1;
|
|
|
|
|
|
|
|
value = cp - valchars;
|
|
|
|
|
2007-11-05 10:45:09 +01:00
|
|
|
if(value >= 10 + 26)
|
2007-08-04 22:47:59 +02:00
|
|
|
value -= 26; /* Lowercase. */
|
|
|
|
#endif
|
2004-01-05 23:39:46 +01:00
|
|
|
|
2007-11-05 10:45:09 +01:00
|
|
|
if(value >= base) {
|
2004-01-22 15:37:06 +01:00
|
|
|
value = -1;
|
|
|
|
}
|
2004-01-05 23:39:46 +01:00
|
|
|
|
2004-01-22 15:37:06 +01:00
|
|
|
return value;
|
2004-01-05 23:39:46 +01:00
|
|
|
}
|
|
|
|
#endif /* Only present if we need strtoll, but don't have it. */
|