1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
5 -- S Y S T E M . V A L _ L L I --
9 -- Copyright (C) 1992-2014, 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_LLU
; use System
.Val_LLU
;
34 with System
.Val_Util
; use System
.Val_Util
;
36 package body System
.Val_LLI
is
38 ----------------------------
39 -- Scan_Long_Long_Integer --
40 ----------------------------
42 function Scan_Long_Long_Integer
44 Ptr
: not null access Integer;
45 Max
: Integer) return Long_Long_Integer
47 Uval
: Long_Long_Unsigned
;
50 Minus
: Boolean := False;
51 -- Set to True if minus sign is present, otherwise to False
54 -- Saves location of first non-blank
57 Scan_Sign
(Str
, Ptr
, Max
, Minus
, Start
);
59 if Str
(Ptr
.all) not in '0' .. '9' then
64 Uval
:= Scan_Raw_Long_Long_Unsigned
(Str
, Ptr
, Max
);
66 -- Deal with overflow cases, and also with maximum negative number
68 if Uval
> Long_Long_Unsigned
(Long_Long_Integer'Last) then
70 and then Uval
= Long_Long_Unsigned
(-(Long_Long_Integer'First))
72 return Long_Long_Integer'First;
80 return -(Long_Long_Integer (Uval
));
85 return Long_Long_Integer (Uval
);
87 end Scan_Long_Long_Integer
;
89 -----------------------------
90 -- Value_Long_Long_Integer --
91 -----------------------------
93 function Value_Long_Long_Integer
(Str
: String) return Long_Long_Integer is
95 -- We have to special case Str'Last = Positive'Last because the normal
96 -- circuit ends up setting P to Str'Last + 1 which is out of bounds. We
97 -- deal with this by converting to a subtype which fixes the bounds.
99 if Str
'Last = Positive'Last then
101 subtype NT
is String (1 .. Str
'Length);
103 return Value_Long_Long_Integer
(NT
(Str
));
106 -- Normal case where Str'Last < Positive'Last
110 V
: Long_Long_Integer;
111 P
: aliased Integer := Str
'First;
113 V
:= Scan_Long_Long_Integer
(Str
, P
'Access, Str
'Last);
114 Scan_Trailing_Blanks
(Str
, P
);
118 end Value_Long_Long_Integer
;