1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2007, 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 Expander; use Expander;
32 with Exp_Util; use Exp_Util;
33 with Exp_Ch3; use Exp_Ch3;
34 with Exp_Ch7; use Exp_Ch7;
35 with Exp_Ch9; use Exp_Ch9;
36 with Exp_Tss; use Exp_Tss;
37 with Freeze; use Freeze;
38 with Itypes; use Itypes;
40 with Namet; use Namet;
41 with Nmake; use Nmake;
42 with Nlists; use Nlists;
44 with Restrict; use Restrict;
45 with Rident; use Rident;
46 with Rtsfind; use Rtsfind;
47 with Ttypes; use Ttypes;
49 with Sem_Ch3; use Sem_Ch3;
50 with Sem_Eval; use Sem_Eval;
51 with Sem_Res; use Sem_Res;
52 with Sem_Util; use Sem_Util;
53 with Sinfo; use Sinfo;
54 with Snames; use Snames;
55 with Stand; use Stand;
56 with Targparm; use Targparm;
57 with Tbuild; use Tbuild;
58 with Uintp; use Uintp;
60 package body Exp_Aggr is
62 type Case_Bounds is record
65 Choice_Node : Node_Id;
68 type Case_Table_Type is array (Nat range <>) of Case_Bounds;
69 -- Table type used by Check_Case_Choices procedure
72 (Obj_Type : Entity_Id;
73 Typ : Entity_Id) return Boolean;
74 -- A static array aggregate in an object declaration can in most cases be
75 -- expanded in place. The one exception is when the aggregate is given
76 -- with component associations that specify different bounds from those of
77 -- the type definition in the object declaration. In this pathological
78 -- case the aggregate must slide, and we must introduce an intermediate
79 -- temporary to hold it.
81 -- The same holds in an assignment to one-dimensional array of arrays,
82 -- when a component may be given with bounds that differ from those of the
85 procedure Sort_Case_Table (Case_Table : in out Case_Table_Type);
86 -- Sort the Case Table using the Lower Bound of each Choice as the key.
87 -- A simple insertion sort is used since the number of choices in a case
88 -- statement of variant part will usually be small and probably in near
91 function Has_Default_Init_Comps (N : Node_Id) return Boolean;
92 -- N is an aggregate (record or array). Checks the presence of default
93 -- initialization (<>) in any component (Ada 2005: AI-287)
95 function Is_Static_Dispatch_Table_Aggregate (N : Node_Id) return Boolean;
96 -- Returns true if N is an aggregate used to initialize the components
97 -- of an statically allocated dispatch table.
99 ------------------------------------------------------
100 -- Local subprograms for Record Aggregate Expansion --
101 ------------------------------------------------------
103 procedure Expand_Record_Aggregate
105 Orig_Tag : Node_Id := Empty;
106 Parent_Expr : Node_Id := Empty);
107 -- This is the top level procedure for record aggregate expansion.
108 -- Expansion for record aggregates needs expand aggregates for tagged
109 -- record types. Specifically Expand_Record_Aggregate adds the Tag
110 -- field in front of the Component_Association list that was created
111 -- during resolution by Resolve_Record_Aggregate.
113 -- N is the record aggregate node.
114 -- Orig_Tag is the value of the Tag that has to be provided for this
115 -- specific aggregate. It carries the tag corresponding to the type
116 -- of the outermost aggregate during the recursive expansion
117 -- Parent_Expr is the ancestor part of the original extension
120 procedure Convert_To_Assignments (N : Node_Id; Typ : Entity_Id);
121 -- N is an N_Aggregate or an N_Extension_Aggregate. Typ is the type of the
122 -- aggregate (which can only be a record type, this procedure is only used
123 -- for record types). Transform the given aggregate into a sequence of
124 -- assignments performed component by component.
126 function Build_Record_Aggr_Code
130 Flist : Node_Id := Empty;
131 Obj : Entity_Id := Empty;
132 Is_Limited_Ancestor_Expansion : Boolean := False) return List_Id;
133 -- N is an N_Aggregate or an N_Extension_Aggregate. Typ is the type of the
134 -- aggregate. Target is an expression containing the location on which the
135 -- component by component assignments will take place. Returns the list of
136 -- assignments plus all other adjustments needed for tagged and controlled
137 -- types. Flist is an expression representing the finalization list on
138 -- which to attach the controlled components if any. Obj is present in the
139 -- object declaration and dynamic allocation cases, it contains an entity
140 -- that allows to know if the value being created needs to be attached to
141 -- the final list in case of pragma Finalize_Storage_Only.
144 -- The meaning of the Obj formal is extremely unclear. *What* entity
145 -- should be passed? For the object declaration case we may guess that
146 -- this is the object being declared, but what about the allocator case?
148 -- Is_Limited_Ancestor_Expansion indicates that the function has been
149 -- called recursively to expand the limited ancestor to avoid copying it.
151 function Has_Mutable_Components (Typ : Entity_Id) return Boolean;
152 -- Return true if one of the component is of a discriminated type with
153 -- defaults. An aggregate for a type with mutable components must be
154 -- expanded into individual assignments.
156 procedure Initialize_Discriminants (N : Node_Id; Typ : Entity_Id);
157 -- If the type of the aggregate is a type extension with renamed discrimi-
158 -- nants, we must initialize the hidden discriminants of the parent.
159 -- Otherwise, the target object must not be initialized. The discriminants
160 -- are initialized by calling the initialization procedure for the type.
161 -- This is incorrect if the initialization of other components has any
162 -- side effects. We restrict this call to the case where the parent type
163 -- has a variant part, because this is the only case where the hidden
164 -- discriminants are accessed, namely when calling discriminant checking
165 -- functions of the parent type, and when applying a stream attribute to
166 -- an object of the derived type.
168 -----------------------------------------------------
169 -- Local Subprograms for Array Aggregate Expansion --
170 -----------------------------------------------------
172 function Aggr_Size_OK (Typ : Entity_Id) return Boolean;
173 -- Very large static aggregates present problems to the back-end, and
174 -- are transformed into assignments and loops. This function verifies
175 -- that the total number of components of an aggregate is acceptable
176 -- for transformation into a purely positional static form. It is called
177 -- prior to calling Flatten.
179 procedure Convert_Array_Aggr_In_Allocator
183 -- If the aggregate appears within an allocator and can be expanded in
184 -- place, this routine generates the individual assignments to components
185 -- of the designated object. This is an optimization over the general
186 -- case, where a temporary is first created on the stack and then used to
187 -- construct the allocated object on the heap.
189 procedure Convert_To_Positional
191 Max_Others_Replicate : Nat := 5;
192 Handle_Bit_Packed : Boolean := False);
193 -- If possible, convert named notation to positional notation. This
194 -- conversion is possible only in some static cases. If the conversion is
195 -- possible, then N is rewritten with the analyzed converted aggregate.
196 -- The parameter Max_Others_Replicate controls the maximum number of
197 -- values corresponding to an others choice that will be converted to
198 -- positional notation (the default of 5 is the normal limit, and reflects
199 -- the fact that normally the loop is better than a lot of separate
200 -- assignments). Note that this limit gets overridden in any case if
201 -- either of the restrictions No_Elaboration_Code or No_Implicit_Loops is
202 -- set. The parameter Handle_Bit_Packed is usually set False (since we do
203 -- not expect the back end to handle bit packed arrays, so the normal case
204 -- of conversion is pointless), but in the special case of a call from
205 -- Packed_Array_Aggregate_Handled, we set this parameter to True, since
206 -- these are cases we handle in there.
208 procedure Expand_Array_Aggregate (N : Node_Id);
209 -- This is the top-level routine to perform array aggregate expansion.
210 -- N is the N_Aggregate node to be expanded.
212 function Backend_Processing_Possible (N : Node_Id) return Boolean;
213 -- This function checks if array aggregate N can be processed directly
214 -- by Gigi. If this is the case True is returned.
216 function Build_Array_Aggr_Code
221 Scalar_Comp : Boolean;
222 Indices : List_Id := No_List;
223 Flist : Node_Id := Empty) return List_Id;
224 -- This recursive routine returns a list of statements containing the
225 -- loops and assignments that are needed for the expansion of the array
228 -- N is the (sub-)aggregate node to be expanded into code. This node
229 -- has been fully analyzed, and its Etype is properly set.
231 -- Index is the index node corresponding to the array sub-aggregate N.
233 -- Into is the target expression into which we are copying the aggregate.
234 -- Note that this node may not have been analyzed yet, and so the Etype
235 -- field may not be set.
237 -- Scalar_Comp is True if the component type of the aggregate is scalar.
239 -- Indices is the current list of expressions used to index the
240 -- object we are writing into.
242 -- Flist is an expression representing the finalization list on which
243 -- to attach the controlled components if any.
245 function Number_Of_Choices (N : Node_Id) return Nat;
246 -- Returns the number of discrete choices (not including the others choice
247 -- if present) contained in (sub-)aggregate N.
249 function Late_Expansion
253 Flist : Node_Id := Empty;
254 Obj : Entity_Id := Empty) return List_Id;
255 -- N is a nested (record or array) aggregate that has been marked with
256 -- 'Delay_Expansion'. Typ is the expected type of the aggregate and Target
257 -- is a (duplicable) expression that will hold the result of the aggregate
258 -- expansion. Flist is the finalization list to be used to attach
259 -- controlled components. 'Obj' when non empty, carries the original
260 -- object being initialized in order to know if it needs to be attached to
261 -- the previous parameter which may not be the case in the case where
262 -- Finalize_Storage_Only is set. Basically this procedure is used to
263 -- implement top-down expansions of nested aggregates. This is necessary
264 -- for avoiding temporaries at each level as well as for propagating the
265 -- right internal finalization list.
267 function Make_OK_Assignment_Statement
270 Expression : Node_Id) return Node_Id;
271 -- This is like Make_Assignment_Statement, except that Assignment_OK
272 -- is set in the left operand. All assignments built by this unit
273 -- use this routine. This is needed to deal with assignments to
274 -- initialized constants that are done in place.
276 function Packed_Array_Aggregate_Handled (N : Node_Id) return Boolean;
277 -- Given an array aggregate, this function handles the case of a packed
278 -- array aggregate with all constant values, where the aggregate can be
279 -- evaluated at compile time. If this is possible, then N is rewritten
280 -- to be its proper compile time value with all the components properly
281 -- assembled. The expression is analyzed and resolved and True is
282 -- returned. If this transformation is not possible, N is unchanged
283 -- and False is returned
285 function Safe_Slice_Assignment (N : Node_Id) return Boolean;
286 -- If a slice assignment has an aggregate with a single others_choice,
287 -- the assignment can be done in place even if bounds are not static,
288 -- by converting it into a loop over the discrete range of the slice.
294 function Aggr_Size_OK (Typ : Entity_Id) return Boolean is
302 -- The following constant determines the maximum size of an
303 -- aggregate produced by converting named to positional
304 -- notation (e.g. from others clauses). This avoids running
305 -- away with attempts to convert huge aggregates, which hit
306 -- memory limits in the backend.
308 -- The normal limit is 5000, but we increase this limit to
309 -- 2**24 (about 16 million) if Restrictions (No_Elaboration_Code)
310 -- or Restrictions (No_Implicit_Loops) is specified, since in
311 -- either case, we are at risk of declaring the program illegal
312 -- because of this limit.
314 Max_Aggr_Size : constant Nat :=
315 5000 + (2 ** 24 - 5000) *
317 (Restriction_Active (No_Elaboration_Code)
319 Restriction_Active (No_Implicit_Loops));
321 function Component_Count (T : Entity_Id) return Int;
322 -- The limit is applied to the total number of components that the
323 -- aggregate will have, which is the number of static expressions
324 -- that will appear in the flattened array. This requires a recursive
325 -- computation of the the number of scalar components of the structure.
327 ---------------------
328 -- Component_Count --
329 ---------------------
331 function Component_Count (T : Entity_Id) return Int is
336 if Is_Scalar_Type (T) then
339 elsif Is_Record_Type (T) then
340 Comp := First_Component (T);
341 while Present (Comp) loop
342 Res := Res + Component_Count (Etype (Comp));
343 Next_Component (Comp);
348 elsif Is_Array_Type (T) then
350 Lo : constant Node_Id :=
351 Type_Low_Bound (Etype (First_Index (T)));
352 Hi : constant Node_Id :=
353 Type_High_Bound (Etype (First_Index (T)));
355 Siz : constant Int := Component_Count (Component_Type (T));
358 if not Compile_Time_Known_Value (Lo)
359 or else not Compile_Time_Known_Value (Hi)
364 Siz * UI_To_Int (Expr_Value (Hi) - Expr_Value (Lo) + 1);
369 -- Can only be a null for an access type
375 -- Start of processing for Aggr_Size_OK
378 Siz := Component_Count (Component_Type (Typ));
380 Indx := First_Index (Typ);
381 while Present (Indx) loop
382 Lo := Type_Low_Bound (Etype (Indx));
383 Hi := Type_High_Bound (Etype (Indx));
385 -- Bounds need to be known at compile time
387 if not Compile_Time_Known_Value (Lo)
388 or else not Compile_Time_Known_Value (Hi)
393 Lov := Expr_Value (Lo);
394 Hiv := Expr_Value (Hi);
396 -- A flat array is always safe
403 Rng : constant Uint := Hiv - Lov + 1;
406 -- Check if size is too large
408 if not UI_Is_In_Int_Range (Rng) then
412 Siz := Siz * UI_To_Int (Rng);
416 or else Siz > Max_Aggr_Size
421 -- Bounds must be in integer range, for later array construction
423 if not UI_Is_In_Int_Range (Lov)
425 not UI_Is_In_Int_Range (Hiv)
436 ---------------------------------
437 -- Backend_Processing_Possible --
438 ---------------------------------
440 -- Backend processing by Gigi/gcc is possible only if all the following
441 -- conditions are met:
443 -- 1. N is fully positional
445 -- 2. N is not a bit-packed array aggregate;
447 -- 3. The size of N's array type must be known at compile time. Note
448 -- that this implies that the component size is also known
450 -- 4. The array type of N does not follow the Fortran layout convention
451 -- or if it does it must be 1 dimensional.
453 -- 5. The array component type may not be tagged (which could necessitate
454 -- reassignment of proper tags).
456 -- 6. The array component type must not have unaligned bit components
458 -- 7. None of the components of the aggregate may be bit unaligned
461 -- 8. There cannot be delayed components, since we do not know enough
462 -- at this stage to know if back end processing is possible.
464 -- 9. There cannot be any discriminated record components, since the
465 -- back end cannot handle this complex case.
467 function Backend_Processing_Possible (N : Node_Id) return Boolean is
468 Typ : constant Entity_Id := Etype (N);
469 -- Typ is the correct constrained array subtype of the aggregate
471 function Component_Check (N : Node_Id; Index : Node_Id) return Boolean;
472 -- This routine checks components of aggregate N, enforcing checks
473 -- 1, 7, 8, and 9. In the multi-dimensional case, these checks are
474 -- performed on subaggregates. The Index value is the current index
475 -- being checked in the multi-dimensional case.
477 ---------------------
478 -- Component_Check --
479 ---------------------
481 function Component_Check (N : Node_Id; Index : Node_Id) return Boolean is
485 -- Checks 1: (no component associations)
487 if Present (Component_Associations (N)) then
491 -- Checks on components
493 -- Recurse to check subaggregates, which may appear in qualified
494 -- expressions. If delayed, the front-end will have to expand.
495 -- If the component is a discriminated record, treat as non-static,
496 -- as the back-end cannot handle this properly.
498 Expr := First (Expressions (N));
499 while Present (Expr) loop
501 -- Checks 8: (no delayed components)
503 if Is_Delayed_Aggregate (Expr) then
507 -- Checks 9: (no discriminated records)
509 if Present (Etype (Expr))
510 and then Is_Record_Type (Etype (Expr))
511 and then Has_Discriminants (Etype (Expr))
516 -- Checks 7. Component must not be bit aligned component
518 if Possible_Bit_Aligned_Component (Expr) then
522 -- Recursion to following indexes for multiple dimension case
524 if Present (Next_Index (Index))
525 and then not Component_Check (Expr, Next_Index (Index))
530 -- All checks for that component finished, on to next
538 -- Start of processing for Backend_Processing_Possible
541 -- Checks 2 (array must not be bit packed)
543 if Is_Bit_Packed_Array (Typ) then
547 -- Checks 4 (array must not be multi-dimensional Fortran case)
549 if Convention (Typ) = Convention_Fortran
550 and then Number_Dimensions (Typ) > 1
555 -- Checks 3 (size of array must be known at compile time)
557 if not Size_Known_At_Compile_Time (Typ) then
561 -- Checks on components
563 if not Component_Check (N, First_Index (Typ)) then
567 -- Checks 5 (if the component type is tagged, then we may need to do
568 -- tag adjustments. Perhaps this should be refined to check for any
569 -- component associations that actually need tag adjustment, similar
570 -- to the test in Component_Not_OK_For_Backend for record aggregates
571 -- with tagged components, but not clear whether it's worthwhile ???;
572 -- in the case of the JVM, object tags are handled implicitly)
574 if Is_Tagged_Type (Component_Type (Typ)) and then VM_Target = No_VM then
578 -- Checks 6 (component type must not have bit aligned components)
580 if Type_May_Have_Bit_Aligned_Components (Component_Type (Typ)) then
584 -- Backend processing is possible
586 Set_Size_Known_At_Compile_Time (Etype (N), True);
588 end Backend_Processing_Possible;
590 ---------------------------
591 -- Build_Array_Aggr_Code --
592 ---------------------------
594 -- The code that we generate from a one dimensional aggregate is
596 -- 1. If the sub-aggregate contains discrete choices we
598 -- (a) Sort the discrete choices
600 -- (b) Otherwise for each discrete choice that specifies a range we
601 -- emit a loop. If a range specifies a maximum of three values, or
602 -- we are dealing with an expression we emit a sequence of
603 -- assignments instead of a loop.
605 -- (c) Generate the remaining loops to cover the others choice if any
607 -- 2. If the aggregate contains positional elements we
609 -- (a) translate the positional elements in a series of assignments
611 -- (b) Generate a final loop to cover the others choice if any.
612 -- Note that this final loop has to be a while loop since the case
614 -- L : Integer := Integer'Last;
615 -- H : Integer := Integer'Last;
616 -- A : array (L .. H) := (1, others =>0);
618 -- cannot be handled by a for loop. Thus for the following
620 -- array (L .. H) := (.. positional elements.., others =>E);
622 -- we always generate something like:
624 -- J : Index_Type := Index_Of_Last_Positional_Element;
626 -- J := Index_Base'Succ (J)
630 function Build_Array_Aggr_Code
635 Scalar_Comp : Boolean;
636 Indices : List_Id := No_List;
637 Flist : Node_Id := Empty) return List_Id
639 Loc : constant Source_Ptr := Sloc (N);
640 Index_Base : constant Entity_Id := Base_Type (Etype (Index));
641 Index_Base_L : constant Node_Id := Type_Low_Bound (Index_Base);
642 Index_Base_H : constant Node_Id := Type_High_Bound (Index_Base);
644 function Add (Val : Int; To : Node_Id) return Node_Id;
645 -- Returns an expression where Val is added to expression To, unless
646 -- To+Val is provably out of To's base type range. To must be an
647 -- already analyzed expression.
649 function Empty_Range (L, H : Node_Id) return Boolean;
650 -- Returns True if the range defined by L .. H is certainly empty
652 function Equal (L, H : Node_Id) return Boolean;
653 -- Returns True if L = H for sure
655 function Index_Base_Name return Node_Id;
656 -- Returns a new reference to the index type name
658 function Gen_Assign (Ind : Node_Id; Expr : Node_Id) return List_Id;
659 -- Ind must be a side-effect free expression. If the input aggregate
660 -- N to Build_Loop contains no sub-aggregates, then this function
661 -- returns the assignment statement:
663 -- Into (Indices, Ind) := Expr;
665 -- Otherwise we call Build_Code recursively
667 -- Ada 2005 (AI-287): In case of default initialized component, Expr
668 -- is empty and we generate a call to the corresponding IP subprogram.
670 function Gen_Loop (L, H : Node_Id; Expr : Node_Id) return List_Id;
671 -- Nodes L and H must be side-effect free expressions.
672 -- If the input aggregate N to Build_Loop contains no sub-aggregates,
673 -- This routine returns the for loop statement
675 -- for J in Index_Base'(L) .. Index_Base'(H) loop
676 -- Into (Indices, J) := Expr;
679 -- Otherwise we call Build_Code recursively.
680 -- As an optimization if the loop covers 3 or less scalar elements we
681 -- generate a sequence of assignments.
683 function Gen_While (L, H : Node_Id; Expr : Node_Id) return List_Id;
684 -- Nodes L and H must be side-effect free expressions.
685 -- If the input aggregate N to Build_Loop contains no sub-aggregates,
686 -- This routine returns the while loop statement
688 -- J : Index_Base := L;
690 -- J := Index_Base'Succ (J);
691 -- Into (Indices, J) := Expr;
694 -- Otherwise we call Build_Code recursively
696 function Local_Compile_Time_Known_Value (E : Node_Id) return Boolean;
697 function Local_Expr_Value (E : Node_Id) return Uint;
698 -- These two Local routines are used to replace the corresponding ones
699 -- in sem_eval because while processing the bounds of an aggregate with
700 -- discrete choices whose index type is an enumeration, we build static
701 -- expressions not recognized by Compile_Time_Known_Value as such since
702 -- they have not yet been analyzed and resolved. All the expressions in
703 -- question are things like Index_Base_Name'Val (Const) which we can
704 -- easily recognize as being constant.
710 function Add (Val : Int; To : Node_Id) return Node_Id is
715 U_Val : constant Uint := UI_From_Int (Val);
718 -- Note: do not try to optimize the case of Val = 0, because
719 -- we need to build a new node with the proper Sloc value anyway.
721 -- First test if we can do constant folding
723 if Local_Compile_Time_Known_Value (To) then
724 U_To := Local_Expr_Value (To) + Val;
726 -- Determine if our constant is outside the range of the index.
727 -- If so return an Empty node. This empty node will be caught
728 -- by Empty_Range below.
730 if Compile_Time_Known_Value (Index_Base_L)
731 and then U_To < Expr_Value (Index_Base_L)
735 elsif Compile_Time_Known_Value (Index_Base_H)
736 and then U_To > Expr_Value (Index_Base_H)
741 Expr_Pos := Make_Integer_Literal (Loc, U_To);
742 Set_Is_Static_Expression (Expr_Pos);
744 if not Is_Enumeration_Type (Index_Base) then
747 -- If we are dealing with enumeration return
748 -- Index_Base'Val (Expr_Pos)
752 Make_Attribute_Reference
754 Prefix => Index_Base_Name,
755 Attribute_Name => Name_Val,
756 Expressions => New_List (Expr_Pos));
762 -- If we are here no constant folding possible
764 if not Is_Enumeration_Type (Index_Base) then
767 Left_Opnd => Duplicate_Subexpr (To),
768 Right_Opnd => Make_Integer_Literal (Loc, U_Val));
770 -- If we are dealing with enumeration return
771 -- Index_Base'Val (Index_Base'Pos (To) + Val)
775 Make_Attribute_Reference
777 Prefix => Index_Base_Name,
778 Attribute_Name => Name_Pos,
779 Expressions => New_List (Duplicate_Subexpr (To)));
784 Right_Opnd => Make_Integer_Literal (Loc, U_Val));
787 Make_Attribute_Reference
789 Prefix => Index_Base_Name,
790 Attribute_Name => Name_Val,
791 Expressions => New_List (Expr_Pos));
801 function Empty_Range (L, H : Node_Id) return Boolean is
802 Is_Empty : Boolean := False;
807 -- First check if L or H were already detected as overflowing the
808 -- index base range type by function Add above. If this is so Add
809 -- returns the empty node.
811 if No (L) or else No (H) then
818 -- L > H range is empty
824 -- B_L > H range must be empty
830 -- L > B_H range must be empty
834 High := Index_Base_H;
837 if Local_Compile_Time_Known_Value (Low)
838 and then Local_Compile_Time_Known_Value (High)
841 UI_Gt (Local_Expr_Value (Low), Local_Expr_Value (High));
854 function Equal (L, H : Node_Id) return Boolean is
859 elsif Local_Compile_Time_Known_Value (L)
860 and then Local_Compile_Time_Known_Value (H)
862 return UI_Eq (Local_Expr_Value (L), Local_Expr_Value (H));
872 function Gen_Assign (Ind : Node_Id; Expr : Node_Id) return List_Id is
873 L : constant List_Id := New_List;
877 New_Indices : List_Id;
878 Indexed_Comp : Node_Id;
880 Comp_Type : Entity_Id := Empty;
882 function Add_Loop_Actions (Lis : List_Id) return List_Id;
883 -- Collect insert_actions generated in the construction of a
884 -- loop, and prepend them to the sequence of assignments to
885 -- complete the eventual body of the loop.
887 ----------------------
888 -- Add_Loop_Actions --
889 ----------------------
891 function Add_Loop_Actions (Lis : List_Id) return List_Id is
895 -- Ada 2005 (AI-287): Do nothing else in case of default
896 -- initialized component.
901 elsif Nkind (Parent (Expr)) = N_Component_Association
902 and then Present (Loop_Actions (Parent (Expr)))
904 Append_List (Lis, Loop_Actions (Parent (Expr)));
905 Res := Loop_Actions (Parent (Expr));
906 Set_Loop_Actions (Parent (Expr), No_List);
912 end Add_Loop_Actions;
914 -- Start of processing for Gen_Assign
918 New_Indices := New_List;
920 New_Indices := New_Copy_List_Tree (Indices);
923 Append_To (New_Indices, Ind);
925 if Present (Flist) then
926 F := New_Copy_Tree (Flist);
928 elsif Present (Etype (N)) and then Controlled_Type (Etype (N)) then
929 if Is_Entity_Name (Into)
930 and then Present (Scope (Entity (Into)))
932 F := Find_Final_List (Scope (Entity (Into)));
934 F := Find_Final_List (Current_Scope);
940 if Present (Next_Index (Index)) then
943 Build_Array_Aggr_Code
946 Index => Next_Index (Index),
948 Scalar_Comp => Scalar_Comp,
949 Indices => New_Indices,
953 -- If we get here then we are at a bottom-level (sub-)aggregate
957 (Make_Indexed_Component (Loc,
958 Prefix => New_Copy_Tree (Into),
959 Expressions => New_Indices));
961 Set_Assignment_OK (Indexed_Comp);
963 -- Ada 2005 (AI-287): In case of default initialized component, Expr
964 -- is not present (and therefore we also initialize Expr_Q to empty).
968 elsif Nkind (Expr) = N_Qualified_Expression then
969 Expr_Q := Expression (Expr);
974 if Present (Etype (N))
975 and then Etype (N) /= Any_Composite
977 Comp_Type := Component_Type (Etype (N));
978 pragma Assert (Comp_Type = Ctype); -- AI-287
980 elsif Present (Next (First (New_Indices))) then
982 -- Ada 2005 (AI-287): Do nothing in case of default initialized
983 -- component because we have received the component type in
984 -- the formal parameter Ctype.
986 -- ??? Some assert pragmas have been added to check if this new
987 -- formal can be used to replace this code in all cases.
989 if Present (Expr) then
991 -- This is a multidimensional array. Recover the component
992 -- type from the outermost aggregate, because subaggregates
993 -- do not have an assigned type.
1000 while Present (P) loop
1001 if Nkind (P) = N_Aggregate
1002 and then Present (Etype (P))
1004 Comp_Type := Component_Type (Etype (P));
1012 pragma Assert (Comp_Type = Ctype); -- AI-287
1017 -- Ada 2005 (AI-287): We only analyze the expression in case of non-
1018 -- default initialized components (otherwise Expr_Q is not present).
1021 and then (Nkind (Expr_Q) = N_Aggregate
1022 or else Nkind (Expr_Q) = N_Extension_Aggregate)
1024 -- At this stage the Expression may not have been
1025 -- analyzed yet because the array aggregate code has not
1026 -- been updated to use the Expansion_Delayed flag and
1027 -- avoid analysis altogether to solve the same problem
1028 -- (see Resolve_Aggr_Expr). So let us do the analysis of
1029 -- non-array aggregates now in order to get the value of
1030 -- Expansion_Delayed flag for the inner aggregate ???
1032 if Present (Comp_Type) and then not Is_Array_Type (Comp_Type) then
1033 Analyze_And_Resolve (Expr_Q, Comp_Type);
1036 if Is_Delayed_Aggregate (Expr_Q) then
1038 -- This is either a subaggregate of a multidimentional array,
1039 -- or a component of an array type whose component type is
1040 -- also an array. In the latter case, the expression may have
1041 -- component associations that provide different bounds from
1042 -- those of the component type, and sliding must occur. Instead
1043 -- of decomposing the current aggregate assignment, force the
1044 -- re-analysis of the assignment, so that a temporary will be
1045 -- generated in the usual fashion, and sliding will take place.
1047 if Nkind (Parent (N)) = N_Assignment_Statement
1048 and then Is_Array_Type (Comp_Type)
1049 and then Present (Component_Associations (Expr_Q))
1050 and then Must_Slide (Comp_Type, Etype (Expr_Q))
1052 Set_Expansion_Delayed (Expr_Q, False);
1053 Set_Analyzed (Expr_Q, False);
1059 Expr_Q, Etype (Expr_Q), Indexed_Comp, F));
1064 -- Ada 2005 (AI-287): In case of default initialized component, call
1065 -- the initialization subprogram associated with the component type.
1066 -- If the component type is an access type, add an explicit null
1067 -- assignment, because for the back-end there is an initialization
1068 -- present for the whole aggregate, and no default initialization
1071 -- In addition, if the component type is controlled, we must call
1072 -- its Initialize procedure explicitly, because there is no explicit
1073 -- object creation that will invoke it otherwise.
1076 if Present (Base_Init_Proc (Base_Type (Ctype)))
1077 or else Has_Task (Base_Type (Ctype))
1080 Build_Initialization_Call (Loc,
1081 Id_Ref => Indexed_Comp,
1083 With_Default_Init => True));
1085 elsif Is_Access_Type (Ctype) then
1087 Make_Assignment_Statement (Loc,
1088 Name => Indexed_Comp,
1089 Expression => Make_Null (Loc)));
1092 if Controlled_Type (Ctype) then
1095 Ref => New_Copy_Tree (Indexed_Comp),
1097 Flist_Ref => Find_Final_List (Current_Scope),
1098 With_Attach => Make_Integer_Literal (Loc, 1)));
1102 -- Now generate the assignment with no associated controlled
1103 -- actions since the target of the assignment may not have been
1104 -- initialized, it is not possible to Finalize it as expected by
1105 -- normal controlled assignment. The rest of the controlled
1106 -- actions are done manually with the proper finalization list
1107 -- coming from the context.
1110 Make_OK_Assignment_Statement (Loc,
1111 Name => Indexed_Comp,
1112 Expression => New_Copy_Tree (Expr));
1114 if Present (Comp_Type) and then Controlled_Type (Comp_Type) then
1115 Set_No_Ctrl_Actions (A);
1117 -- If this is an aggregate for an array of arrays, each
1118 -- sub-aggregate will be expanded as well, and even with
1119 -- No_Ctrl_Actions the assignments of inner components will
1120 -- require attachment in their assignments to temporaries.
1121 -- These temporaries must be finalized for each subaggregate,
1122 -- to prevent multiple attachments of the same temporary
1123 -- location to same finalization chain (and consequently
1124 -- circular lists). To ensure that finalization takes place
1125 -- for each subaggregate we wrap the assignment in a block.
1127 if Is_Array_Type (Comp_Type)
1128 and then Nkind (Expr) = N_Aggregate
1131 Make_Block_Statement (Loc,
1132 Handled_Statement_Sequence =>
1133 Make_Handled_Sequence_Of_Statements (Loc,
1134 Statements => New_List (A)));
1140 -- Adjust the tag if tagged (because of possible view
1141 -- conversions), unless compiling for the Java VM where
1142 -- tags are implicit.
1144 if Present (Comp_Type)
1145 and then Is_Tagged_Type (Comp_Type)
1146 and then VM_Target = No_VM
1149 Make_OK_Assignment_Statement (Loc,
1151 Make_Selected_Component (Loc,
1152 Prefix => New_Copy_Tree (Indexed_Comp),
1155 (First_Tag_Component (Comp_Type), Loc)),
1158 Unchecked_Convert_To (RTE (RE_Tag),
1160 (Node (First_Elmt (Access_Disp_Table (Comp_Type))),
1166 -- Adjust and attach the component to the proper final list, which
1167 -- can be the controller of the outer record object or the final
1168 -- list associated with the scope.
1170 -- If the component is itself an array of controlled types, whose
1171 -- value is given by a sub-aggregate, then the attach calls have
1172 -- been generated when individual subcomponent are assigned, and
1173 -- and must not be done again to prevent malformed finalization
1174 -- chains (see comments above, concerning the creation of a block
1175 -- to hold inner finalization actions).
1177 if Present (Comp_Type)
1178 and then Controlled_Type (Comp_Type)
1179 and then not Is_Limited_Type (Comp_Type)
1181 (not Is_Array_Type (Comp_Type)
1182 or else not Is_Controlled (Component_Type (Comp_Type))
1183 or else Nkind (Expr) /= N_Aggregate)
1187 Ref => New_Copy_Tree (Indexed_Comp),
1190 With_Attach => Make_Integer_Literal (Loc, 1)));
1194 return Add_Loop_Actions (L);
1201 function Gen_Loop (L, H : Node_Id; Expr : Node_Id) return List_Id is
1205 -- Index_Base'(L) .. Index_Base'(H)
1207 L_Iteration_Scheme : Node_Id;
1208 -- L_J in Index_Base'(L) .. Index_Base'(H)
1211 -- The statements to execute in the loop
1213 S : constant List_Id := New_List;
1214 -- List of statements
1217 -- Copy of expression tree, used for checking purposes
1220 -- If loop bounds define an empty range return the null statement
1222 if Empty_Range (L, H) then
1223 Append_To (S, Make_Null_Statement (Loc));
1225 -- Ada 2005 (AI-287): Nothing else need to be done in case of
1226 -- default initialized component.
1232 -- The expression must be type-checked even though no component
1233 -- of the aggregate will have this value. This is done only for
1234 -- actual components of the array, not for subaggregates. Do
1235 -- the check on a copy, because the expression may be shared
1236 -- among several choices, some of which might be non-null.
1238 if Present (Etype (N))
1239 and then Is_Array_Type (Etype (N))
1240 and then No (Next_Index (Index))
1242 Expander_Mode_Save_And_Set (False);
1243 Tcopy := New_Copy_Tree (Expr);
1244 Set_Parent (Tcopy, N);
1245 Analyze_And_Resolve (Tcopy, Component_Type (Etype (N)));
1246 Expander_Mode_Restore;
1252 -- If loop bounds are the same then generate an assignment
1254 elsif Equal (L, H) then
1255 return Gen_Assign (New_Copy_Tree (L), Expr);
1257 -- If H - L <= 2 then generate a sequence of assignments when we are
1258 -- processing the bottom most aggregate and it contains scalar
1261 elsif No (Next_Index (Index))
1262 and then Scalar_Comp
1263 and then Local_Compile_Time_Known_Value (L)
1264 and then Local_Compile_Time_Known_Value (H)
1265 and then Local_Expr_Value (H) - Local_Expr_Value (L) <= 2
1268 Append_List_To (S, Gen_Assign (New_Copy_Tree (L), Expr));
1269 Append_List_To (S, Gen_Assign (Add (1, To => L), Expr));
1271 if Local_Expr_Value (H) - Local_Expr_Value (L) = 2 then
1272 Append_List_To (S, Gen_Assign (Add (2, To => L), Expr));
1278 -- Otherwise construct the loop, starting with the loop index L_J
1280 L_J := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
1282 -- Construct "L .. H"
1287 Low_Bound => Make_Qualified_Expression
1289 Subtype_Mark => Index_Base_Name,
1291 High_Bound => Make_Qualified_Expression
1293 Subtype_Mark => Index_Base_Name,
1296 -- Construct "for L_J in Index_Base range L .. H"
1298 L_Iteration_Scheme :=
1299 Make_Iteration_Scheme
1301 Loop_Parameter_Specification =>
1302 Make_Loop_Parameter_Specification
1304 Defining_Identifier => L_J,
1305 Discrete_Subtype_Definition => L_Range));
1307 -- Construct the statements to execute in the loop body
1309 L_Body := Gen_Assign (New_Reference_To (L_J, Loc), Expr);
1311 -- Construct the final loop
1313 Append_To (S, Make_Implicit_Loop_Statement
1315 Identifier => Empty,
1316 Iteration_Scheme => L_Iteration_Scheme,
1317 Statements => L_Body));
1319 -- A small optimization: if the aggregate is initialized with a box
1320 -- and the component type has no initialization procedure, remove the
1321 -- useless empty loop.
1323 if Nkind (First (S)) = N_Loop_Statement
1324 and then Is_Empty_List (Statements (First (S)))
1326 return New_List (Make_Null_Statement (Loc));
1336 -- The code built is
1338 -- W_J : Index_Base := L;
1339 -- while W_J < H loop
1340 -- W_J := Index_Base'Succ (W);
1344 function Gen_While (L, H : Node_Id; Expr : Node_Id) return List_Id is
1348 -- W_J : Base_Type := L;
1350 W_Iteration_Scheme : Node_Id;
1353 W_Index_Succ : Node_Id;
1354 -- Index_Base'Succ (J)
1356 W_Increment : Node_Id;
1357 -- W_J := Index_Base'Succ (W)
1359 W_Body : constant List_Id := New_List;
1360 -- The statements to execute in the loop
1362 S : constant List_Id := New_List;
1363 -- list of statement
1366 -- If loop bounds define an empty range or are equal return null
1368 if Empty_Range (L, H) or else Equal (L, H) then
1369 Append_To (S, Make_Null_Statement (Loc));
1373 -- Build the decl of W_J
1375 W_J := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
1377 Make_Object_Declaration
1379 Defining_Identifier => W_J,
1380 Object_Definition => Index_Base_Name,
1383 -- Theoretically we should do a New_Copy_Tree (L) here, but we know
1384 -- that in this particular case L is a fresh Expr generated by
1385 -- Add which we are the only ones to use.
1387 Append_To (S, W_Decl);
1389 -- Construct " while W_J < H"
1391 W_Iteration_Scheme :=
1392 Make_Iteration_Scheme
1394 Condition => Make_Op_Lt
1396 Left_Opnd => New_Reference_To (W_J, Loc),
1397 Right_Opnd => New_Copy_Tree (H)));
1399 -- Construct the statements to execute in the loop body
1402 Make_Attribute_Reference
1404 Prefix => Index_Base_Name,
1405 Attribute_Name => Name_Succ,
1406 Expressions => New_List (New_Reference_To (W_J, Loc)));
1409 Make_OK_Assignment_Statement
1411 Name => New_Reference_To (W_J, Loc),
1412 Expression => W_Index_Succ);
1414 Append_To (W_Body, W_Increment);
1415 Append_List_To (W_Body,
1416 Gen_Assign (New_Reference_To (W_J, Loc), Expr));
1418 -- Construct the final loop
1420 Append_To (S, Make_Implicit_Loop_Statement
1422 Identifier => Empty,
1423 Iteration_Scheme => W_Iteration_Scheme,
1424 Statements => W_Body));
1429 ---------------------
1430 -- Index_Base_Name --
1431 ---------------------
1433 function Index_Base_Name return Node_Id is
1435 return New_Reference_To (Index_Base, Sloc (N));
1436 end Index_Base_Name;
1438 ------------------------------------
1439 -- Local_Compile_Time_Known_Value --
1440 ------------------------------------
1442 function Local_Compile_Time_Known_Value (E : Node_Id) return Boolean is
1444 return Compile_Time_Known_Value (E)
1446 (Nkind (E) = N_Attribute_Reference
1447 and then Attribute_Name (E) = Name_Val
1448 and then Compile_Time_Known_Value (First (Expressions (E))));
1449 end Local_Compile_Time_Known_Value;
1451 ----------------------
1452 -- Local_Expr_Value --
1453 ----------------------
1455 function Local_Expr_Value (E : Node_Id) return Uint is
1457 if Compile_Time_Known_Value (E) then
1458 return Expr_Value (E);
1460 return Expr_Value (First (Expressions (E)));
1462 end Local_Expr_Value;
1464 -- Build_Array_Aggr_Code Variables
1471 Others_Expr : Node_Id := Empty;
1472 Others_Box_Present : Boolean := False;
1474 Aggr_L : constant Node_Id := Low_Bound (Aggregate_Bounds (N));
1475 Aggr_H : constant Node_Id := High_Bound (Aggregate_Bounds (N));
1476 -- The aggregate bounds of this specific sub-aggregate. Note that if
1477 -- the code generated by Build_Array_Aggr_Code is executed then these
1478 -- bounds are OK. Otherwise a Constraint_Error would have been raised.
1480 Aggr_Low : constant Node_Id := Duplicate_Subexpr_No_Checks (Aggr_L);
1481 Aggr_High : constant Node_Id := Duplicate_Subexpr_No_Checks (Aggr_H);
1482 -- After Duplicate_Subexpr these are side-effect free
1487 Nb_Choices : Nat := 0;
1488 Table : Case_Table_Type (1 .. Number_Of_Choices (N));
1489 -- Used to sort all the different choice values
1492 -- Number of elements in the positional aggregate
1494 New_Code : constant List_Id := New_List;
1496 -- Start of processing for Build_Array_Aggr_Code
1499 -- First before we start, a special case. if we have a bit packed
1500 -- array represented as a modular type, then clear the value to
1501 -- zero first, to ensure that unused bits are properly cleared.
1506 and then Is_Bit_Packed_Array (Typ)
1507 and then Is_Modular_Integer_Type (Packed_Array_Type (Typ))
1509 Append_To (New_Code,
1510 Make_Assignment_Statement (Loc,
1511 Name => New_Copy_Tree (Into),
1513 Unchecked_Convert_To (Typ,
1514 Make_Integer_Literal (Loc, Uint_0))));
1517 -- STEP 1: Process component associations
1519 -- For those associations that may generate a loop, initialize
1520 -- Loop_Actions to collect inserted actions that may be crated.
1522 -- Skip this if no component associations
1524 if No (Expressions (N)) then
1526 -- STEP 1 (a): Sort the discrete choices
1528 Assoc := First (Component_Associations (N));
1529 while Present (Assoc) loop
1530 Choice := First (Choices (Assoc));
1531 while Present (Choice) loop
1532 if Nkind (Choice) = N_Others_Choice then
1533 Set_Loop_Actions (Assoc, New_List);
1535 if Box_Present (Assoc) then
1536 Others_Box_Present := True;
1538 Others_Expr := Expression (Assoc);
1543 Get_Index_Bounds (Choice, Low, High);
1546 Set_Loop_Actions (Assoc, New_List);
1549 Nb_Choices := Nb_Choices + 1;
1550 if Box_Present (Assoc) then
1551 Table (Nb_Choices) := (Choice_Lo => Low,
1553 Choice_Node => Empty);
1555 Table (Nb_Choices) := (Choice_Lo => Low,
1557 Choice_Node => Expression (Assoc));
1565 -- If there is more than one set of choices these must be static
1566 -- and we can therefore sort them. Remember that Nb_Choices does not
1567 -- account for an others choice.
1569 if Nb_Choices > 1 then
1570 Sort_Case_Table (Table);
1573 -- STEP 1 (b): take care of the whole set of discrete choices
1575 for J in 1 .. Nb_Choices loop
1576 Low := Table (J).Choice_Lo;
1577 High := Table (J).Choice_Hi;
1578 Expr := Table (J).Choice_Node;
1579 Append_List (Gen_Loop (Low, High, Expr), To => New_Code);
1582 -- STEP 1 (c): generate the remaining loops to cover others choice
1583 -- We don't need to generate loops over empty gaps, but if there is
1584 -- a single empty range we must analyze the expression for semantics
1586 if Present (Others_Expr) or else Others_Box_Present then
1588 First : Boolean := True;
1591 for J in 0 .. Nb_Choices loop
1595 Low := Add (1, To => Table (J).Choice_Hi);
1598 if J = Nb_Choices then
1601 High := Add (-1, To => Table (J + 1).Choice_Lo);
1604 -- If this is an expansion within an init proc, make
1605 -- sure that discriminant references are replaced by
1606 -- the corresponding discriminal.
1608 if Inside_Init_Proc then
1609 if Is_Entity_Name (Low)
1610 and then Ekind (Entity (Low)) = E_Discriminant
1612 Set_Entity (Low, Discriminal (Entity (Low)));
1615 if Is_Entity_Name (High)
1616 and then Ekind (Entity (High)) = E_Discriminant
1618 Set_Entity (High, Discriminal (Entity (High)));
1623 or else not Empty_Range (Low, High)
1627 (Gen_Loop (Low, High, Others_Expr), To => New_Code);
1633 -- STEP 2: Process positional components
1636 -- STEP 2 (a): Generate the assignments for each positional element
1637 -- Note that here we have to use Aggr_L rather than Aggr_Low because
1638 -- Aggr_L is analyzed and Add wants an analyzed expression.
1640 Expr := First (Expressions (N));
1642 while Present (Expr) loop
1643 Nb_Elements := Nb_Elements + 1;
1644 Append_List (Gen_Assign (Add (Nb_Elements, To => Aggr_L), Expr),
1649 -- STEP 2 (b): Generate final loop if an others choice is present
1650 -- Here Nb_Elements gives the offset of the last positional element.
1652 if Present (Component_Associations (N)) then
1653 Assoc := Last (Component_Associations (N));
1655 -- Ada 2005 (AI-287)
1657 if Box_Present (Assoc) then
1658 Append_List (Gen_While (Add (Nb_Elements, To => Aggr_L),
1663 Expr := Expression (Assoc);
1665 Append_List (Gen_While (Add (Nb_Elements, To => Aggr_L),
1674 end Build_Array_Aggr_Code;
1676 ----------------------------
1677 -- Build_Record_Aggr_Code --
1678 ----------------------------
1680 ----------------------------
1681 -- Build_Record_Aggr_Code --
1682 ----------------------------
1684 function Build_Record_Aggr_Code
1688 Flist : Node_Id := Empty;
1689 Obj : Entity_Id := Empty;
1690 Is_Limited_Ancestor_Expansion : Boolean := False) return List_Id
1692 Loc : constant Source_Ptr := Sloc (N);
1693 L : constant List_Id := New_List;
1694 N_Typ : constant Entity_Id := Etype (N);
1701 Comp_Type : Entity_Id;
1702 Selector : Entity_Id;
1703 Comp_Expr : Node_Id;
1706 Internal_Final_List : Node_Id := Empty;
1708 -- If this is an internal aggregate, the External_Final_List is an
1709 -- expression for the controller record of the enclosing type.
1711 -- If the current aggregate has several controlled components, this
1712 -- expression will appear in several calls to attach to the finali-
1713 -- zation list, and it must not be shared.
1715 External_Final_List : Node_Id;
1716 Ancestor_Is_Expression : Boolean := False;
1717 Ancestor_Is_Subtype_Mark : Boolean := False;
1719 Init_Typ : Entity_Id := Empty;
1722 Ctrl_Stuff_Done : Boolean := False;
1723 -- True if Gen_Ctrl_Actions_For_Aggr has already been called; calls
1724 -- after the first do nothing.
1726 function Ancestor_Discriminant_Value (Disc : Entity_Id) return Node_Id;
1727 -- Returns the value that the given discriminant of an ancestor type
1728 -- should receive (in the absence of a conflict with the value provided
1729 -- by an ancestor part of an extension aggregate).
1731 procedure Check_Ancestor_Discriminants (Anc_Typ : Entity_Id);
1732 -- Check that each of the discriminant values defined by the ancestor
1733 -- part of an extension aggregate match the corresponding values
1734 -- provided by either an association of the aggregate or by the
1735 -- constraint imposed by a parent type (RM95-4.3.2(8)).
1737 function Compatible_Int_Bounds
1738 (Agg_Bounds : Node_Id;
1739 Typ_Bounds : Node_Id) return Boolean;
1740 -- Return true if Agg_Bounds are equal or within Typ_Bounds. It is
1741 -- assumed that both bounds are integer ranges.
1743 procedure Gen_Ctrl_Actions_For_Aggr;
1744 -- Deal with the various controlled type data structure initializations
1745 -- (but only if it hasn't been done already).
1747 function Get_Constraint_Association (T : Entity_Id) return Node_Id;
1748 -- Returns the first discriminant association in the constraint
1749 -- associated with T, if any, otherwise returns Empty.
1751 function Init_Controller
1756 Init_Pr : Boolean) return List_Id;
1757 -- Returns the list of statements necessary to initialize the internal
1758 -- controller of the (possible) ancestor typ into target and attach it
1759 -- to finalization list F. Init_Pr conditions the call to the init proc
1760 -- since it may already be done due to ancestor initialization.
1762 function Is_Int_Range_Bounds (Bounds : Node_Id) return Boolean;
1763 -- Check whether Bounds is a range node and its lower and higher bounds
1764 -- are integers literals.
1766 ---------------------------------
1767 -- Ancestor_Discriminant_Value --
1768 ---------------------------------
1770 function Ancestor_Discriminant_Value (Disc : Entity_Id) return Node_Id is
1772 Assoc_Elmt : Elmt_Id;
1773 Aggr_Comp : Entity_Id;
1774 Corresp_Disc : Entity_Id;
1775 Current_Typ : Entity_Id := Base_Type (Typ);
1776 Parent_Typ : Entity_Id;
1777 Parent_Disc : Entity_Id;
1778 Save_Assoc : Node_Id := Empty;
1781 -- First check any discriminant associations to see if any of them
1782 -- provide a value for the discriminant.
1784 if Present (Discriminant_Specifications (Parent (Current_Typ))) then
1785 Assoc := First (Component_Associations (N));
1786 while Present (Assoc) loop
1787 Aggr_Comp := Entity (First (Choices (Assoc)));
1789 if Ekind (Aggr_Comp) = E_Discriminant then
1790 Save_Assoc := Expression (Assoc);
1792 Corresp_Disc := Corresponding_Discriminant (Aggr_Comp);
1793 while Present (Corresp_Disc) loop
1795 -- If found a corresponding discriminant then return the
1796 -- value given in the aggregate. (Note: this is not
1797 -- correct in the presence of side effects. ???)
1799 if Disc = Corresp_Disc then
1800 return Duplicate_Subexpr (Expression (Assoc));
1804 Corresponding_Discriminant (Corresp_Disc);
1812 -- No match found in aggregate, so chain up parent types to find
1813 -- a constraint that defines the value of the discriminant.
1815 Parent_Typ := Etype (Current_Typ);
1816 while Current_Typ /= Parent_Typ loop
1817 if Has_Discriminants (Parent_Typ) then
1818 Parent_Disc := First_Discriminant (Parent_Typ);
1820 -- We either get the association from the subtype indication
1821 -- of the type definition itself, or from the discriminant
1822 -- constraint associated with the type entity (which is
1823 -- preferable, but it's not always present ???)
1825 if Is_Empty_Elmt_List (
1826 Discriminant_Constraint (Current_Typ))
1828 Assoc := Get_Constraint_Association (Current_Typ);
1829 Assoc_Elmt := No_Elmt;
1832 First_Elmt (Discriminant_Constraint (Current_Typ));
1833 Assoc := Node (Assoc_Elmt);
1836 -- Traverse the discriminants of the parent type looking
1837 -- for one that corresponds.
1839 while Present (Parent_Disc) and then Present (Assoc) loop
1840 Corresp_Disc := Parent_Disc;
1841 while Present (Corresp_Disc)
1842 and then Disc /= Corresp_Disc
1845 Corresponding_Discriminant (Corresp_Disc);
1848 if Disc = Corresp_Disc then
1849 if Nkind (Assoc) = N_Discriminant_Association then
1850 Assoc := Expression (Assoc);
1853 -- If the located association directly denotes a
1854 -- discriminant, then use the value of a saved
1855 -- association of the aggregate. This is a kludge to
1856 -- handle certain cases involving multiple discriminants
1857 -- mapped to a single discriminant of a descendant. It's
1858 -- not clear how to locate the appropriate discriminant
1859 -- value for such cases. ???
1861 if Is_Entity_Name (Assoc)
1862 and then Ekind (Entity (Assoc)) = E_Discriminant
1864 Assoc := Save_Assoc;
1867 return Duplicate_Subexpr (Assoc);
1870 Next_Discriminant (Parent_Disc);
1872 if No (Assoc_Elmt) then
1875 Next_Elmt (Assoc_Elmt);
1876 if Present (Assoc_Elmt) then
1877 Assoc := Node (Assoc_Elmt);
1885 Current_Typ := Parent_Typ;
1886 Parent_Typ := Etype (Current_Typ);
1889 -- In some cases there's no ancestor value to locate (such as
1890 -- when an ancestor part given by an expression defines the
1891 -- discriminant value).
1894 end Ancestor_Discriminant_Value;
1896 ----------------------------------
1897 -- Check_Ancestor_Discriminants --
1898 ----------------------------------
1900 procedure Check_Ancestor_Discriminants (Anc_Typ : Entity_Id) is
1902 Disc_Value : Node_Id;
1906 Discr := First_Discriminant (Base_Type (Anc_Typ));
1907 while Present (Discr) loop
1908 Disc_Value := Ancestor_Discriminant_Value (Discr);
1910 if Present (Disc_Value) then
1911 Cond := Make_Op_Ne (Loc,
1913 Make_Selected_Component (Loc,
1914 Prefix => New_Copy_Tree (Target),
1915 Selector_Name => New_Occurrence_Of (Discr, Loc)),
1916 Right_Opnd => Disc_Value);
1919 Make_Raise_Constraint_Error (Loc,
1921 Reason => CE_Discriminant_Check_Failed));
1924 Next_Discriminant (Discr);
1926 end Check_Ancestor_Discriminants;
1928 ---------------------------
1929 -- Compatible_Int_Bounds --
1930 ---------------------------
1932 function Compatible_Int_Bounds
1933 (Agg_Bounds : Node_Id;
1934 Typ_Bounds : Node_Id) return Boolean
1936 Agg_Lo : constant Uint := Intval (Low_Bound (Agg_Bounds));
1937 Agg_Hi : constant Uint := Intval (High_Bound (Agg_Bounds));
1938 Typ_Lo : constant Uint := Intval (Low_Bound (Typ_Bounds));
1939 Typ_Hi : constant Uint := Intval (High_Bound (Typ_Bounds));
1941 return Typ_Lo <= Agg_Lo and then Agg_Hi <= Typ_Hi;
1942 end Compatible_Int_Bounds;
1944 --------------------------------
1945 -- Get_Constraint_Association --
1946 --------------------------------
1948 function Get_Constraint_Association (T : Entity_Id) return Node_Id is
1949 Typ_Def : constant Node_Id := Type_Definition (Parent (T));
1950 Indic : constant Node_Id := Subtype_Indication (Typ_Def);
1953 -- ??? Also need to cover case of a type mark denoting a subtype
1956 if Nkind (Indic) = N_Subtype_Indication
1957 and then Present (Constraint (Indic))
1959 return First (Constraints (Constraint (Indic)));
1963 end Get_Constraint_Association;
1965 ---------------------
1966 -- Init_Controller --
1967 ---------------------
1969 function Init_Controller
1974 Init_Pr : Boolean) return List_Id
1976 L : constant List_Id := New_List;
1982 -- init-proc (target._controller);
1983 -- initialize (target._controller);
1984 -- Attach_to_Final_List (target._controller, F);
1987 Make_Selected_Component (Loc,
1988 Prefix => Convert_To (Typ, New_Copy_Tree (Target)),
1989 Selector_Name => Make_Identifier (Loc, Name_uController));
1990 Set_Assignment_OK (Ref);
1992 -- Ada 2005 (AI-287): Give support to default initialization of
1993 -- limited types and components.
1995 if (Nkind (Target) = N_Identifier
1996 and then Present (Etype (Target))
1997 and then Is_Limited_Type (Etype (Target)))
1999 (Nkind (Target) = N_Selected_Component
2000 and then Present (Etype (Selector_Name (Target)))
2001 and then Is_Limited_Type (Etype (Selector_Name (Target))))
2003 (Nkind (Target) = N_Unchecked_Type_Conversion
2004 and then Present (Etype (Target))
2005 and then Is_Limited_Type (Etype (Target)))
2007 (Nkind (Target) = N_Unchecked_Expression
2008 and then Nkind (Expression (Target)) = N_Indexed_Component
2009 and then Present (Etype (Prefix (Expression (Target))))
2010 and then Is_Limited_Type (Etype (Prefix (Expression (Target)))))
2012 RC := RE_Limited_Record_Controller;
2014 RC := RE_Record_Controller;
2019 Build_Initialization_Call (Loc,
2022 In_Init_Proc => Within_Init_Proc));
2026 Make_Procedure_Call_Statement (Loc,
2029 Find_Prim_Op (RTE (RC), Name_Initialize), Loc),
2030 Parameter_Associations =>
2031 New_List (New_Copy_Tree (Ref))));
2035 Obj_Ref => New_Copy_Tree (Ref),
2037 With_Attach => Attach));
2040 end Init_Controller;
2042 -------------------------
2043 -- Is_Int_Range_Bounds --
2044 -------------------------
2046 function Is_Int_Range_Bounds (Bounds : Node_Id) return Boolean is
2048 return Nkind (Bounds) = N_Range
2049 and then Nkind (Low_Bound (Bounds)) = N_Integer_Literal
2050 and then Nkind (High_Bound (Bounds)) = N_Integer_Literal;
2051 end Is_Int_Range_Bounds;
2053 -------------------------------
2054 -- Gen_Ctrl_Actions_For_Aggr --
2055 -------------------------------
2057 procedure Gen_Ctrl_Actions_For_Aggr is
2058 Alloc : Node_Id := Empty;
2061 -- Do the work only the first time this is called
2063 if Ctrl_Stuff_Done then
2067 Ctrl_Stuff_Done := True;
2070 and then Finalize_Storage_Only (Typ)
2072 (Is_Library_Level_Entity (Obj)
2073 or else Entity (Constant_Value (RTE (RE_Garbage_Collected))) =
2076 -- why not Is_True (Expr_Value (RTE (RE_Garbaage_Collected) ???
2078 Attach := Make_Integer_Literal (Loc, 0);
2080 elsif Nkind (Parent (N)) = N_Qualified_Expression
2081 and then Nkind (Parent (Parent (N))) = N_Allocator
2083 Alloc := Parent (Parent (N));
2084 Attach := Make_Integer_Literal (Loc, 2);
2087 Attach := Make_Integer_Literal (Loc, 1);
2090 -- Determine the external finalization list. It is either the
2091 -- finalization list of the outer-scope or the one coming from
2092 -- an outer aggregate. When the target is not a temporary, the
2093 -- proper scope is the scope of the target rather than the
2094 -- potentially transient current scope.
2096 if Controlled_Type (Typ) then
2098 -- The current aggregate belongs to an allocator which creates
2099 -- an object through an anonymous access type or acts as the root
2100 -- of a coextension chain.
2104 (Is_Coextension_Root (Alloc)
2105 or else Ekind (Etype (Alloc)) = E_Anonymous_Access_Type)
2107 if No (Associated_Final_Chain (Etype (Alloc))) then
2108 Build_Final_List (Alloc, Etype (Alloc));
2111 External_Final_List :=
2112 Make_Selected_Component (Loc,
2115 Associated_Final_Chain (Etype (Alloc)), Loc),
2117 Make_Identifier (Loc, Name_F));
2119 elsif Present (Flist) then
2120 External_Final_List := New_Copy_Tree (Flist);
2122 elsif Is_Entity_Name (Target)
2123 and then Present (Scope (Entity (Target)))
2125 External_Final_List :=
2126 Find_Final_List (Scope (Entity (Target)));
2129 External_Final_List := Find_Final_List (Current_Scope);
2132 External_Final_List := Empty;
2135 -- Initialize and attach the outer object in the is_controlled case
2137 if Is_Controlled (Typ) then
2138 if Ancestor_Is_Subtype_Mark then
2139 Ref := Convert_To (Init_Typ, New_Copy_Tree (Target));
2140 Set_Assignment_OK (Ref);
2142 Make_Procedure_Call_Statement (Loc,
2145 (Find_Prim_Op (Init_Typ, Name_Initialize), Loc),
2146 Parameter_Associations => New_List (New_Copy_Tree (Ref))));
2149 if not Has_Controlled_Component (Typ) then
2150 Ref := New_Copy_Tree (Target);
2151 Set_Assignment_OK (Ref);
2153 -- This is an aggregate of a coextension. Do not produce a
2154 -- finalization call, but rather attach the reference of the
2155 -- aggregate to its coextension chain.
2158 and then Is_Dynamic_Coextension (Alloc)
2160 if No (Coextensions (Alloc)) then
2161 Set_Coextensions (Alloc, New_Elmt_List);
2164 Append_Elmt (Ref, Coextensions (Alloc));
2169 Flist_Ref => New_Copy_Tree (External_Final_List),
2170 With_Attach => Attach));
2175 -- In the Has_Controlled component case, all the intermediate
2176 -- controllers must be initialized.
2178 if Has_Controlled_Component (Typ)
2179 and not Is_Limited_Ancestor_Expansion
2182 Inner_Typ : Entity_Id;
2183 Outer_Typ : Entity_Id;
2187 -- Find outer type with a controller
2189 Outer_Typ := Base_Type (Typ);
2190 while Outer_Typ /= Init_Typ
2191 and then not Has_New_Controlled_Component (Outer_Typ)
2193 Outer_Typ := Etype (Outer_Typ);
2196 -- Attach it to the outer record controller to the
2197 -- external final list
2199 if Outer_Typ = Init_Typ then
2204 F => External_Final_List,
2209 Inner_Typ := Init_Typ;
2216 F => External_Final_List,
2220 Inner_Typ := Etype (Outer_Typ);
2222 not Is_Tagged_Type (Typ) or else Inner_Typ = Outer_Typ;
2225 -- The outer object has to be attached as well
2227 if Is_Controlled (Typ) then
2228 Ref := New_Copy_Tree (Target);
2229 Set_Assignment_OK (Ref);
2233 Flist_Ref => New_Copy_Tree (External_Final_List),
2234 With_Attach => New_Copy_Tree (Attach)));
2237 -- Initialize the internal controllers for tagged types with
2238 -- more than one controller.
2240 while not At_Root and then Inner_Typ /= Init_Typ loop
2241 if Has_New_Controlled_Component (Inner_Typ) then
2243 Make_Selected_Component (Loc,
2245 Convert_To (Outer_Typ, New_Copy_Tree (Target)),
2247 Make_Identifier (Loc, Name_uController));
2249 Make_Selected_Component (Loc,
2251 Selector_Name => Make_Identifier (Loc, Name_F));
2258 Attach => Make_Integer_Literal (Loc, 1),
2260 Outer_Typ := Inner_Typ;
2265 At_Root := Inner_Typ = Etype (Inner_Typ);
2266 Inner_Typ := Etype (Inner_Typ);
2269 -- If not done yet attach the controller of the ancestor part
2271 if Outer_Typ /= Init_Typ
2272 and then Inner_Typ = Init_Typ
2273 and then Has_Controlled_Component (Init_Typ)
2276 Make_Selected_Component (Loc,
2277 Prefix => Convert_To (Outer_Typ, New_Copy_Tree (Target)),
2279 Make_Identifier (Loc, Name_uController));
2281 Make_Selected_Component (Loc,
2283 Selector_Name => Make_Identifier (Loc, Name_F));
2285 Attach := Make_Integer_Literal (Loc, 1);
2294 -- Note: Init_Pr is False because the ancestor part has
2295 -- already been initialized either way (by default, if
2296 -- given by a type name, otherwise from the expression).
2301 end Gen_Ctrl_Actions_For_Aggr;
2303 function Replace_Type (Expr : Node_Id) return Traverse_Result;
2304 -- If the aggregate contains a self-reference, traverse each
2305 -- expression to replace a possible self-reference with a reference
2306 -- to the proper component of the target of the assignment.
2312 function Replace_Type (Expr : Node_Id) return Traverse_Result is
2314 if Nkind (Expr) = N_Attribute_Reference
2315 and then Is_Entity_Name (Prefix (Expr))
2316 and then Is_Type (Entity (Prefix (Expr)))
2318 if Is_Entity_Name (Lhs) then
2319 Rewrite (Prefix (Expr),
2320 New_Occurrence_Of (Entity (Lhs), Loc));
2322 elsif Nkind (Lhs) = N_Selected_Component then
2324 Make_Attribute_Reference (Loc,
2325 Attribute_Name => Name_Unrestricted_Access,
2326 Prefix => New_Copy_Tree (Prefix (Lhs))));
2327 Set_Analyzed (Parent (Expr), False);
2331 Make_Attribute_Reference (Loc,
2332 Attribute_Name => Name_Unrestricted_Access,
2333 Prefix => New_Copy_Tree (Lhs)));
2334 Set_Analyzed (Parent (Expr), False);
2341 procedure Replace_Self_Reference is
2342 new Traverse_Proc (Replace_Type);
2344 -- Start of processing for Build_Record_Aggr_Code
2347 if Has_Self_Reference (N) then
2348 Replace_Self_Reference (N);
2351 -- If the target of the aggregate is class-wide, we must convert it
2352 -- to the actual type of the aggregate, so that the proper components
2353 -- are visible. We know already that the types are compatible.
2355 if Present (Etype (Lhs))
2356 and then Is_Interface (Etype (Lhs))
2358 Target := Unchecked_Convert_To (Typ, Lhs);
2363 -- Deal with the ancestor part of extension aggregates or with the
2364 -- discriminants of the root type.
2366 if Nkind (N) = N_Extension_Aggregate then
2368 A : constant Node_Id := Ancestor_Part (N);
2372 -- If the ancestor part is a subtype mark "T", we generate
2374 -- init-proc (T(tmp)); if T is constrained and
2375 -- init-proc (S(tmp)); where S applies an appropriate
2376 -- constraint if T is unconstrained
2378 if Is_Entity_Name (A) and then Is_Type (Entity (A)) then
2379 Ancestor_Is_Subtype_Mark := True;
2381 if Is_Constrained (Entity (A)) then
2382 Init_Typ := Entity (A);
2384 -- For an ancestor part given by an unconstrained type mark,
2385 -- create a subtype constrained by appropriate corresponding
2386 -- discriminant values coming from either associations of the
2387 -- aggregate or a constraint on a parent type. The subtype will
2388 -- be used to generate the correct default value for the
2391 elsif Has_Discriminants (Entity (A)) then
2393 Anc_Typ : constant Entity_Id := Entity (A);
2394 Anc_Constr : constant List_Id := New_List;
2395 Discrim : Entity_Id;
2396 Disc_Value : Node_Id;
2397 New_Indic : Node_Id;
2398 Subt_Decl : Node_Id;
2401 Discrim := First_Discriminant (Anc_Typ);
2402 while Present (Discrim) loop
2403 Disc_Value := Ancestor_Discriminant_Value (Discrim);
2404 Append_To (Anc_Constr, Disc_Value);
2405 Next_Discriminant (Discrim);
2409 Make_Subtype_Indication (Loc,
2410 Subtype_Mark => New_Occurrence_Of (Anc_Typ, Loc),
2412 Make_Index_Or_Discriminant_Constraint (Loc,
2413 Constraints => Anc_Constr));
2415 Init_Typ := Create_Itype (Ekind (Anc_Typ), N);
2418 Make_Subtype_Declaration (Loc,
2419 Defining_Identifier => Init_Typ,
2420 Subtype_Indication => New_Indic);
2422 -- Itypes must be analyzed with checks off Declaration
2423 -- must have a parent for proper handling of subsidiary
2426 Set_Parent (Subt_Decl, N);
2427 Analyze (Subt_Decl, Suppress => All_Checks);
2431 Ref := Convert_To (Init_Typ, New_Copy_Tree (Target));
2432 Set_Assignment_OK (Ref);
2434 if Has_Default_Init_Comps (N)
2435 or else Has_Task (Base_Type (Init_Typ))
2438 Build_Initialization_Call (Loc,
2441 In_Init_Proc => Within_Init_Proc,
2442 With_Default_Init => True));
2445 Build_Initialization_Call (Loc,
2448 In_Init_Proc => Within_Init_Proc));
2451 if Is_Constrained (Entity (A))
2452 and then Has_Discriminants (Entity (A))
2454 Check_Ancestor_Discriminants (Entity (A));
2457 -- Ada 2005 (AI-287): If the ancestor part is an aggregate of
2458 -- limited type, a recursive call expands the ancestor. Note that
2459 -- in the limited case, the ancestor part must be either a
2460 -- function call (possibly qualified, or wrapped in an unchecked
2461 -- conversion) or aggregate (definitely qualified).
2463 elsif Is_Limited_Type (Etype (A))
2464 and then Nkind (Unqualify (A)) /= N_Function_Call -- aggregate?
2466 (Nkind (Unqualify (A)) /= N_Unchecked_Type_Conversion
2468 Nkind (Expression (Unqualify (A))) /= N_Function_Call)
2470 Ancestor_Is_Expression := True;
2472 -- Set up finalization data for enclosing record, because
2473 -- controlled subcomponents of the ancestor part will be
2476 Gen_Ctrl_Actions_For_Aggr;
2479 Build_Record_Aggr_Code (
2481 Typ => Etype (Unqualify (A)),
2485 Is_Limited_Ancestor_Expansion => True));
2487 -- If the ancestor part is an expression "E", we generate
2491 -- In Ada 2005, this includes the case of a (possibly qualified)
2492 -- limited function call. The assignment will turn into a
2493 -- build-in-place function call (for further details, see
2494 -- Make_Build_In_Place_Call_In_Assignment).
2497 Ancestor_Is_Expression := True;
2498 Init_Typ := Etype (A);
2500 -- If the ancestor part is an aggregate, force its full
2501 -- expansion, which was delayed.
2503 if Nkind (Unqualify (A)) = N_Aggregate
2504 or else Nkind (Unqualify (A)) = N_Extension_Aggregate
2506 Set_Analyzed (A, False);
2507 Set_Analyzed (Expression (A), False);
2510 Ref := Convert_To (Init_Typ, New_Copy_Tree (Target));
2511 Set_Assignment_OK (Ref);
2513 -- Make the assignment without usual controlled actions since
2514 -- we only want the post adjust but not the pre finalize here
2515 -- Add manual adjust when necessary
2517 Assign := New_List (
2518 Make_OK_Assignment_Statement (Loc,
2521 Set_No_Ctrl_Actions (First (Assign));
2523 -- Assign the tag now to make sure that the dispatching call in
2524 -- the subsequent deep_adjust works properly (unless VM_Target,
2525 -- where tags are implicit).
2527 if VM_Target = No_VM then
2529 Make_OK_Assignment_Statement (Loc,
2531 Make_Selected_Component (Loc,
2532 Prefix => New_Copy_Tree (Target),
2535 (First_Tag_Component (Base_Type (Typ)), Loc)),
2538 Unchecked_Convert_To (RTE (RE_Tag),
2541 (Access_Disp_Table (Base_Type (Typ)))),
2544 Set_Assignment_OK (Name (Instr));
2545 Append_To (Assign, Instr);
2547 -- Ada 2005 (AI-251): If tagged type has progenitors we must
2548 -- also initialize tags of the secondary dispatch tables.
2550 if Present (Abstract_Interfaces (Base_Type (Typ)))
2553 (Abstract_Interfaces (Base_Type (Typ)))
2556 (Typ => Base_Type (Typ),
2558 Stmts_List => Assign);
2562 -- Call Adjust manually
2564 if Controlled_Type (Etype (A))
2565 and then not Is_Limited_Type (Etype (A))
2567 Append_List_To (Assign,
2569 Ref => New_Copy_Tree (Ref),
2571 Flist_Ref => New_Reference_To (
2572 RTE (RE_Global_Final_List), Loc),
2573 With_Attach => Make_Integer_Literal (Loc, 0)));
2577 Make_Unsuppress_Block (Loc, Name_Discriminant_Check, Assign));
2579 if Has_Discriminants (Init_Typ) then
2580 Check_Ancestor_Discriminants (Init_Typ);
2585 -- Normal case (not an extension aggregate)
2588 -- Generate the discriminant expressions, component by component.
2589 -- If the base type is an unchecked union, the discriminants are
2590 -- unknown to the back-end and absent from a value of the type, so
2591 -- assignments for them are not emitted.
2593 if Has_Discriminants (Typ)
2594 and then not Is_Unchecked_Union (Base_Type (Typ))
2596 -- If the type is derived, and constrains discriminants of the
2597 -- parent type, these discriminants are not components of the
2598 -- aggregate, and must be initialized explicitly. They are not
2599 -- visible components of the object, but can become visible with
2600 -- a view conversion to the ancestor.
2604 Parent_Type : Entity_Id;
2606 Discr_Val : Elmt_Id;
2609 Btype := Base_Type (Typ);
2610 while Is_Derived_Type (Btype)
2611 and then Present (Stored_Constraint (Btype))
2613 Parent_Type := Etype (Btype);
2615 Disc := First_Discriminant (Parent_Type);
2617 First_Elmt (Stored_Constraint (Base_Type (Typ)));
2618 while Present (Discr_Val) loop
2620 -- Only those discriminants of the parent that are not
2621 -- renamed by discriminants of the derived type need to
2622 -- be added explicitly.
2624 if not Is_Entity_Name (Node (Discr_Val))
2626 Ekind (Entity (Node (Discr_Val))) /= E_Discriminant
2629 Make_Selected_Component (Loc,
2630 Prefix => New_Copy_Tree (Target),
2631 Selector_Name => New_Occurrence_Of (Disc, Loc));
2634 Make_OK_Assignment_Statement (Loc,
2636 Expression => New_Copy_Tree (Node (Discr_Val)));
2638 Set_No_Ctrl_Actions (Instr);
2639 Append_To (L, Instr);
2642 Next_Discriminant (Disc);
2643 Next_Elmt (Discr_Val);
2646 Btype := Base_Type (Parent_Type);
2650 -- Generate discriminant init values for the visible discriminants
2653 Discriminant : Entity_Id;
2654 Discriminant_Value : Node_Id;
2657 Discriminant := First_Stored_Discriminant (Typ);
2658 while Present (Discriminant) loop
2660 Make_Selected_Component (Loc,
2661 Prefix => New_Copy_Tree (Target),
2662 Selector_Name => New_Occurrence_Of (Discriminant, Loc));
2664 Discriminant_Value :=
2665 Get_Discriminant_Value (
2668 Discriminant_Constraint (N_Typ));
2671 Make_OK_Assignment_Statement (Loc,
2673 Expression => New_Copy_Tree (Discriminant_Value));
2675 Set_No_Ctrl_Actions (Instr);
2676 Append_To (L, Instr);
2678 Next_Stored_Discriminant (Discriminant);
2684 -- Generate the assignments, component by component
2686 -- tmp.comp1 := Expr1_From_Aggr;
2687 -- tmp.comp2 := Expr2_From_Aggr;
2690 Comp := First (Component_Associations (N));
2691 while Present (Comp) loop
2692 Selector := Entity (First (Choices (Comp)));
2694 -- Ada 2005 (AI-287): For each default-initialized component generate
2695 -- a call to the corresponding IP subprogram if available.
2697 if Box_Present (Comp)
2698 and then Has_Non_Null_Base_Init_Proc (Etype (Selector))
2700 if Ekind (Selector) /= E_Discriminant then
2701 Gen_Ctrl_Actions_For_Aggr;
2704 -- Ada 2005 (AI-287): If the component type has tasks then
2705 -- generate the activation chain and master entities (except
2706 -- in case of an allocator because in that case these entities
2707 -- are generated by Build_Task_Allocate_Block_With_Init_Stmts).
2710 Ctype : constant Entity_Id := Etype (Selector);
2711 Inside_Allocator : Boolean := False;
2712 P : Node_Id := Parent (N);
2715 if Is_Task_Type (Ctype) or else Has_Task (Ctype) then
2716 while Present (P) loop
2717 if Nkind (P) = N_Allocator then
2718 Inside_Allocator := True;
2725 if not Inside_Init_Proc and not Inside_Allocator then
2726 Build_Activation_Chain_Entity (N);
2732 Build_Initialization_Call (Loc,
2733 Id_Ref => Make_Selected_Component (Loc,
2734 Prefix => New_Copy_Tree (Target),
2735 Selector_Name => New_Occurrence_Of (Selector,
2737 Typ => Etype (Selector),
2739 With_Default_Init => True));
2744 -- Prepare for component assignment
2746 if Ekind (Selector) /= E_Discriminant
2747 or else Nkind (N) = N_Extension_Aggregate
2749 -- All the discriminants have now been assigned
2751 -- This is now a good moment to initialize and attach all the
2752 -- controllers. Their position may depend on the discriminants.
2754 if Ekind (Selector) /= E_Discriminant then
2755 Gen_Ctrl_Actions_For_Aggr;
2758 Comp_Type := Etype (Selector);
2760 Make_Selected_Component (Loc,
2761 Prefix => New_Copy_Tree (Target),
2762 Selector_Name => New_Occurrence_Of (Selector, Loc));
2764 if Nkind (Expression (Comp)) = N_Qualified_Expression then
2765 Expr_Q := Expression (Expression (Comp));
2767 Expr_Q := Expression (Comp);
2770 -- The controller is the one of the parent type defining the
2771 -- component (in case of inherited components).
2773 if Controlled_Type (Comp_Type) then
2774 Internal_Final_List :=
2775 Make_Selected_Component (Loc,
2776 Prefix => Convert_To (
2777 Scope (Original_Record_Component (Selector)),
2778 New_Copy_Tree (Target)),
2780 Make_Identifier (Loc, Name_uController));
2782 Internal_Final_List :=
2783 Make_Selected_Component (Loc,
2784 Prefix => Internal_Final_List,
2785 Selector_Name => Make_Identifier (Loc, Name_F));
2787 -- The internal final list can be part of a constant object
2789 Set_Assignment_OK (Internal_Final_List);
2792 Internal_Final_List := Empty;
2795 -- Now either create the assignment or generate the code for the
2796 -- inner aggregate top-down.
2798 if Is_Delayed_Aggregate (Expr_Q) then
2800 -- We have the following case of aggregate nesting inside
2801 -- an object declaration:
2803 -- type Arr_Typ is array (Integer range <>) of ...;
2805 -- type Rec_Typ (...) is record
2806 -- Obj_Arr_Typ : Arr_Typ (A .. B);
2809 -- Obj_Rec_Typ : Rec_Typ := (...,
2810 -- Obj_Arr_Typ => (X => (...), Y => (...)));
2812 -- The length of the ranges of the aggregate and Obj_Add_Typ
2813 -- are equal (B - A = Y - X), but they do not coincide (X /=
2814 -- A and B /= Y). This case requires array sliding which is
2815 -- performed in the following manner:
2817 -- subtype Arr_Sub is Arr_Typ (X .. Y);
2819 -- Temp (X) := (...);
2821 -- Temp (Y) := (...);
2822 -- Obj_Rec_Typ.Obj_Arr_Typ := Temp;
2824 if Ekind (Comp_Type) = E_Array_Subtype
2825 and then Is_Int_Range_Bounds (Aggregate_Bounds (Expr_Q))
2826 and then Is_Int_Range_Bounds (First_Index (Comp_Type))
2828 Compatible_Int_Bounds
2829 (Agg_Bounds => Aggregate_Bounds (Expr_Q),
2830 Typ_Bounds => First_Index (Comp_Type))
2832 -- Create the array subtype with bounds equal to those of
2833 -- the corresponding aggregate.
2836 SubE : constant Entity_Id :=
2837 Make_Defining_Identifier (Loc,
2838 New_Internal_Name ('T'));
2840 SubD : constant Node_Id :=
2841 Make_Subtype_Declaration (Loc,
2842 Defining_Identifier =>
2844 Subtype_Indication =>
2845 Make_Subtype_Indication (Loc,
2846 Subtype_Mark => New_Reference_To (
2847 Etype (Comp_Type), Loc),
2849 Make_Index_Or_Discriminant_Constraint (
2850 Loc, Constraints => New_List (
2851 New_Copy_Tree (Aggregate_Bounds (
2854 -- Create a temporary array of the above subtype which
2855 -- will be used to capture the aggregate assignments.
2857 TmpE : constant Entity_Id :=
2858 Make_Defining_Identifier (Loc,
2859 New_Internal_Name ('A'));
2861 TmpD : constant Node_Id :=
2862 Make_Object_Declaration (Loc,
2863 Defining_Identifier =>
2865 Object_Definition =>
2866 New_Reference_To (SubE, Loc));
2869 Set_No_Initialization (TmpD);
2870 Append_To (L, SubD);
2871 Append_To (L, TmpD);
2873 -- Expand aggregate into assignments to the temp array
2876 Late_Expansion (Expr_Q, Comp_Type,
2877 New_Reference_To (TmpE, Loc), Internal_Final_List));
2882 Make_Assignment_Statement (Loc,
2883 Name => New_Copy_Tree (Comp_Expr),
2884 Expression => New_Reference_To (TmpE, Loc)));
2886 -- Do not pass the original aggregate to Gigi as is,
2887 -- since it will potentially clobber the front or the end
2888 -- of the array. Setting the expression to empty is safe
2889 -- since all aggregates are expanded into assignments.
2891 if Present (Obj) then
2892 Set_Expression (Parent (Obj), Empty);
2896 -- Normal case (sliding not required)
2900 Late_Expansion (Expr_Q, Comp_Type, Comp_Expr,
2901 Internal_Final_List));
2904 -- Expr_Q is not delayed aggregate
2908 Make_OK_Assignment_Statement (Loc,
2910 Expression => Expression (Comp));
2912 Set_No_Ctrl_Actions (Instr);
2913 Append_To (L, Instr);
2915 -- Adjust the tag if tagged (because of possible view
2916 -- conversions), unless compiling for a VM where tags are
2919 -- tmp.comp._tag := comp_typ'tag;
2921 if Is_Tagged_Type (Comp_Type) and then VM_Target = No_VM then
2923 Make_OK_Assignment_Statement (Loc,
2925 Make_Selected_Component (Loc,
2926 Prefix => New_Copy_Tree (Comp_Expr),
2929 (First_Tag_Component (Comp_Type), Loc)),
2932 Unchecked_Convert_To (RTE (RE_Tag),
2934 (Node (First_Elmt (Access_Disp_Table (Comp_Type))),
2937 Append_To (L, Instr);
2940 -- Adjust and Attach the component to the proper controller
2942 -- Adjust (tmp.comp);
2943 -- Attach_To_Final_List (tmp.comp,
2944 -- comp_typ (tmp)._record_controller.f)
2946 if Controlled_Type (Comp_Type)
2947 and then not Is_Limited_Type (Comp_Type)
2951 Ref => New_Copy_Tree (Comp_Expr),
2953 Flist_Ref => Internal_Final_List,
2954 With_Attach => Make_Integer_Literal (Loc, 1)));
2960 elsif Ekind (Selector) = E_Discriminant
2961 and then Nkind (N) /= N_Extension_Aggregate
2962 and then Nkind (Parent (N)) = N_Component_Association
2963 and then Is_Constrained (Typ)
2965 -- We must check that the discriminant value imposed by the
2966 -- context is the same as the value given in the subaggregate,
2967 -- because after the expansion into assignments there is no
2968 -- record on which to perform a regular discriminant check.
2975 D_Val := First_Elmt (Discriminant_Constraint (Typ));
2976 Disc := First_Discriminant (Typ);
2977 while Chars (Disc) /= Chars (Selector) loop
2978 Next_Discriminant (Disc);
2982 pragma Assert (Present (D_Val));
2984 -- This check cannot performed for components that are
2985 -- constrained by a current instance, because this is not a
2986 -- value that can be compared with the actual constraint.
2988 if Nkind (Node (D_Val)) /= N_Attribute_Reference
2989 or else not Is_Entity_Name (Prefix (Node (D_Val)))
2990 or else not Is_Type (Entity (Prefix (Node (D_Val))))
2993 Make_Raise_Constraint_Error (Loc,
2996 Left_Opnd => New_Copy_Tree (Node (D_Val)),
2997 Right_Opnd => Expression (Comp)),
2998 Reason => CE_Discriminant_Check_Failed));
3001 -- Find self-reference in previous discriminant assignment,
3002 -- and replace with proper expression.
3009 while Present (Ass) loop
3010 if Nkind (Ass) = N_Assignment_Statement
3011 and then Nkind (Name (Ass)) = N_Selected_Component
3012 and then Chars (Selector_Name (Name (Ass))) =
3016 (Ass, New_Copy_Tree (Expression (Comp)));
3031 -- If the type is tagged, the tag needs to be initialized (unless
3032 -- compiling for the Java VM where tags are implicit). It is done
3033 -- late in the initialization process because in some cases, we call
3034 -- the init proc of an ancestor which will not leave out the right tag
3036 if Ancestor_Is_Expression then
3039 elsif Is_Tagged_Type (Typ) and then VM_Target = No_VM then
3041 Make_OK_Assignment_Statement (Loc,
3043 Make_Selected_Component (Loc,
3044 Prefix => New_Copy_Tree (Target),
3047 (First_Tag_Component (Base_Type (Typ)), Loc)),
3050 Unchecked_Convert_To (RTE (RE_Tag),
3052 (Node (First_Elmt (Access_Disp_Table (Base_Type (Typ)))),
3055 Append_To (L, Instr);
3057 -- Ada 2005 (AI-251): If the tagged type has been derived from
3058 -- abstract interfaces we must also initialize the tags of the
3059 -- secondary dispatch tables.
3061 if Present (Abstract_Interfaces (Base_Type (Typ)))
3063 Is_Empty_Elmt_List (Abstract_Interfaces (Base_Type (Typ)))
3066 (Typ => Base_Type (Typ),
3072 -- If the controllers have not been initialized yet (by lack of non-
3073 -- discriminant components), let's do it now.
3075 Gen_Ctrl_Actions_For_Aggr;
3078 end Build_Record_Aggr_Code;
3080 -------------------------------
3081 -- Convert_Aggr_In_Allocator --
3082 -------------------------------
3084 procedure Convert_Aggr_In_Allocator
3089 Loc : constant Source_Ptr := Sloc (Aggr);
3090 Typ : constant Entity_Id := Etype (Aggr);
3091 Temp : constant Entity_Id := Defining_Identifier (Decl);
3093 Occ : constant Node_Id :=
3094 Unchecked_Convert_To (Typ,
3095 Make_Explicit_Dereference (Loc,
3096 New_Reference_To (Temp, Loc)));
3098 Access_Type : constant Entity_Id := Etype (Temp);
3102 -- If the allocator is for an access discriminant, there is no
3103 -- finalization list for the anonymous access type, and the eventual
3104 -- finalization of the object is handled through the coextension
3105 -- mechanism. If the enclosing object is not dynamically allocated,
3106 -- the access discriminant is itself placed on the stack. Otherwise,
3107 -- some other finalization list is used (see exp_ch4.adb).
3109 -- Decl has been inserted in the code ahead of the allocator, using
3110 -- Insert_Actions. We use Insert_Actions below as well, to ensure that
3111 -- subsequent insertions are done in the proper order. Using (for
3112 -- example) Insert_Actions_After to place the expanded aggregate
3113 -- immediately after Decl may lead to out-of-order references if the
3114 -- allocator has generated a finalization list, as when the designated
3115 -- object is controlled and there is an open transient scope.
3117 if Ekind (Access_Type) = E_Anonymous_Access_Type
3118 and then Nkind (Associated_Node_For_Itype (Access_Type)) =
3119 N_Discriminant_Specification
3123 Flist := Find_Final_List (Access_Type);
3126 if Is_Array_Type (Typ) then
3127 Convert_Array_Aggr_In_Allocator (Decl, Aggr, Occ);
3129 elsif Has_Default_Init_Comps (Aggr) then
3131 L : constant List_Id := New_List;
3132 Init_Stmts : List_Id;
3139 Associated_Final_Chain (Base_Type (Access_Type)));
3141 -- ??? Dubious actual for Obj: expect 'the original object being
3144 if Has_Task (Typ) then
3145 Build_Task_Allocate_Block_With_Init_Stmts (L, Aggr, Init_Stmts);
3146 Insert_Actions (Alloc, L);
3148 Insert_Actions (Alloc, Init_Stmts);
3153 Insert_Actions (Alloc,
3155 (Aggr, Typ, Occ, Flist,
3156 Associated_Final_Chain (Base_Type (Access_Type))));
3158 -- ??? Dubious actual for Obj: expect 'the original object being
3162 end Convert_Aggr_In_Allocator;
3164 --------------------------------
3165 -- Convert_Aggr_In_Assignment --
3166 --------------------------------
3168 procedure Convert_Aggr_In_Assignment (N : Node_Id) is
3169 Aggr : Node_Id := Expression (N);
3170 Typ : constant Entity_Id := Etype (Aggr);
3171 Occ : constant Node_Id := New_Copy_Tree (Name (N));
3174 if Nkind (Aggr) = N_Qualified_Expression then
3175 Aggr := Expression (Aggr);
3178 Insert_Actions_After (N,
3181 Find_Final_List (Typ, New_Copy_Tree (Occ))));
3182 end Convert_Aggr_In_Assignment;
3184 ---------------------------------
3185 -- Convert_Aggr_In_Object_Decl --
3186 ---------------------------------
3188 procedure Convert_Aggr_In_Object_Decl (N : Node_Id) is
3189 Obj : constant Entity_Id := Defining_Identifier (N);
3190 Aggr : Node_Id := Expression (N);
3191 Loc : constant Source_Ptr := Sloc (Aggr);
3192 Typ : constant Entity_Id := Etype (Aggr);
3193 Occ : constant Node_Id := New_Occurrence_Of (Obj, Loc);
3195 function Discriminants_Ok return Boolean;
3196 -- If the object type is constrained, the discriminants in the
3197 -- aggregate must be checked against the discriminants of the subtype.
3198 -- This cannot be done using Apply_Discriminant_Checks because after
3199 -- expansion there is no aggregate left to check.
3201 ----------------------
3202 -- Discriminants_Ok --
3203 ----------------------
3205 function Discriminants_Ok return Boolean is
3206 Cond : Node_Id := Empty;
3215 D := First_Discriminant (Typ);
3216 Disc1 := First_Elmt (Discriminant_Constraint (Typ));
3217 Disc2 := First_Elmt (Discriminant_Constraint (Etype (Obj)));
3218 while Present (Disc1) and then Present (Disc2) loop
3219 Val1 := Node (Disc1);
3220 Val2 := Node (Disc2);
3222 if not Is_OK_Static_Expression (Val1)
3223 or else not Is_OK_Static_Expression (Val2)
3225 Check := Make_Op_Ne (Loc,
3226 Left_Opnd => Duplicate_Subexpr (Val1),
3227 Right_Opnd => Duplicate_Subexpr (Val2));
3233 Cond := Make_Or_Else (Loc,
3235 Right_Opnd => Check);
3238 elsif Expr_Value (Val1) /= Expr_Value (Val2) then
3239 Apply_Compile_Time_Constraint_Error (Aggr,
3240 Msg => "incorrect value for discriminant&?",
3241 Reason => CE_Discriminant_Check_Failed,
3246 Next_Discriminant (D);
3251 -- If any discriminant constraint is non-static, emit a check
3253 if Present (Cond) then
3255 Make_Raise_Constraint_Error (Loc,
3257 Reason => CE_Discriminant_Check_Failed));
3261 end Discriminants_Ok;
3263 -- Start of processing for Convert_Aggr_In_Object_Decl
3266 Set_Assignment_OK (Occ);
3268 if Nkind (Aggr) = N_Qualified_Expression then
3269 Aggr := Expression (Aggr);
3272 if Has_Discriminants (Typ)
3273 and then Typ /= Etype (Obj)
3274 and then Is_Constrained (Etype (Obj))
3275 and then not Discriminants_Ok
3280 -- If the context is an extended return statement, it has its own
3281 -- finalization machinery (i.e. works like a transient scope) and
3282 -- we do not want to create an additional one, because objects on
3283 -- the finalization list of the return must be moved to the caller's
3284 -- finalization list to complete the return.
3286 -- However, if the aggregate is limited, it is built in place, and the
3287 -- controlled components are not assigned to intermediate temporaries
3288 -- so there is no need for a transient scope in this case either.
3290 if Requires_Transient_Scope (Typ)
3291 and then Ekind (Current_Scope) /= E_Return_Statement
3292 and then not Is_Limited_Type (Typ)
3294 Establish_Transient_Scope (Aggr, Sec_Stack =>
3295 Is_Controlled (Typ) or else Has_Controlled_Component (Typ));
3298 Insert_Actions_After (N, Late_Expansion (Aggr, Typ, Occ, Obj => Obj));
3299 Set_No_Initialization (N);
3300 Initialize_Discriminants (N, Typ);
3301 end Convert_Aggr_In_Object_Decl;
3303 -------------------------------------
3304 -- Convert_Array_Aggr_In_Allocator --
3305 -------------------------------------
3307 procedure Convert_Array_Aggr_In_Allocator
3312 Aggr_Code : List_Id;
3313 Typ : constant Entity_Id := Etype (Aggr);
3314 Ctyp : constant Entity_Id := Component_Type (Typ);
3317 -- The target is an explicit dereference of the allocated object.
3318 -- Generate component assignments to it, as for an aggregate that
3319 -- appears on the right-hand side of an assignment statement.
3322 Build_Array_Aggr_Code (Aggr,
3324 Index => First_Index (Typ),
3326 Scalar_Comp => Is_Scalar_Type (Ctyp));
3328 Insert_Actions_After (Decl, Aggr_Code);
3329 end Convert_Array_Aggr_In_Allocator;
3331 ----------------------------
3332 -- Convert_To_Assignments --
3333 ----------------------------
3335 procedure Convert_To_Assignments (N : Node_Id; Typ : Entity_Id) is
3336 Loc : constant Source_Ptr := Sloc (N);
3340 Target_Expr : Node_Id;
3341 Parent_Kind : Node_Kind;
3342 Unc_Decl : Boolean := False;
3343 Parent_Node : Node_Id;
3346 pragma Assert (not Is_Static_Dispatch_Table_Aggregate (N));
3347 pragma Assert (Is_Record_Type (Typ));
3349 Parent_Node := Parent (N);
3350 Parent_Kind := Nkind (Parent_Node);
3352 if Parent_Kind = N_Qualified_Expression then
3354 -- Check if we are in a unconstrained declaration because in this
3355 -- case the current delayed expansion mechanism doesn't work when
3356 -- the declared object size depend on the initializing expr.
3359 Parent_Node := Parent (Parent_Node);
3360 Parent_Kind := Nkind (Parent_Node);
3362 if Parent_Kind = N_Object_Declaration then
3364 not Is_Entity_Name (Object_Definition (Parent_Node))
3365 or else Has_Discriminants
3366 (Entity (Object_Definition (Parent_Node)))
3367 or else Is_Class_Wide_Type
3368 (Entity (Object_Definition (Parent_Node)));
3373 -- Just set the Delay flag in the cases where the transformation will be
3374 -- done top down from above.
3378 -- Internal aggregate (transformed when expanding the parent)
3380 or else Parent_Kind = N_Aggregate
3381 or else Parent_Kind = N_Extension_Aggregate
3382 or else Parent_Kind = N_Component_Association
3384 -- Allocator (see Convert_Aggr_In_Allocator)
3386 or else Parent_Kind = N_Allocator
3388 -- Object declaration (see Convert_Aggr_In_Object_Decl)
3390 or else (Parent_Kind = N_Object_Declaration and then not Unc_Decl)
3392 -- Safe assignment (see Convert_Aggr_Assignments). So far only the
3393 -- assignments in init procs are taken into account.
3395 or else (Parent_Kind = N_Assignment_Statement
3396 and then Inside_Init_Proc)
3398 -- (Ada 2005) An inherently limited type in a return statement,
3399 -- which will be handled in a build-in-place fashion, and may be
3400 -- rewritten as an extended return and have its own finalization
3401 -- machinery. In the case of a simple return, the aggregate needs
3402 -- to be delayed until the scope for the return statement has been
3403 -- created, so that any finalization chain will be associated with
3404 -- that scope. For extended returns, we delay expansion to avoid the
3405 -- creation of an unwanted transient scope that could result in
3406 -- premature finalization of the return object (which is built in
3407 -- in place within the caller's scope).
3410 (Is_Inherently_Limited_Type (Typ)
3412 (Nkind (Parent (Parent_Node)) = N_Extended_Return_Statement
3413 or else Nkind (Parent_Node) = N_Simple_Return_Statement))
3415 Set_Expansion_Delayed (N);
3419 if Requires_Transient_Scope (Typ) then
3420 Establish_Transient_Scope
3422 Is_Controlled (Typ) or else Has_Controlled_Component (Typ));
3425 -- If the aggregate is non-limited, create a temporary. If it is
3426 -- limited and the context is an assignment, this is a subaggregate
3427 -- for an enclosing aggregate being expanded. It must be built in place,
3428 -- so use the target of the current assignment.
3430 if Is_Limited_Type (Typ)
3431 and then Nkind (Parent (N)) = N_Assignment_Statement
3433 Target_Expr := New_Copy_Tree (Name (Parent (N)));
3435 (Parent (N), Build_Record_Aggr_Code (N, Typ, Target_Expr));
3436 Rewrite (Parent (N), Make_Null_Statement (Loc));
3439 Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
3442 Make_Object_Declaration (Loc,
3443 Defining_Identifier => Temp,
3444 Object_Definition => New_Occurrence_Of (Typ, Loc));
3446 Set_No_Initialization (Instr);
3447 Insert_Action (N, Instr);
3448 Initialize_Discriminants (Instr, Typ);
3449 Target_Expr := New_Occurrence_Of (Temp, Loc);
3450 Insert_Actions (N, Build_Record_Aggr_Code (N, Typ, Target_Expr));
3451 Rewrite (N, New_Occurrence_Of (Temp, Loc));
3452 Analyze_And_Resolve (N, Typ);
3454 end Convert_To_Assignments;
3456 ---------------------------
3457 -- Convert_To_Positional --
3458 ---------------------------
3460 procedure Convert_To_Positional
3462 Max_Others_Replicate : Nat := 5;
3463 Handle_Bit_Packed : Boolean := False)
3465 Typ : constant Entity_Id := Etype (N);
3467 Static_Components : Boolean := True;
3469 procedure Check_Static_Components;
3470 -- Check whether all components of the aggregate are compile-time known
3471 -- values, and can be passed as is to the back-end without further
3477 Ixb : Node_Id) return Boolean;
3478 -- Convert the aggregate into a purely positional form if possible. On
3479 -- entry the bounds of all dimensions are known to be static, and the
3480 -- total number of components is safe enough to expand.
3482 function Is_Flat (N : Node_Id; Dims : Int) return Boolean;
3483 -- Return True iff the array N is flat (which is not rivial in the case
3484 -- of multidimensionsl aggregates).
3486 -----------------------------
3487 -- Check_Static_Components --
3488 -----------------------------
3490 procedure Check_Static_Components is
3494 Static_Components := True;
3496 if Nkind (N) = N_String_Literal then
3499 elsif Present (Expressions (N)) then
3500 Expr := First (Expressions (N));
3501 while Present (Expr) loop
3502 if Nkind (Expr) /= N_Aggregate
3503 or else not Compile_Time_Known_Aggregate (Expr)
3504 or else Expansion_Delayed (Expr)
3506 Static_Components := False;
3514 if Nkind (N) = N_Aggregate
3515 and then Present (Component_Associations (N))
3517 Expr := First (Component_Associations (N));
3518 while Present (Expr) loop
3519 if Nkind (Expression (Expr)) = N_Integer_Literal then
3522 elsif Nkind (Expression (Expr)) /= N_Aggregate
3524 not Compile_Time_Known_Aggregate (Expression (Expr))
3525 or else Expansion_Delayed (Expression (Expr))
3527 Static_Components := False;
3534 end Check_Static_Components;
3543 Ixb : Node_Id) return Boolean
3545 Loc : constant Source_Ptr := Sloc (N);
3546 Blo : constant Node_Id := Type_Low_Bound (Etype (Ixb));
3547 Lo : constant Node_Id := Type_Low_Bound (Etype (Ix));
3548 Hi : constant Node_Id := Type_High_Bound (Etype (Ix));
3553 if Nkind (Original_Node (N)) = N_String_Literal then
3557 if not Compile_Time_Known_Value (Lo)
3558 or else not Compile_Time_Known_Value (Hi)
3563 Lov := Expr_Value (Lo);
3564 Hiv := Expr_Value (Hi);
3567 or else not Compile_Time_Known_Value (Blo)
3572 -- Determine if set of alternatives is suitable for conversion and
3573 -- build an array containing the values in sequence.
3576 Vals : array (UI_To_Int (Lov) .. UI_To_Int (Hiv))
3577 of Node_Id := (others => Empty);
3578 -- The values in the aggregate sorted appropriately
3581 -- Same data as Vals in list form
3584 -- Used to validate Max_Others_Replicate limit
3587 Num : Int := UI_To_Int (Lov);
3592 if Present (Expressions (N)) then
3593 Elmt := First (Expressions (N));
3594 while Present (Elmt) loop
3595 if Nkind (Elmt) = N_Aggregate
3596 and then Present (Next_Index (Ix))
3598 not Flatten (Elmt, Next_Index (Ix), Next_Index (Ixb))
3603 Vals (Num) := Relocate_Node (Elmt);
3610 if No (Component_Associations (N)) then
3614 Elmt := First (Component_Associations (N));
3616 if Nkind (Expression (Elmt)) = N_Aggregate then
3617 if Present (Next_Index (Ix))
3620 (Expression (Elmt), Next_Index (Ix), Next_Index (Ixb))
3626 Component_Loop : while Present (Elmt) loop
3627 Choice := First (Choices (Elmt));
3628 Choice_Loop : while Present (Choice) loop
3630 -- If we have an others choice, fill in the missing elements
3631 -- subject to the limit established by Max_Others_Replicate.
3633 if Nkind (Choice) = N_Others_Choice then
3636 for J in Vals'Range loop
3637 if No (Vals (J)) then
3638 Vals (J) := New_Copy_Tree (Expression (Elmt));
3639 Rep_Count := Rep_Count + 1;
3641 -- Check for maximum others replication. Note that
3642 -- we skip this test if either of the restrictions
3643 -- No_Elaboration_Code or No_Implicit_Loops is
3644 -- active, or if this is a preelaborable unit.
3647 P : constant Entity_Id :=
3648 Cunit_Entity (Current_Sem_Unit);
3651 if Restriction_Active (No_Elaboration_Code)
3652 or else Restriction_Active (No_Implicit_Loops)
3653 or else Is_Preelaborated (P)
3654 or else (Ekind (P) = E_Package_Body
3656 Is_Preelaborated (Spec_Entity (P)))
3660 elsif Rep_Count > Max_Others_Replicate then
3667 exit Component_Loop;
3669 -- Case of a subtype mark
3671 elsif Nkind (Choice) = N_Identifier
3672 and then Is_Type (Entity (Choice))
3674 Lo := Type_Low_Bound (Etype (Choice));
3675 Hi := Type_High_Bound (Etype (Choice));
3677 -- Case of subtype indication
3679 elsif Nkind (Choice) = N_Subtype_Indication then
3680 Lo := Low_Bound (Range_Expression (Constraint (Choice)));
3681 Hi := High_Bound (Range_Expression (Constraint (Choice)));
3685 elsif Nkind (Choice) = N_Range then
3686 Lo := Low_Bound (Choice);
3687 Hi := High_Bound (Choice);
3689 -- Normal subexpression case
3691 else pragma Assert (Nkind (Choice) in N_Subexpr);
3692 if not Compile_Time_Known_Value (Choice) then
3696 Vals (UI_To_Int (Expr_Value (Choice))) :=
3697 New_Copy_Tree (Expression (Elmt));
3702 -- Range cases merge with Lo,Hi said
3704 if not Compile_Time_Known_Value (Lo)
3706 not Compile_Time_Known_Value (Hi)
3710 for J in UI_To_Int (Expr_Value (Lo)) ..
3711 UI_To_Int (Expr_Value (Hi))
3713 Vals (J) := New_Copy_Tree (Expression (Elmt));
3719 end loop Choice_Loop;
3722 end loop Component_Loop;
3724 -- If we get here the conversion is possible
3727 for J in Vals'Range loop
3728 Append (Vals (J), Vlist);
3731 Rewrite (N, Make_Aggregate (Loc, Expressions => Vlist));
3732 Set_Aggregate_Bounds (N, Aggregate_Bounds (Original_Node (N)));
3741 function Is_Flat (N : Node_Id; Dims : Int) return Boolean is
3748 elsif Nkind (N) = N_Aggregate then
3749 if Present (Component_Associations (N)) then
3753 Elmt := First (Expressions (N));
3754 while Present (Elmt) loop
3755 if not Is_Flat (Elmt, Dims - 1) then
3769 -- Start of processing for Convert_To_Positional
3772 -- Ada 2005 (AI-287): Do not convert in case of default initialized
3773 -- components because in this case will need to call the corresponding
3776 if Has_Default_Init_Comps (N) then
3780 if Is_Flat (N, Number_Dimensions (Typ)) then
3784 if Is_Bit_Packed_Array (Typ)
3785 and then not Handle_Bit_Packed
3790 -- Do not convert to positional if controlled components are involved
3791 -- since these require special processing
3793 if Has_Controlled_Component (Typ) then
3797 Check_Static_Components;
3799 -- If the size is known, or all the components are static, try to
3800 -- build a fully positional aggregate.
3802 -- The size of the type may not be known for an aggregate with
3803 -- discriminated array components, but if the components are static
3804 -- it is still possible to verify statically that the length is
3805 -- compatible with the upper bound of the type, and therefore it is
3806 -- worth flattening such aggregates as well.
3808 -- For now the back-end expands these aggregates into individual
3809 -- assignments to the target anyway, but it is conceivable that
3810 -- it will eventually be able to treat such aggregates statically???
3812 if Aggr_Size_OK (Typ)
3813 and then Flatten (N, First_Index (Typ), First_Index (Base_Type (Typ)))
3815 if Static_Components then
3816 Set_Compile_Time_Known_Aggregate (N);
3817 Set_Expansion_Delayed (N, False);
3820 Analyze_And_Resolve (N, Typ);
3822 end Convert_To_Positional;
3824 ----------------------------
3825 -- Expand_Array_Aggregate --
3826 ----------------------------
3828 -- Array aggregate expansion proceeds as follows:
3830 -- 1. If requested we generate code to perform all the array aggregate
3831 -- bound checks, specifically
3833 -- (a) Check that the index range defined by aggregate bounds is
3834 -- compatible with corresponding index subtype.
3836 -- (b) If an others choice is present check that no aggregate
3837 -- index is outside the bounds of the index constraint.
3839 -- (c) For multidimensional arrays make sure that all subaggregates
3840 -- corresponding to the same dimension have the same bounds.
3842 -- 2. Check for packed array aggregate which can be converted to a
3843 -- constant so that the aggregate disappeares completely.
3845 -- 3. Check case of nested aggregate. Generally nested aggregates are
3846 -- handled during the processing of the parent aggregate.
3848 -- 4. Check if the aggregate can be statically processed. If this is the
3849 -- case pass it as is to Gigi. Note that a necessary condition for
3850 -- static processing is that the aggregate be fully positional.
3852 -- 5. If in place aggregate expansion is possible (i.e. no need to create
3853 -- a temporary) then mark the aggregate as such and return. Otherwise
3854 -- create a new temporary and generate the appropriate initialization
3857 procedure Expand_Array_Aggregate (N : Node_Id) is
3858 Loc : constant Source_Ptr := Sloc (N);
3860 Typ : constant Entity_Id := Etype (N);
3861 Ctyp : constant Entity_Id := Component_Type (Typ);
3862 -- Typ is the correct constrained array subtype of the aggregate
3863 -- Ctyp is the corresponding component type.
3865 Aggr_Dimension : constant Pos := Number_Dimensions (Typ);
3866 -- Number of aggregate index dimensions
3868 Aggr_Low : array (1 .. Aggr_Dimension) of Node_Id;
3869 Aggr_High : array (1 .. Aggr_Dimension) of Node_Id;
3870 -- Low and High bounds of the constraint for each aggregate index
3872 Aggr_Index_Typ : array (1 .. Aggr_Dimension) of Entity_Id;
3873 -- The type of each index
3875 Maybe_In_Place_OK : Boolean;
3876 -- If the type is neither controlled nor packed and the aggregate
3877 -- is the expression in an assignment, assignment in place may be
3878 -- possible, provided other conditions are met on the LHS.
3880 Others_Present : array (1 .. Aggr_Dimension) of Boolean :=
3882 -- If Others_Present (J) is True, then there is an others choice
3883 -- in one of the sub-aggregates of N at dimension J.
3885 procedure Build_Constrained_Type (Positional : Boolean);
3886 -- If the subtype is not static or unconstrained, build a constrained
3887 -- type using the computable sizes of the aggregate and its sub-
3890 procedure Check_Bounds (Aggr_Bounds : Node_Id; Index_Bounds : Node_Id);
3891 -- Checks that the bounds of Aggr_Bounds are within the bounds defined
3894 procedure Check_Same_Aggr_Bounds (Sub_Aggr : Node_Id; Dim : Pos);
3895 -- Checks that in a multi-dimensional array aggregate all subaggregates
3896 -- corresponding to the same dimension have the same bounds.
3897 -- Sub_Aggr is an array sub-aggregate. Dim is the dimension
3898 -- corresponding to the sub-aggregate.
3900 procedure Compute_Others_Present (Sub_Aggr : Node_Id; Dim : Pos);
3901 -- Computes the values of array Others_Present. Sub_Aggr is the
3902 -- array sub-aggregate we start the computation from. Dim is the
3903 -- dimension corresponding to the sub-aggregate.
3905 function Has_Address_Clause (D : Node_Id) return Boolean;
3906 -- If the aggregate is the expression in an object declaration, it
3907 -- cannot be expanded in place. This function does a lookahead in the
3908 -- current declarative part to find an address clause for the object
3911 function In_Place_Assign_OK return Boolean;
3912 -- Simple predicate to determine whether an aggregate assignment can
3913 -- be done in place, because none of the new values can depend on the
3914 -- components of the target of the assignment.
3916 procedure Others_Check (Sub_Aggr : Node_Id; Dim : Pos);
3917 -- Checks that if an others choice is present in any sub-aggregate no
3918 -- aggregate index is outside the bounds of the index constraint.
3919 -- Sub_Aggr is an array sub-aggregate. Dim is the dimension
3920 -- corresponding to the sub-aggregate.
3922 ----------------------------
3923 -- Build_Constrained_Type --
3924 ----------------------------
3926 procedure Build_Constrained_Type (Positional : Boolean) is
3927 Loc : constant Source_Ptr := Sloc (N);
3928 Agg_Type : Entity_Id;
3931 Typ : constant Entity_Id := Etype (N);
3932 Indices : constant List_Id := New_List;
3938 Make_Defining_Identifier (
3939 Loc, New_Internal_Name ('A'));
3941 -- If the aggregate is purely positional, all its subaggregates
3942 -- have the same size. We collect the dimensions from the first
3943 -- subaggregate at each level.
3948 for D in 1 .. Number_Dimensions (Typ) loop
3949 Sub_Agg := First (Expressions (Sub_Agg));
3953 while Present (Comp) loop
3960 Low_Bound => Make_Integer_Literal (Loc, 1),
3962 Make_Integer_Literal (Loc, Num)),
3967 -- We know the aggregate type is unconstrained and the aggregate
3968 -- is not processable by the back end, therefore not necessarily
3969 -- positional. Retrieve each dimension bounds (computed earlier).
3972 for D in 1 .. Number_Dimensions (Typ) loop
3975 Low_Bound => Aggr_Low (D),
3976 High_Bound => Aggr_High (D)),
3982 Make_Full_Type_Declaration (Loc,
3983 Defining_Identifier => Agg_Type,
3985 Make_Constrained_Array_Definition (Loc,
3986 Discrete_Subtype_Definitions => Indices,
3987 Component_Definition =>
3988 Make_Component_Definition (Loc,
3989 Aliased_Present => False,
3990 Subtype_Indication =>
3991 New_Occurrence_Of (Component_Type (Typ), Loc))));
3993 Insert_Action (N, Decl);
3995 Set_Etype (N, Agg_Type);
3996 Set_Is_Itype (Agg_Type);
3997 Freeze_Itype (Agg_Type, N);
3998 end Build_Constrained_Type;
4004 procedure Check_Bounds (Aggr_Bounds : Node_Id; Index_Bounds : Node_Id) is
4011 Cond : Node_Id := Empty;
4014 Get_Index_Bounds (Aggr_Bounds, Aggr_Lo, Aggr_Hi);
4015 Get_Index_Bounds (Index_Bounds, Ind_Lo, Ind_Hi);
4017 -- Generate the following test:
4019 -- [constraint_error when
4020 -- Aggr_Lo <= Aggr_Hi and then
4021 -- (Aggr_Lo < Ind_Lo or else Aggr_Hi > Ind_Hi)]
4023 -- As an optimization try to see if some tests are trivially vacuos
4024 -- because we are comparing an expression against itself.
4026 if Aggr_Lo = Ind_Lo and then Aggr_Hi = Ind_Hi then
4029 elsif Aggr_Hi = Ind_Hi then
4032 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4033 Right_Opnd => Duplicate_Subexpr_Move_Checks (Ind_Lo));
4035 elsif Aggr_Lo = Ind_Lo then
4038 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Hi),
4039 Right_Opnd => Duplicate_Subexpr_Move_Checks (Ind_Hi));
4046 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4047 Right_Opnd => Duplicate_Subexpr_Move_Checks (Ind_Lo)),
4051 Left_Opnd => Duplicate_Subexpr (Aggr_Hi),
4052 Right_Opnd => Duplicate_Subexpr (Ind_Hi)));
4055 if Present (Cond) then
4060 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4061 Right_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Hi)),
4063 Right_Opnd => Cond);
4065 Set_Analyzed (Left_Opnd (Left_Opnd (Cond)), False);
4066 Set_Analyzed (Right_Opnd (Left_Opnd (Cond)), False);
4068 Make_Raise_Constraint_Error (Loc,
4070 Reason => CE_Length_Check_Failed));
4074 ----------------------------
4075 -- Check_Same_Aggr_Bounds --
4076 ----------------------------
4078 procedure Check_Same_Aggr_Bounds (Sub_Aggr : Node_Id; Dim : Pos) is
4079 Sub_Lo : constant Node_Id := Low_Bound (Aggregate_Bounds (Sub_Aggr));
4080 Sub_Hi : constant Node_Id := High_Bound (Aggregate_Bounds (Sub_Aggr));
4081 -- The bounds of this specific sub-aggregate
4083 Aggr_Lo : constant Node_Id := Aggr_Low (Dim);
4084 Aggr_Hi : constant Node_Id := Aggr_High (Dim);
4085 -- The bounds of the aggregate for this dimension
4087 Ind_Typ : constant Entity_Id := Aggr_Index_Typ (Dim);
4088 -- The index type for this dimension.xxx
4090 Cond : Node_Id := Empty;
4095 -- If index checks are on generate the test
4097 -- [constraint_error when
4098 -- Aggr_Lo /= Sub_Lo or else Aggr_Hi /= Sub_Hi]
4100 -- As an optimization try to see if some tests are trivially vacuos
4101 -- because we are comparing an expression against itself. Also for
4102 -- the first dimension the test is trivially vacuous because there
4103 -- is just one aggregate for dimension 1.
4105 if Index_Checks_Suppressed (Ind_Typ) then
4109 or else (Aggr_Lo = Sub_Lo and then Aggr_Hi = Sub_Hi)
4113 elsif Aggr_Hi = Sub_Hi then
4116 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4117 Right_Opnd => Duplicate_Subexpr_Move_Checks (Sub_Lo));
4119 elsif Aggr_Lo = Sub_Lo then
4122 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Hi),
4123 Right_Opnd => Duplicate_Subexpr_Move_Checks (Sub_Hi));
4130 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4131 Right_Opnd => Duplicate_Subexpr_Move_Checks (Sub_Lo)),
4135 Left_Opnd => Duplicate_Subexpr (Aggr_Hi),
4136 Right_Opnd => Duplicate_Subexpr (Sub_Hi)));
4139 if Present (Cond) then
4141 Make_Raise_Constraint_Error (Loc,
4143 Reason => CE_Length_Check_Failed));
4146 -- Now look inside the sub-aggregate to see if there is more work
4148 if Dim < Aggr_Dimension then
4150 -- Process positional components
4152 if Present (Expressions (Sub_Aggr)) then
4153 Expr := First (Expressions (Sub_Aggr));
4154 while Present (Expr) loop
4155 Check_Same_Aggr_Bounds (Expr, Dim + 1);
4160 -- Process component associations
4162 if Present (Component_Associations (Sub_Aggr)) then
4163 Assoc := First (Component_Associations (Sub_Aggr));
4164 while Present (Assoc) loop
4165 Expr := Expression (Assoc);
4166 Check_Same_Aggr_Bounds (Expr, Dim + 1);
4171 end Check_Same_Aggr_Bounds;
4173 ----------------------------
4174 -- Compute_Others_Present --
4175 ----------------------------
4177 procedure Compute_Others_Present (Sub_Aggr : Node_Id; Dim : Pos) is
4182 if Present (Component_Associations (Sub_Aggr)) then
4183 Assoc := Last (Component_Associations (Sub_Aggr));
4185 if Nkind (First (Choices (Assoc))) = N_Others_Choice then
4186 Others_Present (Dim) := True;
4190 -- Now look inside the sub-aggregate to see if there is more work
4192 if Dim < Aggr_Dimension then
4194 -- Process positional components
4196 if Present (Expressions (Sub_Aggr)) then
4197 Expr := First (Expressions (Sub_Aggr));
4198 while Present (Expr) loop
4199 Compute_Others_Present (Expr, Dim + 1);
4204 -- Process component associations
4206 if Present (Component_Associations (Sub_Aggr)) then
4207 Assoc := First (Component_Associations (Sub_Aggr));
4208 while Present (Assoc) loop
4209 Expr := Expression (Assoc);
4210 Compute_Others_Present (Expr, Dim + 1);
4215 end Compute_Others_Present;
4217 ------------------------
4218 -- Has_Address_Clause --
4219 ------------------------
4221 function Has_Address_Clause (D : Node_Id) return Boolean is
4222 Id : constant Entity_Id := Defining_Identifier (D);
4227 while Present (Decl) loop
4228 if Nkind (Decl) = N_At_Clause
4229 and then Chars (Identifier (Decl)) = Chars (Id)
4233 elsif Nkind (Decl) = N_Attribute_Definition_Clause
4234 and then Chars (Decl) = Name_Address
4235 and then Chars (Name (Decl)) = Chars (Id)
4244 end Has_Address_Clause;
4246 ------------------------
4247 -- In_Place_Assign_OK --
4248 ------------------------
4250 function In_Place_Assign_OK return Boolean is
4258 function Is_Others_Aggregate (Aggr : Node_Id) return Boolean;
4259 -- Aggregates that consist of a single Others choice are safe
4260 -- if the single expression is.
4262 function Safe_Aggregate (Aggr : Node_Id) return Boolean;
4263 -- Check recursively that each component of a (sub)aggregate does
4264 -- not depend on the variable being assigned to.
4266 function Safe_Component (Expr : Node_Id) return Boolean;
4267 -- Verify that an expression cannot depend on the variable being
4268 -- assigned to. Room for improvement here (but less than before).
4270 -------------------------
4271 -- Is_Others_Aggregate --
4272 -------------------------
4274 function Is_Others_Aggregate (Aggr : Node_Id) return Boolean is
4276 return No (Expressions (Aggr))
4278 (First (Choices (First (Component_Associations (Aggr)))))
4280 end Is_Others_Aggregate;
4282 --------------------
4283 -- Safe_Aggregate --
4284 --------------------
4286 function Safe_Aggregate (Aggr : Node_Id) return Boolean is
4290 if Present (Expressions (Aggr)) then
4291 Expr := First (Expressions (Aggr));
4292 while Present (Expr) loop
4293 if Nkind (Expr) = N_Aggregate then
4294 if not Safe_Aggregate (Expr) then
4298 elsif not Safe_Component (Expr) then
4306 if Present (Component_Associations (Aggr)) then
4307 Expr := First (Component_Associations (Aggr));
4308 while Present (Expr) loop
4309 if Nkind (Expression (Expr)) = N_Aggregate then
4310 if not Safe_Aggregate (Expression (Expr)) then
4314 elsif not Safe_Component (Expression (Expr)) then
4325 --------------------
4326 -- Safe_Component --
4327 --------------------
4329 function Safe_Component (Expr : Node_Id) return Boolean is
4330 Comp : Node_Id := Expr;
4332 function Check_Component (Comp : Node_Id) return Boolean;
4333 -- Do the recursive traversal, after copy
4335 ---------------------
4336 -- Check_Component --
4337 ---------------------
4339 function Check_Component (Comp : Node_Id) return Boolean is
4341 if Is_Overloaded (Comp) then
4345 return Compile_Time_Known_Value (Comp)
4347 or else (Is_Entity_Name (Comp)
4348 and then Present (Entity (Comp))
4349 and then No (Renamed_Object (Entity (Comp))))
4351 or else (Nkind (Comp) = N_Attribute_Reference
4352 and then Check_Component (Prefix (Comp)))
4354 or else (Nkind (Comp) in N_Binary_Op
4355 and then Check_Component (Left_Opnd (Comp))
4356 and then Check_Component (Right_Opnd (Comp)))
4358 or else (Nkind (Comp) in N_Unary_Op
4359 and then Check_Component (Right_Opnd (Comp)))
4361 or else (Nkind (Comp) = N_Selected_Component
4362 and then Check_Component (Prefix (Comp)))
4364 or else (Nkind (Comp) = N_Unchecked_Type_Conversion
4365 and then Check_Component (Expression (Comp)));
4366 end Check_Component;
4368 -- Start of processing for Safe_Component
4371 -- If the component appears in an association that may
4372 -- correspond to more than one element, it is not analyzed
4373 -- before the expansion into assignments, to avoid side effects.
4374 -- We analyze, but do not resolve the copy, to obtain sufficient
4375 -- entity information for the checks that follow. If component is
4376 -- overloaded we assume an unsafe function call.
4378 if not Analyzed (Comp) then
4379 if Is_Overloaded (Expr) then
4382 elsif Nkind (Expr) = N_Aggregate
4383 and then not Is_Others_Aggregate (Expr)
4387 elsif Nkind (Expr) = N_Allocator then
4389 -- For now, too complex to analyze
4394 Comp := New_Copy_Tree (Expr);
4395 Set_Parent (Comp, Parent (Expr));
4399 if Nkind (Comp) = N_Aggregate then
4400 return Safe_Aggregate (Comp);
4402 return Check_Component (Comp);
4406 -- Start of processing for In_Place_Assign_OK
4409 if Present (Component_Associations (N)) then
4411 -- On assignment, sliding can take place, so we cannot do the
4412 -- assignment in place unless the bounds of the aggregate are
4413 -- statically equal to those of the target.
4415 -- If the aggregate is given by an others choice, the bounds
4416 -- are derived from the left-hand side, and the assignment is
4417 -- safe if the expression is.
4419 if Is_Others_Aggregate (N) then
4422 (Expression (First (Component_Associations (N))));
4425 Aggr_In := First_Index (Etype (N));
4426 if Nkind (Parent (N)) = N_Assignment_Statement then
4427 Obj_In := First_Index (Etype (Name (Parent (N))));
4430 -- Context is an allocator. Check bounds of aggregate
4431 -- against given type in qualified expression.
4433 pragma Assert (Nkind (Parent (Parent (N))) = N_Allocator);
4435 First_Index (Etype (Entity (Subtype_Mark (Parent (N)))));
4438 while Present (Aggr_In) loop
4439 Get_Index_Bounds (Aggr_In, Aggr_Lo, Aggr_Hi);
4440 Get_Index_Bounds (Obj_In, Obj_Lo, Obj_Hi);
4442 if not Compile_Time_Known_Value (Aggr_Lo)
4443 or else not Compile_Time_Known_Value (Aggr_Hi)
4444 or else not Compile_Time_Known_Value (Obj_Lo)
4445 or else not Compile_Time_Known_Value (Obj_Hi)
4446 or else Expr_Value (Aggr_Lo) /= Expr_Value (Obj_Lo)
4447 or else Expr_Value (Aggr_Hi) /= Expr_Value (Obj_Hi)
4452 Next_Index (Aggr_In);
4453 Next_Index (Obj_In);
4457 -- Now check the component values themselves
4459 return Safe_Aggregate (N);
4460 end In_Place_Assign_OK;
4466 procedure Others_Check (Sub_Aggr : Node_Id; Dim : Pos) is
4467 Aggr_Lo : constant Node_Id := Aggr_Low (Dim);
4468 Aggr_Hi : constant Node_Id := Aggr_High (Dim);
4469 -- The bounds of the aggregate for this dimension
4471 Ind_Typ : constant Entity_Id := Aggr_Index_Typ (Dim);
4472 -- The index type for this dimension
4474 Need_To_Check : Boolean := False;
4476 Choices_Lo : Node_Id := Empty;
4477 Choices_Hi : Node_Id := Empty;
4478 -- The lowest and highest discrete choices for a named sub-aggregate
4480 Nb_Choices : Int := -1;
4481 -- The number of discrete non-others choices in this sub-aggregate
4483 Nb_Elements : Uint := Uint_0;
4484 -- The number of elements in a positional aggregate
4486 Cond : Node_Id := Empty;
4493 -- Check if we have an others choice. If we do make sure that this
4494 -- sub-aggregate contains at least one element in addition to the
4497 if Range_Checks_Suppressed (Ind_Typ) then
4498 Need_To_Check := False;
4500 elsif Present (Expressions (Sub_Aggr))
4501 and then Present (Component_Associations (Sub_Aggr))
4503 Need_To_Check := True;
4505 elsif Present (Component_Associations (Sub_Aggr)) then
4506 Assoc := Last (Component_Associations (Sub_Aggr));
4508 if Nkind (First (Choices (Assoc))) /= N_Others_Choice then
4509 Need_To_Check := False;
4512 -- Count the number of discrete choices. Start with -1 because
4513 -- the others choice does not count.
4516 Assoc := First (Component_Associations (Sub_Aggr));
4517 while Present (Assoc) loop
4518 Choice := First (Choices (Assoc));
4519 while Present (Choice) loop
4520 Nb_Choices := Nb_Choices + 1;
4527 -- If there is only an others choice nothing to do
4529 Need_To_Check := (Nb_Choices > 0);
4533 Need_To_Check := False;
4536 -- If we are dealing with a positional sub-aggregate with an others
4537 -- choice then compute the number or positional elements.
4539 if Need_To_Check and then Present (Expressions (Sub_Aggr)) then
4540 Expr := First (Expressions (Sub_Aggr));
4541 Nb_Elements := Uint_0;
4542 while Present (Expr) loop
4543 Nb_Elements := Nb_Elements + 1;
4547 -- If the aggregate contains discrete choices and an others choice
4548 -- compute the smallest and largest discrete choice values.
4550 elsif Need_To_Check then
4551 Compute_Choices_Lo_And_Choices_Hi : declare
4553 Table : Case_Table_Type (1 .. Nb_Choices);
4554 -- Used to sort all the different choice values
4561 Assoc := First (Component_Associations (Sub_Aggr));
4562 while Present (Assoc) loop
4563 Choice := First (Choices (Assoc));
4564 while Present (Choice) loop
4565 if Nkind (Choice) = N_Others_Choice then
4569 Get_Index_Bounds (Choice, Low, High);
4570 Table (J).Choice_Lo := Low;
4571 Table (J).Choice_Hi := High;
4580 -- Sort the discrete choices
4582 Sort_Case_Table (Table);
4584 Choices_Lo := Table (1).Choice_Lo;
4585 Choices_Hi := Table (Nb_Choices).Choice_Hi;
4586 end Compute_Choices_Lo_And_Choices_Hi;
4589 -- If no others choice in this sub-aggregate, or the aggregate
4590 -- comprises only an others choice, nothing to do.
4592 if not Need_To_Check then
4595 -- If we are dealing with an aggregate containing an others choice
4596 -- and positional components, we generate the following test:
4598 -- if Ind_Typ'Pos (Aggr_Lo) + (Nb_Elements - 1) >
4599 -- Ind_Typ'Pos (Aggr_Hi)
4601 -- raise Constraint_Error;
4604 elsif Nb_Elements > Uint_0 then
4610 Make_Attribute_Reference (Loc,
4611 Prefix => New_Reference_To (Ind_Typ, Loc),
4612 Attribute_Name => Name_Pos,
4615 (Duplicate_Subexpr_Move_Checks (Aggr_Lo))),
4616 Right_Opnd => Make_Integer_Literal (Loc, Nb_Elements - 1)),
4619 Make_Attribute_Reference (Loc,
4620 Prefix => New_Reference_To (Ind_Typ, Loc),
4621 Attribute_Name => Name_Pos,
4622 Expressions => New_List (
4623 Duplicate_Subexpr_Move_Checks (Aggr_Hi))));
4625 -- If we are dealing with an aggregate containing an others choice
4626 -- and discrete choices we generate the following test:
4628 -- [constraint_error when
4629 -- Choices_Lo < Aggr_Lo or else Choices_Hi > Aggr_Hi];
4637 Duplicate_Subexpr_Move_Checks (Choices_Lo),
4639 Duplicate_Subexpr_Move_Checks (Aggr_Lo)),
4644 Duplicate_Subexpr (Choices_Hi),
4646 Duplicate_Subexpr (Aggr_Hi)));
4649 if Present (Cond) then
4651 Make_Raise_Constraint_Error (Loc,
4653 Reason => CE_Length_Check_Failed));
4656 -- Now look inside the sub-aggregate to see if there is more work
4658 if Dim < Aggr_Dimension then
4660 -- Process positional components
4662 if Present (Expressions (Sub_Aggr)) then
4663 Expr := First (Expressions (Sub_Aggr));
4664 while Present (Expr) loop
4665 Others_Check (Expr, Dim + 1);
4670 -- Process component associations
4672 if Present (Component_Associations (Sub_Aggr)) then
4673 Assoc := First (Component_Associations (Sub_Aggr));
4674 while Present (Assoc) loop
4675 Expr := Expression (Assoc);
4676 Others_Check (Expr, Dim + 1);
4683 -- Remaining Expand_Array_Aggregate variables
4686 -- Holds the temporary aggregate value
4689 -- Holds the declaration of Tmp
4691 Aggr_Code : List_Id;
4692 Parent_Node : Node_Id;
4693 Parent_Kind : Node_Kind;
4695 -- Start of processing for Expand_Array_Aggregate
4698 -- Do not touch the special aggregates of attributes used for Asm calls
4700 if Is_RTE (Ctyp, RE_Asm_Input_Operand)
4701 or else Is_RTE (Ctyp, RE_Asm_Output_Operand)
4706 -- If the semantic analyzer has determined that aggregate N will raise
4707 -- Constraint_Error at run-time, then the aggregate node has been
4708 -- replaced with an N_Raise_Constraint_Error node and we should
4711 pragma Assert (not Raises_Constraint_Error (N));
4715 -- Check that the index range defined by aggregate bounds is
4716 -- compatible with corresponding index subtype.
4718 Index_Compatibility_Check : declare
4719 Aggr_Index_Range : Node_Id := First_Index (Typ);
4720 -- The current aggregate index range
4722 Index_Constraint : Node_Id := First_Index (Etype (Typ));
4723 -- The corresponding index constraint against which we have to
4724 -- check the above aggregate index range.
4727 Compute_Others_Present (N, 1);
4729 for J in 1 .. Aggr_Dimension loop
4730 -- There is no need to emit a check if an others choice is
4731 -- present for this array aggregate dimension since in this
4732 -- case one of N's sub-aggregates has taken its bounds from the
4733 -- context and these bounds must have been checked already. In
4734 -- addition all sub-aggregates corresponding to the same
4735 -- dimension must all have the same bounds (checked in (c) below).
4737 if not Range_Checks_Suppressed (Etype (Index_Constraint))
4738 and then not Others_Present (J)
4740 -- We don't use Checks.Apply_Range_Check here because it emits
4741 -- a spurious check. Namely it checks that the range defined by
4742 -- the aggregate bounds is non empty. But we know this already
4745 Check_Bounds (Aggr_Index_Range, Index_Constraint);
4748 -- Save the low and high bounds of the aggregate index as well as
4749 -- the index type for later use in checks (b) and (c) below.
4751 Aggr_Low (J) := Low_Bound (Aggr_Index_Range);
4752 Aggr_High (J) := High_Bound (Aggr_Index_Range);
4754 Aggr_Index_Typ (J) := Etype (Index_Constraint);
4756 Next_Index (Aggr_Index_Range);
4757 Next_Index (Index_Constraint);
4759 end Index_Compatibility_Check;
4763 -- If an others choice is present check that no aggregate index is
4764 -- outside the bounds of the index constraint.
4766 Others_Check (N, 1);
4770 -- For multidimensional arrays make sure that all subaggregates
4771 -- corresponding to the same dimension have the same bounds.
4773 if Aggr_Dimension > 1 then
4774 Check_Same_Aggr_Bounds (N, 1);
4779 -- Here we test for is packed array aggregate that we can handle at
4780 -- compile time. If so, return with transformation done. Note that we do
4781 -- this even if the aggregate is nested, because once we have done this
4782 -- processing, there is no more nested aggregate!
4784 if Packed_Array_Aggregate_Handled (N) then
4788 -- At this point we try to convert to positional form
4790 if Ekind (Current_Scope) = E_Package
4791 and then Static_Elaboration_Desired (Current_Scope)
4793 Convert_To_Positional (N, Max_Others_Replicate => 100);
4796 Convert_To_Positional (N);
4799 -- if the result is no longer an aggregate (e.g. it may be a string
4800 -- literal, or a temporary which has the needed value), then we are
4801 -- done, since there is no longer a nested aggregate.
4803 if Nkind (N) /= N_Aggregate then
4806 -- We are also done if the result is an analyzed aggregate
4807 -- This case could use more comments ???
4810 and then N /= Original_Node (N)
4815 -- If all aggregate components are compile-time known and the aggregate
4816 -- has been flattened, nothing left to do. The same occurs if the
4817 -- aggregate is used to initialize the components of an statically
4818 -- allocated dispatch table.
4820 if Compile_Time_Known_Aggregate (N)
4821 or else Is_Static_Dispatch_Table_Aggregate (N)
4823 Set_Expansion_Delayed (N, False);
4827 -- Now see if back end processing is possible
4829 if Backend_Processing_Possible (N) then
4831 -- If the aggregate is static but the constraints are not, build
4832 -- a static subtype for the aggregate, so that Gigi can place it
4833 -- in static memory. Perform an unchecked_conversion to the non-
4834 -- static type imposed by the context.
4837 Itype : constant Entity_Id := Etype (N);
4839 Needs_Type : Boolean := False;
4842 Index := First_Index (Itype);
4843 while Present (Index) loop
4844 if not Is_Static_Subtype (Etype (Index)) then
4853 Build_Constrained_Type (Positional => True);
4854 Rewrite (N, Unchecked_Convert_To (Itype, N));
4864 -- Delay expansion for nested aggregates it will be taken care of
4865 -- when the parent aggregate is expanded
4867 Parent_Node := Parent (N);
4868 Parent_Kind := Nkind (Parent_Node);
4870 if Parent_Kind = N_Qualified_Expression then
4871 Parent_Node := Parent (Parent_Node);
4872 Parent_Kind := Nkind (Parent_Node);
4875 if Parent_Kind = N_Aggregate
4876 or else Parent_Kind = N_Extension_Aggregate
4877 or else Parent_Kind = N_Component_Association
4878 or else (Parent_Kind = N_Object_Declaration
4879 and then Controlled_Type (Typ))
4880 or else (Parent_Kind = N_Assignment_Statement
4881 and then Inside_Init_Proc)
4883 if Static_Array_Aggregate (N)
4884 or else Compile_Time_Known_Aggregate (N)
4886 Set_Expansion_Delayed (N, False);
4889 Set_Expansion_Delayed (N);
4896 -- Look if in place aggregate expansion is possible
4898 -- For object declarations we build the aggregate in place, unless
4899 -- the array is bit-packed or the component is controlled.
4901 -- For assignments we do the assignment in place if all the component
4902 -- associations have compile-time known values. For other cases we
4903 -- create a temporary. The analysis for safety of on-line assignment
4904 -- is delicate, i.e. we don't know how to do it fully yet ???
4906 -- For allocators we assign to the designated object in place if the
4907 -- aggregate meets the same conditions as other in-place assignments.
4908 -- In this case the aggregate may not come from source but was created
4909 -- for default initialization, e.g. with Initialize_Scalars.
4911 if Requires_Transient_Scope (Typ) then
4912 Establish_Transient_Scope
4913 (N, Sec_Stack => Has_Controlled_Component (Typ));
4916 if Has_Default_Init_Comps (N) then
4917 Maybe_In_Place_OK := False;
4919 elsif Is_Bit_Packed_Array (Typ)
4920 or else Has_Controlled_Component (Typ)
4922 Maybe_In_Place_OK := False;
4925 Maybe_In_Place_OK :=
4926 (Nkind (Parent (N)) = N_Assignment_Statement
4927 and then Comes_From_Source (N)
4928 and then In_Place_Assign_OK)
4931 (Nkind (Parent (Parent (N))) = N_Allocator
4932 and then In_Place_Assign_OK);
4935 if not Has_Default_Init_Comps (N)
4936 and then Comes_From_Source (Parent (N))
4937 and then Nkind (Parent (N)) = N_Object_Declaration
4939 Must_Slide (Etype (Defining_Identifier (Parent (N))), Typ)
4940 and then N = Expression (Parent (N))
4941 and then not Is_Bit_Packed_Array (Typ)
4942 and then not Has_Controlled_Component (Typ)
4943 and then not Has_Address_Clause (Parent (N))
4945 Tmp := Defining_Identifier (Parent (N));
4946 Set_No_Initialization (Parent (N));
4947 Set_Expression (Parent (N), Empty);
4949 -- Set the type of the entity, for use in the analysis of the
4950 -- subsequent indexed assignments. If the nominal type is not
4951 -- constrained, build a subtype from the known bounds of the
4952 -- aggregate. If the declaration has a subtype mark, use it,
4953 -- otherwise use the itype of the aggregate.
4955 if not Is_Constrained (Typ) then
4956 Build_Constrained_Type (Positional => False);
4957 elsif Is_Entity_Name (Object_Definition (Parent (N)))
4958 and then Is_Constrained (Entity (Object_Definition (Parent (N))))
4960 Set_Etype (Tmp, Entity (Object_Definition (Parent (N))));
4962 Set_Size_Known_At_Compile_Time (Typ, False);
4963 Set_Etype (Tmp, Typ);
4966 elsif Maybe_In_Place_OK
4967 and then Nkind (Parent (N)) = N_Qualified_Expression
4968 and then Nkind (Parent (Parent (N))) = N_Allocator
4970 Set_Expansion_Delayed (N);
4973 -- In the remaining cases the aggregate is the RHS of an assignment
4975 elsif Maybe_In_Place_OK
4976 and then Is_Entity_Name (Name (Parent (N)))
4978 Tmp := Entity (Name (Parent (N)));
4980 if Etype (Tmp) /= Etype (N) then
4981 Apply_Length_Check (N, Etype (Tmp));
4983 if Nkind (N) = N_Raise_Constraint_Error then
4985 -- Static error, nothing further to expand
4991 elsif Maybe_In_Place_OK
4992 and then Nkind (Name (Parent (N))) = N_Explicit_Dereference
4993 and then Is_Entity_Name (Prefix (Name (Parent (N))))
4995 Tmp := Name (Parent (N));
4997 if Etype (Tmp) /= Etype (N) then
4998 Apply_Length_Check (N, Etype (Tmp));
5001 elsif Maybe_In_Place_OK
5002 and then Nkind (Name (Parent (N))) = N_Slice
5003 and then Safe_Slice_Assignment (N)
5005 -- Safe_Slice_Assignment rewrites assignment as a loop
5011 -- In place aggregate expansion is not possible
5014 Maybe_In_Place_OK := False;
5015 Tmp := Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
5017 Make_Object_Declaration
5019 Defining_Identifier => Tmp,
5020 Object_Definition => New_Occurrence_Of (Typ, Loc));
5021 Set_No_Initialization (Tmp_Decl, True);
5023 -- If we are within a loop, the temporary will be pushed on the
5024 -- stack at each iteration. If the aggregate is the expression for
5025 -- an allocator, it will be immediately copied to the heap and can
5026 -- be reclaimed at once. We create a transient scope around the
5027 -- aggregate for this purpose.
5029 if Ekind (Current_Scope) = E_Loop
5030 and then Nkind (Parent (Parent (N))) = N_Allocator
5032 Establish_Transient_Scope (N, False);
5035 Insert_Action (N, Tmp_Decl);
5038 -- Construct and insert the aggregate code. We can safely suppress
5039 -- index checks because this code is guaranteed not to raise CE
5040 -- on index checks. However we should *not* suppress all checks.
5046 if Nkind (Tmp) = N_Defining_Identifier then
5047 Target := New_Reference_To (Tmp, Loc);
5051 if Has_Default_Init_Comps (N) then
5053 -- Ada 2005 (AI-287): This case has not been analyzed???
5055 raise Program_Error;
5058 -- Name in assignment is explicit dereference
5060 Target := New_Copy (Tmp);
5064 Build_Array_Aggr_Code (N,
5066 Index => First_Index (Typ),
5068 Scalar_Comp => Is_Scalar_Type (Ctyp));
5071 if Comes_From_Source (Tmp) then
5072 Insert_Actions_After (Parent (N), Aggr_Code);
5075 Insert_Actions (N, Aggr_Code);
5078 -- If the aggregate has been assigned in place, remove the original
5081 if Nkind (Parent (N)) = N_Assignment_Statement
5082 and then Maybe_In_Place_OK
5084 Rewrite (Parent (N), Make_Null_Statement (Loc));
5086 elsif Nkind (Parent (N)) /= N_Object_Declaration
5087 or else Tmp /= Defining_Identifier (Parent (N))
5089 Rewrite (N, New_Occurrence_Of (Tmp, Loc));
5090 Analyze_And_Resolve (N, Typ);
5092 end Expand_Array_Aggregate;
5094 ------------------------
5095 -- Expand_N_Aggregate --
5096 ------------------------
5098 procedure Expand_N_Aggregate (N : Node_Id) is
5100 if Is_Record_Type (Etype (N)) then
5101 Expand_Record_Aggregate (N);
5103 Expand_Array_Aggregate (N);
5106 when RE_Not_Available =>
5108 end Expand_N_Aggregate;
5110 ----------------------------------
5111 -- Expand_N_Extension_Aggregate --
5112 ----------------------------------
5114 -- If the ancestor part is an expression, add a component association for
5115 -- the parent field. If the type of the ancestor part is not the direct
5116 -- parent of the expected type, build recursively the needed ancestors.
5117 -- If the ancestor part is a subtype_mark, replace aggregate with a decla-
5118 -- ration for a temporary of the expected type, followed by individual
5119 -- assignments to the given components.
5121 procedure Expand_N_Extension_Aggregate (N : Node_Id) is
5122 Loc : constant Source_Ptr := Sloc (N);
5123 A : constant Node_Id := Ancestor_Part (N);
5124 Typ : constant Entity_Id := Etype (N);
5127 -- If the ancestor is a subtype mark, an init proc must be called
5128 -- on the resulting object which thus has to be materialized in
5131 if Is_Entity_Name (A) and then Is_Type (Entity (A)) then
5132 Convert_To_Assignments (N, Typ);
5134 -- The extension aggregate is transformed into a record aggregate
5135 -- of the following form (c1 and c2 are inherited components)
5137 -- (Exp with c3 => a, c4 => b)
5138 -- ==> (c1 => Exp.c1, c2 => Exp.c2, c1 => a, c2 => b)
5143 if VM_Target = No_VM then
5144 Expand_Record_Aggregate (N,
5147 (Node (First_Elmt (Access_Disp_Table (Typ))), Loc),
5150 -- No tag is needed in the case of a VM
5151 Expand_Record_Aggregate (N,
5157 when RE_Not_Available =>
5159 end Expand_N_Extension_Aggregate;
5161 -----------------------------
5162 -- Expand_Record_Aggregate --
5163 -----------------------------
5165 procedure Expand_Record_Aggregate
5167 Orig_Tag : Node_Id := Empty;
5168 Parent_Expr : Node_Id := Empty)
5170 Loc : constant Source_Ptr := Sloc (N);
5171 Comps : constant List_Id := Component_Associations (N);
5172 Typ : constant Entity_Id := Etype (N);
5173 Base_Typ : constant Entity_Id := Base_Type (Typ);
5175 Static_Components : Boolean := True;
5176 -- Flag to indicate whether all components are compile-time known,
5177 -- and the aggregate can be constructed statically and handled by
5180 function Component_Not_OK_For_Backend return Boolean;
5181 -- Check for presence of component which makes it impossible for the
5182 -- backend to process the aggregate, thus requiring the use of a series
5183 -- of assignment statements. Cases checked for are a nested aggregate
5184 -- needing Late_Expansion, the presence of a tagged component which may
5185 -- need tag adjustment, and a bit unaligned component reference.
5187 ----------------------------------
5188 -- Component_Not_OK_For_Backend --
5189 ----------------------------------
5191 function Component_Not_OK_For_Backend return Boolean is
5201 while Present (C) loop
5202 if Nkind (Expression (C)) = N_Qualified_Expression then
5203 Expr_Q := Expression (Expression (C));
5205 Expr_Q := Expression (C);
5208 -- Return true if the aggregate has any associations for tagged
5209 -- components that may require tag adjustment.
5211 -- These are cases where the source expression may have a tag that
5212 -- could differ from the component tag (e.g., can occur for type
5213 -- conversions and formal parameters). (Tag adjustment not needed
5214 -- if VM_Target because object tags are implicit in the machine.)
5216 if Is_Tagged_Type (Etype (Expr_Q))
5217 and then (Nkind (Expr_Q) = N_Type_Conversion
5218 or else (Is_Entity_Name (Expr_Q)
5220 Ekind (Entity (Expr_Q)) in Formal_Kind))
5221 and then VM_Target = No_VM
5223 Static_Components := False;
5226 elsif Is_Delayed_Aggregate (Expr_Q) then
5227 Static_Components := False;
5230 elsif Possible_Bit_Aligned_Component (Expr_Q) then
5231 Static_Components := False;
5235 if Is_Scalar_Type (Etype (Expr_Q)) then
5236 if not Compile_Time_Known_Value (Expr_Q) then
5237 Static_Components := False;
5240 elsif Nkind (Expr_Q) /= N_Aggregate
5241 or else not Compile_Time_Known_Aggregate (Expr_Q)
5243 Static_Components := False;
5250 end Component_Not_OK_For_Backend;
5252 -- Remaining Expand_Record_Aggregate variables
5254 Tag_Value : Node_Id;
5258 -- Start of processing for Expand_Record_Aggregate
5261 -- If the aggregate is to be assigned to an atomic variable, we
5262 -- have to prevent a piecemeal assignment even if the aggregate
5263 -- is to be expanded. We create a temporary for the aggregate, and
5264 -- assign the temporary instead, so that the back end can generate
5265 -- an atomic move for it.
5268 and then (Nkind (Parent (N)) = N_Object_Declaration
5269 or else Nkind (Parent (N)) = N_Assignment_Statement)
5270 and then Comes_From_Source (Parent (N))
5272 Expand_Atomic_Aggregate (N, Typ);
5275 -- No special management required for aggregates used to initialize
5276 -- statically allocated dispatch tables
5278 elsif Is_Static_Dispatch_Table_Aggregate (N) then
5282 -- Ada 2005 (AI-318-2): We need to convert to assignments if components
5283 -- are build-in-place function calls. This test could be more specific,
5284 -- but doing it for all inherently limited aggregates seems harmless.
5285 -- The assignments will turn into build-in-place function calls (see
5286 -- Make_Build_In_Place_Call_In_Assignment).
5288 if Ada_Version >= Ada_05 and then Is_Inherently_Limited_Type (Typ) then
5289 Convert_To_Assignments (N, Typ);
5291 -- Gigi doesn't handle properly temporaries of variable size
5292 -- so we generate it in the front-end
5294 elsif not Size_Known_At_Compile_Time (Typ) then
5295 Convert_To_Assignments (N, Typ);
5297 -- Temporaries for controlled aggregates need to be attached to a
5298 -- final chain in order to be properly finalized, so it has to
5299 -- be created in the front-end
5301 elsif Is_Controlled (Typ)
5302 or else Has_Controlled_Component (Base_Type (Typ))
5304 Convert_To_Assignments (N, Typ);
5306 -- Ada 2005 (AI-287): In case of default initialized components we
5307 -- convert the aggregate into assignments.
5309 elsif Has_Default_Init_Comps (N) then
5310 Convert_To_Assignments (N, Typ);
5314 elsif Component_Not_OK_For_Backend then
5315 Convert_To_Assignments (N, Typ);
5317 -- If an ancestor is private, some components are not inherited and
5318 -- we cannot expand into a record aggregate
5320 elsif Has_Private_Ancestor (Typ) then
5321 Convert_To_Assignments (N, Typ);
5323 -- ??? The following was done to compile fxacc00.ads in the ACVCs. Gigi
5324 -- is not able to handle the aggregate for Late_Request.
5326 elsif Is_Tagged_Type (Typ) and then Has_Discriminants (Typ) then
5327 Convert_To_Assignments (N, Typ);
5329 -- If the tagged types covers interface types we need to initialize all
5330 -- hidden components containing pointers to secondary dispatch tables.
5332 elsif Is_Tagged_Type (Typ) and then Has_Abstract_Interfaces (Typ) then
5333 Convert_To_Assignments (N, Typ);
5335 -- If some components are mutable, the size of the aggregate component
5336 -- may be disctinct from the default size of the type component, so
5337 -- we need to expand to insure that the back-end copies the proper
5338 -- size of the data.
5340 elsif Has_Mutable_Components (Typ) then
5341 Convert_To_Assignments (N, Typ);
5343 -- If the type involved has any non-bit aligned components, then we are
5344 -- not sure that the back end can handle this case correctly.
5346 elsif Type_May_Have_Bit_Aligned_Components (Typ) then
5347 Convert_To_Assignments (N, Typ);
5349 -- In all other cases, build a proper aggregate handlable by gigi
5352 if Nkind (N) = N_Aggregate then
5354 -- If the aggregate is static and can be handled by the back-end,
5355 -- nothing left to do.
5357 if Static_Components then
5358 Set_Compile_Time_Known_Aggregate (N);
5359 Set_Expansion_Delayed (N, False);
5363 -- If no discriminants, nothing special to do
5365 if not Has_Discriminants (Typ) then
5368 -- Case of discriminants present
5370 elsif Is_Derived_Type (Typ) then
5372 -- For untagged types, non-stored discriminants are replaced
5373 -- with stored discriminants, which are the ones that gigi uses
5374 -- to describe the type and its components.
5376 Generate_Aggregate_For_Derived_Type : declare
5377 Constraints : constant List_Id := New_List;
5378 First_Comp : Node_Id;
5379 Discriminant : Entity_Id;
5381 Num_Disc : Int := 0;
5382 Num_Gird : Int := 0;
5384 procedure Prepend_Stored_Values (T : Entity_Id);
5385 -- Scan the list of stored discriminants of the type, and add
5386 -- their values to the aggregate being built.
5388 ---------------------------
5389 -- Prepend_Stored_Values --
5390 ---------------------------
5392 procedure Prepend_Stored_Values (T : Entity_Id) is
5394 Discriminant := First_Stored_Discriminant (T);
5395 while Present (Discriminant) loop
5397 Make_Component_Association (Loc,
5399 New_List (New_Occurrence_Of (Discriminant, Loc)),
5403 Get_Discriminant_Value (
5406 Discriminant_Constraint (Typ))));
5408 if No (First_Comp) then
5409 Prepend_To (Component_Associations (N), New_Comp);
5411 Insert_After (First_Comp, New_Comp);
5414 First_Comp := New_Comp;
5415 Next_Stored_Discriminant (Discriminant);
5417 end Prepend_Stored_Values;
5419 -- Start of processing for Generate_Aggregate_For_Derived_Type
5422 -- Remove the associations for the discriminant of derived type
5424 First_Comp := First (Component_Associations (N));
5425 while Present (First_Comp) loop
5430 (First (Choices (Comp)))) = E_Discriminant
5433 Num_Disc := Num_Disc + 1;
5437 -- Insert stored discriminant associations in the correct
5438 -- order. If there are more stored discriminants than new
5439 -- discriminants, there is at least one new discriminant that
5440 -- constrains more than one of the stored discriminants. In
5441 -- this case we need to construct a proper subtype of the
5442 -- parent type, in order to supply values to all the
5443 -- components. Otherwise there is one-one correspondence
5444 -- between the constraints and the stored discriminants.
5446 First_Comp := Empty;
5448 Discriminant := First_Stored_Discriminant (Base_Type (Typ));
5449 while Present (Discriminant) loop
5450 Num_Gird := Num_Gird + 1;
5451 Next_Stored_Discriminant (Discriminant);
5454 -- Case of more stored discriminants than new discriminants
5456 if Num_Gird > Num_Disc then
5458 -- Create a proper subtype of the parent type, which is the
5459 -- proper implementation type for the aggregate, and convert
5460 -- it to the intended target type.
5462 Discriminant := First_Stored_Discriminant (Base_Type (Typ));
5463 while Present (Discriminant) loop
5466 Get_Discriminant_Value (
5469 Discriminant_Constraint (Typ)));
5470 Append (New_Comp, Constraints);
5471 Next_Stored_Discriminant (Discriminant);
5475 Make_Subtype_Declaration (Loc,
5476 Defining_Identifier =>
5477 Make_Defining_Identifier (Loc,
5478 New_Internal_Name ('T')),
5479 Subtype_Indication =>
5480 Make_Subtype_Indication (Loc,
5482 New_Occurrence_Of (Etype (Base_Type (Typ)), Loc),
5484 Make_Index_Or_Discriminant_Constraint
5485 (Loc, Constraints)));
5487 Insert_Action (N, Decl);
5488 Prepend_Stored_Values (Base_Type (Typ));
5490 Set_Etype (N, Defining_Identifier (Decl));
5493 Rewrite (N, Unchecked_Convert_To (Typ, N));
5496 -- Case where we do not have fewer new discriminants than
5497 -- stored discriminants, so in this case we can simply use the
5498 -- stored discriminants of the subtype.
5501 Prepend_Stored_Values (Typ);
5503 end Generate_Aggregate_For_Derived_Type;
5506 if Is_Tagged_Type (Typ) then
5508 -- The tagged case, _parent and _tag component must be created
5510 -- Reset null_present unconditionally. tagged records always have
5511 -- at least one field (the tag or the parent)
5513 Set_Null_Record_Present (N, False);
5515 -- When the current aggregate comes from the expansion of an
5516 -- extension aggregate, the parent expr is replaced by an
5517 -- aggregate formed by selected components of this expr
5519 if Present (Parent_Expr)
5520 and then Is_Empty_List (Comps)
5522 Comp := First_Component_Or_Discriminant (Typ);
5523 while Present (Comp) loop
5525 -- Skip all expander-generated components
5528 not Comes_From_Source (Original_Record_Component (Comp))
5534 Make_Selected_Component (Loc,
5536 Unchecked_Convert_To (Typ,
5537 Duplicate_Subexpr (Parent_Expr, True)),
5539 Selector_Name => New_Occurrence_Of (Comp, Loc));
5542 Make_Component_Association (Loc,
5544 New_List (New_Occurrence_Of (Comp, Loc)),
5548 Analyze_And_Resolve (New_Comp, Etype (Comp));
5551 Next_Component_Or_Discriminant (Comp);
5555 -- Compute the value for the Tag now, if the type is a root it
5556 -- will be included in the aggregate right away, otherwise it will
5557 -- be propagated to the parent aggregate
5559 if Present (Orig_Tag) then
5560 Tag_Value := Orig_Tag;
5561 elsif VM_Target /= No_VM then
5566 (Node (First_Elmt (Access_Disp_Table (Typ))), Loc);
5569 -- For a derived type, an aggregate for the parent is formed with
5570 -- all the inherited components.
5572 if Is_Derived_Type (Typ) then
5575 First_Comp : Node_Id;
5576 Parent_Comps : List_Id;
5577 Parent_Aggr : Node_Id;
5578 Parent_Name : Node_Id;
5581 -- Remove the inherited component association from the
5582 -- aggregate and store them in the parent aggregate
5584 First_Comp := First (Component_Associations (N));
5585 Parent_Comps := New_List;
5586 while Present (First_Comp)
5587 and then Scope (Original_Record_Component (
5588 Entity (First (Choices (First_Comp))))) /= Base_Typ
5593 Append (Comp, Parent_Comps);
5596 Parent_Aggr := Make_Aggregate (Loc,
5597 Component_Associations => Parent_Comps);
5598 Set_Etype (Parent_Aggr, Etype (Base_Type (Typ)));
5600 -- Find the _parent component
5602 Comp := First_Component (Typ);
5603 while Chars (Comp) /= Name_uParent loop
5604 Comp := Next_Component (Comp);
5607 Parent_Name := New_Occurrence_Of (Comp, Loc);
5609 -- Insert the parent aggregate
5611 Prepend_To (Component_Associations (N),
5612 Make_Component_Association (Loc,
5613 Choices => New_List (Parent_Name),
5614 Expression => Parent_Aggr));
5616 -- Expand recursively the parent propagating the right Tag
5618 Expand_Record_Aggregate (
5619 Parent_Aggr, Tag_Value, Parent_Expr);
5622 -- For a root type, the tag component is added (unless compiling
5623 -- for the VMs, where tags are implicit).
5625 elsif VM_Target = No_VM then
5627 Tag_Name : constant Node_Id :=
5629 (First_Tag_Component (Typ), Loc);
5630 Typ_Tag : constant Entity_Id := RTE (RE_Tag);
5631 Conv_Node : constant Node_Id :=
5632 Unchecked_Convert_To (Typ_Tag, Tag_Value);
5635 Set_Etype (Conv_Node, Typ_Tag);
5636 Prepend_To (Component_Associations (N),
5637 Make_Component_Association (Loc,
5638 Choices => New_List (Tag_Name),
5639 Expression => Conv_Node));
5645 end Expand_Record_Aggregate;
5647 ----------------------------
5648 -- Has_Default_Init_Comps --
5649 ----------------------------
5651 function Has_Default_Init_Comps (N : Node_Id) return Boolean is
5652 Comps : constant List_Id := Component_Associations (N);
5656 pragma Assert (Nkind (N) = N_Aggregate
5657 or else Nkind (N) = N_Extension_Aggregate);
5663 if Has_Self_Reference (N) then
5667 -- Check if any direct component has default initialized components
5670 while Present (C) loop
5671 if Box_Present (C) then
5678 -- Recursive call in case of aggregate expression
5681 while Present (C) loop
5682 Expr := Expression (C);
5685 and then (Nkind (Expr) = N_Aggregate
5686 or else Nkind (Expr) = N_Extension_Aggregate)
5687 and then Has_Default_Init_Comps (Expr)
5696 end Has_Default_Init_Comps;
5698 --------------------------
5699 -- Is_Delayed_Aggregate --
5700 --------------------------
5702 function Is_Delayed_Aggregate (N : Node_Id) return Boolean is
5703 Node : Node_Id := N;
5704 Kind : Node_Kind := Nkind (Node);
5707 if Kind = N_Qualified_Expression then
5708 Node := Expression (Node);
5709 Kind := Nkind (Node);
5712 if Kind /= N_Aggregate and then Kind /= N_Extension_Aggregate then
5715 return Expansion_Delayed (Node);
5717 end Is_Delayed_Aggregate;
5719 ----------------------------------------
5720 -- Is_Static_Dispatch_Table_Aggregate --
5721 ----------------------------------------
5723 function Is_Static_Dispatch_Table_Aggregate (N : Node_Id) return Boolean is
5724 Typ : constant Entity_Id := Base_Type (Etype (N));
5727 return Static_Dispatch_Tables
5728 and then VM_Target = No_VM
5729 and then RTU_Loaded (Ada_Tags)
5731 -- Avoid circularity when rebuilding the compiler
5733 and then Cunit_Entity (Get_Source_Unit (N)) /= RTU_Entity (Ada_Tags)
5734 and then (Typ = RTE (RE_Dispatch_Table_Wrapper)
5736 Typ = RTE (RE_Address_Array)
5738 Typ = RTE (RE_Type_Specific_Data)
5740 Typ = RTE (RE_Tag_Table)
5742 (RTE_Available (RE_Interface_Data)
5743 and then Typ = RTE (RE_Interface_Data))
5745 (RTE_Available (RE_Interfaces_Array)
5746 and then Typ = RTE (RE_Interfaces_Array))
5748 (RTE_Available (RE_Interface_Data_Element)
5749 and then Typ = RTE (RE_Interface_Data_Element)));
5750 end Is_Static_Dispatch_Table_Aggregate;
5752 --------------------
5753 -- Late_Expansion --
5754 --------------------
5756 function Late_Expansion
5760 Flist : Node_Id := Empty;
5761 Obj : Entity_Id := Empty) return List_Id
5764 if Is_Record_Type (Etype (N)) then
5765 return Build_Record_Aggr_Code (N, Typ, Target, Flist, Obj);
5767 else pragma Assert (Is_Array_Type (Etype (N)));
5769 Build_Array_Aggr_Code
5771 Ctype => Component_Type (Etype (N)),
5772 Index => First_Index (Typ),
5774 Scalar_Comp => Is_Scalar_Type (Component_Type (Typ)),
5780 ----------------------------------
5781 -- Make_OK_Assignment_Statement --
5782 ----------------------------------
5784 function Make_OK_Assignment_Statement
5787 Expression : Node_Id) return Node_Id
5790 Set_Assignment_OK (Name);
5792 return Make_Assignment_Statement (Sloc, Name, Expression);
5793 end Make_OK_Assignment_Statement;
5795 -----------------------
5796 -- Number_Of_Choices --
5797 -----------------------
5799 function Number_Of_Choices (N : Node_Id) return Nat is
5803 Nb_Choices : Nat := 0;
5806 if Present (Expressions (N)) then
5810 Assoc := First (Component_Associations (N));
5811 while Present (Assoc) loop
5812 Choice := First (Choices (Assoc));
5813 while Present (Choice) loop
5814 if Nkind (Choice) /= N_Others_Choice then
5815 Nb_Choices := Nb_Choices + 1;
5825 end Number_Of_Choices;
5827 ------------------------------------
5828 -- Packed_Array_Aggregate_Handled --
5829 ------------------------------------
5831 -- The current version of this procedure will handle at compile time
5832 -- any array aggregate that meets these conditions:
5834 -- One dimensional, bit packed
5835 -- Underlying packed type is modular type
5836 -- Bounds are within 32-bit Int range
5837 -- All bounds and values are static
5839 function Packed_Array_Aggregate_Handled (N : Node_Id) return Boolean is
5840 Loc : constant Source_Ptr := Sloc (N);
5841 Typ : constant Entity_Id := Etype (N);
5842 Ctyp : constant Entity_Id := Component_Type (Typ);
5844 Not_Handled : exception;
5845 -- Exception raised if this aggregate cannot be handled
5848 -- For now, handle only one dimensional bit packed arrays
5850 if not Is_Bit_Packed_Array (Typ)
5851 or else Number_Dimensions (Typ) > 1
5852 or else not Is_Modular_Integer_Type (Packed_Array_Type (Typ))
5857 if not Is_Scalar_Type (Component_Type (Typ))
5858 and then Has_Non_Standard_Rep (Component_Type (Typ))
5864 Csiz : constant Nat := UI_To_Int (Component_Size (Typ));
5868 -- Bounds of index type
5872 -- Values of bounds if compile time known
5874 function Get_Component_Val (N : Node_Id) return Uint;
5875 -- Given a expression value N of the component type Ctyp, returns a
5876 -- value of Csiz (component size) bits representing this value. If
5877 -- the value is non-static or any other reason exists why the value
5878 -- cannot be returned, then Not_Handled is raised.
5880 -----------------------
5881 -- Get_Component_Val --
5882 -----------------------
5884 function Get_Component_Val (N : Node_Id) return Uint is
5888 -- We have to analyze the expression here before doing any further
5889 -- processing here. The analysis of such expressions is deferred
5890 -- till expansion to prevent some problems of premature analysis.
5892 Analyze_And_Resolve (N, Ctyp);
5894 -- Must have a compile time value. String literals have to be
5895 -- converted into temporaries as well, because they cannot easily
5896 -- be converted into their bit representation.
5898 if not Compile_Time_Known_Value (N)
5899 or else Nkind (N) = N_String_Literal
5904 Val := Expr_Rep_Value (N);
5906 -- Adjust for bias, and strip proper number of bits
5908 if Has_Biased_Representation (Ctyp) then
5909 Val := Val - Expr_Value (Type_Low_Bound (Ctyp));
5912 return Val mod Uint_2 ** Csiz;
5913 end Get_Component_Val;
5915 -- Here we know we have a one dimensional bit packed array
5918 Get_Index_Bounds (First_Index (Typ), Lo, Hi);
5920 -- Cannot do anything if bounds are dynamic
5922 if not Compile_Time_Known_Value (Lo)
5924 not Compile_Time_Known_Value (Hi)
5929 -- Or are silly out of range of int bounds
5931 Lob := Expr_Value (Lo);
5932 Hib := Expr_Value (Hi);
5934 if not UI_Is_In_Int_Range (Lob)
5936 not UI_Is_In_Int_Range (Hib)
5941 -- At this stage we have a suitable aggregate for handling at compile
5942 -- time (the only remaining checks are that the values of expressions
5943 -- in the aggregate are compile time known (check is performed by
5944 -- Get_Component_Val), and that any subtypes or ranges are statically
5947 -- If the aggregate is not fully positional at this stage, then
5948 -- convert it to positional form. Either this will fail, in which
5949 -- case we can do nothing, or it will succeed, in which case we have
5950 -- succeeded in handling the aggregate, or it will stay an aggregate,
5951 -- in which case we have failed to handle this case.
5953 if Present (Component_Associations (N)) then
5954 Convert_To_Positional
5955 (N, Max_Others_Replicate => 64, Handle_Bit_Packed => True);
5956 return Nkind (N) /= N_Aggregate;
5959 -- Otherwise we are all positional, so convert to proper value
5962 Lov : constant Int := UI_To_Int (Lob);
5963 Hiv : constant Int := UI_To_Int (Hib);
5965 Len : constant Nat := Int'Max (0, Hiv - Lov + 1);
5966 -- The length of the array (number of elements)
5968 Aggregate_Val : Uint;
5969 -- Value of aggregate. The value is set in the low order bits of
5970 -- this value. For the little-endian case, the values are stored
5971 -- from low-order to high-order and for the big-endian case the
5972 -- values are stored from high-order to low-order. Note that gigi
5973 -- will take care of the conversions to left justify the value in
5974 -- the big endian case (because of left justified modular type
5975 -- processing), so we do not have to worry about that here.
5978 -- Integer literal for resulting constructed value
5981 -- Shift count from low order for next value
5984 -- Shift increment for loop
5987 -- Next expression from positional parameters of aggregate
5990 -- For little endian, we fill up the low order bits of the target
5991 -- value. For big endian we fill up the high order bits of the
5992 -- target value (which is a left justified modular value).
5994 if Bytes_Big_Endian xor Debug_Flag_8 then
5995 Shift := Csiz * (Len - 1);
6002 -- Loop to set the values
6005 Aggregate_Val := Uint_0;
6007 Expr := First (Expressions (N));
6008 Aggregate_Val := Get_Component_Val (Expr) * Uint_2 ** Shift;
6010 for J in 2 .. Len loop
6011 Shift := Shift + Incr;
6014 Aggregate_Val + Get_Component_Val (Expr) * Uint_2 ** Shift;
6018 -- Now we can rewrite with the proper value
6021 Make_Integer_Literal (Loc,
6022 Intval => Aggregate_Val);
6023 Set_Print_In_Hex (Lit);
6025 -- Construct the expression using this literal. Note that it is
6026 -- important to qualify the literal with its proper modular type
6027 -- since universal integer does not have the required range and
6028 -- also this is a left justified modular type, which is important
6029 -- in the big-endian case.
6032 Unchecked_Convert_To (Typ,
6033 Make_Qualified_Expression (Loc,
6035 New_Occurrence_Of (Packed_Array_Type (Typ), Loc),
6036 Expression => Lit)));
6038 Analyze_And_Resolve (N, Typ);
6046 end Packed_Array_Aggregate_Handled;
6048 ----------------------------
6049 -- Has_Mutable_Components --
6050 ----------------------------
6052 function Has_Mutable_Components (Typ : Entity_Id) return Boolean is
6056 Comp := First_Component (Typ);
6057 while Present (Comp) loop
6058 if Is_Record_Type (Etype (Comp))
6059 and then Has_Discriminants (Etype (Comp))
6060 and then not Is_Constrained (Etype (Comp))
6065 Next_Component (Comp);
6069 end Has_Mutable_Components;
6071 ------------------------------
6072 -- Initialize_Discriminants --
6073 ------------------------------
6075 procedure Initialize_Discriminants (N : Node_Id; Typ : Entity_Id) is
6076 Loc : constant Source_Ptr := Sloc (N);
6077 Bas : constant Entity_Id := Base_Type (Typ);
6078 Par : constant Entity_Id := Etype (Bas);
6079 Decl : constant Node_Id := Parent (Par);
6083 if Is_Tagged_Type (Bas)
6084 and then Is_Derived_Type (Bas)
6085 and then Has_Discriminants (Par)
6086 and then Has_Discriminants (Bas)
6087 and then Number_Discriminants (Bas) /= Number_Discriminants (Par)
6088 and then Nkind (Decl) = N_Full_Type_Declaration
6089 and then Nkind (Type_Definition (Decl)) = N_Record_Definition
6091 (Variant_Part (Component_List (Type_Definition (Decl))))
6092 and then Nkind (N) /= N_Extension_Aggregate
6095 -- Call init proc to set discriminants.
6096 -- There should eventually be a special procedure for this ???
6098 Ref := New_Reference_To (Defining_Identifier (N), Loc);
6099 Insert_Actions_After (N,
6100 Build_Initialization_Call (Sloc (N), Ref, Typ));
6102 end Initialize_Discriminants;
6109 (Obj_Type : Entity_Id;
6110 Typ : Entity_Id) return Boolean
6112 L1, L2, H1, H2 : Node_Id;
6114 -- No sliding if the type of the object is not established yet, if it is
6115 -- an unconstrained type whose actual subtype comes from the aggregate,
6116 -- or if the two types are identical.
6118 if not Is_Array_Type (Obj_Type) then
6121 elsif not Is_Constrained (Obj_Type) then
6124 elsif Typ = Obj_Type then
6128 -- Sliding can only occur along the first dimension
6130 Get_Index_Bounds (First_Index (Typ), L1, H1);
6131 Get_Index_Bounds (First_Index (Obj_Type), L2, H2);
6133 if not Is_Static_Expression (L1)
6134 or else not Is_Static_Expression (L2)
6135 or else not Is_Static_Expression (H1)
6136 or else not Is_Static_Expression (H2)
6140 return Expr_Value (L1) /= Expr_Value (L2)
6141 or else Expr_Value (H1) /= Expr_Value (H2);
6146 ---------------------------
6147 -- Safe_Slice_Assignment --
6148 ---------------------------
6150 function Safe_Slice_Assignment (N : Node_Id) return Boolean is
6151 Loc : constant Source_Ptr := Sloc (Parent (N));
6152 Pref : constant Node_Id := Prefix (Name (Parent (N)));
6153 Range_Node : constant Node_Id := Discrete_Range (Name (Parent (N)));
6161 -- Generate: for J in Range loop Pref (J) := Expr; end loop;
6163 if Comes_From_Source (N)
6164 and then No (Expressions (N))
6165 and then Nkind (First (Choices (First (Component_Associations (N)))))
6169 Expression (First (Component_Associations (N)));
6170 L_J := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
6173 Make_Iteration_Scheme (Loc,
6174 Loop_Parameter_Specification =>
6175 Make_Loop_Parameter_Specification
6177 Defining_Identifier => L_J,
6178 Discrete_Subtype_Definition => Relocate_Node (Range_Node)));
6181 Make_Assignment_Statement (Loc,
6183 Make_Indexed_Component (Loc,
6184 Prefix => Relocate_Node (Pref),
6185 Expressions => New_List (New_Occurrence_Of (L_J, Loc))),
6186 Expression => Relocate_Node (Expr));
6188 -- Construct the final loop
6191 Make_Implicit_Loop_Statement
6192 (Node => Parent (N),
6193 Identifier => Empty,
6194 Iteration_Scheme => L_Iter,
6195 Statements => New_List (L_Body));
6197 -- Set type of aggregate to be type of lhs in assignment,
6198 -- to suppress redundant length checks.
6200 Set_Etype (N, Etype (Name (Parent (N))));
6202 Rewrite (Parent (N), Stat);
6203 Analyze (Parent (N));
6209 end Safe_Slice_Assignment;
6211 ---------------------
6212 -- Sort_Case_Table --
6213 ---------------------
6215 procedure Sort_Case_Table (Case_Table : in out Case_Table_Type) is
6216 L : constant Int := Case_Table'First;
6217 U : constant Int := Case_Table'Last;
6225 T := Case_Table (K + 1);
6229 and then Expr_Value (Case_Table (J - 1).Choice_Lo) >
6230 Expr_Value (T.Choice_Lo)
6232 Case_Table (J) := Case_Table (J - 1);
6236 Case_Table (J) := T;
6239 end Sort_Case_Table;
6241 ----------------------------
6242 -- Static_Array_Aggregate --
6243 ----------------------------
6245 function Static_Array_Aggregate (N : Node_Id) return Boolean is
6246 Bounds : constant Node_Id := Aggregate_Bounds (N);
6248 Typ : constant Entity_Id := Etype (N);
6249 Comp_Type : constant Entity_Id := Component_Type (Typ);
6256 if Is_Tagged_Type (Typ)
6257 or else Is_Controlled (Typ)
6258 or else Is_Packed (Typ)
6264 and then Nkind (Bounds) = N_Range
6265 and then Nkind (Low_Bound (Bounds)) = N_Integer_Literal
6266 and then Nkind (High_Bound (Bounds)) = N_Integer_Literal
6268 Lo := Low_Bound (Bounds);
6269 Hi := High_Bound (Bounds);
6271 if No (Component_Associations (N)) then
6273 -- Verify that all components are static integers
6275 Expr := First (Expressions (N));
6276 while Present (Expr) loop
6277 if Nkind (Expr) /= N_Integer_Literal then
6287 -- We allow only a single named association, either a static
6288 -- range or an others_clause, with a static expression.
6290 Expr := First (Component_Associations (N));
6292 if Present (Expressions (N)) then
6295 elsif Present (Next (Expr)) then
6298 elsif Present (Next (First (Choices (Expr)))) then
6302 -- The aggregate is static if all components are literals, or
6303 -- else all its components are static aggregates for the
6306 if Is_Array_Type (Comp_Type)
6307 or else Is_Record_Type (Comp_Type)
6309 if Nkind (Expression (Expr)) /= N_Aggregate
6311 not Compile_Time_Known_Aggregate (Expression (Expr))
6316 elsif Nkind (Expression (Expr)) /= N_Integer_Literal then
6320 -- Create a positional aggregate with the right number of
6321 -- copies of the expression.
6323 Agg := Make_Aggregate (Sloc (N), New_List, No_List);
6325 for I in UI_To_Int (Intval (Lo)) .. UI_To_Int (Intval (Hi))
6328 (Expressions (Agg), New_Copy (Expression (Expr)));
6329 Set_Etype (Last (Expressions (Agg)), Component_Type (Typ));
6332 Set_Aggregate_Bounds (Agg, Bounds);
6333 Set_Etype (Agg, Typ);
6336 Set_Compile_Time_Known_Aggregate (N);
6345 end Static_Array_Aggregate;