strtol.c 5.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165
  1. /*-
  2. * Copyright (c) 1990 The Regents of the University of California.
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in the
  12. * documentation and/or other materials provided with the distribution.
  13. * 3. [rescinded 22 July 1999]
  14. * 4. Neither the name of the University nor the names of its contributors
  15. * may be used to endorse or promote products derived from this software
  16. * without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  19. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  20. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  21. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  22. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  23. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  24. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  25. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  26. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  27. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  28. * SUCH DAMAGE.
  29. */
  30. /*
  31. @deftypefn Supplemental {long int} strtol (const char *@var{string}, @
  32. char **@var{endptr}, int @var{base})
  33. @deftypefnx Supplemental {unsigned long int} strtoul (const char *@var{string}, @
  34. char **@var{endptr}, int @var{base})
  35. The @code{strtol} function converts the string in @var{string} to a
  36. long integer value according to the given @var{base}, which must be
  37. between 2 and 36 inclusive, or be the special value 0. If @var{base}
  38. is 0, @code{strtol} will look for the prefixes @code{0} and @code{0x}
  39. to indicate bases 8 and 16, respectively, else default to base 10.
  40. When the base is 16 (either explicitly or implicitly), a prefix of
  41. @code{0x} is allowed. The handling of @var{endptr} is as that of
  42. @code{strtod} above. The @code{strtoul} function is the same, except
  43. that the converted value is unsigned.
  44. @end deftypefn
  45. */
  46. #ifdef HAVE_CONFIG_H
  47. #include "config.h"
  48. #endif
  49. #ifdef HAVE_LIMITS_H
  50. #include <limits.h>
  51. #endif
  52. #ifdef HAVE_SYS_PARAM_H
  53. #include <sys/param.h>
  54. #endif
  55. #include <errno.h>
  56. #ifdef NEED_DECLARATION_ERRNO
  57. extern int errno;
  58. #endif
  59. #include "safe-ctype.h"
  60. /* FIXME: It'd be nice to configure around these, but the include files are too
  61. painful. These macros should at least be more portable than hardwired hex
  62. constants. */
  63. #ifndef ULONG_MAX
  64. #define ULONG_MAX ((unsigned long)(~0L)) /* 0xFFFFFFFF */
  65. #endif
  66. #ifndef LONG_MAX
  67. #define LONG_MAX ((long)(ULONG_MAX >> 1)) /* 0x7FFFFFFF */
  68. #endif
  69. #ifndef LONG_MIN
  70. #define LONG_MIN ((long)(~LONG_MAX)) /* 0x80000000 */
  71. #endif
  72. /*
  73. * Convert a string to a long integer.
  74. *
  75. * Ignores `locale' stuff. Assumes that the upper and lower case
  76. * alphabets and digits are each contiguous.
  77. */
  78. long
  79. strtol(const char *nptr, char **endptr, register int base)
  80. {
  81. register const char *s = nptr;
  82. register unsigned long acc;
  83. register int c;
  84. register unsigned long cutoff;
  85. register int neg = 0, any, cutlim;
  86. /*
  87. * Skip white space and pick up leading +/- sign if any.
  88. * If base is 0, allow 0x for hex and 0 for octal, else
  89. * assume decimal; if base is already 16, allow 0x.
  90. */
  91. do {
  92. c = *s++;
  93. } while (ISSPACE(c));
  94. if (c == '-') {
  95. neg = 1;
  96. c = *s++;
  97. } else if (c == '+')
  98. c = *s++;
  99. if ((base == 0 || base == 16) &&
  100. c == '0' && (*s == 'x' || *s == 'X')) {
  101. c = s[1];
  102. s += 2;
  103. base = 16;
  104. }
  105. if (base == 0)
  106. base = c == '0' ? 8 : 10;
  107. /*
  108. * Compute the cutoff value between legal numbers and illegal
  109. * numbers. That is the largest legal value, divided by the
  110. * base. An input number that is greater than this value, if
  111. * followed by a legal input character, is too big. One that
  112. * is equal to this value may be valid or not; the limit
  113. * between valid and invalid numbers is then based on the last
  114. * digit. For instance, if the range for longs is
  115. * [-2147483648..2147483647] and the input base is 10,
  116. * cutoff will be set to 214748364 and cutlim to either
  117. * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
  118. * a value > 214748364, or equal but the next digit is > 7 (or 8),
  119. * the number is too big, and we will return a range error.
  120. *
  121. * Set any if any `digits' consumed; make it negative to indicate
  122. * overflow.
  123. */
  124. cutoff = neg ? -(unsigned long)LONG_MIN : LONG_MAX;
  125. cutlim = cutoff % (unsigned long)base;
  126. cutoff /= (unsigned long)base;
  127. for (acc = 0, any = 0;; c = *s++) {
  128. if (ISDIGIT(c))
  129. c -= '0';
  130. else if (ISALPHA(c))
  131. c -= ISUPPER(c) ? 'A' - 10 : 'a' - 10;
  132. else
  133. break;
  134. if (c >= base)
  135. break;
  136. if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
  137. any = -1;
  138. else {
  139. any = 1;
  140. acc *= base;
  141. acc += c;
  142. }
  143. }
  144. if (any < 0) {
  145. acc = neg ? LONG_MIN : LONG_MAX;
  146. errno = ERANGE;
  147. } else if (neg)
  148. acc = -acc;
  149. if (endptr != 0)
  150. *endptr = (char *) (any ? s - 1 : nptr);
  151. return (acc);
  152. }