OpenCores
URL https://opencores.org/ocsvn/or1k_old/or1k_old/trunk

Subversion Repositories or1k_old

[/] [or1k_old/] [trunk/] [insight/] [libiberty/] [strtol.c] - Blame information for rev 1782

Details | Compare with Previous | View Log

Line No. Rev Author Line
1 578 markom
/*-
2
 * Copyright (c) 1990 The Regents of the University of California.
3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 * 1. Redistributions of source code must retain the above copyright
9
 *    notice, this list of conditions and the following disclaimer.
10
 * 2. Redistributions in binary form must reproduce the above copyright
11
 *    notice, this list of conditions and the following disclaimer in the
12
 *    documentation and/or other materials provided with the distribution.
13
 * 3. [rescinded 22 July 1999]
14
 * 4. Neither the name of the University nor the names of its contributors
15
 *    may be used to endorse or promote products derived from this software
16
 *    without specific prior written permission.
17
 *
18
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
19
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28
 * SUCH DAMAGE.
29
 */
30
 
31
#ifdef HAVE_CONFIG_H
32
#include "config.h"
33
#endif
34
#ifdef HAVE_LIMITS_H
35
#include <limits.h>
36
#endif
37
#ifdef HAVE_SYS_PARAM_H
38
#include <sys/param.h>
39
#endif
40
#include <errno.h>
41
#ifdef NEED_DECLARATION_ERRNO
42
extern int errno;
43
#endif
44
#include "safe-ctype.h"
45
 
46
/* FIXME: It'd be nice to configure around these, but the include files are too
47
   painful.  These macros should at least be more portable than hardwired hex
48
   constants. */
49
 
50
#ifndef ULONG_MAX
51
#define ULONG_MAX       ((unsigned long)(~0L))          /* 0xFFFFFFFF */
52
#endif
53
 
54
#ifndef LONG_MAX
55
#define LONG_MAX        ((long)(ULONG_MAX >> 1))        /* 0x7FFFFFFF */
56
#endif
57
 
58
#ifndef LONG_MIN
59
#define LONG_MIN        ((long)(~LONG_MAX))             /* 0x80000000 */
60
#endif
61
 
62
/*
63
 * Convert a string to a long integer.
64
 *
65
 * Ignores `locale' stuff.  Assumes that the upper and lower case
66
 * alphabets and digits are each contiguous.
67
 */
68
long
69
strtol(nptr, endptr, base)
70
        const char *nptr;
71
        char **endptr;
72
        register int base;
73
{
74
        register const char *s = nptr;
75
        register unsigned long acc;
76
        register int c;
77
        register unsigned long cutoff;
78
        register int neg = 0, any, cutlim;
79
 
80
        /*
81
         * Skip white space and pick up leading +/- sign if any.
82
         * If base is 0, allow 0x for hex and 0 for octal, else
83
         * assume decimal; if base is already 16, allow 0x.
84
         */
85
        do {
86
                c = *s++;
87
        } while (ISSPACE(c));
88
        if (c == '-') {
89
                neg = 1;
90
                c = *s++;
91
        } else if (c == '+')
92
                c = *s++;
93
        if ((base == 0 || base == 16) &&
94
            c == '0' && (*s == 'x' || *s == 'X')) {
95
                c = s[1];
96
                s += 2;
97
                base = 16;
98
        }
99
        if (base == 0)
100
                base = c == '0' ? 8 : 10;
101
 
102
        /*
103
         * Compute the cutoff value between legal numbers and illegal
104
         * numbers.  That is the largest legal value, divided by the
105
         * base.  An input number that is greater than this value, if
106
         * followed by a legal input character, is too big.  One that
107
         * is equal to this value may be valid or not; the limit
108
         * between valid and invalid numbers is then based on the last
109
         * digit.  For instance, if the range for longs is
110
         * [-2147483648..2147483647] and the input base is 10,
111
         * cutoff will be set to 214748364 and cutlim to either
112
         * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
113
         * a value > 214748364, or equal but the next digit is > 7 (or 8),
114
         * the number is too big, and we will return a range error.
115
         *
116
         * Set any if any `digits' consumed; make it negative to indicate
117
         * overflow.
118
         */
119
        cutoff = neg ? -(unsigned long)LONG_MIN : LONG_MAX;
120
        cutlim = cutoff % (unsigned long)base;
121
        cutoff /= (unsigned long)base;
122
        for (acc = 0, any = 0;; c = *s++) {
123
                if (ISDIGIT(c))
124
                        c -= '0';
125
                else if (ISALPHA(c))
126
                        c -= ISUPPER(c) ? 'A' - 10 : 'a' - 10;
127
                else
128
                        break;
129
                if (c >= base)
130
                        break;
131
                if (any < 0 || acc > cutoff || acc == cutoff && c > cutlim)
132
                        any = -1;
133
                else {
134
                        any = 1;
135
                        acc *= base;
136
                        acc += c;
137
                }
138
        }
139
        if (any < 0) {
140
                acc = neg ? LONG_MIN : LONG_MAX;
141
                errno = ERANGE;
142
        } else if (neg)
143
                acc = -acc;
144
        if (endptr != 0)
145
                *endptr = (char *) (any ? s - 1 : nptr);
146
        return (acc);
147
}

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.