strtoul.c 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116
  1. /*
  2. * Copyright (c) 1990 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. #ifdef HAVE_CONFIG_H
  31. #include "config.h"
  32. #endif
  33. #ifdef HAVE_LIMITS_H
  34. #include <limits.h>
  35. #endif
  36. #ifdef HAVE_SYS_PARAM_H
  37. #include <sys/param.h>
  38. #endif
  39. #include <errno.h>
  40. #ifdef NEED_DECLARATION_ERRNO
  41. extern int errno;
  42. #endif
  43. #if 0
  44. #include <stdlib.h>
  45. #endif
  46. #include "ansidecl.h"
  47. #include "safe-ctype.h"
  48. #ifndef ULONG_MAX
  49. #define ULONG_MAX ((unsigned long)(~0L)) /* 0xFFFFFFFF */
  50. #endif
  51. /*
  52. * Convert a string to an unsigned long integer.
  53. *
  54. * Ignores `locale' stuff. Assumes that the upper and lower case
  55. * alphabets and digits are each contiguous.
  56. */
  57. unsigned long
  58. strtoul(const char *nptr, char **endptr, register int base)
  59. {
  60. register const char *s = nptr;
  61. register unsigned long acc;
  62. register int c;
  63. register unsigned long cutoff;
  64. register int neg = 0, any, cutlim;
  65. /*
  66. * See strtol for comments as to the logic used.
  67. */
  68. do {
  69. c = *s++;
  70. } while (ISSPACE(c));
  71. if (c == '-') {
  72. neg = 1;
  73. c = *s++;
  74. } else if (c == '+')
  75. c = *s++;
  76. if ((base == 0 || base == 16) &&
  77. c == '0' && (*s == 'x' || *s == 'X')) {
  78. c = s[1];
  79. s += 2;
  80. base = 16;
  81. }
  82. if (base == 0)
  83. base = c == '0' ? 8 : 10;
  84. cutoff = (unsigned long)ULONG_MAX / (unsigned long)base;
  85. cutlim = (unsigned long)ULONG_MAX % (unsigned long)base;
  86. for (acc = 0, any = 0;; c = *s++) {
  87. if (ISDIGIT(c))
  88. c -= '0';
  89. else if (ISALPHA(c))
  90. c -= ISUPPER(c) ? 'A' - 10 : 'a' - 10;
  91. else
  92. break;
  93. if (c >= base)
  94. break;
  95. if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
  96. any = -1;
  97. else {
  98. any = 1;
  99. acc *= base;
  100. acc += c;
  101. }
  102. }
  103. if (any < 0) {
  104. acc = ULONG_MAX;
  105. errno = ERANGE;
  106. } else if (neg)
  107. acc = -acc;
  108. if (endptr != 0)
  109. *endptr = (char *) (any ? s - 1 : nptr);
  110. return (acc);
  111. }