ref: 08c48f8d3da19e4f1a70e8da9bdef305002666de
parent: 4975fa36bb99219effb418cceec5382258d9b368
author: Quentin Rameau <quinq@fifth.space>
date: Fri Dec 28 18:43:50 EST 2018
[libc] Add strtol[l]
--- a/src/libc/stdlib/Makefile
+++ b/src/libc/stdlib/Makefile
@@ -19,6 +19,8 @@
qsort.o\
rand.o\
realloc.o\
+ strtol.o\
+ strtoll.o\
strtoul.o\
strtoull.o\
--- /dev/null
+++ b/src/libc/stdlib/strtol.c
@@ -1,0 +1,68 @@
+#include <ctype.h>
+#include <errno.h>
+#include <limits.h>
+#include <stdlib.h>
+#include <string.h>
+
+#undef strtol
+
+long
+strtol(const char *s, char **end, int base)
+{
+ int d, sign = -1;
+ long n;
+ static const char digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
+ const char *t, *p;
+
+ if (end)
+ *end = s;
+
+ while (isspace(*s))
+ ++s;
+
+ switch (*s) {
+ case '-':
+ sign = 1;
+ case '+':
+ ++s;
+ }
+
+ if (base == 0) {
+ if (*s == '0')
+ base = toupper(s[1]) == 'X' ? 16 : 8;
+ else
+ base = 10;
+ }
+ if (base == 16 && *s == '0' && toupper(s[1]) == 'X')
+ s += 2;
+
+ n = 0;
+ /* Compute n as a negative number to avoid overflow on LONG_MIN */
+ for (t = s; p = strchr(digits, toupper(*t)); ++t) {
+ if ((d = p - digits) >= base)
+ break;
+ if (n < LONG_MIN/base)
+ goto overflow;
+ n *= base;
+ if (-d < LONG_MIN - n)
+ goto overflow;
+ n -= d;
+ }
+
+ if (n == LONG_MIN && sign < 0) {
+ --t;
+ goto overflow;
+ }
+
+ if (end && t != s)
+ *end = t;
+
+ return n*sign;
+
+overflow:
+ if (end)
+ *end = t;
+ errno = ERANGE;
+
+ return sign < 0 ? LONG_MAX : LONG_MIN;
+}
--- /dev/null
+++ b/src/libc/stdlib/strtoll.c
@@ -1,0 +1,68 @@
+#include <ctype.h>
+#include <errno.h>
+#include <limits.h>
+#include <stdlib.h>
+#include <string.h>
+
+#undef strtoll
+
+long long
+strtoll(const char *s, char **end, int base)
+{
+ int d, sign = -1;
+ long long n;
+ static const char digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
+ const char *t, *p;
+
+ if (end)
+ *end = s;
+
+ while (isspace(*s))
+ ++s;
+
+ switch (*s) {
+ case '-':
+ sign = 1;
+ case '+':
+ ++s;
+ }
+
+ if (base == 0) {
+ if (*s == '0')
+ base = toupper(s[1]) == 'X' ? 16 : 8;
+ else
+ base = 10;
+ }
+ if (base == 16 && *s == '0' && toupper(s[1]) == 'X')
+ s += 2;
+
+ n = 0;
+ /* Compute n as a negative number to avoid overflow on LLONG_MIN */
+ for (t = s; p = strchr(digits, toupper(*t)); ++t) {
+ if ((d = p - digits) >= base)
+ break;
+ if (n < LLONG_MIN/base)
+ goto overflow;
+ n *= base;
+ if (-d < LLONG_MIN - n)
+ goto overflow;
+ n -= d;
+ }
+
+ if (n == LLONG_MIN && sign < 0) {
+ --t;
+ goto overflow;
+ }
+
+ if (end && t != s)
+ *end = t;
+
+ return n*sign;
+
+overflow:
+ if (end)
+ *end = t;
+ errno = ERANGE;
+
+ return sign < 0 ? LLONG_MAX : LLONG_MIN;
+}