1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2008, 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_Ch8; use Sem_Ch8;
57 with Sem_Disp; use Sem_Disp;
58 with Sem_Eval; use Sem_Eval;
59 with Sem_Mech; use Sem_Mech;
60 with Sem_Res; use Sem_Res;
61 with Sem_Type; use Sem_Type;
62 with Sem_Util; use Sem_Util;
63 with Sinfo; use Sinfo;
64 with Stand; use Stand;
65 with Snames; use Snames;
66 with Targparm; use Targparm;
67 with Tbuild; use Tbuild;
68 with Ttypes; use Ttypes;
69 with Validsw; use Validsw;
71 package body Exp_Ch3 is
73 -----------------------
74 -- Local Subprograms --
75 -----------------------
77 function Add_Final_Chain (Def_Id : Entity_Id) return Entity_Id;
78 -- Add the declaration of a finalization list to the freeze actions for
79 -- Def_Id, and return its defining identifier.
81 procedure Adjust_Discriminants (Rtype : Entity_Id);
82 -- This is used when freezing a record type. It attempts to construct
83 -- more restrictive subtypes for discriminants so that the max size of
84 -- the record can be calculated more accurately. See the body of this
85 -- procedure for details.
87 procedure Build_Array_Init_Proc (A_Type : Entity_Id; Nod : Node_Id);
88 -- Build initialization procedure for given array type. Nod is a node
89 -- used for attachment of any actions required in its construction.
90 -- It also supplies the source location used for the procedure.
92 function Build_Discriminant_Formals
94 Use_Dl : Boolean) return List_Id;
95 -- This function uses the discriminants of a type to build a list of
96 -- formal parameters, used in the following function. If the flag Use_Dl
97 -- is set, the list is built using the already defined discriminals
98 -- of the type. Otherwise new identifiers are created, with the source
99 -- names of the discriminants.
101 function Build_Equivalent_Array_Aggregate (T : Entity_Id) return Node_Id;
102 -- This function builds a static aggregate that can serve as the initial
103 -- value for an array type whose bounds are static, and whose component
104 -- type is a composite type that has a static equivalent aggregate.
105 -- The equivalent array aggregate is used both for object initialization
106 -- and for component initialization, when used in the following function.
108 function Build_Equivalent_Record_Aggregate (T : Entity_Id) return Node_Id;
109 -- This function builds a static aggregate that can serve as the initial
110 -- value for a record type whose components are scalar and initialized
111 -- with compile-time values, or arrays with similar initialization or
112 -- defaults. When possible, initialization of an object of the type can
113 -- be achieved by using a copy of the aggregate as an initial value, thus
114 -- removing the implicit call that would otherwise constitute elaboration
117 function Build_Master_Renaming
119 T : Entity_Id) return Entity_Id;
120 -- If the designated type of an access type is a task type or contains
121 -- tasks, we make sure that a _Master variable is declared in the current
122 -- scope, and then declare a renaming for it:
124 -- atypeM : Master_Id renames _Master;
126 -- where atyp is the name of the access type. This declaration is used when
127 -- an allocator for the access type is expanded. The node is the full
128 -- declaration of the designated type that contains tasks. The renaming
129 -- declaration is inserted before N, and after the Master declaration.
131 procedure Build_Record_Init_Proc (N : Node_Id; Pe : Entity_Id);
132 -- Build record initialization procedure. N is the type declaration
133 -- node, and Pe is the corresponding entity for the record type.
135 procedure Build_Slice_Assignment (Typ : Entity_Id);
136 -- Build assignment procedure for one-dimensional arrays of controlled
137 -- types. Other array and slice assignments are expanded in-line, but
138 -- the code expansion for controlled components (when control actions
139 -- are active) can lead to very large blocks that GCC3 handles poorly.
141 procedure Build_Variant_Record_Equality (Typ : Entity_Id);
142 -- Create An Equality function for the non-tagged variant record 'Typ'
143 -- and attach it to the TSS list
145 procedure Check_Stream_Attributes (Typ : Entity_Id);
146 -- Check that if a limited extension has a parent with user-defined stream
147 -- attributes, and does not itself have user-defined stream-attributes,
148 -- then any limited component of the extension also has the corresponding
149 -- user-defined stream attributes.
151 procedure Clean_Task_Names
153 Proc_Id : Entity_Id);
154 -- If an initialization procedure includes calls to generate names
155 -- for task subcomponents, indicate that secondary stack cleanup is
156 -- needed after an initialization. Typ is the component type, and Proc_Id
157 -- the initialization procedure for the enclosing composite type.
159 procedure Expand_Tagged_Root (T : Entity_Id);
160 -- Add a field _Tag at the beginning of the record. This field carries
161 -- the value of the access to the Dispatch table. This procedure is only
162 -- called on root type, the _Tag field being inherited by the descendants.
164 procedure Expand_Record_Controller (T : Entity_Id);
165 -- T must be a record type that Has_Controlled_Component. Add a field
166 -- _controller of type Record_Controller or Limited_Record_Controller
169 procedure Freeze_Array_Type (N : Node_Id);
170 -- Freeze an array type. Deals with building the initialization procedure,
171 -- creating the packed array type for a packed array and also with the
172 -- creation of the controlling procedures for the controlled case. The
173 -- argument N is the N_Freeze_Entity node for the type.
175 procedure Freeze_Enumeration_Type (N : Node_Id);
176 -- Freeze enumeration type with non-standard representation. Builds the
177 -- array and function needed to convert between enumeration pos and
178 -- enumeration representation values. N is the N_Freeze_Entity node
181 procedure Freeze_Record_Type (N : Node_Id);
182 -- Freeze record type. Builds all necessary discriminant checking
183 -- and other ancillary functions, and builds dispatch tables where
184 -- needed. The argument N is the N_Freeze_Entity node. This processing
185 -- applies only to E_Record_Type entities, not to class wide types,
186 -- record subtypes, or private types.
188 procedure Freeze_Stream_Operations (N : Node_Id; Typ : Entity_Id);
189 -- Treat user-defined stream operations as renaming_as_body if the
190 -- subprogram they rename is not frozen when the type is frozen.
192 procedure Initialization_Warning (E : Entity_Id);
193 -- If static elaboration of the package is requested, indicate
194 -- when a type does meet the conditions for static initialization. If
195 -- E is a type, it has components that have no static initialization.
196 -- if E is an entity, its initial expression is not compile-time known.
198 function Init_Formals (Typ : Entity_Id) return List_Id;
199 -- This function builds the list of formals for an initialization routine.
200 -- The first formal is always _Init with the given type. For task value
201 -- record types and types containing tasks, three additional formals are
204 -- _Master : Master_Id
205 -- _Chain : in out Activation_Chain
206 -- _Task_Name : String
208 -- The caller must append additional entries for discriminants if required.
210 function In_Runtime (E : Entity_Id) return Boolean;
211 -- Check if E is defined in the RTL (in a child of Ada or System). Used
212 -- to avoid to bring in the overhead of _Input, _Output for tagged types.
214 function Is_Variable_Size_Record (E : Entity_Id) return Boolean;
215 -- Returns true if E has variable size components
217 function Make_Eq_Case
220 Discr : Entity_Id := Empty) return List_Id;
221 -- Building block for variant record equality. Defined to share the code
222 -- between the tagged and non-tagged case. Given a Component_List node CL,
223 -- it generates an 'if' followed by a 'case' statement that compares all
224 -- components of local temporaries named X and Y (that are declared as
225 -- formals at some upper level). E provides the Sloc to be used for the
226 -- generated code. Discr is used as the case statement switch in the case
227 -- of Unchecked_Union equality.
231 L : List_Id) return Node_Id;
232 -- Building block for variant record equality. Defined to share the code
233 -- between the tagged and non-tagged case. Given the list of components
234 -- (or discriminants) L, it generates a return statement that compares all
235 -- components of local temporaries named X and Y (that are declared as
236 -- formals at some upper level). E provides the Sloc to be used for the
239 procedure Make_Predefined_Primitive_Specs
240 (Tag_Typ : Entity_Id;
241 Predef_List : out List_Id;
242 Renamed_Eq : out Entity_Id);
243 -- Create a list with the specs of the predefined primitive operations.
244 -- For tagged types that are interfaces all these primitives are defined
247 -- The following entries are present for all tagged types, and provide
248 -- the results of the corresponding attribute applied to the object.
249 -- Dispatching is required in general, since the result of the attribute
250 -- will vary with the actual object subtype.
252 -- _alignment provides result of 'Alignment attribute
253 -- _size provides result of 'Size attribute
254 -- typSR provides result of 'Read attribute
255 -- typSW provides result of 'Write attribute
256 -- typSI provides result of 'Input attribute
257 -- typSO provides result of 'Output attribute
259 -- The following entries are additionally present for non-limited tagged
260 -- types, and implement additional dispatching operations for predefined
263 -- _equality implements "=" operator
264 -- _assign implements assignment operation
265 -- typDF implements deep finalization
266 -- typDA implements deep adjust
268 -- The latter two are empty procedures unless the type contains some
269 -- controlled components that require finalization actions (the deep
270 -- in the name refers to the fact that the action applies to components).
272 -- The list is returned in Predef_List. The Parameter Renamed_Eq either
273 -- returns the value Empty, or else the defining unit name for the
274 -- predefined equality function in the case where the type has a primitive
275 -- operation that is a renaming of predefined equality (but only if there
276 -- is also an overriding user-defined equality function). The returned
277 -- Renamed_Eq will be passed to the corresponding parameter of
278 -- Predefined_Primitive_Bodies.
280 function Has_New_Non_Standard_Rep (T : Entity_Id) return Boolean;
281 -- returns True if there are representation clauses for type T that are not
282 -- inherited. If the result is false, the init_proc and the discriminant
283 -- checking functions of the parent can be reused by a derived type.
285 procedure Make_Controlling_Function_Wrappers
286 (Tag_Typ : Entity_Id;
287 Decl_List : out List_Id;
288 Body_List : out List_Id);
289 -- Ada 2005 (AI-391): Makes specs and bodies for the wrapper functions
290 -- associated with inherited functions with controlling results which
291 -- are not overridden. The body of each wrapper function consists solely
292 -- of a return statement whose expression is an extension aggregate
293 -- invoking the inherited subprogram's parent subprogram and extended
294 -- with a null association list.
296 procedure Make_Null_Procedure_Specs
297 (Tag_Typ : Entity_Id;
298 Decl_List : out List_Id);
299 -- Ada 2005 (AI-251): Makes specs for null procedures associated with any
300 -- null procedures inherited from an interface type that have not been
301 -- overridden. Only one null procedure will be created for a given set of
302 -- inherited null procedures with homographic profiles.
304 function Predef_Spec_Or_Body
309 Ret_Type : Entity_Id := Empty;
310 For_Body : Boolean := False) return Node_Id;
311 -- This function generates the appropriate expansion for a predefined
312 -- primitive operation specified by its name, parameter profile and
313 -- return type (Empty means this is a procedure). If For_Body is false,
314 -- then the returned node is a subprogram declaration. If For_Body is
315 -- true, then the returned node is a empty subprogram body containing
316 -- no declarations and no statements.
318 function Predef_Stream_Attr_Spec
321 Name : TSS_Name_Type;
322 For_Body : Boolean := False) return Node_Id;
323 -- Specialized version of Predef_Spec_Or_Body that apply to read, write,
324 -- input and output attribute whose specs are constructed in Exp_Strm.
326 function Predef_Deep_Spec
329 Name : TSS_Name_Type;
330 For_Body : Boolean := False) return Node_Id;
331 -- Specialized version of Predef_Spec_Or_Body that apply to _deep_adjust
332 -- and _deep_finalize
334 function Predefined_Primitive_Bodies
335 (Tag_Typ : Entity_Id;
336 Renamed_Eq : Entity_Id) return List_Id;
337 -- Create the bodies of the predefined primitives that are described in
338 -- Predefined_Primitive_Specs. When not empty, Renamed_Eq must denote
339 -- the defining unit name of the type's predefined equality as returned
340 -- by Make_Predefined_Primitive_Specs.
342 function Predefined_Primitive_Freeze (Tag_Typ : Entity_Id) return List_Id;
343 -- Freeze entities of all predefined primitive operations. This is needed
344 -- because the bodies of these operations do not normally do any freezing.
346 function Stream_Operation_OK
348 Operation : TSS_Name_Type) return Boolean;
349 -- Check whether the named stream operation must be emitted for a given
350 -- type. The rules for inheritance of stream attributes by type extensions
351 -- are enforced by this function. Furthermore, various restrictions prevent
352 -- the generation of these operations, as a useful optimization or for
353 -- certification purposes.
355 ---------------------
356 -- Add_Final_Chain --
357 ---------------------
359 function Add_Final_Chain (Def_Id : Entity_Id) return Entity_Id is
360 Loc : constant Source_Ptr := Sloc (Def_Id);
365 Make_Defining_Identifier (Loc,
366 New_External_Name (Chars (Def_Id), 'L'));
368 Append_Freeze_Action (Def_Id,
369 Make_Object_Declaration (Loc,
370 Defining_Identifier => Flist,
372 New_Reference_To (RTE (RE_List_Controller), Loc)));
377 --------------------------
378 -- Adjust_Discriminants --
379 --------------------------
381 -- This procedure attempts to define subtypes for discriminants that are
382 -- more restrictive than those declared. Such a replacement is possible if
383 -- we can demonstrate that values outside the restricted range would cause
384 -- constraint errors in any case. The advantage of restricting the
385 -- discriminant types in this way is that the maximum size of the variant
386 -- record can be calculated more conservatively.
388 -- An example of a situation in which we can perform this type of
389 -- restriction is the following:
391 -- subtype B is range 1 .. 10;
392 -- type Q is array (B range <>) of Integer;
394 -- type V (N : Natural) is record
398 -- In this situation, we can restrict the upper bound of N to 10, since
399 -- any larger value would cause a constraint error in any case.
401 -- There are many situations in which such restriction is possible, but
402 -- for now, we just look for cases like the above, where the component
403 -- in question is a one dimensional array whose upper bound is one of
404 -- the record discriminants. Also the component must not be part of
405 -- any variant part, since then the component does not always exist.
407 procedure Adjust_Discriminants (Rtype : Entity_Id) is
408 Loc : constant Source_Ptr := Sloc (Rtype);
425 Comp := First_Component (Rtype);
426 while Present (Comp) loop
428 -- If our parent is a variant, quit, we do not look at components
429 -- that are in variant parts, because they may not always exist.
431 P := Parent (Comp); -- component declaration
432 P := Parent (P); -- component list
434 exit when Nkind (Parent (P)) = N_Variant;
436 -- We are looking for a one dimensional array type
438 Ctyp := Etype (Comp);
440 if not Is_Array_Type (Ctyp)
441 or else Number_Dimensions (Ctyp) > 1
446 -- The lower bound must be constant, and the upper bound is a
447 -- discriminant (which is a discriminant of the current record).
449 Ityp := Etype (First_Index (Ctyp));
450 Lo := Type_Low_Bound (Ityp);
451 Hi := Type_High_Bound (Ityp);
453 if not Compile_Time_Known_Value (Lo)
454 or else Nkind (Hi) /= N_Identifier
455 or else No (Entity (Hi))
456 or else Ekind (Entity (Hi)) /= E_Discriminant
461 -- We have an array with appropriate bounds
463 Loval := Expr_Value (Lo);
464 Discr := Entity (Hi);
465 Dtyp := Etype (Discr);
467 -- See if the discriminant has a known upper bound
469 Dhi := Type_High_Bound (Dtyp);
471 if not Compile_Time_Known_Value (Dhi) then
475 Dhiv := Expr_Value (Dhi);
477 -- See if base type of component array has known upper bound
479 Ahi := Type_High_Bound (Etype (First_Index (Base_Type (Ctyp))));
481 if not Compile_Time_Known_Value (Ahi) then
485 Ahiv := Expr_Value (Ahi);
487 -- The condition for doing the restriction is that the high bound
488 -- of the discriminant is greater than the low bound of the array,
489 -- and is also greater than the high bound of the base type index.
491 if Dhiv > Loval and then Dhiv > Ahiv then
493 -- We can reset the upper bound of the discriminant type to
494 -- whichever is larger, the low bound of the component, or
495 -- the high bound of the base type array index.
497 -- We build a subtype that is declared as
499 -- subtype Tnn is discr_type range discr_type'First .. max;
501 -- And insert this declaration into the tree. The type of the
502 -- discriminant is then reset to this more restricted subtype.
504 Tnn := Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
506 Insert_Action (Declaration_Node (Rtype),
507 Make_Subtype_Declaration (Loc,
508 Defining_Identifier => Tnn,
509 Subtype_Indication =>
510 Make_Subtype_Indication (Loc,
511 Subtype_Mark => New_Occurrence_Of (Dtyp, Loc),
513 Make_Range_Constraint (Loc,
517 Make_Attribute_Reference (Loc,
518 Attribute_Name => Name_First,
519 Prefix => New_Occurrence_Of (Dtyp, Loc)),
521 Make_Integer_Literal (Loc,
522 Intval => UI_Max (Loval, Ahiv)))))));
524 Set_Etype (Discr, Tnn);
528 Next_Component (Comp);
530 end Adjust_Discriminants;
532 ---------------------------
533 -- Build_Array_Init_Proc --
534 ---------------------------
536 procedure Build_Array_Init_Proc (A_Type : Entity_Id; Nod : Node_Id) is
537 Loc : constant Source_Ptr := Sloc (Nod);
538 Comp_Type : constant Entity_Id := Component_Type (A_Type);
539 Index_List : List_Id;
541 Body_Stmts : List_Id;
542 Has_Default_Init : Boolean;
544 function Init_Component return List_Id;
545 -- Create one statement to initialize one array component, designated
546 -- by a full set of indices.
548 function Init_One_Dimension (N : Int) return List_Id;
549 -- Create loop to initialize one dimension of the array. The single
550 -- statement in the loop body initializes the inner dimensions if any,
551 -- or else the single component. Note that this procedure is called
552 -- recursively, with N being the dimension to be initialized. A call
553 -- with N greater than the number of dimensions simply generates the
554 -- component initialization, terminating the recursion.
560 function Init_Component return List_Id is
565 Make_Indexed_Component (Loc,
566 Prefix => Make_Identifier (Loc, Name_uInit),
567 Expressions => Index_List);
569 if Needs_Simple_Initialization (Comp_Type) then
570 Set_Assignment_OK (Comp);
572 Make_Assignment_Statement (Loc,
576 (Comp_Type, Nod, Component_Size (A_Type))));
579 Clean_Task_Names (Comp_Type, Proc_Id);
581 Build_Initialization_Call
582 (Loc, Comp, Comp_Type,
583 In_Init_Proc => True,
584 Enclos_Type => A_Type);
588 ------------------------
589 -- Init_One_Dimension --
590 ------------------------
592 function Init_One_Dimension (N : Int) return List_Id is
596 -- If the component does not need initializing, then there is nothing
597 -- to do here, so we return a null body. This occurs when generating
598 -- the dummy Init_Proc needed for Initialize_Scalars processing.
600 if not Has_Non_Null_Base_Init_Proc (Comp_Type)
601 and then not Needs_Simple_Initialization (Comp_Type)
602 and then not Has_Task (Comp_Type)
604 return New_List (Make_Null_Statement (Loc));
606 -- If all dimensions dealt with, we simply initialize the component
608 elsif N > Number_Dimensions (A_Type) then
609 return Init_Component;
611 -- Here we generate the required loop
615 Make_Defining_Identifier (Loc, New_External_Name ('J', N));
617 Append (New_Reference_To (Index, Loc), Index_List);
620 Make_Implicit_Loop_Statement (Nod,
623 Make_Iteration_Scheme (Loc,
624 Loop_Parameter_Specification =>
625 Make_Loop_Parameter_Specification (Loc,
626 Defining_Identifier => Index,
627 Discrete_Subtype_Definition =>
628 Make_Attribute_Reference (Loc,
629 Prefix => Make_Identifier (Loc, Name_uInit),
630 Attribute_Name => Name_Range,
631 Expressions => New_List (
632 Make_Integer_Literal (Loc, N))))),
633 Statements => Init_One_Dimension (N + 1)));
635 end Init_One_Dimension;
637 -- Start of processing for Build_Array_Init_Proc
640 -- Nothing to generate in the following cases:
642 -- 1. Initialization is suppressed for the type
643 -- 2. The type is a value type, in the CIL sense.
644 -- 3. An initialization already exists for the base type
646 if Suppress_Init_Proc (A_Type)
647 or else Is_Value_Type (Comp_Type)
648 or else Present (Base_Init_Proc (A_Type))
653 Index_List := New_List;
655 -- We need an initialization procedure if any of the following is true:
657 -- 1. The component type has an initialization procedure
658 -- 2. The component type needs simple initialization
659 -- 3. Tasks are present
660 -- 4. The type is marked as a public entity
662 -- The reason for the public entity test is to deal properly with the
663 -- Initialize_Scalars pragma. This pragma can be set in the client and
664 -- not in the declaring package, this means the client will make a call
665 -- to the initialization procedure (because one of conditions 1-3 must
666 -- apply in this case), and we must generate a procedure (even if it is
667 -- null) to satisfy the call in this case.
669 -- Exception: do not build an array init_proc for a type whose root
670 -- type is Standard.String or Standard.Wide_[Wide_]String, since there
671 -- is no place to put the code, and in any case we handle initialization
672 -- of such types (in the Initialize_Scalars case, that's the only time
673 -- the issue arises) in a special manner anyway which does not need an
676 Has_Default_Init := Has_Non_Null_Base_Init_Proc (Comp_Type)
677 or else Needs_Simple_Initialization (Comp_Type)
678 or else Has_Task (Comp_Type);
681 or else (not Restriction_Active (No_Initialize_Scalars)
682 and then Is_Public (A_Type)
683 and then Root_Type (A_Type) /= Standard_String
684 and then Root_Type (A_Type) /= Standard_Wide_String
685 and then Root_Type (A_Type) /= Standard_Wide_Wide_String)
688 Make_Defining_Identifier (Loc,
689 Chars => Make_Init_Proc_Name (A_Type));
691 -- If No_Default_Initialization restriction is active, then we don't
692 -- want to build an init_proc, but we need to mark that an init_proc
693 -- would be needed if this restriction was not active (so that we can
694 -- detect attempts to call it), so set a dummy init_proc in place.
695 -- This is only done though when actual default initialization is
696 -- needed (and not done when only Is_Public is True), since otherwise
697 -- objects such as arrays of scalars could be wrongly flagged as
698 -- violating the restriction.
700 if Restriction_Active (No_Default_Initialization) then
701 if Has_Default_Init then
702 Set_Init_Proc (A_Type, Proc_Id);
708 Body_Stmts := Init_One_Dimension (1);
711 Make_Subprogram_Body (Loc,
713 Make_Procedure_Specification (Loc,
714 Defining_Unit_Name => Proc_Id,
715 Parameter_Specifications => Init_Formals (A_Type)),
716 Declarations => New_List,
717 Handled_Statement_Sequence =>
718 Make_Handled_Sequence_Of_Statements (Loc,
719 Statements => Body_Stmts)));
721 Set_Ekind (Proc_Id, E_Procedure);
722 Set_Is_Public (Proc_Id, Is_Public (A_Type));
723 Set_Is_Internal (Proc_Id);
724 Set_Has_Completion (Proc_Id);
726 if not Debug_Generated_Code then
727 Set_Debug_Info_Off (Proc_Id);
730 -- Set inlined unless controlled stuff or tasks around, in which
731 -- case we do not want to inline, because nested stuff may cause
732 -- difficulties in inter-unit inlining, and furthermore there is
733 -- in any case no point in inlining such complex init procs.
735 if not Has_Task (Proc_Id)
736 and then not Needs_Finalization (Proc_Id)
738 Set_Is_Inlined (Proc_Id);
741 -- Associate Init_Proc with type, and determine if the procedure
742 -- is null (happens because of the Initialize_Scalars pragma case,
743 -- where we have to generate a null procedure in case it is called
744 -- by a client with Initialize_Scalars set). Such procedures have
745 -- to be generated, but do not have to be called, so we mark them
746 -- as null to suppress the call.
748 Set_Init_Proc (A_Type, Proc_Id);
750 if List_Length (Body_Stmts) = 1
751 and then Nkind (First (Body_Stmts)) = N_Null_Statement
753 Set_Is_Null_Init_Proc (Proc_Id);
756 -- Try to build a static aggregate to initialize statically
757 -- objects of the type. This can only be done for constrained
758 -- one-dimensional arrays with static bounds.
760 Set_Static_Initialization
762 Build_Equivalent_Array_Aggregate (First_Subtype (A_Type)));
765 end Build_Array_Init_Proc;
767 -----------------------------
768 -- Build_Class_Wide_Master --
769 -----------------------------
771 procedure Build_Class_Wide_Master (T : Entity_Id) is
772 Loc : constant Source_Ptr := Sloc (T);
779 -- Nothing to do if there is no task hierarchy
781 if Restriction_Active (No_Task_Hierarchy) then
785 -- Find declaration that created the access type: either a type
786 -- declaration, or an object declaration with an access definition,
787 -- in which case the type is anonymous.
790 P := Associated_Node_For_Itype (T);
795 -- Nothing to do if we already built a master entity for this scope
797 if not Has_Master_Entity (Scope (T)) then
799 -- First build the master entity
800 -- _Master : constant Master_Id := Current_Master.all;
801 -- and insert it just before the current declaration.
804 Make_Object_Declaration (Loc,
805 Defining_Identifier =>
806 Make_Defining_Identifier (Loc, Name_uMaster),
807 Constant_Present => True,
808 Object_Definition => New_Reference_To (Standard_Integer, Loc),
810 Make_Explicit_Dereference (Loc,
811 New_Reference_To (RTE (RE_Current_Master), Loc)));
813 Insert_Action (P, Decl);
815 Set_Has_Master_Entity (Scope (T));
817 -- Now mark the containing scope as a task master. Masters
818 -- associated with return statements are already marked at
819 -- this stage (see Analyze_Subprogram_Body).
821 if Ekind (Current_Scope) /= E_Return_Statement then
823 while Nkind (Par) /= N_Compilation_Unit loop
826 -- If we fall off the top, we are at the outer level, and the
827 -- environment task is our effective master, so nothing to mark.
830 (Par, N_Task_Body, N_Block_Statement, N_Subprogram_Body)
832 Set_Is_Task_Master (Par, True);
839 -- Now define the renaming of the master_id
842 Make_Defining_Identifier (Loc,
843 New_External_Name (Chars (T), 'M'));
846 Make_Object_Renaming_Declaration (Loc,
847 Defining_Identifier => M_Id,
848 Subtype_Mark => New_Reference_To (Standard_Integer, Loc),
849 Name => Make_Identifier (Loc, Name_uMaster));
850 Insert_Before (P, Decl);
853 Set_Master_Id (T, M_Id);
856 when RE_Not_Available =>
858 end Build_Class_Wide_Master;
860 --------------------------------
861 -- Build_Discr_Checking_Funcs --
862 --------------------------------
864 procedure Build_Discr_Checking_Funcs (N : Node_Id) is
867 Enclosing_Func_Id : Entity_Id;
872 function Build_Case_Statement
873 (Case_Id : Entity_Id;
874 Variant : Node_Id) return Node_Id;
875 -- Build a case statement containing only two alternatives. The first
876 -- alternative corresponds exactly to the discrete choices given on the
877 -- variant with contains the components that we are generating the
878 -- checks for. If the discriminant is one of these return False. The
879 -- second alternative is an OTHERS choice that will return True
880 -- indicating the discriminant did not match.
882 function Build_Dcheck_Function
883 (Case_Id : Entity_Id;
884 Variant : Node_Id) return Entity_Id;
885 -- Build the discriminant checking function for a given variant
887 procedure Build_Dcheck_Functions (Variant_Part_Node : Node_Id);
888 -- Builds the discriminant checking function for each variant of the
889 -- given variant part of the record type.
891 --------------------------
892 -- Build_Case_Statement --
893 --------------------------
895 function Build_Case_Statement
896 (Case_Id : Entity_Id;
897 Variant : Node_Id) return Node_Id
899 Alt_List : constant List_Id := New_List;
900 Actuals_List : List_Id;
902 Case_Alt_Node : Node_Id;
904 Choice_List : List_Id;
906 Return_Node : Node_Id;
909 Case_Node := New_Node (N_Case_Statement, Loc);
911 -- Replace the discriminant which controls the variant, with the name
912 -- of the formal of the checking function.
914 Set_Expression (Case_Node,
915 Make_Identifier (Loc, Chars (Case_Id)));
917 Choice := First (Discrete_Choices (Variant));
919 if Nkind (Choice) = N_Others_Choice then
920 Choice_List := New_Copy_List (Others_Discrete_Choices (Choice));
922 Choice_List := New_Copy_List (Discrete_Choices (Variant));
925 if not Is_Empty_List (Choice_List) then
926 Case_Alt_Node := New_Node (N_Case_Statement_Alternative, Loc);
927 Set_Discrete_Choices (Case_Alt_Node, Choice_List);
929 -- In case this is a nested variant, we need to return the result
930 -- of the discriminant checking function for the immediately
931 -- enclosing variant.
933 if Present (Enclosing_Func_Id) then
934 Actuals_List := New_List;
936 D := First_Discriminant (Rec_Id);
937 while Present (D) loop
938 Append (Make_Identifier (Loc, Chars (D)), Actuals_List);
939 Next_Discriminant (D);
943 Make_Simple_Return_Statement (Loc,
945 Make_Function_Call (Loc,
947 New_Reference_To (Enclosing_Func_Id, Loc),
948 Parameter_Associations =>
953 Make_Simple_Return_Statement (Loc,
955 New_Reference_To (Standard_False, Loc));
958 Set_Statements (Case_Alt_Node, New_List (Return_Node));
959 Append (Case_Alt_Node, Alt_List);
962 Case_Alt_Node := New_Node (N_Case_Statement_Alternative, Loc);
963 Choice_List := New_List (New_Node (N_Others_Choice, Loc));
964 Set_Discrete_Choices (Case_Alt_Node, Choice_List);
967 Make_Simple_Return_Statement (Loc,
969 New_Reference_To (Standard_True, Loc));
971 Set_Statements (Case_Alt_Node, New_List (Return_Node));
972 Append (Case_Alt_Node, Alt_List);
974 Set_Alternatives (Case_Node, Alt_List);
976 end Build_Case_Statement;
978 ---------------------------
979 -- Build_Dcheck_Function --
980 ---------------------------
982 function Build_Dcheck_Function
983 (Case_Id : Entity_Id;
984 Variant : Node_Id) return Entity_Id
988 Parameter_List : List_Id;
992 Body_Node := New_Node (N_Subprogram_Body, Loc);
993 Sequence := Sequence + 1;
996 Make_Defining_Identifier (Loc,
997 Chars => New_External_Name (Chars (Rec_Id), 'D', Sequence));
999 Spec_Node := New_Node (N_Function_Specification, Loc);
1000 Set_Defining_Unit_Name (Spec_Node, Func_Id);
1002 Parameter_List := Build_Discriminant_Formals (Rec_Id, False);
1004 Set_Parameter_Specifications (Spec_Node, Parameter_List);
1005 Set_Result_Definition (Spec_Node,
1006 New_Reference_To (Standard_Boolean, Loc));
1007 Set_Specification (Body_Node, Spec_Node);
1008 Set_Declarations (Body_Node, New_List);
1010 Set_Handled_Statement_Sequence (Body_Node,
1011 Make_Handled_Sequence_Of_Statements (Loc,
1012 Statements => New_List (
1013 Build_Case_Statement (Case_Id, Variant))));
1015 Set_Ekind (Func_Id, E_Function);
1016 Set_Mechanism (Func_Id, Default_Mechanism);
1017 Set_Is_Inlined (Func_Id, True);
1018 Set_Is_Pure (Func_Id, True);
1019 Set_Is_Public (Func_Id, Is_Public (Rec_Id));
1020 Set_Is_Internal (Func_Id, True);
1022 if not Debug_Generated_Code then
1023 Set_Debug_Info_Off (Func_Id);
1026 Analyze (Body_Node);
1028 Append_Freeze_Action (Rec_Id, Body_Node);
1029 Set_Dcheck_Function (Variant, Func_Id);
1031 end Build_Dcheck_Function;
1033 ----------------------------
1034 -- Build_Dcheck_Functions --
1035 ----------------------------
1037 procedure Build_Dcheck_Functions (Variant_Part_Node : Node_Id) is
1038 Component_List_Node : Node_Id;
1040 Discr_Name : Entity_Id;
1041 Func_Id : Entity_Id;
1043 Saved_Enclosing_Func_Id : Entity_Id;
1046 -- Build the discriminant-checking function for each variant, and
1047 -- label all components of that variant with the function's name.
1048 -- We only Generate a discriminant-checking function when the
1049 -- variant is not empty, to prevent the creation of dead code.
1050 -- The exception to that is when Frontend_Layout_On_Target is set,
1051 -- because the variant record size function generated in package
1052 -- Layout needs to generate calls to all discriminant-checking
1053 -- functions, including those for empty variants.
1055 Discr_Name := Entity (Name (Variant_Part_Node));
1056 Variant := First_Non_Pragma (Variants (Variant_Part_Node));
1058 while Present (Variant) loop
1059 Component_List_Node := Component_List (Variant);
1061 if not Null_Present (Component_List_Node)
1062 or else Frontend_Layout_On_Target
1064 Func_Id := Build_Dcheck_Function (Discr_Name, Variant);
1066 First_Non_Pragma (Component_Items (Component_List_Node));
1068 while Present (Decl) loop
1069 Set_Discriminant_Checking_Func
1070 (Defining_Identifier (Decl), Func_Id);
1072 Next_Non_Pragma (Decl);
1075 if Present (Variant_Part (Component_List_Node)) then
1076 Saved_Enclosing_Func_Id := Enclosing_Func_Id;
1077 Enclosing_Func_Id := Func_Id;
1078 Build_Dcheck_Functions (Variant_Part (Component_List_Node));
1079 Enclosing_Func_Id := Saved_Enclosing_Func_Id;
1083 Next_Non_Pragma (Variant);
1085 end Build_Dcheck_Functions;
1087 -- Start of processing for Build_Discr_Checking_Funcs
1090 -- Only build if not done already
1092 if not Discr_Check_Funcs_Built (N) then
1093 Type_Def := Type_Definition (N);
1095 if Nkind (Type_Def) = N_Record_Definition then
1096 if No (Component_List (Type_Def)) then -- null record.
1099 V := Variant_Part (Component_List (Type_Def));
1102 else pragma Assert (Nkind (Type_Def) = N_Derived_Type_Definition);
1103 if No (Component_List (Record_Extension_Part (Type_Def))) then
1107 (Component_List (Record_Extension_Part (Type_Def)));
1111 Rec_Id := Defining_Identifier (N);
1113 if Present (V) and then not Is_Unchecked_Union (Rec_Id) then
1115 Enclosing_Func_Id := Empty;
1116 Build_Dcheck_Functions (V);
1119 Set_Discr_Check_Funcs_Built (N);
1121 end Build_Discr_Checking_Funcs;
1123 --------------------------------
1124 -- Build_Discriminant_Formals --
1125 --------------------------------
1127 function Build_Discriminant_Formals
1128 (Rec_Id : Entity_Id;
1129 Use_Dl : Boolean) return List_Id
1131 Loc : Source_Ptr := Sloc (Rec_Id);
1132 Parameter_List : constant List_Id := New_List;
1135 Param_Spec_Node : Node_Id;
1138 if Has_Discriminants (Rec_Id) then
1139 D := First_Discriminant (Rec_Id);
1140 while Present (D) loop
1144 Formal := Discriminal (D);
1146 Formal := Make_Defining_Identifier (Loc, Chars (D));
1150 Make_Parameter_Specification (Loc,
1151 Defining_Identifier => Formal,
1153 New_Reference_To (Etype (D), Loc));
1154 Append (Param_Spec_Node, Parameter_List);
1155 Next_Discriminant (D);
1159 return Parameter_List;
1160 end Build_Discriminant_Formals;
1162 --------------------------------------
1163 -- Build_Equivalent_Array_Aggregate --
1164 --------------------------------------
1166 function Build_Equivalent_Array_Aggregate (T : Entity_Id) return Node_Id is
1167 Loc : constant Source_Ptr := Sloc (T);
1168 Comp_Type : constant Entity_Id := Component_Type (T);
1169 Index_Type : constant Entity_Id := Etype (First_Index (T));
1170 Proc : constant Entity_Id := Base_Init_Proc (T);
1176 if not Is_Constrained (T)
1177 or else Number_Dimensions (T) > 1
1180 Initialization_Warning (T);
1184 Lo := Type_Low_Bound (Index_Type);
1185 Hi := Type_High_Bound (Index_Type);
1187 if not Compile_Time_Known_Value (Lo)
1188 or else not Compile_Time_Known_Value (Hi)
1190 Initialization_Warning (T);
1194 if Is_Record_Type (Comp_Type)
1195 and then Present (Base_Init_Proc (Comp_Type))
1197 Expr := Static_Initialization (Base_Init_Proc (Comp_Type));
1200 Initialization_Warning (T);
1205 Initialization_Warning (T);
1209 Aggr := Make_Aggregate (Loc, No_List, New_List);
1210 Set_Etype (Aggr, T);
1211 Set_Aggregate_Bounds (Aggr,
1213 Low_Bound => New_Copy (Lo),
1214 High_Bound => New_Copy (Hi)));
1215 Set_Parent (Aggr, Parent (Proc));
1217 Append_To (Component_Associations (Aggr),
1218 Make_Component_Association (Loc,
1222 Low_Bound => New_Copy (Lo),
1223 High_Bound => New_Copy (Hi))),
1224 Expression => Expr));
1226 if Static_Array_Aggregate (Aggr) then
1229 Initialization_Warning (T);
1232 end Build_Equivalent_Array_Aggregate;
1234 ---------------------------------------
1235 -- Build_Equivalent_Record_Aggregate --
1236 ---------------------------------------
1238 function Build_Equivalent_Record_Aggregate (T : Entity_Id) return Node_Id is
1242 -- Start of processing for Build_Equivalent_Record_Aggregate
1245 if not Is_Record_Type (T)
1246 or else Has_Discriminants (T)
1247 or else Is_Limited_Type (T)
1248 or else Has_Non_Standard_Rep (T)
1250 Initialization_Warning (T);
1254 Comp := First_Component (T);
1256 -- A null record needs no warning
1262 while Present (Comp) loop
1264 -- Array components are acceptable if initialized by a positional
1265 -- aggregate with static components.
1267 if Is_Array_Type (Etype (Comp)) then
1269 Comp_Type : constant Entity_Id := Component_Type (Etype (Comp));
1272 if Nkind (Parent (Comp)) /= N_Component_Declaration
1273 or else No (Expression (Parent (Comp)))
1274 or else Nkind (Expression (Parent (Comp))) /= N_Aggregate
1276 Initialization_Warning (T);
1279 elsif Is_Scalar_Type (Component_Type (Etype (Comp)))
1281 (not Compile_Time_Known_Value (Type_Low_Bound (Comp_Type))
1282 or else not Compile_Time_Known_Value
1283 (Type_High_Bound (Comp_Type)))
1285 Initialization_Warning (T);
1289 not Static_Array_Aggregate (Expression (Parent (Comp)))
1291 Initialization_Warning (T);
1296 elsif Is_Scalar_Type (Etype (Comp)) then
1297 if Nkind (Parent (Comp)) /= N_Component_Declaration
1298 or else No (Expression (Parent (Comp)))
1299 or else not Compile_Time_Known_Value (Expression (Parent (Comp)))
1301 Initialization_Warning (T);
1305 -- For now, other types are excluded
1308 Initialization_Warning (T);
1312 Next_Component (Comp);
1315 -- All components have static initialization. Build positional
1316 -- aggregate from the given expressions or defaults.
1318 Agg := Make_Aggregate (Sloc (T), New_List, New_List);
1319 Set_Parent (Agg, Parent (T));
1321 Comp := First_Component (T);
1322 while Present (Comp) loop
1324 (New_Copy_Tree (Expression (Parent (Comp))), Expressions (Agg));
1325 Next_Component (Comp);
1328 Analyze_And_Resolve (Agg, T);
1330 end Build_Equivalent_Record_Aggregate;
1332 -------------------------------
1333 -- Build_Initialization_Call --
1334 -------------------------------
1336 -- References to a discriminant inside the record type declaration can
1337 -- appear either in the subtype_indication to constrain a record or an
1338 -- array, or as part of a larger expression given for the initial value
1339 -- of a component. In both of these cases N appears in the record
1340 -- initialization procedure and needs to be replaced by the formal
1341 -- parameter of the initialization procedure which corresponds to that
1344 -- In the example below, references to discriminants D1 and D2 in proc_1
1345 -- are replaced by references to formals with the same name
1348 -- A similar replacement is done for calls to any record initialization
1349 -- procedure for any components that are themselves of a record type.
1351 -- type R (D1, D2 : Integer) is record
1352 -- X : Integer := F * D1;
1353 -- Y : Integer := F * D2;
1356 -- procedure proc_1 (Out_2 : out R; D1 : Integer; D2 : Integer) is
1360 -- Out_2.X := F * D1;
1361 -- Out_2.Y := F * D2;
1364 function Build_Initialization_Call
1368 In_Init_Proc : Boolean := False;
1369 Enclos_Type : Entity_Id := Empty;
1370 Discr_Map : Elist_Id := New_Elmt_List;
1371 With_Default_Init : Boolean := False) return List_Id
1373 First_Arg : Node_Id;
1379 Proc : constant Entity_Id := Base_Init_Proc (Typ);
1380 Init_Type : constant Entity_Id := Etype (First_Formal (Proc));
1381 Full_Init_Type : constant Entity_Id := Underlying_Type (Init_Type);
1382 Res : constant List_Id := New_List;
1383 Full_Type : Entity_Id := Typ;
1384 Controller_Typ : Entity_Id;
1387 -- Nothing to do if the Init_Proc is null, unless Initialize_Scalars
1388 -- is active (in which case we make the call anyway, since in the
1389 -- actual compiled client it may be non null).
1390 -- Also nothing to do for value types.
1392 if (Is_Null_Init_Proc (Proc) and then not Init_Or_Norm_Scalars)
1393 or else Is_Value_Type (Typ)
1394 or else Is_Value_Type (Component_Type (Typ))
1399 -- Go to full view if private type. In the case of successive
1400 -- private derivations, this can require more than one step.
1402 while Is_Private_Type (Full_Type)
1403 and then Present (Full_View (Full_Type))
1405 Full_Type := Full_View (Full_Type);
1408 -- If Typ is derived, the procedure is the initialization procedure for
1409 -- the root type. Wrap the argument in an conversion to make it type
1410 -- honest. Actually it isn't quite type honest, because there can be
1411 -- conflicts of views in the private type case. That is why we set
1412 -- Conversion_OK in the conversion node.
1414 if (Is_Record_Type (Typ)
1415 or else Is_Array_Type (Typ)
1416 or else Is_Private_Type (Typ))
1417 and then Init_Type /= Base_Type (Typ)
1419 First_Arg := OK_Convert_To (Etype (Init_Type), Id_Ref);
1420 Set_Etype (First_Arg, Init_Type);
1423 First_Arg := Id_Ref;
1426 Args := New_List (Convert_Concurrent (First_Arg, Typ));
1428 -- In the tasks case, add _Master as the value of the _Master parameter
1429 -- and _Chain as the value of the _Chain parameter. At the outer level,
1430 -- these will be variables holding the corresponding values obtained
1431 -- from GNARL. At inner levels, they will be the parameters passed down
1432 -- through the outer routines.
1434 if Has_Task (Full_Type) then
1435 if Restriction_Active (No_Task_Hierarchy) then
1437 -- See comments in System.Tasking.Initialization.Init_RTS
1438 -- for the value 3 (should be rtsfindable constant ???)
1440 Append_To (Args, Make_Integer_Literal (Loc, 3));
1443 Append_To (Args, Make_Identifier (Loc, Name_uMaster));
1446 Append_To (Args, Make_Identifier (Loc, Name_uChain));
1448 -- Ada 2005 (AI-287): In case of default initialized components
1449 -- with tasks, we generate a null string actual parameter.
1450 -- This is just a workaround that must be improved later???
1452 if With_Default_Init then
1454 Make_String_Literal (Loc,
1459 Build_Task_Image_Decls (Loc, Id_Ref, Enclos_Type, In_Init_Proc);
1460 Decl := Last (Decls);
1463 New_Occurrence_Of (Defining_Identifier (Decl), Loc));
1464 Append_List (Decls, Res);
1472 -- Add discriminant values if discriminants are present
1474 if Has_Discriminants (Full_Init_Type) then
1475 Discr := First_Discriminant (Full_Init_Type);
1477 while Present (Discr) loop
1479 -- If this is a discriminated concurrent type, the init_proc
1480 -- for the corresponding record is being called. Use that type
1481 -- directly to find the discriminant value, to handle properly
1482 -- intervening renamed discriminants.
1485 T : Entity_Id := Full_Type;
1488 if Is_Protected_Type (T) then
1489 T := Corresponding_Record_Type (T);
1491 elsif Is_Private_Type (T)
1492 and then Present (Underlying_Full_View (T))
1493 and then Is_Protected_Type (Underlying_Full_View (T))
1495 T := Corresponding_Record_Type (Underlying_Full_View (T));
1499 Get_Discriminant_Value (
1502 Discriminant_Constraint (Full_Type));
1505 if In_Init_Proc then
1507 -- Replace any possible references to the discriminant in the
1508 -- call to the record initialization procedure with references
1509 -- to the appropriate formal parameter.
1511 if Nkind (Arg) = N_Identifier
1512 and then Ekind (Entity (Arg)) = E_Discriminant
1514 Arg := New_Reference_To (Discriminal (Entity (Arg)), Loc);
1516 -- Case of access discriminants. We replace the reference
1517 -- to the type by a reference to the actual object
1519 elsif Nkind (Arg) = N_Attribute_Reference
1520 and then Is_Access_Type (Etype (Arg))
1521 and then Is_Entity_Name (Prefix (Arg))
1522 and then Is_Type (Entity (Prefix (Arg)))
1525 Make_Attribute_Reference (Loc,
1526 Prefix => New_Copy (Prefix (Id_Ref)),
1527 Attribute_Name => Name_Unrestricted_Access);
1529 -- Otherwise make a copy of the default expression. Note that
1530 -- we use the current Sloc for this, because we do not want the
1531 -- call to appear to be at the declaration point. Within the
1532 -- expression, replace discriminants with their discriminals.
1536 New_Copy_Tree (Arg, Map => Discr_Map, New_Sloc => Loc);
1540 if Is_Constrained (Full_Type) then
1541 Arg := Duplicate_Subexpr_No_Checks (Arg);
1543 -- The constraints come from the discriminant default exps,
1544 -- they must be reevaluated, so we use New_Copy_Tree but we
1545 -- ensure the proper Sloc (for any embedded calls).
1547 Arg := New_Copy_Tree (Arg, New_Sloc => Loc);
1551 -- Ada 2005 (AI-287): In case of default initialized components,
1552 -- we need to generate the corresponding selected component node
1553 -- to access the discriminant value. In other cases this is not
1554 -- required because we are inside the init proc and we use the
1555 -- corresponding formal.
1557 if With_Default_Init
1558 and then Nkind (Id_Ref) = N_Selected_Component
1559 and then Nkind (Arg) = N_Identifier
1562 Make_Selected_Component (Loc,
1563 Prefix => New_Copy_Tree (Prefix (Id_Ref)),
1564 Selector_Name => Arg));
1566 Append_To (Args, Arg);
1569 Next_Discriminant (Discr);
1573 -- If this is a call to initialize the parent component of a derived
1574 -- tagged type, indicate that the tag should not be set in the parent.
1576 if Is_Tagged_Type (Full_Init_Type)
1577 and then not Is_CPP_Class (Full_Init_Type)
1578 and then Nkind (Id_Ref) = N_Selected_Component
1579 and then Chars (Selector_Name (Id_Ref)) = Name_uParent
1581 Append_To (Args, New_Occurrence_Of (Standard_False, Loc));
1585 Make_Procedure_Call_Statement (Loc,
1586 Name => New_Occurrence_Of (Proc, Loc),
1587 Parameter_Associations => Args));
1589 if Needs_Finalization (Typ)
1590 and then Nkind (Id_Ref) = N_Selected_Component
1592 if Chars (Selector_Name (Id_Ref)) /= Name_uParent then
1593 Append_List_To (Res,
1595 Ref => New_Copy_Tree (First_Arg),
1598 Find_Final_List (Typ, New_Copy_Tree (First_Arg)),
1599 With_Attach => Make_Integer_Literal (Loc, 1)));
1601 -- If the enclosing type is an extension with new controlled
1602 -- components, it has his own record controller. If the parent
1603 -- also had a record controller, attach it to the new one.
1605 -- Build_Init_Statements relies on the fact that in this specific
1606 -- case the last statement of the result is the attach call to
1607 -- the controller. If this is changed, it must be synchronized.
1609 elsif Present (Enclos_Type)
1610 and then Has_New_Controlled_Component (Enclos_Type)
1611 and then Has_Controlled_Component (Typ)
1613 if Is_Inherently_Limited_Type (Typ) then
1614 Controller_Typ := RTE (RE_Limited_Record_Controller);
1616 Controller_Typ := RTE (RE_Record_Controller);
1619 Append_List_To (Res,
1622 Make_Selected_Component (Loc,
1623 Prefix => New_Copy_Tree (First_Arg),
1624 Selector_Name => Make_Identifier (Loc, Name_uController)),
1625 Typ => Controller_Typ,
1626 Flist_Ref => Find_Final_List (Typ, New_Copy_Tree (First_Arg)),
1627 With_Attach => Make_Integer_Literal (Loc, 1)));
1634 when RE_Not_Available =>
1636 end Build_Initialization_Call;
1638 ---------------------------
1639 -- Build_Master_Renaming --
1640 ---------------------------
1642 function Build_Master_Renaming
1644 T : Entity_Id) return Entity_Id
1646 Loc : constant Source_Ptr := Sloc (N);
1651 -- Nothing to do if there is no task hierarchy
1653 if Restriction_Active (No_Task_Hierarchy) then
1658 Make_Defining_Identifier (Loc,
1659 New_External_Name (Chars (T), 'M'));
1662 Make_Object_Renaming_Declaration (Loc,
1663 Defining_Identifier => M_Id,
1664 Subtype_Mark => New_Reference_To (RTE (RE_Master_Id), Loc),
1665 Name => Make_Identifier (Loc, Name_uMaster));
1666 Insert_Before (N, Decl);
1671 when RE_Not_Available =>
1673 end Build_Master_Renaming;
1675 ---------------------------
1676 -- Build_Master_Renaming --
1677 ---------------------------
1679 procedure Build_Master_Renaming (N : Node_Id; T : Entity_Id) is
1683 -- Nothing to do if there is no task hierarchy
1685 if Restriction_Active (No_Task_Hierarchy) then
1689 M_Id := Build_Master_Renaming (N, T);
1690 Set_Master_Id (T, M_Id);
1693 when RE_Not_Available =>
1695 end Build_Master_Renaming;
1697 ----------------------------
1698 -- Build_Record_Init_Proc --
1699 ----------------------------
1701 procedure Build_Record_Init_Proc (N : Node_Id; Pe : Entity_Id) is
1702 Loc : Source_Ptr := Sloc (N);
1703 Discr_Map : constant Elist_Id := New_Elmt_List;
1704 Proc_Id : Entity_Id;
1705 Rec_Type : Entity_Id;
1706 Set_Tag : Entity_Id := Empty;
1708 function Build_Assignment (Id : Entity_Id; N : Node_Id) return List_Id;
1709 -- Build a assignment statement node which assigns to record component
1710 -- its default expression if defined. The assignment left hand side is
1711 -- marked Assignment_OK so that initialization of limited private
1712 -- records works correctly, Return also the adjustment call for
1713 -- controlled objects
1715 procedure Build_Discriminant_Assignments (Statement_List : List_Id);
1716 -- If the record has discriminants, adds assignment statements to
1717 -- statement list to initialize the discriminant values from the
1718 -- arguments of the initialization procedure.
1720 function Build_Init_Statements (Comp_List : Node_Id) return List_Id;
1721 -- Build a list representing a sequence of statements which initialize
1722 -- components of the given component list. This may involve building
1723 -- case statements for the variant parts.
1725 function Build_Init_Call_Thru (Parameters : List_Id) return List_Id;
1726 -- Given a non-tagged type-derivation that declares discriminants,
1729 -- type R (R1, R2 : Integer) is record ... end record;
1731 -- type D (D1 : Integer) is new R (1, D1);
1733 -- we make the _init_proc of D be
1735 -- procedure _init_proc(X : D; D1 : Integer) is
1737 -- _init_proc( R(X), 1, D1);
1740 -- This function builds the call statement in this _init_proc.
1742 procedure Build_Init_Procedure;
1743 -- Build the tree corresponding to the procedure specification and body
1744 -- of the initialization procedure (by calling all the preceding
1745 -- auxiliary routines), and install it as the _init TSS.
1747 procedure Build_Offset_To_Top_Functions;
1748 -- Ada 2005 (AI-251): Build the tree corresponding to the procedure spec
1749 -- and body of the Offset_To_Top function that is generated when the
1750 -- parent of a type with discriminants has secondary dispatch tables.
1752 procedure Build_Record_Checks (S : Node_Id; Check_List : List_Id);
1753 -- Add range checks to components of discriminated records. S is a
1754 -- subtype indication of a record component. Check_List is a list
1755 -- to which the check actions are appended.
1757 function Component_Needs_Simple_Initialization
1758 (T : Entity_Id) return Boolean;
1759 -- Determines if a component needs simple initialization, given its type
1760 -- T. This is the same as Needs_Simple_Initialization except for the
1761 -- following difference: the types Tag and Interface_Tag, that are
1762 -- access types which would normally require simple initialization to
1763 -- null, do not require initialization as components, since they are
1764 -- explicitly initialized by other means.
1766 procedure Constrain_Array
1768 Check_List : List_Id);
1769 -- Called from Build_Record_Checks.
1770 -- Apply a list of index constraints to an unconstrained array type.
1771 -- The first parameter is the entity for the resulting subtype.
1772 -- Check_List is a list to which the check actions are appended.
1774 procedure Constrain_Index
1777 Check_List : List_Id);
1778 -- Process an index constraint in a constrained array declaration.
1779 -- The constraint can be a subtype name, or a range with or without
1780 -- an explicit subtype mark. The index is the corresponding index of the
1781 -- unconstrained array. S is the range expression. Check_List is a list
1782 -- to which the check actions are appended (called from
1783 -- Build_Record_Checks).
1785 function Parent_Subtype_Renaming_Discrims return Boolean;
1786 -- Returns True for base types N that rename discriminants, else False
1788 function Requires_Init_Proc (Rec_Id : Entity_Id) return Boolean;
1789 -- Determines whether a record initialization procedure needs to be
1790 -- generated for the given record type.
1792 ----------------------
1793 -- Build_Assignment --
1794 ----------------------
1796 function Build_Assignment (Id : Entity_Id; N : Node_Id) return List_Id is
1799 Typ : constant Entity_Id := Underlying_Type (Etype (Id));
1800 Kind : Node_Kind := Nkind (N);
1806 Make_Selected_Component (Loc,
1807 Prefix => Make_Identifier (Loc, Name_uInit),
1808 Selector_Name => New_Occurrence_Of (Id, Loc));
1809 Set_Assignment_OK (Lhs);
1811 -- Case of an access attribute applied to the current instance.
1812 -- Replace the reference to the type by a reference to the actual
1813 -- object. (Note that this handles the case of the top level of
1814 -- the expression being given by such an attribute, but does not
1815 -- cover uses nested within an initial value expression. Nested
1816 -- uses are unlikely to occur in practice, but are theoretically
1817 -- possible. It is not clear how to handle them without fully
1818 -- traversing the expression. ???
1820 if Kind = N_Attribute_Reference
1821 and then (Attribute_Name (N) = Name_Unchecked_Access
1823 Attribute_Name (N) = Name_Unrestricted_Access)
1824 and then Is_Entity_Name (Prefix (N))
1825 and then Is_Type (Entity (Prefix (N)))
1826 and then Entity (Prefix (N)) = Rec_Type
1829 Make_Attribute_Reference (Loc,
1830 Prefix => Make_Identifier (Loc, Name_uInit),
1831 Attribute_Name => Name_Unrestricted_Access);
1834 -- Take a copy of Exp to ensure that later copies of this component
1835 -- declaration in derived types see the original tree, not a node
1836 -- rewritten during expansion of the init_proc.
1838 Exp := New_Copy_Tree (Exp);
1841 Make_Assignment_Statement (Loc,
1843 Expression => Exp));
1845 Set_No_Ctrl_Actions (First (Res));
1847 -- Adjust the tag if tagged (because of possible view conversions).
1848 -- Suppress the tag adjustment when VM_Target because VM tags are
1849 -- represented implicitly in objects.
1851 if Is_Tagged_Type (Typ) and then VM_Target = No_VM then
1853 Make_Assignment_Statement (Loc,
1855 Make_Selected_Component (Loc,
1856 Prefix => New_Copy_Tree (Lhs),
1858 New_Reference_To (First_Tag_Component (Typ), Loc)),
1861 Unchecked_Convert_To (RTE (RE_Tag),
1863 (Node (First_Elmt (Access_Disp_Table (Typ))), Loc))));
1866 -- Adjust the component if controlled except if it is an aggregate
1867 -- that will be expanded inline
1869 if Kind = N_Qualified_Expression then
1870 Kind := Nkind (Expression (N));
1873 if Needs_Finalization (Typ)
1874 and then not (Kind = N_Aggregate or else Kind = N_Extension_Aggregate)
1875 and then not Is_Inherently_Limited_Type (Typ)
1877 Append_List_To (Res,
1879 Ref => New_Copy_Tree (Lhs),
1882 Find_Final_List (Etype (Id), New_Copy_Tree (Lhs)),
1883 With_Attach => Make_Integer_Literal (Loc, 1)));
1889 when RE_Not_Available =>
1891 end Build_Assignment;
1893 ------------------------------------
1894 -- Build_Discriminant_Assignments --
1895 ------------------------------------
1897 procedure Build_Discriminant_Assignments (Statement_List : List_Id) is
1899 Is_Tagged : constant Boolean := Is_Tagged_Type (Rec_Type);
1902 if Has_Discriminants (Rec_Type)
1903 and then not Is_Unchecked_Union (Rec_Type)
1905 D := First_Discriminant (Rec_Type);
1907 while Present (D) loop
1908 -- Don't generate the assignment for discriminants in derived
1909 -- tagged types if the discriminant is a renaming of some
1910 -- ancestor discriminant. This initialization will be done
1911 -- when initializing the _parent field of the derived record.
1913 if Is_Tagged and then
1914 Present (Corresponding_Discriminant (D))
1920 Append_List_To (Statement_List,
1921 Build_Assignment (D,
1922 New_Reference_To (Discriminal (D), Loc)));
1925 Next_Discriminant (D);
1928 end Build_Discriminant_Assignments;
1930 --------------------------
1931 -- Build_Init_Call_Thru --
1932 --------------------------
1934 function Build_Init_Call_Thru (Parameters : List_Id) return List_Id is
1935 Parent_Proc : constant Entity_Id :=
1936 Base_Init_Proc (Etype (Rec_Type));
1938 Parent_Type : constant Entity_Id :=
1939 Etype (First_Formal (Parent_Proc));
1941 Uparent_Type : constant Entity_Id :=
1942 Underlying_Type (Parent_Type);
1944 First_Discr_Param : Node_Id;
1946 Parent_Discr : Entity_Id;
1947 First_Arg : Node_Id;
1953 -- First argument (_Init) is the object to be initialized.
1954 -- ??? not sure where to get a reasonable Loc for First_Arg
1957 OK_Convert_To (Parent_Type,
1958 New_Reference_To (Defining_Identifier (First (Parameters)), Loc));
1960 Set_Etype (First_Arg, Parent_Type);
1962 Args := New_List (Convert_Concurrent (First_Arg, Rec_Type));
1964 -- In the tasks case,
1965 -- add _Master as the value of the _Master parameter
1966 -- add _Chain as the value of the _Chain parameter.
1967 -- add _Task_Name as the value of the _Task_Name parameter.
1968 -- At the outer level, these will be variables holding the
1969 -- corresponding values obtained from GNARL or the expander.
1971 -- At inner levels, they will be the parameters passed down through
1972 -- the outer routines.
1974 First_Discr_Param := Next (First (Parameters));
1976 if Has_Task (Rec_Type) then
1977 if Restriction_Active (No_Task_Hierarchy) then
1979 -- See comments in System.Tasking.Initialization.Init_RTS
1982 Append_To (Args, Make_Integer_Literal (Loc, 3));
1984 Append_To (Args, Make_Identifier (Loc, Name_uMaster));
1987 Append_To (Args, Make_Identifier (Loc, Name_uChain));
1988 Append_To (Args, Make_Identifier (Loc, Name_uTask_Name));
1989 First_Discr_Param := Next (Next (Next (First_Discr_Param)));
1992 -- Append discriminant values
1994 if Has_Discriminants (Uparent_Type) then
1995 pragma Assert (not Is_Tagged_Type (Uparent_Type));
1997 Parent_Discr := First_Discriminant (Uparent_Type);
1998 while Present (Parent_Discr) loop
2000 -- Get the initial value for this discriminant
2001 -- ??? needs to be cleaned up to use parent_Discr_Constr
2005 Discr_Value : Elmt_Id :=
2007 (Stored_Constraint (Rec_Type));
2009 Discr : Entity_Id :=
2010 First_Stored_Discriminant (Uparent_Type);
2012 while Original_Record_Component (Parent_Discr) /= Discr loop
2013 Next_Stored_Discriminant (Discr);
2014 Next_Elmt (Discr_Value);
2017 Arg := Node (Discr_Value);
2020 -- Append it to the list
2022 if Nkind (Arg) = N_Identifier
2023 and then Ekind (Entity (Arg)) = E_Discriminant
2026 New_Reference_To (Discriminal (Entity (Arg)), Loc));
2028 -- Case of access discriminants. We replace the reference
2029 -- to the type by a reference to the actual object.
2031 -- Is above comment right??? Use of New_Copy below seems mighty
2035 Append_To (Args, New_Copy (Arg));
2038 Next_Discriminant (Parent_Discr);
2044 Make_Procedure_Call_Statement (Loc,
2045 Name => New_Occurrence_Of (Parent_Proc, Loc),
2046 Parameter_Associations => Args));
2049 end Build_Init_Call_Thru;
2051 -----------------------------------
2052 -- Build_Offset_To_Top_Functions --
2053 -----------------------------------
2055 procedure Build_Offset_To_Top_Functions is
2057 procedure Build_Offset_To_Top_Function (Iface_Comp : Entity_Id);
2059 -- function Fxx (O : in Rec_Typ) return Storage_Offset is
2061 -- return O.Iface_Comp'Position;
2064 ------------------------------
2065 -- Build_Offset_To_Top_Body --
2066 ------------------------------
2068 procedure Build_Offset_To_Top_Function (Iface_Comp : Entity_Id) is
2069 Body_Node : Node_Id;
2070 Func_Id : Entity_Id;
2071 Spec_Node : Node_Id;
2075 Make_Defining_Identifier (Loc,
2076 Chars => New_Internal_Name ('F'));
2078 Set_DT_Offset_To_Top_Func (Iface_Comp, Func_Id);
2081 -- function Fxx (O : in Rec_Typ) return Storage_Offset;
2083 Spec_Node := New_Node (N_Function_Specification, Loc);
2084 Set_Defining_Unit_Name (Spec_Node, Func_Id);
2085 Set_Parameter_Specifications (Spec_Node, New_List (
2086 Make_Parameter_Specification (Loc,
2087 Defining_Identifier => Make_Defining_Identifier (Loc, Name_uO),
2089 Parameter_Type => New_Reference_To (Rec_Type, Loc))));
2090 Set_Result_Definition (Spec_Node,
2091 New_Reference_To (RTE (RE_Storage_Offset), Loc));
2094 -- function Fxx (O : in Rec_Typ) return Storage_Offset is
2096 -- return O.Iface_Comp'Position;
2099 Body_Node := New_Node (N_Subprogram_Body, Loc);
2100 Set_Specification (Body_Node, Spec_Node);
2101 Set_Declarations (Body_Node, New_List);
2102 Set_Handled_Statement_Sequence (Body_Node,
2103 Make_Handled_Sequence_Of_Statements (Loc,
2104 Statements => New_List (
2105 Make_Simple_Return_Statement (Loc,
2107 Make_Attribute_Reference (Loc,
2109 Make_Selected_Component (Loc,
2110 Prefix => Make_Identifier (Loc, Name_uO),
2111 Selector_Name => New_Reference_To
2113 Attribute_Name => Name_Position)))));
2115 Set_Ekind (Func_Id, E_Function);
2116 Set_Mechanism (Func_Id, Default_Mechanism);
2117 Set_Is_Internal (Func_Id, True);
2119 if not Debug_Generated_Code then
2120 Set_Debug_Info_Off (Func_Id);
2123 Analyze (Body_Node);
2125 Append_Freeze_Action (Rec_Type, Body_Node);
2126 end Build_Offset_To_Top_Function;
2130 Ifaces_Comp_List : Elist_Id;
2131 Iface_Comp_Elmt : Elmt_Id;
2132 Iface_Comp : Node_Id;
2134 -- Start of processing for Build_Offset_To_Top_Functions
2137 -- Offset_To_Top_Functions are built only for derivations of types
2138 -- with discriminants that cover interface types.
2139 -- Nothing is needed either in case of virtual machines, since
2140 -- interfaces are handled directly by the VM.
2142 if not Is_Tagged_Type (Rec_Type)
2143 or else Etype (Rec_Type) = Rec_Type
2144 or else not Has_Discriminants (Etype (Rec_Type))
2145 or else VM_Target /= No_VM
2150 Collect_Interface_Components (Rec_Type, Ifaces_Comp_List);
2152 -- For each interface type with secondary dispatch table we generate
2153 -- the Offset_To_Top_Functions (required to displace the pointer in
2154 -- interface conversions)
2156 Iface_Comp_Elmt := First_Elmt (Ifaces_Comp_List);
2157 while Present (Iface_Comp_Elmt) loop
2158 Iface_Comp := Node (Iface_Comp_Elmt);
2159 pragma Assert (Is_Interface (Related_Type (Iface_Comp)));
2161 -- If the interface is a parent of Rec_Type it shares the primary
2162 -- dispatch table and hence there is no need to build the function
2164 if not Is_Ancestor (Related_Type (Iface_Comp), Rec_Type) then
2165 Build_Offset_To_Top_Function (Iface_Comp);
2168 Next_Elmt (Iface_Comp_Elmt);
2170 end Build_Offset_To_Top_Functions;
2172 --------------------------
2173 -- Build_Init_Procedure --
2174 --------------------------
2176 procedure Build_Init_Procedure is
2177 Body_Node : Node_Id;
2178 Handled_Stmt_Node : Node_Id;
2179 Parameters : List_Id;
2180 Proc_Spec_Node : Node_Id;
2181 Body_Stmts : List_Id;
2182 Record_Extension_Node : Node_Id;
2183 Init_Tags_List : List_Id;
2186 Body_Stmts := New_List;
2187 Body_Node := New_Node (N_Subprogram_Body, Loc);
2188 Set_Ekind (Proc_Id, E_Procedure);
2190 Proc_Spec_Node := New_Node (N_Procedure_Specification, Loc);
2191 Set_Defining_Unit_Name (Proc_Spec_Node, Proc_Id);
2193 Parameters := Init_Formals (Rec_Type);
2194 Append_List_To (Parameters,
2195 Build_Discriminant_Formals (Rec_Type, True));
2197 -- For tagged types, we add a flag to indicate whether the routine
2198 -- is called to initialize a parent component in the init_proc of
2199 -- a type extension. If the flag is false, we do not set the tag
2200 -- because it has been set already in the extension.
2202 if Is_Tagged_Type (Rec_Type)
2203 and then not Is_CPP_Class (Rec_Type)
2206 Make_Defining_Identifier (Loc,
2207 Chars => New_Internal_Name ('P'));
2209 Append_To (Parameters,
2210 Make_Parameter_Specification (Loc,
2211 Defining_Identifier => Set_Tag,
2212 Parameter_Type => New_Occurrence_Of (Standard_Boolean, Loc),
2213 Expression => New_Occurrence_Of (Standard_True, Loc)));
2216 Set_Parameter_Specifications (Proc_Spec_Node, Parameters);
2217 Set_Specification (Body_Node, Proc_Spec_Node);
2218 Set_Declarations (Body_Node, New_List);
2220 if Parent_Subtype_Renaming_Discrims then
2222 -- N is a Derived_Type_Definition that renames the parameters
2223 -- of the ancestor type. We initialize it by expanding our
2224 -- discriminants and call the ancestor _init_proc with a
2225 -- type-converted object
2227 Append_List_To (Body_Stmts,
2228 Build_Init_Call_Thru (Parameters));
2230 elsif Nkind (Type_Definition (N)) = N_Record_Definition then
2231 Build_Discriminant_Assignments (Body_Stmts);
2233 if not Null_Present (Type_Definition (N)) then
2234 Append_List_To (Body_Stmts,
2235 Build_Init_Statements (
2236 Component_List (Type_Definition (N))));
2240 -- N is a Derived_Type_Definition with a possible non-empty
2241 -- extension. The initialization of a type extension consists
2242 -- in the initialization of the components in the extension.
2244 Build_Discriminant_Assignments (Body_Stmts);
2246 Record_Extension_Node :=
2247 Record_Extension_Part (Type_Definition (N));
2249 if not Null_Present (Record_Extension_Node) then
2251 Stmts : constant List_Id :=
2252 Build_Init_Statements (
2253 Component_List (Record_Extension_Node));
2256 -- The parent field must be initialized first because
2257 -- the offset of the new discriminants may depend on it
2259 Prepend_To (Body_Stmts, Remove_Head (Stmts));
2260 Append_List_To (Body_Stmts, Stmts);
2265 -- Add here the assignment to instantiate the Tag
2267 -- The assignment corresponds to the code:
2269 -- _Init._Tag := Typ'Tag;
2271 -- Suppress the tag assignment when VM_Target because VM tags are
2272 -- represented implicitly in objects. It is also suppressed in case
2273 -- of CPP_Class types because in this case the tag is initialized in
2276 if Is_Tagged_Type (Rec_Type)
2277 and then not Is_CPP_Class (Rec_Type)
2278 and then VM_Target = No_VM
2279 and then not No_Run_Time_Mode
2281 -- Initialize the primary tag
2283 Init_Tags_List := New_List (
2284 Make_Assignment_Statement (Loc,
2286 Make_Selected_Component (Loc,
2287 Prefix => Make_Identifier (Loc, Name_uInit),
2289 New_Reference_To (First_Tag_Component (Rec_Type), Loc)),
2293 (Node (First_Elmt (Access_Disp_Table (Rec_Type))), Loc)));
2295 -- Ada 2005 (AI-251): Initialize the secondary tags components
2296 -- located at fixed positions (tags whose position depends on
2297 -- variable size components are initialized later ---see below).
2299 if Ada_Version >= Ada_05
2300 and then not Is_Interface (Rec_Type)
2301 and then Has_Interfaces (Rec_Type)
2305 Target => Make_Identifier (Loc, Name_uInit),
2306 Stmts_List => Init_Tags_List,
2307 Fixed_Comps => True,
2308 Variable_Comps => False);
2311 -- The tag must be inserted before the assignments to other
2312 -- components, because the initial value of the component may
2313 -- depend on the tag (eg. through a dispatching operation on
2314 -- an access to the current type). The tag assignment is not done
2315 -- when initializing the parent component of a type extension,
2316 -- because in that case the tag is set in the extension.
2318 -- Extensions of imported C++ classes add a final complication,
2319 -- because we cannot inhibit tag setting in the constructor for
2320 -- the parent. In that case we insert the tag initialization
2321 -- after the calls to initialize the parent.
2323 if not Is_CPP_Class (Root_Type (Rec_Type)) then
2324 Prepend_To (Body_Stmts,
2325 Make_If_Statement (Loc,
2326 Condition => New_Occurrence_Of (Set_Tag, Loc),
2327 Then_Statements => Init_Tags_List));
2329 -- CPP_Class derivation: In this case the dispatch table of the
2330 -- parent was built in the C++ side and we copy the table of the
2331 -- parent to initialize the new dispatch table.
2338 -- We assume the first init_proc call is for the parent
2340 Nod := First (Body_Stmts);
2341 while Present (Next (Nod))
2342 and then (Nkind (Nod) /= N_Procedure_Call_Statement
2343 or else not Is_Init_Proc (Name (Nod)))
2349 -- ancestor_constructor (_init.parent);
2351 -- inherit_prim_ops (_init._tag, new_dt, num_prims);
2352 -- _init._tag := new_dt;
2355 Prepend_To (Init_Tags_List,
2356 Build_Inherit_Prims (Loc,
2359 Make_Selected_Component (Loc,
2361 Make_Identifier (Loc,
2362 Chars => Name_uInit),
2365 (First_Tag_Component (Rec_Type), Loc)),
2368 (Node (First_Elmt (Access_Disp_Table (Rec_Type))),
2372 (DT_Entry_Count (First_Tag_Component (Rec_Type)))));
2375 Make_If_Statement (Loc,
2376 Condition => New_Occurrence_Of (Set_Tag, Loc),
2377 Then_Statements => Init_Tags_List));
2379 -- We have inherited table of the parent from the CPP side.
2380 -- Now we fill the slots associated with Ada primitives.
2381 -- This needs more work to avoid its execution each time
2382 -- an object is initialized???
2389 E := First_Elmt (Primitive_Operations (Rec_Type));
2390 while Present (E) loop
2393 if not Is_Imported (Prim)
2394 and then Convention (Prim) = Convention_CPP
2395 and then not Present (Interface_Alias (Prim))
2397 Append_List_To (Init_Tags_List,
2398 Register_Primitive (Loc, Prim => Prim));
2407 -- Ada 2005 (AI-251): Initialize the secondary tag components
2408 -- located at variable positions. We delay the generation of this
2409 -- code until here because the value of the attribute 'Position
2410 -- applied to variable size components of the parent type that
2411 -- depend on discriminants is only safely read at runtime after
2412 -- the parent components have been initialized.
2414 if Ada_Version >= Ada_05
2415 and then not Is_Interface (Rec_Type)
2416 and then Has_Interfaces (Rec_Type)
2417 and then Has_Discriminants (Etype (Rec_Type))
2418 and then Is_Variable_Size_Record (Etype (Rec_Type))
2420 Init_Tags_List := New_List;
2424 Target => Make_Identifier (Loc, Name_uInit),
2425 Stmts_List => Init_Tags_List,
2426 Fixed_Comps => False,
2427 Variable_Comps => True);
2429 if Is_Non_Empty_List (Init_Tags_List) then
2430 Append_List_To (Body_Stmts, Init_Tags_List);
2435 Handled_Stmt_Node := New_Node (N_Handled_Sequence_Of_Statements, Loc);
2436 Set_Statements (Handled_Stmt_Node, Body_Stmts);
2437 Set_Exception_Handlers (Handled_Stmt_Node, No_List);
2438 Set_Handled_Statement_Sequence (Body_Node, Handled_Stmt_Node);
2440 if not Debug_Generated_Code then
2441 Set_Debug_Info_Off (Proc_Id);
2444 -- Associate Init_Proc with type, and determine if the procedure
2445 -- is null (happens because of the Initialize_Scalars pragma case,
2446 -- where we have to generate a null procedure in case it is called
2447 -- by a client with Initialize_Scalars set). Such procedures have
2448 -- to be generated, but do not have to be called, so we mark them
2449 -- as null to suppress the call.
2451 Set_Init_Proc (Rec_Type, Proc_Id);
2453 if List_Length (Body_Stmts) = 1
2454 and then Nkind (First (Body_Stmts)) = N_Null_Statement
2455 and then VM_Target /= CLI_Target
2457 -- Even though the init proc may be null at this time it might get
2458 -- some stuff added to it later by the CIL backend, so always keep
2459 -- it when VM_Target = CLI_Target.
2461 Set_Is_Null_Init_Proc (Proc_Id);
2463 end Build_Init_Procedure;
2465 ---------------------------
2466 -- Build_Init_Statements --
2467 ---------------------------
2469 function Build_Init_Statements (Comp_List : Node_Id) return List_Id is
2470 Check_List : constant List_Id := New_List;
2475 Statement_List : List_Id;
2480 Per_Object_Constraint_Components : Boolean;
2482 function Has_Access_Constraint (E : Entity_Id) return Boolean;
2483 -- Components with access discriminants that depend on the current
2484 -- instance must be initialized after all other components.
2486 ---------------------------
2487 -- Has_Access_Constraint --
2488 ---------------------------
2490 function Has_Access_Constraint (E : Entity_Id) return Boolean is
2492 T : constant Entity_Id := Etype (E);
2495 if Has_Per_Object_Constraint (E)
2496 and then Has_Discriminants (T)
2498 Disc := First_Discriminant (T);
2499 while Present (Disc) loop
2500 if Is_Access_Type (Etype (Disc)) then
2504 Next_Discriminant (Disc);
2511 end Has_Access_Constraint;
2513 -- Start of processing for Build_Init_Statements
2516 if Null_Present (Comp_List) then
2517 return New_List (Make_Null_Statement (Loc));
2520 Statement_List := New_List;
2522 -- Loop through visible declarations of task types and protected
2523 -- types moving any expanded code from the spec to the body of the
2526 if Is_Task_Record_Type (Rec_Type)
2527 or else Is_Protected_Record_Type (Rec_Type)
2530 Decl : constant Node_Id :=
2531 Parent (Corresponding_Concurrent_Type (Rec_Type));
2537 if Is_Task_Record_Type (Rec_Type) then
2538 Def := Task_Definition (Decl);
2540 Def := Protected_Definition (Decl);
2543 if Present (Def) then
2544 N1 := First (Visible_Declarations (Def));
2545 while Present (N1) loop
2549 if Nkind (N2) in N_Statement_Other_Than_Procedure_Call
2550 or else Nkind (N2) in N_Raise_xxx_Error
2551 or else Nkind (N2) = N_Procedure_Call_Statement
2553 Append_To (Statement_List,
2554 New_Copy_Tree (N2, New_Scope => Proc_Id));
2555 Rewrite (N2, Make_Null_Statement (Sloc (N2)));
2563 -- Loop through components, skipping pragmas, in 2 steps. The first
2564 -- step deals with regular components. The second step deals with
2565 -- components have per object constraints, and no explicit initia-
2568 Per_Object_Constraint_Components := False;
2570 -- First step : regular components
2572 Decl := First_Non_Pragma (Component_Items (Comp_List));
2573 while Present (Decl) loop
2576 (Subtype_Indication (Component_Definition (Decl)), Check_List);
2578 Id := Defining_Identifier (Decl);
2581 if Has_Access_Constraint (Id)
2582 and then No (Expression (Decl))
2584 -- Skip processing for now and ask for a second pass
2586 Per_Object_Constraint_Components := True;
2589 -- Case of explicit initialization
2591 if Present (Expression (Decl)) then
2592 Stmts := Build_Assignment (Id, Expression (Decl));
2594 -- Case of composite component with its own Init_Proc
2596 elsif not Is_Interface (Typ)
2597 and then Has_Non_Null_Base_Init_Proc (Typ)
2600 Build_Initialization_Call
2602 Make_Selected_Component (Loc,
2603 Prefix => Make_Identifier (Loc, Name_uInit),
2604 Selector_Name => New_Occurrence_Of (Id, Loc)),
2606 In_Init_Proc => True,
2607 Enclos_Type => Rec_Type,
2608 Discr_Map => Discr_Map);
2610 Clean_Task_Names (Typ, Proc_Id);
2612 -- Case of component needing simple initialization
2614 elsif Component_Needs_Simple_Initialization (Typ) then
2617 (Id, Get_Simple_Init_Val (Typ, N, Esize (Id)));
2619 -- Nothing needed for this case
2625 if Present (Check_List) then
2626 Append_List_To (Statement_List, Check_List);
2629 if Present (Stmts) then
2631 -- Add the initialization of the record controller before
2632 -- the _Parent field is attached to it when the attachment
2633 -- can occur. It does not work to simply initialize the
2634 -- controller first: it must be initialized after the parent
2635 -- if the parent holds discriminants that can be used to
2636 -- compute the offset of the controller. We assume here that
2637 -- the last statement of the initialization call is the
2638 -- attachment of the parent (see Build_Initialization_Call)
2640 if Chars (Id) = Name_uController
2641 and then Rec_Type /= Etype (Rec_Type)
2642 and then Has_Controlled_Component (Etype (Rec_Type))
2643 and then Has_New_Controlled_Component (Rec_Type)
2644 and then Present (Last (Statement_List))
2646 Insert_List_Before (Last (Statement_List), Stmts);
2648 Append_List_To (Statement_List, Stmts);
2653 Next_Non_Pragma (Decl);
2656 if Per_Object_Constraint_Components then
2658 -- Second pass: components with per-object constraints
2660 Decl := First_Non_Pragma (Component_Items (Comp_List));
2661 while Present (Decl) loop
2663 Id := Defining_Identifier (Decl);
2666 if Has_Access_Constraint (Id)
2667 and then No (Expression (Decl))
2669 if Has_Non_Null_Base_Init_Proc (Typ) then
2670 Append_List_To (Statement_List,
2671 Build_Initialization_Call (Loc,
2672 Make_Selected_Component (Loc,
2673 Prefix => Make_Identifier (Loc, Name_uInit),
2674 Selector_Name => New_Occurrence_Of (Id, Loc)),
2676 In_Init_Proc => True,
2677 Enclos_Type => Rec_Type,
2678 Discr_Map => Discr_Map));
2680 Clean_Task_Names (Typ, Proc_Id);
2682 elsif Component_Needs_Simple_Initialization (Typ) then
2683 Append_List_To (Statement_List,
2685 (Id, Get_Simple_Init_Val (Typ, N, Esize (Id))));
2689 Next_Non_Pragma (Decl);
2693 -- Process the variant part
2695 if Present (Variant_Part (Comp_List)) then
2696 Alt_List := New_List;
2697 Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
2698 while Present (Variant) loop
2699 Loc := Sloc (Variant);
2700 Append_To (Alt_List,
2701 Make_Case_Statement_Alternative (Loc,
2703 New_Copy_List (Discrete_Choices (Variant)),
2705 Build_Init_Statements (Component_List (Variant))));
2706 Next_Non_Pragma (Variant);
2709 -- The expression of the case statement which is a reference
2710 -- to one of the discriminants is replaced by the appropriate
2711 -- formal parameter of the initialization procedure.
2713 Append_To (Statement_List,
2714 Make_Case_Statement (Loc,
2716 New_Reference_To (Discriminal (
2717 Entity (Name (Variant_Part (Comp_List)))), Loc),
2718 Alternatives => Alt_List));
2721 -- For a task record type, add the task create call and calls
2722 -- to bind any interrupt (signal) entries.
2724 if Is_Task_Record_Type (Rec_Type) then
2726 -- In the case of the restricted run time the ATCB has already
2727 -- been preallocated.
2729 if Restricted_Profile then
2730 Append_To (Statement_List,
2731 Make_Assignment_Statement (Loc,
2732 Name => Make_Selected_Component (Loc,
2733 Prefix => Make_Identifier (Loc, Name_uInit),
2734 Selector_Name => Make_Identifier (Loc, Name_uTask_Id)),
2735 Expression => Make_Attribute_Reference (Loc,
2737 Make_Selected_Component (Loc,
2738 Prefix => Make_Identifier (Loc, Name_uInit),
2740 Make_Identifier (Loc, Name_uATCB)),
2741 Attribute_Name => Name_Unchecked_Access)));
2744 Append_To (Statement_List, Make_Task_Create_Call (Rec_Type));
2746 -- Generate the statements which map a string entry name to a
2747 -- task entry index. Note that the task may not have entries.
2749 if Entry_Names_OK then
2750 Names := Build_Entry_Names (Rec_Type);
2752 if Present (Names) then
2753 Append_To (Statement_List, Names);
2758 Task_Type : constant Entity_Id :=
2759 Corresponding_Concurrent_Type (Rec_Type);
2760 Task_Decl : constant Node_Id := Parent (Task_Type);
2761 Task_Def : constant Node_Id := Task_Definition (Task_Decl);
2766 if Present (Task_Def) then
2767 Vis_Decl := First (Visible_Declarations (Task_Def));
2768 while Present (Vis_Decl) loop
2769 Loc := Sloc (Vis_Decl);
2771 if Nkind (Vis_Decl) = N_Attribute_Definition_Clause then
2772 if Get_Attribute_Id (Chars (Vis_Decl)) =
2775 Ent := Entity (Name (Vis_Decl));
2777 if Ekind (Ent) = E_Entry then
2778 Append_To (Statement_List,
2779 Make_Procedure_Call_Statement (Loc,
2780 Name => New_Reference_To (
2781 RTE (RE_Bind_Interrupt_To_Entry), Loc),
2782 Parameter_Associations => New_List (
2783 Make_Selected_Component (Loc,
2785 Make_Identifier (Loc, Name_uInit),
2787 Make_Identifier (Loc, Name_uTask_Id)),
2788 Entry_Index_Expression (
2789 Loc, Ent, Empty, Task_Type),
2790 Expression (Vis_Decl))));
2801 -- For a protected type, add statements generated by
2802 -- Make_Initialize_Protection.
2804 if Is_Protected_Record_Type (Rec_Type) then
2805 Append_List_To (Statement_List,
2806 Make_Initialize_Protection (Rec_Type));
2808 -- Generate the statements which map a string entry name to a
2809 -- protected entry index. Note that the protected type may not
2812 if Entry_Names_OK then
2813 Names := Build_Entry_Names (Rec_Type);
2815 if Present (Names) then
2816 Append_To (Statement_List, Names);
2821 -- If no initializations when generated for component declarations
2822 -- corresponding to this Statement_List, append a null statement
2823 -- to the Statement_List to make it a valid Ada tree.
2825 if Is_Empty_List (Statement_List) then
2826 Append (New_Node (N_Null_Statement, Loc), Statement_List);
2829 return Statement_List;
2832 when RE_Not_Available =>
2834 end Build_Init_Statements;
2836 -------------------------
2837 -- Build_Record_Checks --
2838 -------------------------
2840 procedure Build_Record_Checks (S : Node_Id; Check_List : List_Id) is
2841 Subtype_Mark_Id : Entity_Id;
2844 if Nkind (S) = N_Subtype_Indication then
2845 Find_Type (Subtype_Mark (S));
2846 Subtype_Mark_Id := Entity (Subtype_Mark (S));
2848 -- Remaining processing depends on type
2850 case Ekind (Subtype_Mark_Id) is
2853 Constrain_Array (S, Check_List);
2859 end Build_Record_Checks;
2861 -------------------------------------------
2862 -- Component_Needs_Simple_Initialization --
2863 -------------------------------------------
2865 function Component_Needs_Simple_Initialization
2866 (T : Entity_Id) return Boolean
2870 Needs_Simple_Initialization (T)
2871 and then not Is_RTE (T, RE_Tag)
2873 -- Ada 2005 (AI-251): Check also the tag of abstract interfaces
2875 and then not Is_RTE (T, RE_Interface_Tag);
2876 end Component_Needs_Simple_Initialization;
2878 ---------------------
2879 -- Constrain_Array --
2880 ---------------------
2882 procedure Constrain_Array
2884 Check_List : List_Id)
2886 C : constant Node_Id := Constraint (SI);
2887 Number_Of_Constraints : Nat := 0;
2892 T := Entity (Subtype_Mark (SI));
2894 if Ekind (T) in Access_Kind then
2895 T := Designated_Type (T);
2898 S := First (Constraints (C));
2900 while Present (S) loop
2901 Number_Of_Constraints := Number_Of_Constraints + 1;
2905 -- In either case, the index constraint must provide a discrete
2906 -- range for each index of the array type and the type of each
2907 -- discrete range must be the same as that of the corresponding
2908 -- index. (RM 3.6.1)
2910 S := First (Constraints (C));
2911 Index := First_Index (T);
2914 -- Apply constraints to each index type
2916 for J in 1 .. Number_Of_Constraints loop
2917 Constrain_Index (Index, S, Check_List);
2922 end Constrain_Array;
2924 ---------------------
2925 -- Constrain_Index --
2926 ---------------------
2928 procedure Constrain_Index
2931 Check_List : List_Id)
2933 T : constant Entity_Id := Etype (Index);
2936 if Nkind (S) = N_Range then
2937 Process_Range_Expr_In_Decl (S, T, Check_List);
2939 end Constrain_Index;
2941 --------------------------------------
2942 -- Parent_Subtype_Renaming_Discrims --
2943 --------------------------------------
2945 function Parent_Subtype_Renaming_Discrims return Boolean is
2950 if Base_Type (Pe) /= Pe then
2955 or else not Has_Discriminants (Pe)
2956 or else Is_Constrained (Pe)
2957 or else Is_Tagged_Type (Pe)
2962 -- If there are no explicit stored discriminants we have inherited
2963 -- the root type discriminants so far, so no renamings occurred.
2965 if First_Discriminant (Pe) = First_Stored_Discriminant (Pe) then
2969 -- Check if we have done some trivial renaming of the parent
2970 -- discriminants, i.e. something like
2972 -- type DT (X1,X2: int) is new PT (X1,X2);
2974 De := First_Discriminant (Pe);
2975 Dp := First_Discriminant (Etype (Pe));
2977 while Present (De) loop
2978 pragma Assert (Present (Dp));
2980 if Corresponding_Discriminant (De) /= Dp then
2984 Next_Discriminant (De);
2985 Next_Discriminant (Dp);
2988 return Present (Dp);
2989 end Parent_Subtype_Renaming_Discrims;
2991 ------------------------
2992 -- Requires_Init_Proc --
2993 ------------------------
2995 function Requires_Init_Proc (Rec_Id : Entity_Id) return Boolean is
2996 Comp_Decl : Node_Id;
3001 -- Definitely do not need one if specifically suppressed
3003 if Suppress_Init_Proc (Rec_Id) then
3007 -- If it is a type derived from a type with unknown discriminants,
3008 -- we cannot build an initialization procedure for it.
3010 if Has_Unknown_Discriminants (Rec_Id) then
3014 -- Otherwise we need to generate an initialization procedure if
3015 -- Is_CPP_Class is False and at least one of the following applies:
3017 -- 1. Discriminants are present, since they need to be initialized
3018 -- with the appropriate discriminant constraint expressions.
3019 -- However, the discriminant of an unchecked union does not
3020 -- count, since the discriminant is not present.
3022 -- 2. The type is a tagged type, since the implicit Tag component
3023 -- needs to be initialized with a pointer to the dispatch table.
3025 -- 3. The type contains tasks
3027 -- 4. One or more components has an initial value
3029 -- 5. One or more components is for a type which itself requires
3030 -- an initialization procedure.
3032 -- 6. One or more components is a type that requires simple
3033 -- initialization (see Needs_Simple_Initialization), except
3034 -- that types Tag and Interface_Tag are excluded, since fields
3035 -- of these types are initialized by other means.
3037 -- 7. The type is the record type built for a task type (since at
3038 -- the very least, Create_Task must be called)
3040 -- 8. The type is the record type built for a protected type (since
3041 -- at least Initialize_Protection must be called)
3043 -- 9. The type is marked as a public entity. The reason we add this
3044 -- case (even if none of the above apply) is to properly handle
3045 -- Initialize_Scalars. If a package is compiled without an IS
3046 -- pragma, and the client is compiled with an IS pragma, then
3047 -- the client will think an initialization procedure is present
3048 -- and call it, when in fact no such procedure is required, but
3049 -- since the call is generated, there had better be a routine
3050 -- at the other end of the call, even if it does nothing!)
3052 -- Note: the reason we exclude the CPP_Class case is because in this
3053 -- case the initialization is performed in the C++ side.
3055 if Is_CPP_Class (Rec_Id) then
3058 elsif Is_Interface (Rec_Id) then
3061 elsif (Has_Discriminants (Rec_Id)
3062 and then not Is_Unchecked_Union (Rec_Id))
3063 or else Is_Tagged_Type (Rec_Id)
3064 or else Is_Concurrent_Record_Type (Rec_Id)
3065 or else Has_Task (Rec_Id)
3070 Id := First_Component (Rec_Id);
3071 while Present (Id) loop
3072 Comp_Decl := Parent (Id);
3075 if Present (Expression (Comp_Decl))
3076 or else Has_Non_Null_Base_Init_Proc (Typ)
3077 or else Component_Needs_Simple_Initialization (Typ)
3082 Next_Component (Id);
3085 -- As explained above, a record initialization procedure is needed
3086 -- for public types in case Initialize_Scalars applies to a client.
3087 -- However, such a procedure is not needed in the case where either
3088 -- of restrictions No_Initialize_Scalars or No_Default_Initialization
3089 -- applies. No_Initialize_Scalars excludes the possibility of using
3090 -- Initialize_Scalars in any partition, and No_Default_Initialization
3091 -- implies that no initialization should ever be done for objects of
3092 -- the type, so is incompatible with Initialize_Scalars.
3094 if not Restriction_Active (No_Initialize_Scalars)
3095 and then not Restriction_Active (No_Default_Initialization)
3096 and then Is_Public (Rec_Id)
3102 end Requires_Init_Proc;
3104 -- Start of processing for Build_Record_Init_Proc
3107 -- Check for value type, which means no initialization required
3109 Rec_Type := Defining_Identifier (N);
3111 if Is_Value_Type (Rec_Type) then
3115 -- This may be full declaration of a private type, in which case
3116 -- the visible entity is a record, and the private entity has been
3117 -- exchanged with it in the private part of the current package.
3118 -- The initialization procedure is built for the record type, which
3119 -- is retrievable from the private entity.
3121 if Is_Incomplete_Or_Private_Type (Rec_Type) then
3122 Rec_Type := Underlying_Type (Rec_Type);
3125 -- If there are discriminants, build the discriminant map to replace
3126 -- discriminants by their discriminals in complex bound expressions.
3127 -- These only arise for the corresponding records of synchronized types.
3129 if Is_Concurrent_Record_Type (Rec_Type)
3130 and then Has_Discriminants (Rec_Type)
3135 Disc := First_Discriminant (Rec_Type);
3136 while Present (Disc) loop
3137 Append_Elmt (Disc, Discr_Map);
3138 Append_Elmt (Discriminal (Disc), Discr_Map);
3139 Next_Discriminant (Disc);
3144 -- Derived types that have no type extension can use the initialization
3145 -- procedure of their parent and do not need a procedure of their own.
3146 -- This is only correct if there are no representation clauses for the
3147 -- type or its parent, and if the parent has in fact been frozen so
3148 -- that its initialization procedure exists.
3150 if Is_Derived_Type (Rec_Type)
3151 and then not Is_Tagged_Type (Rec_Type)
3152 and then not Is_Unchecked_Union (Rec_Type)
3153 and then not Has_New_Non_Standard_Rep (Rec_Type)
3154 and then not Parent_Subtype_Renaming_Discrims
3155 and then Has_Non_Null_Base_Init_Proc (Etype (Rec_Type))
3157 Copy_TSS (Base_Init_Proc (Etype (Rec_Type)), Rec_Type);
3159 -- Otherwise if we need an initialization procedure, then build one,
3160 -- mark it as public and inlinable and as having a completion.
3162 elsif Requires_Init_Proc (Rec_Type)
3163 or else Is_Unchecked_Union (Rec_Type)
3166 Make_Defining_Identifier (Loc,
3167 Chars => Make_Init_Proc_Name (Rec_Type));
3169 -- If No_Default_Initialization restriction is active, then we don't
3170 -- want to build an init_proc, but we need to mark that an init_proc
3171 -- would be needed if this restriction was not active (so that we can
3172 -- detect attempts to call it), so set a dummy init_proc in place.
3174 if Restriction_Active (No_Default_Initialization) then
3175 Set_Init_Proc (Rec_Type, Proc_Id);
3179 Build_Offset_To_Top_Functions;
3180 Build_Init_Procedure;
3181 Set_Is_Public (Proc_Id, Is_Public (Pe));
3183 -- The initialization of protected records is not worth inlining.
3184 -- In addition, when compiled for another unit for inlining purposes,
3185 -- it may make reference to entities that have not been elaborated
3186 -- yet. The initialization of controlled records contains a nested
3187 -- clean-up procedure that makes it impractical to inline as well,
3188 -- and leads to undefined symbols if inlined in a different unit.
3189 -- Similar considerations apply to task types.
3191 if not Is_Concurrent_Type (Rec_Type)
3192 and then not Has_Task (Rec_Type)
3193 and then not Needs_Finalization (Rec_Type)
3195 Set_Is_Inlined (Proc_Id);
3198 Set_Is_Internal (Proc_Id);
3199 Set_Has_Completion (Proc_Id);
3201 if not Debug_Generated_Code then
3202 Set_Debug_Info_Off (Proc_Id);
3206 Agg : constant Node_Id :=
3207 Build_Equivalent_Record_Aggregate (Rec_Type);
3209 procedure Collect_Itypes (Comp : Node_Id);
3210 -- Generate references to itypes in the aggregate, because
3211 -- the first use of the aggregate may be in a nested scope.
3213 --------------------
3214 -- Collect_Itypes --
3215 --------------------
3217 procedure Collect_Itypes (Comp : Node_Id) is
3220 Typ : constant Entity_Id := Etype (Comp);
3223 if Is_Array_Type (Typ)
3224 and then Is_Itype (Typ)
3226 Ref := Make_Itype_Reference (Loc);
3227 Set_Itype (Ref, Typ);
3228 Append_Freeze_Action (Rec_Type, Ref);
3230 Ref := Make_Itype_Reference (Loc);
3231 Set_Itype (Ref, Etype (First_Index (Typ)));
3232 Append_Freeze_Action (Rec_Type, Ref);
3234 Sub_Aggr := First (Expressions (Comp));
3236 -- Recurse on nested arrays
3238 while Present (Sub_Aggr) loop
3239 Collect_Itypes (Sub_Aggr);
3246 -- If there is a static initialization aggregate for the type,
3247 -- generate itype references for the types of its (sub)components,
3248 -- to prevent out-of-scope errors in the resulting tree.
3249 -- The aggregate may have been rewritten as a Raise node, in which
3250 -- case there are no relevant itypes.
3253 and then Nkind (Agg) = N_Aggregate
3255 Set_Static_Initialization (Proc_Id, Agg);
3260 Comp := First (Component_Associations (Agg));
3261 while Present (Comp) loop
3262 Collect_Itypes (Expression (Comp));
3269 end Build_Record_Init_Proc;
3271 ----------------------------
3272 -- Build_Slice_Assignment --
3273 ----------------------------
3275 -- Generates the following subprogram:
3278 -- (Source, Target : Array_Type,
3279 -- Left_Lo, Left_Hi : Index;
3280 -- Right_Lo, Right_Hi : Index;
3288 -- if Left_Hi < Left_Lo then
3301 -- Target (Li1) := Source (Ri1);
3304 -- exit when Li1 = Left_Lo;
3305 -- Li1 := Index'pred (Li1);
3306 -- Ri1 := Index'pred (Ri1);
3308 -- exit when Li1 = Left_Hi;
3309 -- Li1 := Index'succ (Li1);
3310 -- Ri1 := Index'succ (Ri1);
3315 procedure Build_Slice_Assignment (Typ : Entity_Id) is
3316 Loc : constant Source_Ptr := Sloc (Typ);
3317 Index : constant Entity_Id := Base_Type (Etype (First_Index (Typ)));
3319 -- Build formal parameters of procedure
3321 Larray : constant Entity_Id :=
3322 Make_Defining_Identifier
3323 (Loc, Chars => New_Internal_Name ('A'));
3324 Rarray : constant Entity_Id :=
3325 Make_Defining_Identifier
3326 (Loc, Chars => New_Internal_Name ('R'));
3327 Left_Lo : constant Entity_Id :=
3328 Make_Defining_Identifier
3329 (Loc, Chars => New_Internal_Name ('L'));
3330 Left_Hi : constant Entity_Id :=
3331 Make_Defining_Identifier
3332 (Loc, Chars => New_Internal_Name ('L'));
3333 Right_Lo : constant Entity_Id :=
3334 Make_Defining_Identifier
3335 (Loc, Chars => New_Internal_Name ('R'));
3336 Right_Hi : constant Entity_Id :=
3337 Make_Defining_Identifier
3338 (Loc, Chars => New_Internal_Name ('R'));
3339 Rev : constant Entity_Id :=
3340 Make_Defining_Identifier
3341 (Loc, Chars => New_Internal_Name ('D'));
3342 Proc_Name : constant Entity_Id :=
3343 Make_Defining_Identifier (Loc,
3344 Chars => Make_TSS_Name (Typ, TSS_Slice_Assign));
3346 Lnn : constant Entity_Id :=
3347 Make_Defining_Identifier (Loc, New_Internal_Name ('L'));
3348 Rnn : constant Entity_Id :=
3349 Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
3350 -- Subscripts for left and right sides
3357 -- Build declarations for indices
3362 Make_Object_Declaration (Loc,
3363 Defining_Identifier => Lnn,
3364 Object_Definition =>
3365 New_Occurrence_Of (Index, Loc)));
3368 Make_Object_Declaration (Loc,
3369 Defining_Identifier => Rnn,
3370 Object_Definition =>
3371 New_Occurrence_Of (Index, Loc)));
3375 -- Build test for empty slice case
3378 Make_If_Statement (Loc,
3381 Left_Opnd => New_Occurrence_Of (Left_Hi, Loc),
3382 Right_Opnd => New_Occurrence_Of (Left_Lo, Loc)),
3383 Then_Statements => New_List (Make_Simple_Return_Statement (Loc))));
3385 -- Build initializations for indices
3388 F_Init : constant List_Id := New_List;
3389 B_Init : constant List_Id := New_List;
3393 Make_Assignment_Statement (Loc,
3394 Name => New_Occurrence_Of (Lnn, Loc),
3395 Expression => New_Occurrence_Of (Left_Lo, Loc)));
3398 Make_Assignment_Statement (Loc,
3399 Name => New_Occurrence_Of (Rnn, Loc),
3400 Expression => New_Occurrence_Of (Right_Lo, Loc)));
3403 Make_Assignment_Statement (Loc,
3404 Name => New_Occurrence_Of (Lnn, Loc),
3405 Expression => New_Occurrence_Of (Left_Hi, Loc)));
3408 Make_Assignment_Statement (Loc,
3409 Name => New_Occurrence_Of (Rnn, Loc),
3410 Expression => New_Occurrence_Of (Right_Hi, Loc)));
3413 Make_If_Statement (Loc,
3414 Condition => New_Occurrence_Of (Rev, Loc),
3415 Then_Statements => B_Init,
3416 Else_Statements => F_Init));
3419 -- Now construct the assignment statement
3422 Make_Loop_Statement (Loc,
3423 Statements => New_List (
3424 Make_Assignment_Statement (Loc,
3426 Make_Indexed_Component (Loc,
3427 Prefix => New_Occurrence_Of (Larray, Loc),
3428 Expressions => New_List (New_Occurrence_Of (Lnn, Loc))),
3430 Make_Indexed_Component (Loc,
3431 Prefix => New_Occurrence_Of (Rarray, Loc),
3432 Expressions => New_List (New_Occurrence_Of (Rnn, Loc))))),
3433 End_Label => Empty);
3435 -- Build the exit condition and increment/decrement statements
3438 F_Ass : constant List_Id := New_List;
3439 B_Ass : constant List_Id := New_List;
3443 Make_Exit_Statement (Loc,
3446 Left_Opnd => New_Occurrence_Of (Lnn, Loc),
3447 Right_Opnd => New_Occurrence_Of (Left_Hi, Loc))));
3450 Make_Assignment_Statement (Loc,
3451 Name => New_Occurrence_Of (Lnn, Loc),
3453 Make_Attribute_Reference (Loc,
3455 New_Occurrence_Of (Index, Loc),
3456 Attribute_Name => Name_Succ,
3457 Expressions => New_List (
3458 New_Occurrence_Of (Lnn, Loc)))));
3461 Make_Assignment_Statement (Loc,
3462 Name => New_Occurrence_Of (Rnn, Loc),
3464 Make_Attribute_Reference (Loc,
3466 New_Occurrence_Of (Index, Loc),
3467 Attribute_Name => Name_Succ,
3468 Expressions => New_List (
3469 New_Occurrence_Of (Rnn, Loc)))));
3472 Make_Exit_Statement (Loc,
3475 Left_Opnd => New_Occurrence_Of (Lnn, Loc),
3476 Right_Opnd => New_Occurrence_Of (Left_Lo, Loc))));
3479 Make_Assignment_Statement (Loc,
3480 Name => New_Occurrence_Of (Lnn, Loc),
3482 Make_Attribute_Reference (Loc,
3484 New_Occurrence_Of (Index, Loc),
3485 Attribute_Name => Name_Pred,
3486 Expressions => New_List (
3487 New_Occurrence_Of (Lnn, Loc)))));
3490 Make_Assignment_Statement (Loc,
3491 Name => New_Occurrence_Of (Rnn, Loc),
3493 Make_Attribute_Reference (Loc,
3495 New_Occurrence_Of (Index, Loc),
3496 Attribute_Name => Name_Pred,
3497 Expressions => New_List (
3498 New_Occurrence_Of (Rnn, Loc)))));
3500 Append_To (Statements (Loops),
3501 Make_If_Statement (Loc,
3502 Condition => New_Occurrence_Of (Rev, Loc),
3503 Then_Statements => B_Ass,
3504 Else_Statements => F_Ass));
3507 Append_To (Stats, Loops);
3511 Formals : List_Id := New_List;
3514 Formals := New_List (
3515 Make_Parameter_Specification (Loc,
3516 Defining_Identifier => Larray,
3517 Out_Present => True,
3519 New_Reference_To (Base_Type (Typ), Loc)),
3521 Make_Parameter_Specification (Loc,
3522 Defining_Identifier => Rarray,
3524 New_Reference_To (Base_Type (Typ), Loc)),
3526 Make_Parameter_Specification (Loc,
3527 Defining_Identifier => Left_Lo,
3529 New_Reference_To (Index, Loc)),
3531 Make_Parameter_Specification (Loc,
3532 Defining_Identifier => Left_Hi,
3534 New_Reference_To (Index, Loc)),
3536 Make_Parameter_Specification (Loc,
3537 Defining_Identifier => Right_Lo,
3539 New_Reference_To (Index, Loc)),
3541 Make_Parameter_Specification (Loc,
3542 Defining_Identifier => Right_Hi,
3544 New_Reference_To (Index, Loc)));
3547 Make_Parameter_Specification (Loc,
3548 Defining_Identifier => Rev,
3550 New_Reference_To (Standard_Boolean, Loc)));
3553 Make_Procedure_Specification (Loc,
3554 Defining_Unit_Name => Proc_Name,
3555 Parameter_Specifications => Formals);
3558 Make_Subprogram_Body (Loc,
3559 Specification => Spec,
3560 Declarations => Decls,
3561 Handled_Statement_Sequence =>
3562 Make_Handled_Sequence_Of_Statements (Loc,
3563 Statements => Stats)));
3566 Set_TSS (Typ, Proc_Name);
3567 Set_Is_Pure (Proc_Name);
3568 end Build_Slice_Assignment;
3570 ------------------------------------
3571 -- Build_Variant_Record_Equality --
3572 ------------------------------------
3576 -- function _Equality (X, Y : T) return Boolean is
3578 -- -- Compare discriminants
3580 -- if False or else X.D1 /= Y.D1 or else X.D2 /= Y.D2 then
3584 -- -- Compare components
3586 -- if False or else X.C1 /= Y.C1 or else X.C2 /= Y.C2 then
3590 -- -- Compare variant part
3594 -- if False or else X.C2 /= Y.C2 or else X.C3 /= Y.C3 then
3599 -- if False or else X.Cn /= Y.Cn then
3607 procedure Build_Variant_Record_Equality (Typ : Entity_Id) is
3608 Loc : constant Source_Ptr := Sloc (Typ);
3610 F : constant Entity_Id :=
3611 Make_Defining_Identifier (Loc,
3612 Chars => Make_TSS_Name (Typ, TSS_Composite_Equality));
3614 X : constant Entity_Id :=
3615 Make_Defining_Identifier (Loc,
3618 Y : constant Entity_Id :=
3619 Make_Defining_Identifier (Loc,
3622 Def : constant Node_Id := Parent (Typ);
3623 Comps : constant Node_Id := Component_List (Type_Definition (Def));
3624 Stmts : constant List_Id := New_List;
3625 Pspecs : constant List_Id := New_List;
3628 -- Derived Unchecked_Union types no longer inherit the equality function
3631 if Is_Derived_Type (Typ)
3632 and then not Is_Unchecked_Union (Typ)
3633 and then not Has_New_Non_Standard_Rep (Typ)
3636 Parent_Eq : constant Entity_Id :=
3637 TSS (Root_Type (Typ), TSS_Composite_Equality);
3640 if Present (Parent_Eq) then
3641 Copy_TSS (Parent_Eq, Typ);
3648 Make_Subprogram_Body (Loc,
3650 Make_Function_Specification (Loc,
3651 Defining_Unit_Name => F,
3652 Parameter_Specifications => Pspecs,
3653 Result_Definition => New_Reference_To (Standard_Boolean, Loc)),
3654 Declarations => New_List,
3655 Handled_Statement_Sequence =>
3656 Make_Handled_Sequence_Of_Statements (Loc,
3657 Statements => Stmts)));
3660 Make_Parameter_Specification (Loc,
3661 Defining_Identifier => X,
3662 Parameter_Type => New_Reference_To (Typ, Loc)));
3665 Make_Parameter_Specification (Loc,
3666 Defining_Identifier => Y,
3667 Parameter_Type => New_Reference_To (Typ, Loc)));
3669 -- Unchecked_Unions require additional machinery to support equality.
3670 -- Two extra parameters (A and B) are added to the equality function
3671 -- parameter list in order to capture the inferred values of the
3672 -- discriminants in later calls.
3674 if Is_Unchecked_Union (Typ) then
3676 Discr_Type : constant Node_Id := Etype (First_Discriminant (Typ));
3678 A : constant Node_Id :=
3679 Make_Defining_Identifier (Loc,
3682 B : constant Node_Id :=
3683 Make_Defining_Identifier (Loc,
3687 -- Add A and B to the parameter list
3690 Make_Parameter_Specification (Loc,
3691 Defining_Identifier => A,
3692 Parameter_Type => New_Reference_To (Discr_Type, Loc)));
3695 Make_Parameter_Specification (Loc,
3696 Defining_Identifier => B,
3697 Parameter_Type => New_Reference_To (Discr_Type, Loc)));
3699 -- Generate the following header code to compare the inferred
3707 Make_If_Statement (Loc,
3710 Left_Opnd => New_Reference_To (A, Loc),
3711 Right_Opnd => New_Reference_To (B, Loc)),
3712 Then_Statements => New_List (
3713 Make_Simple_Return_Statement (Loc,
3714 Expression => New_Occurrence_Of (Standard_False, Loc)))));
3716 -- Generate component-by-component comparison. Note that we must
3717 -- propagate one of the inferred discriminant formals to act as
3718 -- the case statement switch.
3720 Append_List_To (Stmts,
3721 Make_Eq_Case (Typ, Comps, A));
3725 -- Normal case (not unchecked union)
3730 Discriminant_Specifications (Def)));
3732 Append_List_To (Stmts,
3733 Make_Eq_Case (Typ, Comps));
3737 Make_Simple_Return_Statement (Loc,
3738 Expression => New_Reference_To (Standard_True, Loc)));
3743 if not Debug_Generated_Code then
3744 Set_Debug_Info_Off (F);
3746 end Build_Variant_Record_Equality;
3748 -----------------------------
3749 -- Check_Stream_Attributes --
3750 -----------------------------
3752 procedure Check_Stream_Attributes (Typ : Entity_Id) is
3754 Par_Read : constant Boolean :=
3755 Stream_Attribute_Available (Typ, TSS_Stream_Read)
3756 and then not Has_Specified_Stream_Read (Typ);
3757 Par_Write : constant Boolean :=
3758 Stream_Attribute_Available (Typ, TSS_Stream_Write)
3759 and then not Has_Specified_Stream_Write (Typ);
3761 procedure Check_Attr (Nam : Name_Id; TSS_Nam : TSS_Name_Type);
3762 -- Check that Comp has a user-specified Nam stream attribute
3768 procedure Check_Attr (Nam : Name_Id; TSS_Nam : TSS_Name_Type) is
3770 if not Stream_Attribute_Available (Etype (Comp), TSS_Nam) then
3771 Error_Msg_Name_1 := Nam;
3773 ("|component& in limited extension must have% attribute", Comp);
3777 -- Start of processing for Check_Stream_Attributes
3780 if Par_Read or else Par_Write then
3781 Comp := First_Component (Typ);
3782 while Present (Comp) loop
3783 if Comes_From_Source (Comp)
3784 and then Original_Record_Component (Comp) = Comp
3785 and then Is_Limited_Type (Etype (Comp))
3788 Check_Attr (Name_Read, TSS_Stream_Read);
3792 Check_Attr (Name_Write, TSS_Stream_Write);
3796 Next_Component (Comp);
3799 end Check_Stream_Attributes;
3801 -----------------------------
3802 -- Expand_Record_Extension --
3803 -----------------------------
3805 -- Add a field _parent at the beginning of the record extension. This is
3806 -- used to implement inheritance. Here are some examples of expansion:
3808 -- 1. no discriminants
3809 -- type T2 is new T1 with null record;
3811 -- type T2 is new T1 with record
3815 -- 2. renamed discriminants
3816 -- type T2 (B, C : Int) is new T1 (A => B) with record
3817 -- _Parent : T1 (A => B);
3821 -- 3. inherited discriminants
3822 -- type T2 is new T1 with record -- discriminant A inherited
3823 -- _Parent : T1 (A);
3827 procedure Expand_Record_Extension (T : Entity_Id; Def : Node_Id) is
3828 Indic : constant Node_Id := Subtype_Indication (Def);
3829 Loc : constant Source_Ptr := Sloc (Def);
3830 Rec_Ext_Part : Node_Id := Record_Extension_Part (Def);
3831 Par_Subtype : Entity_Id;
3832 Comp_List : Node_Id;
3833 Comp_Decl : Node_Id;
3836 List_Constr : constant List_Id := New_List;
3839 -- Expand_Record_Extension is called directly from the semantics, so
3840 -- we must check to see whether expansion is active before proceeding
3842 if not Expander_Active then
3846 -- This may be a derivation of an untagged private type whose full
3847 -- view is tagged, in which case the Derived_Type_Definition has no
3848 -- extension part. Build an empty one now.
3850 if No (Rec_Ext_Part) then
3852 Make_Record_Definition (Loc,
3854 Component_List => Empty,
3855 Null_Present => True);
3857 Set_Record_Extension_Part (Def, Rec_Ext_Part);
3858 Mark_Rewrite_Insertion (Rec_Ext_Part);
3861 Comp_List := Component_List (Rec_Ext_Part);
3863 Parent_N := Make_Defining_Identifier (Loc, Name_uParent);
3865 -- If the derived type inherits its discriminants the type of the
3866 -- _parent field must be constrained by the inherited discriminants
3868 if Has_Discriminants (T)
3869 and then Nkind (Indic) /= N_Subtype_Indication
3870 and then not Is_Constrained (Entity (Indic))
3872 D := First_Discriminant (T);
3873 while Present (D) loop
3874 Append_To (List_Constr, New_Occurrence_Of (D, Loc));
3875 Next_Discriminant (D);
3880 Make_Subtype_Indication (Loc,
3881 Subtype_Mark => New_Reference_To (Entity (Indic), Loc),
3883 Make_Index_Or_Discriminant_Constraint (Loc,
3884 Constraints => List_Constr)),
3887 -- Otherwise the original subtype_indication is just what is needed
3890 Par_Subtype := Process_Subtype (New_Copy_Tree (Indic), Def);
3893 Set_Parent_Subtype (T, Par_Subtype);
3896 Make_Component_Declaration (Loc,
3897 Defining_Identifier => Parent_N,
3898 Component_Definition =>
3899 Make_Component_Definition (Loc,
3900 Aliased_Present => False,
3901 Subtype_Indication => New_Reference_To (Par_Subtype, Loc)));
3903 if Null_Present (Rec_Ext_Part) then
3904 Set_Component_List (Rec_Ext_Part,
3905 Make_Component_List (Loc,
3906 Component_Items => New_List (Comp_Decl),
3907 Variant_Part => Empty,
3908 Null_Present => False));
3909 Set_Null_Present (Rec_Ext_Part, False);
3911 elsif Null_Present (Comp_List)
3912 or else Is_Empty_List (Component_Items (Comp_List))
3914 Set_Component_Items (Comp_List, New_List (Comp_Decl));
3915 Set_Null_Present (Comp_List, False);
3918 Insert_Before (First (Component_Items (Comp_List)), Comp_Decl);
3921 Analyze (Comp_Decl);
3922 end Expand_Record_Extension;
3924 ------------------------------------
3925 -- Expand_N_Full_Type_Declaration --
3926 ------------------------------------
3928 procedure Expand_N_Full_Type_Declaration (N : Node_Id) is
3929 Def_Id : constant Entity_Id := Defining_Identifier (N);
3930 B_Id : constant Entity_Id := Base_Type (Def_Id);
3934 procedure Build_Master (Def_Id : Entity_Id);
3935 -- Create the master associated with Def_Id
3941 procedure Build_Master (Def_Id : Entity_Id) is
3943 -- Anonymous access types are created for the components of the
3944 -- record parameter for an entry declaration. No master is created
3947 if Has_Task (Designated_Type (Def_Id))
3948 and then Comes_From_Source (N)
3950 Build_Master_Entity (Def_Id);
3951 Build_Master_Renaming (Parent (Def_Id), Def_Id);
3953 -- Create a class-wide master because a Master_Id must be generated
3954 -- for access-to-limited-class-wide types whose root may be extended
3955 -- with task components.
3957 -- Note: This code covers access-to-limited-interfaces because they
3958 -- can be used to reference tasks implementing them.
3960 elsif Is_Class_Wide_Type (Designated_Type (Def_Id))
3961 and then Is_Limited_Type (Designated_Type (Def_Id))
3962 and then Tasking_Allowed
3964 -- Do not create a class-wide master for types whose convention is
3965 -- Java since these types cannot embed Ada tasks anyway. Note that
3966 -- the following test cannot catch the following case:
3968 -- package java.lang.Object is
3969 -- type Typ is tagged limited private;
3970 -- type Ref is access all Typ'Class;
3972 -- type Typ is tagged limited ...;
3973 -- pragma Convention (Typ, Java)
3976 -- Because the convention appears after we have done the
3977 -- processing for type Ref.
3979 and then Convention (Designated_Type (Def_Id)) /= Convention_Java
3980 and then Convention (Designated_Type (Def_Id)) /= Convention_CIL
3982 Build_Class_Wide_Master (Def_Id);
3986 -- Start of processing for Expand_N_Full_Type_Declaration
3989 if Is_Access_Type (Def_Id) then
3990 Build_Master (Def_Id);
3992 if Ekind (Def_Id) = E_Access_Protected_Subprogram_Type then
3993 Expand_Access_Protected_Subprogram_Type (N);
3996 elsif Ada_Version >= Ada_05
3997 and then Is_Array_Type (Def_Id)
3998 and then Is_Access_Type (Component_Type (Def_Id))
3999 and then Ekind (Component_Type (Def_Id)) = E_Anonymous_Access_Type
4001 Build_Master (Component_Type (Def_Id));
4003 elsif Has_Task (Def_Id) then
4004 Expand_Previous_Access_Type (Def_Id);
4006 elsif Ada_Version >= Ada_05
4008 (Is_Record_Type (Def_Id)
4009 or else (Is_Array_Type (Def_Id)
4010 and then Is_Record_Type (Component_Type (Def_Id))))
4018 -- Look for the first anonymous access type component
4020 if Is_Array_Type (Def_Id) then
4021 Comp := First_Entity (Component_Type (Def_Id));
4023 Comp := First_Entity (Def_Id);
4026 while Present (Comp) loop
4027 Typ := Etype (Comp);
4029 exit when Is_Access_Type (Typ)
4030 and then Ekind (Typ) = E_Anonymous_Access_Type;
4035 -- If found we add a renaming declaration of master_id and we
4036 -- associate it to each anonymous access type component. Do
4037 -- nothing if the access type already has a master. This will be
4038 -- the case if the array type is the packed array created for a
4039 -- user-defined array type T, where the master_id is created when
4040 -- expanding the declaration for T.
4043 and then Ekind (Typ) = E_Anonymous_Access_Type
4044 and then not Restriction_Active (No_Task_Hierarchy)
4045 and then No (Master_Id (Typ))
4047 -- Do not consider run-times with no tasking support
4049 and then RTE_Available (RE_Current_Master)
4050 and then Has_Task (Non_Limited_Designated_Type (Typ))
4052 Build_Master_Entity (Def_Id);
4053 M_Id := Build_Master_Renaming (N, Def_Id);
4055 if Is_Array_Type (Def_Id) then
4056 Comp := First_Entity (Component_Type (Def_Id));
4058 Comp := First_Entity (Def_Id);
4061 while Present (Comp) loop
4062 Typ := Etype (Comp);
4064 if Is_Access_Type (Typ)
4065 and then Ekind (Typ) = E_Anonymous_Access_Type
4067 Set_Master_Id (Typ, M_Id);
4076 Par_Id := Etype (B_Id);
4078 -- The parent type is private then we need to inherit any TSS operations
4079 -- from the full view.
4081 if Ekind (Par_Id) in Private_Kind
4082 and then Present (Full_View (Par_Id))
4084 Par_Id := Base_Type (Full_View (Par_Id));
4087 if Nkind (Type_Definition (Original_Node (N))) =
4088 N_Derived_Type_Definition
4089 and then not Is_Tagged_Type (Def_Id)
4090 and then Present (Freeze_Node (Par_Id))
4091 and then Present (TSS_Elist (Freeze_Node (Par_Id)))
4093 Ensure_Freeze_Node (B_Id);
4094 FN := Freeze_Node (B_Id);
4096 if No (TSS_Elist (FN)) then
4097 Set_TSS_Elist (FN, New_Elmt_List);
4101 T_E : constant Elist_Id := TSS_Elist (FN);
4105 Elmt := First_Elmt (TSS_Elist (Freeze_Node (Par_Id)));
4106 while Present (Elmt) loop
4107 if Chars (Node (Elmt)) /= Name_uInit then
4108 Append_Elmt (Node (Elmt), T_E);
4114 -- If the derived type itself is private with a full view, then
4115 -- associate the full view with the inherited TSS_Elist as well.
4117 if Ekind (B_Id) in Private_Kind
4118 and then Present (Full_View (B_Id))
4120 Ensure_Freeze_Node (Base_Type (Full_View (B_Id)));
4122 (Freeze_Node (Base_Type (Full_View (B_Id))), TSS_Elist (FN));
4126 end Expand_N_Full_Type_Declaration;
4128 ---------------------------------
4129 -- Expand_N_Object_Declaration --
4130 ---------------------------------
4132 -- First we do special processing for objects of a tagged type where this
4133 -- is the point at which the type is frozen. The creation of the dispatch
4134 -- table and the initialization procedure have to be deferred to this
4135 -- point, since we reference previously declared primitive subprograms.
4137 -- For all types, we call an initialization procedure if there is one
4139 procedure Expand_N_Object_Declaration (N : Node_Id) is
4140 Def_Id : constant Entity_Id := Defining_Identifier (N);
4141 Expr : constant Node_Id := Expression (N);
4142 Loc : constant Source_Ptr := Sloc (N);
4143 Typ : constant Entity_Id := Etype (Def_Id);
4144 Base_Typ : constant Entity_Id := Base_Type (Typ);
4149 Init_After : Node_Id := N;
4150 -- Node after which the init proc call is to be inserted. This is
4151 -- normally N, except for the case of a shared passive variable, in
4152 -- which case the init proc call must be inserted only after the bodies
4153 -- of the shared variable procedures have been seen.
4156 -- Don't do anything for deferred constants. All proper actions will
4157 -- be expanded during the full declaration.
4159 if No (Expr) and Constant_Present (N) then
4163 -- Force construction of dispatch tables of library level tagged types
4165 if VM_Target = No_VM
4166 and then Static_Dispatch_Tables
4167 and then Is_Library_Level_Entity (Def_Id)
4168 and then Is_Library_Level_Tagged_Type (Base_Typ)
4169 and then (Ekind (Base_Typ) = E_Record_Type
4170 or else Ekind (Base_Typ) = E_Protected_Type
4171 or else Ekind (Base_Typ) = E_Task_Type)
4172 and then not Has_Dispatch_Table (Base_Typ)
4175 New_Nodes : List_Id := No_List;
4178 if Is_Concurrent_Type (Base_Typ) then
4179 New_Nodes := Make_DT (Corresponding_Record_Type (Base_Typ), N);
4181 New_Nodes := Make_DT (Base_Typ, N);
4184 if not Is_Empty_List (New_Nodes) then
4185 Insert_List_Before (N, New_Nodes);
4190 -- Make shared memory routines for shared passive variable
4192 if Is_Shared_Passive (Def_Id) then
4193 Init_After := Make_Shared_Var_Procs (N);
4196 -- If tasks being declared, make sure we have an activation chain
4197 -- defined for the tasks (has no effect if we already have one), and
4198 -- also that a Master variable is established and that the appropriate
4199 -- enclosing construct is established as a task master.
4201 if Has_Task (Typ) then
4202 Build_Activation_Chain_Entity (N);
4203 Build_Master_Entity (Def_Id);
4206 -- Build a list controller for declarations where the type is anonymous
4207 -- access and the designated type is controlled. Only declarations from
4208 -- source files receive such controllers in order to provide the same
4209 -- lifespan for any potential coextensions that may be associated with
4210 -- the object. Finalization lists of internal controlled anonymous
4211 -- access objects are already handled in Expand_N_Allocator.
4213 if Comes_From_Source (N)
4214 and then Ekind (Typ) = E_Anonymous_Access_Type
4215 and then Is_Controlled (Directly_Designated_Type (Typ))
4216 and then No (Associated_Final_Chain (Typ))
4218 Build_Final_List (N, Typ);
4221 -- Default initialization required, and no expression present
4225 -- Expand Initialize call for controlled objects. One may wonder why
4226 -- the Initialize Call is not done in the regular Init procedure
4227 -- attached to the record type. That's because the init procedure is
4228 -- recursively called on each component, including _Parent, thus the
4229 -- Init call for a controlled object would generate not only one
4230 -- Initialize call as it is required but one for each ancestor of
4231 -- its type. This processing is suppressed if No_Initialization set.
4233 if not Needs_Finalization (Typ)
4234 or else No_Initialization (N)
4238 elsif not Abort_Allowed
4239 or else not Comes_From_Source (N)
4241 Insert_Actions_After (Init_After,
4243 Ref => New_Occurrence_Of (Def_Id, Loc),
4244 Typ => Base_Type (Typ),
4245 Flist_Ref => Find_Final_List (Def_Id),
4246 With_Attach => Make_Integer_Literal (Loc, 1)));
4251 -- We need to protect the initialize call
4255 -- Initialize (...);
4257 -- Undefer_Abort.all;
4260 -- ??? this won't protect the initialize call for controlled
4261 -- components which are part of the init proc, so this block
4262 -- should probably also contain the call to _init_proc but this
4263 -- requires some code reorganization...
4266 L : constant List_Id :=
4268 (Ref => New_Occurrence_Of (Def_Id, Loc),
4269 Typ => Base_Type (Typ),
4270 Flist_Ref => Find_Final_List (Def_Id),
4271 With_Attach => Make_Integer_Literal (Loc, 1));
4273 Blk : constant Node_Id :=
4274 Make_Block_Statement (Loc,
4275 Handled_Statement_Sequence =>
4276 Make_Handled_Sequence_Of_Statements (Loc, L));
4279 Prepend_To (L, Build_Runtime_Call (Loc, RE_Abort_Defer));
4280 Set_At_End_Proc (Handled_Statement_Sequence (Blk),
4281 New_Occurrence_Of (RTE (RE_Abort_Undefer_Direct), Loc));
4282 Insert_Actions_After (Init_After, New_List (Blk));
4283 Expand_At_End_Handler
4284 (Handled_Statement_Sequence (Blk), Entity (Identifier (Blk)));
4288 -- Call type initialization procedure if there is one. We build the
4289 -- call and put it immediately after the object declaration, so that
4290 -- it will be expanded in the usual manner. Note that this will
4291 -- result in proper handling of defaulted discriminants.
4293 -- Need call if there is a base init proc
4295 if Has_Non_Null_Base_Init_Proc (Typ)
4297 -- Suppress call if No_Initialization set on declaration
4299 and then not No_Initialization (N)
4301 -- Suppress call for special case of value type for VM
4303 and then not Is_Value_Type (Typ)
4305 -- Suppress call if Suppress_Init_Proc set on the type. This is
4306 -- needed for the derived type case, where Suppress_Initialization
4307 -- may be set for the derived type, even if there is an init proc
4308 -- defined for the root type.
4310 and then not Suppress_Init_Proc (Typ)
4312 -- Return without initializing when No_Default_Initialization
4313 -- applies. Note that the actual restriction check occurs later,
4314 -- when the object is frozen, because we don't know yet whether
4315 -- the object is imported, which is a case where the check does
4318 if Restriction_Active (No_Default_Initialization) then
4322 -- The call to the initialization procedure does NOT freeze the
4323 -- object being initialized. This is because the call is not a
4324 -- source level call. This works fine, because the only possible
4325 -- statements depending on freeze status that can appear after the
4326 -- _Init call are rep clauses which can safely appear after actual
4327 -- references to the object.
4329 Id_Ref := New_Reference_To (Def_Id, Loc);
4330 Set_Must_Not_Freeze (Id_Ref);
4331 Set_Assignment_OK (Id_Ref);
4334 Init_Expr : constant Node_Id :=
4335 Static_Initialization (Base_Init_Proc (Typ));
4337 if Present (Init_Expr) then
4339 (N, New_Copy_Tree (Init_Expr, New_Scope => Current_Scope));
4342 Initialization_Warning (Id_Ref);
4344 Insert_Actions_After (Init_After,
4345 Build_Initialization_Call (Loc, Id_Ref, Typ));
4349 -- If simple initialization is required, then set an appropriate
4350 -- simple initialization expression in place. This special
4351 -- initialization is required even though No_Init_Flag is present,
4352 -- but is not needed if there was an explicit initialization.
4354 -- An internally generated temporary needs no initialization because
4355 -- it will be assigned subsequently. In particular, there is no point
4356 -- in applying Initialize_Scalars to such a temporary.
4358 elsif Needs_Simple_Initialization (Typ)
4359 and then not Is_Internal (Def_Id)
4360 and then not Has_Init_Expression (N)
4362 Set_No_Initialization (N, False);
4363 Set_Expression (N, Get_Simple_Init_Val (Typ, N, Esize (Def_Id)));
4364 Analyze_And_Resolve (Expression (N), Typ);
4367 -- Generate attribute for Persistent_BSS if needed
4369 if Persistent_BSS_Mode
4370 and then Comes_From_Source (N)
4371 and then Is_Potentially_Persistent_Type (Typ)
4372 and then not Has_Init_Expression (N)
4373 and then Is_Library_Level_Entity (Def_Id)
4379 Make_Linker_Section_Pragma
4380 (Def_Id, Sloc (N), ".persistent.bss");
4381 Insert_After (N, Prag);
4386 -- If access type, then we know it is null if not initialized
4388 if Is_Access_Type (Typ) then
4389 Set_Is_Known_Null (Def_Id);
4392 -- Explicit initialization present
4395 -- Obtain actual expression from qualified expression
4397 if Nkind (Expr) = N_Qualified_Expression then
4398 Expr_Q := Expression (Expr);
4403 -- When we have the appropriate type of aggregate in the expression
4404 -- (it has been determined during analysis of the aggregate by
4405 -- setting the delay flag), let's perform in place assignment and
4406 -- thus avoid creating a temporary.
4408 if Is_Delayed_Aggregate (Expr_Q) then
4409 Convert_Aggr_In_Object_Decl (N);
4411 -- Ada 2005 (AI-318-02): If the initialization expression is a call
4412 -- to a build-in-place function, then access to the declared object
4413 -- must be passed to the function. Currently we limit such functions
4414 -- to those with constrained limited result subtypes, but eventually
4415 -- plan to expand the allowed forms of functions that are treated as
4418 elsif Ada_Version >= Ada_05
4419 and then Is_Build_In_Place_Function_Call (Expr_Q)
4421 Make_Build_In_Place_Call_In_Object_Declaration (N, Expr_Q);
4423 -- The previous call expands the expression initializing the
4424 -- built-in-place object into further code that will be analyzed
4425 -- later. No further expansion needed here.
4430 -- In most cases, we must check that the initial value meets any
4431 -- constraint imposed by the declared type. However, there is one
4432 -- very important exception to this rule. If the entity has an
4433 -- unconstrained nominal subtype, then it acquired its constraints
4434 -- from the expression in the first place, and not only does this
4435 -- mean that the constraint check is not needed, but an attempt to
4436 -- perform the constraint check can cause order of elaboration
4439 if not Is_Constr_Subt_For_U_Nominal (Typ) then
4441 -- If this is an allocator for an aggregate that has been
4442 -- allocated in place, delay checks until assignments are
4443 -- made, because the discriminants are not initialized.
4445 if Nkind (Expr) = N_Allocator
4446 and then No_Initialization (Expr)
4450 Apply_Constraint_Check (Expr, Typ);
4454 -- Ada 2005 (AI-251): Rewrite the expression that initializes a
4455 -- class-wide object to ensure that we copy the full object,
4456 -- unless we are targetting a VM where interfaces are handled by
4457 -- VM itself. Note that if the root type of Typ is an ancestor
4458 -- of Expr's type, both types share the same dispatch table and
4459 -- there is no need to displace the pointer.
4462 -- CW : I'Class := Obj;
4464 -- Temp : I'Class := I'Class (Base_Address (Obj'Address));
4465 -- CW : I'Class renames Displace (Temp, I'Tag);
4467 if Is_Interface (Typ)
4468 and then Is_Class_Wide_Type (Typ)
4470 (Is_Class_Wide_Type (Etype (Expr))
4472 not Is_Ancestor (Root_Type (Typ), Etype (Expr)))
4473 and then Comes_From_Source (Def_Id)
4474 and then VM_Target = No_VM
4482 Make_Object_Declaration (Loc,
4483 Defining_Identifier =>
4484 Make_Defining_Identifier (Loc,
4485 New_Internal_Name ('D')),
4487 Object_Definition =>
4488 Make_Attribute_Reference (Loc,
4491 (Root_Type (Etype (Def_Id)), Loc),
4492 Attribute_Name => Name_Class),
4495 Unchecked_Convert_To
4496 (Class_Wide_Type (Root_Type (Etype (Def_Id))),
4497 Make_Explicit_Dereference (Loc,
4498 Unchecked_Convert_To (RTE (RE_Tag_Ptr),
4499 Make_Function_Call (Loc,
4501 New_Reference_To (RTE (RE_Base_Address),
4503 Parameter_Associations => New_List (
4504 Make_Attribute_Reference (Loc,
4505 Prefix => Relocate_Node (Expr),
4506 Attribute_Name => Name_Address)))))));
4508 Insert_Action (N, Decl_1);
4511 Make_Object_Renaming_Declaration (Loc,
4512 Defining_Identifier =>
4513 Make_Defining_Identifier (Loc,
4514 New_Internal_Name ('D')),
4517 Make_Attribute_Reference (Loc,
4520 (Root_Type (Etype (Def_Id)), Loc),
4521 Attribute_Name => Name_Class),
4524 Unchecked_Convert_To (
4525 Class_Wide_Type (Root_Type (Etype (Def_Id))),
4526 Make_Explicit_Dereference (Loc,
4527 Unchecked_Convert_To (RTE (RE_Tag_Ptr),
4528 Make_Function_Call (Loc,
4530 New_Reference_To (RTE (RE_Displace), Loc),
4532 Parameter_Associations => New_List (
4533 Make_Attribute_Reference (Loc,
4536 (Defining_Identifier (Decl_1), Loc),
4537 Attribute_Name => Name_Address),
4539 Unchecked_Convert_To (RTE (RE_Tag),
4544 (Root_Type (Typ)))),
4547 Rewrite (N, Decl_2);
4550 -- Replace internal identifier of Decl_2 by the identifier
4551 -- found in the sources. We also have to exchange entities
4552 -- containing their defining identifiers to ensure the
4553 -- correct replacement of the object declaration by this
4554 -- object renaming declaration (because such definings
4555 -- identifier have been previously added by Enter_Name to
4556 -- the current scope). We must preserve the homonym chain
4557 -- of the source entity as well.
4559 Set_Chars (Defining_Identifier (N), Chars (Def_Id));
4560 Set_Homonym (Defining_Identifier (N), Homonym (Def_Id));
4561 Exchange_Entities (Defining_Identifier (N), Def_Id);
4567 -- If the type is controlled and not inherently limited, then
4568 -- the target is adjusted after the copy and attached to the
4569 -- finalization list. However, no adjustment is done in the case
4570 -- where the object was initialized by a call to a function whose
4571 -- result is built in place, since no copy occurred. (Eventually
4572 -- we plan to support in-place function results for some cases
4573 -- of nonlimited types. ???)
4575 if Needs_Finalization (Typ)
4576 and then not Is_Inherently_Limited_Type (Typ)
4578 Insert_Actions_After (Init_After,
4580 Ref => New_Reference_To (Def_Id, Loc),
4581 Typ => Base_Type (Typ),
4582 Flist_Ref => Find_Final_List (Def_Id),
4583 With_Attach => Make_Integer_Literal (Loc, 1)));
4586 -- For tagged types, when an init value is given, the tag has to
4587 -- be re-initialized separately in order to avoid the propagation
4588 -- of a wrong tag coming from a view conversion unless the type
4589 -- is class wide (in this case the tag comes from the init value).
4590 -- Suppress the tag assignment when VM_Target because VM tags are
4591 -- represented implicitly in objects. Ditto for types that are
4592 -- CPP_CLASS, and for initializations that are aggregates, because
4593 -- they have to have the right tag.
4595 if Is_Tagged_Type (Typ)
4596 and then not Is_Class_Wide_Type (Typ)
4597 and then not Is_CPP_Class (Typ)
4598 and then VM_Target = No_VM
4599 and then Nkind (Expr) /= N_Aggregate
4601 -- The re-assignment of the tag has to be done even if the
4602 -- object is a constant.
4605 Make_Selected_Component (Loc,
4606 Prefix => New_Reference_To (Def_Id, Loc),
4608 New_Reference_To (First_Tag_Component (Typ), Loc));
4610 Set_Assignment_OK (New_Ref);
4612 Insert_After (Init_After,
4613 Make_Assignment_Statement (Loc,
4616 Unchecked_Convert_To (RTE (RE_Tag),
4620 (Access_Disp_Table (Base_Type (Typ)))),
4623 -- For discrete types, set the Is_Known_Valid flag if the
4624 -- initializing value is known to be valid.
4626 elsif Is_Discrete_Type (Typ) and then Expr_Known_Valid (Expr) then
4627 Set_Is_Known_Valid (Def_Id);
4629 elsif Is_Access_Type (Typ) then
4631 -- For access types set the Is_Known_Non_Null flag if the
4632 -- initializing value is known to be non-null. We can also set
4633 -- Can_Never_Be_Null if this is a constant.
4635 if Known_Non_Null (Expr) then
4636 Set_Is_Known_Non_Null (Def_Id, True);
4638 if Constant_Present (N) then
4639 Set_Can_Never_Be_Null (Def_Id);
4644 -- If validity checking on copies, validate initial expression.
4645 -- But skip this if declaration is for a generic type, since it
4646 -- makes no sense to validate generic types. Not clear if this
4647 -- can happen for legal programs, but it definitely can arise
4648 -- from previous instantiation errors.
4650 if Validity_Checks_On
4651 and then Validity_Check_Copies
4652 and then not Is_Generic_Type (Etype (Def_Id))
4654 Ensure_Valid (Expr);
4655 Set_Is_Known_Valid (Def_Id);
4659 -- Cases where the back end cannot handle the initialization directly
4660 -- In such cases, we expand an assignment that will be appropriately
4661 -- handled by Expand_N_Assignment_Statement.
4663 -- The exclusion of the unconstrained case is wrong, but for now it
4664 -- is too much trouble ???
4666 if (Is_Possibly_Unaligned_Slice (Expr)
4667 or else (Is_Possibly_Unaligned_Object (Expr)
4668 and then not Represented_As_Scalar (Etype (Expr))))
4670 -- The exclusion of the unconstrained case is wrong, but for now
4671 -- it is too much trouble ???
4673 and then not (Is_Array_Type (Etype (Expr))
4674 and then not Is_Constrained (Etype (Expr)))
4677 Stat : constant Node_Id :=
4678 Make_Assignment_Statement (Loc,
4679 Name => New_Reference_To (Def_Id, Loc),
4680 Expression => Relocate_Node (Expr));
4682 Set_Expression (N, Empty);
4683 Set_No_Initialization (N);
4684 Set_Assignment_OK (Name (Stat));
4685 Set_No_Ctrl_Actions (Stat);
4686 Insert_After_And_Analyze (Init_After, Stat);
4692 when RE_Not_Available =>
4694 end Expand_N_Object_Declaration;
4696 ---------------------------------
4697 -- Expand_N_Subtype_Indication --
4698 ---------------------------------
4700 -- Add a check on the range of the subtype. The static case is partially
4701 -- duplicated by Process_Range_Expr_In_Decl in Sem_Ch3, but we still need
4702 -- to check here for the static case in order to avoid generating
4703 -- extraneous expanded code. Also deal with validity checking.
4705 procedure Expand_N_Subtype_Indication (N : Node_Id) is
4706 Ran : constant Node_Id := Range_Expression (Constraint (N));
4707 Typ : constant Entity_Id := Entity (Subtype_Mark (N));
4710 if Nkind (Constraint (N)) = N_Range_Constraint then
4711 Validity_Check_Range (Range_Expression (Constraint (N)));
4714 if Nkind_In (Parent (N), N_Constrained_Array_Definition, N_Slice) then
4715 Apply_Range_Check (Ran, Typ);
4717 end Expand_N_Subtype_Indication;
4719 ---------------------------
4720 -- Expand_N_Variant_Part --
4721 ---------------------------
4723 -- If the last variant does not contain the Others choice, replace it with
4724 -- an N_Others_Choice node since Gigi always wants an Others. Note that we
4725 -- do not bother to call Analyze on the modified variant part, since it's
4726 -- only effect would be to compute the Others_Discrete_Choices node
4727 -- laboriously, and of course we already know the list of choices that
4728 -- corresponds to the others choice (it's the list we are replacing!)
4730 procedure Expand_N_Variant_Part (N : Node_Id) is
4731 Last_Var : constant Node_Id := Last_Non_Pragma (Variants (N));
4732 Others_Node : Node_Id;
4734 if Nkind (First (Discrete_Choices (Last_Var))) /= N_Others_Choice then
4735 Others_Node := Make_Others_Choice (Sloc (Last_Var));
4736 Set_Others_Discrete_Choices
4737 (Others_Node, Discrete_Choices (Last_Var));
4738 Set_Discrete_Choices (Last_Var, New_List (Others_Node));
4740 end Expand_N_Variant_Part;
4742 ---------------------------------
4743 -- Expand_Previous_Access_Type --
4744 ---------------------------------
4746 procedure Expand_Previous_Access_Type (Def_Id : Entity_Id) is
4747 T : Entity_Id := First_Entity (Current_Scope);
4750 -- Find all access types declared in the current scope, whose
4751 -- designated type is Def_Id. If it does not have a Master_Id,
4754 while Present (T) loop
4755 if Is_Access_Type (T)
4756 and then Designated_Type (T) = Def_Id
4757 and then No (Master_Id (T))
4759 Build_Master_Entity (Def_Id);
4760 Build_Master_Renaming (Parent (Def_Id), T);
4765 end Expand_Previous_Access_Type;
4767 ------------------------------
4768 -- Expand_Record_Controller --
4769 ------------------------------
4771 procedure Expand_Record_Controller (T : Entity_Id) is
4772 Def : Node_Id := Type_Definition (Parent (T));
4773 Comp_List : Node_Id;
4774 Comp_Decl : Node_Id;
4776 First_Comp : Node_Id;
4777 Controller_Type : Entity_Id;
4781 if Nkind (Def) = N_Derived_Type_Definition then
4782 Def := Record_Extension_Part (Def);
4785 if Null_Present (Def) then
4786 Set_Component_List (Def,
4787 Make_Component_List (Sloc (Def),
4788 Component_Items => Empty_List,
4789 Variant_Part => Empty,
4790 Null_Present => True));
4793 Comp_List := Component_List (Def);
4795 if Null_Present (Comp_List)
4796 or else Is_Empty_List (Component_Items (Comp_List))
4798 Loc := Sloc (Comp_List);
4800 Loc := Sloc (First (Component_Items (Comp_List)));
4803 if Is_Inherently_Limited_Type (T) then
4804 Controller_Type := RTE (RE_Limited_Record_Controller);
4806 Controller_Type := RTE (RE_Record_Controller);
4809 Ent := Make_Defining_Identifier (Loc, Name_uController);
4812 Make_Component_Declaration (Loc,
4813 Defining_Identifier => Ent,
4814 Component_Definition =>
4815 Make_Component_Definition (Loc,
4816 Aliased_Present => False,
4817 Subtype_Indication => New_Reference_To (Controller_Type, Loc)));
4819 if Null_Present (Comp_List)
4820 or else Is_Empty_List (Component_Items (Comp_List))
4822 Set_Component_Items (Comp_List, New_List (Comp_Decl));
4823 Set_Null_Present (Comp_List, False);
4826 -- The controller cannot be placed before the _Parent field since
4827 -- gigi lays out field in order and _parent must be first to preserve
4828 -- the polymorphism of tagged types.
4830 First_Comp := First (Component_Items (Comp_List));
4832 if not Is_Tagged_Type (T) then
4833 Insert_Before (First_Comp, Comp_Decl);
4835 -- if T is a tagged type, place controller declaration after parent
4836 -- field and after eventual tags of interface types.
4839 while Present (First_Comp)
4841 (Chars (Defining_Identifier (First_Comp)) = Name_uParent
4842 or else Is_Tag (Defining_Identifier (First_Comp))
4844 -- Ada 2005 (AI-251): The following condition covers secondary
4845 -- tags but also the adjacent component containing the offset
4846 -- to the base of the object (component generated if the parent
4847 -- has discriminants --- see Add_Interface_Tag_Components).
4848 -- This is required to avoid the addition of the controller
4849 -- between the secondary tag and its adjacent component.
4853 (Defining_Identifier (First_Comp))))
4858 -- An empty tagged extension might consist only of the parent
4859 -- component. Otherwise insert the controller before the first
4860 -- component that is neither parent nor tag.
4862 if Present (First_Comp) then
4863 Insert_Before (First_Comp, Comp_Decl);
4865 Append (Comp_Decl, Component_Items (Comp_List));
4871 Analyze (Comp_Decl);
4872 Set_Ekind (Ent, E_Component);
4873 Init_Component_Location (Ent);
4875 -- Move the _controller entity ahead in the list of internal entities
4876 -- of the enclosing record so that it is selected instead of a
4877 -- potentially inherited one.
4880 E : constant Entity_Id := Last_Entity (T);
4884 pragma Assert (Chars (E) = Name_uController);
4886 Set_Next_Entity (E, First_Entity (T));
4887 Set_First_Entity (T, E);
4889 Comp := Next_Entity (E);
4890 while Next_Entity (Comp) /= E loop
4894 Set_Next_Entity (Comp, Empty);
4895 Set_Last_Entity (T, Comp);
4901 when RE_Not_Available =>
4903 end Expand_Record_Controller;
4905 ------------------------
4906 -- Expand_Tagged_Root --
4907 ------------------------
4909 procedure Expand_Tagged_Root (T : Entity_Id) is
4910 Def : constant Node_Id := Type_Definition (Parent (T));
4911 Comp_List : Node_Id;
4912 Comp_Decl : Node_Id;
4913 Sloc_N : Source_Ptr;
4916 if Null_Present (Def) then
4917 Set_Component_List (Def,
4918 Make_Component_List (Sloc (Def),
4919 Component_Items => Empty_List,
4920 Variant_Part => Empty,
4921 Null_Present => True));
4924 Comp_List := Component_List (Def);
4926 if Null_Present (Comp_List)
4927 or else Is_Empty_List (Component_Items (Comp_List))
4929 Sloc_N := Sloc (Comp_List);
4931 Sloc_N := Sloc (First (Component_Items (Comp_List)));
4935 Make_Component_Declaration (Sloc_N,
4936 Defining_Identifier => First_Tag_Component (T),
4937 Component_Definition =>
4938 Make_Component_Definition (Sloc_N,
4939 Aliased_Present => False,
4940 Subtype_Indication => New_Reference_To (RTE (RE_Tag), Sloc_N)));
4942 if Null_Present (Comp_List)
4943 or else Is_Empty_List (Component_Items (Comp_List))
4945 Set_Component_Items (Comp_List, New_List (Comp_Decl));
4946 Set_Null_Present (Comp_List, False);
4949 Insert_Before (First (Component_Items (Comp_List)), Comp_Decl);
4952 -- We don't Analyze the whole expansion because the tag component has
4953 -- already been analyzed previously. Here we just insure that the tree
4954 -- is coherent with the semantic decoration
4956 Find_Type (Subtype_Indication (Component_Definition (Comp_Decl)));
4959 when RE_Not_Available =>
4961 end Expand_Tagged_Root;
4963 ----------------------
4964 -- Clean_Task_Names --
4965 ----------------------
4967 procedure Clean_Task_Names
4969 Proc_Id : Entity_Id)
4973 and then not Restriction_Active (No_Implicit_Heap_Allocations)
4974 and then not Global_Discard_Names
4975 and then VM_Target = No_VM
4977 Set_Uses_Sec_Stack (Proc_Id);
4979 end Clean_Task_Names;
4981 -----------------------
4982 -- Freeze_Array_Type --
4983 -----------------------
4985 procedure Freeze_Array_Type (N : Node_Id) is
4986 Typ : constant Entity_Id := Entity (N);
4987 Comp_Typ : constant Entity_Id := Component_Type (Typ);
4988 Base : constant Entity_Id := Base_Type (Typ);
4991 if not Is_Bit_Packed_Array (Typ) then
4993 -- If the component contains tasks, so does the array type. This may
4994 -- not be indicated in the array type because the component may have
4995 -- been a private type at the point of definition. Same if component
4996 -- type is controlled.
4998 Set_Has_Task (Base, Has_Task (Comp_Typ));
4999 Set_Has_Controlled_Component (Base,
5000 Has_Controlled_Component (Comp_Typ)
5001 or else Is_Controlled (Comp_Typ));
5003 if No (Init_Proc (Base)) then
5005 -- If this is an anonymous array created for a declaration with
5006 -- an initial value, its init_proc will never be called. The
5007 -- initial value itself may have been expanded into assignments,
5008 -- in which case the object declaration is carries the
5009 -- No_Initialization flag.
5012 and then Nkind (Associated_Node_For_Itype (Base)) =
5013 N_Object_Declaration
5014 and then (Present (Expression (Associated_Node_For_Itype (Base)))
5016 No_Initialization (Associated_Node_For_Itype (Base)))
5020 -- We do not need an init proc for string or wide [wide] string,
5021 -- since the only time these need initialization in normalize or
5022 -- initialize scalars mode, and these types are treated specially
5023 -- and do not need initialization procedures.
5025 elsif Root_Type (Base) = Standard_String
5026 or else Root_Type (Base) = Standard_Wide_String
5027 or else Root_Type (Base) = Standard_Wide_Wide_String
5031 -- Otherwise we have to build an init proc for the subtype
5034 Build_Array_Init_Proc (Base, N);
5039 if Has_Controlled_Component (Base) then
5040 Build_Controlling_Procs (Base);
5042 if not Is_Limited_Type (Comp_Typ)
5043 and then Number_Dimensions (Typ) = 1
5045 Build_Slice_Assignment (Typ);
5048 elsif Ekind (Comp_Typ) = E_Anonymous_Access_Type
5049 and then Needs_Finalization (Directly_Designated_Type (Comp_Typ))
5051 Set_Associated_Final_Chain (Comp_Typ, Add_Final_Chain (Typ));
5055 -- For packed case, default initialization, except if the component type
5056 -- is itself a packed structure with an initialization procedure, or
5057 -- initialize/normalize scalars active, and we have a base type, or the
5058 -- type is public, because in that case a client might specify
5059 -- Normalize_Scalars and there better be a public Init_Proc for it.
5061 elsif (Present (Init_Proc (Component_Type (Base)))
5062 and then No (Base_Init_Proc (Base)))
5063 or else (Init_Or_Norm_Scalars and then Base = Typ)
5064 or else Is_Public (Typ)
5066 Build_Array_Init_Proc (Base, N);
5068 end Freeze_Array_Type;
5070 -----------------------------
5071 -- Freeze_Enumeration_Type --
5072 -----------------------------
5074 procedure Freeze_Enumeration_Type (N : Node_Id) is
5075 Typ : constant Entity_Id := Entity (N);
5076 Loc : constant Source_Ptr := Sloc (Typ);
5083 Is_Contiguous : Boolean;
5088 pragma Warnings (Off, Func);
5091 -- Various optimizations possible if given representation is contiguous
5093 Is_Contiguous := True;
5095 Ent := First_Literal (Typ);
5096 Last_Repval := Enumeration_Rep (Ent);
5099 while Present (Ent) loop
5100 if Enumeration_Rep (Ent) - Last_Repval /= 1 then
5101 Is_Contiguous := False;
5104 Last_Repval := Enumeration_Rep (Ent);
5110 if Is_Contiguous then
5111 Set_Has_Contiguous_Rep (Typ);
5112 Ent := First_Literal (Typ);
5114 Lst := New_List (New_Reference_To (Ent, Sloc (Ent)));
5117 -- Build list of literal references
5122 Ent := First_Literal (Typ);
5123 while Present (Ent) loop
5124 Append_To (Lst, New_Reference_To (Ent, Sloc (Ent)));
5130 -- Now build an array declaration
5132 -- typA : array (Natural range 0 .. num - 1) of ctype :=
5133 -- (v, v, v, v, v, ....)
5135 -- where ctype is the corresponding integer type. If the representation
5136 -- is contiguous, we only keep the first literal, which provides the
5137 -- offset for Pos_To_Rep computations.
5140 Make_Defining_Identifier (Loc,
5141 Chars => New_External_Name (Chars (Typ), 'A'));
5143 Append_Freeze_Action (Typ,
5144 Make_Object_Declaration (Loc,
5145 Defining_Identifier => Arr,
5146 Constant_Present => True,
5148 Object_Definition =>
5149 Make_Constrained_Array_Definition (Loc,
5150 Discrete_Subtype_Definitions => New_List (
5151 Make_Subtype_Indication (Loc,
5152 Subtype_Mark => New_Reference_To (Standard_Natural, Loc),
5154 Make_Range_Constraint (Loc,
5158 Make_Integer_Literal (Loc, 0),
5160 Make_Integer_Literal (Loc, Num - 1))))),
5162 Component_Definition =>
5163 Make_Component_Definition (Loc,
5164 Aliased_Present => False,
5165 Subtype_Indication => New_Reference_To (Typ, Loc))),
5168 Make_Aggregate (Loc,
5169 Expressions => Lst)));
5171 Set_Enum_Pos_To_Rep (Typ, Arr);
5173 -- Now we build the function that converts representation values to
5174 -- position values. This function has the form:
5176 -- function _Rep_To_Pos (A : etype; F : Boolean) return Integer is
5179 -- when enum-lit'Enum_Rep => return posval;
5180 -- when enum-lit'Enum_Rep => return posval;
5183 -- [raise Constraint_Error when F "invalid data"]
5188 -- Note: the F parameter determines whether the others case (no valid
5189 -- representation) raises Constraint_Error or returns a unique value
5190 -- of minus one. The latter case is used, e.g. in 'Valid code.
5192 -- Note: the reason we use Enum_Rep values in the case here is to avoid
5193 -- the code generator making inappropriate assumptions about the range
5194 -- of the values in the case where the value is invalid. ityp is a
5195 -- signed or unsigned integer type of appropriate width.
5197 -- Note: if exceptions are not supported, then we suppress the raise
5198 -- and return -1 unconditionally (this is an erroneous program in any
5199 -- case and there is no obligation to raise Constraint_Error here!) We
5200 -- also do this if pragma Restrictions (No_Exceptions) is active.
5202 -- Is this right??? What about No_Exception_Propagation???
5204 -- Representations are signed
5206 if Enumeration_Rep (First_Literal (Typ)) < 0 then
5208 -- The underlying type is signed. Reset the Is_Unsigned_Type
5209 -- explicitly, because it might have been inherited from
5212 Set_Is_Unsigned_Type (Typ, False);
5214 if Esize (Typ) <= Standard_Integer_Size then
5215 Ityp := Standard_Integer;
5217 Ityp := Universal_Integer;
5220 -- Representations are unsigned
5223 if Esize (Typ) <= Standard_Integer_Size then
5224 Ityp := RTE (RE_Unsigned);
5226 Ityp := RTE (RE_Long_Long_Unsigned);
5230 -- The body of the function is a case statement. First collect case
5231 -- alternatives, or optimize the contiguous case.
5235 -- If representation is contiguous, Pos is computed by subtracting
5236 -- the representation of the first literal.
5238 if Is_Contiguous then
5239 Ent := First_Literal (Typ);
5241 if Enumeration_Rep (Ent) = Last_Repval then
5243 -- Another special case: for a single literal, Pos is zero
5245 Pos_Expr := Make_Integer_Literal (Loc, Uint_0);
5249 Convert_To (Standard_Integer,
5250 Make_Op_Subtract (Loc,
5252 Unchecked_Convert_To (Ityp,
5253 Make_Identifier (Loc, Name_uA)),
5255 Make_Integer_Literal (Loc,
5257 Enumeration_Rep (First_Literal (Typ)))));
5261 Make_Case_Statement_Alternative (Loc,
5262 Discrete_Choices => New_List (
5263 Make_Range (Sloc (Enumeration_Rep_Expr (Ent)),
5265 Make_Integer_Literal (Loc,
5266 Intval => Enumeration_Rep (Ent)),
5268 Make_Integer_Literal (Loc, Intval => Last_Repval))),
5270 Statements => New_List (
5271 Make_Simple_Return_Statement (Loc,
5272 Expression => Pos_Expr))));
5275 Ent := First_Literal (Typ);
5276 while Present (Ent) loop
5278 Make_Case_Statement_Alternative (Loc,
5279 Discrete_Choices => New_List (
5280 Make_Integer_Literal (Sloc (Enumeration_Rep_Expr (Ent)),
5281 Intval => Enumeration_Rep (Ent))),
5283 Statements => New_List (
5284 Make_Simple_Return_Statement (Loc,
5286 Make_Integer_Literal (Loc,
5287 Intval => Enumeration_Pos (Ent))))));
5293 -- In normal mode, add the others clause with the test
5295 if not No_Exception_Handlers_Set then
5297 Make_Case_Statement_Alternative (Loc,
5298 Discrete_Choices => New_List (Make_Others_Choice (Loc)),
5299 Statements => New_List (
5300 Make_Raise_Constraint_Error (Loc,
5301 Condition => Make_Identifier (Loc, Name_uF),
5302 Reason => CE_Invalid_Data),
5303 Make_Simple_Return_Statement (Loc,
5305 Make_Integer_Literal (Loc, -1)))));
5307 -- If either of the restrictions No_Exceptions_Handlers/Propagation is
5308 -- active then return -1 (we cannot usefully raise Constraint_Error in
5309 -- this case). See description above for further details.
5313 Make_Case_Statement_Alternative (Loc,
5314 Discrete_Choices => New_List (Make_Others_Choice (Loc)),
5315 Statements => New_List (
5316 Make_Simple_Return_Statement (Loc,
5318 Make_Integer_Literal (Loc, -1)))));
5321 -- Now we can build the function body
5324 Make_Defining_Identifier (Loc, Make_TSS_Name (Typ, TSS_Rep_To_Pos));
5327 Make_Subprogram_Body (Loc,
5329 Make_Function_Specification (Loc,
5330 Defining_Unit_Name => Fent,
5331 Parameter_Specifications => New_List (
5332 Make_Parameter_Specification (Loc,
5333 Defining_Identifier =>
5334 Make_Defining_Identifier (Loc, Name_uA),
5335 Parameter_Type => New_Reference_To (Typ, Loc)),
5336 Make_Parameter_Specification (Loc,
5337 Defining_Identifier =>
5338 Make_Defining_Identifier (Loc, Name_uF),
5339 Parameter_Type => New_Reference_To (Standard_Boolean, Loc))),
5341 Result_Definition => New_Reference_To (Standard_Integer, Loc)),
5343 Declarations => Empty_List,
5345 Handled_Statement_Sequence =>
5346 Make_Handled_Sequence_Of_Statements (Loc,
5347 Statements => New_List (
5348 Make_Case_Statement (Loc,
5350 Unchecked_Convert_To (Ityp,
5351 Make_Identifier (Loc, Name_uA)),
5352 Alternatives => Lst))));
5354 Set_TSS (Typ, Fent);
5357 if not Debug_Generated_Code then
5358 Set_Debug_Info_Off (Fent);
5362 when RE_Not_Available =>
5364 end Freeze_Enumeration_Type;
5366 ------------------------
5367 -- Freeze_Record_Type --
5368 ------------------------
5370 procedure Freeze_Record_Type (N : Node_Id) is
5372 procedure Add_Internal_Interface_Entities (Tagged_Type : Entity_Id);
5373 -- Add to the list of primitives of Tagged_Types the internal entities
5374 -- associated with interface primitives that are located in secondary
5377 -------------------------------------
5378 -- Add_Internal_Interface_Entities --
5379 -------------------------------------
5381 procedure Add_Internal_Interface_Entities (Tagged_Type : Entity_Id) is
5384 Iface_Elmt : Elmt_Id;
5385 Iface_Prim : Entity_Id;
5386 Ifaces_List : Elist_Id;
5387 New_Subp : Entity_Id := Empty;
5391 pragma Assert (Ada_Version >= Ada_05
5392 and then Is_Record_Type (Tagged_Type)
5393 and then Is_Tagged_Type (Tagged_Type)
5394 and then Has_Interfaces (Tagged_Type)
5395 and then not Is_Interface (Tagged_Type));
5397 Collect_Interfaces (Tagged_Type, Ifaces_List);
5399 Iface_Elmt := First_Elmt (Ifaces_List);
5400 while Present (Iface_Elmt) loop
5401 Iface := Node (Iface_Elmt);
5403 -- Exclude from this processing interfaces that are parents
5404 -- of Tagged_Type because their primitives are located in the
5405 -- primary dispatch table (and hence no auxiliary internal
5406 -- entities are required to handle secondary dispatch tables
5409 if not Is_Ancestor (Iface, Tagged_Type) then
5410 Elmt := First_Elmt (Primitive_Operations (Iface));
5411 while Present (Elmt) loop
5412 Iface_Prim := Node (Elmt);
5414 if not Is_Predefined_Dispatching_Operation (Iface_Prim) then
5416 Find_Primitive_Covering_Interface
5417 (Tagged_Type => Tagged_Type,
5418 Iface_Prim => Iface_Prim);
5420 pragma Assert (Present (Prim));
5423 (New_Subp => New_Subp,
5424 Parent_Subp => Iface_Prim,
5425 Derived_Type => Tagged_Type,
5426 Parent_Type => Iface);
5428 -- Ada 2005 (AI-251): Decorate internal entity Iface_Subp
5429 -- associated with interface types. These entities are
5430 -- only registered in the list of primitives of its
5431 -- corresponding tagged type because they are only used
5432 -- to fill the contents of the secondary dispatch tables.
5433 -- Therefore they are removed from the homonym chains.
5435 Set_Is_Hidden (New_Subp);
5436 Set_Is_Internal (New_Subp);
5437 Set_Alias (New_Subp, Prim);
5438 Set_Is_Abstract_Subprogram (New_Subp,
5439 Is_Abstract_Subprogram (Prim));
5440 Set_Interface_Alias (New_Subp, Iface_Prim);
5442 -- Internal entities associated with interface types are
5443 -- only registered in the list of primitives of the
5444 -- tagged type. They are only used to fill the contents
5445 -- of the secondary dispatch tables. Therefore they are
5446 -- not needed in the homonym chains.
5448 Remove_Homonym (New_Subp);
5450 -- Hidden entities associated with interfaces must have
5451 -- set the Has_Delay_Freeze attribute to ensure that, in
5452 -- case of locally defined tagged types (or compiling
5453 -- with static dispatch tables generation disabled) the
5454 -- corresponding entry of the secondary dispatch table is
5455 -- filled when such entity is frozen.
5457 Set_Has_Delayed_Freeze (New_Subp);
5464 Next_Elmt (Iface_Elmt);
5466 end Add_Internal_Interface_Entities;
5470 Def_Id : constant Node_Id := Entity (N);
5471 Type_Decl : constant Node_Id := Parent (Def_Id);
5473 Comp_Typ : Entity_Id;
5474 Has_Static_DT : Boolean := False;
5475 Predef_List : List_Id;
5477 Flist : Entity_Id := Empty;
5478 -- Finalization list allocated for the case of a type with anonymous
5479 -- access components whose designated type is potentially controlled.
5481 Renamed_Eq : Node_Id := Empty;
5482 -- Defining unit name for the predefined equality function in the case
5483 -- where the type has a primitive operation that is a renaming of
5484 -- predefined equality (but only if there is also an overriding
5485 -- user-defined equality function). Used to pass this entity from
5486 -- Make_Predefined_Primitive_Specs to Predefined_Primitive_Bodies.
5488 Wrapper_Decl_List : List_Id := No_List;
5489 Wrapper_Body_List : List_Id := No_List;
5490 Null_Proc_Decl_List : List_Id := No_List;
5492 -- Start of processing for Freeze_Record_Type
5495 -- Build discriminant checking functions if not a derived type (for
5496 -- derived types that are not tagged types, always use the discriminant
5497 -- checking functions of the parent type). However, for untagged types
5498 -- the derivation may have taken place before the parent was frozen, so
5499 -- we copy explicitly the discriminant checking functions from the
5500 -- parent into the components of the derived type.
5502 if not Is_Derived_Type (Def_Id)
5503 or else Has_New_Non_Standard_Rep (Def_Id)
5504 or else Is_Tagged_Type (Def_Id)
5506 Build_Discr_Checking_Funcs (Type_Decl);
5508 elsif Is_Derived_Type (Def_Id)
5509 and then not Is_Tagged_Type (Def_Id)
5511 -- If we have a derived Unchecked_Union, we do not inherit the
5512 -- discriminant checking functions from the parent type since the
5513 -- discriminants are non existent.
5515 and then not Is_Unchecked_Union (Def_Id)
5516 and then Has_Discriminants (Def_Id)
5519 Old_Comp : Entity_Id;
5523 First_Component (Base_Type (Underlying_Type (Etype (Def_Id))));
5524 Comp := First_Component (Def_Id);
5525 while Present (Comp) loop
5526 if Ekind (Comp) = E_Component
5527 and then Chars (Comp) = Chars (Old_Comp)
5529 Set_Discriminant_Checking_Func (Comp,
5530 Discriminant_Checking_Func (Old_Comp));
5533 Next_Component (Old_Comp);
5534 Next_Component (Comp);
5539 if Is_Derived_Type (Def_Id)
5540 and then Is_Limited_Type (Def_Id)
5541 and then Is_Tagged_Type (Def_Id)
5543 Check_Stream_Attributes (Def_Id);
5546 -- Update task and controlled component flags, because some of the
5547 -- component types may have been private at the point of the record
5550 Comp := First_Component (Def_Id);
5552 while Present (Comp) loop
5553 Comp_Typ := Etype (Comp);
5555 if Has_Task (Comp_Typ) then
5556 Set_Has_Task (Def_Id);
5558 elsif Has_Controlled_Component (Comp_Typ)
5559 or else (Chars (Comp) /= Name_uParent
5560 and then Is_Controlled (Comp_Typ))
5562 Set_Has_Controlled_Component (Def_Id);
5564 elsif Ekind (Comp_Typ) = E_Anonymous_Access_Type
5565 and then Needs_Finalization (Directly_Designated_Type (Comp_Typ))
5568 Flist := Add_Final_Chain (Def_Id);
5571 Set_Associated_Final_Chain (Comp_Typ, Flist);
5574 Next_Component (Comp);
5577 -- Creation of the Dispatch Table. Note that a Dispatch Table is built
5578 -- for regular tagged types as well as for Ada types deriving from a C++
5579 -- Class, but not for tagged types directly corresponding to C++ classes
5580 -- In the later case we assume that it is created in the C++ side and we
5583 if Is_Tagged_Type (Def_Id) then
5585 Static_Dispatch_Tables
5586 and then Is_Library_Level_Tagged_Type (Def_Id);
5588 -- Add the _Tag component
5590 if Underlying_Type (Etype (Def_Id)) = Def_Id then
5591 Expand_Tagged_Root (Def_Id);
5594 if Is_CPP_Class (Def_Id) then
5595 Set_All_DT_Position (Def_Id);
5596 Set_Default_Constructor (Def_Id);
5598 -- Create the tag entities with a minimum decoration
5600 if VM_Target = No_VM then
5601 Append_Freeze_Actions (Def_Id, Make_Tags (Def_Id));
5605 if not Has_Static_DT then
5607 -- Usually inherited primitives are not delayed but the first
5608 -- Ada extension of a CPP_Class is an exception since the
5609 -- address of the inherited subprogram has to be inserted in
5610 -- the new Ada Dispatch Table and this is a freezing action.
5612 -- Similarly, if this is an inherited operation whose parent is
5613 -- not frozen yet, it is not in the DT of the parent, and we
5614 -- generate an explicit freeze node for the inherited operation
5615 -- so that it is properly inserted in the DT of the current
5619 Elmt : Elmt_Id := First_Elmt (Primitive_Operations (Def_Id));
5623 while Present (Elmt) loop
5624 Subp := Node (Elmt);
5626 if Present (Alias (Subp)) then
5627 if Is_CPP_Class (Etype (Def_Id)) then
5628 Set_Has_Delayed_Freeze (Subp);
5630 elsif Has_Delayed_Freeze (Alias (Subp))
5631 and then not Is_Frozen (Alias (Subp))
5633 Set_Is_Frozen (Subp, False);
5634 Set_Has_Delayed_Freeze (Subp);
5643 -- Unfreeze momentarily the type to add the predefined primitives
5644 -- operations. The reason we unfreeze is so that these predefined
5645 -- operations will indeed end up as primitive operations (which
5646 -- must be before the freeze point).
5648 Set_Is_Frozen (Def_Id, False);
5650 -- Do not add the spec of predefined primitives in case of
5651 -- CPP tagged type derivations that have convention CPP.
5653 if Is_CPP_Class (Root_Type (Def_Id))
5654 and then Convention (Def_Id) = Convention_CPP
5658 -- Do not add the spec of the predefined primitives if we are
5659 -- compiling under restriction No_Dispatching_Calls
5661 elsif not Restriction_Active (No_Dispatching_Calls) then
5662 Make_Predefined_Primitive_Specs
5663 (Def_Id, Predef_List, Renamed_Eq);
5664 Insert_List_Before_And_Analyze (N, Predef_List);
5667 -- Ada 2005 (AI-391): For a nonabstract null extension, create
5668 -- wrapper functions for each nonoverridden inherited function
5669 -- with a controlling result of the type. The wrapper for such
5670 -- a function returns an extension aggregate that invokes the
5671 -- the parent function.
5673 if Ada_Version >= Ada_05
5674 and then not Is_Abstract_Type (Def_Id)
5675 and then Is_Null_Extension (Def_Id)
5677 Make_Controlling_Function_Wrappers
5678 (Def_Id, Wrapper_Decl_List, Wrapper_Body_List);
5679 Insert_List_Before_And_Analyze (N, Wrapper_Decl_List);
5682 -- Ada 2005 (AI-251): For a nonabstract type extension, build
5683 -- null procedure declarations for each set of homographic null
5684 -- procedures that are inherited from interface types but not
5685 -- overridden. This is done to ensure that the dispatch table
5686 -- entry associated with such null primitives are properly filled.
5688 if Ada_Version >= Ada_05
5689 and then Etype (Def_Id) /= Def_Id
5690 and then not Is_Abstract_Type (Def_Id)
5692 Make_Null_Procedure_Specs (Def_Id, Null_Proc_Decl_List);
5693 Insert_Actions (N, Null_Proc_Decl_List);
5696 -- Ada 2005 (AI-251): Add internal entities associated with
5697 -- secondary dispatch tables to the list of primitives of tagged
5698 -- types that are not interfaces
5700 if Ada_Version >= Ada_05
5701 and then not Is_Interface (Def_Id)
5702 and then Has_Interfaces (Def_Id)
5704 Add_Internal_Interface_Entities (Def_Id);
5707 Set_Is_Frozen (Def_Id);
5708 Set_All_DT_Position (Def_Id);
5710 -- Add the controlled component before the freezing actions
5711 -- referenced in those actions.
5713 if Has_New_Controlled_Component (Def_Id) then
5714 Expand_Record_Controller (Def_Id);
5717 -- Create and decorate the tags. Suppress their creation when
5718 -- VM_Target because the dispatching mechanism is handled
5719 -- internally by the VMs.
5721 if VM_Target = No_VM then
5722 Append_Freeze_Actions (Def_Id, Make_Tags (Def_Id));
5724 -- Generate dispatch table of locally defined tagged type.
5725 -- Dispatch tables of library level tagged types are built
5726 -- later (see Analyze_Declarations).
5728 if VM_Target = No_VM
5729 and then not Has_Static_DT
5731 Append_Freeze_Actions (Def_Id, Make_DT (Def_Id));
5735 -- Make sure that the primitives Initialize, Adjust and Finalize
5736 -- are Frozen before other TSS subprograms. We don't want them
5739 if Is_Controlled (Def_Id) then
5740 if not Is_Limited_Type (Def_Id) then
5741 Append_Freeze_Actions (Def_Id,
5743 (Find_Prim_Op (Def_Id, Name_Adjust), Sloc (Def_Id)));
5746 Append_Freeze_Actions (Def_Id,
5748 (Find_Prim_Op (Def_Id, Name_Initialize), Sloc (Def_Id)));
5750 Append_Freeze_Actions (Def_Id,
5752 (Find_Prim_Op (Def_Id, Name_Finalize), Sloc (Def_Id)));
5755 -- Freeze rest of primitive operations. There is no need to handle
5756 -- the predefined primitives if we are compiling under restriction
5757 -- No_Dispatching_Calls
5759 if not Restriction_Active (No_Dispatching_Calls) then
5760 Append_Freeze_Actions
5761 (Def_Id, Predefined_Primitive_Freeze (Def_Id));
5765 -- In the non-tagged case, an equality function is provided only for
5766 -- variant records (that are not unchecked unions).
5768 elsif Has_Discriminants (Def_Id)
5769 and then not Is_Limited_Type (Def_Id)
5772 Comps : constant Node_Id :=
5773 Component_List (Type_Definition (Type_Decl));
5777 and then Present (Variant_Part (Comps))
5779 Build_Variant_Record_Equality (Def_Id);
5784 -- Before building the record initialization procedure, if we are
5785 -- dealing with a concurrent record value type, then we must go through
5786 -- the discriminants, exchanging discriminals between the concurrent
5787 -- type and the concurrent record value type. See the section "Handling
5788 -- of Discriminants" in the Einfo spec for details.
5790 if Is_Concurrent_Record_Type (Def_Id)
5791 and then Has_Discriminants (Def_Id)
5794 Ctyp : constant Entity_Id :=
5795 Corresponding_Concurrent_Type (Def_Id);
5796 Conc_Discr : Entity_Id;
5797 Rec_Discr : Entity_Id;
5801 Conc_Discr := First_Discriminant (Ctyp);
5802 Rec_Discr := First_Discriminant (Def_Id);
5804 while Present (Conc_Discr) loop
5805 Temp := Discriminal (Conc_Discr);
5806 Set_Discriminal (Conc_Discr, Discriminal (Rec_Discr));
5807 Set_Discriminal (Rec_Discr, Temp);
5809 Set_Discriminal_Link (Discriminal (Conc_Discr), Conc_Discr);
5810 Set_Discriminal_Link (Discriminal (Rec_Discr), Rec_Discr);
5812 Next_Discriminant (Conc_Discr);
5813 Next_Discriminant (Rec_Discr);
5818 if Has_Controlled_Component (Def_Id) then
5819 if No (Controller_Component (Def_Id)) then
5820 Expand_Record_Controller (Def_Id);
5823 Build_Controlling_Procs (Def_Id);
5826 Adjust_Discriminants (Def_Id);
5828 if VM_Target = No_VM or else not Is_Interface (Def_Id) then
5830 -- Do not need init for interfaces on e.g. CIL since they're
5831 -- abstract. Helps operation of peverify (the PE Verify tool).
5833 Build_Record_Init_Proc (Type_Decl, Def_Id);
5836 -- For tagged type that are not interfaces, build bodies of primitive
5837 -- operations. Note that we do this after building the record
5838 -- initialization procedure, since the primitive operations may need
5839 -- the initialization routine. There is no need to add predefined
5840 -- primitives of interfaces because all their predefined primitives
5843 if Is_Tagged_Type (Def_Id)
5844 and then not Is_Interface (Def_Id)
5846 -- Do not add the body of predefined primitives in case of
5847 -- CPP tagged type derivations that have convention CPP.
5849 if Is_CPP_Class (Root_Type (Def_Id))
5850 and then Convention (Def_Id) = Convention_CPP
5854 -- Do not add the body of the predefined primitives if we are
5855 -- compiling under restriction No_Dispatching_Calls or if we are
5856 -- compiling a CPP tagged type.
5858 elsif not Restriction_Active (No_Dispatching_Calls) then
5859 Predef_List := Predefined_Primitive_Bodies (Def_Id, Renamed_Eq);
5860 Append_Freeze_Actions (Def_Id, Predef_List);
5863 -- Ada 2005 (AI-391): If any wrappers were created for nonoverridden
5864 -- inherited functions, then add their bodies to the freeze actions.
5866 if Present (Wrapper_Body_List) then
5867 Append_Freeze_Actions (Def_Id, Wrapper_Body_List);
5870 end Freeze_Record_Type;
5872 ------------------------------
5873 -- Freeze_Stream_Operations --
5874 ------------------------------
5876 procedure Freeze_Stream_Operations (N : Node_Id; Typ : Entity_Id) is
5877 Names : constant array (1 .. 4) of TSS_Name_Type :=
5882 Stream_Op : Entity_Id;
5885 -- Primitive operations of tagged types are frozen when the dispatch
5886 -- table is constructed.
5888 if not Comes_From_Source (Typ)
5889 or else Is_Tagged_Type (Typ)
5894 for J in Names'Range loop
5895 Stream_Op := TSS (Typ, Names (J));
5897 if Present (Stream_Op)
5898 and then Is_Subprogram (Stream_Op)
5899 and then Nkind (Unit_Declaration_Node (Stream_Op)) =
5900 N_Subprogram_Declaration
5901 and then not Is_Frozen (Stream_Op)
5903 Append_Freeze_Actions
5904 (Typ, Freeze_Entity (Stream_Op, Sloc (N)));
5907 end Freeze_Stream_Operations;
5913 -- Full type declarations are expanded at the point at which the type is
5914 -- frozen. The formal N is the Freeze_Node for the type. Any statements or
5915 -- declarations generated by the freezing (e.g. the procedure generated
5916 -- for initialization) are chained in the Actions field list of the freeze
5917 -- node using Append_Freeze_Actions.
5919 function Freeze_Type (N : Node_Id) return Boolean is
5920 Def_Id : constant Entity_Id := Entity (N);
5921 RACW_Seen : Boolean := False;
5922 Result : Boolean := False;
5925 -- Process associated access types needing special processing
5927 if Present (Access_Types_To_Process (N)) then
5929 E : Elmt_Id := First_Elmt (Access_Types_To_Process (N));
5931 while Present (E) loop
5933 if Is_Remote_Access_To_Class_Wide_Type (Node (E)) then
5934 Validate_RACW_Primitives (Node (E));
5944 -- If there are RACWs designating this type, make stubs now
5946 Remote_Types_Tagged_Full_View_Encountered (Def_Id);
5950 -- Freeze processing for record types
5952 if Is_Record_Type (Def_Id) then
5953 if Ekind (Def_Id) = E_Record_Type then
5954 Freeze_Record_Type (N);
5956 -- The subtype may have been declared before the type was frozen. If
5957 -- the type has controlled components it is necessary to create the
5958 -- entity for the controller explicitly because it did not exist at
5959 -- the point of the subtype declaration. Only the entity is needed,
5960 -- the back-end will obtain the layout from the type. This is only
5961 -- necessary if this is constrained subtype whose component list is
5962 -- not shared with the base type.
5964 elsif Ekind (Def_Id) = E_Record_Subtype
5965 and then Has_Discriminants (Def_Id)
5966 and then Last_Entity (Def_Id) /= Last_Entity (Base_Type (Def_Id))
5967 and then Present (Controller_Component (Def_Id))
5970 Old_C : constant Entity_Id := Controller_Component (Def_Id);
5974 if Scope (Old_C) = Base_Type (Def_Id) then
5976 -- The entity is the one in the parent. Create new one
5978 New_C := New_Copy (Old_C);
5979 Set_Parent (New_C, Parent (Old_C));
5980 Push_Scope (Def_Id);
5986 if Is_Itype (Def_Id)
5987 and then Is_Record_Type (Underlying_Type (Scope (Def_Id)))
5989 -- The freeze node is only used to introduce the controller,
5990 -- the back-end has no use for it for a discriminated
5993 Set_Freeze_Node (Def_Id, Empty);
5994 Set_Has_Delayed_Freeze (Def_Id, False);
5998 -- Similar process if the controller of the subtype is not present
5999 -- but the parent has it. This can happen with constrained
6000 -- record components where the subtype is an itype.
6002 elsif Ekind (Def_Id) = E_Record_Subtype
6003 and then Is_Itype (Def_Id)
6004 and then No (Controller_Component (Def_Id))
6005 and then Present (Controller_Component (Etype (Def_Id)))
6008 Old_C : constant Entity_Id :=
6009 Controller_Component (Etype (Def_Id));
6010 New_C : constant Entity_Id := New_Copy (Old_C);
6013 Set_Next_Entity (New_C, First_Entity (Def_Id));
6014 Set_First_Entity (Def_Id, New_C);
6016 -- The freeze node is only used to introduce the controller,
6017 -- the back-end has no use for it for a discriminated
6020 Set_Freeze_Node (Def_Id, Empty);
6021 Set_Has_Delayed_Freeze (Def_Id, False);
6026 -- Freeze processing for array types
6028 elsif Is_Array_Type (Def_Id) then
6029 Freeze_Array_Type (N);
6031 -- Freeze processing for access types
6033 -- For pool-specific access types, find out the pool object used for
6034 -- this type, needs actual expansion of it in some cases. Here are the
6035 -- different cases :
6037 -- 1. Rep Clause "for Def_Id'Storage_Size use 0;"
6038 -- ---> don't use any storage pool
6040 -- 2. Rep Clause : for Def_Id'Storage_Size use Expr.
6042 -- Def_Id__Pool : Stack_Bounded_Pool (Expr, DT'Size, DT'Alignment);
6044 -- 3. Rep Clause "for Def_Id'Storage_Pool use a_Pool_Object"
6045 -- ---> Storage Pool is the specified one
6047 -- See GNAT Pool packages in the Run-Time for more details
6049 elsif Ekind (Def_Id) = E_Access_Type
6050 or else Ekind (Def_Id) = E_General_Access_Type
6053 Loc : constant Source_Ptr := Sloc (N);
6054 Desig_Type : constant Entity_Id := Designated_Type (Def_Id);
6055 Pool_Object : Entity_Id;
6057 Freeze_Action_Typ : Entity_Id;
6062 -- Rep Clause "for Def_Id'Storage_Size use 0;"
6063 -- ---> don't use any storage pool
6065 if No_Pool_Assigned (Def_Id) then
6070 -- Rep Clause : for Def_Id'Storage_Size use Expr.
6072 -- Def_Id__Pool : Stack_Bounded_Pool
6073 -- (Expr, DT'Size, DT'Alignment);
6075 elsif Has_Storage_Size_Clause (Def_Id) then
6081 -- For unconstrained composite types we give a size of zero
6082 -- so that the pool knows that it needs a special algorithm
6083 -- for variable size object allocation.
6085 if Is_Composite_Type (Desig_Type)
6086 and then not Is_Constrained (Desig_Type)
6089 Make_Integer_Literal (Loc, 0);
6092 Make_Integer_Literal (Loc, Maximum_Alignment);
6096 Make_Attribute_Reference (Loc,
6097 Prefix => New_Reference_To (Desig_Type, Loc),
6098 Attribute_Name => Name_Max_Size_In_Storage_Elements);
6101 Make_Attribute_Reference (Loc,
6102 Prefix => New_Reference_To (Desig_Type, Loc),
6103 Attribute_Name => Name_Alignment);
6107 Make_Defining_Identifier (Loc,
6108 Chars => New_External_Name (Chars (Def_Id), 'P'));
6110 -- We put the code associated with the pools in the entity
6111 -- that has the later freeze node, usually the access type
6112 -- but it can also be the designated_type; because the pool
6113 -- code requires both those types to be frozen
6115 if Is_Frozen (Desig_Type)
6116 and then (No (Freeze_Node (Desig_Type))
6117 or else Analyzed (Freeze_Node (Desig_Type)))
6119 Freeze_Action_Typ := Def_Id;
6121 -- A Taft amendment type cannot get the freeze actions
6122 -- since the full view is not there.
6124 elsif Is_Incomplete_Or_Private_Type (Desig_Type)
6125 and then No (Full_View (Desig_Type))
6127 Freeze_Action_Typ := Def_Id;
6130 Freeze_Action_Typ := Desig_Type;
6133 Append_Freeze_Action (Freeze_Action_Typ,
6134 Make_Object_Declaration (Loc,
6135 Defining_Identifier => Pool_Object,
6136 Object_Definition =>
6137 Make_Subtype_Indication (Loc,
6140 (RTE (RE_Stack_Bounded_Pool), Loc),
6143 Make_Index_Or_Discriminant_Constraint (Loc,
6144 Constraints => New_List (
6146 -- First discriminant is the Pool Size
6149 Storage_Size_Variable (Def_Id), Loc),
6151 -- Second discriminant is the element size
6155 -- Third discriminant is the alignment
6160 Set_Associated_Storage_Pool (Def_Id, Pool_Object);
6164 -- Rep Clause "for Def_Id'Storage_Pool use a_Pool_Object"
6165 -- ---> Storage Pool is the specified one
6167 elsif Present (Associated_Storage_Pool (Def_Id)) then
6169 -- Nothing to do the associated storage pool has been attached
6170 -- when analyzing the rep. clause
6175 -- For access-to-controlled types (including class-wide types and
6176 -- Taft-amendment types which potentially have controlled
6177 -- components), expand the list controller object that will store
6178 -- the dynamically allocated objects. Do not do this
6179 -- transformation for expander-generated access types, but do it
6180 -- for types that are the full view of types derived from other
6181 -- private types. Also suppress the list controller in the case
6182 -- of a designated type with convention Java, since this is used
6183 -- when binding to Java API specs, where there's no equivalent of
6184 -- a finalization list and we don't want to pull in the
6185 -- finalization support if not needed.
6187 if not Comes_From_Source (Def_Id)
6188 and then not Has_Private_Declaration (Def_Id)
6192 elsif (Needs_Finalization (Desig_Type)
6193 and then Convention (Desig_Type) /= Convention_Java
6194 and then Convention (Desig_Type) /= Convention_CIL)
6196 (Is_Incomplete_Or_Private_Type (Desig_Type)
6197 and then No (Full_View (Desig_Type))
6199 -- An exception is made for types defined in the run-time
6200 -- because Ada.Tags.Tag itself is such a type and cannot
6201 -- afford this unnecessary overhead that would generates a
6202 -- loop in the expansion scheme...
6204 and then not In_Runtime (Def_Id)
6206 -- Another exception is if Restrictions (No_Finalization)
6207 -- is active, since then we know nothing is controlled.
6209 and then not Restriction_Active (No_Finalization))
6211 -- If the designated type is not frozen yet, its controlled
6212 -- status must be retrieved explicitly.
6214 or else (Is_Array_Type (Desig_Type)
6215 and then not Is_Frozen (Desig_Type)
6216 and then Needs_Finalization (Component_Type (Desig_Type)))
6218 -- The designated type has controlled anonymous access
6221 or else Has_Controlled_Coextensions (Desig_Type)
6223 Set_Associated_Final_Chain (Def_Id, Add_Final_Chain (Def_Id));
6227 -- Freeze processing for enumeration types
6229 elsif Ekind (Def_Id) = E_Enumeration_Type then
6231 -- We only have something to do if we have a non-standard
6232 -- representation (i.e. at least one literal whose pos value
6233 -- is not the same as its representation)
6235 if Has_Non_Standard_Rep (Def_Id) then
6236 Freeze_Enumeration_Type (N);
6239 -- Private types that are completed by a derivation from a private
6240 -- type have an internally generated full view, that needs to be
6241 -- frozen. This must be done explicitly because the two views share
6242 -- the freeze node, and the underlying full view is not visible when
6243 -- the freeze node is analyzed.
6245 elsif Is_Private_Type (Def_Id)
6246 and then Is_Derived_Type (Def_Id)
6247 and then Present (Full_View (Def_Id))
6248 and then Is_Itype (Full_View (Def_Id))
6249 and then Has_Private_Declaration (Full_View (Def_Id))
6250 and then Freeze_Node (Full_View (Def_Id)) = N
6252 Set_Entity (N, Full_View (Def_Id));
6253 Result := Freeze_Type (N);
6254 Set_Entity (N, Def_Id);
6256 -- All other types require no expander action. There are such cases
6257 -- (e.g. task types and protected types). In such cases, the freeze
6258 -- nodes are there for use by Gigi.
6262 Freeze_Stream_Operations (N, Def_Id);
6266 when RE_Not_Available =>
6270 -------------------------
6271 -- Get_Simple_Init_Val --
6272 -------------------------
6274 function Get_Simple_Init_Val
6277 Size : Uint := No_Uint) return Node_Id
6279 Loc : constant Source_Ptr := Sloc (N);
6285 -- This is the size to be used for computation of the appropriate
6286 -- initial value for the Normalize_Scalars and Initialize_Scalars case.
6288 IV_Attribute : constant Boolean :=
6289 Nkind (N) = N_Attribute_Reference
6290 and then Attribute_Name (N) = Name_Invalid_Value;
6294 -- These are the values computed by the procedure Check_Subtype_Bounds
6296 procedure Check_Subtype_Bounds;
6297 -- This procedure examines the subtype T, and its ancestor subtypes and
6298 -- derived types to determine the best known information about the
6299 -- bounds of the subtype. After the call Lo_Bound is set either to
6300 -- No_Uint if no information can be determined, or to a value which
6301 -- represents a known low bound, i.e. a valid value of the subtype can
6302 -- not be less than this value. Hi_Bound is similarly set to a known
6303 -- high bound (valid value cannot be greater than this).
6305 --------------------------
6306 -- Check_Subtype_Bounds --
6307 --------------------------
6309 procedure Check_Subtype_Bounds is
6318 Lo_Bound := No_Uint;
6319 Hi_Bound := No_Uint;
6321 -- Loop to climb ancestor subtypes and derived types
6325 if not Is_Discrete_Type (ST1) then
6329 Lo := Type_Low_Bound (ST1);
6330 Hi := Type_High_Bound (ST1);
6332 if Compile_Time_Known_Value (Lo) then
6333 Loval := Expr_Value (Lo);
6335 if Lo_Bound = No_Uint or else Lo_Bound < Loval then
6340 if Compile_Time_Known_Value (Hi) then
6341 Hival := Expr_Value (Hi);
6343 if Hi_Bound = No_Uint or else Hi_Bound > Hival then
6348 ST2 := Ancestor_Subtype (ST1);
6354 exit when ST1 = ST2;
6357 end Check_Subtype_Bounds;
6359 -- Start of processing for Get_Simple_Init_Val
6362 -- For a private type, we should always have an underlying type
6363 -- (because this was already checked in Needs_Simple_Initialization).
6364 -- What we do is to get the value for the underlying type and then do
6365 -- an Unchecked_Convert to the private type.
6367 if Is_Private_Type (T) then
6368 Val := Get_Simple_Init_Val (Underlying_Type (T), N, Size);
6370 -- A special case, if the underlying value is null, then qualify it
6371 -- with the underlying type, so that the null is properly typed
6372 -- Similarly, if it is an aggregate it must be qualified, because an
6373 -- unchecked conversion does not provide a context for it.
6375 if Nkind_In (Val, N_Null, N_Aggregate) then
6377 Make_Qualified_Expression (Loc,
6379 New_Occurrence_Of (Underlying_Type (T), Loc),
6383 Result := Unchecked_Convert_To (T, Val);
6385 -- Don't truncate result (important for Initialize/Normalize_Scalars)
6387 if Nkind (Result) = N_Unchecked_Type_Conversion
6388 and then Is_Scalar_Type (Underlying_Type (T))
6390 Set_No_Truncation (Result);
6395 -- For scalars, we must have normalize/initialize scalars case, or
6396 -- if the node N is an 'Invalid_Value attribute node.
6398 elsif Is_Scalar_Type (T) then
6399 pragma Assert (Init_Or_Norm_Scalars or IV_Attribute);
6401 -- Compute size of object. If it is given by the caller, we can use
6402 -- it directly, otherwise we use Esize (T) as an estimate. As far as
6403 -- we know this covers all cases correctly.
6405 if Size = No_Uint or else Size <= Uint_0 then
6406 Size_To_Use := UI_Max (Uint_1, Esize (T));
6408 Size_To_Use := Size;
6411 -- Maximum size to use is 64 bits, since we will create values
6412 -- of type Unsigned_64 and the range must fit this type.
6414 if Size_To_Use /= No_Uint and then Size_To_Use > Uint_64 then
6415 Size_To_Use := Uint_64;
6418 -- Check known bounds of subtype
6420 Check_Subtype_Bounds;
6422 -- Processing for Normalize_Scalars case
6424 if Normalize_Scalars and then not IV_Attribute then
6426 -- If zero is invalid, it is a convenient value to use that is
6427 -- for sure an appropriate invalid value in all situations.
6429 if Lo_Bound /= No_Uint and then Lo_Bound > Uint_0 then
6430 Val := Make_Integer_Literal (Loc, 0);
6432 -- Cases where all one bits is the appropriate invalid value
6434 -- For modular types, all 1 bits is either invalid or valid. If
6435 -- it is valid, then there is nothing that can be done since there
6436 -- are no invalid values (we ruled out zero already).
6438 -- For signed integer types that have no negative values, either
6439 -- there is room for negative values, or there is not. If there
6440 -- is, then all 1 bits may be interpreted as minus one, which is
6441 -- certainly invalid. Alternatively it is treated as the largest
6442 -- positive value, in which case the observation for modular types
6445 -- For float types, all 1-bits is a NaN (not a number), which is
6446 -- certainly an appropriately invalid value.
6448 elsif Is_Unsigned_Type (T)
6449 or else Is_Floating_Point_Type (T)
6450 or else Is_Enumeration_Type (T)
6452 Val := Make_Integer_Literal (Loc, 2 ** Size_To_Use - 1);
6454 -- Resolve as Unsigned_64, because the largest number we
6455 -- can generate is out of range of universal integer.
6457 Analyze_And_Resolve (Val, RTE (RE_Unsigned_64));
6459 -- Case of signed types
6463 Signed_Size : constant Uint :=
6464 UI_Min (Uint_63, Size_To_Use - 1);
6467 -- Normally we like to use the most negative number. The
6468 -- one exception is when this number is in the known
6469 -- subtype range and the largest positive number is not in
6470 -- the known subtype range.
6472 -- For this exceptional case, use largest positive value
6474 if Lo_Bound /= No_Uint and then Hi_Bound /= No_Uint
6475 and then Lo_Bound <= (-(2 ** Signed_Size))
6476 and then Hi_Bound < 2 ** Signed_Size
6478 Val := Make_Integer_Literal (Loc, 2 ** Signed_Size - 1);
6480 -- Normal case of largest negative value
6483 Val := Make_Integer_Literal (Loc, -(2 ** Signed_Size));
6488 -- Here for Initialize_Scalars case (or Invalid_Value attribute used)
6491 -- For float types, use float values from System.Scalar_Values
6493 if Is_Floating_Point_Type (T) then
6494 if Root_Type (T) = Standard_Short_Float then
6495 Val_RE := RE_IS_Isf;
6496 elsif Root_Type (T) = Standard_Float then
6497 Val_RE := RE_IS_Ifl;
6498 elsif Root_Type (T) = Standard_Long_Float then
6499 Val_RE := RE_IS_Ilf;
6500 else pragma Assert (Root_Type (T) = Standard_Long_Long_Float);
6501 Val_RE := RE_IS_Ill;
6504 -- If zero is invalid, use zero values from System.Scalar_Values
6506 elsif Lo_Bound /= No_Uint and then Lo_Bound > Uint_0 then
6507 if Size_To_Use <= 8 then
6508 Val_RE := RE_IS_Iz1;
6509 elsif Size_To_Use <= 16 then
6510 Val_RE := RE_IS_Iz2;
6511 elsif Size_To_Use <= 32 then
6512 Val_RE := RE_IS_Iz4;
6514 Val_RE := RE_IS_Iz8;
6517 -- For unsigned, use unsigned values from System.Scalar_Values
6519 elsif Is_Unsigned_Type (T) then
6520 if Size_To_Use <= 8 then
6521 Val_RE := RE_IS_Iu1;
6522 elsif Size_To_Use <= 16 then
6523 Val_RE := RE_IS_Iu2;
6524 elsif Size_To_Use <= 32 then
6525 Val_RE := RE_IS_Iu4;
6527 Val_RE := RE_IS_Iu8;
6530 -- For signed, use signed values from System.Scalar_Values
6533 if Size_To_Use <= 8 then
6534 Val_RE := RE_IS_Is1;
6535 elsif Size_To_Use <= 16 then
6536 Val_RE := RE_IS_Is2;
6537 elsif Size_To_Use <= 32 then
6538 Val_RE := RE_IS_Is4;
6540 Val_RE := RE_IS_Is8;
6544 Val := New_Occurrence_Of (RTE (Val_RE), Loc);
6547 -- The final expression is obtained by doing an unchecked conversion
6548 -- of this result to the base type of the required subtype. We use
6549 -- the base type to avoid the unchecked conversion from chopping
6550 -- bits, and then we set Kill_Range_Check to preserve the "bad"
6553 Result := Unchecked_Convert_To (Base_Type (T), Val);
6555 -- Ensure result is not truncated, since we want the "bad" bits
6556 -- and also kill range check on result.
6558 if Nkind (Result) = N_Unchecked_Type_Conversion then
6559 Set_No_Truncation (Result);
6560 Set_Kill_Range_Check (Result, True);
6565 -- String or Wide_[Wide]_String (must have Initialize_Scalars set)
6567 elsif Root_Type (T) = Standard_String
6569 Root_Type (T) = Standard_Wide_String
6571 Root_Type (T) = Standard_Wide_Wide_String
6573 pragma Assert (Init_Or_Norm_Scalars);
6576 Make_Aggregate (Loc,
6577 Component_Associations => New_List (
6578 Make_Component_Association (Loc,
6579 Choices => New_List (
6580 Make_Others_Choice (Loc)),
6583 (Component_Type (T), N, Esize (Root_Type (T))))));
6585 -- Access type is initialized to null
6587 elsif Is_Access_Type (T) then
6591 -- No other possibilities should arise, since we should only be
6592 -- calling Get_Simple_Init_Val if Needs_Simple_Initialization
6593 -- returned True, indicating one of the above cases held.
6596 raise Program_Error;
6600 when RE_Not_Available =>
6602 end Get_Simple_Init_Val;
6604 ------------------------------
6605 -- Has_New_Non_Standard_Rep --
6606 ------------------------------
6608 function Has_New_Non_Standard_Rep (T : Entity_Id) return Boolean is
6610 if not Is_Derived_Type (T) then
6611 return Has_Non_Standard_Rep (T)
6612 or else Has_Non_Standard_Rep (Root_Type (T));
6614 -- If Has_Non_Standard_Rep is not set on the derived type, the
6615 -- representation is fully inherited.
6617 elsif not Has_Non_Standard_Rep (T) then
6621 return First_Rep_Item (T) /= First_Rep_Item (Root_Type (T));
6623 -- May need a more precise check here: the First_Rep_Item may
6624 -- be a stream attribute, which does not affect the representation
6627 end Has_New_Non_Standard_Rep;
6633 function In_Runtime (E : Entity_Id) return Boolean is
6638 while Scope (S1) /= Standard_Standard loop
6642 return Chars (S1) = Name_System or else Chars (S1) = Name_Ada;
6645 ----------------------------
6646 -- Initialization_Warning --
6647 ----------------------------
6649 procedure Initialization_Warning (E : Entity_Id) is
6650 Warning_Needed : Boolean;
6653 Warning_Needed := False;
6655 if Ekind (Current_Scope) = E_Package
6656 and then Static_Elaboration_Desired (Current_Scope)
6659 if Is_Record_Type (E) then
6660 if Has_Discriminants (E)
6661 or else Is_Limited_Type (E)
6662 or else Has_Non_Standard_Rep (E)
6664 Warning_Needed := True;
6667 -- Verify that at least one component has an initialization
6668 -- expression. No need for a warning on a type if all its
6669 -- components have no initialization.
6675 Comp := First_Component (E);
6676 while Present (Comp) loop
6677 if Ekind (Comp) = E_Discriminant
6679 (Nkind (Parent (Comp)) = N_Component_Declaration
6680 and then Present (Expression (Parent (Comp))))
6682 Warning_Needed := True;
6686 Next_Component (Comp);
6691 if Warning_Needed then
6693 ("Objects of the type cannot be initialized " &
6694 "statically by default?",
6700 Error_Msg_N ("Object cannot be initialized statically?", E);
6703 end Initialization_Warning;
6709 function Init_Formals (Typ : Entity_Id) return List_Id is
6710 Loc : constant Source_Ptr := Sloc (Typ);
6714 -- First parameter is always _Init : in out typ. Note that we need
6715 -- this to be in/out because in the case of the task record value,
6716 -- there are default record fields (_Priority, _Size, -Task_Info)
6717 -- that may be referenced in the generated initialization routine.
6719 Formals := New_List (
6720 Make_Parameter_Specification (Loc,
6721 Defining_Identifier =>
6722 Make_Defining_Identifier (Loc, Name_uInit),
6724 Out_Present => True,
6725 Parameter_Type => New_Reference_To (Typ, Loc)));
6727 -- For task record value, or type that contains tasks, add two more
6728 -- formals, _Master : Master_Id and _Chain : in out Activation_Chain
6729 -- We also add these parameters for the task record type case.
6732 or else (Is_Record_Type (Typ) and then Is_Task_Record_Type (Typ))
6735 Make_Parameter_Specification (Loc,
6736 Defining_Identifier =>
6737 Make_Defining_Identifier (Loc, Name_uMaster),
6738 Parameter_Type => New_Reference_To (RTE (RE_Master_Id), Loc)));
6741 Make_Parameter_Specification (Loc,
6742 Defining_Identifier =>
6743 Make_Defining_Identifier (Loc, Name_uChain),
6745 Out_Present => True,
6747 New_Reference_To (RTE (RE_Activation_Chain), Loc)));
6750 Make_Parameter_Specification (Loc,
6751 Defining_Identifier =>
6752 Make_Defining_Identifier (Loc, Name_uTask_Name),
6755 New_Reference_To (Standard_String, Loc)));
6761 when RE_Not_Available =>
6765 -------------------------
6766 -- Init_Secondary_Tags --
6767 -------------------------
6769 procedure Init_Secondary_Tags
6772 Stmts_List : List_Id;
6773 Fixed_Comps : Boolean := True;
6774 Variable_Comps : Boolean := True)
6776 Loc : constant Source_Ptr := Sloc (Target);
6778 procedure Inherit_CPP_Tag
6781 Tag_Comp : Entity_Id;
6782 Iface_Tag : Node_Id);
6783 -- Inherit the C++ tag of the secondary dispatch table of Typ associated
6784 -- with Iface. Tag_Comp is the component of Typ that stores Iface_Tag.
6786 procedure Initialize_Tag
6789 Tag_Comp : Entity_Id;
6790 Iface_Tag : Node_Id);
6791 -- Initialize the tag of the secondary dispatch table of Typ associated
6792 -- with Iface. Tag_Comp is the component of Typ that stores Iface_Tag.
6793 -- Compiling under the CPP full ABI compatibility mode, if the ancestor
6794 -- of Typ CPP tagged type we generate code to inherit the contents of
6795 -- the dispatch table directly from the ancestor.
6797 ---------------------
6798 -- Inherit_CPP_Tag --
6799 ---------------------
6801 procedure Inherit_CPP_Tag
6804 Tag_Comp : Entity_Id;
6805 Iface_Tag : Node_Id)
6808 pragma Assert (Is_CPP_Class (Etype (Typ)));
6810 Append_To (Stmts_List,
6811 Build_Inherit_Prims (Loc,
6814 Make_Selected_Component (Loc,
6815 Prefix => New_Copy_Tree (Target),
6816 Selector_Name => New_Reference_To (Tag_Comp, Loc)),
6818 New_Reference_To (Iface_Tag, Loc),
6820 UI_To_Int (DT_Entry_Count (First_Tag_Component (Iface)))));
6821 end Inherit_CPP_Tag;
6823 --------------------
6824 -- Initialize_Tag --
6825 --------------------
6827 procedure Initialize_Tag
6830 Tag_Comp : Entity_Id;
6831 Iface_Tag : Node_Id)
6833 Comp_Typ : Entity_Id;
6834 Offset_To_Top_Comp : Entity_Id := Empty;
6837 -- Initialize the pointer to the secondary DT associated with the
6840 if not Is_Ancestor (Iface, Typ) then
6841 Append_To (Stmts_List,
6842 Make_Assignment_Statement (Loc,
6844 Make_Selected_Component (Loc,
6845 Prefix => New_Copy_Tree (Target),
6846 Selector_Name => New_Reference_To (Tag_Comp, Loc)),
6848 New_Reference_To (Iface_Tag, Loc)));
6851 Comp_Typ := Scope (Tag_Comp);
6853 -- Initialize the entries of the table of interfaces. We generate a
6854 -- different call when the parent of the type has variable size
6857 if Comp_Typ /= Etype (Comp_Typ)
6858 and then Is_Variable_Size_Record (Etype (Comp_Typ))
6859 and then Chars (Tag_Comp) /= Name_uTag
6862 (Present (DT_Offset_To_Top_Func (Tag_Comp)));
6864 -- Issue error if Set_Dynamic_Offset_To_Top is not available in a
6865 -- configurable run-time environment.
6867 if not RTE_Available (RE_Set_Dynamic_Offset_To_Top) then
6869 ("variable size record with interface types", Typ);
6874 -- Set_Dynamic_Offset_To_Top
6876 -- Interface_T => Iface'Tag,
6877 -- Offset_Value => n,
6878 -- Offset_Func => Fn'Address)
6880 Append_To (Stmts_List,
6881 Make_Procedure_Call_Statement (Loc,
6882 Name => New_Reference_To
6883 (RTE (RE_Set_Dynamic_Offset_To_Top), Loc),
6884 Parameter_Associations => New_List (
6885 Make_Attribute_Reference (Loc,
6886 Prefix => New_Copy_Tree (Target),
6887 Attribute_Name => Name_Address),
6889 Unchecked_Convert_To (RTE (RE_Tag),
6891 (Node (First_Elmt (Access_Disp_Table (Iface))),
6894 Unchecked_Convert_To
6895 (RTE (RE_Storage_Offset),
6896 Make_Attribute_Reference (Loc,
6898 Make_Selected_Component (Loc,
6899 Prefix => New_Copy_Tree (Target),
6901 New_Reference_To (Tag_Comp, Loc)),
6902 Attribute_Name => Name_Position)),
6904 Unchecked_Convert_To (RTE (RE_Offset_To_Top_Function_Ptr),
6905 Make_Attribute_Reference (Loc,
6906 Prefix => New_Reference_To
6907 (DT_Offset_To_Top_Func (Tag_Comp), Loc),
6908 Attribute_Name => Name_Address)))));
6910 -- In this case the next component stores the value of the
6911 -- offset to the top.
6913 Offset_To_Top_Comp := Next_Entity (Tag_Comp);
6914 pragma Assert (Present (Offset_To_Top_Comp));
6916 Append_To (Stmts_List,
6917 Make_Assignment_Statement (Loc,
6919 Make_Selected_Component (Loc,
6920 Prefix => New_Copy_Tree (Target),
6921 Selector_Name => New_Reference_To
6922 (Offset_To_Top_Comp, Loc)),
6924 Make_Attribute_Reference (Loc,
6926 Make_Selected_Component (Loc,
6927 Prefix => New_Copy_Tree (Target),
6929 New_Reference_To (Tag_Comp, Loc)),
6930 Attribute_Name => Name_Position)));
6932 -- Normal case: No discriminants in the parent type
6935 -- Don't need to set any value if this interface shares
6936 -- the primary dispatch table.
6938 if not Is_Ancestor (Iface, Typ) then
6939 Append_To (Stmts_List,
6940 Build_Set_Static_Offset_To_Top (Loc,
6941 Iface_Tag => New_Reference_To (Iface_Tag, Loc),
6943 Unchecked_Convert_To (RTE (RE_Storage_Offset),
6944 Make_Attribute_Reference (Loc,
6946 Make_Selected_Component (Loc,
6947 Prefix => New_Copy_Tree (Target),
6949 New_Reference_To (Tag_Comp, Loc)),
6950 Attribute_Name => Name_Position))));
6954 -- Register_Interface_Offset
6956 -- Interface_T => Iface'Tag,
6957 -- Is_Constant => True,
6958 -- Offset_Value => n,
6959 -- Offset_Func => null);
6961 if RTE_Available (RE_Register_Interface_Offset) then
6962 Append_To (Stmts_List,
6963 Make_Procedure_Call_Statement (Loc,
6964 Name => New_Reference_To
6965 (RTE (RE_Register_Interface_Offset), Loc),
6966 Parameter_Associations => New_List (
6967 Make_Attribute_Reference (Loc,
6968 Prefix => New_Copy_Tree (Target),
6969 Attribute_Name => Name_Address),
6971 Unchecked_Convert_To (RTE (RE_Tag),
6973 (Node (First_Elmt (Access_Disp_Table (Iface))), Loc)),
6975 New_Occurrence_Of (Standard_True, Loc),
6977 Unchecked_Convert_To
6978 (RTE (RE_Storage_Offset),
6979 Make_Attribute_Reference (Loc,
6981 Make_Selected_Component (Loc,
6982 Prefix => New_Copy_Tree (Target),
6984 New_Reference_To (Tag_Comp, Loc)),
6985 Attribute_Name => Name_Position)),
6994 Full_Typ : Entity_Id;
6995 Ifaces_List : Elist_Id;
6996 Ifaces_Comp_List : Elist_Id;
6997 Ifaces_Tag_List : Elist_Id;
6998 Iface_Elmt : Elmt_Id;
6999 Iface_Comp_Elmt : Elmt_Id;
7000 Iface_Tag_Elmt : Elmt_Id;
7002 In_Variable_Pos : Boolean;
7004 -- Start of processing for Init_Secondary_Tags
7007 -- Handle private types
7009 if Present (Full_View (Typ)) then
7010 Full_Typ := Full_View (Typ);
7015 Collect_Interfaces_Info
7016 (Full_Typ, Ifaces_List, Ifaces_Comp_List, Ifaces_Tag_List);
7018 Iface_Elmt := First_Elmt (Ifaces_List);
7019 Iface_Comp_Elmt := First_Elmt (Ifaces_Comp_List);
7020 Iface_Tag_Elmt := First_Elmt (Ifaces_Tag_List);
7021 while Present (Iface_Elmt) loop
7022 Tag_Comp := Node (Iface_Comp_Elmt);
7024 -- If we are compiling under the CPP full ABI compatibility mode and
7025 -- the ancestor is a CPP_Pragma tagged type then we generate code to
7026 -- inherit the contents of the dispatch table directly from the
7029 if Is_CPP_Class (Etype (Full_Typ)) then
7030 Inherit_CPP_Tag (Full_Typ,
7031 Iface => Node (Iface_Elmt),
7032 Tag_Comp => Tag_Comp,
7033 Iface_Tag => Node (Iface_Tag_Elmt));
7035 -- Otherwise generate code to initialize the tag
7038 -- Check if the parent of the record type has variable size
7041 In_Variable_Pos := Scope (Tag_Comp) /= Etype (Scope (Tag_Comp))
7042 and then Is_Variable_Size_Record (Etype (Scope (Tag_Comp)));
7044 if (In_Variable_Pos and then Variable_Comps)
7045 or else (not In_Variable_Pos and then Fixed_Comps)
7047 Initialize_Tag (Full_Typ,
7048 Iface => Node (Iface_Elmt),
7049 Tag_Comp => Tag_Comp,
7050 Iface_Tag => Node (Iface_Tag_Elmt));
7054 Next_Elmt (Iface_Elmt);
7055 Next_Elmt (Iface_Comp_Elmt);
7056 Next_Elmt (Iface_Tag_Elmt);
7058 end Init_Secondary_Tags;
7060 -----------------------------
7061 -- Is_Variable_Size_Record --
7062 -----------------------------
7064 function Is_Variable_Size_Record (E : Entity_Id) return Boolean is
7066 Comp_Typ : Entity_Id;
7069 function Is_Constant_Bound (Exp : Node_Id) return Boolean;
7070 -- To simplify handling of array components. Determines whether the
7071 -- given bound is constant (a constant or enumeration literal, or an
7072 -- integer literal) as opposed to per-object, through an expression
7073 -- or a discriminant.
7075 -----------------------
7076 -- Is_Constant_Bound --
7077 -----------------------
7079 function Is_Constant_Bound (Exp : Node_Id) return Boolean is
7081 if Nkind (Exp) = N_Integer_Literal then
7085 Is_Entity_Name (Exp)
7086 and then Present (Entity (Exp))
7088 (Ekind (Entity (Exp)) = E_Constant
7089 or else Ekind (Entity (Exp)) = E_Enumeration_Literal);
7091 end Is_Constant_Bound;
7093 -- Start of processing for Is_Variable_Sized_Record
7096 pragma Assert (Is_Record_Type (E));
7098 Comp := First_Entity (E);
7099 while Present (Comp) loop
7100 Comp_Typ := Etype (Comp);
7102 if Is_Record_Type (Comp_Typ) then
7104 -- Recursive call if the record type has discriminants
7106 if Has_Discriminants (Comp_Typ)
7107 and then Is_Variable_Size_Record (Comp_Typ)
7112 elsif Is_Array_Type (Comp_Typ) then
7114 -- Check if some index is initialized with a non-constant value
7116 Idx := First_Index (Comp_Typ);
7117 while Present (Idx) loop
7118 if Nkind (Idx) = N_Range then
7119 if not Is_Constant_Bound (Low_Bound (Idx))
7121 not Is_Constant_Bound (High_Bound (Idx))
7127 Idx := Next_Index (Idx);
7135 end Is_Variable_Size_Record;
7137 ----------------------------------------
7138 -- Make_Controlling_Function_Wrappers --
7139 ----------------------------------------
7141 procedure Make_Controlling_Function_Wrappers
7142 (Tag_Typ : Entity_Id;
7143 Decl_List : out List_Id;
7144 Body_List : out List_Id)
7146 Loc : constant Source_Ptr := Sloc (Tag_Typ);
7147 Prim_Elmt : Elmt_Id;
7149 Actual_List : List_Id;
7150 Formal_List : List_Id;
7152 Par_Formal : Entity_Id;
7153 Formal_Node : Node_Id;
7154 Func_Body : Node_Id;
7155 Func_Decl : Node_Id;
7156 Func_Spec : Node_Id;
7157 Return_Stmt : Node_Id;
7160 Decl_List := New_List;
7161 Body_List := New_List;
7163 Prim_Elmt := First_Elmt (Primitive_Operations (Tag_Typ));
7165 while Present (Prim_Elmt) loop
7166 Subp := Node (Prim_Elmt);
7168 -- If a primitive function with a controlling result of the type has
7169 -- not been overridden by the user, then we must create a wrapper
7170 -- function here that effectively overrides it and invokes the
7171 -- (non-abstract) parent function. This can only occur for a null
7172 -- extension. Note that functions with anonymous controlling access
7173 -- results don't qualify and must be overridden. We also exclude
7174 -- Input attributes, since each type will have its own version of
7175 -- Input constructed by the expander. The test for Comes_From_Source
7176 -- is needed to distinguish inherited operations from renamings
7177 -- (which also have Alias set).
7179 -- The function may be abstract, or require_Overriding may be set
7180 -- for it, because tests for null extensions may already have reset
7181 -- the Is_Abstract_Subprogram_Flag. If Requires_Overriding is not
7182 -- set, functions that need wrappers are recognized by having an
7183 -- alias that returns the parent type.
7185 if Comes_From_Source (Subp)
7186 or else No (Alias (Subp))
7187 or else Ekind (Subp) /= E_Function
7188 or else not Has_Controlling_Result (Subp)
7189 or else Is_Access_Type (Etype (Subp))
7190 or else Is_Abstract_Subprogram (Alias (Subp))
7191 or else Is_TSS (Subp, TSS_Stream_Input)
7195 elsif Is_Abstract_Subprogram (Subp)
7196 or else Requires_Overriding (Subp)
7198 (Is_Null_Extension (Etype (Subp))
7199 and then Etype (Alias (Subp)) /= Etype (Subp))
7201 Formal_List := No_List;
7202 Formal := First_Formal (Subp);
7204 if Present (Formal) then
7205 Formal_List := New_List;
7207 while Present (Formal) loop
7209 (Make_Parameter_Specification
7211 Defining_Identifier =>
7212 Make_Defining_Identifier (Sloc (Formal),
7213 Chars => Chars (Formal)),
7214 In_Present => In_Present (Parent (Formal)),
7215 Out_Present => Out_Present (Parent (Formal)),
7216 Null_Exclusion_Present =>
7217 Null_Exclusion_Present (Parent (Formal)),
7219 New_Reference_To (Etype (Formal), Loc),
7221 New_Copy_Tree (Expression (Parent (Formal)))),
7224 Next_Formal (Formal);
7229 Make_Function_Specification (Loc,
7230 Defining_Unit_Name =>
7231 Make_Defining_Identifier (Loc,
7232 Chars => Chars (Subp)),
7233 Parameter_Specifications => Formal_List,
7234 Result_Definition =>
7235 New_Reference_To (Etype (Subp), Loc));
7237 Func_Decl := Make_Subprogram_Declaration (Loc, Func_Spec);
7238 Append_To (Decl_List, Func_Decl);
7240 -- Build a wrapper body that calls the parent function. The body
7241 -- contains a single return statement that returns an extension
7242 -- aggregate whose ancestor part is a call to the parent function,
7243 -- passing the formals as actuals (with any controlling arguments
7244 -- converted to the types of the corresponding formals of the
7245 -- parent function, which might be anonymous access types), and
7246 -- having a null extension.
7248 Formal := First_Formal (Subp);
7249 Par_Formal := First_Formal (Alias (Subp));
7250 Formal_Node := First (Formal_List);
7252 if Present (Formal) then
7253 Actual_List := New_List;
7255 Actual_List := No_List;
7258 while Present (Formal) loop
7259 if Is_Controlling_Formal (Formal) then
7260 Append_To (Actual_List,
7261 Make_Type_Conversion (Loc,
7263 New_Occurrence_Of (Etype (Par_Formal), Loc),
7266 (Defining_Identifier (Formal_Node), Loc)));
7271 (Defining_Identifier (Formal_Node), Loc));
7274 Next_Formal (Formal);
7275 Next_Formal (Par_Formal);
7280 Make_Simple_Return_Statement (Loc,
7282 Make_Extension_Aggregate (Loc,
7284 Make_Function_Call (Loc,
7285 Name => New_Reference_To (Alias (Subp), Loc),
7286 Parameter_Associations => Actual_List),
7287 Null_Record_Present => True));
7290 Make_Subprogram_Body (Loc,
7291 Specification => New_Copy_Tree (Func_Spec),
7292 Declarations => Empty_List,
7293 Handled_Statement_Sequence =>
7294 Make_Handled_Sequence_Of_Statements (Loc,
7295 Statements => New_List (Return_Stmt)));
7297 Set_Defining_Unit_Name
7298 (Specification (Func_Body),
7299 Make_Defining_Identifier (Loc, Chars (Subp)));
7301 Append_To (Body_List, Func_Body);
7303 -- Replace the inherited function with the wrapper function
7304 -- in the primitive operations list.
7306 Override_Dispatching_Operation
7307 (Tag_Typ, Subp, New_Op => Defining_Unit_Name (Func_Spec));
7311 Next_Elmt (Prim_Elmt);
7313 end Make_Controlling_Function_Wrappers;
7319 -- <Make_Eq_If shared components>
7321 -- when V1 => <Make_Eq_Case> on subcomponents
7323 -- when Vn => <Make_Eq_Case> on subcomponents
7326 function Make_Eq_Case
7329 Discr : Entity_Id := Empty) return List_Id
7331 Loc : constant Source_Ptr := Sloc (E);
7332 Result : constant List_Id := New_List;
7337 Append_To (Result, Make_Eq_If (E, Component_Items (CL)));
7339 if No (Variant_Part (CL)) then
7343 Variant := First_Non_Pragma (Variants (Variant_Part (CL)));
7345 if No (Variant) then
7349 Alt_List := New_List;
7351 while Present (Variant) loop
7352 Append_To (Alt_List,
7353 Make_Case_Statement_Alternative (Loc,
7354 Discrete_Choices => New_Copy_List (Discrete_Choices (Variant)),
7355 Statements => Make_Eq_Case (E, Component_List (Variant))));
7357 Next_Non_Pragma (Variant);
7360 -- If we have an Unchecked_Union, use one of the parameters that
7361 -- captures the discriminants.
7363 if Is_Unchecked_Union (E) then
7365 Make_Case_Statement (Loc,
7366 Expression => New_Reference_To (Discr, Loc),
7367 Alternatives => Alt_List));
7371 Make_Case_Statement (Loc,
7373 Make_Selected_Component (Loc,
7374 Prefix => Make_Identifier (Loc, Name_X),
7375 Selector_Name => New_Copy (Name (Variant_Part (CL)))),
7376 Alternatives => Alt_List));
7397 -- or a null statement if the list L is empty
7401 L : List_Id) return Node_Id
7403 Loc : constant Source_Ptr := Sloc (E);
7405 Field_Name : Name_Id;
7410 return Make_Null_Statement (Loc);
7415 C := First_Non_Pragma (L);
7416 while Present (C) loop
7417 Field_Name := Chars (Defining_Identifier (C));
7419 -- The tags must not be compared: they are not part of the value.
7420 -- Ditto for the controller component, if present.
7422 -- Note also that in the following, we use Make_Identifier for
7423 -- the component names. Use of New_Reference_To to identify the
7424 -- components would be incorrect because the wrong entities for
7425 -- discriminants could be picked up in the private type case.
7427 if Field_Name /= Name_uTag
7429 Field_Name /= Name_uController
7431 Evolve_Or_Else (Cond,
7434 Make_Selected_Component (Loc,
7435 Prefix => Make_Identifier (Loc, Name_X),
7437 Make_Identifier (Loc, Field_Name)),
7440 Make_Selected_Component (Loc,
7441 Prefix => Make_Identifier (Loc, Name_Y),
7443 Make_Identifier (Loc, Field_Name))));
7446 Next_Non_Pragma (C);
7450 return Make_Null_Statement (Loc);
7454 Make_Implicit_If_Statement (E,
7456 Then_Statements => New_List (
7457 Make_Simple_Return_Statement (Loc,
7458 Expression => New_Occurrence_Of (Standard_False, Loc))));
7463 -------------------------------
7464 -- Make_Null_Procedure_Specs --
7465 -------------------------------
7467 procedure Make_Null_Procedure_Specs
7468 (Tag_Typ : Entity_Id;
7469 Decl_List : out List_Id)
7471 Loc : constant Source_Ptr := Sloc (Tag_Typ);
7473 Formal_List : List_Id;
7474 Parent_Subp : Entity_Id;
7475 Prim_Elmt : Elmt_Id;
7476 Proc_Spec : Node_Id;
7477 Proc_Decl : Node_Id;
7480 function Is_Null_Interface_Primitive (E : Entity_Id) return Boolean;
7481 -- Returns True if E is a null procedure that is an interface primitive
7483 ---------------------------------
7484 -- Is_Null_Interface_Primitive --
7485 ---------------------------------
7487 function Is_Null_Interface_Primitive (E : Entity_Id) return Boolean is
7489 return Comes_From_Source (E)
7490 and then Is_Dispatching_Operation (E)
7491 and then Ekind (E) = E_Procedure
7492 and then Null_Present (Parent (E))
7493 and then Is_Interface (Find_Dispatching_Type (E));
7494 end Is_Null_Interface_Primitive;
7496 -- Start of processing for Make_Null_Procedure_Specs
7499 Decl_List := New_List;
7500 Prim_Elmt := First_Elmt (Primitive_Operations (Tag_Typ));
7501 while Present (Prim_Elmt) loop
7502 Subp := Node (Prim_Elmt);
7504 -- If a null procedure inherited from an interface has not been
7505 -- overridden, then we build a null procedure declaration to
7506 -- override the inherited procedure.
7508 Parent_Subp := Alias (Subp);
7510 if Present (Parent_Subp)
7511 and then Is_Null_Interface_Primitive (Parent_Subp)
7513 Formal_List := No_List;
7514 Formal := First_Formal (Subp);
7516 if Present (Formal) then
7517 Formal_List := New_List;
7519 while Present (Formal) loop
7521 (Make_Parameter_Specification (Loc,
7522 Defining_Identifier =>
7523 Make_Defining_Identifier (Sloc (Formal),
7524 Chars => Chars (Formal)),
7525 In_Present => In_Present (Parent (Formal)),
7526 Out_Present => Out_Present (Parent (Formal)),
7527 Null_Exclusion_Present =>
7528 Null_Exclusion_Present (Parent (Formal)),
7530 New_Reference_To (Etype (Formal), Loc),
7532 New_Copy_Tree (Expression (Parent (Formal)))),
7535 Next_Formal (Formal);
7540 Make_Procedure_Specification (Loc,
7541 Defining_Unit_Name =>
7542 Make_Defining_Identifier (Loc, Chars (Subp)),
7543 Parameter_Specifications => Formal_List);
7544 Set_Null_Present (Proc_Spec);
7546 Proc_Decl := Make_Subprogram_Declaration (Loc, Proc_Spec);
7547 Append_To (Decl_List, Proc_Decl);
7548 Analyze (Proc_Decl);
7551 Next_Elmt (Prim_Elmt);
7553 end Make_Null_Procedure_Specs;
7555 -------------------------------------
7556 -- Make_Predefined_Primitive_Specs --
7557 -------------------------------------
7559 procedure Make_Predefined_Primitive_Specs
7560 (Tag_Typ : Entity_Id;
7561 Predef_List : out List_Id;
7562 Renamed_Eq : out Entity_Id)
7564 Loc : constant Source_Ptr := Sloc (Tag_Typ);
7565 Res : constant List_Id := New_List;
7567 Eq_Needed : Boolean;
7569 Eq_Name : Name_Id := Name_Op_Eq;
7571 function Is_Predefined_Eq_Renaming (Prim : Node_Id) return Boolean;
7572 -- Returns true if Prim is a renaming of an unresolved predefined
7573 -- equality operation.
7575 -------------------------------
7576 -- Is_Predefined_Eq_Renaming --
7577 -------------------------------
7579 function Is_Predefined_Eq_Renaming (Prim : Node_Id) return Boolean is
7581 return Chars (Prim) /= Name_Op_Eq
7582 and then Present (Alias (Prim))
7583 and then Comes_From_Source (Prim)
7584 and then Is_Intrinsic_Subprogram (Alias (Prim))
7585 and then Chars (Alias (Prim)) = Name_Op_Eq;
7586 end Is_Predefined_Eq_Renaming;
7588 -- Start of processing for Make_Predefined_Primitive_Specs
7591 Renamed_Eq := Empty;
7595 Append_To (Res, Predef_Spec_Or_Body (Loc,
7598 Profile => New_List (
7599 Make_Parameter_Specification (Loc,
7600 Defining_Identifier => Make_Defining_Identifier (Loc, Name_X),
7601 Parameter_Type => New_Reference_To (Tag_Typ, Loc))),
7603 Ret_Type => Standard_Long_Long_Integer));
7605 -- Spec of _Alignment
7607 Append_To (Res, Predef_Spec_Or_Body (Loc,
7609 Name => Name_uAlignment,
7610 Profile => New_List (
7611 Make_Parameter_Specification (Loc,
7612 Defining_Identifier => Make_Defining_Identifier (Loc, Name_X),
7613 Parameter_Type => New_Reference_To (Tag_Typ, Loc))),
7615 Ret_Type => Standard_Integer));
7617 -- Specs for dispatching stream attributes
7620 Stream_Op_TSS_Names :
7621 constant array (Integer range <>) of TSS_Name_Type :=
7628 for Op in Stream_Op_TSS_Names'Range loop
7629 if Stream_Operation_OK (Tag_Typ, Stream_Op_TSS_Names (Op)) then
7631 Predef_Stream_Attr_Spec (Loc, Tag_Typ,
7632 Stream_Op_TSS_Names (Op)));
7637 -- Spec of "=" is expanded if the type is not limited and if a
7638 -- user defined "=" was not already declared for the non-full
7639 -- view of a private extension
7641 if not Is_Limited_Type (Tag_Typ) then
7643 Prim := First_Elmt (Primitive_Operations (Tag_Typ));
7644 while Present (Prim) loop
7646 -- If a primitive is encountered that renames the predefined
7647 -- equality operator before reaching any explicit equality
7648 -- primitive, then we still need to create a predefined
7649 -- equality function, because calls to it can occur via
7650 -- the renaming. A new name is created for the equality
7651 -- to avoid conflicting with any user-defined equality.
7652 -- (Note that this doesn't account for renamings of
7653 -- equality nested within subpackages???)
7655 if Is_Predefined_Eq_Renaming (Node (Prim)) then
7656 Eq_Name := New_External_Name (Chars (Node (Prim)), 'E');
7658 -- User-defined equality
7660 elsif Chars (Node (Prim)) = Name_Op_Eq
7661 and then Etype (First_Formal (Node (Prim))) =
7662 Etype (Next_Formal (First_Formal (Node (Prim))))
7663 and then Base_Type (Etype (Node (Prim))) = Standard_Boolean
7665 if No (Alias (Node (Prim)))
7666 or else Nkind (Unit_Declaration_Node (Node (Prim))) =
7667 N_Subprogram_Renaming_Declaration
7672 -- If the parent is not an interface type and has an abstract
7673 -- equality function, the inherited equality is abstract as
7674 -- well, and no body can be created for it.
7676 elsif not Is_Interface (Etype (Tag_Typ))
7677 and then Present (Alias (Node (Prim)))
7678 and then Is_Abstract_Subprogram (Alias (Node (Prim)))
7683 -- If the type has an equality function corresponding with
7684 -- a primitive defined in an interface type, the inherited
7685 -- equality is abstract as well, and no body can be created
7688 elsif Present (Alias (Node (Prim)))
7689 and then Comes_From_Source (Ultimate_Alias (Node (Prim)))
7692 (Find_Dispatching_Type (Ultimate_Alias (Node (Prim))))
7702 -- If a renaming of predefined equality was found but there was no
7703 -- user-defined equality (so Eq_Needed is still true), then set the
7704 -- name back to Name_Op_Eq. But in the case where a user-defined
7705 -- equality was located after such a renaming, then the predefined
7706 -- equality function is still needed, so Eq_Needed must be set back
7709 if Eq_Name /= Name_Op_Eq then
7711 Eq_Name := Name_Op_Eq;
7718 Eq_Spec := Predef_Spec_Or_Body (Loc,
7721 Profile => New_List (
7722 Make_Parameter_Specification (Loc,
7723 Defining_Identifier =>
7724 Make_Defining_Identifier (Loc, Name_X),
7725 Parameter_Type => New_Reference_To (Tag_Typ, Loc)),
7726 Make_Parameter_Specification (Loc,
7727 Defining_Identifier =>
7728 Make_Defining_Identifier (Loc, Name_Y),
7729 Parameter_Type => New_Reference_To (Tag_Typ, Loc))),
7730 Ret_Type => Standard_Boolean);
7731 Append_To (Res, Eq_Spec);
7733 if Eq_Name /= Name_Op_Eq then
7734 Renamed_Eq := Defining_Unit_Name (Specification (Eq_Spec));
7736 Prim := First_Elmt (Primitive_Operations (Tag_Typ));
7737 while Present (Prim) loop
7739 -- Any renamings of equality that appeared before an
7740 -- overriding equality must be updated to refer to the
7741 -- entity for the predefined equality, otherwise calls via
7742 -- the renaming would get incorrectly resolved to call the
7743 -- user-defined equality function.
7745 if Is_Predefined_Eq_Renaming (Node (Prim)) then
7746 Set_Alias (Node (Prim), Renamed_Eq);
7748 -- Exit upon encountering a user-defined equality
7750 elsif Chars (Node (Prim)) = Name_Op_Eq
7751 and then No (Alias (Node (Prim)))
7761 -- Spec for dispatching assignment
7763 Append_To (Res, Predef_Spec_Or_Body (Loc,
7765 Name => Name_uAssign,
7766 Profile => New_List (
7767 Make_Parameter_Specification (Loc,
7768 Defining_Identifier => Make_Defining_Identifier (Loc, Name_X),
7769 Out_Present => True,
7770 Parameter_Type => New_Reference_To (Tag_Typ, Loc)),
7772 Make_Parameter_Specification (Loc,
7773 Defining_Identifier => Make_Defining_Identifier (Loc, Name_Y),
7774 Parameter_Type => New_Reference_To (Tag_Typ, Loc)))));
7777 -- Ada 2005: Generate declarations for the following primitive
7778 -- operations for limited interfaces and synchronized types that
7779 -- implement a limited interface.
7781 -- Disp_Asynchronous_Select
7782 -- Disp_Conditional_Select
7783 -- Disp_Get_Prim_Op_Kind
7786 -- Disp_Timed_Select
7788 -- These operations cannot be implemented on VM targets, so we simply
7789 -- disable their generation in this case. We also disable generation
7790 -- of these bodies if No_Dispatching_Calls is active.
7792 if Ada_Version >= Ada_05
7793 and then VM_Target = No_VM
7794 and then RTE_Available (RE_Select_Specific_Data)
7796 -- These primitives are defined abstract in interface types
7798 if Is_Interface (Tag_Typ)
7799 and then Is_Limited_Record (Tag_Typ)
7802 Make_Abstract_Subprogram_Declaration (Loc,
7804 Make_Disp_Asynchronous_Select_Spec (Tag_Typ)));
7807 Make_Abstract_Subprogram_Declaration (Loc,
7809 Make_Disp_Conditional_Select_Spec (Tag_Typ)));
7812 Make_Abstract_Subprogram_Declaration (Loc,
7814 Make_Disp_Get_Prim_Op_Kind_Spec (Tag_Typ)));
7817 Make_Abstract_Subprogram_Declaration (Loc,
7819 Make_Disp_Get_Task_Id_Spec (Tag_Typ)));
7822 Make_Abstract_Subprogram_Declaration (Loc,
7824 Make_Disp_Requeue_Spec (Tag_Typ)));
7827 Make_Abstract_Subprogram_Declaration (Loc,
7829 Make_Disp_Timed_Select_Spec (Tag_Typ)));
7831 -- If the ancestor is an interface type we declare non-abstract
7832 -- primitives to override the abstract primitives of the interface
7835 elsif (not Is_Interface (Tag_Typ)
7836 and then Is_Interface (Etype (Tag_Typ))
7837 and then Is_Limited_Record (Etype (Tag_Typ)))
7839 (Is_Concurrent_Record_Type (Tag_Typ)
7840 and then Has_Interfaces (Tag_Typ))
7843 Make_Subprogram_Declaration (Loc,
7845 Make_Disp_Asynchronous_Select_Spec (Tag_Typ)));
7848 Make_Subprogram_Declaration (Loc,
7850 Make_Disp_Conditional_Select_Spec (Tag_Typ)));
7853 Make_Subprogram_Declaration (Loc,
7855 Make_Disp_Get_Prim_Op_Kind_Spec (Tag_Typ)));
7858 Make_Subprogram_Declaration (Loc,
7860 Make_Disp_Get_Task_Id_Spec (Tag_Typ)));
7863 Make_Subprogram_Declaration (Loc,
7865 Make_Disp_Requeue_Spec (Tag_Typ)));
7868 Make_Subprogram_Declaration (Loc,
7870 Make_Disp_Timed_Select_Spec (Tag_Typ)));
7874 -- Specs for finalization actions that may be required in case a future
7875 -- extension contain a controlled element. We generate those only for
7876 -- root tagged types where they will get dummy bodies or when the type
7877 -- has controlled components and their body must be generated. It is
7878 -- also impossible to provide those for tagged types defined within
7879 -- s-finimp since it would involve circularity problems
7881 if In_Finalization_Root (Tag_Typ) then
7884 -- We also skip these if finalization is not available
7886 elsif Restriction_Active (No_Finalization) then
7889 elsif Etype (Tag_Typ) = Tag_Typ
7890 or else Needs_Finalization (Tag_Typ)
7892 -- Ada 2005 (AI-251): We must also generate these subprograms if
7893 -- the immediate ancestor is an interface to ensure the correct
7894 -- initialization of its dispatch table.
7896 or else (not Is_Interface (Tag_Typ)
7897 and then Is_Interface (Etype (Tag_Typ)))
7899 -- Ada 205 (AI-251): We must also generate these subprograms if
7900 -- the parent of an nonlimited interface is a limited interface
7902 or else (Is_Interface (Tag_Typ)
7903 and then not Is_Limited_Interface (Tag_Typ)
7904 and then Is_Limited_Interface (Etype (Tag_Typ)))
7906 if not Is_Limited_Type (Tag_Typ) then
7908 Predef_Deep_Spec (Loc, Tag_Typ, TSS_Deep_Adjust));
7911 Append_To (Res, Predef_Deep_Spec (Loc, Tag_Typ, TSS_Deep_Finalize));
7915 end Make_Predefined_Primitive_Specs;
7917 ---------------------------------
7918 -- Needs_Simple_Initialization --
7919 ---------------------------------
7921 function Needs_Simple_Initialization (T : Entity_Id) return Boolean is
7923 -- Check for private type, in which case test applies to the underlying
7924 -- type of the private type.
7926 if Is_Private_Type (T) then
7928 RT : constant Entity_Id := Underlying_Type (T);
7931 if Present (RT) then
7932 return Needs_Simple_Initialization (RT);
7938 -- Cases needing simple initialization are access types, and, if pragma
7939 -- Normalize_Scalars or Initialize_Scalars is in effect, then all scalar
7942 elsif Is_Access_Type (T)
7943 or else (Init_Or_Norm_Scalars and then (Is_Scalar_Type (T)))
7947 -- If Initialize/Normalize_Scalars is in effect, string objects also
7948 -- need initialization, unless they are created in the course of
7949 -- expanding an aggregate (since in the latter case they will be
7950 -- filled with appropriate initializing values before they are used).
7952 elsif Init_Or_Norm_Scalars
7954 (Root_Type (T) = Standard_String
7955 or else Root_Type (T) = Standard_Wide_String
7956 or else Root_Type (T) = Standard_Wide_Wide_String)
7959 or else Nkind (Associated_Node_For_Itype (T)) /= N_Aggregate)
7966 end Needs_Simple_Initialization;
7968 ----------------------
7969 -- Predef_Deep_Spec --
7970 ----------------------
7972 function Predef_Deep_Spec
7974 Tag_Typ : Entity_Id;
7975 Name : TSS_Name_Type;
7976 For_Body : Boolean := False) return Node_Id
7982 if Name = TSS_Deep_Finalize then
7984 Type_B := Standard_Boolean;
7988 Make_Parameter_Specification (Loc,
7989 Defining_Identifier => Make_Defining_Identifier (Loc, Name_L),
7991 Out_Present => True,
7993 New_Reference_To (RTE (RE_Finalizable_Ptr), Loc)));
7994 Type_B := Standard_Short_Short_Integer;
7998 Make_Parameter_Specification (Loc,
7999 Defining_Identifier => Make_Defining_Identifier (Loc, Name_V),
8001 Out_Present => True,
8002 Parameter_Type => New_Reference_To (Tag_Typ, Loc)));
8005 Make_Parameter_Specification (Loc,
8006 Defining_Identifier => Make_Defining_Identifier (Loc, Name_B),
8007 Parameter_Type => New_Reference_To (Type_B, Loc)));
8009 return Predef_Spec_Or_Body (Loc,
8010 Name => Make_TSS_Name (Tag_Typ, Name),
8013 For_Body => For_Body);
8016 when RE_Not_Available =>
8018 end Predef_Deep_Spec;
8020 -------------------------
8021 -- Predef_Spec_Or_Body --
8022 -------------------------
8024 function Predef_Spec_Or_Body
8026 Tag_Typ : Entity_Id;
8029 Ret_Type : Entity_Id := Empty;
8030 For_Body : Boolean := False) return Node_Id
8032 Id : constant Entity_Id := Make_Defining_Identifier (Loc, Name);
8036 Set_Is_Public (Id, Is_Public (Tag_Typ));
8038 -- The internal flag is set to mark these declarations because they have
8039 -- specific properties. First, they are primitives even if they are not
8040 -- defined in the type scope (the freezing point is not necessarily in
8041 -- the same scope). Second, the predefined equality can be overridden by
8042 -- a user-defined equality, no body will be generated in this case.
8044 Set_Is_Internal (Id);
8046 if not Debug_Generated_Code then
8047 Set_Debug_Info_Off (Id);
8050 if No (Ret_Type) then
8052 Make_Procedure_Specification (Loc,
8053 Defining_Unit_Name => Id,
8054 Parameter_Specifications => Profile);
8057 Make_Function_Specification (Loc,
8058 Defining_Unit_Name => Id,
8059 Parameter_Specifications => Profile,
8060 Result_Definition =>
8061 New_Reference_To (Ret_Type, Loc));
8064 if Is_Interface (Tag_Typ) then
8065 return Make_Abstract_Subprogram_Declaration (Loc, Spec);
8067 -- If body case, return empty subprogram body. Note that this is ill-
8068 -- formed, because there is not even a null statement, and certainly not
8069 -- a return in the function case. The caller is expected to do surgery
8070 -- on the body to add the appropriate stuff.
8073 return Make_Subprogram_Body (Loc, Spec, Empty_List, Empty);
8075 -- For the case of an Input attribute predefined for an abstract type,
8076 -- generate an abstract specification. This will never be called, but we
8077 -- need the slot allocated in the dispatching table so that attributes
8078 -- typ'Class'Input and typ'Class'Output will work properly.
8080 elsif Is_TSS (Name, TSS_Stream_Input)
8081 and then Is_Abstract_Type (Tag_Typ)
8083 return Make_Abstract_Subprogram_Declaration (Loc, Spec);
8085 -- Normal spec case, where we return a subprogram declaration
8088 return Make_Subprogram_Declaration (Loc, Spec);
8090 end Predef_Spec_Or_Body;
8092 -----------------------------
8093 -- Predef_Stream_Attr_Spec --
8094 -----------------------------
8096 function Predef_Stream_Attr_Spec
8098 Tag_Typ : Entity_Id;
8099 Name : TSS_Name_Type;
8100 For_Body : Boolean := False) return Node_Id
8102 Ret_Type : Entity_Id;
8105 if Name = TSS_Stream_Input then
8106 Ret_Type := Tag_Typ;
8111 return Predef_Spec_Or_Body (Loc,
8112 Name => Make_TSS_Name (Tag_Typ, Name),
8114 Profile => Build_Stream_Attr_Profile (Loc, Tag_Typ, Name),
8115 Ret_Type => Ret_Type,
8116 For_Body => For_Body);
8117 end Predef_Stream_Attr_Spec;
8119 ---------------------------------
8120 -- Predefined_Primitive_Bodies --
8121 ---------------------------------
8123 function Predefined_Primitive_Bodies
8124 (Tag_Typ : Entity_Id;
8125 Renamed_Eq : Entity_Id) return List_Id
8127 Loc : constant Source_Ptr := Sloc (Tag_Typ);
8128 Res : constant List_Id := New_List;
8131 Eq_Needed : Boolean;
8135 pragma Warnings (Off, Ent);
8138 pragma Assert (not Is_Interface (Tag_Typ));
8140 -- See if we have a predefined "=" operator
8142 if Present (Renamed_Eq) then
8144 Eq_Name := Chars (Renamed_Eq);
8146 -- If the parent is an interface type then it has defined all the
8147 -- predefined primitives abstract and we need to check if the type
8148 -- has some user defined "=" function to avoid generating it.
8150 elsif Is_Interface (Etype (Tag_Typ)) then
8152 Eq_Name := Name_Op_Eq;
8154 Prim := First_Elmt (Primitive_Operations (Tag_Typ));
8155 while Present (Prim) loop
8156 if Chars (Node (Prim)) = Name_Op_Eq
8157 and then not Is_Internal (Node (Prim))
8171 Prim := First_Elmt (Primitive_Operations (Tag_Typ));
8172 while Present (Prim) loop
8173 if Chars (Node (Prim)) = Name_Op_Eq
8174 and then Is_Internal (Node (Prim))
8177 Eq_Name := Name_Op_Eq;
8185 -- Body of _Alignment
8187 Decl := Predef_Spec_Or_Body (Loc,
8189 Name => Name_uAlignment,
8190 Profile => New_List (
8191 Make_Parameter_Specification (Loc,
8192 Defining_Identifier => Make_Defining_Identifier (Loc, Name_X),
8193 Parameter_Type => New_Reference_To (Tag_Typ, Loc))),
8195 Ret_Type => Standard_Integer,
8198 Set_Handled_Statement_Sequence (Decl,
8199 Make_Handled_Sequence_Of_Statements (Loc, New_List (
8200 Make_Simple_Return_Statement (Loc,
8202 Make_Attribute_Reference (Loc,
8203 Prefix => Make_Identifier (Loc, Name_X),
8204 Attribute_Name => Name_Alignment)))));
8206 Append_To (Res, Decl);
8210 Decl := Predef_Spec_Or_Body (Loc,
8213 Profile => New_List (
8214 Make_Parameter_Specification (Loc,
8215 Defining_Identifier => Make_Defining_Identifier (Loc, Name_X),
8216 Parameter_Type => New_Reference_To (Tag_Typ, Loc))),
8218 Ret_Type => Standard_Long_Long_Integer,
8221 Set_Handled_Statement_Sequence (Decl,
8222 Make_Handled_Sequence_Of_Statements (Loc, New_List (
8223 Make_Simple_Return_Statement (Loc,
8225 Make_Attribute_Reference (Loc,
8226 Prefix => Make_Identifier (Loc, Name_X),
8227 Attribute_Name => Name_Size)))));
8229 Append_To (Res, Decl);
8231 -- Bodies for Dispatching stream IO routines. We need these only for
8232 -- non-limited types (in the limited case there is no dispatching).
8233 -- We also skip them if dispatching or finalization are not available.
8235 if Stream_Operation_OK (Tag_Typ, TSS_Stream_Read)
8236 and then No (TSS (Tag_Typ, TSS_Stream_Read))
8238 Build_Record_Read_Procedure (Loc, Tag_Typ, Decl, Ent);
8239 Append_To (Res, Decl);
8242 if Stream_Operation_OK (Tag_Typ, TSS_Stream_Write)
8243 and then No (TSS (Tag_Typ, TSS_Stream_Write))
8245 Build_Record_Write_Procedure (Loc, Tag_Typ, Decl, Ent);
8246 Append_To (Res, Decl);
8249 -- Skip body of _Input for the abstract case, since the corresponding
8250 -- spec is abstract (see Predef_Spec_Or_Body).
8252 if not Is_Abstract_Type (Tag_Typ)
8253 and then Stream_Operation_OK (Tag_Typ, TSS_Stream_Input)
8254 and then No (TSS (Tag_Typ, TSS_Stream_Input))
8256 Build_Record_Or_Elementary_Input_Function
8257 (Loc, Tag_Typ, Decl, Ent);
8258 Append_To (Res, Decl);
8261 if Stream_Operation_OK (Tag_Typ, TSS_Stream_Output)
8262 and then No (TSS (Tag_Typ, TSS_Stream_Output))
8264 Build_Record_Or_Elementary_Output_Procedure
8265 (Loc, Tag_Typ, Decl, Ent);
8266 Append_To (Res, Decl);
8269 -- Ada 2005: Generate bodies for the following primitive operations for
8270 -- limited interfaces and synchronized types that implement a limited
8273 -- disp_asynchronous_select
8274 -- disp_conditional_select
8275 -- disp_get_prim_op_kind
8277 -- disp_timed_select
8279 -- The interface versions will have null bodies
8281 -- These operations cannot be implemented on VM targets, so we simply
8282 -- disable their generation in this case. We also disable generation
8283 -- of these bodies if No_Dispatching_Calls is active.
8285 if Ada_Version >= Ada_05
8286 and then VM_Target = No_VM
8287 and then not Restriction_Active (No_Dispatching_Calls)
8288 and then not Is_Interface (Tag_Typ)
8290 ((Is_Interface (Etype (Tag_Typ))
8291 and then Is_Limited_Record (Etype (Tag_Typ)))
8292 or else (Is_Concurrent_Record_Type (Tag_Typ)
8293 and then Has_Interfaces (Tag_Typ)))
8294 and then RTE_Available (RE_Select_Specific_Data)
8296 Append_To (Res, Make_Disp_Asynchronous_Select_Body (Tag_Typ));
8297 Append_To (Res, Make_Disp_Conditional_Select_Body (Tag_Typ));
8298 Append_To (Res, Make_Disp_Get_Prim_Op_Kind_Body (Tag_Typ));
8299 Append_To (Res, Make_Disp_Get_Task_Id_Body (Tag_Typ));
8300 Append_To (Res, Make_Disp_Requeue_Body (Tag_Typ));
8301 Append_To (Res, Make_Disp_Timed_Select_Body (Tag_Typ));
8304 if not Is_Limited_Type (Tag_Typ)
8305 and then not Is_Interface (Tag_Typ)
8307 -- Body for equality
8311 Predef_Spec_Or_Body (Loc,
8314 Profile => New_List (
8315 Make_Parameter_Specification (Loc,
8316 Defining_Identifier =>
8317 Make_Defining_Identifier (Loc, Name_X),
8318 Parameter_Type => New_Reference_To (Tag_Typ, Loc)),
8320 Make_Parameter_Specification (Loc,
8321 Defining_Identifier =>
8322 Make_Defining_Identifier (Loc, Name_Y),
8323 Parameter_Type => New_Reference_To (Tag_Typ, Loc))),
8325 Ret_Type => Standard_Boolean,
8329 Def : constant Node_Id := Parent (Tag_Typ);
8330 Stmts : constant List_Id := New_List;
8331 Variant_Case : Boolean := Has_Discriminants (Tag_Typ);
8332 Comps : Node_Id := Empty;
8333 Typ_Def : Node_Id := Type_Definition (Def);
8336 if Variant_Case then
8337 if Nkind (Typ_Def) = N_Derived_Type_Definition then
8338 Typ_Def := Record_Extension_Part (Typ_Def);
8341 if Present (Typ_Def) then
8342 Comps := Component_List (Typ_Def);
8345 Variant_Case := Present (Comps)
8346 and then Present (Variant_Part (Comps));
8349 if Variant_Case then
8351 Make_Eq_If (Tag_Typ, Discriminant_Specifications (Def)));
8352 Append_List_To (Stmts, Make_Eq_Case (Tag_Typ, Comps));
8354 Make_Simple_Return_Statement (Loc,
8355 Expression => New_Reference_To (Standard_True, Loc)));
8359 Make_Simple_Return_Statement (Loc,
8361 Expand_Record_Equality (Tag_Typ,
8363 Lhs => Make_Identifier (Loc, Name_X),
8364 Rhs => Make_Identifier (Loc, Name_Y),
8365 Bodies => Declarations (Decl))));
8368 Set_Handled_Statement_Sequence (Decl,
8369 Make_Handled_Sequence_Of_Statements (Loc, Stmts));
8371 Append_To (Res, Decl);
8374 -- Body for dispatching assignment
8377 Predef_Spec_Or_Body (Loc,
8379 Name => Name_uAssign,
8380 Profile => New_List (
8381 Make_Parameter_Specification (Loc,
8382 Defining_Identifier => Make_Defining_Identifier (Loc, Name_X),
8383 Out_Present => True,
8384 Parameter_Type => New_Reference_To (Tag_Typ, Loc)),
8386 Make_Parameter_Specification (Loc,
8387 Defining_Identifier => Make_Defining_Identifier (Loc, Name_Y),
8388 Parameter_Type => New_Reference_To (Tag_Typ, Loc))),
8391 Set_Handled_Statement_Sequence (Decl,
8392 Make_Handled_Sequence_Of_Statements (Loc, New_List (
8393 Make_Assignment_Statement (Loc,
8394 Name => Make_Identifier (Loc, Name_X),
8395 Expression => Make_Identifier (Loc, Name_Y)))));
8397 Append_To (Res, Decl);
8400 -- Generate dummy bodies for finalization actions of types that have
8401 -- no controlled components.
8403 -- Skip this processing if we are in the finalization routine in the
8404 -- runtime itself, otherwise we get hopelessly circularly confused!
8406 if In_Finalization_Root (Tag_Typ) then
8409 -- Skip this if finalization is not available
8411 elsif Restriction_Active (No_Finalization) then
8414 elsif (Etype (Tag_Typ) = Tag_Typ
8415 or else Is_Controlled (Tag_Typ)
8417 -- Ada 2005 (AI-251): We must also generate these subprograms
8418 -- if the immediate ancestor of Tag_Typ is an interface to
8419 -- ensure the correct initialization of its dispatch table.
8421 or else (not Is_Interface (Tag_Typ)
8423 Is_Interface (Etype (Tag_Typ))))
8424 and then not Has_Controlled_Component (Tag_Typ)
8426 if not Is_Limited_Type (Tag_Typ) then
8427 Decl := Predef_Deep_Spec (Loc, Tag_Typ, TSS_Deep_Adjust, True);
8429 if Is_Controlled (Tag_Typ) then
8430 Set_Handled_Statement_Sequence (Decl,
8431 Make_Handled_Sequence_Of_Statements (Loc,
8433 Ref => Make_Identifier (Loc, Name_V),
8435 Flist_Ref => Make_Identifier (Loc, Name_L),
8436 With_Attach => Make_Identifier (Loc, Name_B))));
8439 Set_Handled_Statement_Sequence (Decl,
8440 Make_Handled_Sequence_Of_Statements (Loc, New_List (
8441 Make_Null_Statement (Loc))));
8444 Append_To (Res, Decl);
8447 Decl := Predef_Deep_Spec (Loc, Tag_Typ, TSS_Deep_Finalize, True);
8449 if Is_Controlled (Tag_Typ) then
8450 Set_Handled_Statement_Sequence (Decl,
8451 Make_Handled_Sequence_Of_Statements (Loc,
8453 Ref => Make_Identifier (Loc, Name_V),
8455 With_Detach => Make_Identifier (Loc, Name_B))));
8458 Set_Handled_Statement_Sequence (Decl,
8459 Make_Handled_Sequence_Of_Statements (Loc, New_List (
8460 Make_Null_Statement (Loc))));
8463 Append_To (Res, Decl);
8467 end Predefined_Primitive_Bodies;
8469 ---------------------------------
8470 -- Predefined_Primitive_Freeze --
8471 ---------------------------------
8473 function Predefined_Primitive_Freeze
8474 (Tag_Typ : Entity_Id) return List_Id
8476 Loc : constant Source_Ptr := Sloc (Tag_Typ);
8477 Res : constant List_Id := New_List;
8482 Prim := First_Elmt (Primitive_Operations (Tag_Typ));
8483 while Present (Prim) loop
8484 if Is_Predefined_Dispatching_Operation (Node (Prim)) then
8485 Frnodes := Freeze_Entity (Node (Prim), Loc);
8487 if Present (Frnodes) then
8488 Append_List_To (Res, Frnodes);
8496 end Predefined_Primitive_Freeze;
8498 -------------------------
8499 -- Stream_Operation_OK --
8500 -------------------------
8502 function Stream_Operation_OK
8504 Operation : TSS_Name_Type) return Boolean
8506 Has_Predefined_Or_Specified_Stream_Attribute : Boolean := False;
8509 -- Special case of a limited type extension: a default implementation
8510 -- of the stream attributes Read or Write exists if that attribute
8511 -- has been specified or is available for an ancestor type; a default
8512 -- implementation of the attribute Output (resp. Input) exists if the
8513 -- attribute has been specified or Write (resp. Read) is available for
8514 -- an ancestor type. The last condition only applies under Ada 2005.
8516 if Is_Limited_Type (Typ)
8517 and then Is_Tagged_Type (Typ)
8519 if Operation = TSS_Stream_Read then
8520 Has_Predefined_Or_Specified_Stream_Attribute :=
8521 Has_Specified_Stream_Read (Typ);
8523 elsif Operation = TSS_Stream_Write then
8524 Has_Predefined_Or_Specified_Stream_Attribute :=
8525 Has_Specified_Stream_Write (Typ);
8527 elsif Operation = TSS_Stream_Input then
8528 Has_Predefined_Or_Specified_Stream_Attribute :=
8529 Has_Specified_Stream_Input (Typ)
8531 (Ada_Version >= Ada_05
8532 and then Stream_Operation_OK (Typ, TSS_Stream_Read));
8534 elsif Operation = TSS_Stream_Output then
8535 Has_Predefined_Or_Specified_Stream_Attribute :=
8536 Has_Specified_Stream_Output (Typ)
8538 (Ada_Version >= Ada_05
8539 and then Stream_Operation_OK (Typ, TSS_Stream_Write));
8542 -- Case of inherited TSS_Stream_Read or TSS_Stream_Write
8544 if not Has_Predefined_Or_Specified_Stream_Attribute
8545 and then Is_Derived_Type (Typ)
8546 and then (Operation = TSS_Stream_Read
8547 or else Operation = TSS_Stream_Write)
8549 Has_Predefined_Or_Specified_Stream_Attribute :=
8551 (Find_Inherited_TSS (Base_Type (Etype (Typ)), Operation));
8555 -- If the type is not limited, or else is limited but the attribute is
8556 -- explicitly specified or is predefined for the type, then return True,
8557 -- unless other conditions prevail, such as restrictions prohibiting
8558 -- streams or dispatching operations.
8560 -- We exclude the Input operation from being a predefined subprogram in
8561 -- the case where the associated type is an abstract extension, because
8562 -- the attribute is not callable in that case, per 13.13.2(49/2). Also,
8563 -- we don't want an abstract version created because types derived from
8564 -- the abstract type may not even have Input available (for example if
8565 -- derived from a private view of the abstract type that doesn't have
8566 -- a visible Input), but a VM such as .NET or the Java VM can treat the
8567 -- operation as inherited anyway, and we don't want an abstract function
8568 -- to be (implicitly) inherited in that case because it can lead to a VM
8571 return (not Is_Limited_Type (Typ)
8572 or else Has_Predefined_Or_Specified_Stream_Attribute)
8573 and then (Operation /= TSS_Stream_Input
8574 or else not Is_Abstract_Type (Typ)
8575 or else not Is_Derived_Type (Typ))
8576 and then not Has_Unknown_Discriminants (Typ)
8577 and then not (Is_Interface (Typ)
8578 and then (Is_Task_Interface (Typ)
8579 or else Is_Protected_Interface (Typ)
8580 or else Is_Synchronized_Interface (Typ)))
8581 and then not Restriction_Active (No_Streams)
8582 and then not Restriction_Active (No_Dispatch)
8583 and then not No_Run_Time_Mode
8584 and then RTE_Available (RE_Tag)
8585 and then RTE_Available (RE_Root_Stream_Type);
8586 end Stream_Operation_OK;