|
111
|
1 ------------------------------------------------------------------------------
|
|
|
2 -- --
|
|
|
3 -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
|
|
|
4 -- --
|
|
|
5 -- S Y S T E M . C O N C A T _ 9 --
|
|
|
6 -- --
|
|
|
7 -- B o d y --
|
|
|
8 -- --
|
|
145
|
9 -- Copyright (C) 2008-2019, Free Software Foundation, Inc. --
|
|
111
|
10 -- --
|
|
|
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. --
|
|
|
17 -- --
|
|
|
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. --
|
|
|
21 -- --
|
|
|
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/>. --
|
|
|
26 -- --
|
|
|
27 -- GNAT was originally developed by the GNAT team at New York University. --
|
|
|
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
|
|
|
29 -- --
|
|
|
30 ------------------------------------------------------------------------------
|
|
|
31
|
|
|
32 pragma Compiler_Unit_Warning;
|
|
|
33
|
|
|
34 with System.Concat_8;
|
|
|
35
|
|
|
36 package body System.Concat_9 is
|
|
|
37
|
|
|
38 pragma Suppress (All_Checks);
|
|
|
39
|
|
|
40 ------------------
|
|
|
41 -- Str_Concat_9 --
|
|
|
42 ------------------
|
|
|
43
|
|
|
44 procedure Str_Concat_9
|
|
|
45 (R : out String;
|
|
|
46 S1, S2, S3, S4, S5, S6, S7, S8, S9 : String)
|
|
|
47 is
|
|
|
48 F, L : Natural;
|
|
|
49
|
|
|
50 begin
|
|
|
51 F := R'First;
|
|
|
52 L := F + S1'Length - 1;
|
|
|
53 R (F .. L) := S1;
|
|
|
54
|
|
|
55 F := L + 1;
|
|
|
56 L := F + S2'Length - 1;
|
|
|
57 R (F .. L) := S2;
|
|
|
58
|
|
|
59 F := L + 1;
|
|
|
60 L := F + S3'Length - 1;
|
|
|
61 R (F .. L) := S3;
|
|
|
62
|
|
|
63 F := L + 1;
|
|
|
64 L := F + S4'Length - 1;
|
|
|
65 R (F .. L) := S4;
|
|
|
66
|
|
|
67 F := L + 1;
|
|
|
68 L := F + S5'Length - 1;
|
|
|
69 R (F .. L) := S5;
|
|
|
70
|
|
|
71 F := L + 1;
|
|
|
72 L := F + S6'Length - 1;
|
|
|
73 R (F .. L) := S6;
|
|
|
74
|
|
|
75 F := L + 1;
|
|
|
76 L := F + S7'Length - 1;
|
|
|
77 R (F .. L) := S7;
|
|
|
78
|
|
|
79 F := L + 1;
|
|
|
80 L := F + S8'Length - 1;
|
|
|
81 R (F .. L) := S8;
|
|
|
82
|
|
|
83 F := L + 1;
|
|
|
84 L := R'Last;
|
|
|
85 R (F .. L) := S9;
|
|
|
86 end Str_Concat_9;
|
|
|
87
|
|
|
88 -------------------------
|
|
|
89 -- Str_Concat_Bounds_9 --
|
|
|
90 -------------------------
|
|
|
91
|
|
|
92 procedure Str_Concat_Bounds_9
|
|
|
93 (Lo, Hi : out Natural;
|
|
|
94 S1, S2, S3, S4, S5, S6, S7, S8, S9 : String)
|
|
|
95 is
|
|
|
96 begin
|
|
|
97 System.Concat_8.Str_Concat_Bounds_8
|
|
|
98 (Lo, Hi, S2, S3, S4, S5, S6, S7, S8, S9);
|
|
|
99
|
|
|
100 if S1 /= "" then
|
|
|
101 Hi := S1'Last + Hi - Lo + 1;
|
|
|
102 Lo := S1'First;
|
|
|
103 end if;
|
|
|
104 end Str_Concat_Bounds_9;
|
|
|
105
|
|
|
106 end System.Concat_9;
|
