@ -0,0 +1,66 @@ | |||
.\" Copyright (c) 1990, 1991 The Regents of the University of California. | |||
.\" All rights reserved. | |||
.\" | |||
.\" This code is derived from software contributed to Berkeley by | |||
.\" the American National Standards Committee X3, on Information | |||
.\" Processing Systems. | |||
.\" | |||
.\" 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. 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. | |||
.\" | |||
.\" $OpenBSD: imaxabs.3,v 1.1 2006/01/13 17:58:09 millert Exp $ | |||
.\" | |||
.Dd January 6, 2005 | |||
.Dt IMAXABS 3 | |||
.Os | |||
.Sh NAME | |||
.Nm imaxabs | |||
.Nd integer absolute value function | |||
.Sh SYNOPSIS | |||
.Fd #include <inttypes.h> | |||
.Ft int | |||
.Fn imaxabs "int j" | |||
.Sh DESCRIPTION | |||
The | |||
.Fn imaxabs | |||
function computes the absolute value of the intmax_t variable | |||
.Fa j . | |||
.Sh RETURN VALUES | |||
The | |||
.Fn imaxabs | |||
function returns the absolute value. | |||
.Sh SEE ALSO | |||
.Xr abs 3 , | |||
.Xr cabs 3 , | |||
.Xr floor 3 , | |||
.Xr hypot 3 , | |||
.Xr labs 3 , | |||
.Xr math 3 | |||
.Sh STANDARDS | |||
The | |||
.Fn abs | |||
function conforms to | |||
.St -ansiC-99 . | |||
.Sh BUGS | |||
The absolute value of the most negative integer remains negative. |
@ -0,0 +1,38 @@ | |||
/* $OpenBSD: imaxabs.c,v 1.1 2006/01/13 17:58:09 millert Exp $ */ | |||
/*- | |||
* Copyright (c) 1990 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. 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. | |||
*/ | |||
#include <inttypes.h> | |||
intmax_t | |||
imaxabs(intmax_t j) | |||
{ | |||
return (j < 0 ? -j : j); | |||
} |
@ -0,0 +1,67 @@ | |||
.\" Copyright (c) 1990, 1991 The Regents of the University of California. | |||
.\" All rights reserved. | |||
.\" | |||
.\" This code is derived from software contributed to Berkeley by | |||
.\" Chris Torek and the American National Standards Committee X3, | |||
.\" on Information Processing Systems. | |||
.\" | |||
.\" 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. 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. | |||
.\" | |||
.\" $OpenBSD: imaxdiv.3,v 1.1 2006/01/13 17:58:09 millert Exp $ | |||
.\" | |||
.Dd January 3, 2006 | |||
.Dt IMAXDIV 3 | |||
.Os | |||
.Sh NAME | |||
.Nm imaxdiv | |||
.Nd return quotient and remainder from division | |||
.Sh SYNOPSIS | |||
.Fd #include <inttypes.h> | |||
.Ft imaxdiv_t | |||
.Fn ldiv "intmax_t num" "intmax_t denom" | |||
.Sh DESCRIPTION | |||
The | |||
.Fn imaxdiv | |||
function computes the value | |||
.Fa num Ns / Ns Fa denom | |||
and returns the quotient and remainder in a structure named | |||
.Li imaxdiv_t | |||
that contains two | |||
.Li intmax_t | |||
members named | |||
.Fa quot | |||
and | |||
.Fa rem . | |||
.Sh SEE ALSO | |||
.Xr div 3 , | |||
.Xr ldiv 3 , | |||
.Xr lldiv 3 , | |||
.Xr math 3 , | |||
.Xr qdiv 3 | |||
.Sh STANDARDS | |||
The | |||
.Fn imaxdiv | |||
function conforms to | |||
.St -ansiC-99 . |
@ -0,0 +1,50 @@ | |||
/* $OpenBSD: imaxdiv.c,v 1.1 2006/01/13 17:58:09 millert Exp $ */ | |||
/* | |||
* Copyright (c) 1990 Regents of the University of California. | |||
* All rights reserved. | |||
* | |||
* This code is derived from software contributed to Berkeley by | |||
* Chris Torek. | |||
* | |||
* 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. 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. | |||
*/ | |||
#include <inttypes.h> /* imaxdiv_t */ | |||
imaxdiv_t | |||
imaxdiv(intmax_t num, intmax_t denom) | |||
{ | |||
imaxdiv_t r; | |||
/* see div.c for comments */ | |||
r.quot = num / denom; | |||
r.rem = num % denom; | |||
if (num >= 0 && r.rem < 0) { | |||
r.quot++; | |||
r.rem -= denom; | |||
} | |||
return (r); | |||
} |
@ -0,0 +1,67 @@ | |||
.\" Copyright (c) 1990, 1991 The Regents of the University of California. | |||
.\" All rights reserved. | |||
.\" | |||
.\" This code is derived from software contributed to Berkeley by | |||
.\" Chris Torek and the American National Standards Committee X3, | |||
.\" on Information Processing Systems. | |||
.\" | |||
.\" 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. 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. | |||
.\" | |||
.\" $OpenBSD: lldiv.3,v 1.1 2006/01/13 17:58:09 millert Exp $ | |||
.\" | |||
.Dd January 3, 2006 | |||
.Dt LLDIV 3 | |||
.Os | |||
.Sh NAME | |||
.Nm lldiv | |||
.Nd return quotient and remainder from division | |||
.Sh SYNOPSIS | |||
.Fd #include <stdlib.h> | |||
.Ft lldiv_t | |||
.Fn lldiv "long long num" "long long denom" | |||
.Sh DESCRIPTION | |||
The | |||
.Fn lldiv | |||
function computes the value | |||
.Fa num Ns / Ns Fa denom | |||
and returns the quotient and remainder in a structure named | |||
.Li lldiv_t | |||
that contains two | |||
.Li long long integer | |||
members named | |||
.Fa quot | |||
and | |||
.Fa rem . | |||
.Sh SEE ALSO | |||
.Xr div 3 , | |||
.Xr imaxdiv 3 , | |||
.Xr ldiv 3 , | |||
.Xr math 3 , | |||
.Xr qdiv 3 | |||
.Sh STANDARDS | |||
The | |||
.Fn lldiv | |||
function conforms to | |||
.St -ansiC-99 . |
@ -0,0 +1,50 @@ | |||
/* $OpenBSD: lldiv.c,v 1.1 2006/01/13 17:58:09 millert Exp $ */ | |||
/* | |||
* Copyright (c) 1990 Regents of the University of California. | |||
* All rights reserved. | |||
* | |||
* This code is derived from software contributed to Berkeley by | |||
* Chris Torek. | |||
* | |||
* 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. 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. | |||
*/ | |||
#include <stdlib.h> /* lldiv_t */ | |||
lldiv_t | |||
lldiv(long long num, long long denom) | |||
{ | |||
lldiv_t r; | |||
/* see div.c for comments */ | |||
r.quot = num / denom; | |||
r.rem = num % denom; | |||
if (num >= 0 && r.rem < 0) { | |||
r.quot++; | |||
r.rem -= denom; | |||
} | |||
return (r); | |||
} |
@ -0,0 +1,140 @@ | |||
/* $OpenBSD: strtoimax.c,v 1.1 2006/01/13 17:58:09 millert Exp $ */ | |||
/*- | |||
* Copyright (c) 1992 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. 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. | |||
*/ | |||
#include <ctype.h> | |||
#include <errno.h> | |||
#include <inttypes.h> | |||
/* | |||
* Convert a string to an intmax_t | |||
* | |||
* Ignores `locale' stuff. Assumes that the upper and lower case | |||
* alphabets and digits are each contiguous. | |||
*/ | |||
intmax_t | |||
strtoimax(const char *nptr, char **endptr, int base) | |||
{ | |||
const char *s; | |||
intmax_t acc, cutoff; | |||
int c; | |||
int neg, any, cutlim; | |||
/* | |||
* Skip white space and pick up leading +/- sign if any. | |||
* If base is 0, allow 0x for hex and 0 for octal, else | |||
* assume decimal; if base is already 16, allow 0x. | |||
*/ | |||
s = nptr; | |||
do { | |||
c = (unsigned char) *s++; | |||
} while (isspace(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; | |||
/* | |||
* Compute the cutoff value between legal numbers and illegal | |||
* numbers. That is the largest legal value, divided by the | |||
* base. An input number that is greater than this value, if | |||
* followed by a legal input character, is too big. One that | |||
* is equal to this value may be valid or not; the limit | |||
* between valid and invalid numbers is then based on the last | |||
* digit. For instance, if the range for intmax_t is | |||
* [-9223372036854775808..9223372036854775807] and the input base | |||
* is 10, cutoff will be set to 922337203685477580 and cutlim to | |||
* either 7 (neg==0) or 8 (neg==1), meaning that if we have | |||
* accumulated a value > 922337203685477580, or equal but the | |||
* next digit is > 7 (or 8), the number is too big, and we will | |||
* return a range error. | |||
* | |||
* Set any if any `digits' consumed; make it negative to indicate | |||
* overflow. | |||
*/ | |||
cutoff = neg ? INTMAX_MIN : INTMAX_MAX; | |||
cutlim = cutoff % base; | |||
cutoff /= base; | |||
if (neg) { | |||
if (cutlim > 0) { | |||
cutlim -= base; | |||
cutoff += 1; | |||
} | |||
cutlim = -cutlim; | |||
} | |||
for (acc = 0, any = 0;; c = (unsigned char) *s++) { | |||
if (isdigit(c)) | |||
c -= '0'; | |||
else if (isalpha(c)) | |||
c -= isupper(c) ? 'A' - 10 : 'a' - 10; | |||
else | |||
break; | |||
if (c >= base) | |||
break; | |||
if (any < 0) | |||
continue; | |||
if (neg) { | |||
if (acc < cutoff || (acc == cutoff && c > cutlim)) { | |||
any = -1; | |||
acc = INTMAX_MIN; | |||
errno = ERANGE; | |||
} else { | |||
any = 1; | |||
acc *= base; | |||
acc -= c; | |||
} | |||
} else { | |||
if (acc > cutoff || (acc == cutoff && c > cutlim)) { | |||
any = -1; | |||
acc = INTMAX_MAX; | |||
errno = ERANGE; | |||
} else { | |||
any = 1; | |||
acc *= base; | |||
acc += c; | |||
} | |||
} | |||
} | |||
if (endptr != 0) | |||
*endptr = (char *) (any ? s - 1 : nptr); | |||
return (acc); | |||
} |
@ -0,0 +1,102 @@ | |||
/* $OpenBSD: strtoumax.c,v 1.1 2006/01/13 17:58:09 millert Exp $ */ | |||
/*- | |||
* Copyright (c) 1992 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. 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. | |||
*/ | |||
#include <ctype.h> | |||
#include <errno.h> | |||
#include <inttypes.h> | |||
/* | |||
* Convert a string to a uintmax_t. | |||
* | |||
* Ignores `locale' stuff. Assumes that the upper and lower case | |||
* alphabets and digits are each contiguous. | |||
*/ | |||
uintmax_t | |||
strtoumax(const char *nptr, char **endptr, int base) | |||
{ | |||
const char *s; | |||
uintmax_t acc, cutoff; | |||
int c; | |||
int neg, any, cutlim; | |||
/* | |||
* See strtoq for comments as to the logic used. | |||
*/ | |||
s = nptr; | |||
do { | |||
c = (unsigned char) *s++; | |||
} while (isspace(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; | |||
cutoff = UINTMAX_MAX / (uintmax_t)base; | |||
cutlim = UINTMAX_MAX % (uintmax_t)base; | |||
for (acc = 0, any = 0;; c = (unsigned char) *s++) { | |||
if (isdigit(c)) | |||
c -= '0'; | |||
else if (isalpha(c)) | |||
c -= isupper(c) ? 'A' - 10 : 'a' - 10; | |||
else | |||
break; | |||
if (c >= base) | |||
break; | |||
if (any < 0) | |||
continue; | |||
if (acc > cutoff || (acc == cutoff && c > cutlim)) { | |||
any = -1; | |||
acc = UINTMAX_MAX; | |||
errno = ERANGE; | |||
} else { | |||
any = 1; | |||
acc *= (uintmax_t)base; | |||
acc += c; | |||
} | |||
} | |||
if (neg && any > 0) | |||
acc = -acc; | |||
if (endptr != 0) | |||
*endptr = (char *) (any ? s - 1 : nptr); | |||
return (acc); | |||
} |