1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2021, 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. 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 COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree
; use Atree
;
27 with Einfo
; use Einfo
;
28 with Einfo
.Entities
; use Einfo
.Entities
;
29 with Einfo
.Utils
; use Einfo
.Utils
;
30 with Elists
; use Elists
;
31 with Exp_Util
; use Exp_Util
;
32 with Nlists
; use Nlists
;
34 with Restrict
; use Restrict
;
35 with Rident
; use Rident
;
36 with Sem_Aux
; use Sem_Aux
;
37 with Sem_Ch6
; use Sem_Ch6
;
38 with Sem_Util
; use Sem_Util
;
39 with Sinfo
; use Sinfo
;
40 with Sinfo
.Nodes
; use Sinfo
.Nodes
;
42 package body Exp_Tss
is
48 function Base_Init_Proc
50 Ref
: Entity_Id
:= Empty
) return Entity_Id
56 pragma Assert
(Is_Type
(Typ
));
58 if Is_Private_Type
(Typ
) then
59 Full_Type
:= Underlying_Type
(Base_Type
(Typ
));
64 if No
(Full_Type
) then
67 elsif Is_Concurrent_Type
(Full_Type
)
68 and then Present
(Corresponding_Record_Type
(Base_Type
(Full_Type
)))
70 -- The initialization routine to be called is that of the base type
71 -- of the corresponding record type, which may itself be a subtype
72 -- and possibly an itype.
75 (Base_Type
(Corresponding_Record_Type
(Base_Type
(Full_Type
))),
79 Proc
:= Init_Proc
(Base_Type
(Full_Type
), Ref
);
82 and then Is_Composite_Type
(Full_Type
)
83 and then Is_Derived_Type
(Full_Type
)
85 return Init_Proc
(Root_Type
(Full_Type
), Ref
);
96 -- Note: internally this routine is also used to initially set up
97 -- a TSS entry for a new type (case of being called from Set_TSS)
99 procedure Copy_TSS
(TSS
: Entity_Id
; Typ
: Entity_Id
) is
103 Ensure_Freeze_Node
(Typ
);
104 FN
:= Freeze_Node
(Typ
);
106 if No
(TSS_Elist
(FN
)) then
107 Set_TSS_Elist
(FN
, New_Elmt_List
);
110 -- We prepend here, so that a second call overrides the first, it
111 -- is not clear that this is required, but it seems reasonable.
113 Prepend_Elmt
(TSS
, TSS_Elist
(FN
));
120 function CPP_Init_Proc
(Typ
: Entity_Id
) return Entity_Id
is
121 FN
: constant Node_Id
:= Freeze_Node
(Typ
);
125 if not Is_CPP_Class
(Root_Type
(Typ
))
127 or else No
(TSS_Elist
(FN
))
132 Elmt
:= First_Elmt
(TSS_Elist
(FN
));
133 while Present
(Elmt
) loop
134 if Is_CPP_Init_Proc
(Node
(Elmt
)) then
145 ------------------------
146 -- Find_Inherited_TSS --
147 ------------------------
149 function Find_Inherited_TSS
151 Nam
: TSS_Name_Type
) return Entity_Id
157 -- If Typ is a private type, look at the full view
159 if Is_Private_Type
(Typ
) and then Present
(Full_View
(Typ
)) then
160 Btyp
:= Base_Type
(Full_View
(Typ
));
162 Btyp
:= Base_Type
(Typ
);
165 Proc
:= TSS
(Btyp
, Nam
);
167 -- If Typ is a derived type, it may inherit attributes from an ancestor
169 if No
(Proc
) and then Is_Derived_Type
(Btyp
) then
170 if not Derivation_Too_Early_To_Inherit
(Btyp
, Nam
) then
171 Proc
:= Find_Inherited_TSS
(Etype
(Btyp
), Nam
);
172 elsif Is_Derived_Type
(Etype
(Btyp
)) then
173 -- Skip one link in the derivation chain
174 Proc
:= Find_Inherited_TSS
175 (Etype
(Base_Type
(Etype
(Btyp
))), Nam
);
179 -- If nothing else, use the TSS of the root type
182 Proc
:= TSS
(Base_Type
(Underlying_Type
(Typ
)), Nam
);
186 end Find_Inherited_TSS
;
192 function Get_TSS_Name
(E
: Entity_Id
) return TSS_Name_Type
is
198 Get_Last_Two_Chars
(Chars
(E
), C1
, C2
);
200 if C1
in 'A' .. 'Z' and then C2
in 'A' .. 'Z' then
203 for J
in TSS_Names
'Range loop
204 if Nm
= TSS_Names
(J
) then
213 ---------------------------------
214 -- Has_Non_Null_Base_Init_Proc --
215 ---------------------------------
217 -- Note: if a base Init_Proc is present, and No_Default_Initialization is
218 -- present, then we must avoid testing for a null init proc, since there
219 -- is no init proc present in this case.
221 function Has_Non_Null_Base_Init_Proc
(Typ
: Entity_Id
) return Boolean is
222 BIP
: constant Entity_Id
:= Base_Init_Proc
(Typ
);
225 and then (Restriction_Active
(No_Default_Initialization
)
226 or else not Is_Null_Init_Proc
(BIP
));
227 end Has_Non_Null_Base_Init_Proc
;
235 Ref
: Entity_Id
:= Empty
) return Entity_Id
237 FN
: constant Node_Id
:= Freeze_Node
(Typ
);
246 elsif No
(TSS_Elist
(FN
)) then
250 Elmt
:= First_Elmt
(TSS_Elist
(FN
));
251 while Present
(Elmt
) loop
252 if Is_Init_Proc
(Node
(Elmt
)) then
253 if not Is_CPP_Class
(Typ
) then
256 -- For CPP classes, we are looking for the default constructor,
257 -- and so we must skip any non-default constructor.
262 (Parameter_Specifications
(Parent
(Node
(Elmt
))))))
271 -- Non-default constructors are currently supported only in the context
272 -- of interfacing with C++.
274 else pragma Assert
(Is_CPP_Class
(Typ
));
276 -- Use the referenced function to locate the init_proc matching
277 -- the C++ constructor.
279 Elmt
:= First_Elmt
(TSS_Elist
(FN
));
280 while Present
(Elmt
) loop
281 if Is_Init_Proc
(Node
(Elmt
)) then
282 E1
:= Next_Formal
(First_Formal
(Node
(Elmt
)));
283 E2
:= First_Formal
(Ref
);
284 while Present
(E1
) and then Present
(E2
) loop
285 if Chars
(E1
) /= Chars
(E2
)
286 or else Ekind
(E1
) /= Ekind
(E2
)
290 elsif not Is_Anonymous_Access_Type
(Etype
(E1
))
291 and then not Is_Anonymous_Access_Type
(Etype
(E2
))
292 and then Etype
(E1
) /= Etype
(E2
)
296 elsif Ekind
(Etype
(E1
)) = E_Anonymous_Access_Type
297 and then Ekind
(Etype
(E2
)) = E_Anonymous_Access_Type
298 and then Directly_Designated_Type
(Etype
(E1
))
299 /= Directly_Designated_Type
(Etype
(E2
))
303 elsif Ekind
(Etype
(E1
)) in
304 E_Anonymous_Access_Subprogram_Type |
305 E_Anonymous_Access_Protected_Subprogram_Type
306 and then Ekind
(Etype
(E2
)) in
307 E_Anonymous_Access_Subprogram_Type |
308 E_Anonymous_Access_Protected_Subprogram_Type
309 and then not Conforming_Types
310 (Etype
(E1
), Etype
(E2
), Fully_Conformant
)
315 E1
:= Next_Formal
(E1
);
316 E2
:= Next_Formal
(E2
);
319 if No
(E1
) and then No
(E2
) then
331 ----------------------
332 -- Is_CPP_Init_Proc --
333 ----------------------
335 function Is_CPP_Init_Proc
(E
: Entity_Id
) return Boolean is
339 Get_Last_Two_Chars
(Chars
(E
), C1
, C2
);
340 return C1
= TSS_CPP_Init_Proc
(1) and then C2
= TSS_CPP_Init_Proc
(2);
341 end Is_CPP_Init_Proc
;
347 function Is_Init_Proc
(E
: Entity_Id
) return Boolean is
351 Get_Last_Two_Chars
(Chars
(E
), C1
, C2
);
352 return C1
= TSS_Init_Proc
(1) and then C2
= TSS_Init_Proc
(2);
359 function Is_TSS
(E
: Entity_Id
; Nam
: TSS_Name_Type
) return Boolean is
363 Get_Last_Two_Chars
(Chars
(E
), C1
, C2
);
364 return C1
= Nam
(1) and then C2
= Nam
(2);
367 function Is_TSS
(N
: Name_Id
; Nam
: TSS_Name_Type
) return Boolean is
371 Get_Last_Two_Chars
(N
, C1
, C2
);
372 return C1
= Nam
(1) and then C2
= Nam
(2);
375 -------------------------
376 -- Make_Init_Proc_Name --
377 -------------------------
379 function Make_Init_Proc_Name
(Typ
: Entity_Id
) return Name_Id
is
381 return Make_TSS_Name
(Typ
, TSS_Init_Proc
);
382 end Make_Init_Proc_Name
;
388 function Make_TSS_Name
390 Nam
: TSS_Name_Type
) return Name_Id
393 Get_Name_String
(Chars
(Typ
));
394 Add_Char_To_Name_Buffer
(Nam
(1));
395 Add_Char_To_Name_Buffer
(Nam
(2));
399 -------------------------
400 -- Make_TSS_Name_Local --
401 -------------------------
403 function Make_TSS_Name_Local
405 Nam
: TSS_Name_Type
) return Name_Id
408 Get_Name_String
(Chars
(Typ
));
409 Add_Char_To_Name_Buffer
('_');
410 Add_Nat_To_Name_Buffer
(Increment_Serial_Number
);
411 Add_Char_To_Name_Buffer
(Nam
(1));
412 Add_Char_To_Name_Buffer
(Nam
(2));
414 end Make_TSS_Name_Local
;
420 function Same_TSS
(E1
, E2
: Entity_Id
) return Boolean is
427 Get_Last_Two_Chars
(Chars
(E1
), E1C1
, E1C2
);
428 Get_Last_Two_Chars
(Chars
(E2
), E2C1
, E2C2
);
444 procedure Set_Init_Proc
(Typ
: Entity_Id
; Init
: Entity_Id
) is
453 procedure Set_TSS
(Typ
: Entity_Id
; TSS
: Entity_Id
) is
455 -- Make sure body of subprogram is frozen
457 -- Skip this for Init_Proc with No_Default_Initialization, since the
458 -- Init proc is a dummy void entity in this case to be ignored.
460 if (Is_Init_Proc
(TSS
) or else Is_CPP_Init_Proc
(TSS
))
461 and then Restriction_Active
(No_Default_Initialization
)
465 -- Skip this if not in the same code unit (since it means we are using
466 -- an already existing TSS in another unit)
468 elsif not In_Same_Code_Unit
(Typ
, TSS
) then
471 -- Otherwise make sure body is frozen
474 Append_Freeze_Action
(Typ
, Unit_Declaration_Node
(TSS
));
486 function TSS
(Typ
: Entity_Id
; Nam
: TSS_Name_Type
) return Entity_Id
is
487 FN
: constant Node_Id
:= Freeze_Node
(Typ
);
495 elsif No
(TSS_Elist
(FN
)) then
499 Elmt
:= First_Elmt
(TSS_Elist
(FN
));
500 while Present
(Elmt
) loop
501 if Is_TSS
(Node
(Elmt
), Nam
) then
504 -- For stream subprograms, the TSS entity may be a renaming-
505 -- as-body of an already generated entity. Use that one rather
506 -- the one introduced by the renaming, which is an artifact of
507 -- current stream handling.
509 if Nkind
(Parent
(Parent
(Subp
))) =
510 N_Subprogram_Renaming_Declaration
512 Present
(Corresponding_Spec
(Parent
(Parent
(Subp
))))
514 return Corresponding_Spec
(Parent
(Parent
(Subp
)));