1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2005, 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 2, 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. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 with Atree
; use Atree
;
28 with Einfo
; use Einfo
;
29 with Elists
; use Elists
;
30 with Exp_Util
; use Exp_Util
;
32 with Namet
; use Namet
;
33 with Sem_Util
; use Sem_Util
;
34 with Sinfo
; use Sinfo
;
36 package body Exp_Tss
is
42 function Base_Init_Proc
(Typ
: Entity_Id
) return Entity_Id
is
47 pragma Assert
(Ekind
(Typ
) in Type_Kind
);
49 if Is_Private_Type
(Typ
) then
50 Full_Type
:= Underlying_Type
(Base_Type
(Typ
));
55 if No
(Full_Type
) then
57 elsif Is_Concurrent_Type
(Full_Type
)
58 and then Present
(Corresponding_Record_Type
(Base_Type
(Full_Type
)))
60 return Init_Proc
(Corresponding_Record_Type
(Base_Type
(Full_Type
)));
63 Proc
:= Init_Proc
(Base_Type
(Full_Type
));
66 and then Is_Composite_Type
(Full_Type
)
67 and then Is_Derived_Type
(Full_Type
)
69 return Init_Proc
(Root_Type
(Full_Type
));
80 -- Note: internally this routine is also used to initially set up
81 -- a TSS entry for a new type (case of being called from Set_TSS)
83 procedure Copy_TSS
(TSS
: Entity_Id
; Typ
: Entity_Id
) is
87 Ensure_Freeze_Node
(Typ
);
88 FN
:= Freeze_Node
(Typ
);
90 if No
(TSS_Elist
(FN
)) then
91 Set_TSS_Elist
(FN
, New_Elmt_List
);
94 -- We prepend here, so that a second call overrides the first, it
95 -- is not clear that this is required, but it seems reasonable.
97 Prepend_Elmt
(TSS
, TSS_Elist
(FN
));
100 ------------------------
101 -- Find_Inherited_TSS --
102 ------------------------
104 function Find_Inherited_TSS
106 Nam
: TSS_Name_Type
) return Entity_Id
108 Btyp
: Entity_Id
:= Typ
;
113 Btyp
:= Base_Type
(Btyp
);
114 Proc
:= TSS
(Btyp
, Nam
);
116 exit when Present
(Proc
)
117 or else not Is_Derived_Type
(Btyp
);
119 -- If Typ is a derived type, it may inherit attributes from some
122 Btyp
:= Etype
(Btyp
);
127 -- If nothing else, use the TSS of the root type
129 Proc
:= TSS
(Base_Type
(Underlying_Type
(Typ
)), Nam
);
133 end Find_Inherited_TSS
;
135 -----------------------
136 -- Get_TSS_Name_Type --
137 -----------------------
139 function Get_TSS_Name
(E
: Entity_Id
) return TSS_Name_Type
is
145 Get_Last_Two_Chars
(Chars
(E
), C1
, C2
);
147 if C1
in 'A' .. 'Z' and then C2
in 'A' .. 'Z' then
150 for J
in TSS_Names
'Range loop
151 if Nm
= TSS_Names
(J
) then
160 ---------------------------------
161 -- Has_Non_Null_Base_Init_Proc --
162 ---------------------------------
164 function Has_Non_Null_Base_Init_Proc
(Typ
: Entity_Id
) return Boolean is
165 BIP
: constant Entity_Id
:= Base_Init_Proc
(Typ
);
168 return Present
(BIP
) and then not Is_Null_Init_Proc
(BIP
);
169 end Has_Non_Null_Base_Init_Proc
;
175 function Init_Proc
(Typ
: Entity_Id
) return Entity_Id
is
176 FN
: constant Node_Id
:= Freeze_Node
(Typ
);
183 elsif No
(TSS_Elist
(FN
)) then
187 Elmt
:= First_Elmt
(TSS_Elist
(FN
));
188 while Present
(Elmt
) loop
189 if Is_Init_Proc
(Node
(Elmt
)) then
204 function Is_Init_Proc
(E
: Entity_Id
) return Boolean is
208 Get_Last_Two_Chars
(Chars
(E
), C1
, C2
);
209 return C1
= TSS_Init_Proc
(1) and then C2
= TSS_Init_Proc
(2);
216 function Is_TSS
(E
: Entity_Id
; Nam
: TSS_Name_Type
) return Boolean is
220 Get_Last_Two_Chars
(Chars
(E
), C1
, C2
);
221 return C1
= Nam
(1) and then C2
= Nam
(2);
224 function Is_TSS
(N
: Name_Id
; Nam
: TSS_Name_Type
) return Boolean is
228 Get_Last_Two_Chars
(N
, C1
, C2
);
229 return C1
= Nam
(1) and then C2
= Nam
(2);
232 -------------------------
233 -- Make_Init_Proc_Name --
234 -------------------------
236 function Make_Init_Proc_Name
(Typ
: Entity_Id
) return Name_Id
is
238 return Make_TSS_Name
(Typ
, TSS_Init_Proc
);
239 end Make_Init_Proc_Name
;
241 -------------------------
242 -- Make_TSS_Name_Local --
243 -------------------------
245 function Make_TSS_Name_Local
247 Nam
: TSS_Name_Type
) return Name_Id
250 Get_Name_String
(Chars
(Typ
));
251 Add_Char_To_Name_Buffer
('_');
252 Add_Nat_To_Name_Buffer
(Increment_Serial_Number
);
253 Add_Char_To_Name_Buffer
(Nam
(1));
254 Add_Char_To_Name_Buffer
(Nam
(2));
256 end Make_TSS_Name_Local
;
262 function Make_TSS_Name
264 Nam
: TSS_Name_Type
) return Name_Id
267 Get_Name_String
(Chars
(Typ
));
268 Add_Char_To_Name_Buffer
(Nam
(1));
269 Add_Char_To_Name_Buffer
(Nam
(2));
277 function Same_TSS
(E1
, E2
: Entity_Id
) return Boolean is
284 Get_Last_Two_Chars
(Chars
(E1
), E1C1
, E1C2
);
285 Get_Last_Two_Chars
(Chars
(E2
), E2C1
, E2C2
);
301 procedure Set_Init_Proc
(Typ
: Entity_Id
; Init
: Entity_Id
) is
310 procedure Set_TSS
(Typ
: Entity_Id
; TSS
: Entity_Id
) is
311 Subprog_Body
: constant Node_Id
:= Unit_Declaration_Node
(TSS
);
314 -- Case of insertion location is in unit defining the type
316 if In_Same_Code_Unit
(Typ
, TSS
) then
317 Append_Freeze_Action
(Typ
, Subprog_Body
);
319 -- Otherwise, we are using an already existing TSS in another unit
332 function TSS
(Typ
: Entity_Id
; Nam
: TSS_Name_Type
) return Entity_Id
is
333 FN
: constant Node_Id
:= Freeze_Node
(Typ
);
341 elsif No
(TSS_Elist
(FN
)) then
345 Elmt
:= First_Elmt
(TSS_Elist
(FN
));
346 while Present
(Elmt
) loop
347 if Is_TSS
(Node
(Elmt
), Nam
) then
350 -- For stream subprograms, the TSS entity may be a renaming-
351 -- as-body of an already generated entity. Use that one rather
352 -- the one introduced by the renaming, which is an artifact of
353 -- current stream handling.
355 if Nkind
(Parent
(Parent
(Subp
))) =
356 N_Subprogram_Renaming_Declaration
358 Present
(Corresponding_Spec
(Parent
(Parent
(Subp
))))
360 return Corresponding_Spec
(Parent
(Parent
(Subp
)));
374 function TSS
(Typ
: Entity_Id
; Nam
: Name_Id
) return Entity_Id
is
375 FN
: constant Node_Id
:= Freeze_Node
(Typ
);
383 elsif No
(TSS_Elist
(FN
)) then
387 Elmt
:= First_Elmt
(TSS_Elist
(FN
));
388 while Present
(Elmt
) loop
389 if Chars
(Node
(Elmt
)) = Nam
then
392 -- For stream subprograms, the TSS entity may be a renaming-
393 -- as-body of an already generated entity. Use that one rather
394 -- the one introduced by the renaming, which is an artifact of
395 -- current stream handling.
397 if Nkind
(Parent
(Parent
(Subp
))) =
398 N_Subprogram_Renaming_Declaration
400 Present
(Corresponding_Spec
(Parent
(Parent
(Subp
))))
402 return Corresponding_Spec
(Parent
(Parent
(Subp
)));