1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
10 -- Copyright (C) 1992-2000 Free Software Foundation, Inc. --
12 -- GNAT is free software; you can redistribute it and/or modify it under --
13 -- terms of the GNU General Public License as published by the Free Soft- --
14 -- ware Foundation; either version 2, or (at your option) any later ver- --
15 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
16 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
17 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
18 -- for more details. You should have received a copy of the GNU General --
19 -- Public License distributed with GNAT; see file COPYING. If not, write --
20 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
21 -- MA 02111-1307, USA. --
23 -- As a special exception, if other files instantiate generics from this --
24 -- unit, or you link this unit with other files to produce an executable, --
25 -- this unit does not by itself cause the resulting executable to be --
26 -- covered by the GNU General Public License. This exception does not --
27 -- however invalidate any other reasons why the executable file might be --
28 -- covered by the GNU Public License. --
30 -- GNAT was originally developed by the GNAT team at New York University. --
31 -- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
33 ------------------------------------------------------------------------------
37 (Buffer : in out String;
43 B1 : Character renames Buffer (1);
50 -- Deal with special predefined children cases. Startloc is the first
51 -- location for the krunch, set to 1, except for the predefined children
52 -- case, where it is set to 3, to start after the standard prefix.
60 and then Buffer (1 .. 17) = "ada-wide_text_io-"
63 Buffer (2 .. 5) := "-wt-";
64 Buffer (6 .. Len - 12) := Buffer (18 .. Len);
68 elsif Len >= 4 and then Buffer (1 .. 4) = "ada-" then
70 Buffer (2 .. Len - 2) := Buffer (4 .. Len);
74 elsif Len >= 5 and then Buffer (1 .. 5) = "gnat-" then
76 Buffer (2 .. Len - 3) := Buffer (5 .. Len);
80 elsif Len >= 7 and then Buffer (1 .. 7) = "system-" then
82 Buffer (2 .. Len - 5) := Buffer (7 .. Len);
86 elsif Len >= 11 and then Buffer (1 .. 11) = "interfaces-" then
88 Buffer (2 .. Len - 9) := Buffer (11 .. Len);
92 -- For the renamings in the obsolescent section, we also force krunching
93 -- to 8 characters, but no other special processing is required here.
94 -- Note that text_io and calendar are already short enough anyway.
96 elsif (Len = 9 and then Buffer (1 .. 9) = "direct_io")
97 or else (Len = 10 and then Buffer (1 .. 10) = "interfaces")
98 or else (Len = 13 and then Buffer (1 .. 13) = "io_exceptions")
99 or else (Len = 12 and then Buffer (1 .. 12) = "machine_code")
100 or else (Len = 13 and then Buffer (1 .. 13) = "sequential_io")
101 or else (Len = 20 and then Buffer (1 .. 20) = "unchecked_conversion")
102 or else (Len = 22 and then Buffer (1 .. 22) = "unchecked_deallocation")
108 -- Special case of a child unit whose parent unit is a single letter that
109 -- is A, G, I, or S. In order to prevent confusion with krunched names
110 -- of predefined units use a tilde rather than a minus as the second
111 -- character of the file name. On VMS a tilde is an illegal character
112 -- in a file name, so a dollar_sign is used instead.
115 and then Buffer (2) = '-'
116 and then (B1 = 'a' or else B1 = 'g' or else B1 = 'i' or else B1 = 's')
117 and then Len <= Maxlen
119 if Hostparm.OpenVMS then
127 -- Normal case, not a predefined file
135 -- Immediate return if file name is short enough now
137 if Curlen <= Krlen then
142 -- For now, refuse to krunch a name that contains an ESC character (wide
143 -- character sequence) since it's too much trouble to do this right ???
145 for J in 1 .. Curlen loop
146 if Buffer (J) = ASCII.ESC then
151 -- Count number of separators (minus signs and underscores) and for now
152 -- replace them by spaces. We keep them around till the end to control
153 -- the krunching process, and then we eliminate them as the last step
157 for J in Startloc .. Curlen loop
158 if Buffer (J) = '-' or else Buffer (J) = '_' then
160 Num_Seps := Num_Seps + 1;
164 -- Now we do the one character at a time krunch till we are short enough
166 while Curlen - Num_Seps > Krlen loop
168 Long_Length : Natural := 0;
169 Long_Last : Natural := 0;
170 Piece_Start : Natural;
176 -- Loop through pieces to find longest piece
178 while Ptr <= Curlen loop
181 -- Loop through characters in one piece of name
183 while Ptr <= Curlen and then Buffer (Ptr) /= ' ' loop
187 if Ptr - Piece_Start > Long_Length then
188 Long_Length := Ptr - Piece_Start;
189 Long_Last := Ptr - 1;
195 -- Remove last character of longest piece
197 if Long_Last < Curlen then
198 Buffer (Long_Last .. Curlen - 1) :=
199 Buffer (Long_Last + 1 .. Curlen);
202 Curlen := Curlen - 1;
206 -- Final step, remove the spaces
210 for J in 1 .. Curlen loop
211 if Buffer (J) /= ' ' then
213 Buffer (Len) := Buffer (J);