/src/dcmtk/oficonv/libsrc/citrus_strtol.h
Line | Count | Source |
1 | | /*- |
2 | | * Copyright (c) 1990, 1993 |
3 | | * The Regents of the University of California. 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. Neither the name of the University nor the names of its contributors |
14 | | * may be used to endorse or promote products derived from this software |
15 | | * without specific prior written permission. |
16 | | * |
17 | | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
18 | | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
19 | | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
20 | | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
21 | | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
22 | | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
23 | | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
24 | | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
25 | | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
26 | | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
27 | | * SUCH DAMAGE. |
28 | | * |
29 | | * Original version ID: |
30 | | * NetBSD: src/lib/libc/locale/_wcstol.h,v 1.2 2003/08/07 16:43:03 agc Exp |
31 | | */ |
32 | | |
33 | | #include "dcmtk/config/osconfig.h" |
34 | | |
35 | | /* |
36 | | * function template for strtol, strtoll and strtoimax. |
37 | | * |
38 | | * parameters: |
39 | | * _FUNCNAME : function name |
40 | | * __INT : return type |
41 | | * INT_MIN : lower limit of the return type |
42 | | * INT_MAX : upper limit of the return type |
43 | | */ |
44 | | |
45 | | __INT |
46 | | _FUNCNAME(const char *nptr, char **endptr, int base) |
47 | 0 | { |
48 | 0 | const char *s; |
49 | 0 | __INT acc, cutoff; |
50 | 0 | unsigned char c; |
51 | 0 | int any, cutlim, i, neg; |
52 | | |
53 | | /* check base value */ |
54 | 0 | if (base && (base < 2 || base > 36)) { |
55 | 0 | errno = EINVAL; |
56 | 0 | if (endptr != NULL) |
57 | | /* LINTED interface specification */ |
58 | 0 | *endptr = CITRUS_DECONST(void *, nptr); |
59 | 0 | return (0); |
60 | 0 | } |
61 | | |
62 | | /* |
63 | | * Skip white space and pick up leading +/- sign if any. |
64 | | * If base is 0, allow 0x for hex and 0 for octal, else |
65 | | * assume decimal; if base is already 16, allow 0x. |
66 | | */ |
67 | 0 | s = nptr; |
68 | 0 | do { |
69 | 0 | c = *s++; |
70 | 0 | } while (isspace(c)); |
71 | 0 | if (c == '-') { |
72 | 0 | neg = 1; |
73 | 0 | c = *s++; |
74 | 0 | } else { |
75 | 0 | neg = 0; |
76 | 0 | if (c == '+') |
77 | 0 | c = *s++; |
78 | 0 | } |
79 | 0 | if ((base == 0 || base == 16) && |
80 | 0 | c == '0' && (*s == 'x' || *s == 'X')) { |
81 | 0 | c = s[1]; |
82 | 0 | s += 2; |
83 | 0 | base = 16; |
84 | 0 | } |
85 | 0 | if (base == 0) |
86 | 0 | base = (c == '0' ? 8 : 10); |
87 | | |
88 | | /* |
89 | | * Compute the cutoff value between legal numbers and illegal |
90 | | * numbers. That is the largest legal value, divided by the |
91 | | * base. An input number that is greater than this value, if |
92 | | * followed by a legal input character, is too big. One that |
93 | | * is equal to this value may be valid or not; the limit |
94 | | * between valid and invalid numbers is then based on the last |
95 | | * digit. For instance, if the range for longs is |
96 | | * [-2147483648..2147483647] and the input base is 10, |
97 | | * cutoff will be set to 214748364 and cutlim to either |
98 | | * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated |
99 | | * a value > 214748364, or equal but the next digit is > 7 (or 8), |
100 | | * the number is too big, and we will return a range error. |
101 | | * |
102 | | * Set any if any `digits' consumed; make it negative to indicate |
103 | | * overflow. |
104 | | */ |
105 | 0 | cutoff = (neg ? INT_MIN : INT_MAX); |
106 | 0 | cutlim = (int)(cutoff % base); |
107 | 0 | cutoff /= base; |
108 | 0 | if (neg) { |
109 | 0 | if (cutlim > 0) { |
110 | 0 | cutlim -= base; |
111 | 0 | cutoff += 1; |
112 | 0 | } |
113 | 0 | cutlim = -cutlim; |
114 | 0 | } |
115 | 0 | for (acc = 0, any = 0;; c = *s++) { |
116 | 0 | if (isdigit(c)) |
117 | 0 | i = c - '0'; |
118 | 0 | else if (isalpha(c)) |
119 | 0 | i = c - (isupper(c) ? 'A' - 10 : 'a' - 10); |
120 | 0 | else |
121 | 0 | break; |
122 | 0 | if (i >= base) |
123 | 0 | break; |
124 | 0 | if (any < 0) |
125 | 0 | continue; |
126 | 0 | if (neg) { |
127 | 0 | if (acc < cutoff || (acc == cutoff && i > cutlim)) { |
128 | 0 | acc = INT_MIN; |
129 | 0 | any = -1; |
130 | 0 | errno = ERANGE; |
131 | 0 | } else { |
132 | 0 | any = 1; |
133 | 0 | acc *= base; |
134 | 0 | acc -= i; |
135 | 0 | } |
136 | 0 | } else { |
137 | 0 | if (acc > cutoff || (acc == cutoff && i > cutlim)) { |
138 | 0 | acc = INT_MAX; |
139 | 0 | any = -1; |
140 | 0 | errno = ERANGE; |
141 | 0 | } else { |
142 | 0 | any = 1; |
143 | 0 | acc *= base; |
144 | 0 | acc += i; |
145 | 0 | } |
146 | 0 | } |
147 | 0 | } |
148 | 0 | if (endptr != NULL) |
149 | | /* LINTED interface specification */ |
150 | 0 | *endptr = CITRUS_DECONST(void *, any ? s - 1 : nptr); |
151 | 0 | return(acc); |
152 | 0 | } |