1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2011, 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 Debug; use Debug;
29 with Einfo; use Einfo;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Expander; use Expander;
33 with Exp_Util; use Exp_Util;
34 with Exp_Ch3; use Exp_Ch3;
35 with Exp_Ch7; use Exp_Ch7;
36 with Exp_Ch9; use Exp_Ch9;
37 with Exp_Disp; use Exp_Disp;
38 with Exp_Tss; use Exp_Tss;
39 with Fname; use Fname;
40 with Freeze; use Freeze;
41 with Itypes; use Itypes;
43 with Namet; use Namet;
44 with Nmake; use Nmake;
45 with Nlists; use Nlists;
47 with Restrict; use Restrict;
48 with Rident; use Rident;
49 with Rtsfind; use Rtsfind;
50 with Ttypes; use Ttypes;
52 with Sem_Aggr; use Sem_Aggr;
53 with Sem_Aux; use Sem_Aux;
54 with Sem_Ch3; use Sem_Ch3;
55 with Sem_Eval; use Sem_Eval;
56 with Sem_Res; use Sem_Res;
57 with Sem_Util; use Sem_Util;
58 with Sinfo; use Sinfo;
59 with Snames; use Snames;
60 with Stand; use Stand;
61 with Targparm; use Targparm;
62 with Tbuild; use Tbuild;
63 with Uintp; use Uintp;
65 package body Exp_Aggr is
67 type Case_Bounds is record
70 Choice_Node : Node_Id;
73 type Case_Table_Type is array (Nat range <>) of Case_Bounds;
74 -- Table type used by Check_Case_Choices procedure
77 (Obj_Type : Entity_Id;
78 Typ : Entity_Id) return Boolean;
79 -- A static array aggregate in an object declaration can in most cases be
80 -- expanded in place. The one exception is when the aggregate is given
81 -- with component associations that specify different bounds from those of
82 -- the type definition in the object declaration. In this pathological
83 -- case the aggregate must slide, and we must introduce an intermediate
84 -- temporary to hold it.
86 -- The same holds in an assignment to one-dimensional array of arrays,
87 -- when a component may be given with bounds that differ from those of the
90 procedure Sort_Case_Table (Case_Table : in out Case_Table_Type);
91 -- Sort the Case Table using the Lower Bound of each Choice as the key.
92 -- A simple insertion sort is used since the number of choices in a case
93 -- statement of variant part will usually be small and probably in near
96 function Has_Default_Init_Comps (N : Node_Id) return Boolean;
97 -- N is an aggregate (record or array). Checks the presence of default
98 -- initialization (<>) in any component (Ada 2005: AI-287).
100 function Is_Static_Dispatch_Table_Aggregate (N : Node_Id) return Boolean;
101 -- Returns true if N is an aggregate used to initialize the components
102 -- of an statically allocated dispatch table.
104 ------------------------------------------------------
105 -- Local subprograms for Record Aggregate Expansion --
106 ------------------------------------------------------
108 procedure Expand_Record_Aggregate
110 Orig_Tag : Node_Id := Empty;
111 Parent_Expr : Node_Id := Empty);
112 -- This is the top level procedure for record aggregate expansion.
113 -- Expansion for record aggregates needs expand aggregates for tagged
114 -- record types. Specifically Expand_Record_Aggregate adds the Tag
115 -- field in front of the Component_Association list that was created
116 -- during resolution by Resolve_Record_Aggregate.
118 -- N is the record aggregate node.
119 -- Orig_Tag is the value of the Tag that has to be provided for this
120 -- specific aggregate. It carries the tag corresponding to the type
121 -- of the outermost aggregate during the recursive expansion
122 -- Parent_Expr is the ancestor part of the original extension
125 procedure Convert_To_Assignments (N : Node_Id; Typ : Entity_Id);
126 -- N is an N_Aggregate or an N_Extension_Aggregate. Typ is the type of the
127 -- aggregate (which can only be a record type, this procedure is only used
128 -- for record types). Transform the given aggregate into a sequence of
129 -- assignments performed component by component.
131 function Build_Record_Aggr_Code
135 Flist : Node_Id := Empty;
136 Obj : Entity_Id := Empty;
137 Is_Limited_Ancestor_Expansion : Boolean := False) return List_Id;
138 -- N is an N_Aggregate or an N_Extension_Aggregate. Typ is the type of the
139 -- aggregate. Target is an expression containing the location on which the
140 -- component by component assignments will take place. Returns the list of
141 -- assignments plus all other adjustments needed for tagged and controlled
142 -- types. Flist is an expression representing the finalization list on
143 -- which to attach the controlled components if any. Obj is present in the
144 -- object declaration and dynamic allocation cases, it contains an entity
145 -- that allows to know if the value being created needs to be attached to
146 -- the final list in case of pragma Finalize_Storage_Only.
149 -- The meaning of the Obj formal is extremely unclear. *What* entity
150 -- should be passed? For the object declaration case we may guess that
151 -- this is the object being declared, but what about the allocator case?
153 -- Is_Limited_Ancestor_Expansion indicates that the function has been
154 -- called recursively to expand the limited ancestor to avoid copying it.
156 function Has_Mutable_Components (Typ : Entity_Id) return Boolean;
157 -- Return true if one of the component is of a discriminated type with
158 -- defaults. An aggregate for a type with mutable components must be
159 -- expanded into individual assignments.
161 procedure Initialize_Discriminants (N : Node_Id; Typ : Entity_Id);
162 -- If the type of the aggregate is a type extension with renamed discrimi-
163 -- nants, we must initialize the hidden discriminants of the parent.
164 -- Otherwise, the target object must not be initialized. The discriminants
165 -- are initialized by calling the initialization procedure for the type.
166 -- This is incorrect if the initialization of other components has any
167 -- side effects. We restrict this call to the case where the parent type
168 -- has a variant part, because this is the only case where the hidden
169 -- discriminants are accessed, namely when calling discriminant checking
170 -- functions of the parent type, and when applying a stream attribute to
171 -- an object of the derived type.
173 -----------------------------------------------------
174 -- Local Subprograms for Array Aggregate Expansion --
175 -----------------------------------------------------
177 function Aggr_Size_OK (N : Node_Id; Typ : Entity_Id) return Boolean;
178 -- Very large static aggregates present problems to the back-end, and are
179 -- transformed into assignments and loops. This function verifies that the
180 -- total number of components of an aggregate is acceptable for rewriting
181 -- into a purely positional static form. Aggr_Size_OK must be called before
184 -- This function also detects and warns about one-component aggregates that
185 -- appear in a non-static context. Even if the component value is static,
186 -- such an aggregate must be expanded into an assignment.
188 procedure Convert_Array_Aggr_In_Allocator
192 -- If the aggregate appears within an allocator and can be expanded in
193 -- place, this routine generates the individual assignments to components
194 -- of the designated object. This is an optimization over the general
195 -- case, where a temporary is first created on the stack and then used to
196 -- construct the allocated object on the heap.
198 procedure Convert_To_Positional
200 Max_Others_Replicate : Nat := 5;
201 Handle_Bit_Packed : Boolean := False);
202 -- If possible, convert named notation to positional notation. This
203 -- conversion is possible only in some static cases. If the conversion is
204 -- possible, then N is rewritten with the analyzed converted aggregate.
205 -- The parameter Max_Others_Replicate controls the maximum number of
206 -- values corresponding to an others choice that will be converted to
207 -- positional notation (the default of 5 is the normal limit, and reflects
208 -- the fact that normally the loop is better than a lot of separate
209 -- assignments). Note that this limit gets overridden in any case if
210 -- either of the restrictions No_Elaboration_Code or No_Implicit_Loops is
211 -- set. The parameter Handle_Bit_Packed is usually set False (since we do
212 -- not expect the back end to handle bit packed arrays, so the normal case
213 -- of conversion is pointless), but in the special case of a call from
214 -- Packed_Array_Aggregate_Handled, we set this parameter to True, since
215 -- these are cases we handle in there.
217 procedure Expand_Array_Aggregate (N : Node_Id);
218 -- This is the top-level routine to perform array aggregate expansion.
219 -- N is the N_Aggregate node to be expanded.
221 function Backend_Processing_Possible (N : Node_Id) return Boolean;
222 -- This function checks if array aggregate N can be processed directly
223 -- by the backend. If this is the case True is returned.
225 function Build_Array_Aggr_Code
230 Scalar_Comp : Boolean;
231 Indexes : List_Id := No_List;
232 Flist : Node_Id := Empty) return List_Id;
233 -- This recursive routine returns a list of statements containing the
234 -- loops and assignments that are needed for the expansion of the array
237 -- N is the (sub-)aggregate node to be expanded into code. This node
238 -- has been fully analyzed, and its Etype is properly set.
240 -- Index is the index node corresponding to the array sub-aggregate N.
242 -- Into is the target expression into which we are copying the aggregate.
243 -- Note that this node may not have been analyzed yet, and so the Etype
244 -- field may not be set.
246 -- Scalar_Comp is True if the component type of the aggregate is scalar.
248 -- Indexes is the current list of expressions used to index the
249 -- object we are writing into.
251 -- Flist is an expression representing the finalization list on which
252 -- to attach the controlled components if any.
254 function Number_Of_Choices (N : Node_Id) return Nat;
255 -- Returns the number of discrete choices (not including the others choice
256 -- if present) contained in (sub-)aggregate N.
258 function Late_Expansion
262 Flist : Node_Id := Empty;
263 Obj : Entity_Id := Empty) return List_Id;
264 -- N is a nested (record or array) aggregate that has been marked with
265 -- 'Delay_Expansion'. Typ is the expected type of the aggregate and Target
266 -- is a (duplicable) expression that will hold the result of the aggregate
267 -- expansion. Flist is the finalization list to be used to attach
268 -- controlled components. 'Obj' when non empty, carries the original
269 -- object being initialized in order to know if it needs to be attached to
270 -- the previous parameter which may not be the case in the case where
271 -- Finalize_Storage_Only is set. Basically this procedure is used to
272 -- implement top-down expansions of nested aggregates. This is necessary
273 -- for avoiding temporaries at each level as well as for propagating the
274 -- right internal finalization list.
276 function Make_OK_Assignment_Statement
279 Expression : Node_Id) return Node_Id;
280 -- This is like Make_Assignment_Statement, except that Assignment_OK
281 -- is set in the left operand. All assignments built by this unit
282 -- use this routine. This is needed to deal with assignments to
283 -- initialized constants that are done in place.
285 function Packed_Array_Aggregate_Handled (N : Node_Id) return Boolean;
286 -- Given an array aggregate, this function handles the case of a packed
287 -- array aggregate with all constant values, where the aggregate can be
288 -- evaluated at compile time. If this is possible, then N is rewritten
289 -- to be its proper compile time value with all the components properly
290 -- assembled. The expression is analyzed and resolved and True is
291 -- returned. If this transformation is not possible, N is unchanged
292 -- and False is returned
294 function Safe_Slice_Assignment (N : Node_Id) return Boolean;
295 -- If a slice assignment has an aggregate with a single others_choice,
296 -- the assignment can be done in place even if bounds are not static,
297 -- by converting it into a loop over the discrete range of the slice.
303 function Aggr_Size_OK (N : Node_Id; Typ : Entity_Id) return Boolean is
311 -- The following constant determines the maximum size of an array
312 -- aggregate produced by converting named to positional notation (e.g.
313 -- from others clauses). This avoids running away with attempts to
314 -- convert huge aggregates, which hit memory limits in the backend.
316 -- The normal limit is 5000, but we increase this limit to 2**24 (about
317 -- 16 million) if Restrictions (No_Elaboration_Code) or Restrictions
318 -- (No_Implicit_Loops) is specified, since in either case, we are at
319 -- risk of declaring the program illegal because of this limit.
321 Max_Aggr_Size : constant Nat :=
322 5000 + (2 ** 24 - 5000) *
324 (Restriction_Active (No_Elaboration_Code)
326 Restriction_Active (No_Implicit_Loops));
328 function Component_Count (T : Entity_Id) return Int;
329 -- The limit is applied to the total number of components that the
330 -- aggregate will have, which is the number of static expressions
331 -- that will appear in the flattened array. This requires a recursive
332 -- computation of the number of scalar components of the structure.
334 ---------------------
335 -- Component_Count --
336 ---------------------
338 function Component_Count (T : Entity_Id) return Int is
343 if Is_Scalar_Type (T) then
346 elsif Is_Record_Type (T) then
347 Comp := First_Component (T);
348 while Present (Comp) loop
349 Res := Res + Component_Count (Etype (Comp));
350 Next_Component (Comp);
355 elsif Is_Array_Type (T) then
357 Lo : constant Node_Id :=
358 Type_Low_Bound (Etype (First_Index (T)));
359 Hi : constant Node_Id :=
360 Type_High_Bound (Etype (First_Index (T)));
362 Siz : constant Int := Component_Count (Component_Type (T));
365 if not Compile_Time_Known_Value (Lo)
366 or else not Compile_Time_Known_Value (Hi)
371 Siz * UI_To_Int (Expr_Value (Hi) - Expr_Value (Lo) + 1);
376 -- Can only be a null for an access type
382 -- Start of processing for Aggr_Size_OK
385 Siz := Component_Count (Component_Type (Typ));
387 Indx := First_Index (Typ);
388 while Present (Indx) loop
389 Lo := Type_Low_Bound (Etype (Indx));
390 Hi := Type_High_Bound (Etype (Indx));
392 -- Bounds need to be known at compile time
394 if not Compile_Time_Known_Value (Lo)
395 or else not Compile_Time_Known_Value (Hi)
400 Lov := Expr_Value (Lo);
401 Hiv := Expr_Value (Hi);
403 -- A flat array is always safe
409 -- One-component aggregates are suspicious, and if the context type
410 -- is an object declaration with non-static bounds it will trip gcc;
411 -- such an aggregate must be expanded into a single assignment.
414 and then Nkind (Parent (N)) = N_Object_Declaration
417 Index_Type : constant Entity_Id :=
420 (Etype (Defining_Identifier (Parent (N)))));
424 if not Compile_Time_Known_Value (Type_Low_Bound (Index_Type))
425 or else not Compile_Time_Known_Value
426 (Type_High_Bound (Index_Type))
428 if Present (Component_Associations (N)) then
430 First (Choices (First (Component_Associations (N))));
431 if Is_Entity_Name (Indx)
432 and then not Is_Type (Entity (Indx))
435 ("single component aggregate in non-static context?",
437 Error_Msg_N ("\maybe subtype name was meant?", Indx);
447 Rng : constant Uint := Hiv - Lov + 1;
450 -- Check if size is too large
452 if not UI_Is_In_Int_Range (Rng) then
456 Siz := Siz * UI_To_Int (Rng);
460 or else Siz > Max_Aggr_Size
465 -- Bounds must be in integer range, for later array construction
467 if not UI_Is_In_Int_Range (Lov)
469 not UI_Is_In_Int_Range (Hiv)
480 ---------------------------------
481 -- Backend_Processing_Possible --
482 ---------------------------------
484 -- Backend processing by Gigi/gcc is possible only if all the following
485 -- conditions are met:
487 -- 1. N is fully positional
489 -- 2. N is not a bit-packed array aggregate;
491 -- 3. The size of N's array type must be known at compile time. Note
492 -- that this implies that the component size is also known
494 -- 4. The array type of N does not follow the Fortran layout convention
495 -- or if it does it must be 1 dimensional.
497 -- 5. The array component type may not be tagged (which could necessitate
498 -- reassignment of proper tags).
500 -- 6. The array component type must not have unaligned bit components
502 -- 7. None of the components of the aggregate may be bit unaligned
505 -- 8. There cannot be delayed components, since we do not know enough
506 -- at this stage to know if back end processing is possible.
508 -- 9. There cannot be any discriminated record components, since the
509 -- back end cannot handle this complex case.
511 -- 10. No controlled actions need to be generated for components
513 -- 11. For a VM back end, the array should have no aliased components
515 function Backend_Processing_Possible (N : Node_Id) return Boolean is
516 Typ : constant Entity_Id := Etype (N);
517 -- Typ is the correct constrained array subtype of the aggregate
519 function Component_Check (N : Node_Id; Index : Node_Id) return Boolean;
520 -- This routine checks components of aggregate N, enforcing checks
521 -- 1, 7, 8, and 9. In the multi-dimensional case, these checks are
522 -- performed on subaggregates. The Index value is the current index
523 -- being checked in the multi-dimensional case.
525 ---------------------
526 -- Component_Check --
527 ---------------------
529 function Component_Check (N : Node_Id; Index : Node_Id) return Boolean is
533 -- Checks 1: (no component associations)
535 if Present (Component_Associations (N)) then
539 -- Checks on components
541 -- Recurse to check subaggregates, which may appear in qualified
542 -- expressions. If delayed, the front-end will have to expand.
543 -- If the component is a discriminated record, treat as non-static,
544 -- as the back-end cannot handle this properly.
546 Expr := First (Expressions (N));
547 while Present (Expr) loop
549 -- Checks 8: (no delayed components)
551 if Is_Delayed_Aggregate (Expr) then
555 -- Checks 9: (no discriminated records)
557 if Present (Etype (Expr))
558 and then Is_Record_Type (Etype (Expr))
559 and then Has_Discriminants (Etype (Expr))
564 -- Checks 7. Component must not be bit aligned component
566 if Possible_Bit_Aligned_Component (Expr) then
570 -- Recursion to following indexes for multiple dimension case
572 if Present (Next_Index (Index))
573 and then not Component_Check (Expr, Next_Index (Index))
578 -- All checks for that component finished, on to next
586 -- Start of processing for Backend_Processing_Possible
589 -- Checks 2 (array not bit packed) and 10 (no controlled actions)
591 if Is_Bit_Packed_Array (Typ) or else Needs_Finalization (Typ) then
595 -- If component is limited, aggregate must be expanded because each
596 -- component assignment must be built in place.
598 if Is_Immutably_Limited_Type (Component_Type (Typ)) then
602 -- Checks 4 (array must not be multi-dimensional Fortran case)
604 if Convention (Typ) = Convention_Fortran
605 and then Number_Dimensions (Typ) > 1
610 -- Checks 3 (size of array must be known at compile time)
612 if not Size_Known_At_Compile_Time (Typ) then
616 -- Checks on components
618 if not Component_Check (N, First_Index (Typ)) then
622 -- Checks 5 (if the component type is tagged, then we may need to do
623 -- tag adjustments. Perhaps this should be refined to check for any
624 -- component associations that actually need tag adjustment, similar
625 -- to the test in Component_Not_OK_For_Backend for record aggregates
626 -- with tagged components, but not clear whether it's worthwhile ???;
627 -- in the case of the JVM, object tags are handled implicitly)
629 if Is_Tagged_Type (Component_Type (Typ))
630 and then Tagged_Type_Expansion
635 -- Checks 6 (component type must not have bit aligned components)
637 if Type_May_Have_Bit_Aligned_Components (Component_Type (Typ)) then
641 -- Checks 11: Array aggregates with aliased components are currently
642 -- not well supported by the VM backend; disable temporarily this
643 -- backend processing until it is definitely supported.
645 if VM_Target /= No_VM
646 and then Has_Aliased_Components (Base_Type (Typ))
651 -- Backend processing is possible
653 Set_Size_Known_At_Compile_Time (Etype (N), True);
655 end Backend_Processing_Possible;
657 ---------------------------
658 -- Build_Array_Aggr_Code --
659 ---------------------------
661 -- The code that we generate from a one dimensional aggregate is
663 -- 1. If the sub-aggregate contains discrete choices we
665 -- (a) Sort the discrete choices
667 -- (b) Otherwise for each discrete choice that specifies a range we
668 -- emit a loop. If a range specifies a maximum of three values, or
669 -- we are dealing with an expression we emit a sequence of
670 -- assignments instead of a loop.
672 -- (c) Generate the remaining loops to cover the others choice if any
674 -- 2. If the aggregate contains positional elements we
676 -- (a) translate the positional elements in a series of assignments
678 -- (b) Generate a final loop to cover the others choice if any.
679 -- Note that this final loop has to be a while loop since the case
681 -- L : Integer := Integer'Last;
682 -- H : Integer := Integer'Last;
683 -- A : array (L .. H) := (1, others =>0);
685 -- cannot be handled by a for loop. Thus for the following
687 -- array (L .. H) := (.. positional elements.., others =>E);
689 -- we always generate something like:
691 -- J : Index_Type := Index_Of_Last_Positional_Element;
693 -- J := Index_Base'Succ (J)
697 function Build_Array_Aggr_Code
702 Scalar_Comp : Boolean;
703 Indexes : List_Id := No_List;
704 Flist : Node_Id := Empty) return List_Id
706 Loc : constant Source_Ptr := Sloc (N);
707 Index_Base : constant Entity_Id := Base_Type (Etype (Index));
708 Index_Base_L : constant Node_Id := Type_Low_Bound (Index_Base);
709 Index_Base_H : constant Node_Id := Type_High_Bound (Index_Base);
711 function Add (Val : Int; To : Node_Id) return Node_Id;
712 -- Returns an expression where Val is added to expression To, unless
713 -- To+Val is provably out of To's base type range. To must be an
714 -- already analyzed expression.
716 function Empty_Range (L, H : Node_Id) return Boolean;
717 -- Returns True if the range defined by L .. H is certainly empty
719 function Equal (L, H : Node_Id) return Boolean;
720 -- Returns True if L = H for sure
722 function Index_Base_Name return Node_Id;
723 -- Returns a new reference to the index type name
725 function Gen_Assign (Ind : Node_Id; Expr : Node_Id) return List_Id;
726 -- Ind must be a side-effect free expression. If the input aggregate
727 -- N to Build_Loop contains no sub-aggregates, then this function
728 -- returns the assignment statement:
730 -- Into (Indexes, Ind) := Expr;
732 -- Otherwise we call Build_Code recursively
734 -- Ada 2005 (AI-287): In case of default initialized component, Expr
735 -- is empty and we generate a call to the corresponding IP subprogram.
737 function Gen_Loop (L, H : Node_Id; Expr : Node_Id) return List_Id;
738 -- Nodes L and H must be side-effect free expressions.
739 -- If the input aggregate N to Build_Loop contains no sub-aggregates,
740 -- This routine returns the for loop statement
742 -- for J in Index_Base'(L) .. Index_Base'(H) loop
743 -- Into (Indexes, J) := Expr;
746 -- Otherwise we call Build_Code recursively.
747 -- As an optimization if the loop covers 3 or less scalar elements we
748 -- generate a sequence of assignments.
750 function Gen_While (L, H : Node_Id; Expr : Node_Id) return List_Id;
751 -- Nodes L and H must be side-effect free expressions.
752 -- If the input aggregate N to Build_Loop contains no sub-aggregates,
753 -- This routine returns the while loop statement
755 -- J : Index_Base := L;
757 -- J := Index_Base'Succ (J);
758 -- Into (Indexes, J) := Expr;
761 -- Otherwise we call Build_Code recursively
763 function Local_Compile_Time_Known_Value (E : Node_Id) return Boolean;
764 function Local_Expr_Value (E : Node_Id) return Uint;
765 -- These two Local routines are used to replace the corresponding ones
766 -- in sem_eval because while processing the bounds of an aggregate with
767 -- discrete choices whose index type is an enumeration, we build static
768 -- expressions not recognized by Compile_Time_Known_Value as such since
769 -- they have not yet been analyzed and resolved. All the expressions in
770 -- question are things like Index_Base_Name'Val (Const) which we can
771 -- easily recognize as being constant.
777 function Add (Val : Int; To : Node_Id) return Node_Id is
782 U_Val : constant Uint := UI_From_Int (Val);
785 -- Note: do not try to optimize the case of Val = 0, because
786 -- we need to build a new node with the proper Sloc value anyway.
788 -- First test if we can do constant folding
790 if Local_Compile_Time_Known_Value (To) then
791 U_To := Local_Expr_Value (To) + Val;
793 -- Determine if our constant is outside the range of the index.
794 -- If so return an Empty node. This empty node will be caught
795 -- by Empty_Range below.
797 if Compile_Time_Known_Value (Index_Base_L)
798 and then U_To < Expr_Value (Index_Base_L)
802 elsif Compile_Time_Known_Value (Index_Base_H)
803 and then U_To > Expr_Value (Index_Base_H)
808 Expr_Pos := Make_Integer_Literal (Loc, U_To);
809 Set_Is_Static_Expression (Expr_Pos);
811 if not Is_Enumeration_Type (Index_Base) then
814 -- If we are dealing with enumeration return
815 -- Index_Base'Val (Expr_Pos)
819 Make_Attribute_Reference
821 Prefix => Index_Base_Name,
822 Attribute_Name => Name_Val,
823 Expressions => New_List (Expr_Pos));
829 -- If we are here no constant folding possible
831 if not Is_Enumeration_Type (Index_Base) then
834 Left_Opnd => Duplicate_Subexpr (To),
835 Right_Opnd => Make_Integer_Literal (Loc, U_Val));
837 -- If we are dealing with enumeration return
838 -- Index_Base'Val (Index_Base'Pos (To) + Val)
842 Make_Attribute_Reference
844 Prefix => Index_Base_Name,
845 Attribute_Name => Name_Pos,
846 Expressions => New_List (Duplicate_Subexpr (To)));
851 Right_Opnd => Make_Integer_Literal (Loc, U_Val));
854 Make_Attribute_Reference
856 Prefix => Index_Base_Name,
857 Attribute_Name => Name_Val,
858 Expressions => New_List (Expr_Pos));
868 function Empty_Range (L, H : Node_Id) return Boolean is
869 Is_Empty : Boolean := False;
874 -- First check if L or H were already detected as overflowing the
875 -- index base range type by function Add above. If this is so Add
876 -- returns the empty node.
878 if No (L) or else No (H) then
885 -- L > H range is empty
891 -- B_L > H range must be empty
897 -- L > B_H range must be empty
901 High := Index_Base_H;
904 if Local_Compile_Time_Known_Value (Low)
905 and then Local_Compile_Time_Known_Value (High)
908 UI_Gt (Local_Expr_Value (Low), Local_Expr_Value (High));
921 function Equal (L, H : Node_Id) return Boolean is
926 elsif Local_Compile_Time_Known_Value (L)
927 and then Local_Compile_Time_Known_Value (H)
929 return UI_Eq (Local_Expr_Value (L), Local_Expr_Value (H));
939 function Gen_Assign (Ind : Node_Id; Expr : Node_Id) return List_Id is
940 L : constant List_Id := New_List;
944 New_Indexes : List_Id;
945 Indexed_Comp : Node_Id;
947 Comp_Type : Entity_Id := Empty;
949 function Add_Loop_Actions (Lis : List_Id) return List_Id;
950 -- Collect insert_actions generated in the construction of a
951 -- loop, and prepend them to the sequence of assignments to
952 -- complete the eventual body of the loop.
954 ----------------------
955 -- Add_Loop_Actions --
956 ----------------------
958 function Add_Loop_Actions (Lis : List_Id) return List_Id is
962 -- Ada 2005 (AI-287): Do nothing else in case of default
963 -- initialized component.
968 elsif Nkind (Parent (Expr)) = N_Component_Association
969 and then Present (Loop_Actions (Parent (Expr)))
971 Append_List (Lis, Loop_Actions (Parent (Expr)));
972 Res := Loop_Actions (Parent (Expr));
973 Set_Loop_Actions (Parent (Expr), No_List);
979 end Add_Loop_Actions;
981 -- Start of processing for Gen_Assign
985 New_Indexes := New_List;
987 New_Indexes := New_Copy_List_Tree (Indexes);
990 Append_To (New_Indexes, Ind);
992 if Present (Flist) then
993 F := New_Copy_Tree (Flist);
995 elsif Present (Etype (N)) and then Needs_Finalization (Etype (N)) then
996 if Is_Entity_Name (Into)
997 and then Present (Scope (Entity (Into)))
999 F := Find_Final_List (Scope (Entity (Into)));
1001 F := Find_Final_List (Current_Scope);
1007 if Present (Next_Index (Index)) then
1010 Build_Array_Aggr_Code
1013 Index => Next_Index (Index),
1015 Scalar_Comp => Scalar_Comp,
1016 Indexes => New_Indexes,
1020 -- If we get here then we are at a bottom-level (sub-)aggregate
1024 (Make_Indexed_Component (Loc,
1025 Prefix => New_Copy_Tree (Into),
1026 Expressions => New_Indexes));
1028 Set_Assignment_OK (Indexed_Comp);
1030 -- Ada 2005 (AI-287): In case of default initialized component, Expr
1031 -- is not present (and therefore we also initialize Expr_Q to empty).
1035 elsif Nkind (Expr) = N_Qualified_Expression then
1036 Expr_Q := Expression (Expr);
1041 if Present (Etype (N))
1042 and then Etype (N) /= Any_Composite
1044 Comp_Type := Component_Type (Etype (N));
1045 pragma Assert (Comp_Type = Ctype); -- AI-287
1047 elsif Present (Next (First (New_Indexes))) then
1049 -- Ada 2005 (AI-287): Do nothing in case of default initialized
1050 -- component because we have received the component type in
1051 -- the formal parameter Ctype.
1053 -- ??? Some assert pragmas have been added to check if this new
1054 -- formal can be used to replace this code in all cases.
1056 if Present (Expr) then
1058 -- This is a multidimensional array. Recover the component
1059 -- type from the outermost aggregate, because subaggregates
1060 -- do not have an assigned type.
1067 while Present (P) loop
1068 if Nkind (P) = N_Aggregate
1069 and then Present (Etype (P))
1071 Comp_Type := Component_Type (Etype (P));
1079 pragma Assert (Comp_Type = Ctype); -- AI-287
1084 -- Ada 2005 (AI-287): We only analyze the expression in case of non-
1085 -- default initialized components (otherwise Expr_Q is not present).
1088 and then Nkind_In (Expr_Q, N_Aggregate, N_Extension_Aggregate)
1090 -- At this stage the Expression may not have been analyzed yet
1091 -- because the array aggregate code has not been updated to use
1092 -- the Expansion_Delayed flag and avoid analysis altogether to
1093 -- solve the same problem (see Resolve_Aggr_Expr). So let us do
1094 -- the analysis of non-array aggregates now in order to get the
1095 -- value of Expansion_Delayed flag for the inner aggregate ???
1097 if Present (Comp_Type) and then not Is_Array_Type (Comp_Type) then
1098 Analyze_And_Resolve (Expr_Q, Comp_Type);
1101 if Is_Delayed_Aggregate (Expr_Q) then
1103 -- This is either a subaggregate of a multidimensional array,
1104 -- or a component of an array type whose component type is
1105 -- also an array. In the latter case, the expression may have
1106 -- component associations that provide different bounds from
1107 -- those of the component type, and sliding must occur. Instead
1108 -- of decomposing the current aggregate assignment, force the
1109 -- re-analysis of the assignment, so that a temporary will be
1110 -- generated in the usual fashion, and sliding will take place.
1112 if Nkind (Parent (N)) = N_Assignment_Statement
1113 and then Is_Array_Type (Comp_Type)
1114 and then Present (Component_Associations (Expr_Q))
1115 and then Must_Slide (Comp_Type, Etype (Expr_Q))
1117 Set_Expansion_Delayed (Expr_Q, False);
1118 Set_Analyzed (Expr_Q, False);
1124 Expr_Q, Etype (Expr_Q), Indexed_Comp, F));
1129 -- Ada 2005 (AI-287): In case of default initialized component, call
1130 -- the initialization subprogram associated with the component type.
1131 -- If the component type is an access type, add an explicit null
1132 -- assignment, because for the back-end there is an initialization
1133 -- present for the whole aggregate, and no default initialization
1136 -- In addition, if the component type is controlled, we must call
1137 -- its Initialize procedure explicitly, because there is no explicit
1138 -- object creation that will invoke it otherwise.
1141 if Present (Base_Init_Proc (Base_Type (Ctype)))
1142 or else Has_Task (Base_Type (Ctype))
1145 Build_Initialization_Call (Loc,
1146 Id_Ref => Indexed_Comp,
1148 With_Default_Init => True));
1150 elsif Is_Access_Type (Ctype) then
1152 Make_Assignment_Statement (Loc,
1153 Name => Indexed_Comp,
1154 Expression => Make_Null (Loc)));
1157 if Needs_Finalization (Ctype) then
1160 Ref => New_Copy_Tree (Indexed_Comp),
1162 Flist_Ref => Find_Final_List (Current_Scope),
1163 With_Attach => Make_Integer_Literal (Loc, 1)));
1167 -- Now generate the assignment with no associated controlled
1168 -- actions since the target of the assignment may not have been
1169 -- initialized, it is not possible to Finalize it as expected by
1170 -- normal controlled assignment. The rest of the controlled
1171 -- actions are done manually with the proper finalization list
1172 -- coming from the context.
1175 Make_OK_Assignment_Statement (Loc,
1176 Name => Indexed_Comp,
1177 Expression => New_Copy_Tree (Expr));
1179 if Present (Comp_Type) and then Needs_Finalization (Comp_Type) then
1180 Set_No_Ctrl_Actions (A);
1182 -- If this is an aggregate for an array of arrays, each
1183 -- sub-aggregate will be expanded as well, and even with
1184 -- No_Ctrl_Actions the assignments of inner components will
1185 -- require attachment in their assignments to temporaries.
1186 -- These temporaries must be finalized for each subaggregate,
1187 -- to prevent multiple attachments of the same temporary
1188 -- location to same finalization chain (and consequently
1189 -- circular lists). To ensure that finalization takes place
1190 -- for each subaggregate we wrap the assignment in a block.
1192 if Is_Array_Type (Comp_Type)
1193 and then Nkind (Expr) = N_Aggregate
1196 Make_Block_Statement (Loc,
1197 Handled_Statement_Sequence =>
1198 Make_Handled_Sequence_Of_Statements (Loc,
1199 Statements => New_List (A)));
1205 -- Adjust the tag if tagged (because of possible view
1206 -- conversions), unless compiling for a VM where
1207 -- tags are implicit.
1209 if Present (Comp_Type)
1210 and then Is_Tagged_Type (Comp_Type)
1211 and then Tagged_Type_Expansion
1214 Full_Typ : constant Entity_Id := Underlying_Type (Comp_Type);
1218 Make_OK_Assignment_Statement (Loc,
1220 Make_Selected_Component (Loc,
1221 Prefix => New_Copy_Tree (Indexed_Comp),
1224 (First_Tag_Component (Full_Typ), Loc)),
1227 Unchecked_Convert_To (RTE (RE_Tag),
1229 (Node (First_Elmt (Access_Disp_Table (Full_Typ))),
1236 -- Adjust and attach the component to the proper final list, which
1237 -- can be the controller of the outer record object or the final
1238 -- list associated with the scope.
1240 -- If the component is itself an array of controlled types, whose
1241 -- value is given by a sub-aggregate, then the attach calls have
1242 -- been generated when individual subcomponent are assigned, and
1243 -- must not be done again to prevent malformed finalization chains
1244 -- (see comments above, concerning the creation of a block to hold
1245 -- inner finalization actions).
1247 if Present (Comp_Type)
1248 and then Needs_Finalization (Comp_Type)
1249 and then not Is_Limited_Type (Comp_Type)
1251 (Is_Array_Type (Comp_Type)
1252 and then Is_Controlled (Component_Type (Comp_Type))
1253 and then Nkind (Expr) = N_Aggregate)
1257 Ref => New_Copy_Tree (Indexed_Comp),
1260 With_Attach => Make_Integer_Literal (Loc, 1)));
1264 return Add_Loop_Actions (L);
1271 function Gen_Loop (L, H : Node_Id; Expr : Node_Id) return List_Id is
1281 -- Index_Base'(L) .. Index_Base'(H)
1283 L_Iteration_Scheme : Node_Id;
1284 -- L_J in Index_Base'(L) .. Index_Base'(H)
1287 -- The statements to execute in the loop
1289 S : constant List_Id := New_List;
1290 -- List of statements
1293 -- Copy of expression tree, used for checking purposes
1296 -- If loop bounds define an empty range return the null statement
1298 if Empty_Range (L, H) then
1299 Append_To (S, Make_Null_Statement (Loc));
1301 -- Ada 2005 (AI-287): Nothing else need to be done in case of
1302 -- default initialized component.
1308 -- The expression must be type-checked even though no component
1309 -- of the aggregate will have this value. This is done only for
1310 -- actual components of the array, not for subaggregates. Do
1311 -- the check on a copy, because the expression may be shared
1312 -- among several choices, some of which might be non-null.
1314 if Present (Etype (N))
1315 and then Is_Array_Type (Etype (N))
1316 and then No (Next_Index (Index))
1318 Expander_Mode_Save_And_Set (False);
1319 Tcopy := New_Copy_Tree (Expr);
1320 Set_Parent (Tcopy, N);
1321 Analyze_And_Resolve (Tcopy, Component_Type (Etype (N)));
1322 Expander_Mode_Restore;
1328 -- If loop bounds are the same then generate an assignment
1330 elsif Equal (L, H) then
1331 return Gen_Assign (New_Copy_Tree (L), Expr);
1333 -- If H - L <= 2 then generate a sequence of assignments when we are
1334 -- processing the bottom most aggregate and it contains scalar
1337 elsif No (Next_Index (Index))
1338 and then Scalar_Comp
1339 and then Local_Compile_Time_Known_Value (L)
1340 and then Local_Compile_Time_Known_Value (H)
1341 and then Local_Expr_Value (H) - Local_Expr_Value (L) <= 2
1344 Append_List_To (S, Gen_Assign (New_Copy_Tree (L), Expr));
1345 Append_List_To (S, Gen_Assign (Add (1, To => L), Expr));
1347 if Local_Expr_Value (H) - Local_Expr_Value (L) = 2 then
1348 Append_List_To (S, Gen_Assign (Add (2, To => L), Expr));
1354 -- Otherwise construct the loop, starting with the loop index L_J
1356 L_J := Make_Temporary (Loc, 'J', L);
1358 -- Construct "L .. H" in Index_Base. We use a qualified expression
1359 -- for the bound to convert to the index base, but we don't need
1360 -- to do that if we already have the base type at hand.
1362 if Etype (L) = Index_Base then
1366 Make_Qualified_Expression (Loc,
1367 Subtype_Mark => Index_Base_Name,
1371 if Etype (H) = Index_Base then
1375 Make_Qualified_Expression (Loc,
1376 Subtype_Mark => Index_Base_Name,
1385 -- Construct "for L_J in Index_Base range L .. H"
1387 L_Iteration_Scheme :=
1388 Make_Iteration_Scheme
1390 Loop_Parameter_Specification =>
1391 Make_Loop_Parameter_Specification
1393 Defining_Identifier => L_J,
1394 Discrete_Subtype_Definition => L_Range));
1396 -- Construct the statements to execute in the loop body
1398 L_Body := Gen_Assign (New_Reference_To (L_J, Loc), Expr);
1400 -- Construct the final loop
1402 Append_To (S, Make_Implicit_Loop_Statement
1404 Identifier => Empty,
1405 Iteration_Scheme => L_Iteration_Scheme,
1406 Statements => L_Body));
1408 -- A small optimization: if the aggregate is initialized with a box
1409 -- and the component type has no initialization procedure, remove the
1410 -- useless empty loop.
1412 if Nkind (First (S)) = N_Loop_Statement
1413 and then Is_Empty_List (Statements (First (S)))
1415 return New_List (Make_Null_Statement (Loc));
1425 -- The code built is
1427 -- W_J : Index_Base := L;
1428 -- while W_J < H loop
1429 -- W_J := Index_Base'Succ (W);
1433 function Gen_While (L, H : Node_Id; Expr : Node_Id) return List_Id is
1437 -- W_J : Base_Type := L;
1439 W_Iteration_Scheme : Node_Id;
1442 W_Index_Succ : Node_Id;
1443 -- Index_Base'Succ (J)
1445 W_Increment : Node_Id;
1446 -- W_J := Index_Base'Succ (W)
1448 W_Body : constant List_Id := New_List;
1449 -- The statements to execute in the loop
1451 S : constant List_Id := New_List;
1452 -- list of statement
1455 -- If loop bounds define an empty range or are equal return null
1457 if Empty_Range (L, H) or else Equal (L, H) then
1458 Append_To (S, Make_Null_Statement (Loc));
1462 -- Build the decl of W_J
1464 W_J := Make_Temporary (Loc, 'J', L);
1466 Make_Object_Declaration
1468 Defining_Identifier => W_J,
1469 Object_Definition => Index_Base_Name,
1472 -- Theoretically we should do a New_Copy_Tree (L) here, but we know
1473 -- that in this particular case L is a fresh Expr generated by
1474 -- Add which we are the only ones to use.
1476 Append_To (S, W_Decl);
1478 -- Construct " while W_J < H"
1480 W_Iteration_Scheme :=
1481 Make_Iteration_Scheme
1483 Condition => Make_Op_Lt
1485 Left_Opnd => New_Reference_To (W_J, Loc),
1486 Right_Opnd => New_Copy_Tree (H)));
1488 -- Construct the statements to execute in the loop body
1491 Make_Attribute_Reference
1493 Prefix => Index_Base_Name,
1494 Attribute_Name => Name_Succ,
1495 Expressions => New_List (New_Reference_To (W_J, Loc)));
1498 Make_OK_Assignment_Statement
1500 Name => New_Reference_To (W_J, Loc),
1501 Expression => W_Index_Succ);
1503 Append_To (W_Body, W_Increment);
1504 Append_List_To (W_Body,
1505 Gen_Assign (New_Reference_To (W_J, Loc), Expr));
1507 -- Construct the final loop
1509 Append_To (S, Make_Implicit_Loop_Statement
1511 Identifier => Empty,
1512 Iteration_Scheme => W_Iteration_Scheme,
1513 Statements => W_Body));
1518 ---------------------
1519 -- Index_Base_Name --
1520 ---------------------
1522 function Index_Base_Name return Node_Id is
1524 return New_Reference_To (Index_Base, Sloc (N));
1525 end Index_Base_Name;
1527 ------------------------------------
1528 -- Local_Compile_Time_Known_Value --
1529 ------------------------------------
1531 function Local_Compile_Time_Known_Value (E : Node_Id) return Boolean is
1533 return Compile_Time_Known_Value (E)
1535 (Nkind (E) = N_Attribute_Reference
1536 and then Attribute_Name (E) = Name_Val
1537 and then Compile_Time_Known_Value (First (Expressions (E))));
1538 end Local_Compile_Time_Known_Value;
1540 ----------------------
1541 -- Local_Expr_Value --
1542 ----------------------
1544 function Local_Expr_Value (E : Node_Id) return Uint is
1546 if Compile_Time_Known_Value (E) then
1547 return Expr_Value (E);
1549 return Expr_Value (First (Expressions (E)));
1551 end Local_Expr_Value;
1553 -- Build_Array_Aggr_Code Variables
1560 Others_Expr : Node_Id := Empty;
1561 Others_Box_Present : Boolean := False;
1563 Aggr_L : constant Node_Id := Low_Bound (Aggregate_Bounds (N));
1564 Aggr_H : constant Node_Id := High_Bound (Aggregate_Bounds (N));
1565 -- The aggregate bounds of this specific sub-aggregate. Note that if
1566 -- the code generated by Build_Array_Aggr_Code is executed then these
1567 -- bounds are OK. Otherwise a Constraint_Error would have been raised.
1569 Aggr_Low : constant Node_Id := Duplicate_Subexpr_No_Checks (Aggr_L);
1570 Aggr_High : constant Node_Id := Duplicate_Subexpr_No_Checks (Aggr_H);
1571 -- After Duplicate_Subexpr these are side-effect free
1576 Nb_Choices : Nat := 0;
1577 Table : Case_Table_Type (1 .. Number_Of_Choices (N));
1578 -- Used to sort all the different choice values
1581 -- Number of elements in the positional aggregate
1583 New_Code : constant List_Id := New_List;
1585 -- Start of processing for Build_Array_Aggr_Code
1588 -- First before we start, a special case. if we have a bit packed
1589 -- array represented as a modular type, then clear the value to
1590 -- zero first, to ensure that unused bits are properly cleared.
1595 and then Is_Bit_Packed_Array (Typ)
1596 and then Is_Modular_Integer_Type (Packed_Array_Type (Typ))
1598 Append_To (New_Code,
1599 Make_Assignment_Statement (Loc,
1600 Name => New_Copy_Tree (Into),
1602 Unchecked_Convert_To (Typ,
1603 Make_Integer_Literal (Loc, Uint_0))));
1606 -- If the component type contains tasks, we need to build a Master
1607 -- entity in the current scope, because it will be needed if build-
1608 -- in-place functions are called in the expanded code.
1610 if Nkind (Parent (N)) = N_Object_Declaration
1611 and then Has_Task (Typ)
1613 Build_Master_Entity (Defining_Identifier (Parent (N)));
1616 -- STEP 1: Process component associations
1618 -- For those associations that may generate a loop, initialize
1619 -- Loop_Actions to collect inserted actions that may be crated.
1621 -- Skip this if no component associations
1623 if No (Expressions (N)) then
1625 -- STEP 1 (a): Sort the discrete choices
1627 Assoc := First (Component_Associations (N));
1628 while Present (Assoc) loop
1629 Choice := First (Choices (Assoc));
1630 while Present (Choice) loop
1631 if Nkind (Choice) = N_Others_Choice then
1632 Set_Loop_Actions (Assoc, New_List);
1634 if Box_Present (Assoc) then
1635 Others_Box_Present := True;
1637 Others_Expr := Expression (Assoc);
1642 Get_Index_Bounds (Choice, Low, High);
1645 Set_Loop_Actions (Assoc, New_List);
1648 Nb_Choices := Nb_Choices + 1;
1649 if Box_Present (Assoc) then
1650 Table (Nb_Choices) := (Choice_Lo => Low,
1652 Choice_Node => Empty);
1654 Table (Nb_Choices) := (Choice_Lo => Low,
1656 Choice_Node => Expression (Assoc));
1664 -- If there is more than one set of choices these must be static
1665 -- and we can therefore sort them. Remember that Nb_Choices does not
1666 -- account for an others choice.
1668 if Nb_Choices > 1 then
1669 Sort_Case_Table (Table);
1672 -- STEP 1 (b): take care of the whole set of discrete choices
1674 for J in 1 .. Nb_Choices loop
1675 Low := Table (J).Choice_Lo;
1676 High := Table (J).Choice_Hi;
1677 Expr := Table (J).Choice_Node;
1678 Append_List (Gen_Loop (Low, High, Expr), To => New_Code);
1681 -- STEP 1 (c): generate the remaining loops to cover others choice
1682 -- We don't need to generate loops over empty gaps, but if there is
1683 -- a single empty range we must analyze the expression for semantics
1685 if Present (Others_Expr) or else Others_Box_Present then
1687 First : Boolean := True;
1690 for J in 0 .. Nb_Choices loop
1694 Low := Add (1, To => Table (J).Choice_Hi);
1697 if J = Nb_Choices then
1700 High := Add (-1, To => Table (J + 1).Choice_Lo);
1703 -- If this is an expansion within an init proc, make
1704 -- sure that discriminant references are replaced by
1705 -- the corresponding discriminal.
1707 if Inside_Init_Proc then
1708 if Is_Entity_Name (Low)
1709 and then Ekind (Entity (Low)) = E_Discriminant
1711 Set_Entity (Low, Discriminal (Entity (Low)));
1714 if Is_Entity_Name (High)
1715 and then Ekind (Entity (High)) = E_Discriminant
1717 Set_Entity (High, Discriminal (Entity (High)));
1722 or else not Empty_Range (Low, High)
1726 (Gen_Loop (Low, High, Others_Expr), To => New_Code);
1732 -- STEP 2: Process positional components
1735 -- STEP 2 (a): Generate the assignments for each positional element
1736 -- Note that here we have to use Aggr_L rather than Aggr_Low because
1737 -- Aggr_L is analyzed and Add wants an analyzed expression.
1739 Expr := First (Expressions (N));
1741 while Present (Expr) loop
1742 Nb_Elements := Nb_Elements + 1;
1743 Append_List (Gen_Assign (Add (Nb_Elements, To => Aggr_L), Expr),
1748 -- STEP 2 (b): Generate final loop if an others choice is present
1749 -- Here Nb_Elements gives the offset of the last positional element.
1751 if Present (Component_Associations (N)) then
1752 Assoc := Last (Component_Associations (N));
1754 -- Ada 2005 (AI-287)
1756 if Box_Present (Assoc) then
1757 Append_List (Gen_While (Add (Nb_Elements, To => Aggr_L),
1762 Expr := Expression (Assoc);
1764 Append_List (Gen_While (Add (Nb_Elements, To => Aggr_L),
1773 end Build_Array_Aggr_Code;
1775 ----------------------------
1776 -- Build_Record_Aggr_Code --
1777 ----------------------------
1779 function Build_Record_Aggr_Code
1783 Flist : Node_Id := Empty;
1784 Obj : Entity_Id := Empty;
1785 Is_Limited_Ancestor_Expansion : Boolean := False) return List_Id
1787 Loc : constant Source_Ptr := Sloc (N);
1788 L : constant List_Id := New_List;
1789 N_Typ : constant Entity_Id := Etype (N);
1796 Comp_Type : Entity_Id;
1797 Selector : Entity_Id;
1798 Comp_Expr : Node_Id;
1801 Internal_Final_List : Node_Id := Empty;
1803 -- If this is an internal aggregate, the External_Final_List is an
1804 -- expression for the controller record of the enclosing type.
1806 -- If the current aggregate has several controlled components, this
1807 -- expression will appear in several calls to attach to the finali-
1808 -- zation list, and it must not be shared.
1810 External_Final_List : Node_Id;
1811 Ancestor_Is_Expression : Boolean := False;
1812 Ancestor_Is_Subtype_Mark : Boolean := False;
1814 Init_Typ : Entity_Id := Empty;
1817 Ctrl_Stuff_Done : Boolean := False;
1818 -- True if Gen_Ctrl_Actions_For_Aggr has already been called; calls
1819 -- after the first do nothing.
1821 function Ancestor_Discriminant_Value (Disc : Entity_Id) return Node_Id;
1822 -- Returns the value that the given discriminant of an ancestor type
1823 -- should receive (in the absence of a conflict with the value provided
1824 -- by an ancestor part of an extension aggregate).
1826 procedure Check_Ancestor_Discriminants (Anc_Typ : Entity_Id);
1827 -- Check that each of the discriminant values defined by the ancestor
1828 -- part of an extension aggregate match the corresponding values
1829 -- provided by either an association of the aggregate or by the
1830 -- constraint imposed by a parent type (RM95-4.3.2(8)).
1832 function Compatible_Int_Bounds
1833 (Agg_Bounds : Node_Id;
1834 Typ_Bounds : Node_Id) return Boolean;
1835 -- Return true if Agg_Bounds are equal or within Typ_Bounds. It is
1836 -- assumed that both bounds are integer ranges.
1838 procedure Gen_Ctrl_Actions_For_Aggr;
1839 -- Deal with the various controlled type data structure initializations
1840 -- (but only if it hasn't been done already).
1842 function Get_Constraint_Association (T : Entity_Id) return Node_Id;
1843 -- Returns the first discriminant association in the constraint
1844 -- associated with T, if any, otherwise returns Empty.
1846 function Init_Controller
1851 Init_Pr : Boolean) return List_Id;
1852 -- Returns the list of statements necessary to initialize the internal
1853 -- controller of the (possible) ancestor typ into target and attach it
1854 -- to finalization list F. Init_Pr conditions the call to the init proc
1855 -- since it may already be done due to ancestor initialization.
1857 function Is_Int_Range_Bounds (Bounds : Node_Id) return Boolean;
1858 -- Check whether Bounds is a range node and its lower and higher bounds
1859 -- are integers literals.
1861 ---------------------------------
1862 -- Ancestor_Discriminant_Value --
1863 ---------------------------------
1865 function Ancestor_Discriminant_Value (Disc : Entity_Id) return Node_Id is
1867 Assoc_Elmt : Elmt_Id;
1868 Aggr_Comp : Entity_Id;
1869 Corresp_Disc : Entity_Id;
1870 Current_Typ : Entity_Id := Base_Type (Typ);
1871 Parent_Typ : Entity_Id;
1872 Parent_Disc : Entity_Id;
1873 Save_Assoc : Node_Id := Empty;
1876 -- First check any discriminant associations to see if any of them
1877 -- provide a value for the discriminant.
1879 if Present (Discriminant_Specifications (Parent (Current_Typ))) then
1880 Assoc := First (Component_Associations (N));
1881 while Present (Assoc) loop
1882 Aggr_Comp := Entity (First (Choices (Assoc)));
1884 if Ekind (Aggr_Comp) = E_Discriminant then
1885 Save_Assoc := Expression (Assoc);
1887 Corresp_Disc := Corresponding_Discriminant (Aggr_Comp);
1888 while Present (Corresp_Disc) loop
1890 -- If found a corresponding discriminant then return the
1891 -- value given in the aggregate. (Note: this is not
1892 -- correct in the presence of side effects. ???)
1894 if Disc = Corresp_Disc then
1895 return Duplicate_Subexpr (Expression (Assoc));
1899 Corresponding_Discriminant (Corresp_Disc);
1907 -- No match found in aggregate, so chain up parent types to find
1908 -- a constraint that defines the value of the discriminant.
1910 Parent_Typ := Etype (Current_Typ);
1911 while Current_Typ /= Parent_Typ loop
1912 if Has_Discriminants (Parent_Typ)
1913 and then not Has_Unknown_Discriminants (Parent_Typ)
1915 Parent_Disc := First_Discriminant (Parent_Typ);
1917 -- We either get the association from the subtype indication
1918 -- of the type definition itself, or from the discriminant
1919 -- constraint associated with the type entity (which is
1920 -- preferable, but it's not always present ???)
1922 if Is_Empty_Elmt_List (
1923 Discriminant_Constraint (Current_Typ))
1925 Assoc := Get_Constraint_Association (Current_Typ);
1926 Assoc_Elmt := No_Elmt;
1929 First_Elmt (Discriminant_Constraint (Current_Typ));
1930 Assoc := Node (Assoc_Elmt);
1933 -- Traverse the discriminants of the parent type looking
1934 -- for one that corresponds.
1936 while Present (Parent_Disc) and then Present (Assoc) loop
1937 Corresp_Disc := Parent_Disc;
1938 while Present (Corresp_Disc)
1939 and then Disc /= Corresp_Disc
1942 Corresponding_Discriminant (Corresp_Disc);
1945 if Disc = Corresp_Disc then
1946 if Nkind (Assoc) = N_Discriminant_Association then
1947 Assoc := Expression (Assoc);
1950 -- If the located association directly denotes a
1951 -- discriminant, then use the value of a saved
1952 -- association of the aggregate. This is a kludge to
1953 -- handle certain cases involving multiple discriminants
1954 -- mapped to a single discriminant of a descendant. It's
1955 -- not clear how to locate the appropriate discriminant
1956 -- value for such cases. ???
1958 if Is_Entity_Name (Assoc)
1959 and then Ekind (Entity (Assoc)) = E_Discriminant
1961 Assoc := Save_Assoc;
1964 return Duplicate_Subexpr (Assoc);
1967 Next_Discriminant (Parent_Disc);
1969 if No (Assoc_Elmt) then
1972 Next_Elmt (Assoc_Elmt);
1973 if Present (Assoc_Elmt) then
1974 Assoc := Node (Assoc_Elmt);
1982 Current_Typ := Parent_Typ;
1983 Parent_Typ := Etype (Current_Typ);
1986 -- In some cases there's no ancestor value to locate (such as
1987 -- when an ancestor part given by an expression defines the
1988 -- discriminant value).
1991 end Ancestor_Discriminant_Value;
1993 ----------------------------------
1994 -- Check_Ancestor_Discriminants --
1995 ----------------------------------
1997 procedure Check_Ancestor_Discriminants (Anc_Typ : Entity_Id) is
1999 Disc_Value : Node_Id;
2003 Discr := First_Discriminant (Base_Type (Anc_Typ));
2004 while Present (Discr) loop
2005 Disc_Value := Ancestor_Discriminant_Value (Discr);
2007 if Present (Disc_Value) then
2008 Cond := Make_Op_Ne (Loc,
2010 Make_Selected_Component (Loc,
2011 Prefix => New_Copy_Tree (Target),
2012 Selector_Name => New_Occurrence_Of (Discr, Loc)),
2013 Right_Opnd => Disc_Value);
2016 Make_Raise_Constraint_Error (Loc,
2018 Reason => CE_Discriminant_Check_Failed));
2021 Next_Discriminant (Discr);
2023 end Check_Ancestor_Discriminants;
2025 ---------------------------
2026 -- Compatible_Int_Bounds --
2027 ---------------------------
2029 function Compatible_Int_Bounds
2030 (Agg_Bounds : Node_Id;
2031 Typ_Bounds : Node_Id) return Boolean
2033 Agg_Lo : constant Uint := Intval (Low_Bound (Agg_Bounds));
2034 Agg_Hi : constant Uint := Intval (High_Bound (Agg_Bounds));
2035 Typ_Lo : constant Uint := Intval (Low_Bound (Typ_Bounds));
2036 Typ_Hi : constant Uint := Intval (High_Bound (Typ_Bounds));
2038 return Typ_Lo <= Agg_Lo and then Agg_Hi <= Typ_Hi;
2039 end Compatible_Int_Bounds;
2041 --------------------------------
2042 -- Get_Constraint_Association --
2043 --------------------------------
2045 function Get_Constraint_Association (T : Entity_Id) return Node_Id is
2046 Typ_Def : constant Node_Id := Type_Definition (Parent (T));
2047 Indic : constant Node_Id := Subtype_Indication (Typ_Def);
2050 -- ??? Also need to cover case of a type mark denoting a subtype
2053 if Nkind (Indic) = N_Subtype_Indication
2054 and then Present (Constraint (Indic))
2056 return First (Constraints (Constraint (Indic)));
2060 end Get_Constraint_Association;
2062 ---------------------
2063 -- Init_Controller --
2064 ---------------------
2066 function Init_Controller
2071 Init_Pr : Boolean) return List_Id
2073 L : constant List_Id := New_List;
2076 Target_Type : Entity_Id;
2080 -- init-proc (target._controller);
2081 -- initialize (target._controller);
2082 -- Attach_to_Final_List (target._controller, F);
2085 Make_Selected_Component (Loc,
2086 Prefix => Convert_To (Typ, New_Copy_Tree (Target)),
2087 Selector_Name => Make_Identifier (Loc, Name_uController));
2088 Set_Assignment_OK (Ref);
2090 -- Ada 2005 (AI-287): Give support to aggregates of limited types.
2091 -- If the type is intrinsically limited the controller is limited as
2092 -- well. If it is tagged and limited then so is the controller.
2093 -- Otherwise an untagged type may have limited components without its
2094 -- full view being limited, so the controller is not limited.
2096 if Nkind (Target) = N_Identifier then
2097 Target_Type := Etype (Target);
2099 elsif Nkind (Target) = N_Selected_Component then
2100 Target_Type := Etype (Selector_Name (Target));
2102 elsif Nkind (Target) = N_Unchecked_Type_Conversion then
2103 Target_Type := Etype (Target);
2105 elsif Nkind (Target) = N_Unchecked_Expression
2106 and then Nkind (Expression (Target)) = N_Indexed_Component
2108 Target_Type := Etype (Prefix (Expression (Target)));
2111 Target_Type := Etype (Target);
2114 -- If the target has not been analyzed yet, as will happen with
2115 -- delayed expansion, use the given type (either the aggregate type
2116 -- or an ancestor) to determine limitedness.
2118 if No (Target_Type) then
2122 if (Is_Tagged_Type (Target_Type))
2123 and then Is_Limited_Type (Target_Type)
2125 RC := RE_Limited_Record_Controller;
2127 elsif Is_Immutably_Limited_Type (Target_Type) then
2128 RC := RE_Limited_Record_Controller;
2131 RC := RE_Record_Controller;
2136 Build_Initialization_Call (Loc,
2139 In_Init_Proc => Within_Init_Proc));
2143 Make_Procedure_Call_Statement (Loc,
2146 Find_Prim_Op (RTE (RC), Name_Initialize), Loc),
2147 Parameter_Associations =>
2148 New_List (New_Copy_Tree (Ref))));
2152 Obj_Ref => New_Copy_Tree (Ref),
2154 With_Attach => Attach));
2157 end Init_Controller;
2159 -------------------------
2160 -- Is_Int_Range_Bounds --
2161 -------------------------
2163 function Is_Int_Range_Bounds (Bounds : Node_Id) return Boolean is
2165 return Nkind (Bounds) = N_Range
2166 and then Nkind (Low_Bound (Bounds)) = N_Integer_Literal
2167 and then Nkind (High_Bound (Bounds)) = N_Integer_Literal;
2168 end Is_Int_Range_Bounds;
2170 -------------------------------
2171 -- Gen_Ctrl_Actions_For_Aggr --
2172 -------------------------------
2174 procedure Gen_Ctrl_Actions_For_Aggr is
2175 Alloc : Node_Id := Empty;
2178 -- Do the work only the first time this is called
2180 if Ctrl_Stuff_Done then
2184 Ctrl_Stuff_Done := True;
2187 and then Finalize_Storage_Only (Typ)
2189 (Is_Library_Level_Entity (Obj)
2190 or else Entity (Constant_Value (RTE (RE_Garbage_Collected))) =
2193 -- why not Is_True (Expr_Value (RTE (RE_Garbaage_Collected) ???
2195 Attach := Make_Integer_Literal (Loc, 0);
2197 elsif Nkind (Parent (N)) = N_Qualified_Expression
2198 and then Nkind (Parent (Parent (N))) = N_Allocator
2200 Alloc := Parent (Parent (N));
2201 Attach := Make_Integer_Literal (Loc, 2);
2204 Attach := Make_Integer_Literal (Loc, 1);
2207 -- Determine the external finalization list. It is either the
2208 -- finalization list of the outer-scope or the one coming from
2209 -- an outer aggregate. When the target is not a temporary, the
2210 -- proper scope is the scope of the target rather than the
2211 -- potentially transient current scope.
2213 if Needs_Finalization (Typ) then
2215 -- The current aggregate belongs to an allocator which creates
2216 -- an object through an anonymous access type or acts as the root
2217 -- of a coextension chain.
2221 (Is_Coextension_Root (Alloc)
2222 or else Ekind (Etype (Alloc)) = E_Anonymous_Access_Type)
2224 if No (Associated_Final_Chain (Etype (Alloc))) then
2225 Build_Final_List (Alloc, Etype (Alloc));
2228 External_Final_List :=
2229 Make_Selected_Component (Loc,
2232 Associated_Final_Chain (Etype (Alloc)), Loc),
2233 Selector_Name => Make_Identifier (Loc, Name_F));
2235 elsif Present (Flist) then
2236 External_Final_List := New_Copy_Tree (Flist);
2238 elsif Is_Entity_Name (Target)
2239 and then Present (Scope (Entity (Target)))
2241 External_Final_List :=
2242 Find_Final_List (Scope (Entity (Target)));
2245 External_Final_List := Find_Final_List (Current_Scope);
2248 External_Final_List := Empty;
2251 -- Initialize and attach the outer object in the is_controlled case
2253 if Is_Controlled (Typ) then
2254 if Ancestor_Is_Subtype_Mark then
2255 Ref := Convert_To (Init_Typ, New_Copy_Tree (Target));
2256 Set_Assignment_OK (Ref);
2258 Make_Procedure_Call_Statement (Loc,
2261 (Find_Prim_Op (Init_Typ, Name_Initialize), Loc),
2262 Parameter_Associations => New_List (New_Copy_Tree (Ref))));
2265 if not Has_Controlled_Component (Typ) then
2266 Ref := New_Copy_Tree (Target);
2267 Set_Assignment_OK (Ref);
2269 -- This is an aggregate of a coextension. Do not produce a
2270 -- finalization call, but rather attach the reference of the
2271 -- aggregate to its coextension chain.
2274 and then Is_Dynamic_Coextension (Alloc)
2276 if No (Coextensions (Alloc)) then
2277 Set_Coextensions (Alloc, New_Elmt_List);
2280 Append_Elmt (Ref, Coextensions (Alloc));
2285 Flist_Ref => New_Copy_Tree (External_Final_List),
2286 With_Attach => Attach));
2291 -- In the Has_Controlled component case, all the intermediate
2292 -- controllers must be initialized.
2294 if Has_Controlled_Component (Typ)
2295 and not Is_Limited_Ancestor_Expansion
2298 Inner_Typ : Entity_Id;
2299 Outer_Typ : Entity_Id;
2303 -- Find outer type with a controller
2305 Outer_Typ := Base_Type (Typ);
2306 while Outer_Typ /= Init_Typ
2307 and then not Has_New_Controlled_Component (Outer_Typ)
2309 Outer_Typ := Etype (Outer_Typ);
2312 -- Attach it to the outer record controller to the external
2315 if Outer_Typ = Init_Typ then
2320 F => External_Final_List,
2325 Inner_Typ := Init_Typ;
2332 F => External_Final_List,
2336 Inner_Typ := Etype (Outer_Typ);
2338 not Is_Tagged_Type (Typ) or else Inner_Typ = Outer_Typ;
2341 -- The outer object has to be attached as well
2343 if Is_Controlled (Typ) then
2344 Ref := New_Copy_Tree (Target);
2345 Set_Assignment_OK (Ref);
2349 Flist_Ref => New_Copy_Tree (External_Final_List),
2350 With_Attach => New_Copy_Tree (Attach)));
2353 -- Initialize the internal controllers for tagged types with
2354 -- more than one controller.
2356 while not At_Root and then Inner_Typ /= Init_Typ loop
2357 if Has_New_Controlled_Component (Inner_Typ) then
2359 Make_Selected_Component (Loc,
2361 Convert_To (Outer_Typ, New_Copy_Tree (Target)),
2363 Make_Identifier (Loc, Name_uController));
2365 Make_Selected_Component (Loc,
2367 Selector_Name => Make_Identifier (Loc, Name_F));
2374 Attach => Make_Integer_Literal (Loc, 1),
2376 Outer_Typ := Inner_Typ;
2381 At_Root := Inner_Typ = Etype (Inner_Typ);
2382 Inner_Typ := Etype (Inner_Typ);
2385 -- If not done yet attach the controller of the ancestor part
2387 if Outer_Typ /= Init_Typ
2388 and then Inner_Typ = Init_Typ
2389 and then Has_Controlled_Component (Init_Typ)
2392 Make_Selected_Component (Loc,
2393 Prefix => Convert_To (Outer_Typ, New_Copy_Tree (Target)),
2395 Make_Identifier (Loc, Name_uController));
2397 Make_Selected_Component (Loc,
2399 Selector_Name => Make_Identifier (Loc, Name_F));
2401 Attach := Make_Integer_Literal (Loc, 1);
2410 -- Note: Init_Pr is False because the ancestor part has
2411 -- already been initialized either way (by default, if
2412 -- given by a type name, otherwise from the expression).
2417 end Gen_Ctrl_Actions_For_Aggr;
2419 function Rewrite_Discriminant (Expr : Node_Id) return Traverse_Result;
2420 -- If default expression of a component mentions a discriminant of the
2421 -- type, it must be rewritten as the discriminant of the target object.
2423 function Replace_Type (Expr : Node_Id) return Traverse_Result;
2424 -- If the aggregate contains a self-reference, traverse each expression
2425 -- to replace a possible self-reference with a reference to the proper
2426 -- component of the target of the assignment.
2428 --------------------------
2429 -- Rewrite_Discriminant --
2430 --------------------------
2432 function Rewrite_Discriminant (Expr : Node_Id) return Traverse_Result is
2434 if Is_Entity_Name (Expr)
2435 and then Present (Entity (Expr))
2436 and then Ekind (Entity (Expr)) = E_In_Parameter
2437 and then Present (Discriminal_Link (Entity (Expr)))
2438 and then Scope (Discriminal_Link (Entity (Expr)))
2439 = Base_Type (Etype (N))
2442 Make_Selected_Component (Loc,
2443 Prefix => New_Copy_Tree (Lhs),
2444 Selector_Name => Make_Identifier (Loc, Chars (Expr))));
2447 end Rewrite_Discriminant;
2453 function Replace_Type (Expr : Node_Id) return Traverse_Result is
2455 -- Note regarding the Root_Type test below: Aggregate components for
2456 -- self-referential types include attribute references to the current
2457 -- instance, of the form: Typ'access, etc.. These references are
2458 -- rewritten as references to the target of the aggregate: the
2459 -- left-hand side of an assignment, the entity in a declaration,
2460 -- or a temporary. Without this test, we would improperly extended
2461 -- this rewriting to attribute references whose prefix was not the
2462 -- type of the aggregate.
2464 if Nkind (Expr) = N_Attribute_Reference
2465 and then Is_Entity_Name (Prefix (Expr))
2466 and then Is_Type (Entity (Prefix (Expr)))
2467 and then Root_Type (Etype (N)) = Root_Type (Entity (Prefix (Expr)))
2469 if Is_Entity_Name (Lhs) then
2470 Rewrite (Prefix (Expr),
2471 New_Occurrence_Of (Entity (Lhs), Loc));
2473 elsif Nkind (Lhs) = N_Selected_Component then
2475 Make_Attribute_Reference (Loc,
2476 Attribute_Name => Name_Unrestricted_Access,
2477 Prefix => New_Copy_Tree (Prefix (Lhs))));
2478 Set_Analyzed (Parent (Expr), False);
2482 Make_Attribute_Reference (Loc,
2483 Attribute_Name => Name_Unrestricted_Access,
2484 Prefix => New_Copy_Tree (Lhs)));
2485 Set_Analyzed (Parent (Expr), False);
2492 procedure Replace_Self_Reference is
2493 new Traverse_Proc (Replace_Type);
2495 procedure Replace_Discriminants is
2496 new Traverse_Proc (Rewrite_Discriminant);
2498 -- Start of processing for Build_Record_Aggr_Code
2501 if Has_Self_Reference (N) then
2502 Replace_Self_Reference (N);
2505 -- If the target of the aggregate is class-wide, we must convert it
2506 -- to the actual type of the aggregate, so that the proper components
2507 -- are visible. We know already that the types are compatible.
2509 if Present (Etype (Lhs))
2510 and then Is_Class_Wide_Type (Etype (Lhs))
2512 Target := Unchecked_Convert_To (Typ, Lhs);
2517 -- Deal with the ancestor part of extension aggregates or with the
2518 -- discriminants of the root type.
2520 if Nkind (N) = N_Extension_Aggregate then
2522 A : constant Node_Id := Ancestor_Part (N);
2526 -- If the ancestor part is a subtype mark "T", we generate
2528 -- init-proc (T(tmp)); if T is constrained and
2529 -- init-proc (S(tmp)); where S applies an appropriate
2530 -- constraint if T is unconstrained
2532 if Is_Entity_Name (A) and then Is_Type (Entity (A)) then
2533 Ancestor_Is_Subtype_Mark := True;
2535 if Is_Constrained (Entity (A)) then
2536 Init_Typ := Entity (A);
2538 -- For an ancestor part given by an unconstrained type mark,
2539 -- create a subtype constrained by appropriate corresponding
2540 -- discriminant values coming from either associations of the
2541 -- aggregate or a constraint on a parent type. The subtype will
2542 -- be used to generate the correct default value for the
2545 elsif Has_Discriminants (Entity (A)) then
2547 Anc_Typ : constant Entity_Id := Entity (A);
2548 Anc_Constr : constant List_Id := New_List;
2549 Discrim : Entity_Id;
2550 Disc_Value : Node_Id;
2551 New_Indic : Node_Id;
2552 Subt_Decl : Node_Id;
2555 Discrim := First_Discriminant (Anc_Typ);
2556 while Present (Discrim) loop
2557 Disc_Value := Ancestor_Discriminant_Value (Discrim);
2558 Append_To (Anc_Constr, Disc_Value);
2559 Next_Discriminant (Discrim);
2563 Make_Subtype_Indication (Loc,
2564 Subtype_Mark => New_Occurrence_Of (Anc_Typ, Loc),
2566 Make_Index_Or_Discriminant_Constraint (Loc,
2567 Constraints => Anc_Constr));
2569 Init_Typ := Create_Itype (Ekind (Anc_Typ), N);
2572 Make_Subtype_Declaration (Loc,
2573 Defining_Identifier => Init_Typ,
2574 Subtype_Indication => New_Indic);
2576 -- Itypes must be analyzed with checks off Declaration
2577 -- must have a parent for proper handling of subsidiary
2580 Set_Parent (Subt_Decl, N);
2581 Analyze (Subt_Decl, Suppress => All_Checks);
2585 Ref := Convert_To (Init_Typ, New_Copy_Tree (Target));
2586 Set_Assignment_OK (Ref);
2588 if not Is_Interface (Init_Typ) then
2590 Build_Initialization_Call (Loc,
2593 In_Init_Proc => Within_Init_Proc,
2594 With_Default_Init => Has_Default_Init_Comps (N)
2596 Has_Task (Base_Type (Init_Typ))));
2598 if Is_Constrained (Entity (A))
2599 and then Has_Discriminants (Entity (A))
2601 Check_Ancestor_Discriminants (Entity (A));
2605 -- Handle calls to C++ constructors
2607 elsif Is_CPP_Constructor_Call (A) then
2608 Init_Typ := Etype (A);
2609 Ref := Convert_To (Init_Typ, New_Copy_Tree (Target));
2610 Set_Assignment_OK (Ref);
2613 Build_Initialization_Call (Loc,
2616 In_Init_Proc => Within_Init_Proc,
2617 With_Default_Init => Has_Default_Init_Comps (N),
2618 Constructor_Ref => A));
2620 -- Ada 2005 (AI-287): If the ancestor part is an aggregate of
2621 -- limited type, a recursive call expands the ancestor. Note that
2622 -- in the limited case, the ancestor part must be either a
2623 -- function call (possibly qualified, or wrapped in an unchecked
2624 -- conversion) or aggregate (definitely qualified).
2625 -- The ancestor part can also be a function call (that may be
2626 -- transformed into an explicit dereference) or a qualification
2629 elsif Is_Limited_Type (Etype (A))
2630 and then Nkind_In (Unqualify (A), N_Aggregate,
2631 N_Extension_Aggregate)
2633 Ancestor_Is_Expression := True;
2635 -- Set up finalization data for enclosing record, because
2636 -- controlled subcomponents of the ancestor part will be
2639 Gen_Ctrl_Actions_For_Aggr;
2642 Build_Record_Aggr_Code (
2644 Typ => Etype (Unqualify (A)),
2648 Is_Limited_Ancestor_Expansion => True));
2650 -- If the ancestor part is an expression "E", we generate
2654 -- In Ada 2005, this includes the case of a (possibly qualified)
2655 -- limited function call. The assignment will turn into a
2656 -- build-in-place function call (for further details, see
2657 -- Make_Build_In_Place_Call_In_Assignment).
2660 Ancestor_Is_Expression := True;
2661 Init_Typ := Etype (A);
2663 -- If the ancestor part is an aggregate, force its full
2664 -- expansion, which was delayed.
2666 if Nkind_In (Unqualify (A), N_Aggregate,
2667 N_Extension_Aggregate)
2669 Set_Analyzed (A, False);
2670 Set_Analyzed (Expression (A), False);
2673 Ref := Convert_To (Init_Typ, New_Copy_Tree (Target));
2674 Set_Assignment_OK (Ref);
2676 -- Make the assignment without usual controlled actions since
2677 -- we only want the post adjust but not the pre finalize here
2678 -- Add manual adjust when necessary.
2680 Assign := New_List (
2681 Make_OK_Assignment_Statement (Loc,
2684 Set_No_Ctrl_Actions (First (Assign));
2686 -- Assign the tag now to make sure that the dispatching call in
2687 -- the subsequent deep_adjust works properly (unless VM_Target,
2688 -- where tags are implicit).
2690 if Tagged_Type_Expansion then
2692 Make_OK_Assignment_Statement (Loc,
2694 Make_Selected_Component (Loc,
2695 Prefix => New_Copy_Tree (Target),
2698 (First_Tag_Component (Base_Type (Typ)), Loc)),
2701 Unchecked_Convert_To (RTE (RE_Tag),
2704 (Access_Disp_Table (Base_Type (Typ)))),
2707 Set_Assignment_OK (Name (Instr));
2708 Append_To (Assign, Instr);
2710 -- Ada 2005 (AI-251): If tagged type has progenitors we must
2711 -- also initialize tags of the secondary dispatch tables.
2713 if Has_Interfaces (Base_Type (Typ)) then
2715 (Typ => Base_Type (Typ),
2717 Stmts_List => Assign);
2721 -- Call Adjust manually
2723 if Needs_Finalization (Etype (A))
2724 and then not Is_Limited_Type (Etype (A))
2726 Append_List_To (Assign,
2728 Ref => New_Copy_Tree (Ref),
2730 Flist_Ref => New_Reference_To (
2731 RTE (RE_Global_Final_List), Loc),
2732 With_Attach => Make_Integer_Literal (Loc, 0)));
2736 Make_Unsuppress_Block (Loc, Name_Discriminant_Check, Assign));
2738 if Has_Discriminants (Init_Typ) then
2739 Check_Ancestor_Discriminants (Init_Typ);
2744 -- Normal case (not an extension aggregate)
2747 -- Generate the discriminant expressions, component by component.
2748 -- If the base type is an unchecked union, the discriminants are
2749 -- unknown to the back-end and absent from a value of the type, so
2750 -- assignments for them are not emitted.
2752 if Has_Discriminants (Typ)
2753 and then not Is_Unchecked_Union (Base_Type (Typ))
2755 -- If the type is derived, and constrains discriminants of the
2756 -- parent type, these discriminants are not components of the
2757 -- aggregate, and must be initialized explicitly. They are not
2758 -- visible components of the object, but can become visible with
2759 -- a view conversion to the ancestor.
2763 Parent_Type : Entity_Id;
2765 Discr_Val : Elmt_Id;
2768 Btype := Base_Type (Typ);
2769 while Is_Derived_Type (Btype)
2770 and then Present (Stored_Constraint (Btype))
2772 Parent_Type := Etype (Btype);
2774 Disc := First_Discriminant (Parent_Type);
2776 First_Elmt (Stored_Constraint (Base_Type (Typ)));
2777 while Present (Discr_Val) loop
2779 -- Only those discriminants of the parent that are not
2780 -- renamed by discriminants of the derived type need to
2781 -- be added explicitly.
2783 if not Is_Entity_Name (Node (Discr_Val))
2785 Ekind (Entity (Node (Discr_Val))) /= E_Discriminant
2788 Make_Selected_Component (Loc,
2789 Prefix => New_Copy_Tree (Target),
2790 Selector_Name => New_Occurrence_Of (Disc, Loc));
2793 Make_OK_Assignment_Statement (Loc,
2795 Expression => New_Copy_Tree (Node (Discr_Val)));
2797 Set_No_Ctrl_Actions (Instr);
2798 Append_To (L, Instr);
2801 Next_Discriminant (Disc);
2802 Next_Elmt (Discr_Val);
2805 Btype := Base_Type (Parent_Type);
2809 -- Generate discriminant init values for the visible discriminants
2812 Discriminant : Entity_Id;
2813 Discriminant_Value : Node_Id;
2816 Discriminant := First_Stored_Discriminant (Typ);
2817 while Present (Discriminant) loop
2819 Make_Selected_Component (Loc,
2820 Prefix => New_Copy_Tree (Target),
2821 Selector_Name => New_Occurrence_Of (Discriminant, Loc));
2823 Discriminant_Value :=
2824 Get_Discriminant_Value (
2827 Discriminant_Constraint (N_Typ));
2830 Make_OK_Assignment_Statement (Loc,
2832 Expression => New_Copy_Tree (Discriminant_Value));
2834 Set_No_Ctrl_Actions (Instr);
2835 Append_To (L, Instr);
2837 Next_Stored_Discriminant (Discriminant);
2843 -- For CPP types we generate an implicit call to the C++ default
2844 -- constructor to ensure the proper initialization of the _Tag
2847 if Is_CPP_Class (Root_Type (Typ))
2848 and then CPP_Num_Prims (Typ) > 0
2850 Invoke_Constructor : declare
2851 CPP_Parent : constant Entity_Id :=
2852 Enclosing_CPP_Parent (Typ);
2854 procedure Invoke_IC_Proc (T : Entity_Id);
2855 -- Recursive routine used to climb to parents. Required because
2856 -- parents must be initialized before descendants to ensure
2857 -- propagation of inherited C++ slots.
2859 --------------------
2860 -- Invoke_IC_Proc --
2861 --------------------
2863 procedure Invoke_IC_Proc (T : Entity_Id) is
2865 -- Avoid generating extra calls. Initialization required
2866 -- only for types defined from the level of derivation of
2867 -- type of the constructor and the type of the aggregate.
2869 if T = CPP_Parent then
2873 Invoke_IC_Proc (Etype (T));
2875 -- Generate call to the IC routine
2877 if Present (CPP_Init_Proc (T)) then
2879 Make_Procedure_Call_Statement (Loc,
2880 New_Reference_To (CPP_Init_Proc (T), Loc)));
2884 -- Start of processing for Invoke_Constructor
2887 -- Implicit invocation of the C++ constructor
2889 if Nkind (N) = N_Aggregate then
2891 Make_Procedure_Call_Statement (Loc,
2894 (Base_Init_Proc (CPP_Parent), Loc),
2895 Parameter_Associations => New_List (
2896 Unchecked_Convert_To (CPP_Parent,
2897 New_Copy_Tree (Lhs)))));
2900 Invoke_IC_Proc (Typ);
2901 end Invoke_Constructor;
2904 -- Generate the assignments, component by component
2906 -- tmp.comp1 := Expr1_From_Aggr;
2907 -- tmp.comp2 := Expr2_From_Aggr;
2910 Comp := First (Component_Associations (N));
2911 while Present (Comp) loop
2912 Selector := Entity (First (Choices (Comp)));
2916 if Is_CPP_Constructor_Call (Expression (Comp)) then
2918 Build_Initialization_Call (Loc,
2919 Id_Ref => Make_Selected_Component (Loc,
2920 Prefix => New_Copy_Tree (Target),
2922 New_Occurrence_Of (Selector, Loc)),
2923 Typ => Etype (Selector),
2925 With_Default_Init => True,
2926 Constructor_Ref => Expression (Comp)));
2928 -- Ada 2005 (AI-287): For each default-initialized component generate
2929 -- a call to the corresponding IP subprogram if available.
2931 elsif Box_Present (Comp)
2932 and then Has_Non_Null_Base_Init_Proc (Etype (Selector))
2934 if Ekind (Selector) /= E_Discriminant then
2935 Gen_Ctrl_Actions_For_Aggr;
2938 -- Ada 2005 (AI-287): If the component type has tasks then
2939 -- generate the activation chain and master entities (except
2940 -- in case of an allocator because in that case these entities
2941 -- are generated by Build_Task_Allocate_Block_With_Init_Stmts).
2944 Ctype : constant Entity_Id := Etype (Selector);
2945 Inside_Allocator : Boolean := False;
2946 P : Node_Id := Parent (N);
2949 if Is_Task_Type (Ctype) or else Has_Task (Ctype) then
2950 while Present (P) loop
2951 if Nkind (P) = N_Allocator then
2952 Inside_Allocator := True;
2959 if not Inside_Init_Proc and not Inside_Allocator then
2960 Build_Activation_Chain_Entity (N);
2966 Build_Initialization_Call (Loc,
2967 Id_Ref => Make_Selected_Component (Loc,
2968 Prefix => New_Copy_Tree (Target),
2970 New_Occurrence_Of (Selector, Loc)),
2971 Typ => Etype (Selector),
2973 With_Default_Init => True));
2975 -- Prepare for component assignment
2977 elsif Ekind (Selector) /= E_Discriminant
2978 or else Nkind (N) = N_Extension_Aggregate
2980 -- All the discriminants have now been assigned
2982 -- This is now a good moment to initialize and attach all the
2983 -- controllers. Their position may depend on the discriminants.
2985 if Ekind (Selector) /= E_Discriminant then
2986 Gen_Ctrl_Actions_For_Aggr;
2989 Comp_Type := Underlying_Type (Etype (Selector));
2991 Make_Selected_Component (Loc,
2992 Prefix => New_Copy_Tree (Target),
2993 Selector_Name => New_Occurrence_Of (Selector, Loc));
2995 if Nkind (Expression (Comp)) = N_Qualified_Expression then
2996 Expr_Q := Expression (Expression (Comp));
2998 Expr_Q := Expression (Comp);
3001 -- The controller is the one of the parent type defining the
3002 -- component (in case of inherited components).
3004 if Needs_Finalization (Comp_Type) then
3005 Internal_Final_List :=
3006 Make_Selected_Component (Loc,
3007 Prefix => Convert_To
3008 (Scope (Original_Record_Component (Selector)),
3009 New_Copy_Tree (Target)),
3010 Selector_Name => Make_Identifier (Loc, Name_uController));
3012 Internal_Final_List :=
3013 Make_Selected_Component (Loc,
3014 Prefix => Internal_Final_List,
3015 Selector_Name => Make_Identifier (Loc, Name_F));
3017 -- The internal final list can be part of a constant object
3019 Set_Assignment_OK (Internal_Final_List);
3022 Internal_Final_List := Empty;
3025 -- Now either create the assignment or generate the code for the
3026 -- inner aggregate top-down.
3028 if Is_Delayed_Aggregate (Expr_Q) then
3030 -- We have the following case of aggregate nesting inside
3031 -- an object declaration:
3033 -- type Arr_Typ is array (Integer range <>) of ...;
3035 -- type Rec_Typ (...) is record
3036 -- Obj_Arr_Typ : Arr_Typ (A .. B);
3039 -- Obj_Rec_Typ : Rec_Typ := (...,
3040 -- Obj_Arr_Typ => (X => (...), Y => (...)));
3042 -- The length of the ranges of the aggregate and Obj_Add_Typ
3043 -- are equal (B - A = Y - X), but they do not coincide (X /=
3044 -- A and B /= Y). This case requires array sliding which is
3045 -- performed in the following manner:
3047 -- subtype Arr_Sub is Arr_Typ (X .. Y);
3049 -- Temp (X) := (...);
3051 -- Temp (Y) := (...);
3052 -- Obj_Rec_Typ.Obj_Arr_Typ := Temp;
3054 if Ekind (Comp_Type) = E_Array_Subtype
3055 and then Is_Int_Range_Bounds (Aggregate_Bounds (Expr_Q))
3056 and then Is_Int_Range_Bounds (First_Index (Comp_Type))
3058 Compatible_Int_Bounds
3059 (Agg_Bounds => Aggregate_Bounds (Expr_Q),
3060 Typ_Bounds => First_Index (Comp_Type))
3062 -- Create the array subtype with bounds equal to those of
3063 -- the corresponding aggregate.
3066 SubE : constant Entity_Id := Make_Temporary (Loc, 'T');
3068 SubD : constant Node_Id :=
3069 Make_Subtype_Declaration (Loc,
3070 Defining_Identifier => SubE,
3071 Subtype_Indication =>
3072 Make_Subtype_Indication (Loc,
3075 (Etype (Comp_Type), Loc),
3077 Make_Index_Or_Discriminant_Constraint
3079 Constraints => New_List (
3081 (Aggregate_Bounds (Expr_Q))))));
3083 -- Create a temporary array of the above subtype which
3084 -- will be used to capture the aggregate assignments.
3086 TmpE : constant Entity_Id := Make_Temporary (Loc, 'A', N);
3088 TmpD : constant Node_Id :=
3089 Make_Object_Declaration (Loc,
3090 Defining_Identifier => TmpE,
3091 Object_Definition =>
3092 New_Reference_To (SubE, Loc));
3095 Set_No_Initialization (TmpD);
3096 Append_To (L, SubD);
3097 Append_To (L, TmpD);
3099 -- Expand aggregate into assignments to the temp array
3102 Late_Expansion (Expr_Q, Comp_Type,
3103 New_Reference_To (TmpE, Loc), Internal_Final_List));
3108 Make_Assignment_Statement (Loc,
3109 Name => New_Copy_Tree (Comp_Expr),
3110 Expression => New_Reference_To (TmpE, Loc)));
3112 -- Do not pass the original aggregate to Gigi as is,
3113 -- since it will potentially clobber the front or the end
3114 -- of the array. Setting the expression to empty is safe
3115 -- since all aggregates are expanded into assignments.
3117 if Present (Obj) then
3118 Set_Expression (Parent (Obj), Empty);
3122 -- Normal case (sliding not required)
3126 Late_Expansion (Expr_Q, Comp_Type, Comp_Expr,
3127 Internal_Final_List));
3130 -- Expr_Q is not delayed aggregate
3133 if Has_Discriminants (Typ) then
3134 Replace_Discriminants (Expr_Q);
3138 Make_OK_Assignment_Statement (Loc,
3140 Expression => Expr_Q);
3142 Set_No_Ctrl_Actions (Instr);
3143 Append_To (L, Instr);
3145 -- Adjust the tag if tagged (because of possible view
3146 -- conversions), unless compiling for a VM where tags are
3149 -- tmp.comp._tag := comp_typ'tag;
3151 if Is_Tagged_Type (Comp_Type)
3152 and then Tagged_Type_Expansion
3155 Make_OK_Assignment_Statement (Loc,
3157 Make_Selected_Component (Loc,
3158 Prefix => New_Copy_Tree (Comp_Expr),
3161 (First_Tag_Component (Comp_Type), Loc)),
3164 Unchecked_Convert_To (RTE (RE_Tag),
3166 (Node (First_Elmt (Access_Disp_Table (Comp_Type))),
3169 Append_To (L, Instr);
3172 -- Adjust and Attach the component to the proper controller
3174 -- Adjust (tmp.comp);
3175 -- Attach_To_Final_List (tmp.comp,
3176 -- comp_typ (tmp)._record_controller.f)
3178 if Needs_Finalization (Comp_Type)
3179 and then not Is_Limited_Type (Comp_Type)
3183 Ref => New_Copy_Tree (Comp_Expr),
3185 Flist_Ref => Internal_Final_List,
3186 With_Attach => Make_Integer_Literal (Loc, 1)));
3192 elsif Ekind (Selector) = E_Discriminant
3193 and then Nkind (N) /= N_Extension_Aggregate
3194 and then Nkind (Parent (N)) = N_Component_Association
3195 and then Is_Constrained (Typ)
3197 -- We must check that the discriminant value imposed by the
3198 -- context is the same as the value given in the subaggregate,
3199 -- because after the expansion into assignments there is no
3200 -- record on which to perform a regular discriminant check.
3207 D_Val := First_Elmt (Discriminant_Constraint (Typ));
3208 Disc := First_Discriminant (Typ);
3209 while Chars (Disc) /= Chars (Selector) loop
3210 Next_Discriminant (Disc);
3214 pragma Assert (Present (D_Val));
3216 -- This check cannot performed for components that are
3217 -- constrained by a current instance, because this is not a
3218 -- value that can be compared with the actual constraint.
3220 if Nkind (Node (D_Val)) /= N_Attribute_Reference
3221 or else not Is_Entity_Name (Prefix (Node (D_Val)))
3222 or else not Is_Type (Entity (Prefix (Node (D_Val))))
3225 Make_Raise_Constraint_Error (Loc,
3228 Left_Opnd => New_Copy_Tree (Node (D_Val)),
3229 Right_Opnd => Expression (Comp)),
3230 Reason => CE_Discriminant_Check_Failed));
3233 -- Find self-reference in previous discriminant assignment,
3234 -- and replace with proper expression.
3241 while Present (Ass) loop
3242 if Nkind (Ass) = N_Assignment_Statement
3243 and then Nkind (Name (Ass)) = N_Selected_Component
3244 and then Chars (Selector_Name (Name (Ass))) =
3248 (Ass, New_Copy_Tree (Expression (Comp)));
3261 -- If the type is tagged, the tag needs to be initialized (unless
3262 -- compiling for the Java VM where tags are implicit). It is done
3263 -- late in the initialization process because in some cases, we call
3264 -- the init proc of an ancestor which will not leave out the right tag
3266 if Ancestor_Is_Expression then
3269 -- For CPP types we generated a call to the C++ default constructor
3270 -- before the components have been initialized to ensure the proper
3271 -- initialization of the _Tag component (see above).
3273 elsif Is_CPP_Class (Typ) then
3276 elsif Is_Tagged_Type (Typ) and then Tagged_Type_Expansion then
3278 Make_OK_Assignment_Statement (Loc,
3280 Make_Selected_Component (Loc,
3281 Prefix => New_Copy_Tree (Target),
3284 (First_Tag_Component (Base_Type (Typ)), Loc)),
3287 Unchecked_Convert_To (RTE (RE_Tag),
3289 (Node (First_Elmt (Access_Disp_Table (Base_Type (Typ)))),
3292 Append_To (L, Instr);
3294 -- Ada 2005 (AI-251): If the tagged type has been derived from
3295 -- abstract interfaces we must also initialize the tags of the
3296 -- secondary dispatch tables.
3298 if Has_Interfaces (Base_Type (Typ)) then
3300 (Typ => Base_Type (Typ),
3306 -- If the controllers have not been initialized yet (by lack of non-
3307 -- discriminant components), let's do it now.
3309 Gen_Ctrl_Actions_For_Aggr;
3312 end Build_Record_Aggr_Code;
3314 -------------------------------
3315 -- Convert_Aggr_In_Allocator --
3316 -------------------------------
3318 procedure Convert_Aggr_In_Allocator
3323 Loc : constant Source_Ptr := Sloc (Aggr);
3324 Typ : constant Entity_Id := Etype (Aggr);
3325 Temp : constant Entity_Id := Defining_Identifier (Decl);
3327 Occ : constant Node_Id :=
3328 Unchecked_Convert_To (Typ,
3329 Make_Explicit_Dereference (Loc,
3330 New_Reference_To (Temp, Loc)));
3332 Access_Type : constant Entity_Id := Etype (Temp);
3336 -- If the allocator is for an access discriminant, there is no
3337 -- finalization list for the anonymous access type, and the eventual
3338 -- finalization of the object is handled through the coextension
3339 -- mechanism. If the enclosing object is not dynamically allocated,
3340 -- the access discriminant is itself placed on the stack. Otherwise,
3341 -- some other finalization list is used (see exp_ch4.adb).
3343 -- Decl has been inserted in the code ahead of the allocator, using
3344 -- Insert_Actions. We use Insert_Actions below as well, to ensure that
3345 -- subsequent insertions are done in the proper order. Using (for
3346 -- example) Insert_Actions_After to place the expanded aggregate
3347 -- immediately after Decl may lead to out-of-order references if the
3348 -- allocator has generated a finalization list, as when the designated
3349 -- object is controlled and there is an open transient scope.
3351 if Ekind (Access_Type) = E_Anonymous_Access_Type
3352 and then Nkind (Associated_Node_For_Itype (Access_Type)) =
3353 N_Discriminant_Specification
3357 elsif Needs_Finalization (Typ) then
3358 Flist := Find_Final_List (Access_Type);
3360 -- Otherwise there are no controlled actions to be performed.
3366 if Is_Array_Type (Typ) then
3367 Convert_Array_Aggr_In_Allocator (Decl, Aggr, Occ);
3369 elsif Has_Default_Init_Comps (Aggr) then
3371 L : constant List_Id := New_List;
3372 Init_Stmts : List_Id;
3379 Associated_Final_Chain (Base_Type (Access_Type)));
3381 -- ??? Dubious actual for Obj: expect 'the original object being
3384 if Has_Task (Typ) then
3385 Build_Task_Allocate_Block_With_Init_Stmts (L, Aggr, Init_Stmts);
3386 Insert_Actions (Alloc, L);
3388 Insert_Actions (Alloc, Init_Stmts);
3393 Insert_Actions (Alloc,
3395 (Aggr, Typ, Occ, Flist,
3396 Associated_Final_Chain (Base_Type (Access_Type))));
3398 -- ??? Dubious actual for Obj: expect 'the original object being
3402 end Convert_Aggr_In_Allocator;
3404 --------------------------------
3405 -- Convert_Aggr_In_Assignment --
3406 --------------------------------
3408 procedure Convert_Aggr_In_Assignment (N : Node_Id) is
3409 Aggr : Node_Id := Expression (N);
3410 Typ : constant Entity_Id := Etype (Aggr);
3411 Occ : constant Node_Id := New_Copy_Tree (Name (N));
3414 if Nkind (Aggr) = N_Qualified_Expression then
3415 Aggr := Expression (Aggr);
3418 Insert_Actions_After (N,
3421 Find_Final_List (Typ, New_Copy_Tree (Occ))));
3422 end Convert_Aggr_In_Assignment;
3424 ---------------------------------
3425 -- Convert_Aggr_In_Object_Decl --
3426 ---------------------------------
3428 procedure Convert_Aggr_In_Object_Decl (N : Node_Id) is
3429 Obj : constant Entity_Id := Defining_Identifier (N);
3430 Aggr : Node_Id := Expression (N);
3431 Loc : constant Source_Ptr := Sloc (Aggr);
3432 Typ : constant Entity_Id := Etype (Aggr);
3433 Occ : constant Node_Id := New_Occurrence_Of (Obj, Loc);
3435 function Discriminants_Ok return Boolean;
3436 -- If the object type is constrained, the discriminants in the
3437 -- aggregate must be checked against the discriminants of the subtype.
3438 -- This cannot be done using Apply_Discriminant_Checks because after
3439 -- expansion there is no aggregate left to check.
3441 ----------------------
3442 -- Discriminants_Ok --
3443 ----------------------
3445 function Discriminants_Ok return Boolean is
3446 Cond : Node_Id := Empty;
3455 D := First_Discriminant (Typ);
3456 Disc1 := First_Elmt (Discriminant_Constraint (Typ));
3457 Disc2 := First_Elmt (Discriminant_Constraint (Etype (Obj)));
3458 while Present (Disc1) and then Present (Disc2) loop
3459 Val1 := Node (Disc1);
3460 Val2 := Node (Disc2);
3462 if not Is_OK_Static_Expression (Val1)
3463 or else not Is_OK_Static_Expression (Val2)
3465 Check := Make_Op_Ne (Loc,
3466 Left_Opnd => Duplicate_Subexpr (Val1),
3467 Right_Opnd => Duplicate_Subexpr (Val2));
3473 Cond := Make_Or_Else (Loc,
3475 Right_Opnd => Check);
3478 elsif Expr_Value (Val1) /= Expr_Value (Val2) then
3479 Apply_Compile_Time_Constraint_Error (Aggr,
3480 Msg => "incorrect value for discriminant&?",
3481 Reason => CE_Discriminant_Check_Failed,
3486 Next_Discriminant (D);
3491 -- If any discriminant constraint is non-static, emit a check
3493 if Present (Cond) then
3495 Make_Raise_Constraint_Error (Loc,
3497 Reason => CE_Discriminant_Check_Failed));
3501 end Discriminants_Ok;
3503 -- Start of processing for Convert_Aggr_In_Object_Decl
3506 Set_Assignment_OK (Occ);
3508 if Nkind (Aggr) = N_Qualified_Expression then
3509 Aggr := Expression (Aggr);
3512 if Has_Discriminants (Typ)
3513 and then Typ /= Etype (Obj)
3514 and then Is_Constrained (Etype (Obj))
3515 and then not Discriminants_Ok
3520 -- If the context is an extended return statement, it has its own
3521 -- finalization machinery (i.e. works like a transient scope) and
3522 -- we do not want to create an additional one, because objects on
3523 -- the finalization list of the return must be moved to the caller's
3524 -- finalization list to complete the return.
3526 -- However, if the aggregate is limited, it is built in place, and the
3527 -- controlled components are not assigned to intermediate temporaries
3528 -- so there is no need for a transient scope in this case either.
3530 if Requires_Transient_Scope (Typ)
3531 and then Ekind (Current_Scope) /= E_Return_Statement
3532 and then not Is_Limited_Type (Typ)
3534 Establish_Transient_Scope
3537 Is_Controlled (Typ) or else Has_Controlled_Component (Typ));
3540 Insert_Actions_After (N, Late_Expansion (Aggr, Typ, Occ, Obj => Obj));
3541 Set_No_Initialization (N);
3542 Initialize_Discriminants (N, Typ);
3543 end Convert_Aggr_In_Object_Decl;
3545 -------------------------------------
3546 -- Convert_Array_Aggr_In_Allocator --
3547 -------------------------------------
3549 procedure Convert_Array_Aggr_In_Allocator
3554 Aggr_Code : List_Id;
3555 Typ : constant Entity_Id := Etype (Aggr);
3556 Ctyp : constant Entity_Id := Component_Type (Typ);
3559 -- The target is an explicit dereference of the allocated object.
3560 -- Generate component assignments to it, as for an aggregate that
3561 -- appears on the right-hand side of an assignment statement.
3564 Build_Array_Aggr_Code (Aggr,
3566 Index => First_Index (Typ),
3568 Scalar_Comp => Is_Scalar_Type (Ctyp));
3570 Insert_Actions_After (Decl, Aggr_Code);
3571 end Convert_Array_Aggr_In_Allocator;
3573 ----------------------------
3574 -- Convert_To_Assignments --
3575 ----------------------------
3577 procedure Convert_To_Assignments (N : Node_Id; Typ : Entity_Id) is
3578 Loc : constant Source_Ptr := Sloc (N);
3583 Target_Expr : Node_Id;
3584 Parent_Kind : Node_Kind;
3585 Unc_Decl : Boolean := False;
3586 Parent_Node : Node_Id;
3589 pragma Assert (not Is_Static_Dispatch_Table_Aggregate (N));
3590 pragma Assert (Is_Record_Type (Typ));
3592 Parent_Node := Parent (N);
3593 Parent_Kind := Nkind (Parent_Node);
3595 if Parent_Kind = N_Qualified_Expression then
3597 -- Check if we are in a unconstrained declaration because in this
3598 -- case the current delayed expansion mechanism doesn't work when
3599 -- the declared object size depend on the initializing expr.
3602 Parent_Node := Parent (Parent_Node);
3603 Parent_Kind := Nkind (Parent_Node);
3605 if Parent_Kind = N_Object_Declaration then
3607 not Is_Entity_Name (Object_Definition (Parent_Node))
3608 or else Has_Discriminants
3609 (Entity (Object_Definition (Parent_Node)))
3610 or else Is_Class_Wide_Type
3611 (Entity (Object_Definition (Parent_Node)));
3616 -- Just set the Delay flag in the cases where the transformation will be
3617 -- done top down from above.
3621 -- Internal aggregate (transformed when expanding the parent)
3623 or else Parent_Kind = N_Aggregate
3624 or else Parent_Kind = N_Extension_Aggregate
3625 or else Parent_Kind = N_Component_Association
3627 -- Allocator (see Convert_Aggr_In_Allocator)
3629 or else Parent_Kind = N_Allocator
3631 -- Object declaration (see Convert_Aggr_In_Object_Decl)
3633 or else (Parent_Kind = N_Object_Declaration and then not Unc_Decl)
3635 -- Safe assignment (see Convert_Aggr_Assignments). So far only the
3636 -- assignments in init procs are taken into account.
3638 or else (Parent_Kind = N_Assignment_Statement
3639 and then Inside_Init_Proc)
3641 -- (Ada 2005) An inherently limited type in a return statement,
3642 -- which will be handled in a build-in-place fashion, and may be
3643 -- rewritten as an extended return and have its own finalization
3644 -- machinery. In the case of a simple return, the aggregate needs
3645 -- to be delayed until the scope for the return statement has been
3646 -- created, so that any finalization chain will be associated with
3647 -- that scope. For extended returns, we delay expansion to avoid the
3648 -- creation of an unwanted transient scope that could result in
3649 -- premature finalization of the return object (which is built in
3650 -- in place within the caller's scope).
3653 (Is_Immutably_Limited_Type (Typ)
3655 (Nkind (Parent (Parent_Node)) = N_Extended_Return_Statement
3656 or else Nkind (Parent_Node) = N_Simple_Return_Statement))
3658 Set_Expansion_Delayed (N);
3662 if Requires_Transient_Scope (Typ) then
3663 Establish_Transient_Scope
3665 Is_Controlled (Typ) or else Has_Controlled_Component (Typ));
3668 -- If the aggregate is non-limited, create a temporary. If it is limited
3669 -- and the context is an assignment, this is a subaggregate for an
3670 -- enclosing aggregate being expanded. It must be built in place, so use
3671 -- the target of the current assignment.
3673 if Is_Limited_Type (Typ)
3674 and then Nkind (Parent (N)) = N_Assignment_Statement
3676 Target_Expr := New_Copy_Tree (Name (Parent (N)));
3678 (Parent (N), Build_Record_Aggr_Code (N, Typ, Target_Expr));
3679 Rewrite (Parent (N), Make_Null_Statement (Loc));
3682 Temp := Make_Temporary (Loc, 'A', N);
3684 -- If the type inherits unknown discriminants, use the view with
3685 -- known discriminants if available.
3687 if Has_Unknown_Discriminants (Typ)
3688 and then Present (Underlying_Record_View (Typ))
3690 T := Underlying_Record_View (Typ);
3696 Make_Object_Declaration (Loc,
3697 Defining_Identifier => Temp,
3698 Object_Definition => New_Occurrence_Of (T, Loc));
3700 Set_No_Initialization (Instr);
3701 Insert_Action (N, Instr);
3702 Initialize_Discriminants (Instr, T);
3703 Target_Expr := New_Occurrence_Of (Temp, Loc);
3704 Insert_Actions (N, Build_Record_Aggr_Code (N, T, Target_Expr));
3705 Rewrite (N, New_Occurrence_Of (Temp, Loc));
3706 Analyze_And_Resolve (N, T);
3708 end Convert_To_Assignments;
3710 ---------------------------
3711 -- Convert_To_Positional --
3712 ---------------------------
3714 procedure Convert_To_Positional
3716 Max_Others_Replicate : Nat := 5;
3717 Handle_Bit_Packed : Boolean := False)
3719 Typ : constant Entity_Id := Etype (N);
3721 Static_Components : Boolean := True;
3723 procedure Check_Static_Components;
3724 -- Check whether all components of the aggregate are compile-time known
3725 -- values, and can be passed as is to the back-end without further
3731 Ixb : Node_Id) return Boolean;
3732 -- Convert the aggregate into a purely positional form if possible. On
3733 -- entry the bounds of all dimensions are known to be static, and the
3734 -- total number of components is safe enough to expand.
3736 function Is_Flat (N : Node_Id; Dims : Int) return Boolean;
3737 -- Return True iff the array N is flat (which is not trivial in the case
3738 -- of multidimensional aggregates).
3740 -----------------------------
3741 -- Check_Static_Components --
3742 -----------------------------
3744 procedure Check_Static_Components is
3748 Static_Components := True;
3750 if Nkind (N) = N_String_Literal then
3753 elsif Present (Expressions (N)) then
3754 Expr := First (Expressions (N));
3755 while Present (Expr) loop
3756 if Nkind (Expr) /= N_Aggregate
3757 or else not Compile_Time_Known_Aggregate (Expr)
3758 or else Expansion_Delayed (Expr)
3760 Static_Components := False;
3768 if Nkind (N) = N_Aggregate
3769 and then Present (Component_Associations (N))
3771 Expr := First (Component_Associations (N));
3772 while Present (Expr) loop
3773 if Nkind_In (Expression (Expr), N_Integer_Literal,
3778 elsif Is_Entity_Name (Expression (Expr))
3779 and then Present (Entity (Expression (Expr)))
3780 and then Ekind (Entity (Expression (Expr))) =
3781 E_Enumeration_Literal
3785 elsif Nkind (Expression (Expr)) /= N_Aggregate
3786 or else not Compile_Time_Known_Aggregate (Expression (Expr))
3787 or else Expansion_Delayed (Expression (Expr))
3789 Static_Components := False;
3796 end Check_Static_Components;
3805 Ixb : Node_Id) return Boolean
3807 Loc : constant Source_Ptr := Sloc (N);
3808 Blo : constant Node_Id := Type_Low_Bound (Etype (Ixb));
3809 Lo : constant Node_Id := Type_Low_Bound (Etype (Ix));
3810 Hi : constant Node_Id := Type_High_Bound (Etype (Ix));
3815 if Nkind (Original_Node (N)) = N_String_Literal then
3819 if not Compile_Time_Known_Value (Lo)
3820 or else not Compile_Time_Known_Value (Hi)
3825 Lov := Expr_Value (Lo);
3826 Hiv := Expr_Value (Hi);
3829 or else not Compile_Time_Known_Value (Blo)
3834 -- Determine if set of alternatives is suitable for conversion and
3835 -- build an array containing the values in sequence.
3838 Vals : array (UI_To_Int (Lov) .. UI_To_Int (Hiv))
3839 of Node_Id := (others => Empty);
3840 -- The values in the aggregate sorted appropriately
3843 -- Same data as Vals in list form
3846 -- Used to validate Max_Others_Replicate limit
3849 Num : Int := UI_To_Int (Lov);
3855 if Present (Expressions (N)) then
3856 Elmt := First (Expressions (N));
3857 while Present (Elmt) loop
3858 if Nkind (Elmt) = N_Aggregate
3859 and then Present (Next_Index (Ix))
3861 not Flatten (Elmt, Next_Index (Ix), Next_Index (Ixb))
3866 Vals (Num) := Relocate_Node (Elmt);
3873 if No (Component_Associations (N)) then
3877 Elmt := First (Component_Associations (N));
3879 if Nkind (Expression (Elmt)) = N_Aggregate then
3880 if Present (Next_Index (Ix))
3883 (Expression (Elmt), Next_Index (Ix), Next_Index (Ixb))
3889 Component_Loop : while Present (Elmt) loop
3890 Choice := First (Choices (Elmt));
3891 Choice_Loop : while Present (Choice) loop
3893 -- If we have an others choice, fill in the missing elements
3894 -- subject to the limit established by Max_Others_Replicate.
3896 if Nkind (Choice) = N_Others_Choice then
3899 for J in Vals'Range loop
3900 if No (Vals (J)) then
3901 Vals (J) := New_Copy_Tree (Expression (Elmt));
3902 Rep_Count := Rep_Count + 1;
3904 -- Check for maximum others replication. Note that
3905 -- we skip this test if either of the restrictions
3906 -- No_Elaboration_Code or No_Implicit_Loops is
3907 -- active, if this is a preelaborable unit or a
3908 -- predefined unit. This ensures that predefined
3909 -- units get the same level of constant folding in
3910 -- Ada 95 and Ada 05, where their categorization
3914 P : constant Entity_Id :=
3915 Cunit_Entity (Current_Sem_Unit);
3918 -- Check if duplication OK and if so continue
3921 if Restriction_Active (No_Elaboration_Code)
3922 or else Restriction_Active (No_Implicit_Loops)
3923 or else Is_Preelaborated (P)
3924 or else (Ekind (P) = E_Package_Body
3926 Is_Preelaborated (Spec_Entity (P)))
3928 Is_Predefined_File_Name
3929 (Unit_File_Name (Get_Source_Unit (P)))
3933 -- If duplication not OK, then we return False
3934 -- if the replication count is too high
3936 elsif Rep_Count > Max_Others_Replicate then
3939 -- Continue on if duplication not OK, but the
3940 -- replication count is not excessive.
3949 exit Component_Loop;
3951 -- Case of a subtype mark, identifier or expanded name
3953 elsif Is_Entity_Name (Choice)
3954 and then Is_Type (Entity (Choice))
3956 Lo := Type_Low_Bound (Etype (Choice));
3957 Hi := Type_High_Bound (Etype (Choice));
3959 -- Case of subtype indication
3961 elsif Nkind (Choice) = N_Subtype_Indication then
3962 Lo := Low_Bound (Range_Expression (Constraint (Choice)));
3963 Hi := High_Bound (Range_Expression (Constraint (Choice)));
3967 elsif Nkind (Choice) = N_Range then
3968 Lo := Low_Bound (Choice);
3969 Hi := High_Bound (Choice);
3971 -- Normal subexpression case
3973 else pragma Assert (Nkind (Choice) in N_Subexpr);
3974 if not Compile_Time_Known_Value (Choice) then
3978 Choice_Index := UI_To_Int (Expr_Value (Choice));
3979 if Choice_Index in Vals'Range then
3980 Vals (Choice_Index) :=
3981 New_Copy_Tree (Expression (Elmt));
3985 -- Choice is statically out-of-range, will be
3986 -- rewritten to raise Constraint_Error.
3993 -- Range cases merge with Lo,Hi set
3995 if not Compile_Time_Known_Value (Lo)
3997 not Compile_Time_Known_Value (Hi)
4001 for J in UI_To_Int (Expr_Value (Lo)) ..
4002 UI_To_Int (Expr_Value (Hi))
4004 Vals (J) := New_Copy_Tree (Expression (Elmt));
4010 end loop Choice_Loop;
4013 end loop Component_Loop;
4015 -- If we get here the conversion is possible
4018 for J in Vals'Range loop
4019 Append (Vals (J), Vlist);
4022 Rewrite (N, Make_Aggregate (Loc, Expressions => Vlist));
4023 Set_Aggregate_Bounds (N, Aggregate_Bounds (Original_Node (N)));
4032 function Is_Flat (N : Node_Id; Dims : Int) return Boolean is
4039 elsif Nkind (N) = N_Aggregate then
4040 if Present (Component_Associations (N)) then
4044 Elmt := First (Expressions (N));
4045 while Present (Elmt) loop
4046 if not Is_Flat (Elmt, Dims - 1) then
4060 -- Start of processing for Convert_To_Positional
4063 -- Ada 2005 (AI-287): Do not convert in case of default initialized
4064 -- components because in this case will need to call the corresponding
4067 if Has_Default_Init_Comps (N) then
4071 if Is_Flat (N, Number_Dimensions (Typ)) then
4075 if Is_Bit_Packed_Array (Typ)
4076 and then not Handle_Bit_Packed
4081 -- Do not convert to positional if controlled components are involved
4082 -- since these require special processing
4084 if Has_Controlled_Component (Typ) then
4088 Check_Static_Components;
4090 -- If the size is known, or all the components are static, try to
4091 -- build a fully positional aggregate.
4093 -- The size of the type may not be known for an aggregate with
4094 -- discriminated array components, but if the components are static
4095 -- it is still possible to verify statically that the length is
4096 -- compatible with the upper bound of the type, and therefore it is
4097 -- worth flattening such aggregates as well.
4099 -- For now the back-end expands these aggregates into individual
4100 -- assignments to the target anyway, but it is conceivable that
4101 -- it will eventually be able to treat such aggregates statically???
4103 if Aggr_Size_OK (N, Typ)
4104 and then Flatten (N, First_Index (Typ), First_Index (Base_Type (Typ)))
4106 if Static_Components then
4107 Set_Compile_Time_Known_Aggregate (N);
4108 Set_Expansion_Delayed (N, False);
4111 Analyze_And_Resolve (N, Typ);
4113 end Convert_To_Positional;
4115 ----------------------------
4116 -- Expand_Array_Aggregate --
4117 ----------------------------
4119 -- Array aggregate expansion proceeds as follows:
4121 -- 1. If requested we generate code to perform all the array aggregate
4122 -- bound checks, specifically
4124 -- (a) Check that the index range defined by aggregate bounds is
4125 -- compatible with corresponding index subtype.
4127 -- (b) If an others choice is present check that no aggregate
4128 -- index is outside the bounds of the index constraint.
4130 -- (c) For multidimensional arrays make sure that all subaggregates
4131 -- corresponding to the same dimension have the same bounds.
4133 -- 2. Check for packed array aggregate which can be converted to a
4134 -- constant so that the aggregate disappeares completely.
4136 -- 3. Check case of nested aggregate. Generally nested aggregates are
4137 -- handled during the processing of the parent aggregate.
4139 -- 4. Check if the aggregate can be statically processed. If this is the
4140 -- case pass it as is to Gigi. Note that a necessary condition for
4141 -- static processing is that the aggregate be fully positional.
4143 -- 5. If in place aggregate expansion is possible (i.e. no need to create
4144 -- a temporary) then mark the aggregate as such and return. Otherwise
4145 -- create a new temporary and generate the appropriate initialization
4148 procedure Expand_Array_Aggregate (N : Node_Id) is
4149 Loc : constant Source_Ptr := Sloc (N);
4151 Typ : constant Entity_Id := Etype (N);
4152 Ctyp : constant Entity_Id := Component_Type (Typ);
4153 -- Typ is the correct constrained array subtype of the aggregate
4154 -- Ctyp is the corresponding component type.
4156 Aggr_Dimension : constant Pos := Number_Dimensions (Typ);
4157 -- Number of aggregate index dimensions
4159 Aggr_Low : array (1 .. Aggr_Dimension) of Node_Id;
4160 Aggr_High : array (1 .. Aggr_Dimension) of Node_Id;
4161 -- Low and High bounds of the constraint for each aggregate index
4163 Aggr_Index_Typ : array (1 .. Aggr_Dimension) of Entity_Id;
4164 -- The type of each index
4166 Maybe_In_Place_OK : Boolean;
4167 -- If the type is neither controlled nor packed and the aggregate
4168 -- is the expression in an assignment, assignment in place may be
4169 -- possible, provided other conditions are met on the LHS.
4171 Others_Present : array (1 .. Aggr_Dimension) of Boolean :=
4173 -- If Others_Present (J) is True, then there is an others choice
4174 -- in one of the sub-aggregates of N at dimension J.
4176 procedure Build_Constrained_Type (Positional : Boolean);
4177 -- If the subtype is not static or unconstrained, build a constrained
4178 -- type using the computable sizes of the aggregate and its sub-
4181 procedure Check_Bounds (Aggr_Bounds : Node_Id; Index_Bounds : Node_Id);
4182 -- Checks that the bounds of Aggr_Bounds are within the bounds defined
4185 procedure Check_Same_Aggr_Bounds (Sub_Aggr : Node_Id; Dim : Pos);
4186 -- Checks that in a multi-dimensional array aggregate all subaggregates
4187 -- corresponding to the same dimension have the same bounds.
4188 -- Sub_Aggr is an array sub-aggregate. Dim is the dimension
4189 -- corresponding to the sub-aggregate.
4191 procedure Compute_Others_Present (Sub_Aggr : Node_Id; Dim : Pos);
4192 -- Computes the values of array Others_Present. Sub_Aggr is the
4193 -- array sub-aggregate we start the computation from. Dim is the
4194 -- dimension corresponding to the sub-aggregate.
4196 function In_Place_Assign_OK return Boolean;
4197 -- Simple predicate to determine whether an aggregate assignment can
4198 -- be done in place, because none of the new values can depend on the
4199 -- components of the target of the assignment.
4201 procedure Others_Check (Sub_Aggr : Node_Id; Dim : Pos);
4202 -- Checks that if an others choice is present in any sub-aggregate no
4203 -- aggregate index is outside the bounds of the index constraint.
4204 -- Sub_Aggr is an array sub-aggregate. Dim is the dimension
4205 -- corresponding to the sub-aggregate.
4207 function Safe_Left_Hand_Side (N : Node_Id) return Boolean;
4208 -- In addition to Maybe_In_Place_OK, in order for an aggregate to be
4209 -- built directly into the target of the assignment it must be free
4212 ----------------------------
4213 -- Build_Constrained_Type --
4214 ----------------------------
4216 procedure Build_Constrained_Type (Positional : Boolean) is
4217 Loc : constant Source_Ptr := Sloc (N);
4218 Agg_Type : constant Entity_Id := Make_Temporary (Loc, 'A');
4221 Typ : constant Entity_Id := Etype (N);
4222 Indexes : constant List_Id := New_List;
4227 -- If the aggregate is purely positional, all its subaggregates
4228 -- have the same size. We collect the dimensions from the first
4229 -- subaggregate at each level.
4234 for D in 1 .. Number_Dimensions (Typ) loop
4235 Sub_Agg := First (Expressions (Sub_Agg));
4239 while Present (Comp) loop
4246 Low_Bound => Make_Integer_Literal (Loc, 1),
4247 High_Bound => Make_Integer_Literal (Loc, Num)));
4251 -- We know the aggregate type is unconstrained and the aggregate
4252 -- is not processable by the back end, therefore not necessarily
4253 -- positional. Retrieve each dimension bounds (computed earlier).
4255 for D in 1 .. Number_Dimensions (Typ) loop
4258 Low_Bound => Aggr_Low (D),
4259 High_Bound => Aggr_High (D)),
4265 Make_Full_Type_Declaration (Loc,
4266 Defining_Identifier => Agg_Type,
4268 Make_Constrained_Array_Definition (Loc,
4269 Discrete_Subtype_Definitions => Indexes,
4270 Component_Definition =>
4271 Make_Component_Definition (Loc,
4272 Aliased_Present => False,
4273 Subtype_Indication =>
4274 New_Occurrence_Of (Component_Type (Typ), Loc))));
4276 Insert_Action (N, Decl);
4278 Set_Etype (N, Agg_Type);
4279 Set_Is_Itype (Agg_Type);
4280 Freeze_Itype (Agg_Type, N);
4281 end Build_Constrained_Type;
4287 procedure Check_Bounds (Aggr_Bounds : Node_Id; Index_Bounds : Node_Id) is
4294 Cond : Node_Id := Empty;
4297 Get_Index_Bounds (Aggr_Bounds, Aggr_Lo, Aggr_Hi);
4298 Get_Index_Bounds (Index_Bounds, Ind_Lo, Ind_Hi);
4300 -- Generate the following test:
4302 -- [constraint_error when
4303 -- Aggr_Lo <= Aggr_Hi and then
4304 -- (Aggr_Lo < Ind_Lo or else Aggr_Hi > Ind_Hi)]
4306 -- As an optimization try to see if some tests are trivially vacuous
4307 -- because we are comparing an expression against itself.
4309 if Aggr_Lo = Ind_Lo and then Aggr_Hi = Ind_Hi then
4312 elsif Aggr_Hi = Ind_Hi then
4315 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4316 Right_Opnd => Duplicate_Subexpr_Move_Checks (Ind_Lo));
4318 elsif Aggr_Lo = Ind_Lo then
4321 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Hi),
4322 Right_Opnd => Duplicate_Subexpr_Move_Checks (Ind_Hi));
4329 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4330 Right_Opnd => Duplicate_Subexpr_Move_Checks (Ind_Lo)),
4334 Left_Opnd => Duplicate_Subexpr (Aggr_Hi),
4335 Right_Opnd => Duplicate_Subexpr (Ind_Hi)));
4338 if Present (Cond) then
4343 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4344 Right_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Hi)),
4346 Right_Opnd => Cond);
4348 Set_Analyzed (Left_Opnd (Left_Opnd (Cond)), False);
4349 Set_Analyzed (Right_Opnd (Left_Opnd (Cond)), False);
4351 Make_Raise_Constraint_Error (Loc,
4353 Reason => CE_Length_Check_Failed));
4357 ----------------------------
4358 -- Check_Same_Aggr_Bounds --
4359 ----------------------------
4361 procedure Check_Same_Aggr_Bounds (Sub_Aggr : Node_Id; Dim : Pos) is
4362 Sub_Lo : constant Node_Id := Low_Bound (Aggregate_Bounds (Sub_Aggr));
4363 Sub_Hi : constant Node_Id := High_Bound (Aggregate_Bounds (Sub_Aggr));
4364 -- The bounds of this specific sub-aggregate
4366 Aggr_Lo : constant Node_Id := Aggr_Low (Dim);
4367 Aggr_Hi : constant Node_Id := Aggr_High (Dim);
4368 -- The bounds of the aggregate for this dimension
4370 Ind_Typ : constant Entity_Id := Aggr_Index_Typ (Dim);
4371 -- The index type for this dimension.xxx
4373 Cond : Node_Id := Empty;
4378 -- If index checks are on generate the test
4380 -- [constraint_error when
4381 -- Aggr_Lo /= Sub_Lo or else Aggr_Hi /= Sub_Hi]
4383 -- As an optimization try to see if some tests are trivially vacuos
4384 -- because we are comparing an expression against itself. Also for
4385 -- the first dimension the test is trivially vacuous because there
4386 -- is just one aggregate for dimension 1.
4388 if Index_Checks_Suppressed (Ind_Typ) then
4392 or else (Aggr_Lo = Sub_Lo and then Aggr_Hi = Sub_Hi)
4396 elsif Aggr_Hi = Sub_Hi then
4399 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4400 Right_Opnd => Duplicate_Subexpr_Move_Checks (Sub_Lo));
4402 elsif Aggr_Lo = Sub_Lo then
4405 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Hi),
4406 Right_Opnd => Duplicate_Subexpr_Move_Checks (Sub_Hi));
4413 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4414 Right_Opnd => Duplicate_Subexpr_Move_Checks (Sub_Lo)),
4418 Left_Opnd => Duplicate_Subexpr (Aggr_Hi),
4419 Right_Opnd => Duplicate_Subexpr (Sub_Hi)));
4422 if Present (Cond) then
4424 Make_Raise_Constraint_Error (Loc,
4426 Reason => CE_Length_Check_Failed));
4429 -- Now look inside the sub-aggregate to see if there is more work
4431 if Dim < Aggr_Dimension then
4433 -- Process positional components
4435 if Present (Expressions (Sub_Aggr)) then
4436 Expr := First (Expressions (Sub_Aggr));
4437 while Present (Expr) loop
4438 Check_Same_Aggr_Bounds (Expr, Dim + 1);
4443 -- Process component associations
4445 if Present (Component_Associations (Sub_Aggr)) then
4446 Assoc := First (Component_Associations (Sub_Aggr));
4447 while Present (Assoc) loop
4448 Expr := Expression (Assoc);
4449 Check_Same_Aggr_Bounds (Expr, Dim + 1);
4454 end Check_Same_Aggr_Bounds;
4456 ----------------------------
4457 -- Compute_Others_Present --
4458 ----------------------------
4460 procedure Compute_Others_Present (Sub_Aggr : Node_Id; Dim : Pos) is
4465 if Present (Component_Associations (Sub_Aggr)) then
4466 Assoc := Last (Component_Associations (Sub_Aggr));
4468 if Nkind (First (Choices (Assoc))) = N_Others_Choice then
4469 Others_Present (Dim) := True;
4473 -- Now look inside the sub-aggregate to see if there is more work
4475 if Dim < Aggr_Dimension then
4477 -- Process positional components
4479 if Present (Expressions (Sub_Aggr)) then
4480 Expr := First (Expressions (Sub_Aggr));
4481 while Present (Expr) loop
4482 Compute_Others_Present (Expr, Dim + 1);
4487 -- Process component associations
4489 if Present (Component_Associations (Sub_Aggr)) then
4490 Assoc := First (Component_Associations (Sub_Aggr));
4491 while Present (Assoc) loop
4492 Expr := Expression (Assoc);
4493 Compute_Others_Present (Expr, Dim + 1);
4498 end Compute_Others_Present;
4500 ------------------------
4501 -- In_Place_Assign_OK --
4502 ------------------------
4504 function In_Place_Assign_OK return Boolean is
4512 function Safe_Aggregate (Aggr : Node_Id) return Boolean;
4513 -- Check recursively that each component of a (sub)aggregate does
4514 -- not depend on the variable being assigned to.
4516 function Safe_Component (Expr : Node_Id) return Boolean;
4517 -- Verify that an expression cannot depend on the variable being
4518 -- assigned to. Room for improvement here (but less than before).
4520 --------------------
4521 -- Safe_Aggregate --
4522 --------------------
4524 function Safe_Aggregate (Aggr : Node_Id) return Boolean is
4528 if Present (Expressions (Aggr)) then
4529 Expr := First (Expressions (Aggr));
4530 while Present (Expr) loop
4531 if Nkind (Expr) = N_Aggregate then
4532 if not Safe_Aggregate (Expr) then
4536 elsif not Safe_Component (Expr) then
4544 if Present (Component_Associations (Aggr)) then
4545 Expr := First (Component_Associations (Aggr));
4546 while Present (Expr) loop
4547 if Nkind (Expression (Expr)) = N_Aggregate then
4548 if not Safe_Aggregate (Expression (Expr)) then
4552 elsif not Safe_Component (Expression (Expr)) then
4563 --------------------
4564 -- Safe_Component --
4565 --------------------
4567 function Safe_Component (Expr : Node_Id) return Boolean is
4568 Comp : Node_Id := Expr;
4570 function Check_Component (Comp : Node_Id) return Boolean;
4571 -- Do the recursive traversal, after copy
4573 ---------------------
4574 -- Check_Component --
4575 ---------------------
4577 function Check_Component (Comp : Node_Id) return Boolean is
4579 if Is_Overloaded (Comp) then
4583 return Compile_Time_Known_Value (Comp)
4585 or else (Is_Entity_Name (Comp)
4586 and then Present (Entity (Comp))
4587 and then No (Renamed_Object (Entity (Comp))))
4589 or else (Nkind (Comp) = N_Attribute_Reference
4590 and then Check_Component (Prefix (Comp)))
4592 or else (Nkind (Comp) in N_Binary_Op
4593 and then Check_Component (Left_Opnd (Comp))
4594 and then Check_Component (Right_Opnd (Comp)))
4596 or else (Nkind (Comp) in N_Unary_Op
4597 and then Check_Component (Right_Opnd (Comp)))
4599 or else (Nkind (Comp) = N_Selected_Component
4600 and then Check_Component (Prefix (Comp)))
4602 or else (Nkind (Comp) = N_Unchecked_Type_Conversion
4603 and then Check_Component (Expression (Comp)));
4604 end Check_Component;
4606 -- Start of processing for Safe_Component
4609 -- If the component appears in an association that may
4610 -- correspond to more than one element, it is not analyzed
4611 -- before the expansion into assignments, to avoid side effects.
4612 -- We analyze, but do not resolve the copy, to obtain sufficient
4613 -- entity information for the checks that follow. If component is
4614 -- overloaded we assume an unsafe function call.
4616 if not Analyzed (Comp) then
4617 if Is_Overloaded (Expr) then
4620 elsif Nkind (Expr) = N_Aggregate
4621 and then not Is_Others_Aggregate (Expr)
4625 elsif Nkind (Expr) = N_Allocator then
4627 -- For now, too complex to analyze
4632 Comp := New_Copy_Tree (Expr);
4633 Set_Parent (Comp, Parent (Expr));
4637 if Nkind (Comp) = N_Aggregate then
4638 return Safe_Aggregate (Comp);
4640 return Check_Component (Comp);
4644 -- Start of processing for In_Place_Assign_OK
4647 if Present (Component_Associations (N)) then
4649 -- On assignment, sliding can take place, so we cannot do the
4650 -- assignment in place unless the bounds of the aggregate are
4651 -- statically equal to those of the target.
4653 -- If the aggregate is given by an others choice, the bounds
4654 -- are derived from the left-hand side, and the assignment is
4655 -- safe if the expression is.
4657 if Is_Others_Aggregate (N) then
4660 (Expression (First (Component_Associations (N))));
4663 Aggr_In := First_Index (Etype (N));
4665 if Nkind (Parent (N)) = N_Assignment_Statement then
4666 Obj_In := First_Index (Etype (Name (Parent (N))));
4669 -- Context is an allocator. Check bounds of aggregate
4670 -- against given type in qualified expression.
4672 pragma Assert (Nkind (Parent (Parent (N))) = N_Allocator);
4674 First_Index (Etype (Entity (Subtype_Mark (Parent (N)))));
4677 while Present (Aggr_In) loop
4678 Get_Index_Bounds (Aggr_In, Aggr_Lo, Aggr_Hi);
4679 Get_Index_Bounds (Obj_In, Obj_Lo, Obj_Hi);
4681 if not Compile_Time_Known_Value (Aggr_Lo)
4682 or else not Compile_Time_Known_Value (Aggr_Hi)
4683 or else not Compile_Time_Known_Value (Obj_Lo)
4684 or else not Compile_Time_Known_Value (Obj_Hi)
4685 or else Expr_Value (Aggr_Lo) /= Expr_Value (Obj_Lo)
4686 or else Expr_Value (Aggr_Hi) /= Expr_Value (Obj_Hi)
4691 Next_Index (Aggr_In);
4692 Next_Index (Obj_In);
4696 -- Now check the component values themselves
4698 return Safe_Aggregate (N);
4699 end In_Place_Assign_OK;
4705 procedure Others_Check (Sub_Aggr : Node_Id; Dim : Pos) is
4706 Aggr_Lo : constant Node_Id := Aggr_Low (Dim);
4707 Aggr_Hi : constant Node_Id := Aggr_High (Dim);
4708 -- The bounds of the aggregate for this dimension
4710 Ind_Typ : constant Entity_Id := Aggr_Index_Typ (Dim);
4711 -- The index type for this dimension
4713 Need_To_Check : Boolean := False;
4715 Choices_Lo : Node_Id := Empty;
4716 Choices_Hi : Node_Id := Empty;
4717 -- The lowest and highest discrete choices for a named sub-aggregate
4719 Nb_Choices : Int := -1;
4720 -- The number of discrete non-others choices in this sub-aggregate
4722 Nb_Elements : Uint := Uint_0;
4723 -- The number of elements in a positional aggregate
4725 Cond : Node_Id := Empty;
4732 -- Check if we have an others choice. If we do make sure that this
4733 -- sub-aggregate contains at least one element in addition to the
4736 if Range_Checks_Suppressed (Ind_Typ) then
4737 Need_To_Check := False;
4739 elsif Present (Expressions (Sub_Aggr))
4740 and then Present (Component_Associations (Sub_Aggr))
4742 Need_To_Check := True;
4744 elsif Present (Component_Associations (Sub_Aggr)) then
4745 Assoc := Last (Component_Associations (Sub_Aggr));
4747 if Nkind (First (Choices (Assoc))) /= N_Others_Choice then
4748 Need_To_Check := False;
4751 -- Count the number of discrete choices. Start with -1 because
4752 -- the others choice does not count.
4755 Assoc := First (Component_Associations (Sub_Aggr));
4756 while Present (Assoc) loop
4757 Choice := First (Choices (Assoc));
4758 while Present (Choice) loop
4759 Nb_Choices := Nb_Choices + 1;
4766 -- If there is only an others choice nothing to do
4768 Need_To_Check := (Nb_Choices > 0);
4772 Need_To_Check := False;
4775 -- If we are dealing with a positional sub-aggregate with an others
4776 -- choice then compute the number or positional elements.
4778 if Need_To_Check and then Present (Expressions (Sub_Aggr)) then
4779 Expr := First (Expressions (Sub_Aggr));
4780 Nb_Elements := Uint_0;
4781 while Present (Expr) loop
4782 Nb_Elements := Nb_Elements + 1;
4786 -- If the aggregate contains discrete choices and an others choice
4787 -- compute the smallest and largest discrete choice values.
4789 elsif Need_To_Check then
4790 Compute_Choices_Lo_And_Choices_Hi : declare
4792 Table : Case_Table_Type (1 .. Nb_Choices);
4793 -- Used to sort all the different choice values
4800 Assoc := First (Component_Associations (Sub_Aggr));
4801 while Present (Assoc) loop
4802 Choice := First (Choices (Assoc));
4803 while Present (Choice) loop
4804 if Nkind (Choice) = N_Others_Choice then
4808 Get_Index_Bounds (Choice, Low, High);
4809 Table (J).Choice_Lo := Low;
4810 Table (J).Choice_Hi := High;
4819 -- Sort the discrete choices
4821 Sort_Case_Table (Table);
4823 Choices_Lo := Table (1).Choice_Lo;
4824 Choices_Hi := Table (Nb_Choices).Choice_Hi;
4825 end Compute_Choices_Lo_And_Choices_Hi;
4828 -- If no others choice in this sub-aggregate, or the aggregate
4829 -- comprises only an others choice, nothing to do.
4831 if not Need_To_Check then
4834 -- If we are dealing with an aggregate containing an others choice
4835 -- and positional components, we generate the following test:
4837 -- if Ind_Typ'Pos (Aggr_Lo) + (Nb_Elements - 1) >
4838 -- Ind_Typ'Pos (Aggr_Hi)
4840 -- raise Constraint_Error;
4843 elsif Nb_Elements > Uint_0 then
4849 Make_Attribute_Reference (Loc,
4850 Prefix => New_Reference_To (Ind_Typ, Loc),
4851 Attribute_Name => Name_Pos,
4854 (Duplicate_Subexpr_Move_Checks (Aggr_Lo))),
4855 Right_Opnd => Make_Integer_Literal (Loc, Nb_Elements - 1)),
4858 Make_Attribute_Reference (Loc,
4859 Prefix => New_Reference_To (Ind_Typ, Loc),
4860 Attribute_Name => Name_Pos,
4861 Expressions => New_List (
4862 Duplicate_Subexpr_Move_Checks (Aggr_Hi))));
4864 -- If we are dealing with an aggregate containing an others choice
4865 -- and discrete choices we generate the following test:
4867 -- [constraint_error when
4868 -- Choices_Lo < Aggr_Lo or else Choices_Hi > Aggr_Hi];
4876 Duplicate_Subexpr_Move_Checks (Choices_Lo),
4878 Duplicate_Subexpr_Move_Checks (Aggr_Lo)),
4883 Duplicate_Subexpr (Choices_Hi),
4885 Duplicate_Subexpr (Aggr_Hi)));
4888 if Present (Cond) then
4890 Make_Raise_Constraint_Error (Loc,
4892 Reason => CE_Length_Check_Failed));
4893 -- Questionable reason code, shouldn't that be a
4894 -- CE_Range_Check_Failed ???
4897 -- Now look inside the sub-aggregate to see if there is more work
4899 if Dim < Aggr_Dimension then
4901 -- Process positional components
4903 if Present (Expressions (Sub_Aggr)) then
4904 Expr := First (Expressions (Sub_Aggr));
4905 while Present (Expr) loop
4906 Others_Check (Expr, Dim + 1);
4911 -- Process component associations
4913 if Present (Component_Associations (Sub_Aggr)) then
4914 Assoc := First (Component_Associations (Sub_Aggr));
4915 while Present (Assoc) loop
4916 Expr := Expression (Assoc);
4917 Others_Check (Expr, Dim + 1);
4924 -------------------------
4925 -- Safe_Left_Hand_Side --
4926 -------------------------
4928 function Safe_Left_Hand_Side (N : Node_Id) return Boolean is
4929 function Is_Safe_Index (Indx : Node_Id) return Boolean;
4930 -- If the left-hand side includes an indexed component, check that
4931 -- the indexes are free of side-effect.
4937 function Is_Safe_Index (Indx : Node_Id) return Boolean is
4939 if Is_Entity_Name (Indx) then
4942 elsif Nkind (Indx) = N_Integer_Literal then
4945 elsif Nkind (Indx) = N_Function_Call
4946 and then Is_Entity_Name (Name (Indx))
4948 Has_Pragma_Pure_Function (Entity (Name (Indx)))
4952 elsif Nkind (Indx) = N_Type_Conversion
4953 and then Is_Safe_Index (Expression (Indx))
4962 -- Start of processing for Safe_Left_Hand_Side
4965 if Is_Entity_Name (N) then
4968 elsif Nkind_In (N, N_Explicit_Dereference, N_Selected_Component)
4969 and then Safe_Left_Hand_Side (Prefix (N))
4973 elsif Nkind (N) = N_Indexed_Component
4974 and then Safe_Left_Hand_Side (Prefix (N))
4976 Is_Safe_Index (First (Expressions (N)))
4980 elsif Nkind (N) = N_Unchecked_Type_Conversion then
4981 return Safe_Left_Hand_Side (Expression (N));
4986 end Safe_Left_Hand_Side;
4991 -- Holds the temporary aggregate value
4994 -- Holds the declaration of Tmp
4996 Aggr_Code : List_Id;
4997 Parent_Node : Node_Id;
4998 Parent_Kind : Node_Kind;
5000 -- Start of processing for Expand_Array_Aggregate
5003 -- Do not touch the special aggregates of attributes used for Asm calls
5005 if Is_RTE (Ctyp, RE_Asm_Input_Operand)
5006 or else Is_RTE (Ctyp, RE_Asm_Output_Operand)
5011 -- If the semantic analyzer has determined that aggregate N will raise
5012 -- Constraint_Error at run time, then the aggregate node has been
5013 -- replaced with an N_Raise_Constraint_Error node and we should
5016 pragma Assert (not Raises_Constraint_Error (N));
5020 -- Check that the index range defined by aggregate bounds is
5021 -- compatible with corresponding index subtype.
5023 Index_Compatibility_Check : declare
5024 Aggr_Index_Range : Node_Id := First_Index (Typ);
5025 -- The current aggregate index range
5027 Index_Constraint : Node_Id := First_Index (Etype (Typ));
5028 -- The corresponding index constraint against which we have to
5029 -- check the above aggregate index range.
5032 Compute_Others_Present (N, 1);
5034 for J in 1 .. Aggr_Dimension loop
5035 -- There is no need to emit a check if an others choice is
5036 -- present for this array aggregate dimension since in this
5037 -- case one of N's sub-aggregates has taken its bounds from the
5038 -- context and these bounds must have been checked already. In
5039 -- addition all sub-aggregates corresponding to the same
5040 -- dimension must all have the same bounds (checked in (c) below).
5042 if not Range_Checks_Suppressed (Etype (Index_Constraint))
5043 and then not Others_Present (J)
5045 -- We don't use Checks.Apply_Range_Check here because it emits
5046 -- a spurious check. Namely it checks that the range defined by
5047 -- the aggregate bounds is non empty. But we know this already
5050 Check_Bounds (Aggr_Index_Range, Index_Constraint);
5053 -- Save the low and high bounds of the aggregate index as well as
5054 -- the index type for later use in checks (b) and (c) below.
5056 Aggr_Low (J) := Low_Bound (Aggr_Index_Range);
5057 Aggr_High (J) := High_Bound (Aggr_Index_Range);
5059 Aggr_Index_Typ (J) := Etype (Index_Constraint);
5061 Next_Index (Aggr_Index_Range);
5062 Next_Index (Index_Constraint);
5064 end Index_Compatibility_Check;
5068 -- If an others choice is present check that no aggregate index is
5069 -- outside the bounds of the index constraint.
5071 Others_Check (N, 1);
5075 -- For multidimensional arrays make sure that all subaggregates
5076 -- corresponding to the same dimension have the same bounds.
5078 if Aggr_Dimension > 1 then
5079 Check_Same_Aggr_Bounds (N, 1);
5084 -- Here we test for is packed array aggregate that we can handle at
5085 -- compile time. If so, return with transformation done. Note that we do
5086 -- this even if the aggregate is nested, because once we have done this
5087 -- processing, there is no more nested aggregate!
5089 if Packed_Array_Aggregate_Handled (N) then
5093 -- At this point we try to convert to positional form
5095 if Ekind (Current_Scope) = E_Package
5096 and then Static_Elaboration_Desired (Current_Scope)
5098 Convert_To_Positional (N, Max_Others_Replicate => 100);
5101 Convert_To_Positional (N);
5104 -- if the result is no longer an aggregate (e.g. it may be a string
5105 -- literal, or a temporary which has the needed value), then we are
5106 -- done, since there is no longer a nested aggregate.
5108 if Nkind (N) /= N_Aggregate then
5111 -- We are also done if the result is an analyzed aggregate
5112 -- This case could use more comments ???
5115 and then N /= Original_Node (N)
5120 -- If all aggregate components are compile-time known and the aggregate
5121 -- has been flattened, nothing left to do. The same occurs if the
5122 -- aggregate is used to initialize the components of an statically
5123 -- allocated dispatch table.
5125 if Compile_Time_Known_Aggregate (N)
5126 or else Is_Static_Dispatch_Table_Aggregate (N)
5128 Set_Expansion_Delayed (N, False);
5132 -- Now see if back end processing is possible
5134 if Backend_Processing_Possible (N) then
5136 -- If the aggregate is static but the constraints are not, build
5137 -- a static subtype for the aggregate, so that Gigi can place it
5138 -- in static memory. Perform an unchecked_conversion to the non-
5139 -- static type imposed by the context.
5142 Itype : constant Entity_Id := Etype (N);
5144 Needs_Type : Boolean := False;
5147 Index := First_Index (Itype);
5148 while Present (Index) loop
5149 if not Is_Static_Subtype (Etype (Index)) then
5158 Build_Constrained_Type (Positional => True);
5159 Rewrite (N, Unchecked_Convert_To (Itype, N));
5169 -- Delay expansion for nested aggregates: it will be taken care of
5170 -- when the parent aggregate is expanded.
5172 Parent_Node := Parent (N);
5173 Parent_Kind := Nkind (Parent_Node);
5175 if Parent_Kind = N_Qualified_Expression then
5176 Parent_Node := Parent (Parent_Node);
5177 Parent_Kind := Nkind (Parent_Node);
5180 if Parent_Kind = N_Aggregate
5181 or else Parent_Kind = N_Extension_Aggregate
5182 or else Parent_Kind = N_Component_Association
5183 or else (Parent_Kind = N_Object_Declaration
5184 and then Needs_Finalization (Typ))
5185 or else (Parent_Kind = N_Assignment_Statement
5186 and then Inside_Init_Proc)
5188 if Static_Array_Aggregate (N)
5189 or else Compile_Time_Known_Aggregate (N)
5191 Set_Expansion_Delayed (N, False);
5194 Set_Expansion_Delayed (N);
5201 -- Look if in place aggregate expansion is possible
5203 -- For object declarations we build the aggregate in place, unless
5204 -- the array is bit-packed or the component is controlled.
5206 -- For assignments we do the assignment in place if all the component
5207 -- associations have compile-time known values. For other cases we
5208 -- create a temporary. The analysis for safety of on-line assignment
5209 -- is delicate, i.e. we don't know how to do it fully yet ???
5211 -- For allocators we assign to the designated object in place if the
5212 -- aggregate meets the same conditions as other in-place assignments.
5213 -- In this case the aggregate may not come from source but was created
5214 -- for default initialization, e.g. with Initialize_Scalars.
5216 if Requires_Transient_Scope (Typ) then
5217 Establish_Transient_Scope
5218 (N, Sec_Stack => Has_Controlled_Component (Typ));
5221 if Has_Default_Init_Comps (N) then
5222 Maybe_In_Place_OK := False;
5224 elsif Is_Bit_Packed_Array (Typ)
5225 or else Has_Controlled_Component (Typ)
5227 Maybe_In_Place_OK := False;
5230 Maybe_In_Place_OK :=
5231 (Nkind (Parent (N)) = N_Assignment_Statement
5232 and then Comes_From_Source (N)
5233 and then In_Place_Assign_OK)
5236 (Nkind (Parent (Parent (N))) = N_Allocator
5237 and then In_Place_Assign_OK);
5240 -- If this is an array of tasks, it will be expanded into build-in-place
5241 -- assignments. Build an activation chain for the tasks now.
5243 if Has_Task (Etype (N)) then
5244 Build_Activation_Chain_Entity (N);
5247 -- Should document these individual tests ???
5249 if not Has_Default_Init_Comps (N)
5250 and then Comes_From_Source (Parent (N))
5251 and then Nkind (Parent (N)) = N_Object_Declaration
5253 Must_Slide (Etype (Defining_Identifier (Parent (N))), Typ)
5254 and then N = Expression (Parent (N))
5255 and then not Is_Bit_Packed_Array (Typ)
5256 and then not Has_Controlled_Component (Typ)
5258 -- If the aggregate is the expression in an object declaration, it
5259 -- cannot be expanded in place. Lookahead in the current declarative
5260 -- part to find an address clause for the object being declared. If
5261 -- one is present, we cannot build in place. Unclear comment???
5263 and then not Has_Following_Address_Clause (Parent (N))
5265 Tmp := Defining_Identifier (Parent (N));
5266 Set_No_Initialization (Parent (N));
5267 Set_Expression (Parent (N), Empty);
5269 -- Set the type of the entity, for use in the analysis of the
5270 -- subsequent indexed assignments. If the nominal type is not
5271 -- constrained, build a subtype from the known bounds of the
5272 -- aggregate. If the declaration has a subtype mark, use it,
5273 -- otherwise use the itype of the aggregate.
5275 if not Is_Constrained (Typ) then
5276 Build_Constrained_Type (Positional => False);
5277 elsif Is_Entity_Name (Object_Definition (Parent (N)))
5278 and then Is_Constrained (Entity (Object_Definition (Parent (N))))
5280 Set_Etype (Tmp, Entity (Object_Definition (Parent (N))));
5282 Set_Size_Known_At_Compile_Time (Typ, False);
5283 Set_Etype (Tmp, Typ);
5286 elsif Maybe_In_Place_OK
5287 and then Nkind (Parent (N)) = N_Qualified_Expression
5288 and then Nkind (Parent (Parent (N))) = N_Allocator
5290 Set_Expansion_Delayed (N);
5293 -- In the remaining cases the aggregate is the RHS of an assignment
5295 elsif Maybe_In_Place_OK
5296 and then Safe_Left_Hand_Side (Name (Parent (N)))
5298 Tmp := Name (Parent (N));
5300 if Etype (Tmp) /= Etype (N) then
5301 Apply_Length_Check (N, Etype (Tmp));
5303 if Nkind (N) = N_Raise_Constraint_Error then
5305 -- Static error, nothing further to expand
5311 elsif Maybe_In_Place_OK
5312 and then Nkind (Name (Parent (N))) = N_Slice
5313 and then Safe_Slice_Assignment (N)
5315 -- Safe_Slice_Assignment rewrites assignment as a loop
5321 -- In place aggregate expansion is not possible
5324 Maybe_In_Place_OK := False;
5325 Tmp := Make_Temporary (Loc, 'A', N);
5327 Make_Object_Declaration
5329 Defining_Identifier => Tmp,
5330 Object_Definition => New_Occurrence_Of (Typ, Loc));
5331 Set_No_Initialization (Tmp_Decl, True);
5333 -- If we are within a loop, the temporary will be pushed on the
5334 -- stack at each iteration. If the aggregate is the expression for an
5335 -- allocator, it will be immediately copied to the heap and can
5336 -- be reclaimed at once. We create a transient scope around the
5337 -- aggregate for this purpose.
5339 if Ekind (Current_Scope) = E_Loop
5340 and then Nkind (Parent (Parent (N))) = N_Allocator
5342 Establish_Transient_Scope (N, False);
5345 Insert_Action (N, Tmp_Decl);
5348 -- Construct and insert the aggregate code. We can safely suppress index
5349 -- checks because this code is guaranteed not to raise CE on index
5350 -- checks. However we should *not* suppress all checks.
5356 if Nkind (Tmp) = N_Defining_Identifier then
5357 Target := New_Reference_To (Tmp, Loc);
5361 if Has_Default_Init_Comps (N) then
5363 -- Ada 2005 (AI-287): This case has not been analyzed???
5365 raise Program_Error;
5368 -- Name in assignment is explicit dereference
5370 Target := New_Copy (Tmp);
5374 Build_Array_Aggr_Code (N,
5376 Index => First_Index (Typ),
5378 Scalar_Comp => Is_Scalar_Type (Ctyp));
5381 if Comes_From_Source (Tmp) then
5382 Insert_Actions_After (Parent (N), Aggr_Code);
5385 Insert_Actions (N, Aggr_Code);
5388 -- If the aggregate has been assigned in place, remove the original
5391 if Nkind (Parent (N)) = N_Assignment_Statement
5392 and then Maybe_In_Place_OK
5394 Rewrite (Parent (N), Make_Null_Statement (Loc));
5396 elsif Nkind (Parent (N)) /= N_Object_Declaration
5397 or else Tmp /= Defining_Identifier (Parent (N))
5399 Rewrite (N, New_Occurrence_Of (Tmp, Loc));
5400 Analyze_And_Resolve (N, Typ);
5402 end Expand_Array_Aggregate;
5404 ------------------------
5405 -- Expand_N_Aggregate --
5406 ------------------------
5408 procedure Expand_N_Aggregate (N : Node_Id) is
5410 if Is_Record_Type (Etype (N)) then
5411 Expand_Record_Aggregate (N);
5413 Expand_Array_Aggregate (N);
5416 when RE_Not_Available =>
5418 end Expand_N_Aggregate;
5420 ----------------------------------
5421 -- Expand_N_Extension_Aggregate --
5422 ----------------------------------
5424 -- If the ancestor part is an expression, add a component association for
5425 -- the parent field. If the type of the ancestor part is not the direct
5426 -- parent of the expected type, build recursively the needed ancestors.
5427 -- If the ancestor part is a subtype_mark, replace aggregate with a decla-
5428 -- ration for a temporary of the expected type, followed by individual
5429 -- assignments to the given components.
5431 procedure Expand_N_Extension_Aggregate (N : Node_Id) is
5432 Loc : constant Source_Ptr := Sloc (N);
5433 A : constant Node_Id := Ancestor_Part (N);
5434 Typ : constant Entity_Id := Etype (N);
5437 -- If the ancestor is a subtype mark, an init proc must be called
5438 -- on the resulting object which thus has to be materialized in
5441 if Is_Entity_Name (A) and then Is_Type (Entity (A)) then
5442 Convert_To_Assignments (N, Typ);
5444 -- The extension aggregate is transformed into a record aggregate
5445 -- of the following form (c1 and c2 are inherited components)
5447 -- (Exp with c3 => a, c4 => b)
5448 -- ==> (c1 => Exp.c1, c2 => Exp.c2, c3 => a, c4 => b)
5453 if Tagged_Type_Expansion then
5454 Expand_Record_Aggregate (N,
5457 (Node (First_Elmt (Access_Disp_Table (Typ))), Loc),
5460 -- No tag is needed in the case of a VM
5463 Expand_Record_Aggregate (N, Parent_Expr => A);
5468 when RE_Not_Available =>
5470 end Expand_N_Extension_Aggregate;
5472 -----------------------------
5473 -- Expand_Record_Aggregate --
5474 -----------------------------
5476 procedure Expand_Record_Aggregate
5478 Orig_Tag : Node_Id := Empty;
5479 Parent_Expr : Node_Id := Empty)
5481 Loc : constant Source_Ptr := Sloc (N);
5482 Comps : constant List_Id := Component_Associations (N);
5483 Typ : constant Entity_Id := Etype (N);
5484 Base_Typ : constant Entity_Id := Base_Type (Typ);
5486 Static_Components : Boolean := True;
5487 -- Flag to indicate whether all components are compile-time known,
5488 -- and the aggregate can be constructed statically and handled by
5491 function Component_Not_OK_For_Backend return Boolean;
5492 -- Check for presence of component which makes it impossible for the
5493 -- backend to process the aggregate, thus requiring the use of a series
5494 -- of assignment statements. Cases checked for are a nested aggregate
5495 -- needing Late_Expansion, the presence of a tagged component which may
5496 -- need tag adjustment, and a bit unaligned component reference.
5498 -- We also force expansion into assignments if a component is of a
5499 -- mutable type (including a private type with discriminants) because
5500 -- in that case the size of the component to be copied may be smaller
5501 -- than the side of the target, and there is no simple way for gigi
5502 -- to compute the size of the object to be copied.
5504 -- NOTE: This is part of the ongoing work to define precisely the
5505 -- interface between front-end and back-end handling of aggregates.
5506 -- In general it is desirable to pass aggregates as they are to gigi,
5507 -- in order to minimize elaboration code. This is one case where the
5508 -- semantics of Ada complicate the analysis and lead to anomalies in
5509 -- the gcc back-end if the aggregate is not expanded into assignments.
5511 ----------------------------------
5512 -- Component_Not_OK_For_Backend --
5513 ----------------------------------
5515 function Component_Not_OK_For_Backend return Boolean is
5525 while Present (C) loop
5527 -- If the component has box initialization, expansion is needed
5528 -- and component is not ready for backend.
5530 if Box_Present (C) then
5534 if Nkind (Expression (C)) = N_Qualified_Expression then
5535 Expr_Q := Expression (Expression (C));
5537 Expr_Q := Expression (C);
5540 -- Return true if the aggregate has any associations for tagged
5541 -- components that may require tag adjustment.
5543 -- These are cases where the source expression may have a tag that
5544 -- could differ from the component tag (e.g., can occur for type
5545 -- conversions and formal parameters). (Tag adjustment not needed
5546 -- if VM_Target because object tags are implicit in the machine.)
5548 if Is_Tagged_Type (Etype (Expr_Q))
5549 and then (Nkind (Expr_Q) = N_Type_Conversion
5550 or else (Is_Entity_Name (Expr_Q)
5552 Ekind (Entity (Expr_Q)) in Formal_Kind))
5553 and then Tagged_Type_Expansion
5555 Static_Components := False;
5558 elsif Is_Delayed_Aggregate (Expr_Q) then
5559 Static_Components := False;
5562 elsif Possible_Bit_Aligned_Component (Expr_Q) then
5563 Static_Components := False;
5567 if Is_Scalar_Type (Etype (Expr_Q)) then
5568 if not Compile_Time_Known_Value (Expr_Q) then
5569 Static_Components := False;
5572 elsif Nkind (Expr_Q) /= N_Aggregate
5573 or else not Compile_Time_Known_Aggregate (Expr_Q)
5575 Static_Components := False;
5577 if Is_Private_Type (Etype (Expr_Q))
5578 and then Has_Discriminants (Etype (Expr_Q))
5588 end Component_Not_OK_For_Backend;
5590 -- Remaining Expand_Record_Aggregate variables
5592 Tag_Value : Node_Id;
5596 -- Start of processing for Expand_Record_Aggregate
5599 -- If the aggregate is to be assigned to an atomic variable, we
5600 -- have to prevent a piecemeal assignment even if the aggregate
5601 -- is to be expanded. We create a temporary for the aggregate, and
5602 -- assign the temporary instead, so that the back end can generate
5603 -- an atomic move for it.
5606 and then Comes_From_Source (Parent (N))
5607 and then Is_Atomic_Aggregate (N, Typ)
5611 -- No special management required for aggregates used to initialize
5612 -- statically allocated dispatch tables
5614 elsif Is_Static_Dispatch_Table_Aggregate (N) then
5618 -- Ada 2005 (AI-318-2): We need to convert to assignments if components
5619 -- are build-in-place function calls. The assignments will each turn
5620 -- into a build-in-place function call. If components are all static,
5621 -- we can pass the aggregate to the backend regardless of limitedness.
5623 -- Extension aggregates, aggregates in extended return statements, and
5624 -- aggregates for C++ imported types must be expanded.
5626 if Ada_Version >= Ada_2005 and then Is_Immutably_Limited_Type (Typ) then
5627 if not Nkind_In (Parent (N), N_Object_Declaration,
5628 N_Component_Association)
5630 Convert_To_Assignments (N, Typ);
5632 elsif Nkind (N) = N_Extension_Aggregate
5633 or else Convention (Typ) = Convention_CPP
5635 Convert_To_Assignments (N, Typ);
5637 elsif not Size_Known_At_Compile_Time (Typ)
5638 or else Component_Not_OK_For_Backend
5639 or else not Static_Components
5641 Convert_To_Assignments (N, Typ);
5644 Set_Compile_Time_Known_Aggregate (N);
5645 Set_Expansion_Delayed (N, False);
5648 -- Gigi doesn't properly handle temporaries of variable size so we
5649 -- generate it in the front-end
5651 elsif not Size_Known_At_Compile_Time (Typ)
5652 and then Tagged_Type_Expansion
5654 Convert_To_Assignments (N, Typ);
5656 -- Temporaries for controlled aggregates need to be attached to a final
5657 -- chain in order to be properly finalized, so it has to be created in
5660 elsif Is_Controlled (Typ)
5661 or else Has_Controlled_Component (Base_Type (Typ))
5663 Convert_To_Assignments (N, Typ);
5665 -- Ada 2005 (AI-287): In case of default initialized components we
5666 -- convert the aggregate into assignments.
5668 elsif Has_Default_Init_Comps (N) then
5669 Convert_To_Assignments (N, Typ);
5673 elsif Component_Not_OK_For_Backend then
5674 Convert_To_Assignments (N, Typ);
5676 -- If an ancestor is private, some components are not inherited and
5677 -- we cannot expand into a record aggregate
5679 elsif Has_Private_Ancestor (Typ) then
5680 Convert_To_Assignments (N, Typ);
5682 -- ??? The following was done to compile fxacc00.ads in the ACVCs. Gigi
5683 -- is not able to handle the aggregate for Late_Request.
5685 elsif Is_Tagged_Type (Typ) and then Has_Discriminants (Typ) then
5686 Convert_To_Assignments (N, Typ);
5688 -- If the tagged types covers interface types we need to initialize all
5689 -- hidden components containing pointers to secondary dispatch tables.
5691 elsif Is_Tagged_Type (Typ) and then Has_Interfaces (Typ) then
5692 Convert_To_Assignments (N, Typ);
5694 -- If some components are mutable, the size of the aggregate component
5695 -- may be distinct from the default size of the type component, so
5696 -- we need to expand to insure that the back-end copies the proper
5697 -- size of the data. However, if the aggregate is the initial value of
5698 -- a constant, the target is immutable and may be built statically.
5700 elsif Has_Mutable_Components (Typ)
5702 (Nkind (Parent (N)) /= N_Object_Declaration
5703 or else not Constant_Present (Parent (N)))
5705 Convert_To_Assignments (N, Typ);
5707 -- If the type involved has any non-bit aligned components, then we are
5708 -- not sure that the back end can handle this case correctly.
5710 elsif Type_May_Have_Bit_Aligned_Components (Typ) then
5711 Convert_To_Assignments (N, Typ);
5713 -- In all other cases, build a proper aggregate handlable by gigi
5716 if Nkind (N) = N_Aggregate then
5718 -- If the aggregate is static and can be handled by the back-end,
5719 -- nothing left to do.
5721 if Static_Components then
5722 Set_Compile_Time_Known_Aggregate (N);
5723 Set_Expansion_Delayed (N, False);
5727 -- If no discriminants, nothing special to do
5729 if not Has_Discriminants (Typ) then
5732 -- Case of discriminants present
5734 elsif Is_Derived_Type (Typ) then
5736 -- For untagged types, non-stored discriminants are replaced
5737 -- with stored discriminants, which are the ones that gigi uses
5738 -- to describe the type and its components.
5740 Generate_Aggregate_For_Derived_Type : declare
5741 Constraints : constant List_Id := New_List;
5742 First_Comp : Node_Id;
5743 Discriminant : Entity_Id;
5745 Num_Disc : Int := 0;
5746 Num_Gird : Int := 0;
5748 procedure Prepend_Stored_Values (T : Entity_Id);
5749 -- Scan the list of stored discriminants of the type, and add
5750 -- their values to the aggregate being built.
5752 ---------------------------
5753 -- Prepend_Stored_Values --
5754 ---------------------------
5756 procedure Prepend_Stored_Values (T : Entity_Id) is
5758 Discriminant := First_Stored_Discriminant (T);
5759 while Present (Discriminant) loop
5761 Make_Component_Association (Loc,
5763 New_List (New_Occurrence_Of (Discriminant, Loc)),
5767 Get_Discriminant_Value (
5770 Discriminant_Constraint (Typ))));
5772 if No (First_Comp) then
5773 Prepend_To (Component_Associations (N), New_Comp);
5775 Insert_After (First_Comp, New_Comp);
5778 First_Comp := New_Comp;
5779 Next_Stored_Discriminant (Discriminant);
5781 end Prepend_Stored_Values;
5783 -- Start of processing for Generate_Aggregate_For_Derived_Type
5786 -- Remove the associations for the discriminant of derived type
5788 First_Comp := First (Component_Associations (N));
5789 while Present (First_Comp) loop
5794 (First (Choices (Comp)))) = E_Discriminant
5797 Num_Disc := Num_Disc + 1;
5801 -- Insert stored discriminant associations in the correct
5802 -- order. If there are more stored discriminants than new
5803 -- discriminants, there is at least one new discriminant that
5804 -- constrains more than one of the stored discriminants. In
5805 -- this case we need to construct a proper subtype of the
5806 -- parent type, in order to supply values to all the
5807 -- components. Otherwise there is one-one correspondence
5808 -- between the constraints and the stored discriminants.
5810 First_Comp := Empty;
5812 Discriminant := First_Stored_Discriminant (Base_Type (Typ));
5813 while Present (Discriminant) loop
5814 Num_Gird := Num_Gird + 1;
5815 Next_Stored_Discriminant (Discriminant);
5818 -- Case of more stored discriminants than new discriminants
5820 if Num_Gird > Num_Disc then
5822 -- Create a proper subtype of the parent type, which is the
5823 -- proper implementation type for the aggregate, and convert
5824 -- it to the intended target type.
5826 Discriminant := First_Stored_Discriminant (Base_Type (Typ));
5827 while Present (Discriminant) loop
5830 Get_Discriminant_Value (
5833 Discriminant_Constraint (Typ)));
5834 Append (New_Comp, Constraints);
5835 Next_Stored_Discriminant (Discriminant);
5839 Make_Subtype_Declaration (Loc,
5840 Defining_Identifier => Make_Temporary (Loc, 'T'),
5841 Subtype_Indication =>
5842 Make_Subtype_Indication (Loc,
5844 New_Occurrence_Of (Etype (Base_Type (Typ)), Loc),
5846 Make_Index_Or_Discriminant_Constraint
5847 (Loc, Constraints)));
5849 Insert_Action (N, Decl);
5850 Prepend_Stored_Values (Base_Type (Typ));
5852 Set_Etype (N, Defining_Identifier (Decl));
5855 Rewrite (N, Unchecked_Convert_To (Typ, N));
5858 -- Case where we do not have fewer new discriminants than
5859 -- stored discriminants, so in this case we can simply use the
5860 -- stored discriminants of the subtype.
5863 Prepend_Stored_Values (Typ);
5865 end Generate_Aggregate_For_Derived_Type;
5868 if Is_Tagged_Type (Typ) then
5870 -- The tagged case, _parent and _tag component must be created
5872 -- Reset null_present unconditionally. tagged records always have
5873 -- at least one field (the tag or the parent)
5875 Set_Null_Record_Present (N, False);
5877 -- When the current aggregate comes from the expansion of an
5878 -- extension aggregate, the parent expr is replaced by an
5879 -- aggregate formed by selected components of this expr
5881 if Present (Parent_Expr)
5882 and then Is_Empty_List (Comps)
5884 Comp := First_Component_Or_Discriminant (Typ);
5885 while Present (Comp) loop
5887 -- Skip all expander-generated components
5890 not Comes_From_Source (Original_Record_Component (Comp))
5896 Make_Selected_Component (Loc,
5898 Unchecked_Convert_To (Typ,
5899 Duplicate_Subexpr (Parent_Expr, True)),
5901 Selector_Name => New_Occurrence_Of (Comp, Loc));
5904 Make_Component_Association (Loc,
5906 New_List (New_Occurrence_Of (Comp, Loc)),
5910 Analyze_And_Resolve (New_Comp, Etype (Comp));
5913 Next_Component_Or_Discriminant (Comp);
5917 -- Compute the value for the Tag now, if the type is a root it
5918 -- will be included in the aggregate right away, otherwise it will
5919 -- be propagated to the parent aggregate
5921 if Present (Orig_Tag) then
5922 Tag_Value := Orig_Tag;
5923 elsif not Tagged_Type_Expansion then
5928 (Node (First_Elmt (Access_Disp_Table (Typ))), Loc);
5931 -- For a derived type, an aggregate for the parent is formed with
5932 -- all the inherited components.
5934 if Is_Derived_Type (Typ) then
5937 First_Comp : Node_Id;
5938 Parent_Comps : List_Id;
5939 Parent_Aggr : Node_Id;
5940 Parent_Name : Node_Id;
5943 -- Remove the inherited component association from the
5944 -- aggregate and store them in the parent aggregate
5946 First_Comp := First (Component_Associations (N));
5947 Parent_Comps := New_List;
5948 while Present (First_Comp)
5949 and then Scope (Original_Record_Component (
5950 Entity (First (Choices (First_Comp))))) /= Base_Typ
5955 Append (Comp, Parent_Comps);
5958 Parent_Aggr := Make_Aggregate (Loc,
5959 Component_Associations => Parent_Comps);
5960 Set_Etype (Parent_Aggr, Etype (Base_Type (Typ)));
5962 -- Find the _parent component
5964 Comp := First_Component (Typ);
5965 while Chars (Comp) /= Name_uParent loop
5966 Comp := Next_Component (Comp);
5969 Parent_Name := New_Occurrence_Of (Comp, Loc);
5971 -- Insert the parent aggregate
5973 Prepend_To (Component_Associations (N),
5974 Make_Component_Association (Loc,
5975 Choices => New_List (Parent_Name),
5976 Expression => Parent_Aggr));
5978 -- Expand recursively the parent propagating the right Tag
5980 Expand_Record_Aggregate (
5981 Parent_Aggr, Tag_Value, Parent_Expr);
5984 -- For a root type, the tag component is added (unless compiling
5985 -- for the VMs, where tags are implicit).
5987 elsif Tagged_Type_Expansion then
5989 Tag_Name : constant Node_Id :=
5991 (First_Tag_Component (Typ), Loc);
5992 Typ_Tag : constant Entity_Id := RTE (RE_Tag);
5993 Conv_Node : constant Node_Id :=
5994 Unchecked_Convert_To (Typ_Tag, Tag_Value);
5997 Set_Etype (Conv_Node, Typ_Tag);
5998 Prepend_To (Component_Associations (N),
5999 Make_Component_Association (Loc,
6000 Choices => New_List (Tag_Name),
6001 Expression => Conv_Node));
6007 end Expand_Record_Aggregate;
6009 ----------------------------
6010 -- Has_Default_Init_Comps --
6011 ----------------------------
6013 function Has_Default_Init_Comps (N : Node_Id) return Boolean is
6014 Comps : constant List_Id := Component_Associations (N);
6018 pragma Assert (Nkind_In (N, N_Aggregate, N_Extension_Aggregate));
6024 if Has_Self_Reference (N) then
6028 -- Check if any direct component has default initialized components
6031 while Present (C) loop
6032 if Box_Present (C) then
6039 -- Recursive call in case of aggregate expression
6042 while Present (C) loop
6043 Expr := Expression (C);
6047 Nkind_In (Expr, N_Aggregate, N_Extension_Aggregate)
6048 and then Has_Default_Init_Comps (Expr)
6057 end Has_Default_Init_Comps;
6059 --------------------------
6060 -- Is_Delayed_Aggregate --
6061 --------------------------
6063 function Is_Delayed_Aggregate (N : Node_Id) return Boolean is
6064 Node : Node_Id := N;
6065 Kind : Node_Kind := Nkind (Node);
6068 if Kind = N_Qualified_Expression then
6069 Node := Expression (Node);
6070 Kind := Nkind (Node);
6073 if Kind /= N_Aggregate and then Kind /= N_Extension_Aggregate then
6076 return Expansion_Delayed (Node);
6078 end Is_Delayed_Aggregate;
6080 ----------------------------------------
6081 -- Is_Static_Dispatch_Table_Aggregate --
6082 ----------------------------------------
6084 function Is_Static_Dispatch_Table_Aggregate (N : Node_Id) return Boolean is
6085 Typ : constant Entity_Id := Base_Type (Etype (N));
6088 return Static_Dispatch_Tables
6089 and then Tagged_Type_Expansion
6090 and then RTU_Loaded (Ada_Tags)
6092 -- Avoid circularity when rebuilding the compiler
6094 and then Cunit_Entity (Get_Source_Unit (N)) /= RTU_Entity (Ada_Tags)
6095 and then (Typ = RTE (RE_Dispatch_Table_Wrapper)
6097 Typ = RTE (RE_Address_Array)
6099 Typ = RTE (RE_Type_Specific_Data)
6101 Typ = RTE (RE_Tag_Table)
6103 (RTE_Available (RE_Interface_Data)
6104 and then Typ = RTE (RE_Interface_Data))
6106 (RTE_Available (RE_Interfaces_Array)
6107 and then Typ = RTE (RE_Interfaces_Array))
6109 (RTE_Available (RE_Interface_Data_Element)
6110 and then Typ = RTE (RE_Interface_Data_Element)));
6111 end Is_Static_Dispatch_Table_Aggregate;
6113 --------------------
6114 -- Late_Expansion --
6115 --------------------
6117 function Late_Expansion
6121 Flist : Node_Id := Empty;
6122 Obj : Entity_Id := Empty) return List_Id
6125 if Is_Record_Type (Etype (N)) then
6126 return Build_Record_Aggr_Code (N, Typ, Target, Flist, Obj);
6128 else pragma Assert (Is_Array_Type (Etype (N)));
6130 Build_Array_Aggr_Code
6132 Ctype => Component_Type (Etype (N)),
6133 Index => First_Index (Typ),
6135 Scalar_Comp => Is_Scalar_Type (Component_Type (Typ)),
6141 ----------------------------------
6142 -- Make_OK_Assignment_Statement --
6143 ----------------------------------
6145 function Make_OK_Assignment_Statement
6148 Expression : Node_Id) return Node_Id
6151 Set_Assignment_OK (Name);
6153 return Make_Assignment_Statement (Sloc, Name, Expression);
6154 end Make_OK_Assignment_Statement;
6156 -----------------------
6157 -- Number_Of_Choices --
6158 -----------------------
6160 function Number_Of_Choices (N : Node_Id) return Nat is
6164 Nb_Choices : Nat := 0;
6167 if Present (Expressions (N)) then
6171 Assoc := First (Component_Associations (N));
6172 while Present (Assoc) loop
6173 Choice := First (Choices (Assoc));
6174 while Present (Choice) loop
6175 if Nkind (Choice) /= N_Others_Choice then
6176 Nb_Choices := Nb_Choices + 1;
6186 end Number_Of_Choices;
6188 ------------------------------------
6189 -- Packed_Array_Aggregate_Handled --
6190 ------------------------------------
6192 -- The current version of this procedure will handle at compile time
6193 -- any array aggregate that meets these conditions:
6195 -- One dimensional, bit packed
6196 -- Underlying packed type is modular type
6197 -- Bounds are within 32-bit Int range
6198 -- All bounds and values are static
6200 function Packed_Array_Aggregate_Handled (N : Node_Id) return Boolean is
6201 Loc : constant Source_Ptr := Sloc (N);
6202 Typ : constant Entity_Id := Etype (N);
6203 Ctyp : constant Entity_Id := Component_Type (Typ);
6205 Not_Handled : exception;
6206 -- Exception raised if this aggregate cannot be handled
6209 -- For now, handle only one dimensional bit packed arrays
6211 if not Is_Bit_Packed_Array (Typ)
6212 or else Number_Dimensions (Typ) > 1
6213 or else not Is_Modular_Integer_Type (Packed_Array_Type (Typ))
6218 if not Is_Scalar_Type (Component_Type (Typ))
6219 and then Has_Non_Standard_Rep (Component_Type (Typ))
6225 Csiz : constant Nat := UI_To_Int (Component_Size (Typ));
6229 -- Bounds of index type
6233 -- Values of bounds if compile time known
6235 function Get_Component_Val (N : Node_Id) return Uint;
6236 -- Given a expression value N of the component type Ctyp, returns a
6237 -- value of Csiz (component size) bits representing this value. If
6238 -- the value is non-static or any other reason exists why the value
6239 -- cannot be returned, then Not_Handled is raised.
6241 -----------------------
6242 -- Get_Component_Val --
6243 -----------------------
6245 function Get_Component_Val (N : Node_Id) return Uint is
6249 -- We have to analyze the expression here before doing any further
6250 -- processing here. The analysis of such expressions is deferred
6251 -- till expansion to prevent some problems of premature analysis.
6253 Analyze_And_Resolve (N, Ctyp);
6255 -- Must have a compile time value. String literals have to be
6256 -- converted into temporaries as well, because they cannot easily
6257 -- be converted into their bit representation.
6259 if not Compile_Time_Known_Value (N)
6260 or else Nkind (N) = N_String_Literal
6265 Val := Expr_Rep_Value (N);
6267 -- Adjust for bias, and strip proper number of bits
6269 if Has_Biased_Representation (Ctyp) then
6270 Val := Val - Expr_Value (Type_Low_Bound (Ctyp));
6273 return Val mod Uint_2 ** Csiz;
6274 end Get_Component_Val;
6276 -- Here we know we have a one dimensional bit packed array
6279 Get_Index_Bounds (First_Index (Typ), Lo, Hi);
6281 -- Cannot do anything if bounds are dynamic
6283 if not Compile_Time_Known_Value (Lo)
6285 not Compile_Time_Known_Value (Hi)
6290 -- Or are silly out of range of int bounds
6292 Lob := Expr_Value (Lo);
6293 Hib := Expr_Value (Hi);
6295 if not UI_Is_In_Int_Range (Lob)
6297 not UI_Is_In_Int_Range (Hib)
6302 -- At this stage we have a suitable aggregate for handling at compile
6303 -- time (the only remaining checks are that the values of expressions
6304 -- in the aggregate are compile time known (check is performed by
6305 -- Get_Component_Val), and that any subtypes or ranges are statically
6308 -- If the aggregate is not fully positional at this stage, then
6309 -- convert it to positional form. Either this will fail, in which
6310 -- case we can do nothing, or it will succeed, in which case we have
6311 -- succeeded in handling the aggregate, or it will stay an aggregate,
6312 -- in which case we have failed to handle this case.
6314 if Present (Component_Associations (N)) then
6315 Convert_To_Positional
6316 (N, Max_Others_Replicate => 64, Handle_Bit_Packed => True);
6317 return Nkind (N) /= N_Aggregate;
6320 -- Otherwise we are all positional, so convert to proper value
6323 Lov : constant Int := UI_To_Int (Lob);
6324 Hiv : constant Int := UI_To_Int (Hib);
6326 Len : constant Nat := Int'Max (0, Hiv - Lov + 1);
6327 -- The length of the array (number of elements)
6329 Aggregate_Val : Uint;
6330 -- Value of aggregate. The value is set in the low order bits of
6331 -- this value. For the little-endian case, the values are stored
6332 -- from low-order to high-order and for the big-endian case the
6333 -- values are stored from high-order to low-order. Note that gigi
6334 -- will take care of the conversions to left justify the value in
6335 -- the big endian case (because of left justified modular type
6336 -- processing), so we do not have to worry about that here.
6339 -- Integer literal for resulting constructed value
6342 -- Shift count from low order for next value
6345 -- Shift increment for loop
6348 -- Next expression from positional parameters of aggregate
6351 -- For little endian, we fill up the low order bits of the target
6352 -- value. For big endian we fill up the high order bits of the
6353 -- target value (which is a left justified modular value).
6355 if Bytes_Big_Endian xor Debug_Flag_8 then
6356 Shift := Csiz * (Len - 1);
6363 -- Loop to set the values
6366 Aggregate_Val := Uint_0;
6368 Expr := First (Expressions (N));
6369 Aggregate_Val := Get_Component_Val (Expr) * Uint_2 ** Shift;
6371 for J in 2 .. Len loop
6372 Shift := Shift + Incr;
6375 Aggregate_Val + Get_Component_Val (Expr) * Uint_2 ** Shift;
6379 -- Now we can rewrite with the proper value
6382 Make_Integer_Literal (Loc,
6383 Intval => Aggregate_Val);
6384 Set_Print_In_Hex (Lit);
6386 -- Construct the expression using this literal. Note that it is
6387 -- important to qualify the literal with its proper modular type
6388 -- since universal integer does not have the required range and
6389 -- also this is a left justified modular type, which is important
6390 -- in the big-endian case.
6393 Unchecked_Convert_To (Typ,
6394 Make_Qualified_Expression (Loc,
6396 New_Occurrence_Of (Packed_Array_Type (Typ), Loc),
6397 Expression => Lit)));
6399 Analyze_And_Resolve (N, Typ);
6407 end Packed_Array_Aggregate_Handled;
6409 ----------------------------
6410 -- Has_Mutable_Components --
6411 ----------------------------
6413 function Has_Mutable_Components (Typ : Entity_Id) return Boolean is
6417 Comp := First_Component (Typ);
6418 while Present (Comp) loop
6419 if Is_Record_Type (Etype (Comp))
6420 and then Has_Discriminants (Etype (Comp))
6421 and then not Is_Constrained (Etype (Comp))
6426 Next_Component (Comp);
6430 end Has_Mutable_Components;
6432 ------------------------------
6433 -- Initialize_Discriminants --
6434 ------------------------------
6436 procedure Initialize_Discriminants (N : Node_Id; Typ : Entity_Id) is
6437 Loc : constant Source_Ptr := Sloc (N);
6438 Bas : constant Entity_Id := Base_Type (Typ);
6439 Par : constant Entity_Id := Etype (Bas);
6440 Decl : constant Node_Id := Parent (Par);
6444 if Is_Tagged_Type (Bas)
6445 and then Is_Derived_Type (Bas)
6446 and then Has_Discriminants (Par)
6447 and then Has_Discriminants (Bas)
6448 and then Number_Discriminants (Bas) /= Number_Discriminants (Par)
6449 and then Nkind (Decl) = N_Full_Type_Declaration
6450 and then Nkind (Type_Definition (Decl)) = N_Record_Definition
6452 (Variant_Part (Component_List (Type_Definition (Decl))))
6453 and then Nkind (N) /= N_Extension_Aggregate
6456 -- Call init proc to set discriminants.
6457 -- There should eventually be a special procedure for this ???
6459 Ref := New_Reference_To (Defining_Identifier (N), Loc);
6460 Insert_Actions_After (N,
6461 Build_Initialization_Call (Sloc (N), Ref, Typ));
6463 end Initialize_Discriminants;
6470 (Obj_Type : Entity_Id;
6471 Typ : Entity_Id) return Boolean
6473 L1, L2, H1, H2 : Node_Id;
6475 -- No sliding if the type of the object is not established yet, if it is
6476 -- an unconstrained type whose actual subtype comes from the aggregate,
6477 -- or if the two types are identical.
6479 if not Is_Array_Type (Obj_Type) then
6482 elsif not Is_Constrained (Obj_Type) then
6485 elsif Typ = Obj_Type then
6489 -- Sliding can only occur along the first dimension
6491 Get_Index_Bounds (First_Index (Typ), L1, H1);
6492 Get_Index_Bounds (First_Index (Obj_Type), L2, H2);
6494 if not Is_Static_Expression (L1)
6495 or else not Is_Static_Expression (L2)
6496 or else not Is_Static_Expression (H1)
6497 or else not Is_Static_Expression (H2)
6501 return Expr_Value (L1) /= Expr_Value (L2)
6502 or else Expr_Value (H1) /= Expr_Value (H2);
6507 ---------------------------
6508 -- Safe_Slice_Assignment --
6509 ---------------------------
6511 function Safe_Slice_Assignment (N : Node_Id) return Boolean is
6512 Loc : constant Source_Ptr := Sloc (Parent (N));
6513 Pref : constant Node_Id := Prefix (Name (Parent (N)));
6514 Range_Node : constant Node_Id := Discrete_Range (Name (Parent (N)));
6522 -- Generate: for J in Range loop Pref (J) := Expr; end loop;
6524 if Comes_From_Source (N)
6525 and then No (Expressions (N))
6526 and then Nkind (First (Choices (First (Component_Associations (N)))))
6529 Expr := Expression (First (Component_Associations (N)));
6530 L_J := Make_Temporary (Loc, 'J');
6533 Make_Iteration_Scheme (Loc,
6534 Loop_Parameter_Specification =>
6535 Make_Loop_Parameter_Specification
6537 Defining_Identifier => L_J,
6538 Discrete_Subtype_Definition => Relocate_Node (Range_Node)));
6541 Make_Assignment_Statement (Loc,
6543 Make_Indexed_Component (Loc,
6544 Prefix => Relocate_Node (Pref),
6545 Expressions => New_List (New_Occurrence_Of (L_J, Loc))),
6546 Expression => Relocate_Node (Expr));
6548 -- Construct the final loop
6551 Make_Implicit_Loop_Statement
6552 (Node => Parent (N),
6553 Identifier => Empty,
6554 Iteration_Scheme => L_Iter,
6555 Statements => New_List (L_Body));
6557 -- Set type of aggregate to be type of lhs in assignment,
6558 -- to suppress redundant length checks.
6560 Set_Etype (N, Etype (Name (Parent (N))));
6562 Rewrite (Parent (N), Stat);
6563 Analyze (Parent (N));
6569 end Safe_Slice_Assignment;
6571 ---------------------
6572 -- Sort_Case_Table --
6573 ---------------------
6575 procedure Sort_Case_Table (Case_Table : in out Case_Table_Type) is
6576 L : constant Int := Case_Table'First;
6577 U : constant Int := Case_Table'Last;
6585 T := Case_Table (K + 1);
6589 and then Expr_Value (Case_Table (J - 1).Choice_Lo) >
6590 Expr_Value (T.Choice_Lo)
6592 Case_Table (J) := Case_Table (J - 1);
6596 Case_Table (J) := T;
6599 end Sort_Case_Table;
6601 ----------------------------
6602 -- Static_Array_Aggregate --
6603 ----------------------------
6605 function Static_Array_Aggregate (N : Node_Id) return Boolean is
6606 Bounds : constant Node_Id := Aggregate_Bounds (N);
6608 Typ : constant Entity_Id := Etype (N);
6609 Comp_Type : constant Entity_Id := Component_Type (Typ);
6616 if Is_Tagged_Type (Typ)
6617 or else Is_Controlled (Typ)
6618 or else Is_Packed (Typ)
6624 and then Nkind (Bounds) = N_Range
6625 and then Nkind (Low_Bound (Bounds)) = N_Integer_Literal
6626 and then Nkind (High_Bound (Bounds)) = N_Integer_Literal
6628 Lo := Low_Bound (Bounds);
6629 Hi := High_Bound (Bounds);
6631 if No (Component_Associations (N)) then
6633 -- Verify that all components are static integers
6635 Expr := First (Expressions (N));
6636 while Present (Expr) loop
6637 if Nkind (Expr) /= N_Integer_Literal then
6647 -- We allow only a single named association, either a static
6648 -- range or an others_clause, with a static expression.
6650 Expr := First (Component_Associations (N));
6652 if Present (Expressions (N)) then
6655 elsif Present (Next (Expr)) then
6658 elsif Present (Next (First (Choices (Expr)))) then
6662 -- The aggregate is static if all components are literals,
6663 -- or else all its components are static aggregates for the
6664 -- component type. We also limit the size of a static aggregate
6665 -- to prevent runaway static expressions.
6667 if Is_Array_Type (Comp_Type)
6668 or else Is_Record_Type (Comp_Type)
6670 if Nkind (Expression (Expr)) /= N_Aggregate
6672 not Compile_Time_Known_Aggregate (Expression (Expr))
6677 elsif Nkind (Expression (Expr)) /= N_Integer_Literal then
6681 if not Aggr_Size_OK (N, Typ) then
6685 -- Create a positional aggregate with the right number of
6686 -- copies of the expression.
6688 Agg := Make_Aggregate (Sloc (N), New_List, No_List);
6690 for I in UI_To_Int (Intval (Lo)) .. UI_To_Int (Intval (Hi))
6693 (Expressions (Agg), New_Copy (Expression (Expr)));
6695 -- The copied expression must be analyzed and resolved.
6696 -- Besides setting the type, this ensures that static
6697 -- expressions are appropriately marked as such.
6700 (Last (Expressions (Agg)), Component_Type (Typ));
6703 Set_Aggregate_Bounds (Agg, Bounds);
6704 Set_Etype (Agg, Typ);
6707 Set_Compile_Time_Known_Aggregate (N);
6716 end Static_Array_Aggregate;