strtoq.c 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133
  1. /*-
  2. * SPDX-License-Identifier: BSD-3-Clause
  3. *
  4. * Copyright (c) 1990, 1993
  5. * The Regents of the University of California. All rights reserved.
  6. *
  7. * This code is derived from software contributed to Berkeley by
  8. * Chris Torek.
  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. * 3. 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. #include <sys/cdefs.h>
  35. __FBSDID("$FreeBSD$");
  36. #include <sys/param.h>
  37. #include <sys/systm.h>
  38. #include <sys/ctype.h>
  39. #include <sys/limits.h>
  40. /*
  41. * Convert a string to a quad integer.
  42. *
  43. * Ignores `locale' stuff. Assumes that the upper and lower case
  44. * alphabets and digits are each contiguous.
  45. */
  46. quad_t
  47. strtoq(const char *nptr, char **endptr, int base)
  48. {
  49. const char *s;
  50. u_quad_t acc;
  51. unsigned char c;
  52. u_quad_t qbase, cutoff;
  53. int neg, any, cutlim;
  54. /*
  55. * Skip white space and pick up leading +/- sign if any.
  56. * If base is 0, allow 0x for hex and 0 for octal, else
  57. * assume decimal; if base is already 16, allow 0x.
  58. */
  59. s = nptr;
  60. do {
  61. c = *s++;
  62. } while (isspace(c));
  63. if (c == '-') {
  64. neg = 1;
  65. c = *s++;
  66. } else {
  67. neg = 0;
  68. if (c == '+')
  69. c = *s++;
  70. }
  71. if ((base == 0 || base == 16) &&
  72. c == '0' && (*s == 'x' || *s == 'X')) {
  73. c = s[1];
  74. s += 2;
  75. base = 16;
  76. }
  77. if (base == 0)
  78. base = c == '0' ? 8 : 10;
  79. /*
  80. * Compute the cutoff value between legal numbers and illegal
  81. * numbers. That is the largest legal value, divided by the
  82. * base. An input number that is greater than this value, if
  83. * followed by a legal input character, is too big. One that
  84. * is equal to this value may be valid or not; the limit
  85. * between valid and invalid numbers is then based on the last
  86. * digit. For instance, if the range for quads is
  87. * [-9223372036854775808..9223372036854775807] and the input base
  88. * is 10, cutoff will be set to 922337203685477580 and cutlim to
  89. * either 7 (neg==0) or 8 (neg==1), meaning that if we have
  90. * accumulated a value > 922337203685477580, or equal but the
  91. * next digit is > 7 (or 8), the number is too big, and we will
  92. * return a range error.
  93. *
  94. * Set any if any `digits' consumed; make it negative to indicate
  95. * overflow.
  96. */
  97. qbase = (unsigned)base;
  98. cutoff = neg ? (u_quad_t)-(QUAD_MIN + QUAD_MAX) + QUAD_MAX : QUAD_MAX;
  99. cutlim = cutoff % qbase;
  100. cutoff /= qbase;
  101. for (acc = 0, any = 0;; c = *s++) {
  102. if (!isascii(c))
  103. break;
  104. if (isdigit(c))
  105. c -= '0';
  106. else if (isalpha(c))
  107. c -= isupper(c) ? 'A' - 10 : 'a' - 10;
  108. else
  109. break;
  110. if (c >= base)
  111. break;
  112. if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
  113. any = -1;
  114. else {
  115. any = 1;
  116. acc *= qbase;
  117. acc += c;
  118. }
  119. }
  120. if (any < 0) {
  121. acc = neg ? QUAD_MIN : QUAD_MAX;
  122. } else if (neg)
  123. acc = -acc;
  124. if (endptr != NULL)
  125. *endptr = __DECONST(char *, any ? s - 1 : nptr);
  126. return (acc);
  127. }