1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2011, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Checks; use Checks;
28 with Einfo; use Einfo;
29 with Elists; use Elists;
30 with Errout; use Errout;
31 with Expander; use Expander;
32 with Exp_Tss; use Exp_Tss;
33 with Exp_Util; use Exp_Util;
34 with Freeze; use Freeze;
35 with Itypes; use Itypes;
37 with Lib.Xref; use Lib.Xref;
38 with Namet; use Namet;
39 with Namet.Sp; use Namet.Sp;
40 with Nmake; use Nmake;
41 with Nlists; use Nlists;
43 with Restrict; use Restrict;
45 with Sem_Aux; use Sem_Aux;
46 with Sem_Cat; use Sem_Cat;
47 with Sem_Ch3; use Sem_Ch3;
48 with Sem_Ch8; use Sem_Ch8;
49 with Sem_Ch13; use Sem_Ch13;
50 with Sem_Eval; use Sem_Eval;
51 with Sem_Res; use Sem_Res;
52 with Sem_Util; use Sem_Util;
53 with Sem_Type; use Sem_Type;
54 with Sem_Warn; use Sem_Warn;
55 with Sinfo; use Sinfo;
56 with Snames; use Snames;
57 with Stringt; use Stringt;
58 with Stand; use Stand;
59 with Style; use Style;
60 with Targparm; use Targparm;
61 with Tbuild; use Tbuild;
62 with Uintp; use Uintp;
64 package body Sem_Aggr is
66 type Case_Bounds is record
69 Choice_Node : Node_Id;
72 type Case_Table_Type is array (Nat range <>) of Case_Bounds;
73 -- Table type used by Check_Case_Choices procedure
75 -----------------------
76 -- Local Subprograms --
77 -----------------------
79 procedure Sort_Case_Table (Case_Table : in out Case_Table_Type);
80 -- Sort the Case Table using the Lower Bound of each Choice as the key.
81 -- A simple insertion sort is used since the number of choices in a case
82 -- statement of variant part will usually be small and probably in near
85 procedure Check_Can_Never_Be_Null (Typ : Entity_Id; Expr : Node_Id);
86 -- Ada 2005 (AI-231): Check bad usage of null for a component for which
87 -- null exclusion (NOT NULL) is specified. Typ can be an E_Array_Type for
88 -- the array case (the component type of the array will be used) or an
89 -- E_Component/E_Discriminant entity in the record case, in which case the
90 -- type of the component will be used for the test. If Typ is any other
91 -- kind of entity, the call is ignored. Expr is the component node in the
92 -- aggregate which is known to have a null value. A warning message will be
93 -- issued if the component is null excluding.
95 -- It would be better to pass the proper type for Typ ???
97 procedure Check_Expr_OK_In_Limited_Aggregate (Expr : Node_Id);
98 -- Check that Expr is either not limited or else is one of the cases of
99 -- expressions allowed for a limited component association (namely, an
100 -- aggregate, function call, or <> notation). Report error for violations.
102 procedure Check_Qualified_Aggregate (Level : Nat; Expr : Node_Id);
103 -- Given aggregate Expr, check that sub-aggregates of Expr that are nested
104 -- at Level are qualified. If Level = 0, this applies to Expr directly.
105 -- Only issue errors in formal verification mode.
107 function Is_Top_Level_Aggregate (Expr : Node_Id) return Boolean;
108 -- Return True of Expr is an aggregate not contained directly in another
111 ------------------------------------------------------
112 -- Subprograms used for RECORD AGGREGATE Processing --
113 ------------------------------------------------------
115 procedure Resolve_Record_Aggregate (N : Node_Id; Typ : Entity_Id);
116 -- This procedure performs all the semantic checks required for record
117 -- aggregates. Note that for aggregates analysis and resolution go
118 -- hand in hand. Aggregate analysis has been delayed up to here and
119 -- it is done while resolving the aggregate.
121 -- N is the N_Aggregate node.
122 -- Typ is the record type for the aggregate resolution
124 -- While performing the semantic checks, this procedure builds a new
125 -- Component_Association_List where each record field appears alone in a
126 -- Component_Choice_List along with its corresponding expression. The
127 -- record fields in the Component_Association_List appear in the same order
128 -- in which they appear in the record type Typ.
130 -- Once this new Component_Association_List is built and all the semantic
131 -- checks performed, the original aggregate subtree is replaced with the
132 -- new named record aggregate just built. Note that subtree substitution is
133 -- performed with Rewrite so as to be able to retrieve the original
136 -- The aggregate subtree manipulation performed by Resolve_Record_Aggregate
137 -- yields the aggregate format expected by Gigi. Typically, this kind of
138 -- tree manipulations are done in the expander. However, because the
139 -- semantic checks that need to be performed on record aggregates really go
140 -- hand in hand with the record aggregate normalization, the aggregate
141 -- subtree transformation is performed during resolution rather than
142 -- expansion. Had we decided otherwise we would have had to duplicate most
143 -- of the code in the expansion procedure Expand_Record_Aggregate. Note,
144 -- however, that all the expansion concerning aggregates for tagged records
145 -- is done in Expand_Record_Aggregate.
147 -- The algorithm of Resolve_Record_Aggregate proceeds as follows:
149 -- 1. Make sure that the record type against which the record aggregate
150 -- has to be resolved is not abstract. Furthermore if the type is a
151 -- null aggregate make sure the input aggregate N is also null.
153 -- 2. Verify that the structure of the aggregate is that of a record
154 -- aggregate. Specifically, look for component associations and ensure
155 -- that each choice list only has identifiers or the N_Others_Choice
156 -- node. Also make sure that if present, the N_Others_Choice occurs
157 -- last and by itself.
159 -- 3. If Typ contains discriminants, the values for each discriminant is
160 -- looked for. If the record type Typ has variants, we check that the
161 -- expressions corresponding to each discriminant ruling the (possibly
162 -- nested) variant parts of Typ, are static. This allows us to determine
163 -- the variant parts to which the rest of the aggregate must conform.
164 -- The names of discriminants with their values are saved in a new
165 -- association list, New_Assoc_List which is later augmented with the
166 -- names and values of the remaining components in the record type.
168 -- During this phase we also make sure that every discriminant is
169 -- assigned exactly one value. Note that when several values for a given
170 -- discriminant are found, semantic processing continues looking for
171 -- further errors. In this case it's the first discriminant value found
172 -- which we will be recorded.
174 -- IMPORTANT NOTE: For derived tagged types this procedure expects
175 -- First_Discriminant and Next_Discriminant to give the correct list
176 -- of discriminants, in the correct order.
178 -- 4. After all the discriminant values have been gathered, we can set the
179 -- Etype of the record aggregate. If Typ contains no discriminants this
180 -- is straightforward: the Etype of N is just Typ, otherwise a new
181 -- implicit constrained subtype of Typ is built to be the Etype of N.
183 -- 5. Gather the remaining record components according to the discriminant
184 -- values. This involves recursively traversing the record type
185 -- structure to see what variants are selected by the given discriminant
186 -- values. This processing is a little more convoluted if Typ is a
187 -- derived tagged types since we need to retrieve the record structure
188 -- of all the ancestors of Typ.
190 -- 6. After gathering the record components we look for their values in the
191 -- record aggregate and emit appropriate error messages should we not
192 -- find such values or should they be duplicated.
194 -- 7. We then make sure no illegal component names appear in the record
195 -- aggregate and make sure that the type of the record components
196 -- appearing in a same choice list is the same. Finally we ensure that
197 -- the others choice, if present, is used to provide the value of at
198 -- least a record component.
200 -- 8. The original aggregate node is replaced with the new named aggregate
201 -- built in steps 3 through 6, as explained earlier.
203 -- Given the complexity of record aggregate resolution, the primary goal of
204 -- this routine is clarity and simplicity rather than execution and storage
205 -- efficiency. If there are only positional components in the aggregate the
206 -- running time is linear. If there are associations the running time is
207 -- still linear as long as the order of the associations is not too far off
208 -- the order of the components in the record type. If this is not the case
209 -- the running time is at worst quadratic in the size of the association
212 procedure Check_Misspelled_Component
213 (Elements : Elist_Id;
214 Component : Node_Id);
215 -- Give possible misspelling diagnostic if Component is likely to be a
216 -- misspelling of one of the components of the Assoc_List. This is called
217 -- by Resolve_Aggr_Expr after producing an invalid component error message.
219 procedure Check_Static_Discriminated_Subtype (T : Entity_Id; V : Node_Id);
220 -- An optimization: determine whether a discriminated subtype has a static
221 -- constraint, and contains array components whose length is also static,
222 -- either because they are constrained by the discriminant, or because the
223 -- original component bounds are static.
225 -----------------------------------------------------
226 -- Subprograms used for ARRAY AGGREGATE Processing --
227 -----------------------------------------------------
229 function Resolve_Array_Aggregate
232 Index_Constr : Node_Id;
233 Component_Typ : Entity_Id;
234 Others_Allowed : Boolean) return Boolean;
235 -- This procedure performs the semantic checks for an array aggregate.
236 -- True is returned if the aggregate resolution succeeds.
238 -- The procedure works by recursively checking each nested aggregate.
239 -- Specifically, after checking a sub-aggregate nested at the i-th level
240 -- we recursively check all the subaggregates at the i+1-st level (if any).
241 -- Note that for aggregates analysis and resolution go hand in hand.
242 -- Aggregate analysis has been delayed up to here and it is done while
243 -- resolving the aggregate.
245 -- N is the current N_Aggregate node to be checked.
247 -- Index is the index node corresponding to the array sub-aggregate that
248 -- we are currently checking (RM 4.3.3 (8)). Its Etype is the
249 -- corresponding index type (or subtype).
251 -- Index_Constr is the node giving the applicable index constraint if
252 -- any (RM 4.3.3 (10)). It "is a constraint provided by certain
253 -- contexts [...] that can be used to determine the bounds of the array
254 -- value specified by the aggregate". If Others_Allowed below is False
255 -- there is no applicable index constraint and this node is set to Index.
257 -- Component_Typ is the array component type.
259 -- Others_Allowed indicates whether an others choice is allowed
260 -- in the context where the top-level aggregate appeared.
262 -- The algorithm of Resolve_Array_Aggregate proceeds as follows:
264 -- 1. Make sure that the others choice, if present, is by itself and
265 -- appears last in the sub-aggregate. Check that we do not have
266 -- positional and named components in the array sub-aggregate (unless
267 -- the named association is an others choice). Finally if an others
268 -- choice is present, make sure it is allowed in the aggregate context.
270 -- 2. If the array sub-aggregate contains discrete_choices:
272 -- (A) Verify their validity. Specifically verify that:
274 -- (a) If a null range is present it must be the only possible
275 -- choice in the array aggregate.
277 -- (b) Ditto for a non static range.
279 -- (c) Ditto for a non static expression.
281 -- In addition this step analyzes and resolves each discrete_choice,
282 -- making sure that its type is the type of the corresponding Index.
283 -- If we are not at the lowest array aggregate level (in the case of
284 -- multi-dimensional aggregates) then invoke Resolve_Array_Aggregate
285 -- recursively on each component expression. Otherwise, resolve the
286 -- bottom level component expressions against the expected component
287 -- type ONLY IF the component corresponds to a single discrete choice
288 -- which is not an others choice (to see why read the DELAYED
289 -- COMPONENT RESOLUTION below).
291 -- (B) Determine the bounds of the sub-aggregate and lowest and
292 -- highest choice values.
294 -- 3. For positional aggregates:
296 -- (A) Loop over the component expressions either recursively invoking
297 -- Resolve_Array_Aggregate on each of these for multi-dimensional
298 -- array aggregates or resolving the bottom level component
299 -- expressions against the expected component type.
301 -- (B) Determine the bounds of the positional sub-aggregates.
303 -- 4. Try to determine statically whether the evaluation of the array
304 -- sub-aggregate raises Constraint_Error. If yes emit proper
305 -- warnings. The precise checks are the following:
307 -- (A) Check that the index range defined by aggregate bounds is
308 -- compatible with corresponding index subtype.
309 -- We also check against the base type. In fact it could be that
310 -- Low/High bounds of the base type are static whereas those of
311 -- the index subtype are not. Thus if we can statically catch
312 -- a problem with respect to the base type we are guaranteed
313 -- that the same problem will arise with the index subtype
315 -- (B) If we are dealing with a named aggregate containing an others
316 -- choice and at least one discrete choice then make sure the range
317 -- specified by the discrete choices does not overflow the
318 -- aggregate bounds. We also check against the index type and base
319 -- type bounds for the same reasons given in (A).
321 -- (C) If we are dealing with a positional aggregate with an others
322 -- choice make sure the number of positional elements specified
323 -- does not overflow the aggregate bounds. We also check against
324 -- the index type and base type bounds as mentioned in (A).
326 -- Finally construct an N_Range node giving the sub-aggregate bounds.
327 -- Set the Aggregate_Bounds field of the sub-aggregate to be this
328 -- N_Range. The routine Array_Aggr_Subtype below uses such N_Ranges
329 -- to build the appropriate aggregate subtype. Aggregate_Bounds
330 -- information is needed during expansion.
332 -- DELAYED COMPONENT RESOLUTION: The resolution of bottom level component
333 -- expressions in an array aggregate may call Duplicate_Subexpr or some
334 -- other routine that inserts code just outside the outermost aggregate.
335 -- If the array aggregate contains discrete choices or an others choice,
336 -- this may be wrong. Consider for instance the following example.
338 -- type Rec is record
342 -- type Acc_Rec is access Rec;
343 -- Arr : array (1..3) of Acc_Rec := (1 .. 3 => new Rec);
345 -- Then the transformation of "new Rec" that occurs during resolution
346 -- entails the following code modifications
348 -- P7b : constant Acc_Rec := new Rec;
350 -- Arr : array (1..3) of Acc_Rec := (1 .. 3 => P7b);
352 -- This code transformation is clearly wrong, since we need to call
353 -- "new Rec" for each of the 3 array elements. To avoid this problem we
354 -- delay resolution of the components of non positional array aggregates
355 -- to the expansion phase. As an optimization, if the discrete choice
356 -- specifies a single value we do not delay resolution.
358 function Array_Aggr_Subtype (N : Node_Id; Typ : Node_Id) return Entity_Id;
359 -- This routine returns the type or subtype of an array aggregate.
361 -- N is the array aggregate node whose type we return.
363 -- Typ is the context type in which N occurs.
365 -- This routine creates an implicit array subtype whose bounds are
366 -- those defined by the aggregate. When this routine is invoked
367 -- Resolve_Array_Aggregate has already processed aggregate N. Thus the
368 -- Aggregate_Bounds of each sub-aggregate, is an N_Range node giving the
369 -- sub-aggregate bounds. When building the aggregate itype, this function
370 -- traverses the array aggregate N collecting such Aggregate_Bounds and
371 -- constructs the proper array aggregate itype.
373 -- Note that in the case of multidimensional aggregates each inner
374 -- sub-aggregate corresponding to a given array dimension, may provide a
375 -- different bounds. If it is possible to determine statically that
376 -- some sub-aggregates corresponding to the same index do not have the
377 -- same bounds, then a warning is emitted. If such check is not possible
378 -- statically (because some sub-aggregate bounds are dynamic expressions)
379 -- then this job is left to the expander. In all cases the particular
380 -- bounds that this function will chose for a given dimension is the first
381 -- N_Range node for a sub-aggregate corresponding to that dimension.
383 -- Note that the Raises_Constraint_Error flag of an array aggregate
384 -- whose evaluation is determined to raise CE by Resolve_Array_Aggregate,
385 -- is set in Resolve_Array_Aggregate but the aggregate is not
386 -- immediately replaced with a raise CE. In fact, Array_Aggr_Subtype must
387 -- first construct the proper itype for the aggregate (Gigi needs
388 -- this). After constructing the proper itype we will eventually replace
389 -- the top-level aggregate with a raise CE (done in Resolve_Aggregate).
390 -- Of course in cases such as:
392 -- type Arr is array (integer range <>) of Integer;
393 -- A : Arr := (positive range -1 .. 2 => 0);
395 -- The bounds of the aggregate itype are cooked up to look reasonable
396 -- (in this particular case the bounds will be 1 .. 2).
398 procedure Aggregate_Constraint_Checks
400 Check_Typ : Entity_Id);
401 -- Checks expression Exp against subtype Check_Typ. If Exp is an
402 -- aggregate and Check_Typ a constrained record type with discriminants,
403 -- we generate the appropriate discriminant checks. If Exp is an array
404 -- aggregate then emit the appropriate length checks. If Exp is a scalar
405 -- type, or a string literal, Exp is changed into Check_Typ'(Exp) to
406 -- ensure that range checks are performed at run time.
408 procedure Make_String_Into_Aggregate (N : Node_Id);
409 -- A string literal can appear in a context in which a one dimensional
410 -- array of characters is expected. This procedure simply rewrites the
411 -- string as an aggregate, prior to resolution.
413 ---------------------------------
414 -- Aggregate_Constraint_Checks --
415 ---------------------------------
417 procedure Aggregate_Constraint_Checks
419 Check_Typ : Entity_Id)
421 Exp_Typ : constant Entity_Id := Etype (Exp);
424 if Raises_Constraint_Error (Exp) then
428 -- Ada 2005 (AI-230): Generate a conversion to an anonymous access
429 -- component's type to force the appropriate accessibility checks.
431 -- Ada 2005 (AI-231): Generate conversion to the null-excluding
432 -- type to force the corresponding run-time check
434 if Is_Access_Type (Check_Typ)
435 and then ((Is_Local_Anonymous_Access (Check_Typ))
436 or else (Can_Never_Be_Null (Check_Typ)
437 and then not Can_Never_Be_Null (Exp_Typ)))
439 Rewrite (Exp, Convert_To (Check_Typ, Relocate_Node (Exp)));
440 Analyze_And_Resolve (Exp, Check_Typ);
441 Check_Unset_Reference (Exp);
444 -- This is really expansion activity, so make sure that expansion
445 -- is on and is allowed.
447 if not Expander_Active or else In_Spec_Expression then
451 -- First check if we have to insert discriminant checks
453 if Has_Discriminants (Exp_Typ) then
454 Apply_Discriminant_Check (Exp, Check_Typ);
456 -- Next emit length checks for array aggregates
458 elsif Is_Array_Type (Exp_Typ) then
459 Apply_Length_Check (Exp, Check_Typ);
461 -- Finally emit scalar and string checks. If we are dealing with a
462 -- scalar literal we need to check by hand because the Etype of
463 -- literals is not necessarily correct.
465 elsif Is_Scalar_Type (Exp_Typ)
466 and then Compile_Time_Known_Value (Exp)
468 if Is_Out_Of_Range (Exp, Base_Type (Check_Typ)) then
469 Apply_Compile_Time_Constraint_Error
470 (Exp, "value not in range of}?", CE_Range_Check_Failed,
471 Ent => Base_Type (Check_Typ),
472 Typ => Base_Type (Check_Typ));
474 elsif Is_Out_Of_Range (Exp, Check_Typ) then
475 Apply_Compile_Time_Constraint_Error
476 (Exp, "value not in range of}?", CE_Range_Check_Failed,
480 elsif not Range_Checks_Suppressed (Check_Typ) then
481 Apply_Scalar_Range_Check (Exp, Check_Typ);
484 -- Verify that target type is also scalar, to prevent view anomalies
485 -- in instantiations.
487 elsif (Is_Scalar_Type (Exp_Typ)
488 or else Nkind (Exp) = N_String_Literal)
489 and then Is_Scalar_Type (Check_Typ)
490 and then Exp_Typ /= Check_Typ
492 if Is_Entity_Name (Exp)
493 and then Ekind (Entity (Exp)) = E_Constant
495 -- If expression is a constant, it is worthwhile checking whether
496 -- it is a bound of the type.
498 if (Is_Entity_Name (Type_Low_Bound (Check_Typ))
499 and then Entity (Exp) = Entity (Type_Low_Bound (Check_Typ)))
500 or else (Is_Entity_Name (Type_High_Bound (Check_Typ))
501 and then Entity (Exp) = Entity (Type_High_Bound (Check_Typ)))
506 Rewrite (Exp, Convert_To (Check_Typ, Relocate_Node (Exp)));
507 Analyze_And_Resolve (Exp, Check_Typ);
508 Check_Unset_Reference (Exp);
511 Rewrite (Exp, Convert_To (Check_Typ, Relocate_Node (Exp)));
512 Analyze_And_Resolve (Exp, Check_Typ);
513 Check_Unset_Reference (Exp);
517 end Aggregate_Constraint_Checks;
519 ------------------------
520 -- Array_Aggr_Subtype --
521 ------------------------
523 function Array_Aggr_Subtype
525 Typ : Entity_Id) return Entity_Id
527 Aggr_Dimension : constant Pos := Number_Dimensions (Typ);
528 -- Number of aggregate index dimensions
530 Aggr_Range : array (1 .. Aggr_Dimension) of Node_Id := (others => Empty);
531 -- Constrained N_Range of each index dimension in our aggregate itype
533 Aggr_Low : array (1 .. Aggr_Dimension) of Node_Id := (others => Empty);
534 Aggr_High : array (1 .. Aggr_Dimension) of Node_Id := (others => Empty);
535 -- Low and High bounds for each index dimension in our aggregate itype
537 Is_Fully_Positional : Boolean := True;
539 procedure Collect_Aggr_Bounds (N : Node_Id; Dim : Pos);
540 -- N is an array (sub-)aggregate. Dim is the dimension corresponding
541 -- to (sub-)aggregate N. This procedure collects and removes the side
542 -- effects of the constrained N_Range nodes corresponding to each index
543 -- dimension of our aggregate itype. These N_Range nodes are collected
544 -- in Aggr_Range above.
546 -- Likewise collect in Aggr_Low & Aggr_High above the low and high
547 -- bounds of each index dimension. If, when collecting, two bounds
548 -- corresponding to the same dimension are static and found to differ,
549 -- then emit a warning, and mark N as raising Constraint_Error.
551 -------------------------
552 -- Collect_Aggr_Bounds --
553 -------------------------
555 procedure Collect_Aggr_Bounds (N : Node_Id; Dim : Pos) is
556 This_Range : constant Node_Id := Aggregate_Bounds (N);
557 -- The aggregate range node of this specific sub-aggregate
559 This_Low : constant Node_Id := Low_Bound (Aggregate_Bounds (N));
560 This_High : constant Node_Id := High_Bound (Aggregate_Bounds (N));
561 -- The aggregate bounds of this specific sub-aggregate
567 Remove_Side_Effects (This_Low, Variable_Ref => True);
568 Remove_Side_Effects (This_High, Variable_Ref => True);
570 -- Collect the first N_Range for a given dimension that you find.
571 -- For a given dimension they must be all equal anyway.
573 if No (Aggr_Range (Dim)) then
574 Aggr_Low (Dim) := This_Low;
575 Aggr_High (Dim) := This_High;
576 Aggr_Range (Dim) := This_Range;
579 if Compile_Time_Known_Value (This_Low) then
580 if not Compile_Time_Known_Value (Aggr_Low (Dim)) then
581 Aggr_Low (Dim) := This_Low;
583 elsif Expr_Value (This_Low) /= Expr_Value (Aggr_Low (Dim)) then
584 Set_Raises_Constraint_Error (N);
585 Error_Msg_N ("sub-aggregate low bound mismatch?", N);
587 ("\Constraint_Error will be raised at run time?", N);
591 if Compile_Time_Known_Value (This_High) then
592 if not Compile_Time_Known_Value (Aggr_High (Dim)) then
593 Aggr_High (Dim) := This_High;
596 Expr_Value (This_High) /= Expr_Value (Aggr_High (Dim))
598 Set_Raises_Constraint_Error (N);
599 Error_Msg_N ("sub-aggregate high bound mismatch?", N);
601 ("\Constraint_Error will be raised at run time?", N);
606 if Dim < Aggr_Dimension then
608 -- Process positional components
610 if Present (Expressions (N)) then
611 Expr := First (Expressions (N));
612 while Present (Expr) loop
613 Collect_Aggr_Bounds (Expr, Dim + 1);
618 -- Process component associations
620 if Present (Component_Associations (N)) then
621 Is_Fully_Positional := False;
623 Assoc := First (Component_Associations (N));
624 while Present (Assoc) loop
625 Expr := Expression (Assoc);
626 Collect_Aggr_Bounds (Expr, Dim + 1);
631 end Collect_Aggr_Bounds;
633 -- Array_Aggr_Subtype variables
636 -- The final itype of the overall aggregate
638 Index_Constraints : constant List_Id := New_List;
639 -- The list of index constraints of the aggregate itype
641 -- Start of processing for Array_Aggr_Subtype
644 -- Make sure that the list of index constraints is properly attached to
645 -- the tree, and then collect the aggregate bounds.
647 Set_Parent (Index_Constraints, N);
648 Collect_Aggr_Bounds (N, 1);
650 -- Build the list of constrained indexes of our aggregate itype
652 for J in 1 .. Aggr_Dimension loop
653 Create_Index : declare
654 Index_Base : constant Entity_Id :=
655 Base_Type (Etype (Aggr_Range (J)));
656 Index_Typ : Entity_Id;
659 -- Construct the Index subtype, and associate it with the range
660 -- construct that generates it.
663 Create_Itype (Subtype_Kind (Ekind (Index_Base)), Aggr_Range (J));
665 Set_Etype (Index_Typ, Index_Base);
667 if Is_Character_Type (Index_Base) then
668 Set_Is_Character_Type (Index_Typ);
671 Set_Size_Info (Index_Typ, (Index_Base));
672 Set_RM_Size (Index_Typ, RM_Size (Index_Base));
673 Set_First_Rep_Item (Index_Typ, First_Rep_Item (Index_Base));
674 Set_Scalar_Range (Index_Typ, Aggr_Range (J));
676 if Is_Discrete_Or_Fixed_Point_Type (Index_Typ) then
677 Set_RM_Size (Index_Typ, UI_From_Int (Minimum_Size (Index_Typ)));
680 Set_Etype (Aggr_Range (J), Index_Typ);
682 Append (Aggr_Range (J), To => Index_Constraints);
686 -- Now build the Itype
688 Itype := Create_Itype (E_Array_Subtype, N);
690 Set_First_Rep_Item (Itype, First_Rep_Item (Typ));
691 Set_Convention (Itype, Convention (Typ));
692 Set_Depends_On_Private (Itype, Has_Private_Component (Typ));
693 Set_Etype (Itype, Base_Type (Typ));
694 Set_Has_Alignment_Clause (Itype, Has_Alignment_Clause (Typ));
695 Set_Is_Aliased (Itype, Is_Aliased (Typ));
696 Set_Depends_On_Private (Itype, Depends_On_Private (Typ));
698 Copy_Suppress_Status (Index_Check, Typ, Itype);
699 Copy_Suppress_Status (Length_Check, Typ, Itype);
701 Set_First_Index (Itype, First (Index_Constraints));
702 Set_Is_Constrained (Itype, True);
703 Set_Is_Internal (Itype, True);
705 -- A simple optimization: purely positional aggregates of static
706 -- components should be passed to gigi unexpanded whenever possible, and
707 -- regardless of the staticness of the bounds themselves. Subsequent
708 -- checks in exp_aggr verify that type is not packed, etc.
710 Set_Size_Known_At_Compile_Time (Itype,
712 and then Comes_From_Source (N)
713 and then Size_Known_At_Compile_Time (Component_Type (Typ)));
715 -- We always need a freeze node for a packed array subtype, so that we
716 -- can build the Packed_Array_Type corresponding to the subtype. If
717 -- expansion is disabled, the packed array subtype is not built, and we
718 -- must not generate a freeze node for the type, or else it will appear
719 -- incomplete to gigi.
722 and then not In_Spec_Expression
723 and then Expander_Active
725 Freeze_Itype (Itype, N);
729 end Array_Aggr_Subtype;
731 --------------------------------
732 -- Check_Misspelled_Component --
733 --------------------------------
735 procedure Check_Misspelled_Component
736 (Elements : Elist_Id;
739 Max_Suggestions : constant := 2;
741 Nr_Of_Suggestions : Natural := 0;
742 Suggestion_1 : Entity_Id := Empty;
743 Suggestion_2 : Entity_Id := Empty;
744 Component_Elmt : Elmt_Id;
747 -- All the components of List are matched against Component and a count
748 -- is maintained of possible misspellings. When at the end of the the
749 -- analysis there are one or two (not more!) possible misspellings,
750 -- these misspellings will be suggested as possible correction.
752 Component_Elmt := First_Elmt (Elements);
753 while Nr_Of_Suggestions <= Max_Suggestions
754 and then Present (Component_Elmt)
756 if Is_Bad_Spelling_Of
757 (Chars (Node (Component_Elmt)),
760 Nr_Of_Suggestions := Nr_Of_Suggestions + 1;
762 case Nr_Of_Suggestions is
763 when 1 => Suggestion_1 := Node (Component_Elmt);
764 when 2 => Suggestion_2 := Node (Component_Elmt);
769 Next_Elmt (Component_Elmt);
772 -- Report at most two suggestions
774 if Nr_Of_Suggestions = 1 then
775 Error_Msg_NE -- CODEFIX
776 ("\possible misspelling of&", Component, Suggestion_1);
778 elsif Nr_Of_Suggestions = 2 then
779 Error_Msg_Node_2 := Suggestion_2;
780 Error_Msg_NE -- CODEFIX
781 ("\possible misspelling of& or&", Component, Suggestion_1);
783 end Check_Misspelled_Component;
785 ----------------------------------------
786 -- Check_Expr_OK_In_Limited_Aggregate --
787 ----------------------------------------
789 procedure Check_Expr_OK_In_Limited_Aggregate (Expr : Node_Id) is
791 if Is_Limited_Type (Etype (Expr))
792 and then Comes_From_Source (Expr)
793 and then not In_Instance_Body
795 if not OK_For_Limited_Init (Etype (Expr), Expr) then
796 Error_Msg_N ("initialization not allowed for limited types", Expr);
797 Explain_Limited_Type (Etype (Expr), Expr);
800 end Check_Expr_OK_In_Limited_Aggregate;
802 -------------------------------
803 -- Check_Qualified_Aggregate --
804 -------------------------------
806 procedure Check_Qualified_Aggregate (Level : Nat; Expr : Node_Id) is
812 if Nkind (Parent (Expr)) /= N_Qualified_Expression then
813 Check_SPARK_Restriction ("aggregate should be qualified", Expr);
817 Comp_Expr := First (Expressions (Expr));
818 while Present (Comp_Expr) loop
819 if Nkind (Comp_Expr) = N_Aggregate then
820 Check_Qualified_Aggregate (Level - 1, Comp_Expr);
823 Comp_Expr := Next (Comp_Expr);
826 Comp_Assn := First (Component_Associations (Expr));
827 while Present (Comp_Assn) loop
828 Comp_Expr := Expression (Comp_Assn);
830 if Nkind (Comp_Expr) = N_Aggregate then
831 Check_Qualified_Aggregate (Level - 1, Comp_Expr);
834 Comp_Assn := Next (Comp_Assn);
837 end Check_Qualified_Aggregate;
839 ----------------------------------------
840 -- Check_Static_Discriminated_Subtype --
841 ----------------------------------------
843 procedure Check_Static_Discriminated_Subtype (T : Entity_Id; V : Node_Id) is
844 Disc : constant Entity_Id := First_Discriminant (T);
849 if Has_Record_Rep_Clause (T) then
852 elsif Present (Next_Discriminant (Disc)) then
855 elsif Nkind (V) /= N_Integer_Literal then
859 Comp := First_Component (T);
860 while Present (Comp) loop
861 if Is_Scalar_Type (Etype (Comp)) then
864 elsif Is_Private_Type (Etype (Comp))
865 and then Present (Full_View (Etype (Comp)))
866 and then Is_Scalar_Type (Full_View (Etype (Comp)))
870 elsif Is_Array_Type (Etype (Comp)) then
871 if Is_Bit_Packed_Array (Etype (Comp)) then
875 Ind := First_Index (Etype (Comp));
876 while Present (Ind) loop
877 if Nkind (Ind) /= N_Range
878 or else Nkind (Low_Bound (Ind)) /= N_Integer_Literal
879 or else Nkind (High_Bound (Ind)) /= N_Integer_Literal
891 Next_Component (Comp);
894 -- On exit, all components have statically known sizes
896 Set_Size_Known_At_Compile_Time (T);
897 end Check_Static_Discriminated_Subtype;
899 -------------------------
900 -- Is_Others_Aggregate --
901 -------------------------
903 function Is_Others_Aggregate (Aggr : Node_Id) return Boolean is
905 return No (Expressions (Aggr))
907 Nkind (First (Choices (First (Component_Associations (Aggr)))))
909 end Is_Others_Aggregate;
911 ----------------------------
912 -- Is_Top_Level_Aggregate --
913 ----------------------------
915 function Is_Top_Level_Aggregate (Expr : Node_Id) return Boolean is
917 return Nkind (Parent (Expr)) /= N_Aggregate
918 and then (Nkind (Parent (Expr)) /= N_Component_Association
919 or else Nkind (Parent (Parent (Expr))) /= N_Aggregate);
920 end Is_Top_Level_Aggregate;
922 --------------------------------
923 -- Make_String_Into_Aggregate --
924 --------------------------------
926 procedure Make_String_Into_Aggregate (N : Node_Id) is
927 Exprs : constant List_Id := New_List;
928 Loc : constant Source_Ptr := Sloc (N);
929 Str : constant String_Id := Strval (N);
930 Strlen : constant Nat := String_Length (Str);
938 for J in 1 .. Strlen loop
939 C := Get_String_Char (Str, J);
940 Set_Character_Literal_Name (C);
943 Make_Character_Literal (P,
945 Char_Literal_Value => UI_From_CC (C));
946 Set_Etype (C_Node, Any_Character);
947 Append_To (Exprs, C_Node);
950 -- Something special for wide strings???
953 New_N := Make_Aggregate (Loc, Expressions => Exprs);
954 Set_Analyzed (New_N);
955 Set_Etype (New_N, Any_Composite);
958 end Make_String_Into_Aggregate;
960 -----------------------
961 -- Resolve_Aggregate --
962 -----------------------
964 procedure Resolve_Aggregate (N : Node_Id; Typ : Entity_Id) is
965 Loc : constant Source_Ptr := Sloc (N);
966 Pkind : constant Node_Kind := Nkind (Parent (N));
968 Aggr_Subtyp : Entity_Id;
969 -- The actual aggregate subtype. This is not necessarily the same as Typ
970 -- which is the subtype of the context in which the aggregate was found.
973 -- Ignore junk empty aggregate resulting from parser error
975 if No (Expressions (N))
976 and then No (Component_Associations (N))
977 and then not Null_Record_Present (N)
982 -- If the aggregate has box-initialized components, its type must be
983 -- frozen so that initialization procedures can properly be called
984 -- in the resolution that follows. The replacement of boxes with
985 -- initialization calls is properly an expansion activity but it must
986 -- be done during revolution.
989 and then Present (Component_Associations (N))
995 Comp := First (Component_Associations (N));
996 while Present (Comp) loop
997 if Box_Present (Comp) then
998 Insert_Actions (N, Freeze_Entity (Typ, N));
1007 -- An unqualified aggregate is restricted in SPARK to:
1009 -- An aggregate item inside an aggregate for a multi-dimensional array
1011 -- An expression being assigned to an unconstrained array, but only if
1012 -- the aggregate specifies a value for OTHERS only.
1014 if Nkind (Parent (N)) = N_Qualified_Expression then
1015 if Is_Array_Type (Typ) then
1016 Check_Qualified_Aggregate (Number_Dimensions (Typ), N);
1018 Check_Qualified_Aggregate (1, N);
1021 if Is_Array_Type (Typ)
1022 and then Nkind (Parent (N)) = N_Assignment_Statement
1023 and then not Is_Constrained (Etype (Name (Parent (N))))
1025 if not Is_Others_Aggregate (N) then
1026 Check_SPARK_Restriction
1027 ("array aggregate should have only OTHERS", N);
1030 elsif Is_Top_Level_Aggregate (N) then
1031 Check_SPARK_Restriction ("aggregate should be qualified", N);
1033 -- The legality of this unqualified aggregate is checked by calling
1034 -- Check_Qualified_Aggregate from one of its enclosing aggregate,
1035 -- unless one of these already causes an error to be issued.
1042 -- Check for aggregates not allowed in configurable run-time mode.
1043 -- We allow all cases of aggregates that do not come from source, since
1044 -- these are all assumed to be small (e.g. bounds of a string literal).
1045 -- We also allow aggregates of types we know to be small.
1047 if not Support_Aggregates_On_Target
1048 and then Comes_From_Source (N)
1049 and then (not Known_Static_Esize (Typ) or else Esize (Typ) > 64)
1051 Error_Msg_CRT ("aggregate", N);
1054 -- Ada 2005 (AI-287): Limited aggregates allowed
1056 -- In an instance, ignore aggregate subcomponents tnat may be limited,
1057 -- because they originate in view conflicts. If the original aggregate
1058 -- is legal and the actuals are legal, the aggregate itself is legal.
1060 if Is_Limited_Type (Typ)
1061 and then Ada_Version < Ada_2005
1062 and then not In_Instance
1064 Error_Msg_N ("aggregate type cannot be limited", N);
1065 Explain_Limited_Type (Typ, N);
1067 elsif Is_Class_Wide_Type (Typ) then
1068 Error_Msg_N ("type of aggregate cannot be class-wide", N);
1070 elsif Typ = Any_String
1071 or else Typ = Any_Composite
1073 Error_Msg_N ("no unique type for aggregate", N);
1074 Set_Etype (N, Any_Composite);
1076 elsif Is_Array_Type (Typ) and then Null_Record_Present (N) then
1077 Error_Msg_N ("null record forbidden in array aggregate", N);
1079 elsif Is_Record_Type (Typ) then
1080 Resolve_Record_Aggregate (N, Typ);
1082 elsif Is_Array_Type (Typ) then
1084 -- First a special test, for the case of a positional aggregate
1085 -- of characters which can be replaced by a string literal.
1087 -- Do not perform this transformation if this was a string literal to
1088 -- start with, whose components needed constraint checks, or if the
1089 -- component type is non-static, because it will require those checks
1090 -- and be transformed back into an aggregate.
1092 if Number_Dimensions (Typ) = 1
1093 and then Is_Standard_Character_Type (Component_Type (Typ))
1094 and then No (Component_Associations (N))
1095 and then not Is_Limited_Composite (Typ)
1096 and then not Is_Private_Composite (Typ)
1097 and then not Is_Bit_Packed_Array (Typ)
1098 and then Nkind (Original_Node (Parent (N))) /= N_String_Literal
1099 and then Is_Static_Subtype (Component_Type (Typ))
1105 Expr := First (Expressions (N));
1106 while Present (Expr) loop
1107 exit when Nkind (Expr) /= N_Character_Literal;
1114 Expr := First (Expressions (N));
1115 while Present (Expr) loop
1116 Store_String_Char (UI_To_CC (Char_Literal_Value (Expr)));
1120 Rewrite (N, Make_String_Literal (Loc, End_String));
1122 Analyze_And_Resolve (N, Typ);
1128 -- Here if we have a real aggregate to deal with
1130 Array_Aggregate : declare
1131 Aggr_Resolved : Boolean;
1133 Aggr_Typ : constant Entity_Id := Etype (Typ);
1134 -- This is the unconstrained array type, which is the type against
1135 -- which the aggregate is to be resolved. Typ itself is the array
1136 -- type of the context which may not be the same subtype as the
1137 -- subtype for the final aggregate.
1140 -- In the following we determine whether an OTHERS choice is
1141 -- allowed inside the array aggregate. The test checks the context
1142 -- in which the array aggregate occurs. If the context does not
1143 -- permit it, or the aggregate type is unconstrained, an OTHERS
1144 -- choice is not allowed (except that it is always allowed on the
1145 -- right-hand side of an assignment statement; in this case the
1146 -- constrainedness of the type doesn't matter).
1148 -- If expansion is disabled (generic context, or semantics-only
1149 -- mode) actual subtypes cannot be constructed, and the type of an
1150 -- object may be its unconstrained nominal type. However, if the
1151 -- context is an assignment, we assume that OTHERS is allowed,
1152 -- because the target of the assignment will have a constrained
1153 -- subtype when fully compiled.
1155 -- Note that there is no node for Explicit_Actual_Parameter.
1156 -- To test for this context we therefore have to test for node
1157 -- N_Parameter_Association which itself appears only if there is a
1158 -- formal parameter. Consequently we also need to test for
1159 -- N_Procedure_Call_Statement or N_Function_Call.
1161 Set_Etype (N, Aggr_Typ); -- May be overridden later on
1163 if Pkind = N_Assignment_Statement
1164 or else (Is_Constrained (Typ)
1166 (Pkind = N_Parameter_Association or else
1167 Pkind = N_Function_Call or else
1168 Pkind = N_Procedure_Call_Statement or else
1169 Pkind = N_Generic_Association or else
1170 Pkind = N_Formal_Object_Declaration or else
1171 Pkind = N_Simple_Return_Statement or else
1172 Pkind = N_Object_Declaration or else
1173 Pkind = N_Component_Declaration or else
1174 Pkind = N_Parameter_Specification or else
1175 Pkind = N_Qualified_Expression or else
1176 Pkind = N_Aggregate or else
1177 Pkind = N_Extension_Aggregate or else
1178 Pkind = N_Component_Association))
1181 Resolve_Array_Aggregate
1183 Index => First_Index (Aggr_Typ),
1184 Index_Constr => First_Index (Typ),
1185 Component_Typ => Component_Type (Typ),
1186 Others_Allowed => True);
1188 elsif not Expander_Active
1189 and then Pkind = N_Assignment_Statement
1192 Resolve_Array_Aggregate
1194 Index => First_Index (Aggr_Typ),
1195 Index_Constr => First_Index (Typ),
1196 Component_Typ => Component_Type (Typ),
1197 Others_Allowed => True);
1201 Resolve_Array_Aggregate
1203 Index => First_Index (Aggr_Typ),
1204 Index_Constr => First_Index (Aggr_Typ),
1205 Component_Typ => Component_Type (Typ),
1206 Others_Allowed => False);
1209 if not Aggr_Resolved then
1211 -- A parenthesized expression may have been intended as an
1212 -- aggregate, leading to a type error when analyzing the
1213 -- component. This can also happen for a nested component
1214 -- (see Analyze_Aggr_Expr).
1216 if Paren_Count (N) > 0 then
1218 ("positional aggregate cannot have one component", N);
1221 Aggr_Subtyp := Any_Composite;
1224 Aggr_Subtyp := Array_Aggr_Subtype (N, Typ);
1227 Set_Etype (N, Aggr_Subtyp);
1228 end Array_Aggregate;
1230 elsif Is_Private_Type (Typ)
1231 and then Present (Full_View (Typ))
1232 and then (In_Inlined_Body or In_Instance_Body)
1233 and then Is_Composite_Type (Full_View (Typ))
1235 Resolve (N, Full_View (Typ));
1238 Error_Msg_N ("illegal context for aggregate", N);
1241 -- If we can determine statically that the evaluation of the aggregate
1242 -- raises Constraint_Error, then replace the aggregate with an
1243 -- N_Raise_Constraint_Error node, but set the Etype to the right
1244 -- aggregate subtype. Gigi needs this.
1246 if Raises_Constraint_Error (N) then
1247 Aggr_Subtyp := Etype (N);
1249 Make_Raise_Constraint_Error (Loc, Reason => CE_Range_Check_Failed));
1250 Set_Raises_Constraint_Error (N);
1251 Set_Etype (N, Aggr_Subtyp);
1254 end Resolve_Aggregate;
1256 -----------------------------
1257 -- Resolve_Array_Aggregate --
1258 -----------------------------
1260 function Resolve_Array_Aggregate
1263 Index_Constr : Node_Id;
1264 Component_Typ : Entity_Id;
1265 Others_Allowed : Boolean) return Boolean
1267 Loc : constant Source_Ptr := Sloc (N);
1269 Failure : constant Boolean := False;
1270 Success : constant Boolean := True;
1272 Index_Typ : constant Entity_Id := Etype (Index);
1273 Index_Typ_Low : constant Node_Id := Type_Low_Bound (Index_Typ);
1274 Index_Typ_High : constant Node_Id := Type_High_Bound (Index_Typ);
1275 -- The type of the index corresponding to the array sub-aggregate along
1276 -- with its low and upper bounds.
1278 Index_Base : constant Entity_Id := Base_Type (Index_Typ);
1279 Index_Base_Low : constant Node_Id := Type_Low_Bound (Index_Base);
1280 Index_Base_High : constant Node_Id := Type_High_Bound (Index_Base);
1281 -- Ditto for the base type
1283 function Add (Val : Uint; To : Node_Id) return Node_Id;
1284 -- Creates a new expression node where Val is added to expression To.
1285 -- Tries to constant fold whenever possible. To must be an already
1286 -- analyzed expression.
1288 procedure Check_Bound (BH : Node_Id; AH : in out Node_Id);
1289 -- Checks that AH (the upper bound of an array aggregate) is less than
1290 -- or equal to BH (the upper bound of the index base type). If the check
1291 -- fails, a warning is emitted, the Raises_Constraint_Error flag of N is
1292 -- set, and AH is replaced with a duplicate of BH.
1294 procedure Check_Bounds (L, H : Node_Id; AL, AH : Node_Id);
1295 -- Checks that range AL .. AH is compatible with range L .. H. Emits a
1296 -- warning if not and sets the Raises_Constraint_Error flag in N.
1298 procedure Check_Length (L, H : Node_Id; Len : Uint);
1299 -- Checks that range L .. H contains at least Len elements. Emits a
1300 -- warning if not and sets the Raises_Constraint_Error flag in N.
1302 function Dynamic_Or_Null_Range (L, H : Node_Id) return Boolean;
1303 -- Returns True if range L .. H is dynamic or null
1305 procedure Get (Value : out Uint; From : Node_Id; OK : out Boolean);
1306 -- Given expression node From, this routine sets OK to False if it
1307 -- cannot statically evaluate From. Otherwise it stores this static
1308 -- value into Value.
1310 function Resolve_Aggr_Expr
1312 Single_Elmt : Boolean) return Boolean;
1313 -- Resolves aggregate expression Expr. Returns False if resolution
1314 -- fails. If Single_Elmt is set to False, the expression Expr may be
1315 -- used to initialize several array aggregate elements (this can happen
1316 -- for discrete choices such as "L .. H => Expr" or the OTHERS choice).
1317 -- In this event we do not resolve Expr unless expansion is disabled.
1318 -- To know why, see the DELAYED COMPONENT RESOLUTION note above.
1320 -- NOTE: In the case of "... => <>", we pass the in the
1321 -- N_Component_Association node as Expr, since there is no Expression in
1322 -- that case, and we need a Sloc for the error message.
1328 function Add (Val : Uint; To : Node_Id) return Node_Id is
1334 if Raises_Constraint_Error (To) then
1338 -- First test if we can do constant folding
1340 if Compile_Time_Known_Value (To)
1341 or else Nkind (To) = N_Integer_Literal
1343 Expr_Pos := Make_Integer_Literal (Loc, Expr_Value (To) + Val);
1344 Set_Is_Static_Expression (Expr_Pos);
1345 Set_Etype (Expr_Pos, Etype (To));
1346 Set_Analyzed (Expr_Pos, Analyzed (To));
1348 if not Is_Enumeration_Type (Index_Typ) then
1351 -- If we are dealing with enumeration return
1352 -- Index_Typ'Val (Expr_Pos)
1356 Make_Attribute_Reference
1358 Prefix => New_Reference_To (Index_Typ, Loc),
1359 Attribute_Name => Name_Val,
1360 Expressions => New_List (Expr_Pos));
1366 -- If we are here no constant folding possible
1368 if not Is_Enumeration_Type (Index_Base) then
1371 Left_Opnd => Duplicate_Subexpr (To),
1372 Right_Opnd => Make_Integer_Literal (Loc, Val));
1374 -- If we are dealing with enumeration return
1375 -- Index_Typ'Val (Index_Typ'Pos (To) + Val)
1379 Make_Attribute_Reference
1381 Prefix => New_Reference_To (Index_Typ, Loc),
1382 Attribute_Name => Name_Pos,
1383 Expressions => New_List (Duplicate_Subexpr (To)));
1387 Left_Opnd => To_Pos,
1388 Right_Opnd => Make_Integer_Literal (Loc, Val));
1391 Make_Attribute_Reference
1393 Prefix => New_Reference_To (Index_Typ, Loc),
1394 Attribute_Name => Name_Val,
1395 Expressions => New_List (Expr_Pos));
1397 -- If the index type has a non standard representation, the
1398 -- attributes 'Val and 'Pos expand into function calls and the
1399 -- resulting expression is considered non-safe for reevaluation
1400 -- by the backend. Relocate it into a constant temporary in order
1401 -- to make it safe for reevaluation.
1403 if Has_Non_Standard_Rep (Etype (N)) then
1408 Def_Id := Make_Temporary (Loc, 'R', Expr);
1409 Set_Etype (Def_Id, Index_Typ);
1411 Make_Object_Declaration (Loc,
1412 Defining_Identifier => Def_Id,
1413 Object_Definition => New_Reference_To (Index_Typ, Loc),
1414 Constant_Present => True,
1415 Expression => Relocate_Node (Expr)));
1417 Expr := New_Reference_To (Def_Id, Loc);
1429 procedure Check_Bound (BH : Node_Id; AH : in out Node_Id) is
1437 Get (Value => Val_BH, From => BH, OK => OK_BH);
1438 Get (Value => Val_AH, From => AH, OK => OK_AH);
1440 if OK_BH and then OK_AH and then Val_BH < Val_AH then
1441 Set_Raises_Constraint_Error (N);
1442 Error_Msg_N ("upper bound out of range?", AH);
1443 Error_Msg_N ("\Constraint_Error will be raised at run time?", AH);
1445 -- You need to set AH to BH or else in the case of enumerations
1446 -- indexes we will not be able to resolve the aggregate bounds.
1448 AH := Duplicate_Subexpr (BH);
1456 procedure Check_Bounds (L, H : Node_Id; AL, AH : Node_Id) is
1467 pragma Warnings (Off, OK_AL);
1468 pragma Warnings (Off, OK_AH);
1471 if Raises_Constraint_Error (N)
1472 or else Dynamic_Or_Null_Range (AL, AH)
1477 Get (Value => Val_L, From => L, OK => OK_L);
1478 Get (Value => Val_H, From => H, OK => OK_H);
1480 Get (Value => Val_AL, From => AL, OK => OK_AL);
1481 Get (Value => Val_AH, From => AH, OK => OK_AH);
1483 if OK_L and then Val_L > Val_AL then
1484 Set_Raises_Constraint_Error (N);
1485 Error_Msg_N ("lower bound of aggregate out of range?", N);
1486 Error_Msg_N ("\Constraint_Error will be raised at run time?", N);
1489 if OK_H and then Val_H < Val_AH then
1490 Set_Raises_Constraint_Error (N);
1491 Error_Msg_N ("upper bound of aggregate out of range?", N);
1492 Error_Msg_N ("\Constraint_Error will be raised at run time?", N);
1500 procedure Check_Length (L, H : Node_Id; Len : Uint) is
1510 if Raises_Constraint_Error (N) then
1514 Get (Value => Val_L, From => L, OK => OK_L);
1515 Get (Value => Val_H, From => H, OK => OK_H);
1517 if not OK_L or else not OK_H then
1521 -- If null range length is zero
1523 if Val_L > Val_H then
1524 Range_Len := Uint_0;
1526 Range_Len := Val_H - Val_L + 1;
1529 if Range_Len < Len then
1530 Set_Raises_Constraint_Error (N);
1531 Error_Msg_N ("too many elements?", N);
1532 Error_Msg_N ("\Constraint_Error will be raised at run time?", N);
1536 ---------------------------
1537 -- Dynamic_Or_Null_Range --
1538 ---------------------------
1540 function Dynamic_Or_Null_Range (L, H : Node_Id) return Boolean is
1548 Get (Value => Val_L, From => L, OK => OK_L);
1549 Get (Value => Val_H, From => H, OK => OK_H);
1551 return not OK_L or else not OK_H
1552 or else not Is_OK_Static_Expression (L)
1553 or else not Is_OK_Static_Expression (H)
1554 or else Val_L > Val_H;
1555 end Dynamic_Or_Null_Range;
1561 procedure Get (Value : out Uint; From : Node_Id; OK : out Boolean) is
1565 if Compile_Time_Known_Value (From) then
1566 Value := Expr_Value (From);
1568 -- If expression From is something like Some_Type'Val (10) then
1571 elsif Nkind (From) = N_Attribute_Reference
1572 and then Attribute_Name (From) = Name_Val
1573 and then Compile_Time_Known_Value (First (Expressions (From)))
1575 Value := Expr_Value (First (Expressions (From)));
1583 -----------------------
1584 -- Resolve_Aggr_Expr --
1585 -----------------------
1587 function Resolve_Aggr_Expr
1589 Single_Elmt : Boolean) return Boolean
1591 Nxt_Ind : constant Node_Id := Next_Index (Index);
1592 Nxt_Ind_Constr : constant Node_Id := Next_Index (Index_Constr);
1593 -- Index is the current index corresponding to the expression
1595 Resolution_OK : Boolean := True;
1596 -- Set to False if resolution of the expression failed
1599 -- Defend against previous errors
1601 if Nkind (Expr) = N_Error
1602 or else Error_Posted (Expr)
1607 -- If the array type against which we are resolving the aggregate
1608 -- has several dimensions, the expressions nested inside the
1609 -- aggregate must be further aggregates (or strings).
1611 if Present (Nxt_Ind) then
1612 if Nkind (Expr) /= N_Aggregate then
1614 -- A string literal can appear where a one-dimensional array
1615 -- of characters is expected. If the literal looks like an
1616 -- operator, it is still an operator symbol, which will be
1617 -- transformed into a string when analyzed.
1619 if Is_Character_Type (Component_Typ)
1620 and then No (Next_Index (Nxt_Ind))
1621 and then Nkind_In (Expr, N_String_Literal, N_Operator_Symbol)
1623 -- A string literal used in a multidimensional array
1624 -- aggregate in place of the final one-dimensional
1625 -- aggregate must not be enclosed in parentheses.
1627 if Paren_Count (Expr) /= 0 then
1628 Error_Msg_N ("no parenthesis allowed here", Expr);
1631 Make_String_Into_Aggregate (Expr);
1634 Error_Msg_N ("nested array aggregate expected", Expr);
1636 -- If the expression is parenthesized, this may be
1637 -- a missing component association for a 1-aggregate.
1639 if Paren_Count (Expr) > 0 then
1641 ("\if single-component aggregate is intended,"
1642 & " write e.g. (1 ='> ...)", Expr);
1649 -- If it's "... => <>", nothing to resolve
1651 if Nkind (Expr) = N_Component_Association then
1652 pragma Assert (Box_Present (Expr));
1656 -- Ada 2005 (AI-231): Propagate the type to the nested aggregate.
1657 -- Required to check the null-exclusion attribute (if present).
1658 -- This value may be overridden later on.
1660 Set_Etype (Expr, Etype (N));
1662 Resolution_OK := Resolve_Array_Aggregate
1663 (Expr, Nxt_Ind, Nxt_Ind_Constr, Component_Typ, Others_Allowed);
1667 -- If it's "... => <>", nothing to resolve
1669 if Nkind (Expr) = N_Component_Association then
1670 pragma Assert (Box_Present (Expr));
1674 -- Do not resolve the expressions of discrete or others choices
1675 -- unless the expression covers a single component, or the
1676 -- expander is inactive.
1678 -- In Alfa mode, expressions that can perform side-effects will be
1679 -- recognized by the gnat2why back-end, and the whole subprogram
1680 -- will be ignored. So semantic analysis can be performed safely.
1683 or else not Full_Expander_Active
1684 or else In_Spec_Expression
1686 Analyze_And_Resolve (Expr, Component_Typ);
1687 Check_Expr_OK_In_Limited_Aggregate (Expr);
1688 Check_Non_Static_Context (Expr);
1689 Aggregate_Constraint_Checks (Expr, Component_Typ);
1690 Check_Unset_Reference (Expr);
1694 if Raises_Constraint_Error (Expr)
1695 and then Nkind (Parent (Expr)) /= N_Component_Association
1697 Set_Raises_Constraint_Error (N);
1700 -- If the expression has been marked as requiring a range check,
1701 -- then generate it here.
1703 if Do_Range_Check (Expr) then
1704 Set_Do_Range_Check (Expr, False);
1705 Generate_Range_Check (Expr, Component_Typ, CE_Range_Check_Failed);
1708 return Resolution_OK;
1709 end Resolve_Aggr_Expr;
1711 -- Variables local to Resolve_Array_Aggregate
1718 pragma Warnings (Off, Discard);
1720 Aggr_Low : Node_Id := Empty;
1721 Aggr_High : Node_Id := Empty;
1722 -- The actual low and high bounds of this sub-aggregate
1724 Choices_Low : Node_Id := Empty;
1725 Choices_High : Node_Id := Empty;
1726 -- The lowest and highest discrete choices values for a named aggregate
1728 Nb_Elements : Uint := Uint_0;
1729 -- The number of elements in a positional aggregate
1731 Others_Present : Boolean := False;
1733 Nb_Choices : Nat := 0;
1734 -- Contains the overall number of named choices in this sub-aggregate
1736 Nb_Discrete_Choices : Nat := 0;
1737 -- The overall number of discrete choices (not counting others choice)
1739 Case_Table_Size : Nat;
1740 -- Contains the size of the case table needed to sort aggregate choices
1742 -- Start of processing for Resolve_Array_Aggregate
1745 -- Ignore junk empty aggregate resulting from parser error
1747 if No (Expressions (N))
1748 and then No (Component_Associations (N))
1749 and then not Null_Record_Present (N)
1754 -- STEP 1: make sure the aggregate is correctly formatted
1756 if Present (Component_Associations (N)) then
1757 Assoc := First (Component_Associations (N));
1758 while Present (Assoc) loop
1759 Choice := First (Choices (Assoc));
1760 while Present (Choice) loop
1761 if Nkind (Choice) = N_Others_Choice then
1762 Others_Present := True;
1764 if Choice /= First (Choices (Assoc))
1765 or else Present (Next (Choice))
1768 ("OTHERS must appear alone in a choice list", Choice);
1772 if Present (Next (Assoc)) then
1774 ("OTHERS must appear last in an aggregate", Choice);
1778 if Ada_Version = Ada_83
1779 and then Assoc /= First (Component_Associations (N))
1780 and then Nkind_In (Parent (N), N_Assignment_Statement,
1781 N_Object_Declaration)
1784 ("(Ada 83) illegal context for OTHERS choice", N);
1788 Nb_Choices := Nb_Choices + 1;
1796 -- At this point we know that the others choice, if present, is by
1797 -- itself and appears last in the aggregate. Check if we have mixed
1798 -- positional and discrete associations (other than the others choice).
1800 if Present (Expressions (N))
1801 and then (Nb_Choices > 1
1802 or else (Nb_Choices = 1 and then not Others_Present))
1805 ("named association cannot follow positional association",
1806 First (Choices (First (Component_Associations (N)))));
1810 -- Test for the validity of an others choice if present
1812 if Others_Present and then not Others_Allowed then
1814 ("OTHERS choice not allowed here",
1815 First (Choices (First (Component_Associations (N)))));
1820 and then Nkind (Parent (N)) /= N_Component_Association
1821 and then No (Expressions (N))
1823 Nkind (First (Choices (First (Component_Associations (N)))))
1825 and then Is_Elementary_Type (Component_Typ)
1829 Assoc : constant Node_Id := First (Component_Associations (N));
1832 Make_Component_Association (Loc,
1835 Make_Attribute_Reference (Loc,
1836 Prefix => New_Occurrence_Of (Index_Typ, Loc),
1837 Attribute_Name => Name_Range)),
1838 Expression => Relocate_Node (Expression (Assoc))));
1839 return Resolve_Array_Aggregate
1840 (N, Index, Index_Constr, Component_Typ, Others_Allowed);
1844 -- Protect against cascaded errors
1846 if Etype (Index_Typ) = Any_Type then
1850 -- STEP 2: Process named components
1852 if No (Expressions (N)) then
1853 if Others_Present then
1854 Case_Table_Size := Nb_Choices - 1;
1856 Case_Table_Size := Nb_Choices;
1862 -- Denote the lowest and highest values in an aggregate choice
1866 -- High end of one range and Low end of the next. Should be
1867 -- contiguous if there is no hole in the list of values.
1869 Missing_Values : Boolean;
1870 -- Set True if missing index values
1872 S_Low : Node_Id := Empty;
1873 S_High : Node_Id := Empty;
1874 -- if a choice in an aggregate is a subtype indication these
1875 -- denote the lowest and highest values of the subtype
1877 Table : Case_Table_Type (1 .. Case_Table_Size);
1878 -- Used to sort all the different choice values
1880 Single_Choice : Boolean;
1881 -- Set to true every time there is a single discrete choice in a
1882 -- discrete association
1884 Prev_Nb_Discrete_Choices : Nat;
1885 -- Used to keep track of the number of discrete choices in the
1886 -- current association.
1888 Errors_Posted_On_Choices : Boolean := False;
1889 -- Keeps track of whether any choices have semantic errors
1892 -- STEP 2 (A): Check discrete choices validity
1894 Assoc := First (Component_Associations (N));
1895 while Present (Assoc) loop
1896 Prev_Nb_Discrete_Choices := Nb_Discrete_Choices;
1897 Choice := First (Choices (Assoc));
1901 if Nkind (Choice) = N_Others_Choice then
1902 Single_Choice := False;
1905 -- Test for subtype mark without constraint
1907 elsif Is_Entity_Name (Choice) and then
1908 Is_Type (Entity (Choice))
1910 if Base_Type (Entity (Choice)) /= Index_Base then
1912 ("invalid subtype mark in aggregate choice",
1917 -- Case of subtype indication
1919 elsif Nkind (Choice) = N_Subtype_Indication then
1920 Resolve_Discrete_Subtype_Indication (Choice, Index_Base);
1922 -- Does the subtype indication evaluation raise CE ?
1924 Get_Index_Bounds (Subtype_Mark (Choice), S_Low, S_High);
1925 Get_Index_Bounds (Choice, Low, High);
1926 Check_Bounds (S_Low, S_High, Low, High);
1928 -- Case of range or expression
1931 Resolve (Choice, Index_Base);
1932 Check_Unset_Reference (Choice);
1933 Check_Non_Static_Context (Choice);
1935 -- If semantic errors were posted on the choice, then
1936 -- record that for possible early return from later
1937 -- processing (see handling of enumeration choices).
1939 if Error_Posted (Choice) then
1940 Errors_Posted_On_Choices := True;
1943 -- Do not range check a choice. This check is redundant
1944 -- since this test is already done when we check that the
1945 -- bounds of the array aggregate are within range.
1947 Set_Do_Range_Check (Choice, False);
1949 -- In SPARK, the choice must be static
1951 if not (Is_Static_Expression (Choice)
1952 or else (Nkind (Choice) = N_Range
1953 and then Is_Static_Range (Choice)))
1955 Check_SPARK_Restriction
1956 ("choice should be static", Choice);
1960 -- If we could not resolve the discrete choice stop here
1962 if Etype (Choice) = Any_Type then
1965 -- If the discrete choice raises CE get its original bounds
1967 elsif Nkind (Choice) = N_Raise_Constraint_Error then
1968 Set_Raises_Constraint_Error (N);
1969 Get_Index_Bounds (Original_Node (Choice), Low, High);
1971 -- Otherwise get its bounds as usual
1974 Get_Index_Bounds (Choice, Low, High);
1977 if (Dynamic_Or_Null_Range (Low, High)
1978 or else (Nkind (Choice) = N_Subtype_Indication
1980 Dynamic_Or_Null_Range (S_Low, S_High)))
1981 and then Nb_Choices /= 1
1984 ("dynamic or empty choice in aggregate " &
1985 "must be the only choice", Choice);
1989 Nb_Discrete_Choices := Nb_Discrete_Choices + 1;
1990 Table (Nb_Discrete_Choices).Choice_Lo := Low;
1991 Table (Nb_Discrete_Choices).Choice_Hi := High;
1997 -- Check if we have a single discrete choice and whether
1998 -- this discrete choice specifies a single value.
2001 (Nb_Discrete_Choices = Prev_Nb_Discrete_Choices + 1)
2002 and then (Low = High);
2008 -- Ada 2005 (AI-231)
2010 if Ada_Version >= Ada_2005
2011 and then Known_Null (Expression (Assoc))
2013 Check_Can_Never_Be_Null (Etype (N), Expression (Assoc));
2016 -- Ada 2005 (AI-287): In case of default initialized component
2017 -- we delay the resolution to the expansion phase.
2019 if Box_Present (Assoc) then
2021 -- Ada 2005 (AI-287): In case of default initialization of a
2022 -- component the expander will generate calls to the
2023 -- corresponding initialization subprogram. We need to call
2024 -- Resolve_Aggr_Expr to check the rules about
2027 if not Resolve_Aggr_Expr (Assoc,
2028 Single_Elmt => Single_Choice)
2033 elsif not Resolve_Aggr_Expr (Expression (Assoc),
2034 Single_Elmt => Single_Choice)
2038 -- Check incorrect use of dynamically tagged expression
2040 -- We differentiate here two cases because the expression may
2041 -- not be decorated. For example, the analysis and resolution
2042 -- of the expression associated with the others choice will be
2043 -- done later with the full aggregate. In such case we
2044 -- duplicate the expression tree to analyze the copy and
2045 -- perform the required check.
2047 elsif not Present (Etype (Expression (Assoc))) then
2049 Save_Analysis : constant Boolean := Full_Analysis;
2050 Expr : constant Node_Id :=
2051 New_Copy_Tree (Expression (Assoc));
2054 Expander_Mode_Save_And_Set (False);
2055 Full_Analysis := False;
2057 -- Analyze the expression, making sure it is properly
2058 -- attached to the tree before we do the analysis.
2060 Set_Parent (Expr, Parent (Expression (Assoc)));
2063 -- If the expression is a literal, propagate this info
2064 -- to the expression in the association, to enable some
2065 -- optimizations downstream.
2067 if Is_Entity_Name (Expr)
2068 and then Present (Entity (Expr))
2069 and then Ekind (Entity (Expr)) = E_Enumeration_Literal
2072 (Expression (Assoc), Component_Typ);
2075 Full_Analysis := Save_Analysis;
2076 Expander_Mode_Restore;
2078 if Is_Tagged_Type (Etype (Expr)) then
2079 Check_Dynamically_Tagged_Expression
2081 Typ => Component_Type (Etype (N)),
2086 elsif Is_Tagged_Type (Etype (Expression (Assoc))) then
2087 Check_Dynamically_Tagged_Expression
2088 (Expr => Expression (Assoc),
2089 Typ => Component_Type (Etype (N)),
2096 -- If aggregate contains more than one choice then these must be
2097 -- static. Sort them and check that they are contiguous.
2099 if Nb_Discrete_Choices > 1 then
2100 Sort_Case_Table (Table);
2101 Missing_Values := False;
2103 Outer : for J in 1 .. Nb_Discrete_Choices - 1 loop
2104 if Expr_Value (Table (J).Choice_Hi) >=
2105 Expr_Value (Table (J + 1).Choice_Lo)
2108 ("duplicate choice values in array aggregate",
2109 Table (J).Choice_Hi);
2112 elsif not Others_Present then
2113 Hi_Val := Expr_Value (Table (J).Choice_Hi);
2114 Lo_Val := Expr_Value (Table (J + 1).Choice_Lo);
2116 -- If missing values, output error messages
2118 if Lo_Val - Hi_Val > 1 then
2120 -- Header message if not first missing value
2122 if not Missing_Values then
2124 ("missing index value(s) in array aggregate", N);
2125 Missing_Values := True;
2128 -- Output values of missing indexes
2130 Lo_Val := Lo_Val - 1;
2131 Hi_Val := Hi_Val + 1;
2133 -- Enumeration type case
2135 if Is_Enumeration_Type (Index_Typ) then
2138 (Get_Enum_Lit_From_Pos
2139 (Index_Typ, Hi_Val, Loc));
2141 if Lo_Val = Hi_Val then
2142 Error_Msg_N ("\ %", N);
2146 (Get_Enum_Lit_From_Pos
2147 (Index_Typ, Lo_Val, Loc));
2148 Error_Msg_N ("\ % .. %", N);
2151 -- Integer types case
2154 Error_Msg_Uint_1 := Hi_Val;
2156 if Lo_Val = Hi_Val then
2157 Error_Msg_N ("\ ^", N);
2159 Error_Msg_Uint_2 := Lo_Val;
2160 Error_Msg_N ("\ ^ .. ^", N);
2167 if Missing_Values then
2168 Set_Etype (N, Any_Composite);
2173 -- STEP 2 (B): Compute aggregate bounds and min/max choices values
2175 if Nb_Discrete_Choices > 0 then
2176 Choices_Low := Table (1).Choice_Lo;
2177 Choices_High := Table (Nb_Discrete_Choices).Choice_Hi;
2180 -- If Others is present, then bounds of aggregate come from the
2181 -- index constraint (not the choices in the aggregate itself).
2183 if Others_Present then
2184 Get_Index_Bounds (Index_Constr, Aggr_Low, Aggr_High);
2186 -- No others clause present
2189 -- Special processing if others allowed and not present. This
2190 -- means that the bounds of the aggregate come from the index
2191 -- constraint (and the length must match).
2193 if Others_Allowed then
2194 Get_Index_Bounds (Index_Constr, Aggr_Low, Aggr_High);
2196 -- If others allowed, and no others present, then the array
2197 -- should cover all index values. If it does not, we will
2198 -- get a length check warning, but there is two cases where
2199 -- an additional warning is useful:
2201 -- If we have no positional components, and the length is
2202 -- wrong (which we can tell by others being allowed with
2203 -- missing components), and the index type is an enumeration
2204 -- type, then issue appropriate warnings about these missing
2205 -- components. They are only warnings, since the aggregate
2206 -- is fine, it's just the wrong length. We skip this check
2207 -- for standard character types (since there are no literals
2208 -- and it is too much trouble to concoct them), and also if
2209 -- any of the bounds have not-known-at-compile-time values.
2211 -- Another case warranting a warning is when the length is
2212 -- right, but as above we have an index type that is an
2213 -- enumeration, and the bounds do not match. This is a
2214 -- case where dubious sliding is allowed and we generate
2215 -- a warning that the bounds do not match.
2217 if No (Expressions (N))
2218 and then Nkind (Index) = N_Range
2219 and then Is_Enumeration_Type (Etype (Index))
2220 and then not Is_Standard_Character_Type (Etype (Index))
2221 and then Compile_Time_Known_Value (Aggr_Low)
2222 and then Compile_Time_Known_Value (Aggr_High)
2223 and then Compile_Time_Known_Value (Choices_Low)
2224 and then Compile_Time_Known_Value (Choices_High)
2226 -- If any of the expressions or range bounds in choices
2227 -- have semantic errors, then do not attempt further
2228 -- resolution, to prevent cascaded errors.
2230 if Errors_Posted_On_Choices then
2235 ALo : constant Node_Id := Expr_Value_E (Aggr_Low);
2236 AHi : constant Node_Id := Expr_Value_E (Aggr_High);
2237 CLo : constant Node_Id := Expr_Value_E (Choices_Low);
2238 CHi : constant Node_Id := Expr_Value_E (Choices_High);
2243 -- Warning case 1, missing values at start/end. Only
2244 -- do the check if the number of entries is too small.
2246 if (Enumeration_Pos (CHi) - Enumeration_Pos (CLo))
2248 (Enumeration_Pos (AHi) - Enumeration_Pos (ALo))
2251 ("missing index value(s) in array aggregate?", N);
2253 -- Output missing value(s) at start
2255 if Chars (ALo) /= Chars (CLo) then
2258 if Chars (ALo) = Chars (Ent) then
2259 Error_Msg_Name_1 := Chars (ALo);
2260 Error_Msg_N ("\ %?", N);
2262 Error_Msg_Name_1 := Chars (ALo);
2263 Error_Msg_Name_2 := Chars (Ent);
2264 Error_Msg_N ("\ % .. %?", N);
2268 -- Output missing value(s) at end
2270 if Chars (AHi) /= Chars (CHi) then
2273 if Chars (AHi) = Chars (Ent) then
2274 Error_Msg_Name_1 := Chars (Ent);
2275 Error_Msg_N ("\ %?", N);
2277 Error_Msg_Name_1 := Chars (Ent);
2278 Error_Msg_Name_2 := Chars (AHi);
2279 Error_Msg_N ("\ % .. %?", N);
2283 -- Warning case 2, dubious sliding. The First_Subtype
2284 -- test distinguishes between a constrained type where
2285 -- sliding is not allowed (so we will get a warning
2286 -- later that Constraint_Error will be raised), and
2287 -- the unconstrained case where sliding is permitted.
2289 elsif (Enumeration_Pos (CHi) - Enumeration_Pos (CLo))
2291 (Enumeration_Pos (AHi) - Enumeration_Pos (ALo))
2292 and then Chars (ALo) /= Chars (CLo)
2294 not Is_Constrained (First_Subtype (Etype (N)))
2297 ("bounds of aggregate do not match target?", N);
2303 -- If no others, aggregate bounds come from aggregate
2305 Aggr_Low := Choices_Low;
2306 Aggr_High := Choices_High;
2310 -- STEP 3: Process positional components
2313 -- STEP 3 (A): Process positional elements
2315 Expr := First (Expressions (N));
2316 Nb_Elements := Uint_0;
2317 while Present (Expr) loop
2318 Nb_Elements := Nb_Elements + 1;
2320 -- Ada 2005 (AI-231)
2322 if Ada_Version >= Ada_2005
2323 and then Known_Null (Expr)
2325 Check_Can_Never_Be_Null (Etype (N), Expr);
2328 if not Resolve_Aggr_Expr (Expr, Single_Elmt => True) then
2332 -- Check incorrect use of dynamically tagged expression
2334 if Is_Tagged_Type (Etype (Expr)) then
2335 Check_Dynamically_Tagged_Expression
2337 Typ => Component_Type (Etype (N)),
2344 if Others_Present then
2345 Assoc := Last (Component_Associations (N));
2347 -- Ada 2005 (AI-231)
2349 if Ada_Version >= Ada_2005
2350 and then Known_Null (Assoc)
2352 Check_Can_Never_Be_Null (Etype (N), Expression (Assoc));
2355 -- Ada 2005 (AI-287): In case of default initialized component,
2356 -- we delay the resolution to the expansion phase.
2358 if Box_Present (Assoc) then
2360 -- Ada 2005 (AI-287): In case of default initialization of a
2361 -- component the expander will generate calls to the
2362 -- corresponding initialization subprogram. We need to call
2363 -- Resolve_Aggr_Expr to check the rules about
2366 if not Resolve_Aggr_Expr (Assoc, Single_Elmt => False) then
2370 elsif not Resolve_Aggr_Expr (Expression (Assoc),
2371 Single_Elmt => False)
2375 -- Check incorrect use of dynamically tagged expression. The
2376 -- expression of the others choice has not been resolved yet.
2377 -- In order to diagnose the semantic error we create a duplicate
2378 -- tree to analyze it and perform the check.
2382 Save_Analysis : constant Boolean := Full_Analysis;
2383 Expr : constant Node_Id :=
2384 New_Copy_Tree (Expression (Assoc));
2387 Expander_Mode_Save_And_Set (False);
2388 Full_Analysis := False;
2390 Full_Analysis := Save_Analysis;
2391 Expander_Mode_Restore;
2393 if Is_Tagged_Type (Etype (Expr)) then
2394 Check_Dynamically_Tagged_Expression
2396 Typ => Component_Type (Etype (N)),
2403 -- STEP 3 (B): Compute the aggregate bounds
2405 if Others_Present then
2406 Get_Index_Bounds (Index_Constr, Aggr_Low, Aggr_High);
2409 if Others_Allowed then
2410 Get_Index_Bounds (Index_Constr, Aggr_Low, Discard);
2412 Aggr_Low := Index_Typ_Low;
2415 Aggr_High := Add (Nb_Elements - 1, To => Aggr_Low);
2416 Check_Bound (Index_Base_High, Aggr_High);
2420 -- STEP 4: Perform static aggregate checks and save the bounds
2424 Check_Bounds (Index_Typ_Low, Index_Typ_High, Aggr_Low, Aggr_High);
2425 Check_Bounds (Index_Base_Low, Index_Base_High, Aggr_Low, Aggr_High);
2429 if Others_Present and then Nb_Discrete_Choices > 0 then
2430 Check_Bounds (Aggr_Low, Aggr_High, Choices_Low, Choices_High);
2431 Check_Bounds (Index_Typ_Low, Index_Typ_High,
2432 Choices_Low, Choices_High);
2433 Check_Bounds (Index_Base_Low, Index_Base_High,
2434 Choices_Low, Choices_High);
2438 elsif Others_Present and then Nb_Elements > 0 then
2439 Check_Length (Aggr_Low, Aggr_High, Nb_Elements);
2440 Check_Length (Index_Typ_Low, Index_Typ_High, Nb_Elements);
2441 Check_Length (Index_Base_Low, Index_Base_High, Nb_Elements);
2444 if Raises_Constraint_Error (Aggr_Low)
2445 or else Raises_Constraint_Error (Aggr_High)
2447 Set_Raises_Constraint_Error (N);
2450 Aggr_Low := Duplicate_Subexpr (Aggr_Low);
2452 -- Do not duplicate Aggr_High if Aggr_High = Aggr_Low + Nb_Elements
2453 -- since the addition node returned by Add is not yet analyzed. Attach
2454 -- to tree and analyze first. Reset analyzed flag to ensure it will get
2455 -- analyzed when it is a literal bound whose type must be properly set.
2457 if Others_Present or else Nb_Discrete_Choices > 0 then
2458 Aggr_High := Duplicate_Subexpr (Aggr_High);
2460 if Etype (Aggr_High) = Universal_Integer then
2461 Set_Analyzed (Aggr_High, False);
2465 -- If the aggregate already has bounds attached to it, it means this is
2466 -- a positional aggregate created as an optimization by
2467 -- Exp_Aggr.Convert_To_Positional, so we don't want to change those
2470 if Present (Aggregate_Bounds (N)) and then not Others_Allowed then
2471 Aggr_Low := Low_Bound (Aggregate_Bounds (N));
2472 Aggr_High := High_Bound (Aggregate_Bounds (N));
2475 Set_Aggregate_Bounds
2476 (N, Make_Range (Loc, Low_Bound => Aggr_Low, High_Bound => Aggr_High));
2478 -- The bounds may contain expressions that must be inserted upwards.
2479 -- Attach them fully to the tree. After analysis, remove side effects
2480 -- from upper bound, if still needed.
2482 Set_Parent (Aggregate_Bounds (N), N);
2483 Analyze_And_Resolve (Aggregate_Bounds (N), Index_Typ);
2484 Check_Unset_Reference (Aggregate_Bounds (N));
2486 if not Others_Present and then Nb_Discrete_Choices = 0 then
2487 Set_High_Bound (Aggregate_Bounds (N),
2488 Duplicate_Subexpr (High_Bound (Aggregate_Bounds (N))));
2492 end Resolve_Array_Aggregate;
2494 ---------------------------------
2495 -- Resolve_Extension_Aggregate --
2496 ---------------------------------
2498 -- There are two cases to consider:
2500 -- a) If the ancestor part is a type mark, the components needed are the
2501 -- difference between the components of the expected type and the
2502 -- components of the given type mark.
2504 -- b) If the ancestor part is an expression, it must be unambiguous, and
2505 -- once we have its type we can also compute the needed components as in
2506 -- the previous case. In both cases, if the ancestor type is not the
2507 -- immediate ancestor, we have to build this ancestor recursively.
2509 -- In both cases, discriminants of the ancestor type do not play a role in
2510 -- the resolution of the needed components, because inherited discriminants
2511 -- cannot be used in a type extension. As a result we can compute
2512 -- independently the list of components of the ancestor type and of the
2515 procedure Resolve_Extension_Aggregate (N : Node_Id; Typ : Entity_Id) is
2516 A : constant Node_Id := Ancestor_Part (N);
2521 function Valid_Limited_Ancestor (Anc : Node_Id) return Boolean;
2522 -- If the type is limited, verify that the ancestor part is a legal
2523 -- expression (aggregate or function call, including 'Input)) that does
2524 -- not require a copy, as specified in 7.5(2).
2526 function Valid_Ancestor_Type return Boolean;
2527 -- Verify that the type of the ancestor part is a non-private ancestor
2528 -- of the expected type, which must be a type extension.
2530 ----------------------------
2531 -- Valid_Limited_Ancestor --
2532 ----------------------------
2534 function Valid_Limited_Ancestor (Anc : Node_Id) return Boolean is
2536 if Is_Entity_Name (Anc)
2537 and then Is_Type (Entity (Anc))
2541 elsif Nkind_In (Anc, N_Aggregate, N_Function_Call) then
2544 elsif Nkind (Anc) = N_Attribute_Reference
2545 and then Attribute_Name (Anc) = Name_Input
2549 elsif Nkind (Anc) = N_Qualified_Expression then
2550 return Valid_Limited_Ancestor (Expression (Anc));
2555 end Valid_Limited_Ancestor;
2557 -------------------------
2558 -- Valid_Ancestor_Type --
2559 -------------------------
2561 function Valid_Ancestor_Type return Boolean is
2562 Imm_Type : Entity_Id;
2565 Imm_Type := Base_Type (Typ);
2566 while Is_Derived_Type (Imm_Type) loop
2567 if Etype (Imm_Type) = Base_Type (A_Type) then
2570 -- The base type of the parent type may appear as a private
2571 -- extension if it is declared as such in a parent unit of the
2572 -- current one. For consistency of the subsequent analysis use
2573 -- the partial view for the ancestor part.
2575 elsif Is_Private_Type (Etype (Imm_Type))
2576 and then Present (Full_View (Etype (Imm_Type)))
2577 and then Base_Type (A_Type) = Full_View (Etype (Imm_Type))
2579 A_Type := Etype (Imm_Type);
2582 -- The parent type may be a private extension. The aggregate is
2583 -- legal if the type of the aggregate is an extension of it that
2584 -- is not a private extension.
2586 elsif Is_Private_Type (A_Type)
2587 and then not Is_Private_Type (Imm_Type)
2588 and then Present (Full_View (A_Type))
2589 and then Base_Type (Full_View (A_Type)) = Etype (Imm_Type)
2594 Imm_Type := Etype (Base_Type (Imm_Type));
2598 -- If previous loop did not find a proper ancestor, report error
2600 Error_Msg_NE ("expect ancestor type of &", A, Typ);
2602 end Valid_Ancestor_Type;
2604 -- Start of processing for Resolve_Extension_Aggregate
2607 -- Analyze the ancestor part and account for the case where it is a
2608 -- parameterless function call.
2611 Check_Parameterless_Call (A);
2613 -- In SPARK, the ancestor part cannot be a type mark
2615 if Is_Entity_Name (A)
2616 and then Is_Type (Entity (A))
2618 Check_SPARK_Restriction ("ancestor part cannot be a type mark", A);
2620 -- AI05-0115: if the ancestor part is a subtype mark, the ancestor
2621 -- must not have unknown discriminants.
2623 if Has_Unknown_Discriminants (Root_Type (Typ)) then
2625 ("aggregate not available for type& whose ancestor "
2626 & "has unknown discriminants", N, Typ);
2630 if not Is_Tagged_Type (Typ) then
2631 Error_Msg_N ("type of extension aggregate must be tagged", N);
2634 elsif Is_Limited_Type (Typ) then
2636 -- Ada 2005 (AI-287): Limited aggregates are allowed
2638 if Ada_Version < Ada_2005 then
2639 Error_Msg_N ("aggregate type cannot be limited", N);
2640 Explain_Limited_Type (Typ, N);
2643 elsif Valid_Limited_Ancestor (A) then
2648 ("limited ancestor part must be aggregate or function call", A);
2651 elsif Is_Class_Wide_Type (Typ) then
2652 Error_Msg_N ("aggregate cannot be of a class-wide type", N);
2656 if Is_Entity_Name (A)
2657 and then Is_Type (Entity (A))
2659 A_Type := Get_Full_View (Entity (A));
2661 if Valid_Ancestor_Type then
2662 Set_Entity (A, A_Type);
2663 Set_Etype (A, A_Type);
2665 Validate_Ancestor_Part (N);
2666 Resolve_Record_Aggregate (N, Typ);
2669 elsif Nkind (A) /= N_Aggregate then
2670 if Is_Overloaded (A) then
2673 Get_First_Interp (A, I, It);
2674 while Present (It.Typ) loop
2675 -- Only consider limited interpretations in the Ada 2005 case
2677 if Is_Tagged_Type (It.Typ)
2678 and then (Ada_Version >= Ada_2005
2679 or else not Is_Limited_Type (It.Typ))
2681 if A_Type /= Any_Type then
2682 Error_Msg_N ("cannot resolve expression", A);
2689 Get_Next_Interp (I, It);
2692 if A_Type = Any_Type then
2693 if Ada_Version >= Ada_2005 then
2694 Error_Msg_N ("ancestor part must be of a tagged type", A);
2697 ("ancestor part must be of a nonlimited tagged type", A);
2704 A_Type := Etype (A);
2707 if Valid_Ancestor_Type then
2708 Resolve (A, A_Type);
2709 Check_Unset_Reference (A);
2710 Check_Non_Static_Context (A);
2712 -- The aggregate is illegal if the ancestor expression is a call
2713 -- to a function with a limited unconstrained result, unless the
2714 -- type of the aggregate is a null extension. This restriction
2715 -- was added in AI05-67 to simplify implementation.
2717 if Nkind (A) = N_Function_Call
2718 and then Is_Limited_Type (A_Type)
2719 and then not Is_Null_Extension (Typ)
2720 and then not Is_Constrained (A_Type)
2723 ("type of limited ancestor part must be constrained", A);
2725 -- Reject the use of CPP constructors that leave objects partially
2726 -- initialized. For example:
2728 -- type CPP_Root is tagged limited record ...
2729 -- pragma Import (CPP, CPP_Root);
2731 -- type CPP_DT is new CPP_Root and Iface ...
2732 -- pragma Import (CPP, CPP_DT);
2734 -- type Ada_DT is new CPP_DT with ...
2736 -- Obj : Ada_DT := Ada_DT'(New_CPP_Root with others => <>);
2738 -- Using the constructor of CPP_Root the slots of the dispatch
2739 -- table of CPP_DT cannot be set, and the secondary tag of
2740 -- CPP_DT is unknown.
2742 elsif Nkind (A) = N_Function_Call
2743 and then Is_CPP_Constructor_Call (A)
2744 and then Enclosing_CPP_Parent (Typ) /= A_Type
2747 ("?must use 'C'P'P constructor for type &", A,
2748 Enclosing_CPP_Parent (Typ));
2750 -- The following call is not needed if the previous warning
2751 -- is promoted to an error.
2753 Resolve_Record_Aggregate (N, Typ);
2755 elsif Is_Class_Wide_Type (Etype (A))
2756 and then Nkind (Original_Node (A)) = N_Function_Call
2758 -- If the ancestor part is a dispatching call, it appears
2759 -- statically to be a legal ancestor, but it yields any member
2760 -- of the class, and it is not possible to determine whether
2761 -- it is an ancestor of the extension aggregate (much less
2762 -- which ancestor). It is not possible to determine the
2763 -- components of the extension part.
2765 -- This check implements AI-306, which in fact was motivated by
2766 -- an AdaCore query to the ARG after this test was added.
2768 Error_Msg_N ("ancestor part must be statically tagged", A);
2770 Resolve_Record_Aggregate (N, Typ);
2775 Error_Msg_N ("no unique type for this aggregate", A);
2777 end Resolve_Extension_Aggregate;
2779 ------------------------------
2780 -- Resolve_Record_Aggregate --
2781 ------------------------------
2783 procedure Resolve_Record_Aggregate (N : Node_Id; Typ : Entity_Id) is
2785 -- N_Component_Association node belonging to the input aggregate N
2788 Positional_Expr : Node_Id;
2789 Component : Entity_Id;
2790 Component_Elmt : Elmt_Id;
2792 Components : constant Elist_Id := New_Elmt_List;
2793 -- Components is the list of the record components whose value must be
2794 -- provided in the aggregate. This list does include discriminants.
2796 New_Assoc_List : constant List_Id := New_List;
2797 New_Assoc : Node_Id;
2798 -- New_Assoc_List is the newly built list of N_Component_Association
2799 -- nodes. New_Assoc is one such N_Component_Association node in it.
2800 -- Note that while Assoc and New_Assoc contain the same kind of nodes,
2801 -- they are used to iterate over two different N_Component_Association
2804 Others_Etype : Entity_Id := Empty;
2805 -- This variable is used to save the Etype of the last record component
2806 -- that takes its value from the others choice. Its purpose is:
2808 -- (a) make sure the others choice is useful
2810 -- (b) make sure the type of all the components whose value is
2811 -- subsumed by the others choice are the same.
2813 -- This variable is updated as a side effect of function Get_Value.
2815 Is_Box_Present : Boolean := False;
2816 Others_Box : Boolean := False;
2817 -- Ada 2005 (AI-287): Variables used in case of default initialization
2818 -- to provide a functionality similar to Others_Etype. Box_Present
2819 -- indicates that the component takes its default initialization;
2820 -- Others_Box indicates that at least one component takes its default
2821 -- initialization. Similar to Others_Etype, they are also updated as a
2822 -- side effect of function Get_Value.
2824 procedure Add_Association
2825 (Component : Entity_Id;
2827 Assoc_List : List_Id;
2828 Is_Box_Present : Boolean := False);
2829 -- Builds a new N_Component_Association node which associates Component
2830 -- to expression Expr and adds it to the association list being built,
2831 -- either New_Assoc_List, or the association being built for an inner
2834 function Discr_Present (Discr : Entity_Id) return Boolean;
2835 -- If aggregate N is a regular aggregate this routine will return True.
2836 -- Otherwise, if N is an extension aggregate, Discr is a discriminant
2837 -- whose value may already have been specified by N's ancestor part.
2838 -- This routine checks whether this is indeed the case and if so returns
2839 -- False, signaling that no value for Discr should appear in N's
2840 -- aggregate part. Also, in this case, the routine appends to
2841 -- New_Assoc_List the discriminant value specified in the ancestor part.
2843 -- If the aggregate is in a context with expansion delayed, it will be
2844 -- reanalyzed. The inherited discriminant values must not be reinserted
2845 -- in the component list to prevent spurious errors, but they must be
2846 -- present on first analysis to build the proper subtype indications.
2847 -- The flag Inherited_Discriminant is used to prevent the re-insertion.
2852 Consider_Others_Choice : Boolean := False)
2854 -- Given a record component stored in parameter Compon, this function
2855 -- returns its value as it appears in the list From, which is a list
2856 -- of N_Component_Association nodes.
2858 -- If no component association has a choice for the searched component,
2859 -- the value provided by the others choice is returned, if there is one,
2860 -- and Consider_Others_Choice is set to true. Otherwise Empty is
2861 -- returned. If there is more than one component association giving a
2862 -- value for the searched record component, an error message is emitted
2863 -- and the first found value is returned.
2865 -- If Consider_Others_Choice is set and the returned expression comes
2866 -- from the others choice, then Others_Etype is set as a side effect.
2867 -- An error message is emitted if the components taking their value from
2868 -- the others choice do not have same type.
2870 procedure Resolve_Aggr_Expr (Expr : Node_Id; Component : Node_Id);
2871 -- Analyzes and resolves expression Expr against the Etype of the
2872 -- Component. This routine also applies all appropriate checks to Expr.
2873 -- It finally saves a Expr in the newly created association list that
2874 -- will be attached to the final record aggregate. Note that if the
2875 -- Parent pointer of Expr is not set then Expr was produced with a
2876 -- New_Copy_Tree or some such.
2878 ---------------------
2879 -- Add_Association --
2880 ---------------------
2882 procedure Add_Association
2883 (Component : Entity_Id;
2885 Assoc_List : List_Id;
2886 Is_Box_Present : Boolean := False)
2889 Choice_List : constant List_Id := New_List;
2890 New_Assoc : Node_Id;
2893 -- If this is a box association the expression is missing, so
2894 -- use the Sloc of the aggregate itself for the new association.
2896 if Present (Expr) then
2902 Append (New_Occurrence_Of (Component, Loc), Choice_List);
2904 Make_Component_Association (Loc,
2905 Choices => Choice_List,
2907 Box_Present => Is_Box_Present);
2908 Append (New_Assoc, Assoc_List);
2909 end Add_Association;
2915 function Discr_Present (Discr : Entity_Id) return Boolean is
2916 Regular_Aggr : constant Boolean := Nkind (N) /= N_Extension_Aggregate;
2921 Comp_Assoc : Node_Id;
2922 Discr_Expr : Node_Id;
2924 Ancestor_Typ : Entity_Id;
2925 Orig_Discr : Entity_Id;
2927 D_Val : Elmt_Id := No_Elmt; -- stop junk warning
2929 Ancestor_Is_Subtyp : Boolean;
2932 if Regular_Aggr then
2936 -- Check whether inherited discriminant values have already been
2937 -- inserted in the aggregate. This will be the case if we are
2938 -- re-analyzing an aggregate whose expansion was delayed.
2940 if Present (Component_Associations (N)) then
2941 Comp_Assoc := First (Component_Associations (N));
2942 while Present (Comp_Assoc) loop
2943 if Inherited_Discriminant (Comp_Assoc) then
2951 Ancestor := Ancestor_Part (N);
2952 Ancestor_Typ := Etype (Ancestor);
2953 Loc := Sloc (Ancestor);
2955 -- For a private type with unknown discriminants, use the underlying
2956 -- record view if it is available.
2958 if Has_Unknown_Discriminants (Ancestor_Typ)
2959 and then Present (Full_View (Ancestor_Typ))
2960 and then Present (Underlying_Record_View (Full_View (Ancestor_Typ)))
2962 Ancestor_Typ := Underlying_Record_View (Full_View (Ancestor_Typ));
2965 Ancestor_Is_Subtyp :=
2966 Is_Entity_Name (Ancestor) and then Is_Type (Entity (Ancestor));
2968 -- If the ancestor part has no discriminants clearly N's aggregate
2969 -- part must provide a value for Discr.
2971 if not Has_Discriminants (Ancestor_Typ) then
2974 -- If the ancestor part is an unconstrained subtype mark then the
2975 -- Discr must be present in N's aggregate part.
2977 elsif Ancestor_Is_Subtyp
2978 and then not Is_Constrained (Entity (Ancestor))
2983 -- Now look to see if Discr was specified in the ancestor part
2985 if Ancestor_Is_Subtyp then
2986 D_Val := First_Elmt (Discriminant_Constraint (Entity (Ancestor)));
2989 Orig_Discr := Original_Record_Component (Discr);
2991 D := First_Discriminant (Ancestor_Typ);
2992 while Present (D) loop
2994 -- If Ancestor has already specified Disc value then insert its
2995 -- value in the final aggregate.
2997 if Original_Record_Component (D) = Orig_Discr then
2998 if Ancestor_Is_Subtyp then
2999 Discr_Expr := New_Copy_Tree (Node (D_Val));
3002 Make_Selected_Component (Loc,
3003 Prefix => Duplicate_Subexpr (Ancestor),
3004 Selector_Name => New_Occurrence_Of (Discr, Loc));
3007 Resolve_Aggr_Expr (Discr_Expr, Discr);
3008 Set_Inherited_Discriminant (Last (New_Assoc_List));
3012 Next_Discriminant (D);
3014 if Ancestor_Is_Subtyp then
3029 Consider_Others_Choice : Boolean := False)
3033 Expr : Node_Id := Empty;
3034 Selector_Name : Node_Id;
3037 Is_Box_Present := False;
3039 if Present (From) then
3040 Assoc := First (From);
3045 while Present (Assoc) loop
3046 Selector_Name := First (Choices (Assoc));
3047 while Present (Selector_Name) loop
3048 if Nkind (Selector_Name) = N_Others_Choice then
3049 if Consider_Others_Choice and then No (Expr) then
3051 -- We need to duplicate the expression for each
3052 -- successive component covered by the others choice.
3053 -- This is redundant if the others_choice covers only
3054 -- one component (small optimization possible???), but
3055 -- indispensable otherwise, because each one must be
3056 -- expanded individually to preserve side-effects.
3058 -- Ada 2005 (AI-287): In case of default initialization
3059 -- of components, we duplicate the corresponding default
3060 -- expression (from the record type declaration). The
3061 -- copy must carry the sloc of the association (not the
3062 -- original expression) to prevent spurious elaboration
3063 -- checks when the default includes function calls.
3065 if Box_Present (Assoc) then
3067 Is_Box_Present := True;
3069 if Expander_Active then
3072 (Expression (Parent (Compon)),
3073 New_Sloc => Sloc (Assoc));
3075 return Expression (Parent (Compon));
3079 if Present (Others_Etype) and then
3080 Base_Type (Others_Etype) /= Base_Type (Etype
3083 Error_Msg_N ("components in OTHERS choice must " &
3084 "have same type", Selector_Name);
3087 Others_Etype := Etype (Compon);
3089 if Expander_Active then
3090 return New_Copy_Tree (Expression (Assoc));
3092 return Expression (Assoc);
3097 elsif Chars (Compon) = Chars (Selector_Name) then
3100 -- Ada 2005 (AI-231)
3102 if Ada_Version >= Ada_2005
3103 and then Known_Null (Expression (Assoc))
3105 Check_Can_Never_Be_Null (Compon, Expression (Assoc));
3108 -- We need to duplicate the expression when several
3109 -- components are grouped together with a "|" choice.
3110 -- For instance "filed1 | filed2 => Expr"
3112 -- Ada 2005 (AI-287)
3114 if Box_Present (Assoc) then
3115 Is_Box_Present := True;
3117 -- Duplicate the default expression of the component
3118 -- from the record type declaration, so a new copy
3119 -- can be attached to the association.
3121 -- Note that we always copy the default expression,
3122 -- even when the association has a single choice, in
3123 -- order to create a proper association for the
3124 -- expanded aggregate.
3126 Expr := New_Copy_Tree (Expression (Parent (Compon)));
3128 -- Component may have no default, in which case the
3129 -- expression is empty and the component is default-
3130 -- initialized, but an association for the component
3131 -- exists, and it is not covered by an others clause.
3136 if Present (Next (Selector_Name)) then
3137 Expr := New_Copy_Tree (Expression (Assoc));
3139 Expr := Expression (Assoc);
3143 Generate_Reference (Compon, Selector_Name, 'm');
3147 ("more than one value supplied for &",
3148 Selector_Name, Compon);
3153 Next (Selector_Name);
3162 -----------------------
3163 -- Resolve_Aggr_Expr --
3164 -----------------------
3166 procedure Resolve_Aggr_Expr (Expr : Node_Id; Component : Node_Id) is
3167 New_C : Entity_Id := Component;
3168 Expr_Type : Entity_Id := Empty;
3170 function Has_Expansion_Delayed (Expr : Node_Id) return Boolean;
3171 -- If the expression is an aggregate (possibly qualified) then its
3172 -- expansion is delayed until the enclosing aggregate is expanded
3173 -- into assignments. In that case, do not generate checks on the
3174 -- expression, because they will be generated later, and will other-
3175 -- wise force a copy (to remove side-effects) that would leave a
3176 -- dynamic-sized aggregate in the code, something that gigi cannot
3180 -- Set to True if the resolved Expr node needs to be relocated
3181 -- when attached to the newly created association list. This node
3182 -- need not be relocated if its parent pointer is not set.
3183 -- In fact in this case Expr is the output of a New_Copy_Tree call.
3184 -- if Relocate is True then we have analyzed the expression node
3185 -- in the original aggregate and hence it needs to be relocated
3186 -- when moved over the new association list.
3188 function Has_Expansion_Delayed (Expr : Node_Id) return Boolean is
3189 Kind : constant Node_Kind := Nkind (Expr);
3191 return (Nkind_In (Kind, N_Aggregate, N_Extension_Aggregate)
3192 and then Present (Etype (Expr))
3193 and then Is_Record_Type (Etype (Expr))
3194 and then Expansion_Delayed (Expr))
3195 or else (Kind = N_Qualified_Expression
3196 and then Has_Expansion_Delayed (Expression (Expr)));
3197 end Has_Expansion_Delayed;
3199 -- Start of processing for Resolve_Aggr_Expr
3202 -- If the type of the component is elementary or the type of the
3203 -- aggregate does not contain discriminants, use the type of the
3204 -- component to resolve Expr.
3206 if Is_Elementary_Type (Etype (Component))
3207 or else not Has_Discriminants (Etype (N))
3209 Expr_Type := Etype (Component);
3211 -- Otherwise we have to pick up the new type of the component from
3212 -- the new constrained subtype of the aggregate. In fact components
3213 -- which are of a composite type might be constrained by a
3214 -- discriminant, and we want to resolve Expr against the subtype were
3215 -- all discriminant occurrences are replaced with their actual value.
3218 New_C := First_Component (Etype (N));
3219 while Present (New_C) loop
3220 if Chars (New_C) = Chars (Component) then
3221 Expr_Type := Etype (New_C);
3225 Next_Component (New_C);
3228 pragma Assert (Present (Expr_Type));
3230 -- For each range in an array type where a discriminant has been
3231 -- replaced with the constraint, check that this range is within
3232 -- the range of the base type. This checks is done in the init
3233 -- proc for regular objects, but has to be done here for
3234 -- aggregates since no init proc is called for them.
3236 if Is_Array_Type (Expr_Type) then
3239 -- Range of the current constrained index in the array
3241 Orig_Index : Node_Id := First_Index (Etype (Component));
3242 -- Range corresponding to the range Index above in the
3243 -- original unconstrained record type. The bounds of this
3244 -- range may be governed by discriminants.
3246 Unconstr_Index : Node_Id := First_Index (Etype (Expr_Type));
3247 -- Range corresponding to the range Index above for the
3248 -- unconstrained array type. This range is needed to apply
3252 Index := First_Index (Expr_Type);
3253 while Present (Index) loop
3254 if Depends_On_Discriminant (Orig_Index) then
3255 Apply_Range_Check (Index, Etype (Unconstr_Index));
3259 Next_Index (Orig_Index);
3260 Next_Index (Unconstr_Index);
3266 -- If the Parent pointer of Expr is not set, Expr is an expression
3267 -- duplicated by New_Tree_Copy (this happens for record aggregates
3268 -- that look like (Field1 | Filed2 => Expr) or (others => Expr)).
3269 -- Such a duplicated expression must be attached to the tree
3270 -- before analysis and resolution to enforce the rule that a tree
3271 -- fragment should never be analyzed or resolved unless it is
3272 -- attached to the current compilation unit.
3274 if No (Parent (Expr)) then
3275 Set_Parent (Expr, N);
3281 Analyze_And_Resolve (Expr, Expr_Type);
3282 Check_Expr_OK_In_Limited_Aggregate (Expr);
3283 Check_Non_Static_Context (Expr);
3284 Check_Unset_Reference (Expr);
3286 -- Check wrong use of class-wide types
3288 if Is_Class_Wide_Type (Etype (Expr)) then
3289 Error_Msg_N ("dynamically tagged expression not allowed", Expr);
3292 if not Has_Expansion_Delayed (Expr) then
3293 Aggregate_Constraint_Checks (Expr, Expr_Type);
3296 if Raises_Constraint_Error (Expr) then
3297 Set_Raises_Constraint_Error (N);
3300 -- If the expression has been marked as requiring a range check,
3301 -- then generate it here.
3303 if Do_Range_Check (Expr) then
3304 Set_Do_Range_Check (Expr, False);
3305 Generate_Range_Check (Expr, Expr_Type, CE_Range_Check_Failed);
3309 Add_Association (New_C, Relocate_Node (Expr), New_Assoc_List);
3311 Add_Association (New_C, Expr, New_Assoc_List);
3313 end Resolve_Aggr_Expr;
3315 -- Start of processing for Resolve_Record_Aggregate
3318 -- A record aggregate is restricted in SPARK:
3319 -- Each named association can have only a single choice.
3320 -- OTHERS cannot be used.
3321 -- Positional and named associations cannot be mixed.
3323 if Present (Component_Associations (N))
3324 and then Present (First (Component_Associations (N)))
3327 if Present (Expressions (N)) then
3328 Check_SPARK_Restriction
3329 ("named association cannot follow positional one",
3330 First (Choices (First (Component_Associations (N)))));
3337 Assoc := First (Component_Associations (N));
3338 while Present (Assoc) loop
3339 if List_Length (Choices (Assoc)) > 1 then
3340 Check_SPARK_Restriction
3341 ("component association in record aggregate must "
3342 & "contain a single choice", Assoc);
3345 if Nkind (First (Choices (Assoc))) = N_Others_Choice then
3346 Check_SPARK_Restriction
3347 ("record aggregate cannot contain OTHERS", Assoc);
3350 Assoc := Next (Assoc);
3355 -- We may end up calling Duplicate_Subexpr on expressions that are
3356 -- attached to New_Assoc_List. For this reason we need to attach it
3357 -- to the tree by setting its parent pointer to N. This parent point
3358 -- will change in STEP 8 below.
3360 Set_Parent (New_Assoc_List, N);
3362 -- STEP 1: abstract type and null record verification
3364 if Is_Abstract_Type (Typ) then
3365 Error_Msg_N ("type of aggregate cannot be abstract", N);
3368 if No (First_Entity (Typ)) and then Null_Record_Present (N) then
3372 elsif Present (First_Entity (Typ))
3373 and then Null_Record_Present (N)
3374 and then not Is_Tagged_Type (Typ)
3376 Error_Msg_N ("record aggregate cannot be null", N);
3379 -- If the type has no components, then the aggregate should either
3380 -- have "null record", or in Ada 2005 it could instead have a single
3381 -- component association given by "others => <>". For Ada 95 we flag
3382 -- an error at this point, but for Ada 2005 we proceed with checking
3383 -- the associations below, which will catch the case where it's not
3384 -- an aggregate with "others => <>". Note that the legality of a <>
3385 -- aggregate for a null record type was established by AI05-016.
3387 elsif No (First_Entity (Typ))
3388 and then Ada_Version < Ada_2005
3390 Error_Msg_N ("record aggregate must be null", N);
3394 -- STEP 2: Verify aggregate structure
3397 Selector_Name : Node_Id;
3398 Bad_Aggregate : Boolean := False;
3401 if Present (Component_Associations (N)) then
3402 Assoc := First (Component_Associations (N));
3407 while Present (Assoc) loop
3408 Selector_Name := First (Choices (Assoc));
3409 while Present (Selector_Name) loop
3410 if Nkind (Selector_Name) = N_Identifier then
3413 elsif Nkind (Selector_Name) = N_Others_Choice then
3414 if Selector_Name /= First (Choices (Assoc))
3415 or else Present (Next (Selector_Name))
3418 ("OTHERS must appear alone in a choice list",
3422 elsif Present (Next (Assoc)) then
3424 ("OTHERS must appear last in an aggregate",
3428 -- (Ada 2005): If this is an association with a box,
3429 -- indicate that the association need not represent
3432 elsif Box_Present (Assoc) then
3438 ("selector name should be identifier or OTHERS",
3440 Bad_Aggregate := True;
3443 Next (Selector_Name);
3449 if Bad_Aggregate then
3454 -- STEP 3: Find discriminant Values
3457 Discrim : Entity_Id;
3458 Missing_Discriminants : Boolean := False;
3461 if Present (Expressions (N)) then
3462 Positional_Expr := First (Expressions (N));
3464 Positional_Expr := Empty;
3467 -- AI05-0115: if the ancestor part is a subtype mark, the ancestor
3468 -- must npt have unknown discriminants.
3470 if Is_Derived_Type (Typ)
3471 and then Has_Unknown_Discriminants (Root_Type (Typ))
3472 and then Nkind (N) /= N_Extension_Aggregate
3475 ("aggregate not available for type& whose ancestor "
3476 & "has unknown discriminants ", N, Typ);
3479 if Has_Unknown_Discriminants (Typ)
3480 and then Present (Underlying_Record_View (Typ))
3482 Discrim := First_Discriminant (Underlying_Record_View (Typ));
3483 elsif Has_Discriminants (Typ) then
3484 Discrim := First_Discriminant (Typ);
3489 -- First find the discriminant values in the positional components
3491 while Present (Discrim) and then Present (Positional_Expr) loop
3492 if Discr_Present (Discrim) then
3493 Resolve_Aggr_Expr (Positional_Expr, Discrim);
3495 -- Ada 2005 (AI-231)
3497 if Ada_Version >= Ada_2005
3498 and then Known_Null (Positional_Expr)
3500 Check_Can_Never_Be_Null (Discrim, Positional_Expr);
3503 Next (Positional_Expr);
3506 if Present (Get_Value (Discrim, Component_Associations (N))) then
3508 ("more than one value supplied for discriminant&",
3512 Next_Discriminant (Discrim);
3515 -- Find remaining discriminant values, if any, among named components
3517 while Present (Discrim) loop
3518 Expr := Get_Value (Discrim, Component_Associations (N), True);
3520 if not Discr_Present (Discrim) then
3521 if Present (Expr) then
3523 ("more than one value supplied for discriminant&",
3527 elsif No (Expr) then
3529 ("no value supplied for discriminant &", N, Discrim);
3530 Missing_Discriminants := True;
3533 Resolve_Aggr_Expr (Expr, Discrim);
3536 Next_Discriminant (Discrim);
3539 if Missing_Discriminants then
3543 -- At this point and until the beginning of STEP 6, New_Assoc_List
3544 -- contains only the discriminants and their values.
3548 -- STEP 4: Set the Etype of the record aggregate
3550 -- ??? This code is pretty much a copy of Sem_Ch3.Build_Subtype. That
3551 -- routine should really be exported in sem_util or some such and used
3552 -- in sem_ch3 and here rather than have a copy of the code which is a
3553 -- maintenance nightmare.
3555 -- ??? Performance WARNING. The current implementation creates a new
3556 -- itype for all aggregates whose base type is discriminated.
3557 -- This means that for record aggregates nested inside an array
3558 -- aggregate we will create a new itype for each record aggregate
3559 -- if the array component type has discriminants. For large aggregates
3560 -- this may be a problem. What should be done in this case is
3561 -- to reuse itypes as much as possible.
3563 if Has_Discriminants (Typ)
3564 or else (Has_Unknown_Discriminants (Typ)
3565 and then Present (Underlying_Record_View (Typ)))
3567 Build_Constrained_Itype : declare
3568 Loc : constant Source_Ptr := Sloc (N);
3570 Subtyp_Decl : Node_Id;
3573 C : constant List_Id := New_List;
3576 New_Assoc := First (New_Assoc_List);
3577 while Present (New_Assoc) loop
3578 Append (Duplicate_Subexpr (Expression (New_Assoc)), To => C);
3582 if Has_Unknown_Discriminants (Typ)
3583 and then Present (Underlying_Record_View (Typ))
3586 Make_Subtype_Indication (Loc,
3588 New_Occurrence_Of (Underlying_Record_View (Typ), Loc),
3590 Make_Index_Or_Discriminant_Constraint (Loc, C));
3593 Make_Subtype_Indication (Loc,
3595 New_Occurrence_Of (Base_Type (Typ), Loc),
3597 Make_Index_Or_Discriminant_Constraint (Loc, C));
3600 Def_Id := Create_Itype (Ekind (Typ), N);
3603 Make_Subtype_Declaration (Loc,
3604 Defining_Identifier => Def_Id,
3605 Subtype_Indication => Indic);
3606 Set_Parent (Subtyp_Decl, Parent (N));
3608 -- Itypes must be analyzed with checks off (see itypes.ads)
3610 Analyze (Subtyp_Decl, Suppress => All_Checks);
3612 Set_Etype (N, Def_Id);
3613 Check_Static_Discriminated_Subtype
3614 (Def_Id, Expression (First (New_Assoc_List)));
3615 end Build_Constrained_Itype;
3621 -- STEP 5: Get remaining components according to discriminant values
3624 Record_Def : Node_Id;
3625 Parent_Typ : Entity_Id;
3626 Root_Typ : Entity_Id;
3627 Parent_Typ_List : Elist_Id;
3628 Parent_Elmt : Elmt_Id;
3629 Errors_Found : Boolean := False;
3632 function Find_Private_Ancestor return Entity_Id;
3633 -- AI05-0115: Find earlier ancestor in the derivation chain that is
3634 -- derived from a private view. Whether the aggregate is legal
3635 -- depends on the current visibility of the type as well as that
3636 -- of the parent of the ancestor.
3638 ---------------------------
3639 -- Find_Private_Ancestor --
3640 ---------------------------
3642 function Find_Private_Ancestor return Entity_Id is
3647 if Has_Private_Ancestor (Par)
3648 and then not Has_Private_Ancestor (Etype (Base_Type (Par)))
3652 elsif not Is_Derived_Type (Par) then
3656 Par := Etype (Base_Type (Par));
3659 end Find_Private_Ancestor;
3662 if Is_Derived_Type (Typ) and then Is_Tagged_Type (Typ) then
3663 Parent_Typ_List := New_Elmt_List;
3665 -- If this is an extension aggregate, the component list must
3666 -- include all components that are not in the given ancestor type.
3667 -- Otherwise, the component list must include components of all
3668 -- ancestors, starting with the root.
3670 if Nkind (N) = N_Extension_Aggregate then
3671 Root_Typ := Base_Type (Etype (Ancestor_Part (N)));
3674 -- AI05-0115: check legality of aggregate for type with
3675 -- aa private ancestor.
3677 Root_Typ := Root_Type (Typ);
3678 if Has_Private_Ancestor (Typ) then
3680 Ancestor : constant Entity_Id :=
3681 Find_Private_Ancestor;
3682 Ancestor_Unit : constant Entity_Id :=
3683 Cunit_Entity (Get_Source_Unit (Ancestor));
3684 Parent_Unit : constant Entity_Id :=
3686 (Get_Source_Unit (Base_Type (Etype (Ancestor))));
3689 -- check whether we are in a scope that has full view
3690 -- over the private ancestor and its parent. This can
3691 -- only happen if the derivation takes place in a child
3692 -- unit of the unit that declares the parent, and we are
3693 -- in the private part or body of that child unit, else
3694 -- the aggregate is illegal.
3696 if Is_Child_Unit (Ancestor_Unit)
3697 and then Scope (Ancestor_Unit) = Parent_Unit
3698 and then In_Open_Scopes (Scope (Ancestor))
3700 (In_Private_Part (Scope (Ancestor))
3701 or else In_Package_Body (Scope (Ancestor)))
3707 ("type of aggregate has private ancestor&!",
3709 Error_Msg_N ("must use extension aggregate!", N);
3715 Dnode := Declaration_Node (Base_Type (Root_Typ));
3717 -- If we don't get a full declaration, then we have some error
3718 -- which will get signalled later so skip this part. Otherwise
3719 -- gather components of root that apply to the aggregate type.
3720 -- We use the base type in case there is an applicable stored
3721 -- constraint that renames the discriminants of the root.
3723 if Nkind (Dnode) = N_Full_Type_Declaration then
3724 Record_Def := Type_Definition (Dnode);
3725 Gather_Components (Base_Type (Typ),
3726 Component_List (Record_Def),
3727 Governed_By => New_Assoc_List,
3729 Report_Errors => Errors_Found);
3733 Parent_Typ := Base_Type (Typ);
3734 while Parent_Typ /= Root_Typ loop
3735 Prepend_Elmt (Parent_Typ, To => Parent_Typ_List);
3736 Parent_Typ := Etype (Parent_Typ);
3738 if Nkind (Parent (Base_Type (Parent_Typ))) =
3739 N_Private_Type_Declaration
3740 or else Nkind (Parent (Base_Type (Parent_Typ))) =
3741 N_Private_Extension_Declaration
3743 if Nkind (N) /= N_Extension_Aggregate then
3745 ("type of aggregate has private ancestor&!",
3747 Error_Msg_N ("must use extension aggregate!", N);
3750 elsif Parent_Typ /= Root_Typ then
3752 ("ancestor part of aggregate must be private type&",
3753 Ancestor_Part (N), Parent_Typ);
3757 -- The current view of ancestor part may be a private type,
3758 -- while the context type is always non-private.
3760 elsif Is_Private_Type (Root_Typ)
3761 and then Present (Full_View (Root_Typ))
3762 and then Nkind (N) = N_Extension_Aggregate
3764 exit when Base_Type (Full_View (Root_Typ)) = Parent_Typ;
3768 -- Now collect components from all other ancestors, beginning
3769 -- with the current type. If the type has unknown discriminants
3770 -- use the component list of the Underlying_Record_View, which
3771 -- needs to be used for the subsequent expansion of the aggregate
3772 -- into assignments.
3774 Parent_Elmt := First_Elmt (Parent_Typ_List);
3775 while Present (Parent_Elmt) loop
3776 Parent_Typ := Node (Parent_Elmt);
3778 if Has_Unknown_Discriminants (Parent_Typ)
3779 and then Present (Underlying_Record_View (Typ))
3781 Parent_Typ := Underlying_Record_View (Parent_Typ);
3784 Record_Def := Type_Definition (Parent (Base_Type (Parent_Typ)));
3785 Gather_Components (Empty,
3786 Component_List (Record_Extension_Part (Record_Def)),
3787 Governed_By => New_Assoc_List,
3789 Report_Errors => Errors_Found);
3791 Next_Elmt (Parent_Elmt);
3795 Record_Def := Type_Definition (Parent (Base_Type (Typ)));
3797 if Null_Present (Record_Def) then
3800 elsif not Has_Unknown_Discriminants (Typ) then
3801 Gather_Components (Base_Type (Typ),
3802 Component_List (Record_Def),
3803 Governed_By => New_Assoc_List,
3805 Report_Errors => Errors_Found);
3809 (Base_Type (Underlying_Record_View (Typ)),
3810 Component_List (Record_Def),
3811 Governed_By => New_Assoc_List,
3813 Report_Errors => Errors_Found);
3817 if Errors_Found then
3822 -- STEP 6: Find component Values
3825 Component_Elmt := First_Elmt (Components);
3827 -- First scan the remaining positional associations in the aggregate.
3828 -- Remember that at this point Positional_Expr contains the current
3829 -- positional association if any is left after looking for discriminant
3830 -- values in step 3.
3832 while Present (Positional_Expr) and then Present (Component_Elmt) loop
3833 Component := Node (Component_Elmt);
3834 Resolve_Aggr_Expr (Positional_Expr, Component);
3836 -- Ada 2005 (AI-231)
3838 if Ada_Version >= Ada_2005
3839 and then Known_Null (Positional_Expr)
3841 Check_Can_Never_Be_Null (Component, Positional_Expr);
3844 if Present (Get_Value (Component, Component_Associations (N))) then
3846 ("more than one value supplied for Component &", N, Component);
3849 Next (Positional_Expr);
3850 Next_Elmt (Component_Elmt);
3853 if Present (Positional_Expr) then
3855 ("too many components for record aggregate", Positional_Expr);
3858 -- Now scan for the named arguments of the aggregate
3860 while Present (Component_Elmt) loop
3861 Component := Node (Component_Elmt);
3862 Expr := Get_Value (Component, Component_Associations (N), True);
3864 -- Note: The previous call to Get_Value sets the value of the
3865 -- variable Is_Box_Present.
3867 -- Ada 2005 (AI-287): Handle components with default initialization.
3868 -- Note: This feature was originally added to Ada 2005 for limited
3869 -- but it was finally allowed with any type.
3871 if Is_Box_Present then
3872 Check_Box_Component : declare
3873 Ctyp : constant Entity_Id := Etype (Component);
3876 -- If there is a default expression for the aggregate, copy
3877 -- it into a new association.
3879 -- If the component has an initialization procedure (IP) we
3880 -- pass the component to the expander, which will generate
3881 -- the call to such IP.
3883 -- If the component has discriminants, their values must
3884 -- be taken from their subtype. This is indispensable for
3885 -- constraints that are given by the current instance of an
3886 -- enclosing type, to allow the expansion of the aggregate
3887 -- to replace the reference to the current instance by the
3888 -- target object of the aggregate.
3890 if Present (Parent (Component))
3892 Nkind (Parent (Component)) = N_Component_Declaration
3893 and then Present (Expression (Parent (Component)))
3896 New_Copy_Tree (Expression (Parent (Component)),
3897 New_Sloc => Sloc (N));
3900 (Component => Component,
3902 Assoc_List => New_Assoc_List);
3903 Set_Has_Self_Reference (N);
3905 -- A box-defaulted access component gets the value null. Also
3906 -- included are components of private types whose underlying
3907 -- type is an access type. In either case set the type of the
3908 -- literal, for subsequent use in semantic checks.
3910 elsif Present (Underlying_Type (Ctyp))
3911 and then Is_Access_Type (Underlying_Type (Ctyp))
3913 if not Is_Private_Type (Ctyp) then
3914 Expr := Make_Null (Sloc (N));
3915 Set_Etype (Expr, Ctyp);
3917 (Component => Component,
3919 Assoc_List => New_Assoc_List);
3921 -- If the component's type is private with an access type as
3922 -- its underlying type then we have to create an unchecked
3923 -- conversion to satisfy type checking.
3927 Qual_Null : constant Node_Id :=
3928 Make_Qualified_Expression (Sloc (N),
3931 (Underlying_Type (Ctyp), Sloc (N)),
3932 Expression => Make_Null (Sloc (N)));
3934 Convert_Null : constant Node_Id :=
3935 Unchecked_Convert_To
3939 Analyze_And_Resolve (Convert_Null, Ctyp);
3941 (Component => Component,
3942 Expr => Convert_Null,
3943 Assoc_List => New_Assoc_List);
3947 elsif Has_Non_Null_Base_Init_Proc (Ctyp)
3948 or else not Expander_Active
3950 if Is_Record_Type (Ctyp)
3951 and then Has_Discriminants (Ctyp)
3952 and then not Is_Private_Type (Ctyp)
3954 -- We build a partially initialized aggregate with the
3955 -- values of the discriminants and box initialization
3956 -- for the rest, if other components are present.
3957 -- The type of the aggregate is the known subtype of
3958 -- the component. The capture of discriminants must
3959 -- be recursive because subcomponents may be constrained
3960 -- (transitively) by discriminants of enclosing types.
3961 -- For a private type with discriminants, a call to the
3962 -- initialization procedure will be generated, and no
3963 -- subaggregate is needed.
3965 Capture_Discriminants : declare
3966 Loc : constant Source_Ptr := Sloc (N);
3969 procedure Add_Discriminant_Values
3970 (New_Aggr : Node_Id;
3971 Assoc_List : List_Id);
3972 -- The constraint to a component may be given by a
3973 -- discriminant of the enclosing type, in which case
3974 -- we have to retrieve its value, which is part of the
3975 -- enclosing aggregate. Assoc_List provides the
3976 -- discriminant associations of the current type or
3977 -- of some enclosing record.
3979 procedure Propagate_Discriminants
3981 Assoc_List : List_Id);
3982 -- Nested components may themselves be discriminated
3983 -- types constrained by outer discriminants, whose
3984 -- values must be captured before the aggregate is
3985 -- expanded into assignments.
3987 -----------------------------
3988 -- Add_Discriminant_Values --
3989 -----------------------------
3991 procedure Add_Discriminant_Values
3992 (New_Aggr : Node_Id;
3993 Assoc_List : List_Id)
3997 Discr_Elmt : Elmt_Id;
3998 Discr_Val : Node_Id;
4002 Discr := First_Discriminant (Etype (New_Aggr));
4005 (Discriminant_Constraint (Etype (New_Aggr)));
4006 while Present (Discr_Elmt) loop
4007 Discr_Val := Node (Discr_Elmt);
4009 -- If the constraint is given by a discriminant
4010 -- it is a discriminant of an enclosing record,
4011 -- and its value has already been placed in the
4012 -- association list.
4014 if Is_Entity_Name (Discr_Val)
4016 Ekind (Entity (Discr_Val)) = E_Discriminant
4018 Val := Entity (Discr_Val);
4020 Assoc := First (Assoc_List);
4021 while Present (Assoc) loop
4023 (Entity (First (Choices (Assoc))))
4025 Entity (First (Choices (Assoc)))
4028 Discr_Val := Expression (Assoc);
4036 (Discr, New_Copy_Tree (Discr_Val),
4037 Component_Associations (New_Aggr));
4039 -- If the discriminant constraint is a current
4040 -- instance, mark the current aggregate so that
4041 -- the self-reference can be expanded later.
4043 if Nkind (Discr_Val) = N_Attribute_Reference
4044 and then Is_Entity_Name (Prefix (Discr_Val))
4045 and then Is_Type (Entity (Prefix (Discr_Val)))
4046 and then Etype (N) =
4047 Entity (Prefix (Discr_Val))
4049 Set_Has_Self_Reference (N);
4052 Next_Elmt (Discr_Elmt);
4053 Next_Discriminant (Discr);
4055 end Add_Discriminant_Values;
4057 ------------------------------
4058 -- Propagate_Discriminants --
4059 ------------------------------
4061 procedure Propagate_Discriminants
4063 Assoc_List : List_Id)
4065 Aggr_Type : constant Entity_Id :=
4066 Base_Type (Etype (Aggr));
4067 Def_Node : constant Node_Id :=
4069 (Declaration_Node (Aggr_Type));
4072 Comp_Elmt : Elmt_Id;
4073 Components : constant Elist_Id := New_Elmt_List;
4074 Needs_Box : Boolean := False;
4077 procedure Process_Component (Comp : Entity_Id);
4078 -- Add one component with a box association to the
4079 -- inner aggregate, and recurse if component is
4080 -- itself composite.
4082 ------------------------
4083 -- Process_Component --
4084 ------------------------
4086 procedure Process_Component (Comp : Entity_Id) is
4087 T : constant Entity_Id := Etype (Comp);
4091 if Is_Record_Type (T)
4092 and then Has_Discriminants (T)
4095 Make_Aggregate (Loc, New_List, New_List);
4096 Set_Etype (New_Aggr, T);
4099 Component_Associations (Aggr));
4101 -- Collect discriminant values and recurse
4103 Add_Discriminant_Values
4104 (New_Aggr, Assoc_List);
4105 Propagate_Discriminants
4106 (New_Aggr, Assoc_List);
4111 end Process_Component;
4113 -- Start of processing for Propagate_Discriminants
4116 -- The component type may be a variant type, so
4117 -- collect the components that are ruled by the
4118 -- known values of the discriminants. Their values
4119 -- have already been inserted into the component
4120 -- list of the current aggregate.
4122 if Nkind (Def_Node) = N_Record_Definition
4124 Present (Component_List (Def_Node))
4127 (Variant_Part (Component_List (Def_Node)))
4129 Gather_Components (Aggr_Type,
4130 Component_List (Def_Node),
4131 Governed_By => Component_Associations (Aggr),
4133 Report_Errors => Errors);
4135 Comp_Elmt := First_Elmt (Components);
4136 while Present (Comp_Elmt) loop
4138 Ekind (Node (Comp_Elmt)) /= E_Discriminant
4140 Process_Component (Node (Comp_Elmt));
4143 Next_Elmt (Comp_Elmt);
4146 -- No variant part, iterate over all components
4149 Comp := First_Component (Etype (Aggr));
4150 while Present (Comp) loop
4151 Process_Component (Comp);
4152 Next_Component (Comp);
4158 (Make_Component_Association (Loc,
4160 New_List (Make_Others_Choice (Loc)),
4161 Expression => Empty,
4162 Box_Present => True),
4163 Component_Associations (Aggr));
4165 end Propagate_Discriminants;
4167 -- Start of processing for Capture_Discriminants
4170 Expr := Make_Aggregate (Loc, New_List, New_List);
4171 Set_Etype (Expr, Ctyp);
4173 -- If the enclosing type has discriminants, they have
4174 -- been collected in the aggregate earlier, and they
4175 -- may appear as constraints of subcomponents.
4177 -- Similarly if this component has discriminants, they
4178 -- might in turn be propagated to their components.
4180 if Has_Discriminants (Typ) then
4181 Add_Discriminant_Values (Expr, New_Assoc_List);
4182 Propagate_Discriminants (Expr, New_Assoc_List);
4184 elsif Has_Discriminants (Ctyp) then
4185 Add_Discriminant_Values
4186 (Expr, Component_Associations (Expr));
4187 Propagate_Discriminants
4188 (Expr, Component_Associations (Expr));
4195 -- If the type has additional components, create
4196 -- an OTHERS box association for them.
4198 Comp := First_Component (Ctyp);
4199 while Present (Comp) loop
4200 if Ekind (Comp) = E_Component then
4201 if not Is_Record_Type (Etype (Comp)) then
4203 (Make_Component_Association (Loc,
4206 (Make_Others_Choice (Loc)),
4207 Expression => Empty,
4208 Box_Present => True),
4209 Component_Associations (Expr));
4214 Next_Component (Comp);
4220 (Component => Component,
4222 Assoc_List => New_Assoc_List);
4223 end Capture_Discriminants;
4227 (Component => Component,
4229 Assoc_List => New_Assoc_List,
4230 Is_Box_Present => True);
4233 -- Otherwise we only need to resolve the expression if the
4234 -- component has partially initialized values (required to
4235 -- expand the corresponding assignments and run-time checks).
4237 elsif Present (Expr)
4238 and then Is_Partially_Initialized_Type (Ctyp)
4240 Resolve_Aggr_Expr (Expr, Component);
4242 end Check_Box_Component;
4244 elsif No (Expr) then
4246 -- Ignore hidden components associated with the position of the
4247 -- interface tags: these are initialized dynamically.
4249 if not Present (Related_Type (Component)) then
4251 ("no value supplied for component &!", N, Component);
4255 Resolve_Aggr_Expr (Expr, Component);
4258 Next_Elmt (Component_Elmt);
4261 -- STEP 7: check for invalid components + check type in choice list
4268 -- Type of first component in choice list
4271 if Present (Component_Associations (N)) then
4272 Assoc := First (Component_Associations (N));
4277 Verification : while Present (Assoc) loop
4278 Selectr := First (Choices (Assoc));
4281 if Nkind (Selectr) = N_Others_Choice then
4283 -- Ada 2005 (AI-287): others choice may have expression or box
4285 if No (Others_Etype)
4286 and then not Others_Box
4289 ("OTHERS must represent at least one component", Selectr);
4295 while Present (Selectr) loop
4296 New_Assoc := First (New_Assoc_List);
4297 while Present (New_Assoc) loop
4298 Component := First (Choices (New_Assoc));
4300 if Chars (Selectr) = Chars (Component) then
4302 Check_Identifier (Selectr, Entity (Component));
4311 -- If no association, this is not a legal component of
4312 -- of the type in question, except if its association
4313 -- is provided with a box.
4315 if No (New_Assoc) then
4316 if Box_Present (Parent (Selectr)) then
4318 -- This may still be a bogus component with a box. Scan
4319 -- list of components to verify that a component with
4320 -- that name exists.
4326 C := First_Component (Typ);
4327 while Present (C) loop
4328 if Chars (C) = Chars (Selectr) then
4330 -- If the context is an extension aggregate,
4331 -- the component must not be inherited from
4332 -- the ancestor part of the aggregate.
4334 if Nkind (N) /= N_Extension_Aggregate
4336 Scope (Original_Record_Component (C)) /=
4337 Etype (Ancestor_Part (N))
4347 Error_Msg_Node_2 := Typ;
4348 Error_Msg_N ("& is not a component of}", Selectr);
4352 elsif Chars (Selectr) /= Name_uTag
4353 and then Chars (Selectr) /= Name_uParent
4355 if not Has_Discriminants (Typ) then
4356 Error_Msg_Node_2 := Typ;
4357 Error_Msg_N ("& is not a component of}", Selectr);
4360 ("& is not a component of the aggregate subtype",
4364 Check_Misspelled_Component (Components, Selectr);
4367 elsif No (Typech) then
4368 Typech := Base_Type (Etype (Component));
4370 -- AI05-0199: In Ada 2012, several components of anonymous
4371 -- access types can appear in a choice list, as long as the
4372 -- designated types match.
4374 elsif Typech /= Base_Type (Etype (Component)) then
4375 if Ada_Version >= Ada_2012
4376 and then Ekind (Typech) = E_Anonymous_Access_Type
4378 Ekind (Etype (Component)) = E_Anonymous_Access_Type
4379 and then Base_Type (Designated_Type (Typech)) =
4380 Base_Type (Designated_Type (Etype (Component)))
4382 Subtypes_Statically_Match (Typech, (Etype (Component)))
4386 elsif not Box_Present (Parent (Selectr)) then
4388 ("components in choice list must have same type",
4397 end loop Verification;
4400 -- STEP 8: replace the original aggregate
4403 New_Aggregate : constant Node_Id := New_Copy (N);
4406 Set_Expressions (New_Aggregate, No_List);
4407 Set_Etype (New_Aggregate, Etype (N));
4408 Set_Component_Associations (New_Aggregate, New_Assoc_List);
4410 Rewrite (N, New_Aggregate);
4412 end Resolve_Record_Aggregate;
4414 -----------------------------
4415 -- Check_Can_Never_Be_Null --
4416 -----------------------------
4418 procedure Check_Can_Never_Be_Null (Typ : Entity_Id; Expr : Node_Id) is
4419 Comp_Typ : Entity_Id;
4423 (Ada_Version >= Ada_2005
4424 and then Present (Expr)
4425 and then Known_Null (Expr));
4428 when E_Array_Type =>
4429 Comp_Typ := Component_Type (Typ);
4433 Comp_Typ := Etype (Typ);
4439 if Can_Never_Be_Null (Comp_Typ) then
4441 -- Here we know we have a constraint error. Note that we do not use
4442 -- Apply_Compile_Time_Constraint_Error here to the Expr, which might
4443 -- seem the more natural approach. That's because in some cases the
4444 -- components are rewritten, and the replacement would be missed.
4447 (Compile_Time_Constraint_Error
4449 "(Ada 2005) null not allowed in null-excluding component?"),
4450 Make_Raise_Constraint_Error (Sloc (Expr),
4451 Reason => CE_Access_Check_Failed));
4453 -- Set proper type for bogus component (why is this needed???)
4455 Set_Etype (Expr, Comp_Typ);
4456 Set_Analyzed (Expr);
4458 end Check_Can_Never_Be_Null;
4460 ---------------------
4461 -- Sort_Case_Table --
4462 ---------------------
4464 procedure Sort_Case_Table (Case_Table : in out Case_Table_Type) is
4465 L : constant Int := Case_Table'First;
4466 U : constant Int := Case_Table'Last;
4474 T := Case_Table (K + 1);
4478 and then Expr_Value (Case_Table (J - 1).Choice_Lo) >
4479 Expr_Value (T.Choice_Lo)
4481 Case_Table (J) := Case_Table (J - 1);
4485 Case_Table (J) := T;
4488 end Sort_Case_Table;
OSDN Git Service
