1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2018, 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 ------------------------------------------------------------------------------
33 (Buffer
: in out String;
38 pragma Assert
(Buffer
'First = 1);
39 -- This is a documented requirement; the assert turns off index warnings
41 B1
: Character renames Buffer
(1);
49 -- Deal with special predefined children cases. Startloc is the first
50 -- location for the krunch, set to 1, except for the predefined children
51 -- case, where it is set to 3, to start after the standard prefix.
59 and then Buffer
(1 .. 17) = "ada-wide_text_io-"
62 Buffer
(2 .. 5) := "-wt-";
63 Buffer
(6 .. Len
- 12) := Buffer
(18 .. Len
);
68 and then Buffer
(1 .. 22) = "ada-wide_wide_text_io-"
71 Buffer
(2 .. 5) := "-zt-";
72 Buffer
(6 .. Len
- 17) := Buffer
(23 .. Len
);
76 elsif Len
>= 4 and then Buffer
(1 .. 4) = "ada-" then
78 Buffer
(2 .. Len
- 2) := Buffer
(4 .. Len
);
82 elsif Len
>= 5 and then Buffer
(1 .. 5) = "gnat-" then
84 Buffer
(2 .. Len
- 3) := Buffer
(5 .. Len
);
88 elsif Len
>= 7 and then Buffer
(1 .. 7) = "system-" then
90 Buffer
(2 .. Len
- 5) := Buffer
(7 .. Len
);
94 elsif Len
>= 11 and then Buffer
(1 .. 11) = "interfaces-" then
96 Buffer
(2 .. Len
- 9) := Buffer
(11 .. Len
);
99 -- Only fully krunch historical units. For new units, simply use
100 -- the 'i-' prefix instead of 'interfaces-'. Packages Interfaces.C
101 -- and Interfaces.Cobol are already in the right form. Package
102 -- Interfaces.Definitions is krunched for backward compatibility.
104 if (Curlen
> 3 and then Buffer
(3 .. 4) = "c-")
105 or else (Curlen
> 3 and then Buffer
(3 .. 4) = "c_")
106 or else (Curlen
= 13 and then Buffer
(3 .. 13) = "definitions")
107 or else (Curlen
= 9 and then Buffer
(3 .. 9) = "fortran")
108 or else (Curlen
= 16 and then Buffer
(3 .. 16) = "packed_decimal")
109 or else (Curlen
> 8 and then Buffer
(3 .. 9) = "vxworks")
110 or else (Curlen
> 5 and then Buffer
(3 .. 6) = "java")
117 -- For the renamings in the obsolescent section, we also force krunching
118 -- to 8 characters, but no other special processing is required here.
119 -- Note that text_io and calendar are already short enough anyway.
121 elsif (Len
= 9 and then Buffer
(1 .. 9) = "direct_io")
122 or else (Len
= 10 and then Buffer
(1 .. 10) = "interfaces")
123 or else (Len
= 13 and then Buffer
(1 .. 13) = "io_exceptions")
124 or else (Len
= 12 and then Buffer
(1 .. 12) = "machine_code")
125 or else (Len
= 13 and then Buffer
(1 .. 13) = "sequential_io")
126 or else (Len
= 20 and then Buffer
(1 .. 20) = "unchecked_conversion")
127 or else (Len
= 22 and then Buffer
(1 .. 22) = "unchecked_deallocation")
133 -- Special case of a child unit whose parent unit is a single letter that
134 -- is A, G, I, or S. In order to prevent confusion with krunched names
135 -- of predefined units use a tilde rather than a minus as the second
136 -- character of the file name.
139 and then Buffer
(2) = '-'
140 and then (B1
= 'a' or else B1
= 'g' or else B1
= 'i' or else B1
= 's')
141 and then Len
<= Maxlen
146 -- Normal case, not a predefined file
154 -- Immediate return if file name is short enough now
156 if Curlen
<= Krlen
then
161 -- If string contains Wide_Wide, replace by a single z
164 while J
<= Curlen
- 8 loop
165 if Buffer
(J
.. J
+ 8) = "wide_wide"
166 and then (J
= Startloc
167 or else Buffer
(J
- 1) = '-'
168 or else Buffer
(J
- 1) = '_')
169 and then (J
+ 8 = Curlen
170 or else Buffer
(J
+ 9) = '-'
171 or else Buffer
(J
+ 9) = '_')
174 Buffer
(J
+ 1 .. Curlen
- 8) := Buffer
(J
+ 9 .. Curlen
);
175 Curlen
:= Curlen
- 8;
181 -- For now, refuse to krunch a name that contains an ESC character (wide
182 -- character sequence) since it's too much trouble to do this right ???
184 for J
in 1 .. Curlen
loop
185 if Buffer
(J
) = ASCII
.ESC
then
190 -- Count number of separators (minus signs and underscores) and for now
191 -- replace them by spaces. We keep them around till the end to control
192 -- the krunching process, and then we eliminate them as the last step
195 for J
in Startloc
.. Curlen
loop
196 if Buffer
(J
) = '-' or else Buffer
(J
) = '_' then
198 Num_Seps
:= Num_Seps
+ 1;
202 -- Now we do the one character at a time krunch till we are short enough
204 while Curlen
- Num_Seps
> Krlen
loop
206 Long_Length
: Natural := 0;
207 Long_Last
: Natural := 0;
208 Piece_Start
: Natural;
214 -- Loop through pieces to find longest piece
216 while Ptr
<= Curlen
loop
219 -- Loop through characters in one piece of name
221 while Ptr
<= Curlen
and then Buffer
(Ptr
) /= ' ' loop
225 if Ptr
- Piece_Start
> Long_Length
then
226 Long_Length
:= Ptr
- Piece_Start
;
227 Long_Last
:= Ptr
- 1;
233 -- Remove last character of longest piece
235 if Long_Last
< Curlen
then
236 Buffer
(Long_Last
.. Curlen
- 1) :=
237 Buffer
(Long_Last
+ 1 .. Curlen
);
240 Curlen
:= Curlen
- 1;
244 -- Final step, remove the spaces
248 for J
in 1 .. Curlen
loop
249 if Buffer
(J
) /= ' ' then
251 Buffer
(Len
) := Buffer
(J
);