1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2010, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree
; use Atree
;
27 with Checks
; use Checks
;
28 with Einfo
; use Einfo
;
29 with Elists
; use Elists
;
30 with Errout
; use Errout
;
31 with Expander
; use Expander
;
32 with Exp_Tss
; use Exp_Tss
;
33 with Exp_Util
; use Exp_Util
;
34 with Freeze
; use Freeze
;
35 with Itypes
; use Itypes
;
37 with Lib
.Xref
; use Lib
.Xref
;
38 with Namet
; use Namet
;
39 with Namet
.Sp
; use Namet
.Sp
;
40 with Nmake
; use Nmake
;
41 with Nlists
; use Nlists
;
44 with Sem_Aux
; use Sem_Aux
;
45 with Sem_Cat
; use Sem_Cat
;
46 with Sem_Ch3
; use Sem_Ch3
;
47 with Sem_Ch13
; use Sem_Ch13
;
48 with Sem_Eval
; use Sem_Eval
;
49 with Sem_Res
; use Sem_Res
;
50 with Sem_Util
; use Sem_Util
;
51 with Sem_Type
; use Sem_Type
;
52 with Sem_Warn
; use Sem_Warn
;
53 with Sinfo
; use Sinfo
;
54 with Snames
; use Snames
;
55 with Stringt
; use Stringt
;
56 with Stand
; use Stand
;
57 with Style
; use Style
;
58 with Targparm
; use Targparm
;
59 with Tbuild
; use Tbuild
;
60 with Uintp
; use Uintp
;
62 package body Sem_Aggr
is
64 type Case_Bounds
is record
67 Choice_Node
: Node_Id
;
70 type Case_Table_Type
is array (Nat
range <>) of Case_Bounds
;
71 -- Table type used by Check_Case_Choices procedure
73 -----------------------
74 -- Local Subprograms --
75 -----------------------
77 procedure Sort_Case_Table
(Case_Table
: in out Case_Table_Type
);
78 -- Sort the Case Table using the Lower Bound of each Choice as the key.
79 -- A simple insertion sort is used since the number of choices in a case
80 -- statement of variant part will usually be small and probably in near
83 procedure Check_Can_Never_Be_Null
(Typ
: Entity_Id
; Expr
: Node_Id
);
84 -- Ada 2005 (AI-231): Check bad usage of null for a component for which
85 -- null exclusion (NOT NULL) is specified. Typ can be an E_Array_Type for
86 -- the array case (the component type of the array will be used) or an
87 -- E_Component/E_Discriminant entity in the record case, in which case the
88 -- type of the component will be used for the test. If Typ is any other
89 -- kind of entity, the call is ignored. Expr is the component node in the
90 -- aggregate which is known to have a null value. A warning message will be
91 -- issued if the component is null excluding.
93 -- It would be better to pass the proper type for Typ ???
95 procedure Check_Expr_OK_In_Limited_Aggregate
(Expr
: Node_Id
);
96 -- Check that Expr is either not limited or else is one of the cases of
97 -- expressions allowed for a limited component association (namely, an
98 -- aggregate, function call, or <> notation). Report error for violations.
100 ------------------------------------------------------
101 -- Subprograms used for RECORD AGGREGATE Processing --
102 ------------------------------------------------------
104 procedure Resolve_Record_Aggregate
(N
: Node_Id
; Typ
: Entity_Id
);
105 -- This procedure performs all the semantic checks required for record
106 -- aggregates. Note that for aggregates analysis and resolution go
107 -- hand in hand. Aggregate analysis has been delayed up to here and
108 -- it is done while resolving the aggregate.
110 -- N is the N_Aggregate node.
111 -- Typ is the record type for the aggregate resolution
113 -- While performing the semantic checks, this procedure builds a new
114 -- Component_Association_List where each record field appears alone in a
115 -- Component_Choice_List along with its corresponding expression. The
116 -- record fields in the Component_Association_List appear in the same order
117 -- in which they appear in the record type Typ.
119 -- Once this new Component_Association_List is built and all the semantic
120 -- checks performed, the original aggregate subtree is replaced with the
121 -- new named record aggregate just built. Note that subtree substitution is
122 -- performed with Rewrite so as to be able to retrieve the original
125 -- The aggregate subtree manipulation performed by Resolve_Record_Aggregate
126 -- yields the aggregate format expected by Gigi. Typically, this kind of
127 -- tree manipulations are done in the expander. However, because the
128 -- semantic checks that need to be performed on record aggregates really go
129 -- hand in hand with the record aggregate normalization, the aggregate
130 -- subtree transformation is performed during resolution rather than
131 -- expansion. Had we decided otherwise we would have had to duplicate most
132 -- of the code in the expansion procedure Expand_Record_Aggregate. Note,
133 -- however, that all the expansion concerning aggregates for tagged records
134 -- is done in Expand_Record_Aggregate.
136 -- The algorithm of Resolve_Record_Aggregate proceeds as follows:
138 -- 1. Make sure that the record type against which the record aggregate
139 -- has to be resolved is not abstract. Furthermore if the type is a
140 -- null aggregate make sure the input aggregate N is also null.
142 -- 2. Verify that the structure of the aggregate is that of a record
143 -- aggregate. Specifically, look for component associations and ensure
144 -- that each choice list only has identifiers or the N_Others_Choice
145 -- node. Also make sure that if present, the N_Others_Choice occurs
146 -- last and by itself.
148 -- 3. If Typ contains discriminants, the values for each discriminant is
149 -- looked for. If the record type Typ has variants, we check that the
150 -- expressions corresponding to each discriminant ruling the (possibly
151 -- nested) variant parts of Typ, are static. This allows us to determine
152 -- the variant parts to which the rest of the aggregate must conform.
153 -- The names of discriminants with their values are saved in a new
154 -- association list, New_Assoc_List which is later augmented with the
155 -- names and values of the remaining components in the record type.
157 -- During this phase we also make sure that every discriminant is
158 -- assigned exactly one value. Note that when several values for a given
159 -- discriminant are found, semantic processing continues looking for
160 -- further errors. In this case it's the first discriminant value found
161 -- which we will be recorded.
163 -- IMPORTANT NOTE: For derived tagged types this procedure expects
164 -- First_Discriminant and Next_Discriminant to give the correct list
165 -- of discriminants, in the correct order.
167 -- 4. After all the discriminant values have been gathered, we can set the
168 -- Etype of the record aggregate. If Typ contains no discriminants this
169 -- is straightforward: the Etype of N is just Typ, otherwise a new
170 -- implicit constrained subtype of Typ is built to be the Etype of N.
172 -- 5. Gather the remaining record components according to the discriminant
173 -- values. This involves recursively traversing the record type
174 -- structure to see what variants are selected by the given discriminant
175 -- values. This processing is a little more convoluted if Typ is a
176 -- derived tagged types since we need to retrieve the record structure
177 -- of all the ancestors of Typ.
179 -- 6. After gathering the record components we look for their values in the
180 -- record aggregate and emit appropriate error messages should we not
181 -- find such values or should they be duplicated.
183 -- 7. We then make sure no illegal component names appear in the record
184 -- aggregate and make sure that the type of the record components
185 -- appearing in a same choice list is the same. Finally we ensure that
186 -- the others choice, if present, is used to provide the value of at
187 -- least a record component.
189 -- 8. The original aggregate node is replaced with the new named aggregate
190 -- built in steps 3 through 6, as explained earlier.
192 -- Given the complexity of record aggregate resolution, the primary goal of
193 -- this routine is clarity and simplicity rather than execution and storage
194 -- efficiency. If there are only positional components in the aggregate the
195 -- running time is linear. If there are associations the running time is
196 -- still linear as long as the order of the associations is not too far off
197 -- the order of the components in the record type. If this is not the case
198 -- the running time is at worst quadratic in the size of the association
201 procedure Check_Misspelled_Component
202 (Elements
: Elist_Id
;
203 Component
: Node_Id
);
204 -- Give possible misspelling diagnostic if Component is likely to be a
205 -- misspelling of one of the components of the Assoc_List. This is called
206 -- by Resolve_Aggr_Expr after producing an invalid component error message.
208 procedure Check_Static_Discriminated_Subtype
(T
: Entity_Id
; V
: Node_Id
);
209 -- An optimization: determine whether a discriminated subtype has a static
210 -- constraint, and contains array components whose length is also static,
211 -- either because they are constrained by the discriminant, or because the
212 -- original component bounds are static.
214 -----------------------------------------------------
215 -- Subprograms used for ARRAY AGGREGATE Processing --
216 -----------------------------------------------------
218 function Resolve_Array_Aggregate
221 Index_Constr
: Node_Id
;
222 Component_Typ
: Entity_Id
;
223 Others_Allowed
: Boolean) return Boolean;
224 -- This procedure performs the semantic checks for an array aggregate.
225 -- True is returned if the aggregate resolution succeeds.
227 -- The procedure works by recursively checking each nested aggregate.
228 -- Specifically, after checking a sub-aggregate nested at the i-th level
229 -- we recursively check all the subaggregates at the i+1-st level (if any).
230 -- Note that for aggregates analysis and resolution go hand in hand.
231 -- Aggregate analysis has been delayed up to here and it is done while
232 -- resolving the aggregate.
234 -- N is the current N_Aggregate node to be checked.
236 -- Index is the index node corresponding to the array sub-aggregate that
237 -- we are currently checking (RM 4.3.3 (8)). Its Etype is the
238 -- corresponding index type (or subtype).
240 -- Index_Constr is the node giving the applicable index constraint if
241 -- any (RM 4.3.3 (10)). It "is a constraint provided by certain
242 -- contexts [...] that can be used to determine the bounds of the array
243 -- value specified by the aggregate". If Others_Allowed below is False
244 -- there is no applicable index constraint and this node is set to Index.
246 -- Component_Typ is the array component type.
248 -- Others_Allowed indicates whether an others choice is allowed
249 -- in the context where the top-level aggregate appeared.
251 -- The algorithm of Resolve_Array_Aggregate proceeds as follows:
253 -- 1. Make sure that the others choice, if present, is by itself and
254 -- appears last in the sub-aggregate. Check that we do not have
255 -- positional and named components in the array sub-aggregate (unless
256 -- the named association is an others choice). Finally if an others
257 -- choice is present, make sure it is allowed in the aggregate context.
259 -- 2. If the array sub-aggregate contains discrete_choices:
261 -- (A) Verify their validity. Specifically verify that:
263 -- (a) If a null range is present it must be the only possible
264 -- choice in the array aggregate.
266 -- (b) Ditto for a non static range.
268 -- (c) Ditto for a non static expression.
270 -- In addition this step analyzes and resolves each discrete_choice,
271 -- making sure that its type is the type of the corresponding Index.
272 -- If we are not at the lowest array aggregate level (in the case of
273 -- multi-dimensional aggregates) then invoke Resolve_Array_Aggregate
274 -- recursively on each component expression. Otherwise, resolve the
275 -- bottom level component expressions against the expected component
276 -- type ONLY IF the component corresponds to a single discrete choice
277 -- which is not an others choice (to see why read the DELAYED
278 -- COMPONENT RESOLUTION below).
280 -- (B) Determine the bounds of the sub-aggregate and lowest and
281 -- highest choice values.
283 -- 3. For positional aggregates:
285 -- (A) Loop over the component expressions either recursively invoking
286 -- Resolve_Array_Aggregate on each of these for multi-dimensional
287 -- array aggregates or resolving the bottom level component
288 -- expressions against the expected component type.
290 -- (B) Determine the bounds of the positional sub-aggregates.
292 -- 4. Try to determine statically whether the evaluation of the array
293 -- sub-aggregate raises Constraint_Error. If yes emit proper
294 -- warnings. The precise checks are the following:
296 -- (A) Check that the index range defined by aggregate bounds is
297 -- compatible with corresponding index subtype.
298 -- We also check against the base type. In fact it could be that
299 -- Low/High bounds of the base type are static whereas those of
300 -- the index subtype are not. Thus if we can statically catch
301 -- a problem with respect to the base type we are guaranteed
302 -- that the same problem will arise with the index subtype
304 -- (B) If we are dealing with a named aggregate containing an others
305 -- choice and at least one discrete choice then make sure the range
306 -- specified by the discrete choices does not overflow the
307 -- aggregate bounds. We also check against the index type and base
308 -- type bounds for the same reasons given in (A).
310 -- (C) If we are dealing with a positional aggregate with an others
311 -- choice make sure the number of positional elements specified
312 -- does not overflow the aggregate bounds. We also check against
313 -- the index type and base type bounds as mentioned in (A).
315 -- Finally construct an N_Range node giving the sub-aggregate bounds.
316 -- Set the Aggregate_Bounds field of the sub-aggregate to be this
317 -- N_Range. The routine Array_Aggr_Subtype below uses such N_Ranges
318 -- to build the appropriate aggregate subtype. Aggregate_Bounds
319 -- information is needed during expansion.
321 -- DELAYED COMPONENT RESOLUTION: The resolution of bottom level component
322 -- expressions in an array aggregate may call Duplicate_Subexpr or some
323 -- other routine that inserts code just outside the outermost aggregate.
324 -- If the array aggregate contains discrete choices or an others choice,
325 -- this may be wrong. Consider for instance the following example.
327 -- type Rec is record
331 -- type Acc_Rec is access Rec;
332 -- Arr : array (1..3) of Acc_Rec := (1 .. 3 => new Rec);
334 -- Then the transformation of "new Rec" that occurs during resolution
335 -- entails the following code modifications
337 -- P7b : constant Acc_Rec := new Rec;
339 -- Arr : array (1..3) of Acc_Rec := (1 .. 3 => P7b);
341 -- This code transformation is clearly wrong, since we need to call
342 -- "new Rec" for each of the 3 array elements. To avoid this problem we
343 -- delay resolution of the components of non positional array aggregates
344 -- to the expansion phase. As an optimization, if the discrete choice
345 -- specifies a single value we do not delay resolution.
347 function Array_Aggr_Subtype
(N
: Node_Id
; Typ
: Node_Id
) return Entity_Id
;
348 -- This routine returns the type or subtype of an array aggregate.
350 -- N is the array aggregate node whose type we return.
352 -- Typ is the context type in which N occurs.
354 -- This routine creates an implicit array subtype whose bounds are
355 -- those defined by the aggregate. When this routine is invoked
356 -- Resolve_Array_Aggregate has already processed aggregate N. Thus the
357 -- Aggregate_Bounds of each sub-aggregate, is an N_Range node giving the
358 -- sub-aggregate bounds. When building the aggregate itype, this function
359 -- traverses the array aggregate N collecting such Aggregate_Bounds and
360 -- constructs the proper array aggregate itype.
362 -- Note that in the case of multidimensional aggregates each inner
363 -- sub-aggregate corresponding to a given array dimension, may provide a
364 -- different bounds. If it is possible to determine statically that
365 -- some sub-aggregates corresponding to the same index do not have the
366 -- same bounds, then a warning is emitted. If such check is not possible
367 -- statically (because some sub-aggregate bounds are dynamic expressions)
368 -- then this job is left to the expander. In all cases the particular
369 -- bounds that this function will chose for a given dimension is the first
370 -- N_Range node for a sub-aggregate corresponding to that dimension.
372 -- Note that the Raises_Constraint_Error flag of an array aggregate
373 -- whose evaluation is determined to raise CE by Resolve_Array_Aggregate,
374 -- is set in Resolve_Array_Aggregate but the aggregate is not
375 -- immediately replaced with a raise CE. In fact, Array_Aggr_Subtype must
376 -- first construct the proper itype for the aggregate (Gigi needs
377 -- this). After constructing the proper itype we will eventually replace
378 -- the top-level aggregate with a raise CE (done in Resolve_Aggregate).
379 -- Of course in cases such as:
381 -- type Arr is array (integer range <>) of Integer;
382 -- A : Arr := (positive range -1 .. 2 => 0);
384 -- The bounds of the aggregate itype are cooked up to look reasonable
385 -- (in this particular case the bounds will be 1 .. 2).
387 procedure Aggregate_Constraint_Checks
389 Check_Typ
: Entity_Id
);
390 -- Checks expression Exp against subtype Check_Typ. If Exp is an
391 -- aggregate and Check_Typ a constrained record type with discriminants,
392 -- we generate the appropriate discriminant checks. If Exp is an array
393 -- aggregate then emit the appropriate length checks. If Exp is a scalar
394 -- type, or a string literal, Exp is changed into Check_Typ'(Exp) to
395 -- ensure that range checks are performed at run time.
397 procedure Make_String_Into_Aggregate
(N
: Node_Id
);
398 -- A string literal can appear in a context in which a one dimensional
399 -- array of characters is expected. This procedure simply rewrites the
400 -- string as an aggregate, prior to resolution.
402 ---------------------------------
403 -- Aggregate_Constraint_Checks --
404 ---------------------------------
406 procedure Aggregate_Constraint_Checks
408 Check_Typ
: Entity_Id
)
410 Exp_Typ
: constant Entity_Id
:= Etype
(Exp
);
413 if Raises_Constraint_Error
(Exp
) then
417 -- Ada 2005 (AI-230): Generate a conversion to an anonymous access
418 -- component's type to force the appropriate accessibility checks.
420 -- Ada 2005 (AI-231): Generate conversion to the null-excluding
421 -- type to force the corresponding run-time check
423 if Is_Access_Type
(Check_Typ
)
424 and then ((Is_Local_Anonymous_Access
(Check_Typ
))
425 or else (Can_Never_Be_Null
(Check_Typ
)
426 and then not Can_Never_Be_Null
(Exp_Typ
)))
428 Rewrite
(Exp
, Convert_To
(Check_Typ
, Relocate_Node
(Exp
)));
429 Analyze_And_Resolve
(Exp
, Check_Typ
);
430 Check_Unset_Reference
(Exp
);
433 -- This is really expansion activity, so make sure that expansion
434 -- is on and is allowed.
436 if not Expander_Active
or else In_Spec_Expression
then
440 -- First check if we have to insert discriminant checks
442 if Has_Discriminants
(Exp_Typ
) then
443 Apply_Discriminant_Check
(Exp
, Check_Typ
);
445 -- Next emit length checks for array aggregates
447 elsif Is_Array_Type
(Exp_Typ
) then
448 Apply_Length_Check
(Exp
, Check_Typ
);
450 -- Finally emit scalar and string checks. If we are dealing with a
451 -- scalar literal we need to check by hand because the Etype of
452 -- literals is not necessarily correct.
454 elsif Is_Scalar_Type
(Exp_Typ
)
455 and then Compile_Time_Known_Value
(Exp
)
457 if Is_Out_Of_Range
(Exp
, Base_Type
(Check_Typ
)) then
458 Apply_Compile_Time_Constraint_Error
459 (Exp
, "value not in range of}?", CE_Range_Check_Failed
,
460 Ent
=> Base_Type
(Check_Typ
),
461 Typ
=> Base_Type
(Check_Typ
));
463 elsif Is_Out_Of_Range
(Exp
, Check_Typ
) then
464 Apply_Compile_Time_Constraint_Error
465 (Exp
, "value not in range of}?", CE_Range_Check_Failed
,
469 elsif not Range_Checks_Suppressed
(Check_Typ
) then
470 Apply_Scalar_Range_Check
(Exp
, Check_Typ
);
473 -- Verify that target type is also scalar, to prevent view anomalies
474 -- in instantiations.
476 elsif (Is_Scalar_Type
(Exp_Typ
)
477 or else Nkind
(Exp
) = N_String_Literal
)
478 and then Is_Scalar_Type
(Check_Typ
)
479 and then Exp_Typ
/= Check_Typ
481 if Is_Entity_Name
(Exp
)
482 and then Ekind
(Entity
(Exp
)) = E_Constant
484 -- If expression is a constant, it is worthwhile checking whether
485 -- it is a bound of the type.
487 if (Is_Entity_Name
(Type_Low_Bound
(Check_Typ
))
488 and then Entity
(Exp
) = Entity
(Type_Low_Bound
(Check_Typ
)))
489 or else (Is_Entity_Name
(Type_High_Bound
(Check_Typ
))
490 and then Entity
(Exp
) = Entity
(Type_High_Bound
(Check_Typ
)))
495 Rewrite
(Exp
, Convert_To
(Check_Typ
, Relocate_Node
(Exp
)));
496 Analyze_And_Resolve
(Exp
, Check_Typ
);
497 Check_Unset_Reference
(Exp
);
500 Rewrite
(Exp
, Convert_To
(Check_Typ
, Relocate_Node
(Exp
)));
501 Analyze_And_Resolve
(Exp
, Check_Typ
);
502 Check_Unset_Reference
(Exp
);
506 end Aggregate_Constraint_Checks
;
508 ------------------------
509 -- Array_Aggr_Subtype --
510 ------------------------
512 function Array_Aggr_Subtype
514 Typ
: Entity_Id
) return Entity_Id
516 Aggr_Dimension
: constant Pos
:= Number_Dimensions
(Typ
);
517 -- Number of aggregate index dimensions
519 Aggr_Range
: array (1 .. Aggr_Dimension
) of Node_Id
:= (others => Empty
);
520 -- Constrained N_Range of each index dimension in our aggregate itype
522 Aggr_Low
: array (1 .. Aggr_Dimension
) of Node_Id
:= (others => Empty
);
523 Aggr_High
: array (1 .. Aggr_Dimension
) of Node_Id
:= (others => Empty
);
524 -- Low and High bounds for each index dimension in our aggregate itype
526 Is_Fully_Positional
: Boolean := True;
528 procedure Collect_Aggr_Bounds
(N
: Node_Id
; Dim
: Pos
);
529 -- N is an array (sub-)aggregate. Dim is the dimension corresponding to
530 -- (sub-)aggregate N. This procedure collects the constrained N_Range
531 -- nodes corresponding to each index dimension of our aggregate itype.
532 -- These N_Range nodes are collected in Aggr_Range above.
534 -- Likewise collect in Aggr_Low & Aggr_High above the low and high
535 -- bounds of each index dimension. If, when collecting, two bounds
536 -- corresponding to the same dimension are static and found to differ,
537 -- then emit a warning, and mark N as raising Constraint_Error.
539 -------------------------
540 -- Collect_Aggr_Bounds --
541 -------------------------
543 procedure Collect_Aggr_Bounds
(N
: Node_Id
; Dim
: Pos
) is
544 This_Range
: constant Node_Id
:= Aggregate_Bounds
(N
);
545 -- The aggregate range node of this specific sub-aggregate
547 This_Low
: constant Node_Id
:= Low_Bound
(Aggregate_Bounds
(N
));
548 This_High
: constant Node_Id
:= High_Bound
(Aggregate_Bounds
(N
));
549 -- The aggregate bounds of this specific sub-aggregate
555 -- Collect the first N_Range for a given dimension that you find.
556 -- For a given dimension they must be all equal anyway.
558 if No
(Aggr_Range
(Dim
)) then
559 Aggr_Low
(Dim
) := This_Low
;
560 Aggr_High
(Dim
) := This_High
;
561 Aggr_Range
(Dim
) := This_Range
;
564 if Compile_Time_Known_Value
(This_Low
) then
565 if not Compile_Time_Known_Value
(Aggr_Low
(Dim
)) then
566 Aggr_Low
(Dim
) := This_Low
;
568 elsif Expr_Value
(This_Low
) /= Expr_Value
(Aggr_Low
(Dim
)) then
569 Set_Raises_Constraint_Error
(N
);
570 Error_Msg_N
("sub-aggregate low bound mismatch?", N
);
572 ("\Constraint_Error will be raised at run-time?", N
);
576 if Compile_Time_Known_Value
(This_High
) then
577 if not Compile_Time_Known_Value
(Aggr_High
(Dim
)) then
578 Aggr_High
(Dim
) := This_High
;
581 Expr_Value
(This_High
) /= Expr_Value
(Aggr_High
(Dim
))
583 Set_Raises_Constraint_Error
(N
);
584 Error_Msg_N
("sub-aggregate high bound mismatch?", N
);
586 ("\Constraint_Error will be raised at run-time?", N
);
591 if Dim
< Aggr_Dimension
then
593 -- Process positional components
595 if Present
(Expressions
(N
)) then
596 Expr
:= First
(Expressions
(N
));
597 while Present
(Expr
) loop
598 Collect_Aggr_Bounds
(Expr
, Dim
+ 1);
603 -- Process component associations
605 if Present
(Component_Associations
(N
)) then
606 Is_Fully_Positional
:= False;
608 Assoc
:= First
(Component_Associations
(N
));
609 while Present
(Assoc
) loop
610 Expr
:= Expression
(Assoc
);
611 Collect_Aggr_Bounds
(Expr
, Dim
+ 1);
616 end Collect_Aggr_Bounds
;
618 -- Array_Aggr_Subtype variables
621 -- The final itype of the overall aggregate
623 Index_Constraints
: constant List_Id
:= New_List
;
624 -- The list of index constraints of the aggregate itype
626 -- Start of processing for Array_Aggr_Subtype
629 -- Make sure that the list of index constraints is properly attached to
630 -- the tree, and then collect the aggregate bounds.
632 Set_Parent
(Index_Constraints
, N
);
633 Collect_Aggr_Bounds
(N
, 1);
635 -- Build the list of constrained indices of our aggregate itype
637 for J
in 1 .. Aggr_Dimension
loop
638 Create_Index
: declare
639 Index_Base
: constant Entity_Id
:=
640 Base_Type
(Etype
(Aggr_Range
(J
)));
641 Index_Typ
: Entity_Id
;
644 -- Construct the Index subtype, and associate it with the range
645 -- construct that generates it.
648 Create_Itype
(Subtype_Kind
(Ekind
(Index_Base
)), Aggr_Range
(J
));
650 Set_Etype
(Index_Typ
, Index_Base
);
652 if Is_Character_Type
(Index_Base
) then
653 Set_Is_Character_Type
(Index_Typ
);
656 Set_Size_Info
(Index_Typ
, (Index_Base
));
657 Set_RM_Size
(Index_Typ
, RM_Size
(Index_Base
));
658 Set_First_Rep_Item
(Index_Typ
, First_Rep_Item
(Index_Base
));
659 Set_Scalar_Range
(Index_Typ
, Aggr_Range
(J
));
661 if Is_Discrete_Or_Fixed_Point_Type
(Index_Typ
) then
662 Set_RM_Size
(Index_Typ
, UI_From_Int
(Minimum_Size
(Index_Typ
)));
665 Set_Etype
(Aggr_Range
(J
), Index_Typ
);
667 Append
(Aggr_Range
(J
), To
=> Index_Constraints
);
671 -- Now build the Itype
673 Itype
:= Create_Itype
(E_Array_Subtype
, N
);
675 Set_First_Rep_Item
(Itype
, First_Rep_Item
(Typ
));
676 Set_Convention
(Itype
, Convention
(Typ
));
677 Set_Depends_On_Private
(Itype
, Has_Private_Component
(Typ
));
678 Set_Etype
(Itype
, Base_Type
(Typ
));
679 Set_Has_Alignment_Clause
(Itype
, Has_Alignment_Clause
(Typ
));
680 Set_Is_Aliased
(Itype
, Is_Aliased
(Typ
));
681 Set_Depends_On_Private
(Itype
, Depends_On_Private
(Typ
));
683 Copy_Suppress_Status
(Index_Check
, Typ
, Itype
);
684 Copy_Suppress_Status
(Length_Check
, Typ
, Itype
);
686 Set_First_Index
(Itype
, First
(Index_Constraints
));
687 Set_Is_Constrained
(Itype
, True);
688 Set_Is_Internal
(Itype
, True);
690 -- A simple optimization: purely positional aggregates of static
691 -- components should be passed to gigi unexpanded whenever possible, and
692 -- regardless of the staticness of the bounds themselves. Subsequent
693 -- checks in exp_aggr verify that type is not packed, etc.
695 Set_Size_Known_At_Compile_Time
(Itype
,
697 and then Comes_From_Source
(N
)
698 and then Size_Known_At_Compile_Time
(Component_Type
(Typ
)));
700 -- We always need a freeze node for a packed array subtype, so that we
701 -- can build the Packed_Array_Type corresponding to the subtype. If
702 -- expansion is disabled, the packed array subtype is not built, and we
703 -- must not generate a freeze node for the type, or else it will appear
704 -- incomplete to gigi.
707 and then not In_Spec_Expression
708 and then Expander_Active
710 Freeze_Itype
(Itype
, N
);
714 end Array_Aggr_Subtype
;
716 --------------------------------
717 -- Check_Misspelled_Component --
718 --------------------------------
720 procedure Check_Misspelled_Component
721 (Elements
: Elist_Id
;
724 Max_Suggestions
: constant := 2;
726 Nr_Of_Suggestions
: Natural := 0;
727 Suggestion_1
: Entity_Id
:= Empty
;
728 Suggestion_2
: Entity_Id
:= Empty
;
729 Component_Elmt
: Elmt_Id
;
732 -- All the components of List are matched against Component and a count
733 -- is maintained of possible misspellings. When at the end of the
734 -- the analysis there are one or two (not more!) possible misspellings,
735 -- these misspellings will be suggested as possible correction.
737 Component_Elmt
:= First_Elmt
(Elements
);
738 while Nr_Of_Suggestions
<= Max_Suggestions
739 and then Present
(Component_Elmt
)
741 if Is_Bad_Spelling_Of
742 (Chars
(Node
(Component_Elmt
)),
745 Nr_Of_Suggestions
:= Nr_Of_Suggestions
+ 1;
747 case Nr_Of_Suggestions
is
748 when 1 => Suggestion_1
:= Node
(Component_Elmt
);
749 when 2 => Suggestion_2
:= Node
(Component_Elmt
);
754 Next_Elmt
(Component_Elmt
);
757 -- Report at most two suggestions
759 if Nr_Of_Suggestions
= 1 then
760 Error_Msg_NE
-- CODEFIX
761 ("\possible misspelling of&", Component
, Suggestion_1
);
763 elsif Nr_Of_Suggestions
= 2 then
764 Error_Msg_Node_2
:= Suggestion_2
;
765 Error_Msg_NE
-- CODEFIX
766 ("\possible misspelling of& or&", Component
, Suggestion_1
);
768 end Check_Misspelled_Component
;
770 ----------------------------------------
771 -- Check_Expr_OK_In_Limited_Aggregate --
772 ----------------------------------------
774 procedure Check_Expr_OK_In_Limited_Aggregate
(Expr
: Node_Id
) is
776 if Is_Limited_Type
(Etype
(Expr
))
777 and then Comes_From_Source
(Expr
)
778 and then not In_Instance_Body
780 if not OK_For_Limited_Init
(Etype
(Expr
), Expr
) then
781 Error_Msg_N
("initialization not allowed for limited types", Expr
);
782 Explain_Limited_Type
(Etype
(Expr
), Expr
);
785 end Check_Expr_OK_In_Limited_Aggregate
;
787 ----------------------------------------
788 -- Check_Static_Discriminated_Subtype --
789 ----------------------------------------
791 procedure Check_Static_Discriminated_Subtype
(T
: Entity_Id
; V
: Node_Id
) is
792 Disc
: constant Entity_Id
:= First_Discriminant
(T
);
797 if Has_Record_Rep_Clause
(T
) then
800 elsif Present
(Next_Discriminant
(Disc
)) then
803 elsif Nkind
(V
) /= N_Integer_Literal
then
807 Comp
:= First_Component
(T
);
808 while Present
(Comp
) loop
809 if Is_Scalar_Type
(Etype
(Comp
)) then
812 elsif Is_Private_Type
(Etype
(Comp
))
813 and then Present
(Full_View
(Etype
(Comp
)))
814 and then Is_Scalar_Type
(Full_View
(Etype
(Comp
)))
818 elsif Is_Array_Type
(Etype
(Comp
)) then
819 if Is_Bit_Packed_Array
(Etype
(Comp
)) then
823 Ind
:= First_Index
(Etype
(Comp
));
824 while Present
(Ind
) loop
825 if Nkind
(Ind
) /= N_Range
826 or else Nkind
(Low_Bound
(Ind
)) /= N_Integer_Literal
827 or else Nkind
(High_Bound
(Ind
)) /= N_Integer_Literal
839 Next_Component
(Comp
);
842 -- On exit, all components have statically known sizes
844 Set_Size_Known_At_Compile_Time
(T
);
845 end Check_Static_Discriminated_Subtype
;
847 --------------------------------
848 -- Make_String_Into_Aggregate --
849 --------------------------------
851 procedure Make_String_Into_Aggregate
(N
: Node_Id
) is
852 Exprs
: constant List_Id
:= New_List
;
853 Loc
: constant Source_Ptr
:= Sloc
(N
);
854 Str
: constant String_Id
:= Strval
(N
);
855 Strlen
: constant Nat
:= String_Length
(Str
);
863 for J
in 1 .. Strlen
loop
864 C
:= Get_String_Char
(Str
, J
);
865 Set_Character_Literal_Name
(C
);
868 Make_Character_Literal
(P
,
870 Char_Literal_Value
=> UI_From_CC
(C
));
871 Set_Etype
(C_Node
, Any_Character
);
872 Append_To
(Exprs
, C_Node
);
875 -- Something special for wide strings???
878 New_N
:= Make_Aggregate
(Loc
, Expressions
=> Exprs
);
879 Set_Analyzed
(New_N
);
880 Set_Etype
(New_N
, Any_Composite
);
883 end Make_String_Into_Aggregate
;
885 -----------------------
886 -- Resolve_Aggregate --
887 -----------------------
889 procedure Resolve_Aggregate
(N
: Node_Id
; Typ
: Entity_Id
) is
890 Pkind
: constant Node_Kind
:= Nkind
(Parent
(N
));
892 Aggr_Subtyp
: Entity_Id
;
893 -- The actual aggregate subtype. This is not necessarily the same as Typ
894 -- which is the subtype of the context in which the aggregate was found.
897 -- Ignore junk empty aggregate resulting from parser error
899 if No
(Expressions
(N
))
900 and then No
(Component_Associations
(N
))
901 and then not Null_Record_Present
(N
)
906 -- Check for aggregates not allowed in configurable run-time mode.
907 -- We allow all cases of aggregates that do not come from source, since
908 -- these are all assumed to be small (e.g. bounds of a string literal).
909 -- We also allow aggregates of types we know to be small.
911 if not Support_Aggregates_On_Target
912 and then Comes_From_Source
(N
)
913 and then (not Known_Static_Esize
(Typ
) or else Esize
(Typ
) > 64)
915 Error_Msg_CRT
("aggregate", N
);
918 -- Ada 2005 (AI-287): Limited aggregates allowed
920 if Is_Limited_Type
(Typ
) and then Ada_Version
< Ada_05
then
921 Error_Msg_N
("aggregate type cannot be limited", N
);
922 Explain_Limited_Type
(Typ
, N
);
924 elsif Is_Class_Wide_Type
(Typ
) then
925 Error_Msg_N
("type of aggregate cannot be class-wide", N
);
927 elsif Typ
= Any_String
928 or else Typ
= Any_Composite
930 Error_Msg_N
("no unique type for aggregate", N
);
931 Set_Etype
(N
, Any_Composite
);
933 elsif Is_Array_Type
(Typ
) and then Null_Record_Present
(N
) then
934 Error_Msg_N
("null record forbidden in array aggregate", N
);
936 elsif Is_Record_Type
(Typ
) then
937 Resolve_Record_Aggregate
(N
, Typ
);
939 elsif Is_Array_Type
(Typ
) then
941 -- First a special test, for the case of a positional aggregate
942 -- of characters which can be replaced by a string literal.
944 -- Do not perform this transformation if this was a string literal to
945 -- start with, whose components needed constraint checks, or if the
946 -- component type is non-static, because it will require those checks
947 -- and be transformed back into an aggregate.
949 if Number_Dimensions
(Typ
) = 1
950 and then Is_Standard_Character_Type
(Component_Type
(Typ
))
951 and then No
(Component_Associations
(N
))
952 and then not Is_Limited_Composite
(Typ
)
953 and then not Is_Private_Composite
(Typ
)
954 and then not Is_Bit_Packed_Array
(Typ
)
955 and then Nkind
(Original_Node
(Parent
(N
))) /= N_String_Literal
956 and then Is_Static_Subtype
(Component_Type
(Typ
))
962 Expr
:= First
(Expressions
(N
));
963 while Present
(Expr
) loop
964 exit when Nkind
(Expr
) /= N_Character_Literal
;
971 Expr
:= First
(Expressions
(N
));
972 while Present
(Expr
) loop
973 Store_String_Char
(UI_To_CC
(Char_Literal_Value
(Expr
)));
978 Make_String_Literal
(Sloc
(N
), End_String
));
980 Analyze_And_Resolve
(N
, Typ
);
986 -- Here if we have a real aggregate to deal with
988 Array_Aggregate
: declare
989 Aggr_Resolved
: Boolean;
991 Aggr_Typ
: constant Entity_Id
:= Etype
(Typ
);
992 -- This is the unconstrained array type, which is the type against
993 -- which the aggregate is to be resolved. Typ itself is the array
994 -- type of the context which may not be the same subtype as the
995 -- subtype for the final aggregate.
998 -- In the following we determine whether an others choice is
999 -- allowed inside the array aggregate. The test checks the context
1000 -- in which the array aggregate occurs. If the context does not
1001 -- permit it, or the aggregate type is unconstrained, an others
1002 -- choice is not allowed.
1004 -- If expansion is disabled (generic context, or semantics-only
1005 -- mode) actual subtypes cannot be constructed, and the type of an
1006 -- object may be its unconstrained nominal type. However, if the
1007 -- context is an assignment, we assume that "others" is allowed,
1008 -- because the target of the assignment will have a constrained
1009 -- subtype when fully compiled.
1011 -- Note that there is no node for Explicit_Actual_Parameter.
1012 -- To test for this context we therefore have to test for node
1013 -- N_Parameter_Association which itself appears only if there is a
1014 -- formal parameter. Consequently we also need to test for
1015 -- N_Procedure_Call_Statement or N_Function_Call.
1017 Set_Etype
(N
, Aggr_Typ
); -- May be overridden later on
1019 if Is_Constrained
(Typ
) and then
1020 (Pkind
= N_Assignment_Statement
or else
1021 Pkind
= N_Parameter_Association
or else
1022 Pkind
= N_Function_Call
or else
1023 Pkind
= N_Procedure_Call_Statement
or else
1024 Pkind
= N_Generic_Association
or else
1025 Pkind
= N_Formal_Object_Declaration
or else
1026 Pkind
= N_Simple_Return_Statement
or else
1027 Pkind
= N_Object_Declaration
or else
1028 Pkind
= N_Component_Declaration
or else
1029 Pkind
= N_Parameter_Specification
or else
1030 Pkind
= N_Qualified_Expression
or else
1031 Pkind
= N_Aggregate
or else
1032 Pkind
= N_Extension_Aggregate
or else
1033 Pkind
= N_Component_Association
)
1036 Resolve_Array_Aggregate
1038 Index
=> First_Index
(Aggr_Typ
),
1039 Index_Constr
=> First_Index
(Typ
),
1040 Component_Typ
=> Component_Type
(Typ
),
1041 Others_Allowed
=> True);
1043 elsif not Expander_Active
1044 and then Pkind
= N_Assignment_Statement
1047 Resolve_Array_Aggregate
1049 Index
=> First_Index
(Aggr_Typ
),
1050 Index_Constr
=> First_Index
(Typ
),
1051 Component_Typ
=> Component_Type
(Typ
),
1052 Others_Allowed
=> True);
1055 Resolve_Array_Aggregate
1057 Index
=> First_Index
(Aggr_Typ
),
1058 Index_Constr
=> First_Index
(Aggr_Typ
),
1059 Component_Typ
=> Component_Type
(Typ
),
1060 Others_Allowed
=> False);
1063 if not Aggr_Resolved
then
1064 Aggr_Subtyp
:= Any_Composite
;
1066 Aggr_Subtyp
:= Array_Aggr_Subtype
(N
, Typ
);
1069 Set_Etype
(N
, Aggr_Subtyp
);
1070 end Array_Aggregate
;
1072 elsif Is_Private_Type
(Typ
)
1073 and then Present
(Full_View
(Typ
))
1074 and then In_Inlined_Body
1075 and then Is_Composite_Type
(Full_View
(Typ
))
1077 Resolve
(N
, Full_View
(Typ
));
1080 Error_Msg_N
("illegal context for aggregate", N
);
1083 -- If we can determine statically that the evaluation of the aggregate
1084 -- raises Constraint_Error, then replace the aggregate with an
1085 -- N_Raise_Constraint_Error node, but set the Etype to the right
1086 -- aggregate subtype. Gigi needs this.
1088 if Raises_Constraint_Error
(N
) then
1089 Aggr_Subtyp
:= Etype
(N
);
1091 Make_Raise_Constraint_Error
(Sloc
(N
),
1092 Reason
=> CE_Range_Check_Failed
));
1093 Set_Raises_Constraint_Error
(N
);
1094 Set_Etype
(N
, Aggr_Subtyp
);
1097 end Resolve_Aggregate
;
1099 -----------------------------
1100 -- Resolve_Array_Aggregate --
1101 -----------------------------
1103 function Resolve_Array_Aggregate
1106 Index_Constr
: Node_Id
;
1107 Component_Typ
: Entity_Id
;
1108 Others_Allowed
: Boolean) return Boolean
1110 Loc
: constant Source_Ptr
:= Sloc
(N
);
1112 Failure
: constant Boolean := False;
1113 Success
: constant Boolean := True;
1115 Index_Typ
: constant Entity_Id
:= Etype
(Index
);
1116 Index_Typ_Low
: constant Node_Id
:= Type_Low_Bound
(Index_Typ
);
1117 Index_Typ_High
: constant Node_Id
:= Type_High_Bound
(Index_Typ
);
1118 -- The type of the index corresponding to the array sub-aggregate along
1119 -- with its low and upper bounds.
1121 Index_Base
: constant Entity_Id
:= Base_Type
(Index_Typ
);
1122 Index_Base_Low
: constant Node_Id
:= Type_Low_Bound
(Index_Base
);
1123 Index_Base_High
: constant Node_Id
:= Type_High_Bound
(Index_Base
);
1124 -- Ditto for the base type
1126 function Add
(Val
: Uint
; To
: Node_Id
) return Node_Id
;
1127 -- Creates a new expression node where Val is added to expression To.
1128 -- Tries to constant fold whenever possible. To must be an already
1129 -- analyzed expression.
1131 procedure Check_Bound
(BH
: Node_Id
; AH
: in out Node_Id
);
1132 -- Checks that AH (the upper bound of an array aggregate) is <= BH
1133 -- (the upper bound of the index base type). If the check fails a
1134 -- warning is emitted, the Raises_Constraint_Error flag of N is set,
1135 -- and AH is replaced with a duplicate of BH.
1137 procedure Check_Bounds
(L
, H
: Node_Id
; AL
, AH
: Node_Id
);
1138 -- Checks that range AL .. AH is compatible with range L .. H. Emits a
1139 -- warning if not and sets the Raises_Constraint_Error flag in N.
1141 procedure Check_Length
(L
, H
: Node_Id
; Len
: Uint
);
1142 -- Checks that range L .. H contains at least Len elements. Emits a
1143 -- warning if not and sets the Raises_Constraint_Error flag in N.
1145 function Dynamic_Or_Null_Range
(L
, H
: Node_Id
) return Boolean;
1146 -- Returns True if range L .. H is dynamic or null
1148 procedure Get
(Value
: out Uint
; From
: Node_Id
; OK
: out Boolean);
1149 -- Given expression node From, this routine sets OK to False if it
1150 -- cannot statically evaluate From. Otherwise it stores this static
1151 -- value into Value.
1153 function Resolve_Aggr_Expr
1155 Single_Elmt
: Boolean) return Boolean;
1156 -- Resolves aggregate expression Expr. Returns False if resolution
1157 -- fails. If Single_Elmt is set to False, the expression Expr may be
1158 -- used to initialize several array aggregate elements (this can happen
1159 -- for discrete choices such as "L .. H => Expr" or the others choice).
1160 -- In this event we do not resolve Expr unless expansion is disabled.
1161 -- To know why, see the DELAYED COMPONENT RESOLUTION note above.
1167 function Add
(Val
: Uint
; To
: Node_Id
) return Node_Id
is
1173 if Raises_Constraint_Error
(To
) then
1177 -- First test if we can do constant folding
1179 if Compile_Time_Known_Value
(To
)
1180 or else Nkind
(To
) = N_Integer_Literal
1182 Expr_Pos
:= Make_Integer_Literal
(Loc
, Expr_Value
(To
) + Val
);
1183 Set_Is_Static_Expression
(Expr_Pos
);
1184 Set_Etype
(Expr_Pos
, Etype
(To
));
1185 Set_Analyzed
(Expr_Pos
, Analyzed
(To
));
1187 if not Is_Enumeration_Type
(Index_Typ
) then
1190 -- If we are dealing with enumeration return
1191 -- Index_Typ'Val (Expr_Pos)
1195 Make_Attribute_Reference
1197 Prefix
=> New_Reference_To
(Index_Typ
, Loc
),
1198 Attribute_Name
=> Name_Val
,
1199 Expressions
=> New_List
(Expr_Pos
));
1205 -- If we are here no constant folding possible
1207 if not Is_Enumeration_Type
(Index_Base
) then
1210 Left_Opnd
=> Duplicate_Subexpr
(To
),
1211 Right_Opnd
=> Make_Integer_Literal
(Loc
, Val
));
1213 -- If we are dealing with enumeration return
1214 -- Index_Typ'Val (Index_Typ'Pos (To) + Val)
1218 Make_Attribute_Reference
1220 Prefix
=> New_Reference_To
(Index_Typ
, Loc
),
1221 Attribute_Name
=> Name_Pos
,
1222 Expressions
=> New_List
(Duplicate_Subexpr
(To
)));
1226 Left_Opnd
=> To_Pos
,
1227 Right_Opnd
=> Make_Integer_Literal
(Loc
, Val
));
1230 Make_Attribute_Reference
1232 Prefix
=> New_Reference_To
(Index_Typ
, Loc
),
1233 Attribute_Name
=> Name_Val
,
1234 Expressions
=> New_List
(Expr_Pos
));
1244 procedure Check_Bound
(BH
: Node_Id
; AH
: in out Node_Id
) is
1252 Get
(Value
=> Val_BH
, From
=> BH
, OK
=> OK_BH
);
1253 Get
(Value
=> Val_AH
, From
=> AH
, OK
=> OK_AH
);
1255 if OK_BH
and then OK_AH
and then Val_BH
< Val_AH
then
1256 Set_Raises_Constraint_Error
(N
);
1257 Error_Msg_N
("upper bound out of range?", AH
);
1258 Error_Msg_N
("\Constraint_Error will be raised at run-time?", AH
);
1260 -- You need to set AH to BH or else in the case of enumerations
1261 -- indices we will not be able to resolve the aggregate bounds.
1263 AH
:= Duplicate_Subexpr
(BH
);
1271 procedure Check_Bounds
(L
, H
: Node_Id
; AL
, AH
: Node_Id
) is
1282 pragma Warnings
(Off
, OK_AL
);
1283 pragma Warnings
(Off
, OK_AH
);
1286 if Raises_Constraint_Error
(N
)
1287 or else Dynamic_Or_Null_Range
(AL
, AH
)
1292 Get
(Value
=> Val_L
, From
=> L
, OK
=> OK_L
);
1293 Get
(Value
=> Val_H
, From
=> H
, OK
=> OK_H
);
1295 Get
(Value
=> Val_AL
, From
=> AL
, OK
=> OK_AL
);
1296 Get
(Value
=> Val_AH
, From
=> AH
, OK
=> OK_AH
);
1298 if OK_L
and then Val_L
> Val_AL
then
1299 Set_Raises_Constraint_Error
(N
);
1300 Error_Msg_N
("lower bound of aggregate out of range?", N
);
1301 Error_Msg_N
("\Constraint_Error will be raised at run-time?", N
);
1304 if OK_H
and then Val_H
< Val_AH
then
1305 Set_Raises_Constraint_Error
(N
);
1306 Error_Msg_N
("upper bound of aggregate out of range?", N
);
1307 Error_Msg_N
("\Constraint_Error will be raised at run-time?", N
);
1315 procedure Check_Length
(L
, H
: Node_Id
; Len
: Uint
) is
1325 if Raises_Constraint_Error
(N
) then
1329 Get
(Value
=> Val_L
, From
=> L
, OK
=> OK_L
);
1330 Get
(Value
=> Val_H
, From
=> H
, OK
=> OK_H
);
1332 if not OK_L
or else not OK_H
then
1336 -- If null range length is zero
1338 if Val_L
> Val_H
then
1339 Range_Len
:= Uint_0
;
1341 Range_Len
:= Val_H
- Val_L
+ 1;
1344 if Range_Len
< Len
then
1345 Set_Raises_Constraint_Error
(N
);
1346 Error_Msg_N
("too many elements?", N
);
1347 Error_Msg_N
("\Constraint_Error will be raised at run-time?", N
);
1351 ---------------------------
1352 -- Dynamic_Or_Null_Range --
1353 ---------------------------
1355 function Dynamic_Or_Null_Range
(L
, H
: Node_Id
) return Boolean is
1363 Get
(Value
=> Val_L
, From
=> L
, OK
=> OK_L
);
1364 Get
(Value
=> Val_H
, From
=> H
, OK
=> OK_H
);
1366 return not OK_L
or else not OK_H
1367 or else not Is_OK_Static_Expression
(L
)
1368 or else not Is_OK_Static_Expression
(H
)
1369 or else Val_L
> Val_H
;
1370 end Dynamic_Or_Null_Range
;
1376 procedure Get
(Value
: out Uint
; From
: Node_Id
; OK
: out Boolean) is
1380 if Compile_Time_Known_Value
(From
) then
1381 Value
:= Expr_Value
(From
);
1383 -- If expression From is something like Some_Type'Val (10) then
1386 elsif Nkind
(From
) = N_Attribute_Reference
1387 and then Attribute_Name
(From
) = Name_Val
1388 and then Compile_Time_Known_Value
(First
(Expressions
(From
)))
1390 Value
:= Expr_Value
(First
(Expressions
(From
)));
1398 -----------------------
1399 -- Resolve_Aggr_Expr --
1400 -----------------------
1402 function Resolve_Aggr_Expr
1404 Single_Elmt
: Boolean) return Boolean
1406 Nxt_Ind
: constant Node_Id
:= Next_Index
(Index
);
1407 Nxt_Ind_Constr
: constant Node_Id
:= Next_Index
(Index_Constr
);
1408 -- Index is the current index corresponding to the expression
1410 Resolution_OK
: Boolean := True;
1411 -- Set to False if resolution of the expression failed
1414 -- If the array type against which we are resolving the aggregate
1415 -- has several dimensions, the expressions nested inside the
1416 -- aggregate must be further aggregates (or strings).
1418 if Present
(Nxt_Ind
) then
1419 if Nkind
(Expr
) /= N_Aggregate
then
1421 -- A string literal can appear where a one-dimensional array
1422 -- of characters is expected. If the literal looks like an
1423 -- operator, it is still an operator symbol, which will be
1424 -- transformed into a string when analyzed.
1426 if Is_Character_Type
(Component_Typ
)
1427 and then No
(Next_Index
(Nxt_Ind
))
1428 and then Nkind_In
(Expr
, N_String_Literal
, N_Operator_Symbol
)
1430 -- A string literal used in a multidimensional array
1431 -- aggregate in place of the final one-dimensional
1432 -- aggregate must not be enclosed in parentheses.
1434 if Paren_Count
(Expr
) /= 0 then
1435 Error_Msg_N
("no parenthesis allowed here", Expr
);
1438 Make_String_Into_Aggregate
(Expr
);
1441 Error_Msg_N
("nested array aggregate expected", Expr
);
1443 -- If the expression is parenthesized, this may be
1444 -- a missing component association for a 1-aggregate.
1446 if Paren_Count
(Expr
) > 0 then
1448 ("\if single-component aggregate is intended,"
1449 & " write e.g. (1 ='> ...)", Expr
);
1455 -- Ada 2005 (AI-231): Propagate the type to the nested aggregate.
1456 -- Required to check the null-exclusion attribute (if present).
1457 -- This value may be overridden later on.
1459 Set_Etype
(Expr
, Etype
(N
));
1461 Resolution_OK
:= Resolve_Array_Aggregate
1462 (Expr
, Nxt_Ind
, Nxt_Ind_Constr
, Component_Typ
, Others_Allowed
);
1464 -- Do not resolve the expressions of discrete or others choices
1465 -- unless the expression covers a single component, or the expander
1469 or else not Expander_Active
1470 or else In_Spec_Expression
1472 Analyze_And_Resolve
(Expr
, Component_Typ
);
1473 Check_Expr_OK_In_Limited_Aggregate
(Expr
);
1474 Check_Non_Static_Context
(Expr
);
1475 Aggregate_Constraint_Checks
(Expr
, Component_Typ
);
1476 Check_Unset_Reference
(Expr
);
1479 if Raises_Constraint_Error
(Expr
)
1480 and then Nkind
(Parent
(Expr
)) /= N_Component_Association
1482 Set_Raises_Constraint_Error
(N
);
1485 -- If the expression has been marked as requiring a range check,
1486 -- then generate it here.
1488 if Do_Range_Check
(Expr
) then
1489 Set_Do_Range_Check
(Expr
, False);
1490 Generate_Range_Check
(Expr
, Component_Typ
, CE_Range_Check_Failed
);
1493 return Resolution_OK
;
1494 end Resolve_Aggr_Expr
;
1496 -- Variables local to Resolve_Array_Aggregate
1503 pragma Warnings
(Off
, Discard
);
1505 Aggr_Low
: Node_Id
:= Empty
;
1506 Aggr_High
: Node_Id
:= Empty
;
1507 -- The actual low and high bounds of this sub-aggregate
1509 Choices_Low
: Node_Id
:= Empty
;
1510 Choices_High
: Node_Id
:= Empty
;
1511 -- The lowest and highest discrete choices values for a named aggregate
1513 Nb_Elements
: Uint
:= Uint_0
;
1514 -- The number of elements in a positional aggregate
1516 Others_Present
: Boolean := False;
1518 Nb_Choices
: Nat
:= 0;
1519 -- Contains the overall number of named choices in this sub-aggregate
1521 Nb_Discrete_Choices
: Nat
:= 0;
1522 -- The overall number of discrete choices (not counting others choice)
1524 Case_Table_Size
: Nat
;
1525 -- Contains the size of the case table needed to sort aggregate choices
1527 -- Start of processing for Resolve_Array_Aggregate
1530 -- Ignore junk empty aggregate resulting from parser error
1532 if No
(Expressions
(N
))
1533 and then No
(Component_Associations
(N
))
1534 and then not Null_Record_Present
(N
)
1539 -- STEP 1: make sure the aggregate is correctly formatted
1541 if Present
(Component_Associations
(N
)) then
1542 Assoc
:= First
(Component_Associations
(N
));
1543 while Present
(Assoc
) loop
1544 Choice
:= First
(Choices
(Assoc
));
1545 while Present
(Choice
) loop
1546 if Nkind
(Choice
) = N_Others_Choice
then
1547 Others_Present
:= True;
1549 if Choice
/= First
(Choices
(Assoc
))
1550 or else Present
(Next
(Choice
))
1553 ("OTHERS must appear alone in a choice list", Choice
);
1557 if Present
(Next
(Assoc
)) then
1559 ("OTHERS must appear last in an aggregate", Choice
);
1563 if Ada_Version
= Ada_83
1564 and then Assoc
/= First
(Component_Associations
(N
))
1565 and then Nkind_In
(Parent
(N
), N_Assignment_Statement
,
1566 N_Object_Declaration
)
1569 ("(Ada 83) illegal context for OTHERS choice", N
);
1573 Nb_Choices
:= Nb_Choices
+ 1;
1581 -- At this point we know that the others choice, if present, is by
1582 -- itself and appears last in the aggregate. Check if we have mixed
1583 -- positional and discrete associations (other than the others choice).
1585 if Present
(Expressions
(N
))
1586 and then (Nb_Choices
> 1
1587 or else (Nb_Choices
= 1 and then not Others_Present
))
1590 ("named association cannot follow positional association",
1591 First
(Choices
(First
(Component_Associations
(N
)))));
1595 -- Test for the validity of an others choice if present
1597 if Others_Present
and then not Others_Allowed
then
1599 ("OTHERS choice not allowed here",
1600 First
(Choices
(First
(Component_Associations
(N
)))));
1604 -- Protect against cascaded errors
1606 if Etype
(Index_Typ
) = Any_Type
then
1610 -- STEP 2: Process named components
1612 if No
(Expressions
(N
)) then
1613 if Others_Present
then
1614 Case_Table_Size
:= Nb_Choices
- 1;
1616 Case_Table_Size
:= Nb_Choices
;
1622 -- Denote the lowest and highest values in an aggregate choice
1626 -- High end of one range and Low end of the next. Should be
1627 -- contiguous if there is no hole in the list of values.
1629 Missing_Values
: Boolean;
1630 -- Set True if missing index values
1632 S_Low
: Node_Id
:= Empty
;
1633 S_High
: Node_Id
:= Empty
;
1634 -- if a choice in an aggregate is a subtype indication these
1635 -- denote the lowest and highest values of the subtype
1637 Table
: Case_Table_Type
(1 .. Case_Table_Size
);
1638 -- Used to sort all the different choice values
1640 Single_Choice
: Boolean;
1641 -- Set to true every time there is a single discrete choice in a
1642 -- discrete association
1644 Prev_Nb_Discrete_Choices
: Nat
;
1645 -- Used to keep track of the number of discrete choices in the
1646 -- current association.
1649 -- STEP 2 (A): Check discrete choices validity
1651 Assoc
:= First
(Component_Associations
(N
));
1652 while Present
(Assoc
) loop
1653 Prev_Nb_Discrete_Choices
:= Nb_Discrete_Choices
;
1654 Choice
:= First
(Choices
(Assoc
));
1658 if Nkind
(Choice
) = N_Others_Choice
then
1659 Single_Choice
:= False;
1662 -- Test for subtype mark without constraint
1664 elsif Is_Entity_Name
(Choice
) and then
1665 Is_Type
(Entity
(Choice
))
1667 if Base_Type
(Entity
(Choice
)) /= Index_Base
then
1669 ("invalid subtype mark in aggregate choice",
1674 -- Case of subtype indication
1676 elsif Nkind
(Choice
) = N_Subtype_Indication
then
1677 Resolve_Discrete_Subtype_Indication
(Choice
, Index_Base
);
1679 -- Does the subtype indication evaluation raise CE ?
1681 Get_Index_Bounds
(Subtype_Mark
(Choice
), S_Low
, S_High
);
1682 Get_Index_Bounds
(Choice
, Low
, High
);
1683 Check_Bounds
(S_Low
, S_High
, Low
, High
);
1685 -- Case of range or expression
1688 Resolve
(Choice
, Index_Base
);
1689 Check_Unset_Reference
(Choice
);
1690 Check_Non_Static_Context
(Choice
);
1692 -- Do not range check a choice. This check is redundant
1693 -- since this test is already done when we check that the
1694 -- bounds of the array aggregate are within range.
1696 Set_Do_Range_Check
(Choice
, False);
1699 -- If we could not resolve the discrete choice stop here
1701 if Etype
(Choice
) = Any_Type
then
1704 -- If the discrete choice raises CE get its original bounds
1706 elsif Nkind
(Choice
) = N_Raise_Constraint_Error
then
1707 Set_Raises_Constraint_Error
(N
);
1708 Get_Index_Bounds
(Original_Node
(Choice
), Low
, High
);
1710 -- Otherwise get its bounds as usual
1713 Get_Index_Bounds
(Choice
, Low
, High
);
1716 if (Dynamic_Or_Null_Range
(Low
, High
)
1717 or else (Nkind
(Choice
) = N_Subtype_Indication
1719 Dynamic_Or_Null_Range
(S_Low
, S_High
)))
1720 and then Nb_Choices
/= 1
1723 ("dynamic or empty choice in aggregate " &
1724 "must be the only choice", Choice
);
1728 Nb_Discrete_Choices
:= Nb_Discrete_Choices
+ 1;
1729 Table
(Nb_Discrete_Choices
).Choice_Lo
:= Low
;
1730 Table
(Nb_Discrete_Choices
).Choice_Hi
:= High
;
1736 -- Check if we have a single discrete choice and whether
1737 -- this discrete choice specifies a single value.
1740 (Nb_Discrete_Choices
= Prev_Nb_Discrete_Choices
+ 1)
1741 and then (Low
= High
);
1747 -- Ada 2005 (AI-231)
1749 if Ada_Version
>= Ada_05
1750 and then Known_Null
(Expression
(Assoc
))
1752 Check_Can_Never_Be_Null
(Etype
(N
), Expression
(Assoc
));
1755 -- Ada 2005 (AI-287): In case of default initialized component
1756 -- we delay the resolution to the expansion phase.
1758 if Box_Present
(Assoc
) then
1760 -- Ada 2005 (AI-287): In case of default initialization of a
1761 -- component the expander will generate calls to the
1762 -- corresponding initialization subprogram.
1766 elsif not Resolve_Aggr_Expr
(Expression
(Assoc
),
1767 Single_Elmt
=> Single_Choice
)
1771 -- Check incorrect use of dynamically tagged expression
1773 -- We differentiate here two cases because the expression may
1774 -- not be decorated. For example, the analysis and resolution
1775 -- of the expression associated with the others choice will be
1776 -- done later with the full aggregate. In such case we
1777 -- duplicate the expression tree to analyze the copy and
1778 -- perform the required check.
1780 elsif not Present
(Etype
(Expression
(Assoc
))) then
1782 Save_Analysis
: constant Boolean := Full_Analysis
;
1783 Expr
: constant Node_Id
:=
1784 New_Copy_Tree
(Expression
(Assoc
));
1787 Expander_Mode_Save_And_Set
(False);
1788 Full_Analysis
:= False;
1790 Full_Analysis
:= Save_Analysis
;
1791 Expander_Mode_Restore
;
1793 if Is_Tagged_Type
(Etype
(Expr
)) then
1794 Check_Dynamically_Tagged_Expression
1796 Typ
=> Component_Type
(Etype
(N
)),
1801 elsif Is_Tagged_Type
(Etype
(Expression
(Assoc
))) then
1802 Check_Dynamically_Tagged_Expression
1803 (Expr
=> Expression
(Assoc
),
1804 Typ
=> Component_Type
(Etype
(N
)),
1811 -- If aggregate contains more than one choice then these must be
1812 -- static. Sort them and check that they are contiguous.
1814 if Nb_Discrete_Choices
> 1 then
1815 Sort_Case_Table
(Table
);
1816 Missing_Values
:= False;
1818 Outer
: for J
in 1 .. Nb_Discrete_Choices
- 1 loop
1819 if Expr_Value
(Table
(J
).Choice_Hi
) >=
1820 Expr_Value
(Table
(J
+ 1).Choice_Lo
)
1823 ("duplicate choice values in array aggregate",
1824 Table
(J
).Choice_Hi
);
1827 elsif not Others_Present
then
1828 Hi_Val
:= Expr_Value
(Table
(J
).Choice_Hi
);
1829 Lo_Val
:= Expr_Value
(Table
(J
+ 1).Choice_Lo
);
1831 -- If missing values, output error messages
1833 if Lo_Val
- Hi_Val
> 1 then
1835 -- Header message if not first missing value
1837 if not Missing_Values
then
1839 ("missing index value(s) in array aggregate", N
);
1840 Missing_Values
:= True;
1843 -- Output values of missing indexes
1845 Lo_Val
:= Lo_Val
- 1;
1846 Hi_Val
:= Hi_Val
+ 1;
1848 -- Enumeration type case
1850 if Is_Enumeration_Type
(Index_Typ
) then
1853 (Get_Enum_Lit_From_Pos
1854 (Index_Typ
, Hi_Val
, Loc
));
1856 if Lo_Val
= Hi_Val
then
1857 Error_Msg_N
("\ %", N
);
1861 (Get_Enum_Lit_From_Pos
1862 (Index_Typ
, Lo_Val
, Loc
));
1863 Error_Msg_N
("\ % .. %", N
);
1866 -- Integer types case
1869 Error_Msg_Uint_1
:= Hi_Val
;
1871 if Lo_Val
= Hi_Val
then
1872 Error_Msg_N
("\ ^", N
);
1874 Error_Msg_Uint_2
:= Lo_Val
;
1875 Error_Msg_N
("\ ^ .. ^", N
);
1882 if Missing_Values
then
1883 Set_Etype
(N
, Any_Composite
);
1888 -- STEP 2 (B): Compute aggregate bounds and min/max choices values
1890 if Nb_Discrete_Choices
> 0 then
1891 Choices_Low
:= Table
(1).Choice_Lo
;
1892 Choices_High
:= Table
(Nb_Discrete_Choices
).Choice_Hi
;
1895 -- If Others is present, then bounds of aggregate come from the
1896 -- index constraint (not the choices in the aggregate itself).
1898 if Others_Present
then
1899 Get_Index_Bounds
(Index_Constr
, Aggr_Low
, Aggr_High
);
1901 -- No others clause present
1904 -- Special processing if others allowed and not present. This
1905 -- means that the bounds of the aggregate come from the index
1906 -- constraint (and the length must match).
1908 if Others_Allowed
then
1909 Get_Index_Bounds
(Index_Constr
, Aggr_Low
, Aggr_High
);
1911 -- If others allowed, and no others present, then the array
1912 -- should cover all index values. If it does not, we will
1913 -- get a length check warning, but there is two cases where
1914 -- an additional warning is useful:
1916 -- If we have no positional components, and the length is
1917 -- wrong (which we can tell by others being allowed with
1918 -- missing components), and the index type is an enumeration
1919 -- type, then issue appropriate warnings about these missing
1920 -- components. They are only warnings, since the aggregate
1921 -- is fine, it's just the wrong length. We skip this check
1922 -- for standard character types (since there are no literals
1923 -- and it is too much trouble to concoct them), and also if
1924 -- any of the bounds have not-known-at-compile-time values.
1926 -- Another case warranting a warning is when the length is
1927 -- right, but as above we have an index type that is an
1928 -- enumeration, and the bounds do not match. This is a
1929 -- case where dubious sliding is allowed and we generate
1930 -- a warning that the bounds do not match.
1932 if No
(Expressions
(N
))
1933 and then Nkind
(Index
) = N_Range
1934 and then Is_Enumeration_Type
(Etype
(Index
))
1935 and then not Is_Standard_Character_Type
(Etype
(Index
))
1936 and then Compile_Time_Known_Value
(Aggr_Low
)
1937 and then Compile_Time_Known_Value
(Aggr_High
)
1938 and then Compile_Time_Known_Value
(Choices_Low
)
1939 and then Compile_Time_Known_Value
(Choices_High
)
1941 -- If the bounds have semantic errors, do not attempt
1942 -- further resolution to prevent cascaded errors.
1944 if Error_Posted
(Choices_Low
)
1945 or else Error_Posted
(Choices_High
)
1951 ALo
: constant Node_Id
:= Expr_Value_E
(Aggr_Low
);
1952 AHi
: constant Node_Id
:= Expr_Value_E
(Aggr_High
);
1953 CLo
: constant Node_Id
:= Expr_Value_E
(Choices_Low
);
1954 CHi
: constant Node_Id
:= Expr_Value_E
(Choices_High
);
1959 -- Warning case 1, missing values at start/end. Only
1960 -- do the check if the number of entries is too small.
1962 if (Enumeration_Pos
(CHi
) - Enumeration_Pos
(CLo
))
1964 (Enumeration_Pos
(AHi
) - Enumeration_Pos
(ALo
))
1967 ("missing index value(s) in array aggregate?", N
);
1969 -- Output missing value(s) at start
1971 if Chars
(ALo
) /= Chars
(CLo
) then
1974 if Chars
(ALo
) = Chars
(Ent
) then
1975 Error_Msg_Name_1
:= Chars
(ALo
);
1976 Error_Msg_N
("\ %?", N
);
1978 Error_Msg_Name_1
:= Chars
(ALo
);
1979 Error_Msg_Name_2
:= Chars
(Ent
);
1980 Error_Msg_N
("\ % .. %?", N
);
1984 -- Output missing value(s) at end
1986 if Chars
(AHi
) /= Chars
(CHi
) then
1989 if Chars
(AHi
) = Chars
(Ent
) then
1990 Error_Msg_Name_1
:= Chars
(Ent
);
1991 Error_Msg_N
("\ %?", N
);
1993 Error_Msg_Name_1
:= Chars
(Ent
);
1994 Error_Msg_Name_2
:= Chars
(AHi
);
1995 Error_Msg_N
("\ % .. %?", N
);
1999 -- Warning case 2, dubious sliding. The First_Subtype
2000 -- test distinguishes between a constrained type where
2001 -- sliding is not allowed (so we will get a warning
2002 -- later that Constraint_Error will be raised), and
2003 -- the unconstrained case where sliding is permitted.
2005 elsif (Enumeration_Pos
(CHi
) - Enumeration_Pos
(CLo
))
2007 (Enumeration_Pos
(AHi
) - Enumeration_Pos
(ALo
))
2008 and then Chars
(ALo
) /= Chars
(CLo
)
2010 not Is_Constrained
(First_Subtype
(Etype
(N
)))
2013 ("bounds of aggregate do not match target?", N
);
2019 -- If no others, aggregate bounds come from aggregate
2021 Aggr_Low
:= Choices_Low
;
2022 Aggr_High
:= Choices_High
;
2026 -- STEP 3: Process positional components
2029 -- STEP 3 (A): Process positional elements
2031 Expr
:= First
(Expressions
(N
));
2032 Nb_Elements
:= Uint_0
;
2033 while Present
(Expr
) loop
2034 Nb_Elements
:= Nb_Elements
+ 1;
2036 -- Ada 2005 (AI-231)
2038 if Ada_Version
>= Ada_05
2039 and then Known_Null
(Expr
)
2041 Check_Can_Never_Be_Null
(Etype
(N
), Expr
);
2044 if not Resolve_Aggr_Expr
(Expr
, Single_Elmt
=> True) then
2048 -- Check incorrect use of dynamically tagged expression
2050 if Is_Tagged_Type
(Etype
(Expr
)) then
2051 Check_Dynamically_Tagged_Expression
2053 Typ
=> Component_Type
(Etype
(N
)),
2060 if Others_Present
then
2061 Assoc
:= Last
(Component_Associations
(N
));
2063 -- Ada 2005 (AI-231)
2065 if Ada_Version
>= Ada_05
2066 and then Known_Null
(Assoc
)
2068 Check_Can_Never_Be_Null
(Etype
(N
), Expression
(Assoc
));
2071 -- Ada 2005 (AI-287): In case of default initialized component,
2072 -- we delay the resolution to the expansion phase.
2074 if Box_Present
(Assoc
) then
2076 -- Ada 2005 (AI-287): In case of default initialization of a
2077 -- component the expander will generate calls to the
2078 -- corresponding initialization subprogram.
2082 elsif not Resolve_Aggr_Expr
(Expression
(Assoc
),
2083 Single_Elmt
=> False)
2087 -- Check incorrect use of dynamically tagged expression. The
2088 -- expression of the others choice has not been resolved yet.
2089 -- In order to diagnose the semantic error we create a duplicate
2090 -- tree to analyze it and perform the check.
2094 Save_Analysis
: constant Boolean := Full_Analysis
;
2095 Expr
: constant Node_Id
:=
2096 New_Copy_Tree
(Expression
(Assoc
));
2099 Expander_Mode_Save_And_Set
(False);
2100 Full_Analysis
:= False;
2102 Full_Analysis
:= Save_Analysis
;
2103 Expander_Mode_Restore
;
2105 if Is_Tagged_Type
(Etype
(Expr
)) then
2106 Check_Dynamically_Tagged_Expression
2108 Typ
=> Component_Type
(Etype
(N
)),
2115 -- STEP 3 (B): Compute the aggregate bounds
2117 if Others_Present
then
2118 Get_Index_Bounds
(Index_Constr
, Aggr_Low
, Aggr_High
);
2121 if Others_Allowed
then
2122 Get_Index_Bounds
(Index_Constr
, Aggr_Low
, Discard
);
2124 Aggr_Low
:= Index_Typ_Low
;
2127 Aggr_High
:= Add
(Nb_Elements
- 1, To
=> Aggr_Low
);
2128 Check_Bound
(Index_Base_High
, Aggr_High
);
2132 -- STEP 4: Perform static aggregate checks and save the bounds
2136 Check_Bounds
(Index_Typ_Low
, Index_Typ_High
, Aggr_Low
, Aggr_High
);
2137 Check_Bounds
(Index_Base_Low
, Index_Base_High
, Aggr_Low
, Aggr_High
);
2141 if Others_Present
and then Nb_Discrete_Choices
> 0 then
2142 Check_Bounds
(Aggr_Low
, Aggr_High
, Choices_Low
, Choices_High
);
2143 Check_Bounds
(Index_Typ_Low
, Index_Typ_High
,
2144 Choices_Low
, Choices_High
);
2145 Check_Bounds
(Index_Base_Low
, Index_Base_High
,
2146 Choices_Low
, Choices_High
);
2150 elsif Others_Present
and then Nb_Elements
> 0 then
2151 Check_Length
(Aggr_Low
, Aggr_High
, Nb_Elements
);
2152 Check_Length
(Index_Typ_Low
, Index_Typ_High
, Nb_Elements
);
2153 Check_Length
(Index_Base_Low
, Index_Base_High
, Nb_Elements
);
2156 if Raises_Constraint_Error
(Aggr_Low
)
2157 or else Raises_Constraint_Error
(Aggr_High
)
2159 Set_Raises_Constraint_Error
(N
);
2162 Aggr_Low
:= Duplicate_Subexpr
(Aggr_Low
);
2164 -- Do not duplicate Aggr_High if Aggr_High = Aggr_Low + Nb_Elements
2165 -- since the addition node returned by Add is not yet analyzed. Attach
2166 -- to tree and analyze first. Reset analyzed flag to ensure it will get
2167 -- analyzed when it is a literal bound whose type must be properly set.
2169 if Others_Present
or else Nb_Discrete_Choices
> 0 then
2170 Aggr_High
:= Duplicate_Subexpr
(Aggr_High
);
2172 if Etype
(Aggr_High
) = Universal_Integer
then
2173 Set_Analyzed
(Aggr_High
, False);
2177 -- If the aggregate already has bounds attached to it, it means this is
2178 -- a positional aggregate created as an optimization by
2179 -- Exp_Aggr.Convert_To_Positional, so we don't want to change those
2182 if Present
(Aggregate_Bounds
(N
)) and then not Others_Allowed
then
2183 Aggr_Low
:= Low_Bound
(Aggregate_Bounds
(N
));
2184 Aggr_High
:= High_Bound
(Aggregate_Bounds
(N
));
2187 Set_Aggregate_Bounds
2188 (N
, Make_Range
(Loc
, Low_Bound
=> Aggr_Low
, High_Bound
=> Aggr_High
));
2190 -- The bounds may contain expressions that must be inserted upwards.
2191 -- Attach them fully to the tree. After analysis, remove side effects
2192 -- from upper bound, if still needed.
2194 Set_Parent
(Aggregate_Bounds
(N
), N
);
2195 Analyze_And_Resolve
(Aggregate_Bounds
(N
), Index_Typ
);
2196 Check_Unset_Reference
(Aggregate_Bounds
(N
));
2198 if not Others_Present
and then Nb_Discrete_Choices
= 0 then
2199 Set_High_Bound
(Aggregate_Bounds
(N
),
2200 Duplicate_Subexpr
(High_Bound
(Aggregate_Bounds
(N
))));
2204 end Resolve_Array_Aggregate
;
2206 ---------------------------------
2207 -- Resolve_Extension_Aggregate --
2208 ---------------------------------
2210 -- There are two cases to consider:
2212 -- a) If the ancestor part is a type mark, the components needed are the
2213 -- difference between the components of the expected type and the
2214 -- components of the given type mark.
2216 -- b) If the ancestor part is an expression, it must be unambiguous, and
2217 -- once we have its type we can also compute the needed components as in
2218 -- the previous case. In both cases, if the ancestor type is not the
2219 -- immediate ancestor, we have to build this ancestor recursively.
2221 -- In both cases discriminants of the ancestor type do not play a role in
2222 -- the resolution of the needed components, because inherited discriminants
2223 -- cannot be used in a type extension. As a result we can compute
2224 -- independently the list of components of the ancestor type and of the
2227 procedure Resolve_Extension_Aggregate
(N
: Node_Id
; Typ
: Entity_Id
) is
2228 A
: constant Node_Id
:= Ancestor_Part
(N
);
2233 function Valid_Limited_Ancestor
(Anc
: Node_Id
) return Boolean;
2234 -- If the type is limited, verify that the ancestor part is a legal
2235 -- expression (aggregate or function call, including 'Input)) that does
2236 -- not require a copy, as specified in 7.5(2).
2238 function Valid_Ancestor_Type
return Boolean;
2239 -- Verify that the type of the ancestor part is a non-private ancestor
2240 -- of the expected type, which must be a type extension.
2242 ----------------------------
2243 -- Valid_Limited_Ancestor --
2244 ----------------------------
2246 function Valid_Limited_Ancestor
(Anc
: Node_Id
) return Boolean is
2248 if Is_Entity_Name
(Anc
)
2249 and then Is_Type
(Entity
(Anc
))
2253 elsif Nkind_In
(Anc
, N_Aggregate
, N_Function_Call
) then
2256 elsif Nkind
(Anc
) = N_Attribute_Reference
2257 and then Attribute_Name
(Anc
) = Name_Input
2261 elsif Nkind
(Anc
) = N_Qualified_Expression
then
2262 return Valid_Limited_Ancestor
(Expression
(Anc
));
2267 end Valid_Limited_Ancestor
;
2269 -------------------------
2270 -- Valid_Ancestor_Type --
2271 -------------------------
2273 function Valid_Ancestor_Type
return Boolean is
2274 Imm_Type
: Entity_Id
;
2277 Imm_Type
:= Base_Type
(Typ
);
2278 while Is_Derived_Type
(Imm_Type
) loop
2279 if Etype
(Imm_Type
) = Base_Type
(A_Type
) then
2282 -- The base type of the parent type may appear as a private
2283 -- extension if it is declared as such in a parent unit of the
2284 -- current one. For consistency of the subsequent analysis use
2285 -- the partial view for the ancestor part.
2287 elsif Is_Private_Type
(Etype
(Imm_Type
))
2288 and then Present
(Full_View
(Etype
(Imm_Type
)))
2289 and then Base_Type
(A_Type
) = Full_View
(Etype
(Imm_Type
))
2291 A_Type
:= Etype
(Imm_Type
);
2294 -- The parent type may be a private extension. The aggregate is
2295 -- legal if the type of the aggregate is an extension of it that
2296 -- is not a private extension.
2298 elsif Is_Private_Type
(A_Type
)
2299 and then not Is_Private_Type
(Imm_Type
)
2300 and then Present
(Full_View
(A_Type
))
2301 and then Base_Type
(Full_View
(A_Type
)) = Etype
(Imm_Type
)
2306 Imm_Type
:= Etype
(Base_Type
(Imm_Type
));
2310 -- If previous loop did not find a proper ancestor, report error
2312 Error_Msg_NE
("expect ancestor type of &", A
, Typ
);
2314 end Valid_Ancestor_Type
;
2316 -- Start of processing for Resolve_Extension_Aggregate
2319 -- Analyze the ancestor part and account for the case where it is a
2320 -- parameterless function call.
2323 Check_Parameterless_Call
(A
);
2325 if not Is_Tagged_Type
(Typ
) then
2326 Error_Msg_N
("type of extension aggregate must be tagged", N
);
2329 elsif Is_Limited_Type
(Typ
) then
2331 -- Ada 2005 (AI-287): Limited aggregates are allowed
2333 if Ada_Version
< Ada_05
then
2334 Error_Msg_N
("aggregate type cannot be limited", N
);
2335 Explain_Limited_Type
(Typ
, N
);
2338 elsif Valid_Limited_Ancestor
(A
) then
2343 ("limited ancestor part must be aggregate or function call", A
);
2346 elsif Is_Class_Wide_Type
(Typ
) then
2347 Error_Msg_N
("aggregate cannot be of a class-wide type", N
);
2351 if Is_Entity_Name
(A
)
2352 and then Is_Type
(Entity
(A
))
2354 A_Type
:= Get_Full_View
(Entity
(A
));
2356 if Valid_Ancestor_Type
then
2357 Set_Entity
(A
, A_Type
);
2358 Set_Etype
(A
, A_Type
);
2360 Validate_Ancestor_Part
(N
);
2361 Resolve_Record_Aggregate
(N
, Typ
);
2364 elsif Nkind
(A
) /= N_Aggregate
then
2365 if Is_Overloaded
(A
) then
2368 Get_First_Interp
(A
, I
, It
);
2369 while Present
(It
.Typ
) loop
2370 -- Only consider limited interpretations in the Ada 2005 case
2372 if Is_Tagged_Type
(It
.Typ
)
2373 and then (Ada_Version
>= Ada_05
2374 or else not Is_Limited_Type
(It
.Typ
))
2376 if A_Type
/= Any_Type
then
2377 Error_Msg_N
("cannot resolve expression", A
);
2384 Get_Next_Interp
(I
, It
);
2387 if A_Type
= Any_Type
then
2388 if Ada_Version
>= Ada_05
then
2389 Error_Msg_N
("ancestor part must be of a tagged type", A
);
2392 ("ancestor part must be of a nonlimited tagged type", A
);
2399 A_Type
:= Etype
(A
);
2402 if Valid_Ancestor_Type
then
2403 Resolve
(A
, A_Type
);
2404 Check_Unset_Reference
(A
);
2405 Check_Non_Static_Context
(A
);
2407 -- The aggregate is illegal if the ancestor expression is a call
2408 -- to a function with a limited unconstrained result, unless the
2409 -- type of the aggregate is a null extension. This restriction
2410 -- was added in AI05-67 to simplify implementation.
2412 if Nkind
(A
) = N_Function_Call
2413 and then Is_Limited_Type
(A_Type
)
2414 and then not Is_Null_Extension
(Typ
)
2415 and then not Is_Constrained
(A_Type
)
2418 ("type of limited ancestor part must be constrained", A
);
2420 elsif Is_Class_Wide_Type
(Etype
(A
))
2421 and then Nkind
(Original_Node
(A
)) = N_Function_Call
2423 -- If the ancestor part is a dispatching call, it appears
2424 -- statically to be a legal ancestor, but it yields any member
2425 -- of the class, and it is not possible to determine whether
2426 -- it is an ancestor of the extension aggregate (much less
2427 -- which ancestor). It is not possible to determine the
2428 -- components of the extension part.
2430 -- This check implements AI-306, which in fact was motivated by
2431 -- an AdaCore query to the ARG after this test was added.
2433 Error_Msg_N
("ancestor part must be statically tagged", A
);
2435 Resolve_Record_Aggregate
(N
, Typ
);
2440 Error_Msg_N
("no unique type for this aggregate", A
);
2442 end Resolve_Extension_Aggregate
;
2444 ------------------------------
2445 -- Resolve_Record_Aggregate --
2446 ------------------------------
2448 procedure Resolve_Record_Aggregate
(N
: Node_Id
; Typ
: Entity_Id
) is
2450 -- N_Component_Association node belonging to the input aggregate N
2453 Positional_Expr
: Node_Id
;
2454 Component
: Entity_Id
;
2455 Component_Elmt
: Elmt_Id
;
2457 Components
: constant Elist_Id
:= New_Elmt_List
;
2458 -- Components is the list of the record components whose value must be
2459 -- provided in the aggregate. This list does include discriminants.
2461 New_Assoc_List
: constant List_Id
:= New_List
;
2462 New_Assoc
: Node_Id
;
2463 -- New_Assoc_List is the newly built list of N_Component_Association
2464 -- nodes. New_Assoc is one such N_Component_Association node in it.
2465 -- Note that while Assoc and New_Assoc contain the same kind of nodes,
2466 -- they are used to iterate over two different N_Component_Association
2469 Others_Etype
: Entity_Id
:= Empty
;
2470 -- This variable is used to save the Etype of the last record component
2471 -- that takes its value from the others choice. Its purpose is:
2473 -- (a) make sure the others choice is useful
2475 -- (b) make sure the type of all the components whose value is
2476 -- subsumed by the others choice are the same.
2478 -- This variable is updated as a side effect of function Get_Value.
2480 Is_Box_Present
: Boolean := False;
2481 Others_Box
: Boolean := False;
2482 -- Ada 2005 (AI-287): Variables used in case of default initialization
2483 -- to provide a functionality similar to Others_Etype. Box_Present
2484 -- indicates that the component takes its default initialization;
2485 -- Others_Box indicates that at least one component takes its default
2486 -- initialization. Similar to Others_Etype, they are also updated as a
2487 -- side effect of function Get_Value.
2489 procedure Add_Association
2490 (Component
: Entity_Id
;
2492 Assoc_List
: List_Id
;
2493 Is_Box_Present
: Boolean := False);
2494 -- Builds a new N_Component_Association node which associates Component
2495 -- to expression Expr and adds it to the association list being built,
2496 -- either New_Assoc_List, or the association being built for an inner
2499 function Discr_Present
(Discr
: Entity_Id
) return Boolean;
2500 -- If aggregate N is a regular aggregate this routine will return True.
2501 -- Otherwise, if N is an extension aggregate, Discr is a discriminant
2502 -- whose value may already have been specified by N's ancestor part.
2503 -- This routine checks whether this is indeed the case and if so returns
2504 -- False, signaling that no value for Discr should appear in N's
2505 -- aggregate part. Also, in this case, the routine appends to
2506 -- New_Assoc_List the discriminant value specified in the ancestor part.
2508 -- If the aggregate is in a context with expansion delayed, it will be
2509 -- reanalyzed. The inherited discriminant values must not be reinserted
2510 -- in the component list to prevent spurious errors, but they must be
2511 -- present on first analysis to build the proper subtype indications.
2512 -- The flag Inherited_Discriminant is used to prevent the re-insertion.
2517 Consider_Others_Choice
: Boolean := False)
2519 -- Given a record component stored in parameter Compon, this function
2520 -- returns its value as it appears in the list From, which is a list
2521 -- of N_Component_Association nodes.
2523 -- If no component association has a choice for the searched component,
2524 -- the value provided by the others choice is returned, if there is one,
2525 -- and Consider_Others_Choice is set to true. Otherwise Empty is
2526 -- returned. If there is more than one component association giving a
2527 -- value for the searched record component, an error message is emitted
2528 -- and the first found value is returned.
2530 -- If Consider_Others_Choice is set and the returned expression comes
2531 -- from the others choice, then Others_Etype is set as a side effect.
2532 -- An error message is emitted if the components taking their value from
2533 -- the others choice do not have same type.
2535 procedure Resolve_Aggr_Expr
(Expr
: Node_Id
; Component
: Node_Id
);
2536 -- Analyzes and resolves expression Expr against the Etype of the
2537 -- Component. This routine also applies all appropriate checks to Expr.
2538 -- It finally saves a Expr in the newly created association list that
2539 -- will be attached to the final record aggregate. Note that if the
2540 -- Parent pointer of Expr is not set then Expr was produced with a
2541 -- New_Copy_Tree or some such.
2543 ---------------------
2544 -- Add_Association --
2545 ---------------------
2547 procedure Add_Association
2548 (Component
: Entity_Id
;
2550 Assoc_List
: List_Id
;
2551 Is_Box_Present
: Boolean := False)
2553 Choice_List
: constant List_Id
:= New_List
;
2554 New_Assoc
: Node_Id
;
2557 Append
(New_Occurrence_Of
(Component
, Sloc
(Expr
)), Choice_List
);
2559 Make_Component_Association
(Sloc
(Expr
),
2560 Choices
=> Choice_List
,
2562 Box_Present
=> Is_Box_Present
);
2563 Append
(New_Assoc
, Assoc_List
);
2564 end Add_Association
;
2570 function Discr_Present
(Discr
: Entity_Id
) return Boolean is
2571 Regular_Aggr
: constant Boolean := Nkind
(N
) /= N_Extension_Aggregate
;
2576 Comp_Assoc
: Node_Id
;
2577 Discr_Expr
: Node_Id
;
2579 Ancestor_Typ
: Entity_Id
;
2580 Orig_Discr
: Entity_Id
;
2582 D_Val
: Elmt_Id
:= No_Elmt
; -- stop junk warning
2584 Ancestor_Is_Subtyp
: Boolean;
2587 if Regular_Aggr
then
2591 -- Check whether inherited discriminant values have already been
2592 -- inserted in the aggregate. This will be the case if we are
2593 -- re-analyzing an aggregate whose expansion was delayed.
2595 if Present
(Component_Associations
(N
)) then
2596 Comp_Assoc
:= First
(Component_Associations
(N
));
2597 while Present
(Comp_Assoc
) loop
2598 if Inherited_Discriminant
(Comp_Assoc
) then
2606 Ancestor
:= Ancestor_Part
(N
);
2607 Ancestor_Typ
:= Etype
(Ancestor
);
2608 Loc
:= Sloc
(Ancestor
);
2610 -- For a private type with unknown discriminants, use the underlying
2611 -- record view if it is available.
2613 if Has_Unknown_Discriminants
(Ancestor_Typ
)
2614 and then Present
(Full_View
(Ancestor_Typ
))
2615 and then Present
(Underlying_Record_View
(Full_View
(Ancestor_Typ
)))
2617 Ancestor_Typ
:= Underlying_Record_View
(Full_View
(Ancestor_Typ
));
2620 Ancestor_Is_Subtyp
:=
2621 Is_Entity_Name
(Ancestor
) and then Is_Type
(Entity
(Ancestor
));
2623 -- If the ancestor part has no discriminants clearly N's aggregate
2624 -- part must provide a value for Discr.
2626 if not Has_Discriminants
(Ancestor_Typ
) then
2629 -- If the ancestor part is an unconstrained subtype mark then the
2630 -- Discr must be present in N's aggregate part.
2632 elsif Ancestor_Is_Subtyp
2633 and then not Is_Constrained
(Entity
(Ancestor
))
2638 -- Now look to see if Discr was specified in the ancestor part
2640 if Ancestor_Is_Subtyp
then
2641 D_Val
:= First_Elmt
(Discriminant_Constraint
(Entity
(Ancestor
)));
2644 Orig_Discr
:= Original_Record_Component
(Discr
);
2646 D
:= First_Discriminant
(Ancestor_Typ
);
2647 while Present
(D
) loop
2649 -- If Ancestor has already specified Disc value then insert its
2650 -- value in the final aggregate.
2652 if Original_Record_Component
(D
) = Orig_Discr
then
2653 if Ancestor_Is_Subtyp
then
2654 Discr_Expr
:= New_Copy_Tree
(Node
(D_Val
));
2657 Make_Selected_Component
(Loc
,
2658 Prefix
=> Duplicate_Subexpr
(Ancestor
),
2659 Selector_Name
=> New_Occurrence_Of
(Discr
, Loc
));
2662 Resolve_Aggr_Expr
(Discr_Expr
, Discr
);
2663 Set_Inherited_Discriminant
(Last
(New_Assoc_List
));
2667 Next_Discriminant
(D
);
2669 if Ancestor_Is_Subtyp
then
2684 Consider_Others_Choice
: Boolean := False)
2688 Expr
: Node_Id
:= Empty
;
2689 Selector_Name
: Node_Id
;
2692 Is_Box_Present
:= False;
2694 if Present
(From
) then
2695 Assoc
:= First
(From
);
2700 while Present
(Assoc
) loop
2701 Selector_Name
:= First
(Choices
(Assoc
));
2702 while Present
(Selector_Name
) loop
2703 if Nkind
(Selector_Name
) = N_Others_Choice
then
2704 if Consider_Others_Choice
and then No
(Expr
) then
2706 -- We need to duplicate the expression for each
2707 -- successive component covered by the others choice.
2708 -- This is redundant if the others_choice covers only
2709 -- one component (small optimization possible???), but
2710 -- indispensable otherwise, because each one must be
2711 -- expanded individually to preserve side-effects.
2713 -- Ada 2005 (AI-287): In case of default initialization
2714 -- of components, we duplicate the corresponding default
2715 -- expression (from the record type declaration). The
2716 -- copy must carry the sloc of the association (not the
2717 -- original expression) to prevent spurious elaboration
2718 -- checks when the default includes function calls.
2720 if Box_Present
(Assoc
) then
2722 Is_Box_Present
:= True;
2724 if Expander_Active
then
2727 (Expression
(Parent
(Compon
)),
2728 New_Sloc
=> Sloc
(Assoc
));
2730 return Expression
(Parent
(Compon
));
2734 if Present
(Others_Etype
) and then
2735 Base_Type
(Others_Etype
) /= Base_Type
(Etype
2738 Error_Msg_N
("components in OTHERS choice must " &
2739 "have same type", Selector_Name
);
2742 Others_Etype
:= Etype
(Compon
);
2744 if Expander_Active
then
2745 return New_Copy_Tree
(Expression
(Assoc
));
2747 return Expression
(Assoc
);
2752 elsif Chars
(Compon
) = Chars
(Selector_Name
) then
2755 -- Ada 2005 (AI-231)
2757 if Ada_Version
>= Ada_05
2758 and then Known_Null
(Expression
(Assoc
))
2760 Check_Can_Never_Be_Null
(Compon
, Expression
(Assoc
));
2763 -- We need to duplicate the expression when several
2764 -- components are grouped together with a "|" choice.
2765 -- For instance "filed1 | filed2 => Expr"
2767 -- Ada 2005 (AI-287)
2769 if Box_Present
(Assoc
) then
2770 Is_Box_Present
:= True;
2772 -- Duplicate the default expression of the component
2773 -- from the record type declaration, so a new copy
2774 -- can be attached to the association.
2776 -- Note that we always copy the default expression,
2777 -- even when the association has a single choice, in
2778 -- order to create a proper association for the
2779 -- expanded aggregate.
2781 Expr
:= New_Copy_Tree
(Expression
(Parent
(Compon
)));
2784 if Present
(Next
(Selector_Name
)) then
2785 Expr
:= New_Copy_Tree
(Expression
(Assoc
));
2787 Expr
:= Expression
(Assoc
);
2791 Generate_Reference
(Compon
, Selector_Name
, 'm');
2795 ("more than one value supplied for &",
2796 Selector_Name
, Compon
);
2801 Next
(Selector_Name
);
2810 -----------------------
2811 -- Resolve_Aggr_Expr --
2812 -----------------------
2814 procedure Resolve_Aggr_Expr
(Expr
: Node_Id
; Component
: Node_Id
) is
2815 New_C
: Entity_Id
:= Component
;
2816 Expr_Type
: Entity_Id
:= Empty
;
2818 function Has_Expansion_Delayed
(Expr
: Node_Id
) return Boolean;
2819 -- If the expression is an aggregate (possibly qualified) then its
2820 -- expansion is delayed until the enclosing aggregate is expanded
2821 -- into assignments. In that case, do not generate checks on the
2822 -- expression, because they will be generated later, and will other-
2823 -- wise force a copy (to remove side-effects) that would leave a
2824 -- dynamic-sized aggregate in the code, something that gigi cannot
2828 -- Set to True if the resolved Expr node needs to be relocated
2829 -- when attached to the newly created association list. This node
2830 -- need not be relocated if its parent pointer is not set.
2831 -- In fact in this case Expr is the output of a New_Copy_Tree call.
2832 -- if Relocate is True then we have analyzed the expression node
2833 -- in the original aggregate and hence it needs to be relocated
2834 -- when moved over the new association list.
2836 function Has_Expansion_Delayed
(Expr
: Node_Id
) return Boolean is
2837 Kind
: constant Node_Kind
:= Nkind
(Expr
);
2839 return (Nkind_In
(Kind
, N_Aggregate
, N_Extension_Aggregate
)
2840 and then Present
(Etype
(Expr
))
2841 and then Is_Record_Type
(Etype
(Expr
))
2842 and then Expansion_Delayed
(Expr
))
2843 or else (Kind
= N_Qualified_Expression
2844 and then Has_Expansion_Delayed
(Expression
(Expr
)));
2845 end Has_Expansion_Delayed
;
2847 -- Start of processing for Resolve_Aggr_Expr
2850 -- If the type of the component is elementary or the type of the
2851 -- aggregate does not contain discriminants, use the type of the
2852 -- component to resolve Expr.
2854 if Is_Elementary_Type
(Etype
(Component
))
2855 or else not Has_Discriminants
(Etype
(N
))
2857 Expr_Type
:= Etype
(Component
);
2859 -- Otherwise we have to pick up the new type of the component from
2860 -- the new constrained subtype of the aggregate. In fact components
2861 -- which are of a composite type might be constrained by a
2862 -- discriminant, and we want to resolve Expr against the subtype were
2863 -- all discriminant occurrences are replaced with their actual value.
2866 New_C
:= First_Component
(Etype
(N
));
2867 while Present
(New_C
) loop
2868 if Chars
(New_C
) = Chars
(Component
) then
2869 Expr_Type
:= Etype
(New_C
);
2873 Next_Component
(New_C
);
2876 pragma Assert
(Present
(Expr_Type
));
2878 -- For each range in an array type where a discriminant has been
2879 -- replaced with the constraint, check that this range is within
2880 -- the range of the base type. This checks is done in the init
2881 -- proc for regular objects, but has to be done here for
2882 -- aggregates since no init proc is called for them.
2884 if Is_Array_Type
(Expr_Type
) then
2887 -- Range of the current constrained index in the array
2889 Orig_Index
: Node_Id
:= First_Index
(Etype
(Component
));
2890 -- Range corresponding to the range Index above in the
2891 -- original unconstrained record type. The bounds of this
2892 -- range may be governed by discriminants.
2894 Unconstr_Index
: Node_Id
:= First_Index
(Etype
(Expr_Type
));
2895 -- Range corresponding to the range Index above for the
2896 -- unconstrained array type. This range is needed to apply
2900 Index
:= First_Index
(Expr_Type
);
2901 while Present
(Index
) loop
2902 if Depends_On_Discriminant
(Orig_Index
) then
2903 Apply_Range_Check
(Index
, Etype
(Unconstr_Index
));
2907 Next_Index
(Orig_Index
);
2908 Next_Index
(Unconstr_Index
);
2914 -- If the Parent pointer of Expr is not set, Expr is an expression
2915 -- duplicated by New_Tree_Copy (this happens for record aggregates
2916 -- that look like (Field1 | Filed2 => Expr) or (others => Expr)).
2917 -- Such a duplicated expression must be attached to the tree
2918 -- before analysis and resolution to enforce the rule that a tree
2919 -- fragment should never be analyzed or resolved unless it is
2920 -- attached to the current compilation unit.
2922 if No
(Parent
(Expr
)) then
2923 Set_Parent
(Expr
, N
);
2929 Analyze_And_Resolve
(Expr
, Expr_Type
);
2930 Check_Expr_OK_In_Limited_Aggregate
(Expr
);
2931 Check_Non_Static_Context
(Expr
);
2932 Check_Unset_Reference
(Expr
);
2934 -- Check wrong use of class-wide types
2936 if Is_Class_Wide_Type
(Etype
(Expr
)) then
2937 Error_Msg_N
("dynamically tagged expression not allowed", Expr
);
2940 if not Has_Expansion_Delayed
(Expr
) then
2941 Aggregate_Constraint_Checks
(Expr
, Expr_Type
);
2944 if Raises_Constraint_Error
(Expr
) then
2945 Set_Raises_Constraint_Error
(N
);
2948 -- If the expression has been marked as requiring a range check,
2949 -- then generate it here.
2951 if Do_Range_Check
(Expr
) then
2952 Set_Do_Range_Check
(Expr
, False);
2953 Generate_Range_Check
(Expr
, Expr_Type
, CE_Range_Check_Failed
);
2957 Add_Association
(New_C
, Relocate_Node
(Expr
), New_Assoc_List
);
2959 Add_Association
(New_C
, Expr
, New_Assoc_List
);
2961 end Resolve_Aggr_Expr
;
2963 -- Start of processing for Resolve_Record_Aggregate
2966 -- We may end up calling Duplicate_Subexpr on expressions that are
2967 -- attached to New_Assoc_List. For this reason we need to attach it
2968 -- to the tree by setting its parent pointer to N. This parent point
2969 -- will change in STEP 8 below.
2971 Set_Parent
(New_Assoc_List
, N
);
2973 -- STEP 1: abstract type and null record verification
2975 if Is_Abstract_Type
(Typ
) then
2976 Error_Msg_N
("type of aggregate cannot be abstract", N
);
2979 if No
(First_Entity
(Typ
)) and then Null_Record_Present
(N
) then
2983 elsif Present
(First_Entity
(Typ
))
2984 and then Null_Record_Present
(N
)
2985 and then not Is_Tagged_Type
(Typ
)
2987 Error_Msg_N
("record aggregate cannot be null", N
);
2990 -- If the type has no components, then the aggregate should either
2991 -- have "null record", or in Ada 2005 it could instead have a single
2992 -- component association given by "others => <>". For Ada 95 we flag
2993 -- an error at this point, but for Ada 2005 we proceed with checking
2994 -- the associations below, which will catch the case where it's not
2995 -- an aggregate with "others => <>". Note that the legality of a <>
2996 -- aggregate for a null record type was established by AI05-016.
2998 elsif No
(First_Entity
(Typ
))
2999 and then Ada_Version
< Ada_05
3001 Error_Msg_N
("record aggregate must be null", N
);
3005 -- STEP 2: Verify aggregate structure
3008 Selector_Name
: Node_Id
;
3009 Bad_Aggregate
: Boolean := False;
3012 if Present
(Component_Associations
(N
)) then
3013 Assoc
:= First
(Component_Associations
(N
));
3018 while Present
(Assoc
) loop
3019 Selector_Name
:= First
(Choices
(Assoc
));
3020 while Present
(Selector_Name
) loop
3021 if Nkind
(Selector_Name
) = N_Identifier
then
3024 elsif Nkind
(Selector_Name
) = N_Others_Choice
then
3025 if Selector_Name
/= First
(Choices
(Assoc
))
3026 or else Present
(Next
(Selector_Name
))
3029 ("OTHERS must appear alone in a choice list",
3033 elsif Present
(Next
(Assoc
)) then
3035 ("OTHERS must appear last in an aggregate",
3039 -- (Ada2005): If this is an association with a box,
3040 -- indicate that the association need not represent
3043 elsif Box_Present
(Assoc
) then
3049 ("selector name should be identifier or OTHERS",
3051 Bad_Aggregate
:= True;
3054 Next
(Selector_Name
);
3060 if Bad_Aggregate
then
3065 -- STEP 3: Find discriminant Values
3068 Discrim
: Entity_Id
;
3069 Missing_Discriminants
: Boolean := False;
3072 if Present
(Expressions
(N
)) then
3073 Positional_Expr
:= First
(Expressions
(N
));
3075 Positional_Expr
:= Empty
;
3078 if Has_Unknown_Discriminants
(Typ
)
3079 and then Present
(Underlying_Record_View
(Typ
))
3081 Discrim
:= First_Discriminant
(Underlying_Record_View
(Typ
));
3082 elsif Has_Discriminants
(Typ
) then
3083 Discrim
:= First_Discriminant
(Typ
);
3088 -- First find the discriminant values in the positional components
3090 while Present
(Discrim
) and then Present
(Positional_Expr
) loop
3091 if Discr_Present
(Discrim
) then
3092 Resolve_Aggr_Expr
(Positional_Expr
, Discrim
);
3094 -- Ada 2005 (AI-231)
3096 if Ada_Version
>= Ada_05
3097 and then Known_Null
(Positional_Expr
)
3099 Check_Can_Never_Be_Null
(Discrim
, Positional_Expr
);
3102 Next
(Positional_Expr
);
3105 if Present
(Get_Value
(Discrim
, Component_Associations
(N
))) then
3107 ("more than one value supplied for discriminant&",
3111 Next_Discriminant
(Discrim
);
3114 -- Find remaining discriminant values, if any, among named components
3116 while Present
(Discrim
) loop
3117 Expr
:= Get_Value
(Discrim
, Component_Associations
(N
), True);
3119 if not Discr_Present
(Discrim
) then
3120 if Present
(Expr
) then
3122 ("more than one value supplied for discriminant&",
3126 elsif No
(Expr
) then
3128 ("no value supplied for discriminant &", N
, Discrim
);
3129 Missing_Discriminants
:= True;
3132 Resolve_Aggr_Expr
(Expr
, Discrim
);
3135 Next_Discriminant
(Discrim
);
3138 if Missing_Discriminants
then
3142 -- At this point and until the beginning of STEP 6, New_Assoc_List
3143 -- contains only the discriminants and their values.
3147 -- STEP 4: Set the Etype of the record aggregate
3149 -- ??? This code is pretty much a copy of Sem_Ch3.Build_Subtype. That
3150 -- routine should really be exported in sem_util or some such and used
3151 -- in sem_ch3 and here rather than have a copy of the code which is a
3152 -- maintenance nightmare.
3154 -- ??? Performance WARNING. The current implementation creates a new
3155 -- itype for all aggregates whose base type is discriminated.
3156 -- This means that for record aggregates nested inside an array
3157 -- aggregate we will create a new itype for each record aggregate
3158 -- if the array component type has discriminants. For large aggregates
3159 -- this may be a problem. What should be done in this case is
3160 -- to reuse itypes as much as possible.
3162 if Has_Discriminants
(Typ
)
3163 or else (Has_Unknown_Discriminants
(Typ
)
3164 and then Present
(Underlying_Record_View
(Typ
)))
3166 Build_Constrained_Itype
: declare
3167 Loc
: constant Source_Ptr
:= Sloc
(N
);
3169 Subtyp_Decl
: Node_Id
;
3172 C
: constant List_Id
:= New_List
;
3175 New_Assoc
:= First
(New_Assoc_List
);
3176 while Present
(New_Assoc
) loop
3177 Append
(Duplicate_Subexpr
(Expression
(New_Assoc
)), To
=> C
);
3181 if Has_Unknown_Discriminants
(Typ
)
3182 and then Present
(Underlying_Record_View
(Typ
))
3185 Make_Subtype_Indication
(Loc
,
3187 New_Occurrence_Of
(Underlying_Record_View
(Typ
), Loc
),
3189 Make_Index_Or_Discriminant_Constraint
(Loc
, C
));
3192 Make_Subtype_Indication
(Loc
,
3194 New_Occurrence_Of
(Base_Type
(Typ
), Loc
),
3196 Make_Index_Or_Discriminant_Constraint
(Loc
, C
));
3199 Def_Id
:= Create_Itype
(Ekind
(Typ
), N
);
3202 Make_Subtype_Declaration
(Loc
,
3203 Defining_Identifier
=> Def_Id
,
3204 Subtype_Indication
=> Indic
);
3205 Set_Parent
(Subtyp_Decl
, Parent
(N
));
3207 -- Itypes must be analyzed with checks off (see itypes.ads)
3209 Analyze
(Subtyp_Decl
, Suppress
=> All_Checks
);
3211 Set_Etype
(N
, Def_Id
);
3212 Check_Static_Discriminated_Subtype
3213 (Def_Id
, Expression
(First
(New_Assoc_List
)));
3214 end Build_Constrained_Itype
;
3220 -- STEP 5: Get remaining components according to discriminant values
3223 Record_Def
: Node_Id
;
3224 Parent_Typ
: Entity_Id
;
3225 Root_Typ
: Entity_Id
;
3226 Parent_Typ_List
: Elist_Id
;
3227 Parent_Elmt
: Elmt_Id
;
3228 Errors_Found
: Boolean := False;
3232 if Is_Derived_Type
(Typ
) and then Is_Tagged_Type
(Typ
) then
3233 Parent_Typ_List
:= New_Elmt_List
;
3235 -- If this is an extension aggregate, the component list must
3236 -- include all components that are not in the given ancestor type.
3237 -- Otherwise, the component list must include components of all
3238 -- ancestors, starting with the root.
3240 if Nkind
(N
) = N_Extension_Aggregate
then
3241 Root_Typ
:= Base_Type
(Etype
(Ancestor_Part
(N
)));
3244 Root_Typ
:= Root_Type
(Typ
);
3246 if Nkind
(Parent
(Base_Type
(Root_Typ
))) =
3247 N_Private_Type_Declaration
3250 ("type of aggregate has private ancestor&!",
3252 Error_Msg_N
("must use extension aggregate!", N
);
3256 Dnode
:= Declaration_Node
(Base_Type
(Root_Typ
));
3258 -- If we don't get a full declaration, then we have some error
3259 -- which will get signalled later so skip this part. Otherwise
3260 -- gather components of root that apply to the aggregate type.
3261 -- We use the base type in case there is an applicable stored
3262 -- constraint that renames the discriminants of the root.
3264 if Nkind
(Dnode
) = N_Full_Type_Declaration
then
3265 Record_Def
:= Type_Definition
(Dnode
);
3266 Gather_Components
(Base_Type
(Typ
),
3267 Component_List
(Record_Def
),
3268 Governed_By
=> New_Assoc_List
,
3270 Report_Errors
=> Errors_Found
);
3274 Parent_Typ
:= Base_Type
(Typ
);
3275 while Parent_Typ
/= Root_Typ
loop
3276 Prepend_Elmt
(Parent_Typ
, To
=> Parent_Typ_List
);
3277 Parent_Typ
:= Etype
(Parent_Typ
);
3279 if Nkind
(Parent
(Base_Type
(Parent_Typ
))) =
3280 N_Private_Type_Declaration
3281 or else Nkind
(Parent
(Base_Type
(Parent_Typ
))) =
3282 N_Private_Extension_Declaration
3284 if Nkind
(N
) /= N_Extension_Aggregate
then
3286 ("type of aggregate has private ancestor&!",
3288 Error_Msg_N
("must use extension aggregate!", N
);
3291 elsif Parent_Typ
/= Root_Typ
then
3293 ("ancestor part of aggregate must be private type&",
3294 Ancestor_Part
(N
), Parent_Typ
);
3298 -- The current view of ancestor part may be a private type,
3299 -- while the context type is always non-private.
3301 elsif Is_Private_Type
(Root_Typ
)
3302 and then Present
(Full_View
(Root_Typ
))
3303 and then Nkind
(N
) = N_Extension_Aggregate
3305 exit when Base_Type
(Full_View
(Root_Typ
)) = Parent_Typ
;
3309 -- Now collect components from all other ancestors, beginning
3310 -- with the current type. If the type has unknown discriminants
3311 -- use the component list of the Underlying_Record_View, which
3312 -- needs to be used for the subsequent expansion of the aggregate
3313 -- into assignments.
3315 Parent_Elmt
:= First_Elmt
(Parent_Typ_List
);
3316 while Present
(Parent_Elmt
) loop
3317 Parent_Typ
:= Node
(Parent_Elmt
);
3319 if Has_Unknown_Discriminants
(Parent_Typ
)
3320 and then Present
(Underlying_Record_View
(Typ
))
3322 Parent_Typ
:= Underlying_Record_View
(Parent_Typ
);
3325 Record_Def
:= Type_Definition
(Parent
(Base_Type
(Parent_Typ
)));
3326 Gather_Components
(Empty
,
3327 Component_List
(Record_Extension_Part
(Record_Def
)),
3328 Governed_By
=> New_Assoc_List
,
3330 Report_Errors
=> Errors_Found
);
3332 Next_Elmt
(Parent_Elmt
);
3336 Record_Def
:= Type_Definition
(Parent
(Base_Type
(Typ
)));
3338 if Null_Present
(Record_Def
) then
3341 elsif not Has_Unknown_Discriminants
(Typ
) then
3342 Gather_Components
(Base_Type
(Typ
),
3343 Component_List
(Record_Def
),
3344 Governed_By
=> New_Assoc_List
,
3346 Report_Errors
=> Errors_Found
);
3350 (Base_Type
(Underlying_Record_View
(Typ
)),
3351 Component_List
(Record_Def
),
3352 Governed_By
=> New_Assoc_List
,
3354 Report_Errors
=> Errors_Found
);
3358 if Errors_Found
then
3363 -- STEP 6: Find component Values
3366 Component_Elmt
:= First_Elmt
(Components
);
3368 -- First scan the remaining positional associations in the aggregate.
3369 -- Remember that at this point Positional_Expr contains the current
3370 -- positional association if any is left after looking for discriminant
3371 -- values in step 3.
3373 while Present
(Positional_Expr
) and then Present
(Component_Elmt
) loop
3374 Component
:= Node
(Component_Elmt
);
3375 Resolve_Aggr_Expr
(Positional_Expr
, Component
);
3377 -- Ada 2005 (AI-231)
3379 if Ada_Version
>= Ada_05
3380 and then Known_Null
(Positional_Expr
)
3382 Check_Can_Never_Be_Null
(Component
, Positional_Expr
);
3385 if Present
(Get_Value
(Component
, Component_Associations
(N
))) then
3387 ("more than one value supplied for Component &", N
, Component
);
3390 Next
(Positional_Expr
);
3391 Next_Elmt
(Component_Elmt
);
3394 if Present
(Positional_Expr
) then
3396 ("too many components for record aggregate", Positional_Expr
);
3399 -- Now scan for the named arguments of the aggregate
3401 while Present
(Component_Elmt
) loop
3402 Component
:= Node
(Component_Elmt
);
3403 Expr
:= Get_Value
(Component
, Component_Associations
(N
), True);
3405 -- Note: The previous call to Get_Value sets the value of the
3406 -- variable Is_Box_Present.
3408 -- Ada 2005 (AI-287): Handle components with default initialization.
3409 -- Note: This feature was originally added to Ada 2005 for limited
3410 -- but it was finally allowed with any type.
3412 if Is_Box_Present
then
3413 Check_Box_Component
: declare
3414 Ctyp
: constant Entity_Id
:= Etype
(Component
);
3417 -- If there is a default expression for the aggregate, copy
3418 -- it into a new association.
3420 -- If the component has an initialization procedure (IP) we
3421 -- pass the component to the expander, which will generate
3422 -- the call to such IP.
3424 -- If the component has discriminants, their values must
3425 -- be taken from their subtype. This is indispensable for
3426 -- constraints that are given by the current instance of an
3427 -- enclosing type, to allow the expansion of the aggregate
3428 -- to replace the reference to the current instance by the
3429 -- target object of the aggregate.
3431 if Present
(Parent
(Component
))
3433 Nkind
(Parent
(Component
)) = N_Component_Declaration
3434 and then Present
(Expression
(Parent
(Component
)))
3437 New_Copy_Tree
(Expression
(Parent
(Component
)),
3438 New_Sloc
=> Sloc
(N
));
3441 (Component
=> Component
,
3443 Assoc_List
=> New_Assoc_List
);
3444 Set_Has_Self_Reference
(N
);
3446 -- A box-defaulted access component gets the value null. Also
3447 -- included are components of private types whose underlying
3448 -- type is an access type. In either case set the type of the
3449 -- literal, for subsequent use in semantic checks.
3451 elsif Present
(Underlying_Type
(Ctyp
))
3452 and then Is_Access_Type
(Underlying_Type
(Ctyp
))
3454 if not Is_Private_Type
(Ctyp
) then
3455 Expr
:= Make_Null
(Sloc
(N
));
3456 Set_Etype
(Expr
, Ctyp
);
3458 (Component
=> Component
,
3460 Assoc_List
=> New_Assoc_List
);
3462 -- If the component's type is private with an access type as
3463 -- its underlying type then we have to create an unchecked
3464 -- conversion to satisfy type checking.
3468 Qual_Null
: constant Node_Id
:=
3469 Make_Qualified_Expression
(Sloc
(N
),
3472 (Underlying_Type
(Ctyp
), Sloc
(N
)),
3473 Expression
=> Make_Null
(Sloc
(N
)));
3475 Convert_Null
: constant Node_Id
:=
3476 Unchecked_Convert_To
3480 Analyze_And_Resolve
(Convert_Null
, Ctyp
);
3482 (Component
=> Component
,
3483 Expr
=> Convert_Null
,
3484 Assoc_List
=> New_Assoc_List
);
3488 elsif Has_Non_Null_Base_Init_Proc
(Ctyp
)
3489 or else not Expander_Active
3491 if Is_Record_Type
(Ctyp
)
3492 and then Has_Discriminants
(Ctyp
)
3493 and then not Is_Private_Type
(Ctyp
)
3495 -- We build a partially initialized aggregate with the
3496 -- values of the discriminants and box initialization
3497 -- for the rest, if other components are present.
3498 -- The type of the aggregate is the known subtype of
3499 -- the component. The capture of discriminants must
3500 -- be recursive because subcomponents may be contrained
3501 -- (transitively) by discriminants of enclosing types.
3502 -- For a private type with discriminants, a call to the
3503 -- initialization procedure will be generated, and no
3504 -- subaggregate is needed.
3506 Capture_Discriminants
: declare
3507 Loc
: constant Source_Ptr
:= Sloc
(N
);
3510 procedure Add_Discriminant_Values
3511 (New_Aggr
: Node_Id
;
3512 Assoc_List
: List_Id
);
3513 -- The constraint to a component may be given by a
3514 -- discriminant of the enclosing type, in which case
3515 -- we have to retrieve its value, which is part of the
3516 -- enclosing aggregate. Assoc_List provides the
3517 -- discriminant associations of the current type or
3518 -- of some enclosing record.
3520 procedure Propagate_Discriminants
3522 Assoc_List
: List_Id
;
3524 -- Nested components may themselves be discriminated
3525 -- types constrained by outer discriminants, whose
3526 -- values must be captured before the aggregate is
3527 -- expanded into assignments.
3529 -----------------------------
3530 -- Add_Discriminant_Values --
3531 -----------------------------
3533 procedure Add_Discriminant_Values
3534 (New_Aggr
: Node_Id
;
3535 Assoc_List
: List_Id
)
3539 Discr_Elmt
: Elmt_Id
;
3540 Discr_Val
: Node_Id
;
3544 Discr
:= First_Discriminant
(Etype
(New_Aggr
));
3547 (Discriminant_Constraint
(Etype
(New_Aggr
)));
3548 while Present
(Discr_Elmt
) loop
3549 Discr_Val
:= Node
(Discr_Elmt
);
3551 -- If the constraint is given by a discriminant
3552 -- it is a discriminant of an enclosing record,
3553 -- and its value has already been placed in the
3554 -- association list.
3556 if Is_Entity_Name
(Discr_Val
)
3558 Ekind
(Entity
(Discr_Val
)) = E_Discriminant
3560 Val
:= Entity
(Discr_Val
);
3562 Assoc
:= First
(Assoc_List
);
3563 while Present
(Assoc
) loop
3565 (Entity
(First
(Choices
(Assoc
))))
3567 Entity
(First
(Choices
(Assoc
)))
3570 Discr_Val
:= Expression
(Assoc
);
3578 (Discr
, New_Copy_Tree
(Discr_Val
),
3579 Component_Associations
(New_Aggr
));
3581 -- If the discriminant constraint is a current
3582 -- instance, mark the current aggregate so that
3583 -- the self-reference can be expanded later.
3585 if Nkind
(Discr_Val
) = N_Attribute_Reference
3586 and then Is_Entity_Name
(Prefix
(Discr_Val
))
3587 and then Is_Type
(Entity
(Prefix
(Discr_Val
)))
3588 and then Etype
(N
) =
3589 Entity
(Prefix
(Discr_Val
))
3591 Set_Has_Self_Reference
(N
);
3594 Next_Elmt
(Discr_Elmt
);
3595 Next_Discriminant
(Discr
);
3597 end Add_Discriminant_Values
;
3599 ------------------------------
3600 -- Propagate_Discriminants --
3601 ------------------------------
3603 procedure Propagate_Discriminants
3605 Assoc_List
: List_Id
;
3608 Inner_Comp
: Entity_Id
;
3609 Comp_Type
: Entity_Id
;
3610 Needs_Box
: Boolean := False;
3614 Inner_Comp
:= First_Component
(Etype
(Comp
));
3615 while Present
(Inner_Comp
) loop
3616 Comp_Type
:= Etype
(Inner_Comp
);
3618 if Is_Record_Type
(Comp_Type
)
3619 and then Has_Discriminants
(Comp_Type
)
3622 Make_Aggregate
(Loc
, New_List
, New_List
);
3623 Set_Etype
(New_Aggr
, Comp_Type
);
3625 (Inner_Comp
, New_Aggr
,
3626 Component_Associations
(Aggr
));
3628 -- Collect discriminant values and recurse
3630 Add_Discriminant_Values
3631 (New_Aggr
, Assoc_List
);
3632 Propagate_Discriminants
3633 (New_Aggr
, Assoc_List
, Inner_Comp
);
3639 Next_Component
(Inner_Comp
);
3644 (Make_Component_Association
(Loc
,
3646 New_List
(Make_Others_Choice
(Loc
)),
3647 Expression
=> Empty
,
3648 Box_Present
=> True),
3649 Component_Associations
(Aggr
));
3651 end Propagate_Discriminants
;
3654 Expr
:= Make_Aggregate
(Loc
, New_List
, New_List
);
3655 Set_Etype
(Expr
, Ctyp
);
3657 -- If the enclosing type has discriminants, they
3658 -- have been collected in the aggregate earlier, and
3659 -- they may appear as constraints of subcomponents.
3660 -- Similarly if this component has discriminants, they
3661 -- might in turn be propagated to their components.
3663 if Has_Discriminants
(Typ
) then
3664 Add_Discriminant_Values
(Expr
, New_Assoc_List
);
3665 Propagate_Discriminants
3666 (Expr
, New_Assoc_List
, Component
);
3668 elsif Has_Discriminants
(Ctyp
) then
3669 Add_Discriminant_Values
3670 (Expr
, Component_Associations
(Expr
));
3671 Propagate_Discriminants
3672 (Expr
, Component_Associations
(Expr
), Component
);
3679 -- If the type has additional components, create
3680 -- an OTHERS box association for them.
3682 Comp
:= First_Component
(Ctyp
);
3683 while Present
(Comp
) loop
3684 if Ekind
(Comp
) = E_Component
then
3685 if not Is_Record_Type
(Etype
(Comp
)) then
3687 (Make_Component_Association
(Loc
,
3690 (Make_Others_Choice
(Loc
)),
3691 Expression
=> Empty
,
3692 Box_Present
=> True),
3693 Component_Associations
(Expr
));
3698 Next_Component
(Comp
);
3704 (Component
=> Component
,
3706 Assoc_List
=> New_Assoc_List
);
3707 end Capture_Discriminants
;
3711 (Component
=> Component
,
3713 Assoc_List
=> New_Assoc_List
,
3714 Is_Box_Present
=> True);
3717 -- Otherwise we only need to resolve the expression if the
3718 -- component has partially initialized values (required to
3719 -- expand the corresponding assignments and run-time checks).
3721 elsif Present
(Expr
)
3722 and then Is_Partially_Initialized_Type
(Ctyp
)
3724 Resolve_Aggr_Expr
(Expr
, Component
);
3726 end Check_Box_Component
;
3728 elsif No
(Expr
) then
3730 -- Ignore hidden components associated with the position of the
3731 -- interface tags: these are initialized dynamically.
3733 if not Present
(Related_Type
(Component
)) then
3735 ("no value supplied for component &!", N
, Component
);
3739 Resolve_Aggr_Expr
(Expr
, Component
);
3742 Next_Elmt
(Component_Elmt
);
3745 -- STEP 7: check for invalid components + check type in choice list
3752 -- Type of first component in choice list
3755 if Present
(Component_Associations
(N
)) then
3756 Assoc
:= First
(Component_Associations
(N
));
3761 Verification
: while Present
(Assoc
) loop
3762 Selectr
:= First
(Choices
(Assoc
));
3765 if Nkind
(Selectr
) = N_Others_Choice
then
3767 -- Ada 2005 (AI-287): others choice may have expression or box
3769 if No
(Others_Etype
)
3770 and then not Others_Box
3773 ("OTHERS must represent at least one component", Selectr
);
3779 while Present
(Selectr
) loop
3780 New_Assoc
:= First
(New_Assoc_List
);
3781 while Present
(New_Assoc
) loop
3782 Component
:= First
(Choices
(New_Assoc
));
3784 if Chars
(Selectr
) = Chars
(Component
) then
3786 Check_Identifier
(Selectr
, Entity
(Component
));
3795 -- If no association, this is not a legal component of
3796 -- of the type in question, except if its association
3797 -- is provided with a box.
3799 if No
(New_Assoc
) then
3800 if Box_Present
(Parent
(Selectr
)) then
3802 -- This may still be a bogus component with a box. Scan
3803 -- list of components to verify that a component with
3804 -- that name exists.
3810 C
:= First_Component
(Typ
);
3811 while Present
(C
) loop
3812 if Chars
(C
) = Chars
(Selectr
) then
3814 -- If the context is an extension aggregate,
3815 -- the component must not be inherited from
3816 -- the ancestor part of the aggregate.
3818 if Nkind
(N
) /= N_Extension_Aggregate
3820 Scope
(Original_Record_Component
(C
)) /=
3821 Etype
(Ancestor_Part
(N
))
3831 Error_Msg_Node_2
:= Typ
;
3832 Error_Msg_N
("& is not a component of}", Selectr
);
3836 elsif Chars
(Selectr
) /= Name_uTag
3837 and then Chars
(Selectr
) /= Name_uParent
3838 and then Chars
(Selectr
) /= Name_uController
3840 if not Has_Discriminants
(Typ
) then
3841 Error_Msg_Node_2
:= Typ
;
3842 Error_Msg_N
("& is not a component of}", Selectr
);
3845 ("& is not a component of the aggregate subtype",
3849 Check_Misspelled_Component
(Components
, Selectr
);
3852 elsif No
(Typech
) then
3853 Typech
:= Base_Type
(Etype
(Component
));
3855 elsif Typech
/= Base_Type
(Etype
(Component
)) then
3856 if not Box_Present
(Parent
(Selectr
)) then
3858 ("components in choice list must have same type",
3867 end loop Verification
;
3870 -- STEP 8: replace the original aggregate
3873 New_Aggregate
: constant Node_Id
:= New_Copy
(N
);
3876 Set_Expressions
(New_Aggregate
, No_List
);
3877 Set_Etype
(New_Aggregate
, Etype
(N
));
3878 Set_Component_Associations
(New_Aggregate
, New_Assoc_List
);
3880 Rewrite
(N
, New_Aggregate
);
3882 end Resolve_Record_Aggregate
;
3884 -----------------------------
3885 -- Check_Can_Never_Be_Null --
3886 -----------------------------
3888 procedure Check_Can_Never_Be_Null
(Typ
: Entity_Id
; Expr
: Node_Id
) is
3889 Comp_Typ
: Entity_Id
;
3893 (Ada_Version
>= Ada_05
3894 and then Present
(Expr
)
3895 and then Known_Null
(Expr
));
3898 when E_Array_Type
=>
3899 Comp_Typ
:= Component_Type
(Typ
);
3903 Comp_Typ
:= Etype
(Typ
);
3909 if Can_Never_Be_Null
(Comp_Typ
) then
3911 -- Here we know we have a constraint error. Note that we do not use
3912 -- Apply_Compile_Time_Constraint_Error here to the Expr, which might
3913 -- seem the more natural approach. That's because in some cases the
3914 -- components are rewritten, and the replacement would be missed.
3917 (Compile_Time_Constraint_Error
3919 "(Ada 2005) null not allowed in null-excluding component?"),
3920 Make_Raise_Constraint_Error
(Sloc
(Expr
),
3921 Reason
=> CE_Access_Check_Failed
));
3923 -- Set proper type for bogus component (why is this needed???)
3925 Set_Etype
(Expr
, Comp_Typ
);
3926 Set_Analyzed
(Expr
);
3928 end Check_Can_Never_Be_Null
;
3930 ---------------------
3931 -- Sort_Case_Table --
3932 ---------------------
3934 procedure Sort_Case_Table
(Case_Table
: in out Case_Table_Type
) is
3935 L
: constant Int
:= Case_Table
'First;
3936 U
: constant Int
:= Case_Table
'Last;
3944 T
:= Case_Table
(K
+ 1);
3948 and then Expr_Value
(Case_Table
(J
- 1).Choice_Lo
) >
3949 Expr_Value
(T
.Choice_Lo
)
3951 Case_Table
(J
) := Case_Table
(J
- 1);
3955 Case_Table
(J
) := T
;
3958 end Sort_Case_Table
;