78591cea48
MariaDB is a fork of MySQL relational database management system. It is an enhanced, drop-in replacement for MySQL. This package contains client libraries.
136 lines
4 KiB
C
136 lines
4 KiB
C
$NetBSD: patch-strtoull.c,v 1.1 2015/04/16 20:20:15 ryoon Exp $
|
|
|
|
--- strtoull.c.orig 2015-04-15 18:31:28.000000000 +0000
|
|
+++ strtoull.c
|
|
@@ -0,0 +1,131 @@
|
|
+/*-
|
|
+ * Copyright (c) 1992, 1993
|
|
+ * The Regents of the University of California. All rights reserved.
|
|
+ *
|
|
+ * Redistribution and use in source and binary forms, with or without
|
|
+ * modification, are permitted provided that the following conditions
|
|
+ * are met:
|
|
+ * 1. Redistributions of source code must retain the above copyright
|
|
+ * notice, this list of conditions and the following disclaimer.
|
|
+ * 2. Redistributions in binary form must reproduce the above copyright
|
|
+ * notice, this list of conditions and the following disclaimer in the
|
|
+ * documentation and/or other materials provided with the distribution.
|
|
+ * 3. All advertising materials mentioning features or use of this software
|
|
+ * must display the following acknowledgement:
|
|
+ * This product includes software developed by the University of
|
|
+ * California, Berkeley and its contributors.
|
|
+ * 4. Neither the name of the University nor the names of its contributors
|
|
+ * may be used to endorse or promote products derived from this software
|
|
+ * without specific prior written permission.
|
|
+ *
|
|
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
+ * SUCH DAMAGE.
|
|
+ */
|
|
+
|
|
+#if defined(LIBC_SCCS) && !defined(lint)
|
|
+static char sccsid[] = "@(#)strtouq.c 8.1 (Berkeley) 6/4/93";
|
|
+#endif /* LIBC_SCCS and not lint */
|
|
+#include <sys/cdefs.h>
|
|
+/*__FBSDID("$FreeBSD: src/lib/libc/stdlib/strtoull.c,v 1.18 2002/09/06 11:23:59 tjr Exp $"); */
|
|
+
|
|
+#include <limits.h>
|
|
+#include <errno.h>
|
|
+#include <ctype.h>
|
|
+#include <stdlib.h>
|
|
+
|
|
+#if !defined(LLONG_MAX)
|
|
+#define LLONG_MAX 0x7fffffffffffffffLL
|
|
+#endif
|
|
+
|
|
+#if !defined(LLONG_MIN)
|
|
+#define LLONG_MIN -0x7fffffffffffffffLL-1
|
|
+#endif
|
|
+
|
|
+#if !defined(ULLONG_MAX)
|
|
+#define ULLONG_MAX 0xffffffffffffffffULL
|
|
+#endif
|
|
+
|
|
+/*
|
|
+ * Convert a string to an unsigned long long integer.
|
|
+ *
|
|
+ * Assumes that the upper and lower case
|
|
+ * alphabets and digits are each contiguous.
|
|
+ */
|
|
+unsigned long long
|
|
+pkgsrc_strtoull(const char * __restrict nptr, char ** __restrict endptr, int base)
|
|
+{
|
|
+ const char *s;
|
|
+ unsigned long long acc;
|
|
+ char c;
|
|
+ unsigned long long cutoff;
|
|
+ int neg, any, cutlim;
|
|
+
|
|
+ /*
|
|
+ * See strtoq for comments as to the logic used.
|
|
+ */
|
|
+ s = nptr;
|
|
+ do {
|
|
+ c = *s++;
|
|
+ } while (isspace((unsigned char)c));
|
|
+ if (c == '-') {
|
|
+ neg = 1;
|
|
+ c = *s++;
|
|
+ } else {
|
|
+ neg = 0;
|
|
+ if (c == '+')
|
|
+ c = *s++;
|
|
+ }
|
|
+ if ((base == 0 || base == 16) &&
|
|
+ c == '0' && (*s == 'x' || *s == 'X')) {
|
|
+ c = s[1];
|
|
+ s += 2;
|
|
+ base = 16;
|
|
+ }
|
|
+ if (base == 0)
|
|
+ base = c == '0' ? 8 : 10;
|
|
+ acc = any = 0;
|
|
+ if (base < 2 || base > 36)
|
|
+ goto noconv;
|
|
+
|
|
+ cutoff = ULLONG_MAX / base;
|
|
+ cutlim = ULLONG_MAX % base;
|
|
+ for ( ; ; c = *s++) {
|
|
+ if (c >= '0' && c <= '9')
|
|
+ c -= '0';
|
|
+ else if (c >= 'A' && c <= 'Z')
|
|
+ c -= 'A' - 10;
|
|
+ else if (c >= 'a' && c <= 'z')
|
|
+ c -= 'a' - 10;
|
|
+ else
|
|
+ break;
|
|
+ if (c >= base)
|
|
+ break;
|
|
+ if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
|
+ any = -1;
|
|
+ else {
|
|
+ any = 1;
|
|
+ acc *= base;
|
|
+ acc += c;
|
|
+ }
|
|
+ }
|
|
+ if (any < 0) {
|
|
+ acc = ULLONG_MAX;
|
|
+ errno = ERANGE;
|
|
+ } else if (!any) {
|
|
+noconv:
|
|
+ errno = EINVAL;
|
|
+ } else if (neg)
|
|
+ acc = -acc;
|
|
+ if (endptr != NULL)
|
|
+ *endptr = (char *)(any ? s - 1 : nptr);
|
|
+ return (acc);
|
|
+}
|