| ------------------------------------------------------------------------------ |
| -- -- |
| -- GNAT RUN-TIME COMPONENTS -- |
| -- -- |
| -- S Y S T E M . I M A G E _ I -- |
| -- -- |
| -- B o d y -- |
| -- -- |
| -- Copyright (C) 1992-2022, Free Software Foundation, Inc. -- |
| -- -- |
| -- GNAT is free software; you can redistribute it and/or modify it under -- |
| -- terms of the GNU General Public License as published by the Free Soft- -- |
| -- ware Foundation; either version 3, or (at your option) any later ver- -- |
| -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- |
| -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- |
| -- or FITNESS FOR A PARTICULAR PURPOSE. -- |
| -- -- |
| -- As a special exception under Section 7 of GPL version 3, you are granted -- |
| -- additional permissions described in the GCC Runtime Library Exception, -- |
| -- version 3.1, as published by the Free Software Foundation. -- |
| -- -- |
| -- You should have received a copy of the GNU General Public License and -- |
| -- a copy of the GCC Runtime Library Exception along with this program; -- |
| -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- |
| -- <http://www.gnu.org/licenses/>. -- |
| -- -- |
| -- GNAT was originally developed by the GNAT team at New York University. -- |
| -- Extensive contributions were provided by Ada Core Technologies Inc. -- |
| -- -- |
| ------------------------------------------------------------------------------ |
| |
| package body System.Image_I is |
| |
| subtype Non_Positive is Int range Int'First .. 0; |
| |
| procedure Set_Digits |
| (T : Non_Positive; |
| S : in out String; |
| P : in out Natural); |
| -- Set digits of absolute value of T, which is zero or negative. We work |
| -- with the negative of the value so that the largest negative number is |
| -- not a special case. |
| |
| ------------------- |
| -- Image_Integer -- |
| ------------------- |
| |
| procedure Image_Integer |
| (V : Int; |
| S : in out String; |
| P : out Natural) |
| is |
| pragma Assert (S'First = 1); |
| |
| begin |
| if V >= 0 then |
| S (1) := ' '; |
| P := 1; |
| pragma Assert (P < S'Last); |
| |
| else |
| P := 0; |
| pragma Assert (P < S'Last - 1); |
| end if; |
| |
| Set_Image_Integer (V, S, P); |
| end Image_Integer; |
| |
| ---------------- |
| -- Set_Digits -- |
| ---------------- |
| |
| procedure Set_Digits |
| (T : Non_Positive; |
| S : in out String; |
| P : in out Natural) |
| is |
| Nb_Digits : Natural := 0; |
| Value : Non_Positive := T; |
| begin |
| pragma Assert (P >= S'First - 1 and P < S'Last); |
| -- No check is done since, as documented in the Set_Image_Integer |
| -- specification, the caller guarantees that S is long enough to |
| -- hold the result. |
| |
| -- First we compute the number of characters needed for representing |
| -- the number. |
| loop |
| Value := Value / 10; |
| Nb_Digits := Nb_Digits + 1; |
| exit when Value = 0; |
| end loop; |
| |
| Value := T; |
| |
| -- We now populate digits from the end of the string to the beginning |
| for J in reverse 1 .. Nb_Digits loop |
| S (P + J) := Character'Val (48 - (Value rem 10)); |
| Value := Value / 10; |
| end loop; |
| |
| P := P + Nb_Digits; |
| end Set_Digits; |
| |
| ----------------------- |
| -- Set_Image_Integer -- |
| ----------------------- |
| |
| procedure Set_Image_Integer |
| (V : Int; |
| S : in out String; |
| P : in out Natural) |
| is |
| begin |
| if V >= 0 then |
| Set_Digits (-V, S, P); |
| |
| else |
| pragma Assert (P >= S'First - 1 and P < S'Last); |
| -- No check is done since, as documented in the specification, |
| -- the caller guarantees that S is long enough to hold the result. |
| P := P + 1; |
| S (P) := '-'; |
| Set_Digits (V, S, P); |
| end if; |
| end Set_Image_Integer; |
| |
| end System.Image_I; |
