Home | History | Annotate | Line # | Download | only in stdlib
strtoq.c revision 1.17 
      1 /*	$NetBSD: strtoq.c,v 1.17 2005/11/29 03:12:00 christos Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1992, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. Neither the name of the University nor the names of its contributors
     16  *    may be used to endorse or promote products derived from this software
     17  *    without specific prior written permission.
     18  *
     19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29  * SUCH DAMAGE.
     30  */
     31 
     32 #include <sys/cdefs.h>
     33 #if defined(LIBC_SCCS) && !defined(lint)
     34 #if 0
     35 static char sccsid[] = "@(#)strtoq.c	8.1 (Berkeley) 6/4/93";
     36 #else
     37 __RCSID("$NetBSD: strtoq.c,v 1.17 2005/11/29 03:12:00 christos Exp $");
     38 #endif
     39 #endif /* LIBC_SCCS and not lint */
     40 
     41 #include <sys/types.h>
     42 
     43 #include <assert.h>
     44 #include <ctype.h>
     45 #include <errno.h>
     46 #include <limits.h>
     47 #include <stdlib.h>
     48 
     49 /*
     50  * Convert a string to a quad integer.
     51  *
     52  * Ignores `locale' stuff.  Assumes that the upper and lower case
     53  * alphabets and digits are each contiguous.
     54  */
     55 quad_t
     56 strtoq(nptr, endptr, base)
     57 	const char *nptr;
     58 	char **endptr;
     59 	int base;
     60 {
     61 	const char *s;
     62 	quad_t acc, cutoff;
     63 	int c;
     64 	int neg, any, cutlim;
     65 
     66 	_DIAGASSERT(nptr != NULL);
     67 	/* endptr may be NULL */
     68 
     69 #ifdef __GNUC__
     70 	/* This outrageous construct just to shut up a GCC warning. */
     71 	(void) &acc; (void) &cutoff;
     72 #endif
     73 
     74 	/*
     75 	 * Skip white space and pick up leading +/- sign if any.
     76 	 * If base is 0, allow 0x for hex and 0 for octal, else
     77 	 * assume decimal; if base is already 16, allow 0x.
     78 	 */
     79 	s = nptr;
     80 	do {
     81 		c = (unsigned char) *s++;
     82 	} while (isspace(c));
     83 	if (c == '-') {
     84 		neg = 1;
     85 		c = *s++;
     86 	} else {
     87 		neg = 0;
     88 		if (c == '+')
     89 			c = *s++;
     90 	}
     91 	if ((base == 0 || base == 16) &&
     92 	    c == '0' && (*s == 'x' || *s == 'X')) {
     93 		c = s[1];
     94 		s += 2;
     95 		base = 16;
     96 	}
     97 	if (base == 0)
     98 		base = c == '0' ? 8 : 10;
     99 
    100 	/*
    101 	 * Compute the cutoff value between legal numbers and illegal
    102 	 * numbers.  That is the largest legal value, divided by the
    103 	 * base.  An input number that is greater than this value, if
    104 	 * followed by a legal input character, is too big.  One that
    105 	 * is equal to this value may be valid or not; the limit
    106 	 * between valid and invalid numbers is then based on the last
    107 	 * digit.  For instance, if the range for quads is
    108 	 * [-9223372036854775808..9223372036854775807] and the input base
    109 	 * is 10, cutoff will be set to 922337203685477580 and cutlim to
    110 	 * either 7 (neg==0) or 8 (neg==1), meaning that if we have
    111 	 * accumulated a value > 922337203685477580, or equal but the
    112 	 * next digit is > 7 (or 8), the number is too big, and we will
    113 	 * return a range error.
    114 	 *
    115 	 * Set any if any `digits' consumed; make it negative to indicate
    116 	 * overflow.
    117 	 */
    118 	cutoff = neg ? QUAD_MIN : QUAD_MAX;
    119 	cutlim = (int)(cutoff % base);
    120 	cutoff /= base;
    121 	if (neg) {
    122 		if (cutlim > 0) {
    123 			cutlim -= base;
    124 			cutoff += 1;
    125 		}
    126 		cutlim = -cutlim;
    127 	}
    128 	for (acc = 0, any = 0;; c = (unsigned char) *s++) {
    129 		if (isdigit(c))
    130 			c -= '0';
    131 		else if (isalpha(c))
    132 			c -= isupper(c) ? 'A' - 10 : 'a' - 10;
    133 		else
    134 			break;
    135 		if (c >= base)
    136 			break;
    137 		if (any < 0)
    138 			continue;
    139 		if (neg) {
    140 			if (acc < cutoff || (acc == cutoff && c > cutlim)) {
    141 				any = -1;
    142 				acc = QUAD_MIN;
    143 				errno = ERANGE;
    144 			} else {
    145 				any = 1;
    146 				acc *= base;
    147 				acc -= c;
    148 			}
    149 		} else {
    150 			if (acc > cutoff || (acc == cutoff && c > cutlim)) {
    151 				any = -1;
    152 				acc = QUAD_MAX;
    153 				errno = ERANGE;
    154 			} else {
    155 				any = 1;
    156 				acc *= base;
    157 				acc += c;
    158 			}
    159 		}
    160 	}
    161 	if (endptr != 0)
    162 		*endptr = __UNCONST(any ? s - 1 : nptr);
    163 	return (acc);
    164 }
    165