1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2018, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Aspects; use Aspects;
27 with Atree; use Atree;
28 with Checks; use Checks;
29 with Contracts; use Contracts;
30 with Debug; use Debug;
31 with Elists; use Elists;
32 with Einfo; use Einfo;
33 with Errout; use Errout;
34 with Eval_Fat; use Eval_Fat;
35 with Exp_Ch3; use Exp_Ch3;
36 with Exp_Ch9; use Exp_Ch9;
37 with Exp_Disp; use Exp_Disp;
38 with Exp_Dist; use Exp_Dist;
39 with Exp_Tss; use Exp_Tss;
40 with Exp_Util; use Exp_Util;
41 with Freeze; use Freeze;
42 with Ghost; use Ghost;
43 with Itypes; use Itypes;
44 with Layout; use Layout;
46 with Lib.Xref; use Lib.Xref;
47 with Namet; use Namet;
48 with Nmake; use Nmake;
50 with Restrict; use Restrict;
51 with Rident; use Rident;
52 with Rtsfind; use Rtsfind;
54 with Sem_Aux; use Sem_Aux;
55 with Sem_Case; use Sem_Case;
56 with Sem_Cat; use Sem_Cat;
57 with Sem_Ch6; use Sem_Ch6;
58 with Sem_Ch7; use Sem_Ch7;
59 with Sem_Ch8; use Sem_Ch8;
60 with Sem_Ch13; use Sem_Ch13;
61 with Sem_Dim; use Sem_Dim;
62 with Sem_Disp; use Sem_Disp;
63 with Sem_Dist; use Sem_Dist;
64 with Sem_Elab; use Sem_Elab;
65 with Sem_Elim; use Sem_Elim;
66 with Sem_Eval; use Sem_Eval;
67 with Sem_Mech; use Sem_Mech;
68 with Sem_Res; use Sem_Res;
69 with Sem_Smem; use Sem_Smem;
70 with Sem_Type; use Sem_Type;
71 with Sem_Util; use Sem_Util;
72 with Sem_Warn; use Sem_Warn;
73 with Stand; use Stand;
74 with Sinfo; use Sinfo;
75 with Sinput; use Sinput;
76 with Snames; use Snames;
77 with Targparm; use Targparm;
78 with Tbuild; use Tbuild;
79 with Ttypes; use Ttypes;
80 with Uintp; use Uintp;
81 with Urealp; use Urealp;
83 package body Sem_Ch3 is
85 -----------------------
86 -- Local Subprograms --
87 -----------------------
89 procedure Add_Interface_Tag_Components (N : Node_Id; Typ : Entity_Id);
90 -- Ada 2005 (AI-251): Add the tag components corresponding to all the
91 -- abstract interface types implemented by a record type or a derived
94 procedure Build_Derived_Type
96 Parent_Type : Entity_Id;
97 Derived_Type : Entity_Id;
98 Is_Completion : Boolean;
99 Derive_Subps : Boolean := True);
100 -- Create and decorate a Derived_Type given the Parent_Type entity. N is
101 -- the N_Full_Type_Declaration node containing the derived type definition.
102 -- Parent_Type is the entity for the parent type in the derived type
103 -- definition and Derived_Type the actual derived type. Is_Completion must
104 -- be set to False if Derived_Type is the N_Defining_Identifier node in N
105 -- (i.e. Derived_Type = Defining_Identifier (N)). In this case N is not the
106 -- completion of a private type declaration. If Is_Completion is set to
107 -- True, N is the completion of a private type declaration and Derived_Type
108 -- is different from the defining identifier inside N (i.e. Derived_Type /=
109 -- Defining_Identifier (N)). Derive_Subps indicates whether the parent
110 -- subprograms should be derived. The only case where this parameter is
111 -- False is when Build_Derived_Type is recursively called to process an
112 -- implicit derived full type for a type derived from a private type (in
113 -- that case the subprograms must only be derived for the private view of
116 -- ??? These flags need a bit of re-examination and re-documentation:
117 -- ??? are they both necessary (both seem related to the recursion)?
119 procedure Build_Derived_Access_Type
121 Parent_Type : Entity_Id;
122 Derived_Type : Entity_Id);
123 -- Subsidiary procedure to Build_Derived_Type. For a derived access type,
124 -- create an implicit base if the parent type is constrained or if the
125 -- subtype indication has a constraint.
127 procedure Build_Derived_Array_Type
129 Parent_Type : Entity_Id;
130 Derived_Type : Entity_Id);
131 -- Subsidiary procedure to Build_Derived_Type. For a derived array type,
132 -- create an implicit base if the parent type is constrained or if the
133 -- subtype indication has a constraint.
135 procedure Build_Derived_Concurrent_Type
137 Parent_Type : Entity_Id;
138 Derived_Type : Entity_Id);
139 -- Subsidiary procedure to Build_Derived_Type. For a derived task or
140 -- protected type, inherit entries and protected subprograms, check
141 -- legality of discriminant constraints if any.
143 procedure Build_Derived_Enumeration_Type
145 Parent_Type : Entity_Id;
146 Derived_Type : Entity_Id);
147 -- Subsidiary procedure to Build_Derived_Type. For a derived enumeration
148 -- type, we must create a new list of literals. Types derived from
149 -- Character and [Wide_]Wide_Character are special-cased.
151 procedure Build_Derived_Numeric_Type
153 Parent_Type : Entity_Id;
154 Derived_Type : Entity_Id);
155 -- Subsidiary procedure to Build_Derived_Type. For numeric types, create
156 -- an anonymous base type, and propagate constraint to subtype if needed.
158 procedure Build_Derived_Private_Type
160 Parent_Type : Entity_Id;
161 Derived_Type : Entity_Id;
162 Is_Completion : Boolean;
163 Derive_Subps : Boolean := True);
164 -- Subsidiary procedure to Build_Derived_Type. This procedure is complex
165 -- because the parent may or may not have a completion, and the derivation
166 -- may itself be a completion.
168 procedure Build_Derived_Record_Type
170 Parent_Type : Entity_Id;
171 Derived_Type : Entity_Id;
172 Derive_Subps : Boolean := True);
173 -- Subsidiary procedure used for tagged and untagged record types
174 -- by Build_Derived_Type and Analyze_Private_Extension_Declaration.
175 -- All parameters are as in Build_Derived_Type except that N, in
176 -- addition to being an N_Full_Type_Declaration node, can also be an
177 -- N_Private_Extension_Declaration node. See the definition of this routine
178 -- for much more info. Derive_Subps indicates whether subprograms should be
179 -- derived from the parent type. The only case where Derive_Subps is False
180 -- is for an implicit derived full type for a type derived from a private
181 -- type (see Build_Derived_Type).
183 procedure Build_Discriminal (Discrim : Entity_Id);
184 -- Create the discriminal corresponding to discriminant Discrim, that is
185 -- the parameter corresponding to Discrim to be used in initialization
186 -- procedures for the type where Discrim is a discriminant. Discriminals
187 -- are not used during semantic analysis, and are not fully defined
188 -- entities until expansion. Thus they are not given a scope until
189 -- initialization procedures are built.
191 function Build_Discriminant_Constraints
194 Derived_Def : Boolean := False) return Elist_Id;
195 -- Validate discriminant constraints and return the list of the constraints
196 -- in order of discriminant declarations, where T is the discriminated
197 -- unconstrained type. Def is the N_Subtype_Indication node where the
198 -- discriminants constraints for T are specified. Derived_Def is True
199 -- when building the discriminant constraints in a derived type definition
200 -- of the form "type D (...) is new T (xxx)". In this case T is the parent
201 -- type and Def is the constraint "(xxx)" on T and this routine sets the
202 -- Corresponding_Discriminant field of the discriminants in the derived
203 -- type D to point to the corresponding discriminants in the parent type T.
205 procedure Build_Discriminated_Subtype
209 Related_Nod : Node_Id;
210 For_Access : Boolean := False);
211 -- Subsidiary procedure to Constrain_Discriminated_Type and to
212 -- Process_Incomplete_Dependents. Given
214 -- T (a possibly discriminated base type)
215 -- Def_Id (a very partially built subtype for T),
217 -- the call completes Def_Id to be the appropriate E_*_Subtype.
219 -- The Elist is the list of discriminant constraints if any (it is set
220 -- to No_Elist if T is not a discriminated type, and to an empty list if
221 -- T has discriminants but there are no discriminant constraints). The
222 -- Related_Nod is the same as Decl_Node in Create_Constrained_Components.
223 -- The For_Access says whether or not this subtype is really constraining
224 -- an access type. That is its sole purpose is the designated type of an
225 -- access type -- in which case a Private_Subtype Is_For_Access_Subtype
226 -- is built to avoid freezing T when the access subtype is frozen.
228 function Build_Scalar_Bound
231 Der_T : Entity_Id) return Node_Id;
232 -- The bounds of a derived scalar type are conversions of the bounds of
233 -- the parent type. Optimize the representation if the bounds are literals.
234 -- Needs a more complete spec--what are the parameters exactly, and what
235 -- exactly is the returned value, and how is Bound affected???
237 procedure Build_Underlying_Full_View
241 -- If the completion of a private type is itself derived from a private
242 -- type, or if the full view of a private subtype is itself private, the
243 -- back-end has no way to compute the actual size of this type. We build
244 -- an internal subtype declaration of the proper parent type to convey
245 -- this information. This extra mechanism is needed because a full
246 -- view cannot itself have a full view (it would get clobbered during
249 procedure Check_Access_Discriminant_Requires_Limited
252 -- Check the restriction that the type to which an access discriminant
253 -- belongs must be a concurrent type or a descendant of a type with
254 -- the reserved word 'limited' in its declaration.
256 procedure Check_Anonymous_Access_Components
260 Comp_List : Node_Id);
261 -- Ada 2005 AI-382: an access component in a record definition can refer to
262 -- the enclosing record, in which case it denotes the type itself, and not
263 -- the current instance of the type. We create an anonymous access type for
264 -- the component, and flag it as an access to a component, so accessibility
265 -- checks are properly performed on it. The declaration of the access type
266 -- is placed ahead of that of the record to prevent order-of-elaboration
267 -- circularity issues in Gigi. We create an incomplete type for the record
268 -- declaration, which is the designated type of the anonymous access.
270 procedure Check_Delta_Expression (E : Node_Id);
271 -- Check that the expression represented by E is suitable for use as a
272 -- delta expression, i.e. it is of real type and is static.
274 procedure Check_Digits_Expression (E : Node_Id);
275 -- Check that the expression represented by E is suitable for use as a
276 -- digits expression, i.e. it is of integer type, positive and static.
278 procedure Check_Initialization (T : Entity_Id; Exp : Node_Id);
279 -- Validate the initialization of an object declaration. T is the required
280 -- type, and Exp is the initialization expression.
282 procedure Check_Interfaces (N : Node_Id; Def : Node_Id);
283 -- Check ARM rules 3.9.4 (15/2), 9.1 (9.d/2) and 9.4 (11.d/2)
285 procedure Check_Or_Process_Discriminants
288 Prev : Entity_Id := Empty);
289 -- If N is the full declaration of the completion T of an incomplete or
290 -- private type, check its discriminants (which are already known to be
291 -- conformant with those of the partial view, see Find_Type_Name),
292 -- otherwise process them. Prev is the entity of the partial declaration,
295 procedure Check_Real_Bound (Bound : Node_Id);
296 -- Check given bound for being of real type and static. If not, post an
297 -- appropriate message, and rewrite the bound with the real literal zero.
299 procedure Constant_Redeclaration
303 -- Various checks on legality of full declaration of deferred constant.
304 -- Id is the entity for the redeclaration, N is the N_Object_Declaration,
305 -- node. The caller has not yet set any attributes of this entity.
307 function Contain_Interface
309 Ifaces : Elist_Id) return Boolean;
310 -- Ada 2005: Determine whether Iface is present in the list Ifaces
312 procedure Convert_Scalar_Bounds
314 Parent_Type : Entity_Id;
315 Derived_Type : Entity_Id;
317 -- For derived scalar types, convert the bounds in the type definition to
318 -- the derived type, and complete their analysis. Given a constraint of the
319 -- form ".. new T range Lo .. Hi", Lo and Hi are analyzed and resolved with
320 -- T'Base, the parent_type. The bounds of the derived type (the anonymous
321 -- base) are copies of Lo and Hi. Finally, the bounds of the derived
322 -- subtype are conversions of those bounds to the derived_type, so that
323 -- their typing is consistent.
325 procedure Copy_Array_Base_Type_Attributes (T1, T2 : Entity_Id);
326 -- Copies attributes from array base type T2 to array base type T1. Copies
327 -- only attributes that apply to base types, but not subtypes.
329 procedure Copy_Array_Subtype_Attributes (T1, T2 : Entity_Id);
330 -- Copies attributes from array subtype T2 to array subtype T1. Copies
331 -- attributes that apply to both subtypes and base types.
333 procedure Create_Constrained_Components
337 Constraints : Elist_Id);
338 -- Build the list of entities for a constrained discriminated record
339 -- subtype. If a component depends on a discriminant, replace its subtype
340 -- using the discriminant values in the discriminant constraint. Subt
341 -- is the defining identifier for the subtype whose list of constrained
342 -- entities we will create. Decl_Node is the type declaration node where
343 -- we will attach all the itypes created. Typ is the base discriminated
344 -- type for the subtype Subt. Constraints is the list of discriminant
345 -- constraints for Typ.
347 function Constrain_Component_Type
349 Constrained_Typ : Entity_Id;
350 Related_Node : Node_Id;
352 Constraints : Elist_Id) return Entity_Id;
353 -- Given a discriminated base type Typ, a list of discriminant constraints,
354 -- Constraints, for Typ and a component Comp of Typ, create and return the
355 -- type corresponding to Etype (Comp) where all discriminant references
356 -- are replaced with the corresponding constraint. If Etype (Comp) contains
357 -- no discriminant references then it is returned as-is. Constrained_Typ
358 -- is the final constrained subtype to which the constrained component
359 -- belongs. Related_Node is the node where we attach all created itypes.
361 procedure Constrain_Access
362 (Def_Id : in out Entity_Id;
364 Related_Nod : Node_Id);
365 -- Apply a list of constraints to an access type. If Def_Id is empty, it is
366 -- an anonymous type created for a subtype indication. In that case it is
367 -- created in the procedure and attached to Related_Nod.
369 procedure Constrain_Array
370 (Def_Id : in out Entity_Id;
372 Related_Nod : Node_Id;
373 Related_Id : Entity_Id;
375 -- Apply a list of index constraints to an unconstrained array type. The
376 -- first parameter is the entity for the resulting subtype. A value of
377 -- Empty for Def_Id indicates that an implicit type must be created, but
378 -- creation is delayed (and must be done by this procedure) because other
379 -- subsidiary implicit types must be created first (which is why Def_Id
380 -- is an in/out parameter). The second parameter is a subtype indication
381 -- node for the constrained array to be created (e.g. something of the
382 -- form string (1 .. 10)). Related_Nod gives the place where this type
383 -- has to be inserted in the tree. The Related_Id and Suffix parameters
384 -- are used to build the associated Implicit type name.
386 procedure Constrain_Concurrent
387 (Def_Id : in out Entity_Id;
389 Related_Nod : Node_Id;
390 Related_Id : Entity_Id;
392 -- Apply list of discriminant constraints to an unconstrained concurrent
395 -- SI is the N_Subtype_Indication node containing the constraint and
396 -- the unconstrained type to constrain.
398 -- Def_Id is the entity for the resulting constrained subtype. A value
399 -- of Empty for Def_Id indicates that an implicit type must be created,
400 -- but creation is delayed (and must be done by this procedure) because
401 -- other subsidiary implicit types must be created first (which is why
402 -- Def_Id is an in/out parameter).
404 -- Related_Nod gives the place where this type has to be inserted
407 -- The last two arguments are used to create its external name if needed.
409 function Constrain_Corresponding_Record
410 (Prot_Subt : Entity_Id;
411 Corr_Rec : Entity_Id;
412 Related_Nod : Node_Id) return Entity_Id;
413 -- When constraining a protected type or task type with discriminants,
414 -- constrain the corresponding record with the same discriminant values.
416 procedure Constrain_Decimal (Def_Id : Node_Id; S : Node_Id);
417 -- Constrain a decimal fixed point type with a digits constraint and/or a
418 -- range constraint, and build E_Decimal_Fixed_Point_Subtype entity.
420 procedure Constrain_Discriminated_Type
423 Related_Nod : Node_Id;
424 For_Access : Boolean := False);
425 -- Process discriminant constraints of composite type. Verify that values
426 -- have been provided for all discriminants, that the original type is
427 -- unconstrained, and that the types of the supplied expressions match
428 -- the discriminant types. The first three parameters are like in routine
429 -- Constrain_Concurrent. See Build_Discriminated_Subtype for an explanation
432 procedure Constrain_Enumeration (Def_Id : Node_Id; S : Node_Id);
433 -- Constrain an enumeration type with a range constraint. This is identical
434 -- to Constrain_Integer, but for the Ekind of the resulting subtype.
436 procedure Constrain_Float (Def_Id : Node_Id; S : Node_Id);
437 -- Constrain a floating point type with either a digits constraint
438 -- and/or a range constraint, building a E_Floating_Point_Subtype.
440 procedure Constrain_Index
443 Related_Nod : Node_Id;
444 Related_Id : Entity_Id;
447 -- Process an index constraint S in a constrained array declaration. The
448 -- constraint can be a subtype name, or a range with or without an explicit
449 -- subtype mark. The index is the corresponding index of the unconstrained
450 -- array. The Related_Id and Suffix parameters are used to build the
451 -- associated Implicit type name.
453 procedure Constrain_Integer (Def_Id : Node_Id; S : Node_Id);
454 -- Build subtype of a signed or modular integer type
456 procedure Constrain_Ordinary_Fixed (Def_Id : Node_Id; S : Node_Id);
457 -- Constrain an ordinary fixed point type with a range constraint, and
458 -- build an E_Ordinary_Fixed_Point_Subtype entity.
460 procedure Copy_And_Swap (Priv, Full : Entity_Id);
461 -- Copy the Priv entity into the entity of its full declaration then swap
462 -- the two entities in such a manner that the former private type is now
463 -- seen as a full type.
465 procedure Decimal_Fixed_Point_Type_Declaration
468 -- Create a new decimal fixed point type, and apply the constraint to
469 -- obtain a subtype of this new type.
471 procedure Complete_Private_Subtype
474 Full_Base : Entity_Id;
475 Related_Nod : Node_Id);
476 -- Complete the implicit full view of a private subtype by setting the
477 -- appropriate semantic fields. If the full view of the parent is a record
478 -- type, build constrained components of subtype.
480 procedure Derive_Progenitor_Subprograms
481 (Parent_Type : Entity_Id;
482 Tagged_Type : Entity_Id);
483 -- Ada 2005 (AI-251): To complete type derivation, collect the primitive
484 -- operations of progenitors of Tagged_Type, and replace the subsidiary
485 -- subtypes with Tagged_Type, to build the specs of the inherited interface
486 -- primitives. The derived primitives are aliased to those of the
487 -- interface. This routine takes care also of transferring to the full view
488 -- subprograms associated with the partial view of Tagged_Type that cover
489 -- interface primitives.
491 procedure Derived_Standard_Character
493 Parent_Type : Entity_Id;
494 Derived_Type : Entity_Id);
495 -- Subsidiary procedure to Build_Derived_Enumeration_Type which handles
496 -- derivations from types Standard.Character and Standard.Wide_Character.
498 procedure Derived_Type_Declaration
501 Is_Completion : Boolean);
502 -- Process a derived type declaration. Build_Derived_Type is invoked
503 -- to process the actual derived type definition. Parameters N and
504 -- Is_Completion have the same meaning as in Build_Derived_Type.
505 -- T is the N_Defining_Identifier for the entity defined in the
506 -- N_Full_Type_Declaration node N, that is T is the derived type.
508 procedure Enumeration_Type_Declaration (T : Entity_Id; Def : Node_Id);
509 -- Insert each literal in symbol table, as an overloadable identifier. Each
510 -- enumeration type is mapped into a sequence of integers, and each literal
511 -- is defined as a constant with integer value. If any of the literals are
512 -- character literals, the type is a character type, which means that
513 -- strings are legal aggregates for arrays of components of the type.
515 function Expand_To_Stored_Constraint
517 Constraint : Elist_Id) return Elist_Id;
518 -- Given a constraint (i.e. a list of expressions) on the discriminants of
519 -- Typ, expand it into a constraint on the stored discriminants and return
520 -- the new list of expressions constraining the stored discriminants.
522 function Find_Type_Of_Object
524 Related_Nod : Node_Id) return Entity_Id;
525 -- Get type entity for object referenced by Obj_Def, attaching the implicit
526 -- types generated to Related_Nod.
528 procedure Floating_Point_Type_Declaration (T : Entity_Id; Def : Node_Id);
529 -- Create a new float and apply the constraint to obtain subtype of it
531 function Has_Range_Constraint (N : Node_Id) return Boolean;
532 -- Given an N_Subtype_Indication node N, return True if a range constraint
533 -- is present, either directly, or as part of a digits or delta constraint.
534 -- In addition, a digits constraint in the decimal case returns True, since
535 -- it establishes a default range if no explicit range is present.
537 function Inherit_Components
539 Parent_Base : Entity_Id;
540 Derived_Base : Entity_Id;
542 Inherit_Discr : Boolean;
543 Discs : Elist_Id) return Elist_Id;
544 -- Called from Build_Derived_Record_Type to inherit the components of
545 -- Parent_Base (a base type) into the Derived_Base (the derived base type).
546 -- For more information on derived types and component inheritance please
547 -- consult the comment above the body of Build_Derived_Record_Type.
549 -- N is the original derived type declaration
551 -- Is_Tagged is set if we are dealing with tagged types
553 -- If Inherit_Discr is set, Derived_Base inherits its discriminants from
554 -- Parent_Base, otherwise no discriminants are inherited.
556 -- Discs gives the list of constraints that apply to Parent_Base in the
557 -- derived type declaration. If Discs is set to No_Elist, then we have
558 -- the following situation:
560 -- type Parent (D1..Dn : ..) is [tagged] record ...;
561 -- type Derived is new Parent [with ...];
563 -- which gets treated as
565 -- type Derived (D1..Dn : ..) is new Parent (D1,..,Dn) [with ...];
567 -- For untagged types the returned value is an association list. The list
568 -- starts from the association (Parent_Base => Derived_Base), and then it
569 -- contains a sequence of the associations of the form
571 -- (Old_Component => New_Component),
573 -- where Old_Component is the Entity_Id of a component in Parent_Base and
574 -- New_Component is the Entity_Id of the corresponding component in
575 -- Derived_Base. For untagged records, this association list is needed when
576 -- copying the record declaration for the derived base. In the tagged case
577 -- the value returned is irrelevant.
579 procedure Inherit_Predicate_Flags (Subt, Par : Entity_Id);
580 -- Propagate static and dynamic predicate flags from a parent to the
581 -- subtype in a subtype declaration with and without constraints.
583 function Is_EVF_Procedure (Subp : Entity_Id) return Boolean;
584 -- Subsidiary to Check_Abstract_Overriding and Derive_Subprogram.
585 -- Determine whether subprogram Subp is a procedure subject to pragma
586 -- Extensions_Visible with value False and has at least one controlling
587 -- parameter of mode OUT.
589 function Is_Valid_Constraint_Kind
591 Constraint_Kind : Node_Kind) return Boolean;
592 -- Returns True if it is legal to apply the given kind of constraint to the
593 -- given kind of type (index constraint to an array type, for example).
595 procedure Modular_Type_Declaration (T : Entity_Id; Def : Node_Id);
596 -- Create new modular type. Verify that modulus is in bounds
598 procedure New_Concatenation_Op (Typ : Entity_Id);
599 -- Create an abbreviated declaration for an operator in order to
600 -- materialize concatenation on array types.
602 procedure Ordinary_Fixed_Point_Type_Declaration
605 -- Create a new ordinary fixed point type, and apply the constraint to
606 -- obtain subtype of it.
608 procedure Preanalyze_Default_Expression (N : Node_Id; T : Entity_Id);
609 -- Wrapper on Preanalyze_Spec_Expression for default expressions, so that
610 -- In_Default_Expr can be properly adjusted.
612 procedure Prepare_Private_Subtype_Completion
614 Related_Nod : Node_Id);
615 -- Id is a subtype of some private type. Creates the full declaration
616 -- associated with Id whenever possible, i.e. when the full declaration
617 -- of the base type is already known. Records each subtype into
618 -- Private_Dependents of the base type.
620 procedure Process_Incomplete_Dependents
624 -- Process all entities that depend on an incomplete type. There include
625 -- subtypes, subprogram types that mention the incomplete type in their
626 -- profiles, and subprogram with access parameters that designate the
629 -- Inc_T is the defining identifier of an incomplete type declaration, its
630 -- Ekind is E_Incomplete_Type.
632 -- N is the corresponding N_Full_Type_Declaration for Inc_T.
634 -- Full_T is N's defining identifier.
636 -- Subtypes of incomplete types with discriminants are completed when the
637 -- parent type is. This is simpler than private subtypes, because they can
638 -- only appear in the same scope, and there is no need to exchange views.
639 -- Similarly, access_to_subprogram types may have a parameter or a return
640 -- type that is an incomplete type, and that must be replaced with the
643 -- If the full type is tagged, subprogram with access parameters that
644 -- designated the incomplete may be primitive operations of the full type,
645 -- and have to be processed accordingly.
647 procedure Process_Real_Range_Specification (Def : Node_Id);
648 -- Given the type definition for a real type, this procedure processes and
649 -- checks the real range specification of this type definition if one is
650 -- present. If errors are found, error messages are posted, and the
651 -- Real_Range_Specification of Def is reset to Empty.
653 procedure Record_Type_Declaration
657 -- Process a record type declaration (for both untagged and tagged
658 -- records). Parameters T and N are exactly like in procedure
659 -- Derived_Type_Declaration, except that no flag Is_Completion is needed
660 -- for this routine. If this is the completion of an incomplete type
661 -- declaration, Prev is the entity of the incomplete declaration, used for
662 -- cross-referencing. Otherwise Prev = T.
664 procedure Record_Type_Definition (Def : Node_Id; Prev_T : Entity_Id);
665 -- This routine is used to process the actual record type definition (both
666 -- for untagged and tagged records). Def is a record type definition node.
667 -- This procedure analyzes the components in this record type definition.
668 -- Prev_T is the entity for the enclosing record type. It is provided so
669 -- that its Has_Task flag can be set if any of the component have Has_Task
670 -- set. If the declaration is the completion of an incomplete type
671 -- declaration, Prev_T is the original incomplete type, whose full view is
674 procedure Replace_Components (Typ : Entity_Id; Decl : Node_Id);
675 -- Subsidiary to Build_Derived_Record_Type. For untagged records, we
676 -- build a copy of the declaration tree of the parent, and we create
677 -- independently the list of components for the derived type. Semantic
678 -- information uses the component entities, but record representation
679 -- clauses are validated on the declaration tree. This procedure replaces
680 -- discriminants and components in the declaration with those that have
681 -- been created by Inherit_Components.
683 procedure Set_Fixed_Range
688 -- Build a range node with the given bounds and set it as the Scalar_Range
689 -- of the given fixed-point type entity. Loc is the source location used
690 -- for the constructed range. See body for further details.
692 procedure Set_Scalar_Range_For_Subtype
696 -- This routine is used to set the scalar range field for a subtype given
697 -- Def_Id, the entity for the subtype, and R, the range expression for the
698 -- scalar range. Subt provides the parent subtype to be used to analyze,
699 -- resolve, and check the given range.
701 procedure Set_Default_SSO (T : Entity_Id);
702 -- T is the entity for an array or record being declared. This procedure
703 -- sets the flags SSO_Set_Low_By_Default/SSO_Set_High_By_Default according
704 -- to the setting of Opt.Default_SSO.
706 procedure Signed_Integer_Type_Declaration (T : Entity_Id; Def : Node_Id);
707 -- Create a new signed integer entity, and apply the constraint to obtain
708 -- the required first named subtype of this type.
710 procedure Set_Stored_Constraint_From_Discriminant_Constraint
712 -- E is some record type. This routine computes E's Stored_Constraint
713 -- from its Discriminant_Constraint.
715 procedure Diagnose_Interface (N : Node_Id; E : Entity_Id);
716 -- Check that an entity in a list of progenitors is an interface,
717 -- emit error otherwise.
719 -----------------------
720 -- Access_Definition --
721 -----------------------
723 function Access_Definition
724 (Related_Nod : Node_Id;
725 N : Node_Id) return Entity_Id
727 Anon_Type : Entity_Id;
728 Anon_Scope : Entity_Id;
729 Desig_Type : Entity_Id;
730 Enclosing_Prot_Type : Entity_Id := Empty;
733 Check_SPARK_05_Restriction ("access type is not allowed", N);
735 if Is_Entry (Current_Scope)
736 and then Is_Task_Type (Etype (Scope (Current_Scope)))
738 Error_Msg_N ("task entries cannot have access parameters", N);
742 -- Ada 2005: For an object declaration the corresponding anonymous
743 -- type is declared in the current scope.
745 -- If the access definition is the return type of another access to
746 -- function, scope is the current one, because it is the one of the
747 -- current type declaration, except for the pathological case below.
749 if Nkind_In (Related_Nod, N_Object_Declaration,
750 N_Access_Function_Definition)
752 Anon_Scope := Current_Scope;
754 -- A pathological case: function returning access functions that
755 -- return access functions, etc. Each anonymous access type created
756 -- is in the enclosing scope of the outermost function.
763 while Nkind_In (Par, N_Access_Function_Definition,
769 if Nkind (Par) = N_Function_Specification then
770 Anon_Scope := Scope (Defining_Entity (Par));
774 -- For the anonymous function result case, retrieve the scope of the
775 -- function specification's associated entity rather than using the
776 -- current scope. The current scope will be the function itself if the
777 -- formal part is currently being analyzed, but will be the parent scope
778 -- in the case of a parameterless function, and we always want to use
779 -- the function's parent scope. Finally, if the function is a child
780 -- unit, we must traverse the tree to retrieve the proper entity.
782 elsif Nkind (Related_Nod) = N_Function_Specification
783 and then Nkind (Parent (N)) /= N_Parameter_Specification
785 -- If the current scope is a protected type, the anonymous access
786 -- is associated with one of the protected operations, and must
787 -- be available in the scope that encloses the protected declaration.
788 -- Otherwise the type is in the scope enclosing the subprogram.
790 -- If the function has formals, The return type of a subprogram
791 -- declaration is analyzed in the scope of the subprogram (see
792 -- Process_Formals) and thus the protected type, if present, is
793 -- the scope of the current function scope.
795 if Ekind (Current_Scope) = E_Protected_Type then
796 Enclosing_Prot_Type := Current_Scope;
798 elsif Ekind (Current_Scope) = E_Function
799 and then Ekind (Scope (Current_Scope)) = E_Protected_Type
801 Enclosing_Prot_Type := Scope (Current_Scope);
804 if Present (Enclosing_Prot_Type) then
805 Anon_Scope := Scope (Enclosing_Prot_Type);
808 Anon_Scope := Scope (Defining_Entity (Related_Nod));
811 -- For an access type definition, if the current scope is a child
812 -- unit it is the scope of the type.
814 elsif Is_Compilation_Unit (Current_Scope) then
815 Anon_Scope := Current_Scope;
817 -- For access formals, access components, and access discriminants, the
818 -- scope is that of the enclosing declaration,
821 Anon_Scope := Scope (Current_Scope);
826 (E_Anonymous_Access_Type, Related_Nod, Scope_Id => Anon_Scope);
829 and then Ada_Version >= Ada_2005
831 Error_Msg_N ("ALL is not permitted for anonymous access types", N);
834 -- Ada 2005 (AI-254): In case of anonymous access to subprograms call
835 -- the corresponding semantic routine
837 if Present (Access_To_Subprogram_Definition (N)) then
839 -- Compiler runtime units are compiled in Ada 2005 mode when building
840 -- the runtime library but must also be compilable in Ada 95 mode
841 -- (when bootstrapping the compiler).
843 Check_Compiler_Unit ("anonymous access to subprogram", N);
845 Access_Subprogram_Declaration
846 (T_Name => Anon_Type,
847 T_Def => Access_To_Subprogram_Definition (N));
849 if Ekind (Anon_Type) = E_Access_Protected_Subprogram_Type then
851 (Anon_Type, E_Anonymous_Access_Protected_Subprogram_Type);
853 Set_Ekind (Anon_Type, E_Anonymous_Access_Subprogram_Type);
856 Set_Can_Use_Internal_Rep
857 (Anon_Type, not Always_Compatible_Rep_On_Target);
859 -- If the anonymous access is associated with a protected operation,
860 -- create a reference to it after the enclosing protected definition
861 -- because the itype will be used in the subsequent bodies.
863 -- If the anonymous access itself is protected, a full type
864 -- declaratiton will be created for it, so that the equivalent
865 -- record type can be constructed. For further details, see
866 -- Replace_Anonymous_Access_To_Protected-Subprogram.
868 if Ekind (Current_Scope) = E_Protected_Type
869 and then not Protected_Present (Access_To_Subprogram_Definition (N))
871 Build_Itype_Reference (Anon_Type, Parent (Current_Scope));
877 Find_Type (Subtype_Mark (N));
878 Desig_Type := Entity (Subtype_Mark (N));
880 Set_Directly_Designated_Type (Anon_Type, Desig_Type);
881 Set_Etype (Anon_Type, Anon_Type);
883 -- Make sure the anonymous access type has size and alignment fields
884 -- set, as required by gigi. This is necessary in the case of the
885 -- Task_Body_Procedure.
887 if not Has_Private_Component (Desig_Type) then
888 Layout_Type (Anon_Type);
891 -- Ada 2005 (AI-231): Ada 2005 semantics for anonymous access differs
892 -- from Ada 95 semantics. In Ada 2005, anonymous access must specify if
893 -- the null value is allowed. In Ada 95 the null value is never allowed.
895 if Ada_Version >= Ada_2005 then
896 Set_Can_Never_Be_Null (Anon_Type, Null_Exclusion_Present (N));
898 Set_Can_Never_Be_Null (Anon_Type, True);
901 -- The anonymous access type is as public as the discriminated type or
902 -- subprogram that defines it. It is imported (for back-end purposes)
903 -- if the designated type is.
905 Set_Is_Public (Anon_Type, Is_Public (Scope (Anon_Type)));
907 -- Ada 2005 (AI-231): Propagate the access-constant attribute
909 Set_Is_Access_Constant (Anon_Type, Constant_Present (N));
911 -- The context is either a subprogram declaration, object declaration,
912 -- or an access discriminant, in a private or a full type declaration.
913 -- In the case of a subprogram, if the designated type is incomplete,
914 -- the operation will be a primitive operation of the full type, to be
915 -- updated subsequently. If the type is imported through a limited_with
916 -- clause, the subprogram is not a primitive operation of the type
917 -- (which is declared elsewhere in some other scope).
919 if Ekind (Desig_Type) = E_Incomplete_Type
920 and then not From_Limited_With (Desig_Type)
921 and then Is_Overloadable (Current_Scope)
923 Append_Elmt (Current_Scope, Private_Dependents (Desig_Type));
924 Set_Has_Delayed_Freeze (Current_Scope);
927 -- Ada 2005: If the designated type is an interface that may contain
928 -- tasks, create a Master entity for the declaration. This must be done
929 -- before expansion of the full declaration, because the declaration may
930 -- include an expression that is an allocator, whose expansion needs the
931 -- proper Master for the created tasks.
933 if Nkind (Related_Nod) = N_Object_Declaration and then Expander_Active
935 if Is_Interface (Desig_Type) and then Is_Limited_Record (Desig_Type)
937 Build_Class_Wide_Master (Anon_Type);
939 -- Similarly, if the type is an anonymous access that designates
940 -- tasks, create a master entity for it in the current context.
942 elsif Has_Task (Desig_Type) and then Comes_From_Source (Related_Nod)
944 Build_Master_Entity (Defining_Identifier (Related_Nod));
945 Build_Master_Renaming (Anon_Type);
949 -- For a private component of a protected type, it is imperative that
950 -- the back-end elaborate the type immediately after the protected
951 -- declaration, because this type will be used in the declarations
952 -- created for the component within each protected body, so we must
953 -- create an itype reference for it now.
955 if Nkind (Parent (Related_Nod)) = N_Protected_Definition then
956 Build_Itype_Reference (Anon_Type, Parent (Parent (Related_Nod)));
958 -- Similarly, if the access definition is the return result of a
959 -- function, create an itype reference for it because it will be used
960 -- within the function body. For a regular function that is not a
961 -- compilation unit, insert reference after the declaration. For a
962 -- protected operation, insert it after the enclosing protected type
963 -- declaration. In either case, do not create a reference for a type
964 -- obtained through a limited_with clause, because this would introduce
965 -- semantic dependencies.
967 -- Similarly, do not create a reference if the designated type is a
968 -- generic formal, because no use of it will reach the backend.
970 elsif Nkind (Related_Nod) = N_Function_Specification
971 and then not From_Limited_With (Desig_Type)
972 and then not Is_Generic_Type (Desig_Type)
974 if Present (Enclosing_Prot_Type) then
975 Build_Itype_Reference (Anon_Type, Parent (Enclosing_Prot_Type));
977 elsif Is_List_Member (Parent (Related_Nod))
978 and then Nkind (Parent (N)) /= N_Parameter_Specification
980 Build_Itype_Reference (Anon_Type, Parent (Related_Nod));
983 -- Finally, create an itype reference for an object declaration of an
984 -- anonymous access type. This is strictly necessary only for deferred
985 -- constants, but in any case will avoid out-of-scope problems in the
988 elsif Nkind (Related_Nod) = N_Object_Declaration then
989 Build_Itype_Reference (Anon_Type, Related_Nod);
993 end Access_Definition;
995 -----------------------------------
996 -- Access_Subprogram_Declaration --
997 -----------------------------------
999 procedure Access_Subprogram_Declaration
1000 (T_Name : Entity_Id;
1003 procedure Check_For_Premature_Usage (Def : Node_Id);
1004 -- Check that type T_Name is not used, directly or recursively, as a
1005 -- parameter or a return type in Def. Def is either a subtype, an
1006 -- access_definition, or an access_to_subprogram_definition.
1008 -------------------------------
1009 -- Check_For_Premature_Usage --
1010 -------------------------------
1012 procedure Check_For_Premature_Usage (Def : Node_Id) is
1016 -- Check for a subtype mark
1018 if Nkind (Def) in N_Has_Etype then
1019 if Etype (Def) = T_Name then
1021 ("type& cannot be used before end of its declaration", Def);
1024 -- If this is not a subtype, then this is an access_definition
1026 elsif Nkind (Def) = N_Access_Definition then
1027 if Present (Access_To_Subprogram_Definition (Def)) then
1028 Check_For_Premature_Usage
1029 (Access_To_Subprogram_Definition (Def));
1031 Check_For_Premature_Usage (Subtype_Mark (Def));
1034 -- The only cases left are N_Access_Function_Definition and
1035 -- N_Access_Procedure_Definition.
1038 if Present (Parameter_Specifications (Def)) then
1039 Param := First (Parameter_Specifications (Def));
1040 while Present (Param) loop
1041 Check_For_Premature_Usage (Parameter_Type (Param));
1042 Param := Next (Param);
1046 if Nkind (Def) = N_Access_Function_Definition then
1047 Check_For_Premature_Usage (Result_Definition (Def));
1050 end Check_For_Premature_Usage;
1054 Formals : constant List_Id := Parameter_Specifications (T_Def);
1057 Desig_Type : constant Entity_Id :=
1058 Create_Itype (E_Subprogram_Type, Parent (T_Def));
1060 -- Start of processing for Access_Subprogram_Declaration
1063 Check_SPARK_05_Restriction ("access type is not allowed", T_Def);
1065 -- Associate the Itype node with the inner full-type declaration or
1066 -- subprogram spec or entry body. This is required to handle nested
1067 -- anonymous declarations. For example:
1070 -- (X : access procedure
1071 -- (Y : access procedure
1074 D_Ityp := Associated_Node_For_Itype (Desig_Type);
1075 while not (Nkind_In (D_Ityp, N_Full_Type_Declaration,
1076 N_Private_Type_Declaration,
1077 N_Private_Extension_Declaration,
1078 N_Procedure_Specification,
1079 N_Function_Specification,
1083 Nkind_In (D_Ityp, N_Object_Declaration,
1084 N_Object_Renaming_Declaration,
1085 N_Formal_Object_Declaration,
1086 N_Formal_Type_Declaration,
1087 N_Task_Type_Declaration,
1088 N_Protected_Type_Declaration))
1090 D_Ityp := Parent (D_Ityp);
1091 pragma Assert (D_Ityp /= Empty);
1094 Set_Associated_Node_For_Itype (Desig_Type, D_Ityp);
1096 if Nkind_In (D_Ityp, N_Procedure_Specification,
1097 N_Function_Specification)
1099 Set_Scope (Desig_Type, Scope (Defining_Entity (D_Ityp)));
1101 elsif Nkind_In (D_Ityp, N_Full_Type_Declaration,
1102 N_Object_Declaration,
1103 N_Object_Renaming_Declaration,
1104 N_Formal_Type_Declaration)
1106 Set_Scope (Desig_Type, Scope (Defining_Identifier (D_Ityp)));
1109 if Nkind (T_Def) = N_Access_Function_Definition then
1110 if Nkind (Result_Definition (T_Def)) = N_Access_Definition then
1112 Acc : constant Node_Id := Result_Definition (T_Def);
1115 if Present (Access_To_Subprogram_Definition (Acc))
1117 Protected_Present (Access_To_Subprogram_Definition (Acc))
1121 Replace_Anonymous_Access_To_Protected_Subprogram
1127 Access_Definition (T_Def, Result_Definition (T_Def)));
1132 Analyze (Result_Definition (T_Def));
1135 Typ : constant Entity_Id := Entity (Result_Definition (T_Def));
1138 -- If a null exclusion is imposed on the result type, then
1139 -- create a null-excluding itype (an access subtype) and use
1140 -- it as the function's Etype.
1142 if Is_Access_Type (Typ)
1143 and then Null_Exclusion_In_Return_Present (T_Def)
1145 Set_Etype (Desig_Type,
1146 Create_Null_Excluding_Itype
1148 Related_Nod => T_Def,
1149 Scope_Id => Current_Scope));
1152 if From_Limited_With (Typ) then
1154 -- AI05-151: Incomplete types are allowed in all basic
1155 -- declarations, including access to subprograms.
1157 if Ada_Version >= Ada_2012 then
1162 ("illegal use of incomplete type&",
1163 Result_Definition (T_Def), Typ);
1166 elsif Ekind (Current_Scope) = E_Package
1167 and then In_Private_Part (Current_Scope)
1169 if Ekind (Typ) = E_Incomplete_Type then
1170 Append_Elmt (Desig_Type, Private_Dependents (Typ));
1172 elsif Is_Class_Wide_Type (Typ)
1173 and then Ekind (Etype (Typ)) = E_Incomplete_Type
1176 (Desig_Type, Private_Dependents (Etype (Typ)));
1180 Set_Etype (Desig_Type, Typ);
1185 if not (Is_Type (Etype (Desig_Type))) then
1187 ("expect type in function specification",
1188 Result_Definition (T_Def));
1192 Set_Etype (Desig_Type, Standard_Void_Type);
1195 if Present (Formals) then
1196 Push_Scope (Desig_Type);
1198 -- Some special tests here. These special tests can be removed
1199 -- if and when Itypes always have proper parent pointers to their
1202 -- Special test 1) Link defining_identifier of formals. Required by
1203 -- First_Formal to provide its functionality.
1209 F := First (Formals);
1211 -- In ASIS mode, the access_to_subprogram may be analyzed twice,
1212 -- when it is part of an unconstrained type and subtype expansion
1213 -- is disabled. To avoid back-end problems with shared profiles,
1214 -- use previous subprogram type as the designated type, and then
1215 -- remove scope added above.
1217 if ASIS_Mode and then Present (Scope (Defining_Identifier (F)))
1219 Set_Etype (T_Name, T_Name);
1220 Init_Size_Align (T_Name);
1221 Set_Directly_Designated_Type (T_Name,
1222 Scope (Defining_Identifier (F)));
1227 while Present (F) loop
1228 if No (Parent (Defining_Identifier (F))) then
1229 Set_Parent (Defining_Identifier (F), F);
1236 Process_Formals (Formals, Parent (T_Def));
1238 -- Special test 2) End_Scope requires that the parent pointer be set
1239 -- to something reasonable, but Itypes don't have parent pointers. So
1240 -- we set it and then unset it ???
1242 Set_Parent (Desig_Type, T_Name);
1244 Set_Parent (Desig_Type, Empty);
1247 -- Check for premature usage of the type being defined
1249 Check_For_Premature_Usage (T_Def);
1251 -- The return type and/or any parameter type may be incomplete. Mark the
1252 -- subprogram_type as depending on the incomplete type, so that it can
1253 -- be updated when the full type declaration is seen. This only applies
1254 -- to incomplete types declared in some enclosing scope, not to limited
1255 -- views from other packages.
1257 -- Prior to Ada 2012, access to functions can only have in_parameters.
1259 if Present (Formals) then
1260 Formal := First_Formal (Desig_Type);
1261 while Present (Formal) loop
1262 if Ekind (Formal) /= E_In_Parameter
1263 and then Nkind (T_Def) = N_Access_Function_Definition
1264 and then Ada_Version < Ada_2012
1266 Error_Msg_N ("functions can only have IN parameters", Formal);
1269 if Ekind (Etype (Formal)) = E_Incomplete_Type
1270 and then In_Open_Scopes (Scope (Etype (Formal)))
1272 Append_Elmt (Desig_Type, Private_Dependents (Etype (Formal)));
1273 Set_Has_Delayed_Freeze (Desig_Type);
1276 Next_Formal (Formal);
1280 -- Check whether an indirect call without actuals may be possible. This
1281 -- is used when resolving calls whose result is then indexed.
1283 May_Need_Actuals (Desig_Type);
1285 -- If the return type is incomplete, this is legal as long as the type
1286 -- is declared in the current scope and will be completed in it (rather
1287 -- than being part of limited view).
1289 if Ekind (Etype (Desig_Type)) = E_Incomplete_Type
1290 and then not Has_Delayed_Freeze (Desig_Type)
1291 and then In_Open_Scopes (Scope (Etype (Desig_Type)))
1293 Append_Elmt (Desig_Type, Private_Dependents (Etype (Desig_Type)));
1294 Set_Has_Delayed_Freeze (Desig_Type);
1297 Check_Delayed_Subprogram (Desig_Type);
1299 if Protected_Present (T_Def) then
1300 Set_Ekind (T_Name, E_Access_Protected_Subprogram_Type);
1301 Set_Convention (Desig_Type, Convention_Protected);
1303 Set_Ekind (T_Name, E_Access_Subprogram_Type);
1306 Set_Can_Use_Internal_Rep (T_Name,
1307 not Always_Compatible_Rep_On_Target);
1308 Set_Etype (T_Name, T_Name);
1309 Init_Size_Align (T_Name);
1310 Set_Directly_Designated_Type (T_Name, Desig_Type);
1312 -- If the access_to_subprogram is not declared at the library level,
1313 -- it can only point to subprograms that are at the same or deeper
1314 -- accessibility level. The corresponding subprogram type might
1315 -- require an activation record when compiling for C.
1317 Set_Needs_Activation_Record (Desig_Type,
1318 not Is_Library_Level_Entity (T_Name));
1320 Generate_Reference_To_Formals (T_Name);
1322 -- Ada 2005 (AI-231): Propagate the null-excluding attribute
1324 Set_Can_Never_Be_Null (T_Name, Null_Exclusion_Present (T_Def));
1326 Check_Restriction (No_Access_Subprograms, T_Def);
1327 end Access_Subprogram_Declaration;
1329 ----------------------------
1330 -- Access_Type_Declaration --
1331 ----------------------------
1333 procedure Access_Type_Declaration (T : Entity_Id; Def : Node_Id) is
1334 P : constant Node_Id := Parent (Def);
1335 S : constant Node_Id := Subtype_Indication (Def);
1337 Full_Desig : Entity_Id;
1340 Check_SPARK_05_Restriction ("access type is not allowed", Def);
1342 -- Check for permissible use of incomplete type
1344 if Nkind (S) /= N_Subtype_Indication then
1347 if Present (Entity (S))
1348 and then Ekind (Root_Type (Entity (S))) = E_Incomplete_Type
1350 Set_Directly_Designated_Type (T, Entity (S));
1352 -- If the designated type is a limited view, we cannot tell if
1353 -- the full view contains tasks, and there is no way to handle
1354 -- that full view in a client. We create a master entity for the
1355 -- scope, which will be used when a client determines that one
1358 if From_Limited_With (Entity (S))
1359 and then not Is_Class_Wide_Type (Entity (S))
1361 Set_Ekind (T, E_Access_Type);
1362 Build_Master_Entity (T);
1363 Build_Master_Renaming (T);
1367 Set_Directly_Designated_Type (T, Process_Subtype (S, P, T, 'P'));
1370 -- If the access definition is of the form: ACCESS NOT NULL ..
1371 -- the subtype indication must be of an access type. Create
1372 -- a null-excluding subtype of it.
1374 if Null_Excluding_Subtype (Def) then
1375 if not Is_Access_Type (Entity (S)) then
1376 Error_Msg_N ("null exclusion must apply to access type", Def);
1380 Loc : constant Source_Ptr := Sloc (S);
1382 Nam : constant Entity_Id := Make_Temporary (Loc, 'S');
1386 Make_Subtype_Declaration (Loc,
1387 Defining_Identifier => Nam,
1388 Subtype_Indication =>
1389 New_Occurrence_Of (Entity (S), Loc));
1390 Set_Null_Exclusion_Present (Decl);
1391 Insert_Before (Parent (Def), Decl);
1393 Set_Entity (S, Nam);
1399 Set_Directly_Designated_Type (T,
1400 Process_Subtype (S, P, T, 'P'));
1403 if All_Present (Def) or Constant_Present (Def) then
1404 Set_Ekind (T, E_General_Access_Type);
1406 Set_Ekind (T, E_Access_Type);
1409 Full_Desig := Designated_Type (T);
1411 if Base_Type (Full_Desig) = T then
1412 Error_Msg_N ("access type cannot designate itself", S);
1414 -- In Ada 2005, the type may have a limited view through some unit in
1415 -- its own context, allowing the following circularity that cannot be
1416 -- detected earlier.
1418 elsif Is_Class_Wide_Type (Full_Desig) and then Etype (Full_Desig) = T
1421 ("access type cannot designate its own class-wide type", S);
1423 -- Clean up indication of tagged status to prevent cascaded errors
1425 Set_Is_Tagged_Type (T, False);
1430 -- If the type has appeared already in a with_type clause, it is frozen
1431 -- and the pointer size is already set. Else, initialize.
1433 if not From_Limited_With (T) then
1434 Init_Size_Align (T);
1437 -- Note that Has_Task is always false, since the access type itself
1438 -- is not a task type. See Einfo for more description on this point.
1439 -- Exactly the same consideration applies to Has_Controlled_Component
1440 -- and to Has_Protected.
1442 Set_Has_Task (T, False);
1443 Set_Has_Protected (T, False);
1444 Set_Has_Timing_Event (T, False);
1445 Set_Has_Controlled_Component (T, False);
1447 -- Initialize field Finalization_Master explicitly to Empty, to avoid
1448 -- problems where an incomplete view of this entity has been previously
1449 -- established by a limited with and an overlaid version of this field
1450 -- (Stored_Constraint) was initialized for the incomplete view.
1452 -- This reset is performed in most cases except where the access type
1453 -- has been created for the purposes of allocating or deallocating a
1454 -- build-in-place object. Such access types have explicitly set pools
1455 -- and finalization masters.
1457 if No (Associated_Storage_Pool (T)) then
1458 Set_Finalization_Master (T, Empty);
1461 -- Ada 2005 (AI-231): Propagate the null-excluding and access-constant
1464 Set_Can_Never_Be_Null (T, Null_Exclusion_Present (Def));
1465 Set_Is_Access_Constant (T, Constant_Present (Def));
1466 end Access_Type_Declaration;
1468 ----------------------------------
1469 -- Add_Interface_Tag_Components --
1470 ----------------------------------
1472 procedure Add_Interface_Tag_Components (N : Node_Id; Typ : Entity_Id) is
1473 Loc : constant Source_Ptr := Sloc (N);
1477 procedure Add_Tag (Iface : Entity_Id);
1478 -- Add tag for one of the progenitor interfaces
1484 procedure Add_Tag (Iface : Entity_Id) is
1491 pragma Assert (Is_Tagged_Type (Iface) and then Is_Interface (Iface));
1493 -- This is a reasonable place to propagate predicates
1495 if Has_Predicates (Iface) then
1496 Set_Has_Predicates (Typ);
1500 Make_Component_Definition (Loc,
1501 Aliased_Present => True,
1502 Subtype_Indication =>
1503 New_Occurrence_Of (RTE (RE_Interface_Tag), Loc));
1505 Tag := Make_Temporary (Loc, 'V');
1508 Make_Component_Declaration (Loc,
1509 Defining_Identifier => Tag,
1510 Component_Definition => Def);
1512 Analyze_Component_Declaration (Decl);
1514 Set_Analyzed (Decl);
1515 Set_Ekind (Tag, E_Component);
1517 Set_Is_Aliased (Tag);
1518 Set_Related_Type (Tag, Iface);
1519 Init_Component_Location (Tag);
1521 pragma Assert (Is_Frozen (Iface));
1523 Set_DT_Entry_Count (Tag,
1524 DT_Entry_Count (First_Entity (Iface)));
1526 if No (Last_Tag) then
1529 Insert_After (Last_Tag, Decl);
1534 -- If the ancestor has discriminants we need to give special support
1535 -- to store the offset_to_top value of the secondary dispatch tables.
1536 -- For this purpose we add a supplementary component just after the
1537 -- field that contains the tag associated with each secondary DT.
1539 if Typ /= Etype (Typ) and then Has_Discriminants (Etype (Typ)) then
1541 Make_Component_Definition (Loc,
1542 Subtype_Indication =>
1543 New_Occurrence_Of (RTE (RE_Storage_Offset), Loc));
1545 Offset := Make_Temporary (Loc, 'V');
1548 Make_Component_Declaration (Loc,
1549 Defining_Identifier => Offset,
1550 Component_Definition => Def);
1552 Analyze_Component_Declaration (Decl);
1554 Set_Analyzed (Decl);
1555 Set_Ekind (Offset, E_Component);
1556 Set_Is_Aliased (Offset);
1557 Set_Related_Type (Offset, Iface);
1558 Init_Component_Location (Offset);
1559 Insert_After (Last_Tag, Decl);
1570 -- Start of processing for Add_Interface_Tag_Components
1573 if not RTE_Available (RE_Interface_Tag) then
1575 ("(Ada 2005) interface types not supported by this run-time!",
1580 if Ekind (Typ) /= E_Record_Type
1581 or else (Is_Concurrent_Record_Type (Typ)
1582 and then Is_Empty_List (Abstract_Interface_List (Typ)))
1583 or else (not Is_Concurrent_Record_Type (Typ)
1584 and then No (Interfaces (Typ))
1585 and then Is_Empty_Elmt_List (Interfaces (Typ)))
1590 -- Find the current last tag
1592 if Nkind (Type_Definition (N)) = N_Derived_Type_Definition then
1593 Ext := Record_Extension_Part (Type_Definition (N));
1595 pragma Assert (Nkind (Type_Definition (N)) = N_Record_Definition);
1596 Ext := Type_Definition (N);
1601 if not (Present (Component_List (Ext))) then
1602 Set_Null_Present (Ext, False);
1604 Set_Component_List (Ext,
1605 Make_Component_List (Loc,
1606 Component_Items => L,
1607 Null_Present => False));
1609 if Nkind (Type_Definition (N)) = N_Derived_Type_Definition then
1610 L := Component_Items
1612 (Record_Extension_Part
1613 (Type_Definition (N))));
1615 L := Component_Items
1617 (Type_Definition (N)));
1620 -- Find the last tag component
1623 while Present (Comp) loop
1624 if Nkind (Comp) = N_Component_Declaration
1625 and then Is_Tag (Defining_Identifier (Comp))
1634 -- At this point L references the list of components and Last_Tag
1635 -- references the current last tag (if any). Now we add the tag
1636 -- corresponding with all the interfaces that are not implemented
1639 if Present (Interfaces (Typ)) then
1640 Elmt := First_Elmt (Interfaces (Typ));
1641 while Present (Elmt) loop
1642 Add_Tag (Node (Elmt));
1646 end Add_Interface_Tag_Components;
1648 -------------------------------------
1649 -- Add_Internal_Interface_Entities --
1650 -------------------------------------
1652 procedure Add_Internal_Interface_Entities (Tagged_Type : Entity_Id) is
1655 Iface_Elmt : Elmt_Id;
1656 Iface_Prim : Entity_Id;
1657 Ifaces_List : Elist_Id;
1658 New_Subp : Entity_Id := Empty;
1660 Restore_Scope : Boolean := False;
1663 pragma Assert (Ada_Version >= Ada_2005
1664 and then Is_Record_Type (Tagged_Type)
1665 and then Is_Tagged_Type (Tagged_Type)
1666 and then Has_Interfaces (Tagged_Type)
1667 and then not Is_Interface (Tagged_Type));
1669 -- Ensure that the internal entities are added to the scope of the type
1671 if Scope (Tagged_Type) /= Current_Scope then
1672 Push_Scope (Scope (Tagged_Type));
1673 Restore_Scope := True;
1676 Collect_Interfaces (Tagged_Type, Ifaces_List);
1678 Iface_Elmt := First_Elmt (Ifaces_List);
1679 while Present (Iface_Elmt) loop
1680 Iface := Node (Iface_Elmt);
1682 -- Originally we excluded here from this processing interfaces that
1683 -- are parents of Tagged_Type because their primitives are located
1684 -- in the primary dispatch table (and hence no auxiliary internal
1685 -- entities are required to handle secondary dispatch tables in such
1686 -- case). However, these auxiliary entities are also required to
1687 -- handle derivations of interfaces in formals of generics (see
1688 -- Derive_Subprograms).
1690 Elmt := First_Elmt (Primitive_Operations (Iface));
1691 while Present (Elmt) loop
1692 Iface_Prim := Node (Elmt);
1694 if not Is_Predefined_Dispatching_Operation (Iface_Prim) then
1696 Find_Primitive_Covering_Interface
1697 (Tagged_Type => Tagged_Type,
1698 Iface_Prim => Iface_Prim);
1700 if No (Prim) and then Serious_Errors_Detected > 0 then
1704 pragma Assert (Present (Prim));
1706 -- Ada 2012 (AI05-0197): If the name of the covering primitive
1707 -- differs from the name of the interface primitive then it is
1708 -- a private primitive inherited from a parent type. In such
1709 -- case, given that Tagged_Type covers the interface, the
1710 -- inherited private primitive becomes visible. For such
1711 -- purpose we add a new entity that renames the inherited
1712 -- private primitive.
1714 if Chars (Prim) /= Chars (Iface_Prim) then
1715 pragma Assert (Has_Suffix (Prim, 'P'));
1717 (New_Subp => New_Subp,
1718 Parent_Subp => Iface_Prim,
1719 Derived_Type => Tagged_Type,
1720 Parent_Type => Iface);
1721 Set_Alias (New_Subp, Prim);
1722 Set_Is_Abstract_Subprogram
1723 (New_Subp, Is_Abstract_Subprogram (Prim));
1727 (New_Subp => New_Subp,
1728 Parent_Subp => Iface_Prim,
1729 Derived_Type => Tagged_Type,
1730 Parent_Type => Iface);
1735 if Is_Inherited_Operation (Prim)
1736 and then Present (Alias (Prim))
1738 Anc := Alias (Prim);
1740 Anc := Overridden_Operation (Prim);
1743 -- Apply legality checks in RM 6.1.1 (10-13) concerning
1744 -- nonconforming preconditions in both an ancestor and
1745 -- a progenitor operation.
1747 -- If the operation is a primitive wrapper it is an explicit
1748 -- (overriding) operqtion and all is fine.
1751 and then Has_Non_Trivial_Precondition (Anc)
1752 and then Has_Non_Trivial_Precondition (Iface_Prim)
1754 if Is_Abstract_Subprogram (Prim)
1756 (Ekind (Prim) = E_Procedure
1757 and then Nkind (Parent (Prim)) =
1758 N_Procedure_Specification
1759 and then Null_Present (Parent (Prim)))
1760 or else Is_Primitive_Wrapper (Prim)
1764 -- The operation is inherited and must be overridden
1766 elsif not Comes_From_Source (Prim) then
1768 ("&inherits non-conforming preconditions and must "
1769 & "be overridden (RM 6.1.1 (10-16)",
1770 Parent (Tagged_Type), Prim);
1775 -- Ada 2005 (AI-251): Decorate internal entity Iface_Subp
1776 -- associated with interface types. These entities are
1777 -- only registered in the list of primitives of its
1778 -- corresponding tagged type because they are only used
1779 -- to fill the contents of the secondary dispatch tables.
1780 -- Therefore they are removed from the homonym chains.
1782 Set_Is_Hidden (New_Subp);
1783 Set_Is_Internal (New_Subp);
1784 Set_Alias (New_Subp, Prim);
1785 Set_Is_Abstract_Subprogram
1786 (New_Subp, Is_Abstract_Subprogram (Prim));
1787 Set_Interface_Alias (New_Subp, Iface_Prim);
1789 -- If the returned type is an interface then propagate it to
1790 -- the returned type. Needed by the thunk to generate the code
1791 -- which displaces "this" to reference the corresponding
1792 -- secondary dispatch table in the returned object.
1794 if Is_Interface (Etype (Iface_Prim)) then
1795 Set_Etype (New_Subp, Etype (Iface_Prim));
1798 -- Internal entities associated with interface types are only
1799 -- registered in the list of primitives of the tagged type.
1800 -- They are only used to fill the contents of the secondary
1801 -- dispatch tables. Therefore they are not needed in the
1804 Remove_Homonym (New_Subp);
1806 -- Hidden entities associated with interfaces must have set
1807 -- the Has_Delay_Freeze attribute to ensure that, in case
1808 -- of locally defined tagged types (or compiling with static
1809 -- dispatch tables generation disabled) the corresponding
1810 -- entry of the secondary dispatch table is filled when such
1811 -- an entity is frozen. This is an expansion activity that must
1812 -- be suppressed for ASIS because it leads to gigi elaboration
1813 -- issues in annotate mode.
1815 if not ASIS_Mode then
1816 Set_Has_Delayed_Freeze (New_Subp);
1824 Next_Elmt (Iface_Elmt);
1827 if Restore_Scope then
1830 end Add_Internal_Interface_Entities;
1832 -----------------------------------
1833 -- Analyze_Component_Declaration --
1834 -----------------------------------
1836 procedure Analyze_Component_Declaration (N : Node_Id) is
1837 Loc : constant Source_Ptr := Sloc (Component_Definition (N));
1838 Id : constant Entity_Id := Defining_Identifier (N);
1839 E : constant Node_Id := Expression (N);
1840 Typ : constant Node_Id :=
1841 Subtype_Indication (Component_Definition (N));
1845 function Contains_POC (Constr : Node_Id) return Boolean;
1846 -- Determines whether a constraint uses the discriminant of a record
1847 -- type thus becoming a per-object constraint (POC).
1849 function Is_Known_Limited (Typ : Entity_Id) return Boolean;
1850 -- Typ is the type of the current component, check whether this type is
1851 -- a limited type. Used to validate declaration against that of
1852 -- enclosing record.
1858 function Contains_POC (Constr : Node_Id) return Boolean is
1860 -- Prevent cascaded errors
1862 if Error_Posted (Constr) then
1866 case Nkind (Constr) is
1867 when N_Attribute_Reference =>
1868 return Attribute_Name (Constr) = Name_Access
1869 and then Prefix (Constr) = Scope (Entity (Prefix (Constr)));
1871 when N_Discriminant_Association =>
1872 return Denotes_Discriminant (Expression (Constr));
1874 when N_Identifier =>
1875 return Denotes_Discriminant (Constr);
1877 when N_Index_Or_Discriminant_Constraint =>
1882 IDC := First (Constraints (Constr));
1883 while Present (IDC) loop
1885 -- One per-object constraint is sufficient
1887 if Contains_POC (IDC) then
1898 return Denotes_Discriminant (Low_Bound (Constr))
1900 Denotes_Discriminant (High_Bound (Constr));
1902 when N_Range_Constraint =>
1903 return Denotes_Discriminant (Range_Expression (Constr));
1910 ----------------------
1911 -- Is_Known_Limited --
1912 ----------------------
1914 function Is_Known_Limited (Typ : Entity_Id) return Boolean is
1915 P : constant Entity_Id := Etype (Typ);
1916 R : constant Entity_Id := Root_Type (Typ);
1919 if Is_Limited_Record (Typ) then
1922 -- If the root type is limited (and not a limited interface) so is
1923 -- the current type.
1925 elsif Is_Limited_Record (R)
1926 and then (not Is_Interface (R) or else not Is_Limited_Interface (R))
1930 -- Else the type may have a limited interface progenitor, but a
1931 -- limited record parent that is not an interface.
1934 and then Is_Limited_Record (P)
1935 and then not Is_Interface (P)
1942 end Is_Known_Limited;
1944 -- Start of processing for Analyze_Component_Declaration
1947 Generate_Definition (Id);
1950 if Present (Typ) then
1951 T := Find_Type_Of_Object
1952 (Subtype_Indication (Component_Definition (N)), N);
1954 if not Nkind_In (Typ, N_Identifier, N_Expanded_Name) then
1955 Check_SPARK_05_Restriction ("subtype mark required", Typ);
1958 -- Ada 2005 (AI-230): Access Definition case
1961 pragma Assert (Present
1962 (Access_Definition (Component_Definition (N))));
1964 T := Access_Definition
1966 N => Access_Definition (Component_Definition (N)));
1967 Set_Is_Local_Anonymous_Access (T);
1969 -- Ada 2005 (AI-254)
1971 if Present (Access_To_Subprogram_Definition
1972 (Access_Definition (Component_Definition (N))))
1973 and then Protected_Present (Access_To_Subprogram_Definition
1975 (Component_Definition (N))))
1977 T := Replace_Anonymous_Access_To_Protected_Subprogram (N);
1981 -- If the subtype is a constrained subtype of the enclosing record,
1982 -- (which must have a partial view) the back-end does not properly
1983 -- handle the recursion. Rewrite the component declaration with an
1984 -- explicit subtype indication, which is acceptable to Gigi. We can copy
1985 -- the tree directly because side effects have already been removed from
1986 -- discriminant constraints.
1988 if Ekind (T) = E_Access_Subtype
1989 and then Is_Entity_Name (Subtype_Indication (Component_Definition (N)))
1990 and then Comes_From_Source (T)
1991 and then Nkind (Parent (T)) = N_Subtype_Declaration
1992 and then Etype (Directly_Designated_Type (T)) = Current_Scope
1995 (Subtype_Indication (Component_Definition (N)),
1996 New_Copy_Tree (Subtype_Indication (Parent (T))));
1997 T := Find_Type_Of_Object
1998 (Subtype_Indication (Component_Definition (N)), N);
2001 -- If the component declaration includes a default expression, then we
2002 -- check that the component is not of a limited type (RM 3.7(5)),
2003 -- and do the special preanalysis of the expression (see section on
2004 -- "Handling of Default and Per-Object Expressions" in the spec of
2008 Check_SPARK_05_Restriction ("default expression is not allowed", E);
2009 Preanalyze_Default_Expression (E, T);
2010 Check_Initialization (T, E);
2012 if Ada_Version >= Ada_2005
2013 and then Ekind (T) = E_Anonymous_Access_Type
2014 and then Etype (E) /= Any_Type
2016 -- Check RM 3.9.2(9): "if the expected type for an expression is
2017 -- an anonymous access-to-specific tagged type, then the object
2018 -- designated by the expression shall not be dynamically tagged
2019 -- unless it is a controlling operand in a call on a dispatching
2022 if Is_Tagged_Type (Directly_Designated_Type (T))
2024 Ekind (Directly_Designated_Type (T)) /= E_Class_Wide_Type
2026 Ekind (Directly_Designated_Type (Etype (E))) =
2030 ("access to specific tagged type required (RM 3.9.2(9))", E);
2033 -- (Ada 2005: AI-230): Accessibility check for anonymous
2036 if Type_Access_Level (Etype (E)) >
2037 Deepest_Type_Access_Level (T)
2040 ("expression has deeper access level than component " &
2041 "(RM 3.10.2 (12.2))", E);
2044 -- The initialization expression is a reference to an access
2045 -- discriminant. The type of the discriminant is always deeper
2046 -- than any access type.
2048 if Ekind (Etype (E)) = E_Anonymous_Access_Type
2049 and then Is_Entity_Name (E)
2050 and then Ekind (Entity (E)) = E_In_Parameter
2051 and then Present (Discriminal_Link (Entity (E)))
2054 ("discriminant has deeper accessibility level than target",
2060 -- The parent type may be a private view with unknown discriminants,
2061 -- and thus unconstrained. Regular components must be constrained.
2063 if not Is_Definite_Subtype (T) and then Chars (Id) /= Name_uParent then
2064 if Is_Class_Wide_Type (T) then
2066 ("class-wide subtype with unknown discriminants" &
2067 " in component declaration",
2068 Subtype_Indication (Component_Definition (N)));
2071 ("unconstrained subtype in component declaration",
2072 Subtype_Indication (Component_Definition (N)));
2075 -- Components cannot be abstract, except for the special case of
2076 -- the _Parent field (case of extending an abstract tagged type)
2078 elsif Is_Abstract_Type (T) and then Chars (Id) /= Name_uParent then
2079 Error_Msg_N ("type of a component cannot be abstract", N);
2083 Set_Is_Aliased (Id, Aliased_Present (Component_Definition (N)));
2085 -- The component declaration may have a per-object constraint, set
2086 -- the appropriate flag in the defining identifier of the subtype.
2088 if Present (Subtype_Indication (Component_Definition (N))) then
2090 Sindic : constant Node_Id :=
2091 Subtype_Indication (Component_Definition (N));
2093 if Nkind (Sindic) = N_Subtype_Indication
2094 and then Present (Constraint (Sindic))
2095 and then Contains_POC (Constraint (Sindic))
2097 Set_Has_Per_Object_Constraint (Id);
2102 -- Ada 2005 (AI-231): Propagate the null-excluding attribute and carry
2103 -- out some static checks.
2105 if Ada_Version >= Ada_2005 and then Can_Never_Be_Null (T) then
2106 Null_Exclusion_Static_Checks (N);
2109 -- If this component is private (or depends on a private type), flag the
2110 -- record type to indicate that some operations are not available.
2112 P := Private_Component (T);
2116 -- Check for circular definitions
2118 if P = Any_Type then
2119 Set_Etype (Id, Any_Type);
2121 -- There is a gap in the visibility of operations only if the
2122 -- component type is not defined in the scope of the record type.
2124 elsif Scope (P) = Scope (Current_Scope) then
2127 elsif Is_Limited_Type (P) then
2128 Set_Is_Limited_Composite (Current_Scope);
2131 Set_Is_Private_Composite (Current_Scope);
2136 and then Is_Limited_Type (T)
2137 and then Chars (Id) /= Name_uParent
2138 and then Is_Tagged_Type (Current_Scope)
2140 if Is_Derived_Type (Current_Scope)
2141 and then not Is_Known_Limited (Current_Scope)
2144 ("extension of nonlimited type cannot have limited components",
2147 if Is_Interface (Root_Type (Current_Scope)) then
2149 ("\limitedness is not inherited from limited interface", N);
2150 Error_Msg_N ("\add LIMITED to type indication", N);
2153 Explain_Limited_Type (T, N);
2154 Set_Etype (Id, Any_Type);
2155 Set_Is_Limited_Composite (Current_Scope, False);
2157 elsif not Is_Derived_Type (Current_Scope)
2158 and then not Is_Limited_Record (Current_Scope)
2159 and then not Is_Concurrent_Type (Current_Scope)
2162 ("nonlimited tagged type cannot have limited components", N);
2163 Explain_Limited_Type (T, N);
2164 Set_Etype (Id, Any_Type);
2165 Set_Is_Limited_Composite (Current_Scope, False);
2169 -- If the component is an unconstrained task or protected type with
2170 -- discriminants, the component and the enclosing record are limited
2171 -- and the component is constrained by its default values. Compute
2172 -- its actual subtype, else it may be allocated the maximum size by
2173 -- the backend, and possibly overflow.
2175 if Is_Concurrent_Type (T)
2176 and then not Is_Constrained (T)
2177 and then Has_Discriminants (T)
2178 and then not Has_Discriminants (Current_Scope)
2181 Act_T : constant Entity_Id := Build_Default_Subtype (T, N);
2184 Set_Etype (Id, Act_T);
2186 -- Rewrite component definition to use the constrained subtype
2188 Rewrite (Component_Definition (N),
2189 Make_Component_Definition (Loc,
2190 Subtype_Indication => New_Occurrence_Of (Act_T, Loc)));
2194 Set_Original_Record_Component (Id, Id);
2196 if Has_Aspects (N) then
2197 Analyze_Aspect_Specifications (N, Id);
2200 Analyze_Dimension (N);
2201 end Analyze_Component_Declaration;
2203 --------------------------
2204 -- Analyze_Declarations --
2205 --------------------------
2207 procedure Analyze_Declarations (L : List_Id) is
2210 procedure Adjust_Decl;
2211 -- Adjust Decl not to include implicit label declarations, since these
2212 -- have strange Sloc values that result in elaboration check problems.
2213 -- (They have the sloc of the label as found in the source, and that
2214 -- is ahead of the current declarative part).
2216 procedure Build_Assertion_Bodies (Decls : List_Id; Context : Node_Id);
2217 -- Create the subprogram bodies which verify the run-time semantics of
2218 -- the pragmas listed below for each elibigle type found in declarative
2219 -- list Decls. The pragmas are:
2221 -- Default_Initial_Condition
2225 -- Context denotes the owner of the declarative list.
2227 procedure Check_Entry_Contracts;
2228 -- Perform a preanalysis of the pre- and postconditions of an entry
2229 -- declaration. This must be done before full resolution and creation
2230 -- of the parameter block, etc. to catch illegal uses within the
2231 -- contract expression. Full analysis of the expression is done when
2232 -- the contract is processed.
2234 function Contains_Lib_Incomplete_Type (Pkg : Entity_Id) return Boolean;
2235 -- Check if a nested package has entities within it that rely on library
2236 -- level private types where the full view has not been completed for
2237 -- the purposes of checking if it is acceptable to freeze an expression
2238 -- function at the point of declaration.
2240 procedure Handle_Late_Controlled_Primitive (Body_Decl : Node_Id);
2241 -- Determine whether Body_Decl denotes the body of a late controlled
2242 -- primitive (either Initialize, Adjust or Finalize). If this is the
2243 -- case, add a proper spec if the body lacks one. The spec is inserted
2244 -- before Body_Decl and immediately analyzed.
2246 procedure Remove_Partial_Visible_Refinements (Spec_Id : Entity_Id);
2247 -- Spec_Id is the entity of a package that may define abstract states,
2248 -- and in the case of a child unit, whose ancestors may define abstract
2249 -- states. If the states have partial visible refinement, remove the
2250 -- partial visibility of each constituent at the end of the package
2251 -- spec and body declarations.
2253 procedure Remove_Visible_Refinements (Spec_Id : Entity_Id);
2254 -- Spec_Id is the entity of a package that may define abstract states.
2255 -- If the states have visible refinement, remove the visibility of each
2256 -- constituent at the end of the package body declaration.
2258 procedure Resolve_Aspects;
2259 -- Utility to resolve the expressions of aspects at the end of a list of
2260 -- declarations, or before a declaration that freezes previous entities,
2261 -- such as in a subprogram body.
2267 procedure Adjust_Decl is
2269 while Present (Prev (Decl))
2270 and then Nkind (Decl) = N_Implicit_Label_Declaration
2276 ----------------------------
2277 -- Build_Assertion_Bodies --
2278 ----------------------------
2280 procedure Build_Assertion_Bodies (Decls : List_Id; Context : Node_Id) is
2281 procedure Build_Assertion_Bodies_For_Type (Typ : Entity_Id);
2282 -- Create the subprogram bodies which verify the run-time semantics
2283 -- of the pragmas listed below for type Typ. The pragmas are:
2285 -- Default_Initial_Condition
2289 -------------------------------------
2290 -- Build_Assertion_Bodies_For_Type --
2291 -------------------------------------
2293 procedure Build_Assertion_Bodies_For_Type (Typ : Entity_Id) is
2295 -- Preanalyze and resolve the Default_Initial_Condition assertion
2296 -- expression at the end of the declarations to catch any errors.
2298 if Has_DIC (Typ) then
2299 Build_DIC_Procedure_Body (Typ);
2302 if Nkind (Context) = N_Package_Specification then
2304 -- Preanalyze and resolve the class-wide invariants of an
2305 -- interface at the end of whichever declarative part has the
2306 -- interface type. Note that an interface may be declared in
2307 -- any non-package declarative part, but reaching the end of
2308 -- such a declarative part will always freeze the type and
2309 -- generate the invariant procedure (see Freeze_Type).
2311 if Is_Interface (Typ) then
2313 -- Interfaces are treated as the partial view of a private
2314 -- type, in order to achieve uniformity with the general
2315 -- case. As a result, an interface receives only a "partial"
2316 -- invariant procedure, which is never called.
2318 if Has_Own_Invariants (Typ) then
2319 Build_Invariant_Procedure_Body
2321 Partial_Invariant => True);
2324 -- Preanalyze and resolve the invariants of a private type
2325 -- at the end of the visible declarations to catch potential
2326 -- errors. Inherited class-wide invariants are not included
2327 -- because they have already been resolved.
2329 elsif Decls = Visible_Declarations (Context)
2330 and then Ekind_In (Typ, E_Limited_Private_Type,
2332 E_Record_Type_With_Private)
2333 and then Has_Own_Invariants (Typ)
2335 Build_Invariant_Procedure_Body
2337 Partial_Invariant => True);
2339 -- Preanalyze and resolve the invariants of a private type's
2340 -- full view at the end of the private declarations to catch
2341 -- potential errors.
2343 elsif Decls = Private_Declarations (Context)
2344 and then not Is_Private_Type (Typ)
2345 and then Has_Private_Declaration (Typ)
2346 and then Has_Invariants (Typ)
2348 Build_Invariant_Procedure_Body (Typ);
2351 end Build_Assertion_Bodies_For_Type;
2356 Decl_Id : Entity_Id;
2358 -- Start of processing for Build_Assertion_Bodies
2361 Decl := First (Decls);
2362 while Present (Decl) loop
2363 if Is_Declaration (Decl) then
2364 Decl_Id := Defining_Entity (Decl);
2366 if Is_Type (Decl_Id) then
2367 Build_Assertion_Bodies_For_Type (Decl_Id);
2373 end Build_Assertion_Bodies;
2375 ---------------------------
2376 -- Check_Entry_Contracts --
2377 ---------------------------
2379 procedure Check_Entry_Contracts is
2385 Ent := First_Entity (Current_Scope);
2386 while Present (Ent) loop
2388 -- This only concerns entries with pre/postconditions
2390 if Ekind (Ent) = E_Entry
2391 and then Present (Contract (Ent))
2392 and then Present (Pre_Post_Conditions (Contract (Ent)))
2394 ASN := Pre_Post_Conditions (Contract (Ent));
2396 Install_Formals (Ent);
2398 -- Pre/postconditions are rewritten as Check pragmas. Analysis
2399 -- is performed on a copy of the pragma expression, to prevent
2400 -- modifying the original expression.
2402 while Present (ASN) loop
2403 if Nkind (ASN) = N_Pragma then
2407 (First (Pragma_Argument_Associations (ASN))));
2408 Set_Parent (Exp, ASN);
2410 Preanalyze_Assert_Expression (Exp, Standard_Boolean);
2413 ASN := Next_Pragma (ASN);
2421 end Check_Entry_Contracts;
2423 ----------------------------------
2424 -- Contains_Lib_Incomplete_Type --
2425 ----------------------------------
2427 function Contains_Lib_Incomplete_Type (Pkg : Entity_Id) return Boolean is
2431 -- Avoid looking through scopes that do not meet the precondition of
2432 -- Pkg not being within a library unit spec.
2434 if not Is_Compilation_Unit (Pkg)
2435 and then not Is_Generic_Instance (Pkg)
2436 and then not In_Package_Body (Enclosing_Lib_Unit_Entity (Pkg))
2438 -- Loop through all entities in the current scope to identify
2439 -- an entity that depends on a private type.
2441 Curr := First_Entity (Pkg);
2443 if Nkind (Curr) in N_Entity
2444 and then Depends_On_Private (Curr)
2449 exit when Last_Entity (Current_Scope) = Curr;
2450 Curr := Next_Entity (Curr);
2455 end Contains_Lib_Incomplete_Type;
2457 --------------------------------------
2458 -- Handle_Late_Controlled_Primitive --
2459 --------------------------------------
2461 procedure Handle_Late_Controlled_Primitive (Body_Decl : Node_Id) is
2462 Body_Spec : constant Node_Id := Specification (Body_Decl);
2463 Body_Id : constant Entity_Id := Defining_Entity (Body_Spec);
2464 Loc : constant Source_Ptr := Sloc (Body_Id);
2465 Params : constant List_Id :=
2466 Parameter_Specifications (Body_Spec);
2468 Spec_Id : Entity_Id;
2472 -- Consider only procedure bodies whose name matches one of the three
2473 -- controlled primitives.
2475 if Nkind (Body_Spec) /= N_Procedure_Specification
2476 or else not Nam_In (Chars (Body_Id), Name_Adjust,
2482 -- A controlled primitive must have exactly one formal which is not
2483 -- an anonymous access type.
2485 elsif List_Length (Params) /= 1 then
2489 Typ := Parameter_Type (First (Params));
2491 if Nkind (Typ) = N_Access_Definition then
2497 -- The type of the formal must be derived from [Limited_]Controlled
2499 if not Is_Controlled (Entity (Typ)) then
2503 -- Check whether a specification exists for this body. We do not
2504 -- analyze the spec of the body in full, because it will be analyzed
2505 -- again when the body is properly analyzed, and we cannot create
2506 -- duplicate entries in the formals chain. We look for an explicit
2507 -- specification because the body may be an overriding operation and
2508 -- an inherited spec may be present.
2510 Spec_Id := Current_Entity (Body_Id);
2512 while Present (Spec_Id) loop
2513 if Ekind_In (Spec_Id, E_Procedure, E_Generic_Procedure)
2514 and then Scope (Spec_Id) = Current_Scope
2515 and then Present (First_Formal (Spec_Id))
2516 and then No (Next_Formal (First_Formal (Spec_Id)))
2517 and then Etype (First_Formal (Spec_Id)) = Entity (Typ)
2518 and then Comes_From_Source (Spec_Id)
2523 Spec_Id := Homonym (Spec_Id);
2526 -- At this point the body is known to be a late controlled primitive.
2527 -- Generate a matching spec and insert it before the body. Note the
2528 -- use of Copy_Separate_Tree - we want an entirely separate semantic
2529 -- tree in this case.
2531 Spec := Copy_Separate_Tree (Body_Spec);
2533 -- Ensure that the subprogram declaration does not inherit the null
2534 -- indicator from the body as we now have a proper spec/body pair.
2536 Set_Null_Present (Spec, False);
2538 -- Ensure that the freeze node is inserted after the declaration of
2539 -- the primitive since its expansion will freeze the primitive.
2541 Decl := Make_Subprogram_Declaration (Loc, Specification => Spec);
2543 Insert_Before_And_Analyze (Body_Decl, Decl);
2544 end Handle_Late_Controlled_Primitive;
2546 ----------------------------------------
2547 -- Remove_Partial_Visible_Refinements --
2548 ----------------------------------------
2550 procedure Remove_Partial_Visible_Refinements (Spec_Id : Entity_Id) is
2551 State_Elmt : Elmt_Id;
2553 if Present (Abstract_States (Spec_Id)) then
2554 State_Elmt := First_Elmt (Abstract_States (Spec_Id));
2555 while Present (State_Elmt) loop
2556 Set_Has_Partial_Visible_Refinement (Node (State_Elmt), False);
2557 Next_Elmt (State_Elmt);
2561 -- For a child unit, also hide the partial state refinement from
2562 -- ancestor packages.
2564 if Is_Child_Unit (Spec_Id) then
2565 Remove_Partial_Visible_Refinements (Scope (Spec_Id));
2567 end Remove_Partial_Visible_Refinements;
2569 --------------------------------
2570 -- Remove_Visible_Refinements --
2571 --------------------------------
2573 procedure Remove_Visible_Refinements (Spec_Id : Entity_Id) is
2574 State_Elmt : Elmt_Id;
2576 if Present (Abstract_States (Spec_Id)) then
2577 State_Elmt := First_Elmt (Abstract_States (Spec_Id));
2578 while Present (State_Elmt) loop
2579 Set_Has_Visible_Refinement (Node (State_Elmt), False);
2580 Next_Elmt (State_Elmt);
2583 end Remove_Visible_Refinements;
2585 ---------------------
2586 -- Resolve_Aspects --
2587 ---------------------
2589 procedure Resolve_Aspects is
2593 E := First_Entity (Current_Scope);
2594 while Present (E) loop
2595 Resolve_Aspect_Expressions (E);
2598 end Resolve_Aspects;
2602 Context : Node_Id := Empty;
2603 Freeze_From : Entity_Id := Empty;
2604 Next_Decl : Node_Id;
2606 Body_Seen : Boolean := False;
2607 -- Flag set when the first body [stub] is encountered
2609 -- Start of processing for Analyze_Declarations
2612 if Restriction_Check_Required (SPARK_05) then
2613 Check_Later_Vs_Basic_Declarations (L, During_Parsing => False);
2617 while Present (Decl) loop
2619 -- Package spec cannot contain a package declaration in SPARK
2621 if Nkind (Decl) = N_Package_Declaration
2622 and then Nkind (Parent (L)) = N_Package_Specification
2624 Check_SPARK_05_Restriction
2625 ("package specification cannot contain a package declaration",
2629 -- Complete analysis of declaration
2632 Next_Decl := Next (Decl);
2634 if No (Freeze_From) then
2635 Freeze_From := First_Entity (Current_Scope);
2638 -- At the end of a declarative part, freeze remaining entities
2639 -- declared in it. The end of the visible declarations of package
2640 -- specification is not the end of a declarative part if private
2641 -- declarations are present. The end of a package declaration is a
2642 -- freezing point only if it a library package. A task definition or
2643 -- protected type definition is not a freeze point either. Finally,
2644 -- we do not freeze entities in generic scopes, because there is no
2645 -- code generated for them and freeze nodes will be generated for
2648 -- The end of a package instantiation is not a freeze point, but
2649 -- for now we make it one, because the generic body is inserted
2650 -- (currently) immediately after. Generic instantiations will not
2651 -- be a freeze point once delayed freezing of bodies is implemented.
2652 -- (This is needed in any case for early instantiations ???).
2654 if No (Next_Decl) then
2655 if Nkind (Parent (L)) = N_Component_List then
2658 elsif Nkind_In (Parent (L), N_Protected_Definition,
2661 Check_Entry_Contracts;
2663 elsif Nkind (Parent (L)) /= N_Package_Specification then
2664 if Nkind (Parent (L)) = N_Package_Body then
2665 Freeze_From := First_Entity (Current_Scope);
2668 -- There may have been several freezing points previously,
2669 -- for example object declarations or subprogram bodies, but
2670 -- at the end of a declarative part we check freezing from
2671 -- the beginning, even though entities may already be frozen,
2672 -- in order to perform visibility checks on delayed aspects.
2676 -- If the current scope is a generic subprogram body. Skip the
2677 -- generic formal parameters that are not frozen here.
2679 if Is_Subprogram (Current_Scope)
2680 and then Nkind (Unit_Declaration_Node (Current_Scope)) =
2681 N_Generic_Subprogram_Declaration
2682 and then Present (First_Entity (Current_Scope))
2684 while Is_Generic_Formal (Freeze_From) loop
2685 Freeze_From := Next_Entity (Freeze_From);
2688 Freeze_All (Freeze_From, Decl);
2689 Freeze_From := Last_Entity (Current_Scope);
2692 -- For declarations in a subprogram body there is no issue
2693 -- with name resolution in aspect specifications, but in
2694 -- ASIS mode we need to preanalyze aspect specifications
2695 -- that may otherwise only be analyzed during expansion
2696 -- (e.g. during generation of a related subprogram).
2702 Freeze_All (First_Entity (Current_Scope), Decl);
2703 Freeze_From := Last_Entity (Current_Scope);
2706 -- Current scope is a package specification
2708 elsif Scope (Current_Scope) /= Standard_Standard
2709 and then not Is_Child_Unit (Current_Scope)
2710 and then No (Generic_Parent (Parent (L)))
2712 -- ARM rule 13.1.1(11/3): usage names in aspect definitions are
2713 -- resolved at the end of the immediately enclosing declaration
2714 -- list (AI05-0183-1).
2718 elsif L /= Visible_Declarations (Parent (L))
2719 or else No (Private_Declarations (Parent (L)))
2720 or else Is_Empty_List (Private_Declarations (Parent (L)))
2724 -- End of a package declaration
2726 -- In compilation mode the expansion of freeze node takes care
2727 -- of resolving expressions of all aspects in the list. In ASIS
2728 -- mode this must be done explicitly.
2731 and then Scope (Current_Scope) = Standard_Standard
2736 -- This is a freeze point because it is the end of a
2737 -- compilation unit.
2739 Freeze_All (First_Entity (Current_Scope), Decl);
2740 Freeze_From := Last_Entity (Current_Scope);
2742 -- At the end of the visible declarations the expressions in
2743 -- aspects of all entities declared so far must be resolved.
2744 -- The entities themselves might be frozen later, and the
2745 -- generated pragmas and attribute definition clauses analyzed
2746 -- in full at that point, but name resolution must take place
2748 -- In addition to being the proper semantics, this is mandatory
2749 -- within generic units, because global name capture requires
2750 -- those expressions to be analyzed, given that the generated
2751 -- pragmas do not appear in the original generic tree.
2753 elsif Serious_Errors_Detected = 0 then
2757 -- If next node is a body then freeze all types before the body.
2758 -- An exception occurs for some expander-generated bodies. If these
2759 -- are generated at places where in general language rules would not
2760 -- allow a freeze point, then we assume that the expander has
2761 -- explicitly checked that all required types are properly frozen,
2762 -- and we do not cause general freezing here. This special circuit
2763 -- is used when the encountered body is marked as having already
2766 -- In all other cases (bodies that come from source, and expander
2767 -- generated bodies that have not been analyzed yet), freeze all
2768 -- types now. Note that in the latter case, the expander must take
2769 -- care to attach the bodies at a proper place in the tree so as to
2770 -- not cause unwanted freezing at that point.
2772 -- It is also necessary to check for a case where both an expression
2773 -- function is used and the current scope depends on an incomplete
2774 -- private type from a library unit, otherwise premature freezing of
2775 -- the private type will occur.
2777 elsif not Analyzed (Next_Decl) and then Is_Body (Next_Decl)
2778 and then ((Nkind (Next_Decl) /= N_Subprogram_Body
2779 or else not Was_Expression_Function (Next_Decl))
2780 or else (not Is_Ignored_Ghost_Entity (Current_Scope)
2781 and then not Contains_Lib_Incomplete_Type
2784 -- When a controlled type is frozen, the expander generates stream
2785 -- and controlled-type support routines. If the freeze is caused
2786 -- by the stand-alone body of Initialize, Adjust, or Finalize, the
2787 -- expander will end up using the wrong version of these routines,
2788 -- as the body has not been processed yet. To remedy this, detect
2789 -- a late controlled primitive and create a proper spec for it.
2790 -- This ensures that the primitive will override its inherited
2791 -- counterpart before the freeze takes place.
2793 -- If the declaration we just processed is a body, do not attempt
2794 -- to examine Next_Decl as the late primitive idiom can only apply
2795 -- to the first encountered body.
2797 -- The spec of the late primitive is not generated in ASIS mode to
2798 -- ensure a consistent list of primitives that indicates the true
2799 -- semantic structure of the program (which is not relevant when
2800 -- generating executable code).
2802 -- ??? A cleaner approach may be possible and/or this solution
2803 -- could be extended to general-purpose late primitives, TBD.
2806 and then not Body_Seen
2807 and then not Is_Body (Decl)
2811 if Nkind (Next_Decl) = N_Subprogram_Body then
2812 Handle_Late_Controlled_Primitive (Next_Decl);
2816 -- In ASIS mode, if the next declaration is a body, complete
2817 -- the analysis of declarations so far.
2824 -- The generated body of an expression function does not freeze,
2825 -- unless it is a completion, in which case only the expression
2826 -- itself freezes. This is handled when the body itself is
2827 -- analyzed (see Freeze_Expr_Types, sem_ch6.adb).
2829 Freeze_All (Freeze_From, Decl);
2830 Freeze_From := Last_Entity (Current_Scope);
2836 -- Post-freezing actions
2839 Context := Parent (L);
2841 -- Certain contract annocations have forward visibility semantics and
2842 -- must be analyzed after all declarative items have been processed.
2843 -- This timing ensures that entities referenced by such contracts are
2846 -- Analyze the contract of an immediately enclosing package spec or
2847 -- body first because other contracts may depend on its information.
2849 if Nkind (Context) = N_Package_Body then
2850 Analyze_Package_Body_Contract (Defining_Entity (Context));
2852 elsif Nkind (Context) = N_Package_Specification then
2853 Analyze_Package_Contract (Defining_Entity (Context));
2856 -- Analyze the contracts of various constructs in the declarative
2859 Analyze_Contracts (L);
2861 if Nkind (Context) = N_Package_Body then
2863 -- Ensure that all abstract states and objects declared in the
2864 -- state space of a package body are utilized as constituents.
2866 Check_Unused_Body_States (Defining_Entity (Context));
2868 -- State refinements are visible up to the end of the package body
2869 -- declarations. Hide the state refinements from visibility to
2870 -- restore the original state conditions.
2872 Remove_Visible_Refinements (Corresponding_Spec (Context));
2873 Remove_Partial_Visible_Refinements (Corresponding_Spec (Context));
2875 elsif Nkind (Context) = N_Package_Specification then
2877 -- Partial state refinements are visible up to the end of the
2878 -- package spec declarations. Hide the partial state refinements
2879 -- from visibility to restore the original state conditions.
2881 Remove_Partial_Visible_Refinements (Defining_Entity (Context));
2884 -- Verify that all abstract states found in any package declared in
2885 -- the input declarative list have proper refinements. The check is
2886 -- performed only when the context denotes a block, entry, package,
2887 -- protected, subprogram, or task body (SPARK RM 7.2.2(3)).
2889 Check_State_Refinements (Context);
2891 -- Create the subprogram bodies which verify the run-time semantics
2892 -- of pragmas Default_Initial_Condition and [Type_]Invariant for all
2893 -- types within the current declarative list. This ensures that all
2894 -- assertion expressions are preanalyzed and resolved at the end of
2895 -- the declarative part. Note that the resolution happens even when
2896 -- freezing does not take place.
2898 Build_Assertion_Bodies (L, Context);
2900 end Analyze_Declarations;
2902 -----------------------------------
2903 -- Analyze_Full_Type_Declaration --
2904 -----------------------------------
2906 procedure Analyze_Full_Type_Declaration (N : Node_Id) is
2907 Def : constant Node_Id := Type_Definition (N);
2908 Def_Id : constant Entity_Id := Defining_Identifier (N);
2912 Is_Remote : constant Boolean :=
2913 (Is_Remote_Types (Current_Scope)
2914 or else Is_Remote_Call_Interface (Current_Scope))
2915 and then not (In_Private_Part (Current_Scope)
2916 or else In_Package_Body (Current_Scope));
2918 procedure Check_Nonoverridable_Aspects;
2919 -- Apply the rule in RM 13.1.1(18.4/4) on iterator aspects that cannot
2920 -- be overridden, and can only be confirmed on derivation.
2922 procedure Check_Ops_From_Incomplete_Type;
2923 -- If there is a tagged incomplete partial view of the type, traverse
2924 -- the primitives of the incomplete view and change the type of any
2925 -- controlling formals and result to indicate the full view. The
2926 -- primitives will be added to the full type's primitive operations
2927 -- list later in Sem_Disp.Check_Operation_From_Incomplete_Type (which
2928 -- is called from Process_Incomplete_Dependents).
2930 ----------------------------------
2931 -- Check_Nonoverridable_Aspects --
2932 ----------------------------------
2934 procedure Check_Nonoverridable_Aspects is
2935 function Get_Aspect_Spec
2937 Aspect_Name : Name_Id) return Node_Id;
2938 -- Check whether a list of aspect specifications includes an entry
2939 -- for a specific aspect. The list is either that of a partial or
2942 ---------------------
2943 -- Get_Aspect_Spec --
2944 ---------------------
2946 function Get_Aspect_Spec
2948 Aspect_Name : Name_Id) return Node_Id
2953 Spec := First (Specs);
2954 while Present (Spec) loop
2955 if Chars (Identifier (Spec)) = Aspect_Name then
2962 end Get_Aspect_Spec;
2966 Prev_Aspects : constant List_Id :=
2967 Aspect_Specifications (Parent (Def_Id));
2968 Par_Type : Entity_Id;
2969 Prev_Aspect : Node_Id;
2971 -- Start of processing for Check_Nonoverridable_Aspects
2974 -- Get parent type of derived type. Note that Prev is the entity in
2975 -- the partial declaration, but its contents are now those of full
2976 -- view, while Def_Id reflects the partial view.
2978 if Is_Private_Type (Def_Id) then
2979 Par_Type := Etype (Full_View (Def_Id));
2981 Par_Type := Etype (Def_Id);
2984 -- If there is an inherited Implicit_Dereference, verify that it is
2985 -- made explicit in the partial view.
2987 if Has_Discriminants (Base_Type (Par_Type))
2988 and then Nkind (Parent (Prev)) = N_Full_Type_Declaration
2989 and then Present (Discriminant_Specifications (Parent (Prev)))
2990 and then Present (Get_Reference_Discriminant (Par_Type))
2993 Get_Aspect_Spec (Prev_Aspects, Name_Implicit_Dereference);
2997 (Discriminant_Specifications
2998 (Original_Node (Parent (Prev))))
3001 ("type does not inherit implicit dereference", Prev);
3004 -- If one of the views has the aspect specified, verify that it
3005 -- is consistent with that of the parent.
3008 Par_Discr : constant Entity_Id :=
3009 Get_Reference_Discriminant (Par_Type);
3010 Cur_Discr : constant Entity_Id :=
3011 Get_Reference_Discriminant (Prev);
3014 if Corresponding_Discriminant (Cur_Discr) /= Par_Discr then
3015 Error_Msg_N ("aspect incosistent with that of parent", N);
3018 -- Check that specification in partial view matches the
3019 -- inherited aspect. Compare names directly because aspect
3020 -- expression may not be analyzed.
3022 if Present (Prev_Aspect)
3023 and then Nkind (Expression (Prev_Aspect)) = N_Identifier
3024 and then Chars (Expression (Prev_Aspect)) /=
3028 ("aspect incosistent with that of parent", N);
3034 -- TBD : other nonoverridable aspects.
3035 end Check_Nonoverridable_Aspects;
3037 ------------------------------------
3038 -- Check_Ops_From_Incomplete_Type --
3039 ------------------------------------
3041 procedure Check_Ops_From_Incomplete_Type is
3048 and then Ekind (Prev) = E_Incomplete_Type
3049 and then Is_Tagged_Type (Prev)
3050 and then Is_Tagged_Type (T)
3052 Elmt := First_Elmt (Primitive_Operations (Prev));
3053 while Present (Elmt) loop
3056 Formal := First_Formal (Op);
3057 while Present (Formal) loop
3058 if Etype (Formal) = Prev then
3059 Set_Etype (Formal, T);
3062 Next_Formal (Formal);
3065 if Etype (Op) = Prev then
3072 end Check_Ops_From_Incomplete_Type;
3074 -- Start of processing for Analyze_Full_Type_Declaration
3077 Prev := Find_Type_Name (N);
3079 -- The full view, if present, now points to the current type. If there
3080 -- is an incomplete partial view, set a link to it, to simplify the
3081 -- retrieval of primitive operations of the type.
3083 -- Ada 2005 (AI-50217): If the type was previously decorated when
3084 -- imported through a LIMITED WITH clause, it appears as incomplete
3085 -- but has no full view.
3087 if Ekind (Prev) = E_Incomplete_Type
3088 and then Present (Full_View (Prev))
3090 T := Full_View (Prev);
3091 Set_Incomplete_View (N, Parent (Prev));
3096 Set_Is_Pure (T, Is_Pure (Current_Scope));
3098 -- We set the flag Is_First_Subtype here. It is needed to set the
3099 -- corresponding flag for the Implicit class-wide-type created
3100 -- during tagged types processing.
3102 Set_Is_First_Subtype (T, True);
3104 -- Only composite types other than array types are allowed to have
3109 -- For derived types, the rule will be checked once we've figured
3110 -- out the parent type.
3112 when N_Derived_Type_Definition =>
3115 -- For record types, discriminants are allowed, unless we are in
3118 when N_Record_Definition =>
3119 if Present (Discriminant_Specifications (N)) then
3120 Check_SPARK_05_Restriction
3121 ("discriminant type is not allowed",
3123 (First (Discriminant_Specifications (N))));
3127 if Present (Discriminant_Specifications (N)) then
3129 ("elementary or array type cannot have discriminants",
3131 (First (Discriminant_Specifications (N))));
3135 -- Elaborate the type definition according to kind, and generate
3136 -- subsidiary (implicit) subtypes where needed. We skip this if it was
3137 -- already done (this happens during the reanalysis that follows a call
3138 -- to the high level optimizer).
3140 if not Analyzed (T) then
3143 -- Set the SPARK mode from the current context
3145 Set_SPARK_Pragma (T, SPARK_Mode_Pragma);
3146 Set_SPARK_Pragma_Inherited (T);
3149 when N_Access_To_Subprogram_Definition =>
3150 Access_Subprogram_Declaration (T, Def);
3152 -- If this is a remote access to subprogram, we must create the
3153 -- equivalent fat pointer type, and related subprograms.
3156 Process_Remote_AST_Declaration (N);
3159 -- Validate categorization rule against access type declaration
3160 -- usually a violation in Pure unit, Shared_Passive unit.
3162 Validate_Access_Type_Declaration (T, N);
3164 when N_Access_To_Object_Definition =>
3165 Access_Type_Declaration (T, Def);
3167 -- Validate categorization rule against access type declaration
3168 -- usually a violation in Pure unit, Shared_Passive unit.
3170 Validate_Access_Type_Declaration (T, N);
3172 -- If we are in a Remote_Call_Interface package and define a
3173 -- RACW, then calling stubs and specific stream attributes
3177 and then Is_Remote_Access_To_Class_Wide_Type (Def_Id)
3179 Add_RACW_Features (Def_Id);
3182 when N_Array_Type_Definition =>
3183 Array_Type_Declaration (T, Def);
3185 when N_Derived_Type_Definition =>
3186 Derived_Type_Declaration (T, N, T /= Def_Id);
3188 -- Inherit predicates from parent, and protect against illegal
3191 if Is_Type (T) and then Has_Predicates (T) then
3192 Set_Has_Predicates (Def_Id);
3195 -- Save the scenario for examination by the ABE Processing
3198 Record_Elaboration_Scenario (N);
3200 when N_Enumeration_Type_Definition =>
3201 Enumeration_Type_Declaration (T, Def);
3203 when N_Floating_Point_Definition =>
3204 Floating_Point_Type_Declaration (T, Def);
3206 when N_Decimal_Fixed_Point_Definition =>
3207 Decimal_Fixed_Point_Type_Declaration (T, Def);
3209 when N_Ordinary_Fixed_Point_Definition =>
3210 Ordinary_Fixed_Point_Type_Declaration (T, Def);
3212 when N_Signed_Integer_Type_Definition =>
3213 Signed_Integer_Type_Declaration (T, Def);
3215 when N_Modular_Type_Definition =>
3216 Modular_Type_Declaration (T, Def);
3218 when N_Record_Definition =>
3219 Record_Type_Declaration (T, N, Prev);
3221 -- If declaration has a parse error, nothing to elaborate.
3227 raise Program_Error;
3231 if Etype (T) = Any_Type then
3235 -- Controlled type is not allowed in SPARK
3237 if Is_Visibly_Controlled (T) then
3238 Check_SPARK_05_Restriction ("controlled type is not allowed", N);
3241 -- Some common processing for all types
3243 Set_Depends_On_Private (T, Has_Private_Component (T));
3244 Check_Ops_From_Incomplete_Type;
3246 -- Both the declared entity, and its anonymous base type if one was
3247 -- created, need freeze nodes allocated.
3250 B : constant Entity_Id := Base_Type (T);
3253 -- In the case where the base type differs from the first subtype, we
3254 -- pre-allocate a freeze node, and set the proper link to the first
3255 -- subtype. Freeze_Entity will use this preallocated freeze node when
3256 -- it freezes the entity.
3258 -- This does not apply if the base type is a generic type, whose
3259 -- declaration is independent of the current derived definition.
3261 if B /= T and then not Is_Generic_Type (B) then
3262 Ensure_Freeze_Node (B);
3263 Set_First_Subtype_Link (Freeze_Node (B), T);
3266 -- A type that is imported through a limited_with clause cannot
3267 -- generate any code, and thus need not be frozen. However, an access
3268 -- type with an imported designated type needs a finalization list,
3269 -- which may be referenced in some other package that has non-limited
3270 -- visibility on the designated type. Thus we must create the
3271 -- finalization list at the point the access type is frozen, to
3272 -- prevent unsatisfied references at link time.
3274 if not From_Limited_With (T) or else Is_Access_Type (T) then
3275 Set_Has_Delayed_Freeze (T);
3279 -- Case where T is the full declaration of some private type which has
3280 -- been swapped in Defining_Identifier (N).
3282 if T /= Def_Id and then Is_Private_Type (Def_Id) then
3283 Process_Full_View (N, T, Def_Id);
3285 -- Record the reference. The form of this is a little strange, since
3286 -- the full declaration has been swapped in. So the first parameter
3287 -- here represents the entity to which a reference is made which is
3288 -- the "real" entity, i.e. the one swapped in, and the second
3289 -- parameter provides the reference location.
3291 -- Also, we want to kill Has_Pragma_Unreferenced temporarily here
3292 -- since we don't want a complaint about the full type being an
3293 -- unwanted reference to the private type
3296 B : constant Boolean := Has_Pragma_Unreferenced (T);
3298 Set_Has_Pragma_Unreferenced (T, False);
3299 Generate_Reference (T, T, 'c');
3300 Set_Has_Pragma_Unreferenced (T, B);
3303 Set_Completion_Referenced (Def_Id);
3305 -- For completion of incomplete type, process incomplete dependents
3306 -- and always mark the full type as referenced (it is the incomplete
3307 -- type that we get for any real reference).
3309 elsif Ekind (Prev) = E_Incomplete_Type then
3310 Process_Incomplete_Dependents (N, T, Prev);
3311 Generate_Reference (Prev, Def_Id, 'c');
3312 Set_Completion_Referenced (Def_Id);
3314 -- If not private type or incomplete type completion, this is a real
3315 -- definition of a new entity, so record it.
3318 Generate_Definition (Def_Id);
3321 -- Propagate any pending access types whose finalization masters need to
3322 -- be fully initialized from the partial to the full view. Guard against
3323 -- an illegal full view that remains unanalyzed.
3325 if Is_Type (Def_Id) and then Is_Incomplete_Or_Private_Type (Prev) then
3326 Set_Pending_Access_Types (Def_Id, Pending_Access_Types (Prev));
3329 if Chars (Scope (Def_Id)) = Name_System
3330 and then Chars (Def_Id) = Name_Address
3331 and then In_Predefined_Unit (N)
3333 Set_Is_Descendant_Of_Address (Def_Id);
3334 Set_Is_Descendant_Of_Address (Base_Type (Def_Id));
3335 Set_Is_Descendant_Of_Address (Prev);
3338 Set_Optimize_Alignment_Flags (Def_Id);
3339 Check_Eliminated (Def_Id);
3341 -- If the declaration is a completion and aspects are present, apply
3342 -- them to the entity for the type which is currently the partial
3343 -- view, but which is the one that will be frozen.
3345 if Has_Aspects (N) then
3347 -- In most cases the partial view is a private type, and both views
3348 -- appear in different declarative parts. In the unusual case where
3349 -- the partial view is incomplete, perform the analysis on the
3350 -- full view, to prevent freezing anomalies with the corresponding
3351 -- class-wide type, which otherwise might be frozen before the
3352 -- dispatch table is built.
3355 and then Ekind (Prev) /= E_Incomplete_Type
3357 Analyze_Aspect_Specifications (N, Prev);
3362 Analyze_Aspect_Specifications (N, Def_Id);
3366 if Is_Derived_Type (Prev)
3367 and then Def_Id /= Prev
3369 Check_Nonoverridable_Aspects;
3371 end Analyze_Full_Type_Declaration;
3373 ----------------------------------
3374 -- Analyze_Incomplete_Type_Decl --
3375 ----------------------------------
3377 procedure Analyze_Incomplete_Type_Decl (N : Node_Id) is
3378 F : constant Boolean := Is_Pure (Current_Scope);
3382 Check_SPARK_05_Restriction ("incomplete type is not allowed", N);
3384 Generate_Definition (Defining_Identifier (N));
3386 -- Process an incomplete declaration. The identifier must not have been
3387 -- declared already in the scope. However, an incomplete declaration may
3388 -- appear in the private part of a package, for a private type that has
3389 -- already been declared.
3391 -- In this case, the discriminants (if any) must match
3393 T := Find_Type_Name (N);
3395 Set_Ekind (T, E_Incomplete_Type);
3397 Set_Is_First_Subtype (T);
3398 Init_Size_Align (T);
3400 -- Set the SPARK mode from the current context
3402 Set_SPARK_Pragma (T, SPARK_Mode_Pragma);
3403 Set_SPARK_Pragma_Inherited (T);
3405 -- Ada 2005 (AI-326): Minimum decoration to give support to tagged
3406 -- incomplete types.
3408 if Tagged_Present (N) then
3409 Set_Is_Tagged_Type (T, True);
3410 Set_No_Tagged_Streams_Pragma (T, No_Tagged_Streams);
3411 Make_Class_Wide_Type (T);
3412 Set_Direct_Primitive_Operations (T, New_Elmt_List);
3415 Set_Stored_Constraint (T, No_Elist);
3417 if Present (Discriminant_Specifications (N)) then
3419 Process_Discriminants (N);
3423 -- If the type has discriminants, nontrivial subtypes may be declared
3424 -- before the full view of the type. The full views of those subtypes
3425 -- will be built after the full view of the type.
3427 Set_Private_Dependents (T, New_Elmt_List);
3429 end Analyze_Incomplete_Type_Decl;
3431 -----------------------------------
3432 -- Analyze_Interface_Declaration --
3433 -----------------------------------
3435 procedure Analyze_Interface_Declaration (T : Entity_Id; Def : Node_Id) is
3436 CW : constant Entity_Id := Class_Wide_Type (T);
3439 Set_Is_Tagged_Type (T);
3440 Set_No_Tagged_Streams_Pragma (T, No_Tagged_Streams);
3442 Set_Is_Limited_Record (T, Limited_Present (Def)
3443 or else Task_Present (Def)
3444 or else Protected_Present (Def)
3445 or else Synchronized_Present (Def));
3447 -- Type is abstract if full declaration carries keyword, or if previous
3448 -- partial view did.
3450 Set_Is_Abstract_Type (T);
3451 Set_Is_Interface (T);
3453 -- Type is a limited interface if it includes the keyword limited, task,
3454 -- protected, or synchronized.
3456 Set_Is_Limited_Interface
3457 (T, Limited_Present (Def)
3458 or else Protected_Present (Def)
3459 or else Synchronized_Present (Def)
3460 or else Task_Present (Def));
3462 Set_Interfaces (T, New_Elmt_List);
3463 Set_Direct_Primitive_Operations (T, New_Elmt_List);
3465 -- Complete the decoration of the class-wide entity if it was already
3466 -- built (i.e. during the creation of the limited view)
3468 if Present (CW) then
3469 Set_Is_Interface (CW);
3470 Set_Is_Limited_Interface (CW, Is_Limited_Interface (T));
3473 -- Check runtime support for synchronized interfaces
3475 if (Is_Task_Interface (T)
3476 or else Is_Protected_Interface (T)
3477 or else Is_Synchronized_Interface (T))
3478 and then not RTE_Available (RE_Select_Specific_Data)
3480 Error_Msg_CRT ("synchronized interfaces", T);
3482 end Analyze_Interface_Declaration;
3484 -----------------------------
3485 -- Analyze_Itype_Reference --
3486 -----------------------------
3488 -- Nothing to do. This node is placed in the tree only for the benefit of
3489 -- back end processing, and has no effect on the semantic processing.
3491 procedure Analyze_Itype_Reference (N : Node_Id) is
3493 pragma Assert (Is_Itype (Itype (N)));
3495 end Analyze_Itype_Reference;
3497 --------------------------------
3498 -- Analyze_Number_Declaration --
3499 --------------------------------
3501 procedure Analyze_Number_Declaration (N : Node_Id) is
3502 E : constant Node_Id := Expression (N);
3503 Id : constant Entity_Id := Defining_Identifier (N);
3504 Index : Interp_Index;
3509 Generate_Definition (Id);
3512 -- This is an optimization of a common case of an integer literal
3514 if Nkind (E) = N_Integer_Literal then
3515 Set_Is_Static_Expression (E, True);
3516 Set_Etype (E, Universal_Integer);
3518 Set_Etype (Id, Universal_Integer);
3519 Set_Ekind (Id, E_Named_Integer);
3520 Set_Is_Frozen (Id, True);
3524 Set_Is_Pure (Id, Is_Pure (Current_Scope));
3526 -- Process expression, replacing error by integer zero, to avoid
3527 -- cascaded errors or aborts further along in the processing
3529 -- Replace Error by integer zero, which seems least likely to cause
3533 Rewrite (E, Make_Integer_Literal (Sloc (E), Uint_0));
3534 Set_Error_Posted (E);
3539 -- Verify that the expression is static and numeric. If
3540 -- the expression is overloaded, we apply the preference
3541 -- rule that favors root numeric types.
3543 if not Is_Overloaded (E) then
3545 if Has_Dynamic_Predicate_Aspect (T) then
3547 ("subtype has dynamic predicate, "
3548 & "not allowed in number declaration", N);
3554 Get_First_Interp (E, Index, It);
3555 while Present (It.Typ) loop
3556 if (Is_Integer_Type (It.Typ) or else Is_Real_Type (It.Typ))
3557 and then (Scope (Base_Type (It.Typ))) = Standard_Standard
3559 if T = Any_Type then
3562 elsif It.Typ = Universal_Real
3564 It.Typ = Universal_Integer
3566 -- Choose universal interpretation over any other
3573 Get_Next_Interp (Index, It);
3577 if Is_Integer_Type (T) then
3579 Set_Etype (Id, Universal_Integer);
3580 Set_Ekind (Id, E_Named_Integer);
3582 elsif Is_Real_Type (T) then
3584 -- Because the real value is converted to universal_real, this is a
3585 -- legal context for a universal fixed expression.
3587 if T = Universal_Fixed then
3589 Loc : constant Source_Ptr := Sloc (N);
3590 Conv : constant Node_Id := Make_Type_Conversion (Loc,
3592 New_Occurrence_Of (Universal_Real, Loc),
3593 Expression => Relocate_Node (E));
3600 elsif T = Any_Fixed then
3601 Error_Msg_N ("illegal context for mixed mode operation", E);
3603 -- Expression is of the form : universal_fixed * integer. Try to
3604 -- resolve as universal_real.
3606 T := Universal_Real;
3611 Set_Etype (Id, Universal_Real);
3612 Set_Ekind (Id, E_Named_Real);
3615 Wrong_Type (E, Any_Numeric);
3619 Set_Ekind (Id, E_Constant);
3620 Set_Never_Set_In_Source (Id, True);
3621 Set_Is_True_Constant (Id, True);
3625 if Nkind_In (E, N_Integer_Literal, N_Real_Literal) then
3626 Set_Etype (E, Etype (Id));
3629 if not Is_OK_Static_Expression (E) then
3630 Flag_Non_Static_Expr
3631 ("non-static expression used in number declaration!", E);
3632 Rewrite (E, Make_Integer_Literal (Sloc (N), 1));
3633 Set_Etype (E, Any_Type);
3636 Analyze_Dimension (N);
3637 end Analyze_Number_Declaration;
3639 --------------------------------
3640 -- Analyze_Object_Declaration --
3641 --------------------------------
3643 -- WARNING: This routine manages Ghost regions. Return statements must be
3644 -- replaced by gotos which jump to the end of the routine and restore the
3647 procedure Analyze_Object_Declaration (N : Node_Id) is
3648 Loc : constant Source_Ptr := Sloc (N);
3649 Id : constant Entity_Id := Defining_Identifier (N);
3653 E : Node_Id := Expression (N);
3654 -- E is set to Expression (N) throughout this routine. When Expression
3655 -- (N) is modified, E is changed accordingly.
3657 Prev_Entity : Entity_Id := Empty;
3659 procedure Check_Dynamic_Object (Typ : Entity_Id);
3660 -- A library-level object with nonstatic discriminant constraints may
3661 -- require dynamic allocation. The declaration is illegal if the
3662 -- profile includes the restriction No_Implicit_Heap_Allocations.
3664 procedure Check_For_Null_Excluding_Components
3665 (Obj_Typ : Entity_Id;
3666 Obj_Decl : Node_Id);
3667 -- Verify that each null-excluding component of object declaration
3668 -- Obj_Decl carrying type Obj_Typ has explicit initialization. Emit
3669 -- a compile-time warning if this is not the case.
3671 function Count_Tasks (T : Entity_Id) return Uint;
3672 -- This function is called when a non-generic library level object of a
3673 -- task type is declared. Its function is to count the static number of
3674 -- tasks declared within the type (it is only called if Has_Task is set
3675 -- for T). As a side effect, if an array of tasks with nonstatic bounds
3676 -- or a variant record type is encountered, Check_Restriction is called
3677 -- indicating the count is unknown.
3679 function Delayed_Aspect_Present return Boolean;
3680 -- If the declaration has an expression that is an aggregate, and it
3681 -- has aspects that require delayed analysis, the resolution of the
3682 -- aggregate must be deferred to the freeze point of the object. This
3683 -- special processing was created for address clauses, but it must
3684 -- also apply to Alignment. This must be done before the aspect
3685 -- specifications are analyzed because we must handle the aggregate
3686 -- before the analysis of the object declaration is complete.
3688 -- Any other relevant delayed aspects on object declarations ???
3690 --------------------------
3691 -- Check_Dynamic_Object --
3692 --------------------------
3694 procedure Check_Dynamic_Object (Typ : Entity_Id) is
3696 Obj_Type : Entity_Id;
3701 if Is_Private_Type (Obj_Type)
3702 and then Present (Full_View (Obj_Type))
3704 Obj_Type := Full_View (Obj_Type);
3707 if Known_Static_Esize (Obj_Type) then
3711 if Restriction_Active (No_Implicit_Heap_Allocations)
3712 and then Expander_Active
3713 and then Has_Discriminants (Obj_Type)
3715 Comp := First_Component (Obj_Type);
3716 while Present (Comp) loop
3717 if Known_Static_Esize (Etype (Comp))
3718 or else Size_Known_At_Compile_Time (Etype (Comp))
3722 elsif not Discriminated_Size (Comp)
3723 and then Comes_From_Source (Comp)
3726 ("component& of non-static size will violate restriction "
3727 & "No_Implicit_Heap_Allocation?", N, Comp);
3729 elsif Is_Record_Type (Etype (Comp)) then
3730 Check_Dynamic_Object (Etype (Comp));
3733 Next_Component (Comp);
3736 end Check_Dynamic_Object;
3738 -----------------------------------------
3739 -- Check_For_Null_Excluding_Components --
3740 -----------------------------------------
3742 procedure Check_For_Null_Excluding_Components
3743 (Obj_Typ : Entity_Id;
3746 procedure Check_Component
3747 (Comp_Typ : Entity_Id;
3748 Comp_Decl : Node_Id := Empty;
3749 Array_Comp : Boolean := False);
3750 -- Apply a compile-time null-exclusion check on a component denoted
3751 -- by its declaration Comp_Decl and type Comp_Typ, and all of its
3752 -- subcomponents (if any).
3754 ---------------------
3755 -- Check_Component --
3756 ---------------------
3758 procedure Check_Component
3759 (Comp_Typ : Entity_Id;
3760 Comp_Decl : Node_Id := Empty;
3761 Array_Comp : Boolean := False)
3767 -- Do not consider internally-generated components or those that
3768 -- are already initialized.
3770 if Present (Comp_Decl)
3771 and then (not Comes_From_Source (Comp_Decl)
3772 or else Present (Expression (Comp_Decl)))
3777 if Is_Incomplete_Or_Private_Type (Comp_Typ)
3778 and then Present (Full_View (Comp_Typ))
3780 T := Full_View (Comp_Typ);
3785 -- Verify a component of a null-excluding access type
3787 if Is_Access_Type (T)
3788 and then Can_Never_Be_Null (T)
3790 if Comp_Decl = Obj_Decl then
3791 Null_Exclusion_Static_Checks
3794 Array_Comp => Array_Comp);
3797 Null_Exclusion_Static_Checks
3800 Array_Comp => Array_Comp);
3803 -- Check array components
3805 elsif Is_Array_Type (T) then
3807 -- There is no suitable component when the object is of an
3808 -- array type. However, a namable component may appear at some
3809 -- point during the recursive inspection, but not at the top
3810 -- level. At the top level just indicate array component case.
3812 if Comp_Decl = Obj_Decl then
3813 Check_Component (Component_Type (T), Array_Comp => True);
3815 Check_Component (Component_Type (T), Comp_Decl);
3818 -- Verify all components of type T
3820 -- Note: No checks are performed on types with discriminants due
3821 -- to complexities involving variants. ???
3823 elsif (Is_Concurrent_Type (T)
3824 or else Is_Incomplete_Or_Private_Type (T)
3825 or else Is_Record_Type (T))
3826 and then not Has_Discriminants (T)
3828 Comp := First_Component (T);
3829 while Present (Comp) loop
3830 Check_Component (Etype (Comp), Parent (Comp));
3832 Comp := Next_Component (Comp);
3835 end Check_Component;
3837 -- Start processing for Check_For_Null_Excluding_Components
3840 Check_Component (Obj_Typ, Obj_Decl);
3841 end Check_For_Null_Excluding_Components;
3847 function Count_Tasks (T : Entity_Id) return Uint is
3853 if Is_Task_Type (T) then
3856 elsif Is_Record_Type (T) then
3857 if Has_Discriminants (T) then
3858 Check_Restriction (Max_Tasks, N);
3863 C := First_Component (T);
3864 while Present (C) loop
3865 V := V + Count_Tasks (Etype (C));
3872 elsif Is_Array_Type (T) then
3873 X := First_Index (T);
3874 V := Count_Tasks (Component_Type (T));
3875 while Present (X) loop
3878 if not Is_OK_Static_Subtype (C) then
3879 Check_Restriction (Max_Tasks, N);
3882 V := V * (UI_Max (Uint_0,
3883 Expr_Value (Type_High_Bound (C)) -
3884 Expr_Value (Type_Low_Bound (C)) + Uint_1));
3897 ----------------------------
3898 -- Delayed_Aspect_Present --
3899 ----------------------------
3901 function Delayed_Aspect_Present return Boolean is
3906 if Present (Aspect_Specifications (N)) then
3907 A := First (Aspect_Specifications (N));
3908 A_Id := Get_Aspect_Id (Chars (Identifier (A)));
3909 while Present (A) loop
3910 if A_Id = Aspect_Alignment or else A_Id = Aspect_Address then
3919 end Delayed_Aspect_Present;
3923 Saved_GM : constant Ghost_Mode_Type := Ghost_Mode;
3924 Saved_IGR : constant Node_Id := Ignored_Ghost_Region;
3925 -- Save the Ghost-related attributes to restore on exit
3927 Related_Id : Entity_Id;
3929 -- Start of processing for Analyze_Object_Declaration
3932 -- There are three kinds of implicit types generated by an
3933 -- object declaration:
3935 -- 1. Those generated by the original Object Definition
3937 -- 2. Those generated by the Expression
3939 -- 3. Those used to constrain the Object Definition with the
3940 -- expression constraints when the definition is unconstrained.
3942 -- They must be generated in this order to avoid order of elaboration
3943 -- issues. Thus the first step (after entering the name) is to analyze
3944 -- the object definition.
3946 if Constant_Present (N) then
3947 Prev_Entity := Current_Entity_In_Scope (Id);
3949 if Present (Prev_Entity)
3951 -- If the homograph is an implicit subprogram, it is overridden
3952 -- by the current declaration.
3954 ((Is_Overloadable (Prev_Entity)
3955 and then Is_Inherited_Operation (Prev_Entity))
3957 -- The current object is a discriminal generated for an entry
3958 -- family index. Even though the index is a constant, in this
3959 -- particular context there is no true constant redeclaration.
3960 -- Enter_Name will handle the visibility.
3963 (Is_Discriminal (Id)
3964 and then Ekind (Discriminal_Link (Id)) =
3965 E_Entry_Index_Parameter)
3967 -- The current object is the renaming for a generic declared
3968 -- within the instance.
3971 (Ekind (Prev_Entity) = E_Package
3972 and then Nkind (Parent (Prev_Entity)) =
3973 N_Package_Renaming_Declaration
3974 and then not Comes_From_Source (Prev_Entity)
3976 Is_Generic_Instance (Renamed_Entity (Prev_Entity)))
3978 -- The entity may be a homonym of a private component of the
3979 -- enclosing protected object, for which we create a local
3980 -- renaming declaration. The declaration is legal, even if
3981 -- useless when it just captures that component.
3984 (Ekind (Scope (Current_Scope)) = E_Protected_Type
3985 and then Nkind (Parent (Prev_Entity)) =
3986 N_Object_Renaming_Declaration))
3988 Prev_Entity := Empty;
3992 if Present (Prev_Entity) then
3994 -- The object declaration is Ghost when it completes a deferred Ghost
3997 Mark_And_Set_Ghost_Completion (N, Prev_Entity);
3999 Constant_Redeclaration (Id, N, T);
4001 Generate_Reference (Prev_Entity, Id, 'c');
4002 Set_Completion_Referenced (Id);
4004 if Error_Posted (N) then
4006 -- Type mismatch or illegal redeclaration; do not analyze
4007 -- expression to avoid cascaded errors.
4009 T := Find_Type_Of_Object (Object_Definition (N), N);
4011 Set_Ekind (Id, E_Variable);
4015 -- In the normal case, enter identifier at the start to catch premature
4016 -- usage in the initialization expression.
4019 Generate_Definition (Id);
4022 Mark_Coextensions (N, Object_Definition (N));
4024 T := Find_Type_Of_Object (Object_Definition (N), N);
4026 if Nkind (Object_Definition (N)) = N_Access_Definition
4028 (Access_To_Subprogram_Definition (Object_Definition (N)))
4029 and then Protected_Present
4030 (Access_To_Subprogram_Definition (Object_Definition (N)))
4032 T := Replace_Anonymous_Access_To_Protected_Subprogram (N);
4035 if Error_Posted (Id) then
4037 Set_Ekind (Id, E_Variable);
4042 -- Ada 2005 (AI-231): Propagate the null-excluding attribute and carry
4043 -- out some static checks.
4045 if Ada_Version >= Ada_2005 then
4047 -- In case of aggregates we must also take care of the correct
4048 -- initialization of nested aggregates bug this is done at the
4049 -- point of the analysis of the aggregate (see sem_aggr.adb) ???
4051 if Can_Never_Be_Null (T) then
4052 if Present (Expression (N))
4053 and then Nkind (Expression (N)) = N_Aggregate
4059 Save_Typ : constant Entity_Id := Etype (Id);
4061 Set_Etype (Id, T); -- Temp. decoration for static checks
4062 Null_Exclusion_Static_Checks (N);
4063 Set_Etype (Id, Save_Typ);
4067 -- We might be dealing with an object of a composite type containing
4068 -- null-excluding components without an aggregate, so we must verify
4069 -- that such components have default initialization.
4072 Check_For_Null_Excluding_Components (T, N);
4076 -- Object is marked pure if it is in a pure scope
4078 Set_Is_Pure (Id, Is_Pure (Current_Scope));
4080 -- If deferred constant, make sure context is appropriate. We detect
4081 -- a deferred constant as a constant declaration with no expression.
4082 -- A deferred constant can appear in a package body if its completion
4083 -- is by means of an interface pragma.
4085 if Constant_Present (N) and then No (E) then
4087 -- A deferred constant may appear in the declarative part of the
4088 -- following constructs:
4092 -- extended return statements
4095 -- subprogram bodies
4098 -- When declared inside a package spec, a deferred constant must be
4099 -- completed by a full constant declaration or pragma Import. In all
4100 -- other cases, the only proper completion is pragma Import. Extended
4101 -- return statements are flagged as invalid contexts because they do
4102 -- not have a declarative part and so cannot accommodate the pragma.
4104 if Ekind (Current_Scope) = E_Return_Statement then
4106 ("invalid context for deferred constant declaration (RM 7.4)",
4109 ("\declaration requires an initialization expression",
4111 Set_Constant_Present (N, False);
4113 -- In Ada 83, deferred constant must be of private type
4115 elsif not Is_Private_Type (T) then
4116 if Ada_Version = Ada_83 and then Comes_From_Source (N) then
4118 ("(Ada 83) deferred constant must be private type", N);
4122 -- If not a deferred constant, then the object declaration freezes
4123 -- its type, unless the object is of an anonymous type and has delayed
4124 -- aspects. In that case the type is frozen when the object itself is.
4127 Check_Fully_Declared (T, N);
4129 if Has_Delayed_Aspects (Id)
4130 and then Is_Array_Type (T)
4131 and then Is_Itype (T)
4133 Set_Has_Delayed_Freeze (T);
4135 Freeze_Before (N, T);
4139 -- If the object was created by a constrained array definition, then
4140 -- set the link in both the anonymous base type and anonymous subtype
4141 -- that are built to represent the array type to point to the object.
4143 if Nkind (Object_Definition (Declaration_Node (Id))) =
4144 N_Constrained_Array_Definition
4146 Set_Related_Array_Object (T, Id);
4147 Set_Related_Array_Object (Base_Type (T), Id);
4150 -- Special checks for protected objects not at library level
4152 if Has_Protected (T) and then not Is_Library_Level_Entity (Id) then
4153 Check_Restriction (No_Local_Protected_Objects, Id);
4155 -- Protected objects with interrupt handlers must be at library level
4157 -- Ada 2005: This test is not needed (and the corresponding clause
4158 -- in the RM is removed) because accessibility checks are sufficient
4159 -- to make handlers not at the library level illegal.
4161 -- AI05-0303: The AI is in fact a binding interpretation, and thus
4162 -- applies to the '95 version of the language as well.
4164 if Is_Protected_Type (T)
4165 and then Has_Interrupt_Handler (T)
4166 and then Ada_Version < Ada_95
4169 ("interrupt object can only be declared at library level", Id);
4173 -- Check for violation of No_Local_Timing_Events
4175 if Has_Timing_Event (T) and then not Is_Library_Level_Entity (Id) then
4176 Check_Restriction (No_Local_Timing_Events, Id);
4179 -- The actual subtype of the object is the nominal subtype, unless
4180 -- the nominal one is unconstrained and obtained from the expression.
4184 -- These checks should be performed before the initialization expression
4185 -- is considered, so that the Object_Definition node is still the same
4186 -- as in source code.
4188 -- In SPARK, the nominal subtype is always given by a subtype mark
4189 -- and must not be unconstrained. (The only exception to this is the
4190 -- acceptance of declarations of constants of type String.)
4192 if not Nkind_In (Object_Definition (N), N_Expanded_Name, N_Identifier)
4194 Check_SPARK_05_Restriction
4195 ("subtype mark required", Object_Definition (N));
4197 elsif Is_Array_Type (T)
4198 and then not Is_Constrained (T)
4199 and then T /= Standard_String
4201 Check_SPARK_05_Restriction
4202 ("subtype mark of constrained type expected",
4203 Object_Definition (N));
4206 if Is_Library_Level_Entity (Id) then
4207 Check_Dynamic_Object (T);
4210 -- There are no aliased objects in SPARK
4212 if Aliased_Present (N) then
4213 Check_SPARK_05_Restriction ("aliased object is not allowed", N);
4216 -- Process initialization expression if present and not in error
4218 if Present (E) and then E /= Error then
4220 -- Generate an error in case of CPP class-wide object initialization.
4221 -- Required because otherwise the expansion of the class-wide
4222 -- assignment would try to use 'size to initialize the object
4223 -- (primitive that is not available in CPP tagged types).
4225 if Is_Class_Wide_Type (Act_T)
4227 (Is_CPP_Class (Root_Type (Etype (Act_T)))
4229 (Present (Full_View (Root_Type (Etype (Act_T))))
4231 Is_CPP_Class (Full_View (Root_Type (Etype (Act_T))))))
4234 ("predefined assignment not available for 'C'P'P tagged types",
4238 Mark_Coextensions (N, E);
4241 -- In case of errors detected in the analysis of the expression,
4242 -- decorate it with the expected type to avoid cascaded errors
4244 if No (Etype (E)) then
4248 -- If an initialization expression is present, then we set the
4249 -- Is_True_Constant flag. It will be reset if this is a variable
4250 -- and it is indeed modified.
4252 Set_Is_True_Constant (Id, True);
4254 -- If we are analyzing a constant declaration, set its completion
4255 -- flag after analyzing and resolving the expression.
4257 if Constant_Present (N) then
4258 Set_Has_Completion (Id);
4261 -- Set type and resolve (type may be overridden later on). Note:
4262 -- Ekind (Id) must still be E_Void at this point so that incorrect
4263 -- early usage within E is properly diagnosed.
4267 -- If the expression is an aggregate we must look ahead to detect
4268 -- the possible presence of an address clause, and defer resolution
4269 -- and expansion of the aggregate to the freeze point of the entity.
4271 -- This is not always legal because the aggregate may contain other
4272 -- references that need freezing, e.g. references to other entities
4273 -- with address clauses. In any case, when compiling with -gnatI the
4274 -- presence of the address clause must be ignored.
4276 if Comes_From_Source (N)
4277 and then Expander_Active
4278 and then Nkind (E) = N_Aggregate
4280 ((Present (Following_Address_Clause (N))
4281 and then not Ignore_Rep_Clauses)
4282 or else Delayed_Aspect_Present)
4286 -- If the aggregate is limited it will be built in place, and its
4287 -- expansion is deferred until the object declaration is expanded.
4289 if Is_Limited_Type (T) then
4290 Set_Expansion_Delayed (E);
4294 -- If the expression is a formal that is a "subprogram pointer"
4295 -- this is illegal in accessibility terms (see RM 3.10.2 (13.1/2)
4296 -- and AARM 3.10.2 (13.b/2)). Add an explicit conversion to force
4297 -- the corresponding check, as is done for assignments.
4299 if Is_Entity_Name (E)
4300 and then Present (Entity (E))
4301 and then Is_Formal (Entity (E))
4303 Ekind (Etype (Entity (E))) = E_Anonymous_Access_Subprogram_Type
4304 and then Ekind (T) /= E_Anonymous_Access_Subprogram_Type
4306 Rewrite (E, Convert_To (T, Relocate_Node (E)));
4312 -- No further action needed if E is a call to an inlined function
4313 -- which returns an unconstrained type and it has been expanded into
4314 -- a procedure call. In that case N has been replaced by an object
4315 -- declaration without initializing expression and it has been
4316 -- analyzed (see Expand_Inlined_Call).
4318 if Back_End_Inlining
4319 and then Expander_Active
4320 and then Nkind (E) = N_Function_Call
4321 and then Nkind (Name (E)) in N_Has_Entity
4322 and then Is_Inlined (Entity (Name (E)))
4323 and then not Is_Constrained (Etype (E))
4324 and then Analyzed (N)
4325 and then No (Expression (N))
4330 -- If E is null and has been replaced by an N_Raise_Constraint_Error
4331 -- node (which was marked already-analyzed), we need to set the type
4332 -- to something other than Any_Access in order to keep gigi happy.
4334 if Etype (E) = Any_Access then
4338 -- If the object is an access to variable, the initialization
4339 -- expression cannot be an access to constant.
4341 if Is_Access_Type (T)
4342 and then not Is_Access_Constant (T)
4343 and then Is_Access_Type (Etype (E))
4344 and then Is_Access_Constant (Etype (E))
4347 ("access to variable cannot be initialized with an "
4348 & "access-to-constant expression", E);
4351 if not Assignment_OK (N) then
4352 Check_Initialization (T, E);
4355 Check_Unset_Reference (E);
4357 -- If this is a variable, then set current value. If this is a
4358 -- declared constant of a scalar type with a static expression,
4359 -- indicate that it is always valid.
4361 if not Constant_Present (N) then
4362 if Compile_Time_Known_Value (E) then
4363 Set_Current_Value (Id, E);
4366 elsif Is_Scalar_Type (T) and then Is_OK_Static_Expression (E) then
4367 Set_Is_Known_Valid (Id);
4369 -- If it is a constant initialized with a valid nonstatic entity,
4370 -- the constant is known valid as well, and can inherit the subtype
4371 -- of the entity if it is a subtype of the given type. This info
4372 -- is preserved on the actual subtype of the constant.
4374 elsif Is_Scalar_Type (T)
4375 and then Is_Entity_Name (E)
4376 and then Is_Known_Valid (Entity (E))
4377 and then In_Subrange_Of (Etype (Entity (E)), T)
4379 Set_Is_Known_Valid (Id);
4380 Set_Ekind (Id, E_Constant);
4381 Set_Actual_Subtype (Id, Etype (Entity (E)));
4384 -- Deal with setting of null flags
4386 if Is_Access_Type (T) then
4387 if Known_Non_Null (E) then
4388 Set_Is_Known_Non_Null (Id, True);
4389 elsif Known_Null (E) and then not Can_Never_Be_Null (Id) then
4390 Set_Is_Known_Null (Id, True);
4394 -- Check incorrect use of dynamically tagged expressions
4396 if Is_Tagged_Type (T) then
4397 Check_Dynamically_Tagged_Expression
4403 Apply_Scalar_Range_Check (E, T);
4404 Apply_Static_Length_Check (E, T);
4406 if Nkind (Original_Node (N)) = N_Object_Declaration
4407 and then Comes_From_Source (Original_Node (N))
4409 -- Only call test if needed
4411 and then Restriction_Check_Required (SPARK_05)
4412 and then not Is_SPARK_05_Initialization_Expr (Original_Node (E))
4414 Check_SPARK_05_Restriction
4415 ("initialization expression is not appropriate", E);
4418 -- A formal parameter of a specific tagged type whose related
4419 -- subprogram is subject to pragma Extensions_Visible with value
4420 -- "False" cannot be implicitly converted to a class-wide type by
4421 -- means of an initialization expression (SPARK RM 6.1.7(3)). Do
4422 -- not consider internally generated expressions.
4424 if Is_Class_Wide_Type (T)
4425 and then Comes_From_Source (E)
4426 and then Is_EVF_Expression (E)
4429 ("formal parameter cannot be implicitly converted to "
4430 & "class-wide type when Extensions_Visible is False", E);
4434 -- If the No_Streams restriction is set, check that the type of the
4435 -- object is not, and does not contain, any subtype derived from
4436 -- Ada.Streams.Root_Stream_Type. Note that we guard the call to
4437 -- Has_Stream just for efficiency reasons. There is no point in
4438 -- spending time on a Has_Stream check if the restriction is not set.
4440 if Restriction_Check_Required (No_Streams) then
4441 if Has_Stream (T) then
4442 Check_Restriction (No_Streams, N);
4446 -- Deal with predicate check before we start to do major rewriting. It
4447 -- is OK to initialize and then check the initialized value, since the
4448 -- object goes out of scope if we get a predicate failure. Note that we
4449 -- do this in the analyzer and not the expander because the analyzer
4450 -- does some substantial rewriting in some cases.
4452 -- We need a predicate check if the type has predicates that are not
4453 -- ignored, and if either there is an initializing expression, or for
4454 -- default initialization when we have at least one case of an explicit
4455 -- default initial value and then this is not an internal declaration
4456 -- whose initialization comes later (as for an aggregate expansion).
4458 if not Suppress_Assignment_Checks (N)
4459 and then Present (Predicate_Function (T))
4460 and then not Predicates_Ignored (T)
4461 and then not No_Initialization (N)
4465 Is_Partially_Initialized_Type (T, Include_Implicit => False))
4467 -- If the type has a static predicate and the expression is known at
4468 -- compile time, see if the expression satisfies the predicate.
4471 Check_Expression_Against_Static_Predicate (E, T);
4474 -- If the type is a null record and there is no explicit initial
4475 -- expression, no predicate check applies.
4477 if No (E) and then Is_Null_Record_Type (T) then
4480 -- Do not generate a predicate check if the initialization expression
4481 -- is a type conversion because the conversion has been subjected to
4482 -- the same check. This is a small optimization which avoid redundant
4485 elsif Present (E) and then Nkind (E) = N_Type_Conversion then
4490 Make_Predicate_Check (T, New_Occurrence_Of (Id, Loc)));
4494 -- Case of unconstrained type
4496 if not Is_Definite_Subtype (T) then
4498 -- In SPARK, a declaration of unconstrained type is allowed
4499 -- only for constants of type string.
4501 if Is_String_Type (T) and then not Constant_Present (N) then
4502 Check_SPARK_05_Restriction
4503 ("declaration of object of unconstrained type not allowed", N);
4506 -- Nothing to do in deferred constant case
4508 if Constant_Present (N) and then No (E) then
4511 -- Case of no initialization present
4514 if No_Initialization (N) then
4517 elsif Is_Class_Wide_Type (T) then
4519 ("initialization required in class-wide declaration ", N);
4523 ("unconstrained subtype not allowed (need initialization)",
4524 Object_Definition (N));
4526 if Is_Record_Type (T) and then Has_Discriminants (T) then
4528 ("\provide initial value or explicit discriminant values",
4529 Object_Definition (N));
4532 ("\or give default discriminant values for type&",
4533 Object_Definition (N), T);
4535 elsif Is_Array_Type (T) then
4537 ("\provide initial value or explicit array bounds",
4538 Object_Definition (N));
4542 -- Case of initialization present but in error. Set initial
4543 -- expression as absent (but do not make above complaints)
4545 elsif E = Error then
4546 Set_Expression (N, Empty);
4549 -- Case of initialization present
4552 -- Check restrictions in Ada 83
4554 if not Constant_Present (N) then
4556 -- Unconstrained variables not allowed in Ada 83 mode
4558 if Ada_Version = Ada_83
4559 and then Comes_From_Source (Object_Definition (N))
4562 ("(Ada 83) unconstrained variable not allowed",
4563 Object_Definition (N));
4567 -- Now we constrain the variable from the initializing expression
4569 -- If the expression is an aggregate, it has been expanded into
4570 -- individual assignments. Retrieve the actual type from the
4571 -- expanded construct.
4573 if Is_Array_Type (T)
4574 and then No_Initialization (N)
4575 and then Nkind (Original_Node (E)) = N_Aggregate
4579 -- In case of class-wide interface object declarations we delay
4580 -- the generation of the equivalent record type declarations until
4581 -- its expansion because there are cases in they are not required.
4583 elsif Is_Interface (T) then
4586 -- In GNATprove mode, Expand_Subtype_From_Expr does nothing. Thus,
4587 -- we should prevent the generation of another Itype with the
4588 -- same name as the one already generated, or we end up with
4589 -- two identical types in GNATprove.
4591 elsif GNATprove_Mode then
4594 -- If the type is an unchecked union, no subtype can be built from
4595 -- the expression. Rewrite declaration as a renaming, which the
4596 -- back-end can handle properly. This is a rather unusual case,
4597 -- because most unchecked_union declarations have default values
4598 -- for discriminants and are thus not indefinite.
4600 elsif Is_Unchecked_Union (T) then
4601 if Constant_Present (N) or else Nkind (E) = N_Function_Call then
4602 Set_Ekind (Id, E_Constant);
4604 Set_Ekind (Id, E_Variable);
4608 Make_Object_Renaming_Declaration (Loc,
4609 Defining_Identifier => Id,
4610 Subtype_Mark => New_Occurrence_Of (T, Loc),
4613 Set_Renamed_Object (Id, E);
4614 Freeze_Before (N, T);
4619 -- Ensure that the generated subtype has a unique external name
4620 -- when the related object is public. This guarantees that the
4621 -- subtype and its bounds will not be affected by switches or
4622 -- pragmas that may offset the internal counter due to extra
4625 if Is_Public (Id) then
4628 Related_Id := Empty;
4631 Expand_Subtype_From_Expr
4634 Subtype_Indic => Object_Definition (N),
4636 Related_Id => Related_Id);
4638 Act_T := Find_Type_Of_Object (Object_Definition (N), N);
4641 Set_Is_Constr_Subt_For_U_Nominal (Act_T);
4643 if Aliased_Present (N) then
4644 Set_Is_Constr_Subt_For_UN_Aliased (Act_T);
4647 Freeze_Before (N, Act_T);
4648 Freeze_Before (N, T);
4651 elsif Is_Array_Type (T)
4652 and then No_Initialization (N)
4653 and then (Nkind (Original_Node (E)) = N_Aggregate
4654 or else (Nkind (Original_Node (E)) = N_Qualified_Expression
4655 and then Nkind (Original_Node (Expression
4656 (Original_Node (E)))) = N_Aggregate))
4658 if not Is_Entity_Name (Object_Definition (N)) then
4660 Check_Compile_Time_Size (Act_T);
4662 if Aliased_Present (N) then
4663 Set_Is_Constr_Subt_For_UN_Aliased (Act_T);
4667 -- When the given object definition and the aggregate are specified
4668 -- independently, and their lengths might differ do a length check.
4669 -- This cannot happen if the aggregate is of the form (others =>...)
4671 if not Is_Constrained (T) then
4674 elsif Nkind (E) = N_Raise_Constraint_Error then
4676 -- Aggregate is statically illegal. Place back in declaration
4678 Set_Expression (N, E);
4679 Set_No_Initialization (N, False);
4681 elsif T = Etype (E) then
4684 elsif Nkind (E) = N_Aggregate
4685 and then Present (Component_Associations (E))
4686 and then Present (Choice_List (First (Component_Associations (E))))
4688 Nkind (First (Choice_List (First (Component_Associations (E))))) =
4694 Apply_Length_Check (E, T);
4697 -- If the type is limited unconstrained with defaulted discriminants and
4698 -- there is no expression, then the object is constrained by the
4699 -- defaults, so it is worthwhile building the corresponding subtype.
4701 elsif (Is_Limited_Record (T) or else Is_Concurrent_Type (T))
4702 and then not Is_Constrained (T)
4703 and then Has_Discriminants (T)
4706 Act_T := Build_Default_Subtype (T, N);
4708 -- Ada 2005: A limited object may be initialized by means of an
4709 -- aggregate. If the type has default discriminants it has an
4710 -- unconstrained nominal type, Its actual subtype will be obtained
4711 -- from the aggregate, and not from the default discriminants.
4716 Rewrite (Object_Definition (N), New_Occurrence_Of (Act_T, Loc));
4718 elsif Nkind (E) = N_Function_Call
4719 and then Constant_Present (N)
4720 and then Has_Unconstrained_Elements (Etype (E))
4722 -- The back-end has problems with constants of a discriminated type
4723 -- with defaults, if the initial value is a function call. We
4724 -- generate an intermediate temporary that will receive a reference
4725 -- to the result of the call. The initialization expression then
4726 -- becomes a dereference of that temporary.
4728 Remove_Side_Effects (E);
4730 -- If this is a constant declaration of an unconstrained type and
4731 -- the initialization is an aggregate, we can use the subtype of the
4732 -- aggregate for the declared entity because it is immutable.
4734 elsif not Is_Constrained (T)
4735 and then Has_Discriminants (T)
4736 and then Constant_Present (N)
4737 and then not Has_Unchecked_Union (T)
4738 and then Nkind (E) = N_Aggregate
4743 -- Check No_Wide_Characters restriction
4745 Check_Wide_Character_Restriction (T, Object_Definition (N));
4747 -- Indicate this is not set in source. Certainly true for constants, and
4748 -- true for variables so far (will be reset for a variable if and when
4749 -- we encounter a modification in the source).
4751 Set_Never_Set_In_Source (Id);
4753 -- Now establish the proper kind and type of the object
4755 if Constant_Present (N) then
4756 Set_Ekind (Id, E_Constant);
4757 Set_Is_True_Constant (Id);
4760 Set_Ekind (Id, E_Variable);
4762 -- A variable is set as shared passive if it appears in a shared
4763 -- passive package, and is at the outer level. This is not done for
4764 -- entities generated during expansion, because those are always
4765 -- manipulated locally.
4767 if Is_Shared_Passive (Current_Scope)
4768 and then Is_Library_Level_Entity (Id)
4769 and then Comes_From_Source (Id)
4771 Set_Is_Shared_Passive (Id);
4772 Check_Shared_Var (Id, T, N);
4775 -- Set Has_Initial_Value if initializing expression present. Note
4776 -- that if there is no initializing expression, we leave the state
4777 -- of this flag unchanged (usually it will be False, but notably in
4778 -- the case of exception choice variables, it will already be true).
4781 Set_Has_Initial_Value (Id);
4785 -- Set the SPARK mode from the current context (may be overwritten later
4786 -- with explicit pragma).
4788 Set_SPARK_Pragma (Id, SPARK_Mode_Pragma);
4789 Set_SPARK_Pragma_Inherited (Id);
4791 -- Preserve relevant elaboration-related attributes of the context which
4792 -- are no longer available or very expensive to recompute once analysis,
4793 -- resolution, and expansion are over.
4795 Mark_Elaboration_Attributes
4800 -- Initialize alignment and size and capture alignment setting
4802 Init_Alignment (Id);
4804 Set_Optimize_Alignment_Flags (Id);
4806 -- Deal with aliased case
4808 if Aliased_Present (N) then
4809 Set_Is_Aliased (Id);
4811 -- If the object is aliased and the type is unconstrained with
4812 -- defaulted discriminants and there is no expression, then the
4813 -- object is constrained by the defaults, so it is worthwhile
4814 -- building the corresponding subtype.
4816 -- Ada 2005 (AI-363): If the aliased object is discriminated and
4817 -- unconstrained, then only establish an actual subtype if the
4818 -- nominal subtype is indefinite. In definite cases the object is
4819 -- unconstrained in Ada 2005.
4822 and then Is_Record_Type (T)
4823 and then not Is_Constrained (T)
4824 and then Has_Discriminants (T)
4825 and then (Ada_Version < Ada_2005
4826 or else not Is_Definite_Subtype (T))
4828 Set_Actual_Subtype (Id, Build_Default_Subtype (T, N));
4832 -- Now we can set the type of the object
4834 Set_Etype (Id, Act_T);
4836 -- Non-constant object is marked to be treated as volatile if type is
4837 -- volatile and we clear the Current_Value setting that may have been
4838 -- set above. Doing so for constants isn't required and might interfere
4839 -- with possible uses of the object as a static expression in contexts
4840 -- incompatible with volatility (e.g. as a case-statement alternative).
4842 if Ekind (Id) /= E_Constant and then Treat_As_Volatile (Etype (Id)) then
4843 Set_Treat_As_Volatile (Id);
4844 Set_Current_Value (Id, Empty);
4847 -- Deal with controlled types
4849 if Has_Controlled_Component (Etype (Id))
4850 or else Is_Controlled (Etype (Id))
4852 if not Is_Library_Level_Entity (Id) then
4853 Check_Restriction (No_Nested_Finalization, N);
4855 Validate_Controlled_Object (Id);
4859 if Has_Task (Etype (Id)) then
4860 Check_Restriction (No_Tasking, N);
4862 -- Deal with counting max tasks
4864 -- Nothing to do if inside a generic
4866 if Inside_A_Generic then
4869 -- If library level entity, then count tasks
4871 elsif Is_Library_Level_Entity (Id) then
4872 Check_Restriction (Max_Tasks, N, Count_Tasks (Etype (Id)));
4874 -- If not library level entity, then indicate we don't know max
4875 -- tasks and also check task hierarchy restriction and blocking
4876 -- operation (since starting a task is definitely blocking).
4879 Check_Restriction (Max_Tasks, N);
4880 Check_Restriction (No_Task_Hierarchy, N);
4881 Check_Potentially_Blocking_Operation (N);
4884 -- A rather specialized test. If we see two tasks being declared
4885 -- of the same type in the same object declaration, and the task
4886 -- has an entry with an address clause, we know that program error
4887 -- will be raised at run time since we can't have two tasks with
4888 -- entries at the same address.
4890 if Is_Task_Type (Etype (Id)) and then More_Ids (N) then
4895 E := First_Entity (Etype (Id));
4896 while Present (E) loop
4897 if Ekind (E) = E_Entry
4898 and then Present (Get_Attribute_Definition_Clause
4899 (E, Attribute_Address))
4901 Error_Msg_Warn := SPARK_Mode /= On;
4903 ("more than one task with same entry address<<", N);
4904 Error_Msg_N ("\Program_Error [<<", N);
4906 Make_Raise_Program_Error (Loc,
4907 Reason => PE_Duplicated_Entry_Address));
4917 -- Some simple constant-propagation: if the expression is a constant
4918 -- string initialized with a literal, share the literal. This avoids
4922 and then Is_Entity_Name (E)
4923 and then Ekind (Entity (E)) = E_Constant
4924 and then Base_Type (Etype (E)) = Standard_String
4927 Val : constant Node_Id := Constant_Value (Entity (E));
4929 if Present (Val) and then Nkind (Val) = N_String_Literal then
4930 Rewrite (E, New_Copy (Val));
4935 -- Another optimization: if the nominal subtype is unconstrained and
4936 -- the expression is a function call that returns an unconstrained
4937 -- type, rewrite the declaration as a renaming of the result of the
4938 -- call. The exceptions below are cases where the copy is expected,
4939 -- either by the back end (Aliased case) or by the semantics, as for
4940 -- initializing controlled types or copying tags for class-wide types.
4943 and then Nkind (E) = N_Explicit_Dereference
4944 and then Nkind (Original_Node (E)) = N_Function_Call
4945 and then not Is_Library_Level_Entity (Id)
4946 and then not Is_Constrained (Underlying_Type (T))
4947 and then not Is_Aliased (Id)
4948 and then not Is_Class_Wide_Type (T)
4949 and then not Is_Controlled (T)
4950 and then not Has_Controlled_Component (Base_Type (T))
4951 and then Expander_Active
4954 Make_Object_Renaming_Declaration (Loc,
4955 Defining_Identifier => Id,
4956 Access_Definition => Empty,
4957 Subtype_Mark => New_Occurrence_Of
4958 (Base_Type (Etype (Id)), Loc),
4961 Set_Renamed_Object (Id, E);
4963 -- Force generation of debugging information for the constant and for
4964 -- the renamed function call.
4966 Set_Debug_Info_Needed (Id);
4967 Set_Debug_Info_Needed (Entity (Prefix (E)));
4970 if Present (Prev_Entity)
4971 and then Is_Frozen (Prev_Entity)
4972 and then not Error_Posted (Id)
4974 Error_Msg_N ("full constant declaration appears too late", N);
4977 Check_Eliminated (Id);
4979 -- Deal with setting In_Private_Part flag if in private part
4981 if Ekind (Scope (Id)) = E_Package
4982 and then In_Private_Part (Scope (Id))
4984 Set_In_Private_Part (Id);
4988 -- Initialize the refined state of a variable here because this is a
4989 -- common destination for legal and illegal object declarations.
4991 if Ekind (Id) = E_Variable then
4992 Set_Encapsulating_State (Id, Empty);
4995 if Has_Aspects (N) then
4996 Analyze_Aspect_Specifications (N, Id);
4999 Analyze_Dimension (N);
5001 -- Verify whether the object declaration introduces an illegal hidden
5002 -- state within a package subject to a null abstract state.
5004 if Ekind (Id) = E_Variable then
5005 Check_No_Hidden_State (Id);
5008 Restore_Ghost_Region (Saved_GM, Saved_IGR);
5009 end Analyze_Object_Declaration;
5011 ---------------------------
5012 -- Analyze_Others_Choice --
5013 ---------------------------
5015 -- Nothing to do for the others choice node itself, the semantic analysis
5016 -- of the others choice will occur as part of the processing of the parent
5018 procedure Analyze_Others_Choice (N : Node_Id) is
5019 pragma Warnings (Off, N);
5022 end Analyze_Others_Choice;
5024 -------------------------------------------
5025 -- Analyze_Private_Extension_Declaration --
5026 -------------------------------------------
5028 procedure Analyze_Private_Extension_Declaration (N : Node_Id) is
5029 Indic : constant Node_Id := Subtype_Indication (N);
5030 T : constant Entity_Id := Defining_Identifier (N);
5032 Iface_Elmt : Elmt_Id;
5033 Parent_Base : Entity_Id;
5034 Parent_Type : Entity_Id;
5037 -- Ada 2005 (AI-251): Decorate all names in list of ancestor interfaces
5039 if Is_Non_Empty_List (Interface_List (N)) then
5045 Intf := First (Interface_List (N));
5046 while Present (Intf) loop
5047 T := Find_Type_Of_Subtype_Indic (Intf);
5049 Diagnose_Interface (Intf, T);
5055 Generate_Definition (T);
5057 -- For other than Ada 2012, just enter the name in the current scope
5059 if Ada_Version < Ada_2012 then
5062 -- Ada 2012 (AI05-0162): Enter the name in the current scope handling
5063 -- case of private type that completes an incomplete type.
5070 Prev := Find_Type_Name (N);
5072 pragma Assert (Prev = T
5073 or else (Ekind (Prev) = E_Incomplete_Type
5074 and then Present (Full_View (Prev))
5075 and then Full_View (Prev) = T));
5079 Parent_Type := Find_Type_Of_Subtype_Indic (Indic);
5080 Parent_Base := Base_Type (Parent_Type);
5082 if Parent_Type = Any_Type or else Etype (Parent_Type) = Any_Type then
5083 Set_Ekind (T, Ekind (Parent_Type));
5084 Set_Etype (T, Any_Type);
5087 elsif not Is_Tagged_Type (Parent_Type) then
5089 ("parent of type extension must be a tagged type ", Indic);
5092 elsif Ekind_In (Parent_Type, E_Void, E_Incomplete_Type) then
5093 Error_Msg_N ("premature derivation of incomplete type", Indic);
5096 elsif Is_Concurrent_Type (Parent_Type) then
5098 ("parent type of a private extension cannot be a synchronized "
5099 & "tagged type (RM 3.9.1 (3/1))", N);
5101 Set_Etype (T, Any_Type);
5102 Set_Ekind (T, E_Limited_Private_Type);
5103 Set_Private_Dependents (T, New_Elmt_List);
5104 Set_Error_Posted (T);
5108 -- Perhaps the parent type should be changed to the class-wide type's
5109 -- specific type in this case to prevent cascading errors ???
5111 if Is_Class_Wide_Type (Parent_Type) then
5113 ("parent of type extension must not be a class-wide type", Indic);
5117 if (not Is_Package_Or_Generic_Package (Current_Scope)
5118 and then Nkind (Parent (N)) /= N_Generic_Subprogram_Declaration)
5119 or else In_Private_Part (Current_Scope)
5121 Error_Msg_N ("invalid context for private extension", N);
5124 -- Set common attributes
5126 Set_Is_Pure (T, Is_Pure (Current_Scope));
5127 Set_Scope (T, Current_Scope);
5128 Set_Ekind (T, E_Record_Type_With_Private);
5129 Init_Size_Align (T);
5130 Set_Default_SSO (T);
5131 Set_No_Reordering (T, No_Component_Reordering);
5133 Set_Etype (T, Parent_Base);
5134 Propagate_Concurrent_Flags (T, Parent_Base);
5136 Set_Convention (T, Convention (Parent_Type));
5137 Set_First_Rep_Item (T, First_Rep_Item (Parent_Type));
5138 Set_Is_First_Subtype (T);
5139 Make_Class_Wide_Type (T);
5141 -- Set the SPARK mode from the current context
5143 Set_SPARK_Pragma (T, SPARK_Mode_Pragma);
5144 Set_SPARK_Pragma_Inherited (T);
5146 if Unknown_Discriminants_Present (N) then
5147 Set_Discriminant_Constraint (T, No_Elist);
5150 Build_Derived_Record_Type (N, Parent_Type, T);
5152 -- A private extension inherits the Default_Initial_Condition pragma
5153 -- coming from any parent type within the derivation chain.
5155 if Has_DIC (Parent_Type) then
5156 Set_Has_Inherited_DIC (T);
5159 -- A private extension inherits any class-wide invariants coming from a
5160 -- parent type or an interface. Note that the invariant procedure of the
5161 -- parent type should not be inherited because the private extension may
5162 -- define invariants of its own.
5164 if Has_Inherited_Invariants (Parent_Type)
5165 or else Has_Inheritable_Invariants (Parent_Type)
5167 Set_Has_Inherited_Invariants (T);
5169 elsif Present (Interfaces (T)) then
5170 Iface_Elmt := First_Elmt (Interfaces (T));
5171 while Present (Iface_Elmt) loop
5172 Iface := Node (Iface_Elmt);
5174 if Has_Inheritable_Invariants (Iface) then
5175 Set_Has_Inherited_Invariants (T);
5179 Next_Elmt (Iface_Elmt);
5183 -- Ada 2005 (AI-443): Synchronized private extension or a rewritten
5184 -- synchronized formal derived type.
5186 if Ada_Version >= Ada_2005 and then Synchronized_Present (N) then
5187 Set_Is_Limited_Record (T);
5189 -- Formal derived type case
5191 if Is_Generic_Type (T) then
5193 -- The parent must be a tagged limited type or a synchronized
5196 if (not Is_Tagged_Type (Parent_Type)
5197 or else not Is_Limited_Type (Parent_Type))
5199 (not Is_Interface (Parent_Type)
5200 or else not Is_Synchronized_Interface (Parent_Type))
5203 ("parent type of & must be tagged limited or synchronized",
5207 -- The progenitors (if any) must be limited or synchronized
5210 if Present (Interfaces (T)) then
5211 Iface_Elmt := First_Elmt (Interfaces (T));
5212 while Present (Iface_Elmt) loop
5213 Iface := Node (Iface_Elmt);
5215 if not Is_Limited_Interface (Iface)
5216 and then not Is_Synchronized_Interface (Iface)
5219 ("progenitor & must be limited or synchronized",
5223 Next_Elmt (Iface_Elmt);
5227 -- Regular derived extension, the parent must be a limited or
5228 -- synchronized interface.
5231 if not Is_Interface (Parent_Type)
5232 or else (not Is_Limited_Interface (Parent_Type)
5233 and then not Is_Synchronized_Interface (Parent_Type))
5236 ("parent type of & must be limited interface", N, T);
5240 -- A consequence of 3.9.4 (6/2) and 7.3 (7.2/2) is that a private
5241 -- extension with a synchronized parent must be explicitly declared
5242 -- synchronized, because the full view will be a synchronized type.
5243 -- This must be checked before the check for limited types below,
5244 -- to ensure that types declared limited are not allowed to extend
5245 -- synchronized interfaces.
5247 elsif Is_Interface (Parent_Type)
5248 and then Is_Synchronized_Interface (Parent_Type)
5249 and then not Synchronized_Present (N)
5252 ("private extension of& must be explicitly synchronized",
5255 elsif Limited_Present (N) then
5256 Set_Is_Limited_Record (T);
5258 if not Is_Limited_Type (Parent_Type)
5260 (not Is_Interface (Parent_Type)
5261 or else not Is_Limited_Interface (Parent_Type))
5263 Error_Msg_NE ("parent type& of limited extension must be limited",
5268 -- Remember that its parent type has a private extension. Used to warn
5269 -- on public primitives of the parent type defined after its private
5270 -- extensions (see Check_Dispatching_Operation).
5272 Set_Has_Private_Extension (Parent_Type);
5275 if Has_Aspects (N) then
5276 Analyze_Aspect_Specifications (N, T);
5278 end Analyze_Private_Extension_Declaration;
5280 ---------------------------------
5281 -- Analyze_Subtype_Declaration --
5282 ---------------------------------
5284 procedure Analyze_Subtype_Declaration
5286 Skip : Boolean := False)
5288 Id : constant Entity_Id := Defining_Identifier (N);
5289 R_Checks : Check_Result;
5293 Generate_Definition (Id);
5294 Set_Is_Pure (Id, Is_Pure (Current_Scope));
5295 Init_Size_Align (Id);
5297 -- The following guard condition on Enter_Name is to handle cases where
5298 -- the defining identifier has already been entered into the scope but
5299 -- the declaration as a whole needs to be analyzed.
5301 -- This case in particular happens for derived enumeration types. The
5302 -- derived enumeration type is processed as an inserted enumeration type
5303 -- declaration followed by a rewritten subtype declaration. The defining
5304 -- identifier, however, is entered into the name scope very early in the
5305 -- processing of the original type declaration and therefore needs to be
5306 -- avoided here, when the created subtype declaration is analyzed. (See
5307 -- Build_Derived_Types)
5309 -- This also happens when the full view of a private type is derived
5310 -- type with constraints. In this case the entity has been introduced
5311 -- in the private declaration.
5313 -- Finally this happens in some complex cases when validity checks are
5314 -- enabled, where the same subtype declaration may be analyzed twice.
5315 -- This can happen if the subtype is created by the preanalysis of
5316 -- an attribute tht gives the range of a loop statement, and the loop
5317 -- itself appears within an if_statement that will be rewritten during
5321 or else (Present (Etype (Id))
5322 and then (Is_Private_Type (Etype (Id))
5323 or else Is_Task_Type (Etype (Id))
5324 or else Is_Rewrite_Substitution (N)))
5328 elsif Current_Entity (Id) = Id then
5335 T := Process_Subtype (Subtype_Indication (N), N, Id, 'P');
5337 -- Class-wide equivalent types of records with unknown discriminants
5338 -- involve the generation of an itype which serves as the private view
5339 -- of a constrained record subtype. In such cases the base type of the
5340 -- current subtype we are processing is the private itype. Use the full
5341 -- of the private itype when decorating various attributes.
5344 and then Is_Private_Type (T)
5345 and then Present (Full_View (T))
5350 -- Inherit common attributes
5352 Set_Is_Volatile (Id, Is_Volatile (T));
5353 Set_Treat_As_Volatile (Id, Treat_As_Volatile (T));
5354 Set_Is_Generic_Type (Id, Is_Generic_Type (Base_Type (T)));
5355 Set_Convention (Id, Convention (T));
5357 -- If ancestor has predicates then so does the subtype, and in addition
5358 -- we must delay the freeze to properly arrange predicate inheritance.
5360 -- The Ancestor_Type test is really unpleasant, there seem to be cases
5361 -- in which T = ID, so the above tests and assignments do nothing???
5363 if Has_Predicates (T)
5364 or else (Present (Ancestor_Subtype (T))
5365 and then Has_Predicates (Ancestor_Subtype (T)))
5367 Set_Has_Predicates (Id);
5368 Set_Has_Delayed_Freeze (Id);
5370 -- Generated subtypes inherit the predicate function from the parent
5371 -- (no aspects to examine on the generated declaration).
5373 if not Comes_From_Source (N) then
5374 Set_Ekind (Id, Ekind (T));
5376 if Present (Predicate_Function (Id)) then
5379 elsif Present (Predicate_Function (T)) then
5380 Set_Predicate_Function (Id, Predicate_Function (T));
5382 elsif Present (Ancestor_Subtype (T))
5383 and then Present (Predicate_Function (Ancestor_Subtype (T)))
5385 Set_Predicate_Function (Id,
5386 Predicate_Function (Ancestor_Subtype (T)));
5391 -- Subtype of Boolean cannot have a constraint in SPARK
5393 if Is_Boolean_Type (T)
5394 and then Nkind (Subtype_Indication (N)) = N_Subtype_Indication
5396 Check_SPARK_05_Restriction
5397 ("subtype of Boolean cannot have constraint", N);
5400 if Nkind (Subtype_Indication (N)) = N_Subtype_Indication then
5402 Cstr : constant Node_Id := Constraint (Subtype_Indication (N));
5408 if Nkind (Cstr) = N_Index_Or_Discriminant_Constraint then
5409 One_Cstr := First (Constraints (Cstr));
5410 while Present (One_Cstr) loop
5412 -- Index or discriminant constraint in SPARK must be a
5416 Nkind_In (One_Cstr, N_Identifier, N_Expanded_Name)
5418 Check_SPARK_05_Restriction
5419 ("subtype mark required", One_Cstr);
5421 -- String subtype must have a lower bound of 1 in SPARK.
5422 -- Note that we do not need to test for the nonstatic case
5423 -- here, since that was already taken care of in
5424 -- Process_Range_Expr_In_Decl.
5426 elsif Base_Type (T) = Standard_String then
5427 Get_Index_Bounds (One_Cstr, Low, High);
5429 if Is_OK_Static_Expression (Low)
5430 and then Expr_Value (Low) /= 1
5432 Check_SPARK_05_Restriction
5433 ("String subtype must have lower bound of 1", N);
5443 -- In the case where there is no constraint given in the subtype
5444 -- indication, Process_Subtype just returns the Subtype_Mark, so its
5445 -- semantic attributes must be established here.
5447 if Nkind (Subtype_Indication (N)) /= N_Subtype_Indication then
5448 Set_Etype (Id, Base_Type (T));
5450 -- Subtype of unconstrained array without constraint is not allowed
5453 if Is_Array_Type (T) and then not Is_Constrained (T) then
5454 Check_SPARK_05_Restriction
5455 ("subtype of unconstrained array must have constraint", N);
5460 Set_Ekind (Id, E_Array_Subtype);
5461 Copy_Array_Subtype_Attributes (Id, T);
5463 when Decimal_Fixed_Point_Kind =>
5464 Set_Ekind (Id, E_Decimal_Fixed_Point_Subtype);
5465 Set_Digits_Value (Id, Digits_Value (T));
5466 Set_Delta_Value (Id, Delta_Value (T));
5467 Set_Scale_Value (Id, Scale_Value (T));
5468 Set_Small_Value (Id, Small_Value (T));
5469 Set_Scalar_Range (Id, Scalar_Range (T));
5470 Set_Machine_Radix_10 (Id, Machine_Radix_10 (T));
5471 Set_Is_Constrained (Id, Is_Constrained (T));
5472 Set_Is_Known_Valid (Id, Is_Known_Valid (T));
5473 Set_RM_Size (Id, RM_Size (T));
5475 when Enumeration_Kind =>
5476 Set_Ekind (Id, E_Enumeration_Subtype);
5477 Set_First_Literal (Id, First_Literal (Base_Type (T)));
5478 Set_Scalar_Range (Id, Scalar_Range (T));
5479 Set_Is_Character_Type (Id, Is_Character_Type (T));
5480 Set_Is_Constrained (Id, Is_Constrained (T));
5481 Set_Is_Known_Valid (Id, Is_Known_Valid (T));
5482 Set_RM_Size (Id, RM_Size (T));
5484 when Ordinary_Fixed_Point_Kind =>
5485 Set_Ekind (Id, E_Ordinary_Fixed_Point_Subtype);
5486 Set_Scalar_Range (Id, Scalar_Range (T));
5487 Set_Small_Value (Id, Small_Value (T));
5488 Set_Delta_Value (Id, Delta_Value (T));
5489 Set_Is_Constrained (Id, Is_Constrained (T));
5490 Set_Is_Known_Valid (Id, Is_Known_Valid (T));
5491 Set_RM_Size (Id, RM_Size (T));
5494 Set_Ekind (Id, E_Floating_Point_Subtype);
5495 Set_Scalar_Range (Id, Scalar_Range (T));
5496 Set_Digits_Value (Id, Digits_Value (T));
5497 Set_Is_Constrained (Id, Is_Constrained (T));
5499 -- If the floating point type has dimensions, these will be
5500 -- inherited subsequently when Analyze_Dimensions is called.
5502 when Signed_Integer_Kind =>
5503 Set_Ekind (Id, E_Signed_Integer_Subtype);
5504 Set_Scalar_Range (Id, Scalar_Range (T));
5505 Set_Is_Constrained (Id, Is_Constrained (T));
5506 Set_Is_Known_Valid (Id, Is_Known_Valid (T));
5507 Set_RM_Size (Id, RM_Size (T));
5509 when Modular_Integer_Kind =>
5510 Set_Ekind (Id, E_Modular_Integer_Subtype);
5511 Set_Scalar_Range (Id, Scalar_Range (T));
5512 Set_Is_Constrained (Id, Is_Constrained (T));
5513 Set_Is_Known_Valid (Id, Is_Known_Valid (T));
5514 Set_RM_Size (Id, RM_Size (T));
5516 when Class_Wide_Kind =>
5517 Set_Ekind (Id, E_Class_Wide_Subtype);
5518 Set_Class_Wide_Type (Id, Class_Wide_Type (T));
5519 Set_Cloned_Subtype (Id, T);
5520 Set_Is_Tagged_Type (Id, True);
5521 Set_Has_Unknown_Discriminants
5523 Set_No_Tagged_Streams_Pragma
5524 (Id, No_Tagged_Streams_Pragma (T));
5526 if Ekind (T) = E_Class_Wide_Subtype then
5527 Set_Equivalent_Type (Id, Equivalent_Type (T));
5530 when E_Record_Subtype
5533 Set_Ekind (Id, E_Record_Subtype);
5535 if Ekind (T) = E_Record_Subtype
5536 and then Present (Cloned_Subtype (T))
5538 Set_Cloned_Subtype (Id, Cloned_Subtype (T));
5540 Set_Cloned_Subtype (Id, T);
5543 Set_First_Entity (Id, First_Entity (T));
5544 Set_Last_Entity (Id, Last_Entity (T));
5545 Set_Has_Discriminants (Id, Has_Discriminants (T));
5546 Set_Is_Constrained (Id, Is_Constrained (T));
5547 Set_Is_Limited_Record (Id, Is_Limited_Record (T));
5548 Set_Has_Implicit_Dereference
5549 (Id, Has_Implicit_Dereference (T));
5550 Set_Has_Unknown_Discriminants
5551 (Id, Has_Unknown_Discriminants (T));
5553 if Has_Discriminants (T) then
5554 Set_Discriminant_Constraint
5555 (Id, Discriminant_Constraint (T));
5556 Set_Stored_Constraint_From_Discriminant_Constraint (Id);
5558 elsif Has_Unknown_Discriminants (Id) then
5559 Set_Discriminant_Constraint (Id, No_Elist);
5562 if Is_Tagged_Type (T) then
5563 Set_Is_Tagged_Type (Id, True);
5564 Set_No_Tagged_Streams_Pragma
5565 (Id, No_Tagged_Streams_Pragma (T));
5566 Set_Is_Abstract_Type (Id, Is_Abstract_Type (T));
5567 Set_Direct_Primitive_Operations
5568 (Id, Direct_Primitive_Operations (T));
5569 Set_Class_Wide_Type (Id, Class_Wide_Type (T));
5571 if Is_Interface (T) then
5572 Set_Is_Interface (Id);
5573 Set_Is_Limited_Interface (Id, Is_Limited_Interface (T));
5577 when Private_Kind =>
5578 Set_Ekind (Id, Subtype_Kind (Ekind (T)));
5579 Set_Has_Discriminants (Id, Has_Discriminants (T));
5580 Set_Is_Constrained (Id, Is_Constrained (T));
5581 Set_First_Entity (Id, First_Entity (T));
5582 Set_Last_Entity (Id, Last_Entity (T));
5583 Set_Private_Dependents (Id, New_Elmt_List);
5584 Set_Is_Limited_Record (Id, Is_Limited_Record (T));
5585 Set_Has_Implicit_Dereference
5586 (Id, Has_Implicit_Dereference (T));
5587 Set_Has_Unknown_Discriminants
5588 (Id, Has_Unknown_Discriminants (T));
5589 Set_Known_To_Have_Preelab_Init
5590 (Id, Known_To_Have_Preelab_Init (T));
5592 if Is_Tagged_Type (T) then
5593 Set_Is_Tagged_Type (Id);
5594 Set_No_Tagged_Streams_Pragma (Id,
5595 No_Tagged_Streams_Pragma (T));
5596 Set_Is_Abstract_Type (Id, Is_Abstract_Type (T));
5597 Set_Class_Wide_Type (Id, Class_Wide_Type (T));
5598 Set_Direct_Primitive_Operations (Id,
5599 Direct_Primitive_Operations (T));
5602 -- In general the attributes of the subtype of a private type
5603 -- are the attributes of the partial view of parent. However,
5604 -- the full view may be a discriminated type, and the subtype
5605 -- must share the discriminant constraint to generate correct
5606 -- calls to initialization procedures.
5608 if Has_Discriminants (T) then
5609 Set_Discriminant_Constraint
5610 (Id, Discriminant_Constraint (T));
5611 Set_Stored_Constraint_From_Discriminant_Constraint (Id);
5613 elsif Present (Full_View (T))
5614 and then Has_Discriminants (Full_View (T))
5616 Set_Discriminant_Constraint
5617 (Id, Discriminant_Constraint (Full_View (T)));
5618 Set_Stored_Constraint_From_Discriminant_Constraint (Id);
5620 -- This would seem semantically correct, but apparently
5621 -- generates spurious errors about missing components ???
5623 -- Set_Has_Discriminants (Id);
5626 Prepare_Private_Subtype_Completion (Id, N);
5628 -- If this is the subtype of a constrained private type with
5629 -- discriminants that has got a full view and we also have
5630 -- built a completion just above, show that the completion
5631 -- is a clone of the full view to the back-end.
5633 if Has_Discriminants (T)
5634 and then not Has_Unknown_Discriminants (T)
5635 and then not Is_Empty_Elmt_List (Discriminant_Constraint (T))
5636 and then Present (Full_View (T))
5637 and then Present (Full_View (Id))
5639 Set_Cloned_Subtype (Full_View (Id), Full_View (T));
5643 Set_Ekind (Id, E_Access_Subtype);
5644 Set_Is_Constrained (Id, Is_Constrained (T));
5645 Set_Is_Access_Constant
5646 (Id, Is_Access_Constant (T));
5647 Set_Directly_Designated_Type
5648 (Id, Designated_Type (T));
5649 Set_Can_Never_Be_Null (Id, Can_Never_Be_Null (T));
5651 -- A Pure library_item must not contain the declaration of a
5652 -- named access type, except within a subprogram, generic
5653 -- subprogram, task unit, or protected unit, or if it has
5654 -- a specified Storage_Size of zero (RM05-10.2.1(15.4-15.5)).
5656 if Comes_From_Source (Id)
5657 and then In_Pure_Unit
5658 and then not In_Subprogram_Task_Protected_Unit
5659 and then not No_Pool_Assigned (Id)
5662 ("named access types not allowed in pure unit", N);
5665 when Concurrent_Kind =>
5666 Set_Ekind (Id, Subtype_Kind (Ekind (T)));
5667 Set_Corresponding_Record_Type (Id,
5668 Corresponding_Record_Type (T));
5669 Set_First_Entity (Id, First_Entity (T));
5670 Set_First_Private_Entity (Id, First_Private_Entity (T));
5671 Set_Has_Discriminants (Id, Has_Discriminants (T));
5672 Set_Is_Constrained (Id, Is_Constrained (T));
5673 Set_Is_Tagged_Type (Id, Is_Tagged_Type (T));
5674 Set_Last_Entity (Id, Last_Entity (T));
5676 if Is_Tagged_Type (T) then
5677 Set_No_Tagged_Streams_Pragma
5678 (Id, No_Tagged_Streams_Pragma (T));
5681 if Has_Discriminants (T) then
5682 Set_Discriminant_Constraint
5683 (Id, Discriminant_Constraint (T));
5684 Set_Stored_Constraint_From_Discriminant_Constraint (Id);
5687 when Incomplete_Kind =>
5688 if Ada_Version >= Ada_2005 then
5690 -- In Ada 2005 an incomplete type can be explicitly tagged:
5691 -- propagate indication. Note that we also have to include
5692 -- subtypes for Ada 2012 extended use of incomplete types.
5694 Set_Ekind (Id, E_Incomplete_Subtype);
5695 Set_Is_Tagged_Type (Id, Is_Tagged_Type (T));
5696 Set_Private_Dependents (Id, New_Elmt_List);
5698 if Is_Tagged_Type (Id) then
5699 Set_No_Tagged_Streams_Pragma
5700 (Id, No_Tagged_Streams_Pragma (T));
5701 Set_Direct_Primitive_Operations (Id, New_Elmt_List);
5704 -- Ada 2005 (AI-412): Decorate an incomplete subtype of an
5705 -- incomplete type visible through a limited with clause.
5707 if From_Limited_With (T)
5708 and then Present (Non_Limited_View (T))
5710 Set_From_Limited_With (Id);
5711 Set_Non_Limited_View (Id, Non_Limited_View (T));
5713 -- Ada 2005 (AI-412): Add the regular incomplete subtype
5714 -- to the private dependents of the original incomplete
5715 -- type for future transformation.
5718 Append_Elmt (Id, Private_Dependents (T));
5721 -- If the subtype name denotes an incomplete type an error
5722 -- was already reported by Process_Subtype.
5725 Set_Etype (Id, Any_Type);
5729 raise Program_Error;
5732 -- If there is no constraint in the subtype indication, the
5733 -- declared entity inherits predicates from the parent.
5735 Inherit_Predicate_Flags (Id, T);
5738 if Etype (Id) = Any_Type then
5742 -- Some common processing on all types
5744 Set_Size_Info (Id, T);
5745 Set_First_Rep_Item (Id, First_Rep_Item (T));
5747 -- If the parent type is a generic actual, so is the subtype. This may
5748 -- happen in a nested instance. Why Comes_From_Source test???
5750 if not Comes_From_Source (N) then
5751 Set_Is_Generic_Actual_Type (Id, Is_Generic_Actual_Type (T));
5754 -- If this is a subtype declaration for an actual in an instance,
5755 -- inherit static and dynamic predicates if any.
5757 -- If declaration has no aspect specifications, inherit predicate
5758 -- info as well. Unclear how to handle the case of both specified
5759 -- and inherited predicates ??? Other inherited aspects, such as
5760 -- invariants, should be OK, but the combination with later pragmas
5761 -- may also require special merging.
5763 if Has_Predicates (T)
5764 and then Present (Predicate_Function (T))
5766 ((In_Instance and then not Comes_From_Source (N))
5767 or else No (Aspect_Specifications (N)))
5769 Set_Subprograms_For_Type (Id, Subprograms_For_Type (T));
5771 if Has_Static_Predicate (T) then
5772 Set_Has_Static_Predicate (Id);
5773 Set_Static_Discrete_Predicate (Id, Static_Discrete_Predicate (T));
5777 -- Remaining processing depends on characteristics of base type
5781 Set_Is_Immediately_Visible (Id, True);
5782 Set_Depends_On_Private (Id, Has_Private_Component (T));
5783 Set_Is_Descendant_Of_Address (Id, Is_Descendant_Of_Address (T));
5785 if Is_Interface (T) then
5786 Set_Is_Interface (Id);
5789 if Present (Generic_Parent_Type (N))
5791 (Nkind (Parent (Generic_Parent_Type (N))) /=
5792 N_Formal_Type_Declaration
5793 or else Nkind (Formal_Type_Definition
5794 (Parent (Generic_Parent_Type (N)))) /=
5795 N_Formal_Private_Type_Definition)
5797 if Is_Tagged_Type (Id) then
5799 -- If this is a generic actual subtype for a synchronized type,
5800 -- the primitive operations are those of the corresponding record
5801 -- for which there is a separate subtype declaration.
5803 if Is_Concurrent_Type (Id) then
5805 elsif Is_Class_Wide_Type (Id) then
5806 Derive_Subprograms (Generic_Parent_Type (N), Id, Etype (T));
5808 Derive_Subprograms (Generic_Parent_Type (N), Id, T);
5811 elsif Scope (Etype (Id)) /= Standard_Standard then
5812 Derive_Subprograms (Generic_Parent_Type (N), Id);
5816 if Is_Private_Type (T) and then Present (Full_View (T)) then
5817 Conditional_Delay (Id, Full_View (T));
5819 -- The subtypes of components or subcomponents of protected types
5820 -- do not need freeze nodes, which would otherwise appear in the
5821 -- wrong scope (before the freeze node for the protected type). The
5822 -- proper subtypes are those of the subcomponents of the corresponding
5825 elsif Ekind (Scope (Id)) /= E_Protected_Type
5826 and then Present (Scope (Scope (Id))) -- error defense
5827 and then Ekind (Scope (Scope (Id))) /= E_Protected_Type
5829 Conditional_Delay (Id, T);
5832 -- If we have a subtype of an incomplete type whose full type is a
5833 -- derived numeric type, we need to have a freeze node for the subtype.
5834 -- Otherwise gigi will complain while computing the (static) bounds of
5838 and then Is_Elementary_Type (Id)
5839 and then Etype (Id) /= Id
5842 Partial : constant Entity_Id :=
5843 Incomplete_Or_Partial_View (First_Subtype (Id));
5845 if Present (Partial)
5846 and then Ekind (Partial) = E_Incomplete_Type
5848 Set_Has_Delayed_Freeze (Id);
5853 -- Check that Constraint_Error is raised for a scalar subtype indication
5854 -- when the lower or upper bound of a non-null range lies outside the
5855 -- range of the type mark.
5857 if Nkind (Subtype_Indication (N)) = N_Subtype_Indication then
5858 if Is_Scalar_Type (Etype (Id))
5859 and then Scalar_Range (Id) /=
5861 (Etype (Subtype_Mark (Subtype_Indication (N))))
5865 Etype (Subtype_Mark (Subtype_Indication (N))));
5867 -- In the array case, check compatibility for each index
5869 elsif Is_Array_Type (Etype (Id)) and then Present (First_Index (Id))
5871 -- This really should be a subprogram that finds the indications
5875 Subt_Index : Node_Id := First_Index (Id);
5876 Target_Index : Node_Id :=
5878 (Subtype_Mark (Subtype_Indication (N))));
5879 Has_Dyn_Chk : Boolean := Has_Dynamic_Range_Check (N);
5882 while Present (Subt_Index) loop
5883 if ((Nkind (Subt_Index) = N_Identifier
5884 and then Ekind (Entity (Subt_Index)) in Scalar_Kind)
5885 or else Nkind (Subt_Index) = N_Subtype_Indication)
5887 Nkind (Scalar_Range (Etype (Subt_Index))) = N_Range
5890 Target_Typ : constant Entity_Id :=
5891 Etype (Target_Index);
5895 (Scalar_Range (Etype (Subt_Index)),
5898 Defining_Identifier (N));
5900 -- Reset Has_Dynamic_Range_Check on the subtype to
5901 -- prevent elision of the index check due to a dynamic
5902 -- check generated for a preceding index (needed since
5903 -- Insert_Range_Checks tries to avoid generating
5904 -- redundant checks on a given declaration).
5906 Set_Has_Dynamic_Range_Check (N, False);
5912 Sloc (Defining_Identifier (N)));
5914 -- Record whether this index involved a dynamic check
5917 Has_Dyn_Chk or else Has_Dynamic_Range_Check (N);
5921 Next_Index (Subt_Index);
5922 Next_Index (Target_Index);
5925 -- Finally, mark whether the subtype involves dynamic checks
5927 Set_Has_Dynamic_Range_Check (N, Has_Dyn_Chk);
5932 Set_Optimize_Alignment_Flags (Id);
5933 Check_Eliminated (Id);
5936 if Has_Aspects (N) then
5937 Analyze_Aspect_Specifications (N, Id);
5940 Analyze_Dimension (N);
5942 -- Check No_Dynamic_Sized_Objects restriction, which disallows subtype
5943 -- indications on composite types where the constraints are dynamic.
5944 -- Note that object declarations and aggregates generate implicit
5945 -- subtype declarations, which this covers. One special case is that the
5946 -- implicitly generated "=" for discriminated types includes an
5947 -- offending subtype declaration, which is harmless, so we ignore it
5950 if Nkind (Subtype_Indication (N)) = N_Subtype_Indication then
5952 Cstr : constant Node_Id := Constraint (Subtype_Indication (N));
5954 if Nkind (Cstr) = N_Index_Or_Discriminant_Constraint
5955 and then not (Is_Internal (Id)
5956 and then Is_TSS (Scope (Id),
5957 TSS_Composite_Equality))
5958 and then not Within_Init_Proc
5959 and then not All_Composite_Constraints_Static (Cstr)
5961 Check_Restriction (No_Dynamic_Sized_Objects, Cstr);
5965 end Analyze_Subtype_Declaration;
5967 --------------------------------
5968 -- Analyze_Subtype_Indication --
5969 --------------------------------
5971 procedure Analyze_Subtype_Indication (N : Node_Id) is
5972 T : constant Entity_Id := Subtype_Mark (N);
5973 R : constant Node_Id := Range_Expression (Constraint (N));
5980 Set_Etype (N, Etype (R));
5981 Resolve (R, Entity (T));
5983 Set_Error_Posted (R);
5984 Set_Error_Posted (T);
5986 end Analyze_Subtype_Indication;
5988 --------------------------
5989 -- Analyze_Variant_Part --
5990 --------------------------
5992 procedure Analyze_Variant_Part (N : Node_Id) is
5993 Discr_Name : Node_Id;
5994 Discr_Type : Entity_Id;
5996 procedure Process_Variant (A : Node_Id);
5997 -- Analyze declarations for a single variant
5999 package Analyze_Variant_Choices is
6000 new Generic_Analyze_Choices (Process_Variant);
6001 use Analyze_Variant_Choices;
6003 ---------------------
6004 -- Process_Variant --
6005 ---------------------
6007 procedure Process_Variant (A : Node_Id) is
6008 CL : constant Node_Id := Component_List (A);
6010 if not Null_Present (CL) then
6011 Analyze_Declarations (Component_Items (CL));
6013 if Present (Variant_Part (CL)) then
6014 Analyze (Variant_Part (CL));
6017 end Process_Variant;
6019 -- Start of processing for Analyze_Variant_Part
6022 Discr_Name := Name (N);
6023 Analyze (Discr_Name);
6025 -- If Discr_Name bad, get out (prevent cascaded errors)
6027 if Etype (Discr_Name) = Any_Type then
6031 -- Check invalid discriminant in variant part
6033 if Ekind (Entity (Discr_Name)) /= E_Discriminant then
6034 Error_Msg_N ("invalid discriminant name in variant part", Discr_Name);
6037 Discr_Type := Etype (Entity (Discr_Name));
6039 if not Is_Discrete_Type (Discr_Type) then
6041 ("discriminant in a variant part must be of a discrete type",
6046 -- Now analyze the choices, which also analyzes the declarations that
6047 -- are associated with each choice.
6049 Analyze_Choices (Variants (N), Discr_Type);
6051 -- Note: we used to instantiate and call Check_Choices here to check
6052 -- that the choices covered the discriminant, but it's too early to do
6053 -- that because of statically predicated subtypes, whose analysis may
6054 -- be deferred to their freeze point which may be as late as the freeze
6055 -- point of the containing record. So this call is now to be found in
6056 -- Freeze_Record_Declaration.
6058 end Analyze_Variant_Part;
6060 ----------------------------
6061 -- Array_Type_Declaration --
6062 ----------------------------
6064 procedure Array_Type_Declaration (T : in out Entity_Id; Def : Node_Id) is
6065 Component_Def : constant Node_Id := Component_Definition (Def);
6066 Component_Typ : constant Node_Id := Subtype_Indication (Component_Def);
6067 P : constant Node_Id := Parent (Def);
6068 Element_Type : Entity_Id;
6069 Implicit_Base : Entity_Id;
6073 Related_Id : Entity_Id := Empty;
6076 if Nkind (Def) = N_Constrained_Array_Definition then
6077 Index := First (Discrete_Subtype_Definitions (Def));
6079 Index := First (Subtype_Marks (Def));
6082 -- Find proper names for the implicit types which may be public. In case
6083 -- of anonymous arrays we use the name of the first object of that type
6087 Related_Id := Defining_Identifier (P);
6093 while Present (Index) loop
6096 -- Test for odd case of trying to index a type by the type itself
6098 if Is_Entity_Name (Index) and then Entity (Index) = T then
6099 Error_Msg_N ("type& cannot be indexed by itself", Index);
6100 Set_Entity (Index, Standard_Boolean);
6101 Set_Etype (Index, Standard_Boolean);
6104 -- Check SPARK restriction requiring a subtype mark
6106 if not Nkind_In (Index, N_Identifier, N_Expanded_Name) then
6107 Check_SPARK_05_Restriction ("subtype mark required", Index);
6110 -- Add a subtype declaration for each index of private array type
6111 -- declaration whose etype is also private. For example:
6114 -- type Index is private;
6116 -- type Table is array (Index) of ...
6119 -- This is currently required by the expander for the internally
6120 -- generated equality subprogram of records with variant parts in
6121 -- which the etype of some component is such private type.
6123 if Ekind (Current_Scope) = E_Package
6124 and then In_Private_Part (Current_Scope)
6125 and then Has_Private_Declaration (Etype (Index))
6128 Loc : constant Source_Ptr := Sloc (Def);
6133 New_E := Make_Temporary (Loc, 'T');
6134 Set_Is_Internal (New_E);
6137 Make_Subtype_Declaration (Loc,
6138 Defining_Identifier => New_E,
6139 Subtype_Indication =>
6140 New_Occurrence_Of (Etype (Index), Loc));
6142 Insert_Before (Parent (Def), Decl);
6144 Set_Etype (Index, New_E);
6146 -- If the index is a range or a subtype indication it carries
6147 -- no entity. Example:
6150 -- type T is private;
6152 -- type T is new Natural;
6153 -- Table : array (T(1) .. T(10)) of Boolean;
6156 -- Otherwise the type of the reference is its entity.
6158 if Is_Entity_Name (Index) then
6159 Set_Entity (Index, New_E);
6164 Make_Index (Index, P, Related_Id, Nb_Index);
6166 -- Check error of subtype with predicate for index type
6168 Bad_Predicated_Subtype_Use
6169 ("subtype& has predicate, not allowed as index subtype",
6170 Index, Etype (Index));
6172 -- Move to next index
6175 Nb_Index := Nb_Index + 1;
6178 -- Process subtype indication if one is present
6180 if Present (Component_Typ) then
6181 Element_Type := Process_Subtype (Component_Typ, P, Related_Id, 'C');
6183 Set_Etype (Component_Typ, Element_Type);
6185 if not Nkind_In (Component_Typ, N_Identifier, N_Expanded_Name) then
6186 Check_SPARK_05_Restriction
6187 ("subtype mark required", Component_Typ);
6190 -- Ada 2005 (AI-230): Access Definition case
6192 else pragma Assert (Present (Access_Definition (Component_Def)));
6194 -- Indicate that the anonymous access type is created by the
6195 -- array type declaration.
6197 Element_Type := Access_Definition
6199 N => Access_Definition (Component_Def));
6200 Set_Is_Local_Anonymous_Access (Element_Type);
6202 -- Propagate the parent. This field is needed if we have to generate
6203 -- the master_id associated with an anonymous access to task type
6204 -- component (see Expand_N_Full_Type_Declaration.Build_Master)
6206 Set_Parent (Element_Type, Parent (T));
6208 -- Ada 2005 (AI-230): In case of components that are anonymous access
6209 -- types the level of accessibility depends on the enclosing type
6212 Set_Scope (Element_Type, Current_Scope); -- Ada 2005 (AI-230)
6214 -- Ada 2005 (AI-254)
6217 CD : constant Node_Id :=
6218 Access_To_Subprogram_Definition
6219 (Access_Definition (Component_Def));
6221 if Present (CD) and then Protected_Present (CD) then
6223 Replace_Anonymous_Access_To_Protected_Subprogram (Def);
6228 -- Constrained array case
6231 T := Create_Itype (E_Void, P, Related_Id, 'T');
6234 if Nkind (Def) = N_Constrained_Array_Definition then
6236 -- Establish Implicit_Base as unconstrained base type
6238 Implicit_Base := Create_Itype (E_Array_Type, P, Related_Id, 'B');
6240 Set_Etype (Implicit_Base, Implicit_Base);
6241 Set_Scope (Implicit_Base, Current_Scope);
6242 Set_Has_Delayed_Freeze (Implicit_Base);
6243 Set_Default_SSO (Implicit_Base);
6245 -- The constrained array type is a subtype of the unconstrained one
6247 Set_Ekind (T, E_Array_Subtype);
6248 Init_Size_Align (T);
6249 Set_Etype (T, Implicit_Base);
6250 Set_Scope (T, Current_Scope);
6251 Set_Is_Constrained (T);
6253 First (Discrete_Subtype_Definitions (Def)));
6254 Set_Has_Delayed_Freeze (T);
6256 -- Complete setup of implicit base type
6258 Set_Component_Size (Implicit_Base, Uint_0);
6259 Set_Component_Type (Implicit_Base, Element_Type);
6260 Set_Finalize_Storage_Only
6262 Finalize_Storage_Only (Element_Type));
6263 Set_First_Index (Implicit_Base, First_Index (T));
6264 Set_Has_Controlled_Component
6266 Has_Controlled_Component (Element_Type)
6267 or else Is_Controlled (Element_Type));
6268 Set_Packed_Array_Impl_Type
6269 (Implicit_Base, Empty);
6271 Propagate_Concurrent_Flags (Implicit_Base, Element_Type);
6273 -- Unconstrained array case
6276 Set_Ekind (T, E_Array_Type);
6277 Init_Size_Align (T);
6279 Set_Scope (T, Current_Scope);
6280 Set_Component_Size (T, Uint_0);
6281 Set_Is_Constrained (T, False);
6282 Set_First_Index (T, First (Subtype_Marks (Def)));
6283 Set_Has_Delayed_Freeze (T, True);
6284 Propagate_Concurrent_Flags (T, Element_Type);
6285 Set_Has_Controlled_Component (T, Has_Controlled_Component
6288 Is_Controlled (Element_Type));
6289 Set_Finalize_Storage_Only (T, Finalize_Storage_Only
6291 Set_Default_SSO (T);
6294 -- Common attributes for both cases
6296 Set_Component_Type (Base_Type (T), Element_Type);
6297 Set_Packed_Array_Impl_Type (T, Empty);
6299 if Aliased_Present (Component_Definition (Def)) then
6300 Check_SPARK_05_Restriction
6301 ("aliased is not allowed", Component_Definition (Def));
6302 Set_Has_Aliased_Components (Etype (T));
6305 -- Ada 2005 (AI-231): Propagate the null-excluding attribute to the
6306 -- array type to ensure that objects of this type are initialized.
6308 if Ada_Version >= Ada_2005 and then Can_Never_Be_Null (Element_Type) then
6309 Set_Can_Never_Be_Null (T);
6311 if Null_Exclusion_Present (Component_Definition (Def))
6313 -- No need to check itypes because in their case this check was
6314 -- done at their point of creation
6316 and then not Is_Itype (Element_Type)
6319 ("`NOT NULL` not allowed (null already excluded)",
6320 Subtype_Indication (Component_Definition (Def)));
6324 Priv := Private_Component (Element_Type);
6326 if Present (Priv) then
6328 -- Check for circular definitions
6330 if Priv = Any_Type then
6331 Set_Component_Type (Etype (T), Any_Type);
6333 -- There is a gap in the visibility of operations on the composite
6334 -- type only if the component type is defined in a different scope.
6336 elsif Scope (Priv) = Current_Scope then
6339 elsif Is_Limited_Type (Priv) then
6340 Set_Is_Limited_Composite (Etype (T));
6341 Set_Is_Limited_Composite (T);
6343 Set_Is_Private_Composite (Etype (T));
6344 Set_Is_Private_Composite (T);
6348 -- A syntax error in the declaration itself may lead to an empty index
6349 -- list, in which case do a minimal patch.
6351 if No (First_Index (T)) then
6352 Error_Msg_N ("missing index definition in array type declaration", T);
6355 Indexes : constant List_Id :=
6356 New_List (New_Occurrence_Of (Any_Id, Sloc (T)));
6358 Set_Discrete_Subtype_Definitions (Def, Indexes);
6359 Set_First_Index (T, First (Indexes));
6364 -- Create a concatenation operator for the new type. Internal array
6365 -- types created for packed entities do not need such, they are
6366 -- compatible with the user-defined type.
6368 if Number_Dimensions (T) = 1
6369 and then not Is_Packed_Array_Impl_Type (T)
6371 New_Concatenation_Op (T);
6374 -- In the case of an unconstrained array the parser has already verified
6375 -- that all the indexes are unconstrained but we still need to make sure
6376 -- that the element type is constrained.
6378 if not Is_Definite_Subtype (Element_Type) then
6380 ("unconstrained element type in array declaration",
6381 Subtype_Indication (Component_Def));
6383 elsif Is_Abstract_Type (Element_Type) then
6385 ("the type of a component cannot be abstract",
6386 Subtype_Indication (Component_Def));
6389 -- There may be an invariant declared for the component type, but
6390 -- the construction of the component invariant checking procedure
6391 -- takes place during expansion.
6392 end Array_Type_Declaration;
6394 ------------------------------------------------------
6395 -- Replace_Anonymous_Access_To_Protected_Subprogram --
6396 ------------------------------------------------------
6398 function Replace_Anonymous_Access_To_Protected_Subprogram
6399 (N : Node_Id) return Entity_Id
6401 Loc : constant Source_Ptr := Sloc (N);
6403 Curr_Scope : constant Scope_Stack_Entry :=
6404 Scope_Stack.Table (Scope_Stack.Last);
6406 Anon : constant Entity_Id := Make_Temporary (Loc, 'S');
6409 -- Access definition in declaration
6412 -- Object definition or formal definition with an access definition
6415 -- Declaration of anonymous access to subprogram type
6418 -- Original specification in access to subprogram
6423 Set_Is_Internal (Anon);
6426 when N_Constrained_Array_Definition
6427 | N_Component_Declaration
6428 | N_Unconstrained_Array_Definition
6430 Comp := Component_Definition (N);
6431 Acc := Access_Definition (Comp);
6433 when N_Discriminant_Specification =>
6434 Comp := Discriminant_Type (N);
6437 when N_Parameter_Specification =>
6438 Comp := Parameter_Type (N);
6441 when N_Access_Function_Definition =>
6442 Comp := Result_Definition (N);
6445 when N_Object_Declaration =>
6446 Comp := Object_Definition (N);
6449 when N_Function_Specification =>
6450 Comp := Result_Definition (N);
6454 raise Program_Error;
6457 Spec := Access_To_Subprogram_Definition (Acc);
6460 Make_Full_Type_Declaration (Loc,
6461 Defining_Identifier => Anon,
6462 Type_Definition => Copy_Separate_Tree (Spec));
6464 Mark_Rewrite_Insertion (Decl);
6466 -- In ASIS mode, analyze the profile on the original node, because
6467 -- the separate copy does not provide enough links to recover the
6468 -- original tree. Analysis is limited to type annotations, within
6469 -- a temporary scope that serves as an anonymous subprogram to collect
6470 -- otherwise useless temporaries and itypes.
6474 Typ : constant Entity_Id := Make_Temporary (Loc, 'S');
6477 if Nkind (Spec) = N_Access_Function_Definition then
6478 Set_Ekind (Typ, E_Function);
6480 Set_Ekind (Typ, E_Procedure);
6483 Set_Parent (Typ, N);
6484 Set_Scope (Typ, Current_Scope);
6487 -- Nothing to do if procedure is parameterless
6489 if Present (Parameter_Specifications (Spec)) then
6490 Process_Formals (Parameter_Specifications (Spec), Spec);
6493 if Nkind (Spec) = N_Access_Function_Definition then
6495 Def : constant Node_Id := Result_Definition (Spec);
6498 -- The result might itself be an anonymous access type, so
6501 if Nkind (Def) = N_Access_Definition then
6502 if Present (Access_To_Subprogram_Definition (Def)) then
6505 Replace_Anonymous_Access_To_Protected_Subprogram
6508 Find_Type (Subtype_Mark (Def));
6521 -- Insert the new declaration in the nearest enclosing scope. If the
6522 -- parent is a body and N is its return type, the declaration belongs
6523 -- in the enclosing scope. Likewise if N is the type of a parameter.
6527 if Nkind (N) = N_Function_Specification
6528 and then Nkind (P) = N_Subprogram_Body
6531 elsif Nkind (N) = N_Parameter_Specification
6532 and then Nkind (P) in N_Subprogram_Specification
6533 and then Nkind (Parent (P)) = N_Subprogram_Body
6535 P := Parent (Parent (P));
6538 while Present (P) and then not Has_Declarations (P) loop
6542 pragma Assert (Present (P));
6544 if Nkind (P) = N_Package_Specification then
6545 Prepend (Decl, Visible_Declarations (P));
6547 Prepend (Decl, Declarations (P));
6550 -- Replace the anonymous type with an occurrence of the new declaration.
6551 -- In all cases the rewritten node does not have the null-exclusion
6552 -- attribute because (if present) it was already inherited by the
6553 -- anonymous entity (Anon). Thus, in case of components we do not
6554 -- inherit this attribute.
6556 if Nkind (N) = N_Parameter_Specification then
6557 Rewrite (Comp, New_Occurrence_Of (Anon, Loc));
6558 Set_Etype (Defining_Identifier (N), Anon);
6559 Set_Null_Exclusion_Present (N, False);
6561 elsif Nkind (N) = N_Object_Declaration then
6562 Rewrite (Comp, New_Occurrence_Of (Anon, Loc));
6563 Set_Etype (Defining_Identifier (N), Anon);
6565 elsif Nkind (N) = N_Access_Function_Definition then
6566 Rewrite (Comp, New_Occurrence_Of (Anon, Loc));
6568 elsif Nkind (N) = N_Function_Specification then
6569 Rewrite (Comp, New_Occurrence_Of (Anon, Loc));
6570 Set_Etype (Defining_Unit_Name (N), Anon);
6574 Make_Component_Definition (Loc,
6575 Subtype_Indication => New_Occurrence_Of (Anon, Loc)));
6578 Mark_Rewrite_Insertion (Comp);
6580 if Nkind_In (N, N_Object_Declaration, N_Access_Function_Definition)
6581 or else (Nkind (Parent (N)) = N_Full_Type_Declaration
6582 and then not Is_Type (Current_Scope))
6585 -- Declaration can be analyzed in the current scope.
6590 -- Temporarily remove the current scope (record or subprogram) from
6591 -- the stack to add the new declarations to the enclosing scope.
6592 -- The anonymous entity is an Itype with the proper attributes.
6594 Scope_Stack.Decrement_Last;
6596 Set_Is_Itype (Anon);
6597 Set_Associated_Node_For_Itype (Anon, N);
6598 Scope_Stack.Append (Curr_Scope);
6601 Set_Ekind (Anon, E_Anonymous_Access_Protected_Subprogram_Type);
6602 Set_Can_Use_Internal_Rep (Anon, not Always_Compatible_Rep_On_Target);
6604 end Replace_Anonymous_Access_To_Protected_Subprogram;
6606 -------------------------------
6607 -- Build_Derived_Access_Type --
6608 -------------------------------
6610 procedure Build_Derived_Access_Type
6612 Parent_Type : Entity_Id;
6613 Derived_Type : Entity_Id)
6615 S : constant Node_Id := Subtype_Indication (Type_Definition (N));
6617 Desig_Type : Entity_Id;
6619 Discr_Con_Elist : Elist_Id;
6620 Discr_Con_El : Elmt_Id;
6624 -- Set the designated type so it is available in case this is an access
6625 -- to a self-referential type, e.g. a standard list type with a next
6626 -- pointer. Will be reset after subtype is built.
6628 Set_Directly_Designated_Type
6629 (Derived_Type, Designated_Type (Parent_Type));
6631 Subt := Process_Subtype (S, N);
6633 if Nkind (S) /= N_Subtype_Indication
6634 and then Subt /= Base_Type (Subt)
6636 Set_Ekind (Derived_Type, E_Access_Subtype);
6639 if Ekind (Derived_Type) = E_Access_Subtype then
6641 Pbase : constant Entity_Id := Base_Type (Parent_Type);
6642 Ibase : constant Entity_Id :=
6643 Create_Itype (Ekind (Pbase), N, Derived_Type, 'B');
6644 Svg_Chars : constant Name_Id := Chars (Ibase);
6645 Svg_Next_E : constant Entity_Id := Next_Entity (Ibase);
6646 Svg_Prev_E : constant Entity_Id := Prev_Entity (Ibase);
6649 Copy_Node (Pbase, Ibase);
6651 -- Restore Itype status after Copy_Node
6653 Set_Is_Itype (Ibase);
6654 Set_Associated_Node_For_Itype (Ibase, N);
6656 Set_Chars (Ibase, Svg_Chars);
6657 Set_Prev_Entity (Ibase, Svg_Prev_E);
6658 Set_Next_Entity (Ibase, Svg_Next_E);
6659 Set_Sloc (Ibase, Sloc (Derived_Type));
6660 Set_Scope (Ibase, Scope (Derived_Type));
6661 Set_Freeze_Node (Ibase, Empty);
6662 Set_Is_Frozen (Ibase, False);
6663 Set_Comes_From_Source (Ibase, False);
6664 Set_Is_First_Subtype (Ibase, False);
6666 Set_Etype (Ibase, Pbase);
6667 Set_Etype (Derived_Type, Ibase);
6671 Set_Directly_Designated_Type
6672 (Derived_Type, Designated_Type (Subt));
6674 Set_Is_Constrained (Derived_Type, Is_Constrained (Subt));
6675 Set_Is_Access_Constant (Derived_Type, Is_Access_Constant (Parent_Type));
6676 Set_Size_Info (Derived_Type, Parent_Type);
6677 Set_RM_Size (Derived_Type, RM_Size (Parent_Type));
6678 Set_Depends_On_Private (Derived_Type,
6679 Has_Private_Component (Derived_Type));
6680 Conditional_Delay (Derived_Type, Subt);
6682 -- Ada 2005 (AI-231): Set the null-exclusion attribute, and verify
6683 -- that it is not redundant.
6685 if Null_Exclusion_Present (Type_Definition (N)) then
6686 Set_Can_Never_Be_Null (Derived_Type);
6688 elsif Can_Never_Be_Null (Parent_Type) then
6689 Set_Can_Never_Be_Null (Derived_Type);
6692 -- Note: we do not copy the Storage_Size_Variable, since we always go to
6693 -- the root type for this information.
6695 -- Apply range checks to discriminants for derived record case
6696 -- ??? THIS CODE SHOULD NOT BE HERE REALLY.
6698 Desig_Type := Designated_Type (Derived_Type);
6700 if Is_Composite_Type (Desig_Type)
6701 and then (not Is_Array_Type (Desig_Type))
6702 and then Has_Discriminants (Desig_Type)
6703 and then Base_Type (Desig_Type) /= Desig_Type
6705 Discr_Con_Elist := Discriminant_Constraint (Desig_Type);
6706 Discr_Con_El := First_Elmt (Discr_Con_Elist);
6708 Discr := First_Discriminant (Base_Type (Desig_Type));
6709 while Present (Discr_Con_El) loop
6710 Apply_Range_Check (Node (Discr_Con_El), Etype (Discr));
6711 Next_Elmt (Discr_Con_El);
6712 Next_Discriminant (Discr);
6715 end Build_Derived_Access_Type;
6717 ------------------------------
6718 -- Build_Derived_Array_Type --
6719 ------------------------------
6721 procedure Build_Derived_Array_Type
6723 Parent_Type : Entity_Id;
6724 Derived_Type : Entity_Id)
6726 Loc : constant Source_Ptr := Sloc (N);
6727 Tdef : constant Node_Id := Type_Definition (N);
6728 Indic : constant Node_Id := Subtype_Indication (Tdef);
6729 Parent_Base : constant Entity_Id := Base_Type (Parent_Type);
6730 Implicit_Base : Entity_Id := Empty;
6731 New_Indic : Node_Id;
6733 procedure Make_Implicit_Base;
6734 -- If the parent subtype is constrained, the derived type is a subtype
6735 -- of an implicit base type derived from the parent base.
6737 ------------------------
6738 -- Make_Implicit_Base --
6739 ------------------------
6741 procedure Make_Implicit_Base is
6744 Create_Itype (Ekind (Parent_Base), N, Derived_Type, 'B');
6746 Set_Ekind (Implicit_Base, Ekind (Parent_Base));
6747 Set_Etype (Implicit_Base, Parent_Base);
6749 Copy_Array_Subtype_Attributes (Implicit_Base, Parent_Base);
6750 Copy_Array_Base_Type_Attributes (Implicit_Base, Parent_Base);
6752 Set_Has_Delayed_Freeze (Implicit_Base, True);
6753 end Make_Implicit_Base;
6755 -- Start of processing for Build_Derived_Array_Type
6758 if not Is_Constrained (Parent_Type) then
6759 if Nkind (Indic) /= N_Subtype_Indication then
6760 Set_Ekind (Derived_Type, E_Array_Type);
6762 Copy_Array_Subtype_Attributes (Derived_Type, Parent_Type);
6763 Copy_Array_Base_Type_Attributes (Derived_Type, Parent_Type);
6765 Set_Has_Delayed_Freeze (Derived_Type, True);
6769 Set_Etype (Derived_Type, Implicit_Base);
6772 Make_Subtype_Declaration (Loc,
6773 Defining_Identifier => Derived_Type,
6774 Subtype_Indication =>
6775 Make_Subtype_Indication (Loc,
6776 Subtype_Mark => New_Occurrence_Of (Implicit_Base, Loc),
6777 Constraint => Constraint (Indic)));
6779 Rewrite (N, New_Indic);
6784 if Nkind (Indic) /= N_Subtype_Indication then
6787 Set_Ekind (Derived_Type, Ekind (Parent_Type));
6788 Set_Etype (Derived_Type, Implicit_Base);
6789 Copy_Array_Subtype_Attributes (Derived_Type, Parent_Type);
6792 Error_Msg_N ("illegal constraint on constrained type", Indic);
6796 -- If parent type is not a derived type itself, and is declared in
6797 -- closed scope (e.g. a subprogram), then we must explicitly introduce
6798 -- the new type's concatenation operator since Derive_Subprograms
6799 -- will not inherit the parent's operator. If the parent type is
6800 -- unconstrained, the operator is of the unconstrained base type.
6802 if Number_Dimensions (Parent_Type) = 1
6803 and then not Is_Limited_Type (Parent_Type)
6804 and then not Is_Derived_Type (Parent_Type)
6805 and then not Is_Package_Or_Generic_Package
6806 (Scope (Base_Type (Parent_Type)))
6808 if not Is_Constrained (Parent_Type)
6809 and then Is_Constrained (Derived_Type)
6811 New_Concatenation_Op (Implicit_Base);
6813 New_Concatenation_Op (Derived_Type);
6816 end Build_Derived_Array_Type;
6818 -----------------------------------
6819 -- Build_Derived_Concurrent_Type --
6820 -----------------------------------
6822 procedure Build_Derived_Concurrent_Type
6824 Parent_Type : Entity_Id;
6825 Derived_Type : Entity_Id)
6827 Loc : constant Source_Ptr := Sloc (N);
6829 Corr_Record : constant Entity_Id := Make_Temporary (Loc, 'C');
6830 Corr_Decl : Node_Id;
6831 Corr_Decl_Needed : Boolean;
6832 -- If the derived type has fewer discriminants than its parent, the
6833 -- corresponding record is also a derived type, in order to account for
6834 -- the bound discriminants. We create a full type declaration for it in
6837 Constraint_Present : constant Boolean :=
6838 Nkind (Subtype_Indication (Type_Definition (N))) =
6839 N_Subtype_Indication;
6841 D_Constraint : Node_Id;
6842 New_Constraint : Elist_Id := No_Elist;
6843 Old_Disc : Entity_Id;
6844 New_Disc : Entity_Id;
6848 Set_Stored_Constraint (Derived_Type, No_Elist);
6849 Corr_Decl_Needed := False;
6852 if Present (Discriminant_Specifications (N))
6853 and then Constraint_Present
6855 Old_Disc := First_Discriminant (Parent_Type);
6856 New_Disc := First (Discriminant_Specifications (N));
6857 while Present (New_Disc) and then Present (Old_Disc) loop
6858 Next_Discriminant (Old_Disc);
6863 if Present (Old_Disc) and then Expander_Active then
6865 -- The new type has fewer discriminants, so we need to create a new
6866 -- corresponding record, which is derived from the corresponding
6867 -- record of the parent, and has a stored constraint that captures
6868 -- the values of the discriminant constraints. The corresponding
6869 -- record is needed only if expander is active and code generation is
6872 -- The type declaration for the derived corresponding record has the
6873 -- same discriminant part and constraints as the current declaration.
6874 -- Copy the unanalyzed tree to build declaration.
6876 Corr_Decl_Needed := True;
6877 New_N := Copy_Separate_Tree (N);
6880 Make_Full_Type_Declaration (Loc,
6881 Defining_Identifier => Corr_Record,
6882 Discriminant_Specifications =>
6883 Discriminant_Specifications (New_N),
6885 Make_Derived_Type_Definition (Loc,
6886 Subtype_Indication =>
6887 Make_Subtype_Indication (Loc,
6890 (Corresponding_Record_Type (Parent_Type), Loc),
6893 (Subtype_Indication (Type_Definition (New_N))))));
6896 -- Copy Storage_Size and Relative_Deadline variables if task case
6898 if Is_Task_Type (Parent_Type) then
6899 Set_Storage_Size_Variable (Derived_Type,
6900 Storage_Size_Variable (Parent_Type));
6901 Set_Relative_Deadline_Variable (Derived_Type,
6902 Relative_Deadline_Variable (Parent_Type));
6905 if Present (Discriminant_Specifications (N)) then
6906 Push_Scope (Derived_Type);
6907 Check_Or_Process_Discriminants (N, Derived_Type);
6909 if Constraint_Present then
6911 Expand_To_Stored_Constraint
6913 Build_Discriminant_Constraints
6915 Subtype_Indication (Type_Definition (N)), True));
6920 elsif Constraint_Present then
6922 -- Build constrained subtype, copying the constraint, and derive
6923 -- from it to create a derived constrained type.
6926 Loc : constant Source_Ptr := Sloc (N);
6927 Anon : constant Entity_Id :=
6928 Make_Defining_Identifier (Loc,
6929 Chars => New_External_Name (Chars (Derived_Type), 'T'));
6934 Make_Subtype_Declaration (Loc,
6935 Defining_Identifier => Anon,
6936 Subtype_Indication =>
6937 New_Copy_Tree (Subtype_Indication (Type_Definition (N))));
6938 Insert_Before (N, Decl);
6941 Rewrite (Subtype_Indication (Type_Definition (N)),
6942 New_Occurrence_Of (Anon, Loc));
6943 Set_Analyzed (Derived_Type, False);
6949 -- By default, operations and private data are inherited from parent.
6950 -- However, in the presence of bound discriminants, a new corresponding
6951 -- record will be created, see below.
6953 Set_Has_Discriminants
6954 (Derived_Type, Has_Discriminants (Parent_Type));
6955 Set_Corresponding_Record_Type
6956 (Derived_Type, Corresponding_Record_Type (Parent_Type));
6958 -- Is_Constrained is set according the parent subtype, but is set to
6959 -- False if the derived type is declared with new discriminants.
6963 (Is_Constrained (Parent_Type) or else Constraint_Present)
6964 and then not Present (Discriminant_Specifications (N)));
6966 if Constraint_Present then
6967 if not Has_Discriminants (Parent_Type) then
6968 Error_Msg_N ("untagged parent must have discriminants", N);
6970 elsif Present (Discriminant_Specifications (N)) then
6972 -- Verify that new discriminants are used to constrain old ones
6977 (Constraint (Subtype_Indication (Type_Definition (N)))));
6979 Old_Disc := First_Discriminant (Parent_Type);
6981 while Present (D_Constraint) loop
6982 if Nkind (D_Constraint) /= N_Discriminant_Association then
6984 -- Positional constraint. If it is a reference to a new
6985 -- discriminant, it constrains the corresponding old one.
6987 if Nkind (D_Constraint) = N_Identifier then
6988 New_Disc := First_Discriminant (Derived_Type);
6989 while Present (New_Disc) loop
6990 exit when Chars (New_Disc) = Chars (D_Constraint);
6991 Next_Discriminant (New_Disc);
6994 if Present (New_Disc) then
6995 Set_Corresponding_Discriminant (New_Disc, Old_Disc);
6999 Next_Discriminant (Old_Disc);
7001 -- if this is a named constraint, search by name for the old
7002 -- discriminants constrained by the new one.
7004 elsif Nkind (Expression (D_Constraint)) = N_Identifier then
7006 -- Find new discriminant with that name
7008 New_Disc := First_Discriminant (Derived_Type);
7009 while Present (New_Disc) loop
7011 Chars (New_Disc) = Chars (Expression (D_Constraint));
7012 Next_Discriminant (New_Disc);
7015 if Present (New_Disc) then
7017 -- Verify that new discriminant renames some discriminant
7018 -- of the parent type, and associate the new discriminant
7019 -- with one or more old ones that it renames.
7025 Selector := First (Selector_Names (D_Constraint));
7026 while Present (Selector) loop
7027 Old_Disc := First_Discriminant (Parent_Type);
7028 while Present (Old_Disc) loop
7029 exit when Chars (Old_Disc) = Chars (Selector);
7030 Next_Discriminant (Old_Disc);
7033 if Present (Old_Disc) then
7034 Set_Corresponding_Discriminant
7035 (New_Disc, Old_Disc);
7044 Next (D_Constraint);
7047 New_Disc := First_Discriminant (Derived_Type);
7048 while Present (New_Disc) loop
7049 if No (Corresponding_Discriminant (New_Disc)) then
7051 ("new discriminant& must constrain old one", N, New_Disc);
7054 Subtypes_Statically_Compatible
7056 Etype (Corresponding_Discriminant (New_Disc)))
7059 ("& not statically compatible with parent discriminant",
7063 Next_Discriminant (New_Disc);
7067 elsif Present (Discriminant_Specifications (N)) then
7069 ("missing discriminant constraint in untagged derivation", N);
7072 -- The entity chain of the derived type includes the new discriminants
7073 -- but shares operations with the parent.
7075 if Present (Discriminant_Specifications (N)) then
7076 Old_Disc := First_Discriminant (Parent_Type);
7077 while Present (Old_Disc) loop
7078 if No (Next_Entity (Old_Disc))
7079 or else Ekind (Next_Entity (Old_Disc)) /= E_Discriminant
7082 (Last_Entity (Derived_Type), Next_Entity (Old_Disc));
7086 Next_Discriminant (Old_Disc);
7090 Set_First_Entity (Derived_Type, First_Entity (Parent_Type));
7091 if Has_Discriminants (Parent_Type) then
7092 Set_Is_Constrained (Derived_Type, Is_Constrained (Parent_Type));
7093 Set_Discriminant_Constraint (
7094 Derived_Type, Discriminant_Constraint (Parent_Type));
7098 Set_Last_Entity (Derived_Type, Last_Entity (Parent_Type));
7100 Set_Has_Completion (Derived_Type);
7102 if Corr_Decl_Needed then
7103 Set_Stored_Constraint (Derived_Type, New_Constraint);
7104 Insert_After (N, Corr_Decl);
7105 Analyze (Corr_Decl);
7106 Set_Corresponding_Record_Type (Derived_Type, Corr_Record);
7108 end Build_Derived_Concurrent_Type;
7110 ------------------------------------
7111 -- Build_Derived_Enumeration_Type --
7112 ------------------------------------
7114 procedure Build_Derived_Enumeration_Type
7116 Parent_Type : Entity_Id;
7117 Derived_Type : Entity_Id)
7119 Loc : constant Source_Ptr := Sloc (N);
7120 Def : constant Node_Id := Type_Definition (N);
7121 Indic : constant Node_Id := Subtype_Indication (Def);
7122 Implicit_Base : Entity_Id;
7123 Literal : Entity_Id;
7124 New_Lit : Entity_Id;
7125 Literals_List : List_Id;
7126 Type_Decl : Node_Id;
7128 Rang_Expr : Node_Id;
7131 -- Since types Standard.Character and Standard.[Wide_]Wide_Character do
7132 -- not have explicit literals lists we need to process types derived
7133 -- from them specially. This is handled by Derived_Standard_Character.
7134 -- If the parent type is a generic type, there are no literals either,
7135 -- and we construct the same skeletal representation as for the generic
7138 if Is_Standard_Character_Type (Parent_Type) then
7139 Derived_Standard_Character (N, Parent_Type, Derived_Type);
7141 elsif Is_Generic_Type (Root_Type (Parent_Type)) then
7147 if Nkind (Indic) /= N_Subtype_Indication then
7149 Make_Attribute_Reference (Loc,
7150 Attribute_Name => Name_First,
7151 Prefix => New_Occurrence_Of (Derived_Type, Loc));
7152 Set_Etype (Lo, Derived_Type);
7155 Make_Attribute_Reference (Loc,
7156 Attribute_Name => Name_Last,
7157 Prefix => New_Occurrence_Of (Derived_Type, Loc));
7158 Set_Etype (Hi, Derived_Type);
7160 Set_Scalar_Range (Derived_Type,
7166 -- Analyze subtype indication and verify compatibility
7167 -- with parent type.
7169 if Base_Type (Process_Subtype (Indic, N)) /=
7170 Base_Type (Parent_Type)
7173 ("illegal constraint for formal discrete type", N);
7179 -- If a constraint is present, analyze the bounds to catch
7180 -- premature usage of the derived literals.
7182 if Nkind (Indic) = N_Subtype_Indication
7183 and then Nkind (Range_Expression (Constraint (Indic))) = N_Range
7185 Analyze (Low_Bound (Range_Expression (Constraint (Indic))));
7186 Analyze (High_Bound (Range_Expression (Constraint (Indic))));
7189 -- Introduce an implicit base type for the derived type even if there
7190 -- is no constraint attached to it, since this seems closer to the
7191 -- Ada semantics. Build a full type declaration tree for the derived
7192 -- type using the implicit base type as the defining identifier. The
7193 -- build a subtype declaration tree which applies the constraint (if
7194 -- any) have it replace the derived type declaration.
7196 Literal := First_Literal (Parent_Type);
7197 Literals_List := New_List;
7198 while Present (Literal)
7199 and then Ekind (Literal) = E_Enumeration_Literal
7201 -- Literals of the derived type have the same representation as
7202 -- those of the parent type, but this representation can be
7203 -- overridden by an explicit representation clause. Indicate
7204 -- that there is no explicit representation given yet. These
7205 -- derived literals are implicit operations of the new type,
7206 -- and can be overridden by explicit ones.
7208 if Nkind (Literal) = N_Defining_Character_Literal then
7210 Make_Defining_Character_Literal (Loc, Chars (Literal));
7212 New_Lit := Make_Defining_Identifier (Loc, Chars (Literal));
7215 Set_Ekind (New_Lit, E_Enumeration_Literal);
7216 Set_Enumeration_Pos (New_Lit, Enumeration_Pos (Literal));
7217 Set_Enumeration_Rep (New_Lit, Enumeration_Rep (Literal));
7218 Set_Enumeration_Rep_Expr (New_Lit, Empty);
7219 Set_Alias (New_Lit, Literal);
7220 Set_Is_Known_Valid (New_Lit, True);
7222 Append (New_Lit, Literals_List);
7223 Next_Literal (Literal);
7227 Make_Defining_Identifier (Sloc (Derived_Type),
7228 Chars => New_External_Name (Chars (Derived_Type), 'B'));
7230 -- Indicate the proper nature of the derived type. This must be done
7231 -- before analysis of the literals, to recognize cases when a literal
7232 -- may be hidden by a previous explicit function definition (cf.
7235 Set_Ekind (Derived_Type, E_Enumeration_Subtype);
7236 Set_Etype (Derived_Type, Implicit_Base);
7239 Make_Full_Type_Declaration (Loc,
7240 Defining_Identifier => Implicit_Base,
7241 Discriminant_Specifications => No_List,
7243 Make_Enumeration_Type_Definition (Loc, Literals_List));
7245 Mark_Rewrite_Insertion (Type_Decl);
7246 Insert_Before (N, Type_Decl);
7247 Analyze (Type_Decl);
7249 -- The anonymous base now has a full declaration, but this base
7250 -- is not a first subtype.
7252 Set_Is_First_Subtype (Implicit_Base, False);
7254 -- After the implicit base is analyzed its Etype needs to be changed
7255 -- to reflect the fact that it is derived from the parent type which
7256 -- was ignored during analysis. We also set the size at this point.
7258 Set_Etype (Implicit_Base, Parent_Type);
7260 Set_Size_Info (Implicit_Base, Parent_Type);
7261 Set_RM_Size (Implicit_Base, RM_Size (Parent_Type));
7262 Set_First_Rep_Item (Implicit_Base, First_Rep_Item (Parent_Type));
7264 -- Copy other flags from parent type
7266 Set_Has_Non_Standard_Rep
7267 (Implicit_Base, Has_Non_Standard_Rep
7269 Set_Has_Pragma_Ordered
7270 (Implicit_Base, Has_Pragma_Ordered
7272 Set_Has_Delayed_Freeze (Implicit_Base);
7274 -- Process the subtype indication including a validation check on the
7275 -- constraint, if any. If a constraint is given, its bounds must be
7276 -- implicitly converted to the new type.
7278 if Nkind (Indic) = N_Subtype_Indication then
7280 R : constant Node_Id :=
7281 Range_Expression (Constraint (Indic));
7284 if Nkind (R) = N_Range then
7285 Hi := Build_Scalar_Bound
7286 (High_Bound (R), Parent_Type, Implicit_Base);
7287 Lo := Build_Scalar_Bound
7288 (Low_Bound (R), Parent_Type, Implicit_Base);
7291 -- Constraint is a Range attribute. Replace with explicit
7292 -- mention of the bounds of the prefix, which must be a
7295 Analyze (Prefix (R));
7297 Convert_To (Implicit_Base,
7298 Make_Attribute_Reference (Loc,
7299 Attribute_Name => Name_Last,
7301 New_Occurrence_Of (Entity (Prefix (R)), Loc)));
7304 Convert_To (Implicit_Base,
7305 Make_Attribute_Reference (Loc,
7306 Attribute_Name => Name_First,
7308 New_Occurrence_Of (Entity (Prefix (R)), Loc)));
7315 (Type_High_Bound (Parent_Type),
7316 Parent_Type, Implicit_Base);
7319 (Type_Low_Bound (Parent_Type),
7320 Parent_Type, Implicit_Base);
7328 -- If we constructed a default range for the case where no range
7329 -- was given, then the expressions in the range must not freeze
7330 -- since they do not correspond to expressions in the source.
7331 -- However, if the type inherits predicates the expressions will
7332 -- be elaborated earlier and must freeze.
7334 if Nkind (Indic) /= N_Subtype_Indication
7335 and then not Has_Predicates (Derived_Type)
7337 Set_Must_Not_Freeze (Lo);
7338 Set_Must_Not_Freeze (Hi);
7339 Set_Must_Not_Freeze (Rang_Expr);
7343 Make_Subtype_Declaration (Loc,
7344 Defining_Identifier => Derived_Type,
7345 Subtype_Indication =>
7346 Make_Subtype_Indication (Loc,
7347 Subtype_Mark => New_Occurrence_Of (Implicit_Base, Loc),
7349 Make_Range_Constraint (Loc,
7350 Range_Expression => Rang_Expr))));
7354 -- Propagate the aspects from the original type declaration to the
7355 -- declaration of the implicit base.
7357 Move_Aspects (From => Original_Node (N), To => Type_Decl);
7359 -- Apply a range check. Since this range expression doesn't have an
7360 -- Etype, we have to specifically pass the Source_Typ parameter. Is
7363 if Nkind (Indic) = N_Subtype_Indication then
7365 (Range_Expression (Constraint (Indic)), Parent_Type,
7366 Source_Typ => Entity (Subtype_Mark (Indic)));
7369 end Build_Derived_Enumeration_Type;
7371 --------------------------------
7372 -- Build_Derived_Numeric_Type --
7373 --------------------------------
7375 procedure Build_Derived_Numeric_Type
7377 Parent_Type : Entity_Id;
7378 Derived_Type : Entity_Id)
7380 Loc : constant Source_Ptr := Sloc (N);
7381 Tdef : constant Node_Id := Type_Definition (N);
7382 Indic : constant Node_Id := Subtype_Indication (Tdef);
7383 Parent_Base : constant Entity_Id := Base_Type (Parent_Type);
7384 No_Constraint : constant Boolean := Nkind (Indic) /=
7385 N_Subtype_Indication;
7386 Implicit_Base : Entity_Id;
7392 -- Process the subtype indication including a validation check on
7393 -- the constraint if any.
7395 Discard_Node (Process_Subtype (Indic, N));
7397 -- Introduce an implicit base type for the derived type even if there
7398 -- is no constraint attached to it, since this seems closer to the Ada
7402 Create_Itype (Ekind (Parent_Base), N, Derived_Type, 'B');
7404 Set_Etype (Implicit_Base, Parent_Base);
7405 Set_Ekind (Implicit_Base, Ekind (Parent_Base));
7406 Set_Size_Info (Implicit_Base, Parent_Base);
7407 Set_First_Rep_Item (Implicit_Base, First_Rep_Item (Parent_Base));
7408 Set_Parent (Implicit_Base, Parent (Derived_Type));
7409 Set_Is_Known_Valid (Implicit_Base, Is_Known_Valid (Parent_Base));
7411 -- Set RM Size for discrete type or decimal fixed-point type
7412 -- Ordinary fixed-point is excluded, why???
7414 if Is_Discrete_Type (Parent_Base)
7415 or else Is_Decimal_Fixed_Point_Type (Parent_Base)
7417 Set_RM_Size (Implicit_Base, RM_Size (Parent_Base));
7420 Set_Has_Delayed_Freeze (Implicit_Base);
7422 Lo := New_Copy_Tree (Type_Low_Bound (Parent_Base));
7423 Hi := New_Copy_Tree (Type_High_Bound (Parent_Base));
7425 Set_Scalar_Range (Implicit_Base,
7430 if Has_Infinities (Parent_Base) then
7431 Set_Includes_Infinities (Scalar_Range (Implicit_Base));
7434 -- The Derived_Type, which is the entity of the declaration, is a
7435 -- subtype of the implicit base. Its Ekind is a subtype, even in the
7436 -- absence of an explicit constraint.
7438 Set_Etype (Derived_Type, Implicit_Base);
7440 -- If we did not have a constraint, then the Ekind is set from the
7441 -- parent type (otherwise Process_Subtype has set the bounds)
7443 if No_Constraint then
7444 Set_Ekind (Derived_Type, Subtype_Kind (Ekind (Parent_Type)));
7447 -- If we did not have a range constraint, then set the range from the
7448 -- parent type. Otherwise, the Process_Subtype call has set the bounds.
7450 if No_Constraint or else not Has_Range_Constraint (Indic) then
7451 Set_Scalar_Range (Derived_Type,
7453 Low_Bound => New_Copy_Tree (Type_Low_Bound (Parent_Type)),
7454 High_Bound => New_Copy_Tree (Type_High_Bound (Parent_Type))));
7455 Set_Is_Constrained (Derived_Type, Is_Constrained (Parent_Type));
7457 if Has_Infinities (Parent_Type) then
7458 Set_Includes_Infinities (Scalar_Range (Derived_Type));
7461 Set_Is_Known_Valid (Derived_Type, Is_Known_Valid (Parent_Type));
7464 Set_Is_Descendant_Of_Address (Derived_Type,
7465 Is_Descendant_Of_Address (Parent_Type));
7466 Set_Is_Descendant_Of_Address (Implicit_Base,
7467 Is_Descendant_Of_Address (Parent_Type));
7469 -- Set remaining type-specific fields, depending on numeric type
7471 if Is_Modular_Integer_Type (Parent_Type) then
7472 Set_Modulus (Implicit_Base, Modulus (Parent_Base));
7474 Set_Non_Binary_Modulus
7475 (Implicit_Base, Non_Binary_Modulus (Parent_Base));
7478 (Implicit_Base, Is_Known_Valid (Parent_Base));
7480 elsif Is_Floating_Point_Type (Parent_Type) then
7482 -- Digits of base type is always copied from the digits value of
7483 -- the parent base type, but the digits of the derived type will
7484 -- already have been set if there was a constraint present.
7486 Set_Digits_Value (Implicit_Base, Digits_Value (Parent_Base));
7487 Set_Float_Rep (Implicit_Base, Float_Rep (Parent_Base));
7489 if No_Constraint then
7490 Set_Digits_Value (Derived_Type, Digits_Value (Parent_Type));
7493 elsif Is_Fixed_Point_Type (Parent_Type) then
7495 -- Small of base type and derived type are always copied from the
7496 -- parent base type, since smalls never change. The delta of the
7497 -- base type is also copied from the parent base type. However the
7498 -- delta of the derived type will have been set already if a
7499 -- constraint was present.
7501 Set_Small_Value (Derived_Type, Small_Value (Parent_Base));
7502 Set_Small_Value (Implicit_Base, Small_Value (Parent_Base));
7503 Set_Delta_Value (Implicit_Base, Delta_Value (Parent_Base));
7505 if No_Constraint then
7506 Set_Delta_Value (Derived_Type, Delta_Value (Parent_Type));
7509 -- The scale and machine radix in the decimal case are always
7510 -- copied from the parent base type.
7512 if Is_Decimal_Fixed_Point_Type (Parent_Type) then
7513 Set_Scale_Value (Derived_Type, Scale_Value (Parent_Base));
7514 Set_Scale_Value (Implicit_Base, Scale_Value (Parent_Base));
7516 Set_Machine_Radix_10
7517 (Derived_Type, Machine_Radix_10 (Parent_Base));
7518 Set_Machine_Radix_10
7519 (Implicit_Base, Machine_Radix_10 (Parent_Base));
7521 Set_Digits_Value (Implicit_Base, Digits_Value (Parent_Base));
7523 if No_Constraint then
7524 Set_Digits_Value (Derived_Type, Digits_Value (Parent_Base));
7527 -- the analysis of the subtype_indication sets the
7528 -- digits value of the derived type.
7535 if Is_Integer_Type (Parent_Type) then
7536 Set_Has_Shift_Operator
7537 (Implicit_Base, Has_Shift_Operator (Parent_Type));
7540 -- The type of the bounds is that of the parent type, and they
7541 -- must be converted to the derived type.
7543 Convert_Scalar_Bounds (N, Parent_Type, Derived_Type, Loc);
7545 -- The implicit_base should be frozen when the derived type is frozen,
7546 -- but note that it is used in the conversions of the bounds. For fixed
7547 -- types we delay the determination of the bounds until the proper
7548 -- freezing point. For other numeric types this is rejected by GCC, for
7549 -- reasons that are currently unclear (???), so we choose to freeze the
7550 -- implicit base now. In the case of integers and floating point types
7551 -- this is harmless because subsequent representation clauses cannot
7552 -- affect anything, but it is still baffling that we cannot use the
7553 -- same mechanism for all derived numeric types.
7555 -- There is a further complication: actually some representation
7556 -- clauses can affect the implicit base type. For example, attribute
7557 -- definition clauses for stream-oriented attributes need to set the
7558 -- corresponding TSS entries on the base type, and this normally
7559 -- cannot be done after the base type is frozen, so the circuitry in
7560 -- Sem_Ch13.New_Stream_Subprogram must account for this possibility
7561 -- and not use Set_TSS in this case.
7563 -- There are also consequences for the case of delayed representation
7564 -- aspects for some cases. For example, a Size aspect is delayed and
7565 -- should not be evaluated to the freeze point. This early freezing
7566 -- means that the size attribute evaluation happens too early???
7568 if Is_Fixed_Point_Type (Parent_Type) then
7569 Conditional_Delay (Implicit_Base, Parent_Type);
7571 Freeze_Before (N, Implicit_Base);
7573 end Build_Derived_Numeric_Type;
7575 --------------------------------
7576 -- Build_Derived_Private_Type --
7577 --------------------------------
7579 procedure Build_Derived_Private_Type
7581 Parent_Type : Entity_Id;
7582 Derived_Type : Entity_Id;
7583 Is_Completion : Boolean;
7584 Derive_Subps : Boolean := True)
7586 Loc : constant Source_Ptr := Sloc (N);
7587 Par_Base : constant Entity_Id := Base_Type (Parent_Type);
7588 Par_Scope : constant Entity_Id := Scope (Par_Base);
7589 Full_N : constant Node_Id := New_Copy_Tree (N);
7590 Full_Der : Entity_Id := New_Copy (Derived_Type);
7593 procedure Build_Full_Derivation;
7594 -- Build full derivation, i.e. derive from the full view
7596 procedure Copy_And_Build;
7597 -- Copy derived type declaration, replace parent with its full view,
7598 -- and build derivation
7600 ---------------------------
7601 -- Build_Full_Derivation --
7602 ---------------------------
7604 procedure Build_Full_Derivation is
7606 -- If parent scope is not open, install the declarations
7608 if not In_Open_Scopes (Par_Scope) then
7609 Install_Private_Declarations (Par_Scope);
7610 Install_Visible_Declarations (Par_Scope);
7612 Uninstall_Declarations (Par_Scope);
7614 -- If parent scope is open and in another unit, and parent has a
7615 -- completion, then the derivation is taking place in the visible
7616 -- part of a child unit. In that case retrieve the full view of
7617 -- the parent momentarily.
7619 elsif not In_Same_Source_Unit (N, Parent_Type) then
7620 Full_P := Full_View (Parent_Type);
7621 Exchange_Declarations (Parent_Type);
7623 Exchange_Declarations (Full_P);
7625 -- Otherwise it is a local derivation
7630 end Build_Full_Derivation;
7632 --------------------
7633 -- Copy_And_Build --
7634 --------------------
7636 procedure Copy_And_Build is
7637 Full_Parent : Entity_Id := Parent_Type;
7640 -- If the parent is itself derived from another private type,
7641 -- installing the private declarations has not affected its
7642 -- privacy status, so use its own full view explicitly.
7644 if Is_Private_Type (Full_Parent)
7645 and then Present (Full_View (Full_Parent))
7647 Full_Parent := Full_View (Full_Parent);
7650 -- And its underlying full view if necessary
7652 if Is_Private_Type (Full_Parent)
7653 and then Present (Underlying_Full_View (Full_Parent))
7655 Full_Parent := Underlying_Full_View (Full_Parent);
7658 -- For record, access and most enumeration types, derivation from
7659 -- the full view requires a fully-fledged declaration. In the other
7660 -- cases, just use an itype.
7662 if Ekind (Full_Parent) in Record_Kind
7663 or else Ekind (Full_Parent) in Access_Kind
7665 (Ekind (Full_Parent) in Enumeration_Kind
7666 and then not Is_Standard_Character_Type (Full_Parent)
7667 and then not Is_Generic_Type (Root_Type (Full_Parent)))
7669 -- Copy and adjust declaration to provide a completion for what
7670 -- is originally a private declaration. Indicate that full view
7671 -- is internally generated.
7673 Set_Comes_From_Source (Full_N, False);
7674 Set_Comes_From_Source (Full_Der, False);
7675 Set_Parent (Full_Der, Full_N);
7676 Set_Defining_Identifier (Full_N, Full_Der);
7678 -- If there are no constraints, adjust the subtype mark
7680 if Nkind (Subtype_Indication (Type_Definition (Full_N))) /=
7681 N_Subtype_Indication
7683 Set_Subtype_Indication
7684 (Type_Definition (Full_N),
7685 New_Occurrence_Of (Full_Parent, Sloc (Full_N)));
7688 Insert_After (N, Full_N);
7690 -- Build full view of derived type from full view of parent which
7691 -- is now installed. Subprograms have been derived on the partial
7692 -- view, the completion does not derive them anew.
7694 if Ekind (Full_Parent) in Record_Kind then
7696 -- If parent type is tagged, the completion inherits the proper
7697 -- primitive operations.
7699 if Is_Tagged_Type (Parent_Type) then
7700 Build_Derived_Record_Type
7701 (Full_N, Full_Parent, Full_Der, Derive_Subps);
7703 Build_Derived_Record_Type
7704 (Full_N, Full_Parent, Full_Der, Derive_Subps => False);
7709 (Full_N, Full_Parent, Full_Der,
7710 Is_Completion => False, Derive_Subps => False);
7713 -- The full declaration has been introduced into the tree and
7714 -- processed in the step above. It should not be analyzed again
7715 -- (when encountered later in the current list of declarations)
7716 -- to prevent spurious name conflicts. The full entity remains
7719 Set_Analyzed (Full_N);
7723 Make_Defining_Identifier (Sloc (Derived_Type),
7724 Chars => Chars (Derived_Type));
7725 Set_Is_Itype (Full_Der);
7726 Set_Associated_Node_For_Itype (Full_Der, N);
7727 Set_Parent (Full_Der, N);
7729 (N, Full_Parent, Full_Der,
7730 Is_Completion => False, Derive_Subps => False);
7733 Set_Has_Private_Declaration (Full_Der);
7734 Set_Has_Private_Declaration (Derived_Type);
7736 Set_Scope (Full_Der, Scope (Derived_Type));
7737 Set_Is_First_Subtype (Full_Der, Is_First_Subtype (Derived_Type));
7738 Set_Has_Size_Clause (Full_Der, False);
7739 Set_Has_Alignment_Clause (Full_Der, False);
7740 Set_Has_Delayed_Freeze (Full_Der);
7741 Set_Is_Frozen (Full_Der, False);
7742 Set_Freeze_Node (Full_Der, Empty);
7743 Set_Depends_On_Private (Full_Der, Has_Private_Component (Full_Der));
7744 Set_Is_Public (Full_Der, Is_Public (Derived_Type));
7746 -- The convention on the base type may be set in the private part
7747 -- and not propagated to the subtype until later, so we obtain the
7748 -- convention from the base type of the parent.
7750 Set_Convention (Full_Der, Convention (Base_Type (Full_Parent)));
7753 -- Start of processing for Build_Derived_Private_Type
7756 if Is_Tagged_Type (Parent_Type) then
7757 Full_P := Full_View (Parent_Type);
7759 -- A type extension of a type with unknown discriminants is an
7760 -- indefinite type that the back-end cannot handle directly.
7761 -- We treat it as a private type, and build a completion that is
7762 -- derived from the full view of the parent, and hopefully has
7763 -- known discriminants.
7765 -- If the full view of the parent type has an underlying record view,
7766 -- use it to generate the underlying record view of this derived type
7767 -- (required for chains of derivations with unknown discriminants).
7769 -- Minor optimization: we avoid the generation of useless underlying
7770 -- record view entities if the private type declaration has unknown
7771 -- discriminants but its corresponding full view has no
7774 if Has_Unknown_Discriminants (Parent_Type)
7775 and then Present (Full_P)
7776 and then (Has_Discriminants (Full_P)
7777 or else Present (Underlying_Record_View (Full_P)))
7778 and then not In_Open_Scopes (Par_Scope)
7779 and then Expander_Active
7782 Full_Der : constant Entity_Id := Make_Temporary (Loc, 'T');
7783 New_Ext : constant Node_Id :=
7785 (Record_Extension_Part (Type_Definition (N)));
7789 Build_Derived_Record_Type
7790 (N, Parent_Type, Derived_Type, Derive_Subps);
7792 -- Build anonymous completion, as a derivation from the full
7793 -- view of the parent. This is not a completion in the usual
7794 -- sense, because the current type is not private.
7797 Make_Full_Type_Declaration (Loc,
7798 Defining_Identifier => Full_Der,
7800 Make_Derived_Type_Definition (Loc,
7801 Subtype_Indication =>
7803 (Subtype_Indication (Type_Definition (N))),
7804 Record_Extension_Part => New_Ext));
7806 -- If the parent type has an underlying record view, use it
7807 -- here to build the new underlying record view.
7809 if Present (Underlying_Record_View (Full_P)) then
7811 (Nkind (Subtype_Indication (Type_Definition (Decl)))
7813 Set_Entity (Subtype_Indication (Type_Definition (Decl)),
7814 Underlying_Record_View (Full_P));
7817 Install_Private_Declarations (Par_Scope);
7818 Install_Visible_Declarations (Par_Scope);
7819 Insert_Before (N, Decl);
7821 -- Mark entity as an underlying record view before analysis,
7822 -- to avoid generating the list of its primitive operations
7823 -- (which is not really required for this entity) and thus
7824 -- prevent spurious errors associated with missing overriding
7825 -- of abstract primitives (overridden only for Derived_Type).
7827 Set_Ekind (Full_Der, E_Record_Type);
7828 Set_Is_Underlying_Record_View (Full_Der);
7829 Set_Default_SSO (Full_Der);
7830 Set_No_Reordering (Full_Der, No_Component_Reordering);
7834 pragma Assert (Has_Discriminants (Full_Der)
7835 and then not Has_Unknown_Discriminants (Full_Der));
7837 Uninstall_Declarations (Par_Scope);
7839 -- Freeze the underlying record view, to prevent generation of
7840 -- useless dispatching information, which is simply shared with
7841 -- the real derived type.
7843 Set_Is_Frozen (Full_Der);
7845 -- If the derived type has access discriminants, create
7846 -- references to their anonymous types now, to prevent
7847 -- back-end problems when their first use is in generated
7848 -- bodies of primitives.
7854 E := First_Entity (Full_Der);
7856 while Present (E) loop
7857 if Ekind (E) = E_Discriminant
7858 and then Ekind (Etype (E)) = E_Anonymous_Access_Type
7860 Build_Itype_Reference (Etype (E), Decl);
7867 -- Set up links between real entity and underlying record view
7869 Set_Underlying_Record_View (Derived_Type, Base_Type (Full_Der));
7870 Set_Underlying_Record_View (Base_Type (Full_Der), Derived_Type);
7873 -- If discriminants are known, build derived record
7876 Build_Derived_Record_Type
7877 (N, Parent_Type, Derived_Type, Derive_Subps);
7882 elsif Has_Discriminants (Parent_Type) then
7884 -- Build partial view of derived type from partial view of parent.
7885 -- This must be done before building the full derivation because the
7886 -- second derivation will modify the discriminants of the first and
7887 -- the discriminants are chained with the rest of the components in
7888 -- the full derivation.
7890 Build_Derived_Record_Type
7891 (N, Parent_Type, Derived_Type, Derive_Subps);
7893 -- Build the full derivation if this is not the anonymous derived
7894 -- base type created by Build_Derived_Record_Type in the constrained
7895 -- case (see point 5. of its head comment) since we build it for the
7896 -- derived subtype. And skip it for synchronized types altogether, as
7897 -- gigi does not use these types directly.
7899 if Present (Full_View (Parent_Type))
7900 and then not Is_Itype (Derived_Type)
7901 and then not Is_Concurrent_Type (Full_View (Parent_Type))
7904 Der_Base : constant Entity_Id := Base_Type (Derived_Type);
7906 Last_Discr : Entity_Id;
7909 -- If this is not a completion, construct the implicit full
7910 -- view by deriving from the full view of the parent type.
7911 -- But if this is a completion, the derived private type
7912 -- being built is a full view and the full derivation can
7913 -- only be its underlying full view.
7915 Build_Full_Derivation;
7917 if not Is_Completion then
7918 Set_Full_View (Derived_Type, Full_Der);
7920 Set_Underlying_Full_View (Derived_Type, Full_Der);
7921 Set_Is_Underlying_Full_View (Full_Der);
7924 if not Is_Base_Type (Derived_Type) then
7925 Set_Full_View (Der_Base, Base_Type (Full_Der));
7928 -- Copy the discriminant list from full view to the partial
7929 -- view (base type and its subtype). Gigi requires that the
7930 -- partial and full views have the same discriminants.
7932 -- Note that since the partial view points to discriminants
7933 -- in the full view, their scope will be that of the full
7934 -- view. This might cause some front end problems and need
7937 Discr := First_Discriminant (Base_Type (Full_Der));
7938 Set_First_Entity (Der_Base, Discr);
7941 Last_Discr := Discr;
7942 Next_Discriminant (Discr);
7943 exit when No (Discr);
7946 Set_Last_Entity (Der_Base, Last_Discr);
7947 Set_First_Entity (Derived_Type, First_Entity (Der_Base));
7948 Set_Last_Entity (Derived_Type, Last_Entity (Der_Base));
7952 elsif Present (Full_View (Parent_Type))
7953 and then Has_Discriminants (Full_View (Parent_Type))
7955 if Has_Unknown_Discriminants (Parent_Type)
7956 and then Nkind (Subtype_Indication (Type_Definition (N))) =
7957 N_Subtype_Indication
7960 ("cannot constrain type with unknown discriminants",
7961 Subtype_Indication (Type_Definition (N)));
7965 -- If this is not a completion, construct the implicit full view by
7966 -- deriving from the full view of the parent type. But if this is a
7967 -- completion, the derived private type being built is a full view
7968 -- and the full derivation can only be its underlying full view.
7970 Build_Full_Derivation;
7972 if not Is_Completion then
7973 Set_Full_View (Derived_Type, Full_Der);
7975 Set_Underlying_Full_View (Derived_Type, Full_Der);
7976 Set_Is_Underlying_Full_View (Full_Der);
7979 -- In any case, the primitive operations are inherited from the
7980 -- parent type, not from the internal full view.
7982 Set_Etype (Base_Type (Derived_Type), Base_Type (Parent_Type));
7984 if Derive_Subps then
7985 Derive_Subprograms (Parent_Type, Derived_Type);
7988 Set_Stored_Constraint (Derived_Type, No_Elist);
7990 (Derived_Type, Is_Constrained (Full_View (Parent_Type)));
7993 -- Untagged type, No discriminants on either view
7995 if Nkind (Subtype_Indication (Type_Definition (N))) =
7996 N_Subtype_Indication
7999 ("illegal constraint on type without discriminants", N);
8002 if Present (Discriminant_Specifications (N))
8003 and then Present (Full_View (Parent_Type))
8004 and then not Is_Tagged_Type (Full_View (Parent_Type))
8006 Error_Msg_N ("cannot add discriminants to untagged type", N);
8009 Set_Stored_Constraint (Derived_Type, No_Elist);
8010 Set_Is_Constrained (Derived_Type, Is_Constrained (Parent_Type));
8012 Set_Is_Controlled_Active
8013 (Derived_Type, Is_Controlled_Active (Parent_Type));
8015 Set_Disable_Controlled
8016 (Derived_Type, Disable_Controlled (Parent_Type));
8018 Set_Has_Controlled_Component
8019 (Derived_Type, Has_Controlled_Component (Parent_Type));
8021 -- Direct controlled types do not inherit Finalize_Storage_Only flag
8023 if not Is_Controlled (Parent_Type) then
8024 Set_Finalize_Storage_Only
8025 (Base_Type (Derived_Type), Finalize_Storage_Only (Parent_Type));
8028 -- If this is not a completion, construct the implicit full view by
8029 -- deriving from the full view of the parent type.
8031 -- ??? If the parent is untagged private and its completion is
8032 -- tagged, this mechanism will not work because we cannot derive from
8033 -- the tagged full view unless we have an extension.
8035 if Present (Full_View (Parent_Type))
8036 and then not Is_Tagged_Type (Full_View (Parent_Type))
8037 and then not Is_Completion
8039 Build_Full_Derivation;
8040 Set_Full_View (Derived_Type, Full_Der);
8044 Set_Has_Unknown_Discriminants (Derived_Type,
8045 Has_Unknown_Discriminants (Parent_Type));
8047 if Is_Private_Type (Derived_Type) then
8048 Set_Private_Dependents (Derived_Type, New_Elmt_List);
8051 -- If the parent base type is in scope, add the derived type to its
8052 -- list of private dependents, because its full view may become
8053 -- visible subsequently (in a nested private part, a body, or in a
8054 -- further child unit).
8056 if Is_Private_Type (Par_Base) and then In_Open_Scopes (Par_Scope) then
8057 Append_Elmt (Derived_Type, Private_Dependents (Parent_Type));
8059 -- Check for unusual case where a type completed by a private
8060 -- derivation occurs within a package nested in a child unit, and
8061 -- the parent is declared in an ancestor.
8063 if Is_Child_Unit (Scope (Current_Scope))
8064 and then Is_Completion
8065 and then In_Private_Part (Current_Scope)
8066 and then Scope (Parent_Type) /= Current_Scope
8068 -- Note that if the parent has a completion in the private part,
8069 -- (which is itself a derivation from some other private type)
8070 -- it is that completion that is visible, there is no full view
8071 -- available, and no special processing is needed.
8073 and then Present (Full_View (Parent_Type))
8075 -- In this case, the full view of the parent type will become
8076 -- visible in the body of the enclosing child, and only then will
8077 -- the current type be possibly non-private. Build an underlying
8078 -- full view that will be installed when the enclosing child body
8081 if Present (Underlying_Full_View (Derived_Type)) then
8082 Full_Der := Underlying_Full_View (Derived_Type);
8084 Build_Full_Derivation;
8085 Set_Underlying_Full_View (Derived_Type, Full_Der);
8086 Set_Is_Underlying_Full_View (Full_Der);
8089 -- The full view will be used to swap entities on entry/exit to
8090 -- the body, and must appear in the entity list for the package.
8092 Append_Entity (Full_Der, Scope (Derived_Type));
8095 end Build_Derived_Private_Type;
8097 -------------------------------
8098 -- Build_Derived_Record_Type --
8099 -------------------------------
8103 -- Ideally we would like to use the same model of type derivation for
8104 -- tagged and untagged record types. Unfortunately this is not quite
8105 -- possible because the semantics of representation clauses is different
8106 -- for tagged and untagged records under inheritance. Consider the
8109 -- type R (...) is [tagged] record ... end record;
8110 -- type T (...) is new R (...) [with ...];
8112 -- The representation clauses for T can specify a completely different
8113 -- record layout from R's. Hence the same component can be placed in two
8114 -- very different positions in objects of type T and R. If R and T are
8115 -- tagged types, representation clauses for T can only specify the layout
8116 -- of non inherited components, thus components that are common in R and T
8117 -- have the same position in objects of type R and T.
8119 -- This has two implications. The first is that the entire tree for R's
8120 -- declaration needs to be copied for T in the untagged case, so that T
8121 -- can be viewed as a record type of its own with its own representation
8122 -- clauses. The second implication is the way we handle discriminants.
8123 -- Specifically, in the untagged case we need a way to communicate to Gigi
8124 -- what are the real discriminants in the record, while for the semantics
8125 -- we need to consider those introduced by the user to rename the
8126 -- discriminants in the parent type. This is handled by introducing the
8127 -- notion of stored discriminants. See below for more.
8129 -- Fortunately the way regular components are inherited can be handled in
8130 -- the same way in tagged and untagged types.
8132 -- To complicate things a bit more the private view of a private extension
8133 -- cannot be handled in the same way as the full view (for one thing the
8134 -- semantic rules are somewhat different). We will explain what differs
8137 -- 2. DISCRIMINANTS UNDER INHERITANCE
8139 -- The semantic rules governing the discriminants of derived types are
8142 -- type Derived_Type_Name [KNOWN_DISCRIMINANT_PART] is new
8143 -- [abstract] Parent_Type_Name [CONSTRAINT] [RECORD_EXTENSION_PART]
8145 -- If parent type has discriminants, then the discriminants that are
8146 -- declared in the derived type are [3.4 (11)]:
8148 -- o The discriminants specified by a new KNOWN_DISCRIMINANT_PART, if
8151 -- o Otherwise, each discriminant of the parent type (implicitly declared
8152 -- in the same order with the same specifications). In this case, the
8153 -- discriminants are said to be "inherited", or if unknown in the parent
8154 -- are also unknown in the derived type.
8156 -- Furthermore if a KNOWN_DISCRIMINANT_PART is provided, then [3.7(13-18)]:
8158 -- o The parent subtype must be constrained;
8160 -- o If the parent type is not a tagged type, then each discriminant of
8161 -- the derived type must be used in the constraint defining a parent
8162 -- subtype. [Implementation note: This ensures that the new discriminant
8163 -- can share storage with an existing discriminant.]
8165 -- For the derived type each discriminant of the parent type is either
8166 -- inherited, constrained to equal some new discriminant of the derived
8167 -- type, or constrained to the value of an expression.
8169 -- When inherited or constrained to equal some new discriminant, the
8170 -- parent discriminant and the discriminant of the derived type are said
8173 -- If a discriminant of the parent type is constrained to a specific value
8174 -- in the derived type definition, then the discriminant is said to be
8175 -- "specified" by that derived type definition.
8177 -- 3. DISCRIMINANTS IN DERIVED UNTAGGED RECORD TYPES
8179 -- We have spoken about stored discriminants in point 1 (introduction)
8180 -- above. There are two sorts of stored discriminants: implicit and
8181 -- explicit. As long as the derived type inherits the same discriminants as
8182 -- the root record type, stored discriminants are the same as regular
8183 -- discriminants, and are said to be implicit. However, if any discriminant
8184 -- in the root type was renamed in the derived type, then the derived
8185 -- type will contain explicit stored discriminants. Explicit stored
8186 -- discriminants are discriminants in addition to the semantically visible
8187 -- discriminants defined for the derived type. Stored discriminants are
8188 -- used by Gigi to figure out what are the physical discriminants in
8189 -- objects of the derived type (see precise definition in einfo.ads).
8190 -- As an example, consider the following:
8192 -- type R (D1, D2, D3 : Int) is record ... end record;
8193 -- type T1 is new R;
8194 -- type T2 (X1, X2: Int) is new T1 (X2, 88, X1);
8195 -- type T3 is new T2;
8196 -- type T4 (Y : Int) is new T3 (Y, 99);
8198 -- The following table summarizes the discriminants and stored
8199 -- discriminants in R and T1 through T4:
8201 -- Type Discrim Stored Discrim Comment
8202 -- R (D1, D2, D3) (D1, D2, D3) Girder discrims implicit in R
8203 -- T1 (D1, D2, D3) (D1, D2, D3) Girder discrims implicit in T1
8204 -- T2 (X1, X2) (D1, D2, D3) Girder discrims EXPLICIT in T2
8205 -- T3 (X1, X2) (D1, D2, D3) Girder discrims EXPLICIT in T3
8206 -- T4 (Y) (D1, D2, D3) Girder discrims EXPLICIT in T4
8208 -- Field Corresponding_Discriminant (abbreviated CD below) allows us to
8209 -- find the corresponding discriminant in the parent type, while
8210 -- Original_Record_Component (abbreviated ORC below) the actual physical
8211 -- component that is renamed. Finally the field Is_Completely_Hidden
8212 -- (abbreviated ICH below) is set for all explicit stored discriminants
8213 -- (see einfo.ads for more info). For the above example this gives:
8215 -- Discrim CD ORC ICH
8216 -- ^^^^^^^ ^^ ^^^ ^^^
8217 -- D1 in R empty itself no
8218 -- D2 in R empty itself no
8219 -- D3 in R empty itself no
8221 -- D1 in T1 D1 in R itself no
8222 -- D2 in T1 D2 in R itself no
8223 -- D3 in T1 D3 in R itself no
8225 -- X1 in T2 D3 in T1 D3 in T2 no
8226 -- X2 in T2 D1 in T1 D1 in T2 no
8227 -- D1 in T2 empty itself yes
8228 -- D2 in T2 empty itself yes
8229 -- D3 in T2 empty itself yes
8231 -- X1 in T3 X1 in T2 D3 in T3 no
8232 -- X2 in T3 X2 in T2 D1 in T3 no
8233 -- D1 in T3 empty itself yes
8234 -- D2 in T3 empty itself yes
8235 -- D3 in T3 empty itself yes
8237 -- Y in T4 X1 in T3 D3 in T4 no
8238 -- D1 in T4 empty itself yes
8239 -- D2 in T4 empty itself yes
8240 -- D3 in T4 empty itself yes
8242 -- 4. DISCRIMINANTS IN DERIVED TAGGED RECORD TYPES
8244 -- Type derivation for tagged types is fairly straightforward. If no
8245 -- discriminants are specified by the derived type, these are inherited
8246 -- from the parent. No explicit stored discriminants are ever necessary.
8247 -- The only manipulation that is done to the tree is that of adding a
8248 -- _parent field with parent type and constrained to the same constraint
8249 -- specified for the parent in the derived type definition. For instance:
8251 -- type R (D1, D2, D3 : Int) is tagged record ... end record;
8252 -- type T1 is new R with null record;
8253 -- type T2 (X1, X2: Int) is new T1 (X2, 88, X1) with null record;
8255 -- are changed into:
8257 -- type T1 (D1, D2, D3 : Int) is new R (D1, D2, D3) with record
8258 -- _parent : R (D1, D2, D3);
8261 -- type T2 (X1, X2: Int) is new T1 (X2, 88, X1) with record
8262 -- _parent : T1 (X2, 88, X1);
8265 -- The discriminants actually present in R, T1 and T2 as well as their CD,
8266 -- ORC and ICH fields are:
8268 -- Discrim CD ORC ICH
8269 -- ^^^^^^^ ^^ ^^^ ^^^
8270 -- D1 in R empty itself no
8271 -- D2 in R empty itself no
8272 -- D3 in R empty itself no
8274 -- D1 in T1 D1 in R D1 in R no
8275 -- D2 in T1 D2 in R D2 in R no
8276 -- D3 in T1 D3 in R D3 in R no
8278 -- X1 in T2 D3 in T1 D3 in R no
8279 -- X2 in T2 D1 in T1 D1 in R no
8281 -- 5. FIRST TRANSFORMATION FOR DERIVED RECORDS
8283 -- Regardless of whether we dealing with a tagged or untagged type
8284 -- we will transform all derived type declarations of the form
8286 -- type T is new R (...) [with ...];
8288 -- subtype S is R (...);
8289 -- type T is new S [with ...];
8291 -- type BT is new R [with ...];
8292 -- subtype T is BT (...);
8294 -- That is, the base derived type is constrained only if it has no
8295 -- discriminants. The reason for doing this is that GNAT's semantic model
8296 -- assumes that a base type with discriminants is unconstrained.
8298 -- Note that, strictly speaking, the above transformation is not always
8299 -- correct. Consider for instance the following excerpt from ACVC b34011a:
8301 -- procedure B34011A is
8302 -- type REC (D : integer := 0) is record
8307 -- type T6 is new Rec;
8308 -- function F return T6;
8313 -- type U is new T6 (Q6.F.I); -- ERROR: Q6.F.
8316 -- The definition of Q6.U is illegal. However transforming Q6.U into
8318 -- type BaseU is new T6;
8319 -- subtype U is BaseU (Q6.F.I)
8321 -- turns U into a legal subtype, which is incorrect. To avoid this problem
8322 -- we always analyze the constraint (in this case (Q6.F.I)) before applying
8323 -- the transformation described above.
8325 -- There is another instance where the above transformation is incorrect.
8329 -- type Base (D : Integer) is tagged null record;
8330 -- procedure P (X : Base);
8332 -- type Der is new Base (2) with null record;
8333 -- procedure P (X : Der);
8336 -- Then the above transformation turns this into
8338 -- type Der_Base is new Base with null record;
8339 -- -- procedure P (X : Base) is implicitly inherited here
8340 -- -- as procedure P (X : Der_Base).
8342 -- subtype Der is Der_Base (2);
8343 -- procedure P (X : Der);
8344 -- -- The overriding of P (X : Der_Base) is illegal since we
8345 -- -- have a parameter conformance problem.
8347 -- To get around this problem, after having semantically processed Der_Base
8348 -- and the rewritten subtype declaration for Der, we copy Der_Base field
8349 -- Discriminant_Constraint from Der so that when parameter conformance is
8350 -- checked when P is overridden, no semantic errors are flagged.
8352 -- 6. SECOND TRANSFORMATION FOR DERIVED RECORDS
8354 -- Regardless of whether we are dealing with a tagged or untagged type
8355 -- we will transform all derived type declarations of the form
8357 -- type R (D1, .., Dn : ...) is [tagged] record ...;
8358 -- type T is new R [with ...];
8360 -- type T (D1, .., Dn : ...) is new R (D1, .., Dn) [with ...];
8362 -- The reason for such transformation is that it allows us to implement a
8363 -- very clean form of component inheritance as explained below.
8365 -- Note that this transformation is not achieved by direct tree rewriting
8366 -- and manipulation, but rather by redoing the semantic actions that the
8367 -- above transformation will entail. This is done directly in routine
8368 -- Inherit_Components.
8370 -- 7. TYPE DERIVATION AND COMPONENT INHERITANCE
8372 -- In both tagged and untagged derived types, regular non discriminant
8373 -- components are inherited in the derived type from the parent type. In
8374 -- the absence of discriminants component, inheritance is straightforward
8375 -- as components can simply be copied from the parent.
8377 -- If the parent has discriminants, inheriting components constrained with
8378 -- these discriminants requires caution. Consider the following example:
8380 -- type R (D1, D2 : Positive) is [tagged] record
8381 -- S : String (D1 .. D2);
8384 -- type T1 is new R [with null record];
8385 -- type T2 (X : positive) is new R (1, X) [with null record];
8387 -- As explained in 6. above, T1 is rewritten as
8388 -- type T1 (D1, D2 : Positive) is new R (D1, D2) [with null record];
8389 -- which makes the treatment for T1 and T2 identical.
8391 -- What we want when inheriting S, is that references to D1 and D2 in R are
8392 -- replaced with references to their correct constraints, i.e. D1 and D2 in
8393 -- T1 and 1 and X in T2. So all R's discriminant references are replaced
8394 -- with either discriminant references in the derived type or expressions.
8395 -- This replacement is achieved as follows: before inheriting R's
8396 -- components, a subtype R (D1, D2) for T1 (resp. R (1, X) for T2) is
8397 -- created in the scope of T1 (resp. scope of T2) so that discriminants D1
8398 -- and D2 of T1 are visible (resp. discriminant X of T2 is visible).
8399 -- For T2, for instance, this has the effect of replacing String (D1 .. D2)
8400 -- by String (1 .. X).
8402 -- 8. TYPE DERIVATION IN PRIVATE TYPE EXTENSIONS
8404 -- We explain here the rules governing private type extensions relevant to
8405 -- type derivation. These rules are explained on the following example:
8407 -- type D [(...)] is new A [(...)] with private; <-- partial view
8408 -- type D [(...)] is new P [(...)] with null record; <-- full view
8410 -- Type A is called the ancestor subtype of the private extension.
8411 -- Type P is the parent type of the full view of the private extension. It
8412 -- must be A or a type derived from A.
8414 -- The rules concerning the discriminants of private type extensions are
8417 -- o If a private extension inherits known discriminants from the ancestor
8418 -- subtype, then the full view must also inherit its discriminants from
8419 -- the ancestor subtype and the parent subtype of the full view must be
8420 -- constrained if and only if the ancestor subtype is constrained.
8422 -- o If a partial view has unknown discriminants, then the full view may
8423 -- define a definite or an indefinite subtype, with or without
8426 -- o If a partial view has neither known nor unknown discriminants, then
8427 -- the full view must define a definite subtype.
8429 -- o If the ancestor subtype of a private extension has constrained
8430 -- discriminants, then the parent subtype of the full view must impose a
8431 -- statically matching constraint on those discriminants.
8433 -- This means that only the following forms of private extensions are
8436 -- type D is new A with private; <-- partial view
8437 -- type D is new P with null record; <-- full view
8439 -- If A has no discriminants than P has no discriminants, otherwise P must
8440 -- inherit A's discriminants.
8442 -- type D is new A (...) with private; <-- partial view
8443 -- type D is new P (:::) with null record; <-- full view
8445 -- P must inherit A's discriminants and (...) and (:::) must statically
8448 -- subtype A is R (...);
8449 -- type D is new A with private; <-- partial view
8450 -- type D is new P with null record; <-- full view
8452 -- P must have inherited R's discriminants and must be derived from A or
8453 -- any of its subtypes.
8455 -- type D (..) is new A with private; <-- partial view
8456 -- type D (..) is new P [(:::)] with null record; <-- full view
8458 -- No specific constraints on P's discriminants or constraint (:::).
8459 -- Note that A can be unconstrained, but the parent subtype P must either
8460 -- be constrained or (:::) must be present.
8462 -- type D (..) is new A [(...)] with private; <-- partial view
8463 -- type D (..) is new P [(:::)] with null record; <-- full view
8465 -- P's constraints on A's discriminants must statically match those
8466 -- imposed by (...).
8468 -- 9. IMPLEMENTATION OF TYPE DERIVATION FOR PRIVATE EXTENSIONS
8470 -- The full view of a private extension is handled exactly as described
8471 -- above. The model chose for the private view of a private extension is
8472 -- the same for what concerns discriminants (i.e. they receive the same
8473 -- treatment as in the tagged case). However, the private view of the
8474 -- private extension always inherits the components of the parent base,
8475 -- without replacing any discriminant reference. Strictly speaking this is
8476 -- incorrect. However, Gigi never uses this view to generate code so this
8477 -- is a purely semantic issue. In theory, a set of transformations similar
8478 -- to those given in 5. and 6. above could be applied to private views of
8479 -- private extensions to have the same model of component inheritance as
8480 -- for non private extensions. However, this is not done because it would
8481 -- further complicate private type processing. Semantically speaking, this
8482 -- leaves us in an uncomfortable situation. As an example consider:
8485 -- type R (D : integer) is tagged record
8486 -- S : String (1 .. D);
8488 -- procedure P (X : R);
8489 -- type T is new R (1) with private;
8491 -- type T is new R (1) with null record;
8494 -- This is transformed into:
8497 -- type R (D : integer) is tagged record
8498 -- S : String (1 .. D);
8500 -- procedure P (X : R);
8501 -- type T is new R (1) with private;
8503 -- type BaseT is new R with null record;
8504 -- subtype T is BaseT (1);
8507 -- (strictly speaking the above is incorrect Ada)
8509 -- From the semantic standpoint the private view of private extension T
8510 -- should be flagged as constrained since one can clearly have
8514 -- in a unit withing Pack. However, when deriving subprograms for the
8515 -- private view of private extension T, T must be seen as unconstrained
8516 -- since T has discriminants (this is a constraint of the current
8517 -- subprogram derivation model). Thus, when processing the private view of
8518 -- a private extension such as T, we first mark T as unconstrained, we
8519 -- process it, we perform program derivation and just before returning from
8520 -- Build_Derived_Record_Type we mark T as constrained.
8522 -- ??? Are there are other uncomfortable cases that we will have to
8525 -- 10. RECORD_TYPE_WITH_PRIVATE complications
8527 -- Types that are derived from a visible record type and have a private
8528 -- extension present other peculiarities. They behave mostly like private
8529 -- types, but if they have primitive operations defined, these will not
8530 -- have the proper signatures for further inheritance, because other
8531 -- primitive operations will use the implicit base that we define for
8532 -- private derivations below. This affect subprogram inheritance (see
8533 -- Derive_Subprograms for details). We also derive the implicit base from
8534 -- the base type of the full view, so that the implicit base is a record
8535 -- type and not another private type, This avoids infinite loops.
8537 procedure Build_Derived_Record_Type
8539 Parent_Type : Entity_Id;
8540 Derived_Type : Entity_Id;
8541 Derive_Subps : Boolean := True)
8543 Discriminant_Specs : constant Boolean :=
8544 Present (Discriminant_Specifications (N));
8545 Is_Tagged : constant Boolean := Is_Tagged_Type (Parent_Type);
8546 Loc : constant Source_Ptr := Sloc (N);
8547 Private_Extension : constant Boolean :=
8548 Nkind (N) = N_Private_Extension_Declaration;
8549 Assoc_List : Elist_Id;
8550 Constraint_Present : Boolean;
8552 Discrim : Entity_Id;
8554 Inherit_Discrims : Boolean := False;
8555 Last_Discrim : Entity_Id;
8556 New_Base : Entity_Id;
8558 New_Discrs : Elist_Id;
8559 New_Indic : Node_Id;
8560 Parent_Base : Entity_Id;
8561 Save_Etype : Entity_Id;
8562 Save_Discr_Constr : Elist_Id;
8563 Save_Next_Entity : Entity_Id;
8566 Discs : Elist_Id := New_Elmt_List;
8567 -- An empty Discs list means that there were no constraints in the
8568 -- subtype indication or that there was an error processing it.
8571 if Ekind (Parent_Type) = E_Record_Type_With_Private
8572 and then Present (Full_View (Parent_Type))
8573 and then Has_Discriminants (Parent_Type)
8575 Parent_Base := Base_Type (Full_View (Parent_Type));
8577 Parent_Base := Base_Type (Parent_Type);
8580 -- AI05-0115: if this is a derivation from a private type in some
8581 -- other scope that may lead to invisible components for the derived
8582 -- type, mark it accordingly.
8584 if Is_Private_Type (Parent_Type) then
8585 if Scope (Parent_Base) = Scope (Derived_Type) then
8588 elsif In_Open_Scopes (Scope (Parent_Base))
8589 and then In_Private_Part (Scope (Parent_Base))
8594 Set_Has_Private_Ancestor (Derived_Type);
8598 Set_Has_Private_Ancestor
8599 (Derived_Type, Has_Private_Ancestor (Parent_Type));
8602 -- Before we start the previously documented transformations, here is
8603 -- little fix for size and alignment of tagged types. Normally when we
8604 -- derive type D from type P, we copy the size and alignment of P as the
8605 -- default for D, and in the absence of explicit representation clauses
8606 -- for D, the size and alignment are indeed the same as the parent.
8608 -- But this is wrong for tagged types, since fields may be added, and
8609 -- the default size may need to be larger, and the default alignment may
8610 -- need to be larger.
8612 -- We therefore reset the size and alignment fields in the tagged case.
8613 -- Note that the size and alignment will in any case be at least as
8614 -- large as the parent type (since the derived type has a copy of the
8615 -- parent type in the _parent field)
8617 -- The type is also marked as being tagged here, which is needed when
8618 -- processing components with a self-referential anonymous access type
8619 -- in the call to Check_Anonymous_Access_Components below. Note that
8620 -- this flag is also set later on for completeness.
8623 Set_Is_Tagged_Type (Derived_Type);
8624 Init_Size_Align (Derived_Type);
8627 -- STEP 0a: figure out what kind of derived type declaration we have
8629 if Private_Extension then
8631 Set_Ekind (Derived_Type, E_Record_Type_With_Private);
8632 Set_Default_SSO (Derived_Type);
8633 Set_No_Reordering (Derived_Type, No_Component_Reordering);
8636 Type_Def := Type_Definition (N);
8638 -- Ekind (Parent_Base) is not necessarily E_Record_Type since
8639 -- Parent_Base can be a private type or private extension. However,
8640 -- for tagged types with an extension the newly added fields are
8641 -- visible and hence the Derived_Type is always an E_Record_Type.
8642 -- (except that the parent may have its own private fields).
8643 -- For untagged types we preserve the Ekind of the Parent_Base.
8645 if Present (Record_Extension_Part (Type_Def)) then
8646 Set_Ekind (Derived_Type, E_Record_Type);
8647 Set_Default_SSO (Derived_Type);
8648 Set_No_Reordering (Derived_Type, No_Component_Reordering);
8650 -- Create internal access types for components with anonymous
8653 if Ada_Version >= Ada_2005 then
8654 Check_Anonymous_Access_Components
8655 (N, Derived_Type, Derived_Type,
8656 Component_List (Record_Extension_Part (Type_Def)));
8660 Set_Ekind (Derived_Type, Ekind (Parent_Base));
8664 -- Indic can either be an N_Identifier if the subtype indication
8665 -- contains no constraint or an N_Subtype_Indication if the subtype
8666 -- indication has a constraint.
8668 Indic := Subtype_Indication (Type_Def);
8669 Constraint_Present := (Nkind (Indic) = N_Subtype_Indication);
8671 -- Check that the type has visible discriminants. The type may be
8672 -- a private type with unknown discriminants whose full view has
8673 -- discriminants which are invisible.
8675 if Constraint_Present then
8676 if not Has_Discriminants (Parent_Base)
8678 (Has_Unknown_Discriminants (Parent_Base)
8679 and then Is_Private_Type (Parent_Base))
8682 ("invalid constraint: type has no discriminant",
8683 Constraint (Indic));
8685 Constraint_Present := False;
8686 Rewrite (Indic, New_Copy_Tree (Subtype_Mark (Indic)));
8688 elsif Is_Constrained (Parent_Type) then
8690 ("invalid constraint: parent type is already constrained",
8691 Constraint (Indic));
8693 Constraint_Present := False;
8694 Rewrite (Indic, New_Copy_Tree (Subtype_Mark (Indic)));
8698 -- STEP 0b: If needed, apply transformation given in point 5. above
8700 if not Private_Extension
8701 and then Has_Discriminants (Parent_Type)
8702 and then not Discriminant_Specs
8703 and then (Is_Constrained (Parent_Type) or else Constraint_Present)
8705 -- First, we must analyze the constraint (see comment in point 5.)
8706 -- The constraint may come from the subtype indication of the full
8709 if Constraint_Present then
8710 New_Discrs := Build_Discriminant_Constraints (Parent_Type, Indic);
8712 -- If there is no explicit constraint, there might be one that is
8713 -- inherited from a constrained parent type. In that case verify that
8714 -- it conforms to the constraint in the partial view. In perverse
8715 -- cases the parent subtypes of the partial and full view can have
8716 -- different constraints.
8718 elsif Present (Stored_Constraint (Parent_Type)) then
8719 New_Discrs := Stored_Constraint (Parent_Type);
8722 New_Discrs := No_Elist;
8725 if Has_Discriminants (Derived_Type)
8726 and then Has_Private_Declaration (Derived_Type)
8727 and then Present (Discriminant_Constraint (Derived_Type))
8728 and then Present (New_Discrs)
8730 -- Verify that constraints of the full view statically match
8731 -- those given in the partial view.
8737 C1 := First_Elmt (New_Discrs);
8738 C2 := First_Elmt (Discriminant_Constraint (Derived_Type));
8739 while Present (C1) and then Present (C2) loop
8740 if Fully_Conformant_Expressions (Node (C1), Node (C2))
8742 (Is_OK_Static_Expression (Node (C1))
8743 and then Is_OK_Static_Expression (Node (C2))
8745 Expr_Value (Node (C1)) = Expr_Value (Node (C2)))
8750 if Constraint_Present then
8752 ("constraint not conformant to previous declaration",
8756 ("constraint of full view is incompatible "
8757 & "with partial view", N);
8767 -- Insert and analyze the declaration for the unconstrained base type
8769 New_Base := Create_Itype (Ekind (Derived_Type), N, Derived_Type, 'B');
8772 Make_Full_Type_Declaration (Loc,
8773 Defining_Identifier => New_Base,
8775 Make_Derived_Type_Definition (Loc,
8776 Abstract_Present => Abstract_Present (Type_Def),
8777 Limited_Present => Limited_Present (Type_Def),
8778 Subtype_Indication =>
8779 New_Occurrence_Of (Parent_Base, Loc),
8780 Record_Extension_Part =>
8781 Relocate_Node (Record_Extension_Part (Type_Def)),
8782 Interface_List => Interface_List (Type_Def)));
8784 Set_Parent (New_Decl, Parent (N));
8785 Mark_Rewrite_Insertion (New_Decl);
8786 Insert_Before (N, New_Decl);
8788 -- In the extension case, make sure ancestor is frozen appropriately
8789 -- (see also non-discriminated case below).
8791 if Present (Record_Extension_Part (Type_Def))
8792 or else Is_Interface (Parent_Base)
8794 Freeze_Before (New_Decl, Parent_Type);
8797 -- Note that this call passes False for the Derive_Subps parameter
8798 -- because subprogram derivation is deferred until after creating
8799 -- the subtype (see below).
8802 (New_Decl, Parent_Base, New_Base,
8803 Is_Completion => False, Derive_Subps => False);
8805 -- ??? This needs re-examination to determine whether the
8806 -- above call can simply be replaced by a call to Analyze.
8808 Set_Analyzed (New_Decl);
8810 -- Insert and analyze the declaration for the constrained subtype
8812 if Constraint_Present then
8814 Make_Subtype_Indication (Loc,
8815 Subtype_Mark => New_Occurrence_Of (New_Base, Loc),
8816 Constraint => Relocate_Node (Constraint (Indic)));
8820 Constr_List : constant List_Id := New_List;
8825 C := First_Elmt (Discriminant_Constraint (Parent_Type));
8826 while Present (C) loop
8829 -- It is safe here to call New_Copy_Tree since we called
8830 -- Force_Evaluation on each constraint previously
8831 -- in Build_Discriminant_Constraints.
8833 Append (New_Copy_Tree (Expr), To => Constr_List);
8839 Make_Subtype_Indication (Loc,
8840 Subtype_Mark => New_Occurrence_Of (New_Base, Loc),
8842 Make_Index_Or_Discriminant_Constraint (Loc, Constr_List));
8847 Make_Subtype_Declaration (Loc,
8848 Defining_Identifier => Derived_Type,
8849 Subtype_Indication => New_Indic));
8853 -- Derivation of subprograms must be delayed until the full subtype
8854 -- has been established, to ensure proper overriding of subprograms
8855 -- inherited by full types. If the derivations occurred as part of
8856 -- the call to Build_Derived_Type above, then the check for type
8857 -- conformance would fail because earlier primitive subprograms
8858 -- could still refer to the full type prior the change to the new
8859 -- subtype and hence would not match the new base type created here.
8860 -- Subprograms are not derived, however, when Derive_Subps is False
8861 -- (since otherwise there could be redundant derivations).
8863 if Derive_Subps then
8864 Derive_Subprograms (Parent_Type, Derived_Type);
8867 -- For tagged types the Discriminant_Constraint of the new base itype
8868 -- is inherited from the first subtype so that no subtype conformance
8869 -- problem arise when the first subtype overrides primitive
8870 -- operations inherited by the implicit base type.
8873 Set_Discriminant_Constraint
8874 (New_Base, Discriminant_Constraint (Derived_Type));
8880 -- If we get here Derived_Type will have no discriminants or it will be
8881 -- a discriminated unconstrained base type.
8883 -- STEP 1a: perform preliminary actions/checks for derived tagged types
8887 -- The parent type is frozen for non-private extensions (RM 13.14(7))
8888 -- The declaration of a specific descendant of an interface type
8889 -- freezes the interface type (RM 13.14).
8891 if not Private_Extension or else Is_Interface (Parent_Base) then
8892 Freeze_Before (N, Parent_Type);
8895 -- In Ada 2005 (AI-344), the restriction that a derived tagged type
8896 -- cannot be declared at a deeper level than its parent type is
8897 -- removed. The check on derivation within a generic body is also
8898 -- relaxed, but there's a restriction that a derived tagged type
8899 -- cannot be declared in a generic body if it's derived directly
8900 -- or indirectly from a formal type of that generic.
8902 if Ada_Version >= Ada_2005 then
8903 if Present (Enclosing_Generic_Body (Derived_Type)) then
8905 Ancestor_Type : Entity_Id;
8908 -- Check to see if any ancestor of the derived type is a
8911 Ancestor_Type := Parent_Type;
8912 while not Is_Generic_Type (Ancestor_Type)
8913 and then Etype (Ancestor_Type) /= Ancestor_Type
8915 Ancestor_Type := Etype (Ancestor_Type);
8918 -- If the derived type does have a formal type as an
8919 -- ancestor, then it's an error if the derived type is
8920 -- declared within the body of the generic unit that
8921 -- declares the formal type in its generic formal part. It's
8922 -- sufficient to check whether the ancestor type is declared
8923 -- inside the same generic body as the derived type (such as
8924 -- within a nested generic spec), in which case the
8925 -- derivation is legal. If the formal type is declared
8926 -- outside of that generic body, then it's guaranteed that
8927 -- the derived type is declared within the generic body of
8928 -- the generic unit declaring the formal type.
8930 if Is_Generic_Type (Ancestor_Type)
8931 and then Enclosing_Generic_Body (Ancestor_Type) /=
8932 Enclosing_Generic_Body (Derived_Type)
8935 ("parent type of& must not be descendant of formal type"
8936 & " of an enclosing generic body",
8937 Indic, Derived_Type);
8942 elsif Type_Access_Level (Derived_Type) /=
8943 Type_Access_Level (Parent_Type)
8944 and then not Is_Generic_Type (Derived_Type)
8946 if Is_Controlled (Parent_Type) then
8948 ("controlled type must be declared at the library level",
8952 ("type extension at deeper accessibility level than parent",
8958 GB : constant Node_Id := Enclosing_Generic_Body (Derived_Type);
8961 and then GB /= Enclosing_Generic_Body (Parent_Base)
8964 ("parent type of& must not be outside generic body"
8966 Indic, Derived_Type);
8972 -- Ada 2005 (AI-251)
8974 if Ada_Version >= Ada_2005 and then Is_Tagged then
8976 -- "The declaration of a specific descendant of an interface type
8977 -- freezes the interface type" (RM 13.14).
8982 if Is_Non_Empty_List (Interface_List (Type_Def)) then
8983 Iface := First (Interface_List (Type_Def));
8984 while Present (Iface) loop
8985 Freeze_Before (N, Etype (Iface));
8992 -- STEP 1b : preliminary cleanup of the full view of private types
8994 -- If the type is already marked as having discriminants, then it's the
8995 -- completion of a private type or private extension and we need to
8996 -- retain the discriminants from the partial view if the current
8997 -- declaration has Discriminant_Specifications so that we can verify
8998 -- conformance. However, we must remove any existing components that
8999 -- were inherited from the parent (and attached in Copy_And_Swap)
9000 -- because the full type inherits all appropriate components anyway, and
9001 -- we do not want the partial view's components interfering.
9003 if Has_Discriminants (Derived_Type) and then Discriminant_Specs then
9004 Discrim := First_Discriminant (Derived_Type);
9006 Last_Discrim := Discrim;
9007 Next_Discriminant (Discrim);
9008 exit when No (Discrim);
9011 Set_Last_Entity (Derived_Type, Last_Discrim);
9013 -- In all other cases wipe out the list of inherited components (even
9014 -- inherited discriminants), it will be properly rebuilt here.
9017 Set_First_Entity (Derived_Type, Empty);
9018 Set_Last_Entity (Derived_Type, Empty);
9021 -- STEP 1c: Initialize some flags for the Derived_Type
9023 -- The following flags must be initialized here so that
9024 -- Process_Discriminants can check that discriminants of tagged types do
9025 -- not have a default initial value and that access discriminants are
9026 -- only specified for limited records. For completeness, these flags are
9027 -- also initialized along with all the other flags below.
9029 -- AI-419: Limitedness is not inherited from an interface parent, so to
9030 -- be limited in that case the type must be explicitly declared as
9031 -- limited. However, task and protected interfaces are always limited.
9033 if Limited_Present (Type_Def) then
9034 Set_Is_Limited_Record (Derived_Type);
9036 elsif Is_Limited_Record (Parent_Type)
9037 or else (Present (Full_View (Parent_Type))
9038 and then Is_Limited_Record (Full_View (Parent_Type)))
9040 if not Is_Interface (Parent_Type)
9041 or else Is_Synchronized_Interface (Parent_Type)
9042 or else Is_Protected_Interface (Parent_Type)
9043 or else Is_Task_Interface (Parent_Type)
9045 Set_Is_Limited_Record (Derived_Type);
9049 -- STEP 2a: process discriminants of derived type if any
9051 Push_Scope (Derived_Type);
9053 if Discriminant_Specs then
9054 Set_Has_Unknown_Discriminants (Derived_Type, False);
9056 -- The following call initializes fields Has_Discriminants and
9057 -- Discriminant_Constraint, unless we are processing the completion
9058 -- of a private type declaration.
9060 Check_Or_Process_Discriminants (N, Derived_Type);
9062 -- For untagged types, the constraint on the Parent_Type must be
9063 -- present and is used to rename the discriminants.
9065 if not Is_Tagged and then not Has_Discriminants (Parent_Type) then
9066 Error_Msg_N ("untagged parent must have discriminants", Indic);
9068 elsif not Is_Tagged and then not Constraint_Present then
9070 ("discriminant constraint needed for derived untagged records",
9073 -- Otherwise the parent subtype must be constrained unless we have a
9074 -- private extension.
9076 elsif not Constraint_Present
9077 and then not Private_Extension
9078 and then not Is_Constrained (Parent_Type)
9081 ("unconstrained type not allowed in this context", Indic);
9083 elsif Constraint_Present then
9084 -- The following call sets the field Corresponding_Discriminant
9085 -- for the discriminants in the Derived_Type.
9087 Discs := Build_Discriminant_Constraints (Parent_Type, Indic, True);
9089 -- For untagged types all new discriminants must rename
9090 -- discriminants in the parent. For private extensions new
9091 -- discriminants cannot rename old ones (implied by [7.3(13)]).
9093 Discrim := First_Discriminant (Derived_Type);
9094 while Present (Discrim) loop
9096 and then No (Corresponding_Discriminant (Discrim))
9099 ("new discriminants must constrain old ones", Discrim);
9101 elsif Private_Extension
9102 and then Present (Corresponding_Discriminant (Discrim))
9105 ("only static constraints allowed for parent"
9106 & " discriminants in the partial view", Indic);
9110 -- If a new discriminant is used in the constraint, then its
9111 -- subtype must be statically compatible with the parent
9112 -- discriminant's subtype (3.7(15)).
9114 -- However, if the record contains an array constrained by
9115 -- the discriminant but with some different bound, the compiler
9116 -- tries to create a smaller range for the discriminant type.
9117 -- (See exp_ch3.Adjust_Discriminants). In this case, where
9118 -- the discriminant type is a scalar type, the check must use
9119 -- the original discriminant type in the parent declaration.
9122 Corr_Disc : constant Entity_Id :=
9123 Corresponding_Discriminant (Discrim);
9124 Disc_Type : constant Entity_Id := Etype (Discrim);
9125 Corr_Type : Entity_Id;
9128 if Present (Corr_Disc) then
9129 if Is_Scalar_Type (Disc_Type) then
9131 Entity (Discriminant_Type (Parent (Corr_Disc)));
9133 Corr_Type := Etype (Corr_Disc);
9137 Subtypes_Statically_Compatible (Disc_Type, Corr_Type)
9140 ("subtype must be compatible "
9141 & "with parent discriminant",
9147 Next_Discriminant (Discrim);
9150 -- Check whether the constraints of the full view statically
9151 -- match those imposed by the parent subtype [7.3(13)].
9153 if Present (Stored_Constraint (Derived_Type)) then
9158 C1 := First_Elmt (Discs);
9159 C2 := First_Elmt (Stored_Constraint (Derived_Type));
9160 while Present (C1) and then Present (C2) loop
9162 Fully_Conformant_Expressions (Node (C1), Node (C2))
9165 ("not conformant with previous declaration",
9176 -- STEP 2b: No new discriminants, inherit discriminants if any
9179 if Private_Extension then
9180 Set_Has_Unknown_Discriminants
9182 Has_Unknown_Discriminants (Parent_Type)
9183 or else Unknown_Discriminants_Present (N));
9185 -- The partial view of the parent may have unknown discriminants,
9186 -- but if the full view has discriminants and the parent type is
9187 -- in scope they must be inherited.
9189 elsif Has_Unknown_Discriminants (Parent_Type)
9191 (not Has_Discriminants (Parent_Type)
9192 or else not In_Open_Scopes (Scope (Parent_Base)))
9194 Set_Has_Unknown_Discriminants (Derived_Type);
9197 if not Has_Unknown_Discriminants (Derived_Type)
9198 and then not Has_Unknown_Discriminants (Parent_Base)
9199 and then Has_Discriminants (Parent_Type)
9201 Inherit_Discrims := True;
9202 Set_Has_Discriminants
9203 (Derived_Type, True);
9204 Set_Discriminant_Constraint
9205 (Derived_Type, Discriminant_Constraint (Parent_Base));
9208 -- The following test is true for private types (remember
9209 -- transformation 5. is not applied to those) and in an error
9212 if Constraint_Present then
9213 Discs := Build_Discriminant_Constraints (Parent_Type, Indic);
9216 -- For now mark a new derived type as constrained only if it has no
9217 -- discriminants. At the end of Build_Derived_Record_Type we properly
9218 -- set this flag in the case of private extensions. See comments in
9219 -- point 9. just before body of Build_Derived_Record_Type.
9223 not (Inherit_Discrims
9224 or else Has_Unknown_Discriminants (Derived_Type)));
9227 -- STEP 3: initialize fields of derived type
9229 Set_Is_Tagged_Type (Derived_Type, Is_Tagged);
9230 Set_Stored_Constraint (Derived_Type, No_Elist);
9232 -- Ada 2005 (AI-251): Private type-declarations can implement interfaces
9233 -- but cannot be interfaces
9235 if not Private_Extension
9236 and then Ekind (Derived_Type) /= E_Private_Type
9237 and then Ekind (Derived_Type) /= E_Limited_Private_Type
9239 if Interface_Present (Type_Def) then
9240 Analyze_Interface_Declaration (Derived_Type, Type_Def);
9243 Set_Interfaces (Derived_Type, No_Elist);
9246 -- Fields inherited from the Parent_Type
9248 Set_Has_Specified_Layout
9249 (Derived_Type, Has_Specified_Layout (Parent_Type));
9250 Set_Is_Limited_Composite
9251 (Derived_Type, Is_Limited_Composite (Parent_Type));
9252 Set_Is_Private_Composite
9253 (Derived_Type, Is_Private_Composite (Parent_Type));
9255 if Is_Tagged_Type (Parent_Type) then
9256 Set_No_Tagged_Streams_Pragma
9257 (Derived_Type, No_Tagged_Streams_Pragma (Parent_Type));
9260 -- Fields inherited from the Parent_Base
9262 Set_Has_Controlled_Component
9263 (Derived_Type, Has_Controlled_Component (Parent_Base));
9264 Set_Has_Non_Standard_Rep
9265 (Derived_Type, Has_Non_Standard_Rep (Parent_Base));
9266 Set_Has_Primitive_Operations
9267 (Derived_Type, Has_Primitive_Operations (Parent_Base));
9269 -- Set fields for private derived types
9271 if Is_Private_Type (Derived_Type) then
9272 Set_Depends_On_Private (Derived_Type, True);
9273 Set_Private_Dependents (Derived_Type, New_Elmt_List);
9276 -- Inherit fields for non-private types. If this is the completion of a
9277 -- derivation from a private type, the parent itself is private and the
9278 -- attributes come from its full view, which must be present.
9280 if Is_Record_Type (Derived_Type) then
9282 Parent_Full : Entity_Id;
9285 if Is_Private_Type (Parent_Base)
9286 and then not Is_Record_Type (Parent_Base)
9288 Parent_Full := Full_View (Parent_Base);
9290 Parent_Full := Parent_Base;
9293 Set_Component_Alignment
9294 (Derived_Type, Component_Alignment (Parent_Full));
9296 (Derived_Type, C_Pass_By_Copy (Parent_Full));
9297 Set_Has_Complex_Representation
9298 (Derived_Type, Has_Complex_Representation (Parent_Full));
9300 -- For untagged types, inherit the layout by default to avoid
9301 -- costly changes of representation for type conversions.
9303 if not Is_Tagged then
9304 Set_Is_Packed (Derived_Type, Is_Packed (Parent_Full));
9305 Set_No_Reordering (Derived_Type, No_Reordering (Parent_Full));
9310 -- Set fields for tagged types
9313 Set_Direct_Primitive_Operations (Derived_Type, New_Elmt_List);
9315 -- All tagged types defined in Ada.Finalization are controlled
9317 if Chars (Scope (Derived_Type)) = Name_Finalization
9318 and then Chars (Scope (Scope (Derived_Type))) = Name_Ada
9319 and then Scope (Scope (Scope (Derived_Type))) = Standard_Standard
9321 Set_Is_Controlled_Active (Derived_Type);
9323 Set_Is_Controlled_Active
9324 (Derived_Type, Is_Controlled_Active (Parent_Base));
9327 -- Minor optimization: there is no need to generate the class-wide
9328 -- entity associated with an underlying record view.
9330 if not Is_Underlying_Record_View (Derived_Type) then
9331 Make_Class_Wide_Type (Derived_Type);
9334 Set_Is_Abstract_Type (Derived_Type, Abstract_Present (Type_Def));
9336 if Has_Discriminants (Derived_Type)
9337 and then Constraint_Present
9339 Set_Stored_Constraint
9340 (Derived_Type, Expand_To_Stored_Constraint (Parent_Base, Discs));
9343 if Ada_Version >= Ada_2005 then
9345 Ifaces_List : Elist_Id;
9348 -- Checks rules 3.9.4 (13/2 and 14/2)
9350 if Comes_From_Source (Derived_Type)
9351 and then not Is_Private_Type (Derived_Type)
9352 and then Is_Interface (Parent_Type)
9353 and then not Is_Interface (Derived_Type)
9355 if Is_Task_Interface (Parent_Type) then
9357 ("(Ada 2005) task type required (RM 3.9.4 (13.2))",
9360 elsif Is_Protected_Interface (Parent_Type) then
9362 ("(Ada 2005) protected type required (RM 3.9.4 (14.2))",
9367 -- Check ARM rules 3.9.4 (15/2), 9.1 (9.d/2) and 9.4 (11.d/2)
9369 Check_Interfaces (N, Type_Def);
9371 -- Ada 2005 (AI-251): Collect the list of progenitors that are
9372 -- not already in the parents.
9376 Ifaces_List => Ifaces_List,
9377 Exclude_Parents => True);
9379 Set_Interfaces (Derived_Type, Ifaces_List);
9381 -- If the derived type is the anonymous type created for
9382 -- a declaration whose parent has a constraint, propagate
9383 -- the interface list to the source type. This must be done
9384 -- prior to the completion of the analysis of the source type
9385 -- because the components in the extension may contain current
9386 -- instances whose legality depends on some ancestor.
9388 if Is_Itype (Derived_Type) then
9390 Def : constant Node_Id :=
9391 Associated_Node_For_Itype (Derived_Type);
9394 and then Nkind (Def) = N_Full_Type_Declaration
9397 (Defining_Identifier (Def), Ifaces_List);
9402 -- A type extension is automatically Ghost when one of its
9403 -- progenitors is Ghost (SPARK RM 6.9(9)). This property is
9404 -- also inherited when the parent type is Ghost, but this is
9405 -- done in Build_Derived_Type as the mechanism also handles
9406 -- untagged derivations.
9408 if Implements_Ghost_Interface (Derived_Type) then
9409 Set_Is_Ghost_Entity (Derived_Type);
9415 -- STEP 4: Inherit components from the parent base and constrain them.
9416 -- Apply the second transformation described in point 6. above.
9418 if (not Is_Empty_Elmt_List (Discs) or else Inherit_Discrims)
9419 or else not Has_Discriminants (Parent_Type)
9420 or else not Is_Constrained (Parent_Type)
9424 Constrs := Discriminant_Constraint (Parent_Type);
9429 (N, Parent_Base, Derived_Type, Is_Tagged, Inherit_Discrims, Constrs);
9431 -- STEP 5a: Copy the parent record declaration for untagged types
9433 Set_Has_Implicit_Dereference
9434 (Derived_Type, Has_Implicit_Dereference (Parent_Type));
9436 if not Is_Tagged then
9438 -- Discriminant_Constraint (Derived_Type) has been properly
9439 -- constructed. Save it and temporarily set it to Empty because we
9440 -- do not want the call to New_Copy_Tree below to mess this list.
9442 if Has_Discriminants (Derived_Type) then
9443 Save_Discr_Constr := Discriminant_Constraint (Derived_Type);
9444 Set_Discriminant_Constraint (Derived_Type, No_Elist);
9446 Save_Discr_Constr := No_Elist;
9449 -- Save the Etype field of Derived_Type. It is correctly set now,
9450 -- but the call to New_Copy tree may remap it to point to itself,
9451 -- which is not what we want. Ditto for the Next_Entity field.
9453 Save_Etype := Etype (Derived_Type);
9454 Save_Next_Entity := Next_Entity (Derived_Type);
9456 -- Assoc_List maps all stored discriminants in the Parent_Base to
9457 -- stored discriminants in the Derived_Type. It is fundamental that
9458 -- no types or itypes with discriminants other than the stored
9459 -- discriminants appear in the entities declared inside
9460 -- Derived_Type, since the back end cannot deal with it.
9464 (Parent (Parent_Base), Map => Assoc_List, New_Sloc => Loc);
9465 Copy_Dimensions_Of_Components (Derived_Type);
9467 -- Restore the fields saved prior to the New_Copy_Tree call
9468 -- and compute the stored constraint.
9470 Set_Etype (Derived_Type, Save_Etype);
9471 Link_Entities (Derived_Type, Save_Next_Entity);
9473 if Has_Discriminants (Derived_Type) then
9474 Set_Discriminant_Constraint
9475 (Derived_Type, Save_Discr_Constr);
9476 Set_Stored_Constraint
9477 (Derived_Type, Expand_To_Stored_Constraint (Parent_Type, Discs));
9479 Replace_Components (Derived_Type, New_Decl);
9482 -- Insert the new derived type declaration
9484 Rewrite (N, New_Decl);
9486 -- STEP 5b: Complete the processing for record extensions in generics
9488 -- There is no completion for record extensions declared in the
9489 -- parameter part of a generic, so we need to complete processing for
9490 -- these generic record extensions here. The Record_Type_Definition call
9491 -- will change the Ekind of the components from E_Void to E_Component.
9493 elsif Private_Extension and then Is_Generic_Type (Derived_Type) then
9494 Record_Type_Definition (Empty, Derived_Type);
9496 -- STEP 5c: Process the record extension for non private tagged types
9498 elsif not Private_Extension then
9499 Expand_Record_Extension (Derived_Type, Type_Def);
9501 -- Note : previously in ASIS mode we set the Parent_Subtype of the
9502 -- derived type to propagate some semantic information. This led
9503 -- to other ASIS failures and has been removed.
9505 -- Ada 2005 (AI-251): Addition of the Tag corresponding to all the
9506 -- implemented interfaces if we are in expansion mode
9509 and then Has_Interfaces (Derived_Type)
9511 Add_Interface_Tag_Components (N, Derived_Type);
9514 -- Analyze the record extension
9516 Record_Type_Definition
9517 (Record_Extension_Part (Type_Def), Derived_Type);
9522 -- Nothing else to do if there is an error in the derivation.
9523 -- An unusual case: the full view may be derived from a type in an
9524 -- instance, when the partial view was used illegally as an actual
9525 -- in that instance, leading to a circular definition.
9527 if Etype (Derived_Type) = Any_Type
9528 or else Etype (Parent_Type) = Derived_Type
9533 -- Set delayed freeze and then derive subprograms, we need to do
9534 -- this in this order so that derived subprograms inherit the
9535 -- derived freeze if necessary.
9537 Set_Has_Delayed_Freeze (Derived_Type);
9539 if Derive_Subps then
9540 Derive_Subprograms (Parent_Type, Derived_Type);
9543 -- If we have a private extension which defines a constrained derived
9544 -- type mark as constrained here after we have derived subprograms. See
9545 -- comment on point 9. just above the body of Build_Derived_Record_Type.
9547 if Private_Extension and then Inherit_Discrims then
9548 if Constraint_Present and then not Is_Empty_Elmt_List (Discs) then
9549 Set_Is_Constrained (Derived_Type, True);
9550 Set_Discriminant_Constraint (Derived_Type, Discs);
9552 elsif Is_Constrained (Parent_Type) then
9554 (Derived_Type, True);
9555 Set_Discriminant_Constraint
9556 (Derived_Type, Discriminant_Constraint (Parent_Type));
9560 -- Update the class-wide type, which shares the now-completed entity
9561 -- list with its specific type. In case of underlying record views,
9562 -- we do not generate the corresponding class wide entity.
9565 and then not Is_Underlying_Record_View (Derived_Type)
9568 (Class_Wide_Type (Derived_Type), First_Entity (Derived_Type));
9570 (Class_Wide_Type (Derived_Type), Last_Entity (Derived_Type));
9573 Check_Function_Writable_Actuals (N);
9574 end Build_Derived_Record_Type;
9576 ------------------------
9577 -- Build_Derived_Type --
9578 ------------------------
9580 procedure Build_Derived_Type
9582 Parent_Type : Entity_Id;
9583 Derived_Type : Entity_Id;
9584 Is_Completion : Boolean;
9585 Derive_Subps : Boolean := True)
9587 Parent_Base : constant Entity_Id := Base_Type (Parent_Type);
9590 -- Set common attributes
9592 Set_Scope (Derived_Type, Current_Scope);
9593 Set_Etype (Derived_Type, Parent_Base);
9594 Set_Ekind (Derived_Type, Ekind (Parent_Base));
9595 Propagate_Concurrent_Flags (Derived_Type, Parent_Base);
9597 Set_Size_Info (Derived_Type, Parent_Type);
9598 Set_RM_Size (Derived_Type, RM_Size (Parent_Type));
9600 Set_Is_Controlled_Active
9601 (Derived_Type, Is_Controlled_Active (Parent_Type));
9603 Set_Disable_Controlled (Derived_Type, Disable_Controlled (Parent_Type));
9604 Set_Is_Tagged_Type (Derived_Type, Is_Tagged_Type (Parent_Type));
9605 Set_Is_Volatile (Derived_Type, Is_Volatile (Parent_Type));
9607 if Is_Tagged_Type (Derived_Type) then
9608 Set_No_Tagged_Streams_Pragma
9609 (Derived_Type, No_Tagged_Streams_Pragma (Parent_Type));
9612 -- If the parent has primitive routines, set the derived type link
9614 if Has_Primitive_Operations (Parent_Type) then
9615 Set_Derived_Type_Link (Parent_Base, Derived_Type);
9618 -- If the parent type is a private subtype, the convention on the base
9619 -- type may be set in the private part, and not propagated to the
9620 -- subtype until later, so we obtain the convention from the base type.
9622 Set_Convention (Derived_Type, Convention (Parent_Base));
9624 -- Set SSO default for record or array type
9626 if (Is_Array_Type (Derived_Type) or else Is_Record_Type (Derived_Type))
9627 and then Is_Base_Type (Derived_Type)
9629 Set_Default_SSO (Derived_Type);
9632 -- A derived type inherits the Default_Initial_Condition pragma coming
9633 -- from any parent type within the derivation chain.
9635 if Has_DIC (Parent_Type) then
9636 Set_Has_Inherited_DIC (Derived_Type);
9639 -- A derived type inherits any class-wide invariants coming from a
9640 -- parent type or an interface. Note that the invariant procedure of
9641 -- the parent type should not be inherited because the derived type may
9642 -- define invariants of its own.
9644 if not Is_Interface (Derived_Type) then
9645 if Has_Inherited_Invariants (Parent_Type)
9646 or else Has_Inheritable_Invariants (Parent_Type)
9648 Set_Has_Inherited_Invariants (Derived_Type);
9650 elsif Is_Concurrent_Type (Derived_Type)
9651 or else Is_Tagged_Type (Derived_Type)
9656 Iface_Elmt : Elmt_Id;
9661 Ifaces_List => Ifaces,
9662 Exclude_Parents => True);
9664 if Present (Ifaces) then
9665 Iface_Elmt := First_Elmt (Ifaces);
9666 while Present (Iface_Elmt) loop
9667 Iface := Node (Iface_Elmt);
9669 if Has_Inheritable_Invariants (Iface) then
9670 Set_Has_Inherited_Invariants (Derived_Type);
9674 Next_Elmt (Iface_Elmt);
9681 -- We similarly inherit predicates. Note that for scalar derived types
9682 -- the predicate is inherited from the first subtype, and not from its
9683 -- (anonymous) base type.
9685 if Has_Predicates (Parent_Type)
9686 or else Has_Predicates (First_Subtype (Parent_Type))
9688 Set_Has_Predicates (Derived_Type);
9691 -- The derived type inherits representation clauses from the parent
9692 -- type, and from any interfaces.
9694 Inherit_Rep_Item_Chain (Derived_Type, Parent_Type);
9697 Iface : Node_Id := First (Abstract_Interface_List (Derived_Type));
9699 while Present (Iface) loop
9700 Inherit_Rep_Item_Chain (Derived_Type, Entity (Iface));
9705 -- If the parent type has delayed rep aspects, then mark the derived
9706 -- type as possibly inheriting a delayed rep aspect.
9708 if Has_Delayed_Rep_Aspects (Parent_Type) then
9709 Set_May_Inherit_Delayed_Rep_Aspects (Derived_Type);
9712 -- A derived type becomes Ghost when its parent type is also Ghost
9713 -- (SPARK RM 6.9(9)). Note that the Ghost-related attributes are not
9714 -- directly inherited because the Ghost policy in effect may differ.
9716 if Is_Ghost_Entity (Parent_Type) then
9717 Set_Is_Ghost_Entity (Derived_Type);
9720 -- Type dependent processing
9722 case Ekind (Parent_Type) is
9723 when Numeric_Kind =>
9724 Build_Derived_Numeric_Type (N, Parent_Type, Derived_Type);
9727 Build_Derived_Array_Type (N, Parent_Type, Derived_Type);
9729 when Class_Wide_Kind
9733 Build_Derived_Record_Type
9734 (N, Parent_Type, Derived_Type, Derive_Subps);
9737 when Enumeration_Kind =>
9738 Build_Derived_Enumeration_Type (N, Parent_Type, Derived_Type);
9741 Build_Derived_Access_Type (N, Parent_Type, Derived_Type);
9743 when Incomplete_Or_Private_Kind =>
9744 Build_Derived_Private_Type
9745 (N, Parent_Type, Derived_Type, Is_Completion, Derive_Subps);
9747 -- For discriminated types, the derivation includes deriving
9748 -- primitive operations. For others it is done below.
9750 if Is_Tagged_Type (Parent_Type)
9751 or else Has_Discriminants (Parent_Type)
9752 or else (Present (Full_View (Parent_Type))
9753 and then Has_Discriminants (Full_View (Parent_Type)))
9758 when Concurrent_Kind =>
9759 Build_Derived_Concurrent_Type (N, Parent_Type, Derived_Type);
9762 raise Program_Error;
9765 -- Nothing more to do if some error occurred
9767 if Etype (Derived_Type) = Any_Type then
9771 -- Set delayed freeze and then derive subprograms, we need to do this
9772 -- in this order so that derived subprograms inherit the derived freeze
9775 Set_Has_Delayed_Freeze (Derived_Type);
9777 if Derive_Subps then
9778 Derive_Subprograms (Parent_Type, Derived_Type);
9781 Set_Has_Primitive_Operations
9782 (Base_Type (Derived_Type), Has_Primitive_Operations (Parent_Type));
9783 end Build_Derived_Type;
9785 -----------------------
9786 -- Build_Discriminal --
9787 -----------------------
9789 procedure Build_Discriminal (Discrim : Entity_Id) is
9790 D_Minal : Entity_Id;
9791 CR_Disc : Entity_Id;
9794 -- A discriminal has the same name as the discriminant
9796 D_Minal := Make_Defining_Identifier (Sloc (Discrim), Chars (Discrim));
9798 Set_Ekind (D_Minal, E_In_Parameter);
9799 Set_Mechanism (D_Minal, Default_Mechanism);
9800 Set_Etype (D_Minal, Etype (Discrim));
9801 Set_Scope (D_Minal, Current_Scope);
9802 Set_Parent (D_Minal, Parent (Discrim));
9804 Set_Discriminal (Discrim, D_Minal);
9805 Set_Discriminal_Link (D_Minal, Discrim);
9807 -- For task types, build at once the discriminants of the corresponding
9808 -- record, which are needed if discriminants are used in entry defaults
9809 -- and in family bounds.
9811 if Is_Concurrent_Type (Current_Scope)
9813 Is_Limited_Type (Current_Scope)
9815 CR_Disc := Make_Defining_Identifier (Sloc (Discrim), Chars (Discrim));
9817 Set_Ekind (CR_Disc, E_In_Parameter);
9818 Set_Mechanism (CR_Disc, Default_Mechanism);
9819 Set_Etype (CR_Disc, Etype (Discrim));
9820 Set_Scope (CR_Disc, Current_Scope);
9821 Set_Discriminal_Link (CR_Disc, Discrim);
9822 Set_CR_Discriminant (Discrim, CR_Disc);
9824 end Build_Discriminal;
9826 ------------------------------------
9827 -- Build_Discriminant_Constraints --
9828 ------------------------------------
9830 function Build_Discriminant_Constraints
9833 Derived_Def : Boolean := False) return Elist_Id
9835 C : constant Node_Id := Constraint (Def);
9836 Nb_Discr : constant Nat := Number_Discriminants (T);
9838 Discr_Expr : array (1 .. Nb_Discr) of Node_Id := (others => Empty);
9839 -- Saves the expression corresponding to a given discriminant in T
9841 function Pos_Of_Discr (T : Entity_Id; D : Entity_Id) return Nat;
9842 -- Return the Position number within array Discr_Expr of a discriminant
9843 -- D within the discriminant list of the discriminated type T.
9845 procedure Process_Discriminant_Expression
9848 -- If this is a discriminant constraint on a partial view, do not
9849 -- generate an overflow check on the discriminant expression. The check
9850 -- will be generated when constraining the full view. Otherwise the
9851 -- backend creates duplicate symbols for the temporaries corresponding
9852 -- to the expressions to be checked, causing spurious assembler errors.
9858 function Pos_Of_Discr (T : Entity_Id; D : Entity_Id) return Nat is
9862 Disc := First_Discriminant (T);
9863 for J in Discr_Expr'Range loop
9868 Next_Discriminant (Disc);
9871 -- Note: Since this function is called on discriminants that are
9872 -- known to belong to the discriminated type, falling through the
9873 -- loop with no match signals an internal compiler error.
9875 raise Program_Error;
9878 -------------------------------------
9879 -- Process_Discriminant_Expression --
9880 -------------------------------------
9882 procedure Process_Discriminant_Expression
9886 BDT : constant Entity_Id := Base_Type (Etype (D));
9889 -- If this is a discriminant constraint on a partial view, do
9890 -- not generate an overflow on the discriminant expression. The
9891 -- check will be generated when constraining the full view.
9893 if Is_Private_Type (T)
9894 and then Present (Full_View (T))
9896 Analyze_And_Resolve (Expr, BDT, Suppress => Overflow_Check);
9898 Analyze_And_Resolve (Expr, BDT);
9900 end Process_Discriminant_Expression;
9902 -- Declarations local to Build_Discriminant_Constraints
9906 Elist : constant Elist_Id := New_Elmt_List;
9914 Discrim_Present : Boolean := False;
9916 -- Start of processing for Build_Discriminant_Constraints
9919 -- The following loop will process positional associations only.
9920 -- For a positional association, the (single) discriminant is
9921 -- implicitly specified by position, in textual order (RM 3.7.2).
9923 Discr := First_Discriminant (T);
9924 Constr := First (Constraints (C));
9925 for D in Discr_Expr'Range loop
9926 exit when Nkind (Constr) = N_Discriminant_Association;
9929 Error_Msg_N ("too few discriminants given in constraint", C);
9930 return New_Elmt_List;
9932 elsif Nkind (Constr) = N_Range
9933 or else (Nkind (Constr) = N_Attribute_Reference
9934 and then Attribute_Name (Constr) = Name_Range)
9937 ("a range is not a valid discriminant constraint", Constr);
9938 Discr_Expr (D) := Error;
9940 elsif Nkind (Constr) = N_Subtype_Indication then
9942 ("a subtype indication is not a valid discriminant constraint",
9944 Discr_Expr (D) := Error;
9947 Process_Discriminant_Expression (Constr, Discr);
9948 Discr_Expr (D) := Constr;
9951 Next_Discriminant (Discr);
9955 if No (Discr) and then Present (Constr) then
9956 Error_Msg_N ("too many discriminants given in constraint", Constr);
9957 return New_Elmt_List;
9960 -- Named associations can be given in any order, but if both positional
9961 -- and named associations are used in the same discriminant constraint,
9962 -- then positional associations must occur first, at their normal
9963 -- position. Hence once a named association is used, the rest of the
9964 -- discriminant constraint must use only named associations.
9966 while Present (Constr) loop
9968 -- Positional association forbidden after a named association
9970 if Nkind (Constr) /= N_Discriminant_Association then
9971 Error_Msg_N ("positional association follows named one", Constr);
9972 return New_Elmt_List;
9974 -- Otherwise it is a named association
9977 -- E records the type of the discriminants in the named
9978 -- association. All the discriminants specified in the same name
9979 -- association must have the same type.
9983 -- Search the list of discriminants in T to see if the simple name
9984 -- given in the constraint matches any of them.
9986 Id := First (Selector_Names (Constr));
9987 while Present (Id) loop
9990 -- If Original_Discriminant is present, we are processing a
9991 -- generic instantiation and this is an instance node. We need
9992 -- to find the name of the corresponding discriminant in the
9993 -- actual record type T and not the name of the discriminant in
9994 -- the generic formal. Example:
9997 -- type G (D : int) is private;
9999 -- subtype W is G (D => 1);
10001 -- type Rec (X : int) is record ... end record;
10002 -- package Q is new P (G => Rec);
10004 -- At the point of the instantiation, formal type G is Rec
10005 -- and therefore when reanalyzing "subtype W is G (D => 1);"
10006 -- which really looks like "subtype W is Rec (D => 1);" at
10007 -- the point of instantiation, we want to find the discriminant
10008 -- that corresponds to D in Rec, i.e. X.
10010 if Present (Original_Discriminant (Id))
10011 and then In_Instance
10013 Discr := Find_Corresponding_Discriminant (Id, T);
10017 Discr := First_Discriminant (T);
10018 while Present (Discr) loop
10019 if Chars (Discr) = Chars (Id) then
10024 Next_Discriminant (Discr);
10028 Error_Msg_N ("& does not match any discriminant", Id);
10029 return New_Elmt_List;
10031 -- If the parent type is a generic formal, preserve the
10032 -- name of the discriminant for subsequent instances.
10033 -- see comment at the beginning of this if statement.
10035 elsif Is_Generic_Type (Root_Type (T)) then
10036 Set_Original_Discriminant (Id, Discr);
10040 Position := Pos_Of_Discr (T, Discr);
10042 if Present (Discr_Expr (Position)) then
10043 Error_Msg_N ("duplicate constraint for discriminant&", Id);
10046 -- Each discriminant specified in the same named association
10047 -- must be associated with a separate copy of the
10048 -- corresponding expression.
10050 if Present (Next (Id)) then
10051 Expr := New_Copy_Tree (Expression (Constr));
10052 Set_Parent (Expr, Parent (Expression (Constr)));
10054 Expr := Expression (Constr);
10057 Discr_Expr (Position) := Expr;
10058 Process_Discriminant_Expression (Expr, Discr);
10061 -- A discriminant association with more than one discriminant
10062 -- name is only allowed if the named discriminants are all of
10063 -- the same type (RM 3.7.1(8)).
10066 E := Base_Type (Etype (Discr));
10068 elsif Base_Type (Etype (Discr)) /= E then
10070 ("all discriminants in an association " &
10071 "must have the same type", Id);
10081 -- A discriminant constraint must provide exactly one value for each
10082 -- discriminant of the type (RM 3.7.1(8)).
10084 for J in Discr_Expr'Range loop
10085 if No (Discr_Expr (J)) then
10086 Error_Msg_N ("too few discriminants given in constraint", C);
10087 return New_Elmt_List;
10091 -- Determine if there are discriminant expressions in the constraint
10093 for J in Discr_Expr'Range loop
10094 if Denotes_Discriminant
10095 (Discr_Expr (J), Check_Concurrent => True)
10097 Discrim_Present := True;
10101 -- Build an element list consisting of the expressions given in the
10102 -- discriminant constraint and apply the appropriate checks. The list
10103 -- is constructed after resolving any named discriminant associations
10104 -- and therefore the expressions appear in the textual order of the
10107 Discr := First_Discriminant (T);
10108 for J in Discr_Expr'Range loop
10109 if Discr_Expr (J) /= Error then
10110 Append_Elmt (Discr_Expr (J), Elist);
10112 -- If any of the discriminant constraints is given by a
10113 -- discriminant and we are in a derived type declaration we
10114 -- have a discriminant renaming. Establish link between new
10115 -- and old discriminant. The new discriminant has an implicit
10116 -- dereference if the old one does.
10118 if Denotes_Discriminant (Discr_Expr (J)) then
10119 if Derived_Def then
10121 New_Discr : constant Entity_Id := Entity (Discr_Expr (J));
10124 Set_Corresponding_Discriminant (New_Discr, Discr);
10125 Set_Has_Implicit_Dereference (New_Discr,
10126 Has_Implicit_Dereference (Discr));
10130 -- Force the evaluation of non-discriminant expressions.
10131 -- If we have found a discriminant in the constraint 3.4(26)
10132 -- and 3.8(18) demand that no range checks are performed are
10133 -- after evaluation. If the constraint is for a component
10134 -- definition that has a per-object constraint, expressions are
10135 -- evaluated but not checked either. In all other cases perform
10139 if Discrim_Present then
10142 elsif Nkind (Parent (Parent (Def))) = N_Component_Declaration
10143 and then Has_Per_Object_Constraint
10144 (Defining_Identifier (Parent (Parent (Def))))
10148 elsif Is_Access_Type (Etype (Discr)) then
10149 Apply_Constraint_Check (Discr_Expr (J), Etype (Discr));
10152 Apply_Range_Check (Discr_Expr (J), Etype (Discr));
10155 Force_Evaluation (Discr_Expr (J));
10158 -- Check that the designated type of an access discriminant's
10159 -- expression is not a class-wide type unless the discriminant's
10160 -- designated type is also class-wide.
10162 if Ekind (Etype (Discr)) = E_Anonymous_Access_Type
10163 and then not Is_Class_Wide_Type
10164 (Designated_Type (Etype (Discr)))
10165 and then Etype (Discr_Expr (J)) /= Any_Type
10166 and then Is_Class_Wide_Type
10167 (Designated_Type (Etype (Discr_Expr (J))))
10169 Wrong_Type (Discr_Expr (J), Etype (Discr));
10171 elsif Is_Access_Type (Etype (Discr))
10172 and then not Is_Access_Constant (Etype (Discr))
10173 and then Is_Access_Type (Etype (Discr_Expr (J)))
10174 and then Is_Access_Constant (Etype (Discr_Expr (J)))
10177 ("constraint for discriminant& must be access to variable",
10182 Next_Discriminant (Discr);
10186 end Build_Discriminant_Constraints;
10188 ---------------------------------
10189 -- Build_Discriminated_Subtype --
10190 ---------------------------------
10192 procedure Build_Discriminated_Subtype
10194 Def_Id : Entity_Id;
10196 Related_Nod : Node_Id;
10197 For_Access : Boolean := False)
10199 Has_Discrs : constant Boolean := Has_Discriminants (T);
10200 Constrained : constant Boolean :=
10202 and then not Is_Empty_Elmt_List (Elist)
10203 and then not Is_Class_Wide_Type (T))
10204 or else Is_Constrained (T);
10207 if Ekind (T) = E_Record_Type then
10209 Set_Ekind (Def_Id, E_Private_Subtype);
10210 Set_Is_For_Access_Subtype (Def_Id, True);
10212 Set_Ekind (Def_Id, E_Record_Subtype);
10215 -- Inherit preelaboration flag from base, for types for which it
10216 -- may have been set: records, private types, protected types.
10218 Set_Known_To_Have_Preelab_Init
10219 (Def_Id, Known_To_Have_Preelab_Init (T));
10221 elsif Ekind (T) = E_Task_Type then
10222 Set_Ekind (Def_Id, E_Task_Subtype);
10224 elsif Ekind (T) = E_Protected_Type then
10225 Set_Ekind (Def_Id, E_Protected_Subtype);
10226 Set_Known_To_Have_Preelab_Init
10227 (Def_Id, Known_To_Have_Preelab_Init (T));
10229 elsif Is_Private_Type (T) then
10230 Set_Ekind (Def_Id, Subtype_Kind (Ekind (T)));
10231 Set_Known_To_Have_Preelab_Init
10232 (Def_Id, Known_To_Have_Preelab_Init (T));
10234 -- Private subtypes may have private dependents
10236 Set_Private_Dependents (Def_Id, New_Elmt_List);
10238 elsif Is_Class_Wide_Type (T) then
10239 Set_Ekind (Def_Id, E_Class_Wide_Subtype);
10242 -- Incomplete type. Attach subtype to list of dependents, to be
10243 -- completed with full view of parent type, unless is it the
10244 -- designated subtype of a record component within an init_proc.
10245 -- This last case arises for a component of an access type whose
10246 -- designated type is incomplete (e.g. a Taft Amendment type).
10247 -- The designated subtype is within an inner scope, and needs no
10248 -- elaboration, because only the access type is needed in the
10249 -- initialization procedure.
10251 if Ekind (T) = E_Incomplete_Type then
10252 Set_Ekind (Def_Id, E_Incomplete_Subtype);
10254 Set_Ekind (Def_Id, Ekind (T));
10257 if For_Access and then Within_Init_Proc then
10260 Append_Elmt (Def_Id, Private_Dependents (T));
10264 Set_Etype (Def_Id, T);
10265 Init_Size_Align (Def_Id);
10266 Set_Has_Discriminants (Def_Id, Has_Discrs);
10267 Set_Is_Constrained (Def_Id, Constrained);
10269 Set_First_Entity (Def_Id, First_Entity (T));
10270 Set_Last_Entity (Def_Id, Last_Entity (T));
10271 Set_Has_Implicit_Dereference
10272 (Def_Id, Has_Implicit_Dereference (T));
10273 Set_Has_Pragma_Unreferenced_Objects
10274 (Def_Id, Has_Pragma_Unreferenced_Objects (T));
10276 -- If the subtype is the completion of a private declaration, there may
10277 -- have been representation clauses for the partial view, and they must
10278 -- be preserved. Build_Derived_Type chains the inherited clauses with
10279 -- the ones appearing on the extension. If this comes from a subtype
10280 -- declaration, all clauses are inherited.
10282 if No (First_Rep_Item (Def_Id)) then
10283 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
10286 if Is_Tagged_Type (T) then
10287 Set_Is_Tagged_Type (Def_Id);
10288 Set_No_Tagged_Streams_Pragma (Def_Id, No_Tagged_Streams_Pragma (T));
10289 Make_Class_Wide_Type (Def_Id);
10292 Set_Stored_Constraint (Def_Id, No_Elist);
10295 Set_Discriminant_Constraint (Def_Id, Elist);
10296 Set_Stored_Constraint_From_Discriminant_Constraint (Def_Id);
10299 if Is_Tagged_Type (T) then
10301 -- Ada 2005 (AI-251): In case of concurrent types we inherit the
10302 -- concurrent record type (which has the list of primitive
10305 if Ada_Version >= Ada_2005
10306 and then Is_Concurrent_Type (T)
10308 Set_Corresponding_Record_Type (Def_Id,
10309 Corresponding_Record_Type (T));
10311 Set_Direct_Primitive_Operations (Def_Id,
10312 Direct_Primitive_Operations (T));
10315 Set_Is_Abstract_Type (Def_Id, Is_Abstract_Type (T));
10318 -- Subtypes introduced by component declarations do not need to be
10319 -- marked as delayed, and do not get freeze nodes, because the semantics
10320 -- verifies that the parents of the subtypes are frozen before the
10321 -- enclosing record is frozen.
10323 if not Is_Type (Scope (Def_Id)) then
10324 Set_Depends_On_Private (Def_Id, Depends_On_Private (T));
10326 if Is_Private_Type (T)
10327 and then Present (Full_View (T))
10329 Conditional_Delay (Def_Id, Full_View (T));
10331 Conditional_Delay (Def_Id, T);
10335 if Is_Record_Type (T) then
10336 Set_Is_Limited_Record (Def_Id, Is_Limited_Record (T));
10339 and then not Is_Empty_Elmt_List (Elist)
10340 and then not For_Access
10342 Create_Constrained_Components (Def_Id, Related_Nod, T, Elist);
10344 elsif not For_Access then
10345 Set_Cloned_Subtype (Def_Id, T);
10348 end Build_Discriminated_Subtype;
10350 ---------------------------
10351 -- Build_Itype_Reference --
10352 ---------------------------
10354 procedure Build_Itype_Reference
10358 IR : constant Node_Id := Make_Itype_Reference (Sloc (Nod));
10361 -- Itype references are only created for use by the back-end
10363 if Inside_A_Generic then
10366 Set_Itype (IR, Ityp);
10368 -- If Nod is a library unit entity, then Insert_After won't work,
10369 -- because Nod is not a member of any list. Therefore, we use
10370 -- Add_Global_Declaration in this case. This can happen if we have a
10371 -- build-in-place library function.
10373 if (Nkind (Nod) in N_Entity and then Is_Compilation_Unit (Nod))
10375 (Nkind (Nod) = N_Defining_Program_Unit_Name
10376 and then Is_Compilation_Unit (Defining_Identifier (Nod)))
10378 Add_Global_Declaration (IR);
10380 Insert_After (Nod, IR);
10383 end Build_Itype_Reference;
10385 ------------------------
10386 -- Build_Scalar_Bound --
10387 ------------------------
10389 function Build_Scalar_Bound
10392 Der_T : Entity_Id) return Node_Id
10394 New_Bound : Entity_Id;
10397 -- Note: not clear why this is needed, how can the original bound
10398 -- be unanalyzed at this point? and if it is, what business do we
10399 -- have messing around with it? and why is the base type of the
10400 -- parent type the right type for the resolution. It probably is
10401 -- not. It is OK for the new bound we are creating, but not for
10402 -- the old one??? Still if it never happens, no problem.
10404 Analyze_And_Resolve (Bound, Base_Type (Par_T));
10406 if Nkind_In (Bound, N_Integer_Literal, N_Real_Literal) then
10407 New_Bound := New_Copy (Bound);
10408 Set_Etype (New_Bound, Der_T);
10409 Set_Analyzed (New_Bound);
10411 elsif Is_Entity_Name (Bound) then
10412 New_Bound := OK_Convert_To (Der_T, New_Copy (Bound));
10414 -- The following is almost certainly wrong. What business do we have
10415 -- relocating a node (Bound) that is presumably still attached to
10416 -- the tree elsewhere???
10419 New_Bound := OK_Convert_To (Der_T, Relocate_Node (Bound));
10422 Set_Etype (New_Bound, Der_T);
10424 end Build_Scalar_Bound;
10426 --------------------------------
10427 -- Build_Underlying_Full_View --
10428 --------------------------------
10430 procedure Build_Underlying_Full_View
10435 Loc : constant Source_Ptr := Sloc (N);
10436 Subt : constant Entity_Id :=
10437 Make_Defining_Identifier
10438 (Loc, New_External_Name (Chars (Typ), 'S'));
10445 procedure Set_Discriminant_Name (Id : Node_Id);
10446 -- If the derived type has discriminants, they may rename discriminants
10447 -- of the parent. When building the full view of the parent, we need to
10448 -- recover the names of the original discriminants if the constraint is
10449 -- given by named associations.
10451 ---------------------------
10452 -- Set_Discriminant_Name --
10453 ---------------------------
10455 procedure Set_Discriminant_Name (Id : Node_Id) is
10459 Set_Original_Discriminant (Id, Empty);
10461 if Has_Discriminants (Typ) then
10462 Disc := First_Discriminant (Typ);
10463 while Present (Disc) loop
10464 if Chars (Disc) = Chars (Id)
10465 and then Present (Corresponding_Discriminant (Disc))
10467 Set_Chars (Id, Chars (Corresponding_Discriminant (Disc)));
10469 Next_Discriminant (Disc);
10472 end Set_Discriminant_Name;
10474 -- Start of processing for Build_Underlying_Full_View
10477 if Nkind (N) = N_Full_Type_Declaration then
10478 Constr := Constraint (Subtype_Indication (Type_Definition (N)));
10480 elsif Nkind (N) = N_Subtype_Declaration then
10481 Constr := New_Copy_Tree (Constraint (Subtype_Indication (N)));
10483 elsif Nkind (N) = N_Component_Declaration then
10486 (Constraint (Subtype_Indication (Component_Definition (N))));
10489 raise Program_Error;
10492 C := First (Constraints (Constr));
10493 while Present (C) loop
10494 if Nkind (C) = N_Discriminant_Association then
10495 Id := First (Selector_Names (C));
10496 while Present (Id) loop
10497 Set_Discriminant_Name (Id);
10506 Make_Subtype_Declaration (Loc,
10507 Defining_Identifier => Subt,
10508 Subtype_Indication =>
10509 Make_Subtype_Indication (Loc,
10510 Subtype_Mark => New_Occurrence_Of (Par, Loc),
10511 Constraint => New_Copy_Tree (Constr)));
10513 -- If this is a component subtype for an outer itype, it is not
10514 -- a list member, so simply set the parent link for analysis: if
10515 -- the enclosing type does not need to be in a declarative list,
10516 -- neither do the components.
10518 if Is_List_Member (N)
10519 and then Nkind (N) /= N_Component_Declaration
10521 Insert_Before (N, Indic);
10523 Set_Parent (Indic, Parent (N));
10527 Set_Underlying_Full_View (Typ, Full_View (Subt));
10528 Set_Is_Underlying_Full_View (Full_View (Subt));
10529 end Build_Underlying_Full_View;
10531 -------------------------------
10532 -- Check_Abstract_Overriding --
10533 -------------------------------
10535 procedure Check_Abstract_Overriding (T : Entity_Id) is
10536 Alias_Subp : Entity_Id;
10538 Op_List : Elist_Id;
10540 Type_Def : Node_Id;
10542 procedure Check_Pragma_Implemented (Subp : Entity_Id);
10543 -- Ada 2012 (AI05-0030): Subprogram Subp overrides an interface routine
10544 -- which has pragma Implemented already set. Check whether Subp's entity
10545 -- kind conforms to the implementation kind of the overridden routine.
10547 procedure Check_Pragma_Implemented
10549 Iface_Subp : Entity_Id);
10550 -- Ada 2012 (AI05-0030): Subprogram Subp overrides interface routine
10551 -- Iface_Subp and both entities have pragma Implemented already set on
10552 -- them. Check whether the two implementation kinds are conforming.
10554 procedure Inherit_Pragma_Implemented
10556 Iface_Subp : Entity_Id);
10557 -- Ada 2012 (AI05-0030): Interface primitive Subp overrides interface
10558 -- subprogram Iface_Subp which has been marked by pragma Implemented.
10559 -- Propagate the implementation kind of Iface_Subp to Subp.
10561 ------------------------------
10562 -- Check_Pragma_Implemented --
10563 ------------------------------
10565 procedure Check_Pragma_Implemented (Subp : Entity_Id) is
10566 Iface_Alias : constant Entity_Id := Interface_Alias (Subp);
10567 Impl_Kind : constant Name_Id := Implementation_Kind (Iface_Alias);
10568 Subp_Alias : constant Entity_Id := Alias (Subp);
10569 Contr_Typ : Entity_Id;
10570 Impl_Subp : Entity_Id;
10573 -- Subp must have an alias since it is a hidden entity used to link
10574 -- an interface subprogram to its overriding counterpart.
10576 pragma Assert (Present (Subp_Alias));
10578 -- Handle aliases to synchronized wrappers
10580 Impl_Subp := Subp_Alias;
10582 if Is_Primitive_Wrapper (Impl_Subp) then
10583 Impl_Subp := Wrapped_Entity (Impl_Subp);
10586 -- Extract the type of the controlling formal
10588 Contr_Typ := Etype (First_Formal (Subp_Alias));
10590 if Is_Concurrent_Record_Type (Contr_Typ) then
10591 Contr_Typ := Corresponding_Concurrent_Type (Contr_Typ);
10594 -- An interface subprogram whose implementation kind is By_Entry must
10595 -- be implemented by an entry.
10597 if Impl_Kind = Name_By_Entry
10598 and then Ekind (Impl_Subp) /= E_Entry
10600 Error_Msg_Node_2 := Iface_Alias;
10602 ("type & must implement abstract subprogram & with an entry",
10603 Subp_Alias, Contr_Typ);
10605 elsif Impl_Kind = Name_By_Protected_Procedure then
10607 -- An interface subprogram whose implementation kind is By_
10608 -- Protected_Procedure cannot be implemented by a primitive
10609 -- procedure of a task type.
10611 if Ekind (Contr_Typ) /= E_Protected_Type then
10612 Error_Msg_Node_2 := Contr_Typ;
10614 ("interface subprogram & cannot be implemented by a " &
10615 "primitive procedure of task type &", Subp_Alias,
10618 -- An interface subprogram whose implementation kind is By_
10619 -- Protected_Procedure must be implemented by a procedure.
10621 elsif Ekind (Impl_Subp) /= E_Procedure then
10622 Error_Msg_Node_2 := Iface_Alias;
10624 ("type & must implement abstract subprogram & with a " &
10625 "procedure", Subp_Alias, Contr_Typ);
10627 elsif Present (Get_Rep_Pragma (Impl_Subp, Name_Implemented))
10628 and then Implementation_Kind (Impl_Subp) /= Impl_Kind
10630 Error_Msg_Name_1 := Impl_Kind;
10632 ("overriding operation& must have synchronization%",
10636 -- If primitive has Optional synchronization, overriding operation
10637 -- must match if it has an explicit synchronization..
10639 elsif Present (Get_Rep_Pragma (Impl_Subp, Name_Implemented))
10640 and then Implementation_Kind (Impl_Subp) /= Impl_Kind
10642 Error_Msg_Name_1 := Impl_Kind;
10644 ("overriding operation& must have syncrhonization%",
10647 end Check_Pragma_Implemented;
10649 ------------------------------
10650 -- Check_Pragma_Implemented --
10651 ------------------------------
10653 procedure Check_Pragma_Implemented
10655 Iface_Subp : Entity_Id)
10657 Iface_Kind : constant Name_Id := Implementation_Kind (Iface_Subp);
10658 Subp_Kind : constant Name_Id := Implementation_Kind (Subp);
10661 -- Ada 2012 (AI05-0030): The implementation kinds of an overridden
10662 -- and overriding subprogram are different. In general this is an
10663 -- error except when the implementation kind of the overridden
10664 -- subprograms is By_Any or Optional.
10666 if Iface_Kind /= Subp_Kind
10667 and then Iface_Kind /= Name_By_Any
10668 and then Iface_Kind /= Name_Optional
10670 if Iface_Kind = Name_By_Entry then
10672 ("incompatible implementation kind, overridden subprogram " &
10673 "is marked By_Entry", Subp);
10676 ("incompatible implementation kind, overridden subprogram " &
10677 "is marked By_Protected_Procedure", Subp);
10680 end Check_Pragma_Implemented;
10682 --------------------------------
10683 -- Inherit_Pragma_Implemented --
10684 --------------------------------
10686 procedure Inherit_Pragma_Implemented
10688 Iface_Subp : Entity_Id)
10690 Iface_Kind : constant Name_Id := Implementation_Kind (Iface_Subp);
10691 Loc : constant Source_Ptr := Sloc (Subp);
10692 Impl_Prag : Node_Id;
10695 -- Since the implementation kind is stored as a representation item
10696 -- rather than a flag, create a pragma node.
10700 Chars => Name_Implemented,
10701 Pragma_Argument_Associations => New_List (
10702 Make_Pragma_Argument_Association (Loc,
10703 Expression => New_Occurrence_Of (Subp, Loc)),
10705 Make_Pragma_Argument_Association (Loc,
10706 Expression => Make_Identifier (Loc, Iface_Kind))));
10708 -- The pragma doesn't need to be analyzed because it is internally
10709 -- built. It is safe to directly register it as a rep item since we
10710 -- are only interested in the characters of the implementation kind.
10712 Record_Rep_Item (Subp, Impl_Prag);
10713 end Inherit_Pragma_Implemented;
10715 -- Start of processing for Check_Abstract_Overriding
10718 Op_List := Primitive_Operations (T);
10720 -- Loop to check primitive operations
10722 Elmt := First_Elmt (Op_List);
10723 while Present (Elmt) loop
10724 Subp := Node (Elmt);
10725 Alias_Subp := Alias (Subp);
10727 -- Inherited subprograms are identified by the fact that they do not
10728 -- come from source, and the associated source location is the
10729 -- location of the first subtype of the derived type.
10731 -- Ada 2005 (AI-228): Apply the rules of RM-3.9.3(6/2) for
10732 -- subprograms that "require overriding".
10734 -- Special exception, do not complain about failure to override the
10735 -- stream routines _Input and _Output, as well as the primitive
10736 -- operations used in dispatching selects since we always provide
10737 -- automatic overridings for these subprograms.
10739 -- The partial view of T may have been a private extension, for
10740 -- which inherited functions dispatching on result are abstract.
10741 -- If the full view is a null extension, there is no need for
10742 -- overriding in Ada 2005, but wrappers need to be built for them
10743 -- (see exp_ch3, Build_Controlling_Function_Wrappers).
10745 if Is_Null_Extension (T)
10746 and then Has_Controlling_Result (Subp)
10747 and then Ada_Version >= Ada_2005
10748 and then Present (Alias_Subp)
10749 and then not Comes_From_Source (Subp)
10750 and then not Is_Abstract_Subprogram (Alias_Subp)
10751 and then not Is_Access_Type (Etype (Subp))
10755 -- Ada 2005 (AI-251): Internal entities of interfaces need no
10756 -- processing because this check is done with the aliased
10759 elsif Present (Interface_Alias (Subp)) then
10762 elsif (Is_Abstract_Subprogram (Subp)
10763 or else Requires_Overriding (Subp)
10765 (Has_Controlling_Result (Subp)
10766 and then Present (Alias_Subp)
10767 and then not Comes_From_Source (Subp)
10768 and then Sloc (Subp) = Sloc (First_Subtype (T))))
10769 and then not Is_TSS (Subp, TSS_Stream_Input)
10770 and then not Is_TSS (Subp, TSS_Stream_Output)
10771 and then not Is_Abstract_Type (T)
10772 and then not Is_Predefined_Interface_Primitive (Subp)
10774 -- Ada 2005 (AI-251): Do not consider hidden entities associated
10775 -- with abstract interface types because the check will be done
10776 -- with the aliased entity (otherwise we generate a duplicated
10779 and then not Present (Interface_Alias (Subp))
10781 if Present (Alias_Subp) then
10783 -- Only perform the check for a derived subprogram when the
10784 -- type has an explicit record extension. This avoids incorrect
10785 -- flagging of abstract subprograms for the case of a type
10786 -- without an extension that is derived from a formal type
10787 -- with a tagged actual (can occur within a private part).
10789 -- Ada 2005 (AI-391): In the case of an inherited function with
10790 -- a controlling result of the type, the rule does not apply if
10791 -- the type is a null extension (unless the parent function
10792 -- itself is abstract, in which case the function must still be
10793 -- be overridden). The expander will generate an overriding
10794 -- wrapper function calling the parent subprogram (see
10795 -- Exp_Ch3.Make_Controlling_Wrapper_Functions).
10797 Type_Def := Type_Definition (Parent (T));
10799 if Nkind (Type_Def) = N_Derived_Type_Definition
10800 and then Present (Record_Extension_Part (Type_Def))
10802 (Ada_Version < Ada_2005
10803 or else not Is_Null_Extension (T)
10804 or else Ekind (Subp) = E_Procedure
10805 or else not Has_Controlling_Result (Subp)
10806 or else Is_Abstract_Subprogram (Alias_Subp)
10807 or else Requires_Overriding (Subp)
10808 or else Is_Access_Type (Etype (Subp)))
10810 -- Avoid reporting error in case of abstract predefined
10811 -- primitive inherited from interface type because the
10812 -- body of internally generated predefined primitives
10813 -- of tagged types are generated later by Freeze_Type
10815 if Is_Interface (Root_Type (T))
10816 and then Is_Abstract_Subprogram (Subp)
10817 and then Is_Predefined_Dispatching_Operation (Subp)
10818 and then not Comes_From_Source (Ultimate_Alias (Subp))
10822 -- A null extension is not obliged to override an inherited
10823 -- procedure subject to pragma Extensions_Visible with value
10824 -- False and at least one controlling OUT parameter
10825 -- (SPARK RM 6.1.7(6)).
10827 elsif Is_Null_Extension (T)
10828 and then Is_EVF_Procedure (Subp)
10834 ("type must be declared abstract or & overridden",
10837 -- Traverse the whole chain of aliased subprograms to
10838 -- complete the error notification. This is especially
10839 -- useful for traceability of the chain of entities when
10840 -- the subprogram corresponds with an interface
10841 -- subprogram (which may be defined in another package).
10843 if Present (Alias_Subp) then
10849 while Present (Alias (E)) loop
10851 -- Avoid reporting redundant errors on entities
10852 -- inherited from interfaces
10854 if Sloc (E) /= Sloc (T) then
10855 Error_Msg_Sloc := Sloc (E);
10857 ("\& has been inherited #", T, Subp);
10863 Error_Msg_Sloc := Sloc (E);
10865 -- AI05-0068: report if there is an overriding
10866 -- non-abstract subprogram that is invisible.
10869 and then not Is_Abstract_Subprogram (E)
10872 ("\& subprogram# is not visible",
10875 -- Clarify the case where a non-null extension must
10876 -- override inherited procedure subject to pragma
10877 -- Extensions_Visible with value False and at least
10878 -- one controlling OUT param.
10880 elsif Is_EVF_Procedure (E) then
10882 ("\& # is subject to Extensions_Visible False",
10887 ("\& has been inherited from subprogram #",
10894 -- Ada 2005 (AI-345): Protected or task type implementing
10895 -- abstract interfaces.
10897 elsif Is_Concurrent_Record_Type (T)
10898 and then Present (Interfaces (T))
10900 -- There is no need to check here RM 9.4(11.9/3) since we
10901 -- are processing the corresponding record type and the
10902 -- mode of the overriding subprograms was verified by
10903 -- Check_Conformance when the corresponding concurrent
10904 -- type declaration was analyzed.
10907 ("interface subprogram & must be overridden", T, Subp);
10909 -- Examine primitive operations of synchronized type to find
10910 -- homonyms that have the wrong profile.
10916 Prim := First_Entity (Corresponding_Concurrent_Type (T));
10917 while Present (Prim) loop
10918 if Chars (Prim) = Chars (Subp) then
10920 ("profile is not type conformant with prefixed "
10921 & "view profile of inherited operation&",
10925 Next_Entity (Prim);
10931 Error_Msg_Node_2 := T;
10933 ("abstract subprogram& not allowed for type&", Subp);
10935 -- Also post unconditional warning on the type (unconditional
10936 -- so that if there are more than one of these cases, we get
10937 -- them all, and not just the first one).
10939 Error_Msg_Node_2 := Subp;
10940 Error_Msg_N ("nonabstract type& has abstract subprogram&!", T);
10943 -- A subprogram subject to pragma Extensions_Visible with value
10944 -- "True" cannot override a subprogram subject to the same pragma
10945 -- with value "False" (SPARK RM 6.1.7(5)).
10947 elsif Extensions_Visible_Status (Subp) = Extensions_Visible_True
10948 and then Present (Overridden_Operation (Subp))
10949 and then Extensions_Visible_Status (Overridden_Operation (Subp)) =
10950 Extensions_Visible_False
10952 Error_Msg_Sloc := Sloc (Overridden_Operation (Subp));
10954 ("subprogram & with Extensions_Visible True cannot override "
10955 & "subprogram # with Extensions_Visible False", Subp);
10958 -- Ada 2012 (AI05-0030): Perform checks related to pragma Implemented
10960 -- Subp is an expander-generated procedure which maps an interface
10961 -- alias to a protected wrapper. The interface alias is flagged by
10962 -- pragma Implemented. Ensure that Subp is a procedure when the
10963 -- implementation kind is By_Protected_Procedure or an entry when
10966 if Ada_Version >= Ada_2012
10967 and then Is_Hidden (Subp)
10968 and then Present (Interface_Alias (Subp))
10969 and then Has_Rep_Pragma (Interface_Alias (Subp), Name_Implemented)
10971 Check_Pragma_Implemented (Subp);
10974 -- Subp is an interface primitive which overrides another interface
10975 -- primitive marked with pragma Implemented.
10977 if Ada_Version >= Ada_2012
10978 and then Present (Overridden_Operation (Subp))
10979 and then Has_Rep_Pragma
10980 (Overridden_Operation (Subp), Name_Implemented)
10982 -- If the overriding routine is also marked by Implemented, check
10983 -- that the two implementation kinds are conforming.
10985 if Has_Rep_Pragma (Subp, Name_Implemented) then
10986 Check_Pragma_Implemented
10988 Iface_Subp => Overridden_Operation (Subp));
10990 -- Otherwise the overriding routine inherits the implementation
10991 -- kind from the overridden subprogram.
10994 Inherit_Pragma_Implemented
10996 Iface_Subp => Overridden_Operation (Subp));
11000 -- If the operation is a wrapper for a synchronized primitive, it
11001 -- may be called indirectly through a dispatching select. We assume
11002 -- that it will be referenced elsewhere indirectly, and suppress
11003 -- warnings about an unused entity.
11005 if Is_Primitive_Wrapper (Subp)
11006 and then Present (Wrapped_Entity (Subp))
11008 Set_Referenced (Wrapped_Entity (Subp));
11013 end Check_Abstract_Overriding;
11015 ------------------------------------------------
11016 -- Check_Access_Discriminant_Requires_Limited --
11017 ------------------------------------------------
11019 procedure Check_Access_Discriminant_Requires_Limited
11024 -- A discriminant_specification for an access discriminant shall appear
11025 -- only in the declaration for a task or protected type, or for a type
11026 -- with the reserved word 'limited' in its definition or in one of its
11027 -- ancestors (RM 3.7(10)).
11029 -- AI-0063: The proper condition is that type must be immutably limited,
11030 -- or else be a partial view.
11032 if Nkind (Discriminant_Type (D)) = N_Access_Definition then
11033 if Is_Limited_View (Current_Scope)
11035 (Nkind (Parent (Current_Scope)) = N_Private_Type_Declaration
11036 and then Limited_Present (Parent (Current_Scope)))
11042 ("access discriminants allowed only for limited types", Loc);
11045 end Check_Access_Discriminant_Requires_Limited;
11047 -----------------------------------
11048 -- Check_Aliased_Component_Types --
11049 -----------------------------------
11051 procedure Check_Aliased_Component_Types (T : Entity_Id) is
11055 -- ??? Also need to check components of record extensions, but not
11056 -- components of protected types (which are always limited).
11058 -- Ada 2005: AI-363 relaxes this rule, to allow heap objects of such
11059 -- types to be unconstrained. This is safe because it is illegal to
11060 -- create access subtypes to such types with explicit discriminant
11063 if not Is_Limited_Type (T) then
11064 if Ekind (T) = E_Record_Type then
11065 C := First_Component (T);
11066 while Present (C) loop
11068 and then Has_Discriminants (Etype (C))
11069 and then not Is_Constrained (Etype (C))
11070 and then not In_Instance_Body
11071 and then Ada_Version < Ada_2005
11074 ("aliased component must be constrained (RM 3.6(11))",
11078 Next_Component (C);
11081 elsif Ekind (T) = E_Array_Type then
11082 if Has_Aliased_Components (T)
11083 and then Has_Discriminants (Component_Type (T))
11084 and then not Is_Constrained (Component_Type (T))
11085 and then not In_Instance_Body
11086 and then Ada_Version < Ada_2005
11089 ("aliased component type must be constrained (RM 3.6(11))",
11094 end Check_Aliased_Component_Types;
11096 ---------------------------------------
11097 -- Check_Anonymous_Access_Components --
11098 ---------------------------------------
11100 procedure Check_Anonymous_Access_Components
11101 (Typ_Decl : Node_Id;
11104 Comp_List : Node_Id)
11106 Loc : constant Source_Ptr := Sloc (Typ_Decl);
11107 Anon_Access : Entity_Id;
11110 Comp_Def : Node_Id;
11112 Type_Def : Node_Id;
11114 procedure Build_Incomplete_Type_Declaration;
11115 -- If the record type contains components that include an access to the
11116 -- current record, then create an incomplete type declaration for the
11117 -- record, to be used as the designated type of the anonymous access.
11118 -- This is done only once, and only if there is no previous partial
11119 -- view of the type.
11121 function Designates_T (Subt : Node_Id) return Boolean;
11122 -- Check whether a node designates the enclosing record type, or 'Class
11125 function Mentions_T (Acc_Def : Node_Id) return Boolean;
11126 -- Check whether an access definition includes a reference to
11127 -- the enclosing record type. The reference can be a subtype mark
11128 -- in the access definition itself, a 'Class attribute reference, or
11129 -- recursively a reference appearing in a parameter specification
11130 -- or result definition of an access_to_subprogram definition.
11132 --------------------------------------
11133 -- Build_Incomplete_Type_Declaration --
11134 --------------------------------------
11136 procedure Build_Incomplete_Type_Declaration is
11141 -- Is_Tagged indicates whether the type is tagged. It is tagged if
11142 -- it's "is new ... with record" or else "is tagged record ...".
11144 Is_Tagged : constant Boolean :=
11145 (Nkind (Type_Definition (Typ_Decl)) = N_Derived_Type_Definition
11147 Present (Record_Extension_Part (Type_Definition (Typ_Decl))))
11149 (Nkind (Type_Definition (Typ_Decl)) = N_Record_Definition
11150 and then Tagged_Present (Type_Definition (Typ_Decl)));
11153 -- If there is a previous partial view, no need to create a new one
11154 -- If the partial view, given by Prev, is incomplete, If Prev is
11155 -- a private declaration, full declaration is flagged accordingly.
11157 if Prev /= Typ then
11159 Make_Class_Wide_Type (Prev);
11160 Set_Class_Wide_Type (Typ, Class_Wide_Type (Prev));
11161 Set_Etype (Class_Wide_Type (Typ), Typ);
11166 elsif Has_Private_Declaration (Typ) then
11168 -- If we refer to T'Class inside T, and T is the completion of a
11169 -- private type, then make sure the class-wide type exists.
11172 Make_Class_Wide_Type (Typ);
11177 -- If there was a previous anonymous access type, the incomplete
11178 -- type declaration will have been created already.
11180 elsif Present (Current_Entity (Typ))
11181 and then Ekind (Current_Entity (Typ)) = E_Incomplete_Type
11182 and then Full_View (Current_Entity (Typ)) = Typ
11185 and then Comes_From_Source (Current_Entity (Typ))
11186 and then not Is_Tagged_Type (Current_Entity (Typ))
11188 Make_Class_Wide_Type (Typ);
11190 ("incomplete view of tagged type should be declared tagged??",
11191 Parent (Current_Entity (Typ)));
11196 Inc_T := Make_Defining_Identifier (Loc, Chars (Typ));
11197 Decl := Make_Incomplete_Type_Declaration (Loc, Inc_T);
11199 -- Type has already been inserted into the current scope. Remove
11200 -- it, and add incomplete declaration for type, so that subsequent
11201 -- anonymous access types can use it. The entity is unchained from
11202 -- the homonym list and from immediate visibility. After analysis,
11203 -- the entity in the incomplete declaration becomes immediately
11204 -- visible in the record declaration that follows.
11206 H := Current_Entity (Typ);
11209 Set_Name_Entity_Id (Chars (Typ), Homonym (Typ));
11212 and then Homonym (H) /= Typ
11214 H := Homonym (Typ);
11217 Set_Homonym (H, Homonym (Typ));
11220 Insert_Before (Typ_Decl, Decl);
11222 Set_Full_View (Inc_T, Typ);
11226 -- Create a common class-wide type for both views, and set the
11227 -- Etype of the class-wide type to the full view.
11229 Make_Class_Wide_Type (Inc_T);
11230 Set_Class_Wide_Type (Typ, Class_Wide_Type (Inc_T));
11231 Set_Etype (Class_Wide_Type (Typ), Typ);
11234 end Build_Incomplete_Type_Declaration;
11240 function Designates_T (Subt : Node_Id) return Boolean is
11241 Type_Id : constant Name_Id := Chars (Typ);
11243 function Names_T (Nam : Node_Id) return Boolean;
11244 -- The record type has not been introduced in the current scope
11245 -- yet, so we must examine the name of the type itself, either
11246 -- an identifier T, or an expanded name of the form P.T, where
11247 -- P denotes the current scope.
11253 function Names_T (Nam : Node_Id) return Boolean is
11255 if Nkind (Nam) = N_Identifier then
11256 return Chars (Nam) = Type_Id;
11258 elsif Nkind (Nam) = N_Selected_Component then
11259 if Chars (Selector_Name (Nam)) = Type_Id then
11260 if Nkind (Prefix (Nam)) = N_Identifier then
11261 return Chars (Prefix (Nam)) = Chars (Current_Scope);
11263 elsif Nkind (Prefix (Nam)) = N_Selected_Component then
11264 return Chars (Selector_Name (Prefix (Nam))) =
11265 Chars (Current_Scope);
11279 -- Start of processing for Designates_T
11282 if Nkind (Subt) = N_Identifier then
11283 return Chars (Subt) = Type_Id;
11285 -- Reference can be through an expanded name which has not been
11286 -- analyzed yet, and which designates enclosing scopes.
11288 elsif Nkind (Subt) = N_Selected_Component then
11289 if Names_T (Subt) then
11292 -- Otherwise it must denote an entity that is already visible.
11293 -- The access definition may name a subtype of the enclosing
11294 -- type, if there is a previous incomplete declaration for it.
11297 Find_Selected_Component (Subt);
11299 Is_Entity_Name (Subt)
11300 and then Scope (Entity (Subt)) = Current_Scope
11302 (Chars (Base_Type (Entity (Subt))) = Type_Id
11304 (Is_Class_Wide_Type (Entity (Subt))
11306 Chars (Etype (Base_Type (Entity (Subt)))) =
11310 -- A reference to the current type may appear as the prefix of
11311 -- a 'Class attribute.
11313 elsif Nkind (Subt) = N_Attribute_Reference
11314 and then Attribute_Name (Subt) = Name_Class
11316 return Names_T (Prefix (Subt));
11327 function Mentions_T (Acc_Def : Node_Id) return Boolean is
11328 Param_Spec : Node_Id;
11330 Acc_Subprg : constant Node_Id :=
11331 Access_To_Subprogram_Definition (Acc_Def);
11334 if No (Acc_Subprg) then
11335 return Designates_T (Subtype_Mark (Acc_Def));
11338 -- Component is an access_to_subprogram: examine its formals,
11339 -- and result definition in the case of an access_to_function.
11341 Param_Spec := First (Parameter_Specifications (Acc_Subprg));
11342 while Present (Param_Spec) loop
11343 if Nkind (Parameter_Type (Param_Spec)) = N_Access_Definition
11344 and then Mentions_T (Parameter_Type (Param_Spec))
11348 elsif Designates_T (Parameter_Type (Param_Spec)) then
11355 if Nkind (Acc_Subprg) = N_Access_Function_Definition then
11356 if Nkind (Result_Definition (Acc_Subprg)) =
11357 N_Access_Definition
11359 return Mentions_T (Result_Definition (Acc_Subprg));
11361 return Designates_T (Result_Definition (Acc_Subprg));
11368 -- Start of processing for Check_Anonymous_Access_Components
11371 if No (Comp_List) then
11375 Comp := First (Component_Items (Comp_List));
11376 while Present (Comp) loop
11377 if Nkind (Comp) = N_Component_Declaration
11379 (Access_Definition (Component_Definition (Comp)))
11381 Mentions_T (Access_Definition (Component_Definition (Comp)))
11383 Comp_Def := Component_Definition (Comp);
11385 Access_To_Subprogram_Definition (Access_Definition (Comp_Def));
11387 Build_Incomplete_Type_Declaration;
11388 Anon_Access := Make_Temporary (Loc, 'S');
11390 -- Create a declaration for the anonymous access type: either
11391 -- an access_to_object or an access_to_subprogram.
11393 if Present (Acc_Def) then
11394 if Nkind (Acc_Def) = N_Access_Function_Definition then
11396 Make_Access_Function_Definition (Loc,
11397 Parameter_Specifications =>
11398 Parameter_Specifications (Acc_Def),
11399 Result_Definition => Result_Definition (Acc_Def));
11402 Make_Access_Procedure_Definition (Loc,
11403 Parameter_Specifications =>
11404 Parameter_Specifications (Acc_Def));
11409 Make_Access_To_Object_Definition (Loc,
11410 Subtype_Indication =>
11412 (Subtype_Mark (Access_Definition (Comp_Def))));
11414 Set_Constant_Present
11415 (Type_Def, Constant_Present (Access_Definition (Comp_Def)));
11417 (Type_Def, All_Present (Access_Definition (Comp_Def)));
11420 Set_Null_Exclusion_Present
11422 Null_Exclusion_Present (Access_Definition (Comp_Def)));
11425 Make_Full_Type_Declaration (Loc,
11426 Defining_Identifier => Anon_Access,
11427 Type_Definition => Type_Def);
11429 Insert_Before (Typ_Decl, Decl);
11432 -- If an access to subprogram, create the extra formals
11434 if Present (Acc_Def) then
11435 Create_Extra_Formals (Designated_Type (Anon_Access));
11437 -- If an access to object, preserve entity of designated type,
11438 -- for ASIS use, before rewriting the component definition.
11445 Desig := Entity (Subtype_Indication (Type_Def));
11447 -- If the access definition is to the current record,
11448 -- the visible entity at this point is an incomplete
11449 -- type. Retrieve the full view to simplify ASIS queries
11451 if Ekind (Desig) = E_Incomplete_Type then
11452 Desig := Full_View (Desig);
11456 (Subtype_Mark (Access_Definition (Comp_Def)), Desig);
11461 Make_Component_Definition (Loc,
11462 Subtype_Indication =>
11463 New_Occurrence_Of (Anon_Access, Loc)));
11465 if Ekind (Designated_Type (Anon_Access)) = E_Subprogram_Type then
11466 Set_Ekind (Anon_Access, E_Anonymous_Access_Subprogram_Type);
11468 Set_Ekind (Anon_Access, E_Anonymous_Access_Type);
11471 Set_Is_Local_Anonymous_Access (Anon_Access);
11477 if Present (Variant_Part (Comp_List)) then
11481 V := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
11482 while Present (V) loop
11483 Check_Anonymous_Access_Components
11484 (Typ_Decl, Typ, Prev, Component_List (V));
11485 Next_Non_Pragma (V);
11489 end Check_Anonymous_Access_Components;
11491 ----------------------
11492 -- Check_Completion --
11493 ----------------------
11495 procedure Check_Completion (Body_Id : Node_Id := Empty) is
11498 procedure Post_Error;
11499 -- Post error message for lack of completion for entity E
11505 procedure Post_Error is
11506 procedure Missing_Body;
11507 -- Output missing body message
11513 procedure Missing_Body is
11515 -- Spec is in same unit, so we can post on spec
11517 if In_Same_Source_Unit (Body_Id, E) then
11518 Error_Msg_N ("missing body for &", E);
11520 -- Spec is in a separate unit, so we have to post on the body
11523 Error_Msg_NE ("missing body for & declared#!", Body_Id, E);
11527 -- Start of processing for Post_Error
11530 if not Comes_From_Source (E) then
11531 if Ekind_In (E, E_Task_Type, E_Protected_Type) then
11533 -- It may be an anonymous protected type created for a
11534 -- single variable. Post error on variable, if present.
11540 Var := First_Entity (Current_Scope);
11541 while Present (Var) loop
11542 exit when Etype (Var) = E
11543 and then Comes_From_Source (Var);
11548 if Present (Var) then
11555 -- If a generated entity has no completion, then either previous
11556 -- semantic errors have disabled the expansion phase, or else we had
11557 -- missing subunits, or else we are compiling without expansion,
11558 -- or else something is very wrong.
11560 if not Comes_From_Source (E) then
11562 (Serious_Errors_Detected > 0
11563 or else Configurable_Run_Time_Violations > 0
11564 or else Subunits_Missing
11565 or else not Expander_Active);
11568 -- Here for source entity
11571 -- Here if no body to post the error message, so we post the error
11572 -- on the declaration that has no completion. This is not really
11573 -- the right place to post it, think about this later ???
11575 if No (Body_Id) then
11576 if Is_Type (E) then
11578 ("missing full declaration for }", Parent (E), E);
11580 Error_Msg_NE ("missing body for &", Parent (E), E);
11583 -- Package body has no completion for a declaration that appears
11584 -- in the corresponding spec. Post error on the body, with a
11585 -- reference to the non-completed declaration.
11588 Error_Msg_Sloc := Sloc (E);
11590 if Is_Type (E) then
11591 Error_Msg_NE ("missing full declaration for }!", Body_Id, E);
11593 elsif Is_Overloadable (E)
11594 and then Current_Entity_In_Scope (E) /= E
11596 -- It may be that the completion is mistyped and appears as
11597 -- a distinct overloading of the entity.
11600 Candidate : constant Entity_Id :=
11601 Current_Entity_In_Scope (E);
11602 Decl : constant Node_Id :=
11603 Unit_Declaration_Node (Candidate);
11606 if Is_Overloadable (Candidate)
11607 and then Ekind (Candidate) = Ekind (E)
11608 and then Nkind (Decl) = N_Subprogram_Body
11609 and then Acts_As_Spec (Decl)
11611 Check_Type_Conformant (Candidate, E);
11627 Pack_Id : constant Entity_Id := Current_Scope;
11629 -- Start of processing for Check_Completion
11632 E := First_Entity (Pack_Id);
11633 while Present (E) loop
11634 if Is_Intrinsic_Subprogram (E) then
11637 -- The following situation requires special handling: a child unit
11638 -- that appears in the context clause of the body of its parent:
11640 -- procedure Parent.Child (...);
11642 -- with Parent.Child;
11643 -- package body Parent is
11645 -- Here Parent.Child appears as a local entity, but should not be
11646 -- flagged as requiring completion, because it is a compilation
11649 -- Ignore missing completion for a subprogram that does not come from
11650 -- source (including the _Call primitive operation of RAS types,
11651 -- which has to have the flag Comes_From_Source for other purposes):
11652 -- we assume that the expander will provide the missing completion.
11653 -- In case of previous errors, other expansion actions that provide
11654 -- bodies for null procedures with not be invoked, so inhibit message
11657 -- Note that E_Operator is not in the list that follows, because
11658 -- this kind is reserved for predefined operators, that are
11659 -- intrinsic and do not need completion.
11661 elsif Ekind_In (E, E_Function,
11663 E_Generic_Function,
11664 E_Generic_Procedure)
11666 if Has_Completion (E) then
11669 elsif Is_Subprogram (E) and then Is_Abstract_Subprogram (E) then
11672 elsif Is_Subprogram (E)
11673 and then (not Comes_From_Source (E)
11674 or else Chars (E) = Name_uCall)
11679 Nkind (Parent (Unit_Declaration_Node (E))) = N_Compilation_Unit
11683 elsif Nkind (Parent (E)) = N_Procedure_Specification
11684 and then Null_Present (Parent (E))
11685 and then Serious_Errors_Detected > 0
11693 elsif Is_Entry (E) then
11694 if not Has_Completion (E) and then
11695 (Ekind (Scope (E)) = E_Protected_Object
11696 or else Ekind (Scope (E)) = E_Protected_Type)
11701 elsif Is_Package_Or_Generic_Package (E) then
11702 if Unit_Requires_Body (E) then
11703 if not Has_Completion (E)
11704 and then Nkind (Parent (Unit_Declaration_Node (E))) /=
11710 elsif not Is_Child_Unit (E) then
11711 May_Need_Implicit_Body (E);
11714 -- A formal incomplete type (Ada 2012) does not require a completion;
11715 -- other incomplete type declarations do.
11717 elsif Ekind (E) = E_Incomplete_Type
11718 and then No (Underlying_Type (E))
11719 and then not Is_Generic_Type (E)
11723 elsif Ekind_In (E, E_Task_Type, E_Protected_Type)
11724 and then not Has_Completion (E)
11728 -- A single task declared in the current scope is a constant, verify
11729 -- that the body of its anonymous type is in the same scope. If the
11730 -- task is defined elsewhere, this may be a renaming declaration for
11731 -- which no completion is needed.
11733 elsif Ekind (E) = E_Constant
11734 and then Ekind (Etype (E)) = E_Task_Type
11735 and then not Has_Completion (Etype (E))
11736 and then Scope (Etype (E)) = Current_Scope
11740 elsif Ekind (E) = E_Protected_Object
11741 and then not Has_Completion (Etype (E))
11745 elsif Ekind (E) = E_Record_Type then
11746 if Is_Tagged_Type (E) then
11747 Check_Abstract_Overriding (E);
11748 Check_Conventions (E);
11751 Check_Aliased_Component_Types (E);
11753 elsif Ekind (E) = E_Array_Type then
11754 Check_Aliased_Component_Types (E);
11760 end Check_Completion;
11762 ------------------------------------
11763 -- Check_CPP_Type_Has_No_Defaults --
11764 ------------------------------------
11766 procedure Check_CPP_Type_Has_No_Defaults (T : Entity_Id) is
11767 Tdef : constant Node_Id := Type_Definition (Declaration_Node (T));
11772 -- Obtain the component list
11774 if Nkind (Tdef) = N_Record_Definition then
11775 Clist := Component_List (Tdef);
11776 else pragma Assert (Nkind (Tdef) = N_Derived_Type_Definition);
11777 Clist := Component_List (Record_Extension_Part (Tdef));
11780 -- Check all components to ensure no default expressions
11782 if Present (Clist) then
11783 Comp := First (Component_Items (Clist));
11784 while Present (Comp) loop
11785 if Present (Expression (Comp)) then
11787 ("component of imported 'C'P'P type cannot have "
11788 & "default expression", Expression (Comp));
11794 end Check_CPP_Type_Has_No_Defaults;
11796 ----------------------------
11797 -- Check_Delta_Expression --
11798 ----------------------------
11800 procedure Check_Delta_Expression (E : Node_Id) is
11802 if not (Is_Real_Type (Etype (E))) then
11803 Wrong_Type (E, Any_Real);
11805 elsif not Is_OK_Static_Expression (E) then
11806 Flag_Non_Static_Expr
11807 ("non-static expression used for delta value!", E);
11809 elsif not UR_Is_Positive (Expr_Value_R (E)) then
11810 Error_Msg_N ("delta expression must be positive", E);
11816 -- If any of above errors occurred, then replace the incorrect
11817 -- expression by the real 0.1, which should prevent further errors.
11820 Make_Real_Literal (Sloc (E), Ureal_Tenth));
11821 Analyze_And_Resolve (E, Standard_Float);
11822 end Check_Delta_Expression;
11824 -----------------------------
11825 -- Check_Digits_Expression --
11826 -----------------------------
11828 procedure Check_Digits_Expression (E : Node_Id) is
11830 if not (Is_Integer_Type (Etype (E))) then
11831 Wrong_Type (E, Any_Integer);
11833 elsif not Is_OK_Static_Expression (E) then
11834 Flag_Non_Static_Expr
11835 ("non-static expression used for digits value!", E);
11837 elsif Expr_Value (E) <= 0 then
11838 Error_Msg_N ("digits value must be greater than zero", E);
11844 -- If any of above errors occurred, then replace the incorrect
11845 -- expression by the integer 1, which should prevent further errors.
11847 Rewrite (E, Make_Integer_Literal (Sloc (E), 1));
11848 Analyze_And_Resolve (E, Standard_Integer);
11850 end Check_Digits_Expression;
11852 --------------------------
11853 -- Check_Initialization --
11854 --------------------------
11856 procedure Check_Initialization (T : Entity_Id; Exp : Node_Id) is
11858 -- Special processing for limited types
11860 if Is_Limited_Type (T)
11861 and then not In_Instance
11862 and then not In_Inlined_Body
11864 if not OK_For_Limited_Init (T, Exp) then
11866 -- In GNAT mode, this is just a warning, to allow it to be evilly
11867 -- turned off. Otherwise it is a real error.
11871 ("??cannot initialize entities of limited type!", Exp);
11873 elsif Ada_Version < Ada_2005 then
11875 -- The side effect removal machinery may generate illegal Ada
11876 -- code to avoid the usage of access types and 'reference in
11877 -- SPARK mode. Since this is legal code with respect to theorem
11878 -- proving, do not emit the error.
11881 and then Nkind (Exp) = N_Function_Call
11882 and then Nkind (Parent (Exp)) = N_Object_Declaration
11883 and then not Comes_From_Source
11884 (Defining_Identifier (Parent (Exp)))
11890 ("cannot initialize entities of limited type", Exp);
11891 Explain_Limited_Type (T, Exp);
11895 -- Specialize error message according to kind of illegal
11896 -- initial expression.
11898 if Nkind (Exp) = N_Type_Conversion
11899 and then Nkind (Expression (Exp)) = N_Function_Call
11901 -- No error for internally-generated object declarations,
11902 -- which can come from build-in-place assignment statements.
11904 if Nkind (Parent (Exp)) = N_Object_Declaration
11905 and then not Comes_From_Source
11906 (Defining_Identifier (Parent (Exp)))
11912 ("illegal context for call to function with limited "
11918 ("initialization of limited object requires aggregate or "
11919 & "function call", Exp);
11925 -- In gnatc or gnatprove mode, make sure set Do_Range_Check flag gets
11926 -- set unless we can be sure that no range check is required.
11928 if (GNATprove_Mode or not Expander_Active)
11929 and then Is_Scalar_Type (T)
11930 and then not Is_In_Range (Exp, T, Assume_Valid => True)
11932 Set_Do_Range_Check (Exp);
11934 end Check_Initialization;
11936 ----------------------
11937 -- Check_Interfaces --
11938 ----------------------
11940 procedure Check_Interfaces (N : Node_Id; Def : Node_Id) is
11941 Parent_Type : constant Entity_Id := Etype (Defining_Identifier (N));
11944 Iface_Def : Node_Id;
11945 Iface_Typ : Entity_Id;
11946 Parent_Node : Node_Id;
11948 Is_Task : Boolean := False;
11949 -- Set True if parent type or any progenitor is a task interface
11951 Is_Protected : Boolean := False;
11952 -- Set True if parent type or any progenitor is a protected interface
11954 procedure Check_Ifaces (Iface_Def : Node_Id; Error_Node : Node_Id);
11955 -- Check that a progenitor is compatible with declaration. If an error
11956 -- message is output, it is posted on Error_Node.
11962 procedure Check_Ifaces (Iface_Def : Node_Id; Error_Node : Node_Id) is
11963 Iface_Id : constant Entity_Id :=
11964 Defining_Identifier (Parent (Iface_Def));
11965 Type_Def : Node_Id;
11968 if Nkind (N) = N_Private_Extension_Declaration then
11971 Type_Def := Type_Definition (N);
11974 if Is_Task_Interface (Iface_Id) then
11977 elsif Is_Protected_Interface (Iface_Id) then
11978 Is_Protected := True;
11981 if Is_Synchronized_Interface (Iface_Id) then
11983 -- A consequence of 3.9.4 (6/2) and 7.3 (7.2/2) is that a private
11984 -- extension derived from a synchronized interface must explicitly
11985 -- be declared synchronized, because the full view will be a
11986 -- synchronized type.
11988 if Nkind (N) = N_Private_Extension_Declaration then
11989 if not Synchronized_Present (N) then
11991 ("private extension of& must be explicitly synchronized",
11995 -- However, by 3.9.4(16/2), a full type that is a record extension
11996 -- is never allowed to derive from a synchronized interface (note
11997 -- that interfaces must be excluded from this check, because those
11998 -- are represented by derived type definitions in some cases).
12000 elsif Nkind (Type_Definition (N)) = N_Derived_Type_Definition
12001 and then not Interface_Present (Type_Definition (N))
12003 Error_Msg_N ("record extension cannot derive from synchronized "
12004 & "interface", Error_Node);
12008 -- Check that the characteristics of the progenitor are compatible
12009 -- with the explicit qualifier in the declaration.
12010 -- The check only applies to qualifiers that come from source.
12011 -- Limited_Present also appears in the declaration of corresponding
12012 -- records, and the check does not apply to them.
12014 if Limited_Present (Type_Def)
12016 Is_Concurrent_Record_Type (Defining_Identifier (N))
12018 if Is_Limited_Interface (Parent_Type)
12019 and then not Is_Limited_Interface (Iface_Id)
12022 ("progenitor & must be limited interface",
12023 Error_Node, Iface_Id);
12026 (Task_Present (Iface_Def)
12027 or else Protected_Present (Iface_Def)
12028 or else Synchronized_Present (Iface_Def))
12029 and then Nkind (N) /= N_Private_Extension_Declaration
12030 and then not Error_Posted (N)
12033 ("progenitor & must be limited interface",
12034 Error_Node, Iface_Id);
12037 -- Protected interfaces can only inherit from limited, synchronized
12038 -- or protected interfaces.
12040 elsif Nkind (N) = N_Full_Type_Declaration
12041 and then Protected_Present (Type_Def)
12043 if Limited_Present (Iface_Def)
12044 or else Synchronized_Present (Iface_Def)
12045 or else Protected_Present (Iface_Def)
12049 elsif Task_Present (Iface_Def) then
12050 Error_Msg_N ("(Ada 2005) protected interface cannot inherit "
12051 & "from task interface", Error_Node);
12054 Error_Msg_N ("(Ada 2005) protected interface cannot inherit "
12055 & "from non-limited interface", Error_Node);
12058 -- Ada 2005 (AI-345): Synchronized interfaces can only inherit from
12059 -- limited and synchronized.
12061 elsif Synchronized_Present (Type_Def) then
12062 if Limited_Present (Iface_Def)
12063 or else Synchronized_Present (Iface_Def)
12067 elsif Protected_Present (Iface_Def)
12068 and then Nkind (N) /= N_Private_Extension_Declaration
12070 Error_Msg_N ("(Ada 2005) synchronized interface cannot inherit "
12071 & "from protected interface", Error_Node);
12073 elsif Task_Present (Iface_Def)
12074 and then Nkind (N) /= N_Private_Extension_Declaration
12076 Error_Msg_N ("(Ada 2005) synchronized interface cannot inherit "
12077 & "from task interface", Error_Node);
12079 elsif not Is_Limited_Interface (Iface_Id) then
12080 Error_Msg_N ("(Ada 2005) synchronized interface cannot inherit "
12081 & "from non-limited interface", Error_Node);
12084 -- Ada 2005 (AI-345): Task interfaces can only inherit from limited,
12085 -- synchronized or task interfaces.
12087 elsif Nkind (N) = N_Full_Type_Declaration
12088 and then Task_Present (Type_Def)
12090 if Limited_Present (Iface_Def)
12091 or else Synchronized_Present (Iface_Def)
12092 or else Task_Present (Iface_Def)
12096 elsif Protected_Present (Iface_Def) then
12097 Error_Msg_N ("(Ada 2005) task interface cannot inherit from "
12098 & "protected interface", Error_Node);
12101 Error_Msg_N ("(Ada 2005) task interface cannot inherit from "
12102 & "non-limited interface", Error_Node);
12107 -- Start of processing for Check_Interfaces
12110 if Is_Interface (Parent_Type) then
12111 if Is_Task_Interface (Parent_Type) then
12114 elsif Is_Protected_Interface (Parent_Type) then
12115 Is_Protected := True;
12119 if Nkind (N) = N_Private_Extension_Declaration then
12121 -- Check that progenitors are compatible with declaration
12123 Iface := First (Interface_List (Def));
12124 while Present (Iface) loop
12125 Iface_Typ := Find_Type_Of_Subtype_Indic (Iface);
12127 Parent_Node := Parent (Base_Type (Iface_Typ));
12128 Iface_Def := Type_Definition (Parent_Node);
12130 if not Is_Interface (Iface_Typ) then
12131 Diagnose_Interface (Iface, Iface_Typ);
12133 Check_Ifaces (Iface_Def, Iface);
12139 if Is_Task and Is_Protected then
12141 ("type cannot derive from task and protected interface", N);
12147 -- Full type declaration of derived type.
12148 -- Check compatibility with parent if it is interface type
12150 if Nkind (Type_Definition (N)) = N_Derived_Type_Definition
12151 and then Is_Interface (Parent_Type)
12153 Parent_Node := Parent (Parent_Type);
12155 -- More detailed checks for interface varieties
12158 (Iface_Def => Type_Definition (Parent_Node),
12159 Error_Node => Subtype_Indication (Type_Definition (N)));
12162 Iface := First (Interface_List (Def));
12163 while Present (Iface) loop
12164 Iface_Typ := Find_Type_Of_Subtype_Indic (Iface);
12166 Parent_Node := Parent (Base_Type (Iface_Typ));
12167 Iface_Def := Type_Definition (Parent_Node);
12169 if not Is_Interface (Iface_Typ) then
12170 Diagnose_Interface (Iface, Iface_Typ);
12173 -- "The declaration of a specific descendant of an interface
12174 -- type freezes the interface type" RM 13.14
12176 Freeze_Before (N, Iface_Typ);
12177 Check_Ifaces (Iface_Def, Error_Node => Iface);
12183 if Is_Task and Is_Protected then
12185 ("type cannot derive from task and protected interface", N);
12187 end Check_Interfaces;
12189 ------------------------------------
12190 -- Check_Or_Process_Discriminants --
12191 ------------------------------------
12193 -- If an incomplete or private type declaration was already given for the
12194 -- type, the discriminants may have already been processed if they were
12195 -- present on the incomplete declaration. In this case a full conformance
12196 -- check has been performed in Find_Type_Name, and we then recheck here
12197 -- some properties that can't be checked on the partial view alone.
12198 -- Otherwise we call Process_Discriminants.
12200 procedure Check_Or_Process_Discriminants
12203 Prev : Entity_Id := Empty)
12206 if Has_Discriminants (T) then
12208 -- Discriminants are already set on T if they were already present
12209 -- on the partial view. Make them visible to component declarations.
12213 -- Discriminant on T (full view) referencing expr on partial view
12215 Prev_D : Entity_Id;
12216 -- Entity of corresponding discriminant on partial view
12219 -- Discriminant specification for full view, expression is
12220 -- the syntactic copy on full view (which has been checked for
12221 -- conformance with partial view), only used here to post error
12225 D := First_Discriminant (T);
12226 New_D := First (Discriminant_Specifications (N));
12227 while Present (D) loop
12228 Prev_D := Current_Entity (D);
12229 Set_Current_Entity (D);
12230 Set_Is_Immediately_Visible (D);
12231 Set_Homonym (D, Prev_D);
12233 -- Handle the case where there is an untagged partial view and
12234 -- the full view is tagged: must disallow discriminants with
12235 -- defaults, unless compiling for Ada 2012, which allows a
12236 -- limited tagged type to have defaulted discriminants (see
12237 -- AI05-0214). However, suppress error here if it was already
12238 -- reported on the default expression of the partial view.
12240 if Is_Tagged_Type (T)
12241 and then Present (Expression (Parent (D)))
12242 and then (not Is_Limited_Type (Current_Scope)
12243 or else Ada_Version < Ada_2012)
12244 and then not Error_Posted (Expression (Parent (D)))
12246 if Ada_Version >= Ada_2012 then
12248 ("discriminants of nonlimited tagged type cannot have "
12250 Expression (New_D));
12253 ("discriminants of tagged type cannot have defaults",
12254 Expression (New_D));
12258 -- Ada 2005 (AI-230): Access discriminant allowed in
12259 -- non-limited record types.
12261 if Ada_Version < Ada_2005 then
12263 -- This restriction gets applied to the full type here. It
12264 -- has already been applied earlier to the partial view.
12266 Check_Access_Discriminant_Requires_Limited (Parent (D), N);
12269 Next_Discriminant (D);
12274 elsif Present (Discriminant_Specifications (N)) then
12275 Process_Discriminants (N, Prev);
12277 end Check_Or_Process_Discriminants;
12279 ----------------------
12280 -- Check_Real_Bound --
12281 ----------------------
12283 procedure Check_Real_Bound (Bound : Node_Id) is
12285 if not Is_Real_Type (Etype (Bound)) then
12287 ("bound in real type definition must be of real type", Bound);
12289 elsif not Is_OK_Static_Expression (Bound) then
12290 Flag_Non_Static_Expr
12291 ("non-static expression used for real type bound!", Bound);
12298 (Bound, Make_Real_Literal (Sloc (Bound), Ureal_0));
12300 Resolve (Bound, Standard_Float);
12301 end Check_Real_Bound;
12303 ------------------------------
12304 -- Complete_Private_Subtype --
12305 ------------------------------
12307 procedure Complete_Private_Subtype
12310 Full_Base : Entity_Id;
12311 Related_Nod : Node_Id)
12313 Save_Next_Entity : Entity_Id;
12314 Save_Homonym : Entity_Id;
12317 -- Set semantic attributes for (implicit) private subtype completion.
12318 -- If the full type has no discriminants, then it is a copy of the
12319 -- full view of the base. Otherwise, it is a subtype of the base with
12320 -- a possible discriminant constraint. Save and restore the original
12321 -- Next_Entity field of full to ensure that the calls to Copy_Node do
12322 -- not corrupt the entity chain.
12324 -- Note that the type of the full view is the same entity as the type
12325 -- of the partial view. In this fashion, the subtype has access to the
12326 -- correct view of the parent.
12327 -- The list below included access types, but this leads to several
12328 -- regressions. How should the base type of the full view be
12329 -- set consistently for subtypes completed by access types?
12331 Save_Next_Entity := Next_Entity (Full);
12332 Save_Homonym := Homonym (Priv);
12334 case Ekind (Full_Base) is
12335 when Class_Wide_Kind
12342 Copy_Node (Priv, Full);
12344 Set_Has_Discriminants
12345 (Full, Has_Discriminants (Full_Base));
12346 Set_Has_Unknown_Discriminants
12347 (Full, Has_Unknown_Discriminants (Full_Base));
12348 Set_First_Entity (Full, First_Entity (Full_Base));
12349 Set_Last_Entity (Full, Last_Entity (Full_Base));
12351 -- If the underlying base type is constrained, we know that the
12352 -- full view of the subtype is constrained as well (the converse
12353 -- is not necessarily true).
12355 if Is_Constrained (Full_Base) then
12356 Set_Is_Constrained (Full);
12360 Copy_Node (Full_Base, Full);
12362 Set_Chars (Full, Chars (Priv));
12363 Conditional_Delay (Full, Priv);
12364 Set_Sloc (Full, Sloc (Priv));
12367 Link_Entities (Full, Save_Next_Entity);
12368 Set_Homonym (Full, Save_Homonym);
12369 Set_Associated_Node_For_Itype (Full, Related_Nod);
12371 -- Set common attributes for all subtypes: kind, convention, etc.
12373 Set_Ekind (Full, Subtype_Kind (Ekind (Full_Base)));
12374 Set_Convention (Full, Convention (Full_Base));
12376 -- The Etype of the full view is inconsistent. Gigi needs to see the
12377 -- structural full view, which is what the current scheme gives: the
12378 -- Etype of the full view is the etype of the full base. However, if the
12379 -- full base is a derived type, the full view then looks like a subtype
12380 -- of the parent, not a subtype of the full base. If instead we write:
12382 -- Set_Etype (Full, Full_Base);
12384 -- then we get inconsistencies in the front-end (confusion between
12385 -- views). Several outstanding bugs are related to this ???
12387 Set_Is_First_Subtype (Full, False);
12388 Set_Scope (Full, Scope (Priv));
12389 Set_Size_Info (Full, Full_Base);
12390 Set_RM_Size (Full, RM_Size (Full_Base));
12391 Set_Is_Itype (Full);
12393 -- For the unusual case of a type with unknown discriminants whose
12394 -- completion is an array, use the proper full base.
12396 if Is_Array_Type (Full_Base)
12397 and then Has_Unknown_Discriminants (Priv)
12399 Set_Etype (Full, Full_Base);
12402 -- A subtype of a private-type-without-discriminants, whose full-view
12403 -- has discriminants with default expressions, is not constrained.
12405 if not Has_Discriminants (Priv) then
12406 Set_Is_Constrained (Full, Is_Constrained (Full_Base));
12408 if Has_Discriminants (Full_Base) then
12409 Set_Discriminant_Constraint
12410 (Full, Discriminant_Constraint (Full_Base));
12412 -- The partial view may have been indefinite, the full view
12415 Set_Has_Unknown_Discriminants
12416 (Full, Has_Unknown_Discriminants (Full_Base));
12420 Set_First_Rep_Item (Full, First_Rep_Item (Full_Base));
12421 Set_Depends_On_Private (Full, Has_Private_Component (Full));
12423 -- Freeze the private subtype entity if its parent is delayed, and not
12424 -- already frozen. We skip this processing if the type is an anonymous
12425 -- subtype of a record component, or is the corresponding record of a
12426 -- protected type, since these are processed when the enclosing type
12427 -- is frozen. If the parent type is declared in a nested package then
12428 -- the freezing of the private and full views also happens later.
12430 if not Is_Type (Scope (Full)) then
12432 and then In_Same_Source_Unit (Full, Full_Base)
12433 and then Scope (Full_Base) /= Scope (Full)
12435 Set_Has_Delayed_Freeze (Full);
12436 Set_Has_Delayed_Freeze (Priv);
12439 Set_Has_Delayed_Freeze (Full,
12440 Has_Delayed_Freeze (Full_Base)
12441 and then not Is_Frozen (Full_Base));
12445 Set_Freeze_Node (Full, Empty);
12446 Set_Is_Frozen (Full, False);
12447 Set_Full_View (Priv, Full);
12449 if Has_Discriminants (Full) then
12450 Set_Stored_Constraint_From_Discriminant_Constraint (Full);
12451 Set_Stored_Constraint (Priv, Stored_Constraint (Full));
12453 if Has_Unknown_Discriminants (Full) then
12454 Set_Discriminant_Constraint (Full, No_Elist);
12458 if Ekind (Full_Base) = E_Record_Type
12459 and then Has_Discriminants (Full_Base)
12460 and then Has_Discriminants (Priv) -- might not, if errors
12461 and then not Has_Unknown_Discriminants (Priv)
12462 and then not Is_Empty_Elmt_List (Discriminant_Constraint (Priv))
12464 Create_Constrained_Components
12465 (Full, Related_Nod, Full_Base, Discriminant_Constraint (Priv));
12467 -- If the full base is itself derived from private, build a congruent
12468 -- subtype of its underlying type, for use by the back end. For a
12469 -- constrained record component, the declaration cannot be placed on
12470 -- the component list, but it must nevertheless be built an analyzed, to
12471 -- supply enough information for Gigi to compute the size of component.
12473 elsif Ekind (Full_Base) in Private_Kind
12474 and then Is_Derived_Type (Full_Base)
12475 and then Has_Discriminants (Full_Base)
12476 and then (Ekind (Current_Scope) /= E_Record_Subtype)
12478 if not Is_Itype (Priv)
12480 Nkind (Subtype_Indication (Parent (Priv))) = N_Subtype_Indication
12482 Build_Underlying_Full_View
12483 (Parent (Priv), Full, Etype (Full_Base));
12485 elsif Nkind (Related_Nod) = N_Component_Declaration then
12486 Build_Underlying_Full_View (Related_Nod, Full, Etype (Full_Base));
12489 elsif Is_Record_Type (Full_Base) then
12491 -- Show Full is simply a renaming of Full_Base
12493 Set_Cloned_Subtype (Full, Full_Base);
12496 -- It is unsafe to share the bounds of a scalar type, because the Itype
12497 -- is elaborated on demand, and if a bound is nonstatic, then different
12498 -- orders of elaboration in different units will lead to different
12499 -- external symbols.
12501 if Is_Scalar_Type (Full_Base) then
12502 Set_Scalar_Range (Full,
12503 Make_Range (Sloc (Related_Nod),
12505 Duplicate_Subexpr_No_Checks (Type_Low_Bound (Full_Base)),
12507 Duplicate_Subexpr_No_Checks (Type_High_Bound (Full_Base))));
12509 -- This completion inherits the bounds of the full parent, but if
12510 -- the parent is an unconstrained floating point type, so is the
12513 if Is_Floating_Point_Type (Full_Base) then
12514 Set_Includes_Infinities
12515 (Scalar_Range (Full), Has_Infinities (Full_Base));
12519 -- ??? It seems that a lot of fields are missing that should be copied
12520 -- from Full_Base to Full. Here are some that are introduced in a
12521 -- non-disruptive way but a cleanup is necessary.
12523 if Is_Tagged_Type (Full_Base) then
12524 Set_Is_Tagged_Type (Full);
12525 Set_Direct_Primitive_Operations
12526 (Full, Direct_Primitive_Operations (Full_Base));
12527 Set_No_Tagged_Streams_Pragma
12528 (Full, No_Tagged_Streams_Pragma (Full_Base));
12530 -- Inherit class_wide type of full_base in case the partial view was
12531 -- not tagged. Otherwise it has already been created when the private
12532 -- subtype was analyzed.
12534 if No (Class_Wide_Type (Full)) then
12535 Set_Class_Wide_Type (Full, Class_Wide_Type (Full_Base));
12538 -- If this is a subtype of a protected or task type, constrain its
12539 -- corresponding record, unless this is a subtype without constraints,
12540 -- i.e. a simple renaming as with an actual subtype in an instance.
12542 elsif Is_Concurrent_Type (Full_Base) then
12543 if Has_Discriminants (Full)
12544 and then Present (Corresponding_Record_Type (Full_Base))
12546 not Is_Empty_Elmt_List (Discriminant_Constraint (Full))
12548 Set_Corresponding_Record_Type (Full,
12549 Constrain_Corresponding_Record
12550 (Full, Corresponding_Record_Type (Full_Base), Related_Nod));
12553 Set_Corresponding_Record_Type (Full,
12554 Corresponding_Record_Type (Full_Base));
12558 -- Link rep item chain, and also setting of Has_Predicates from private
12559 -- subtype to full subtype, since we will need these on the full subtype
12560 -- to create the predicate function. Note that the full subtype may
12561 -- already have rep items, inherited from the full view of the base
12562 -- type, so we must be sure not to overwrite these entries.
12567 Next_Item : Node_Id;
12568 Priv_Item : Node_Id;
12571 Item := First_Rep_Item (Full);
12572 Priv_Item := First_Rep_Item (Priv);
12574 -- If no existing rep items on full type, we can just link directly
12575 -- to the list of items on the private type, if any exist.. Same if
12576 -- the rep items are only those inherited from the base
12579 or else Nkind (Item) /= N_Aspect_Specification
12580 or else Entity (Item) = Full_Base)
12581 and then Present (First_Rep_Item (Priv))
12583 Set_First_Rep_Item (Full, Priv_Item);
12585 -- Otherwise, search to the end of items currently linked to the full
12586 -- subtype and append the private items to the end. However, if Priv
12587 -- and Full already have the same list of rep items, then the append
12588 -- is not done, as that would create a circularity.
12590 -- The partial view may have a predicate and the rep item lists of
12591 -- both views agree when inherited from the same ancestor. In that
12592 -- case, simply propagate the list from one view to the other.
12593 -- A more complex analysis needed here ???
12595 elsif Present (Priv_Item)
12596 and then Item = Next_Rep_Item (Priv_Item)
12598 Set_First_Rep_Item (Full, Priv_Item);
12600 elsif Item /= Priv_Item then
12603 Next_Item := Next_Rep_Item (Item);
12604 exit when No (Next_Item);
12607 -- If the private view has aspect specifications, the full view
12608 -- inherits them. Since these aspects may already have been
12609 -- attached to the full view during derivation, do not append
12610 -- them if already present.
12612 if Item = First_Rep_Item (Priv) then
12618 -- And link the private type items at the end of the chain
12621 Set_Next_Rep_Item (Item, First_Rep_Item (Priv));
12626 -- Make sure Has_Predicates is set on full type if it is set on the
12627 -- private type. Note that it may already be set on the full type and
12628 -- if so, we don't want to unset it. Similarly, propagate information
12629 -- about delayed aspects, because the corresponding pragmas must be
12630 -- analyzed when one of the views is frozen. This last step is needed
12631 -- in particular when the full type is a scalar type for which an
12632 -- anonymous base type is constructed.
12634 -- The predicate functions are generated either at the freeze point
12635 -- of the type or at the end of the visible part, and we must avoid
12636 -- generating them twice.
12638 if Has_Predicates (Priv) then
12639 Set_Has_Predicates (Full);
12641 if Present (Predicate_Function (Priv))
12642 and then No (Predicate_Function (Full))
12644 Set_Predicate_Function (Full, Predicate_Function (Priv));
12648 if Has_Delayed_Aspects (Priv) then
12649 Set_Has_Delayed_Aspects (Full);
12651 end Complete_Private_Subtype;
12653 ----------------------------
12654 -- Constant_Redeclaration --
12655 ----------------------------
12657 procedure Constant_Redeclaration
12662 Prev : constant Entity_Id := Current_Entity_In_Scope (Id);
12663 Obj_Def : constant Node_Id := Object_Definition (N);
12666 procedure Check_Possible_Deferred_Completion
12667 (Prev_Id : Entity_Id;
12668 Prev_Obj_Def : Node_Id;
12669 Curr_Obj_Def : Node_Id);
12670 -- Determine whether the two object definitions describe the partial
12671 -- and the full view of a constrained deferred constant. Generate
12672 -- a subtype for the full view and verify that it statically matches
12673 -- the subtype of the partial view.
12675 procedure Check_Recursive_Declaration (Typ : Entity_Id);
12676 -- If deferred constant is an access type initialized with an allocator,
12677 -- check whether there is an illegal recursion in the definition,
12678 -- through a default value of some record subcomponent. This is normally
12679 -- detected when generating init procs, but requires this additional
12680 -- mechanism when expansion is disabled.
12682 ----------------------------------------
12683 -- Check_Possible_Deferred_Completion --
12684 ----------------------------------------
12686 procedure Check_Possible_Deferred_Completion
12687 (Prev_Id : Entity_Id;
12688 Prev_Obj_Def : Node_Id;
12689 Curr_Obj_Def : Node_Id)
12692 if Nkind (Prev_Obj_Def) = N_Subtype_Indication
12693 and then Present (Constraint (Prev_Obj_Def))
12694 and then Nkind (Curr_Obj_Def) = N_Subtype_Indication
12695 and then Present (Constraint (Curr_Obj_Def))
12698 Loc : constant Source_Ptr := Sloc (N);
12699 Def_Id : constant Entity_Id := Make_Temporary (Loc, 'S');
12700 Decl : constant Node_Id :=
12701 Make_Subtype_Declaration (Loc,
12702 Defining_Identifier => Def_Id,
12703 Subtype_Indication =>
12704 Relocate_Node (Curr_Obj_Def));
12707 Insert_Before_And_Analyze (N, Decl);
12708 Set_Etype (Id, Def_Id);
12710 if not Subtypes_Statically_Match (Etype (Prev_Id), Def_Id) then
12711 Error_Msg_Sloc := Sloc (Prev_Id);
12712 Error_Msg_N ("subtype does not statically match deferred "
12713 & "declaration #", N);
12717 end Check_Possible_Deferred_Completion;
12719 ---------------------------------
12720 -- Check_Recursive_Declaration --
12721 ---------------------------------
12723 procedure Check_Recursive_Declaration (Typ : Entity_Id) is
12727 if Is_Record_Type (Typ) then
12728 Comp := First_Component (Typ);
12729 while Present (Comp) loop
12730 if Comes_From_Source (Comp) then
12731 if Present (Expression (Parent (Comp)))
12732 and then Is_Entity_Name (Expression (Parent (Comp)))
12733 and then Entity (Expression (Parent (Comp))) = Prev
12735 Error_Msg_Sloc := Sloc (Parent (Comp));
12737 ("illegal circularity with declaration for & #",
12741 elsif Is_Record_Type (Etype (Comp)) then
12742 Check_Recursive_Declaration (Etype (Comp));
12746 Next_Component (Comp);
12749 end Check_Recursive_Declaration;
12751 -- Start of processing for Constant_Redeclaration
12754 if Nkind (Parent (Prev)) = N_Object_Declaration then
12755 if Nkind (Object_Definition
12756 (Parent (Prev))) = N_Subtype_Indication
12758 -- Find type of new declaration. The constraints of the two
12759 -- views must match statically, but there is no point in
12760 -- creating an itype for the full view.
12762 if Nkind (Obj_Def) = N_Subtype_Indication then
12763 Find_Type (Subtype_Mark (Obj_Def));
12764 New_T := Entity (Subtype_Mark (Obj_Def));
12767 Find_Type (Obj_Def);
12768 New_T := Entity (Obj_Def);
12774 -- The full view may impose a constraint, even if the partial
12775 -- view does not, so construct the subtype.
12777 New_T := Find_Type_Of_Object (Obj_Def, N);
12782 -- Current declaration is illegal, diagnosed below in Enter_Name
12788 -- If previous full declaration or a renaming declaration exists, or if
12789 -- a homograph is present, let Enter_Name handle it, either with an
12790 -- error or with the removal of an overridden implicit subprogram.
12791 -- The previous one is a full declaration if it has an expression
12792 -- (which in the case of an aggregate is indicated by the Init flag).
12794 if Ekind (Prev) /= E_Constant
12795 or else Nkind (Parent (Prev)) = N_Object_Renaming_Declaration
12796 or else Present (Expression (Parent (Prev)))
12797 or else Has_Init_Expression (Parent (Prev))
12798 or else Present (Full_View (Prev))
12802 -- Verify that types of both declarations match, or else that both types
12803 -- are anonymous access types whose designated subtypes statically match
12804 -- (as allowed in Ada 2005 by AI-385).
12806 elsif Base_Type (Etype (Prev)) /= Base_Type (New_T)
12808 (Ekind (Etype (Prev)) /= E_Anonymous_Access_Type
12809 or else Ekind (Etype (New_T)) /= E_Anonymous_Access_Type
12810 or else Is_Access_Constant (Etype (New_T)) /=
12811 Is_Access_Constant (Etype (Prev))
12812 or else Can_Never_Be_Null (Etype (New_T)) /=
12813 Can_Never_Be_Null (Etype (Prev))
12814 or else Null_Exclusion_Present (Parent (Prev)) /=
12815 Null_Exclusion_Present (Parent (Id))
12816 or else not Subtypes_Statically_Match
12817 (Designated_Type (Etype (Prev)),
12818 Designated_Type (Etype (New_T))))
12820 Error_Msg_Sloc := Sloc (Prev);
12821 Error_Msg_N ("type does not match declaration#", N);
12822 Set_Full_View (Prev, Id);
12823 Set_Etype (Id, Any_Type);
12825 -- A deferred constant whose type is an anonymous array is always
12826 -- illegal (unless imported). A detailed error message might be
12827 -- helpful for Ada beginners.
12829 if Nkind (Object_Definition (Parent (Prev)))
12830 = N_Constrained_Array_Definition
12831 and then Nkind (Object_Definition (N))
12832 = N_Constrained_Array_Definition
12834 Error_Msg_N ("\each anonymous array is a distinct type", N);
12835 Error_Msg_N ("a deferred constant must have a named type",
12836 Object_Definition (Parent (Prev)));
12840 Null_Exclusion_Present (Parent (Prev))
12841 and then not Null_Exclusion_Present (N)
12843 Error_Msg_Sloc := Sloc (Prev);
12844 Error_Msg_N ("null-exclusion does not match declaration#", N);
12845 Set_Full_View (Prev, Id);
12846 Set_Etype (Id, Any_Type);
12848 -- If so, process the full constant declaration
12851 -- RM 7.4 (6): If the subtype defined by the subtype_indication in
12852 -- the deferred declaration is constrained, then the subtype defined
12853 -- by the subtype_indication in the full declaration shall match it
12856 Check_Possible_Deferred_Completion
12858 Prev_Obj_Def => Object_Definition (Parent (Prev)),
12859 Curr_Obj_Def => Obj_Def);
12861 Set_Full_View (Prev, Id);
12862 Set_Is_Public (Id, Is_Public (Prev));
12863 Set_Is_Internal (Id);
12864 Append_Entity (Id, Current_Scope);
12866 -- Check ALIASED present if present before (RM 7.4(7))
12868 if Is_Aliased (Prev)
12869 and then not Aliased_Present (N)
12871 Error_Msg_Sloc := Sloc (Prev);
12872 Error_Msg_N ("ALIASED required (see declaration #)", N);
12875 -- Check that placement is in private part and that the incomplete
12876 -- declaration appeared in the visible part.
12878 if Ekind (Current_Scope) = E_Package
12879 and then not In_Private_Part (Current_Scope)
12881 Error_Msg_Sloc := Sloc (Prev);
12883 ("full constant for declaration # must be in private part", N);
12885 elsif Ekind (Current_Scope) = E_Package
12887 List_Containing (Parent (Prev)) /=
12888 Visible_Declarations (Package_Specification (Current_Scope))
12891 ("deferred constant must be declared in visible part",
12895 if Is_Access_Type (T)
12896 and then Nkind (Expression (N)) = N_Allocator
12898 Check_Recursive_Declaration (Designated_Type (T));
12901 -- A deferred constant is a visible entity. If type has invariants,
12902 -- verify that the initial value satisfies them. This is not done in
12903 -- GNATprove mode, as GNATprove handles invariant checks itself.
12905 if Has_Invariants (T)
12906 and then Present (Invariant_Procedure (T))
12907 and then not GNATprove_Mode
12910 Make_Invariant_Call (New_Occurrence_Of (Prev, Sloc (N))));
12913 end Constant_Redeclaration;
12915 ----------------------
12916 -- Constrain_Access --
12917 ----------------------
12919 procedure Constrain_Access
12920 (Def_Id : in out Entity_Id;
12922 Related_Nod : Node_Id)
12924 T : constant Entity_Id := Entity (Subtype_Mark (S));
12925 Desig_Type : constant Entity_Id := Designated_Type (T);
12926 Desig_Subtype : Entity_Id := Create_Itype (E_Void, Related_Nod);
12927 Constraint_OK : Boolean := True;
12930 if Is_Array_Type (Desig_Type) then
12931 Constrain_Array (Desig_Subtype, S, Related_Nod, Def_Id, 'P');
12933 elsif (Is_Record_Type (Desig_Type)
12934 or else Is_Incomplete_Or_Private_Type (Desig_Type))
12935 and then not Is_Constrained (Desig_Type)
12937 -- ??? The following code is a temporary bypass to ignore a
12938 -- discriminant constraint on access type if it is constraining
12939 -- the current record. Avoid creating the implicit subtype of the
12940 -- record we are currently compiling since right now, we cannot
12941 -- handle these. For now, just return the access type itself.
12943 if Desig_Type = Current_Scope
12944 and then No (Def_Id)
12946 Set_Ekind (Desig_Subtype, E_Record_Subtype);
12947 Def_Id := Entity (Subtype_Mark (S));
12949 -- This call added to ensure that the constraint is analyzed
12950 -- (needed for a B test). Note that we still return early from
12951 -- this procedure to avoid recursive processing. ???
12953 Constrain_Discriminated_Type
12954 (Desig_Subtype, S, Related_Nod, For_Access => True);
12958 -- Enforce rule that the constraint is illegal if there is an
12959 -- unconstrained view of the designated type. This means that the
12960 -- partial view (either a private type declaration or a derivation
12961 -- from a private type) has no discriminants. (Defect Report
12962 -- 8652/0008, Technical Corrigendum 1, checked by ACATS B371001).
12964 -- Rule updated for Ada 2005: The private type is said to have
12965 -- a constrained partial view, given that objects of the type
12966 -- can be declared. Furthermore, the rule applies to all access
12967 -- types, unlike the rule concerning default discriminants (see
12970 if (Ekind (T) = E_General_Access_Type or else Ada_Version >= Ada_2005)
12971 and then Has_Private_Declaration (Desig_Type)
12972 and then In_Open_Scopes (Scope (Desig_Type))
12973 and then Has_Discriminants (Desig_Type)
12976 Pack : constant Node_Id :=
12977 Unit_Declaration_Node (Scope (Desig_Type));
12982 if Nkind (Pack) = N_Package_Declaration then
12983 Decls := Visible_Declarations (Specification (Pack));
12984 Decl := First (Decls);
12985 while Present (Decl) loop
12986 if (Nkind (Decl) = N_Private_Type_Declaration
12987 and then Chars (Defining_Identifier (Decl)) =
12988 Chars (Desig_Type))
12991 (Nkind (Decl) = N_Full_Type_Declaration
12993 Chars (Defining_Identifier (Decl)) =
12995 and then Is_Derived_Type (Desig_Type)
12997 Has_Private_Declaration (Etype (Desig_Type)))
12999 if No (Discriminant_Specifications (Decl)) then
13001 ("cannot constrain access type if designated "
13002 & "type has constrained partial view", S);
13014 Constrain_Discriminated_Type (Desig_Subtype, S, Related_Nod,
13015 For_Access => True);
13017 elsif Is_Concurrent_Type (Desig_Type)
13018 and then not Is_Constrained (Desig_Type)
13020 Constrain_Concurrent (Desig_Subtype, S, Related_Nod, Desig_Type, ' ');
13023 Error_Msg_N ("invalid constraint on access type", S);
13025 -- We simply ignore an invalid constraint
13027 Desig_Subtype := Desig_Type;
13028 Constraint_OK := False;
13031 if No (Def_Id) then
13032 Def_Id := Create_Itype (E_Access_Subtype, Related_Nod);
13034 Set_Ekind (Def_Id, E_Access_Subtype);
13037 if Constraint_OK then
13038 Set_Etype (Def_Id, Base_Type (T));
13040 if Is_Private_Type (Desig_Type) then
13041 Prepare_Private_Subtype_Completion (Desig_Subtype, Related_Nod);
13044 Set_Etype (Def_Id, Any_Type);
13047 Set_Size_Info (Def_Id, T);
13048 Set_Is_Constrained (Def_Id, Constraint_OK);
13049 Set_Directly_Designated_Type (Def_Id, Desig_Subtype);
13050 Set_Depends_On_Private (Def_Id, Has_Private_Component (Def_Id));
13051 Set_Is_Access_Constant (Def_Id, Is_Access_Constant (T));
13053 Conditional_Delay (Def_Id, T);
13055 -- AI-363 : Subtypes of general access types whose designated types have
13056 -- default discriminants are disallowed. In instances, the rule has to
13057 -- be checked against the actual, of which T is the subtype. In a
13058 -- generic body, the rule is checked assuming that the actual type has
13059 -- defaulted discriminants.
13061 if Ada_Version >= Ada_2005 or else Warn_On_Ada_2005_Compatibility then
13062 if Ekind (Base_Type (T)) = E_General_Access_Type
13063 and then Has_Defaulted_Discriminants (Desig_Type)
13065 if Ada_Version < Ada_2005 then
13067 ("access subtype of general access type would not " &
13068 "be allowed in Ada 2005?y?", S);
13071 ("access subtype of general access type not allowed", S);
13074 Error_Msg_N ("\discriminants have defaults", S);
13076 elsif Is_Access_Type (T)
13077 and then Is_Generic_Type (Desig_Type)
13078 and then Has_Discriminants (Desig_Type)
13079 and then In_Package_Body (Current_Scope)
13081 if Ada_Version < Ada_2005 then
13083 ("access subtype would not be allowed in generic body "
13084 & "in Ada 2005?y?", S);
13087 ("access subtype not allowed in generic body", S);
13091 ("\designated type is a discriminated formal", S);
13094 end Constrain_Access;
13096 ---------------------
13097 -- Constrain_Array --
13098 ---------------------
13100 procedure Constrain_Array
13101 (Def_Id : in out Entity_Id;
13103 Related_Nod : Node_Id;
13104 Related_Id : Entity_Id;
13105 Suffix : Character)
13107 C : constant Node_Id := Constraint (SI);
13108 Number_Of_Constraints : Nat := 0;
13111 Constraint_OK : Boolean := True;
13114 T := Entity (Subtype_Mark (SI));
13116 if Is_Access_Type (T) then
13117 T := Designated_Type (T);
13120 -- If an index constraint follows a subtype mark in a subtype indication
13121 -- then the type or subtype denoted by the subtype mark must not already
13122 -- impose an index constraint. The subtype mark must denote either an
13123 -- unconstrained array type or an access type whose designated type
13124 -- is such an array type... (RM 3.6.1)
13126 if Is_Constrained (T) then
13127 Error_Msg_N ("array type is already constrained", Subtype_Mark (SI));
13128 Constraint_OK := False;
13131 S := First (Constraints (C));
13132 while Present (S) loop
13133 Number_Of_Constraints := Number_Of_Constraints + 1;
13137 -- In either case, the index constraint must provide a discrete
13138 -- range for each index of the array type and the type of each
13139 -- discrete range must be the same as that of the corresponding
13140 -- index. (RM 3.6.1)
13142 if Number_Of_Constraints /= Number_Dimensions (T) then
13143 Error_Msg_NE ("incorrect number of index constraints for }", C, T);
13144 Constraint_OK := False;
13147 S := First (Constraints (C));
13148 Index := First_Index (T);
13151 -- Apply constraints to each index type
13153 for J in 1 .. Number_Of_Constraints loop
13154 Constrain_Index (Index, S, Related_Nod, Related_Id, Suffix, J);
13162 if No (Def_Id) then
13164 Create_Itype (E_Array_Subtype, Related_Nod, Related_Id, Suffix);
13165 Set_Parent (Def_Id, Related_Nod);
13168 Set_Ekind (Def_Id, E_Array_Subtype);
13171 Set_Size_Info (Def_Id, (T));
13172 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
13173 Set_Etype (Def_Id, Base_Type (T));
13175 if Constraint_OK then
13176 Set_First_Index (Def_Id, First (Constraints (C)));
13178 Set_First_Index (Def_Id, First_Index (T));
13181 Set_Is_Constrained (Def_Id, True);
13182 Set_Is_Aliased (Def_Id, Is_Aliased (T));
13183 Set_Depends_On_Private (Def_Id, Has_Private_Component (Def_Id));
13185 Set_Is_Private_Composite (Def_Id, Is_Private_Composite (T));
13186 Set_Is_Limited_Composite (Def_Id, Is_Limited_Composite (T));
13188 -- A subtype does not inherit the Packed_Array_Impl_Type of is parent.
13189 -- We need to initialize the attribute because if Def_Id is previously
13190 -- analyzed through a limited_with clause, it will have the attributes
13191 -- of an incomplete type, one of which is an Elist that overlaps the
13192 -- Packed_Array_Impl_Type field.
13194 Set_Packed_Array_Impl_Type (Def_Id, Empty);
13196 -- Build a freeze node if parent still needs one. Also make sure that
13197 -- the Depends_On_Private status is set because the subtype will need
13198 -- reprocessing at the time the base type does, and also we must set a
13199 -- conditional delay.
13201 Set_Depends_On_Private (Def_Id, Depends_On_Private (T));
13202 Conditional_Delay (Def_Id, T);
13203 end Constrain_Array;
13205 ------------------------------
13206 -- Constrain_Component_Type --
13207 ------------------------------
13209 function Constrain_Component_Type
13211 Constrained_Typ : Entity_Id;
13212 Related_Node : Node_Id;
13214 Constraints : Elist_Id) return Entity_Id
13216 Loc : constant Source_Ptr := Sloc (Constrained_Typ);
13217 Compon_Type : constant Entity_Id := Etype (Comp);
13219 function Build_Constrained_Array_Type
13220 (Old_Type : Entity_Id) return Entity_Id;
13221 -- If Old_Type is an array type, one of whose indexes is constrained
13222 -- by a discriminant, build an Itype whose constraint replaces the
13223 -- discriminant with its value in the constraint.
13225 function Build_Constrained_Discriminated_Type
13226 (Old_Type : Entity_Id) return Entity_Id;
13227 -- Ditto for record components
13229 function Build_Constrained_Access_Type
13230 (Old_Type : Entity_Id) return Entity_Id;
13231 -- Ditto for access types. Makes use of previous two functions, to
13232 -- constrain designated type.
13234 function Build_Subtype (T : Entity_Id; C : List_Id) return Entity_Id;
13235 -- T is an array or discriminated type, C is a list of constraints
13236 -- that apply to T. This routine builds the constrained subtype.
13238 function Is_Discriminant (Expr : Node_Id) return Boolean;
13239 -- Returns True if Expr is a discriminant
13241 function Get_Discr_Value (Discrim : Entity_Id) return Node_Id;
13242 -- Find the value of discriminant Discrim in Constraint
13244 -----------------------------------
13245 -- Build_Constrained_Access_Type --
13246 -----------------------------------
13248 function Build_Constrained_Access_Type
13249 (Old_Type : Entity_Id) return Entity_Id
13251 Desig_Type : constant Entity_Id := Designated_Type (Old_Type);
13253 Desig_Subtype : Entity_Id;
13257 -- if the original access type was not embedded in the enclosing
13258 -- type definition, there is no need to produce a new access
13259 -- subtype. In fact every access type with an explicit constraint
13260 -- generates an itype whose scope is the enclosing record.
13262 if not Is_Type (Scope (Old_Type)) then
13265 elsif Is_Array_Type (Desig_Type) then
13266 Desig_Subtype := Build_Constrained_Array_Type (Desig_Type);
13268 elsif Has_Discriminants (Desig_Type) then
13270 -- This may be an access type to an enclosing record type for
13271 -- which we are constructing the constrained components. Return
13272 -- the enclosing record subtype. This is not always correct,
13273 -- but avoids infinite recursion. ???
13275 Desig_Subtype := Any_Type;
13277 for J in reverse 0 .. Scope_Stack.Last loop
13278 Scop := Scope_Stack.Table (J).Entity;
13281 and then Base_Type (Scop) = Base_Type (Desig_Type)
13283 Desig_Subtype := Scop;
13286 exit when not Is_Type (Scop);
13289 if Desig_Subtype = Any_Type then
13291 Build_Constrained_Discriminated_Type (Desig_Type);
13298 if Desig_Subtype /= Desig_Type then
13300 -- The Related_Node better be here or else we won't be able
13301 -- to attach new itypes to a node in the tree.
13303 pragma Assert (Present (Related_Node));
13305 Itype := Create_Itype (E_Access_Subtype, Related_Node);
13307 Set_Etype (Itype, Base_Type (Old_Type));
13308 Set_Size_Info (Itype, (Old_Type));
13309 Set_Directly_Designated_Type (Itype, Desig_Subtype);
13310 Set_Depends_On_Private (Itype, Has_Private_Component
13312 Set_Is_Access_Constant (Itype, Is_Access_Constant
13315 -- The new itype needs freezing when it depends on a not frozen
13316 -- type and the enclosing subtype needs freezing.
13318 if Has_Delayed_Freeze (Constrained_Typ)
13319 and then not Is_Frozen (Constrained_Typ)
13321 Conditional_Delay (Itype, Base_Type (Old_Type));
13329 end Build_Constrained_Access_Type;
13331 ----------------------------------
13332 -- Build_Constrained_Array_Type --
13333 ----------------------------------
13335 function Build_Constrained_Array_Type
13336 (Old_Type : Entity_Id) return Entity_Id
13340 Old_Index : Node_Id;
13341 Range_Node : Node_Id;
13342 Constr_List : List_Id;
13344 Need_To_Create_Itype : Boolean := False;
13347 Old_Index := First_Index (Old_Type);
13348 while Present (Old_Index) loop
13349 Get_Index_Bounds (Old_Index, Lo_Expr, Hi_Expr);
13351 if Is_Discriminant (Lo_Expr)
13353 Is_Discriminant (Hi_Expr)
13355 Need_To_Create_Itype := True;
13358 Next_Index (Old_Index);
13361 if Need_To_Create_Itype then
13362 Constr_List := New_List;
13364 Old_Index := First_Index (Old_Type);
13365 while Present (Old_Index) loop
13366 Get_Index_Bounds (Old_Index, Lo_Expr, Hi_Expr);
13368 if Is_Discriminant (Lo_Expr) then
13369 Lo_Expr := Get_Discr_Value (Lo_Expr);
13372 if Is_Discriminant (Hi_Expr) then
13373 Hi_Expr := Get_Discr_Value (Hi_Expr);
13378 (Loc, New_Copy_Tree (Lo_Expr), New_Copy_Tree (Hi_Expr));
13380 Append (Range_Node, To => Constr_List);
13382 Next_Index (Old_Index);
13385 return Build_Subtype (Old_Type, Constr_List);
13390 end Build_Constrained_Array_Type;
13392 ------------------------------------------
13393 -- Build_Constrained_Discriminated_Type --
13394 ------------------------------------------
13396 function Build_Constrained_Discriminated_Type
13397 (Old_Type : Entity_Id) return Entity_Id
13400 Constr_List : List_Id;
13401 Old_Constraint : Elmt_Id;
13403 Need_To_Create_Itype : Boolean := False;
13406 Old_Constraint := First_Elmt (Discriminant_Constraint (Old_Type));
13407 while Present (Old_Constraint) loop
13408 Expr := Node (Old_Constraint);
13410 if Is_Discriminant (Expr) then
13411 Need_To_Create_Itype := True;
13414 Next_Elmt (Old_Constraint);
13417 if Need_To_Create_Itype then
13418 Constr_List := New_List;
13420 Old_Constraint := First_Elmt (Discriminant_Constraint (Old_Type));
13421 while Present (Old_Constraint) loop
13422 Expr := Node (Old_Constraint);
13424 if Is_Discriminant (Expr) then
13425 Expr := Get_Discr_Value (Expr);
13428 Append (New_Copy_Tree (Expr), To => Constr_List);
13430 Next_Elmt (Old_Constraint);
13433 return Build_Subtype (Old_Type, Constr_List);
13438 end Build_Constrained_Discriminated_Type;
13440 -------------------
13441 -- Build_Subtype --
13442 -------------------
13444 function Build_Subtype (T : Entity_Id; C : List_Id) return Entity_Id is
13446 Subtyp_Decl : Node_Id;
13447 Def_Id : Entity_Id;
13448 Btyp : Entity_Id := Base_Type (T);
13451 -- The Related_Node better be here or else we won't be able to
13452 -- attach new itypes to a node in the tree.
13454 pragma Assert (Present (Related_Node));
13456 -- If the view of the component's type is incomplete or private
13457 -- with unknown discriminants, then the constraint must be applied
13458 -- to the full type.
13460 if Has_Unknown_Discriminants (Btyp)
13461 and then Present (Underlying_Type (Btyp))
13463 Btyp := Underlying_Type (Btyp);
13467 Make_Subtype_Indication (Loc,
13468 Subtype_Mark => New_Occurrence_Of (Btyp, Loc),
13469 Constraint => Make_Index_Or_Discriminant_Constraint (Loc, C));
13471 Def_Id := Create_Itype (Ekind (T), Related_Node);
13474 Make_Subtype_Declaration (Loc,
13475 Defining_Identifier => Def_Id,
13476 Subtype_Indication => Indic);
13478 Set_Parent (Subtyp_Decl, Parent (Related_Node));
13480 -- Itypes must be analyzed with checks off (see package Itypes)
13482 Analyze (Subtyp_Decl, Suppress => All_Checks);
13484 if Is_Itype (Def_Id) and then Has_Predicates (T) then
13485 Inherit_Predicate_Flags (Def_Id, T);
13487 -- Indicate where the predicate function may be found
13489 if Is_Itype (T) then
13490 if Present (Predicate_Function (Def_Id)) then
13493 elsif Present (Predicate_Function (T)) then
13494 Set_Predicate_Function (Def_Id, Predicate_Function (T));
13497 Set_Predicated_Parent (Def_Id, Predicated_Parent (T));
13500 elsif No (Predicate_Function (Def_Id)) then
13501 Set_Predicated_Parent (Def_Id, T);
13508 ---------------------
13509 -- Get_Discr_Value --
13510 ---------------------
13512 function Get_Discr_Value (Discrim : Entity_Id) return Node_Id is
13517 -- The discriminant may be declared for the type, in which case we
13518 -- find it by iterating over the list of discriminants. If the
13519 -- discriminant is inherited from a parent type, it appears as the
13520 -- corresponding discriminant of the current type. This will be the
13521 -- case when constraining an inherited component whose constraint is
13522 -- given by a discriminant of the parent.
13524 D := First_Discriminant (Typ);
13525 E := First_Elmt (Constraints);
13527 while Present (D) loop
13528 if D = Entity (Discrim)
13529 or else D = CR_Discriminant (Entity (Discrim))
13530 or else Corresponding_Discriminant (D) = Entity (Discrim)
13535 Next_Discriminant (D);
13539 -- The Corresponding_Discriminant mechanism is incomplete, because
13540 -- the correspondence between new and old discriminants is not one
13541 -- to one: one new discriminant can constrain several old ones. In
13542 -- that case, scan sequentially the stored_constraint, the list of
13543 -- discriminants of the parents, and the constraints.
13545 -- Previous code checked for the present of the Stored_Constraint
13546 -- list for the derived type, but did not use it at all. Should it
13547 -- be present when the component is a discriminated task type?
13549 if Is_Derived_Type (Typ)
13550 and then Scope (Entity (Discrim)) = Etype (Typ)
13552 D := First_Discriminant (Etype (Typ));
13553 E := First_Elmt (Constraints);
13554 while Present (D) loop
13555 if D = Entity (Discrim) then
13559 Next_Discriminant (D);
13564 -- Something is wrong if we did not find the value
13566 raise Program_Error;
13567 end Get_Discr_Value;
13569 ---------------------
13570 -- Is_Discriminant --
13571 ---------------------
13573 function Is_Discriminant (Expr : Node_Id) return Boolean is
13574 Discrim_Scope : Entity_Id;
13577 if Denotes_Discriminant (Expr) then
13578 Discrim_Scope := Scope (Entity (Expr));
13580 -- Either we have a reference to one of Typ's discriminants,
13582 pragma Assert (Discrim_Scope = Typ
13584 -- or to the discriminants of the parent type, in the case
13585 -- of a derivation of a tagged type with variants.
13587 or else Discrim_Scope = Etype (Typ)
13588 or else Full_View (Discrim_Scope) = Etype (Typ)
13590 -- or same as above for the case where the discriminants
13591 -- were declared in Typ's private view.
13593 or else (Is_Private_Type (Discrim_Scope)
13594 and then Chars (Discrim_Scope) = Chars (Typ))
13596 -- or else we are deriving from the full view and the
13597 -- discriminant is declared in the private entity.
13599 or else (Is_Private_Type (Typ)
13600 and then Chars (Discrim_Scope) = Chars (Typ))
13602 -- Or we are constrained the corresponding record of a
13603 -- synchronized type that completes a private declaration.
13605 or else (Is_Concurrent_Record_Type (Typ)
13607 Corresponding_Concurrent_Type (Typ) = Discrim_Scope)
13609 -- or we have a class-wide type, in which case make sure the
13610 -- discriminant found belongs to the root type.
13612 or else (Is_Class_Wide_Type (Typ)
13613 and then Etype (Typ) = Discrim_Scope));
13618 -- In all other cases we have something wrong
13621 end Is_Discriminant;
13623 -- Start of processing for Constrain_Component_Type
13626 if Nkind (Parent (Comp)) = N_Component_Declaration
13627 and then Comes_From_Source (Parent (Comp))
13628 and then Comes_From_Source
13629 (Subtype_Indication (Component_Definition (Parent (Comp))))
13632 (Subtype_Indication (Component_Definition (Parent (Comp))))
13634 return Compon_Type;
13636 elsif Is_Array_Type (Compon_Type) then
13637 return Build_Constrained_Array_Type (Compon_Type);
13639 elsif Has_Discriminants (Compon_Type) then
13640 return Build_Constrained_Discriminated_Type (Compon_Type);
13642 elsif Is_Access_Type (Compon_Type) then
13643 return Build_Constrained_Access_Type (Compon_Type);
13646 return Compon_Type;
13648 end Constrain_Component_Type;
13650 --------------------------
13651 -- Constrain_Concurrent --
13652 --------------------------
13654 -- For concurrent types, the associated record value type carries the same
13655 -- discriminants, so when we constrain a concurrent type, we must constrain
13656 -- the corresponding record type as well.
13658 procedure Constrain_Concurrent
13659 (Def_Id : in out Entity_Id;
13661 Related_Nod : Node_Id;
13662 Related_Id : Entity_Id;
13663 Suffix : Character)
13665 -- Retrieve Base_Type to ensure getting to the concurrent type in the
13666 -- case of a private subtype (needed when only doing semantic analysis).
13668 T_Ent : Entity_Id := Base_Type (Entity (Subtype_Mark (SI)));
13672 if Is_Access_Type (T_Ent) then
13673 T_Ent := Designated_Type (T_Ent);
13676 T_Val := Corresponding_Record_Type (T_Ent);
13678 if Present (T_Val) then
13680 if No (Def_Id) then
13681 Def_Id := Create_Itype (E_Void, Related_Nod, Related_Id, Suffix);
13683 -- Elaborate itype now, as it may be used in a subsequent
13684 -- synchronized operation in another scope.
13686 if Nkind (Related_Nod) = N_Full_Type_Declaration then
13687 Build_Itype_Reference (Def_Id, Related_Nod);
13691 Constrain_Discriminated_Type (Def_Id, SI, Related_Nod);
13692 Set_First_Private_Entity (Def_Id, First_Private_Entity (T_Ent));
13694 Set_Depends_On_Private (Def_Id, Has_Private_Component (Def_Id));
13695 Set_Corresponding_Record_Type (Def_Id,
13696 Constrain_Corresponding_Record (Def_Id, T_Val, Related_Nod));
13699 -- If there is no associated record, expansion is disabled and this
13700 -- is a generic context. Create a subtype in any case, so that
13701 -- semantic analysis can proceed.
13703 if No (Def_Id) then
13704 Def_Id := Create_Itype (E_Void, Related_Nod, Related_Id, Suffix);
13707 Constrain_Discriminated_Type (Def_Id, SI, Related_Nod);
13709 end Constrain_Concurrent;
13711 ------------------------------------
13712 -- Constrain_Corresponding_Record --
13713 ------------------------------------
13715 function Constrain_Corresponding_Record
13716 (Prot_Subt : Entity_Id;
13717 Corr_Rec : Entity_Id;
13718 Related_Nod : Node_Id) return Entity_Id
13720 T_Sub : constant Entity_Id :=
13722 (Ekind => E_Record_Subtype,
13723 Related_Nod => Related_Nod,
13724 Related_Id => Corr_Rec,
13726 Suffix_Index => -1);
13729 Set_Etype (T_Sub, Corr_Rec);
13730 Set_Has_Discriminants (T_Sub, Has_Discriminants (Prot_Subt));
13731 Set_Is_Constrained (T_Sub, True);
13732 Set_First_Entity (T_Sub, First_Entity (Corr_Rec));
13733 Set_Last_Entity (T_Sub, Last_Entity (Corr_Rec));
13735 if Has_Discriminants (Prot_Subt) then -- False only if errors.
13736 Set_Discriminant_Constraint
13737 (T_Sub, Discriminant_Constraint (Prot_Subt));
13738 Set_Stored_Constraint_From_Discriminant_Constraint (T_Sub);
13739 Create_Constrained_Components
13740 (T_Sub, Related_Nod, Corr_Rec, Discriminant_Constraint (T_Sub));
13743 Set_Depends_On_Private (T_Sub, Has_Private_Component (T_Sub));
13745 if Ekind (Scope (Prot_Subt)) /= E_Record_Type then
13746 Conditional_Delay (T_Sub, Corr_Rec);
13749 -- This is a component subtype: it will be frozen in the context of
13750 -- the enclosing record's init_proc, so that discriminant references
13751 -- are resolved to discriminals. (Note: we used to skip freezing
13752 -- altogether in that case, which caused errors downstream for
13753 -- components of a bit packed array type).
13755 Set_Has_Delayed_Freeze (T_Sub);
13759 end Constrain_Corresponding_Record;
13761 -----------------------
13762 -- Constrain_Decimal --
13763 -----------------------
13765 procedure Constrain_Decimal (Def_Id : Node_Id; S : Node_Id) is
13766 T : constant Entity_Id := Entity (Subtype_Mark (S));
13767 C : constant Node_Id := Constraint (S);
13768 Loc : constant Source_Ptr := Sloc (C);
13769 Range_Expr : Node_Id;
13770 Digits_Expr : Node_Id;
13775 Set_Ekind (Def_Id, E_Decimal_Fixed_Point_Subtype);
13777 if Nkind (C) = N_Range_Constraint then
13778 Range_Expr := Range_Expression (C);
13779 Digits_Val := Digits_Value (T);
13782 pragma Assert (Nkind (C) = N_Digits_Constraint);
13784 Check_SPARK_05_Restriction ("digits constraint is not allowed", S);
13786 Digits_Expr := Digits_Expression (C);
13787 Analyze_And_Resolve (Digits_Expr, Any_Integer);
13789 Check_Digits_Expression (Digits_Expr);
13790 Digits_Val := Expr_Value (Digits_Expr);
13792 if Digits_Val > Digits_Value (T) then
13794 ("digits expression is incompatible with subtype", C);
13795 Digits_Val := Digits_Value (T);
13798 if Present (Range_Constraint (C)) then
13799 Range_Expr := Range_Expression (Range_Constraint (C));
13801 Range_Expr := Empty;
13805 Set_Etype (Def_Id, Base_Type (T));
13806 Set_Size_Info (Def_Id, (T));
13807 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
13808 Set_Delta_Value (Def_Id, Delta_Value (T));
13809 Set_Scale_Value (Def_Id, Scale_Value (T));
13810 Set_Small_Value (Def_Id, Small_Value (T));
13811 Set_Machine_Radix_10 (Def_Id, Machine_Radix_10 (T));
13812 Set_Digits_Value (Def_Id, Digits_Val);
13814 -- Manufacture range from given digits value if no range present
13816 if No (Range_Expr) then
13817 Bound_Val := (Ureal_10 ** Digits_Val - Ureal_1) * Small_Value (T);
13821 Convert_To (T, Make_Real_Literal (Loc, (-Bound_Val))),
13823 Convert_To (T, Make_Real_Literal (Loc, Bound_Val)));
13826 Set_Scalar_Range_For_Subtype (Def_Id, Range_Expr, T);
13827 Set_Discrete_RM_Size (Def_Id);
13829 -- Unconditionally delay the freeze, since we cannot set size
13830 -- information in all cases correctly until the freeze point.
13832 Set_Has_Delayed_Freeze (Def_Id);
13833 end Constrain_Decimal;
13835 ----------------------------------
13836 -- Constrain_Discriminated_Type --
13837 ----------------------------------
13839 procedure Constrain_Discriminated_Type
13840 (Def_Id : Entity_Id;
13842 Related_Nod : Node_Id;
13843 For_Access : Boolean := False)
13845 E : Entity_Id := Entity (Subtype_Mark (S));
13848 procedure Fixup_Bad_Constraint;
13849 -- Called after finding a bad constraint, and after having posted an
13850 -- appropriate error message. The goal is to leave type Def_Id in as
13851 -- reasonable state as possible.
13853 --------------------------
13854 -- Fixup_Bad_Constraint --
13855 --------------------------
13857 procedure Fixup_Bad_Constraint is
13859 -- Set a reasonable Ekind for the entity, including incomplete types.
13861 Set_Ekind (Def_Id, Subtype_Kind (Ekind (T)));
13863 -- Set Etype to the known type, to reduce chances of cascaded errors
13865 Set_Etype (Def_Id, E);
13866 Set_Error_Posted (Def_Id);
13867 end Fixup_Bad_Constraint;
13872 Constr : Elist_Id := New_Elmt_List;
13874 -- Start of processing for Constrain_Discriminated_Type
13877 C := Constraint (S);
13879 -- A discriminant constraint is only allowed in a subtype indication,
13880 -- after a subtype mark. This subtype mark must denote either a type
13881 -- with discriminants, or an access type whose designated type is a
13882 -- type with discriminants. A discriminant constraint specifies the
13883 -- values of these discriminants (RM 3.7.2(5)).
13885 T := Base_Type (Entity (Subtype_Mark (S)));
13887 if Is_Access_Type (T) then
13888 T := Designated_Type (T);
13891 -- In an instance it may be necessary to retrieve the full view of a
13892 -- type with unknown discriminants, or a full view with defaulted
13893 -- discriminants. In other contexts the constraint is illegal.
13896 and then Is_Private_Type (T)
13897 and then Present (Full_View (T))
13899 (Has_Unknown_Discriminants (T)
13901 (not Has_Discriminants (T)
13902 and then Has_Discriminants (Full_View (T))
13903 and then Present (Discriminant_Default_Value
13904 (First_Discriminant (Full_View (T))))))
13906 T := Full_View (T);
13907 E := Full_View (E);
13910 -- Ada 2005 (AI-412): Constrained incomplete subtypes are illegal. Avoid
13911 -- generating an error for access-to-incomplete subtypes.
13913 if Ada_Version >= Ada_2005
13914 and then Ekind (T) = E_Incomplete_Type
13915 and then Nkind (Parent (S)) = N_Subtype_Declaration
13916 and then not Is_Itype (Def_Id)
13918 -- A little sanity check: emit an error message if the type has
13919 -- discriminants to begin with. Type T may be a regular incomplete
13920 -- type or imported via a limited with clause.
13922 if Has_Discriminants (T)
13923 or else (From_Limited_With (T)
13924 and then Present (Non_Limited_View (T))
13925 and then Nkind (Parent (Non_Limited_View (T))) =
13926 N_Full_Type_Declaration
13927 and then Present (Discriminant_Specifications
13928 (Parent (Non_Limited_View (T)))))
13931 ("(Ada 2005) incomplete subtype may not be constrained", C);
13933 Error_Msg_N ("invalid constraint: type has no discriminant", C);
13936 Fixup_Bad_Constraint;
13939 -- Check that the type has visible discriminants. The type may be
13940 -- a private type with unknown discriminants whose full view has
13941 -- discriminants which are invisible.
13943 elsif not Has_Discriminants (T)
13945 (Has_Unknown_Discriminants (T)
13946 and then Is_Private_Type (T))
13948 Error_Msg_N ("invalid constraint: type has no discriminant", C);
13949 Fixup_Bad_Constraint;
13952 elsif Is_Constrained (E)
13953 or else (Ekind (E) = E_Class_Wide_Subtype
13954 and then Present (Discriminant_Constraint (E)))
13956 Error_Msg_N ("type is already constrained", Subtype_Mark (S));
13957 Fixup_Bad_Constraint;
13961 -- T may be an unconstrained subtype (e.g. a generic actual). Constraint
13962 -- applies to the base type.
13964 T := Base_Type (T);
13966 Constr := Build_Discriminant_Constraints (T, S);
13968 -- If the list returned was empty we had an error in building the
13969 -- discriminant constraint. We have also already signalled an error
13970 -- in the incomplete type case
13972 if Is_Empty_Elmt_List (Constr) then
13973 Fixup_Bad_Constraint;
13977 Build_Discriminated_Subtype (T, Def_Id, Constr, Related_Nod, For_Access);
13978 end Constrain_Discriminated_Type;
13980 ---------------------------
13981 -- Constrain_Enumeration --
13982 ---------------------------
13984 procedure Constrain_Enumeration (Def_Id : Node_Id; S : Node_Id) is
13985 T : constant Entity_Id := Entity (Subtype_Mark (S));
13986 C : constant Node_Id := Constraint (S);
13989 Set_Ekind (Def_Id, E_Enumeration_Subtype);
13991 Set_First_Literal (Def_Id, First_Literal (Base_Type (T)));
13993 Set_Etype (Def_Id, Base_Type (T));
13994 Set_Size_Info (Def_Id, (T));
13995 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
13996 Set_Is_Character_Type (Def_Id, Is_Character_Type (T));
13998 Set_Scalar_Range_For_Subtype (Def_Id, Range_Expression (C), T);
14000 Set_Discrete_RM_Size (Def_Id);
14001 end Constrain_Enumeration;
14003 ----------------------
14004 -- Constrain_Float --
14005 ----------------------
14007 procedure Constrain_Float (Def_Id : Node_Id; S : Node_Id) is
14008 T : constant Entity_Id := Entity (Subtype_Mark (S));
14014 Set_Ekind (Def_Id, E_Floating_Point_Subtype);
14016 Set_Etype (Def_Id, Base_Type (T));
14017 Set_Size_Info (Def_Id, (T));
14018 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
14020 -- Process the constraint
14022 C := Constraint (S);
14024 -- Digits constraint present
14026 if Nkind (C) = N_Digits_Constraint then
14028 Check_SPARK_05_Restriction ("digits constraint is not allowed", S);
14029 Check_Restriction (No_Obsolescent_Features, C);
14031 if Warn_On_Obsolescent_Feature then
14033 ("subtype digits constraint is an " &
14034 "obsolescent feature (RM J.3(8))?j?", C);
14037 D := Digits_Expression (C);
14038 Analyze_And_Resolve (D, Any_Integer);
14039 Check_Digits_Expression (D);
14040 Set_Digits_Value (Def_Id, Expr_Value (D));
14042 -- Check that digits value is in range. Obviously we can do this
14043 -- at compile time, but it is strictly a runtime check, and of
14044 -- course there is an ACVC test that checks this.
14046 if Digits_Value (Def_Id) > Digits_Value (T) then
14047 Error_Msg_Uint_1 := Digits_Value (T);
14048 Error_Msg_N ("??digits value is too large, maximum is ^", D);
14050 Make_Raise_Constraint_Error (Sloc (D),
14051 Reason => CE_Range_Check_Failed);
14052 Insert_Action (Declaration_Node (Def_Id), Rais);
14055 C := Range_Constraint (C);
14057 -- No digits constraint present
14060 Set_Digits_Value (Def_Id, Digits_Value (T));
14063 -- Range constraint present
14065 if Nkind (C) = N_Range_Constraint then
14066 Set_Scalar_Range_For_Subtype (Def_Id, Range_Expression (C), T);
14068 -- No range constraint present
14071 pragma Assert (No (C));
14072 Set_Scalar_Range (Def_Id, Scalar_Range (T));
14075 Set_Is_Constrained (Def_Id);
14076 end Constrain_Float;
14078 ---------------------
14079 -- Constrain_Index --
14080 ---------------------
14082 procedure Constrain_Index
14085 Related_Nod : Node_Id;
14086 Related_Id : Entity_Id;
14087 Suffix : Character;
14088 Suffix_Index : Nat)
14090 Def_Id : Entity_Id;
14091 R : Node_Id := Empty;
14092 T : constant Entity_Id := Etype (Index);
14096 Create_Itype (E_Void, Related_Nod, Related_Id, Suffix, Suffix_Index);
14097 Set_Etype (Def_Id, Base_Type (T));
14099 if Nkind (S) = N_Range
14101 (Nkind (S) = N_Attribute_Reference
14102 and then Attribute_Name (S) = Name_Range)
14104 -- A Range attribute will be transformed into N_Range by Resolve
14110 Process_Range_Expr_In_Decl (R, T);
14112 if not Error_Posted (S)
14114 (Nkind (S) /= N_Range
14115 or else not Covers (T, (Etype (Low_Bound (S))))
14116 or else not Covers (T, (Etype (High_Bound (S)))))
14118 if Base_Type (T) /= Any_Type
14119 and then Etype (Low_Bound (S)) /= Any_Type
14120 and then Etype (High_Bound (S)) /= Any_Type
14122 Error_Msg_N ("range expected", S);
14126 elsif Nkind (S) = N_Subtype_Indication then
14128 -- The parser has verified that this is a discrete indication
14130 Resolve_Discrete_Subtype_Indication (S, T);
14131 Bad_Predicated_Subtype_Use
14132 ("subtype& has predicate, not allowed in index constraint",
14133 S, Entity (Subtype_Mark (S)));
14135 R := Range_Expression (Constraint (S));
14137 -- Capture values of bounds and generate temporaries for them if
14138 -- needed, since checks may cause duplication of the expressions
14139 -- which must not be reevaluated.
14141 -- The forced evaluation removes side effects from expressions, which
14142 -- should occur also in GNATprove mode. Otherwise, we end up with
14143 -- unexpected insertions of actions at places where this is not
14144 -- supposed to occur, e.g. on default parameters of a call.
14146 if Expander_Active or GNATprove_Mode then
14148 (Low_Bound (R), Related_Id => Def_Id, Is_Low_Bound => True);
14150 (High_Bound (R), Related_Id => Def_Id, Is_High_Bound => True);
14153 elsif Nkind (S) = N_Discriminant_Association then
14155 -- Syntactically valid in subtype indication
14157 Error_Msg_N ("invalid index constraint", S);
14158 Rewrite (S, New_Occurrence_Of (T, Sloc (S)));
14161 -- Subtype_Mark case, no anonymous subtypes to construct
14166 if Is_Entity_Name (S) then
14167 if not Is_Type (Entity (S)) then
14168 Error_Msg_N ("expect subtype mark for index constraint", S);
14170 elsif Base_Type (Entity (S)) /= Base_Type (T) then
14171 Wrong_Type (S, Base_Type (T));
14173 -- Check error of subtype with predicate in index constraint
14176 Bad_Predicated_Subtype_Use
14177 ("subtype& has predicate, not allowed in index constraint",
14184 Error_Msg_N ("invalid index constraint", S);
14185 Rewrite (S, New_Occurrence_Of (T, Sloc (S)));
14190 -- Complete construction of the Itype
14192 if Is_Modular_Integer_Type (T) then
14193 Set_Ekind (Def_Id, E_Modular_Integer_Subtype);
14195 elsif Is_Integer_Type (T) then
14196 Set_Ekind (Def_Id, E_Signed_Integer_Subtype);
14199 Set_Ekind (Def_Id, E_Enumeration_Subtype);
14200 Set_Is_Character_Type (Def_Id, Is_Character_Type (T));
14201 Set_First_Literal (Def_Id, First_Literal (T));
14204 Set_Size_Info (Def_Id, (T));
14205 Set_RM_Size (Def_Id, RM_Size (T));
14206 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
14208 Set_Scalar_Range (Def_Id, R);
14210 Set_Etype (S, Def_Id);
14211 Set_Discrete_RM_Size (Def_Id);
14212 end Constrain_Index;
14214 -----------------------
14215 -- Constrain_Integer --
14216 -----------------------
14218 procedure Constrain_Integer (Def_Id : Node_Id; S : Node_Id) is
14219 T : constant Entity_Id := Entity (Subtype_Mark (S));
14220 C : constant Node_Id := Constraint (S);
14223 Set_Scalar_Range_For_Subtype (Def_Id, Range_Expression (C), T);
14225 if Is_Modular_Integer_Type (T) then
14226 Set_Ekind (Def_Id, E_Modular_Integer_Subtype);
14228 Set_Ekind (Def_Id, E_Signed_Integer_Subtype);
14231 Set_Etype (Def_Id, Base_Type (T));
14232 Set_Size_Info (Def_Id, (T));
14233 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
14234 Set_Discrete_RM_Size (Def_Id);
14235 end Constrain_Integer;
14237 ------------------------------
14238 -- Constrain_Ordinary_Fixed --
14239 ------------------------------
14241 procedure Constrain_Ordinary_Fixed (Def_Id : Node_Id; S : Node_Id) is
14242 T : constant Entity_Id := Entity (Subtype_Mark (S));
14248 Set_Ekind (Def_Id, E_Ordinary_Fixed_Point_Subtype);
14249 Set_Etype (Def_Id, Base_Type (T));
14250 Set_Size_Info (Def_Id, (T));
14251 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
14252 Set_Small_Value (Def_Id, Small_Value (T));
14254 -- Process the constraint
14256 C := Constraint (S);
14258 -- Delta constraint present
14260 if Nkind (C) = N_Delta_Constraint then
14262 Check_SPARK_05_Restriction ("delta constraint is not allowed", S);
14263 Check_Restriction (No_Obsolescent_Features, C);
14265 if Warn_On_Obsolescent_Feature then
14267 ("subtype delta constraint is an " &
14268 "obsolescent feature (RM J.3(7))?j?");
14271 D := Delta_Expression (C);
14272 Analyze_And_Resolve (D, Any_Real);
14273 Check_Delta_Expression (D);
14274 Set_Delta_Value (Def_Id, Expr_Value_R (D));
14276 -- Check that delta value is in range. Obviously we can do this
14277 -- at compile time, but it is strictly a runtime check, and of
14278 -- course there is an ACVC test that checks this.
14280 if Delta_Value (Def_Id) < Delta_Value (T) then
14281 Error_Msg_N ("??delta value is too small", D);
14283 Make_Raise_Constraint_Error (Sloc (D),
14284 Reason => CE_Range_Check_Failed);
14285 Insert_Action (Declaration_Node (Def_Id), Rais);
14288 C := Range_Constraint (C);
14290 -- No delta constraint present
14293 Set_Delta_Value (Def_Id, Delta_Value (T));
14296 -- Range constraint present
14298 if Nkind (C) = N_Range_Constraint then
14299 Set_Scalar_Range_For_Subtype (Def_Id, Range_Expression (C), T);
14301 -- No range constraint present
14304 pragma Assert (No (C));
14305 Set_Scalar_Range (Def_Id, Scalar_Range (T));
14308 Set_Discrete_RM_Size (Def_Id);
14310 -- Unconditionally delay the freeze, since we cannot set size
14311 -- information in all cases correctly until the freeze point.
14313 Set_Has_Delayed_Freeze (Def_Id);
14314 end Constrain_Ordinary_Fixed;
14316 -----------------------
14317 -- Contain_Interface --
14318 -----------------------
14320 function Contain_Interface
14321 (Iface : Entity_Id;
14322 Ifaces : Elist_Id) return Boolean
14324 Iface_Elmt : Elmt_Id;
14327 if Present (Ifaces) then
14328 Iface_Elmt := First_Elmt (Ifaces);
14329 while Present (Iface_Elmt) loop
14330 if Node (Iface_Elmt) = Iface then
14334 Next_Elmt (Iface_Elmt);
14339 end Contain_Interface;
14341 ---------------------------
14342 -- Convert_Scalar_Bounds --
14343 ---------------------------
14345 procedure Convert_Scalar_Bounds
14347 Parent_Type : Entity_Id;
14348 Derived_Type : Entity_Id;
14351 Implicit_Base : constant Entity_Id := Base_Type (Derived_Type);
14358 -- Defend against previous errors
14360 if No (Scalar_Range (Derived_Type)) then
14361 Check_Error_Detected;
14365 Lo := Build_Scalar_Bound
14366 (Type_Low_Bound (Derived_Type),
14367 Parent_Type, Implicit_Base);
14369 Hi := Build_Scalar_Bound
14370 (Type_High_Bound (Derived_Type),
14371 Parent_Type, Implicit_Base);
14378 Set_Includes_Infinities (Rng, Has_Infinities (Derived_Type));
14380 Set_Parent (Rng, N);
14381 Set_Scalar_Range (Derived_Type, Rng);
14383 -- Analyze the bounds
14385 Analyze_And_Resolve (Lo, Implicit_Base);
14386 Analyze_And_Resolve (Hi, Implicit_Base);
14388 -- Analyze the range itself, except that we do not analyze it if
14389 -- the bounds are real literals, and we have a fixed-point type.
14390 -- The reason for this is that we delay setting the bounds in this
14391 -- case till we know the final Small and Size values (see circuit
14392 -- in Freeze.Freeze_Fixed_Point_Type for further details).
14394 if Is_Fixed_Point_Type (Parent_Type)
14395 and then Nkind (Lo) = N_Real_Literal
14396 and then Nkind (Hi) = N_Real_Literal
14400 -- Here we do the analysis of the range
14402 -- Note: we do this manually, since if we do a normal Analyze and
14403 -- Resolve call, there are problems with the conversions used for
14404 -- the derived type range.
14407 Set_Etype (Rng, Implicit_Base);
14408 Set_Analyzed (Rng, True);
14410 end Convert_Scalar_Bounds;
14412 -------------------
14413 -- Copy_And_Swap --
14414 -------------------
14416 procedure Copy_And_Swap (Priv, Full : Entity_Id) is
14418 -- Initialize new full declaration entity by copying the pertinent
14419 -- fields of the corresponding private declaration entity.
14421 -- We temporarily set Ekind to a value appropriate for a type to
14422 -- avoid assert failures in Einfo from checking for setting type
14423 -- attributes on something that is not a type. Ekind (Priv) is an
14424 -- appropriate choice, since it allowed the attributes to be set
14425 -- in the first place. This Ekind value will be modified later.
14427 Set_Ekind (Full, Ekind (Priv));
14429 -- Also set Etype temporarily to Any_Type, again, in the absence
14430 -- of errors, it will be properly reset, and if there are errors,
14431 -- then we want a value of Any_Type to remain.
14433 Set_Etype (Full, Any_Type);
14435 -- Now start copying attributes
14437 Set_Has_Discriminants (Full, Has_Discriminants (Priv));
14439 if Has_Discriminants (Full) then
14440 Set_Discriminant_Constraint (Full, Discriminant_Constraint (Priv));
14441 Set_Stored_Constraint (Full, Stored_Constraint (Priv));
14444 Set_First_Rep_Item (Full, First_Rep_Item (Priv));
14445 Set_Homonym (Full, Homonym (Priv));
14446 Set_Is_Immediately_Visible (Full, Is_Immediately_Visible (Priv));
14447 Set_Is_Public (Full, Is_Public (Priv));
14448 Set_Is_Pure (Full, Is_Pure (Priv));
14449 Set_Is_Tagged_Type (Full, Is_Tagged_Type (Priv));
14450 Set_Has_Pragma_Unmodified (Full, Has_Pragma_Unmodified (Priv));
14451 Set_Has_Pragma_Unreferenced (Full, Has_Pragma_Unreferenced (Priv));
14452 Set_Has_Pragma_Unreferenced_Objects
14453 (Full, Has_Pragma_Unreferenced_Objects
14456 Conditional_Delay (Full, Priv);
14458 if Is_Tagged_Type (Full) then
14459 Set_Direct_Primitive_Operations
14460 (Full, Direct_Primitive_Operations (Priv));
14461 Set_No_Tagged_Streams_Pragma
14462 (Full, No_Tagged_Streams_Pragma (Priv));
14464 if Is_Base_Type (Priv) then
14465 Set_Class_Wide_Type (Full, Class_Wide_Type (Priv));
14469 Set_Is_Volatile (Full, Is_Volatile (Priv));
14470 Set_Treat_As_Volatile (Full, Treat_As_Volatile (Priv));
14471 Set_Scope (Full, Scope (Priv));
14472 Set_Prev_Entity (Full, Prev_Entity (Priv));
14473 Set_Next_Entity (Full, Next_Entity (Priv));
14474 Set_First_Entity (Full, First_Entity (Priv));
14475 Set_Last_Entity (Full, Last_Entity (Priv));
14477 -- If access types have been recorded for later handling, keep them in
14478 -- the full view so that they get handled when the full view freeze
14479 -- node is expanded.
14481 if Present (Freeze_Node (Priv))
14482 and then Present (Access_Types_To_Process (Freeze_Node (Priv)))
14484 Ensure_Freeze_Node (Full);
14485 Set_Access_Types_To_Process
14486 (Freeze_Node (Full),
14487 Access_Types_To_Process (Freeze_Node (Priv)));
14490 -- Swap the two entities. Now Private is the full type entity and Full
14491 -- is the private one. They will be swapped back at the end of the
14492 -- private part. This swapping ensures that the entity that is visible
14493 -- in the private part is the full declaration.
14495 Exchange_Entities (Priv, Full);
14496 Append_Entity (Full, Scope (Full));
14499 -------------------------------------
14500 -- Copy_Array_Base_Type_Attributes --
14501 -------------------------------------
14503 procedure Copy_Array_Base_Type_Attributes (T1, T2 : Entity_Id) is
14505 Set_Component_Alignment (T1, Component_Alignment (T2));
14506 Set_Component_Type (T1, Component_Type (T2));
14507 Set_Component_Size (T1, Component_Size (T2));
14508 Set_Has_Controlled_Component (T1, Has_Controlled_Component (T2));
14509 Set_Has_Non_Standard_Rep (T1, Has_Non_Standard_Rep (T2));
14510 Propagate_Concurrent_Flags (T1, T2);
14511 Set_Is_Packed (T1, Is_Packed (T2));
14512 Set_Has_Aliased_Components (T1, Has_Aliased_Components (T2));
14513 Set_Has_Atomic_Components (T1, Has_Atomic_Components (T2));
14514 Set_Has_Volatile_Components (T1, Has_Volatile_Components (T2));
14515 end Copy_Array_Base_Type_Attributes;
14517 -----------------------------------
14518 -- Copy_Array_Subtype_Attributes --
14519 -----------------------------------
14521 procedure Copy_Array_Subtype_Attributes (T1, T2 : Entity_Id) is
14523 Set_Size_Info (T1, T2);
14525 Set_First_Index (T1, First_Index (T2));
14526 Set_Is_Aliased (T1, Is_Aliased (T2));
14527 Set_Is_Volatile (T1, Is_Volatile (T2));
14528 Set_Treat_As_Volatile (T1, Treat_As_Volatile (T2));
14529 Set_Is_Constrained (T1, Is_Constrained (T2));
14530 Set_Depends_On_Private (T1, Has_Private_Component (T2));
14531 Inherit_Rep_Item_Chain (T1, T2);
14532 Set_Convention (T1, Convention (T2));
14533 Set_Is_Limited_Composite (T1, Is_Limited_Composite (T2));
14534 Set_Is_Private_Composite (T1, Is_Private_Composite (T2));
14535 Set_Packed_Array_Impl_Type (T1, Packed_Array_Impl_Type (T2));
14536 end Copy_Array_Subtype_Attributes;
14538 -----------------------------------
14539 -- Create_Constrained_Components --
14540 -----------------------------------
14542 procedure Create_Constrained_Components
14544 Decl_Node : Node_Id;
14546 Constraints : Elist_Id)
14548 Loc : constant Source_Ptr := Sloc (Subt);
14549 Comp_List : constant Elist_Id := New_Elmt_List;
14550 Parent_Type : constant Entity_Id := Etype (Typ);
14551 Assoc_List : constant List_Id := New_List;
14552 Discr_Val : Elmt_Id;
14556 Is_Static : Boolean := True;
14558 procedure Collect_Fixed_Components (Typ : Entity_Id);
14559 -- Collect parent type components that do not appear in a variant part
14561 procedure Create_All_Components;
14562 -- Iterate over Comp_List to create the components of the subtype
14564 function Create_Component (Old_Compon : Entity_Id) return Entity_Id;
14565 -- Creates a new component from Old_Compon, copying all the fields from
14566 -- it, including its Etype, inserts the new component in the Subt entity
14567 -- chain and returns the new component.
14569 function Is_Variant_Record (T : Entity_Id) return Boolean;
14570 -- If true, and discriminants are static, collect only components from
14571 -- variants selected by discriminant values.
14573 ------------------------------
14574 -- Collect_Fixed_Components --
14575 ------------------------------
14577 procedure Collect_Fixed_Components (Typ : Entity_Id) is
14579 -- Build association list for discriminants, and find components of the
14580 -- variant part selected by the values of the discriminants.
14582 Old_C := First_Discriminant (Typ);
14583 Discr_Val := First_Elmt (Constraints);
14584 while Present (Old_C) loop
14585 Append_To (Assoc_List,
14586 Make_Component_Association (Loc,
14587 Choices => New_List (New_Occurrence_Of (Old_C, Loc)),
14588 Expression => New_Copy (Node (Discr_Val))));
14590 Next_Elmt (Discr_Val);
14591 Next_Discriminant (Old_C);
14594 -- The tag and the possible parent component are unconditionally in
14597 if Is_Tagged_Type (Typ) or else Has_Controlled_Component (Typ) then
14598 Old_C := First_Component (Typ);
14599 while Present (Old_C) loop
14600 if Nam_In (Chars (Old_C), Name_uTag, Name_uParent) then
14601 Append_Elmt (Old_C, Comp_List);
14604 Next_Component (Old_C);
14607 end Collect_Fixed_Components;
14609 ---------------------------
14610 -- Create_All_Components --
14611 ---------------------------
14613 procedure Create_All_Components is
14617 Comp := First_Elmt (Comp_List);
14618 while Present (Comp) loop
14619 Old_C := Node (Comp);
14620 New_C := Create_Component (Old_C);
14624 Constrain_Component_Type
14625 (Old_C, Subt, Decl_Node, Typ, Constraints));
14626 Set_Is_Public (New_C, Is_Public (Subt));
14630 end Create_All_Components;
14632 ----------------------
14633 -- Create_Component --
14634 ----------------------
14636 function Create_Component (Old_Compon : Entity_Id) return Entity_Id is
14637 New_Compon : constant Entity_Id := New_Copy (Old_Compon);
14640 if Ekind (Old_Compon) = E_Discriminant
14641 and then Is_Completely_Hidden (Old_Compon)
14643 -- This is a shadow discriminant created for a discriminant of
14644 -- the parent type, which needs to be present in the subtype.
14645 -- Give the shadow discriminant an internal name that cannot
14646 -- conflict with that of visible components.
14648 Set_Chars (New_Compon, New_Internal_Name ('C'));
14651 -- Set the parent so we have a proper link for freezing etc. This is
14652 -- not a real parent pointer, since of course our parent does not own
14653 -- up to us and reference us, we are an illegitimate child of the
14654 -- original parent.
14656 Set_Parent (New_Compon, Parent (Old_Compon));
14658 -- We do not want this node marked as Comes_From_Source, since
14659 -- otherwise it would get first class status and a separate cross-
14660 -- reference line would be generated. Illegitimate children do not
14661 -- rate such recognition.
14663 Set_Comes_From_Source (New_Compon, False);
14665 -- But it is a real entity, and a birth certificate must be properly
14666 -- registered by entering it into the entity list, and setting its
14667 -- scope to the given subtype. This turns out to be useful for the
14668 -- LLVM code generator, but that scope is not used otherwise.
14670 Enter_Name (New_Compon);
14671 Set_Scope (New_Compon, Subt);
14674 end Create_Component;
14676 -----------------------
14677 -- Is_Variant_Record --
14678 -----------------------
14680 function Is_Variant_Record (T : Entity_Id) return Boolean is
14682 return Nkind (Parent (T)) = N_Full_Type_Declaration
14683 and then Nkind (Type_Definition (Parent (T))) = N_Record_Definition
14684 and then Present (Component_List (Type_Definition (Parent (T))))
14687 (Variant_Part (Component_List (Type_Definition (Parent (T)))));
14688 end Is_Variant_Record;
14690 -- Start of processing for Create_Constrained_Components
14693 pragma Assert (Subt /= Base_Type (Subt));
14694 pragma Assert (Typ = Base_Type (Typ));
14696 Set_First_Entity (Subt, Empty);
14697 Set_Last_Entity (Subt, Empty);
14699 -- Check whether constraint is fully static, in which case we can
14700 -- optimize the list of components.
14702 Discr_Val := First_Elmt (Constraints);
14703 while Present (Discr_Val) loop
14704 if not Is_OK_Static_Expression (Node (Discr_Val)) then
14705 Is_Static := False;
14709 Next_Elmt (Discr_Val);
14712 Set_Has_Static_Discriminants (Subt, Is_Static);
14716 -- Inherit the discriminants of the parent type
14718 Add_Discriminants : declare
14724 Old_C := First_Discriminant (Typ);
14726 while Present (Old_C) loop
14727 Num_Disc := Num_Disc + 1;
14728 New_C := Create_Component (Old_C);
14729 Set_Is_Public (New_C, Is_Public (Subt));
14730 Next_Discriminant (Old_C);
14733 -- For an untagged derived subtype, the number of discriminants may
14734 -- be smaller than the number of inherited discriminants, because
14735 -- several of them may be renamed by a single new discriminant or
14736 -- constrained. In this case, add the hidden discriminants back into
14737 -- the subtype, because they need to be present if the optimizer of
14738 -- the GCC 4.x back-end decides to break apart assignments between
14739 -- objects using the parent view into member-wise assignments.
14743 if Is_Derived_Type (Typ)
14744 and then not Is_Tagged_Type (Typ)
14746 Old_C := First_Stored_Discriminant (Typ);
14748 while Present (Old_C) loop
14749 Num_Gird := Num_Gird + 1;
14750 Next_Stored_Discriminant (Old_C);
14754 if Num_Gird > Num_Disc then
14756 -- Find out multiple uses of new discriminants, and add hidden
14757 -- components for the extra renamed discriminants. We recognize
14758 -- multiple uses through the Corresponding_Discriminant of a
14759 -- new discriminant: if it constrains several old discriminants,
14760 -- this field points to the last one in the parent type. The
14761 -- stored discriminants of the derived type have the same name
14762 -- as those of the parent.
14766 New_Discr : Entity_Id;
14767 Old_Discr : Entity_Id;
14770 Constr := First_Elmt (Stored_Constraint (Typ));
14771 Old_Discr := First_Stored_Discriminant (Typ);
14772 while Present (Constr) loop
14773 if Is_Entity_Name (Node (Constr))
14774 and then Ekind (Entity (Node (Constr))) = E_Discriminant
14776 New_Discr := Entity (Node (Constr));
14778 if Chars (Corresponding_Discriminant (New_Discr)) /=
14781 -- The new discriminant has been used to rename a
14782 -- subsequent old discriminant. Introduce a shadow
14783 -- component for the current old discriminant.
14785 New_C := Create_Component (Old_Discr);
14786 Set_Original_Record_Component (New_C, Old_Discr);
14790 -- The constraint has eliminated the old discriminant.
14791 -- Introduce a shadow component.
14793 New_C := Create_Component (Old_Discr);
14794 Set_Original_Record_Component (New_C, Old_Discr);
14797 Next_Elmt (Constr);
14798 Next_Stored_Discriminant (Old_Discr);
14802 end Add_Discriminants;
14805 and then Is_Variant_Record (Typ)
14807 Collect_Fixed_Components (Typ);
14809 Gather_Components (
14811 Component_List (Type_Definition (Parent (Typ))),
14812 Governed_By => Assoc_List,
14814 Report_Errors => Errors);
14815 pragma Assert (not Errors
14816 or else Serious_Errors_Detected > 0);
14818 Create_All_Components;
14820 -- If the subtype declaration is created for a tagged type derivation
14821 -- with constraints, we retrieve the record definition of the parent
14822 -- type to select the components of the proper variant.
14825 and then Is_Tagged_Type (Typ)
14826 and then Nkind (Parent (Typ)) = N_Full_Type_Declaration
14828 Nkind (Type_Definition (Parent (Typ))) = N_Derived_Type_Definition
14829 and then Is_Variant_Record (Parent_Type)
14831 Collect_Fixed_Components (Typ);
14835 Component_List (Type_Definition (Parent (Parent_Type))),
14836 Governed_By => Assoc_List,
14838 Report_Errors => Errors);
14840 -- Note: previously there was a check at this point that no errors
14841 -- were detected. As a consequence of AI05-220 there may be an error
14842 -- if an inherited discriminant that controls a variant has a non-
14843 -- static constraint.
14845 -- If the tagged derivation has a type extension, collect all the
14846 -- new components therein.
14848 if Present (Record_Extension_Part (Type_Definition (Parent (Typ))))
14850 Old_C := First_Component (Typ);
14851 while Present (Old_C) loop
14852 if Original_Record_Component (Old_C) = Old_C
14853 and then Chars (Old_C) /= Name_uTag
14854 and then Chars (Old_C) /= Name_uParent
14856 Append_Elmt (Old_C, Comp_List);
14859 Next_Component (Old_C);
14863 Create_All_Components;
14866 -- If discriminants are not static, or if this is a multi-level type
14867 -- extension, we have to include all components of the parent type.
14869 Old_C := First_Component (Typ);
14870 while Present (Old_C) loop
14871 New_C := Create_Component (Old_C);
14875 Constrain_Component_Type
14876 (Old_C, Subt, Decl_Node, Typ, Constraints));
14877 Set_Is_Public (New_C, Is_Public (Subt));
14879 Next_Component (Old_C);
14884 end Create_Constrained_Components;
14886 ------------------------------------------
14887 -- Decimal_Fixed_Point_Type_Declaration --
14888 ------------------------------------------
14890 procedure Decimal_Fixed_Point_Type_Declaration
14894 Loc : constant Source_Ptr := Sloc (Def);
14895 Digs_Expr : constant Node_Id := Digits_Expression (Def);
14896 Delta_Expr : constant Node_Id := Delta_Expression (Def);
14897 Implicit_Base : Entity_Id;
14904 Check_SPARK_05_Restriction
14905 ("decimal fixed point type is not allowed", Def);
14906 Check_Restriction (No_Fixed_Point, Def);
14908 -- Create implicit base type
14911 Create_Itype (E_Decimal_Fixed_Point_Type, Parent (Def), T, 'B');
14912 Set_Etype (Implicit_Base, Implicit_Base);
14914 -- Analyze and process delta expression
14916 Analyze_And_Resolve (Delta_Expr, Universal_Real);
14918 Check_Delta_Expression (Delta_Expr);
14919 Delta_Val := Expr_Value_R (Delta_Expr);
14921 -- Check delta is power of 10, and determine scale value from it
14927 Scale_Val := Uint_0;
14930 if Val < Ureal_1 then
14931 while Val < Ureal_1 loop
14932 Val := Val * Ureal_10;
14933 Scale_Val := Scale_Val + 1;
14936 if Scale_Val > 18 then
14937 Error_Msg_N ("scale exceeds maximum value of 18", Def);
14938 Scale_Val := UI_From_Int (+18);
14942 while Val > Ureal_1 loop
14943 Val := Val / Ureal_10;
14944 Scale_Val := Scale_Val - 1;
14947 if Scale_Val < -18 then
14948 Error_Msg_N ("scale is less than minimum value of -18", Def);
14949 Scale_Val := UI_From_Int (-18);
14953 if Val /= Ureal_1 then
14954 Error_Msg_N ("delta expression must be a power of 10", Def);
14955 Delta_Val := Ureal_10 ** (-Scale_Val);
14959 -- Set delta, scale and small (small = delta for decimal type)
14961 Set_Delta_Value (Implicit_Base, Delta_Val);
14962 Set_Scale_Value (Implicit_Base, Scale_Val);
14963 Set_Small_Value (Implicit_Base, Delta_Val);
14965 -- Analyze and process digits expression
14967 Analyze_And_Resolve (Digs_Expr, Any_Integer);
14968 Check_Digits_Expression (Digs_Expr);
14969 Digs_Val := Expr_Value (Digs_Expr);
14971 if Digs_Val > 18 then
14972 Digs_Val := UI_From_Int (+18);
14973 Error_Msg_N ("digits value out of range, maximum is 18", Digs_Expr);
14976 Set_Digits_Value (Implicit_Base, Digs_Val);
14977 Bound_Val := UR_From_Uint (10 ** Digs_Val - 1) * Delta_Val;
14979 -- Set range of base type from digits value for now. This will be
14980 -- expanded to represent the true underlying base range by Freeze.
14982 Set_Fixed_Range (Implicit_Base, Loc, -Bound_Val, Bound_Val);
14984 -- Note: We leave size as zero for now, size will be set at freeze
14985 -- time. We have to do this for ordinary fixed-point, because the size
14986 -- depends on the specified small, and we might as well do the same for
14987 -- decimal fixed-point.
14989 pragma Assert (Esize (Implicit_Base) = Uint_0);
14991 -- If there are bounds given in the declaration use them as the
14992 -- bounds of the first named subtype.
14994 if Present (Real_Range_Specification (Def)) then
14996 RRS : constant Node_Id := Real_Range_Specification (Def);
14997 Low : constant Node_Id := Low_Bound (RRS);
14998 High : constant Node_Id := High_Bound (RRS);
15003 Analyze_And_Resolve (Low, Any_Real);
15004 Analyze_And_Resolve (High, Any_Real);
15005 Check_Real_Bound (Low);
15006 Check_Real_Bound (High);
15007 Low_Val := Expr_Value_R (Low);
15008 High_Val := Expr_Value_R (High);
15010 if Low_Val < (-Bound_Val) then
15012 ("range low bound too small for digits value", Low);
15013 Low_Val := -Bound_Val;
15016 if High_Val > Bound_Val then
15018 ("range high bound too large for digits value", High);
15019 High_Val := Bound_Val;
15022 Set_Fixed_Range (T, Loc, Low_Val, High_Val);
15025 -- If no explicit range, use range that corresponds to given
15026 -- digits value. This will end up as the final range for the
15030 Set_Fixed_Range (T, Loc, -Bound_Val, Bound_Val);
15033 -- Complete entity for first subtype. The inheritance of the rep item
15034 -- chain ensures that SPARK-related pragmas are not clobbered when the
15035 -- decimal fixed point type acts as a full view of a private type.
15037 Set_Ekind (T, E_Decimal_Fixed_Point_Subtype);
15038 Set_Etype (T, Implicit_Base);
15039 Set_Size_Info (T, Implicit_Base);
15040 Inherit_Rep_Item_Chain (T, Implicit_Base);
15041 Set_Digits_Value (T, Digs_Val);
15042 Set_Delta_Value (T, Delta_Val);
15043 Set_Small_Value (T, Delta_Val);
15044 Set_Scale_Value (T, Scale_Val);
15045 Set_Is_Constrained (T);
15046 end Decimal_Fixed_Point_Type_Declaration;
15048 -----------------------------------
15049 -- Derive_Progenitor_Subprograms --
15050 -----------------------------------
15052 procedure Derive_Progenitor_Subprograms
15053 (Parent_Type : Entity_Id;
15054 Tagged_Type : Entity_Id)
15059 Iface_Alias : Entity_Id;
15060 Iface_Elmt : Elmt_Id;
15061 Iface_Subp : Entity_Id;
15062 New_Subp : Entity_Id := Empty;
15063 Prim_Elmt : Elmt_Id;
15068 pragma Assert (Ada_Version >= Ada_2005
15069 and then Is_Record_Type (Tagged_Type)
15070 and then Is_Tagged_Type (Tagged_Type)
15071 and then Has_Interfaces (Tagged_Type));
15073 -- Step 1: Transfer to the full-view primitives associated with the
15074 -- partial-view that cover interface primitives. Conceptually this
15075 -- work should be done later by Process_Full_View; done here to
15076 -- simplify its implementation at later stages. It can be safely
15077 -- done here because interfaces must be visible in the partial and
15078 -- private view (RM 7.3(7.3/2)).
15080 -- Small optimization: This work is only required if the parent may
15081 -- have entities whose Alias attribute reference an interface primitive.
15082 -- Such a situation may occur if the parent is an abstract type and the
15083 -- primitive has not been yet overridden or if the parent is a generic
15084 -- formal type covering interfaces.
15086 -- If the tagged type is not abstract, it cannot have abstract
15087 -- primitives (the only entities in the list of primitives of
15088 -- non-abstract tagged types that can reference abstract primitives
15089 -- through its Alias attribute are the internal entities that have
15090 -- attribute Interface_Alias, and these entities are generated later
15091 -- by Add_Internal_Interface_Entities).
15093 if In_Private_Part (Current_Scope)
15094 and then (Is_Abstract_Type (Parent_Type)
15096 Is_Generic_Type (Parent_Type))
15098 Elmt := First_Elmt (Primitive_Operations (Tagged_Type));
15099 while Present (Elmt) loop
15100 Subp := Node (Elmt);
15102 -- At this stage it is not possible to have entities in the list
15103 -- of primitives that have attribute Interface_Alias.
15105 pragma Assert (No (Interface_Alias (Subp)));
15107 Typ := Find_Dispatching_Type (Ultimate_Alias (Subp));
15109 if Is_Interface (Typ) then
15110 E := Find_Primitive_Covering_Interface
15111 (Tagged_Type => Tagged_Type,
15112 Iface_Prim => Subp);
15115 and then Find_Dispatching_Type (Ultimate_Alias (E)) /= Typ
15117 Replace_Elmt (Elmt, E);
15118 Remove_Homonym (Subp);
15126 -- Step 2: Add primitives of progenitors that are not implemented by
15127 -- parents of Tagged_Type.
15129 if Present (Interfaces (Base_Type (Tagged_Type))) then
15130 Iface_Elmt := First_Elmt (Interfaces (Base_Type (Tagged_Type)));
15131 while Present (Iface_Elmt) loop
15132 Iface := Node (Iface_Elmt);
15134 Prim_Elmt := First_Elmt (Primitive_Operations (Iface));
15135 while Present (Prim_Elmt) loop
15136 Iface_Subp := Node (Prim_Elmt);
15137 Iface_Alias := Ultimate_Alias (Iface_Subp);
15139 -- Exclude derivation of predefined primitives except those
15140 -- that come from source, or are inherited from one that comes
15141 -- from source. Required to catch declarations of equality
15142 -- operators of interfaces. For example:
15144 -- type Iface is interface;
15145 -- function "=" (Left, Right : Iface) return Boolean;
15147 if not Is_Predefined_Dispatching_Operation (Iface_Subp)
15148 or else Comes_From_Source (Iface_Alias)
15151 Find_Primitive_Covering_Interface
15152 (Tagged_Type => Tagged_Type,
15153 Iface_Prim => Iface_Subp);
15155 -- If not found we derive a new primitive leaving its alias
15156 -- attribute referencing the interface primitive.
15160 (New_Subp, Iface_Subp, Tagged_Type, Iface);
15162 -- Ada 2012 (AI05-0197): If the covering primitive's name
15163 -- differs from the name of the interface primitive then it
15164 -- is a private primitive inherited from a parent type. In
15165 -- such case, given that Tagged_Type covers the interface,
15166 -- the inherited private primitive becomes visible. For such
15167 -- purpose we add a new entity that renames the inherited
15168 -- private primitive.
15170 elsif Chars (E) /= Chars (Iface_Subp) then
15171 pragma Assert (Has_Suffix (E, 'P'));
15173 (New_Subp, Iface_Subp, Tagged_Type, Iface);
15174 Set_Alias (New_Subp, E);
15175 Set_Is_Abstract_Subprogram (New_Subp,
15176 Is_Abstract_Subprogram (E));
15178 -- Propagate to the full view interface entities associated
15179 -- with the partial view.
15181 elsif In_Private_Part (Current_Scope)
15182 and then Present (Alias (E))
15183 and then Alias (E) = Iface_Subp
15185 List_Containing (Parent (E)) /=
15186 Private_Declarations
15188 (Unit_Declaration_Node (Current_Scope)))
15190 Append_Elmt (E, Primitive_Operations (Tagged_Type));
15194 Next_Elmt (Prim_Elmt);
15197 Next_Elmt (Iface_Elmt);
15200 end Derive_Progenitor_Subprograms;
15202 -----------------------
15203 -- Derive_Subprogram --
15204 -----------------------
15206 procedure Derive_Subprogram
15207 (New_Subp : out Entity_Id;
15208 Parent_Subp : Entity_Id;
15209 Derived_Type : Entity_Id;
15210 Parent_Type : Entity_Id;
15211 Actual_Subp : Entity_Id := Empty)
15213 Formal : Entity_Id;
15214 -- Formal parameter of parent primitive operation
15216 Formal_Of_Actual : Entity_Id;
15217 -- Formal parameter of actual operation, when the derivation is to
15218 -- create a renaming for a primitive operation of an actual in an
15221 New_Formal : Entity_Id;
15222 -- Formal of inherited operation
15224 Visible_Subp : Entity_Id := Parent_Subp;
15226 function Is_Private_Overriding return Boolean;
15227 -- If Subp is a private overriding of a visible operation, the inherited
15228 -- operation derives from the overridden op (even though its body is the
15229 -- overriding one) and the inherited operation is visible now. See
15230 -- sem_disp to see the full details of the handling of the overridden
15231 -- subprogram, which is removed from the list of primitive operations of
15232 -- the type. The overridden subprogram is saved locally in Visible_Subp,
15233 -- and used to diagnose abstract operations that need overriding in the
15236 procedure Replace_Type (Id, New_Id : Entity_Id);
15237 -- When the type is an anonymous access type, create a new access type
15238 -- designating the derived type.
15240 procedure Set_Derived_Name;
15241 -- This procedure sets the appropriate Chars name for New_Subp. This
15242 -- is normally just a copy of the parent name. An exception arises for
15243 -- type support subprograms, where the name is changed to reflect the
15244 -- name of the derived type, e.g. if type foo is derived from type bar,
15245 -- then a procedure barDA is derived with a name fooDA.
15247 ---------------------------
15248 -- Is_Private_Overriding --
15249 ---------------------------
15251 function Is_Private_Overriding return Boolean is
15255 -- If the parent is not a dispatching operation there is no
15256 -- need to investigate overridings
15258 if not Is_Dispatching_Operation (Parent_Subp) then
15262 -- The visible operation that is overridden is a homonym of the
15263 -- parent subprogram. We scan the homonym chain to find the one
15264 -- whose alias is the subprogram we are deriving.
15266 Prev := Current_Entity (Parent_Subp);
15267 while Present (Prev) loop
15268 if Ekind (Prev) = Ekind (Parent_Subp)
15269 and then Alias (Prev) = Parent_Subp
15270 and then Scope (Parent_Subp) = Scope (Prev)
15271 and then not Is_Hidden (Prev)
15273 Visible_Subp := Prev;
15277 Prev := Homonym (Prev);
15281 end Is_Private_Overriding;
15287 procedure Replace_Type (Id, New_Id : Entity_Id) is
15288 Id_Type : constant Entity_Id := Etype (Id);
15289 Acc_Type : Entity_Id;
15290 Par : constant Node_Id := Parent (Derived_Type);
15293 -- When the type is an anonymous access type, create a new access
15294 -- type designating the derived type. This itype must be elaborated
15295 -- at the point of the derivation, not on subsequent calls that may
15296 -- be out of the proper scope for Gigi, so we insert a reference to
15297 -- it after the derivation.
15299 if Ekind (Id_Type) = E_Anonymous_Access_Type then
15301 Desig_Typ : Entity_Id := Designated_Type (Id_Type);
15304 if Ekind (Desig_Typ) = E_Record_Type_With_Private
15305 and then Present (Full_View (Desig_Typ))
15306 and then not Is_Private_Type (Parent_Type)
15308 Desig_Typ := Full_View (Desig_Typ);
15311 if Base_Type (Desig_Typ) = Base_Type (Parent_Type)
15313 -- Ada 2005 (AI-251): Handle also derivations of abstract
15314 -- interface primitives.
15316 or else (Is_Interface (Desig_Typ)
15317 and then not Is_Class_Wide_Type (Desig_Typ))
15319 Acc_Type := New_Copy (Id_Type);
15320 Set_Etype (Acc_Type, Acc_Type);
15321 Set_Scope (Acc_Type, New_Subp);
15323 -- Set size of anonymous access type. If we have an access
15324 -- to an unconstrained array, this is a fat pointer, so it
15325 -- is sizes at twice addtress size.
15327 if Is_Array_Type (Desig_Typ)
15328 and then not Is_Constrained (Desig_Typ)
15330 Init_Size (Acc_Type, 2 * System_Address_Size);
15332 -- Other cases use a thin pointer
15335 Init_Size (Acc_Type, System_Address_Size);
15338 -- Set remaining characterstics of anonymous access type
15340 Init_Alignment (Acc_Type);
15341 Set_Directly_Designated_Type (Acc_Type, Derived_Type);
15343 Set_Etype (New_Id, Acc_Type);
15344 Set_Scope (New_Id, New_Subp);
15346 -- Create a reference to it
15348 Build_Itype_Reference (Acc_Type, Parent (Derived_Type));
15351 Set_Etype (New_Id, Id_Type);
15355 -- In Ada2012, a formal may have an incomplete type but the type
15356 -- derivation that inherits the primitive follows the full view.
15358 elsif Base_Type (Id_Type) = Base_Type (Parent_Type)
15360 (Ekind (Id_Type) = E_Record_Type_With_Private
15361 and then Present (Full_View (Id_Type))
15363 Base_Type (Full_View (Id_Type)) = Base_Type (Parent_Type))
15365 (Ada_Version >= Ada_2012
15366 and then Ekind (Id_Type) = E_Incomplete_Type
15367 and then Full_View (Id_Type) = Parent_Type)
15369 -- Constraint checks on formals are generated during expansion,
15370 -- based on the signature of the original subprogram. The bounds
15371 -- of the derived type are not relevant, and thus we can use
15372 -- the base type for the formals. However, the return type may be
15373 -- used in a context that requires that the proper static bounds
15374 -- be used (a case statement, for example) and for those cases
15375 -- we must use the derived type (first subtype), not its base.
15377 -- If the derived_type_definition has no constraints, we know that
15378 -- the derived type has the same constraints as the first subtype
15379 -- of the parent, and we can also use it rather than its base,
15380 -- which can lead to more efficient code.
15382 if Etype (Id) = Parent_Type then
15383 if Is_Scalar_Type (Parent_Type)
15385 Subtypes_Statically_Compatible (Parent_Type, Derived_Type)
15387 Set_Etype (New_Id, Derived_Type);
15389 elsif Nkind (Par) = N_Full_Type_Declaration
15391 Nkind (Type_Definition (Par)) = N_Derived_Type_Definition
15394 (Subtype_Indication (Type_Definition (Par)))
15396 Set_Etype (New_Id, Derived_Type);
15399 Set_Etype (New_Id, Base_Type (Derived_Type));
15403 Set_Etype (New_Id, Base_Type (Derived_Type));
15407 Set_Etype (New_Id, Etype (Id));
15411 ----------------------
15412 -- Set_Derived_Name --
15413 ----------------------
15415 procedure Set_Derived_Name is
15416 Nm : constant TSS_Name_Type := Get_TSS_Name (Parent_Subp);
15418 if Nm = TSS_Null then
15419 Set_Chars (New_Subp, Chars (Parent_Subp));
15421 Set_Chars (New_Subp, Make_TSS_Name (Base_Type (Derived_Type), Nm));
15423 end Set_Derived_Name;
15425 -- Start of processing for Derive_Subprogram
15428 New_Subp := New_Entity (Nkind (Parent_Subp), Sloc (Derived_Type));
15429 Set_Ekind (New_Subp, Ekind (Parent_Subp));
15431 -- Check whether the inherited subprogram is a private operation that
15432 -- should be inherited but not yet made visible. Such subprograms can
15433 -- become visible at a later point (e.g., the private part of a public
15434 -- child unit) via Declare_Inherited_Private_Subprograms. If the
15435 -- following predicate is true, then this is not such a private
15436 -- operation and the subprogram simply inherits the name of the parent
15437 -- subprogram. Note the special check for the names of controlled
15438 -- operations, which are currently exempted from being inherited with
15439 -- a hidden name because they must be findable for generation of
15440 -- implicit run-time calls.
15442 if not Is_Hidden (Parent_Subp)
15443 or else Is_Internal (Parent_Subp)
15444 or else Is_Private_Overriding
15445 or else Is_Internal_Name (Chars (Parent_Subp))
15446 or else (Is_Controlled (Parent_Type)
15447 and then Nam_In (Chars (Parent_Subp), Name_Adjust,
15453 -- An inherited dispatching equality will be overridden by an internally
15454 -- generated one, or by an explicit one, so preserve its name and thus
15455 -- its entry in the dispatch table. Otherwise, if Parent_Subp is a
15456 -- private operation it may become invisible if the full view has
15457 -- progenitors, and the dispatch table will be malformed.
15458 -- We check that the type is limited to handle the anomalous declaration
15459 -- of Limited_Controlled, which is derived from a non-limited type, and
15460 -- which is handled specially elsewhere as well.
15462 elsif Chars (Parent_Subp) = Name_Op_Eq
15463 and then Is_Dispatching_Operation (Parent_Subp)
15464 and then Etype (Parent_Subp) = Standard_Boolean
15465 and then not Is_Limited_Type (Etype (First_Formal (Parent_Subp)))
15467 Etype (First_Formal (Parent_Subp)) =
15468 Etype (Next_Formal (First_Formal (Parent_Subp)))
15472 -- If parent is hidden, this can be a regular derivation if the
15473 -- parent is immediately visible in a non-instantiating context,
15474 -- or if we are in the private part of an instance. This test
15475 -- should still be refined ???
15477 -- The test for In_Instance_Not_Visible avoids inheriting the derived
15478 -- operation as a non-visible operation in cases where the parent
15479 -- subprogram might not be visible now, but was visible within the
15480 -- original generic, so it would be wrong to make the inherited
15481 -- subprogram non-visible now. (Not clear if this test is fully
15482 -- correct; are there any cases where we should declare the inherited
15483 -- operation as not visible to avoid it being overridden, e.g., when
15484 -- the parent type is a generic actual with private primitives ???)
15486 -- (they should be treated the same as other private inherited
15487 -- subprograms, but it's not clear how to do this cleanly). ???
15489 elsif (In_Open_Scopes (Scope (Base_Type (Parent_Type)))
15490 and then Is_Immediately_Visible (Parent_Subp)
15491 and then not In_Instance)
15492 or else In_Instance_Not_Visible
15496 -- Ada 2005 (AI-251): Regular derivation if the parent subprogram
15497 -- overrides an interface primitive because interface primitives
15498 -- must be visible in the partial view of the parent (RM 7.3 (7.3/2))
15500 elsif Ada_Version >= Ada_2005
15501 and then Is_Dispatching_Operation (Parent_Subp)
15502 and then Present (Covered_Interface_Op (Parent_Subp))
15506 -- Otherwise, the type is inheriting a private operation, so enter it
15507 -- with a special name so it can't be overridden.
15510 Set_Chars (New_Subp, New_External_Name (Chars (Parent_Subp), 'P'));
15513 Set_Parent (New_Subp, Parent (Derived_Type));
15515 if Present (Actual_Subp) then
15516 Replace_Type (Actual_Subp, New_Subp);
15518 Replace_Type (Parent_Subp, New_Subp);
15521 Conditional_Delay (New_Subp, Parent_Subp);
15523 -- If we are creating a renaming for a primitive operation of an
15524 -- actual of a generic derived type, we must examine the signature
15525 -- of the actual primitive, not that of the generic formal, which for
15526 -- example may be an interface. However the name and initial value
15527 -- of the inherited operation are those of the formal primitive.
15529 Formal := First_Formal (Parent_Subp);
15531 if Present (Actual_Subp) then
15532 Formal_Of_Actual := First_Formal (Actual_Subp);
15534 Formal_Of_Actual := Empty;
15537 while Present (Formal) loop
15538 New_Formal := New_Copy (Formal);
15540 -- Normally we do not go copying parents, but in the case of
15541 -- formals, we need to link up to the declaration (which is the
15542 -- parameter specification), and it is fine to link up to the
15543 -- original formal's parameter specification in this case.
15545 Set_Parent (New_Formal, Parent (Formal));
15546 Append_Entity (New_Formal, New_Subp);
15548 if Present (Formal_Of_Actual) then
15549 Replace_Type (Formal_Of_Actual, New_Formal);
15550 Next_Formal (Formal_Of_Actual);
15552 Replace_Type (Formal, New_Formal);
15555 Next_Formal (Formal);
15558 -- If this derivation corresponds to a tagged generic actual, then
15559 -- primitive operations rename those of the actual. Otherwise the
15560 -- primitive operations rename those of the parent type, If the parent
15561 -- renames an intrinsic operator, so does the new subprogram. We except
15562 -- concatenation, which is always properly typed, and does not get
15563 -- expanded as other intrinsic operations.
15565 if No (Actual_Subp) then
15566 if Is_Intrinsic_Subprogram (Parent_Subp) then
15567 Set_Is_Intrinsic_Subprogram (New_Subp);
15569 if Present (Alias (Parent_Subp))
15570 and then Chars (Parent_Subp) /= Name_Op_Concat
15572 Set_Alias (New_Subp, Alias (Parent_Subp));
15574 Set_Alias (New_Subp, Parent_Subp);
15578 Set_Alias (New_Subp, Parent_Subp);
15582 Set_Alias (New_Subp, Actual_Subp);
15585 -- Derived subprograms of a tagged type must inherit the convention
15586 -- of the parent subprogram (a requirement of AI-117). Derived
15587 -- subprograms of untagged types simply get convention Ada by default.
15589 -- If the derived type is a tagged generic formal type with unknown
15590 -- discriminants, its convention is intrinsic (RM 6.3.1 (8)).
15592 -- However, if the type is derived from a generic formal, the further
15593 -- inherited subprogram has the convention of the non-generic ancestor.
15594 -- Otherwise there would be no way to override the operation.
15595 -- (This is subject to forthcoming ARG discussions).
15597 if Is_Tagged_Type (Derived_Type) then
15598 if Is_Generic_Type (Derived_Type)
15599 and then Has_Unknown_Discriminants (Derived_Type)
15601 Set_Convention (New_Subp, Convention_Intrinsic);
15604 if Is_Generic_Type (Parent_Type)
15605 and then Has_Unknown_Discriminants (Parent_Type)
15607 Set_Convention (New_Subp, Convention (Alias (Parent_Subp)));
15609 Set_Convention (New_Subp, Convention (Parent_Subp));
15614 -- Predefined controlled operations retain their name even if the parent
15615 -- is hidden (see above), but they are not primitive operations if the
15616 -- ancestor is not visible, for example if the parent is a private
15617 -- extension completed with a controlled extension. Note that a full
15618 -- type that is controlled can break privacy: the flag Is_Controlled is
15619 -- set on both views of the type.
15621 if Is_Controlled (Parent_Type)
15622 and then Nam_In (Chars (Parent_Subp), Name_Initialize,
15625 and then Is_Hidden (Parent_Subp)
15626 and then not Is_Visibly_Controlled (Parent_Type)
15628 Set_Is_Hidden (New_Subp);
15631 Set_Is_Imported (New_Subp, Is_Imported (Parent_Subp));
15632 Set_Is_Exported (New_Subp, Is_Exported (Parent_Subp));
15634 if Ekind (Parent_Subp) = E_Procedure then
15635 Set_Is_Valued_Procedure
15636 (New_Subp, Is_Valued_Procedure (Parent_Subp));
15638 Set_Has_Controlling_Result
15639 (New_Subp, Has_Controlling_Result (Parent_Subp));
15642 -- No_Return must be inherited properly. If this is overridden in the
15643 -- case of a dispatching operation, then a check is made in Sem_Disp
15644 -- that the overriding operation is also No_Return (no such check is
15645 -- required for the case of non-dispatching operation.
15647 Set_No_Return (New_Subp, No_Return (Parent_Subp));
15649 -- A derived function with a controlling result is abstract. If the
15650 -- Derived_Type is a nonabstract formal generic derived type, then
15651 -- inherited operations are not abstract: the required check is done at
15652 -- instantiation time. If the derivation is for a generic actual, the
15653 -- function is not abstract unless the actual is.
15655 if Is_Generic_Type (Derived_Type)
15656 and then not Is_Abstract_Type (Derived_Type)
15660 -- Ada 2005 (AI-228): Calculate the "require overriding" and "abstract"
15661 -- properties of the subprogram, as defined in RM-3.9.3(4/2-6/2).
15663 -- A subprogram subject to pragma Extensions_Visible with value False
15664 -- requires overriding if the subprogram has at least one controlling
15665 -- OUT parameter (SPARK RM 6.1.7(6)).
15667 elsif Ada_Version >= Ada_2005
15668 and then (Is_Abstract_Subprogram (Alias (New_Subp))
15669 or else (Is_Tagged_Type (Derived_Type)
15670 and then Etype (New_Subp) = Derived_Type
15671 and then not Is_Null_Extension (Derived_Type))
15672 or else (Is_Tagged_Type (Derived_Type)
15673 and then Ekind (Etype (New_Subp)) =
15674 E_Anonymous_Access_Type
15675 and then Designated_Type (Etype (New_Subp)) =
15677 and then not Is_Null_Extension (Derived_Type))
15678 or else (Comes_From_Source (Alias (New_Subp))
15679 and then Is_EVF_Procedure (Alias (New_Subp))))
15680 and then No (Actual_Subp)
15682 if not Is_Tagged_Type (Derived_Type)
15683 or else Is_Abstract_Type (Derived_Type)
15684 or else Is_Abstract_Subprogram (Alias (New_Subp))
15686 Set_Is_Abstract_Subprogram (New_Subp);
15688 Set_Requires_Overriding (New_Subp);
15691 elsif Ada_Version < Ada_2005
15692 and then (Is_Abstract_Subprogram (Alias (New_Subp))
15693 or else (Is_Tagged_Type (Derived_Type)
15694 and then Etype (New_Subp) = Derived_Type
15695 and then No (Actual_Subp)))
15697 Set_Is_Abstract_Subprogram (New_Subp);
15699 -- AI05-0097 : an inherited operation that dispatches on result is
15700 -- abstract if the derived type is abstract, even if the parent type
15701 -- is concrete and the derived type is a null extension.
15703 elsif Has_Controlling_Result (Alias (New_Subp))
15704 and then Is_Abstract_Type (Etype (New_Subp))
15706 Set_Is_Abstract_Subprogram (New_Subp);
15708 -- Finally, if the parent type is abstract we must verify that all
15709 -- inherited operations are either non-abstract or overridden, or that
15710 -- the derived type itself is abstract (this check is performed at the
15711 -- end of a package declaration, in Check_Abstract_Overriding). A
15712 -- private overriding in the parent type will not be visible in the
15713 -- derivation if we are not in an inner package or in a child unit of
15714 -- the parent type, in which case the abstractness of the inherited
15715 -- operation is carried to the new subprogram.
15717 elsif Is_Abstract_Type (Parent_Type)
15718 and then not In_Open_Scopes (Scope (Parent_Type))
15719 and then Is_Private_Overriding
15720 and then Is_Abstract_Subprogram (Visible_Subp)
15722 if No (Actual_Subp) then
15723 Set_Alias (New_Subp, Visible_Subp);
15724 Set_Is_Abstract_Subprogram (New_Subp, True);
15727 -- If this is a derivation for an instance of a formal derived
15728 -- type, abstractness comes from the primitive operation of the
15729 -- actual, not from the operation inherited from the ancestor.
15731 Set_Is_Abstract_Subprogram
15732 (New_Subp, Is_Abstract_Subprogram (Actual_Subp));
15736 New_Overloaded_Entity (New_Subp, Derived_Type);
15738 -- Ada RM 6.1.1 (15): If a subprogram inherits nonconforming class-wide
15739 -- preconditions and the derived type is abstract, the derived operation
15740 -- is abstract as well if parent subprogram is not abstract or null.
15742 if Is_Abstract_Type (Derived_Type)
15743 and then Has_Non_Trivial_Precondition (Parent_Subp)
15744 and then Present (Interfaces (Derived_Type))
15747 -- Add useful attributes of subprogram before the freeze point,
15748 -- in case freezing is delayed or there are previous errors.
15750 Set_Is_Dispatching_Operation (New_Subp);
15753 Iface_Prim : constant Entity_Id := Covered_Interface_Op (New_Subp);
15756 if Present (Iface_Prim)
15757 and then Has_Non_Trivial_Precondition (Iface_Prim)
15759 Set_Is_Abstract_Subprogram (New_Subp);
15764 -- Check for case of a derived subprogram for the instantiation of a
15765 -- formal derived tagged type, if so mark the subprogram as dispatching
15766 -- and inherit the dispatching attributes of the actual subprogram. The
15767 -- derived subprogram is effectively renaming of the actual subprogram,
15768 -- so it needs to have the same attributes as the actual.
15770 if Present (Actual_Subp)
15771 and then Is_Dispatching_Operation (Actual_Subp)
15773 Set_Is_Dispatching_Operation (New_Subp);
15775 if Present (DTC_Entity (Actual_Subp)) then
15776 Set_DTC_Entity (New_Subp, DTC_Entity (Actual_Subp));
15777 Set_DT_Position_Value (New_Subp, DT_Position (Actual_Subp));
15781 -- Indicate that a derived subprogram does not require a body and that
15782 -- it does not require processing of default expressions.
15784 Set_Has_Completion (New_Subp);
15785 Set_Default_Expressions_Processed (New_Subp);
15787 if Ekind (New_Subp) = E_Function then
15788 Set_Mechanism (New_Subp, Mechanism (Parent_Subp));
15790 end Derive_Subprogram;
15792 ------------------------
15793 -- Derive_Subprograms --
15794 ------------------------
15796 procedure Derive_Subprograms
15797 (Parent_Type : Entity_Id;
15798 Derived_Type : Entity_Id;
15799 Generic_Actual : Entity_Id := Empty)
15801 Op_List : constant Elist_Id :=
15802 Collect_Primitive_Operations (Parent_Type);
15804 function Check_Derived_Type return Boolean;
15805 -- Check that all the entities derived from Parent_Type are found in
15806 -- the list of primitives of Derived_Type exactly in the same order.
15808 procedure Derive_Interface_Subprogram
15809 (New_Subp : out Entity_Id;
15811 Actual_Subp : Entity_Id);
15812 -- Derive New_Subp from the ultimate alias of the parent subprogram Subp
15813 -- (which is an interface primitive). If Generic_Actual is present then
15814 -- Actual_Subp is the actual subprogram corresponding with the generic
15815 -- subprogram Subp.
15817 ------------------------
15818 -- Check_Derived_Type --
15819 ------------------------
15821 function Check_Derived_Type return Boolean is
15825 New_Subp : Entity_Id;
15830 -- Traverse list of entities in the current scope searching for
15831 -- an incomplete type whose full-view is derived type.
15833 E := First_Entity (Scope (Derived_Type));
15834 while Present (E) and then E /= Derived_Type loop
15835 if Ekind (E) = E_Incomplete_Type
15836 and then Present (Full_View (E))
15837 and then Full_View (E) = Derived_Type
15839 -- Disable this test if Derived_Type completes an incomplete
15840 -- type because in such case more primitives can be added
15841 -- later to the list of primitives of Derived_Type by routine
15842 -- Process_Incomplete_Dependents
15847 E := Next_Entity (E);
15850 List := Collect_Primitive_Operations (Derived_Type);
15851 Elmt := First_Elmt (List);
15853 Op_Elmt := First_Elmt (Op_List);
15854 while Present (Op_Elmt) loop
15855 Subp := Node (Op_Elmt);
15856 New_Subp := Node (Elmt);
15858 -- At this early stage Derived_Type has no entities with attribute
15859 -- Interface_Alias. In addition, such primitives are always
15860 -- located at the end of the list of primitives of Parent_Type.
15861 -- Therefore, if found we can safely stop processing pending
15864 exit when Present (Interface_Alias (Subp));
15866 -- Handle hidden entities
15868 if not Is_Predefined_Dispatching_Operation (Subp)
15869 and then Is_Hidden (Subp)
15871 if Present (New_Subp)
15872 and then Primitive_Names_Match (Subp, New_Subp)
15878 if not Present (New_Subp)
15879 or else Ekind (Subp) /= Ekind (New_Subp)
15880 or else not Primitive_Names_Match (Subp, New_Subp)
15888 Next_Elmt (Op_Elmt);
15892 end Check_Derived_Type;
15894 ---------------------------------
15895 -- Derive_Interface_Subprogram --
15896 ---------------------------------
15898 procedure Derive_Interface_Subprogram
15899 (New_Subp : out Entity_Id;
15901 Actual_Subp : Entity_Id)
15903 Iface_Subp : constant Entity_Id := Ultimate_Alias (Subp);
15904 Iface_Type : constant Entity_Id := Find_Dispatching_Type (Iface_Subp);
15907 pragma Assert (Is_Interface (Iface_Type));
15910 (New_Subp => New_Subp,
15911 Parent_Subp => Iface_Subp,
15912 Derived_Type => Derived_Type,
15913 Parent_Type => Iface_Type,
15914 Actual_Subp => Actual_Subp);
15916 -- Given that this new interface entity corresponds with a primitive
15917 -- of the parent that was not overridden we must leave it associated
15918 -- with its parent primitive to ensure that it will share the same
15919 -- dispatch table slot when overridden. We must set the Alias to Subp
15920 -- (instead of Iface_Subp), and we must fix Is_Abstract_Subprogram
15921 -- (in case we inherited Subp from Iface_Type via a nonabstract
15922 -- generic formal type).
15924 if No (Actual_Subp) then
15925 Set_Alias (New_Subp, Subp);
15928 T : Entity_Id := Find_Dispatching_Type (Subp);
15930 while Etype (T) /= T loop
15931 if Is_Generic_Type (T) and then not Is_Abstract_Type (T) then
15932 Set_Is_Abstract_Subprogram (New_Subp, False);
15940 -- For instantiations this is not needed since the previous call to
15941 -- Derive_Subprogram leaves the entity well decorated.
15944 pragma Assert (Alias (New_Subp) = Actual_Subp);
15947 end Derive_Interface_Subprogram;
15951 Alias_Subp : Entity_Id;
15952 Act_List : Elist_Id;
15953 Act_Elmt : Elmt_Id;
15954 Act_Subp : Entity_Id := Empty;
15956 Need_Search : Boolean := False;
15957 New_Subp : Entity_Id := Empty;
15958 Parent_Base : Entity_Id;
15961 -- Start of processing for Derive_Subprograms
15964 if Ekind (Parent_Type) = E_Record_Type_With_Private
15965 and then Has_Discriminants (Parent_Type)
15966 and then Present (Full_View (Parent_Type))
15968 Parent_Base := Full_View (Parent_Type);
15970 Parent_Base := Parent_Type;
15973 if Present (Generic_Actual) then
15974 Act_List := Collect_Primitive_Operations (Generic_Actual);
15975 Act_Elmt := First_Elmt (Act_List);
15977 Act_List := No_Elist;
15978 Act_Elmt := No_Elmt;
15981 -- Derive primitives inherited from the parent. Note that if the generic
15982 -- actual is present, this is not really a type derivation, it is a
15983 -- completion within an instance.
15985 -- Case 1: Derived_Type does not implement interfaces
15987 if not Is_Tagged_Type (Derived_Type)
15988 or else (not Has_Interfaces (Derived_Type)
15989 and then not (Present (Generic_Actual)
15990 and then Has_Interfaces (Generic_Actual)))
15992 Elmt := First_Elmt (Op_List);
15993 while Present (Elmt) loop
15994 Subp := Node (Elmt);
15996 -- Literals are derived earlier in the process of building the
15997 -- derived type, and are skipped here.
15999 if Ekind (Subp) = E_Enumeration_Literal then
16002 -- The actual is a direct descendant and the common primitive
16003 -- operations appear in the same order.
16005 -- If the generic parent type is present, the derived type is an
16006 -- instance of a formal derived type, and within the instance its
16007 -- operations are those of the actual. We derive from the formal
16008 -- type but make the inherited operations aliases of the
16009 -- corresponding operations of the actual.
16012 pragma Assert (No (Node (Act_Elmt))
16013 or else (Primitive_Names_Match (Subp, Node (Act_Elmt))
16016 (Subp, Node (Act_Elmt),
16017 Skip_Controlling_Formals => True)));
16020 (New_Subp, Subp, Derived_Type, Parent_Base, Node (Act_Elmt));
16022 if Present (Act_Elmt) then
16023 Next_Elmt (Act_Elmt);
16030 -- Case 2: Derived_Type implements interfaces
16033 -- If the parent type has no predefined primitives we remove
16034 -- predefined primitives from the list of primitives of generic
16035 -- actual to simplify the complexity of this algorithm.
16037 if Present (Generic_Actual) then
16039 Has_Predefined_Primitives : Boolean := False;
16042 -- Check if the parent type has predefined primitives
16044 Elmt := First_Elmt (Op_List);
16045 while Present (Elmt) loop
16046 Subp := Node (Elmt);
16048 if Is_Predefined_Dispatching_Operation (Subp)
16049 and then not Comes_From_Source (Ultimate_Alias (Subp))
16051 Has_Predefined_Primitives := True;
16058 -- Remove predefined primitives of Generic_Actual. We must use
16059 -- an auxiliary list because in case of tagged types the value
16060 -- returned by Collect_Primitive_Operations is the value stored
16061 -- in its Primitive_Operations attribute (and we don't want to
16062 -- modify its current contents).
16064 if not Has_Predefined_Primitives then
16066 Aux_List : constant Elist_Id := New_Elmt_List;
16069 Elmt := First_Elmt (Act_List);
16070 while Present (Elmt) loop
16071 Subp := Node (Elmt);
16073 if not Is_Predefined_Dispatching_Operation (Subp)
16074 or else Comes_From_Source (Subp)
16076 Append_Elmt (Subp, Aux_List);
16082 Act_List := Aux_List;
16086 Act_Elmt := First_Elmt (Act_List);
16087 Act_Subp := Node (Act_Elmt);
16091 -- Stage 1: If the generic actual is not present we derive the
16092 -- primitives inherited from the parent type. If the generic parent
16093 -- type is present, the derived type is an instance of a formal
16094 -- derived type, and within the instance its operations are those of
16095 -- the actual. We derive from the formal type but make the inherited
16096 -- operations aliases of the corresponding operations of the actual.
16098 Elmt := First_Elmt (Op_List);
16099 while Present (Elmt) loop
16100 Subp := Node (Elmt);
16101 Alias_Subp := Ultimate_Alias (Subp);
16103 -- Do not derive internal entities of the parent that link
16104 -- interface primitives with their covering primitive. These
16105 -- entities will be added to this type when frozen.
16107 if Present (Interface_Alias (Subp)) then
16111 -- If the generic actual is present find the corresponding
16112 -- operation in the generic actual. If the parent type is a
16113 -- direct ancestor of the derived type then, even if it is an
16114 -- interface, the operations are inherited from the primary
16115 -- dispatch table and are in the proper order. If we detect here
16116 -- that primitives are not in the same order we traverse the list
16117 -- of primitive operations of the actual to find the one that
16118 -- implements the interface primitive.
16122 (Present (Generic_Actual)
16123 and then Present (Act_Subp)
16125 (Primitive_Names_Match (Subp, Act_Subp)
16127 Type_Conformant (Subp, Act_Subp,
16128 Skip_Controlling_Formals => True)))
16130 pragma Assert (not Is_Ancestor (Parent_Base, Generic_Actual,
16131 Use_Full_View => True));
16133 -- Remember that we need searching for all pending primitives
16135 Need_Search := True;
16137 -- Handle entities associated with interface primitives
16139 if Present (Alias_Subp)
16140 and then Is_Interface (Find_Dispatching_Type (Alias_Subp))
16141 and then not Is_Predefined_Dispatching_Operation (Subp)
16143 -- Search for the primitive in the homonym chain
16146 Find_Primitive_Covering_Interface
16147 (Tagged_Type => Generic_Actual,
16148 Iface_Prim => Alias_Subp);
16150 -- Previous search may not locate primitives covering
16151 -- interfaces defined in generics units or instantiations.
16152 -- (it fails if the covering primitive has formals whose
16153 -- type is also defined in generics or instantiations).
16154 -- In such case we search in the list of primitives of the
16155 -- generic actual for the internal entity that links the
16156 -- interface primitive and the covering primitive.
16159 and then Is_Generic_Type (Parent_Type)
16161 -- This code has been designed to handle only generic
16162 -- formals that implement interfaces that are defined
16163 -- in a generic unit or instantiation. If this code is
16164 -- needed for other cases we must review it because
16165 -- (given that it relies on Original_Location to locate
16166 -- the primitive of Generic_Actual that covers the
16167 -- interface) it could leave linked through attribute
16168 -- Alias entities of unrelated instantiations).
16172 (Scope (Find_Dispatching_Type (Alias_Subp)))
16174 Instantiation_Depth
16175 (Sloc (Find_Dispatching_Type (Alias_Subp))) > 0);
16178 Iface_Prim_Loc : constant Source_Ptr :=
16179 Original_Location (Sloc (Alias_Subp));
16186 First_Elmt (Primitive_Operations (Generic_Actual));
16188 Search : while Present (Elmt) loop
16189 Prim := Node (Elmt);
16191 if Present (Interface_Alias (Prim))
16192 and then Original_Location
16193 (Sloc (Interface_Alias (Prim))) =
16196 Act_Subp := Alias (Prim);
16205 pragma Assert (Present (Act_Subp)
16206 or else Is_Abstract_Type (Generic_Actual)
16207 or else Serious_Errors_Detected > 0);
16209 -- Handle predefined primitives plus the rest of user-defined
16213 Act_Elmt := First_Elmt (Act_List);
16214 while Present (Act_Elmt) loop
16215 Act_Subp := Node (Act_Elmt);
16217 exit when Primitive_Names_Match (Subp, Act_Subp)
16218 and then Type_Conformant
16220 Skip_Controlling_Formals => True)
16221 and then No (Interface_Alias (Act_Subp));
16223 Next_Elmt (Act_Elmt);
16226 if No (Act_Elmt) then
16232 -- Case 1: If the parent is a limited interface then it has the
16233 -- predefined primitives of synchronized interfaces. However, the
16234 -- actual type may be a non-limited type and hence it does not
16235 -- have such primitives.
16237 if Present (Generic_Actual)
16238 and then not Present (Act_Subp)
16239 and then Is_Limited_Interface (Parent_Base)
16240 and then Is_Predefined_Interface_Primitive (Subp)
16244 -- Case 2: Inherit entities associated with interfaces that were
16245 -- not covered by the parent type. We exclude here null interface
16246 -- primitives because they do not need special management.
16248 -- We also exclude interface operations that are renamings. If the
16249 -- subprogram is an explicit renaming of an interface primitive,
16250 -- it is a regular primitive operation, and the presence of its
16251 -- alias is not relevant: it has to be derived like any other
16254 elsif Present (Alias (Subp))
16255 and then Nkind (Unit_Declaration_Node (Subp)) /=
16256 N_Subprogram_Renaming_Declaration
16257 and then Is_Interface (Find_Dispatching_Type (Alias_Subp))
16259 (Nkind (Parent (Alias_Subp)) = N_Procedure_Specification
16260 and then Null_Present (Parent (Alias_Subp)))
16262 -- If this is an abstract private type then we transfer the
16263 -- derivation of the interface primitive from the partial view
16264 -- to the full view. This is safe because all the interfaces
16265 -- must be visible in the partial view. Done to avoid adding
16266 -- a new interface derivation to the private part of the
16267 -- enclosing package; otherwise this new derivation would be
16268 -- decorated as hidden when the analysis of the enclosing
16269 -- package completes.
16271 if Is_Abstract_Type (Derived_Type)
16272 and then In_Private_Part (Current_Scope)
16273 and then Has_Private_Declaration (Derived_Type)
16276 Partial_View : Entity_Id;
16281 Partial_View := First_Entity (Current_Scope);
16283 exit when No (Partial_View)
16284 or else (Has_Private_Declaration (Partial_View)
16286 Full_View (Partial_View) = Derived_Type);
16288 Next_Entity (Partial_View);
16291 -- If the partial view was not found then the source code
16292 -- has errors and the derivation is not needed.
16294 if Present (Partial_View) then
16296 First_Elmt (Primitive_Operations (Partial_View));
16297 while Present (Elmt) loop
16298 Ent := Node (Elmt);
16300 if Present (Alias (Ent))
16301 and then Ultimate_Alias (Ent) = Alias (Subp)
16304 (Ent, Primitive_Operations (Derived_Type));
16311 -- If the interface primitive was not found in the
16312 -- partial view then this interface primitive was
16313 -- overridden. We add a derivation to activate in
16314 -- Derive_Progenitor_Subprograms the machinery to
16318 Derive_Interface_Subprogram
16319 (New_Subp => New_Subp,
16321 Actual_Subp => Act_Subp);
16326 Derive_Interface_Subprogram
16327 (New_Subp => New_Subp,
16329 Actual_Subp => Act_Subp);
16332 -- Case 3: Common derivation
16336 (New_Subp => New_Subp,
16337 Parent_Subp => Subp,
16338 Derived_Type => Derived_Type,
16339 Parent_Type => Parent_Base,
16340 Actual_Subp => Act_Subp);
16343 -- No need to update Act_Elm if we must search for the
16344 -- corresponding operation in the generic actual
16347 and then Present (Act_Elmt)
16349 Next_Elmt (Act_Elmt);
16350 Act_Subp := Node (Act_Elmt);
16357 -- Inherit additional operations from progenitors. If the derived
16358 -- type is a generic actual, there are not new primitive operations
16359 -- for the type because it has those of the actual, and therefore
16360 -- nothing needs to be done. The renamings generated above are not
16361 -- primitive operations, and their purpose is simply to make the
16362 -- proper operations visible within an instantiation.
16364 if No (Generic_Actual) then
16365 Derive_Progenitor_Subprograms (Parent_Base, Derived_Type);
16369 -- Final check: Direct descendants must have their primitives in the
16370 -- same order. We exclude from this test untagged types and instances
16371 -- of formal derived types. We skip this test if we have already
16372 -- reported serious errors in the sources.
16374 pragma Assert (not Is_Tagged_Type (Derived_Type)
16375 or else Present (Generic_Actual)
16376 or else Serious_Errors_Detected > 0
16377 or else Check_Derived_Type);
16378 end Derive_Subprograms;
16380 --------------------------------
16381 -- Derived_Standard_Character --
16382 --------------------------------
16384 procedure Derived_Standard_Character
16386 Parent_Type : Entity_Id;
16387 Derived_Type : Entity_Id)
16389 Loc : constant Source_Ptr := Sloc (N);
16390 Def : constant Node_Id := Type_Definition (N);
16391 Indic : constant Node_Id := Subtype_Indication (Def);
16392 Parent_Base : constant Entity_Id := Base_Type (Parent_Type);
16393 Implicit_Base : constant Entity_Id :=
16395 (E_Enumeration_Type, N, Derived_Type, 'B');
16401 Discard_Node (Process_Subtype (Indic, N));
16403 Set_Etype (Implicit_Base, Parent_Base);
16404 Set_Size_Info (Implicit_Base, Root_Type (Parent_Type));
16405 Set_RM_Size (Implicit_Base, RM_Size (Root_Type (Parent_Type)));
16407 Set_Is_Character_Type (Implicit_Base, True);
16408 Set_Has_Delayed_Freeze (Implicit_Base);
16410 -- The bounds of the implicit base are the bounds of the parent base.
16411 -- Note that their type is the parent base.
16413 Lo := New_Copy_Tree (Type_Low_Bound (Parent_Base));
16414 Hi := New_Copy_Tree (Type_High_Bound (Parent_Base));
16416 Set_Scalar_Range (Implicit_Base,
16419 High_Bound => Hi));
16421 Conditional_Delay (Derived_Type, Parent_Type);
16423 Set_Ekind (Derived_Type, E_Enumeration_Subtype);
16424 Set_Etype (Derived_Type, Implicit_Base);
16425 Set_Size_Info (Derived_Type, Parent_Type);
16427 if Unknown_RM_Size (Derived_Type) then
16428 Set_RM_Size (Derived_Type, RM_Size (Parent_Type));
16431 Set_Is_Character_Type (Derived_Type, True);
16433 if Nkind (Indic) /= N_Subtype_Indication then
16435 -- If no explicit constraint, the bounds are those
16436 -- of the parent type.
16438 Lo := New_Copy_Tree (Type_Low_Bound (Parent_Type));
16439 Hi := New_Copy_Tree (Type_High_Bound (Parent_Type));
16440 Set_Scalar_Range (Derived_Type, Make_Range (Loc, Lo, Hi));
16443 Convert_Scalar_Bounds (N, Parent_Type, Derived_Type, Loc);
16445 -- Because the implicit base is used in the conversion of the bounds, we
16446 -- have to freeze it now. This is similar to what is done for numeric
16447 -- types, and it equally suspicious, but otherwise a nonstatic bound
16448 -- will have a reference to an unfrozen type, which is rejected by Gigi
16449 -- (???). This requires specific care for definition of stream
16450 -- attributes. For details, see comments at the end of
16451 -- Build_Derived_Numeric_Type.
16453 Freeze_Before (N, Implicit_Base);
16454 end Derived_Standard_Character;
16456 ------------------------------
16457 -- Derived_Type_Declaration --
16458 ------------------------------
16460 procedure Derived_Type_Declaration
16463 Is_Completion : Boolean)
16465 Parent_Type : Entity_Id;
16467 function Comes_From_Generic (Typ : Entity_Id) return Boolean;
16468 -- Check whether the parent type is a generic formal, or derives
16469 -- directly or indirectly from one.
16471 ------------------------
16472 -- Comes_From_Generic --
16473 ------------------------
16475 function Comes_From_Generic (Typ : Entity_Id) return Boolean is
16477 if Is_Generic_Type (Typ) then
16480 elsif Is_Generic_Type (Root_Type (Parent_Type)) then
16483 elsif Is_Private_Type (Typ)
16484 and then Present (Full_View (Typ))
16485 and then Is_Generic_Type (Root_Type (Full_View (Typ)))
16489 elsif Is_Generic_Actual_Type (Typ) then
16495 end Comes_From_Generic;
16499 Def : constant Node_Id := Type_Definition (N);
16500 Iface_Def : Node_Id;
16501 Indic : constant Node_Id := Subtype_Indication (Def);
16502 Extension : constant Node_Id := Record_Extension_Part (Def);
16503 Parent_Node : Node_Id;
16506 -- Start of processing for Derived_Type_Declaration
16509 Parent_Type := Find_Type_Of_Subtype_Indic (Indic);
16512 and then Is_Tagged_Type (Parent_Type)
16515 Partial_View : constant Entity_Id :=
16516 Incomplete_Or_Partial_View (Parent_Type);
16519 -- If the partial view was not found then the parent type is not
16520 -- a private type. Otherwise check if the partial view is a tagged
16523 if Present (Partial_View)
16524 and then Is_Private_Type (Partial_View)
16525 and then not Is_Tagged_Type (Partial_View)
16528 ("cannot derive from & declared as untagged private "
16529 & "(SPARK RM 3.4(1))", N, Partial_View);
16534 -- Ada 2005 (AI-251): In case of interface derivation check that the
16535 -- parent is also an interface.
16537 if Interface_Present (Def) then
16538 Check_SPARK_05_Restriction ("interface is not allowed", Def);
16540 if not Is_Interface (Parent_Type) then
16541 Diagnose_Interface (Indic, Parent_Type);
16544 Parent_Node := Parent (Base_Type (Parent_Type));
16545 Iface_Def := Type_Definition (Parent_Node);
16547 -- Ada 2005 (AI-251): Limited interfaces can only inherit from
16548 -- other limited interfaces.
16550 if Limited_Present (Def) then
16551 if Limited_Present (Iface_Def) then
16554 elsif Protected_Present (Iface_Def) then
16556 ("descendant of & must be declared as a protected "
16557 & "interface", N, Parent_Type);
16559 elsif Synchronized_Present (Iface_Def) then
16561 ("descendant of & must be declared as a synchronized "
16562 & "interface", N, Parent_Type);
16564 elsif Task_Present (Iface_Def) then
16566 ("descendant of & must be declared as a task interface",
16571 ("(Ada 2005) limited interface cannot inherit from "
16572 & "non-limited interface", Indic);
16575 -- Ada 2005 (AI-345): Non-limited interfaces can only inherit
16576 -- from non-limited or limited interfaces.
16578 elsif not Protected_Present (Def)
16579 and then not Synchronized_Present (Def)
16580 and then not Task_Present (Def)
16582 if Limited_Present (Iface_Def) then
16585 elsif Protected_Present (Iface_Def) then
16587 ("descendant of & must be declared as a protected "
16588 & "interface", N, Parent_Type);
16590 elsif Synchronized_Present (Iface_Def) then
16592 ("descendant of & must be declared as a synchronized "
16593 & "interface", N, Parent_Type);
16595 elsif Task_Present (Iface_Def) then
16597 ("descendant of & must be declared as a task interface",
16606 if Is_Tagged_Type (Parent_Type)
16607 and then Is_Concurrent_Type (Parent_Type)
16608 and then not Is_Interface (Parent_Type)
16611 ("parent type of a record extension cannot be a synchronized "
16612 & "tagged type (RM 3.9.1 (3/1))", N);
16613 Set_Etype (T, Any_Type);
16617 -- Ada 2005 (AI-251): Decorate all the names in the list of ancestor
16620 if Is_Tagged_Type (Parent_Type)
16621 and then Is_Non_Empty_List (Interface_List (Def))
16628 Intf := First (Interface_List (Def));
16629 while Present (Intf) loop
16630 T := Find_Type_Of_Subtype_Indic (Intf);
16632 if not Is_Interface (T) then
16633 Diagnose_Interface (Intf, T);
16635 -- Check the rules of 3.9.4(12/2) and 7.5(2/2) that disallow
16636 -- a limited type from having a nonlimited progenitor.
16638 elsif (Limited_Present (Def)
16639 or else (not Is_Interface (Parent_Type)
16640 and then Is_Limited_Type (Parent_Type)))
16641 and then not Is_Limited_Interface (T)
16644 ("progenitor interface& of limited type must be limited",
16653 if Parent_Type = Any_Type
16654 or else Etype (Parent_Type) = Any_Type
16655 or else (Is_Class_Wide_Type (Parent_Type)
16656 and then Etype (Parent_Type) = T)
16658 -- If Parent_Type is undefined or illegal, make new type into a
16659 -- subtype of Any_Type, and set a few attributes to prevent cascaded
16660 -- errors. If this is a self-definition, emit error now.
16662 if T = Parent_Type or else T = Etype (Parent_Type) then
16663 Error_Msg_N ("type cannot be used in its own definition", Indic);
16666 Set_Ekind (T, Ekind (Parent_Type));
16667 Set_Etype (T, Any_Type);
16668 Set_Scalar_Range (T, Scalar_Range (Any_Type));
16670 if Is_Tagged_Type (T)
16671 and then Is_Record_Type (T)
16673 Set_Direct_Primitive_Operations (T, New_Elmt_List);
16679 -- Ada 2005 (AI-251): The case in which the parent of the full-view is
16680 -- an interface is special because the list of interfaces in the full
16681 -- view can be given in any order. For example:
16683 -- type A is interface;
16684 -- type B is interface and A;
16685 -- type D is new B with private;
16687 -- type D is new A and B with null record; -- 1 --
16689 -- In this case we perform the following transformation of -1-:
16691 -- type D is new B and A with null record;
16693 -- If the parent of the full-view covers the parent of the partial-view
16694 -- we have two possible cases:
16696 -- 1) They have the same parent
16697 -- 2) The parent of the full-view implements some further interfaces
16699 -- In both cases we do not need to perform the transformation. In the
16700 -- first case the source program is correct and the transformation is
16701 -- not needed; in the second case the source program does not fulfill
16702 -- the no-hidden interfaces rule (AI-396) and the error will be reported
16705 -- This transformation not only simplifies the rest of the analysis of
16706 -- this type declaration but also simplifies the correct generation of
16707 -- the object layout to the expander.
16709 if In_Private_Part (Current_Scope)
16710 and then Is_Interface (Parent_Type)
16714 Partial_View : Entity_Id;
16715 Partial_View_Parent : Entity_Id;
16716 New_Iface : Node_Id;
16719 -- Look for the associated private type declaration
16721 Partial_View := Incomplete_Or_Partial_View (T);
16723 -- If the partial view was not found then the source code has
16724 -- errors and the transformation is not needed.
16726 if Present (Partial_View) then
16727 Partial_View_Parent := Etype (Partial_View);
16729 -- If the parent of the full-view covers the parent of the
16730 -- partial-view we have nothing else to do.
16732 if Interface_Present_In_Ancestor
16733 (Parent_Type, Partial_View_Parent)
16737 -- Traverse the list of interfaces of the full-view to look
16738 -- for the parent of the partial-view and perform the tree
16742 Iface := First (Interface_List (Def));
16743 while Present (Iface) loop
16744 if Etype (Iface) = Etype (Partial_View) then
16745 Rewrite (Subtype_Indication (Def),
16746 New_Copy (Subtype_Indication
16747 (Parent (Partial_View))));
16750 Make_Identifier (Sloc (N), Chars (Parent_Type));
16751 Append (New_Iface, Interface_List (Def));
16753 -- Analyze the transformed code
16755 Derived_Type_Declaration (T, N, Is_Completion);
16766 -- Only composite types other than array types are allowed to have
16769 if Present (Discriminant_Specifications (N)) then
16770 if (Is_Elementary_Type (Parent_Type)
16772 Is_Array_Type (Parent_Type))
16773 and then not Error_Posted (N)
16776 ("elementary or array type cannot have discriminants",
16777 Defining_Identifier (First (Discriminant_Specifications (N))));
16779 -- Unset Has_Discriminants flag to prevent cascaded errors, but
16780 -- only if we are not already processing a malformed syntax tree.
16782 if Is_Type (T) then
16783 Set_Has_Discriminants (T, False);
16786 -- The type is allowed to have discriminants
16789 Check_SPARK_05_Restriction ("discriminant type is not allowed", N);
16793 -- In Ada 83, a derived type defined in a package specification cannot
16794 -- be used for further derivation until the end of its visible part.
16795 -- Note that derivation in the private part of the package is allowed.
16797 if Ada_Version = Ada_83
16798 and then Is_Derived_Type (Parent_Type)
16799 and then In_Visible_Part (Scope (Parent_Type))
16801 if Ada_Version = Ada_83 and then Comes_From_Source (Indic) then
16803 ("(Ada 83): premature use of type for derivation", Indic);
16807 -- Check for early use of incomplete or private type
16809 if Ekind_In (Parent_Type, E_Void, E_Incomplete_Type) then
16810 Error_Msg_N ("premature derivation of incomplete type", Indic);
16813 elsif (Is_Incomplete_Or_Private_Type (Parent_Type)
16814 and then not Comes_From_Generic (Parent_Type))
16815 or else Has_Private_Component (Parent_Type)
16817 -- The ancestor type of a formal type can be incomplete, in which
16818 -- case only the operations of the partial view are available in the
16819 -- generic. Subsequent checks may be required when the full view is
16820 -- analyzed to verify that a derivation from a tagged type has an
16823 if Nkind (Original_Node (N)) = N_Formal_Type_Declaration then
16826 elsif No (Underlying_Type (Parent_Type))
16827 or else Has_Private_Component (Parent_Type)
16830 ("premature derivation of derived or private type", Indic);
16832 -- Flag the type itself as being in error, this prevents some
16833 -- nasty problems with subsequent uses of the malformed type.
16835 Set_Error_Posted (T);
16837 -- Check that within the immediate scope of an untagged partial
16838 -- view it's illegal to derive from the partial view if the
16839 -- full view is tagged. (7.3(7))
16841 -- We verify that the Parent_Type is a partial view by checking
16842 -- that it is not a Full_Type_Declaration (i.e. a private type or
16843 -- private extension declaration), to distinguish a partial view
16844 -- from a derivation from a private type which also appears as
16845 -- E_Private_Type. If the parent base type is not declared in an
16846 -- enclosing scope there is no need to check.
16848 elsif Present (Full_View (Parent_Type))
16849 and then Nkind (Parent (Parent_Type)) /= N_Full_Type_Declaration
16850 and then not Is_Tagged_Type (Parent_Type)
16851 and then Is_Tagged_Type (Full_View (Parent_Type))
16852 and then In_Open_Scopes (Scope (Base_Type (Parent_Type)))
16855 ("premature derivation from type with tagged full view",
16860 -- Check that form of derivation is appropriate
16862 Taggd := Is_Tagged_Type (Parent_Type);
16864 -- Set the parent type to the class-wide type's specific type in this
16865 -- case to prevent cascading errors
16867 if Present (Extension) and then Is_Class_Wide_Type (Parent_Type) then
16868 Error_Msg_N ("parent type must not be a class-wide type", Indic);
16869 Set_Etype (T, Etype (Parent_Type));
16873 if Present (Extension) and then not Taggd then
16875 ("type derived from untagged type cannot have extension", Indic);
16877 elsif No (Extension) and then Taggd then
16879 -- If this declaration is within a private part (or body) of a
16880 -- generic instantiation then the derivation is allowed (the parent
16881 -- type can only appear tagged in this case if it's a generic actual
16882 -- type, since it would otherwise have been rejected in the analysis
16883 -- of the generic template).
16885 if not Is_Generic_Actual_Type (Parent_Type)
16886 or else In_Visible_Part (Scope (Parent_Type))
16888 if Is_Class_Wide_Type (Parent_Type) then
16890 ("parent type must not be a class-wide type", Indic);
16892 -- Use specific type to prevent cascaded errors.
16894 Parent_Type := Etype (Parent_Type);
16898 ("type derived from tagged type must have extension", Indic);
16903 -- AI-443: Synchronized formal derived types require a private
16904 -- extension. There is no point in checking the ancestor type or
16905 -- the progenitors since the construct is wrong to begin with.
16907 if Ada_Version >= Ada_2005
16908 and then Is_Generic_Type (T)
16909 and then Present (Original_Node (N))
16912 Decl : constant Node_Id := Original_Node (N);
16915 if Nkind (Decl) = N_Formal_Type_Declaration
16916 and then Nkind (Formal_Type_Definition (Decl)) =
16917 N_Formal_Derived_Type_Definition
16918 and then Synchronized_Present (Formal_Type_Definition (Decl))
16919 and then No (Extension)
16921 -- Avoid emitting a duplicate error message
16923 and then not Error_Posted (Indic)
16926 ("synchronized derived type must have extension", N);
16931 if Null_Exclusion_Present (Def)
16932 and then not Is_Access_Type (Parent_Type)
16934 Error_Msg_N ("null exclusion can only apply to an access type", N);
16937 -- Avoid deriving parent primitives of underlying record views
16939 Build_Derived_Type (N, Parent_Type, T, Is_Completion,
16940 Derive_Subps => not Is_Underlying_Record_View (T));
16942 -- AI-419: The parent type of an explicitly limited derived type must
16943 -- be a limited type or a limited interface.
16945 if Limited_Present (Def) then
16946 Set_Is_Limited_Record (T);
16948 if Is_Interface (T) then
16949 Set_Is_Limited_Interface (T);
16952 if not Is_Limited_Type (Parent_Type)
16954 (not Is_Interface (Parent_Type)
16955 or else not Is_Limited_Interface (Parent_Type))
16957 -- AI05-0096: a derivation in the private part of an instance is
16958 -- legal if the generic formal is untagged limited, and the actual
16961 if Is_Generic_Actual_Type (Parent_Type)
16962 and then In_Private_Part (Current_Scope)
16965 (Generic_Parent_Type (Parent (Parent_Type)))
16971 ("parent type& of limited type must be limited",
16977 -- In SPARK, there are no derived type definitions other than type
16978 -- extensions of tagged record types.
16980 if No (Extension) then
16981 Check_SPARK_05_Restriction
16982 ("derived type is not allowed", Original_Node (N));
16984 end Derived_Type_Declaration;
16986 ------------------------
16987 -- Diagnose_Interface --
16988 ------------------------
16990 procedure Diagnose_Interface (N : Node_Id; E : Entity_Id) is
16992 if not Is_Interface (E) and then E /= Any_Type then
16993 Error_Msg_NE ("(Ada 2005) & must be an interface", N, E);
16995 end Diagnose_Interface;
16997 ----------------------------------
16998 -- Enumeration_Type_Declaration --
16999 ----------------------------------
17001 procedure Enumeration_Type_Declaration (T : Entity_Id; Def : Node_Id) is
17008 -- Create identifier node representing lower bound
17010 B_Node := New_Node (N_Identifier, Sloc (Def));
17011 L := First (Literals (Def));
17012 Set_Chars (B_Node, Chars (L));
17013 Set_Entity (B_Node, L);
17014 Set_Etype (B_Node, T);
17015 Set_Is_Static_Expression (B_Node, True);
17017 R_Node := New_Node (N_Range, Sloc (Def));
17018 Set_Low_Bound (R_Node, B_Node);
17020 Set_Ekind (T, E_Enumeration_Type);
17021 Set_First_Literal (T, L);
17023 Set_Is_Constrained (T);
17027 -- Loop through literals of enumeration type setting pos and rep values
17028 -- except that if the Ekind is already set, then it means the literal
17029 -- was already constructed (case of a derived type declaration and we
17030 -- should not disturb the Pos and Rep values.
17032 while Present (L) loop
17033 if Ekind (L) /= E_Enumeration_Literal then
17034 Set_Ekind (L, E_Enumeration_Literal);
17035 Set_Enumeration_Pos (L, Ev);
17036 Set_Enumeration_Rep (L, Ev);
17037 Set_Is_Known_Valid (L, True);
17041 New_Overloaded_Entity (L);
17042 Generate_Definition (L);
17043 Set_Convention (L, Convention_Intrinsic);
17045 -- Case of character literal
17047 if Nkind (L) = N_Defining_Character_Literal then
17048 Set_Is_Character_Type (T, True);
17050 -- Check violation of No_Wide_Characters
17052 if Restriction_Check_Required (No_Wide_Characters) then
17053 Get_Name_String (Chars (L));
17055 if Name_Len >= 3 and then Name_Buffer (1 .. 2) = "QW" then
17056 Check_Restriction (No_Wide_Characters, L);
17065 -- Now create a node representing upper bound
17067 B_Node := New_Node (N_Identifier, Sloc (Def));
17068 Set_Chars (B_Node, Chars (Last (Literals (Def))));
17069 Set_Entity (B_Node, Last (Literals (Def)));
17070 Set_Etype (B_Node, T);
17071 Set_Is_Static_Expression (B_Node, True);
17073 Set_High_Bound (R_Node, B_Node);
17075 -- Initialize various fields of the type. Some of this information
17076 -- may be overwritten later through rep.clauses.
17078 Set_Scalar_Range (T, R_Node);
17079 Set_RM_Size (T, UI_From_Int (Minimum_Size (T)));
17080 Set_Enum_Esize (T);
17081 Set_Enum_Pos_To_Rep (T, Empty);
17083 -- Set Discard_Names if configuration pragma set, or if there is
17084 -- a parameterless pragma in the current declarative region
17086 if Global_Discard_Names or else Discard_Names (Scope (T)) then
17087 Set_Discard_Names (T);
17090 -- Process end label if there is one
17092 if Present (Def) then
17093 Process_End_Label (Def, 'e', T);
17095 end Enumeration_Type_Declaration;
17097 ---------------------------------
17098 -- Expand_To_Stored_Constraint --
17099 ---------------------------------
17101 function Expand_To_Stored_Constraint
17103 Constraint : Elist_Id) return Elist_Id
17105 Explicitly_Discriminated_Type : Entity_Id;
17106 Expansion : Elist_Id;
17107 Discriminant : Entity_Id;
17109 function Type_With_Explicit_Discrims (Id : Entity_Id) return Entity_Id;
17110 -- Find the nearest type that actually specifies discriminants
17112 ---------------------------------
17113 -- Type_With_Explicit_Discrims --
17114 ---------------------------------
17116 function Type_With_Explicit_Discrims (Id : Entity_Id) return Entity_Id is
17117 Typ : constant E := Base_Type (Id);
17120 if Ekind (Typ) in Incomplete_Or_Private_Kind then
17121 if Present (Full_View (Typ)) then
17122 return Type_With_Explicit_Discrims (Full_View (Typ));
17126 if Has_Discriminants (Typ) then
17131 if Etype (Typ) = Typ then
17133 elsif Has_Discriminants (Typ) then
17136 return Type_With_Explicit_Discrims (Etype (Typ));
17139 end Type_With_Explicit_Discrims;
17141 -- Start of processing for Expand_To_Stored_Constraint
17144 if No (Constraint) or else Is_Empty_Elmt_List (Constraint) then
17148 Explicitly_Discriminated_Type := Type_With_Explicit_Discrims (Typ);
17150 if No (Explicitly_Discriminated_Type) then
17154 Expansion := New_Elmt_List;
17157 First_Stored_Discriminant (Explicitly_Discriminated_Type);
17158 while Present (Discriminant) loop
17160 (Get_Discriminant_Value
17161 (Discriminant, Explicitly_Discriminated_Type, Constraint),
17163 Next_Stored_Discriminant (Discriminant);
17167 end Expand_To_Stored_Constraint;
17169 ---------------------------
17170 -- Find_Hidden_Interface --
17171 ---------------------------
17173 function Find_Hidden_Interface
17175 Dest : Elist_Id) return Entity_Id
17178 Iface_Elmt : Elmt_Id;
17181 if Present (Src) and then Present (Dest) then
17182 Iface_Elmt := First_Elmt (Src);
17183 while Present (Iface_Elmt) loop
17184 Iface := Node (Iface_Elmt);
17186 if Is_Interface (Iface)
17187 and then not Contain_Interface (Iface, Dest)
17192 Next_Elmt (Iface_Elmt);
17197 end Find_Hidden_Interface;
17199 --------------------
17200 -- Find_Type_Name --
17201 --------------------
17203 function Find_Type_Name (N : Node_Id) return Entity_Id is
17204 Id : constant Entity_Id := Defining_Identifier (N);
17205 New_Id : Entity_Id;
17207 Prev_Par : Node_Id;
17209 procedure Check_Duplicate_Aspects;
17210 -- Check that aspects specified in a completion have not been specified
17211 -- already in the partial view.
17213 procedure Tag_Mismatch;
17214 -- Diagnose a tagged partial view whose full view is untagged. We post
17215 -- the message on the full view, with a reference to the previous
17216 -- partial view. The partial view can be private or incomplete, and
17217 -- these are handled in a different manner, so we determine the position
17218 -- of the error message from the respective slocs of both.
17220 -----------------------------
17221 -- Check_Duplicate_Aspects --
17222 -----------------------------
17224 procedure Check_Duplicate_Aspects is
17225 function Get_Partial_View_Aspect (Asp : Node_Id) return Node_Id;
17226 -- Return the corresponding aspect of the partial view which matches
17227 -- the aspect id of Asp. Return Empty is no such aspect exists.
17229 -----------------------------
17230 -- Get_Partial_View_Aspect --
17231 -----------------------------
17233 function Get_Partial_View_Aspect (Asp : Node_Id) return Node_Id is
17234 Asp_Id : constant Aspect_Id := Get_Aspect_Id (Asp);
17235 Prev_Asps : constant List_Id := Aspect_Specifications (Prev_Par);
17236 Prev_Asp : Node_Id;
17239 if Present (Prev_Asps) then
17240 Prev_Asp := First (Prev_Asps);
17241 while Present (Prev_Asp) loop
17242 if Get_Aspect_Id (Prev_Asp) = Asp_Id then
17251 end Get_Partial_View_Aspect;
17255 Full_Asps : constant List_Id := Aspect_Specifications (N);
17256 Full_Asp : Node_Id;
17257 Part_Asp : Node_Id;
17259 -- Start of processing for Check_Duplicate_Aspects
17262 if Present (Full_Asps) then
17263 Full_Asp := First (Full_Asps);
17264 while Present (Full_Asp) loop
17265 Part_Asp := Get_Partial_View_Aspect (Full_Asp);
17267 -- An aspect and its class-wide counterpart are two distinct
17268 -- aspects and may apply to both views of an entity.
17270 if Present (Part_Asp)
17271 and then Class_Present (Part_Asp) = Class_Present (Full_Asp)
17274 ("aspect already specified in private declaration",
17281 if Has_Discriminants (Prev)
17282 and then not Has_Unknown_Discriminants (Prev)
17283 and then Get_Aspect_Id (Full_Asp) =
17284 Aspect_Implicit_Dereference
17287 ("cannot specify aspect if partial view has known "
17288 & "discriminants", Full_Asp);
17294 end Check_Duplicate_Aspects;
17300 procedure Tag_Mismatch is
17302 if Sloc (Prev) < Sloc (Id) then
17303 if Ada_Version >= Ada_2012
17304 and then Nkind (N) = N_Private_Type_Declaration
17307 ("declaration of private } must be a tagged type ", Id, Prev);
17310 ("full declaration of } must be a tagged type ", Id, Prev);
17314 if Ada_Version >= Ada_2012
17315 and then Nkind (N) = N_Private_Type_Declaration
17318 ("declaration of private } must be a tagged type ", Prev, Id);
17321 ("full declaration of } must be a tagged type ", Prev, Id);
17326 -- Start of processing for Find_Type_Name
17329 -- Find incomplete declaration, if one was given
17331 Prev := Current_Entity_In_Scope (Id);
17333 -- New type declaration
17339 -- Previous declaration exists
17342 Prev_Par := Parent (Prev);
17344 -- Error if not incomplete/private case except if previous
17345 -- declaration is implicit, etc. Enter_Name will emit error if
17348 if not Is_Incomplete_Or_Private_Type (Prev) then
17352 -- Check invalid completion of private or incomplete type
17354 elsif not Nkind_In (N, N_Full_Type_Declaration,
17355 N_Task_Type_Declaration,
17356 N_Protected_Type_Declaration)
17358 (Ada_Version < Ada_2012
17359 or else not Is_Incomplete_Type (Prev)
17360 or else not Nkind_In (N, N_Private_Type_Declaration,
17361 N_Private_Extension_Declaration))
17363 -- Completion must be a full type declarations (RM 7.3(4))
17365 Error_Msg_Sloc := Sloc (Prev);
17366 Error_Msg_NE ("invalid completion of }", Id, Prev);
17368 -- Set scope of Id to avoid cascaded errors. Entity is never
17369 -- examined again, except when saving globals in generics.
17371 Set_Scope (Id, Current_Scope);
17374 -- If this is a repeated incomplete declaration, no further
17375 -- checks are possible.
17377 if Nkind (N) = N_Incomplete_Type_Declaration then
17381 -- Case of full declaration of incomplete type
17383 elsif Ekind (Prev) = E_Incomplete_Type
17384 and then (Ada_Version < Ada_2012
17385 or else No (Full_View (Prev))
17386 or else not Is_Private_Type (Full_View (Prev)))
17388 -- Indicate that the incomplete declaration has a matching full
17389 -- declaration. The defining occurrence of the incomplete
17390 -- declaration remains the visible one, and the procedure
17391 -- Get_Full_View dereferences it whenever the type is used.
17393 if Present (Full_View (Prev)) then
17394 Error_Msg_NE ("invalid redeclaration of }", Id, Prev);
17397 Set_Full_View (Prev, Id);
17398 Append_Entity (Id, Current_Scope);
17399 Set_Is_Public (Id, Is_Public (Prev));
17400 Set_Is_Internal (Id);
17403 -- If the incomplete view is tagged, a class_wide type has been
17404 -- created already. Use it for the private type as well, in order
17405 -- to prevent multiple incompatible class-wide types that may be
17406 -- created for self-referential anonymous access components.
17408 if Is_Tagged_Type (Prev)
17409 and then Present (Class_Wide_Type (Prev))
17411 Set_Ekind (Id, Ekind (Prev)); -- will be reset later
17412 Set_Class_Wide_Type (Id, Class_Wide_Type (Prev));
17414 -- Type of the class-wide type is the current Id. Previously
17415 -- this was not done for private declarations because of order-
17416 -- of-elaboration issues in the back end, but gigi now handles
17419 Set_Etype (Class_Wide_Type (Id), Id);
17422 -- Case of full declaration of private type
17425 -- If the private type was a completion of an incomplete type then
17426 -- update Prev to reference the private type
17428 if Ada_Version >= Ada_2012
17429 and then Ekind (Prev) = E_Incomplete_Type
17430 and then Present (Full_View (Prev))
17431 and then Is_Private_Type (Full_View (Prev))
17433 Prev := Full_View (Prev);
17434 Prev_Par := Parent (Prev);
17437 if Nkind (N) = N_Full_Type_Declaration
17439 (Type_Definition (N), N_Record_Definition,
17440 N_Derived_Type_Definition)
17441 and then Interface_Present (Type_Definition (N))
17444 ("completion of private type cannot be an interface", N);
17447 if Nkind (Parent (Prev)) /= N_Private_Extension_Declaration then
17448 if Etype (Prev) /= Prev then
17450 -- Prev is a private subtype or a derived type, and needs
17453 Error_Msg_NE ("invalid redeclaration of }", Id, Prev);
17456 elsif Ekind (Prev) = E_Private_Type
17457 and then Nkind_In (N, N_Task_Type_Declaration,
17458 N_Protected_Type_Declaration)
17461 ("completion of nonlimited type cannot be limited", N);
17463 elsif Ekind (Prev) = E_Record_Type_With_Private
17464 and then Nkind_In (N, N_Task_Type_Declaration,
17465 N_Protected_Type_Declaration)
17467 if not Is_Limited_Record (Prev) then
17469 ("completion of nonlimited type cannot be limited", N);
17471 elsif No (Interface_List (N)) then
17473 ("completion of tagged private type must be tagged",
17478 -- Ada 2005 (AI-251): Private extension declaration of a task
17479 -- type or a protected type. This case arises when covering
17480 -- interface types.
17482 elsif Nkind_In (N, N_Task_Type_Declaration,
17483 N_Protected_Type_Declaration)
17487 elsif Nkind (N) /= N_Full_Type_Declaration
17488 or else Nkind (Type_Definition (N)) /= N_Derived_Type_Definition
17491 ("full view of private extension must be an extension", N);
17493 elsif not (Abstract_Present (Parent (Prev)))
17494 and then Abstract_Present (Type_Definition (N))
17497 ("full view of non-abstract extension cannot be abstract", N);
17500 if not In_Private_Part (Current_Scope) then
17502 ("declaration of full view must appear in private part", N);
17505 if Ada_Version >= Ada_2012 then
17506 Check_Duplicate_Aspects;
17509 Copy_And_Swap (Prev, Id);
17510 Set_Has_Private_Declaration (Prev);
17511 Set_Has_Private_Declaration (Id);
17513 -- AI12-0133: Indicate whether we have a partial view with
17514 -- unknown discriminants, in which case initialization of objects
17515 -- of the type do not receive an invariant check.
17517 Set_Partial_View_Has_Unknown_Discr
17518 (Prev, Has_Unknown_Discriminants (Id));
17520 -- Preserve aspect and iterator flags that may have been set on
17521 -- the partial view.
17523 Set_Has_Delayed_Aspects (Prev, Has_Delayed_Aspects (Id));
17524 Set_Has_Implicit_Dereference (Prev, Has_Implicit_Dereference (Id));
17526 -- If no error, propagate freeze_node from private to full view.
17527 -- It may have been generated for an early operational item.
17529 if Present (Freeze_Node (Id))
17530 and then Serious_Errors_Detected = 0
17531 and then No (Full_View (Id))
17533 Set_Freeze_Node (Prev, Freeze_Node (Id));
17534 Set_Freeze_Node (Id, Empty);
17535 Set_First_Rep_Item (Prev, First_Rep_Item (Id));
17538 Set_Full_View (Id, Prev);
17542 -- Verify that full declaration conforms to partial one
17544 if Is_Incomplete_Or_Private_Type (Prev)
17545 and then Present (Discriminant_Specifications (Prev_Par))
17547 if Present (Discriminant_Specifications (N)) then
17548 if Ekind (Prev) = E_Incomplete_Type then
17549 Check_Discriminant_Conformance (N, Prev, Prev);
17551 Check_Discriminant_Conformance (N, Prev, Id);
17556 ("missing discriminants in full type declaration", N);
17558 -- To avoid cascaded errors on subsequent use, share the
17559 -- discriminants of the partial view.
17561 Set_Discriminant_Specifications (N,
17562 Discriminant_Specifications (Prev_Par));
17566 -- A prior untagged partial view can have an associated class-wide
17567 -- type due to use of the class attribute, and in this case the full
17568 -- type must also be tagged. This Ada 95 usage is deprecated in favor
17569 -- of incomplete tagged declarations, but we check for it.
17572 and then (Is_Tagged_Type (Prev)
17573 or else Present (Class_Wide_Type (Prev)))
17575 -- Ada 2012 (AI05-0162): A private type may be the completion of
17576 -- an incomplete type.
17578 if Ada_Version >= Ada_2012
17579 and then Is_Incomplete_Type (Prev)
17580 and then Nkind_In (N, N_Private_Type_Declaration,
17581 N_Private_Extension_Declaration)
17583 -- No need to check private extensions since they are tagged
17585 if Nkind (N) = N_Private_Type_Declaration
17586 and then not Tagged_Present (N)
17591 -- The full declaration is either a tagged type (including
17592 -- a synchronized type that implements interfaces) or a
17593 -- type extension, otherwise this is an error.
17595 elsif Nkind_In (N, N_Task_Type_Declaration,
17596 N_Protected_Type_Declaration)
17598 if No (Interface_List (N)) and then not Error_Posted (N) then
17602 elsif Nkind (Type_Definition (N)) = N_Record_Definition then
17604 -- Indicate that the previous declaration (tagged incomplete
17605 -- or private declaration) requires the same on the full one.
17607 if not Tagged_Present (Type_Definition (N)) then
17609 Set_Is_Tagged_Type (Id);
17612 elsif Nkind (Type_Definition (N)) = N_Derived_Type_Definition then
17613 if No (Record_Extension_Part (Type_Definition (N))) then
17615 ("full declaration of } must be a record extension",
17618 -- Set some attributes to produce a usable full view
17620 Set_Is_Tagged_Type (Id);
17629 and then Nkind (Parent (Prev)) = N_Incomplete_Type_Declaration
17630 and then Present (Premature_Use (Parent (Prev)))
17632 Error_Msg_Sloc := Sloc (N);
17634 ("\full declaration #", Premature_Use (Parent (Prev)));
17639 end Find_Type_Name;
17641 -------------------------
17642 -- Find_Type_Of_Object --
17643 -------------------------
17645 function Find_Type_Of_Object
17646 (Obj_Def : Node_Id;
17647 Related_Nod : Node_Id) return Entity_Id
17649 Def_Kind : constant Node_Kind := Nkind (Obj_Def);
17650 P : Node_Id := Parent (Obj_Def);
17655 -- If the parent is a component_definition node we climb to the
17656 -- component_declaration node
17658 if Nkind (P) = N_Component_Definition then
17662 -- Case of an anonymous array subtype
17664 if Nkind_In (Def_Kind, N_Constrained_Array_Definition,
17665 N_Unconstrained_Array_Definition)
17668 Array_Type_Declaration (T, Obj_Def);
17670 -- Create an explicit subtype whenever possible
17672 elsif Nkind (P) /= N_Component_Declaration
17673 and then Def_Kind = N_Subtype_Indication
17675 -- Base name of subtype on object name, which will be unique in
17676 -- the current scope.
17678 -- If this is a duplicate declaration, return base type, to avoid
17679 -- generating duplicate anonymous types.
17681 if Error_Posted (P) then
17682 Analyze (Subtype_Mark (Obj_Def));
17683 return Entity (Subtype_Mark (Obj_Def));
17688 (Chars (Defining_Identifier (Related_Nod)), 'S', 0, 'T');
17690 T := Make_Defining_Identifier (Sloc (P), Nam);
17692 Insert_Action (Obj_Def,
17693 Make_Subtype_Declaration (Sloc (P),
17694 Defining_Identifier => T,
17695 Subtype_Indication => Relocate_Node (Obj_Def)));
17697 -- This subtype may need freezing, and this will not be done
17698 -- automatically if the object declaration is not in declarative
17699 -- part. Since this is an object declaration, the type cannot always
17700 -- be frozen here. Deferred constants do not freeze their type
17701 -- (which often enough will be private).
17703 if Nkind (P) = N_Object_Declaration
17704 and then Constant_Present (P)
17705 and then No (Expression (P))
17709 -- Here we freeze the base type of object type to catch premature use
17710 -- of discriminated private type without a full view.
17713 Insert_Actions (Obj_Def, Freeze_Entity (Base_Type (T), P));
17716 -- Ada 2005 AI-406: the object definition in an object declaration
17717 -- can be an access definition.
17719 elsif Def_Kind = N_Access_Definition then
17720 T := Access_Definition (Related_Nod, Obj_Def);
17722 Set_Is_Local_Anonymous_Access
17724 V => (Ada_Version < Ada_2012)
17725 or else (Nkind (P) /= N_Object_Declaration)
17726 or else Is_Library_Level_Entity (Defining_Identifier (P)));
17728 -- Otherwise, the object definition is just a subtype_mark
17731 T := Process_Subtype (Obj_Def, Related_Nod);
17733 -- If expansion is disabled an object definition that is an aggregate
17734 -- will not get expanded and may lead to scoping problems in the back
17735 -- end, if the object is referenced in an inner scope. In that case
17736 -- create an itype reference for the object definition now. This
17737 -- may be redundant in some cases, but harmless.
17740 and then Nkind (Related_Nod) = N_Object_Declaration
17743 Build_Itype_Reference (T, Related_Nod);
17748 end Find_Type_Of_Object;
17750 --------------------------------
17751 -- Find_Type_Of_Subtype_Indic --
17752 --------------------------------
17754 function Find_Type_Of_Subtype_Indic (S : Node_Id) return Entity_Id is
17758 -- Case of subtype mark with a constraint
17760 if Nkind (S) = N_Subtype_Indication then
17761 Find_Type (Subtype_Mark (S));
17762 Typ := Entity (Subtype_Mark (S));
17765 Is_Valid_Constraint_Kind (Ekind (Typ), Nkind (Constraint (S)))
17768 ("incorrect constraint for this kind of type", Constraint (S));
17769 Rewrite (S, New_Copy_Tree (Subtype_Mark (S)));
17772 -- Otherwise we have a subtype mark without a constraint
17774 elsif Error_Posted (S) then
17775 Rewrite (S, New_Occurrence_Of (Any_Id, Sloc (S)));
17783 -- Check No_Wide_Characters restriction
17785 Check_Wide_Character_Restriction (Typ, S);
17788 end Find_Type_Of_Subtype_Indic;
17790 -------------------------------------
17791 -- Floating_Point_Type_Declaration --
17792 -------------------------------------
17794 procedure Floating_Point_Type_Declaration (T : Entity_Id; Def : Node_Id) is
17795 Digs : constant Node_Id := Digits_Expression (Def);
17796 Max_Digs_Val : constant Uint := Digits_Value (Standard_Long_Long_Float);
17798 Base_Typ : Entity_Id;
17799 Implicit_Base : Entity_Id;
17802 function Can_Derive_From (E : Entity_Id) return Boolean;
17803 -- Find if given digits value, and possibly a specified range, allows
17804 -- derivation from specified type
17806 function Find_Base_Type return Entity_Id;
17807 -- Find a predefined base type that Def can derive from, or generate
17808 -- an error and substitute Long_Long_Float if none exists.
17810 ---------------------
17811 -- Can_Derive_From --
17812 ---------------------
17814 function Can_Derive_From (E : Entity_Id) return Boolean is
17815 Spec : constant Entity_Id := Real_Range_Specification (Def);
17818 -- Check specified "digits" constraint
17820 if Digs_Val > Digits_Value (E) then
17824 -- Check for matching range, if specified
17826 if Present (Spec) then
17827 if Expr_Value_R (Type_Low_Bound (E)) >
17828 Expr_Value_R (Low_Bound (Spec))
17833 if Expr_Value_R (Type_High_Bound (E)) <
17834 Expr_Value_R (High_Bound (Spec))
17841 end Can_Derive_From;
17843 --------------------
17844 -- Find_Base_Type --
17845 --------------------
17847 function Find_Base_Type return Entity_Id is
17848 Choice : Elmt_Id := First_Elmt (Predefined_Float_Types);
17851 -- Iterate over the predefined types in order, returning the first
17852 -- one that Def can derive from.
17854 while Present (Choice) loop
17855 if Can_Derive_From (Node (Choice)) then
17856 return Node (Choice);
17859 Next_Elmt (Choice);
17862 -- If we can't derive from any existing type, use Long_Long_Float
17863 -- and give appropriate message explaining the problem.
17865 if Digs_Val > Max_Digs_Val then
17866 -- It might be the case that there is a type with the requested
17867 -- range, just not the combination of digits and range.
17870 ("no predefined type has requested range and precision",
17871 Real_Range_Specification (Def));
17875 ("range too large for any predefined type",
17876 Real_Range_Specification (Def));
17879 return Standard_Long_Long_Float;
17880 end Find_Base_Type;
17882 -- Start of processing for Floating_Point_Type_Declaration
17885 Check_Restriction (No_Floating_Point, Def);
17887 -- Create an implicit base type
17890 Create_Itype (E_Floating_Point_Type, Parent (Def), T, 'B');
17892 -- Analyze and verify digits value
17894 Analyze_And_Resolve (Digs, Any_Integer);
17895 Check_Digits_Expression (Digs);
17896 Digs_Val := Expr_Value (Digs);
17898 -- Process possible range spec and find correct type to derive from
17900 Process_Real_Range_Specification (Def);
17902 -- Check that requested number of digits is not too high.
17904 if Digs_Val > Max_Digs_Val then
17906 -- The check for Max_Base_Digits may be somewhat expensive, as it
17907 -- requires reading System, so only do it when necessary.
17910 Max_Base_Digits : constant Uint :=
17913 (Parent (RTE (RE_Max_Base_Digits))));
17916 if Digs_Val > Max_Base_Digits then
17917 Error_Msg_Uint_1 := Max_Base_Digits;
17918 Error_Msg_N ("digits value out of range, maximum is ^", Digs);
17920 elsif No (Real_Range_Specification (Def)) then
17921 Error_Msg_Uint_1 := Max_Digs_Val;
17922 Error_Msg_N ("types with more than ^ digits need range spec "
17923 & "(RM 3.5.7(6))", Digs);
17928 -- Find a suitable type to derive from or complain and use a substitute
17930 Base_Typ := Find_Base_Type;
17932 -- If there are bounds given in the declaration use them as the bounds
17933 -- of the type, otherwise use the bounds of the predefined base type
17934 -- that was chosen based on the Digits value.
17936 if Present (Real_Range_Specification (Def)) then
17937 Set_Scalar_Range (T, Real_Range_Specification (Def));
17938 Set_Is_Constrained (T);
17940 -- The bounds of this range must be converted to machine numbers
17941 -- in accordance with RM 4.9(38).
17943 Bound := Type_Low_Bound (T);
17945 if Nkind (Bound) = N_Real_Literal then
17947 (Bound, Machine (Base_Typ, Realval (Bound), Round, Bound));
17948 Set_Is_Machine_Number (Bound);
17951 Bound := Type_High_Bound (T);
17953 if Nkind (Bound) = N_Real_Literal then
17955 (Bound, Machine (Base_Typ, Realval (Bound), Round, Bound));
17956 Set_Is_Machine_Number (Bound);
17960 Set_Scalar_Range (T, Scalar_Range (Base_Typ));
17963 -- Complete definition of implicit base and declared first subtype. The
17964 -- inheritance of the rep item chain ensures that SPARK-related pragmas
17965 -- are not clobbered when the floating point type acts as a full view of
17968 Set_Etype (Implicit_Base, Base_Typ);
17969 Set_Scalar_Range (Implicit_Base, Scalar_Range (Base_Typ));
17970 Set_Size_Info (Implicit_Base, Base_Typ);
17971 Set_RM_Size (Implicit_Base, RM_Size (Base_Typ));
17972 Set_First_Rep_Item (Implicit_Base, First_Rep_Item (Base_Typ));
17973 Set_Digits_Value (Implicit_Base, Digits_Value (Base_Typ));
17974 Set_Float_Rep (Implicit_Base, Float_Rep (Base_Typ));
17976 Set_Ekind (T, E_Floating_Point_Subtype);
17977 Set_Etype (T, Implicit_Base);
17978 Set_Size_Info (T, Implicit_Base);
17979 Set_RM_Size (T, RM_Size (Implicit_Base));
17980 Inherit_Rep_Item_Chain (T, Implicit_Base);
17981 Set_Digits_Value (T, Digs_Val);
17982 end Floating_Point_Type_Declaration;
17984 ----------------------------
17985 -- Get_Discriminant_Value --
17986 ----------------------------
17988 -- This is the situation:
17990 -- There is a non-derived type
17992 -- type T0 (Dx, Dy, Dz...)
17994 -- There are zero or more levels of derivation, with each derivation
17995 -- either purely inheriting the discriminants, or defining its own.
17997 -- type Ti is new Ti-1
17999 -- type Ti (Dw) is new Ti-1(Dw, 1, X+Y)
18001 -- subtype Ti is ...
18003 -- The subtype issue is avoided by the use of Original_Record_Component,
18004 -- and the fact that derived subtypes also derive the constraints.
18006 -- This chain leads back from
18008 -- Typ_For_Constraint
18010 -- Typ_For_Constraint has discriminants, and the value for each
18011 -- discriminant is given by its corresponding Elmt of Constraints.
18013 -- Discriminant is some discriminant in this hierarchy
18015 -- We need to return its value
18017 -- We do this by recursively searching each level, and looking for
18018 -- Discriminant. Once we get to the bottom, we start backing up
18019 -- returning the value for it which may in turn be a discriminant
18020 -- further up, so on the backup we continue the substitution.
18022 function Get_Discriminant_Value
18023 (Discriminant : Entity_Id;
18024 Typ_For_Constraint : Entity_Id;
18025 Constraint : Elist_Id) return Node_Id
18027 function Root_Corresponding_Discriminant
18028 (Discr : Entity_Id) return Entity_Id;
18029 -- Given a discriminant, traverse the chain of inherited discriminants
18030 -- and return the topmost discriminant.
18032 function Search_Derivation_Levels
18034 Discrim_Values : Elist_Id;
18035 Stored_Discrim_Values : Boolean) return Node_Or_Entity_Id;
18036 -- This is the routine that performs the recursive search of levels
18037 -- as described above.
18039 -------------------------------------
18040 -- Root_Corresponding_Discriminant --
18041 -------------------------------------
18043 function Root_Corresponding_Discriminant
18044 (Discr : Entity_Id) return Entity_Id
18050 while Present (Corresponding_Discriminant (D)) loop
18051 D := Corresponding_Discriminant (D);
18055 end Root_Corresponding_Discriminant;
18057 ------------------------------
18058 -- Search_Derivation_Levels --
18059 ------------------------------
18061 function Search_Derivation_Levels
18063 Discrim_Values : Elist_Id;
18064 Stored_Discrim_Values : Boolean) return Node_Or_Entity_Id
18068 Result : Node_Or_Entity_Id;
18069 Result_Entity : Node_Id;
18072 -- If inappropriate type, return Error, this happens only in
18073 -- cascaded error situations, and we want to avoid a blow up.
18075 if not Is_Composite_Type (Ti) or else Is_Array_Type (Ti) then
18079 -- Look deeper if possible. Use Stored_Constraints only for
18080 -- untagged types. For tagged types use the given constraint.
18081 -- This asymmetry needs explanation???
18083 if not Stored_Discrim_Values
18084 and then Present (Stored_Constraint (Ti))
18085 and then not Is_Tagged_Type (Ti)
18088 Search_Derivation_Levels (Ti, Stored_Constraint (Ti), True);
18092 Td : Entity_Id := Etype (Ti);
18095 -- If the parent type is private, the full view may include
18096 -- renamed discriminants, and it is those stored values that
18097 -- may be needed (the partial view never has more information
18098 -- than the full view).
18100 if Is_Private_Type (Td) and then Present (Full_View (Td)) then
18101 Td := Full_View (Td);
18105 Result := Discriminant;
18108 if Present (Stored_Constraint (Ti)) then
18110 Search_Derivation_Levels
18111 (Td, Stored_Constraint (Ti), True);
18114 Search_Derivation_Levels
18115 (Td, Discrim_Values, Stored_Discrim_Values);
18121 -- Extra underlying places to search, if not found above. For
18122 -- concurrent types, the relevant discriminant appears in the
18123 -- corresponding record. For a type derived from a private type
18124 -- without discriminant, the full view inherits the discriminants
18125 -- of the full view of the parent.
18127 if Result = Discriminant then
18128 if Is_Concurrent_Type (Ti)
18129 and then Present (Corresponding_Record_Type (Ti))
18132 Search_Derivation_Levels (
18133 Corresponding_Record_Type (Ti),
18135 Stored_Discrim_Values);
18137 elsif Is_Private_Type (Ti)
18138 and then not Has_Discriminants (Ti)
18139 and then Present (Full_View (Ti))
18140 and then Etype (Full_View (Ti)) /= Ti
18143 Search_Derivation_Levels (
18146 Stored_Discrim_Values);
18150 -- If Result is not a (reference to a) discriminant, return it,
18151 -- otherwise set Result_Entity to the discriminant.
18153 if Nkind (Result) = N_Defining_Identifier then
18154 pragma Assert (Result = Discriminant);
18155 Result_Entity := Result;
18158 if not Denotes_Discriminant (Result) then
18162 Result_Entity := Entity (Result);
18165 -- See if this level of derivation actually has discriminants because
18166 -- tagged derivations can add them, hence the lower levels need not
18169 if not Has_Discriminants (Ti) then
18173 -- Scan Ti's discriminants for Result_Entity, and return its
18174 -- corresponding value, if any.
18176 Result_Entity := Original_Record_Component (Result_Entity);
18178 Assoc := First_Elmt (Discrim_Values);
18180 if Stored_Discrim_Values then
18181 Disc := First_Stored_Discriminant (Ti);
18183 Disc := First_Discriminant (Ti);
18186 while Present (Disc) loop
18188 -- If no further associations return the discriminant, value will
18189 -- be found on the second pass.
18195 if Original_Record_Component (Disc) = Result_Entity then
18196 return Node (Assoc);
18201 if Stored_Discrim_Values then
18202 Next_Stored_Discriminant (Disc);
18204 Next_Discriminant (Disc);
18208 -- Could not find it
18211 end Search_Derivation_Levels;
18215 Result : Node_Or_Entity_Id;
18217 -- Start of processing for Get_Discriminant_Value
18220 -- ??? This routine is a gigantic mess and will be deleted. For the
18221 -- time being just test for the trivial case before calling recurse.
18223 -- We are now celebrating the 20th anniversary of this comment!
18225 if Base_Type (Scope (Discriminant)) = Base_Type (Typ_For_Constraint) then
18231 D := First_Discriminant (Typ_For_Constraint);
18232 E := First_Elmt (Constraint);
18233 while Present (D) loop
18234 if Chars (D) = Chars (Discriminant) then
18238 Next_Discriminant (D);
18244 Result := Search_Derivation_Levels
18245 (Typ_For_Constraint, Constraint, False);
18247 -- ??? hack to disappear when this routine is gone
18249 if Nkind (Result) = N_Defining_Identifier then
18255 D := First_Discriminant (Typ_For_Constraint);
18256 E := First_Elmt (Constraint);
18257 while Present (D) loop
18258 if Root_Corresponding_Discriminant (D) = Discriminant then
18262 Next_Discriminant (D);
18268 pragma Assert (Nkind (Result) /= N_Defining_Identifier);
18270 end Get_Discriminant_Value;
18272 --------------------------
18273 -- Has_Range_Constraint --
18274 --------------------------
18276 function Has_Range_Constraint (N : Node_Id) return Boolean is
18277 C : constant Node_Id := Constraint (N);
18280 if Nkind (C) = N_Range_Constraint then
18283 elsif Nkind (C) = N_Digits_Constraint then
18285 Is_Decimal_Fixed_Point_Type (Entity (Subtype_Mark (N)))
18286 or else Present (Range_Constraint (C));
18288 elsif Nkind (C) = N_Delta_Constraint then
18289 return Present (Range_Constraint (C));
18294 end Has_Range_Constraint;
18296 ------------------------
18297 -- Inherit_Components --
18298 ------------------------
18300 function Inherit_Components
18302 Parent_Base : Entity_Id;
18303 Derived_Base : Entity_Id;
18304 Is_Tagged : Boolean;
18305 Inherit_Discr : Boolean;
18306 Discs : Elist_Id) return Elist_Id
18308 Assoc_List : constant Elist_Id := New_Elmt_List;
18310 procedure Inherit_Component
18311 (Old_C : Entity_Id;
18312 Plain_Discrim : Boolean := False;
18313 Stored_Discrim : Boolean := False);
18314 -- Inherits component Old_C from Parent_Base to the Derived_Base. If
18315 -- Plain_Discrim is True, Old_C is a discriminant. If Stored_Discrim is
18316 -- True, Old_C is a stored discriminant. If they are both false then
18317 -- Old_C is a regular component.
18319 -----------------------
18320 -- Inherit_Component --
18321 -----------------------
18323 procedure Inherit_Component
18324 (Old_C : Entity_Id;
18325 Plain_Discrim : Boolean := False;
18326 Stored_Discrim : Boolean := False)
18328 procedure Set_Anonymous_Type (Id : Entity_Id);
18329 -- Id denotes the entity of an access discriminant or anonymous
18330 -- access component. Set the type of Id to either the same type of
18331 -- Old_C or create a new one depending on whether the parent and
18332 -- the child types are in the same scope.
18334 ------------------------
18335 -- Set_Anonymous_Type --
18336 ------------------------
18338 procedure Set_Anonymous_Type (Id : Entity_Id) is
18339 Old_Typ : constant Entity_Id := Etype (Old_C);
18342 if Scope (Parent_Base) = Scope (Derived_Base) then
18343 Set_Etype (Id, Old_Typ);
18345 -- The parent and the derived type are in two different scopes.
18346 -- Reuse the type of the original discriminant / component by
18347 -- copying it in order to preserve all attributes.
18351 Typ : constant Entity_Id := New_Copy (Old_Typ);
18354 Set_Etype (Id, Typ);
18356 -- Since we do not generate component declarations for
18357 -- inherited components, associate the itype with the
18360 Set_Associated_Node_For_Itype (Typ, Parent (Derived_Base));
18361 Set_Scope (Typ, Derived_Base);
18364 end Set_Anonymous_Type;
18366 -- Local variables and constants
18368 New_C : constant Entity_Id := New_Copy (Old_C);
18370 Corr_Discrim : Entity_Id;
18371 Discrim : Entity_Id;
18373 -- Start of processing for Inherit_Component
18376 pragma Assert (not Is_Tagged or not Stored_Discrim);
18378 Set_Parent (New_C, Parent (Old_C));
18380 -- Regular discriminants and components must be inserted in the scope
18381 -- of the Derived_Base. Do it here.
18383 if not Stored_Discrim then
18384 Enter_Name (New_C);
18387 -- For tagged types the Original_Record_Component must point to
18388 -- whatever this field was pointing to in the parent type. This has
18389 -- already been achieved by the call to New_Copy above.
18391 if not Is_Tagged then
18392 Set_Original_Record_Component (New_C, New_C);
18393 Set_Corresponding_Record_Component (New_C, Old_C);
18396 -- Set the proper type of an access discriminant
18398 if Ekind (New_C) = E_Discriminant
18399 and then Ekind (Etype (New_C)) = E_Anonymous_Access_Type
18401 Set_Anonymous_Type (New_C);
18404 -- If we have inherited a component then see if its Etype contains
18405 -- references to Parent_Base discriminants. In this case, replace
18406 -- these references with the constraints given in Discs. We do not
18407 -- do this for the partial view of private types because this is
18408 -- not needed (only the components of the full view will be used
18409 -- for code generation) and cause problem. We also avoid this
18410 -- transformation in some error situations.
18412 if Ekind (New_C) = E_Component then
18414 -- Set the proper type of an anonymous access component
18416 if Ekind (Etype (New_C)) = E_Anonymous_Access_Type then
18417 Set_Anonymous_Type (New_C);
18419 elsif (Is_Private_Type (Derived_Base)
18420 and then not Is_Generic_Type (Derived_Base))
18421 or else (Is_Empty_Elmt_List (Discs)
18422 and then not Expander_Active)
18424 Set_Etype (New_C, Etype (Old_C));
18427 -- The current component introduces a circularity of the
18430 -- limited with Pack_2;
18431 -- package Pack_1 is
18432 -- type T_1 is tagged record
18433 -- Comp : access Pack_2.T_2;
18439 -- package Pack_2 is
18440 -- type T_2 is new Pack_1.T_1 with ...;
18445 Constrain_Component_Type
18446 (Old_C, Derived_Base, N, Parent_Base, Discs));
18450 -- In derived tagged types it is illegal to reference a non
18451 -- discriminant component in the parent type. To catch this, mark
18452 -- these components with an Ekind of E_Void. This will be reset in
18453 -- Record_Type_Definition after processing the record extension of
18454 -- the derived type.
18456 -- If the declaration is a private extension, there is no further
18457 -- record extension to process, and the components retain their
18458 -- current kind, because they are visible at this point.
18460 if Is_Tagged and then Ekind (New_C) = E_Component
18461 and then Nkind (N) /= N_Private_Extension_Declaration
18463 Set_Ekind (New_C, E_Void);
18466 if Plain_Discrim then
18467 Set_Corresponding_Discriminant (New_C, Old_C);
18468 Build_Discriminal (New_C);
18470 -- If we are explicitly inheriting a stored discriminant it will be
18471 -- completely hidden.
18473 elsif Stored_Discrim then
18474 Set_Corresponding_Discriminant (New_C, Empty);
18475 Set_Discriminal (New_C, Empty);
18476 Set_Is_Completely_Hidden (New_C);
18478 -- Set the Original_Record_Component of each discriminant in the
18479 -- derived base to point to the corresponding stored that we just
18482 Discrim := First_Discriminant (Derived_Base);
18483 while Present (Discrim) loop
18484 Corr_Discrim := Corresponding_Discriminant (Discrim);
18486 -- Corr_Discrim could be missing in an error situation
18488 if Present (Corr_Discrim)
18489 and then Original_Record_Component (Corr_Discrim) = Old_C
18491 Set_Original_Record_Component (Discrim, New_C);
18492 Set_Corresponding_Record_Component (Discrim, Empty);
18495 Next_Discriminant (Discrim);
18498 Append_Entity (New_C, Derived_Base);
18501 if not Is_Tagged then
18502 Append_Elmt (Old_C, Assoc_List);
18503 Append_Elmt (New_C, Assoc_List);
18505 end Inherit_Component;
18507 -- Variables local to Inherit_Component
18509 Loc : constant Source_Ptr := Sloc (N);
18511 Parent_Discrim : Entity_Id;
18512 Stored_Discrim : Entity_Id;
18514 Component : Entity_Id;
18516 -- Start of processing for Inherit_Components
18519 if not Is_Tagged then
18520 Append_Elmt (Parent_Base, Assoc_List);
18521 Append_Elmt (Derived_Base, Assoc_List);
18524 -- Inherit parent discriminants if needed
18526 if Inherit_Discr then
18527 Parent_Discrim := First_Discriminant (Parent_Base);
18528 while Present (Parent_Discrim) loop
18529 Inherit_Component (Parent_Discrim, Plain_Discrim => True);
18530 Next_Discriminant (Parent_Discrim);
18534 -- Create explicit stored discrims for untagged types when necessary
18536 if not Has_Unknown_Discriminants (Derived_Base)
18537 and then Has_Discriminants (Parent_Base)
18538 and then not Is_Tagged
18541 or else First_Discriminant (Parent_Base) /=
18542 First_Stored_Discriminant (Parent_Base))
18544 Stored_Discrim := First_Stored_Discriminant (Parent_Base);
18545 while Present (Stored_Discrim) loop
18546 Inherit_Component (Stored_Discrim, Stored_Discrim => True);
18547 Next_Stored_Discriminant (Stored_Discrim);
18551 -- See if we can apply the second transformation for derived types, as
18552 -- explained in point 6. in the comments above Build_Derived_Record_Type
18553 -- This is achieved by appending Derived_Base discriminants into Discs,
18554 -- which has the side effect of returning a non empty Discs list to the
18555 -- caller of Inherit_Components, which is what we want. This must be
18556 -- done for private derived types if there are explicit stored
18557 -- discriminants, to ensure that we can retrieve the values of the
18558 -- constraints provided in the ancestors.
18561 and then Is_Empty_Elmt_List (Discs)
18562 and then Present (First_Discriminant (Derived_Base))
18564 (not Is_Private_Type (Derived_Base)
18565 or else Is_Completely_Hidden
18566 (First_Stored_Discriminant (Derived_Base))
18567 or else Is_Generic_Type (Derived_Base))
18569 D := First_Discriminant (Derived_Base);
18570 while Present (D) loop
18571 Append_Elmt (New_Occurrence_Of (D, Loc), Discs);
18572 Next_Discriminant (D);
18576 -- Finally, inherit non-discriminant components unless they are not
18577 -- visible because defined or inherited from the full view of the
18578 -- parent. Don't inherit the _parent field of the parent type.
18580 Component := First_Entity (Parent_Base);
18581 while Present (Component) loop
18583 -- Ada 2005 (AI-251): Do not inherit components associated with
18584 -- secondary tags of the parent.
18586 if Ekind (Component) = E_Component
18587 and then Present (Related_Type (Component))
18591 elsif Ekind (Component) /= E_Component
18592 or else Chars (Component) = Name_uParent
18596 -- If the derived type is within the parent type's declarative
18597 -- region, then the components can still be inherited even though
18598 -- they aren't visible at this point. This can occur for cases
18599 -- such as within public child units where the components must
18600 -- become visible upon entering the child unit's private part.
18602 elsif not Is_Visible_Component (Component)
18603 and then not In_Open_Scopes (Scope (Parent_Base))
18607 elsif Ekind_In (Derived_Base, E_Private_Type,
18608 E_Limited_Private_Type)
18613 Inherit_Component (Component);
18616 Next_Entity (Component);
18619 -- For tagged derived types, inherited discriminants cannot be used in
18620 -- component declarations of the record extension part. To achieve this
18621 -- we mark the inherited discriminants as not visible.
18623 if Is_Tagged and then Inherit_Discr then
18624 D := First_Discriminant (Derived_Base);
18625 while Present (D) loop
18626 Set_Is_Immediately_Visible (D, False);
18627 Next_Discriminant (D);
18632 end Inherit_Components;
18634 -----------------------------
18635 -- Inherit_Predicate_Flags --
18636 -----------------------------
18638 procedure Inherit_Predicate_Flags (Subt, Par : Entity_Id) is
18640 if Present (Predicate_Function (Subt)) then
18644 Set_Has_Predicates (Subt, Has_Predicates (Par));
18645 Set_Has_Static_Predicate_Aspect
18646 (Subt, Has_Static_Predicate_Aspect (Par));
18647 Set_Has_Dynamic_Predicate_Aspect
18648 (Subt, Has_Dynamic_Predicate_Aspect (Par));
18650 -- A named subtype does not inherit the predicate function of its
18651 -- parent but an itype declared for a loop index needs the discrete
18652 -- predicate information of its parent to execute the loop properly.
18653 -- A non-discrete type may has a static predicate (for example True)
18654 -- but has no static_discrete_predicate.
18656 if Is_Itype (Subt) and then Present (Predicate_Function (Par)) then
18657 Set_Subprograms_For_Type (Subt, Subprograms_For_Type (Par));
18659 if Has_Static_Predicate (Par) and then Is_Discrete_Type (Par) then
18660 Set_Static_Discrete_Predicate
18661 (Subt, Static_Discrete_Predicate (Par));
18664 end Inherit_Predicate_Flags;
18666 ----------------------
18667 -- Is_EVF_Procedure --
18668 ----------------------
18670 function Is_EVF_Procedure (Subp : Entity_Id) return Boolean is
18671 Formal : Entity_Id;
18674 -- Examine the formals of an Extensions_Visible False procedure looking
18675 -- for a controlling OUT parameter.
18677 if Ekind (Subp) = E_Procedure
18678 and then Extensions_Visible_Status (Subp) = Extensions_Visible_False
18680 Formal := First_Formal (Subp);
18681 while Present (Formal) loop
18682 if Ekind (Formal) = E_Out_Parameter
18683 and then Is_Controlling_Formal (Formal)
18688 Next_Formal (Formal);
18693 end Is_EVF_Procedure;
18695 -----------------------
18696 -- Is_Null_Extension --
18697 -----------------------
18699 function Is_Null_Extension (T : Entity_Id) return Boolean is
18700 Type_Decl : constant Node_Id := Parent (Base_Type (T));
18701 Comp_List : Node_Id;
18705 if Nkind (Type_Decl) /= N_Full_Type_Declaration
18706 or else not Is_Tagged_Type (T)
18707 or else Nkind (Type_Definition (Type_Decl)) /=
18708 N_Derived_Type_Definition
18709 or else No (Record_Extension_Part (Type_Definition (Type_Decl)))
18715 Component_List (Record_Extension_Part (Type_Definition (Type_Decl)));
18717 if Present (Discriminant_Specifications (Type_Decl)) then
18720 elsif Present (Comp_List)
18721 and then Is_Non_Empty_List (Component_Items (Comp_List))
18723 Comp := First (Component_Items (Comp_List));
18725 -- Only user-defined components are relevant. The component list
18726 -- may also contain a parent component and internal components
18727 -- corresponding to secondary tags, but these do not determine
18728 -- whether this is a null extension.
18730 while Present (Comp) loop
18731 if Comes_From_Source (Comp) then
18743 end Is_Null_Extension;
18745 ------------------------------
18746 -- Is_Valid_Constraint_Kind --
18747 ------------------------------
18749 function Is_Valid_Constraint_Kind
18750 (T_Kind : Type_Kind;
18751 Constraint_Kind : Node_Kind) return Boolean
18755 when Enumeration_Kind
18758 return Constraint_Kind = N_Range_Constraint;
18760 when Decimal_Fixed_Point_Kind =>
18761 return Nkind_In (Constraint_Kind, N_Digits_Constraint,
18762 N_Range_Constraint);
18764 when Ordinary_Fixed_Point_Kind =>
18765 return Nkind_In (Constraint_Kind, N_Delta_Constraint,
18766 N_Range_Constraint);
18769 return Nkind_In (Constraint_Kind, N_Digits_Constraint,
18770 N_Range_Constraint);
18777 | E_Incomplete_Type
18781 return Constraint_Kind = N_Index_Or_Discriminant_Constraint;
18784 return True; -- Error will be detected later
18786 end Is_Valid_Constraint_Kind;
18788 --------------------------
18789 -- Is_Visible_Component --
18790 --------------------------
18792 function Is_Visible_Component
18794 N : Node_Id := Empty) return Boolean
18796 Original_Comp : Entity_Id := Empty;
18797 Original_Type : Entity_Id;
18798 Type_Scope : Entity_Id;
18800 function Is_Local_Type (Typ : Entity_Id) return Boolean;
18801 -- Check whether parent type of inherited component is declared locally,
18802 -- possibly within a nested package or instance. The current scope is
18803 -- the derived record itself.
18805 -------------------
18806 -- Is_Local_Type --
18807 -------------------
18809 function Is_Local_Type (Typ : Entity_Id) return Boolean is
18813 Scop := Scope (Typ);
18814 while Present (Scop)
18815 and then Scop /= Standard_Standard
18817 if Scop = Scope (Current_Scope) then
18821 Scop := Scope (Scop);
18827 -- Start of processing for Is_Visible_Component
18830 if Ekind_In (C, E_Component, E_Discriminant) then
18831 Original_Comp := Original_Record_Component (C);
18834 if No (Original_Comp) then
18836 -- Premature usage, or previous error
18841 Original_Type := Scope (Original_Comp);
18842 Type_Scope := Scope (Base_Type (Scope (C)));
18845 -- This test only concerns tagged types
18847 if not Is_Tagged_Type (Original_Type) then
18849 -- Check if this is a renamed discriminant (hidden either by the
18850 -- derived type or by some ancestor), unless we are analyzing code
18851 -- generated by the expander since it may reference such components
18852 -- (for example see the expansion of Deep_Adjust).
18854 if Ekind (C) = E_Discriminant and then Present (N) then
18856 not Comes_From_Source (N)
18857 or else not Is_Completely_Hidden (C);
18862 -- If it is _Parent or _Tag, there is no visibility issue
18864 elsif not Comes_From_Source (Original_Comp) then
18867 -- Discriminants are visible unless the (private) type has unknown
18868 -- discriminants. If the discriminant reference is inserted for a
18869 -- discriminant check on a full view it is also visible.
18871 elsif Ekind (Original_Comp) = E_Discriminant
18873 (not Has_Unknown_Discriminants (Original_Type)
18874 or else (Present (N)
18875 and then Nkind (N) = N_Selected_Component
18876 and then Nkind (Prefix (N)) = N_Type_Conversion
18877 and then not Comes_From_Source (Prefix (N))))
18881 -- In the body of an instantiation, check the visibility of a component
18882 -- in case it has a homograph that is a primitive operation of a private
18883 -- type which was not visible in the generic unit.
18885 -- Should Is_Prefixed_Call be propagated from template to instance???
18887 elsif In_Instance_Body then
18888 if not Is_Tagged_Type (Original_Type)
18889 or else not Is_Private_Type (Original_Type)
18895 Subp_Elmt : Elmt_Id;
18898 Subp_Elmt := First_Elmt (Primitive_Operations (Original_Type));
18899 while Present (Subp_Elmt) loop
18901 -- The component is hidden by a primitive operation
18903 if Chars (Node (Subp_Elmt)) = Chars (C) then
18907 Next_Elmt (Subp_Elmt);
18914 -- If the component has been declared in an ancestor which is currently
18915 -- a private type, then it is not visible. The same applies if the
18916 -- component's containing type is not in an open scope and the original
18917 -- component's enclosing type is a visible full view of a private type
18918 -- (which can occur in cases where an attempt is being made to reference
18919 -- a component in a sibling package that is inherited from a visible
18920 -- component of a type in an ancestor package; the component in the
18921 -- sibling package should not be visible even though the component it
18922 -- inherited from is visible). This does not apply however in the case
18923 -- where the scope of the type is a private child unit, or when the
18924 -- parent comes from a local package in which the ancestor is currently
18925 -- visible. The latter suppression of visibility is needed for cases
18926 -- that are tested in B730006.
18928 elsif Is_Private_Type (Original_Type)
18930 (not Is_Private_Descendant (Type_Scope)
18931 and then not In_Open_Scopes (Type_Scope)
18932 and then Has_Private_Declaration (Original_Type))
18934 -- If the type derives from an entity in a formal package, there
18935 -- are no additional visible components.
18937 if Nkind (Original_Node (Unit_Declaration_Node (Type_Scope))) =
18938 N_Formal_Package_Declaration
18942 -- if we are not in the private part of the current package, there
18943 -- are no additional visible components.
18945 elsif Ekind (Scope (Current_Scope)) = E_Package
18946 and then not In_Private_Part (Scope (Current_Scope))
18951 Is_Child_Unit (Cunit_Entity (Current_Sem_Unit))
18952 and then In_Open_Scopes (Scope (Original_Type))
18953 and then Is_Local_Type (Type_Scope);
18956 -- There is another weird way in which a component may be invisible when
18957 -- the private and the full view are not derived from the same ancestor.
18958 -- Here is an example :
18960 -- type A1 is tagged record F1 : integer; end record;
18961 -- type A2 is new A1 with record F2 : integer; end record;
18962 -- type T is new A1 with private;
18964 -- type T is new A2 with null record;
18966 -- In this case, the full view of T inherits F1 and F2 but the private
18967 -- view inherits only F1
18971 Ancestor : Entity_Id := Scope (C);
18975 if Ancestor = Original_Type then
18978 -- The ancestor may have a partial view of the original type,
18979 -- but if the full view is in scope, as in a child body, the
18980 -- component is visible.
18982 elsif In_Private_Part (Scope (Original_Type))
18983 and then Full_View (Ancestor) = Original_Type
18987 elsif Ancestor = Etype (Ancestor) then
18989 -- No further ancestors to examine
18994 Ancestor := Etype (Ancestor);
18998 end Is_Visible_Component;
19000 --------------------------
19001 -- Make_Class_Wide_Type --
19002 --------------------------
19004 procedure Make_Class_Wide_Type (T : Entity_Id) is
19005 CW_Type : Entity_Id;
19007 Next_E : Entity_Id;
19008 Prev_E : Entity_Id;
19011 if Present (Class_Wide_Type (T)) then
19013 -- The class-wide type is a partially decorated entity created for a
19014 -- unanalyzed tagged type referenced through a limited with clause.
19015 -- When the tagged type is analyzed, its class-wide type needs to be
19016 -- redecorated. Note that we reuse the entity created by Decorate_
19017 -- Tagged_Type in order to preserve all links.
19019 if Materialize_Entity (Class_Wide_Type (T)) then
19020 CW_Type := Class_Wide_Type (T);
19021 Set_Materialize_Entity (CW_Type, False);
19023 -- The class wide type can have been defined by the partial view, in
19024 -- which case everything is already done.
19030 -- Default case, we need to create a new class-wide type
19034 New_External_Entity (E_Void, Scope (T), Sloc (T), T, 'C', 0, 'T');
19037 -- Inherit root type characteristics
19039 CW_Name := Chars (CW_Type);
19040 Next_E := Next_Entity (CW_Type);
19041 Prev_E := Prev_Entity (CW_Type);
19042 Copy_Node (T, CW_Type);
19043 Set_Comes_From_Source (CW_Type, False);
19044 Set_Chars (CW_Type, CW_Name);
19045 Set_Parent (CW_Type, Parent (T));
19046 Set_Prev_Entity (CW_Type, Prev_E);
19047 Set_Next_Entity (CW_Type, Next_E);
19049 -- Ensure we have a new freeze node for the class-wide type. The partial
19050 -- view may have freeze action of its own, requiring a proper freeze
19051 -- node, and the same freeze node cannot be shared between the two
19054 Set_Has_Delayed_Freeze (CW_Type);
19055 Set_Freeze_Node (CW_Type, Empty);
19057 -- Customize the class-wide type: It has no prim. op., it cannot be
19058 -- abstract, its Etype points back to the specific root type, and it
19059 -- cannot have any invariants.
19061 Set_Ekind (CW_Type, E_Class_Wide_Type);
19062 Set_Is_Tagged_Type (CW_Type, True);
19063 Set_Direct_Primitive_Operations (CW_Type, New_Elmt_List);
19064 Set_Is_Abstract_Type (CW_Type, False);
19065 Set_Is_Constrained (CW_Type, False);
19066 Set_Is_First_Subtype (CW_Type, Is_First_Subtype (T));
19067 Set_Default_SSO (CW_Type);
19068 Set_Has_Inheritable_Invariants (CW_Type, False);
19069 Set_Has_Inherited_Invariants (CW_Type, False);
19070 Set_Has_Own_Invariants (CW_Type, False);
19072 if Ekind (T) = E_Class_Wide_Subtype then
19073 Set_Etype (CW_Type, Etype (Base_Type (T)));
19075 Set_Etype (CW_Type, T);
19078 Set_No_Tagged_Streams_Pragma (CW_Type, No_Tagged_Streams);
19080 -- If this is the class_wide type of a constrained subtype, it does
19081 -- not have discriminants.
19083 Set_Has_Discriminants (CW_Type,
19084 Has_Discriminants (T) and then not Is_Constrained (T));
19086 Set_Has_Unknown_Discriminants (CW_Type, True);
19087 Set_Class_Wide_Type (T, CW_Type);
19088 Set_Equivalent_Type (CW_Type, Empty);
19090 -- The class-wide type of a class-wide type is itself (RM 3.9(14))
19092 Set_Class_Wide_Type (CW_Type, CW_Type);
19093 end Make_Class_Wide_Type;
19099 procedure Make_Index
19101 Related_Nod : Node_Id;
19102 Related_Id : Entity_Id := Empty;
19103 Suffix_Index : Nat := 1;
19104 In_Iter_Schm : Boolean := False)
19108 Def_Id : Entity_Id := Empty;
19109 Found : Boolean := False;
19112 -- For a discrete range used in a constrained array definition and
19113 -- defined by a range, an implicit conversion to the predefined type
19114 -- INTEGER is assumed if each bound is either a numeric literal, a named
19115 -- number, or an attribute, and the type of both bounds (prior to the
19116 -- implicit conversion) is the type universal_integer. Otherwise, both
19117 -- bounds must be of the same discrete type, other than universal
19118 -- integer; this type must be determinable independently of the
19119 -- context, but using the fact that the type must be discrete and that
19120 -- both bounds must have the same type.
19122 -- Character literals also have a universal type in the absence of
19123 -- of additional context, and are resolved to Standard_Character.
19125 if Nkind (N) = N_Range then
19127 -- The index is given by a range constraint. The bounds are known
19128 -- to be of a consistent type.
19130 if not Is_Overloaded (N) then
19133 -- For universal bounds, choose the specific predefined type
19135 if T = Universal_Integer then
19136 T := Standard_Integer;
19138 elsif T = Any_Character then
19139 Ambiguous_Character (Low_Bound (N));
19141 T := Standard_Character;
19144 -- The node may be overloaded because some user-defined operators
19145 -- are available, but if a universal interpretation exists it is
19146 -- also the selected one.
19148 elsif Universal_Interpretation (N) = Universal_Integer then
19149 T := Standard_Integer;
19155 Ind : Interp_Index;
19159 Get_First_Interp (N, Ind, It);
19160 while Present (It.Typ) loop
19161 if Is_Discrete_Type (It.Typ) then
19164 and then not Covers (It.Typ, T)
19165 and then not Covers (T, It.Typ)
19167 Error_Msg_N ("ambiguous bounds in discrete range", N);
19175 Get_Next_Interp (Ind, It);
19178 if T = Any_Type then
19179 Error_Msg_N ("discrete type required for range", N);
19180 Set_Etype (N, Any_Type);
19183 elsif T = Universal_Integer then
19184 T := Standard_Integer;
19189 if not Is_Discrete_Type (T) then
19190 Error_Msg_N ("discrete type required for range", N);
19191 Set_Etype (N, Any_Type);
19195 if Nkind (Low_Bound (N)) = N_Attribute_Reference
19196 and then Attribute_Name (Low_Bound (N)) = Name_First
19197 and then Is_Entity_Name (Prefix (Low_Bound (N)))
19198 and then Is_Type (Entity (Prefix (Low_Bound (N))))
19199 and then Is_Discrete_Type (Entity (Prefix (Low_Bound (N))))
19201 -- The type of the index will be the type of the prefix, as long
19202 -- as the upper bound is 'Last of the same type.
19204 Def_Id := Entity (Prefix (Low_Bound (N)));
19206 if Nkind (High_Bound (N)) /= N_Attribute_Reference
19207 or else Attribute_Name (High_Bound (N)) /= Name_Last
19208 or else not Is_Entity_Name (Prefix (High_Bound (N)))
19209 or else Entity (Prefix (High_Bound (N))) /= Def_Id
19216 Process_Range_Expr_In_Decl (R, T, In_Iter_Schm => In_Iter_Schm);
19218 elsif Nkind (N) = N_Subtype_Indication then
19220 -- The index is given by a subtype with a range constraint
19222 T := Base_Type (Entity (Subtype_Mark (N)));
19224 if not Is_Discrete_Type (T) then
19225 Error_Msg_N ("discrete type required for range", N);
19226 Set_Etype (N, Any_Type);
19230 R := Range_Expression (Constraint (N));
19233 Process_Range_Expr_In_Decl
19234 (R, Entity (Subtype_Mark (N)), In_Iter_Schm => In_Iter_Schm);
19236 elsif Nkind (N) = N_Attribute_Reference then
19238 -- Catch beginner's error (use of attribute other than 'Range)
19240 if Attribute_Name (N) /= Name_Range then
19241 Error_Msg_N ("expect attribute ''Range", N);
19242 Set_Etype (N, Any_Type);
19246 -- If the node denotes the range of a type mark, that is also the
19247 -- resulting type, and we do not need to create an Itype for it.
19249 if Is_Entity_Name (Prefix (N))
19250 and then Comes_From_Source (N)
19251 and then Is_Type (Entity (Prefix (N)))
19252 and then Is_Discrete_Type (Entity (Prefix (N)))
19254 Def_Id := Entity (Prefix (N));
19257 Analyze_And_Resolve (N);
19261 -- If none of the above, must be a subtype. We convert this to a
19262 -- range attribute reference because in the case of declared first
19263 -- named subtypes, the types in the range reference can be different
19264 -- from the type of the entity. A range attribute normalizes the
19265 -- reference and obtains the correct types for the bounds.
19267 -- This transformation is in the nature of an expansion, is only
19268 -- done if expansion is active. In particular, it is not done on
19269 -- formal generic types, because we need to retain the name of the
19270 -- original index for instantiation purposes.
19273 if not Is_Entity_Name (N) or else not Is_Type (Entity (N)) then
19274 Error_Msg_N ("invalid subtype mark in discrete range ", N);
19275 Set_Etype (N, Any_Integer);
19279 -- The type mark may be that of an incomplete type. It is only
19280 -- now that we can get the full view, previous analysis does
19281 -- not look specifically for a type mark.
19283 Set_Entity (N, Get_Full_View (Entity (N)));
19284 Set_Etype (N, Entity (N));
19285 Def_Id := Entity (N);
19287 if not Is_Discrete_Type (Def_Id) then
19288 Error_Msg_N ("discrete type required for index", N);
19289 Set_Etype (N, Any_Type);
19294 if Expander_Active then
19296 Make_Attribute_Reference (Sloc (N),
19297 Attribute_Name => Name_Range,
19298 Prefix => Relocate_Node (N)));
19300 -- The original was a subtype mark that does not freeze. This
19301 -- means that the rewritten version must not freeze either.
19303 Set_Must_Not_Freeze (N);
19304 Set_Must_Not_Freeze (Prefix (N));
19305 Analyze_And_Resolve (N);
19309 -- If expander is inactive, type is legal, nothing else to construct
19316 if not Is_Discrete_Type (T) then
19317 Error_Msg_N ("discrete type required for range", N);
19318 Set_Etype (N, Any_Type);
19321 elsif T = Any_Type then
19322 Set_Etype (N, Any_Type);
19326 -- We will now create the appropriate Itype to describe the range, but
19327 -- first a check. If we originally had a subtype, then we just label
19328 -- the range with this subtype. Not only is there no need to construct
19329 -- a new subtype, but it is wrong to do so for two reasons:
19331 -- 1. A legality concern, if we have a subtype, it must not freeze,
19332 -- and the Itype would cause freezing incorrectly
19334 -- 2. An efficiency concern, if we created an Itype, it would not be
19335 -- recognized as the same type for the purposes of eliminating
19336 -- checks in some circumstances.
19338 -- We signal this case by setting the subtype entity in Def_Id
19340 if No (Def_Id) then
19342 Create_Itype (E_Void, Related_Nod, Related_Id, 'D', Suffix_Index);
19343 Set_Etype (Def_Id, Base_Type (T));
19345 if Is_Signed_Integer_Type (T) then
19346 Set_Ekind (Def_Id, E_Signed_Integer_Subtype);
19348 elsif Is_Modular_Integer_Type (T) then
19349 Set_Ekind (Def_Id, E_Modular_Integer_Subtype);
19352 Set_Ekind (Def_Id, E_Enumeration_Subtype);
19353 Set_Is_Character_Type (Def_Id, Is_Character_Type (T));
19354 Set_First_Literal (Def_Id, First_Literal (T));
19357 Set_Size_Info (Def_Id, (T));
19358 Set_RM_Size (Def_Id, RM_Size (T));
19359 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
19361 Set_Scalar_Range (Def_Id, R);
19362 Conditional_Delay (Def_Id, T);
19364 if Nkind (N) = N_Subtype_Indication then
19365 Inherit_Predicate_Flags (Def_Id, Entity (Subtype_Mark (N)));
19368 -- In the subtype indication case, if the immediate parent of the
19369 -- new subtype is nonstatic, then the subtype we create is nonstatic,
19370 -- even if its bounds are static.
19372 if Nkind (N) = N_Subtype_Indication
19373 and then not Is_OK_Static_Subtype (Entity (Subtype_Mark (N)))
19375 Set_Is_Non_Static_Subtype (Def_Id);
19379 -- Final step is to label the index with this constructed type
19381 Set_Etype (N, Def_Id);
19384 ------------------------------
19385 -- Modular_Type_Declaration --
19386 ------------------------------
19388 procedure Modular_Type_Declaration (T : Entity_Id; Def : Node_Id) is
19389 Mod_Expr : constant Node_Id := Expression (Def);
19392 procedure Set_Modular_Size (Bits : Int);
19393 -- Sets RM_Size to Bits, and Esize to normal word size above this
19395 ----------------------
19396 -- Set_Modular_Size --
19397 ----------------------
19399 procedure Set_Modular_Size (Bits : Int) is
19401 Set_RM_Size (T, UI_From_Int (Bits));
19406 elsif Bits <= 16 then
19407 Init_Esize (T, 16);
19409 elsif Bits <= 32 then
19410 Init_Esize (T, 32);
19413 Init_Esize (T, System_Max_Binary_Modulus_Power);
19416 if not Non_Binary_Modulus (T) and then Esize (T) = RM_Size (T) then
19417 Set_Is_Known_Valid (T);
19419 end Set_Modular_Size;
19421 -- Start of processing for Modular_Type_Declaration
19424 -- If the mod expression is (exactly) 2 * literal, where literal is
19425 -- 64 or less,then almost certainly the * was meant to be **. Warn.
19427 if Warn_On_Suspicious_Modulus_Value
19428 and then Nkind (Mod_Expr) = N_Op_Multiply
19429 and then Nkind (Left_Opnd (Mod_Expr)) = N_Integer_Literal
19430 and then Intval (Left_Opnd (Mod_Expr)) = Uint_2
19431 and then Nkind (Right_Opnd (Mod_Expr)) = N_Integer_Literal
19432 and then Intval (Right_Opnd (Mod_Expr)) <= Uint_64
19435 ("suspicious MOD value, was '*'* intended'??M?", Mod_Expr);
19438 -- Proceed with analysis of mod expression
19440 Analyze_And_Resolve (Mod_Expr, Any_Integer);
19442 Set_Ekind (T, E_Modular_Integer_Type);
19443 Init_Alignment (T);
19444 Set_Is_Constrained (T);
19446 if not Is_OK_Static_Expression (Mod_Expr) then
19447 Flag_Non_Static_Expr
19448 ("non-static expression used for modular type bound!", Mod_Expr);
19449 M_Val := 2 ** System_Max_Binary_Modulus_Power;
19451 M_Val := Expr_Value (Mod_Expr);
19455 Error_Msg_N ("modulus value must be positive", Mod_Expr);
19456 M_Val := 2 ** System_Max_Binary_Modulus_Power;
19459 if M_Val > 2 ** Standard_Long_Integer_Size then
19460 Check_Restriction (No_Long_Long_Integers, Mod_Expr);
19463 Set_Modulus (T, M_Val);
19465 -- Create bounds for the modular type based on the modulus given in
19466 -- the type declaration and then analyze and resolve those bounds.
19468 Set_Scalar_Range (T,
19469 Make_Range (Sloc (Mod_Expr),
19470 Low_Bound => Make_Integer_Literal (Sloc (Mod_Expr), 0),
19471 High_Bound => Make_Integer_Literal (Sloc (Mod_Expr), M_Val - 1)));
19473 -- Properly analyze the literals for the range. We do this manually
19474 -- because we can't go calling Resolve, since we are resolving these
19475 -- bounds with the type, and this type is certainly not complete yet.
19477 Set_Etype (Low_Bound (Scalar_Range (T)), T);
19478 Set_Etype (High_Bound (Scalar_Range (T)), T);
19479 Set_Is_Static_Expression (Low_Bound (Scalar_Range (T)));
19480 Set_Is_Static_Expression (High_Bound (Scalar_Range (T)));
19482 -- Loop through powers of two to find number of bits required
19484 for Bits in Int range 0 .. System_Max_Binary_Modulus_Power loop
19488 if M_Val = 2 ** Bits then
19489 Set_Modular_Size (Bits);
19494 elsif M_Val < 2 ** Bits then
19495 Check_SPARK_05_Restriction ("modulus should be a power of 2", T);
19496 Set_Non_Binary_Modulus (T);
19498 if Bits > System_Max_Nonbinary_Modulus_Power then
19499 Error_Msg_Uint_1 :=
19500 UI_From_Int (System_Max_Nonbinary_Modulus_Power);
19502 ("nonbinary modulus exceeds limit (2 '*'*^ - 1)", Mod_Expr);
19503 Set_Modular_Size (System_Max_Binary_Modulus_Power);
19507 -- In the nonbinary case, set size as per RM 13.3(55)
19509 Set_Modular_Size (Bits);
19516 -- If we fall through, then the size exceed System.Max_Binary_Modulus
19517 -- so we just signal an error and set the maximum size.
19519 Error_Msg_Uint_1 := UI_From_Int (System_Max_Binary_Modulus_Power);
19520 Error_Msg_F ("modulus exceeds limit (2 '*'*^)", Mod_Expr);
19522 Set_Modular_Size (System_Max_Binary_Modulus_Power);
19523 Init_Alignment (T);
19525 end Modular_Type_Declaration;
19527 --------------------------
19528 -- New_Concatenation_Op --
19529 --------------------------
19531 procedure New_Concatenation_Op (Typ : Entity_Id) is
19532 Loc : constant Source_Ptr := Sloc (Typ);
19535 function Make_Op_Formal (Typ, Op : Entity_Id) return Entity_Id;
19536 -- Create abbreviated declaration for the formal of a predefined
19537 -- Operator 'Op' of type 'Typ'
19539 --------------------
19540 -- Make_Op_Formal --
19541 --------------------
19543 function Make_Op_Formal (Typ, Op : Entity_Id) return Entity_Id is
19544 Formal : Entity_Id;
19546 Formal := New_Internal_Entity (E_In_Parameter, Op, Loc, 'P');
19547 Set_Etype (Formal, Typ);
19548 Set_Mechanism (Formal, Default_Mechanism);
19550 end Make_Op_Formal;
19552 -- Start of processing for New_Concatenation_Op
19555 Op := Make_Defining_Operator_Symbol (Loc, Name_Op_Concat);
19557 Set_Ekind (Op, E_Operator);
19558 Set_Scope (Op, Current_Scope);
19559 Set_Etype (Op, Typ);
19560 Set_Homonym (Op, Get_Name_Entity_Id (Name_Op_Concat));
19561 Set_Is_Immediately_Visible (Op);
19562 Set_Is_Intrinsic_Subprogram (Op);
19563 Set_Has_Completion (Op);
19564 Append_Entity (Op, Current_Scope);
19566 Set_Name_Entity_Id (Name_Op_Concat, Op);
19568 Append_Entity (Make_Op_Formal (Typ, Op), Op);
19569 Append_Entity (Make_Op_Formal (Typ, Op), Op);
19570 end New_Concatenation_Op;
19572 -------------------------
19573 -- OK_For_Limited_Init --
19574 -------------------------
19576 -- ???Check all calls of this, and compare the conditions under which it's
19579 function OK_For_Limited_Init
19581 Exp : Node_Id) return Boolean
19584 return Is_CPP_Constructor_Call (Exp)
19585 or else (Ada_Version >= Ada_2005
19586 and then not Debug_Flag_Dot_L
19587 and then OK_For_Limited_Init_In_05 (Typ, Exp));
19588 end OK_For_Limited_Init;
19590 -------------------------------
19591 -- OK_For_Limited_Init_In_05 --
19592 -------------------------------
19594 function OK_For_Limited_Init_In_05
19596 Exp : Node_Id) return Boolean
19599 -- An object of a limited interface type can be initialized with any
19600 -- expression of a nonlimited descendant type. However this does not
19601 -- apply if this is a view conversion of some other expression. This
19602 -- is checked below.
19604 if Is_Class_Wide_Type (Typ)
19605 and then Is_Limited_Interface (Typ)
19606 and then not Is_Limited_Type (Etype (Exp))
19607 and then Nkind (Exp) /= N_Type_Conversion
19612 -- Ada 2005 (AI-287, AI-318): Relax the strictness of the front end in
19613 -- case of limited aggregates (including extension aggregates), and
19614 -- function calls. The function call may have been given in prefixed
19615 -- notation, in which case the original node is an indexed component.
19616 -- If the function is parameterless, the original node was an explicit
19617 -- dereference. The function may also be parameterless, in which case
19618 -- the source node is just an identifier.
19620 -- A branch of a conditional expression may have been removed if the
19621 -- condition is statically known. This happens during expansion, and
19622 -- thus will not happen if previous errors were encountered. The check
19623 -- will have been performed on the chosen branch, which replaces the
19624 -- original conditional expression.
19630 case Nkind (Original_Node (Exp)) is
19632 | N_Extension_Aggregate
19638 when N_Identifier =>
19639 return Present (Entity (Original_Node (Exp)))
19640 and then Ekind (Entity (Original_Node (Exp))) = E_Function;
19642 when N_Qualified_Expression =>
19644 OK_For_Limited_Init_In_05
19645 (Typ, Expression (Original_Node (Exp)));
19647 -- Ada 2005 (AI-251): If a class-wide interface object is initialized
19648 -- with a function call, the expander has rewritten the call into an
19649 -- N_Type_Conversion node to force displacement of the pointer to
19650 -- reference the component containing the secondary dispatch table.
19651 -- Otherwise a type conversion is not a legal context.
19652 -- A return statement for a build-in-place function returning a
19653 -- synchronized type also introduces an unchecked conversion.
19655 when N_Type_Conversion
19656 | N_Unchecked_Type_Conversion
19658 return not Comes_From_Source (Exp)
19660 OK_For_Limited_Init_In_05
19661 (Typ, Expression (Original_Node (Exp)));
19663 when N_Explicit_Dereference
19664 | N_Indexed_Component
19665 | N_Selected_Component
19667 return Nkind (Exp) = N_Function_Call;
19669 -- A use of 'Input is a function call, hence allowed. Normally the
19670 -- attribute will be changed to a call, but the attribute by itself
19671 -- can occur with -gnatc.
19673 when N_Attribute_Reference =>
19674 return Attribute_Name (Original_Node (Exp)) = Name_Input;
19676 -- "return raise ..." is OK
19678 when N_Raise_Expression =>
19681 -- For a case expression, all dependent expressions must be legal
19683 when N_Case_Expression =>
19688 Alt := First (Alternatives (Original_Node (Exp)));
19689 while Present (Alt) loop
19690 if not OK_For_Limited_Init_In_05 (Typ, Expression (Alt)) then
19700 -- For an if expression, all dependent expressions must be legal
19702 when N_If_Expression =>
19704 Then_Expr : constant Node_Id :=
19705 Next (First (Expressions (Original_Node (Exp))));
19706 Else_Expr : constant Node_Id := Next (Then_Expr);
19708 return OK_For_Limited_Init_In_05 (Typ, Then_Expr)
19710 OK_For_Limited_Init_In_05 (Typ, Else_Expr);
19716 end OK_For_Limited_Init_In_05;
19718 -------------------------------------------
19719 -- Ordinary_Fixed_Point_Type_Declaration --
19720 -------------------------------------------
19722 procedure Ordinary_Fixed_Point_Type_Declaration
19726 Loc : constant Source_Ptr := Sloc (Def);
19727 Delta_Expr : constant Node_Id := Delta_Expression (Def);
19728 RRS : constant Node_Id := Real_Range_Specification (Def);
19729 Implicit_Base : Entity_Id;
19736 Check_Restriction (No_Fixed_Point, Def);
19738 -- Create implicit base type
19741 Create_Itype (E_Ordinary_Fixed_Point_Type, Parent (Def), T, 'B');
19742 Set_Etype (Implicit_Base, Implicit_Base);
19744 -- Analyze and process delta expression
19746 Analyze_And_Resolve (Delta_Expr, Any_Real);
19748 Check_Delta_Expression (Delta_Expr);
19749 Delta_Val := Expr_Value_R (Delta_Expr);
19751 Set_Delta_Value (Implicit_Base, Delta_Val);
19753 -- Compute default small from given delta, which is the largest power
19754 -- of two that does not exceed the given delta value.
19764 if Delta_Val < Ureal_1 then
19765 while Delta_Val < Tmp loop
19766 Tmp := Tmp / Ureal_2;
19767 Scale := Scale + 1;
19772 Tmp := Tmp * Ureal_2;
19773 exit when Tmp > Delta_Val;
19774 Scale := Scale - 1;
19778 Small_Val := UR_From_Components (Uint_1, UI_From_Int (Scale), 2);
19781 Set_Small_Value (Implicit_Base, Small_Val);
19783 -- If no range was given, set a dummy range
19785 if RRS <= Empty_Or_Error then
19786 Low_Val := -Small_Val;
19787 High_Val := Small_Val;
19789 -- Otherwise analyze and process given range
19793 Low : constant Node_Id := Low_Bound (RRS);
19794 High : constant Node_Id := High_Bound (RRS);
19797 Analyze_And_Resolve (Low, Any_Real);
19798 Analyze_And_Resolve (High, Any_Real);
19799 Check_Real_Bound (Low);
19800 Check_Real_Bound (High);
19802 -- Obtain and set the range
19804 Low_Val := Expr_Value_R (Low);
19805 High_Val := Expr_Value_R (High);
19807 if Low_Val > High_Val then
19808 Error_Msg_NE ("??fixed point type& has null range", Def, T);
19813 -- The range for both the implicit base and the declared first subtype
19814 -- cannot be set yet, so we use the special routine Set_Fixed_Range to
19815 -- set a temporary range in place. Note that the bounds of the base
19816 -- type will be widened to be symmetrical and to fill the available
19817 -- bits when the type is frozen.
19819 -- We could do this with all discrete types, and probably should, but
19820 -- we absolutely have to do it for fixed-point, since the end-points
19821 -- of the range and the size are determined by the small value, which
19822 -- could be reset before the freeze point.
19824 Set_Fixed_Range (Implicit_Base, Loc, Low_Val, High_Val);
19825 Set_Fixed_Range (T, Loc, Low_Val, High_Val);
19827 -- Complete definition of first subtype. The inheritance of the rep item
19828 -- chain ensures that SPARK-related pragmas are not clobbered when the
19829 -- ordinary fixed point type acts as a full view of a private type.
19831 Set_Ekind (T, E_Ordinary_Fixed_Point_Subtype);
19832 Set_Etype (T, Implicit_Base);
19833 Init_Size_Align (T);
19834 Inherit_Rep_Item_Chain (T, Implicit_Base);
19835 Set_Small_Value (T, Small_Val);
19836 Set_Delta_Value (T, Delta_Val);
19837 Set_Is_Constrained (T);
19838 end Ordinary_Fixed_Point_Type_Declaration;
19840 ----------------------------------
19841 -- Preanalyze_Assert_Expression --
19842 ----------------------------------
19844 procedure Preanalyze_Assert_Expression (N : Node_Id; T : Entity_Id) is
19846 In_Assertion_Expr := In_Assertion_Expr + 1;
19847 Preanalyze_Spec_Expression (N, T);
19848 In_Assertion_Expr := In_Assertion_Expr - 1;
19849 end Preanalyze_Assert_Expression;
19851 -----------------------------------
19852 -- Preanalyze_Default_Expression --
19853 -----------------------------------
19855 procedure Preanalyze_Default_Expression (N : Node_Id; T : Entity_Id) is
19856 Save_In_Default_Expr : constant Boolean := In_Default_Expr;
19857 Save_In_Spec_Expression : constant Boolean := In_Spec_Expression;
19860 In_Default_Expr := True;
19861 In_Spec_Expression := True;
19863 Preanalyze_With_Freezing_And_Resolve (N, T);
19865 In_Default_Expr := Save_In_Default_Expr;
19866 In_Spec_Expression := Save_In_Spec_Expression;
19867 end Preanalyze_Default_Expression;
19869 --------------------------------
19870 -- Preanalyze_Spec_Expression --
19871 --------------------------------
19873 procedure Preanalyze_Spec_Expression (N : Node_Id; T : Entity_Id) is
19874 Save_In_Spec_Expression : constant Boolean := In_Spec_Expression;
19876 In_Spec_Expression := True;
19877 Preanalyze_And_Resolve (N, T);
19878 In_Spec_Expression := Save_In_Spec_Expression;
19879 end Preanalyze_Spec_Expression;
19881 ----------------------------------------
19882 -- Prepare_Private_Subtype_Completion --
19883 ----------------------------------------
19885 procedure Prepare_Private_Subtype_Completion
19887 Related_Nod : Node_Id)
19889 Id_B : constant Entity_Id := Base_Type (Id);
19890 Full_B : Entity_Id := Full_View (Id_B);
19894 if Present (Full_B) then
19896 -- Get to the underlying full view if necessary
19898 if Is_Private_Type (Full_B)
19899 and then Present (Underlying_Full_View (Full_B))
19901 Full_B := Underlying_Full_View (Full_B);
19904 -- The Base_Type is already completed, we can complete the subtype
19905 -- now. We have to create a new entity with the same name, Thus we
19906 -- can't use Create_Itype.
19908 Full := Make_Defining_Identifier (Sloc (Id), Chars (Id));
19909 Set_Is_Itype (Full);
19910 Set_Associated_Node_For_Itype (Full, Related_Nod);
19911 Complete_Private_Subtype (Id, Full, Full_B, Related_Nod);
19914 -- The parent subtype may be private, but the base might not, in some
19915 -- nested instances. In that case, the subtype does not need to be
19916 -- exchanged. It would still be nice to make private subtypes and their
19917 -- bases consistent at all times ???
19919 if Is_Private_Type (Id_B) then
19920 Append_Elmt (Id, Private_Dependents (Id_B));
19922 end Prepare_Private_Subtype_Completion;
19924 ---------------------------
19925 -- Process_Discriminants --
19926 ---------------------------
19928 procedure Process_Discriminants
19930 Prev : Entity_Id := Empty)
19932 Elist : constant Elist_Id := New_Elmt_List;
19935 Discr_Number : Uint;
19936 Discr_Type : Entity_Id;
19937 Default_Present : Boolean := False;
19938 Default_Not_Present : Boolean := False;
19941 -- A composite type other than an array type can have discriminants.
19942 -- On entry, the current scope is the composite type.
19944 -- The discriminants are initially entered into the scope of the type
19945 -- via Enter_Name with the default Ekind of E_Void to prevent premature
19946 -- use, as explained at the end of this procedure.
19948 Discr := First (Discriminant_Specifications (N));
19949 while Present (Discr) loop
19950 Enter_Name (Defining_Identifier (Discr));
19952 -- For navigation purposes we add a reference to the discriminant
19953 -- in the entity for the type. If the current declaration is a
19954 -- completion, place references on the partial view. Otherwise the
19955 -- type is the current scope.
19957 if Present (Prev) then
19959 -- The references go on the partial view, if present. If the
19960 -- partial view has discriminants, the references have been
19961 -- generated already.
19963 if not Has_Discriminants (Prev) then
19964 Generate_Reference (Prev, Defining_Identifier (Discr), 'd');
19968 (Current_Scope, Defining_Identifier (Discr), 'd');
19971 if Nkind (Discriminant_Type (Discr)) = N_Access_Definition then
19972 Discr_Type := Access_Definition (Discr, Discriminant_Type (Discr));
19974 -- Ada 2005 (AI-254)
19976 if Present (Access_To_Subprogram_Definition
19977 (Discriminant_Type (Discr)))
19978 and then Protected_Present (Access_To_Subprogram_Definition
19979 (Discriminant_Type (Discr)))
19982 Replace_Anonymous_Access_To_Protected_Subprogram (Discr);
19986 Find_Type (Discriminant_Type (Discr));
19987 Discr_Type := Etype (Discriminant_Type (Discr));
19989 if Error_Posted (Discriminant_Type (Discr)) then
19990 Discr_Type := Any_Type;
19994 -- Handling of discriminants that are access types
19996 if Is_Access_Type (Discr_Type) then
19998 -- Ada 2005 (AI-230): Access discriminant allowed in non-
19999 -- limited record types
20001 if Ada_Version < Ada_2005 then
20002 Check_Access_Discriminant_Requires_Limited
20003 (Discr, Discriminant_Type (Discr));
20006 if Ada_Version = Ada_83 and then Comes_From_Source (Discr) then
20008 ("(Ada 83) access discriminant not allowed", Discr);
20011 -- If not access type, must be a discrete type
20013 elsif not Is_Discrete_Type (Discr_Type) then
20015 ("discriminants must have a discrete or access type",
20016 Discriminant_Type (Discr));
20019 Set_Etype (Defining_Identifier (Discr), Discr_Type);
20021 -- If a discriminant specification includes the assignment compound
20022 -- delimiter followed by an expression, the expression is the default
20023 -- expression of the discriminant; the default expression must be of
20024 -- the type of the discriminant. (RM 3.7.1) Since this expression is
20025 -- a default expression, we do the special preanalysis, since this
20026 -- expression does not freeze (see section "Handling of Default and
20027 -- Per-Object Expressions" in spec of package Sem).
20029 if Present (Expression (Discr)) then
20030 Preanalyze_Spec_Expression (Expression (Discr), Discr_Type);
20034 if Nkind (N) = N_Formal_Type_Declaration then
20036 ("discriminant defaults not allowed for formal type",
20037 Expression (Discr));
20039 -- Flag an error for a tagged type with defaulted discriminants,
20040 -- excluding limited tagged types when compiling for Ada 2012
20041 -- (see AI05-0214).
20043 elsif Is_Tagged_Type (Current_Scope)
20044 and then (not Is_Limited_Type (Current_Scope)
20045 or else Ada_Version < Ada_2012)
20046 and then Comes_From_Source (N)
20048 -- Note: see similar test in Check_Or_Process_Discriminants, to
20049 -- handle the (illegal) case of the completion of an untagged
20050 -- view with discriminants with defaults by a tagged full view.
20051 -- We skip the check if Discr does not come from source, to
20052 -- account for the case of an untagged derived type providing
20053 -- defaults for a renamed discriminant from a private untagged
20054 -- ancestor with a tagged full view (ACATS B460006).
20056 if Ada_Version >= Ada_2012 then
20058 ("discriminants of nonlimited tagged type cannot have"
20060 Expression (Discr));
20063 ("discriminants of tagged type cannot have defaults",
20064 Expression (Discr));
20068 Default_Present := True;
20069 Append_Elmt (Expression (Discr), Elist);
20071 -- Tag the defining identifiers for the discriminants with
20072 -- their corresponding default expressions from the tree.
20074 Set_Discriminant_Default_Value
20075 (Defining_Identifier (Discr), Expression (Discr));
20078 -- In gnatc or gnatprove mode, make sure set Do_Range_Check flag
20079 -- gets set unless we can be sure that no range check is required.
20081 if (GNATprove_Mode or not Expander_Active)
20084 (Expression (Discr), Discr_Type, Assume_Valid => True)
20086 Set_Do_Range_Check (Expression (Discr));
20089 -- No default discriminant value given
20092 Default_Not_Present := True;
20095 -- Ada 2005 (AI-231): Create an Itype that is a duplicate of
20096 -- Discr_Type but with the null-exclusion attribute
20098 if Ada_Version >= Ada_2005 then
20100 -- Ada 2005 (AI-231): Static checks
20102 if Can_Never_Be_Null (Discr_Type) then
20103 Null_Exclusion_Static_Checks (Discr);
20105 elsif Is_Access_Type (Discr_Type)
20106 and then Null_Exclusion_Present (Discr)
20108 -- No need to check itypes because in their case this check
20109 -- was done at their point of creation
20111 and then not Is_Itype (Discr_Type)
20113 if Can_Never_Be_Null (Discr_Type) then
20115 ("`NOT NULL` not allowed (& already excludes null)",
20120 Set_Etype (Defining_Identifier (Discr),
20121 Create_Null_Excluding_Itype
20123 Related_Nod => Discr));
20125 -- Check for improper null exclusion if the type is otherwise
20126 -- legal for a discriminant.
20128 elsif Null_Exclusion_Present (Discr)
20129 and then Is_Discrete_Type (Discr_Type)
20132 ("null exclusion can only apply to an access type", Discr);
20135 -- Ada 2005 (AI-402): access discriminants of nonlimited types
20136 -- can't have defaults. Synchronized types, or types that are
20137 -- explicitly limited are fine, but special tests apply to derived
20138 -- types in generics: in a generic body we have to assume the
20139 -- worst, and therefore defaults are not allowed if the parent is
20140 -- a generic formal private type (see ACATS B370001).
20142 if Is_Access_Type (Discr_Type) and then Default_Present then
20143 if Ekind (Discr_Type) /= E_Anonymous_Access_Type
20144 or else Is_Limited_Record (Current_Scope)
20145 or else Is_Concurrent_Type (Current_Scope)
20146 or else Is_Concurrent_Record_Type (Current_Scope)
20147 or else Ekind (Current_Scope) = E_Limited_Private_Type
20149 if not Is_Derived_Type (Current_Scope)
20150 or else not Is_Generic_Type (Etype (Current_Scope))
20151 or else not In_Package_Body (Scope (Etype (Current_Scope)))
20152 or else Limited_Present
20153 (Type_Definition (Parent (Current_Scope)))
20159 ("access discriminants of nonlimited types cannot "
20160 & "have defaults", Expression (Discr));
20163 elsif Present (Expression (Discr)) then
20165 ("(Ada 2005) access discriminants of nonlimited types "
20166 & "cannot have defaults", Expression (Discr));
20171 -- A discriminant cannot be effectively volatile (SPARK RM 7.1.3(4)).
20172 -- This check is relevant only when SPARK_Mode is on as it is not a
20173 -- standard Ada legality rule.
20176 and then Is_Effectively_Volatile (Defining_Identifier (Discr))
20178 Error_Msg_N ("discriminant cannot be volatile", Discr);
20184 -- An element list consisting of the default expressions of the
20185 -- discriminants is constructed in the above loop and used to set
20186 -- the Discriminant_Constraint attribute for the type. If an object
20187 -- is declared of this (record or task) type without any explicit
20188 -- discriminant constraint given, this element list will form the
20189 -- actual parameters for the corresponding initialization procedure
20192 Set_Discriminant_Constraint (Current_Scope, Elist);
20193 Set_Stored_Constraint (Current_Scope, No_Elist);
20195 -- Default expressions must be provided either for all or for none
20196 -- of the discriminants of a discriminant part. (RM 3.7.1)
20198 if Default_Present and then Default_Not_Present then
20200 ("incomplete specification of defaults for discriminants", N);
20203 -- The use of the name of a discriminant is not allowed in default
20204 -- expressions of a discriminant part if the specification of the
20205 -- discriminant is itself given in the discriminant part. (RM 3.7.1)
20207 -- To detect this, the discriminant names are entered initially with an
20208 -- Ekind of E_Void (which is the default Ekind given by Enter_Name). Any
20209 -- attempt to use a void entity (for example in an expression that is
20210 -- type-checked) produces the error message: premature usage. Now after
20211 -- completing the semantic analysis of the discriminant part, we can set
20212 -- the Ekind of all the discriminants appropriately.
20214 Discr := First (Discriminant_Specifications (N));
20215 Discr_Number := Uint_1;
20216 while Present (Discr) loop
20217 Id := Defining_Identifier (Discr);
20218 Set_Ekind (Id, E_Discriminant);
20219 Init_Component_Location (Id);
20221 Set_Discriminant_Number (Id, Discr_Number);
20223 -- Make sure this is always set, even in illegal programs
20225 Set_Corresponding_Discriminant (Id, Empty);
20227 -- Initialize the Original_Record_Component to the entity itself.
20228 -- Inherit_Components will propagate the right value to
20229 -- discriminants in derived record types.
20231 Set_Original_Record_Component (Id, Id);
20233 -- Create the discriminal for the discriminant
20235 Build_Discriminal (Id);
20238 Discr_Number := Discr_Number + 1;
20241 Set_Has_Discriminants (Current_Scope);
20242 end Process_Discriminants;
20244 -----------------------
20245 -- Process_Full_View --
20246 -----------------------
20248 -- WARNING: This routine manages Ghost regions. Return statements must be
20249 -- replaced by gotos which jump to the end of the routine and restore the
20252 procedure Process_Full_View (N : Node_Id; Full_T, Priv_T : Entity_Id) is
20253 procedure Collect_Implemented_Interfaces
20255 Ifaces : Elist_Id);
20256 -- Ada 2005: Gather all the interfaces that Typ directly or
20257 -- inherently implements. Duplicate entries are not added to
20258 -- the list Ifaces.
20260 ------------------------------------
20261 -- Collect_Implemented_Interfaces --
20262 ------------------------------------
20264 procedure Collect_Implemented_Interfaces
20269 Iface_Elmt : Elmt_Id;
20272 -- Abstract interfaces are only associated with tagged record types
20274 if not Is_Tagged_Type (Typ) or else not Is_Record_Type (Typ) then
20278 -- Recursively climb to the ancestors
20280 if Etype (Typ) /= Typ
20282 -- Protect the frontend against wrong cyclic declarations like:
20284 -- type B is new A with private;
20285 -- type C is new A with private;
20287 -- type B is new C with null record;
20288 -- type C is new B with null record;
20290 and then Etype (Typ) /= Priv_T
20291 and then Etype (Typ) /= Full_T
20293 -- Keep separate the management of private type declarations
20295 if Ekind (Typ) = E_Record_Type_With_Private then
20297 -- Handle the following illegal usage:
20298 -- type Private_Type is tagged private;
20300 -- type Private_Type is new Type_Implementing_Iface;
20302 if Present (Full_View (Typ))
20303 and then Etype (Typ) /= Full_View (Typ)
20305 if Is_Interface (Etype (Typ)) then
20306 Append_Unique_Elmt (Etype (Typ), Ifaces);
20309 Collect_Implemented_Interfaces (Etype (Typ), Ifaces);
20312 -- Non-private types
20315 if Is_Interface (Etype (Typ)) then
20316 Append_Unique_Elmt (Etype (Typ), Ifaces);
20319 Collect_Implemented_Interfaces (Etype (Typ), Ifaces);
20323 -- Handle entities in the list of abstract interfaces
20325 if Present (Interfaces (Typ)) then
20326 Iface_Elmt := First_Elmt (Interfaces (Typ));
20327 while Present (Iface_Elmt) loop
20328 Iface := Node (Iface_Elmt);
20330 pragma Assert (Is_Interface (Iface));
20332 if not Contain_Interface (Iface, Ifaces) then
20333 Append_Elmt (Iface, Ifaces);
20334 Collect_Implemented_Interfaces (Iface, Ifaces);
20337 Next_Elmt (Iface_Elmt);
20340 end Collect_Implemented_Interfaces;
20344 Saved_GM : constant Ghost_Mode_Type := Ghost_Mode;
20345 Saved_IGR : constant Node_Id := Ignored_Ghost_Region;
20346 -- Save the Ghost-related attributes to restore on exit
20348 Full_Indic : Node_Id;
20349 Full_Parent : Entity_Id;
20350 Priv_Parent : Entity_Id;
20352 -- Start of processing for Process_Full_View
20355 Mark_And_Set_Ghost_Completion (N, Priv_T);
20357 -- First some sanity checks that must be done after semantic
20358 -- decoration of the full view and thus cannot be placed with other
20359 -- similar checks in Find_Type_Name
20361 if not Is_Limited_Type (Priv_T)
20362 and then (Is_Limited_Type (Full_T)
20363 or else Is_Limited_Composite (Full_T))
20365 if In_Instance then
20369 ("completion of nonlimited type cannot be limited", Full_T);
20370 Explain_Limited_Type (Full_T, Full_T);
20373 elsif Is_Abstract_Type (Full_T)
20374 and then not Is_Abstract_Type (Priv_T)
20377 ("completion of nonabstract type cannot be abstract", Full_T);
20379 elsif Is_Tagged_Type (Priv_T)
20380 and then Is_Limited_Type (Priv_T)
20381 and then not Is_Limited_Type (Full_T)
20383 -- If pragma CPP_Class was applied to the private declaration
20384 -- propagate the limitedness to the full-view
20386 if Is_CPP_Class (Priv_T) then
20387 Set_Is_Limited_Record (Full_T);
20389 -- GNAT allow its own definition of Limited_Controlled to disobey
20390 -- this rule in order in ease the implementation. This test is safe
20391 -- because Root_Controlled is defined in a child of System that
20392 -- normal programs are not supposed to use.
20394 elsif Is_RTE (Etype (Full_T), RE_Root_Controlled) then
20395 Set_Is_Limited_Composite (Full_T);
20398 ("completion of limited tagged type must be limited", Full_T);
20401 elsif Is_Generic_Type (Priv_T) then
20402 Error_Msg_N ("generic type cannot have a completion", Full_T);
20405 -- Check that ancestor interfaces of private and full views are
20406 -- consistent. We omit this check for synchronized types because
20407 -- they are performed on the corresponding record type when frozen.
20409 if Ada_Version >= Ada_2005
20410 and then Is_Tagged_Type (Priv_T)
20411 and then Is_Tagged_Type (Full_T)
20412 and then not Is_Concurrent_Type (Full_T)
20416 Priv_T_Ifaces : constant Elist_Id := New_Elmt_List;
20417 Full_T_Ifaces : constant Elist_Id := New_Elmt_List;
20420 Collect_Implemented_Interfaces (Priv_T, Priv_T_Ifaces);
20421 Collect_Implemented_Interfaces (Full_T, Full_T_Ifaces);
20423 -- Ada 2005 (AI-251): The partial view shall be a descendant of
20424 -- an interface type if and only if the full type is descendant
20425 -- of the interface type (AARM 7.3 (7.3/2)).
20427 Iface := Find_Hidden_Interface (Priv_T_Ifaces, Full_T_Ifaces);
20429 if Present (Iface) then
20431 ("interface in partial view& not implemented by full type "
20432 & "(RM-2005 7.3 (7.3/2))", Full_T, Iface);
20435 Iface := Find_Hidden_Interface (Full_T_Ifaces, Priv_T_Ifaces);
20437 if Present (Iface) then
20439 ("interface & not implemented by partial view "
20440 & "(RM-2005 7.3 (7.3/2))", Full_T, Iface);
20445 if Is_Tagged_Type (Priv_T)
20446 and then Nkind (Parent (Priv_T)) = N_Private_Extension_Declaration
20447 and then Is_Derived_Type (Full_T)
20449 Priv_Parent := Etype (Priv_T);
20451 -- The full view of a private extension may have been transformed
20452 -- into an unconstrained derived type declaration and a subtype
20453 -- declaration (see build_derived_record_type for details).
20455 if Nkind (N) = N_Subtype_Declaration then
20456 Full_Indic := Subtype_Indication (N);
20457 Full_Parent := Etype (Base_Type (Full_T));
20459 Full_Indic := Subtype_Indication (Type_Definition (N));
20460 Full_Parent := Etype (Full_T);
20463 -- Check that the parent type of the full type is a descendant of
20464 -- the ancestor subtype given in the private extension. If either
20465 -- entity has an Etype equal to Any_Type then we had some previous
20466 -- error situation [7.3(8)].
20468 if Priv_Parent = Any_Type or else Full_Parent = Any_Type then
20471 -- Ada 2005 (AI-251): Interfaces in the full type can be given in
20472 -- any order. Therefore we don't have to check that its parent must
20473 -- be a descendant of the parent of the private type declaration.
20475 elsif Is_Interface (Priv_Parent)
20476 and then Is_Interface (Full_Parent)
20480 -- Ada 2005 (AI-251): If the parent of the private type declaration
20481 -- is an interface there is no need to check that it is an ancestor
20482 -- of the associated full type declaration. The required tests for
20483 -- this case are performed by Build_Derived_Record_Type.
20485 elsif not Is_Interface (Base_Type (Priv_Parent))
20486 and then not Is_Ancestor (Base_Type (Priv_Parent), Full_Parent)
20489 ("parent of full type must descend from parent of private "
20490 & "extension", Full_Indic);
20492 -- First check a formal restriction, and then proceed with checking
20493 -- Ada rules. Since the formal restriction is not a serious error, we
20494 -- don't prevent further error detection for this check, hence the
20498 -- In formal mode, when completing a private extension the type
20499 -- named in the private part must be exactly the same as that
20500 -- named in the visible part.
20502 if Priv_Parent /= Full_Parent then
20503 Error_Msg_Name_1 := Chars (Priv_Parent);
20504 Check_SPARK_05_Restriction ("% expected", Full_Indic);
20507 -- Check the rules of 7.3(10): if the private extension inherits
20508 -- known discriminants, then the full type must also inherit those
20509 -- discriminants from the same (ancestor) type, and the parent
20510 -- subtype of the full type must be constrained if and only if
20511 -- the ancestor subtype of the private extension is constrained.
20513 if No (Discriminant_Specifications (Parent (Priv_T)))
20514 and then not Has_Unknown_Discriminants (Priv_T)
20515 and then Has_Discriminants (Base_Type (Priv_Parent))
20518 Priv_Indic : constant Node_Id :=
20519 Subtype_Indication (Parent (Priv_T));
20521 Priv_Constr : constant Boolean :=
20522 Is_Constrained (Priv_Parent)
20524 Nkind (Priv_Indic) = N_Subtype_Indication
20526 Is_Constrained (Entity (Priv_Indic));
20528 Full_Constr : constant Boolean :=
20529 Is_Constrained (Full_Parent)
20531 Nkind (Full_Indic) = N_Subtype_Indication
20533 Is_Constrained (Entity (Full_Indic));
20535 Priv_Discr : Entity_Id;
20536 Full_Discr : Entity_Id;
20539 Priv_Discr := First_Discriminant (Priv_Parent);
20540 Full_Discr := First_Discriminant (Full_Parent);
20541 while Present (Priv_Discr) and then Present (Full_Discr) loop
20542 if Original_Record_Component (Priv_Discr) =
20543 Original_Record_Component (Full_Discr)
20545 Corresponding_Discriminant (Priv_Discr) =
20546 Corresponding_Discriminant (Full_Discr)
20553 Next_Discriminant (Priv_Discr);
20554 Next_Discriminant (Full_Discr);
20557 if Present (Priv_Discr) or else Present (Full_Discr) then
20559 ("full view must inherit discriminants of the parent "
20560 & "type used in the private extension", Full_Indic);
20562 elsif Priv_Constr and then not Full_Constr then
20564 ("parent subtype of full type must be constrained",
20567 elsif Full_Constr and then not Priv_Constr then
20569 ("parent subtype of full type must be unconstrained",
20574 -- Check the rules of 7.3(12): if a partial view has neither
20575 -- known or unknown discriminants, then the full type
20576 -- declaration shall define a definite subtype.
20578 elsif not Has_Unknown_Discriminants (Priv_T)
20579 and then not Has_Discriminants (Priv_T)
20580 and then not Is_Constrained (Full_T)
20583 ("full view must define a constrained type if partial view "
20584 & "has no discriminants", Full_T);
20587 -- ??????? Do we implement the following properly ?????
20588 -- If the ancestor subtype of a private extension has constrained
20589 -- discriminants, then the parent subtype of the full view shall
20590 -- impose a statically matching constraint on those discriminants
20595 -- For untagged types, verify that a type without discriminants is
20596 -- not completed with an unconstrained type. A separate error message
20597 -- is produced if the full type has defaulted discriminants.
20599 if Is_Definite_Subtype (Priv_T)
20600 and then not Is_Definite_Subtype (Full_T)
20602 Error_Msg_Sloc := Sloc (Parent (Priv_T));
20604 ("full view of& not compatible with declaration#",
20607 if not Is_Tagged_Type (Full_T) then
20609 ("\one is constrained, the other unconstrained", Full_T);
20614 -- AI-419: verify that the use of "limited" is consistent
20617 Orig_Decl : constant Node_Id := Original_Node (N);
20620 if Nkind (Parent (Priv_T)) = N_Private_Extension_Declaration
20621 and then Nkind (Orig_Decl) = N_Full_Type_Declaration
20623 (Type_Definition (Orig_Decl)) = N_Derived_Type_Definition
20625 if not Limited_Present (Parent (Priv_T))
20626 and then not Synchronized_Present (Parent (Priv_T))
20627 and then Limited_Present (Type_Definition (Orig_Decl))
20630 ("full view of non-limited extension cannot be limited", N);
20632 -- Conversely, if the partial view carries the limited keyword,
20633 -- the full view must as well, even if it may be redundant.
20635 elsif Limited_Present (Parent (Priv_T))
20636 and then not Limited_Present (Type_Definition (Orig_Decl))
20639 ("full view of limited extension must be explicitly limited",
20645 -- Ada 2005 (AI-443): A synchronized private extension must be
20646 -- completed by a task or protected type.
20648 if Ada_Version >= Ada_2005
20649 and then Nkind (Parent (Priv_T)) = N_Private_Extension_Declaration
20650 and then Synchronized_Present (Parent (Priv_T))
20651 and then not Is_Concurrent_Type (Full_T)
20653 Error_Msg_N ("full view of synchronized extension must " &
20654 "be synchronized type", N);
20657 -- Ada 2005 AI-363: if the full view has discriminants with
20658 -- defaults, it is illegal to declare constrained access subtypes
20659 -- whose designated type is the current type. This allows objects
20660 -- of the type that are declared in the heap to be unconstrained.
20662 if not Has_Unknown_Discriminants (Priv_T)
20663 and then not Has_Discriminants (Priv_T)
20664 and then Has_Discriminants (Full_T)
20666 Present (Discriminant_Default_Value (First_Discriminant (Full_T)))
20668 Set_Has_Constrained_Partial_View (Full_T);
20669 Set_Has_Constrained_Partial_View (Priv_T);
20672 -- Create a full declaration for all its subtypes recorded in
20673 -- Private_Dependents and swap them similarly to the base type. These
20674 -- are subtypes that have been define before the full declaration of
20675 -- the private type. We also swap the entry in Private_Dependents list
20676 -- so we can properly restore the private view on exit from the scope.
20679 Priv_Elmt : Elmt_Id;
20680 Priv_Scop : Entity_Id;
20685 Priv_Elmt := First_Elmt (Private_Dependents (Priv_T));
20686 while Present (Priv_Elmt) loop
20687 Priv := Node (Priv_Elmt);
20688 Priv_Scop := Scope (Priv);
20690 if Ekind_In (Priv, E_Private_Subtype,
20691 E_Limited_Private_Subtype,
20692 E_Record_Subtype_With_Private)
20694 Full := Make_Defining_Identifier (Sloc (Priv), Chars (Priv));
20695 Set_Is_Itype (Full);
20696 Set_Parent (Full, Parent (Priv));
20697 Set_Associated_Node_For_Itype (Full, N);
20699 -- Now we need to complete the private subtype, but since the
20700 -- base type has already been swapped, we must also swap the
20701 -- subtypes (and thus, reverse the arguments in the call to
20702 -- Complete_Private_Subtype). Also note that we may need to
20703 -- re-establish the scope of the private subtype.
20705 Copy_And_Swap (Priv, Full);
20707 if not In_Open_Scopes (Priv_Scop) then
20708 Push_Scope (Priv_Scop);
20711 -- Reset Priv_Scop to Empty to indicate no scope was pushed
20713 Priv_Scop := Empty;
20716 Complete_Private_Subtype (Full, Priv, Full_T, N);
20718 if Present (Priv_Scop) then
20722 Replace_Elmt (Priv_Elmt, Full);
20725 Next_Elmt (Priv_Elmt);
20729 -- If the private view was tagged, copy the new primitive operations
20730 -- from the private view to the full view.
20732 if Is_Tagged_Type (Full_T) then
20734 Disp_Typ : Entity_Id;
20735 Full_List : Elist_Id;
20737 Prim_Elmt : Elmt_Id;
20738 Priv_List : Elist_Id;
20742 L : Elist_Id) return Boolean;
20743 -- Determine whether list L contains element E
20751 L : Elist_Id) return Boolean
20753 List_Elmt : Elmt_Id;
20756 List_Elmt := First_Elmt (L);
20757 while Present (List_Elmt) loop
20758 if Node (List_Elmt) = E then
20762 Next_Elmt (List_Elmt);
20768 -- Start of processing
20771 if Is_Tagged_Type (Priv_T) then
20772 Priv_List := Primitive_Operations (Priv_T);
20773 Prim_Elmt := First_Elmt (Priv_List);
20775 -- In the case of a concurrent type completing a private tagged
20776 -- type, primitives may have been declared in between the two
20777 -- views. These subprograms need to be wrapped the same way
20778 -- entries and protected procedures are handled because they
20779 -- cannot be directly shared by the two views.
20781 if Is_Concurrent_Type (Full_T) then
20783 Conc_Typ : constant Entity_Id :=
20784 Corresponding_Record_Type (Full_T);
20785 Curr_Nod : Node_Id := Parent (Conc_Typ);
20786 Wrap_Spec : Node_Id;
20789 while Present (Prim_Elmt) loop
20790 Prim := Node (Prim_Elmt);
20792 if Comes_From_Source (Prim)
20793 and then not Is_Abstract_Subprogram (Prim)
20796 Make_Subprogram_Declaration (Sloc (Prim),
20800 Obj_Typ => Conc_Typ,
20802 Parameter_Specifications
20805 Insert_After (Curr_Nod, Wrap_Spec);
20806 Curr_Nod := Wrap_Spec;
20808 Analyze (Wrap_Spec);
20810 -- Remove the wrapper from visibility to avoid
20811 -- spurious conflict with the wrapped entity.
20813 Set_Is_Immediately_Visible
20814 (Defining_Entity (Specification (Wrap_Spec)),
20818 Next_Elmt (Prim_Elmt);
20824 -- For non-concurrent types, transfer explicit primitives, but
20825 -- omit those inherited from the parent of the private view
20826 -- since they will be re-inherited later on.
20829 Full_List := Primitive_Operations (Full_T);
20830 while Present (Prim_Elmt) loop
20831 Prim := Node (Prim_Elmt);
20833 if Comes_From_Source (Prim)
20834 and then not Contains (Prim, Full_List)
20836 Append_Elmt (Prim, Full_List);
20839 Next_Elmt (Prim_Elmt);
20843 -- Untagged private view
20846 Full_List := Primitive_Operations (Full_T);
20848 -- In this case the partial view is untagged, so here we locate
20849 -- all of the earlier primitives that need to be treated as
20850 -- dispatching (those that appear between the two views). Note
20851 -- that these additional operations must all be new operations
20852 -- (any earlier operations that override inherited operations
20853 -- of the full view will already have been inserted in the
20854 -- primitives list, marked by Check_Operation_From_Private_View
20855 -- as dispatching. Note that implicit "/=" operators are
20856 -- excluded from being added to the primitives list since they
20857 -- shouldn't be treated as dispatching (tagged "/=" is handled
20860 Prim := Next_Entity (Full_T);
20861 while Present (Prim) and then Prim /= Priv_T loop
20862 if Ekind_In (Prim, E_Procedure, E_Function) then
20863 Disp_Typ := Find_Dispatching_Type (Prim);
20865 if Disp_Typ = Full_T
20866 and then (Chars (Prim) /= Name_Op_Ne
20867 or else Comes_From_Source (Prim))
20869 Check_Controlling_Formals (Full_T, Prim);
20871 if Is_Suitable_Primitive (Prim)
20872 and then not Is_Dispatching_Operation (Prim)
20874 Append_Elmt (Prim, Full_List);
20875 Set_Is_Dispatching_Operation (Prim);
20876 Set_DT_Position_Value (Prim, No_Uint);
20879 elsif Is_Dispatching_Operation (Prim)
20880 and then Disp_Typ /= Full_T
20882 -- Verify that it is not otherwise controlled by a
20883 -- formal or a return value of type T.
20885 Check_Controlling_Formals (Disp_Typ, Prim);
20889 Next_Entity (Prim);
20893 -- For the tagged case, the two views can share the same primitive
20894 -- operations list and the same class-wide type. Update attributes
20895 -- of the class-wide type which depend on the full declaration.
20897 if Is_Tagged_Type (Priv_T) then
20898 Set_Direct_Primitive_Operations (Priv_T, Full_List);
20899 Set_Class_Wide_Type
20900 (Base_Type (Full_T), Class_Wide_Type (Priv_T));
20902 Propagate_Concurrent_Flags (Class_Wide_Type (Priv_T), Full_T);
20907 -- Ada 2005 AI 161: Check preelaborable initialization consistency
20909 if Known_To_Have_Preelab_Init (Priv_T) then
20911 -- Case where there is a pragma Preelaborable_Initialization. We
20912 -- always allow this in predefined units, which is cheating a bit,
20913 -- but it means we don't have to struggle to meet the requirements in
20914 -- the RM for having Preelaborable Initialization. Otherwise we
20915 -- require that the type meets the RM rules. But we can't check that
20916 -- yet, because of the rule about overriding Initialize, so we simply
20917 -- set a flag that will be checked at freeze time.
20919 if not In_Predefined_Unit (Full_T) then
20920 Set_Must_Have_Preelab_Init (Full_T);
20924 -- If pragma CPP_Class was applied to the private type declaration,
20925 -- propagate it now to the full type declaration.
20927 if Is_CPP_Class (Priv_T) then
20928 Set_Is_CPP_Class (Full_T);
20929 Set_Convention (Full_T, Convention_CPP);
20931 -- Check that components of imported CPP types do not have default
20934 Check_CPP_Type_Has_No_Defaults (Full_T);
20937 -- If the private view has user specified stream attributes, then so has
20940 -- Why the test, how could these flags be already set in Full_T ???
20942 if Has_Specified_Stream_Read (Priv_T) then
20943 Set_Has_Specified_Stream_Read (Full_T);
20946 if Has_Specified_Stream_Write (Priv_T) then
20947 Set_Has_Specified_Stream_Write (Full_T);
20950 if Has_Specified_Stream_Input (Priv_T) then
20951 Set_Has_Specified_Stream_Input (Full_T);
20954 if Has_Specified_Stream_Output (Priv_T) then
20955 Set_Has_Specified_Stream_Output (Full_T);
20958 -- Propagate Default_Initial_Condition-related attributes from the
20959 -- partial view to the full view and its base type.
20961 Propagate_DIC_Attributes (Full_T, From_Typ => Priv_T);
20962 Propagate_DIC_Attributes (Base_Type (Full_T), From_Typ => Priv_T);
20964 -- Propagate invariant-related attributes from the partial view to the
20965 -- full view and its base type.
20967 Propagate_Invariant_Attributes (Full_T, From_Typ => Priv_T);
20968 Propagate_Invariant_Attributes (Base_Type (Full_T), From_Typ => Priv_T);
20970 -- AI12-0041: Detect an attempt to inherit a class-wide type invariant
20971 -- in the full view without advertising the inheritance in the partial
20972 -- view. This can only occur when the partial view has no parent type
20973 -- and the full view has an interface as a parent. Any other scenarios
20974 -- are illegal because implemented interfaces must match between the
20977 if Is_Tagged_Type (Priv_T) and then Is_Tagged_Type (Full_T) then
20979 Full_Par : constant Entity_Id := Etype (Full_T);
20980 Priv_Par : constant Entity_Id := Etype (Priv_T);
20983 if not Is_Interface (Priv_Par)
20984 and then Is_Interface (Full_Par)
20985 and then Has_Inheritable_Invariants (Full_Par)
20988 ("hidden inheritance of class-wide type invariants not "
20994 -- Propagate predicates to full type, and predicate function if already
20995 -- defined. It is not clear that this can actually happen? the partial
20996 -- view cannot be frozen yet, and the predicate function has not been
20997 -- built. Still it is a cheap check and seems safer to make it.
20999 if Has_Predicates (Priv_T) then
21000 Set_Has_Predicates (Full_T);
21002 if Present (Predicate_Function (Priv_T)) then
21003 Set_Predicate_Function (Full_T, Predicate_Function (Priv_T));
21008 Restore_Ghost_Region (Saved_GM, Saved_IGR);
21009 end Process_Full_View;
21011 -----------------------------------
21012 -- Process_Incomplete_Dependents --
21013 -----------------------------------
21015 procedure Process_Incomplete_Dependents
21017 Full_T : Entity_Id;
21020 Inc_Elmt : Elmt_Id;
21021 Priv_Dep : Entity_Id;
21022 New_Subt : Entity_Id;
21024 Disc_Constraint : Elist_Id;
21027 if No (Private_Dependents (Inc_T)) then
21031 -- Itypes that may be generated by the completion of an incomplete
21032 -- subtype are not used by the back-end and not attached to the tree.
21033 -- They are created only for constraint-checking purposes.
21035 Inc_Elmt := First_Elmt (Private_Dependents (Inc_T));
21036 while Present (Inc_Elmt) loop
21037 Priv_Dep := Node (Inc_Elmt);
21039 if Ekind (Priv_Dep) = E_Subprogram_Type then
21041 -- An Access_To_Subprogram type may have a return type or a
21042 -- parameter type that is incomplete. Replace with the full view.
21044 if Etype (Priv_Dep) = Inc_T then
21045 Set_Etype (Priv_Dep, Full_T);
21049 Formal : Entity_Id;
21052 Formal := First_Formal (Priv_Dep);
21053 while Present (Formal) loop
21054 if Etype (Formal) = Inc_T then
21055 Set_Etype (Formal, Full_T);
21058 Next_Formal (Formal);
21062 elsif Is_Overloadable (Priv_Dep) then
21064 -- If a subprogram in the incomplete dependents list is primitive
21065 -- for a tagged full type then mark it as a dispatching operation,
21066 -- check whether it overrides an inherited subprogram, and check
21067 -- restrictions on its controlling formals. Note that a protected
21068 -- operation is never dispatching: only its wrapper operation
21069 -- (which has convention Ada) is.
21071 if Is_Tagged_Type (Full_T)
21072 and then Is_Primitive (Priv_Dep)
21073 and then Convention (Priv_Dep) /= Convention_Protected
21075 Check_Operation_From_Incomplete_Type (Priv_Dep, Inc_T);
21076 Set_Is_Dispatching_Operation (Priv_Dep);
21077 Check_Controlling_Formals (Full_T, Priv_Dep);
21080 elsif Ekind (Priv_Dep) = E_Subprogram_Body then
21082 -- Can happen during processing of a body before the completion
21083 -- of a TA type. Ignore, because spec is also on dependent list.
21087 -- Ada 2005 (AI-412): Transform a regular incomplete subtype into a
21088 -- corresponding subtype of the full view.
21090 elsif Ekind (Priv_Dep) = E_Incomplete_Subtype
21091 and then Comes_From_Source (Priv_Dep)
21093 Set_Subtype_Indication
21094 (Parent (Priv_Dep), New_Occurrence_Of (Full_T, Sloc (Priv_Dep)));
21095 Set_Etype (Priv_Dep, Full_T);
21096 Set_Ekind (Priv_Dep, Subtype_Kind (Ekind (Full_T)));
21097 Set_Analyzed (Parent (Priv_Dep), False);
21099 -- Reanalyze the declaration, suppressing the call to Enter_Name
21100 -- to avoid duplicate names.
21102 Analyze_Subtype_Declaration
21103 (N => Parent (Priv_Dep),
21106 -- Dependent is a subtype
21109 -- We build a new subtype indication using the full view of the
21110 -- incomplete parent. The discriminant constraints have been
21111 -- elaborated already at the point of the subtype declaration.
21113 New_Subt := Create_Itype (E_Void, N);
21115 if Has_Discriminants (Full_T) then
21116 Disc_Constraint := Discriminant_Constraint (Priv_Dep);
21118 Disc_Constraint := No_Elist;
21121 Build_Discriminated_Subtype (Full_T, New_Subt, Disc_Constraint, N);
21122 Set_Full_View (Priv_Dep, New_Subt);
21125 Next_Elmt (Inc_Elmt);
21127 end Process_Incomplete_Dependents;
21129 --------------------------------
21130 -- Process_Range_Expr_In_Decl --
21131 --------------------------------
21133 procedure Process_Range_Expr_In_Decl
21136 Subtyp : Entity_Id := Empty;
21137 Check_List : List_Id := Empty_List;
21138 R_Check_Off : Boolean := False;
21139 In_Iter_Schm : Boolean := False)
21142 R_Checks : Check_Result;
21143 Insert_Node : Node_Id;
21144 Def_Id : Entity_Id;
21147 Analyze_And_Resolve (R, Base_Type (T));
21149 if Nkind (R) = N_Range then
21151 -- In SPARK, all ranges should be static, with the exception of the
21152 -- discrete type definition of a loop parameter specification.
21154 if not In_Iter_Schm
21155 and then not Is_OK_Static_Range (R)
21157 Check_SPARK_05_Restriction ("range should be static", R);
21160 Lo := Low_Bound (R);
21161 Hi := High_Bound (R);
21163 -- Validity checks on the range of a quantified expression are
21164 -- delayed until the construct is transformed into a loop.
21166 if Nkind (Parent (R)) = N_Loop_Parameter_Specification
21167 and then Nkind (Parent (Parent (R))) = N_Quantified_Expression
21171 -- We need to ensure validity of the bounds here, because if we
21172 -- go ahead and do the expansion, then the expanded code will get
21173 -- analyzed with range checks suppressed and we miss the check.
21175 -- WARNING: The capture of the range bounds with xxx_FIRST/_LAST and
21176 -- the temporaries generated by routine Remove_Side_Effects by means
21177 -- of validity checks must use the same names. When a range appears
21178 -- in the parent of a generic, the range is processed with checks
21179 -- disabled as part of the generic context and with checks enabled
21180 -- for code generation purposes. This leads to link issues as the
21181 -- generic contains references to xxx_FIRST/_LAST, but the inlined
21182 -- template sees the temporaries generated by Remove_Side_Effects.
21185 Validity_Check_Range (R, Subtyp);
21188 -- If there were errors in the declaration, try and patch up some
21189 -- common mistakes in the bounds. The cases handled are literals
21190 -- which are Integer where the expected type is Real and vice versa.
21191 -- These corrections allow the compilation process to proceed further
21192 -- along since some basic assumptions of the format of the bounds
21195 if Etype (R) = Any_Type then
21196 if Nkind (Lo) = N_Integer_Literal and then Is_Real_Type (T) then
21198 Make_Real_Literal (Sloc (Lo), UR_From_Uint (Intval (Lo))));
21200 elsif Nkind (Hi) = N_Integer_Literal and then Is_Real_Type (T) then
21202 Make_Real_Literal (Sloc (Hi), UR_From_Uint (Intval (Hi))));
21204 elsif Nkind (Lo) = N_Real_Literal and then Is_Integer_Type (T) then
21206 Make_Integer_Literal (Sloc (Lo), UR_To_Uint (Realval (Lo))));
21208 elsif Nkind (Hi) = N_Real_Literal and then Is_Integer_Type (T) then
21210 Make_Integer_Literal (Sloc (Hi), UR_To_Uint (Realval (Hi))));
21217 -- If the bounds of the range have been mistakenly given as string
21218 -- literals (perhaps in place of character literals), then an error
21219 -- has already been reported, but we rewrite the string literal as a
21220 -- bound of the range's type to avoid blowups in later processing
21221 -- that looks at static values.
21223 if Nkind (Lo) = N_String_Literal then
21225 Make_Attribute_Reference (Sloc (Lo),
21226 Prefix => New_Occurrence_Of (T, Sloc (Lo)),
21227 Attribute_Name => Name_First));
21228 Analyze_And_Resolve (Lo);
21231 if Nkind (Hi) = N_String_Literal then
21233 Make_Attribute_Reference (Sloc (Hi),
21234 Prefix => New_Occurrence_Of (T, Sloc (Hi)),
21235 Attribute_Name => Name_First));
21236 Analyze_And_Resolve (Hi);
21239 -- If bounds aren't scalar at this point then exit, avoiding
21240 -- problems with further processing of the range in this procedure.
21242 if not Is_Scalar_Type (Etype (Lo)) then
21246 -- Resolve (actually Sem_Eval) has checked that the bounds are in
21247 -- then range of the base type. Here we check whether the bounds
21248 -- are in the range of the subtype itself. Note that if the bounds
21249 -- represent the null range the Constraint_Error exception should
21252 -- ??? The following code should be cleaned up as follows
21254 -- 1. The Is_Null_Range (Lo, Hi) test should disappear since it
21255 -- is done in the call to Range_Check (R, T); below
21257 -- 2. The use of R_Check_Off should be investigated and possibly
21258 -- removed, this would clean up things a bit.
21260 if Is_Null_Range (Lo, Hi) then
21264 -- Capture values of bounds and generate temporaries for them
21265 -- if needed, before applying checks, since checks may cause
21266 -- duplication of the expression without forcing evaluation.
21268 -- The forced evaluation removes side effects from expressions,
21269 -- which should occur also in GNATprove mode. Otherwise, we end up
21270 -- with unexpected insertions of actions at places where this is
21271 -- not supposed to occur, e.g. on default parameters of a call.
21273 if Expander_Active or GNATprove_Mode then
21275 -- Call Force_Evaluation to create declarations as needed to
21276 -- deal with side effects, and also create typ_FIRST/LAST
21277 -- entities for bounds if we have a subtype name.
21279 -- Note: we do this transformation even if expansion is not
21280 -- active if we are in GNATprove_Mode since the transformation
21281 -- is in general required to ensure that the resulting tree has
21282 -- proper Ada semantics.
21285 (Lo, Related_Id => Subtyp, Is_Low_Bound => True);
21287 (Hi, Related_Id => Subtyp, Is_High_Bound => True);
21290 -- We use a flag here instead of suppressing checks on the type
21291 -- because the type we check against isn't necessarily the place
21292 -- where we put the check.
21294 if not R_Check_Off then
21295 R_Checks := Get_Range_Checks (R, T);
21297 -- Look up tree to find an appropriate insertion point. We
21298 -- can't just use insert_actions because later processing
21299 -- depends on the insertion node. Prior to Ada 2012 the
21300 -- insertion point could only be a declaration or a loop, but
21301 -- quantified expressions can appear within any context in an
21302 -- expression, and the insertion point can be any statement,
21303 -- pragma, or declaration.
21305 Insert_Node := Parent (R);
21306 while Present (Insert_Node) loop
21308 Nkind (Insert_Node) in N_Declaration
21311 (Insert_Node, N_Component_Declaration,
21312 N_Loop_Parameter_Specification,
21313 N_Function_Specification,
21314 N_Procedure_Specification);
21316 exit when Nkind (Insert_Node) in N_Later_Decl_Item
21317 or else Nkind (Insert_Node) in
21318 N_Statement_Other_Than_Procedure_Call
21319 or else Nkind_In (Insert_Node, N_Procedure_Call_Statement,
21322 Insert_Node := Parent (Insert_Node);
21325 -- Why would Type_Decl not be present??? Without this test,
21326 -- short regression tests fail.
21328 if Present (Insert_Node) then
21330 -- Case of loop statement. Verify that the range is part
21331 -- of the subtype indication of the iteration scheme.
21333 if Nkind (Insert_Node) = N_Loop_Statement then
21338 Indic := Parent (R);
21339 while Present (Indic)
21340 and then Nkind (Indic) /= N_Subtype_Indication
21342 Indic := Parent (Indic);
21345 if Present (Indic) then
21346 Def_Id := Etype (Subtype_Mark (Indic));
21348 Insert_Range_Checks
21352 Sloc (Insert_Node),
21354 Do_Before => True);
21358 -- Insertion before a declaration. If the declaration
21359 -- includes discriminants, the list of applicable checks
21360 -- is given by the caller.
21362 elsif Nkind (Insert_Node) in N_Declaration then
21363 Def_Id := Defining_Identifier (Insert_Node);
21365 if (Ekind (Def_Id) = E_Record_Type
21366 and then Depends_On_Discriminant (R))
21368 (Ekind (Def_Id) = E_Protected_Type
21369 and then Has_Discriminants (Def_Id))
21371 Append_Range_Checks
21373 Check_List, Def_Id, Sloc (Insert_Node), R);
21376 Insert_Range_Checks
21378 Insert_Node, Def_Id, Sloc (Insert_Node), R);
21382 -- Insertion before a statement. Range appears in the
21383 -- context of a quantified expression. Insertion will
21384 -- take place when expression is expanded.
21393 -- Case of other than an explicit N_Range node
21395 -- The forced evaluation removes side effects from expressions, which
21396 -- should occur also in GNATprove mode. Otherwise, we end up with
21397 -- unexpected insertions of actions at places where this is not
21398 -- supposed to occur, e.g. on default parameters of a call.
21400 elsif Expander_Active or GNATprove_Mode then
21401 Get_Index_Bounds (R, Lo, Hi);
21402 Force_Evaluation (Lo);
21403 Force_Evaluation (Hi);
21405 end Process_Range_Expr_In_Decl;
21407 --------------------------------------
21408 -- Process_Real_Range_Specification --
21409 --------------------------------------
21411 procedure Process_Real_Range_Specification (Def : Node_Id) is
21412 Spec : constant Node_Id := Real_Range_Specification (Def);
21415 Err : Boolean := False;
21417 procedure Analyze_Bound (N : Node_Id);
21418 -- Analyze and check one bound
21420 -------------------
21421 -- Analyze_Bound --
21422 -------------------
21424 procedure Analyze_Bound (N : Node_Id) is
21426 Analyze_And_Resolve (N, Any_Real);
21428 if not Is_OK_Static_Expression (N) then
21429 Flag_Non_Static_Expr
21430 ("bound in real type definition is not static!", N);
21435 -- Start of processing for Process_Real_Range_Specification
21438 if Present (Spec) then
21439 Lo := Low_Bound (Spec);
21440 Hi := High_Bound (Spec);
21441 Analyze_Bound (Lo);
21442 Analyze_Bound (Hi);
21444 -- If error, clear away junk range specification
21447 Set_Real_Range_Specification (Def, Empty);
21450 end Process_Real_Range_Specification;
21452 ---------------------
21453 -- Process_Subtype --
21454 ---------------------
21456 function Process_Subtype
21458 Related_Nod : Node_Id;
21459 Related_Id : Entity_Id := Empty;
21460 Suffix : Character := ' ') return Entity_Id
21463 Def_Id : Entity_Id;
21464 Error_Node : Node_Id;
21465 Full_View_Id : Entity_Id;
21466 Subtype_Mark_Id : Entity_Id;
21468 May_Have_Null_Exclusion : Boolean;
21470 procedure Check_Incomplete (T : Node_Id);
21471 -- Called to verify that an incomplete type is not used prematurely
21473 ----------------------
21474 -- Check_Incomplete --
21475 ----------------------
21477 procedure Check_Incomplete (T : Node_Id) is
21479 -- Ada 2005 (AI-412): Incomplete subtypes are legal
21481 if Ekind (Root_Type (Entity (T))) = E_Incomplete_Type
21483 not (Ada_Version >= Ada_2005
21485 (Nkind (Parent (T)) = N_Subtype_Declaration
21486 or else (Nkind (Parent (T)) = N_Subtype_Indication
21487 and then Nkind (Parent (Parent (T))) =
21488 N_Subtype_Declaration)))
21490 Error_Msg_N ("invalid use of type before its full declaration", T);
21492 end Check_Incomplete;
21494 -- Start of processing for Process_Subtype
21497 -- Case of no constraints present
21499 if Nkind (S) /= N_Subtype_Indication then
21502 -- No way to proceed if the subtype indication is malformed. This
21503 -- will happen for example when the subtype indication in an object
21504 -- declaration is missing altogether and the expression is analyzed
21505 -- as if it were that indication.
21507 if not Is_Entity_Name (S) then
21511 Check_Incomplete (S);
21514 -- Ada 2005 (AI-231): Static check
21516 if Ada_Version >= Ada_2005
21517 and then Present (P)
21518 and then Null_Exclusion_Present (P)
21519 and then Nkind (P) /= N_Access_To_Object_Definition
21520 and then not Is_Access_Type (Entity (S))
21522 Error_Msg_N ("`NOT NULL` only allowed for an access type", S);
21525 -- The following is ugly, can't we have a range or even a flag???
21527 May_Have_Null_Exclusion :=
21528 Nkind_In (P, N_Access_Definition,
21529 N_Access_Function_Definition,
21530 N_Access_Procedure_Definition,
21531 N_Access_To_Object_Definition,
21533 N_Component_Definition)
21535 Nkind_In (P, N_Derived_Type_Definition,
21536 N_Discriminant_Specification,
21537 N_Formal_Object_Declaration,
21538 N_Object_Declaration,
21539 N_Object_Renaming_Declaration,
21540 N_Parameter_Specification,
21541 N_Subtype_Declaration);
21543 -- Create an Itype that is a duplicate of Entity (S) but with the
21544 -- null-exclusion attribute.
21546 if May_Have_Null_Exclusion
21547 and then Is_Access_Type (Entity (S))
21548 and then Null_Exclusion_Present (P)
21550 -- No need to check the case of an access to object definition.
21551 -- It is correct to define double not-null pointers.
21554 -- type Not_Null_Int_Ptr is not null access Integer;
21555 -- type Acc is not null access Not_Null_Int_Ptr;
21557 and then Nkind (P) /= N_Access_To_Object_Definition
21559 if Can_Never_Be_Null (Entity (S)) then
21560 case Nkind (Related_Nod) is
21561 when N_Full_Type_Declaration =>
21562 if Nkind (Type_Definition (Related_Nod))
21563 in N_Array_Type_Definition
21567 (Component_Definition
21568 (Type_Definition (Related_Nod)));
21571 Subtype_Indication (Type_Definition (Related_Nod));
21574 when N_Subtype_Declaration =>
21575 Error_Node := Subtype_Indication (Related_Nod);
21577 when N_Object_Declaration =>
21578 Error_Node := Object_Definition (Related_Nod);
21580 when N_Component_Declaration =>
21582 Subtype_Indication (Component_Definition (Related_Nod));
21584 when N_Allocator =>
21585 Error_Node := Expression (Related_Nod);
21588 pragma Assert (False);
21589 Error_Node := Related_Nod;
21593 ("`NOT NULL` not allowed (& already excludes null)",
21599 Create_Null_Excluding_Itype
21601 Related_Nod => P));
21602 Set_Entity (S, Etype (S));
21607 -- Case of constraint present, so that we have an N_Subtype_Indication
21608 -- node (this node is created only if constraints are present).
21611 Find_Type (Subtype_Mark (S));
21613 if Nkind (Parent (S)) /= N_Access_To_Object_Definition
21615 (Nkind (Parent (S)) = N_Subtype_Declaration
21616 and then Is_Itype (Defining_Identifier (Parent (S))))
21618 Check_Incomplete (Subtype_Mark (S));
21622 Subtype_Mark_Id := Entity (Subtype_Mark (S));
21624 -- Explicit subtype declaration case
21626 if Nkind (P) = N_Subtype_Declaration then
21627 Def_Id := Defining_Identifier (P);
21629 -- Explicit derived type definition case
21631 elsif Nkind (P) = N_Derived_Type_Definition then
21632 Def_Id := Defining_Identifier (Parent (P));
21634 -- Implicit case, the Def_Id must be created as an implicit type.
21635 -- The one exception arises in the case of concurrent types, array
21636 -- and access types, where other subsidiary implicit types may be
21637 -- created and must appear before the main implicit type. In these
21638 -- cases we leave Def_Id set to Empty as a signal that Create_Itype
21639 -- has not yet been called to create Def_Id.
21642 if Is_Array_Type (Subtype_Mark_Id)
21643 or else Is_Concurrent_Type (Subtype_Mark_Id)
21644 or else Is_Access_Type (Subtype_Mark_Id)
21648 -- For the other cases, we create a new unattached Itype,
21649 -- and set the indication to ensure it gets attached later.
21653 Create_Itype (E_Void, Related_Nod, Related_Id, Suffix);
21657 -- If the kind of constraint is invalid for this kind of type,
21658 -- then give an error, and then pretend no constraint was given.
21660 if not Is_Valid_Constraint_Kind
21661 (Ekind (Subtype_Mark_Id), Nkind (Constraint (S)))
21664 ("incorrect constraint for this kind of type", Constraint (S));
21666 Rewrite (S, New_Copy_Tree (Subtype_Mark (S)));
21668 -- Set Ekind of orphan itype, to prevent cascaded errors
21670 if Present (Def_Id) then
21671 Set_Ekind (Def_Id, Ekind (Any_Type));
21674 -- Make recursive call, having got rid of the bogus constraint
21676 return Process_Subtype (S, Related_Nod, Related_Id, Suffix);
21679 -- Remaining processing depends on type. Select on Base_Type kind to
21680 -- ensure getting to the concrete type kind in the case of a private
21681 -- subtype (needed when only doing semantic analysis).
21683 case Ekind (Base_Type (Subtype_Mark_Id)) is
21684 when Access_Kind =>
21686 -- If this is a constraint on a class-wide type, discard it.
21687 -- There is currently no way to express a partial discriminant
21688 -- constraint on a type with unknown discriminants. This is
21689 -- a pathology that the ACATS wisely decides not to test.
21691 if Is_Class_Wide_Type (Designated_Type (Subtype_Mark_Id)) then
21692 if Comes_From_Source (S) then
21694 ("constraint on class-wide type ignored??",
21698 if Nkind (P) = N_Subtype_Declaration then
21699 Set_Subtype_Indication (P,
21700 New_Occurrence_Of (Subtype_Mark_Id, Sloc (S)));
21703 return Subtype_Mark_Id;
21706 Constrain_Access (Def_Id, S, Related_Nod);
21709 and then Is_Itype (Designated_Type (Def_Id))
21710 and then Nkind (Related_Nod) = N_Subtype_Declaration
21711 and then not Is_Incomplete_Type (Designated_Type (Def_Id))
21713 Build_Itype_Reference
21714 (Designated_Type (Def_Id), Related_Nod);
21718 Constrain_Array (Def_Id, S, Related_Nod, Related_Id, Suffix);
21720 when Decimal_Fixed_Point_Kind =>
21721 Constrain_Decimal (Def_Id, S);
21723 when Enumeration_Kind =>
21724 Constrain_Enumeration (Def_Id, S);
21726 when Ordinary_Fixed_Point_Kind =>
21727 Constrain_Ordinary_Fixed (Def_Id, S);
21730 Constrain_Float (Def_Id, S);
21732 when Integer_Kind =>
21733 Constrain_Integer (Def_Id, S);
21735 when Class_Wide_Kind
21736 | E_Incomplete_Type
21740 Constrain_Discriminated_Type (Def_Id, S, Related_Nod);
21742 if Ekind (Def_Id) = E_Incomplete_Type then
21743 Set_Private_Dependents (Def_Id, New_Elmt_List);
21746 when Private_Kind =>
21748 -- A private type with unknown discriminants may be completed
21749 -- by an unconstrained array type.
21751 if Has_Unknown_Discriminants (Subtype_Mark_Id)
21752 and then Present (Full_View (Subtype_Mark_Id))
21753 and then Is_Array_Type (Full_View (Subtype_Mark_Id))
21755 Constrain_Array (Def_Id, S, Related_Nod, Related_Id, Suffix);
21757 -- ... but more commonly is completed by a discriminated record
21761 Constrain_Discriminated_Type (Def_Id, S, Related_Nod);
21764 -- The base type may be private but Def_Id may be a full view
21767 if Is_Private_Type (Def_Id) then
21768 Set_Private_Dependents (Def_Id, New_Elmt_List);
21771 -- In case of an invalid constraint prevent further processing
21772 -- since the type constructed is missing expected fields.
21774 if Etype (Def_Id) = Any_Type then
21778 -- If the full view is that of a task with discriminants,
21779 -- we must constrain both the concurrent type and its
21780 -- corresponding record type. Otherwise we will just propagate
21781 -- the constraint to the full view, if available.
21783 if Present (Full_View (Subtype_Mark_Id))
21784 and then Has_Discriminants (Subtype_Mark_Id)
21785 and then Is_Concurrent_Type (Full_View (Subtype_Mark_Id))
21788 Create_Itype (E_Void, Related_Nod, Related_Id, Suffix);
21790 Set_Entity (Subtype_Mark (S), Full_View (Subtype_Mark_Id));
21791 Constrain_Concurrent (Full_View_Id, S,
21792 Related_Nod, Related_Id, Suffix);
21793 Set_Entity (Subtype_Mark (S), Subtype_Mark_Id);
21794 Set_Full_View (Def_Id, Full_View_Id);
21796 -- Introduce an explicit reference to the private subtype,
21797 -- to prevent scope anomalies in gigi if first use appears
21798 -- in a nested context, e.g. a later function body.
21799 -- Should this be generated in other contexts than a full
21800 -- type declaration?
21802 if Is_Itype (Def_Id)
21804 Nkind (Parent (P)) = N_Full_Type_Declaration
21806 Build_Itype_Reference (Def_Id, Parent (P));
21810 Prepare_Private_Subtype_Completion (Def_Id, Related_Nod);
21813 when Concurrent_Kind =>
21814 Constrain_Concurrent (Def_Id, S,
21815 Related_Nod, Related_Id, Suffix);
21818 Error_Msg_N ("invalid subtype mark in subtype indication", S);
21821 -- Size, Alignment, Representation aspects and Convention are always
21822 -- inherited from the base type.
21824 Set_Size_Info (Def_Id, (Subtype_Mark_Id));
21825 Set_Rep_Info (Def_Id, (Subtype_Mark_Id));
21826 Set_Convention (Def_Id, Convention (Subtype_Mark_Id));
21828 -- The anonymous subtype created for the subtype indication
21829 -- inherits the predicates of the parent.
21831 if Has_Predicates (Subtype_Mark_Id) then
21832 Inherit_Predicate_Flags (Def_Id, Subtype_Mark_Id);
21834 -- Indicate where the predicate function may be found
21836 if No (Predicate_Function (Def_Id)) and then Is_Itype (Def_Id) then
21837 Set_Predicated_Parent (Def_Id, Subtype_Mark_Id);
21843 end Process_Subtype;
21845 -----------------------------
21846 -- Record_Type_Declaration --
21847 -----------------------------
21849 procedure Record_Type_Declaration
21854 Def : constant Node_Id := Type_Definition (N);
21855 Is_Tagged : Boolean;
21856 Tag_Comp : Entity_Id;
21859 -- These flags must be initialized before calling Process_Discriminants
21860 -- because this routine makes use of them.
21862 Set_Ekind (T, E_Record_Type);
21864 Init_Size_Align (T);
21865 Set_Interfaces (T, No_Elist);
21866 Set_Stored_Constraint (T, No_Elist);
21867 Set_Default_SSO (T);
21868 Set_No_Reordering (T, No_Component_Reordering);
21872 if Ada_Version < Ada_2005 or else not Interface_Present (Def) then
21873 if Limited_Present (Def) then
21874 Check_SPARK_05_Restriction ("limited is not allowed", N);
21877 if Abstract_Present (Def) then
21878 Check_SPARK_05_Restriction ("abstract is not allowed", N);
21881 -- The flag Is_Tagged_Type might have already been set by
21882 -- Find_Type_Name if it detected an error for declaration T. This
21883 -- arises in the case of private tagged types where the full view
21884 -- omits the word tagged.
21887 Tagged_Present (Def)
21888 or else (Serious_Errors_Detected > 0 and then Is_Tagged_Type (T));
21890 Set_Is_Limited_Record (T, Limited_Present (Def));
21893 Set_Is_Tagged_Type (T, True);
21894 Set_No_Tagged_Streams_Pragma (T, No_Tagged_Streams);
21897 -- Type is abstract if full declaration carries keyword, or if
21898 -- previous partial view did.
21900 Set_Is_Abstract_Type (T, Is_Abstract_Type (T)
21901 or else Abstract_Present (Def));
21904 Check_SPARK_05_Restriction ("interface is not allowed", N);
21907 Analyze_Interface_Declaration (T, Def);
21909 if Present (Discriminant_Specifications (N)) then
21911 ("interface types cannot have discriminants",
21912 Defining_Identifier
21913 (First (Discriminant_Specifications (N))));
21917 -- First pass: if there are self-referential access components,
21918 -- create the required anonymous access type declarations, and if
21919 -- need be an incomplete type declaration for T itself.
21921 Check_Anonymous_Access_Components (N, T, Prev, Component_List (Def));
21923 if Ada_Version >= Ada_2005
21924 and then Present (Interface_List (Def))
21926 Check_Interfaces (N, Def);
21929 Ifaces_List : Elist_Id;
21932 -- Ada 2005 (AI-251): Collect the list of progenitors that are not
21933 -- already in the parents.
21937 Ifaces_List => Ifaces_List,
21938 Exclude_Parents => True);
21940 Set_Interfaces (T, Ifaces_List);
21944 -- Records constitute a scope for the component declarations within.
21945 -- The scope is created prior to the processing of these declarations.
21946 -- Discriminants are processed first, so that they are visible when
21947 -- processing the other components. The Ekind of the record type itself
21948 -- is set to E_Record_Type (subtypes appear as E_Record_Subtype).
21950 -- Enter record scope
21954 -- If an incomplete or private type declaration was already given for
21955 -- the type, then this scope already exists, and the discriminants have
21956 -- been declared within. We must verify that the full declaration
21957 -- matches the incomplete one.
21959 Check_Or_Process_Discriminants (N, T, Prev);
21961 Set_Is_Constrained (T, not Has_Discriminants (T));
21962 Set_Has_Delayed_Freeze (T, True);
21964 -- For tagged types add a manually analyzed component corresponding
21965 -- to the component _tag, the corresponding piece of tree will be
21966 -- expanded as part of the freezing actions if it is not a CPP_Class.
21970 -- Do not add the tag unless we are in expansion mode
21972 if Expander_Active then
21973 Tag_Comp := Make_Defining_Identifier (Sloc (Def), Name_uTag);
21974 Enter_Name (Tag_Comp);
21976 Set_Ekind (Tag_Comp, E_Component);
21977 Set_Is_Tag (Tag_Comp);
21978 Set_Is_Aliased (Tag_Comp);
21979 Set_Etype (Tag_Comp, RTE (RE_Tag));
21980 Set_DT_Entry_Count (Tag_Comp, No_Uint);
21981 Set_Original_Record_Component (Tag_Comp, Tag_Comp);
21982 Init_Component_Location (Tag_Comp);
21984 -- Ada 2005 (AI-251): Addition of the Tag corresponding to all the
21985 -- implemented interfaces.
21987 if Has_Interfaces (T) then
21988 Add_Interface_Tag_Components (N, T);
21992 Make_Class_Wide_Type (T);
21993 Set_Direct_Primitive_Operations (T, New_Elmt_List);
21996 -- We must suppress range checks when processing record components in
21997 -- the presence of discriminants, since we don't want spurious checks to
21998 -- be generated during their analysis, but Suppress_Range_Checks flags
21999 -- must be reset the after processing the record definition.
22001 -- Note: this is the only use of Kill_Range_Checks, and is a bit odd,
22002 -- couldn't we just use the normal range check suppression method here.
22003 -- That would seem cleaner ???
22005 if Has_Discriminants (T) and then not Range_Checks_Suppressed (T) then
22006 Set_Kill_Range_Checks (T, True);
22007 Record_Type_Definition (Def, Prev);
22008 Set_Kill_Range_Checks (T, False);
22010 Record_Type_Definition (Def, Prev);
22013 -- Exit from record scope
22017 -- Ada 2005 (AI-251 and AI-345): Derive the interface subprograms of all
22018 -- the implemented interfaces and associate them an aliased entity.
22021 and then not Is_Empty_List (Interface_List (Def))
22023 Derive_Progenitor_Subprograms (T, T);
22026 Check_Function_Writable_Actuals (N);
22027 end Record_Type_Declaration;
22029 ----------------------------
22030 -- Record_Type_Definition --
22031 ----------------------------
22033 procedure Record_Type_Definition (Def : Node_Id; Prev_T : Entity_Id) is
22034 Component : Entity_Id;
22035 Ctrl_Components : Boolean := False;
22036 Final_Storage_Only : Boolean;
22040 if Ekind (Prev_T) = E_Incomplete_Type then
22041 T := Full_View (Prev_T);
22046 -- In SPARK, tagged types and type extensions may only be declared in
22047 -- the specification of library unit packages.
22049 if Present (Def) and then Is_Tagged_Type (T) then
22055 if Nkind (Parent (Def)) = N_Full_Type_Declaration then
22056 Typ := Parent (Def);
22059 (Nkind (Parent (Def)) = N_Derived_Type_Definition);
22060 Typ := Parent (Parent (Def));
22063 Ctxt := Parent (Typ);
22065 if Nkind (Ctxt) = N_Package_Body
22066 and then Nkind (Parent (Ctxt)) = N_Compilation_Unit
22068 Check_SPARK_05_Restriction
22069 ("type should be defined in package specification", Typ);
22071 elsif Nkind (Ctxt) /= N_Package_Specification
22072 or else Nkind (Parent (Parent (Ctxt))) /= N_Compilation_Unit
22074 Check_SPARK_05_Restriction
22075 ("type should be defined in library unit package", Typ);
22080 Final_Storage_Only := not Is_Controlled (T);
22082 -- Ada 2005: Check whether an explicit Limited is present in a derived
22083 -- type declaration.
22085 if Nkind (Parent (Def)) = N_Derived_Type_Definition
22086 and then Limited_Present (Parent (Def))
22088 Set_Is_Limited_Record (T);
22091 -- If the component list of a record type is defined by the reserved
22092 -- word null and there is no discriminant part, then the record type has
22093 -- no components and all records of the type are null records (RM 3.7)
22094 -- This procedure is also called to process the extension part of a
22095 -- record extension, in which case the current scope may have inherited
22099 or else No (Component_List (Def))
22100 or else Null_Present (Component_List (Def))
22102 if not Is_Tagged_Type (T) then
22103 Check_SPARK_05_Restriction ("untagged record cannot be null", Def);
22107 Analyze_Declarations (Component_Items (Component_List (Def)));
22109 if Present (Variant_Part (Component_List (Def))) then
22110 Check_SPARK_05_Restriction ("variant part is not allowed", Def);
22111 Analyze (Variant_Part (Component_List (Def)));
22115 -- After completing the semantic analysis of the record definition,
22116 -- record components, both new and inherited, are accessible. Set their
22117 -- kind accordingly. Exclude malformed itypes from illegal declarations,
22118 -- whose Ekind may be void.
22120 Component := First_Entity (Current_Scope);
22121 while Present (Component) loop
22122 if Ekind (Component) = E_Void
22123 and then not Is_Itype (Component)
22125 Set_Ekind (Component, E_Component);
22126 Init_Component_Location (Component);
22129 Propagate_Concurrent_Flags (T, Etype (Component));
22131 if Ekind (Component) /= E_Component then
22134 -- Do not set Has_Controlled_Component on a class-wide equivalent
22135 -- type. See Make_CW_Equivalent_Type.
22137 elsif not Is_Class_Wide_Equivalent_Type (T)
22138 and then (Has_Controlled_Component (Etype (Component))
22139 or else (Chars (Component) /= Name_uParent
22140 and then Is_Controlled (Etype (Component))))
22142 Set_Has_Controlled_Component (T, True);
22143 Final_Storage_Only :=
22145 and then Finalize_Storage_Only (Etype (Component));
22146 Ctrl_Components := True;
22149 Next_Entity (Component);
22152 -- A Type is Finalize_Storage_Only only if all its controlled components
22155 if Ctrl_Components then
22156 Set_Finalize_Storage_Only (T, Final_Storage_Only);
22159 -- Place reference to end record on the proper entity, which may
22160 -- be a partial view.
22162 if Present (Def) then
22163 Process_End_Label (Def, 'e', Prev_T);
22165 end Record_Type_Definition;
22167 ------------------------
22168 -- Replace_Components --
22169 ------------------------
22171 procedure Replace_Components (Typ : Entity_Id; Decl : Node_Id) is
22172 function Process (N : Node_Id) return Traverse_Result;
22178 function Process (N : Node_Id) return Traverse_Result is
22182 if Nkind (N) = N_Discriminant_Specification then
22183 Comp := First_Discriminant (Typ);
22184 while Present (Comp) loop
22185 if Chars (Comp) = Chars (Defining_Identifier (N)) then
22186 Set_Defining_Identifier (N, Comp);
22190 Next_Discriminant (Comp);
22193 elsif Nkind (N) = N_Variant_Part then
22194 Comp := First_Discriminant (Typ);
22195 while Present (Comp) loop
22196 if Chars (Comp) = Chars (Name (N)) then
22197 Set_Entity (Name (N), Comp);
22201 Next_Discriminant (Comp);
22204 elsif Nkind (N) = N_Component_Declaration then
22205 Comp := First_Component (Typ);
22206 while Present (Comp) loop
22207 if Chars (Comp) = Chars (Defining_Identifier (N)) then
22208 Set_Defining_Identifier (N, Comp);
22212 Next_Component (Comp);
22219 procedure Replace is new Traverse_Proc (Process);
22221 -- Start of processing for Replace_Components
22225 end Replace_Components;
22227 -------------------------------
22228 -- Set_Completion_Referenced --
22229 -------------------------------
22231 procedure Set_Completion_Referenced (E : Entity_Id) is
22233 -- If in main unit, mark entity that is a completion as referenced,
22234 -- warnings go on the partial view when needed.
22236 if In_Extended_Main_Source_Unit (E) then
22237 Set_Referenced (E);
22239 end Set_Completion_Referenced;
22241 ---------------------
22242 -- Set_Default_SSO --
22243 ---------------------
22245 procedure Set_Default_SSO (T : Entity_Id) is
22247 case Opt.Default_SSO is
22251 Set_SSO_Set_Low_By_Default (T, True);
22253 Set_SSO_Set_High_By_Default (T, True);
22255 raise Program_Error;
22257 end Set_Default_SSO;
22259 ---------------------
22260 -- Set_Fixed_Range --
22261 ---------------------
22263 -- The range for fixed-point types is complicated by the fact that we
22264 -- do not know the exact end points at the time of the declaration. This
22265 -- is true for three reasons:
22267 -- A size clause may affect the fudging of the end-points.
22268 -- A small clause may affect the values of the end-points.
22269 -- We try to include the end-points if it does not affect the size.
22271 -- This means that the actual end-points must be established at the
22272 -- point when the type is frozen. Meanwhile, we first narrow the range
22273 -- as permitted (so that it will fit if necessary in a small specified
22274 -- size), and then build a range subtree with these narrowed bounds.
22275 -- Set_Fixed_Range constructs the range from real literal values, and
22276 -- sets the range as the Scalar_Range of the given fixed-point type entity.
22278 -- The parent of this range is set to point to the entity so that it is
22279 -- properly hooked into the tree (unlike normal Scalar_Range entries for
22280 -- other scalar types, which are just pointers to the range in the
22281 -- original tree, this would otherwise be an orphan).
22283 -- The tree is left unanalyzed. When the type is frozen, the processing
22284 -- in Freeze.Freeze_Fixed_Point_Type notices that the range is not
22285 -- analyzed, and uses this as an indication that it should complete
22286 -- work on the range (it will know the final small and size values).
22288 procedure Set_Fixed_Range
22294 S : constant Node_Id :=
22296 Low_Bound => Make_Real_Literal (Loc, Lo),
22297 High_Bound => Make_Real_Literal (Loc, Hi));
22299 Set_Scalar_Range (E, S);
22302 -- Before the freeze point, the bounds of a fixed point are universal
22303 -- and carry the corresponding type.
22305 Set_Etype (Low_Bound (S), Universal_Real);
22306 Set_Etype (High_Bound (S), Universal_Real);
22307 end Set_Fixed_Range;
22309 ----------------------------------
22310 -- Set_Scalar_Range_For_Subtype --
22311 ----------------------------------
22313 procedure Set_Scalar_Range_For_Subtype
22314 (Def_Id : Entity_Id;
22318 Kind : constant Entity_Kind := Ekind (Def_Id);
22321 -- Defend against previous error
22323 if Nkind (R) = N_Error then
22327 Set_Scalar_Range (Def_Id, R);
22329 -- We need to link the range into the tree before resolving it so
22330 -- that types that are referenced, including importantly the subtype
22331 -- itself, are properly frozen (Freeze_Expression requires that the
22332 -- expression be properly linked into the tree). Of course if it is
22333 -- already linked in, then we do not disturb the current link.
22335 if No (Parent (R)) then
22336 Set_Parent (R, Def_Id);
22339 -- Reset the kind of the subtype during analysis of the range, to
22340 -- catch possible premature use in the bounds themselves.
22342 Set_Ekind (Def_Id, E_Void);
22343 Process_Range_Expr_In_Decl (R, Subt, Subtyp => Def_Id);
22344 Set_Ekind (Def_Id, Kind);
22345 end Set_Scalar_Range_For_Subtype;
22347 --------------------------------------------------------
22348 -- Set_Stored_Constraint_From_Discriminant_Constraint --
22349 --------------------------------------------------------
22351 procedure Set_Stored_Constraint_From_Discriminant_Constraint
22355 -- Make sure set if encountered during Expand_To_Stored_Constraint
22357 Set_Stored_Constraint (E, No_Elist);
22359 -- Give it the right value
22361 if Is_Constrained (E) and then Has_Discriminants (E) then
22362 Set_Stored_Constraint (E,
22363 Expand_To_Stored_Constraint (E, Discriminant_Constraint (E)));
22365 end Set_Stored_Constraint_From_Discriminant_Constraint;
22367 -------------------------------------
22368 -- Signed_Integer_Type_Declaration --
22369 -------------------------------------
22371 procedure Signed_Integer_Type_Declaration (T : Entity_Id; Def : Node_Id) is
22372 Implicit_Base : Entity_Id;
22373 Base_Typ : Entity_Id;
22376 Errs : Boolean := False;
22380 function Can_Derive_From (E : Entity_Id) return Boolean;
22381 -- Determine whether given bounds allow derivation from specified type
22383 procedure Check_Bound (Expr : Node_Id);
22384 -- Check bound to make sure it is integral and static. If not, post
22385 -- appropriate error message and set Errs flag
22387 ---------------------
22388 -- Can_Derive_From --
22389 ---------------------
22391 -- Note we check both bounds against both end values, to deal with
22392 -- strange types like ones with a range of 0 .. -12341234.
22394 function Can_Derive_From (E : Entity_Id) return Boolean is
22395 Lo : constant Uint := Expr_Value (Type_Low_Bound (E));
22396 Hi : constant Uint := Expr_Value (Type_High_Bound (E));
22398 return Lo <= Lo_Val and then Lo_Val <= Hi
22400 Lo <= Hi_Val and then Hi_Val <= Hi;
22401 end Can_Derive_From;
22407 procedure Check_Bound (Expr : Node_Id) is
22409 -- If a range constraint is used as an integer type definition, each
22410 -- bound of the range must be defined by a static expression of some
22411 -- integer type, but the two bounds need not have the same integer
22412 -- type (Negative bounds are allowed.) (RM 3.5.4)
22414 if not Is_Integer_Type (Etype (Expr)) then
22416 ("integer type definition bounds must be of integer type", Expr);
22419 elsif not Is_OK_Static_Expression (Expr) then
22420 Flag_Non_Static_Expr
22421 ("non-static expression used for integer type bound!", Expr);
22424 -- The bounds are folded into literals, and we set their type to be
22425 -- universal, to avoid typing difficulties: we cannot set the type
22426 -- of the literal to the new type, because this would be a forward
22427 -- reference for the back end, and if the original type is user-
22428 -- defined this can lead to spurious semantic errors (e.g. 2928-003).
22431 if Is_Entity_Name (Expr) then
22432 Fold_Uint (Expr, Expr_Value (Expr), True);
22435 Set_Etype (Expr, Universal_Integer);
22439 -- Start of processing for Signed_Integer_Type_Declaration
22442 -- Create an anonymous base type
22445 Create_Itype (E_Signed_Integer_Type, Parent (Def), T, 'B');
22447 -- Analyze and check the bounds, they can be of any integer type
22449 Lo := Low_Bound (Def);
22450 Hi := High_Bound (Def);
22452 -- Arbitrarily use Integer as the type if either bound had an error
22454 if Hi = Error or else Lo = Error then
22455 Base_Typ := Any_Integer;
22456 Set_Error_Posted (T, True);
22458 -- Here both bounds are OK expressions
22461 Analyze_And_Resolve (Lo, Any_Integer);
22462 Analyze_And_Resolve (Hi, Any_Integer);
22468 Hi := Type_High_Bound (Standard_Long_Long_Integer);
22469 Lo := Type_Low_Bound (Standard_Long_Long_Integer);
22472 -- Find type to derive from
22474 Lo_Val := Expr_Value (Lo);
22475 Hi_Val := Expr_Value (Hi);
22477 if Can_Derive_From (Standard_Short_Short_Integer) then
22478 Base_Typ := Base_Type (Standard_Short_Short_Integer);
22480 elsif Can_Derive_From (Standard_Short_Integer) then
22481 Base_Typ := Base_Type (Standard_Short_Integer);
22483 elsif Can_Derive_From (Standard_Integer) then
22484 Base_Typ := Base_Type (Standard_Integer);
22486 elsif Can_Derive_From (Standard_Long_Integer) then
22487 Base_Typ := Base_Type (Standard_Long_Integer);
22489 elsif Can_Derive_From (Standard_Long_Long_Integer) then
22490 Check_Restriction (No_Long_Long_Integers, Def);
22491 Base_Typ := Base_Type (Standard_Long_Long_Integer);
22494 Base_Typ := Base_Type (Standard_Long_Long_Integer);
22495 Error_Msg_N ("integer type definition bounds out of range", Def);
22496 Hi := Type_High_Bound (Standard_Long_Long_Integer);
22497 Lo := Type_Low_Bound (Standard_Long_Long_Integer);
22501 -- Complete both implicit base and declared first subtype entities. The
22502 -- inheritance of the rep item chain ensures that SPARK-related pragmas
22503 -- are not clobbered when the signed integer type acts as a full view of
22506 Set_Etype (Implicit_Base, Base_Typ);
22507 Set_Size_Info (Implicit_Base, Base_Typ);
22508 Set_RM_Size (Implicit_Base, RM_Size (Base_Typ));
22509 Set_First_Rep_Item (Implicit_Base, First_Rep_Item (Base_Typ));
22510 Set_Scalar_Range (Implicit_Base, Scalar_Range (Base_Typ));
22512 Set_Ekind (T, E_Signed_Integer_Subtype);
22513 Set_Etype (T, Implicit_Base);
22514 Set_Size_Info (T, Implicit_Base);
22515 Inherit_Rep_Item_Chain (T, Implicit_Base);
22516 Set_Scalar_Range (T, Def);
22517 Set_RM_Size (T, UI_From_Int (Minimum_Size (T)));
22518 Set_Is_Constrained (T);
22519 end Signed_Integer_Type_Declaration;