1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2016, 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 Aspects; use Aspects;
27 with Atree; use Atree;
28 with Checks; use Checks;
29 with Einfo; use Einfo;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Expander; use Expander;
33 with Exp_Tss; use Exp_Tss;
34 with Exp_Util; use Exp_Util;
35 with Freeze; use Freeze;
36 with Itypes; use Itypes;
38 with Lib.Xref; use Lib.Xref;
39 with Namet; use Namet;
40 with Namet.Sp; use Namet.Sp;
41 with Nmake; use Nmake;
42 with Nlists; use Nlists;
44 with Restrict; use Restrict;
45 with Rident; use Rident;
47 with Sem_Aux; use Sem_Aux;
48 with Sem_Cat; use Sem_Cat;
49 with Sem_Ch3; use Sem_Ch3;
50 with Sem_Ch8; use Sem_Ch8;
51 with Sem_Ch13; use Sem_Ch13;
52 with Sem_Dim; use Sem_Dim;
53 with Sem_Eval; use Sem_Eval;
54 with Sem_Res; use Sem_Res;
55 with Sem_Util; use Sem_Util;
56 with Sem_Type; use Sem_Type;
57 with Sem_Warn; use Sem_Warn;
58 with Sinfo; use Sinfo;
59 with Snames; use Snames;
60 with Stringt; use Stringt;
61 with Stand; use Stand;
62 with Style; use Style;
63 with Targparm; use Targparm;
64 with Tbuild; use Tbuild;
65 with Uintp; use Uintp;
67 package body Sem_Aggr is
69 type Case_Bounds is record
71 -- Low bound of choice. Once we sort the Case_Table, then entries
72 -- will be in order of ascending Choice_Lo values.
75 -- High Bound of choice. The sort does not pay any attention to the
76 -- high bound, so choices 1 .. 4 and 1 .. 5 could be in either order.
79 -- If there are duplicates or missing entries, then in the sorted
80 -- table, this records the highest value among Choice_Hi values
81 -- seen so far, including this entry.
84 -- The node of the choice
87 type Case_Table_Type is array (Nat range <>) of Case_Bounds;
88 -- Table type used by Check_Case_Choices procedure. Entry zero is not
89 -- used (reserved for the sort). Real entries start at one.
91 -----------------------
92 -- Local Subprograms --
93 -----------------------
95 procedure Sort_Case_Table (Case_Table : in out Case_Table_Type);
96 -- Sort the Case Table using the Lower Bound of each Choice as the key. A
97 -- simple insertion sort is used since the choices in a case statement will
98 -- usually be in near sorted order.
100 procedure Check_Can_Never_Be_Null (Typ : Entity_Id; Expr : Node_Id);
101 -- Ada 2005 (AI-231): Check bad usage of null for a component for which
102 -- null exclusion (NOT NULL) is specified. Typ can be an E_Array_Type for
103 -- the array case (the component type of the array will be used) or an
104 -- E_Component/E_Discriminant entity in the record case, in which case the
105 -- type of the component will be used for the test. If Typ is any other
106 -- kind of entity, the call is ignored. Expr is the component node in the
107 -- aggregate which is known to have a null value. A warning message will be
108 -- issued if the component is null excluding.
110 -- It would be better to pass the proper type for Typ ???
112 procedure Check_Expr_OK_In_Limited_Aggregate (Expr : Node_Id);
113 -- Check that Expr is either not limited or else is one of the cases of
114 -- expressions allowed for a limited component association (namely, an
115 -- aggregate, function call, or <> notation). Report error for violations.
116 -- Expression is also OK in an instance or inlining context, because we
117 -- have already pre-analyzed and it is known to be type correct.
119 procedure Check_Qualified_Aggregate (Level : Nat; Expr : Node_Id);
120 -- Given aggregate Expr, check that sub-aggregates of Expr that are nested
121 -- at Level are qualified. If Level = 0, this applies to Expr directly.
122 -- Only issue errors in formal verification mode.
124 function Is_Top_Level_Aggregate (Expr : Node_Id) return Boolean;
125 -- Return True of Expr is an aggregate not contained directly in another
128 ------------------------------------------------------
129 -- Subprograms used for RECORD AGGREGATE Processing --
130 ------------------------------------------------------
132 procedure Resolve_Record_Aggregate (N : Node_Id; Typ : Entity_Id);
133 -- This procedure performs all the semantic checks required for record
134 -- aggregates. Note that for aggregates analysis and resolution go
135 -- hand in hand. Aggregate analysis has been delayed up to here and
136 -- it is done while resolving the aggregate.
138 -- N is the N_Aggregate node.
139 -- Typ is the record type for the aggregate resolution
141 -- While performing the semantic checks, this procedure builds a new
142 -- Component_Association_List where each record field appears alone in a
143 -- Component_Choice_List along with its corresponding expression. The
144 -- record fields in the Component_Association_List appear in the same order
145 -- in which they appear in the record type Typ.
147 -- Once this new Component_Association_List is built and all the semantic
148 -- checks performed, the original aggregate subtree is replaced with the
149 -- new named record aggregate just built. Note that subtree substitution is
150 -- performed with Rewrite so as to be able to retrieve the original
153 -- The aggregate subtree manipulation performed by Resolve_Record_Aggregate
154 -- yields the aggregate format expected by Gigi. Typically, this kind of
155 -- tree manipulations are done in the expander. However, because the
156 -- semantic checks that need to be performed on record aggregates really go
157 -- hand in hand with the record aggregate normalization, the aggregate
158 -- subtree transformation is performed during resolution rather than
159 -- expansion. Had we decided otherwise we would have had to duplicate most
160 -- of the code in the expansion procedure Expand_Record_Aggregate. Note,
161 -- however, that all the expansion concerning aggregates for tagged records
162 -- is done in Expand_Record_Aggregate.
164 -- The algorithm of Resolve_Record_Aggregate proceeds as follows:
166 -- 1. Make sure that the record type against which the record aggregate
167 -- has to be resolved is not abstract. Furthermore if the type is a
168 -- null aggregate make sure the input aggregate N is also null.
170 -- 2. Verify that the structure of the aggregate is that of a record
171 -- aggregate. Specifically, look for component associations and ensure
172 -- that each choice list only has identifiers or the N_Others_Choice
173 -- node. Also make sure that if present, the N_Others_Choice occurs
174 -- last and by itself.
176 -- 3. If Typ contains discriminants, the values for each discriminant is
177 -- looked for. If the record type Typ has variants, we check that the
178 -- expressions corresponding to each discriminant ruling the (possibly
179 -- nested) variant parts of Typ, are static. This allows us to determine
180 -- the variant parts to which the rest of the aggregate must conform.
181 -- The names of discriminants with their values are saved in a new
182 -- association list, New_Assoc_List which is later augmented with the
183 -- names and values of the remaining components in the record type.
185 -- During this phase we also make sure that every discriminant is
186 -- assigned exactly one value. Note that when several values for a given
187 -- discriminant are found, semantic processing continues looking for
188 -- further errors. In this case it's the first discriminant value found
189 -- which we will be recorded.
191 -- IMPORTANT NOTE: For derived tagged types this procedure expects
192 -- First_Discriminant and Next_Discriminant to give the correct list
193 -- of discriminants, in the correct order.
195 -- 4. After all the discriminant values have been gathered, we can set the
196 -- Etype of the record aggregate. If Typ contains no discriminants this
197 -- is straightforward: the Etype of N is just Typ, otherwise a new
198 -- implicit constrained subtype of Typ is built to be the Etype of N.
200 -- 5. Gather the remaining record components according to the discriminant
201 -- values. This involves recursively traversing the record type
202 -- structure to see what variants are selected by the given discriminant
203 -- values. This processing is a little more convoluted if Typ is a
204 -- derived tagged types since we need to retrieve the record structure
205 -- of all the ancestors of Typ.
207 -- 6. After gathering the record components we look for their values in the
208 -- record aggregate and emit appropriate error messages should we not
209 -- find such values or should they be duplicated.
211 -- 7. We then make sure no illegal component names appear in the record
212 -- aggregate and make sure that the type of the record components
213 -- appearing in a same choice list is the same. Finally we ensure that
214 -- the others choice, if present, is used to provide the value of at
215 -- least a record component.
217 -- 8. The original aggregate node is replaced with the new named aggregate
218 -- built in steps 3 through 6, as explained earlier.
220 -- Given the complexity of record aggregate resolution, the primary goal of
221 -- this routine is clarity and simplicity rather than execution and storage
222 -- efficiency. If there are only positional components in the aggregate the
223 -- running time is linear. If there are associations the running time is
224 -- still linear as long as the order of the associations is not too far off
225 -- the order of the components in the record type. If this is not the case
226 -- the running time is at worst quadratic in the size of the association
229 procedure Check_Misspelled_Component
230 (Elements : Elist_Id;
231 Component : Node_Id);
232 -- Give possible misspelling diagnostic if Component is likely to be a
233 -- misspelling of one of the components of the Assoc_List. This is called
234 -- by Resolve_Aggr_Expr after producing an invalid component error message.
236 procedure Check_Static_Discriminated_Subtype (T : Entity_Id; V : Node_Id);
237 -- An optimization: determine whether a discriminated subtype has a static
238 -- constraint, and contains array components whose length is also static,
239 -- either because they are constrained by the discriminant, or because the
240 -- original component bounds are static.
242 -----------------------------------------------------
243 -- Subprograms used for ARRAY AGGREGATE Processing --
244 -----------------------------------------------------
246 function Resolve_Array_Aggregate
249 Index_Constr : Node_Id;
250 Component_Typ : Entity_Id;
251 Others_Allowed : Boolean) return Boolean;
252 -- This procedure performs the semantic checks for an array aggregate.
253 -- True is returned if the aggregate resolution succeeds.
255 -- The procedure works by recursively checking each nested aggregate.
256 -- Specifically, after checking a sub-aggregate nested at the i-th level
257 -- we recursively check all the subaggregates at the i+1-st level (if any).
258 -- Note that for aggregates analysis and resolution go hand in hand.
259 -- Aggregate analysis has been delayed up to here and it is done while
260 -- resolving the aggregate.
262 -- N is the current N_Aggregate node to be checked.
264 -- Index is the index node corresponding to the array sub-aggregate that
265 -- we are currently checking (RM 4.3.3 (8)). Its Etype is the
266 -- corresponding index type (or subtype).
268 -- Index_Constr is the node giving the applicable index constraint if
269 -- any (RM 4.3.3 (10)). It "is a constraint provided by certain
270 -- contexts [...] that can be used to determine the bounds of the array
271 -- value specified by the aggregate". If Others_Allowed below is False
272 -- there is no applicable index constraint and this node is set to Index.
274 -- Component_Typ is the array component type.
276 -- Others_Allowed indicates whether an others choice is allowed
277 -- in the context where the top-level aggregate appeared.
279 -- The algorithm of Resolve_Array_Aggregate proceeds as follows:
281 -- 1. Make sure that the others choice, if present, is by itself and
282 -- appears last in the sub-aggregate. Check that we do not have
283 -- positional and named components in the array sub-aggregate (unless
284 -- the named association is an others choice). Finally if an others
285 -- choice is present, make sure it is allowed in the aggregate context.
287 -- 2. If the array sub-aggregate contains discrete_choices:
289 -- (A) Verify their validity. Specifically verify that:
291 -- (a) If a null range is present it must be the only possible
292 -- choice in the array aggregate.
294 -- (b) Ditto for a non static range.
296 -- (c) Ditto for a non static expression.
298 -- In addition this step analyzes and resolves each discrete_choice,
299 -- making sure that its type is the type of the corresponding Index.
300 -- If we are not at the lowest array aggregate level (in the case of
301 -- multi-dimensional aggregates) then invoke Resolve_Array_Aggregate
302 -- recursively on each component expression. Otherwise, resolve the
303 -- bottom level component expressions against the expected component
304 -- type ONLY IF the component corresponds to a single discrete choice
305 -- which is not an others choice (to see why read the DELAYED
306 -- COMPONENT RESOLUTION below).
308 -- (B) Determine the bounds of the sub-aggregate and lowest and
309 -- highest choice values.
311 -- 3. For positional aggregates:
313 -- (A) Loop over the component expressions either recursively invoking
314 -- Resolve_Array_Aggregate on each of these for multi-dimensional
315 -- array aggregates or resolving the bottom level component
316 -- expressions against the expected component type.
318 -- (B) Determine the bounds of the positional sub-aggregates.
320 -- 4. Try to determine statically whether the evaluation of the array
321 -- sub-aggregate raises Constraint_Error. If yes emit proper
322 -- warnings. The precise checks are the following:
324 -- (A) Check that the index range defined by aggregate bounds is
325 -- compatible with corresponding index subtype.
326 -- We also check against the base type. In fact it could be that
327 -- Low/High bounds of the base type are static whereas those of
328 -- the index subtype are not. Thus if we can statically catch
329 -- a problem with respect to the base type we are guaranteed
330 -- that the same problem will arise with the index subtype
332 -- (B) If we are dealing with a named aggregate containing an others
333 -- choice and at least one discrete choice then make sure the range
334 -- specified by the discrete choices does not overflow the
335 -- aggregate bounds. We also check against the index type and base
336 -- type bounds for the same reasons given in (A).
338 -- (C) If we are dealing with a positional aggregate with an others
339 -- choice make sure the number of positional elements specified
340 -- does not overflow the aggregate bounds. We also check against
341 -- the index type and base type bounds as mentioned in (A).
343 -- Finally construct an N_Range node giving the sub-aggregate bounds.
344 -- Set the Aggregate_Bounds field of the sub-aggregate to be this
345 -- N_Range. The routine Array_Aggr_Subtype below uses such N_Ranges
346 -- to build the appropriate aggregate subtype. Aggregate_Bounds
347 -- information is needed during expansion.
349 -- DELAYED COMPONENT RESOLUTION: The resolution of bottom level component
350 -- expressions in an array aggregate may call Duplicate_Subexpr or some
351 -- other routine that inserts code just outside the outermost aggregate.
352 -- If the array aggregate contains discrete choices or an others choice,
353 -- this may be wrong. Consider for instance the following example.
355 -- type Rec is record
359 -- type Acc_Rec is access Rec;
360 -- Arr : array (1..3) of Acc_Rec := (1 .. 3 => new Rec);
362 -- Then the transformation of "new Rec" that occurs during resolution
363 -- entails the following code modifications
365 -- P7b : constant Acc_Rec := new Rec;
367 -- Arr : array (1..3) of Acc_Rec := (1 .. 3 => P7b);
369 -- This code transformation is clearly wrong, since we need to call
370 -- "new Rec" for each of the 3 array elements. To avoid this problem we
371 -- delay resolution of the components of non positional array aggregates
372 -- to the expansion phase. As an optimization, if the discrete choice
373 -- specifies a single value we do not delay resolution.
375 function Array_Aggr_Subtype (N : Node_Id; Typ : Node_Id) return Entity_Id;
376 -- This routine returns the type or subtype of an array aggregate.
378 -- N is the array aggregate node whose type we return.
380 -- Typ is the context type in which N occurs.
382 -- This routine creates an implicit array subtype whose bounds are
383 -- those defined by the aggregate. When this routine is invoked
384 -- Resolve_Array_Aggregate has already processed aggregate N. Thus the
385 -- Aggregate_Bounds of each sub-aggregate, is an N_Range node giving the
386 -- sub-aggregate bounds. When building the aggregate itype, this function
387 -- traverses the array aggregate N collecting such Aggregate_Bounds and
388 -- constructs the proper array aggregate itype.
390 -- Note that in the case of multidimensional aggregates each inner
391 -- sub-aggregate corresponding to a given array dimension, may provide a
392 -- different bounds. If it is possible to determine statically that
393 -- some sub-aggregates corresponding to the same index do not have the
394 -- same bounds, then a warning is emitted. If such check is not possible
395 -- statically (because some sub-aggregate bounds are dynamic expressions)
396 -- then this job is left to the expander. In all cases the particular
397 -- bounds that this function will chose for a given dimension is the first
398 -- N_Range node for a sub-aggregate corresponding to that dimension.
400 -- Note that the Raises_Constraint_Error flag of an array aggregate
401 -- whose evaluation is determined to raise CE by Resolve_Array_Aggregate,
402 -- is set in Resolve_Array_Aggregate but the aggregate is not
403 -- immediately replaced with a raise CE. In fact, Array_Aggr_Subtype must
404 -- first construct the proper itype for the aggregate (Gigi needs
405 -- this). After constructing the proper itype we will eventually replace
406 -- the top-level aggregate with a raise CE (done in Resolve_Aggregate).
407 -- Of course in cases such as:
409 -- type Arr is array (integer range <>) of Integer;
410 -- A : Arr := (positive range -1 .. 2 => 0);
412 -- The bounds of the aggregate itype are cooked up to look reasonable
413 -- (in this particular case the bounds will be 1 .. 2).
415 procedure Make_String_Into_Aggregate (N : Node_Id);
416 -- A string literal can appear in a context in which a one dimensional
417 -- array of characters is expected. This procedure simply rewrites the
418 -- string as an aggregate, prior to resolution.
420 ------------------------
421 -- Array_Aggr_Subtype --
422 ------------------------
424 function Array_Aggr_Subtype
426 Typ : Entity_Id) return Entity_Id
428 Aggr_Dimension : constant Pos := Number_Dimensions (Typ);
429 -- Number of aggregate index dimensions
431 Aggr_Range : array (1 .. Aggr_Dimension) of Node_Id := (others => Empty);
432 -- Constrained N_Range of each index dimension in our aggregate itype
434 Aggr_Low : array (1 .. Aggr_Dimension) of Node_Id := (others => Empty);
435 Aggr_High : array (1 .. Aggr_Dimension) of Node_Id := (others => Empty);
436 -- Low and High bounds for each index dimension in our aggregate itype
438 Is_Fully_Positional : Boolean := True;
440 procedure Collect_Aggr_Bounds (N : Node_Id; Dim : Pos);
441 -- N is an array (sub-)aggregate. Dim is the dimension corresponding
442 -- to (sub-)aggregate N. This procedure collects and removes the side
443 -- effects of the constrained N_Range nodes corresponding to each index
444 -- dimension of our aggregate itype. These N_Range nodes are collected
445 -- in Aggr_Range above.
447 -- Likewise collect in Aggr_Low & Aggr_High above the low and high
448 -- bounds of each index dimension. If, when collecting, two bounds
449 -- corresponding to the same dimension are static and found to differ,
450 -- then emit a warning, and mark N as raising Constraint_Error.
452 -------------------------
453 -- Collect_Aggr_Bounds --
454 -------------------------
456 procedure Collect_Aggr_Bounds (N : Node_Id; Dim : Pos) is
457 This_Range : constant Node_Id := Aggregate_Bounds (N);
458 -- The aggregate range node of this specific sub-aggregate
460 This_Low : constant Node_Id := Low_Bound (Aggregate_Bounds (N));
461 This_High : constant Node_Id := High_Bound (Aggregate_Bounds (N));
462 -- The aggregate bounds of this specific sub-aggregate
468 Remove_Side_Effects (This_Low, Variable_Ref => True);
469 Remove_Side_Effects (This_High, Variable_Ref => True);
471 -- Collect the first N_Range for a given dimension that you find.
472 -- For a given dimension they must be all equal anyway.
474 if No (Aggr_Range (Dim)) then
475 Aggr_Low (Dim) := This_Low;
476 Aggr_High (Dim) := This_High;
477 Aggr_Range (Dim) := This_Range;
480 if Compile_Time_Known_Value (This_Low) then
481 if not Compile_Time_Known_Value (Aggr_Low (Dim)) then
482 Aggr_Low (Dim) := This_Low;
484 elsif Expr_Value (This_Low) /= Expr_Value (Aggr_Low (Dim)) then
485 Set_Raises_Constraint_Error (N);
486 Error_Msg_Warn := SPARK_Mode /= On;
487 Error_Msg_N ("sub-aggregate low bound mismatch<<", N);
488 Error_Msg_N ("\Constraint_Error [<<", N);
492 if Compile_Time_Known_Value (This_High) then
493 if not Compile_Time_Known_Value (Aggr_High (Dim)) then
494 Aggr_High (Dim) := This_High;
497 Expr_Value (This_High) /= Expr_Value (Aggr_High (Dim))
499 Set_Raises_Constraint_Error (N);
500 Error_Msg_Warn := SPARK_Mode /= On;
501 Error_Msg_N ("sub-aggregate high bound mismatch<<", N);
502 Error_Msg_N ("\Constraint_Error [<<", N);
507 if Dim < Aggr_Dimension then
509 -- Process positional components
511 if Present (Expressions (N)) then
512 Expr := First (Expressions (N));
513 while Present (Expr) loop
514 Collect_Aggr_Bounds (Expr, Dim + 1);
519 -- Process component associations
521 if Present (Component_Associations (N)) then
522 Is_Fully_Positional := False;
524 Assoc := First (Component_Associations (N));
525 while Present (Assoc) loop
526 Expr := Expression (Assoc);
527 Collect_Aggr_Bounds (Expr, Dim + 1);
532 end Collect_Aggr_Bounds;
534 -- Array_Aggr_Subtype variables
537 -- The final itype of the overall aggregate
539 Index_Constraints : constant List_Id := New_List;
540 -- The list of index constraints of the aggregate itype
542 -- Start of processing for Array_Aggr_Subtype
545 -- Make sure that the list of index constraints is properly attached to
546 -- the tree, and then collect the aggregate bounds.
548 Set_Parent (Index_Constraints, N);
549 Collect_Aggr_Bounds (N, 1);
551 -- Build the list of constrained indexes of our aggregate itype
553 for J in 1 .. Aggr_Dimension loop
554 Create_Index : declare
555 Index_Base : constant Entity_Id :=
556 Base_Type (Etype (Aggr_Range (J)));
557 Index_Typ : Entity_Id;
560 -- Construct the Index subtype, and associate it with the range
561 -- construct that generates it.
564 Create_Itype (Subtype_Kind (Ekind (Index_Base)), Aggr_Range (J));
566 Set_Etype (Index_Typ, Index_Base);
568 if Is_Character_Type (Index_Base) then
569 Set_Is_Character_Type (Index_Typ);
572 Set_Size_Info (Index_Typ, (Index_Base));
573 Set_RM_Size (Index_Typ, RM_Size (Index_Base));
574 Set_First_Rep_Item (Index_Typ, First_Rep_Item (Index_Base));
575 Set_Scalar_Range (Index_Typ, Aggr_Range (J));
577 if Is_Discrete_Or_Fixed_Point_Type (Index_Typ) then
578 Set_RM_Size (Index_Typ, UI_From_Int (Minimum_Size (Index_Typ)));
581 Set_Etype (Aggr_Range (J), Index_Typ);
583 Append (Aggr_Range (J), To => Index_Constraints);
587 -- Now build the Itype
589 Itype := Create_Itype (E_Array_Subtype, N);
591 Set_First_Rep_Item (Itype, First_Rep_Item (Typ));
592 Set_Convention (Itype, Convention (Typ));
593 Set_Depends_On_Private (Itype, Has_Private_Component (Typ));
594 Set_Etype (Itype, Base_Type (Typ));
595 Set_Has_Alignment_Clause (Itype, Has_Alignment_Clause (Typ));
596 Set_Is_Aliased (Itype, Is_Aliased (Typ));
597 Set_Depends_On_Private (Itype, Depends_On_Private (Typ));
599 Copy_Suppress_Status (Index_Check, Typ, Itype);
600 Copy_Suppress_Status (Length_Check, Typ, Itype);
602 Set_First_Index (Itype, First (Index_Constraints));
603 Set_Is_Constrained (Itype, True);
604 Set_Is_Internal (Itype, True);
606 -- A simple optimization: purely positional aggregates of static
607 -- components should be passed to gigi unexpanded whenever possible, and
608 -- regardless of the staticness of the bounds themselves. Subsequent
609 -- checks in exp_aggr verify that type is not packed, etc.
611 Set_Size_Known_At_Compile_Time
614 and then Comes_From_Source (N)
615 and then Size_Known_At_Compile_Time (Component_Type (Typ)));
617 -- We always need a freeze node for a packed array subtype, so that we
618 -- can build the Packed_Array_Impl_Type corresponding to the subtype. If
619 -- expansion is disabled, the packed array subtype is not built, and we
620 -- must not generate a freeze node for the type, or else it will appear
621 -- incomplete to gigi.
624 and then not In_Spec_Expression
625 and then Expander_Active
627 Freeze_Itype (Itype, N);
631 end Array_Aggr_Subtype;
633 --------------------------------
634 -- Check_Misspelled_Component --
635 --------------------------------
637 procedure Check_Misspelled_Component
638 (Elements : Elist_Id;
641 Max_Suggestions : constant := 2;
643 Nr_Of_Suggestions : Natural := 0;
644 Suggestion_1 : Entity_Id := Empty;
645 Suggestion_2 : Entity_Id := Empty;
646 Component_Elmt : Elmt_Id;
649 -- All the components of List are matched against Component and a count
650 -- is maintained of possible misspellings. When at the end of the
651 -- analysis there are one or two (not more) possible misspellings,
652 -- these misspellings will be suggested as possible corrections.
654 Component_Elmt := First_Elmt (Elements);
655 while Nr_Of_Suggestions <= Max_Suggestions
656 and then Present (Component_Elmt)
658 if Is_Bad_Spelling_Of
659 (Chars (Node (Component_Elmt)),
662 Nr_Of_Suggestions := Nr_Of_Suggestions + 1;
664 case Nr_Of_Suggestions is
665 when 1 => Suggestion_1 := Node (Component_Elmt);
666 when 2 => Suggestion_2 := Node (Component_Elmt);
671 Next_Elmt (Component_Elmt);
674 -- Report at most two suggestions
676 if Nr_Of_Suggestions = 1 then
677 Error_Msg_NE -- CODEFIX
678 ("\possible misspelling of&", Component, Suggestion_1);
680 elsif Nr_Of_Suggestions = 2 then
681 Error_Msg_Node_2 := Suggestion_2;
682 Error_Msg_NE -- CODEFIX
683 ("\possible misspelling of& or&", Component, Suggestion_1);
685 end Check_Misspelled_Component;
687 ----------------------------------------
688 -- Check_Expr_OK_In_Limited_Aggregate --
689 ----------------------------------------
691 procedure Check_Expr_OK_In_Limited_Aggregate (Expr : Node_Id) is
693 if Is_Limited_Type (Etype (Expr))
694 and then Comes_From_Source (Expr)
696 if In_Instance_Body or else In_Inlined_Body then
699 elsif not OK_For_Limited_Init (Etype (Expr), Expr) then
701 ("initialization not allowed for limited types", Expr);
702 Explain_Limited_Type (Etype (Expr), Expr);
705 end Check_Expr_OK_In_Limited_Aggregate;
707 -------------------------------
708 -- Check_Qualified_Aggregate --
709 -------------------------------
711 procedure Check_Qualified_Aggregate (Level : Nat; Expr : Node_Id) is
717 if Nkind (Parent (Expr)) /= N_Qualified_Expression then
718 Check_SPARK_05_Restriction ("aggregate should be qualified", Expr);
722 Comp_Expr := First (Expressions (Expr));
723 while Present (Comp_Expr) loop
724 if Nkind (Comp_Expr) = N_Aggregate then
725 Check_Qualified_Aggregate (Level - 1, Comp_Expr);
728 Comp_Expr := Next (Comp_Expr);
731 Comp_Assn := First (Component_Associations (Expr));
732 while Present (Comp_Assn) loop
733 Comp_Expr := Expression (Comp_Assn);
735 if Nkind (Comp_Expr) = N_Aggregate then
736 Check_Qualified_Aggregate (Level - 1, Comp_Expr);
739 Comp_Assn := Next (Comp_Assn);
742 end Check_Qualified_Aggregate;
744 ----------------------------------------
745 -- Check_Static_Discriminated_Subtype --
746 ----------------------------------------
748 procedure Check_Static_Discriminated_Subtype (T : Entity_Id; V : Node_Id) is
749 Disc : constant Entity_Id := First_Discriminant (T);
754 if Has_Record_Rep_Clause (T) then
757 elsif Present (Next_Discriminant (Disc)) then
760 elsif Nkind (V) /= N_Integer_Literal then
764 Comp := First_Component (T);
765 while Present (Comp) loop
766 if Is_Scalar_Type (Etype (Comp)) then
769 elsif Is_Private_Type (Etype (Comp))
770 and then Present (Full_View (Etype (Comp)))
771 and then Is_Scalar_Type (Full_View (Etype (Comp)))
775 elsif Is_Array_Type (Etype (Comp)) then
776 if Is_Bit_Packed_Array (Etype (Comp)) then
780 Ind := First_Index (Etype (Comp));
781 while Present (Ind) loop
782 if Nkind (Ind) /= N_Range
783 or else Nkind (Low_Bound (Ind)) /= N_Integer_Literal
784 or else Nkind (High_Bound (Ind)) /= N_Integer_Literal
796 Next_Component (Comp);
799 -- On exit, all components have statically known sizes
801 Set_Size_Known_At_Compile_Time (T);
802 end Check_Static_Discriminated_Subtype;
804 -------------------------
805 -- Is_Others_Aggregate --
806 -------------------------
808 function Is_Others_Aggregate (Aggr : Node_Id) return Boolean is
810 return No (Expressions (Aggr))
812 Nkind (First (Choice_List (First (Component_Associations (Aggr))))) =
814 end Is_Others_Aggregate;
816 ----------------------------
817 -- Is_Top_Level_Aggregate --
818 ----------------------------
820 function Is_Top_Level_Aggregate (Expr : Node_Id) return Boolean is
822 return Nkind (Parent (Expr)) /= N_Aggregate
823 and then (Nkind (Parent (Expr)) /= N_Component_Association
824 or else Nkind (Parent (Parent (Expr))) /= N_Aggregate);
825 end Is_Top_Level_Aggregate;
827 --------------------------------
828 -- Make_String_Into_Aggregate --
829 --------------------------------
831 procedure Make_String_Into_Aggregate (N : Node_Id) is
832 Exprs : constant List_Id := New_List;
833 Loc : constant Source_Ptr := Sloc (N);
834 Str : constant String_Id := Strval (N);
835 Strlen : constant Nat := String_Length (Str);
843 for J in 1 .. Strlen loop
844 C := Get_String_Char (Str, J);
845 Set_Character_Literal_Name (C);
848 Make_Character_Literal (P,
850 Char_Literal_Value => UI_From_CC (C));
851 Set_Etype (C_Node, Any_Character);
852 Append_To (Exprs, C_Node);
855 -- Something special for wide strings???
858 New_N := Make_Aggregate (Loc, Expressions => Exprs);
859 Set_Analyzed (New_N);
860 Set_Etype (New_N, Any_Composite);
863 end Make_String_Into_Aggregate;
865 -----------------------
866 -- Resolve_Aggregate --
867 -----------------------
869 procedure Resolve_Aggregate (N : Node_Id; Typ : Entity_Id) is
870 Loc : constant Source_Ptr := Sloc (N);
871 Pkind : constant Node_Kind := Nkind (Parent (N));
873 Aggr_Subtyp : Entity_Id;
874 -- The actual aggregate subtype. This is not necessarily the same as Typ
875 -- which is the subtype of the context in which the aggregate was found.
878 -- Ignore junk empty aggregate resulting from parser error
880 if No (Expressions (N))
881 and then No (Component_Associations (N))
882 and then not Null_Record_Present (N)
887 -- If the aggregate has box-initialized components, its type must be
888 -- frozen so that initialization procedures can properly be called
889 -- in the resolution that follows. The replacement of boxes with
890 -- initialization calls is properly an expansion activity but it must
891 -- be done during resolution.
894 and then Present (Component_Associations (N))
900 Comp := First (Component_Associations (N));
901 while Present (Comp) loop
902 if Box_Present (Comp) then
903 Insert_Actions (N, Freeze_Entity (Typ, N));
912 -- An unqualified aggregate is restricted in SPARK to:
914 -- An aggregate item inside an aggregate for a multi-dimensional array
916 -- An expression being assigned to an unconstrained array, but only if
917 -- the aggregate specifies a value for OTHERS only.
919 if Nkind (Parent (N)) = N_Qualified_Expression then
920 if Is_Array_Type (Typ) then
921 Check_Qualified_Aggregate (Number_Dimensions (Typ), N);
923 Check_Qualified_Aggregate (1, N);
926 if Is_Array_Type (Typ)
927 and then Nkind (Parent (N)) = N_Assignment_Statement
928 and then not Is_Constrained (Etype (Name (Parent (N))))
930 if not Is_Others_Aggregate (N) then
931 Check_SPARK_05_Restriction
932 ("array aggregate should have only OTHERS", N);
935 elsif Is_Top_Level_Aggregate (N) then
936 Check_SPARK_05_Restriction ("aggregate should be qualified", N);
938 -- The legality of this unqualified aggregate is checked by calling
939 -- Check_Qualified_Aggregate from one of its enclosing aggregate,
940 -- unless one of these already causes an error to be issued.
947 -- Check for aggregates not allowed in configurable run-time mode.
948 -- We allow all cases of aggregates that do not come from source, since
949 -- these are all assumed to be small (e.g. bounds of a string literal).
950 -- We also allow aggregates of types we know to be small.
952 if not Support_Aggregates_On_Target
953 and then Comes_From_Source (N)
954 and then (not Known_Static_Esize (Typ) or else Esize (Typ) > 64)
956 Error_Msg_CRT ("aggregate", N);
959 -- Ada 2005 (AI-287): Limited aggregates allowed
961 -- In an instance, ignore aggregate subcomponents tnat may be limited,
962 -- because they originate in view conflicts. If the original aggregate
963 -- is legal and the actuals are legal, the aggregate itself is legal.
965 if Is_Limited_Type (Typ)
966 and then Ada_Version < Ada_2005
967 and then not In_Instance
969 Error_Msg_N ("aggregate type cannot be limited", N);
970 Explain_Limited_Type (Typ, N);
972 elsif Is_Class_Wide_Type (Typ) then
973 Error_Msg_N ("type of aggregate cannot be class-wide", N);
975 elsif Typ = Any_String
976 or else Typ = Any_Composite
978 Error_Msg_N ("no unique type for aggregate", N);
979 Set_Etype (N, Any_Composite);
981 elsif Is_Array_Type (Typ) and then Null_Record_Present (N) then
982 Error_Msg_N ("null record forbidden in array aggregate", N);
984 elsif Is_Record_Type (Typ) then
985 Resolve_Record_Aggregate (N, Typ);
987 elsif Is_Array_Type (Typ) then
989 -- First a special test, for the case of a positional aggregate of
990 -- characters which can be replaced by a string literal.
992 -- Do not perform this transformation if this was a string literal
993 -- to start with, whose components needed constraint checks, or if
994 -- the component type is non-static, because it will require those
995 -- checks and be transformed back into an aggregate. If the index
996 -- type is not Integer the aggregate may represent a user-defined
997 -- string type but the context might need the original type so we
998 -- do not perform the transformation at this point.
1000 if Number_Dimensions (Typ) = 1
1001 and then Is_Standard_Character_Type (Component_Type (Typ))
1002 and then No (Component_Associations (N))
1003 and then not Is_Limited_Composite (Typ)
1004 and then not Is_Private_Composite (Typ)
1005 and then not Is_Bit_Packed_Array (Typ)
1006 and then Nkind (Original_Node (Parent (N))) /= N_String_Literal
1007 and then Is_OK_Static_Subtype (Component_Type (Typ))
1008 and then Base_Type (Etype (First_Index (Typ))) =
1009 Base_Type (Standard_Integer)
1015 Expr := First (Expressions (N));
1016 while Present (Expr) loop
1017 exit when Nkind (Expr) /= N_Character_Literal;
1024 Expr := First (Expressions (N));
1025 while Present (Expr) loop
1026 Store_String_Char (UI_To_CC (Char_Literal_Value (Expr)));
1030 Rewrite (N, Make_String_Literal (Loc, End_String));
1032 Analyze_And_Resolve (N, Typ);
1038 -- Here if we have a real aggregate to deal with
1040 Array_Aggregate : declare
1041 Aggr_Resolved : Boolean;
1043 Aggr_Typ : constant Entity_Id := Etype (Typ);
1044 -- This is the unconstrained array type, which is the type against
1045 -- which the aggregate is to be resolved. Typ itself is the array
1046 -- type of the context which may not be the same subtype as the
1047 -- subtype for the final aggregate.
1050 -- In the following we determine whether an OTHERS choice is
1051 -- allowed inside the array aggregate. The test checks the context
1052 -- in which the array aggregate occurs. If the context does not
1053 -- permit it, or the aggregate type is unconstrained, an OTHERS
1054 -- choice is not allowed (except that it is always allowed on the
1055 -- right-hand side of an assignment statement; in this case the
1056 -- constrainedness of the type doesn't matter).
1058 -- If expansion is disabled (generic context, or semantics-only
1059 -- mode) actual subtypes cannot be constructed, and the type of an
1060 -- object may be its unconstrained nominal type. However, if the
1061 -- context is an assignment, we assume that OTHERS is allowed,
1062 -- because the target of the assignment will have a constrained
1063 -- subtype when fully compiled.
1065 -- Note that there is no node for Explicit_Actual_Parameter.
1066 -- To test for this context we therefore have to test for node
1067 -- N_Parameter_Association which itself appears only if there is a
1068 -- formal parameter. Consequently we also need to test for
1069 -- N_Procedure_Call_Statement or N_Function_Call.
1071 -- The context may be an N_Reference node, created by expansion.
1072 -- Legality of the others clause was established in the source,
1073 -- so the context is legal.
1075 Set_Etype (N, Aggr_Typ); -- May be overridden later on
1077 if Pkind = N_Assignment_Statement
1078 or else (Is_Constrained (Typ)
1080 (Pkind = N_Parameter_Association or else
1081 Pkind = N_Function_Call or else
1082 Pkind = N_Procedure_Call_Statement or else
1083 Pkind = N_Generic_Association or else
1084 Pkind = N_Formal_Object_Declaration or else
1085 Pkind = N_Simple_Return_Statement or else
1086 Pkind = N_Object_Declaration or else
1087 Pkind = N_Component_Declaration or else
1088 Pkind = N_Parameter_Specification or else
1089 Pkind = N_Qualified_Expression or else
1090 Pkind = N_Reference or else
1091 Pkind = N_Aggregate or else
1092 Pkind = N_Extension_Aggregate or else
1093 Pkind = N_Component_Association))
1096 Resolve_Array_Aggregate
1098 Index => First_Index (Aggr_Typ),
1099 Index_Constr => First_Index (Typ),
1100 Component_Typ => Component_Type (Typ),
1101 Others_Allowed => True);
1104 Resolve_Array_Aggregate
1106 Index => First_Index (Aggr_Typ),
1107 Index_Constr => First_Index (Aggr_Typ),
1108 Component_Typ => Component_Type (Typ),
1109 Others_Allowed => False);
1112 if not Aggr_Resolved then
1114 -- A parenthesized expression may have been intended as an
1115 -- aggregate, leading to a type error when analyzing the
1116 -- component. This can also happen for a nested component
1117 -- (see Analyze_Aggr_Expr).
1119 if Paren_Count (N) > 0 then
1121 ("positional aggregate cannot have one component", N);
1124 Aggr_Subtyp := Any_Composite;
1127 Aggr_Subtyp := Array_Aggr_Subtype (N, Typ);
1130 Set_Etype (N, Aggr_Subtyp);
1131 end Array_Aggregate;
1133 elsif Is_Private_Type (Typ)
1134 and then Present (Full_View (Typ))
1135 and then (In_Inlined_Body or In_Instance_Body)
1136 and then Is_Composite_Type (Full_View (Typ))
1138 Resolve (N, Full_View (Typ));
1141 Error_Msg_N ("illegal context for aggregate", N);
1144 -- If we can determine statically that the evaluation of the aggregate
1145 -- raises Constraint_Error, then replace the aggregate with an
1146 -- N_Raise_Constraint_Error node, but set the Etype to the right
1147 -- aggregate subtype. Gigi needs this.
1149 if Raises_Constraint_Error (N) then
1150 Aggr_Subtyp := Etype (N);
1152 Make_Raise_Constraint_Error (Loc, Reason => CE_Range_Check_Failed));
1153 Set_Raises_Constraint_Error (N);
1154 Set_Etype (N, Aggr_Subtyp);
1158 Check_Function_Writable_Actuals (N);
1159 end Resolve_Aggregate;
1161 -----------------------------
1162 -- Resolve_Array_Aggregate --
1163 -----------------------------
1165 function Resolve_Array_Aggregate
1168 Index_Constr : Node_Id;
1169 Component_Typ : Entity_Id;
1170 Others_Allowed : Boolean) return Boolean
1172 Loc : constant Source_Ptr := Sloc (N);
1174 Failure : constant Boolean := False;
1175 Success : constant Boolean := True;
1177 Index_Typ : constant Entity_Id := Etype (Index);
1178 Index_Typ_Low : constant Node_Id := Type_Low_Bound (Index_Typ);
1179 Index_Typ_High : constant Node_Id := Type_High_Bound (Index_Typ);
1180 -- The type of the index corresponding to the array sub-aggregate along
1181 -- with its low and upper bounds.
1183 Index_Base : constant Entity_Id := Base_Type (Index_Typ);
1184 Index_Base_Low : constant Node_Id := Type_Low_Bound (Index_Base);
1185 Index_Base_High : constant Node_Id := Type_High_Bound (Index_Base);
1186 -- Ditto for the base type
1188 Others_Present : Boolean := False;
1190 Nb_Choices : Nat := 0;
1191 -- Contains the overall number of named choices in this sub-aggregate
1193 function Add (Val : Uint; To : Node_Id) return Node_Id;
1194 -- Creates a new expression node where Val is added to expression To.
1195 -- Tries to constant fold whenever possible. To must be an already
1196 -- analyzed expression.
1198 procedure Check_Bound (BH : Node_Id; AH : in out Node_Id);
1199 -- Checks that AH (the upper bound of an array aggregate) is less than
1200 -- or equal to BH (the upper bound of the index base type). If the check
1201 -- fails, a warning is emitted, the Raises_Constraint_Error flag of N is
1202 -- set, and AH is replaced with a duplicate of BH.
1204 procedure Check_Bounds (L, H : Node_Id; AL, AH : Node_Id);
1205 -- Checks that range AL .. AH is compatible with range L .. H. Emits a
1206 -- warning if not and sets the Raises_Constraint_Error flag in N.
1208 procedure Check_Length (L, H : Node_Id; Len : Uint);
1209 -- Checks that range L .. H contains at least Len elements. Emits a
1210 -- warning if not and sets the Raises_Constraint_Error flag in N.
1212 function Dynamic_Or_Null_Range (L, H : Node_Id) return Boolean;
1213 -- Returns True if range L .. H is dynamic or null
1215 procedure Get (Value : out Uint; From : Node_Id; OK : out Boolean);
1216 -- Given expression node From, this routine sets OK to False if it
1217 -- cannot statically evaluate From. Otherwise it stores this static
1218 -- value into Value.
1220 function Resolve_Aggr_Expr
1222 Single_Elmt : Boolean) return Boolean;
1223 -- Resolves aggregate expression Expr. Returns False if resolution
1224 -- fails. If Single_Elmt is set to False, the expression Expr may be
1225 -- used to initialize several array aggregate elements (this can happen
1226 -- for discrete choices such as "L .. H => Expr" or the OTHERS choice).
1227 -- In this event we do not resolve Expr unless expansion is disabled.
1228 -- To know why, see the DELAYED COMPONENT RESOLUTION note above.
1230 -- NOTE: In the case of "... => <>", we pass the in the
1231 -- N_Component_Association node as Expr, since there is no Expression in
1232 -- that case, and we need a Sloc for the error message.
1234 procedure Resolve_Iterated_Component_Association
1236 Index_Typ : Entity_Id);
1243 function Add (Val : Uint; To : Node_Id) return Node_Id is
1249 if Raises_Constraint_Error (To) then
1253 -- First test if we can do constant folding
1255 if Compile_Time_Known_Value (To)
1256 or else Nkind (To) = N_Integer_Literal
1258 Expr_Pos := Make_Integer_Literal (Loc, Expr_Value (To) + Val);
1259 Set_Is_Static_Expression (Expr_Pos);
1260 Set_Etype (Expr_Pos, Etype (To));
1261 Set_Analyzed (Expr_Pos, Analyzed (To));
1263 if not Is_Enumeration_Type (Index_Typ) then
1266 -- If we are dealing with enumeration return
1267 -- Index_Typ'Val (Expr_Pos)
1271 Make_Attribute_Reference
1273 Prefix => New_Occurrence_Of (Index_Typ, Loc),
1274 Attribute_Name => Name_Val,
1275 Expressions => New_List (Expr_Pos));
1281 -- If we are here no constant folding possible
1283 if not Is_Enumeration_Type (Index_Base) then
1286 Left_Opnd => Duplicate_Subexpr (To),
1287 Right_Opnd => Make_Integer_Literal (Loc, Val));
1289 -- If we are dealing with enumeration return
1290 -- Index_Typ'Val (Index_Typ'Pos (To) + Val)
1294 Make_Attribute_Reference
1296 Prefix => New_Occurrence_Of (Index_Typ, Loc),
1297 Attribute_Name => Name_Pos,
1298 Expressions => New_List (Duplicate_Subexpr (To)));
1302 Left_Opnd => To_Pos,
1303 Right_Opnd => Make_Integer_Literal (Loc, Val));
1306 Make_Attribute_Reference
1308 Prefix => New_Occurrence_Of (Index_Typ, Loc),
1309 Attribute_Name => Name_Val,
1310 Expressions => New_List (Expr_Pos));
1312 -- If the index type has a non standard representation, the
1313 -- attributes 'Val and 'Pos expand into function calls and the
1314 -- resulting expression is considered non-safe for reevaluation
1315 -- by the backend. Relocate it into a constant temporary in order
1316 -- to make it safe for reevaluation.
1318 if Has_Non_Standard_Rep (Etype (N)) then
1323 Def_Id := Make_Temporary (Loc, 'R', Expr);
1324 Set_Etype (Def_Id, Index_Typ);
1326 Make_Object_Declaration (Loc,
1327 Defining_Identifier => Def_Id,
1328 Object_Definition =>
1329 New_Occurrence_Of (Index_Typ, Loc),
1330 Constant_Present => True,
1331 Expression => Relocate_Node (Expr)));
1333 Expr := New_Occurrence_Of (Def_Id, Loc);
1345 procedure Check_Bound (BH : Node_Id; AH : in out Node_Id) is
1353 Get (Value => Val_BH, From => BH, OK => OK_BH);
1354 Get (Value => Val_AH, From => AH, OK => OK_AH);
1356 if OK_BH and then OK_AH and then Val_BH < Val_AH then
1357 Set_Raises_Constraint_Error (N);
1358 Error_Msg_Warn := SPARK_Mode /= On;
1359 Error_Msg_N ("upper bound out of range<<", AH);
1360 Error_Msg_N ("\Constraint_Error [<<", AH);
1362 -- You need to set AH to BH or else in the case of enumerations
1363 -- indexes we will not be able to resolve the aggregate bounds.
1365 AH := Duplicate_Subexpr (BH);
1373 procedure Check_Bounds (L, H : Node_Id; AL, AH : Node_Id) is
1384 pragma Warnings (Off, OK_AL);
1385 pragma Warnings (Off, OK_AH);
1388 if Raises_Constraint_Error (N)
1389 or else Dynamic_Or_Null_Range (AL, AH)
1394 Get (Value => Val_L, From => L, OK => OK_L);
1395 Get (Value => Val_H, From => H, OK => OK_H);
1397 Get (Value => Val_AL, From => AL, OK => OK_AL);
1398 Get (Value => Val_AH, From => AH, OK => OK_AH);
1400 if OK_L and then Val_L > Val_AL then
1401 Set_Raises_Constraint_Error (N);
1402 Error_Msg_Warn := SPARK_Mode /= On;
1403 Error_Msg_N ("lower bound of aggregate out of range<<", N);
1404 Error_Msg_N ("\Constraint_Error [<<", N);
1407 if OK_H and then Val_H < Val_AH then
1408 Set_Raises_Constraint_Error (N);
1409 Error_Msg_Warn := SPARK_Mode /= On;
1410 Error_Msg_N ("upper bound of aggregate out of range<<", N);
1411 Error_Msg_N ("\Constraint_Error [<<", N);
1419 procedure Check_Length (L, H : Node_Id; Len : Uint) is
1429 if Raises_Constraint_Error (N) then
1433 Get (Value => Val_L, From => L, OK => OK_L);
1434 Get (Value => Val_H, From => H, OK => OK_H);
1436 if not OK_L or else not OK_H then
1440 -- If null range length is zero
1442 if Val_L > Val_H then
1443 Range_Len := Uint_0;
1445 Range_Len := Val_H - Val_L + 1;
1448 if Range_Len < Len then
1449 Set_Raises_Constraint_Error (N);
1450 Error_Msg_Warn := SPARK_Mode /= On;
1451 Error_Msg_N ("too many elements<<", N);
1452 Error_Msg_N ("\Constraint_Error [<<", N);
1456 ---------------------------
1457 -- Dynamic_Or_Null_Range --
1458 ---------------------------
1460 function Dynamic_Or_Null_Range (L, H : Node_Id) return Boolean is
1468 Get (Value => Val_L, From => L, OK => OK_L);
1469 Get (Value => Val_H, From => H, OK => OK_H);
1471 return not OK_L or else not OK_H
1472 or else not Is_OK_Static_Expression (L)
1473 or else not Is_OK_Static_Expression (H)
1474 or else Val_L > Val_H;
1475 end Dynamic_Or_Null_Range;
1481 procedure Get (Value : out Uint; From : Node_Id; OK : out Boolean) is
1485 if Compile_Time_Known_Value (From) then
1486 Value := Expr_Value (From);
1488 -- If expression From is something like Some_Type'Val (10) then
1491 elsif Nkind (From) = N_Attribute_Reference
1492 and then Attribute_Name (From) = Name_Val
1493 and then Compile_Time_Known_Value (First (Expressions (From)))
1495 Value := Expr_Value (First (Expressions (From)));
1502 -----------------------
1503 -- Resolve_Aggr_Expr --
1504 -----------------------
1506 function Resolve_Aggr_Expr
1508 Single_Elmt : Boolean) return Boolean
1510 Nxt_Ind : constant Node_Id := Next_Index (Index);
1511 Nxt_Ind_Constr : constant Node_Id := Next_Index (Index_Constr);
1512 -- Index is the current index corresponding to the expression
1514 Resolution_OK : Boolean := True;
1515 -- Set to False if resolution of the expression failed
1518 -- Defend against previous errors
1520 if Nkind (Expr) = N_Error
1521 or else Error_Posted (Expr)
1526 -- If the array type against which we are resolving the aggregate
1527 -- has several dimensions, the expressions nested inside the
1528 -- aggregate must be further aggregates (or strings).
1530 if Present (Nxt_Ind) then
1531 if Nkind (Expr) /= N_Aggregate then
1533 -- A string literal can appear where a one-dimensional array
1534 -- of characters is expected. If the literal looks like an
1535 -- operator, it is still an operator symbol, which will be
1536 -- transformed into a string when analyzed.
1538 if Is_Character_Type (Component_Typ)
1539 and then No (Next_Index (Nxt_Ind))
1540 and then Nkind_In (Expr, N_String_Literal, N_Operator_Symbol)
1542 -- A string literal used in a multidimensional array
1543 -- aggregate in place of the final one-dimensional
1544 -- aggregate must not be enclosed in parentheses.
1546 if Paren_Count (Expr) /= 0 then
1547 Error_Msg_N ("no parenthesis allowed here", Expr);
1550 Make_String_Into_Aggregate (Expr);
1553 Error_Msg_N ("nested array aggregate expected", Expr);
1555 -- If the expression is parenthesized, this may be
1556 -- a missing component association for a 1-aggregate.
1558 if Paren_Count (Expr) > 0 then
1560 ("\if single-component aggregate is intended, "
1561 & "write e.g. (1 ='> ...)", Expr);
1568 -- If it's "... => <>", nothing to resolve
1570 if Nkind (Expr) = N_Component_Association then
1571 pragma Assert (Box_Present (Expr));
1575 -- Ada 2005 (AI-231): Propagate the type to the nested aggregate.
1576 -- Required to check the null-exclusion attribute (if present).
1577 -- This value may be overridden later on.
1579 Set_Etype (Expr, Etype (N));
1581 Resolution_OK := Resolve_Array_Aggregate
1582 (Expr, Nxt_Ind, Nxt_Ind_Constr, Component_Typ, Others_Allowed);
1585 -- If it's "... => <>", nothing to resolve
1587 if Nkind (Expr) = N_Component_Association then
1588 pragma Assert (Box_Present (Expr));
1592 -- Do not resolve the expressions of discrete or others choices
1593 -- unless the expression covers a single component, or the
1594 -- expander is inactive.
1596 -- In SPARK mode, expressions that can perform side-effects will
1597 -- be recognized by the gnat2why back-end, and the whole
1598 -- subprogram will be ignored. So semantic analysis can be
1599 -- performed safely.
1602 or else not Expander_Active
1603 or else In_Spec_Expression
1605 Analyze_And_Resolve (Expr, Component_Typ);
1606 Check_Expr_OK_In_Limited_Aggregate (Expr);
1607 Check_Non_Static_Context (Expr);
1608 Aggregate_Constraint_Checks (Expr, Component_Typ);
1609 Check_Unset_Reference (Expr);
1613 -- If an aggregate component has a type with predicates, an explicit
1614 -- predicate check must be applied, as for an assignment statement,
1615 -- because the aggegate might not be expanded into individual
1616 -- component assignments. If the expression covers several components
1617 -- the analysis and the predicate check take place later.
1619 if Present (Predicate_Function (Component_Typ))
1620 and then Analyzed (Expr)
1622 Apply_Predicate_Check (Expr, Component_Typ);
1625 if Raises_Constraint_Error (Expr)
1626 and then Nkind (Parent (Expr)) /= N_Component_Association
1628 Set_Raises_Constraint_Error (N);
1631 -- If the expression has been marked as requiring a range check,
1632 -- then generate it here. It's a bit odd to be generating such
1633 -- checks in the analyzer, but harmless since Generate_Range_Check
1634 -- does nothing (other than making sure Do_Range_Check is set) if
1635 -- the expander is not active.
1637 if Do_Range_Check (Expr) then
1638 Generate_Range_Check (Expr, Component_Typ, CE_Range_Check_Failed);
1641 return Resolution_OK;
1642 end Resolve_Aggr_Expr;
1644 --------------------------------------------
1645 -- Resolve_Iterated_Component_Association --
1646 --------------------------------------------
1648 procedure Resolve_Iterated_Component_Association
1650 Index_Typ : Entity_Id)
1652 Id : constant Entity_Id := Defining_Identifier (N);
1653 Loc : constant Source_Ptr := Sloc (N);
1660 Choice := First (Discrete_Choices (N));
1662 while Present (Choice) loop
1663 if Nkind (Choice) = N_Others_Choice then
1664 Others_Present := True;
1667 Analyze_And_Resolve (Choice, Index_Typ);
1673 -- Create a scope in which to introduce an index, which is usually
1674 -- visible in the expression for the component, and needed for its
1677 Ent := New_Internal_Entity (E_Loop, Current_Scope, Loc, 'L');
1678 Set_Etype (Ent, Standard_Void_Type);
1679 Set_Parent (Ent, Parent (N));
1681 -- Decorate the index variable in the current scope. The association
1682 -- may have several choices, each one leading to a loop, so we create
1683 -- this variable only once to prevent homonyms in this scope.
1685 if No (Scope (Id)) then
1687 Set_Etype (Id, Index_Typ);
1688 Set_Ekind (Id, E_Variable);
1689 Set_Scope (Id, Ent);
1693 Dummy := Resolve_Aggr_Expr (Expression (N), False);
1695 end Resolve_Iterated_Component_Association;
1704 Aggr_Low : Node_Id := Empty;
1705 Aggr_High : Node_Id := Empty;
1706 -- The actual low and high bounds of this sub-aggregate
1708 Case_Table_Size : Nat;
1709 -- Contains the size of the case table needed to sort aggregate choices
1711 Choices_Low : Node_Id := Empty;
1712 Choices_High : Node_Id := Empty;
1713 -- The lowest and highest discrete choices values for a named aggregate
1715 Delete_Choice : Boolean;
1716 -- Used when replacing a subtype choice with predicate by a list
1718 Nb_Elements : Uint := Uint_0;
1719 -- The number of elements in a positional aggregate
1721 Nb_Discrete_Choices : Nat := 0;
1722 -- The overall number of discrete choices (not counting others choice)
1724 -- Start of processing for Resolve_Array_Aggregate
1727 -- Ignore junk empty aggregate resulting from parser error
1729 if No (Expressions (N))
1730 and then No (Component_Associations (N))
1731 and then not Null_Record_Present (N)
1736 -- STEP 1: make sure the aggregate is correctly formatted
1738 if Present (Component_Associations (N)) then
1739 Assoc := First (Component_Associations (N));
1740 while Present (Assoc) loop
1741 if Nkind (Assoc) = N_Iterated_Component_Association then
1742 Resolve_Iterated_Component_Association (Assoc, Index_Typ);
1745 Choice := First (Choice_List (Assoc));
1746 Delete_Choice := False;
1747 while Present (Choice) loop
1748 if Nkind (Choice) = N_Others_Choice then
1749 Others_Present := True;
1751 if Choice /= First (Choice_List (Assoc))
1752 or else Present (Next (Choice))
1755 ("OTHERS must appear alone in a choice list", Choice);
1759 if Present (Next (Assoc)) then
1761 ("OTHERS must appear last in an aggregate", Choice);
1765 if Ada_Version = Ada_83
1766 and then Assoc /= First (Component_Associations (N))
1767 and then Nkind_In (Parent (N), N_Assignment_Statement,
1768 N_Object_Declaration)
1771 ("(Ada 83) illegal context for OTHERS choice", N);
1774 elsif Is_Entity_Name (Choice) then
1778 E : constant Entity_Id := Entity (Choice);
1784 if Is_Type (E) and then Has_Predicates (E) then
1785 Freeze_Before (N, E);
1787 if Has_Dynamic_Predicate_Aspect (E) then
1789 ("subtype& has dynamic predicate, not allowed "
1790 & "in aggregate choice", Choice, E);
1792 elsif not Is_OK_Static_Subtype (E) then
1794 ("non-static subtype& has predicate, not allowed "
1795 & "in aggregate choice", Choice, E);
1798 -- If the subtype has a static predicate, replace the
1799 -- original choice with the list of individual values
1800 -- covered by the predicate. Do not perform this
1801 -- transformation if we need to preserve the source
1803 -- This should be deferred to expansion time ???
1805 if Present (Static_Discrete_Predicate (E))
1806 and then not ASIS_Mode
1808 Delete_Choice := True;
1811 P := First (Static_Discrete_Predicate (E));
1812 while Present (P) loop
1814 Set_Sloc (C, Sloc (Choice));
1815 Append_To (New_Cs, C);
1819 Insert_List_After (Choice, New_Cs);
1825 Nb_Choices := Nb_Choices + 1;
1828 C : constant Node_Id := Choice;
1833 if Delete_Choice then
1835 Nb_Choices := Nb_Choices - 1;
1836 Delete_Choice := False;
1845 -- At this point we know that the others choice, if present, is by
1846 -- itself and appears last in the aggregate. Check if we have mixed
1847 -- positional and discrete associations (other than the others choice).
1849 if Present (Expressions (N))
1850 and then (Nb_Choices > 1
1851 or else (Nb_Choices = 1 and then not Others_Present))
1854 ("named association cannot follow positional association",
1855 First (Choice_List (First (Component_Associations (N)))));
1859 -- Test for the validity of an others choice if present
1861 if Others_Present and then not Others_Allowed then
1863 ("OTHERS choice not allowed here",
1864 First (Choices (First (Component_Associations (N)))));
1868 -- Protect against cascaded errors
1870 if Etype (Index_Typ) = Any_Type then
1874 -- STEP 2: Process named components
1876 if No (Expressions (N)) then
1877 if Others_Present then
1878 Case_Table_Size := Nb_Choices - 1;
1880 Case_Table_Size := Nb_Choices;
1884 function Empty_Range (A : Node_Id) return Boolean;
1885 -- If an association covers an empty range, some warnings on the
1886 -- expression of the association can be disabled.
1892 function Empty_Range (A : Node_Id) return Boolean is
1893 R : constant Node_Id := First (Choices (A));
1895 return No (Next (R))
1896 and then Nkind (R) = N_Range
1897 and then Compile_Time_Compare
1898 (Low_Bound (R), High_Bound (R), False) = GT;
1905 -- Denote the lowest and highest values in an aggregate choice
1907 S_Low : Node_Id := Empty;
1908 S_High : Node_Id := Empty;
1909 -- if a choice in an aggregate is a subtype indication these
1910 -- denote the lowest and highest values of the subtype
1912 Table : Case_Table_Type (0 .. Case_Table_Size);
1913 -- Used to sort all the different choice values. Entry zero is
1914 -- reserved for sorting purposes.
1916 Single_Choice : Boolean;
1917 -- Set to true every time there is a single discrete choice in a
1918 -- discrete association
1920 Prev_Nb_Discrete_Choices : Nat;
1921 -- Used to keep track of the number of discrete choices in the
1922 -- current association.
1924 Errors_Posted_On_Choices : Boolean := False;
1925 -- Keeps track of whether any choices have semantic errors
1927 -- Start of processing for Step_2
1930 -- STEP 2 (A): Check discrete choices validity
1932 Assoc := First (Component_Associations (N));
1933 while Present (Assoc) loop
1934 Prev_Nb_Discrete_Choices := Nb_Discrete_Choices;
1935 Choice := First (Choice_List (Assoc));
1940 if Nkind (Choice) = N_Others_Choice then
1941 Single_Choice := False;
1944 -- Test for subtype mark without constraint
1946 elsif Is_Entity_Name (Choice) and then
1947 Is_Type (Entity (Choice))
1949 if Base_Type (Entity (Choice)) /= Index_Base then
1951 ("invalid subtype mark in aggregate choice",
1956 -- Case of subtype indication
1958 elsif Nkind (Choice) = N_Subtype_Indication then
1959 Resolve_Discrete_Subtype_Indication (Choice, Index_Base);
1961 if Has_Dynamic_Predicate_Aspect
1962 (Entity (Subtype_Mark (Choice)))
1965 ("subtype& has dynamic predicate, "
1966 & "not allowed in aggregate choice",
1967 Choice, Entity (Subtype_Mark (Choice)));
1970 -- Does the subtype indication evaluation raise CE?
1972 Get_Index_Bounds (Subtype_Mark (Choice), S_Low, S_High);
1973 Get_Index_Bounds (Choice, Low, High);
1974 Check_Bounds (S_Low, S_High, Low, High);
1976 -- Case of range or expression
1979 Resolve (Choice, Index_Base);
1980 Check_Unset_Reference (Choice);
1981 Check_Non_Static_Context (Choice);
1983 -- If semantic errors were posted on the choice, then
1984 -- record that for possible early return from later
1985 -- processing (see handling of enumeration choices).
1987 if Error_Posted (Choice) then
1988 Errors_Posted_On_Choices := True;
1991 -- Do not range check a choice. This check is redundant
1992 -- since this test is already done when we check that the
1993 -- bounds of the array aggregate are within range.
1995 Set_Do_Range_Check (Choice, False);
1997 -- In SPARK, the choice must be static
1999 if not (Is_OK_Static_Expression (Choice)
2000 or else (Nkind (Choice) = N_Range
2001 and then Is_OK_Static_Range (Choice)))
2003 Check_SPARK_05_Restriction
2004 ("choice should be static", Choice);
2008 -- If we could not resolve the discrete choice stop here
2010 if Etype (Choice) = Any_Type then
2013 -- If the discrete choice raises CE get its original bounds
2015 elsif Nkind (Choice) = N_Raise_Constraint_Error then
2016 Set_Raises_Constraint_Error (N);
2017 Get_Index_Bounds (Original_Node (Choice), Low, High);
2019 -- Otherwise get its bounds as usual
2022 Get_Index_Bounds (Choice, Low, High);
2025 if (Dynamic_Or_Null_Range (Low, High)
2026 or else (Nkind (Choice) = N_Subtype_Indication
2028 Dynamic_Or_Null_Range (S_Low, S_High)))
2029 and then Nb_Choices /= 1
2032 ("dynamic or empty choice in aggregate "
2033 & "must be the only choice", Choice);
2037 if not (All_Composite_Constraints_Static (Low)
2038 and then All_Composite_Constraints_Static (High)
2039 and then All_Composite_Constraints_Static (S_Low)
2040 and then All_Composite_Constraints_Static (S_High))
2042 Check_Restriction (No_Dynamic_Sized_Objects, Choice);
2045 Nb_Discrete_Choices := Nb_Discrete_Choices + 1;
2046 Table (Nb_Discrete_Choices).Lo := Low;
2047 Table (Nb_Discrete_Choices).Hi := High;
2048 Table (Nb_Discrete_Choices).Choice := Choice;
2054 -- Check if we have a single discrete choice and whether
2055 -- this discrete choice specifies a single value.
2058 (Nb_Discrete_Choices = Prev_Nb_Discrete_Choices + 1)
2059 and then (Low = High);
2065 -- Ada 2005 (AI-231)
2067 if Ada_Version >= Ada_2005
2068 and then Known_Null (Expression (Assoc))
2069 and then not Empty_Range (Assoc)
2071 Check_Can_Never_Be_Null (Etype (N), Expression (Assoc));
2074 -- Ada 2005 (AI-287): In case of default initialized component
2075 -- we delay the resolution to the expansion phase.
2077 if Box_Present (Assoc) then
2079 -- Ada 2005 (AI-287): In case of default initialization of a
2080 -- component the expander will generate calls to the
2081 -- corresponding initialization subprogram. We need to call
2082 -- Resolve_Aggr_Expr to check the rules about
2085 if not Resolve_Aggr_Expr
2086 (Assoc, Single_Elmt => Single_Choice)
2091 elsif Nkind (Assoc) = N_Iterated_Component_Association then
2092 null; -- handled above, in a loop context.
2094 elsif not Resolve_Aggr_Expr
2095 (Expression (Assoc), Single_Elmt => Single_Choice)
2099 -- Check incorrect use of dynamically tagged expression
2101 -- We differentiate here two cases because the expression may
2102 -- not be decorated. For example, the analysis and resolution
2103 -- of the expression associated with the others choice will be
2104 -- done later with the full aggregate. In such case we
2105 -- duplicate the expression tree to analyze the copy and
2106 -- perform the required check.
2108 elsif not Present (Etype (Expression (Assoc))) then
2110 Save_Analysis : constant Boolean := Full_Analysis;
2111 Expr : constant Node_Id :=
2112 New_Copy_Tree (Expression (Assoc));
2115 Expander_Mode_Save_And_Set (False);
2116 Full_Analysis := False;
2118 -- Analyze the expression, making sure it is properly
2119 -- attached to the tree before we do the analysis.
2121 Set_Parent (Expr, Parent (Expression (Assoc)));
2124 -- Compute its dimensions now, rather than at the end of
2125 -- resolution, because in the case of multidimensional
2126 -- aggregates subsequent expansion may lead to spurious
2129 Check_Expression_Dimensions (Expr, Component_Typ);
2131 -- If the expression is a literal, propagate this info
2132 -- to the expression in the association, to enable some
2133 -- optimizations downstream.
2135 if Is_Entity_Name (Expr)
2136 and then Present (Entity (Expr))
2137 and then Ekind (Entity (Expr)) = E_Enumeration_Literal
2140 (Expression (Assoc), Component_Typ);
2143 Full_Analysis := Save_Analysis;
2144 Expander_Mode_Restore;
2146 if Is_Tagged_Type (Etype (Expr)) then
2147 Check_Dynamically_Tagged_Expression
2149 Typ => Component_Type (Etype (N)),
2154 elsif Is_Tagged_Type (Etype (Expression (Assoc))) then
2155 Check_Dynamically_Tagged_Expression
2156 (Expr => Expression (Assoc),
2157 Typ => Component_Type (Etype (N)),
2164 -- If aggregate contains more than one choice then these must be
2165 -- static. Check for duplicate and missing values.
2167 -- Note: there is duplicated code here wrt Check_Choice_Set in
2168 -- the body of Sem_Case, and it is possible we could just reuse
2169 -- that procedure. To be checked ???
2171 if Nb_Discrete_Choices > 1 then
2172 Check_Choices : declare
2174 -- Location of choice for messages
2178 -- High end of one range and Low end of the next. Should be
2179 -- contiguous if there is no hole in the list of values.
2183 -- End points of duplicated range
2185 Missing_Or_Duplicates : Boolean := False;
2186 -- Set True if missing or duplicate choices found
2188 procedure Output_Bad_Choices (Lo, Hi : Uint; C : Node_Id);
2189 -- Output continuation message with a representation of the
2190 -- bounds (just Lo if Lo = Hi, else Lo .. Hi). C is the
2191 -- choice node where the message is to be posted.
2193 ------------------------
2194 -- Output_Bad_Choices --
2195 ------------------------
2197 procedure Output_Bad_Choices (Lo, Hi : Uint; C : Node_Id) is
2199 -- Enumeration type case
2201 if Is_Enumeration_Type (Index_Typ) then
2203 Chars (Get_Enum_Lit_From_Pos (Index_Typ, Lo, Loc));
2205 Chars (Get_Enum_Lit_From_Pos (Index_Typ, Hi, Loc));
2208 Error_Msg_N ("\\ %!", C);
2210 Error_Msg_N ("\\ % .. %!", C);
2213 -- Integer types case
2216 Error_Msg_Uint_1 := Lo;
2217 Error_Msg_Uint_2 := Hi;
2220 Error_Msg_N ("\\ ^!", C);
2222 Error_Msg_N ("\\ ^ .. ^!", C);
2225 end Output_Bad_Choices;
2227 -- Start of processing for Check_Choices
2230 Sort_Case_Table (Table);
2232 -- First we do a quick linear loop to find out if we have
2233 -- any duplicates or missing entries (usually we have a
2234 -- legal aggregate, so this will get us out quickly).
2236 for J in 1 .. Nb_Discrete_Choices - 1 loop
2237 Hi_Val := Expr_Value (Table (J).Hi);
2238 Lo_Val := Expr_Value (Table (J + 1).Lo);
2241 or else (Lo_Val > Hi_Val + 1
2242 and then not Others_Present)
2244 Missing_Or_Duplicates := True;
2249 -- If we have missing or duplicate entries, first fill in
2250 -- the Highest entries to make life easier in the following
2251 -- loops to detect bad entries.
2253 if Missing_Or_Duplicates then
2254 Table (1).Highest := Expr_Value (Table (1).Hi);
2256 for J in 2 .. Nb_Discrete_Choices loop
2257 Table (J).Highest :=
2259 (Table (J - 1).Highest, Expr_Value (Table (J).Hi));
2262 -- Loop through table entries to find duplicate indexes
2264 for J in 2 .. Nb_Discrete_Choices loop
2265 Lo_Val := Expr_Value (Table (J).Lo);
2266 Hi_Val := Expr_Value (Table (J).Hi);
2268 -- Case where we have duplicates (the lower bound of
2269 -- this choice is less than or equal to the highest
2270 -- high bound found so far).
2272 if Lo_Val <= Table (J - 1).Highest then
2274 -- We move backwards looking for duplicates. We can
2275 -- abandon this loop as soon as we reach a choice
2276 -- highest value that is less than Lo_Val.
2278 for K in reverse 1 .. J - 1 loop
2279 exit when Table (K).Highest < Lo_Val;
2281 -- Here we may have duplicates between entries
2282 -- for K and J. Get range of duplicates.
2285 UI_Max (Lo_Val, Expr_Value (Table (K).Lo));
2287 UI_Min (Hi_Val, Expr_Value (Table (K).Hi));
2289 -- Nothing to do if duplicate range is null
2291 if Lo_Dup > Hi_Dup then
2294 -- Otherwise place proper message. Because
2295 -- of the missing expansion of subtypes with
2296 -- predicates in ASIS mode, do not report
2297 -- spurious overlap errors.
2301 ((Is_Type (Entity (Table (J).Choice))
2302 and then Has_Predicates
2303 (Entity (Table (J).Choice)))
2305 (Is_Type (Entity (Table (K).Choice))
2306 and then Has_Predicates
2307 (Entity (Table (K).Choice))))
2312 -- We place message on later choice, with a
2313 -- line reference to the earlier choice.
2315 if Sloc (Table (J).Choice) <
2316 Sloc (Table (K).Choice)
2318 Choice := Table (K).Choice;
2319 Error_Msg_Sloc := Sloc (Table (J).Choice);
2321 Choice := Table (J).Choice;
2322 Error_Msg_Sloc := Sloc (Table (K).Choice);
2325 if Lo_Dup = Hi_Dup then
2327 ("index value in array aggregate "
2328 & "duplicates the one given#!", Choice);
2331 ("index values in array aggregate "
2332 & "duplicate those given#!", Choice);
2335 Output_Bad_Choices (Lo_Dup, Hi_Dup, Choice);
2341 -- Loop through entries in table to find missing indexes.
2342 -- Not needed if others, since missing impossible.
2344 if not Others_Present then
2345 for J in 2 .. Nb_Discrete_Choices loop
2346 Lo_Val := Expr_Value (Table (J).Lo);
2347 Hi_Val := Table (J - 1).Highest;
2349 if Lo_Val > Hi_Val + 1 then
2352 Error_Node : Node_Id;
2355 -- If the choice is the bound of a range in
2356 -- a subtype indication, it is not in the
2357 -- source lists for the aggregate itself, so
2358 -- post the error on the aggregate. Otherwise
2359 -- post it on choice itself.
2361 Choice := Table (J).Choice;
2363 if Is_List_Member (Choice) then
2364 Error_Node := Choice;
2369 if Hi_Val + 1 = Lo_Val - 1 then
2371 ("missing index value "
2372 & "in array aggregate!", Error_Node);
2375 ("missing index values "
2376 & "in array aggregate!", Error_Node);
2380 (Hi_Val + 1, Lo_Val - 1, Error_Node);
2386 -- If either missing or duplicate values, return failure
2388 Set_Etype (N, Any_Composite);
2394 -- STEP 2 (B): Compute aggregate bounds and min/max choices values
2396 if Nb_Discrete_Choices > 0 then
2397 Choices_Low := Table (1).Lo;
2398 Choices_High := Table (Nb_Discrete_Choices).Hi;
2401 -- If Others is present, then bounds of aggregate come from the
2402 -- index constraint (not the choices in the aggregate itself).
2404 if Others_Present then
2405 Get_Index_Bounds (Index_Constr, Aggr_Low, Aggr_High);
2407 -- Abandon processing if either bound is already signalled as
2408 -- an error (prevents junk cascaded messages and blow ups).
2410 if Nkind (Aggr_Low) = N_Error
2412 Nkind (Aggr_High) = N_Error
2417 -- No others clause present
2420 -- Special processing if others allowed and not present. This
2421 -- means that the bounds of the aggregate come from the index
2422 -- constraint (and the length must match).
2424 if Others_Allowed then
2425 Get_Index_Bounds (Index_Constr, Aggr_Low, Aggr_High);
2427 -- Abandon processing if either bound is already signalled
2428 -- as an error (stop junk cascaded messages and blow ups).
2430 if Nkind (Aggr_Low) = N_Error
2432 Nkind (Aggr_High) = N_Error
2437 -- If others allowed, and no others present, then the array
2438 -- should cover all index values. If it does not, we will
2439 -- get a length check warning, but there is two cases where
2440 -- an additional warning is useful:
2442 -- If we have no positional components, and the length is
2443 -- wrong (which we can tell by others being allowed with
2444 -- missing components), and the index type is an enumeration
2445 -- type, then issue appropriate warnings about these missing
2446 -- components. They are only warnings, since the aggregate
2447 -- is fine, it's just the wrong length. We skip this check
2448 -- for standard character types (since there are no literals
2449 -- and it is too much trouble to concoct them), and also if
2450 -- any of the bounds have values that are not known at
2453 -- Another case warranting a warning is when the length
2454 -- is right, but as above we have an index type that is
2455 -- an enumeration, and the bounds do not match. This is a
2456 -- case where dubious sliding is allowed and we generate a
2457 -- warning that the bounds do not match.
2459 if No (Expressions (N))
2460 and then Nkind (Index) = N_Range
2461 and then Is_Enumeration_Type (Etype (Index))
2462 and then not Is_Standard_Character_Type (Etype (Index))
2463 and then Compile_Time_Known_Value (Aggr_Low)
2464 and then Compile_Time_Known_Value (Aggr_High)
2465 and then Compile_Time_Known_Value (Choices_Low)
2466 and then Compile_Time_Known_Value (Choices_High)
2468 -- If any of the expressions or range bounds in choices
2469 -- have semantic errors, then do not attempt further
2470 -- resolution, to prevent cascaded errors.
2472 if Errors_Posted_On_Choices then
2477 ALo : constant Node_Id := Expr_Value_E (Aggr_Low);
2478 AHi : constant Node_Id := Expr_Value_E (Aggr_High);
2479 CLo : constant Node_Id := Expr_Value_E (Choices_Low);
2480 CHi : constant Node_Id := Expr_Value_E (Choices_High);
2485 -- Warning case 1, missing values at start/end. Only
2486 -- do the check if the number of entries is too small.
2488 if (Enumeration_Pos (CHi) - Enumeration_Pos (CLo))
2490 (Enumeration_Pos (AHi) - Enumeration_Pos (ALo))
2493 ("missing index value(s) in array aggregate??",
2496 -- Output missing value(s) at start
2498 if Chars (ALo) /= Chars (CLo) then
2501 if Chars (ALo) = Chars (Ent) then
2502 Error_Msg_Name_1 := Chars (ALo);
2503 Error_Msg_N ("\ %??", N);
2505 Error_Msg_Name_1 := Chars (ALo);
2506 Error_Msg_Name_2 := Chars (Ent);
2507 Error_Msg_N ("\ % .. %??", N);
2511 -- Output missing value(s) at end
2513 if Chars (AHi) /= Chars (CHi) then
2516 if Chars (AHi) = Chars (Ent) then
2517 Error_Msg_Name_1 := Chars (Ent);
2518 Error_Msg_N ("\ %??", N);
2520 Error_Msg_Name_1 := Chars (Ent);
2521 Error_Msg_Name_2 := Chars (AHi);
2522 Error_Msg_N ("\ % .. %??", N);
2526 -- Warning case 2, dubious sliding. The First_Subtype
2527 -- test distinguishes between a constrained type where
2528 -- sliding is not allowed (so we will get a warning
2529 -- later that Constraint_Error will be raised), and
2530 -- the unconstrained case where sliding is permitted.
2532 elsif (Enumeration_Pos (CHi) - Enumeration_Pos (CLo))
2534 (Enumeration_Pos (AHi) - Enumeration_Pos (ALo))
2535 and then Chars (ALo) /= Chars (CLo)
2537 not Is_Constrained (First_Subtype (Etype (N)))
2540 ("bounds of aggregate do not match target??", N);
2546 -- If no others, aggregate bounds come from aggregate
2548 Aggr_Low := Choices_Low;
2549 Aggr_High := Choices_High;
2553 -- STEP 3: Process positional components
2556 -- STEP 3 (A): Process positional elements
2558 Expr := First (Expressions (N));
2559 Nb_Elements := Uint_0;
2560 while Present (Expr) loop
2561 Nb_Elements := Nb_Elements + 1;
2563 -- Ada 2005 (AI-231)
2565 if Ada_Version >= Ada_2005 and then Known_Null (Expr) then
2566 Check_Can_Never_Be_Null (Etype (N), Expr);
2569 if not Resolve_Aggr_Expr (Expr, Single_Elmt => True) then
2573 -- Check incorrect use of dynamically tagged expression
2575 if Is_Tagged_Type (Etype (Expr)) then
2576 Check_Dynamically_Tagged_Expression
2578 Typ => Component_Type (Etype (N)),
2585 if Others_Present then
2586 Assoc := Last (Component_Associations (N));
2588 -- Ada 2005 (AI-231)
2590 if Ada_Version >= Ada_2005 and then Known_Null (Assoc) then
2591 Check_Can_Never_Be_Null (Etype (N), Expression (Assoc));
2594 -- Ada 2005 (AI-287): In case of default initialized component,
2595 -- we delay the resolution to the expansion phase.
2597 if Box_Present (Assoc) then
2599 -- Ada 2005 (AI-287): In case of default initialization of a
2600 -- component the expander will generate calls to the
2601 -- corresponding initialization subprogram. We need to call
2602 -- Resolve_Aggr_Expr to check the rules about
2605 if not Resolve_Aggr_Expr (Assoc, Single_Elmt => False) then
2609 elsif not Resolve_Aggr_Expr (Expression (Assoc),
2610 Single_Elmt => False)
2614 -- Check incorrect use of dynamically tagged expression. The
2615 -- expression of the others choice has not been resolved yet.
2616 -- In order to diagnose the semantic error we create a duplicate
2617 -- tree to analyze it and perform the check.
2621 Save_Analysis : constant Boolean := Full_Analysis;
2622 Expr : constant Node_Id :=
2623 New_Copy_Tree (Expression (Assoc));
2626 Expander_Mode_Save_And_Set (False);
2627 Full_Analysis := False;
2629 Full_Analysis := Save_Analysis;
2630 Expander_Mode_Restore;
2632 if Is_Tagged_Type (Etype (Expr)) then
2633 Check_Dynamically_Tagged_Expression
2635 Typ => Component_Type (Etype (N)),
2642 -- STEP 3 (B): Compute the aggregate bounds
2644 if Others_Present then
2645 Get_Index_Bounds (Index_Constr, Aggr_Low, Aggr_High);
2648 if Others_Allowed then
2649 Get_Index_Bounds (Index_Constr, Aggr_Low, Discard);
2651 Aggr_Low := Index_Typ_Low;
2654 Aggr_High := Add (Nb_Elements - 1, To => Aggr_Low);
2655 Check_Bound (Index_Base_High, Aggr_High);
2659 -- STEP 4: Perform static aggregate checks and save the bounds
2663 Check_Bounds (Index_Typ_Low, Index_Typ_High, Aggr_Low, Aggr_High);
2664 Check_Bounds (Index_Base_Low, Index_Base_High, Aggr_Low, Aggr_High);
2668 if Others_Present and then Nb_Discrete_Choices > 0 then
2669 Check_Bounds (Aggr_Low, Aggr_High, Choices_Low, Choices_High);
2670 Check_Bounds (Index_Typ_Low, Index_Typ_High,
2671 Choices_Low, Choices_High);
2672 Check_Bounds (Index_Base_Low, Index_Base_High,
2673 Choices_Low, Choices_High);
2677 elsif Others_Present and then Nb_Elements > 0 then
2678 Check_Length (Aggr_Low, Aggr_High, Nb_Elements);
2679 Check_Length (Index_Typ_Low, Index_Typ_High, Nb_Elements);
2680 Check_Length (Index_Base_Low, Index_Base_High, Nb_Elements);
2683 if Raises_Constraint_Error (Aggr_Low)
2684 or else Raises_Constraint_Error (Aggr_High)
2686 Set_Raises_Constraint_Error (N);
2689 Aggr_Low := Duplicate_Subexpr (Aggr_Low);
2691 -- Do not duplicate Aggr_High if Aggr_High = Aggr_Low + Nb_Elements
2692 -- since the addition node returned by Add is not yet analyzed. Attach
2693 -- to tree and analyze first. Reset analyzed flag to ensure it will get
2694 -- analyzed when it is a literal bound whose type must be properly set.
2696 if Others_Present or else Nb_Discrete_Choices > 0 then
2697 Aggr_High := Duplicate_Subexpr (Aggr_High);
2699 if Etype (Aggr_High) = Universal_Integer then
2700 Set_Analyzed (Aggr_High, False);
2704 -- If the aggregate already has bounds attached to it, it means this is
2705 -- a positional aggregate created as an optimization by
2706 -- Exp_Aggr.Convert_To_Positional, so we don't want to change those
2709 if Present (Aggregate_Bounds (N)) and then not Others_Allowed then
2710 Aggr_Low := Low_Bound (Aggregate_Bounds (N));
2711 Aggr_High := High_Bound (Aggregate_Bounds (N));
2714 Set_Aggregate_Bounds
2715 (N, Make_Range (Loc, Low_Bound => Aggr_Low, High_Bound => Aggr_High));
2717 -- The bounds may contain expressions that must be inserted upwards.
2718 -- Attach them fully to the tree. After analysis, remove side effects
2719 -- from upper bound, if still needed.
2721 Set_Parent (Aggregate_Bounds (N), N);
2722 Analyze_And_Resolve (Aggregate_Bounds (N), Index_Typ);
2723 Check_Unset_Reference (Aggregate_Bounds (N));
2725 if not Others_Present and then Nb_Discrete_Choices = 0 then
2727 (Aggregate_Bounds (N),
2728 Duplicate_Subexpr (High_Bound (Aggregate_Bounds (N))));
2731 -- Check the dimensions of each component in the array aggregate
2733 Analyze_Dimension_Array_Aggregate (N, Component_Typ);
2736 end Resolve_Array_Aggregate;
2738 -----------------------------
2739 -- Resolve_Delta_Aggregate --
2740 -----------------------------
2742 procedure Resolve_Delta_Aggregate (N : Node_Id; Typ : Entity_Id) is
2743 Base : constant Node_Id := Expression (N);
2744 Deltas : constant List_Id := Component_Associations (N);
2747 Comp_Type : Entity_Id;
2748 Index_Type : Entity_Id;
2750 function Get_Component_Type (Nam : Node_Id) return Entity_Id;
2752 ------------------------
2753 -- Get_Component_Type --
2754 ------------------------
2756 function Get_Component_Type (Nam : Node_Id) return Entity_Id is
2760 Comp := First_Entity (Typ);
2762 while Present (Comp) loop
2763 if Chars (Comp) = Chars (Nam) then
2764 if Ekind (Comp) = E_Discriminant then
2765 Error_Msg_N ("delta cannot apply to discriminant", Nam);
2768 return Etype (Comp);
2771 Comp := Next_Entity (Comp);
2774 Error_Msg_NE ("type& has no component with this name", Nam, Typ);
2776 end Get_Component_Type;
2779 if not Is_Composite_Type (Typ) then
2780 Error_Msg_N ("not a composite type", N);
2783 Analyze_And_Resolve (Base, Typ);
2784 if Is_Array_Type (Typ) then
2785 Index_Type := Etype (First_Index (Typ));
2786 Assoc := First (Deltas);
2787 while Present (Assoc) loop
2788 if Nkind (Assoc) = N_Iterated_Component_Association then
2789 Choice := First (Choice_List (Assoc));
2790 while Present (Choice) loop
2791 if Nkind (Choice) = N_Others_Choice then
2793 ("others not allowed in delta aggregate", Choice);
2796 Analyze_And_Resolve (Choice, Index_Type);
2803 Id : constant Entity_Id := Defining_Identifier (Assoc);
2804 Ent : constant Entity_Id :=
2806 (E_Loop, Current_Scope, Sloc (Assoc), 'L');
2809 Set_Etype (Ent, Standard_Void_Type);
2810 Set_Parent (Ent, Assoc);
2812 if No (Scope (Id)) then
2814 Set_Etype (Id, Index_Type);
2815 Set_Ekind (Id, E_Variable);
2816 Set_Scope (Id, Ent);
2821 (New_Copy_Tree (Expression (Assoc)), Component_Type (Typ));
2826 Choice := First (Choice_List (Assoc));
2827 while Present (Choice) loop
2828 if Nkind (Choice) = N_Others_Choice then
2830 ("others not allowed in delta aggregate", Choice);
2834 if Is_Entity_Name (Choice)
2835 and then Is_Type (Entity (Choice))
2837 -- Choice covers a range of values.
2838 if Base_Type (Entity (Choice)) /=
2839 Base_Type (Index_Type)
2841 Error_Msg_NE ("choice does mat match index type of",
2845 Resolve (Choice, Index_Type);
2852 Analyze_And_Resolve (Expression (Assoc), Component_Type (Typ));
2859 Assoc := First (Deltas);
2860 while Present (Assoc) loop
2861 Choice := First (Choice_List (Assoc));
2862 while Present (Choice) loop
2863 Comp_Type := Get_Component_Type (Choice);
2867 Analyze_And_Resolve (Expression (Assoc), Comp_Type);
2873 end Resolve_Delta_Aggregate;
2875 ---------------------------------
2876 -- Resolve_Extension_Aggregate --
2877 ---------------------------------
2879 -- There are two cases to consider:
2881 -- a) If the ancestor part is a type mark, the components needed are the
2882 -- difference between the components of the expected type and the
2883 -- components of the given type mark.
2885 -- b) If the ancestor part is an expression, it must be unambiguous, and
2886 -- once we have its type we can also compute the needed components as in
2887 -- the previous case. In both cases, if the ancestor type is not the
2888 -- immediate ancestor, we have to build this ancestor recursively.
2890 -- In both cases, discriminants of the ancestor type do not play a role in
2891 -- the resolution of the needed components, because inherited discriminants
2892 -- cannot be used in a type extension. As a result we can compute
2893 -- independently the list of components of the ancestor type and of the
2896 procedure Resolve_Extension_Aggregate (N : Node_Id; Typ : Entity_Id) is
2897 A : constant Node_Id := Ancestor_Part (N);
2902 function Valid_Limited_Ancestor (Anc : Node_Id) return Boolean;
2903 -- If the type is limited, verify that the ancestor part is a legal
2904 -- expression (aggregate or function call, including 'Input)) that does
2905 -- not require a copy, as specified in 7.5(2).
2907 function Valid_Ancestor_Type return Boolean;
2908 -- Verify that the type of the ancestor part is a non-private ancestor
2909 -- of the expected type, which must be a type extension.
2911 ----------------------------
2912 -- Valid_Limited_Ancestor --
2913 ----------------------------
2915 function Valid_Limited_Ancestor (Anc : Node_Id) return Boolean is
2917 if Is_Entity_Name (Anc) and then Is_Type (Entity (Anc)) then
2920 -- The ancestor must be a call or an aggregate, but a call may
2921 -- have been expanded into a temporary, so check original node.
2923 elsif Nkind_In (Anc, N_Aggregate,
2924 N_Extension_Aggregate,
2929 elsif Nkind (Original_Node (Anc)) = N_Function_Call then
2932 elsif Nkind (Anc) = N_Attribute_Reference
2933 and then Attribute_Name (Anc) = Name_Input
2937 elsif Nkind (Anc) = N_Qualified_Expression then
2938 return Valid_Limited_Ancestor (Expression (Anc));
2943 end Valid_Limited_Ancestor;
2945 -------------------------
2946 -- Valid_Ancestor_Type --
2947 -------------------------
2949 function Valid_Ancestor_Type return Boolean is
2950 Imm_Type : Entity_Id;
2953 Imm_Type := Base_Type (Typ);
2954 while Is_Derived_Type (Imm_Type) loop
2955 if Etype (Imm_Type) = Base_Type (A_Type) then
2958 -- The base type of the parent type may appear as a private
2959 -- extension if it is declared as such in a parent unit of the
2960 -- current one. For consistency of the subsequent analysis use
2961 -- the partial view for the ancestor part.
2963 elsif Is_Private_Type (Etype (Imm_Type))
2964 and then Present (Full_View (Etype (Imm_Type)))
2965 and then Base_Type (A_Type) = Full_View (Etype (Imm_Type))
2967 A_Type := Etype (Imm_Type);
2970 -- The parent type may be a private extension. The aggregate is
2971 -- legal if the type of the aggregate is an extension of it that
2972 -- is not a private extension.
2974 elsif Is_Private_Type (A_Type)
2975 and then not Is_Private_Type (Imm_Type)
2976 and then Present (Full_View (A_Type))
2977 and then Base_Type (Full_View (A_Type)) = Etype (Imm_Type)
2982 Imm_Type := Etype (Base_Type (Imm_Type));
2986 -- If previous loop did not find a proper ancestor, report error
2988 Error_Msg_NE ("expect ancestor type of &", A, Typ);
2990 end Valid_Ancestor_Type;
2992 -- Start of processing for Resolve_Extension_Aggregate
2995 -- Analyze the ancestor part and account for the case where it is a
2996 -- parameterless function call.
2999 Check_Parameterless_Call (A);
3001 -- In SPARK, the ancestor part cannot be a type mark
3003 if Is_Entity_Name (A) and then Is_Type (Entity (A)) then
3004 Check_SPARK_05_Restriction ("ancestor part cannot be a type mark", A);
3006 -- AI05-0115: if the ancestor part is a subtype mark, the ancestor
3007 -- must not have unknown discriminants.
3009 if Has_Unknown_Discriminants (Root_Type (Typ)) then
3011 ("aggregate not available for type& whose ancestor "
3012 & "has unknown discriminants", N, Typ);
3016 if not Is_Tagged_Type (Typ) then
3017 Error_Msg_N ("type of extension aggregate must be tagged", N);
3020 elsif Is_Limited_Type (Typ) then
3022 -- Ada 2005 (AI-287): Limited aggregates are allowed
3024 if Ada_Version < Ada_2005 then
3025 Error_Msg_N ("aggregate type cannot be limited", N);
3026 Explain_Limited_Type (Typ, N);
3029 elsif Valid_Limited_Ancestor (A) then
3034 ("limited ancestor part must be aggregate or function call", A);
3037 elsif Is_Class_Wide_Type (Typ) then
3038 Error_Msg_N ("aggregate cannot be of a class-wide type", N);
3042 if Is_Entity_Name (A) and then Is_Type (Entity (A)) then
3043 A_Type := Get_Full_View (Entity (A));
3045 if Valid_Ancestor_Type then
3046 Set_Entity (A, A_Type);
3047 Set_Etype (A, A_Type);
3049 Validate_Ancestor_Part (N);
3050 Resolve_Record_Aggregate (N, Typ);
3053 elsif Nkind (A) /= N_Aggregate then
3054 if Is_Overloaded (A) then
3057 Get_First_Interp (A, I, It);
3058 while Present (It.Typ) loop
3060 -- Only consider limited interpretations in the Ada 2005 case
3062 if Is_Tagged_Type (It.Typ)
3063 and then (Ada_Version >= Ada_2005
3064 or else not Is_Limited_Type (It.Typ))
3066 if A_Type /= Any_Type then
3067 Error_Msg_N ("cannot resolve expression", A);
3074 Get_Next_Interp (I, It);
3077 if A_Type = Any_Type then
3078 if Ada_Version >= Ada_2005 then
3080 ("ancestor part must be of a tagged type", A);
3083 ("ancestor part must be of a nonlimited tagged type", A);
3090 A_Type := Etype (A);
3093 if Valid_Ancestor_Type then
3094 Resolve (A, A_Type);
3095 Check_Unset_Reference (A);
3096 Check_Non_Static_Context (A);
3098 -- The aggregate is illegal if the ancestor expression is a call
3099 -- to a function with a limited unconstrained result, unless the
3100 -- type of the aggregate is a null extension. This restriction
3101 -- was added in AI05-67 to simplify implementation.
3103 if Nkind (A) = N_Function_Call
3104 and then Is_Limited_Type (A_Type)
3105 and then not Is_Null_Extension (Typ)
3106 and then not Is_Constrained (A_Type)
3109 ("type of limited ancestor part must be constrained", A);
3111 -- Reject the use of CPP constructors that leave objects partially
3112 -- initialized. For example:
3114 -- type CPP_Root is tagged limited record ...
3115 -- pragma Import (CPP, CPP_Root);
3117 -- type CPP_DT is new CPP_Root and Iface ...
3118 -- pragma Import (CPP, CPP_DT);
3120 -- type Ada_DT is new CPP_DT with ...
3122 -- Obj : Ada_DT := Ada_DT'(New_CPP_Root with others => <>);
3124 -- Using the constructor of CPP_Root the slots of the dispatch
3125 -- table of CPP_DT cannot be set, and the secondary tag of
3126 -- CPP_DT is unknown.
3128 elsif Nkind (A) = N_Function_Call
3129 and then Is_CPP_Constructor_Call (A)
3130 and then Enclosing_CPP_Parent (Typ) /= A_Type
3133 ("??must use 'C'P'P constructor for type &", A,
3134 Enclosing_CPP_Parent (Typ));
3136 -- The following call is not needed if the previous warning
3137 -- is promoted to an error.
3139 Resolve_Record_Aggregate (N, Typ);
3141 elsif Is_Class_Wide_Type (Etype (A))
3142 and then Nkind (Original_Node (A)) = N_Function_Call
3144 -- If the ancestor part is a dispatching call, it appears
3145 -- statically to be a legal ancestor, but it yields any member
3146 -- of the class, and it is not possible to determine whether
3147 -- it is an ancestor of the extension aggregate (much less
3148 -- which ancestor). It is not possible to determine the
3149 -- components of the extension part.
3151 -- This check implements AI-306, which in fact was motivated by
3152 -- an AdaCore query to the ARG after this test was added.
3154 Error_Msg_N ("ancestor part must be statically tagged", A);
3156 Resolve_Record_Aggregate (N, Typ);
3161 Error_Msg_N ("no unique type for this aggregate", A);
3164 Check_Function_Writable_Actuals (N);
3165 end Resolve_Extension_Aggregate;
3167 ------------------------------
3168 -- Resolve_Record_Aggregate --
3169 ------------------------------
3171 procedure Resolve_Record_Aggregate (N : Node_Id; Typ : Entity_Id) is
3172 New_Assoc_List : constant List_Id := New_List;
3173 -- New_Assoc_List is the newly built list of N_Component_Association
3176 Others_Etype : Entity_Id := Empty;
3177 -- This variable is used to save the Etype of the last record component
3178 -- that takes its value from the others choice. Its purpose is:
3180 -- (a) make sure the others choice is useful
3182 -- (b) make sure the type of all the components whose value is
3183 -- subsumed by the others choice are the same.
3185 -- This variable is updated as a side effect of function Get_Value.
3188 Is_Box_Present : Boolean := False;
3189 Others_Box : Integer := 0;
3190 -- Ada 2005 (AI-287): Variables used in case of default initialization
3191 -- to provide a functionality similar to Others_Etype. Box_Present
3192 -- indicates that the component takes its default initialization;
3193 -- Others_Box counts the number of components of the current aggregate
3194 -- (which may be a sub-aggregate of a larger one) that are default-
3195 -- initialized. A value of One indicates that an others_box is present.
3196 -- Any larger value indicates that the others_box is not redundant.
3197 -- These variables, similar to Others_Etype, are also updated as a side
3198 -- effect of function Get_Value. Box_Node is used to place a warning on
3199 -- a redundant others_box.
3201 procedure Add_Association
3202 (Component : Entity_Id;
3204 Assoc_List : List_Id;
3205 Is_Box_Present : Boolean := False);
3206 -- Builds a new N_Component_Association node which associates Component
3207 -- to expression Expr and adds it to the association list being built,
3208 -- either New_Assoc_List, or the association being built for an inner
3211 procedure Add_Discriminant_Values
3212 (New_Aggr : Node_Id;
3213 Assoc_List : List_Id);
3214 -- The constraint to a component may be given by a discriminant of the
3215 -- enclosing type, in which case we have to retrieve its value, which is
3216 -- part of the enclosing aggregate. Assoc_List provides the discriminant
3217 -- associations of the current type or of some enclosing record.
3219 function Discriminant_Present (Input_Discr : Entity_Id) return Boolean;
3220 -- If aggregate N is a regular aggregate this routine will return True.
3221 -- Otherwise, if N is an extension aggregate, then Input_Discr denotes
3222 -- a discriminant whose value may already have been specified by N's
3223 -- ancestor part. This routine checks whether this is indeed the case
3224 -- and if so returns False, signaling that no value for Input_Discr
3225 -- should appear in N's aggregate part. Also, in this case, the routine
3226 -- appends to New_Assoc_List the discriminant value specified in the
3229 -- If the aggregate is in a context with expansion delayed, it will be
3230 -- reanalyzed. The inherited discriminant values must not be reinserted
3231 -- in the component list to prevent spurious errors, but they must be
3232 -- present on first analysis to build the proper subtype indications.
3233 -- The flag Inherited_Discriminant is used to prevent the re-insertion.
3235 function Find_Private_Ancestor (Typ : Entity_Id) return Entity_Id;
3236 -- AI05-0115: Find earlier ancestor in the derivation chain that is
3237 -- derived from private view Typ. Whether the aggregate is legal depends
3238 -- on the current visibility of the type as well as that of the parent
3244 Consider_Others_Choice : Boolean := False) return Node_Id;
3245 -- Given a record component stored in parameter Compon, this function
3246 -- returns its value as it appears in the list From, which is a list
3247 -- of N_Component_Association nodes.
3249 -- If no component association has a choice for the searched component,
3250 -- the value provided by the others choice is returned, if there is one,
3251 -- and Consider_Others_Choice is set to true. Otherwise Empty is
3252 -- returned. If there is more than one component association giving a
3253 -- value for the searched record component, an error message is emitted
3254 -- and the first found value is returned.
3256 -- If Consider_Others_Choice is set and the returned expression comes
3257 -- from the others choice, then Others_Etype is set as a side effect.
3258 -- An error message is emitted if the components taking their value from
3259 -- the others choice do not have same type.
3261 function New_Copy_Tree_And_Copy_Dimensions
3263 Map : Elist_Id := No_Elist;
3264 New_Sloc : Source_Ptr := No_Location;
3265 New_Scope : Entity_Id := Empty) return Node_Id;
3266 -- Same as New_Copy_Tree (defined in Sem_Util), except that this routine
3267 -- also copies the dimensions of Source to the returned node.
3269 procedure Propagate_Discriminants
3271 Assoc_List : List_Id);
3272 -- Nested components may themselves be discriminated types constrained
3273 -- by outer discriminants, whose values must be captured before the
3274 -- aggregate is expanded into assignments.
3276 procedure Resolve_Aggr_Expr (Expr : Node_Id; Component : Entity_Id);
3277 -- Analyzes and resolves expression Expr against the Etype of the
3278 -- Component. This routine also applies all appropriate checks to Expr.
3279 -- It finally saves a Expr in the newly created association list that
3280 -- will be attached to the final record aggregate. Note that if the
3281 -- Parent pointer of Expr is not set then Expr was produced with a
3282 -- New_Copy_Tree or some such.
3284 ---------------------
3285 -- Add_Association --
3286 ---------------------
3288 procedure Add_Association
3289 (Component : Entity_Id;
3291 Assoc_List : List_Id;
3292 Is_Box_Present : Boolean := False)
3294 Choice_List : constant List_Id := New_List;
3298 -- If this is a box association the expression is missing, so use the
3299 -- Sloc of the aggregate itself for the new association.
3301 if Present (Expr) then
3307 Append_To (Choice_List, New_Occurrence_Of (Component, Loc));
3309 Append_To (Assoc_List,
3310 Make_Component_Association (Loc,
3311 Choices => Choice_List,
3313 Box_Present => Is_Box_Present));
3314 end Add_Association;
3316 -----------------------------
3317 -- Add_Discriminant_Values --
3318 -----------------------------
3320 procedure Add_Discriminant_Values
3321 (New_Aggr : Node_Id;
3322 Assoc_List : List_Id)
3326 Discr_Elmt : Elmt_Id;
3327 Discr_Val : Node_Id;
3331 Discr := First_Discriminant (Etype (New_Aggr));
3332 Discr_Elmt := First_Elmt (Discriminant_Constraint (Etype (New_Aggr)));
3333 while Present (Discr_Elmt) loop
3334 Discr_Val := Node (Discr_Elmt);
3336 -- If the constraint is given by a discriminant then it is a
3337 -- discriminant of an enclosing record, and its value has already
3338 -- been placed in the association list.
3340 if Is_Entity_Name (Discr_Val)
3341 and then Ekind (Entity (Discr_Val)) = E_Discriminant
3343 Val := Entity (Discr_Val);
3345 Assoc := First (Assoc_List);
3346 while Present (Assoc) loop
3347 if Present (Entity (First (Choices (Assoc))))
3348 and then Entity (First (Choices (Assoc))) = Val
3350 Discr_Val := Expression (Assoc);
3359 (Discr, New_Copy_Tree (Discr_Val),
3360 Component_Associations (New_Aggr));
3362 -- If the discriminant constraint is a current instance, mark the
3363 -- current aggregate so that the self-reference can be expanded
3364 -- later. The constraint may refer to the subtype of aggregate, so
3365 -- use base type for comparison.
3367 if Nkind (Discr_Val) = N_Attribute_Reference
3368 and then Is_Entity_Name (Prefix (Discr_Val))
3369 and then Is_Type (Entity (Prefix (Discr_Val)))
3370 and then Base_Type (Etype (N)) = Entity (Prefix (Discr_Val))
3372 Set_Has_Self_Reference (N);
3375 Next_Elmt (Discr_Elmt);
3376 Next_Discriminant (Discr);
3378 end Add_Discriminant_Values;
3380 --------------------------
3381 -- Discriminant_Present --
3382 --------------------------
3384 function Discriminant_Present (Input_Discr : Entity_Id) return Boolean is
3385 Regular_Aggr : constant Boolean := Nkind (N) /= N_Extension_Aggregate;
3387 Ancestor_Is_Subtyp : Boolean;
3392 Ancestor_Typ : Entity_Id;
3393 Comp_Assoc : Node_Id;
3395 Discr_Expr : Node_Id;
3396 Discr_Val : Elmt_Id := No_Elmt;
3397 Orig_Discr : Entity_Id;
3400 if Regular_Aggr then
3404 -- Check whether inherited discriminant values have already been
3405 -- inserted in the aggregate. This will be the case if we are
3406 -- re-analyzing an aggregate whose expansion was delayed.
3408 if Present (Component_Associations (N)) then
3409 Comp_Assoc := First (Component_Associations (N));
3410 while Present (Comp_Assoc) loop
3411 if Inherited_Discriminant (Comp_Assoc) then
3419 Ancestor := Ancestor_Part (N);
3420 Ancestor_Typ := Etype (Ancestor);
3421 Loc := Sloc (Ancestor);
3423 -- For a private type with unknown discriminants, use the underlying
3424 -- record view if it is available.
3426 if Has_Unknown_Discriminants (Ancestor_Typ)
3427 and then Present (Full_View (Ancestor_Typ))
3428 and then Present (Underlying_Record_View (Full_View (Ancestor_Typ)))
3430 Ancestor_Typ := Underlying_Record_View (Full_View (Ancestor_Typ));
3433 Ancestor_Is_Subtyp :=
3434 Is_Entity_Name (Ancestor) and then Is_Type (Entity (Ancestor));
3436 -- If the ancestor part has no discriminants clearly N's aggregate
3437 -- part must provide a value for Discr.
3439 if not Has_Discriminants (Ancestor_Typ) then
3442 -- If the ancestor part is an unconstrained subtype mark then the
3443 -- Discr must be present in N's aggregate part.
3445 elsif Ancestor_Is_Subtyp
3446 and then not Is_Constrained (Entity (Ancestor))
3451 -- Now look to see if Discr was specified in the ancestor part
3453 if Ancestor_Is_Subtyp then
3455 First_Elmt (Discriminant_Constraint (Entity (Ancestor)));
3458 Orig_Discr := Original_Record_Component (Input_Discr);
3460 Discr := First_Discriminant (Ancestor_Typ);
3461 while Present (Discr) loop
3463 -- If Ancestor has already specified Disc value then insert its
3464 -- value in the final aggregate.
3466 if Original_Record_Component (Discr) = Orig_Discr then
3467 if Ancestor_Is_Subtyp then
3468 Discr_Expr := New_Copy_Tree (Node (Discr_Val));
3471 Make_Selected_Component (Loc,
3472 Prefix => Duplicate_Subexpr (Ancestor),
3473 Selector_Name => New_Occurrence_Of (Input_Discr, Loc));
3476 Resolve_Aggr_Expr (Discr_Expr, Input_Discr);
3477 Set_Inherited_Discriminant (Last (New_Assoc_List));
3481 Next_Discriminant (Discr);
3483 if Ancestor_Is_Subtyp then
3484 Next_Elmt (Discr_Val);
3489 end Discriminant_Present;
3491 ---------------------------
3492 -- Find_Private_Ancestor --
3493 ---------------------------
3495 function Find_Private_Ancestor (Typ : Entity_Id) return Entity_Id is
3501 if Has_Private_Ancestor (Par)
3502 and then not Has_Private_Ancestor (Etype (Base_Type (Par)))
3506 elsif not Is_Derived_Type (Par) then
3510 Par := Etype (Base_Type (Par));
3513 end Find_Private_Ancestor;
3522 Consider_Others_Choice : Boolean := False) return Node_Id
3524 Typ : constant Entity_Id := Etype (Compon);
3526 Expr : Node_Id := Empty;
3527 Selector_Name : Node_Id;
3530 Is_Box_Present := False;
3536 Assoc := First (From);
3537 while Present (Assoc) loop
3538 Selector_Name := First (Choices (Assoc));
3539 while Present (Selector_Name) loop
3540 if Nkind (Selector_Name) = N_Others_Choice then
3541 if Consider_Others_Choice and then No (Expr) then
3543 -- We need to duplicate the expression for each
3544 -- successive component covered by the others choice.
3545 -- This is redundant if the others_choice covers only
3546 -- one component (small optimization possible???), but
3547 -- indispensable otherwise, because each one must be
3548 -- expanded individually to preserve side-effects.
3550 -- Ada 2005 (AI-287): In case of default initialization
3551 -- of components, we duplicate the corresponding default
3552 -- expression (from the record type declaration). The
3553 -- copy must carry the sloc of the association (not the
3554 -- original expression) to prevent spurious elaboration
3555 -- checks when the default includes function calls.
3557 if Box_Present (Assoc) then
3558 Others_Box := Others_Box + 1;
3559 Is_Box_Present := True;
3561 if Expander_Active then
3563 New_Copy_Tree_And_Copy_Dimensions
3564 (Expression (Parent (Compon)),
3565 New_Sloc => Sloc (Assoc));
3567 return Expression (Parent (Compon));
3571 if Present (Others_Etype)
3572 and then Base_Type (Others_Etype) /= Base_Type (Typ)
3574 -- If the components are of an anonymous access
3575 -- type they are distinct, but this is legal in
3576 -- Ada 2012 as long as designated types match.
3578 if (Ekind (Typ) = E_Anonymous_Access_Type
3579 or else Ekind (Typ) =
3580 E_Anonymous_Access_Subprogram_Type)
3581 and then Designated_Type (Typ) =
3582 Designated_Type (Others_Etype)
3587 ("components in OTHERS choice must have same "
3588 & "type", Selector_Name);
3592 Others_Etype := Typ;
3594 -- Copy the expression so that it is resolved
3595 -- independently for each component, This is needed
3596 -- for accessibility checks on compoents of anonymous
3597 -- access types, even in compile_only mode.
3599 if not Inside_A_Generic then
3601 -- In ASIS mode, preanalyze the expression in an
3602 -- others association before making copies for
3603 -- separate resolution and accessibility checks.
3604 -- This ensures that the type of the expression is
3605 -- available to ASIS in all cases, in particular if
3606 -- the expression is itself an aggregate.
3609 Preanalyze_And_Resolve (Expression (Assoc), Typ);
3613 New_Copy_Tree_And_Copy_Dimensions
3614 (Expression (Assoc));
3617 return Expression (Assoc);
3622 elsif Chars (Compon) = Chars (Selector_Name) then
3625 -- Ada 2005 (AI-231)
3627 if Ada_Version >= Ada_2005
3628 and then Known_Null (Expression (Assoc))
3630 Check_Can_Never_Be_Null (Compon, Expression (Assoc));
3633 -- We need to duplicate the expression when several
3634 -- components are grouped together with a "|" choice.
3635 -- For instance "filed1 | filed2 => Expr"
3637 -- Ada 2005 (AI-287)
3639 if Box_Present (Assoc) then
3640 Is_Box_Present := True;
3642 -- Duplicate the default expression of the component
3643 -- from the record type declaration, so a new copy
3644 -- can be attached to the association.
3646 -- Note that we always copy the default expression,
3647 -- even when the association has a single choice, in
3648 -- order to create a proper association for the
3649 -- expanded aggregate.
3651 -- Component may have no default, in which case the
3652 -- expression is empty and the component is default-
3653 -- initialized, but an association for the component
3654 -- exists, and it is not covered by an others clause.
3656 -- Scalar and private types have no initialization
3657 -- procedure, so they remain uninitialized. If the
3658 -- target of the aggregate is a constant this
3659 -- deserves a warning.
3661 if No (Expression (Parent (Compon)))
3662 and then not Has_Non_Null_Base_Init_Proc (Typ)
3663 and then not Has_Aspect (Typ, Aspect_Default_Value)
3664 and then not Is_Concurrent_Type (Typ)
3665 and then Nkind (Parent (N)) = N_Object_Declaration
3666 and then Constant_Present (Parent (N))
3668 Error_Msg_Node_2 := Typ;
3670 ("component&? of type& is uninitialized",
3671 Assoc, Selector_Name);
3673 -- An additional reminder if the component type
3674 -- is a generic formal.
3676 if Is_Generic_Type (Base_Type (Typ)) then
3678 ("\instance should provide actual type with "
3679 & "initialization for&", Assoc, Typ);
3684 New_Copy_Tree_And_Copy_Dimensions
3685 (Expression (Parent (Compon)));
3688 if Present (Next (Selector_Name)) then
3689 Expr := New_Copy_Tree_And_Copy_Dimensions
3690 (Expression (Assoc));
3692 Expr := Expression (Assoc);
3696 Generate_Reference (Compon, Selector_Name, 'm');
3700 ("more than one value supplied for &",
3701 Selector_Name, Compon);
3706 Next (Selector_Name);
3715 ---------------------------------------
3716 -- New_Copy_Tree_And_Copy_Dimensions --
3717 ---------------------------------------
3719 function New_Copy_Tree_And_Copy_Dimensions
3721 Map : Elist_Id := No_Elist;
3722 New_Sloc : Source_Ptr := No_Location;
3723 New_Scope : Entity_Id := Empty) return Node_Id
3725 New_Copy : constant Node_Id :=
3726 New_Copy_Tree (Source, Map, New_Sloc, New_Scope);
3729 -- Move the dimensions of Source to New_Copy
3731 Copy_Dimensions (Source, New_Copy);
3733 end New_Copy_Tree_And_Copy_Dimensions;
3735 -----------------------------
3736 -- Propagate_Discriminants --
3737 -----------------------------
3739 procedure Propagate_Discriminants
3741 Assoc_List : List_Id)
3743 Loc : constant Source_Ptr := Sloc (N);
3745 Needs_Box : Boolean := False;
3747 procedure Process_Component (Comp : Entity_Id);
3748 -- Add one component with a box association to the inner aggregate,
3749 -- and recurse if component is itself composite.
3751 -----------------------
3752 -- Process_Component --
3753 -----------------------
3755 procedure Process_Component (Comp : Entity_Id) is
3756 T : constant Entity_Id := Etype (Comp);
3760 if Is_Record_Type (T) and then Has_Discriminants (T) then
3761 New_Aggr := Make_Aggregate (Loc, New_List, New_List);
3762 Set_Etype (New_Aggr, T);
3765 (Comp, New_Aggr, Component_Associations (Aggr));
3767 -- Collect discriminant values and recurse
3769 Add_Discriminant_Values (New_Aggr, Assoc_List);
3770 Propagate_Discriminants (New_Aggr, Assoc_List);
3775 end Process_Component;
3779 Aggr_Type : constant Entity_Id := Base_Type (Etype (Aggr));
3780 Components : constant Elist_Id := New_Elmt_List;
3781 Def_Node : constant Node_Id :=
3782 Type_Definition (Declaration_Node (Aggr_Type));
3785 Comp_Elmt : Elmt_Id;
3788 -- Start of processing for Propagate_Discriminants
3791 -- The component type may be a variant type. Collect the components
3792 -- that are ruled by the known values of the discriminants. Their
3793 -- values have already been inserted into the component list of the
3794 -- current aggregate.
3796 if Nkind (Def_Node) = N_Record_Definition
3797 and then Present (Component_List (Def_Node))
3798 and then Present (Variant_Part (Component_List (Def_Node)))
3800 Gather_Components (Aggr_Type,
3801 Component_List (Def_Node),
3802 Governed_By => Component_Associations (Aggr),
3804 Report_Errors => Errors);
3806 Comp_Elmt := First_Elmt (Components);
3807 while Present (Comp_Elmt) loop
3808 if Ekind (Node (Comp_Elmt)) /= E_Discriminant then
3809 Process_Component (Node (Comp_Elmt));
3812 Next_Elmt (Comp_Elmt);
3815 -- No variant part, iterate over all components
3818 Comp := First_Component (Etype (Aggr));
3819 while Present (Comp) loop
3820 Process_Component (Comp);
3821 Next_Component (Comp);
3826 Append_To (Component_Associations (Aggr),
3827 Make_Component_Association (Loc,
3828 Choices => New_List (Make_Others_Choice (Loc)),
3829 Expression => Empty,
3830 Box_Present => True));
3832 end Propagate_Discriminants;
3834 -----------------------
3835 -- Resolve_Aggr_Expr --
3836 -----------------------
3838 procedure Resolve_Aggr_Expr (Expr : Node_Id; Component : Entity_Id) is
3839 function Has_Expansion_Delayed (Expr : Node_Id) return Boolean;
3840 -- If the expression is an aggregate (possibly qualified) then its
3841 -- expansion is delayed until the enclosing aggregate is expanded
3842 -- into assignments. In that case, do not generate checks on the
3843 -- expression, because they will be generated later, and will other-
3844 -- wise force a copy (to remove side-effects) that would leave a
3845 -- dynamic-sized aggregate in the code, something that gigi cannot
3848 ---------------------------
3849 -- Has_Expansion_Delayed --
3850 ---------------------------
3852 function Has_Expansion_Delayed (Expr : Node_Id) return Boolean is
3855 (Nkind_In (Expr, N_Aggregate, N_Extension_Aggregate)
3856 and then Present (Etype (Expr))
3857 and then Is_Record_Type (Etype (Expr))
3858 and then Expansion_Delayed (Expr))
3860 (Nkind (Expr) = N_Qualified_Expression
3861 and then Has_Expansion_Delayed (Expression (Expr)));
3862 end Has_Expansion_Delayed;
3866 Expr_Type : Entity_Id := Empty;
3867 New_C : Entity_Id := Component;
3871 -- Set to True if the resolved Expr node needs to be relocated when
3872 -- attached to the newly created association list. This node need not
3873 -- be relocated if its parent pointer is not set. In fact in this
3874 -- case Expr is the output of a New_Copy_Tree call. If Relocate is
3875 -- True then we have analyzed the expression node in the original
3876 -- aggregate and hence it needs to be relocated when moved over to
3877 -- the new association list.
3879 -- Start of processing for Resolve_Aggr_Expr
3882 -- If the type of the component is elementary or the type of the
3883 -- aggregate does not contain discriminants, use the type of the
3884 -- component to resolve Expr.
3886 if Is_Elementary_Type (Etype (Component))
3887 or else not Has_Discriminants (Etype (N))
3889 Expr_Type := Etype (Component);
3891 -- Otherwise we have to pick up the new type of the component from
3892 -- the new constrained subtype of the aggregate. In fact components
3893 -- which are of a composite type might be constrained by a
3894 -- discriminant, and we want to resolve Expr against the subtype were
3895 -- all discriminant occurrences are replaced with their actual value.
3898 New_C := First_Component (Etype (N));
3899 while Present (New_C) loop
3900 if Chars (New_C) = Chars (Component) then
3901 Expr_Type := Etype (New_C);
3905 Next_Component (New_C);
3908 pragma Assert (Present (Expr_Type));
3910 -- For each range in an array type where a discriminant has been
3911 -- replaced with the constraint, check that this range is within
3912 -- the range of the base type. This checks is done in the init
3913 -- proc for regular objects, but has to be done here for
3914 -- aggregates since no init proc is called for them.
3916 if Is_Array_Type (Expr_Type) then
3919 -- Range of the current constrained index in the array
3921 Orig_Index : Node_Id := First_Index (Etype (Component));
3922 -- Range corresponding to the range Index above in the
3923 -- original unconstrained record type. The bounds of this
3924 -- range may be governed by discriminants.
3926 Unconstr_Index : Node_Id := First_Index (Etype (Expr_Type));
3927 -- Range corresponding to the range Index above for the
3928 -- unconstrained array type. This range is needed to apply
3932 Index := First_Index (Expr_Type);
3933 while Present (Index) loop
3934 if Depends_On_Discriminant (Orig_Index) then
3935 Apply_Range_Check (Index, Etype (Unconstr_Index));
3939 Next_Index (Orig_Index);
3940 Next_Index (Unconstr_Index);
3946 -- If the Parent pointer of Expr is not set, Expr is an expression
3947 -- duplicated by New_Tree_Copy (this happens for record aggregates
3948 -- that look like (Field1 | Filed2 => Expr) or (others => Expr)).
3949 -- Such a duplicated expression must be attached to the tree
3950 -- before analysis and resolution to enforce the rule that a tree
3951 -- fragment should never be analyzed or resolved unless it is
3952 -- attached to the current compilation unit.
3954 if No (Parent (Expr)) then
3955 Set_Parent (Expr, N);
3961 Analyze_And_Resolve (Expr, Expr_Type);
3962 Check_Expr_OK_In_Limited_Aggregate (Expr);
3963 Check_Non_Static_Context (Expr);
3964 Check_Unset_Reference (Expr);
3966 -- Check wrong use of class-wide types
3968 if Is_Class_Wide_Type (Etype (Expr)) then
3969 Error_Msg_N ("dynamically tagged expression not allowed", Expr);
3972 if not Has_Expansion_Delayed (Expr) then
3973 Aggregate_Constraint_Checks (Expr, Expr_Type);
3976 -- If an aggregate component has a type with predicates, an explicit
3977 -- predicate check must be applied, as for an assignment statement,
3978 -- because the aggegate might not be expanded into individual
3979 -- component assignments.
3981 if Present (Predicate_Function (Expr_Type))
3982 and then Analyzed (Expr)
3984 Apply_Predicate_Check (Expr, Expr_Type);
3987 if Raises_Constraint_Error (Expr) then
3988 Set_Raises_Constraint_Error (N);
3991 -- If the expression has been marked as requiring a range check, then
3992 -- generate it here. It's a bit odd to be generating such checks in
3993 -- the analyzer, but harmless since Generate_Range_Check does nothing
3994 -- (other than making sure Do_Range_Check is set) if the expander is
3997 if Do_Range_Check (Expr) then
3998 Generate_Range_Check (Expr, Expr_Type, CE_Range_Check_Failed);
4001 -- Add association Component => Expr if the caller requests it
4004 New_Expr := Relocate_Node (Expr);
4006 -- Since New_Expr is not gonna be analyzed later on, we need to
4007 -- propagate here the dimensions form Expr to New_Expr.
4009 Copy_Dimensions (Expr, New_Expr);
4015 Add_Association (New_C, New_Expr, New_Assoc_List);
4016 end Resolve_Aggr_Expr;
4020 Components : constant Elist_Id := New_Elmt_List;
4021 -- Components is the list of the record components whose value must be
4022 -- provided in the aggregate. This list does include discriminants.
4025 Component : Entity_Id;
4026 Component_Elmt : Elmt_Id;
4027 Positional_Expr : Node_Id;
4029 -- Start of processing for Resolve_Record_Aggregate
4032 -- A record aggregate is restricted in SPARK:
4034 -- Each named association can have only a single choice.
4035 -- OTHERS cannot be used.
4036 -- Positional and named associations cannot be mixed.
4038 if Present (Component_Associations (N))
4039 and then Present (First (Component_Associations (N)))
4041 if Present (Expressions (N)) then
4042 Check_SPARK_05_Restriction
4043 ("named association cannot follow positional one",
4044 First (Choices (First (Component_Associations (N)))));
4051 Assoc := First (Component_Associations (N));
4052 while Present (Assoc) loop
4053 if List_Length (Choices (Assoc)) > 1 then
4054 Check_SPARK_05_Restriction
4055 ("component association in record aggregate must "
4056 & "contain a single choice", Assoc);
4059 if Nkind (First (Choices (Assoc))) = N_Others_Choice then
4060 Check_SPARK_05_Restriction
4061 ("record aggregate cannot contain OTHERS", Assoc);
4064 Assoc := Next (Assoc);
4069 -- We may end up calling Duplicate_Subexpr on expressions that are
4070 -- attached to New_Assoc_List. For this reason we need to attach it
4071 -- to the tree by setting its parent pointer to N. This parent point
4072 -- will change in STEP 8 below.
4074 Set_Parent (New_Assoc_List, N);
4076 -- STEP 1: abstract type and null record verification
4078 if Is_Abstract_Type (Typ) then
4079 Error_Msg_N ("type of aggregate cannot be abstract", N);
4082 if No (First_Entity (Typ)) and then Null_Record_Present (N) then
4086 elsif Present (First_Entity (Typ))
4087 and then Null_Record_Present (N)
4088 and then not Is_Tagged_Type (Typ)
4090 Error_Msg_N ("record aggregate cannot be null", N);
4093 -- If the type has no components, then the aggregate should either
4094 -- have "null record", or in Ada 2005 it could instead have a single
4095 -- component association given by "others => <>". For Ada 95 we flag an
4096 -- error at this point, but for Ada 2005 we proceed with checking the
4097 -- associations below, which will catch the case where it's not an
4098 -- aggregate with "others => <>". Note that the legality of a <>
4099 -- aggregate for a null record type was established by AI05-016.
4101 elsif No (First_Entity (Typ))
4102 and then Ada_Version < Ada_2005
4104 Error_Msg_N ("record aggregate must be null", N);
4108 -- STEP 2: Verify aggregate structure
4112 Bad_Aggregate : Boolean := False;
4113 Selector_Name : Node_Id;
4116 if Present (Component_Associations (N)) then
4117 Assoc := First (Component_Associations (N));
4122 while Present (Assoc) loop
4123 Selector_Name := First (Choices (Assoc));
4124 while Present (Selector_Name) loop
4125 if Nkind (Selector_Name) = N_Identifier then
4128 elsif Nkind (Selector_Name) = N_Others_Choice then
4129 if Selector_Name /= First (Choices (Assoc))
4130 or else Present (Next (Selector_Name))
4133 ("OTHERS must appear alone in a choice list",
4137 elsif Present (Next (Assoc)) then
4139 ("OTHERS must appear last in an aggregate",
4143 -- (Ada 2005): If this is an association with a box,
4144 -- indicate that the association need not represent
4147 elsif Box_Present (Assoc) then
4154 ("selector name should be identifier or OTHERS",
4156 Bad_Aggregate := True;
4159 Next (Selector_Name);
4165 if Bad_Aggregate then
4170 -- STEP 3: Find discriminant Values
4173 Discrim : Entity_Id;
4174 Missing_Discriminants : Boolean := False;
4177 if Present (Expressions (N)) then
4178 Positional_Expr := First (Expressions (N));
4180 Positional_Expr := Empty;
4183 -- AI05-0115: if the ancestor part is a subtype mark, the ancestor
4184 -- must not have unknown discriminants.
4186 if Is_Derived_Type (Typ)
4187 and then Has_Unknown_Discriminants (Root_Type (Typ))
4188 and then Nkind (N) /= N_Extension_Aggregate
4191 ("aggregate not available for type& whose ancestor "
4192 & "has unknown discriminants ", N, Typ);
4195 if Has_Unknown_Discriminants (Typ)
4196 and then Present (Underlying_Record_View (Typ))
4198 Discrim := First_Discriminant (Underlying_Record_View (Typ));
4199 elsif Has_Discriminants (Typ) then
4200 Discrim := First_Discriminant (Typ);
4205 -- First find the discriminant values in the positional components
4207 while Present (Discrim) and then Present (Positional_Expr) loop
4208 if Discriminant_Present (Discrim) then
4209 Resolve_Aggr_Expr (Positional_Expr, Discrim);
4211 -- Ada 2005 (AI-231)
4213 if Ada_Version >= Ada_2005
4214 and then Known_Null (Positional_Expr)
4216 Check_Can_Never_Be_Null (Discrim, Positional_Expr);
4219 Next (Positional_Expr);
4222 if Present (Get_Value (Discrim, Component_Associations (N))) then
4224 ("more than one value supplied for discriminant&",
4228 Next_Discriminant (Discrim);
4231 -- Find remaining discriminant values if any among named components
4233 while Present (Discrim) loop
4234 Expr := Get_Value (Discrim, Component_Associations (N), True);
4236 if not Discriminant_Present (Discrim) then
4237 if Present (Expr) then
4239 ("more than one value supplied for discriminant &",
4243 elsif No (Expr) then
4245 ("no value supplied for discriminant &", N, Discrim);
4246 Missing_Discriminants := True;
4249 Resolve_Aggr_Expr (Expr, Discrim);
4252 Next_Discriminant (Discrim);
4255 if Missing_Discriminants then
4259 -- At this point and until the beginning of STEP 6, New_Assoc_List
4260 -- contains only the discriminants and their values.
4264 -- STEP 4: Set the Etype of the record aggregate
4266 -- ??? This code is pretty much a copy of Sem_Ch3.Build_Subtype. That
4267 -- routine should really be exported in sem_util or some such and used
4268 -- in sem_ch3 and here rather than have a copy of the code which is a
4269 -- maintenance nightmare.
4271 -- ??? Performance WARNING. The current implementation creates a new
4272 -- itype for all aggregates whose base type is discriminated. This means
4273 -- that for record aggregates nested inside an array aggregate we will
4274 -- create a new itype for each record aggregate if the array component
4275 -- type has discriminants. For large aggregates this may be a problem.
4276 -- What should be done in this case is to reuse itypes as much as
4279 if Has_Discriminants (Typ)
4280 or else (Has_Unknown_Discriminants (Typ)
4281 and then Present (Underlying_Record_View (Typ)))
4283 Build_Constrained_Itype : declare
4284 Constrs : constant List_Id := New_List;
4285 Loc : constant Source_Ptr := Sloc (N);
4288 New_Assoc : Node_Id;
4289 Subtyp_Decl : Node_Id;
4292 New_Assoc := First (New_Assoc_List);
4293 while Present (New_Assoc) loop
4294 Append_To (Constrs, Duplicate_Subexpr (Expression (New_Assoc)));
4298 if Has_Unknown_Discriminants (Typ)
4299 and then Present (Underlying_Record_View (Typ))
4302 Make_Subtype_Indication (Loc,
4304 New_Occurrence_Of (Underlying_Record_View (Typ), Loc),
4306 Make_Index_Or_Discriminant_Constraint (Loc,
4307 Constraints => Constrs));
4310 Make_Subtype_Indication (Loc,
4312 New_Occurrence_Of (Base_Type (Typ), Loc),
4314 Make_Index_Or_Discriminant_Constraint (Loc,
4315 Constraints => Constrs));
4318 Def_Id := Create_Itype (Ekind (Typ), N);
4321 Make_Subtype_Declaration (Loc,
4322 Defining_Identifier => Def_Id,
4323 Subtype_Indication => Indic);
4324 Set_Parent (Subtyp_Decl, Parent (N));
4326 -- Itypes must be analyzed with checks off (see itypes.ads)
4328 Analyze (Subtyp_Decl, Suppress => All_Checks);
4330 Set_Etype (N, Def_Id);
4331 Check_Static_Discriminated_Subtype
4332 (Def_Id, Expression (First (New_Assoc_List)));
4333 end Build_Constrained_Itype;
4339 -- STEP 5: Get remaining components according to discriminant values
4343 Errors_Found : Boolean := False;
4344 Record_Def : Node_Id;
4345 Parent_Typ : Entity_Id;
4346 Parent_Typ_List : Elist_Id;
4347 Parent_Elmt : Elmt_Id;
4348 Root_Typ : Entity_Id;
4351 if Is_Derived_Type (Typ) and then Is_Tagged_Type (Typ) then
4352 Parent_Typ_List := New_Elmt_List;
4354 -- If this is an extension aggregate, the component list must
4355 -- include all components that are not in the given ancestor type.
4356 -- Otherwise, the component list must include components of all
4357 -- ancestors, starting with the root.
4359 if Nkind (N) = N_Extension_Aggregate then
4360 Root_Typ := Base_Type (Etype (Ancestor_Part (N)));
4363 -- AI05-0115: check legality of aggregate for type with a
4364 -- private ancestor.
4366 Root_Typ := Root_Type (Typ);
4367 if Has_Private_Ancestor (Typ) then
4369 Ancestor : constant Entity_Id :=
4370 Find_Private_Ancestor (Typ);
4371 Ancestor_Unit : constant Entity_Id :=
4373 (Get_Source_Unit (Ancestor));
4374 Parent_Unit : constant Entity_Id :=
4375 Cunit_Entity (Get_Source_Unit
4376 (Base_Type (Etype (Ancestor))));
4378 -- Check whether we are in a scope that has full view
4379 -- over the private ancestor and its parent. This can
4380 -- only happen if the derivation takes place in a child
4381 -- unit of the unit that declares the parent, and we are
4382 -- in the private part or body of that child unit, else
4383 -- the aggregate is illegal.
4385 if Is_Child_Unit (Ancestor_Unit)
4386 and then Scope (Ancestor_Unit) = Parent_Unit
4387 and then In_Open_Scopes (Scope (Ancestor))
4389 (In_Private_Part (Scope (Ancestor))
4390 or else In_Package_Body (Scope (Ancestor)))
4396 ("type of aggregate has private ancestor&!",
4398 Error_Msg_N ("must use extension aggregate!", N);
4404 Dnode := Declaration_Node (Base_Type (Root_Typ));
4406 -- If we don't get a full declaration, then we have some error
4407 -- which will get signalled later so skip this part. Otherwise
4408 -- gather components of root that apply to the aggregate type.
4409 -- We use the base type in case there is an applicable stored
4410 -- constraint that renames the discriminants of the root.
4412 if Nkind (Dnode) = N_Full_Type_Declaration then
4413 Record_Def := Type_Definition (Dnode);
4416 Component_List (Record_Def),
4417 Governed_By => New_Assoc_List,
4419 Report_Errors => Errors_Found);
4421 if Errors_Found then
4423 ("discriminant controlling variant part is not static",
4430 Parent_Typ := Base_Type (Typ);
4431 while Parent_Typ /= Root_Typ loop
4432 Prepend_Elmt (Parent_Typ, To => Parent_Typ_List);
4433 Parent_Typ := Etype (Parent_Typ);
4435 if Nkind (Parent (Base_Type (Parent_Typ))) =
4436 N_Private_Type_Declaration
4437 or else Nkind (Parent (Base_Type (Parent_Typ))) =
4438 N_Private_Extension_Declaration
4440 if Nkind (N) /= N_Extension_Aggregate then
4442 ("type of aggregate has private ancestor&!",
4444 Error_Msg_N ("must use extension aggregate!", N);
4447 elsif Parent_Typ /= Root_Typ then
4449 ("ancestor part of aggregate must be private type&",
4450 Ancestor_Part (N), Parent_Typ);
4454 -- The current view of ancestor part may be a private type,
4455 -- while the context type is always non-private.
4457 elsif Is_Private_Type (Root_Typ)
4458 and then Present (Full_View (Root_Typ))
4459 and then Nkind (N) = N_Extension_Aggregate
4461 exit when Base_Type (Full_View (Root_Typ)) = Parent_Typ;
4465 -- Now collect components from all other ancestors, beginning
4466 -- with the current type. If the type has unknown discriminants
4467 -- use the component list of the Underlying_Record_View, which
4468 -- needs to be used for the subsequent expansion of the aggregate
4469 -- into assignments.
4471 Parent_Elmt := First_Elmt (Parent_Typ_List);
4472 while Present (Parent_Elmt) loop
4473 Parent_Typ := Node (Parent_Elmt);
4475 if Has_Unknown_Discriminants (Parent_Typ)
4476 and then Present (Underlying_Record_View (Typ))
4478 Parent_Typ := Underlying_Record_View (Parent_Typ);
4481 Record_Def := Type_Definition (Parent (Base_Type (Parent_Typ)));
4482 Gather_Components (Empty,
4483 Component_List (Record_Extension_Part (Record_Def)),
4484 Governed_By => New_Assoc_List,
4486 Report_Errors => Errors_Found);
4488 Next_Elmt (Parent_Elmt);
4491 -- Typ is not a derived tagged type
4494 Record_Def := Type_Definition (Parent (Base_Type (Typ)));
4496 if Null_Present (Record_Def) then
4499 elsif not Has_Unknown_Discriminants (Typ) then
4502 Component_List (Record_Def),
4503 Governed_By => New_Assoc_List,
4505 Report_Errors => Errors_Found);
4509 (Base_Type (Underlying_Record_View (Typ)),
4510 Component_List (Record_Def),
4511 Governed_By => New_Assoc_List,
4513 Report_Errors => Errors_Found);
4517 if Errors_Found then
4522 -- STEP 6: Find component Values
4525 Component_Elmt := First_Elmt (Components);
4527 -- First scan the remaining positional associations in the aggregate.
4528 -- Remember that at this point Positional_Expr contains the current
4529 -- positional association if any is left after looking for discriminant
4530 -- values in step 3.
4532 while Present (Positional_Expr) and then Present (Component_Elmt) loop
4533 Component := Node (Component_Elmt);
4534 Resolve_Aggr_Expr (Positional_Expr, Component);
4536 -- Ada 2005 (AI-231)
4538 if Ada_Version >= Ada_2005 and then Known_Null (Positional_Expr) then
4539 Check_Can_Never_Be_Null (Component, Positional_Expr);
4542 if Present (Get_Value (Component, Component_Associations (N))) then
4544 ("more than one value supplied for Component &", N, Component);
4547 Next (Positional_Expr);
4548 Next_Elmt (Component_Elmt);
4551 if Present (Positional_Expr) then
4553 ("too many components for record aggregate", Positional_Expr);
4556 -- Now scan for the named arguments of the aggregate
4558 while Present (Component_Elmt) loop
4559 Component := Node (Component_Elmt);
4560 Expr := Get_Value (Component, Component_Associations (N), True);
4562 -- Note: The previous call to Get_Value sets the value of the
4563 -- variable Is_Box_Present.
4565 -- Ada 2005 (AI-287): Handle components with default initialization.
4566 -- Note: This feature was originally added to Ada 2005 for limited
4567 -- but it was finally allowed with any type.
4569 if Is_Box_Present then
4570 Check_Box_Component : declare
4571 Ctyp : constant Entity_Id := Etype (Component);
4574 -- If there is a default expression for the aggregate, copy
4575 -- it into a new association. This copy must modify the scopes
4576 -- of internal types that may be attached to the expression
4577 -- (e.g. index subtypes of arrays) because in general the type
4578 -- declaration and the aggregate appear in different scopes,
4579 -- and the backend requires the scope of the type to match the
4580 -- point at which it is elaborated.
4582 -- If the component has an initialization procedure (IP) we
4583 -- pass the component to the expander, which will generate
4584 -- the call to such IP.
4586 -- If the component has discriminants, their values must
4587 -- be taken from their subtype. This is indispensable for
4588 -- constraints that are given by the current instance of an
4589 -- enclosing type, to allow the expansion of the aggregate to
4590 -- replace the reference to the current instance by the target
4591 -- object of the aggregate.
4593 if Present (Parent (Component))
4594 and then Nkind (Parent (Component)) = N_Component_Declaration
4595 and then Present (Expression (Parent (Component)))
4598 New_Copy_Tree_And_Copy_Dimensions
4599 (Expression (Parent (Component)),
4600 New_Scope => Current_Scope,
4601 New_Sloc => Sloc (N));
4604 (Component => Component,
4606 Assoc_List => New_Assoc_List);
4607 Set_Has_Self_Reference (N);
4609 -- A box-defaulted access component gets the value null. Also
4610 -- included are components of private types whose underlying
4611 -- type is an access type. In either case set the type of the
4612 -- literal, for subsequent use in semantic checks.
4614 elsif Present (Underlying_Type (Ctyp))
4615 and then Is_Access_Type (Underlying_Type (Ctyp))
4617 -- If the component's type is private with an access type as
4618 -- its underlying type then we have to create an unchecked
4619 -- conversion to satisfy type checking.
4621 if Is_Private_Type (Ctyp) then
4623 Qual_Null : constant Node_Id :=
4624 Make_Qualified_Expression (Sloc (N),
4627 (Underlying_Type (Ctyp), Sloc (N)),
4628 Expression => Make_Null (Sloc (N)));
4630 Convert_Null : constant Node_Id :=
4631 Unchecked_Convert_To
4635 Analyze_And_Resolve (Convert_Null, Ctyp);
4637 (Component => Component,
4638 Expr => Convert_Null,
4639 Assoc_List => New_Assoc_List);
4642 -- Otherwise the component type is non-private
4645 Expr := Make_Null (Sloc (N));
4646 Set_Etype (Expr, Ctyp);
4649 (Component => Component,
4651 Assoc_List => New_Assoc_List);
4654 -- Ada 2012: If component is scalar with default value, use it
4656 elsif Is_Scalar_Type (Ctyp)
4657 and then Has_Default_Aspect (Ctyp)
4660 (Component => Component,
4662 Default_Aspect_Value
4663 (First_Subtype (Underlying_Type (Ctyp))),
4664 Assoc_List => New_Assoc_List);
4666 elsif Has_Non_Null_Base_Init_Proc (Ctyp)
4667 or else not Expander_Active
4669 if Is_Record_Type (Ctyp)
4670 and then Has_Discriminants (Ctyp)
4671 and then not Is_Private_Type (Ctyp)
4673 -- We build a partially initialized aggregate with the
4674 -- values of the discriminants and box initialization
4675 -- for the rest, if other components are present.
4677 -- The type of the aggregate is the known subtype of
4678 -- the component. The capture of discriminants must be
4679 -- recursive because subcomponents may be constrained
4680 -- (transitively) by discriminants of enclosing types.
4681 -- For a private type with discriminants, a call to the
4682 -- initialization procedure will be generated, and no
4683 -- subaggregate is needed.
4685 Capture_Discriminants : declare
4686 Loc : constant Source_Ptr := Sloc (N);
4690 Expr := Make_Aggregate (Loc, New_List, New_List);
4691 Set_Etype (Expr, Ctyp);
4693 -- If the enclosing type has discriminants, they have
4694 -- been collected in the aggregate earlier, and they
4695 -- may appear as constraints of subcomponents.
4697 -- Similarly if this component has discriminants, they
4698 -- might in turn be propagated to their components.
4700 if Has_Discriminants (Typ) then
4701 Add_Discriminant_Values (Expr, New_Assoc_List);
4702 Propagate_Discriminants (Expr, New_Assoc_List);
4704 elsif Has_Discriminants (Ctyp) then
4705 Add_Discriminant_Values
4706 (Expr, Component_Associations (Expr));
4707 Propagate_Discriminants
4708 (Expr, Component_Associations (Expr));
4715 -- If the type has additional components, create
4716 -- an OTHERS box association for them.
4718 Comp := First_Component (Ctyp);
4719 while Present (Comp) loop
4720 if Ekind (Comp) = E_Component then
4721 if not Is_Record_Type (Etype (Comp)) then
4723 (Component_Associations (Expr),
4724 Make_Component_Association (Loc,
4727 Make_Others_Choice (Loc)),
4728 Expression => Empty,
4729 Box_Present => True));
4735 Next_Component (Comp);
4741 (Component => Component,
4743 Assoc_List => New_Assoc_List);
4744 end Capture_Discriminants;
4746 -- Otherwise the component type is not a record, or it has
4747 -- not discriminants, or it is private.
4751 (Component => Component,
4753 Assoc_List => New_Assoc_List,
4754 Is_Box_Present => True);
4757 -- Otherwise we only need to resolve the expression if the
4758 -- component has partially initialized values (required to
4759 -- expand the corresponding assignments and run-time checks).
4761 elsif Present (Expr)
4762 and then Is_Partially_Initialized_Type (Ctyp)
4764 Resolve_Aggr_Expr (Expr, Component);
4766 end Check_Box_Component;
4768 elsif No (Expr) then
4770 -- Ignore hidden components associated with the position of the
4771 -- interface tags: these are initialized dynamically.
4773 if not Present (Related_Type (Component)) then
4775 ("no value supplied for component &!", N, Component);
4779 Resolve_Aggr_Expr (Expr, Component);
4782 Next_Elmt (Component_Elmt);
4785 -- STEP 7: check for invalid components + check type in choice list
4789 New_Assoc : Node_Id;
4795 -- Type of first component in choice list
4798 if Present (Component_Associations (N)) then
4799 Assoc := First (Component_Associations (N));
4804 Verification : while Present (Assoc) loop
4805 Selectr := First (Choices (Assoc));
4808 if Nkind (Selectr) = N_Others_Choice then
4810 -- Ada 2005 (AI-287): others choice may have expression or box
4812 if No (Others_Etype) and then Others_Box = 0 then
4814 ("OTHERS must represent at least one component", Selectr);
4816 elsif Others_Box = 1 and then Warn_On_Redundant_Constructs then
4817 Error_Msg_N ("others choice is redundant?", Box_Node);
4819 ("\previous choices cover all components?", Box_Node);
4825 while Present (Selectr) loop
4826 New_Assoc := First (New_Assoc_List);
4827 while Present (New_Assoc) loop
4828 Component := First (Choices (New_Assoc));
4830 if Chars (Selectr) = Chars (Component) then
4832 Check_Identifier (Selectr, Entity (Component));
4841 -- If no association, this is not a legal component of the type
4842 -- in question, unless its association is provided with a box.
4844 if No (New_Assoc) then
4845 if Box_Present (Parent (Selectr)) then
4847 -- This may still be a bogus component with a box. Scan
4848 -- list of components to verify that a component with
4849 -- that name exists.
4855 C := First_Component (Typ);
4856 while Present (C) loop
4857 if Chars (C) = Chars (Selectr) then
4859 -- If the context is an extension aggregate,
4860 -- the component must not be inherited from
4861 -- the ancestor part of the aggregate.
4863 if Nkind (N) /= N_Extension_Aggregate
4865 Scope (Original_Record_Component (C)) /=
4866 Etype (Ancestor_Part (N))
4876 Error_Msg_Node_2 := Typ;
4877 Error_Msg_N ("& is not a component of}", Selectr);
4881 elsif Chars (Selectr) /= Name_uTag
4882 and then Chars (Selectr) /= Name_uParent
4884 if not Has_Discriminants (Typ) then
4885 Error_Msg_Node_2 := Typ;
4886 Error_Msg_N ("& is not a component of}", Selectr);
4889 ("& is not a component of the aggregate subtype",
4893 Check_Misspelled_Component (Components, Selectr);
4896 elsif No (Typech) then
4897 Typech := Base_Type (Etype (Component));
4899 -- AI05-0199: In Ada 2012, several components of anonymous
4900 -- access types can appear in a choice list, as long as the
4901 -- designated types match.
4903 elsif Typech /= Base_Type (Etype (Component)) then
4904 if Ada_Version >= Ada_2012
4905 and then Ekind (Typech) = E_Anonymous_Access_Type
4907 Ekind (Etype (Component)) = E_Anonymous_Access_Type
4908 and then Base_Type (Designated_Type (Typech)) =
4909 Base_Type (Designated_Type (Etype (Component)))
4911 Subtypes_Statically_Match (Typech, (Etype (Component)))
4915 elsif not Box_Present (Parent (Selectr)) then
4917 ("components in choice list must have same type",
4926 end loop Verification;
4929 -- STEP 8: replace the original aggregate
4932 New_Aggregate : constant Node_Id := New_Copy (N);
4935 Set_Expressions (New_Aggregate, No_List);
4936 Set_Etype (New_Aggregate, Etype (N));
4937 Set_Component_Associations (New_Aggregate, New_Assoc_List);
4938 Set_Check_Actuals (New_Aggregate, Check_Actuals (N));
4940 Rewrite (N, New_Aggregate);
4943 -- Check the dimensions of the components in the record aggregate
4945 Analyze_Dimension_Extension_Or_Record_Aggregate (N);
4946 end Resolve_Record_Aggregate;
4948 -----------------------------
4949 -- Check_Can_Never_Be_Null --
4950 -----------------------------
4952 procedure Check_Can_Never_Be_Null (Typ : Entity_Id; Expr : Node_Id) is
4953 Comp_Typ : Entity_Id;
4957 (Ada_Version >= Ada_2005
4958 and then Present (Expr)
4959 and then Known_Null (Expr));
4962 when E_Array_Type =>
4963 Comp_Typ := Component_Type (Typ);
4968 Comp_Typ := Etype (Typ);
4974 if Can_Never_Be_Null (Comp_Typ) then
4976 -- Here we know we have a constraint error. Note that we do not use
4977 -- Apply_Compile_Time_Constraint_Error here to the Expr, which might
4978 -- seem the more natural approach. That's because in some cases the
4979 -- components are rewritten, and the replacement would be missed.
4980 -- We do not mark the whole aggregate as raising a constraint error,
4981 -- because the association may be a null array range.
4984 ("(Ada 2005) null not allowed in null-excluding component??", Expr);
4986 ("\Constraint_Error will be raised at run time??", Expr);
4989 Make_Raise_Constraint_Error
4990 (Sloc (Expr), Reason => CE_Access_Check_Failed));
4991 Set_Etype (Expr, Comp_Typ);
4992 Set_Analyzed (Expr);
4994 end Check_Can_Never_Be_Null;
4996 ---------------------
4997 -- Sort_Case_Table --
4998 ---------------------
5000 procedure Sort_Case_Table (Case_Table : in out Case_Table_Type) is
5001 U : constant Int := Case_Table'Last;
5009 T := Case_Table (K + 1);
5013 and then Expr_Value (Case_Table (J - 1).Lo) > Expr_Value (T.Lo)
5015 Case_Table (J) := Case_Table (J - 1);
5019 Case_Table (J) := T;
5022 end Sort_Case_Table;