strtoimax.c 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140
  1. /* $OpenBSD: strtoimax.c,v 1.1 2006/01/13 17:58:09 millert Exp $ */
  2. /*-
  3. * Copyright (c) 1992 The Regents of the University of California.
  4. * All rights reserved.
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted provided that the following conditions
  8. * are met:
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. * 2. Redistributions in binary form must reproduce the above copyright
  12. * notice, this list of conditions and the following disclaimer in the
  13. * documentation and/or other materials provided with the distribution.
  14. * 3. 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. #include <ctype.h>
  31. #include <errno.h>
  32. #include <inttypes.h>
  33. /*
  34. * Convert a string to an intmax_t
  35. *
  36. * Ignores `locale' stuff. Assumes that the upper and lower case
  37. * alphabets and digits are each contiguous.
  38. */
  39. intmax_t
  40. strtoimax(const char *nptr, char **endptr, int base)
  41. {
  42. const char *s;
  43. intmax_t acc, cutoff;
  44. int c;
  45. int neg, any, cutlim;
  46. /*
  47. * Skip white space and pick up leading +/- sign if any.
  48. * If base is 0, allow 0x for hex and 0 for octal, else
  49. * assume decimal; if base is already 16, allow 0x.
  50. */
  51. s = nptr;
  52. do {
  53. c = (unsigned char) *s++;
  54. } while (isspace(c));
  55. if (c == '-') {
  56. neg = 1;
  57. c = *s++;
  58. } else {
  59. neg = 0;
  60. if (c == '+')
  61. c = *s++;
  62. }
  63. if ((base == 0 || base == 16) &&
  64. c == '0' && (*s == 'x' || *s == 'X')) {
  65. c = s[1];
  66. s += 2;
  67. base = 16;
  68. }
  69. if (base == 0)
  70. base = c == '0' ? 8 : 10;
  71. /*
  72. * Compute the cutoff value between legal numbers and illegal
  73. * numbers. That is the largest legal value, divided by the
  74. * base. An input number that is greater than this value, if
  75. * followed by a legal input character, is too big. One that
  76. * is equal to this value may be valid or not; the limit
  77. * between valid and invalid numbers is then based on the last
  78. * digit. For instance, if the range for intmax_t is
  79. * [-9223372036854775808..9223372036854775807] and the input base
  80. * is 10, cutoff will be set to 922337203685477580 and cutlim to
  81. * either 7 (neg==0) or 8 (neg==1), meaning that if we have
  82. * accumulated a value > 922337203685477580, or equal but the
  83. * next digit is > 7 (or 8), the number is too big, and we will
  84. * return a range error.
  85. *
  86. * Set any if any `digits' consumed; make it negative to indicate
  87. * overflow.
  88. */
  89. cutoff = neg ? INTMAX_MIN : INTMAX_MAX;
  90. cutlim = cutoff % base;
  91. cutoff /= base;
  92. if (neg) {
  93. if (cutlim > 0) {
  94. cutlim -= base;
  95. cutoff += 1;
  96. }
  97. cutlim = -cutlim;
  98. }
  99. for (acc = 0, any = 0;; c = (unsigned char) *s++) {
  100. if (isdigit(c))
  101. c -= '0';
  102. else if (isalpha(c))
  103. c -= isupper(c) ? 'A' - 10 : 'a' - 10;
  104. else
  105. break;
  106. if (c >= base)
  107. break;
  108. if (any < 0)
  109. continue;
  110. if (neg) {
  111. if (acc < cutoff || (acc == cutoff && c > cutlim)) {
  112. any = -1;
  113. acc = INTMAX_MIN;
  114. errno = ERANGE;
  115. } else {
  116. any = 1;
  117. acc *= base;
  118. acc -= c;
  119. }
  120. } else {
  121. if (acc > cutoff || (acc == cutoff && c > cutlim)) {
  122. any = -1;
  123. acc = INTMAX_MAX;
  124. errno = ERANGE;
  125. } else {
  126. any = 1;
  127. acc *= base;
  128. acc += c;
  129. }
  130. }
  131. }
  132. if (endptr != 0)
  133. *endptr = (char *) (any ? s - 1 : nptr);
  134. return (acc);
  135. }