1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2009, 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 Checks
; use Checks
;
28 with Einfo
; use Einfo
;
29 with Errout
; use Errout
;
30 with Exp_Aggr
; use Exp_Aggr
;
31 with Exp_Atag
; use Exp_Atag
;
32 with Exp_Ch4
; use Exp_Ch4
;
33 with Exp_Ch6
; use Exp_Ch6
;
34 with Exp_Ch7
; use Exp_Ch7
;
35 with Exp_Ch9
; use Exp_Ch9
;
36 with Exp_Ch11
; use Exp_Ch11
;
37 with Exp_Disp
; use Exp_Disp
;
38 with Exp_Dist
; use Exp_Dist
;
39 with Exp_Smem
; use Exp_Smem
;
40 with Exp_Strm
; use Exp_Strm
;
41 with Exp_Tss
; use Exp_Tss
;
42 with Exp_Util
; use Exp_Util
;
43 with Freeze
; use Freeze
;
44 with Nlists
; use Nlists
;
45 with Namet
; use Namet
;
46 with Nmake
; use Nmake
;
48 with Restrict
; use Restrict
;
49 with Rident
; use Rident
;
50 with Rtsfind
; use Rtsfind
;
52 with Sem_Aux
; use Sem_Aux
;
53 with Sem_Attr
; use Sem_Attr
;
54 with Sem_Cat
; use Sem_Cat
;
55 with Sem_Ch3
; use Sem_Ch3
;
56 with Sem_Ch6
; use Sem_Ch6
;
57 with Sem_Ch8
; use Sem_Ch8
;
58 with Sem_Disp
; use Sem_Disp
;
59 with Sem_Eval
; use Sem_Eval
;
60 with Sem_Mech
; use Sem_Mech
;
61 with Sem_Res
; use Sem_Res
;
62 with Sem_SCIL
; use Sem_SCIL
;
63 with Sem_Type
; use Sem_Type
;
64 with Sem_Util
; use Sem_Util
;
65 with Sinfo
; use Sinfo
;
66 with Stand
; use Stand
;
67 with Snames
; use Snames
;
68 with Targparm
; use Targparm
;
69 with Tbuild
; use Tbuild
;
70 with Ttypes
; use Ttypes
;
71 with Validsw
; use Validsw
;
73 package body Exp_Ch3
is
75 -----------------------
76 -- Local Subprograms --
77 -----------------------
79 function Add_Final_Chain
(Def_Id
: Entity_Id
) return Entity_Id
;
80 -- Add the declaration of a finalization list to the freeze actions for
81 -- Def_Id, and return its defining identifier.
83 procedure Adjust_Discriminants
(Rtype
: Entity_Id
);
84 -- This is used when freezing a record type. It attempts to construct
85 -- more restrictive subtypes for discriminants so that the max size of
86 -- the record can be calculated more accurately. See the body of this
87 -- procedure for details.
89 procedure Build_Array_Init_Proc
(A_Type
: Entity_Id
; Nod
: Node_Id
);
90 -- Build initialization procedure for given array type. Nod is a node
91 -- used for attachment of any actions required in its construction.
92 -- It also supplies the source location used for the procedure.
94 function Build_Discriminant_Formals
96 Use_Dl
: Boolean) return List_Id
;
97 -- This function uses the discriminants of a type to build a list of
98 -- formal parameters, used in Build_Init_Procedure among other places.
99 -- If the flag Use_Dl is set, the list is built using the already
100 -- defined discriminals of the type, as is the case for concurrent
101 -- types with discriminants. Otherwise new identifiers are created,
102 -- with the source names of the discriminants.
104 function Build_Equivalent_Array_Aggregate
(T
: Entity_Id
) return Node_Id
;
105 -- This function builds a static aggregate that can serve as the initial
106 -- value for an array type whose bounds are static, and whose component
107 -- type is a composite type that has a static equivalent aggregate.
108 -- The equivalent array aggregate is used both for object initialization
109 -- and for component initialization, when used in the following function.
111 function Build_Equivalent_Record_Aggregate
(T
: Entity_Id
) return Node_Id
;
112 -- This function builds a static aggregate that can serve as the initial
113 -- value for a record type whose components are scalar and initialized
114 -- with compile-time values, or arrays with similar initialization or
115 -- defaults. When possible, initialization of an object of the type can
116 -- be achieved by using a copy of the aggregate as an initial value, thus
117 -- removing the implicit call that would otherwise constitute elaboration
120 function Build_Master_Renaming
122 T
: Entity_Id
) return Entity_Id
;
123 -- If the designated type of an access type is a task type or contains
124 -- tasks, we make sure that a _Master variable is declared in the current
125 -- scope, and then declare a renaming for it:
127 -- atypeM : Master_Id renames _Master;
129 -- where atyp is the name of the access type. This declaration is used when
130 -- an allocator for the access type is expanded. The node is the full
131 -- declaration of the designated type that contains tasks. The renaming
132 -- declaration is inserted before N, and after the Master declaration.
134 procedure Build_Record_Init_Proc
(N
: Node_Id
; Pe
: Entity_Id
);
135 -- Build record initialization procedure. N is the type declaration
136 -- node, and Pe is the corresponding entity for the record type.
138 procedure Build_Slice_Assignment
(Typ
: Entity_Id
);
139 -- Build assignment procedure for one-dimensional arrays of controlled
140 -- types. Other array and slice assignments are expanded in-line, but
141 -- the code expansion for controlled components (when control actions
142 -- are active) can lead to very large blocks that GCC3 handles poorly.
144 procedure Build_Variant_Record_Equality
(Typ
: Entity_Id
);
145 -- Create An Equality function for the non-tagged variant record 'Typ'
146 -- and attach it to the TSS list
148 procedure Check_Stream_Attributes
(Typ
: Entity_Id
);
149 -- Check that if a limited extension has a parent with user-defined stream
150 -- attributes, and does not itself have user-defined stream-attributes,
151 -- then any limited component of the extension also has the corresponding
152 -- user-defined stream attributes.
154 procedure Clean_Task_Names
156 Proc_Id
: Entity_Id
);
157 -- If an initialization procedure includes calls to generate names
158 -- for task subcomponents, indicate that secondary stack cleanup is
159 -- needed after an initialization. Typ is the component type, and Proc_Id
160 -- the initialization procedure for the enclosing composite type.
162 procedure Expand_Tagged_Root
(T
: Entity_Id
);
163 -- Add a field _Tag at the beginning of the record. This field carries
164 -- the value of the access to the Dispatch table. This procedure is only
165 -- called on root type, the _Tag field being inherited by the descendants.
167 procedure Expand_Record_Controller
(T
: Entity_Id
);
168 -- T must be a record type that Has_Controlled_Component. Add a field
169 -- _controller of type Record_Controller or Limited_Record_Controller
172 procedure Expand_Freeze_Array_Type
(N
: Node_Id
);
173 -- Freeze an array type. Deals with building the initialization procedure,
174 -- creating the packed array type for a packed array and also with the
175 -- creation of the controlling procedures for the controlled case. The
176 -- argument N is the N_Freeze_Entity node for the type.
178 procedure Expand_Freeze_Enumeration_Type
(N
: Node_Id
);
179 -- Freeze enumeration type with non-standard representation. Builds the
180 -- array and function needed to convert between enumeration pos and
181 -- enumeration representation values. N is the N_Freeze_Entity node
184 procedure Expand_Freeze_Record_Type
(N
: Node_Id
);
185 -- Freeze record type. Builds all necessary discriminant checking
186 -- and other ancillary functions, and builds dispatch tables where
187 -- needed. The argument N is the N_Freeze_Entity node. This processing
188 -- applies only to E_Record_Type entities, not to class wide types,
189 -- record subtypes, or private types.
191 procedure Freeze_Stream_Operations
(N
: Node_Id
; Typ
: Entity_Id
);
192 -- Treat user-defined stream operations as renaming_as_body if the
193 -- subprogram they rename is not frozen when the type is frozen.
195 procedure Initialization_Warning
(E
: Entity_Id
);
196 -- If static elaboration of the package is requested, indicate
197 -- when a type does meet the conditions for static initialization. If
198 -- E is a type, it has components that have no static initialization.
199 -- if E is an entity, its initial expression is not compile-time known.
201 function Init_Formals
(Typ
: Entity_Id
) return List_Id
;
202 -- This function builds the list of formals for an initialization routine.
203 -- The first formal is always _Init with the given type. For task value
204 -- record types and types containing tasks, three additional formals are
207 -- _Master : Master_Id
208 -- _Chain : in out Activation_Chain
209 -- _Task_Name : String
211 -- The caller must append additional entries for discriminants if required.
213 function In_Runtime
(E
: Entity_Id
) return Boolean;
214 -- Check if E is defined in the RTL (in a child of Ada or System). Used
215 -- to avoid to bring in the overhead of _Input, _Output for tagged types.
217 function Is_Variable_Size_Record
(E
: Entity_Id
) return Boolean;
218 -- Returns true if E has variable size components
220 function Make_Eq_Case
223 Discr
: Entity_Id
:= Empty
) return List_Id
;
224 -- Building block for variant record equality. Defined to share the code
225 -- between the tagged and non-tagged case. Given a Component_List node CL,
226 -- it generates an 'if' followed by a 'case' statement that compares all
227 -- components of local temporaries named X and Y (that are declared as
228 -- formals at some upper level). E provides the Sloc to be used for the
229 -- generated code. Discr is used as the case statement switch in the case
230 -- of Unchecked_Union equality.
234 L
: List_Id
) return Node_Id
;
235 -- Building block for variant record equality. Defined to share the code
236 -- between the tagged and non-tagged case. Given the list of components
237 -- (or discriminants) L, it generates a return statement that compares all
238 -- components of local temporaries named X and Y (that are declared as
239 -- formals at some upper level). E provides the Sloc to be used for the
242 procedure Make_Predefined_Primitive_Specs
243 (Tag_Typ
: Entity_Id
;
244 Predef_List
: out List_Id
;
245 Renamed_Eq
: out Entity_Id
);
246 -- Create a list with the specs of the predefined primitive operations.
247 -- For tagged types that are interfaces all these primitives are defined
250 -- The following entries are present for all tagged types, and provide
251 -- the results of the corresponding attribute applied to the object.
252 -- Dispatching is required in general, since the result of the attribute
253 -- will vary with the actual object subtype.
255 -- _alignment provides result of 'Alignment attribute
256 -- _size provides result of 'Size attribute
257 -- typSR provides result of 'Read attribute
258 -- typSW provides result of 'Write attribute
259 -- typSI provides result of 'Input attribute
260 -- typSO provides result of 'Output attribute
262 -- The following entries are additionally present for non-limited tagged
263 -- types, and implement additional dispatching operations for predefined
266 -- _equality implements "=" operator
267 -- _assign implements assignment operation
268 -- typDF implements deep finalization
269 -- typDA implements deep adjust
271 -- The latter two are empty procedures unless the type contains some
272 -- controlled components that require finalization actions (the deep
273 -- in the name refers to the fact that the action applies to components).
275 -- The list is returned in Predef_List. The Parameter Renamed_Eq either
276 -- returns the value Empty, or else the defining unit name for the
277 -- predefined equality function in the case where the type has a primitive
278 -- operation that is a renaming of predefined equality (but only if there
279 -- is also an overriding user-defined equality function). The returned
280 -- Renamed_Eq will be passed to the corresponding parameter of
281 -- Predefined_Primitive_Bodies.
283 function Has_New_Non_Standard_Rep
(T
: Entity_Id
) return Boolean;
284 -- returns True if there are representation clauses for type T that are not
285 -- inherited. If the result is false, the init_proc and the discriminant
286 -- checking functions of the parent can be reused by a derived type.
288 procedure Make_Controlling_Function_Wrappers
289 (Tag_Typ
: Entity_Id
;
290 Decl_List
: out List_Id
;
291 Body_List
: out List_Id
);
292 -- Ada 2005 (AI-391): Makes specs and bodies for the wrapper functions
293 -- associated with inherited functions with controlling results which
294 -- are not overridden. The body of each wrapper function consists solely
295 -- of a return statement whose expression is an extension aggregate
296 -- invoking the inherited subprogram's parent subprogram and extended
297 -- with a null association list.
299 procedure Make_Null_Procedure_Specs
300 (Tag_Typ
: Entity_Id
;
301 Decl_List
: out List_Id
);
302 -- Ada 2005 (AI-251): Makes specs for null procedures associated with any
303 -- null procedures inherited from an interface type that have not been
304 -- overridden. Only one null procedure will be created for a given set of
305 -- inherited null procedures with homographic profiles.
307 function Predef_Spec_Or_Body
312 Ret_Type
: Entity_Id
:= Empty
;
313 For_Body
: Boolean := False) return Node_Id
;
314 -- This function generates the appropriate expansion for a predefined
315 -- primitive operation specified by its name, parameter profile and
316 -- return type (Empty means this is a procedure). If For_Body is false,
317 -- then the returned node is a subprogram declaration. If For_Body is
318 -- true, then the returned node is a empty subprogram body containing
319 -- no declarations and no statements.
321 function Predef_Stream_Attr_Spec
324 Name
: TSS_Name_Type
;
325 For_Body
: Boolean := False) return Node_Id
;
326 -- Specialized version of Predef_Spec_Or_Body that apply to read, write,
327 -- input and output attribute whose specs are constructed in Exp_Strm.
329 function Predef_Deep_Spec
332 Name
: TSS_Name_Type
;
333 For_Body
: Boolean := False) return Node_Id
;
334 -- Specialized version of Predef_Spec_Or_Body that apply to _deep_adjust
335 -- and _deep_finalize
337 function Predefined_Primitive_Bodies
338 (Tag_Typ
: Entity_Id
;
339 Renamed_Eq
: Entity_Id
) return List_Id
;
340 -- Create the bodies of the predefined primitives that are described in
341 -- Predefined_Primitive_Specs. When not empty, Renamed_Eq must denote
342 -- the defining unit name of the type's predefined equality as returned
343 -- by Make_Predefined_Primitive_Specs.
345 function Predefined_Primitive_Freeze
(Tag_Typ
: Entity_Id
) return List_Id
;
346 -- Freeze entities of all predefined primitive operations. This is needed
347 -- because the bodies of these operations do not normally do any freezing.
349 function Stream_Operation_OK
351 Operation
: TSS_Name_Type
) return Boolean;
352 -- Check whether the named stream operation must be emitted for a given
353 -- type. The rules for inheritance of stream attributes by type extensions
354 -- are enforced by this function. Furthermore, various restrictions prevent
355 -- the generation of these operations, as a useful optimization or for
356 -- certification purposes.
358 ---------------------
359 -- Add_Final_Chain --
360 ---------------------
362 function Add_Final_Chain
(Def_Id
: Entity_Id
) return Entity_Id
is
363 Loc
: constant Source_Ptr
:= Sloc
(Def_Id
);
368 Make_Defining_Identifier
(Loc
,
369 New_External_Name
(Chars
(Def_Id
), 'L'));
371 Append_Freeze_Action
(Def_Id
,
372 Make_Object_Declaration
(Loc
,
373 Defining_Identifier
=> Flist
,
375 New_Reference_To
(RTE
(RE_List_Controller
), Loc
)));
380 --------------------------
381 -- Adjust_Discriminants --
382 --------------------------
384 -- This procedure attempts to define subtypes for discriminants that are
385 -- more restrictive than those declared. Such a replacement is possible if
386 -- we can demonstrate that values outside the restricted range would cause
387 -- constraint errors in any case. The advantage of restricting the
388 -- discriminant types in this way is that the maximum size of the variant
389 -- record can be calculated more conservatively.
391 -- An example of a situation in which we can perform this type of
392 -- restriction is the following:
394 -- subtype B is range 1 .. 10;
395 -- type Q is array (B range <>) of Integer;
397 -- type V (N : Natural) is record
401 -- In this situation, we can restrict the upper bound of N to 10, since
402 -- any larger value would cause a constraint error in any case.
404 -- There are many situations in which such restriction is possible, but
405 -- for now, we just look for cases like the above, where the component
406 -- in question is a one dimensional array whose upper bound is one of
407 -- the record discriminants. Also the component must not be part of
408 -- any variant part, since then the component does not always exist.
410 procedure Adjust_Discriminants
(Rtype
: Entity_Id
) is
411 Loc
: constant Source_Ptr
:= Sloc
(Rtype
);
428 Comp
:= First_Component
(Rtype
);
429 while Present
(Comp
) loop
431 -- If our parent is a variant, quit, we do not look at components
432 -- that are in variant parts, because they may not always exist.
434 P
:= Parent
(Comp
); -- component declaration
435 P
:= Parent
(P
); -- component list
437 exit when Nkind
(Parent
(P
)) = N_Variant
;
439 -- We are looking for a one dimensional array type
441 Ctyp
:= Etype
(Comp
);
443 if not Is_Array_Type
(Ctyp
)
444 or else Number_Dimensions
(Ctyp
) > 1
449 -- The lower bound must be constant, and the upper bound is a
450 -- discriminant (which is a discriminant of the current record).
452 Ityp
:= Etype
(First_Index
(Ctyp
));
453 Lo
:= Type_Low_Bound
(Ityp
);
454 Hi
:= Type_High_Bound
(Ityp
);
456 if not Compile_Time_Known_Value
(Lo
)
457 or else Nkind
(Hi
) /= N_Identifier
458 or else No
(Entity
(Hi
))
459 or else Ekind
(Entity
(Hi
)) /= E_Discriminant
464 -- We have an array with appropriate bounds
466 Loval
:= Expr_Value
(Lo
);
467 Discr
:= Entity
(Hi
);
468 Dtyp
:= Etype
(Discr
);
470 -- See if the discriminant has a known upper bound
472 Dhi
:= Type_High_Bound
(Dtyp
);
474 if not Compile_Time_Known_Value
(Dhi
) then
478 Dhiv
:= Expr_Value
(Dhi
);
480 -- See if base type of component array has known upper bound
482 Ahi
:= Type_High_Bound
(Etype
(First_Index
(Base_Type
(Ctyp
))));
484 if not Compile_Time_Known_Value
(Ahi
) then
488 Ahiv
:= Expr_Value
(Ahi
);
490 -- The condition for doing the restriction is that the high bound
491 -- of the discriminant is greater than the low bound of the array,
492 -- and is also greater than the high bound of the base type index.
494 if Dhiv
> Loval
and then Dhiv
> Ahiv
then
496 -- We can reset the upper bound of the discriminant type to
497 -- whichever is larger, the low bound of the component, or
498 -- the high bound of the base type array index.
500 -- We build a subtype that is declared as
502 -- subtype Tnn is discr_type range discr_type'First .. max;
504 -- And insert this declaration into the tree. The type of the
505 -- discriminant is then reset to this more restricted subtype.
507 Tnn
:= Make_Defining_Identifier
(Loc
, New_Internal_Name
('T'));
509 Insert_Action
(Declaration_Node
(Rtype
),
510 Make_Subtype_Declaration
(Loc
,
511 Defining_Identifier
=> Tnn
,
512 Subtype_Indication
=>
513 Make_Subtype_Indication
(Loc
,
514 Subtype_Mark
=> New_Occurrence_Of
(Dtyp
, Loc
),
516 Make_Range_Constraint
(Loc
,
520 Make_Attribute_Reference
(Loc
,
521 Attribute_Name
=> Name_First
,
522 Prefix
=> New_Occurrence_Of
(Dtyp
, Loc
)),
524 Make_Integer_Literal
(Loc
,
525 Intval
=> UI_Max
(Loval
, Ahiv
)))))));
527 Set_Etype
(Discr
, Tnn
);
531 Next_Component
(Comp
);
533 end Adjust_Discriminants
;
535 ---------------------------
536 -- Build_Array_Init_Proc --
537 ---------------------------
539 procedure Build_Array_Init_Proc
(A_Type
: Entity_Id
; Nod
: Node_Id
) is
540 Loc
: constant Source_Ptr
:= Sloc
(Nod
);
541 Comp_Type
: constant Entity_Id
:= Component_Type
(A_Type
);
542 Index_List
: List_Id
;
544 Body_Stmts
: List_Id
;
545 Has_Default_Init
: Boolean;
547 function Init_Component
return List_Id
;
548 -- Create one statement to initialize one array component, designated
549 -- by a full set of indices.
551 function Init_One_Dimension
(N
: Int
) return List_Id
;
552 -- Create loop to initialize one dimension of the array. The single
553 -- statement in the loop body initializes the inner dimensions if any,
554 -- or else the single component. Note that this procedure is called
555 -- recursively, with N being the dimension to be initialized. A call
556 -- with N greater than the number of dimensions simply generates the
557 -- component initialization, terminating the recursion.
563 function Init_Component
return List_Id
is
568 Make_Indexed_Component
(Loc
,
569 Prefix
=> Make_Identifier
(Loc
, Name_uInit
),
570 Expressions
=> Index_List
);
572 if Needs_Simple_Initialization
(Comp_Type
) then
573 Set_Assignment_OK
(Comp
);
575 Make_Assignment_Statement
(Loc
,
579 (Comp_Type
, Nod
, Component_Size
(A_Type
))));
582 Clean_Task_Names
(Comp_Type
, Proc_Id
);
584 Build_Initialization_Call
585 (Loc
, Comp
, Comp_Type
,
586 In_Init_Proc
=> True,
587 Enclos_Type
=> A_Type
);
591 ------------------------
592 -- Init_One_Dimension --
593 ------------------------
595 function Init_One_Dimension
(N
: Int
) return List_Id
is
599 -- If the component does not need initializing, then there is nothing
600 -- to do here, so we return a null body. This occurs when generating
601 -- the dummy Init_Proc needed for Initialize_Scalars processing.
603 if not Has_Non_Null_Base_Init_Proc
(Comp_Type
)
604 and then not Needs_Simple_Initialization
(Comp_Type
)
605 and then not Has_Task
(Comp_Type
)
607 return New_List
(Make_Null_Statement
(Loc
));
609 -- If all dimensions dealt with, we simply initialize the component
611 elsif N
> Number_Dimensions
(A_Type
) then
612 return Init_Component
;
614 -- Here we generate the required loop
618 Make_Defining_Identifier
(Loc
, New_External_Name
('J', N
));
620 Append
(New_Reference_To
(Index
, Loc
), Index_List
);
623 Make_Implicit_Loop_Statement
(Nod
,
626 Make_Iteration_Scheme
(Loc
,
627 Loop_Parameter_Specification
=>
628 Make_Loop_Parameter_Specification
(Loc
,
629 Defining_Identifier
=> Index
,
630 Discrete_Subtype_Definition
=>
631 Make_Attribute_Reference
(Loc
,
632 Prefix
=> Make_Identifier
(Loc
, Name_uInit
),
633 Attribute_Name
=> Name_Range
,
634 Expressions
=> New_List
(
635 Make_Integer_Literal
(Loc
, N
))))),
636 Statements
=> Init_One_Dimension
(N
+ 1)));
638 end Init_One_Dimension
;
640 -- Start of processing for Build_Array_Init_Proc
643 -- Nothing to generate in the following cases:
645 -- 1. Initialization is suppressed for the type
646 -- 2. The type is a value type, in the CIL sense.
647 -- 3. The type has CIL/JVM convention.
648 -- 4. An initialization already exists for the base type
650 if Suppress_Init_Proc
(A_Type
)
651 or else Is_Value_Type
(Comp_Type
)
652 or else Convention
(A_Type
) = Convention_CIL
653 or else Convention
(A_Type
) = Convention_Java
654 or else Present
(Base_Init_Proc
(A_Type
))
659 Index_List
:= New_List
;
661 -- We need an initialization procedure if any of the following is true:
663 -- 1. The component type has an initialization procedure
664 -- 2. The component type needs simple initialization
665 -- 3. Tasks are present
666 -- 4. The type is marked as a public entity
668 -- The reason for the public entity test is to deal properly with the
669 -- Initialize_Scalars pragma. This pragma can be set in the client and
670 -- not in the declaring package, this means the client will make a call
671 -- to the initialization procedure (because one of conditions 1-3 must
672 -- apply in this case), and we must generate a procedure (even if it is
673 -- null) to satisfy the call in this case.
675 -- Exception: do not build an array init_proc for a type whose root
676 -- type is Standard.String or Standard.Wide_[Wide_]String, since there
677 -- is no place to put the code, and in any case we handle initialization
678 -- of such types (in the Initialize_Scalars case, that's the only time
679 -- the issue arises) in a special manner anyway which does not need an
682 Has_Default_Init
:= Has_Non_Null_Base_Init_Proc
(Comp_Type
)
683 or else Needs_Simple_Initialization
(Comp_Type
)
684 or else Has_Task
(Comp_Type
);
687 or else (not Restriction_Active
(No_Initialize_Scalars
)
688 and then Is_Public
(A_Type
)
689 and then Root_Type
(A_Type
) /= Standard_String
690 and then Root_Type
(A_Type
) /= Standard_Wide_String
691 and then Root_Type
(A_Type
) /= Standard_Wide_Wide_String
)
694 Make_Defining_Identifier
(Loc
,
695 Chars
=> Make_Init_Proc_Name
(A_Type
));
697 -- If No_Default_Initialization restriction is active, then we don't
698 -- want to build an init_proc, but we need to mark that an init_proc
699 -- would be needed if this restriction was not active (so that we can
700 -- detect attempts to call it), so set a dummy init_proc in place.
701 -- This is only done though when actual default initialization is
702 -- needed (and not done when only Is_Public is True), since otherwise
703 -- objects such as arrays of scalars could be wrongly flagged as
704 -- violating the restriction.
706 if Restriction_Active
(No_Default_Initialization
) then
707 if Has_Default_Init
then
708 Set_Init_Proc
(A_Type
, Proc_Id
);
714 Body_Stmts
:= Init_One_Dimension
(1);
717 Make_Subprogram_Body
(Loc
,
719 Make_Procedure_Specification
(Loc
,
720 Defining_Unit_Name
=> Proc_Id
,
721 Parameter_Specifications
=> Init_Formals
(A_Type
)),
722 Declarations
=> New_List
,
723 Handled_Statement_Sequence
=>
724 Make_Handled_Sequence_Of_Statements
(Loc
,
725 Statements
=> Body_Stmts
)));
727 Set_Ekind
(Proc_Id
, E_Procedure
);
728 Set_Is_Public
(Proc_Id
, Is_Public
(A_Type
));
729 Set_Is_Internal
(Proc_Id
);
730 Set_Has_Completion
(Proc_Id
);
732 if not Debug_Generated_Code
then
733 Set_Debug_Info_Off
(Proc_Id
);
736 -- Set inlined unless controlled stuff or tasks around, in which
737 -- case we do not want to inline, because nested stuff may cause
738 -- difficulties in inter-unit inlining, and furthermore there is
739 -- in any case no point in inlining such complex init procs.
741 if not Has_Task
(Proc_Id
)
742 and then not Needs_Finalization
(Proc_Id
)
744 Set_Is_Inlined
(Proc_Id
);
747 -- Associate Init_Proc with type, and determine if the procedure
748 -- is null (happens because of the Initialize_Scalars pragma case,
749 -- where we have to generate a null procedure in case it is called
750 -- by a client with Initialize_Scalars set). Such procedures have
751 -- to be generated, but do not have to be called, so we mark them
752 -- as null to suppress the call.
754 Set_Init_Proc
(A_Type
, Proc_Id
);
756 if List_Length
(Body_Stmts
) = 1
758 -- We must skip SCIL nodes because they may have been added to this
759 -- list by Insert_Actions.
761 and then Nkind
(First_Non_SCIL_Node
(Body_Stmts
)) = N_Null_Statement
763 Set_Is_Null_Init_Proc
(Proc_Id
);
766 -- Try to build a static aggregate to initialize statically
767 -- objects of the type. This can only be done for constrained
768 -- one-dimensional arrays with static bounds.
770 Set_Static_Initialization
772 Build_Equivalent_Array_Aggregate
(First_Subtype
(A_Type
)));
775 end Build_Array_Init_Proc
;
777 -----------------------------
778 -- Build_Class_Wide_Master --
779 -----------------------------
781 procedure Build_Class_Wide_Master
(T
: Entity_Id
) is
782 Loc
: constant Source_Ptr
:= Sloc
(T
);
789 -- Nothing to do if there is no task hierarchy
791 if Restriction_Active
(No_Task_Hierarchy
) then
795 -- Find declaration that created the access type: either a type
796 -- declaration, or an object declaration with an access definition,
797 -- in which case the type is anonymous.
800 P
:= Associated_Node_For_Itype
(T
);
805 -- Nothing to do if we already built a master entity for this scope
807 if not Has_Master_Entity
(Scope
(T
)) then
809 -- First build the master entity
810 -- _Master : constant Master_Id := Current_Master.all;
811 -- and insert it just before the current declaration.
814 Make_Object_Declaration
(Loc
,
815 Defining_Identifier
=>
816 Make_Defining_Identifier
(Loc
, Name_uMaster
),
817 Constant_Present
=> True,
818 Object_Definition
=> New_Reference_To
(Standard_Integer
, Loc
),
820 Make_Explicit_Dereference
(Loc
,
821 New_Reference_To
(RTE
(RE_Current_Master
), Loc
)));
823 Insert_Action
(P
, Decl
);
825 Set_Has_Master_Entity
(Scope
(T
));
827 -- Now mark the containing scope as a task master. Masters
828 -- associated with return statements are already marked at
829 -- this stage (see Analyze_Subprogram_Body).
831 if Ekind
(Current_Scope
) /= E_Return_Statement
then
833 while Nkind
(Par
) /= N_Compilation_Unit
loop
836 -- If we fall off the top, we are at the outer level, and the
837 -- environment task is our effective master, so nothing to mark.
840 (Par
, N_Task_Body
, N_Block_Statement
, N_Subprogram_Body
)
842 Set_Is_Task_Master
(Par
, True);
849 -- Now define the renaming of the master_id
852 Make_Defining_Identifier
(Loc
,
853 New_External_Name
(Chars
(T
), 'M'));
856 Make_Object_Renaming_Declaration
(Loc
,
857 Defining_Identifier
=> M_Id
,
858 Subtype_Mark
=> New_Reference_To
(Standard_Integer
, Loc
),
859 Name
=> Make_Identifier
(Loc
, Name_uMaster
));
860 Insert_Before
(P
, Decl
);
863 Set_Master_Id
(T
, M_Id
);
866 when RE_Not_Available
=>
868 end Build_Class_Wide_Master
;
870 --------------------------------
871 -- Build_Discr_Checking_Funcs --
872 --------------------------------
874 procedure Build_Discr_Checking_Funcs
(N
: Node_Id
) is
877 Enclosing_Func_Id
: Entity_Id
;
882 function Build_Case_Statement
883 (Case_Id
: Entity_Id
;
884 Variant
: Node_Id
) return Node_Id
;
885 -- Build a case statement containing only two alternatives. The first
886 -- alternative corresponds exactly to the discrete choices given on the
887 -- variant with contains the components that we are generating the
888 -- checks for. If the discriminant is one of these return False. The
889 -- second alternative is an OTHERS choice that will return True
890 -- indicating the discriminant did not match.
892 function Build_Dcheck_Function
893 (Case_Id
: Entity_Id
;
894 Variant
: Node_Id
) return Entity_Id
;
895 -- Build the discriminant checking function for a given variant
897 procedure Build_Dcheck_Functions
(Variant_Part_Node
: Node_Id
);
898 -- Builds the discriminant checking function for each variant of the
899 -- given variant part of the record type.
901 --------------------------
902 -- Build_Case_Statement --
903 --------------------------
905 function Build_Case_Statement
906 (Case_Id
: Entity_Id
;
907 Variant
: Node_Id
) return Node_Id
909 Alt_List
: constant List_Id
:= New_List
;
910 Actuals_List
: List_Id
;
912 Case_Alt_Node
: Node_Id
;
914 Choice_List
: List_Id
;
916 Return_Node
: Node_Id
;
919 Case_Node
:= New_Node
(N_Case_Statement
, Loc
);
921 -- Replace the discriminant which controls the variant, with the name
922 -- of the formal of the checking function.
924 Set_Expression
(Case_Node
,
925 Make_Identifier
(Loc
, Chars
(Case_Id
)));
927 Choice
:= First
(Discrete_Choices
(Variant
));
929 if Nkind
(Choice
) = N_Others_Choice
then
930 Choice_List
:= New_Copy_List
(Others_Discrete_Choices
(Choice
));
932 Choice_List
:= New_Copy_List
(Discrete_Choices
(Variant
));
935 if not Is_Empty_List
(Choice_List
) then
936 Case_Alt_Node
:= New_Node
(N_Case_Statement_Alternative
, Loc
);
937 Set_Discrete_Choices
(Case_Alt_Node
, Choice_List
);
939 -- In case this is a nested variant, we need to return the result
940 -- of the discriminant checking function for the immediately
941 -- enclosing variant.
943 if Present
(Enclosing_Func_Id
) then
944 Actuals_List
:= New_List
;
946 D
:= First_Discriminant
(Rec_Id
);
947 while Present
(D
) loop
948 Append
(Make_Identifier
(Loc
, Chars
(D
)), Actuals_List
);
949 Next_Discriminant
(D
);
953 Make_Simple_Return_Statement
(Loc
,
955 Make_Function_Call
(Loc
,
957 New_Reference_To
(Enclosing_Func_Id
, Loc
),
958 Parameter_Associations
=>
963 Make_Simple_Return_Statement
(Loc
,
965 New_Reference_To
(Standard_False
, Loc
));
968 Set_Statements
(Case_Alt_Node
, New_List
(Return_Node
));
969 Append
(Case_Alt_Node
, Alt_List
);
972 Case_Alt_Node
:= New_Node
(N_Case_Statement_Alternative
, Loc
);
973 Choice_List
:= New_List
(New_Node
(N_Others_Choice
, Loc
));
974 Set_Discrete_Choices
(Case_Alt_Node
, Choice_List
);
977 Make_Simple_Return_Statement
(Loc
,
979 New_Reference_To
(Standard_True
, Loc
));
981 Set_Statements
(Case_Alt_Node
, New_List
(Return_Node
));
982 Append
(Case_Alt_Node
, Alt_List
);
984 Set_Alternatives
(Case_Node
, Alt_List
);
986 end Build_Case_Statement
;
988 ---------------------------
989 -- Build_Dcheck_Function --
990 ---------------------------
992 function Build_Dcheck_Function
993 (Case_Id
: Entity_Id
;
994 Variant
: Node_Id
) return Entity_Id
998 Parameter_List
: List_Id
;
1002 Body_Node
:= New_Node
(N_Subprogram_Body
, Loc
);
1003 Sequence
:= Sequence
+ 1;
1006 Make_Defining_Identifier
(Loc
,
1007 Chars
=> New_External_Name
(Chars
(Rec_Id
), 'D', Sequence
));
1009 Spec_Node
:= New_Node
(N_Function_Specification
, Loc
);
1010 Set_Defining_Unit_Name
(Spec_Node
, Func_Id
);
1012 Parameter_List
:= Build_Discriminant_Formals
(Rec_Id
, False);
1014 Set_Parameter_Specifications
(Spec_Node
, Parameter_List
);
1015 Set_Result_Definition
(Spec_Node
,
1016 New_Reference_To
(Standard_Boolean
, Loc
));
1017 Set_Specification
(Body_Node
, Spec_Node
);
1018 Set_Declarations
(Body_Node
, New_List
);
1020 Set_Handled_Statement_Sequence
(Body_Node
,
1021 Make_Handled_Sequence_Of_Statements
(Loc
,
1022 Statements
=> New_List
(
1023 Build_Case_Statement
(Case_Id
, Variant
))));
1025 Set_Ekind
(Func_Id
, E_Function
);
1026 Set_Mechanism
(Func_Id
, Default_Mechanism
);
1027 Set_Is_Inlined
(Func_Id
, True);
1028 Set_Is_Pure
(Func_Id
, True);
1029 Set_Is_Public
(Func_Id
, Is_Public
(Rec_Id
));
1030 Set_Is_Internal
(Func_Id
, True);
1032 if not Debug_Generated_Code
then
1033 Set_Debug_Info_Off
(Func_Id
);
1036 Analyze
(Body_Node
);
1038 Append_Freeze_Action
(Rec_Id
, Body_Node
);
1039 Set_Dcheck_Function
(Variant
, Func_Id
);
1041 end Build_Dcheck_Function
;
1043 ----------------------------
1044 -- Build_Dcheck_Functions --
1045 ----------------------------
1047 procedure Build_Dcheck_Functions
(Variant_Part_Node
: Node_Id
) is
1048 Component_List_Node
: Node_Id
;
1050 Discr_Name
: Entity_Id
;
1051 Func_Id
: Entity_Id
;
1053 Saved_Enclosing_Func_Id
: Entity_Id
;
1056 -- Build the discriminant-checking function for each variant, and
1057 -- label all components of that variant with the function's name.
1058 -- We only Generate a discriminant-checking function when the
1059 -- variant is not empty, to prevent the creation of dead code.
1060 -- The exception to that is when Frontend_Layout_On_Target is set,
1061 -- because the variant record size function generated in package
1062 -- Layout needs to generate calls to all discriminant-checking
1063 -- functions, including those for empty variants.
1065 Discr_Name
:= Entity
(Name
(Variant_Part_Node
));
1066 Variant
:= First_Non_Pragma
(Variants
(Variant_Part_Node
));
1068 while Present
(Variant
) loop
1069 Component_List_Node
:= Component_List
(Variant
);
1071 if not Null_Present
(Component_List_Node
)
1072 or else Frontend_Layout_On_Target
1074 Func_Id
:= Build_Dcheck_Function
(Discr_Name
, Variant
);
1076 First_Non_Pragma
(Component_Items
(Component_List_Node
));
1078 while Present
(Decl
) loop
1079 Set_Discriminant_Checking_Func
1080 (Defining_Identifier
(Decl
), Func_Id
);
1082 Next_Non_Pragma
(Decl
);
1085 if Present
(Variant_Part
(Component_List_Node
)) then
1086 Saved_Enclosing_Func_Id
:= Enclosing_Func_Id
;
1087 Enclosing_Func_Id
:= Func_Id
;
1088 Build_Dcheck_Functions
(Variant_Part
(Component_List_Node
));
1089 Enclosing_Func_Id
:= Saved_Enclosing_Func_Id
;
1093 Next_Non_Pragma
(Variant
);
1095 end Build_Dcheck_Functions
;
1097 -- Start of processing for Build_Discr_Checking_Funcs
1100 -- Only build if not done already
1102 if not Discr_Check_Funcs_Built
(N
) then
1103 Type_Def
:= Type_Definition
(N
);
1105 if Nkind
(Type_Def
) = N_Record_Definition
then
1106 if No
(Component_List
(Type_Def
)) then -- null record.
1109 V
:= Variant_Part
(Component_List
(Type_Def
));
1112 else pragma Assert
(Nkind
(Type_Def
) = N_Derived_Type_Definition
);
1113 if No
(Component_List
(Record_Extension_Part
(Type_Def
))) then
1117 (Component_List
(Record_Extension_Part
(Type_Def
)));
1121 Rec_Id
:= Defining_Identifier
(N
);
1123 if Present
(V
) and then not Is_Unchecked_Union
(Rec_Id
) then
1125 Enclosing_Func_Id
:= Empty
;
1126 Build_Dcheck_Functions
(V
);
1129 Set_Discr_Check_Funcs_Built
(N
);
1131 end Build_Discr_Checking_Funcs
;
1133 --------------------------------
1134 -- Build_Discriminant_Formals --
1135 --------------------------------
1137 function Build_Discriminant_Formals
1138 (Rec_Id
: Entity_Id
;
1139 Use_Dl
: Boolean) return List_Id
1141 Loc
: Source_Ptr
:= Sloc
(Rec_Id
);
1142 Parameter_List
: constant List_Id
:= New_List
;
1145 Formal_Type
: Entity_Id
;
1146 Param_Spec_Node
: Node_Id
;
1149 if Has_Discriminants
(Rec_Id
) then
1150 D
:= First_Discriminant
(Rec_Id
);
1151 while Present
(D
) loop
1155 Formal
:= Discriminal
(D
);
1156 Formal_Type
:= Etype
(Formal
);
1158 Formal
:= Make_Defining_Identifier
(Loc
, Chars
(D
));
1159 Formal_Type
:= Etype
(D
);
1163 Make_Parameter_Specification
(Loc
,
1164 Defining_Identifier
=> Formal
,
1166 New_Reference_To
(Formal_Type
, Loc
));
1167 Append
(Param_Spec_Node
, Parameter_List
);
1168 Next_Discriminant
(D
);
1172 return Parameter_List
;
1173 end Build_Discriminant_Formals
;
1175 --------------------------------------
1176 -- Build_Equivalent_Array_Aggregate --
1177 --------------------------------------
1179 function Build_Equivalent_Array_Aggregate
(T
: Entity_Id
) return Node_Id
is
1180 Loc
: constant Source_Ptr
:= Sloc
(T
);
1181 Comp_Type
: constant Entity_Id
:= Component_Type
(T
);
1182 Index_Type
: constant Entity_Id
:= Etype
(First_Index
(T
));
1183 Proc
: constant Entity_Id
:= Base_Init_Proc
(T
);
1189 if not Is_Constrained
(T
)
1190 or else Number_Dimensions
(T
) > 1
1193 Initialization_Warning
(T
);
1197 Lo
:= Type_Low_Bound
(Index_Type
);
1198 Hi
:= Type_High_Bound
(Index_Type
);
1200 if not Compile_Time_Known_Value
(Lo
)
1201 or else not Compile_Time_Known_Value
(Hi
)
1203 Initialization_Warning
(T
);
1207 if Is_Record_Type
(Comp_Type
)
1208 and then Present
(Base_Init_Proc
(Comp_Type
))
1210 Expr
:= Static_Initialization
(Base_Init_Proc
(Comp_Type
));
1213 Initialization_Warning
(T
);
1218 Initialization_Warning
(T
);
1222 Aggr
:= Make_Aggregate
(Loc
, No_List
, New_List
);
1223 Set_Etype
(Aggr
, T
);
1224 Set_Aggregate_Bounds
(Aggr
,
1226 Low_Bound
=> New_Copy
(Lo
),
1227 High_Bound
=> New_Copy
(Hi
)));
1228 Set_Parent
(Aggr
, Parent
(Proc
));
1230 Append_To
(Component_Associations
(Aggr
),
1231 Make_Component_Association
(Loc
,
1235 Low_Bound
=> New_Copy
(Lo
),
1236 High_Bound
=> New_Copy
(Hi
))),
1237 Expression
=> Expr
));
1239 if Static_Array_Aggregate
(Aggr
) then
1242 Initialization_Warning
(T
);
1245 end Build_Equivalent_Array_Aggregate
;
1247 ---------------------------------------
1248 -- Build_Equivalent_Record_Aggregate --
1249 ---------------------------------------
1251 function Build_Equivalent_Record_Aggregate
(T
: Entity_Id
) return Node_Id
is
1254 Comp_Type
: Entity_Id
;
1256 -- Start of processing for Build_Equivalent_Record_Aggregate
1259 if not Is_Record_Type
(T
)
1260 or else Has_Discriminants
(T
)
1261 or else Is_Limited_Type
(T
)
1262 or else Has_Non_Standard_Rep
(T
)
1264 Initialization_Warning
(T
);
1268 Comp
:= First_Component
(T
);
1270 -- A null record needs no warning
1276 while Present
(Comp
) loop
1278 -- Array components are acceptable if initialized by a positional
1279 -- aggregate with static components.
1281 if Is_Array_Type
(Etype
(Comp
)) then
1282 Comp_Type
:= Component_Type
(Etype
(Comp
));
1284 if Nkind
(Parent
(Comp
)) /= N_Component_Declaration
1285 or else No
(Expression
(Parent
(Comp
)))
1286 or else Nkind
(Expression
(Parent
(Comp
))) /= N_Aggregate
1288 Initialization_Warning
(T
);
1291 elsif Is_Scalar_Type
(Component_Type
(Etype
(Comp
)))
1293 (not Compile_Time_Known_Value
(Type_Low_Bound
(Comp_Type
))
1295 not Compile_Time_Known_Value
(Type_High_Bound
(Comp_Type
)))
1297 Initialization_Warning
(T
);
1301 not Static_Array_Aggregate
(Expression
(Parent
(Comp
)))
1303 Initialization_Warning
(T
);
1307 elsif Is_Scalar_Type
(Etype
(Comp
)) then
1308 Comp_Type
:= Etype
(Comp
);
1310 if Nkind
(Parent
(Comp
)) /= N_Component_Declaration
1311 or else No
(Expression
(Parent
(Comp
)))
1312 or else not Compile_Time_Known_Value
(Expression
(Parent
(Comp
)))
1313 or else not Compile_Time_Known_Value
(Type_Low_Bound
(Comp_Type
))
1315 Compile_Time_Known_Value
(Type_High_Bound
(Comp_Type
))
1317 Initialization_Warning
(T
);
1321 -- For now, other types are excluded
1324 Initialization_Warning
(T
);
1328 Next_Component
(Comp
);
1331 -- All components have static initialization. Build positional aggregate
1332 -- from the given expressions or defaults.
1334 Agg
:= Make_Aggregate
(Sloc
(T
), New_List
, New_List
);
1335 Set_Parent
(Agg
, Parent
(T
));
1337 Comp
:= First_Component
(T
);
1338 while Present
(Comp
) loop
1340 (New_Copy_Tree
(Expression
(Parent
(Comp
))), Expressions
(Agg
));
1341 Next_Component
(Comp
);
1344 Analyze_And_Resolve
(Agg
, T
);
1346 end Build_Equivalent_Record_Aggregate
;
1348 -------------------------------
1349 -- Build_Initialization_Call --
1350 -------------------------------
1352 -- References to a discriminant inside the record type declaration can
1353 -- appear either in the subtype_indication to constrain a record or an
1354 -- array, or as part of a larger expression given for the initial value
1355 -- of a component. In both of these cases N appears in the record
1356 -- initialization procedure and needs to be replaced by the formal
1357 -- parameter of the initialization procedure which corresponds to that
1360 -- In the example below, references to discriminants D1 and D2 in proc_1
1361 -- are replaced by references to formals with the same name
1364 -- A similar replacement is done for calls to any record initialization
1365 -- procedure for any components that are themselves of a record type.
1367 -- type R (D1, D2 : Integer) is record
1368 -- X : Integer := F * D1;
1369 -- Y : Integer := F * D2;
1372 -- procedure proc_1 (Out_2 : out R; D1 : Integer; D2 : Integer) is
1376 -- Out_2.X := F * D1;
1377 -- Out_2.Y := F * D2;
1380 function Build_Initialization_Call
1384 In_Init_Proc
: Boolean := False;
1385 Enclos_Type
: Entity_Id
:= Empty
;
1386 Discr_Map
: Elist_Id
:= New_Elmt_List
;
1387 With_Default_Init
: Boolean := False;
1388 Constructor_Ref
: Node_Id
:= Empty
) return List_Id
1390 Res
: constant List_Id
:= New_List
;
1393 Controller_Typ
: Entity_Id
;
1397 First_Arg
: Node_Id
;
1398 Full_Init_Type
: Entity_Id
;
1399 Full_Type
: Entity_Id
:= Typ
;
1400 Init_Type
: Entity_Id
;
1404 pragma Assert
(Constructor_Ref
= Empty
1405 or else Is_CPP_Constructor_Call
(Constructor_Ref
));
1407 if No
(Constructor_Ref
) then
1408 Proc
:= Base_Init_Proc
(Typ
);
1410 Proc
:= Base_Init_Proc
(Typ
, Entity
(Name
(Constructor_Ref
)));
1413 pragma Assert
(Present
(Proc
));
1414 Init_Type
:= Etype
(First_Formal
(Proc
));
1415 Full_Init_Type
:= Underlying_Type
(Init_Type
);
1417 -- Nothing to do if the Init_Proc is null, unless Initialize_Scalars
1418 -- is active (in which case we make the call anyway, since in the
1419 -- actual compiled client it may be non null).
1420 -- Also nothing to do for value types.
1422 if (Is_Null_Init_Proc
(Proc
) and then not Init_Or_Norm_Scalars
)
1423 or else Is_Value_Type
(Typ
)
1425 (Is_Array_Type
(Typ
) and then Is_Value_Type
(Component_Type
(Typ
)))
1430 -- Go to full view if private type. In the case of successive
1431 -- private derivations, this can require more than one step.
1433 while Is_Private_Type
(Full_Type
)
1434 and then Present
(Full_View
(Full_Type
))
1436 Full_Type
:= Full_View
(Full_Type
);
1439 -- If Typ is derived, the procedure is the initialization procedure for
1440 -- the root type. Wrap the argument in an conversion to make it type
1441 -- honest. Actually it isn't quite type honest, because there can be
1442 -- conflicts of views in the private type case. That is why we set
1443 -- Conversion_OK in the conversion node.
1445 if (Is_Record_Type
(Typ
)
1446 or else Is_Array_Type
(Typ
)
1447 or else Is_Private_Type
(Typ
))
1448 and then Init_Type
/= Base_Type
(Typ
)
1450 First_Arg
:= OK_Convert_To
(Etype
(Init_Type
), Id_Ref
);
1451 Set_Etype
(First_Arg
, Init_Type
);
1454 First_Arg
:= Id_Ref
;
1457 Args
:= New_List
(Convert_Concurrent
(First_Arg
, Typ
));
1459 -- In the tasks case, add _Master as the value of the _Master parameter
1460 -- and _Chain as the value of the _Chain parameter. At the outer level,
1461 -- these will be variables holding the corresponding values obtained
1462 -- from GNARL. At inner levels, they will be the parameters passed down
1463 -- through the outer routines.
1465 if Has_Task
(Full_Type
) then
1466 if Restriction_Active
(No_Task_Hierarchy
) then
1468 -- See comments in System.Tasking.Initialization.Init_RTS
1469 -- for the value 3 (should be rtsfindable constant ???)
1471 Append_To
(Args
, Make_Integer_Literal
(Loc
, 3));
1474 Append_To
(Args
, Make_Identifier
(Loc
, Name_uMaster
));
1477 Append_To
(Args
, Make_Identifier
(Loc
, Name_uChain
));
1479 -- Ada 2005 (AI-287): In case of default initialized components
1480 -- with tasks, we generate a null string actual parameter.
1481 -- This is just a workaround that must be improved later???
1483 if With_Default_Init
then
1485 Make_String_Literal
(Loc
,
1490 Build_Task_Image_Decls
(Loc
, Id_Ref
, Enclos_Type
, In_Init_Proc
);
1491 Decl
:= Last
(Decls
);
1494 New_Occurrence_Of
(Defining_Identifier
(Decl
), Loc
));
1495 Append_List
(Decls
, Res
);
1503 -- Add discriminant values if discriminants are present
1505 if Has_Discriminants
(Full_Init_Type
) then
1506 Discr
:= First_Discriminant
(Full_Init_Type
);
1508 while Present
(Discr
) loop
1510 -- If this is a discriminated concurrent type, the init_proc
1511 -- for the corresponding record is being called. Use that type
1512 -- directly to find the discriminant value, to handle properly
1513 -- intervening renamed discriminants.
1516 T
: Entity_Id
:= Full_Type
;
1519 if Is_Protected_Type
(T
) then
1520 T
:= Corresponding_Record_Type
(T
);
1522 elsif Is_Private_Type
(T
)
1523 and then Present
(Underlying_Full_View
(T
))
1524 and then Is_Protected_Type
(Underlying_Full_View
(T
))
1526 T
:= Corresponding_Record_Type
(Underlying_Full_View
(T
));
1530 Get_Discriminant_Value
(
1533 Discriminant_Constraint
(Full_Type
));
1536 if In_Init_Proc
then
1538 -- Replace any possible references to the discriminant in the
1539 -- call to the record initialization procedure with references
1540 -- to the appropriate formal parameter.
1542 if Nkind
(Arg
) = N_Identifier
1543 and then Ekind
(Entity
(Arg
)) = E_Discriminant
1545 Arg
:= New_Reference_To
(Discriminal
(Entity
(Arg
)), Loc
);
1547 -- Case of access discriminants. We replace the reference
1548 -- to the type by a reference to the actual object
1550 elsif Nkind
(Arg
) = N_Attribute_Reference
1551 and then Is_Access_Type
(Etype
(Arg
))
1552 and then Is_Entity_Name
(Prefix
(Arg
))
1553 and then Is_Type
(Entity
(Prefix
(Arg
)))
1556 Make_Attribute_Reference
(Loc
,
1557 Prefix
=> New_Copy
(Prefix
(Id_Ref
)),
1558 Attribute_Name
=> Name_Unrestricted_Access
);
1560 -- Otherwise make a copy of the default expression. Note that
1561 -- we use the current Sloc for this, because we do not want the
1562 -- call to appear to be at the declaration point. Within the
1563 -- expression, replace discriminants with their discriminals.
1567 New_Copy_Tree
(Arg
, Map
=> Discr_Map
, New_Sloc
=> Loc
);
1571 if Is_Constrained
(Full_Type
) then
1572 Arg
:= Duplicate_Subexpr_No_Checks
(Arg
);
1574 -- The constraints come from the discriminant default exps,
1575 -- they must be reevaluated, so we use New_Copy_Tree but we
1576 -- ensure the proper Sloc (for any embedded calls).
1578 Arg
:= New_Copy_Tree
(Arg
, New_Sloc
=> Loc
);
1582 -- Ada 2005 (AI-287): In case of default initialized components,
1583 -- if the component is constrained with a discriminant of the
1584 -- enclosing type, we need to generate the corresponding selected
1585 -- component node to access the discriminant value. In other cases
1586 -- this is not required, either because we are inside the init
1587 -- proc and we use the corresponding formal, or else because the
1588 -- component is constrained by an expression.
1590 if With_Default_Init
1591 and then Nkind
(Id_Ref
) = N_Selected_Component
1592 and then Nkind
(Arg
) = N_Identifier
1593 and then Ekind
(Entity
(Arg
)) = E_Discriminant
1596 Make_Selected_Component
(Loc
,
1597 Prefix
=> New_Copy_Tree
(Prefix
(Id_Ref
)),
1598 Selector_Name
=> Arg
));
1600 Append_To
(Args
, Arg
);
1603 Next_Discriminant
(Discr
);
1607 -- If this is a call to initialize the parent component of a derived
1608 -- tagged type, indicate that the tag should not be set in the parent.
1610 if Is_Tagged_Type
(Full_Init_Type
)
1611 and then not Is_CPP_Class
(Full_Init_Type
)
1612 and then Nkind
(Id_Ref
) = N_Selected_Component
1613 and then Chars
(Selector_Name
(Id_Ref
)) = Name_uParent
1615 Append_To
(Args
, New_Occurrence_Of
(Standard_False
, Loc
));
1617 elsif Present
(Constructor_Ref
) then
1618 Append_List_To
(Args
,
1619 New_Copy_List
(Parameter_Associations
(Constructor_Ref
)));
1623 Make_Procedure_Call_Statement
(Loc
,
1624 Name
=> New_Occurrence_Of
(Proc
, Loc
),
1625 Parameter_Associations
=> Args
));
1627 if Needs_Finalization
(Typ
)
1628 and then Nkind
(Id_Ref
) = N_Selected_Component
1630 if Chars
(Selector_Name
(Id_Ref
)) /= Name_uParent
then
1631 Append_List_To
(Res
,
1633 Ref
=> New_Copy_Tree
(First_Arg
),
1636 Find_Final_List
(Typ
, New_Copy_Tree
(First_Arg
)),
1637 With_Attach
=> Make_Integer_Literal
(Loc
, 1)));
1639 -- If the enclosing type is an extension with new controlled
1640 -- components, it has his own record controller. If the parent
1641 -- also had a record controller, attach it to the new one.
1643 -- Build_Init_Statements relies on the fact that in this specific
1644 -- case the last statement of the result is the attach call to
1645 -- the controller. If this is changed, it must be synchronized.
1647 elsif Present
(Enclos_Type
)
1648 and then Has_New_Controlled_Component
(Enclos_Type
)
1649 and then Has_Controlled_Component
(Typ
)
1651 if Is_Inherently_Limited_Type
(Typ
) then
1652 Controller_Typ
:= RTE
(RE_Limited_Record_Controller
);
1654 Controller_Typ
:= RTE
(RE_Record_Controller
);
1657 Append_List_To
(Res
,
1660 Make_Selected_Component
(Loc
,
1661 Prefix
=> New_Copy_Tree
(First_Arg
),
1662 Selector_Name
=> Make_Identifier
(Loc
, Name_uController
)),
1663 Typ
=> Controller_Typ
,
1664 Flist_Ref
=> Find_Final_List
(Typ
, New_Copy_Tree
(First_Arg
)),
1665 With_Attach
=> Make_Integer_Literal
(Loc
, 1)));
1672 when RE_Not_Available
=>
1674 end Build_Initialization_Call
;
1676 ---------------------------
1677 -- Build_Master_Renaming --
1678 ---------------------------
1680 function Build_Master_Renaming
1682 T
: Entity_Id
) return Entity_Id
1684 Loc
: constant Source_Ptr
:= Sloc
(N
);
1689 -- Nothing to do if there is no task hierarchy
1691 if Restriction_Active
(No_Task_Hierarchy
) then
1696 Make_Defining_Identifier
(Loc
,
1697 New_External_Name
(Chars
(T
), 'M'));
1700 Make_Object_Renaming_Declaration
(Loc
,
1701 Defining_Identifier
=> M_Id
,
1702 Subtype_Mark
=> New_Reference_To
(RTE
(RE_Master_Id
), Loc
),
1703 Name
=> Make_Identifier
(Loc
, Name_uMaster
));
1704 Insert_Before
(N
, Decl
);
1709 when RE_Not_Available
=>
1711 end Build_Master_Renaming
;
1713 ---------------------------
1714 -- Build_Master_Renaming --
1715 ---------------------------
1717 procedure Build_Master_Renaming
(N
: Node_Id
; T
: Entity_Id
) is
1721 -- Nothing to do if there is no task hierarchy
1723 if Restriction_Active
(No_Task_Hierarchy
) then
1727 M_Id
:= Build_Master_Renaming
(N
, T
);
1728 Set_Master_Id
(T
, M_Id
);
1731 when RE_Not_Available
=>
1733 end Build_Master_Renaming
;
1735 ----------------------------
1736 -- Build_Record_Init_Proc --
1737 ----------------------------
1739 procedure Build_Record_Init_Proc
(N
: Node_Id
; Pe
: Entity_Id
) is
1740 Loc
: Source_Ptr
:= Sloc
(N
);
1741 Discr_Map
: constant Elist_Id
:= New_Elmt_List
;
1742 Proc_Id
: Entity_Id
;
1743 Rec_Type
: Entity_Id
;
1744 Set_Tag
: Entity_Id
:= Empty
;
1746 function Build_Assignment
(Id
: Entity_Id
; N
: Node_Id
) return List_Id
;
1747 -- Build a assignment statement node which assigns to record component
1748 -- its default expression if defined. The assignment left hand side is
1749 -- marked Assignment_OK so that initialization of limited private
1750 -- records works correctly, Return also the adjustment call for
1751 -- controlled objects
1753 procedure Build_Discriminant_Assignments
(Statement_List
: List_Id
);
1754 -- If the record has discriminants, adds assignment statements to
1755 -- statement list to initialize the discriminant values from the
1756 -- arguments of the initialization procedure.
1758 function Build_Init_Statements
(Comp_List
: Node_Id
) return List_Id
;
1759 -- Build a list representing a sequence of statements which initialize
1760 -- components of the given component list. This may involve building
1761 -- case statements for the variant parts.
1763 function Build_Init_Call_Thru
(Parameters
: List_Id
) return List_Id
;
1764 -- Given a non-tagged type-derivation that declares discriminants,
1767 -- type R (R1, R2 : Integer) is record ... end record;
1769 -- type D (D1 : Integer) is new R (1, D1);
1771 -- we make the _init_proc of D be
1773 -- procedure _init_proc(X : D; D1 : Integer) is
1775 -- _init_proc( R(X), 1, D1);
1778 -- This function builds the call statement in this _init_proc.
1780 procedure Build_Init_Procedure
;
1781 -- Build the tree corresponding to the procedure specification and body
1782 -- of the initialization procedure (by calling all the preceding
1783 -- auxiliary routines), and install it as the _init TSS.
1785 procedure Build_Offset_To_Top_Functions
;
1786 -- Ada 2005 (AI-251): Build the tree corresponding to the procedure spec
1787 -- and body of the Offset_To_Top function that is generated when the
1788 -- parent of a type with discriminants has secondary dispatch tables.
1790 procedure Build_Record_Checks
(S
: Node_Id
; Check_List
: List_Id
);
1791 -- Add range checks to components of discriminated records. S is a
1792 -- subtype indication of a record component. Check_List is a list
1793 -- to which the check actions are appended.
1795 function Component_Needs_Simple_Initialization
1796 (T
: Entity_Id
) return Boolean;
1797 -- Determines if a component needs simple initialization, given its type
1798 -- T. This is the same as Needs_Simple_Initialization except for the
1799 -- following difference: the types Tag and Interface_Tag, that are
1800 -- access types which would normally require simple initialization to
1801 -- null, do not require initialization as components, since they are
1802 -- explicitly initialized by other means.
1804 procedure Constrain_Array
1806 Check_List
: List_Id
);
1807 -- Called from Build_Record_Checks.
1808 -- Apply a list of index constraints to an unconstrained array type.
1809 -- The first parameter is the entity for the resulting subtype.
1810 -- Check_List is a list to which the check actions are appended.
1812 procedure Constrain_Index
1815 Check_List
: List_Id
);
1816 -- Process an index constraint in a constrained array declaration.
1817 -- The constraint can be a subtype name, or a range with or without
1818 -- an explicit subtype mark. The index is the corresponding index of the
1819 -- unconstrained array. S is the range expression. Check_List is a list
1820 -- to which the check actions are appended (called from
1821 -- Build_Record_Checks).
1823 function Parent_Subtype_Renaming_Discrims
return Boolean;
1824 -- Returns True for base types N that rename discriminants, else False
1826 function Requires_Init_Proc
(Rec_Id
: Entity_Id
) return Boolean;
1827 -- Determines whether a record initialization procedure needs to be
1828 -- generated for the given record type.
1830 ----------------------
1831 -- Build_Assignment --
1832 ----------------------
1834 function Build_Assignment
(Id
: Entity_Id
; N
: Node_Id
) return List_Id
is
1837 Typ
: constant Entity_Id
:= Underlying_Type
(Etype
(Id
));
1838 Kind
: Node_Kind
:= Nkind
(N
);
1844 Make_Selected_Component
(Loc
,
1845 Prefix
=> Make_Identifier
(Loc
, Name_uInit
),
1846 Selector_Name
=> New_Occurrence_Of
(Id
, Loc
));
1847 Set_Assignment_OK
(Lhs
);
1849 -- Case of an access attribute applied to the current instance.
1850 -- Replace the reference to the type by a reference to the actual
1851 -- object. (Note that this handles the case of the top level of
1852 -- the expression being given by such an attribute, but does not
1853 -- cover uses nested within an initial value expression. Nested
1854 -- uses are unlikely to occur in practice, but are theoretically
1855 -- possible. It is not clear how to handle them without fully
1856 -- traversing the expression. ???
1858 if Kind
= N_Attribute_Reference
1859 and then (Attribute_Name
(N
) = Name_Unchecked_Access
1861 Attribute_Name
(N
) = Name_Unrestricted_Access
)
1862 and then Is_Entity_Name
(Prefix
(N
))
1863 and then Is_Type
(Entity
(Prefix
(N
)))
1864 and then Entity
(Prefix
(N
)) = Rec_Type
1867 Make_Attribute_Reference
(Loc
,
1868 Prefix
=> Make_Identifier
(Loc
, Name_uInit
),
1869 Attribute_Name
=> Name_Unrestricted_Access
);
1872 -- Take a copy of Exp to ensure that later copies of this component
1873 -- declaration in derived types see the original tree, not a node
1874 -- rewritten during expansion of the init_proc. If the copy contains
1875 -- itypes, the scope of the new itypes is the init_proc being built.
1877 Exp
:= New_Copy_Tree
(Exp
, New_Scope
=> Proc_Id
);
1880 Make_Assignment_Statement
(Loc
,
1882 Expression
=> Exp
));
1884 Set_No_Ctrl_Actions
(First
(Res
));
1886 -- Adjust the tag if tagged (because of possible view conversions).
1887 -- Suppress the tag adjustment when VM_Target because VM tags are
1888 -- represented implicitly in objects.
1890 if Is_Tagged_Type
(Typ
) and then Tagged_Type_Expansion
then
1892 Make_Assignment_Statement
(Loc
,
1894 Make_Selected_Component
(Loc
,
1895 Prefix
=> New_Copy_Tree
(Lhs
, New_Scope
=> Proc_Id
),
1897 New_Reference_To
(First_Tag_Component
(Typ
), Loc
)),
1900 Unchecked_Convert_To
(RTE
(RE_Tag
),
1902 (Node
(First_Elmt
(Access_Disp_Table
(Typ
))), Loc
))));
1905 -- Adjust the component if controlled except if it is an aggregate
1906 -- that will be expanded inline.
1908 if Kind
= N_Qualified_Expression
then
1909 Kind
:= Nkind
(Expression
(N
));
1912 if Needs_Finalization
(Typ
)
1913 and then not (Nkind_In
(Kind
, N_Aggregate
, N_Extension_Aggregate
))
1914 and then not Is_Inherently_Limited_Type
(Typ
)
1917 Ref
: constant Node_Id
:=
1918 New_Copy_Tree
(Lhs
, New_Scope
=> Proc_Id
);
1920 Append_List_To
(Res
,
1924 Flist_Ref
=> Find_Final_List
(Etype
(Id
), Ref
),
1925 With_Attach
=> Make_Integer_Literal
(Loc
, 1)));
1932 when RE_Not_Available
=>
1934 end Build_Assignment
;
1936 ------------------------------------
1937 -- Build_Discriminant_Assignments --
1938 ------------------------------------
1940 procedure Build_Discriminant_Assignments
(Statement_List
: List_Id
) is
1942 Is_Tagged
: constant Boolean := Is_Tagged_Type
(Rec_Type
);
1945 if Has_Discriminants
(Rec_Type
)
1946 and then not Is_Unchecked_Union
(Rec_Type
)
1948 D
:= First_Discriminant
(Rec_Type
);
1950 while Present
(D
) loop
1952 -- Don't generate the assignment for discriminants in derived
1953 -- tagged types if the discriminant is a renaming of some
1954 -- ancestor discriminant. This initialization will be done
1955 -- when initializing the _parent field of the derived record.
1957 if Is_Tagged
and then
1958 Present
(Corresponding_Discriminant
(D
))
1964 Append_List_To
(Statement_List
,
1965 Build_Assignment
(D
,
1966 New_Reference_To
(Discriminal
(D
), Loc
)));
1969 Next_Discriminant
(D
);
1972 end Build_Discriminant_Assignments
;
1974 --------------------------
1975 -- Build_Init_Call_Thru --
1976 --------------------------
1978 function Build_Init_Call_Thru
(Parameters
: List_Id
) return List_Id
is
1979 Parent_Proc
: constant Entity_Id
:=
1980 Base_Init_Proc
(Etype
(Rec_Type
));
1982 Parent_Type
: constant Entity_Id
:=
1983 Etype
(First_Formal
(Parent_Proc
));
1985 Uparent_Type
: constant Entity_Id
:=
1986 Underlying_Type
(Parent_Type
);
1988 First_Discr_Param
: Node_Id
;
1990 Parent_Discr
: Entity_Id
;
1991 First_Arg
: Node_Id
;
1997 -- First argument (_Init) is the object to be initialized.
1998 -- ??? not sure where to get a reasonable Loc for First_Arg
2001 OK_Convert_To
(Parent_Type
,
2002 New_Reference_To
(Defining_Identifier
(First
(Parameters
)), Loc
));
2004 Set_Etype
(First_Arg
, Parent_Type
);
2006 Args
:= New_List
(Convert_Concurrent
(First_Arg
, Rec_Type
));
2008 -- In the tasks case,
2009 -- add _Master as the value of the _Master parameter
2010 -- add _Chain as the value of the _Chain parameter.
2011 -- add _Task_Name as the value of the _Task_Name parameter.
2012 -- At the outer level, these will be variables holding the
2013 -- corresponding values obtained from GNARL or the expander.
2015 -- At inner levels, they will be the parameters passed down through
2016 -- the outer routines.
2018 First_Discr_Param
:= Next
(First
(Parameters
));
2020 if Has_Task
(Rec_Type
) then
2021 if Restriction_Active
(No_Task_Hierarchy
) then
2023 -- See comments in System.Tasking.Initialization.Init_RTS
2026 Append_To
(Args
, Make_Integer_Literal
(Loc
, 3));
2028 Append_To
(Args
, Make_Identifier
(Loc
, Name_uMaster
));
2031 Append_To
(Args
, Make_Identifier
(Loc
, Name_uChain
));
2032 Append_To
(Args
, Make_Identifier
(Loc
, Name_uTask_Name
));
2033 First_Discr_Param
:= Next
(Next
(Next
(First_Discr_Param
)));
2036 -- Append discriminant values
2038 if Has_Discriminants
(Uparent_Type
) then
2039 pragma Assert
(not Is_Tagged_Type
(Uparent_Type
));
2041 Parent_Discr
:= First_Discriminant
(Uparent_Type
);
2042 while Present
(Parent_Discr
) loop
2044 -- Get the initial value for this discriminant
2045 -- ??? needs to be cleaned up to use parent_Discr_Constr
2049 Discr_Value
: Elmt_Id
:=
2051 (Stored_Constraint
(Rec_Type
));
2053 Discr
: Entity_Id
:=
2054 First_Stored_Discriminant
(Uparent_Type
);
2056 while Original_Record_Component
(Parent_Discr
) /= Discr
loop
2057 Next_Stored_Discriminant
(Discr
);
2058 Next_Elmt
(Discr_Value
);
2061 Arg
:= Node
(Discr_Value
);
2064 -- Append it to the list
2066 if Nkind
(Arg
) = N_Identifier
2067 and then Ekind
(Entity
(Arg
)) = E_Discriminant
2070 New_Reference_To
(Discriminal
(Entity
(Arg
)), Loc
));
2072 -- Case of access discriminants. We replace the reference
2073 -- to the type by a reference to the actual object.
2075 -- Is above comment right??? Use of New_Copy below seems mighty
2079 Append_To
(Args
, New_Copy
(Arg
));
2082 Next_Discriminant
(Parent_Discr
);
2088 Make_Procedure_Call_Statement
(Loc
,
2089 Name
=> New_Occurrence_Of
(Parent_Proc
, Loc
),
2090 Parameter_Associations
=> Args
));
2093 end Build_Init_Call_Thru
;
2095 -----------------------------------
2096 -- Build_Offset_To_Top_Functions --
2097 -----------------------------------
2099 procedure Build_Offset_To_Top_Functions
is
2101 procedure Build_Offset_To_Top_Function
(Iface_Comp
: Entity_Id
);
2103 -- function Fxx (O : in Rec_Typ) return Storage_Offset is
2105 -- return O.Iface_Comp'Position;
2108 ----------------------------------
2109 -- Build_Offset_To_Top_Function --
2110 ----------------------------------
2112 procedure Build_Offset_To_Top_Function
(Iface_Comp
: Entity_Id
) is
2113 Body_Node
: Node_Id
;
2114 Func_Id
: Entity_Id
;
2115 Spec_Node
: Node_Id
;
2119 Make_Defining_Identifier
(Loc
,
2120 Chars
=> New_Internal_Name
('F'));
2122 Set_DT_Offset_To_Top_Func
(Iface_Comp
, Func_Id
);
2125 -- function Fxx (O : in Rec_Typ) return Storage_Offset;
2127 Spec_Node
:= New_Node
(N_Function_Specification
, Loc
);
2128 Set_Defining_Unit_Name
(Spec_Node
, Func_Id
);
2129 Set_Parameter_Specifications
(Spec_Node
, New_List
(
2130 Make_Parameter_Specification
(Loc
,
2131 Defining_Identifier
=> Make_Defining_Identifier
(Loc
, Name_uO
),
2133 Parameter_Type
=> New_Reference_To
(Rec_Type
, Loc
))));
2134 Set_Result_Definition
(Spec_Node
,
2135 New_Reference_To
(RTE
(RE_Storage_Offset
), Loc
));
2138 -- function Fxx (O : in Rec_Typ) return Storage_Offset is
2140 -- return O.Iface_Comp'Position;
2143 Body_Node
:= New_Node
(N_Subprogram_Body
, Loc
);
2144 Set_Specification
(Body_Node
, Spec_Node
);
2145 Set_Declarations
(Body_Node
, New_List
);
2146 Set_Handled_Statement_Sequence
(Body_Node
,
2147 Make_Handled_Sequence_Of_Statements
(Loc
,
2148 Statements
=> New_List
(
2149 Make_Simple_Return_Statement
(Loc
,
2151 Make_Attribute_Reference
(Loc
,
2153 Make_Selected_Component
(Loc
,
2154 Prefix
=> Make_Identifier
(Loc
, Name_uO
),
2155 Selector_Name
=> New_Reference_To
2157 Attribute_Name
=> Name_Position
)))));
2159 Set_Ekind
(Func_Id
, E_Function
);
2160 Set_Mechanism
(Func_Id
, Default_Mechanism
);
2161 Set_Is_Internal
(Func_Id
, True);
2163 if not Debug_Generated_Code
then
2164 Set_Debug_Info_Off
(Func_Id
);
2167 Analyze
(Body_Node
);
2169 Append_Freeze_Action
(Rec_Type
, Body_Node
);
2170 end Build_Offset_To_Top_Function
;
2174 Ifaces_Comp_List
: Elist_Id
;
2175 Iface_Comp_Elmt
: Elmt_Id
;
2176 Iface_Comp
: Node_Id
;
2178 -- Start of processing for Build_Offset_To_Top_Functions
2181 -- Offset_To_Top_Functions are built only for derivations of types
2182 -- with discriminants that cover interface types.
2183 -- Nothing is needed either in case of virtual machines, since
2184 -- interfaces are handled directly by the VM.
2186 if not Is_Tagged_Type
(Rec_Type
)
2187 or else Etype
(Rec_Type
) = Rec_Type
2188 or else not Has_Discriminants
(Etype
(Rec_Type
))
2189 or else not Tagged_Type_Expansion
2194 Collect_Interface_Components
(Rec_Type
, Ifaces_Comp_List
);
2196 -- For each interface type with secondary dispatch table we generate
2197 -- the Offset_To_Top_Functions (required to displace the pointer in
2198 -- interface conversions)
2200 Iface_Comp_Elmt
:= First_Elmt
(Ifaces_Comp_List
);
2201 while Present
(Iface_Comp_Elmt
) loop
2202 Iface_Comp
:= Node
(Iface_Comp_Elmt
);
2203 pragma Assert
(Is_Interface
(Related_Type
(Iface_Comp
)));
2205 -- If the interface is a parent of Rec_Type it shares the primary
2206 -- dispatch table and hence there is no need to build the function
2208 if not Is_Ancestor
(Related_Type
(Iface_Comp
), Rec_Type
) then
2209 Build_Offset_To_Top_Function
(Iface_Comp
);
2212 Next_Elmt
(Iface_Comp_Elmt
);
2214 end Build_Offset_To_Top_Functions
;
2216 --------------------------
2217 -- Build_Init_Procedure --
2218 --------------------------
2220 procedure Build_Init_Procedure
is
2221 Body_Node
: Node_Id
;
2222 Handled_Stmt_Node
: Node_Id
;
2223 Parameters
: List_Id
;
2224 Proc_Spec_Node
: Node_Id
;
2225 Body_Stmts
: List_Id
;
2226 Record_Extension_Node
: Node_Id
;
2227 Init_Tags_List
: List_Id
;
2230 Body_Stmts
:= New_List
;
2231 Body_Node
:= New_Node
(N_Subprogram_Body
, Loc
);
2232 Set_Ekind
(Proc_Id
, E_Procedure
);
2234 Proc_Spec_Node
:= New_Node
(N_Procedure_Specification
, Loc
);
2235 Set_Defining_Unit_Name
(Proc_Spec_Node
, Proc_Id
);
2237 Parameters
:= Init_Formals
(Rec_Type
);
2238 Append_List_To
(Parameters
,
2239 Build_Discriminant_Formals
(Rec_Type
, True));
2241 -- For tagged types, we add a flag to indicate whether the routine
2242 -- is called to initialize a parent component in the init_proc of
2243 -- a type extension. If the flag is false, we do not set the tag
2244 -- because it has been set already in the extension.
2246 if Is_Tagged_Type
(Rec_Type
)
2247 and then not Is_CPP_Class
(Rec_Type
)
2250 Make_Defining_Identifier
(Loc
,
2251 Chars
=> New_Internal_Name
('P'));
2253 Append_To
(Parameters
,
2254 Make_Parameter_Specification
(Loc
,
2255 Defining_Identifier
=> Set_Tag
,
2256 Parameter_Type
=> New_Occurrence_Of
(Standard_Boolean
, Loc
),
2257 Expression
=> New_Occurrence_Of
(Standard_True
, Loc
)));
2260 Set_Parameter_Specifications
(Proc_Spec_Node
, Parameters
);
2261 Set_Specification
(Body_Node
, Proc_Spec_Node
);
2262 Set_Declarations
(Body_Node
, New_List
);
2264 if Parent_Subtype_Renaming_Discrims
then
2266 -- N is a Derived_Type_Definition that renames the parameters
2267 -- of the ancestor type. We initialize it by expanding our
2268 -- discriminants and call the ancestor _init_proc with a
2269 -- type-converted object
2271 Append_List_To
(Body_Stmts
,
2272 Build_Init_Call_Thru
(Parameters
));
2274 elsif Nkind
(Type_Definition
(N
)) = N_Record_Definition
then
2275 Build_Discriminant_Assignments
(Body_Stmts
);
2277 if not Null_Present
(Type_Definition
(N
)) then
2278 Append_List_To
(Body_Stmts
,
2279 Build_Init_Statements
(
2280 Component_List
(Type_Definition
(N
))));
2284 -- N is a Derived_Type_Definition with a possible non-empty
2285 -- extension. The initialization of a type extension consists
2286 -- in the initialization of the components in the extension.
2288 Build_Discriminant_Assignments
(Body_Stmts
);
2290 Record_Extension_Node
:=
2291 Record_Extension_Part
(Type_Definition
(N
));
2293 if not Null_Present
(Record_Extension_Node
) then
2295 Stmts
: constant List_Id
:=
2296 Build_Init_Statements
(
2297 Component_List
(Record_Extension_Node
));
2300 -- The parent field must be initialized first because
2301 -- the offset of the new discriminants may depend on it
2303 Prepend_To
(Body_Stmts
, Remove_Head
(Stmts
));
2304 Append_List_To
(Body_Stmts
, Stmts
);
2309 -- Add here the assignment to instantiate the Tag
2311 -- The assignment corresponds to the code:
2313 -- _Init._Tag := Typ'Tag;
2315 -- Suppress the tag assignment when VM_Target because VM tags are
2316 -- represented implicitly in objects. It is also suppressed in case
2317 -- of CPP_Class types because in this case the tag is initialized in
2320 if Is_Tagged_Type
(Rec_Type
)
2321 and then not Is_CPP_Class
(Rec_Type
)
2322 and then Tagged_Type_Expansion
2323 and then not No_Run_Time_Mode
2325 -- Initialize the primary tag
2327 Init_Tags_List
:= New_List
(
2328 Make_Assignment_Statement
(Loc
,
2330 Make_Selected_Component
(Loc
,
2331 Prefix
=> Make_Identifier
(Loc
, Name_uInit
),
2333 New_Reference_To
(First_Tag_Component
(Rec_Type
), Loc
)),
2337 (Node
(First_Elmt
(Access_Disp_Table
(Rec_Type
))), Loc
)));
2339 -- Generate the SCIL node associated with the initialization of
2340 -- the tag component.
2342 if Generate_SCIL
then
2348 Make_SCIL_Tag_Init
(Sloc
(First
(Init_Tags_List
)));
2349 Set_SCIL_Related_Node
(New_Node
, First
(Init_Tags_List
));
2350 Set_SCIL_Entity
(New_Node
, Rec_Type
);
2351 Prepend_To
(Init_Tags_List
, New_Node
);
2355 -- Ada 2005 (AI-251): Initialize the secondary tags components
2356 -- located at fixed positions (tags whose position depends on
2357 -- variable size components are initialized later ---see below).
2359 if Ada_Version
>= Ada_05
2360 and then not Is_Interface
(Rec_Type
)
2361 and then Has_Interfaces
(Rec_Type
)
2365 Target
=> Make_Identifier
(Loc
, Name_uInit
),
2366 Stmts_List
=> Init_Tags_List
,
2367 Fixed_Comps
=> True,
2368 Variable_Comps
=> False);
2371 -- The tag must be inserted before the assignments to other
2372 -- components, because the initial value of the component may
2373 -- depend on the tag (eg. through a dispatching operation on
2374 -- an access to the current type). The tag assignment is not done
2375 -- when initializing the parent component of a type extension,
2376 -- because in that case the tag is set in the extension.
2378 -- Extensions of imported C++ classes add a final complication,
2379 -- because we cannot inhibit tag setting in the constructor for
2380 -- the parent. In that case we insert the tag initialization
2381 -- after the calls to initialize the parent.
2383 if not Is_CPP_Class
(Root_Type
(Rec_Type
)) then
2384 Prepend_To
(Body_Stmts
,
2385 Make_If_Statement
(Loc
,
2386 Condition
=> New_Occurrence_Of
(Set_Tag
, Loc
),
2387 Then_Statements
=> Init_Tags_List
));
2389 -- CPP_Class derivation: In this case the dispatch table of the
2390 -- parent was built in the C++ side and we copy the table of the
2391 -- parent to initialize the new dispatch table.
2398 -- We assume the first init_proc call is for the parent
2400 Nod
:= First
(Body_Stmts
);
2401 while Present
(Next
(Nod
))
2402 and then (Nkind
(Nod
) /= N_Procedure_Call_Statement
2403 or else not Is_Init_Proc
(Name
(Nod
)))
2409 -- ancestor_constructor (_init.parent);
2411 -- inherit_prim_ops (_init._tag, new_dt, num_prims);
2412 -- _init._tag := new_dt;
2415 Prepend_To
(Init_Tags_List
,
2416 Build_Inherit_Prims
(Loc
,
2419 Make_Selected_Component
(Loc
,
2421 Make_Identifier
(Loc
,
2422 Chars
=> Name_uInit
),
2425 (First_Tag_Component
(Rec_Type
), Loc
)),
2428 (Node
(First_Elmt
(Access_Disp_Table
(Rec_Type
))),
2432 (DT_Entry_Count
(First_Tag_Component
(Rec_Type
)))));
2435 Make_If_Statement
(Loc
,
2436 Condition
=> New_Occurrence_Of
(Set_Tag
, Loc
),
2437 Then_Statements
=> Init_Tags_List
));
2439 -- We have inherited table of the parent from the CPP side.
2440 -- Now we fill the slots associated with Ada primitives.
2441 -- This needs more work to avoid its execution each time
2442 -- an object is initialized???
2449 E
:= First_Elmt
(Primitive_Operations
(Rec_Type
));
2450 while Present
(E
) loop
2453 if not Is_Imported
(Prim
)
2454 and then Convention
(Prim
) = Convention_CPP
2455 and then not Present
(Interface_Alias
(Prim
))
2457 Append_List_To
(Init_Tags_List
,
2458 Register_Primitive
(Loc
, Prim
=> Prim
));
2467 -- Ada 2005 (AI-251): Initialize the secondary tag components
2468 -- located at variable positions. We delay the generation of this
2469 -- code until here because the value of the attribute 'Position
2470 -- applied to variable size components of the parent type that
2471 -- depend on discriminants is only safely read at runtime after
2472 -- the parent components have been initialized.
2474 if Ada_Version
>= Ada_05
2475 and then not Is_Interface
(Rec_Type
)
2476 and then Has_Interfaces
(Rec_Type
)
2477 and then Has_Discriminants
(Etype
(Rec_Type
))
2478 and then Is_Variable_Size_Record
(Etype
(Rec_Type
))
2480 Init_Tags_List
:= New_List
;
2484 Target
=> Make_Identifier
(Loc
, Name_uInit
),
2485 Stmts_List
=> Init_Tags_List
,
2486 Fixed_Comps
=> False,
2487 Variable_Comps
=> True);
2489 if Is_Non_Empty_List
(Init_Tags_List
) then
2490 Append_List_To
(Body_Stmts
, Init_Tags_List
);
2495 Handled_Stmt_Node
:= New_Node
(N_Handled_Sequence_Of_Statements
, Loc
);
2496 Set_Statements
(Handled_Stmt_Node
, Body_Stmts
);
2497 Set_Exception_Handlers
(Handled_Stmt_Node
, No_List
);
2498 Set_Handled_Statement_Sequence
(Body_Node
, Handled_Stmt_Node
);
2500 if not Debug_Generated_Code
then
2501 Set_Debug_Info_Off
(Proc_Id
);
2504 -- Associate Init_Proc with type, and determine if the procedure
2505 -- is null (happens because of the Initialize_Scalars pragma case,
2506 -- where we have to generate a null procedure in case it is called
2507 -- by a client with Initialize_Scalars set). Such procedures have
2508 -- to be generated, but do not have to be called, so we mark them
2509 -- as null to suppress the call.
2511 Set_Init_Proc
(Rec_Type
, Proc_Id
);
2513 if List_Length
(Body_Stmts
) = 1
2515 -- We must skip SCIL nodes because they may have been added to this
2516 -- list by Insert_Actions.
2518 and then Nkind
(First_Non_SCIL_Node
(Body_Stmts
)) = N_Null_Statement
2519 and then VM_Target
= No_VM
2521 -- Even though the init proc may be null at this time it might get
2522 -- some stuff added to it later by the VM backend.
2524 Set_Is_Null_Init_Proc
(Proc_Id
);
2526 end Build_Init_Procedure
;
2528 ---------------------------
2529 -- Build_Init_Statements --
2530 ---------------------------
2532 function Build_Init_Statements
(Comp_List
: Node_Id
) return List_Id
is
2533 Check_List
: constant List_Id
:= New_List
;
2538 Statement_List
: List_Id
;
2543 Per_Object_Constraint_Components
: Boolean;
2545 function Has_Access_Constraint
(E
: Entity_Id
) return Boolean;
2546 -- Components with access discriminants that depend on the current
2547 -- instance must be initialized after all other components.
2549 ---------------------------
2550 -- Has_Access_Constraint --
2551 ---------------------------
2553 function Has_Access_Constraint
(E
: Entity_Id
) return Boolean is
2555 T
: constant Entity_Id
:= Etype
(E
);
2558 if Has_Per_Object_Constraint
(E
)
2559 and then Has_Discriminants
(T
)
2561 Disc
:= First_Discriminant
(T
);
2562 while Present
(Disc
) loop
2563 if Is_Access_Type
(Etype
(Disc
)) then
2567 Next_Discriminant
(Disc
);
2574 end Has_Access_Constraint
;
2576 -- Start of processing for Build_Init_Statements
2579 if Null_Present
(Comp_List
) then
2580 return New_List
(Make_Null_Statement
(Loc
));
2583 Statement_List
:= New_List
;
2585 -- Loop through visible declarations of task types and protected
2586 -- types moving any expanded code from the spec to the body of the
2589 if Is_Task_Record_Type
(Rec_Type
)
2590 or else Is_Protected_Record_Type
(Rec_Type
)
2593 Decl
: constant Node_Id
:=
2594 Parent
(Corresponding_Concurrent_Type
(Rec_Type
));
2600 if Is_Task_Record_Type
(Rec_Type
) then
2601 Def
:= Task_Definition
(Decl
);
2603 Def
:= Protected_Definition
(Decl
);
2606 if Present
(Def
) then
2607 N1
:= First
(Visible_Declarations
(Def
));
2608 while Present
(N1
) loop
2612 if Nkind
(N2
) in N_Statement_Other_Than_Procedure_Call
2613 or else Nkind
(N2
) in N_Raise_xxx_Error
2614 or else Nkind
(N2
) = N_Procedure_Call_Statement
2616 Append_To
(Statement_List
,
2617 New_Copy_Tree
(N2
, New_Scope
=> Proc_Id
));
2618 Rewrite
(N2
, Make_Null_Statement
(Sloc
(N2
)));
2626 -- Loop through components, skipping pragmas, in 2 steps. The first
2627 -- step deals with regular components. The second step deals with
2628 -- components have per object constraints, and no explicit initia-
2631 Per_Object_Constraint_Components
:= False;
2633 -- First step : regular components
2635 Decl
:= First_Non_Pragma
(Component_Items
(Comp_List
));
2636 while Present
(Decl
) loop
2639 (Subtype_Indication
(Component_Definition
(Decl
)), Check_List
);
2641 Id
:= Defining_Identifier
(Decl
);
2644 if Has_Access_Constraint
(Id
)
2645 and then No
(Expression
(Decl
))
2647 -- Skip processing for now and ask for a second pass
2649 Per_Object_Constraint_Components
:= True;
2652 -- Case of explicit initialization
2654 if Present
(Expression
(Decl
)) then
2655 if Is_CPP_Constructor_Call
(Expression
(Decl
)) then
2657 Build_Initialization_Call
2660 Make_Selected_Component
(Loc
,
2662 Make_Identifier
(Loc
, Name_uInit
),
2663 Selector_Name
=> New_Occurrence_Of
(Id
, Loc
)),
2665 In_Init_Proc
=> True,
2666 Enclos_Type
=> Rec_Type
,
2667 Discr_Map
=> Discr_Map
,
2668 Constructor_Ref
=> Expression
(Decl
));
2670 Stmts
:= Build_Assignment
(Id
, Expression
(Decl
));
2673 -- Case of composite component with its own Init_Proc
2675 elsif not Is_Interface
(Typ
)
2676 and then Has_Non_Null_Base_Init_Proc
(Typ
)
2679 Build_Initialization_Call
2682 Make_Selected_Component
(Loc
,
2683 Prefix
=> Make_Identifier
(Loc
, Name_uInit
),
2684 Selector_Name
=> New_Occurrence_Of
(Id
, Loc
)),
2686 In_Init_Proc
=> True,
2687 Enclos_Type
=> Rec_Type
,
2688 Discr_Map
=> Discr_Map
);
2690 Clean_Task_Names
(Typ
, Proc_Id
);
2692 -- Case of component needing simple initialization
2694 elsif Component_Needs_Simple_Initialization
(Typ
) then
2697 (Id
, Get_Simple_Init_Val
(Typ
, N
, Esize
(Id
)));
2699 -- Nothing needed for this case
2705 if Present
(Check_List
) then
2706 Append_List_To
(Statement_List
, Check_List
);
2709 if Present
(Stmts
) then
2711 -- Add the initialization of the record controller before
2712 -- the _Parent field is attached to it when the attachment
2713 -- can occur. It does not work to simply initialize the
2714 -- controller first: it must be initialized after the parent
2715 -- if the parent holds discriminants that can be used to
2716 -- compute the offset of the controller. We assume here that
2717 -- the last statement of the initialization call is the
2718 -- attachment of the parent (see Build_Initialization_Call)
2720 if Chars
(Id
) = Name_uController
2721 and then Rec_Type
/= Etype
(Rec_Type
)
2722 and then Has_Controlled_Component
(Etype
(Rec_Type
))
2723 and then Has_New_Controlled_Component
(Rec_Type
)
2724 and then Present
(Last
(Statement_List
))
2726 Insert_List_Before
(Last
(Statement_List
), Stmts
);
2728 Append_List_To
(Statement_List
, Stmts
);
2733 Next_Non_Pragma
(Decl
);
2736 -- Set up tasks and protected object support. This needs to be done
2737 -- before any component with a per-object access discriminant
2738 -- constraint, or any variant part (which may contain such
2739 -- components) is initialized, because the initialization of these
2740 -- components may reference the enclosing concurrent object.
2742 -- For a task record type, add the task create call and calls
2743 -- to bind any interrupt (signal) entries.
2745 if Is_Task_Record_Type
(Rec_Type
) then
2747 -- In the case of the restricted run time the ATCB has already
2748 -- been preallocated.
2750 if Restricted_Profile
then
2751 Append_To
(Statement_List
,
2752 Make_Assignment_Statement
(Loc
,
2753 Name
=> Make_Selected_Component
(Loc
,
2754 Prefix
=> Make_Identifier
(Loc
, Name_uInit
),
2755 Selector_Name
=> Make_Identifier
(Loc
, Name_uTask_Id
)),
2756 Expression
=> Make_Attribute_Reference
(Loc
,
2758 Make_Selected_Component
(Loc
,
2759 Prefix
=> Make_Identifier
(Loc
, Name_uInit
),
2761 Make_Identifier
(Loc
, Name_uATCB
)),
2762 Attribute_Name
=> Name_Unchecked_Access
)));
2765 Append_To
(Statement_List
, Make_Task_Create_Call
(Rec_Type
));
2767 -- Generate the statements which map a string entry name to a
2768 -- task entry index. Note that the task may not have entries.
2770 if Entry_Names_OK
then
2771 Names
:= Build_Entry_Names
(Rec_Type
);
2773 if Present
(Names
) then
2774 Append_To
(Statement_List
, Names
);
2779 Task_Type
: constant Entity_Id
:=
2780 Corresponding_Concurrent_Type
(Rec_Type
);
2781 Task_Decl
: constant Node_Id
:= Parent
(Task_Type
);
2782 Task_Def
: constant Node_Id
:= Task_Definition
(Task_Decl
);
2787 if Present
(Task_Def
) then
2788 Vis_Decl
:= First
(Visible_Declarations
(Task_Def
));
2789 while Present
(Vis_Decl
) loop
2790 Loc
:= Sloc
(Vis_Decl
);
2792 if Nkind
(Vis_Decl
) = N_Attribute_Definition_Clause
then
2793 if Get_Attribute_Id
(Chars
(Vis_Decl
)) =
2796 Ent
:= Entity
(Name
(Vis_Decl
));
2798 if Ekind
(Ent
) = E_Entry
then
2799 Append_To
(Statement_List
,
2800 Make_Procedure_Call_Statement
(Loc
,
2801 Name
=> New_Reference_To
(
2802 RTE
(RE_Bind_Interrupt_To_Entry
), Loc
),
2803 Parameter_Associations
=> New_List
(
2804 Make_Selected_Component
(Loc
,
2806 Make_Identifier
(Loc
, Name_uInit
),
2808 Make_Identifier
(Loc
, Name_uTask_Id
)),
2809 Entry_Index_Expression
(
2810 Loc
, Ent
, Empty
, Task_Type
),
2811 Expression
(Vis_Decl
))));
2822 -- For a protected type, add statements generated by
2823 -- Make_Initialize_Protection.
2825 if Is_Protected_Record_Type
(Rec_Type
) then
2826 Append_List_To
(Statement_List
,
2827 Make_Initialize_Protection
(Rec_Type
));
2829 -- Generate the statements which map a string entry name to a
2830 -- protected entry index. Note that the protected type may not
2833 if Entry_Names_OK
then
2834 Names
:= Build_Entry_Names
(Rec_Type
);
2836 if Present
(Names
) then
2837 Append_To
(Statement_List
, Names
);
2842 if Per_Object_Constraint_Components
then
2844 -- Second pass: components with per-object constraints
2846 Decl
:= First_Non_Pragma
(Component_Items
(Comp_List
));
2847 while Present
(Decl
) loop
2849 Id
:= Defining_Identifier
(Decl
);
2852 if Has_Access_Constraint
(Id
)
2853 and then No
(Expression
(Decl
))
2855 if Has_Non_Null_Base_Init_Proc
(Typ
) then
2856 Append_List_To
(Statement_List
,
2857 Build_Initialization_Call
(Loc
,
2858 Make_Selected_Component
(Loc
,
2859 Prefix
=> Make_Identifier
(Loc
, Name_uInit
),
2860 Selector_Name
=> New_Occurrence_Of
(Id
, Loc
)),
2862 In_Init_Proc
=> True,
2863 Enclos_Type
=> Rec_Type
,
2864 Discr_Map
=> Discr_Map
));
2866 Clean_Task_Names
(Typ
, Proc_Id
);
2868 elsif Component_Needs_Simple_Initialization
(Typ
) then
2869 Append_List_To
(Statement_List
,
2871 (Id
, Get_Simple_Init_Val
(Typ
, N
, Esize
(Id
))));
2875 Next_Non_Pragma
(Decl
);
2879 -- Process the variant part
2881 if Present
(Variant_Part
(Comp_List
)) then
2882 Alt_List
:= New_List
;
2883 Variant
:= First_Non_Pragma
(Variants
(Variant_Part
(Comp_List
)));
2884 while Present
(Variant
) loop
2885 Loc
:= Sloc
(Variant
);
2886 Append_To
(Alt_List
,
2887 Make_Case_Statement_Alternative
(Loc
,
2889 New_Copy_List
(Discrete_Choices
(Variant
)),
2891 Build_Init_Statements
(Component_List
(Variant
))));
2892 Next_Non_Pragma
(Variant
);
2895 -- The expression of the case statement which is a reference
2896 -- to one of the discriminants is replaced by the appropriate
2897 -- formal parameter of the initialization procedure.
2899 Append_To
(Statement_List
,
2900 Make_Case_Statement
(Loc
,
2902 New_Reference_To
(Discriminal
(
2903 Entity
(Name
(Variant_Part
(Comp_List
)))), Loc
),
2904 Alternatives
=> Alt_List
));
2907 -- If no initializations when generated for component declarations
2908 -- corresponding to this Statement_List, append a null statement
2909 -- to the Statement_List to make it a valid Ada tree.
2911 if Is_Empty_List
(Statement_List
) then
2912 Append
(New_Node
(N_Null_Statement
, Loc
), Statement_List
);
2915 return Statement_List
;
2918 when RE_Not_Available
=>
2920 end Build_Init_Statements
;
2922 -------------------------
2923 -- Build_Record_Checks --
2924 -------------------------
2926 procedure Build_Record_Checks
(S
: Node_Id
; Check_List
: List_Id
) is
2927 Subtype_Mark_Id
: Entity_Id
;
2930 if Nkind
(S
) = N_Subtype_Indication
then
2931 Find_Type
(Subtype_Mark
(S
));
2932 Subtype_Mark_Id
:= Entity
(Subtype_Mark
(S
));
2934 -- Remaining processing depends on type
2936 case Ekind
(Subtype_Mark_Id
) is
2939 Constrain_Array
(S
, Check_List
);
2945 end Build_Record_Checks
;
2947 -------------------------------------------
2948 -- Component_Needs_Simple_Initialization --
2949 -------------------------------------------
2951 function Component_Needs_Simple_Initialization
2952 (T
: Entity_Id
) return Boolean
2956 Needs_Simple_Initialization
(T
)
2957 and then not Is_RTE
(T
, RE_Tag
)
2959 -- Ada 2005 (AI-251): Check also the tag of abstract interfaces
2961 and then not Is_RTE
(T
, RE_Interface_Tag
);
2962 end Component_Needs_Simple_Initialization
;
2964 ---------------------
2965 -- Constrain_Array --
2966 ---------------------
2968 procedure Constrain_Array
2970 Check_List
: List_Id
)
2972 C
: constant Node_Id
:= Constraint
(SI
);
2973 Number_Of_Constraints
: Nat
:= 0;
2978 T
:= Entity
(Subtype_Mark
(SI
));
2980 if Ekind
(T
) in Access_Kind
then
2981 T
:= Designated_Type
(T
);
2984 S
:= First
(Constraints
(C
));
2986 while Present
(S
) loop
2987 Number_Of_Constraints
:= Number_Of_Constraints
+ 1;
2991 -- In either case, the index constraint must provide a discrete
2992 -- range for each index of the array type and the type of each
2993 -- discrete range must be the same as that of the corresponding
2994 -- index. (RM 3.6.1)
2996 S
:= First
(Constraints
(C
));
2997 Index
:= First_Index
(T
);
3000 -- Apply constraints to each index type
3002 for J
in 1 .. Number_Of_Constraints
loop
3003 Constrain_Index
(Index
, S
, Check_List
);
3008 end Constrain_Array
;
3010 ---------------------
3011 -- Constrain_Index --
3012 ---------------------
3014 procedure Constrain_Index
3017 Check_List
: List_Id
)
3019 T
: constant Entity_Id
:= Etype
(Index
);
3022 if Nkind
(S
) = N_Range
then
3023 Process_Range_Expr_In_Decl
(S
, T
, Check_List
);
3025 end Constrain_Index
;
3027 --------------------------------------
3028 -- Parent_Subtype_Renaming_Discrims --
3029 --------------------------------------
3031 function Parent_Subtype_Renaming_Discrims
return Boolean is
3036 if Base_Type
(Pe
) /= Pe
then
3041 or else not Has_Discriminants
(Pe
)
3042 or else Is_Constrained
(Pe
)
3043 or else Is_Tagged_Type
(Pe
)
3048 -- If there are no explicit stored discriminants we have inherited
3049 -- the root type discriminants so far, so no renamings occurred.
3051 if First_Discriminant
(Pe
) = First_Stored_Discriminant
(Pe
) then
3055 -- Check if we have done some trivial renaming of the parent
3056 -- discriminants, i.e. something like
3058 -- type DT (X1,X2: int) is new PT (X1,X2);
3060 De
:= First_Discriminant
(Pe
);
3061 Dp
:= First_Discriminant
(Etype
(Pe
));
3063 while Present
(De
) loop
3064 pragma Assert
(Present
(Dp
));
3066 if Corresponding_Discriminant
(De
) /= Dp
then
3070 Next_Discriminant
(De
);
3071 Next_Discriminant
(Dp
);
3074 return Present
(Dp
);
3075 end Parent_Subtype_Renaming_Discrims
;
3077 ------------------------
3078 -- Requires_Init_Proc --
3079 ------------------------
3081 function Requires_Init_Proc
(Rec_Id
: Entity_Id
) return Boolean is
3082 Comp_Decl
: Node_Id
;
3087 -- Definitely do not need one if specifically suppressed
3089 if Suppress_Init_Proc
(Rec_Id
) then
3093 -- If it is a type derived from a type with unknown discriminants,
3094 -- we cannot build an initialization procedure for it.
3096 if Has_Unknown_Discriminants
(Rec_Id
)
3097 or else Has_Unknown_Discriminants
(Etype
(Rec_Id
))
3102 -- Otherwise we need to generate an initialization procedure if
3103 -- Is_CPP_Class is False and at least one of the following applies:
3105 -- 1. Discriminants are present, since they need to be initialized
3106 -- with the appropriate discriminant constraint expressions.
3107 -- However, the discriminant of an unchecked union does not
3108 -- count, since the discriminant is not present.
3110 -- 2. The type is a tagged type, since the implicit Tag component
3111 -- needs to be initialized with a pointer to the dispatch table.
3113 -- 3. The type contains tasks
3115 -- 4. One or more components has an initial value
3117 -- 5. One or more components is for a type which itself requires
3118 -- an initialization procedure.
3120 -- 6. One or more components is a type that requires simple
3121 -- initialization (see Needs_Simple_Initialization), except
3122 -- that types Tag and Interface_Tag are excluded, since fields
3123 -- of these types are initialized by other means.
3125 -- 7. The type is the record type built for a task type (since at
3126 -- the very least, Create_Task must be called)
3128 -- 8. The type is the record type built for a protected type (since
3129 -- at least Initialize_Protection must be called)
3131 -- 9. The type is marked as a public entity. The reason we add this
3132 -- case (even if none of the above apply) is to properly handle
3133 -- Initialize_Scalars. If a package is compiled without an IS
3134 -- pragma, and the client is compiled with an IS pragma, then
3135 -- the client will think an initialization procedure is present
3136 -- and call it, when in fact no such procedure is required, but
3137 -- since the call is generated, there had better be a routine
3138 -- at the other end of the call, even if it does nothing!)
3140 -- Note: the reason we exclude the CPP_Class case is because in this
3141 -- case the initialization is performed in the C++ side.
3143 if Is_CPP_Class
(Rec_Id
) then
3146 elsif Is_Interface
(Rec_Id
) then
3149 elsif (Has_Discriminants
(Rec_Id
)
3150 and then not Is_Unchecked_Union
(Rec_Id
))
3151 or else Is_Tagged_Type
(Rec_Id
)
3152 or else Is_Concurrent_Record_Type
(Rec_Id
)
3153 or else Has_Task
(Rec_Id
)
3158 Id
:= First_Component
(Rec_Id
);
3159 while Present
(Id
) loop
3160 Comp_Decl
:= Parent
(Id
);
3163 if Present
(Expression
(Comp_Decl
))
3164 or else Has_Non_Null_Base_Init_Proc
(Typ
)
3165 or else Component_Needs_Simple_Initialization
(Typ
)
3170 Next_Component
(Id
);
3173 -- As explained above, a record initialization procedure is needed
3174 -- for public types in case Initialize_Scalars applies to a client.
3175 -- However, such a procedure is not needed in the case where either
3176 -- of restrictions No_Initialize_Scalars or No_Default_Initialization
3177 -- applies. No_Initialize_Scalars excludes the possibility of using
3178 -- Initialize_Scalars in any partition, and No_Default_Initialization
3179 -- implies that no initialization should ever be done for objects of
3180 -- the type, so is incompatible with Initialize_Scalars.
3182 if not Restriction_Active
(No_Initialize_Scalars
)
3183 and then not Restriction_Active
(No_Default_Initialization
)
3184 and then Is_Public
(Rec_Id
)
3190 end Requires_Init_Proc
;
3192 -- Start of processing for Build_Record_Init_Proc
3195 -- Check for value type, which means no initialization required
3197 Rec_Type
:= Defining_Identifier
(N
);
3199 if Is_Value_Type
(Rec_Type
) then
3203 -- This may be full declaration of a private type, in which case
3204 -- the visible entity is a record, and the private entity has been
3205 -- exchanged with it in the private part of the current package.
3206 -- The initialization procedure is built for the record type, which
3207 -- is retrievable from the private entity.
3209 if Is_Incomplete_Or_Private_Type
(Rec_Type
) then
3210 Rec_Type
:= Underlying_Type
(Rec_Type
);
3213 -- If there are discriminants, build the discriminant map to replace
3214 -- discriminants by their discriminals in complex bound expressions.
3215 -- These only arise for the corresponding records of synchronized types.
3217 if Is_Concurrent_Record_Type
(Rec_Type
)
3218 and then Has_Discriminants
(Rec_Type
)
3223 Disc
:= First_Discriminant
(Rec_Type
);
3224 while Present
(Disc
) loop
3225 Append_Elmt
(Disc
, Discr_Map
);
3226 Append_Elmt
(Discriminal
(Disc
), Discr_Map
);
3227 Next_Discriminant
(Disc
);
3232 -- Derived types that have no type extension can use the initialization
3233 -- procedure of their parent and do not need a procedure of their own.
3234 -- This is only correct if there are no representation clauses for the
3235 -- type or its parent, and if the parent has in fact been frozen so
3236 -- that its initialization procedure exists.
3238 if Is_Derived_Type
(Rec_Type
)
3239 and then not Is_Tagged_Type
(Rec_Type
)
3240 and then not Is_Unchecked_Union
(Rec_Type
)
3241 and then not Has_New_Non_Standard_Rep
(Rec_Type
)
3242 and then not Parent_Subtype_Renaming_Discrims
3243 and then Has_Non_Null_Base_Init_Proc
(Etype
(Rec_Type
))
3245 Copy_TSS
(Base_Init_Proc
(Etype
(Rec_Type
)), Rec_Type
);
3247 -- Otherwise if we need an initialization procedure, then build one,
3248 -- mark it as public and inlinable and as having a completion.
3250 elsif Requires_Init_Proc
(Rec_Type
)
3251 or else Is_Unchecked_Union
(Rec_Type
)
3254 Make_Defining_Identifier
(Loc
,
3255 Chars
=> Make_Init_Proc_Name
(Rec_Type
));
3257 -- If No_Default_Initialization restriction is active, then we don't
3258 -- want to build an init_proc, but we need to mark that an init_proc
3259 -- would be needed if this restriction was not active (so that we can
3260 -- detect attempts to call it), so set a dummy init_proc in place.
3262 if Restriction_Active
(No_Default_Initialization
) then
3263 Set_Init_Proc
(Rec_Type
, Proc_Id
);
3267 Build_Offset_To_Top_Functions
;
3268 Build_Init_Procedure
;
3269 Set_Is_Public
(Proc_Id
, Is_Public
(Pe
));
3271 -- The initialization of protected records is not worth inlining.
3272 -- In addition, when compiled for another unit for inlining purposes,
3273 -- it may make reference to entities that have not been elaborated
3274 -- yet. The initialization of controlled records contains a nested
3275 -- clean-up procedure that makes it impractical to inline as well,
3276 -- and leads to undefined symbols if inlined in a different unit.
3277 -- Similar considerations apply to task types.
3279 if not Is_Concurrent_Type
(Rec_Type
)
3280 and then not Has_Task
(Rec_Type
)
3281 and then not Needs_Finalization
(Rec_Type
)
3283 Set_Is_Inlined
(Proc_Id
);
3286 Set_Is_Internal
(Proc_Id
);
3287 Set_Has_Completion
(Proc_Id
);
3289 if not Debug_Generated_Code
then
3290 Set_Debug_Info_Off
(Proc_Id
);
3294 Agg
: constant Node_Id
:=
3295 Build_Equivalent_Record_Aggregate
(Rec_Type
);
3297 procedure Collect_Itypes
(Comp
: Node_Id
);
3298 -- Generate references to itypes in the aggregate, because
3299 -- the first use of the aggregate may be in a nested scope.
3301 --------------------
3302 -- Collect_Itypes --
3303 --------------------
3305 procedure Collect_Itypes
(Comp
: Node_Id
) is
3308 Typ
: constant Entity_Id
:= Etype
(Comp
);
3311 if Is_Array_Type
(Typ
)
3312 and then Is_Itype
(Typ
)
3314 Ref
:= Make_Itype_Reference
(Loc
);
3315 Set_Itype
(Ref
, Typ
);
3316 Append_Freeze_Action
(Rec_Type
, Ref
);
3318 Ref
:= Make_Itype_Reference
(Loc
);
3319 Set_Itype
(Ref
, Etype
(First_Index
(Typ
)));
3320 Append_Freeze_Action
(Rec_Type
, Ref
);
3322 Sub_Aggr
:= First
(Expressions
(Comp
));
3324 -- Recurse on nested arrays
3326 while Present
(Sub_Aggr
) loop
3327 Collect_Itypes
(Sub_Aggr
);
3334 -- If there is a static initialization aggregate for the type,
3335 -- generate itype references for the types of its (sub)components,
3336 -- to prevent out-of-scope errors in the resulting tree.
3337 -- The aggregate may have been rewritten as a Raise node, in which
3338 -- case there are no relevant itypes.
3341 and then Nkind
(Agg
) = N_Aggregate
3343 Set_Static_Initialization
(Proc_Id
, Agg
);
3348 Comp
:= First
(Component_Associations
(Agg
));
3349 while Present
(Comp
) loop
3350 Collect_Itypes
(Expression
(Comp
));
3357 end Build_Record_Init_Proc
;
3359 ----------------------------
3360 -- Build_Slice_Assignment --
3361 ----------------------------
3363 -- Generates the following subprogram:
3366 -- (Source, Target : Array_Type,
3367 -- Left_Lo, Left_Hi : Index;
3368 -- Right_Lo, Right_Hi : Index;
3376 -- if Left_Hi < Left_Lo then
3389 -- Target (Li1) := Source (Ri1);
3392 -- exit when Li1 = Left_Lo;
3393 -- Li1 := Index'pred (Li1);
3394 -- Ri1 := Index'pred (Ri1);
3396 -- exit when Li1 = Left_Hi;
3397 -- Li1 := Index'succ (Li1);
3398 -- Ri1 := Index'succ (Ri1);
3403 procedure Build_Slice_Assignment
(Typ
: Entity_Id
) is
3404 Loc
: constant Source_Ptr
:= Sloc
(Typ
);
3405 Index
: constant Entity_Id
:= Base_Type
(Etype
(First_Index
(Typ
)));
3407 -- Build formal parameters of procedure
3409 Larray
: constant Entity_Id
:=
3410 Make_Defining_Identifier
3411 (Loc
, Chars
=> New_Internal_Name
('A'));
3412 Rarray
: constant Entity_Id
:=
3413 Make_Defining_Identifier
3414 (Loc
, Chars
=> New_Internal_Name
('R'));
3415 Left_Lo
: constant Entity_Id
:=
3416 Make_Defining_Identifier
3417 (Loc
, Chars
=> New_Internal_Name
('L'));
3418 Left_Hi
: constant Entity_Id
:=
3419 Make_Defining_Identifier
3420 (Loc
, Chars
=> New_Internal_Name
('L'));
3421 Right_Lo
: constant Entity_Id
:=
3422 Make_Defining_Identifier
3423 (Loc
, Chars
=> New_Internal_Name
('R'));
3424 Right_Hi
: constant Entity_Id
:=
3425 Make_Defining_Identifier
3426 (Loc
, Chars
=> New_Internal_Name
('R'));
3427 Rev
: constant Entity_Id
:=
3428 Make_Defining_Identifier
3429 (Loc
, Chars
=> New_Internal_Name
('D'));
3430 Proc_Name
: constant Entity_Id
:=
3431 Make_Defining_Identifier
(Loc
,
3432 Chars
=> Make_TSS_Name
(Typ
, TSS_Slice_Assign
));
3434 Lnn
: constant Entity_Id
:=
3435 Make_Defining_Identifier
(Loc
, New_Internal_Name
('L'));
3436 Rnn
: constant Entity_Id
:=
3437 Make_Defining_Identifier
(Loc
, New_Internal_Name
('R'));
3438 -- Subscripts for left and right sides
3445 -- Build declarations for indices
3450 Make_Object_Declaration
(Loc
,
3451 Defining_Identifier
=> Lnn
,
3452 Object_Definition
=>
3453 New_Occurrence_Of
(Index
, Loc
)));
3456 Make_Object_Declaration
(Loc
,
3457 Defining_Identifier
=> Rnn
,
3458 Object_Definition
=>
3459 New_Occurrence_Of
(Index
, Loc
)));
3463 -- Build test for empty slice case
3466 Make_If_Statement
(Loc
,
3469 Left_Opnd
=> New_Occurrence_Of
(Left_Hi
, Loc
),
3470 Right_Opnd
=> New_Occurrence_Of
(Left_Lo
, Loc
)),
3471 Then_Statements
=> New_List
(Make_Simple_Return_Statement
(Loc
))));
3473 -- Build initializations for indices
3476 F_Init
: constant List_Id
:= New_List
;
3477 B_Init
: constant List_Id
:= New_List
;
3481 Make_Assignment_Statement
(Loc
,
3482 Name
=> New_Occurrence_Of
(Lnn
, Loc
),
3483 Expression
=> New_Occurrence_Of
(Left_Lo
, Loc
)));
3486 Make_Assignment_Statement
(Loc
,
3487 Name
=> New_Occurrence_Of
(Rnn
, Loc
),
3488 Expression
=> New_Occurrence_Of
(Right_Lo
, Loc
)));
3491 Make_Assignment_Statement
(Loc
,
3492 Name
=> New_Occurrence_Of
(Lnn
, Loc
),
3493 Expression
=> New_Occurrence_Of
(Left_Hi
, Loc
)));
3496 Make_Assignment_Statement
(Loc
,
3497 Name
=> New_Occurrence_Of
(Rnn
, Loc
),
3498 Expression
=> New_Occurrence_Of
(Right_Hi
, Loc
)));
3501 Make_If_Statement
(Loc
,
3502 Condition
=> New_Occurrence_Of
(Rev
, Loc
),
3503 Then_Statements
=> B_Init
,
3504 Else_Statements
=> F_Init
));
3507 -- Now construct the assignment statement
3510 Make_Loop_Statement
(Loc
,
3511 Statements
=> New_List
(
3512 Make_Assignment_Statement
(Loc
,
3514 Make_Indexed_Component
(Loc
,
3515 Prefix
=> New_Occurrence_Of
(Larray
, Loc
),
3516 Expressions
=> New_List
(New_Occurrence_Of
(Lnn
, Loc
))),
3518 Make_Indexed_Component
(Loc
,
3519 Prefix
=> New_Occurrence_Of
(Rarray
, Loc
),
3520 Expressions
=> New_List
(New_Occurrence_Of
(Rnn
, Loc
))))),
3521 End_Label
=> Empty
);
3523 -- Build the exit condition and increment/decrement statements
3526 F_Ass
: constant List_Id
:= New_List
;
3527 B_Ass
: constant List_Id
:= New_List
;
3531 Make_Exit_Statement
(Loc
,
3534 Left_Opnd
=> New_Occurrence_Of
(Lnn
, Loc
),
3535 Right_Opnd
=> New_Occurrence_Of
(Left_Hi
, Loc
))));
3538 Make_Assignment_Statement
(Loc
,
3539 Name
=> New_Occurrence_Of
(Lnn
, Loc
),
3541 Make_Attribute_Reference
(Loc
,
3543 New_Occurrence_Of
(Index
, Loc
),
3544 Attribute_Name
=> Name_Succ
,
3545 Expressions
=> New_List
(
3546 New_Occurrence_Of
(Lnn
, Loc
)))));
3549 Make_Assignment_Statement
(Loc
,
3550 Name
=> New_Occurrence_Of
(Rnn
, Loc
),
3552 Make_Attribute_Reference
(Loc
,
3554 New_Occurrence_Of
(Index
, Loc
),
3555 Attribute_Name
=> Name_Succ
,
3556 Expressions
=> New_List
(
3557 New_Occurrence_Of
(Rnn
, Loc
)))));
3560 Make_Exit_Statement
(Loc
,
3563 Left_Opnd
=> New_Occurrence_Of
(Lnn
, Loc
),
3564 Right_Opnd
=> New_Occurrence_Of
(Left_Lo
, Loc
))));
3567 Make_Assignment_Statement
(Loc
,
3568 Name
=> New_Occurrence_Of
(Lnn
, Loc
),
3570 Make_Attribute_Reference
(Loc
,
3572 New_Occurrence_Of
(Index
, Loc
),
3573 Attribute_Name
=> Name_Pred
,
3574 Expressions
=> New_List
(
3575 New_Occurrence_Of
(Lnn
, Loc
)))));
3578 Make_Assignment_Statement
(Loc
,
3579 Name
=> New_Occurrence_Of
(Rnn
, Loc
),
3581 Make_Attribute_Reference
(Loc
,
3583 New_Occurrence_Of
(Index
, Loc
),
3584 Attribute_Name
=> Name_Pred
,
3585 Expressions
=> New_List
(
3586 New_Occurrence_Of
(Rnn
, Loc
)))));
3588 Append_To
(Statements
(Loops
),
3589 Make_If_Statement
(Loc
,
3590 Condition
=> New_Occurrence_Of
(Rev
, Loc
),
3591 Then_Statements
=> B_Ass
,
3592 Else_Statements
=> F_Ass
));
3595 Append_To
(Stats
, Loops
);
3599 Formals
: List_Id
:= New_List
;
3602 Formals
:= New_List
(
3603 Make_Parameter_Specification
(Loc
,
3604 Defining_Identifier
=> Larray
,
3605 Out_Present
=> True,
3607 New_Reference_To
(Base_Type
(Typ
), Loc
)),
3609 Make_Parameter_Specification
(Loc
,
3610 Defining_Identifier
=> Rarray
,
3612 New_Reference_To
(Base_Type
(Typ
), Loc
)),
3614 Make_Parameter_Specification
(Loc
,
3615 Defining_Identifier
=> Left_Lo
,
3617 New_Reference_To
(Index
, Loc
)),
3619 Make_Parameter_Specification
(Loc
,
3620 Defining_Identifier
=> Left_Hi
,
3622 New_Reference_To
(Index
, Loc
)),
3624 Make_Parameter_Specification
(Loc
,
3625 Defining_Identifier
=> Right_Lo
,
3627 New_Reference_To
(Index
, Loc
)),
3629 Make_Parameter_Specification
(Loc
,
3630 Defining_Identifier
=> Right_Hi
,
3632 New_Reference_To
(Index
, Loc
)));
3635 Make_Parameter_Specification
(Loc
,
3636 Defining_Identifier
=> Rev
,
3638 New_Reference_To
(Standard_Boolean
, Loc
)));
3641 Make_Procedure_Specification
(Loc
,
3642 Defining_Unit_Name
=> Proc_Name
,
3643 Parameter_Specifications
=> Formals
);
3646 Make_Subprogram_Body
(Loc
,
3647 Specification
=> Spec
,
3648 Declarations
=> Decls
,
3649 Handled_Statement_Sequence
=>
3650 Make_Handled_Sequence_Of_Statements
(Loc
,
3651 Statements
=> Stats
)));
3654 Set_TSS
(Typ
, Proc_Name
);
3655 Set_Is_Pure
(Proc_Name
);
3656 end Build_Slice_Assignment
;
3658 ------------------------------------
3659 -- Build_Variant_Record_Equality --
3660 ------------------------------------
3664 -- function _Equality (X, Y : T) return Boolean is
3666 -- -- Compare discriminants
3668 -- if False or else X.D1 /= Y.D1 or else X.D2 /= Y.D2 then
3672 -- -- Compare components
3674 -- if False or else X.C1 /= Y.C1 or else X.C2 /= Y.C2 then
3678 -- -- Compare variant part
3682 -- if False or else X.C2 /= Y.C2 or else X.C3 /= Y.C3 then
3687 -- if False or else X.Cn /= Y.Cn then
3695 procedure Build_Variant_Record_Equality
(Typ
: Entity_Id
) is
3696 Loc
: constant Source_Ptr
:= Sloc
(Typ
);
3698 F
: constant Entity_Id
:=
3699 Make_Defining_Identifier
(Loc
,
3700 Chars
=> Make_TSS_Name
(Typ
, TSS_Composite_Equality
));
3702 X
: constant Entity_Id
:=
3703 Make_Defining_Identifier
(Loc
,
3706 Y
: constant Entity_Id
:=
3707 Make_Defining_Identifier
(Loc
,
3710 Def
: constant Node_Id
:= Parent
(Typ
);
3711 Comps
: constant Node_Id
:= Component_List
(Type_Definition
(Def
));
3712 Stmts
: constant List_Id
:= New_List
;
3713 Pspecs
: constant List_Id
:= New_List
;
3716 -- Derived Unchecked_Union types no longer inherit the equality function
3719 if Is_Derived_Type
(Typ
)
3720 and then not Is_Unchecked_Union
(Typ
)
3721 and then not Has_New_Non_Standard_Rep
(Typ
)
3724 Parent_Eq
: constant Entity_Id
:=
3725 TSS
(Root_Type
(Typ
), TSS_Composite_Equality
);
3728 if Present
(Parent_Eq
) then
3729 Copy_TSS
(Parent_Eq
, Typ
);
3736 Make_Subprogram_Body
(Loc
,
3738 Make_Function_Specification
(Loc
,
3739 Defining_Unit_Name
=> F
,
3740 Parameter_Specifications
=> Pspecs
,
3741 Result_Definition
=> New_Reference_To
(Standard_Boolean
, Loc
)),
3742 Declarations
=> New_List
,
3743 Handled_Statement_Sequence
=>
3744 Make_Handled_Sequence_Of_Statements
(Loc
,
3745 Statements
=> Stmts
)));
3748 Make_Parameter_Specification
(Loc
,
3749 Defining_Identifier
=> X
,
3750 Parameter_Type
=> New_Reference_To
(Typ
, Loc
)));
3753 Make_Parameter_Specification
(Loc
,
3754 Defining_Identifier
=> Y
,
3755 Parameter_Type
=> New_Reference_To
(Typ
, Loc
)));
3757 -- Unchecked_Unions require additional machinery to support equality.
3758 -- Two extra parameters (A and B) are added to the equality function
3759 -- parameter list in order to capture the inferred values of the
3760 -- discriminants in later calls.
3762 if Is_Unchecked_Union
(Typ
) then
3764 Discr_Type
: constant Node_Id
:= Etype
(First_Discriminant
(Typ
));
3766 A
: constant Node_Id
:=
3767 Make_Defining_Identifier
(Loc
,
3770 B
: constant Node_Id
:=
3771 Make_Defining_Identifier
(Loc
,
3775 -- Add A and B to the parameter list
3778 Make_Parameter_Specification
(Loc
,
3779 Defining_Identifier
=> A
,
3780 Parameter_Type
=> New_Reference_To
(Discr_Type
, Loc
)));
3783 Make_Parameter_Specification
(Loc
,
3784 Defining_Identifier
=> B
,
3785 Parameter_Type
=> New_Reference_To
(Discr_Type
, Loc
)));
3787 -- Generate the following header code to compare the inferred
3795 Make_If_Statement
(Loc
,
3798 Left_Opnd
=> New_Reference_To
(A
, Loc
),
3799 Right_Opnd
=> New_Reference_To
(B
, Loc
)),
3800 Then_Statements
=> New_List
(
3801 Make_Simple_Return_Statement
(Loc
,
3802 Expression
=> New_Occurrence_Of
(Standard_False
, Loc
)))));
3804 -- Generate component-by-component comparison. Note that we must
3805 -- propagate one of the inferred discriminant formals to act as
3806 -- the case statement switch.
3808 Append_List_To
(Stmts
,
3809 Make_Eq_Case
(Typ
, Comps
, A
));
3813 -- Normal case (not unchecked union)
3818 Discriminant_Specifications
(Def
)));
3820 Append_List_To
(Stmts
,
3821 Make_Eq_Case
(Typ
, Comps
));
3825 Make_Simple_Return_Statement
(Loc
,
3826 Expression
=> New_Reference_To
(Standard_True
, Loc
)));
3831 if not Debug_Generated_Code
then
3832 Set_Debug_Info_Off
(F
);
3834 end Build_Variant_Record_Equality
;
3836 -----------------------------
3837 -- Check_Stream_Attributes --
3838 -----------------------------
3840 procedure Check_Stream_Attributes
(Typ
: Entity_Id
) is
3842 Par_Read
: constant Boolean :=
3843 Stream_Attribute_Available
(Typ
, TSS_Stream_Read
)
3844 and then not Has_Specified_Stream_Read
(Typ
);
3845 Par_Write
: constant Boolean :=
3846 Stream_Attribute_Available
(Typ
, TSS_Stream_Write
)
3847 and then not Has_Specified_Stream_Write
(Typ
);
3849 procedure Check_Attr
(Nam
: Name_Id
; TSS_Nam
: TSS_Name_Type
);
3850 -- Check that Comp has a user-specified Nam stream attribute
3856 procedure Check_Attr
(Nam
: Name_Id
; TSS_Nam
: TSS_Name_Type
) is
3858 if not Stream_Attribute_Available
(Etype
(Comp
), TSS_Nam
) then
3859 Error_Msg_Name_1
:= Nam
;
3861 ("|component& in limited extension must have% attribute", Comp
);
3865 -- Start of processing for Check_Stream_Attributes
3868 if Par_Read
or else Par_Write
then
3869 Comp
:= First_Component
(Typ
);
3870 while Present
(Comp
) loop
3871 if Comes_From_Source
(Comp
)
3872 and then Original_Record_Component
(Comp
) = Comp
3873 and then Is_Limited_Type
(Etype
(Comp
))
3876 Check_Attr
(Name_Read
, TSS_Stream_Read
);
3880 Check_Attr
(Name_Write
, TSS_Stream_Write
);
3884 Next_Component
(Comp
);
3887 end Check_Stream_Attributes
;
3889 -----------------------------
3890 -- Expand_Record_Extension --
3891 -----------------------------
3893 -- Add a field _parent at the beginning of the record extension. This is
3894 -- used to implement inheritance. Here are some examples of expansion:
3896 -- 1. no discriminants
3897 -- type T2 is new T1 with null record;
3899 -- type T2 is new T1 with record
3903 -- 2. renamed discriminants
3904 -- type T2 (B, C : Int) is new T1 (A => B) with record
3905 -- _Parent : T1 (A => B);
3909 -- 3. inherited discriminants
3910 -- type T2 is new T1 with record -- discriminant A inherited
3911 -- _Parent : T1 (A);
3915 procedure Expand_Record_Extension
(T
: Entity_Id
; Def
: Node_Id
) is
3916 Indic
: constant Node_Id
:= Subtype_Indication
(Def
);
3917 Loc
: constant Source_Ptr
:= Sloc
(Def
);
3918 Rec_Ext_Part
: Node_Id
:= Record_Extension_Part
(Def
);
3919 Par_Subtype
: Entity_Id
;
3920 Comp_List
: Node_Id
;
3921 Comp_Decl
: Node_Id
;
3924 List_Constr
: constant List_Id
:= New_List
;
3927 -- Expand_Record_Extension is called directly from the semantics, so
3928 -- we must check to see whether expansion is active before proceeding
3930 if not Expander_Active
then
3934 -- This may be a derivation of an untagged private type whose full
3935 -- view is tagged, in which case the Derived_Type_Definition has no
3936 -- extension part. Build an empty one now.
3938 if No
(Rec_Ext_Part
) then
3940 Make_Record_Definition
(Loc
,
3942 Component_List
=> Empty
,
3943 Null_Present
=> True);
3945 Set_Record_Extension_Part
(Def
, Rec_Ext_Part
);
3946 Mark_Rewrite_Insertion
(Rec_Ext_Part
);
3949 Comp_List
:= Component_List
(Rec_Ext_Part
);
3951 Parent_N
:= Make_Defining_Identifier
(Loc
, Name_uParent
);
3953 -- If the derived type inherits its discriminants the type of the
3954 -- _parent field must be constrained by the inherited discriminants
3956 if Has_Discriminants
(T
)
3957 and then Nkind
(Indic
) /= N_Subtype_Indication
3958 and then not Is_Constrained
(Entity
(Indic
))
3960 D
:= First_Discriminant
(T
);
3961 while Present
(D
) loop
3962 Append_To
(List_Constr
, New_Occurrence_Of
(D
, Loc
));
3963 Next_Discriminant
(D
);
3968 Make_Subtype_Indication
(Loc
,
3969 Subtype_Mark
=> New_Reference_To
(Entity
(Indic
), Loc
),
3971 Make_Index_Or_Discriminant_Constraint
(Loc
,
3972 Constraints
=> List_Constr
)),
3975 -- Otherwise the original subtype_indication is just what is needed
3978 Par_Subtype
:= Process_Subtype
(New_Copy_Tree
(Indic
), Def
);
3981 Set_Parent_Subtype
(T
, Par_Subtype
);
3984 Make_Component_Declaration
(Loc
,
3985 Defining_Identifier
=> Parent_N
,
3986 Component_Definition
=>
3987 Make_Component_Definition
(Loc
,
3988 Aliased_Present
=> False,
3989 Subtype_Indication
=> New_Reference_To
(Par_Subtype
, Loc
)));
3991 if Null_Present
(Rec_Ext_Part
) then
3992 Set_Component_List
(Rec_Ext_Part
,
3993 Make_Component_List
(Loc
,
3994 Component_Items
=> New_List
(Comp_Decl
),
3995 Variant_Part
=> Empty
,
3996 Null_Present
=> False));
3997 Set_Null_Present
(Rec_Ext_Part
, False);
3999 elsif Null_Present
(Comp_List
)
4000 or else Is_Empty_List
(Component_Items
(Comp_List
))
4002 Set_Component_Items
(Comp_List
, New_List
(Comp_Decl
));
4003 Set_Null_Present
(Comp_List
, False);
4006 Insert_Before
(First
(Component_Items
(Comp_List
)), Comp_Decl
);
4009 Analyze
(Comp_Decl
);
4010 end Expand_Record_Extension
;
4012 ------------------------------------
4013 -- Expand_N_Full_Type_Declaration --
4014 ------------------------------------
4016 procedure Expand_N_Full_Type_Declaration
(N
: Node_Id
) is
4017 Def_Id
: constant Entity_Id
:= Defining_Identifier
(N
);
4018 B_Id
: constant Entity_Id
:= Base_Type
(Def_Id
);
4022 procedure Build_Master
(Def_Id
: Entity_Id
);
4023 -- Create the master associated with Def_Id
4029 procedure Build_Master
(Def_Id
: Entity_Id
) is
4031 -- Anonymous access types are created for the components of the
4032 -- record parameter for an entry declaration. No master is created
4035 if Has_Task
(Designated_Type
(Def_Id
))
4036 and then Comes_From_Source
(N
)
4038 Build_Master_Entity
(Def_Id
);
4039 Build_Master_Renaming
(Parent
(Def_Id
), Def_Id
);
4041 -- Create a class-wide master because a Master_Id must be generated
4042 -- for access-to-limited-class-wide types whose root may be extended
4043 -- with task components.
4045 -- Note: This code covers access-to-limited-interfaces because they
4046 -- can be used to reference tasks implementing them.
4048 elsif Is_Class_Wide_Type
(Designated_Type
(Def_Id
))
4049 and then Is_Limited_Type
(Designated_Type
(Def_Id
))
4050 and then Tasking_Allowed
4052 -- Do not create a class-wide master for types whose convention is
4053 -- Java since these types cannot embed Ada tasks anyway. Note that
4054 -- the following test cannot catch the following case:
4056 -- package java.lang.Object is
4057 -- type Typ is tagged limited private;
4058 -- type Ref is access all Typ'Class;
4060 -- type Typ is tagged limited ...;
4061 -- pragma Convention (Typ, Java)
4064 -- Because the convention appears after we have done the
4065 -- processing for type Ref.
4067 and then Convention
(Designated_Type
(Def_Id
)) /= Convention_Java
4068 and then Convention
(Designated_Type
(Def_Id
)) /= Convention_CIL
4070 Build_Class_Wide_Master
(Def_Id
);
4074 -- Start of processing for Expand_N_Full_Type_Declaration
4077 if Is_Access_Type
(Def_Id
) then
4078 Build_Master
(Def_Id
);
4080 if Ekind
(Def_Id
) = E_Access_Protected_Subprogram_Type
then
4081 Expand_Access_Protected_Subprogram_Type
(N
);
4084 elsif Ada_Version
>= Ada_05
4085 and then Is_Array_Type
(Def_Id
)
4086 and then Is_Access_Type
(Component_Type
(Def_Id
))
4087 and then Ekind
(Component_Type
(Def_Id
)) = E_Anonymous_Access_Type
4089 Build_Master
(Component_Type
(Def_Id
));
4091 elsif Has_Task
(Def_Id
) then
4092 Expand_Previous_Access_Type
(Def_Id
);
4094 elsif Ada_Version
>= Ada_05
4096 (Is_Record_Type
(Def_Id
)
4097 or else (Is_Array_Type
(Def_Id
)
4098 and then Is_Record_Type
(Component_Type
(Def_Id
))))
4106 -- Look for the first anonymous access type component
4108 if Is_Array_Type
(Def_Id
) then
4109 Comp
:= First_Entity
(Component_Type
(Def_Id
));
4111 Comp
:= First_Entity
(Def_Id
);
4114 while Present
(Comp
) loop
4115 Typ
:= Etype
(Comp
);
4117 exit when Is_Access_Type
(Typ
)
4118 and then Ekind
(Typ
) = E_Anonymous_Access_Type
;
4123 -- If found we add a renaming declaration of master_id and we
4124 -- associate it to each anonymous access type component. Do
4125 -- nothing if the access type already has a master. This will be
4126 -- the case if the array type is the packed array created for a
4127 -- user-defined array type T, where the master_id is created when
4128 -- expanding the declaration for T.
4131 and then Ekind
(Typ
) = E_Anonymous_Access_Type
4132 and then not Restriction_Active
(No_Task_Hierarchy
)
4133 and then No
(Master_Id
(Typ
))
4135 -- Do not consider run-times with no tasking support
4137 and then RTE_Available
(RE_Current_Master
)
4138 and then Has_Task
(Non_Limited_Designated_Type
(Typ
))
4140 Build_Master_Entity
(Def_Id
);
4141 M_Id
:= Build_Master_Renaming
(N
, Def_Id
);
4143 if Is_Array_Type
(Def_Id
) then
4144 Comp
:= First_Entity
(Component_Type
(Def_Id
));
4146 Comp
:= First_Entity
(Def_Id
);
4149 while Present
(Comp
) loop
4150 Typ
:= Etype
(Comp
);
4152 if Is_Access_Type
(Typ
)
4153 and then Ekind
(Typ
) = E_Anonymous_Access_Type
4155 Set_Master_Id
(Typ
, M_Id
);
4164 Par_Id
:= Etype
(B_Id
);
4166 -- The parent type is private then we need to inherit any TSS operations
4167 -- from the full view.
4169 if Ekind
(Par_Id
) in Private_Kind
4170 and then Present
(Full_View
(Par_Id
))
4172 Par_Id
:= Base_Type
(Full_View
(Par_Id
));
4175 if Nkind
(Type_Definition
(Original_Node
(N
))) =
4176 N_Derived_Type_Definition
4177 and then not Is_Tagged_Type
(Def_Id
)
4178 and then Present
(Freeze_Node
(Par_Id
))
4179 and then Present
(TSS_Elist
(Freeze_Node
(Par_Id
)))
4181 Ensure_Freeze_Node
(B_Id
);
4182 FN
:= Freeze_Node
(B_Id
);
4184 if No
(TSS_Elist
(FN
)) then
4185 Set_TSS_Elist
(FN
, New_Elmt_List
);
4189 T_E
: constant Elist_Id
:= TSS_Elist
(FN
);
4193 Elmt
:= First_Elmt
(TSS_Elist
(Freeze_Node
(Par_Id
)));
4194 while Present
(Elmt
) loop
4195 if Chars
(Node
(Elmt
)) /= Name_uInit
then
4196 Append_Elmt
(Node
(Elmt
), T_E
);
4202 -- If the derived type itself is private with a full view, then
4203 -- associate the full view with the inherited TSS_Elist as well.
4205 if Ekind
(B_Id
) in Private_Kind
4206 and then Present
(Full_View
(B_Id
))
4208 Ensure_Freeze_Node
(Base_Type
(Full_View
(B_Id
)));
4210 (Freeze_Node
(Base_Type
(Full_View
(B_Id
))), TSS_Elist
(FN
));
4214 end Expand_N_Full_Type_Declaration
;
4216 ---------------------------------
4217 -- Expand_N_Object_Declaration --
4218 ---------------------------------
4220 -- First we do special processing for objects of a tagged type where this
4221 -- is the point at which the type is frozen. The creation of the dispatch
4222 -- table and the initialization procedure have to be deferred to this
4223 -- point, since we reference previously declared primitive subprograms.
4225 -- For all types, we call an initialization procedure if there is one
4227 procedure Expand_N_Object_Declaration
(N
: Node_Id
) is
4228 Def_Id
: constant Entity_Id
:= Defining_Identifier
(N
);
4229 Expr
: constant Node_Id
:= Expression
(N
);
4230 Loc
: constant Source_Ptr
:= Sloc
(N
);
4231 Typ
: constant Entity_Id
:= Etype
(Def_Id
);
4232 Base_Typ
: constant Entity_Id
:= Base_Type
(Typ
);
4237 Init_After
: Node_Id
:= N
;
4238 -- Node after which the init proc call is to be inserted. This is
4239 -- normally N, except for the case of a shared passive variable, in
4240 -- which case the init proc call must be inserted only after the bodies
4241 -- of the shared variable procedures have been seen.
4243 function Rewrite_As_Renaming
return Boolean;
4244 -- Indicate whether to rewrite a declaration with initialization into an
4245 -- object renaming declaration (see below).
4247 -------------------------
4248 -- Rewrite_As_Renaming --
4249 -------------------------
4251 function Rewrite_As_Renaming
return Boolean is
4253 return not Aliased_Present
(N
)
4254 and then Is_Entity_Name
(Expr_Q
)
4255 and then Ekind
(Entity
(Expr_Q
)) = E_Variable
4256 and then OK_To_Rename
(Entity
(Expr_Q
))
4257 and then Is_Entity_Name
(Object_Definition
(N
));
4258 end Rewrite_As_Renaming
;
4260 -- Start of processing for Expand_N_Object_Declaration
4263 -- Don't do anything for deferred constants. All proper actions will be
4264 -- expanded during the full declaration.
4266 if No
(Expr
) and Constant_Present
(N
) then
4270 -- Force construction of dispatch tables of library level tagged types
4272 if Tagged_Type_Expansion
4273 and then Static_Dispatch_Tables
4274 and then Is_Library_Level_Entity
(Def_Id
)
4275 and then Is_Library_Level_Tagged_Type
(Base_Typ
)
4276 and then (Ekind
(Base_Typ
) = E_Record_Type
4277 or else Ekind
(Base_Typ
) = E_Protected_Type
4278 or else Ekind
(Base_Typ
) = E_Task_Type
)
4279 and then not Has_Dispatch_Table
(Base_Typ
)
4282 New_Nodes
: List_Id
:= No_List
;
4285 if Is_Concurrent_Type
(Base_Typ
) then
4286 New_Nodes
:= Make_DT
(Corresponding_Record_Type
(Base_Typ
), N
);
4288 New_Nodes
:= Make_DT
(Base_Typ
, N
);
4291 if not Is_Empty_List
(New_Nodes
) then
4292 Insert_List_Before
(N
, New_Nodes
);
4297 -- Make shared memory routines for shared passive variable
4299 if Is_Shared_Passive
(Def_Id
) then
4300 Init_After
:= Make_Shared_Var_Procs
(N
);
4303 -- If tasks being declared, make sure we have an activation chain
4304 -- defined for the tasks (has no effect if we already have one), and
4305 -- also that a Master variable is established and that the appropriate
4306 -- enclosing construct is established as a task master.
4308 if Has_Task
(Typ
) then
4309 Build_Activation_Chain_Entity
(N
);
4310 Build_Master_Entity
(Def_Id
);
4313 -- Build a list controller for declarations where the type is anonymous
4314 -- access and the designated type is controlled. Only declarations from
4315 -- source files receive such controllers in order to provide the same
4316 -- lifespan for any potential coextensions that may be associated with
4317 -- the object. Finalization lists of internal controlled anonymous
4318 -- access objects are already handled in Expand_N_Allocator.
4320 if Comes_From_Source
(N
)
4321 and then Ekind
(Typ
) = E_Anonymous_Access_Type
4322 and then Is_Controlled
(Directly_Designated_Type
(Typ
))
4323 and then No
(Associated_Final_Chain
(Typ
))
4325 Build_Final_List
(N
, Typ
);
4328 -- Default initialization required, and no expression present
4332 -- Expand Initialize call for controlled objects. One may wonder why
4333 -- the Initialize Call is not done in the regular Init procedure
4334 -- attached to the record type. That's because the init procedure is
4335 -- recursively called on each component, including _Parent, thus the
4336 -- Init call for a controlled object would generate not only one
4337 -- Initialize call as it is required but one for each ancestor of
4338 -- its type. This processing is suppressed if No_Initialization set.
4340 if not Needs_Finalization
(Typ
)
4341 or else No_Initialization
(N
)
4345 elsif not Abort_Allowed
4346 or else not Comes_From_Source
(N
)
4348 Insert_Actions_After
(Init_After
,
4350 Ref
=> New_Occurrence_Of
(Def_Id
, Loc
),
4351 Typ
=> Base_Type
(Typ
),
4352 Flist_Ref
=> Find_Final_List
(Def_Id
),
4353 With_Attach
=> Make_Integer_Literal
(Loc
, 1)));
4358 -- We need to protect the initialize call
4362 -- Initialize (...);
4364 -- Undefer_Abort.all;
4367 -- ??? this won't protect the initialize call for controlled
4368 -- components which are part of the init proc, so this block
4369 -- should probably also contain the call to _init_proc but this
4370 -- requires some code reorganization...
4373 L
: constant List_Id
:=
4375 (Ref
=> New_Occurrence_Of
(Def_Id
, Loc
),
4376 Typ
=> Base_Type
(Typ
),
4377 Flist_Ref
=> Find_Final_List
(Def_Id
),
4378 With_Attach
=> Make_Integer_Literal
(Loc
, 1));
4380 Blk
: constant Node_Id
:=
4381 Make_Block_Statement
(Loc
,
4382 Handled_Statement_Sequence
=>
4383 Make_Handled_Sequence_Of_Statements
(Loc
, L
));
4386 Prepend_To
(L
, Build_Runtime_Call
(Loc
, RE_Abort_Defer
));
4387 Set_At_End_Proc
(Handled_Statement_Sequence
(Blk
),
4388 New_Occurrence_Of
(RTE
(RE_Abort_Undefer_Direct
), Loc
));
4389 Insert_Actions_After
(Init_After
, New_List
(Blk
));
4390 Expand_At_End_Handler
4391 (Handled_Statement_Sequence
(Blk
), Entity
(Identifier
(Blk
)));
4395 -- Call type initialization procedure if there is one. We build the
4396 -- call and put it immediately after the object declaration, so that
4397 -- it will be expanded in the usual manner. Note that this will
4398 -- result in proper handling of defaulted discriminants.
4400 -- Need call if there is a base init proc
4402 if Has_Non_Null_Base_Init_Proc
(Typ
)
4404 -- Suppress call if No_Initialization set on declaration
4406 and then not No_Initialization
(N
)
4408 -- Suppress call for special case of value type for VM
4410 and then not Is_Value_Type
(Typ
)
4412 -- Suppress call if Suppress_Init_Proc set on the type. This is
4413 -- needed for the derived type case, where Suppress_Initialization
4414 -- may be set for the derived type, even if there is an init proc
4415 -- defined for the root type.
4417 and then not Suppress_Init_Proc
(Typ
)
4419 -- Return without initializing when No_Default_Initialization
4420 -- applies. Note that the actual restriction check occurs later,
4421 -- when the object is frozen, because we don't know yet whether
4422 -- the object is imported, which is a case where the check does
4425 if Restriction_Active
(No_Default_Initialization
) then
4429 -- The call to the initialization procedure does NOT freeze the
4430 -- object being initialized. This is because the call is not a
4431 -- source level call. This works fine, because the only possible
4432 -- statements depending on freeze status that can appear after the
4433 -- Init_Proc call are rep clauses which can safely appear after
4434 -- actual references to the object. Note that this call may
4435 -- subsequently be removed (if a pragma Import is encountered),
4436 -- or moved to the freeze actions for the object (e.g. if an
4437 -- address clause is applied to the object, causing it to get
4438 -- delayed freezing).
4440 Id_Ref
:= New_Reference_To
(Def_Id
, Loc
);
4441 Set_Must_Not_Freeze
(Id_Ref
);
4442 Set_Assignment_OK
(Id_Ref
);
4445 Init_Expr
: constant Node_Id
:=
4446 Static_Initialization
(Base_Init_Proc
(Typ
));
4448 if Present
(Init_Expr
) then
4450 (N
, New_Copy_Tree
(Init_Expr
, New_Scope
=> Current_Scope
));
4453 Initialization_Warning
(Id_Ref
);
4455 Insert_Actions_After
(Init_After
,
4456 Build_Initialization_Call
(Loc
, Id_Ref
, Typ
));
4460 -- If simple initialization is required, then set an appropriate
4461 -- simple initialization expression in place. This special
4462 -- initialization is required even though No_Init_Flag is present,
4463 -- but is not needed if there was an explicit initialization.
4465 -- An internally generated temporary needs no initialization because
4466 -- it will be assigned subsequently. In particular, there is no point
4467 -- in applying Initialize_Scalars to such a temporary.
4469 elsif Needs_Simple_Initialization
(Typ
)
4470 and then not Is_Internal
(Def_Id
)
4471 and then not Has_Init_Expression
(N
)
4473 Set_No_Initialization
(N
, False);
4474 Set_Expression
(N
, Get_Simple_Init_Val
(Typ
, N
, Esize
(Def_Id
)));
4475 Analyze_And_Resolve
(Expression
(N
), Typ
);
4478 -- Generate attribute for Persistent_BSS if needed
4480 if Persistent_BSS_Mode
4481 and then Comes_From_Source
(N
)
4482 and then Is_Potentially_Persistent_Type
(Typ
)
4483 and then not Has_Init_Expression
(N
)
4484 and then Is_Library_Level_Entity
(Def_Id
)
4490 Make_Linker_Section_Pragma
4491 (Def_Id
, Sloc
(N
), ".persistent.bss");
4492 Insert_After
(N
, Prag
);
4497 -- If access type, then we know it is null if not initialized
4499 if Is_Access_Type
(Typ
) then
4500 Set_Is_Known_Null
(Def_Id
);
4503 -- Explicit initialization present
4506 -- Obtain actual expression from qualified expression
4508 if Nkind
(Expr
) = N_Qualified_Expression
then
4509 Expr_Q
:= Expression
(Expr
);
4514 -- When we have the appropriate type of aggregate in the expression
4515 -- (it has been determined during analysis of the aggregate by
4516 -- setting the delay flag), let's perform in place assignment and
4517 -- thus avoid creating a temporary.
4519 if Is_Delayed_Aggregate
(Expr_Q
) then
4520 Convert_Aggr_In_Object_Decl
(N
);
4522 -- Ada 2005 (AI-318-02): If the initialization expression is a call
4523 -- to a build-in-place function, then access to the declared object
4524 -- must be passed to the function. Currently we limit such functions
4525 -- to those with constrained limited result subtypes, but eventually
4526 -- plan to expand the allowed forms of functions that are treated as
4529 elsif Ada_Version
>= Ada_05
4530 and then Is_Build_In_Place_Function_Call
(Expr_Q
)
4532 Make_Build_In_Place_Call_In_Object_Declaration
(N
, Expr_Q
);
4534 -- The previous call expands the expression initializing the
4535 -- built-in-place object into further code that will be analyzed
4536 -- later. No further expansion needed here.
4540 -- Ada 2005 (AI-251): Rewrite the expression that initializes a
4541 -- class-wide object to ensure that we copy the full object,
4542 -- unless we are targetting a VM where interfaces are handled by
4543 -- VM itself. Note that if the root type of Typ is an ancestor
4544 -- of Expr's type, both types share the same dispatch table and
4545 -- there is no need to displace the pointer.
4547 elsif Comes_From_Source
(N
)
4548 and then Is_Interface
(Typ
)
4550 pragma Assert
(Is_Class_Wide_Type
(Typ
));
4552 -- If the object is a return object of an inherently limited type,
4553 -- which implies build-in-place treatment, bypass the special
4554 -- treatment of class-wide interface initialization below. In this
4555 -- case, the expansion of the return statement will take care of
4556 -- creating the object (via allocator) and initializing it.
4558 if Is_Return_Object
(Def_Id
)
4559 and then Is_Inherently_Limited_Type
(Typ
)
4563 elsif Tagged_Type_Expansion
then
4565 Iface
: constant Entity_Id
:= Root_Type
(Typ
);
4566 Expr_N
: Node_Id
:= Expr
;
4567 Expr_Typ
: Entity_Id
;
4574 -- If the original node of the expression was a conversion
4575 -- to this specific class-wide interface type then we
4576 -- restore the original node to generate code that
4577 -- statically displaces the pointer to the interface
4580 if not Comes_From_Source
(Expr_N
)
4581 and then Nkind
(Expr_N
) = N_Unchecked_Type_Conversion
4582 and then Nkind
(Original_Node
(Expr_N
)) = N_Type_Conversion
4583 and then Etype
(Original_Node
(Expr_N
)) = Typ
4585 Rewrite
(Expr_N
, Original_Node
(Expression
(N
)));
4588 -- Avoid expansion of redundant interface conversion
4590 if Is_Interface
(Etype
(Expr_N
))
4591 and then Nkind
(Expr_N
) = N_Type_Conversion
4592 and then Etype
(Expr_N
) = Typ
4594 Expr_N
:= Expression
(Expr_N
);
4595 Set_Expression
(N
, Expr_N
);
4598 Expr_Typ
:= Base_Type
(Etype
(Expr_N
));
4600 if Is_Class_Wide_Type
(Expr_Typ
) then
4601 Expr_Typ
:= Root_Type
(Expr_Typ
);
4605 -- CW : I'Class := Obj;
4608 -- CW : I'Class renames TiC!(Tmp.I_Tag);
4610 if Comes_From_Source
(Expr_N
)
4611 and then Nkind
(Expr_N
) = N_Identifier
4612 and then not Is_Interface
(Expr_Typ
)
4613 and then (Expr_Typ
= Etype
(Expr_Typ
)
4615 Is_Variable_Size_Record
(Etype
(Expr_Typ
)))
4618 Make_Object_Declaration
(Loc
,
4619 Defining_Identifier
=>
4620 Make_Defining_Identifier
(Loc
,
4621 New_Internal_Name
('D')),
4622 Object_Definition
=>
4623 New_Occurrence_Of
(Expr_Typ
, Loc
),
4625 Unchecked_Convert_To
(Expr_Typ
,
4626 Relocate_Node
(Expr_N
)));
4628 -- Statically reference the tag associated with the
4632 Make_Object_Renaming_Declaration
(Loc
,
4633 Defining_Identifier
=>
4634 Make_Defining_Identifier
(Loc
,
4635 New_Internal_Name
('D')),
4637 New_Occurrence_Of
(Typ
, Loc
),
4639 Unchecked_Convert_To
(Typ
,
4640 Make_Selected_Component
(Loc
,
4643 (Defining_Identifier
(Decl_1
), Loc
),
4646 (Find_Interface_Tag
(Expr_Typ
, Iface
),
4652 -- IW : I'Class := Obj;
4654 -- type Equiv_Record is record ... end record;
4655 -- implicit subtype CW is <Class_Wide_Subtype>;
4656 -- Temp : CW := CW!(Obj'Address);
4657 -- IW : I'Class renames Displace (Temp, I'Tag);
4660 -- Generate the equivalent record type
4662 Expand_Subtype_From_Expr
4665 Subtype_Indic
=> Object_Definition
(N
),
4666 Exp
=> Expression
(N
));
4668 if not Is_Interface
(Etype
(Expression
(N
))) then
4669 New_Expr
:= Relocate_Node
(Expression
(N
));
4672 Make_Explicit_Dereference
(Loc
,
4673 Unchecked_Convert_To
(RTE
(RE_Tag_Ptr
),
4674 Make_Attribute_Reference
(Loc
,
4675 Prefix
=> Relocate_Node
(Expression
(N
)),
4676 Attribute_Name
=> Name_Address
)));
4680 Make_Object_Declaration
(Loc
,
4681 Defining_Identifier
=>
4682 Make_Defining_Identifier
(Loc
,
4683 New_Internal_Name
('D')),
4684 Object_Definition
=>
4686 (Etype
(Object_Definition
(N
)), Loc
),
4688 Unchecked_Convert_To
4689 (Etype
(Object_Definition
(N
)), New_Expr
));
4692 Make_Object_Renaming_Declaration
(Loc
,
4693 Defining_Identifier
=>
4694 Make_Defining_Identifier
(Loc
,
4695 New_Internal_Name
('D')),
4697 New_Occurrence_Of
(Typ
, Loc
),
4699 Unchecked_Convert_To
(Typ
,
4700 Make_Explicit_Dereference
(Loc
,
4701 Unchecked_Convert_To
(RTE
(RE_Tag_Ptr
),
4702 Make_Function_Call
(Loc
,
4704 New_Reference_To
(RTE
(RE_Displace
), Loc
),
4705 Parameter_Associations
=> New_List
(
4706 Make_Attribute_Reference
(Loc
,
4709 (Defining_Identifier
(Decl_1
), Loc
),
4710 Attribute_Name
=> Name_Address
),
4712 Unchecked_Convert_To
(RTE
(RE_Tag
),
4716 (Access_Disp_Table
(Iface
))),
4720 Insert_Action
(N
, Decl_1
);
4721 Rewrite
(N
, Decl_2
);
4724 -- Replace internal identifier of Decl_2 by the identifier
4725 -- found in the sources. We also have to exchange entities
4726 -- containing their defining identifiers to ensure the
4727 -- correct replacement of the object declaration by this
4728 -- object renaming declaration (because such definings
4729 -- identifier have been previously added by Enter_Name to
4730 -- the current scope). We must preserve the homonym chain
4731 -- of the source entity as well.
4733 Set_Chars
(Defining_Identifier
(N
), Chars
(Def_Id
));
4734 Set_Homonym
(Defining_Identifier
(N
), Homonym
(Def_Id
));
4735 Exchange_Entities
(Defining_Identifier
(N
), Def_Id
);
4742 -- In most cases, we must check that the initial value meets any
4743 -- constraint imposed by the declared type. However, there is one
4744 -- very important exception to this rule. If the entity has an
4745 -- unconstrained nominal subtype, then it acquired its constraints
4746 -- from the expression in the first place, and not only does this
4747 -- mean that the constraint check is not needed, but an attempt to
4748 -- perform the constraint check can cause order of elaboration
4751 if not Is_Constr_Subt_For_U_Nominal
(Typ
) then
4753 -- If this is an allocator for an aggregate that has been
4754 -- allocated in place, delay checks until assignments are
4755 -- made, because the discriminants are not initialized.
4757 if Nkind
(Expr
) = N_Allocator
4758 and then No_Initialization
(Expr
)
4762 Apply_Constraint_Check
(Expr
, Typ
);
4764 -- If the expression has been marked as requiring a range
4765 -- generate it now and reset the flag.
4767 if Do_Range_Check
(Expr
) then
4768 Set_Do_Range_Check
(Expr
, False);
4769 Generate_Range_Check
(Expr
, Typ
, CE_Range_Check_Failed
);
4774 -- If the type is controlled and not inherently limited, then
4775 -- the target is adjusted after the copy and attached to the
4776 -- finalization list. However, no adjustment is done in the case
4777 -- where the object was initialized by a call to a function whose
4778 -- result is built in place, since no copy occurred. (Eventually
4779 -- we plan to support in-place function results for some cases
4780 -- of nonlimited types. ???) Similarly, no adjustment is required
4781 -- if we are going to rewrite the object declaration into a
4782 -- renaming declaration.
4784 if Needs_Finalization
(Typ
)
4785 and then not Is_Inherently_Limited_Type
(Typ
)
4786 and then not Rewrite_As_Renaming
4788 Insert_Actions_After
(Init_After
,
4790 Ref
=> New_Reference_To
(Def_Id
, Loc
),
4791 Typ
=> Base_Type
(Typ
),
4792 Flist_Ref
=> Find_Final_List
(Def_Id
),
4793 With_Attach
=> Make_Integer_Literal
(Loc
, 1)));
4796 -- For tagged types, when an init value is given, the tag has to
4797 -- be re-initialized separately in order to avoid the propagation
4798 -- of a wrong tag coming from a view conversion unless the type
4799 -- is class wide (in this case the tag comes from the init value).
4800 -- Suppress the tag assignment when VM_Target because VM tags are
4801 -- represented implicitly in objects. Ditto for types that are
4802 -- CPP_CLASS, and for initializations that are aggregates, because
4803 -- they have to have the right tag.
4805 if Is_Tagged_Type
(Typ
)
4806 and then not Is_Class_Wide_Type
(Typ
)
4807 and then not Is_CPP_Class
(Typ
)
4808 and then Tagged_Type_Expansion
4809 and then Nkind
(Expr
) /= N_Aggregate
4811 -- The re-assignment of the tag has to be done even if the
4812 -- object is a constant.
4815 Make_Selected_Component
(Loc
,
4816 Prefix
=> New_Reference_To
(Def_Id
, Loc
),
4818 New_Reference_To
(First_Tag_Component
(Typ
), Loc
));
4820 Set_Assignment_OK
(New_Ref
);
4822 Insert_After
(Init_After
,
4823 Make_Assignment_Statement
(Loc
,
4826 Unchecked_Convert_To
(RTE
(RE_Tag
),
4830 (Access_Disp_Table
(Base_Type
(Typ
)))),
4833 elsif Is_Tagged_Type
(Typ
)
4834 and then Is_CPP_Constructor_Call
(Expr
)
4836 -- The call to the initialization procedure does NOT freeze the
4837 -- object being initialized.
4839 Id_Ref
:= New_Reference_To
(Def_Id
, Loc
);
4840 Set_Must_Not_Freeze
(Id_Ref
);
4841 Set_Assignment_OK
(Id_Ref
);
4843 Insert_Actions_After
(Init_After
,
4844 Build_Initialization_Call
(Loc
, Id_Ref
, Typ
,
4845 Constructor_Ref
=> Expr
));
4847 -- We remove here the original call to the constructor
4848 -- to avoid its management in the backend
4850 Set_Expression
(N
, Empty
);
4853 -- For discrete types, set the Is_Known_Valid flag if the
4854 -- initializing value is known to be valid.
4856 elsif Is_Discrete_Type
(Typ
) and then Expr_Known_Valid
(Expr
) then
4857 Set_Is_Known_Valid
(Def_Id
);
4859 elsif Is_Access_Type
(Typ
) then
4861 -- For access types set the Is_Known_Non_Null flag if the
4862 -- initializing value is known to be non-null. We can also set
4863 -- Can_Never_Be_Null if this is a constant.
4865 if Known_Non_Null
(Expr
) then
4866 Set_Is_Known_Non_Null
(Def_Id
, True);
4868 if Constant_Present
(N
) then
4869 Set_Can_Never_Be_Null
(Def_Id
);
4874 -- If validity checking on copies, validate initial expression.
4875 -- But skip this if declaration is for a generic type, since it
4876 -- makes no sense to validate generic types. Not clear if this
4877 -- can happen for legal programs, but it definitely can arise
4878 -- from previous instantiation errors.
4880 if Validity_Checks_On
4881 and then Validity_Check_Copies
4882 and then not Is_Generic_Type
(Etype
(Def_Id
))
4884 Ensure_Valid
(Expr
);
4885 Set_Is_Known_Valid
(Def_Id
);
4889 -- Cases where the back end cannot handle the initialization directly
4890 -- In such cases, we expand an assignment that will be appropriately
4891 -- handled by Expand_N_Assignment_Statement.
4893 -- The exclusion of the unconstrained case is wrong, but for now it
4894 -- is too much trouble ???
4896 if (Is_Possibly_Unaligned_Slice
(Expr
)
4897 or else (Is_Possibly_Unaligned_Object
(Expr
)
4898 and then not Represented_As_Scalar
(Etype
(Expr
))))
4900 -- The exclusion of the unconstrained case is wrong, but for now
4901 -- it is too much trouble ???
4903 and then not (Is_Array_Type
(Etype
(Expr
))
4904 and then not Is_Constrained
(Etype
(Expr
)))
4907 Stat
: constant Node_Id
:=
4908 Make_Assignment_Statement
(Loc
,
4909 Name
=> New_Reference_To
(Def_Id
, Loc
),
4910 Expression
=> Relocate_Node
(Expr
));
4912 Set_Expression
(N
, Empty
);
4913 Set_No_Initialization
(N
);
4914 Set_Assignment_OK
(Name
(Stat
));
4915 Set_No_Ctrl_Actions
(Stat
);
4916 Insert_After_And_Analyze
(Init_After
, Stat
);
4920 -- Final transformation, if the initializing expression is an entity
4921 -- for a variable with OK_To_Rename set, then we transform:
4927 -- X : typ renames expr
4929 -- provided that X is not aliased. The aliased case has to be
4930 -- excluded in general because Expr will not be aliased in general.
4932 if Rewrite_As_Renaming
then
4934 Make_Object_Renaming_Declaration
(Loc
,
4935 Defining_Identifier
=> Defining_Identifier
(N
),
4936 Subtype_Mark
=> Object_Definition
(N
),
4939 -- We do not analyze this renaming declaration, because all its
4940 -- components have already been analyzed, and if we were to go
4941 -- ahead and analyze it, we would in effect be trying to generate
4942 -- another declaration of X, which won't do!
4944 Set_Renamed_Object
(Defining_Identifier
(N
), Expr_Q
);
4951 when RE_Not_Available
=>
4953 end Expand_N_Object_Declaration
;
4955 ---------------------------------
4956 -- Expand_N_Subtype_Indication --
4957 ---------------------------------
4959 -- Add a check on the range of the subtype. The static case is partially
4960 -- duplicated by Process_Range_Expr_In_Decl in Sem_Ch3, but we still need
4961 -- to check here for the static case in order to avoid generating
4962 -- extraneous expanded code. Also deal with validity checking.
4964 procedure Expand_N_Subtype_Indication
(N
: Node_Id
) is
4965 Ran
: constant Node_Id
:= Range_Expression
(Constraint
(N
));
4966 Typ
: constant Entity_Id
:= Entity
(Subtype_Mark
(N
));
4969 if Nkind
(Constraint
(N
)) = N_Range_Constraint
then
4970 Validity_Check_Range
(Range_Expression
(Constraint
(N
)));
4973 if Nkind_In
(Parent
(N
), N_Constrained_Array_Definition
, N_Slice
) then
4974 Apply_Range_Check
(Ran
, Typ
);
4976 end Expand_N_Subtype_Indication
;
4978 ---------------------------
4979 -- Expand_N_Variant_Part --
4980 ---------------------------
4982 -- If the last variant does not contain the Others choice, replace it with
4983 -- an N_Others_Choice node since Gigi always wants an Others. Note that we
4984 -- do not bother to call Analyze on the modified variant part, since it's
4985 -- only effect would be to compute the Others_Discrete_Choices node
4986 -- laboriously, and of course we already know the list of choices that
4987 -- corresponds to the others choice (it's the list we are replacing!)
4989 procedure Expand_N_Variant_Part
(N
: Node_Id
) is
4990 Last_Var
: constant Node_Id
:= Last_Non_Pragma
(Variants
(N
));
4991 Others_Node
: Node_Id
;
4993 if Nkind
(First
(Discrete_Choices
(Last_Var
))) /= N_Others_Choice
then
4994 Others_Node
:= Make_Others_Choice
(Sloc
(Last_Var
));
4995 Set_Others_Discrete_Choices
4996 (Others_Node
, Discrete_Choices
(Last_Var
));
4997 Set_Discrete_Choices
(Last_Var
, New_List
(Others_Node
));
4999 end Expand_N_Variant_Part
;
5001 ---------------------------------
5002 -- Expand_Previous_Access_Type --
5003 ---------------------------------
5005 procedure Expand_Previous_Access_Type
(Def_Id
: Entity_Id
) is
5006 T
: Entity_Id
:= First_Entity
(Current_Scope
);
5009 -- Find all access types declared in the current scope, whose
5010 -- designated type is Def_Id. If it does not have a Master_Id,
5013 while Present
(T
) loop
5014 if Is_Access_Type
(T
)
5015 and then Designated_Type
(T
) = Def_Id
5016 and then No
(Master_Id
(T
))
5018 Build_Master_Entity
(Def_Id
);
5019 Build_Master_Renaming
(Parent
(Def_Id
), T
);
5024 end Expand_Previous_Access_Type
;
5026 ------------------------------
5027 -- Expand_Record_Controller --
5028 ------------------------------
5030 procedure Expand_Record_Controller
(T
: Entity_Id
) is
5031 Def
: Node_Id
:= Type_Definition
(Parent
(T
));
5032 Comp_List
: Node_Id
;
5033 Comp_Decl
: Node_Id
;
5035 First_Comp
: Node_Id
;
5036 Controller_Type
: Entity_Id
;
5040 if Nkind
(Def
) = N_Derived_Type_Definition
then
5041 Def
:= Record_Extension_Part
(Def
);
5044 if Null_Present
(Def
) then
5045 Set_Component_List
(Def
,
5046 Make_Component_List
(Sloc
(Def
),
5047 Component_Items
=> Empty_List
,
5048 Variant_Part
=> Empty
,
5049 Null_Present
=> True));
5052 Comp_List
:= Component_List
(Def
);
5054 if Null_Present
(Comp_List
)
5055 or else Is_Empty_List
(Component_Items
(Comp_List
))
5057 Loc
:= Sloc
(Comp_List
);
5059 Loc
:= Sloc
(First
(Component_Items
(Comp_List
)));
5062 if Is_Inherently_Limited_Type
(T
) then
5063 Controller_Type
:= RTE
(RE_Limited_Record_Controller
);
5065 Controller_Type
:= RTE
(RE_Record_Controller
);
5068 Ent
:= Make_Defining_Identifier
(Loc
, Name_uController
);
5071 Make_Component_Declaration
(Loc
,
5072 Defining_Identifier
=> Ent
,
5073 Component_Definition
=>
5074 Make_Component_Definition
(Loc
,
5075 Aliased_Present
=> False,
5076 Subtype_Indication
=> New_Reference_To
(Controller_Type
, Loc
)));
5078 if Null_Present
(Comp_List
)
5079 or else Is_Empty_List
(Component_Items
(Comp_List
))
5081 Set_Component_Items
(Comp_List
, New_List
(Comp_Decl
));
5082 Set_Null_Present
(Comp_List
, False);
5085 -- The controller cannot be placed before the _Parent field since
5086 -- gigi lays out field in order and _parent must be first to preserve
5087 -- the polymorphism of tagged types.
5089 First_Comp
:= First
(Component_Items
(Comp_List
));
5091 if not Is_Tagged_Type
(T
) then
5092 Insert_Before
(First_Comp
, Comp_Decl
);
5094 -- if T is a tagged type, place controller declaration after parent
5095 -- field and after eventual tags of interface types.
5098 while Present
(First_Comp
)
5100 (Chars
(Defining_Identifier
(First_Comp
)) = Name_uParent
5101 or else Is_Tag
(Defining_Identifier
(First_Comp
))
5103 -- Ada 2005 (AI-251): The following condition covers secondary
5104 -- tags but also the adjacent component containing the offset
5105 -- to the base of the object (component generated if the parent
5106 -- has discriminants --- see Add_Interface_Tag_Components).
5107 -- This is required to avoid the addition of the controller
5108 -- between the secondary tag and its adjacent component.
5112 (Defining_Identifier
(First_Comp
))))
5117 -- An empty tagged extension might consist only of the parent
5118 -- component. Otherwise insert the controller before the first
5119 -- component that is neither parent nor tag.
5121 if Present
(First_Comp
) then
5122 Insert_Before
(First_Comp
, Comp_Decl
);
5124 Append
(Comp_Decl
, Component_Items
(Comp_List
));
5130 Analyze
(Comp_Decl
);
5131 Set_Ekind
(Ent
, E_Component
);
5132 Init_Component_Location
(Ent
);
5134 -- Move the _controller entity ahead in the list of internal entities
5135 -- of the enclosing record so that it is selected instead of a
5136 -- potentially inherited one.
5139 E
: constant Entity_Id
:= Last_Entity
(T
);
5143 pragma Assert
(Chars
(E
) = Name_uController
);
5145 Set_Next_Entity
(E
, First_Entity
(T
));
5146 Set_First_Entity
(T
, E
);
5148 Comp
:= Next_Entity
(E
);
5149 while Next_Entity
(Comp
) /= E
loop
5153 Set_Next_Entity
(Comp
, Empty
);
5154 Set_Last_Entity
(T
, Comp
);
5160 when RE_Not_Available
=>
5162 end Expand_Record_Controller
;
5164 ------------------------
5165 -- Expand_Tagged_Root --
5166 ------------------------
5168 procedure Expand_Tagged_Root
(T
: Entity_Id
) is
5169 Def
: constant Node_Id
:= Type_Definition
(Parent
(T
));
5170 Comp_List
: Node_Id
;
5171 Comp_Decl
: Node_Id
;
5172 Sloc_N
: Source_Ptr
;
5175 if Null_Present
(Def
) then
5176 Set_Component_List
(Def
,
5177 Make_Component_List
(Sloc
(Def
),
5178 Component_Items
=> Empty_List
,
5179 Variant_Part
=> Empty
,
5180 Null_Present
=> True));
5183 Comp_List
:= Component_List
(Def
);
5185 if Null_Present
(Comp_List
)
5186 or else Is_Empty_List
(Component_Items
(Comp_List
))
5188 Sloc_N
:= Sloc
(Comp_List
);
5190 Sloc_N
:= Sloc
(First
(Component_Items
(Comp_List
)));
5194 Make_Component_Declaration
(Sloc_N
,
5195 Defining_Identifier
=> First_Tag_Component
(T
),
5196 Component_Definition
=>
5197 Make_Component_Definition
(Sloc_N
,
5198 Aliased_Present
=> False,
5199 Subtype_Indication
=> New_Reference_To
(RTE
(RE_Tag
), Sloc_N
)));
5201 if Null_Present
(Comp_List
)
5202 or else Is_Empty_List
(Component_Items
(Comp_List
))
5204 Set_Component_Items
(Comp_List
, New_List
(Comp_Decl
));
5205 Set_Null_Present
(Comp_List
, False);
5208 Insert_Before
(First
(Component_Items
(Comp_List
)), Comp_Decl
);
5211 -- We don't Analyze the whole expansion because the tag component has
5212 -- already been analyzed previously. Here we just insure that the tree
5213 -- is coherent with the semantic decoration
5215 Find_Type
(Subtype_Indication
(Component_Definition
(Comp_Decl
)));
5218 when RE_Not_Available
=>
5220 end Expand_Tagged_Root
;
5222 ----------------------
5223 -- Clean_Task_Names --
5224 ----------------------
5226 procedure Clean_Task_Names
5228 Proc_Id
: Entity_Id
)
5232 and then not Restriction_Active
(No_Implicit_Heap_Allocations
)
5233 and then not Global_Discard_Names
5234 and then Tagged_Type_Expansion
5236 Set_Uses_Sec_Stack
(Proc_Id
);
5238 end Clean_Task_Names
;
5240 ------------------------------
5241 -- Expand_Freeze_Array_Type --
5242 ------------------------------
5244 procedure Expand_Freeze_Array_Type
(N
: Node_Id
) is
5245 Typ
: constant Entity_Id
:= Entity
(N
);
5246 Comp_Typ
: constant Entity_Id
:= Component_Type
(Typ
);
5247 Base
: constant Entity_Id
:= Base_Type
(Typ
);
5250 if not Is_Bit_Packed_Array
(Typ
) then
5252 -- If the component contains tasks, so does the array type. This may
5253 -- not be indicated in the array type because the component may have
5254 -- been a private type at the point of definition. Same if component
5255 -- type is controlled.
5257 Set_Has_Task
(Base
, Has_Task
(Comp_Typ
));
5258 Set_Has_Controlled_Component
(Base
,
5259 Has_Controlled_Component
(Comp_Typ
)
5260 or else Is_Controlled
(Comp_Typ
));
5262 if No
(Init_Proc
(Base
)) then
5264 -- If this is an anonymous array created for a declaration with
5265 -- an initial value, its init_proc will never be called. The
5266 -- initial value itself may have been expanded into assignments,
5267 -- in which case the object declaration is carries the
5268 -- No_Initialization flag.
5271 and then Nkind
(Associated_Node_For_Itype
(Base
)) =
5272 N_Object_Declaration
5273 and then (Present
(Expression
(Associated_Node_For_Itype
(Base
)))
5275 No_Initialization
(Associated_Node_For_Itype
(Base
)))
5279 -- We do not need an init proc for string or wide [wide] string,
5280 -- since the only time these need initialization in normalize or
5281 -- initialize scalars mode, and these types are treated specially
5282 -- and do not need initialization procedures.
5284 elsif Root_Type
(Base
) = Standard_String
5285 or else Root_Type
(Base
) = Standard_Wide_String
5286 or else Root_Type
(Base
) = Standard_Wide_Wide_String
5290 -- Otherwise we have to build an init proc for the subtype
5293 Build_Array_Init_Proc
(Base
, N
);
5298 if Has_Controlled_Component
(Base
) then
5299 Build_Controlling_Procs
(Base
);
5301 if not Is_Limited_Type
(Comp_Typ
)
5302 and then Number_Dimensions
(Typ
) = 1
5304 Build_Slice_Assignment
(Typ
);
5307 elsif Ekind
(Comp_Typ
) = E_Anonymous_Access_Type
5308 and then Needs_Finalization
(Directly_Designated_Type
(Comp_Typ
))
5310 Set_Associated_Final_Chain
(Comp_Typ
, Add_Final_Chain
(Typ
));
5314 -- For packed case, default initialization, except if the component type
5315 -- is itself a packed structure with an initialization procedure, or
5316 -- initialize/normalize scalars active, and we have a base type, or the
5317 -- type is public, because in that case a client might specify
5318 -- Normalize_Scalars and there better be a public Init_Proc for it.
5320 elsif (Present
(Init_Proc
(Component_Type
(Base
)))
5321 and then No
(Base_Init_Proc
(Base
)))
5322 or else (Init_Or_Norm_Scalars
and then Base
= Typ
)
5323 or else Is_Public
(Typ
)
5325 Build_Array_Init_Proc
(Base
, N
);
5327 end Expand_Freeze_Array_Type
;
5329 ------------------------------------
5330 -- Expand_Freeze_Enumeration_Type --
5331 ------------------------------------
5333 procedure Expand_Freeze_Enumeration_Type
(N
: Node_Id
) is
5334 Typ
: constant Entity_Id
:= Entity
(N
);
5335 Loc
: constant Source_Ptr
:= Sloc
(Typ
);
5342 Is_Contiguous
: Boolean;
5347 pragma Warnings
(Off
, Func
);
5350 -- Various optimizations possible if given representation is contiguous
5352 Is_Contiguous
:= True;
5354 Ent
:= First_Literal
(Typ
);
5355 Last_Repval
:= Enumeration_Rep
(Ent
);
5358 while Present
(Ent
) loop
5359 if Enumeration_Rep
(Ent
) - Last_Repval
/= 1 then
5360 Is_Contiguous
:= False;
5363 Last_Repval
:= Enumeration_Rep
(Ent
);
5369 if Is_Contiguous
then
5370 Set_Has_Contiguous_Rep
(Typ
);
5371 Ent
:= First_Literal
(Typ
);
5373 Lst
:= New_List
(New_Reference_To
(Ent
, Sloc
(Ent
)));
5376 -- Build list of literal references
5381 Ent
:= First_Literal
(Typ
);
5382 while Present
(Ent
) loop
5383 Append_To
(Lst
, New_Reference_To
(Ent
, Sloc
(Ent
)));
5389 -- Now build an array declaration
5391 -- typA : array (Natural range 0 .. num - 1) of ctype :=
5392 -- (v, v, v, v, v, ....)
5394 -- where ctype is the corresponding integer type. If the representation
5395 -- is contiguous, we only keep the first literal, which provides the
5396 -- offset for Pos_To_Rep computations.
5399 Make_Defining_Identifier
(Loc
,
5400 Chars
=> New_External_Name
(Chars
(Typ
), 'A'));
5402 Append_Freeze_Action
(Typ
,
5403 Make_Object_Declaration
(Loc
,
5404 Defining_Identifier
=> Arr
,
5405 Constant_Present
=> True,
5407 Object_Definition
=>
5408 Make_Constrained_Array_Definition
(Loc
,
5409 Discrete_Subtype_Definitions
=> New_List
(
5410 Make_Subtype_Indication
(Loc
,
5411 Subtype_Mark
=> New_Reference_To
(Standard_Natural
, Loc
),
5413 Make_Range_Constraint
(Loc
,
5417 Make_Integer_Literal
(Loc
, 0),
5419 Make_Integer_Literal
(Loc
, Num
- 1))))),
5421 Component_Definition
=>
5422 Make_Component_Definition
(Loc
,
5423 Aliased_Present
=> False,
5424 Subtype_Indication
=> New_Reference_To
(Typ
, Loc
))),
5427 Make_Aggregate
(Loc
,
5428 Expressions
=> Lst
)));
5430 Set_Enum_Pos_To_Rep
(Typ
, Arr
);
5432 -- Now we build the function that converts representation values to
5433 -- position values. This function has the form:
5435 -- function _Rep_To_Pos (A : etype; F : Boolean) return Integer is
5438 -- when enum-lit'Enum_Rep => return posval;
5439 -- when enum-lit'Enum_Rep => return posval;
5442 -- [raise Constraint_Error when F "invalid data"]
5447 -- Note: the F parameter determines whether the others case (no valid
5448 -- representation) raises Constraint_Error or returns a unique value
5449 -- of minus one. The latter case is used, e.g. in 'Valid code.
5451 -- Note: the reason we use Enum_Rep values in the case here is to avoid
5452 -- the code generator making inappropriate assumptions about the range
5453 -- of the values in the case where the value is invalid. ityp is a
5454 -- signed or unsigned integer type of appropriate width.
5456 -- Note: if exceptions are not supported, then we suppress the raise
5457 -- and return -1 unconditionally (this is an erroneous program in any
5458 -- case and there is no obligation to raise Constraint_Error here!) We
5459 -- also do this if pragma Restrictions (No_Exceptions) is active.
5461 -- Is this right??? What about No_Exception_Propagation???
5463 -- Representations are signed
5465 if Enumeration_Rep
(First_Literal
(Typ
)) < 0 then
5467 -- The underlying type is signed. Reset the Is_Unsigned_Type
5468 -- explicitly, because it might have been inherited from
5471 Set_Is_Unsigned_Type
(Typ
, False);
5473 if Esize
(Typ
) <= Standard_Integer_Size
then
5474 Ityp
:= Standard_Integer
;
5476 Ityp
:= Universal_Integer
;
5479 -- Representations are unsigned
5482 if Esize
(Typ
) <= Standard_Integer_Size
then
5483 Ityp
:= RTE
(RE_Unsigned
);
5485 Ityp
:= RTE
(RE_Long_Long_Unsigned
);
5489 -- The body of the function is a case statement. First collect case
5490 -- alternatives, or optimize the contiguous case.
5494 -- If representation is contiguous, Pos is computed by subtracting
5495 -- the representation of the first literal.
5497 if Is_Contiguous
then
5498 Ent
:= First_Literal
(Typ
);
5500 if Enumeration_Rep
(Ent
) = Last_Repval
then
5502 -- Another special case: for a single literal, Pos is zero
5504 Pos_Expr
:= Make_Integer_Literal
(Loc
, Uint_0
);
5508 Convert_To
(Standard_Integer
,
5509 Make_Op_Subtract
(Loc
,
5511 Unchecked_Convert_To
(Ityp
,
5512 Make_Identifier
(Loc
, Name_uA
)),
5514 Make_Integer_Literal
(Loc
,
5516 Enumeration_Rep
(First_Literal
(Typ
)))));
5520 Make_Case_Statement_Alternative
(Loc
,
5521 Discrete_Choices
=> New_List
(
5522 Make_Range
(Sloc
(Enumeration_Rep_Expr
(Ent
)),
5524 Make_Integer_Literal
(Loc
,
5525 Intval
=> Enumeration_Rep
(Ent
)),
5527 Make_Integer_Literal
(Loc
, Intval
=> Last_Repval
))),
5529 Statements
=> New_List
(
5530 Make_Simple_Return_Statement
(Loc
,
5531 Expression
=> Pos_Expr
))));
5534 Ent
:= First_Literal
(Typ
);
5535 while Present
(Ent
) loop
5537 Make_Case_Statement_Alternative
(Loc
,
5538 Discrete_Choices
=> New_List
(
5539 Make_Integer_Literal
(Sloc
(Enumeration_Rep_Expr
(Ent
)),
5540 Intval
=> Enumeration_Rep
(Ent
))),
5542 Statements
=> New_List
(
5543 Make_Simple_Return_Statement
(Loc
,
5545 Make_Integer_Literal
(Loc
,
5546 Intval
=> Enumeration_Pos
(Ent
))))));
5552 -- In normal mode, add the others clause with the test
5554 if not No_Exception_Handlers_Set
then
5556 Make_Case_Statement_Alternative
(Loc
,
5557 Discrete_Choices
=> New_List
(Make_Others_Choice
(Loc
)),
5558 Statements
=> New_List
(
5559 Make_Raise_Constraint_Error
(Loc
,
5560 Condition
=> Make_Identifier
(Loc
, Name_uF
),
5561 Reason
=> CE_Invalid_Data
),
5562 Make_Simple_Return_Statement
(Loc
,
5564 Make_Integer_Literal
(Loc
, -1)))));
5566 -- If either of the restrictions No_Exceptions_Handlers/Propagation is
5567 -- active then return -1 (we cannot usefully raise Constraint_Error in
5568 -- this case). See description above for further details.
5572 Make_Case_Statement_Alternative
(Loc
,
5573 Discrete_Choices
=> New_List
(Make_Others_Choice
(Loc
)),
5574 Statements
=> New_List
(
5575 Make_Simple_Return_Statement
(Loc
,
5577 Make_Integer_Literal
(Loc
, -1)))));
5580 -- Now we can build the function body
5583 Make_Defining_Identifier
(Loc
, Make_TSS_Name
(Typ
, TSS_Rep_To_Pos
));
5586 Make_Subprogram_Body
(Loc
,
5588 Make_Function_Specification
(Loc
,
5589 Defining_Unit_Name
=> Fent
,
5590 Parameter_Specifications
=> New_List
(
5591 Make_Parameter_Specification
(Loc
,
5592 Defining_Identifier
=>
5593 Make_Defining_Identifier
(Loc
, Name_uA
),
5594 Parameter_Type
=> New_Reference_To
(Typ
, Loc
)),
5595 Make_Parameter_Specification
(Loc
,
5596 Defining_Identifier
=>
5597 Make_Defining_Identifier
(Loc
, Name_uF
),
5598 Parameter_Type
=> New_Reference_To
(Standard_Boolean
, Loc
))),
5600 Result_Definition
=> New_Reference_To
(Standard_Integer
, Loc
)),
5602 Declarations
=> Empty_List
,
5604 Handled_Statement_Sequence
=>
5605 Make_Handled_Sequence_Of_Statements
(Loc
,
5606 Statements
=> New_List
(
5607 Make_Case_Statement
(Loc
,
5609 Unchecked_Convert_To
(Ityp
,
5610 Make_Identifier
(Loc
, Name_uA
)),
5611 Alternatives
=> Lst
))));
5613 Set_TSS
(Typ
, Fent
);
5616 if not Debug_Generated_Code
then
5617 Set_Debug_Info_Off
(Fent
);
5621 when RE_Not_Available
=>
5623 end Expand_Freeze_Enumeration_Type
;
5625 -------------------------------
5626 -- Expand_Freeze_Record_Type --
5627 -------------------------------
5629 procedure Expand_Freeze_Record_Type
(N
: Node_Id
) is
5630 Def_Id
: constant Node_Id
:= Entity
(N
);
5631 Type_Decl
: constant Node_Id
:= Parent
(Def_Id
);
5633 Comp_Typ
: Entity_Id
;
5634 Has_Static_DT
: Boolean := False;
5635 Predef_List
: List_Id
;
5637 Flist
: Entity_Id
:= Empty
;
5638 -- Finalization list allocated for the case of a type with anonymous
5639 -- access components whose designated type is potentially controlled.
5641 Renamed_Eq
: Node_Id
:= Empty
;
5642 -- Defining unit name for the predefined equality function in the case
5643 -- where the type has a primitive operation that is a renaming of
5644 -- predefined equality (but only if there is also an overriding
5645 -- user-defined equality function). Used to pass this entity from
5646 -- Make_Predefined_Primitive_Specs to Predefined_Primitive_Bodies.
5648 Wrapper_Decl_List
: List_Id
:= No_List
;
5649 Wrapper_Body_List
: List_Id
:= No_List
;
5650 Null_Proc_Decl_List
: List_Id
:= No_List
;
5652 -- Start of processing for Expand_Freeze_Record_Type
5655 -- Build discriminant checking functions if not a derived type (for
5656 -- derived types that are not tagged types, always use the discriminant
5657 -- checking functions of the parent type). However, for untagged types
5658 -- the derivation may have taken place before the parent was frozen, so
5659 -- we copy explicitly the discriminant checking functions from the
5660 -- parent into the components of the derived type.
5662 if not Is_Derived_Type
(Def_Id
)
5663 or else Has_New_Non_Standard_Rep
(Def_Id
)
5664 or else Is_Tagged_Type
(Def_Id
)
5666 Build_Discr_Checking_Funcs
(Type_Decl
);
5668 elsif Is_Derived_Type
(Def_Id
)
5669 and then not Is_Tagged_Type
(Def_Id
)
5671 -- If we have a derived Unchecked_Union, we do not inherit the
5672 -- discriminant checking functions from the parent type since the
5673 -- discriminants are non existent.
5675 and then not Is_Unchecked_Union
(Def_Id
)
5676 and then Has_Discriminants
(Def_Id
)
5679 Old_Comp
: Entity_Id
;
5683 First_Component
(Base_Type
(Underlying_Type
(Etype
(Def_Id
))));
5684 Comp
:= First_Component
(Def_Id
);
5685 while Present
(Comp
) loop
5686 if Ekind
(Comp
) = E_Component
5687 and then Chars
(Comp
) = Chars
(Old_Comp
)
5689 Set_Discriminant_Checking_Func
(Comp
,
5690 Discriminant_Checking_Func
(Old_Comp
));
5693 Next_Component
(Old_Comp
);
5694 Next_Component
(Comp
);
5699 if Is_Derived_Type
(Def_Id
)
5700 and then Is_Limited_Type
(Def_Id
)
5701 and then Is_Tagged_Type
(Def_Id
)
5703 Check_Stream_Attributes
(Def_Id
);
5706 -- Update task and controlled component flags, because some of the
5707 -- component types may have been private at the point of the record
5710 Comp
:= First_Component
(Def_Id
);
5712 while Present
(Comp
) loop
5713 Comp_Typ
:= Etype
(Comp
);
5715 if Has_Task
(Comp_Typ
) then
5716 Set_Has_Task
(Def_Id
);
5718 -- Do not set Has_Controlled_Component on a class-wide equivalent
5719 -- type. See Make_CW_Equivalent_Type.
5721 elsif not Is_Class_Wide_Equivalent_Type
(Def_Id
)
5722 and then (Has_Controlled_Component
(Comp_Typ
)
5723 or else (Chars
(Comp
) /= Name_uParent
5724 and then Is_Controlled
(Comp_Typ
)))
5726 Set_Has_Controlled_Component
(Def_Id
);
5728 elsif Ekind
(Comp_Typ
) = E_Anonymous_Access_Type
5729 and then Needs_Finalization
(Directly_Designated_Type
(Comp_Typ
))
5732 Flist
:= Add_Final_Chain
(Def_Id
);
5735 Set_Associated_Final_Chain
(Comp_Typ
, Flist
);
5738 Next_Component
(Comp
);
5741 -- Handle constructors of non-tagged CPP_Class types
5743 if not Is_Tagged_Type
(Def_Id
) and then Is_CPP_Class
(Def_Id
) then
5744 Set_CPP_Constructors
(Def_Id
);
5747 -- Creation of the Dispatch Table. Note that a Dispatch Table is built
5748 -- for regular tagged types as well as for Ada types deriving from a C++
5749 -- Class, but not for tagged types directly corresponding to C++ classes
5750 -- In the later case we assume that it is created in the C++ side and we
5753 if Is_Tagged_Type
(Def_Id
) then
5755 Static_Dispatch_Tables
5756 and then Is_Library_Level_Tagged_Type
(Def_Id
);
5758 -- Add the _Tag component
5760 if Underlying_Type
(Etype
(Def_Id
)) = Def_Id
then
5761 Expand_Tagged_Root
(Def_Id
);
5764 if Is_CPP_Class
(Def_Id
) then
5765 Set_All_DT_Position
(Def_Id
);
5766 Set_CPP_Constructors
(Def_Id
);
5768 -- Create the tag entities with a minimum decoration
5770 if Tagged_Type_Expansion
then
5771 Append_Freeze_Actions
(Def_Id
, Make_Tags
(Def_Id
));
5775 if not Has_Static_DT
then
5777 -- Usually inherited primitives are not delayed but the first
5778 -- Ada extension of a CPP_Class is an exception since the
5779 -- address of the inherited subprogram has to be inserted in
5780 -- the new Ada Dispatch Table and this is a freezing action.
5782 -- Similarly, if this is an inherited operation whose parent is
5783 -- not frozen yet, it is not in the DT of the parent, and we
5784 -- generate an explicit freeze node for the inherited operation
5785 -- so that it is properly inserted in the DT of the current
5789 Elmt
: Elmt_Id
:= First_Elmt
(Primitive_Operations
(Def_Id
));
5793 while Present
(Elmt
) loop
5794 Subp
:= Node
(Elmt
);
5796 if Present
(Alias
(Subp
)) then
5797 if Is_CPP_Class
(Etype
(Def_Id
)) then
5798 Set_Has_Delayed_Freeze
(Subp
);
5800 elsif Has_Delayed_Freeze
(Alias
(Subp
))
5801 and then not Is_Frozen
(Alias
(Subp
))
5803 Set_Is_Frozen
(Subp
, False);
5804 Set_Has_Delayed_Freeze
(Subp
);
5813 -- Unfreeze momentarily the type to add the predefined primitives
5814 -- operations. The reason we unfreeze is so that these predefined
5815 -- operations will indeed end up as primitive operations (which
5816 -- must be before the freeze point).
5818 Set_Is_Frozen
(Def_Id
, False);
5820 -- Do not add the spec of predefined primitives in case of
5821 -- CPP tagged type derivations that have convention CPP.
5823 if Is_CPP_Class
(Root_Type
(Def_Id
))
5824 and then Convention
(Def_Id
) = Convention_CPP
5828 -- Do not add the spec of the predefined primitives if we are
5829 -- compiling under restriction No_Dispatching_Calls
5831 elsif not Restriction_Active
(No_Dispatching_Calls
) then
5832 Make_Predefined_Primitive_Specs
5833 (Def_Id
, Predef_List
, Renamed_Eq
);
5834 Insert_List_Before_And_Analyze
(N
, Predef_List
);
5837 -- Ada 2005 (AI-391): For a nonabstract null extension, create
5838 -- wrapper functions for each nonoverridden inherited function
5839 -- with a controlling result of the type. The wrapper for such
5840 -- a function returns an extension aggregate that invokes the
5841 -- the parent function.
5843 if Ada_Version
>= Ada_05
5844 and then not Is_Abstract_Type
(Def_Id
)
5845 and then Is_Null_Extension
(Def_Id
)
5847 Make_Controlling_Function_Wrappers
5848 (Def_Id
, Wrapper_Decl_List
, Wrapper_Body_List
);
5849 Insert_List_Before_And_Analyze
(N
, Wrapper_Decl_List
);
5852 -- Ada 2005 (AI-251): For a nonabstract type extension, build
5853 -- null procedure declarations for each set of homographic null
5854 -- procedures that are inherited from interface types but not
5855 -- overridden. This is done to ensure that the dispatch table
5856 -- entry associated with such null primitives are properly filled.
5858 if Ada_Version
>= Ada_05
5859 and then Etype
(Def_Id
) /= Def_Id
5860 and then not Is_Abstract_Type
(Def_Id
)
5862 Make_Null_Procedure_Specs
(Def_Id
, Null_Proc_Decl_List
);
5863 Insert_Actions
(N
, Null_Proc_Decl_List
);
5866 Set_Is_Frozen
(Def_Id
);
5867 Set_All_DT_Position
(Def_Id
);
5869 -- Add the controlled component before the freezing actions
5870 -- referenced in those actions.
5872 if Has_New_Controlled_Component
(Def_Id
) then
5873 Expand_Record_Controller
(Def_Id
);
5876 -- Create and decorate the tags. Suppress their creation when
5877 -- VM_Target because the dispatching mechanism is handled
5878 -- internally by the VMs.
5880 if Tagged_Type_Expansion
then
5881 Append_Freeze_Actions
(Def_Id
, Make_Tags
(Def_Id
));
5883 -- Generate dispatch table of locally defined tagged type.
5884 -- Dispatch tables of library level tagged types are built
5885 -- later (see Analyze_Declarations).
5887 if not Has_Static_DT
then
5888 Append_Freeze_Actions
(Def_Id
, Make_DT
(Def_Id
));
5892 -- If the type has unknown discriminants, propagate dispatching
5893 -- information to its underlying record view, which does not get
5894 -- its own dispatch table.
5896 if Is_Derived_Type
(Def_Id
)
5897 and then Has_Unknown_Discriminants
(Def_Id
)
5898 and then Present
(Underlying_Record_View
(Def_Id
))
5901 Rep
: constant Entity_Id
:=
5902 Underlying_Record_View
(Def_Id
);
5904 Set_Access_Disp_Table
5905 (Rep
, Access_Disp_Table
(Def_Id
));
5906 Set_Dispatch_Table_Wrappers
5907 (Rep
, Dispatch_Table_Wrappers
(Def_Id
));
5908 Set_Primitive_Operations
5909 (Rep
, Primitive_Operations
(Def_Id
));
5913 -- Make sure that the primitives Initialize, Adjust and Finalize
5914 -- are Frozen before other TSS subprograms. We don't want them
5917 if Is_Controlled
(Def_Id
) then
5918 if not Is_Limited_Type
(Def_Id
) then
5919 Append_Freeze_Actions
(Def_Id
,
5921 (Find_Prim_Op
(Def_Id
, Name_Adjust
), Sloc
(Def_Id
)));
5924 Append_Freeze_Actions
(Def_Id
,
5926 (Find_Prim_Op
(Def_Id
, Name_Initialize
), Sloc
(Def_Id
)));
5928 Append_Freeze_Actions
(Def_Id
,
5930 (Find_Prim_Op
(Def_Id
, Name_Finalize
), Sloc
(Def_Id
)));
5933 -- Freeze rest of primitive operations. There is no need to handle
5934 -- the predefined primitives if we are compiling under restriction
5935 -- No_Dispatching_Calls
5937 if not Restriction_Active
(No_Dispatching_Calls
) then
5938 Append_Freeze_Actions
5939 (Def_Id
, Predefined_Primitive_Freeze
(Def_Id
));
5943 -- In the non-tagged case, an equality function is provided only for
5944 -- variant records (that are not unchecked unions).
5946 elsif Has_Discriminants
(Def_Id
)
5947 and then not Is_Limited_Type
(Def_Id
)
5950 Comps
: constant Node_Id
:=
5951 Component_List
(Type_Definition
(Type_Decl
));
5955 and then Present
(Variant_Part
(Comps
))
5957 Build_Variant_Record_Equality
(Def_Id
);
5962 -- Before building the record initialization procedure, if we are
5963 -- dealing with a concurrent record value type, then we must go through
5964 -- the discriminants, exchanging discriminals between the concurrent
5965 -- type and the concurrent record value type. See the section "Handling
5966 -- of Discriminants" in the Einfo spec for details.
5968 if Is_Concurrent_Record_Type
(Def_Id
)
5969 and then Has_Discriminants
(Def_Id
)
5972 Ctyp
: constant Entity_Id
:=
5973 Corresponding_Concurrent_Type
(Def_Id
);
5974 Conc_Discr
: Entity_Id
;
5975 Rec_Discr
: Entity_Id
;
5979 Conc_Discr
:= First_Discriminant
(Ctyp
);
5980 Rec_Discr
:= First_Discriminant
(Def_Id
);
5982 while Present
(Conc_Discr
) loop
5983 Temp
:= Discriminal
(Conc_Discr
);
5984 Set_Discriminal
(Conc_Discr
, Discriminal
(Rec_Discr
));
5985 Set_Discriminal
(Rec_Discr
, Temp
);
5987 Set_Discriminal_Link
(Discriminal
(Conc_Discr
), Conc_Discr
);
5988 Set_Discriminal_Link
(Discriminal
(Rec_Discr
), Rec_Discr
);
5990 Next_Discriminant
(Conc_Discr
);
5991 Next_Discriminant
(Rec_Discr
);
5996 if Has_Controlled_Component
(Def_Id
) then
5997 if No
(Controller_Component
(Def_Id
)) then
5998 Expand_Record_Controller
(Def_Id
);
6001 Build_Controlling_Procs
(Def_Id
);
6004 Adjust_Discriminants
(Def_Id
);
6006 if Tagged_Type_Expansion
or else not Is_Interface
(Def_Id
) then
6008 -- Do not need init for interfaces on e.g. CIL since they're
6009 -- abstract. Helps operation of peverify (the PE Verify tool).
6011 Build_Record_Init_Proc
(Type_Decl
, Def_Id
);
6014 -- For tagged type that are not interfaces, build bodies of primitive
6015 -- operations. Note that we do this after building the record
6016 -- initialization procedure, since the primitive operations may need
6017 -- the initialization routine. There is no need to add predefined
6018 -- primitives of interfaces because all their predefined primitives
6021 if Is_Tagged_Type
(Def_Id
)
6022 and then not Is_Interface
(Def_Id
)
6024 -- Do not add the body of predefined primitives in case of
6025 -- CPP tagged type derivations that have convention CPP.
6027 if Is_CPP_Class
(Root_Type
(Def_Id
))
6028 and then Convention
(Def_Id
) = Convention_CPP
6032 -- Do not add the body of the predefined primitives if we are
6033 -- compiling under restriction No_Dispatching_Calls or if we are
6034 -- compiling a CPP tagged type.
6036 elsif not Restriction_Active
(No_Dispatching_Calls
) then
6037 Predef_List
:= Predefined_Primitive_Bodies
(Def_Id
, Renamed_Eq
);
6038 Append_Freeze_Actions
(Def_Id
, Predef_List
);
6041 -- Ada 2005 (AI-391): If any wrappers were created for nonoverridden
6042 -- inherited functions, then add their bodies to the freeze actions.
6044 if Present
(Wrapper_Body_List
) then
6045 Append_Freeze_Actions
(Def_Id
, Wrapper_Body_List
);
6048 -- Create extra formals for the primitive operations of the type.
6049 -- This must be done before analyzing the body of the initialization
6050 -- procedure, because a self-referential type might call one of these
6051 -- primitives in the body of the init_proc itself.
6058 Elmt
:= First_Elmt
(Primitive_Operations
(Def_Id
));
6059 while Present
(Elmt
) loop
6060 Subp
:= Node
(Elmt
);
6061 if not Has_Foreign_Convention
(Subp
)
6062 and then not Is_Predefined_Dispatching_Operation
(Subp
)
6064 Create_Extra_Formals
(Subp
);
6071 end Expand_Freeze_Record_Type
;
6073 ------------------------------
6074 -- Freeze_Stream_Operations --
6075 ------------------------------
6077 procedure Freeze_Stream_Operations
(N
: Node_Id
; Typ
: Entity_Id
) is
6078 Names
: constant array (1 .. 4) of TSS_Name_Type
:=
6083 Stream_Op
: Entity_Id
;
6086 -- Primitive operations of tagged types are frozen when the dispatch
6087 -- table is constructed.
6089 if not Comes_From_Source
(Typ
)
6090 or else Is_Tagged_Type
(Typ
)
6095 for J
in Names
'Range loop
6096 Stream_Op
:= TSS
(Typ
, Names
(J
));
6098 if Present
(Stream_Op
)
6099 and then Is_Subprogram
(Stream_Op
)
6100 and then Nkind
(Unit_Declaration_Node
(Stream_Op
)) =
6101 N_Subprogram_Declaration
6102 and then not Is_Frozen
(Stream_Op
)
6104 Append_Freeze_Actions
6105 (Typ
, Freeze_Entity
(Stream_Op
, Sloc
(N
)));
6108 end Freeze_Stream_Operations
;
6114 -- Full type declarations are expanded at the point at which the type is
6115 -- frozen. The formal N is the Freeze_Node for the type. Any statements or
6116 -- declarations generated by the freezing (e.g. the procedure generated
6117 -- for initialization) are chained in the Actions field list of the freeze
6118 -- node using Append_Freeze_Actions.
6120 function Freeze_Type
(N
: Node_Id
) return Boolean is
6121 Def_Id
: constant Entity_Id
:= Entity
(N
);
6122 RACW_Seen
: Boolean := False;
6123 Result
: Boolean := False;
6126 -- Process associated access types needing special processing
6128 if Present
(Access_Types_To_Process
(N
)) then
6130 E
: Elmt_Id
:= First_Elmt
(Access_Types_To_Process
(N
));
6132 while Present
(E
) loop
6134 if Is_Remote_Access_To_Class_Wide_Type
(Node
(E
)) then
6135 Validate_RACW_Primitives
(Node
(E
));
6145 -- If there are RACWs designating this type, make stubs now
6147 Remote_Types_Tagged_Full_View_Encountered
(Def_Id
);
6151 -- Freeze processing for record types
6153 if Is_Record_Type
(Def_Id
) then
6154 if Ekind
(Def_Id
) = E_Record_Type
then
6155 Expand_Freeze_Record_Type
(N
);
6157 -- The subtype may have been declared before the type was frozen. If
6158 -- the type has controlled components it is necessary to create the
6159 -- entity for the controller explicitly because it did not exist at
6160 -- the point of the subtype declaration. Only the entity is needed,
6161 -- the back-end will obtain the layout from the type. This is only
6162 -- necessary if this is constrained subtype whose component list is
6163 -- not shared with the base type.
6165 elsif Ekind
(Def_Id
) = E_Record_Subtype
6166 and then Has_Discriminants
(Def_Id
)
6167 and then Last_Entity
(Def_Id
) /= Last_Entity
(Base_Type
(Def_Id
))
6168 and then Present
(Controller_Component
(Def_Id
))
6171 Old_C
: constant Entity_Id
:= Controller_Component
(Def_Id
);
6175 if Scope
(Old_C
) = Base_Type
(Def_Id
) then
6177 -- The entity is the one in the parent. Create new one
6179 New_C
:= New_Copy
(Old_C
);
6180 Set_Parent
(New_C
, Parent
(Old_C
));
6181 Push_Scope
(Def_Id
);
6187 if Is_Itype
(Def_Id
)
6188 and then Is_Record_Type
(Underlying_Type
(Scope
(Def_Id
)))
6190 -- The freeze node is only used to introduce the controller,
6191 -- the back-end has no use for it for a discriminated
6194 Set_Freeze_Node
(Def_Id
, Empty
);
6195 Set_Has_Delayed_Freeze
(Def_Id
, False);
6199 -- Similar process if the controller of the subtype is not present
6200 -- but the parent has it. This can happen with constrained
6201 -- record components where the subtype is an itype.
6203 elsif Ekind
(Def_Id
) = E_Record_Subtype
6204 and then Is_Itype
(Def_Id
)
6205 and then No
(Controller_Component
(Def_Id
))
6206 and then Present
(Controller_Component
(Etype
(Def_Id
)))
6209 Old_C
: constant Entity_Id
:=
6210 Controller_Component
(Etype
(Def_Id
));
6211 New_C
: constant Entity_Id
:= New_Copy
(Old_C
);
6214 Set_Next_Entity
(New_C
, First_Entity
(Def_Id
));
6215 Set_First_Entity
(Def_Id
, New_C
);
6217 -- The freeze node is only used to introduce the controller,
6218 -- the back-end has no use for it for a discriminated
6221 Set_Freeze_Node
(Def_Id
, Empty
);
6222 Set_Has_Delayed_Freeze
(Def_Id
, False);
6227 -- Freeze processing for array types
6229 elsif Is_Array_Type
(Def_Id
) then
6230 Expand_Freeze_Array_Type
(N
);
6232 -- Freeze processing for access types
6234 -- For pool-specific access types, find out the pool object used for
6235 -- this type, needs actual expansion of it in some cases. Here are the
6236 -- different cases :
6238 -- 1. Rep Clause "for Def_Id'Storage_Size use 0;"
6239 -- ---> don't use any storage pool
6241 -- 2. Rep Clause : for Def_Id'Storage_Size use Expr.
6243 -- Def_Id__Pool : Stack_Bounded_Pool (Expr, DT'Size, DT'Alignment);
6245 -- 3. Rep Clause "for Def_Id'Storage_Pool use a_Pool_Object"
6246 -- ---> Storage Pool is the specified one
6248 -- See GNAT Pool packages in the Run-Time for more details
6250 elsif Ekind
(Def_Id
) = E_Access_Type
6251 or else Ekind
(Def_Id
) = E_General_Access_Type
6254 Loc
: constant Source_Ptr
:= Sloc
(N
);
6255 Desig_Type
: constant Entity_Id
:= Designated_Type
(Def_Id
);
6256 Pool_Object
: Entity_Id
;
6258 Freeze_Action_Typ
: Entity_Id
;
6263 -- Rep Clause "for Def_Id'Storage_Size use 0;"
6264 -- ---> don't use any storage pool
6266 if No_Pool_Assigned
(Def_Id
) then
6271 -- Rep Clause : for Def_Id'Storage_Size use Expr.
6273 -- Def_Id__Pool : Stack_Bounded_Pool
6274 -- (Expr, DT'Size, DT'Alignment);
6276 elsif Has_Storage_Size_Clause
(Def_Id
) then
6282 -- For unconstrained composite types we give a size of zero
6283 -- so that the pool knows that it needs a special algorithm
6284 -- for variable size object allocation.
6286 if Is_Composite_Type
(Desig_Type
)
6287 and then not Is_Constrained
(Desig_Type
)
6290 Make_Integer_Literal
(Loc
, 0);
6293 Make_Integer_Literal
(Loc
, Maximum_Alignment
);
6297 Make_Attribute_Reference
(Loc
,
6298 Prefix
=> New_Reference_To
(Desig_Type
, Loc
),
6299 Attribute_Name
=> Name_Max_Size_In_Storage_Elements
);
6302 Make_Attribute_Reference
(Loc
,
6303 Prefix
=> New_Reference_To
(Desig_Type
, Loc
),
6304 Attribute_Name
=> Name_Alignment
);
6308 Make_Defining_Identifier
(Loc
,
6309 Chars
=> New_External_Name
(Chars
(Def_Id
), 'P'));
6311 -- We put the code associated with the pools in the entity
6312 -- that has the later freeze node, usually the access type
6313 -- but it can also be the designated_type; because the pool
6314 -- code requires both those types to be frozen
6316 if Is_Frozen
(Desig_Type
)
6317 and then (No
(Freeze_Node
(Desig_Type
))
6318 or else Analyzed
(Freeze_Node
(Desig_Type
)))
6320 Freeze_Action_Typ
:= Def_Id
;
6322 -- A Taft amendment type cannot get the freeze actions
6323 -- since the full view is not there.
6325 elsif Is_Incomplete_Or_Private_Type
(Desig_Type
)
6326 and then No
(Full_View
(Desig_Type
))
6328 Freeze_Action_Typ
:= Def_Id
;
6331 Freeze_Action_Typ
:= Desig_Type
;
6334 Append_Freeze_Action
(Freeze_Action_Typ
,
6335 Make_Object_Declaration
(Loc
,
6336 Defining_Identifier
=> Pool_Object
,
6337 Object_Definition
=>
6338 Make_Subtype_Indication
(Loc
,
6341 (RTE
(RE_Stack_Bounded_Pool
), Loc
),
6344 Make_Index_Or_Discriminant_Constraint
(Loc
,
6345 Constraints
=> New_List
(
6347 -- First discriminant is the Pool Size
6350 Storage_Size_Variable
(Def_Id
), Loc
),
6352 -- Second discriminant is the element size
6356 -- Third discriminant is the alignment
6361 Set_Associated_Storage_Pool
(Def_Id
, Pool_Object
);
6365 -- Rep Clause "for Def_Id'Storage_Pool use a_Pool_Object"
6366 -- ---> Storage Pool is the specified one
6368 elsif Present
(Associated_Storage_Pool
(Def_Id
)) then
6370 -- Nothing to do the associated storage pool has been attached
6371 -- when analyzing the rep. clause
6376 -- For access-to-controlled types (including class-wide types and
6377 -- Taft-amendment types which potentially have controlled
6378 -- components), expand the list controller object that will store
6379 -- the dynamically allocated objects. Do not do this
6380 -- transformation for expander-generated access types, but do it
6381 -- for types that are the full view of types derived from other
6382 -- private types. Also suppress the list controller in the case
6383 -- of a designated type with convention Java, since this is used
6384 -- when binding to Java API specs, where there's no equivalent of
6385 -- a finalization list and we don't want to pull in the
6386 -- finalization support if not needed.
6388 if not Comes_From_Source
(Def_Id
)
6389 and then not Has_Private_Declaration
(Def_Id
)
6393 elsif (Needs_Finalization
(Desig_Type
)
6394 and then Convention
(Desig_Type
) /= Convention_Java
6395 and then Convention
(Desig_Type
) /= Convention_CIL
)
6397 (Is_Incomplete_Or_Private_Type
(Desig_Type
)
6398 and then No
(Full_View
(Desig_Type
))
6400 -- An exception is made for types defined in the run-time
6401 -- because Ada.Tags.Tag itself is such a type and cannot
6402 -- afford this unnecessary overhead that would generates a
6403 -- loop in the expansion scheme...
6405 and then not In_Runtime
(Def_Id
)
6407 -- Another exception is if Restrictions (No_Finalization)
6408 -- is active, since then we know nothing is controlled.
6410 and then not Restriction_Active
(No_Finalization
))
6412 -- If the designated type is not frozen yet, its controlled
6413 -- status must be retrieved explicitly.
6415 or else (Is_Array_Type
(Desig_Type
)
6416 and then not Is_Frozen
(Desig_Type
)
6417 and then Needs_Finalization
(Component_Type
(Desig_Type
)))
6419 -- The designated type has controlled anonymous access
6422 or else Has_Controlled_Coextensions
(Desig_Type
)
6424 Set_Associated_Final_Chain
(Def_Id
, Add_Final_Chain
(Def_Id
));
6428 -- Freeze processing for enumeration types
6430 elsif Ekind
(Def_Id
) = E_Enumeration_Type
then
6432 -- We only have something to do if we have a non-standard
6433 -- representation (i.e. at least one literal whose pos value
6434 -- is not the same as its representation)
6436 if Has_Non_Standard_Rep
(Def_Id
) then
6437 Expand_Freeze_Enumeration_Type
(N
);
6440 -- Private types that are completed by a derivation from a private
6441 -- type have an internally generated full view, that needs to be
6442 -- frozen. This must be done explicitly because the two views share
6443 -- the freeze node, and the underlying full view is not visible when
6444 -- the freeze node is analyzed.
6446 elsif Is_Private_Type
(Def_Id
)
6447 and then Is_Derived_Type
(Def_Id
)
6448 and then Present
(Full_View
(Def_Id
))
6449 and then Is_Itype
(Full_View
(Def_Id
))
6450 and then Has_Private_Declaration
(Full_View
(Def_Id
))
6451 and then Freeze_Node
(Full_View
(Def_Id
)) = N
6453 Set_Entity
(N
, Full_View
(Def_Id
));
6454 Result
:= Freeze_Type
(N
);
6455 Set_Entity
(N
, Def_Id
);
6457 -- All other types require no expander action. There are such cases
6458 -- (e.g. task types and protected types). In such cases, the freeze
6459 -- nodes are there for use by Gigi.
6463 Freeze_Stream_Operations
(N
, Def_Id
);
6467 when RE_Not_Available
=>
6471 -------------------------
6472 -- Get_Simple_Init_Val --
6473 -------------------------
6475 function Get_Simple_Init_Val
6478 Size
: Uint
:= No_Uint
) return Node_Id
6480 Loc
: constant Source_Ptr
:= Sloc
(N
);
6486 -- This is the size to be used for computation of the appropriate
6487 -- initial value for the Normalize_Scalars and Initialize_Scalars case.
6489 IV_Attribute
: constant Boolean :=
6490 Nkind
(N
) = N_Attribute_Reference
6491 and then Attribute_Name
(N
) = Name_Invalid_Value
;
6495 -- These are the values computed by the procedure Check_Subtype_Bounds
6497 procedure Check_Subtype_Bounds
;
6498 -- This procedure examines the subtype T, and its ancestor subtypes and
6499 -- derived types to determine the best known information about the
6500 -- bounds of the subtype. After the call Lo_Bound is set either to
6501 -- No_Uint if no information can be determined, or to a value which
6502 -- represents a known low bound, i.e. a valid value of the subtype can
6503 -- not be less than this value. Hi_Bound is similarly set to a known
6504 -- high bound (valid value cannot be greater than this).
6506 --------------------------
6507 -- Check_Subtype_Bounds --
6508 --------------------------
6510 procedure Check_Subtype_Bounds
is
6519 Lo_Bound
:= No_Uint
;
6520 Hi_Bound
:= No_Uint
;
6522 -- Loop to climb ancestor subtypes and derived types
6526 if not Is_Discrete_Type
(ST1
) then
6530 Lo
:= Type_Low_Bound
(ST1
);
6531 Hi
:= Type_High_Bound
(ST1
);
6533 if Compile_Time_Known_Value
(Lo
) then
6534 Loval
:= Expr_Value
(Lo
);
6536 if Lo_Bound
= No_Uint
or else Lo_Bound
< Loval
then
6541 if Compile_Time_Known_Value
(Hi
) then
6542 Hival
:= Expr_Value
(Hi
);
6544 if Hi_Bound
= No_Uint
or else Hi_Bound
> Hival
then
6549 ST2
:= Ancestor_Subtype
(ST1
);
6555 exit when ST1
= ST2
;
6558 end Check_Subtype_Bounds
;
6560 -- Start of processing for Get_Simple_Init_Val
6563 -- For a private type, we should always have an underlying type
6564 -- (because this was already checked in Needs_Simple_Initialization).
6565 -- What we do is to get the value for the underlying type and then do
6566 -- an Unchecked_Convert to the private type.
6568 if Is_Private_Type
(T
) then
6569 Val
:= Get_Simple_Init_Val
(Underlying_Type
(T
), N
, Size
);
6571 -- A special case, if the underlying value is null, then qualify it
6572 -- with the underlying type, so that the null is properly typed
6573 -- Similarly, if it is an aggregate it must be qualified, because an
6574 -- unchecked conversion does not provide a context for it.
6576 if Nkind_In
(Val
, N_Null
, N_Aggregate
) then
6578 Make_Qualified_Expression
(Loc
,
6580 New_Occurrence_Of
(Underlying_Type
(T
), Loc
),
6584 Result
:= Unchecked_Convert_To
(T
, Val
);
6586 -- Don't truncate result (important for Initialize/Normalize_Scalars)
6588 if Nkind
(Result
) = N_Unchecked_Type_Conversion
6589 and then Is_Scalar_Type
(Underlying_Type
(T
))
6591 Set_No_Truncation
(Result
);
6596 -- For scalars, we must have normalize/initialize scalars case, or
6597 -- if the node N is an 'Invalid_Value attribute node.
6599 elsif Is_Scalar_Type
(T
) then
6600 pragma Assert
(Init_Or_Norm_Scalars
or IV_Attribute
);
6602 -- Compute size of object. If it is given by the caller, we can use
6603 -- it directly, otherwise we use Esize (T) as an estimate. As far as
6604 -- we know this covers all cases correctly.
6606 if Size
= No_Uint
or else Size
<= Uint_0
then
6607 Size_To_Use
:= UI_Max
(Uint_1
, Esize
(T
));
6609 Size_To_Use
:= Size
;
6612 -- Maximum size to use is 64 bits, since we will create values
6613 -- of type Unsigned_64 and the range must fit this type.
6615 if Size_To_Use
/= No_Uint
and then Size_To_Use
> Uint_64
then
6616 Size_To_Use
:= Uint_64
;
6619 -- Check known bounds of subtype
6621 Check_Subtype_Bounds
;
6623 -- Processing for Normalize_Scalars case
6625 if Normalize_Scalars
and then not IV_Attribute
then
6627 -- If zero is invalid, it is a convenient value to use that is
6628 -- for sure an appropriate invalid value in all situations.
6630 if Lo_Bound
/= No_Uint
and then Lo_Bound
> Uint_0
then
6631 Val
:= Make_Integer_Literal
(Loc
, 0);
6633 -- Cases where all one bits is the appropriate invalid value
6635 -- For modular types, all 1 bits is either invalid or valid. If
6636 -- it is valid, then there is nothing that can be done since there
6637 -- are no invalid values (we ruled out zero already).
6639 -- For signed integer types that have no negative values, either
6640 -- there is room for negative values, or there is not. If there
6641 -- is, then all 1 bits may be interpreted as minus one, which is
6642 -- certainly invalid. Alternatively it is treated as the largest
6643 -- positive value, in which case the observation for modular types
6646 -- For float types, all 1-bits is a NaN (not a number), which is
6647 -- certainly an appropriately invalid value.
6649 elsif Is_Unsigned_Type
(T
)
6650 or else Is_Floating_Point_Type
(T
)
6651 or else Is_Enumeration_Type
(T
)
6653 Val
:= Make_Integer_Literal
(Loc
, 2 ** Size_To_Use
- 1);
6655 -- Resolve as Unsigned_64, because the largest number we
6656 -- can generate is out of range of universal integer.
6658 Analyze_And_Resolve
(Val
, RTE
(RE_Unsigned_64
));
6660 -- Case of signed types
6664 Signed_Size
: constant Uint
:=
6665 UI_Min
(Uint_63
, Size_To_Use
- 1);
6668 -- Normally we like to use the most negative number. The
6669 -- one exception is when this number is in the known
6670 -- subtype range and the largest positive number is not in
6671 -- the known subtype range.
6673 -- For this exceptional case, use largest positive value
6675 if Lo_Bound
/= No_Uint
and then Hi_Bound
/= No_Uint
6676 and then Lo_Bound
<= (-(2 ** Signed_Size
))
6677 and then Hi_Bound
< 2 ** Signed_Size
6679 Val
:= Make_Integer_Literal
(Loc
, 2 ** Signed_Size
- 1);
6681 -- Normal case of largest negative value
6684 Val
:= Make_Integer_Literal
(Loc
, -(2 ** Signed_Size
));
6689 -- Here for Initialize_Scalars case (or Invalid_Value attribute used)
6692 -- For float types, use float values from System.Scalar_Values
6694 if Is_Floating_Point_Type
(T
) then
6695 if Root_Type
(T
) = Standard_Short_Float
then
6696 Val_RE
:= RE_IS_Isf
;
6697 elsif Root_Type
(T
) = Standard_Float
then
6698 Val_RE
:= RE_IS_Ifl
;
6699 elsif Root_Type
(T
) = Standard_Long_Float
then
6700 Val_RE
:= RE_IS_Ilf
;
6701 else pragma Assert
(Root_Type
(T
) = Standard_Long_Long_Float
);
6702 Val_RE
:= RE_IS_Ill
;
6705 -- If zero is invalid, use zero values from System.Scalar_Values
6707 elsif Lo_Bound
/= No_Uint
and then Lo_Bound
> Uint_0
then
6708 if Size_To_Use
<= 8 then
6709 Val_RE
:= RE_IS_Iz1
;
6710 elsif Size_To_Use
<= 16 then
6711 Val_RE
:= RE_IS_Iz2
;
6712 elsif Size_To_Use
<= 32 then
6713 Val_RE
:= RE_IS_Iz4
;
6715 Val_RE
:= RE_IS_Iz8
;
6718 -- For unsigned, use unsigned values from System.Scalar_Values
6720 elsif Is_Unsigned_Type
(T
) then
6721 if Size_To_Use
<= 8 then
6722 Val_RE
:= RE_IS_Iu1
;
6723 elsif Size_To_Use
<= 16 then
6724 Val_RE
:= RE_IS_Iu2
;
6725 elsif Size_To_Use
<= 32 then
6726 Val_RE
:= RE_IS_Iu4
;
6728 Val_RE
:= RE_IS_Iu8
;
6731 -- For signed, use signed values from System.Scalar_Values
6734 if Size_To_Use
<= 8 then
6735 Val_RE
:= RE_IS_Is1
;
6736 elsif Size_To_Use
<= 16 then
6737 Val_RE
:= RE_IS_Is2
;
6738 elsif Size_To_Use
<= 32 then
6739 Val_RE
:= RE_IS_Is4
;
6741 Val_RE
:= RE_IS_Is8
;
6745 Val
:= New_Occurrence_Of
(RTE
(Val_RE
), Loc
);
6748 -- The final expression is obtained by doing an unchecked conversion
6749 -- of this result to the base type of the required subtype. We use
6750 -- the base type to avoid the unchecked conversion from chopping
6751 -- bits, and then we set Kill_Range_Check to preserve the "bad"
6754 Result
:= Unchecked_Convert_To
(Base_Type
(T
), Val
);
6756 -- Ensure result is not truncated, since we want the "bad" bits
6757 -- and also kill range check on result.
6759 if Nkind
(Result
) = N_Unchecked_Type_Conversion
then
6760 Set_No_Truncation
(Result
);
6761 Set_Kill_Range_Check
(Result
, True);
6766 -- String or Wide_[Wide]_String (must have Initialize_Scalars set)
6768 elsif Root_Type
(T
) = Standard_String
6770 Root_Type
(T
) = Standard_Wide_String
6772 Root_Type
(T
) = Standard_Wide_Wide_String
6774 pragma Assert
(Init_Or_Norm_Scalars
);
6777 Make_Aggregate
(Loc
,
6778 Component_Associations
=> New_List
(
6779 Make_Component_Association
(Loc
,
6780 Choices
=> New_List
(
6781 Make_Others_Choice
(Loc
)),
6784 (Component_Type
(T
), N
, Esize
(Root_Type
(T
))))));
6786 -- Access type is initialized to null
6788 elsif Is_Access_Type
(T
) then
6792 -- No other possibilities should arise, since we should only be
6793 -- calling Get_Simple_Init_Val if Needs_Simple_Initialization
6794 -- returned True, indicating one of the above cases held.
6797 raise Program_Error
;
6801 when RE_Not_Available
=>
6803 end Get_Simple_Init_Val
;
6805 ------------------------------
6806 -- Has_New_Non_Standard_Rep --
6807 ------------------------------
6809 function Has_New_Non_Standard_Rep
(T
: Entity_Id
) return Boolean is
6811 if not Is_Derived_Type
(T
) then
6812 return Has_Non_Standard_Rep
(T
)
6813 or else Has_Non_Standard_Rep
(Root_Type
(T
));
6815 -- If Has_Non_Standard_Rep is not set on the derived type, the
6816 -- representation is fully inherited.
6818 elsif not Has_Non_Standard_Rep
(T
) then
6822 return First_Rep_Item
(T
) /= First_Rep_Item
(Root_Type
(T
));
6824 -- May need a more precise check here: the First_Rep_Item may
6825 -- be a stream attribute, which does not affect the representation
6828 end Has_New_Non_Standard_Rep
;
6834 function In_Runtime
(E
: Entity_Id
) return Boolean is
6839 while Scope
(S1
) /= Standard_Standard
loop
6843 return Chars
(S1
) = Name_System
or else Chars
(S1
) = Name_Ada
;
6846 ----------------------------
6847 -- Initialization_Warning --
6848 ----------------------------
6850 procedure Initialization_Warning
(E
: Entity_Id
) is
6851 Warning_Needed
: Boolean;
6854 Warning_Needed
:= False;
6856 if Ekind
(Current_Scope
) = E_Package
6857 and then Static_Elaboration_Desired
(Current_Scope
)
6860 if Is_Record_Type
(E
) then
6861 if Has_Discriminants
(E
)
6862 or else Is_Limited_Type
(E
)
6863 or else Has_Non_Standard_Rep
(E
)
6865 Warning_Needed
:= True;
6868 -- Verify that at least one component has an initialization
6869 -- expression. No need for a warning on a type if all its
6870 -- components have no initialization.
6876 Comp
:= First_Component
(E
);
6877 while Present
(Comp
) loop
6878 if Ekind
(Comp
) = E_Discriminant
6880 (Nkind
(Parent
(Comp
)) = N_Component_Declaration
6881 and then Present
(Expression
(Parent
(Comp
))))
6883 Warning_Needed
:= True;
6887 Next_Component
(Comp
);
6892 if Warning_Needed
then
6894 ("Objects of the type cannot be initialized " &
6895 "statically by default?",
6901 Error_Msg_N
("Object cannot be initialized statically?", E
);
6904 end Initialization_Warning
;
6910 function Init_Formals
(Typ
: Entity_Id
) return List_Id
is
6911 Loc
: constant Source_Ptr
:= Sloc
(Typ
);
6915 -- First parameter is always _Init : in out typ. Note that we need
6916 -- this to be in/out because in the case of the task record value,
6917 -- there are default record fields (_Priority, _Size, -Task_Info)
6918 -- that may be referenced in the generated initialization routine.
6920 Formals
:= New_List
(
6921 Make_Parameter_Specification
(Loc
,
6922 Defining_Identifier
=>
6923 Make_Defining_Identifier
(Loc
, Name_uInit
),
6925 Out_Present
=> True,
6926 Parameter_Type
=> New_Reference_To
(Typ
, Loc
)));
6928 -- For task record value, or type that contains tasks, add two more
6929 -- formals, _Master : Master_Id and _Chain : in out Activation_Chain
6930 -- We also add these parameters for the task record type case.
6933 or else (Is_Record_Type
(Typ
) and then Is_Task_Record_Type
(Typ
))
6936 Make_Parameter_Specification
(Loc
,
6937 Defining_Identifier
=>
6938 Make_Defining_Identifier
(Loc
, Name_uMaster
),
6939 Parameter_Type
=> New_Reference_To
(RTE
(RE_Master_Id
), Loc
)));
6942 Make_Parameter_Specification
(Loc
,
6943 Defining_Identifier
=>
6944 Make_Defining_Identifier
(Loc
, Name_uChain
),
6946 Out_Present
=> True,
6948 New_Reference_To
(RTE
(RE_Activation_Chain
), Loc
)));
6951 Make_Parameter_Specification
(Loc
,
6952 Defining_Identifier
=>
6953 Make_Defining_Identifier
(Loc
, Name_uTask_Name
),
6956 New_Reference_To
(Standard_String
, Loc
)));
6962 when RE_Not_Available
=>
6966 -------------------------
6967 -- Init_Secondary_Tags --
6968 -------------------------
6970 procedure Init_Secondary_Tags
6973 Stmts_List
: List_Id
;
6974 Fixed_Comps
: Boolean := True;
6975 Variable_Comps
: Boolean := True)
6977 Loc
: constant Source_Ptr
:= Sloc
(Target
);
6979 procedure Inherit_CPP_Tag
6982 Tag_Comp
: Entity_Id
;
6983 Iface_Tag
: Node_Id
);
6984 -- Inherit the C++ tag of the secondary dispatch table of Typ associated
6985 -- with Iface. Tag_Comp is the component of Typ that stores Iface_Tag.
6987 procedure Initialize_Tag
6990 Tag_Comp
: Entity_Id
;
6991 Iface_Tag
: Node_Id
);
6992 -- Initialize the tag of the secondary dispatch table of Typ associated
6993 -- with Iface. Tag_Comp is the component of Typ that stores Iface_Tag.
6994 -- Compiling under the CPP full ABI compatibility mode, if the ancestor
6995 -- of Typ CPP tagged type we generate code to inherit the contents of
6996 -- the dispatch table directly from the ancestor.
6998 ---------------------
6999 -- Inherit_CPP_Tag --
7000 ---------------------
7002 procedure Inherit_CPP_Tag
7005 Tag_Comp
: Entity_Id
;
7006 Iface_Tag
: Node_Id
)
7009 pragma Assert
(Is_CPP_Class
(Etype
(Typ
)));
7011 Append_To
(Stmts_List
,
7012 Build_Inherit_Prims
(Loc
,
7015 Make_Selected_Component
(Loc
,
7016 Prefix
=> New_Copy_Tree
(Target
),
7017 Selector_Name
=> New_Reference_To
(Tag_Comp
, Loc
)),
7019 New_Reference_To
(Iface_Tag
, Loc
),
7021 UI_To_Int
(DT_Entry_Count
(First_Tag_Component
(Iface
)))));
7022 end Inherit_CPP_Tag
;
7024 --------------------
7025 -- Initialize_Tag --
7026 --------------------
7028 procedure Initialize_Tag
7031 Tag_Comp
: Entity_Id
;
7032 Iface_Tag
: Node_Id
)
7034 Comp_Typ
: Entity_Id
;
7035 Offset_To_Top_Comp
: Entity_Id
:= Empty
;
7038 -- Initialize the pointer to the secondary DT associated with the
7041 if not Is_Ancestor
(Iface
, Typ
) then
7042 Append_To
(Stmts_List
,
7043 Make_Assignment_Statement
(Loc
,
7045 Make_Selected_Component
(Loc
,
7046 Prefix
=> New_Copy_Tree
(Target
),
7047 Selector_Name
=> New_Reference_To
(Tag_Comp
, Loc
)),
7049 New_Reference_To
(Iface_Tag
, Loc
)));
7052 Comp_Typ
:= Scope
(Tag_Comp
);
7054 -- Initialize the entries of the table of interfaces. We generate a
7055 -- different call when the parent of the type has variable size
7058 if Comp_Typ
/= Etype
(Comp_Typ
)
7059 and then Is_Variable_Size_Record
(Etype
(Comp_Typ
))
7060 and then Chars
(Tag_Comp
) /= Name_uTag
7062 pragma Assert
(Present
(DT_Offset_To_Top_Func
(Tag_Comp
)));
7064 -- Issue error if Set_Dynamic_Offset_To_Top is not available in a
7065 -- configurable run-time environment.
7067 if not RTE_Available
(RE_Set_Dynamic_Offset_To_Top
) then
7069 ("variable size record with interface types", Typ
);
7074 -- Set_Dynamic_Offset_To_Top
7076 -- Interface_T => Iface'Tag,
7077 -- Offset_Value => n,
7078 -- Offset_Func => Fn'Address)
7080 Append_To
(Stmts_List
,
7081 Make_Procedure_Call_Statement
(Loc
,
7082 Name
=> New_Reference_To
7083 (RTE
(RE_Set_Dynamic_Offset_To_Top
), Loc
),
7084 Parameter_Associations
=> New_List
(
7085 Make_Attribute_Reference
(Loc
,
7086 Prefix
=> New_Copy_Tree
(Target
),
7087 Attribute_Name
=> Name_Address
),
7089 Unchecked_Convert_To
(RTE
(RE_Tag
),
7091 (Node
(First_Elmt
(Access_Disp_Table
(Iface
))),
7094 Unchecked_Convert_To
7095 (RTE
(RE_Storage_Offset
),
7096 Make_Attribute_Reference
(Loc
,
7098 Make_Selected_Component
(Loc
,
7099 Prefix
=> New_Copy_Tree
(Target
),
7101 New_Reference_To
(Tag_Comp
, Loc
)),
7102 Attribute_Name
=> Name_Position
)),
7104 Unchecked_Convert_To
(RTE
(RE_Offset_To_Top_Function_Ptr
),
7105 Make_Attribute_Reference
(Loc
,
7106 Prefix
=> New_Reference_To
7107 (DT_Offset_To_Top_Func
(Tag_Comp
), Loc
),
7108 Attribute_Name
=> Name_Address
)))));
7110 -- In this case the next component stores the value of the
7111 -- offset to the top.
7113 Offset_To_Top_Comp
:= Next_Entity
(Tag_Comp
);
7114 pragma Assert
(Present
(Offset_To_Top_Comp
));
7116 Append_To
(Stmts_List
,
7117 Make_Assignment_Statement
(Loc
,
7119 Make_Selected_Component
(Loc
,
7120 Prefix
=> New_Copy_Tree
(Target
),
7121 Selector_Name
=> New_Reference_To
7122 (Offset_To_Top_Comp
, Loc
)),
7124 Make_Attribute_Reference
(Loc
,
7126 Make_Selected_Component
(Loc
,
7127 Prefix
=> New_Copy_Tree
(Target
),
7129 New_Reference_To
(Tag_Comp
, Loc
)),
7130 Attribute_Name
=> Name_Position
)));
7132 -- Normal case: No discriminants in the parent type
7135 -- Don't need to set any value if this interface shares
7136 -- the primary dispatch table.
7138 if not Is_Ancestor
(Iface
, Typ
) then
7139 Append_To
(Stmts_List
,
7140 Build_Set_Static_Offset_To_Top
(Loc
,
7141 Iface_Tag
=> New_Reference_To
(Iface_Tag
, Loc
),
7143 Unchecked_Convert_To
(RTE
(RE_Storage_Offset
),
7144 Make_Attribute_Reference
(Loc
,
7146 Make_Selected_Component
(Loc
,
7147 Prefix
=> New_Copy_Tree
(Target
),
7149 New_Reference_To
(Tag_Comp
, Loc
)),
7150 Attribute_Name
=> Name_Position
))));
7154 -- Register_Interface_Offset
7156 -- Interface_T => Iface'Tag,
7157 -- Is_Constant => True,
7158 -- Offset_Value => n,
7159 -- Offset_Func => null);
7161 if RTE_Available
(RE_Register_Interface_Offset
) then
7162 Append_To
(Stmts_List
,
7163 Make_Procedure_Call_Statement
(Loc
,
7164 Name
=> New_Reference_To
7165 (RTE
(RE_Register_Interface_Offset
), Loc
),
7166 Parameter_Associations
=> New_List
(
7167 Make_Attribute_Reference
(Loc
,
7168 Prefix
=> New_Copy_Tree
(Target
),
7169 Attribute_Name
=> Name_Address
),
7171 Unchecked_Convert_To
(RTE
(RE_Tag
),
7173 (Node
(First_Elmt
(Access_Disp_Table
(Iface
))), Loc
)),
7175 New_Occurrence_Of
(Standard_True
, Loc
),
7177 Unchecked_Convert_To
7178 (RTE
(RE_Storage_Offset
),
7179 Make_Attribute_Reference
(Loc
,
7181 Make_Selected_Component
(Loc
,
7182 Prefix
=> New_Copy_Tree
(Target
),
7184 New_Reference_To
(Tag_Comp
, Loc
)),
7185 Attribute_Name
=> Name_Position
)),
7194 Full_Typ
: Entity_Id
;
7195 Ifaces_List
: Elist_Id
;
7196 Ifaces_Comp_List
: Elist_Id
;
7197 Ifaces_Tag_List
: Elist_Id
;
7198 Iface_Elmt
: Elmt_Id
;
7199 Iface_Comp_Elmt
: Elmt_Id
;
7200 Iface_Tag_Elmt
: Elmt_Id
;
7202 In_Variable_Pos
: Boolean;
7204 -- Start of processing for Init_Secondary_Tags
7207 -- Handle private types
7209 if Present
(Full_View
(Typ
)) then
7210 Full_Typ
:= Full_View
(Typ
);
7215 Collect_Interfaces_Info
7216 (Full_Typ
, Ifaces_List
, Ifaces_Comp_List
, Ifaces_Tag_List
);
7218 Iface_Elmt
:= First_Elmt
(Ifaces_List
);
7219 Iface_Comp_Elmt
:= First_Elmt
(Ifaces_Comp_List
);
7220 Iface_Tag_Elmt
:= First_Elmt
(Ifaces_Tag_List
);
7221 while Present
(Iface_Elmt
) loop
7222 Tag_Comp
:= Node
(Iface_Comp_Elmt
);
7224 -- If we are compiling under the CPP full ABI compatibility mode and
7225 -- the ancestor is a CPP_Pragma tagged type then we generate code to
7226 -- inherit the contents of the dispatch table directly from the
7229 if Is_CPP_Class
(Etype
(Full_Typ
)) then
7230 Inherit_CPP_Tag
(Full_Typ
,
7231 Iface
=> Node
(Iface_Elmt
),
7232 Tag_Comp
=> Tag_Comp
,
7233 Iface_Tag
=> Node
(Iface_Tag_Elmt
));
7235 -- Otherwise generate code to initialize the tag
7238 -- Check if the parent of the record type has variable size
7241 In_Variable_Pos
:= Scope
(Tag_Comp
) /= Etype
(Scope
(Tag_Comp
))
7242 and then Is_Variable_Size_Record
(Etype
(Scope
(Tag_Comp
)));
7244 if (In_Variable_Pos
and then Variable_Comps
)
7245 or else (not In_Variable_Pos
and then Fixed_Comps
)
7247 Initialize_Tag
(Full_Typ
,
7248 Iface
=> Node
(Iface_Elmt
),
7249 Tag_Comp
=> Tag_Comp
,
7250 Iface_Tag
=> Node
(Iface_Tag_Elmt
));
7254 Next_Elmt
(Iface_Elmt
);
7255 Next_Elmt
(Iface_Comp_Elmt
);
7256 Next_Elmt
(Iface_Tag_Elmt
);
7258 end Init_Secondary_Tags
;
7260 -----------------------------
7261 -- Is_Variable_Size_Record --
7262 -----------------------------
7264 function Is_Variable_Size_Record
(E
: Entity_Id
) return Boolean is
7266 Comp_Typ
: Entity_Id
;
7269 function Is_Constant_Bound
(Exp
: Node_Id
) return Boolean;
7270 -- To simplify handling of array components. Determines whether the
7271 -- given bound is constant (a constant or enumeration literal, or an
7272 -- integer literal) as opposed to per-object, through an expression
7273 -- or a discriminant.
7275 -----------------------
7276 -- Is_Constant_Bound --
7277 -----------------------
7279 function Is_Constant_Bound
(Exp
: Node_Id
) return Boolean is
7281 if Nkind
(Exp
) = N_Integer_Literal
then
7285 Is_Entity_Name
(Exp
)
7286 and then Present
(Entity
(Exp
))
7288 (Ekind
(Entity
(Exp
)) = E_Constant
7289 or else Ekind
(Entity
(Exp
)) = E_Enumeration_Literal
);
7291 end Is_Constant_Bound
;
7293 -- Start of processing for Is_Variable_Sized_Record
7296 pragma Assert
(Is_Record_Type
(E
));
7298 Comp
:= First_Entity
(E
);
7299 while Present
(Comp
) loop
7300 Comp_Typ
:= Etype
(Comp
);
7302 if Is_Record_Type
(Comp_Typ
) then
7304 -- Recursive call if the record type has discriminants
7306 if Has_Discriminants
(Comp_Typ
)
7307 and then Is_Variable_Size_Record
(Comp_Typ
)
7312 elsif Is_Array_Type
(Comp_Typ
) then
7314 -- Check if some index is initialized with a non-constant value
7316 Idx
:= First_Index
(Comp_Typ
);
7317 while Present
(Idx
) loop
7318 if Nkind
(Idx
) = N_Range
then
7319 if not Is_Constant_Bound
(Low_Bound
(Idx
))
7321 not Is_Constant_Bound
(High_Bound
(Idx
))
7327 Idx
:= Next_Index
(Idx
);
7335 end Is_Variable_Size_Record
;
7337 ----------------------------------------
7338 -- Make_Controlling_Function_Wrappers --
7339 ----------------------------------------
7341 procedure Make_Controlling_Function_Wrappers
7342 (Tag_Typ
: Entity_Id
;
7343 Decl_List
: out List_Id
;
7344 Body_List
: out List_Id
)
7346 Loc
: constant Source_Ptr
:= Sloc
(Tag_Typ
);
7347 Prim_Elmt
: Elmt_Id
;
7349 Actual_List
: List_Id
;
7350 Formal_List
: List_Id
;
7352 Par_Formal
: Entity_Id
;
7353 Formal_Node
: Node_Id
;
7354 Func_Body
: Node_Id
;
7355 Func_Decl
: Node_Id
;
7356 Func_Spec
: Node_Id
;
7357 Return_Stmt
: Node_Id
;
7360 Decl_List
:= New_List
;
7361 Body_List
:= New_List
;
7363 Prim_Elmt
:= First_Elmt
(Primitive_Operations
(Tag_Typ
));
7365 while Present
(Prim_Elmt
) loop
7366 Subp
:= Node
(Prim_Elmt
);
7368 -- If a primitive function with a controlling result of the type has
7369 -- not been overridden by the user, then we must create a wrapper
7370 -- function here that effectively overrides it and invokes the
7371 -- (non-abstract) parent function. This can only occur for a null
7372 -- extension. Note that functions with anonymous controlling access
7373 -- results don't qualify and must be overridden. We also exclude
7374 -- Input attributes, since each type will have its own version of
7375 -- Input constructed by the expander. The test for Comes_From_Source
7376 -- is needed to distinguish inherited operations from renamings
7377 -- (which also have Alias set).
7379 -- The function may be abstract, or require_Overriding may be set
7380 -- for it, because tests for null extensions may already have reset
7381 -- the Is_Abstract_Subprogram_Flag. If Requires_Overriding is not
7382 -- set, functions that need wrappers are recognized by having an
7383 -- alias that returns the parent type.
7385 if Comes_From_Source
(Subp
)
7386 or else No
(Alias
(Subp
))
7387 or else Ekind
(Subp
) /= E_Function
7388 or else not Has_Controlling_Result
(Subp
)
7389 or else Is_Access_Type
(Etype
(Subp
))
7390 or else Is_Abstract_Subprogram
(Alias
(Subp
))
7391 or else Is_TSS
(Subp
, TSS_Stream_Input
)
7395 elsif Is_Abstract_Subprogram
(Subp
)
7396 or else Requires_Overriding
(Subp
)
7398 (Is_Null_Extension
(Etype
(Subp
))
7399 and then Etype
(Alias
(Subp
)) /= Etype
(Subp
))
7401 Formal_List
:= No_List
;
7402 Formal
:= First_Formal
(Subp
);
7404 if Present
(Formal
) then
7405 Formal_List
:= New_List
;
7407 while Present
(Formal
) loop
7409 (Make_Parameter_Specification
7411 Defining_Identifier
=>
7412 Make_Defining_Identifier
(Sloc
(Formal
),
7413 Chars
=> Chars
(Formal
)),
7414 In_Present
=> In_Present
(Parent
(Formal
)),
7415 Out_Present
=> Out_Present
(Parent
(Formal
)),
7416 Null_Exclusion_Present
=>
7417 Null_Exclusion_Present
(Parent
(Formal
)),
7419 New_Reference_To
(Etype
(Formal
), Loc
),
7421 New_Copy_Tree
(Expression
(Parent
(Formal
)))),
7424 Next_Formal
(Formal
);
7429 Make_Function_Specification
(Loc
,
7430 Defining_Unit_Name
=>
7431 Make_Defining_Identifier
(Loc
,
7432 Chars
=> Chars
(Subp
)),
7433 Parameter_Specifications
=> Formal_List
,
7434 Result_Definition
=>
7435 New_Reference_To
(Etype
(Subp
), Loc
));
7437 Func_Decl
:= Make_Subprogram_Declaration
(Loc
, Func_Spec
);
7438 Append_To
(Decl_List
, Func_Decl
);
7440 -- Build a wrapper body that calls the parent function. The body
7441 -- contains a single return statement that returns an extension
7442 -- aggregate whose ancestor part is a call to the parent function,
7443 -- passing the formals as actuals (with any controlling arguments
7444 -- converted to the types of the corresponding formals of the
7445 -- parent function, which might be anonymous access types), and
7446 -- having a null extension.
7448 Formal
:= First_Formal
(Subp
);
7449 Par_Formal
:= First_Formal
(Alias
(Subp
));
7450 Formal_Node
:= First
(Formal_List
);
7452 if Present
(Formal
) then
7453 Actual_List
:= New_List
;
7455 Actual_List
:= No_List
;
7458 while Present
(Formal
) loop
7459 if Is_Controlling_Formal
(Formal
) then
7460 Append_To
(Actual_List
,
7461 Make_Type_Conversion
(Loc
,
7463 New_Occurrence_Of
(Etype
(Par_Formal
), Loc
),
7466 (Defining_Identifier
(Formal_Node
), Loc
)));
7471 (Defining_Identifier
(Formal_Node
), Loc
));
7474 Next_Formal
(Formal
);
7475 Next_Formal
(Par_Formal
);
7480 Make_Simple_Return_Statement
(Loc
,
7482 Make_Extension_Aggregate
(Loc
,
7484 Make_Function_Call
(Loc
,
7485 Name
=> New_Reference_To
(Alias
(Subp
), Loc
),
7486 Parameter_Associations
=> Actual_List
),
7487 Null_Record_Present
=> True));
7490 Make_Subprogram_Body
(Loc
,
7491 Specification
=> New_Copy_Tree
(Func_Spec
),
7492 Declarations
=> Empty_List
,
7493 Handled_Statement_Sequence
=>
7494 Make_Handled_Sequence_Of_Statements
(Loc
,
7495 Statements
=> New_List
(Return_Stmt
)));
7497 Set_Defining_Unit_Name
7498 (Specification
(Func_Body
),
7499 Make_Defining_Identifier
(Loc
, Chars
(Subp
)));
7501 Append_To
(Body_List
, Func_Body
);
7503 -- Replace the inherited function with the wrapper function
7504 -- in the primitive operations list.
7506 Override_Dispatching_Operation
7507 (Tag_Typ
, Subp
, New_Op
=> Defining_Unit_Name
(Func_Spec
));
7511 Next_Elmt
(Prim_Elmt
);
7513 end Make_Controlling_Function_Wrappers
;
7519 -- <Make_Eq_If shared components>
7521 -- when V1 => <Make_Eq_Case> on subcomponents
7523 -- when Vn => <Make_Eq_Case> on subcomponents
7526 function Make_Eq_Case
7529 Discr
: Entity_Id
:= Empty
) return List_Id
7531 Loc
: constant Source_Ptr
:= Sloc
(E
);
7532 Result
: constant List_Id
:= New_List
;
7537 Append_To
(Result
, Make_Eq_If
(E
, Component_Items
(CL
)));
7539 if No
(Variant_Part
(CL
)) then
7543 Variant
:= First_Non_Pragma
(Variants
(Variant_Part
(CL
)));
7545 if No
(Variant
) then
7549 Alt_List
:= New_List
;
7551 while Present
(Variant
) loop
7552 Append_To
(Alt_List
,
7553 Make_Case_Statement_Alternative
(Loc
,
7554 Discrete_Choices
=> New_Copy_List
(Discrete_Choices
(Variant
)),
7555 Statements
=> Make_Eq_Case
(E
, Component_List
(Variant
))));
7557 Next_Non_Pragma
(Variant
);
7560 -- If we have an Unchecked_Union, use one of the parameters that
7561 -- captures the discriminants.
7563 if Is_Unchecked_Union
(E
) then
7565 Make_Case_Statement
(Loc
,
7566 Expression
=> New_Reference_To
(Discr
, Loc
),
7567 Alternatives
=> Alt_List
));
7571 Make_Case_Statement
(Loc
,
7573 Make_Selected_Component
(Loc
,
7574 Prefix
=> Make_Identifier
(Loc
, Name_X
),
7575 Selector_Name
=> New_Copy
(Name
(Variant_Part
(CL
)))),
7576 Alternatives
=> Alt_List
));
7597 -- or a null statement if the list L is empty
7601 L
: List_Id
) return Node_Id
7603 Loc
: constant Source_Ptr
:= Sloc
(E
);
7605 Field_Name
: Name_Id
;
7610 return Make_Null_Statement
(Loc
);
7615 C
:= First_Non_Pragma
(L
);
7616 while Present
(C
) loop
7617 Field_Name
:= Chars
(Defining_Identifier
(C
));
7619 -- The tags must not be compared: they are not part of the value.
7620 -- Ditto for the controller component, if present.
7622 -- Note also that in the following, we use Make_Identifier for
7623 -- the component names. Use of New_Reference_To to identify the
7624 -- components would be incorrect because the wrong entities for
7625 -- discriminants could be picked up in the private type case.
7627 if Field_Name
/= Name_uTag
7629 Field_Name
/= Name_uController
7631 Evolve_Or_Else
(Cond
,
7634 Make_Selected_Component
(Loc
,
7635 Prefix
=> Make_Identifier
(Loc
, Name_X
),
7637 Make_Identifier
(Loc
, Field_Name
)),
7640 Make_Selected_Component
(Loc
,
7641 Prefix
=> Make_Identifier
(Loc
, Name_Y
),
7643 Make_Identifier
(Loc
, Field_Name
))));
7646 Next_Non_Pragma
(C
);
7650 return Make_Null_Statement
(Loc
);
7654 Make_Implicit_If_Statement
(E
,
7656 Then_Statements
=> New_List
(
7657 Make_Simple_Return_Statement
(Loc
,
7658 Expression
=> New_Occurrence_Of
(Standard_False
, Loc
))));
7663 -------------------------------
7664 -- Make_Null_Procedure_Specs --
7665 -------------------------------
7667 procedure Make_Null_Procedure_Specs
7668 (Tag_Typ
: Entity_Id
;
7669 Decl_List
: out List_Id
)
7671 Loc
: constant Source_Ptr
:= Sloc
(Tag_Typ
);
7674 Formal_List
: List_Id
;
7675 New_Param_Spec
: Node_Id
;
7676 Parent_Subp
: Entity_Id
;
7677 Prim_Elmt
: Elmt_Id
;
7678 Proc_Decl
: Node_Id
;
7681 function Is_Null_Interface_Primitive
(E
: Entity_Id
) return Boolean;
7682 -- Returns True if E is a null procedure that is an interface primitive
7684 ---------------------------------
7685 -- Is_Null_Interface_Primitive --
7686 ---------------------------------
7688 function Is_Null_Interface_Primitive
(E
: Entity_Id
) return Boolean is
7690 return Comes_From_Source
(E
)
7691 and then Is_Dispatching_Operation
(E
)
7692 and then Ekind
(E
) = E_Procedure
7693 and then Null_Present
(Parent
(E
))
7694 and then Is_Interface
(Find_Dispatching_Type
(E
));
7695 end Is_Null_Interface_Primitive
;
7697 -- Start of processing for Make_Null_Procedure_Specs
7700 Decl_List
:= New_List
;
7701 Prim_Elmt
:= First_Elmt
(Primitive_Operations
(Tag_Typ
));
7702 while Present
(Prim_Elmt
) loop
7703 Subp
:= Node
(Prim_Elmt
);
7705 -- If a null procedure inherited from an interface has not been
7706 -- overridden, then we build a null procedure declaration to
7707 -- override the inherited procedure.
7709 Parent_Subp
:= Alias
(Subp
);
7711 if Present
(Parent_Subp
)
7712 and then Is_Null_Interface_Primitive
(Parent_Subp
)
7714 Formal_List
:= No_List
;
7715 Formal
:= First_Formal
(Subp
);
7717 if Present
(Formal
) then
7718 Formal_List
:= New_List
;
7720 while Present
(Formal
) loop
7722 -- Copy the parameter spec including default expressions
7725 New_Copy_Tree
(Parent
(Formal
), New_Sloc
=> Loc
);
7727 -- Generate a new defining identifier for the new formal.
7728 -- required because New_Copy_Tree does not duplicate
7729 -- semantic fields (except itypes).
7731 Set_Defining_Identifier
(New_Param_Spec
,
7732 Make_Defining_Identifier
(Sloc
(Formal
),
7733 Chars
=> Chars
(Formal
)));
7735 -- For controlling arguments we must change their
7736 -- parameter type to reference the tagged type (instead
7737 -- of the interface type)
7739 if Is_Controlling_Formal
(Formal
) then
7740 if Nkind
(Parameter_Type
(Parent
(Formal
)))
7743 Set_Parameter_Type
(New_Param_Spec
,
7744 New_Occurrence_Of
(Tag_Typ
, Loc
));
7747 (Nkind
(Parameter_Type
(Parent
(Formal
)))
7748 = N_Access_Definition
);
7749 Set_Subtype_Mark
(Parameter_Type
(New_Param_Spec
),
7750 New_Occurrence_Of
(Tag_Typ
, Loc
));
7754 Append
(New_Param_Spec
, Formal_List
);
7756 Next_Formal
(Formal
);
7761 Make_Subprogram_Declaration
(Loc
,
7762 Make_Procedure_Specification
(Loc
,
7763 Defining_Unit_Name
=>
7764 Make_Defining_Identifier
(Loc
, Chars
(Subp
)),
7765 Parameter_Specifications
=> Formal_List
,
7766 Null_Present
=> True));
7767 Append_To
(Decl_List
, Proc_Decl
);
7768 Analyze
(Proc_Decl
);
7771 Next_Elmt
(Prim_Elmt
);
7773 end Make_Null_Procedure_Specs
;
7775 -------------------------------------
7776 -- Make_Predefined_Primitive_Specs --
7777 -------------------------------------
7779 procedure Make_Predefined_Primitive_Specs
7780 (Tag_Typ
: Entity_Id
;
7781 Predef_List
: out List_Id
;
7782 Renamed_Eq
: out Entity_Id
)
7784 Loc
: constant Source_Ptr
:= Sloc
(Tag_Typ
);
7785 Res
: constant List_Id
:= New_List
;
7787 Eq_Needed
: Boolean;
7789 Eq_Name
: Name_Id
:= Name_Op_Eq
;
7791 function Is_Predefined_Eq_Renaming
(Prim
: Node_Id
) return Boolean;
7792 -- Returns true if Prim is a renaming of an unresolved predefined
7793 -- equality operation.
7795 -------------------------------
7796 -- Is_Predefined_Eq_Renaming --
7797 -------------------------------
7799 function Is_Predefined_Eq_Renaming
(Prim
: Node_Id
) return Boolean is
7801 return Chars
(Prim
) /= Name_Op_Eq
7802 and then Present
(Alias
(Prim
))
7803 and then Comes_From_Source
(Prim
)
7804 and then Is_Intrinsic_Subprogram
(Alias
(Prim
))
7805 and then Chars
(Alias
(Prim
)) = Name_Op_Eq
;
7806 end Is_Predefined_Eq_Renaming
;
7808 -- Start of processing for Make_Predefined_Primitive_Specs
7811 Renamed_Eq
:= Empty
;
7815 Append_To
(Res
, Predef_Spec_Or_Body
(Loc
,
7818 Profile
=> New_List
(
7819 Make_Parameter_Specification
(Loc
,
7820 Defining_Identifier
=> Make_Defining_Identifier
(Loc
, Name_X
),
7821 Parameter_Type
=> New_Reference_To
(Tag_Typ
, Loc
))),
7823 Ret_Type
=> Standard_Long_Long_Integer
));
7825 -- Spec of _Alignment
7827 Append_To
(Res
, Predef_Spec_Or_Body
(Loc
,
7829 Name
=> Name_uAlignment
,
7830 Profile
=> New_List
(
7831 Make_Parameter_Specification
(Loc
,
7832 Defining_Identifier
=> Make_Defining_Identifier
(Loc
, Name_X
),
7833 Parameter_Type
=> New_Reference_To
(Tag_Typ
, Loc
))),
7835 Ret_Type
=> Standard_Integer
));
7837 -- Specs for dispatching stream attributes
7840 Stream_Op_TSS_Names
:
7841 constant array (Integer range <>) of TSS_Name_Type
:=
7848 for Op
in Stream_Op_TSS_Names
'Range loop
7849 if Stream_Operation_OK
(Tag_Typ
, Stream_Op_TSS_Names
(Op
)) then
7851 Predef_Stream_Attr_Spec
(Loc
, Tag_Typ
,
7852 Stream_Op_TSS_Names
(Op
)));
7857 -- Spec of "=" is expanded if the type is not limited and if a
7858 -- user defined "=" was not already declared for the non-full
7859 -- view of a private extension
7861 if not Is_Limited_Type
(Tag_Typ
) then
7863 Prim
:= First_Elmt
(Primitive_Operations
(Tag_Typ
));
7864 while Present
(Prim
) loop
7866 -- If a primitive is encountered that renames the predefined
7867 -- equality operator before reaching any explicit equality
7868 -- primitive, then we still need to create a predefined
7869 -- equality function, because calls to it can occur via
7870 -- the renaming. A new name is created for the equality
7871 -- to avoid conflicting with any user-defined equality.
7872 -- (Note that this doesn't account for renamings of
7873 -- equality nested within subpackages???)
7875 if Is_Predefined_Eq_Renaming
(Node
(Prim
)) then
7876 Eq_Name
:= New_External_Name
(Chars
(Node
(Prim
)), 'E');
7878 -- User-defined equality
7880 elsif Chars
(Node
(Prim
)) = Name_Op_Eq
7881 and then Etype
(First_Formal
(Node
(Prim
))) =
7882 Etype
(Next_Formal
(First_Formal
(Node
(Prim
))))
7883 and then Base_Type
(Etype
(Node
(Prim
))) = Standard_Boolean
7885 if No
(Alias
(Node
(Prim
)))
7886 or else Nkind
(Unit_Declaration_Node
(Node
(Prim
))) =
7887 N_Subprogram_Renaming_Declaration
7892 -- If the parent is not an interface type and has an abstract
7893 -- equality function, the inherited equality is abstract as
7894 -- well, and no body can be created for it.
7896 elsif not Is_Interface
(Etype
(Tag_Typ
))
7897 and then Present
(Alias
(Node
(Prim
)))
7898 and then Is_Abstract_Subprogram
(Alias
(Node
(Prim
)))
7903 -- If the type has an equality function corresponding with
7904 -- a primitive defined in an interface type, the inherited
7905 -- equality is abstract as well, and no body can be created
7908 elsif Present
(Alias
(Node
(Prim
)))
7909 and then Comes_From_Source
(Ultimate_Alias
(Node
(Prim
)))
7912 (Find_Dispatching_Type
(Ultimate_Alias
(Node
(Prim
))))
7922 -- If a renaming of predefined equality was found but there was no
7923 -- user-defined equality (so Eq_Needed is still true), then set the
7924 -- name back to Name_Op_Eq. But in the case where a user-defined
7925 -- equality was located after such a renaming, then the predefined
7926 -- equality function is still needed, so Eq_Needed must be set back
7929 if Eq_Name
/= Name_Op_Eq
then
7931 Eq_Name
:= Name_Op_Eq
;
7938 Eq_Spec
:= Predef_Spec_Or_Body
(Loc
,
7941 Profile
=> New_List
(
7942 Make_Parameter_Specification
(Loc
,
7943 Defining_Identifier
=>
7944 Make_Defining_Identifier
(Loc
, Name_X
),
7945 Parameter_Type
=> New_Reference_To
(Tag_Typ
, Loc
)),
7946 Make_Parameter_Specification
(Loc
,
7947 Defining_Identifier
=>
7948 Make_Defining_Identifier
(Loc
, Name_Y
),
7949 Parameter_Type
=> New_Reference_To
(Tag_Typ
, Loc
))),
7950 Ret_Type
=> Standard_Boolean
);
7951 Append_To
(Res
, Eq_Spec
);
7953 if Eq_Name
/= Name_Op_Eq
then
7954 Renamed_Eq
:= Defining_Unit_Name
(Specification
(Eq_Spec
));
7956 Prim
:= First_Elmt
(Primitive_Operations
(Tag_Typ
));
7957 while Present
(Prim
) loop
7959 -- Any renamings of equality that appeared before an
7960 -- overriding equality must be updated to refer to the
7961 -- entity for the predefined equality, otherwise calls via
7962 -- the renaming would get incorrectly resolved to call the
7963 -- user-defined equality function.
7965 if Is_Predefined_Eq_Renaming
(Node
(Prim
)) then
7966 Set_Alias
(Node
(Prim
), Renamed_Eq
);
7968 -- Exit upon encountering a user-defined equality
7970 elsif Chars
(Node
(Prim
)) = Name_Op_Eq
7971 and then No
(Alias
(Node
(Prim
)))
7981 -- Spec for dispatching assignment
7983 Append_To
(Res
, Predef_Spec_Or_Body
(Loc
,
7985 Name
=> Name_uAssign
,
7986 Profile
=> New_List
(
7987 Make_Parameter_Specification
(Loc
,
7988 Defining_Identifier
=> Make_Defining_Identifier
(Loc
, Name_X
),
7989 Out_Present
=> True,
7990 Parameter_Type
=> New_Reference_To
(Tag_Typ
, Loc
)),
7992 Make_Parameter_Specification
(Loc
,
7993 Defining_Identifier
=> Make_Defining_Identifier
(Loc
, Name_Y
),
7994 Parameter_Type
=> New_Reference_To
(Tag_Typ
, Loc
)))));
7997 -- Ada 2005: Generate declarations for the following primitive
7998 -- operations for limited interfaces and synchronized types that
7999 -- implement a limited interface.
8001 -- Disp_Asynchronous_Select
8002 -- Disp_Conditional_Select
8003 -- Disp_Get_Prim_Op_Kind
8006 -- Disp_Timed_Select
8008 -- These operations cannot be implemented on VM targets, so we simply
8009 -- disable their generation in this case. Disable the generation of
8010 -- these bodies if No_Dispatching_Calls, Ravenscar or ZFP is active.
8012 if Ada_Version
>= Ada_05
8013 and then Tagged_Type_Expansion
8014 and then not Restriction_Active
(No_Dispatching_Calls
)
8015 and then not Restriction_Active
(No_Select_Statements
)
8016 and then RTE_Available
(RE_Select_Specific_Data
)
8018 -- These primitives are defined abstract in interface types
8020 if Is_Interface
(Tag_Typ
)
8021 and then Is_Limited_Record
(Tag_Typ
)
8024 Make_Abstract_Subprogram_Declaration
(Loc
,
8026 Make_Disp_Asynchronous_Select_Spec
(Tag_Typ
)));
8029 Make_Abstract_Subprogram_Declaration
(Loc
,
8031 Make_Disp_Conditional_Select_Spec
(Tag_Typ
)));
8034 Make_Abstract_Subprogram_Declaration
(Loc
,
8036 Make_Disp_Get_Prim_Op_Kind_Spec
(Tag_Typ
)));
8039 Make_Abstract_Subprogram_Declaration
(Loc
,
8041 Make_Disp_Get_Task_Id_Spec
(Tag_Typ
)));
8044 Make_Abstract_Subprogram_Declaration
(Loc
,
8046 Make_Disp_Requeue_Spec
(Tag_Typ
)));
8049 Make_Abstract_Subprogram_Declaration
(Loc
,
8051 Make_Disp_Timed_Select_Spec
(Tag_Typ
)));
8053 -- If the ancestor is an interface type we declare non-abstract
8054 -- primitives to override the abstract primitives of the interface
8057 elsif (not Is_Interface
(Tag_Typ
)
8058 and then Is_Interface
(Etype
(Tag_Typ
))
8059 and then Is_Limited_Record
(Etype
(Tag_Typ
)))
8061 (Is_Concurrent_Record_Type
(Tag_Typ
)
8062 and then Has_Interfaces
(Tag_Typ
))
8065 Make_Subprogram_Declaration
(Loc
,
8067 Make_Disp_Asynchronous_Select_Spec
(Tag_Typ
)));
8070 Make_Subprogram_Declaration
(Loc
,
8072 Make_Disp_Conditional_Select_Spec
(Tag_Typ
)));
8075 Make_Subprogram_Declaration
(Loc
,
8077 Make_Disp_Get_Prim_Op_Kind_Spec
(Tag_Typ
)));
8080 Make_Subprogram_Declaration
(Loc
,
8082 Make_Disp_Get_Task_Id_Spec
(Tag_Typ
)));
8085 Make_Subprogram_Declaration
(Loc
,
8087 Make_Disp_Requeue_Spec
(Tag_Typ
)));
8090 Make_Subprogram_Declaration
(Loc
,
8092 Make_Disp_Timed_Select_Spec
(Tag_Typ
)));
8096 -- Specs for finalization actions that may be required in case a future
8097 -- extension contain a controlled element. We generate those only for
8098 -- root tagged types where they will get dummy bodies or when the type
8099 -- has controlled components and their body must be generated. It is
8100 -- also impossible to provide those for tagged types defined within
8101 -- s-finimp since it would involve circularity problems
8103 if In_Finalization_Root
(Tag_Typ
) then
8106 -- We also skip these if finalization is not available
8108 elsif Restriction_Active
(No_Finalization
) then
8111 -- Skip these for CIL Value types, where finalization is not available
8113 elsif Is_Value_Type
(Tag_Typ
) then
8116 elsif Etype
(Tag_Typ
) = Tag_Typ
8117 or else Needs_Finalization
(Tag_Typ
)
8119 -- Ada 2005 (AI-251): We must also generate these subprograms if
8120 -- the immediate ancestor is an interface to ensure the correct
8121 -- initialization of its dispatch table.
8123 or else (not Is_Interface
(Tag_Typ
)
8124 and then Is_Interface
(Etype
(Tag_Typ
)))
8126 -- Ada 205 (AI-251): We must also generate these subprograms if
8127 -- the parent of an nonlimited interface is a limited interface
8129 or else (Is_Interface
(Tag_Typ
)
8130 and then not Is_Limited_Interface
(Tag_Typ
)
8131 and then Is_Limited_Interface
(Etype
(Tag_Typ
)))
8133 if not Is_Limited_Type
(Tag_Typ
) then
8135 Predef_Deep_Spec
(Loc
, Tag_Typ
, TSS_Deep_Adjust
));
8138 Append_To
(Res
, Predef_Deep_Spec
(Loc
, Tag_Typ
, TSS_Deep_Finalize
));
8142 end Make_Predefined_Primitive_Specs
;
8144 ---------------------------------
8145 -- Needs_Simple_Initialization --
8146 ---------------------------------
8148 function Needs_Simple_Initialization
(T
: Entity_Id
) return Boolean is
8150 -- Check for private type, in which case test applies to the underlying
8151 -- type of the private type.
8153 if Is_Private_Type
(T
) then
8155 RT
: constant Entity_Id
:= Underlying_Type
(T
);
8158 if Present
(RT
) then
8159 return Needs_Simple_Initialization
(RT
);
8165 -- Cases needing simple initialization are access types, and, if pragma
8166 -- Normalize_Scalars or Initialize_Scalars is in effect, then all scalar
8169 elsif Is_Access_Type
(T
)
8170 or else (Init_Or_Norm_Scalars
and then (Is_Scalar_Type
(T
)))
8174 -- If Initialize/Normalize_Scalars is in effect, string objects also
8175 -- need initialization, unless they are created in the course of
8176 -- expanding an aggregate (since in the latter case they will be
8177 -- filled with appropriate initializing values before they are used).
8179 elsif Init_Or_Norm_Scalars
8181 (Root_Type
(T
) = Standard_String
8182 or else Root_Type
(T
) = Standard_Wide_String
8183 or else Root_Type
(T
) = Standard_Wide_Wide_String
)
8186 or else Nkind
(Associated_Node_For_Itype
(T
)) /= N_Aggregate
)
8193 end Needs_Simple_Initialization
;
8195 ----------------------
8196 -- Predef_Deep_Spec --
8197 ----------------------
8199 function Predef_Deep_Spec
8201 Tag_Typ
: Entity_Id
;
8202 Name
: TSS_Name_Type
;
8203 For_Body
: Boolean := False) return Node_Id
8209 if Name
= TSS_Deep_Finalize
then
8211 Type_B
:= Standard_Boolean
;
8215 Make_Parameter_Specification
(Loc
,
8216 Defining_Identifier
=> Make_Defining_Identifier
(Loc
, Name_L
),
8218 Out_Present
=> True,
8220 New_Reference_To
(RTE
(RE_Finalizable_Ptr
), Loc
)));
8221 Type_B
:= Standard_Short_Short_Integer
;
8225 Make_Parameter_Specification
(Loc
,
8226 Defining_Identifier
=> Make_Defining_Identifier
(Loc
, Name_V
),
8228 Out_Present
=> True,
8229 Parameter_Type
=> New_Reference_To
(Tag_Typ
, Loc
)));
8232 Make_Parameter_Specification
(Loc
,
8233 Defining_Identifier
=> Make_Defining_Identifier
(Loc
, Name_B
),
8234 Parameter_Type
=> New_Reference_To
(Type_B
, Loc
)));
8236 return Predef_Spec_Or_Body
(Loc
,
8237 Name
=> Make_TSS_Name
(Tag_Typ
, Name
),
8240 For_Body
=> For_Body
);
8243 when RE_Not_Available
=>
8245 end Predef_Deep_Spec
;
8247 -------------------------
8248 -- Predef_Spec_Or_Body --
8249 -------------------------
8251 function Predef_Spec_Or_Body
8253 Tag_Typ
: Entity_Id
;
8256 Ret_Type
: Entity_Id
:= Empty
;
8257 For_Body
: Boolean := False) return Node_Id
8259 Id
: constant Entity_Id
:= Make_Defining_Identifier
(Loc
, Name
);
8263 Set_Is_Public
(Id
, Is_Public
(Tag_Typ
));
8265 -- The internal flag is set to mark these declarations because they have
8266 -- specific properties. First, they are primitives even if they are not
8267 -- defined in the type scope (the freezing point is not necessarily in
8268 -- the same scope). Second, the predefined equality can be overridden by
8269 -- a user-defined equality, no body will be generated in this case.
8271 Set_Is_Internal
(Id
);
8273 if not Debug_Generated_Code
then
8274 Set_Debug_Info_Off
(Id
);
8277 if No
(Ret_Type
) then
8279 Make_Procedure_Specification
(Loc
,
8280 Defining_Unit_Name
=> Id
,
8281 Parameter_Specifications
=> Profile
);
8284 Make_Function_Specification
(Loc
,
8285 Defining_Unit_Name
=> Id
,
8286 Parameter_Specifications
=> Profile
,
8287 Result_Definition
=>
8288 New_Reference_To
(Ret_Type
, Loc
));
8291 if Is_Interface
(Tag_Typ
) then
8292 return Make_Abstract_Subprogram_Declaration
(Loc
, Spec
);
8294 -- If body case, return empty subprogram body. Note that this is ill-
8295 -- formed, because there is not even a null statement, and certainly not
8296 -- a return in the function case. The caller is expected to do surgery
8297 -- on the body to add the appropriate stuff.
8300 return Make_Subprogram_Body
(Loc
, Spec
, Empty_List
, Empty
);
8302 -- For the case of an Input attribute predefined for an abstract type,
8303 -- generate an abstract specification. This will never be called, but we
8304 -- need the slot allocated in the dispatching table so that attributes
8305 -- typ'Class'Input and typ'Class'Output will work properly.
8307 elsif Is_TSS
(Name
, TSS_Stream_Input
)
8308 and then Is_Abstract_Type
(Tag_Typ
)
8310 return Make_Abstract_Subprogram_Declaration
(Loc
, Spec
);
8312 -- Normal spec case, where we return a subprogram declaration
8315 return Make_Subprogram_Declaration
(Loc
, Spec
);
8317 end Predef_Spec_Or_Body
;
8319 -----------------------------
8320 -- Predef_Stream_Attr_Spec --
8321 -----------------------------
8323 function Predef_Stream_Attr_Spec
8325 Tag_Typ
: Entity_Id
;
8326 Name
: TSS_Name_Type
;
8327 For_Body
: Boolean := False) return Node_Id
8329 Ret_Type
: Entity_Id
;
8332 if Name
= TSS_Stream_Input
then
8333 Ret_Type
:= Tag_Typ
;
8338 return Predef_Spec_Or_Body
(Loc
,
8339 Name
=> Make_TSS_Name
(Tag_Typ
, Name
),
8341 Profile
=> Build_Stream_Attr_Profile
(Loc
, Tag_Typ
, Name
),
8342 Ret_Type
=> Ret_Type
,
8343 For_Body
=> For_Body
);
8344 end Predef_Stream_Attr_Spec
;
8346 ---------------------------------
8347 -- Predefined_Primitive_Bodies --
8348 ---------------------------------
8350 function Predefined_Primitive_Bodies
8351 (Tag_Typ
: Entity_Id
;
8352 Renamed_Eq
: Entity_Id
) return List_Id
8354 Loc
: constant Source_Ptr
:= Sloc
(Tag_Typ
);
8355 Res
: constant List_Id
:= New_List
;
8358 Eq_Needed
: Boolean;
8362 pragma Warnings
(Off
, Ent
);
8365 pragma Assert
(not Is_Interface
(Tag_Typ
));
8367 -- See if we have a predefined "=" operator
8369 if Present
(Renamed_Eq
) then
8371 Eq_Name
:= Chars
(Renamed_Eq
);
8373 -- If the parent is an interface type then it has defined all the
8374 -- predefined primitives abstract and we need to check if the type
8375 -- has some user defined "=" function to avoid generating it.
8377 elsif Is_Interface
(Etype
(Tag_Typ
)) then
8379 Eq_Name
:= Name_Op_Eq
;
8381 Prim
:= First_Elmt
(Primitive_Operations
(Tag_Typ
));
8382 while Present
(Prim
) loop
8383 if Chars
(Node
(Prim
)) = Name_Op_Eq
8384 and then not Is_Internal
(Node
(Prim
))
8398 Prim
:= First_Elmt
(Primitive_Operations
(Tag_Typ
));
8399 while Present
(Prim
) loop
8400 if Chars
(Node
(Prim
)) = Name_Op_Eq
8401 and then Is_Internal
(Node
(Prim
))
8404 Eq_Name
:= Name_Op_Eq
;
8412 -- Body of _Alignment
8414 Decl
:= Predef_Spec_Or_Body
(Loc
,
8416 Name
=> Name_uAlignment
,
8417 Profile
=> New_List
(
8418 Make_Parameter_Specification
(Loc
,
8419 Defining_Identifier
=> Make_Defining_Identifier
(Loc
, Name_X
),
8420 Parameter_Type
=> New_Reference_To
(Tag_Typ
, Loc
))),
8422 Ret_Type
=> Standard_Integer
,
8425 Set_Handled_Statement_Sequence
(Decl
,
8426 Make_Handled_Sequence_Of_Statements
(Loc
, New_List
(
8427 Make_Simple_Return_Statement
(Loc
,
8429 Make_Attribute_Reference
(Loc
,
8430 Prefix
=> Make_Identifier
(Loc
, Name_X
),
8431 Attribute_Name
=> Name_Alignment
)))));
8433 Append_To
(Res
, Decl
);
8437 Decl
:= Predef_Spec_Or_Body
(Loc
,
8440 Profile
=> New_List
(
8441 Make_Parameter_Specification
(Loc
,
8442 Defining_Identifier
=> Make_Defining_Identifier
(Loc
, Name_X
),
8443 Parameter_Type
=> New_Reference_To
(Tag_Typ
, Loc
))),
8445 Ret_Type
=> Standard_Long_Long_Integer
,
8448 Set_Handled_Statement_Sequence
(Decl
,
8449 Make_Handled_Sequence_Of_Statements
(Loc
, New_List
(
8450 Make_Simple_Return_Statement
(Loc
,
8452 Make_Attribute_Reference
(Loc
,
8453 Prefix
=> Make_Identifier
(Loc
, Name_X
),
8454 Attribute_Name
=> Name_Size
)))));
8456 Append_To
(Res
, Decl
);
8458 -- Bodies for Dispatching stream IO routines. We need these only for
8459 -- non-limited types (in the limited case there is no dispatching).
8460 -- We also skip them if dispatching or finalization are not available.
8462 if Stream_Operation_OK
(Tag_Typ
, TSS_Stream_Read
)
8463 and then No
(TSS
(Tag_Typ
, TSS_Stream_Read
))
8465 Build_Record_Read_Procedure
(Loc
, Tag_Typ
, Decl
, Ent
);
8466 Append_To
(Res
, Decl
);
8469 if Stream_Operation_OK
(Tag_Typ
, TSS_Stream_Write
)
8470 and then No
(TSS
(Tag_Typ
, TSS_Stream_Write
))
8472 Build_Record_Write_Procedure
(Loc
, Tag_Typ
, Decl
, Ent
);
8473 Append_To
(Res
, Decl
);
8476 -- Skip body of _Input for the abstract case, since the corresponding
8477 -- spec is abstract (see Predef_Spec_Or_Body).
8479 if not Is_Abstract_Type
(Tag_Typ
)
8480 and then Stream_Operation_OK
(Tag_Typ
, TSS_Stream_Input
)
8481 and then No
(TSS
(Tag_Typ
, TSS_Stream_Input
))
8483 Build_Record_Or_Elementary_Input_Function
8484 (Loc
, Tag_Typ
, Decl
, Ent
);
8485 Append_To
(Res
, Decl
);
8488 if Stream_Operation_OK
(Tag_Typ
, TSS_Stream_Output
)
8489 and then No
(TSS
(Tag_Typ
, TSS_Stream_Output
))
8491 Build_Record_Or_Elementary_Output_Procedure
8492 (Loc
, Tag_Typ
, Decl
, Ent
);
8493 Append_To
(Res
, Decl
);
8496 -- Ada 2005: Generate bodies for the following primitive operations for
8497 -- limited interfaces and synchronized types that implement a limited
8500 -- disp_asynchronous_select
8501 -- disp_conditional_select
8502 -- disp_get_prim_op_kind
8504 -- disp_timed_select
8506 -- The interface versions will have null bodies
8508 -- These operations cannot be implemented on VM targets, so we simply
8509 -- disable their generation in this case. Disable the generation of
8510 -- these bodies if No_Dispatching_Calls, Ravenscar or ZFP is active.
8512 if Ada_Version
>= Ada_05
8513 and then Tagged_Type_Expansion
8514 and then not Is_Interface
(Tag_Typ
)
8516 ((Is_Interface
(Etype
(Tag_Typ
))
8517 and then Is_Limited_Record
(Etype
(Tag_Typ
)))
8518 or else (Is_Concurrent_Record_Type
(Tag_Typ
)
8519 and then Has_Interfaces
(Tag_Typ
)))
8520 and then not Restriction_Active
(No_Dispatching_Calls
)
8521 and then not Restriction_Active
(No_Select_Statements
)
8522 and then RTE_Available
(RE_Select_Specific_Data
)
8524 Append_To
(Res
, Make_Disp_Asynchronous_Select_Body
(Tag_Typ
));
8525 Append_To
(Res
, Make_Disp_Conditional_Select_Body
(Tag_Typ
));
8526 Append_To
(Res
, Make_Disp_Get_Prim_Op_Kind_Body
(Tag_Typ
));
8527 Append_To
(Res
, Make_Disp_Get_Task_Id_Body
(Tag_Typ
));
8528 Append_To
(Res
, Make_Disp_Requeue_Body
(Tag_Typ
));
8529 Append_To
(Res
, Make_Disp_Timed_Select_Body
(Tag_Typ
));
8532 if not Is_Limited_Type
(Tag_Typ
)
8533 and then not Is_Interface
(Tag_Typ
)
8535 -- Body for equality
8539 Predef_Spec_Or_Body
(Loc
,
8542 Profile
=> New_List
(
8543 Make_Parameter_Specification
(Loc
,
8544 Defining_Identifier
=>
8545 Make_Defining_Identifier
(Loc
, Name_X
),
8546 Parameter_Type
=> New_Reference_To
(Tag_Typ
, Loc
)),
8548 Make_Parameter_Specification
(Loc
,
8549 Defining_Identifier
=>
8550 Make_Defining_Identifier
(Loc
, Name_Y
),
8551 Parameter_Type
=> New_Reference_To
(Tag_Typ
, Loc
))),
8553 Ret_Type
=> Standard_Boolean
,
8557 Def
: constant Node_Id
:= Parent
(Tag_Typ
);
8558 Stmts
: constant List_Id
:= New_List
;
8559 Variant_Case
: Boolean := Has_Discriminants
(Tag_Typ
);
8560 Comps
: Node_Id
:= Empty
;
8561 Typ_Def
: Node_Id
:= Type_Definition
(Def
);
8564 if Variant_Case
then
8565 if Nkind
(Typ_Def
) = N_Derived_Type_Definition
then
8566 Typ_Def
:= Record_Extension_Part
(Typ_Def
);
8569 if Present
(Typ_Def
) then
8570 Comps
:= Component_List
(Typ_Def
);
8573 Variant_Case
:= Present
(Comps
)
8574 and then Present
(Variant_Part
(Comps
));
8577 if Variant_Case
then
8579 Make_Eq_If
(Tag_Typ
, Discriminant_Specifications
(Def
)));
8580 Append_List_To
(Stmts
, Make_Eq_Case
(Tag_Typ
, Comps
));
8582 Make_Simple_Return_Statement
(Loc
,
8583 Expression
=> New_Reference_To
(Standard_True
, Loc
)));
8587 Make_Simple_Return_Statement
(Loc
,
8589 Expand_Record_Equality
(Tag_Typ
,
8591 Lhs
=> Make_Identifier
(Loc
, Name_X
),
8592 Rhs
=> Make_Identifier
(Loc
, Name_Y
),
8593 Bodies
=> Declarations
(Decl
))));
8596 Set_Handled_Statement_Sequence
(Decl
,
8597 Make_Handled_Sequence_Of_Statements
(Loc
, Stmts
));
8599 Append_To
(Res
, Decl
);
8602 -- Body for dispatching assignment
8605 Predef_Spec_Or_Body
(Loc
,
8607 Name
=> Name_uAssign
,
8608 Profile
=> New_List
(
8609 Make_Parameter_Specification
(Loc
,
8610 Defining_Identifier
=> Make_Defining_Identifier
(Loc
, Name_X
),
8611 Out_Present
=> True,
8612 Parameter_Type
=> New_Reference_To
(Tag_Typ
, Loc
)),
8614 Make_Parameter_Specification
(Loc
,
8615 Defining_Identifier
=> Make_Defining_Identifier
(Loc
, Name_Y
),
8616 Parameter_Type
=> New_Reference_To
(Tag_Typ
, Loc
))),
8619 Set_Handled_Statement_Sequence
(Decl
,
8620 Make_Handled_Sequence_Of_Statements
(Loc
, New_List
(
8621 Make_Assignment_Statement
(Loc
,
8622 Name
=> Make_Identifier
(Loc
, Name_X
),
8623 Expression
=> Make_Identifier
(Loc
, Name_Y
)))));
8625 Append_To
(Res
, Decl
);
8628 -- Generate dummy bodies for finalization actions of types that have
8629 -- no controlled components.
8631 -- Skip this processing if we are in the finalization routine in the
8632 -- runtime itself, otherwise we get hopelessly circularly confused!
8634 if In_Finalization_Root
(Tag_Typ
) then
8637 -- Skip this if finalization is not available
8639 elsif Restriction_Active
(No_Finalization
) then
8642 elsif (Etype
(Tag_Typ
) = Tag_Typ
8643 or else Is_Controlled
(Tag_Typ
)
8645 -- Ada 2005 (AI-251): We must also generate these subprograms
8646 -- if the immediate ancestor of Tag_Typ is an interface to
8647 -- ensure the correct initialization of its dispatch table.
8649 or else (not Is_Interface
(Tag_Typ
)
8651 Is_Interface
(Etype
(Tag_Typ
))))
8652 and then not Has_Controlled_Component
(Tag_Typ
)
8654 if not Is_Limited_Type
(Tag_Typ
) then
8655 Decl
:= Predef_Deep_Spec
(Loc
, Tag_Typ
, TSS_Deep_Adjust
, True);
8657 if Is_Controlled
(Tag_Typ
) then
8658 Set_Handled_Statement_Sequence
(Decl
,
8659 Make_Handled_Sequence_Of_Statements
(Loc
,
8661 Ref
=> Make_Identifier
(Loc
, Name_V
),
8663 Flist_Ref
=> Make_Identifier
(Loc
, Name_L
),
8664 With_Attach
=> Make_Identifier
(Loc
, Name_B
))));
8667 Set_Handled_Statement_Sequence
(Decl
,
8668 Make_Handled_Sequence_Of_Statements
(Loc
, New_List
(
8669 Make_Null_Statement
(Loc
))));
8672 Append_To
(Res
, Decl
);
8675 Decl
:= Predef_Deep_Spec
(Loc
, Tag_Typ
, TSS_Deep_Finalize
, True);
8677 if Is_Controlled
(Tag_Typ
) then
8678 Set_Handled_Statement_Sequence
(Decl
,
8679 Make_Handled_Sequence_Of_Statements
(Loc
,
8681 Ref
=> Make_Identifier
(Loc
, Name_V
),
8683 With_Detach
=> Make_Identifier
(Loc
, Name_B
))));
8686 Set_Handled_Statement_Sequence
(Decl
,
8687 Make_Handled_Sequence_Of_Statements
(Loc
, New_List
(
8688 Make_Null_Statement
(Loc
))));
8691 Append_To
(Res
, Decl
);
8695 end Predefined_Primitive_Bodies
;
8697 ---------------------------------
8698 -- Predefined_Primitive_Freeze --
8699 ---------------------------------
8701 function Predefined_Primitive_Freeze
8702 (Tag_Typ
: Entity_Id
) return List_Id
8704 Loc
: constant Source_Ptr
:= Sloc
(Tag_Typ
);
8705 Res
: constant List_Id
:= New_List
;
8710 Prim
:= First_Elmt
(Primitive_Operations
(Tag_Typ
));
8711 while Present
(Prim
) loop
8712 if Is_Predefined_Dispatching_Operation
(Node
(Prim
)) then
8713 Frnodes
:= Freeze_Entity
(Node
(Prim
), Loc
);
8715 if Present
(Frnodes
) then
8716 Append_List_To
(Res
, Frnodes
);
8724 end Predefined_Primitive_Freeze
;
8726 -------------------------
8727 -- Stream_Operation_OK --
8728 -------------------------
8730 function Stream_Operation_OK
8732 Operation
: TSS_Name_Type
) return Boolean
8734 Has_Predefined_Or_Specified_Stream_Attribute
: Boolean := False;
8737 -- Special case of a limited type extension: a default implementation
8738 -- of the stream attributes Read or Write exists if that attribute
8739 -- has been specified or is available for an ancestor type; a default
8740 -- implementation of the attribute Output (resp. Input) exists if the
8741 -- attribute has been specified or Write (resp. Read) is available for
8742 -- an ancestor type. The last condition only applies under Ada 2005.
8744 if Is_Limited_Type
(Typ
)
8745 and then Is_Tagged_Type
(Typ
)
8747 if Operation
= TSS_Stream_Read
then
8748 Has_Predefined_Or_Specified_Stream_Attribute
:=
8749 Has_Specified_Stream_Read
(Typ
);
8751 elsif Operation
= TSS_Stream_Write
then
8752 Has_Predefined_Or_Specified_Stream_Attribute
:=
8753 Has_Specified_Stream_Write
(Typ
);
8755 elsif Operation
= TSS_Stream_Input
then
8756 Has_Predefined_Or_Specified_Stream_Attribute
:=
8757 Has_Specified_Stream_Input
(Typ
)
8759 (Ada_Version
>= Ada_05
8760 and then Stream_Operation_OK
(Typ
, TSS_Stream_Read
));
8762 elsif Operation
= TSS_Stream_Output
then
8763 Has_Predefined_Or_Specified_Stream_Attribute
:=
8764 Has_Specified_Stream_Output
(Typ
)
8766 (Ada_Version
>= Ada_05
8767 and then Stream_Operation_OK
(Typ
, TSS_Stream_Write
));
8770 -- Case of inherited TSS_Stream_Read or TSS_Stream_Write
8772 if not Has_Predefined_Or_Specified_Stream_Attribute
8773 and then Is_Derived_Type
(Typ
)
8774 and then (Operation
= TSS_Stream_Read
8775 or else Operation
= TSS_Stream_Write
)
8777 Has_Predefined_Or_Specified_Stream_Attribute
:=
8779 (Find_Inherited_TSS
(Base_Type
(Etype
(Typ
)), Operation
));
8783 -- If the type is not limited, or else is limited but the attribute is
8784 -- explicitly specified or is predefined for the type, then return True,
8785 -- unless other conditions prevail, such as restrictions prohibiting
8786 -- streams or dispatching operations. We also return True for limited
8787 -- interfaces, because they may be extended by nonlimited types and
8788 -- permit inheritance in this case (addresses cases where an abstract
8789 -- extension doesn't get 'Input declared, as per comments below, but
8790 -- 'Class'Input must still be allowed). Note that attempts to apply
8791 -- stream attributes to a limited interface or its class-wide type
8792 -- (or limited extensions thereof) will still get properly rejected
8793 -- by Check_Stream_Attribute.
8795 -- We exclude the Input operation from being a predefined subprogram in
8796 -- the case where the associated type is an abstract extension, because
8797 -- the attribute is not callable in that case, per 13.13.2(49/2). Also,
8798 -- we don't want an abstract version created because types derived from
8799 -- the abstract type may not even have Input available (for example if
8800 -- derived from a private view of the abstract type that doesn't have
8801 -- a visible Input), but a VM such as .NET or the Java VM can treat the
8802 -- operation as inherited anyway, and we don't want an abstract function
8803 -- to be (implicitly) inherited in that case because it can lead to a VM
8806 return (not Is_Limited_Type
(Typ
)
8807 or else Is_Interface
(Typ
)
8808 or else Has_Predefined_Or_Specified_Stream_Attribute
)
8809 and then (Operation
/= TSS_Stream_Input
8810 or else not Is_Abstract_Type
(Typ
)
8811 or else not Is_Derived_Type
(Typ
))
8812 and then not Has_Unknown_Discriminants
(Typ
)
8813 and then not (Is_Interface
(Typ
)
8814 and then (Is_Task_Interface
(Typ
)
8815 or else Is_Protected_Interface
(Typ
)
8816 or else Is_Synchronized_Interface
(Typ
)))
8817 and then not Restriction_Active
(No_Streams
)
8818 and then not Restriction_Active
(No_Dispatch
)
8819 and then not No_Run_Time_Mode
8820 and then RTE_Available
(RE_Tag
)
8821 and then RTE_Available
(RE_Root_Stream_Type
);
8822 end Stream_Operation_OK
;