1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2008, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Checks; use Checks;
28 with Debug; use Debug;
29 with Elists; use Elists;
30 with Einfo; use Einfo;
31 with Errout; use Errout;
32 with Eval_Fat; use Eval_Fat;
33 with Exp_Ch3; use Exp_Ch3;
34 with Exp_Ch9; use Exp_Ch9;
35 with Exp_Disp; use Exp_Disp;
36 with Exp_Dist; use Exp_Dist;
37 with Exp_Tss; use Exp_Tss;
38 with Exp_Util; use Exp_Util;
39 with Fname; use Fname;
40 with Freeze; use Freeze;
41 with Itypes; use Itypes;
42 with Layout; use Layout;
44 with Lib.Xref; use Lib.Xref;
45 with Namet; use Namet;
46 with Nmake; use Nmake;
48 with Restrict; use Restrict;
49 with Rident; use Rident;
50 with Rtsfind; use Rtsfind;
52 with Sem_Aux; use Sem_Aux;
53 with Sem_Case; use Sem_Case;
54 with Sem_Cat; use Sem_Cat;
55 with Sem_Ch6; use Sem_Ch6;
56 with Sem_Ch7; use Sem_Ch7;
57 with Sem_Ch8; use Sem_Ch8;
58 with Sem_Ch13; use Sem_Ch13;
59 with Sem_Disp; use Sem_Disp;
60 with Sem_Dist; use Sem_Dist;
61 with Sem_Elim; use Sem_Elim;
62 with Sem_Eval; use Sem_Eval;
63 with Sem_Mech; use Sem_Mech;
64 with Sem_Res; use Sem_Res;
65 with Sem_Smem; use Sem_Smem;
66 with Sem_Type; use Sem_Type;
67 with Sem_Util; use Sem_Util;
68 with Sem_Warn; use Sem_Warn;
69 with Stand; use Stand;
70 with Sinfo; use Sinfo;
71 with Snames; use Snames;
72 with Targparm; use Targparm;
73 with Tbuild; use Tbuild;
74 with Ttypes; use Ttypes;
75 with Uintp; use Uintp;
76 with Urealp; use Urealp;
78 package body Sem_Ch3 is
80 -----------------------
81 -- Local Subprograms --
82 -----------------------
84 procedure Add_Interface_Tag_Components (N : Node_Id; Typ : Entity_Id);
85 -- Ada 2005 (AI-251): Add the tag components corresponding to all the
86 -- abstract interface types implemented by a record type or a derived
89 procedure Build_Derived_Type
91 Parent_Type : Entity_Id;
92 Derived_Type : Entity_Id;
93 Is_Completion : Boolean;
94 Derive_Subps : Boolean := True);
95 -- Create and decorate a Derived_Type given the Parent_Type entity. N is
96 -- the N_Full_Type_Declaration node containing the derived type definition.
97 -- Parent_Type is the entity for the parent type in the derived type
98 -- definition and Derived_Type the actual derived type. Is_Completion must
99 -- be set to False if Derived_Type is the N_Defining_Identifier node in N
100 -- (i.e. Derived_Type = Defining_Identifier (N)). In this case N is not the
101 -- completion of a private type declaration. If Is_Completion is set to
102 -- True, N is the completion of a private type declaration and Derived_Type
103 -- is different from the defining identifier inside N (i.e. Derived_Type /=
104 -- Defining_Identifier (N)). Derive_Subps indicates whether the parent
105 -- subprograms should be derived. The only case where this parameter is
106 -- False is when Build_Derived_Type is recursively called to process an
107 -- implicit derived full type for a type derived from a private type (in
108 -- that case the subprograms must only be derived for the private view of
111 -- ??? These flags need a bit of re-examination and re-documentation:
112 -- ??? are they both necessary (both seem related to the recursion)?
114 procedure Build_Derived_Access_Type
116 Parent_Type : Entity_Id;
117 Derived_Type : Entity_Id);
118 -- Subsidiary procedure to Build_Derived_Type. For a derived access type,
119 -- create an implicit base if the parent type is constrained or if the
120 -- subtype indication has a constraint.
122 procedure Build_Derived_Array_Type
124 Parent_Type : Entity_Id;
125 Derived_Type : Entity_Id);
126 -- Subsidiary procedure to Build_Derived_Type. For a derived array type,
127 -- create an implicit base if the parent type is constrained or if the
128 -- subtype indication has a constraint.
130 procedure Build_Derived_Concurrent_Type
132 Parent_Type : Entity_Id;
133 Derived_Type : Entity_Id);
134 -- Subsidiary procedure to Build_Derived_Type. For a derived task or
135 -- protected type, inherit entries and protected subprograms, check
136 -- legality of discriminant constraints if any.
138 procedure Build_Derived_Enumeration_Type
140 Parent_Type : Entity_Id;
141 Derived_Type : Entity_Id);
142 -- Subsidiary procedure to Build_Derived_Type. For a derived enumeration
143 -- type, we must create a new list of literals. Types derived from
144 -- Character and [Wide_]Wide_Character are special-cased.
146 procedure Build_Derived_Numeric_Type
148 Parent_Type : Entity_Id;
149 Derived_Type : Entity_Id);
150 -- Subsidiary procedure to Build_Derived_Type. For numeric types, create
151 -- an anonymous base type, and propagate constraint to subtype if needed.
153 procedure Build_Derived_Private_Type
155 Parent_Type : Entity_Id;
156 Derived_Type : Entity_Id;
157 Is_Completion : Boolean;
158 Derive_Subps : Boolean := True);
159 -- Subsidiary procedure to Build_Derived_Type. This procedure is complex
160 -- because the parent may or may not have a completion, and the derivation
161 -- may itself be a completion.
163 procedure Build_Derived_Record_Type
165 Parent_Type : Entity_Id;
166 Derived_Type : Entity_Id;
167 Derive_Subps : Boolean := True);
168 -- Subsidiary procedure for Build_Derived_Type and
169 -- Analyze_Private_Extension_Declaration used for tagged and untagged
170 -- record types. All parameters are as in Build_Derived_Type except that
171 -- N, in addition to being an N_Full_Type_Declaration node, can also be an
172 -- N_Private_Extension_Declaration node. See the definition of this routine
173 -- for much more info. Derive_Subps indicates whether subprograms should
174 -- be derived from the parent type. The only case where Derive_Subps is
175 -- False is for an implicit derived full type for a type derived from a
176 -- private type (see Build_Derived_Type).
178 procedure Build_Discriminal (Discrim : Entity_Id);
179 -- Create the discriminal corresponding to discriminant Discrim, that is
180 -- the parameter corresponding to Discrim to be used in initialization
181 -- procedures for the type where Discrim is a discriminant. Discriminals
182 -- are not used during semantic analysis, and are not fully defined
183 -- entities until expansion. Thus they are not given a scope until
184 -- initialization procedures are built.
186 function Build_Discriminant_Constraints
189 Derived_Def : Boolean := False) return Elist_Id;
190 -- Validate discriminant constraints and return the list of the constraints
191 -- in order of discriminant declarations, where T is the discriminated
192 -- unconstrained type. Def is the N_Subtype_Indication node where the
193 -- discriminants constraints for T are specified. Derived_Def is True
194 -- when building the discriminant constraints in a derived type definition
195 -- of the form "type D (...) is new T (xxx)". In this case T is the parent
196 -- type and Def is the constraint "(xxx)" on T and this routine sets the
197 -- Corresponding_Discriminant field of the discriminants in the derived
198 -- type D to point to the corresponding discriminants in the parent type T.
200 procedure Build_Discriminated_Subtype
204 Related_Nod : Node_Id;
205 For_Access : Boolean := False);
206 -- Subsidiary procedure to Constrain_Discriminated_Type and to
207 -- Process_Incomplete_Dependents. Given
209 -- T (a possibly discriminated base type)
210 -- Def_Id (a very partially built subtype for T),
212 -- the call completes Def_Id to be the appropriate E_*_Subtype.
214 -- The Elist is the list of discriminant constraints if any (it is set
215 -- to No_Elist if T is not a discriminated type, and to an empty list if
216 -- T has discriminants but there are no discriminant constraints). The
217 -- Related_Nod is the same as Decl_Node in Create_Constrained_Components.
218 -- The For_Access says whether or not this subtype is really constraining
219 -- an access type. That is its sole purpose is the designated type of an
220 -- access type -- in which case a Private_Subtype Is_For_Access_Subtype
221 -- is built to avoid freezing T when the access subtype is frozen.
223 function Build_Scalar_Bound
226 Der_T : Entity_Id) return Node_Id;
227 -- The bounds of a derived scalar type are conversions of the bounds of
228 -- the parent type. Optimize the representation if the bounds are literals.
229 -- Needs a more complete spec--what are the parameters exactly, and what
230 -- exactly is the returned value, and how is Bound affected???
232 procedure Build_Itype_Reference
235 -- Create a reference to an internal type, for use by Gigi. The back-end
236 -- elaborates itypes on demand, i.e. when their first use is seen. This
237 -- can lead to scope anomalies if the first use is within a scope that is
238 -- nested within the scope that contains the point of definition of the
239 -- itype. The Itype_Reference node forces the elaboration of the itype
240 -- in the proper scope. The node is inserted after Nod, which is the
241 -- enclosing declaration that generated Ityp.
243 -- A related mechanism is used during expansion, for itypes created in
244 -- branches of conditionals. See Ensure_Defined in exp_util.
245 -- Could both mechanisms be merged ???
247 procedure Build_Underlying_Full_View
251 -- If the completion of a private type is itself derived from a private
252 -- type, or if the full view of a private subtype is itself private, the
253 -- back-end has no way to compute the actual size of this type. We build
254 -- an internal subtype declaration of the proper parent type to convey
255 -- this information. This extra mechanism is needed because a full
256 -- view cannot itself have a full view (it would get clobbered during
259 procedure Check_Access_Discriminant_Requires_Limited
262 -- Check the restriction that the type to which an access discriminant
263 -- belongs must be a concurrent type or a descendant of a type with
264 -- the reserved word 'limited' in its declaration.
266 procedure Check_Anonymous_Access_Components
270 Comp_List : Node_Id);
271 -- Ada 2005 AI-382: an access component in a record definition can refer to
272 -- the enclosing record, in which case it denotes the type itself, and not
273 -- the current instance of the type. We create an anonymous access type for
274 -- the component, and flag it as an access to a component, so accessibility
275 -- checks are properly performed on it. The declaration of the access type
276 -- is placed ahead of that of the record to prevent order-of-elaboration
277 -- circularity issues in Gigi. We create an incomplete type for the record
278 -- declaration, which is the designated type of the anonymous access.
280 procedure Check_Delta_Expression (E : Node_Id);
281 -- Check that the expression represented by E is suitable for use as a
282 -- delta expression, i.e. it is of real type and is static.
284 procedure Check_Digits_Expression (E : Node_Id);
285 -- Check that the expression represented by E is suitable for use as a
286 -- digits expression, i.e. it is of integer type, positive and static.
288 procedure Check_Initialization (T : Entity_Id; Exp : Node_Id);
289 -- Validate the initialization of an object declaration. T is the required
290 -- type, and Exp is the initialization expression.
292 procedure Check_Interfaces (N : Node_Id; Def : Node_Id);
293 -- Check ARM rules 3.9.4 (15/2), 9.1 (9.d/2) and 9.4 (11.d/2)
295 procedure Check_Or_Process_Discriminants
298 Prev : Entity_Id := Empty);
299 -- If T is the full declaration of an incomplete or private type, check the
300 -- conformance of the discriminants, otherwise process them. Prev is the
301 -- entity of the partial declaration, if any.
303 procedure Check_Real_Bound (Bound : Node_Id);
304 -- Check given bound for being of real type and static. If not, post an
305 -- appropriate message, and rewrite the bound with the real literal zero.
307 procedure Constant_Redeclaration
311 -- Various checks on legality of full declaration of deferred constant.
312 -- Id is the entity for the redeclaration, N is the N_Object_Declaration,
313 -- node. The caller has not yet set any attributes of this entity.
315 function Contain_Interface
317 Ifaces : Elist_Id) return Boolean;
318 -- Ada 2005: Determine whether Iface is present in the list Ifaces
320 procedure Convert_Scalar_Bounds
322 Parent_Type : Entity_Id;
323 Derived_Type : Entity_Id;
325 -- For derived scalar types, convert the bounds in the type definition to
326 -- the derived type, and complete their analysis. Given a constraint of the
327 -- form ".. new T range Lo .. Hi", Lo and Hi are analyzed and resolved with
328 -- T'Base, the parent_type. The bounds of the derived type (the anonymous
329 -- base) are copies of Lo and Hi. Finally, the bounds of the derived
330 -- subtype are conversions of those bounds to the derived_type, so that
331 -- their typing is consistent.
333 procedure Copy_Array_Base_Type_Attributes (T1, T2 : Entity_Id);
334 -- Copies attributes from array base type T2 to array base type T1. Copies
335 -- only attributes that apply to base types, but not subtypes.
337 procedure Copy_Array_Subtype_Attributes (T1, T2 : Entity_Id);
338 -- Copies attributes from array subtype T2 to array subtype T1. Copies
339 -- attributes that apply to both subtypes and base types.
341 procedure Create_Constrained_Components
345 Constraints : Elist_Id);
346 -- Build the list of entities for a constrained discriminated record
347 -- subtype. If a component depends on a discriminant, replace its subtype
348 -- using the discriminant values in the discriminant constraint. Subt
349 -- is the defining identifier for the subtype whose list of constrained
350 -- entities we will create. Decl_Node is the type declaration node where
351 -- we will attach all the itypes created. Typ is the base discriminated
352 -- type for the subtype Subt. Constraints is the list of discriminant
353 -- constraints for Typ.
355 function Constrain_Component_Type
357 Constrained_Typ : Entity_Id;
358 Related_Node : Node_Id;
360 Constraints : Elist_Id) return Entity_Id;
361 -- Given a discriminated base type Typ, a list of discriminant constraint
362 -- Constraints for Typ and a component of Typ, with type Compon_Type,
363 -- create and return the type corresponding to Compon_type where all
364 -- discriminant references are replaced with the corresponding constraint.
365 -- If no discriminant references occur in Compon_Typ then return it as is.
366 -- Constrained_Typ is the final constrained subtype to which the
367 -- constrained Compon_Type belongs. Related_Node is the node where we will
368 -- attach all the itypes created.
370 -- Above description is confused, what is Compon_Type???
372 procedure Constrain_Access
373 (Def_Id : in out Entity_Id;
375 Related_Nod : Node_Id);
376 -- Apply a list of constraints to an access type. If Def_Id is empty, it is
377 -- an anonymous type created for a subtype indication. In that case it is
378 -- created in the procedure and attached to Related_Nod.
380 procedure Constrain_Array
381 (Def_Id : in out Entity_Id;
383 Related_Nod : Node_Id;
384 Related_Id : Entity_Id;
386 -- Apply a list of index constraints to an unconstrained array type. The
387 -- first parameter is the entity for the resulting subtype. A value of
388 -- Empty for Def_Id indicates that an implicit type must be created, but
389 -- creation is delayed (and must be done by this procedure) because other
390 -- subsidiary implicit types must be created first (which is why Def_Id
391 -- is an in/out parameter). The second parameter is a subtype indication
392 -- node for the constrained array to be created (e.g. something of the
393 -- form string (1 .. 10)). Related_Nod gives the place where this type
394 -- has to be inserted in the tree. The Related_Id and Suffix parameters
395 -- are used to build the associated Implicit type name.
397 procedure Constrain_Concurrent
398 (Def_Id : in out Entity_Id;
400 Related_Nod : Node_Id;
401 Related_Id : Entity_Id;
403 -- Apply list of discriminant constraints to an unconstrained concurrent
406 -- SI is the N_Subtype_Indication node containing the constraint and
407 -- the unconstrained type to constrain.
409 -- Def_Id is the entity for the resulting constrained subtype. A value
410 -- of Empty for Def_Id indicates that an implicit type must be created,
411 -- but creation is delayed (and must be done by this procedure) because
412 -- other subsidiary implicit types must be created first (which is why
413 -- Def_Id is an in/out parameter).
415 -- Related_Nod gives the place where this type has to be inserted
418 -- The last two arguments are used to create its external name if needed.
420 function Constrain_Corresponding_Record
421 (Prot_Subt : Entity_Id;
422 Corr_Rec : Entity_Id;
423 Related_Nod : Node_Id;
424 Related_Id : Entity_Id) return Entity_Id;
425 -- When constraining a protected type or task type with discriminants,
426 -- constrain the corresponding record with the same discriminant values.
428 procedure Constrain_Decimal (Def_Id : Node_Id; S : Node_Id);
429 -- Constrain a decimal fixed point type with a digits constraint and/or a
430 -- range constraint, and build E_Decimal_Fixed_Point_Subtype entity.
432 procedure Constrain_Discriminated_Type
435 Related_Nod : Node_Id;
436 For_Access : Boolean := False);
437 -- Process discriminant constraints of composite type. Verify that values
438 -- have been provided for all discriminants, that the original type is
439 -- unconstrained, and that the types of the supplied expressions match
440 -- the discriminant types. The first three parameters are like in routine
441 -- Constrain_Concurrent. See Build_Discriminated_Subtype for an explanation
444 procedure Constrain_Enumeration (Def_Id : Node_Id; S : Node_Id);
445 -- Constrain an enumeration type with a range constraint. This is identical
446 -- to Constrain_Integer, but for the Ekind of the resulting subtype.
448 procedure Constrain_Float (Def_Id : Node_Id; S : Node_Id);
449 -- Constrain a floating point type with either a digits constraint
450 -- and/or a range constraint, building a E_Floating_Point_Subtype.
452 procedure Constrain_Index
455 Related_Nod : Node_Id;
456 Related_Id : Entity_Id;
459 -- Process an index constraint in a constrained array declaration. The
460 -- constraint can be a subtype name, or a range with or without an explicit
461 -- subtype mark. The index is the corresponding index of the unconstrained
462 -- array. The Related_Id and Suffix parameters are used to build the
463 -- associated Implicit type name.
465 procedure Constrain_Integer (Def_Id : Node_Id; S : Node_Id);
466 -- Build subtype of a signed or modular integer type
468 procedure Constrain_Ordinary_Fixed (Def_Id : Node_Id; S : Node_Id);
469 -- Constrain an ordinary fixed point type with a range constraint, and
470 -- build an E_Ordinary_Fixed_Point_Subtype entity.
472 procedure Copy_And_Swap (Priv, Full : Entity_Id);
473 -- Copy the Priv entity into the entity of its full declaration then swap
474 -- the two entities in such a manner that the former private type is now
475 -- seen as a full type.
477 procedure Decimal_Fixed_Point_Type_Declaration
480 -- Create a new decimal fixed point type, and apply the constraint to
481 -- obtain a subtype of this new type.
483 procedure Complete_Private_Subtype
486 Full_Base : Entity_Id;
487 Related_Nod : Node_Id);
488 -- Complete the implicit full view of a private subtype by setting the
489 -- appropriate semantic fields. If the full view of the parent is a record
490 -- type, build constrained components of subtype.
492 procedure Derive_Progenitor_Subprograms
493 (Parent_Type : Entity_Id;
494 Tagged_Type : Entity_Id);
495 -- Ada 2005 (AI-251): To complete type derivation, collect the primitive
496 -- operations of progenitors of Tagged_Type, and replace the subsidiary
497 -- subtypes with Tagged_Type, to build the specs of the inherited interface
498 -- primitives. The derived primitives are aliased to those of the
499 -- interface. This routine takes care also of transferring to the full-view
500 -- subprograms associated with the partial-view of Tagged_Type that cover
501 -- interface primitives.
503 procedure Derived_Standard_Character
505 Parent_Type : Entity_Id;
506 Derived_Type : Entity_Id);
507 -- Subsidiary procedure to Build_Derived_Enumeration_Type which handles
508 -- derivations from types Standard.Character and Standard.Wide_Character.
510 procedure Derived_Type_Declaration
513 Is_Completion : Boolean);
514 -- Process a derived type declaration. Build_Derived_Type is invoked
515 -- to process the actual derived type definition. Parameters N and
516 -- Is_Completion have the same meaning as in Build_Derived_Type.
517 -- T is the N_Defining_Identifier for the entity defined in the
518 -- N_Full_Type_Declaration node N, that is T is the derived type.
520 procedure Enumeration_Type_Declaration (T : Entity_Id; Def : Node_Id);
521 -- Insert each literal in symbol table, as an overloadable identifier. Each
522 -- enumeration type is mapped into a sequence of integers, and each literal
523 -- is defined as a constant with integer value. If any of the literals are
524 -- character literals, the type is a character type, which means that
525 -- strings are legal aggregates for arrays of components of the type.
527 function Expand_To_Stored_Constraint
529 Constraint : Elist_Id) return Elist_Id;
530 -- Given a constraint (i.e. a list of expressions) on the discriminants of
531 -- Typ, expand it into a constraint on the stored discriminants and return
532 -- the new list of expressions constraining the stored discriminants.
534 function Find_Type_Of_Object
536 Related_Nod : Node_Id) return Entity_Id;
537 -- Get type entity for object referenced by Obj_Def, attaching the
538 -- implicit types generated to Related_Nod
540 procedure Floating_Point_Type_Declaration (T : Entity_Id; Def : Node_Id);
541 -- Create a new float and apply the constraint to obtain subtype of it
543 function Has_Range_Constraint (N : Node_Id) return Boolean;
544 -- Given an N_Subtype_Indication node N, return True if a range constraint
545 -- is present, either directly, or as part of a digits or delta constraint.
546 -- In addition, a digits constraint in the decimal case returns True, since
547 -- it establishes a default range if no explicit range is present.
549 function Inherit_Components
551 Parent_Base : Entity_Id;
552 Derived_Base : Entity_Id;
554 Inherit_Discr : Boolean;
555 Discs : Elist_Id) return Elist_Id;
556 -- Called from Build_Derived_Record_Type to inherit the components of
557 -- Parent_Base (a base type) into the Derived_Base (the derived base type).
558 -- For more information on derived types and component inheritance please
559 -- consult the comment above the body of Build_Derived_Record_Type.
561 -- N is the original derived type declaration
563 -- Is_Tagged is set if we are dealing with tagged types
565 -- If Inherit_Discr is set, Derived_Base inherits its discriminants from
566 -- Parent_Base, otherwise no discriminants are inherited.
568 -- Discs gives the list of constraints that apply to Parent_Base in the
569 -- derived type declaration. If Discs is set to No_Elist, then we have
570 -- the following situation:
572 -- type Parent (D1..Dn : ..) is [tagged] record ...;
573 -- type Derived is new Parent [with ...];
575 -- which gets treated as
577 -- type Derived (D1..Dn : ..) is new Parent (D1,..,Dn) [with ...];
579 -- For untagged types the returned value is an association list. The list
580 -- starts from the association (Parent_Base => Derived_Base), and then it
581 -- contains a sequence of the associations of the form
583 -- (Old_Component => New_Component),
585 -- where Old_Component is the Entity_Id of a component in Parent_Base and
586 -- New_Component is the Entity_Id of the corresponding component in
587 -- Derived_Base. For untagged records, this association list is needed when
588 -- copying the record declaration for the derived base. In the tagged case
589 -- the value returned is irrelevant.
591 function Is_Progenitor
593 Typ : Entity_Id) return Boolean;
594 -- Determine whether type Typ implements interface Iface. This requires
595 -- traversing the list of abstract interfaces of the type, as well as that
596 -- of the ancestor types. The predicate is used to determine when a formal
597 -- in the signature of an inherited operation must carry the derived type.
599 function Is_Valid_Constraint_Kind
601 Constraint_Kind : Node_Kind) return Boolean;
602 -- Returns True if it is legal to apply the given kind of constraint to the
603 -- given kind of type (index constraint to an array type, for example).
605 procedure Modular_Type_Declaration (T : Entity_Id; Def : Node_Id);
606 -- Create new modular type. Verify that modulus is in bounds and is
607 -- a power of two (implementation restriction).
609 procedure New_Concatenation_Op (Typ : Entity_Id);
610 -- Create an abbreviated declaration for an operator in order to
611 -- materialize concatenation on array types.
613 procedure Ordinary_Fixed_Point_Type_Declaration
616 -- Create a new ordinary fixed point type, and apply the constraint to
617 -- obtain subtype of it.
619 procedure Prepare_Private_Subtype_Completion
621 Related_Nod : Node_Id);
622 -- Id is a subtype of some private type. Creates the full declaration
623 -- associated with Id whenever possible, i.e. when the full declaration
624 -- of the base type is already known. Records each subtype into
625 -- Private_Dependents of the base type.
627 procedure Process_Incomplete_Dependents
631 -- Process all entities that depend on an incomplete type. There include
632 -- subtypes, subprogram types that mention the incomplete type in their
633 -- profiles, and subprogram with access parameters that designate the
636 -- Inc_T is the defining identifier of an incomplete type declaration, its
637 -- Ekind is E_Incomplete_Type.
639 -- N is the corresponding N_Full_Type_Declaration for Inc_T.
641 -- Full_T is N's defining identifier.
643 -- Subtypes of incomplete types with discriminants are completed when the
644 -- parent type is. This is simpler than private subtypes, because they can
645 -- only appear in the same scope, and there is no need to exchange views.
646 -- Similarly, access_to_subprogram types may have a parameter or a return
647 -- type that is an incomplete type, and that must be replaced with the
650 -- If the full type is tagged, subprogram with access parameters that
651 -- designated the incomplete may be primitive operations of the full type,
652 -- and have to be processed accordingly.
654 procedure Process_Real_Range_Specification (Def : Node_Id);
655 -- Given the type definition for a real type, this procedure processes and
656 -- checks the real range specification of this type definition if one is
657 -- present. If errors are found, error messages are posted, and the
658 -- Real_Range_Specification of Def is reset to Empty.
660 procedure Record_Type_Declaration
664 -- Process a record type declaration (for both untagged and tagged
665 -- records). Parameters T and N are exactly like in procedure
666 -- Derived_Type_Declaration, except that no flag Is_Completion is needed
667 -- for this routine. If this is the completion of an incomplete type
668 -- declaration, Prev is the entity of the incomplete declaration, used for
669 -- cross-referencing. Otherwise Prev = T.
671 procedure Record_Type_Definition (Def : Node_Id; Prev_T : Entity_Id);
672 -- This routine is used to process the actual record type definition (both
673 -- for untagged and tagged records). Def is a record type definition node.
674 -- This procedure analyzes the components in this record type definition.
675 -- Prev_T is the entity for the enclosing record type. It is provided so
676 -- that its Has_Task flag can be set if any of the component have Has_Task
677 -- set. If the declaration is the completion of an incomplete type
678 -- declaration, Prev_T is the original incomplete type, whose full view is
681 procedure Replace_Components (Typ : Entity_Id; Decl : Node_Id);
682 -- Subsidiary to Build_Derived_Record_Type. For untagged records, we
683 -- build a copy of the declaration tree of the parent, and we create
684 -- independently the list of components for the derived type. Semantic
685 -- information uses the component entities, but record representation
686 -- clauses are validated on the declaration tree. This procedure replaces
687 -- discriminants and components in the declaration with those that have
688 -- been created by Inherit_Components.
690 procedure Set_Fixed_Range
695 -- Build a range node with the given bounds and set it as the Scalar_Range
696 -- of the given fixed-point type entity. Loc is the source location used
697 -- for the constructed range. See body for further details.
699 procedure Set_Scalar_Range_For_Subtype
703 -- This routine is used to set the scalar range field for a subtype given
704 -- Def_Id, the entity for the subtype, and R, the range expression for the
705 -- scalar range. Subt provides the parent subtype to be used to analyze,
706 -- resolve, and check the given range.
708 procedure Signed_Integer_Type_Declaration (T : Entity_Id; Def : Node_Id);
709 -- Create a new signed integer entity, and apply the constraint to obtain
710 -- the required first named subtype of this type.
712 procedure Set_Stored_Constraint_From_Discriminant_Constraint
714 -- E is some record type. This routine computes E's Stored_Constraint
715 -- from its Discriminant_Constraint.
717 procedure Diagnose_Interface (N : Node_Id; E : Entity_Id);
718 -- Check that an entity in a list of progenitors is an interface,
719 -- emit error otherwise.
721 -----------------------
722 -- Access_Definition --
723 -----------------------
725 function Access_Definition
726 (Related_Nod : Node_Id;
727 N : Node_Id) return Entity_Id
729 Loc : constant Source_Ptr := Sloc (Related_Nod);
730 Anon_Type : Entity_Id;
731 Anon_Scope : Entity_Id;
732 Desig_Type : Entity_Id;
734 Enclosing_Prot_Type : Entity_Id := Empty;
737 if Is_Entry (Current_Scope)
738 and then Is_Task_Type (Etype (Scope (Current_Scope)))
740 Error_Msg_N ("task entries cannot have access parameters", N);
744 -- Ada 2005: for an object declaration the corresponding anonymous
745 -- type is declared in the current scope.
747 -- If the access definition is the return type of another access to
748 -- function, scope is the current one, because it is the one of the
749 -- current type declaration.
751 if Nkind_In (Related_Nod, N_Object_Declaration,
752 N_Access_Function_Definition)
754 Anon_Scope := Current_Scope;
756 -- For the anonymous function result case, retrieve the scope of the
757 -- function specification's associated entity rather than using the
758 -- current scope. The current scope will be the function itself if the
759 -- formal part is currently being analyzed, but will be the parent scope
760 -- in the case of a parameterless function, and we always want to use
761 -- the function's parent scope. Finally, if the function is a child
762 -- unit, we must traverse the tree to retrieve the proper entity.
764 elsif Nkind (Related_Nod) = N_Function_Specification
765 and then Nkind (Parent (N)) /= N_Parameter_Specification
767 -- If the current scope is a protected type, the anonymous access
768 -- is associated with one of the protected operations, and must
769 -- be available in the scope that encloses the protected declaration.
770 -- Otherwise the type is in the scope enclosing the subprogram.
771 -- If the function has formals, The return type of a subprogram
772 -- declaration is analyzed in the scope of the subprogram (see
773 -- Process_Formals) and thus the protected type, if present, is
774 -- the scope of the current function scope.
776 if Ekind (Current_Scope) = E_Protected_Type then
777 Enclosing_Prot_Type := Current_Scope;
779 elsif Ekind (Current_Scope) = E_Function
780 and then Ekind (Scope (Current_Scope)) = E_Protected_Type
782 Enclosing_Prot_Type := Scope (Current_Scope);
785 if Present (Enclosing_Prot_Type) then
786 Anon_Scope := Scope (Enclosing_Prot_Type);
789 Anon_Scope := Scope (Defining_Entity (Related_Nod));
793 -- For access formals, access components, and access discriminants,
794 -- the scope is that of the enclosing declaration,
796 Anon_Scope := Scope (Current_Scope);
801 (E_Anonymous_Access_Type, Related_Nod, Scope_Id => Anon_Scope);
804 and then Ada_Version >= Ada_05
806 Error_Msg_N ("ALL is not permitted for anonymous access types", N);
809 -- Ada 2005 (AI-254): In case of anonymous access to subprograms call
810 -- the corresponding semantic routine
812 if Present (Access_To_Subprogram_Definition (N)) then
813 Access_Subprogram_Declaration
814 (T_Name => Anon_Type,
815 T_Def => Access_To_Subprogram_Definition (N));
817 if Ekind (Anon_Type) = E_Access_Protected_Subprogram_Type then
819 (Anon_Type, E_Anonymous_Access_Protected_Subprogram_Type);
822 (Anon_Type, E_Anonymous_Access_Subprogram_Type);
825 Set_Can_Use_Internal_Rep
826 (Anon_Type, not Always_Compatible_Rep_On_Target);
828 -- If the anonymous access is associated with a protected operation
829 -- create a reference to it after the enclosing protected definition
830 -- because the itype will be used in the subsequent bodies.
832 if Ekind (Current_Scope) = E_Protected_Type then
833 Build_Itype_Reference (Anon_Type, Parent (Current_Scope));
839 Find_Type (Subtype_Mark (N));
840 Desig_Type := Entity (Subtype_Mark (N));
842 Set_Directly_Designated_Type
843 (Anon_Type, Desig_Type);
844 Set_Etype (Anon_Type, Anon_Type);
846 -- Make sure the anonymous access type has size and alignment fields
847 -- set, as required by gigi. This is necessary in the case of the
848 -- Task_Body_Procedure.
850 if not Has_Private_Component (Desig_Type) then
851 Layout_Type (Anon_Type);
854 -- ???The following makes no sense, because Anon_Type is an access type
855 -- and therefore cannot have components, private or otherwise. Hence
856 -- the assertion. Not sure what was meant, here.
857 Set_Depends_On_Private (Anon_Type, Has_Private_Component (Anon_Type));
858 pragma Assert (not Depends_On_Private (Anon_Type));
860 -- Ada 2005 (AI-231): Ada 2005 semantics for anonymous access differs
861 -- from Ada 95 semantics. In Ada 2005, anonymous access must specify if
862 -- the null value is allowed. In Ada 95 the null value is never allowed.
864 if Ada_Version >= Ada_05 then
865 Set_Can_Never_Be_Null (Anon_Type, Null_Exclusion_Present (N));
867 Set_Can_Never_Be_Null (Anon_Type, True);
870 -- The anonymous access type is as public as the discriminated type or
871 -- subprogram that defines it. It is imported (for back-end purposes)
872 -- if the designated type is.
874 Set_Is_Public (Anon_Type, Is_Public (Scope (Anon_Type)));
876 -- Ada 2005 (AI-50217): Propagate the attribute that indicates that the
877 -- designated type comes from the limited view.
879 Set_From_With_Type (Anon_Type, From_With_Type (Desig_Type));
881 -- Ada 2005 (AI-231): Propagate the access-constant attribute
883 Set_Is_Access_Constant (Anon_Type, Constant_Present (N));
885 -- The context is either a subprogram declaration, object declaration,
886 -- or an access discriminant, in a private or a full type declaration.
887 -- In the case of a subprogram, if the designated type is incomplete,
888 -- the operation will be a primitive operation of the full type, to be
889 -- updated subsequently. If the type is imported through a limited_with
890 -- clause, the subprogram is not a primitive operation of the type
891 -- (which is declared elsewhere in some other scope).
893 if Ekind (Desig_Type) = E_Incomplete_Type
894 and then not From_With_Type (Desig_Type)
895 and then Is_Overloadable (Current_Scope)
897 Append_Elmt (Current_Scope, Private_Dependents (Desig_Type));
898 Set_Has_Delayed_Freeze (Current_Scope);
901 -- Ada 2005: if the designated type is an interface that may contain
902 -- tasks, create a Master entity for the declaration. This must be done
903 -- before expansion of the full declaration, because the declaration may
904 -- include an expression that is an allocator, whose expansion needs the
905 -- proper Master for the created tasks.
907 if Nkind (Related_Nod) = N_Object_Declaration
908 and then Expander_Active
910 if Is_Interface (Desig_Type)
911 and then Is_Limited_Record (Desig_Type)
913 Build_Class_Wide_Master (Anon_Type);
915 -- Similarly, if the type is an anonymous access that designates
916 -- tasks, create a master entity for it in the current context.
918 elsif Has_Task (Desig_Type)
919 and then Comes_From_Source (Related_Nod)
921 if not Has_Master_Entity (Current_Scope) then
923 Make_Object_Declaration (Loc,
924 Defining_Identifier =>
925 Make_Defining_Identifier (Loc, Name_uMaster),
926 Constant_Present => True,
928 New_Reference_To (RTE (RE_Master_Id), Loc),
930 Make_Explicit_Dereference (Loc,
931 New_Reference_To (RTE (RE_Current_Master), Loc)));
933 Insert_Before (Related_Nod, Decl);
936 Set_Master_Id (Anon_Type, Defining_Identifier (Decl));
937 Set_Has_Master_Entity (Current_Scope);
939 Build_Master_Renaming (Related_Nod, Anon_Type);
944 -- For a private component of a protected type, it is imperative that
945 -- the back-end elaborate the type immediately after the protected
946 -- declaration, because this type will be used in the declarations
947 -- created for the component within each protected body, so we must
948 -- create an itype reference for it now.
950 if Nkind (Parent (Related_Nod)) = N_Protected_Definition then
951 Build_Itype_Reference (Anon_Type, Parent (Parent (Related_Nod)));
953 -- Similarly, if the access definition is the return result of a
954 -- function, create an itype reference for it because it
955 -- will be used within the function body. For a regular function that
956 -- is not a compilation unit, insert reference after the declaration.
957 -- For a protected operation, insert it after the enclosing protected
958 -- type declaration. In either case, do not create a reference for a
959 -- type obtained through a limited_with clause, because this would
960 -- introduce semantic dependencies.
962 elsif Nkind (Related_Nod) = N_Function_Specification
963 and then not From_With_Type (Anon_Type)
965 if Present (Enclosing_Prot_Type) then
966 Build_Itype_Reference (Anon_Type, Parent (Enclosing_Prot_Type));
968 elsif Is_List_Member (Parent (Related_Nod))
969 and then Nkind (Parent (N)) /= N_Parameter_Specification
971 Build_Itype_Reference (Anon_Type, Parent (Related_Nod));
974 -- Finally, create an itype reference for an object declaration of
975 -- an anonymous access type. This is strictly necessary only for
976 -- deferred constants, but in any case will avoid out-of-scope
977 -- problems in the back-end.
979 elsif Nkind (Related_Nod) = N_Object_Declaration then
980 Build_Itype_Reference (Anon_Type, Related_Nod);
984 end Access_Definition;
986 -----------------------------------
987 -- Access_Subprogram_Declaration --
988 -----------------------------------
990 procedure Access_Subprogram_Declaration
995 procedure Check_For_Premature_Usage (Def : Node_Id);
996 -- Check that type T_Name is not used, directly or recursively, as a
997 -- parameter or a return type in Def. Def is either a subtype, an
998 -- access_definition, or an access_to_subprogram_definition.
1000 -------------------------------
1001 -- Check_For_Premature_Usage --
1002 -------------------------------
1004 procedure Check_For_Premature_Usage (Def : Node_Id) is
1008 -- Check for a subtype mark
1010 if Nkind (Def) in N_Has_Etype then
1011 if Etype (Def) = T_Name then
1013 ("type& cannot be used before end of its declaration", Def);
1016 -- If this is not a subtype, then this is an access_definition
1018 elsif Nkind (Def) = N_Access_Definition then
1019 if Present (Access_To_Subprogram_Definition (Def)) then
1020 Check_For_Premature_Usage
1021 (Access_To_Subprogram_Definition (Def));
1023 Check_For_Premature_Usage (Subtype_Mark (Def));
1026 -- The only cases left are N_Access_Function_Definition and
1027 -- N_Access_Procedure_Definition.
1030 if Present (Parameter_Specifications (Def)) then
1031 Param := First (Parameter_Specifications (Def));
1032 while Present (Param) loop
1033 Check_For_Premature_Usage (Parameter_Type (Param));
1034 Param := Next (Param);
1038 if Nkind (Def) = N_Access_Function_Definition then
1039 Check_For_Premature_Usage (Result_Definition (Def));
1042 end Check_For_Premature_Usage;
1046 Formals : constant List_Id := Parameter_Specifications (T_Def);
1049 Desig_Type : constant Entity_Id :=
1050 Create_Itype (E_Subprogram_Type, Parent (T_Def));
1052 -- Start of processing for Access_Subprogram_Declaration
1055 -- Associate the Itype node with the inner full-type declaration or
1056 -- subprogram spec. This is required to handle nested anonymous
1057 -- declarations. For example:
1060 -- (X : access procedure
1061 -- (Y : access procedure
1064 D_Ityp := Associated_Node_For_Itype (Desig_Type);
1065 while not (Nkind_In (D_Ityp, N_Full_Type_Declaration,
1066 N_Private_Type_Declaration,
1067 N_Private_Extension_Declaration,
1068 N_Procedure_Specification,
1069 N_Function_Specification)
1071 Nkind_In (D_Ityp, N_Object_Declaration,
1072 N_Object_Renaming_Declaration,
1073 N_Formal_Object_Declaration,
1074 N_Formal_Type_Declaration,
1075 N_Task_Type_Declaration,
1076 N_Protected_Type_Declaration))
1078 D_Ityp := Parent (D_Ityp);
1079 pragma Assert (D_Ityp /= Empty);
1082 Set_Associated_Node_For_Itype (Desig_Type, D_Ityp);
1084 if Nkind_In (D_Ityp, N_Procedure_Specification,
1085 N_Function_Specification)
1087 Set_Scope (Desig_Type, Scope (Defining_Entity (D_Ityp)));
1089 elsif Nkind_In (D_Ityp, N_Full_Type_Declaration,
1090 N_Object_Declaration,
1091 N_Object_Renaming_Declaration,
1092 N_Formal_Type_Declaration)
1094 Set_Scope (Desig_Type, Scope (Defining_Identifier (D_Ityp)));
1097 if Nkind (T_Def) = N_Access_Function_Definition then
1098 if Nkind (Result_Definition (T_Def)) = N_Access_Definition then
1100 Acc : constant Node_Id := Result_Definition (T_Def);
1103 if Present (Access_To_Subprogram_Definition (Acc))
1105 Protected_Present (Access_To_Subprogram_Definition (Acc))
1109 Replace_Anonymous_Access_To_Protected_Subprogram
1115 Access_Definition (T_Def, Result_Definition (T_Def)));
1120 Analyze (Result_Definition (T_Def));
1123 Typ : constant Entity_Id := Entity (Result_Definition (T_Def));
1126 -- If a null exclusion is imposed on the result type, then
1127 -- create a null-excluding itype (an access subtype) and use
1128 -- it as the function's Etype.
1130 if Is_Access_Type (Typ)
1131 and then Null_Exclusion_In_Return_Present (T_Def)
1133 Set_Etype (Desig_Type,
1134 Create_Null_Excluding_Itype
1136 Related_Nod => T_Def,
1137 Scope_Id => Current_Scope));
1140 if From_With_Type (Typ) then
1142 ("illegal use of incomplete type&",
1143 Result_Definition (T_Def), Typ);
1145 elsif Ekind (Current_Scope) = E_Package
1146 and then In_Private_Part (Current_Scope)
1148 if Ekind (Typ) = E_Incomplete_Type then
1149 Append_Elmt (Desig_Type, Private_Dependents (Typ));
1151 elsif Is_Class_Wide_Type (Typ)
1152 and then Ekind (Etype (Typ)) = E_Incomplete_Type
1155 (Desig_Type, Private_Dependents (Etype (Typ)));
1159 Set_Etype (Desig_Type, Typ);
1164 if not (Is_Type (Etype (Desig_Type))) then
1166 ("expect type in function specification",
1167 Result_Definition (T_Def));
1171 Set_Etype (Desig_Type, Standard_Void_Type);
1174 if Present (Formals) then
1175 Push_Scope (Desig_Type);
1177 -- A bit of a kludge here. These kludges will be removed when Itypes
1178 -- have proper parent pointers to their declarations???
1180 -- Kludge 1) Link defining_identifier of formals. Required by
1181 -- First_Formal to provide its functionality.
1187 F := First (Formals);
1188 while Present (F) loop
1189 if No (Parent (Defining_Identifier (F))) then
1190 Set_Parent (Defining_Identifier (F), F);
1197 Process_Formals (Formals, Parent (T_Def));
1199 -- Kludge 2) End_Scope requires that the parent pointer be set to
1200 -- something reasonable, but Itypes don't have parent pointers. So
1201 -- we set it and then unset it ???
1203 Set_Parent (Desig_Type, T_Name);
1205 Set_Parent (Desig_Type, Empty);
1208 -- Check for premature usage of the type being defined
1210 Check_For_Premature_Usage (T_Def);
1212 -- The return type and/or any parameter type may be incomplete. Mark
1213 -- the subprogram_type as depending on the incomplete type, so that
1214 -- it can be updated when the full type declaration is seen. This
1215 -- only applies to incomplete types declared in some enclosing scope,
1216 -- not to limited views from other packages.
1218 if Present (Formals) then
1219 Formal := First_Formal (Desig_Type);
1220 while Present (Formal) loop
1221 if Ekind (Formal) /= E_In_Parameter
1222 and then Nkind (T_Def) = N_Access_Function_Definition
1224 Error_Msg_N ("functions can only have IN parameters", Formal);
1227 if Ekind (Etype (Formal)) = E_Incomplete_Type
1228 and then In_Open_Scopes (Scope (Etype (Formal)))
1230 Append_Elmt (Desig_Type, Private_Dependents (Etype (Formal)));
1231 Set_Has_Delayed_Freeze (Desig_Type);
1234 Next_Formal (Formal);
1238 -- If the return type is incomplete, this is legal as long as the
1239 -- type is declared in the current scope and will be completed in
1240 -- it (rather than being part of limited view).
1242 if Ekind (Etype (Desig_Type)) = E_Incomplete_Type
1243 and then not Has_Delayed_Freeze (Desig_Type)
1244 and then In_Open_Scopes (Scope (Etype (Desig_Type)))
1246 Append_Elmt (Desig_Type, Private_Dependents (Etype (Desig_Type)));
1247 Set_Has_Delayed_Freeze (Desig_Type);
1250 Check_Delayed_Subprogram (Desig_Type);
1252 if Protected_Present (T_Def) then
1253 Set_Ekind (T_Name, E_Access_Protected_Subprogram_Type);
1254 Set_Convention (Desig_Type, Convention_Protected);
1256 Set_Ekind (T_Name, E_Access_Subprogram_Type);
1259 Set_Can_Use_Internal_Rep (T_Name, not Always_Compatible_Rep_On_Target);
1261 Set_Etype (T_Name, T_Name);
1262 Init_Size_Align (T_Name);
1263 Set_Directly_Designated_Type (T_Name, Desig_Type);
1265 -- Ada 2005 (AI-231): Propagate the null-excluding attribute
1267 Set_Can_Never_Be_Null (T_Name, Null_Exclusion_Present (T_Def));
1269 Check_Restriction (No_Access_Subprograms, T_Def);
1270 end Access_Subprogram_Declaration;
1272 ----------------------------
1273 -- Access_Type_Declaration --
1274 ----------------------------
1276 procedure Access_Type_Declaration (T : Entity_Id; Def : Node_Id) is
1277 S : constant Node_Id := Subtype_Indication (Def);
1278 P : constant Node_Id := Parent (Def);
1284 -- Check for permissible use of incomplete type
1286 if Nkind (S) /= N_Subtype_Indication then
1289 if Ekind (Root_Type (Entity (S))) = E_Incomplete_Type then
1290 Set_Directly_Designated_Type (T, Entity (S));
1292 Set_Directly_Designated_Type (T,
1293 Process_Subtype (S, P, T, 'P'));
1297 Set_Directly_Designated_Type (T,
1298 Process_Subtype (S, P, T, 'P'));
1301 if All_Present (Def) or Constant_Present (Def) then
1302 Set_Ekind (T, E_General_Access_Type);
1304 Set_Ekind (T, E_Access_Type);
1307 if Base_Type (Designated_Type (T)) = T then
1308 Error_Msg_N ("access type cannot designate itself", S);
1310 -- In Ada 2005, the type may have a limited view through some unit
1311 -- in its own context, allowing the following circularity that cannot
1312 -- be detected earlier
1314 elsif Is_Class_Wide_Type (Designated_Type (T))
1315 and then Etype (Designated_Type (T)) = T
1318 ("access type cannot designate its own classwide type", S);
1320 -- Clean up indication of tagged status to prevent cascaded errors
1322 Set_Is_Tagged_Type (T, False);
1327 -- If the type has appeared already in a with_type clause, it is
1328 -- frozen and the pointer size is already set. Else, initialize.
1330 if not From_With_Type (T) then
1331 Init_Size_Align (T);
1334 Desig := Designated_Type (T);
1336 -- If designated type is an imported tagged type, indicate that the
1337 -- access type is also imported, and therefore restricted in its use.
1338 -- The access type may already be imported, so keep setting otherwise.
1340 -- Ada 2005 (AI-50217): If the non-limited view of the designated type
1341 -- is available, use it as the designated type of the access type, so
1342 -- that the back-end gets a usable entity.
1344 if From_With_Type (Desig)
1345 and then Ekind (Desig) /= E_Access_Type
1347 Set_From_With_Type (T);
1350 -- Note that Has_Task is always false, since the access type itself
1351 -- is not a task type. See Einfo for more description on this point.
1352 -- Exactly the same consideration applies to Has_Controlled_Component.
1354 Set_Has_Task (T, False);
1355 Set_Has_Controlled_Component (T, False);
1357 -- Initialize Associated_Final_Chain explicitly to Empty, to avoid
1358 -- problems where an incomplete view of this entity has been previously
1359 -- established by a limited with and an overlaid version of this field
1360 -- (Stored_Constraint) was initialized for the incomplete view.
1362 Set_Associated_Final_Chain (T, Empty);
1364 -- Ada 2005 (AI-231): Propagate the null-excluding and access-constant
1367 Set_Can_Never_Be_Null (T, Null_Exclusion_Present (Def));
1368 Set_Is_Access_Constant (T, Constant_Present (Def));
1369 end Access_Type_Declaration;
1371 ----------------------------------
1372 -- Add_Interface_Tag_Components --
1373 ----------------------------------
1375 procedure Add_Interface_Tag_Components (N : Node_Id; Typ : Entity_Id) is
1376 Loc : constant Source_Ptr := Sloc (N);
1380 procedure Add_Tag (Iface : Entity_Id);
1381 -- Add tag for one of the progenitor interfaces
1387 procedure Add_Tag (Iface : Entity_Id) is
1394 pragma Assert (Is_Tagged_Type (Iface)
1395 and then Is_Interface (Iface));
1398 Make_Component_Definition (Loc,
1399 Aliased_Present => True,
1400 Subtype_Indication =>
1401 New_Occurrence_Of (RTE (RE_Interface_Tag), Loc));
1403 Tag := Make_Defining_Identifier (Loc, New_Internal_Name ('V'));
1406 Make_Component_Declaration (Loc,
1407 Defining_Identifier => Tag,
1408 Component_Definition => Def);
1410 Analyze_Component_Declaration (Decl);
1412 Set_Analyzed (Decl);
1413 Set_Ekind (Tag, E_Component);
1415 Set_Is_Aliased (Tag);
1416 Set_Related_Type (Tag, Iface);
1417 Init_Component_Location (Tag);
1419 pragma Assert (Is_Frozen (Iface));
1421 Set_DT_Entry_Count (Tag,
1422 DT_Entry_Count (First_Entity (Iface)));
1424 if No (Last_Tag) then
1427 Insert_After (Last_Tag, Decl);
1432 -- If the ancestor has discriminants we need to give special support
1433 -- to store the offset_to_top value of the secondary dispatch tables.
1434 -- For this purpose we add a supplementary component just after the
1435 -- field that contains the tag associated with each secondary DT.
1437 if Typ /= Etype (Typ)
1438 and then Has_Discriminants (Etype (Typ))
1441 Make_Component_Definition (Loc,
1442 Subtype_Indication =>
1443 New_Occurrence_Of (RTE (RE_Storage_Offset), Loc));
1446 Make_Defining_Identifier (Loc, New_Internal_Name ('V'));
1449 Make_Component_Declaration (Loc,
1450 Defining_Identifier => Offset,
1451 Component_Definition => Def);
1453 Analyze_Component_Declaration (Decl);
1455 Set_Analyzed (Decl);
1456 Set_Ekind (Offset, E_Component);
1457 Set_Is_Aliased (Offset);
1458 Set_Related_Type (Offset, Iface);
1459 Init_Component_Location (Offset);
1460 Insert_After (Last_Tag, Decl);
1471 -- Start of processing for Add_Interface_Tag_Components
1474 if not RTE_Available (RE_Interface_Tag) then
1476 ("(Ada 2005) interface types not supported by this run-time!",
1481 if Ekind (Typ) /= E_Record_Type
1482 or else (Is_Concurrent_Record_Type (Typ)
1483 and then Is_Empty_List (Abstract_Interface_List (Typ)))
1484 or else (not Is_Concurrent_Record_Type (Typ)
1485 and then No (Interfaces (Typ))
1486 and then Is_Empty_Elmt_List (Interfaces (Typ)))
1491 -- Find the current last tag
1493 if Nkind (Type_Definition (N)) = N_Derived_Type_Definition then
1494 Ext := Record_Extension_Part (Type_Definition (N));
1496 pragma Assert (Nkind (Type_Definition (N)) = N_Record_Definition);
1497 Ext := Type_Definition (N);
1502 if not (Present (Component_List (Ext))) then
1503 Set_Null_Present (Ext, False);
1505 Set_Component_List (Ext,
1506 Make_Component_List (Loc,
1507 Component_Items => L,
1508 Null_Present => False));
1510 if Nkind (Type_Definition (N)) = N_Derived_Type_Definition then
1511 L := Component_Items
1513 (Record_Extension_Part
1514 (Type_Definition (N))));
1516 L := Component_Items
1518 (Type_Definition (N)));
1521 -- Find the last tag component
1524 while Present (Comp) loop
1525 if Nkind (Comp) = N_Component_Declaration
1526 and then Is_Tag (Defining_Identifier (Comp))
1535 -- At this point L references the list of components and Last_Tag
1536 -- references the current last tag (if any). Now we add the tag
1537 -- corresponding with all the interfaces that are not implemented
1540 if Present (Interfaces (Typ)) then
1541 Elmt := First_Elmt (Interfaces (Typ));
1542 while Present (Elmt) loop
1543 Add_Tag (Node (Elmt));
1547 end Add_Interface_Tag_Components;
1549 -----------------------------------
1550 -- Analyze_Component_Declaration --
1551 -----------------------------------
1553 procedure Analyze_Component_Declaration (N : Node_Id) is
1554 Id : constant Entity_Id := Defining_Identifier (N);
1555 E : constant Node_Id := Expression (N);
1559 function Contains_POC (Constr : Node_Id) return Boolean;
1560 -- Determines whether a constraint uses the discriminant of a record
1561 -- type thus becoming a per-object constraint (POC).
1563 function Is_Known_Limited (Typ : Entity_Id) return Boolean;
1564 -- Typ is the type of the current component, check whether this type is
1565 -- a limited type. Used to validate declaration against that of
1566 -- enclosing record.
1572 function Contains_POC (Constr : Node_Id) return Boolean is
1574 -- Prevent cascaded errors
1576 if Error_Posted (Constr) then
1580 case Nkind (Constr) is
1581 when N_Attribute_Reference =>
1583 Attribute_Name (Constr) = Name_Access
1584 and then Prefix (Constr) = Scope (Entity (Prefix (Constr)));
1586 when N_Discriminant_Association =>
1587 return Denotes_Discriminant (Expression (Constr));
1589 when N_Identifier =>
1590 return Denotes_Discriminant (Constr);
1592 when N_Index_Or_Discriminant_Constraint =>
1597 IDC := First (Constraints (Constr));
1598 while Present (IDC) loop
1600 -- One per-object constraint is sufficient
1602 if Contains_POC (IDC) then
1613 return Denotes_Discriminant (Low_Bound (Constr))
1615 Denotes_Discriminant (High_Bound (Constr));
1617 when N_Range_Constraint =>
1618 return Denotes_Discriminant (Range_Expression (Constr));
1626 ----------------------
1627 -- Is_Known_Limited --
1628 ----------------------
1630 function Is_Known_Limited (Typ : Entity_Id) return Boolean is
1631 P : constant Entity_Id := Etype (Typ);
1632 R : constant Entity_Id := Root_Type (Typ);
1635 if Is_Limited_Record (Typ) then
1638 -- If the root type is limited (and not a limited interface)
1639 -- so is the current type
1641 elsif Is_Limited_Record (R)
1643 (not Is_Interface (R)
1644 or else not Is_Limited_Interface (R))
1648 -- Else the type may have a limited interface progenitor, but a
1649 -- limited record parent.
1652 and then Is_Limited_Record (P)
1659 end Is_Known_Limited;
1661 -- Start of processing for Analyze_Component_Declaration
1664 Generate_Definition (Id);
1667 if Present (Subtype_Indication (Component_Definition (N))) then
1668 T := Find_Type_Of_Object
1669 (Subtype_Indication (Component_Definition (N)), N);
1671 -- Ada 2005 (AI-230): Access Definition case
1674 pragma Assert (Present
1675 (Access_Definition (Component_Definition (N))));
1677 T := Access_Definition
1679 N => Access_Definition (Component_Definition (N)));
1680 Set_Is_Local_Anonymous_Access (T);
1682 -- Ada 2005 (AI-254)
1684 if Present (Access_To_Subprogram_Definition
1685 (Access_Definition (Component_Definition (N))))
1686 and then Protected_Present (Access_To_Subprogram_Definition
1688 (Component_Definition (N))))
1690 T := Replace_Anonymous_Access_To_Protected_Subprogram (N);
1694 -- If the subtype is a constrained subtype of the enclosing record,
1695 -- (which must have a partial view) the back-end does not properly
1696 -- handle the recursion. Rewrite the component declaration with an
1697 -- explicit subtype indication, which is acceptable to Gigi. We can copy
1698 -- the tree directly because side effects have already been removed from
1699 -- discriminant constraints.
1701 if Ekind (T) = E_Access_Subtype
1702 and then Is_Entity_Name (Subtype_Indication (Component_Definition (N)))
1703 and then Comes_From_Source (T)
1704 and then Nkind (Parent (T)) = N_Subtype_Declaration
1705 and then Etype (Directly_Designated_Type (T)) = Current_Scope
1708 (Subtype_Indication (Component_Definition (N)),
1709 New_Copy_Tree (Subtype_Indication (Parent (T))));
1710 T := Find_Type_Of_Object
1711 (Subtype_Indication (Component_Definition (N)), N);
1714 -- If the component declaration includes a default expression, then we
1715 -- check that the component is not of a limited type (RM 3.7(5)),
1716 -- and do the special preanalysis of the expression (see section on
1717 -- "Handling of Default and Per-Object Expressions" in the spec of
1721 Preanalyze_Spec_Expression (E, T);
1722 Check_Initialization (T, E);
1724 if Ada_Version >= Ada_05
1725 and then Ekind (T) = E_Anonymous_Access_Type
1726 and then Etype (E) /= Any_Type
1728 -- Check RM 3.9.2(9): "if the expected type for an expression is
1729 -- an anonymous access-to-specific tagged type, then the object
1730 -- designated by the expression shall not be dynamically tagged
1731 -- unless it is a controlling operand in a call on a dispatching
1734 if Is_Tagged_Type (Directly_Designated_Type (T))
1736 Ekind (Directly_Designated_Type (T)) /= E_Class_Wide_Type
1738 Ekind (Directly_Designated_Type (Etype (E))) =
1742 ("access to specific tagged type required (RM 3.9.2(9))", E);
1745 -- (Ada 2005: AI-230): Accessibility check for anonymous
1748 if Type_Access_Level (Etype (E)) > Type_Access_Level (T) then
1750 ("expression has deeper access level than component " &
1751 "(RM 3.10.2 (12.2))", E);
1754 -- The initialization expression is a reference to an access
1755 -- discriminant. The type of the discriminant is always deeper
1756 -- than any access type.
1758 if Ekind (Etype (E)) = E_Anonymous_Access_Type
1759 and then Is_Entity_Name (E)
1760 and then Ekind (Entity (E)) = E_In_Parameter
1761 and then Present (Discriminal_Link (Entity (E)))
1764 ("discriminant has deeper accessibility level than target",
1770 -- The parent type may be a private view with unknown discriminants,
1771 -- and thus unconstrained. Regular components must be constrained.
1773 if Is_Indefinite_Subtype (T) and then Chars (Id) /= Name_uParent then
1774 if Is_Class_Wide_Type (T) then
1776 ("class-wide subtype with unknown discriminants" &
1777 " in component declaration",
1778 Subtype_Indication (Component_Definition (N)));
1781 ("unconstrained subtype in component declaration",
1782 Subtype_Indication (Component_Definition (N)));
1785 -- Components cannot be abstract, except for the special case of
1786 -- the _Parent field (case of extending an abstract tagged type)
1788 elsif Is_Abstract_Type (T) and then Chars (Id) /= Name_uParent then
1789 Error_Msg_N ("type of a component cannot be abstract", N);
1793 Set_Is_Aliased (Id, Aliased_Present (Component_Definition (N)));
1795 -- The component declaration may have a per-object constraint, set
1796 -- the appropriate flag in the defining identifier of the subtype.
1798 if Present (Subtype_Indication (Component_Definition (N))) then
1800 Sindic : constant Node_Id :=
1801 Subtype_Indication (Component_Definition (N));
1803 if Nkind (Sindic) = N_Subtype_Indication
1804 and then Present (Constraint (Sindic))
1805 and then Contains_POC (Constraint (Sindic))
1807 Set_Has_Per_Object_Constraint (Id);
1812 -- Ada 2005 (AI-231): Propagate the null-excluding attribute and carry
1813 -- out some static checks.
1815 if Ada_Version >= Ada_05
1816 and then Can_Never_Be_Null (T)
1818 Null_Exclusion_Static_Checks (N);
1821 -- If this component is private (or depends on a private type), flag the
1822 -- record type to indicate that some operations are not available.
1824 P := Private_Component (T);
1828 -- Check for circular definitions
1830 if P = Any_Type then
1831 Set_Etype (Id, Any_Type);
1833 -- There is a gap in the visibility of operations only if the
1834 -- component type is not defined in the scope of the record type.
1836 elsif Scope (P) = Scope (Current_Scope) then
1839 elsif Is_Limited_Type (P) then
1840 Set_Is_Limited_Composite (Current_Scope);
1843 Set_Is_Private_Composite (Current_Scope);
1848 and then Is_Limited_Type (T)
1849 and then Chars (Id) /= Name_uParent
1850 and then Is_Tagged_Type (Current_Scope)
1852 if Is_Derived_Type (Current_Scope)
1853 and then not Is_Known_Limited (Current_Scope)
1856 ("extension of nonlimited type cannot have limited components",
1859 if Is_Interface (Root_Type (Current_Scope)) then
1861 ("\limitedness is not inherited from limited interface", N);
1863 ("\add LIMITED to type indication", N);
1866 Explain_Limited_Type (T, N);
1867 Set_Etype (Id, Any_Type);
1868 Set_Is_Limited_Composite (Current_Scope, False);
1870 elsif not Is_Derived_Type (Current_Scope)
1871 and then not Is_Limited_Record (Current_Scope)
1872 and then not Is_Concurrent_Type (Current_Scope)
1875 ("nonlimited tagged type cannot have limited components", N);
1876 Explain_Limited_Type (T, N);
1877 Set_Etype (Id, Any_Type);
1878 Set_Is_Limited_Composite (Current_Scope, False);
1882 Set_Original_Record_Component (Id, Id);
1883 end Analyze_Component_Declaration;
1885 --------------------------
1886 -- Analyze_Declarations --
1887 --------------------------
1889 procedure Analyze_Declarations (L : List_Id) is
1891 Freeze_From : Entity_Id := Empty;
1892 Next_Node : Node_Id;
1895 -- Adjust D not to include implicit label declarations, since these
1896 -- have strange Sloc values that result in elaboration check problems.
1897 -- (They have the sloc of the label as found in the source, and that
1898 -- is ahead of the current declarative part).
1904 procedure Adjust_D is
1906 while Present (Prev (D))
1907 and then Nkind (D) = N_Implicit_Label_Declaration
1913 -- Start of processing for Analyze_Declarations
1917 while Present (D) loop
1919 -- Complete analysis of declaration
1922 Next_Node := Next (D);
1924 if No (Freeze_From) then
1925 Freeze_From := First_Entity (Current_Scope);
1928 -- At the end of a declarative part, freeze remaining entities
1929 -- declared in it. The end of the visible declarations of package
1930 -- specification is not the end of a declarative part if private
1931 -- declarations are present. The end of a package declaration is a
1932 -- freezing point only if it a library package. A task definition or
1933 -- protected type definition is not a freeze point either. Finally,
1934 -- we do not freeze entities in generic scopes, because there is no
1935 -- code generated for them and freeze nodes will be generated for
1938 -- The end of a package instantiation is not a freeze point, but
1939 -- for now we make it one, because the generic body is inserted
1940 -- (currently) immediately after. Generic instantiations will not
1941 -- be a freeze point once delayed freezing of bodies is implemented.
1942 -- (This is needed in any case for early instantiations ???).
1944 if No (Next_Node) then
1945 if Nkind_In (Parent (L), N_Component_List,
1947 N_Protected_Definition)
1951 elsif Nkind (Parent (L)) /= N_Package_Specification then
1952 if Nkind (Parent (L)) = N_Package_Body then
1953 Freeze_From := First_Entity (Current_Scope);
1957 Freeze_All (Freeze_From, D);
1958 Freeze_From := Last_Entity (Current_Scope);
1960 elsif Scope (Current_Scope) /= Standard_Standard
1961 and then not Is_Child_Unit (Current_Scope)
1962 and then No (Generic_Parent (Parent (L)))
1966 elsif L /= Visible_Declarations (Parent (L))
1967 or else No (Private_Declarations (Parent (L)))
1968 or else Is_Empty_List (Private_Declarations (Parent (L)))
1971 Freeze_All (Freeze_From, D);
1972 Freeze_From := Last_Entity (Current_Scope);
1975 -- If next node is a body then freeze all types before the body.
1976 -- An exception occurs for some expander-generated bodies. If these
1977 -- are generated at places where in general language rules would not
1978 -- allow a freeze point, then we assume that the expander has
1979 -- explicitly checked that all required types are properly frozen,
1980 -- and we do not cause general freezing here. This special circuit
1981 -- is used when the encountered body is marked as having already
1984 -- In all other cases (bodies that come from source, and expander
1985 -- generated bodies that have not been analyzed yet), freeze all
1986 -- types now. Note that in the latter case, the expander must take
1987 -- care to attach the bodies at a proper place in the tree so as to
1988 -- not cause unwanted freezing at that point.
1990 elsif not Analyzed (Next_Node)
1991 and then (Nkind_In (Next_Node, N_Subprogram_Body,
1997 Nkind (Next_Node) in N_Body_Stub)
2000 Freeze_All (Freeze_From, D);
2001 Freeze_From := Last_Entity (Current_Scope);
2006 end Analyze_Declarations;
2008 ----------------------------------
2009 -- Analyze_Incomplete_Type_Decl --
2010 ----------------------------------
2012 procedure Analyze_Incomplete_Type_Decl (N : Node_Id) is
2013 F : constant Boolean := Is_Pure (Current_Scope);
2017 Generate_Definition (Defining_Identifier (N));
2019 -- Process an incomplete declaration. The identifier must not have been
2020 -- declared already in the scope. However, an incomplete declaration may
2021 -- appear in the private part of a package, for a private type that has
2022 -- already been declared.
2024 -- In this case, the discriminants (if any) must match
2026 T := Find_Type_Name (N);
2028 Set_Ekind (T, E_Incomplete_Type);
2029 Init_Size_Align (T);
2030 Set_Is_First_Subtype (T, True);
2033 -- Ada 2005 (AI-326): Minimum decoration to give support to tagged
2034 -- incomplete types.
2036 if Tagged_Present (N) then
2037 Set_Is_Tagged_Type (T);
2038 Make_Class_Wide_Type (T);
2039 Set_Primitive_Operations (T, New_Elmt_List);
2044 Set_Stored_Constraint (T, No_Elist);
2046 if Present (Discriminant_Specifications (N)) then
2047 Process_Discriminants (N);
2052 -- If the type has discriminants, non-trivial subtypes may be
2053 -- declared before the full view of the type. The full views of those
2054 -- subtypes will be built after the full view of the type.
2056 Set_Private_Dependents (T, New_Elmt_List);
2058 end Analyze_Incomplete_Type_Decl;
2060 -----------------------------------
2061 -- Analyze_Interface_Declaration --
2062 -----------------------------------
2064 procedure Analyze_Interface_Declaration (T : Entity_Id; Def : Node_Id) is
2065 CW : constant Entity_Id := Class_Wide_Type (T);
2068 Set_Is_Tagged_Type (T);
2070 Set_Is_Limited_Record (T, Limited_Present (Def)
2071 or else Task_Present (Def)
2072 or else Protected_Present (Def)
2073 or else Synchronized_Present (Def));
2075 -- Type is abstract if full declaration carries keyword, or if previous
2076 -- partial view did.
2078 Set_Is_Abstract_Type (T);
2079 Set_Is_Interface (T);
2081 -- Type is a limited interface if it includes the keyword limited, task,
2082 -- protected, or synchronized.
2084 Set_Is_Limited_Interface
2085 (T, Limited_Present (Def)
2086 or else Protected_Present (Def)
2087 or else Synchronized_Present (Def)
2088 or else Task_Present (Def));
2090 Set_Is_Protected_Interface (T, Protected_Present (Def));
2091 Set_Is_Task_Interface (T, Task_Present (Def));
2093 -- Type is a synchronized interface if it includes the keyword task,
2094 -- protected, or synchronized.
2096 Set_Is_Synchronized_Interface
2097 (T, Synchronized_Present (Def)
2098 or else Protected_Present (Def)
2099 or else Task_Present (Def));
2101 Set_Interfaces (T, New_Elmt_List);
2102 Set_Primitive_Operations (T, New_Elmt_List);
2104 -- Complete the decoration of the class-wide entity if it was already
2105 -- built (i.e. during the creation of the limited view)
2107 if Present (CW) then
2108 Set_Is_Interface (CW);
2109 Set_Is_Limited_Interface (CW, Is_Limited_Interface (T));
2110 Set_Is_Protected_Interface (CW, Is_Protected_Interface (T));
2111 Set_Is_Synchronized_Interface (CW, Is_Synchronized_Interface (T));
2112 Set_Is_Task_Interface (CW, Is_Task_Interface (T));
2115 -- Check runtime support for synchronized interfaces
2117 if VM_Target = No_VM
2118 and then (Is_Task_Interface (T)
2119 or else Is_Protected_Interface (T)
2120 or else Is_Synchronized_Interface (T))
2121 and then not RTE_Available (RE_Select_Specific_Data)
2123 Error_Msg_CRT ("synchronized interfaces", T);
2125 end Analyze_Interface_Declaration;
2127 -----------------------------
2128 -- Analyze_Itype_Reference --
2129 -----------------------------
2131 -- Nothing to do. This node is placed in the tree only for the benefit of
2132 -- back end processing, and has no effect on the semantic processing.
2134 procedure Analyze_Itype_Reference (N : Node_Id) is
2136 pragma Assert (Is_Itype (Itype (N)));
2138 end Analyze_Itype_Reference;
2140 --------------------------------
2141 -- Analyze_Number_Declaration --
2142 --------------------------------
2144 procedure Analyze_Number_Declaration (N : Node_Id) is
2145 Id : constant Entity_Id := Defining_Identifier (N);
2146 E : constant Node_Id := Expression (N);
2148 Index : Interp_Index;
2152 Generate_Definition (Id);
2155 -- This is an optimization of a common case of an integer literal
2157 if Nkind (E) = N_Integer_Literal then
2158 Set_Is_Static_Expression (E, True);
2159 Set_Etype (E, Universal_Integer);
2161 Set_Etype (Id, Universal_Integer);
2162 Set_Ekind (Id, E_Named_Integer);
2163 Set_Is_Frozen (Id, True);
2167 Set_Is_Pure (Id, Is_Pure (Current_Scope));
2169 -- Process expression, replacing error by integer zero, to avoid
2170 -- cascaded errors or aborts further along in the processing
2172 -- Replace Error by integer zero, which seems least likely to
2173 -- cause cascaded errors.
2176 Rewrite (E, Make_Integer_Literal (Sloc (E), Uint_0));
2177 Set_Error_Posted (E);
2182 -- Verify that the expression is static and numeric. If
2183 -- the expression is overloaded, we apply the preference
2184 -- rule that favors root numeric types.
2186 if not Is_Overloaded (E) then
2192 Get_First_Interp (E, Index, It);
2193 while Present (It.Typ) loop
2194 if (Is_Integer_Type (It.Typ)
2195 or else Is_Real_Type (It.Typ))
2196 and then (Scope (Base_Type (It.Typ))) = Standard_Standard
2198 if T = Any_Type then
2201 elsif It.Typ = Universal_Real
2202 or else It.Typ = Universal_Integer
2204 -- Choose universal interpretation over any other
2211 Get_Next_Interp (Index, It);
2215 if Is_Integer_Type (T) then
2217 Set_Etype (Id, Universal_Integer);
2218 Set_Ekind (Id, E_Named_Integer);
2220 elsif Is_Real_Type (T) then
2222 -- Because the real value is converted to universal_real, this is a
2223 -- legal context for a universal fixed expression.
2225 if T = Universal_Fixed then
2227 Loc : constant Source_Ptr := Sloc (N);
2228 Conv : constant Node_Id := Make_Type_Conversion (Loc,
2230 New_Occurrence_Of (Universal_Real, Loc),
2231 Expression => Relocate_Node (E));
2238 elsif T = Any_Fixed then
2239 Error_Msg_N ("illegal context for mixed mode operation", E);
2241 -- Expression is of the form : universal_fixed * integer. Try to
2242 -- resolve as universal_real.
2244 T := Universal_Real;
2249 Set_Etype (Id, Universal_Real);
2250 Set_Ekind (Id, E_Named_Real);
2253 Wrong_Type (E, Any_Numeric);
2257 Set_Ekind (Id, E_Constant);
2258 Set_Never_Set_In_Source (Id, True);
2259 Set_Is_True_Constant (Id, True);
2263 if Nkind_In (E, N_Integer_Literal, N_Real_Literal) then
2264 Set_Etype (E, Etype (Id));
2267 if not Is_OK_Static_Expression (E) then
2268 Flag_Non_Static_Expr
2269 ("non-static expression used in number declaration!", E);
2270 Rewrite (E, Make_Integer_Literal (Sloc (N), 1));
2271 Set_Etype (E, Any_Type);
2273 end Analyze_Number_Declaration;
2275 --------------------------------
2276 -- Analyze_Object_Declaration --
2277 --------------------------------
2279 procedure Analyze_Object_Declaration (N : Node_Id) is
2280 Loc : constant Source_Ptr := Sloc (N);
2281 Id : constant Entity_Id := Defining_Identifier (N);
2285 E : Node_Id := Expression (N);
2286 -- E is set to Expression (N) throughout this routine. When
2287 -- Expression (N) is modified, E is changed accordingly.
2289 Prev_Entity : Entity_Id := Empty;
2291 function Count_Tasks (T : Entity_Id) return Uint;
2292 -- This function is called when a non-generic library level object of a
2293 -- task type is declared. Its function is to count the static number of
2294 -- tasks declared within the type (it is only called if Has_Tasks is set
2295 -- for T). As a side effect, if an array of tasks with non-static bounds
2296 -- or a variant record type is encountered, Check_Restrictions is called
2297 -- indicating the count is unknown.
2303 function Count_Tasks (T : Entity_Id) return Uint is
2309 if Is_Task_Type (T) then
2312 elsif Is_Record_Type (T) then
2313 if Has_Discriminants (T) then
2314 Check_Restriction (Max_Tasks, N);
2319 C := First_Component (T);
2320 while Present (C) loop
2321 V := V + Count_Tasks (Etype (C));
2328 elsif Is_Array_Type (T) then
2329 X := First_Index (T);
2330 V := Count_Tasks (Component_Type (T));
2331 while Present (X) loop
2334 if not Is_Static_Subtype (C) then
2335 Check_Restriction (Max_Tasks, N);
2338 V := V * (UI_Max (Uint_0,
2339 Expr_Value (Type_High_Bound (C)) -
2340 Expr_Value (Type_Low_Bound (C)) + Uint_1));
2353 -- Start of processing for Analyze_Object_Declaration
2356 -- There are three kinds of implicit types generated by an
2357 -- object declaration:
2359 -- 1. Those for generated by the original Object Definition
2361 -- 2. Those generated by the Expression
2363 -- 3. Those used to constrained the Object Definition with the
2364 -- expression constraints when it is unconstrained
2366 -- They must be generated in this order to avoid order of elaboration
2367 -- issues. Thus the first step (after entering the name) is to analyze
2368 -- the object definition.
2370 if Constant_Present (N) then
2371 Prev_Entity := Current_Entity_In_Scope (Id);
2373 -- If the homograph is an implicit subprogram, it is overridden by
2374 -- the current declaration.
2376 if Present (Prev_Entity)
2378 ((Is_Overloadable (Prev_Entity)
2379 and then Is_Inherited_Operation (Prev_Entity))
2381 -- The current object is a discriminal generated for an entry
2382 -- family index. Even though the index is a constant, in this
2383 -- particular context there is no true constant redeclaration.
2384 -- Enter_Name will handle the visibility.
2387 (Is_Discriminal (Id)
2388 and then Ekind (Discriminal_Link (Id)) =
2389 E_Entry_Index_Parameter))
2391 Prev_Entity := Empty;
2395 if Present (Prev_Entity) then
2396 Constant_Redeclaration (Id, N, T);
2398 Generate_Reference (Prev_Entity, Id, 'c');
2399 Set_Completion_Referenced (Id);
2401 if Error_Posted (N) then
2403 -- Type mismatch or illegal redeclaration, Do not analyze
2404 -- expression to avoid cascaded errors.
2406 T := Find_Type_Of_Object (Object_Definition (N), N);
2408 Set_Ekind (Id, E_Variable);
2412 -- In the normal case, enter identifier at the start to catch premature
2413 -- usage in the initialization expression.
2416 Generate_Definition (Id);
2419 Mark_Coextensions (N, Object_Definition (N));
2421 T := Find_Type_Of_Object (Object_Definition (N), N);
2423 if Nkind (Object_Definition (N)) = N_Access_Definition
2425 (Access_To_Subprogram_Definition (Object_Definition (N)))
2426 and then Protected_Present
2427 (Access_To_Subprogram_Definition (Object_Definition (N)))
2429 T := Replace_Anonymous_Access_To_Protected_Subprogram (N);
2432 if Error_Posted (Id) then
2434 Set_Ekind (Id, E_Variable);
2439 -- Ada 2005 (AI-231): Propagate the null-excluding attribute and carry
2440 -- out some static checks
2442 if Ada_Version >= Ada_05
2443 and then Can_Never_Be_Null (T)
2445 -- In case of aggregates we must also take care of the correct
2446 -- initialization of nested aggregates bug this is done at the
2447 -- point of the analysis of the aggregate (see sem_aggr.adb)
2449 if Present (Expression (N))
2450 and then Nkind (Expression (N)) = N_Aggregate
2456 Save_Typ : constant Entity_Id := Etype (Id);
2458 Set_Etype (Id, T); -- Temp. decoration for static checks
2459 Null_Exclusion_Static_Checks (N);
2460 Set_Etype (Id, Save_Typ);
2465 Set_Is_Pure (Id, Is_Pure (Current_Scope));
2467 -- If deferred constant, make sure context is appropriate. We detect
2468 -- a deferred constant as a constant declaration with no expression.
2469 -- A deferred constant can appear in a package body if its completion
2470 -- is by means of an interface pragma.
2472 if Constant_Present (N)
2475 -- A deferred constant may appear in the declarative part of the
2476 -- following constructs:
2480 -- extended return statements
2483 -- subprogram bodies
2486 -- When declared inside a package spec, a deferred constant must be
2487 -- completed by a full constant declaration or pragma Import. In all
2488 -- other cases, the only proper completion is pragma Import. Extended
2489 -- return statements are flagged as invalid contexts because they do
2490 -- not have a declarative part and so cannot accommodate the pragma.
2492 if Ekind (Current_Scope) = E_Return_Statement then
2494 ("invalid context for deferred constant declaration (RM 7.4)",
2497 ("\declaration requires an initialization expression",
2499 Set_Constant_Present (N, False);
2501 -- In Ada 83, deferred constant must be of private type
2503 elsif not Is_Private_Type (T) then
2504 if Ada_Version = Ada_83 and then Comes_From_Source (N) then
2506 ("(Ada 83) deferred constant must be private type", N);
2510 -- If not a deferred constant, then object declaration freezes its type
2513 Check_Fully_Declared (T, N);
2514 Freeze_Before (N, T);
2517 -- If the object was created by a constrained array definition, then
2518 -- set the link in both the anonymous base type and anonymous subtype
2519 -- that are built to represent the array type to point to the object.
2521 if Nkind (Object_Definition (Declaration_Node (Id))) =
2522 N_Constrained_Array_Definition
2524 Set_Related_Array_Object (T, Id);
2525 Set_Related_Array_Object (Base_Type (T), Id);
2528 -- Special checks for protected objects not at library level
2530 if Is_Protected_Type (T)
2531 and then not Is_Library_Level_Entity (Id)
2533 Check_Restriction (No_Local_Protected_Objects, Id);
2535 -- Protected objects with interrupt handlers must be at library level
2537 -- Ada 2005: this test is not needed (and the corresponding clause
2538 -- in the RM is removed) because accessibility checks are sufficient
2539 -- to make handlers not at the library level illegal.
2541 if Has_Interrupt_Handler (T)
2542 and then Ada_Version < Ada_05
2545 ("interrupt object can only be declared at library level", Id);
2549 -- The actual subtype of the object is the nominal subtype, unless
2550 -- the nominal one is unconstrained and obtained from the expression.
2554 -- Process initialization expression if present and not in error
2556 if Present (E) and then E /= Error then
2558 -- Generate an error in case of CPP class-wide object initialization.
2559 -- Required because otherwise the expansion of the class-wide
2560 -- assignment would try to use 'size to initialize the object
2561 -- (primitive that is not available in CPP tagged types).
2563 if Is_Class_Wide_Type (Act_T)
2565 (Is_CPP_Class (Root_Type (Etype (Act_T)))
2567 (Present (Full_View (Root_Type (Etype (Act_T))))
2569 Is_CPP_Class (Full_View (Root_Type (Etype (Act_T))))))
2572 ("predefined assignment not available for 'C'P'P tagged types",
2576 Mark_Coextensions (N, E);
2579 -- In case of errors detected in the analysis of the expression,
2580 -- decorate it with the expected type to avoid cascaded errors
2582 if No (Etype (E)) then
2586 -- If an initialization expression is present, then we set the
2587 -- Is_True_Constant flag. It will be reset if this is a variable
2588 -- and it is indeed modified.
2590 Set_Is_True_Constant (Id, True);
2592 -- If we are analyzing a constant declaration, set its completion
2593 -- flag after analyzing and resolving the expression.
2595 if Constant_Present (N) then
2596 Set_Has_Completion (Id);
2599 -- Set type and resolve (type may be overridden later on)
2604 -- If E is null and has been replaced by an N_Raise_Constraint_Error
2605 -- node (which was marked already-analyzed), we need to set the type
2606 -- to something other than Any_Access in order to keep gigi happy.
2608 if Etype (E) = Any_Access then
2612 -- If the object is an access to variable, the initialization
2613 -- expression cannot be an access to constant.
2615 if Is_Access_Type (T)
2616 and then not Is_Access_Constant (T)
2617 and then Is_Access_Type (Etype (E))
2618 and then Is_Access_Constant (Etype (E))
2621 ("access to variable cannot be initialized " &
2622 "with an access-to-constant expression", E);
2625 if not Assignment_OK (N) then
2626 Check_Initialization (T, E);
2629 Check_Unset_Reference (E);
2631 -- If this is a variable, then set current value
2633 if not Constant_Present (N) then
2634 if Compile_Time_Known_Value (E) then
2635 Set_Current_Value (Id, E);
2639 -- Deal with setting of null flags
2641 if Is_Access_Type (T) then
2642 if Known_Non_Null (E) then
2643 Set_Is_Known_Non_Null (Id, True);
2644 elsif Known_Null (E)
2645 and then not Can_Never_Be_Null (Id)
2647 Set_Is_Known_Null (Id, True);
2651 -- Check incorrect use of dynamically tagged expressions. Note
2652 -- the use of Is_Tagged_Type (T) which seems redundant but is in
2653 -- fact important to avoid spurious errors due to expanded code
2654 -- for dispatching functions over an anonymous access type
2656 if (Is_Class_Wide_Type (Etype (E)) or else Is_Dynamically_Tagged (E))
2657 and then Is_Tagged_Type (T)
2658 and then not Is_Class_Wide_Type (T)
2660 Error_Msg_N ("dynamically tagged expression not allowed!", E);
2663 Apply_Scalar_Range_Check (E, T);
2664 Apply_Static_Length_Check (E, T);
2667 -- If the No_Streams restriction is set, check that the type of the
2668 -- object is not, and does not contain, any subtype derived from
2669 -- Ada.Streams.Root_Stream_Type. Note that we guard the call to
2670 -- Has_Stream just for efficiency reasons. There is no point in
2671 -- spending time on a Has_Stream check if the restriction is not set.
2673 if Restrictions.Set (No_Streams) then
2674 if Has_Stream (T) then
2675 Check_Restriction (No_Streams, N);
2679 -- Abstract type is never permitted for a variable or constant.
2680 -- Note: we inhibit this check for objects that do not come from
2681 -- source because there is at least one case (the expansion of
2682 -- x'class'input where x is abstract) where we legitimately
2683 -- generate an abstract object.
2685 if Is_Abstract_Type (T) and then Comes_From_Source (N) then
2686 Error_Msg_N ("type of object cannot be abstract",
2687 Object_Definition (N));
2689 if Is_CPP_Class (T) then
2690 Error_Msg_NE ("\} may need a cpp_constructor",
2691 Object_Definition (N), T);
2694 -- Case of unconstrained type
2696 elsif Is_Indefinite_Subtype (T) then
2698 -- Nothing to do in deferred constant case
2700 if Constant_Present (N) and then No (E) then
2703 -- Case of no initialization present
2706 if No_Initialization (N) then
2709 elsif Is_Class_Wide_Type (T) then
2711 ("initialization required in class-wide declaration ", N);
2715 ("unconstrained subtype not allowed (need initialization)",
2716 Object_Definition (N));
2718 if Is_Record_Type (T) and then Has_Discriminants (T) then
2720 ("\provide initial value or explicit discriminant values",
2721 Object_Definition (N));
2724 ("\or give default discriminant values for type&",
2725 Object_Definition (N), T);
2727 elsif Is_Array_Type (T) then
2729 ("\provide initial value or explicit array bounds",
2730 Object_Definition (N));
2734 -- Case of initialization present but in error. Set initial
2735 -- expression as absent (but do not make above complaints)
2737 elsif E = Error then
2738 Set_Expression (N, Empty);
2741 -- Case of initialization present
2744 -- Not allowed in Ada 83
2746 if not Constant_Present (N) then
2747 if Ada_Version = Ada_83
2748 and then Comes_From_Source (Object_Definition (N))
2751 ("(Ada 83) unconstrained variable not allowed",
2752 Object_Definition (N));
2756 -- Now we constrain the variable from the initializing expression
2758 -- If the expression is an aggregate, it has been expanded into
2759 -- individual assignments. Retrieve the actual type from the
2760 -- expanded construct.
2762 if Is_Array_Type (T)
2763 and then No_Initialization (N)
2764 and then Nkind (Original_Node (E)) = N_Aggregate
2769 Expand_Subtype_From_Expr (N, T, Object_Definition (N), E);
2770 Act_T := Find_Type_Of_Object (Object_Definition (N), N);
2773 Set_Is_Constr_Subt_For_U_Nominal (Act_T);
2775 if Aliased_Present (N) then
2776 Set_Is_Constr_Subt_For_UN_Aliased (Act_T);
2779 Freeze_Before (N, Act_T);
2780 Freeze_Before (N, T);
2783 elsif Is_Array_Type (T)
2784 and then No_Initialization (N)
2785 and then Nkind (Original_Node (E)) = N_Aggregate
2787 if not Is_Entity_Name (Object_Definition (N)) then
2789 Check_Compile_Time_Size (Act_T);
2791 if Aliased_Present (N) then
2792 Set_Is_Constr_Subt_For_UN_Aliased (Act_T);
2796 -- When the given object definition and the aggregate are specified
2797 -- independently, and their lengths might differ do a length check.
2798 -- This cannot happen if the aggregate is of the form (others =>...)
2800 if not Is_Constrained (T) then
2803 elsif Nkind (E) = N_Raise_Constraint_Error then
2805 -- Aggregate is statically illegal. Place back in declaration
2807 Set_Expression (N, E);
2808 Set_No_Initialization (N, False);
2810 elsif T = Etype (E) then
2813 elsif Nkind (E) = N_Aggregate
2814 and then Present (Component_Associations (E))
2815 and then Present (Choices (First (Component_Associations (E))))
2816 and then Nkind (First
2817 (Choices (First (Component_Associations (E))))) = N_Others_Choice
2822 Apply_Length_Check (E, T);
2825 -- If the type is limited unconstrained with defaulted discriminants
2826 -- and there is no expression, then the object is constrained by the
2827 -- defaults, so it is worthwhile building the corresponding subtype.
2829 elsif (Is_Limited_Record (T)
2830 or else Is_Concurrent_Type (T))
2831 and then not Is_Constrained (T)
2832 and then Has_Discriminants (T)
2835 Act_T := Build_Default_Subtype (T, N);
2837 -- Ada 2005: a limited object may be initialized by means of an
2838 -- aggregate. If the type has default discriminants it has an
2839 -- unconstrained nominal type, Its actual subtype will be obtained
2840 -- from the aggregate, and not from the default discriminants.
2845 Rewrite (Object_Definition (N), New_Occurrence_Of (Act_T, Loc));
2847 elsif Present (Underlying_Type (T))
2848 and then not Is_Constrained (Underlying_Type (T))
2849 and then Has_Discriminants (Underlying_Type (T))
2850 and then Nkind (E) = N_Function_Call
2851 and then Constant_Present (N)
2853 -- The back-end has problems with constants of a discriminated type
2854 -- with defaults, if the initial value is a function call. We
2855 -- generate an intermediate temporary for the result of the call.
2856 -- It is unclear why this should make it acceptable to gcc. ???
2858 Remove_Side_Effects (E);
2861 -- Check No_Wide_Characters restriction
2863 if T = Standard_Wide_Character
2864 or else T = Standard_Wide_Wide_Character
2865 or else Root_Type (T) = Standard_Wide_String
2866 or else Root_Type (T) = Standard_Wide_Wide_String
2868 Check_Restriction (No_Wide_Characters, Object_Definition (N));
2871 -- Indicate this is not set in source. Certainly true for constants,
2872 -- and true for variables so far (will be reset for a variable if and
2873 -- when we encounter a modification in the source).
2875 Set_Never_Set_In_Source (Id, True);
2877 -- Now establish the proper kind and type of the object
2879 if Constant_Present (N) then
2880 Set_Ekind (Id, E_Constant);
2881 Set_Is_True_Constant (Id, True);
2884 Set_Ekind (Id, E_Variable);
2886 -- A variable is set as shared passive if it appears in a shared
2887 -- passive package, and is at the outer level. This is not done
2888 -- for entities generated during expansion, because those are
2889 -- always manipulated locally.
2891 if Is_Shared_Passive (Current_Scope)
2892 and then Is_Library_Level_Entity (Id)
2893 and then Comes_From_Source (Id)
2895 Set_Is_Shared_Passive (Id);
2896 Check_Shared_Var (Id, T, N);
2899 -- Set Has_Initial_Value if initializing expression present. Note
2900 -- that if there is no initializing expression, we leave the state
2901 -- of this flag unchanged (usually it will be False, but notably in
2902 -- the case of exception choice variables, it will already be true).
2905 Set_Has_Initial_Value (Id, True);
2909 -- Initialize alignment and size and capture alignment setting
2911 Init_Alignment (Id);
2913 Set_Optimize_Alignment_Flags (Id);
2915 -- Deal with aliased case
2917 if Aliased_Present (N) then
2918 Set_Is_Aliased (Id);
2920 -- If the object is aliased and the type is unconstrained with
2921 -- defaulted discriminants and there is no expression, then the
2922 -- object is constrained by the defaults, so it is worthwhile
2923 -- building the corresponding subtype.
2925 -- Ada 2005 (AI-363): If the aliased object is discriminated and
2926 -- unconstrained, then only establish an actual subtype if the
2927 -- nominal subtype is indefinite. In definite cases the object is
2928 -- unconstrained in Ada 2005.
2931 and then Is_Record_Type (T)
2932 and then not Is_Constrained (T)
2933 and then Has_Discriminants (T)
2934 and then (Ada_Version < Ada_05 or else Is_Indefinite_Subtype (T))
2936 Set_Actual_Subtype (Id, Build_Default_Subtype (T, N));
2940 -- Now we can set the type of the object
2942 Set_Etype (Id, Act_T);
2944 -- Deal with controlled types
2946 if Has_Controlled_Component (Etype (Id))
2947 or else Is_Controlled (Etype (Id))
2949 if not Is_Library_Level_Entity (Id) then
2950 Check_Restriction (No_Nested_Finalization, N);
2952 Validate_Controlled_Object (Id);
2955 -- Generate a warning when an initialization causes an obvious ABE
2956 -- violation. If the init expression is a simple aggregate there
2957 -- shouldn't be any initialize/adjust call generated. This will be
2958 -- true as soon as aggregates are built in place when possible.
2960 -- ??? at the moment we do not generate warnings for temporaries
2961 -- created for those aggregates although Program_Error might be
2962 -- generated if compiled with -gnato.
2964 if Is_Controlled (Etype (Id))
2965 and then Comes_From_Source (Id)
2968 BT : constant Entity_Id := Base_Type (Etype (Id));
2970 Implicit_Call : Entity_Id;
2971 pragma Warnings (Off, Implicit_Call);
2972 -- ??? what is this for (never referenced!)
2974 function Is_Aggr (N : Node_Id) return Boolean;
2975 -- Check that N is an aggregate
2981 function Is_Aggr (N : Node_Id) return Boolean is
2983 case Nkind (Original_Node (N)) is
2984 when N_Aggregate | N_Extension_Aggregate =>
2987 when N_Qualified_Expression |
2989 N_Unchecked_Type_Conversion =>
2990 return Is_Aggr (Expression (Original_Node (N)));
2998 -- If no underlying type, we already are in an error situation.
2999 -- Do not try to add a warning since we do not have access to
3002 if No (Underlying_Type (BT)) then
3003 Implicit_Call := Empty;
3005 -- A generic type does not have usable primitive operators.
3006 -- Initialization calls are built for instances.
3008 elsif Is_Generic_Type (BT) then
3009 Implicit_Call := Empty;
3011 -- If the init expression is not an aggregate, an adjust call
3012 -- will be generated
3014 elsif Present (E) and then not Is_Aggr (E) then
3015 Implicit_Call := Find_Prim_Op (BT, Name_Adjust);
3017 -- If no init expression and we are not in the deferred
3018 -- constant case, an Initialize call will be generated
3020 elsif No (E) and then not Constant_Present (N) then
3021 Implicit_Call := Find_Prim_Op (BT, Name_Initialize);
3024 Implicit_Call := Empty;
3030 if Has_Task (Etype (Id)) then
3031 Check_Restriction (No_Tasking, N);
3033 -- Deal with counting max tasks
3035 -- Nothing to do if inside a generic
3037 if Inside_A_Generic then
3040 -- If library level entity, then count tasks
3042 elsif Is_Library_Level_Entity (Id) then
3043 Check_Restriction (Max_Tasks, N, Count_Tasks (Etype (Id)));
3045 -- If not library level entity, then indicate we don't know max
3046 -- tasks and also check task hierarchy restriction and blocking
3047 -- operation (since starting a task is definitely blocking!)
3050 Check_Restriction (Max_Tasks, N);
3051 Check_Restriction (No_Task_Hierarchy, N);
3052 Check_Potentially_Blocking_Operation (N);
3055 -- A rather specialized test. If we see two tasks being declared
3056 -- of the same type in the same object declaration, and the task
3057 -- has an entry with an address clause, we know that program error
3058 -- will be raised at run-time since we can't have two tasks with
3059 -- entries at the same address.
3061 if Is_Task_Type (Etype (Id)) and then More_Ids (N) then
3066 E := First_Entity (Etype (Id));
3067 while Present (E) loop
3068 if Ekind (E) = E_Entry
3069 and then Present (Get_Attribute_Definition_Clause
3070 (E, Attribute_Address))
3073 ("?more than one task with same entry address", N);
3075 ("\?Program_Error will be raised at run time", N);
3077 Make_Raise_Program_Error (Loc,
3078 Reason => PE_Duplicated_Entry_Address));
3088 -- Some simple constant-propagation: if the expression is a constant
3089 -- string initialized with a literal, share the literal. This avoids
3093 and then Is_Entity_Name (E)
3094 and then Ekind (Entity (E)) = E_Constant
3095 and then Base_Type (Etype (E)) = Standard_String
3098 Val : constant Node_Id := Constant_Value (Entity (E));
3101 and then Nkind (Val) = N_String_Literal
3103 Rewrite (E, New_Copy (Val));
3108 -- Another optimization: if the nominal subtype is unconstrained and
3109 -- the expression is a function call that returns an unconstrained
3110 -- type, rewrite the declaration as a renaming of the result of the
3111 -- call. The exceptions below are cases where the copy is expected,
3112 -- either by the back end (Aliased case) or by the semantics, as for
3113 -- initializing controlled types or copying tags for classwide types.
3116 and then Nkind (E) = N_Explicit_Dereference
3117 and then Nkind (Original_Node (E)) = N_Function_Call
3118 and then not Is_Library_Level_Entity (Id)
3119 and then not Is_Constrained (Underlying_Type (T))
3120 and then not Is_Aliased (Id)
3121 and then not Is_Class_Wide_Type (T)
3122 and then not Is_Controlled (T)
3123 and then not Has_Controlled_Component (Base_Type (T))
3124 and then Expander_Active
3127 Make_Object_Renaming_Declaration (Loc,
3128 Defining_Identifier => Id,
3129 Access_Definition => Empty,
3130 Subtype_Mark => New_Occurrence_Of
3131 (Base_Type (Etype (Id)), Loc),
3134 Set_Renamed_Object (Id, E);
3136 -- Force generation of debugging information for the constant and for
3137 -- the renamed function call.
3139 Set_Debug_Info_Needed (Id);
3140 Set_Debug_Info_Needed (Entity (Prefix (E)));
3143 if Present (Prev_Entity)
3144 and then Is_Frozen (Prev_Entity)
3145 and then not Error_Posted (Id)
3147 Error_Msg_N ("full constant declaration appears too late", N);
3150 Check_Eliminated (Id);
3152 -- Deal with setting In_Private_Part flag if in private part
3154 if Ekind (Scope (Id)) = E_Package
3155 and then In_Private_Part (Scope (Id))
3157 Set_In_Private_Part (Id);
3160 -- Check for violation of No_Local_Timing_Events
3162 if Is_RTE (Etype (Id), RE_Timing_Event)
3163 and then not Is_Library_Level_Entity (Id)
3165 Check_Restriction (No_Local_Timing_Events, N);
3167 end Analyze_Object_Declaration;
3169 ---------------------------
3170 -- Analyze_Others_Choice --
3171 ---------------------------
3173 -- Nothing to do for the others choice node itself, the semantic analysis
3174 -- of the others choice will occur as part of the processing of the parent
3176 procedure Analyze_Others_Choice (N : Node_Id) is
3177 pragma Warnings (Off, N);
3180 end Analyze_Others_Choice;
3182 -------------------------------------------
3183 -- Analyze_Private_Extension_Declaration --
3184 -------------------------------------------
3186 procedure Analyze_Private_Extension_Declaration (N : Node_Id) is
3187 T : constant Entity_Id := Defining_Identifier (N);
3188 Indic : constant Node_Id := Subtype_Indication (N);
3189 Parent_Type : Entity_Id;
3190 Parent_Base : Entity_Id;
3193 -- Ada 2005 (AI-251): Decorate all names in list of ancestor interfaces
3195 if Is_Non_Empty_List (Interface_List (N)) then
3201 Intf := First (Interface_List (N));
3202 while Present (Intf) loop
3203 T := Find_Type_Of_Subtype_Indic (Intf);
3205 Diagnose_Interface (Intf, T);
3211 Generate_Definition (T);
3214 Parent_Type := Find_Type_Of_Subtype_Indic (Indic);
3215 Parent_Base := Base_Type (Parent_Type);
3217 if Parent_Type = Any_Type
3218 or else Etype (Parent_Type) = Any_Type
3220 Set_Ekind (T, Ekind (Parent_Type));
3221 Set_Etype (T, Any_Type);
3224 elsif not Is_Tagged_Type (Parent_Type) then
3226 ("parent of type extension must be a tagged type ", Indic);
3229 elsif Ekind (Parent_Type) = E_Void
3230 or else Ekind (Parent_Type) = E_Incomplete_Type
3232 Error_Msg_N ("premature derivation of incomplete type", Indic);
3235 elsif Is_Concurrent_Type (Parent_Type) then
3237 ("parent type of a private extension cannot be "
3238 & "a synchronized tagged type (RM 3.9.1 (3/1))", N);
3240 Set_Etype (T, Any_Type);
3241 Set_Ekind (T, E_Limited_Private_Type);
3242 Set_Private_Dependents (T, New_Elmt_List);
3243 Set_Error_Posted (T);
3247 -- Perhaps the parent type should be changed to the class-wide type's
3248 -- specific type in this case to prevent cascading errors ???
3250 if Is_Class_Wide_Type (Parent_Type) then
3252 ("parent of type extension must not be a class-wide type", Indic);
3256 if (not Is_Package_Or_Generic_Package (Current_Scope)
3257 and then Nkind (Parent (N)) /= N_Generic_Subprogram_Declaration)
3258 or else In_Private_Part (Current_Scope)
3261 Error_Msg_N ("invalid context for private extension", N);
3264 -- Set common attributes
3266 Set_Is_Pure (T, Is_Pure (Current_Scope));
3267 Set_Scope (T, Current_Scope);
3268 Set_Ekind (T, E_Record_Type_With_Private);
3269 Init_Size_Align (T);
3271 Set_Etype (T, Parent_Base);
3272 Set_Has_Task (T, Has_Task (Parent_Base));
3274 Set_Convention (T, Convention (Parent_Type));
3275 Set_First_Rep_Item (T, First_Rep_Item (Parent_Type));
3276 Set_Is_First_Subtype (T);
3277 Make_Class_Wide_Type (T);
3279 if Unknown_Discriminants_Present (N) then
3280 Set_Discriminant_Constraint (T, No_Elist);
3283 Build_Derived_Record_Type (N, Parent_Type, T);
3285 -- Ada 2005 (AI-443): Synchronized private extension or a rewritten
3286 -- synchronized formal derived type.
3288 if Ada_Version >= Ada_05
3289 and then Synchronized_Present (N)
3291 Set_Is_Limited_Record (T);
3293 -- Formal derived type case
3295 if Is_Generic_Type (T) then
3297 -- The parent must be a tagged limited type or a synchronized
3300 if (not Is_Tagged_Type (Parent_Type)
3301 or else not Is_Limited_Type (Parent_Type))
3303 (not Is_Interface (Parent_Type)
3304 or else not Is_Synchronized_Interface (Parent_Type))
3306 Error_Msg_NE ("parent type of & must be tagged limited " &
3307 "or synchronized", N, T);
3310 -- The progenitors (if any) must be limited or synchronized
3313 if Present (Interfaces (T)) then
3316 Iface_Elmt : Elmt_Id;
3319 Iface_Elmt := First_Elmt (Interfaces (T));
3320 while Present (Iface_Elmt) loop
3321 Iface := Node (Iface_Elmt);
3323 if not Is_Limited_Interface (Iface)
3324 and then not Is_Synchronized_Interface (Iface)
3326 Error_Msg_NE ("progenitor & must be limited " &
3327 "or synchronized", N, Iface);
3330 Next_Elmt (Iface_Elmt);
3335 -- Regular derived extension, the parent must be a limited or
3336 -- synchronized interface.
3339 if not Is_Interface (Parent_Type)
3340 or else (not Is_Limited_Interface (Parent_Type)
3342 not Is_Synchronized_Interface (Parent_Type))
3345 ("parent type of & must be limited interface", N, T);
3349 -- A consequence of 3.9.4 (6/2) and 7.3 (7.2/2) is that a private
3350 -- extension with a synchronized parent must be explicitly declared
3351 -- synchronized, because the full view will be a synchronized type.
3352 -- This must be checked before the check for limited types below,
3353 -- to ensure that types declared limited are not allowed to extend
3354 -- synchronized interfaces.
3356 elsif Is_Interface (Parent_Type)
3357 and then Is_Synchronized_Interface (Parent_Type)
3358 and then not Synchronized_Present (N)
3361 ("private extension of& must be explicitly synchronized",
3364 elsif Limited_Present (N) then
3365 Set_Is_Limited_Record (T);
3367 if not Is_Limited_Type (Parent_Type)
3369 (not Is_Interface (Parent_Type)
3370 or else not Is_Limited_Interface (Parent_Type))
3372 Error_Msg_NE ("parent type& of limited extension must be limited",
3376 end Analyze_Private_Extension_Declaration;
3378 ---------------------------------
3379 -- Analyze_Subtype_Declaration --
3380 ---------------------------------
3382 procedure Analyze_Subtype_Declaration
3384 Skip : Boolean := False)
3386 Id : constant Entity_Id := Defining_Identifier (N);
3388 R_Checks : Check_Result;
3391 Generate_Definition (Id);
3392 Set_Is_Pure (Id, Is_Pure (Current_Scope));
3393 Init_Size_Align (Id);
3395 -- The following guard condition on Enter_Name is to handle cases where
3396 -- the defining identifier has already been entered into the scope but
3397 -- the declaration as a whole needs to be analyzed.
3399 -- This case in particular happens for derived enumeration types. The
3400 -- derived enumeration type is processed as an inserted enumeration type
3401 -- declaration followed by a rewritten subtype declaration. The defining
3402 -- identifier, however, is entered into the name scope very early in the
3403 -- processing of the original type declaration and therefore needs to be
3404 -- avoided here, when the created subtype declaration is analyzed. (See
3405 -- Build_Derived_Types)
3407 -- This also happens when the full view of a private type is derived
3408 -- type with constraints. In this case the entity has been introduced
3409 -- in the private declaration.
3412 or else (Present (Etype (Id))
3413 and then (Is_Private_Type (Etype (Id))
3414 or else Is_Task_Type (Etype (Id))
3415 or else Is_Rewrite_Substitution (N)))
3423 T := Process_Subtype (Subtype_Indication (N), N, Id, 'P');
3425 -- Inherit common attributes
3427 Set_Is_Generic_Type (Id, Is_Generic_Type (Base_Type (T)));
3428 Set_Is_Volatile (Id, Is_Volatile (T));
3429 Set_Treat_As_Volatile (Id, Treat_As_Volatile (T));
3430 Set_Is_Atomic (Id, Is_Atomic (T));
3431 Set_Is_Ada_2005_Only (Id, Is_Ada_2005_Only (T));
3432 Set_Convention (Id, Convention (T));
3434 -- In the case where there is no constraint given in the subtype
3435 -- indication, Process_Subtype just returns the Subtype_Mark, so its
3436 -- semantic attributes must be established here.
3438 if Nkind (Subtype_Indication (N)) /= N_Subtype_Indication then
3439 Set_Etype (Id, Base_Type (T));
3443 Set_Ekind (Id, E_Array_Subtype);
3444 Copy_Array_Subtype_Attributes (Id, T);
3446 when Decimal_Fixed_Point_Kind =>
3447 Set_Ekind (Id, E_Decimal_Fixed_Point_Subtype);
3448 Set_Digits_Value (Id, Digits_Value (T));
3449 Set_Delta_Value (Id, Delta_Value (T));
3450 Set_Scale_Value (Id, Scale_Value (T));
3451 Set_Small_Value (Id, Small_Value (T));
3452 Set_Scalar_Range (Id, Scalar_Range (T));
3453 Set_Machine_Radix_10 (Id, Machine_Radix_10 (T));
3454 Set_Is_Constrained (Id, Is_Constrained (T));
3455 Set_Is_Known_Valid (Id, Is_Known_Valid (T));
3456 Set_RM_Size (Id, RM_Size (T));
3458 when Enumeration_Kind =>
3459 Set_Ekind (Id, E_Enumeration_Subtype);
3460 Set_First_Literal (Id, First_Literal (Base_Type (T)));
3461 Set_Scalar_Range (Id, Scalar_Range (T));
3462 Set_Is_Character_Type (Id, Is_Character_Type (T));
3463 Set_Is_Constrained (Id, Is_Constrained (T));
3464 Set_Is_Known_Valid (Id, Is_Known_Valid (T));
3465 Set_RM_Size (Id, RM_Size (T));
3467 when Ordinary_Fixed_Point_Kind =>
3468 Set_Ekind (Id, E_Ordinary_Fixed_Point_Subtype);
3469 Set_Scalar_Range (Id, Scalar_Range (T));
3470 Set_Small_Value (Id, Small_Value (T));
3471 Set_Delta_Value (Id, Delta_Value (T));
3472 Set_Is_Constrained (Id, Is_Constrained (T));
3473 Set_Is_Known_Valid (Id, Is_Known_Valid (T));
3474 Set_RM_Size (Id, RM_Size (T));
3477 Set_Ekind (Id, E_Floating_Point_Subtype);
3478 Set_Scalar_Range (Id, Scalar_Range (T));
3479 Set_Digits_Value (Id, Digits_Value (T));
3480 Set_Is_Constrained (Id, Is_Constrained (T));
3482 when Signed_Integer_Kind =>
3483 Set_Ekind (Id, E_Signed_Integer_Subtype);
3484 Set_Scalar_Range (Id, Scalar_Range (T));
3485 Set_Is_Constrained (Id, Is_Constrained (T));
3486 Set_Is_Known_Valid (Id, Is_Known_Valid (T));
3487 Set_RM_Size (Id, RM_Size (T));
3489 when Modular_Integer_Kind =>
3490 Set_Ekind (Id, E_Modular_Integer_Subtype);
3491 Set_Scalar_Range (Id, Scalar_Range (T));
3492 Set_Is_Constrained (Id, Is_Constrained (T));
3493 Set_Is_Known_Valid (Id, Is_Known_Valid (T));
3494 Set_RM_Size (Id, RM_Size (T));
3496 when Class_Wide_Kind =>
3497 Set_Ekind (Id, E_Class_Wide_Subtype);
3498 Set_First_Entity (Id, First_Entity (T));
3499 Set_Last_Entity (Id, Last_Entity (T));
3500 Set_Class_Wide_Type (Id, Class_Wide_Type (T));
3501 Set_Cloned_Subtype (Id, T);
3502 Set_Is_Tagged_Type (Id, True);
3503 Set_Has_Unknown_Discriminants
3506 if Ekind (T) = E_Class_Wide_Subtype then
3507 Set_Equivalent_Type (Id, Equivalent_Type (T));
3510 when E_Record_Type | E_Record_Subtype =>
3511 Set_Ekind (Id, E_Record_Subtype);
3513 if Ekind (T) = E_Record_Subtype
3514 and then Present (Cloned_Subtype (T))
3516 Set_Cloned_Subtype (Id, Cloned_Subtype (T));
3518 Set_Cloned_Subtype (Id, T);
3521 Set_First_Entity (Id, First_Entity (T));
3522 Set_Last_Entity (Id, Last_Entity (T));
3523 Set_Has_Discriminants (Id, Has_Discriminants (T));
3524 Set_Is_Constrained (Id, Is_Constrained (T));
3525 Set_Is_Limited_Record (Id, Is_Limited_Record (T));
3526 Set_Has_Unknown_Discriminants
3527 (Id, Has_Unknown_Discriminants (T));
3529 if Has_Discriminants (T) then
3530 Set_Discriminant_Constraint
3531 (Id, Discriminant_Constraint (T));
3532 Set_Stored_Constraint_From_Discriminant_Constraint (Id);
3534 elsif Has_Unknown_Discriminants (Id) then
3535 Set_Discriminant_Constraint (Id, No_Elist);
3538 if Is_Tagged_Type (T) then
3539 Set_Is_Tagged_Type (Id);
3540 Set_Is_Abstract_Type (Id, Is_Abstract_Type (T));
3541 Set_Primitive_Operations
3542 (Id, Primitive_Operations (T));
3543 Set_Class_Wide_Type (Id, Class_Wide_Type (T));
3545 if Is_Interface (T) then
3546 Set_Is_Interface (Id);
3547 Set_Is_Limited_Interface (Id, Is_Limited_Interface (T));
3551 when Private_Kind =>
3552 Set_Ekind (Id, Subtype_Kind (Ekind (T)));
3553 Set_Has_Discriminants (Id, Has_Discriminants (T));
3554 Set_Is_Constrained (Id, Is_Constrained (T));
3555 Set_First_Entity (Id, First_Entity (T));
3556 Set_Last_Entity (Id, Last_Entity (T));
3557 Set_Private_Dependents (Id, New_Elmt_List);
3558 Set_Is_Limited_Record (Id, Is_Limited_Record (T));
3559 Set_Has_Unknown_Discriminants
3560 (Id, Has_Unknown_Discriminants (T));
3561 Set_Known_To_Have_Preelab_Init
3562 (Id, Known_To_Have_Preelab_Init (T));
3564 if Is_Tagged_Type (T) then
3565 Set_Is_Tagged_Type (Id);
3566 Set_Is_Abstract_Type (Id, Is_Abstract_Type (T));
3567 Set_Primitive_Operations (Id, Primitive_Operations (T));
3568 Set_Class_Wide_Type (Id, Class_Wide_Type (T));
3571 -- In general the attributes of the subtype of a private type
3572 -- are the attributes of the partial view of parent. However,
3573 -- the full view may be a discriminated type, and the subtype
3574 -- must share the discriminant constraint to generate correct
3575 -- calls to initialization procedures.
3577 if Has_Discriminants (T) then
3578 Set_Discriminant_Constraint
3579 (Id, Discriminant_Constraint (T));
3580 Set_Stored_Constraint_From_Discriminant_Constraint (Id);
3582 elsif Present (Full_View (T))
3583 and then Has_Discriminants (Full_View (T))
3585 Set_Discriminant_Constraint
3586 (Id, Discriminant_Constraint (Full_View (T)));
3587 Set_Stored_Constraint_From_Discriminant_Constraint (Id);
3589 -- This would seem semantically correct, but apparently
3590 -- confuses the back-end. To be explained and checked with
3591 -- current version ???
3593 -- Set_Has_Discriminants (Id);
3596 Prepare_Private_Subtype_Completion (Id, N);
3599 Set_Ekind (Id, E_Access_Subtype);
3600 Set_Is_Constrained (Id, Is_Constrained (T));
3601 Set_Is_Access_Constant
3602 (Id, Is_Access_Constant (T));
3603 Set_Directly_Designated_Type
3604 (Id, Designated_Type (T));
3605 Set_Can_Never_Be_Null (Id, Can_Never_Be_Null (T));
3607 -- A Pure library_item must not contain the declaration of a
3608 -- named access type, except within a subprogram, generic
3609 -- subprogram, task unit, or protected unit, or if it has
3610 -- a specified Storage_Size of zero (RM05-10.2.1(15.4-15.5)).
3612 if Comes_From_Source (Id)
3613 and then In_Pure_Unit
3614 and then not In_Subprogram_Task_Protected_Unit
3615 and then not No_Pool_Assigned (Id)
3618 ("named access types not allowed in pure unit", N);
3621 when Concurrent_Kind =>
3622 Set_Ekind (Id, Subtype_Kind (Ekind (T)));
3623 Set_Corresponding_Record_Type (Id,
3624 Corresponding_Record_Type (T));
3625 Set_First_Entity (Id, First_Entity (T));
3626 Set_First_Private_Entity (Id, First_Private_Entity (T));
3627 Set_Has_Discriminants (Id, Has_Discriminants (T));
3628 Set_Is_Constrained (Id, Is_Constrained (T));
3629 Set_Is_Tagged_Type (Id, Is_Tagged_Type (T));
3630 Set_Last_Entity (Id, Last_Entity (T));
3632 if Has_Discriminants (T) then
3633 Set_Discriminant_Constraint (Id,
3634 Discriminant_Constraint (T));
3635 Set_Stored_Constraint_From_Discriminant_Constraint (Id);
3638 when E_Incomplete_Type =>
3639 if Ada_Version >= Ada_05 then
3640 Set_Ekind (Id, E_Incomplete_Subtype);
3642 -- Ada 2005 (AI-412): Decorate an incomplete subtype
3643 -- of an incomplete type visible through a limited
3646 if From_With_Type (T)
3647 and then Present (Non_Limited_View (T))
3649 Set_From_With_Type (Id);
3650 Set_Non_Limited_View (Id, Non_Limited_View (T));
3652 -- Ada 2005 (AI-412): Add the regular incomplete subtype
3653 -- to the private dependents of the original incomplete
3654 -- type for future transformation.
3657 Append_Elmt (Id, Private_Dependents (T));
3660 -- If the subtype name denotes an incomplete type an error
3661 -- was already reported by Process_Subtype.
3664 Set_Etype (Id, Any_Type);
3668 raise Program_Error;
3672 if Etype (Id) = Any_Type then
3676 -- Some common processing on all types
3678 Set_Size_Info (Id, T);
3679 Set_First_Rep_Item (Id, First_Rep_Item (T));
3683 Set_Is_Immediately_Visible (Id, True);
3684 Set_Depends_On_Private (Id, Has_Private_Component (T));
3685 Set_Is_Descendent_Of_Address (Id, Is_Descendent_Of_Address (T));
3687 if Is_Interface (T) then
3688 Set_Is_Interface (Id);
3691 if Present (Generic_Parent_Type (N))
3694 (Parent (Generic_Parent_Type (N))) /= N_Formal_Type_Declaration
3696 (Formal_Type_Definition (Parent (Generic_Parent_Type (N))))
3697 /= N_Formal_Private_Type_Definition)
3699 if Is_Tagged_Type (Id) then
3701 -- If this is a generic actual subtype for a synchronized type,
3702 -- the primitive operations are those of the corresponding record
3703 -- for which there is a separate subtype declaration.
3705 if Is_Concurrent_Type (Id) then
3707 elsif Is_Class_Wide_Type (Id) then
3708 Derive_Subprograms (Generic_Parent_Type (N), Id, Etype (T));
3710 Derive_Subprograms (Generic_Parent_Type (N), Id, T);
3713 elsif Scope (Etype (Id)) /= Standard_Standard then
3714 Derive_Subprograms (Generic_Parent_Type (N), Id);
3718 if Is_Private_Type (T)
3719 and then Present (Full_View (T))
3721 Conditional_Delay (Id, Full_View (T));
3723 -- The subtypes of components or subcomponents of protected types
3724 -- do not need freeze nodes, which would otherwise appear in the
3725 -- wrong scope (before the freeze node for the protected type). The
3726 -- proper subtypes are those of the subcomponents of the corresponding
3729 elsif Ekind (Scope (Id)) /= E_Protected_Type
3730 and then Present (Scope (Scope (Id))) -- error defense!
3731 and then Ekind (Scope (Scope (Id))) /= E_Protected_Type
3733 Conditional_Delay (Id, T);
3736 -- Check that constraint_error is raised for a scalar subtype
3737 -- indication when the lower or upper bound of a non-null range
3738 -- lies outside the range of the type mark.
3740 if Nkind (Subtype_Indication (N)) = N_Subtype_Indication then
3741 if Is_Scalar_Type (Etype (Id))
3742 and then Scalar_Range (Id) /=
3743 Scalar_Range (Etype (Subtype_Mark
3744 (Subtype_Indication (N))))
3748 Etype (Subtype_Mark (Subtype_Indication (N))));
3750 elsif Is_Array_Type (Etype (Id))
3751 and then Present (First_Index (Id))
3753 -- This really should be a subprogram that finds the indications
3756 if ((Nkind (First_Index (Id)) = N_Identifier
3757 and then Ekind (Entity (First_Index (Id))) in Scalar_Kind)
3758 or else Nkind (First_Index (Id)) = N_Subtype_Indication)
3760 Nkind (Scalar_Range (Etype (First_Index (Id)))) = N_Range
3763 Target_Typ : constant Entity_Id :=
3766 (Subtype_Mark (Subtype_Indication (N)))));
3770 (Scalar_Range (Etype (First_Index (Id))),
3772 Etype (First_Index (Id)),
3773 Defining_Identifier (N));
3779 Sloc (Defining_Identifier (N)));
3785 Set_Optimize_Alignment_Flags (Id);
3786 Check_Eliminated (Id);
3787 end Analyze_Subtype_Declaration;
3789 --------------------------------
3790 -- Analyze_Subtype_Indication --
3791 --------------------------------
3793 procedure Analyze_Subtype_Indication (N : Node_Id) is
3794 T : constant Entity_Id := Subtype_Mark (N);
3795 R : constant Node_Id := Range_Expression (Constraint (N));
3802 Set_Etype (N, Etype (R));
3803 Resolve (R, Entity (T));
3805 Set_Error_Posted (R);
3806 Set_Error_Posted (T);
3808 end Analyze_Subtype_Indication;
3810 ------------------------------
3811 -- Analyze_Type_Declaration --
3812 ------------------------------
3814 procedure Analyze_Type_Declaration (N : Node_Id) is
3815 Def : constant Node_Id := Type_Definition (N);
3816 Def_Id : constant Entity_Id := Defining_Identifier (N);
3820 Is_Remote : constant Boolean :=
3821 (Is_Remote_Types (Current_Scope)
3822 or else Is_Remote_Call_Interface (Current_Scope))
3823 and then not (In_Private_Part (Current_Scope)
3824 or else In_Package_Body (Current_Scope));
3826 procedure Check_Ops_From_Incomplete_Type;
3827 -- If there is a tagged incomplete partial view of the type, transfer
3828 -- its operations to the full view, and indicate that the type of the
3829 -- controlling parameter (s) is this full view.
3831 ------------------------------------
3832 -- Check_Ops_From_Incomplete_Type --
3833 ------------------------------------
3835 procedure Check_Ops_From_Incomplete_Type is
3842 and then Ekind (Prev) = E_Incomplete_Type
3843 and then Is_Tagged_Type (Prev)
3844 and then Is_Tagged_Type (T)
3846 Elmt := First_Elmt (Primitive_Operations (Prev));
3847 while Present (Elmt) loop
3849 Prepend_Elmt (Op, Primitive_Operations (T));
3851 Formal := First_Formal (Op);
3852 while Present (Formal) loop
3853 if Etype (Formal) = Prev then
3854 Set_Etype (Formal, T);
3857 Next_Formal (Formal);
3860 if Etype (Op) = Prev then
3867 end Check_Ops_From_Incomplete_Type;
3869 -- Start of processing for Analyze_Type_Declaration
3872 Prev := Find_Type_Name (N);
3874 -- The full view, if present, now points to the current type
3876 -- Ada 2005 (AI-50217): If the type was previously decorated when
3877 -- imported through a LIMITED WITH clause, it appears as incomplete
3878 -- but has no full view.
3879 -- If the incomplete view is tagged, a class_wide type has been
3880 -- created already. Use it for the full view as well, to prevent
3881 -- multiple incompatible class-wide types that may be created for
3882 -- self-referential anonymous access components.
3884 if Ekind (Prev) = E_Incomplete_Type
3885 and then Present (Full_View (Prev))
3887 T := Full_View (Prev);
3889 if Is_Tagged_Type (Prev)
3890 and then Present (Class_Wide_Type (Prev))
3892 Set_Ekind (T, Ekind (Prev)); -- will be reset later
3893 Set_Class_Wide_Type (T, Class_Wide_Type (Prev));
3894 Set_Etype (Class_Wide_Type (T), T);
3901 Set_Is_Pure (T, Is_Pure (Current_Scope));
3903 -- We set the flag Is_First_Subtype here. It is needed to set the
3904 -- corresponding flag for the Implicit class-wide-type created
3905 -- during tagged types processing.
3907 Set_Is_First_Subtype (T, True);
3909 -- Only composite types other than array types are allowed to have
3914 -- For derived types, the rule will be checked once we've figured
3915 -- out the parent type.
3917 when N_Derived_Type_Definition =>
3920 -- For record types, discriminants are allowed
3922 when N_Record_Definition =>
3926 if Present (Discriminant_Specifications (N)) then
3928 ("elementary or array type cannot have discriminants",
3930 (First (Discriminant_Specifications (N))));
3934 -- Elaborate the type definition according to kind, and generate
3935 -- subsidiary (implicit) subtypes where needed. We skip this if it was
3936 -- already done (this happens during the reanalysis that follows a call
3937 -- to the high level optimizer).
3939 if not Analyzed (T) then
3944 when N_Access_To_Subprogram_Definition =>
3945 Access_Subprogram_Declaration (T, Def);
3947 -- If this is a remote access to subprogram, we must create the
3948 -- equivalent fat pointer type, and related subprograms.
3951 Process_Remote_AST_Declaration (N);
3954 -- Validate categorization rule against access type declaration
3955 -- usually a violation in Pure unit, Shared_Passive unit.
3957 Validate_Access_Type_Declaration (T, N);
3959 when N_Access_To_Object_Definition =>
3960 Access_Type_Declaration (T, Def);
3962 -- Validate categorization rule against access type declaration
3963 -- usually a violation in Pure unit, Shared_Passive unit.
3965 Validate_Access_Type_Declaration (T, N);
3967 -- If we are in a Remote_Call_Interface package and define a
3968 -- RACW, then calling stubs and specific stream attributes
3972 and then Is_Remote_Access_To_Class_Wide_Type (Def_Id)
3974 Add_RACW_Features (Def_Id);
3977 -- Set no strict aliasing flag if config pragma seen
3979 if Opt.No_Strict_Aliasing then
3980 Set_No_Strict_Aliasing (Base_Type (Def_Id));
3983 when N_Array_Type_Definition =>
3984 Array_Type_Declaration (T, Def);
3986 when N_Derived_Type_Definition =>
3987 Derived_Type_Declaration (T, N, T /= Def_Id);
3989 when N_Enumeration_Type_Definition =>
3990 Enumeration_Type_Declaration (T, Def);
3992 when N_Floating_Point_Definition =>
3993 Floating_Point_Type_Declaration (T, Def);
3995 when N_Decimal_Fixed_Point_Definition =>
3996 Decimal_Fixed_Point_Type_Declaration (T, Def);
3998 when N_Ordinary_Fixed_Point_Definition =>
3999 Ordinary_Fixed_Point_Type_Declaration (T, Def);
4001 when N_Signed_Integer_Type_Definition =>
4002 Signed_Integer_Type_Declaration (T, Def);
4004 when N_Modular_Type_Definition =>
4005 Modular_Type_Declaration (T, Def);
4007 when N_Record_Definition =>
4008 Record_Type_Declaration (T, N, Prev);
4011 raise Program_Error;
4016 if Etype (T) = Any_Type then
4020 -- Some common processing for all types
4022 Set_Depends_On_Private (T, Has_Private_Component (T));
4023 Check_Ops_From_Incomplete_Type;
4025 -- Both the declared entity, and its anonymous base type if one
4026 -- was created, need freeze nodes allocated.
4029 B : constant Entity_Id := Base_Type (T);
4032 -- In the case where the base type differs from the first subtype, we
4033 -- pre-allocate a freeze node, and set the proper link to the first
4034 -- subtype. Freeze_Entity will use this preallocated freeze node when
4035 -- it freezes the entity.
4037 -- This does not apply if the base type is a generic type, whose
4038 -- declaration is independent of the current derived definition.
4040 if B /= T and then not Is_Generic_Type (B) then
4041 Ensure_Freeze_Node (B);
4042 Set_First_Subtype_Link (Freeze_Node (B), T);
4045 -- A type that is imported through a limited_with clause cannot
4046 -- generate any code, and thus need not be frozen. However, an access
4047 -- type with an imported designated type needs a finalization list,
4048 -- which may be referenced in some other package that has non-limited
4049 -- visibility on the designated type. Thus we must create the
4050 -- finalization list at the point the access type is frozen, to
4051 -- prevent unsatisfied references at link time.
4053 if not From_With_Type (T) or else Is_Access_Type (T) then
4054 Set_Has_Delayed_Freeze (T);
4058 -- Case where T is the full declaration of some private type which has
4059 -- been swapped in Defining_Identifier (N).
4061 if T /= Def_Id and then Is_Private_Type (Def_Id) then
4062 Process_Full_View (N, T, Def_Id);
4064 -- Record the reference. The form of this is a little strange, since
4065 -- the full declaration has been swapped in. So the first parameter
4066 -- here represents the entity to which a reference is made which is
4067 -- the "real" entity, i.e. the one swapped in, and the second
4068 -- parameter provides the reference location.
4070 -- Also, we want to kill Has_Pragma_Unreferenced temporarily here
4071 -- since we don't want a complaint about the full type being an
4072 -- unwanted reference to the private type
4075 B : constant Boolean := Has_Pragma_Unreferenced (T);
4077 Set_Has_Pragma_Unreferenced (T, False);
4078 Generate_Reference (T, T, 'c');
4079 Set_Has_Pragma_Unreferenced (T, B);
4082 Set_Completion_Referenced (Def_Id);
4084 -- For completion of incomplete type, process incomplete dependents
4085 -- and always mark the full type as referenced (it is the incomplete
4086 -- type that we get for any real reference).
4088 elsif Ekind (Prev) = E_Incomplete_Type then
4089 Process_Incomplete_Dependents (N, T, Prev);
4090 Generate_Reference (Prev, Def_Id, 'c');
4091 Set_Completion_Referenced (Def_Id);
4093 -- If not private type or incomplete type completion, this is a real
4094 -- definition of a new entity, so record it.
4097 Generate_Definition (Def_Id);
4100 if Chars (Scope (Def_Id)) = Name_System
4101 and then Chars (Def_Id) = Name_Address
4102 and then Is_Predefined_File_Name (Unit_File_Name (Get_Source_Unit (N)))
4104 Set_Is_Descendent_Of_Address (Def_Id);
4105 Set_Is_Descendent_Of_Address (Base_Type (Def_Id));
4106 Set_Is_Descendent_Of_Address (Prev);
4109 Set_Optimize_Alignment_Flags (Def_Id);
4110 Check_Eliminated (Def_Id);
4111 end Analyze_Type_Declaration;
4113 --------------------------
4114 -- Analyze_Variant_Part --
4115 --------------------------
4117 procedure Analyze_Variant_Part (N : Node_Id) is
4119 procedure Non_Static_Choice_Error (Choice : Node_Id);
4120 -- Error routine invoked by the generic instantiation below when the
4121 -- variant part has a non static choice.
4123 procedure Process_Declarations (Variant : Node_Id);
4124 -- Analyzes all the declarations associated with a Variant. Needed by
4125 -- the generic instantiation below.
4127 package Variant_Choices_Processing is new
4128 Generic_Choices_Processing
4129 (Get_Alternatives => Variants,
4130 Get_Choices => Discrete_Choices,
4131 Process_Empty_Choice => No_OP,
4132 Process_Non_Static_Choice => Non_Static_Choice_Error,
4133 Process_Associated_Node => Process_Declarations);
4134 use Variant_Choices_Processing;
4135 -- Instantiation of the generic choice processing package
4137 -----------------------------
4138 -- Non_Static_Choice_Error --
4139 -----------------------------
4141 procedure Non_Static_Choice_Error (Choice : Node_Id) is
4143 Flag_Non_Static_Expr
4144 ("choice given in variant part is not static!", Choice);
4145 end Non_Static_Choice_Error;
4147 --------------------------
4148 -- Process_Declarations --
4149 --------------------------
4151 procedure Process_Declarations (Variant : Node_Id) is
4153 if not Null_Present (Component_List (Variant)) then
4154 Analyze_Declarations (Component_Items (Component_List (Variant)));
4156 if Present (Variant_Part (Component_List (Variant))) then
4157 Analyze (Variant_Part (Component_List (Variant)));
4160 end Process_Declarations;
4164 Discr_Name : Node_Id;
4165 Discr_Type : Entity_Id;
4167 Case_Table : Choice_Table_Type (1 .. Number_Of_Choices (N));
4169 Dont_Care : Boolean;
4170 Others_Present : Boolean := False;
4172 pragma Warnings (Off, Case_Table);
4173 pragma Warnings (Off, Last_Choice);
4174 pragma Warnings (Off, Dont_Care);
4175 pragma Warnings (Off, Others_Present);
4176 -- We don't care about the assigned values of any of these
4178 -- Start of processing for Analyze_Variant_Part
4181 Discr_Name := Name (N);
4182 Analyze (Discr_Name);
4184 -- If Discr_Name bad, get out (prevent cascaded errors)
4186 if Etype (Discr_Name) = Any_Type then
4190 -- Check invalid discriminant in variant part
4192 if Ekind (Entity (Discr_Name)) /= E_Discriminant then
4193 Error_Msg_N ("invalid discriminant name in variant part", Discr_Name);
4196 Discr_Type := Etype (Entity (Discr_Name));
4198 if not Is_Discrete_Type (Discr_Type) then
4200 ("discriminant in a variant part must be of a discrete type",
4205 -- Call the instantiated Analyze_Choices which does the rest of the work
4208 (N, Discr_Type, Case_Table, Last_Choice, Dont_Care, Others_Present);
4209 end Analyze_Variant_Part;
4211 ----------------------------
4212 -- Array_Type_Declaration --
4213 ----------------------------
4215 procedure Array_Type_Declaration (T : in out Entity_Id; Def : Node_Id) is
4216 Component_Def : constant Node_Id := Component_Definition (Def);
4217 Element_Type : Entity_Id;
4218 Implicit_Base : Entity_Id;
4220 Related_Id : Entity_Id := Empty;
4222 P : constant Node_Id := Parent (Def);
4226 if Nkind (Def) = N_Constrained_Array_Definition then
4227 Index := First (Discrete_Subtype_Definitions (Def));
4229 Index := First (Subtype_Marks (Def));
4232 -- Find proper names for the implicit types which may be public. In case
4233 -- of anonymous arrays we use the name of the first object of that type
4237 Related_Id := Defining_Identifier (P);
4243 while Present (Index) loop
4246 -- Add a subtype declaration for each index of private array type
4247 -- declaration whose etype is also private. For example:
4250 -- type Index is private;
4252 -- type Table is array (Index) of ...
4255 -- This is currently required by the expander for the internally
4256 -- generated equality subprogram of records with variant parts in
4257 -- which the etype of some component is such private type.
4259 if Ekind (Current_Scope) = E_Package
4260 and then In_Private_Part (Current_Scope)
4261 and then Has_Private_Declaration (Etype (Index))
4264 Loc : constant Source_Ptr := Sloc (Def);
4270 Make_Defining_Identifier (Loc,
4271 Chars => New_Internal_Name ('T'));
4272 Set_Is_Internal (New_E);
4275 Make_Subtype_Declaration (Loc,
4276 Defining_Identifier => New_E,
4277 Subtype_Indication =>
4278 New_Occurrence_Of (Etype (Index), Loc));
4280 Insert_Before (Parent (Def), Decl);
4282 Set_Etype (Index, New_E);
4284 -- If the index is a range the Entity attribute is not
4285 -- available. Example:
4288 -- type T is private;
4290 -- type T is new Natural;
4291 -- Table : array (T(1) .. T(10)) of Boolean;
4294 if Nkind (Index) /= N_Range then
4295 Set_Entity (Index, New_E);
4300 Make_Index (Index, P, Related_Id, Nb_Index);
4302 Nb_Index := Nb_Index + 1;
4305 -- Process subtype indication if one is present
4307 if Present (Subtype_Indication (Component_Def)) then
4310 (Subtype_Indication (Component_Def), P, Related_Id, 'C');
4312 -- Ada 2005 (AI-230): Access Definition case
4314 else pragma Assert (Present (Access_Definition (Component_Def)));
4316 -- Indicate that the anonymous access type is created by the
4317 -- array type declaration.
4319 Element_Type := Access_Definition
4321 N => Access_Definition (Component_Def));
4322 Set_Is_Local_Anonymous_Access (Element_Type);
4324 -- Propagate the parent. This field is needed if we have to generate
4325 -- the master_id associated with an anonymous access to task type
4326 -- component (see Expand_N_Full_Type_Declaration.Build_Master)
4328 Set_Parent (Element_Type, Parent (T));
4330 -- Ada 2005 (AI-230): In case of components that are anonymous access
4331 -- types the level of accessibility depends on the enclosing type
4334 Set_Scope (Element_Type, Current_Scope); -- Ada 2005 (AI-230)
4336 -- Ada 2005 (AI-254)
4339 CD : constant Node_Id :=
4340 Access_To_Subprogram_Definition
4341 (Access_Definition (Component_Def));
4343 if Present (CD) and then Protected_Present (CD) then
4345 Replace_Anonymous_Access_To_Protected_Subprogram (Def);
4350 -- Constrained array case
4353 T := Create_Itype (E_Void, P, Related_Id, 'T');
4356 if Nkind (Def) = N_Constrained_Array_Definition then
4358 -- Establish Implicit_Base as unconstrained base type
4360 Implicit_Base := Create_Itype (E_Array_Type, P, Related_Id, 'B');
4362 Set_Etype (Implicit_Base, Implicit_Base);
4363 Set_Scope (Implicit_Base, Current_Scope);
4364 Set_Has_Delayed_Freeze (Implicit_Base);
4366 -- The constrained array type is a subtype of the unconstrained one
4368 Set_Ekind (T, E_Array_Subtype);
4369 Init_Size_Align (T);
4370 Set_Etype (T, Implicit_Base);
4371 Set_Scope (T, Current_Scope);
4372 Set_Is_Constrained (T, True);
4373 Set_First_Index (T, First (Discrete_Subtype_Definitions (Def)));
4374 Set_Has_Delayed_Freeze (T);
4376 -- Complete setup of implicit base type
4378 Set_First_Index (Implicit_Base, First_Index (T));
4379 Set_Component_Type (Implicit_Base, Element_Type);
4380 Set_Has_Task (Implicit_Base, Has_Task (Element_Type));
4381 Set_Component_Size (Implicit_Base, Uint_0);
4382 Set_Packed_Array_Type (Implicit_Base, Empty);
4383 Set_Has_Controlled_Component
4384 (Implicit_Base, Has_Controlled_Component
4386 or else Is_Controlled
4388 Set_Finalize_Storage_Only
4389 (Implicit_Base, Finalize_Storage_Only
4392 -- Unconstrained array case
4395 Set_Ekind (T, E_Array_Type);
4396 Init_Size_Align (T);
4398 Set_Scope (T, Current_Scope);
4399 Set_Component_Size (T, Uint_0);
4400 Set_Is_Constrained (T, False);
4401 Set_First_Index (T, First (Subtype_Marks (Def)));
4402 Set_Has_Delayed_Freeze (T, True);
4403 Set_Has_Task (T, Has_Task (Element_Type));
4404 Set_Has_Controlled_Component (T, Has_Controlled_Component
4407 Is_Controlled (Element_Type));
4408 Set_Finalize_Storage_Only (T, Finalize_Storage_Only
4412 -- Common attributes for both cases
4414 Set_Component_Type (Base_Type (T), Element_Type);
4415 Set_Packed_Array_Type (T, Empty);
4417 if Aliased_Present (Component_Definition (Def)) then
4418 Set_Has_Aliased_Components (Etype (T));
4421 -- Ada 2005 (AI-231): Propagate the null-excluding attribute to the
4422 -- array type to ensure that objects of this type are initialized.
4424 if Ada_Version >= Ada_05
4425 and then Can_Never_Be_Null (Element_Type)
4427 Set_Can_Never_Be_Null (T);
4429 if Null_Exclusion_Present (Component_Definition (Def))
4431 -- No need to check itypes because in their case this check was
4432 -- done at their point of creation
4434 and then not Is_Itype (Element_Type)
4437 ("`NOT NULL` not allowed (null already excluded)",
4438 Subtype_Indication (Component_Definition (Def)));
4442 Priv := Private_Component (Element_Type);
4444 if Present (Priv) then
4446 -- Check for circular definitions
4448 if Priv = Any_Type then
4449 Set_Component_Type (Etype (T), Any_Type);
4451 -- There is a gap in the visibility of operations on the composite
4452 -- type only if the component type is defined in a different scope.
4454 elsif Scope (Priv) = Current_Scope then
4457 elsif Is_Limited_Type (Priv) then
4458 Set_Is_Limited_Composite (Etype (T));
4459 Set_Is_Limited_Composite (T);
4461 Set_Is_Private_Composite (Etype (T));
4462 Set_Is_Private_Composite (T);
4466 -- A syntax error in the declaration itself may lead to an empty index
4467 -- list, in which case do a minimal patch.
4469 if No (First_Index (T)) then
4470 Error_Msg_N ("missing index definition in array type declaration", T);
4473 Indices : constant List_Id :=
4474 New_List (New_Occurrence_Of (Any_Id, Sloc (T)));
4476 Set_Discrete_Subtype_Definitions (Def, Indices);
4477 Set_First_Index (T, First (Indices));
4482 -- Create a concatenation operator for the new type. Internal array
4483 -- types created for packed entities do not need such, they are
4484 -- compatible with the user-defined type.
4486 if Number_Dimensions (T) = 1
4487 and then not Is_Packed_Array_Type (T)
4489 New_Concatenation_Op (T);
4492 -- In the case of an unconstrained array the parser has already verified
4493 -- that all the indices are unconstrained but we still need to make sure
4494 -- that the element type is constrained.
4496 if Is_Indefinite_Subtype (Element_Type) then
4498 ("unconstrained element type in array declaration",
4499 Subtype_Indication (Component_Def));
4501 elsif Is_Abstract_Type (Element_Type) then
4503 ("the type of a component cannot be abstract",
4504 Subtype_Indication (Component_Def));
4506 end Array_Type_Declaration;
4508 ------------------------------------------------------
4509 -- Replace_Anonymous_Access_To_Protected_Subprogram --
4510 ------------------------------------------------------
4512 function Replace_Anonymous_Access_To_Protected_Subprogram
4513 (N : Node_Id) return Entity_Id
4515 Loc : constant Source_Ptr := Sloc (N);
4517 Curr_Scope : constant Scope_Stack_Entry :=
4518 Scope_Stack.Table (Scope_Stack.Last);
4520 Anon : constant Entity_Id :=
4521 Make_Defining_Identifier (Loc,
4522 Chars => New_Internal_Name ('S'));
4530 Set_Is_Internal (Anon);
4533 when N_Component_Declaration |
4534 N_Unconstrained_Array_Definition |
4535 N_Constrained_Array_Definition =>
4536 Comp := Component_Definition (N);
4537 Acc := Access_Definition (Comp);
4539 when N_Discriminant_Specification =>
4540 Comp := Discriminant_Type (N);
4543 when N_Parameter_Specification =>
4544 Comp := Parameter_Type (N);
4547 when N_Access_Function_Definition =>
4548 Comp := Result_Definition (N);
4551 when N_Object_Declaration =>
4552 Comp := Object_Definition (N);
4555 when N_Function_Specification =>
4556 Comp := Result_Definition (N);
4560 raise Program_Error;
4563 Decl := Make_Full_Type_Declaration (Loc,
4564 Defining_Identifier => Anon,
4566 Copy_Separate_Tree (Access_To_Subprogram_Definition (Acc)));
4568 Mark_Rewrite_Insertion (Decl);
4570 -- Insert the new declaration in the nearest enclosing scope. If the
4571 -- node is a body and N is its return type, the declaration belongs in
4572 -- the enclosing scope.
4576 if Nkind (P) = N_Subprogram_Body
4577 and then Nkind (N) = N_Function_Specification
4582 while Present (P) and then not Has_Declarations (P) loop
4586 pragma Assert (Present (P));
4588 if Nkind (P) = N_Package_Specification then
4589 Prepend (Decl, Visible_Declarations (P));
4591 Prepend (Decl, Declarations (P));
4594 -- Replace the anonymous type with an occurrence of the new declaration.
4595 -- In all cases the rewritten node does not have the null-exclusion
4596 -- attribute because (if present) it was already inherited by the
4597 -- anonymous entity (Anon). Thus, in case of components we do not
4598 -- inherit this attribute.
4600 if Nkind (N) = N_Parameter_Specification then
4601 Rewrite (Comp, New_Occurrence_Of (Anon, Loc));
4602 Set_Etype (Defining_Identifier (N), Anon);
4603 Set_Null_Exclusion_Present (N, False);
4605 elsif Nkind (N) = N_Object_Declaration then
4606 Rewrite (Comp, New_Occurrence_Of (Anon, Loc));
4607 Set_Etype (Defining_Identifier (N), Anon);
4609 elsif Nkind (N) = N_Access_Function_Definition then
4610 Rewrite (Comp, New_Occurrence_Of (Anon, Loc));
4612 elsif Nkind (N) = N_Function_Specification then
4613 Rewrite (Comp, New_Occurrence_Of (Anon, Loc));
4614 Set_Etype (Defining_Unit_Name (N), Anon);
4618 Make_Component_Definition (Loc,
4619 Subtype_Indication => New_Occurrence_Of (Anon, Loc)));
4622 Mark_Rewrite_Insertion (Comp);
4624 if Nkind_In (N, N_Object_Declaration, N_Access_Function_Definition) then
4628 -- Temporarily remove the current scope (record or subprogram) from
4629 -- the stack to add the new declarations to the enclosing scope.
4631 Scope_Stack.Decrement_Last;
4633 Set_Is_Itype (Anon);
4634 Scope_Stack.Append (Curr_Scope);
4637 Set_Ekind (Anon, E_Anonymous_Access_Protected_Subprogram_Type);
4638 Set_Can_Use_Internal_Rep (Anon, not Always_Compatible_Rep_On_Target);
4640 end Replace_Anonymous_Access_To_Protected_Subprogram;
4642 -------------------------------
4643 -- Build_Derived_Access_Type --
4644 -------------------------------
4646 procedure Build_Derived_Access_Type
4648 Parent_Type : Entity_Id;
4649 Derived_Type : Entity_Id)
4651 S : constant Node_Id := Subtype_Indication (Type_Definition (N));
4653 Desig_Type : Entity_Id;
4655 Discr_Con_Elist : Elist_Id;
4656 Discr_Con_El : Elmt_Id;
4660 -- Set the designated type so it is available in case this is an access
4661 -- to a self-referential type, e.g. a standard list type with a next
4662 -- pointer. Will be reset after subtype is built.
4664 Set_Directly_Designated_Type
4665 (Derived_Type, Designated_Type (Parent_Type));
4667 Subt := Process_Subtype (S, N);
4669 if Nkind (S) /= N_Subtype_Indication
4670 and then Subt /= Base_Type (Subt)
4672 Set_Ekind (Derived_Type, E_Access_Subtype);
4675 if Ekind (Derived_Type) = E_Access_Subtype then
4677 Pbase : constant Entity_Id := Base_Type (Parent_Type);
4678 Ibase : constant Entity_Id :=
4679 Create_Itype (Ekind (Pbase), N, Derived_Type, 'B');
4680 Svg_Chars : constant Name_Id := Chars (Ibase);
4681 Svg_Next_E : constant Entity_Id := Next_Entity (Ibase);
4684 Copy_Node (Pbase, Ibase);
4686 Set_Chars (Ibase, Svg_Chars);
4687 Set_Next_Entity (Ibase, Svg_Next_E);
4688 Set_Sloc (Ibase, Sloc (Derived_Type));
4689 Set_Scope (Ibase, Scope (Derived_Type));
4690 Set_Freeze_Node (Ibase, Empty);
4691 Set_Is_Frozen (Ibase, False);
4692 Set_Comes_From_Source (Ibase, False);
4693 Set_Is_First_Subtype (Ibase, False);
4695 Set_Etype (Ibase, Pbase);
4696 Set_Etype (Derived_Type, Ibase);
4700 Set_Directly_Designated_Type
4701 (Derived_Type, Designated_Type (Subt));
4703 Set_Is_Constrained (Derived_Type, Is_Constrained (Subt));
4704 Set_Is_Access_Constant (Derived_Type, Is_Access_Constant (Parent_Type));
4705 Set_Size_Info (Derived_Type, Parent_Type);
4706 Set_RM_Size (Derived_Type, RM_Size (Parent_Type));
4707 Set_Depends_On_Private (Derived_Type,
4708 Has_Private_Component (Derived_Type));
4709 Conditional_Delay (Derived_Type, Subt);
4711 -- Ada 2005 (AI-231): Set the null-exclusion attribute, and verify
4712 -- that it is not redundant.
4714 if Null_Exclusion_Present (Type_Definition (N)) then
4715 Set_Can_Never_Be_Null (Derived_Type);
4717 if Can_Never_Be_Null (Parent_Type)
4721 ("`NOT NULL` not allowed (& already excludes null)",
4725 elsif Can_Never_Be_Null (Parent_Type) then
4726 Set_Can_Never_Be_Null (Derived_Type);
4729 -- Note: we do not copy the Storage_Size_Variable, since we always go to
4730 -- the root type for this information.
4732 -- Apply range checks to discriminants for derived record case
4733 -- ??? THIS CODE SHOULD NOT BE HERE REALLY.
4735 Desig_Type := Designated_Type (Derived_Type);
4736 if Is_Composite_Type (Desig_Type)
4737 and then (not Is_Array_Type (Desig_Type))
4738 and then Has_Discriminants (Desig_Type)
4739 and then Base_Type (Desig_Type) /= Desig_Type
4741 Discr_Con_Elist := Discriminant_Constraint (Desig_Type);
4742 Discr_Con_El := First_Elmt (Discr_Con_Elist);
4744 Discr := First_Discriminant (Base_Type (Desig_Type));
4745 while Present (Discr_Con_El) loop
4746 Apply_Range_Check (Node (Discr_Con_El), Etype (Discr));
4747 Next_Elmt (Discr_Con_El);
4748 Next_Discriminant (Discr);
4751 end Build_Derived_Access_Type;
4753 ------------------------------
4754 -- Build_Derived_Array_Type --
4755 ------------------------------
4757 procedure Build_Derived_Array_Type
4759 Parent_Type : Entity_Id;
4760 Derived_Type : Entity_Id)
4762 Loc : constant Source_Ptr := Sloc (N);
4763 Tdef : constant Node_Id := Type_Definition (N);
4764 Indic : constant Node_Id := Subtype_Indication (Tdef);
4765 Parent_Base : constant Entity_Id := Base_Type (Parent_Type);
4766 Implicit_Base : Entity_Id;
4767 New_Indic : Node_Id;
4769 procedure Make_Implicit_Base;
4770 -- If the parent subtype is constrained, the derived type is a subtype
4771 -- of an implicit base type derived from the parent base.
4773 ------------------------
4774 -- Make_Implicit_Base --
4775 ------------------------
4777 procedure Make_Implicit_Base is
4780 Create_Itype (Ekind (Parent_Base), N, Derived_Type, 'B');
4782 Set_Ekind (Implicit_Base, Ekind (Parent_Base));
4783 Set_Etype (Implicit_Base, Parent_Base);
4785 Copy_Array_Subtype_Attributes (Implicit_Base, Parent_Base);
4786 Copy_Array_Base_Type_Attributes (Implicit_Base, Parent_Base);
4788 Set_Has_Delayed_Freeze (Implicit_Base, True);
4789 end Make_Implicit_Base;
4791 -- Start of processing for Build_Derived_Array_Type
4794 if not Is_Constrained (Parent_Type) then
4795 if Nkind (Indic) /= N_Subtype_Indication then
4796 Set_Ekind (Derived_Type, E_Array_Type);
4798 Copy_Array_Subtype_Attributes (Derived_Type, Parent_Type);
4799 Copy_Array_Base_Type_Attributes (Derived_Type, Parent_Type);
4801 Set_Has_Delayed_Freeze (Derived_Type, True);
4805 Set_Etype (Derived_Type, Implicit_Base);
4808 Make_Subtype_Declaration (Loc,
4809 Defining_Identifier => Derived_Type,
4810 Subtype_Indication =>
4811 Make_Subtype_Indication (Loc,
4812 Subtype_Mark => New_Reference_To (Implicit_Base, Loc),
4813 Constraint => Constraint (Indic)));
4815 Rewrite (N, New_Indic);
4820 if Nkind (Indic) /= N_Subtype_Indication then
4823 Set_Ekind (Derived_Type, Ekind (Parent_Type));
4824 Set_Etype (Derived_Type, Implicit_Base);
4825 Copy_Array_Subtype_Attributes (Derived_Type, Parent_Type);
4828 Error_Msg_N ("illegal constraint on constrained type", Indic);
4832 -- If parent type is not a derived type itself, and is declared in
4833 -- closed scope (e.g. a subprogram), then we must explicitly introduce
4834 -- the new type's concatenation operator since Derive_Subprograms
4835 -- will not inherit the parent's operator. If the parent type is
4836 -- unconstrained, the operator is of the unconstrained base type.
4838 if Number_Dimensions (Parent_Type) = 1
4839 and then not Is_Limited_Type (Parent_Type)
4840 and then not Is_Derived_Type (Parent_Type)
4841 and then not Is_Package_Or_Generic_Package
4842 (Scope (Base_Type (Parent_Type)))
4844 if not Is_Constrained (Parent_Type)
4845 and then Is_Constrained (Derived_Type)
4847 New_Concatenation_Op (Implicit_Base);
4849 New_Concatenation_Op (Derived_Type);
4852 end Build_Derived_Array_Type;
4854 -----------------------------------
4855 -- Build_Derived_Concurrent_Type --
4856 -----------------------------------
4858 procedure Build_Derived_Concurrent_Type
4860 Parent_Type : Entity_Id;
4861 Derived_Type : Entity_Id)
4863 D_Constraint : Node_Id;
4864 Disc_Spec : Node_Id;
4865 Old_Disc : Entity_Id;
4866 New_Disc : Entity_Id;
4868 Constraint_Present : constant Boolean :=
4869 Nkind (Subtype_Indication (Type_Definition (N)))
4870 = N_Subtype_Indication;
4873 Set_Stored_Constraint (Derived_Type, No_Elist);
4875 -- Copy Storage_Size and Relative_Deadline variables if task case
4877 if Is_Task_Type (Parent_Type) then
4878 Set_Storage_Size_Variable (Derived_Type,
4879 Storage_Size_Variable (Parent_Type));
4880 Set_Relative_Deadline_Variable (Derived_Type,
4881 Relative_Deadline_Variable (Parent_Type));
4884 if Present (Discriminant_Specifications (N)) then
4885 Push_Scope (Derived_Type);
4886 Check_Or_Process_Discriminants (N, Derived_Type);
4889 elsif Constraint_Present then
4891 -- Build constrained subtype and derive from it
4894 Loc : constant Source_Ptr := Sloc (N);
4895 Anon : constant Entity_Id :=
4896 Make_Defining_Identifier (Loc,
4897 New_External_Name (Chars (Derived_Type), 'T'));
4902 Make_Subtype_Declaration (Loc,
4903 Defining_Identifier => Anon,
4904 Subtype_Indication =>
4905 Subtype_Indication (Type_Definition (N)));
4906 Insert_Before (N, Decl);
4909 Rewrite (Subtype_Indication (Type_Definition (N)),
4910 New_Occurrence_Of (Anon, Loc));
4911 Set_Analyzed (Derived_Type, False);
4917 -- All attributes are inherited from parent. In particular,
4918 -- entries and the corresponding record type are the same.
4919 -- Discriminants may be renamed, and must be treated separately.
4921 Set_Has_Discriminants
4922 (Derived_Type, Has_Discriminants (Parent_Type));
4923 Set_Corresponding_Record_Type
4924 (Derived_Type, Corresponding_Record_Type (Parent_Type));
4926 -- Is_Constrained is set according the parent subtype, but is set to
4927 -- False if the derived type is declared with new discriminants.
4931 (Is_Constrained (Parent_Type) or else Constraint_Present)
4932 and then not Present (Discriminant_Specifications (N)));
4934 if Constraint_Present then
4935 if not Has_Discriminants (Parent_Type) then
4936 Error_Msg_N ("untagged parent must have discriminants", N);
4938 elsif Present (Discriminant_Specifications (N)) then
4940 -- Verify that new discriminants are used to constrain old ones
4945 (Constraint (Subtype_Indication (Type_Definition (N)))));
4947 Old_Disc := First_Discriminant (Parent_Type);
4948 New_Disc := First_Discriminant (Derived_Type);
4949 Disc_Spec := First (Discriminant_Specifications (N));
4950 while Present (Old_Disc) and then Present (Disc_Spec) loop
4951 if Nkind (Discriminant_Type (Disc_Spec)) /=
4954 Analyze (Discriminant_Type (Disc_Spec));
4956 if not Subtypes_Statically_Compatible (
4957 Etype (Discriminant_Type (Disc_Spec)),
4961 ("not statically compatible with parent discriminant",
4962 Discriminant_Type (Disc_Spec));
4966 if Nkind (D_Constraint) = N_Identifier
4967 and then Chars (D_Constraint) /=
4968 Chars (Defining_Identifier (Disc_Spec))
4970 Error_Msg_N ("new discriminants must constrain old ones",
4973 Set_Corresponding_Discriminant (New_Disc, Old_Disc);
4976 Next_Discriminant (Old_Disc);
4977 Next_Discriminant (New_Disc);
4981 if Present (Old_Disc) or else Present (Disc_Spec) then
4982 Error_Msg_N ("discriminant mismatch in derivation", N);
4987 elsif Present (Discriminant_Specifications (N)) then
4989 ("missing discriminant constraint in untagged derivation",
4993 if Present (Discriminant_Specifications (N)) then
4994 Old_Disc := First_Discriminant (Parent_Type);
4995 while Present (Old_Disc) loop
4997 if No (Next_Entity (Old_Disc))
4998 or else Ekind (Next_Entity (Old_Disc)) /= E_Discriminant
5000 Set_Next_Entity (Last_Entity (Derived_Type),
5001 Next_Entity (Old_Disc));
5005 Next_Discriminant (Old_Disc);
5009 Set_First_Entity (Derived_Type, First_Entity (Parent_Type));
5010 if Has_Discriminants (Parent_Type) then
5011 Set_Is_Constrained (Derived_Type, Is_Constrained (Parent_Type));
5012 Set_Discriminant_Constraint (
5013 Derived_Type, Discriminant_Constraint (Parent_Type));
5017 Set_Last_Entity (Derived_Type, Last_Entity (Parent_Type));
5019 Set_Has_Completion (Derived_Type);
5020 end Build_Derived_Concurrent_Type;
5022 ------------------------------------
5023 -- Build_Derived_Enumeration_Type --
5024 ------------------------------------
5026 procedure Build_Derived_Enumeration_Type
5028 Parent_Type : Entity_Id;
5029 Derived_Type : Entity_Id)
5031 Loc : constant Source_Ptr := Sloc (N);
5032 Def : constant Node_Id := Type_Definition (N);
5033 Indic : constant Node_Id := Subtype_Indication (Def);
5034 Implicit_Base : Entity_Id;
5035 Literal : Entity_Id;
5036 New_Lit : Entity_Id;
5037 Literals_List : List_Id;
5038 Type_Decl : Node_Id;
5040 Rang_Expr : Node_Id;
5043 -- Since types Standard.Character and Standard.[Wide_]Wide_Character do
5044 -- not have explicit literals lists we need to process types derived
5045 -- from them specially. This is handled by Derived_Standard_Character.
5046 -- If the parent type is a generic type, there are no literals either,
5047 -- and we construct the same skeletal representation as for the generic
5050 if Is_Standard_Character_Type (Parent_Type) then
5051 Derived_Standard_Character (N, Parent_Type, Derived_Type);
5053 elsif Is_Generic_Type (Root_Type (Parent_Type)) then
5059 if Nkind (Indic) /= N_Subtype_Indication then
5061 Make_Attribute_Reference (Loc,
5062 Attribute_Name => Name_First,
5063 Prefix => New_Reference_To (Derived_Type, Loc));
5064 Set_Etype (Lo, Derived_Type);
5067 Make_Attribute_Reference (Loc,
5068 Attribute_Name => Name_Last,
5069 Prefix => New_Reference_To (Derived_Type, Loc));
5070 Set_Etype (Hi, Derived_Type);
5072 Set_Scalar_Range (Derived_Type,
5078 -- Analyze subtype indication and verify compatibility
5079 -- with parent type.
5081 if Base_Type (Process_Subtype (Indic, N)) /=
5082 Base_Type (Parent_Type)
5085 ("illegal constraint for formal discrete type", N);
5091 -- If a constraint is present, analyze the bounds to catch
5092 -- premature usage of the derived literals.
5094 if Nkind (Indic) = N_Subtype_Indication
5095 and then Nkind (Range_Expression (Constraint (Indic))) = N_Range
5097 Analyze (Low_Bound (Range_Expression (Constraint (Indic))));
5098 Analyze (High_Bound (Range_Expression (Constraint (Indic))));
5101 -- Introduce an implicit base type for the derived type even if there
5102 -- is no constraint attached to it, since this seems closer to the
5103 -- Ada semantics. Build a full type declaration tree for the derived
5104 -- type using the implicit base type as the defining identifier. The
5105 -- build a subtype declaration tree which applies the constraint (if
5106 -- any) have it replace the derived type declaration.
5108 Literal := First_Literal (Parent_Type);
5109 Literals_List := New_List;
5110 while Present (Literal)
5111 and then Ekind (Literal) = E_Enumeration_Literal
5113 -- Literals of the derived type have the same representation as
5114 -- those of the parent type, but this representation can be
5115 -- overridden by an explicit representation clause. Indicate
5116 -- that there is no explicit representation given yet. These
5117 -- derived literals are implicit operations of the new type,
5118 -- and can be overridden by explicit ones.
5120 if Nkind (Literal) = N_Defining_Character_Literal then
5122 Make_Defining_Character_Literal (Loc, Chars (Literal));
5124 New_Lit := Make_Defining_Identifier (Loc, Chars (Literal));
5127 Set_Ekind (New_Lit, E_Enumeration_Literal);
5128 Set_Enumeration_Pos (New_Lit, Enumeration_Pos (Literal));
5129 Set_Enumeration_Rep (New_Lit, Enumeration_Rep (Literal));
5130 Set_Enumeration_Rep_Expr (New_Lit, Empty);
5131 Set_Alias (New_Lit, Literal);
5132 Set_Is_Known_Valid (New_Lit, True);
5134 Append (New_Lit, Literals_List);
5135 Next_Literal (Literal);
5139 Make_Defining_Identifier (Sloc (Derived_Type),
5140 New_External_Name (Chars (Derived_Type), 'B'));
5142 -- Indicate the proper nature of the derived type. This must be done
5143 -- before analysis of the literals, to recognize cases when a literal
5144 -- may be hidden by a previous explicit function definition (cf.
5147 Set_Ekind (Derived_Type, E_Enumeration_Subtype);
5148 Set_Etype (Derived_Type, Implicit_Base);
5151 Make_Full_Type_Declaration (Loc,
5152 Defining_Identifier => Implicit_Base,
5153 Discriminant_Specifications => No_List,
5155 Make_Enumeration_Type_Definition (Loc, Literals_List));
5157 Mark_Rewrite_Insertion (Type_Decl);
5158 Insert_Before (N, Type_Decl);
5159 Analyze (Type_Decl);
5161 -- After the implicit base is analyzed its Etype needs to be changed
5162 -- to reflect the fact that it is derived from the parent type which
5163 -- was ignored during analysis. We also set the size at this point.
5165 Set_Etype (Implicit_Base, Parent_Type);
5167 Set_Size_Info (Implicit_Base, Parent_Type);
5168 Set_RM_Size (Implicit_Base, RM_Size (Parent_Type));
5169 Set_First_Rep_Item (Implicit_Base, First_Rep_Item (Parent_Type));
5171 Set_Has_Non_Standard_Rep
5172 (Implicit_Base, Has_Non_Standard_Rep
5174 Set_Has_Delayed_Freeze (Implicit_Base);
5176 -- Process the subtype indication including a validation check on the
5177 -- constraint, if any. If a constraint is given, its bounds must be
5178 -- implicitly converted to the new type.
5180 if Nkind (Indic) = N_Subtype_Indication then
5182 R : constant Node_Id :=
5183 Range_Expression (Constraint (Indic));
5186 if Nkind (R) = N_Range then
5187 Hi := Build_Scalar_Bound
5188 (High_Bound (R), Parent_Type, Implicit_Base);
5189 Lo := Build_Scalar_Bound
5190 (Low_Bound (R), Parent_Type, Implicit_Base);
5193 -- Constraint is a Range attribute. Replace with explicit
5194 -- mention of the bounds of the prefix, which must be a
5197 Analyze (Prefix (R));
5199 Convert_To (Implicit_Base,
5200 Make_Attribute_Reference (Loc,
5201 Attribute_Name => Name_Last,
5203 New_Occurrence_Of (Entity (Prefix (R)), Loc)));
5206 Convert_To (Implicit_Base,
5207 Make_Attribute_Reference (Loc,
5208 Attribute_Name => Name_First,
5210 New_Occurrence_Of (Entity (Prefix (R)), Loc)));
5217 (Type_High_Bound (Parent_Type),
5218 Parent_Type, Implicit_Base);
5221 (Type_Low_Bound (Parent_Type),
5222 Parent_Type, Implicit_Base);
5230 -- If we constructed a default range for the case where no range
5231 -- was given, then the expressions in the range must not freeze
5232 -- since they do not correspond to expressions in the source.
5234 if Nkind (Indic) /= N_Subtype_Indication then
5235 Set_Must_Not_Freeze (Lo);
5236 Set_Must_Not_Freeze (Hi);
5237 Set_Must_Not_Freeze (Rang_Expr);
5241 Make_Subtype_Declaration (Loc,
5242 Defining_Identifier => Derived_Type,
5243 Subtype_Indication =>
5244 Make_Subtype_Indication (Loc,
5245 Subtype_Mark => New_Occurrence_Of (Implicit_Base, Loc),
5247 Make_Range_Constraint (Loc,
5248 Range_Expression => Rang_Expr))));
5252 -- If pragma Discard_Names applies on the first subtype of the parent
5253 -- type, then it must be applied on this subtype as well.
5255 if Einfo.Discard_Names (First_Subtype (Parent_Type)) then
5256 Set_Discard_Names (Derived_Type);
5259 -- Apply a range check. Since this range expression doesn't have an
5260 -- Etype, we have to specifically pass the Source_Typ parameter. Is
5263 if Nkind (Indic) = N_Subtype_Indication then
5264 Apply_Range_Check (Range_Expression (Constraint (Indic)),
5266 Source_Typ => Entity (Subtype_Mark (Indic)));
5269 end Build_Derived_Enumeration_Type;
5271 --------------------------------
5272 -- Build_Derived_Numeric_Type --
5273 --------------------------------
5275 procedure Build_Derived_Numeric_Type
5277 Parent_Type : Entity_Id;
5278 Derived_Type : Entity_Id)
5280 Loc : constant Source_Ptr := Sloc (N);
5281 Tdef : constant Node_Id := Type_Definition (N);
5282 Indic : constant Node_Id := Subtype_Indication (Tdef);
5283 Parent_Base : constant Entity_Id := Base_Type (Parent_Type);
5284 No_Constraint : constant Boolean := Nkind (Indic) /=
5285 N_Subtype_Indication;
5286 Implicit_Base : Entity_Id;
5292 -- Process the subtype indication including a validation check on
5293 -- the constraint if any.
5295 Discard_Node (Process_Subtype (Indic, N));
5297 -- Introduce an implicit base type for the derived type even if there
5298 -- is no constraint attached to it, since this seems closer to the Ada
5302 Create_Itype (Ekind (Parent_Base), N, Derived_Type, 'B');
5304 Set_Etype (Implicit_Base, Parent_Base);
5305 Set_Ekind (Implicit_Base, Ekind (Parent_Base));
5306 Set_Size_Info (Implicit_Base, Parent_Base);
5307 Set_First_Rep_Item (Implicit_Base, First_Rep_Item (Parent_Base));
5308 Set_Parent (Implicit_Base, Parent (Derived_Type));
5309 Set_Is_Known_Valid (Implicit_Base, Is_Known_Valid (Parent_Base));
5311 -- Set RM Size for discrete type or decimal fixed-point type
5312 -- Ordinary fixed-point is excluded, why???
5314 if Is_Discrete_Type (Parent_Base)
5315 or else Is_Decimal_Fixed_Point_Type (Parent_Base)
5317 Set_RM_Size (Implicit_Base, RM_Size (Parent_Base));
5320 Set_Has_Delayed_Freeze (Implicit_Base);
5322 Lo := New_Copy_Tree (Type_Low_Bound (Parent_Base));
5323 Hi := New_Copy_Tree (Type_High_Bound (Parent_Base));
5325 Set_Scalar_Range (Implicit_Base,
5330 if Has_Infinities (Parent_Base) then
5331 Set_Includes_Infinities (Scalar_Range (Implicit_Base));
5334 -- The Derived_Type, which is the entity of the declaration, is a
5335 -- subtype of the implicit base. Its Ekind is a subtype, even in the
5336 -- absence of an explicit constraint.
5338 Set_Etype (Derived_Type, Implicit_Base);
5340 -- If we did not have a constraint, then the Ekind is set from the
5341 -- parent type (otherwise Process_Subtype has set the bounds)
5343 if No_Constraint then
5344 Set_Ekind (Derived_Type, Subtype_Kind (Ekind (Parent_Type)));
5347 -- If we did not have a range constraint, then set the range from the
5348 -- parent type. Otherwise, the call to Process_Subtype has set the
5352 or else not Has_Range_Constraint (Indic)
5354 Set_Scalar_Range (Derived_Type,
5356 Low_Bound => New_Copy_Tree (Type_Low_Bound (Parent_Type)),
5357 High_Bound => New_Copy_Tree (Type_High_Bound (Parent_Type))));
5358 Set_Is_Constrained (Derived_Type, Is_Constrained (Parent_Type));
5360 if Has_Infinities (Parent_Type) then
5361 Set_Includes_Infinities (Scalar_Range (Derived_Type));
5364 Set_Is_Known_Valid (Derived_Type, Is_Known_Valid (Parent_Type));
5367 Set_Is_Descendent_Of_Address (Derived_Type,
5368 Is_Descendent_Of_Address (Parent_Type));
5369 Set_Is_Descendent_Of_Address (Implicit_Base,
5370 Is_Descendent_Of_Address (Parent_Type));
5372 -- Set remaining type-specific fields, depending on numeric type
5374 if Is_Modular_Integer_Type (Parent_Type) then
5375 Set_Modulus (Implicit_Base, Modulus (Parent_Base));
5377 Set_Non_Binary_Modulus
5378 (Implicit_Base, Non_Binary_Modulus (Parent_Base));
5381 (Implicit_Base, Is_Known_Valid (Parent_Base));
5383 elsif Is_Floating_Point_Type (Parent_Type) then
5385 -- Digits of base type is always copied from the digits value of
5386 -- the parent base type, but the digits of the derived type will
5387 -- already have been set if there was a constraint present.
5389 Set_Digits_Value (Implicit_Base, Digits_Value (Parent_Base));
5390 Set_Vax_Float (Implicit_Base, Vax_Float (Parent_Base));
5392 if No_Constraint then
5393 Set_Digits_Value (Derived_Type, Digits_Value (Parent_Type));
5396 elsif Is_Fixed_Point_Type (Parent_Type) then
5398 -- Small of base type and derived type are always copied from the
5399 -- parent base type, since smalls never change. The delta of the
5400 -- base type is also copied from the parent base type. However the
5401 -- delta of the derived type will have been set already if a
5402 -- constraint was present.
5404 Set_Small_Value (Derived_Type, Small_Value (Parent_Base));
5405 Set_Small_Value (Implicit_Base, Small_Value (Parent_Base));
5406 Set_Delta_Value (Implicit_Base, Delta_Value (Parent_Base));
5408 if No_Constraint then
5409 Set_Delta_Value (Derived_Type, Delta_Value (Parent_Type));
5412 -- The scale and machine radix in the decimal case are always
5413 -- copied from the parent base type.
5415 if Is_Decimal_Fixed_Point_Type (Parent_Type) then
5416 Set_Scale_Value (Derived_Type, Scale_Value (Parent_Base));
5417 Set_Scale_Value (Implicit_Base, Scale_Value (Parent_Base));
5419 Set_Machine_Radix_10
5420 (Derived_Type, Machine_Radix_10 (Parent_Base));
5421 Set_Machine_Radix_10
5422 (Implicit_Base, Machine_Radix_10 (Parent_Base));
5424 Set_Digits_Value (Implicit_Base, Digits_Value (Parent_Base));
5426 if No_Constraint then
5427 Set_Digits_Value (Derived_Type, Digits_Value (Parent_Base));
5430 -- the analysis of the subtype_indication sets the
5431 -- digits value of the derived type.
5438 -- The type of the bounds is that of the parent type, and they
5439 -- must be converted to the derived type.
5441 Convert_Scalar_Bounds (N, Parent_Type, Derived_Type, Loc);
5443 -- The implicit_base should be frozen when the derived type is frozen,
5444 -- but note that it is used in the conversions of the bounds. For fixed
5445 -- types we delay the determination of the bounds until the proper
5446 -- freezing point. For other numeric types this is rejected by GCC, for
5447 -- reasons that are currently unclear (???), so we choose to freeze the
5448 -- implicit base now. In the case of integers and floating point types
5449 -- this is harmless because subsequent representation clauses cannot
5450 -- affect anything, but it is still baffling that we cannot use the
5451 -- same mechanism for all derived numeric types.
5453 -- There is a further complication: actually *some* representation
5454 -- clauses can affect the implicit base type. Namely, attribute
5455 -- definition clauses for stream-oriented attributes need to set the
5456 -- corresponding TSS entries on the base type, and this normally cannot
5457 -- be done after the base type is frozen, so the circuitry in
5458 -- Sem_Ch13.New_Stream_Subprogram must account for this possibility and
5459 -- not use Set_TSS in this case.
5461 if Is_Fixed_Point_Type (Parent_Type) then
5462 Conditional_Delay (Implicit_Base, Parent_Type);
5464 Freeze_Before (N, Implicit_Base);
5466 end Build_Derived_Numeric_Type;
5468 --------------------------------
5469 -- Build_Derived_Private_Type --
5470 --------------------------------
5472 procedure Build_Derived_Private_Type
5474 Parent_Type : Entity_Id;
5475 Derived_Type : Entity_Id;
5476 Is_Completion : Boolean;
5477 Derive_Subps : Boolean := True)
5479 Loc : constant Source_Ptr := Sloc (N);
5480 Der_Base : Entity_Id;
5482 Full_Decl : Node_Id := Empty;
5483 Full_Der : Entity_Id;
5485 Last_Discr : Entity_Id;
5486 Par_Scope : constant Entity_Id := Scope (Base_Type (Parent_Type));
5487 Swapped : Boolean := False;
5489 procedure Copy_And_Build;
5490 -- Copy derived type declaration, replace parent with its full view,
5491 -- and analyze new declaration.
5493 --------------------
5494 -- Copy_And_Build --
5495 --------------------
5497 procedure Copy_And_Build is
5501 if Ekind (Parent_Type) in Record_Kind
5503 (Ekind (Parent_Type) in Enumeration_Kind
5504 and then not Is_Standard_Character_Type (Parent_Type)
5505 and then not Is_Generic_Type (Root_Type (Parent_Type)))
5507 Full_N := New_Copy_Tree (N);
5508 Insert_After (N, Full_N);
5509 Build_Derived_Type (
5510 Full_N, Parent_Type, Full_Der, True, Derive_Subps => False);
5513 Build_Derived_Type (
5514 N, Parent_Type, Full_Der, True, Derive_Subps => False);
5518 -- Start of processing for Build_Derived_Private_Type
5521 if Is_Tagged_Type (Parent_Type) then
5522 Full_P := Full_View (Parent_Type);
5524 -- A type extension of a type with unknown discriminants is an
5525 -- indefinite type that the back-end cannot handle directly.
5526 -- We treat it as a private type, and build a completion that is
5527 -- derived from the full view of the parent, and hopefully has
5528 -- known discriminants.
5530 -- If the full view of the parent type has an underlying record view,
5531 -- use it to generate the underlying record view of this derived type
5532 -- (required for chains of derivations with unknown discriminants).
5534 -- Minor optimization: we avoid the generation of useless underlying
5535 -- record view entities if the private type declaration has unknown
5536 -- discriminants but its corresponding full view has no
5539 if Has_Unknown_Discriminants (Parent_Type)
5540 and then Present (Full_P)
5541 and then (Has_Discriminants (Full_P)
5542 or else Present (Underlying_Record_View (Full_P)))
5543 and then not In_Open_Scopes (Par_Scope)
5544 and then Expander_Active
5547 Full_Der : constant Entity_Id :=
5548 Make_Defining_Identifier (Loc,
5549 Chars => New_Internal_Name ('T'));
5550 New_Ext : constant Node_Id :=
5552 (Record_Extension_Part (Type_Definition (N)));
5556 Build_Derived_Record_Type
5557 (N, Parent_Type, Derived_Type, Derive_Subps);
5559 -- Build anonymous completion, as a derivation from the full
5560 -- view of the parent. Because it is used as a placeholder
5561 -- to convey information to the back-end, it must be declared
5562 -- after the original type so the back-end knows that it needs
5563 -- to disregard the declaration.
5566 Make_Full_Type_Declaration (Loc,
5567 Defining_Identifier => Full_Der,
5569 Make_Derived_Type_Definition (Loc,
5570 Subtype_Indication =>
5572 (Subtype_Indication (Type_Definition (N))),
5573 Record_Extension_Part => New_Ext));
5575 Set_Has_Private_Declaration (Full_Der);
5576 Set_Has_Private_Declaration (Derived_Type);
5578 -- If the parent type has an underlying record view, use it
5579 -- here to build the new underlying record view.
5581 if Present (Underlying_Record_View (Full_P)) then
5583 (Nkind (Subtype_Indication (Type_Definition (Decl)))
5585 Set_Entity (Subtype_Indication (Type_Definition (Decl)),
5586 Underlying_Record_View (Full_P));
5589 Install_Private_Declarations (Par_Scope);
5590 Install_Visible_Declarations (Par_Scope);
5591 Insert_After (N, Decl);
5593 -- Mark entity as an underlying record view before analysis,
5594 -- to avoid generating the list of its primitive operations
5595 -- (which is not really required for this entity) and thus
5596 -- prevent spurious errors associated with missing overriding
5597 -- of abstract primitives (overridden only for Derived_Type).
5599 Set_Ekind (Full_Der, E_Record_Type);
5600 Set_Is_Underlying_Record_View (Full_Der);
5604 pragma Assert (Has_Discriminants (Full_Der)
5605 and then not Has_Unknown_Discriminants (Full_Der));
5607 Uninstall_Declarations (Par_Scope);
5609 -- Freeze the underlying record view, to prevent generation of
5610 -- useless dispatching information, which is simply shared with
5611 -- the real derived type.
5613 Set_Is_Frozen (Full_Der);
5615 -- Set up links between real entity and underlying record view
5617 Set_Underlying_Record_View (Derived_Type, Base_Type (Full_Der));
5618 Set_Underlying_Record_View (Base_Type (Full_Der), Derived_Type);
5621 -- If discriminants are known, build derived record
5624 Build_Derived_Record_Type
5625 (N, Parent_Type, Derived_Type, Derive_Subps);
5630 elsif Has_Discriminants (Parent_Type) then
5631 if Present (Full_View (Parent_Type)) then
5632 if not Is_Completion then
5634 -- Copy declaration for subsequent analysis, to provide a
5635 -- completion for what is a private declaration. Indicate that
5636 -- the full type is internally generated.
5638 Full_Decl := New_Copy_Tree (N);
5639 Full_Der := New_Copy (Derived_Type);
5640 Set_Comes_From_Source (Full_Decl, False);
5641 Set_Comes_From_Source (Full_Der, False);
5643 Insert_After (N, Full_Decl);
5646 -- If this is a completion, the full view being built is itself
5647 -- private. We build a subtype of the parent with the same
5648 -- constraints as this full view, to convey to the back end the
5649 -- constrained components and the size of this subtype. If the
5650 -- parent is constrained, its full view can serve as the
5651 -- underlying full view of the derived type.
5653 if No (Discriminant_Specifications (N)) then
5654 if Nkind (Subtype_Indication (Type_Definition (N))) =
5655 N_Subtype_Indication
5657 Build_Underlying_Full_View (N, Derived_Type, Parent_Type);
5659 elsif Is_Constrained (Full_View (Parent_Type)) then
5660 Set_Underlying_Full_View
5661 (Derived_Type, Full_View (Parent_Type));
5665 -- If there are new discriminants, the parent subtype is
5666 -- constrained by them, but it is not clear how to build
5667 -- the Underlying_Full_View in this case???
5674 -- Build partial view of derived type from partial view of parent
5676 Build_Derived_Record_Type
5677 (N, Parent_Type, Derived_Type, Derive_Subps);
5679 if Present (Full_View (Parent_Type)) and then not Is_Completion then
5680 if not In_Open_Scopes (Par_Scope)
5681 or else not In_Same_Source_Unit (N, Parent_Type)
5683 -- Swap partial and full views temporarily
5685 Install_Private_Declarations (Par_Scope);
5686 Install_Visible_Declarations (Par_Scope);
5690 -- Build full view of derived type from full view of parent which
5691 -- is now installed. Subprograms have been derived on the partial
5692 -- view, the completion does not derive them anew.
5694 if not Is_Tagged_Type (Parent_Type) then
5696 -- If the parent is itself derived from another private type,
5697 -- installing the private declarations has not affected its
5698 -- privacy status, so use its own full view explicitly.
5700 if Is_Private_Type (Parent_Type) then
5701 Build_Derived_Record_Type
5702 (Full_Decl, Full_View (Parent_Type), Full_Der, False);
5704 Build_Derived_Record_Type
5705 (Full_Decl, Parent_Type, Full_Der, False);
5709 -- If full view of parent is tagged, the completion inherits
5710 -- the proper primitive operations.
5712 Set_Defining_Identifier (Full_Decl, Full_Der);
5713 Build_Derived_Record_Type
5714 (Full_Decl, Parent_Type, Full_Der, Derive_Subps);
5715 Set_Analyzed (Full_Decl);
5719 Uninstall_Declarations (Par_Scope);
5721 if In_Open_Scopes (Par_Scope) then
5722 Install_Visible_Declarations (Par_Scope);
5726 Der_Base := Base_Type (Derived_Type);
5727 Set_Full_View (Derived_Type, Full_Der);
5728 Set_Full_View (Der_Base, Base_Type (Full_Der));
5730 -- Copy the discriminant list from full view to the partial views
5731 -- (base type and its subtype). Gigi requires that the partial and
5732 -- full views have the same discriminants.
5734 -- Note that since the partial view is pointing to discriminants
5735 -- in the full view, their scope will be that of the full view.
5736 -- This might cause some front end problems and need adjustment???
5738 Discr := First_Discriminant (Base_Type (Full_Der));
5739 Set_First_Entity (Der_Base, Discr);
5742 Last_Discr := Discr;
5743 Next_Discriminant (Discr);
5744 exit when No (Discr);
5747 Set_Last_Entity (Der_Base, Last_Discr);
5749 Set_First_Entity (Derived_Type, First_Entity (Der_Base));
5750 Set_Last_Entity (Derived_Type, Last_Entity (Der_Base));
5751 Set_Stored_Constraint (Full_Der, Stored_Constraint (Derived_Type));
5754 -- If this is a completion, the derived type stays private and
5755 -- there is no need to create a further full view, except in the
5756 -- unusual case when the derivation is nested within a child unit,
5762 elsif Present (Full_View (Parent_Type))
5763 and then Has_Discriminants (Full_View (Parent_Type))
5765 if Has_Unknown_Discriminants (Parent_Type)
5766 and then Nkind (Subtype_Indication (Type_Definition (N))) =
5767 N_Subtype_Indication
5770 ("cannot constrain type with unknown discriminants",
5771 Subtype_Indication (Type_Definition (N)));
5775 -- If full view of parent is a record type, build full view as a
5776 -- derivation from the parent's full view. Partial view remains
5777 -- private. For code generation and linking, the full view must have
5778 -- the same public status as the partial one. This full view is only
5779 -- needed if the parent type is in an enclosing scope, so that the
5780 -- full view may actually become visible, e.g. in a child unit. This
5781 -- is both more efficient, and avoids order of freezing problems with
5782 -- the added entities.
5784 if not Is_Private_Type (Full_View (Parent_Type))
5785 and then (In_Open_Scopes (Scope (Parent_Type)))
5787 Full_Der := Make_Defining_Identifier (Sloc (Derived_Type),
5788 Chars (Derived_Type));
5789 Set_Is_Itype (Full_Der);
5790 Set_Has_Private_Declaration (Full_Der);
5791 Set_Has_Private_Declaration (Derived_Type);
5792 Set_Associated_Node_For_Itype (Full_Der, N);
5793 Set_Parent (Full_Der, Parent (Derived_Type));
5794 Set_Full_View (Derived_Type, Full_Der);
5795 Set_Is_Public (Full_Der, Is_Public (Derived_Type));
5796 Full_P := Full_View (Parent_Type);
5797 Exchange_Declarations (Parent_Type);
5799 Exchange_Declarations (Full_P);
5802 Build_Derived_Record_Type
5803 (N, Full_View (Parent_Type), Derived_Type,
5804 Derive_Subps => False);
5807 -- In any case, the primitive operations are inherited from the
5808 -- parent type, not from the internal full view.
5810 Set_Etype (Base_Type (Derived_Type), Base_Type (Parent_Type));
5812 if Derive_Subps then
5813 Derive_Subprograms (Parent_Type, Derived_Type);
5817 -- Untagged type, No discriminants on either view
5819 if Nkind (Subtype_Indication (Type_Definition (N))) =
5820 N_Subtype_Indication
5823 ("illegal constraint on type without discriminants", N);
5826 if Present (Discriminant_Specifications (N))
5827 and then Present (Full_View (Parent_Type))
5828 and then not Is_Tagged_Type (Full_View (Parent_Type))
5830 Error_Msg_N ("cannot add discriminants to untagged type", N);
5833 Set_Stored_Constraint (Derived_Type, No_Elist);
5834 Set_Is_Constrained (Derived_Type, Is_Constrained (Parent_Type));
5835 Set_Is_Controlled (Derived_Type, Is_Controlled (Parent_Type));
5836 Set_Has_Controlled_Component
5837 (Derived_Type, Has_Controlled_Component
5840 -- Direct controlled types do not inherit Finalize_Storage_Only flag
5842 if not Is_Controlled (Parent_Type) then
5843 Set_Finalize_Storage_Only
5844 (Base_Type (Derived_Type), Finalize_Storage_Only (Parent_Type));
5847 -- Construct the implicit full view by deriving from full view of the
5848 -- parent type. In order to get proper visibility, we install the
5849 -- parent scope and its declarations.
5851 -- ??? If the parent is untagged private and its completion is
5852 -- tagged, this mechanism will not work because we cannot derive from
5853 -- the tagged full view unless we have an extension.
5855 if Present (Full_View (Parent_Type))
5856 and then not Is_Tagged_Type (Full_View (Parent_Type))
5857 and then not Is_Completion
5860 Make_Defining_Identifier (Sloc (Derived_Type),
5861 Chars => Chars (Derived_Type));
5862 Set_Is_Itype (Full_Der);
5863 Set_Has_Private_Declaration (Full_Der);
5864 Set_Has_Private_Declaration (Derived_Type);
5865 Set_Associated_Node_For_Itype (Full_Der, N);
5866 Set_Parent (Full_Der, Parent (Derived_Type));
5867 Set_Full_View (Derived_Type, Full_Der);
5869 if not In_Open_Scopes (Par_Scope) then
5870 Install_Private_Declarations (Par_Scope);
5871 Install_Visible_Declarations (Par_Scope);
5873 Uninstall_Declarations (Par_Scope);
5875 -- If parent scope is open and in another unit, and parent has a
5876 -- completion, then the derivation is taking place in the visible
5877 -- part of a child unit. In that case retrieve the full view of
5878 -- the parent momentarily.
5880 elsif not In_Same_Source_Unit (N, Parent_Type) then
5881 Full_P := Full_View (Parent_Type);
5882 Exchange_Declarations (Parent_Type);
5884 Exchange_Declarations (Full_P);
5886 -- Otherwise it is a local derivation
5892 Set_Scope (Full_Der, Current_Scope);
5893 Set_Is_First_Subtype (Full_Der,
5894 Is_First_Subtype (Derived_Type));
5895 Set_Has_Size_Clause (Full_Der, False);
5896 Set_Has_Alignment_Clause (Full_Der, False);
5897 Set_Next_Entity (Full_Der, Empty);
5898 Set_Has_Delayed_Freeze (Full_Der);
5899 Set_Is_Frozen (Full_Der, False);
5900 Set_Freeze_Node (Full_Der, Empty);
5901 Set_Depends_On_Private (Full_Der,
5902 Has_Private_Component (Full_Der));
5903 Set_Public_Status (Full_Der);
5907 Set_Has_Unknown_Discriminants (Derived_Type,
5908 Has_Unknown_Discriminants (Parent_Type));
5910 if Is_Private_Type (Derived_Type) then
5911 Set_Private_Dependents (Derived_Type, New_Elmt_List);
5914 if Is_Private_Type (Parent_Type)
5915 and then Base_Type (Parent_Type) = Parent_Type
5916 and then In_Open_Scopes (Scope (Parent_Type))
5918 Append_Elmt (Derived_Type, Private_Dependents (Parent_Type));
5920 if Is_Child_Unit (Scope (Current_Scope))
5921 and then Is_Completion
5922 and then In_Private_Part (Current_Scope)
5923 and then Scope (Parent_Type) /= Current_Scope
5925 -- This is the unusual case where a type completed by a private
5926 -- derivation occurs within a package nested in a child unit, and
5927 -- the parent is declared in an ancestor. In this case, the full
5928 -- view of the parent type will become visible in the body of the
5929 -- enclosing child, and only then will the current type be
5930 -- possibly non-private. We build a underlying full view that
5931 -- will be installed when the enclosing child body is compiled.
5934 Make_Defining_Identifier (Sloc (Derived_Type),
5935 Chars => Chars (Derived_Type));
5936 Set_Is_Itype (Full_Der);
5937 Build_Itype_Reference (Full_Der, N);
5939 -- The full view will be used to swap entities on entry/exit to
5940 -- the body, and must appear in the entity list for the package.
5942 Append_Entity (Full_Der, Scope (Derived_Type));
5943 Set_Has_Private_Declaration (Full_Der);
5944 Set_Has_Private_Declaration (Derived_Type);
5945 Set_Associated_Node_For_Itype (Full_Der, N);
5946 Set_Parent (Full_Der, Parent (Derived_Type));
5947 Full_P := Full_View (Parent_Type);
5948 Exchange_Declarations (Parent_Type);
5950 Exchange_Declarations (Full_P);
5951 Set_Underlying_Full_View (Derived_Type, Full_Der);
5954 end Build_Derived_Private_Type;
5956 -------------------------------
5957 -- Build_Derived_Record_Type --
5958 -------------------------------
5962 -- Ideally we would like to use the same model of type derivation for
5963 -- tagged and untagged record types. Unfortunately this is not quite
5964 -- possible because the semantics of representation clauses is different
5965 -- for tagged and untagged records under inheritance. Consider the
5968 -- type R (...) is [tagged] record ... end record;
5969 -- type T (...) is new R (...) [with ...];
5971 -- The representation clauses for T can specify a completely different
5972 -- record layout from R's. Hence the same component can be placed in two
5973 -- very different positions in objects of type T and R. If R and T are
5974 -- tagged types, representation clauses for T can only specify the layout
5975 -- of non inherited components, thus components that are common in R and T
5976 -- have the same position in objects of type R and T.
5978 -- This has two implications. The first is that the entire tree for R's
5979 -- declaration needs to be copied for T in the untagged case, so that T
5980 -- can be viewed as a record type of its own with its own representation
5981 -- clauses. The second implication is the way we handle discriminants.
5982 -- Specifically, in the untagged case we need a way to communicate to Gigi
5983 -- what are the real discriminants in the record, while for the semantics
5984 -- we need to consider those introduced by the user to rename the
5985 -- discriminants in the parent type. This is handled by introducing the
5986 -- notion of stored discriminants. See below for more.
5988 -- Fortunately the way regular components are inherited can be handled in
5989 -- the same way in tagged and untagged types.
5991 -- To complicate things a bit more the private view of a private extension
5992 -- cannot be handled in the same way as the full view (for one thing the
5993 -- semantic rules are somewhat different). We will explain what differs
5996 -- 2. DISCRIMINANTS UNDER INHERITANCE
5998 -- The semantic rules governing the discriminants of derived types are
6001 -- type Derived_Type_Name [KNOWN_DISCRIMINANT_PART] is new
6002 -- [abstract] Parent_Type_Name [CONSTRAINT] [RECORD_EXTENSION_PART]
6004 -- If parent type has discriminants, then the discriminants that are
6005 -- declared in the derived type are [3.4 (11)]:
6007 -- o The discriminants specified by a new KNOWN_DISCRIMINANT_PART, if
6010 -- o Otherwise, each discriminant of the parent type (implicitly declared
6011 -- in the same order with the same specifications). In this case, the
6012 -- discriminants are said to be "inherited", or if unknown in the parent
6013 -- are also unknown in the derived type.
6015 -- Furthermore if a KNOWN_DISCRIMINANT_PART is provided, then [3.7(13-18)]:
6017 -- o The parent subtype shall be constrained;
6019 -- o If the parent type is not a tagged type, then each discriminant of
6020 -- the derived type shall be used in the constraint defining a parent
6021 -- subtype. [Implementation note: This ensures that the new discriminant
6022 -- can share storage with an existing discriminant.]
6024 -- For the derived type each discriminant of the parent type is either
6025 -- inherited, constrained to equal some new discriminant of the derived
6026 -- type, or constrained to the value of an expression.
6028 -- When inherited or constrained to equal some new discriminant, the
6029 -- parent discriminant and the discriminant of the derived type are said
6032 -- If a discriminant of the parent type is constrained to a specific value
6033 -- in the derived type definition, then the discriminant is said to be
6034 -- "specified" by that derived type definition.
6036 -- 3. DISCRIMINANTS IN DERIVED UNTAGGED RECORD TYPES
6038 -- We have spoken about stored discriminants in point 1 (introduction)
6039 -- above. There are two sort of stored discriminants: implicit and
6040 -- explicit. As long as the derived type inherits the same discriminants as
6041 -- the root record type, stored discriminants are the same as regular
6042 -- discriminants, and are said to be implicit. However, if any discriminant
6043 -- in the root type was renamed in the derived type, then the derived
6044 -- type will contain explicit stored discriminants. Explicit stored
6045 -- discriminants are discriminants in addition to the semantically visible
6046 -- discriminants defined for the derived type. Stored discriminants are
6047 -- used by Gigi to figure out what are the physical discriminants in
6048 -- objects of the derived type (see precise definition in einfo.ads).
6049 -- As an example, consider the following:
6051 -- type R (D1, D2, D3 : Int) is record ... end record;
6052 -- type T1 is new R;
6053 -- type T2 (X1, X2: Int) is new T1 (X2, 88, X1);
6054 -- type T3 is new T2;
6055 -- type T4 (Y : Int) is new T3 (Y, 99);
6057 -- The following table summarizes the discriminants and stored
6058 -- discriminants in R and T1 through T4.
6060 -- Type Discrim Stored Discrim Comment
6061 -- R (D1, D2, D3) (D1, D2, D3) Girder discrims implicit in R
6062 -- T1 (D1, D2, D3) (D1, D2, D3) Girder discrims implicit in T1
6063 -- T2 (X1, X2) (D1, D2, D3) Girder discrims EXPLICIT in T2
6064 -- T3 (X1, X2) (D1, D2, D3) Girder discrims EXPLICIT in T3
6065 -- T4 (Y) (D1, D2, D3) Girder discrims EXPLICIT in T4
6067 -- Field Corresponding_Discriminant (abbreviated CD below) allows us to
6068 -- find the corresponding discriminant in the parent type, while
6069 -- Original_Record_Component (abbreviated ORC below), the actual physical
6070 -- component that is renamed. Finally the field Is_Completely_Hidden
6071 -- (abbreviated ICH below) is set for all explicit stored discriminants
6072 -- (see einfo.ads for more info). For the above example this gives:
6074 -- Discrim CD ORC ICH
6075 -- ^^^^^^^ ^^ ^^^ ^^^
6076 -- D1 in R empty itself no
6077 -- D2 in R empty itself no
6078 -- D3 in R empty itself no
6080 -- D1 in T1 D1 in R itself no
6081 -- D2 in T1 D2 in R itself no
6082 -- D3 in T1 D3 in R itself no
6084 -- X1 in T2 D3 in T1 D3 in T2 no
6085 -- X2 in T2 D1 in T1 D1 in T2 no
6086 -- D1 in T2 empty itself yes
6087 -- D2 in T2 empty itself yes
6088 -- D3 in T2 empty itself yes
6090 -- X1 in T3 X1 in T2 D3 in T3 no
6091 -- X2 in T3 X2 in T2 D1 in T3 no
6092 -- D1 in T3 empty itself yes
6093 -- D2 in T3 empty itself yes
6094 -- D3 in T3 empty itself yes
6096 -- Y in T4 X1 in T3 D3 in T3 no
6097 -- D1 in T3 empty itself yes
6098 -- D2 in T3 empty itself yes
6099 -- D3 in T3 empty itself yes
6101 -- 4. DISCRIMINANTS IN DERIVED TAGGED RECORD TYPES
6103 -- Type derivation for tagged types is fairly straightforward. If no
6104 -- discriminants are specified by the derived type, these are inherited
6105 -- from the parent. No explicit stored discriminants are ever necessary.
6106 -- The only manipulation that is done to the tree is that of adding a
6107 -- _parent field with parent type and constrained to the same constraint
6108 -- specified for the parent in the derived type definition. For instance:
6110 -- type R (D1, D2, D3 : Int) is tagged record ... end record;
6111 -- type T1 is new R with null record;
6112 -- type T2 (X1, X2: Int) is new T1 (X2, 88, X1) with null record;
6114 -- are changed into:
6116 -- type T1 (D1, D2, D3 : Int) is new R (D1, D2, D3) with record
6117 -- _parent : R (D1, D2, D3);
6120 -- type T2 (X1, X2: Int) is new T1 (X2, 88, X1) with record
6121 -- _parent : T1 (X2, 88, X1);
6124 -- The discriminants actually present in R, T1 and T2 as well as their CD,
6125 -- ORC and ICH fields are:
6127 -- Discrim CD ORC ICH
6128 -- ^^^^^^^ ^^ ^^^ ^^^
6129 -- D1 in R empty itself no
6130 -- D2 in R empty itself no
6131 -- D3 in R empty itself no
6133 -- D1 in T1 D1 in R D1 in R no
6134 -- D2 in T1 D2 in R D2 in R no
6135 -- D3 in T1 D3 in R D3 in R no
6137 -- X1 in T2 D3 in T1 D3 in R no
6138 -- X2 in T2 D1 in T1 D1 in R no
6140 -- 5. FIRST TRANSFORMATION FOR DERIVED RECORDS
6142 -- Regardless of whether we dealing with a tagged or untagged type
6143 -- we will transform all derived type declarations of the form
6145 -- type T is new R (...) [with ...];
6147 -- subtype S is R (...);
6148 -- type T is new S [with ...];
6150 -- type BT is new R [with ...];
6151 -- subtype T is BT (...);
6153 -- That is, the base derived type is constrained only if it has no
6154 -- discriminants. The reason for doing this is that GNAT's semantic model
6155 -- assumes that a base type with discriminants is unconstrained.
6157 -- Note that, strictly speaking, the above transformation is not always
6158 -- correct. Consider for instance the following excerpt from ACVC b34011a:
6160 -- procedure B34011A is
6161 -- type REC (D : integer := 0) is record
6166 -- type T6 is new Rec;
6167 -- function F return T6;
6172 -- type U is new T6 (Q6.F.I); -- ERROR: Q6.F.
6175 -- The definition of Q6.U is illegal. However transforming Q6.U into
6177 -- type BaseU is new T6;
6178 -- subtype U is BaseU (Q6.F.I)
6180 -- turns U into a legal subtype, which is incorrect. To avoid this problem
6181 -- we always analyze the constraint (in this case (Q6.F.I)) before applying
6182 -- the transformation described above.
6184 -- There is another instance where the above transformation is incorrect.
6188 -- type Base (D : Integer) is tagged null record;
6189 -- procedure P (X : Base);
6191 -- type Der is new Base (2) with null record;
6192 -- procedure P (X : Der);
6195 -- Then the above transformation turns this into
6197 -- type Der_Base is new Base with null record;
6198 -- -- procedure P (X : Base) is implicitly inherited here
6199 -- -- as procedure P (X : Der_Base).
6201 -- subtype Der is Der_Base (2);
6202 -- procedure P (X : Der);
6203 -- -- The overriding of P (X : Der_Base) is illegal since we
6204 -- -- have a parameter conformance problem.
6206 -- To get around this problem, after having semantically processed Der_Base
6207 -- and the rewritten subtype declaration for Der, we copy Der_Base field
6208 -- Discriminant_Constraint from Der so that when parameter conformance is
6209 -- checked when P is overridden, no semantic errors are flagged.
6211 -- 6. SECOND TRANSFORMATION FOR DERIVED RECORDS
6213 -- Regardless of whether we are dealing with a tagged or untagged type
6214 -- we will transform all derived type declarations of the form
6216 -- type R (D1, .., Dn : ...) is [tagged] record ...;
6217 -- type T is new R [with ...];
6219 -- type T (D1, .., Dn : ...) is new R (D1, .., Dn) [with ...];
6221 -- The reason for such transformation is that it allows us to implement a
6222 -- very clean form of component inheritance as explained below.
6224 -- Note that this transformation is not achieved by direct tree rewriting
6225 -- and manipulation, but rather by redoing the semantic actions that the
6226 -- above transformation will entail. This is done directly in routine
6227 -- Inherit_Components.
6229 -- 7. TYPE DERIVATION AND COMPONENT INHERITANCE
6231 -- In both tagged and untagged derived types, regular non discriminant
6232 -- components are inherited in the derived type from the parent type. In
6233 -- the absence of discriminants component, inheritance is straightforward
6234 -- as components can simply be copied from the parent.
6236 -- If the parent has discriminants, inheriting components constrained with
6237 -- these discriminants requires caution. Consider the following example:
6239 -- type R (D1, D2 : Positive) is [tagged] record
6240 -- S : String (D1 .. D2);
6243 -- type T1 is new R [with null record];
6244 -- type T2 (X : positive) is new R (1, X) [with null record];
6246 -- As explained in 6. above, T1 is rewritten as
6247 -- type T1 (D1, D2 : Positive) is new R (D1, D2) [with null record];
6248 -- which makes the treatment for T1 and T2 identical.
6250 -- What we want when inheriting S, is that references to D1 and D2 in R are
6251 -- replaced with references to their correct constraints, i.e. D1 and D2 in
6252 -- T1 and 1 and X in T2. So all R's discriminant references are replaced
6253 -- with either discriminant references in the derived type or expressions.
6254 -- This replacement is achieved as follows: before inheriting R's
6255 -- components, a subtype R (D1, D2) for T1 (resp. R (1, X) for T2) is
6256 -- created in the scope of T1 (resp. scope of T2) so that discriminants D1
6257 -- and D2 of T1 are visible (resp. discriminant X of T2 is visible).
6258 -- For T2, for instance, this has the effect of replacing String (D1 .. D2)
6259 -- by String (1 .. X).
6261 -- 8. TYPE DERIVATION IN PRIVATE TYPE EXTENSIONS
6263 -- We explain here the rules governing private type extensions relevant to
6264 -- type derivation. These rules are explained on the following example:
6266 -- type D [(...)] is new A [(...)] with private; <-- partial view
6267 -- type D [(...)] is new P [(...)] with null record; <-- full view
6269 -- Type A is called the ancestor subtype of the private extension.
6270 -- Type P is the parent type of the full view of the private extension. It
6271 -- must be A or a type derived from A.
6273 -- The rules concerning the discriminants of private type extensions are
6276 -- o If a private extension inherits known discriminants from the ancestor
6277 -- subtype, then the full view shall also inherit its discriminants from
6278 -- the ancestor subtype and the parent subtype of the full view shall be
6279 -- constrained if and only if the ancestor subtype is constrained.
6281 -- o If a partial view has unknown discriminants, then the full view may
6282 -- define a definite or an indefinite subtype, with or without
6285 -- o If a partial view has neither known nor unknown discriminants, then
6286 -- the full view shall define a definite subtype.
6288 -- o If the ancestor subtype of a private extension has constrained
6289 -- discriminants, then the parent subtype of the full view shall impose a
6290 -- statically matching constraint on those discriminants.
6292 -- This means that only the following forms of private extensions are
6295 -- type D is new A with private; <-- partial view
6296 -- type D is new P with null record; <-- full view
6298 -- If A has no discriminants than P has no discriminants, otherwise P must
6299 -- inherit A's discriminants.
6301 -- type D is new A (...) with private; <-- partial view
6302 -- type D is new P (:::) with null record; <-- full view
6304 -- P must inherit A's discriminants and (...) and (:::) must statically
6307 -- subtype A is R (...);
6308 -- type D is new A with private; <-- partial view
6309 -- type D is new P with null record; <-- full view
6311 -- P must have inherited R's discriminants and must be derived from A or
6312 -- any of its subtypes.
6314 -- type D (..) is new A with private; <-- partial view
6315 -- type D (..) is new P [(:::)] with null record; <-- full view
6317 -- No specific constraints on P's discriminants or constraint (:::).
6318 -- Note that A can be unconstrained, but the parent subtype P must either
6319 -- be constrained or (:::) must be present.
6321 -- type D (..) is new A [(...)] with private; <-- partial view
6322 -- type D (..) is new P [(:::)] with null record; <-- full view
6324 -- P's constraints on A's discriminants must statically match those
6325 -- imposed by (...).
6327 -- 9. IMPLEMENTATION OF TYPE DERIVATION FOR PRIVATE EXTENSIONS
6329 -- The full view of a private extension is handled exactly as described
6330 -- above. The model chose for the private view of a private extension is
6331 -- the same for what concerns discriminants (i.e. they receive the same
6332 -- treatment as in the tagged case). However, the private view of the
6333 -- private extension always inherits the components of the parent base,
6334 -- without replacing any discriminant reference. Strictly speaking this is
6335 -- incorrect. However, Gigi never uses this view to generate code so this
6336 -- is a purely semantic issue. In theory, a set of transformations similar
6337 -- to those given in 5. and 6. above could be applied to private views of
6338 -- private extensions to have the same model of component inheritance as
6339 -- for non private extensions. However, this is not done because it would
6340 -- further complicate private type processing. Semantically speaking, this
6341 -- leaves us in an uncomfortable situation. As an example consider:
6344 -- type R (D : integer) is tagged record
6345 -- S : String (1 .. D);
6347 -- procedure P (X : R);
6348 -- type T is new R (1) with private;
6350 -- type T is new R (1) with null record;
6353 -- This is transformed into:
6356 -- type R (D : integer) is tagged record
6357 -- S : String (1 .. D);
6359 -- procedure P (X : R);
6360 -- type T is new R (1) with private;
6362 -- type BaseT is new R with null record;
6363 -- subtype T is BaseT (1);
6366 -- (strictly speaking the above is incorrect Ada)
6368 -- From the semantic standpoint the private view of private extension T
6369 -- should be flagged as constrained since one can clearly have
6373 -- in a unit withing Pack. However, when deriving subprograms for the
6374 -- private view of private extension T, T must be seen as unconstrained
6375 -- since T has discriminants (this is a constraint of the current
6376 -- subprogram derivation model). Thus, when processing the private view of
6377 -- a private extension such as T, we first mark T as unconstrained, we
6378 -- process it, we perform program derivation and just before returning from
6379 -- Build_Derived_Record_Type we mark T as constrained.
6381 -- ??? Are there are other uncomfortable cases that we will have to
6384 -- 10. RECORD_TYPE_WITH_PRIVATE complications
6386 -- Types that are derived from a visible record type and have a private
6387 -- extension present other peculiarities. They behave mostly like private
6388 -- types, but if they have primitive operations defined, these will not
6389 -- have the proper signatures for further inheritance, because other
6390 -- primitive operations will use the implicit base that we define for
6391 -- private derivations below. This affect subprogram inheritance (see
6392 -- Derive_Subprograms for details). We also derive the implicit base from
6393 -- the base type of the full view, so that the implicit base is a record
6394 -- type and not another private type, This avoids infinite loops.
6396 procedure Build_Derived_Record_Type
6398 Parent_Type : Entity_Id;
6399 Derived_Type : Entity_Id;
6400 Derive_Subps : Boolean := True)
6402 Loc : constant Source_Ptr := Sloc (N);
6403 Parent_Base : Entity_Id;
6406 Discrim : Entity_Id;
6407 Last_Discrim : Entity_Id;
6410 Discs : Elist_Id := New_Elmt_List;
6411 -- An empty Discs list means that there were no constraints in the
6412 -- subtype indication or that there was an error processing it.
6414 Assoc_List : Elist_Id;
6415 New_Discrs : Elist_Id;
6416 New_Base : Entity_Id;
6418 New_Indic : Node_Id;
6420 Is_Tagged : constant Boolean := Is_Tagged_Type (Parent_Type);
6421 Discriminant_Specs : constant Boolean :=
6422 Present (Discriminant_Specifications (N));
6423 Private_Extension : constant Boolean :=
6424 Nkind (N) = N_Private_Extension_Declaration;
6426 Constraint_Present : Boolean;
6427 Inherit_Discrims : Boolean := False;
6428 Save_Etype : Entity_Id;
6429 Save_Discr_Constr : Elist_Id;
6430 Save_Next_Entity : Entity_Id;
6433 if Ekind (Parent_Type) = E_Record_Type_With_Private
6434 and then Present (Full_View (Parent_Type))
6435 and then Has_Discriminants (Parent_Type)
6437 Parent_Base := Base_Type (Full_View (Parent_Type));
6439 Parent_Base := Base_Type (Parent_Type);
6442 -- Before we start the previously documented transformations, here is
6443 -- little fix for size and alignment of tagged types. Normally when we
6444 -- derive type D from type P, we copy the size and alignment of P as the
6445 -- default for D, and in the absence of explicit representation clauses
6446 -- for D, the size and alignment are indeed the same as the parent.
6448 -- But this is wrong for tagged types, since fields may be added, and
6449 -- the default size may need to be larger, and the default alignment may
6450 -- need to be larger.
6452 -- We therefore reset the size and alignment fields in the tagged case.
6453 -- Note that the size and alignment will in any case be at least as
6454 -- large as the parent type (since the derived type has a copy of the
6455 -- parent type in the _parent field)
6457 -- The type is also marked as being tagged here, which is needed when
6458 -- processing components with a self-referential anonymous access type
6459 -- in the call to Check_Anonymous_Access_Components below. Note that
6460 -- this flag is also set later on for completeness.
6463 Set_Is_Tagged_Type (Derived_Type);
6464 Init_Size_Align (Derived_Type);
6467 -- STEP 0a: figure out what kind of derived type declaration we have
6469 if Private_Extension then
6471 Set_Ekind (Derived_Type, E_Record_Type_With_Private);
6474 Type_Def := Type_Definition (N);
6476 -- Ekind (Parent_Base) is not necessarily E_Record_Type since
6477 -- Parent_Base can be a private type or private extension. However,
6478 -- for tagged types with an extension the newly added fields are
6479 -- visible and hence the Derived_Type is always an E_Record_Type.
6480 -- (except that the parent may have its own private fields).
6481 -- For untagged types we preserve the Ekind of the Parent_Base.
6483 if Present (Record_Extension_Part (Type_Def)) then
6484 Set_Ekind (Derived_Type, E_Record_Type);
6486 -- Create internal access types for components with anonymous
6489 if Ada_Version >= Ada_05 then
6490 Check_Anonymous_Access_Components
6491 (N, Derived_Type, Derived_Type,
6492 Component_List (Record_Extension_Part (Type_Def)));
6496 Set_Ekind (Derived_Type, Ekind (Parent_Base));
6500 -- Indic can either be an N_Identifier if the subtype indication
6501 -- contains no constraint or an N_Subtype_Indication if the subtype
6502 -- indication has a constraint.
6504 Indic := Subtype_Indication (Type_Def);
6505 Constraint_Present := (Nkind (Indic) = N_Subtype_Indication);
6507 -- Check that the type has visible discriminants. The type may be
6508 -- a private type with unknown discriminants whose full view has
6509 -- discriminants which are invisible.
6511 if Constraint_Present then
6512 if not Has_Discriminants (Parent_Base)
6514 (Has_Unknown_Discriminants (Parent_Base)
6515 and then Is_Private_Type (Parent_Base))
6518 ("invalid constraint: type has no discriminant",
6519 Constraint (Indic));
6521 Constraint_Present := False;
6522 Rewrite (Indic, New_Copy_Tree (Subtype_Mark (Indic)));
6524 elsif Is_Constrained (Parent_Type) then
6526 ("invalid constraint: parent type is already constrained",
6527 Constraint (Indic));
6529 Constraint_Present := False;
6530 Rewrite (Indic, New_Copy_Tree (Subtype_Mark (Indic)));
6534 -- STEP 0b: If needed, apply transformation given in point 5. above
6536 if not Private_Extension
6537 and then Has_Discriminants (Parent_Type)
6538 and then not Discriminant_Specs
6539 and then (Is_Constrained (Parent_Type) or else Constraint_Present)
6541 -- First, we must analyze the constraint (see comment in point 5.)
6543 if Constraint_Present then
6544 New_Discrs := Build_Discriminant_Constraints (Parent_Type, Indic);
6546 if Has_Discriminants (Derived_Type)
6547 and then Has_Private_Declaration (Derived_Type)
6548 and then Present (Discriminant_Constraint (Derived_Type))
6550 -- Verify that constraints of the full view statically match
6551 -- those given in the partial view.
6557 C1 := First_Elmt (New_Discrs);
6558 C2 := First_Elmt (Discriminant_Constraint (Derived_Type));
6559 while Present (C1) and then Present (C2) loop
6560 if Fully_Conformant_Expressions (Node (C1), Node (C2))
6562 (Is_OK_Static_Expression (Node (C1))
6564 Is_OK_Static_Expression (Node (C2))
6566 Expr_Value (Node (C1)) = Expr_Value (Node (C2)))
6572 "constraint not conformant to previous declaration",
6583 -- Insert and analyze the declaration for the unconstrained base type
6585 New_Base := Create_Itype (Ekind (Derived_Type), N, Derived_Type, 'B');
6588 Make_Full_Type_Declaration (Loc,
6589 Defining_Identifier => New_Base,
6591 Make_Derived_Type_Definition (Loc,
6592 Abstract_Present => Abstract_Present (Type_Def),
6593 Limited_Present => Limited_Present (Type_Def),
6594 Subtype_Indication =>
6595 New_Occurrence_Of (Parent_Base, Loc),
6596 Record_Extension_Part =>
6597 Relocate_Node (Record_Extension_Part (Type_Def)),
6598 Interface_List => Interface_List (Type_Def)));
6600 Set_Parent (New_Decl, Parent (N));
6601 Mark_Rewrite_Insertion (New_Decl);
6602 Insert_Before (N, New_Decl);
6604 -- Note that this call passes False for the Derive_Subps parameter
6605 -- because subprogram derivation is deferred until after creating
6606 -- the subtype (see below).
6609 (New_Decl, Parent_Base, New_Base,
6610 Is_Completion => True, Derive_Subps => False);
6612 -- ??? This needs re-examination to determine whether the
6613 -- above call can simply be replaced by a call to Analyze.
6615 Set_Analyzed (New_Decl);
6617 -- Insert and analyze the declaration for the constrained subtype
6619 if Constraint_Present then
6621 Make_Subtype_Indication (Loc,
6622 Subtype_Mark => New_Occurrence_Of (New_Base, Loc),
6623 Constraint => Relocate_Node (Constraint (Indic)));
6627 Constr_List : constant List_Id := New_List;
6632 C := First_Elmt (Discriminant_Constraint (Parent_Type));
6633 while Present (C) loop
6636 -- It is safe here to call New_Copy_Tree since
6637 -- Force_Evaluation was called on each constraint in
6638 -- Build_Discriminant_Constraints.
6640 Append (New_Copy_Tree (Expr), To => Constr_List);
6646 Make_Subtype_Indication (Loc,
6647 Subtype_Mark => New_Occurrence_Of (New_Base, Loc),
6649 Make_Index_Or_Discriminant_Constraint (Loc, Constr_List));
6654 Make_Subtype_Declaration (Loc,
6655 Defining_Identifier => Derived_Type,
6656 Subtype_Indication => New_Indic));
6660 -- Derivation of subprograms must be delayed until the full subtype
6661 -- has been established to ensure proper overriding of subprograms
6662 -- inherited by full types. If the derivations occurred as part of
6663 -- the call to Build_Derived_Type above, then the check for type
6664 -- conformance would fail because earlier primitive subprograms
6665 -- could still refer to the full type prior the change to the new
6666 -- subtype and hence would not match the new base type created here.
6668 Derive_Subprograms (Parent_Type, Derived_Type);
6670 -- For tagged types the Discriminant_Constraint of the new base itype
6671 -- is inherited from the first subtype so that no subtype conformance
6672 -- problem arise when the first subtype overrides primitive
6673 -- operations inherited by the implicit base type.
6676 Set_Discriminant_Constraint
6677 (New_Base, Discriminant_Constraint (Derived_Type));
6683 -- If we get here Derived_Type will have no discriminants or it will be
6684 -- a discriminated unconstrained base type.
6686 -- STEP 1a: perform preliminary actions/checks for derived tagged types
6690 -- The parent type is frozen for non-private extensions (RM 13.14(7))
6691 -- The declaration of a specific descendant of an interface type
6692 -- freezes the interface type (RM 13.14).
6694 if not Private_Extension
6695 or else Is_Interface (Parent_Base)
6697 Freeze_Before (N, Parent_Type);
6700 -- In Ada 2005 (AI-344), the restriction that a derived tagged type
6701 -- cannot be declared at a deeper level than its parent type is
6702 -- removed. The check on derivation within a generic body is also
6703 -- relaxed, but there's a restriction that a derived tagged type
6704 -- cannot be declared in a generic body if it's derived directly
6705 -- or indirectly from a formal type of that generic.
6707 if Ada_Version >= Ada_05 then
6708 if Present (Enclosing_Generic_Body (Derived_Type)) then
6710 Ancestor_Type : Entity_Id;
6713 -- Check to see if any ancestor of the derived type is a
6716 Ancestor_Type := Parent_Type;
6717 while not Is_Generic_Type (Ancestor_Type)
6718 and then Etype (Ancestor_Type) /= Ancestor_Type
6720 Ancestor_Type := Etype (Ancestor_Type);
6723 -- If the derived type does have a formal type as an
6724 -- ancestor, then it's an error if the derived type is
6725 -- declared within the body of the generic unit that
6726 -- declares the formal type in its generic formal part. It's
6727 -- sufficient to check whether the ancestor type is declared
6728 -- inside the same generic body as the derived type (such as
6729 -- within a nested generic spec), in which case the
6730 -- derivation is legal. If the formal type is declared
6731 -- outside of that generic body, then it's guaranteed that
6732 -- the derived type is declared within the generic body of
6733 -- the generic unit declaring the formal type.
6735 if Is_Generic_Type (Ancestor_Type)
6736 and then Enclosing_Generic_Body (Ancestor_Type) /=
6737 Enclosing_Generic_Body (Derived_Type)
6740 ("parent type of& must not be descendant of formal type"
6741 & " of an enclosing generic body",
6742 Indic, Derived_Type);
6747 elsif Type_Access_Level (Derived_Type) /=
6748 Type_Access_Level (Parent_Type)
6749 and then not Is_Generic_Type (Derived_Type)
6751 if Is_Controlled (Parent_Type) then
6753 ("controlled type must be declared at the library level",
6757 ("type extension at deeper accessibility level than parent",
6763 GB : constant Node_Id := Enclosing_Generic_Body (Derived_Type);
6767 and then GB /= Enclosing_Generic_Body (Parent_Base)
6770 ("parent type of& must not be outside generic body"
6772 Indic, Derived_Type);
6778 -- Ada 2005 (AI-251)
6780 if Ada_Version = Ada_05
6783 -- "The declaration of a specific descendant of an interface type
6784 -- freezes the interface type" (RM 13.14).
6789 if Is_Non_Empty_List (Interface_List (Type_Def)) then
6790 Iface := First (Interface_List (Type_Def));
6791 while Present (Iface) loop
6792 Freeze_Before (N, Etype (Iface));
6799 -- STEP 1b : preliminary cleanup of the full view of private types
6801 -- If the type is already marked as having discriminants, then it's the
6802 -- completion of a private type or private extension and we need to
6803 -- retain the discriminants from the partial view if the current
6804 -- declaration has Discriminant_Specifications so that we can verify
6805 -- conformance. However, we must remove any existing components that
6806 -- were inherited from the parent (and attached in Copy_And_Swap)
6807 -- because the full type inherits all appropriate components anyway, and
6808 -- we do not want the partial view's components interfering.
6810 if Has_Discriminants (Derived_Type) and then Discriminant_Specs then
6811 Discrim := First_Discriminant (Derived_Type);
6813 Last_Discrim := Discrim;
6814 Next_Discriminant (Discrim);
6815 exit when No (Discrim);
6818 Set_Last_Entity (Derived_Type, Last_Discrim);
6820 -- In all other cases wipe out the list of inherited components (even
6821 -- inherited discriminants), it will be properly rebuilt here.
6824 Set_First_Entity (Derived_Type, Empty);
6825 Set_Last_Entity (Derived_Type, Empty);
6828 -- STEP 1c: Initialize some flags for the Derived_Type
6830 -- The following flags must be initialized here so that
6831 -- Process_Discriminants can check that discriminants of tagged types do
6832 -- not have a default initial value and that access discriminants are
6833 -- only specified for limited records. For completeness, these flags are
6834 -- also initialized along with all the other flags below.
6836 -- AI-419: Limitedness is not inherited from an interface parent, so to
6837 -- be limited in that case the type must be explicitly declared as
6838 -- limited. However, task and protected interfaces are always limited.
6840 if Limited_Present (Type_Def) then
6841 Set_Is_Limited_Record (Derived_Type);
6843 elsif Is_Limited_Record (Parent_Type)
6844 or else (Present (Full_View (Parent_Type))
6845 and then Is_Limited_Record (Full_View (Parent_Type)))
6847 if not Is_Interface (Parent_Type)
6848 or else Is_Synchronized_Interface (Parent_Type)
6849 or else Is_Protected_Interface (Parent_Type)
6850 or else Is_Task_Interface (Parent_Type)
6852 Set_Is_Limited_Record (Derived_Type);
6856 -- STEP 2a: process discriminants of derived type if any
6858 Push_Scope (Derived_Type);
6860 if Discriminant_Specs then
6861 Set_Has_Unknown_Discriminants (Derived_Type, False);
6863 -- The following call initializes fields Has_Discriminants and
6864 -- Discriminant_Constraint, unless we are processing the completion
6865 -- of a private type declaration.
6867 Check_Or_Process_Discriminants (N, Derived_Type);
6869 -- For non-tagged types the constraint on the Parent_Type must be
6870 -- present and is used to rename the discriminants.
6872 if not Is_Tagged and then not Has_Discriminants (Parent_Type) then
6873 Error_Msg_N ("untagged parent must have discriminants", Indic);
6875 elsif not Is_Tagged and then not Constraint_Present then
6877 ("discriminant constraint needed for derived untagged records",
6880 -- Otherwise the parent subtype must be constrained unless we have a
6881 -- private extension.
6883 elsif not Constraint_Present
6884 and then not Private_Extension
6885 and then not Is_Constrained (Parent_Type)
6888 ("unconstrained type not allowed in this context", Indic);
6890 elsif Constraint_Present then
6891 -- The following call sets the field Corresponding_Discriminant
6892 -- for the discriminants in the Derived_Type.
6894 Discs := Build_Discriminant_Constraints (Parent_Type, Indic, True);
6896 -- For untagged types all new discriminants must rename
6897 -- discriminants in the parent. For private extensions new
6898 -- discriminants cannot rename old ones (implied by [7.3(13)]).
6900 Discrim := First_Discriminant (Derived_Type);
6901 while Present (Discrim) loop
6903 and then No (Corresponding_Discriminant (Discrim))
6906 ("new discriminants must constrain old ones", Discrim);
6908 elsif Private_Extension
6909 and then Present (Corresponding_Discriminant (Discrim))
6912 ("only static constraints allowed for parent"
6913 & " discriminants in the partial view", Indic);
6917 -- If a new discriminant is used in the constraint, then its
6918 -- subtype must be statically compatible with the parent
6919 -- discriminant's subtype (3.7(15)).
6921 if Present (Corresponding_Discriminant (Discrim))
6923 not Subtypes_Statically_Compatible
6925 Etype (Corresponding_Discriminant (Discrim)))
6928 ("subtype must be compatible with parent discriminant",
6932 Next_Discriminant (Discrim);
6935 -- Check whether the constraints of the full view statically
6936 -- match those imposed by the parent subtype [7.3(13)].
6938 if Present (Stored_Constraint (Derived_Type)) then
6943 C1 := First_Elmt (Discs);
6944 C2 := First_Elmt (Stored_Constraint (Derived_Type));
6945 while Present (C1) and then Present (C2) loop
6947 Fully_Conformant_Expressions (Node (C1), Node (C2))
6950 ("not conformant with previous declaration",
6961 -- STEP 2b: No new discriminants, inherit discriminants if any
6964 if Private_Extension then
6965 Set_Has_Unknown_Discriminants
6967 Has_Unknown_Discriminants (Parent_Type)
6968 or else Unknown_Discriminants_Present (N));
6970 -- The partial view of the parent may have unknown discriminants,
6971 -- but if the full view has discriminants and the parent type is
6972 -- in scope they must be inherited.
6974 elsif Has_Unknown_Discriminants (Parent_Type)
6976 (not Has_Discriminants (Parent_Type)
6977 or else not In_Open_Scopes (Scope (Parent_Type)))
6979 Set_Has_Unknown_Discriminants (Derived_Type);
6982 if not Has_Unknown_Discriminants (Derived_Type)
6983 and then not Has_Unknown_Discriminants (Parent_Base)
6984 and then Has_Discriminants (Parent_Type)
6986 Inherit_Discrims := True;
6987 Set_Has_Discriminants
6988 (Derived_Type, True);
6989 Set_Discriminant_Constraint
6990 (Derived_Type, Discriminant_Constraint (Parent_Base));
6993 -- The following test is true for private types (remember
6994 -- transformation 5. is not applied to those) and in an error
6997 if Constraint_Present then
6998 Discs := Build_Discriminant_Constraints (Parent_Type, Indic);
7001 -- For now mark a new derived type as constrained only if it has no
7002 -- discriminants. At the end of Build_Derived_Record_Type we properly
7003 -- set this flag in the case of private extensions. See comments in
7004 -- point 9. just before body of Build_Derived_Record_Type.
7008 not (Inherit_Discrims
7009 or else Has_Unknown_Discriminants (Derived_Type)));
7012 -- STEP 3: initialize fields of derived type
7014 Set_Is_Tagged_Type (Derived_Type, Is_Tagged);
7015 Set_Stored_Constraint (Derived_Type, No_Elist);
7017 -- Ada 2005 (AI-251): Private type-declarations can implement interfaces
7018 -- but cannot be interfaces
7020 if not Private_Extension
7021 and then Ekind (Derived_Type) /= E_Private_Type
7022 and then Ekind (Derived_Type) /= E_Limited_Private_Type
7024 if Interface_Present (Type_Def) then
7025 Analyze_Interface_Declaration (Derived_Type, Type_Def);
7028 Set_Interfaces (Derived_Type, No_Elist);
7031 -- Fields inherited from the Parent_Type
7034 (Derived_Type, Einfo.Discard_Names (Parent_Type));
7035 Set_Has_Specified_Layout
7036 (Derived_Type, Has_Specified_Layout (Parent_Type));
7037 Set_Is_Limited_Composite
7038 (Derived_Type, Is_Limited_Composite (Parent_Type));
7039 Set_Is_Private_Composite
7040 (Derived_Type, Is_Private_Composite (Parent_Type));
7042 -- Fields inherited from the Parent_Base
7044 Set_Has_Controlled_Component
7045 (Derived_Type, Has_Controlled_Component (Parent_Base));
7046 Set_Has_Non_Standard_Rep
7047 (Derived_Type, Has_Non_Standard_Rep (Parent_Base));
7048 Set_Has_Primitive_Operations
7049 (Derived_Type, Has_Primitive_Operations (Parent_Base));
7051 -- Fields inherited from the Parent_Base in the non-private case
7053 if Ekind (Derived_Type) = E_Record_Type then
7054 Set_Has_Complex_Representation
7055 (Derived_Type, Has_Complex_Representation (Parent_Base));
7058 -- Fields inherited from the Parent_Base for record types
7060 if Is_Record_Type (Derived_Type) then
7061 Set_OK_To_Reorder_Components
7062 (Derived_Type, OK_To_Reorder_Components (Parent_Base));
7063 Set_Reverse_Bit_Order
7064 (Derived_Type, Reverse_Bit_Order (Parent_Base));
7067 -- Direct controlled types do not inherit Finalize_Storage_Only flag
7069 if not Is_Controlled (Parent_Type) then
7070 Set_Finalize_Storage_Only
7071 (Derived_Type, Finalize_Storage_Only (Parent_Type));
7074 -- Set fields for private derived types
7076 if Is_Private_Type (Derived_Type) then
7077 Set_Depends_On_Private (Derived_Type, True);
7078 Set_Private_Dependents (Derived_Type, New_Elmt_List);
7080 -- Inherit fields from non private record types. If this is the
7081 -- completion of a derivation from a private type, the parent itself
7082 -- is private, and the attributes come from its full view, which must
7086 if Is_Private_Type (Parent_Base)
7087 and then not Is_Record_Type (Parent_Base)
7089 Set_Component_Alignment
7090 (Derived_Type, Component_Alignment (Full_View (Parent_Base)));
7092 (Derived_Type, C_Pass_By_Copy (Full_View (Parent_Base)));
7094 Set_Component_Alignment
7095 (Derived_Type, Component_Alignment (Parent_Base));
7098 (Derived_Type, C_Pass_By_Copy (Parent_Base));
7102 -- Set fields for tagged types
7105 Set_Primitive_Operations (Derived_Type, New_Elmt_List);
7107 -- All tagged types defined in Ada.Finalization are controlled
7109 if Chars (Scope (Derived_Type)) = Name_Finalization
7110 and then Chars (Scope (Scope (Derived_Type))) = Name_Ada
7111 and then Scope (Scope (Scope (Derived_Type))) = Standard_Standard
7113 Set_Is_Controlled (Derived_Type);
7115 Set_Is_Controlled (Derived_Type, Is_Controlled (Parent_Base));
7118 -- Minor optimization: there is no need to generate the class-wide
7119 -- entity associated with an underlying record view.
7121 if not Is_Underlying_Record_View (Derived_Type) then
7122 Make_Class_Wide_Type (Derived_Type);
7125 Set_Is_Abstract_Type (Derived_Type, Abstract_Present (Type_Def));
7127 if Has_Discriminants (Derived_Type)
7128 and then Constraint_Present
7130 Set_Stored_Constraint
7131 (Derived_Type, Expand_To_Stored_Constraint (Parent_Base, Discs));
7134 if Ada_Version >= Ada_05 then
7136 Ifaces_List : Elist_Id;
7139 -- Checks rules 3.9.4 (13/2 and 14/2)
7141 if Comes_From_Source (Derived_Type)
7142 and then not Is_Private_Type (Derived_Type)
7143 and then Is_Interface (Parent_Type)
7144 and then not Is_Interface (Derived_Type)
7146 if Is_Task_Interface (Parent_Type) then
7148 ("(Ada 2005) task type required (RM 3.9.4 (13.2))",
7151 elsif Is_Protected_Interface (Parent_Type) then
7153 ("(Ada 2005) protected type required (RM 3.9.4 (14.2))",
7158 -- Check ARM rules 3.9.4 (15/2), 9.1 (9.d/2) and 9.4 (11.d/2)
7160 Check_Interfaces (N, Type_Def);
7162 -- Ada 2005 (AI-251): Collect the list of progenitors that are
7163 -- not already in the parents.
7167 Ifaces_List => Ifaces_List,
7168 Exclude_Parents => True);
7170 Set_Interfaces (Derived_Type, Ifaces_List);
7175 Set_Is_Packed (Derived_Type, Is_Packed (Parent_Base));
7176 Set_Has_Non_Standard_Rep
7177 (Derived_Type, Has_Non_Standard_Rep (Parent_Base));
7180 -- STEP 4: Inherit components from the parent base and constrain them.
7181 -- Apply the second transformation described in point 6. above.
7183 if (not Is_Empty_Elmt_List (Discs) or else Inherit_Discrims)
7184 or else not Has_Discriminants (Parent_Type)
7185 or else not Is_Constrained (Parent_Type)
7189 Constrs := Discriminant_Constraint (Parent_Type);
7194 (N, Parent_Base, Derived_Type, Is_Tagged, Inherit_Discrims, Constrs);
7196 -- STEP 5a: Copy the parent record declaration for untagged types
7198 if not Is_Tagged then
7200 -- Discriminant_Constraint (Derived_Type) has been properly
7201 -- constructed. Save it and temporarily set it to Empty because we
7202 -- do not want the call to New_Copy_Tree below to mess this list.
7204 if Has_Discriminants (Derived_Type) then
7205 Save_Discr_Constr := Discriminant_Constraint (Derived_Type);
7206 Set_Discriminant_Constraint (Derived_Type, No_Elist);
7208 Save_Discr_Constr := No_Elist;
7211 -- Save the Etype field of Derived_Type. It is correctly set now,
7212 -- but the call to New_Copy tree may remap it to point to itself,
7213 -- which is not what we want. Ditto for the Next_Entity field.
7215 Save_Etype := Etype (Derived_Type);
7216 Save_Next_Entity := Next_Entity (Derived_Type);
7218 -- Assoc_List maps all stored discriminants in the Parent_Base to
7219 -- stored discriminants in the Derived_Type. It is fundamental that
7220 -- no types or itypes with discriminants other than the stored
7221 -- discriminants appear in the entities declared inside
7222 -- Derived_Type, since the back end cannot deal with it.
7226 (Parent (Parent_Base), Map => Assoc_List, New_Sloc => Loc);
7228 -- Restore the fields saved prior to the New_Copy_Tree call
7229 -- and compute the stored constraint.
7231 Set_Etype (Derived_Type, Save_Etype);
7232 Set_Next_Entity (Derived_Type, Save_Next_Entity);
7234 if Has_Discriminants (Derived_Type) then
7235 Set_Discriminant_Constraint
7236 (Derived_Type, Save_Discr_Constr);
7237 Set_Stored_Constraint
7238 (Derived_Type, Expand_To_Stored_Constraint (Parent_Type, Discs));
7239 Replace_Components (Derived_Type, New_Decl);
7242 -- Insert the new derived type declaration
7244 Rewrite (N, New_Decl);
7246 -- STEP 5b: Complete the processing for record extensions in generics
7248 -- There is no completion for record extensions declared in the
7249 -- parameter part of a generic, so we need to complete processing for
7250 -- these generic record extensions here. The Record_Type_Definition call
7251 -- will change the Ekind of the components from E_Void to E_Component.
7253 elsif Private_Extension and then Is_Generic_Type (Derived_Type) then
7254 Record_Type_Definition (Empty, Derived_Type);
7256 -- STEP 5c: Process the record extension for non private tagged types
7258 elsif not Private_Extension then
7260 -- Add the _parent field in the derived type
7262 Expand_Record_Extension (Derived_Type, Type_Def);
7264 -- Ada 2005 (AI-251): Addition of the Tag corresponding to all the
7265 -- implemented interfaces if we are in expansion mode
7268 and then Has_Interfaces (Derived_Type)
7270 Add_Interface_Tag_Components (N, Derived_Type);
7273 -- Analyze the record extension
7275 Record_Type_Definition
7276 (Record_Extension_Part (Type_Def), Derived_Type);
7281 -- Nothing else to do if there is an error in the derivation.
7282 -- An unusual case: the full view may be derived from a type in an
7283 -- instance, when the partial view was used illegally as an actual
7284 -- in that instance, leading to a circular definition.
7286 if Etype (Derived_Type) = Any_Type
7287 or else Etype (Parent_Type) = Derived_Type
7292 -- Set delayed freeze and then derive subprograms, we need to do
7293 -- this in this order so that derived subprograms inherit the
7294 -- derived freeze if necessary.
7296 Set_Has_Delayed_Freeze (Derived_Type);
7298 if Derive_Subps then
7299 Derive_Subprograms (Parent_Type, Derived_Type);
7302 -- If we have a private extension which defines a constrained derived
7303 -- type mark as constrained here after we have derived subprograms. See
7304 -- comment on point 9. just above the body of Build_Derived_Record_Type.
7306 if Private_Extension and then Inherit_Discrims then
7307 if Constraint_Present and then not Is_Empty_Elmt_List (Discs) then
7308 Set_Is_Constrained (Derived_Type, True);
7309 Set_Discriminant_Constraint (Derived_Type, Discs);
7311 elsif Is_Constrained (Parent_Type) then
7313 (Derived_Type, True);
7314 Set_Discriminant_Constraint
7315 (Derived_Type, Discriminant_Constraint (Parent_Type));
7319 -- Update the class-wide type, which shares the now-completed entity
7320 -- list with its specific type. In case of underlying record views,
7321 -- we do not generate the corresponding class wide entity.
7324 and then not Is_Underlying_Record_View (Derived_Type)
7327 (Class_Wide_Type (Derived_Type), First_Entity (Derived_Type));
7329 (Class_Wide_Type (Derived_Type), Last_Entity (Derived_Type));
7332 -- Update the scope of anonymous access types of discriminants and other
7333 -- components, to prevent scope anomalies in gigi, when the derivation
7334 -- appears in a scope nested within that of the parent.
7340 D := First_Entity (Derived_Type);
7341 while Present (D) loop
7342 if Ekind (D) = E_Discriminant
7343 or else Ekind (D) = E_Component
7345 if Is_Itype (Etype (D))
7346 and then Ekind (Etype (D)) = E_Anonymous_Access_Type
7348 Set_Scope (Etype (D), Current_Scope);
7355 end Build_Derived_Record_Type;
7357 ------------------------
7358 -- Build_Derived_Type --
7359 ------------------------
7361 procedure Build_Derived_Type
7363 Parent_Type : Entity_Id;
7364 Derived_Type : Entity_Id;
7365 Is_Completion : Boolean;
7366 Derive_Subps : Boolean := True)
7368 Parent_Base : constant Entity_Id := Base_Type (Parent_Type);
7371 -- Set common attributes
7373 Set_Scope (Derived_Type, Current_Scope);
7375 Set_Ekind (Derived_Type, Ekind (Parent_Base));
7376 Set_Etype (Derived_Type, Parent_Base);
7377 Set_Has_Task (Derived_Type, Has_Task (Parent_Base));
7379 Set_Size_Info (Derived_Type, Parent_Type);
7380 Set_RM_Size (Derived_Type, RM_Size (Parent_Type));
7381 Set_Convention (Derived_Type, Convention (Parent_Type));
7382 Set_Is_Controlled (Derived_Type, Is_Controlled (Parent_Type));
7383 Set_Is_Tagged_Type (Derived_Type, Is_Tagged_Type (Parent_Type));
7385 -- The derived type inherits the representation clauses of the parent.
7386 -- However, for a private type that is completed by a derivation, there
7387 -- may be operation attributes that have been specified already (stream
7388 -- attributes and External_Tag) and those must be provided. Finally,
7389 -- if the partial view is a private extension, the representation items
7390 -- of the parent have been inherited already, and should not be chained
7391 -- twice to the derived type.
7393 if Is_Tagged_Type (Parent_Type)
7394 and then Present (First_Rep_Item (Derived_Type))
7396 -- The existing items are either operational items or items inherited
7397 -- from a private extension declaration.
7401 -- Used to iterate over representation items of the derived type
7404 -- Last representation item of the (non-empty) representation
7405 -- item list of the derived type.
7407 Found : Boolean := False;
7410 Rep := First_Rep_Item (Derived_Type);
7412 while Present (Rep) loop
7413 if Rep = First_Rep_Item (Parent_Type) then
7418 Rep := Next_Rep_Item (Rep);
7420 if Present (Rep) then
7426 -- Here if we either encountered the parent type's first rep
7427 -- item on the derived type's rep item list (in which case
7428 -- Found is True, and we have nothing else to do), or if we
7429 -- reached the last rep item of the derived type, which is
7430 -- Last_Rep, in which case we further chain the parent type's
7431 -- rep items to those of the derived type.
7434 Set_Next_Rep_Item (Last_Rep, First_Rep_Item (Parent_Type));
7439 Set_First_Rep_Item (Derived_Type, First_Rep_Item (Parent_Type));
7442 case Ekind (Parent_Type) is
7443 when Numeric_Kind =>
7444 Build_Derived_Numeric_Type (N, Parent_Type, Derived_Type);
7447 Build_Derived_Array_Type (N, Parent_Type, Derived_Type);
7451 | Class_Wide_Kind =>
7452 Build_Derived_Record_Type
7453 (N, Parent_Type, Derived_Type, Derive_Subps);
7456 when Enumeration_Kind =>
7457 Build_Derived_Enumeration_Type (N, Parent_Type, Derived_Type);
7460 Build_Derived_Access_Type (N, Parent_Type, Derived_Type);
7462 when Incomplete_Or_Private_Kind =>
7463 Build_Derived_Private_Type
7464 (N, Parent_Type, Derived_Type, Is_Completion, Derive_Subps);
7466 -- For discriminated types, the derivation includes deriving
7467 -- primitive operations. For others it is done below.
7469 if Is_Tagged_Type (Parent_Type)
7470 or else Has_Discriminants (Parent_Type)
7471 or else (Present (Full_View (Parent_Type))
7472 and then Has_Discriminants (Full_View (Parent_Type)))
7477 when Concurrent_Kind =>
7478 Build_Derived_Concurrent_Type (N, Parent_Type, Derived_Type);
7481 raise Program_Error;
7484 if Etype (Derived_Type) = Any_Type then
7488 -- Set delayed freeze and then derive subprograms, we need to do this
7489 -- in this order so that derived subprograms inherit the derived freeze
7492 Set_Has_Delayed_Freeze (Derived_Type);
7493 if Derive_Subps then
7494 Derive_Subprograms (Parent_Type, Derived_Type);
7497 Set_Has_Primitive_Operations
7498 (Base_Type (Derived_Type), Has_Primitive_Operations (Parent_Type));
7499 end Build_Derived_Type;
7501 -----------------------
7502 -- Build_Discriminal --
7503 -----------------------
7505 procedure Build_Discriminal (Discrim : Entity_Id) is
7506 D_Minal : Entity_Id;
7507 CR_Disc : Entity_Id;
7510 -- A discriminal has the same name as the discriminant
7513 Make_Defining_Identifier (Sloc (Discrim),
7514 Chars => Chars (Discrim));
7516 Set_Ekind (D_Minal, E_In_Parameter);
7517 Set_Mechanism (D_Minal, Default_Mechanism);
7518 Set_Etype (D_Minal, Etype (Discrim));
7520 Set_Discriminal (Discrim, D_Minal);
7521 Set_Discriminal_Link (D_Minal, Discrim);
7523 -- For task types, build at once the discriminants of the corresponding
7524 -- record, which are needed if discriminants are used in entry defaults
7525 -- and in family bounds.
7527 if Is_Concurrent_Type (Current_Scope)
7528 or else Is_Limited_Type (Current_Scope)
7530 CR_Disc := Make_Defining_Identifier (Sloc (Discrim), Chars (Discrim));
7532 Set_Ekind (CR_Disc, E_In_Parameter);
7533 Set_Mechanism (CR_Disc, Default_Mechanism);
7534 Set_Etype (CR_Disc, Etype (Discrim));
7535 Set_Discriminal_Link (CR_Disc, Discrim);
7536 Set_CR_Discriminant (Discrim, CR_Disc);
7538 end Build_Discriminal;
7540 ------------------------------------
7541 -- Build_Discriminant_Constraints --
7542 ------------------------------------
7544 function Build_Discriminant_Constraints
7547 Derived_Def : Boolean := False) return Elist_Id
7549 C : constant Node_Id := Constraint (Def);
7550 Nb_Discr : constant Nat := Number_Discriminants (T);
7552 Discr_Expr : array (1 .. Nb_Discr) of Node_Id := (others => Empty);
7553 -- Saves the expression corresponding to a given discriminant in T
7555 function Pos_Of_Discr (T : Entity_Id; D : Entity_Id) return Nat;
7556 -- Return the Position number within array Discr_Expr of a discriminant
7557 -- D within the discriminant list of the discriminated type T.
7563 function Pos_Of_Discr (T : Entity_Id; D : Entity_Id) return Nat is
7567 Disc := First_Discriminant (T);
7568 for J in Discr_Expr'Range loop
7573 Next_Discriminant (Disc);
7576 -- Note: Since this function is called on discriminants that are
7577 -- known to belong to the discriminated type, falling through the
7578 -- loop with no match signals an internal compiler error.
7580 raise Program_Error;
7583 -- Declarations local to Build_Discriminant_Constraints
7587 Elist : constant Elist_Id := New_Elmt_List;
7595 Discrim_Present : Boolean := False;
7597 -- Start of processing for Build_Discriminant_Constraints
7600 -- The following loop will process positional associations only.
7601 -- For a positional association, the (single) discriminant is
7602 -- implicitly specified by position, in textual order (RM 3.7.2).
7604 Discr := First_Discriminant (T);
7605 Constr := First (Constraints (C));
7606 for D in Discr_Expr'Range loop
7607 exit when Nkind (Constr) = N_Discriminant_Association;
7610 Error_Msg_N ("too few discriminants given in constraint", C);
7611 return New_Elmt_List;
7613 elsif Nkind (Constr) = N_Range
7614 or else (Nkind (Constr) = N_Attribute_Reference
7616 Attribute_Name (Constr) = Name_Range)
7619 ("a range is not a valid discriminant constraint", Constr);
7620 Discr_Expr (D) := Error;
7623 Analyze_And_Resolve (Constr, Base_Type (Etype (Discr)));
7624 Discr_Expr (D) := Constr;
7627 Next_Discriminant (Discr);
7631 if No (Discr) and then Present (Constr) then
7632 Error_Msg_N ("too many discriminants given in constraint", Constr);
7633 return New_Elmt_List;
7636 -- Named associations can be given in any order, but if both positional
7637 -- and named associations are used in the same discriminant constraint,
7638 -- then positional associations must occur first, at their normal
7639 -- position. Hence once a named association is used, the rest of the
7640 -- discriminant constraint must use only named associations.
7642 while Present (Constr) loop
7644 -- Positional association forbidden after a named association
7646 if Nkind (Constr) /= N_Discriminant_Association then
7647 Error_Msg_N ("positional association follows named one", Constr);
7648 return New_Elmt_List;
7650 -- Otherwise it is a named association
7653 -- E records the type of the discriminants in the named
7654 -- association. All the discriminants specified in the same name
7655 -- association must have the same type.
7659 -- Search the list of discriminants in T to see if the simple name
7660 -- given in the constraint matches any of them.
7662 Id := First (Selector_Names (Constr));
7663 while Present (Id) loop
7666 -- If Original_Discriminant is present, we are processing a
7667 -- generic instantiation and this is an instance node. We need
7668 -- to find the name of the corresponding discriminant in the
7669 -- actual record type T and not the name of the discriminant in
7670 -- the generic formal. Example:
7673 -- type G (D : int) is private;
7675 -- subtype W is G (D => 1);
7677 -- type Rec (X : int) is record ... end record;
7678 -- package Q is new P (G => Rec);
7680 -- At the point of the instantiation, formal type G is Rec
7681 -- and therefore when reanalyzing "subtype W is G (D => 1);"
7682 -- which really looks like "subtype W is Rec (D => 1);" at
7683 -- the point of instantiation, we want to find the discriminant
7684 -- that corresponds to D in Rec, i.e. X.
7686 if Present (Original_Discriminant (Id)) then
7687 Discr := Find_Corresponding_Discriminant (Id, T);
7691 Discr := First_Discriminant (T);
7692 while Present (Discr) loop
7693 if Chars (Discr) = Chars (Id) then
7698 Next_Discriminant (Discr);
7702 Error_Msg_N ("& does not match any discriminant", Id);
7703 return New_Elmt_List;
7705 -- The following is only useful for the benefit of generic
7706 -- instances but it does not interfere with other
7707 -- processing for the non-generic case so we do it in all
7708 -- cases (for generics this statement is executed when
7709 -- processing the generic definition, see comment at the
7710 -- beginning of this if statement).
7713 Set_Original_Discriminant (Id, Discr);
7717 Position := Pos_Of_Discr (T, Discr);
7719 if Present (Discr_Expr (Position)) then
7720 Error_Msg_N ("duplicate constraint for discriminant&", Id);
7723 -- Each discriminant specified in the same named association
7724 -- must be associated with a separate copy of the
7725 -- corresponding expression.
7727 if Present (Next (Id)) then
7728 Expr := New_Copy_Tree (Expression (Constr));
7729 Set_Parent (Expr, Parent (Expression (Constr)));
7731 Expr := Expression (Constr);
7734 Discr_Expr (Position) := Expr;
7735 Analyze_And_Resolve (Expr, Base_Type (Etype (Discr)));
7738 -- A discriminant association with more than one discriminant
7739 -- name is only allowed if the named discriminants are all of
7740 -- the same type (RM 3.7.1(8)).
7743 E := Base_Type (Etype (Discr));
7745 elsif Base_Type (Etype (Discr)) /= E then
7747 ("all discriminants in an association " &
7748 "must have the same type", Id);
7758 -- A discriminant constraint must provide exactly one value for each
7759 -- discriminant of the type (RM 3.7.1(8)).
7761 for J in Discr_Expr'Range loop
7762 if No (Discr_Expr (J)) then
7763 Error_Msg_N ("too few discriminants given in constraint", C);
7764 return New_Elmt_List;
7768 -- Determine if there are discriminant expressions in the constraint
7770 for J in Discr_Expr'Range loop
7771 if Denotes_Discriminant
7772 (Discr_Expr (J), Check_Concurrent => True)
7774 Discrim_Present := True;
7778 -- Build an element list consisting of the expressions given in the
7779 -- discriminant constraint and apply the appropriate checks. The list
7780 -- is constructed after resolving any named discriminant associations
7781 -- and therefore the expressions appear in the textual order of the
7784 Discr := First_Discriminant (T);
7785 for J in Discr_Expr'Range loop
7786 if Discr_Expr (J) /= Error then
7787 Append_Elmt (Discr_Expr (J), Elist);
7789 -- If any of the discriminant constraints is given by a
7790 -- discriminant and we are in a derived type declaration we
7791 -- have a discriminant renaming. Establish link between new
7792 -- and old discriminant.
7794 if Denotes_Discriminant (Discr_Expr (J)) then
7796 Set_Corresponding_Discriminant
7797 (Entity (Discr_Expr (J)), Discr);
7800 -- Force the evaluation of non-discriminant expressions.
7801 -- If we have found a discriminant in the constraint 3.4(26)
7802 -- and 3.8(18) demand that no range checks are performed are
7803 -- after evaluation. If the constraint is for a component
7804 -- definition that has a per-object constraint, expressions are
7805 -- evaluated but not checked either. In all other cases perform
7809 if Discrim_Present then
7812 elsif Nkind (Parent (Parent (Def))) = N_Component_Declaration
7814 Has_Per_Object_Constraint
7815 (Defining_Identifier (Parent (Parent (Def))))
7819 elsif Is_Access_Type (Etype (Discr)) then
7820 Apply_Constraint_Check (Discr_Expr (J), Etype (Discr));
7823 Apply_Range_Check (Discr_Expr (J), Etype (Discr));
7826 Force_Evaluation (Discr_Expr (J));
7829 -- Check that the designated type of an access discriminant's
7830 -- expression is not a class-wide type unless the discriminant's
7831 -- designated type is also class-wide.
7833 if Ekind (Etype (Discr)) = E_Anonymous_Access_Type
7834 and then not Is_Class_Wide_Type
7835 (Designated_Type (Etype (Discr)))
7836 and then Etype (Discr_Expr (J)) /= Any_Type
7837 and then Is_Class_Wide_Type
7838 (Designated_Type (Etype (Discr_Expr (J))))
7840 Wrong_Type (Discr_Expr (J), Etype (Discr));
7842 elsif Is_Access_Type (Etype (Discr))
7843 and then not Is_Access_Constant (Etype (Discr))
7844 and then Is_Access_Type (Etype (Discr_Expr (J)))
7845 and then Is_Access_Constant (Etype (Discr_Expr (J)))
7848 ("constraint for discriminant& must be access to variable",
7853 Next_Discriminant (Discr);
7857 end Build_Discriminant_Constraints;
7859 ---------------------------------
7860 -- Build_Discriminated_Subtype --
7861 ---------------------------------
7863 procedure Build_Discriminated_Subtype
7867 Related_Nod : Node_Id;
7868 For_Access : Boolean := False)
7870 Has_Discrs : constant Boolean := Has_Discriminants (T);
7871 Constrained : constant Boolean :=
7873 and then not Is_Empty_Elmt_List (Elist)
7874 and then not Is_Class_Wide_Type (T))
7875 or else Is_Constrained (T);
7878 if Ekind (T) = E_Record_Type then
7880 Set_Ekind (Def_Id, E_Private_Subtype);
7881 Set_Is_For_Access_Subtype (Def_Id, True);
7883 Set_Ekind (Def_Id, E_Record_Subtype);
7886 -- Inherit preelaboration flag from base, for types for which it
7887 -- may have been set: records, private types, protected types.
7889 Set_Known_To_Have_Preelab_Init
7890 (Def_Id, Known_To_Have_Preelab_Init (T));
7892 elsif Ekind (T) = E_Task_Type then
7893 Set_Ekind (Def_Id, E_Task_Subtype);
7895 elsif Ekind (T) = E_Protected_Type then
7896 Set_Ekind (Def_Id, E_Protected_Subtype);
7897 Set_Known_To_Have_Preelab_Init
7898 (Def_Id, Known_To_Have_Preelab_Init (T));
7900 elsif Is_Private_Type (T) then
7901 Set_Ekind (Def_Id, Subtype_Kind (Ekind (T)));
7902 Set_Known_To_Have_Preelab_Init
7903 (Def_Id, Known_To_Have_Preelab_Init (T));
7905 elsif Is_Class_Wide_Type (T) then
7906 Set_Ekind (Def_Id, E_Class_Wide_Subtype);
7909 -- Incomplete type. Attach subtype to list of dependents, to be
7910 -- completed with full view of parent type, unless is it the
7911 -- designated subtype of a record component within an init_proc.
7912 -- This last case arises for a component of an access type whose
7913 -- designated type is incomplete (e.g. a Taft Amendment type).
7914 -- The designated subtype is within an inner scope, and needs no
7915 -- elaboration, because only the access type is needed in the
7916 -- initialization procedure.
7918 Set_Ekind (Def_Id, Ekind (T));
7920 if For_Access and then Within_Init_Proc then
7923 Append_Elmt (Def_Id, Private_Dependents (T));
7927 Set_Etype (Def_Id, T);
7928 Init_Size_Align (Def_Id);
7929 Set_Has_Discriminants (Def_Id, Has_Discrs);
7930 Set_Is_Constrained (Def_Id, Constrained);
7932 Set_First_Entity (Def_Id, First_Entity (T));
7933 Set_Last_Entity (Def_Id, Last_Entity (T));
7935 -- If the subtype is the completion of a private declaration, there may
7936 -- have been representation clauses for the partial view, and they must
7937 -- be preserved. Build_Derived_Type chains the inherited clauses with
7938 -- the ones appearing on the extension. If this comes from a subtype
7939 -- declaration, all clauses are inherited.
7941 if No (First_Rep_Item (Def_Id)) then
7942 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
7945 if Is_Tagged_Type (T) then
7946 Set_Is_Tagged_Type (Def_Id);
7947 Make_Class_Wide_Type (Def_Id);
7950 Set_Stored_Constraint (Def_Id, No_Elist);
7953 Set_Discriminant_Constraint (Def_Id, Elist);
7954 Set_Stored_Constraint_From_Discriminant_Constraint (Def_Id);
7957 if Is_Tagged_Type (T) then
7959 -- Ada 2005 (AI-251): In case of concurrent types we inherit the
7960 -- concurrent record type (which has the list of primitive
7963 if Ada_Version >= Ada_05
7964 and then Is_Concurrent_Type (T)
7966 Set_Corresponding_Record_Type (Def_Id,
7967 Corresponding_Record_Type (T));
7969 Set_Primitive_Operations (Def_Id, Primitive_Operations (T));
7972 Set_Is_Abstract_Type (Def_Id, Is_Abstract_Type (T));
7975 -- Subtypes introduced by component declarations do not need to be
7976 -- marked as delayed, and do not get freeze nodes, because the semantics
7977 -- verifies that the parents of the subtypes are frozen before the
7978 -- enclosing record is frozen.
7980 if not Is_Type (Scope (Def_Id)) then
7981 Set_Depends_On_Private (Def_Id, Depends_On_Private (T));
7983 if Is_Private_Type (T)
7984 and then Present (Full_View (T))
7986 Conditional_Delay (Def_Id, Full_View (T));
7988 Conditional_Delay (Def_Id, T);
7992 if Is_Record_Type (T) then
7993 Set_Is_Limited_Record (Def_Id, Is_Limited_Record (T));
7996 and then not Is_Empty_Elmt_List (Elist)
7997 and then not For_Access
7999 Create_Constrained_Components (Def_Id, Related_Nod, T, Elist);
8000 elsif not For_Access then
8001 Set_Cloned_Subtype (Def_Id, T);
8004 end Build_Discriminated_Subtype;
8006 ---------------------------
8007 -- Build_Itype_Reference --
8008 ---------------------------
8010 procedure Build_Itype_Reference
8014 IR : constant Node_Id := Make_Itype_Reference (Sloc (Nod));
8016 Set_Itype (IR, Ityp);
8017 Insert_After (Nod, IR);
8018 end Build_Itype_Reference;
8020 ------------------------
8021 -- Build_Scalar_Bound --
8022 ------------------------
8024 function Build_Scalar_Bound
8027 Der_T : Entity_Id) return Node_Id
8029 New_Bound : Entity_Id;
8032 -- Note: not clear why this is needed, how can the original bound
8033 -- be unanalyzed at this point? and if it is, what business do we
8034 -- have messing around with it? and why is the base type of the
8035 -- parent type the right type for the resolution. It probably is
8036 -- not! It is OK for the new bound we are creating, but not for
8037 -- the old one??? Still if it never happens, no problem!
8039 Analyze_And_Resolve (Bound, Base_Type (Par_T));
8041 if Nkind_In (Bound, N_Integer_Literal, N_Real_Literal) then
8042 New_Bound := New_Copy (Bound);
8043 Set_Etype (New_Bound, Der_T);
8044 Set_Analyzed (New_Bound);
8046 elsif Is_Entity_Name (Bound) then
8047 New_Bound := OK_Convert_To (Der_T, New_Copy (Bound));
8049 -- The following is almost certainly wrong. What business do we have
8050 -- relocating a node (Bound) that is presumably still attached to
8051 -- the tree elsewhere???
8054 New_Bound := OK_Convert_To (Der_T, Relocate_Node (Bound));
8057 Set_Etype (New_Bound, Der_T);
8059 end Build_Scalar_Bound;
8061 --------------------------------
8062 -- Build_Underlying_Full_View --
8063 --------------------------------
8065 procedure Build_Underlying_Full_View
8070 Loc : constant Source_Ptr := Sloc (N);
8071 Subt : constant Entity_Id :=
8072 Make_Defining_Identifier
8073 (Loc, New_External_Name (Chars (Typ), 'S'));
8080 procedure Set_Discriminant_Name (Id : Node_Id);
8081 -- If the derived type has discriminants, they may rename discriminants
8082 -- of the parent. When building the full view of the parent, we need to
8083 -- recover the names of the original discriminants if the constraint is
8084 -- given by named associations.
8086 ---------------------------
8087 -- Set_Discriminant_Name --
8088 ---------------------------
8090 procedure Set_Discriminant_Name (Id : Node_Id) is
8094 Set_Original_Discriminant (Id, Empty);
8096 if Has_Discriminants (Typ) then
8097 Disc := First_Discriminant (Typ);
8098 while Present (Disc) loop
8099 if Chars (Disc) = Chars (Id)
8100 and then Present (Corresponding_Discriminant (Disc))
8102 Set_Chars (Id, Chars (Corresponding_Discriminant (Disc)));
8104 Next_Discriminant (Disc);
8107 end Set_Discriminant_Name;
8109 -- Start of processing for Build_Underlying_Full_View
8112 if Nkind (N) = N_Full_Type_Declaration then
8113 Constr := Constraint (Subtype_Indication (Type_Definition (N)));
8115 elsif Nkind (N) = N_Subtype_Declaration then
8116 Constr := New_Copy_Tree (Constraint (Subtype_Indication (N)));
8118 elsif Nkind (N) = N_Component_Declaration then
8121 (Constraint (Subtype_Indication (Component_Definition (N))));
8124 raise Program_Error;
8127 C := First (Constraints (Constr));
8128 while Present (C) loop
8129 if Nkind (C) = N_Discriminant_Association then
8130 Id := First (Selector_Names (C));
8131 while Present (Id) loop
8132 Set_Discriminant_Name (Id);
8141 Make_Subtype_Declaration (Loc,
8142 Defining_Identifier => Subt,
8143 Subtype_Indication =>
8144 Make_Subtype_Indication (Loc,
8145 Subtype_Mark => New_Reference_To (Par, Loc),
8146 Constraint => New_Copy_Tree (Constr)));
8148 -- If this is a component subtype for an outer itype, it is not
8149 -- a list member, so simply set the parent link for analysis: if
8150 -- the enclosing type does not need to be in a declarative list,
8151 -- neither do the components.
8153 if Is_List_Member (N)
8154 and then Nkind (N) /= N_Component_Declaration
8156 Insert_Before (N, Indic);
8158 Set_Parent (Indic, Parent (N));
8162 Set_Underlying_Full_View (Typ, Full_View (Subt));
8163 end Build_Underlying_Full_View;
8165 -------------------------------
8166 -- Check_Abstract_Overriding --
8167 -------------------------------
8169 procedure Check_Abstract_Overriding (T : Entity_Id) is
8170 Alias_Subp : Entity_Id;
8177 Op_List := Primitive_Operations (T);
8179 -- Loop to check primitive operations
8181 Elmt := First_Elmt (Op_List);
8182 while Present (Elmt) loop
8183 Subp := Node (Elmt);
8184 Alias_Subp := Alias (Subp);
8186 -- Inherited subprograms are identified by the fact that they do not
8187 -- come from source, and the associated source location is the
8188 -- location of the first subtype of the derived type.
8190 -- Ada 2005 (AI-228): Apply the rules of RM-3.9.3(6/2) for
8191 -- subprograms that "require overriding".
8193 -- Special exception, do not complain about failure to override the
8194 -- stream routines _Input and _Output, as well as the primitive
8195 -- operations used in dispatching selects since we always provide
8196 -- automatic overridings for these subprograms.
8198 -- Also ignore this rule for convention CIL since .NET libraries
8199 -- do bizarre things with interfaces???
8201 -- The partial view of T may have been a private extension, for
8202 -- which inherited functions dispatching on result are abstract.
8203 -- If the full view is a null extension, there is no need for
8204 -- overriding in Ada2005, but wrappers need to be built for them
8205 -- (see exp_ch3, Build_Controlling_Function_Wrappers).
8207 if Is_Null_Extension (T)
8208 and then Has_Controlling_Result (Subp)
8209 and then Ada_Version >= Ada_05
8210 and then Present (Alias_Subp)
8211 and then not Comes_From_Source (Subp)
8212 and then not Is_Abstract_Subprogram (Alias_Subp)
8213 and then not Is_Access_Type (Etype (Subp))
8217 -- Ada 2005 (AI-251): Internal entities of interfaces need no
8218 -- processing because this check is done with the aliased
8221 elsif Present (Interface_Alias (Subp)) then
8224 elsif (Is_Abstract_Subprogram (Subp)
8225 or else Requires_Overriding (Subp)
8227 (Has_Controlling_Result (Subp)
8228 and then Present (Alias_Subp)
8229 and then not Comes_From_Source (Subp)
8230 and then Sloc (Subp) = Sloc (First_Subtype (T))))
8231 and then not Is_TSS (Subp, TSS_Stream_Input)
8232 and then not Is_TSS (Subp, TSS_Stream_Output)
8233 and then not Is_Abstract_Type (T)
8234 and then Convention (T) /= Convention_CIL
8235 and then not Is_Predefined_Interface_Primitive (Subp)
8237 -- Ada 2005 (AI-251): Do not consider hidden entities associated
8238 -- with abstract interface types because the check will be done
8239 -- with the aliased entity (otherwise we generate a duplicated
8242 and then not Present (Interface_Alias (Subp))
8244 if Present (Alias_Subp) then
8246 -- Only perform the check for a derived subprogram when the
8247 -- type has an explicit record extension. This avoids incorrect
8248 -- flagging of abstract subprograms for the case of a type
8249 -- without an extension that is derived from a formal type
8250 -- with a tagged actual (can occur within a private part).
8252 -- Ada 2005 (AI-391): In the case of an inherited function with
8253 -- a controlling result of the type, the rule does not apply if
8254 -- the type is a null extension (unless the parent function
8255 -- itself is abstract, in which case the function must still be
8256 -- be overridden). The expander will generate an overriding
8257 -- wrapper function calling the parent subprogram (see
8258 -- Exp_Ch3.Make_Controlling_Wrapper_Functions).
8260 Type_Def := Type_Definition (Parent (T));
8262 if Nkind (Type_Def) = N_Derived_Type_Definition
8263 and then Present (Record_Extension_Part (Type_Def))
8265 (Ada_Version < Ada_05
8266 or else not Is_Null_Extension (T)
8267 or else Ekind (Subp) = E_Procedure
8268 or else not Has_Controlling_Result (Subp)
8269 or else Is_Abstract_Subprogram (Alias_Subp)
8270 or else Requires_Overriding (Subp)
8271 or else Is_Access_Type (Etype (Subp)))
8273 -- Avoid reporting error in case of abstract predefined
8274 -- primitive inherited from interface type because the
8275 -- body of internally generated predefined primitives
8276 -- of tagged types are generated later by Freeze_Type
8278 if Is_Interface (Root_Type (T))
8279 and then Is_Abstract_Subprogram (Subp)
8280 and then Is_Predefined_Dispatching_Operation (Subp)
8281 and then not Comes_From_Source (Ultimate_Alias (Subp))
8287 ("type must be declared abstract or & overridden",
8290 -- Traverse the whole chain of aliased subprograms to
8291 -- complete the error notification. This is especially
8292 -- useful for traceability of the chain of entities when
8293 -- the subprogram corresponds with an interface
8294 -- subprogram (which may be defined in another package).
8296 if Present (Alias_Subp) then
8302 while Present (Alias (E)) loop
8303 Error_Msg_Sloc := Sloc (E);
8305 ("\& has been inherited #", T, Subp);
8309 Error_Msg_Sloc := Sloc (E);
8311 ("\& has been inherited from subprogram #",
8317 -- Ada 2005 (AI-345): Protected or task type implementing
8318 -- abstract interfaces.
8320 elsif Is_Concurrent_Record_Type (T)
8321 and then Present (Interfaces (T))
8323 -- The controlling formal of Subp must be of mode "out",
8324 -- "in out" or an access-to-variable to be overridden.
8326 -- Error message below needs rewording (remember comma
8327 -- in -gnatj mode) ???
8329 if Ekind (First_Formal (Subp)) = E_In_Parameter then
8330 if not Is_Predefined_Dispatching_Operation (Subp) then
8332 ("first formal of & must be of mode `OUT`, " &
8333 "`IN OUT` or access-to-variable", T, Subp);
8335 ("\to be overridden by protected procedure or " &
8336 "entry (RM 9.4(11.9/2))", T);
8339 -- Some other kind of overriding failure
8343 ("interface subprogram & must be overridden",
8349 Error_Msg_Node_2 := T;
8351 ("abstract subprogram& not allowed for type&", Subp);
8353 -- Also post unconditional warning on the type (unconditional
8354 -- so that if there are more than one of these cases, we get
8355 -- them all, and not just the first one).
8357 Error_Msg_Node_2 := Subp;
8359 ("nonabstract type& has abstract subprogram&!", T);
8363 -- Ada 2005 (AI05-0030): Inspect hidden subprograms which provide
8364 -- the mapping between interface and implementing type primitives.
8365 -- If the interface alias is marked as Implemented_By_Entry, the
8366 -- alias must be an entry wrapper.
8368 if Ada_Version >= Ada_05
8369 and then Is_Hidden (Subp)
8370 and then Present (Interface_Alias (Subp))
8371 and then Implemented_By_Entry (Interface_Alias (Subp))
8372 and then Present (Alias_Subp)
8374 (not Is_Primitive_Wrapper (Alias_Subp)
8375 or else Ekind (Wrapped_Entity (Alias_Subp)) /= E_Entry)
8378 Error_Ent : Entity_Id := T;
8381 if Is_Concurrent_Record_Type (Error_Ent) then
8382 Error_Ent := Corresponding_Concurrent_Type (Error_Ent);
8385 Error_Msg_Node_2 := Interface_Alias (Subp);
8387 ("type & must implement abstract subprogram & with an entry",
8388 Error_Ent, Error_Ent);
8394 end Check_Abstract_Overriding;
8396 ------------------------------------------------
8397 -- Check_Access_Discriminant_Requires_Limited --
8398 ------------------------------------------------
8400 procedure Check_Access_Discriminant_Requires_Limited
8405 -- A discriminant_specification for an access discriminant shall appear
8406 -- only in the declaration for a task or protected type, or for a type
8407 -- with the reserved word 'limited' in its definition or in one of its
8408 -- ancestors. (RM 3.7(10))
8410 if Nkind (Discriminant_Type (D)) = N_Access_Definition
8411 and then not Is_Concurrent_Type (Current_Scope)
8412 and then not Is_Concurrent_Record_Type (Current_Scope)
8413 and then not Is_Limited_Record (Current_Scope)
8414 and then Ekind (Current_Scope) /= E_Limited_Private_Type
8417 ("access discriminants allowed only for limited types", Loc);
8419 end Check_Access_Discriminant_Requires_Limited;
8421 -----------------------------------
8422 -- Check_Aliased_Component_Types --
8423 -----------------------------------
8425 procedure Check_Aliased_Component_Types (T : Entity_Id) is
8429 -- ??? Also need to check components of record extensions, but not
8430 -- components of protected types (which are always limited).
8432 -- Ada 2005: AI-363 relaxes this rule, to allow heap objects of such
8433 -- types to be unconstrained. This is safe because it is illegal to
8434 -- create access subtypes to such types with explicit discriminant
8437 if not Is_Limited_Type (T) then
8438 if Ekind (T) = E_Record_Type then
8439 C := First_Component (T);
8440 while Present (C) loop
8442 and then Has_Discriminants (Etype (C))
8443 and then not Is_Constrained (Etype (C))
8444 and then not In_Instance_Body
8445 and then Ada_Version < Ada_05
8448 ("aliased component must be constrained (RM 3.6(11))",
8455 elsif Ekind (T) = E_Array_Type then
8456 if Has_Aliased_Components (T)
8457 and then Has_Discriminants (Component_Type (T))
8458 and then not Is_Constrained (Component_Type (T))
8459 and then not In_Instance_Body
8460 and then Ada_Version < Ada_05
8463 ("aliased component type must be constrained (RM 3.6(11))",
8468 end Check_Aliased_Component_Types;
8470 ----------------------
8471 -- Check_Completion --
8472 ----------------------
8474 procedure Check_Completion (Body_Id : Node_Id := Empty) is
8477 procedure Post_Error;
8478 -- Post error message for lack of completion for entity E
8484 procedure Post_Error is
8486 procedure Missing_Body;
8487 -- Output missing body message
8493 procedure Missing_Body is
8495 -- Spec is in same unit, so we can post on spec
8497 if In_Same_Source_Unit (Body_Id, E) then
8498 Error_Msg_N ("missing body for &", E);
8500 -- Spec is in a separate unit, so we have to post on the body
8503 Error_Msg_NE ("missing body for & declared#!", Body_Id, E);
8507 -- Start of processing for Post_Error
8510 if not Comes_From_Source (E) then
8512 if Ekind (E) = E_Task_Type
8513 or else Ekind (E) = E_Protected_Type
8515 -- It may be an anonymous protected type created for a
8516 -- single variable. Post error on variable, if present.
8522 Var := First_Entity (Current_Scope);
8523 while Present (Var) loop
8524 exit when Etype (Var) = E
8525 and then Comes_From_Source (Var);
8530 if Present (Var) then
8537 -- If a generated entity has no completion, then either previous
8538 -- semantic errors have disabled the expansion phase, or else we had
8539 -- missing subunits, or else we are compiling without expansion,
8540 -- or else something is very wrong.
8542 if not Comes_From_Source (E) then
8544 (Serious_Errors_Detected > 0
8545 or else Configurable_Run_Time_Violations > 0
8546 or else Subunits_Missing
8547 or else not Expander_Active);
8550 -- Here for source entity
8553 -- Here if no body to post the error message, so we post the error
8554 -- on the declaration that has no completion. This is not really
8555 -- the right place to post it, think about this later ???
8557 if No (Body_Id) then
8560 ("missing full declaration for }", Parent (E), E);
8563 ("missing body for &", Parent (E), E);
8566 -- Package body has no completion for a declaration that appears
8567 -- in the corresponding spec. Post error on the body, with a
8568 -- reference to the non-completed declaration.
8571 Error_Msg_Sloc := Sloc (E);
8575 ("missing full declaration for }!", Body_Id, E);
8577 elsif Is_Overloadable (E)
8578 and then Current_Entity_In_Scope (E) /= E
8580 -- It may be that the completion is mistyped and appears as
8581 -- a distinct overloading of the entity.
8584 Candidate : constant Entity_Id :=
8585 Current_Entity_In_Scope (E);
8586 Decl : constant Node_Id :=
8587 Unit_Declaration_Node (Candidate);
8590 if Is_Overloadable (Candidate)
8591 and then Ekind (Candidate) = Ekind (E)
8592 and then Nkind (Decl) = N_Subprogram_Body
8593 and then Acts_As_Spec (Decl)
8595 Check_Type_Conformant (Candidate, E);
8609 -- Start of processing for Check_Completion
8612 E := First_Entity (Current_Scope);
8613 while Present (E) loop
8614 if Is_Intrinsic_Subprogram (E) then
8617 -- The following situation requires special handling: a child unit
8618 -- that appears in the context clause of the body of its parent:
8620 -- procedure Parent.Child (...);
8622 -- with Parent.Child;
8623 -- package body Parent is
8625 -- Here Parent.Child appears as a local entity, but should not be
8626 -- flagged as requiring completion, because it is a compilation
8629 -- Ignore missing completion for a subprogram that does not come from
8630 -- source (including the _Call primitive operation of RAS types,
8631 -- which has to have the flag Comes_From_Source for other purposes):
8632 -- we assume that the expander will provide the missing completion.
8634 elsif Ekind (E) = E_Function
8635 or else Ekind (E) = E_Procedure
8636 or else Ekind (E) = E_Generic_Function
8637 or else Ekind (E) = E_Generic_Procedure
8639 if not Has_Completion (E)
8640 and then not (Is_Subprogram (E)
8641 and then Is_Abstract_Subprogram (E))
8642 and then not (Is_Subprogram (E)
8644 (not Comes_From_Source (E)
8645 or else Chars (E) = Name_uCall))
8646 and then Nkind (Parent (Unit_Declaration_Node (E))) /=
8648 and then Chars (E) /= Name_uSize
8653 elsif Is_Entry (E) then
8654 if not Has_Completion (E) and then
8655 (Ekind (Scope (E)) = E_Protected_Object
8656 or else Ekind (Scope (E)) = E_Protected_Type)
8661 elsif Is_Package_Or_Generic_Package (E) then
8662 if Unit_Requires_Body (E) then
8663 if not Has_Completion (E)
8664 and then Nkind (Parent (Unit_Declaration_Node (E))) /=
8670 elsif not Is_Child_Unit (E) then
8671 May_Need_Implicit_Body (E);
8674 elsif Ekind (E) = E_Incomplete_Type
8675 and then No (Underlying_Type (E))
8679 elsif (Ekind (E) = E_Task_Type or else
8680 Ekind (E) = E_Protected_Type)
8681 and then not Has_Completion (E)
8685 -- A single task declared in the current scope is a constant, verify
8686 -- that the body of its anonymous type is in the same scope. If the
8687 -- task is defined elsewhere, this may be a renaming declaration for
8688 -- which no completion is needed.
8690 elsif Ekind (E) = E_Constant
8691 and then Ekind (Etype (E)) = E_Task_Type
8692 and then not Has_Completion (Etype (E))
8693 and then Scope (Etype (E)) = Current_Scope
8697 elsif Ekind (E) = E_Protected_Object
8698 and then not Has_Completion (Etype (E))
8702 elsif Ekind (E) = E_Record_Type then
8703 if Is_Tagged_Type (E) then
8704 Check_Abstract_Overriding (E);
8705 Check_Conventions (E);
8708 Check_Aliased_Component_Types (E);
8710 elsif Ekind (E) = E_Array_Type then
8711 Check_Aliased_Component_Types (E);
8717 end Check_Completion;
8719 ----------------------------
8720 -- Check_Delta_Expression --
8721 ----------------------------
8723 procedure Check_Delta_Expression (E : Node_Id) is
8725 if not (Is_Real_Type (Etype (E))) then
8726 Wrong_Type (E, Any_Real);
8728 elsif not Is_OK_Static_Expression (E) then
8729 Flag_Non_Static_Expr
8730 ("non-static expression used for delta value!", E);
8732 elsif not UR_Is_Positive (Expr_Value_R (E)) then
8733 Error_Msg_N ("delta expression must be positive", E);
8739 -- If any of above errors occurred, then replace the incorrect
8740 -- expression by the real 0.1, which should prevent further errors.
8743 Make_Real_Literal (Sloc (E), Ureal_Tenth));
8744 Analyze_And_Resolve (E, Standard_Float);
8745 end Check_Delta_Expression;
8747 -----------------------------
8748 -- Check_Digits_Expression --
8749 -----------------------------
8751 procedure Check_Digits_Expression (E : Node_Id) is
8753 if not (Is_Integer_Type (Etype (E))) then
8754 Wrong_Type (E, Any_Integer);
8756 elsif not Is_OK_Static_Expression (E) then
8757 Flag_Non_Static_Expr
8758 ("non-static expression used for digits value!", E);
8760 elsif Expr_Value (E) <= 0 then
8761 Error_Msg_N ("digits value must be greater than zero", E);
8767 -- If any of above errors occurred, then replace the incorrect
8768 -- expression by the integer 1, which should prevent further errors.
8770 Rewrite (E, Make_Integer_Literal (Sloc (E), 1));
8771 Analyze_And_Resolve (E, Standard_Integer);
8773 end Check_Digits_Expression;
8775 --------------------------
8776 -- Check_Initialization --
8777 --------------------------
8779 procedure Check_Initialization (T : Entity_Id; Exp : Node_Id) is
8781 if Is_Limited_Type (T)
8782 and then not In_Instance
8783 and then not In_Inlined_Body
8785 if not OK_For_Limited_Init (Exp) then
8787 -- In GNAT mode, this is just a warning, to allow it to be evilly
8788 -- turned off. Otherwise it is a real error.
8792 ("?cannot initialize entities of limited type!", Exp);
8794 elsif Ada_Version < Ada_05 then
8796 ("cannot initialize entities of limited type", Exp);
8797 Explain_Limited_Type (T, Exp);
8800 -- Specialize error message according to kind of illegal
8801 -- initial expression.
8803 if Nkind (Exp) = N_Type_Conversion
8804 and then Nkind (Expression (Exp)) = N_Function_Call
8807 ("illegal context for call"
8808 & " to function with limited result", Exp);
8812 ("initialization of limited object requires aggregate "
8813 & "or function call", Exp);
8818 end Check_Initialization;
8820 ----------------------
8821 -- Check_Interfaces --
8822 ----------------------
8824 procedure Check_Interfaces (N : Node_Id; Def : Node_Id) is
8825 Parent_Type : constant Entity_Id := Etype (Defining_Identifier (N));
8828 Iface_Def : Node_Id;
8829 Iface_Typ : Entity_Id;
8830 Parent_Node : Node_Id;
8832 Is_Task : Boolean := False;
8833 -- Set True if parent type or any progenitor is a task interface
8835 Is_Protected : Boolean := False;
8836 -- Set True if parent type or any progenitor is a protected interface
8838 procedure Check_Ifaces (Iface_Def : Node_Id; Error_Node : Node_Id);
8839 -- Check that a progenitor is compatible with declaration.
8840 -- Error is posted on Error_Node.
8846 procedure Check_Ifaces (Iface_Def : Node_Id; Error_Node : Node_Id) is
8847 Iface_Id : constant Entity_Id :=
8848 Defining_Identifier (Parent (Iface_Def));
8852 if Nkind (N) = N_Private_Extension_Declaration then
8855 Type_Def := Type_Definition (N);
8858 if Is_Task_Interface (Iface_Id) then
8861 elsif Is_Protected_Interface (Iface_Id) then
8862 Is_Protected := True;
8865 if Is_Synchronized_Interface (Iface_Id) then
8867 -- A consequence of 3.9.4 (6/2) and 7.3 (7.2/2) is that a private
8868 -- extension derived from a synchronized interface must explicitly
8869 -- be declared synchronized, because the full view will be a
8870 -- synchronized type.
8872 if Nkind (N) = N_Private_Extension_Declaration then
8873 if not Synchronized_Present (N) then
8875 ("private extension of& must be explicitly synchronized",
8879 -- However, by 3.9.4(16/2), a full type that is a record extension
8880 -- is never allowed to derive from a synchronized interface (note
8881 -- that interfaces must be excluded from this check, because those
8882 -- are represented by derived type definitions in some cases).
8884 elsif Nkind (Type_Definition (N)) = N_Derived_Type_Definition
8885 and then not Interface_Present (Type_Definition (N))
8887 Error_Msg_N ("record extension cannot derive from synchronized"
8888 & " interface", Error_Node);
8892 -- Check that the characteristics of the progenitor are compatible
8893 -- with the explicit qualifier in the declaration.
8894 -- The check only applies to qualifiers that come from source.
8895 -- Limited_Present also appears in the declaration of corresponding
8896 -- records, and the check does not apply to them.
8898 if Limited_Present (Type_Def)
8900 Is_Concurrent_Record_Type (Defining_Identifier (N))
8902 if Is_Limited_Interface (Parent_Type)
8903 and then not Is_Limited_Interface (Iface_Id)
8906 ("progenitor& must be limited interface",
8907 Error_Node, Iface_Id);
8910 (Task_Present (Iface_Def)
8911 or else Protected_Present (Iface_Def)
8912 or else Synchronized_Present (Iface_Def))
8913 and then Nkind (N) /= N_Private_Extension_Declaration
8914 and then not Error_Posted (N)
8917 ("progenitor& must be limited interface",
8918 Error_Node, Iface_Id);
8921 -- Protected interfaces can only inherit from limited, synchronized
8922 -- or protected interfaces.
8924 elsif Nkind (N) = N_Full_Type_Declaration
8925 and then Protected_Present (Type_Def)
8927 if Limited_Present (Iface_Def)
8928 or else Synchronized_Present (Iface_Def)
8929 or else Protected_Present (Iface_Def)
8933 elsif Task_Present (Iface_Def) then
8934 Error_Msg_N ("(Ada 2005) protected interface cannot inherit"
8935 & " from task interface", Error_Node);
8938 Error_Msg_N ("(Ada 2005) protected interface cannot inherit"
8939 & " from non-limited interface", Error_Node);
8942 -- Ada 2005 (AI-345): Synchronized interfaces can only inherit from
8943 -- limited and synchronized.
8945 elsif Synchronized_Present (Type_Def) then
8946 if Limited_Present (Iface_Def)
8947 or else Synchronized_Present (Iface_Def)
8951 elsif Protected_Present (Iface_Def)
8952 and then Nkind (N) /= N_Private_Extension_Declaration
8954 Error_Msg_N ("(Ada 2005) synchronized interface cannot inherit"
8955 & " from protected interface", Error_Node);
8957 elsif Task_Present (Iface_Def)
8958 and then Nkind (N) /= N_Private_Extension_Declaration
8960 Error_Msg_N ("(Ada 2005) synchronized interface cannot inherit"
8961 & " from task interface", Error_Node);
8963 elsif not Is_Limited_Interface (Iface_Id) then
8964 Error_Msg_N ("(Ada 2005) synchronized interface cannot inherit"
8965 & " from non-limited interface", Error_Node);
8968 -- Ada 2005 (AI-345): Task interfaces can only inherit from limited,
8969 -- synchronized or task interfaces.
8971 elsif Nkind (N) = N_Full_Type_Declaration
8972 and then Task_Present (Type_Def)
8974 if Limited_Present (Iface_Def)
8975 or else Synchronized_Present (Iface_Def)
8976 or else Task_Present (Iface_Def)
8980 elsif Protected_Present (Iface_Def) then
8981 Error_Msg_N ("(Ada 2005) task interface cannot inherit from"
8982 & " protected interface", Error_Node);
8985 Error_Msg_N ("(Ada 2005) task interface cannot inherit from"
8986 & " non-limited interface", Error_Node);
8991 -- Start of processing for Check_Interfaces
8994 if Is_Interface (Parent_Type) then
8995 if Is_Task_Interface (Parent_Type) then
8998 elsif Is_Protected_Interface (Parent_Type) then
8999 Is_Protected := True;
9003 if Nkind (N) = N_Private_Extension_Declaration then
9005 -- Check that progenitors are compatible with declaration
9007 Iface := First (Interface_List (Def));
9008 while Present (Iface) loop
9009 Iface_Typ := Find_Type_Of_Subtype_Indic (Iface);
9011 Parent_Node := Parent (Base_Type (Iface_Typ));
9012 Iface_Def := Type_Definition (Parent_Node);
9014 if not Is_Interface (Iface_Typ) then
9015 Diagnose_Interface (Iface, Iface_Typ);
9018 Check_Ifaces (Iface_Def, Iface);
9024 if Is_Task and Is_Protected then
9026 ("type cannot derive from task and protected interface", N);
9032 -- Full type declaration of derived type.
9033 -- Check compatibility with parent if it is interface type
9035 if Nkind (Type_Definition (N)) = N_Derived_Type_Definition
9036 and then Is_Interface (Parent_Type)
9038 Parent_Node := Parent (Parent_Type);
9040 -- More detailed checks for interface varieties
9043 (Iface_Def => Type_Definition (Parent_Node),
9044 Error_Node => Subtype_Indication (Type_Definition (N)));
9047 Iface := First (Interface_List (Def));
9048 while Present (Iface) loop
9049 Iface_Typ := Find_Type_Of_Subtype_Indic (Iface);
9051 Parent_Node := Parent (Base_Type (Iface_Typ));
9052 Iface_Def := Type_Definition (Parent_Node);
9054 if not Is_Interface (Iface_Typ) then
9055 Diagnose_Interface (Iface, Iface_Typ);
9058 -- "The declaration of a specific descendant of an interface
9059 -- type freezes the interface type" RM 13.14
9061 Freeze_Before (N, Iface_Typ);
9062 Check_Ifaces (Iface_Def, Error_Node => Iface);
9068 if Is_Task and Is_Protected then
9070 ("type cannot derive from task and protected interface", N);
9072 end Check_Interfaces;
9074 ------------------------------------
9075 -- Check_Or_Process_Discriminants --
9076 ------------------------------------
9078 -- If an incomplete or private type declaration was already given for the
9079 -- type, the discriminants may have already been processed if they were
9080 -- present on the incomplete declaration. In this case a full conformance
9081 -- check is performed otherwise just process them.
9083 procedure Check_Or_Process_Discriminants
9086 Prev : Entity_Id := Empty)
9089 if Has_Discriminants (T) then
9091 -- Make the discriminants visible to component declarations
9098 D := First_Discriminant (T);
9099 while Present (D) loop
9100 Prev := Current_Entity (D);
9101 Set_Current_Entity (D);
9102 Set_Is_Immediately_Visible (D);
9103 Set_Homonym (D, Prev);
9105 -- Ada 2005 (AI-230): Access discriminant allowed in
9106 -- non-limited record types.
9108 if Ada_Version < Ada_05 then
9110 -- This restriction gets applied to the full type here. It
9111 -- has already been applied earlier to the partial view.
9113 Check_Access_Discriminant_Requires_Limited (Parent (D), N);
9116 Next_Discriminant (D);
9120 elsif Present (Discriminant_Specifications (N)) then
9121 Process_Discriminants (N, Prev);
9123 end Check_Or_Process_Discriminants;
9125 ----------------------
9126 -- Check_Real_Bound --
9127 ----------------------
9129 procedure Check_Real_Bound (Bound : Node_Id) is
9131 if not Is_Real_Type (Etype (Bound)) then
9133 ("bound in real type definition must be of real type", Bound);
9135 elsif not Is_OK_Static_Expression (Bound) then
9136 Flag_Non_Static_Expr
9137 ("non-static expression used for real type bound!", Bound);
9144 (Bound, Make_Real_Literal (Sloc (Bound), Ureal_0));
9146 Resolve (Bound, Standard_Float);
9147 end Check_Real_Bound;
9149 ------------------------------
9150 -- Complete_Private_Subtype --
9151 ------------------------------
9153 procedure Complete_Private_Subtype
9156 Full_Base : Entity_Id;
9157 Related_Nod : Node_Id)
9159 Save_Next_Entity : Entity_Id;
9160 Save_Homonym : Entity_Id;
9163 -- Set semantic attributes for (implicit) private subtype completion.
9164 -- If the full type has no discriminants, then it is a copy of the full
9165 -- view of the base. Otherwise, it is a subtype of the base with a
9166 -- possible discriminant constraint. Save and restore the original
9167 -- Next_Entity field of full to ensure that the calls to Copy_Node
9168 -- do not corrupt the entity chain.
9170 -- Note that the type of the full view is the same entity as the type of
9171 -- the partial view. In this fashion, the subtype has access to the
9172 -- correct view of the parent.
9174 Save_Next_Entity := Next_Entity (Full);
9175 Save_Homonym := Homonym (Priv);
9177 case Ekind (Full_Base) is
9178 when E_Record_Type |
9184 Copy_Node (Priv, Full);
9186 Set_Has_Discriminants (Full, Has_Discriminants (Full_Base));
9187 Set_First_Entity (Full, First_Entity (Full_Base));
9188 Set_Last_Entity (Full, Last_Entity (Full_Base));
9191 Copy_Node (Full_Base, Full);
9192 Set_Chars (Full, Chars (Priv));
9193 Conditional_Delay (Full, Priv);
9194 Set_Sloc (Full, Sloc (Priv));
9197 Set_Next_Entity (Full, Save_Next_Entity);
9198 Set_Homonym (Full, Save_Homonym);
9199 Set_Associated_Node_For_Itype (Full, Related_Nod);
9201 -- Set common attributes for all subtypes
9203 Set_Ekind (Full, Subtype_Kind (Ekind (Full_Base)));
9205 -- The Etype of the full view is inconsistent. Gigi needs to see the
9206 -- structural full view, which is what the current scheme gives:
9207 -- the Etype of the full view is the etype of the full base. However,
9208 -- if the full base is a derived type, the full view then looks like
9209 -- a subtype of the parent, not a subtype of the full base. If instead
9212 -- Set_Etype (Full, Full_Base);
9214 -- then we get inconsistencies in the front-end (confusion between
9215 -- views). Several outstanding bugs are related to this ???
9217 Set_Is_First_Subtype (Full, False);
9218 Set_Scope (Full, Scope (Priv));
9219 Set_Size_Info (Full, Full_Base);
9220 Set_RM_Size (Full, RM_Size (Full_Base));
9221 Set_Is_Itype (Full);
9223 -- A subtype of a private-type-without-discriminants, whose full-view
9224 -- has discriminants with default expressions, is not constrained!
9226 if not Has_Discriminants (Priv) then
9227 Set_Is_Constrained (Full, Is_Constrained (Full_Base));
9229 if Has_Discriminants (Full_Base) then
9230 Set_Discriminant_Constraint
9231 (Full, Discriminant_Constraint (Full_Base));
9233 -- The partial view may have been indefinite, the full view
9236 Set_Has_Unknown_Discriminants
9237 (Full, Has_Unknown_Discriminants (Full_Base));
9241 Set_First_Rep_Item (Full, First_Rep_Item (Full_Base));
9242 Set_Depends_On_Private (Full, Has_Private_Component (Full));
9244 -- Freeze the private subtype entity if its parent is delayed, and not
9245 -- already frozen. We skip this processing if the type is an anonymous
9246 -- subtype of a record component, or is the corresponding record of a
9247 -- protected type, since ???
9249 if not Is_Type (Scope (Full)) then
9250 Set_Has_Delayed_Freeze (Full,
9251 Has_Delayed_Freeze (Full_Base)
9252 and then (not Is_Frozen (Full_Base)));
9255 Set_Freeze_Node (Full, Empty);
9256 Set_Is_Frozen (Full, False);
9257 Set_Full_View (Priv, Full);
9259 if Has_Discriminants (Full) then
9260 Set_Stored_Constraint_From_Discriminant_Constraint (Full);
9261 Set_Stored_Constraint (Priv, Stored_Constraint (Full));
9263 if Has_Unknown_Discriminants (Full) then
9264 Set_Discriminant_Constraint (Full, No_Elist);
9268 if Ekind (Full_Base) = E_Record_Type
9269 and then Has_Discriminants (Full_Base)
9270 and then Has_Discriminants (Priv) -- might not, if errors
9271 and then not Has_Unknown_Discriminants (Priv)
9272 and then not Is_Empty_Elmt_List (Discriminant_Constraint (Priv))
9274 Create_Constrained_Components
9275 (Full, Related_Nod, Full_Base, Discriminant_Constraint (Priv));
9277 -- If the full base is itself derived from private, build a congruent
9278 -- subtype of its underlying type, for use by the back end. For a
9279 -- constrained record component, the declaration cannot be placed on
9280 -- the component list, but it must nevertheless be built an analyzed, to
9281 -- supply enough information for Gigi to compute the size of component.
9283 elsif Ekind (Full_Base) in Private_Kind
9284 and then Is_Derived_Type (Full_Base)
9285 and then Has_Discriminants (Full_Base)
9286 and then (Ekind (Current_Scope) /= E_Record_Subtype)
9288 if not Is_Itype (Priv)
9290 Nkind (Subtype_Indication (Parent (Priv))) = N_Subtype_Indication
9292 Build_Underlying_Full_View
9293 (Parent (Priv), Full, Etype (Full_Base));
9295 elsif Nkind (Related_Nod) = N_Component_Declaration then
9296 Build_Underlying_Full_View (Related_Nod, Full, Etype (Full_Base));
9299 elsif Is_Record_Type (Full_Base) then
9301 -- Show Full is simply a renaming of Full_Base
9303 Set_Cloned_Subtype (Full, Full_Base);
9306 -- It is unsafe to share to bounds of a scalar type, because the Itype
9307 -- is elaborated on demand, and if a bound is non-static then different
9308 -- orders of elaboration in different units will lead to different
9309 -- external symbols.
9311 if Is_Scalar_Type (Full_Base) then
9312 Set_Scalar_Range (Full,
9313 Make_Range (Sloc (Related_Nod),
9315 Duplicate_Subexpr_No_Checks (Type_Low_Bound (Full_Base)),
9317 Duplicate_Subexpr_No_Checks (Type_High_Bound (Full_Base))));
9319 -- This completion inherits the bounds of the full parent, but if
9320 -- the parent is an unconstrained floating point type, so is the
9323 if Is_Floating_Point_Type (Full_Base) then
9324 Set_Includes_Infinities
9325 (Scalar_Range (Full), Has_Infinities (Full_Base));
9329 -- ??? It seems that a lot of fields are missing that should be copied
9330 -- from Full_Base to Full. Here are some that are introduced in a
9331 -- non-disruptive way but a cleanup is necessary.
9333 if Is_Tagged_Type (Full_Base) then
9334 Set_Is_Tagged_Type (Full);
9335 Set_Primitive_Operations (Full, Primitive_Operations (Full_Base));
9336 Set_Class_Wide_Type (Full, Class_Wide_Type (Full_Base));
9338 -- If this is a subtype of a protected or task type, constrain its
9339 -- corresponding record, unless this is a subtype without constraints,
9340 -- i.e. a simple renaming as with an actual subtype in an instance.
9342 elsif Is_Concurrent_Type (Full_Base) then
9343 if Has_Discriminants (Full)
9344 and then Present (Corresponding_Record_Type (Full_Base))
9346 not Is_Empty_Elmt_List (Discriminant_Constraint (Full))
9348 Set_Corresponding_Record_Type (Full,
9349 Constrain_Corresponding_Record
9350 (Full, Corresponding_Record_Type (Full_Base),
9351 Related_Nod, Full_Base));
9354 Set_Corresponding_Record_Type (Full,
9355 Corresponding_Record_Type (Full_Base));
9358 end Complete_Private_Subtype;
9360 ----------------------------
9361 -- Constant_Redeclaration --
9362 ----------------------------
9364 procedure Constant_Redeclaration
9369 Prev : constant Entity_Id := Current_Entity_In_Scope (Id);
9370 Obj_Def : constant Node_Id := Object_Definition (N);
9373 procedure Check_Possible_Deferred_Completion
9374 (Prev_Id : Entity_Id;
9375 Prev_Obj_Def : Node_Id;
9376 Curr_Obj_Def : Node_Id);
9377 -- Determine whether the two object definitions describe the partial
9378 -- and the full view of a constrained deferred constant. Generate
9379 -- a subtype for the full view and verify that it statically matches
9380 -- the subtype of the partial view.
9382 procedure Check_Recursive_Declaration (Typ : Entity_Id);
9383 -- If deferred constant is an access type initialized with an allocator,
9384 -- check whether there is an illegal recursion in the definition,
9385 -- through a default value of some record subcomponent. This is normally
9386 -- detected when generating init procs, but requires this additional
9387 -- mechanism when expansion is disabled.
9389 ----------------------------------------
9390 -- Check_Possible_Deferred_Completion --
9391 ----------------------------------------
9393 procedure Check_Possible_Deferred_Completion
9394 (Prev_Id : Entity_Id;
9395 Prev_Obj_Def : Node_Id;
9396 Curr_Obj_Def : Node_Id)
9399 if Nkind (Prev_Obj_Def) = N_Subtype_Indication
9400 and then Present (Constraint (Prev_Obj_Def))
9401 and then Nkind (Curr_Obj_Def) = N_Subtype_Indication
9402 and then Present (Constraint (Curr_Obj_Def))
9405 Loc : constant Source_Ptr := Sloc (N);
9406 Def_Id : constant Entity_Id :=
9407 Make_Defining_Identifier (Loc,
9408 New_Internal_Name ('S'));
9409 Decl : constant Node_Id :=
9410 Make_Subtype_Declaration (Loc,
9411 Defining_Identifier =>
9413 Subtype_Indication =>
9414 Relocate_Node (Curr_Obj_Def));
9417 Insert_Before_And_Analyze (N, Decl);
9418 Set_Etype (Id, Def_Id);
9420 if not Subtypes_Statically_Match (Etype (Prev_Id), Def_Id) then
9421 Error_Msg_Sloc := Sloc (Prev_Id);
9422 Error_Msg_N ("subtype does not statically match deferred " &
9427 end Check_Possible_Deferred_Completion;
9429 ---------------------------------
9430 -- Check_Recursive_Declaration --
9431 ---------------------------------
9433 procedure Check_Recursive_Declaration (Typ : Entity_Id) is
9437 if Is_Record_Type (Typ) then
9438 Comp := First_Component (Typ);
9439 while Present (Comp) loop
9440 if Comes_From_Source (Comp) then
9441 if Present (Expression (Parent (Comp)))
9442 and then Is_Entity_Name (Expression (Parent (Comp)))
9443 and then Entity (Expression (Parent (Comp))) = Prev
9445 Error_Msg_Sloc := Sloc (Parent (Comp));
9447 ("illegal circularity with declaration for&#",
9451 elsif Is_Record_Type (Etype (Comp)) then
9452 Check_Recursive_Declaration (Etype (Comp));
9456 Next_Component (Comp);
9459 end Check_Recursive_Declaration;
9461 -- Start of processing for Constant_Redeclaration
9464 if Nkind (Parent (Prev)) = N_Object_Declaration then
9465 if Nkind (Object_Definition
9466 (Parent (Prev))) = N_Subtype_Indication
9468 -- Find type of new declaration. The constraints of the two
9469 -- views must match statically, but there is no point in
9470 -- creating an itype for the full view.
9472 if Nkind (Obj_Def) = N_Subtype_Indication then
9473 Find_Type (Subtype_Mark (Obj_Def));
9474 New_T := Entity (Subtype_Mark (Obj_Def));
9477 Find_Type (Obj_Def);
9478 New_T := Entity (Obj_Def);
9484 -- The full view may impose a constraint, even if the partial
9485 -- view does not, so construct the subtype.
9487 New_T := Find_Type_Of_Object (Obj_Def, N);
9492 -- Current declaration is illegal, diagnosed below in Enter_Name
9498 -- If previous full declaration exists, or if a homograph is present,
9499 -- let Enter_Name handle it, either with an error, or with the removal
9500 -- of an overridden implicit subprogram.
9502 if Ekind (Prev) /= E_Constant
9503 or else Present (Expression (Parent (Prev)))
9504 or else Present (Full_View (Prev))
9508 -- Verify that types of both declarations match, or else that both types
9509 -- are anonymous access types whose designated subtypes statically match
9510 -- (as allowed in Ada 2005 by AI-385).
9512 elsif Base_Type (Etype (Prev)) /= Base_Type (New_T)
9514 (Ekind (Etype (Prev)) /= E_Anonymous_Access_Type
9515 or else Ekind (Etype (New_T)) /= E_Anonymous_Access_Type
9516 or else Is_Access_Constant (Etype (New_T)) /=
9517 Is_Access_Constant (Etype (Prev))
9518 or else Can_Never_Be_Null (Etype (New_T)) /=
9519 Can_Never_Be_Null (Etype (Prev))
9520 or else Null_Exclusion_Present (Parent (Prev)) /=
9521 Null_Exclusion_Present (Parent (Id))
9522 or else not Subtypes_Statically_Match
9523 (Designated_Type (Etype (Prev)),
9524 Designated_Type (Etype (New_T))))
9526 Error_Msg_Sloc := Sloc (Prev);
9527 Error_Msg_N ("type does not match declaration#", N);
9528 Set_Full_View (Prev, Id);
9529 Set_Etype (Id, Any_Type);
9532 Null_Exclusion_Present (Parent (Prev))
9533 and then not Null_Exclusion_Present (N)
9535 Error_Msg_Sloc := Sloc (Prev);
9536 Error_Msg_N ("null-exclusion does not match declaration#", N);
9537 Set_Full_View (Prev, Id);
9538 Set_Etype (Id, Any_Type);
9540 -- If so, process the full constant declaration
9543 -- RM 7.4 (6): If the subtype defined by the subtype_indication in
9544 -- the deferred declaration is constrained, then the subtype defined
9545 -- by the subtype_indication in the full declaration shall match it
9548 Check_Possible_Deferred_Completion
9550 Prev_Obj_Def => Object_Definition (Parent (Prev)),
9551 Curr_Obj_Def => Obj_Def);
9553 Set_Full_View (Prev, Id);
9554 Set_Is_Public (Id, Is_Public (Prev));
9555 Set_Is_Internal (Id);
9556 Append_Entity (Id, Current_Scope);
9558 -- Check ALIASED present if present before (RM 7.4(7))
9560 if Is_Aliased (Prev)
9561 and then not Aliased_Present (N)
9563 Error_Msg_Sloc := Sloc (Prev);
9564 Error_Msg_N ("ALIASED required (see declaration#)", N);
9567 -- Check that placement is in private part and that the incomplete
9568 -- declaration appeared in the visible part.
9570 if Ekind (Current_Scope) = E_Package
9571 and then not In_Private_Part (Current_Scope)
9573 Error_Msg_Sloc := Sloc (Prev);
9574 Error_Msg_N ("full constant for declaration#"
9575 & " must be in private part", N);
9577 elsif Ekind (Current_Scope) = E_Package
9578 and then List_Containing (Parent (Prev))
9579 /= Visible_Declarations
9580 (Specification (Unit_Declaration_Node (Current_Scope)))
9583 ("deferred constant must be declared in visible part",
9587 if Is_Access_Type (T)
9588 and then Nkind (Expression (N)) = N_Allocator
9590 Check_Recursive_Declaration (Designated_Type (T));
9593 end Constant_Redeclaration;
9595 ----------------------
9596 -- Constrain_Access --
9597 ----------------------
9599 procedure Constrain_Access
9600 (Def_Id : in out Entity_Id;
9602 Related_Nod : Node_Id)
9604 T : constant Entity_Id := Entity (Subtype_Mark (S));
9605 Desig_Type : constant Entity_Id := Designated_Type (T);
9606 Desig_Subtype : Entity_Id := Create_Itype (E_Void, Related_Nod);
9607 Constraint_OK : Boolean := True;
9609 function Has_Defaulted_Discriminants (Typ : Entity_Id) return Boolean;
9610 -- Simple predicate to test for defaulted discriminants
9611 -- Shouldn't this be in sem_util???
9613 ---------------------------------
9614 -- Has_Defaulted_Discriminants --
9615 ---------------------------------
9617 function Has_Defaulted_Discriminants (Typ : Entity_Id) return Boolean is
9619 return Has_Discriminants (Typ)
9620 and then Present (First_Discriminant (Typ))
9622 (Discriminant_Default_Value (First_Discriminant (Typ)));
9623 end Has_Defaulted_Discriminants;
9625 -- Start of processing for Constrain_Access
9628 if Is_Array_Type (Desig_Type) then
9629 Constrain_Array (Desig_Subtype, S, Related_Nod, Def_Id, 'P');
9631 elsif (Is_Record_Type (Desig_Type)
9632 or else Is_Incomplete_Or_Private_Type (Desig_Type))
9633 and then not Is_Constrained (Desig_Type)
9635 -- ??? The following code is a temporary kludge to ignore a
9636 -- discriminant constraint on access type if it is constraining
9637 -- the current record. Avoid creating the implicit subtype of the
9638 -- record we are currently compiling since right now, we cannot
9639 -- handle these. For now, just return the access type itself.
9641 if Desig_Type = Current_Scope
9642 and then No (Def_Id)
9644 Set_Ekind (Desig_Subtype, E_Record_Subtype);
9645 Def_Id := Entity (Subtype_Mark (S));
9647 -- This call added to ensure that the constraint is analyzed
9648 -- (needed for a B test). Note that we still return early from
9649 -- this procedure to avoid recursive processing. ???
9651 Constrain_Discriminated_Type
9652 (Desig_Subtype, S, Related_Nod, For_Access => True);
9656 if (Ekind (T) = E_General_Access_Type
9657 or else Ada_Version >= Ada_05)
9658 and then Has_Private_Declaration (Desig_Type)
9659 and then In_Open_Scopes (Scope (Desig_Type))
9660 and then Has_Discriminants (Desig_Type)
9662 -- Enforce rule that the constraint is illegal if there is
9663 -- an unconstrained view of the designated type. This means
9664 -- that the partial view (either a private type declaration or
9665 -- a derivation from a private type) has no discriminants.
9666 -- (Defect Report 8652/0008, Technical Corrigendum 1, checked
9667 -- by ACATS B371001).
9669 -- Rule updated for Ada 2005: the private type is said to have
9670 -- a constrained partial view, given that objects of the type
9671 -- can be declared. Furthermore, the rule applies to all access
9672 -- types, unlike the rule concerning default discriminants.
9675 Pack : constant Node_Id :=
9676 Unit_Declaration_Node (Scope (Desig_Type));
9681 if Nkind (Pack) = N_Package_Declaration then
9682 Decls := Visible_Declarations (Specification (Pack));
9683 Decl := First (Decls);
9684 while Present (Decl) loop
9685 if (Nkind (Decl) = N_Private_Type_Declaration
9687 Chars (Defining_Identifier (Decl)) =
9691 (Nkind (Decl) = N_Full_Type_Declaration
9693 Chars (Defining_Identifier (Decl)) =
9695 and then Is_Derived_Type (Desig_Type)
9697 Has_Private_Declaration (Etype (Desig_Type)))
9699 if No (Discriminant_Specifications (Decl)) then
9701 ("cannot constrain general access type if " &
9702 "designated type has constrained partial view",
9715 Constrain_Discriminated_Type (Desig_Subtype, S, Related_Nod,
9716 For_Access => True);
9718 elsif (Is_Task_Type (Desig_Type)
9719 or else Is_Protected_Type (Desig_Type))
9720 and then not Is_Constrained (Desig_Type)
9722 Constrain_Concurrent
9723 (Desig_Subtype, S, Related_Nod, Desig_Type, ' ');
9726 Error_Msg_N ("invalid constraint on access type", S);
9727 Desig_Subtype := Desig_Type; -- Ignore invalid constraint.
9728 Constraint_OK := False;
9732 Def_Id := Create_Itype (E_Access_Subtype, Related_Nod);
9734 Set_Ekind (Def_Id, E_Access_Subtype);
9737 if Constraint_OK then
9738 Set_Etype (Def_Id, Base_Type (T));
9740 if Is_Private_Type (Desig_Type) then
9741 Prepare_Private_Subtype_Completion (Desig_Subtype, Related_Nod);
9744 Set_Etype (Def_Id, Any_Type);
9747 Set_Size_Info (Def_Id, T);
9748 Set_Is_Constrained (Def_Id, Constraint_OK);
9749 Set_Directly_Designated_Type (Def_Id, Desig_Subtype);
9750 Set_Depends_On_Private (Def_Id, Has_Private_Component (Def_Id));
9751 Set_Is_Access_Constant (Def_Id, Is_Access_Constant (T));
9753 Conditional_Delay (Def_Id, T);
9755 -- AI-363 : Subtypes of general access types whose designated types have
9756 -- default discriminants are disallowed. In instances, the rule has to
9757 -- be checked against the actual, of which T is the subtype. In a
9758 -- generic body, the rule is checked assuming that the actual type has
9759 -- defaulted discriminants.
9761 if Ada_Version >= Ada_05 or else Warn_On_Ada_2005_Compatibility then
9762 if Ekind (Base_Type (T)) = E_General_Access_Type
9763 and then Has_Defaulted_Discriminants (Desig_Type)
9765 if Ada_Version < Ada_05 then
9767 ("access subtype of general access type would not " &
9768 "be allowed in Ada 2005?", S);
9771 ("access subype of general access type not allowed", S);
9774 Error_Msg_N ("\discriminants have defaults", S);
9776 elsif Is_Access_Type (T)
9777 and then Is_Generic_Type (Desig_Type)
9778 and then Has_Discriminants (Desig_Type)
9779 and then In_Package_Body (Current_Scope)
9781 if Ada_Version < Ada_05 then
9783 ("access subtype would not be allowed in generic body " &
9787 ("access subtype not allowed in generic body", S);
9791 ("\designated type is a discriminated formal", S);
9794 end Constrain_Access;
9796 ---------------------
9797 -- Constrain_Array --
9798 ---------------------
9800 procedure Constrain_Array
9801 (Def_Id : in out Entity_Id;
9803 Related_Nod : Node_Id;
9804 Related_Id : Entity_Id;
9807 C : constant Node_Id := Constraint (SI);
9808 Number_Of_Constraints : Nat := 0;
9811 Constraint_OK : Boolean := True;
9814 T := Entity (Subtype_Mark (SI));
9816 if Ekind (T) in Access_Kind then
9817 T := Designated_Type (T);
9820 -- If an index constraint follows a subtype mark in a subtype indication
9821 -- then the type or subtype denoted by the subtype mark must not already
9822 -- impose an index constraint. The subtype mark must denote either an
9823 -- unconstrained array type or an access type whose designated type
9824 -- is such an array type... (RM 3.6.1)
9826 if Is_Constrained (T) then
9828 ("array type is already constrained", Subtype_Mark (SI));
9829 Constraint_OK := False;
9832 S := First (Constraints (C));
9833 while Present (S) loop
9834 Number_Of_Constraints := Number_Of_Constraints + 1;
9838 -- In either case, the index constraint must provide a discrete
9839 -- range for each index of the array type and the type of each
9840 -- discrete range must be the same as that of the corresponding
9841 -- index. (RM 3.6.1)
9843 if Number_Of_Constraints /= Number_Dimensions (T) then
9844 Error_Msg_NE ("incorrect number of index constraints for }", C, T);
9845 Constraint_OK := False;
9848 S := First (Constraints (C));
9849 Index := First_Index (T);
9852 -- Apply constraints to each index type
9854 for J in 1 .. Number_Of_Constraints loop
9855 Constrain_Index (Index, S, Related_Nod, Related_Id, Suffix, J);
9865 Create_Itype (E_Array_Subtype, Related_Nod, Related_Id, Suffix);
9866 Set_Parent (Def_Id, Related_Nod);
9869 Set_Ekind (Def_Id, E_Array_Subtype);
9872 Set_Size_Info (Def_Id, (T));
9873 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
9874 Set_Etype (Def_Id, Base_Type (T));
9876 if Constraint_OK then
9877 Set_First_Index (Def_Id, First (Constraints (C)));
9879 Set_First_Index (Def_Id, First_Index (T));
9882 Set_Is_Constrained (Def_Id, True);
9883 Set_Is_Aliased (Def_Id, Is_Aliased (T));
9884 Set_Depends_On_Private (Def_Id, Has_Private_Component (Def_Id));
9886 Set_Is_Private_Composite (Def_Id, Is_Private_Composite (T));
9887 Set_Is_Limited_Composite (Def_Id, Is_Limited_Composite (T));
9889 -- A subtype does not inherit the packed_array_type of is parent. We
9890 -- need to initialize the attribute because if Def_Id is previously
9891 -- analyzed through a limited_with clause, it will have the attributes
9892 -- of an incomplete type, one of which is an Elist that overlaps the
9893 -- Packed_Array_Type field.
9895 Set_Packed_Array_Type (Def_Id, Empty);
9897 -- Build a freeze node if parent still needs one. Also make sure that
9898 -- the Depends_On_Private status is set because the subtype will need
9899 -- reprocessing at the time the base type does, and also we must set a
9900 -- conditional delay.
9902 Set_Depends_On_Private (Def_Id, Depends_On_Private (T));
9903 Conditional_Delay (Def_Id, T);
9904 end Constrain_Array;
9906 ------------------------------
9907 -- Constrain_Component_Type --
9908 ------------------------------
9910 function Constrain_Component_Type
9912 Constrained_Typ : Entity_Id;
9913 Related_Node : Node_Id;
9915 Constraints : Elist_Id) return Entity_Id
9917 Loc : constant Source_Ptr := Sloc (Constrained_Typ);
9918 Compon_Type : constant Entity_Id := Etype (Comp);
9920 function Build_Constrained_Array_Type
9921 (Old_Type : Entity_Id) return Entity_Id;
9922 -- If Old_Type is an array type, one of whose indices is constrained
9923 -- by a discriminant, build an Itype whose constraint replaces the
9924 -- discriminant with its value in the constraint.
9926 function Build_Constrained_Discriminated_Type
9927 (Old_Type : Entity_Id) return Entity_Id;
9928 -- Ditto for record components
9930 function Build_Constrained_Access_Type
9931 (Old_Type : Entity_Id) return Entity_Id;
9932 -- Ditto for access types. Makes use of previous two functions, to
9933 -- constrain designated type.
9935 function Build_Subtype (T : Entity_Id; C : List_Id) return Entity_Id;
9936 -- T is an array or discriminated type, C is a list of constraints
9937 -- that apply to T. This routine builds the constrained subtype.
9939 function Is_Discriminant (Expr : Node_Id) return Boolean;
9940 -- Returns True if Expr is a discriminant
9942 function Get_Discr_Value (Discrim : Entity_Id) return Node_Id;
9943 -- Find the value of discriminant Discrim in Constraint
9945 -----------------------------------
9946 -- Build_Constrained_Access_Type --
9947 -----------------------------------
9949 function Build_Constrained_Access_Type
9950 (Old_Type : Entity_Id) return Entity_Id
9952 Desig_Type : constant Entity_Id := Designated_Type (Old_Type);
9954 Desig_Subtype : Entity_Id;
9958 -- if the original access type was not embedded in the enclosing
9959 -- type definition, there is no need to produce a new access
9960 -- subtype. In fact every access type with an explicit constraint
9961 -- generates an itype whose scope is the enclosing record.
9963 if not Is_Type (Scope (Old_Type)) then
9966 elsif Is_Array_Type (Desig_Type) then
9967 Desig_Subtype := Build_Constrained_Array_Type (Desig_Type);
9969 elsif Has_Discriminants (Desig_Type) then
9971 -- This may be an access type to an enclosing record type for
9972 -- which we are constructing the constrained components. Return
9973 -- the enclosing record subtype. This is not always correct,
9974 -- but avoids infinite recursion. ???
9976 Desig_Subtype := Any_Type;
9978 for J in reverse 0 .. Scope_Stack.Last loop
9979 Scop := Scope_Stack.Table (J).Entity;
9982 and then Base_Type (Scop) = Base_Type (Desig_Type)
9984 Desig_Subtype := Scop;
9987 exit when not Is_Type (Scop);
9990 if Desig_Subtype = Any_Type then
9992 Build_Constrained_Discriminated_Type (Desig_Type);
9999 if Desig_Subtype /= Desig_Type then
10001 -- The Related_Node better be here or else we won't be able
10002 -- to attach new itypes to a node in the tree.
10004 pragma Assert (Present (Related_Node));
10006 Itype := Create_Itype (E_Access_Subtype, Related_Node);
10008 Set_Etype (Itype, Base_Type (Old_Type));
10009 Set_Size_Info (Itype, (Old_Type));
10010 Set_Directly_Designated_Type (Itype, Desig_Subtype);
10011 Set_Depends_On_Private (Itype, Has_Private_Component
10013 Set_Is_Access_Constant (Itype, Is_Access_Constant
10016 -- The new itype needs freezing when it depends on a not frozen
10017 -- type and the enclosing subtype needs freezing.
10019 if Has_Delayed_Freeze (Constrained_Typ)
10020 and then not Is_Frozen (Constrained_Typ)
10022 Conditional_Delay (Itype, Base_Type (Old_Type));
10030 end Build_Constrained_Access_Type;
10032 ----------------------------------
10033 -- Build_Constrained_Array_Type --
10034 ----------------------------------
10036 function Build_Constrained_Array_Type
10037 (Old_Type : Entity_Id) return Entity_Id
10041 Old_Index : Node_Id;
10042 Range_Node : Node_Id;
10043 Constr_List : List_Id;
10045 Need_To_Create_Itype : Boolean := False;
10048 Old_Index := First_Index (Old_Type);
10049 while Present (Old_Index) loop
10050 Get_Index_Bounds (Old_Index, Lo_Expr, Hi_Expr);
10052 if Is_Discriminant (Lo_Expr)
10053 or else Is_Discriminant (Hi_Expr)
10055 Need_To_Create_Itype := True;
10058 Next_Index (Old_Index);
10061 if Need_To_Create_Itype then
10062 Constr_List := New_List;
10064 Old_Index := First_Index (Old_Type);
10065 while Present (Old_Index) loop
10066 Get_Index_Bounds (Old_Index, Lo_Expr, Hi_Expr);
10068 if Is_Discriminant (Lo_Expr) then
10069 Lo_Expr := Get_Discr_Value (Lo_Expr);
10072 if Is_Discriminant (Hi_Expr) then
10073 Hi_Expr := Get_Discr_Value (Hi_Expr);
10078 (Loc, New_Copy_Tree (Lo_Expr), New_Copy_Tree (Hi_Expr));
10080 Append (Range_Node, To => Constr_List);
10082 Next_Index (Old_Index);
10085 return Build_Subtype (Old_Type, Constr_List);
10090 end Build_Constrained_Array_Type;
10092 ------------------------------------------
10093 -- Build_Constrained_Discriminated_Type --
10094 ------------------------------------------
10096 function Build_Constrained_Discriminated_Type
10097 (Old_Type : Entity_Id) return Entity_Id
10100 Constr_List : List_Id;
10101 Old_Constraint : Elmt_Id;
10103 Need_To_Create_Itype : Boolean := False;
10106 Old_Constraint := First_Elmt (Discriminant_Constraint (Old_Type));
10107 while Present (Old_Constraint) loop
10108 Expr := Node (Old_Constraint);
10110 if Is_Discriminant (Expr) then
10111 Need_To_Create_Itype := True;
10114 Next_Elmt (Old_Constraint);
10117 if Need_To_Create_Itype then
10118 Constr_List := New_List;
10120 Old_Constraint := First_Elmt (Discriminant_Constraint (Old_Type));
10121 while Present (Old_Constraint) loop
10122 Expr := Node (Old_Constraint);
10124 if Is_Discriminant (Expr) then
10125 Expr := Get_Discr_Value (Expr);
10128 Append (New_Copy_Tree (Expr), To => Constr_List);
10130 Next_Elmt (Old_Constraint);
10133 return Build_Subtype (Old_Type, Constr_List);
10138 end Build_Constrained_Discriminated_Type;
10140 -------------------
10141 -- Build_Subtype --
10142 -------------------
10144 function Build_Subtype (T : Entity_Id; C : List_Id) return Entity_Id is
10146 Subtyp_Decl : Node_Id;
10147 Def_Id : Entity_Id;
10148 Btyp : Entity_Id := Base_Type (T);
10151 -- The Related_Node better be here or else we won't be able to
10152 -- attach new itypes to a node in the tree.
10154 pragma Assert (Present (Related_Node));
10156 -- If the view of the component's type is incomplete or private
10157 -- with unknown discriminants, then the constraint must be applied
10158 -- to the full type.
10160 if Has_Unknown_Discriminants (Btyp)
10161 and then Present (Underlying_Type (Btyp))
10163 Btyp := Underlying_Type (Btyp);
10167 Make_Subtype_Indication (Loc,
10168 Subtype_Mark => New_Occurrence_Of (Btyp, Loc),
10169 Constraint => Make_Index_Or_Discriminant_Constraint (Loc, C));
10171 Def_Id := Create_Itype (Ekind (T), Related_Node);
10174 Make_Subtype_Declaration (Loc,
10175 Defining_Identifier => Def_Id,
10176 Subtype_Indication => Indic);
10178 Set_Parent (Subtyp_Decl, Parent (Related_Node));
10180 -- Itypes must be analyzed with checks off (see package Itypes)
10182 Analyze (Subtyp_Decl, Suppress => All_Checks);
10187 ---------------------
10188 -- Get_Discr_Value --
10189 ---------------------
10191 function Get_Discr_Value (Discrim : Entity_Id) return Node_Id is
10196 -- The discriminant may be declared for the type, in which case we
10197 -- find it by iterating over the list of discriminants. If the
10198 -- discriminant is inherited from a parent type, it appears as the
10199 -- corresponding discriminant of the current type. This will be the
10200 -- case when constraining an inherited component whose constraint is
10201 -- given by a discriminant of the parent.
10203 D := First_Discriminant (Typ);
10204 E := First_Elmt (Constraints);
10206 while Present (D) loop
10207 if D = Entity (Discrim)
10208 or else D = CR_Discriminant (Entity (Discrim))
10209 or else Corresponding_Discriminant (D) = Entity (Discrim)
10214 Next_Discriminant (D);
10218 -- The corresponding_Discriminant mechanism is incomplete, because
10219 -- the correspondence between new and old discriminants is not one
10220 -- to one: one new discriminant can constrain several old ones. In
10221 -- that case, scan sequentially the stored_constraint, the list of
10222 -- discriminants of the parents, and the constraints.
10223 -- Previous code checked for the present of the Stored_Constraint
10224 -- list for the derived type, but did not use it at all. Should it
10225 -- be present when the component is a discriminated task type?
10227 if Is_Derived_Type (Typ)
10228 and then Scope (Entity (Discrim)) = Etype (Typ)
10230 D := First_Discriminant (Etype (Typ));
10231 E := First_Elmt (Constraints);
10232 while Present (D) loop
10233 if D = Entity (Discrim) then
10237 Next_Discriminant (D);
10242 -- Something is wrong if we did not find the value
10244 raise Program_Error;
10245 end Get_Discr_Value;
10247 ---------------------
10248 -- Is_Discriminant --
10249 ---------------------
10251 function Is_Discriminant (Expr : Node_Id) return Boolean is
10252 Discrim_Scope : Entity_Id;
10255 if Denotes_Discriminant (Expr) then
10256 Discrim_Scope := Scope (Entity (Expr));
10258 -- Either we have a reference to one of Typ's discriminants,
10260 pragma Assert (Discrim_Scope = Typ
10262 -- or to the discriminants of the parent type, in the case
10263 -- of a derivation of a tagged type with variants.
10265 or else Discrim_Scope = Etype (Typ)
10266 or else Full_View (Discrim_Scope) = Etype (Typ)
10268 -- or same as above for the case where the discriminants
10269 -- were declared in Typ's private view.
10271 or else (Is_Private_Type (Discrim_Scope)
10272 and then Chars (Discrim_Scope) = Chars (Typ))
10274 -- or else we are deriving from the full view and the
10275 -- discriminant is declared in the private entity.
10277 or else (Is_Private_Type (Typ)
10278 and then Chars (Discrim_Scope) = Chars (Typ))
10280 -- Or we are constrained the corresponding record of a
10281 -- synchronized type that completes a private declaration.
10283 or else (Is_Concurrent_Record_Type (Typ)
10285 Corresponding_Concurrent_Type (Typ) = Discrim_Scope)
10287 -- or we have a class-wide type, in which case make sure the
10288 -- discriminant found belongs to the root type.
10290 or else (Is_Class_Wide_Type (Typ)
10291 and then Etype (Typ) = Discrim_Scope));
10296 -- In all other cases we have something wrong
10299 end Is_Discriminant;
10301 -- Start of processing for Constrain_Component_Type
10304 if Nkind (Parent (Comp)) = N_Component_Declaration
10305 and then Comes_From_Source (Parent (Comp))
10306 and then Comes_From_Source
10307 (Subtype_Indication (Component_Definition (Parent (Comp))))
10310 (Subtype_Indication (Component_Definition (Parent (Comp))))
10312 return Compon_Type;
10314 elsif Is_Array_Type (Compon_Type) then
10315 return Build_Constrained_Array_Type (Compon_Type);
10317 elsif Has_Discriminants (Compon_Type) then
10318 return Build_Constrained_Discriminated_Type (Compon_Type);
10320 elsif Is_Access_Type (Compon_Type) then
10321 return Build_Constrained_Access_Type (Compon_Type);
10324 return Compon_Type;
10326 end Constrain_Component_Type;
10328 --------------------------
10329 -- Constrain_Concurrent --
10330 --------------------------
10332 -- For concurrent types, the associated record value type carries the same
10333 -- discriminants, so when we constrain a concurrent type, we must constrain
10334 -- the corresponding record type as well.
10336 procedure Constrain_Concurrent
10337 (Def_Id : in out Entity_Id;
10339 Related_Nod : Node_Id;
10340 Related_Id : Entity_Id;
10341 Suffix : Character)
10343 T_Ent : Entity_Id := Entity (Subtype_Mark (SI));
10347 if Ekind (T_Ent) in Access_Kind then
10348 T_Ent := Designated_Type (T_Ent);
10351 T_Val := Corresponding_Record_Type (T_Ent);
10353 if Present (T_Val) then
10355 if No (Def_Id) then
10356 Def_Id := Create_Itype (E_Void, Related_Nod, Related_Id, Suffix);
10359 Constrain_Discriminated_Type (Def_Id, SI, Related_Nod);
10361 Set_Depends_On_Private (Def_Id, Has_Private_Component (Def_Id));
10362 Set_Corresponding_Record_Type (Def_Id,
10363 Constrain_Corresponding_Record
10364 (Def_Id, T_Val, Related_Nod, Related_Id));
10367 -- If there is no associated record, expansion is disabled and this
10368 -- is a generic context. Create a subtype in any case, so that
10369 -- semantic analysis can proceed.
10371 if No (Def_Id) then
10372 Def_Id := Create_Itype (E_Void, Related_Nod, Related_Id, Suffix);
10375 Constrain_Discriminated_Type (Def_Id, SI, Related_Nod);
10377 end Constrain_Concurrent;
10379 ------------------------------------
10380 -- Constrain_Corresponding_Record --
10381 ------------------------------------
10383 function Constrain_Corresponding_Record
10384 (Prot_Subt : Entity_Id;
10385 Corr_Rec : Entity_Id;
10386 Related_Nod : Node_Id;
10387 Related_Id : Entity_Id) return Entity_Id
10389 T_Sub : constant Entity_Id :=
10390 Create_Itype (E_Record_Subtype, Related_Nod, Related_Id, 'V');
10393 Set_Etype (T_Sub, Corr_Rec);
10394 Set_Has_Discriminants (T_Sub, Has_Discriminants (Prot_Subt));
10395 Set_Is_Constrained (T_Sub, True);
10396 Set_First_Entity (T_Sub, First_Entity (Corr_Rec));
10397 Set_Last_Entity (T_Sub, Last_Entity (Corr_Rec));
10399 -- As elsewhere, we do not want to create a freeze node for this itype
10400 -- if it is created for a constrained component of an enclosing record
10401 -- because references to outer discriminants will appear out of scope.
10403 if Ekind (Scope (Prot_Subt)) /= E_Record_Type then
10404 Conditional_Delay (T_Sub, Corr_Rec);
10406 Set_Is_Frozen (T_Sub);
10409 if Has_Discriminants (Prot_Subt) then -- False only if errors.
10410 Set_Discriminant_Constraint
10411 (T_Sub, Discriminant_Constraint (Prot_Subt));
10412 Set_Stored_Constraint_From_Discriminant_Constraint (T_Sub);
10413 Create_Constrained_Components
10414 (T_Sub, Related_Nod, Corr_Rec, Discriminant_Constraint (T_Sub));
10417 Set_Depends_On_Private (T_Sub, Has_Private_Component (T_Sub));
10420 end Constrain_Corresponding_Record;
10422 -----------------------
10423 -- Constrain_Decimal --
10424 -----------------------
10426 procedure Constrain_Decimal (Def_Id : Node_Id; S : Node_Id) is
10427 T : constant Entity_Id := Entity (Subtype_Mark (S));
10428 C : constant Node_Id := Constraint (S);
10429 Loc : constant Source_Ptr := Sloc (C);
10430 Range_Expr : Node_Id;
10431 Digits_Expr : Node_Id;
10436 Set_Ekind (Def_Id, E_Decimal_Fixed_Point_Subtype);
10438 if Nkind (C) = N_Range_Constraint then
10439 Range_Expr := Range_Expression (C);
10440 Digits_Val := Digits_Value (T);
10443 pragma Assert (Nkind (C) = N_Digits_Constraint);
10444 Digits_Expr := Digits_Expression (C);
10445 Analyze_And_Resolve (Digits_Expr, Any_Integer);
10447 Check_Digits_Expression (Digits_Expr);
10448 Digits_Val := Expr_Value (Digits_Expr);
10450 if Digits_Val > Digits_Value (T) then
10452 ("digits expression is incompatible with subtype", C);
10453 Digits_Val := Digits_Value (T);
10456 if Present (Range_Constraint (C)) then
10457 Range_Expr := Range_Expression (Range_Constraint (C));
10459 Range_Expr := Empty;
10463 Set_Etype (Def_Id, Base_Type (T));
10464 Set_Size_Info (Def_Id, (T));
10465 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
10466 Set_Delta_Value (Def_Id, Delta_Value (T));
10467 Set_Scale_Value (Def_Id, Scale_Value (T));
10468 Set_Small_Value (Def_Id, Small_Value (T));
10469 Set_Machine_Radix_10 (Def_Id, Machine_Radix_10 (T));
10470 Set_Digits_Value (Def_Id, Digits_Val);
10472 -- Manufacture range from given digits value if no range present
10474 if No (Range_Expr) then
10475 Bound_Val := (Ureal_10 ** Digits_Val - Ureal_1) * Small_Value (T);
10479 Convert_To (T, Make_Real_Literal (Loc, (-Bound_Val))),
10481 Convert_To (T, Make_Real_Literal (Loc, Bound_Val)));
10484 Set_Scalar_Range_For_Subtype (Def_Id, Range_Expr, T);
10485 Set_Discrete_RM_Size (Def_Id);
10487 -- Unconditionally delay the freeze, since we cannot set size
10488 -- information in all cases correctly until the freeze point.
10490 Set_Has_Delayed_Freeze (Def_Id);
10491 end Constrain_Decimal;
10493 ----------------------------------
10494 -- Constrain_Discriminated_Type --
10495 ----------------------------------
10497 procedure Constrain_Discriminated_Type
10498 (Def_Id : Entity_Id;
10500 Related_Nod : Node_Id;
10501 For_Access : Boolean := False)
10503 E : constant Entity_Id := Entity (Subtype_Mark (S));
10506 Elist : Elist_Id := New_Elmt_List;
10508 procedure Fixup_Bad_Constraint;
10509 -- This is called after finding a bad constraint, and after having
10510 -- posted an appropriate error message. The mission is to leave the
10511 -- entity T in as reasonable state as possible!
10513 --------------------------
10514 -- Fixup_Bad_Constraint --
10515 --------------------------
10517 procedure Fixup_Bad_Constraint is
10519 -- Set a reasonable Ekind for the entity. For an incomplete type,
10520 -- we can't do much, but for other types, we can set the proper
10521 -- corresponding subtype kind.
10523 if Ekind (T) = E_Incomplete_Type then
10524 Set_Ekind (Def_Id, Ekind (T));
10526 Set_Ekind (Def_Id, Subtype_Kind (Ekind (T)));
10529 -- Set Etype to the known type, to reduce chances of cascaded errors
10531 Set_Etype (Def_Id, E);
10532 Set_Error_Posted (Def_Id);
10533 end Fixup_Bad_Constraint;
10535 -- Start of processing for Constrain_Discriminated_Type
10538 C := Constraint (S);
10540 -- A discriminant constraint is only allowed in a subtype indication,
10541 -- after a subtype mark. This subtype mark must denote either a type
10542 -- with discriminants, or an access type whose designated type is a
10543 -- type with discriminants. A discriminant constraint specifies the
10544 -- values of these discriminants (RM 3.7.2(5)).
10546 T := Base_Type (Entity (Subtype_Mark (S)));
10548 if Ekind (T) in Access_Kind then
10549 T := Designated_Type (T);
10552 -- Ada 2005 (AI-412): Constrained incomplete subtypes are illegal.
10553 -- Avoid generating an error for access-to-incomplete subtypes.
10555 if Ada_Version >= Ada_05
10556 and then Ekind (T) = E_Incomplete_Type
10557 and then Nkind (Parent (S)) = N_Subtype_Declaration
10558 and then not Is_Itype (Def_Id)
10560 -- A little sanity check, emit an error message if the type
10561 -- has discriminants to begin with. Type T may be a regular
10562 -- incomplete type or imported via a limited with clause.
10564 if Has_Discriminants (T)
10566 (From_With_Type (T)
10567 and then Present (Non_Limited_View (T))
10568 and then Nkind (Parent (Non_Limited_View (T))) =
10569 N_Full_Type_Declaration
10570 and then Present (Discriminant_Specifications
10571 (Parent (Non_Limited_View (T)))))
10574 ("(Ada 2005) incomplete subtype may not be constrained", C);
10577 ("invalid constraint: type has no discriminant", C);
10580 Fixup_Bad_Constraint;
10583 -- Check that the type has visible discriminants. The type may be
10584 -- a private type with unknown discriminants whose full view has
10585 -- discriminants which are invisible.
10587 elsif not Has_Discriminants (T)
10589 (Has_Unknown_Discriminants (T)
10590 and then Is_Private_Type (T))
10592 Error_Msg_N ("invalid constraint: type has no discriminant", C);
10593 Fixup_Bad_Constraint;
10596 elsif Is_Constrained (E)
10597 or else (Ekind (E) = E_Class_Wide_Subtype
10598 and then Present (Discriminant_Constraint (E)))
10600 Error_Msg_N ("type is already constrained", Subtype_Mark (S));
10601 Fixup_Bad_Constraint;
10605 -- T may be an unconstrained subtype (e.g. a generic actual).
10606 -- Constraint applies to the base type.
10608 T := Base_Type (T);
10610 Elist := Build_Discriminant_Constraints (T, S);
10612 -- If the list returned was empty we had an error in building the
10613 -- discriminant constraint. We have also already signalled an error
10614 -- in the incomplete type case
10616 if Is_Empty_Elmt_List (Elist) then
10617 Fixup_Bad_Constraint;
10621 Build_Discriminated_Subtype (T, Def_Id, Elist, Related_Nod, For_Access);
10622 end Constrain_Discriminated_Type;
10624 ---------------------------
10625 -- Constrain_Enumeration --
10626 ---------------------------
10628 procedure Constrain_Enumeration (Def_Id : Node_Id; S : Node_Id) is
10629 T : constant Entity_Id := Entity (Subtype_Mark (S));
10630 C : constant Node_Id := Constraint (S);
10633 Set_Ekind (Def_Id, E_Enumeration_Subtype);
10635 Set_First_Literal (Def_Id, First_Literal (Base_Type (T)));
10637 Set_Etype (Def_Id, Base_Type (T));
10638 Set_Size_Info (Def_Id, (T));
10639 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
10640 Set_Is_Character_Type (Def_Id, Is_Character_Type (T));
10642 Set_Scalar_Range_For_Subtype (Def_Id, Range_Expression (C), T);
10644 Set_Discrete_RM_Size (Def_Id);
10645 end Constrain_Enumeration;
10647 ----------------------
10648 -- Constrain_Float --
10649 ----------------------
10651 procedure Constrain_Float (Def_Id : Node_Id; S : Node_Id) is
10652 T : constant Entity_Id := Entity (Subtype_Mark (S));
10658 Set_Ekind (Def_Id, E_Floating_Point_Subtype);
10660 Set_Etype (Def_Id, Base_Type (T));
10661 Set_Size_Info (Def_Id, (T));
10662 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
10664 -- Process the constraint
10666 C := Constraint (S);
10668 -- Digits constraint present
10670 if Nkind (C) = N_Digits_Constraint then
10671 Check_Restriction (No_Obsolescent_Features, C);
10673 if Warn_On_Obsolescent_Feature then
10675 ("subtype digits constraint is an " &
10676 "obsolescent feature (RM J.3(8))?", C);
10679 D := Digits_Expression (C);
10680 Analyze_And_Resolve (D, Any_Integer);
10681 Check_Digits_Expression (D);
10682 Set_Digits_Value (Def_Id, Expr_Value (D));
10684 -- Check that digits value is in range. Obviously we can do this
10685 -- at compile time, but it is strictly a runtime check, and of
10686 -- course there is an ACVC test that checks this!
10688 if Digits_Value (Def_Id) > Digits_Value (T) then
10689 Error_Msg_Uint_1 := Digits_Value (T);
10690 Error_Msg_N ("?digits value is too large, maximum is ^", D);
10692 Make_Raise_Constraint_Error (Sloc (D),
10693 Reason => CE_Range_Check_Failed);
10694 Insert_Action (Declaration_Node (Def_Id), Rais);
10697 C := Range_Constraint (C);
10699 -- No digits constraint present
10702 Set_Digits_Value (Def_Id, Digits_Value (T));
10705 -- Range constraint present
10707 if Nkind (C) = N_Range_Constraint then
10708 Set_Scalar_Range_For_Subtype (Def_Id, Range_Expression (C), T);
10710 -- No range constraint present
10713 pragma Assert (No (C));
10714 Set_Scalar_Range (Def_Id, Scalar_Range (T));
10717 Set_Is_Constrained (Def_Id);
10718 end Constrain_Float;
10720 ---------------------
10721 -- Constrain_Index --
10722 ---------------------
10724 procedure Constrain_Index
10727 Related_Nod : Node_Id;
10728 Related_Id : Entity_Id;
10729 Suffix : Character;
10730 Suffix_Index : Nat)
10732 Def_Id : Entity_Id;
10733 R : Node_Id := Empty;
10734 T : constant Entity_Id := Etype (Index);
10737 if Nkind (S) = N_Range
10739 (Nkind (S) = N_Attribute_Reference
10740 and then Attribute_Name (S) = Name_Range)
10742 -- A Range attribute will transformed into N_Range by Resolve
10748 Process_Range_Expr_In_Decl (R, T, Empty_List);
10750 if not Error_Posted (S)
10752 (Nkind (S) /= N_Range
10753 or else not Covers (T, (Etype (Low_Bound (S))))
10754 or else not Covers (T, (Etype (High_Bound (S)))))
10756 if Base_Type (T) /= Any_Type
10757 and then Etype (Low_Bound (S)) /= Any_Type
10758 and then Etype (High_Bound (S)) /= Any_Type
10760 Error_Msg_N ("range expected", S);
10764 elsif Nkind (S) = N_Subtype_Indication then
10766 -- The parser has verified that this is a discrete indication
10768 Resolve_Discrete_Subtype_Indication (S, T);
10769 R := Range_Expression (Constraint (S));
10771 elsif Nkind (S) = N_Discriminant_Association then
10773 -- Syntactically valid in subtype indication
10775 Error_Msg_N ("invalid index constraint", S);
10776 Rewrite (S, New_Occurrence_Of (T, Sloc (S)));
10779 -- Subtype_Mark case, no anonymous subtypes to construct
10784 if Is_Entity_Name (S) then
10785 if not Is_Type (Entity (S)) then
10786 Error_Msg_N ("expect subtype mark for index constraint", S);
10788 elsif Base_Type (Entity (S)) /= Base_Type (T) then
10789 Wrong_Type (S, Base_Type (T));
10795 Error_Msg_N ("invalid index constraint", S);
10796 Rewrite (S, New_Occurrence_Of (T, Sloc (S)));
10802 Create_Itype (E_Void, Related_Nod, Related_Id, Suffix, Suffix_Index);
10804 Set_Etype (Def_Id, Base_Type (T));
10806 if Is_Modular_Integer_Type (T) then
10807 Set_Ekind (Def_Id, E_Modular_Integer_Subtype);
10809 elsif Is_Integer_Type (T) then
10810 Set_Ekind (Def_Id, E_Signed_Integer_Subtype);
10813 Set_Ekind (Def_Id, E_Enumeration_Subtype);
10814 Set_Is_Character_Type (Def_Id, Is_Character_Type (T));
10817 Set_Size_Info (Def_Id, (T));
10818 Set_RM_Size (Def_Id, RM_Size (T));
10819 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
10821 Set_Scalar_Range (Def_Id, R);
10823 Set_Etype (S, Def_Id);
10824 Set_Discrete_RM_Size (Def_Id);
10825 end Constrain_Index;
10827 -----------------------
10828 -- Constrain_Integer --
10829 -----------------------
10831 procedure Constrain_Integer (Def_Id : Node_Id; S : Node_Id) is
10832 T : constant Entity_Id := Entity (Subtype_Mark (S));
10833 C : constant Node_Id := Constraint (S);
10836 Set_Scalar_Range_For_Subtype (Def_Id, Range_Expression (C), T);
10838 if Is_Modular_Integer_Type (T) then
10839 Set_Ekind (Def_Id, E_Modular_Integer_Subtype);
10841 Set_Ekind (Def_Id, E_Signed_Integer_Subtype);
10844 Set_Etype (Def_Id, Base_Type (T));
10845 Set_Size_Info (Def_Id, (T));
10846 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
10847 Set_Discrete_RM_Size (Def_Id);
10848 end Constrain_Integer;
10850 ------------------------------
10851 -- Constrain_Ordinary_Fixed --
10852 ------------------------------
10854 procedure Constrain_Ordinary_Fixed (Def_Id : Node_Id; S : Node_Id) is
10855 T : constant Entity_Id := Entity (Subtype_Mark (S));
10861 Set_Ekind (Def_Id, E_Ordinary_Fixed_Point_Subtype);
10862 Set_Etype (Def_Id, Base_Type (T));
10863 Set_Size_Info (Def_Id, (T));
10864 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
10865 Set_Small_Value (Def_Id, Small_Value (T));
10867 -- Process the constraint
10869 C := Constraint (S);
10871 -- Delta constraint present
10873 if Nkind (C) = N_Delta_Constraint then
10874 Check_Restriction (No_Obsolescent_Features, C);
10876 if Warn_On_Obsolescent_Feature then
10878 ("subtype delta constraint is an " &
10879 "obsolescent feature (RM J.3(7))?");
10882 D := Delta_Expression (C);
10883 Analyze_And_Resolve (D, Any_Real);
10884 Check_Delta_Expression (D);
10885 Set_Delta_Value (Def_Id, Expr_Value_R (D));
10887 -- Check that delta value is in range. Obviously we can do this
10888 -- at compile time, but it is strictly a runtime check, and of
10889 -- course there is an ACVC test that checks this!
10891 if Delta_Value (Def_Id) < Delta_Value (T) then
10892 Error_Msg_N ("?delta value is too small", D);
10894 Make_Raise_Constraint_Error (Sloc (D),
10895 Reason => CE_Range_Check_Failed);
10896 Insert_Action (Declaration_Node (Def_Id), Rais);
10899 C := Range_Constraint (C);
10901 -- No delta constraint present
10904 Set_Delta_Value (Def_Id, Delta_Value (T));
10907 -- Range constraint present
10909 if Nkind (C) = N_Range_Constraint then
10910 Set_Scalar_Range_For_Subtype (Def_Id, Range_Expression (C), T);
10912 -- No range constraint present
10915 pragma Assert (No (C));
10916 Set_Scalar_Range (Def_Id, Scalar_Range (T));
10920 Set_Discrete_RM_Size (Def_Id);
10922 -- Unconditionally delay the freeze, since we cannot set size
10923 -- information in all cases correctly until the freeze point.
10925 Set_Has_Delayed_Freeze (Def_Id);
10926 end Constrain_Ordinary_Fixed;
10928 -----------------------
10929 -- Contain_Interface --
10930 -----------------------
10932 function Contain_Interface
10933 (Iface : Entity_Id;
10934 Ifaces : Elist_Id) return Boolean
10936 Iface_Elmt : Elmt_Id;
10939 if Present (Ifaces) then
10940 Iface_Elmt := First_Elmt (Ifaces);
10941 while Present (Iface_Elmt) loop
10942 if Node (Iface_Elmt) = Iface then
10946 Next_Elmt (Iface_Elmt);
10951 end Contain_Interface;
10953 ---------------------------
10954 -- Convert_Scalar_Bounds --
10955 ---------------------------
10957 procedure Convert_Scalar_Bounds
10959 Parent_Type : Entity_Id;
10960 Derived_Type : Entity_Id;
10963 Implicit_Base : constant Entity_Id := Base_Type (Derived_Type);
10970 Lo := Build_Scalar_Bound
10971 (Type_Low_Bound (Derived_Type),
10972 Parent_Type, Implicit_Base);
10974 Hi := Build_Scalar_Bound
10975 (Type_High_Bound (Derived_Type),
10976 Parent_Type, Implicit_Base);
10983 Set_Includes_Infinities (Rng, Has_Infinities (Derived_Type));
10985 Set_Parent (Rng, N);
10986 Set_Scalar_Range (Derived_Type, Rng);
10988 -- Analyze the bounds
10990 Analyze_And_Resolve (Lo, Implicit_Base);
10991 Analyze_And_Resolve (Hi, Implicit_Base);
10993 -- Analyze the range itself, except that we do not analyze it if
10994 -- the bounds are real literals, and we have a fixed-point type.
10995 -- The reason for this is that we delay setting the bounds in this
10996 -- case till we know the final Small and Size values (see circuit
10997 -- in Freeze.Freeze_Fixed_Point_Type for further details).
10999 if Is_Fixed_Point_Type (Parent_Type)
11000 and then Nkind (Lo) = N_Real_Literal
11001 and then Nkind (Hi) = N_Real_Literal
11005 -- Here we do the analysis of the range
11007 -- Note: we do this manually, since if we do a normal Analyze and
11008 -- Resolve call, there are problems with the conversions used for
11009 -- the derived type range.
11012 Set_Etype (Rng, Implicit_Base);
11013 Set_Analyzed (Rng, True);
11015 end Convert_Scalar_Bounds;
11017 -------------------
11018 -- Copy_And_Swap --
11019 -------------------
11021 procedure Copy_And_Swap (Priv, Full : Entity_Id) is
11023 -- Initialize new full declaration entity by copying the pertinent
11024 -- fields of the corresponding private declaration entity.
11026 -- We temporarily set Ekind to a value appropriate for a type to
11027 -- avoid assert failures in Einfo from checking for setting type
11028 -- attributes on something that is not a type. Ekind (Priv) is an
11029 -- appropriate choice, since it allowed the attributes to be set
11030 -- in the first place. This Ekind value will be modified later.
11032 Set_Ekind (Full, Ekind (Priv));
11034 -- Also set Etype temporarily to Any_Type, again, in the absence
11035 -- of errors, it will be properly reset, and if there are errors,
11036 -- then we want a value of Any_Type to remain.
11038 Set_Etype (Full, Any_Type);
11040 -- Now start copying attributes
11042 Set_Has_Discriminants (Full, Has_Discriminants (Priv));
11044 if Has_Discriminants (Full) then
11045 Set_Discriminant_Constraint (Full, Discriminant_Constraint (Priv));
11046 Set_Stored_Constraint (Full, Stored_Constraint (Priv));
11049 Set_First_Rep_Item (Full, First_Rep_Item (Priv));
11050 Set_Homonym (Full, Homonym (Priv));
11051 Set_Is_Immediately_Visible (Full, Is_Immediately_Visible (Priv));
11052 Set_Is_Public (Full, Is_Public (Priv));
11053 Set_Is_Pure (Full, Is_Pure (Priv));
11054 Set_Is_Tagged_Type (Full, Is_Tagged_Type (Priv));
11055 Set_Has_Pragma_Unreferenced (Full, Has_Pragma_Unreferenced (Priv));
11056 Set_Has_Pragma_Unreferenced_Objects
11057 (Full, Has_Pragma_Unreferenced_Objects
11060 Conditional_Delay (Full, Priv);
11062 if Is_Tagged_Type (Full) then
11063 Set_Primitive_Operations (Full, Primitive_Operations (Priv));
11065 if Priv = Base_Type (Priv) then
11066 Set_Class_Wide_Type (Full, Class_Wide_Type (Priv));
11070 Set_Is_Volatile (Full, Is_Volatile (Priv));
11071 Set_Treat_As_Volatile (Full, Treat_As_Volatile (Priv));
11072 Set_Scope (Full, Scope (Priv));
11073 Set_Next_Entity (Full, Next_Entity (Priv));
11074 Set_First_Entity (Full, First_Entity (Priv));
11075 Set_Last_Entity (Full, Last_Entity (Priv));
11077 -- If access types have been recorded for later handling, keep them in
11078 -- the full view so that they get handled when the full view freeze
11079 -- node is expanded.
11081 if Present (Freeze_Node (Priv))
11082 and then Present (Access_Types_To_Process (Freeze_Node (Priv)))
11084 Ensure_Freeze_Node (Full);
11085 Set_Access_Types_To_Process
11086 (Freeze_Node (Full),
11087 Access_Types_To_Process (Freeze_Node (Priv)));
11090 -- Swap the two entities. Now Privat is the full type entity and
11091 -- Full is the private one. They will be swapped back at the end
11092 -- of the private part. This swapping ensures that the entity that
11093 -- is visible in the private part is the full declaration.
11095 Exchange_Entities (Priv, Full);
11096 Append_Entity (Full, Scope (Full));
11099 -------------------------------------
11100 -- Copy_Array_Base_Type_Attributes --
11101 -------------------------------------
11103 procedure Copy_Array_Base_Type_Attributes (T1, T2 : Entity_Id) is
11105 Set_Component_Alignment (T1, Component_Alignment (T2));
11106 Set_Component_Type (T1, Component_Type (T2));
11107 Set_Component_Size (T1, Component_Size (T2));
11108 Set_Has_Controlled_Component (T1, Has_Controlled_Component (T2));
11109 Set_Finalize_Storage_Only (T1, Finalize_Storage_Only (T2));
11110 Set_Has_Non_Standard_Rep (T1, Has_Non_Standard_Rep (T2));
11111 Set_Has_Task (T1, Has_Task (T2));
11112 Set_Is_Packed (T1, Is_Packed (T2));
11113 Set_Has_Aliased_Components (T1, Has_Aliased_Components (T2));
11114 Set_Has_Atomic_Components (T1, Has_Atomic_Components (T2));
11115 Set_Has_Volatile_Components (T1, Has_Volatile_Components (T2));
11116 end Copy_Array_Base_Type_Attributes;
11118 -----------------------------------
11119 -- Copy_Array_Subtype_Attributes --
11120 -----------------------------------
11122 procedure Copy_Array_Subtype_Attributes (T1, T2 : Entity_Id) is
11124 Set_Size_Info (T1, T2);
11126 Set_First_Index (T1, First_Index (T2));
11127 Set_Is_Aliased (T1, Is_Aliased (T2));
11128 Set_Is_Atomic (T1, Is_Atomic (T2));
11129 Set_Is_Volatile (T1, Is_Volatile (T2));
11130 Set_Treat_As_Volatile (T1, Treat_As_Volatile (T2));
11131 Set_Is_Constrained (T1, Is_Constrained (T2));
11132 Set_Depends_On_Private (T1, Has_Private_Component (T2));
11133 Set_First_Rep_Item (T1, First_Rep_Item (T2));
11134 Set_Convention (T1, Convention (T2));
11135 Set_Is_Limited_Composite (T1, Is_Limited_Composite (T2));
11136 Set_Is_Private_Composite (T1, Is_Private_Composite (T2));
11137 end Copy_Array_Subtype_Attributes;
11139 -----------------------------------
11140 -- Create_Constrained_Components --
11141 -----------------------------------
11143 procedure Create_Constrained_Components
11145 Decl_Node : Node_Id;
11147 Constraints : Elist_Id)
11149 Loc : constant Source_Ptr := Sloc (Subt);
11150 Comp_List : constant Elist_Id := New_Elmt_List;
11151 Parent_Type : constant Entity_Id := Etype (Typ);
11152 Assoc_List : constant List_Id := New_List;
11153 Discr_Val : Elmt_Id;
11157 Is_Static : Boolean := True;
11159 procedure Collect_Fixed_Components (Typ : Entity_Id);
11160 -- Collect parent type components that do not appear in a variant part
11162 procedure Create_All_Components;
11163 -- Iterate over Comp_List to create the components of the subtype
11165 function Create_Component (Old_Compon : Entity_Id) return Entity_Id;
11166 -- Creates a new component from Old_Compon, copying all the fields from
11167 -- it, including its Etype, inserts the new component in the Subt entity
11168 -- chain and returns the new component.
11170 function Is_Variant_Record (T : Entity_Id) return Boolean;
11171 -- If true, and discriminants are static, collect only components from
11172 -- variants selected by discriminant values.
11174 ------------------------------
11175 -- Collect_Fixed_Components --
11176 ------------------------------
11178 procedure Collect_Fixed_Components (Typ : Entity_Id) is
11180 -- Build association list for discriminants, and find components of the
11181 -- variant part selected by the values of the discriminants.
11183 Old_C := First_Discriminant (Typ);
11184 Discr_Val := First_Elmt (Constraints);
11185 while Present (Old_C) loop
11186 Append_To (Assoc_List,
11187 Make_Component_Association (Loc,
11188 Choices => New_List (New_Occurrence_Of (Old_C, Loc)),
11189 Expression => New_Copy (Node (Discr_Val))));
11191 Next_Elmt (Discr_Val);
11192 Next_Discriminant (Old_C);
11195 -- The tag, and the possible parent and controller components
11196 -- are unconditionally in the subtype.
11198 if Is_Tagged_Type (Typ)
11199 or else Has_Controlled_Component (Typ)
11201 Old_C := First_Component (Typ);
11202 while Present (Old_C) loop
11203 if Chars ((Old_C)) = Name_uTag
11204 or else Chars ((Old_C)) = Name_uParent
11205 or else Chars ((Old_C)) = Name_uController
11207 Append_Elmt (Old_C, Comp_List);
11210 Next_Component (Old_C);
11213 end Collect_Fixed_Components;
11215 ---------------------------
11216 -- Create_All_Components --
11217 ---------------------------
11219 procedure Create_All_Components is
11223 Comp := First_Elmt (Comp_List);
11224 while Present (Comp) loop
11225 Old_C := Node (Comp);
11226 New_C := Create_Component (Old_C);
11230 Constrain_Component_Type
11231 (Old_C, Subt, Decl_Node, Typ, Constraints));
11232 Set_Is_Public (New_C, Is_Public (Subt));
11236 end Create_All_Components;
11238 ----------------------
11239 -- Create_Component --
11240 ----------------------
11242 function Create_Component (Old_Compon : Entity_Id) return Entity_Id is
11243 New_Compon : constant Entity_Id := New_Copy (Old_Compon);
11246 if Ekind (Old_Compon) = E_Discriminant
11247 and then Is_Completely_Hidden (Old_Compon)
11249 -- This is a shadow discriminant created for a discriminant of
11250 -- the parent type that is one of several renamed by the same
11251 -- new discriminant. Give the shadow discriminant an internal
11252 -- name that cannot conflict with that of visible components.
11254 Set_Chars (New_Compon, New_Internal_Name ('C'));
11257 -- Set the parent so we have a proper link for freezing etc. This is
11258 -- not a real parent pointer, since of course our parent does not own
11259 -- up to us and reference us, we are an illegitimate child of the
11260 -- original parent!
11262 Set_Parent (New_Compon, Parent (Old_Compon));
11264 -- If the old component's Esize was already determined and is a
11265 -- static value, then the new component simply inherits it. Otherwise
11266 -- the old component's size may require run-time determination, but
11267 -- the new component's size still might be statically determinable
11268 -- (if, for example it has a static constraint). In that case we want
11269 -- Layout_Type to recompute the component's size, so we reset its
11270 -- size and positional fields.
11272 if Frontend_Layout_On_Target
11273 and then not Known_Static_Esize (Old_Compon)
11275 Set_Esize (New_Compon, Uint_0);
11276 Init_Normalized_First_Bit (New_Compon);
11277 Init_Normalized_Position (New_Compon);
11278 Init_Normalized_Position_Max (New_Compon);
11281 -- We do not want this node marked as Comes_From_Source, since
11282 -- otherwise it would get first class status and a separate cross-
11283 -- reference line would be generated. Illegitimate children do not
11284 -- rate such recognition.
11286 Set_Comes_From_Source (New_Compon, False);
11288 -- But it is a real entity, and a birth certificate must be properly
11289 -- registered by entering it into the entity list.
11291 Enter_Name (New_Compon);
11294 end Create_Component;
11296 -----------------------
11297 -- Is_Variant_Record --
11298 -----------------------
11300 function Is_Variant_Record (T : Entity_Id) return Boolean is
11302 return Nkind (Parent (T)) = N_Full_Type_Declaration
11303 and then Nkind (Type_Definition (Parent (T))) = N_Record_Definition
11304 and then Present (Component_List (Type_Definition (Parent (T))))
11307 (Variant_Part (Component_List (Type_Definition (Parent (T)))));
11308 end Is_Variant_Record;
11310 -- Start of processing for Create_Constrained_Components
11313 pragma Assert (Subt /= Base_Type (Subt));
11314 pragma Assert (Typ = Base_Type (Typ));
11316 Set_First_Entity (Subt, Empty);
11317 Set_Last_Entity (Subt, Empty);
11319 -- Check whether constraint is fully static, in which case we can
11320 -- optimize the list of components.
11322 Discr_Val := First_Elmt (Constraints);
11323 while Present (Discr_Val) loop
11324 if not Is_OK_Static_Expression (Node (Discr_Val)) then
11325 Is_Static := False;
11329 Next_Elmt (Discr_Val);
11332 Set_Has_Static_Discriminants (Subt, Is_Static);
11336 -- Inherit the discriminants of the parent type
11338 Add_Discriminants : declare
11344 Old_C := First_Discriminant (Typ);
11346 while Present (Old_C) loop
11347 Num_Disc := Num_Disc + 1;
11348 New_C := Create_Component (Old_C);
11349 Set_Is_Public (New_C, Is_Public (Subt));
11350 Next_Discriminant (Old_C);
11353 -- For an untagged derived subtype, the number of discriminants may
11354 -- be smaller than the number of inherited discriminants, because
11355 -- several of them may be renamed by a single new discriminant.
11356 -- In this case, add the hidden discriminants back into the subtype,
11357 -- because otherwise the size of the subtype is computed incorrectly
11362 if Is_Derived_Type (Typ)
11363 and then not Is_Tagged_Type (Typ)
11365 Old_C := First_Stored_Discriminant (Typ);
11367 while Present (Old_C) loop
11368 Num_Gird := Num_Gird + 1;
11369 Next_Stored_Discriminant (Old_C);
11373 if Num_Gird > Num_Disc then
11375 -- Find out multiple uses of new discriminants, and add hidden
11376 -- components for the extra renamed discriminants. We recognize
11377 -- multiple uses through the Corresponding_Discriminant of a
11378 -- new discriminant: if it constrains several old discriminants,
11379 -- this field points to the last one in the parent type. The
11380 -- stored discriminants of the derived type have the same name
11381 -- as those of the parent.
11385 New_Discr : Entity_Id;
11386 Old_Discr : Entity_Id;
11389 Constr := First_Elmt (Stored_Constraint (Typ));
11390 Old_Discr := First_Stored_Discriminant (Typ);
11391 while Present (Constr) loop
11392 if Is_Entity_Name (Node (Constr))
11393 and then Ekind (Entity (Node (Constr))) = E_Discriminant
11395 New_Discr := Entity (Node (Constr));
11397 if Chars (Corresponding_Discriminant (New_Discr)) /=
11400 -- The new discriminant has been used to rename a
11401 -- subsequent old discriminant. Introduce a shadow
11402 -- component for the current old discriminant.
11404 New_C := Create_Component (Old_Discr);
11405 Set_Original_Record_Component (New_C, Old_Discr);
11409 Next_Elmt (Constr);
11410 Next_Stored_Discriminant (Old_Discr);
11414 end Add_Discriminants;
11417 and then Is_Variant_Record (Typ)
11419 Collect_Fixed_Components (Typ);
11421 Gather_Components (
11423 Component_List (Type_Definition (Parent (Typ))),
11424 Governed_By => Assoc_List,
11426 Report_Errors => Errors);
11427 pragma Assert (not Errors);
11429 Create_All_Components;
11431 -- If the subtype declaration is created for a tagged type derivation
11432 -- with constraints, we retrieve the record definition of the parent
11433 -- type to select the components of the proper variant.
11436 and then Is_Tagged_Type (Typ)
11437 and then Nkind (Parent (Typ)) = N_Full_Type_Declaration
11439 Nkind (Type_Definition (Parent (Typ))) = N_Derived_Type_Definition
11440 and then Is_Variant_Record (Parent_Type)
11442 Collect_Fixed_Components (Typ);
11444 Gather_Components (
11446 Component_List (Type_Definition (Parent (Parent_Type))),
11447 Governed_By => Assoc_List,
11449 Report_Errors => Errors);
11450 pragma Assert (not Errors);
11452 -- If the tagged derivation has a type extension, collect all the
11453 -- new components therein.
11456 (Record_Extension_Part (Type_Definition (Parent (Typ))))
11458 Old_C := First_Component (Typ);
11459 while Present (Old_C) loop
11460 if Original_Record_Component (Old_C) = Old_C
11461 and then Chars (Old_C) /= Name_uTag
11462 and then Chars (Old_C) /= Name_uParent
11463 and then Chars (Old_C) /= Name_uController
11465 Append_Elmt (Old_C, Comp_List);
11468 Next_Component (Old_C);
11472 Create_All_Components;
11475 -- If discriminants are not static, or if this is a multi-level type
11476 -- extension, we have to include all components of the parent type.
11478 Old_C := First_Component (Typ);
11479 while Present (Old_C) loop
11480 New_C := Create_Component (Old_C);
11484 Constrain_Component_Type
11485 (Old_C, Subt, Decl_Node, Typ, Constraints));
11486 Set_Is_Public (New_C, Is_Public (Subt));
11488 Next_Component (Old_C);
11493 end Create_Constrained_Components;
11495 ------------------------------------------
11496 -- Decimal_Fixed_Point_Type_Declaration --
11497 ------------------------------------------
11499 procedure Decimal_Fixed_Point_Type_Declaration
11503 Loc : constant Source_Ptr := Sloc (Def);
11504 Digs_Expr : constant Node_Id := Digits_Expression (Def);
11505 Delta_Expr : constant Node_Id := Delta_Expression (Def);
11506 Implicit_Base : Entity_Id;
11513 Check_Restriction (No_Fixed_Point, Def);
11515 -- Create implicit base type
11518 Create_Itype (E_Decimal_Fixed_Point_Type, Parent (Def), T, 'B');
11519 Set_Etype (Implicit_Base, Implicit_Base);
11521 -- Analyze and process delta expression
11523 Analyze_And_Resolve (Delta_Expr, Universal_Real);
11525 Check_Delta_Expression (Delta_Expr);
11526 Delta_Val := Expr_Value_R (Delta_Expr);
11528 -- Check delta is power of 10, and determine scale value from it
11534 Scale_Val := Uint_0;
11537 if Val < Ureal_1 then
11538 while Val < Ureal_1 loop
11539 Val := Val * Ureal_10;
11540 Scale_Val := Scale_Val + 1;
11543 if Scale_Val > 18 then
11544 Error_Msg_N ("scale exceeds maximum value of 18", Def);
11545 Scale_Val := UI_From_Int (+18);
11549 while Val > Ureal_1 loop
11550 Val := Val / Ureal_10;
11551 Scale_Val := Scale_Val - 1;
11554 if Scale_Val < -18 then
11555 Error_Msg_N ("scale is less than minimum value of -18", Def);
11556 Scale_Val := UI_From_Int (-18);
11560 if Val /= Ureal_1 then
11561 Error_Msg_N ("delta expression must be a power of 10", Def);
11562 Delta_Val := Ureal_10 ** (-Scale_Val);
11566 -- Set delta, scale and small (small = delta for decimal type)
11568 Set_Delta_Value (Implicit_Base, Delta_Val);
11569 Set_Scale_Value (Implicit_Base, Scale_Val);
11570 Set_Small_Value (Implicit_Base, Delta_Val);
11572 -- Analyze and process digits expression
11574 Analyze_And_Resolve (Digs_Expr, Any_Integer);
11575 Check_Digits_Expression (Digs_Expr);
11576 Digs_Val := Expr_Value (Digs_Expr);
11578 if Digs_Val > 18 then
11579 Digs_Val := UI_From_Int (+18);
11580 Error_Msg_N ("digits value out of range, maximum is 18", Digs_Expr);
11583 Set_Digits_Value (Implicit_Base, Digs_Val);
11584 Bound_Val := UR_From_Uint (10 ** Digs_Val - 1) * Delta_Val;
11586 -- Set range of base type from digits value for now. This will be
11587 -- expanded to represent the true underlying base range by Freeze.
11589 Set_Fixed_Range (Implicit_Base, Loc, -Bound_Val, Bound_Val);
11591 -- Note: We leave size as zero for now, size will be set at freeze
11592 -- time. We have to do this for ordinary fixed-point, because the size
11593 -- depends on the specified small, and we might as well do the same for
11594 -- decimal fixed-point.
11596 pragma Assert (Esize (Implicit_Base) = Uint_0);
11598 -- If there are bounds given in the declaration use them as the
11599 -- bounds of the first named subtype.
11601 if Present (Real_Range_Specification (Def)) then
11603 RRS : constant Node_Id := Real_Range_Specification (Def);
11604 Low : constant Node_Id := Low_Bound (RRS);
11605 High : constant Node_Id := High_Bound (RRS);
11610 Analyze_And_Resolve (Low, Any_Real);
11611 Analyze_And_Resolve (High, Any_Real);
11612 Check_Real_Bound (Low);
11613 Check_Real_Bound (High);
11614 Low_Val := Expr_Value_R (Low);
11615 High_Val := Expr_Value_R (High);
11617 if Low_Val < (-Bound_Val) then
11619 ("range low bound too small for digits value", Low);
11620 Low_Val := -Bound_Val;
11623 if High_Val > Bound_Val then
11625 ("range high bound too large for digits value", High);
11626 High_Val := Bound_Val;
11629 Set_Fixed_Range (T, Loc, Low_Val, High_Val);
11632 -- If no explicit range, use range that corresponds to given
11633 -- digits value. This will end up as the final range for the
11637 Set_Fixed_Range (T, Loc, -Bound_Val, Bound_Val);
11640 -- Complete entity for first subtype
11642 Set_Ekind (T, E_Decimal_Fixed_Point_Subtype);
11643 Set_Etype (T, Implicit_Base);
11644 Set_Size_Info (T, Implicit_Base);
11645 Set_First_Rep_Item (T, First_Rep_Item (Implicit_Base));
11646 Set_Digits_Value (T, Digs_Val);
11647 Set_Delta_Value (T, Delta_Val);
11648 Set_Small_Value (T, Delta_Val);
11649 Set_Scale_Value (T, Scale_Val);
11650 Set_Is_Constrained (T);
11651 end Decimal_Fixed_Point_Type_Declaration;
11653 -----------------------------------
11654 -- Derive_Progenitor_Subprograms --
11655 -----------------------------------
11657 procedure Derive_Progenitor_Subprograms
11658 (Parent_Type : Entity_Id;
11659 Tagged_Type : Entity_Id)
11664 Iface_Elmt : Elmt_Id;
11665 Iface_Subp : Entity_Id;
11666 New_Subp : Entity_Id := Empty;
11667 Prim_Elmt : Elmt_Id;
11672 pragma Assert (Ada_Version >= Ada_05
11673 and then Is_Record_Type (Tagged_Type)
11674 and then Is_Tagged_Type (Tagged_Type)
11675 and then Has_Interfaces (Tagged_Type));
11677 -- Step 1: Transfer to the full-view primitives associated with the
11678 -- partial-view that cover interface primitives. Conceptually this
11679 -- work should be done later by Process_Full_View; done here to
11680 -- simplify its implementation at later stages. It can be safely
11681 -- done here because interfaces must be visible in the partial and
11682 -- private view (RM 7.3(7.3/2)).
11684 -- Small optimization: This work is only required if the parent is
11685 -- abstract. If the tagged type is not abstract, it cannot have
11686 -- abstract primitives (the only entities in the list of primitives of
11687 -- non-abstract tagged types that can reference abstract primitives
11688 -- through its Alias attribute are the internal entities that have
11689 -- attribute Interface_Alias, and these entities are generated later
11690 -- by Freeze_Record_Type).
11692 if In_Private_Part (Current_Scope)
11693 and then Is_Abstract_Type (Parent_Type)
11695 Elmt := First_Elmt (Primitive_Operations (Tagged_Type));
11696 while Present (Elmt) loop
11697 Subp := Node (Elmt);
11699 -- At this stage it is not possible to have entities in the list
11700 -- of primitives that have attribute Interface_Alias
11702 pragma Assert (No (Interface_Alias (Subp)));
11704 Typ := Find_Dispatching_Type (Ultimate_Alias (Subp));
11706 if Is_Interface (Typ) then
11707 E := Find_Primitive_Covering_Interface
11708 (Tagged_Type => Tagged_Type,
11709 Iface_Prim => Subp);
11712 and then Find_Dispatching_Type (Ultimate_Alias (E)) /= Typ
11714 Replace_Elmt (Elmt, E);
11715 Remove_Homonym (Subp);
11723 -- Step 2: Add primitives of progenitors that are not implemented by
11724 -- parents of Tagged_Type
11726 if Present (Interfaces (Base_Type (Tagged_Type))) then
11727 Iface_Elmt := First_Elmt (Interfaces (Base_Type (Tagged_Type)));
11728 while Present (Iface_Elmt) loop
11729 Iface := Node (Iface_Elmt);
11731 Prim_Elmt := First_Elmt (Primitive_Operations (Iface));
11732 while Present (Prim_Elmt) loop
11733 Iface_Subp := Node (Prim_Elmt);
11735 -- Exclude derivation of predefined primitives except those
11736 -- that come from source. Required to catch declarations of
11737 -- equality operators of interfaces. For example:
11739 -- type Iface is interface;
11740 -- function "=" (Left, Right : Iface) return Boolean;
11742 if not Is_Predefined_Dispatching_Operation (Iface_Subp)
11743 or else Comes_From_Source (Iface_Subp)
11745 E := Find_Primitive_Covering_Interface
11746 (Tagged_Type => Tagged_Type,
11747 Iface_Prim => Iface_Subp);
11749 -- If not found we derive a new primitive leaving its alias
11750 -- attribute referencing the interface primitive
11754 (New_Subp, Iface_Subp, Tagged_Type, Iface);
11756 -- Propagate to the full view interface entities associated
11757 -- with the partial view
11759 elsif In_Private_Part (Current_Scope)
11760 and then Present (Alias (E))
11761 and then Alias (E) = Iface_Subp
11763 List_Containing (Parent (E)) /=
11764 Private_Declarations
11766 (Unit_Declaration_Node (Current_Scope)))
11768 Append_Elmt (E, Primitive_Operations (Tagged_Type));
11772 Next_Elmt (Prim_Elmt);
11775 Next_Elmt (Iface_Elmt);
11778 end Derive_Progenitor_Subprograms;
11780 -----------------------
11781 -- Derive_Subprogram --
11782 -----------------------
11784 procedure Derive_Subprogram
11785 (New_Subp : in out Entity_Id;
11786 Parent_Subp : Entity_Id;
11787 Derived_Type : Entity_Id;
11788 Parent_Type : Entity_Id;
11789 Actual_Subp : Entity_Id := Empty)
11791 Formal : Entity_Id;
11792 -- Formal parameter of parent primitive operation
11794 Formal_Of_Actual : Entity_Id;
11795 -- Formal parameter of actual operation, when the derivation is to
11796 -- create a renaming for a primitive operation of an actual in an
11799 New_Formal : Entity_Id;
11800 -- Formal of inherited operation
11802 Visible_Subp : Entity_Id := Parent_Subp;
11804 function Is_Private_Overriding return Boolean;
11805 -- If Subp is a private overriding of a visible operation, the inherited
11806 -- operation derives from the overridden op (even though its body is the
11807 -- overriding one) and the inherited operation is visible now. See
11808 -- sem_disp to see the full details of the handling of the overridden
11809 -- subprogram, which is removed from the list of primitive operations of
11810 -- the type. The overridden subprogram is saved locally in Visible_Subp,
11811 -- and used to diagnose abstract operations that need overriding in the
11814 procedure Replace_Type (Id, New_Id : Entity_Id);
11815 -- When the type is an anonymous access type, create a new access type
11816 -- designating the derived type.
11818 procedure Set_Derived_Name;
11819 -- This procedure sets the appropriate Chars name for New_Subp. This
11820 -- is normally just a copy of the parent name. An exception arises for
11821 -- type support subprograms, where the name is changed to reflect the
11822 -- name of the derived type, e.g. if type foo is derived from type bar,
11823 -- then a procedure barDA is derived with a name fooDA.
11825 ---------------------------
11826 -- Is_Private_Overriding --
11827 ---------------------------
11829 function Is_Private_Overriding return Boolean is
11833 -- If the parent is not a dispatching operation there is no
11834 -- need to investigate overridings
11836 if not Is_Dispatching_Operation (Parent_Subp) then
11840 -- The visible operation that is overridden is a homonym of the
11841 -- parent subprogram. We scan the homonym chain to find the one
11842 -- whose alias is the subprogram we are deriving.
11844 Prev := Current_Entity (Parent_Subp);
11845 while Present (Prev) loop
11846 if Ekind (Prev) = Ekind (Parent_Subp)
11847 and then Alias (Prev) = Parent_Subp
11848 and then Scope (Parent_Subp) = Scope (Prev)
11849 and then not Is_Hidden (Prev)
11851 Visible_Subp := Prev;
11855 Prev := Homonym (Prev);
11859 end Is_Private_Overriding;
11865 procedure Replace_Type (Id, New_Id : Entity_Id) is
11866 Acc_Type : Entity_Id;
11867 Par : constant Node_Id := Parent (Derived_Type);
11870 -- When the type is an anonymous access type, create a new access
11871 -- type designating the derived type. This itype must be elaborated
11872 -- at the point of the derivation, not on subsequent calls that may
11873 -- be out of the proper scope for Gigi, so we insert a reference to
11874 -- it after the derivation.
11876 if Ekind (Etype (Id)) = E_Anonymous_Access_Type then
11878 Desig_Typ : Entity_Id := Designated_Type (Etype (Id));
11881 if Ekind (Desig_Typ) = E_Record_Type_With_Private
11882 and then Present (Full_View (Desig_Typ))
11883 and then not Is_Private_Type (Parent_Type)
11885 Desig_Typ := Full_View (Desig_Typ);
11888 if Base_Type (Desig_Typ) = Base_Type (Parent_Type)
11890 -- Ada 2005 (AI-251): Handle also derivations of abstract
11891 -- interface primitives.
11893 or else (Is_Interface (Desig_Typ)
11894 and then not Is_Class_Wide_Type (Desig_Typ))
11896 Acc_Type := New_Copy (Etype (Id));
11897 Set_Etype (Acc_Type, Acc_Type);
11898 Set_Scope (Acc_Type, New_Subp);
11900 -- Compute size of anonymous access type
11902 if Is_Array_Type (Desig_Typ)
11903 and then not Is_Constrained (Desig_Typ)
11905 Init_Size (Acc_Type, 2 * System_Address_Size);
11907 Init_Size (Acc_Type, System_Address_Size);
11910 Init_Alignment (Acc_Type);
11911 Set_Directly_Designated_Type (Acc_Type, Derived_Type);
11913 Set_Etype (New_Id, Acc_Type);
11914 Set_Scope (New_Id, New_Subp);
11916 -- Create a reference to it
11917 Build_Itype_Reference (Acc_Type, Parent (Derived_Type));
11920 Set_Etype (New_Id, Etype (Id));
11924 elsif Base_Type (Etype (Id)) = Base_Type (Parent_Type)
11926 (Ekind (Etype (Id)) = E_Record_Type_With_Private
11927 and then Present (Full_View (Etype (Id)))
11929 Base_Type (Full_View (Etype (Id))) = Base_Type (Parent_Type))
11931 -- Constraint checks on formals are generated during expansion,
11932 -- based on the signature of the original subprogram. The bounds
11933 -- of the derived type are not relevant, and thus we can use
11934 -- the base type for the formals. However, the return type may be
11935 -- used in a context that requires that the proper static bounds
11936 -- be used (a case statement, for example) and for those cases
11937 -- we must use the derived type (first subtype), not its base.
11939 -- If the derived_type_definition has no constraints, we know that
11940 -- the derived type has the same constraints as the first subtype
11941 -- of the parent, and we can also use it rather than its base,
11942 -- which can lead to more efficient code.
11944 if Etype (Id) = Parent_Type then
11945 if Is_Scalar_Type (Parent_Type)
11947 Subtypes_Statically_Compatible (Parent_Type, Derived_Type)
11949 Set_Etype (New_Id, Derived_Type);
11951 elsif Nkind (Par) = N_Full_Type_Declaration
11953 Nkind (Type_Definition (Par)) = N_Derived_Type_Definition
11956 (Subtype_Indication (Type_Definition (Par)))
11958 Set_Etype (New_Id, Derived_Type);
11961 Set_Etype (New_Id, Base_Type (Derived_Type));
11965 Set_Etype (New_Id, Base_Type (Derived_Type));
11968 -- Ada 2005 (AI-251): Handle derivations of abstract interface
11971 elsif Is_Interface (Etype (Id))
11972 and then not Is_Class_Wide_Type (Etype (Id))
11973 and then Is_Progenitor (Etype (Id), Derived_Type)
11975 Set_Etype (New_Id, Derived_Type);
11978 Set_Etype (New_Id, Etype (Id));
11982 ----------------------
11983 -- Set_Derived_Name --
11984 ----------------------
11986 procedure Set_Derived_Name is
11987 Nm : constant TSS_Name_Type := Get_TSS_Name (Parent_Subp);
11989 if Nm = TSS_Null then
11990 Set_Chars (New_Subp, Chars (Parent_Subp));
11992 Set_Chars (New_Subp, Make_TSS_Name (Base_Type (Derived_Type), Nm));
11994 end Set_Derived_Name;
11998 Parent_Overrides_Interface_Primitive : Boolean := False;
12000 -- Start of processing for Derive_Subprogram
12004 New_Entity (Nkind (Parent_Subp), Sloc (Derived_Type));
12005 Set_Ekind (New_Subp, Ekind (Parent_Subp));
12007 -- Check whether the parent overrides an interface primitive
12009 if Is_Overriding_Operation (Parent_Subp) then
12011 E : Entity_Id := Parent_Subp;
12013 while Present (Overridden_Operation (E)) loop
12014 E := Ultimate_Alias (Overridden_Operation (E));
12017 Parent_Overrides_Interface_Primitive :=
12018 Is_Dispatching_Operation (E)
12019 and then Present (Find_Dispatching_Type (E))
12020 and then Is_Interface (Find_Dispatching_Type (E));
12024 -- Check whether the inherited subprogram is a private operation that
12025 -- should be inherited but not yet made visible. Such subprograms can
12026 -- become visible at a later point (e.g., the private part of a public
12027 -- child unit) via Declare_Inherited_Private_Subprograms. If the
12028 -- following predicate is true, then this is not such a private
12029 -- operation and the subprogram simply inherits the name of the parent
12030 -- subprogram. Note the special check for the names of controlled
12031 -- operations, which are currently exempted from being inherited with
12032 -- a hidden name because they must be findable for generation of
12033 -- implicit run-time calls.
12035 if not Is_Hidden (Parent_Subp)
12036 or else Is_Internal (Parent_Subp)
12037 or else Is_Private_Overriding
12038 or else Is_Internal_Name (Chars (Parent_Subp))
12039 or else Chars (Parent_Subp) = Name_Initialize
12040 or else Chars (Parent_Subp) = Name_Adjust
12041 or else Chars (Parent_Subp) = Name_Finalize
12045 -- If parent is hidden, this can be a regular derivation if the
12046 -- parent is immediately visible in a non-instantiating context,
12047 -- or if we are in the private part of an instance. This test
12048 -- should still be refined ???
12050 -- The test for In_Instance_Not_Visible avoids inheriting the derived
12051 -- operation as a non-visible operation in cases where the parent
12052 -- subprogram might not be visible now, but was visible within the
12053 -- original generic, so it would be wrong to make the inherited
12054 -- subprogram non-visible now. (Not clear if this test is fully
12055 -- correct; are there any cases where we should declare the inherited
12056 -- operation as not visible to avoid it being overridden, e.g., when
12057 -- the parent type is a generic actual with private primitives ???)
12059 -- (they should be treated the same as other private inherited
12060 -- subprograms, but it's not clear how to do this cleanly). ???
12062 elsif (In_Open_Scopes (Scope (Base_Type (Parent_Type)))
12063 and then Is_Immediately_Visible (Parent_Subp)
12064 and then not In_Instance)
12065 or else In_Instance_Not_Visible
12069 -- Ada 2005 (AI-251): Regular derivation if the parent subprogram
12070 -- overrides an interface primitive because interface primitives
12071 -- must be visible in the partial view of the parent (RM 7.3 (7.3/2))
12073 elsif Parent_Overrides_Interface_Primitive then
12076 -- The type is inheriting a private operation, so enter
12077 -- it with a special name so it can't be overridden.
12080 Set_Chars (New_Subp, New_External_Name (Chars (Parent_Subp), 'P'));
12083 Set_Parent (New_Subp, Parent (Derived_Type));
12085 if Present (Actual_Subp) then
12086 Replace_Type (Actual_Subp, New_Subp);
12088 Replace_Type (Parent_Subp, New_Subp);
12091 Conditional_Delay (New_Subp, Parent_Subp);
12093 -- If we are creating a renaming for a primitive operation of an
12094 -- actual of a generic derived type, we must examine the signature
12095 -- of the actual primitive, not that of the generic formal, which for
12096 -- example may be an interface. However the name and initial value
12097 -- of the inherited operation are those of the formal primitive.
12099 Formal := First_Formal (Parent_Subp);
12101 if Present (Actual_Subp) then
12102 Formal_Of_Actual := First_Formal (Actual_Subp);
12104 Formal_Of_Actual := Empty;
12107 while Present (Formal) loop
12108 New_Formal := New_Copy (Formal);
12110 -- Normally we do not go copying parents, but in the case of
12111 -- formals, we need to link up to the declaration (which is the
12112 -- parameter specification), and it is fine to link up to the
12113 -- original formal's parameter specification in this case.
12115 Set_Parent (New_Formal, Parent (Formal));
12116 Append_Entity (New_Formal, New_Subp);
12118 if Present (Formal_Of_Actual) then
12119 Replace_Type (Formal_Of_Actual, New_Formal);
12120 Next_Formal (Formal_Of_Actual);
12122 Replace_Type (Formal, New_Formal);
12125 Next_Formal (Formal);
12128 -- If this derivation corresponds to a tagged generic actual, then
12129 -- primitive operations rename those of the actual. Otherwise the
12130 -- primitive operations rename those of the parent type, If the parent
12131 -- renames an intrinsic operator, so does the new subprogram. We except
12132 -- concatenation, which is always properly typed, and does not get
12133 -- expanded as other intrinsic operations.
12135 if No (Actual_Subp) then
12136 if Is_Intrinsic_Subprogram (Parent_Subp) then
12137 Set_Is_Intrinsic_Subprogram (New_Subp);
12139 if Present (Alias (Parent_Subp))
12140 and then Chars (Parent_Subp) /= Name_Op_Concat
12142 Set_Alias (New_Subp, Alias (Parent_Subp));
12144 Set_Alias (New_Subp, Parent_Subp);
12148 Set_Alias (New_Subp, Parent_Subp);
12152 Set_Alias (New_Subp, Actual_Subp);
12155 -- Derived subprograms of a tagged type must inherit the convention
12156 -- of the parent subprogram (a requirement of AI-117). Derived
12157 -- subprograms of untagged types simply get convention Ada by default.
12159 if Is_Tagged_Type (Derived_Type) then
12160 Set_Convention (New_Subp, Convention (Parent_Subp));
12163 Set_Is_Imported (New_Subp, Is_Imported (Parent_Subp));
12164 Set_Is_Exported (New_Subp, Is_Exported (Parent_Subp));
12166 if Ekind (Parent_Subp) = E_Procedure then
12167 Set_Is_Valued_Procedure
12168 (New_Subp, Is_Valued_Procedure (Parent_Subp));
12171 -- No_Return must be inherited properly. If this is overridden in the
12172 -- case of a dispatching operation, then a check is made in Sem_Disp
12173 -- that the overriding operation is also No_Return (no such check is
12174 -- required for the case of non-dispatching operation.
12176 Set_No_Return (New_Subp, No_Return (Parent_Subp));
12178 -- A derived function with a controlling result is abstract. If the
12179 -- Derived_Type is a nonabstract formal generic derived type, then
12180 -- inherited operations are not abstract: the required check is done at
12181 -- instantiation time. If the derivation is for a generic actual, the
12182 -- function is not abstract unless the actual is.
12184 if Is_Generic_Type (Derived_Type)
12185 and then not Is_Abstract_Type (Derived_Type)
12189 -- Ada 2005 (AI-228): Calculate the "require overriding" and "abstract"
12190 -- properties of the subprogram, as defined in RM-3.9.3(4/2-6/2).
12192 elsif Ada_Version >= Ada_05
12193 and then (Is_Abstract_Subprogram (Alias (New_Subp))
12194 or else (Is_Tagged_Type (Derived_Type)
12195 and then Etype (New_Subp) = Derived_Type
12196 and then not Is_Null_Extension (Derived_Type))
12197 or else (Is_Tagged_Type (Derived_Type)
12198 and then Ekind (Etype (New_Subp)) =
12199 E_Anonymous_Access_Type
12200 and then Designated_Type (Etype (New_Subp)) =
12202 and then not Is_Null_Extension (Derived_Type)))
12203 and then No (Actual_Subp)
12205 if not Is_Tagged_Type (Derived_Type)
12206 or else Is_Abstract_Type (Derived_Type)
12207 or else Is_Abstract_Subprogram (Alias (New_Subp))
12209 Set_Is_Abstract_Subprogram (New_Subp);
12211 Set_Requires_Overriding (New_Subp);
12214 elsif Ada_Version < Ada_05
12215 and then (Is_Abstract_Subprogram (Alias (New_Subp))
12216 or else (Is_Tagged_Type (Derived_Type)
12217 and then Etype (New_Subp) = Derived_Type
12218 and then No (Actual_Subp)))
12220 Set_Is_Abstract_Subprogram (New_Subp);
12222 -- Finally, if the parent type is abstract we must verify that all
12223 -- inherited operations are either non-abstract or overridden, or that
12224 -- the derived type itself is abstract (this check is performed at the
12225 -- end of a package declaration, in Check_Abstract_Overriding). A
12226 -- private overriding in the parent type will not be visible in the
12227 -- derivation if we are not in an inner package or in a child unit of
12228 -- the parent type, in which case the abstractness of the inherited
12229 -- operation is carried to the new subprogram.
12231 elsif Is_Abstract_Type (Parent_Type)
12232 and then not In_Open_Scopes (Scope (Parent_Type))
12233 and then Is_Private_Overriding
12234 and then Is_Abstract_Subprogram (Visible_Subp)
12236 if No (Actual_Subp) then
12237 Set_Alias (New_Subp, Visible_Subp);
12238 Set_Is_Abstract_Subprogram
12241 -- If this is a derivation for an instance of a formal derived
12242 -- type, abstractness comes from the primitive operation of the
12243 -- actual, not from the operation inherited from the ancestor.
12245 Set_Is_Abstract_Subprogram
12246 (New_Subp, Is_Abstract_Subprogram (Actual_Subp));
12250 New_Overloaded_Entity (New_Subp, Derived_Type);
12252 -- Check for case of a derived subprogram for the instantiation of a
12253 -- formal derived tagged type, if so mark the subprogram as dispatching
12254 -- and inherit the dispatching attributes of the parent subprogram. The
12255 -- derived subprogram is effectively renaming of the actual subprogram,
12256 -- so it needs to have the same attributes as the actual.
12258 if Present (Actual_Subp)
12259 and then Is_Dispatching_Operation (Parent_Subp)
12261 Set_Is_Dispatching_Operation (New_Subp);
12263 if Present (DTC_Entity (Parent_Subp)) then
12264 Set_DTC_Entity (New_Subp, DTC_Entity (Parent_Subp));
12265 Set_DT_Position (New_Subp, DT_Position (Parent_Subp));
12269 -- Indicate that a derived subprogram does not require a body and that
12270 -- it does not require processing of default expressions.
12272 Set_Has_Completion (New_Subp);
12273 Set_Default_Expressions_Processed (New_Subp);
12275 if Ekind (New_Subp) = E_Function then
12276 Set_Mechanism (New_Subp, Mechanism (Parent_Subp));
12278 end Derive_Subprogram;
12280 ------------------------
12281 -- Derive_Subprograms --
12282 ------------------------
12284 procedure Derive_Subprograms
12285 (Parent_Type : Entity_Id;
12286 Derived_Type : Entity_Id;
12287 Generic_Actual : Entity_Id := Empty)
12289 Op_List : constant Elist_Id :=
12290 Collect_Primitive_Operations (Parent_Type);
12292 function Check_Derived_Type return Boolean;
12293 -- Check that all primitive inherited from Parent_Type are found in
12294 -- the list of primitives of Derived_Type exactly in the same order.
12296 function Check_Derived_Type return Boolean is
12300 New_Subp : Entity_Id;
12305 -- Traverse list of entities in the current scope searching for
12306 -- an incomplete type whose full-view is derived type
12308 E := First_Entity (Scope (Derived_Type));
12310 and then E /= Derived_Type
12312 if Ekind (E) = E_Incomplete_Type
12313 and then Present (Full_View (E))
12314 and then Full_View (E) = Derived_Type
12316 -- Disable this test if Derived_Type completes an incomplete
12317 -- type because in such case more primitives can be added
12318 -- later to the list of primitives of Derived_Type by routine
12319 -- Process_Incomplete_Dependents
12324 E := Next_Entity (E);
12327 List := Collect_Primitive_Operations (Derived_Type);
12328 Elmt := First_Elmt (List);
12330 Op_Elmt := First_Elmt (Op_List);
12331 while Present (Op_Elmt) loop
12332 Subp := Node (Op_Elmt);
12333 New_Subp := Node (Elmt);
12335 -- At this early stage Derived_Type has no entities with attribute
12336 -- Interface_Alias. In addition, such primitives are always
12337 -- located at the end of the list of primitives of Parent_Type.
12338 -- Therefore, if found we can safely stop processing pending
12341 exit when Present (Interface_Alias (Subp));
12343 -- Handle hidden entities
12345 if not Is_Predefined_Dispatching_Operation (Subp)
12346 and then Is_Hidden (Subp)
12348 if Present (New_Subp)
12349 and then Primitive_Names_Match (Subp, New_Subp)
12355 if not Present (New_Subp)
12356 or else Ekind (Subp) /= Ekind (New_Subp)
12357 or else not Primitive_Names_Match (Subp, New_Subp)
12365 Next_Elmt (Op_Elmt);
12369 end Check_Derived_Type;
12373 Alias_Subp : Entity_Id;
12374 Act_List : Elist_Id;
12375 Act_Elmt : Elmt_Id := No_Elmt;
12376 Act_Subp : Entity_Id := Empty;
12378 Need_Search : Boolean := False;
12379 New_Subp : Entity_Id := Empty;
12380 Parent_Base : Entity_Id;
12383 -- Start of processing for Derive_Subprograms
12386 if Ekind (Parent_Type) = E_Record_Type_With_Private
12387 and then Has_Discriminants (Parent_Type)
12388 and then Present (Full_View (Parent_Type))
12390 Parent_Base := Full_View (Parent_Type);
12392 Parent_Base := Parent_Type;
12395 if Present (Generic_Actual) then
12396 Act_List := Collect_Primitive_Operations (Generic_Actual);
12397 Act_Elmt := First_Elmt (Act_List);
12400 -- Derive primitives inherited from the parent. Note that if the generic
12401 -- actual is present, this is not really a type derivation, it is a
12402 -- completion within an instance.
12404 -- Case 1: Derived_Type does not implement interfaces
12406 if not Is_Tagged_Type (Derived_Type)
12407 or else (not Has_Interfaces (Derived_Type)
12408 and then not (Present (Generic_Actual)
12410 Has_Interfaces (Generic_Actual)))
12412 Elmt := First_Elmt (Op_List);
12413 while Present (Elmt) loop
12414 Subp := Node (Elmt);
12416 -- Literals are derived earlier in the process of building the
12417 -- derived type, and are skipped here.
12419 if Ekind (Subp) = E_Enumeration_Literal then
12422 -- The actual is a direct descendant and the common primitive
12423 -- operations appear in the same order.
12425 -- If the generic parent type is present, the derived type is an
12426 -- instance of a formal derived type, and within the instance its
12427 -- operations are those of the actual. We derive from the formal
12428 -- type but make the inherited operations aliases of the
12429 -- corresponding operations of the actual.
12433 (New_Subp, Subp, Derived_Type, Parent_Base, Node (Act_Elmt));
12435 if Present (Act_Elmt) then
12436 Next_Elmt (Act_Elmt);
12443 -- Case 2: Derived_Type implements interfaces
12446 -- If the parent type has no predefined primitives we remove
12447 -- predefined primitives from the list of primitives of generic
12448 -- actual to simplify the complexity of this algorithm.
12450 if Present (Generic_Actual) then
12452 Has_Predefined_Primitives : Boolean := False;
12455 -- Check if the parent type has predefined primitives
12457 Elmt := First_Elmt (Op_List);
12458 while Present (Elmt) loop
12459 Subp := Node (Elmt);
12461 if Is_Predefined_Dispatching_Operation (Subp)
12462 and then not Comes_From_Source (Ultimate_Alias (Subp))
12464 Has_Predefined_Primitives := True;
12471 -- Remove predefined primitives of Generic_Actual. We must use
12472 -- an auxiliary list because in case of tagged types the value
12473 -- returned by Collect_Primitive_Operations is the value stored
12474 -- in its Primitive_Operations attribute (and we don't want to
12475 -- modify its current contents).
12477 if not Has_Predefined_Primitives then
12479 Aux_List : constant Elist_Id := New_Elmt_List;
12482 Elmt := First_Elmt (Act_List);
12483 while Present (Elmt) loop
12484 Subp := Node (Elmt);
12486 if not Is_Predefined_Dispatching_Operation (Subp)
12487 or else Comes_From_Source (Subp)
12489 Append_Elmt (Subp, Aux_List);
12495 Act_List := Aux_List;
12499 Act_Elmt := First_Elmt (Act_List);
12500 Act_Subp := Node (Act_Elmt);
12504 -- Stage 1: If the generic actual is not present we derive the
12505 -- primitives inherited from the parent type. If the generic parent
12506 -- type is present, the derived type is an instance of a formal
12507 -- derived type, and within the instance its operations are those of
12508 -- the actual. We derive from the formal type but make the inherited
12509 -- operations aliases of the corresponding operations of the actual.
12511 Elmt := First_Elmt (Op_List);
12512 while Present (Elmt) loop
12513 Subp := Node (Elmt);
12514 Alias_Subp := Ultimate_Alias (Subp);
12516 -- At this early stage Derived_Type has no entities with attribute
12517 -- Interface_Alias. In addition, such primitives are always
12518 -- located at the end of the list of primitives of Parent_Type.
12519 -- Therefore, if found we can safely stop processing pending
12522 exit when Present (Interface_Alias (Subp));
12524 -- If the generic actual is present find the corresponding
12525 -- operation in the generic actual. If the parent type is a
12526 -- direct ancestor of the derived type then, even if it is an
12527 -- interface, the operations are inherited from the primary
12528 -- dispatch table and are in the proper order. If we detect here
12529 -- that primitives are not in the same order we traverse the list
12530 -- of primitive operations of the actual to find the one that
12531 -- implements the interface primitive.
12535 (Present (Generic_Actual)
12536 and then Present (Act_Subp)
12537 and then not Primitive_Names_Match (Subp, Act_Subp))
12539 pragma Assert (not Is_Ancestor (Parent_Base, Generic_Actual));
12540 pragma Assert (Is_Interface (Parent_Base));
12542 -- Remember that we need searching for all the pending
12545 Need_Search := True;
12547 -- Handle entities associated with interface primitives
12549 if Present (Alias (Subp))
12550 and then Is_Interface (Find_Dispatching_Type (Alias (Subp)))
12551 and then not Is_Predefined_Dispatching_Operation (Subp)
12554 Find_Primitive_Covering_Interface
12555 (Tagged_Type => Generic_Actual,
12556 Iface_Prim => Subp);
12558 -- Handle predefined primitives plus the rest of user-defined
12562 Act_Elmt := First_Elmt (Act_List);
12563 while Present (Act_Elmt) loop
12564 Act_Subp := Node (Act_Elmt);
12566 exit when Primitive_Names_Match (Subp, Act_Subp)
12567 and then Type_Conformant (Subp, Act_Subp,
12568 Skip_Controlling_Formals => True)
12569 and then No (Interface_Alias (Act_Subp));
12571 Next_Elmt (Act_Elmt);
12576 -- Case 1: If the parent is a limited interface then it has the
12577 -- predefined primitives of synchronized interfaces. However, the
12578 -- actual type may be a non-limited type and hence it does not
12579 -- have such primitives.
12581 if Present (Generic_Actual)
12582 and then not Present (Act_Subp)
12583 and then Is_Limited_Interface (Parent_Base)
12584 and then Is_Predefined_Interface_Primitive (Subp)
12588 -- Case 2: Inherit entities associated with interfaces that
12589 -- were not covered by the parent type. We exclude here null
12590 -- interface primitives because they do not need special
12593 elsif Present (Alias (Subp))
12594 and then Is_Interface (Find_Dispatching_Type (Alias_Subp))
12596 (Nkind (Parent (Alias_Subp)) = N_Procedure_Specification
12597 and then Null_Present (Parent (Alias_Subp)))
12600 (New_Subp => New_Subp,
12601 Parent_Subp => Alias_Subp,
12602 Derived_Type => Derived_Type,
12603 Parent_Type => Find_Dispatching_Type (Alias_Subp),
12604 Actual_Subp => Act_Subp);
12606 if No (Generic_Actual) then
12607 Set_Alias (New_Subp, Subp);
12610 -- Case 3: Common derivation
12614 (New_Subp => New_Subp,
12615 Parent_Subp => Subp,
12616 Derived_Type => Derived_Type,
12617 Parent_Type => Parent_Base,
12618 Actual_Subp => Act_Subp);
12621 -- No need to update Act_Elm if we must search for the
12622 -- corresponding operation in the generic actual
12625 and then Present (Act_Elmt)
12627 Next_Elmt (Act_Elmt);
12628 Act_Subp := Node (Act_Elmt);
12634 -- Inherit additional operations from progenitors. If the derived
12635 -- type is a generic actual, there are not new primitive operations
12636 -- for the type because it has those of the actual, and therefore
12637 -- nothing needs to be done. The renamings generated above are not
12638 -- primitive operations, and their purpose is simply to make the
12639 -- proper operations visible within an instantiation.
12641 if No (Generic_Actual) then
12642 Derive_Progenitor_Subprograms (Parent_Base, Derived_Type);
12646 -- Final check: Direct descendants must have their primitives in the
12647 -- same order. We exclude from this test non-tagged types and instances
12648 -- of formal derived types. We skip this test if we have already
12649 -- reported serious errors in the sources.
12651 pragma Assert (not Is_Tagged_Type (Derived_Type)
12652 or else Present (Generic_Actual)
12653 or else Serious_Errors_Detected > 0
12654 or else Check_Derived_Type);
12655 end Derive_Subprograms;
12657 --------------------------------
12658 -- Derived_Standard_Character --
12659 --------------------------------
12661 procedure Derived_Standard_Character
12663 Parent_Type : Entity_Id;
12664 Derived_Type : Entity_Id)
12666 Loc : constant Source_Ptr := Sloc (N);
12667 Def : constant Node_Id := Type_Definition (N);
12668 Indic : constant Node_Id := Subtype_Indication (Def);
12669 Parent_Base : constant Entity_Id := Base_Type (Parent_Type);
12670 Implicit_Base : constant Entity_Id :=
12672 (E_Enumeration_Type, N, Derived_Type, 'B');
12678 Discard_Node (Process_Subtype (Indic, N));
12680 Set_Etype (Implicit_Base, Parent_Base);
12681 Set_Size_Info (Implicit_Base, Root_Type (Parent_Type));
12682 Set_RM_Size (Implicit_Base, RM_Size (Root_Type (Parent_Type)));
12684 Set_Is_Character_Type (Implicit_Base, True);
12685 Set_Has_Delayed_Freeze (Implicit_Base);
12687 -- The bounds of the implicit base are the bounds of the parent base.
12688 -- Note that their type is the parent base.
12690 Lo := New_Copy_Tree (Type_Low_Bound (Parent_Base));
12691 Hi := New_Copy_Tree (Type_High_Bound (Parent_Base));
12693 Set_Scalar_Range (Implicit_Base,
12696 High_Bound => Hi));
12698 Conditional_Delay (Derived_Type, Parent_Type);
12700 Set_Ekind (Derived_Type, E_Enumeration_Subtype);
12701 Set_Etype (Derived_Type, Implicit_Base);
12702 Set_Size_Info (Derived_Type, Parent_Type);
12704 if Unknown_RM_Size (Derived_Type) then
12705 Set_RM_Size (Derived_Type, RM_Size (Parent_Type));
12708 Set_Is_Character_Type (Derived_Type, True);
12710 if Nkind (Indic) /= N_Subtype_Indication then
12712 -- If no explicit constraint, the bounds are those
12713 -- of the parent type.
12715 Lo := New_Copy_Tree (Type_Low_Bound (Parent_Type));
12716 Hi := New_Copy_Tree (Type_High_Bound (Parent_Type));
12717 Set_Scalar_Range (Derived_Type, Make_Range (Loc, Lo, Hi));
12720 Convert_Scalar_Bounds (N, Parent_Type, Derived_Type, Loc);
12722 -- Because the implicit base is used in the conversion of the bounds, we
12723 -- have to freeze it now. This is similar to what is done for numeric
12724 -- types, and it equally suspicious, but otherwise a non-static bound
12725 -- will have a reference to an unfrozen type, which is rejected by Gigi
12726 -- (???). This requires specific care for definition of stream
12727 -- attributes. For details, see comments at the end of
12728 -- Build_Derived_Numeric_Type.
12730 Freeze_Before (N, Implicit_Base);
12731 end Derived_Standard_Character;
12733 ------------------------------
12734 -- Derived_Type_Declaration --
12735 ------------------------------
12737 procedure Derived_Type_Declaration
12740 Is_Completion : Boolean)
12742 Parent_Type : Entity_Id;
12744 function Comes_From_Generic (Typ : Entity_Id) return Boolean;
12745 -- Check whether the parent type is a generic formal, or derives
12746 -- directly or indirectly from one.
12748 ------------------------
12749 -- Comes_From_Generic --
12750 ------------------------
12752 function Comes_From_Generic (Typ : Entity_Id) return Boolean is
12754 if Is_Generic_Type (Typ) then
12757 elsif Is_Generic_Type (Root_Type (Parent_Type)) then
12760 elsif Is_Private_Type (Typ)
12761 and then Present (Full_View (Typ))
12762 and then Is_Generic_Type (Root_Type (Full_View (Typ)))
12766 elsif Is_Generic_Actual_Type (Typ) then
12772 end Comes_From_Generic;
12776 Def : constant Node_Id := Type_Definition (N);
12777 Iface_Def : Node_Id;
12778 Indic : constant Node_Id := Subtype_Indication (Def);
12779 Extension : constant Node_Id := Record_Extension_Part (Def);
12780 Parent_Node : Node_Id;
12781 Parent_Scope : Entity_Id;
12784 -- Start of processing for Derived_Type_Declaration
12787 Parent_Type := Find_Type_Of_Subtype_Indic (Indic);
12789 -- Ada 2005 (AI-251): In case of interface derivation check that the
12790 -- parent is also an interface.
12792 if Interface_Present (Def) then
12793 if not Is_Interface (Parent_Type) then
12794 Diagnose_Interface (Indic, Parent_Type);
12797 Parent_Node := Parent (Base_Type (Parent_Type));
12798 Iface_Def := Type_Definition (Parent_Node);
12800 -- Ada 2005 (AI-251): Limited interfaces can only inherit from
12801 -- other limited interfaces.
12803 if Limited_Present (Def) then
12804 if Limited_Present (Iface_Def) then
12807 elsif Protected_Present (Iface_Def) then
12809 ("descendant of& must be declared"
12810 & " as a protected interface",
12813 elsif Synchronized_Present (Iface_Def) then
12815 ("descendant of& must be declared"
12816 & " as a synchronized interface",
12819 elsif Task_Present (Iface_Def) then
12821 ("descendant of& must be declared as a task interface",
12826 ("(Ada 2005) limited interface cannot "
12827 & "inherit from non-limited interface", Indic);
12830 -- Ada 2005 (AI-345): Non-limited interfaces can only inherit
12831 -- from non-limited or limited interfaces.
12833 elsif not Protected_Present (Def)
12834 and then not Synchronized_Present (Def)
12835 and then not Task_Present (Def)
12837 if Limited_Present (Iface_Def) then
12840 elsif Protected_Present (Iface_Def) then
12842 ("descendant of& must be declared"
12843 & " as a protected interface",
12846 elsif Synchronized_Present (Iface_Def) then
12848 ("descendant of& must be declared"
12849 & " as a synchronized interface",
12852 elsif Task_Present (Iface_Def) then
12854 ("descendant of& must be declared as a task interface",
12863 if Is_Tagged_Type (Parent_Type)
12864 and then Is_Concurrent_Type (Parent_Type)
12865 and then not Is_Interface (Parent_Type)
12868 ("parent type of a record extension cannot be "
12869 & "a synchronized tagged type (RM 3.9.1 (3/1))", N);
12870 Set_Etype (T, Any_Type);
12874 -- Ada 2005 (AI-251): Decorate all the names in the list of ancestor
12877 if Is_Tagged_Type (Parent_Type)
12878 and then Is_Non_Empty_List (Interface_List (Def))
12885 Intf := First (Interface_List (Def));
12886 while Present (Intf) loop
12887 T := Find_Type_Of_Subtype_Indic (Intf);
12889 if not Is_Interface (T) then
12890 Diagnose_Interface (Intf, T);
12892 -- Check the rules of 3.9.4(12/2) and 7.5(2/2) that disallow
12893 -- a limited type from having a nonlimited progenitor.
12895 elsif (Limited_Present (Def)
12896 or else (not Is_Interface (Parent_Type)
12897 and then Is_Limited_Type (Parent_Type)))
12898 and then not Is_Limited_Interface (T)
12901 ("progenitor interface& of limited type must be limited",
12910 if Parent_Type = Any_Type
12911 or else Etype (Parent_Type) = Any_Type
12912 or else (Is_Class_Wide_Type (Parent_Type)
12913 and then Etype (Parent_Type) = T)
12915 -- If Parent_Type is undefined or illegal, make new type into a
12916 -- subtype of Any_Type, and set a few attributes to prevent cascaded
12917 -- errors. If this is a self-definition, emit error now.
12920 or else T = Etype (Parent_Type)
12922 Error_Msg_N ("type cannot be used in its own definition", Indic);
12925 Set_Ekind (T, Ekind (Parent_Type));
12926 Set_Etype (T, Any_Type);
12927 Set_Scalar_Range (T, Scalar_Range (Any_Type));
12929 if Is_Tagged_Type (T) then
12930 Set_Primitive_Operations (T, New_Elmt_List);
12936 -- Ada 2005 (AI-251): The case in which the parent of the full-view is
12937 -- an interface is special because the list of interfaces in the full
12938 -- view can be given in any order. For example:
12940 -- type A is interface;
12941 -- type B is interface and A;
12942 -- type D is new B with private;
12944 -- type D is new A and B with null record; -- 1 --
12946 -- In this case we perform the following transformation of -1-:
12948 -- type D is new B and A with null record;
12950 -- If the parent of the full-view covers the parent of the partial-view
12951 -- we have two possible cases:
12953 -- 1) They have the same parent
12954 -- 2) The parent of the full-view implements some further interfaces
12956 -- In both cases we do not need to perform the transformation. In the
12957 -- first case the source program is correct and the transformation is
12958 -- not needed; in the second case the source program does not fulfill
12959 -- the no-hidden interfaces rule (AI-396) and the error will be reported
12962 -- This transformation not only simplifies the rest of the analysis of
12963 -- this type declaration but also simplifies the correct generation of
12964 -- the object layout to the expander.
12966 if In_Private_Part (Current_Scope)
12967 and then Is_Interface (Parent_Type)
12971 Partial_View : Entity_Id;
12972 Partial_View_Parent : Entity_Id;
12973 New_Iface : Node_Id;
12976 -- Look for the associated private type declaration
12978 Partial_View := First_Entity (Current_Scope);
12980 exit when No (Partial_View)
12981 or else (Has_Private_Declaration (Partial_View)
12982 and then Full_View (Partial_View) = T);
12984 Next_Entity (Partial_View);
12987 -- If the partial view was not found then the source code has
12988 -- errors and the transformation is not needed.
12990 if Present (Partial_View) then
12991 Partial_View_Parent := Etype (Partial_View);
12993 -- If the parent of the full-view covers the parent of the
12994 -- partial-view we have nothing else to do.
12996 if Interface_Present_In_Ancestor
12997 (Parent_Type, Partial_View_Parent)
13001 -- Traverse the list of interfaces of the full-view to look
13002 -- for the parent of the partial-view and perform the tree
13006 Iface := First (Interface_List (Def));
13007 while Present (Iface) loop
13008 if Etype (Iface) = Etype (Partial_View) then
13009 Rewrite (Subtype_Indication (Def),
13010 New_Copy (Subtype_Indication
13011 (Parent (Partial_View))));
13013 New_Iface := Make_Identifier (Sloc (N),
13014 Chars (Parent_Type));
13015 Append (New_Iface, Interface_List (Def));
13017 -- Analyze the transformed code
13019 Derived_Type_Declaration (T, N, Is_Completion);
13030 -- Only composite types other than array types are allowed to have
13033 if Present (Discriminant_Specifications (N))
13034 and then (Is_Elementary_Type (Parent_Type)
13035 or else Is_Array_Type (Parent_Type))
13036 and then not Error_Posted (N)
13039 ("elementary or array type cannot have discriminants",
13040 Defining_Identifier (First (Discriminant_Specifications (N))));
13041 Set_Has_Discriminants (T, False);
13044 -- In Ada 83, a derived type defined in a package specification cannot
13045 -- be used for further derivation until the end of its visible part.
13046 -- Note that derivation in the private part of the package is allowed.
13048 if Ada_Version = Ada_83
13049 and then Is_Derived_Type (Parent_Type)
13050 and then In_Visible_Part (Scope (Parent_Type))
13052 if Ada_Version = Ada_83 and then Comes_From_Source (Indic) then
13054 ("(Ada 83): premature use of type for derivation", Indic);
13058 -- Check for early use of incomplete or private type
13060 if Ekind (Parent_Type) = E_Void
13061 or else Ekind (Parent_Type) = E_Incomplete_Type
13063 Error_Msg_N ("premature derivation of incomplete type", Indic);
13066 elsif (Is_Incomplete_Or_Private_Type (Parent_Type)
13067 and then not Comes_From_Generic (Parent_Type))
13068 or else Has_Private_Component (Parent_Type)
13070 -- The ancestor type of a formal type can be incomplete, in which
13071 -- case only the operations of the partial view are available in
13072 -- the generic. Subsequent checks may be required when the full
13073 -- view is analyzed, to verify that derivation from a tagged type
13074 -- has an extension.
13076 if Nkind (Original_Node (N)) = N_Formal_Type_Declaration then
13079 elsif No (Underlying_Type (Parent_Type))
13080 or else Has_Private_Component (Parent_Type)
13083 ("premature derivation of derived or private type", Indic);
13085 -- Flag the type itself as being in error, this prevents some
13086 -- nasty problems with subsequent uses of the malformed type.
13088 Set_Error_Posted (T);
13090 -- Check that within the immediate scope of an untagged partial
13091 -- view it's illegal to derive from the partial view if the
13092 -- full view is tagged. (7.3(7))
13094 -- We verify that the Parent_Type is a partial view by checking
13095 -- that it is not a Full_Type_Declaration (i.e. a private type or
13096 -- private extension declaration), to distinguish a partial view
13097 -- from a derivation from a private type which also appears as
13100 elsif Present (Full_View (Parent_Type))
13101 and then Nkind (Parent (Parent_Type)) /= N_Full_Type_Declaration
13102 and then not Is_Tagged_Type (Parent_Type)
13103 and then Is_Tagged_Type (Full_View (Parent_Type))
13105 Parent_Scope := Scope (T);
13106 while Present (Parent_Scope)
13107 and then Parent_Scope /= Standard_Standard
13109 if Parent_Scope = Scope (Parent_Type) then
13111 ("premature derivation from type with tagged full view",
13115 Parent_Scope := Scope (Parent_Scope);
13120 -- Check that form of derivation is appropriate
13122 Taggd := Is_Tagged_Type (Parent_Type);
13124 -- Perhaps the parent type should be changed to the class-wide type's
13125 -- specific type in this case to prevent cascading errors ???
13127 if Present (Extension) and then Is_Class_Wide_Type (Parent_Type) then
13128 Error_Msg_N ("parent type must not be a class-wide type", Indic);
13132 if Present (Extension) and then not Taggd then
13134 ("type derived from untagged type cannot have extension", Indic);
13136 elsif No (Extension) and then Taggd then
13138 -- If this declaration is within a private part (or body) of a
13139 -- generic instantiation then the derivation is allowed (the parent
13140 -- type can only appear tagged in this case if it's a generic actual
13141 -- type, since it would otherwise have been rejected in the analysis
13142 -- of the generic template).
13144 if not Is_Generic_Actual_Type (Parent_Type)
13145 or else In_Visible_Part (Scope (Parent_Type))
13148 ("type derived from tagged type must have extension", Indic);
13152 -- AI-443: Synchronized formal derived types require a private
13153 -- extension. There is no point in checking the ancestor type or
13154 -- the progenitors since the construct is wrong to begin with.
13156 if Ada_Version >= Ada_05
13157 and then Is_Generic_Type (T)
13158 and then Present (Original_Node (N))
13161 Decl : constant Node_Id := Original_Node (N);
13164 if Nkind (Decl) = N_Formal_Type_Declaration
13165 and then Nkind (Formal_Type_Definition (Decl)) =
13166 N_Formal_Derived_Type_Definition
13167 and then Synchronized_Present (Formal_Type_Definition (Decl))
13168 and then No (Extension)
13170 -- Avoid emitting a duplicate error message
13172 and then not Error_Posted (Indic)
13175 ("synchronized derived type must have extension", N);
13180 if Null_Exclusion_Present (Def)
13181 and then not Is_Access_Type (Parent_Type)
13183 Error_Msg_N ("null exclusion can only apply to an access type", N);
13186 -- Avoid deriving parent primitives of underlying record views
13188 Build_Derived_Type (N, Parent_Type, T, Is_Completion,
13189 Derive_Subps => not Is_Underlying_Record_View (T));
13191 -- AI-419: The parent type of an explicitly limited derived type must
13192 -- be a limited type or a limited interface.
13194 if Limited_Present (Def) then
13195 Set_Is_Limited_Record (T);
13197 if Is_Interface (T) then
13198 Set_Is_Limited_Interface (T);
13201 if not Is_Limited_Type (Parent_Type)
13203 (not Is_Interface (Parent_Type)
13204 or else not Is_Limited_Interface (Parent_Type))
13206 Error_Msg_NE ("parent type& of limited type must be limited",
13210 end Derived_Type_Declaration;
13212 ------------------------
13213 -- Diagnose_Interface --
13214 ------------------------
13216 procedure Diagnose_Interface (N : Node_Id; E : Entity_Id) is
13218 if not Is_Interface (E)
13219 and then E /= Any_Type
13221 Error_Msg_NE ("(Ada 2005) & must be an interface", N, E);
13223 end Diagnose_Interface;
13225 ----------------------------------
13226 -- Enumeration_Type_Declaration --
13227 ----------------------------------
13229 procedure Enumeration_Type_Declaration (T : Entity_Id; Def : Node_Id) is
13236 -- Create identifier node representing lower bound
13238 B_Node := New_Node (N_Identifier, Sloc (Def));
13239 L := First (Literals (Def));
13240 Set_Chars (B_Node, Chars (L));
13241 Set_Entity (B_Node, L);
13242 Set_Etype (B_Node, T);
13243 Set_Is_Static_Expression (B_Node, True);
13245 R_Node := New_Node (N_Range, Sloc (Def));
13246 Set_Low_Bound (R_Node, B_Node);
13248 Set_Ekind (T, E_Enumeration_Type);
13249 Set_First_Literal (T, L);
13251 Set_Is_Constrained (T);
13255 -- Loop through literals of enumeration type setting pos and rep values
13256 -- except that if the Ekind is already set, then it means that the
13257 -- literal was already constructed (case of a derived type declaration
13258 -- and we should not disturb the Pos and Rep values.
13260 while Present (L) loop
13261 if Ekind (L) /= E_Enumeration_Literal then
13262 Set_Ekind (L, E_Enumeration_Literal);
13263 Set_Enumeration_Pos (L, Ev);
13264 Set_Enumeration_Rep (L, Ev);
13265 Set_Is_Known_Valid (L, True);
13269 New_Overloaded_Entity (L);
13270 Generate_Definition (L);
13271 Set_Convention (L, Convention_Intrinsic);
13273 if Nkind (L) = N_Defining_Character_Literal then
13274 Set_Is_Character_Type (T, True);
13281 -- Now create a node representing upper bound
13283 B_Node := New_Node (N_Identifier, Sloc (Def));
13284 Set_Chars (B_Node, Chars (Last (Literals (Def))));
13285 Set_Entity (B_Node, Last (Literals (Def)));
13286 Set_Etype (B_Node, T);
13287 Set_Is_Static_Expression (B_Node, True);
13289 Set_High_Bound (R_Node, B_Node);
13291 -- Initialize various fields of the type. Some of this information
13292 -- may be overwritten later through rep.clauses.
13294 Set_Scalar_Range (T, R_Node);
13295 Set_RM_Size (T, UI_From_Int (Minimum_Size (T)));
13296 Set_Enum_Esize (T);
13297 Set_Enum_Pos_To_Rep (T, Empty);
13299 -- Set Discard_Names if configuration pragma set, or if there is
13300 -- a parameterless pragma in the current declarative region
13302 if Global_Discard_Names
13303 or else Discard_Names (Scope (T))
13305 Set_Discard_Names (T);
13308 -- Process end label if there is one
13310 if Present (Def) then
13311 Process_End_Label (Def, 'e', T);
13313 end Enumeration_Type_Declaration;
13315 ---------------------------------
13316 -- Expand_To_Stored_Constraint --
13317 ---------------------------------
13319 function Expand_To_Stored_Constraint
13321 Constraint : Elist_Id) return Elist_Id
13323 Explicitly_Discriminated_Type : Entity_Id;
13324 Expansion : Elist_Id;
13325 Discriminant : Entity_Id;
13327 function Type_With_Explicit_Discrims (Id : Entity_Id) return Entity_Id;
13328 -- Find the nearest type that actually specifies discriminants
13330 ---------------------------------
13331 -- Type_With_Explicit_Discrims --
13332 ---------------------------------
13334 function Type_With_Explicit_Discrims (Id : Entity_Id) return Entity_Id is
13335 Typ : constant E := Base_Type (Id);
13338 if Ekind (Typ) in Incomplete_Or_Private_Kind then
13339 if Present (Full_View (Typ)) then
13340 return Type_With_Explicit_Discrims (Full_View (Typ));
13344 if Has_Discriminants (Typ) then
13349 if Etype (Typ) = Typ then
13351 elsif Has_Discriminants (Typ) then
13354 return Type_With_Explicit_Discrims (Etype (Typ));
13357 end Type_With_Explicit_Discrims;
13359 -- Start of processing for Expand_To_Stored_Constraint
13363 or else Is_Empty_Elmt_List (Constraint)
13368 Explicitly_Discriminated_Type := Type_With_Explicit_Discrims (Typ);
13370 if No (Explicitly_Discriminated_Type) then
13374 Expansion := New_Elmt_List;
13377 First_Stored_Discriminant (Explicitly_Discriminated_Type);
13378 while Present (Discriminant) loop
13380 Get_Discriminant_Value (
13381 Discriminant, Explicitly_Discriminated_Type, Constraint),
13383 Next_Stored_Discriminant (Discriminant);
13387 end Expand_To_Stored_Constraint;
13389 ---------------------------
13390 -- Find_Hidden_Interface --
13391 ---------------------------
13393 function Find_Hidden_Interface
13395 Dest : Elist_Id) return Entity_Id
13398 Iface_Elmt : Elmt_Id;
13401 if Present (Src) and then Present (Dest) then
13402 Iface_Elmt := First_Elmt (Src);
13403 while Present (Iface_Elmt) loop
13404 Iface := Node (Iface_Elmt);
13406 if Is_Interface (Iface)
13407 and then not Contain_Interface (Iface, Dest)
13412 Next_Elmt (Iface_Elmt);
13417 end Find_Hidden_Interface;
13419 --------------------
13420 -- Find_Type_Name --
13421 --------------------
13423 function Find_Type_Name (N : Node_Id) return Entity_Id is
13424 Id : constant Entity_Id := Defining_Identifier (N);
13426 New_Id : Entity_Id;
13427 Prev_Par : Node_Id;
13429 procedure Tag_Mismatch;
13430 -- Diagnose a tagged partial view whose full view is untagged.
13431 -- We post the message on the full view, with a reference to
13432 -- the previous partial view. The partial view can be private
13433 -- or incomplete, and these are handled in a different manner,
13434 -- so we determine the position of the error message from the
13435 -- respective slocs of both.
13441 procedure Tag_Mismatch is
13443 if Sloc (Prev) < Sloc (Id) then
13445 ("full declaration of } must be a tagged type ", Id, Prev);
13448 ("full declaration of } must be a tagged type ", Prev, Id);
13452 -- Start of processing for Find_Type_Name
13455 -- Find incomplete declaration, if one was given
13457 Prev := Current_Entity_In_Scope (Id);
13459 if Present (Prev) then
13461 -- Previous declaration exists. Error if not incomplete/private case
13462 -- except if previous declaration is implicit, etc. Enter_Name will
13463 -- emit error if appropriate.
13465 Prev_Par := Parent (Prev);
13467 if not Is_Incomplete_Or_Private_Type (Prev) then
13471 elsif not Nkind_In (N, N_Full_Type_Declaration,
13472 N_Task_Type_Declaration,
13473 N_Protected_Type_Declaration)
13475 -- Completion must be a full type declarations (RM 7.3(4))
13477 Error_Msg_Sloc := Sloc (Prev);
13478 Error_Msg_NE ("invalid completion of }", Id, Prev);
13480 -- Set scope of Id to avoid cascaded errors. Entity is never
13481 -- examined again, except when saving globals in generics.
13483 Set_Scope (Id, Current_Scope);
13486 -- If this is a repeated incomplete declaration, no further
13487 -- checks are possible.
13489 if Nkind (N) = N_Incomplete_Type_Declaration then
13493 -- Case of full declaration of incomplete type
13495 elsif Ekind (Prev) = E_Incomplete_Type then
13497 -- Indicate that the incomplete declaration has a matching full
13498 -- declaration. The defining occurrence of the incomplete
13499 -- declaration remains the visible one, and the procedure
13500 -- Get_Full_View dereferences it whenever the type is used.
13502 if Present (Full_View (Prev)) then
13503 Error_Msg_NE ("invalid redeclaration of }", Id, Prev);
13506 Set_Full_View (Prev, Id);
13507 Append_Entity (Id, Current_Scope);
13508 Set_Is_Public (Id, Is_Public (Prev));
13509 Set_Is_Internal (Id);
13512 -- Case of full declaration of private type
13515 if Nkind (Parent (Prev)) /= N_Private_Extension_Declaration then
13516 if Etype (Prev) /= Prev then
13518 -- Prev is a private subtype or a derived type, and needs
13521 Error_Msg_NE ("invalid redeclaration of }", Id, Prev);
13524 elsif Ekind (Prev) = E_Private_Type
13525 and then Nkind_In (N, N_Task_Type_Declaration,
13526 N_Protected_Type_Declaration)
13529 ("completion of nonlimited type cannot be limited", N);
13531 elsif Ekind (Prev) = E_Record_Type_With_Private
13532 and then Nkind_In (N, N_Task_Type_Declaration,
13533 N_Protected_Type_Declaration)
13535 if not Is_Limited_Record (Prev) then
13537 ("completion of nonlimited type cannot be limited", N);
13539 elsif No (Interface_List (N)) then
13541 ("completion of tagged private type must be tagged",
13545 elsif Nkind (N) = N_Full_Type_Declaration
13547 Nkind (Type_Definition (N)) = N_Record_Definition
13548 and then Interface_Present (Type_Definition (N))
13551 ("completion of private type cannot be an interface", N);
13554 -- Ada 2005 (AI-251): Private extension declaration of a task
13555 -- type or a protected type. This case arises when covering
13556 -- interface types.
13558 elsif Nkind_In (N, N_Task_Type_Declaration,
13559 N_Protected_Type_Declaration)
13563 elsif Nkind (N) /= N_Full_Type_Declaration
13564 or else Nkind (Type_Definition (N)) /= N_Derived_Type_Definition
13567 ("full view of private extension must be an extension", N);
13569 elsif not (Abstract_Present (Parent (Prev)))
13570 and then Abstract_Present (Type_Definition (N))
13573 ("full view of non-abstract extension cannot be abstract", N);
13576 if not In_Private_Part (Current_Scope) then
13578 ("declaration of full view must appear in private part", N);
13581 Copy_And_Swap (Prev, Id);
13582 Set_Has_Private_Declaration (Prev);
13583 Set_Has_Private_Declaration (Id);
13585 -- If no error, propagate freeze_node from private to full view.
13586 -- It may have been generated for an early operational item.
13588 if Present (Freeze_Node (Id))
13589 and then Serious_Errors_Detected = 0
13590 and then No (Full_View (Id))
13592 Set_Freeze_Node (Prev, Freeze_Node (Id));
13593 Set_Freeze_Node (Id, Empty);
13594 Set_First_Rep_Item (Prev, First_Rep_Item (Id));
13597 Set_Full_View (Id, Prev);
13601 -- Verify that full declaration conforms to partial one
13603 if Is_Incomplete_Or_Private_Type (Prev)
13604 and then Present (Discriminant_Specifications (Prev_Par))
13606 if Present (Discriminant_Specifications (N)) then
13607 if Ekind (Prev) = E_Incomplete_Type then
13608 Check_Discriminant_Conformance (N, Prev, Prev);
13610 Check_Discriminant_Conformance (N, Prev, Id);
13615 ("missing discriminants in full type declaration", N);
13617 -- To avoid cascaded errors on subsequent use, share the
13618 -- discriminants of the partial view.
13620 Set_Discriminant_Specifications (N,
13621 Discriminant_Specifications (Prev_Par));
13625 -- A prior untagged partial view can have an associated class-wide
13626 -- type due to use of the class attribute, and in this case the full
13627 -- type must also be tagged. This Ada 95 usage is deprecated in favor
13628 -- of incomplete tagged declarations, but we check for it.
13631 and then (Is_Tagged_Type (Prev)
13632 or else Present (Class_Wide_Type (Prev)))
13634 -- The full declaration is either a tagged type (including
13635 -- a synchronized type that implements interfaces) or a
13636 -- type extension, otherwise this is an error.
13638 if Nkind_In (N, N_Task_Type_Declaration,
13639 N_Protected_Type_Declaration)
13641 if No (Interface_List (N))
13642 and then not Error_Posted (N)
13647 elsif Nkind (Type_Definition (N)) = N_Record_Definition then
13649 -- Indicate that the previous declaration (tagged incomplete
13650 -- or private declaration) requires the same on the full one.
13652 if not Tagged_Present (Type_Definition (N)) then
13654 Set_Is_Tagged_Type (Id);
13655 Set_Primitive_Operations (Id, New_Elmt_List);
13658 elsif Nkind (Type_Definition (N)) = N_Derived_Type_Definition then
13659 if No (Record_Extension_Part (Type_Definition (N))) then
13661 "full declaration of } must be a record extension",
13664 -- Set some attributes to produce a usable full view
13666 Set_Is_Tagged_Type (Id);
13667 Set_Primitive_Operations (Id, New_Elmt_List);
13678 -- New type declaration
13683 end Find_Type_Name;
13685 -------------------------
13686 -- Find_Type_Of_Object --
13687 -------------------------
13689 function Find_Type_Of_Object
13690 (Obj_Def : Node_Id;
13691 Related_Nod : Node_Id) return Entity_Id
13693 Def_Kind : constant Node_Kind := Nkind (Obj_Def);
13694 P : Node_Id := Parent (Obj_Def);
13699 -- If the parent is a component_definition node we climb to the
13700 -- component_declaration node
13702 if Nkind (P) = N_Component_Definition then
13706 -- Case of an anonymous array subtype
13708 if Nkind_In (Def_Kind, N_Constrained_Array_Definition,
13709 N_Unconstrained_Array_Definition)
13712 Array_Type_Declaration (T, Obj_Def);
13714 -- Create an explicit subtype whenever possible
13716 elsif Nkind (P) /= N_Component_Declaration
13717 and then Def_Kind = N_Subtype_Indication
13719 -- Base name of subtype on object name, which will be unique in
13720 -- the current scope.
13722 -- If this is a duplicate declaration, return base type, to avoid
13723 -- generating duplicate anonymous types.
13725 if Error_Posted (P) then
13726 Analyze (Subtype_Mark (Obj_Def));
13727 return Entity (Subtype_Mark (Obj_Def));
13732 (Chars (Defining_Identifier (Related_Nod)), 'S', 0, 'T');
13734 T := Make_Defining_Identifier (Sloc (P), Nam);
13736 Insert_Action (Obj_Def,
13737 Make_Subtype_Declaration (Sloc (P),
13738 Defining_Identifier => T,
13739 Subtype_Indication => Relocate_Node (Obj_Def)));
13741 -- This subtype may need freezing, and this will not be done
13742 -- automatically if the object declaration is not in declarative
13743 -- part. Since this is an object declaration, the type cannot always
13744 -- be frozen here. Deferred constants do not freeze their type
13745 -- (which often enough will be private).
13747 if Nkind (P) = N_Object_Declaration
13748 and then Constant_Present (P)
13749 and then No (Expression (P))
13753 Insert_Actions (Obj_Def, Freeze_Entity (T, Sloc (P)));
13756 -- Ada 2005 AI-406: the object definition in an object declaration
13757 -- can be an access definition.
13759 elsif Def_Kind = N_Access_Definition then
13760 T := Access_Definition (Related_Nod, Obj_Def);
13761 Set_Is_Local_Anonymous_Access (T);
13763 -- Otherwise, the object definition is just a subtype_mark
13766 T := Process_Subtype (Obj_Def, Related_Nod);
13770 end Find_Type_Of_Object;
13772 --------------------------------
13773 -- Find_Type_Of_Subtype_Indic --
13774 --------------------------------
13776 function Find_Type_Of_Subtype_Indic (S : Node_Id) return Entity_Id is
13780 -- Case of subtype mark with a constraint
13782 if Nkind (S) = N_Subtype_Indication then
13783 Find_Type (Subtype_Mark (S));
13784 Typ := Entity (Subtype_Mark (S));
13787 Is_Valid_Constraint_Kind (Ekind (Typ), Nkind (Constraint (S)))
13790 ("incorrect constraint for this kind of type", Constraint (S));
13791 Rewrite (S, New_Copy_Tree (Subtype_Mark (S)));
13794 -- Otherwise we have a subtype mark without a constraint
13796 elsif Error_Posted (S) then
13797 Rewrite (S, New_Occurrence_Of (Any_Id, Sloc (S)));
13805 -- Check No_Wide_Characters restriction
13807 if Typ = Standard_Wide_Character
13808 or else Typ = Standard_Wide_Wide_Character
13809 or else Typ = Standard_Wide_String
13810 or else Typ = Standard_Wide_Wide_String
13812 Check_Restriction (No_Wide_Characters, S);
13816 end Find_Type_Of_Subtype_Indic;
13818 -------------------------------------
13819 -- Floating_Point_Type_Declaration --
13820 -------------------------------------
13822 procedure Floating_Point_Type_Declaration (T : Entity_Id; Def : Node_Id) is
13823 Digs : constant Node_Id := Digits_Expression (Def);
13825 Base_Typ : Entity_Id;
13826 Implicit_Base : Entity_Id;
13829 function Can_Derive_From (E : Entity_Id) return Boolean;
13830 -- Find if given digits value allows derivation from specified type
13832 ---------------------
13833 -- Can_Derive_From --
13834 ---------------------
13836 function Can_Derive_From (E : Entity_Id) return Boolean is
13837 Spec : constant Entity_Id := Real_Range_Specification (Def);
13840 if Digs_Val > Digits_Value (E) then
13844 if Present (Spec) then
13845 if Expr_Value_R (Type_Low_Bound (E)) >
13846 Expr_Value_R (Low_Bound (Spec))
13851 if Expr_Value_R (Type_High_Bound (E)) <
13852 Expr_Value_R (High_Bound (Spec))
13859 end Can_Derive_From;
13861 -- Start of processing for Floating_Point_Type_Declaration
13864 Check_Restriction (No_Floating_Point, Def);
13866 -- Create an implicit base type
13869 Create_Itype (E_Floating_Point_Type, Parent (Def), T, 'B');
13871 -- Analyze and verify digits value
13873 Analyze_And_Resolve (Digs, Any_Integer);
13874 Check_Digits_Expression (Digs);
13875 Digs_Val := Expr_Value (Digs);
13877 -- Process possible range spec and find correct type to derive from
13879 Process_Real_Range_Specification (Def);
13881 if Can_Derive_From (Standard_Short_Float) then
13882 Base_Typ := Standard_Short_Float;
13883 elsif Can_Derive_From (Standard_Float) then
13884 Base_Typ := Standard_Float;
13885 elsif Can_Derive_From (Standard_Long_Float) then
13886 Base_Typ := Standard_Long_Float;
13887 elsif Can_Derive_From (Standard_Long_Long_Float) then
13888 Base_Typ := Standard_Long_Long_Float;
13890 -- If we can't derive from any existing type, use long_long_float
13891 -- and give appropriate message explaining the problem.
13894 Base_Typ := Standard_Long_Long_Float;
13896 if Digs_Val >= Digits_Value (Standard_Long_Long_Float) then
13897 Error_Msg_Uint_1 := Digits_Value (Standard_Long_Long_Float);
13898 Error_Msg_N ("digits value out of range, maximum is ^", Digs);
13902 ("range too large for any predefined type",
13903 Real_Range_Specification (Def));
13907 -- If there are bounds given in the declaration use them as the bounds
13908 -- of the type, otherwise use the bounds of the predefined base type
13909 -- that was chosen based on the Digits value.
13911 if Present (Real_Range_Specification (Def)) then
13912 Set_Scalar_Range (T, Real_Range_Specification (Def));
13913 Set_Is_Constrained (T);
13915 -- The bounds of this range must be converted to machine numbers
13916 -- in accordance with RM 4.9(38).
13918 Bound := Type_Low_Bound (T);
13920 if Nkind (Bound) = N_Real_Literal then
13922 (Bound, Machine (Base_Typ, Realval (Bound), Round, Bound));
13923 Set_Is_Machine_Number (Bound);
13926 Bound := Type_High_Bound (T);
13928 if Nkind (Bound) = N_Real_Literal then
13930 (Bound, Machine (Base_Typ, Realval (Bound), Round, Bound));
13931 Set_Is_Machine_Number (Bound);
13935 Set_Scalar_Range (T, Scalar_Range (Base_Typ));
13938 -- Complete definition of implicit base and declared first subtype
13940 Set_Etype (Implicit_Base, Base_Typ);
13942 Set_Scalar_Range (Implicit_Base, Scalar_Range (Base_Typ));
13943 Set_Size_Info (Implicit_Base, (Base_Typ));
13944 Set_RM_Size (Implicit_Base, RM_Size (Base_Typ));
13945 Set_First_Rep_Item (Implicit_Base, First_Rep_Item (Base_Typ));
13946 Set_Digits_Value (Implicit_Base, Digits_Value (Base_Typ));
13947 Set_Vax_Float (Implicit_Base, Vax_Float (Base_Typ));
13949 Set_Ekind (T, E_Floating_Point_Subtype);
13950 Set_Etype (T, Implicit_Base);
13952 Set_Size_Info (T, (Implicit_Base));
13953 Set_RM_Size (T, RM_Size (Implicit_Base));
13954 Set_First_Rep_Item (T, First_Rep_Item (Implicit_Base));
13955 Set_Digits_Value (T, Digs_Val);
13956 end Floating_Point_Type_Declaration;
13958 ----------------------------
13959 -- Get_Discriminant_Value --
13960 ----------------------------
13962 -- This is the situation:
13964 -- There is a non-derived type
13966 -- type T0 (Dx, Dy, Dz...)
13968 -- There are zero or more levels of derivation, with each derivation
13969 -- either purely inheriting the discriminants, or defining its own.
13971 -- type Ti is new Ti-1
13973 -- type Ti (Dw) is new Ti-1(Dw, 1, X+Y)
13975 -- subtype Ti is ...
13977 -- The subtype issue is avoided by the use of Original_Record_Component,
13978 -- and the fact that derived subtypes also derive the constraints.
13980 -- This chain leads back from
13982 -- Typ_For_Constraint
13984 -- Typ_For_Constraint has discriminants, and the value for each
13985 -- discriminant is given by its corresponding Elmt of Constraints.
13987 -- Discriminant is some discriminant in this hierarchy
13989 -- We need to return its value
13991 -- We do this by recursively searching each level, and looking for
13992 -- Discriminant. Once we get to the bottom, we start backing up
13993 -- returning the value for it which may in turn be a discriminant
13994 -- further up, so on the backup we continue the substitution.
13996 function Get_Discriminant_Value
13997 (Discriminant : Entity_Id;
13998 Typ_For_Constraint : Entity_Id;
13999 Constraint : Elist_Id) return Node_Id
14001 function Search_Derivation_Levels
14003 Discrim_Values : Elist_Id;
14004 Stored_Discrim_Values : Boolean) return Node_Or_Entity_Id;
14005 -- This is the routine that performs the recursive search of levels
14006 -- as described above.
14008 ------------------------------
14009 -- Search_Derivation_Levels --
14010 ------------------------------
14012 function Search_Derivation_Levels
14014 Discrim_Values : Elist_Id;
14015 Stored_Discrim_Values : Boolean) return Node_Or_Entity_Id
14019 Result : Node_Or_Entity_Id;
14020 Result_Entity : Node_Id;
14023 -- If inappropriate type, return Error, this happens only in
14024 -- cascaded error situations, and we want to avoid a blow up.
14026 if not Is_Composite_Type (Ti) or else Is_Array_Type (Ti) then
14030 -- Look deeper if possible. Use Stored_Constraints only for
14031 -- untagged types. For tagged types use the given constraint.
14032 -- This asymmetry needs explanation???
14034 if not Stored_Discrim_Values
14035 and then Present (Stored_Constraint (Ti))
14036 and then not Is_Tagged_Type (Ti)
14039 Search_Derivation_Levels (Ti, Stored_Constraint (Ti), True);
14042 Td : constant Entity_Id := Etype (Ti);
14046 Result := Discriminant;
14049 if Present (Stored_Constraint (Ti)) then
14051 Search_Derivation_Levels
14052 (Td, Stored_Constraint (Ti), True);
14055 Search_Derivation_Levels
14056 (Td, Discrim_Values, Stored_Discrim_Values);
14062 -- Extra underlying places to search, if not found above. For
14063 -- concurrent types, the relevant discriminant appears in the
14064 -- corresponding record. For a type derived from a private type
14065 -- without discriminant, the full view inherits the discriminants
14066 -- of the full view of the parent.
14068 if Result = Discriminant then
14069 if Is_Concurrent_Type (Ti)
14070 and then Present (Corresponding_Record_Type (Ti))
14073 Search_Derivation_Levels (
14074 Corresponding_Record_Type (Ti),
14076 Stored_Discrim_Values);
14078 elsif Is_Private_Type (Ti)
14079 and then not Has_Discriminants (Ti)
14080 and then Present (Full_View (Ti))
14081 and then Etype (Full_View (Ti)) /= Ti
14084 Search_Derivation_Levels (
14087 Stored_Discrim_Values);
14091 -- If Result is not a (reference to a) discriminant, return it,
14092 -- otherwise set Result_Entity to the discriminant.
14094 if Nkind (Result) = N_Defining_Identifier then
14095 pragma Assert (Result = Discriminant);
14096 Result_Entity := Result;
14099 if not Denotes_Discriminant (Result) then
14103 Result_Entity := Entity (Result);
14106 -- See if this level of derivation actually has discriminants
14107 -- because tagged derivations can add them, hence the lower
14108 -- levels need not have any.
14110 if not Has_Discriminants (Ti) then
14114 -- Scan Ti's discriminants for Result_Entity,
14115 -- and return its corresponding value, if any.
14117 Result_Entity := Original_Record_Component (Result_Entity);
14119 Assoc := First_Elmt (Discrim_Values);
14121 if Stored_Discrim_Values then
14122 Disc := First_Stored_Discriminant (Ti);
14124 Disc := First_Discriminant (Ti);
14127 while Present (Disc) loop
14128 pragma Assert (Present (Assoc));
14130 if Original_Record_Component (Disc) = Result_Entity then
14131 return Node (Assoc);
14136 if Stored_Discrim_Values then
14137 Next_Stored_Discriminant (Disc);
14139 Next_Discriminant (Disc);
14143 -- Could not find it
14146 end Search_Derivation_Levels;
14150 Result : Node_Or_Entity_Id;
14152 -- Start of processing for Get_Discriminant_Value
14155 -- ??? This routine is a gigantic mess and will be deleted. For the
14156 -- time being just test for the trivial case before calling recurse.
14158 if Base_Type (Scope (Discriminant)) = Base_Type (Typ_For_Constraint) then
14164 D := First_Discriminant (Typ_For_Constraint);
14165 E := First_Elmt (Constraint);
14166 while Present (D) loop
14167 if Chars (D) = Chars (Discriminant) then
14171 Next_Discriminant (D);
14177 Result := Search_Derivation_Levels
14178 (Typ_For_Constraint, Constraint, False);
14180 -- ??? hack to disappear when this routine is gone
14182 if Nkind (Result) = N_Defining_Identifier then
14188 D := First_Discriminant (Typ_For_Constraint);
14189 E := First_Elmt (Constraint);
14190 while Present (D) loop
14191 if Corresponding_Discriminant (D) = Discriminant then
14195 Next_Discriminant (D);
14201 pragma Assert (Nkind (Result) /= N_Defining_Identifier);
14203 end Get_Discriminant_Value;
14205 --------------------------
14206 -- Has_Range_Constraint --
14207 --------------------------
14209 function Has_Range_Constraint (N : Node_Id) return Boolean is
14210 C : constant Node_Id := Constraint (N);
14213 if Nkind (C) = N_Range_Constraint then
14216 elsif Nkind (C) = N_Digits_Constraint then
14218 Is_Decimal_Fixed_Point_Type (Entity (Subtype_Mark (N)))
14220 Present (Range_Constraint (C));
14222 elsif Nkind (C) = N_Delta_Constraint then
14223 return Present (Range_Constraint (C));
14228 end Has_Range_Constraint;
14230 ------------------------
14231 -- Inherit_Components --
14232 ------------------------
14234 function Inherit_Components
14236 Parent_Base : Entity_Id;
14237 Derived_Base : Entity_Id;
14238 Is_Tagged : Boolean;
14239 Inherit_Discr : Boolean;
14240 Discs : Elist_Id) return Elist_Id
14242 Assoc_List : constant Elist_Id := New_Elmt_List;
14244 procedure Inherit_Component
14245 (Old_C : Entity_Id;
14246 Plain_Discrim : Boolean := False;
14247 Stored_Discrim : Boolean := False);
14248 -- Inherits component Old_C from Parent_Base to the Derived_Base. If
14249 -- Plain_Discrim is True, Old_C is a discriminant. If Stored_Discrim is
14250 -- True, Old_C is a stored discriminant. If they are both false then
14251 -- Old_C is a regular component.
14253 -----------------------
14254 -- Inherit_Component --
14255 -----------------------
14257 procedure Inherit_Component
14258 (Old_C : Entity_Id;
14259 Plain_Discrim : Boolean := False;
14260 Stored_Discrim : Boolean := False)
14262 New_C : constant Entity_Id := New_Copy (Old_C);
14264 Discrim : Entity_Id;
14265 Corr_Discrim : Entity_Id;
14268 pragma Assert (not Is_Tagged or else not Stored_Discrim);
14270 Set_Parent (New_C, Parent (Old_C));
14272 -- Regular discriminants and components must be inserted in the scope
14273 -- of the Derived_Base. Do it here.
14275 if not Stored_Discrim then
14276 Enter_Name (New_C);
14279 -- For tagged types the Original_Record_Component must point to
14280 -- whatever this field was pointing to in the parent type. This has
14281 -- already been achieved by the call to New_Copy above.
14283 if not Is_Tagged then
14284 Set_Original_Record_Component (New_C, New_C);
14287 -- If we have inherited a component then see if its Etype contains
14288 -- references to Parent_Base discriminants. In this case, replace
14289 -- these references with the constraints given in Discs. We do not
14290 -- do this for the partial view of private types because this is
14291 -- not needed (only the components of the full view will be used
14292 -- for code generation) and cause problem. We also avoid this
14293 -- transformation in some error situations.
14295 if Ekind (New_C) = E_Component then
14296 if (Is_Private_Type (Derived_Base)
14297 and then not Is_Generic_Type (Derived_Base))
14298 or else (Is_Empty_Elmt_List (Discs)
14299 and then not Expander_Active)
14301 Set_Etype (New_C, Etype (Old_C));
14304 -- The current component introduces a circularity of the
14307 -- limited with Pack_2;
14308 -- package Pack_1 is
14309 -- type T_1 is tagged record
14310 -- Comp : access Pack_2.T_2;
14316 -- package Pack_2 is
14317 -- type T_2 is new Pack_1.T_1 with ...;
14322 Constrain_Component_Type
14323 (Old_C, Derived_Base, N, Parent_Base, Discs));
14327 -- In derived tagged types it is illegal to reference a non
14328 -- discriminant component in the parent type. To catch this, mark
14329 -- these components with an Ekind of E_Void. This will be reset in
14330 -- Record_Type_Definition after processing the record extension of
14331 -- the derived type.
14333 -- If the declaration is a private extension, there is no further
14334 -- record extension to process, and the components retain their
14335 -- current kind, because they are visible at this point.
14337 if Is_Tagged and then Ekind (New_C) = E_Component
14338 and then Nkind (N) /= N_Private_Extension_Declaration
14340 Set_Ekind (New_C, E_Void);
14343 if Plain_Discrim then
14344 Set_Corresponding_Discriminant (New_C, Old_C);
14345 Build_Discriminal (New_C);
14347 -- If we are explicitly inheriting a stored discriminant it will be
14348 -- completely hidden.
14350 elsif Stored_Discrim then
14351 Set_Corresponding_Discriminant (New_C, Empty);
14352 Set_Discriminal (New_C, Empty);
14353 Set_Is_Completely_Hidden (New_C);
14355 -- Set the Original_Record_Component of each discriminant in the
14356 -- derived base to point to the corresponding stored that we just
14359 Discrim := First_Discriminant (Derived_Base);
14360 while Present (Discrim) loop
14361 Corr_Discrim := Corresponding_Discriminant (Discrim);
14363 -- Corr_Discrim could be missing in an error situation
14365 if Present (Corr_Discrim)
14366 and then Original_Record_Component (Corr_Discrim) = Old_C
14368 Set_Original_Record_Component (Discrim, New_C);
14371 Next_Discriminant (Discrim);
14374 Append_Entity (New_C, Derived_Base);
14377 if not Is_Tagged then
14378 Append_Elmt (Old_C, Assoc_List);
14379 Append_Elmt (New_C, Assoc_List);
14381 end Inherit_Component;
14383 -- Variables local to Inherit_Component
14385 Loc : constant Source_Ptr := Sloc (N);
14387 Parent_Discrim : Entity_Id;
14388 Stored_Discrim : Entity_Id;
14390 Component : Entity_Id;
14392 -- Start of processing for Inherit_Components
14395 if not Is_Tagged then
14396 Append_Elmt (Parent_Base, Assoc_List);
14397 Append_Elmt (Derived_Base, Assoc_List);
14400 -- Inherit parent discriminants if needed
14402 if Inherit_Discr then
14403 Parent_Discrim := First_Discriminant (Parent_Base);
14404 while Present (Parent_Discrim) loop
14405 Inherit_Component (Parent_Discrim, Plain_Discrim => True);
14406 Next_Discriminant (Parent_Discrim);
14410 -- Create explicit stored discrims for untagged types when necessary
14412 if not Has_Unknown_Discriminants (Derived_Base)
14413 and then Has_Discriminants (Parent_Base)
14414 and then not Is_Tagged
14417 or else First_Discriminant (Parent_Base) /=
14418 First_Stored_Discriminant (Parent_Base))
14420 Stored_Discrim := First_Stored_Discriminant (Parent_Base);
14421 while Present (Stored_Discrim) loop
14422 Inherit_Component (Stored_Discrim, Stored_Discrim => True);
14423 Next_Stored_Discriminant (Stored_Discrim);
14427 -- See if we can apply the second transformation for derived types, as
14428 -- explained in point 6. in the comments above Build_Derived_Record_Type
14429 -- This is achieved by appending Derived_Base discriminants into Discs,
14430 -- which has the side effect of returning a non empty Discs list to the
14431 -- caller of Inherit_Components, which is what we want. This must be
14432 -- done for private derived types if there are explicit stored
14433 -- discriminants, to ensure that we can retrieve the values of the
14434 -- constraints provided in the ancestors.
14437 and then Is_Empty_Elmt_List (Discs)
14438 and then Present (First_Discriminant (Derived_Base))
14440 (not Is_Private_Type (Derived_Base)
14441 or else Is_Completely_Hidden
14442 (First_Stored_Discriminant (Derived_Base))
14443 or else Is_Generic_Type (Derived_Base))
14445 D := First_Discriminant (Derived_Base);
14446 while Present (D) loop
14447 Append_Elmt (New_Reference_To (D, Loc), Discs);
14448 Next_Discriminant (D);
14452 -- Finally, inherit non-discriminant components unless they are not
14453 -- visible because defined or inherited from the full view of the
14454 -- parent. Don't inherit the _parent field of the parent type.
14456 Component := First_Entity (Parent_Base);
14457 while Present (Component) loop
14459 -- Ada 2005 (AI-251): Do not inherit components associated with
14460 -- secondary tags of the parent.
14462 if Ekind (Component) = E_Component
14463 and then Present (Related_Type (Component))
14467 elsif Ekind (Component) /= E_Component
14468 or else Chars (Component) = Name_uParent
14472 -- If the derived type is within the parent type's declarative
14473 -- region, then the components can still be inherited even though
14474 -- they aren't visible at this point. This can occur for cases
14475 -- such as within public child units where the components must
14476 -- become visible upon entering the child unit's private part.
14478 elsif not Is_Visible_Component (Component)
14479 and then not In_Open_Scopes (Scope (Parent_Base))
14483 elsif Ekind (Derived_Base) = E_Private_Type
14484 or else Ekind (Derived_Base) = E_Limited_Private_Type
14489 Inherit_Component (Component);
14492 Next_Entity (Component);
14495 -- For tagged derived types, inherited discriminants cannot be used in
14496 -- component declarations of the record extension part. To achieve this
14497 -- we mark the inherited discriminants as not visible.
14499 if Is_Tagged and then Inherit_Discr then
14500 D := First_Discriminant (Derived_Base);
14501 while Present (D) loop
14502 Set_Is_Immediately_Visible (D, False);
14503 Next_Discriminant (D);
14508 end Inherit_Components;
14510 -----------------------
14511 -- Is_Null_Extension --
14512 -----------------------
14514 function Is_Null_Extension (T : Entity_Id) return Boolean is
14515 Type_Decl : constant Node_Id := Parent (T);
14516 Comp_List : Node_Id;
14520 if Nkind (Type_Decl) /= N_Full_Type_Declaration
14521 or else not Is_Tagged_Type (T)
14522 or else Nkind (Type_Definition (Type_Decl)) /=
14523 N_Derived_Type_Definition
14524 or else No (Record_Extension_Part (Type_Definition (Type_Decl)))
14530 Component_List (Record_Extension_Part (Type_Definition (Type_Decl)));
14532 if Present (Discriminant_Specifications (Type_Decl)) then
14535 elsif Present (Comp_List)
14536 and then Is_Non_Empty_List (Component_Items (Comp_List))
14538 Comp := First (Component_Items (Comp_List));
14540 -- Only user-defined components are relevant. The component list
14541 -- may also contain a parent component and internal components
14542 -- corresponding to secondary tags, but these do not determine
14543 -- whether this is a null extension.
14545 while Present (Comp) loop
14546 if Comes_From_Source (Comp) then
14557 end Is_Null_Extension;
14559 --------------------
14560 -- Is_Progenitor --
14561 --------------------
14563 function Is_Progenitor
14564 (Iface : Entity_Id;
14565 Typ : Entity_Id) return Boolean
14568 return Implements_Interface (Typ, Iface,
14569 Exclude_Parents => True);
14572 ------------------------------
14573 -- Is_Valid_Constraint_Kind --
14574 ------------------------------
14576 function Is_Valid_Constraint_Kind
14577 (T_Kind : Type_Kind;
14578 Constraint_Kind : Node_Kind) return Boolean
14582 when Enumeration_Kind |
14584 return Constraint_Kind = N_Range_Constraint;
14586 when Decimal_Fixed_Point_Kind =>
14587 return Nkind_In (Constraint_Kind, N_Digits_Constraint,
14588 N_Range_Constraint);
14590 when Ordinary_Fixed_Point_Kind =>
14591 return Nkind_In (Constraint_Kind, N_Delta_Constraint,
14592 N_Range_Constraint);
14595 return Nkind_In (Constraint_Kind, N_Digits_Constraint,
14596 N_Range_Constraint);
14603 E_Incomplete_Type |
14606 return Constraint_Kind = N_Index_Or_Discriminant_Constraint;
14609 return True; -- Error will be detected later
14611 end Is_Valid_Constraint_Kind;
14613 --------------------------
14614 -- Is_Visible_Component --
14615 --------------------------
14617 function Is_Visible_Component (C : Entity_Id) return Boolean is
14618 Original_Comp : Entity_Id := Empty;
14619 Original_Scope : Entity_Id;
14620 Type_Scope : Entity_Id;
14622 function Is_Local_Type (Typ : Entity_Id) return Boolean;
14623 -- Check whether parent type of inherited component is declared locally,
14624 -- possibly within a nested package or instance. The current scope is
14625 -- the derived record itself.
14627 -------------------
14628 -- Is_Local_Type --
14629 -------------------
14631 function Is_Local_Type (Typ : Entity_Id) return Boolean is
14635 Scop := Scope (Typ);
14636 while Present (Scop)
14637 and then Scop /= Standard_Standard
14639 if Scop = Scope (Current_Scope) then
14643 Scop := Scope (Scop);
14649 -- Start of processing for Is_Visible_Component
14652 if Ekind (C) = E_Component
14653 or else Ekind (C) = E_Discriminant
14655 Original_Comp := Original_Record_Component (C);
14658 if No (Original_Comp) then
14660 -- Premature usage, or previous error
14665 Original_Scope := Scope (Original_Comp);
14666 Type_Scope := Scope (Base_Type (Scope (C)));
14669 -- This test only concerns tagged types
14671 if not Is_Tagged_Type (Original_Scope) then
14674 -- If it is _Parent or _Tag, there is no visibility issue
14676 elsif not Comes_From_Source (Original_Comp) then
14679 -- If we are in the body of an instantiation, the component is visible
14680 -- even when the parent type (possibly defined in an enclosing unit or
14681 -- in a parent unit) might not.
14683 elsif In_Instance_Body then
14686 -- Discriminants are always visible
14688 elsif Ekind (Original_Comp) = E_Discriminant
14689 and then not Has_Unknown_Discriminants (Original_Scope)
14693 -- If the component has been declared in an ancestor which is currently
14694 -- a private type, then it is not visible. The same applies if the
14695 -- component's containing type is not in an open scope and the original
14696 -- component's enclosing type is a visible full view of a private type
14697 -- (which can occur in cases where an attempt is being made to reference
14698 -- a component in a sibling package that is inherited from a visible
14699 -- component of a type in an ancestor package; the component in the
14700 -- sibling package should not be visible even though the component it
14701 -- inherited from is visible). This does not apply however in the case
14702 -- where the scope of the type is a private child unit, or when the
14703 -- parent comes from a local package in which the ancestor is currently
14704 -- visible. The latter suppression of visibility is needed for cases
14705 -- that are tested in B730006.
14707 elsif Is_Private_Type (Original_Scope)
14709 (not Is_Private_Descendant (Type_Scope)
14710 and then not In_Open_Scopes (Type_Scope)
14711 and then Has_Private_Declaration (Original_Scope))
14713 -- If the type derives from an entity in a formal package, there
14714 -- are no additional visible components.
14716 if Nkind (Original_Node (Unit_Declaration_Node (Type_Scope))) =
14717 N_Formal_Package_Declaration
14721 -- if we are not in the private part of the current package, there
14722 -- are no additional visible components.
14724 elsif Ekind (Scope (Current_Scope)) = E_Package
14725 and then not In_Private_Part (Scope (Current_Scope))
14730 Is_Child_Unit (Cunit_Entity (Current_Sem_Unit))
14731 and then In_Open_Scopes (Scope (Original_Scope))
14732 and then Is_Local_Type (Type_Scope);
14735 -- There is another weird way in which a component may be invisible
14736 -- when the private and the full view are not derived from the same
14737 -- ancestor. Here is an example :
14739 -- type A1 is tagged record F1 : integer; end record;
14740 -- type A2 is new A1 with record F2 : integer; end record;
14741 -- type T is new A1 with private;
14743 -- type T is new A2 with null record;
14745 -- In this case, the full view of T inherits F1 and F2 but the private
14746 -- view inherits only F1
14750 Ancestor : Entity_Id := Scope (C);
14754 if Ancestor = Original_Scope then
14756 elsif Ancestor = Etype (Ancestor) then
14760 Ancestor := Etype (Ancestor);
14764 end Is_Visible_Component;
14766 --------------------------
14767 -- Make_Class_Wide_Type --
14768 --------------------------
14770 procedure Make_Class_Wide_Type (T : Entity_Id) is
14771 CW_Type : Entity_Id;
14773 Next_E : Entity_Id;
14776 -- The class wide type can have been defined by the partial view, in
14777 -- which case everything is already done.
14779 if Present (Class_Wide_Type (T)) then
14784 New_External_Entity (E_Void, Scope (T), Sloc (T), T, 'C', 0, 'T');
14786 -- Inherit root type characteristics
14788 CW_Name := Chars (CW_Type);
14789 Next_E := Next_Entity (CW_Type);
14790 Copy_Node (T, CW_Type);
14791 Set_Comes_From_Source (CW_Type, False);
14792 Set_Chars (CW_Type, CW_Name);
14793 Set_Parent (CW_Type, Parent (T));
14794 Set_Next_Entity (CW_Type, Next_E);
14796 -- Ensure we have a new freeze node for the class-wide type. The partial
14797 -- view may have freeze action of its own, requiring a proper freeze
14798 -- node, and the same freeze node cannot be shared between the two
14801 Set_Has_Delayed_Freeze (CW_Type);
14802 Set_Freeze_Node (CW_Type, Empty);
14804 -- Customize the class-wide type: It has no prim. op., it cannot be
14805 -- abstract and its Etype points back to the specific root type.
14807 Set_Ekind (CW_Type, E_Class_Wide_Type);
14808 Set_Is_Tagged_Type (CW_Type, True);
14809 Set_Primitive_Operations (CW_Type, New_Elmt_List);
14810 Set_Is_Abstract_Type (CW_Type, False);
14811 Set_Is_Constrained (CW_Type, False);
14812 Set_Is_First_Subtype (CW_Type, Is_First_Subtype (T));
14814 if Ekind (T) = E_Class_Wide_Subtype then
14815 Set_Etype (CW_Type, Etype (Base_Type (T)));
14817 Set_Etype (CW_Type, T);
14820 -- If this is the class_wide type of a constrained subtype, it does
14821 -- not have discriminants.
14823 Set_Has_Discriminants (CW_Type,
14824 Has_Discriminants (T) and then not Is_Constrained (T));
14826 Set_Has_Unknown_Discriminants (CW_Type, True);
14827 Set_Class_Wide_Type (T, CW_Type);
14828 Set_Equivalent_Type (CW_Type, Empty);
14830 -- The class-wide type of a class-wide type is itself (RM 3.9(14))
14832 Set_Class_Wide_Type (CW_Type, CW_Type);
14833 end Make_Class_Wide_Type;
14839 procedure Make_Index
14841 Related_Nod : Node_Id;
14842 Related_Id : Entity_Id := Empty;
14843 Suffix_Index : Nat := 1)
14847 Def_Id : Entity_Id := Empty;
14848 Found : Boolean := False;
14851 -- For a discrete range used in a constrained array definition and
14852 -- defined by a range, an implicit conversion to the predefined type
14853 -- INTEGER is assumed if each bound is either a numeric literal, a named
14854 -- number, or an attribute, and the type of both bounds (prior to the
14855 -- implicit conversion) is the type universal_integer. Otherwise, both
14856 -- bounds must be of the same discrete type, other than universal
14857 -- integer; this type must be determinable independently of the
14858 -- context, but using the fact that the type must be discrete and that
14859 -- both bounds must have the same type.
14861 -- Character literals also have a universal type in the absence of
14862 -- of additional context, and are resolved to Standard_Character.
14864 if Nkind (I) = N_Range then
14866 -- The index is given by a range constraint. The bounds are known
14867 -- to be of a consistent type.
14869 if not Is_Overloaded (I) then
14872 -- For universal bounds, choose the specific predefined type
14874 if T = Universal_Integer then
14875 T := Standard_Integer;
14877 elsif T = Any_Character then
14878 Ambiguous_Character (Low_Bound (I));
14880 T := Standard_Character;
14883 -- The node may be overloaded because some user-defined operators
14884 -- are available, but if a universal interpretation exists it is
14885 -- also the selected one.
14887 elsif Universal_Interpretation (I) = Universal_Integer then
14888 T := Standard_Integer;
14894 Ind : Interp_Index;
14898 Get_First_Interp (I, Ind, It);
14899 while Present (It.Typ) loop
14900 if Is_Discrete_Type (It.Typ) then
14903 and then not Covers (It.Typ, T)
14904 and then not Covers (T, It.Typ)
14906 Error_Msg_N ("ambiguous bounds in discrete range", I);
14914 Get_Next_Interp (Ind, It);
14917 if T = Any_Type then
14918 Error_Msg_N ("discrete type required for range", I);
14919 Set_Etype (I, Any_Type);
14922 elsif T = Universal_Integer then
14923 T := Standard_Integer;
14928 if not Is_Discrete_Type (T) then
14929 Error_Msg_N ("discrete type required for range", I);
14930 Set_Etype (I, Any_Type);
14934 if Nkind (Low_Bound (I)) = N_Attribute_Reference
14935 and then Attribute_Name (Low_Bound (I)) = Name_First
14936 and then Is_Entity_Name (Prefix (Low_Bound (I)))
14937 and then Is_Type (Entity (Prefix (Low_Bound (I))))
14938 and then Is_Discrete_Type (Entity (Prefix (Low_Bound (I))))
14940 -- The type of the index will be the type of the prefix, as long
14941 -- as the upper bound is 'Last of the same type.
14943 Def_Id := Entity (Prefix (Low_Bound (I)));
14945 if Nkind (High_Bound (I)) /= N_Attribute_Reference
14946 or else Attribute_Name (High_Bound (I)) /= Name_Last
14947 or else not Is_Entity_Name (Prefix (High_Bound (I)))
14948 or else Entity (Prefix (High_Bound (I))) /= Def_Id
14955 Process_Range_Expr_In_Decl (R, T);
14957 elsif Nkind (I) = N_Subtype_Indication then
14959 -- The index is given by a subtype with a range constraint
14961 T := Base_Type (Entity (Subtype_Mark (I)));
14963 if not Is_Discrete_Type (T) then
14964 Error_Msg_N ("discrete type required for range", I);
14965 Set_Etype (I, Any_Type);
14969 R := Range_Expression (Constraint (I));
14972 Process_Range_Expr_In_Decl (R, Entity (Subtype_Mark (I)));
14974 elsif Nkind (I) = N_Attribute_Reference then
14976 -- The parser guarantees that the attribute is a RANGE attribute
14978 -- If the node denotes the range of a type mark, that is also the
14979 -- resulting type, and we do no need to create an Itype for it.
14981 if Is_Entity_Name (Prefix (I))
14982 and then Comes_From_Source (I)
14983 and then Is_Type (Entity (Prefix (I)))
14984 and then Is_Discrete_Type (Entity (Prefix (I)))
14986 Def_Id := Entity (Prefix (I));
14989 Analyze_And_Resolve (I);
14993 -- If none of the above, must be a subtype. We convert this to a
14994 -- range attribute reference because in the case of declared first
14995 -- named subtypes, the types in the range reference can be different
14996 -- from the type of the entity. A range attribute normalizes the
14997 -- reference and obtains the correct types for the bounds.
14999 -- This transformation is in the nature of an expansion, is only
15000 -- done if expansion is active. In particular, it is not done on
15001 -- formal generic types, because we need to retain the name of the
15002 -- original index for instantiation purposes.
15005 if not Is_Entity_Name (I) or else not Is_Type (Entity (I)) then
15006 Error_Msg_N ("invalid subtype mark in discrete range ", I);
15007 Set_Etype (I, Any_Integer);
15011 -- The type mark may be that of an incomplete type. It is only
15012 -- now that we can get the full view, previous analysis does
15013 -- not look specifically for a type mark.
15015 Set_Entity (I, Get_Full_View (Entity (I)));
15016 Set_Etype (I, Entity (I));
15017 Def_Id := Entity (I);
15019 if not Is_Discrete_Type (Def_Id) then
15020 Error_Msg_N ("discrete type required for index", I);
15021 Set_Etype (I, Any_Type);
15026 if Expander_Active then
15028 Make_Attribute_Reference (Sloc (I),
15029 Attribute_Name => Name_Range,
15030 Prefix => Relocate_Node (I)));
15032 -- The original was a subtype mark that does not freeze. This
15033 -- means that the rewritten version must not freeze either.
15035 Set_Must_Not_Freeze (I);
15036 Set_Must_Not_Freeze (Prefix (I));
15038 -- Is order critical??? if so, document why, if not
15039 -- use Analyze_And_Resolve
15041 Analyze_And_Resolve (I);
15045 -- If expander is inactive, type is legal, nothing else to construct
15052 if not Is_Discrete_Type (T) then
15053 Error_Msg_N ("discrete type required for range", I);
15054 Set_Etype (I, Any_Type);
15057 elsif T = Any_Type then
15058 Set_Etype (I, Any_Type);
15062 -- We will now create the appropriate Itype to describe the range, but
15063 -- first a check. If we originally had a subtype, then we just label
15064 -- the range with this subtype. Not only is there no need to construct
15065 -- a new subtype, but it is wrong to do so for two reasons:
15067 -- 1. A legality concern, if we have a subtype, it must not freeze,
15068 -- and the Itype would cause freezing incorrectly
15070 -- 2. An efficiency concern, if we created an Itype, it would not be
15071 -- recognized as the same type for the purposes of eliminating
15072 -- checks in some circumstances.
15074 -- We signal this case by setting the subtype entity in Def_Id
15076 if No (Def_Id) then
15078 Create_Itype (E_Void, Related_Nod, Related_Id, 'D', Suffix_Index);
15079 Set_Etype (Def_Id, Base_Type (T));
15081 if Is_Signed_Integer_Type (T) then
15082 Set_Ekind (Def_Id, E_Signed_Integer_Subtype);
15084 elsif Is_Modular_Integer_Type (T) then
15085 Set_Ekind (Def_Id, E_Modular_Integer_Subtype);
15088 Set_Ekind (Def_Id, E_Enumeration_Subtype);
15089 Set_Is_Character_Type (Def_Id, Is_Character_Type (T));
15090 Set_First_Literal (Def_Id, First_Literal (T));
15093 Set_Size_Info (Def_Id, (T));
15094 Set_RM_Size (Def_Id, RM_Size (T));
15095 Set_First_Rep_Item (Def_Id, First_Rep_Item (T));
15097 Set_Scalar_Range (Def_Id, R);
15098 Conditional_Delay (Def_Id, T);
15100 -- In the subtype indication case, if the immediate parent of the
15101 -- new subtype is non-static, then the subtype we create is non-
15102 -- static, even if its bounds are static.
15104 if Nkind (I) = N_Subtype_Indication
15105 and then not Is_Static_Subtype (Entity (Subtype_Mark (I)))
15107 Set_Is_Non_Static_Subtype (Def_Id);
15111 -- Final step is to label the index with this constructed type
15113 Set_Etype (I, Def_Id);
15116 ------------------------------
15117 -- Modular_Type_Declaration --
15118 ------------------------------
15120 procedure Modular_Type_Declaration (T : Entity_Id; Def : Node_Id) is
15121 Mod_Expr : constant Node_Id := Expression (Def);
15124 procedure Set_Modular_Size (Bits : Int);
15125 -- Sets RM_Size to Bits, and Esize to normal word size above this
15127 ----------------------
15128 -- Set_Modular_Size --
15129 ----------------------
15131 procedure Set_Modular_Size (Bits : Int) is
15133 Set_RM_Size (T, UI_From_Int (Bits));
15138 elsif Bits <= 16 then
15139 Init_Esize (T, 16);
15141 elsif Bits <= 32 then
15142 Init_Esize (T, 32);
15145 Init_Esize (T, System_Max_Binary_Modulus_Power);
15148 if not Non_Binary_Modulus (T)
15149 and then Esize (T) = RM_Size (T)
15151 Set_Is_Known_Valid (T);
15153 end Set_Modular_Size;
15155 -- Start of processing for Modular_Type_Declaration
15158 Analyze_And_Resolve (Mod_Expr, Any_Integer);
15160 Set_Ekind (T, E_Modular_Integer_Type);
15161 Init_Alignment (T);
15162 Set_Is_Constrained (T);
15164 if not Is_OK_Static_Expression (Mod_Expr) then
15165 Flag_Non_Static_Expr
15166 ("non-static expression used for modular type bound!", Mod_Expr);
15167 M_Val := 2 ** System_Max_Binary_Modulus_Power;
15169 M_Val := Expr_Value (Mod_Expr);
15173 Error_Msg_N ("modulus value must be positive", Mod_Expr);
15174 M_Val := 2 ** System_Max_Binary_Modulus_Power;
15177 Set_Modulus (T, M_Val);
15179 -- Create bounds for the modular type based on the modulus given in
15180 -- the type declaration and then analyze and resolve those bounds.
15182 Set_Scalar_Range (T,
15183 Make_Range (Sloc (Mod_Expr),
15185 Make_Integer_Literal (Sloc (Mod_Expr), 0),
15187 Make_Integer_Literal (Sloc (Mod_Expr), M_Val - 1)));
15189 -- Properly analyze the literals for the range. We do this manually
15190 -- because we can't go calling Resolve, since we are resolving these
15191 -- bounds with the type, and this type is certainly not complete yet!
15193 Set_Etype (Low_Bound (Scalar_Range (T)), T);
15194 Set_Etype (High_Bound (Scalar_Range (T)), T);
15195 Set_Is_Static_Expression (Low_Bound (Scalar_Range (T)));
15196 Set_Is_Static_Expression (High_Bound (Scalar_Range (T)));
15198 -- Loop through powers of two to find number of bits required
15200 for Bits in Int range 0 .. System_Max_Binary_Modulus_Power loop
15204 if M_Val = 2 ** Bits then
15205 Set_Modular_Size (Bits);
15210 elsif M_Val < 2 ** Bits then
15211 Set_Non_Binary_Modulus (T);
15213 if Bits > System_Max_Nonbinary_Modulus_Power then
15214 Error_Msg_Uint_1 :=
15215 UI_From_Int (System_Max_Nonbinary_Modulus_Power);
15217 ("nonbinary modulus exceeds limit (2 '*'*^ - 1)", Mod_Expr);
15218 Set_Modular_Size (System_Max_Binary_Modulus_Power);
15222 -- In the non-binary case, set size as per RM 13.3(55)
15224 Set_Modular_Size (Bits);
15231 -- If we fall through, then the size exceed System.Max_Binary_Modulus
15232 -- so we just signal an error and set the maximum size.
15234 Error_Msg_Uint_1 := UI_From_Int (System_Max_Binary_Modulus_Power);
15235 Error_Msg_F ("modulus exceeds limit (2 '*'*^)", Mod_Expr);
15237 Set_Modular_Size (System_Max_Binary_Modulus_Power);
15238 Init_Alignment (T);
15240 end Modular_Type_Declaration;
15242 --------------------------
15243 -- New_Concatenation_Op --
15244 --------------------------
15246 procedure New_Concatenation_Op (Typ : Entity_Id) is
15247 Loc : constant Source_Ptr := Sloc (Typ);
15250 function Make_Op_Formal (Typ, Op : Entity_Id) return Entity_Id;
15251 -- Create abbreviated declaration for the formal of a predefined
15252 -- Operator 'Op' of type 'Typ'
15254 --------------------
15255 -- Make_Op_Formal --
15256 --------------------
15258 function Make_Op_Formal (Typ, Op : Entity_Id) return Entity_Id is
15259 Formal : Entity_Id;
15261 Formal := New_Internal_Entity (E_In_Parameter, Op, Loc, 'P');
15262 Set_Etype (Formal, Typ);
15263 Set_Mechanism (Formal, Default_Mechanism);
15265 end Make_Op_Formal;
15267 -- Start of processing for New_Concatenation_Op
15270 Op := Make_Defining_Operator_Symbol (Loc, Name_Op_Concat);
15272 Set_Ekind (Op, E_Operator);
15273 Set_Scope (Op, Current_Scope);
15274 Set_Etype (Op, Typ);
15275 Set_Homonym (Op, Get_Name_Entity_Id (Name_Op_Concat));
15276 Set_Is_Immediately_Visible (Op);
15277 Set_Is_Intrinsic_Subprogram (Op);
15278 Set_Has_Completion (Op);
15279 Append_Entity (Op, Current_Scope);
15281 Set_Name_Entity_Id (Name_Op_Concat, Op);
15283 Append_Entity (Make_Op_Formal (Typ, Op), Op);
15284 Append_Entity (Make_Op_Formal (Typ, Op), Op);
15285 end New_Concatenation_Op;
15287 -------------------------
15288 -- OK_For_Limited_Init --
15289 -------------------------
15291 -- ???Check all calls of this, and compare the conditions under which it's
15294 function OK_For_Limited_Init (Exp : Node_Id) return Boolean is
15296 return Ada_Version >= Ada_05
15297 and then not Debug_Flag_Dot_L
15298 and then OK_For_Limited_Init_In_05 (Exp);
15299 end OK_For_Limited_Init;
15301 -------------------------------
15302 -- OK_For_Limited_Init_In_05 --
15303 -------------------------------
15305 function OK_For_Limited_Init_In_05 (Exp : Node_Id) return Boolean is
15307 -- Ada 2005 (AI-287, AI-318): Relax the strictness of the front end in
15308 -- case of limited aggregates (including extension aggregates), and
15309 -- function calls. The function call may have been give in prefixed
15310 -- notation, in which case the original node is an indexed component.
15312 case Nkind (Original_Node (Exp)) is
15313 when N_Aggregate | N_Extension_Aggregate | N_Function_Call | N_Op =>
15316 when N_Qualified_Expression =>
15318 OK_For_Limited_Init_In_05 (Expression (Original_Node (Exp)));
15320 -- Ada 2005 (AI-251): If a class-wide interface object is initialized
15321 -- with a function call, the expander has rewritten the call into an
15322 -- N_Type_Conversion node to force displacement of the pointer to
15323 -- reference the component containing the secondary dispatch table.
15324 -- Otherwise a type conversion is not a legal context.
15326 when N_Type_Conversion =>
15327 return not Comes_From_Source (Exp)
15329 OK_For_Limited_Init_In_05 (Expression (Original_Node (Exp)));
15331 when N_Indexed_Component | N_Selected_Component =>
15332 return Nkind (Exp) = N_Function_Call;
15334 -- A use of 'Input is a function call, hence allowed. Normally the
15335 -- attribute will be changed to a call, but the attribute by itself
15336 -- can occur with -gnatc.
15338 when N_Attribute_Reference =>
15339 return Attribute_Name (Original_Node (Exp)) = Name_Input;
15344 end OK_For_Limited_Init_In_05;
15346 -------------------------------------------
15347 -- Ordinary_Fixed_Point_Type_Declaration --
15348 -------------------------------------------
15350 procedure Ordinary_Fixed_Point_Type_Declaration
15354 Loc : constant Source_Ptr := Sloc (Def);
15355 Delta_Expr : constant Node_Id := Delta_Expression (Def);
15356 RRS : constant Node_Id := Real_Range_Specification (Def);
15357 Implicit_Base : Entity_Id;
15364 Check_Restriction (No_Fixed_Point, Def);
15366 -- Create implicit base type
15369 Create_Itype (E_Ordinary_Fixed_Point_Type, Parent (Def), T, 'B');
15370 Set_Etype (Implicit_Base, Implicit_Base);
15372 -- Analyze and process delta expression
15374 Analyze_And_Resolve (Delta_Expr, Any_Real);
15376 Check_Delta_Expression (Delta_Expr);
15377 Delta_Val := Expr_Value_R (Delta_Expr);
15379 Set_Delta_Value (Implicit_Base, Delta_Val);
15381 -- Compute default small from given delta, which is the largest power
15382 -- of two that does not exceed the given delta value.
15392 if Delta_Val < Ureal_1 then
15393 while Delta_Val < Tmp loop
15394 Tmp := Tmp / Ureal_2;
15395 Scale := Scale + 1;
15400 Tmp := Tmp * Ureal_2;
15401 exit when Tmp > Delta_Val;
15402 Scale := Scale - 1;
15406 Small_Val := UR_From_Components (Uint_1, UI_From_Int (Scale), 2);
15409 Set_Small_Value (Implicit_Base, Small_Val);
15411 -- If no range was given, set a dummy range
15413 if RRS <= Empty_Or_Error then
15414 Low_Val := -Small_Val;
15415 High_Val := Small_Val;
15417 -- Otherwise analyze and process given range
15421 Low : constant Node_Id := Low_Bound (RRS);
15422 High : constant Node_Id := High_Bound (RRS);
15425 Analyze_And_Resolve (Low, Any_Real);
15426 Analyze_And_Resolve (High, Any_Real);
15427 Check_Real_Bound (Low);
15428 Check_Real_Bound (High);
15430 -- Obtain and set the range
15432 Low_Val := Expr_Value_R (Low);
15433 High_Val := Expr_Value_R (High);
15435 if Low_Val > High_Val then
15436 Error_Msg_NE ("?fixed point type& has null range", Def, T);
15441 -- The range for both the implicit base and the declared first subtype
15442 -- cannot be set yet, so we use the special routine Set_Fixed_Range to
15443 -- set a temporary range in place. Note that the bounds of the base
15444 -- type will be widened to be symmetrical and to fill the available
15445 -- bits when the type is frozen.
15447 -- We could do this with all discrete types, and probably should, but
15448 -- we absolutely have to do it for fixed-point, since the end-points
15449 -- of the range and the size are determined by the small value, which
15450 -- could be reset before the freeze point.
15452 Set_Fixed_Range (Implicit_Base, Loc, Low_Val, High_Val);
15453 Set_Fixed_Range (T, Loc, Low_Val, High_Val);
15455 -- Complete definition of first subtype
15457 Set_Ekind (T, E_Ordinary_Fixed_Point_Subtype);
15458 Set_Etype (T, Implicit_Base);
15459 Init_Size_Align (T);
15460 Set_First_Rep_Item (T, First_Rep_Item (Implicit_Base));
15461 Set_Small_Value (T, Small_Val);
15462 Set_Delta_Value (T, Delta_Val);
15463 Set_Is_Constrained (T);
15465 end Ordinary_Fixed_Point_Type_Declaration;
15467 ----------------------------------------
15468 -- Prepare_Private_Subtype_Completion --
15469 ----------------------------------------
15471 procedure Prepare_Private_Subtype_Completion
15473 Related_Nod : Node_Id)
15475 Id_B : constant Entity_Id := Base_Type (Id);
15476 Full_B : constant Entity_Id := Full_View (Id_B);
15480 if Present (Full_B) then
15482 -- The Base_Type is already completed, we can complete the subtype
15483 -- now. We have to create a new entity with the same name, Thus we
15484 -- can't use Create_Itype.
15486 -- This is messy, should be fixed ???
15488 Full := Make_Defining_Identifier (Sloc (Id), Chars (Id));
15489 Set_Is_Itype (Full);
15490 Set_Associated_Node_For_Itype (Full, Related_Nod);
15491 Complete_Private_Subtype (Id, Full, Full_B, Related_Nod);
15494 -- The parent subtype may be private, but the base might not, in some
15495 -- nested instances. In that case, the subtype does not need to be
15496 -- exchanged. It would still be nice to make private subtypes and their
15497 -- bases consistent at all times ???
15499 if Is_Private_Type (Id_B) then
15500 Append_Elmt (Id, Private_Dependents (Id_B));
15503 end Prepare_Private_Subtype_Completion;
15505 ---------------------------
15506 -- Process_Discriminants --
15507 ---------------------------
15509 procedure Process_Discriminants
15511 Prev : Entity_Id := Empty)
15513 Elist : constant Elist_Id := New_Elmt_List;
15516 Discr_Number : Uint;
15517 Discr_Type : Entity_Id;
15518 Default_Present : Boolean := False;
15519 Default_Not_Present : Boolean := False;
15522 -- A composite type other than an array type can have discriminants.
15523 -- On entry, the current scope is the composite type.
15525 -- The discriminants are initially entered into the scope of the type
15526 -- via Enter_Name with the default Ekind of E_Void to prevent premature
15527 -- use, as explained at the end of this procedure.
15529 Discr := First (Discriminant_Specifications (N));
15530 while Present (Discr) loop
15531 Enter_Name (Defining_Identifier (Discr));
15533 -- For navigation purposes we add a reference to the discriminant
15534 -- in the entity for the type. If the current declaration is a
15535 -- completion, place references on the partial view. Otherwise the
15536 -- type is the current scope.
15538 if Present (Prev) then
15540 -- The references go on the partial view, if present. If the
15541 -- partial view has discriminants, the references have been
15542 -- generated already.
15544 if not Has_Discriminants (Prev) then
15545 Generate_Reference (Prev, Defining_Identifier (Discr), 'd');
15549 (Current_Scope, Defining_Identifier (Discr), 'd');
15552 if Nkind (Discriminant_Type (Discr)) = N_Access_Definition then
15553 Discr_Type := Access_Definition (Discr, Discriminant_Type (Discr));
15555 -- Ada 2005 (AI-254)
15557 if Present (Access_To_Subprogram_Definition
15558 (Discriminant_Type (Discr)))
15559 and then Protected_Present (Access_To_Subprogram_Definition
15560 (Discriminant_Type (Discr)))
15563 Replace_Anonymous_Access_To_Protected_Subprogram (Discr);
15567 Find_Type (Discriminant_Type (Discr));
15568 Discr_Type := Etype (Discriminant_Type (Discr));
15570 if Error_Posted (Discriminant_Type (Discr)) then
15571 Discr_Type := Any_Type;
15575 if Is_Access_Type (Discr_Type) then
15577 -- Ada 2005 (AI-230): Access discriminant allowed in non-limited
15580 if Ada_Version < Ada_05 then
15581 Check_Access_Discriminant_Requires_Limited
15582 (Discr, Discriminant_Type (Discr));
15585 if Ada_Version = Ada_83 and then Comes_From_Source (Discr) then
15587 ("(Ada 83) access discriminant not allowed", Discr);
15590 elsif not Is_Discrete_Type (Discr_Type) then
15591 Error_Msg_N ("discriminants must have a discrete or access type",
15592 Discriminant_Type (Discr));
15595 Set_Etype (Defining_Identifier (Discr), Discr_Type);
15597 -- If a discriminant specification includes the assignment compound
15598 -- delimiter followed by an expression, the expression is the default
15599 -- expression of the discriminant; the default expression must be of
15600 -- the type of the discriminant. (RM 3.7.1) Since this expression is
15601 -- a default expression, we do the special preanalysis, since this
15602 -- expression does not freeze (see "Handling of Default and Per-
15603 -- Object Expressions" in spec of package Sem).
15605 if Present (Expression (Discr)) then
15606 Preanalyze_Spec_Expression (Expression (Discr), Discr_Type);
15608 if Nkind (N) = N_Formal_Type_Declaration then
15610 ("discriminant defaults not allowed for formal type",
15611 Expression (Discr));
15613 -- Tagged types cannot have defaulted discriminants, but a
15614 -- non-tagged private type with defaulted discriminants
15615 -- can have a tagged completion.
15617 elsif Is_Tagged_Type (Current_Scope)
15618 and then Comes_From_Source (N)
15621 ("discriminants of tagged type cannot have defaults",
15622 Expression (Discr));
15625 Default_Present := True;
15626 Append_Elmt (Expression (Discr), Elist);
15628 -- Tag the defining identifiers for the discriminants with
15629 -- their corresponding default expressions from the tree.
15631 Set_Discriminant_Default_Value
15632 (Defining_Identifier (Discr), Expression (Discr));
15636 Default_Not_Present := True;
15639 -- Ada 2005 (AI-231): Create an Itype that is a duplicate of
15640 -- Discr_Type but with the null-exclusion attribute
15642 if Ada_Version >= Ada_05 then
15644 -- Ada 2005 (AI-231): Static checks
15646 if Can_Never_Be_Null (Discr_Type) then
15647 Null_Exclusion_Static_Checks (Discr);
15649 elsif Is_Access_Type (Discr_Type)
15650 and then Null_Exclusion_Present (Discr)
15652 -- No need to check itypes because in their case this check
15653 -- was done at their point of creation
15655 and then not Is_Itype (Discr_Type)
15657 if Can_Never_Be_Null (Discr_Type) then
15659 ("`NOT NULL` not allowed (& already excludes null)",
15664 Set_Etype (Defining_Identifier (Discr),
15665 Create_Null_Excluding_Itype
15667 Related_Nod => Discr));
15669 -- Check for improper null exclusion if the type is otherwise
15670 -- legal for a discriminant.
15672 elsif Null_Exclusion_Present (Discr)
15673 and then Is_Discrete_Type (Discr_Type)
15676 ("null exclusion can only apply to an access type", Discr);
15679 -- Ada 2005 (AI-402): access discriminants of nonlimited types
15680 -- can't have defaults. Synchronized types, or types that are
15681 -- explicitly limited are fine, but special tests apply to derived
15682 -- types in generics: in a generic body we have to assume the
15683 -- worst, and therefore defaults are not allowed if the parent is
15684 -- a generic formal private type (see ACATS B370001).
15686 if Is_Access_Type (Discr_Type) then
15687 if Ekind (Discr_Type) /= E_Anonymous_Access_Type
15688 or else not Default_Present
15689 or else Is_Limited_Record (Current_Scope)
15690 or else Is_Concurrent_Type (Current_Scope)
15691 or else Is_Concurrent_Record_Type (Current_Scope)
15692 or else Ekind (Current_Scope) = E_Limited_Private_Type
15694 if not Is_Derived_Type (Current_Scope)
15695 or else not Is_Generic_Type (Etype (Current_Scope))
15696 or else not In_Package_Body (Scope (Etype (Current_Scope)))
15697 or else Limited_Present
15698 (Type_Definition (Parent (Current_Scope)))
15703 Error_Msg_N ("access discriminants of nonlimited types",
15704 Expression (Discr));
15705 Error_Msg_N ("\cannot have defaults", Expression (Discr));
15708 elsif Present (Expression (Discr)) then
15710 ("(Ada 2005) access discriminants of nonlimited types",
15711 Expression (Discr));
15712 Error_Msg_N ("\cannot have defaults", Expression (Discr));
15720 -- An element list consisting of the default expressions of the
15721 -- discriminants is constructed in the above loop and used to set
15722 -- the Discriminant_Constraint attribute for the type. If an object
15723 -- is declared of this (record or task) type without any explicit
15724 -- discriminant constraint given, this element list will form the
15725 -- actual parameters for the corresponding initialization procedure
15728 Set_Discriminant_Constraint (Current_Scope, Elist);
15729 Set_Stored_Constraint (Current_Scope, No_Elist);
15731 -- Default expressions must be provided either for all or for none
15732 -- of the discriminants of a discriminant part. (RM 3.7.1)
15734 if Default_Present and then Default_Not_Present then
15736 ("incomplete specification of defaults for discriminants", N);
15739 -- The use of the name of a discriminant is not allowed in default
15740 -- expressions of a discriminant part if the specification of the
15741 -- discriminant is itself given in the discriminant part. (RM 3.7.1)
15743 -- To detect this, the discriminant names are entered initially with an
15744 -- Ekind of E_Void (which is the default Ekind given by Enter_Name). Any
15745 -- attempt to use a void entity (for example in an expression that is
15746 -- type-checked) produces the error message: premature usage. Now after
15747 -- completing the semantic analysis of the discriminant part, we can set
15748 -- the Ekind of all the discriminants appropriately.
15750 Discr := First (Discriminant_Specifications (N));
15751 Discr_Number := Uint_1;
15752 while Present (Discr) loop
15753 Id := Defining_Identifier (Discr);
15754 Set_Ekind (Id, E_Discriminant);
15755 Init_Component_Location (Id);
15757 Set_Discriminant_Number (Id, Discr_Number);
15759 -- Make sure this is always set, even in illegal programs
15761 Set_Corresponding_Discriminant (Id, Empty);
15763 -- Initialize the Original_Record_Component to the entity itself.
15764 -- Inherit_Components will propagate the right value to
15765 -- discriminants in derived record types.
15767 Set_Original_Record_Component (Id, Id);
15769 -- Create the discriminal for the discriminant
15771 Build_Discriminal (Id);
15774 Discr_Number := Discr_Number + 1;
15777 Set_Has_Discriminants (Current_Scope);
15778 end Process_Discriminants;
15780 -----------------------
15781 -- Process_Full_View --
15782 -----------------------
15784 procedure Process_Full_View (N : Node_Id; Full_T, Priv_T : Entity_Id) is
15785 Priv_Parent : Entity_Id;
15786 Full_Parent : Entity_Id;
15787 Full_Indic : Node_Id;
15789 procedure Collect_Implemented_Interfaces
15791 Ifaces : Elist_Id);
15792 -- Ada 2005: Gather all the interfaces that Typ directly or
15793 -- inherently implements. Duplicate entries are not added to
15794 -- the list Ifaces.
15796 ------------------------------------
15797 -- Collect_Implemented_Interfaces --
15798 ------------------------------------
15800 procedure Collect_Implemented_Interfaces
15805 Iface_Elmt : Elmt_Id;
15808 -- Abstract interfaces are only associated with tagged record types
15810 if not Is_Tagged_Type (Typ)
15811 or else not Is_Record_Type (Typ)
15816 -- Recursively climb to the ancestors
15818 if Etype (Typ) /= Typ
15820 -- Protect the frontend against wrong cyclic declarations like:
15822 -- type B is new A with private;
15823 -- type C is new A with private;
15825 -- type B is new C with null record;
15826 -- type C is new B with null record;
15828 and then Etype (Typ) /= Priv_T
15829 and then Etype (Typ) /= Full_T
15831 -- Keep separate the management of private type declarations
15833 if Ekind (Typ) = E_Record_Type_With_Private then
15835 -- Handle the following erronous case:
15836 -- type Private_Type is tagged private;
15838 -- type Private_Type is new Type_Implementing_Iface;
15840 if Present (Full_View (Typ))
15841 and then Etype (Typ) /= Full_View (Typ)
15843 if Is_Interface (Etype (Typ)) then
15844 Append_Unique_Elmt (Etype (Typ), Ifaces);
15847 Collect_Implemented_Interfaces (Etype (Typ), Ifaces);
15850 -- Non-private types
15853 if Is_Interface (Etype (Typ)) then
15854 Append_Unique_Elmt (Etype (Typ), Ifaces);
15857 Collect_Implemented_Interfaces (Etype (Typ), Ifaces);
15861 -- Handle entities in the list of abstract interfaces
15863 if Present (Interfaces (Typ)) then
15864 Iface_Elmt := First_Elmt (Interfaces (Typ));
15865 while Present (Iface_Elmt) loop
15866 Iface := Node (Iface_Elmt);
15868 pragma Assert (Is_Interface (Iface));
15870 if not Contain_Interface (Iface, Ifaces) then
15871 Append_Elmt (Iface, Ifaces);
15872 Collect_Implemented_Interfaces (Iface, Ifaces);
15875 Next_Elmt (Iface_Elmt);
15878 end Collect_Implemented_Interfaces;
15880 -- Start of processing for Process_Full_View
15883 -- First some sanity checks that must be done after semantic
15884 -- decoration of the full view and thus cannot be placed with other
15885 -- similar checks in Find_Type_Name
15887 if not Is_Limited_Type (Priv_T)
15888 and then (Is_Limited_Type (Full_T)
15889 or else Is_Limited_Composite (Full_T))
15892 ("completion of nonlimited type cannot be limited", Full_T);
15893 Explain_Limited_Type (Full_T, Full_T);
15895 elsif Is_Abstract_Type (Full_T)
15896 and then not Is_Abstract_Type (Priv_T)
15899 ("completion of nonabstract type cannot be abstract", Full_T);
15901 elsif Is_Tagged_Type (Priv_T)
15902 and then Is_Limited_Type (Priv_T)
15903 and then not Is_Limited_Type (Full_T)
15905 -- If pragma CPP_Class was applied to the private declaration
15906 -- propagate the limitedness to the full-view
15908 if Is_CPP_Class (Priv_T) then
15909 Set_Is_Limited_Record (Full_T);
15911 -- GNAT allow its own definition of Limited_Controlled to disobey
15912 -- this rule in order in ease the implementation. The next test is
15913 -- safe because Root_Controlled is defined in a private system child
15915 elsif Etype (Full_T) = Full_View (RTE (RE_Root_Controlled)) then
15916 Set_Is_Limited_Composite (Full_T);
15919 ("completion of limited tagged type must be limited", Full_T);
15922 elsif Is_Generic_Type (Priv_T) then
15923 Error_Msg_N ("generic type cannot have a completion", Full_T);
15926 -- Check that ancestor interfaces of private and full views are
15927 -- consistent. We omit this check for synchronized types because
15928 -- they are performed on the corresponding record type when frozen.
15930 if Ada_Version >= Ada_05
15931 and then Is_Tagged_Type (Priv_T)
15932 and then Is_Tagged_Type (Full_T)
15933 and then not Is_Concurrent_Type (Full_T)
15937 Priv_T_Ifaces : constant Elist_Id := New_Elmt_List;
15938 Full_T_Ifaces : constant Elist_Id := New_Elmt_List;
15941 Collect_Implemented_Interfaces (Priv_T, Priv_T_Ifaces);
15942 Collect_Implemented_Interfaces (Full_T, Full_T_Ifaces);
15944 -- Ada 2005 (AI-251): The partial view shall be a descendant of
15945 -- an interface type if and only if the full type is descendant
15946 -- of the interface type (AARM 7.3 (7.3/2).
15948 Iface := Find_Hidden_Interface (Priv_T_Ifaces, Full_T_Ifaces);
15950 if Present (Iface) then
15951 Error_Msg_NE ("interface & not implemented by full type " &
15952 "(RM-2005 7.3 (7.3/2))", Priv_T, Iface);
15955 Iface := Find_Hidden_Interface (Full_T_Ifaces, Priv_T_Ifaces);
15957 if Present (Iface) then
15958 Error_Msg_NE ("interface & not implemented by partial view " &
15959 "(RM-2005 7.3 (7.3/2))", Full_T, Iface);
15964 if Is_Tagged_Type (Priv_T)
15965 and then Nkind (Parent (Priv_T)) = N_Private_Extension_Declaration
15966 and then Is_Derived_Type (Full_T)
15968 Priv_Parent := Etype (Priv_T);
15970 -- The full view of a private extension may have been transformed
15971 -- into an unconstrained derived type declaration and a subtype
15972 -- declaration (see build_derived_record_type for details).
15974 if Nkind (N) = N_Subtype_Declaration then
15975 Full_Indic := Subtype_Indication (N);
15976 Full_Parent := Etype (Base_Type (Full_T));
15978 Full_Indic := Subtype_Indication (Type_Definition (N));
15979 Full_Parent := Etype (Full_T);
15982 -- Check that the parent type of the full type is a descendant of
15983 -- the ancestor subtype given in the private extension. If either
15984 -- entity has an Etype equal to Any_Type then we had some previous
15985 -- error situation [7.3(8)].
15987 if Priv_Parent = Any_Type or else Full_Parent = Any_Type then
15990 -- Ada 2005 (AI-251): Interfaces in the full-typ can be given in
15991 -- any order. Therefore we don't have to check that its parent must
15992 -- be a descendant of the parent of the private type declaration.
15994 elsif Is_Interface (Priv_Parent)
15995 and then Is_Interface (Full_Parent)
15999 -- Ada 2005 (AI-251): If the parent of the private type declaration
16000 -- is an interface there is no need to check that it is an ancestor
16001 -- of the associated full type declaration. The required tests for
16002 -- this case are performed by Build_Derived_Record_Type.
16004 elsif not Is_Interface (Base_Type (Priv_Parent))
16005 and then not Is_Ancestor (Base_Type (Priv_Parent), Full_Parent)
16008 ("parent of full type must descend from parent"
16009 & " of private extension", Full_Indic);
16011 -- Check the rules of 7.3(10): if the private extension inherits
16012 -- known discriminants, then the full type must also inherit those
16013 -- discriminants from the same (ancestor) type, and the parent
16014 -- subtype of the full type must be constrained if and only if
16015 -- the ancestor subtype of the private extension is constrained.
16017 elsif No (Discriminant_Specifications (Parent (Priv_T)))
16018 and then not Has_Unknown_Discriminants (Priv_T)
16019 and then Has_Discriminants (Base_Type (Priv_Parent))
16022 Priv_Indic : constant Node_Id :=
16023 Subtype_Indication (Parent (Priv_T));
16025 Priv_Constr : constant Boolean :=
16026 Is_Constrained (Priv_Parent)
16028 Nkind (Priv_Indic) = N_Subtype_Indication
16029 or else Is_Constrained (Entity (Priv_Indic));
16031 Full_Constr : constant Boolean :=
16032 Is_Constrained (Full_Parent)
16034 Nkind (Full_Indic) = N_Subtype_Indication
16035 or else Is_Constrained (Entity (Full_Indic));
16037 Priv_Discr : Entity_Id;
16038 Full_Discr : Entity_Id;
16041 Priv_Discr := First_Discriminant (Priv_Parent);
16042 Full_Discr := First_Discriminant (Full_Parent);
16043 while Present (Priv_Discr) and then Present (Full_Discr) loop
16044 if Original_Record_Component (Priv_Discr) =
16045 Original_Record_Component (Full_Discr)
16047 Corresponding_Discriminant (Priv_Discr) =
16048 Corresponding_Discriminant (Full_Discr)
16055 Next_Discriminant (Priv_Discr);
16056 Next_Discriminant (Full_Discr);
16059 if Present (Priv_Discr) or else Present (Full_Discr) then
16061 ("full view must inherit discriminants of the parent type"
16062 & " used in the private extension", Full_Indic);
16064 elsif Priv_Constr and then not Full_Constr then
16066 ("parent subtype of full type must be constrained",
16069 elsif Full_Constr and then not Priv_Constr then
16071 ("parent subtype of full type must be unconstrained",
16076 -- Check the rules of 7.3(12): if a partial view has neither known
16077 -- or unknown discriminants, then the full type declaration shall
16078 -- define a definite subtype.
16080 elsif not Has_Unknown_Discriminants (Priv_T)
16081 and then not Has_Discriminants (Priv_T)
16082 and then not Is_Constrained (Full_T)
16085 ("full view must define a constrained type if partial view"
16086 & " has no discriminants", Full_T);
16089 -- ??????? Do we implement the following properly ?????
16090 -- If the ancestor subtype of a private extension has constrained
16091 -- discriminants, then the parent subtype of the full view shall
16092 -- impose a statically matching constraint on those discriminants
16096 -- For untagged types, verify that a type without discriminants
16097 -- is not completed with an unconstrained type.
16099 if not Is_Indefinite_Subtype (Priv_T)
16100 and then Is_Indefinite_Subtype (Full_T)
16102 Error_Msg_N ("full view of type must be definite subtype", Full_T);
16106 -- AI-419: verify that the use of "limited" is consistent
16109 Orig_Decl : constant Node_Id := Original_Node (N);
16112 if Nkind (Parent (Priv_T)) = N_Private_Extension_Declaration
16113 and then not Limited_Present (Parent (Priv_T))
16114 and then not Synchronized_Present (Parent (Priv_T))
16115 and then Nkind (Orig_Decl) = N_Full_Type_Declaration
16117 (Type_Definition (Orig_Decl)) = N_Derived_Type_Definition
16118 and then Limited_Present (Type_Definition (Orig_Decl))
16121 ("full view of non-limited extension cannot be limited", N);
16125 -- Ada 2005 (AI-443): A synchronized private extension must be
16126 -- completed by a task or protected type.
16128 if Ada_Version >= Ada_05
16129 and then Nkind (Parent (Priv_T)) = N_Private_Extension_Declaration
16130 and then Synchronized_Present (Parent (Priv_T))
16131 and then not Is_Concurrent_Type (Full_T)
16133 Error_Msg_N ("full view of synchronized extension must " &
16134 "be synchronized type", N);
16137 -- Ada 2005 AI-363: if the full view has discriminants with
16138 -- defaults, it is illegal to declare constrained access subtypes
16139 -- whose designated type is the current type. This allows objects
16140 -- of the type that are declared in the heap to be unconstrained.
16142 if not Has_Unknown_Discriminants (Priv_T)
16143 and then not Has_Discriminants (Priv_T)
16144 and then Has_Discriminants (Full_T)
16146 Present (Discriminant_Default_Value (First_Discriminant (Full_T)))
16148 Set_Has_Constrained_Partial_View (Full_T);
16149 Set_Has_Constrained_Partial_View (Priv_T);
16152 -- Create a full declaration for all its subtypes recorded in
16153 -- Private_Dependents and swap them similarly to the base type. These
16154 -- are subtypes that have been define before the full declaration of
16155 -- the private type. We also swap the entry in Private_Dependents list
16156 -- so we can properly restore the private view on exit from the scope.
16159 Priv_Elmt : Elmt_Id;
16164 Priv_Elmt := First_Elmt (Private_Dependents (Priv_T));
16165 while Present (Priv_Elmt) loop
16166 Priv := Node (Priv_Elmt);
16168 if Ekind (Priv) = E_Private_Subtype
16169 or else Ekind (Priv) = E_Limited_Private_Subtype
16170 or else Ekind (Priv) = E_Record_Subtype_With_Private
16172 Full := Make_Defining_Identifier (Sloc (Priv), Chars (Priv));
16173 Set_Is_Itype (Full);
16174 Set_Parent (Full, Parent (Priv));
16175 Set_Associated_Node_For_Itype (Full, N);
16177 -- Now we need to complete the private subtype, but since the
16178 -- base type has already been swapped, we must also swap the
16179 -- subtypes (and thus, reverse the arguments in the call to
16180 -- Complete_Private_Subtype).
16182 Copy_And_Swap (Priv, Full);
16183 Complete_Private_Subtype (Full, Priv, Full_T, N);
16184 Replace_Elmt (Priv_Elmt, Full);
16187 Next_Elmt (Priv_Elmt);
16191 -- If the private view was tagged, copy the new primitive operations
16192 -- from the private view to the full view.
16194 if Is_Tagged_Type (Full_T) then
16196 Disp_Typ : Entity_Id;
16197 Full_List : Elist_Id;
16199 Prim_Elmt : Elmt_Id;
16200 Priv_List : Elist_Id;
16204 L : Elist_Id) return Boolean;
16205 -- Determine whether list L contains element E
16213 L : Elist_Id) return Boolean
16215 List_Elmt : Elmt_Id;
16218 List_Elmt := First_Elmt (L);
16219 while Present (List_Elmt) loop
16220 if Node (List_Elmt) = E then
16224 Next_Elmt (List_Elmt);
16230 -- Start of processing
16233 if Is_Tagged_Type (Priv_T) then
16234 Priv_List := Primitive_Operations (Priv_T);
16235 Prim_Elmt := First_Elmt (Priv_List);
16237 -- In the case of a concurrent type completing a private tagged
16238 -- type, primitives may have been declared in between the two
16239 -- views. These subprograms need to be wrapped the same way
16240 -- entries and protected procedures are handled because they
16241 -- cannot be directly shared by the two views.
16243 if Is_Concurrent_Type (Full_T) then
16245 Conc_Typ : constant Entity_Id :=
16246 Corresponding_Record_Type (Full_T);
16247 Loc : constant Source_Ptr := Sloc (Conc_Typ);
16248 Curr_Nod : Node_Id := Parent (Conc_Typ);
16249 Wrap_Spec : Node_Id;
16252 while Present (Prim_Elmt) loop
16253 Prim := Node (Prim_Elmt);
16255 if Comes_From_Source (Prim)
16256 and then not Is_Abstract_Subprogram (Prim)
16259 Make_Subprogram_Declaration (Loc,
16261 Build_Wrapper_Spec (Loc,
16263 Obj_Typ => Conc_Typ,
16265 Parameter_Specifications (
16268 Insert_After (Curr_Nod, Wrap_Spec);
16269 Curr_Nod := Wrap_Spec;
16271 Analyze (Wrap_Spec);
16274 Next_Elmt (Prim_Elmt);
16280 -- For non-concurrent types, transfer explicit primitives, but
16281 -- omit those inherited from the parent of the private view
16282 -- since they will be re-inherited later on.
16285 Full_List := Primitive_Operations (Full_T);
16287 while Present (Prim_Elmt) loop
16288 Prim := Node (Prim_Elmt);
16290 if Comes_From_Source (Prim)
16291 and then not Contains (Prim, Full_List)
16293 Append_Elmt (Prim, Full_List);
16296 Next_Elmt (Prim_Elmt);
16300 -- Untagged private view
16303 Full_List := Primitive_Operations (Full_T);
16305 -- In this case the partial view is untagged, so here we locate
16306 -- all of the earlier primitives that need to be treated as
16307 -- dispatching (those that appear between the two views). Note
16308 -- that these additional operations must all be new operations
16309 -- (any earlier operations that override inherited operations
16310 -- of the full view will already have been inserted in the
16311 -- primitives list, marked by Check_Operation_From_Private_View
16312 -- as dispatching. Note that implicit "/=" operators are
16313 -- excluded from being added to the primitives list since they
16314 -- shouldn't be treated as dispatching (tagged "/=" is handled
16317 Prim := Next_Entity (Full_T);
16318 while Present (Prim) and then Prim /= Priv_T loop
16319 if Ekind (Prim) = E_Procedure
16321 Ekind (Prim) = E_Function
16323 Disp_Typ := Find_Dispatching_Type (Prim);
16325 if Disp_Typ = Full_T
16326 and then (Chars (Prim) /= Name_Op_Ne
16327 or else Comes_From_Source (Prim))
16329 Check_Controlling_Formals (Full_T, Prim);
16331 if not Is_Dispatching_Operation (Prim) then
16332 Append_Elmt (Prim, Full_List);
16333 Set_Is_Dispatching_Operation (Prim, True);
16334 Set_DT_Position (Prim, No_Uint);
16337 elsif Is_Dispatching_Operation (Prim)
16338 and then Disp_Typ /= Full_T
16341 -- Verify that it is not otherwise controlled by a
16342 -- formal or a return value of type T.
16344 Check_Controlling_Formals (Disp_Typ, Prim);
16348 Next_Entity (Prim);
16352 -- For the tagged case, the two views can share the same
16353 -- Primitive Operation list and the same class wide type.
16354 -- Update attributes of the class-wide type which depend on
16355 -- the full declaration.
16357 if Is_Tagged_Type (Priv_T) then
16358 Set_Primitive_Operations (Priv_T, Full_List);
16359 Set_Class_Wide_Type
16360 (Base_Type (Full_T), Class_Wide_Type (Priv_T));
16362 Set_Has_Task (Class_Wide_Type (Priv_T), Has_Task (Full_T));
16367 -- Ada 2005 AI 161: Check preelaboratable initialization consistency
16369 if Known_To_Have_Preelab_Init (Priv_T) then
16371 -- Case where there is a pragma Preelaborable_Initialization. We
16372 -- always allow this in predefined units, which is a bit of a kludge,
16373 -- but it means we don't have to struggle to meet the requirements in
16374 -- the RM for having Preelaborable Initialization. Otherwise we
16375 -- require that the type meets the RM rules. But we can't check that
16376 -- yet, because of the rule about overriding Ininitialize, so we
16377 -- simply set a flag that will be checked at freeze time.
16379 if not In_Predefined_Unit (Full_T) then
16380 Set_Must_Have_Preelab_Init (Full_T);
16384 -- If pragma CPP_Class was applied to the private type declaration,
16385 -- propagate it now to the full type declaration.
16387 if Is_CPP_Class (Priv_T) then
16388 Set_Is_CPP_Class (Full_T);
16389 Set_Convention (Full_T, Convention_CPP);
16391 end Process_Full_View;
16393 -----------------------------------
16394 -- Process_Incomplete_Dependents --
16395 -----------------------------------
16397 procedure Process_Incomplete_Dependents
16399 Full_T : Entity_Id;
16402 Inc_Elmt : Elmt_Id;
16403 Priv_Dep : Entity_Id;
16404 New_Subt : Entity_Id;
16406 Disc_Constraint : Elist_Id;
16409 if No (Private_Dependents (Inc_T)) then
16413 -- Itypes that may be generated by the completion of an incomplete
16414 -- subtype are not used by the back-end and not attached to the tree.
16415 -- They are created only for constraint-checking purposes.
16417 Inc_Elmt := First_Elmt (Private_Dependents (Inc_T));
16418 while Present (Inc_Elmt) loop
16419 Priv_Dep := Node (Inc_Elmt);
16421 if Ekind (Priv_Dep) = E_Subprogram_Type then
16423 -- An Access_To_Subprogram type may have a return type or a
16424 -- parameter type that is incomplete. Replace with the full view.
16426 if Etype (Priv_Dep) = Inc_T then
16427 Set_Etype (Priv_Dep, Full_T);
16431 Formal : Entity_Id;
16434 Formal := First_Formal (Priv_Dep);
16435 while Present (Formal) loop
16436 if Etype (Formal) = Inc_T then
16437 Set_Etype (Formal, Full_T);
16440 Next_Formal (Formal);
16444 elsif Is_Overloadable (Priv_Dep) then
16446 -- A protected operation is never dispatching: only its
16447 -- wrapper operation (which has convention Ada) is.
16449 if Is_Tagged_Type (Full_T)
16450 and then Convention (Priv_Dep) /= Convention_Protected
16453 -- Subprogram has an access parameter whose designated type
16454 -- was incomplete. Reexamine declaration now, because it may
16455 -- be a primitive operation of the full type.
16457 Check_Operation_From_Incomplete_Type (Priv_Dep, Inc_T);
16458 Set_Is_Dispatching_Operation (Priv_Dep);
16459 Check_Controlling_Formals (Full_T, Priv_Dep);
16462 elsif Ekind (Priv_Dep) = E_Subprogram_Body then
16464 -- Can happen during processing of a body before the completion
16465 -- of a TA type. Ignore, because spec is also on dependent list.
16469 -- Ada 2005 (AI-412): Transform a regular incomplete subtype into a
16470 -- corresponding subtype of the full view.
16472 elsif Ekind (Priv_Dep) = E_Incomplete_Subtype then
16473 Set_Subtype_Indication
16474 (Parent (Priv_Dep), New_Reference_To (Full_T, Sloc (Priv_Dep)));
16475 Set_Etype (Priv_Dep, Full_T);
16476 Set_Ekind (Priv_Dep, Subtype_Kind (Ekind (Full_T)));
16477 Set_Analyzed (Parent (Priv_Dep), False);
16479 -- Reanalyze the declaration, suppressing the call to
16480 -- Enter_Name to avoid duplicate names.
16482 Analyze_Subtype_Declaration
16483 (N => Parent (Priv_Dep),
16486 -- Dependent is a subtype
16489 -- We build a new subtype indication using the full view of the
16490 -- incomplete parent. The discriminant constraints have been
16491 -- elaborated already at the point of the subtype declaration.
16493 New_Subt := Create_Itype (E_Void, N);
16495 if Has_Discriminants (Full_T) then
16496 Disc_Constraint := Discriminant_Constraint (Priv_Dep);
16498 Disc_Constraint := No_Elist;
16501 Build_Discriminated_Subtype (Full_T, New_Subt, Disc_Constraint, N);
16502 Set_Full_View (Priv_Dep, New_Subt);
16505 Next_Elmt (Inc_Elmt);
16507 end Process_Incomplete_Dependents;
16509 --------------------------------
16510 -- Process_Range_Expr_In_Decl --
16511 --------------------------------
16513 procedure Process_Range_Expr_In_Decl
16516 Check_List : List_Id := Empty_List;
16517 R_Check_Off : Boolean := False)
16520 R_Checks : Check_Result;
16521 Type_Decl : Node_Id;
16522 Def_Id : Entity_Id;
16525 Analyze_And_Resolve (R, Base_Type (T));
16527 if Nkind (R) = N_Range then
16528 Lo := Low_Bound (R);
16529 Hi := High_Bound (R);
16531 -- We need to ensure validity of the bounds here, because if we
16532 -- go ahead and do the expansion, then the expanded code will get
16533 -- analyzed with range checks suppressed and we miss the check.
16535 Validity_Check_Range (R);
16537 -- If there were errors in the declaration, try and patch up some
16538 -- common mistakes in the bounds. The cases handled are literals
16539 -- which are Integer where the expected type is Real and vice versa.
16540 -- These corrections allow the compilation process to proceed further
16541 -- along since some basic assumptions of the format of the bounds
16544 if Etype (R) = Any_Type then
16546 if Nkind (Lo) = N_Integer_Literal and then Is_Real_Type (T) then
16548 Make_Real_Literal (Sloc (Lo), UR_From_Uint (Intval (Lo))));
16550 elsif Nkind (Hi) = N_Integer_Literal and then Is_Real_Type (T) then
16552 Make_Real_Literal (Sloc (Hi), UR_From_Uint (Intval (Hi))));
16554 elsif Nkind (Lo) = N_Real_Literal and then Is_Integer_Type (T) then
16556 Make_Integer_Literal (Sloc (Lo), UR_To_Uint (Realval (Lo))));
16558 elsif Nkind (Hi) = N_Real_Literal and then Is_Integer_Type (T) then
16560 Make_Integer_Literal (Sloc (Hi), UR_To_Uint (Realval (Hi))));
16567 -- If the bounds of the range have been mistakenly given as string
16568 -- literals (perhaps in place of character literals), then an error
16569 -- has already been reported, but we rewrite the string literal as a
16570 -- bound of the range's type to avoid blowups in later processing
16571 -- that looks at static values.
16573 if Nkind (Lo) = N_String_Literal then
16575 Make_Attribute_Reference (Sloc (Lo),
16576 Attribute_Name => Name_First,
16577 Prefix => New_Reference_To (T, Sloc (Lo))));
16578 Analyze_And_Resolve (Lo);
16581 if Nkind (Hi) = N_String_Literal then
16583 Make_Attribute_Reference (Sloc (Hi),
16584 Attribute_Name => Name_First,
16585 Prefix => New_Reference_To (T, Sloc (Hi))));
16586 Analyze_And_Resolve (Hi);
16589 -- If bounds aren't scalar at this point then exit, avoiding
16590 -- problems with further processing of the range in this procedure.
16592 if not Is_Scalar_Type (Etype (Lo)) then
16596 -- Resolve (actually Sem_Eval) has checked that the bounds are in
16597 -- then range of the base type. Here we check whether the bounds
16598 -- are in the range of the subtype itself. Note that if the bounds
16599 -- represent the null range the Constraint_Error exception should
16602 -- ??? The following code should be cleaned up as follows
16604 -- 1. The Is_Null_Range (Lo, Hi) test should disappear since it
16605 -- is done in the call to Range_Check (R, T); below
16607 -- 2. The use of R_Check_Off should be investigated and possibly
16608 -- removed, this would clean up things a bit.
16610 if Is_Null_Range (Lo, Hi) then
16614 -- Capture values of bounds and generate temporaries for them
16615 -- if needed, before applying checks, since checks may cause
16616 -- duplication of the expression without forcing evaluation.
16618 if Expander_Active then
16619 Force_Evaluation (Lo);
16620 Force_Evaluation (Hi);
16623 -- We use a flag here instead of suppressing checks on the
16624 -- type because the type we check against isn't necessarily
16625 -- the place where we put the check.
16627 if not R_Check_Off then
16628 R_Checks := Get_Range_Checks (R, T);
16630 -- Look up tree to find an appropriate insertion point.
16631 -- This seems really junk code, and very brittle, couldn't
16632 -- we just use an insert actions call of some kind ???
16634 Type_Decl := Parent (R);
16635 while Present (Type_Decl) and then not
16636 (Nkind_In (Type_Decl, N_Full_Type_Declaration,
16637 N_Subtype_Declaration,
16639 N_Task_Type_Declaration)
16641 Nkind_In (Type_Decl, N_Single_Task_Declaration,
16642 N_Protected_Type_Declaration,
16643 N_Single_Protected_Declaration))
16645 Type_Decl := Parent (Type_Decl);
16648 -- Why would Type_Decl not be present??? Without this test,
16649 -- short regression tests fail.
16651 if Present (Type_Decl) then
16653 -- Case of loop statement (more comments ???)
16655 if Nkind (Type_Decl) = N_Loop_Statement then
16660 Indic := Parent (R);
16661 while Present (Indic)
16662 and then Nkind (Indic) /= N_Subtype_Indication
16664 Indic := Parent (Indic);
16667 if Present (Indic) then
16668 Def_Id := Etype (Subtype_Mark (Indic));
16670 Insert_Range_Checks
16676 Do_Before => True);
16680 -- All other cases (more comments ???)
16683 Def_Id := Defining_Identifier (Type_Decl);
16685 if (Ekind (Def_Id) = E_Record_Type
16686 and then Depends_On_Discriminant (R))
16688 (Ekind (Def_Id) = E_Protected_Type
16689 and then Has_Discriminants (Def_Id))
16691 Append_Range_Checks
16692 (R_Checks, Check_List, Def_Id, Sloc (Type_Decl), R);
16695 Insert_Range_Checks
16696 (R_Checks, Type_Decl, Def_Id, Sloc (Type_Decl), R);
16704 elsif Expander_Active then
16705 Get_Index_Bounds (R, Lo, Hi);
16706 Force_Evaluation (Lo);
16707 Force_Evaluation (Hi);
16709 end Process_Range_Expr_In_Decl;
16711 --------------------------------------
16712 -- Process_Real_Range_Specification --
16713 --------------------------------------
16715 procedure Process_Real_Range_Specification (Def : Node_Id) is
16716 Spec : constant Node_Id := Real_Range_Specification (Def);
16719 Err : Boolean := False;
16721 procedure Analyze_Bound (N : Node_Id);
16722 -- Analyze and check one bound
16724 -------------------
16725 -- Analyze_Bound --
16726 -------------------
16728 procedure Analyze_Bound (N : Node_Id) is
16730 Analyze_And_Resolve (N, Any_Real);
16732 if not Is_OK_Static_Expression (N) then
16733 Flag_Non_Static_Expr
16734 ("bound in real type definition is not static!", N);
16739 -- Start of processing for Process_Real_Range_Specification
16742 if Present (Spec) then
16743 Lo := Low_Bound (Spec);
16744 Hi := High_Bound (Spec);
16745 Analyze_Bound (Lo);
16746 Analyze_Bound (Hi);
16748 -- If error, clear away junk range specification
16751 Set_Real_Range_Specification (Def, Empty);
16754 end Process_Real_Range_Specification;
16756 ---------------------
16757 -- Process_Subtype --
16758 ---------------------
16760 function Process_Subtype
16762 Related_Nod : Node_Id;
16763 Related_Id : Entity_Id := Empty;
16764 Suffix : Character := ' ') return Entity_Id
16767 Def_Id : Entity_Id;
16768 Error_Node : Node_Id;
16769 Full_View_Id : Entity_Id;
16770 Subtype_Mark_Id : Entity_Id;
16772 May_Have_Null_Exclusion : Boolean;
16774 procedure Check_Incomplete (T : Entity_Id);
16775 -- Called to verify that an incomplete type is not used prematurely
16777 ----------------------
16778 -- Check_Incomplete --
16779 ----------------------
16781 procedure Check_Incomplete (T : Entity_Id) is
16783 -- Ada 2005 (AI-412): Incomplete subtypes are legal
16785 if Ekind (Root_Type (Entity (T))) = E_Incomplete_Type
16787 not (Ada_Version >= Ada_05
16789 (Nkind (Parent (T)) = N_Subtype_Declaration
16791 (Nkind (Parent (T)) = N_Subtype_Indication
16792 and then Nkind (Parent (Parent (T))) =
16793 N_Subtype_Declaration)))
16795 Error_Msg_N ("invalid use of type before its full declaration", T);
16797 end Check_Incomplete;
16799 -- Start of processing for Process_Subtype
16802 -- Case of no constraints present
16804 if Nkind (S) /= N_Subtype_Indication then
16806 Check_Incomplete (S);
16809 -- Ada 2005 (AI-231): Static check
16811 if Ada_Version >= Ada_05
16812 and then Present (P)
16813 and then Null_Exclusion_Present (P)
16814 and then Nkind (P) /= N_Access_To_Object_Definition
16815 and then not Is_Access_Type (Entity (S))
16817 Error_Msg_N ("`NOT NULL` only allowed for an access type", S);
16820 -- The following is ugly, can't we have a range or even a flag???
16822 May_Have_Null_Exclusion :=
16823 Nkind_In (P, N_Access_Definition,
16824 N_Access_Function_Definition,
16825 N_Access_Procedure_Definition,
16826 N_Access_To_Object_Definition,
16828 N_Component_Definition)
16830 Nkind_In (P, N_Derived_Type_Definition,
16831 N_Discriminant_Specification,
16832 N_Formal_Object_Declaration,
16833 N_Object_Declaration,
16834 N_Object_Renaming_Declaration,
16835 N_Parameter_Specification,
16836 N_Subtype_Declaration);
16838 -- Create an Itype that is a duplicate of Entity (S) but with the
16839 -- null-exclusion attribute
16841 if May_Have_Null_Exclusion
16842 and then Is_Access_Type (Entity (S))
16843 and then Null_Exclusion_Present (P)
16845 -- No need to check the case of an access to object definition.
16846 -- It is correct to define double not-null pointers.
16849 -- type Not_Null_Int_Ptr is not null access Integer;
16850 -- type Acc is not null access Not_Null_Int_Ptr;
16852 and then Nkind (P) /= N_Access_To_Object_Definition
16854 if Can_Never_Be_Null (Entity (S)) then
16855 case Nkind (Related_Nod) is
16856 when N_Full_Type_Declaration =>
16857 if Nkind (Type_Definition (Related_Nod))
16858 in N_Array_Type_Definition
16862 (Component_Definition
16863 (Type_Definition (Related_Nod)));
16866 Subtype_Indication (Type_Definition (Related_Nod));
16869 when N_Subtype_Declaration =>
16870 Error_Node := Subtype_Indication (Related_Nod);
16872 when N_Object_Declaration =>
16873 Error_Node := Object_Definition (Related_Nod);
16875 when N_Component_Declaration =>
16877 Subtype_Indication (Component_Definition (Related_Nod));
16879 when N_Allocator =>
16880 Error_Node := Expression (Related_Nod);
16883 pragma Assert (False);
16884 Error_Node := Related_Nod;
16888 ("`NOT NULL` not allowed (& already excludes null)",
16894 Create_Null_Excluding_Itype
16896 Related_Nod => P));
16897 Set_Entity (S, Etype (S));
16902 -- Case of constraint present, so that we have an N_Subtype_Indication
16903 -- node (this node is created only if constraints are present).
16906 Find_Type (Subtype_Mark (S));
16908 if Nkind (Parent (S)) /= N_Access_To_Object_Definition
16910 (Nkind (Parent (S)) = N_Subtype_Declaration
16911 and then Is_Itype (Defining_Identifier (Parent (S))))
16913 Check_Incomplete (Subtype_Mark (S));
16917 Subtype_Mark_Id := Entity (Subtype_Mark (S));
16919 -- Explicit subtype declaration case
16921 if Nkind (P) = N_Subtype_Declaration then
16922 Def_Id := Defining_Identifier (P);
16924 -- Explicit derived type definition case
16926 elsif Nkind (P) = N_Derived_Type_Definition then
16927 Def_Id := Defining_Identifier (Parent (P));
16929 -- Implicit case, the Def_Id must be created as an implicit type.
16930 -- The one exception arises in the case of concurrent types, array
16931 -- and access types, where other subsidiary implicit types may be
16932 -- created and must appear before the main implicit type. In these
16933 -- cases we leave Def_Id set to Empty as a signal that Create_Itype
16934 -- has not yet been called to create Def_Id.
16937 if Is_Array_Type (Subtype_Mark_Id)
16938 or else Is_Concurrent_Type (Subtype_Mark_Id)
16939 or else Is_Access_Type (Subtype_Mark_Id)
16943 -- For the other cases, we create a new unattached Itype,
16944 -- and set the indication to ensure it gets attached later.
16948 Create_Itype (E_Void, Related_Nod, Related_Id, Suffix);
16952 -- If the kind of constraint is invalid for this kind of type,
16953 -- then give an error, and then pretend no constraint was given.
16955 if not Is_Valid_Constraint_Kind
16956 (Ekind (Subtype_Mark_Id), Nkind (Constraint (S)))
16959 ("incorrect constraint for this kind of type", Constraint (S));
16961 Rewrite (S, New_Copy_Tree (Subtype_Mark (S)));
16963 -- Set Ekind of orphan itype, to prevent cascaded errors
16965 if Present (Def_Id) then
16966 Set_Ekind (Def_Id, Ekind (Any_Type));
16969 -- Make recursive call, having got rid of the bogus constraint
16971 return Process_Subtype (S, Related_Nod, Related_Id, Suffix);
16974 -- Remaining processing depends on type
16976 case Ekind (Subtype_Mark_Id) is
16977 when Access_Kind =>
16978 Constrain_Access (Def_Id, S, Related_Nod);
16981 and then Is_Itype (Designated_Type (Def_Id))
16982 and then Nkind (Related_Nod) = N_Subtype_Declaration
16983 and then not Is_Incomplete_Type (Designated_Type (Def_Id))
16985 Build_Itype_Reference
16986 (Designated_Type (Def_Id), Related_Nod);
16990 Constrain_Array (Def_Id, S, Related_Nod, Related_Id, Suffix);
16992 when Decimal_Fixed_Point_Kind =>
16993 Constrain_Decimal (Def_Id, S);
16995 when Enumeration_Kind =>
16996 Constrain_Enumeration (Def_Id, S);
16998 when Ordinary_Fixed_Point_Kind =>
16999 Constrain_Ordinary_Fixed (Def_Id, S);
17002 Constrain_Float (Def_Id, S);
17004 when Integer_Kind =>
17005 Constrain_Integer (Def_Id, S);
17007 when E_Record_Type |
17010 E_Incomplete_Type =>
17011 Constrain_Discriminated_Type (Def_Id, S, Related_Nod);
17013 if Ekind (Def_Id) = E_Incomplete_Type then
17014 Set_Private_Dependents (Def_Id, New_Elmt_List);
17017 when Private_Kind =>
17018 Constrain_Discriminated_Type (Def_Id, S, Related_Nod);
17019 Set_Private_Dependents (Def_Id, New_Elmt_List);
17021 -- In case of an invalid constraint prevent further processing
17022 -- since the type constructed is missing expected fields.
17024 if Etype (Def_Id) = Any_Type then
17028 -- If the full view is that of a task with discriminants,
17029 -- we must constrain both the concurrent type and its
17030 -- corresponding record type. Otherwise we will just propagate
17031 -- the constraint to the full view, if available.
17033 if Present (Full_View (Subtype_Mark_Id))
17034 and then Has_Discriminants (Subtype_Mark_Id)
17035 and then Is_Concurrent_Type (Full_View (Subtype_Mark_Id))
17038 Create_Itype (E_Void, Related_Nod, Related_Id, Suffix);
17040 Set_Entity (Subtype_Mark (S), Full_View (Subtype_Mark_Id));
17041 Constrain_Concurrent (Full_View_Id, S,
17042 Related_Nod, Related_Id, Suffix);
17043 Set_Entity (Subtype_Mark (S), Subtype_Mark_Id);
17044 Set_Full_View (Def_Id, Full_View_Id);
17046 -- Introduce an explicit reference to the private subtype,
17047 -- to prevent scope anomalies in gigi if first use appears
17048 -- in a nested context, e.g. a later function body.
17049 -- Should this be generated in other contexts than a full
17050 -- type declaration?
17052 if Is_Itype (Def_Id)
17054 Nkind (Parent (P)) = N_Full_Type_Declaration
17056 Build_Itype_Reference (Def_Id, Parent (P));
17060 Prepare_Private_Subtype_Completion (Def_Id, Related_Nod);
17063 when Concurrent_Kind =>
17064 Constrain_Concurrent (Def_Id, S,
17065 Related_Nod, Related_Id, Suffix);
17068 Error_Msg_N ("invalid subtype mark in subtype indication", S);
17071 -- Size and Convention are always inherited from the base type
17073 Set_Size_Info (Def_Id, (Subtype_Mark_Id));
17074 Set_Convention (Def_Id, Convention (Subtype_Mark_Id));
17078 end Process_Subtype;
17080 ---------------------------------------
17081 -- Check_Anonymous_Access_Components --
17082 ---------------------------------------
17084 procedure Check_Anonymous_Access_Components
17085 (Typ_Decl : Node_Id;
17088 Comp_List : Node_Id)
17090 Loc : constant Source_Ptr := Sloc (Typ_Decl);
17091 Anon_Access : Entity_Id;
17094 Comp_Def : Node_Id;
17096 Type_Def : Node_Id;
17098 procedure Build_Incomplete_Type_Declaration;
17099 -- If the record type contains components that include an access to the
17100 -- current record, then create an incomplete type declaration for the
17101 -- record, to be used as the designated type of the anonymous access.
17102 -- This is done only once, and only if there is no previous partial
17103 -- view of the type.
17105 function Designates_T (Subt : Node_Id) return Boolean;
17106 -- Check whether a node designates the enclosing record type, or 'Class
17109 function Mentions_T (Acc_Def : Node_Id) return Boolean;
17110 -- Check whether an access definition includes a reference to
17111 -- the enclosing record type. The reference can be a subtype mark
17112 -- in the access definition itself, a 'Class attribute reference, or
17113 -- recursively a reference appearing in a parameter specification
17114 -- or result definition of an access_to_subprogram definition.
17116 --------------------------------------
17117 -- Build_Incomplete_Type_Declaration --
17118 --------------------------------------
17120 procedure Build_Incomplete_Type_Declaration is
17125 -- Is_Tagged indicates whether the type is tagged. It is tagged if
17126 -- it's "is new ... with record" or else "is tagged record ...".
17128 Is_Tagged : constant Boolean :=
17129 (Nkind (Type_Definition (Typ_Decl)) = N_Derived_Type_Definition
17132 (Record_Extension_Part (Type_Definition (Typ_Decl))))
17134 (Nkind (Type_Definition (Typ_Decl)) = N_Record_Definition
17135 and then Tagged_Present (Type_Definition (Typ_Decl)));
17138 -- If there is a previous partial view, no need to create a new one
17139 -- If the partial view, given by Prev, is incomplete, If Prev is
17140 -- a private declaration, full declaration is flagged accordingly.
17142 if Prev /= Typ then
17144 Make_Class_Wide_Type (Prev);
17145 Set_Class_Wide_Type (Typ, Class_Wide_Type (Prev));
17146 Set_Etype (Class_Wide_Type (Typ), Typ);
17151 elsif Has_Private_Declaration (Typ) then
17153 -- If we refer to T'Class inside T, and T is the completion of a
17154 -- private type, then we need to make sure the class-wide type
17158 Make_Class_Wide_Type (Typ);
17163 -- If there was a previous anonymous access type, the incomplete
17164 -- type declaration will have been created already.
17166 elsif Present (Current_Entity (Typ))
17167 and then Ekind (Current_Entity (Typ)) = E_Incomplete_Type
17168 and then Full_View (Current_Entity (Typ)) = Typ
17173 Inc_T := Make_Defining_Identifier (Loc, Chars (Typ));
17174 Decl := Make_Incomplete_Type_Declaration (Loc, Inc_T);
17176 -- Type has already been inserted into the current scope.
17177 -- Remove it, and add incomplete declaration for type, so
17178 -- that subsequent anonymous access types can use it.
17179 -- The entity is unchained from the homonym list and from
17180 -- immediate visibility. After analysis, the entity in the
17181 -- incomplete declaration becomes immediately visible in the
17182 -- record declaration that follows.
17184 H := Current_Entity (Typ);
17187 Set_Name_Entity_Id (Chars (Typ), Homonym (Typ));
17190 and then Homonym (H) /= Typ
17192 H := Homonym (Typ);
17195 Set_Homonym (H, Homonym (Typ));
17198 Insert_Before (Typ_Decl, Decl);
17200 Set_Full_View (Inc_T, Typ);
17203 -- Create a common class-wide type for both views, and set
17204 -- the Etype of the class-wide type to the full view.
17206 Make_Class_Wide_Type (Inc_T);
17207 Set_Class_Wide_Type (Typ, Class_Wide_Type (Inc_T));
17208 Set_Etype (Class_Wide_Type (Typ), Typ);
17211 end Build_Incomplete_Type_Declaration;
17217 function Designates_T (Subt : Node_Id) return Boolean is
17218 Type_Id : constant Name_Id := Chars (Typ);
17220 function Names_T (Nam : Node_Id) return Boolean;
17221 -- The record type has not been introduced in the current scope
17222 -- yet, so we must examine the name of the type itself, either
17223 -- an identifier T, or an expanded name of the form P.T, where
17224 -- P denotes the current scope.
17230 function Names_T (Nam : Node_Id) return Boolean is
17232 if Nkind (Nam) = N_Identifier then
17233 return Chars (Nam) = Type_Id;
17235 elsif Nkind (Nam) = N_Selected_Component then
17236 if Chars (Selector_Name (Nam)) = Type_Id then
17237 if Nkind (Prefix (Nam)) = N_Identifier then
17238 return Chars (Prefix (Nam)) = Chars (Current_Scope);
17240 elsif Nkind (Prefix (Nam)) = N_Selected_Component then
17241 return Chars (Selector_Name (Prefix (Nam))) =
17242 Chars (Current_Scope);
17256 -- Start of processing for Designates_T
17259 if Nkind (Subt) = N_Identifier then
17260 return Chars (Subt) = Type_Id;
17262 -- Reference can be through an expanded name which has not been
17263 -- analyzed yet, and which designates enclosing scopes.
17265 elsif Nkind (Subt) = N_Selected_Component then
17266 if Names_T (Subt) then
17269 -- Otherwise it must denote an entity that is already visible.
17270 -- The access definition may name a subtype of the enclosing
17271 -- type, if there is a previous incomplete declaration for it.
17274 Find_Selected_Component (Subt);
17276 Is_Entity_Name (Subt)
17277 and then Scope (Entity (Subt)) = Current_Scope
17279 (Chars (Base_Type (Entity (Subt))) = Type_Id
17281 (Is_Class_Wide_Type (Entity (Subt))
17283 Chars (Etype (Base_Type (Entity (Subt)))) =
17287 -- A reference to the current type may appear as the prefix of
17288 -- a 'Class attribute.
17290 elsif Nkind (Subt) = N_Attribute_Reference
17291 and then Attribute_Name (Subt) = Name_Class
17293 return Names_T (Prefix (Subt));
17304 function Mentions_T (Acc_Def : Node_Id) return Boolean is
17305 Param_Spec : Node_Id;
17307 Acc_Subprg : constant Node_Id :=
17308 Access_To_Subprogram_Definition (Acc_Def);
17311 if No (Acc_Subprg) then
17312 return Designates_T (Subtype_Mark (Acc_Def));
17315 -- Component is an access_to_subprogram: examine its formals,
17316 -- and result definition in the case of an access_to_function.
17318 Param_Spec := First (Parameter_Specifications (Acc_Subprg));
17319 while Present (Param_Spec) loop
17320 if Nkind (Parameter_Type (Param_Spec)) = N_Access_Definition
17321 and then Mentions_T (Parameter_Type (Param_Spec))
17325 elsif Designates_T (Parameter_Type (Param_Spec)) then
17332 if Nkind (Acc_Subprg) = N_Access_Function_Definition then
17333 if Nkind (Result_Definition (Acc_Subprg)) =
17334 N_Access_Definition
17336 return Mentions_T (Result_Definition (Acc_Subprg));
17338 return Designates_T (Result_Definition (Acc_Subprg));
17345 -- Start of processing for Check_Anonymous_Access_Components
17348 if No (Comp_List) then
17352 Comp := First (Component_Items (Comp_List));
17353 while Present (Comp) loop
17354 if Nkind (Comp) = N_Component_Declaration
17356 (Access_Definition (Component_Definition (Comp)))
17358 Mentions_T (Access_Definition (Component_Definition (Comp)))
17360 Comp_Def := Component_Definition (Comp);
17362 Access_To_Subprogram_Definition
17363 (Access_Definition (Comp_Def));
17365 Build_Incomplete_Type_Declaration;
17367 Make_Defining_Identifier (Loc,
17368 Chars => New_Internal_Name ('S'));
17370 -- Create a declaration for the anonymous access type: either
17371 -- an access_to_object or an access_to_subprogram.
17373 if Present (Acc_Def) then
17374 if Nkind (Acc_Def) = N_Access_Function_Definition then
17376 Make_Access_Function_Definition (Loc,
17377 Parameter_Specifications =>
17378 Parameter_Specifications (Acc_Def),
17379 Result_Definition => Result_Definition (Acc_Def));
17382 Make_Access_Procedure_Definition (Loc,
17383 Parameter_Specifications =>
17384 Parameter_Specifications (Acc_Def));
17389 Make_Access_To_Object_Definition (Loc,
17390 Subtype_Indication =>
17393 (Access_Definition (Comp_Def))));
17395 Set_Constant_Present
17396 (Type_Def, Constant_Present (Access_Definition (Comp_Def)));
17398 (Type_Def, All_Present (Access_Definition (Comp_Def)));
17401 Set_Null_Exclusion_Present
17403 Null_Exclusion_Present (Access_Definition (Comp_Def)));
17406 Make_Full_Type_Declaration (Loc,
17407 Defining_Identifier => Anon_Access,
17408 Type_Definition => Type_Def);
17410 Insert_Before (Typ_Decl, Decl);
17413 -- If an access to object, Preserve entity of designated type,
17414 -- for ASIS use, before rewriting the component definition.
17416 if No (Acc_Def) then
17421 Desig := Entity (Subtype_Indication (Type_Def));
17423 -- If the access definition is to the current record,
17424 -- the visible entity at this point is an incomplete
17425 -- type. Retrieve the full view to simplify ASIS queries
17427 if Ekind (Desig) = E_Incomplete_Type then
17428 Desig := Full_View (Desig);
17432 (Subtype_Mark (Access_Definition (Comp_Def)), Desig);
17437 Make_Component_Definition (Loc,
17438 Subtype_Indication =>
17439 New_Occurrence_Of (Anon_Access, Loc)));
17441 if Ekind (Designated_Type (Anon_Access)) = E_Subprogram_Type then
17442 Set_Ekind (Anon_Access, E_Anonymous_Access_Subprogram_Type);
17444 Set_Ekind (Anon_Access, E_Anonymous_Access_Type);
17447 Set_Is_Local_Anonymous_Access (Anon_Access);
17453 if Present (Variant_Part (Comp_List)) then
17457 V := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
17458 while Present (V) loop
17459 Check_Anonymous_Access_Components
17460 (Typ_Decl, Typ, Prev, Component_List (V));
17461 Next_Non_Pragma (V);
17465 end Check_Anonymous_Access_Components;
17467 --------------------------------
17468 -- Preanalyze_Spec_Expression --
17469 --------------------------------
17471 procedure Preanalyze_Spec_Expression (N : Node_Id; T : Entity_Id) is
17472 Save_In_Spec_Expression : constant Boolean := In_Spec_Expression;
17474 In_Spec_Expression := True;
17475 Preanalyze_And_Resolve (N, T);
17476 In_Spec_Expression := Save_In_Spec_Expression;
17477 end Preanalyze_Spec_Expression;
17479 -----------------------------
17480 -- Record_Type_Declaration --
17481 -----------------------------
17483 procedure Record_Type_Declaration
17488 Def : constant Node_Id := Type_Definition (N);
17489 Is_Tagged : Boolean;
17490 Tag_Comp : Entity_Id;
17493 -- These flags must be initialized before calling Process_Discriminants
17494 -- because this routine makes use of them.
17496 Set_Ekind (T, E_Record_Type);
17498 Init_Size_Align (T);
17499 Set_Interfaces (T, No_Elist);
17500 Set_Stored_Constraint (T, No_Elist);
17504 if Ada_Version < Ada_05
17505 or else not Interface_Present (Def)
17507 -- The flag Is_Tagged_Type might have already been set by
17508 -- Find_Type_Name if it detected an error for declaration T. This
17509 -- arises in the case of private tagged types where the full view
17510 -- omits the word tagged.
17513 Tagged_Present (Def)
17514 or else (Serious_Errors_Detected > 0 and then Is_Tagged_Type (T));
17516 Set_Is_Tagged_Type (T, Is_Tagged);
17517 Set_Is_Limited_Record (T, Limited_Present (Def));
17519 -- Type is abstract if full declaration carries keyword, or if
17520 -- previous partial view did.
17522 Set_Is_Abstract_Type (T, Is_Abstract_Type (T)
17523 or else Abstract_Present (Def));
17527 Analyze_Interface_Declaration (T, Def);
17529 if Present (Discriminant_Specifications (N)) then
17531 ("interface types cannot have discriminants",
17532 Defining_Identifier
17533 (First (Discriminant_Specifications (N))));
17537 -- First pass: if there are self-referential access components,
17538 -- create the required anonymous access type declarations, and if
17539 -- need be an incomplete type declaration for T itself.
17541 Check_Anonymous_Access_Components (N, T, Prev, Component_List (Def));
17543 if Ada_Version >= Ada_05
17544 and then Present (Interface_List (Def))
17546 Check_Interfaces (N, Def);
17549 Ifaces_List : Elist_Id;
17552 -- Ada 2005 (AI-251): Collect the list of progenitors that are not
17553 -- already in the parents.
17557 Ifaces_List => Ifaces_List,
17558 Exclude_Parents => True);
17560 Set_Interfaces (T, Ifaces_List);
17564 -- Records constitute a scope for the component declarations within.
17565 -- The scope is created prior to the processing of these declarations.
17566 -- Discriminants are processed first, so that they are visible when
17567 -- processing the other components. The Ekind of the record type itself
17568 -- is set to E_Record_Type (subtypes appear as E_Record_Subtype).
17570 -- Enter record scope
17574 -- If an incomplete or private type declaration was already given for
17575 -- the type, then this scope already exists, and the discriminants have
17576 -- been declared within. We must verify that the full declaration
17577 -- matches the incomplete one.
17579 Check_Or_Process_Discriminants (N, T, Prev);
17581 Set_Is_Constrained (T, not Has_Discriminants (T));
17582 Set_Has_Delayed_Freeze (T, True);
17584 -- For tagged types add a manually analyzed component corresponding
17585 -- to the component _tag, the corresponding piece of tree will be
17586 -- expanded as part of the freezing actions if it is not a CPP_Class.
17590 -- Do not add the tag unless we are in expansion mode
17592 if Expander_Active then
17593 Tag_Comp := Make_Defining_Identifier (Sloc (Def), Name_uTag);
17594 Enter_Name (Tag_Comp);
17596 Set_Ekind (Tag_Comp, E_Component);
17597 Set_Is_Tag (Tag_Comp);
17598 Set_Is_Aliased (Tag_Comp);
17599 Set_Etype (Tag_Comp, RTE (RE_Tag));
17600 Set_DT_Entry_Count (Tag_Comp, No_Uint);
17601 Set_Original_Record_Component (Tag_Comp, Tag_Comp);
17602 Init_Component_Location (Tag_Comp);
17604 -- Ada 2005 (AI-251): Addition of the Tag corresponding to all the
17605 -- implemented interfaces.
17607 if Has_Interfaces (T) then
17608 Add_Interface_Tag_Components (N, T);
17612 Make_Class_Wide_Type (T);
17613 Set_Primitive_Operations (T, New_Elmt_List);
17616 -- We must suppress range checks when processing the components
17617 -- of a record in the presence of discriminants, since we don't
17618 -- want spurious checks to be generated during their analysis, but
17619 -- must reset the Suppress_Range_Checks flags after having processed
17620 -- the record definition.
17622 -- Note: this is the only use of Kill_Range_Checks, and is a bit odd,
17623 -- couldn't we just use the normal range check suppression method here.
17624 -- That would seem cleaner ???
17626 if Has_Discriminants (T) and then not Range_Checks_Suppressed (T) then
17627 Set_Kill_Range_Checks (T, True);
17628 Record_Type_Definition (Def, Prev);
17629 Set_Kill_Range_Checks (T, False);
17631 Record_Type_Definition (Def, Prev);
17634 -- Exit from record scope
17638 -- Ada 2005 (AI-251 and AI-345): Derive the interface subprograms of all
17639 -- the implemented interfaces and associate them an aliased entity.
17642 and then not Is_Empty_List (Interface_List (Def))
17644 Derive_Progenitor_Subprograms (T, T);
17646 end Record_Type_Declaration;
17648 ----------------------------
17649 -- Record_Type_Definition --
17650 ----------------------------
17652 procedure Record_Type_Definition (Def : Node_Id; Prev_T : Entity_Id) is
17653 Component : Entity_Id;
17654 Ctrl_Components : Boolean := False;
17655 Final_Storage_Only : Boolean;
17659 if Ekind (Prev_T) = E_Incomplete_Type then
17660 T := Full_View (Prev_T);
17665 Final_Storage_Only := not Is_Controlled (T);
17667 -- Ada 2005: check whether an explicit Limited is present in a derived
17668 -- type declaration.
17670 if Nkind (Parent (Def)) = N_Derived_Type_Definition
17671 and then Limited_Present (Parent (Def))
17673 Set_Is_Limited_Record (T);
17676 -- If the component list of a record type is defined by the reserved
17677 -- word null and there is no discriminant part, then the record type has
17678 -- no components and all records of the type are null records (RM 3.7)
17679 -- This procedure is also called to process the extension part of a
17680 -- record extension, in which case the current scope may have inherited
17684 or else No (Component_List (Def))
17685 or else Null_Present (Component_List (Def))
17690 Analyze_Declarations (Component_Items (Component_List (Def)));
17692 if Present (Variant_Part (Component_List (Def))) then
17693 Analyze (Variant_Part (Component_List (Def)));
17697 -- After completing the semantic analysis of the record definition,
17698 -- record components, both new and inherited, are accessible. Set their
17699 -- kind accordingly. Exclude malformed itypes from illegal declarations,
17700 -- whose Ekind may be void.
17702 Component := First_Entity (Current_Scope);
17703 while Present (Component) loop
17704 if Ekind (Component) = E_Void
17705 and then not Is_Itype (Component)
17707 Set_Ekind (Component, E_Component);
17708 Init_Component_Location (Component);
17711 if Has_Task (Etype (Component)) then
17715 if Ekind (Component) /= E_Component then
17718 elsif Has_Controlled_Component (Etype (Component))
17719 or else (Chars (Component) /= Name_uParent
17720 and then Is_Controlled (Etype (Component)))
17722 Set_Has_Controlled_Component (T, True);
17723 Final_Storage_Only :=
17725 and then Finalize_Storage_Only (Etype (Component));
17726 Ctrl_Components := True;
17729 Next_Entity (Component);
17732 -- A Type is Finalize_Storage_Only only if all its controlled components
17735 if Ctrl_Components then
17736 Set_Finalize_Storage_Only (T, Final_Storage_Only);
17739 -- Place reference to end record on the proper entity, which may
17740 -- be a partial view.
17742 if Present (Def) then
17743 Process_End_Label (Def, 'e', Prev_T);
17745 end Record_Type_Definition;
17747 ------------------------
17748 -- Replace_Components --
17749 ------------------------
17751 procedure Replace_Components (Typ : Entity_Id; Decl : Node_Id) is
17752 function Process (N : Node_Id) return Traverse_Result;
17758 function Process (N : Node_Id) return Traverse_Result is
17762 if Nkind (N) = N_Discriminant_Specification then
17763 Comp := First_Discriminant (Typ);
17764 while Present (Comp) loop
17765 if Chars (Comp) = Chars (Defining_Identifier (N)) then
17766 Set_Defining_Identifier (N, Comp);
17770 Next_Discriminant (Comp);
17773 elsif Nkind (N) = N_Component_Declaration then
17774 Comp := First_Component (Typ);
17775 while Present (Comp) loop
17776 if Chars (Comp) = Chars (Defining_Identifier (N)) then
17777 Set_Defining_Identifier (N, Comp);
17781 Next_Component (Comp);
17788 procedure Replace is new Traverse_Proc (Process);
17790 -- Start of processing for Replace_Components
17794 end Replace_Components;
17796 -------------------------------
17797 -- Set_Completion_Referenced --
17798 -------------------------------
17800 procedure Set_Completion_Referenced (E : Entity_Id) is
17802 -- If in main unit, mark entity that is a completion as referenced,
17803 -- warnings go on the partial view when needed.
17805 if In_Extended_Main_Source_Unit (E) then
17806 Set_Referenced (E);
17808 end Set_Completion_Referenced;
17810 ---------------------
17811 -- Set_Fixed_Range --
17812 ---------------------
17814 -- The range for fixed-point types is complicated by the fact that we
17815 -- do not know the exact end points at the time of the declaration. This
17816 -- is true for three reasons:
17818 -- A size clause may affect the fudging of the end-points
17819 -- A small clause may affect the values of the end-points
17820 -- We try to include the end-points if it does not affect the size
17822 -- This means that the actual end-points must be established at the point
17823 -- when the type is frozen. Meanwhile, we first narrow the range as
17824 -- permitted (so that it will fit if necessary in a small specified size),
17825 -- and then build a range subtree with these narrowed bounds.
17827 -- Set_Fixed_Range constructs the range from real literal values, and sets
17828 -- the range as the Scalar_Range of the given fixed-point type entity.
17830 -- The parent of this range is set to point to the entity so that it is
17831 -- properly hooked into the tree (unlike normal Scalar_Range entries for
17832 -- other scalar types, which are just pointers to the range in the
17833 -- original tree, this would otherwise be an orphan).
17835 -- The tree is left unanalyzed. When the type is frozen, the processing
17836 -- in Freeze.Freeze_Fixed_Point_Type notices that the range is not
17837 -- analyzed, and uses this as an indication that it should complete
17838 -- work on the range (it will know the final small and size values).
17840 procedure Set_Fixed_Range
17846 S : constant Node_Id :=
17848 Low_Bound => Make_Real_Literal (Loc, Lo),
17849 High_Bound => Make_Real_Literal (Loc, Hi));
17851 Set_Scalar_Range (E, S);
17853 end Set_Fixed_Range;
17855 ----------------------------------
17856 -- Set_Scalar_Range_For_Subtype --
17857 ----------------------------------
17859 procedure Set_Scalar_Range_For_Subtype
17860 (Def_Id : Entity_Id;
17864 Kind : constant Entity_Kind := Ekind (Def_Id);
17867 Set_Scalar_Range (Def_Id, R);
17869 -- We need to link the range into the tree before resolving it so
17870 -- that types that are referenced, including importantly the subtype
17871 -- itself, are properly frozen (Freeze_Expression requires that the
17872 -- expression be properly linked into the tree). Of course if it is
17873 -- already linked in, then we do not disturb the current link.
17875 if No (Parent (R)) then
17876 Set_Parent (R, Def_Id);
17879 -- Reset the kind of the subtype during analysis of the range, to
17880 -- catch possible premature use in the bounds themselves.
17882 Set_Ekind (Def_Id, E_Void);
17883 Process_Range_Expr_In_Decl (R, Subt);
17884 Set_Ekind (Def_Id, Kind);
17885 end Set_Scalar_Range_For_Subtype;
17887 --------------------------------------------------------
17888 -- Set_Stored_Constraint_From_Discriminant_Constraint --
17889 --------------------------------------------------------
17891 procedure Set_Stored_Constraint_From_Discriminant_Constraint
17895 -- Make sure set if encountered during Expand_To_Stored_Constraint
17897 Set_Stored_Constraint (E, No_Elist);
17899 -- Give it the right value
17901 if Is_Constrained (E) and then Has_Discriminants (E) then
17902 Set_Stored_Constraint (E,
17903 Expand_To_Stored_Constraint (E, Discriminant_Constraint (E)));
17905 end Set_Stored_Constraint_From_Discriminant_Constraint;
17907 -------------------------------------
17908 -- Signed_Integer_Type_Declaration --
17909 -------------------------------------
17911 procedure Signed_Integer_Type_Declaration (T : Entity_Id; Def : Node_Id) is
17912 Implicit_Base : Entity_Id;
17913 Base_Typ : Entity_Id;
17916 Errs : Boolean := False;
17920 function Can_Derive_From (E : Entity_Id) return Boolean;
17921 -- Determine whether given bounds allow derivation from specified type
17923 procedure Check_Bound (Expr : Node_Id);
17924 -- Check bound to make sure it is integral and static. If not, post
17925 -- appropriate error message and set Errs flag
17927 ---------------------
17928 -- Can_Derive_From --
17929 ---------------------
17931 -- Note we check both bounds against both end values, to deal with
17932 -- strange types like ones with a range of 0 .. -12341234.
17934 function Can_Derive_From (E : Entity_Id) return Boolean is
17935 Lo : constant Uint := Expr_Value (Type_Low_Bound (E));
17936 Hi : constant Uint := Expr_Value (Type_High_Bound (E));
17938 return Lo <= Lo_Val and then Lo_Val <= Hi
17940 Lo <= Hi_Val and then Hi_Val <= Hi;
17941 end Can_Derive_From;
17947 procedure Check_Bound (Expr : Node_Id) is
17949 -- If a range constraint is used as an integer type definition, each
17950 -- bound of the range must be defined by a static expression of some
17951 -- integer type, but the two bounds need not have the same integer
17952 -- type (Negative bounds are allowed.) (RM 3.5.4)
17954 if not Is_Integer_Type (Etype (Expr)) then
17956 ("integer type definition bounds must be of integer type", Expr);
17959 elsif not Is_OK_Static_Expression (Expr) then
17960 Flag_Non_Static_Expr
17961 ("non-static expression used for integer type bound!", Expr);
17964 -- The bounds are folded into literals, and we set their type to be
17965 -- universal, to avoid typing difficulties: we cannot set the type
17966 -- of the literal to the new type, because this would be a forward
17967 -- reference for the back end, and if the original type is user-
17968 -- defined this can lead to spurious semantic errors (e.g. 2928-003).
17971 if Is_Entity_Name (Expr) then
17972 Fold_Uint (Expr, Expr_Value (Expr), True);
17975 Set_Etype (Expr, Universal_Integer);
17979 -- Start of processing for Signed_Integer_Type_Declaration
17982 -- Create an anonymous base type
17985 Create_Itype (E_Signed_Integer_Type, Parent (Def), T, 'B');
17987 -- Analyze and check the bounds, they can be of any integer type
17989 Lo := Low_Bound (Def);
17990 Hi := High_Bound (Def);
17992 -- Arbitrarily use Integer as the type if either bound had an error
17994 if Hi = Error or else Lo = Error then
17995 Base_Typ := Any_Integer;
17996 Set_Error_Posted (T, True);
17998 -- Here both bounds are OK expressions
18001 Analyze_And_Resolve (Lo, Any_Integer);
18002 Analyze_And_Resolve (Hi, Any_Integer);
18008 Hi := Type_High_Bound (Standard_Long_Long_Integer);
18009 Lo := Type_Low_Bound (Standard_Long_Long_Integer);
18012 -- Find type to derive from
18014 Lo_Val := Expr_Value (Lo);
18015 Hi_Val := Expr_Value (Hi);
18017 if Can_Derive_From (Standard_Short_Short_Integer) then
18018 Base_Typ := Base_Type (Standard_Short_Short_Integer);
18020 elsif Can_Derive_From (Standard_Short_Integer) then
18021 Base_Typ := Base_Type (Standard_Short_Integer);
18023 elsif Can_Derive_From (Standard_Integer) then
18024 Base_Typ := Base_Type (Standard_Integer);
18026 elsif Can_Derive_From (Standard_Long_Integer) then
18027 Base_Typ := Base_Type (Standard_Long_Integer);
18029 elsif Can_Derive_From (Standard_Long_Long_Integer) then
18030 Base_Typ := Base_Type (Standard_Long_Long_Integer);
18033 Base_Typ := Base_Type (Standard_Long_Long_Integer);
18034 Error_Msg_N ("integer type definition bounds out of range", Def);
18035 Hi := Type_High_Bound (Standard_Long_Long_Integer);
18036 Lo := Type_Low_Bound (Standard_Long_Long_Integer);
18040 -- Complete both implicit base and declared first subtype entities
18042 Set_Etype (Implicit_Base, Base_Typ);
18043 Set_Scalar_Range (Implicit_Base, Scalar_Range (Base_Typ));
18044 Set_Size_Info (Implicit_Base, (Base_Typ));
18045 Set_RM_Size (Implicit_Base, RM_Size (Base_Typ));
18046 Set_First_Rep_Item (Implicit_Base, First_Rep_Item (Base_Typ));
18048 Set_Ekind (T, E_Signed_Integer_Subtype);
18049 Set_Etype (T, Implicit_Base);
18051 Set_Size_Info (T, (Implicit_Base));
18052 Set_First_Rep_Item (T, First_Rep_Item (Implicit_Base));
18053 Set_Scalar_Range (T, Def);
18054 Set_RM_Size (T, UI_From_Int (Minimum_Size (T)));
18055 Set_Is_Constrained (T);
18056 end Signed_Integer_Type_Declaration;