1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
5 -- S Y S T E M . V A L _ U N S --
9 -- Copyright (C) 1992-2012, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
27 -- GNAT was originally developed by the GNAT team at New York University. --
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
30 ------------------------------------------------------------------------------
32 with System
.Unsigned_Types
; use System
.Unsigned_Types
;
33 with System
.Val_Util
; use System
.Val_Util
;
35 package body System
.Val_Uns
is
37 -----------------------
38 -- Scan_Raw_Unsigned --
39 -----------------------
41 function Scan_Raw_Unsigned
43 Ptr
: not null access Integer;
44 Max
: Integer) return Unsigned
47 -- Local copy of the pointer
50 -- Accumulated unsigned integer result
55 Overflow
: Boolean := False;
56 -- Set True if overflow is detected at any point
58 Base_Char
: Character;
59 -- Base character (# or :) in based case
61 Base
: Unsigned
:= 10;
62 -- Base value (reset in based case)
69 Uval
:= Character'Pos (Str
(P
)) - Character'Pos ('0');
72 -- Scan out digits of what is either the number or the base.
73 -- In either case, we are definitely scanning out in base 10.
76 Umax
: constant := (Unsigned
'Last - 9) / 10;
77 -- Max value which cannot overflow on accumulating next digit
79 Umax10
: constant := Unsigned
'Last / 10;
80 -- Numbers bigger than Umax10 overflow if multiplied by 10
83 -- Loop through decimal digits
87 Digit
:= Character'Pos (Str
(P
)) - Character'Pos ('0');
89 -- Non-digit encountered
93 Scan_Underscore
(Str
, P
, Ptr
, Max
, False);
98 -- Accumulate result, checking for overflow
102 Uval
:= 10 * Uval
+ Digit
;
104 elsif Uval
> Umax10
then
108 Uval
:= 10 * Uval
+ Digit
;
110 if Uval
< Umax10
then
122 -- Deal with based case
124 if P
< Max
and then (Str
(P
) = ':' or else Str
(P
) = '#') then
125 Base_Char
:= Str
(P
);
130 -- Check base value. Overflow is set True if we find a bad base, or
131 -- a digit that is out of range of the base. That way, we scan out
132 -- the numeral that is still syntactically correct, though illegal.
133 -- We use a safe base of 16 for this scan, to avoid zero divide.
135 if Base
not in 2 .. 16 then
140 -- Scan out based integer
143 Umax
: constant Unsigned
:= (Unsigned
'Last - Base
+ 1) / Base
;
144 -- Max value which cannot overflow on accumulating next digit
146 UmaxB
: constant Unsigned
:= Unsigned
'Last / Base
;
147 -- Numbers bigger than UmaxB overflow if multiplied by base
150 -- Loop to scan out based integer value
153 -- We require a digit at this stage
155 if Str
(P
) in '0' .. '9' then
156 Digit
:= Character'Pos (Str
(P
)) - Character'Pos ('0');
158 elsif Str
(P
) in 'A' .. 'F' then
160 Character'Pos (Str
(P
)) - (Character'Pos ('A') - 10);
162 elsif Str
(P
) in 'a' .. 'f' then
164 Character'Pos (Str
(P
)) - (Character'Pos ('a') - 10);
166 -- If we don't have a digit, then this is not a based number
167 -- after all, so we use the value we scanned out as the base
168 -- (now in Base), and the pointer to the base character was
169 -- already stored in Ptr.all.
176 -- If digit is too large, just signal overflow and continue.
177 -- The idea here is to keep scanning as long as the input is
178 -- syntactically valid, even if we have detected overflow
180 if Digit
>= Base
then
183 -- Here we accumulate the value, checking overflow
185 elsif Uval
<= Umax
then
186 Uval
:= Base
* Uval
+ Digit
;
188 elsif Uval
> UmaxB
then
192 Uval
:= Base
* Uval
+ Digit
;
199 -- If at end of string with no base char, not a based number
200 -- but we signal Constraint_Error and set the pointer past
201 -- the end of the field, since this is what the ACVC tests
202 -- seem to require, see CE3704N, line 204.
211 -- If terminating base character, we are done with loop
213 if Str
(P
) = Base_Char
then
217 -- Deal with underscore
219 elsif Str
(P
) = '_' then
220 Scan_Underscore
(Str
, P
, Ptr
, Max
, True);
227 -- Come here with scanned unsigned value in Uval. The only remaining
228 -- required step is to deal with exponent if one is present.
230 Expon
:= Scan_Exponent
(Str
, Ptr
, Max
);
232 if Expon
/= 0 and then Uval
/= 0 then
234 -- For non-zero value, scale by exponent value. No need to do this
235 -- efficiently, since use of exponent in integer literals is rare,
236 -- and in any case the exponent cannot be very large.
239 UmaxB
: constant Unsigned
:= Unsigned
'Last / Base
;
240 -- Numbers bigger than UmaxB overflow if multiplied by base
243 for J
in 1 .. Expon
loop
254 -- Return result, dealing with sign and overflow
261 end Scan_Raw_Unsigned
;
267 function Scan_Unsigned
269 Ptr
: not null access Integer;
270 Max
: Integer) return Unsigned
273 -- Save location of first non-blank character
276 Scan_Plus_Sign
(Str
, Ptr
, Max
, Start
);
278 if Str
(Ptr
.all) not in '0' .. '9' then
283 return Scan_Raw_Unsigned
(Str
, Ptr
, Max
);
290 function Value_Unsigned
(Str
: String) return Unsigned
is
292 P
: aliased Integer := Str
'First;
294 V
:= Scan_Unsigned
(Str
, P
'Access, Str
'Last);
295 Scan_Trailing_Blanks
(Str
, P
);