strtoull.c 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116
  1. /*-
  2. * Copyright (c) 1992, 1993
  3. * The Regents of the University of California. 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. All advertising materials mentioning features or use of this software
  14. * must display the following acknowledgement:
  15. * This product includes software developed by the University of
  16. * California, Berkeley and its contributors.
  17. * 4. Neither the name of the University nor the names of its contributors
  18. * may be used to endorse or promote products derived from this software
  19. * without specific prior written permission.
  20. *
  21. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31. * SUCH DAMAGE.
  32. */
  33. #include <limits.h>
  34. #include <errno.h>
  35. #include <ctype.h>
  36. #include <stdlib.h>
  37. /*
  38. * Convert a string to an unsigned long long integer.
  39. *
  40. * Assumes that the upper and lower case
  41. * alphabets and digits are each contiguous.
  42. */
  43. unsigned long long
  44. strtoull(const char *nptr, char **endptr, int base)
  45. {
  46. const char *s;
  47. unsigned long long acc;
  48. char c;
  49. unsigned long long cutoff;
  50. int neg, any, cutlim;
  51. /*
  52. * See strtoq for comments as to the logic used.
  53. */
  54. s = nptr;
  55. do {
  56. c = *s++;
  57. } while (isspace((unsigned char)c));
  58. if (c == '-') {
  59. neg = 1;
  60. c = *s++;
  61. } else {
  62. neg = 0;
  63. if (c == '+')
  64. c = *s++;
  65. }
  66. if ((base == 0 || base == 16) &&
  67. c == '0' && (*s == 'x' || *s == 'X') &&
  68. ((s[1] >= '0' && s[1] <= '9') ||
  69. (s[1] >= 'A' && s[1] <= 'F') ||
  70. (s[1] >= 'a' && s[1] <= 'f'))) {
  71. c = s[1];
  72. s += 2;
  73. base = 16;
  74. }
  75. if (base == 0)
  76. base = c == '0' ? 8 : 10;
  77. acc = any = 0;
  78. if (base < 2 || base > 36)
  79. goto noconv;
  80. cutoff = ULLONG_MAX / base;
  81. cutlim = ULLONG_MAX % base;
  82. for ( ; ; c = *s++) {
  83. if (c >= '0' && c <= '9')
  84. c -= '0';
  85. else if (c >= 'A' && c <= 'Z')
  86. c -= 'A' - 10;
  87. else if (c >= 'a' && c <= 'z')
  88. c -= 'a' - 10;
  89. else
  90. break;
  91. if (c >= base)
  92. break;
  93. if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
  94. any = -1;
  95. else {
  96. any = 1;
  97. acc *= base;
  98. acc += c;
  99. }
  100. }
  101. if (any < 0) {
  102. acc = ULLONG_MAX;
  103. errno = ERANGE;
  104. } else if (!any) {
  105. noconv:
  106. errno = EINVAL;
  107. } else if (neg)
  108. acc = -acc;
  109. if (endptr != NULL)
  110. *endptr = (char *)(any ? s - 1 : nptr);
  111. return (acc);
  112. }