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