1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Checks; use Checks;
28 with Debug; use Debug;
29 with Einfo; use Einfo;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Expander; use Expander;
33 with Exp_Util; use Exp_Util;
34 with Exp_Ch3; use Exp_Ch3;
35 with Exp_Ch7; use Exp_Ch7;
36 with Exp_Ch9; use Exp_Ch9;
37 with Exp_Tss; use Exp_Tss;
38 with Fname; use Fname;
39 with Freeze; use Freeze;
40 with Itypes; use Itypes;
42 with Namet; use Namet;
43 with Nmake; use Nmake;
44 with Nlists; use Nlists;
46 with Restrict; use Restrict;
47 with Rident; use Rident;
48 with Rtsfind; use Rtsfind;
49 with Ttypes; use Ttypes;
51 with Sem_Aux; use Sem_Aux;
52 with Sem_Ch3; use Sem_Ch3;
53 with Sem_Eval; use Sem_Eval;
54 with Sem_Res; use Sem_Res;
55 with Sem_Util; use Sem_Util;
56 with Sinfo; use Sinfo;
57 with Snames; use Snames;
58 with Stand; use Stand;
59 with Targparm; use Targparm;
60 with Tbuild; use Tbuild;
61 with Uintp; use Uintp;
63 package body Exp_Aggr is
65 type Case_Bounds is record
68 Choice_Node : Node_Id;
71 type Case_Table_Type is array (Nat range <>) of Case_Bounds;
72 -- Table type used by Check_Case_Choices procedure
75 (Obj_Type : Entity_Id;
76 Typ : Entity_Id) return Boolean;
77 -- A static array aggregate in an object declaration can in most cases be
78 -- expanded in place. The one exception is when the aggregate is given
79 -- with component associations that specify different bounds from those of
80 -- the type definition in the object declaration. In this pathological
81 -- case the aggregate must slide, and we must introduce an intermediate
82 -- temporary to hold it.
84 -- The same holds in an assignment to one-dimensional array of arrays,
85 -- when a component may be given with bounds that differ from those of the
88 procedure Sort_Case_Table (Case_Table : in out Case_Table_Type);
89 -- Sort the Case Table using the Lower Bound of each Choice as the key.
90 -- A simple insertion sort is used since the number of choices in a case
91 -- statement of variant part will usually be small and probably in near
94 function Has_Default_Init_Comps (N : Node_Id) return Boolean;
95 -- N is an aggregate (record or array). Checks the presence of default
96 -- initialization (<>) in any component (Ada 2005: AI-287)
98 function Is_Static_Dispatch_Table_Aggregate (N : Node_Id) return Boolean;
99 -- Returns true if N is an aggregate used to initialize the components
100 -- of an statically allocated dispatch table.
102 ------------------------------------------------------
103 -- Local subprograms for Record Aggregate Expansion --
104 ------------------------------------------------------
106 procedure Expand_Record_Aggregate
108 Orig_Tag : Node_Id := Empty;
109 Parent_Expr : Node_Id := Empty);
110 -- This is the top level procedure for record aggregate expansion.
111 -- Expansion for record aggregates needs expand aggregates for tagged
112 -- record types. Specifically Expand_Record_Aggregate adds the Tag
113 -- field in front of the Component_Association list that was created
114 -- during resolution by Resolve_Record_Aggregate.
116 -- N is the record aggregate node.
117 -- Orig_Tag is the value of the Tag that has to be provided for this
118 -- specific aggregate. It carries the tag corresponding to the type
119 -- of the outermost aggregate during the recursive expansion
120 -- Parent_Expr is the ancestor part of the original extension
123 procedure Convert_To_Assignments (N : Node_Id; Typ : Entity_Id);
124 -- N is an N_Aggregate or an N_Extension_Aggregate. Typ is the type of the
125 -- aggregate (which can only be a record type, this procedure is only used
126 -- for record types). Transform the given aggregate into a sequence of
127 -- assignments performed component by component.
129 function Build_Record_Aggr_Code
133 Flist : Node_Id := Empty;
134 Obj : Entity_Id := Empty;
135 Is_Limited_Ancestor_Expansion : Boolean := False) return List_Id;
136 -- N is an N_Aggregate or an N_Extension_Aggregate. Typ is the type of the
137 -- aggregate. Target is an expression containing the location on which the
138 -- component by component assignments will take place. Returns the list of
139 -- assignments plus all other adjustments needed for tagged and controlled
140 -- types. Flist is an expression representing the finalization list on
141 -- which to attach the controlled components if any. Obj is present in the
142 -- object declaration and dynamic allocation cases, it contains an entity
143 -- that allows to know if the value being created needs to be attached to
144 -- the final list in case of pragma Finalize_Storage_Only.
147 -- The meaning of the Obj formal is extremely unclear. *What* entity
148 -- should be passed? For the object declaration case we may guess that
149 -- this is the object being declared, but what about the allocator case?
151 -- Is_Limited_Ancestor_Expansion indicates that the function has been
152 -- called recursively to expand the limited ancestor to avoid copying it.
154 function Has_Mutable_Components (Typ : Entity_Id) return Boolean;
155 -- Return true if one of the component is of a discriminated type with
156 -- defaults. An aggregate for a type with mutable components must be
157 -- expanded into individual assignments.
159 procedure Initialize_Discriminants (N : Node_Id; Typ : Entity_Id);
160 -- If the type of the aggregate is a type extension with renamed discrimi-
161 -- nants, we must initialize the hidden discriminants of the parent.
162 -- Otherwise, the target object must not be initialized. The discriminants
163 -- are initialized by calling the initialization procedure for the type.
164 -- This is incorrect if the initialization of other components has any
165 -- side effects. We restrict this call to the case where the parent type
166 -- has a variant part, because this is the only case where the hidden
167 -- discriminants are accessed, namely when calling discriminant checking
168 -- functions of the parent type, and when applying a stream attribute to
169 -- an object of the derived type.
171 -----------------------------------------------------
172 -- Local Subprograms for Array Aggregate Expansion --
173 -----------------------------------------------------
175 function Aggr_Size_OK (N : Node_Id; Typ : Entity_Id) return Boolean;
176 -- Very large static aggregates present problems to the back-end, and
177 -- are transformed into assignments and loops. This function verifies
178 -- that the total number of components of an aggregate is acceptable
179 -- for transformation into a purely positional static form. It is called
180 -- prior to calling Flatten.
181 -- This function also detects and warns about one-component aggregates
182 -- that appear in a non-static context. Even if the component value is
183 -- static, such an aggregate must be expanded into an assignment.
185 procedure Convert_Array_Aggr_In_Allocator
189 -- If the aggregate appears within an allocator and can be expanded in
190 -- place, this routine generates the individual assignments to components
191 -- of the designated object. This is an optimization over the general
192 -- case, where a temporary is first created on the stack and then used to
193 -- construct the allocated object on the heap.
195 procedure Convert_To_Positional
197 Max_Others_Replicate : Nat := 5;
198 Handle_Bit_Packed : Boolean := False);
199 -- If possible, convert named notation to positional notation. This
200 -- conversion is possible only in some static cases. If the conversion is
201 -- possible, then N is rewritten with the analyzed converted aggregate.
202 -- The parameter Max_Others_Replicate controls the maximum number of
203 -- values corresponding to an others choice that will be converted to
204 -- positional notation (the default of 5 is the normal limit, and reflects
205 -- the fact that normally the loop is better than a lot of separate
206 -- assignments). Note that this limit gets overridden in any case if
207 -- either of the restrictions No_Elaboration_Code or No_Implicit_Loops is
208 -- set. The parameter Handle_Bit_Packed is usually set False (since we do
209 -- not expect the back end to handle bit packed arrays, so the normal case
210 -- of conversion is pointless), but in the special case of a call from
211 -- Packed_Array_Aggregate_Handled, we set this parameter to True, since
212 -- these are cases we handle in there.
214 procedure Expand_Array_Aggregate (N : Node_Id);
215 -- This is the top-level routine to perform array aggregate expansion.
216 -- N is the N_Aggregate node to be expanded.
218 function Backend_Processing_Possible (N : Node_Id) return Boolean;
219 -- This function checks if array aggregate N can be processed directly
220 -- by the backend. If this is the case True is returned.
222 function Build_Array_Aggr_Code
227 Scalar_Comp : Boolean;
228 Indices : List_Id := No_List;
229 Flist : Node_Id := Empty) return List_Id;
230 -- This recursive routine returns a list of statements containing the
231 -- loops and assignments that are needed for the expansion of the array
234 -- N is the (sub-)aggregate node to be expanded into code. This node
235 -- has been fully analyzed, and its Etype is properly set.
237 -- Index is the index node corresponding to the array sub-aggregate N.
239 -- Into is the target expression into which we are copying the aggregate.
240 -- Note that this node may not have been analyzed yet, and so the Etype
241 -- field may not be set.
243 -- Scalar_Comp is True if the component type of the aggregate is scalar.
245 -- Indices is the current list of expressions used to index the
246 -- object we are writing into.
248 -- Flist is an expression representing the finalization list on which
249 -- to attach the controlled components if any.
251 function Number_Of_Choices (N : Node_Id) return Nat;
252 -- Returns the number of discrete choices (not including the others choice
253 -- if present) contained in (sub-)aggregate N.
255 function Late_Expansion
259 Flist : Node_Id := Empty;
260 Obj : Entity_Id := Empty) return List_Id;
261 -- N is a nested (record or array) aggregate that has been marked with
262 -- 'Delay_Expansion'. Typ is the expected type of the aggregate and Target
263 -- is a (duplicable) expression that will hold the result of the aggregate
264 -- expansion. Flist is the finalization list to be used to attach
265 -- controlled components. 'Obj' when non empty, carries the original
266 -- object being initialized in order to know if it needs to be attached to
267 -- the previous parameter which may not be the case in the case where
268 -- Finalize_Storage_Only is set. Basically this procedure is used to
269 -- implement top-down expansions of nested aggregates. This is necessary
270 -- for avoiding temporaries at each level as well as for propagating the
271 -- right internal finalization list.
273 function Make_OK_Assignment_Statement
276 Expression : Node_Id) return Node_Id;
277 -- This is like Make_Assignment_Statement, except that Assignment_OK
278 -- is set in the left operand. All assignments built by this unit
279 -- use this routine. This is needed to deal with assignments to
280 -- initialized constants that are done in place.
282 function Packed_Array_Aggregate_Handled (N : Node_Id) return Boolean;
283 -- Given an array aggregate, this function handles the case of a packed
284 -- array aggregate with all constant values, where the aggregate can be
285 -- evaluated at compile time. If this is possible, then N is rewritten
286 -- to be its proper compile time value with all the components properly
287 -- assembled. The expression is analyzed and resolved and True is
288 -- returned. If this transformation is not possible, N is unchanged
289 -- and False is returned
291 function Safe_Slice_Assignment (N : Node_Id) return Boolean;
292 -- If a slice assignment has an aggregate with a single others_choice,
293 -- the assignment can be done in place even if bounds are not static,
294 -- by converting it into a loop over the discrete range of the slice.
300 function Aggr_Size_OK (N : Node_Id; Typ : Entity_Id) return Boolean is
308 -- The following constant determines the maximum size of an
309 -- array aggregate produced by converting named to positional
310 -- notation (e.g. from others clauses). This avoids running
311 -- away with attempts to convert huge aggregates, which hit
312 -- memory limits in the backend.
314 -- The normal limit is 5000, but we increase this limit to
315 -- 2**24 (about 16 million) if Restrictions (No_Elaboration_Code)
316 -- or Restrictions (No_Implicit_Loops) is specified, since in
317 -- either case, we are at risk of declaring the program illegal
318 -- because of this limit.
320 Max_Aggr_Size : constant Nat :=
321 5000 + (2 ** 24 - 5000) *
323 (Restriction_Active (No_Elaboration_Code)
325 Restriction_Active (No_Implicit_Loops));
327 function Component_Count (T : Entity_Id) return Int;
328 -- The limit is applied to the total number of components that the
329 -- aggregate will have, which is the number of static expressions
330 -- that will appear in the flattened array. This requires a recursive
331 -- computation of the number of scalar components of the structure.
333 ---------------------
334 -- Component_Count --
335 ---------------------
337 function Component_Count (T : Entity_Id) return Int is
342 if Is_Scalar_Type (T) then
345 elsif Is_Record_Type (T) then
346 Comp := First_Component (T);
347 while Present (Comp) loop
348 Res := Res + Component_Count (Etype (Comp));
349 Next_Component (Comp);
354 elsif Is_Array_Type (T) then
356 Lo : constant Node_Id :=
357 Type_Low_Bound (Etype (First_Index (T)));
358 Hi : constant Node_Id :=
359 Type_High_Bound (Etype (First_Index (T)));
361 Siz : constant Int := Component_Count (Component_Type (T));
364 if not Compile_Time_Known_Value (Lo)
365 or else not Compile_Time_Known_Value (Hi)
370 Siz * UI_To_Int (Expr_Value (Hi) - Expr_Value (Lo) + 1);
375 -- Can only be a null for an access type
381 -- Start of processing for Aggr_Size_OK
384 Siz := Component_Count (Component_Type (Typ));
386 Indx := First_Index (Typ);
387 while Present (Indx) loop
388 Lo := Type_Low_Bound (Etype (Indx));
389 Hi := Type_High_Bound (Etype (Indx));
391 -- Bounds need to be known at compile time
393 if not Compile_Time_Known_Value (Lo)
394 or else not Compile_Time_Known_Value (Hi)
399 Lov := Expr_Value (Lo);
400 Hiv := Expr_Value (Hi);
402 -- A flat array is always safe
408 -- One-component aggregates are suspicious, and if the context type
409 -- is an object declaration with non-static bounds it will trip gcc;
410 -- such an aggregate must be expanded into a single assignment.
413 and then Nkind (Parent (N)) = N_Object_Declaration
416 Index_Type : constant Entity_Id :=
419 (Etype (Defining_Identifier (Parent (N)))));
423 if not Compile_Time_Known_Value (Type_Low_Bound (Index_Type))
424 or else not Compile_Time_Known_Value
425 (Type_High_Bound (Index_Type))
427 if Present (Component_Associations (N)) then
429 First (Choices (First (Component_Associations (N))));
430 if Is_Entity_Name (Indx)
431 and then not Is_Type (Entity (Indx))
434 ("single component aggregate in non-static context?",
436 Error_Msg_N ("\maybe subtype name was meant?", Indx);
446 Rng : constant Uint := Hiv - Lov + 1;
449 -- Check if size is too large
451 if not UI_Is_In_Int_Range (Rng) then
455 Siz := Siz * UI_To_Int (Rng);
459 or else Siz > Max_Aggr_Size
464 -- Bounds must be in integer range, for later array construction
466 if not UI_Is_In_Int_Range (Lov)
468 not UI_Is_In_Int_Range (Hiv)
479 ---------------------------------
480 -- Backend_Processing_Possible --
481 ---------------------------------
483 -- Backend processing by Gigi/gcc is possible only if all the following
484 -- conditions are met:
486 -- 1. N is fully positional
488 -- 2. N is not a bit-packed array aggregate;
490 -- 3. The size of N's array type must be known at compile time. Note
491 -- that this implies that the component size is also known
493 -- 4. The array type of N does not follow the Fortran layout convention
494 -- or if it does it must be 1 dimensional.
496 -- 5. The array component type may not be tagged (which could necessitate
497 -- reassignment of proper tags).
499 -- 6. The array component type must not have unaligned bit components
501 -- 7. None of the components of the aggregate may be bit unaligned
504 -- 8. There cannot be delayed components, since we do not know enough
505 -- at this stage to know if back end processing is possible.
507 -- 9. There cannot be any discriminated record components, since the
508 -- back end cannot handle this complex case.
510 -- 10. No controlled actions need to be generated for components
512 -- 11. For a VM back end, the array should have no aliased components
514 function Backend_Processing_Possible (N : Node_Id) return Boolean is
515 Typ : constant Entity_Id := Etype (N);
516 -- Typ is the correct constrained array subtype of the aggregate
518 function Component_Check (N : Node_Id; Index : Node_Id) return Boolean;
519 -- This routine checks components of aggregate N, enforcing checks
520 -- 1, 7, 8, and 9. In the multi-dimensional case, these checks are
521 -- performed on subaggregates. The Index value is the current index
522 -- being checked in the multi-dimensional case.
524 ---------------------
525 -- Component_Check --
526 ---------------------
528 function Component_Check (N : Node_Id; Index : Node_Id) return Boolean is
532 -- Checks 1: (no component associations)
534 if Present (Component_Associations (N)) then
538 -- Checks on components
540 -- Recurse to check subaggregates, which may appear in qualified
541 -- expressions. If delayed, the front-end will have to expand.
542 -- If the component is a discriminated record, treat as non-static,
543 -- as the back-end cannot handle this properly.
545 Expr := First (Expressions (N));
546 while Present (Expr) loop
548 -- Checks 8: (no delayed components)
550 if Is_Delayed_Aggregate (Expr) then
554 -- Checks 9: (no discriminated records)
556 if Present (Etype (Expr))
557 and then Is_Record_Type (Etype (Expr))
558 and then Has_Discriminants (Etype (Expr))
563 -- Checks 7. Component must not be bit aligned component
565 if Possible_Bit_Aligned_Component (Expr) then
569 -- Recursion to following indexes for multiple dimension case
571 if Present (Next_Index (Index))
572 and then not Component_Check (Expr, Next_Index (Index))
577 -- All checks for that component finished, on to next
585 -- Start of processing for Backend_Processing_Possible
588 -- Checks 2 (array not bit packed) and 10 (no controlled actions)
590 if Is_Bit_Packed_Array (Typ) or else Needs_Finalization (Typ) then
594 -- If component is limited, aggregate must be expanded because each
595 -- component assignment must be built in place.
597 if Is_Inherently_Limited_Type (Component_Type (Typ)) then
601 -- Checks 4 (array must not be multi-dimensional Fortran case)
603 if Convention (Typ) = Convention_Fortran
604 and then Number_Dimensions (Typ) > 1
609 -- Checks 3 (size of array must be known at compile time)
611 if not Size_Known_At_Compile_Time (Typ) then
615 -- Checks on components
617 if not Component_Check (N, First_Index (Typ)) then
621 -- Checks 5 (if the component type is tagged, then we may need to do
622 -- tag adjustments. Perhaps this should be refined to check for any
623 -- component associations that actually need tag adjustment, similar
624 -- to the test in Component_Not_OK_For_Backend for record aggregates
625 -- with tagged components, but not clear whether it's worthwhile ???;
626 -- in the case of the JVM, object tags are handled implicitly)
628 if Is_Tagged_Type (Component_Type (Typ))
629 and then Tagged_Type_Expansion
634 -- Checks 6 (component type must not have bit aligned components)
636 if Type_May_Have_Bit_Aligned_Components (Component_Type (Typ)) then
640 -- Checks 11: Array aggregates with aliased components are currently
641 -- not well supported by the VM backend; disable temporarily this
642 -- backend processing until it is definitely supported.
644 if VM_Target /= No_VM
645 and then Has_Aliased_Components (Base_Type (Typ))
650 -- Backend processing is possible
652 Set_Size_Known_At_Compile_Time (Etype (N), True);
654 end Backend_Processing_Possible;
656 ---------------------------
657 -- Build_Array_Aggr_Code --
658 ---------------------------
660 -- The code that we generate from a one dimensional aggregate is
662 -- 1. If the sub-aggregate contains discrete choices we
664 -- (a) Sort the discrete choices
666 -- (b) Otherwise for each discrete choice that specifies a range we
667 -- emit a loop. If a range specifies a maximum of three values, or
668 -- we are dealing with an expression we emit a sequence of
669 -- assignments instead of a loop.
671 -- (c) Generate the remaining loops to cover the others choice if any
673 -- 2. If the aggregate contains positional elements we
675 -- (a) translate the positional elements in a series of assignments
677 -- (b) Generate a final loop to cover the others choice if any.
678 -- Note that this final loop has to be a while loop since the case
680 -- L : Integer := Integer'Last;
681 -- H : Integer := Integer'Last;
682 -- A : array (L .. H) := (1, others =>0);
684 -- cannot be handled by a for loop. Thus for the following
686 -- array (L .. H) := (.. positional elements.., others =>E);
688 -- we always generate something like:
690 -- J : Index_Type := Index_Of_Last_Positional_Element;
692 -- J := Index_Base'Succ (J)
696 function Build_Array_Aggr_Code
701 Scalar_Comp : Boolean;
702 Indices : List_Id := No_List;
703 Flist : Node_Id := Empty) return List_Id
705 Loc : constant Source_Ptr := Sloc (N);
706 Index_Base : constant Entity_Id := Base_Type (Etype (Index));
707 Index_Base_L : constant Node_Id := Type_Low_Bound (Index_Base);
708 Index_Base_H : constant Node_Id := Type_High_Bound (Index_Base);
710 function Add (Val : Int; To : Node_Id) return Node_Id;
711 -- Returns an expression where Val is added to expression To, unless
712 -- To+Val is provably out of To's base type range. To must be an
713 -- already analyzed expression.
715 function Empty_Range (L, H : Node_Id) return Boolean;
716 -- Returns True if the range defined by L .. H is certainly empty
718 function Equal (L, H : Node_Id) return Boolean;
719 -- Returns True if L = H for sure
721 function Index_Base_Name return Node_Id;
722 -- Returns a new reference to the index type name
724 function Gen_Assign (Ind : Node_Id; Expr : Node_Id) return List_Id;
725 -- Ind must be a side-effect free expression. If the input aggregate
726 -- N to Build_Loop contains no sub-aggregates, then this function
727 -- returns the assignment statement:
729 -- Into (Indices, Ind) := Expr;
731 -- Otherwise we call Build_Code recursively
733 -- Ada 2005 (AI-287): In case of default initialized component, Expr
734 -- is empty and we generate a call to the corresponding IP subprogram.
736 function Gen_Loop (L, H : Node_Id; Expr : Node_Id) return List_Id;
737 -- Nodes L and H must be side-effect free expressions.
738 -- If the input aggregate N to Build_Loop contains no sub-aggregates,
739 -- This routine returns the for loop statement
741 -- for J in Index_Base'(L) .. Index_Base'(H) loop
742 -- Into (Indices, J) := Expr;
745 -- Otherwise we call Build_Code recursively.
746 -- As an optimization if the loop covers 3 or less scalar elements we
747 -- generate a sequence of assignments.
749 function Gen_While (L, H : Node_Id; Expr : Node_Id) return List_Id;
750 -- Nodes L and H must be side-effect free expressions.
751 -- If the input aggregate N to Build_Loop contains no sub-aggregates,
752 -- This routine returns the while loop statement
754 -- J : Index_Base := L;
756 -- J := Index_Base'Succ (J);
757 -- Into (Indices, J) := Expr;
760 -- Otherwise we call Build_Code recursively
762 function Local_Compile_Time_Known_Value (E : Node_Id) return Boolean;
763 function Local_Expr_Value (E : Node_Id) return Uint;
764 -- These two Local routines are used to replace the corresponding ones
765 -- in sem_eval because while processing the bounds of an aggregate with
766 -- discrete choices whose index type is an enumeration, we build static
767 -- expressions not recognized by Compile_Time_Known_Value as such since
768 -- they have not yet been analyzed and resolved. All the expressions in
769 -- question are things like Index_Base_Name'Val (Const) which we can
770 -- easily recognize as being constant.
776 function Add (Val : Int; To : Node_Id) return Node_Id is
781 U_Val : constant Uint := UI_From_Int (Val);
784 -- Note: do not try to optimize the case of Val = 0, because
785 -- we need to build a new node with the proper Sloc value anyway.
787 -- First test if we can do constant folding
789 if Local_Compile_Time_Known_Value (To) then
790 U_To := Local_Expr_Value (To) + Val;
792 -- Determine if our constant is outside the range of the index.
793 -- If so return an Empty node. This empty node will be caught
794 -- by Empty_Range below.
796 if Compile_Time_Known_Value (Index_Base_L)
797 and then U_To < Expr_Value (Index_Base_L)
801 elsif Compile_Time_Known_Value (Index_Base_H)
802 and then U_To > Expr_Value (Index_Base_H)
807 Expr_Pos := Make_Integer_Literal (Loc, U_To);
808 Set_Is_Static_Expression (Expr_Pos);
810 if not Is_Enumeration_Type (Index_Base) then
813 -- If we are dealing with enumeration return
814 -- Index_Base'Val (Expr_Pos)
818 Make_Attribute_Reference
820 Prefix => Index_Base_Name,
821 Attribute_Name => Name_Val,
822 Expressions => New_List (Expr_Pos));
828 -- If we are here no constant folding possible
830 if not Is_Enumeration_Type (Index_Base) then
833 Left_Opnd => Duplicate_Subexpr (To),
834 Right_Opnd => Make_Integer_Literal (Loc, U_Val));
836 -- If we are dealing with enumeration return
837 -- Index_Base'Val (Index_Base'Pos (To) + Val)
841 Make_Attribute_Reference
843 Prefix => Index_Base_Name,
844 Attribute_Name => Name_Pos,
845 Expressions => New_List (Duplicate_Subexpr (To)));
850 Right_Opnd => Make_Integer_Literal (Loc, U_Val));
853 Make_Attribute_Reference
855 Prefix => Index_Base_Name,
856 Attribute_Name => Name_Val,
857 Expressions => New_List (Expr_Pos));
867 function Empty_Range (L, H : Node_Id) return Boolean is
868 Is_Empty : Boolean := False;
873 -- First check if L or H were already detected as overflowing the
874 -- index base range type by function Add above. If this is so Add
875 -- returns the empty node.
877 if No (L) or else No (H) then
884 -- L > H range is empty
890 -- B_L > H range must be empty
896 -- L > B_H range must be empty
900 High := Index_Base_H;
903 if Local_Compile_Time_Known_Value (Low)
904 and then Local_Compile_Time_Known_Value (High)
907 UI_Gt (Local_Expr_Value (Low), Local_Expr_Value (High));
920 function Equal (L, H : Node_Id) return Boolean is
925 elsif Local_Compile_Time_Known_Value (L)
926 and then Local_Compile_Time_Known_Value (H)
928 return UI_Eq (Local_Expr_Value (L), Local_Expr_Value (H));
938 function Gen_Assign (Ind : Node_Id; Expr : Node_Id) return List_Id is
939 L : constant List_Id := New_List;
943 New_Indices : List_Id;
944 Indexed_Comp : Node_Id;
946 Comp_Type : Entity_Id := Empty;
948 function Add_Loop_Actions (Lis : List_Id) return List_Id;
949 -- Collect insert_actions generated in the construction of a
950 -- loop, and prepend them to the sequence of assignments to
951 -- complete the eventual body of the loop.
953 ----------------------
954 -- Add_Loop_Actions --
955 ----------------------
957 function Add_Loop_Actions (Lis : List_Id) return List_Id is
961 -- Ada 2005 (AI-287): Do nothing else in case of default
962 -- initialized component.
967 elsif Nkind (Parent (Expr)) = N_Component_Association
968 and then Present (Loop_Actions (Parent (Expr)))
970 Append_List (Lis, Loop_Actions (Parent (Expr)));
971 Res := Loop_Actions (Parent (Expr));
972 Set_Loop_Actions (Parent (Expr), No_List);
978 end Add_Loop_Actions;
980 -- Start of processing for Gen_Assign
984 New_Indices := New_List;
986 New_Indices := New_Copy_List_Tree (Indices);
989 Append_To (New_Indices, Ind);
991 if Present (Flist) then
992 F := New_Copy_Tree (Flist);
994 elsif Present (Etype (N)) and then Needs_Finalization (Etype (N)) then
995 if Is_Entity_Name (Into)
996 and then Present (Scope (Entity (Into)))
998 F := Find_Final_List (Scope (Entity (Into)));
1000 F := Find_Final_List (Current_Scope);
1006 if Present (Next_Index (Index)) then
1009 Build_Array_Aggr_Code
1012 Index => Next_Index (Index),
1014 Scalar_Comp => Scalar_Comp,
1015 Indices => New_Indices,
1019 -- If we get here then we are at a bottom-level (sub-)aggregate
1023 (Make_Indexed_Component (Loc,
1024 Prefix => New_Copy_Tree (Into),
1025 Expressions => New_Indices));
1027 Set_Assignment_OK (Indexed_Comp);
1029 -- Ada 2005 (AI-287): In case of default initialized component, Expr
1030 -- is not present (and therefore we also initialize Expr_Q to empty).
1034 elsif Nkind (Expr) = N_Qualified_Expression then
1035 Expr_Q := Expression (Expr);
1040 if Present (Etype (N))
1041 and then Etype (N) /= Any_Composite
1043 Comp_Type := Component_Type (Etype (N));
1044 pragma Assert (Comp_Type = Ctype); -- AI-287
1046 elsif Present (Next (First (New_Indices))) then
1048 -- Ada 2005 (AI-287): Do nothing in case of default initialized
1049 -- component because we have received the component type in
1050 -- the formal parameter Ctype.
1052 -- ??? Some assert pragmas have been added to check if this new
1053 -- formal can be used to replace this code in all cases.
1055 if Present (Expr) then
1057 -- This is a multidimensional array. Recover the component
1058 -- type from the outermost aggregate, because subaggregates
1059 -- do not have an assigned type.
1066 while Present (P) loop
1067 if Nkind (P) = N_Aggregate
1068 and then Present (Etype (P))
1070 Comp_Type := Component_Type (Etype (P));
1078 pragma Assert (Comp_Type = Ctype); -- AI-287
1083 -- Ada 2005 (AI-287): We only analyze the expression in case of non-
1084 -- default initialized components (otherwise Expr_Q is not present).
1087 and then Nkind_In (Expr_Q, N_Aggregate, N_Extension_Aggregate)
1089 -- At this stage the Expression may not have been analyzed yet
1090 -- because the array aggregate code has not been updated to use
1091 -- the Expansion_Delayed flag and avoid analysis altogether to
1092 -- solve the same problem (see Resolve_Aggr_Expr). So let us do
1093 -- the analysis of non-array aggregates now in order to get the
1094 -- value of Expansion_Delayed flag for the inner aggregate ???
1096 if Present (Comp_Type) and then not Is_Array_Type (Comp_Type) then
1097 Analyze_And_Resolve (Expr_Q, Comp_Type);
1100 if Is_Delayed_Aggregate (Expr_Q) then
1102 -- This is either a subaggregate of a multidimentional array,
1103 -- or a component of an array type whose component type is
1104 -- also an array. In the latter case, the expression may have
1105 -- component associations that provide different bounds from
1106 -- those of the component type, and sliding must occur. Instead
1107 -- of decomposing the current aggregate assignment, force the
1108 -- re-analysis of the assignment, so that a temporary will be
1109 -- generated in the usual fashion, and sliding will take place.
1111 if Nkind (Parent (N)) = N_Assignment_Statement
1112 and then Is_Array_Type (Comp_Type)
1113 and then Present (Component_Associations (Expr_Q))
1114 and then Must_Slide (Comp_Type, Etype (Expr_Q))
1116 Set_Expansion_Delayed (Expr_Q, False);
1117 Set_Analyzed (Expr_Q, False);
1123 Expr_Q, Etype (Expr_Q), Indexed_Comp, F));
1128 -- Ada 2005 (AI-287): In case of default initialized component, call
1129 -- the initialization subprogram associated with the component type.
1130 -- If the component type is an access type, add an explicit null
1131 -- assignment, because for the back-end there is an initialization
1132 -- present for the whole aggregate, and no default initialization
1135 -- In addition, if the component type is controlled, we must call
1136 -- its Initialize procedure explicitly, because there is no explicit
1137 -- object creation that will invoke it otherwise.
1140 if Present (Base_Init_Proc (Base_Type (Ctype)))
1141 or else Has_Task (Base_Type (Ctype))
1144 Build_Initialization_Call (Loc,
1145 Id_Ref => Indexed_Comp,
1147 With_Default_Init => True));
1149 elsif Is_Access_Type (Ctype) then
1151 Make_Assignment_Statement (Loc,
1152 Name => Indexed_Comp,
1153 Expression => Make_Null (Loc)));
1156 if Needs_Finalization (Ctype) then
1159 Ref => New_Copy_Tree (Indexed_Comp),
1161 Flist_Ref => Find_Final_List (Current_Scope),
1162 With_Attach => Make_Integer_Literal (Loc, 1)));
1166 -- Now generate the assignment with no associated controlled
1167 -- actions since the target of the assignment may not have been
1168 -- initialized, it is not possible to Finalize it as expected by
1169 -- normal controlled assignment. The rest of the controlled
1170 -- actions are done manually with the proper finalization list
1171 -- coming from the context.
1174 Make_OK_Assignment_Statement (Loc,
1175 Name => Indexed_Comp,
1176 Expression => New_Copy_Tree (Expr));
1178 if Present (Comp_Type) and then Needs_Finalization (Comp_Type) then
1179 Set_No_Ctrl_Actions (A);
1181 -- If this is an aggregate for an array of arrays, each
1182 -- sub-aggregate will be expanded as well, and even with
1183 -- No_Ctrl_Actions the assignments of inner components will
1184 -- require attachment in their assignments to temporaries.
1185 -- These temporaries must be finalized for each subaggregate,
1186 -- to prevent multiple attachments of the same temporary
1187 -- location to same finalization chain (and consequently
1188 -- circular lists). To ensure that finalization takes place
1189 -- for each subaggregate we wrap the assignment in a block.
1191 if Is_Array_Type (Comp_Type)
1192 and then Nkind (Expr) = N_Aggregate
1195 Make_Block_Statement (Loc,
1196 Handled_Statement_Sequence =>
1197 Make_Handled_Sequence_Of_Statements (Loc,
1198 Statements => New_List (A)));
1204 -- Adjust the tag if tagged (because of possible view
1205 -- conversions), unless compiling for a VM where
1206 -- tags are implicit.
1208 if Present (Comp_Type)
1209 and then Is_Tagged_Type (Comp_Type)
1210 and then Tagged_Type_Expansion
1213 Make_OK_Assignment_Statement (Loc,
1215 Make_Selected_Component (Loc,
1216 Prefix => New_Copy_Tree (Indexed_Comp),
1219 (First_Tag_Component (Comp_Type), Loc)),
1222 Unchecked_Convert_To (RTE (RE_Tag),
1224 (Node (First_Elmt (Access_Disp_Table (Comp_Type))),
1230 -- Adjust and attach the component to the proper final list, which
1231 -- can be the controller of the outer record object or the final
1232 -- list associated with the scope.
1234 -- If the component is itself an array of controlled types, whose
1235 -- value is given by a sub-aggregate, then the attach calls have
1236 -- been generated when individual subcomponent are assigned, and
1237 -- must not be done again to prevent malformed finalization chains
1238 -- (see comments above, concerning the creation of a block to hold
1239 -- inner finalization actions).
1241 if Present (Comp_Type)
1242 and then Needs_Finalization (Comp_Type)
1243 and then not Is_Limited_Type (Comp_Type)
1245 (Is_Array_Type (Comp_Type)
1246 and then Is_Controlled (Component_Type (Comp_Type))
1247 and then Nkind (Expr) = N_Aggregate)
1251 Ref => New_Copy_Tree (Indexed_Comp),
1254 With_Attach => Make_Integer_Literal (Loc, 1)));
1258 return Add_Loop_Actions (L);
1265 function Gen_Loop (L, H : Node_Id; Expr : Node_Id) return List_Id is
1275 -- Index_Base'(L) .. Index_Base'(H)
1277 L_Iteration_Scheme : Node_Id;
1278 -- L_J in Index_Base'(L) .. Index_Base'(H)
1281 -- The statements to execute in the loop
1283 S : constant List_Id := New_List;
1284 -- List of statements
1287 -- Copy of expression tree, used for checking purposes
1290 -- If loop bounds define an empty range return the null statement
1292 if Empty_Range (L, H) then
1293 Append_To (S, Make_Null_Statement (Loc));
1295 -- Ada 2005 (AI-287): Nothing else need to be done in case of
1296 -- default initialized component.
1302 -- The expression must be type-checked even though no component
1303 -- of the aggregate will have this value. This is done only for
1304 -- actual components of the array, not for subaggregates. Do
1305 -- the check on a copy, because the expression may be shared
1306 -- among several choices, some of which might be non-null.
1308 if Present (Etype (N))
1309 and then Is_Array_Type (Etype (N))
1310 and then No (Next_Index (Index))
1312 Expander_Mode_Save_And_Set (False);
1313 Tcopy := New_Copy_Tree (Expr);
1314 Set_Parent (Tcopy, N);
1315 Analyze_And_Resolve (Tcopy, Component_Type (Etype (N)));
1316 Expander_Mode_Restore;
1322 -- If loop bounds are the same then generate an assignment
1324 elsif Equal (L, H) then
1325 return Gen_Assign (New_Copy_Tree (L), Expr);
1327 -- If H - L <= 2 then generate a sequence of assignments when we are
1328 -- processing the bottom most aggregate and it contains scalar
1331 elsif No (Next_Index (Index))
1332 and then Scalar_Comp
1333 and then Local_Compile_Time_Known_Value (L)
1334 and then Local_Compile_Time_Known_Value (H)
1335 and then Local_Expr_Value (H) - Local_Expr_Value (L) <= 2
1338 Append_List_To (S, Gen_Assign (New_Copy_Tree (L), Expr));
1339 Append_List_To (S, Gen_Assign (Add (1, To => L), Expr));
1341 if Local_Expr_Value (H) - Local_Expr_Value (L) = 2 then
1342 Append_List_To (S, Gen_Assign (Add (2, To => L), Expr));
1348 -- Otherwise construct the loop, starting with the loop index L_J
1350 L_J := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
1352 -- Construct "L .. H" in Index_Base. We use a qualified expression
1353 -- for the bound to convert to the index base, but we don't need
1354 -- to do that if we already have the base type at hand.
1356 if Etype (L) = Index_Base then
1360 Make_Qualified_Expression (Loc,
1361 Subtype_Mark => Index_Base_Name,
1365 if Etype (H) = Index_Base then
1369 Make_Qualified_Expression (Loc,
1370 Subtype_Mark => Index_Base_Name,
1379 -- Construct "for L_J in Index_Base range L .. H"
1381 L_Iteration_Scheme :=
1382 Make_Iteration_Scheme
1384 Loop_Parameter_Specification =>
1385 Make_Loop_Parameter_Specification
1387 Defining_Identifier => L_J,
1388 Discrete_Subtype_Definition => L_Range));
1390 -- Construct the statements to execute in the loop body
1392 L_Body := Gen_Assign (New_Reference_To (L_J, Loc), Expr);
1394 -- Construct the final loop
1396 Append_To (S, Make_Implicit_Loop_Statement
1398 Identifier => Empty,
1399 Iteration_Scheme => L_Iteration_Scheme,
1400 Statements => L_Body));
1402 -- A small optimization: if the aggregate is initialized with a box
1403 -- and the component type has no initialization procedure, remove the
1404 -- useless empty loop.
1406 if Nkind (First (S)) = N_Loop_Statement
1407 and then Is_Empty_List (Statements (First (S)))
1409 return New_List (Make_Null_Statement (Loc));
1419 -- The code built is
1421 -- W_J : Index_Base := L;
1422 -- while W_J < H loop
1423 -- W_J := Index_Base'Succ (W);
1427 function Gen_While (L, H : Node_Id; Expr : Node_Id) return List_Id is
1431 -- W_J : Base_Type := L;
1433 W_Iteration_Scheme : Node_Id;
1436 W_Index_Succ : Node_Id;
1437 -- Index_Base'Succ (J)
1439 W_Increment : Node_Id;
1440 -- W_J := Index_Base'Succ (W)
1442 W_Body : constant List_Id := New_List;
1443 -- The statements to execute in the loop
1445 S : constant List_Id := New_List;
1446 -- list of statement
1449 -- If loop bounds define an empty range or are equal return null
1451 if Empty_Range (L, H) or else Equal (L, H) then
1452 Append_To (S, Make_Null_Statement (Loc));
1456 -- Build the decl of W_J
1458 W_J := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
1460 Make_Object_Declaration
1462 Defining_Identifier => W_J,
1463 Object_Definition => Index_Base_Name,
1466 -- Theoretically we should do a New_Copy_Tree (L) here, but we know
1467 -- that in this particular case L is a fresh Expr generated by
1468 -- Add which we are the only ones to use.
1470 Append_To (S, W_Decl);
1472 -- Construct " while W_J < H"
1474 W_Iteration_Scheme :=
1475 Make_Iteration_Scheme
1477 Condition => Make_Op_Lt
1479 Left_Opnd => New_Reference_To (W_J, Loc),
1480 Right_Opnd => New_Copy_Tree (H)));
1482 -- Construct the statements to execute in the loop body
1485 Make_Attribute_Reference
1487 Prefix => Index_Base_Name,
1488 Attribute_Name => Name_Succ,
1489 Expressions => New_List (New_Reference_To (W_J, Loc)));
1492 Make_OK_Assignment_Statement
1494 Name => New_Reference_To (W_J, Loc),
1495 Expression => W_Index_Succ);
1497 Append_To (W_Body, W_Increment);
1498 Append_List_To (W_Body,
1499 Gen_Assign (New_Reference_To (W_J, Loc), Expr));
1501 -- Construct the final loop
1503 Append_To (S, Make_Implicit_Loop_Statement
1505 Identifier => Empty,
1506 Iteration_Scheme => W_Iteration_Scheme,
1507 Statements => W_Body));
1512 ---------------------
1513 -- Index_Base_Name --
1514 ---------------------
1516 function Index_Base_Name return Node_Id is
1518 return New_Reference_To (Index_Base, Sloc (N));
1519 end Index_Base_Name;
1521 ------------------------------------
1522 -- Local_Compile_Time_Known_Value --
1523 ------------------------------------
1525 function Local_Compile_Time_Known_Value (E : Node_Id) return Boolean is
1527 return Compile_Time_Known_Value (E)
1529 (Nkind (E) = N_Attribute_Reference
1530 and then Attribute_Name (E) = Name_Val
1531 and then Compile_Time_Known_Value (First (Expressions (E))));
1532 end Local_Compile_Time_Known_Value;
1534 ----------------------
1535 -- Local_Expr_Value --
1536 ----------------------
1538 function Local_Expr_Value (E : Node_Id) return Uint is
1540 if Compile_Time_Known_Value (E) then
1541 return Expr_Value (E);
1543 return Expr_Value (First (Expressions (E)));
1545 end Local_Expr_Value;
1547 -- Build_Array_Aggr_Code Variables
1554 Others_Expr : Node_Id := Empty;
1555 Others_Box_Present : Boolean := False;
1557 Aggr_L : constant Node_Id := Low_Bound (Aggregate_Bounds (N));
1558 Aggr_H : constant Node_Id := High_Bound (Aggregate_Bounds (N));
1559 -- The aggregate bounds of this specific sub-aggregate. Note that if
1560 -- the code generated by Build_Array_Aggr_Code is executed then these
1561 -- bounds are OK. Otherwise a Constraint_Error would have been raised.
1563 Aggr_Low : constant Node_Id := Duplicate_Subexpr_No_Checks (Aggr_L);
1564 Aggr_High : constant Node_Id := Duplicate_Subexpr_No_Checks (Aggr_H);
1565 -- After Duplicate_Subexpr these are side-effect free
1570 Nb_Choices : Nat := 0;
1571 Table : Case_Table_Type (1 .. Number_Of_Choices (N));
1572 -- Used to sort all the different choice values
1575 -- Number of elements in the positional aggregate
1577 New_Code : constant List_Id := New_List;
1579 -- Start of processing for Build_Array_Aggr_Code
1582 -- First before we start, a special case. if we have a bit packed
1583 -- array represented as a modular type, then clear the value to
1584 -- zero first, to ensure that unused bits are properly cleared.
1589 and then Is_Bit_Packed_Array (Typ)
1590 and then Is_Modular_Integer_Type (Packed_Array_Type (Typ))
1592 Append_To (New_Code,
1593 Make_Assignment_Statement (Loc,
1594 Name => New_Copy_Tree (Into),
1596 Unchecked_Convert_To (Typ,
1597 Make_Integer_Literal (Loc, Uint_0))));
1600 -- If the component type contains tasks, we need to build a Master
1601 -- entity in the current scope, because it will be needed if build-
1602 -- in-place functions are called in the expanded code.
1604 if Nkind (Parent (N)) = N_Object_Declaration
1605 and then Has_Task (Typ)
1607 Build_Master_Entity (Defining_Identifier (Parent (N)));
1610 -- STEP 1: Process component associations
1612 -- For those associations that may generate a loop, initialize
1613 -- Loop_Actions to collect inserted actions that may be crated.
1615 -- Skip this if no component associations
1617 if No (Expressions (N)) then
1619 -- STEP 1 (a): Sort the discrete choices
1621 Assoc := First (Component_Associations (N));
1622 while Present (Assoc) loop
1623 Choice := First (Choices (Assoc));
1624 while Present (Choice) loop
1625 if Nkind (Choice) = N_Others_Choice then
1626 Set_Loop_Actions (Assoc, New_List);
1628 if Box_Present (Assoc) then
1629 Others_Box_Present := True;
1631 Others_Expr := Expression (Assoc);
1636 Get_Index_Bounds (Choice, Low, High);
1639 Set_Loop_Actions (Assoc, New_List);
1642 Nb_Choices := Nb_Choices + 1;
1643 if Box_Present (Assoc) then
1644 Table (Nb_Choices) := (Choice_Lo => Low,
1646 Choice_Node => Empty);
1648 Table (Nb_Choices) := (Choice_Lo => Low,
1650 Choice_Node => Expression (Assoc));
1658 -- If there is more than one set of choices these must be static
1659 -- and we can therefore sort them. Remember that Nb_Choices does not
1660 -- account for an others choice.
1662 if Nb_Choices > 1 then
1663 Sort_Case_Table (Table);
1666 -- STEP 1 (b): take care of the whole set of discrete choices
1668 for J in 1 .. Nb_Choices loop
1669 Low := Table (J).Choice_Lo;
1670 High := Table (J).Choice_Hi;
1671 Expr := Table (J).Choice_Node;
1672 Append_List (Gen_Loop (Low, High, Expr), To => New_Code);
1675 -- STEP 1 (c): generate the remaining loops to cover others choice
1676 -- We don't need to generate loops over empty gaps, but if there is
1677 -- a single empty range we must analyze the expression for semantics
1679 if Present (Others_Expr) or else Others_Box_Present then
1681 First : Boolean := True;
1684 for J in 0 .. Nb_Choices loop
1688 Low := Add (1, To => Table (J).Choice_Hi);
1691 if J = Nb_Choices then
1694 High := Add (-1, To => Table (J + 1).Choice_Lo);
1697 -- If this is an expansion within an init proc, make
1698 -- sure that discriminant references are replaced by
1699 -- the corresponding discriminal.
1701 if Inside_Init_Proc then
1702 if Is_Entity_Name (Low)
1703 and then Ekind (Entity (Low)) = E_Discriminant
1705 Set_Entity (Low, Discriminal (Entity (Low)));
1708 if Is_Entity_Name (High)
1709 and then Ekind (Entity (High)) = E_Discriminant
1711 Set_Entity (High, Discriminal (Entity (High)));
1716 or else not Empty_Range (Low, High)
1720 (Gen_Loop (Low, High, Others_Expr), To => New_Code);
1726 -- STEP 2: Process positional components
1729 -- STEP 2 (a): Generate the assignments for each positional element
1730 -- Note that here we have to use Aggr_L rather than Aggr_Low because
1731 -- Aggr_L is analyzed and Add wants an analyzed expression.
1733 Expr := First (Expressions (N));
1735 while Present (Expr) loop
1736 Nb_Elements := Nb_Elements + 1;
1737 Append_List (Gen_Assign (Add (Nb_Elements, To => Aggr_L), Expr),
1742 -- STEP 2 (b): Generate final loop if an others choice is present
1743 -- Here Nb_Elements gives the offset of the last positional element.
1745 if Present (Component_Associations (N)) then
1746 Assoc := Last (Component_Associations (N));
1748 -- Ada 2005 (AI-287)
1750 if Box_Present (Assoc) then
1751 Append_List (Gen_While (Add (Nb_Elements, To => Aggr_L),
1756 Expr := Expression (Assoc);
1758 Append_List (Gen_While (Add (Nb_Elements, To => Aggr_L),
1767 end Build_Array_Aggr_Code;
1769 ----------------------------
1770 -- Build_Record_Aggr_Code --
1771 ----------------------------
1773 function Build_Record_Aggr_Code
1777 Flist : Node_Id := Empty;
1778 Obj : Entity_Id := Empty;
1779 Is_Limited_Ancestor_Expansion : Boolean := False) return List_Id
1781 Loc : constant Source_Ptr := Sloc (N);
1782 L : constant List_Id := New_List;
1783 N_Typ : constant Entity_Id := Etype (N);
1790 Comp_Type : Entity_Id;
1791 Selector : Entity_Id;
1792 Comp_Expr : Node_Id;
1795 Internal_Final_List : Node_Id := Empty;
1797 -- If this is an internal aggregate, the External_Final_List is an
1798 -- expression for the controller record of the enclosing type.
1800 -- If the current aggregate has several controlled components, this
1801 -- expression will appear in several calls to attach to the finali-
1802 -- zation list, and it must not be shared.
1804 External_Final_List : Node_Id;
1805 Ancestor_Is_Expression : Boolean := False;
1806 Ancestor_Is_Subtype_Mark : Boolean := False;
1808 Init_Typ : Entity_Id := Empty;
1811 Ctrl_Stuff_Done : Boolean := False;
1812 -- True if Gen_Ctrl_Actions_For_Aggr has already been called; calls
1813 -- after the first do nothing.
1815 function Ancestor_Discriminant_Value (Disc : Entity_Id) return Node_Id;
1816 -- Returns the value that the given discriminant of an ancestor type
1817 -- should receive (in the absence of a conflict with the value provided
1818 -- by an ancestor part of an extension aggregate).
1820 procedure Check_Ancestor_Discriminants (Anc_Typ : Entity_Id);
1821 -- Check that each of the discriminant values defined by the ancestor
1822 -- part of an extension aggregate match the corresponding values
1823 -- provided by either an association of the aggregate or by the
1824 -- constraint imposed by a parent type (RM95-4.3.2(8)).
1826 function Compatible_Int_Bounds
1827 (Agg_Bounds : Node_Id;
1828 Typ_Bounds : Node_Id) return Boolean;
1829 -- Return true if Agg_Bounds are equal or within Typ_Bounds. It is
1830 -- assumed that both bounds are integer ranges.
1832 procedure Gen_Ctrl_Actions_For_Aggr;
1833 -- Deal with the various controlled type data structure initializations
1834 -- (but only if it hasn't been done already).
1836 function Get_Constraint_Association (T : Entity_Id) return Node_Id;
1837 -- Returns the first discriminant association in the constraint
1838 -- associated with T, if any, otherwise returns Empty.
1840 function Init_Controller
1845 Init_Pr : Boolean) return List_Id;
1846 -- Returns the list of statements necessary to initialize the internal
1847 -- controller of the (possible) ancestor typ into target and attach it
1848 -- to finalization list F. Init_Pr conditions the call to the init proc
1849 -- since it may already be done due to ancestor initialization.
1851 function Is_Int_Range_Bounds (Bounds : Node_Id) return Boolean;
1852 -- Check whether Bounds is a range node and its lower and higher bounds
1853 -- are integers literals.
1855 ---------------------------------
1856 -- Ancestor_Discriminant_Value --
1857 ---------------------------------
1859 function Ancestor_Discriminant_Value (Disc : Entity_Id) return Node_Id is
1861 Assoc_Elmt : Elmt_Id;
1862 Aggr_Comp : Entity_Id;
1863 Corresp_Disc : Entity_Id;
1864 Current_Typ : Entity_Id := Base_Type (Typ);
1865 Parent_Typ : Entity_Id;
1866 Parent_Disc : Entity_Id;
1867 Save_Assoc : Node_Id := Empty;
1870 -- First check any discriminant associations to see if any of them
1871 -- provide a value for the discriminant.
1873 if Present (Discriminant_Specifications (Parent (Current_Typ))) then
1874 Assoc := First (Component_Associations (N));
1875 while Present (Assoc) loop
1876 Aggr_Comp := Entity (First (Choices (Assoc)));
1878 if Ekind (Aggr_Comp) = E_Discriminant then
1879 Save_Assoc := Expression (Assoc);
1881 Corresp_Disc := Corresponding_Discriminant (Aggr_Comp);
1882 while Present (Corresp_Disc) loop
1884 -- If found a corresponding discriminant then return the
1885 -- value given in the aggregate. (Note: this is not
1886 -- correct in the presence of side effects. ???)
1888 if Disc = Corresp_Disc then
1889 return Duplicate_Subexpr (Expression (Assoc));
1893 Corresponding_Discriminant (Corresp_Disc);
1901 -- No match found in aggregate, so chain up parent types to find
1902 -- a constraint that defines the value of the discriminant.
1904 Parent_Typ := Etype (Current_Typ);
1905 while Current_Typ /= Parent_Typ loop
1906 if Has_Discriminants (Parent_Typ)
1907 and then not Has_Unknown_Discriminants (Parent_Typ)
1909 Parent_Disc := First_Discriminant (Parent_Typ);
1911 -- We either get the association from the subtype indication
1912 -- of the type definition itself, or from the discriminant
1913 -- constraint associated with the type entity (which is
1914 -- preferable, but it's not always present ???)
1916 if Is_Empty_Elmt_List (
1917 Discriminant_Constraint (Current_Typ))
1919 Assoc := Get_Constraint_Association (Current_Typ);
1920 Assoc_Elmt := No_Elmt;
1923 First_Elmt (Discriminant_Constraint (Current_Typ));
1924 Assoc := Node (Assoc_Elmt);
1927 -- Traverse the discriminants of the parent type looking
1928 -- for one that corresponds.
1930 while Present (Parent_Disc) and then Present (Assoc) loop
1931 Corresp_Disc := Parent_Disc;
1932 while Present (Corresp_Disc)
1933 and then Disc /= Corresp_Disc
1936 Corresponding_Discriminant (Corresp_Disc);
1939 if Disc = Corresp_Disc then
1940 if Nkind (Assoc) = N_Discriminant_Association then
1941 Assoc := Expression (Assoc);
1944 -- If the located association directly denotes a
1945 -- discriminant, then use the value of a saved
1946 -- association of the aggregate. This is a kludge to
1947 -- handle certain cases involving multiple discriminants
1948 -- mapped to a single discriminant of a descendant. It's
1949 -- not clear how to locate the appropriate discriminant
1950 -- value for such cases. ???
1952 if Is_Entity_Name (Assoc)
1953 and then Ekind (Entity (Assoc)) = E_Discriminant
1955 Assoc := Save_Assoc;
1958 return Duplicate_Subexpr (Assoc);
1961 Next_Discriminant (Parent_Disc);
1963 if No (Assoc_Elmt) then
1966 Next_Elmt (Assoc_Elmt);
1967 if Present (Assoc_Elmt) then
1968 Assoc := Node (Assoc_Elmt);
1976 Current_Typ := Parent_Typ;
1977 Parent_Typ := Etype (Current_Typ);
1980 -- In some cases there's no ancestor value to locate (such as
1981 -- when an ancestor part given by an expression defines the
1982 -- discriminant value).
1985 end Ancestor_Discriminant_Value;
1987 ----------------------------------
1988 -- Check_Ancestor_Discriminants --
1989 ----------------------------------
1991 procedure Check_Ancestor_Discriminants (Anc_Typ : Entity_Id) is
1993 Disc_Value : Node_Id;
1997 Discr := First_Discriminant (Base_Type (Anc_Typ));
1998 while Present (Discr) loop
1999 Disc_Value := Ancestor_Discriminant_Value (Discr);
2001 if Present (Disc_Value) then
2002 Cond := Make_Op_Ne (Loc,
2004 Make_Selected_Component (Loc,
2005 Prefix => New_Copy_Tree (Target),
2006 Selector_Name => New_Occurrence_Of (Discr, Loc)),
2007 Right_Opnd => Disc_Value);
2010 Make_Raise_Constraint_Error (Loc,
2012 Reason => CE_Discriminant_Check_Failed));
2015 Next_Discriminant (Discr);
2017 end Check_Ancestor_Discriminants;
2019 ---------------------------
2020 -- Compatible_Int_Bounds --
2021 ---------------------------
2023 function Compatible_Int_Bounds
2024 (Agg_Bounds : Node_Id;
2025 Typ_Bounds : Node_Id) return Boolean
2027 Agg_Lo : constant Uint := Intval (Low_Bound (Agg_Bounds));
2028 Agg_Hi : constant Uint := Intval (High_Bound (Agg_Bounds));
2029 Typ_Lo : constant Uint := Intval (Low_Bound (Typ_Bounds));
2030 Typ_Hi : constant Uint := Intval (High_Bound (Typ_Bounds));
2032 return Typ_Lo <= Agg_Lo and then Agg_Hi <= Typ_Hi;
2033 end Compatible_Int_Bounds;
2035 --------------------------------
2036 -- Get_Constraint_Association --
2037 --------------------------------
2039 function Get_Constraint_Association (T : Entity_Id) return Node_Id is
2040 Typ_Def : constant Node_Id := Type_Definition (Parent (T));
2041 Indic : constant Node_Id := Subtype_Indication (Typ_Def);
2044 -- ??? Also need to cover case of a type mark denoting a subtype
2047 if Nkind (Indic) = N_Subtype_Indication
2048 and then Present (Constraint (Indic))
2050 return First (Constraints (Constraint (Indic)));
2054 end Get_Constraint_Association;
2056 ---------------------
2057 -- Init_Controller --
2058 ---------------------
2060 function Init_Controller
2065 Init_Pr : Boolean) return List_Id
2067 L : constant List_Id := New_List;
2070 Target_Type : Entity_Id;
2074 -- init-proc (target._controller);
2075 -- initialize (target._controller);
2076 -- Attach_to_Final_List (target._controller, F);
2079 Make_Selected_Component (Loc,
2080 Prefix => Convert_To (Typ, New_Copy_Tree (Target)),
2081 Selector_Name => Make_Identifier (Loc, Name_uController));
2082 Set_Assignment_OK (Ref);
2084 -- Ada 2005 (AI-287): Give support to aggregates of limited types.
2085 -- If the type is intrinsically limited the controller is limited as
2086 -- well. If it is tagged and limited then so is the controller.
2087 -- Otherwise an untagged type may have limited components without its
2088 -- full view being limited, so the controller is not limited.
2090 if Nkind (Target) = N_Identifier then
2091 Target_Type := Etype (Target);
2093 elsif Nkind (Target) = N_Selected_Component then
2094 Target_Type := Etype (Selector_Name (Target));
2096 elsif Nkind (Target) = N_Unchecked_Type_Conversion then
2097 Target_Type := Etype (Target);
2099 elsif Nkind (Target) = N_Unchecked_Expression
2100 and then Nkind (Expression (Target)) = N_Indexed_Component
2102 Target_Type := Etype (Prefix (Expression (Target)));
2105 Target_Type := Etype (Target);
2108 -- If the target has not been analyzed yet, as will happen with
2109 -- delayed expansion, use the given type (either the aggregate type
2110 -- or an ancestor) to determine limitedness.
2112 if No (Target_Type) then
2116 if (Is_Tagged_Type (Target_Type))
2117 and then Is_Limited_Type (Target_Type)
2119 RC := RE_Limited_Record_Controller;
2121 elsif Is_Inherently_Limited_Type (Target_Type) then
2122 RC := RE_Limited_Record_Controller;
2125 RC := RE_Record_Controller;
2130 Build_Initialization_Call (Loc,
2133 In_Init_Proc => Within_Init_Proc));
2137 Make_Procedure_Call_Statement (Loc,
2140 Find_Prim_Op (RTE (RC), Name_Initialize), Loc),
2141 Parameter_Associations =>
2142 New_List (New_Copy_Tree (Ref))));
2146 Obj_Ref => New_Copy_Tree (Ref),
2148 With_Attach => Attach));
2151 end Init_Controller;
2153 -------------------------
2154 -- Is_Int_Range_Bounds --
2155 -------------------------
2157 function Is_Int_Range_Bounds (Bounds : Node_Id) return Boolean is
2159 return Nkind (Bounds) = N_Range
2160 and then Nkind (Low_Bound (Bounds)) = N_Integer_Literal
2161 and then Nkind (High_Bound (Bounds)) = N_Integer_Literal;
2162 end Is_Int_Range_Bounds;
2164 -------------------------------
2165 -- Gen_Ctrl_Actions_For_Aggr --
2166 -------------------------------
2168 procedure Gen_Ctrl_Actions_For_Aggr is
2169 Alloc : Node_Id := Empty;
2172 -- Do the work only the first time this is called
2174 if Ctrl_Stuff_Done then
2178 Ctrl_Stuff_Done := True;
2181 and then Finalize_Storage_Only (Typ)
2183 (Is_Library_Level_Entity (Obj)
2184 or else Entity (Constant_Value (RTE (RE_Garbage_Collected))) =
2187 -- why not Is_True (Expr_Value (RTE (RE_Garbaage_Collected) ???
2189 Attach := Make_Integer_Literal (Loc, 0);
2191 elsif Nkind (Parent (N)) = N_Qualified_Expression
2192 and then Nkind (Parent (Parent (N))) = N_Allocator
2194 Alloc := Parent (Parent (N));
2195 Attach := Make_Integer_Literal (Loc, 2);
2198 Attach := Make_Integer_Literal (Loc, 1);
2201 -- Determine the external finalization list. It is either the
2202 -- finalization list of the outer-scope or the one coming from
2203 -- an outer aggregate. When the target is not a temporary, the
2204 -- proper scope is the scope of the target rather than the
2205 -- potentially transient current scope.
2207 if Needs_Finalization (Typ) then
2209 -- The current aggregate belongs to an allocator which creates
2210 -- an object through an anonymous access type or acts as the root
2211 -- of a coextension chain.
2215 (Is_Coextension_Root (Alloc)
2216 or else Ekind (Etype (Alloc)) = E_Anonymous_Access_Type)
2218 if No (Associated_Final_Chain (Etype (Alloc))) then
2219 Build_Final_List (Alloc, Etype (Alloc));
2222 External_Final_List :=
2223 Make_Selected_Component (Loc,
2226 Associated_Final_Chain (Etype (Alloc)), Loc),
2228 Make_Identifier (Loc, Name_F));
2230 elsif Present (Flist) then
2231 External_Final_List := New_Copy_Tree (Flist);
2233 elsif Is_Entity_Name (Target)
2234 and then Present (Scope (Entity (Target)))
2236 External_Final_List :=
2237 Find_Final_List (Scope (Entity (Target)));
2240 External_Final_List := Find_Final_List (Current_Scope);
2243 External_Final_List := Empty;
2246 -- Initialize and attach the outer object in the is_controlled case
2248 if Is_Controlled (Typ) then
2249 if Ancestor_Is_Subtype_Mark then
2250 Ref := Convert_To (Init_Typ, New_Copy_Tree (Target));
2251 Set_Assignment_OK (Ref);
2253 Make_Procedure_Call_Statement (Loc,
2256 (Find_Prim_Op (Init_Typ, Name_Initialize), Loc),
2257 Parameter_Associations => New_List (New_Copy_Tree (Ref))));
2260 if not Has_Controlled_Component (Typ) then
2261 Ref := New_Copy_Tree (Target);
2262 Set_Assignment_OK (Ref);
2264 -- This is an aggregate of a coextension. Do not produce a
2265 -- finalization call, but rather attach the reference of the
2266 -- aggregate to its coextension chain.
2269 and then Is_Dynamic_Coextension (Alloc)
2271 if No (Coextensions (Alloc)) then
2272 Set_Coextensions (Alloc, New_Elmt_List);
2275 Append_Elmt (Ref, Coextensions (Alloc));
2280 Flist_Ref => New_Copy_Tree (External_Final_List),
2281 With_Attach => Attach));
2286 -- In the Has_Controlled component case, all the intermediate
2287 -- controllers must be initialized.
2289 if Has_Controlled_Component (Typ)
2290 and not Is_Limited_Ancestor_Expansion
2293 Inner_Typ : Entity_Id;
2294 Outer_Typ : Entity_Id;
2298 -- Find outer type with a controller
2300 Outer_Typ := Base_Type (Typ);
2301 while Outer_Typ /= Init_Typ
2302 and then not Has_New_Controlled_Component (Outer_Typ)
2304 Outer_Typ := Etype (Outer_Typ);
2307 -- Attach it to the outer record controller to the external
2310 if Outer_Typ = Init_Typ then
2315 F => External_Final_List,
2320 Inner_Typ := Init_Typ;
2327 F => External_Final_List,
2331 Inner_Typ := Etype (Outer_Typ);
2333 not Is_Tagged_Type (Typ) or else Inner_Typ = Outer_Typ;
2336 -- The outer object has to be attached as well
2338 if Is_Controlled (Typ) then
2339 Ref := New_Copy_Tree (Target);
2340 Set_Assignment_OK (Ref);
2344 Flist_Ref => New_Copy_Tree (External_Final_List),
2345 With_Attach => New_Copy_Tree (Attach)));
2348 -- Initialize the internal controllers for tagged types with
2349 -- more than one controller.
2351 while not At_Root and then Inner_Typ /= Init_Typ loop
2352 if Has_New_Controlled_Component (Inner_Typ) then
2354 Make_Selected_Component (Loc,
2356 Convert_To (Outer_Typ, New_Copy_Tree (Target)),
2358 Make_Identifier (Loc, Name_uController));
2360 Make_Selected_Component (Loc,
2362 Selector_Name => Make_Identifier (Loc, Name_F));
2369 Attach => Make_Integer_Literal (Loc, 1),
2371 Outer_Typ := Inner_Typ;
2376 At_Root := Inner_Typ = Etype (Inner_Typ);
2377 Inner_Typ := Etype (Inner_Typ);
2380 -- If not done yet attach the controller of the ancestor part
2382 if Outer_Typ /= Init_Typ
2383 and then Inner_Typ = Init_Typ
2384 and then Has_Controlled_Component (Init_Typ)
2387 Make_Selected_Component (Loc,
2388 Prefix => Convert_To (Outer_Typ, New_Copy_Tree (Target)),
2390 Make_Identifier (Loc, Name_uController));
2392 Make_Selected_Component (Loc,
2394 Selector_Name => Make_Identifier (Loc, Name_F));
2396 Attach := Make_Integer_Literal (Loc, 1);
2405 -- Note: Init_Pr is False because the ancestor part has
2406 -- already been initialized either way (by default, if
2407 -- given by a type name, otherwise from the expression).
2412 end Gen_Ctrl_Actions_For_Aggr;
2414 function Rewrite_Discriminant (Expr : Node_Id) return Traverse_Result;
2415 -- If default expression of a component mentions a discriminant of the
2416 -- type, it must be rewritten as the discriminant of the target object.
2418 function Replace_Type (Expr : Node_Id) return Traverse_Result;
2419 -- If the aggregate contains a self-reference, traverse each expression
2420 -- to replace a possible self-reference with a reference to the proper
2421 -- component of the target of the assignment.
2423 --------------------------
2424 -- Rewrite_Discriminant --
2425 --------------------------
2427 function Rewrite_Discriminant (Expr : Node_Id) return Traverse_Result is
2429 if Nkind (Expr) = N_Identifier
2430 and then Present (Entity (Expr))
2431 and then Ekind (Entity (Expr)) = E_In_Parameter
2432 and then Present (Discriminal_Link (Entity (Expr)))
2435 Make_Selected_Component (Loc,
2436 Prefix => New_Occurrence_Of (Obj, Loc),
2437 Selector_Name => Make_Identifier (Loc, Chars (Expr))));
2440 end Rewrite_Discriminant;
2446 function Replace_Type (Expr : Node_Id) return Traverse_Result is
2448 -- Note regarding the Root_Type test below: Aggregate components for
2449 -- self-referential types include attribute references to the current
2450 -- instance, of the form: Typ'access, etc.. These references are
2451 -- rewritten as references to the target of the aggregate: the
2452 -- left-hand side of an assignment, the entity in a declaration,
2453 -- or a temporary. Without this test, we would improperly extended
2454 -- this rewriting to attribute references whose prefix was not the
2455 -- type of the aggregate.
2457 if Nkind (Expr) = N_Attribute_Reference
2458 and then Is_Entity_Name (Prefix (Expr))
2459 and then Is_Type (Entity (Prefix (Expr)))
2460 and then Root_Type (Etype (N)) = Root_Type (Entity (Prefix (Expr)))
2462 if Is_Entity_Name (Lhs) then
2463 Rewrite (Prefix (Expr),
2464 New_Occurrence_Of (Entity (Lhs), Loc));
2466 elsif Nkind (Lhs) = N_Selected_Component then
2468 Make_Attribute_Reference (Loc,
2469 Attribute_Name => Name_Unrestricted_Access,
2470 Prefix => New_Copy_Tree (Prefix (Lhs))));
2471 Set_Analyzed (Parent (Expr), False);
2475 Make_Attribute_Reference (Loc,
2476 Attribute_Name => Name_Unrestricted_Access,
2477 Prefix => New_Copy_Tree (Lhs)));
2478 Set_Analyzed (Parent (Expr), False);
2485 procedure Replace_Self_Reference is
2486 new Traverse_Proc (Replace_Type);
2488 procedure Replace_Discriminants is
2489 new Traverse_Proc (Rewrite_Discriminant);
2491 -- Start of processing for Build_Record_Aggr_Code
2494 if Has_Self_Reference (N) then
2495 Replace_Self_Reference (N);
2498 -- If the target of the aggregate is class-wide, we must convert it
2499 -- to the actual type of the aggregate, so that the proper components
2500 -- are visible. We know already that the types are compatible.
2502 if Present (Etype (Lhs))
2503 and then Is_Class_Wide_Type (Etype (Lhs))
2505 Target := Unchecked_Convert_To (Typ, Lhs);
2510 -- Deal with the ancestor part of extension aggregates or with the
2511 -- discriminants of the root type.
2513 if Nkind (N) = N_Extension_Aggregate then
2515 A : constant Node_Id := Ancestor_Part (N);
2519 -- If the ancestor part is a subtype mark "T", we generate
2521 -- init-proc (T(tmp)); if T is constrained and
2522 -- init-proc (S(tmp)); where S applies an appropriate
2523 -- constraint if T is unconstrained
2525 if Is_Entity_Name (A) and then Is_Type (Entity (A)) then
2526 Ancestor_Is_Subtype_Mark := True;
2528 if Is_Constrained (Entity (A)) then
2529 Init_Typ := Entity (A);
2531 -- For an ancestor part given by an unconstrained type mark,
2532 -- create a subtype constrained by appropriate corresponding
2533 -- discriminant values coming from either associations of the
2534 -- aggregate or a constraint on a parent type. The subtype will
2535 -- be used to generate the correct default value for the
2538 elsif Has_Discriminants (Entity (A)) then
2540 Anc_Typ : constant Entity_Id := Entity (A);
2541 Anc_Constr : constant List_Id := New_List;
2542 Discrim : Entity_Id;
2543 Disc_Value : Node_Id;
2544 New_Indic : Node_Id;
2545 Subt_Decl : Node_Id;
2548 Discrim := First_Discriminant (Anc_Typ);
2549 while Present (Discrim) loop
2550 Disc_Value := Ancestor_Discriminant_Value (Discrim);
2551 Append_To (Anc_Constr, Disc_Value);
2552 Next_Discriminant (Discrim);
2556 Make_Subtype_Indication (Loc,
2557 Subtype_Mark => New_Occurrence_Of (Anc_Typ, Loc),
2559 Make_Index_Or_Discriminant_Constraint (Loc,
2560 Constraints => Anc_Constr));
2562 Init_Typ := Create_Itype (Ekind (Anc_Typ), N);
2565 Make_Subtype_Declaration (Loc,
2566 Defining_Identifier => Init_Typ,
2567 Subtype_Indication => New_Indic);
2569 -- Itypes must be analyzed with checks off Declaration
2570 -- must have a parent for proper handling of subsidiary
2573 Set_Parent (Subt_Decl, N);
2574 Analyze (Subt_Decl, Suppress => All_Checks);
2578 Ref := Convert_To (Init_Typ, New_Copy_Tree (Target));
2579 Set_Assignment_OK (Ref);
2582 Build_Initialization_Call (Loc,
2585 In_Init_Proc => Within_Init_Proc,
2586 With_Default_Init => Has_Default_Init_Comps (N)
2588 Has_Task (Base_Type (Init_Typ))));
2590 if Is_Constrained (Entity (A))
2591 and then Has_Discriminants (Entity (A))
2593 Check_Ancestor_Discriminants (Entity (A));
2596 -- Handle calls to C++ constructors
2598 elsif Is_CPP_Constructor_Call (A) then
2599 Init_Typ := Etype (A);
2600 Ref := Convert_To (Init_Typ, New_Copy_Tree (Target));
2601 Set_Assignment_OK (Ref);
2604 Build_Initialization_Call (Loc,
2607 In_Init_Proc => Within_Init_Proc,
2608 With_Default_Init => Has_Default_Init_Comps (N),
2609 Constructor_Ref => A));
2611 -- Ada 2005 (AI-287): If the ancestor part is an aggregate of
2612 -- limited type, a recursive call expands the ancestor. Note that
2613 -- in the limited case, the ancestor part must be either a
2614 -- function call (possibly qualified, or wrapped in an unchecked
2615 -- conversion) or aggregate (definitely qualified).
2616 -- The ancestor part can also be a function call (that may be
2617 -- transformed into an explicit dereference) or a qualification
2620 elsif Is_Limited_Type (Etype (A))
2621 and then Nkind_In (Unqualify (A), N_Aggregate,
2622 N_Extension_Aggregate)
2624 Ancestor_Is_Expression := True;
2626 -- Set up finalization data for enclosing record, because
2627 -- controlled subcomponents of the ancestor part will be
2630 Gen_Ctrl_Actions_For_Aggr;
2633 Build_Record_Aggr_Code (
2635 Typ => Etype (Unqualify (A)),
2639 Is_Limited_Ancestor_Expansion => True));
2641 -- If the ancestor part is an expression "E", we generate
2645 -- In Ada 2005, this includes the case of a (possibly qualified)
2646 -- limited function call. The assignment will turn into a
2647 -- build-in-place function call (for further details, see
2648 -- Make_Build_In_Place_Call_In_Assignment).
2651 Ancestor_Is_Expression := True;
2652 Init_Typ := Etype (A);
2654 -- If the ancestor part is an aggregate, force its full
2655 -- expansion, which was delayed.
2657 if Nkind_In (Unqualify (A), N_Aggregate,
2658 N_Extension_Aggregate)
2660 Set_Analyzed (A, False);
2661 Set_Analyzed (Expression (A), False);
2664 Ref := Convert_To (Init_Typ, New_Copy_Tree (Target));
2665 Set_Assignment_OK (Ref);
2667 -- Make the assignment without usual controlled actions since
2668 -- we only want the post adjust but not the pre finalize here
2669 -- Add manual adjust when necessary.
2671 Assign := New_List (
2672 Make_OK_Assignment_Statement (Loc,
2675 Set_No_Ctrl_Actions (First (Assign));
2677 -- Assign the tag now to make sure that the dispatching call in
2678 -- the subsequent deep_adjust works properly (unless VM_Target,
2679 -- where tags are implicit).
2681 if Tagged_Type_Expansion then
2683 Make_OK_Assignment_Statement (Loc,
2685 Make_Selected_Component (Loc,
2686 Prefix => New_Copy_Tree (Target),
2689 (First_Tag_Component (Base_Type (Typ)), Loc)),
2692 Unchecked_Convert_To (RTE (RE_Tag),
2695 (Access_Disp_Table (Base_Type (Typ)))),
2698 Set_Assignment_OK (Name (Instr));
2699 Append_To (Assign, Instr);
2701 -- Ada 2005 (AI-251): If tagged type has progenitors we must
2702 -- also initialize tags of the secondary dispatch tables.
2704 if Has_Interfaces (Base_Type (Typ)) then
2706 (Typ => Base_Type (Typ),
2708 Stmts_List => Assign);
2712 -- Call Adjust manually
2714 if Needs_Finalization (Etype (A))
2715 and then not Is_Limited_Type (Etype (A))
2717 Append_List_To (Assign,
2719 Ref => New_Copy_Tree (Ref),
2721 Flist_Ref => New_Reference_To (
2722 RTE (RE_Global_Final_List), Loc),
2723 With_Attach => Make_Integer_Literal (Loc, 0)));
2727 Make_Unsuppress_Block (Loc, Name_Discriminant_Check, Assign));
2729 if Has_Discriminants (Init_Typ) then
2730 Check_Ancestor_Discriminants (Init_Typ);
2735 -- Normal case (not an extension aggregate)
2738 -- Generate the discriminant expressions, component by component.
2739 -- If the base type is an unchecked union, the discriminants are
2740 -- unknown to the back-end and absent from a value of the type, so
2741 -- assignments for them are not emitted.
2743 if Has_Discriminants (Typ)
2744 and then not Is_Unchecked_Union (Base_Type (Typ))
2746 -- If the type is derived, and constrains discriminants of the
2747 -- parent type, these discriminants are not components of the
2748 -- aggregate, and must be initialized explicitly. They are not
2749 -- visible components of the object, but can become visible with
2750 -- a view conversion to the ancestor.
2754 Parent_Type : Entity_Id;
2756 Discr_Val : Elmt_Id;
2759 Btype := Base_Type (Typ);
2760 while Is_Derived_Type (Btype)
2761 and then Present (Stored_Constraint (Btype))
2763 Parent_Type := Etype (Btype);
2765 Disc := First_Discriminant (Parent_Type);
2767 First_Elmt (Stored_Constraint (Base_Type (Typ)));
2768 while Present (Discr_Val) loop
2770 -- Only those discriminants of the parent that are not
2771 -- renamed by discriminants of the derived type need to
2772 -- be added explicitly.
2774 if not Is_Entity_Name (Node (Discr_Val))
2776 Ekind (Entity (Node (Discr_Val))) /= E_Discriminant
2779 Make_Selected_Component (Loc,
2780 Prefix => New_Copy_Tree (Target),
2781 Selector_Name => New_Occurrence_Of (Disc, Loc));
2784 Make_OK_Assignment_Statement (Loc,
2786 Expression => New_Copy_Tree (Node (Discr_Val)));
2788 Set_No_Ctrl_Actions (Instr);
2789 Append_To (L, Instr);
2792 Next_Discriminant (Disc);
2793 Next_Elmt (Discr_Val);
2796 Btype := Base_Type (Parent_Type);
2800 -- Generate discriminant init values for the visible discriminants
2803 Discriminant : Entity_Id;
2804 Discriminant_Value : Node_Id;
2807 Discriminant := First_Stored_Discriminant (Typ);
2808 while Present (Discriminant) loop
2810 Make_Selected_Component (Loc,
2811 Prefix => New_Copy_Tree (Target),
2812 Selector_Name => New_Occurrence_Of (Discriminant, Loc));
2814 Discriminant_Value :=
2815 Get_Discriminant_Value (
2818 Discriminant_Constraint (N_Typ));
2821 Make_OK_Assignment_Statement (Loc,
2823 Expression => New_Copy_Tree (Discriminant_Value));
2825 Set_No_Ctrl_Actions (Instr);
2826 Append_To (L, Instr);
2828 Next_Stored_Discriminant (Discriminant);
2834 -- For CPP types we generate an implicit call to the C++ default
2835 -- constructor to ensure the proper initialization of the _Tag
2838 if Is_CPP_Class (Typ) then
2839 pragma Assert (Present (Base_Init_Proc (Typ)));
2841 Build_Initialization_Call (Loc,
2846 -- Generate the assignments, component by component
2848 -- tmp.comp1 := Expr1_From_Aggr;
2849 -- tmp.comp2 := Expr2_From_Aggr;
2852 Comp := First (Component_Associations (N));
2853 while Present (Comp) loop
2854 Selector := Entity (First (Choices (Comp)));
2858 if Is_CPP_Constructor_Call (Expression (Comp)) then
2860 Build_Initialization_Call (Loc,
2861 Id_Ref => Make_Selected_Component (Loc,
2862 Prefix => New_Copy_Tree (Target),
2863 Selector_Name => New_Occurrence_Of (Selector,
2865 Typ => Etype (Selector),
2867 With_Default_Init => True,
2868 Constructor_Ref => Expression (Comp)));
2870 -- Ada 2005 (AI-287): For each default-initialized component generate
2871 -- a call to the corresponding IP subprogram if available.
2873 elsif Box_Present (Comp)
2874 and then Has_Non_Null_Base_Init_Proc (Etype (Selector))
2876 if Ekind (Selector) /= E_Discriminant then
2877 Gen_Ctrl_Actions_For_Aggr;
2880 -- Ada 2005 (AI-287): If the component type has tasks then
2881 -- generate the activation chain and master entities (except
2882 -- in case of an allocator because in that case these entities
2883 -- are generated by Build_Task_Allocate_Block_With_Init_Stmts).
2886 Ctype : constant Entity_Id := Etype (Selector);
2887 Inside_Allocator : Boolean := False;
2888 P : Node_Id := Parent (N);
2891 if Is_Task_Type (Ctype) or else Has_Task (Ctype) then
2892 while Present (P) loop
2893 if Nkind (P) = N_Allocator then
2894 Inside_Allocator := True;
2901 if not Inside_Init_Proc and not Inside_Allocator then
2902 Build_Activation_Chain_Entity (N);
2908 Build_Initialization_Call (Loc,
2909 Id_Ref => Make_Selected_Component (Loc,
2910 Prefix => New_Copy_Tree (Target),
2911 Selector_Name => New_Occurrence_Of (Selector,
2913 Typ => Etype (Selector),
2915 With_Default_Init => True));
2917 -- Prepare for component assignment
2919 elsif Ekind (Selector) /= E_Discriminant
2920 or else Nkind (N) = N_Extension_Aggregate
2922 -- All the discriminants have now been assigned
2924 -- This is now a good moment to initialize and attach all the
2925 -- controllers. Their position may depend on the discriminants.
2927 if Ekind (Selector) /= E_Discriminant then
2928 Gen_Ctrl_Actions_For_Aggr;
2931 Comp_Type := Etype (Selector);
2933 Make_Selected_Component (Loc,
2934 Prefix => New_Copy_Tree (Target),
2935 Selector_Name => New_Occurrence_Of (Selector, Loc));
2937 if Nkind (Expression (Comp)) = N_Qualified_Expression then
2938 Expr_Q := Expression (Expression (Comp));
2940 Expr_Q := Expression (Comp);
2943 -- The controller is the one of the parent type defining the
2944 -- component (in case of inherited components).
2946 if Needs_Finalization (Comp_Type) then
2947 Internal_Final_List :=
2948 Make_Selected_Component (Loc,
2949 Prefix => Convert_To (
2950 Scope (Original_Record_Component (Selector)),
2951 New_Copy_Tree (Target)),
2953 Make_Identifier (Loc, Name_uController));
2955 Internal_Final_List :=
2956 Make_Selected_Component (Loc,
2957 Prefix => Internal_Final_List,
2958 Selector_Name => Make_Identifier (Loc, Name_F));
2960 -- The internal final list can be part of a constant object
2962 Set_Assignment_OK (Internal_Final_List);
2965 Internal_Final_List := Empty;
2968 -- Now either create the assignment or generate the code for the
2969 -- inner aggregate top-down.
2971 if Is_Delayed_Aggregate (Expr_Q) then
2973 -- We have the following case of aggregate nesting inside
2974 -- an object declaration:
2976 -- type Arr_Typ is array (Integer range <>) of ...;
2978 -- type Rec_Typ (...) is record
2979 -- Obj_Arr_Typ : Arr_Typ (A .. B);
2982 -- Obj_Rec_Typ : Rec_Typ := (...,
2983 -- Obj_Arr_Typ => (X => (...), Y => (...)));
2985 -- The length of the ranges of the aggregate and Obj_Add_Typ
2986 -- are equal (B - A = Y - X), but they do not coincide (X /=
2987 -- A and B /= Y). This case requires array sliding which is
2988 -- performed in the following manner:
2990 -- subtype Arr_Sub is Arr_Typ (X .. Y);
2992 -- Temp (X) := (...);
2994 -- Temp (Y) := (...);
2995 -- Obj_Rec_Typ.Obj_Arr_Typ := Temp;
2997 if Ekind (Comp_Type) = E_Array_Subtype
2998 and then Is_Int_Range_Bounds (Aggregate_Bounds (Expr_Q))
2999 and then Is_Int_Range_Bounds (First_Index (Comp_Type))
3001 Compatible_Int_Bounds
3002 (Agg_Bounds => Aggregate_Bounds (Expr_Q),
3003 Typ_Bounds => First_Index (Comp_Type))
3005 -- Create the array subtype with bounds equal to those of
3006 -- the corresponding aggregate.
3009 SubE : constant Entity_Id :=
3010 Make_Defining_Identifier (Loc,
3011 Chars => New_Internal_Name ('T'));
3013 SubD : constant Node_Id :=
3014 Make_Subtype_Declaration (Loc,
3015 Defining_Identifier => SubE,
3016 Subtype_Indication =>
3017 Make_Subtype_Indication (Loc,
3020 (Etype (Comp_Type), Loc),
3022 Make_Index_Or_Discriminant_Constraint
3024 Constraints => New_List (
3026 (Aggregate_Bounds (Expr_Q))))));
3028 -- Create a temporary array of the above subtype which
3029 -- will be used to capture the aggregate assignments.
3031 TmpE : constant Entity_Id := Make_Temporary (Loc, 'A', N);
3033 TmpD : constant Node_Id :=
3034 Make_Object_Declaration (Loc,
3035 Defining_Identifier => TmpE,
3036 Object_Definition =>
3037 New_Reference_To (SubE, Loc));
3040 Set_No_Initialization (TmpD);
3041 Append_To (L, SubD);
3042 Append_To (L, TmpD);
3044 -- Expand aggregate into assignments to the temp array
3047 Late_Expansion (Expr_Q, Comp_Type,
3048 New_Reference_To (TmpE, Loc), Internal_Final_List));
3053 Make_Assignment_Statement (Loc,
3054 Name => New_Copy_Tree (Comp_Expr),
3055 Expression => New_Reference_To (TmpE, Loc)));
3057 -- Do not pass the original aggregate to Gigi as is,
3058 -- since it will potentially clobber the front or the end
3059 -- of the array. Setting the expression to empty is safe
3060 -- since all aggregates are expanded into assignments.
3062 if Present (Obj) then
3063 Set_Expression (Parent (Obj), Empty);
3067 -- Normal case (sliding not required)
3071 Late_Expansion (Expr_Q, Comp_Type, Comp_Expr,
3072 Internal_Final_List));
3075 -- Expr_Q is not delayed aggregate
3078 if Has_Discriminants (Typ) then
3079 Replace_Discriminants (Expr_Q);
3083 Make_OK_Assignment_Statement (Loc,
3085 Expression => Expr_Q);
3087 Set_No_Ctrl_Actions (Instr);
3088 Append_To (L, Instr);
3090 -- Adjust the tag if tagged (because of possible view
3091 -- conversions), unless compiling for a VM where tags are
3094 -- tmp.comp._tag := comp_typ'tag;
3096 if Is_Tagged_Type (Comp_Type)
3097 and then Tagged_Type_Expansion
3100 Make_OK_Assignment_Statement (Loc,
3102 Make_Selected_Component (Loc,
3103 Prefix => New_Copy_Tree (Comp_Expr),
3106 (First_Tag_Component (Comp_Type), Loc)),
3109 Unchecked_Convert_To (RTE (RE_Tag),
3111 (Node (First_Elmt (Access_Disp_Table (Comp_Type))),
3114 Append_To (L, Instr);
3117 -- Adjust and Attach the component to the proper controller
3119 -- Adjust (tmp.comp);
3120 -- Attach_To_Final_List (tmp.comp,
3121 -- comp_typ (tmp)._record_controller.f)
3123 if Needs_Finalization (Comp_Type)
3124 and then not Is_Limited_Type (Comp_Type)
3128 Ref => New_Copy_Tree (Comp_Expr),
3130 Flist_Ref => Internal_Final_List,
3131 With_Attach => Make_Integer_Literal (Loc, 1)));
3137 elsif Ekind (Selector) = E_Discriminant
3138 and then Nkind (N) /= N_Extension_Aggregate
3139 and then Nkind (Parent (N)) = N_Component_Association
3140 and then Is_Constrained (Typ)
3142 -- We must check that the discriminant value imposed by the
3143 -- context is the same as the value given in the subaggregate,
3144 -- because after the expansion into assignments there is no
3145 -- record on which to perform a regular discriminant check.
3152 D_Val := First_Elmt (Discriminant_Constraint (Typ));
3153 Disc := First_Discriminant (Typ);
3154 while Chars (Disc) /= Chars (Selector) loop
3155 Next_Discriminant (Disc);
3159 pragma Assert (Present (D_Val));
3161 -- This check cannot performed for components that are
3162 -- constrained by a current instance, because this is not a
3163 -- value that can be compared with the actual constraint.
3165 if Nkind (Node (D_Val)) /= N_Attribute_Reference
3166 or else not Is_Entity_Name (Prefix (Node (D_Val)))
3167 or else not Is_Type (Entity (Prefix (Node (D_Val))))
3170 Make_Raise_Constraint_Error (Loc,
3173 Left_Opnd => New_Copy_Tree (Node (D_Val)),
3174 Right_Opnd => Expression (Comp)),
3175 Reason => CE_Discriminant_Check_Failed));
3178 -- Find self-reference in previous discriminant assignment,
3179 -- and replace with proper expression.
3186 while Present (Ass) loop
3187 if Nkind (Ass) = N_Assignment_Statement
3188 and then Nkind (Name (Ass)) = N_Selected_Component
3189 and then Chars (Selector_Name (Name (Ass))) =
3193 (Ass, New_Copy_Tree (Expression (Comp)));
3206 -- If the type is tagged, the tag needs to be initialized (unless
3207 -- compiling for the Java VM where tags are implicit). It is done
3208 -- late in the initialization process because in some cases, we call
3209 -- the init proc of an ancestor which will not leave out the right tag
3211 if Ancestor_Is_Expression then
3214 -- For CPP types we generated a call to the C++ default constructor
3215 -- before the components have been initialized to ensure the proper
3216 -- initialization of the _Tag component (see above).
3218 elsif Is_CPP_Class (Typ) then
3221 elsif Is_Tagged_Type (Typ) and then Tagged_Type_Expansion then
3223 Make_OK_Assignment_Statement (Loc,
3225 Make_Selected_Component (Loc,
3226 Prefix => New_Copy_Tree (Target),
3229 (First_Tag_Component (Base_Type (Typ)), Loc)),
3232 Unchecked_Convert_To (RTE (RE_Tag),
3234 (Node (First_Elmt (Access_Disp_Table (Base_Type (Typ)))),
3237 Append_To (L, Instr);
3239 -- Ada 2005 (AI-251): If the tagged type has been derived from
3240 -- abstract interfaces we must also initialize the tags of the
3241 -- secondary dispatch tables.
3243 if Has_Interfaces (Base_Type (Typ)) then
3245 (Typ => Base_Type (Typ),
3251 -- If the controllers have not been initialized yet (by lack of non-
3252 -- discriminant components), let's do it now.
3254 Gen_Ctrl_Actions_For_Aggr;
3257 end Build_Record_Aggr_Code;
3259 -------------------------------
3260 -- Convert_Aggr_In_Allocator --
3261 -------------------------------
3263 procedure Convert_Aggr_In_Allocator
3268 Loc : constant Source_Ptr := Sloc (Aggr);
3269 Typ : constant Entity_Id := Etype (Aggr);
3270 Temp : constant Entity_Id := Defining_Identifier (Decl);
3272 Occ : constant Node_Id :=
3273 Unchecked_Convert_To (Typ,
3274 Make_Explicit_Dereference (Loc,
3275 New_Reference_To (Temp, Loc)));
3277 Access_Type : constant Entity_Id := Etype (Temp);
3281 -- If the allocator is for an access discriminant, there is no
3282 -- finalization list for the anonymous access type, and the eventual
3283 -- finalization of the object is handled through the coextension
3284 -- mechanism. If the enclosing object is not dynamically allocated,
3285 -- the access discriminant is itself placed on the stack. Otherwise,
3286 -- some other finalization list is used (see exp_ch4.adb).
3288 -- Decl has been inserted in the code ahead of the allocator, using
3289 -- Insert_Actions. We use Insert_Actions below as well, to ensure that
3290 -- subsequent insertions are done in the proper order. Using (for
3291 -- example) Insert_Actions_After to place the expanded aggregate
3292 -- immediately after Decl may lead to out-of-order references if the
3293 -- allocator has generated a finalization list, as when the designated
3294 -- object is controlled and there is an open transient scope.
3296 if Ekind (Access_Type) = E_Anonymous_Access_Type
3297 and then Nkind (Associated_Node_For_Itype (Access_Type)) =
3298 N_Discriminant_Specification
3302 elsif Needs_Finalization (Typ) then
3303 Flist := Find_Final_List (Access_Type);
3305 -- Otherwise there are no controlled actions to be performed.
3311 if Is_Array_Type (Typ) then
3312 Convert_Array_Aggr_In_Allocator (Decl, Aggr, Occ);
3314 elsif Has_Default_Init_Comps (Aggr) then
3316 L : constant List_Id := New_List;
3317 Init_Stmts : List_Id;
3324 Associated_Final_Chain (Base_Type (Access_Type)));
3326 -- ??? Dubious actual for Obj: expect 'the original object being
3329 if Has_Task (Typ) then
3330 Build_Task_Allocate_Block_With_Init_Stmts (L, Aggr, Init_Stmts);
3331 Insert_Actions (Alloc, L);
3333 Insert_Actions (Alloc, Init_Stmts);
3338 Insert_Actions (Alloc,
3340 (Aggr, Typ, Occ, Flist,
3341 Associated_Final_Chain (Base_Type (Access_Type))));
3343 -- ??? Dubious actual for Obj: expect 'the original object being
3347 end Convert_Aggr_In_Allocator;
3349 --------------------------------
3350 -- Convert_Aggr_In_Assignment --
3351 --------------------------------
3353 procedure Convert_Aggr_In_Assignment (N : Node_Id) is
3354 Aggr : Node_Id := Expression (N);
3355 Typ : constant Entity_Id := Etype (Aggr);
3356 Occ : constant Node_Id := New_Copy_Tree (Name (N));
3359 if Nkind (Aggr) = N_Qualified_Expression then
3360 Aggr := Expression (Aggr);
3363 Insert_Actions_After (N,
3366 Find_Final_List (Typ, New_Copy_Tree (Occ))));
3367 end Convert_Aggr_In_Assignment;
3369 ---------------------------------
3370 -- Convert_Aggr_In_Object_Decl --
3371 ---------------------------------
3373 procedure Convert_Aggr_In_Object_Decl (N : Node_Id) is
3374 Obj : constant Entity_Id := Defining_Identifier (N);
3375 Aggr : Node_Id := Expression (N);
3376 Loc : constant Source_Ptr := Sloc (Aggr);
3377 Typ : constant Entity_Id := Etype (Aggr);
3378 Occ : constant Node_Id := New_Occurrence_Of (Obj, Loc);
3380 function Discriminants_Ok return Boolean;
3381 -- If the object type is constrained, the discriminants in the
3382 -- aggregate must be checked against the discriminants of the subtype.
3383 -- This cannot be done using Apply_Discriminant_Checks because after
3384 -- expansion there is no aggregate left to check.
3386 ----------------------
3387 -- Discriminants_Ok --
3388 ----------------------
3390 function Discriminants_Ok return Boolean is
3391 Cond : Node_Id := Empty;
3400 D := First_Discriminant (Typ);
3401 Disc1 := First_Elmt (Discriminant_Constraint (Typ));
3402 Disc2 := First_Elmt (Discriminant_Constraint (Etype (Obj)));
3403 while Present (Disc1) and then Present (Disc2) loop
3404 Val1 := Node (Disc1);
3405 Val2 := Node (Disc2);
3407 if not Is_OK_Static_Expression (Val1)
3408 or else not Is_OK_Static_Expression (Val2)
3410 Check := Make_Op_Ne (Loc,
3411 Left_Opnd => Duplicate_Subexpr (Val1),
3412 Right_Opnd => Duplicate_Subexpr (Val2));
3418 Cond := Make_Or_Else (Loc,
3420 Right_Opnd => Check);
3423 elsif Expr_Value (Val1) /= Expr_Value (Val2) then
3424 Apply_Compile_Time_Constraint_Error (Aggr,
3425 Msg => "incorrect value for discriminant&?",
3426 Reason => CE_Discriminant_Check_Failed,
3431 Next_Discriminant (D);
3436 -- If any discriminant constraint is non-static, emit a check
3438 if Present (Cond) then
3440 Make_Raise_Constraint_Error (Loc,
3442 Reason => CE_Discriminant_Check_Failed));
3446 end Discriminants_Ok;
3448 -- Start of processing for Convert_Aggr_In_Object_Decl
3451 Set_Assignment_OK (Occ);
3453 if Nkind (Aggr) = N_Qualified_Expression then
3454 Aggr := Expression (Aggr);
3457 if Has_Discriminants (Typ)
3458 and then Typ /= Etype (Obj)
3459 and then Is_Constrained (Etype (Obj))
3460 and then not Discriminants_Ok
3465 -- If the context is an extended return statement, it has its own
3466 -- finalization machinery (i.e. works like a transient scope) and
3467 -- we do not want to create an additional one, because objects on
3468 -- the finalization list of the return must be moved to the caller's
3469 -- finalization list to complete the return.
3471 -- However, if the aggregate is limited, it is built in place, and the
3472 -- controlled components are not assigned to intermediate temporaries
3473 -- so there is no need for a transient scope in this case either.
3475 if Requires_Transient_Scope (Typ)
3476 and then Ekind (Current_Scope) /= E_Return_Statement
3477 and then not Is_Limited_Type (Typ)
3479 Establish_Transient_Scope
3482 Is_Controlled (Typ) or else Has_Controlled_Component (Typ));
3485 Insert_Actions_After (N, Late_Expansion (Aggr, Typ, Occ, Obj => Obj));
3486 Set_No_Initialization (N);
3487 Initialize_Discriminants (N, Typ);
3488 end Convert_Aggr_In_Object_Decl;
3490 -------------------------------------
3491 -- Convert_Array_Aggr_In_Allocator --
3492 -------------------------------------
3494 procedure Convert_Array_Aggr_In_Allocator
3499 Aggr_Code : List_Id;
3500 Typ : constant Entity_Id := Etype (Aggr);
3501 Ctyp : constant Entity_Id := Component_Type (Typ);
3504 -- The target is an explicit dereference of the allocated object.
3505 -- Generate component assignments to it, as for an aggregate that
3506 -- appears on the right-hand side of an assignment statement.
3509 Build_Array_Aggr_Code (Aggr,
3511 Index => First_Index (Typ),
3513 Scalar_Comp => Is_Scalar_Type (Ctyp));
3515 Insert_Actions_After (Decl, Aggr_Code);
3516 end Convert_Array_Aggr_In_Allocator;
3518 ----------------------------
3519 -- Convert_To_Assignments --
3520 ----------------------------
3522 procedure Convert_To_Assignments (N : Node_Id; Typ : Entity_Id) is
3523 Loc : constant Source_Ptr := Sloc (N);
3528 Target_Expr : Node_Id;
3529 Parent_Kind : Node_Kind;
3530 Unc_Decl : Boolean := False;
3531 Parent_Node : Node_Id;
3534 pragma Assert (not Is_Static_Dispatch_Table_Aggregate (N));
3535 pragma Assert (Is_Record_Type (Typ));
3537 Parent_Node := Parent (N);
3538 Parent_Kind := Nkind (Parent_Node);
3540 if Parent_Kind = N_Qualified_Expression then
3542 -- Check if we are in a unconstrained declaration because in this
3543 -- case the current delayed expansion mechanism doesn't work when
3544 -- the declared object size depend on the initializing expr.
3547 Parent_Node := Parent (Parent_Node);
3548 Parent_Kind := Nkind (Parent_Node);
3550 if Parent_Kind = N_Object_Declaration then
3552 not Is_Entity_Name (Object_Definition (Parent_Node))
3553 or else Has_Discriminants
3554 (Entity (Object_Definition (Parent_Node)))
3555 or else Is_Class_Wide_Type
3556 (Entity (Object_Definition (Parent_Node)));
3561 -- Just set the Delay flag in the cases where the transformation will be
3562 -- done top down from above.
3566 -- Internal aggregate (transformed when expanding the parent)
3568 or else Parent_Kind = N_Aggregate
3569 or else Parent_Kind = N_Extension_Aggregate
3570 or else Parent_Kind = N_Component_Association
3572 -- Allocator (see Convert_Aggr_In_Allocator)
3574 or else Parent_Kind = N_Allocator
3576 -- Object declaration (see Convert_Aggr_In_Object_Decl)
3578 or else (Parent_Kind = N_Object_Declaration and then not Unc_Decl)
3580 -- Safe assignment (see Convert_Aggr_Assignments). So far only the
3581 -- assignments in init procs are taken into account.
3583 or else (Parent_Kind = N_Assignment_Statement
3584 and then Inside_Init_Proc)
3586 -- (Ada 2005) An inherently limited type in a return statement,
3587 -- which will be handled in a build-in-place fashion, and may be
3588 -- rewritten as an extended return and have its own finalization
3589 -- machinery. In the case of a simple return, the aggregate needs
3590 -- to be delayed until the scope for the return statement has been
3591 -- created, so that any finalization chain will be associated with
3592 -- that scope. For extended returns, we delay expansion to avoid the
3593 -- creation of an unwanted transient scope that could result in
3594 -- premature finalization of the return object (which is built in
3595 -- in place within the caller's scope).
3598 (Is_Inherently_Limited_Type (Typ)
3600 (Nkind (Parent (Parent_Node)) = N_Extended_Return_Statement
3601 or else Nkind (Parent_Node) = N_Simple_Return_Statement))
3603 Set_Expansion_Delayed (N);
3607 if Requires_Transient_Scope (Typ) then
3608 Establish_Transient_Scope
3610 Is_Controlled (Typ) or else Has_Controlled_Component (Typ));
3613 -- If the aggregate is non-limited, create a temporary. If it is limited
3614 -- and the context is an assignment, this is a subaggregate for an
3615 -- enclosing aggregate being expanded. It must be built in place, so use
3616 -- the target of the current assignment.
3618 if Is_Limited_Type (Typ)
3619 and then Nkind (Parent (N)) = N_Assignment_Statement
3621 Target_Expr := New_Copy_Tree (Name (Parent (N)));
3623 (Parent (N), Build_Record_Aggr_Code (N, Typ, Target_Expr));
3624 Rewrite (Parent (N), Make_Null_Statement (Loc));
3627 Temp := Make_Temporary (Loc, 'A', N);
3629 -- If the type inherits unknown discriminants, use the view with
3630 -- known discriminants if available.
3632 if Has_Unknown_Discriminants (Typ)
3633 and then Present (Underlying_Record_View (Typ))
3635 T := Underlying_Record_View (Typ);
3641 Make_Object_Declaration (Loc,
3642 Defining_Identifier => Temp,
3643 Object_Definition => New_Occurrence_Of (T, Loc));
3645 Set_No_Initialization (Instr);
3646 Insert_Action (N, Instr);
3647 Initialize_Discriminants (Instr, T);
3648 Target_Expr := New_Occurrence_Of (Temp, Loc);
3649 Insert_Actions (N, Build_Record_Aggr_Code (N, T, Target_Expr));
3650 Rewrite (N, New_Occurrence_Of (Temp, Loc));
3651 Analyze_And_Resolve (N, T);
3653 end Convert_To_Assignments;
3655 ---------------------------
3656 -- Convert_To_Positional --
3657 ---------------------------
3659 procedure Convert_To_Positional
3661 Max_Others_Replicate : Nat := 5;
3662 Handle_Bit_Packed : Boolean := False)
3664 Typ : constant Entity_Id := Etype (N);
3666 Static_Components : Boolean := True;
3668 procedure Check_Static_Components;
3669 -- Check whether all components of the aggregate are compile-time known
3670 -- values, and can be passed as is to the back-end without further
3676 Ixb : Node_Id) return Boolean;
3677 -- Convert the aggregate into a purely positional form if possible. On
3678 -- entry the bounds of all dimensions are known to be static, and the
3679 -- total number of components is safe enough to expand.
3681 function Is_Flat (N : Node_Id; Dims : Int) return Boolean;
3682 -- Return True iff the array N is flat (which is not rivial in the case
3683 -- of multidimensionsl aggregates).
3685 -----------------------------
3686 -- Check_Static_Components --
3687 -----------------------------
3689 procedure Check_Static_Components is
3693 Static_Components := True;
3695 if Nkind (N) = N_String_Literal then
3698 elsif Present (Expressions (N)) then
3699 Expr := First (Expressions (N));
3700 while Present (Expr) loop
3701 if Nkind (Expr) /= N_Aggregate
3702 or else not Compile_Time_Known_Aggregate (Expr)
3703 or else Expansion_Delayed (Expr)
3705 Static_Components := False;
3713 if Nkind (N) = N_Aggregate
3714 and then Present (Component_Associations (N))
3716 Expr := First (Component_Associations (N));
3717 while Present (Expr) loop
3718 if Nkind (Expression (Expr)) = N_Integer_Literal then
3721 elsif Nkind (Expression (Expr)) /= N_Aggregate
3723 not Compile_Time_Known_Aggregate (Expression (Expr))
3724 or else Expansion_Delayed (Expression (Expr))
3726 Static_Components := False;
3733 end Check_Static_Components;
3742 Ixb : Node_Id) return Boolean
3744 Loc : constant Source_Ptr := Sloc (N);
3745 Blo : constant Node_Id := Type_Low_Bound (Etype (Ixb));
3746 Lo : constant Node_Id := Type_Low_Bound (Etype (Ix));
3747 Hi : constant Node_Id := Type_High_Bound (Etype (Ix));
3752 if Nkind (Original_Node (N)) = N_String_Literal then
3756 if not Compile_Time_Known_Value (Lo)
3757 or else not Compile_Time_Known_Value (Hi)
3762 Lov := Expr_Value (Lo);
3763 Hiv := Expr_Value (Hi);
3766 or else not Compile_Time_Known_Value (Blo)
3771 -- Determine if set of alternatives is suitable for conversion and
3772 -- build an array containing the values in sequence.
3775 Vals : array (UI_To_Int (Lov) .. UI_To_Int (Hiv))
3776 of Node_Id := (others => Empty);
3777 -- The values in the aggregate sorted appropriately
3780 -- Same data as Vals in list form
3783 -- Used to validate Max_Others_Replicate limit
3786 Num : Int := UI_To_Int (Lov);
3791 if Present (Expressions (N)) then
3792 Elmt := First (Expressions (N));
3793 while Present (Elmt) loop
3794 if Nkind (Elmt) = N_Aggregate
3795 and then Present (Next_Index (Ix))
3797 not Flatten (Elmt, Next_Index (Ix), Next_Index (Ixb))
3802 Vals (Num) := Relocate_Node (Elmt);
3809 if No (Component_Associations (N)) then
3813 Elmt := First (Component_Associations (N));
3815 if Nkind (Expression (Elmt)) = N_Aggregate then
3816 if Present (Next_Index (Ix))
3819 (Expression (Elmt), Next_Index (Ix), Next_Index (Ixb))
3825 Component_Loop : while Present (Elmt) loop
3826 Choice := First (Choices (Elmt));
3827 Choice_Loop : while Present (Choice) loop
3829 -- If we have an others choice, fill in the missing elements
3830 -- subject to the limit established by Max_Others_Replicate.
3832 if Nkind (Choice) = N_Others_Choice then
3835 for J in Vals'Range loop
3836 if No (Vals (J)) then
3837 Vals (J) := New_Copy_Tree (Expression (Elmt));
3838 Rep_Count := Rep_Count + 1;
3840 -- Check for maximum others replication. Note that
3841 -- we skip this test if either of the restrictions
3842 -- No_Elaboration_Code or No_Implicit_Loops is
3843 -- active, if this is a preelaborable unit or a
3844 -- predefined unit. This ensures that predefined
3845 -- units get the same level of constant folding in
3846 -- Ada 95 and Ada 05, where their categorization
3850 P : constant Entity_Id :=
3851 Cunit_Entity (Current_Sem_Unit);
3854 -- Check if duplication OK and if so continue
3857 if Restriction_Active (No_Elaboration_Code)
3858 or else Restriction_Active (No_Implicit_Loops)
3859 or else Is_Preelaborated (P)
3860 or else (Ekind (P) = E_Package_Body
3862 Is_Preelaborated (Spec_Entity (P)))
3864 Is_Predefined_File_Name
3865 (Unit_File_Name (Get_Source_Unit (P)))
3869 -- If duplication not OK, then we return False
3870 -- if the replication count is too high
3872 elsif Rep_Count > Max_Others_Replicate then
3875 -- Continue on if duplication not OK, but the
3876 -- replication count is not excessive.
3885 exit Component_Loop;
3887 -- Case of a subtype mark
3889 elsif Nkind (Choice) = N_Identifier
3890 and then Is_Type (Entity (Choice))
3892 Lo := Type_Low_Bound (Etype (Choice));
3893 Hi := Type_High_Bound (Etype (Choice));
3895 -- Case of subtype indication
3897 elsif Nkind (Choice) = N_Subtype_Indication then
3898 Lo := Low_Bound (Range_Expression (Constraint (Choice)));
3899 Hi := High_Bound (Range_Expression (Constraint (Choice)));
3903 elsif Nkind (Choice) = N_Range then
3904 Lo := Low_Bound (Choice);
3905 Hi := High_Bound (Choice);
3907 -- Normal subexpression case
3909 else pragma Assert (Nkind (Choice) in N_Subexpr);
3910 if not Compile_Time_Known_Value (Choice) then
3914 Vals (UI_To_Int (Expr_Value (Choice))) :=
3915 New_Copy_Tree (Expression (Elmt));
3920 -- Range cases merge with Lo,Hi said
3922 if not Compile_Time_Known_Value (Lo)
3924 not Compile_Time_Known_Value (Hi)
3928 for J in UI_To_Int (Expr_Value (Lo)) ..
3929 UI_To_Int (Expr_Value (Hi))
3931 Vals (J) := New_Copy_Tree (Expression (Elmt));
3937 end loop Choice_Loop;
3940 end loop Component_Loop;
3942 -- If we get here the conversion is possible
3945 for J in Vals'Range loop
3946 Append (Vals (J), Vlist);
3949 Rewrite (N, Make_Aggregate (Loc, Expressions => Vlist));
3950 Set_Aggregate_Bounds (N, Aggregate_Bounds (Original_Node (N)));
3959 function Is_Flat (N : Node_Id; Dims : Int) return Boolean is
3966 elsif Nkind (N) = N_Aggregate then
3967 if Present (Component_Associations (N)) then
3971 Elmt := First (Expressions (N));
3972 while Present (Elmt) loop
3973 if not Is_Flat (Elmt, Dims - 1) then
3987 -- Start of processing for Convert_To_Positional
3990 -- Ada 2005 (AI-287): Do not convert in case of default initialized
3991 -- components because in this case will need to call the corresponding
3994 if Has_Default_Init_Comps (N) then
3998 if Is_Flat (N, Number_Dimensions (Typ)) then
4002 if Is_Bit_Packed_Array (Typ)
4003 and then not Handle_Bit_Packed
4008 -- Do not convert to positional if controlled components are involved
4009 -- since these require special processing
4011 if Has_Controlled_Component (Typ) then
4015 Check_Static_Components;
4017 -- If the size is known, or all the components are static, try to
4018 -- build a fully positional aggregate.
4020 -- The size of the type may not be known for an aggregate with
4021 -- discriminated array components, but if the components are static
4022 -- it is still possible to verify statically that the length is
4023 -- compatible with the upper bound of the type, and therefore it is
4024 -- worth flattening such aggregates as well.
4026 -- For now the back-end expands these aggregates into individual
4027 -- assignments to the target anyway, but it is conceivable that
4028 -- it will eventually be able to treat such aggregates statically???
4030 if Aggr_Size_OK (N, Typ)
4031 and then Flatten (N, First_Index (Typ), First_Index (Base_Type (Typ)))
4033 if Static_Components then
4034 Set_Compile_Time_Known_Aggregate (N);
4035 Set_Expansion_Delayed (N, False);
4038 Analyze_And_Resolve (N, Typ);
4040 end Convert_To_Positional;
4042 ----------------------------
4043 -- Expand_Array_Aggregate --
4044 ----------------------------
4046 -- Array aggregate expansion proceeds as follows:
4048 -- 1. If requested we generate code to perform all the array aggregate
4049 -- bound checks, specifically
4051 -- (a) Check that the index range defined by aggregate bounds is
4052 -- compatible with corresponding index subtype.
4054 -- (b) If an others choice is present check that no aggregate
4055 -- index is outside the bounds of the index constraint.
4057 -- (c) For multidimensional arrays make sure that all subaggregates
4058 -- corresponding to the same dimension have the same bounds.
4060 -- 2. Check for packed array aggregate which can be converted to a
4061 -- constant so that the aggregate disappeares completely.
4063 -- 3. Check case of nested aggregate. Generally nested aggregates are
4064 -- handled during the processing of the parent aggregate.
4066 -- 4. Check if the aggregate can be statically processed. If this is the
4067 -- case pass it as is to Gigi. Note that a necessary condition for
4068 -- static processing is that the aggregate be fully positional.
4070 -- 5. If in place aggregate expansion is possible (i.e. no need to create
4071 -- a temporary) then mark the aggregate as such and return. Otherwise
4072 -- create a new temporary and generate the appropriate initialization
4075 procedure Expand_Array_Aggregate (N : Node_Id) is
4076 Loc : constant Source_Ptr := Sloc (N);
4078 Typ : constant Entity_Id := Etype (N);
4079 Ctyp : constant Entity_Id := Component_Type (Typ);
4080 -- Typ is the correct constrained array subtype of the aggregate
4081 -- Ctyp is the corresponding component type.
4083 Aggr_Dimension : constant Pos := Number_Dimensions (Typ);
4084 -- Number of aggregate index dimensions
4086 Aggr_Low : array (1 .. Aggr_Dimension) of Node_Id;
4087 Aggr_High : array (1 .. Aggr_Dimension) of Node_Id;
4088 -- Low and High bounds of the constraint for each aggregate index
4090 Aggr_Index_Typ : array (1 .. Aggr_Dimension) of Entity_Id;
4091 -- The type of each index
4093 Maybe_In_Place_OK : Boolean;
4094 -- If the type is neither controlled nor packed and the aggregate
4095 -- is the expression in an assignment, assignment in place may be
4096 -- possible, provided other conditions are met on the LHS.
4098 Others_Present : array (1 .. Aggr_Dimension) of Boolean :=
4100 -- If Others_Present (J) is True, then there is an others choice
4101 -- in one of the sub-aggregates of N at dimension J.
4103 procedure Build_Constrained_Type (Positional : Boolean);
4104 -- If the subtype is not static or unconstrained, build a constrained
4105 -- type using the computable sizes of the aggregate and its sub-
4108 procedure Check_Bounds (Aggr_Bounds : Node_Id; Index_Bounds : Node_Id);
4109 -- Checks that the bounds of Aggr_Bounds are within the bounds defined
4112 procedure Check_Same_Aggr_Bounds (Sub_Aggr : Node_Id; Dim : Pos);
4113 -- Checks that in a multi-dimensional array aggregate all subaggregates
4114 -- corresponding to the same dimension have the same bounds.
4115 -- Sub_Aggr is an array sub-aggregate. Dim is the dimension
4116 -- corresponding to the sub-aggregate.
4118 procedure Compute_Others_Present (Sub_Aggr : Node_Id; Dim : Pos);
4119 -- Computes the values of array Others_Present. Sub_Aggr is the
4120 -- array sub-aggregate we start the computation from. Dim is the
4121 -- dimension corresponding to the sub-aggregate.
4123 function Has_Address_Clause (D : Node_Id) return Boolean;
4124 -- If the aggregate is the expression in an object declaration, it
4125 -- cannot be expanded in place. This function does a lookahead in the
4126 -- current declarative part to find an address clause for the object
4129 function In_Place_Assign_OK return Boolean;
4130 -- Simple predicate to determine whether an aggregate assignment can
4131 -- be done in place, because none of the new values can depend on the
4132 -- components of the target of the assignment.
4134 procedure Others_Check (Sub_Aggr : Node_Id; Dim : Pos);
4135 -- Checks that if an others choice is present in any sub-aggregate no
4136 -- aggregate index is outside the bounds of the index constraint.
4137 -- Sub_Aggr is an array sub-aggregate. Dim is the dimension
4138 -- corresponding to the sub-aggregate.
4140 ----------------------------
4141 -- Build_Constrained_Type --
4142 ----------------------------
4144 procedure Build_Constrained_Type (Positional : Boolean) is
4145 Loc : constant Source_Ptr := Sloc (N);
4146 Agg_Type : Entity_Id;
4149 Typ : constant Entity_Id := Etype (N);
4150 Indices : constant List_Id := New_List;
4156 Make_Defining_Identifier (
4157 Loc, New_Internal_Name ('A'));
4159 -- If the aggregate is purely positional, all its subaggregates
4160 -- have the same size. We collect the dimensions from the first
4161 -- subaggregate at each level.
4166 for D in 1 .. Number_Dimensions (Typ) loop
4167 Sub_Agg := First (Expressions (Sub_Agg));
4171 while Present (Comp) loop
4178 Low_Bound => Make_Integer_Literal (Loc, 1),
4180 Make_Integer_Literal (Loc, Num)),
4185 -- We know the aggregate type is unconstrained and the aggregate
4186 -- is not processable by the back end, therefore not necessarily
4187 -- positional. Retrieve each dimension bounds (computed earlier).
4190 for D in 1 .. Number_Dimensions (Typ) loop
4193 Low_Bound => Aggr_Low (D),
4194 High_Bound => Aggr_High (D)),
4200 Make_Full_Type_Declaration (Loc,
4201 Defining_Identifier => Agg_Type,
4203 Make_Constrained_Array_Definition (Loc,
4204 Discrete_Subtype_Definitions => Indices,
4205 Component_Definition =>
4206 Make_Component_Definition (Loc,
4207 Aliased_Present => False,
4208 Subtype_Indication =>
4209 New_Occurrence_Of (Component_Type (Typ), Loc))));
4211 Insert_Action (N, Decl);
4213 Set_Etype (N, Agg_Type);
4214 Set_Is_Itype (Agg_Type);
4215 Freeze_Itype (Agg_Type, N);
4216 end Build_Constrained_Type;
4222 procedure Check_Bounds (Aggr_Bounds : Node_Id; Index_Bounds : Node_Id) is
4229 Cond : Node_Id := Empty;
4232 Get_Index_Bounds (Aggr_Bounds, Aggr_Lo, Aggr_Hi);
4233 Get_Index_Bounds (Index_Bounds, Ind_Lo, Ind_Hi);
4235 -- Generate the following test:
4237 -- [constraint_error when
4238 -- Aggr_Lo <= Aggr_Hi and then
4239 -- (Aggr_Lo < Ind_Lo or else Aggr_Hi > Ind_Hi)]
4241 -- As an optimization try to see if some tests are trivially vacuous
4242 -- because we are comparing an expression against itself.
4244 if Aggr_Lo = Ind_Lo and then Aggr_Hi = Ind_Hi then
4247 elsif Aggr_Hi = Ind_Hi then
4250 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4251 Right_Opnd => Duplicate_Subexpr_Move_Checks (Ind_Lo));
4253 elsif Aggr_Lo = Ind_Lo then
4256 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Hi),
4257 Right_Opnd => Duplicate_Subexpr_Move_Checks (Ind_Hi));
4264 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4265 Right_Opnd => Duplicate_Subexpr_Move_Checks (Ind_Lo)),
4269 Left_Opnd => Duplicate_Subexpr (Aggr_Hi),
4270 Right_Opnd => Duplicate_Subexpr (Ind_Hi)));
4273 if Present (Cond) then
4278 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4279 Right_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Hi)),
4281 Right_Opnd => Cond);
4283 Set_Analyzed (Left_Opnd (Left_Opnd (Cond)), False);
4284 Set_Analyzed (Right_Opnd (Left_Opnd (Cond)), False);
4286 Make_Raise_Constraint_Error (Loc,
4288 Reason => CE_Length_Check_Failed));
4292 ----------------------------
4293 -- Check_Same_Aggr_Bounds --
4294 ----------------------------
4296 procedure Check_Same_Aggr_Bounds (Sub_Aggr : Node_Id; Dim : Pos) is
4297 Sub_Lo : constant Node_Id := Low_Bound (Aggregate_Bounds (Sub_Aggr));
4298 Sub_Hi : constant Node_Id := High_Bound (Aggregate_Bounds (Sub_Aggr));
4299 -- The bounds of this specific sub-aggregate
4301 Aggr_Lo : constant Node_Id := Aggr_Low (Dim);
4302 Aggr_Hi : constant Node_Id := Aggr_High (Dim);
4303 -- The bounds of the aggregate for this dimension
4305 Ind_Typ : constant Entity_Id := Aggr_Index_Typ (Dim);
4306 -- The index type for this dimension.xxx
4308 Cond : Node_Id := Empty;
4313 -- If index checks are on generate the test
4315 -- [constraint_error when
4316 -- Aggr_Lo /= Sub_Lo or else Aggr_Hi /= Sub_Hi]
4318 -- As an optimization try to see if some tests are trivially vacuos
4319 -- because we are comparing an expression against itself. Also for
4320 -- the first dimension the test is trivially vacuous because there
4321 -- is just one aggregate for dimension 1.
4323 if Index_Checks_Suppressed (Ind_Typ) then
4327 or else (Aggr_Lo = Sub_Lo and then Aggr_Hi = Sub_Hi)
4331 elsif Aggr_Hi = Sub_Hi then
4334 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4335 Right_Opnd => Duplicate_Subexpr_Move_Checks (Sub_Lo));
4337 elsif Aggr_Lo = Sub_Lo then
4340 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Hi),
4341 Right_Opnd => Duplicate_Subexpr_Move_Checks (Sub_Hi));
4348 Left_Opnd => Duplicate_Subexpr_Move_Checks (Aggr_Lo),
4349 Right_Opnd => Duplicate_Subexpr_Move_Checks (Sub_Lo)),
4353 Left_Opnd => Duplicate_Subexpr (Aggr_Hi),
4354 Right_Opnd => Duplicate_Subexpr (Sub_Hi)));
4357 if Present (Cond) then
4359 Make_Raise_Constraint_Error (Loc,
4361 Reason => CE_Length_Check_Failed));
4364 -- Now look inside the sub-aggregate to see if there is more work
4366 if Dim < Aggr_Dimension then
4368 -- Process positional components
4370 if Present (Expressions (Sub_Aggr)) then
4371 Expr := First (Expressions (Sub_Aggr));
4372 while Present (Expr) loop
4373 Check_Same_Aggr_Bounds (Expr, Dim + 1);
4378 -- Process component associations
4380 if Present (Component_Associations (Sub_Aggr)) then
4381 Assoc := First (Component_Associations (Sub_Aggr));
4382 while Present (Assoc) loop
4383 Expr := Expression (Assoc);
4384 Check_Same_Aggr_Bounds (Expr, Dim + 1);
4389 end Check_Same_Aggr_Bounds;
4391 ----------------------------
4392 -- Compute_Others_Present --
4393 ----------------------------
4395 procedure Compute_Others_Present (Sub_Aggr : Node_Id; Dim : Pos) is
4400 if Present (Component_Associations (Sub_Aggr)) then
4401 Assoc := Last (Component_Associations (Sub_Aggr));
4403 if Nkind (First (Choices (Assoc))) = N_Others_Choice then
4404 Others_Present (Dim) := True;
4408 -- Now look inside the sub-aggregate to see if there is more work
4410 if Dim < Aggr_Dimension then
4412 -- Process positional components
4414 if Present (Expressions (Sub_Aggr)) then
4415 Expr := First (Expressions (Sub_Aggr));
4416 while Present (Expr) loop
4417 Compute_Others_Present (Expr, Dim + 1);
4422 -- Process component associations
4424 if Present (Component_Associations (Sub_Aggr)) then
4425 Assoc := First (Component_Associations (Sub_Aggr));
4426 while Present (Assoc) loop
4427 Expr := Expression (Assoc);
4428 Compute_Others_Present (Expr, Dim + 1);
4433 end Compute_Others_Present;
4435 ------------------------
4436 -- Has_Address_Clause --
4437 ------------------------
4439 function Has_Address_Clause (D : Node_Id) return Boolean is
4440 Id : constant Entity_Id := Defining_Identifier (D);
4445 while Present (Decl) loop
4446 if Nkind (Decl) = N_At_Clause
4447 and then Chars (Identifier (Decl)) = Chars (Id)
4451 elsif Nkind (Decl) = N_Attribute_Definition_Clause
4452 and then Chars (Decl) = Name_Address
4453 and then Chars (Name (Decl)) = Chars (Id)
4462 end Has_Address_Clause;
4464 ------------------------
4465 -- In_Place_Assign_OK --
4466 ------------------------
4468 function In_Place_Assign_OK return Boolean is
4476 function Is_Others_Aggregate (Aggr : Node_Id) return Boolean;
4477 -- Aggregates that consist of a single Others choice are safe
4478 -- if the single expression is.
4480 function Safe_Aggregate (Aggr : Node_Id) return Boolean;
4481 -- Check recursively that each component of a (sub)aggregate does
4482 -- not depend on the variable being assigned to.
4484 function Safe_Component (Expr : Node_Id) return Boolean;
4485 -- Verify that an expression cannot depend on the variable being
4486 -- assigned to. Room for improvement here (but less than before).
4488 -------------------------
4489 -- Is_Others_Aggregate --
4490 -------------------------
4492 function Is_Others_Aggregate (Aggr : Node_Id) return Boolean is
4494 return No (Expressions (Aggr))
4496 (First (Choices (First (Component_Associations (Aggr)))))
4498 end Is_Others_Aggregate;
4500 --------------------
4501 -- Safe_Aggregate --
4502 --------------------
4504 function Safe_Aggregate (Aggr : Node_Id) return Boolean is
4508 if Present (Expressions (Aggr)) then
4509 Expr := First (Expressions (Aggr));
4510 while Present (Expr) loop
4511 if Nkind (Expr) = N_Aggregate then
4512 if not Safe_Aggregate (Expr) then
4516 elsif not Safe_Component (Expr) then
4524 if Present (Component_Associations (Aggr)) then
4525 Expr := First (Component_Associations (Aggr));
4526 while Present (Expr) loop
4527 if Nkind (Expression (Expr)) = N_Aggregate then
4528 if not Safe_Aggregate (Expression (Expr)) then
4532 elsif not Safe_Component (Expression (Expr)) then
4543 --------------------
4544 -- Safe_Component --
4545 --------------------
4547 function Safe_Component (Expr : Node_Id) return Boolean is
4548 Comp : Node_Id := Expr;
4550 function Check_Component (Comp : Node_Id) return Boolean;
4551 -- Do the recursive traversal, after copy
4553 ---------------------
4554 -- Check_Component --
4555 ---------------------
4557 function Check_Component (Comp : Node_Id) return Boolean is
4559 if Is_Overloaded (Comp) then
4563 return Compile_Time_Known_Value (Comp)
4565 or else (Is_Entity_Name (Comp)
4566 and then Present (Entity (Comp))
4567 and then No (Renamed_Object (Entity (Comp))))
4569 or else (Nkind (Comp) = N_Attribute_Reference
4570 and then Check_Component (Prefix (Comp)))
4572 or else (Nkind (Comp) in N_Binary_Op
4573 and then Check_Component (Left_Opnd (Comp))
4574 and then Check_Component (Right_Opnd (Comp)))
4576 or else (Nkind (Comp) in N_Unary_Op
4577 and then Check_Component (Right_Opnd (Comp)))
4579 or else (Nkind (Comp) = N_Selected_Component
4580 and then Check_Component (Prefix (Comp)))
4582 or else (Nkind (Comp) = N_Unchecked_Type_Conversion
4583 and then Check_Component (Expression (Comp)));
4584 end Check_Component;
4586 -- Start of processing for Safe_Component
4589 -- If the component appears in an association that may
4590 -- correspond to more than one element, it is not analyzed
4591 -- before the expansion into assignments, to avoid side effects.
4592 -- We analyze, but do not resolve the copy, to obtain sufficient
4593 -- entity information for the checks that follow. If component is
4594 -- overloaded we assume an unsafe function call.
4596 if not Analyzed (Comp) then
4597 if Is_Overloaded (Expr) then
4600 elsif Nkind (Expr) = N_Aggregate
4601 and then not Is_Others_Aggregate (Expr)
4605 elsif Nkind (Expr) = N_Allocator then
4607 -- For now, too complex to analyze
4612 Comp := New_Copy_Tree (Expr);
4613 Set_Parent (Comp, Parent (Expr));
4617 if Nkind (Comp) = N_Aggregate then
4618 return Safe_Aggregate (Comp);
4620 return Check_Component (Comp);
4624 -- Start of processing for In_Place_Assign_OK
4627 if Present (Component_Associations (N)) then
4629 -- On assignment, sliding can take place, so we cannot do the
4630 -- assignment in place unless the bounds of the aggregate are
4631 -- statically equal to those of the target.
4633 -- If the aggregate is given by an others choice, the bounds
4634 -- are derived from the left-hand side, and the assignment is
4635 -- safe if the expression is.
4637 if Is_Others_Aggregate (N) then
4640 (Expression (First (Component_Associations (N))));
4643 Aggr_In := First_Index (Etype (N));
4645 if Nkind (Parent (N)) = N_Assignment_Statement then
4646 Obj_In := First_Index (Etype (Name (Parent (N))));
4649 -- Context is an allocator. Check bounds of aggregate
4650 -- against given type in qualified expression.
4652 pragma Assert (Nkind (Parent (Parent (N))) = N_Allocator);
4654 First_Index (Etype (Entity (Subtype_Mark (Parent (N)))));
4657 while Present (Aggr_In) loop
4658 Get_Index_Bounds (Aggr_In, Aggr_Lo, Aggr_Hi);
4659 Get_Index_Bounds (Obj_In, Obj_Lo, Obj_Hi);
4661 if not Compile_Time_Known_Value (Aggr_Lo)
4662 or else not Compile_Time_Known_Value (Aggr_Hi)
4663 or else not Compile_Time_Known_Value (Obj_Lo)
4664 or else not Compile_Time_Known_Value (Obj_Hi)
4665 or else Expr_Value (Aggr_Lo) /= Expr_Value (Obj_Lo)
4666 or else Expr_Value (Aggr_Hi) /= Expr_Value (Obj_Hi)
4671 Next_Index (Aggr_In);
4672 Next_Index (Obj_In);
4676 -- Now check the component values themselves
4678 return Safe_Aggregate (N);
4679 end In_Place_Assign_OK;
4685 procedure Others_Check (Sub_Aggr : Node_Id; Dim : Pos) is
4686 Aggr_Lo : constant Node_Id := Aggr_Low (Dim);
4687 Aggr_Hi : constant Node_Id := Aggr_High (Dim);
4688 -- The bounds of the aggregate for this dimension
4690 Ind_Typ : constant Entity_Id := Aggr_Index_Typ (Dim);
4691 -- The index type for this dimension
4693 Need_To_Check : Boolean := False;
4695 Choices_Lo : Node_Id := Empty;
4696 Choices_Hi : Node_Id := Empty;
4697 -- The lowest and highest discrete choices for a named sub-aggregate
4699 Nb_Choices : Int := -1;
4700 -- The number of discrete non-others choices in this sub-aggregate
4702 Nb_Elements : Uint := Uint_0;
4703 -- The number of elements in a positional aggregate
4705 Cond : Node_Id := Empty;
4712 -- Check if we have an others choice. If we do make sure that this
4713 -- sub-aggregate contains at least one element in addition to the
4716 if Range_Checks_Suppressed (Ind_Typ) then
4717 Need_To_Check := False;
4719 elsif Present (Expressions (Sub_Aggr))
4720 and then Present (Component_Associations (Sub_Aggr))
4722 Need_To_Check := True;
4724 elsif Present (Component_Associations (Sub_Aggr)) then
4725 Assoc := Last (Component_Associations (Sub_Aggr));
4727 if Nkind (First (Choices (Assoc))) /= N_Others_Choice then
4728 Need_To_Check := False;
4731 -- Count the number of discrete choices. Start with -1 because
4732 -- the others choice does not count.
4735 Assoc := First (Component_Associations (Sub_Aggr));
4736 while Present (Assoc) loop
4737 Choice := First (Choices (Assoc));
4738 while Present (Choice) loop
4739 Nb_Choices := Nb_Choices + 1;
4746 -- If there is only an others choice nothing to do
4748 Need_To_Check := (Nb_Choices > 0);
4752 Need_To_Check := False;
4755 -- If we are dealing with a positional sub-aggregate with an others
4756 -- choice then compute the number or positional elements.
4758 if Need_To_Check and then Present (Expressions (Sub_Aggr)) then
4759 Expr := First (Expressions (Sub_Aggr));
4760 Nb_Elements := Uint_0;
4761 while Present (Expr) loop
4762 Nb_Elements := Nb_Elements + 1;
4766 -- If the aggregate contains discrete choices and an others choice
4767 -- compute the smallest and largest discrete choice values.
4769 elsif Need_To_Check then
4770 Compute_Choices_Lo_And_Choices_Hi : declare
4772 Table : Case_Table_Type (1 .. Nb_Choices);
4773 -- Used to sort all the different choice values
4780 Assoc := First (Component_Associations (Sub_Aggr));
4781 while Present (Assoc) loop
4782 Choice := First (Choices (Assoc));
4783 while Present (Choice) loop
4784 if Nkind (Choice) = N_Others_Choice then
4788 Get_Index_Bounds (Choice, Low, High);
4789 Table (J).Choice_Lo := Low;
4790 Table (J).Choice_Hi := High;
4799 -- Sort the discrete choices
4801 Sort_Case_Table (Table);
4803 Choices_Lo := Table (1).Choice_Lo;
4804 Choices_Hi := Table (Nb_Choices).Choice_Hi;
4805 end Compute_Choices_Lo_And_Choices_Hi;
4808 -- If no others choice in this sub-aggregate, or the aggregate
4809 -- comprises only an others choice, nothing to do.
4811 if not Need_To_Check then
4814 -- If we are dealing with an aggregate containing an others choice
4815 -- and positional components, we generate the following test:
4817 -- if Ind_Typ'Pos (Aggr_Lo) + (Nb_Elements - 1) >
4818 -- Ind_Typ'Pos (Aggr_Hi)
4820 -- raise Constraint_Error;
4823 elsif Nb_Elements > Uint_0 then
4829 Make_Attribute_Reference (Loc,
4830 Prefix => New_Reference_To (Ind_Typ, Loc),
4831 Attribute_Name => Name_Pos,
4834 (Duplicate_Subexpr_Move_Checks (Aggr_Lo))),
4835 Right_Opnd => Make_Integer_Literal (Loc, Nb_Elements - 1)),
4838 Make_Attribute_Reference (Loc,
4839 Prefix => New_Reference_To (Ind_Typ, Loc),
4840 Attribute_Name => Name_Pos,
4841 Expressions => New_List (
4842 Duplicate_Subexpr_Move_Checks (Aggr_Hi))));
4844 -- If we are dealing with an aggregate containing an others choice
4845 -- and discrete choices we generate the following test:
4847 -- [constraint_error when
4848 -- Choices_Lo < Aggr_Lo or else Choices_Hi > Aggr_Hi];
4856 Duplicate_Subexpr_Move_Checks (Choices_Lo),
4858 Duplicate_Subexpr_Move_Checks (Aggr_Lo)),
4863 Duplicate_Subexpr (Choices_Hi),
4865 Duplicate_Subexpr (Aggr_Hi)));
4868 if Present (Cond) then
4870 Make_Raise_Constraint_Error (Loc,
4872 Reason => CE_Length_Check_Failed));
4873 -- Questionable reason code, shouldn't that be a
4874 -- CE_Range_Check_Failed ???
4877 -- Now look inside the sub-aggregate to see if there is more work
4879 if Dim < Aggr_Dimension then
4881 -- Process positional components
4883 if Present (Expressions (Sub_Aggr)) then
4884 Expr := First (Expressions (Sub_Aggr));
4885 while Present (Expr) loop
4886 Others_Check (Expr, Dim + 1);
4891 -- Process component associations
4893 if Present (Component_Associations (Sub_Aggr)) then
4894 Assoc := First (Component_Associations (Sub_Aggr));
4895 while Present (Assoc) loop
4896 Expr := Expression (Assoc);
4897 Others_Check (Expr, Dim + 1);
4904 -- Remaining Expand_Array_Aggregate variables
4907 -- Holds the temporary aggregate value
4910 -- Holds the declaration of Tmp
4912 Aggr_Code : List_Id;
4913 Parent_Node : Node_Id;
4914 Parent_Kind : Node_Kind;
4916 -- Start of processing for Expand_Array_Aggregate
4919 -- Do not touch the special aggregates of attributes used for Asm calls
4921 if Is_RTE (Ctyp, RE_Asm_Input_Operand)
4922 or else Is_RTE (Ctyp, RE_Asm_Output_Operand)
4927 -- If the semantic analyzer has determined that aggregate N will raise
4928 -- Constraint_Error at run-time, then the aggregate node has been
4929 -- replaced with an N_Raise_Constraint_Error node and we should
4932 pragma Assert (not Raises_Constraint_Error (N));
4936 -- Check that the index range defined by aggregate bounds is
4937 -- compatible with corresponding index subtype.
4939 Index_Compatibility_Check : declare
4940 Aggr_Index_Range : Node_Id := First_Index (Typ);
4941 -- The current aggregate index range
4943 Index_Constraint : Node_Id := First_Index (Etype (Typ));
4944 -- The corresponding index constraint against which we have to
4945 -- check the above aggregate index range.
4948 Compute_Others_Present (N, 1);
4950 for J in 1 .. Aggr_Dimension loop
4951 -- There is no need to emit a check if an others choice is
4952 -- present for this array aggregate dimension since in this
4953 -- case one of N's sub-aggregates has taken its bounds from the
4954 -- context and these bounds must have been checked already. In
4955 -- addition all sub-aggregates corresponding to the same
4956 -- dimension must all have the same bounds (checked in (c) below).
4958 if not Range_Checks_Suppressed (Etype (Index_Constraint))
4959 and then not Others_Present (J)
4961 -- We don't use Checks.Apply_Range_Check here because it emits
4962 -- a spurious check. Namely it checks that the range defined by
4963 -- the aggregate bounds is non empty. But we know this already
4966 Check_Bounds (Aggr_Index_Range, Index_Constraint);
4969 -- Save the low and high bounds of the aggregate index as well as
4970 -- the index type for later use in checks (b) and (c) below.
4972 Aggr_Low (J) := Low_Bound (Aggr_Index_Range);
4973 Aggr_High (J) := High_Bound (Aggr_Index_Range);
4975 Aggr_Index_Typ (J) := Etype (Index_Constraint);
4977 Next_Index (Aggr_Index_Range);
4978 Next_Index (Index_Constraint);
4980 end Index_Compatibility_Check;
4984 -- If an others choice is present check that no aggregate index is
4985 -- outside the bounds of the index constraint.
4987 Others_Check (N, 1);
4991 -- For multidimensional arrays make sure that all subaggregates
4992 -- corresponding to the same dimension have the same bounds.
4994 if Aggr_Dimension > 1 then
4995 Check_Same_Aggr_Bounds (N, 1);
5000 -- Here we test for is packed array aggregate that we can handle at
5001 -- compile time. If so, return with transformation done. Note that we do
5002 -- this even if the aggregate is nested, because once we have done this
5003 -- processing, there is no more nested aggregate!
5005 if Packed_Array_Aggregate_Handled (N) then
5009 -- At this point we try to convert to positional form
5011 if Ekind (Current_Scope) = E_Package
5012 and then Static_Elaboration_Desired (Current_Scope)
5014 Convert_To_Positional (N, Max_Others_Replicate => 100);
5017 Convert_To_Positional (N);
5020 -- if the result is no longer an aggregate (e.g. it may be a string
5021 -- literal, or a temporary which has the needed value), then we are
5022 -- done, since there is no longer a nested aggregate.
5024 if Nkind (N) /= N_Aggregate then
5027 -- We are also done if the result is an analyzed aggregate
5028 -- This case could use more comments ???
5031 and then N /= Original_Node (N)
5036 -- If all aggregate components are compile-time known and the aggregate
5037 -- has been flattened, nothing left to do. The same occurs if the
5038 -- aggregate is used to initialize the components of an statically
5039 -- allocated dispatch table.
5041 if Compile_Time_Known_Aggregate (N)
5042 or else Is_Static_Dispatch_Table_Aggregate (N)
5044 Set_Expansion_Delayed (N, False);
5048 -- Now see if back end processing is possible
5050 if Backend_Processing_Possible (N) then
5052 -- If the aggregate is static but the constraints are not, build
5053 -- a static subtype for the aggregate, so that Gigi can place it
5054 -- in static memory. Perform an unchecked_conversion to the non-
5055 -- static type imposed by the context.
5058 Itype : constant Entity_Id := Etype (N);
5060 Needs_Type : Boolean := False;
5063 Index := First_Index (Itype);
5064 while Present (Index) loop
5065 if not Is_Static_Subtype (Etype (Index)) then
5074 Build_Constrained_Type (Positional => True);
5075 Rewrite (N, Unchecked_Convert_To (Itype, N));
5085 -- Delay expansion for nested aggregates: it will be taken care of
5086 -- when the parent aggregate is expanded.
5088 Parent_Node := Parent (N);
5089 Parent_Kind := Nkind (Parent_Node);
5091 if Parent_Kind = N_Qualified_Expression then
5092 Parent_Node := Parent (Parent_Node);
5093 Parent_Kind := Nkind (Parent_Node);
5096 if Parent_Kind = N_Aggregate
5097 or else Parent_Kind = N_Extension_Aggregate
5098 or else Parent_Kind = N_Component_Association
5099 or else (Parent_Kind = N_Object_Declaration
5100 and then Needs_Finalization (Typ))
5101 or else (Parent_Kind = N_Assignment_Statement
5102 and then Inside_Init_Proc)
5104 if Static_Array_Aggregate (N)
5105 or else Compile_Time_Known_Aggregate (N)
5107 Set_Expansion_Delayed (N, False);
5110 Set_Expansion_Delayed (N);
5117 -- Look if in place aggregate expansion is possible
5119 -- For object declarations we build the aggregate in place, unless
5120 -- the array is bit-packed or the component is controlled.
5122 -- For assignments we do the assignment in place if all the component
5123 -- associations have compile-time known values. For other cases we
5124 -- create a temporary. The analysis for safety of on-line assignment
5125 -- is delicate, i.e. we don't know how to do it fully yet ???
5127 -- For allocators we assign to the designated object in place if the
5128 -- aggregate meets the same conditions as other in-place assignments.
5129 -- In this case the aggregate may not come from source but was created
5130 -- for default initialization, e.g. with Initialize_Scalars.
5132 if Requires_Transient_Scope (Typ) then
5133 Establish_Transient_Scope
5134 (N, Sec_Stack => Has_Controlled_Component (Typ));
5137 if Has_Default_Init_Comps (N) then
5138 Maybe_In_Place_OK := False;
5140 elsif Is_Bit_Packed_Array (Typ)
5141 or else Has_Controlled_Component (Typ)
5143 Maybe_In_Place_OK := False;
5146 Maybe_In_Place_OK :=
5147 (Nkind (Parent (N)) = N_Assignment_Statement
5148 and then Comes_From_Source (N)
5149 and then In_Place_Assign_OK)
5152 (Nkind (Parent (Parent (N))) = N_Allocator
5153 and then In_Place_Assign_OK);
5156 -- If this is an array of tasks, it will be expanded into build-in-place
5157 -- assignments. Build an activation chain for the tasks now.
5159 if Has_Task (Etype (N)) then
5160 Build_Activation_Chain_Entity (N);
5163 if not Has_Default_Init_Comps (N)
5164 and then Comes_From_Source (Parent (N))
5165 and then Nkind (Parent (N)) = N_Object_Declaration
5167 Must_Slide (Etype (Defining_Identifier (Parent (N))), Typ)
5168 and then N = Expression (Parent (N))
5169 and then not Is_Bit_Packed_Array (Typ)
5170 and then not Has_Controlled_Component (Typ)
5171 and then not Has_Address_Clause (Parent (N))
5173 Tmp := Defining_Identifier (Parent (N));
5174 Set_No_Initialization (Parent (N));
5175 Set_Expression (Parent (N), Empty);
5177 -- Set the type of the entity, for use in the analysis of the
5178 -- subsequent indexed assignments. If the nominal type is not
5179 -- constrained, build a subtype from the known bounds of the
5180 -- aggregate. If the declaration has a subtype mark, use it,
5181 -- otherwise use the itype of the aggregate.
5183 if not Is_Constrained (Typ) then
5184 Build_Constrained_Type (Positional => False);
5185 elsif Is_Entity_Name (Object_Definition (Parent (N)))
5186 and then Is_Constrained (Entity (Object_Definition (Parent (N))))
5188 Set_Etype (Tmp, Entity (Object_Definition (Parent (N))));
5190 Set_Size_Known_At_Compile_Time (Typ, False);
5191 Set_Etype (Tmp, Typ);
5194 elsif Maybe_In_Place_OK
5195 and then Nkind (Parent (N)) = N_Qualified_Expression
5196 and then Nkind (Parent (Parent (N))) = N_Allocator
5198 Set_Expansion_Delayed (N);
5201 -- In the remaining cases the aggregate is the RHS of an assignment
5203 elsif Maybe_In_Place_OK
5204 and then Is_Entity_Name (Name (Parent (N)))
5206 Tmp := Entity (Name (Parent (N)));
5208 if Etype (Tmp) /= Etype (N) then
5209 Apply_Length_Check (N, Etype (Tmp));
5211 if Nkind (N) = N_Raise_Constraint_Error then
5213 -- Static error, nothing further to expand
5219 elsif Maybe_In_Place_OK
5220 and then Nkind (Name (Parent (N))) = N_Explicit_Dereference
5221 and then Is_Entity_Name (Prefix (Name (Parent (N))))
5223 Tmp := Name (Parent (N));
5225 if Etype (Tmp) /= Etype (N) then
5226 Apply_Length_Check (N, Etype (Tmp));
5229 elsif Maybe_In_Place_OK
5230 and then Nkind (Name (Parent (N))) = N_Slice
5231 and then Safe_Slice_Assignment (N)
5233 -- Safe_Slice_Assignment rewrites assignment as a loop
5239 -- In place aggregate expansion is not possible
5242 Maybe_In_Place_OK := False;
5243 Tmp := Make_Temporary (Loc, 'A', N);
5245 Make_Object_Declaration
5247 Defining_Identifier => Tmp,
5248 Object_Definition => New_Occurrence_Of (Typ, Loc));
5249 Set_No_Initialization (Tmp_Decl, True);
5251 -- If we are within a loop, the temporary will be pushed on the
5252 -- stack at each iteration. If the aggregate is the expression for an
5253 -- allocator, it will be immediately copied to the heap and can
5254 -- be reclaimed at once. We create a transient scope around the
5255 -- aggregate for this purpose.
5257 if Ekind (Current_Scope) = E_Loop
5258 and then Nkind (Parent (Parent (N))) = N_Allocator
5260 Establish_Transient_Scope (N, False);
5263 Insert_Action (N, Tmp_Decl);
5266 -- Construct and insert the aggregate code. We can safely suppress index
5267 -- checks because this code is guaranteed not to raise CE on index
5268 -- checks. However we should *not* suppress all checks.
5274 if Nkind (Tmp) = N_Defining_Identifier then
5275 Target := New_Reference_To (Tmp, Loc);
5279 if Has_Default_Init_Comps (N) then
5281 -- Ada 2005 (AI-287): This case has not been analyzed???
5283 raise Program_Error;
5286 -- Name in assignment is explicit dereference
5288 Target := New_Copy (Tmp);
5292 Build_Array_Aggr_Code (N,
5294 Index => First_Index (Typ),
5296 Scalar_Comp => Is_Scalar_Type (Ctyp));
5299 if Comes_From_Source (Tmp) then
5300 Insert_Actions_After (Parent (N), Aggr_Code);
5303 Insert_Actions (N, Aggr_Code);
5306 -- If the aggregate has been assigned in place, remove the original
5309 if Nkind (Parent (N)) = N_Assignment_Statement
5310 and then Maybe_In_Place_OK
5312 Rewrite (Parent (N), Make_Null_Statement (Loc));
5314 elsif Nkind (Parent (N)) /= N_Object_Declaration
5315 or else Tmp /= Defining_Identifier (Parent (N))
5317 Rewrite (N, New_Occurrence_Of (Tmp, Loc));
5318 Analyze_And_Resolve (N, Typ);
5320 end Expand_Array_Aggregate;
5322 ------------------------
5323 -- Expand_N_Aggregate --
5324 ------------------------
5326 procedure Expand_N_Aggregate (N : Node_Id) is
5328 if Is_Record_Type (Etype (N)) then
5329 Expand_Record_Aggregate (N);
5331 Expand_Array_Aggregate (N);
5334 when RE_Not_Available =>
5336 end Expand_N_Aggregate;
5338 ----------------------------------
5339 -- Expand_N_Extension_Aggregate --
5340 ----------------------------------
5342 -- If the ancestor part is an expression, add a component association for
5343 -- the parent field. If the type of the ancestor part is not the direct
5344 -- parent of the expected type, build recursively the needed ancestors.
5345 -- If the ancestor part is a subtype_mark, replace aggregate with a decla-
5346 -- ration for a temporary of the expected type, followed by individual
5347 -- assignments to the given components.
5349 procedure Expand_N_Extension_Aggregate (N : Node_Id) is
5350 Loc : constant Source_Ptr := Sloc (N);
5351 A : constant Node_Id := Ancestor_Part (N);
5352 Typ : constant Entity_Id := Etype (N);
5355 -- If the ancestor is a subtype mark, an init proc must be called
5356 -- on the resulting object which thus has to be materialized in
5359 if Is_Entity_Name (A) and then Is_Type (Entity (A)) then
5360 Convert_To_Assignments (N, Typ);
5362 -- The extension aggregate is transformed into a record aggregate
5363 -- of the following form (c1 and c2 are inherited components)
5365 -- (Exp with c3 => a, c4 => b)
5366 -- ==> (c1 => Exp.c1, c2 => Exp.c2, c1 => a, c2 => b)
5371 if Tagged_Type_Expansion then
5372 Expand_Record_Aggregate (N,
5375 (Node (First_Elmt (Access_Disp_Table (Typ))), Loc),
5378 -- No tag is needed in the case of a VM
5379 Expand_Record_Aggregate (N,
5385 when RE_Not_Available =>
5387 end Expand_N_Extension_Aggregate;
5389 -----------------------------
5390 -- Expand_Record_Aggregate --
5391 -----------------------------
5393 procedure Expand_Record_Aggregate
5395 Orig_Tag : Node_Id := Empty;
5396 Parent_Expr : Node_Id := Empty)
5398 Loc : constant Source_Ptr := Sloc (N);
5399 Comps : constant List_Id := Component_Associations (N);
5400 Typ : constant Entity_Id := Etype (N);
5401 Base_Typ : constant Entity_Id := Base_Type (Typ);
5403 Static_Components : Boolean := True;
5404 -- Flag to indicate whether all components are compile-time known,
5405 -- and the aggregate can be constructed statically and handled by
5408 function Component_Not_OK_For_Backend return Boolean;
5409 -- Check for presence of component which makes it impossible for the
5410 -- backend to process the aggregate, thus requiring the use of a series
5411 -- of assignment statements. Cases checked for are a nested aggregate
5412 -- needing Late_Expansion, the presence of a tagged component which may
5413 -- need tag adjustment, and a bit unaligned component reference.
5415 -- We also force expansion into assignments if a component is of a
5416 -- mutable type (including a private type with discriminants) because
5417 -- in that case the size of the component to be copied may be smaller
5418 -- than the side of the target, and there is no simple way for gigi
5419 -- to compute the size of the object to be copied.
5421 -- NOTE: This is part of the ongoing work to define precisely the
5422 -- interface between front-end and back-end handling of aggregates.
5423 -- In general it is desirable to pass aggregates as they are to gigi,
5424 -- in order to minimize elaboration code. This is one case where the
5425 -- semantics of Ada complicate the analysis and lead to anomalies in
5426 -- the gcc back-end if the aggregate is not expanded into assignments.
5428 ----------------------------------
5429 -- Component_Not_OK_For_Backend --
5430 ----------------------------------
5432 function Component_Not_OK_For_Backend return Boolean is
5442 while Present (C) loop
5443 if Nkind (Expression (C)) = N_Qualified_Expression then
5444 Expr_Q := Expression (Expression (C));
5446 Expr_Q := Expression (C);
5449 -- Return true if the aggregate has any associations for tagged
5450 -- components that may require tag adjustment.
5452 -- These are cases where the source expression may have a tag that
5453 -- could differ from the component tag (e.g., can occur for type
5454 -- conversions and formal parameters). (Tag adjustment not needed
5455 -- if VM_Target because object tags are implicit in the machine.)
5457 if Is_Tagged_Type (Etype (Expr_Q))
5458 and then (Nkind (Expr_Q) = N_Type_Conversion
5459 or else (Is_Entity_Name (Expr_Q)
5461 Ekind (Entity (Expr_Q)) in Formal_Kind))
5462 and then Tagged_Type_Expansion
5464 Static_Components := False;
5467 elsif Is_Delayed_Aggregate (Expr_Q) then
5468 Static_Components := False;
5471 elsif Possible_Bit_Aligned_Component (Expr_Q) then
5472 Static_Components := False;
5476 if Is_Scalar_Type (Etype (Expr_Q)) then
5477 if not Compile_Time_Known_Value (Expr_Q) then
5478 Static_Components := False;
5481 elsif Nkind (Expr_Q) /= N_Aggregate
5482 or else not Compile_Time_Known_Aggregate (Expr_Q)
5484 Static_Components := False;
5486 if Is_Private_Type (Etype (Expr_Q))
5487 and then Has_Discriminants (Etype (Expr_Q))
5497 end Component_Not_OK_For_Backend;
5499 -- Remaining Expand_Record_Aggregate variables
5501 Tag_Value : Node_Id;
5505 -- Start of processing for Expand_Record_Aggregate
5508 -- If the aggregate is to be assigned to an atomic variable, we
5509 -- have to prevent a piecemeal assignment even if the aggregate
5510 -- is to be expanded. We create a temporary for the aggregate, and
5511 -- assign the temporary instead, so that the back end can generate
5512 -- an atomic move for it.
5515 and then Comes_From_Source (Parent (N))
5516 and then Is_Atomic_Aggregate (N, Typ)
5520 -- No special management required for aggregates used to initialize
5521 -- statically allocated dispatch tables
5523 elsif Is_Static_Dispatch_Table_Aggregate (N) then
5527 -- Ada 2005 (AI-318-2): We need to convert to assignments if components
5528 -- are build-in-place function calls. This test could be more specific,
5529 -- but doing it for all inherently limited aggregates seems harmless.
5530 -- The assignments will turn into build-in-place function calls (see
5531 -- Make_Build_In_Place_Call_In_Assignment).
5533 if Ada_Version >= Ada_05 and then Is_Inherently_Limited_Type (Typ) then
5534 Convert_To_Assignments (N, Typ);
5536 -- Gigi doesn't handle properly temporaries of variable size
5537 -- so we generate it in the front-end
5539 elsif not Size_Known_At_Compile_Time (Typ) then
5540 Convert_To_Assignments (N, Typ);
5542 -- Temporaries for controlled aggregates need to be attached to a
5543 -- final chain in order to be properly finalized, so it has to
5544 -- be created in the front-end
5546 elsif Is_Controlled (Typ)
5547 or else Has_Controlled_Component (Base_Type (Typ))
5549 Convert_To_Assignments (N, Typ);
5551 -- Ada 2005 (AI-287): In case of default initialized components we
5552 -- convert the aggregate into assignments.
5554 elsif Has_Default_Init_Comps (N) then
5555 Convert_To_Assignments (N, Typ);
5559 elsif Component_Not_OK_For_Backend then
5560 Convert_To_Assignments (N, Typ);
5562 -- If an ancestor is private, some components are not inherited and
5563 -- we cannot expand into a record aggregate
5565 elsif Has_Private_Ancestor (Typ) then
5566 Convert_To_Assignments (N, Typ);
5568 -- ??? The following was done to compile fxacc00.ads in the ACVCs. Gigi
5569 -- is not able to handle the aggregate for Late_Request.
5571 elsif Is_Tagged_Type (Typ) and then Has_Discriminants (Typ) then
5572 Convert_To_Assignments (N, Typ);
5574 -- If the tagged types covers interface types we need to initialize all
5575 -- hidden components containing pointers to secondary dispatch tables.
5577 elsif Is_Tagged_Type (Typ) and then Has_Interfaces (Typ) then
5578 Convert_To_Assignments (N, Typ);
5580 -- If some components are mutable, the size of the aggregate component
5581 -- may be distinct from the default size of the type component, so
5582 -- we need to expand to insure that the back-end copies the proper
5583 -- size of the data.
5585 elsif Has_Mutable_Components (Typ) then
5586 Convert_To_Assignments (N, Typ);
5588 -- If the type involved has any non-bit aligned components, then we are
5589 -- not sure that the back end can handle this case correctly.
5591 elsif Type_May_Have_Bit_Aligned_Components (Typ) then
5592 Convert_To_Assignments (N, Typ);
5594 -- In all other cases, build a proper aggregate handlable by gigi
5597 if Nkind (N) = N_Aggregate then
5599 -- If the aggregate is static and can be handled by the back-end,
5600 -- nothing left to do.
5602 if Static_Components then
5603 Set_Compile_Time_Known_Aggregate (N);
5604 Set_Expansion_Delayed (N, False);
5608 -- If no discriminants, nothing special to do
5610 if not Has_Discriminants (Typ) then
5613 -- Case of discriminants present
5615 elsif Is_Derived_Type (Typ) then
5617 -- For untagged types, non-stored discriminants are replaced
5618 -- with stored discriminants, which are the ones that gigi uses
5619 -- to describe the type and its components.
5621 Generate_Aggregate_For_Derived_Type : declare
5622 Constraints : constant List_Id := New_List;
5623 First_Comp : Node_Id;
5624 Discriminant : Entity_Id;
5626 Num_Disc : Int := 0;
5627 Num_Gird : Int := 0;
5629 procedure Prepend_Stored_Values (T : Entity_Id);
5630 -- Scan the list of stored discriminants of the type, and add
5631 -- their values to the aggregate being built.
5633 ---------------------------
5634 -- Prepend_Stored_Values --
5635 ---------------------------
5637 procedure Prepend_Stored_Values (T : Entity_Id) is
5639 Discriminant := First_Stored_Discriminant (T);
5640 while Present (Discriminant) loop
5642 Make_Component_Association (Loc,
5644 New_List (New_Occurrence_Of (Discriminant, Loc)),
5648 Get_Discriminant_Value (
5651 Discriminant_Constraint (Typ))));
5653 if No (First_Comp) then
5654 Prepend_To (Component_Associations (N), New_Comp);
5656 Insert_After (First_Comp, New_Comp);
5659 First_Comp := New_Comp;
5660 Next_Stored_Discriminant (Discriminant);
5662 end Prepend_Stored_Values;
5664 -- Start of processing for Generate_Aggregate_For_Derived_Type
5667 -- Remove the associations for the discriminant of derived type
5669 First_Comp := First (Component_Associations (N));
5670 while Present (First_Comp) loop
5675 (First (Choices (Comp)))) = E_Discriminant
5678 Num_Disc := Num_Disc + 1;
5682 -- Insert stored discriminant associations in the correct
5683 -- order. If there are more stored discriminants than new
5684 -- discriminants, there is at least one new discriminant that
5685 -- constrains more than one of the stored discriminants. In
5686 -- this case we need to construct a proper subtype of the
5687 -- parent type, in order to supply values to all the
5688 -- components. Otherwise there is one-one correspondence
5689 -- between the constraints and the stored discriminants.
5691 First_Comp := Empty;
5693 Discriminant := First_Stored_Discriminant (Base_Type (Typ));
5694 while Present (Discriminant) loop
5695 Num_Gird := Num_Gird + 1;
5696 Next_Stored_Discriminant (Discriminant);
5699 -- Case of more stored discriminants than new discriminants
5701 if Num_Gird > Num_Disc then
5703 -- Create a proper subtype of the parent type, which is the
5704 -- proper implementation type for the aggregate, and convert
5705 -- it to the intended target type.
5707 Discriminant := First_Stored_Discriminant (Base_Type (Typ));
5708 while Present (Discriminant) loop
5711 Get_Discriminant_Value (
5714 Discriminant_Constraint (Typ)));
5715 Append (New_Comp, Constraints);
5716 Next_Stored_Discriminant (Discriminant);
5720 Make_Subtype_Declaration (Loc,
5721 Defining_Identifier =>
5722 Make_Defining_Identifier (Loc,
5723 New_Internal_Name ('T')),
5724 Subtype_Indication =>
5725 Make_Subtype_Indication (Loc,
5727 New_Occurrence_Of (Etype (Base_Type (Typ)), Loc),
5729 Make_Index_Or_Discriminant_Constraint
5730 (Loc, Constraints)));
5732 Insert_Action (N, Decl);
5733 Prepend_Stored_Values (Base_Type (Typ));
5735 Set_Etype (N, Defining_Identifier (Decl));
5738 Rewrite (N, Unchecked_Convert_To (Typ, N));
5741 -- Case where we do not have fewer new discriminants than
5742 -- stored discriminants, so in this case we can simply use the
5743 -- stored discriminants of the subtype.
5746 Prepend_Stored_Values (Typ);
5748 end Generate_Aggregate_For_Derived_Type;
5751 if Is_Tagged_Type (Typ) then
5753 -- The tagged case, _parent and _tag component must be created
5755 -- Reset null_present unconditionally. tagged records always have
5756 -- at least one field (the tag or the parent)
5758 Set_Null_Record_Present (N, False);
5760 -- When the current aggregate comes from the expansion of an
5761 -- extension aggregate, the parent expr is replaced by an
5762 -- aggregate formed by selected components of this expr
5764 if Present (Parent_Expr)
5765 and then Is_Empty_List (Comps)
5767 Comp := First_Component_Or_Discriminant (Typ);
5768 while Present (Comp) loop
5770 -- Skip all expander-generated components
5773 not Comes_From_Source (Original_Record_Component (Comp))
5779 Make_Selected_Component (Loc,
5781 Unchecked_Convert_To (Typ,
5782 Duplicate_Subexpr (Parent_Expr, True)),
5784 Selector_Name => New_Occurrence_Of (Comp, Loc));
5787 Make_Component_Association (Loc,
5789 New_List (New_Occurrence_Of (Comp, Loc)),
5793 Analyze_And_Resolve (New_Comp, Etype (Comp));
5796 Next_Component_Or_Discriminant (Comp);
5800 -- Compute the value for the Tag now, if the type is a root it
5801 -- will be included in the aggregate right away, otherwise it will
5802 -- be propagated to the parent aggregate
5804 if Present (Orig_Tag) then
5805 Tag_Value := Orig_Tag;
5806 elsif not Tagged_Type_Expansion then
5811 (Node (First_Elmt (Access_Disp_Table (Typ))), Loc);
5814 -- For a derived type, an aggregate for the parent is formed with
5815 -- all the inherited components.
5817 if Is_Derived_Type (Typ) then
5820 First_Comp : Node_Id;
5821 Parent_Comps : List_Id;
5822 Parent_Aggr : Node_Id;
5823 Parent_Name : Node_Id;
5826 -- Remove the inherited component association from the
5827 -- aggregate and store them in the parent aggregate
5829 First_Comp := First (Component_Associations (N));
5830 Parent_Comps := New_List;
5831 while Present (First_Comp)
5832 and then Scope (Original_Record_Component (
5833 Entity (First (Choices (First_Comp))))) /= Base_Typ
5838 Append (Comp, Parent_Comps);
5841 Parent_Aggr := Make_Aggregate (Loc,
5842 Component_Associations => Parent_Comps);
5843 Set_Etype (Parent_Aggr, Etype (Base_Type (Typ)));
5845 -- Find the _parent component
5847 Comp := First_Component (Typ);
5848 while Chars (Comp) /= Name_uParent loop
5849 Comp := Next_Component (Comp);
5852 Parent_Name := New_Occurrence_Of (Comp, Loc);
5854 -- Insert the parent aggregate
5856 Prepend_To (Component_Associations (N),
5857 Make_Component_Association (Loc,
5858 Choices => New_List (Parent_Name),
5859 Expression => Parent_Aggr));
5861 -- Expand recursively the parent propagating the right Tag
5863 Expand_Record_Aggregate (
5864 Parent_Aggr, Tag_Value, Parent_Expr);
5867 -- For a root type, the tag component is added (unless compiling
5868 -- for the VMs, where tags are implicit).
5870 elsif Tagged_Type_Expansion then
5872 Tag_Name : constant Node_Id :=
5874 (First_Tag_Component (Typ), Loc);
5875 Typ_Tag : constant Entity_Id := RTE (RE_Tag);
5876 Conv_Node : constant Node_Id :=
5877 Unchecked_Convert_To (Typ_Tag, Tag_Value);
5880 Set_Etype (Conv_Node, Typ_Tag);
5881 Prepend_To (Component_Associations (N),
5882 Make_Component_Association (Loc,
5883 Choices => New_List (Tag_Name),
5884 Expression => Conv_Node));
5890 end Expand_Record_Aggregate;
5892 ----------------------------
5893 -- Has_Default_Init_Comps --
5894 ----------------------------
5896 function Has_Default_Init_Comps (N : Node_Id) return Boolean is
5897 Comps : constant List_Id := Component_Associations (N);
5901 pragma Assert (Nkind_In (N, N_Aggregate, N_Extension_Aggregate));
5907 if Has_Self_Reference (N) then
5911 -- Check if any direct component has default initialized components
5914 while Present (C) loop
5915 if Box_Present (C) then
5922 -- Recursive call in case of aggregate expression
5925 while Present (C) loop
5926 Expr := Expression (C);
5930 Nkind_In (Expr, N_Aggregate, N_Extension_Aggregate)
5931 and then Has_Default_Init_Comps (Expr)
5940 end Has_Default_Init_Comps;
5942 --------------------------
5943 -- Is_Delayed_Aggregate --
5944 --------------------------
5946 function Is_Delayed_Aggregate (N : Node_Id) return Boolean is
5947 Node : Node_Id := N;
5948 Kind : Node_Kind := Nkind (Node);
5951 if Kind = N_Qualified_Expression then
5952 Node := Expression (Node);
5953 Kind := Nkind (Node);
5956 if Kind /= N_Aggregate and then Kind /= N_Extension_Aggregate then
5959 return Expansion_Delayed (Node);
5961 end Is_Delayed_Aggregate;
5963 ----------------------------------------
5964 -- Is_Static_Dispatch_Table_Aggregate --
5965 ----------------------------------------
5967 function Is_Static_Dispatch_Table_Aggregate (N : Node_Id) return Boolean is
5968 Typ : constant Entity_Id := Base_Type (Etype (N));
5971 return Static_Dispatch_Tables
5972 and then Tagged_Type_Expansion
5973 and then RTU_Loaded (Ada_Tags)
5975 -- Avoid circularity when rebuilding the compiler
5977 and then Cunit_Entity (Get_Source_Unit (N)) /= RTU_Entity (Ada_Tags)
5978 and then (Typ = RTE (RE_Dispatch_Table_Wrapper)
5980 Typ = RTE (RE_Address_Array)
5982 Typ = RTE (RE_Type_Specific_Data)
5984 Typ = RTE (RE_Tag_Table)
5986 (RTE_Available (RE_Interface_Data)
5987 and then Typ = RTE (RE_Interface_Data))
5989 (RTE_Available (RE_Interfaces_Array)
5990 and then Typ = RTE (RE_Interfaces_Array))
5992 (RTE_Available (RE_Interface_Data_Element)
5993 and then Typ = RTE (RE_Interface_Data_Element)));
5994 end Is_Static_Dispatch_Table_Aggregate;
5996 --------------------
5997 -- Late_Expansion --
5998 --------------------
6000 function Late_Expansion
6004 Flist : Node_Id := Empty;
6005 Obj : Entity_Id := Empty) return List_Id
6008 if Is_Record_Type (Etype (N)) then
6009 return Build_Record_Aggr_Code (N, Typ, Target, Flist, Obj);
6011 else pragma Assert (Is_Array_Type (Etype (N)));
6013 Build_Array_Aggr_Code
6015 Ctype => Component_Type (Etype (N)),
6016 Index => First_Index (Typ),
6018 Scalar_Comp => Is_Scalar_Type (Component_Type (Typ)),
6024 ----------------------------------
6025 -- Make_OK_Assignment_Statement --
6026 ----------------------------------
6028 function Make_OK_Assignment_Statement
6031 Expression : Node_Id) return Node_Id
6034 Set_Assignment_OK (Name);
6036 return Make_Assignment_Statement (Sloc, Name, Expression);
6037 end Make_OK_Assignment_Statement;
6039 -----------------------
6040 -- Number_Of_Choices --
6041 -----------------------
6043 function Number_Of_Choices (N : Node_Id) return Nat is
6047 Nb_Choices : Nat := 0;
6050 if Present (Expressions (N)) then
6054 Assoc := First (Component_Associations (N));
6055 while Present (Assoc) loop
6056 Choice := First (Choices (Assoc));
6057 while Present (Choice) loop
6058 if Nkind (Choice) /= N_Others_Choice then
6059 Nb_Choices := Nb_Choices + 1;
6069 end Number_Of_Choices;
6071 ------------------------------------
6072 -- Packed_Array_Aggregate_Handled --
6073 ------------------------------------
6075 -- The current version of this procedure will handle at compile time
6076 -- any array aggregate that meets these conditions:
6078 -- One dimensional, bit packed
6079 -- Underlying packed type is modular type
6080 -- Bounds are within 32-bit Int range
6081 -- All bounds and values are static
6083 function Packed_Array_Aggregate_Handled (N : Node_Id) return Boolean is
6084 Loc : constant Source_Ptr := Sloc (N);
6085 Typ : constant Entity_Id := Etype (N);
6086 Ctyp : constant Entity_Id := Component_Type (Typ);
6088 Not_Handled : exception;
6089 -- Exception raised if this aggregate cannot be handled
6092 -- For now, handle only one dimensional bit packed arrays
6094 if not Is_Bit_Packed_Array (Typ)
6095 or else Number_Dimensions (Typ) > 1
6096 or else not Is_Modular_Integer_Type (Packed_Array_Type (Typ))
6101 if not Is_Scalar_Type (Component_Type (Typ))
6102 and then Has_Non_Standard_Rep (Component_Type (Typ))
6108 Csiz : constant Nat := UI_To_Int (Component_Size (Typ));
6112 -- Bounds of index type
6116 -- Values of bounds if compile time known
6118 function Get_Component_Val (N : Node_Id) return Uint;
6119 -- Given a expression value N of the component type Ctyp, returns a
6120 -- value of Csiz (component size) bits representing this value. If
6121 -- the value is non-static or any other reason exists why the value
6122 -- cannot be returned, then Not_Handled is raised.
6124 -----------------------
6125 -- Get_Component_Val --
6126 -----------------------
6128 function Get_Component_Val (N : Node_Id) return Uint is
6132 -- We have to analyze the expression here before doing any further
6133 -- processing here. The analysis of such expressions is deferred
6134 -- till expansion to prevent some problems of premature analysis.
6136 Analyze_And_Resolve (N, Ctyp);
6138 -- Must have a compile time value. String literals have to be
6139 -- converted into temporaries as well, because they cannot easily
6140 -- be converted into their bit representation.
6142 if not Compile_Time_Known_Value (N)
6143 or else Nkind (N) = N_String_Literal
6148 Val := Expr_Rep_Value (N);
6150 -- Adjust for bias, and strip proper number of bits
6152 if Has_Biased_Representation (Ctyp) then
6153 Val := Val - Expr_Value (Type_Low_Bound (Ctyp));
6156 return Val mod Uint_2 ** Csiz;
6157 end Get_Component_Val;
6159 -- Here we know we have a one dimensional bit packed array
6162 Get_Index_Bounds (First_Index (Typ), Lo, Hi);
6164 -- Cannot do anything if bounds are dynamic
6166 if not Compile_Time_Known_Value (Lo)
6168 not Compile_Time_Known_Value (Hi)
6173 -- Or are silly out of range of int bounds
6175 Lob := Expr_Value (Lo);
6176 Hib := Expr_Value (Hi);
6178 if not UI_Is_In_Int_Range (Lob)
6180 not UI_Is_In_Int_Range (Hib)
6185 -- At this stage we have a suitable aggregate for handling at compile
6186 -- time (the only remaining checks are that the values of expressions
6187 -- in the aggregate are compile time known (check is performed by
6188 -- Get_Component_Val), and that any subtypes or ranges are statically
6191 -- If the aggregate is not fully positional at this stage, then
6192 -- convert it to positional form. Either this will fail, in which
6193 -- case we can do nothing, or it will succeed, in which case we have
6194 -- succeeded in handling the aggregate, or it will stay an aggregate,
6195 -- in which case we have failed to handle this case.
6197 if Present (Component_Associations (N)) then
6198 Convert_To_Positional
6199 (N, Max_Others_Replicate => 64, Handle_Bit_Packed => True);
6200 return Nkind (N) /= N_Aggregate;
6203 -- Otherwise we are all positional, so convert to proper value
6206 Lov : constant Int := UI_To_Int (Lob);
6207 Hiv : constant Int := UI_To_Int (Hib);
6209 Len : constant Nat := Int'Max (0, Hiv - Lov + 1);
6210 -- The length of the array (number of elements)
6212 Aggregate_Val : Uint;
6213 -- Value of aggregate. The value is set in the low order bits of
6214 -- this value. For the little-endian case, the values are stored
6215 -- from low-order to high-order and for the big-endian case the
6216 -- values are stored from high-order to low-order. Note that gigi
6217 -- will take care of the conversions to left justify the value in
6218 -- the big endian case (because of left justified modular type
6219 -- processing), so we do not have to worry about that here.
6222 -- Integer literal for resulting constructed value
6225 -- Shift count from low order for next value
6228 -- Shift increment for loop
6231 -- Next expression from positional parameters of aggregate
6234 -- For little endian, we fill up the low order bits of the target
6235 -- value. For big endian we fill up the high order bits of the
6236 -- target value (which is a left justified modular value).
6238 if Bytes_Big_Endian xor Debug_Flag_8 then
6239 Shift := Csiz * (Len - 1);
6246 -- Loop to set the values
6249 Aggregate_Val := Uint_0;
6251 Expr := First (Expressions (N));
6252 Aggregate_Val := Get_Component_Val (Expr) * Uint_2 ** Shift;
6254 for J in 2 .. Len loop
6255 Shift := Shift + Incr;
6258 Aggregate_Val + Get_Component_Val (Expr) * Uint_2 ** Shift;
6262 -- Now we can rewrite with the proper value
6265 Make_Integer_Literal (Loc,
6266 Intval => Aggregate_Val);
6267 Set_Print_In_Hex (Lit);
6269 -- Construct the expression using this literal. Note that it is
6270 -- important to qualify the literal with its proper modular type
6271 -- since universal integer does not have the required range and
6272 -- also this is a left justified modular type, which is important
6273 -- in the big-endian case.
6276 Unchecked_Convert_To (Typ,
6277 Make_Qualified_Expression (Loc,
6279 New_Occurrence_Of (Packed_Array_Type (Typ), Loc),
6280 Expression => Lit)));
6282 Analyze_And_Resolve (N, Typ);
6290 end Packed_Array_Aggregate_Handled;
6292 ----------------------------
6293 -- Has_Mutable_Components --
6294 ----------------------------
6296 function Has_Mutable_Components (Typ : Entity_Id) return Boolean is
6300 Comp := First_Component (Typ);
6301 while Present (Comp) loop
6302 if Is_Record_Type (Etype (Comp))
6303 and then Has_Discriminants (Etype (Comp))
6304 and then not Is_Constrained (Etype (Comp))
6309 Next_Component (Comp);
6313 end Has_Mutable_Components;
6315 ------------------------------
6316 -- Initialize_Discriminants --
6317 ------------------------------
6319 procedure Initialize_Discriminants (N : Node_Id; Typ : Entity_Id) is
6320 Loc : constant Source_Ptr := Sloc (N);
6321 Bas : constant Entity_Id := Base_Type (Typ);
6322 Par : constant Entity_Id := Etype (Bas);
6323 Decl : constant Node_Id := Parent (Par);
6327 if Is_Tagged_Type (Bas)
6328 and then Is_Derived_Type (Bas)
6329 and then Has_Discriminants (Par)
6330 and then Has_Discriminants (Bas)
6331 and then Number_Discriminants (Bas) /= Number_Discriminants (Par)
6332 and then Nkind (Decl) = N_Full_Type_Declaration
6333 and then Nkind (Type_Definition (Decl)) = N_Record_Definition
6335 (Variant_Part (Component_List (Type_Definition (Decl))))
6336 and then Nkind (N) /= N_Extension_Aggregate
6339 -- Call init proc to set discriminants.
6340 -- There should eventually be a special procedure for this ???
6342 Ref := New_Reference_To (Defining_Identifier (N), Loc);
6343 Insert_Actions_After (N,
6344 Build_Initialization_Call (Sloc (N), Ref, Typ));
6346 end Initialize_Discriminants;
6353 (Obj_Type : Entity_Id;
6354 Typ : Entity_Id) return Boolean
6356 L1, L2, H1, H2 : Node_Id;
6358 -- No sliding if the type of the object is not established yet, if it is
6359 -- an unconstrained type whose actual subtype comes from the aggregate,
6360 -- or if the two types are identical.
6362 if not Is_Array_Type (Obj_Type) then
6365 elsif not Is_Constrained (Obj_Type) then
6368 elsif Typ = Obj_Type then
6372 -- Sliding can only occur along the first dimension
6374 Get_Index_Bounds (First_Index (Typ), L1, H1);
6375 Get_Index_Bounds (First_Index (Obj_Type), L2, H2);
6377 if not Is_Static_Expression (L1)
6378 or else not Is_Static_Expression (L2)
6379 or else not Is_Static_Expression (H1)
6380 or else not Is_Static_Expression (H2)
6384 return Expr_Value (L1) /= Expr_Value (L2)
6385 or else Expr_Value (H1) /= Expr_Value (H2);
6390 ---------------------------
6391 -- Safe_Slice_Assignment --
6392 ---------------------------
6394 function Safe_Slice_Assignment (N : Node_Id) return Boolean is
6395 Loc : constant Source_Ptr := Sloc (Parent (N));
6396 Pref : constant Node_Id := Prefix (Name (Parent (N)));
6397 Range_Node : constant Node_Id := Discrete_Range (Name (Parent (N)));
6405 -- Generate: for J in Range loop Pref (J) := Expr; end loop;
6407 if Comes_From_Source (N)
6408 and then No (Expressions (N))
6409 and then Nkind (First (Choices (First (Component_Associations (N)))))
6413 Expression (First (Component_Associations (N)));
6414 L_J := Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
6417 Make_Iteration_Scheme (Loc,
6418 Loop_Parameter_Specification =>
6419 Make_Loop_Parameter_Specification
6421 Defining_Identifier => L_J,
6422 Discrete_Subtype_Definition => Relocate_Node (Range_Node)));
6425 Make_Assignment_Statement (Loc,
6427 Make_Indexed_Component (Loc,
6428 Prefix => Relocate_Node (Pref),
6429 Expressions => New_List (New_Occurrence_Of (L_J, Loc))),
6430 Expression => Relocate_Node (Expr));
6432 -- Construct the final loop
6435 Make_Implicit_Loop_Statement
6436 (Node => Parent (N),
6437 Identifier => Empty,
6438 Iteration_Scheme => L_Iter,
6439 Statements => New_List (L_Body));
6441 -- Set type of aggregate to be type of lhs in assignment,
6442 -- to suppress redundant length checks.
6444 Set_Etype (N, Etype (Name (Parent (N))));
6446 Rewrite (Parent (N), Stat);
6447 Analyze (Parent (N));
6453 end Safe_Slice_Assignment;
6455 ---------------------
6456 -- Sort_Case_Table --
6457 ---------------------
6459 procedure Sort_Case_Table (Case_Table : in out Case_Table_Type) is
6460 L : constant Int := Case_Table'First;
6461 U : constant Int := Case_Table'Last;
6469 T := Case_Table (K + 1);
6473 and then Expr_Value (Case_Table (J - 1).Choice_Lo) >
6474 Expr_Value (T.Choice_Lo)
6476 Case_Table (J) := Case_Table (J - 1);
6480 Case_Table (J) := T;
6483 end Sort_Case_Table;
6485 ----------------------------
6486 -- Static_Array_Aggregate --
6487 ----------------------------
6489 function Static_Array_Aggregate (N : Node_Id) return Boolean is
6490 Bounds : constant Node_Id := Aggregate_Bounds (N);
6492 Typ : constant Entity_Id := Etype (N);
6493 Comp_Type : constant Entity_Id := Component_Type (Typ);
6500 if Is_Tagged_Type (Typ)
6501 or else Is_Controlled (Typ)
6502 or else Is_Packed (Typ)
6508 and then Nkind (Bounds) = N_Range
6509 and then Nkind (Low_Bound (Bounds)) = N_Integer_Literal
6510 and then Nkind (High_Bound (Bounds)) = N_Integer_Literal
6512 Lo := Low_Bound (Bounds);
6513 Hi := High_Bound (Bounds);
6515 if No (Component_Associations (N)) then
6517 -- Verify that all components are static integers
6519 Expr := First (Expressions (N));
6520 while Present (Expr) loop
6521 if Nkind (Expr) /= N_Integer_Literal then
6531 -- We allow only a single named association, either a static
6532 -- range or an others_clause, with a static expression.
6534 Expr := First (Component_Associations (N));
6536 if Present (Expressions (N)) then
6539 elsif Present (Next (Expr)) then
6542 elsif Present (Next (First (Choices (Expr)))) then
6546 -- The aggregate is static if all components are literals,
6547 -- or else all its components are static aggregates for the
6548 -- component type. We also limit the size of a static aggregate
6549 -- to prevent runaway static expressions.
6551 if Is_Array_Type (Comp_Type)
6552 or else Is_Record_Type (Comp_Type)
6554 if Nkind (Expression (Expr)) /= N_Aggregate
6556 not Compile_Time_Known_Aggregate (Expression (Expr))
6561 elsif Nkind (Expression (Expr)) /= N_Integer_Literal then
6564 elsif not Aggr_Size_OK (N, Typ) then
6568 -- Create a positional aggregate with the right number of
6569 -- copies of the expression.
6571 Agg := Make_Aggregate (Sloc (N), New_List, No_List);
6573 for I in UI_To_Int (Intval (Lo)) .. UI_To_Int (Intval (Hi))
6576 (Expressions (Agg), New_Copy (Expression (Expr)));
6578 -- The copied expression must be analyzed and resolved.
6579 -- Besides setting the type, this ensures that static
6580 -- expressions are appropriately marked as such.
6583 (Last (Expressions (Agg)), Component_Type (Typ));
6586 Set_Aggregate_Bounds (Agg, Bounds);
6587 Set_Etype (Agg, Typ);
6590 Set_Compile_Time_Known_Aggregate (N);
6599 end Static_Array_Aggregate;