1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2018, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Aspects
; use Aspects
;
27 with Atree
; use Atree
;
28 with Checks
; use Checks
;
29 with Contracts
; use Contracts
;
30 with Debug
; use Debug
;
31 with Elists
; use Elists
;
32 with Einfo
; use Einfo
;
33 with Errout
; use Errout
;
34 with Eval_Fat
; use Eval_Fat
;
35 with Exp_Ch3
; use Exp_Ch3
;
36 with Exp_Ch9
; use Exp_Ch9
;
37 with Exp_Disp
; use Exp_Disp
;
38 with Exp_Dist
; use Exp_Dist
;
39 with Exp_Tss
; use Exp_Tss
;
40 with Exp_Util
; use Exp_Util
;
41 with Freeze
; use Freeze
;
42 with Ghost
; use Ghost
;
43 with Itypes
; use Itypes
;
44 with Layout
; use Layout
;
46 with Lib
.Xref
; use Lib
.Xref
;
47 with Namet
; use Namet
;
48 with Nmake
; use Nmake
;
50 with Restrict
; use Restrict
;
51 with Rident
; use Rident
;
52 with Rtsfind
; use Rtsfind
;
54 with Sem_Aux
; use Sem_Aux
;
55 with Sem_Case
; use Sem_Case
;
56 with Sem_Cat
; use Sem_Cat
;
57 with Sem_Ch6
; use Sem_Ch6
;
58 with Sem_Ch7
; use Sem_Ch7
;
59 with Sem_Ch8
; use Sem_Ch8
;
60 with Sem_Ch13
; use Sem_Ch13
;
61 with Sem_Dim
; use Sem_Dim
;
62 with Sem_Disp
; use Sem_Disp
;
63 with Sem_Dist
; use Sem_Dist
;
64 with Sem_Elab
; use Sem_Elab
;
65 with Sem_Elim
; use Sem_Elim
;
66 with Sem_Eval
; use Sem_Eval
;
67 with Sem_Mech
; use Sem_Mech
;
68 with Sem_Res
; use Sem_Res
;
69 with Sem_Smem
; use Sem_Smem
;
70 with Sem_Type
; use Sem_Type
;
71 with Sem_Util
; use Sem_Util
;
72 with Sem_Warn
; use Sem_Warn
;
73 with Stand
; use Stand
;
74 with Sinfo
; use Sinfo
;
75 with Sinput
; use Sinput
;
76 with Snames
; use Snames
;
77 with Targparm
; use Targparm
;
78 with Tbuild
; use Tbuild
;
79 with Ttypes
; use Ttypes
;
80 with Uintp
; use Uintp
;
81 with Urealp
; use Urealp
;
83 package body Sem_Ch3
is
85 -----------------------
86 -- Local Subprograms --
87 -----------------------
89 procedure Add_Interface_Tag_Components
(N
: Node_Id
; Typ
: Entity_Id
);
90 -- Ada 2005 (AI-251): Add the tag components corresponding to all the
91 -- abstract interface types implemented by a record type or a derived
94 procedure Build_Derived_Type
96 Parent_Type
: Entity_Id
;
97 Derived_Type
: Entity_Id
;
98 Is_Completion
: Boolean;
99 Derive_Subps
: Boolean := True);
100 -- Create and decorate a Derived_Type given the Parent_Type entity. N is
101 -- the N_Full_Type_Declaration node containing the derived type definition.
102 -- Parent_Type is the entity for the parent type in the derived type
103 -- definition and Derived_Type the actual derived type. Is_Completion must
104 -- be set to False if Derived_Type is the N_Defining_Identifier node in N
105 -- (i.e. Derived_Type = Defining_Identifier (N)). In this case N is not the
106 -- completion of a private type declaration. If Is_Completion is set to
107 -- True, N is the completion of a private type declaration and Derived_Type
108 -- is different from the defining identifier inside N (i.e. Derived_Type /=
109 -- Defining_Identifier (N)). Derive_Subps indicates whether the parent
110 -- subprograms should be derived. The only case where this parameter is
111 -- False is when Build_Derived_Type is recursively called to process an
112 -- implicit derived full type for a type derived from a private type (in
113 -- that case the subprograms must only be derived for the private view of
116 -- ??? These flags need a bit of re-examination and re-documentation:
117 -- ??? are they both necessary (both seem related to the recursion)?
119 procedure Build_Derived_Access_Type
121 Parent_Type
: Entity_Id
;
122 Derived_Type
: Entity_Id
);
123 -- Subsidiary procedure to Build_Derived_Type. For a derived access type,
124 -- create an implicit base if the parent type is constrained or if the
125 -- subtype indication has a constraint.
127 procedure Build_Derived_Array_Type
129 Parent_Type
: Entity_Id
;
130 Derived_Type
: Entity_Id
);
131 -- Subsidiary procedure to Build_Derived_Type. For a derived array type,
132 -- create an implicit base if the parent type is constrained or if the
133 -- subtype indication has a constraint.
135 procedure Build_Derived_Concurrent_Type
137 Parent_Type
: Entity_Id
;
138 Derived_Type
: Entity_Id
);
139 -- Subsidiary procedure to Build_Derived_Type. For a derived task or
140 -- protected type, inherit entries and protected subprograms, check
141 -- legality of discriminant constraints if any.
143 procedure Build_Derived_Enumeration_Type
145 Parent_Type
: Entity_Id
;
146 Derived_Type
: Entity_Id
);
147 -- Subsidiary procedure to Build_Derived_Type. For a derived enumeration
148 -- type, we must create a new list of literals. Types derived from
149 -- Character and [Wide_]Wide_Character are special-cased.
151 procedure Build_Derived_Numeric_Type
153 Parent_Type
: Entity_Id
;
154 Derived_Type
: Entity_Id
);
155 -- Subsidiary procedure to Build_Derived_Type. For numeric types, create
156 -- an anonymous base type, and propagate constraint to subtype if needed.
158 procedure Build_Derived_Private_Type
160 Parent_Type
: Entity_Id
;
161 Derived_Type
: Entity_Id
;
162 Is_Completion
: Boolean;
163 Derive_Subps
: Boolean := True);
164 -- Subsidiary procedure to Build_Derived_Type. This procedure is complex
165 -- because the parent may or may not have a completion, and the derivation
166 -- may itself be a completion.
168 procedure Build_Derived_Record_Type
170 Parent_Type
: Entity_Id
;
171 Derived_Type
: Entity_Id
;
172 Derive_Subps
: Boolean := True);
173 -- Subsidiary procedure used for tagged and untagged record types
174 -- by Build_Derived_Type and Analyze_Private_Extension_Declaration.
175 -- All parameters are as in Build_Derived_Type except that N, in
176 -- addition to being an N_Full_Type_Declaration node, can also be an
177 -- N_Private_Extension_Declaration node. See the definition of this routine
178 -- for much more info. Derive_Subps indicates whether subprograms should be
179 -- derived from the parent type. The only case where Derive_Subps is False
180 -- is for an implicit derived full type for a type derived from a private
181 -- type (see Build_Derived_Type).
183 procedure Build_Discriminal
(Discrim
: Entity_Id
);
184 -- Create the discriminal corresponding to discriminant Discrim, that is
185 -- the parameter corresponding to Discrim to be used in initialization
186 -- procedures for the type where Discrim is a discriminant. Discriminals
187 -- are not used during semantic analysis, and are not fully defined
188 -- entities until expansion. Thus they are not given a scope until
189 -- initialization procedures are built.
191 function Build_Discriminant_Constraints
194 Derived_Def
: Boolean := False) return Elist_Id
;
195 -- Validate discriminant constraints and return the list of the constraints
196 -- in order of discriminant declarations, where T is the discriminated
197 -- unconstrained type. Def is the N_Subtype_Indication node where the
198 -- discriminants constraints for T are specified. Derived_Def is True
199 -- when building the discriminant constraints in a derived type definition
200 -- of the form "type D (...) is new T (xxx)". In this case T is the parent
201 -- type and Def is the constraint "(xxx)" on T and this routine sets the
202 -- Corresponding_Discriminant field of the discriminants in the derived
203 -- type D to point to the corresponding discriminants in the parent type T.
205 procedure Build_Discriminated_Subtype
209 Related_Nod
: Node_Id
;
210 For_Access
: Boolean := False);
211 -- Subsidiary procedure to Constrain_Discriminated_Type and to
212 -- Process_Incomplete_Dependents. Given
214 -- T (a possibly discriminated base type)
215 -- Def_Id (a very partially built subtype for T),
217 -- the call completes Def_Id to be the appropriate E_*_Subtype.
219 -- The Elist is the list of discriminant constraints if any (it is set
220 -- to No_Elist if T is not a discriminated type, and to an empty list if
221 -- T has discriminants but there are no discriminant constraints). The
222 -- Related_Nod is the same as Decl_Node in Create_Constrained_Components.
223 -- The For_Access says whether or not this subtype is really constraining
224 -- an access type. That is its sole purpose is the designated type of an
225 -- access type -- in which case a Private_Subtype Is_For_Access_Subtype
226 -- is built to avoid freezing T when the access subtype is frozen.
228 function Build_Scalar_Bound
231 Der_T
: Entity_Id
) return Node_Id
;
232 -- The bounds of a derived scalar type are conversions of the bounds of
233 -- the parent type. Optimize the representation if the bounds are literals.
234 -- Needs a more complete spec--what are the parameters exactly, and what
235 -- exactly is the returned value, and how is Bound affected???
237 procedure Build_Underlying_Full_View
241 -- If the completion of a private type is itself derived from a private
242 -- type, or if the full view of a private subtype is itself private, the
243 -- back-end has no way to compute the actual size of this type. We build
244 -- an internal subtype declaration of the proper parent type to convey
245 -- this information. This extra mechanism is needed because a full
246 -- view cannot itself have a full view (it would get clobbered during
249 procedure Check_Access_Discriminant_Requires_Limited
252 -- Check the restriction that the type to which an access discriminant
253 -- belongs must be a concurrent type or a descendant of a type with
254 -- the reserved word 'limited' in its declaration.
256 procedure Check_Anonymous_Access_Components
260 Comp_List
: Node_Id
);
261 -- Ada 2005 AI-382: an access component in a record definition can refer to
262 -- the enclosing record, in which case it denotes the type itself, and not
263 -- the current instance of the type. We create an anonymous access type for
264 -- the component, and flag it as an access to a component, so accessibility
265 -- checks are properly performed on it. The declaration of the access type
266 -- is placed ahead of that of the record to prevent order-of-elaboration
267 -- circularity issues in Gigi. We create an incomplete type for the record
268 -- declaration, which is the designated type of the anonymous access.
270 procedure Check_Delta_Expression
(E
: Node_Id
);
271 -- Check that the expression represented by E is suitable for use as a
272 -- delta expression, i.e. it is of real type and is static.
274 procedure Check_Digits_Expression
(E
: Node_Id
);
275 -- Check that the expression represented by E is suitable for use as a
276 -- digits expression, i.e. it is of integer type, positive and static.
278 procedure Check_Initialization
(T
: Entity_Id
; Exp
: Node_Id
);
279 -- Validate the initialization of an object declaration. T is the required
280 -- type, and Exp is the initialization expression.
282 procedure Check_Interfaces
(N
: Node_Id
; Def
: Node_Id
);
283 -- Check ARM rules 3.9.4 (15/2), 9.1 (9.d/2) and 9.4 (11.d/2)
285 procedure Check_Or_Process_Discriminants
288 Prev
: Entity_Id
:= Empty
);
289 -- If N is the full declaration of the completion T of an incomplete or
290 -- private type, check its discriminants (which are already known to be
291 -- conformant with those of the partial view, see Find_Type_Name),
292 -- otherwise process them. Prev is the entity of the partial declaration,
295 procedure Check_Real_Bound
(Bound
: Node_Id
);
296 -- Check given bound for being of real type and static. If not, post an
297 -- appropriate message, and rewrite the bound with the real literal zero.
299 procedure Constant_Redeclaration
303 -- Various checks on legality of full declaration of deferred constant.
304 -- Id is the entity for the redeclaration, N is the N_Object_Declaration,
305 -- node. The caller has not yet set any attributes of this entity.
307 function Contain_Interface
309 Ifaces
: Elist_Id
) return Boolean;
310 -- Ada 2005: Determine whether Iface is present in the list Ifaces
312 procedure Convert_Scalar_Bounds
314 Parent_Type
: Entity_Id
;
315 Derived_Type
: Entity_Id
;
317 -- For derived scalar types, convert the bounds in the type definition to
318 -- the derived type, and complete their analysis. Given a constraint of the
319 -- form ".. new T range Lo .. Hi", Lo and Hi are analyzed and resolved with
320 -- T'Base, the parent_type. The bounds of the derived type (the anonymous
321 -- base) are copies of Lo and Hi. Finally, the bounds of the derived
322 -- subtype are conversions of those bounds to the derived_type, so that
323 -- their typing is consistent.
325 procedure Copy_Array_Base_Type_Attributes
(T1
, T2
: Entity_Id
);
326 -- Copies attributes from array base type T2 to array base type T1. Copies
327 -- only attributes that apply to base types, but not subtypes.
329 procedure Copy_Array_Subtype_Attributes
(T1
, T2
: Entity_Id
);
330 -- Copies attributes from array subtype T2 to array subtype T1. Copies
331 -- attributes that apply to both subtypes and base types.
333 procedure Create_Constrained_Components
337 Constraints
: Elist_Id
);
338 -- Build the list of entities for a constrained discriminated record
339 -- subtype. If a component depends on a discriminant, replace its subtype
340 -- using the discriminant values in the discriminant constraint. Subt
341 -- is the defining identifier for the subtype whose list of constrained
342 -- entities we will create. Decl_Node is the type declaration node where
343 -- we will attach all the itypes created. Typ is the base discriminated
344 -- type for the subtype Subt. Constraints is the list of discriminant
345 -- constraints for Typ.
347 function Constrain_Component_Type
349 Constrained_Typ
: Entity_Id
;
350 Related_Node
: Node_Id
;
352 Constraints
: Elist_Id
) return Entity_Id
;
353 -- Given a discriminated base type Typ, a list of discriminant constraints,
354 -- Constraints, for Typ and a component Comp of Typ, create and return the
355 -- type corresponding to Etype (Comp) where all discriminant references
356 -- are replaced with the corresponding constraint. If Etype (Comp) contains
357 -- no discriminant references then it is returned as-is. Constrained_Typ
358 -- is the final constrained subtype to which the constrained component
359 -- belongs. Related_Node is the node where we attach all created itypes.
361 procedure Constrain_Access
362 (Def_Id
: in out Entity_Id
;
364 Related_Nod
: Node_Id
);
365 -- Apply a list of constraints to an access type. If Def_Id is empty, it is
366 -- an anonymous type created for a subtype indication. In that case it is
367 -- created in the procedure and attached to Related_Nod.
369 procedure Constrain_Array
370 (Def_Id
: in out Entity_Id
;
372 Related_Nod
: Node_Id
;
373 Related_Id
: Entity_Id
;
375 -- Apply a list of index constraints to an unconstrained array type. The
376 -- first parameter is the entity for the resulting subtype. A value of
377 -- Empty for Def_Id indicates that an implicit type must be created, but
378 -- creation is delayed (and must be done by this procedure) because other
379 -- subsidiary implicit types must be created first (which is why Def_Id
380 -- is an in/out parameter). The second parameter is a subtype indication
381 -- node for the constrained array to be created (e.g. something of the
382 -- form string (1 .. 10)). Related_Nod gives the place where this type
383 -- has to be inserted in the tree. The Related_Id and Suffix parameters
384 -- are used to build the associated Implicit type name.
386 procedure Constrain_Concurrent
387 (Def_Id
: in out Entity_Id
;
389 Related_Nod
: Node_Id
;
390 Related_Id
: Entity_Id
;
392 -- Apply list of discriminant constraints to an unconstrained concurrent
395 -- SI is the N_Subtype_Indication node containing the constraint and
396 -- the unconstrained type to constrain.
398 -- Def_Id is the entity for the resulting constrained subtype. A value
399 -- of Empty for Def_Id indicates that an implicit type must be created,
400 -- but creation is delayed (and must be done by this procedure) because
401 -- other subsidiary implicit types must be created first (which is why
402 -- Def_Id is an in/out parameter).
404 -- Related_Nod gives the place where this type has to be inserted
407 -- The last two arguments are used to create its external name if needed.
409 function Constrain_Corresponding_Record
410 (Prot_Subt
: Entity_Id
;
411 Corr_Rec
: Entity_Id
;
412 Related_Nod
: Node_Id
) return Entity_Id
;
413 -- When constraining a protected type or task type with discriminants,
414 -- constrain the corresponding record with the same discriminant values.
416 procedure Constrain_Decimal
(Def_Id
: Node_Id
; S
: Node_Id
);
417 -- Constrain a decimal fixed point type with a digits constraint and/or a
418 -- range constraint, and build E_Decimal_Fixed_Point_Subtype entity.
420 procedure Constrain_Discriminated_Type
423 Related_Nod
: Node_Id
;
424 For_Access
: Boolean := False);
425 -- Process discriminant constraints of composite type. Verify that values
426 -- have been provided for all discriminants, that the original type is
427 -- unconstrained, and that the types of the supplied expressions match
428 -- the discriminant types. The first three parameters are like in routine
429 -- Constrain_Concurrent. See Build_Discriminated_Subtype for an explanation
432 procedure Constrain_Enumeration
(Def_Id
: Node_Id
; S
: Node_Id
);
433 -- Constrain an enumeration type with a range constraint. This is identical
434 -- to Constrain_Integer, but for the Ekind of the resulting subtype.
436 procedure Constrain_Float
(Def_Id
: Node_Id
; S
: Node_Id
);
437 -- Constrain a floating point type with either a digits constraint
438 -- and/or a range constraint, building a E_Floating_Point_Subtype.
440 procedure Constrain_Index
443 Related_Nod
: Node_Id
;
444 Related_Id
: Entity_Id
;
447 -- Process an index constraint S in a constrained array declaration. The
448 -- constraint can be a subtype name, or a range with or without an explicit
449 -- subtype mark. The index is the corresponding index of the unconstrained
450 -- array. The Related_Id and Suffix parameters are used to build the
451 -- associated Implicit type name.
453 procedure Constrain_Integer
(Def_Id
: Node_Id
; S
: Node_Id
);
454 -- Build subtype of a signed or modular integer type
456 procedure Constrain_Ordinary_Fixed
(Def_Id
: Node_Id
; S
: Node_Id
);
457 -- Constrain an ordinary fixed point type with a range constraint, and
458 -- build an E_Ordinary_Fixed_Point_Subtype entity.
460 procedure Copy_And_Swap
(Priv
, Full
: Entity_Id
);
461 -- Copy the Priv entity into the entity of its full declaration then swap
462 -- the two entities in such a manner that the former private type is now
463 -- seen as a full type.
465 procedure Decimal_Fixed_Point_Type_Declaration
468 -- Create a new decimal fixed point type, and apply the constraint to
469 -- obtain a subtype of this new type.
471 procedure Complete_Private_Subtype
474 Full_Base
: Entity_Id
;
475 Related_Nod
: Node_Id
);
476 -- Complete the implicit full view of a private subtype by setting the
477 -- appropriate semantic fields. If the full view of the parent is a record
478 -- type, build constrained components of subtype.
480 procedure Derive_Progenitor_Subprograms
481 (Parent_Type
: Entity_Id
;
482 Tagged_Type
: Entity_Id
);
483 -- Ada 2005 (AI-251): To complete type derivation, collect the primitive
484 -- operations of progenitors of Tagged_Type, and replace the subsidiary
485 -- subtypes with Tagged_Type, to build the specs of the inherited interface
486 -- primitives. The derived primitives are aliased to those of the
487 -- interface. This routine takes care also of transferring to the full view
488 -- subprograms associated with the partial view of Tagged_Type that cover
489 -- interface primitives.
491 procedure Derived_Standard_Character
493 Parent_Type
: Entity_Id
;
494 Derived_Type
: Entity_Id
);
495 -- Subsidiary procedure to Build_Derived_Enumeration_Type which handles
496 -- derivations from types Standard.Character and Standard.Wide_Character.
498 procedure Derived_Type_Declaration
501 Is_Completion
: Boolean);
502 -- Process a derived type declaration. Build_Derived_Type is invoked
503 -- to process the actual derived type definition. Parameters N and
504 -- Is_Completion have the same meaning as in Build_Derived_Type.
505 -- T is the N_Defining_Identifier for the entity defined in the
506 -- N_Full_Type_Declaration node N, that is T is the derived type.
508 procedure Enumeration_Type_Declaration
(T
: Entity_Id
; Def
: Node_Id
);
509 -- Insert each literal in symbol table, as an overloadable identifier. Each
510 -- enumeration type is mapped into a sequence of integers, and each literal
511 -- is defined as a constant with integer value. If any of the literals are
512 -- character literals, the type is a character type, which means that
513 -- strings are legal aggregates for arrays of components of the type.
515 function Expand_To_Stored_Constraint
517 Constraint
: Elist_Id
) return Elist_Id
;
518 -- Given a constraint (i.e. a list of expressions) on the discriminants of
519 -- Typ, expand it into a constraint on the stored discriminants and return
520 -- the new list of expressions constraining the stored discriminants.
522 function Find_Type_Of_Object
524 Related_Nod
: Node_Id
) return Entity_Id
;
525 -- Get type entity for object referenced by Obj_Def, attaching the implicit
526 -- types generated to Related_Nod.
528 procedure Floating_Point_Type_Declaration
(T
: Entity_Id
; Def
: Node_Id
);
529 -- Create a new float and apply the constraint to obtain subtype of it
531 function Has_Range_Constraint
(N
: Node_Id
) return Boolean;
532 -- Given an N_Subtype_Indication node N, return True if a range constraint
533 -- is present, either directly, or as part of a digits or delta constraint.
534 -- In addition, a digits constraint in the decimal case returns True, since
535 -- it establishes a default range if no explicit range is present.
537 function Inherit_Components
539 Parent_Base
: Entity_Id
;
540 Derived_Base
: Entity_Id
;
542 Inherit_Discr
: Boolean;
543 Discs
: Elist_Id
) return Elist_Id
;
544 -- Called from Build_Derived_Record_Type to inherit the components of
545 -- Parent_Base (a base type) into the Derived_Base (the derived base type).
546 -- For more information on derived types and component inheritance please
547 -- consult the comment above the body of Build_Derived_Record_Type.
549 -- N is the original derived type declaration
551 -- Is_Tagged is set if we are dealing with tagged types
553 -- If Inherit_Discr is set, Derived_Base inherits its discriminants from
554 -- Parent_Base, otherwise no discriminants are inherited.
556 -- Discs gives the list of constraints that apply to Parent_Base in the
557 -- derived type declaration. If Discs is set to No_Elist, then we have
558 -- the following situation:
560 -- type Parent (D1..Dn : ..) is [tagged] record ...;
561 -- type Derived is new Parent [with ...];
563 -- which gets treated as
565 -- type Derived (D1..Dn : ..) is new Parent (D1,..,Dn) [with ...];
567 -- For untagged types the returned value is an association list. The list
568 -- starts from the association (Parent_Base => Derived_Base), and then it
569 -- contains a sequence of the associations of the form
571 -- (Old_Component => New_Component),
573 -- where Old_Component is the Entity_Id of a component in Parent_Base and
574 -- New_Component is the Entity_Id of the corresponding component in
575 -- Derived_Base. For untagged records, this association list is needed when
576 -- copying the record declaration for the derived base. In the tagged case
577 -- the value returned is irrelevant.
579 procedure Inherit_Predicate_Flags
(Subt
, Par
: Entity_Id
);
580 -- Propagate static and dynamic predicate flags from a parent to the
581 -- subtype in a subtype declaration with and without constraints.
583 function Is_EVF_Procedure
(Subp
: Entity_Id
) return Boolean;
584 -- Subsidiary to Check_Abstract_Overriding and Derive_Subprogram.
585 -- Determine whether subprogram Subp is a procedure subject to pragma
586 -- Extensions_Visible with value False and has at least one controlling
587 -- parameter of mode OUT.
589 function Is_Valid_Constraint_Kind
591 Constraint_Kind
: Node_Kind
) return Boolean;
592 -- Returns True if it is legal to apply the given kind of constraint to the
593 -- given kind of type (index constraint to an array type, for example).
595 procedure Modular_Type_Declaration
(T
: Entity_Id
; Def
: Node_Id
);
596 -- Create new modular type. Verify that modulus is in bounds
598 procedure New_Concatenation_Op
(Typ
: Entity_Id
);
599 -- Create an abbreviated declaration for an operator in order to
600 -- materialize concatenation on array types.
602 procedure Ordinary_Fixed_Point_Type_Declaration
605 -- Create a new ordinary fixed point type, and apply the constraint to
606 -- obtain subtype of it.
608 procedure Preanalyze_Default_Expression
(N
: Node_Id
; T
: Entity_Id
);
609 -- Wrapper on Preanalyze_Spec_Expression for default expressions, so that
610 -- In_Default_Expr can be properly adjusted.
612 procedure Prepare_Private_Subtype_Completion
614 Related_Nod
: Node_Id
);
615 -- Id is a subtype of some private type. Creates the full declaration
616 -- associated with Id whenever possible, i.e. when the full declaration
617 -- of the base type is already known. Records each subtype into
618 -- Private_Dependents of the base type.
620 procedure Process_Incomplete_Dependents
624 -- Process all entities that depend on an incomplete type. There include
625 -- subtypes, subprogram types that mention the incomplete type in their
626 -- profiles, and subprogram with access parameters that designate the
629 -- Inc_T is the defining identifier of an incomplete type declaration, its
630 -- Ekind is E_Incomplete_Type.
632 -- N is the corresponding N_Full_Type_Declaration for Inc_T.
634 -- Full_T is N's defining identifier.
636 -- Subtypes of incomplete types with discriminants are completed when the
637 -- parent type is. This is simpler than private subtypes, because they can
638 -- only appear in the same scope, and there is no need to exchange views.
639 -- Similarly, access_to_subprogram types may have a parameter or a return
640 -- type that is an incomplete type, and that must be replaced with the
643 -- If the full type is tagged, subprogram with access parameters that
644 -- designated the incomplete may be primitive operations of the full type,
645 -- and have to be processed accordingly.
647 procedure Process_Real_Range_Specification
(Def
: Node_Id
);
648 -- Given the type definition for a real type, this procedure processes and
649 -- checks the real range specification of this type definition if one is
650 -- present. If errors are found, error messages are posted, and the
651 -- Real_Range_Specification of Def is reset to Empty.
653 procedure Record_Type_Declaration
657 -- Process a record type declaration (for both untagged and tagged
658 -- records). Parameters T and N are exactly like in procedure
659 -- Derived_Type_Declaration, except that no flag Is_Completion is needed
660 -- for this routine. If this is the completion of an incomplete type
661 -- declaration, Prev is the entity of the incomplete declaration, used for
662 -- cross-referencing. Otherwise Prev = T.
664 procedure Record_Type_Definition
(Def
: Node_Id
; Prev_T
: Entity_Id
);
665 -- This routine is used to process the actual record type definition (both
666 -- for untagged and tagged records). Def is a record type definition node.
667 -- This procedure analyzes the components in this record type definition.
668 -- Prev_T is the entity for the enclosing record type. It is provided so
669 -- that its Has_Task flag can be set if any of the component have Has_Task
670 -- set. If the declaration is the completion of an incomplete type
671 -- declaration, Prev_T is the original incomplete type, whose full view is
674 procedure Replace_Components
(Typ
: Entity_Id
; Decl
: Node_Id
);
675 -- Subsidiary to Build_Derived_Record_Type. For untagged records, we
676 -- build a copy of the declaration tree of the parent, and we create
677 -- independently the list of components for the derived type. Semantic
678 -- information uses the component entities, but record representation
679 -- clauses are validated on the declaration tree. This procedure replaces
680 -- discriminants and components in the declaration with those that have
681 -- been created by Inherit_Components.
683 procedure Set_Fixed_Range
688 -- Build a range node with the given bounds and set it as the Scalar_Range
689 -- of the given fixed-point type entity. Loc is the source location used
690 -- for the constructed range. See body for further details.
692 procedure Set_Scalar_Range_For_Subtype
696 -- This routine is used to set the scalar range field for a subtype given
697 -- Def_Id, the entity for the subtype, and R, the range expression for the
698 -- scalar range. Subt provides the parent subtype to be used to analyze,
699 -- resolve, and check the given range.
701 procedure Set_Default_SSO
(T
: Entity_Id
);
702 -- T is the entity for an array or record being declared. This procedure
703 -- sets the flags SSO_Set_Low_By_Default/SSO_Set_High_By_Default according
704 -- to the setting of Opt.Default_SSO.
706 procedure Signed_Integer_Type_Declaration
(T
: Entity_Id
; Def
: Node_Id
);
707 -- Create a new signed integer entity, and apply the constraint to obtain
708 -- the required first named subtype of this type.
710 procedure Set_Stored_Constraint_From_Discriminant_Constraint
712 -- E is some record type. This routine computes E's Stored_Constraint
713 -- from its Discriminant_Constraint.
715 procedure Diagnose_Interface
(N
: Node_Id
; E
: Entity_Id
);
716 -- Check that an entity in a list of progenitors is an interface,
717 -- emit error otherwise.
719 -----------------------
720 -- Access_Definition --
721 -----------------------
723 function Access_Definition
724 (Related_Nod
: Node_Id
;
725 N
: Node_Id
) return Entity_Id
727 Anon_Type
: Entity_Id
;
728 Anon_Scope
: Entity_Id
;
729 Desig_Type
: Entity_Id
;
730 Enclosing_Prot_Type
: Entity_Id
:= Empty
;
733 Check_SPARK_05_Restriction
("access type is not allowed", N
);
735 if Is_Entry
(Current_Scope
)
736 and then Is_Task_Type
(Etype
(Scope
(Current_Scope
)))
738 Error_Msg_N
("task entries cannot have access parameters", N
);
742 -- Ada 2005: For an object declaration the corresponding anonymous
743 -- type is declared in the current scope.
745 -- If the access definition is the return type of another access to
746 -- function, scope is the current one, because it is the one of the
747 -- current type declaration, except for the pathological case below.
749 if Nkind_In
(Related_Nod
, N_Object_Declaration
,
750 N_Access_Function_Definition
)
752 Anon_Scope
:= Current_Scope
;
754 -- A pathological case: function returning access functions that
755 -- return access functions, etc. Each anonymous access type created
756 -- is in the enclosing scope of the outermost function.
763 while Nkind_In
(Par
, N_Access_Function_Definition
,
769 if Nkind
(Par
) = N_Function_Specification
then
770 Anon_Scope
:= Scope
(Defining_Entity
(Par
));
774 -- For the anonymous function result case, retrieve the scope of the
775 -- function specification's associated entity rather than using the
776 -- current scope. The current scope will be the function itself if the
777 -- formal part is currently being analyzed, but will be the parent scope
778 -- in the case of a parameterless function, and we always want to use
779 -- the function's parent scope. Finally, if the function is a child
780 -- unit, we must traverse the tree to retrieve the proper entity.
782 elsif Nkind
(Related_Nod
) = N_Function_Specification
783 and then Nkind
(Parent
(N
)) /= N_Parameter_Specification
785 -- If the current scope is a protected type, the anonymous access
786 -- is associated with one of the protected operations, and must
787 -- be available in the scope that encloses the protected declaration.
788 -- Otherwise the type is in the scope enclosing the subprogram.
790 -- If the function has formals, The return type of a subprogram
791 -- declaration is analyzed in the scope of the subprogram (see
792 -- Process_Formals) and thus the protected type, if present, is
793 -- the scope of the current function scope.
795 if Ekind
(Current_Scope
) = E_Protected_Type
then
796 Enclosing_Prot_Type
:= Current_Scope
;
798 elsif Ekind
(Current_Scope
) = E_Function
799 and then Ekind
(Scope
(Current_Scope
)) = E_Protected_Type
801 Enclosing_Prot_Type
:= Scope
(Current_Scope
);
804 if Present
(Enclosing_Prot_Type
) then
805 Anon_Scope
:= Scope
(Enclosing_Prot_Type
);
808 Anon_Scope
:= Scope
(Defining_Entity
(Related_Nod
));
811 -- For an access type definition, if the current scope is a child
812 -- unit it is the scope of the type.
814 elsif Is_Compilation_Unit
(Current_Scope
) then
815 Anon_Scope
:= Current_Scope
;
817 -- For access formals, access components, and access discriminants, the
818 -- scope is that of the enclosing declaration,
821 Anon_Scope
:= Scope
(Current_Scope
);
826 (E_Anonymous_Access_Type
, Related_Nod
, Scope_Id
=> Anon_Scope
);
829 and then Ada_Version
>= Ada_2005
831 Error_Msg_N
("ALL is not permitted for anonymous access types", N
);
834 -- Ada 2005 (AI-254): In case of anonymous access to subprograms call
835 -- the corresponding semantic routine
837 if Present
(Access_To_Subprogram_Definition
(N
)) then
839 -- Compiler runtime units are compiled in Ada 2005 mode when building
840 -- the runtime library but must also be compilable in Ada 95 mode
841 -- (when bootstrapping the compiler).
843 Check_Compiler_Unit
("anonymous access to subprogram", N
);
845 Access_Subprogram_Declaration
846 (T_Name
=> Anon_Type
,
847 T_Def
=> Access_To_Subprogram_Definition
(N
));
849 if Ekind
(Anon_Type
) = E_Access_Protected_Subprogram_Type
then
851 (Anon_Type
, E_Anonymous_Access_Protected_Subprogram_Type
);
853 Set_Ekind
(Anon_Type
, E_Anonymous_Access_Subprogram_Type
);
856 Set_Can_Use_Internal_Rep
857 (Anon_Type
, not Always_Compatible_Rep_On_Target
);
859 -- If the anonymous access is associated with a protected operation,
860 -- create a reference to it after the enclosing protected definition
861 -- because the itype will be used in the subsequent bodies.
863 -- If the anonymous access itself is protected, a full type
864 -- declaratiton will be created for it, so that the equivalent
865 -- record type can be constructed. For further details, see
866 -- Replace_Anonymous_Access_To_Protected-Subprogram.
868 if Ekind
(Current_Scope
) = E_Protected_Type
869 and then not Protected_Present
(Access_To_Subprogram_Definition
(N
))
871 Build_Itype_Reference
(Anon_Type
, Parent
(Current_Scope
));
877 Find_Type
(Subtype_Mark
(N
));
878 Desig_Type
:= Entity
(Subtype_Mark
(N
));
880 Set_Directly_Designated_Type
(Anon_Type
, Desig_Type
);
881 Set_Etype
(Anon_Type
, Anon_Type
);
883 -- Make sure the anonymous access type has size and alignment fields
884 -- set, as required by gigi. This is necessary in the case of the
885 -- Task_Body_Procedure.
887 if not Has_Private_Component
(Desig_Type
) then
888 Layout_Type
(Anon_Type
);
891 -- Ada 2005 (AI-231): Ada 2005 semantics for anonymous access differs
892 -- from Ada 95 semantics. In Ada 2005, anonymous access must specify if
893 -- the null value is allowed. In Ada 95 the null value is never allowed.
895 if Ada_Version
>= Ada_2005
then
896 Set_Can_Never_Be_Null
(Anon_Type
, Null_Exclusion_Present
(N
));
898 Set_Can_Never_Be_Null
(Anon_Type
, True);
901 -- The anonymous access type is as public as the discriminated type or
902 -- subprogram that defines it. It is imported (for back-end purposes)
903 -- if the designated type is.
905 Set_Is_Public
(Anon_Type
, Is_Public
(Scope
(Anon_Type
)));
907 -- Ada 2005 (AI-231): Propagate the access-constant attribute
909 Set_Is_Access_Constant
(Anon_Type
, Constant_Present
(N
));
911 -- The context is either a subprogram declaration, object declaration,
912 -- or an access discriminant, in a private or a full type declaration.
913 -- In the case of a subprogram, if the designated type is incomplete,
914 -- the operation will be a primitive operation of the full type, to be
915 -- updated subsequently. If the type is imported through a limited_with
916 -- clause, the subprogram is not a primitive operation of the type
917 -- (which is declared elsewhere in some other scope).
919 if Ekind
(Desig_Type
) = E_Incomplete_Type
920 and then not From_Limited_With
(Desig_Type
)
921 and then Is_Overloadable
(Current_Scope
)
923 Append_Elmt
(Current_Scope
, Private_Dependents
(Desig_Type
));
924 Set_Has_Delayed_Freeze
(Current_Scope
);
927 -- Ada 2005: If the designated type is an interface that may contain
928 -- tasks, create a Master entity for the declaration. This must be done
929 -- before expansion of the full declaration, because the declaration may
930 -- include an expression that is an allocator, whose expansion needs the
931 -- proper Master for the created tasks.
933 if Nkind
(Related_Nod
) = N_Object_Declaration
and then Expander_Active
935 if Is_Interface
(Desig_Type
) and then Is_Limited_Record
(Desig_Type
)
937 Build_Class_Wide_Master
(Anon_Type
);
939 -- Similarly, if the type is an anonymous access that designates
940 -- tasks, create a master entity for it in the current context.
942 elsif Has_Task
(Desig_Type
) and then Comes_From_Source
(Related_Nod
)
944 Build_Master_Entity
(Defining_Identifier
(Related_Nod
));
945 Build_Master_Renaming
(Anon_Type
);
949 -- For a private component of a protected type, it is imperative that
950 -- the back-end elaborate the type immediately after the protected
951 -- declaration, because this type will be used in the declarations
952 -- created for the component within each protected body, so we must
953 -- create an itype reference for it now.
955 if Nkind
(Parent
(Related_Nod
)) = N_Protected_Definition
then
956 Build_Itype_Reference
(Anon_Type
, Parent
(Parent
(Related_Nod
)));
958 -- Similarly, if the access definition is the return result of a
959 -- function, create an itype reference for it because it will be used
960 -- within the function body. For a regular function that is not a
961 -- compilation unit, insert reference after the declaration. For a
962 -- protected operation, insert it after the enclosing protected type
963 -- declaration. In either case, do not create a reference for a type
964 -- obtained through a limited_with clause, because this would introduce
965 -- semantic dependencies.
967 -- Similarly, do not create a reference if the designated type is a
968 -- generic formal, because no use of it will reach the backend.
970 elsif Nkind
(Related_Nod
) = N_Function_Specification
971 and then not From_Limited_With
(Desig_Type
)
972 and then not Is_Generic_Type
(Desig_Type
)
974 if Present
(Enclosing_Prot_Type
) then
975 Build_Itype_Reference
(Anon_Type
, Parent
(Enclosing_Prot_Type
));
977 elsif Is_List_Member
(Parent
(Related_Nod
))
978 and then Nkind
(Parent
(N
)) /= N_Parameter_Specification
980 Build_Itype_Reference
(Anon_Type
, Parent
(Related_Nod
));
983 -- Finally, create an itype reference for an object declaration of an
984 -- anonymous access type. This is strictly necessary only for deferred
985 -- constants, but in any case will avoid out-of-scope problems in the
988 elsif Nkind
(Related_Nod
) = N_Object_Declaration
then
989 Build_Itype_Reference
(Anon_Type
, Related_Nod
);
993 end Access_Definition
;
995 -----------------------------------
996 -- Access_Subprogram_Declaration --
997 -----------------------------------
999 procedure Access_Subprogram_Declaration
1000 (T_Name
: Entity_Id
;
1003 procedure Check_For_Premature_Usage
(Def
: Node_Id
);
1004 -- Check that type T_Name is not used, directly or recursively, as a
1005 -- parameter or a return type in Def. Def is either a subtype, an
1006 -- access_definition, or an access_to_subprogram_definition.
1008 -------------------------------
1009 -- Check_For_Premature_Usage --
1010 -------------------------------
1012 procedure Check_For_Premature_Usage
(Def
: Node_Id
) is
1016 -- Check for a subtype mark
1018 if Nkind
(Def
) in N_Has_Etype
then
1019 if Etype
(Def
) = T_Name
then
1021 ("type& cannot be used before end of its declaration", Def
);
1024 -- If this is not a subtype, then this is an access_definition
1026 elsif Nkind
(Def
) = N_Access_Definition
then
1027 if Present
(Access_To_Subprogram_Definition
(Def
)) then
1028 Check_For_Premature_Usage
1029 (Access_To_Subprogram_Definition
(Def
));
1031 Check_For_Premature_Usage
(Subtype_Mark
(Def
));
1034 -- The only cases left are N_Access_Function_Definition and
1035 -- N_Access_Procedure_Definition.
1038 if Present
(Parameter_Specifications
(Def
)) then
1039 Param
:= First
(Parameter_Specifications
(Def
));
1040 while Present
(Param
) loop
1041 Check_For_Premature_Usage
(Parameter_Type
(Param
));
1042 Param
:= Next
(Param
);
1046 if Nkind
(Def
) = N_Access_Function_Definition
then
1047 Check_For_Premature_Usage
(Result_Definition
(Def
));
1050 end Check_For_Premature_Usage
;
1054 Formals
: constant List_Id
:= Parameter_Specifications
(T_Def
);
1057 Desig_Type
: constant Entity_Id
:=
1058 Create_Itype
(E_Subprogram_Type
, Parent
(T_Def
));
1060 -- Start of processing for Access_Subprogram_Declaration
1063 Check_SPARK_05_Restriction
("access type is not allowed", T_Def
);
1065 -- Associate the Itype node with the inner full-type declaration or
1066 -- subprogram spec or entry body. This is required to handle nested
1067 -- anonymous declarations. For example:
1070 -- (X : access procedure
1071 -- (Y : access procedure
1074 D_Ityp
:= Associated_Node_For_Itype
(Desig_Type
);
1075 while not (Nkind_In
(D_Ityp
, N_Full_Type_Declaration
,
1076 N_Private_Type_Declaration
,
1077 N_Private_Extension_Declaration
,
1078 N_Procedure_Specification
,
1079 N_Function_Specification
,
1083 Nkind_In
(D_Ityp
, N_Object_Declaration
,
1084 N_Object_Renaming_Declaration
,
1085 N_Formal_Object_Declaration
,
1086 N_Formal_Type_Declaration
,
1087 N_Task_Type_Declaration
,
1088 N_Protected_Type_Declaration
))
1090 D_Ityp
:= Parent
(D_Ityp
);
1091 pragma Assert
(D_Ityp
/= Empty
);
1094 Set_Associated_Node_For_Itype
(Desig_Type
, D_Ityp
);
1096 if Nkind_In
(D_Ityp
, N_Procedure_Specification
,
1097 N_Function_Specification
)
1099 Set_Scope
(Desig_Type
, Scope
(Defining_Entity
(D_Ityp
)));
1101 elsif Nkind_In
(D_Ityp
, N_Full_Type_Declaration
,
1102 N_Object_Declaration
,
1103 N_Object_Renaming_Declaration
,
1104 N_Formal_Type_Declaration
)
1106 Set_Scope
(Desig_Type
, Scope
(Defining_Identifier
(D_Ityp
)));
1109 if Nkind
(T_Def
) = N_Access_Function_Definition
then
1110 if Nkind
(Result_Definition
(T_Def
)) = N_Access_Definition
then
1112 Acc
: constant Node_Id
:= Result_Definition
(T_Def
);
1115 if Present
(Access_To_Subprogram_Definition
(Acc
))
1117 Protected_Present
(Access_To_Subprogram_Definition
(Acc
))
1121 Replace_Anonymous_Access_To_Protected_Subprogram
1127 Access_Definition
(T_Def
, Result_Definition
(T_Def
)));
1132 Analyze
(Result_Definition
(T_Def
));
1135 Typ
: constant Entity_Id
:= Entity
(Result_Definition
(T_Def
));
1138 -- If a null exclusion is imposed on the result type, then
1139 -- create a null-excluding itype (an access subtype) and use
1140 -- it as the function's Etype.
1142 if Is_Access_Type
(Typ
)
1143 and then Null_Exclusion_In_Return_Present
(T_Def
)
1145 Set_Etype
(Desig_Type
,
1146 Create_Null_Excluding_Itype
1148 Related_Nod
=> T_Def
,
1149 Scope_Id
=> Current_Scope
));
1152 if From_Limited_With
(Typ
) then
1154 -- AI05-151: Incomplete types are allowed in all basic
1155 -- declarations, including access to subprograms.
1157 if Ada_Version
>= Ada_2012
then
1162 ("illegal use of incomplete type&",
1163 Result_Definition
(T_Def
), Typ
);
1166 elsif Ekind
(Current_Scope
) = E_Package
1167 and then In_Private_Part
(Current_Scope
)
1169 if Ekind
(Typ
) = E_Incomplete_Type
then
1170 Append_Elmt
(Desig_Type
, Private_Dependents
(Typ
));
1172 elsif Is_Class_Wide_Type
(Typ
)
1173 and then Ekind
(Etype
(Typ
)) = E_Incomplete_Type
1176 (Desig_Type
, Private_Dependents
(Etype
(Typ
)));
1180 Set_Etype
(Desig_Type
, Typ
);
1185 if not (Is_Type
(Etype
(Desig_Type
))) then
1187 ("expect type in function specification",
1188 Result_Definition
(T_Def
));
1192 Set_Etype
(Desig_Type
, Standard_Void_Type
);
1195 if Present
(Formals
) then
1196 Push_Scope
(Desig_Type
);
1198 -- Some special tests here. These special tests can be removed
1199 -- if and when Itypes always have proper parent pointers to their
1202 -- Special test 1) Link defining_identifier of formals. Required by
1203 -- First_Formal to provide its functionality.
1209 F
:= First
(Formals
);
1211 -- In ASIS mode, the access_to_subprogram may be analyzed twice,
1212 -- when it is part of an unconstrained type and subtype expansion
1213 -- is disabled. To avoid back-end problems with shared profiles,
1214 -- use previous subprogram type as the designated type, and then
1215 -- remove scope added above.
1217 if ASIS_Mode
and then Present
(Scope
(Defining_Identifier
(F
)))
1219 Set_Etype
(T_Name
, T_Name
);
1220 Init_Size_Align
(T_Name
);
1221 Set_Directly_Designated_Type
(T_Name
,
1222 Scope
(Defining_Identifier
(F
)));
1227 while Present
(F
) loop
1228 if No
(Parent
(Defining_Identifier
(F
))) then
1229 Set_Parent
(Defining_Identifier
(F
), F
);
1236 Process_Formals
(Formals
, Parent
(T_Def
));
1238 -- Special test 2) End_Scope requires that the parent pointer be set
1239 -- to something reasonable, but Itypes don't have parent pointers. So
1240 -- we set it and then unset it ???
1242 Set_Parent
(Desig_Type
, T_Name
);
1244 Set_Parent
(Desig_Type
, Empty
);
1247 -- Check for premature usage of the type being defined
1249 Check_For_Premature_Usage
(T_Def
);
1251 -- The return type and/or any parameter type may be incomplete. Mark the
1252 -- subprogram_type as depending on the incomplete type, so that it can
1253 -- be updated when the full type declaration is seen. This only applies
1254 -- to incomplete types declared in some enclosing scope, not to limited
1255 -- views from other packages.
1257 -- Prior to Ada 2012, access to functions can only have in_parameters.
1259 if Present
(Formals
) then
1260 Formal
:= First_Formal
(Desig_Type
);
1261 while Present
(Formal
) loop
1262 if Ekind
(Formal
) /= E_In_Parameter
1263 and then Nkind
(T_Def
) = N_Access_Function_Definition
1264 and then Ada_Version
< Ada_2012
1266 Error_Msg_N
("functions can only have IN parameters", Formal
);
1269 if Ekind
(Etype
(Formal
)) = E_Incomplete_Type
1270 and then In_Open_Scopes
(Scope
(Etype
(Formal
)))
1272 Append_Elmt
(Desig_Type
, Private_Dependents
(Etype
(Formal
)));
1273 Set_Has_Delayed_Freeze
(Desig_Type
);
1276 Next_Formal
(Formal
);
1280 -- Check whether an indirect call without actuals may be possible. This
1281 -- is used when resolving calls whose result is then indexed.
1283 May_Need_Actuals
(Desig_Type
);
1285 -- If the return type is incomplete, this is legal as long as the type
1286 -- is declared in the current scope and will be completed in it (rather
1287 -- than being part of limited view).
1289 if Ekind
(Etype
(Desig_Type
)) = E_Incomplete_Type
1290 and then not Has_Delayed_Freeze
(Desig_Type
)
1291 and then In_Open_Scopes
(Scope
(Etype
(Desig_Type
)))
1293 Append_Elmt
(Desig_Type
, Private_Dependents
(Etype
(Desig_Type
)));
1294 Set_Has_Delayed_Freeze
(Desig_Type
);
1297 Check_Delayed_Subprogram
(Desig_Type
);
1299 if Protected_Present
(T_Def
) then
1300 Set_Ekind
(T_Name
, E_Access_Protected_Subprogram_Type
);
1301 Set_Convention
(Desig_Type
, Convention_Protected
);
1303 Set_Ekind
(T_Name
, E_Access_Subprogram_Type
);
1306 Set_Can_Use_Internal_Rep
(T_Name
,
1307 not Always_Compatible_Rep_On_Target
);
1308 Set_Etype
(T_Name
, T_Name
);
1309 Init_Size_Align
(T_Name
);
1310 Set_Directly_Designated_Type
(T_Name
, Desig_Type
);
1312 -- If the access_to_subprogram is not declared at the library level,
1313 -- it can only point to subprograms that are at the same or deeper
1314 -- accessibility level. The corresponding subprogram type might
1315 -- require an activation record when compiling for C.
1317 Set_Needs_Activation_Record
(Desig_Type
,
1318 not Is_Library_Level_Entity
(T_Name
));
1320 Generate_Reference_To_Formals
(T_Name
);
1322 -- Ada 2005 (AI-231): Propagate the null-excluding attribute
1324 Set_Can_Never_Be_Null
(T_Name
, Null_Exclusion_Present
(T_Def
));
1326 Check_Restriction
(No_Access_Subprograms
, T_Def
);
1327 end Access_Subprogram_Declaration
;
1329 ----------------------------
1330 -- Access_Type_Declaration --
1331 ----------------------------
1333 procedure Access_Type_Declaration
(T
: Entity_Id
; Def
: Node_Id
) is
1334 P
: constant Node_Id
:= Parent
(Def
);
1335 S
: constant Node_Id
:= Subtype_Indication
(Def
);
1337 Full_Desig
: Entity_Id
;
1340 Check_SPARK_05_Restriction
("access type is not allowed", Def
);
1342 -- Check for permissible use of incomplete type
1344 if Nkind
(S
) /= N_Subtype_Indication
then
1347 if Present
(Entity
(S
))
1348 and then Ekind
(Root_Type
(Entity
(S
))) = E_Incomplete_Type
1350 Set_Directly_Designated_Type
(T
, Entity
(S
));
1352 -- If the designated type is a limited view, we cannot tell if
1353 -- the full view contains tasks, and there is no way to handle
1354 -- that full view in a client. We create a master entity for the
1355 -- scope, which will be used when a client determines that one
1358 if From_Limited_With
(Entity
(S
))
1359 and then not Is_Class_Wide_Type
(Entity
(S
))
1361 Set_Ekind
(T
, E_Access_Type
);
1362 Build_Master_Entity
(T
);
1363 Build_Master_Renaming
(T
);
1367 Set_Directly_Designated_Type
(T
, Process_Subtype
(S
, P
, T
, 'P'));
1370 -- If the access definition is of the form: ACCESS NOT NULL ..
1371 -- the subtype indication must be of an access type. Create
1372 -- a null-excluding subtype of it.
1374 if Null_Excluding_Subtype
(Def
) then
1375 if not Is_Access_Type
(Entity
(S
)) then
1376 Error_Msg_N
("null exclusion must apply to access type", Def
);
1380 Loc
: constant Source_Ptr
:= Sloc
(S
);
1382 Nam
: constant Entity_Id
:= Make_Temporary
(Loc
, 'S');
1386 Make_Subtype_Declaration
(Loc
,
1387 Defining_Identifier
=> Nam
,
1388 Subtype_Indication
=>
1389 New_Occurrence_Of
(Entity
(S
), Loc
));
1390 Set_Null_Exclusion_Present
(Decl
);
1391 Insert_Before
(Parent
(Def
), Decl
);
1393 Set_Entity
(S
, Nam
);
1399 Set_Directly_Designated_Type
(T
,
1400 Process_Subtype
(S
, P
, T
, 'P'));
1403 if All_Present
(Def
) or Constant_Present
(Def
) then
1404 Set_Ekind
(T
, E_General_Access_Type
);
1406 Set_Ekind
(T
, E_Access_Type
);
1409 Full_Desig
:= Designated_Type
(T
);
1411 if Base_Type
(Full_Desig
) = T
then
1412 Error_Msg_N
("access type cannot designate itself", S
);
1414 -- In Ada 2005, the type may have a limited view through some unit in
1415 -- its own context, allowing the following circularity that cannot be
1416 -- detected earlier.
1418 elsif Is_Class_Wide_Type
(Full_Desig
) and then Etype
(Full_Desig
) = T
1421 ("access type cannot designate its own class-wide type", S
);
1423 -- Clean up indication of tagged status to prevent cascaded errors
1425 Set_Is_Tagged_Type
(T
, False);
1430 -- If the type has appeared already in a with_type clause, it is frozen
1431 -- and the pointer size is already set. Else, initialize.
1433 if not From_Limited_With
(T
) then
1434 Init_Size_Align
(T
);
1437 -- Note that Has_Task is always false, since the access type itself
1438 -- is not a task type. See Einfo for more description on this point.
1439 -- Exactly the same consideration applies to Has_Controlled_Component
1440 -- and to Has_Protected.
1442 Set_Has_Task
(T
, False);
1443 Set_Has_Protected
(T
, False);
1444 Set_Has_Timing_Event
(T
, False);
1445 Set_Has_Controlled_Component
(T
, False);
1447 -- Initialize field Finalization_Master explicitly to Empty, to avoid
1448 -- problems where an incomplete view of this entity has been previously
1449 -- established by a limited with and an overlaid version of this field
1450 -- (Stored_Constraint) was initialized for the incomplete view.
1452 -- This reset is performed in most cases except where the access type
1453 -- has been created for the purposes of allocating or deallocating a
1454 -- build-in-place object. Such access types have explicitly set pools
1455 -- and finalization masters.
1457 if No
(Associated_Storage_Pool
(T
)) then
1458 Set_Finalization_Master
(T
, Empty
);
1461 -- Ada 2005 (AI-231): Propagate the null-excluding and access-constant
1464 Set_Can_Never_Be_Null
(T
, Null_Exclusion_Present
(Def
));
1465 Set_Is_Access_Constant
(T
, Constant_Present
(Def
));
1466 end Access_Type_Declaration
;
1468 ----------------------------------
1469 -- Add_Interface_Tag_Components --
1470 ----------------------------------
1472 procedure Add_Interface_Tag_Components
(N
: Node_Id
; Typ
: Entity_Id
) is
1473 Loc
: constant Source_Ptr
:= Sloc
(N
);
1477 procedure Add_Tag
(Iface
: Entity_Id
);
1478 -- Add tag for one of the progenitor interfaces
1484 procedure Add_Tag
(Iface
: Entity_Id
) is
1491 pragma Assert
(Is_Tagged_Type
(Iface
) and then Is_Interface
(Iface
));
1493 -- This is a reasonable place to propagate predicates
1495 if Has_Predicates
(Iface
) then
1496 Set_Has_Predicates
(Typ
);
1500 Make_Component_Definition
(Loc
,
1501 Aliased_Present
=> True,
1502 Subtype_Indication
=>
1503 New_Occurrence_Of
(RTE
(RE_Interface_Tag
), Loc
));
1505 Tag
:= Make_Temporary
(Loc
, 'V');
1508 Make_Component_Declaration
(Loc
,
1509 Defining_Identifier
=> Tag
,
1510 Component_Definition
=> Def
);
1512 Analyze_Component_Declaration
(Decl
);
1514 Set_Analyzed
(Decl
);
1515 Set_Ekind
(Tag
, E_Component
);
1517 Set_Is_Aliased
(Tag
);
1518 Set_Related_Type
(Tag
, Iface
);
1519 Init_Component_Location
(Tag
);
1521 pragma Assert
(Is_Frozen
(Iface
));
1523 Set_DT_Entry_Count
(Tag
,
1524 DT_Entry_Count
(First_Entity
(Iface
)));
1526 if No
(Last_Tag
) then
1529 Insert_After
(Last_Tag
, Decl
);
1534 -- If the ancestor has discriminants we need to give special support
1535 -- to store the offset_to_top value of the secondary dispatch tables.
1536 -- For this purpose we add a supplementary component just after the
1537 -- field that contains the tag associated with each secondary DT.
1539 if Typ
/= Etype
(Typ
) and then Has_Discriminants
(Etype
(Typ
)) then
1541 Make_Component_Definition
(Loc
,
1542 Subtype_Indication
=>
1543 New_Occurrence_Of
(RTE
(RE_Storage_Offset
), Loc
));
1545 Offset
:= Make_Temporary
(Loc
, 'V');
1548 Make_Component_Declaration
(Loc
,
1549 Defining_Identifier
=> Offset
,
1550 Component_Definition
=> Def
);
1552 Analyze_Component_Declaration
(Decl
);
1554 Set_Analyzed
(Decl
);
1555 Set_Ekind
(Offset
, E_Component
);
1556 Set_Is_Aliased
(Offset
);
1557 Set_Related_Type
(Offset
, Iface
);
1558 Init_Component_Location
(Offset
);
1559 Insert_After
(Last_Tag
, Decl
);
1570 -- Start of processing for Add_Interface_Tag_Components
1573 if not RTE_Available
(RE_Interface_Tag
) then
1575 ("(Ada 2005) interface types not supported by this run-time!",
1580 if Ekind
(Typ
) /= E_Record_Type
1581 or else (Is_Concurrent_Record_Type
(Typ
)
1582 and then Is_Empty_List
(Abstract_Interface_List
(Typ
)))
1583 or else (not Is_Concurrent_Record_Type
(Typ
)
1584 and then No
(Interfaces
(Typ
))
1585 and then Is_Empty_Elmt_List
(Interfaces
(Typ
)))
1590 -- Find the current last tag
1592 if Nkind
(Type_Definition
(N
)) = N_Derived_Type_Definition
then
1593 Ext
:= Record_Extension_Part
(Type_Definition
(N
));
1595 pragma Assert
(Nkind
(Type_Definition
(N
)) = N_Record_Definition
);
1596 Ext
:= Type_Definition
(N
);
1601 if not (Present
(Component_List
(Ext
))) then
1602 Set_Null_Present
(Ext
, False);
1604 Set_Component_List
(Ext
,
1605 Make_Component_List
(Loc
,
1606 Component_Items
=> L
,
1607 Null_Present
=> False));
1609 if Nkind
(Type_Definition
(N
)) = N_Derived_Type_Definition
then
1610 L
:= Component_Items
1612 (Record_Extension_Part
1613 (Type_Definition
(N
))));
1615 L
:= Component_Items
1617 (Type_Definition
(N
)));
1620 -- Find the last tag component
1623 while Present
(Comp
) loop
1624 if Nkind
(Comp
) = N_Component_Declaration
1625 and then Is_Tag
(Defining_Identifier
(Comp
))
1634 -- At this point L references the list of components and Last_Tag
1635 -- references the current last tag (if any). Now we add the tag
1636 -- corresponding with all the interfaces that are not implemented
1639 if Present
(Interfaces
(Typ
)) then
1640 Elmt
:= First_Elmt
(Interfaces
(Typ
));
1641 while Present
(Elmt
) loop
1642 Add_Tag
(Node
(Elmt
));
1646 end Add_Interface_Tag_Components
;
1648 -------------------------------------
1649 -- Add_Internal_Interface_Entities --
1650 -------------------------------------
1652 procedure Add_Internal_Interface_Entities
(Tagged_Type
: Entity_Id
) is
1655 Iface_Elmt
: Elmt_Id
;
1656 Iface_Prim
: Entity_Id
;
1657 Ifaces_List
: Elist_Id
;
1658 New_Subp
: Entity_Id
:= Empty
;
1660 Restore_Scope
: Boolean := False;
1663 pragma Assert
(Ada_Version
>= Ada_2005
1664 and then Is_Record_Type
(Tagged_Type
)
1665 and then Is_Tagged_Type
(Tagged_Type
)
1666 and then Has_Interfaces
(Tagged_Type
)
1667 and then not Is_Interface
(Tagged_Type
));
1669 -- Ensure that the internal entities are added to the scope of the type
1671 if Scope
(Tagged_Type
) /= Current_Scope
then
1672 Push_Scope
(Scope
(Tagged_Type
));
1673 Restore_Scope
:= True;
1676 Collect_Interfaces
(Tagged_Type
, Ifaces_List
);
1678 Iface_Elmt
:= First_Elmt
(Ifaces_List
);
1679 while Present
(Iface_Elmt
) loop
1680 Iface
:= Node
(Iface_Elmt
);
1682 -- Originally we excluded here from this processing interfaces that
1683 -- are parents of Tagged_Type because their primitives are located
1684 -- in the primary dispatch table (and hence no auxiliary internal
1685 -- entities are required to handle secondary dispatch tables in such
1686 -- case). However, these auxiliary entities are also required to
1687 -- handle derivations of interfaces in formals of generics (see
1688 -- Derive_Subprograms).
1690 Elmt
:= First_Elmt
(Primitive_Operations
(Iface
));
1691 while Present
(Elmt
) loop
1692 Iface_Prim
:= Node
(Elmt
);
1694 if not Is_Predefined_Dispatching_Operation
(Iface_Prim
) then
1696 Find_Primitive_Covering_Interface
1697 (Tagged_Type
=> Tagged_Type
,
1698 Iface_Prim
=> Iface_Prim
);
1700 if No
(Prim
) and then Serious_Errors_Detected
> 0 then
1704 pragma Assert
(Present
(Prim
));
1706 -- Ada 2012 (AI05-0197): If the name of the covering primitive
1707 -- differs from the name of the interface primitive then it is
1708 -- a private primitive inherited from a parent type. In such
1709 -- case, given that Tagged_Type covers the interface, the
1710 -- inherited private primitive becomes visible. For such
1711 -- purpose we add a new entity that renames the inherited
1712 -- private primitive.
1714 if Chars
(Prim
) /= Chars
(Iface_Prim
) then
1715 pragma Assert
(Has_Suffix
(Prim
, 'P'));
1717 (New_Subp
=> New_Subp
,
1718 Parent_Subp
=> Iface_Prim
,
1719 Derived_Type
=> Tagged_Type
,
1720 Parent_Type
=> Iface
);
1721 Set_Alias
(New_Subp
, Prim
);
1722 Set_Is_Abstract_Subprogram
1723 (New_Subp
, Is_Abstract_Subprogram
(Prim
));
1727 (New_Subp
=> New_Subp
,
1728 Parent_Subp
=> Iface_Prim
,
1729 Derived_Type
=> Tagged_Type
,
1730 Parent_Type
=> Iface
);
1735 if Is_Inherited_Operation
(Prim
)
1736 and then Present
(Alias
(Prim
))
1738 Anc
:= Alias
(Prim
);
1740 Anc
:= Overridden_Operation
(Prim
);
1743 -- Apply legality checks in RM 6.1.1 (10-13) concerning
1744 -- nonconforming preconditions in both an ancestor and
1745 -- a progenitor operation.
1747 -- If the operation is a primitive wrapper it is an explicit
1748 -- (overriding) operqtion and all is fine.
1751 and then Has_Non_Trivial_Precondition
(Anc
)
1752 and then Has_Non_Trivial_Precondition
(Iface_Prim
)
1754 if Is_Abstract_Subprogram
(Prim
)
1756 (Ekind
(Prim
) = E_Procedure
1757 and then Nkind
(Parent
(Prim
)) =
1758 N_Procedure_Specification
1759 and then Null_Present
(Parent
(Prim
)))
1760 or else Is_Primitive_Wrapper
(Prim
)
1764 -- The operation is inherited and must be overridden
1766 elsif not Comes_From_Source
(Prim
) then
1768 ("&inherits non-conforming preconditions and must "
1769 & "be overridden (RM 6.1.1 (10-16)",
1770 Parent
(Tagged_Type
), Prim
);
1775 -- Ada 2005 (AI-251): Decorate internal entity Iface_Subp
1776 -- associated with interface types. These entities are
1777 -- only registered in the list of primitives of its
1778 -- corresponding tagged type because they are only used
1779 -- to fill the contents of the secondary dispatch tables.
1780 -- Therefore they are removed from the homonym chains.
1782 Set_Is_Hidden
(New_Subp
);
1783 Set_Is_Internal
(New_Subp
);
1784 Set_Alias
(New_Subp
, Prim
);
1785 Set_Is_Abstract_Subprogram
1786 (New_Subp
, Is_Abstract_Subprogram
(Prim
));
1787 Set_Interface_Alias
(New_Subp
, Iface_Prim
);
1789 -- If the returned type is an interface then propagate it to
1790 -- the returned type. Needed by the thunk to generate the code
1791 -- which displaces "this" to reference the corresponding
1792 -- secondary dispatch table in the returned object.
1794 if Is_Interface
(Etype
(Iface_Prim
)) then
1795 Set_Etype
(New_Subp
, Etype
(Iface_Prim
));
1798 -- Internal entities associated with interface types are only
1799 -- registered in the list of primitives of the tagged type.
1800 -- They are only used to fill the contents of the secondary
1801 -- dispatch tables. Therefore they are not needed in the
1804 Remove_Homonym
(New_Subp
);
1806 -- Hidden entities associated with interfaces must have set
1807 -- the Has_Delay_Freeze attribute to ensure that, in case
1808 -- of locally defined tagged types (or compiling with static
1809 -- dispatch tables generation disabled) the corresponding
1810 -- entry of the secondary dispatch table is filled when such
1811 -- an entity is frozen. This is an expansion activity that must
1812 -- be suppressed for ASIS because it leads to gigi elaboration
1813 -- issues in annotate mode.
1815 if not ASIS_Mode
then
1816 Set_Has_Delayed_Freeze
(New_Subp
);
1824 Next_Elmt
(Iface_Elmt
);
1827 if Restore_Scope
then
1830 end Add_Internal_Interface_Entities
;
1832 -----------------------------------
1833 -- Analyze_Component_Declaration --
1834 -----------------------------------
1836 procedure Analyze_Component_Declaration
(N
: Node_Id
) is
1837 Loc
: constant Source_Ptr
:= Sloc
(Component_Definition
(N
));
1838 Id
: constant Entity_Id
:= Defining_Identifier
(N
);
1839 E
: constant Node_Id
:= Expression
(N
);
1840 Typ
: constant Node_Id
:=
1841 Subtype_Indication
(Component_Definition
(N
));
1845 function Contains_POC
(Constr
: Node_Id
) return Boolean;
1846 -- Determines whether a constraint uses the discriminant of a record
1847 -- type thus becoming a per-object constraint (POC).
1849 function Is_Known_Limited
(Typ
: Entity_Id
) return Boolean;
1850 -- Typ is the type of the current component, check whether this type is
1851 -- a limited type. Used to validate declaration against that of
1852 -- enclosing record.
1858 function Contains_POC
(Constr
: Node_Id
) return Boolean is
1860 -- Prevent cascaded errors
1862 if Error_Posted
(Constr
) then
1866 case Nkind
(Constr
) is
1867 when N_Attribute_Reference
=>
1868 return Attribute_Name
(Constr
) = Name_Access
1869 and then Prefix
(Constr
) = Scope
(Entity
(Prefix
(Constr
)));
1871 when N_Discriminant_Association
=>
1872 return Denotes_Discriminant
(Expression
(Constr
));
1874 when N_Identifier
=>
1875 return Denotes_Discriminant
(Constr
);
1877 when N_Index_Or_Discriminant_Constraint
=>
1882 IDC
:= First
(Constraints
(Constr
));
1883 while Present
(IDC
) loop
1885 -- One per-object constraint is sufficient
1887 if Contains_POC
(IDC
) then
1898 return Denotes_Discriminant
(Low_Bound
(Constr
))
1900 Denotes_Discriminant
(High_Bound
(Constr
));
1902 when N_Range_Constraint
=>
1903 return Denotes_Discriminant
(Range_Expression
(Constr
));
1910 ----------------------
1911 -- Is_Known_Limited --
1912 ----------------------
1914 function Is_Known_Limited
(Typ
: Entity_Id
) return Boolean is
1915 P
: constant Entity_Id
:= Etype
(Typ
);
1916 R
: constant Entity_Id
:= Root_Type
(Typ
);
1919 if Is_Limited_Record
(Typ
) then
1922 -- If the root type is limited (and not a limited interface)
1923 -- so is the current type
1925 elsif Is_Limited_Record
(R
)
1926 and then (not Is_Interface
(R
) or else not Is_Limited_Interface
(R
))
1930 -- Else the type may have a limited interface progenitor, but a
1931 -- limited record parent.
1933 elsif R
/= P
and then Is_Limited_Record
(P
) then
1939 end Is_Known_Limited
;
1941 -- Start of processing for Analyze_Component_Declaration
1944 Generate_Definition
(Id
);
1947 if Present
(Typ
) then
1948 T
:= Find_Type_Of_Object
1949 (Subtype_Indication
(Component_Definition
(N
)), N
);
1951 if not Nkind_In
(Typ
, N_Identifier
, N_Expanded_Name
) then
1952 Check_SPARK_05_Restriction
("subtype mark required", Typ
);
1955 -- Ada 2005 (AI-230): Access Definition case
1958 pragma Assert
(Present
1959 (Access_Definition
(Component_Definition
(N
))));
1961 T
:= Access_Definition
1963 N
=> Access_Definition
(Component_Definition
(N
)));
1964 Set_Is_Local_Anonymous_Access
(T
);
1966 -- Ada 2005 (AI-254)
1968 if Present
(Access_To_Subprogram_Definition
1969 (Access_Definition
(Component_Definition
(N
))))
1970 and then Protected_Present
(Access_To_Subprogram_Definition
1972 (Component_Definition
(N
))))
1974 T
:= Replace_Anonymous_Access_To_Protected_Subprogram
(N
);
1978 -- If the subtype is a constrained subtype of the enclosing record,
1979 -- (which must have a partial view) the back-end does not properly
1980 -- handle the recursion. Rewrite the component declaration with an
1981 -- explicit subtype indication, which is acceptable to Gigi. We can copy
1982 -- the tree directly because side effects have already been removed from
1983 -- discriminant constraints.
1985 if Ekind
(T
) = E_Access_Subtype
1986 and then Is_Entity_Name
(Subtype_Indication
(Component_Definition
(N
)))
1987 and then Comes_From_Source
(T
)
1988 and then Nkind
(Parent
(T
)) = N_Subtype_Declaration
1989 and then Etype
(Directly_Designated_Type
(T
)) = Current_Scope
1992 (Subtype_Indication
(Component_Definition
(N
)),
1993 New_Copy_Tree
(Subtype_Indication
(Parent
(T
))));
1994 T
:= Find_Type_Of_Object
1995 (Subtype_Indication
(Component_Definition
(N
)), N
);
1998 -- If the component declaration includes a default expression, then we
1999 -- check that the component is not of a limited type (RM 3.7(5)),
2000 -- and do the special preanalysis of the expression (see section on
2001 -- "Handling of Default and Per-Object Expressions" in the spec of
2005 Check_SPARK_05_Restriction
("default expression is not allowed", E
);
2006 Preanalyze_Default_Expression
(E
, T
);
2007 Check_Initialization
(T
, E
);
2009 if Ada_Version
>= Ada_2005
2010 and then Ekind
(T
) = E_Anonymous_Access_Type
2011 and then Etype
(E
) /= Any_Type
2013 -- Check RM 3.9.2(9): "if the expected type for an expression is
2014 -- an anonymous access-to-specific tagged type, then the object
2015 -- designated by the expression shall not be dynamically tagged
2016 -- unless it is a controlling operand in a call on a dispatching
2019 if Is_Tagged_Type
(Directly_Designated_Type
(T
))
2021 Ekind
(Directly_Designated_Type
(T
)) /= E_Class_Wide_Type
2023 Ekind
(Directly_Designated_Type
(Etype
(E
))) =
2027 ("access to specific tagged type required (RM 3.9.2(9))", E
);
2030 -- (Ada 2005: AI-230): Accessibility check for anonymous
2033 if Type_Access_Level
(Etype
(E
)) >
2034 Deepest_Type_Access_Level
(T
)
2037 ("expression has deeper access level than component " &
2038 "(RM 3.10.2 (12.2))", E
);
2041 -- The initialization expression is a reference to an access
2042 -- discriminant. The type of the discriminant is always deeper
2043 -- than any access type.
2045 if Ekind
(Etype
(E
)) = E_Anonymous_Access_Type
2046 and then Is_Entity_Name
(E
)
2047 and then Ekind
(Entity
(E
)) = E_In_Parameter
2048 and then Present
(Discriminal_Link
(Entity
(E
)))
2051 ("discriminant has deeper accessibility level than target",
2057 -- The parent type may be a private view with unknown discriminants,
2058 -- and thus unconstrained. Regular components must be constrained.
2060 if not Is_Definite_Subtype
(T
) and then Chars
(Id
) /= Name_uParent
then
2061 if Is_Class_Wide_Type
(T
) then
2063 ("class-wide subtype with unknown discriminants" &
2064 " in component declaration",
2065 Subtype_Indication
(Component_Definition
(N
)));
2068 ("unconstrained subtype in component declaration",
2069 Subtype_Indication
(Component_Definition
(N
)));
2072 -- Components cannot be abstract, except for the special case of
2073 -- the _Parent field (case of extending an abstract tagged type)
2075 elsif Is_Abstract_Type
(T
) and then Chars
(Id
) /= Name_uParent
then
2076 Error_Msg_N
("type of a component cannot be abstract", N
);
2080 Set_Is_Aliased
(Id
, Aliased_Present
(Component_Definition
(N
)));
2082 -- The component declaration may have a per-object constraint, set
2083 -- the appropriate flag in the defining identifier of the subtype.
2085 if Present
(Subtype_Indication
(Component_Definition
(N
))) then
2087 Sindic
: constant Node_Id
:=
2088 Subtype_Indication
(Component_Definition
(N
));
2090 if Nkind
(Sindic
) = N_Subtype_Indication
2091 and then Present
(Constraint
(Sindic
))
2092 and then Contains_POC
(Constraint
(Sindic
))
2094 Set_Has_Per_Object_Constraint
(Id
);
2099 -- Ada 2005 (AI-231): Propagate the null-excluding attribute and carry
2100 -- out some static checks.
2102 if Ada_Version
>= Ada_2005
and then Can_Never_Be_Null
(T
) then
2103 Null_Exclusion_Static_Checks
(N
);
2106 -- If this component is private (or depends on a private type), flag the
2107 -- record type to indicate that some operations are not available.
2109 P
:= Private_Component
(T
);
2113 -- Check for circular definitions
2115 if P
= Any_Type
then
2116 Set_Etype
(Id
, Any_Type
);
2118 -- There is a gap in the visibility of operations only if the
2119 -- component type is not defined in the scope of the record type.
2121 elsif Scope
(P
) = Scope
(Current_Scope
) then
2124 elsif Is_Limited_Type
(P
) then
2125 Set_Is_Limited_Composite
(Current_Scope
);
2128 Set_Is_Private_Composite
(Current_Scope
);
2133 and then Is_Limited_Type
(T
)
2134 and then Chars
(Id
) /= Name_uParent
2135 and then Is_Tagged_Type
(Current_Scope
)
2137 if Is_Derived_Type
(Current_Scope
)
2138 and then not Is_Known_Limited
(Current_Scope
)
2141 ("extension of nonlimited type cannot have limited components",
2144 if Is_Interface
(Root_Type
(Current_Scope
)) then
2146 ("\limitedness is not inherited from limited interface", N
);
2147 Error_Msg_N
("\add LIMITED to type indication", N
);
2150 Explain_Limited_Type
(T
, N
);
2151 Set_Etype
(Id
, Any_Type
);
2152 Set_Is_Limited_Composite
(Current_Scope
, False);
2154 elsif not Is_Derived_Type
(Current_Scope
)
2155 and then not Is_Limited_Record
(Current_Scope
)
2156 and then not Is_Concurrent_Type
(Current_Scope
)
2159 ("nonlimited tagged type cannot have limited components", N
);
2160 Explain_Limited_Type
(T
, N
);
2161 Set_Etype
(Id
, Any_Type
);
2162 Set_Is_Limited_Composite
(Current_Scope
, False);
2166 -- If the component is an unconstrained task or protected type with
2167 -- discriminants, the component and the enclosing record are limited
2168 -- and the component is constrained by its default values. Compute
2169 -- its actual subtype, else it may be allocated the maximum size by
2170 -- the backend, and possibly overflow.
2172 if Is_Concurrent_Type
(T
)
2173 and then not Is_Constrained
(T
)
2174 and then Has_Discriminants
(T
)
2175 and then not Has_Discriminants
(Current_Scope
)
2178 Act_T
: constant Entity_Id
:= Build_Default_Subtype
(T
, N
);
2181 Set_Etype
(Id
, Act_T
);
2183 -- Rewrite component definition to use the constrained subtype
2185 Rewrite
(Component_Definition
(N
),
2186 Make_Component_Definition
(Loc
,
2187 Subtype_Indication
=> New_Occurrence_Of
(Act_T
, Loc
)));
2191 Set_Original_Record_Component
(Id
, Id
);
2193 if Has_Aspects
(N
) then
2194 Analyze_Aspect_Specifications
(N
, Id
);
2197 Analyze_Dimension
(N
);
2198 end Analyze_Component_Declaration
;
2200 --------------------------
2201 -- Analyze_Declarations --
2202 --------------------------
2204 procedure Analyze_Declarations
(L
: List_Id
) is
2207 procedure Adjust_Decl
;
2208 -- Adjust Decl not to include implicit label declarations, since these
2209 -- have strange Sloc values that result in elaboration check problems.
2210 -- (They have the sloc of the label as found in the source, and that
2211 -- is ahead of the current declarative part).
2213 procedure Build_Assertion_Bodies
(Decls
: List_Id
; Context
: Node_Id
);
2214 -- Create the subprogram bodies which verify the run-time semantics of
2215 -- the pragmas listed below for each elibigle type found in declarative
2216 -- list Decls. The pragmas are:
2218 -- Default_Initial_Condition
2222 -- Context denotes the owner of the declarative list.
2224 procedure Check_Entry_Contracts
;
2225 -- Perform a preanalysis of the pre- and postconditions of an entry
2226 -- declaration. This must be done before full resolution and creation
2227 -- of the parameter block, etc. to catch illegal uses within the
2228 -- contract expression. Full analysis of the expression is done when
2229 -- the contract is processed.
2231 function Contains_Lib_Incomplete_Type
(Pkg
: Entity_Id
) return Boolean;
2232 -- Check if a nested package has entities within it that rely on library
2233 -- level private types where the full view has not been completed for
2234 -- the purposes of checking if it is acceptable to freeze an expression
2235 -- function at the point of declaration.
2237 procedure Handle_Late_Controlled_Primitive
(Body_Decl
: Node_Id
);
2238 -- Determine whether Body_Decl denotes the body of a late controlled
2239 -- primitive (either Initialize, Adjust or Finalize). If this is the
2240 -- case, add a proper spec if the body lacks one. The spec is inserted
2241 -- before Body_Decl and immediately analyzed.
2243 procedure Remove_Partial_Visible_Refinements
(Spec_Id
: Entity_Id
);
2244 -- Spec_Id is the entity of a package that may define abstract states,
2245 -- and in the case of a child unit, whose ancestors may define abstract
2246 -- states. If the states have partial visible refinement, remove the
2247 -- partial visibility of each constituent at the end of the package
2248 -- spec and body declarations.
2250 procedure Remove_Visible_Refinements
(Spec_Id
: Entity_Id
);
2251 -- Spec_Id is the entity of a package that may define abstract states.
2252 -- If the states have visible refinement, remove the visibility of each
2253 -- constituent at the end of the package body declaration.
2255 procedure Resolve_Aspects
;
2256 -- Utility to resolve the expressions of aspects at the end of a list of
2257 -- declarations, or before a declaration that freezes previous entities,
2258 -- such as in a subprogram body.
2264 procedure Adjust_Decl
is
2266 while Present
(Prev
(Decl
))
2267 and then Nkind
(Decl
) = N_Implicit_Label_Declaration
2273 ----------------------------
2274 -- Build_Assertion_Bodies --
2275 ----------------------------
2277 procedure Build_Assertion_Bodies
(Decls
: List_Id
; Context
: Node_Id
) is
2278 procedure Build_Assertion_Bodies_For_Type
(Typ
: Entity_Id
);
2279 -- Create the subprogram bodies which verify the run-time semantics
2280 -- of the pragmas listed below for type Typ. The pragmas are:
2282 -- Default_Initial_Condition
2286 -------------------------------------
2287 -- Build_Assertion_Bodies_For_Type --
2288 -------------------------------------
2290 procedure Build_Assertion_Bodies_For_Type
(Typ
: Entity_Id
) is
2292 -- Preanalyze and resolve the Default_Initial_Condition assertion
2293 -- expression at the end of the declarations to catch any errors.
2295 if Has_DIC
(Typ
) then
2296 Build_DIC_Procedure_Body
(Typ
);
2299 if Nkind
(Context
) = N_Package_Specification
then
2301 -- Preanalyze and resolve the class-wide invariants of an
2302 -- interface at the end of whichever declarative part has the
2303 -- interface type. Note that an interface may be declared in
2304 -- any non-package declarative part, but reaching the end of
2305 -- such a declarative part will always freeze the type and
2306 -- generate the invariant procedure (see Freeze_Type).
2308 if Is_Interface
(Typ
) then
2310 -- Interfaces are treated as the partial view of a private
2311 -- type, in order to achieve uniformity with the general
2312 -- case. As a result, an interface receives only a "partial"
2313 -- invariant procedure, which is never called.
2315 if Has_Own_Invariants
(Typ
) then
2316 Build_Invariant_Procedure_Body
2318 Partial_Invariant
=> True);
2321 -- Preanalyze and resolve the invariants of a private type
2322 -- at the end of the visible declarations to catch potential
2323 -- errors. Inherited class-wide invariants are not included
2324 -- because they have already been resolved.
2326 elsif Decls
= Visible_Declarations
(Context
)
2327 and then Ekind_In
(Typ
, E_Limited_Private_Type
,
2329 E_Record_Type_With_Private
)
2330 and then Has_Own_Invariants
(Typ
)
2332 Build_Invariant_Procedure_Body
2334 Partial_Invariant
=> True);
2336 -- Preanalyze and resolve the invariants of a private type's
2337 -- full view at the end of the private declarations to catch
2338 -- potential errors.
2340 elsif Decls
= Private_Declarations
(Context
)
2341 and then not Is_Private_Type
(Typ
)
2342 and then Has_Private_Declaration
(Typ
)
2343 and then Has_Invariants
(Typ
)
2345 Build_Invariant_Procedure_Body
(Typ
);
2348 end Build_Assertion_Bodies_For_Type
;
2353 Decl_Id
: Entity_Id
;
2355 -- Start of processing for Build_Assertion_Bodies
2358 Decl
:= First
(Decls
);
2359 while Present
(Decl
) loop
2360 if Is_Declaration
(Decl
) then
2361 Decl_Id
:= Defining_Entity
(Decl
);
2363 if Is_Type
(Decl_Id
) then
2364 Build_Assertion_Bodies_For_Type
(Decl_Id
);
2370 end Build_Assertion_Bodies
;
2372 ---------------------------
2373 -- Check_Entry_Contracts --
2374 ---------------------------
2376 procedure Check_Entry_Contracts
is
2382 Ent
:= First_Entity
(Current_Scope
);
2383 while Present
(Ent
) loop
2385 -- This only concerns entries with pre/postconditions
2387 if Ekind
(Ent
) = E_Entry
2388 and then Present
(Contract
(Ent
))
2389 and then Present
(Pre_Post_Conditions
(Contract
(Ent
)))
2391 ASN
:= Pre_Post_Conditions
(Contract
(Ent
));
2393 Install_Formals
(Ent
);
2395 -- Pre/postconditions are rewritten as Check pragmas. Analysis
2396 -- is performed on a copy of the pragma expression, to prevent
2397 -- modifying the original expression.
2399 while Present
(ASN
) loop
2400 if Nkind
(ASN
) = N_Pragma
then
2404 (First
(Pragma_Argument_Associations
(ASN
))));
2405 Set_Parent
(Exp
, ASN
);
2407 Preanalyze_Assert_Expression
(Exp
, Standard_Boolean
);
2410 ASN
:= Next_Pragma
(ASN
);
2418 end Check_Entry_Contracts
;
2420 ----------------------------------
2421 -- Contains_Lib_Incomplete_Type --
2422 ----------------------------------
2424 function Contains_Lib_Incomplete_Type
(Pkg
: Entity_Id
) return Boolean is
2428 -- Avoid looking through scopes that do not meet the precondition of
2429 -- Pkg not being within a library unit spec.
2431 if not Is_Compilation_Unit
(Pkg
)
2432 and then not Is_Generic_Instance
(Pkg
)
2433 and then not In_Package_Body
(Enclosing_Lib_Unit_Entity
(Pkg
))
2435 -- Loop through all entities in the current scope to identify
2436 -- an entity that depends on a private type.
2438 Curr
:= First_Entity
(Pkg
);
2440 if Nkind
(Curr
) in N_Entity
2441 and then Depends_On_Private
(Curr
)
2446 exit when Last_Entity
(Current_Scope
) = Curr
;
2447 Curr
:= Next_Entity
(Curr
);
2452 end Contains_Lib_Incomplete_Type
;
2454 --------------------------------------
2455 -- Handle_Late_Controlled_Primitive --
2456 --------------------------------------
2458 procedure Handle_Late_Controlled_Primitive
(Body_Decl
: Node_Id
) is
2459 Body_Spec
: constant Node_Id
:= Specification
(Body_Decl
);
2460 Body_Id
: constant Entity_Id
:= Defining_Entity
(Body_Spec
);
2461 Loc
: constant Source_Ptr
:= Sloc
(Body_Id
);
2462 Params
: constant List_Id
:=
2463 Parameter_Specifications
(Body_Spec
);
2465 Spec_Id
: Entity_Id
;
2469 -- Consider only procedure bodies whose name matches one of the three
2470 -- controlled primitives.
2472 if Nkind
(Body_Spec
) /= N_Procedure_Specification
2473 or else not Nam_In
(Chars
(Body_Id
), Name_Adjust
,
2479 -- A controlled primitive must have exactly one formal which is not
2480 -- an anonymous access type.
2482 elsif List_Length
(Params
) /= 1 then
2486 Typ
:= Parameter_Type
(First
(Params
));
2488 if Nkind
(Typ
) = N_Access_Definition
then
2494 -- The type of the formal must be derived from [Limited_]Controlled
2496 if not Is_Controlled
(Entity
(Typ
)) then
2500 -- Check whether a specification exists for this body. We do not
2501 -- analyze the spec of the body in full, because it will be analyzed
2502 -- again when the body is properly analyzed, and we cannot create
2503 -- duplicate entries in the formals chain. We look for an explicit
2504 -- specification because the body may be an overriding operation and
2505 -- an inherited spec may be present.
2507 Spec_Id
:= Current_Entity
(Body_Id
);
2509 while Present
(Spec_Id
) loop
2510 if Ekind_In
(Spec_Id
, E_Procedure
, E_Generic_Procedure
)
2511 and then Scope
(Spec_Id
) = Current_Scope
2512 and then Present
(First_Formal
(Spec_Id
))
2513 and then No
(Next_Formal
(First_Formal
(Spec_Id
)))
2514 and then Etype
(First_Formal
(Spec_Id
)) = Entity
(Typ
)
2515 and then Comes_From_Source
(Spec_Id
)
2520 Spec_Id
:= Homonym
(Spec_Id
);
2523 -- At this point the body is known to be a late controlled primitive.
2524 -- Generate a matching spec and insert it before the body. Note the
2525 -- use of Copy_Separate_Tree - we want an entirely separate semantic
2526 -- tree in this case.
2528 Spec
:= Copy_Separate_Tree
(Body_Spec
);
2530 -- Ensure that the subprogram declaration does not inherit the null
2531 -- indicator from the body as we now have a proper spec/body pair.
2533 Set_Null_Present
(Spec
, False);
2535 -- Ensure that the freeze node is inserted after the declaration of
2536 -- the primitive since its expansion will freeze the primitive.
2538 Decl
:= Make_Subprogram_Declaration
(Loc
, Specification
=> Spec
);
2540 Insert_Before_And_Analyze
(Body_Decl
, Decl
);
2541 end Handle_Late_Controlled_Primitive
;
2543 ----------------------------------------
2544 -- Remove_Partial_Visible_Refinements --
2545 ----------------------------------------
2547 procedure Remove_Partial_Visible_Refinements
(Spec_Id
: Entity_Id
) is
2548 State_Elmt
: Elmt_Id
;
2550 if Present
(Abstract_States
(Spec_Id
)) then
2551 State_Elmt
:= First_Elmt
(Abstract_States
(Spec_Id
));
2552 while Present
(State_Elmt
) loop
2553 Set_Has_Partial_Visible_Refinement
(Node
(State_Elmt
), False);
2554 Next_Elmt
(State_Elmt
);
2558 -- For a child unit, also hide the partial state refinement from
2559 -- ancestor packages.
2561 if Is_Child_Unit
(Spec_Id
) then
2562 Remove_Partial_Visible_Refinements
(Scope
(Spec_Id
));
2564 end Remove_Partial_Visible_Refinements
;
2566 --------------------------------
2567 -- Remove_Visible_Refinements --
2568 --------------------------------
2570 procedure Remove_Visible_Refinements
(Spec_Id
: Entity_Id
) is
2571 State_Elmt
: Elmt_Id
;
2573 if Present
(Abstract_States
(Spec_Id
)) then
2574 State_Elmt
:= First_Elmt
(Abstract_States
(Spec_Id
));
2575 while Present
(State_Elmt
) loop
2576 Set_Has_Visible_Refinement
(Node
(State_Elmt
), False);
2577 Next_Elmt
(State_Elmt
);
2580 end Remove_Visible_Refinements
;
2582 ---------------------
2583 -- Resolve_Aspects --
2584 ---------------------
2586 procedure Resolve_Aspects
is
2590 E
:= First_Entity
(Current_Scope
);
2591 while Present
(E
) loop
2592 Resolve_Aspect_Expressions
(E
);
2595 end Resolve_Aspects
;
2599 Context
: Node_Id
:= Empty
;
2600 Freeze_From
: Entity_Id
:= Empty
;
2601 Next_Decl
: Node_Id
;
2603 Body_Seen
: Boolean := False;
2604 -- Flag set when the first body [stub] is encountered
2606 -- Start of processing for Analyze_Declarations
2609 if Restriction_Check_Required
(SPARK_05
) then
2610 Check_Later_Vs_Basic_Declarations
(L
, During_Parsing
=> False);
2614 while Present
(Decl
) loop
2616 -- Package spec cannot contain a package declaration in SPARK
2618 if Nkind
(Decl
) = N_Package_Declaration
2619 and then Nkind
(Parent
(L
)) = N_Package_Specification
2621 Check_SPARK_05_Restriction
2622 ("package specification cannot contain a package declaration",
2626 -- Complete analysis of declaration
2629 Next_Decl
:= Next
(Decl
);
2631 if No
(Freeze_From
) then
2632 Freeze_From
:= First_Entity
(Current_Scope
);
2635 -- At the end of a declarative part, freeze remaining entities
2636 -- declared in it. The end of the visible declarations of package
2637 -- specification is not the end of a declarative part if private
2638 -- declarations are present. The end of a package declaration is a
2639 -- freezing point only if it a library package. A task definition or
2640 -- protected type definition is not a freeze point either. Finally,
2641 -- we do not freeze entities in generic scopes, because there is no
2642 -- code generated for them and freeze nodes will be generated for
2645 -- The end of a package instantiation is not a freeze point, but
2646 -- for now we make it one, because the generic body is inserted
2647 -- (currently) immediately after. Generic instantiations will not
2648 -- be a freeze point once delayed freezing of bodies is implemented.
2649 -- (This is needed in any case for early instantiations ???).
2651 if No
(Next_Decl
) then
2652 if Nkind
(Parent
(L
)) = N_Component_List
then
2655 elsif Nkind_In
(Parent
(L
), N_Protected_Definition
,
2658 Check_Entry_Contracts
;
2660 elsif Nkind
(Parent
(L
)) /= N_Package_Specification
then
2661 if Nkind
(Parent
(L
)) = N_Package_Body
then
2662 Freeze_From
:= First_Entity
(Current_Scope
);
2665 -- There may have been several freezing points previously,
2666 -- for example object declarations or subprogram bodies, but
2667 -- at the end of a declarative part we check freezing from
2668 -- the beginning, even though entities may already be frozen,
2669 -- in order to perform visibility checks on delayed aspects.
2673 -- If the current scope is a generic subprogram body. Skip the
2674 -- generic formal parameters that are not frozen here.
2676 if Is_Subprogram
(Current_Scope
)
2677 and then Nkind
(Unit_Declaration_Node
(Current_Scope
)) =
2678 N_Generic_Subprogram_Declaration
2679 and then Present
(First_Entity
(Current_Scope
))
2681 while Is_Generic_Formal
(Freeze_From
) loop
2682 Freeze_From
:= Next_Entity
(Freeze_From
);
2685 Freeze_All
(Freeze_From
, Decl
);
2686 Freeze_From
:= Last_Entity
(Current_Scope
);
2689 -- For declarations in a subprogram body there is no issue
2690 -- with name resolution in aspect specifications, but in
2691 -- ASIS mode we need to preanalyze aspect specifications
2692 -- that may otherwise only be analyzed during expansion
2693 -- (e.g. during generation of a related subprogram).
2699 Freeze_All
(First_Entity
(Current_Scope
), Decl
);
2700 Freeze_From
:= Last_Entity
(Current_Scope
);
2703 -- Current scope is a package specification
2705 elsif Scope
(Current_Scope
) /= Standard_Standard
2706 and then not Is_Child_Unit
(Current_Scope
)
2707 and then No
(Generic_Parent
(Parent
(L
)))
2709 -- ARM rule 13.1.1(11/3): usage names in aspect definitions are
2710 -- resolved at the end of the immediately enclosing declaration
2711 -- list (AI05-0183-1).
2715 elsif L
/= Visible_Declarations
(Parent
(L
))
2716 or else No
(Private_Declarations
(Parent
(L
)))
2717 or else Is_Empty_List
(Private_Declarations
(Parent
(L
)))
2721 -- End of a package declaration
2723 -- In compilation mode the expansion of freeze node takes care
2724 -- of resolving expressions of all aspects in the list. In ASIS
2725 -- mode this must be done explicitly.
2728 and then Scope
(Current_Scope
) = Standard_Standard
2733 -- This is a freeze point because it is the end of a
2734 -- compilation unit.
2736 Freeze_All
(First_Entity
(Current_Scope
), Decl
);
2737 Freeze_From
:= Last_Entity
(Current_Scope
);
2739 -- At the end of the visible declarations the expressions in
2740 -- aspects of all entities declared so far must be resolved.
2741 -- The entities themselves might be frozen later, and the
2742 -- generated pragmas and attribute definition clauses analyzed
2743 -- in full at that point, but name resolution must take place
2745 -- In addition to being the proper semantics, this is mandatory
2746 -- within generic units, because global name capture requires
2747 -- those expressions to be analyzed, given that the generated
2748 -- pragmas do not appear in the original generic tree.
2750 elsif Serious_Errors_Detected
= 0 then
2754 -- If next node is a body then freeze all types before the body.
2755 -- An exception occurs for some expander-generated bodies. If these
2756 -- are generated at places where in general language rules would not
2757 -- allow a freeze point, then we assume that the expander has
2758 -- explicitly checked that all required types are properly frozen,
2759 -- and we do not cause general freezing here. This special circuit
2760 -- is used when the encountered body is marked as having already
2763 -- In all other cases (bodies that come from source, and expander
2764 -- generated bodies that have not been analyzed yet), freeze all
2765 -- types now. Note that in the latter case, the expander must take
2766 -- care to attach the bodies at a proper place in the tree so as to
2767 -- not cause unwanted freezing at that point.
2769 -- It is also necessary to check for a case where both an expression
2770 -- function is used and the current scope depends on an incomplete
2771 -- private type from a library unit, otherwise premature freezing of
2772 -- the private type will occur.
2774 elsif not Analyzed
(Next_Decl
) and then Is_Body
(Next_Decl
)
2775 and then ((Nkind
(Next_Decl
) /= N_Subprogram_Body
2776 or else not Was_Expression_Function
(Next_Decl
))
2777 or else (not Is_Ignored_Ghost_Entity
(Current_Scope
)
2778 and then not Contains_Lib_Incomplete_Type
2781 -- When a controlled type is frozen, the expander generates stream
2782 -- and controlled-type support routines. If the freeze is caused
2783 -- by the stand-alone body of Initialize, Adjust, or Finalize, the
2784 -- expander will end up using the wrong version of these routines,
2785 -- as the body has not been processed yet. To remedy this, detect
2786 -- a late controlled primitive and create a proper spec for it.
2787 -- This ensures that the primitive will override its inherited
2788 -- counterpart before the freeze takes place.
2790 -- If the declaration we just processed is a body, do not attempt
2791 -- to examine Next_Decl as the late primitive idiom can only apply
2792 -- to the first encountered body.
2794 -- The spec of the late primitive is not generated in ASIS mode to
2795 -- ensure a consistent list of primitives that indicates the true
2796 -- semantic structure of the program (which is not relevant when
2797 -- generating executable code).
2799 -- ??? A cleaner approach may be possible and/or this solution
2800 -- could be extended to general-purpose late primitives, TBD.
2803 and then not Body_Seen
2804 and then not Is_Body
(Decl
)
2808 if Nkind
(Next_Decl
) = N_Subprogram_Body
then
2809 Handle_Late_Controlled_Primitive
(Next_Decl
);
2813 -- In ASIS mode, if the next declaration is a body, complete
2814 -- the analysis of declarations so far.
2821 -- The generated body of an expression function does not freeze,
2822 -- unless it is a completion, in which case only the expression
2823 -- itself freezes. This is handled when the body itself is
2824 -- analyzed (see Freeze_Expr_Types, sem_ch6.adb).
2826 Freeze_All
(Freeze_From
, Decl
);
2827 Freeze_From
:= Last_Entity
(Current_Scope
);
2833 -- Post-freezing actions
2836 Context
:= Parent
(L
);
2838 -- Certain contract annocations have forward visibility semantics and
2839 -- must be analyzed after all declarative items have been processed.
2840 -- This timing ensures that entities referenced by such contracts are
2843 -- Analyze the contract of an immediately enclosing package spec or
2844 -- body first because other contracts may depend on its information.
2846 if Nkind
(Context
) = N_Package_Body
then
2847 Analyze_Package_Body_Contract
(Defining_Entity
(Context
));
2849 elsif Nkind
(Context
) = N_Package_Specification
then
2850 Analyze_Package_Contract
(Defining_Entity
(Context
));
2853 -- Analyze the contracts of various constructs in the declarative
2856 Analyze_Contracts
(L
);
2858 if Nkind
(Context
) = N_Package_Body
then
2860 -- Ensure that all abstract states and objects declared in the
2861 -- state space of a package body are utilized as constituents.
2863 Check_Unused_Body_States
(Defining_Entity
(Context
));
2865 -- State refinements are visible up to the end of the package body
2866 -- declarations. Hide the state refinements from visibility to
2867 -- restore the original state conditions.
2869 Remove_Visible_Refinements
(Corresponding_Spec
(Context
));
2870 Remove_Partial_Visible_Refinements
(Corresponding_Spec
(Context
));
2872 elsif Nkind
(Context
) = N_Package_Specification
then
2874 -- Partial state refinements are visible up to the end of the
2875 -- package spec declarations. Hide the partial state refinements
2876 -- from visibility to restore the original state conditions.
2878 Remove_Partial_Visible_Refinements
(Defining_Entity
(Context
));
2881 -- Verify that all abstract states found in any package declared in
2882 -- the input declarative list have proper refinements. The check is
2883 -- performed only when the context denotes a block, entry, package,
2884 -- protected, subprogram, or task body (SPARK RM 7.2.2(3)).
2886 Check_State_Refinements
(Context
);
2888 -- Create the subprogram bodies which verify the run-time semantics
2889 -- of pragmas Default_Initial_Condition and [Type_]Invariant for all
2890 -- types within the current declarative list. This ensures that all
2891 -- assertion expressions are preanalyzed and resolved at the end of
2892 -- the declarative part. Note that the resolution happens even when
2893 -- freezing does not take place.
2895 Build_Assertion_Bodies
(L
, Context
);
2897 end Analyze_Declarations
;
2899 -----------------------------------
2900 -- Analyze_Full_Type_Declaration --
2901 -----------------------------------
2903 procedure Analyze_Full_Type_Declaration
(N
: Node_Id
) is
2904 Def
: constant Node_Id
:= Type_Definition
(N
);
2905 Def_Id
: constant Entity_Id
:= Defining_Identifier
(N
);
2909 Is_Remote
: constant Boolean :=
2910 (Is_Remote_Types
(Current_Scope
)
2911 or else Is_Remote_Call_Interface
(Current_Scope
))
2912 and then not (In_Private_Part
(Current_Scope
)
2913 or else In_Package_Body
(Current_Scope
));
2915 procedure Check_Nonoverridable_Aspects
;
2916 -- Apply the rule in RM 13.1.1(18.4/4) on iterator aspects that cannot
2917 -- be overridden, and can only be confirmed on derivation.
2919 procedure Check_Ops_From_Incomplete_Type
;
2920 -- If there is a tagged incomplete partial view of the type, traverse
2921 -- the primitives of the incomplete view and change the type of any
2922 -- controlling formals and result to indicate the full view. The
2923 -- primitives will be added to the full type's primitive operations
2924 -- list later in Sem_Disp.Check_Operation_From_Incomplete_Type (which
2925 -- is called from Process_Incomplete_Dependents).
2927 ----------------------------------
2928 -- Check_Nonoverridable_Aspects --
2929 ----------------------------------
2931 procedure Check_Nonoverridable_Aspects
is
2932 function Get_Aspect_Spec
2934 Aspect_Name
: Name_Id
) return Node_Id
;
2935 -- Check whether a list of aspect specifications includes an entry
2936 -- for a specific aspect. The list is either that of a partial or
2939 ---------------------
2940 -- Get_Aspect_Spec --
2941 ---------------------
2943 function Get_Aspect_Spec
2945 Aspect_Name
: Name_Id
) return Node_Id
2950 Spec
:= First
(Specs
);
2951 while Present
(Spec
) loop
2952 if Chars
(Identifier
(Spec
)) = Aspect_Name
then
2959 end Get_Aspect_Spec
;
2963 Prev_Aspects
: constant List_Id
:=
2964 Aspect_Specifications
(Parent
(Def_Id
));
2965 Par_Type
: Entity_Id
;
2966 Prev_Aspect
: Node_Id
;
2968 -- Start of processing for Check_Nonoverridable_Aspects
2971 -- Get parent type of derived type. Note that Prev is the entity in
2972 -- the partial declaration, but its contents are now those of full
2973 -- view, while Def_Id reflects the partial view.
2975 if Is_Private_Type
(Def_Id
) then
2976 Par_Type
:= Etype
(Full_View
(Def_Id
));
2978 Par_Type
:= Etype
(Def_Id
);
2981 -- If there is an inherited Implicit_Dereference, verify that it is
2982 -- made explicit in the partial view.
2984 if Has_Discriminants
(Base_Type
(Par_Type
))
2985 and then Nkind
(Parent
(Prev
)) = N_Full_Type_Declaration
2986 and then Present
(Discriminant_Specifications
(Parent
(Prev
)))
2987 and then Present
(Get_Reference_Discriminant
(Par_Type
))
2990 Get_Aspect_Spec
(Prev_Aspects
, Name_Implicit_Dereference
);
2994 (Discriminant_Specifications
2995 (Original_Node
(Parent
(Prev
))))
2998 ("type does not inherit implicit dereference", Prev
);
3001 -- If one of the views has the aspect specified, verify that it
3002 -- is consistent with that of the parent.
3005 Par_Discr
: constant Entity_Id
:=
3006 Get_Reference_Discriminant
(Par_Type
);
3007 Cur_Discr
: constant Entity_Id
:=
3008 Get_Reference_Discriminant
(Prev
);
3011 if Corresponding_Discriminant
(Cur_Discr
) /= Par_Discr
then
3012 Error_Msg_N
("aspect incosistent with that of parent", N
);
3015 -- Check that specification in partial view matches the
3016 -- inherited aspect. Compare names directly because aspect
3017 -- expression may not be analyzed.
3019 if Present
(Prev_Aspect
)
3020 and then Nkind
(Expression
(Prev_Aspect
)) = N_Identifier
3021 and then Chars
(Expression
(Prev_Aspect
)) /=
3025 ("aspect incosistent with that of parent", N
);
3031 -- TBD : other nonoverridable aspects.
3032 end Check_Nonoverridable_Aspects
;
3034 ------------------------------------
3035 -- Check_Ops_From_Incomplete_Type --
3036 ------------------------------------
3038 procedure Check_Ops_From_Incomplete_Type
is
3045 and then Ekind
(Prev
) = E_Incomplete_Type
3046 and then Is_Tagged_Type
(Prev
)
3047 and then Is_Tagged_Type
(T
)
3049 Elmt
:= First_Elmt
(Primitive_Operations
(Prev
));
3050 while Present
(Elmt
) loop
3053 Formal
:= First_Formal
(Op
);
3054 while Present
(Formal
) loop
3055 if Etype
(Formal
) = Prev
then
3056 Set_Etype
(Formal
, T
);
3059 Next_Formal
(Formal
);
3062 if Etype
(Op
) = Prev
then
3069 end Check_Ops_From_Incomplete_Type
;
3071 -- Start of processing for Analyze_Full_Type_Declaration
3074 Prev
:= Find_Type_Name
(N
);
3076 -- The full view, if present, now points to the current type. If there
3077 -- is an incomplete partial view, set a link to it, to simplify the
3078 -- retrieval of primitive operations of the type.
3080 -- Ada 2005 (AI-50217): If the type was previously decorated when
3081 -- imported through a LIMITED WITH clause, it appears as incomplete
3082 -- but has no full view.
3084 if Ekind
(Prev
) = E_Incomplete_Type
3085 and then Present
(Full_View
(Prev
))
3087 T
:= Full_View
(Prev
);
3088 Set_Incomplete_View
(N
, Parent
(Prev
));
3093 Set_Is_Pure
(T
, Is_Pure
(Current_Scope
));
3095 -- We set the flag Is_First_Subtype here. It is needed to set the
3096 -- corresponding flag for the Implicit class-wide-type created
3097 -- during tagged types processing.
3099 Set_Is_First_Subtype
(T
, True);
3101 -- Only composite types other than array types are allowed to have
3106 -- For derived types, the rule will be checked once we've figured
3107 -- out the parent type.
3109 when N_Derived_Type_Definition
=>
3112 -- For record types, discriminants are allowed, unless we are in
3115 when N_Record_Definition
=>
3116 if Present
(Discriminant_Specifications
(N
)) then
3117 Check_SPARK_05_Restriction
3118 ("discriminant type is not allowed",
3120 (First
(Discriminant_Specifications
(N
))));
3124 if Present
(Discriminant_Specifications
(N
)) then
3126 ("elementary or array type cannot have discriminants",
3128 (First
(Discriminant_Specifications
(N
))));
3132 -- Elaborate the type definition according to kind, and generate
3133 -- subsidiary (implicit) subtypes where needed. We skip this if it was
3134 -- already done (this happens during the reanalysis that follows a call
3135 -- to the high level optimizer).
3137 if not Analyzed
(T
) then
3140 -- Set the SPARK mode from the current context
3142 Set_SPARK_Pragma
(T
, SPARK_Mode_Pragma
);
3143 Set_SPARK_Pragma_Inherited
(T
);
3146 when N_Access_To_Subprogram_Definition
=>
3147 Access_Subprogram_Declaration
(T
, Def
);
3149 -- If this is a remote access to subprogram, we must create the
3150 -- equivalent fat pointer type, and related subprograms.
3153 Process_Remote_AST_Declaration
(N
);
3156 -- Validate categorization rule against access type declaration
3157 -- usually a violation in Pure unit, Shared_Passive unit.
3159 Validate_Access_Type_Declaration
(T
, N
);
3161 when N_Access_To_Object_Definition
=>
3162 Access_Type_Declaration
(T
, Def
);
3164 -- Validate categorization rule against access type declaration
3165 -- usually a violation in Pure unit, Shared_Passive unit.
3167 Validate_Access_Type_Declaration
(T
, N
);
3169 -- If we are in a Remote_Call_Interface package and define a
3170 -- RACW, then calling stubs and specific stream attributes
3174 and then Is_Remote_Access_To_Class_Wide_Type
(Def_Id
)
3176 Add_RACW_Features
(Def_Id
);
3179 when N_Array_Type_Definition
=>
3180 Array_Type_Declaration
(T
, Def
);
3182 when N_Derived_Type_Definition
=>
3183 Derived_Type_Declaration
(T
, N
, T
/= Def_Id
);
3185 -- Inherit predicates from parent, and protect against illegal
3188 if Is_Type
(T
) and then Has_Predicates
(T
) then
3189 Set_Has_Predicates
(Def_Id
);
3192 -- Save the scenario for examination by the ABE Processing
3195 Record_Elaboration_Scenario
(N
);
3197 when N_Enumeration_Type_Definition
=>
3198 Enumeration_Type_Declaration
(T
, Def
);
3200 when N_Floating_Point_Definition
=>
3201 Floating_Point_Type_Declaration
(T
, Def
);
3203 when N_Decimal_Fixed_Point_Definition
=>
3204 Decimal_Fixed_Point_Type_Declaration
(T
, Def
);
3206 when N_Ordinary_Fixed_Point_Definition
=>
3207 Ordinary_Fixed_Point_Type_Declaration
(T
, Def
);
3209 when N_Signed_Integer_Type_Definition
=>
3210 Signed_Integer_Type_Declaration
(T
, Def
);
3212 when N_Modular_Type_Definition
=>
3213 Modular_Type_Declaration
(T
, Def
);
3215 when N_Record_Definition
=>
3216 Record_Type_Declaration
(T
, N
, Prev
);
3218 -- If declaration has a parse error, nothing to elaborate.
3224 raise Program_Error
;
3228 if Etype
(T
) = Any_Type
then
3232 -- Controlled type is not allowed in SPARK
3234 if Is_Visibly_Controlled
(T
) then
3235 Check_SPARK_05_Restriction
("controlled type is not allowed", N
);
3238 -- Some common processing for all types
3240 Set_Depends_On_Private
(T
, Has_Private_Component
(T
));
3241 Check_Ops_From_Incomplete_Type
;
3243 -- Both the declared entity, and its anonymous base type if one was
3244 -- created, need freeze nodes allocated.
3247 B
: constant Entity_Id
:= Base_Type
(T
);
3250 -- In the case where the base type differs from the first subtype, we
3251 -- pre-allocate a freeze node, and set the proper link to the first
3252 -- subtype. Freeze_Entity will use this preallocated freeze node when
3253 -- it freezes the entity.
3255 -- This does not apply if the base type is a generic type, whose
3256 -- declaration is independent of the current derived definition.
3258 if B
/= T
and then not Is_Generic_Type
(B
) then
3259 Ensure_Freeze_Node
(B
);
3260 Set_First_Subtype_Link
(Freeze_Node
(B
), T
);
3263 -- A type that is imported through a limited_with clause cannot
3264 -- generate any code, and thus need not be frozen. However, an access
3265 -- type with an imported designated type needs a finalization list,
3266 -- which may be referenced in some other package that has non-limited
3267 -- visibility on the designated type. Thus we must create the
3268 -- finalization list at the point the access type is frozen, to
3269 -- prevent unsatisfied references at link time.
3271 if not From_Limited_With
(T
) or else Is_Access_Type
(T
) then
3272 Set_Has_Delayed_Freeze
(T
);
3276 -- Case where T is the full declaration of some private type which has
3277 -- been swapped in Defining_Identifier (N).
3279 if T
/= Def_Id
and then Is_Private_Type
(Def_Id
) then
3280 Process_Full_View
(N
, T
, Def_Id
);
3282 -- Record the reference. The form of this is a little strange, since
3283 -- the full declaration has been swapped in. So the first parameter
3284 -- here represents the entity to which a reference is made which is
3285 -- the "real" entity, i.e. the one swapped in, and the second
3286 -- parameter provides the reference location.
3288 -- Also, we want to kill Has_Pragma_Unreferenced temporarily here
3289 -- since we don't want a complaint about the full type being an
3290 -- unwanted reference to the private type
3293 B
: constant Boolean := Has_Pragma_Unreferenced
(T
);
3295 Set_Has_Pragma_Unreferenced
(T
, False);
3296 Generate_Reference
(T
, T
, 'c');
3297 Set_Has_Pragma_Unreferenced
(T
, B
);
3300 Set_Completion_Referenced
(Def_Id
);
3302 -- For completion of incomplete type, process incomplete dependents
3303 -- and always mark the full type as referenced (it is the incomplete
3304 -- type that we get for any real reference).
3306 elsif Ekind
(Prev
) = E_Incomplete_Type
then
3307 Process_Incomplete_Dependents
(N
, T
, Prev
);
3308 Generate_Reference
(Prev
, Def_Id
, 'c');
3309 Set_Completion_Referenced
(Def_Id
);
3311 -- If not private type or incomplete type completion, this is a real
3312 -- definition of a new entity, so record it.
3315 Generate_Definition
(Def_Id
);
3318 -- Propagate any pending access types whose finalization masters need to
3319 -- be fully initialized from the partial to the full view. Guard against
3320 -- an illegal full view that remains unanalyzed.
3322 if Is_Type
(Def_Id
) and then Is_Incomplete_Or_Private_Type
(Prev
) then
3323 Set_Pending_Access_Types
(Def_Id
, Pending_Access_Types
(Prev
));
3326 if Chars
(Scope
(Def_Id
)) = Name_System
3327 and then Chars
(Def_Id
) = Name_Address
3328 and then In_Predefined_Unit
(N
)
3330 Set_Is_Descendant_Of_Address
(Def_Id
);
3331 Set_Is_Descendant_Of_Address
(Base_Type
(Def_Id
));
3332 Set_Is_Descendant_Of_Address
(Prev
);
3335 Set_Optimize_Alignment_Flags
(Def_Id
);
3336 Check_Eliminated
(Def_Id
);
3338 -- If the declaration is a completion and aspects are present, apply
3339 -- them to the entity for the type which is currently the partial
3340 -- view, but which is the one that will be frozen.
3342 if Has_Aspects
(N
) then
3344 -- In most cases the partial view is a private type, and both views
3345 -- appear in different declarative parts. In the unusual case where
3346 -- the partial view is incomplete, perform the analysis on the
3347 -- full view, to prevent freezing anomalies with the corresponding
3348 -- class-wide type, which otherwise might be frozen before the
3349 -- dispatch table is built.
3352 and then Ekind
(Prev
) /= E_Incomplete_Type
3354 Analyze_Aspect_Specifications
(N
, Prev
);
3359 Analyze_Aspect_Specifications
(N
, Def_Id
);
3363 if Is_Derived_Type
(Prev
)
3364 and then Def_Id
/= Prev
3366 Check_Nonoverridable_Aspects
;
3368 end Analyze_Full_Type_Declaration
;
3370 ----------------------------------
3371 -- Analyze_Incomplete_Type_Decl --
3372 ----------------------------------
3374 procedure Analyze_Incomplete_Type_Decl
(N
: Node_Id
) is
3375 F
: constant Boolean := Is_Pure
(Current_Scope
);
3379 Check_SPARK_05_Restriction
("incomplete type is not allowed", N
);
3381 Generate_Definition
(Defining_Identifier
(N
));
3383 -- Process an incomplete declaration. The identifier must not have been
3384 -- declared already in the scope. However, an incomplete declaration may
3385 -- appear in the private part of a package, for a private type that has
3386 -- already been declared.
3388 -- In this case, the discriminants (if any) must match
3390 T
:= Find_Type_Name
(N
);
3392 Set_Ekind
(T
, E_Incomplete_Type
);
3394 Set_Is_First_Subtype
(T
);
3395 Init_Size_Align
(T
);
3397 -- Set the SPARK mode from the current context
3399 Set_SPARK_Pragma
(T
, SPARK_Mode_Pragma
);
3400 Set_SPARK_Pragma_Inherited
(T
);
3402 -- Ada 2005 (AI-326): Minimum decoration to give support to tagged
3403 -- incomplete types.
3405 if Tagged_Present
(N
) then
3406 Set_Is_Tagged_Type
(T
, True);
3407 Set_No_Tagged_Streams_Pragma
(T
, No_Tagged_Streams
);
3408 Make_Class_Wide_Type
(T
);
3409 Set_Direct_Primitive_Operations
(T
, New_Elmt_List
);
3412 Set_Stored_Constraint
(T
, No_Elist
);
3414 if Present
(Discriminant_Specifications
(N
)) then
3416 Process_Discriminants
(N
);
3420 -- If the type has discriminants, nontrivial subtypes may be declared
3421 -- before the full view of the type. The full views of those subtypes
3422 -- will be built after the full view of the type.
3424 Set_Private_Dependents
(T
, New_Elmt_List
);
3426 end Analyze_Incomplete_Type_Decl
;
3428 -----------------------------------
3429 -- Analyze_Interface_Declaration --
3430 -----------------------------------
3432 procedure Analyze_Interface_Declaration
(T
: Entity_Id
; Def
: Node_Id
) is
3433 CW
: constant Entity_Id
:= Class_Wide_Type
(T
);
3436 Set_Is_Tagged_Type
(T
);
3437 Set_No_Tagged_Streams_Pragma
(T
, No_Tagged_Streams
);
3439 Set_Is_Limited_Record
(T
, Limited_Present
(Def
)
3440 or else Task_Present
(Def
)
3441 or else Protected_Present
(Def
)
3442 or else Synchronized_Present
(Def
));
3444 -- Type is abstract if full declaration carries keyword, or if previous
3445 -- partial view did.
3447 Set_Is_Abstract_Type
(T
);
3448 Set_Is_Interface
(T
);
3450 -- Type is a limited interface if it includes the keyword limited, task,
3451 -- protected, or synchronized.
3453 Set_Is_Limited_Interface
3454 (T
, Limited_Present
(Def
)
3455 or else Protected_Present
(Def
)
3456 or else Synchronized_Present
(Def
)
3457 or else Task_Present
(Def
));
3459 Set_Interfaces
(T
, New_Elmt_List
);
3460 Set_Direct_Primitive_Operations
(T
, New_Elmt_List
);
3462 -- Complete the decoration of the class-wide entity if it was already
3463 -- built (i.e. during the creation of the limited view)
3465 if Present
(CW
) then
3466 Set_Is_Interface
(CW
);
3467 Set_Is_Limited_Interface
(CW
, Is_Limited_Interface
(T
));
3470 -- Check runtime support for synchronized interfaces
3472 if (Is_Task_Interface
(T
)
3473 or else Is_Protected_Interface
(T
)
3474 or else Is_Synchronized_Interface
(T
))
3475 and then not RTE_Available
(RE_Select_Specific_Data
)
3477 Error_Msg_CRT
("synchronized interfaces", T
);
3479 end Analyze_Interface_Declaration
;
3481 -----------------------------
3482 -- Analyze_Itype_Reference --
3483 -----------------------------
3485 -- Nothing to do. This node is placed in the tree only for the benefit of
3486 -- back end processing, and has no effect on the semantic processing.
3488 procedure Analyze_Itype_Reference
(N
: Node_Id
) is
3490 pragma Assert
(Is_Itype
(Itype
(N
)));
3492 end Analyze_Itype_Reference
;
3494 --------------------------------
3495 -- Analyze_Number_Declaration --
3496 --------------------------------
3498 procedure Analyze_Number_Declaration
(N
: Node_Id
) is
3499 E
: constant Node_Id
:= Expression
(N
);
3500 Id
: constant Entity_Id
:= Defining_Identifier
(N
);
3501 Index
: Interp_Index
;
3506 Generate_Definition
(Id
);
3509 -- This is an optimization of a common case of an integer literal
3511 if Nkind
(E
) = N_Integer_Literal
then
3512 Set_Is_Static_Expression
(E
, True);
3513 Set_Etype
(E
, Universal_Integer
);
3515 Set_Etype
(Id
, Universal_Integer
);
3516 Set_Ekind
(Id
, E_Named_Integer
);
3517 Set_Is_Frozen
(Id
, True);
3521 Set_Is_Pure
(Id
, Is_Pure
(Current_Scope
));
3523 -- Process expression, replacing error by integer zero, to avoid
3524 -- cascaded errors or aborts further along in the processing
3526 -- Replace Error by integer zero, which seems least likely to cause
3530 Rewrite
(E
, Make_Integer_Literal
(Sloc
(E
), Uint_0
));
3531 Set_Error_Posted
(E
);
3536 -- Verify that the expression is static and numeric. If
3537 -- the expression is overloaded, we apply the preference
3538 -- rule that favors root numeric types.
3540 if not Is_Overloaded
(E
) then
3542 if Has_Dynamic_Predicate_Aspect
(T
) then
3544 ("subtype has dynamic predicate, "
3545 & "not allowed in number declaration", N
);
3551 Get_First_Interp
(E
, Index
, It
);
3552 while Present
(It
.Typ
) loop
3553 if (Is_Integer_Type
(It
.Typ
) or else Is_Real_Type
(It
.Typ
))
3554 and then (Scope
(Base_Type
(It
.Typ
))) = Standard_Standard
3556 if T
= Any_Type
then
3559 elsif It
.Typ
= Universal_Real
3561 It
.Typ
= Universal_Integer
3563 -- Choose universal interpretation over any other
3570 Get_Next_Interp
(Index
, It
);
3574 if Is_Integer_Type
(T
) then
3576 Set_Etype
(Id
, Universal_Integer
);
3577 Set_Ekind
(Id
, E_Named_Integer
);
3579 elsif Is_Real_Type
(T
) then
3581 -- Because the real value is converted to universal_real, this is a
3582 -- legal context for a universal fixed expression.
3584 if T
= Universal_Fixed
then
3586 Loc
: constant Source_Ptr
:= Sloc
(N
);
3587 Conv
: constant Node_Id
:= Make_Type_Conversion
(Loc
,
3589 New_Occurrence_Of
(Universal_Real
, Loc
),
3590 Expression
=> Relocate_Node
(E
));
3597 elsif T
= Any_Fixed
then
3598 Error_Msg_N
("illegal context for mixed mode operation", E
);
3600 -- Expression is of the form : universal_fixed * integer. Try to
3601 -- resolve as universal_real.
3603 T
:= Universal_Real
;
3608 Set_Etype
(Id
, Universal_Real
);
3609 Set_Ekind
(Id
, E_Named_Real
);
3612 Wrong_Type
(E
, Any_Numeric
);
3616 Set_Ekind
(Id
, E_Constant
);
3617 Set_Never_Set_In_Source
(Id
, True);
3618 Set_Is_True_Constant
(Id
, True);
3622 if Nkind_In
(E
, N_Integer_Literal
, N_Real_Literal
) then
3623 Set_Etype
(E
, Etype
(Id
));
3626 if not Is_OK_Static_Expression
(E
) then
3627 Flag_Non_Static_Expr
3628 ("non-static expression used in number declaration!", E
);
3629 Rewrite
(E
, Make_Integer_Literal
(Sloc
(N
), 1));
3630 Set_Etype
(E
, Any_Type
);
3633 Analyze_Dimension
(N
);
3634 end Analyze_Number_Declaration
;
3636 --------------------------------
3637 -- Analyze_Object_Declaration --
3638 --------------------------------
3640 -- WARNING: This routine manages Ghost regions. Return statements must be
3641 -- replaced by gotos which jump to the end of the routine and restore the
3644 procedure Analyze_Object_Declaration
(N
: Node_Id
) is
3645 Loc
: constant Source_Ptr
:= Sloc
(N
);
3646 Id
: constant Entity_Id
:= Defining_Identifier
(N
);
3650 E
: Node_Id
:= Expression
(N
);
3651 -- E is set to Expression (N) throughout this routine. When Expression
3652 -- (N) is modified, E is changed accordingly.
3654 Prev_Entity
: Entity_Id
:= Empty
;
3656 procedure Check_Dynamic_Object
(Typ
: Entity_Id
);
3657 -- A library-level object with non-static discriminant constraints may
3658 -- require dynamic allocation. The declaration is illegal if the
3659 -- profile includes the restriction No_Implicit_Heap_Allocations.
3661 procedure Check_For_Null_Excluding_Components
3662 (Obj_Typ
: Entity_Id
;
3663 Obj_Decl
: Node_Id
);
3664 -- Verify that each null-excluding component of object declaration
3665 -- Obj_Decl carrying type Obj_Typ has explicit initialization. Emit
3666 -- a compile-time warning if this is not the case.
3668 function Count_Tasks
(T
: Entity_Id
) return Uint
;
3669 -- This function is called when a non-generic library level object of a
3670 -- task type is declared. Its function is to count the static number of
3671 -- tasks declared within the type (it is only called if Has_Task is set
3672 -- for T). As a side effect, if an array of tasks with non-static bounds
3673 -- or a variant record type is encountered, Check_Restriction is called
3674 -- indicating the count is unknown.
3676 function Delayed_Aspect_Present
return Boolean;
3677 -- If the declaration has an expression that is an aggregate, and it
3678 -- has aspects that require delayed analysis, the resolution of the
3679 -- aggregate must be deferred to the freeze point of the object. This
3680 -- special processing was created for address clauses, but it must
3681 -- also apply to Alignment. This must be done before the aspect
3682 -- specifications are analyzed because we must handle the aggregate
3683 -- before the analysis of the object declaration is complete.
3685 -- Any other relevant delayed aspects on object declarations ???
3687 --------------------------
3688 -- Check_Dynamic_Object --
3689 --------------------------
3691 procedure Check_Dynamic_Object
(Typ
: Entity_Id
) is
3693 Obj_Type
: Entity_Id
;
3698 if Is_Private_Type
(Obj_Type
)
3699 and then Present
(Full_View
(Obj_Type
))
3701 Obj_Type
:= Full_View
(Obj_Type
);
3704 if Known_Static_Esize
(Obj_Type
) then
3708 if Restriction_Active
(No_Implicit_Heap_Allocations
)
3709 and then Expander_Active
3710 and then Has_Discriminants
(Obj_Type
)
3712 Comp
:= First_Component
(Obj_Type
);
3713 while Present
(Comp
) loop
3714 if Known_Static_Esize
(Etype
(Comp
))
3715 or else Size_Known_At_Compile_Time
(Etype
(Comp
))
3719 elsif not Discriminated_Size
(Comp
)
3720 and then Comes_From_Source
(Comp
)
3723 ("component& of non-static size will violate restriction "
3724 & "No_Implicit_Heap_Allocation?", N
, Comp
);
3726 elsif Is_Record_Type
(Etype
(Comp
)) then
3727 Check_Dynamic_Object
(Etype
(Comp
));
3730 Next_Component
(Comp
);
3733 end Check_Dynamic_Object
;
3735 -----------------------------------------
3736 -- Check_For_Null_Excluding_Components --
3737 -----------------------------------------
3739 procedure Check_For_Null_Excluding_Components
3740 (Obj_Typ
: Entity_Id
;
3743 procedure Check_Component
3744 (Comp_Typ
: Entity_Id
;
3745 Comp_Decl
: Node_Id
:= Empty
;
3746 Array_Comp
: Boolean := False);
3747 -- Apply a compile-time null-exclusion check on a component denoted
3748 -- by its declaration Comp_Decl and type Comp_Typ, and all of its
3749 -- subcomponents (if any).
3751 ---------------------
3752 -- Check_Component --
3753 ---------------------
3755 procedure Check_Component
3756 (Comp_Typ
: Entity_Id
;
3757 Comp_Decl
: Node_Id
:= Empty
;
3758 Array_Comp
: Boolean := False)
3764 -- Do not consider internally-generated components or those that
3765 -- are already initialized.
3767 if Present
(Comp_Decl
)
3768 and then (not Comes_From_Source
(Comp_Decl
)
3769 or else Present
(Expression
(Comp_Decl
)))
3774 if Is_Incomplete_Or_Private_Type
(Comp_Typ
)
3775 and then Present
(Full_View
(Comp_Typ
))
3777 T
:= Full_View
(Comp_Typ
);
3782 -- Verify a component of a null-excluding access type
3784 if Is_Access_Type
(T
)
3785 and then Can_Never_Be_Null
(T
)
3787 if Comp_Decl
= Obj_Decl
then
3788 Null_Exclusion_Static_Checks
3791 Array_Comp
=> Array_Comp
);
3794 Null_Exclusion_Static_Checks
3797 Array_Comp
=> Array_Comp
);
3800 -- Check array components
3802 elsif Is_Array_Type
(T
) then
3804 -- There is no suitable component when the object is of an
3805 -- array type. However, a namable component may appear at some
3806 -- point during the recursive inspection, but not at the top
3807 -- level. At the top level just indicate array component case.
3809 if Comp_Decl
= Obj_Decl
then
3810 Check_Component
(Component_Type
(T
), Array_Comp
=> True);
3812 Check_Component
(Component_Type
(T
), Comp_Decl
);
3815 -- Verify all components of type T
3817 -- Note: No checks are performed on types with discriminants due
3818 -- to complexities involving variants. ???
3820 elsif (Is_Concurrent_Type
(T
)
3821 or else Is_Incomplete_Or_Private_Type
(T
)
3822 or else Is_Record_Type
(T
))
3823 and then not Has_Discriminants
(T
)
3825 Comp
:= First_Component
(T
);
3826 while Present
(Comp
) loop
3827 Check_Component
(Etype
(Comp
), Parent
(Comp
));
3829 Comp
:= Next_Component
(Comp
);
3832 end Check_Component
;
3834 -- Start processing for Check_For_Null_Excluding_Components
3837 Check_Component
(Obj_Typ
, Obj_Decl
);
3838 end Check_For_Null_Excluding_Components
;
3844 function Count_Tasks
(T
: Entity_Id
) return Uint
is
3850 if Is_Task_Type
(T
) then
3853 elsif Is_Record_Type
(T
) then
3854 if Has_Discriminants
(T
) then
3855 Check_Restriction
(Max_Tasks
, N
);
3860 C
:= First_Component
(T
);
3861 while Present
(C
) loop
3862 V
:= V
+ Count_Tasks
(Etype
(C
));
3869 elsif Is_Array_Type
(T
) then
3870 X
:= First_Index
(T
);
3871 V
:= Count_Tasks
(Component_Type
(T
));
3872 while Present
(X
) loop
3875 if not Is_OK_Static_Subtype
(C
) then
3876 Check_Restriction
(Max_Tasks
, N
);
3879 V
:= V
* (UI_Max
(Uint_0
,
3880 Expr_Value
(Type_High_Bound
(C
)) -
3881 Expr_Value
(Type_Low_Bound
(C
)) + Uint_1
));
3894 ----------------------------
3895 -- Delayed_Aspect_Present --
3896 ----------------------------
3898 function Delayed_Aspect_Present
return Boolean is
3903 if Present
(Aspect_Specifications
(N
)) then
3904 A
:= First
(Aspect_Specifications
(N
));
3905 A_Id
:= Get_Aspect_Id
(Chars
(Identifier
(A
)));
3906 while Present
(A
) loop
3907 if A_Id
= Aspect_Alignment
or else A_Id
= Aspect_Address
then
3916 end Delayed_Aspect_Present
;
3920 Saved_GM
: constant Ghost_Mode_Type
:= Ghost_Mode
;
3921 Saved_IGR
: constant Node_Id
:= Ignored_Ghost_Region
;
3922 -- Save the Ghost-related attributes to restore on exit
3924 Related_Id
: Entity_Id
;
3926 -- Start of processing for Analyze_Object_Declaration
3929 -- There are three kinds of implicit types generated by an
3930 -- object declaration:
3932 -- 1. Those generated by the original Object Definition
3934 -- 2. Those generated by the Expression
3936 -- 3. Those used to constrain the Object Definition with the
3937 -- expression constraints when the definition is unconstrained.
3939 -- They must be generated in this order to avoid order of elaboration
3940 -- issues. Thus the first step (after entering the name) is to analyze
3941 -- the object definition.
3943 if Constant_Present
(N
) then
3944 Prev_Entity
:= Current_Entity_In_Scope
(Id
);
3946 if Present
(Prev_Entity
)
3948 -- If the homograph is an implicit subprogram, it is overridden
3949 -- by the current declaration.
3951 ((Is_Overloadable
(Prev_Entity
)
3952 and then Is_Inherited_Operation
(Prev_Entity
))
3954 -- The current object is a discriminal generated for an entry
3955 -- family index. Even though the index is a constant, in this
3956 -- particular context there is no true constant redeclaration.
3957 -- Enter_Name will handle the visibility.
3960 (Is_Discriminal
(Id
)
3961 and then Ekind
(Discriminal_Link
(Id
)) =
3962 E_Entry_Index_Parameter
)
3964 -- The current object is the renaming for a generic declared
3965 -- within the instance.
3968 (Ekind
(Prev_Entity
) = E_Package
3969 and then Nkind
(Parent
(Prev_Entity
)) =
3970 N_Package_Renaming_Declaration
3971 and then not Comes_From_Source
(Prev_Entity
)
3973 Is_Generic_Instance
(Renamed_Entity
(Prev_Entity
)))
3975 -- The entity may be a homonym of a private component of the
3976 -- enclosing protected object, for which we create a local
3977 -- renaming declaration. The declaration is legal, even if
3978 -- useless when it just captures that component.
3981 (Ekind
(Scope
(Current_Scope
)) = E_Protected_Type
3982 and then Nkind
(Parent
(Prev_Entity
)) =
3983 N_Object_Renaming_Declaration
))
3985 Prev_Entity
:= Empty
;
3989 if Present
(Prev_Entity
) then
3991 -- The object declaration is Ghost when it completes a deferred Ghost
3994 Mark_And_Set_Ghost_Completion
(N
, Prev_Entity
);
3996 Constant_Redeclaration
(Id
, N
, T
);
3998 Generate_Reference
(Prev_Entity
, Id
, 'c');
3999 Set_Completion_Referenced
(Id
);
4001 if Error_Posted
(N
) then
4003 -- Type mismatch or illegal redeclaration; do not analyze
4004 -- expression to avoid cascaded errors.
4006 T
:= Find_Type_Of_Object
(Object_Definition
(N
), N
);
4008 Set_Ekind
(Id
, E_Variable
);
4012 -- In the normal case, enter identifier at the start to catch premature
4013 -- usage in the initialization expression.
4016 Generate_Definition
(Id
);
4019 Mark_Coextensions
(N
, Object_Definition
(N
));
4021 T
:= Find_Type_Of_Object
(Object_Definition
(N
), N
);
4023 if Nkind
(Object_Definition
(N
)) = N_Access_Definition
4025 (Access_To_Subprogram_Definition
(Object_Definition
(N
)))
4026 and then Protected_Present
4027 (Access_To_Subprogram_Definition
(Object_Definition
(N
)))
4029 T
:= Replace_Anonymous_Access_To_Protected_Subprogram
(N
);
4032 if Error_Posted
(Id
) then
4034 Set_Ekind
(Id
, E_Variable
);
4039 -- Ada 2005 (AI-231): Propagate the null-excluding attribute and carry
4040 -- out some static checks.
4042 if Ada_Version
>= Ada_2005
then
4044 -- In case of aggregates we must also take care of the correct
4045 -- initialization of nested aggregates bug this is done at the
4046 -- point of the analysis of the aggregate (see sem_aggr.adb) ???
4048 if Can_Never_Be_Null
(T
) then
4049 if Present
(Expression
(N
))
4050 and then Nkind
(Expression
(N
)) = N_Aggregate
4056 Save_Typ
: constant Entity_Id
:= Etype
(Id
);
4058 Set_Etype
(Id
, T
); -- Temp. decoration for static checks
4059 Null_Exclusion_Static_Checks
(N
);
4060 Set_Etype
(Id
, Save_Typ
);
4064 -- We might be dealing with an object of a composite type containing
4065 -- null-excluding components without an aggregate, so we must verify
4066 -- that such components have default initialization.
4069 Check_For_Null_Excluding_Components
(T
, N
);
4073 -- Object is marked pure if it is in a pure scope
4075 Set_Is_Pure
(Id
, Is_Pure
(Current_Scope
));
4077 -- If deferred constant, make sure context is appropriate. We detect
4078 -- a deferred constant as a constant declaration with no expression.
4079 -- A deferred constant can appear in a package body if its completion
4080 -- is by means of an interface pragma.
4082 if Constant_Present
(N
) and then No
(E
) then
4084 -- A deferred constant may appear in the declarative part of the
4085 -- following constructs:
4089 -- extended return statements
4092 -- subprogram bodies
4095 -- When declared inside a package spec, a deferred constant must be
4096 -- completed by a full constant declaration or pragma Import. In all
4097 -- other cases, the only proper completion is pragma Import. Extended
4098 -- return statements are flagged as invalid contexts because they do
4099 -- not have a declarative part and so cannot accommodate the pragma.
4101 if Ekind
(Current_Scope
) = E_Return_Statement
then
4103 ("invalid context for deferred constant declaration (RM 7.4)",
4106 ("\declaration requires an initialization expression",
4108 Set_Constant_Present
(N
, False);
4110 -- In Ada 83, deferred constant must be of private type
4112 elsif not Is_Private_Type
(T
) then
4113 if Ada_Version
= Ada_83
and then Comes_From_Source
(N
) then
4115 ("(Ada 83) deferred constant must be private type", N
);
4119 -- If not a deferred constant, then the object declaration freezes
4120 -- its type, unless the object is of an anonymous type and has delayed
4121 -- aspects. In that case the type is frozen when the object itself is.
4124 Check_Fully_Declared
(T
, N
);
4126 if Has_Delayed_Aspects
(Id
)
4127 and then Is_Array_Type
(T
)
4128 and then Is_Itype
(T
)
4130 Set_Has_Delayed_Freeze
(T
);
4132 Freeze_Before
(N
, T
);
4136 -- If the object was created by a constrained array definition, then
4137 -- set the link in both the anonymous base type and anonymous subtype
4138 -- that are built to represent the array type to point to the object.
4140 if Nkind
(Object_Definition
(Declaration_Node
(Id
))) =
4141 N_Constrained_Array_Definition
4143 Set_Related_Array_Object
(T
, Id
);
4144 Set_Related_Array_Object
(Base_Type
(T
), Id
);
4147 -- Special checks for protected objects not at library level
4149 if Has_Protected
(T
) and then not Is_Library_Level_Entity
(Id
) then
4150 Check_Restriction
(No_Local_Protected_Objects
, Id
);
4152 -- Protected objects with interrupt handlers must be at library level
4154 -- Ada 2005: This test is not needed (and the corresponding clause
4155 -- in the RM is removed) because accessibility checks are sufficient
4156 -- to make handlers not at the library level illegal.
4158 -- AI05-0303: The AI is in fact a binding interpretation, and thus
4159 -- applies to the '95 version of the language as well.
4161 if Is_Protected_Type
(T
)
4162 and then Has_Interrupt_Handler
(T
)
4163 and then Ada_Version
< Ada_95
4166 ("interrupt object can only be declared at library level", Id
);
4170 -- Check for violation of No_Local_Timing_Events
4172 if Has_Timing_Event
(T
) and then not Is_Library_Level_Entity
(Id
) then
4173 Check_Restriction
(No_Local_Timing_Events
, Id
);
4176 -- The actual subtype of the object is the nominal subtype, unless
4177 -- the nominal one is unconstrained and obtained from the expression.
4181 -- These checks should be performed before the initialization expression
4182 -- is considered, so that the Object_Definition node is still the same
4183 -- as in source code.
4185 -- In SPARK, the nominal subtype is always given by a subtype mark
4186 -- and must not be unconstrained. (The only exception to this is the
4187 -- acceptance of declarations of constants of type String.)
4189 if not Nkind_In
(Object_Definition
(N
), N_Expanded_Name
, N_Identifier
)
4191 Check_SPARK_05_Restriction
4192 ("subtype mark required", Object_Definition
(N
));
4194 elsif Is_Array_Type
(T
)
4195 and then not Is_Constrained
(T
)
4196 and then T
/= Standard_String
4198 Check_SPARK_05_Restriction
4199 ("subtype mark of constrained type expected",
4200 Object_Definition
(N
));
4203 if Is_Library_Level_Entity
(Id
) then
4204 Check_Dynamic_Object
(T
);
4207 -- There are no aliased objects in SPARK
4209 if Aliased_Present
(N
) then
4210 Check_SPARK_05_Restriction
("aliased object is not allowed", N
);
4213 -- Process initialization expression if present and not in error
4215 if Present
(E
) and then E
/= Error
then
4217 -- Generate an error in case of CPP class-wide object initialization.
4218 -- Required because otherwise the expansion of the class-wide
4219 -- assignment would try to use 'size to initialize the object
4220 -- (primitive that is not available in CPP tagged types).
4222 if Is_Class_Wide_Type
(Act_T
)
4224 (Is_CPP_Class
(Root_Type
(Etype
(Act_T
)))
4226 (Present
(Full_View
(Root_Type
(Etype
(Act_T
))))
4228 Is_CPP_Class
(Full_View
(Root_Type
(Etype
(Act_T
))))))
4231 ("predefined assignment not available for 'C'P'P tagged types",
4235 Mark_Coextensions
(N
, E
);
4238 -- In case of errors detected in the analysis of the expression,
4239 -- decorate it with the expected type to avoid cascaded errors
4241 if No
(Etype
(E
)) then
4245 -- If an initialization expression is present, then we set the
4246 -- Is_True_Constant flag. It will be reset if this is a variable
4247 -- and it is indeed modified.
4249 Set_Is_True_Constant
(Id
, True);
4251 -- If we are analyzing a constant declaration, set its completion
4252 -- flag after analyzing and resolving the expression.
4254 if Constant_Present
(N
) then
4255 Set_Has_Completion
(Id
);
4258 -- Set type and resolve (type may be overridden later on). Note:
4259 -- Ekind (Id) must still be E_Void at this point so that incorrect
4260 -- early usage within E is properly diagnosed.
4264 -- If the expression is an aggregate we must look ahead to detect
4265 -- the possible presence of an address clause, and defer resolution
4266 -- and expansion of the aggregate to the freeze point of the entity.
4268 -- This is not always legal because the aggregate may contain other
4269 -- references that need freezing, e.g. references to other entities
4270 -- with address clauses. In any case, when compiling with -gnatI the
4271 -- presence of the address clause must be ignored.
4273 if Comes_From_Source
(N
)
4274 and then Expander_Active
4275 and then Nkind
(E
) = N_Aggregate
4277 ((Present
(Following_Address_Clause
(N
))
4278 and then not Ignore_Rep_Clauses
)
4279 or else Delayed_Aspect_Present
)
4285 -- If the expression is a formal that is a "subprogram pointer"
4286 -- this is illegal in accessibility terms. Add an explicit
4287 -- conversion to force the corresponding check, as is done for
4290 if Comes_From_Source
(N
)
4291 and then Is_Entity_Name
(E
)
4292 and then Present
(Entity
(E
))
4293 and then Is_Formal
(Entity
(E
))
4295 Ekind
(Etype
(Entity
(E
))) = E_Anonymous_Access_Subprogram_Type
4296 and then Ekind
(T
) /= E_Anonymous_Access_Subprogram_Type
4298 Rewrite
(E
, Convert_To
(T
, Relocate_Node
(E
)));
4304 -- No further action needed if E is a call to an inlined function
4305 -- which returns an unconstrained type and it has been expanded into
4306 -- a procedure call. In that case N has been replaced by an object
4307 -- declaration without initializing expression and it has been
4308 -- analyzed (see Expand_Inlined_Call).
4310 if Back_End_Inlining
4311 and then Expander_Active
4312 and then Nkind
(E
) = N_Function_Call
4313 and then Nkind
(Name
(E
)) in N_Has_Entity
4314 and then Is_Inlined
(Entity
(Name
(E
)))
4315 and then not Is_Constrained
(Etype
(E
))
4316 and then Analyzed
(N
)
4317 and then No
(Expression
(N
))
4322 -- If E is null and has been replaced by an N_Raise_Constraint_Error
4323 -- node (which was marked already-analyzed), we need to set the type
4324 -- to something other than Any_Access in order to keep gigi happy.
4326 if Etype
(E
) = Any_Access
then
4330 -- If the object is an access to variable, the initialization
4331 -- expression cannot be an access to constant.
4333 if Is_Access_Type
(T
)
4334 and then not Is_Access_Constant
(T
)
4335 and then Is_Access_Type
(Etype
(E
))
4336 and then Is_Access_Constant
(Etype
(E
))
4339 ("access to variable cannot be initialized with an "
4340 & "access-to-constant expression", E
);
4343 if not Assignment_OK
(N
) then
4344 Check_Initialization
(T
, E
);
4347 Check_Unset_Reference
(E
);
4349 -- If this is a variable, then set current value. If this is a
4350 -- declared constant of a scalar type with a static expression,
4351 -- indicate that it is always valid.
4353 if not Constant_Present
(N
) then
4354 if Compile_Time_Known_Value
(E
) then
4355 Set_Current_Value
(Id
, E
);
4358 elsif Is_Scalar_Type
(T
) and then Is_OK_Static_Expression
(E
) then
4359 Set_Is_Known_Valid
(Id
);
4362 -- Deal with setting of null flags
4364 if Is_Access_Type
(T
) then
4365 if Known_Non_Null
(E
) then
4366 Set_Is_Known_Non_Null
(Id
, True);
4367 elsif Known_Null
(E
) and then not Can_Never_Be_Null
(Id
) then
4368 Set_Is_Known_Null
(Id
, True);
4372 -- Check incorrect use of dynamically tagged expressions
4374 if Is_Tagged_Type
(T
) then
4375 Check_Dynamically_Tagged_Expression
4381 Apply_Scalar_Range_Check
(E
, T
);
4382 Apply_Static_Length_Check
(E
, T
);
4384 if Nkind
(Original_Node
(N
)) = N_Object_Declaration
4385 and then Comes_From_Source
(Original_Node
(N
))
4387 -- Only call test if needed
4389 and then Restriction_Check_Required
(SPARK_05
)
4390 and then not Is_SPARK_05_Initialization_Expr
(Original_Node
(E
))
4392 Check_SPARK_05_Restriction
4393 ("initialization expression is not appropriate", E
);
4396 -- A formal parameter of a specific tagged type whose related
4397 -- subprogram is subject to pragma Extensions_Visible with value
4398 -- "False" cannot be implicitly converted to a class-wide type by
4399 -- means of an initialization expression (SPARK RM 6.1.7(3)). Do
4400 -- not consider internally generated expressions.
4402 if Is_Class_Wide_Type
(T
)
4403 and then Comes_From_Source
(E
)
4404 and then Is_EVF_Expression
(E
)
4407 ("formal parameter cannot be implicitly converted to "
4408 & "class-wide type when Extensions_Visible is False", E
);
4412 -- If the No_Streams restriction is set, check that the type of the
4413 -- object is not, and does not contain, any subtype derived from
4414 -- Ada.Streams.Root_Stream_Type. Note that we guard the call to
4415 -- Has_Stream just for efficiency reasons. There is no point in
4416 -- spending time on a Has_Stream check if the restriction is not set.
4418 if Restriction_Check_Required
(No_Streams
) then
4419 if Has_Stream
(T
) then
4420 Check_Restriction
(No_Streams
, N
);
4424 -- Deal with predicate check before we start to do major rewriting. It
4425 -- is OK to initialize and then check the initialized value, since the
4426 -- object goes out of scope if we get a predicate failure. Note that we
4427 -- do this in the analyzer and not the expander because the analyzer
4428 -- does some substantial rewriting in some cases.
4430 -- We need a predicate check if the type has predicates that are not
4431 -- ignored, and if either there is an initializing expression, or for
4432 -- default initialization when we have at least one case of an explicit
4433 -- default initial value and then this is not an internal declaration
4434 -- whose initialization comes later (as for an aggregate expansion).
4436 if not Suppress_Assignment_Checks
(N
)
4437 and then Present
(Predicate_Function
(T
))
4438 and then not Predicates_Ignored
(T
)
4439 and then not No_Initialization
(N
)
4443 Is_Partially_Initialized_Type
(T
, Include_Implicit
=> False))
4445 -- If the type has a static predicate and the expression is known at
4446 -- compile time, see if the expression satisfies the predicate.
4449 Check_Expression_Against_Static_Predicate
(E
, T
);
4452 -- If the type is a null record and there is no explicit initial
4453 -- expression, no predicate check applies.
4455 if No
(E
) and then Is_Null_Record_Type
(T
) then
4458 -- Do not generate a predicate check if the initialization expression
4459 -- is a type conversion because the conversion has been subjected to
4460 -- the same check. This is a small optimization which avoid redundant
4463 elsif Present
(E
) and then Nkind
(E
) = N_Type_Conversion
then
4468 Make_Predicate_Check
(T
, New_Occurrence_Of
(Id
, Loc
)));
4472 -- Case of unconstrained type
4474 if not Is_Definite_Subtype
(T
) then
4476 -- In SPARK, a declaration of unconstrained type is allowed
4477 -- only for constants of type string.
4479 if Is_String_Type
(T
) and then not Constant_Present
(N
) then
4480 Check_SPARK_05_Restriction
4481 ("declaration of object of unconstrained type not allowed", N
);
4484 -- Nothing to do in deferred constant case
4486 if Constant_Present
(N
) and then No
(E
) then
4489 -- Case of no initialization present
4492 if No_Initialization
(N
) then
4495 elsif Is_Class_Wide_Type
(T
) then
4497 ("initialization required in class-wide declaration ", N
);
4501 ("unconstrained subtype not allowed (need initialization)",
4502 Object_Definition
(N
));
4504 if Is_Record_Type
(T
) and then Has_Discriminants
(T
) then
4506 ("\provide initial value or explicit discriminant values",
4507 Object_Definition
(N
));
4510 ("\or give default discriminant values for type&",
4511 Object_Definition
(N
), T
);
4513 elsif Is_Array_Type
(T
) then
4515 ("\provide initial value or explicit array bounds",
4516 Object_Definition
(N
));
4520 -- Case of initialization present but in error. Set initial
4521 -- expression as absent (but do not make above complaints)
4523 elsif E
= Error
then
4524 Set_Expression
(N
, Empty
);
4527 -- Case of initialization present
4530 -- Check restrictions in Ada 83
4532 if not Constant_Present
(N
) then
4534 -- Unconstrained variables not allowed in Ada 83 mode
4536 if Ada_Version
= Ada_83
4537 and then Comes_From_Source
(Object_Definition
(N
))
4540 ("(Ada 83) unconstrained variable not allowed",
4541 Object_Definition
(N
));
4545 -- Now we constrain the variable from the initializing expression
4547 -- If the expression is an aggregate, it has been expanded into
4548 -- individual assignments. Retrieve the actual type from the
4549 -- expanded construct.
4551 if Is_Array_Type
(T
)
4552 and then No_Initialization
(N
)
4553 and then Nkind
(Original_Node
(E
)) = N_Aggregate
4557 -- In case of class-wide interface object declarations we delay
4558 -- the generation of the equivalent record type declarations until
4559 -- its expansion because there are cases in they are not required.
4561 elsif Is_Interface
(T
) then
4564 -- In GNATprove mode, Expand_Subtype_From_Expr does nothing. Thus,
4565 -- we should prevent the generation of another Itype with the
4566 -- same name as the one already generated, or we end up with
4567 -- two identical types in GNATprove.
4569 elsif GNATprove_Mode
then
4572 -- If the type is an unchecked union, no subtype can be built from
4573 -- the expression. Rewrite declaration as a renaming, which the
4574 -- back-end can handle properly. This is a rather unusual case,
4575 -- because most unchecked_union declarations have default values
4576 -- for discriminants and are thus not indefinite.
4578 elsif Is_Unchecked_Union
(T
) then
4579 if Constant_Present
(N
) or else Nkind
(E
) = N_Function_Call
then
4580 Set_Ekind
(Id
, E_Constant
);
4582 Set_Ekind
(Id
, E_Variable
);
4586 Make_Object_Renaming_Declaration
(Loc
,
4587 Defining_Identifier
=> Id
,
4588 Subtype_Mark
=> New_Occurrence_Of
(T
, Loc
),
4591 Set_Renamed_Object
(Id
, E
);
4592 Freeze_Before
(N
, T
);
4597 -- Ensure that the generated subtype has a unique external name
4598 -- when the related object is public. This guarantees that the
4599 -- subtype and its bounds will not be affected by switches or
4600 -- pragmas that may offset the internal counter due to extra
4603 if Is_Public
(Id
) then
4606 Related_Id
:= Empty
;
4609 Expand_Subtype_From_Expr
4612 Subtype_Indic
=> Object_Definition
(N
),
4614 Related_Id
=> Related_Id
);
4616 Act_T
:= Find_Type_Of_Object
(Object_Definition
(N
), N
);
4619 Set_Is_Constr_Subt_For_U_Nominal
(Act_T
);
4621 if Aliased_Present
(N
) then
4622 Set_Is_Constr_Subt_For_UN_Aliased
(Act_T
);
4625 Freeze_Before
(N
, Act_T
);
4626 Freeze_Before
(N
, T
);
4629 elsif Is_Array_Type
(T
)
4630 and then No_Initialization
(N
)
4631 and then (Nkind
(Original_Node
(E
)) = N_Aggregate
4632 or else (Nkind
(Original_Node
(E
)) = N_Qualified_Expression
4633 and then Nkind
(Original_Node
(Expression
4634 (Original_Node
(E
)))) = N_Aggregate
))
4636 if not Is_Entity_Name
(Object_Definition
(N
)) then
4638 Check_Compile_Time_Size
(Act_T
);
4640 if Aliased_Present
(N
) then
4641 Set_Is_Constr_Subt_For_UN_Aliased
(Act_T
);
4645 -- When the given object definition and the aggregate are specified
4646 -- independently, and their lengths might differ do a length check.
4647 -- This cannot happen if the aggregate is of the form (others =>...)
4649 if not Is_Constrained
(T
) then
4652 elsif Nkind
(E
) = N_Raise_Constraint_Error
then
4654 -- Aggregate is statically illegal. Place back in declaration
4656 Set_Expression
(N
, E
);
4657 Set_No_Initialization
(N
, False);
4659 elsif T
= Etype
(E
) then
4662 elsif Nkind
(E
) = N_Aggregate
4663 and then Present
(Component_Associations
(E
))
4664 and then Present
(Choice_List
(First
(Component_Associations
(E
))))
4666 Nkind
(First
(Choice_List
(First
(Component_Associations
(E
))))) =
4672 Apply_Length_Check
(E
, T
);
4675 -- If the type is limited unconstrained with defaulted discriminants and
4676 -- there is no expression, then the object is constrained by the
4677 -- defaults, so it is worthwhile building the corresponding subtype.
4679 elsif (Is_Limited_Record
(T
) or else Is_Concurrent_Type
(T
))
4680 and then not Is_Constrained
(T
)
4681 and then Has_Discriminants
(T
)
4684 Act_T
:= Build_Default_Subtype
(T
, N
);
4686 -- Ada 2005: A limited object may be initialized by means of an
4687 -- aggregate. If the type has default discriminants it has an
4688 -- unconstrained nominal type, Its actual subtype will be obtained
4689 -- from the aggregate, and not from the default discriminants.
4694 Rewrite
(Object_Definition
(N
), New_Occurrence_Of
(Act_T
, Loc
));
4696 elsif Nkind
(E
) = N_Function_Call
4697 and then Constant_Present
(N
)
4698 and then Has_Unconstrained_Elements
(Etype
(E
))
4700 -- The back-end has problems with constants of a discriminated type
4701 -- with defaults, if the initial value is a function call. We
4702 -- generate an intermediate temporary that will receive a reference
4703 -- to the result of the call. The initialization expression then
4704 -- becomes a dereference of that temporary.
4706 Remove_Side_Effects
(E
);
4708 -- If this is a constant declaration of an unconstrained type and
4709 -- the initialization is an aggregate, we can use the subtype of the
4710 -- aggregate for the declared entity because it is immutable.
4712 elsif not Is_Constrained
(T
)
4713 and then Has_Discriminants
(T
)
4714 and then Constant_Present
(N
)
4715 and then not Has_Unchecked_Union
(T
)
4716 and then Nkind
(E
) = N_Aggregate
4721 -- Check No_Wide_Characters restriction
4723 Check_Wide_Character_Restriction
(T
, Object_Definition
(N
));
4725 -- Indicate this is not set in source. Certainly true for constants, and
4726 -- true for variables so far (will be reset for a variable if and when
4727 -- we encounter a modification in the source).
4729 Set_Never_Set_In_Source
(Id
);
4731 -- Now establish the proper kind and type of the object
4733 if Constant_Present
(N
) then
4734 Set_Ekind
(Id
, E_Constant
);
4735 Set_Is_True_Constant
(Id
);
4738 Set_Ekind
(Id
, E_Variable
);
4740 -- A variable is set as shared passive if it appears in a shared
4741 -- passive package, and is at the outer level. This is not done for
4742 -- entities generated during expansion, because those are always
4743 -- manipulated locally.
4745 if Is_Shared_Passive
(Current_Scope
)
4746 and then Is_Library_Level_Entity
(Id
)
4747 and then Comes_From_Source
(Id
)
4749 Set_Is_Shared_Passive
(Id
);
4750 Check_Shared_Var
(Id
, T
, N
);
4753 -- Set Has_Initial_Value if initializing expression present. Note
4754 -- that if there is no initializing expression, we leave the state
4755 -- of this flag unchanged (usually it will be False, but notably in
4756 -- the case of exception choice variables, it will already be true).
4759 Set_Has_Initial_Value
(Id
);
4763 -- Set the SPARK mode from the current context (may be overwritten later
4764 -- with explicit pragma).
4766 Set_SPARK_Pragma
(Id
, SPARK_Mode_Pragma
);
4767 Set_SPARK_Pragma_Inherited
(Id
);
4769 -- Preserve relevant elaboration-related attributes of the context which
4770 -- are no longer available or very expensive to recompute once analysis,
4771 -- resolution, and expansion are over.
4773 Mark_Elaboration_Attributes
4778 -- Initialize alignment and size and capture alignment setting
4780 Init_Alignment
(Id
);
4782 Set_Optimize_Alignment_Flags
(Id
);
4784 -- Deal with aliased case
4786 if Aliased_Present
(N
) then
4787 Set_Is_Aliased
(Id
);
4789 -- If the object is aliased and the type is unconstrained with
4790 -- defaulted discriminants and there is no expression, then the
4791 -- object is constrained by the defaults, so it is worthwhile
4792 -- building the corresponding subtype.
4794 -- Ada 2005 (AI-363): If the aliased object is discriminated and
4795 -- unconstrained, then only establish an actual subtype if the
4796 -- nominal subtype is indefinite. In definite cases the object is
4797 -- unconstrained in Ada 2005.
4800 and then Is_Record_Type
(T
)
4801 and then not Is_Constrained
(T
)
4802 and then Has_Discriminants
(T
)
4803 and then (Ada_Version
< Ada_2005
4804 or else not Is_Definite_Subtype
(T
))
4806 Set_Actual_Subtype
(Id
, Build_Default_Subtype
(T
, N
));
4810 -- Now we can set the type of the object
4812 Set_Etype
(Id
, Act_T
);
4814 -- Non-constant object is marked to be treated as volatile if type is
4815 -- volatile and we clear the Current_Value setting that may have been
4816 -- set above. Doing so for constants isn't required and might interfere
4817 -- with possible uses of the object as a static expression in contexts
4818 -- incompatible with volatility (e.g. as a case-statement alternative).
4820 if Ekind
(Id
) /= E_Constant
and then Treat_As_Volatile
(Etype
(Id
)) then
4821 Set_Treat_As_Volatile
(Id
);
4822 Set_Current_Value
(Id
, Empty
);
4825 -- Deal with controlled types
4827 if Has_Controlled_Component
(Etype
(Id
))
4828 or else Is_Controlled
(Etype
(Id
))
4830 if not Is_Library_Level_Entity
(Id
) then
4831 Check_Restriction
(No_Nested_Finalization
, N
);
4833 Validate_Controlled_Object
(Id
);
4837 if Has_Task
(Etype
(Id
)) then
4838 Check_Restriction
(No_Tasking
, N
);
4840 -- Deal with counting max tasks
4842 -- Nothing to do if inside a generic
4844 if Inside_A_Generic
then
4847 -- If library level entity, then count tasks
4849 elsif Is_Library_Level_Entity
(Id
) then
4850 Check_Restriction
(Max_Tasks
, N
, Count_Tasks
(Etype
(Id
)));
4852 -- If not library level entity, then indicate we don't know max
4853 -- tasks and also check task hierarchy restriction and blocking
4854 -- operation (since starting a task is definitely blocking).
4857 Check_Restriction
(Max_Tasks
, N
);
4858 Check_Restriction
(No_Task_Hierarchy
, N
);
4859 Check_Potentially_Blocking_Operation
(N
);
4862 -- A rather specialized test. If we see two tasks being declared
4863 -- of the same type in the same object declaration, and the task
4864 -- has an entry with an address clause, we know that program error
4865 -- will be raised at run time since we can't have two tasks with
4866 -- entries at the same address.
4868 if Is_Task_Type
(Etype
(Id
)) and then More_Ids
(N
) then
4873 E
:= First_Entity
(Etype
(Id
));
4874 while Present
(E
) loop
4875 if Ekind
(E
) = E_Entry
4876 and then Present
(Get_Attribute_Definition_Clause
4877 (E
, Attribute_Address
))
4879 Error_Msg_Warn
:= SPARK_Mode
/= On
;
4881 ("more than one task with same entry address<<", N
);
4882 Error_Msg_N
("\Program_Error [<<", N
);
4884 Make_Raise_Program_Error
(Loc
,
4885 Reason
=> PE_Duplicated_Entry_Address
));
4895 -- Some simple constant-propagation: if the expression is a constant
4896 -- string initialized with a literal, share the literal. This avoids
4900 and then Is_Entity_Name
(E
)
4901 and then Ekind
(Entity
(E
)) = E_Constant
4902 and then Base_Type
(Etype
(E
)) = Standard_String
4905 Val
: constant Node_Id
:= Constant_Value
(Entity
(E
));
4907 if Present
(Val
) and then Nkind
(Val
) = N_String_Literal
then
4908 Rewrite
(E
, New_Copy
(Val
));
4913 -- Another optimization: if the nominal subtype is unconstrained and
4914 -- the expression is a function call that returns an unconstrained
4915 -- type, rewrite the declaration as a renaming of the result of the
4916 -- call. The exceptions below are cases where the copy is expected,
4917 -- either by the back end (Aliased case) or by the semantics, as for
4918 -- initializing controlled types or copying tags for class-wide types.
4921 and then Nkind
(E
) = N_Explicit_Dereference
4922 and then Nkind
(Original_Node
(E
)) = N_Function_Call
4923 and then not Is_Library_Level_Entity
(Id
)
4924 and then not Is_Constrained
(Underlying_Type
(T
))
4925 and then not Is_Aliased
(Id
)
4926 and then not Is_Class_Wide_Type
(T
)
4927 and then not Is_Controlled
(T
)
4928 and then not Has_Controlled_Component
(Base_Type
(T
))
4929 and then Expander_Active
4932 Make_Object_Renaming_Declaration
(Loc
,
4933 Defining_Identifier
=> Id
,
4934 Access_Definition
=> Empty
,
4935 Subtype_Mark
=> New_Occurrence_Of
4936 (Base_Type
(Etype
(Id
)), Loc
),
4939 Set_Renamed_Object
(Id
, E
);
4941 -- Force generation of debugging information for the constant and for
4942 -- the renamed function call.
4944 Set_Debug_Info_Needed
(Id
);
4945 Set_Debug_Info_Needed
(Entity
(Prefix
(E
)));
4948 if Present
(Prev_Entity
)
4949 and then Is_Frozen
(Prev_Entity
)
4950 and then not Error_Posted
(Id
)
4952 Error_Msg_N
("full constant declaration appears too late", N
);
4955 Check_Eliminated
(Id
);
4957 -- Deal with setting In_Private_Part flag if in private part
4959 if Ekind
(Scope
(Id
)) = E_Package
4960 and then In_Private_Part
(Scope
(Id
))
4962 Set_In_Private_Part
(Id
);
4966 -- Initialize the refined state of a variable here because this is a
4967 -- common destination for legal and illegal object declarations.
4969 if Ekind
(Id
) = E_Variable
then
4970 Set_Encapsulating_State
(Id
, Empty
);
4973 if Has_Aspects
(N
) then
4974 Analyze_Aspect_Specifications
(N
, Id
);
4977 Analyze_Dimension
(N
);
4979 -- Verify whether the object declaration introduces an illegal hidden
4980 -- state within a package subject to a null abstract state.
4982 if Ekind
(Id
) = E_Variable
then
4983 Check_No_Hidden_State
(Id
);
4986 Restore_Ghost_Region
(Saved_GM
, Saved_IGR
);
4987 end Analyze_Object_Declaration
;
4989 ---------------------------
4990 -- Analyze_Others_Choice --
4991 ---------------------------
4993 -- Nothing to do for the others choice node itself, the semantic analysis
4994 -- of the others choice will occur as part of the processing of the parent
4996 procedure Analyze_Others_Choice
(N
: Node_Id
) is
4997 pragma Warnings
(Off
, N
);
5000 end Analyze_Others_Choice
;
5002 -------------------------------------------
5003 -- Analyze_Private_Extension_Declaration --
5004 -------------------------------------------
5006 procedure Analyze_Private_Extension_Declaration
(N
: Node_Id
) is
5007 Indic
: constant Node_Id
:= Subtype_Indication
(N
);
5008 T
: constant Entity_Id
:= Defining_Identifier
(N
);
5010 Iface_Elmt
: Elmt_Id
;
5011 Parent_Base
: Entity_Id
;
5012 Parent_Type
: Entity_Id
;
5015 -- Ada 2005 (AI-251): Decorate all names in list of ancestor interfaces
5017 if Is_Non_Empty_List
(Interface_List
(N
)) then
5023 Intf
:= First
(Interface_List
(N
));
5024 while Present
(Intf
) loop
5025 T
:= Find_Type_Of_Subtype_Indic
(Intf
);
5027 Diagnose_Interface
(Intf
, T
);
5033 Generate_Definition
(T
);
5035 -- For other than Ada 2012, just enter the name in the current scope
5037 if Ada_Version
< Ada_2012
then
5040 -- Ada 2012 (AI05-0162): Enter the name in the current scope handling
5041 -- case of private type that completes an incomplete type.
5048 Prev
:= Find_Type_Name
(N
);
5050 pragma Assert
(Prev
= T
5051 or else (Ekind
(Prev
) = E_Incomplete_Type
5052 and then Present
(Full_View
(Prev
))
5053 and then Full_View
(Prev
) = T
));
5057 Parent_Type
:= Find_Type_Of_Subtype_Indic
(Indic
);
5058 Parent_Base
:= Base_Type
(Parent_Type
);
5060 if Parent_Type
= Any_Type
or else Etype
(Parent_Type
) = Any_Type
then
5061 Set_Ekind
(T
, Ekind
(Parent_Type
));
5062 Set_Etype
(T
, Any_Type
);
5065 elsif not Is_Tagged_Type
(Parent_Type
) then
5067 ("parent of type extension must be a tagged type ", Indic
);
5070 elsif Ekind_In
(Parent_Type
, E_Void
, E_Incomplete_Type
) then
5071 Error_Msg_N
("premature derivation of incomplete type", Indic
);
5074 elsif Is_Concurrent_Type
(Parent_Type
) then
5076 ("parent type of a private extension cannot be a synchronized "
5077 & "tagged type (RM 3.9.1 (3/1))", N
);
5079 Set_Etype
(T
, Any_Type
);
5080 Set_Ekind
(T
, E_Limited_Private_Type
);
5081 Set_Private_Dependents
(T
, New_Elmt_List
);
5082 Set_Error_Posted
(T
);
5086 -- Perhaps the parent type should be changed to the class-wide type's
5087 -- specific type in this case to prevent cascading errors ???
5089 if Is_Class_Wide_Type
(Parent_Type
) then
5091 ("parent of type extension must not be a class-wide type", Indic
);
5095 if (not Is_Package_Or_Generic_Package
(Current_Scope
)
5096 and then Nkind
(Parent
(N
)) /= N_Generic_Subprogram_Declaration
)
5097 or else In_Private_Part
(Current_Scope
)
5099 Error_Msg_N
("invalid context for private extension", N
);
5102 -- Set common attributes
5104 Set_Is_Pure
(T
, Is_Pure
(Current_Scope
));
5105 Set_Scope
(T
, Current_Scope
);
5106 Set_Ekind
(T
, E_Record_Type_With_Private
);
5107 Init_Size_Align
(T
);
5108 Set_Default_SSO
(T
);
5109 Set_No_Reordering
(T
, No_Component_Reordering
);
5111 Set_Etype
(T
, Parent_Base
);
5112 Propagate_Concurrent_Flags
(T
, Parent_Base
);
5114 Set_Convention
(T
, Convention
(Parent_Type
));
5115 Set_First_Rep_Item
(T
, First_Rep_Item
(Parent_Type
));
5116 Set_Is_First_Subtype
(T
);
5117 Make_Class_Wide_Type
(T
);
5119 -- Set the SPARK mode from the current context
5121 Set_SPARK_Pragma
(T
, SPARK_Mode_Pragma
);
5122 Set_SPARK_Pragma_Inherited
(T
);
5124 if Unknown_Discriminants_Present
(N
) then
5125 Set_Discriminant_Constraint
(T
, No_Elist
);
5128 Build_Derived_Record_Type
(N
, Parent_Type
, T
);
5130 -- A private extension inherits the Default_Initial_Condition pragma
5131 -- coming from any parent type within the derivation chain.
5133 if Has_DIC
(Parent_Type
) then
5134 Set_Has_Inherited_DIC
(T
);
5137 -- A private extension inherits any class-wide invariants coming from a
5138 -- parent type or an interface. Note that the invariant procedure of the
5139 -- parent type should not be inherited because the private extension may
5140 -- define invariants of its own.
5142 if Has_Inherited_Invariants
(Parent_Type
)
5143 or else Has_Inheritable_Invariants
(Parent_Type
)
5145 Set_Has_Inherited_Invariants
(T
);
5147 elsif Present
(Interfaces
(T
)) then
5148 Iface_Elmt
:= First_Elmt
(Interfaces
(T
));
5149 while Present
(Iface_Elmt
) loop
5150 Iface
:= Node
(Iface_Elmt
);
5152 if Has_Inheritable_Invariants
(Iface
) then
5153 Set_Has_Inherited_Invariants
(T
);
5157 Next_Elmt
(Iface_Elmt
);
5161 -- Ada 2005 (AI-443): Synchronized private extension or a rewritten
5162 -- synchronized formal derived type.
5164 if Ada_Version
>= Ada_2005
and then Synchronized_Present
(N
) then
5165 Set_Is_Limited_Record
(T
);
5167 -- Formal derived type case
5169 if Is_Generic_Type
(T
) then
5171 -- The parent must be a tagged limited type or a synchronized
5174 if (not Is_Tagged_Type
(Parent_Type
)
5175 or else not Is_Limited_Type
(Parent_Type
))
5177 (not Is_Interface
(Parent_Type
)
5178 or else not Is_Synchronized_Interface
(Parent_Type
))
5181 ("parent type of & must be tagged limited or synchronized",
5185 -- The progenitors (if any) must be limited or synchronized
5188 if Present
(Interfaces
(T
)) then
5189 Iface_Elmt
:= First_Elmt
(Interfaces
(T
));
5190 while Present
(Iface_Elmt
) loop
5191 Iface
:= Node
(Iface_Elmt
);
5193 if not Is_Limited_Interface
(Iface
)
5194 and then not Is_Synchronized_Interface
(Iface
)
5197 ("progenitor & must be limited or synchronized",
5201 Next_Elmt
(Iface_Elmt
);
5205 -- Regular derived extension, the parent must be a limited or
5206 -- synchronized interface.
5209 if not Is_Interface
(Parent_Type
)
5210 or else (not Is_Limited_Interface
(Parent_Type
)
5211 and then not Is_Synchronized_Interface
(Parent_Type
))
5214 ("parent type of & must be limited interface", N
, T
);
5218 -- A consequence of 3.9.4 (6/2) and 7.3 (7.2/2) is that a private
5219 -- extension with a synchronized parent must be explicitly declared
5220 -- synchronized, because the full view will be a synchronized type.
5221 -- This must be checked before the check for limited types below,
5222 -- to ensure that types declared limited are not allowed to extend
5223 -- synchronized interfaces.
5225 elsif Is_Interface
(Parent_Type
)
5226 and then Is_Synchronized_Interface
(Parent_Type
)
5227 and then not Synchronized_Present
(N
)
5230 ("private extension of& must be explicitly synchronized",
5233 elsif Limited_Present
(N
) then
5234 Set_Is_Limited_Record
(T
);
5236 if not Is_Limited_Type
(Parent_Type
)
5238 (not Is_Interface
(Parent_Type
)
5239 or else not Is_Limited_Interface
(Parent_Type
))
5241 Error_Msg_NE
("parent type& of limited extension must be limited",
5246 -- Remember that its parent type has a private extension. Used to warn
5247 -- on public primitives of the parent type defined after its private
5248 -- extensions (see Check_Dispatching_Operation).
5250 Set_Has_Private_Extension
(Parent_Type
);
5253 if Has_Aspects
(N
) then
5254 Analyze_Aspect_Specifications
(N
, T
);
5256 end Analyze_Private_Extension_Declaration
;
5258 ---------------------------------
5259 -- Analyze_Subtype_Declaration --
5260 ---------------------------------
5262 procedure Analyze_Subtype_Declaration
5264 Skip
: Boolean := False)
5266 Id
: constant Entity_Id
:= Defining_Identifier
(N
);
5267 R_Checks
: Check_Result
;
5271 Generate_Definition
(Id
);
5272 Set_Is_Pure
(Id
, Is_Pure
(Current_Scope
));
5273 Init_Size_Align
(Id
);
5275 -- The following guard condition on Enter_Name is to handle cases where
5276 -- the defining identifier has already been entered into the scope but
5277 -- the declaration as a whole needs to be analyzed.
5279 -- This case in particular happens for derived enumeration types. The
5280 -- derived enumeration type is processed as an inserted enumeration type
5281 -- declaration followed by a rewritten subtype declaration. The defining
5282 -- identifier, however, is entered into the name scope very early in the
5283 -- processing of the original type declaration and therefore needs to be
5284 -- avoided here, when the created subtype declaration is analyzed. (See
5285 -- Build_Derived_Types)
5287 -- This also happens when the full view of a private type is derived
5288 -- type with constraints. In this case the entity has been introduced
5289 -- in the private declaration.
5291 -- Finally this happens in some complex cases when validity checks are
5292 -- enabled, where the same subtype declaration may be analyzed twice.
5293 -- This can happen if the subtype is created by the preanalysis of
5294 -- an attribute tht gives the range of a loop statement, and the loop
5295 -- itself appears within an if_statement that will be rewritten during
5299 or else (Present
(Etype
(Id
))
5300 and then (Is_Private_Type
(Etype
(Id
))
5301 or else Is_Task_Type
(Etype
(Id
))
5302 or else Is_Rewrite_Substitution
(N
)))
5306 elsif Current_Entity
(Id
) = Id
then
5313 T
:= Process_Subtype
(Subtype_Indication
(N
), N
, Id
, 'P');
5315 -- Class-wide equivalent types of records with unknown discriminants
5316 -- involve the generation of an itype which serves as the private view
5317 -- of a constrained record subtype. In such cases the base type of the
5318 -- current subtype we are processing is the private itype. Use the full
5319 -- of the private itype when decorating various attributes.
5322 and then Is_Private_Type
(T
)
5323 and then Present
(Full_View
(T
))
5328 -- Inherit common attributes
5330 Set_Is_Volatile
(Id
, Is_Volatile
(T
));
5331 Set_Treat_As_Volatile
(Id
, Treat_As_Volatile
(T
));
5332 Set_Is_Generic_Type
(Id
, Is_Generic_Type
(Base_Type
(T
)));
5333 Set_Convention
(Id
, Convention
(T
));
5335 -- If ancestor has predicates then so does the subtype, and in addition
5336 -- we must delay the freeze to properly arrange predicate inheritance.
5338 -- The Ancestor_Type test is really unpleasant, there seem to be cases
5339 -- in which T = ID, so the above tests and assignments do nothing???
5341 if Has_Predicates
(T
)
5342 or else (Present
(Ancestor_Subtype
(T
))
5343 and then Has_Predicates
(Ancestor_Subtype
(T
)))
5345 Set_Has_Predicates
(Id
);
5346 Set_Has_Delayed_Freeze
(Id
);
5348 -- Generated subtypes inherit the predicate function from the parent
5349 -- (no aspects to examine on the generated declaration).
5351 if not Comes_From_Source
(N
) then
5352 Set_Ekind
(Id
, Ekind
(T
));
5354 if Present
(Predicate_Function
(Id
)) then
5357 elsif Present
(Predicate_Function
(T
)) then
5358 Set_Predicate_Function
(Id
, Predicate_Function
(T
));
5360 elsif Present
(Ancestor_Subtype
(T
))
5361 and then Present
(Predicate_Function
(Ancestor_Subtype
(T
)))
5363 Set_Predicate_Function
(Id
,
5364 Predicate_Function
(Ancestor_Subtype
(T
)));
5369 -- Subtype of Boolean cannot have a constraint in SPARK
5371 if Is_Boolean_Type
(T
)
5372 and then Nkind
(Subtype_Indication
(N
)) = N_Subtype_Indication
5374 Check_SPARK_05_Restriction
5375 ("subtype of Boolean cannot have constraint", N
);
5378 if Nkind
(Subtype_Indication
(N
)) = N_Subtype_Indication
then
5380 Cstr
: constant Node_Id
:= Constraint
(Subtype_Indication
(N
));
5386 if Nkind
(Cstr
) = N_Index_Or_Discriminant_Constraint
then
5387 One_Cstr
:= First
(Constraints
(Cstr
));
5388 while Present
(One_Cstr
) loop
5390 -- Index or discriminant constraint in SPARK must be a
5394 Nkind_In
(One_Cstr
, N_Identifier
, N_Expanded_Name
)
5396 Check_SPARK_05_Restriction
5397 ("subtype mark required", One_Cstr
);
5399 -- String subtype must have a lower bound of 1 in SPARK.
5400 -- Note that we do not need to test for the non-static case
5401 -- here, since that was already taken care of in
5402 -- Process_Range_Expr_In_Decl.
5404 elsif Base_Type
(T
) = Standard_String
then
5405 Get_Index_Bounds
(One_Cstr
, Low
, High
);
5407 if Is_OK_Static_Expression
(Low
)
5408 and then Expr_Value
(Low
) /= 1
5410 Check_SPARK_05_Restriction
5411 ("String subtype must have lower bound of 1", N
);
5421 -- In the case where there is no constraint given in the subtype
5422 -- indication, Process_Subtype just returns the Subtype_Mark, so its
5423 -- semantic attributes must be established here.
5425 if Nkind
(Subtype_Indication
(N
)) /= N_Subtype_Indication
then
5426 Set_Etype
(Id
, Base_Type
(T
));
5428 -- Subtype of unconstrained array without constraint is not allowed
5431 if Is_Array_Type
(T
) and then not Is_Constrained
(T
) then
5432 Check_SPARK_05_Restriction
5433 ("subtype of unconstrained array must have constraint", N
);
5438 Set_Ekind
(Id
, E_Array_Subtype
);
5439 Copy_Array_Subtype_Attributes
(Id
, T
);
5441 when Decimal_Fixed_Point_Kind
=>
5442 Set_Ekind
(Id
, E_Decimal_Fixed_Point_Subtype
);
5443 Set_Digits_Value
(Id
, Digits_Value
(T
));
5444 Set_Delta_Value
(Id
, Delta_Value
(T
));
5445 Set_Scale_Value
(Id
, Scale_Value
(T
));
5446 Set_Small_Value
(Id
, Small_Value
(T
));
5447 Set_Scalar_Range
(Id
, Scalar_Range
(T
));
5448 Set_Machine_Radix_10
(Id
, Machine_Radix_10
(T
));
5449 Set_Is_Constrained
(Id
, Is_Constrained
(T
));
5450 Set_Is_Known_Valid
(Id
, Is_Known_Valid
(T
));
5451 Set_RM_Size
(Id
, RM_Size
(T
));
5453 when Enumeration_Kind
=>
5454 Set_Ekind
(Id
, E_Enumeration_Subtype
);
5455 Set_First_Literal
(Id
, First_Literal
(Base_Type
(T
)));
5456 Set_Scalar_Range
(Id
, Scalar_Range
(T
));
5457 Set_Is_Character_Type
(Id
, Is_Character_Type
(T
));
5458 Set_Is_Constrained
(Id
, Is_Constrained
(T
));
5459 Set_Is_Known_Valid
(Id
, Is_Known_Valid
(T
));
5460 Set_RM_Size
(Id
, RM_Size
(T
));
5462 when Ordinary_Fixed_Point_Kind
=>
5463 Set_Ekind
(Id
, E_Ordinary_Fixed_Point_Subtype
);
5464 Set_Scalar_Range
(Id
, Scalar_Range
(T
));
5465 Set_Small_Value
(Id
, Small_Value
(T
));
5466 Set_Delta_Value
(Id
, Delta_Value
(T
));
5467 Set_Is_Constrained
(Id
, Is_Constrained
(T
));
5468 Set_Is_Known_Valid
(Id
, Is_Known_Valid
(T
));
5469 Set_RM_Size
(Id
, RM_Size
(T
));
5472 Set_Ekind
(Id
, E_Floating_Point_Subtype
);
5473 Set_Scalar_Range
(Id
, Scalar_Range
(T
));
5474 Set_Digits_Value
(Id
, Digits_Value
(T
));
5475 Set_Is_Constrained
(Id
, Is_Constrained
(T
));
5477 -- If the floating point type has dimensions, these will be
5478 -- inherited subsequently when Analyze_Dimensions is called.
5480 when Signed_Integer_Kind
=>
5481 Set_Ekind
(Id
, E_Signed_Integer_Subtype
);
5482 Set_Scalar_Range
(Id
, Scalar_Range
(T
));
5483 Set_Is_Constrained
(Id
, Is_Constrained
(T
));
5484 Set_Is_Known_Valid
(Id
, Is_Known_Valid
(T
));
5485 Set_RM_Size
(Id
, RM_Size
(T
));
5487 when Modular_Integer_Kind
=>
5488 Set_Ekind
(Id
, E_Modular_Integer_Subtype
);
5489 Set_Scalar_Range
(Id
, Scalar_Range
(T
));
5490 Set_Is_Constrained
(Id
, Is_Constrained
(T
));
5491 Set_Is_Known_Valid
(Id
, Is_Known_Valid
(T
));
5492 Set_RM_Size
(Id
, RM_Size
(T
));
5494 when Class_Wide_Kind
=>
5495 Set_Ekind
(Id
, E_Class_Wide_Subtype
);
5496 Set_Class_Wide_Type
(Id
, Class_Wide_Type
(T
));
5497 Set_Cloned_Subtype
(Id
, T
);
5498 Set_Is_Tagged_Type
(Id
, True);
5499 Set_Has_Unknown_Discriminants
5501 Set_No_Tagged_Streams_Pragma
5502 (Id
, No_Tagged_Streams_Pragma
(T
));
5504 if Ekind
(T
) = E_Class_Wide_Subtype
then
5505 Set_Equivalent_Type
(Id
, Equivalent_Type
(T
));
5508 when E_Record_Subtype
5511 Set_Ekind
(Id
, E_Record_Subtype
);
5513 if Ekind
(T
) = E_Record_Subtype
5514 and then Present
(Cloned_Subtype
(T
))
5516 Set_Cloned_Subtype
(Id
, Cloned_Subtype
(T
));
5518 Set_Cloned_Subtype
(Id
, T
);
5521 Set_First_Entity
(Id
, First_Entity
(T
));
5522 Set_Last_Entity
(Id
, Last_Entity
(T
));
5523 Set_Has_Discriminants
(Id
, Has_Discriminants
(T
));
5524 Set_Is_Constrained
(Id
, Is_Constrained
(T
));
5525 Set_Is_Limited_Record
(Id
, Is_Limited_Record
(T
));
5526 Set_Has_Implicit_Dereference
5527 (Id
, Has_Implicit_Dereference
(T
));
5528 Set_Has_Unknown_Discriminants
5529 (Id
, Has_Unknown_Discriminants
(T
));
5531 if Has_Discriminants
(T
) then
5532 Set_Discriminant_Constraint
5533 (Id
, Discriminant_Constraint
(T
));
5534 Set_Stored_Constraint_From_Discriminant_Constraint
(Id
);
5536 elsif Has_Unknown_Discriminants
(Id
) then
5537 Set_Discriminant_Constraint
(Id
, No_Elist
);
5540 if Is_Tagged_Type
(T
) then
5541 Set_Is_Tagged_Type
(Id
, True);
5542 Set_No_Tagged_Streams_Pragma
5543 (Id
, No_Tagged_Streams_Pragma
(T
));
5544 Set_Is_Abstract_Type
(Id
, Is_Abstract_Type
(T
));
5545 Set_Direct_Primitive_Operations
5546 (Id
, Direct_Primitive_Operations
(T
));
5547 Set_Class_Wide_Type
(Id
, Class_Wide_Type
(T
));
5549 if Is_Interface
(T
) then
5550 Set_Is_Interface
(Id
);
5551 Set_Is_Limited_Interface
(Id
, Is_Limited_Interface
(T
));
5555 when Private_Kind
=>
5556 Set_Ekind
(Id
, Subtype_Kind
(Ekind
(T
)));
5557 Set_Has_Discriminants
(Id
, Has_Discriminants
(T
));
5558 Set_Is_Constrained
(Id
, Is_Constrained
(T
));
5559 Set_First_Entity
(Id
, First_Entity
(T
));
5560 Set_Last_Entity
(Id
, Last_Entity
(T
));
5561 Set_Private_Dependents
(Id
, New_Elmt_List
);
5562 Set_Is_Limited_Record
(Id
, Is_Limited_Record
(T
));
5563 Set_Has_Implicit_Dereference
5564 (Id
, Has_Implicit_Dereference
(T
));
5565 Set_Has_Unknown_Discriminants
5566 (Id
, Has_Unknown_Discriminants
(T
));
5567 Set_Known_To_Have_Preelab_Init
5568 (Id
, Known_To_Have_Preelab_Init
(T
));
5570 if Is_Tagged_Type
(T
) then
5571 Set_Is_Tagged_Type
(Id
);
5572 Set_No_Tagged_Streams_Pragma
(Id
,
5573 No_Tagged_Streams_Pragma
(T
));
5574 Set_Is_Abstract_Type
(Id
, Is_Abstract_Type
(T
));
5575 Set_Class_Wide_Type
(Id
, Class_Wide_Type
(T
));
5576 Set_Direct_Primitive_Operations
(Id
,
5577 Direct_Primitive_Operations
(T
));
5580 -- In general the attributes of the subtype of a private type
5581 -- are the attributes of the partial view of parent. However,
5582 -- the full view may be a discriminated type, and the subtype
5583 -- must share the discriminant constraint to generate correct
5584 -- calls to initialization procedures.
5586 if Has_Discriminants
(T
) then
5587 Set_Discriminant_Constraint
5588 (Id
, Discriminant_Constraint
(T
));
5589 Set_Stored_Constraint_From_Discriminant_Constraint
(Id
);
5591 elsif Present
(Full_View
(T
))
5592 and then Has_Discriminants
(Full_View
(T
))
5594 Set_Discriminant_Constraint
5595 (Id
, Discriminant_Constraint
(Full_View
(T
)));
5596 Set_Stored_Constraint_From_Discriminant_Constraint
(Id
);
5598 -- This would seem semantically correct, but apparently
5599 -- generates spurious errors about missing components ???
5601 -- Set_Has_Discriminants (Id);
5604 Prepare_Private_Subtype_Completion
(Id
, N
);
5606 -- If this is the subtype of a constrained private type with
5607 -- discriminants that has got a full view and we also have
5608 -- built a completion just above, show that the completion
5609 -- is a clone of the full view to the back-end.
5611 if Has_Discriminants
(T
)
5612 and then not Has_Unknown_Discriminants
(T
)
5613 and then not Is_Empty_Elmt_List
(Discriminant_Constraint
(T
))
5614 and then Present
(Full_View
(T
))
5615 and then Present
(Full_View
(Id
))
5617 Set_Cloned_Subtype
(Full_View
(Id
), Full_View
(T
));
5621 Set_Ekind
(Id
, E_Access_Subtype
);
5622 Set_Is_Constrained
(Id
, Is_Constrained
(T
));
5623 Set_Is_Access_Constant
5624 (Id
, Is_Access_Constant
(T
));
5625 Set_Directly_Designated_Type
5626 (Id
, Designated_Type
(T
));
5627 Set_Can_Never_Be_Null
(Id
, Can_Never_Be_Null
(T
));
5629 -- A Pure library_item must not contain the declaration of a
5630 -- named access type, except within a subprogram, generic
5631 -- subprogram, task unit, or protected unit, or if it has
5632 -- a specified Storage_Size of zero (RM05-10.2.1(15.4-15.5)).
5634 if Comes_From_Source
(Id
)
5635 and then In_Pure_Unit
5636 and then not In_Subprogram_Task_Protected_Unit
5637 and then not No_Pool_Assigned
(Id
)
5640 ("named access types not allowed in pure unit", N
);
5643 when Concurrent_Kind
=>
5644 Set_Ekind
(Id
, Subtype_Kind
(Ekind
(T
)));
5645 Set_Corresponding_Record_Type
(Id
,
5646 Corresponding_Record_Type
(T
));
5647 Set_First_Entity
(Id
, First_Entity
(T
));
5648 Set_First_Private_Entity
(Id
, First_Private_Entity
(T
));
5649 Set_Has_Discriminants
(Id
, Has_Discriminants
(T
));
5650 Set_Is_Constrained
(Id
, Is_Constrained
(T
));
5651 Set_Is_Tagged_Type
(Id
, Is_Tagged_Type
(T
));
5652 Set_Last_Entity
(Id
, Last_Entity
(T
));
5654 if Is_Tagged_Type
(T
) then
5655 Set_No_Tagged_Streams_Pragma
5656 (Id
, No_Tagged_Streams_Pragma
(T
));
5659 if Has_Discriminants
(T
) then
5660 Set_Discriminant_Constraint
5661 (Id
, Discriminant_Constraint
(T
));
5662 Set_Stored_Constraint_From_Discriminant_Constraint
(Id
);
5665 when Incomplete_Kind
=>
5666 if Ada_Version
>= Ada_2005
then
5668 -- In Ada 2005 an incomplete type can be explicitly tagged:
5669 -- propagate indication. Note that we also have to include
5670 -- subtypes for Ada 2012 extended use of incomplete types.
5672 Set_Ekind
(Id
, E_Incomplete_Subtype
);
5673 Set_Is_Tagged_Type
(Id
, Is_Tagged_Type
(T
));
5674 Set_Private_Dependents
(Id
, New_Elmt_List
);
5676 if Is_Tagged_Type
(Id
) then
5677 Set_No_Tagged_Streams_Pragma
5678 (Id
, No_Tagged_Streams_Pragma
(T
));
5679 Set_Direct_Primitive_Operations
(Id
, New_Elmt_List
);
5682 -- Ada 2005 (AI-412): Decorate an incomplete subtype of an
5683 -- incomplete type visible through a limited with clause.
5685 if From_Limited_With
(T
)
5686 and then Present
(Non_Limited_View
(T
))
5688 Set_From_Limited_With
(Id
);
5689 Set_Non_Limited_View
(Id
, Non_Limited_View
(T
));
5691 -- Ada 2005 (AI-412): Add the regular incomplete subtype
5692 -- to the private dependents of the original incomplete
5693 -- type for future transformation.
5696 Append_Elmt
(Id
, Private_Dependents
(T
));
5699 -- If the subtype name denotes an incomplete type an error
5700 -- was already reported by Process_Subtype.
5703 Set_Etype
(Id
, Any_Type
);
5707 raise Program_Error
;
5710 -- If there is no constraint in the subtype indication, the
5711 -- declared entity inherits predicates from the parent.
5713 Inherit_Predicate_Flags
(Id
, T
);
5716 if Etype
(Id
) = Any_Type
then
5720 -- Some common processing on all types
5722 Set_Size_Info
(Id
, T
);
5723 Set_First_Rep_Item
(Id
, First_Rep_Item
(T
));
5725 -- If the parent type is a generic actual, so is the subtype. This may
5726 -- happen in a nested instance. Why Comes_From_Source test???
5728 if not Comes_From_Source
(N
) then
5729 Set_Is_Generic_Actual_Type
(Id
, Is_Generic_Actual_Type
(T
));
5732 -- If this is a subtype declaration for an actual in an instance,
5733 -- inherit static and dynamic predicates if any.
5735 -- If declaration has no aspect specifications, inherit predicate
5736 -- info as well. Unclear how to handle the case of both specified
5737 -- and inherited predicates ??? Other inherited aspects, such as
5738 -- invariants, should be OK, but the combination with later pragmas
5739 -- may also require special merging.
5741 if Has_Predicates
(T
)
5742 and then Present
(Predicate_Function
(T
))
5744 ((In_Instance
and then not Comes_From_Source
(N
))
5745 or else No
(Aspect_Specifications
(N
)))
5747 Set_Subprograms_For_Type
(Id
, Subprograms_For_Type
(T
));
5749 if Has_Static_Predicate
(T
) then
5750 Set_Has_Static_Predicate
(Id
);
5751 Set_Static_Discrete_Predicate
(Id
, Static_Discrete_Predicate
(T
));
5755 -- Remaining processing depends on characteristics of base type
5759 Set_Is_Immediately_Visible
(Id
, True);
5760 Set_Depends_On_Private
(Id
, Has_Private_Component
(T
));
5761 Set_Is_Descendant_Of_Address
(Id
, Is_Descendant_Of_Address
(T
));
5763 if Is_Interface
(T
) then
5764 Set_Is_Interface
(Id
);
5767 if Present
(Generic_Parent_Type
(N
))
5769 (Nkind
(Parent
(Generic_Parent_Type
(N
))) /=
5770 N_Formal_Type_Declaration
5771 or else Nkind
(Formal_Type_Definition
5772 (Parent
(Generic_Parent_Type
(N
)))) /=
5773 N_Formal_Private_Type_Definition
)
5775 if Is_Tagged_Type
(Id
) then
5777 -- If this is a generic actual subtype for a synchronized type,
5778 -- the primitive operations are those of the corresponding record
5779 -- for which there is a separate subtype declaration.
5781 if Is_Concurrent_Type
(Id
) then
5783 elsif Is_Class_Wide_Type
(Id
) then
5784 Derive_Subprograms
(Generic_Parent_Type
(N
), Id
, Etype
(T
));
5786 Derive_Subprograms
(Generic_Parent_Type
(N
), Id
, T
);
5789 elsif Scope
(Etype
(Id
)) /= Standard_Standard
then
5790 Derive_Subprograms
(Generic_Parent_Type
(N
), Id
);
5794 if Is_Private_Type
(T
) and then Present
(Full_View
(T
)) then
5795 Conditional_Delay
(Id
, Full_View
(T
));
5797 -- The subtypes of components or subcomponents of protected types
5798 -- do not need freeze nodes, which would otherwise appear in the
5799 -- wrong scope (before the freeze node for the protected type). The
5800 -- proper subtypes are those of the subcomponents of the corresponding
5803 elsif Ekind
(Scope
(Id
)) /= E_Protected_Type
5804 and then Present
(Scope
(Scope
(Id
))) -- error defense
5805 and then Ekind
(Scope
(Scope
(Id
))) /= E_Protected_Type
5807 Conditional_Delay
(Id
, T
);
5810 -- If we have a subtype of an incomplete type whose full type is a
5811 -- derived numeric type, we need to have a freeze node for the subtype.
5812 -- Otherwise gigi will complain while computing the (static) bounds of
5816 and then Is_Elementary_Type
(Id
)
5817 and then Etype
(Id
) /= Id
5820 Partial
: constant Entity_Id
:=
5821 Incomplete_Or_Partial_View
(First_Subtype
(Id
));
5823 if Present
(Partial
)
5824 and then Ekind
(Partial
) = E_Incomplete_Type
5826 Set_Has_Delayed_Freeze
(Id
);
5831 -- Check that Constraint_Error is raised for a scalar subtype indication
5832 -- when the lower or upper bound of a non-null range lies outside the
5833 -- range of the type mark.
5835 if Nkind
(Subtype_Indication
(N
)) = N_Subtype_Indication
then
5836 if Is_Scalar_Type
(Etype
(Id
))
5837 and then Scalar_Range
(Id
) /=
5839 (Etype
(Subtype_Mark
(Subtype_Indication
(N
))))
5843 Etype
(Subtype_Mark
(Subtype_Indication
(N
))));
5845 -- In the array case, check compatibility for each index
5847 elsif Is_Array_Type
(Etype
(Id
)) and then Present
(First_Index
(Id
))
5849 -- This really should be a subprogram that finds the indications
5853 Subt_Index
: Node_Id
:= First_Index
(Id
);
5854 Target_Index
: Node_Id
:=
5856 (Subtype_Mark
(Subtype_Indication
(N
))));
5857 Has_Dyn_Chk
: Boolean := Has_Dynamic_Range_Check
(N
);
5860 while Present
(Subt_Index
) loop
5861 if ((Nkind
(Subt_Index
) = N_Identifier
5862 and then Ekind
(Entity
(Subt_Index
)) in Scalar_Kind
)
5863 or else Nkind
(Subt_Index
) = N_Subtype_Indication
)
5865 Nkind
(Scalar_Range
(Etype
(Subt_Index
))) = N_Range
5868 Target_Typ
: constant Entity_Id
:=
5869 Etype
(Target_Index
);
5873 (Scalar_Range
(Etype
(Subt_Index
)),
5876 Defining_Identifier
(N
));
5878 -- Reset Has_Dynamic_Range_Check on the subtype to
5879 -- prevent elision of the index check due to a dynamic
5880 -- check generated for a preceding index (needed since
5881 -- Insert_Range_Checks tries to avoid generating
5882 -- redundant checks on a given declaration).
5884 Set_Has_Dynamic_Range_Check
(N
, False);
5890 Sloc
(Defining_Identifier
(N
)));
5892 -- Record whether this index involved a dynamic check
5895 Has_Dyn_Chk
or else Has_Dynamic_Range_Check
(N
);
5899 Next_Index
(Subt_Index
);
5900 Next_Index
(Target_Index
);
5903 -- Finally, mark whether the subtype involves dynamic checks
5905 Set_Has_Dynamic_Range_Check
(N
, Has_Dyn_Chk
);
5910 Set_Optimize_Alignment_Flags
(Id
);
5911 Check_Eliminated
(Id
);
5914 if Has_Aspects
(N
) then
5915 Analyze_Aspect_Specifications
(N
, Id
);
5918 Analyze_Dimension
(N
);
5920 -- Check No_Dynamic_Sized_Objects restriction, which disallows subtype
5921 -- indications on composite types where the constraints are dynamic.
5922 -- Note that object declarations and aggregates generate implicit
5923 -- subtype declarations, which this covers. One special case is that the
5924 -- implicitly generated "=" for discriminated types includes an
5925 -- offending subtype declaration, which is harmless, so we ignore it
5928 if Nkind
(Subtype_Indication
(N
)) = N_Subtype_Indication
then
5930 Cstr
: constant Node_Id
:= Constraint
(Subtype_Indication
(N
));
5932 if Nkind
(Cstr
) = N_Index_Or_Discriminant_Constraint
5933 and then not (Is_Internal
(Id
)
5934 and then Is_TSS
(Scope
(Id
),
5935 TSS_Composite_Equality
))
5936 and then not Within_Init_Proc
5937 and then not All_Composite_Constraints_Static
(Cstr
)
5939 Check_Restriction
(No_Dynamic_Sized_Objects
, Cstr
);
5943 end Analyze_Subtype_Declaration
;
5945 --------------------------------
5946 -- Analyze_Subtype_Indication --
5947 --------------------------------
5949 procedure Analyze_Subtype_Indication
(N
: Node_Id
) is
5950 T
: constant Entity_Id
:= Subtype_Mark
(N
);
5951 R
: constant Node_Id
:= Range_Expression
(Constraint
(N
));
5958 Set_Etype
(N
, Etype
(R
));
5959 Resolve
(R
, Entity
(T
));
5961 Set_Error_Posted
(R
);
5962 Set_Error_Posted
(T
);
5964 end Analyze_Subtype_Indication
;
5966 --------------------------
5967 -- Analyze_Variant_Part --
5968 --------------------------
5970 procedure Analyze_Variant_Part
(N
: Node_Id
) is
5971 Discr_Name
: Node_Id
;
5972 Discr_Type
: Entity_Id
;
5974 procedure Process_Variant
(A
: Node_Id
);
5975 -- Analyze declarations for a single variant
5977 package Analyze_Variant_Choices
is
5978 new Generic_Analyze_Choices
(Process_Variant
);
5979 use Analyze_Variant_Choices
;
5981 ---------------------
5982 -- Process_Variant --
5983 ---------------------
5985 procedure Process_Variant
(A
: Node_Id
) is
5986 CL
: constant Node_Id
:= Component_List
(A
);
5988 if not Null_Present
(CL
) then
5989 Analyze_Declarations
(Component_Items
(CL
));
5991 if Present
(Variant_Part
(CL
)) then
5992 Analyze
(Variant_Part
(CL
));
5995 end Process_Variant
;
5997 -- Start of processing for Analyze_Variant_Part
6000 Discr_Name
:= Name
(N
);
6001 Analyze
(Discr_Name
);
6003 -- If Discr_Name bad, get out (prevent cascaded errors)
6005 if Etype
(Discr_Name
) = Any_Type
then
6009 -- Check invalid discriminant in variant part
6011 if Ekind
(Entity
(Discr_Name
)) /= E_Discriminant
then
6012 Error_Msg_N
("invalid discriminant name in variant part", Discr_Name
);
6015 Discr_Type
:= Etype
(Entity
(Discr_Name
));
6017 if not Is_Discrete_Type
(Discr_Type
) then
6019 ("discriminant in a variant part must be of a discrete type",
6024 -- Now analyze the choices, which also analyzes the declarations that
6025 -- are associated with each choice.
6027 Analyze_Choices
(Variants
(N
), Discr_Type
);
6029 -- Note: we used to instantiate and call Check_Choices here to check
6030 -- that the choices covered the discriminant, but it's too early to do
6031 -- that because of statically predicated subtypes, whose analysis may
6032 -- be deferred to their freeze point which may be as late as the freeze
6033 -- point of the containing record. So this call is now to be found in
6034 -- Freeze_Record_Declaration.
6036 end Analyze_Variant_Part
;
6038 ----------------------------
6039 -- Array_Type_Declaration --
6040 ----------------------------
6042 procedure Array_Type_Declaration
(T
: in out Entity_Id
; Def
: Node_Id
) is
6043 Component_Def
: constant Node_Id
:= Component_Definition
(Def
);
6044 Component_Typ
: constant Node_Id
:= Subtype_Indication
(Component_Def
);
6045 P
: constant Node_Id
:= Parent
(Def
);
6046 Element_Type
: Entity_Id
;
6047 Implicit_Base
: Entity_Id
;
6051 Related_Id
: Entity_Id
:= Empty
;
6054 if Nkind
(Def
) = N_Constrained_Array_Definition
then
6055 Index
:= First
(Discrete_Subtype_Definitions
(Def
));
6057 Index
:= First
(Subtype_Marks
(Def
));
6060 -- Find proper names for the implicit types which may be public. In case
6061 -- of anonymous arrays we use the name of the first object of that type
6065 Related_Id
:= Defining_Identifier
(P
);
6071 while Present
(Index
) loop
6074 -- Test for odd case of trying to index a type by the type itself
6076 if Is_Entity_Name
(Index
) and then Entity
(Index
) = T
then
6077 Error_Msg_N
("type& cannot be indexed by itself", Index
);
6078 Set_Entity
(Index
, Standard_Boolean
);
6079 Set_Etype
(Index
, Standard_Boolean
);
6082 -- Check SPARK restriction requiring a subtype mark
6084 if not Nkind_In
(Index
, N_Identifier
, N_Expanded_Name
) then
6085 Check_SPARK_05_Restriction
("subtype mark required", Index
);
6088 -- Add a subtype declaration for each index of private array type
6089 -- declaration whose etype is also private. For example:
6092 -- type Index is private;
6094 -- type Table is array (Index) of ...
6097 -- This is currently required by the expander for the internally
6098 -- generated equality subprogram of records with variant parts in
6099 -- which the etype of some component is such private type.
6101 if Ekind
(Current_Scope
) = E_Package
6102 and then In_Private_Part
(Current_Scope
)
6103 and then Has_Private_Declaration
(Etype
(Index
))
6106 Loc
: constant Source_Ptr
:= Sloc
(Def
);
6111 New_E
:= Make_Temporary
(Loc
, 'T');
6112 Set_Is_Internal
(New_E
);
6115 Make_Subtype_Declaration
(Loc
,
6116 Defining_Identifier
=> New_E
,
6117 Subtype_Indication
=>
6118 New_Occurrence_Of
(Etype
(Index
), Loc
));
6120 Insert_Before
(Parent
(Def
), Decl
);
6122 Set_Etype
(Index
, New_E
);
6124 -- If the index is a range or a subtype indication it carries
6125 -- no entity. Example:
6128 -- type T is private;
6130 -- type T is new Natural;
6131 -- Table : array (T(1) .. T(10)) of Boolean;
6134 -- Otherwise the type of the reference is its entity.
6136 if Is_Entity_Name
(Index
) then
6137 Set_Entity
(Index
, New_E
);
6142 Make_Index
(Index
, P
, Related_Id
, Nb_Index
);
6144 -- Check error of subtype with predicate for index type
6146 Bad_Predicated_Subtype_Use
6147 ("subtype& has predicate, not allowed as index subtype",
6148 Index
, Etype
(Index
));
6150 -- Move to next index
6153 Nb_Index
:= Nb_Index
+ 1;
6156 -- Process subtype indication if one is present
6158 if Present
(Component_Typ
) then
6159 Element_Type
:= Process_Subtype
(Component_Typ
, P
, Related_Id
, 'C');
6161 Set_Etype
(Component_Typ
, Element_Type
);
6163 if not Nkind_In
(Component_Typ
, N_Identifier
, N_Expanded_Name
) then
6164 Check_SPARK_05_Restriction
6165 ("subtype mark required", Component_Typ
);
6168 -- Ada 2005 (AI-230): Access Definition case
6170 else pragma Assert
(Present
(Access_Definition
(Component_Def
)));
6172 -- Indicate that the anonymous access type is created by the
6173 -- array type declaration.
6175 Element_Type
:= Access_Definition
6177 N
=> Access_Definition
(Component_Def
));
6178 Set_Is_Local_Anonymous_Access
(Element_Type
);
6180 -- Propagate the parent. This field is needed if we have to generate
6181 -- the master_id associated with an anonymous access to task type
6182 -- component (see Expand_N_Full_Type_Declaration.Build_Master)
6184 Set_Parent
(Element_Type
, Parent
(T
));
6186 -- Ada 2005 (AI-230): In case of components that are anonymous access
6187 -- types the level of accessibility depends on the enclosing type
6190 Set_Scope
(Element_Type
, Current_Scope
); -- Ada 2005 (AI-230)
6192 -- Ada 2005 (AI-254)
6195 CD
: constant Node_Id
:=
6196 Access_To_Subprogram_Definition
6197 (Access_Definition
(Component_Def
));
6199 if Present
(CD
) and then Protected_Present
(CD
) then
6201 Replace_Anonymous_Access_To_Protected_Subprogram
(Def
);
6206 -- Constrained array case
6209 T
:= Create_Itype
(E_Void
, P
, Related_Id
, 'T');
6212 if Nkind
(Def
) = N_Constrained_Array_Definition
then
6214 -- Establish Implicit_Base as unconstrained base type
6216 Implicit_Base
:= Create_Itype
(E_Array_Type
, P
, Related_Id
, 'B');
6218 Set_Etype
(Implicit_Base
, Implicit_Base
);
6219 Set_Scope
(Implicit_Base
, Current_Scope
);
6220 Set_Has_Delayed_Freeze
(Implicit_Base
);
6221 Set_Default_SSO
(Implicit_Base
);
6223 -- The constrained array type is a subtype of the unconstrained one
6225 Set_Ekind
(T
, E_Array_Subtype
);
6226 Init_Size_Align
(T
);
6227 Set_Etype
(T
, Implicit_Base
);
6228 Set_Scope
(T
, Current_Scope
);
6229 Set_Is_Constrained
(T
);
6231 First
(Discrete_Subtype_Definitions
(Def
)));
6232 Set_Has_Delayed_Freeze
(T
);
6234 -- Complete setup of implicit base type
6236 Set_Component_Size
(Implicit_Base
, Uint_0
);
6237 Set_Component_Type
(Implicit_Base
, Element_Type
);
6238 Set_Finalize_Storage_Only
6240 Finalize_Storage_Only
(Element_Type
));
6241 Set_First_Index
(Implicit_Base
, First_Index
(T
));
6242 Set_Has_Controlled_Component
6244 Has_Controlled_Component
(Element_Type
)
6245 or else Is_Controlled
(Element_Type
));
6246 Set_Packed_Array_Impl_Type
6247 (Implicit_Base
, Empty
);
6249 Propagate_Concurrent_Flags
(Implicit_Base
, Element_Type
);
6251 -- Unconstrained array case
6254 Set_Ekind
(T
, E_Array_Type
);
6255 Init_Size_Align
(T
);
6257 Set_Scope
(T
, Current_Scope
);
6258 Set_Component_Size
(T
, Uint_0
);
6259 Set_Is_Constrained
(T
, False);
6260 Set_First_Index
(T
, First
(Subtype_Marks
(Def
)));
6261 Set_Has_Delayed_Freeze
(T
, True);
6262 Propagate_Concurrent_Flags
(T
, Element_Type
);
6263 Set_Has_Controlled_Component
(T
, Has_Controlled_Component
6266 Is_Controlled
(Element_Type
));
6267 Set_Finalize_Storage_Only
(T
, Finalize_Storage_Only
6269 Set_Default_SSO
(T
);
6272 -- Common attributes for both cases
6274 Set_Component_Type
(Base_Type
(T
), Element_Type
);
6275 Set_Packed_Array_Impl_Type
(T
, Empty
);
6277 if Aliased_Present
(Component_Definition
(Def
)) then
6278 Check_SPARK_05_Restriction
6279 ("aliased is not allowed", Component_Definition
(Def
));
6280 Set_Has_Aliased_Components
(Etype
(T
));
6283 -- Ada 2005 (AI-231): Propagate the null-excluding attribute to the
6284 -- array type to ensure that objects of this type are initialized.
6286 if Ada_Version
>= Ada_2005
and then Can_Never_Be_Null
(Element_Type
) then
6287 Set_Can_Never_Be_Null
(T
);
6289 if Null_Exclusion_Present
(Component_Definition
(Def
))
6291 -- No need to check itypes because in their case this check was
6292 -- done at their point of creation
6294 and then not Is_Itype
(Element_Type
)
6297 ("`NOT NULL` not allowed (null already excluded)",
6298 Subtype_Indication
(Component_Definition
(Def
)));
6302 Priv
:= Private_Component
(Element_Type
);
6304 if Present
(Priv
) then
6306 -- Check for circular definitions
6308 if Priv
= Any_Type
then
6309 Set_Component_Type
(Etype
(T
), Any_Type
);
6311 -- There is a gap in the visibility of operations on the composite
6312 -- type only if the component type is defined in a different scope.
6314 elsif Scope
(Priv
) = Current_Scope
then
6317 elsif Is_Limited_Type
(Priv
) then
6318 Set_Is_Limited_Composite
(Etype
(T
));
6319 Set_Is_Limited_Composite
(T
);
6321 Set_Is_Private_Composite
(Etype
(T
));
6322 Set_Is_Private_Composite
(T
);
6326 -- A syntax error in the declaration itself may lead to an empty index
6327 -- list, in which case do a minimal patch.
6329 if No
(First_Index
(T
)) then
6330 Error_Msg_N
("missing index definition in array type declaration", T
);
6333 Indexes
: constant List_Id
:=
6334 New_List
(New_Occurrence_Of
(Any_Id
, Sloc
(T
)));
6336 Set_Discrete_Subtype_Definitions
(Def
, Indexes
);
6337 Set_First_Index
(T
, First
(Indexes
));
6342 -- Create a concatenation operator for the new type. Internal array
6343 -- types created for packed entities do not need such, they are
6344 -- compatible with the user-defined type.
6346 if Number_Dimensions
(T
) = 1
6347 and then not Is_Packed_Array_Impl_Type
(T
)
6349 New_Concatenation_Op
(T
);
6352 -- In the case of an unconstrained array the parser has already verified
6353 -- that all the indexes are unconstrained but we still need to make sure
6354 -- that the element type is constrained.
6356 if not Is_Definite_Subtype
(Element_Type
) then
6358 ("unconstrained element type in array declaration",
6359 Subtype_Indication
(Component_Def
));
6361 elsif Is_Abstract_Type
(Element_Type
) then
6363 ("the type of a component cannot be abstract",
6364 Subtype_Indication
(Component_Def
));
6367 -- There may be an invariant declared for the component type, but
6368 -- the construction of the component invariant checking procedure
6369 -- takes place during expansion.
6370 end Array_Type_Declaration
;
6372 ------------------------------------------------------
6373 -- Replace_Anonymous_Access_To_Protected_Subprogram --
6374 ------------------------------------------------------
6376 function Replace_Anonymous_Access_To_Protected_Subprogram
6377 (N
: Node_Id
) return Entity_Id
6379 Loc
: constant Source_Ptr
:= Sloc
(N
);
6381 Curr_Scope
: constant Scope_Stack_Entry
:=
6382 Scope_Stack
.Table
(Scope_Stack
.Last
);
6384 Anon
: constant Entity_Id
:= Make_Temporary
(Loc
, 'S');
6387 -- Access definition in declaration
6390 -- Object definition or formal definition with an access definition
6393 -- Declaration of anonymous access to subprogram type
6396 -- Original specification in access to subprogram
6401 Set_Is_Internal
(Anon
);
6404 when N_Constrained_Array_Definition
6405 | N_Component_Declaration
6406 | N_Unconstrained_Array_Definition
6408 Comp
:= Component_Definition
(N
);
6409 Acc
:= Access_Definition
(Comp
);
6411 when N_Discriminant_Specification
=>
6412 Comp
:= Discriminant_Type
(N
);
6415 when N_Parameter_Specification
=>
6416 Comp
:= Parameter_Type
(N
);
6419 when N_Access_Function_Definition
=>
6420 Comp
:= Result_Definition
(N
);
6423 when N_Object_Declaration
=>
6424 Comp
:= Object_Definition
(N
);
6427 when N_Function_Specification
=>
6428 Comp
:= Result_Definition
(N
);
6432 raise Program_Error
;
6435 Spec
:= Access_To_Subprogram_Definition
(Acc
);
6438 Make_Full_Type_Declaration
(Loc
,
6439 Defining_Identifier
=> Anon
,
6440 Type_Definition
=> Copy_Separate_Tree
(Spec
));
6442 Mark_Rewrite_Insertion
(Decl
);
6444 -- In ASIS mode, analyze the profile on the original node, because
6445 -- the separate copy does not provide enough links to recover the
6446 -- original tree. Analysis is limited to type annotations, within
6447 -- a temporary scope that serves as an anonymous subprogram to collect
6448 -- otherwise useless temporaries and itypes.
6452 Typ
: constant Entity_Id
:= Make_Temporary
(Loc
, 'S');
6455 if Nkind
(Spec
) = N_Access_Function_Definition
then
6456 Set_Ekind
(Typ
, E_Function
);
6458 Set_Ekind
(Typ
, E_Procedure
);
6461 Set_Parent
(Typ
, N
);
6462 Set_Scope
(Typ
, Current_Scope
);
6465 -- Nothing to do if procedure is parameterless
6467 if Present
(Parameter_Specifications
(Spec
)) then
6468 Process_Formals
(Parameter_Specifications
(Spec
), Spec
);
6471 if Nkind
(Spec
) = N_Access_Function_Definition
then
6473 Def
: constant Node_Id
:= Result_Definition
(Spec
);
6476 -- The result might itself be an anonymous access type, so
6479 if Nkind
(Def
) = N_Access_Definition
then
6480 if Present
(Access_To_Subprogram_Definition
(Def
)) then
6483 Replace_Anonymous_Access_To_Protected_Subprogram
6486 Find_Type
(Subtype_Mark
(Def
));
6499 -- Insert the new declaration in the nearest enclosing scope. If the
6500 -- parent is a body and N is its return type, the declaration belongs
6501 -- in the enclosing scope. Likewise if N is the type of a parameter.
6505 if Nkind
(N
) = N_Function_Specification
6506 and then Nkind
(P
) = N_Subprogram_Body
6509 elsif Nkind
(N
) = N_Parameter_Specification
6510 and then Nkind
(P
) in N_Subprogram_Specification
6511 and then Nkind
(Parent
(P
)) = N_Subprogram_Body
6513 P
:= Parent
(Parent
(P
));
6516 while Present
(P
) and then not Has_Declarations
(P
) loop
6520 pragma Assert
(Present
(P
));
6522 if Nkind
(P
) = N_Package_Specification
then
6523 Prepend
(Decl
, Visible_Declarations
(P
));
6525 Prepend
(Decl
, Declarations
(P
));
6528 -- Replace the anonymous type with an occurrence of the new declaration.
6529 -- In all cases the rewritten node does not have the null-exclusion
6530 -- attribute because (if present) it was already inherited by the
6531 -- anonymous entity (Anon). Thus, in case of components we do not
6532 -- inherit this attribute.
6534 if Nkind
(N
) = N_Parameter_Specification
then
6535 Rewrite
(Comp
, New_Occurrence_Of
(Anon
, Loc
));
6536 Set_Etype
(Defining_Identifier
(N
), Anon
);
6537 Set_Null_Exclusion_Present
(N
, False);
6539 elsif Nkind
(N
) = N_Object_Declaration
then
6540 Rewrite
(Comp
, New_Occurrence_Of
(Anon
, Loc
));
6541 Set_Etype
(Defining_Identifier
(N
), Anon
);
6543 elsif Nkind
(N
) = N_Access_Function_Definition
then
6544 Rewrite
(Comp
, New_Occurrence_Of
(Anon
, Loc
));
6546 elsif Nkind
(N
) = N_Function_Specification
then
6547 Rewrite
(Comp
, New_Occurrence_Of
(Anon
, Loc
));
6548 Set_Etype
(Defining_Unit_Name
(N
), Anon
);
6552 Make_Component_Definition
(Loc
,
6553 Subtype_Indication
=> New_Occurrence_Of
(Anon
, Loc
)));
6556 Mark_Rewrite_Insertion
(Comp
);
6558 if Nkind_In
(N
, N_Object_Declaration
, N_Access_Function_Definition
)
6559 or else (Nkind
(Parent
(N
)) = N_Full_Type_Declaration
6560 and then not Is_Type
(Current_Scope
))
6563 -- Declaration can be analyzed in the current scope.
6568 -- Temporarily remove the current scope (record or subprogram) from
6569 -- the stack to add the new declarations to the enclosing scope.
6570 -- The anonymous entity is an Itype with the proper attributes.
6572 Scope_Stack
.Decrement_Last
;
6574 Set_Is_Itype
(Anon
);
6575 Set_Associated_Node_For_Itype
(Anon
, N
);
6576 Scope_Stack
.Append
(Curr_Scope
);
6579 Set_Ekind
(Anon
, E_Anonymous_Access_Protected_Subprogram_Type
);
6580 Set_Can_Use_Internal_Rep
(Anon
, not Always_Compatible_Rep_On_Target
);
6582 end Replace_Anonymous_Access_To_Protected_Subprogram
;
6584 -------------------------------
6585 -- Build_Derived_Access_Type --
6586 -------------------------------
6588 procedure Build_Derived_Access_Type
6590 Parent_Type
: Entity_Id
;
6591 Derived_Type
: Entity_Id
)
6593 S
: constant Node_Id
:= Subtype_Indication
(Type_Definition
(N
));
6595 Desig_Type
: Entity_Id
;
6597 Discr_Con_Elist
: Elist_Id
;
6598 Discr_Con_El
: Elmt_Id
;
6602 -- Set the designated type so it is available in case this is an access
6603 -- to a self-referential type, e.g. a standard list type with a next
6604 -- pointer. Will be reset after subtype is built.
6606 Set_Directly_Designated_Type
6607 (Derived_Type
, Designated_Type
(Parent_Type
));
6609 Subt
:= Process_Subtype
(S
, N
);
6611 if Nkind
(S
) /= N_Subtype_Indication
6612 and then Subt
/= Base_Type
(Subt
)
6614 Set_Ekind
(Derived_Type
, E_Access_Subtype
);
6617 if Ekind
(Derived_Type
) = E_Access_Subtype
then
6619 Pbase
: constant Entity_Id
:= Base_Type
(Parent_Type
);
6620 Ibase
: constant Entity_Id
:=
6621 Create_Itype
(Ekind
(Pbase
), N
, Derived_Type
, 'B');
6622 Svg_Chars
: constant Name_Id
:= Chars
(Ibase
);
6623 Svg_Next_E
: constant Entity_Id
:= Next_Entity
(Ibase
);
6624 Svg_Prev_E
: constant Entity_Id
:= Prev_Entity
(Ibase
);
6627 Copy_Node
(Pbase
, Ibase
);
6629 -- Restore Itype status after Copy_Node
6631 Set_Is_Itype
(Ibase
);
6632 Set_Associated_Node_For_Itype
(Ibase
, N
);
6634 Set_Chars
(Ibase
, Svg_Chars
);
6635 Set_Prev_Entity
(Ibase
, Svg_Prev_E
);
6636 Set_Next_Entity
(Ibase
, Svg_Next_E
);
6637 Set_Sloc
(Ibase
, Sloc
(Derived_Type
));
6638 Set_Scope
(Ibase
, Scope
(Derived_Type
));
6639 Set_Freeze_Node
(Ibase
, Empty
);
6640 Set_Is_Frozen
(Ibase
, False);
6641 Set_Comes_From_Source
(Ibase
, False);
6642 Set_Is_First_Subtype
(Ibase
, False);
6644 Set_Etype
(Ibase
, Pbase
);
6645 Set_Etype
(Derived_Type
, Ibase
);
6649 Set_Directly_Designated_Type
6650 (Derived_Type
, Designated_Type
(Subt
));
6652 Set_Is_Constrained
(Derived_Type
, Is_Constrained
(Subt
));
6653 Set_Is_Access_Constant
(Derived_Type
, Is_Access_Constant
(Parent_Type
));
6654 Set_Size_Info
(Derived_Type
, Parent_Type
);
6655 Set_RM_Size
(Derived_Type
, RM_Size
(Parent_Type
));
6656 Set_Depends_On_Private
(Derived_Type
,
6657 Has_Private_Component
(Derived_Type
));
6658 Conditional_Delay
(Derived_Type
, Subt
);
6660 -- Ada 2005 (AI-231): Set the null-exclusion attribute, and verify
6661 -- that it is not redundant.
6663 if Null_Exclusion_Present
(Type_Definition
(N
)) then
6664 Set_Can_Never_Be_Null
(Derived_Type
);
6666 elsif Can_Never_Be_Null
(Parent_Type
) then
6667 Set_Can_Never_Be_Null
(Derived_Type
);
6670 -- Note: we do not copy the Storage_Size_Variable, since we always go to
6671 -- the root type for this information.
6673 -- Apply range checks to discriminants for derived record case
6674 -- ??? THIS CODE SHOULD NOT BE HERE REALLY.
6676 Desig_Type
:= Designated_Type
(Derived_Type
);
6678 if Is_Composite_Type
(Desig_Type
)
6679 and then (not Is_Array_Type
(Desig_Type
))
6680 and then Has_Discriminants
(Desig_Type
)
6681 and then Base_Type
(Desig_Type
) /= Desig_Type
6683 Discr_Con_Elist
:= Discriminant_Constraint
(Desig_Type
);
6684 Discr_Con_El
:= First_Elmt
(Discr_Con_Elist
);
6686 Discr
:= First_Discriminant
(Base_Type
(Desig_Type
));
6687 while Present
(Discr_Con_El
) loop
6688 Apply_Range_Check
(Node
(Discr_Con_El
), Etype
(Discr
));
6689 Next_Elmt
(Discr_Con_El
);
6690 Next_Discriminant
(Discr
);
6693 end Build_Derived_Access_Type
;
6695 ------------------------------
6696 -- Build_Derived_Array_Type --
6697 ------------------------------
6699 procedure Build_Derived_Array_Type
6701 Parent_Type
: Entity_Id
;
6702 Derived_Type
: Entity_Id
)
6704 Loc
: constant Source_Ptr
:= Sloc
(N
);
6705 Tdef
: constant Node_Id
:= Type_Definition
(N
);
6706 Indic
: constant Node_Id
:= Subtype_Indication
(Tdef
);
6707 Parent_Base
: constant Entity_Id
:= Base_Type
(Parent_Type
);
6708 Implicit_Base
: Entity_Id
:= Empty
;
6709 New_Indic
: Node_Id
;
6711 procedure Make_Implicit_Base
;
6712 -- If the parent subtype is constrained, the derived type is a subtype
6713 -- of an implicit base type derived from the parent base.
6715 ------------------------
6716 -- Make_Implicit_Base --
6717 ------------------------
6719 procedure Make_Implicit_Base
is
6722 Create_Itype
(Ekind
(Parent_Base
), N
, Derived_Type
, 'B');
6724 Set_Ekind
(Implicit_Base
, Ekind
(Parent_Base
));
6725 Set_Etype
(Implicit_Base
, Parent_Base
);
6727 Copy_Array_Subtype_Attributes
(Implicit_Base
, Parent_Base
);
6728 Copy_Array_Base_Type_Attributes
(Implicit_Base
, Parent_Base
);
6730 Set_Has_Delayed_Freeze
(Implicit_Base
, True);
6731 end Make_Implicit_Base
;
6733 -- Start of processing for Build_Derived_Array_Type
6736 if not Is_Constrained
(Parent_Type
) then
6737 if Nkind
(Indic
) /= N_Subtype_Indication
then
6738 Set_Ekind
(Derived_Type
, E_Array_Type
);
6740 Copy_Array_Subtype_Attributes
(Derived_Type
, Parent_Type
);
6741 Copy_Array_Base_Type_Attributes
(Derived_Type
, Parent_Type
);
6743 Set_Has_Delayed_Freeze
(Derived_Type
, True);
6747 Set_Etype
(Derived_Type
, Implicit_Base
);
6750 Make_Subtype_Declaration
(Loc
,
6751 Defining_Identifier
=> Derived_Type
,
6752 Subtype_Indication
=>
6753 Make_Subtype_Indication
(Loc
,
6754 Subtype_Mark
=> New_Occurrence_Of
(Implicit_Base
, Loc
),
6755 Constraint
=> Constraint
(Indic
)));
6757 Rewrite
(N
, New_Indic
);
6762 if Nkind
(Indic
) /= N_Subtype_Indication
then
6765 Set_Ekind
(Derived_Type
, Ekind
(Parent_Type
));
6766 Set_Etype
(Derived_Type
, Implicit_Base
);
6767 Copy_Array_Subtype_Attributes
(Derived_Type
, Parent_Type
);
6770 Error_Msg_N
("illegal constraint on constrained type", Indic
);
6774 -- If parent type is not a derived type itself, and is declared in
6775 -- closed scope (e.g. a subprogram), then we must explicitly introduce
6776 -- the new type's concatenation operator since Derive_Subprograms
6777 -- will not inherit the parent's operator. If the parent type is
6778 -- unconstrained, the operator is of the unconstrained base type.
6780 if Number_Dimensions
(Parent_Type
) = 1
6781 and then not Is_Limited_Type
(Parent_Type
)
6782 and then not Is_Derived_Type
(Parent_Type
)
6783 and then not Is_Package_Or_Generic_Package
6784 (Scope
(Base_Type
(Parent_Type
)))
6786 if not Is_Constrained
(Parent_Type
)
6787 and then Is_Constrained
(Derived_Type
)
6789 New_Concatenation_Op
(Implicit_Base
);
6791 New_Concatenation_Op
(Derived_Type
);
6794 end Build_Derived_Array_Type
;
6796 -----------------------------------
6797 -- Build_Derived_Concurrent_Type --
6798 -----------------------------------
6800 procedure Build_Derived_Concurrent_Type
6802 Parent_Type
: Entity_Id
;
6803 Derived_Type
: Entity_Id
)
6805 Loc
: constant Source_Ptr
:= Sloc
(N
);
6807 Corr_Record
: constant Entity_Id
:= Make_Temporary
(Loc
, 'C');
6808 Corr_Decl
: Node_Id
;
6809 Corr_Decl_Needed
: Boolean;
6810 -- If the derived type has fewer discriminants than its parent, the
6811 -- corresponding record is also a derived type, in order to account for
6812 -- the bound discriminants. We create a full type declaration for it in
6815 Constraint_Present
: constant Boolean :=
6816 Nkind
(Subtype_Indication
(Type_Definition
(N
))) =
6817 N_Subtype_Indication
;
6819 D_Constraint
: Node_Id
;
6820 New_Constraint
: Elist_Id
:= No_Elist
;
6821 Old_Disc
: Entity_Id
;
6822 New_Disc
: Entity_Id
;
6826 Set_Stored_Constraint
(Derived_Type
, No_Elist
);
6827 Corr_Decl_Needed
:= False;
6830 if Present
(Discriminant_Specifications
(N
))
6831 and then Constraint_Present
6833 Old_Disc
:= First_Discriminant
(Parent_Type
);
6834 New_Disc
:= First
(Discriminant_Specifications
(N
));
6835 while Present
(New_Disc
) and then Present
(Old_Disc
) loop
6836 Next_Discriminant
(Old_Disc
);
6841 if Present
(Old_Disc
) and then Expander_Active
then
6843 -- The new type has fewer discriminants, so we need to create a new
6844 -- corresponding record, which is derived from the corresponding
6845 -- record of the parent, and has a stored constraint that captures
6846 -- the values of the discriminant constraints. The corresponding
6847 -- record is needed only if expander is active and code generation is
6850 -- The type declaration for the derived corresponding record has the
6851 -- same discriminant part and constraints as the current declaration.
6852 -- Copy the unanalyzed tree to build declaration.
6854 Corr_Decl_Needed
:= True;
6855 New_N
:= Copy_Separate_Tree
(N
);
6858 Make_Full_Type_Declaration
(Loc
,
6859 Defining_Identifier
=> Corr_Record
,
6860 Discriminant_Specifications
=>
6861 Discriminant_Specifications
(New_N
),
6863 Make_Derived_Type_Definition
(Loc
,
6864 Subtype_Indication
=>
6865 Make_Subtype_Indication
(Loc
,
6868 (Corresponding_Record_Type
(Parent_Type
), Loc
),
6871 (Subtype_Indication
(Type_Definition
(New_N
))))));
6874 -- Copy Storage_Size and Relative_Deadline variables if task case
6876 if Is_Task_Type
(Parent_Type
) then
6877 Set_Storage_Size_Variable
(Derived_Type
,
6878 Storage_Size_Variable
(Parent_Type
));
6879 Set_Relative_Deadline_Variable
(Derived_Type
,
6880 Relative_Deadline_Variable
(Parent_Type
));
6883 if Present
(Discriminant_Specifications
(N
)) then
6884 Push_Scope
(Derived_Type
);
6885 Check_Or_Process_Discriminants
(N
, Derived_Type
);
6887 if Constraint_Present
then
6889 Expand_To_Stored_Constraint
6891 Build_Discriminant_Constraints
6893 Subtype_Indication
(Type_Definition
(N
)), True));
6898 elsif Constraint_Present
then
6900 -- Build constrained subtype, copying the constraint, and derive
6901 -- from it to create a derived constrained type.
6904 Loc
: constant Source_Ptr
:= Sloc
(N
);
6905 Anon
: constant Entity_Id
:=
6906 Make_Defining_Identifier
(Loc
,
6907 Chars
=> New_External_Name
(Chars
(Derived_Type
), 'T'));
6912 Make_Subtype_Declaration
(Loc
,
6913 Defining_Identifier
=> Anon
,
6914 Subtype_Indication
=>
6915 New_Copy_Tree
(Subtype_Indication
(Type_Definition
(N
))));
6916 Insert_Before
(N
, Decl
);
6919 Rewrite
(Subtype_Indication
(Type_Definition
(N
)),
6920 New_Occurrence_Of
(Anon
, Loc
));
6921 Set_Analyzed
(Derived_Type
, False);
6927 -- By default, operations and private data are inherited from parent.
6928 -- However, in the presence of bound discriminants, a new corresponding
6929 -- record will be created, see below.
6931 Set_Has_Discriminants
6932 (Derived_Type
, Has_Discriminants
(Parent_Type
));
6933 Set_Corresponding_Record_Type
6934 (Derived_Type
, Corresponding_Record_Type
(Parent_Type
));
6936 -- Is_Constrained is set according the parent subtype, but is set to
6937 -- False if the derived type is declared with new discriminants.
6941 (Is_Constrained
(Parent_Type
) or else Constraint_Present
)
6942 and then not Present
(Discriminant_Specifications
(N
)));
6944 if Constraint_Present
then
6945 if not Has_Discriminants
(Parent_Type
) then
6946 Error_Msg_N
("untagged parent must have discriminants", N
);
6948 elsif Present
(Discriminant_Specifications
(N
)) then
6950 -- Verify that new discriminants are used to constrain old ones
6955 (Constraint
(Subtype_Indication
(Type_Definition
(N
)))));
6957 Old_Disc
:= First_Discriminant
(Parent_Type
);
6959 while Present
(D_Constraint
) loop
6960 if Nkind
(D_Constraint
) /= N_Discriminant_Association
then
6962 -- Positional constraint. If it is a reference to a new
6963 -- discriminant, it constrains the corresponding old one.
6965 if Nkind
(D_Constraint
) = N_Identifier
then
6966 New_Disc
:= First_Discriminant
(Derived_Type
);
6967 while Present
(New_Disc
) loop
6968 exit when Chars
(New_Disc
) = Chars
(D_Constraint
);
6969 Next_Discriminant
(New_Disc
);
6972 if Present
(New_Disc
) then
6973 Set_Corresponding_Discriminant
(New_Disc
, Old_Disc
);
6977 Next_Discriminant
(Old_Disc
);
6979 -- if this is a named constraint, search by name for the old
6980 -- discriminants constrained by the new one.
6982 elsif Nkind
(Expression
(D_Constraint
)) = N_Identifier
then
6984 -- Find new discriminant with that name
6986 New_Disc
:= First_Discriminant
(Derived_Type
);
6987 while Present
(New_Disc
) loop
6989 Chars
(New_Disc
) = Chars
(Expression
(D_Constraint
));
6990 Next_Discriminant
(New_Disc
);
6993 if Present
(New_Disc
) then
6995 -- Verify that new discriminant renames some discriminant
6996 -- of the parent type, and associate the new discriminant
6997 -- with one or more old ones that it renames.
7003 Selector
:= First
(Selector_Names
(D_Constraint
));
7004 while Present
(Selector
) loop
7005 Old_Disc
:= First_Discriminant
(Parent_Type
);
7006 while Present
(Old_Disc
) loop
7007 exit when Chars
(Old_Disc
) = Chars
(Selector
);
7008 Next_Discriminant
(Old_Disc
);
7011 if Present
(Old_Disc
) then
7012 Set_Corresponding_Discriminant
7013 (New_Disc
, Old_Disc
);
7022 Next
(D_Constraint
);
7025 New_Disc
:= First_Discriminant
(Derived_Type
);
7026 while Present
(New_Disc
) loop
7027 if No
(Corresponding_Discriminant
(New_Disc
)) then
7029 ("new discriminant& must constrain old one", N
, New_Disc
);
7032 Subtypes_Statically_Compatible
7034 Etype
(Corresponding_Discriminant
(New_Disc
)))
7037 ("& not statically compatible with parent discriminant",
7041 Next_Discriminant
(New_Disc
);
7045 elsif Present
(Discriminant_Specifications
(N
)) then
7047 ("missing discriminant constraint in untagged derivation", N
);
7050 -- The entity chain of the derived type includes the new discriminants
7051 -- but shares operations with the parent.
7053 if Present
(Discriminant_Specifications
(N
)) then
7054 Old_Disc
:= First_Discriminant
(Parent_Type
);
7055 while Present
(Old_Disc
) loop
7056 if No
(Next_Entity
(Old_Disc
))
7057 or else Ekind
(Next_Entity
(Old_Disc
)) /= E_Discriminant
7060 (Last_Entity
(Derived_Type
), Next_Entity
(Old_Disc
));
7064 Next_Discriminant
(Old_Disc
);
7068 Set_First_Entity
(Derived_Type
, First_Entity
(Parent_Type
));
7069 if Has_Discriminants
(Parent_Type
) then
7070 Set_Is_Constrained
(Derived_Type
, Is_Constrained
(Parent_Type
));
7071 Set_Discriminant_Constraint
(
7072 Derived_Type
, Discriminant_Constraint
(Parent_Type
));
7076 Set_Last_Entity
(Derived_Type
, Last_Entity
(Parent_Type
));
7078 Set_Has_Completion
(Derived_Type
);
7080 if Corr_Decl_Needed
then
7081 Set_Stored_Constraint
(Derived_Type
, New_Constraint
);
7082 Insert_After
(N
, Corr_Decl
);
7083 Analyze
(Corr_Decl
);
7084 Set_Corresponding_Record_Type
(Derived_Type
, Corr_Record
);
7086 end Build_Derived_Concurrent_Type
;
7088 ------------------------------------
7089 -- Build_Derived_Enumeration_Type --
7090 ------------------------------------
7092 procedure Build_Derived_Enumeration_Type
7094 Parent_Type
: Entity_Id
;
7095 Derived_Type
: Entity_Id
)
7097 Loc
: constant Source_Ptr
:= Sloc
(N
);
7098 Def
: constant Node_Id
:= Type_Definition
(N
);
7099 Indic
: constant Node_Id
:= Subtype_Indication
(Def
);
7100 Implicit_Base
: Entity_Id
;
7101 Literal
: Entity_Id
;
7102 New_Lit
: Entity_Id
;
7103 Literals_List
: List_Id
;
7104 Type_Decl
: Node_Id
;
7106 Rang_Expr
: Node_Id
;
7109 -- Since types Standard.Character and Standard.[Wide_]Wide_Character do
7110 -- not have explicit literals lists we need to process types derived
7111 -- from them specially. This is handled by Derived_Standard_Character.
7112 -- If the parent type is a generic type, there are no literals either,
7113 -- and we construct the same skeletal representation as for the generic
7116 if Is_Standard_Character_Type
(Parent_Type
) then
7117 Derived_Standard_Character
(N
, Parent_Type
, Derived_Type
);
7119 elsif Is_Generic_Type
(Root_Type
(Parent_Type
)) then
7125 if Nkind
(Indic
) /= N_Subtype_Indication
then
7127 Make_Attribute_Reference
(Loc
,
7128 Attribute_Name
=> Name_First
,
7129 Prefix
=> New_Occurrence_Of
(Derived_Type
, Loc
));
7130 Set_Etype
(Lo
, Derived_Type
);
7133 Make_Attribute_Reference
(Loc
,
7134 Attribute_Name
=> Name_Last
,
7135 Prefix
=> New_Occurrence_Of
(Derived_Type
, Loc
));
7136 Set_Etype
(Hi
, Derived_Type
);
7138 Set_Scalar_Range
(Derived_Type
,
7144 -- Analyze subtype indication and verify compatibility
7145 -- with parent type.
7147 if Base_Type
(Process_Subtype
(Indic
, N
)) /=
7148 Base_Type
(Parent_Type
)
7151 ("illegal constraint for formal discrete type", N
);
7157 -- If a constraint is present, analyze the bounds to catch
7158 -- premature usage of the derived literals.
7160 if Nkind
(Indic
) = N_Subtype_Indication
7161 and then Nkind
(Range_Expression
(Constraint
(Indic
))) = N_Range
7163 Analyze
(Low_Bound
(Range_Expression
(Constraint
(Indic
))));
7164 Analyze
(High_Bound
(Range_Expression
(Constraint
(Indic
))));
7167 -- Introduce an implicit base type for the derived type even if there
7168 -- is no constraint attached to it, since this seems closer to the
7169 -- Ada semantics. Build a full type declaration tree for the derived
7170 -- type using the implicit base type as the defining identifier. The
7171 -- build a subtype declaration tree which applies the constraint (if
7172 -- any) have it replace the derived type declaration.
7174 Literal
:= First_Literal
(Parent_Type
);
7175 Literals_List
:= New_List
;
7176 while Present
(Literal
)
7177 and then Ekind
(Literal
) = E_Enumeration_Literal
7179 -- Literals of the derived type have the same representation as
7180 -- those of the parent type, but this representation can be
7181 -- overridden by an explicit representation clause. Indicate
7182 -- that there is no explicit representation given yet. These
7183 -- derived literals are implicit operations of the new type,
7184 -- and can be overridden by explicit ones.
7186 if Nkind
(Literal
) = N_Defining_Character_Literal
then
7188 Make_Defining_Character_Literal
(Loc
, Chars
(Literal
));
7190 New_Lit
:= Make_Defining_Identifier
(Loc
, Chars
(Literal
));
7193 Set_Ekind
(New_Lit
, E_Enumeration_Literal
);
7194 Set_Enumeration_Pos
(New_Lit
, Enumeration_Pos
(Literal
));
7195 Set_Enumeration_Rep
(New_Lit
, Enumeration_Rep
(Literal
));
7196 Set_Enumeration_Rep_Expr
(New_Lit
, Empty
);
7197 Set_Alias
(New_Lit
, Literal
);
7198 Set_Is_Known_Valid
(New_Lit
, True);
7200 Append
(New_Lit
, Literals_List
);
7201 Next_Literal
(Literal
);
7205 Make_Defining_Identifier
(Sloc
(Derived_Type
),
7206 Chars
=> New_External_Name
(Chars
(Derived_Type
), 'B'));
7208 -- Indicate the proper nature of the derived type. This must be done
7209 -- before analysis of the literals, to recognize cases when a literal
7210 -- may be hidden by a previous explicit function definition (cf.
7213 Set_Ekind
(Derived_Type
, E_Enumeration_Subtype
);
7214 Set_Etype
(Derived_Type
, Implicit_Base
);
7217 Make_Full_Type_Declaration
(Loc
,
7218 Defining_Identifier
=> Implicit_Base
,
7219 Discriminant_Specifications
=> No_List
,
7221 Make_Enumeration_Type_Definition
(Loc
, Literals_List
));
7223 Mark_Rewrite_Insertion
(Type_Decl
);
7224 Insert_Before
(N
, Type_Decl
);
7225 Analyze
(Type_Decl
);
7227 -- The anonymous base now has a full declaration, but this base
7228 -- is not a first subtype.
7230 Set_Is_First_Subtype
(Implicit_Base
, False);
7232 -- After the implicit base is analyzed its Etype needs to be changed
7233 -- to reflect the fact that it is derived from the parent type which
7234 -- was ignored during analysis. We also set the size at this point.
7236 Set_Etype
(Implicit_Base
, Parent_Type
);
7238 Set_Size_Info
(Implicit_Base
, Parent_Type
);
7239 Set_RM_Size
(Implicit_Base
, RM_Size
(Parent_Type
));
7240 Set_First_Rep_Item
(Implicit_Base
, First_Rep_Item
(Parent_Type
));
7242 -- Copy other flags from parent type
7244 Set_Has_Non_Standard_Rep
7245 (Implicit_Base
, Has_Non_Standard_Rep
7247 Set_Has_Pragma_Ordered
7248 (Implicit_Base
, Has_Pragma_Ordered
7250 Set_Has_Delayed_Freeze
(Implicit_Base
);
7252 -- Process the subtype indication including a validation check on the
7253 -- constraint, if any. If a constraint is given, its bounds must be
7254 -- implicitly converted to the new type.
7256 if Nkind
(Indic
) = N_Subtype_Indication
then
7258 R
: constant Node_Id
:=
7259 Range_Expression
(Constraint
(Indic
));
7262 if Nkind
(R
) = N_Range
then
7263 Hi
:= Build_Scalar_Bound
7264 (High_Bound
(R
), Parent_Type
, Implicit_Base
);
7265 Lo
:= Build_Scalar_Bound
7266 (Low_Bound
(R
), Parent_Type
, Implicit_Base
);
7269 -- Constraint is a Range attribute. Replace with explicit
7270 -- mention of the bounds of the prefix, which must be a
7273 Analyze
(Prefix
(R
));
7275 Convert_To
(Implicit_Base
,
7276 Make_Attribute_Reference
(Loc
,
7277 Attribute_Name
=> Name_Last
,
7279 New_Occurrence_Of
(Entity
(Prefix
(R
)), Loc
)));
7282 Convert_To
(Implicit_Base
,
7283 Make_Attribute_Reference
(Loc
,
7284 Attribute_Name
=> Name_First
,
7286 New_Occurrence_Of
(Entity
(Prefix
(R
)), Loc
)));
7293 (Type_High_Bound
(Parent_Type
),
7294 Parent_Type
, Implicit_Base
);
7297 (Type_Low_Bound
(Parent_Type
),
7298 Parent_Type
, Implicit_Base
);
7306 -- If we constructed a default range for the case where no range
7307 -- was given, then the expressions in the range must not freeze
7308 -- since they do not correspond to expressions in the source.
7309 -- However, if the type inherits predicates the expressions will
7310 -- be elaborated earlier and must freeze.
7312 if Nkind
(Indic
) /= N_Subtype_Indication
7313 and then not Has_Predicates
(Derived_Type
)
7315 Set_Must_Not_Freeze
(Lo
);
7316 Set_Must_Not_Freeze
(Hi
);
7317 Set_Must_Not_Freeze
(Rang_Expr
);
7321 Make_Subtype_Declaration
(Loc
,
7322 Defining_Identifier
=> Derived_Type
,
7323 Subtype_Indication
=>
7324 Make_Subtype_Indication
(Loc
,
7325 Subtype_Mark
=> New_Occurrence_Of
(Implicit_Base
, Loc
),
7327 Make_Range_Constraint
(Loc
,
7328 Range_Expression
=> Rang_Expr
))));
7332 -- Propagate the aspects from the original type declaration to the
7333 -- declaration of the implicit base.
7335 Move_Aspects
(From
=> Original_Node
(N
), To
=> Type_Decl
);
7337 -- Apply a range check. Since this range expression doesn't have an
7338 -- Etype, we have to specifically pass the Source_Typ parameter. Is
7341 if Nkind
(Indic
) = N_Subtype_Indication
then
7343 (Range_Expression
(Constraint
(Indic
)), Parent_Type
,
7344 Source_Typ
=> Entity
(Subtype_Mark
(Indic
)));
7347 end Build_Derived_Enumeration_Type
;
7349 --------------------------------
7350 -- Build_Derived_Numeric_Type --
7351 --------------------------------
7353 procedure Build_Derived_Numeric_Type
7355 Parent_Type
: Entity_Id
;
7356 Derived_Type
: Entity_Id
)
7358 Loc
: constant Source_Ptr
:= Sloc
(N
);
7359 Tdef
: constant Node_Id
:= Type_Definition
(N
);
7360 Indic
: constant Node_Id
:= Subtype_Indication
(Tdef
);
7361 Parent_Base
: constant Entity_Id
:= Base_Type
(Parent_Type
);
7362 No_Constraint
: constant Boolean := Nkind
(Indic
) /=
7363 N_Subtype_Indication
;
7364 Implicit_Base
: Entity_Id
;
7370 -- Process the subtype indication including a validation check on
7371 -- the constraint if any.
7373 Discard_Node
(Process_Subtype
(Indic
, N
));
7375 -- Introduce an implicit base type for the derived type even if there
7376 -- is no constraint attached to it, since this seems closer to the Ada
7380 Create_Itype
(Ekind
(Parent_Base
), N
, Derived_Type
, 'B');
7382 Set_Etype
(Implicit_Base
, Parent_Base
);
7383 Set_Ekind
(Implicit_Base
, Ekind
(Parent_Base
));
7384 Set_Size_Info
(Implicit_Base
, Parent_Base
);
7385 Set_First_Rep_Item
(Implicit_Base
, First_Rep_Item
(Parent_Base
));
7386 Set_Parent
(Implicit_Base
, Parent
(Derived_Type
));
7387 Set_Is_Known_Valid
(Implicit_Base
, Is_Known_Valid
(Parent_Base
));
7389 -- Set RM Size for discrete type or decimal fixed-point type
7390 -- Ordinary fixed-point is excluded, why???
7392 if Is_Discrete_Type
(Parent_Base
)
7393 or else Is_Decimal_Fixed_Point_Type
(Parent_Base
)
7395 Set_RM_Size
(Implicit_Base
, RM_Size
(Parent_Base
));
7398 Set_Has_Delayed_Freeze
(Implicit_Base
);
7400 Lo
:= New_Copy_Tree
(Type_Low_Bound
(Parent_Base
));
7401 Hi
:= New_Copy_Tree
(Type_High_Bound
(Parent_Base
));
7403 Set_Scalar_Range
(Implicit_Base
,
7408 if Has_Infinities
(Parent_Base
) then
7409 Set_Includes_Infinities
(Scalar_Range
(Implicit_Base
));
7412 -- The Derived_Type, which is the entity of the declaration, is a
7413 -- subtype of the implicit base. Its Ekind is a subtype, even in the
7414 -- absence of an explicit constraint.
7416 Set_Etype
(Derived_Type
, Implicit_Base
);
7418 -- If we did not have a constraint, then the Ekind is set from the
7419 -- parent type (otherwise Process_Subtype has set the bounds)
7421 if No_Constraint
then
7422 Set_Ekind
(Derived_Type
, Subtype_Kind
(Ekind
(Parent_Type
)));
7425 -- If we did not have a range constraint, then set the range from the
7426 -- parent type. Otherwise, the Process_Subtype call has set the bounds.
7428 if No_Constraint
or else not Has_Range_Constraint
(Indic
) then
7429 Set_Scalar_Range
(Derived_Type
,
7431 Low_Bound
=> New_Copy_Tree
(Type_Low_Bound
(Parent_Type
)),
7432 High_Bound
=> New_Copy_Tree
(Type_High_Bound
(Parent_Type
))));
7433 Set_Is_Constrained
(Derived_Type
, Is_Constrained
(Parent_Type
));
7435 if Has_Infinities
(Parent_Type
) then
7436 Set_Includes_Infinities
(Scalar_Range
(Derived_Type
));
7439 Set_Is_Known_Valid
(Derived_Type
, Is_Known_Valid
(Parent_Type
));
7442 Set_Is_Descendant_Of_Address
(Derived_Type
,
7443 Is_Descendant_Of_Address
(Parent_Type
));
7444 Set_Is_Descendant_Of_Address
(Implicit_Base
,
7445 Is_Descendant_Of_Address
(Parent_Type
));
7447 -- Set remaining type-specific fields, depending on numeric type
7449 if Is_Modular_Integer_Type
(Parent_Type
) then
7450 Set_Modulus
(Implicit_Base
, Modulus
(Parent_Base
));
7452 Set_Non_Binary_Modulus
7453 (Implicit_Base
, Non_Binary_Modulus
(Parent_Base
));
7456 (Implicit_Base
, Is_Known_Valid
(Parent_Base
));
7458 elsif Is_Floating_Point_Type
(Parent_Type
) then
7460 -- Digits of base type is always copied from the digits value of
7461 -- the parent base type, but the digits of the derived type will
7462 -- already have been set if there was a constraint present.
7464 Set_Digits_Value
(Implicit_Base
, Digits_Value
(Parent_Base
));
7465 Set_Float_Rep
(Implicit_Base
, Float_Rep
(Parent_Base
));
7467 if No_Constraint
then
7468 Set_Digits_Value
(Derived_Type
, Digits_Value
(Parent_Type
));
7471 elsif Is_Fixed_Point_Type
(Parent_Type
) then
7473 -- Small of base type and derived type are always copied from the
7474 -- parent base type, since smalls never change. The delta of the
7475 -- base type is also copied from the parent base type. However the
7476 -- delta of the derived type will have been set already if a
7477 -- constraint was present.
7479 Set_Small_Value
(Derived_Type
, Small_Value
(Parent_Base
));
7480 Set_Small_Value
(Implicit_Base
, Small_Value
(Parent_Base
));
7481 Set_Delta_Value
(Implicit_Base
, Delta_Value
(Parent_Base
));
7483 if No_Constraint
then
7484 Set_Delta_Value
(Derived_Type
, Delta_Value
(Parent_Type
));
7487 -- The scale and machine radix in the decimal case are always
7488 -- copied from the parent base type.
7490 if Is_Decimal_Fixed_Point_Type
(Parent_Type
) then
7491 Set_Scale_Value
(Derived_Type
, Scale_Value
(Parent_Base
));
7492 Set_Scale_Value
(Implicit_Base
, Scale_Value
(Parent_Base
));
7494 Set_Machine_Radix_10
7495 (Derived_Type
, Machine_Radix_10
(Parent_Base
));
7496 Set_Machine_Radix_10
7497 (Implicit_Base
, Machine_Radix_10
(Parent_Base
));
7499 Set_Digits_Value
(Implicit_Base
, Digits_Value
(Parent_Base
));
7501 if No_Constraint
then
7502 Set_Digits_Value
(Derived_Type
, Digits_Value
(Parent_Base
));
7505 -- the analysis of the subtype_indication sets the
7506 -- digits value of the derived type.
7513 if Is_Integer_Type
(Parent_Type
) then
7514 Set_Has_Shift_Operator
7515 (Implicit_Base
, Has_Shift_Operator
(Parent_Type
));
7518 -- The type of the bounds is that of the parent type, and they
7519 -- must be converted to the derived type.
7521 Convert_Scalar_Bounds
(N
, Parent_Type
, Derived_Type
, Loc
);
7523 -- The implicit_base should be frozen when the derived type is frozen,
7524 -- but note that it is used in the conversions of the bounds. For fixed
7525 -- types we delay the determination of the bounds until the proper
7526 -- freezing point. For other numeric types this is rejected by GCC, for
7527 -- reasons that are currently unclear (???), so we choose to freeze the
7528 -- implicit base now. In the case of integers and floating point types
7529 -- this is harmless because subsequent representation clauses cannot
7530 -- affect anything, but it is still baffling that we cannot use the
7531 -- same mechanism for all derived numeric types.
7533 -- There is a further complication: actually some representation
7534 -- clauses can affect the implicit base type. For example, attribute
7535 -- definition clauses for stream-oriented attributes need to set the
7536 -- corresponding TSS entries on the base type, and this normally
7537 -- cannot be done after the base type is frozen, so the circuitry in
7538 -- Sem_Ch13.New_Stream_Subprogram must account for this possibility
7539 -- and not use Set_TSS in this case.
7541 -- There are also consequences for the case of delayed representation
7542 -- aspects for some cases. For example, a Size aspect is delayed and
7543 -- should not be evaluated to the freeze point. This early freezing
7544 -- means that the size attribute evaluation happens too early???
7546 if Is_Fixed_Point_Type
(Parent_Type
) then
7547 Conditional_Delay
(Implicit_Base
, Parent_Type
);
7549 Freeze_Before
(N
, Implicit_Base
);
7551 end Build_Derived_Numeric_Type
;
7553 --------------------------------
7554 -- Build_Derived_Private_Type --
7555 --------------------------------
7557 procedure Build_Derived_Private_Type
7559 Parent_Type
: Entity_Id
;
7560 Derived_Type
: Entity_Id
;
7561 Is_Completion
: Boolean;
7562 Derive_Subps
: Boolean := True)
7564 Loc
: constant Source_Ptr
:= Sloc
(N
);
7565 Par_Base
: constant Entity_Id
:= Base_Type
(Parent_Type
);
7566 Par_Scope
: constant Entity_Id
:= Scope
(Par_Base
);
7567 Full_N
: constant Node_Id
:= New_Copy_Tree
(N
);
7568 Full_Der
: Entity_Id
:= New_Copy
(Derived_Type
);
7571 procedure Build_Full_Derivation
;
7572 -- Build full derivation, i.e. derive from the full view
7574 procedure Copy_And_Build
;
7575 -- Copy derived type declaration, replace parent with its full view,
7576 -- and build derivation
7578 ---------------------------
7579 -- Build_Full_Derivation --
7580 ---------------------------
7582 procedure Build_Full_Derivation
is
7584 -- If parent scope is not open, install the declarations
7586 if not In_Open_Scopes
(Par_Scope
) then
7587 Install_Private_Declarations
(Par_Scope
);
7588 Install_Visible_Declarations
(Par_Scope
);
7590 Uninstall_Declarations
(Par_Scope
);
7592 -- If parent scope is open and in another unit, and parent has a
7593 -- completion, then the derivation is taking place in the visible
7594 -- part of a child unit. In that case retrieve the full view of
7595 -- the parent momentarily.
7597 elsif not In_Same_Source_Unit
(N
, Parent_Type
) then
7598 Full_P
:= Full_View
(Parent_Type
);
7599 Exchange_Declarations
(Parent_Type
);
7601 Exchange_Declarations
(Full_P
);
7603 -- Otherwise it is a local derivation
7608 end Build_Full_Derivation
;
7610 --------------------
7611 -- Copy_And_Build --
7612 --------------------
7614 procedure Copy_And_Build
is
7615 Full_Parent
: Entity_Id
:= Parent_Type
;
7618 -- If the parent is itself derived from another private type,
7619 -- installing the private declarations has not affected its
7620 -- privacy status, so use its own full view explicitly.
7622 if Is_Private_Type
(Full_Parent
)
7623 and then Present
(Full_View
(Full_Parent
))
7625 Full_Parent
:= Full_View
(Full_Parent
);
7628 -- And its underlying full view if necessary
7630 if Is_Private_Type
(Full_Parent
)
7631 and then Present
(Underlying_Full_View
(Full_Parent
))
7633 Full_Parent
:= Underlying_Full_View
(Full_Parent
);
7636 -- For record, access and most enumeration types, derivation from
7637 -- the full view requires a fully-fledged declaration. In the other
7638 -- cases, just use an itype.
7640 if Ekind
(Full_Parent
) in Record_Kind
7641 or else Ekind
(Full_Parent
) in Access_Kind
7643 (Ekind
(Full_Parent
) in Enumeration_Kind
7644 and then not Is_Standard_Character_Type
(Full_Parent
)
7645 and then not Is_Generic_Type
(Root_Type
(Full_Parent
)))
7647 -- Copy and adjust declaration to provide a completion for what
7648 -- is originally a private declaration. Indicate that full view
7649 -- is internally generated.
7651 Set_Comes_From_Source
(Full_N
, False);
7652 Set_Comes_From_Source
(Full_Der
, False);
7653 Set_Parent
(Full_Der
, Full_N
);
7654 Set_Defining_Identifier
(Full_N
, Full_Der
);
7656 -- If there are no constraints, adjust the subtype mark
7658 if Nkind
(Subtype_Indication
(Type_Definition
(Full_N
))) /=
7659 N_Subtype_Indication
7661 Set_Subtype_Indication
7662 (Type_Definition
(Full_N
),
7663 New_Occurrence_Of
(Full_Parent
, Sloc
(Full_N
)));
7666 Insert_After
(N
, Full_N
);
7668 -- Build full view of derived type from full view of parent which
7669 -- is now installed. Subprograms have been derived on the partial
7670 -- view, the completion does not derive them anew.
7672 if Ekind
(Full_Parent
) in Record_Kind
then
7674 -- If parent type is tagged, the completion inherits the proper
7675 -- primitive operations.
7677 if Is_Tagged_Type
(Parent_Type
) then
7678 Build_Derived_Record_Type
7679 (Full_N
, Full_Parent
, Full_Der
, Derive_Subps
);
7681 Build_Derived_Record_Type
7682 (Full_N
, Full_Parent
, Full_Der
, Derive_Subps
=> False);
7687 (Full_N
, Full_Parent
, Full_Der
,
7688 Is_Completion
=> False, Derive_Subps
=> False);
7691 -- The full declaration has been introduced into the tree and
7692 -- processed in the step above. It should not be analyzed again
7693 -- (when encountered later in the current list of declarations)
7694 -- to prevent spurious name conflicts. The full entity remains
7697 Set_Analyzed
(Full_N
);
7701 Make_Defining_Identifier
(Sloc
(Derived_Type
),
7702 Chars
=> Chars
(Derived_Type
));
7703 Set_Is_Itype
(Full_Der
);
7704 Set_Associated_Node_For_Itype
(Full_Der
, N
);
7705 Set_Parent
(Full_Der
, N
);
7707 (N
, Full_Parent
, Full_Der
,
7708 Is_Completion
=> False, Derive_Subps
=> False);
7711 Set_Has_Private_Declaration
(Full_Der
);
7712 Set_Has_Private_Declaration
(Derived_Type
);
7714 Set_Scope
(Full_Der
, Scope
(Derived_Type
));
7715 Set_Is_First_Subtype
(Full_Der
, Is_First_Subtype
(Derived_Type
));
7716 Set_Has_Size_Clause
(Full_Der
, False);
7717 Set_Has_Alignment_Clause
(Full_Der
, False);
7718 Set_Has_Delayed_Freeze
(Full_Der
);
7719 Set_Is_Frozen
(Full_Der
, False);
7720 Set_Freeze_Node
(Full_Der
, Empty
);
7721 Set_Depends_On_Private
(Full_Der
, Has_Private_Component
(Full_Der
));
7722 Set_Is_Public
(Full_Der
, Is_Public
(Derived_Type
));
7724 -- The convention on the base type may be set in the private part
7725 -- and not propagated to the subtype until later, so we obtain the
7726 -- convention from the base type of the parent.
7728 Set_Convention
(Full_Der
, Convention
(Base_Type
(Full_Parent
)));
7731 -- Start of processing for Build_Derived_Private_Type
7734 if Is_Tagged_Type
(Parent_Type
) then
7735 Full_P
:= Full_View
(Parent_Type
);
7737 -- A type extension of a type with unknown discriminants is an
7738 -- indefinite type that the back-end cannot handle directly.
7739 -- We treat it as a private type, and build a completion that is
7740 -- derived from the full view of the parent, and hopefully has
7741 -- known discriminants.
7743 -- If the full view of the parent type has an underlying record view,
7744 -- use it to generate the underlying record view of this derived type
7745 -- (required for chains of derivations with unknown discriminants).
7747 -- Minor optimization: we avoid the generation of useless underlying
7748 -- record view entities if the private type declaration has unknown
7749 -- discriminants but its corresponding full view has no
7752 if Has_Unknown_Discriminants
(Parent_Type
)
7753 and then Present
(Full_P
)
7754 and then (Has_Discriminants
(Full_P
)
7755 or else Present
(Underlying_Record_View
(Full_P
)))
7756 and then not In_Open_Scopes
(Par_Scope
)
7757 and then Expander_Active
7760 Full_Der
: constant Entity_Id
:= Make_Temporary
(Loc
, 'T');
7761 New_Ext
: constant Node_Id
:=
7763 (Record_Extension_Part
(Type_Definition
(N
)));
7767 Build_Derived_Record_Type
7768 (N
, Parent_Type
, Derived_Type
, Derive_Subps
);
7770 -- Build anonymous completion, as a derivation from the full
7771 -- view of the parent. This is not a completion in the usual
7772 -- sense, because the current type is not private.
7775 Make_Full_Type_Declaration
(Loc
,
7776 Defining_Identifier
=> Full_Der
,
7778 Make_Derived_Type_Definition
(Loc
,
7779 Subtype_Indication
=>
7781 (Subtype_Indication
(Type_Definition
(N
))),
7782 Record_Extension_Part
=> New_Ext
));
7784 -- If the parent type has an underlying record view, use it
7785 -- here to build the new underlying record view.
7787 if Present
(Underlying_Record_View
(Full_P
)) then
7789 (Nkind
(Subtype_Indication
(Type_Definition
(Decl
)))
7791 Set_Entity
(Subtype_Indication
(Type_Definition
(Decl
)),
7792 Underlying_Record_View
(Full_P
));
7795 Install_Private_Declarations
(Par_Scope
);
7796 Install_Visible_Declarations
(Par_Scope
);
7797 Insert_Before
(N
, Decl
);
7799 -- Mark entity as an underlying record view before analysis,
7800 -- to avoid generating the list of its primitive operations
7801 -- (which is not really required for this entity) and thus
7802 -- prevent spurious errors associated with missing overriding
7803 -- of abstract primitives (overridden only for Derived_Type).
7805 Set_Ekind
(Full_Der
, E_Record_Type
);
7806 Set_Is_Underlying_Record_View
(Full_Der
);
7807 Set_Default_SSO
(Full_Der
);
7808 Set_No_Reordering
(Full_Der
, No_Component_Reordering
);
7812 pragma Assert
(Has_Discriminants
(Full_Der
)
7813 and then not Has_Unknown_Discriminants
(Full_Der
));
7815 Uninstall_Declarations
(Par_Scope
);
7817 -- Freeze the underlying record view, to prevent generation of
7818 -- useless dispatching information, which is simply shared with
7819 -- the real derived type.
7821 Set_Is_Frozen
(Full_Der
);
7823 -- If the derived type has access discriminants, create
7824 -- references to their anonymous types now, to prevent
7825 -- back-end problems when their first use is in generated
7826 -- bodies of primitives.
7832 E
:= First_Entity
(Full_Der
);
7834 while Present
(E
) loop
7835 if Ekind
(E
) = E_Discriminant
7836 and then Ekind
(Etype
(E
)) = E_Anonymous_Access_Type
7838 Build_Itype_Reference
(Etype
(E
), Decl
);
7845 -- Set up links between real entity and underlying record view
7847 Set_Underlying_Record_View
(Derived_Type
, Base_Type
(Full_Der
));
7848 Set_Underlying_Record_View
(Base_Type
(Full_Der
), Derived_Type
);
7851 -- If discriminants are known, build derived record
7854 Build_Derived_Record_Type
7855 (N
, Parent_Type
, Derived_Type
, Derive_Subps
);
7860 elsif Has_Discriminants
(Parent_Type
) then
7862 -- Build partial view of derived type from partial view of parent.
7863 -- This must be done before building the full derivation because the
7864 -- second derivation will modify the discriminants of the first and
7865 -- the discriminants are chained with the rest of the components in
7866 -- the full derivation.
7868 Build_Derived_Record_Type
7869 (N
, Parent_Type
, Derived_Type
, Derive_Subps
);
7871 -- Build the full derivation if this is not the anonymous derived
7872 -- base type created by Build_Derived_Record_Type in the constrained
7873 -- case (see point 5. of its head comment) since we build it for the
7874 -- derived subtype. And skip it for synchronized types altogether, as
7875 -- gigi does not use these types directly.
7877 if Present
(Full_View
(Parent_Type
))
7878 and then not Is_Itype
(Derived_Type
)
7879 and then not Is_Concurrent_Type
(Full_View
(Parent_Type
))
7882 Der_Base
: constant Entity_Id
:= Base_Type
(Derived_Type
);
7884 Last_Discr
: Entity_Id
;
7887 -- If this is not a completion, construct the implicit full
7888 -- view by deriving from the full view of the parent type.
7889 -- But if this is a completion, the derived private type
7890 -- being built is a full view and the full derivation can
7891 -- only be its underlying full view.
7893 Build_Full_Derivation
;
7895 if not Is_Completion
then
7896 Set_Full_View
(Derived_Type
, Full_Der
);
7898 Set_Underlying_Full_View
(Derived_Type
, Full_Der
);
7899 Set_Is_Underlying_Full_View
(Full_Der
);
7902 if not Is_Base_Type
(Derived_Type
) then
7903 Set_Full_View
(Der_Base
, Base_Type
(Full_Der
));
7906 -- Copy the discriminant list from full view to the partial
7907 -- view (base type and its subtype). Gigi requires that the
7908 -- partial and full views have the same discriminants.
7910 -- Note that since the partial view points to discriminants
7911 -- in the full view, their scope will be that of the full
7912 -- view. This might cause some front end problems and need
7915 Discr
:= First_Discriminant
(Base_Type
(Full_Der
));
7916 Set_First_Entity
(Der_Base
, Discr
);
7919 Last_Discr
:= Discr
;
7920 Next_Discriminant
(Discr
);
7921 exit when No
(Discr
);
7924 Set_Last_Entity
(Der_Base
, Last_Discr
);
7925 Set_First_Entity
(Derived_Type
, First_Entity
(Der_Base
));
7926 Set_Last_Entity
(Derived_Type
, Last_Entity
(Der_Base
));
7930 elsif Present
(Full_View
(Parent_Type
))
7931 and then Has_Discriminants
(Full_View
(Parent_Type
))
7933 if Has_Unknown_Discriminants
(Parent_Type
)
7934 and then Nkind
(Subtype_Indication
(Type_Definition
(N
))) =
7935 N_Subtype_Indication
7938 ("cannot constrain type with unknown discriminants",
7939 Subtype_Indication
(Type_Definition
(N
)));
7943 -- If this is not a completion, construct the implicit full view by
7944 -- deriving from the full view of the parent type. But if this is a
7945 -- completion, the derived private type being built is a full view
7946 -- and the full derivation can only be its underlying full view.
7948 Build_Full_Derivation
;
7950 if not Is_Completion
then
7951 Set_Full_View
(Derived_Type
, Full_Der
);
7953 Set_Underlying_Full_View
(Derived_Type
, Full_Der
);
7954 Set_Is_Underlying_Full_View
(Full_Der
);
7957 -- In any case, the primitive operations are inherited from the
7958 -- parent type, not from the internal full view.
7960 Set_Etype
(Base_Type
(Derived_Type
), Base_Type
(Parent_Type
));
7962 if Derive_Subps
then
7963 Derive_Subprograms
(Parent_Type
, Derived_Type
);
7966 Set_Stored_Constraint
(Derived_Type
, No_Elist
);
7968 (Derived_Type
, Is_Constrained
(Full_View
(Parent_Type
)));
7971 -- Untagged type, No discriminants on either view
7973 if Nkind
(Subtype_Indication
(Type_Definition
(N
))) =
7974 N_Subtype_Indication
7977 ("illegal constraint on type without discriminants", N
);
7980 if Present
(Discriminant_Specifications
(N
))
7981 and then Present
(Full_View
(Parent_Type
))
7982 and then not Is_Tagged_Type
(Full_View
(Parent_Type
))
7984 Error_Msg_N
("cannot add discriminants to untagged type", N
);
7987 Set_Stored_Constraint
(Derived_Type
, No_Elist
);
7988 Set_Is_Constrained
(Derived_Type
, Is_Constrained
(Parent_Type
));
7990 Set_Is_Controlled_Active
7991 (Derived_Type
, Is_Controlled_Active
(Parent_Type
));
7993 Set_Disable_Controlled
7994 (Derived_Type
, Disable_Controlled
(Parent_Type
));
7996 Set_Has_Controlled_Component
7997 (Derived_Type
, Has_Controlled_Component
(Parent_Type
));
7999 -- Direct controlled types do not inherit Finalize_Storage_Only flag
8001 if not Is_Controlled
(Parent_Type
) then
8002 Set_Finalize_Storage_Only
8003 (Base_Type
(Derived_Type
), Finalize_Storage_Only
(Parent_Type
));
8006 -- If this is not a completion, construct the implicit full view by
8007 -- deriving from the full view of the parent type.
8009 -- ??? If the parent is untagged private and its completion is
8010 -- tagged, this mechanism will not work because we cannot derive from
8011 -- the tagged full view unless we have an extension.
8013 if Present
(Full_View
(Parent_Type
))
8014 and then not Is_Tagged_Type
(Full_View
(Parent_Type
))
8015 and then not Is_Completion
8017 Build_Full_Derivation
;
8018 Set_Full_View
(Derived_Type
, Full_Der
);
8022 Set_Has_Unknown_Discriminants
(Derived_Type
,
8023 Has_Unknown_Discriminants
(Parent_Type
));
8025 if Is_Private_Type
(Derived_Type
) then
8026 Set_Private_Dependents
(Derived_Type
, New_Elmt_List
);
8029 -- If the parent base type is in scope, add the derived type to its
8030 -- list of private dependents, because its full view may become
8031 -- visible subsequently (in a nested private part, a body, or in a
8032 -- further child unit).
8034 if Is_Private_Type
(Par_Base
) and then In_Open_Scopes
(Par_Scope
) then
8035 Append_Elmt
(Derived_Type
, Private_Dependents
(Parent_Type
));
8037 -- Check for unusual case where a type completed by a private
8038 -- derivation occurs within a package nested in a child unit, and
8039 -- the parent is declared in an ancestor.
8041 if Is_Child_Unit
(Scope
(Current_Scope
))
8042 and then Is_Completion
8043 and then In_Private_Part
(Current_Scope
)
8044 and then Scope
(Parent_Type
) /= Current_Scope
8046 -- Note that if the parent has a completion in the private part,
8047 -- (which is itself a derivation from some other private type)
8048 -- it is that completion that is visible, there is no full view
8049 -- available, and no special processing is needed.
8051 and then Present
(Full_View
(Parent_Type
))
8053 -- In this case, the full view of the parent type will become
8054 -- visible in the body of the enclosing child, and only then will
8055 -- the current type be possibly non-private. Build an underlying
8056 -- full view that will be installed when the enclosing child body
8059 if Present
(Underlying_Full_View
(Derived_Type
)) then
8060 Full_Der
:= Underlying_Full_View
(Derived_Type
);
8062 Build_Full_Derivation
;
8063 Set_Underlying_Full_View
(Derived_Type
, Full_Der
);
8064 Set_Is_Underlying_Full_View
(Full_Der
);
8067 -- The full view will be used to swap entities on entry/exit to
8068 -- the body, and must appear in the entity list for the package.
8070 Append_Entity
(Full_Der
, Scope
(Derived_Type
));
8073 end Build_Derived_Private_Type
;
8075 -------------------------------
8076 -- Build_Derived_Record_Type --
8077 -------------------------------
8081 -- Ideally we would like to use the same model of type derivation for
8082 -- tagged and untagged record types. Unfortunately this is not quite
8083 -- possible because the semantics of representation clauses is different
8084 -- for tagged and untagged records under inheritance. Consider the
8087 -- type R (...) is [tagged] record ... end record;
8088 -- type T (...) is new R (...) [with ...];
8090 -- The representation clauses for T can specify a completely different
8091 -- record layout from R's. Hence the same component can be placed in two
8092 -- very different positions in objects of type T and R. If R and T are
8093 -- tagged types, representation clauses for T can only specify the layout
8094 -- of non inherited components, thus components that are common in R and T
8095 -- have the same position in objects of type R and T.
8097 -- This has two implications. The first is that the entire tree for R's
8098 -- declaration needs to be copied for T in the untagged case, so that T
8099 -- can be viewed as a record type of its own with its own representation
8100 -- clauses. The second implication is the way we handle discriminants.
8101 -- Specifically, in the untagged case we need a way to communicate to Gigi
8102 -- what are the real discriminants in the record, while for the semantics
8103 -- we need to consider those introduced by the user to rename the
8104 -- discriminants in the parent type. This is handled by introducing the
8105 -- notion of stored discriminants. See below for more.
8107 -- Fortunately the way regular components are inherited can be handled in
8108 -- the same way in tagged and untagged types.
8110 -- To complicate things a bit more the private view of a private extension
8111 -- cannot be handled in the same way as the full view (for one thing the
8112 -- semantic rules are somewhat different). We will explain what differs
8115 -- 2. DISCRIMINANTS UNDER INHERITANCE
8117 -- The semantic rules governing the discriminants of derived types are
8120 -- type Derived_Type_Name [KNOWN_DISCRIMINANT_PART] is new
8121 -- [abstract] Parent_Type_Name [CONSTRAINT] [RECORD_EXTENSION_PART]
8123 -- If parent type has discriminants, then the discriminants that are
8124 -- declared in the derived type are [3.4 (11)]:
8126 -- o The discriminants specified by a new KNOWN_DISCRIMINANT_PART, if
8129 -- o Otherwise, each discriminant of the parent type (implicitly declared
8130 -- in the same order with the same specifications). In this case, the
8131 -- discriminants are said to be "inherited", or if unknown in the parent
8132 -- are also unknown in the derived type.
8134 -- Furthermore if a KNOWN_DISCRIMINANT_PART is provided, then [3.7(13-18)]:
8136 -- o The parent subtype must be constrained;
8138 -- o If the parent type is not a tagged type, then each discriminant of
8139 -- the derived type must be used in the constraint defining a parent
8140 -- subtype. [Implementation note: This ensures that the new discriminant
8141 -- can share storage with an existing discriminant.]
8143 -- For the derived type each discriminant of the parent type is either
8144 -- inherited, constrained to equal some new discriminant of the derived
8145 -- type, or constrained to the value of an expression.
8147 -- When inherited or constrained to equal some new discriminant, the
8148 -- parent discriminant and the discriminant of the derived type are said
8151 -- If a discriminant of the parent type is constrained to a specific value
8152 -- in the derived type definition, then the discriminant is said to be
8153 -- "specified" by that derived type definition.
8155 -- 3. DISCRIMINANTS IN DERIVED UNTAGGED RECORD TYPES
8157 -- We have spoken about stored discriminants in point 1 (introduction)
8158 -- above. There are two sorts of stored discriminants: implicit and
8159 -- explicit. As long as the derived type inherits the same discriminants as
8160 -- the root record type, stored discriminants are the same as regular
8161 -- discriminants, and are said to be implicit. However, if any discriminant
8162 -- in the root type was renamed in the derived type, then the derived
8163 -- type will contain explicit stored discriminants. Explicit stored
8164 -- discriminants are discriminants in addition to the semantically visible
8165 -- discriminants defined for the derived type. Stored discriminants are
8166 -- used by Gigi to figure out what are the physical discriminants in
8167 -- objects of the derived type (see precise definition in einfo.ads).
8168 -- As an example, consider the following:
8170 -- type R (D1, D2, D3 : Int) is record ... end record;
8171 -- type T1 is new R;
8172 -- type T2 (X1, X2: Int) is new T1 (X2, 88, X1);
8173 -- type T3 is new T2;
8174 -- type T4 (Y : Int) is new T3 (Y, 99);
8176 -- The following table summarizes the discriminants and stored
8177 -- discriminants in R and T1 through T4:
8179 -- Type Discrim Stored Discrim Comment
8180 -- R (D1, D2, D3) (D1, D2, D3) Girder discrims implicit in R
8181 -- T1 (D1, D2, D3) (D1, D2, D3) Girder discrims implicit in T1
8182 -- T2 (X1, X2) (D1, D2, D3) Girder discrims EXPLICIT in T2
8183 -- T3 (X1, X2) (D1, D2, D3) Girder discrims EXPLICIT in T3
8184 -- T4 (Y) (D1, D2, D3) Girder discrims EXPLICIT in T4
8186 -- Field Corresponding_Discriminant (abbreviated CD below) allows us to
8187 -- find the corresponding discriminant in the parent type, while
8188 -- Original_Record_Component (abbreviated ORC below) the actual physical
8189 -- component that is renamed. Finally the field Is_Completely_Hidden
8190 -- (abbreviated ICH below) is set for all explicit stored discriminants
8191 -- (see einfo.ads for more info). For the above example this gives:
8193 -- Discrim CD ORC ICH
8194 -- ^^^^^^^ ^^ ^^^ ^^^
8195 -- D1 in R empty itself no
8196 -- D2 in R empty itself no
8197 -- D3 in R empty itself no
8199 -- D1 in T1 D1 in R itself no
8200 -- D2 in T1 D2 in R itself no
8201 -- D3 in T1 D3 in R itself no
8203 -- X1 in T2 D3 in T1 D3 in T2 no
8204 -- X2 in T2 D1 in T1 D1 in T2 no
8205 -- D1 in T2 empty itself yes
8206 -- D2 in T2 empty itself yes
8207 -- D3 in T2 empty itself yes
8209 -- X1 in T3 X1 in T2 D3 in T3 no
8210 -- X2 in T3 X2 in T2 D1 in T3 no
8211 -- D1 in T3 empty itself yes
8212 -- D2 in T3 empty itself yes
8213 -- D3 in T3 empty itself yes
8215 -- Y in T4 X1 in T3 D3 in T4 no
8216 -- D1 in T4 empty itself yes
8217 -- D2 in T4 empty itself yes
8218 -- D3 in T4 empty itself yes
8220 -- 4. DISCRIMINANTS IN DERIVED TAGGED RECORD TYPES
8222 -- Type derivation for tagged types is fairly straightforward. If no
8223 -- discriminants are specified by the derived type, these are inherited
8224 -- from the parent. No explicit stored discriminants are ever necessary.
8225 -- The only manipulation that is done to the tree is that of adding a
8226 -- _parent field with parent type and constrained to the same constraint
8227 -- specified for the parent in the derived type definition. For instance:
8229 -- type R (D1, D2, D3 : Int) is tagged record ... end record;
8230 -- type T1 is new R with null record;
8231 -- type T2 (X1, X2: Int) is new T1 (X2, 88, X1) with null record;
8233 -- are changed into:
8235 -- type T1 (D1, D2, D3 : Int) is new R (D1, D2, D3) with record
8236 -- _parent : R (D1, D2, D3);
8239 -- type T2 (X1, X2: Int) is new T1 (X2, 88, X1) with record
8240 -- _parent : T1 (X2, 88, X1);
8243 -- The discriminants actually present in R, T1 and T2 as well as their CD,
8244 -- ORC and ICH fields are:
8246 -- Discrim CD ORC ICH
8247 -- ^^^^^^^ ^^ ^^^ ^^^
8248 -- D1 in R empty itself no
8249 -- D2 in R empty itself no
8250 -- D3 in R empty itself no
8252 -- D1 in T1 D1 in R D1 in R no
8253 -- D2 in T1 D2 in R D2 in R no
8254 -- D3 in T1 D3 in R D3 in R no
8256 -- X1 in T2 D3 in T1 D3 in R no
8257 -- X2 in T2 D1 in T1 D1 in R no
8259 -- 5. FIRST TRANSFORMATION FOR DERIVED RECORDS
8261 -- Regardless of whether we dealing with a tagged or untagged type
8262 -- we will transform all derived type declarations of the form
8264 -- type T is new R (...) [with ...];
8266 -- subtype S is R (...);
8267 -- type T is new S [with ...];
8269 -- type BT is new R [with ...];
8270 -- subtype T is BT (...);
8272 -- That is, the base derived type is constrained only if it has no
8273 -- discriminants. The reason for doing this is that GNAT's semantic model
8274 -- assumes that a base type with discriminants is unconstrained.
8276 -- Note that, strictly speaking, the above transformation is not always
8277 -- correct. Consider for instance the following excerpt from ACVC b34011a:
8279 -- procedure B34011A is
8280 -- type REC (D : integer := 0) is record
8285 -- type T6 is new Rec;
8286 -- function F return T6;
8291 -- type U is new T6 (Q6.F.I); -- ERROR: Q6.F.
8294 -- The definition of Q6.U is illegal. However transforming Q6.U into
8296 -- type BaseU is new T6;
8297 -- subtype U is BaseU (Q6.F.I)
8299 -- turns U into a legal subtype, which is incorrect. To avoid this problem
8300 -- we always analyze the constraint (in this case (Q6.F.I)) before applying
8301 -- the transformation described above.
8303 -- There is another instance where the above transformation is incorrect.
8307 -- type Base (D : Integer) is tagged null record;
8308 -- procedure P (X : Base);
8310 -- type Der is new Base (2) with null record;
8311 -- procedure P (X : Der);
8314 -- Then the above transformation turns this into
8316 -- type Der_Base is new Base with null record;
8317 -- -- procedure P (X : Base) is implicitly inherited here
8318 -- -- as procedure P (X : Der_Base).
8320 -- subtype Der is Der_Base (2);
8321 -- procedure P (X : Der);
8322 -- -- The overriding of P (X : Der_Base) is illegal since we
8323 -- -- have a parameter conformance problem.
8325 -- To get around this problem, after having semantically processed Der_Base
8326 -- and the rewritten subtype declaration for Der, we copy Der_Base field
8327 -- Discriminant_Constraint from Der so that when parameter conformance is
8328 -- checked when P is overridden, no semantic errors are flagged.
8330 -- 6. SECOND TRANSFORMATION FOR DERIVED RECORDS
8332 -- Regardless of whether we are dealing with a tagged or untagged type
8333 -- we will transform all derived type declarations of the form
8335 -- type R (D1, .., Dn : ...) is [tagged] record ...;
8336 -- type T is new R [with ...];
8338 -- type T (D1, .., Dn : ...) is new R (D1, .., Dn) [with ...];
8340 -- The reason for such transformation is that it allows us to implement a
8341 -- very clean form of component inheritance as explained below.
8343 -- Note that this transformation is not achieved by direct tree rewriting
8344 -- and manipulation, but rather by redoing the semantic actions that the
8345 -- above transformation will entail. This is done directly in routine
8346 -- Inherit_Components.
8348 -- 7. TYPE DERIVATION AND COMPONENT INHERITANCE
8350 -- In both tagged and untagged derived types, regular non discriminant
8351 -- components are inherited in the derived type from the parent type. In
8352 -- the absence of discriminants component, inheritance is straightforward
8353 -- as components can simply be copied from the parent.
8355 -- If the parent has discriminants, inheriting components constrained with
8356 -- these discriminants requires caution. Consider the following example:
8358 -- type R (D1, D2 : Positive) is [tagged] record
8359 -- S : String (D1 .. D2);
8362 -- type T1 is new R [with null record];
8363 -- type T2 (X : positive) is new R (1, X) [with null record];
8365 -- As explained in 6. above, T1 is rewritten as
8366 -- type T1 (D1, D2 : Positive) is new R (D1, D2) [with null record];
8367 -- which makes the treatment for T1 and T2 identical.
8369 -- What we want when inheriting S, is that references to D1 and D2 in R are
8370 -- replaced with references to their correct constraints, i.e. D1 and D2 in
8371 -- T1 and 1 and X in T2. So all R's discriminant references are replaced
8372 -- with either discriminant references in the derived type or expressions.
8373 -- This replacement is achieved as follows: before inheriting R's
8374 -- components, a subtype R (D1, D2) for T1 (resp. R (1, X) for T2) is
8375 -- created in the scope of T1 (resp. scope of T2) so that discriminants D1
8376 -- and D2 of T1 are visible (resp. discriminant X of T2 is visible).
8377 -- For T2, for instance, this has the effect of replacing String (D1 .. D2)
8378 -- by String (1 .. X).
8380 -- 8. TYPE DERIVATION IN PRIVATE TYPE EXTENSIONS
8382 -- We explain here the rules governing private type extensions relevant to
8383 -- type derivation. These rules are explained on the following example:
8385 -- type D [(...)] is new A [(...)] with private; <-- partial view
8386 -- type D [(...)] is new P [(...)] with null record; <-- full view
8388 -- Type A is called the ancestor subtype of the private extension.
8389 -- Type P is the parent type of the full view of the private extension. It
8390 -- must be A or a type derived from A.
8392 -- The rules concerning the discriminants of private type extensions are
8395 -- o If a private extension inherits known discriminants from the ancestor
8396 -- subtype, then the full view must also inherit its discriminants from
8397 -- the ancestor subtype and the parent subtype of the full view must be
8398 -- constrained if and only if the ancestor subtype is constrained.
8400 -- o If a partial view has unknown discriminants, then the full view may
8401 -- define a definite or an indefinite subtype, with or without
8404 -- o If a partial view has neither known nor unknown discriminants, then
8405 -- the full view must define a definite subtype.
8407 -- o If the ancestor subtype of a private extension has constrained
8408 -- discriminants, then the parent subtype of the full view must impose a
8409 -- statically matching constraint on those discriminants.
8411 -- This means that only the following forms of private extensions are
8414 -- type D is new A with private; <-- partial view
8415 -- type D is new P with null record; <-- full view
8417 -- If A has no discriminants than P has no discriminants, otherwise P must
8418 -- inherit A's discriminants.
8420 -- type D is new A (...) with private; <-- partial view
8421 -- type D is new P (:::) with null record; <-- full view
8423 -- P must inherit A's discriminants and (...) and (:::) must statically
8426 -- subtype A is R (...);
8427 -- type D is new A with private; <-- partial view
8428 -- type D is new P with null record; <-- full view
8430 -- P must have inherited R's discriminants and must be derived from A or
8431 -- any of its subtypes.
8433 -- type D (..) is new A with private; <-- partial view
8434 -- type D (..) is new P [(:::)] with null record; <-- full view
8436 -- No specific constraints on P's discriminants or constraint (:::).
8437 -- Note that A can be unconstrained, but the parent subtype P must either
8438 -- be constrained or (:::) must be present.
8440 -- type D (..) is new A [(...)] with private; <-- partial view
8441 -- type D (..) is new P [(:::)] with null record; <-- full view
8443 -- P's constraints on A's discriminants must statically match those
8444 -- imposed by (...).
8446 -- 9. IMPLEMENTATION OF TYPE DERIVATION FOR PRIVATE EXTENSIONS
8448 -- The full view of a private extension is handled exactly as described
8449 -- above. The model chose for the private view of a private extension is
8450 -- the same for what concerns discriminants (i.e. they receive the same
8451 -- treatment as in the tagged case). However, the private view of the
8452 -- private extension always inherits the components of the parent base,
8453 -- without replacing any discriminant reference. Strictly speaking this is
8454 -- incorrect. However, Gigi never uses this view to generate code so this
8455 -- is a purely semantic issue. In theory, a set of transformations similar
8456 -- to those given in 5. and 6. above could be applied to private views of
8457 -- private extensions to have the same model of component inheritance as
8458 -- for non private extensions. However, this is not done because it would
8459 -- further complicate private type processing. Semantically speaking, this
8460 -- leaves us in an uncomfortable situation. As an example consider:
8463 -- type R (D : integer) is tagged record
8464 -- S : String (1 .. D);
8466 -- procedure P (X : R);
8467 -- type T is new R (1) with private;
8469 -- type T is new R (1) with null record;
8472 -- This is transformed into:
8475 -- type R (D : integer) is tagged record
8476 -- S : String (1 .. D);
8478 -- procedure P (X : R);
8479 -- type T is new R (1) with private;
8481 -- type BaseT is new R with null record;
8482 -- subtype T is BaseT (1);
8485 -- (strictly speaking the above is incorrect Ada)
8487 -- From the semantic standpoint the private view of private extension T
8488 -- should be flagged as constrained since one can clearly have
8492 -- in a unit withing Pack. However, when deriving subprograms for the
8493 -- private view of private extension T, T must be seen as unconstrained
8494 -- since T has discriminants (this is a constraint of the current
8495 -- subprogram derivation model). Thus, when processing the private view of
8496 -- a private extension such as T, we first mark T as unconstrained, we
8497 -- process it, we perform program derivation and just before returning from
8498 -- Build_Derived_Record_Type we mark T as constrained.
8500 -- ??? Are there are other uncomfortable cases that we will have to
8503 -- 10. RECORD_TYPE_WITH_PRIVATE complications
8505 -- Types that are derived from a visible record type and have a private
8506 -- extension present other peculiarities. They behave mostly like private
8507 -- types, but if they have primitive operations defined, these will not
8508 -- have the proper signatures for further inheritance, because other
8509 -- primitive operations will use the implicit base that we define for
8510 -- private derivations below. This affect subprogram inheritance (see
8511 -- Derive_Subprograms for details). We also derive the implicit base from
8512 -- the base type of the full view, so that the implicit base is a record
8513 -- type and not another private type, This avoids infinite loops.
8515 procedure Build_Derived_Record_Type
8517 Parent_Type
: Entity_Id
;
8518 Derived_Type
: Entity_Id
;
8519 Derive_Subps
: Boolean := True)
8521 Discriminant_Specs
: constant Boolean :=
8522 Present
(Discriminant_Specifications
(N
));
8523 Is_Tagged
: constant Boolean := Is_Tagged_Type
(Parent_Type
);
8524 Loc
: constant Source_Ptr
:= Sloc
(N
);
8525 Private_Extension
: constant Boolean :=
8526 Nkind
(N
) = N_Private_Extension_Declaration
;
8527 Assoc_List
: Elist_Id
;
8528 Constraint_Present
: Boolean;
8530 Discrim
: Entity_Id
;
8532 Inherit_Discrims
: Boolean := False;
8533 Last_Discrim
: Entity_Id
;
8534 New_Base
: Entity_Id
;
8536 New_Discrs
: Elist_Id
;
8537 New_Indic
: Node_Id
;
8538 Parent_Base
: Entity_Id
;
8539 Save_Etype
: Entity_Id
;
8540 Save_Discr_Constr
: Elist_Id
;
8541 Save_Next_Entity
: Entity_Id
;
8544 Discs
: Elist_Id
:= New_Elmt_List
;
8545 -- An empty Discs list means that there were no constraints in the
8546 -- subtype indication or that there was an error processing it.
8549 if Ekind
(Parent_Type
) = E_Record_Type_With_Private
8550 and then Present
(Full_View
(Parent_Type
))
8551 and then Has_Discriminants
(Parent_Type
)
8553 Parent_Base
:= Base_Type
(Full_View
(Parent_Type
));
8555 Parent_Base
:= Base_Type
(Parent_Type
);
8558 -- AI05-0115: if this is a derivation from a private type in some
8559 -- other scope that may lead to invisible components for the derived
8560 -- type, mark it accordingly.
8562 if Is_Private_Type
(Parent_Type
) then
8563 if Scope
(Parent_Base
) = Scope
(Derived_Type
) then
8566 elsif In_Open_Scopes
(Scope
(Parent_Base
))
8567 and then In_Private_Part
(Scope
(Parent_Base
))
8572 Set_Has_Private_Ancestor
(Derived_Type
);
8576 Set_Has_Private_Ancestor
8577 (Derived_Type
, Has_Private_Ancestor
(Parent_Type
));
8580 -- Before we start the previously documented transformations, here is
8581 -- little fix for size and alignment of tagged types. Normally when we
8582 -- derive type D from type P, we copy the size and alignment of P as the
8583 -- default for D, and in the absence of explicit representation clauses
8584 -- for D, the size and alignment are indeed the same as the parent.
8586 -- But this is wrong for tagged types, since fields may be added, and
8587 -- the default size may need to be larger, and the default alignment may
8588 -- need to be larger.
8590 -- We therefore reset the size and alignment fields in the tagged case.
8591 -- Note that the size and alignment will in any case be at least as
8592 -- large as the parent type (since the derived type has a copy of the
8593 -- parent type in the _parent field)
8595 -- The type is also marked as being tagged here, which is needed when
8596 -- processing components with a self-referential anonymous access type
8597 -- in the call to Check_Anonymous_Access_Components below. Note that
8598 -- this flag is also set later on for completeness.
8601 Set_Is_Tagged_Type
(Derived_Type
);
8602 Init_Size_Align
(Derived_Type
);
8605 -- STEP 0a: figure out what kind of derived type declaration we have
8607 if Private_Extension
then
8609 Set_Ekind
(Derived_Type
, E_Record_Type_With_Private
);
8610 Set_Default_SSO
(Derived_Type
);
8611 Set_No_Reordering
(Derived_Type
, No_Component_Reordering
);
8614 Type_Def
:= Type_Definition
(N
);
8616 -- Ekind (Parent_Base) is not necessarily E_Record_Type since
8617 -- Parent_Base can be a private type or private extension. However,
8618 -- for tagged types with an extension the newly added fields are
8619 -- visible and hence the Derived_Type is always an E_Record_Type.
8620 -- (except that the parent may have its own private fields).
8621 -- For untagged types we preserve the Ekind of the Parent_Base.
8623 if Present
(Record_Extension_Part
(Type_Def
)) then
8624 Set_Ekind
(Derived_Type
, E_Record_Type
);
8625 Set_Default_SSO
(Derived_Type
);
8626 Set_No_Reordering
(Derived_Type
, No_Component_Reordering
);
8628 -- Create internal access types for components with anonymous
8631 if Ada_Version
>= Ada_2005
then
8632 Check_Anonymous_Access_Components
8633 (N
, Derived_Type
, Derived_Type
,
8634 Component_List
(Record_Extension_Part
(Type_Def
)));
8638 Set_Ekind
(Derived_Type
, Ekind
(Parent_Base
));
8642 -- Indic can either be an N_Identifier if the subtype indication
8643 -- contains no constraint or an N_Subtype_Indication if the subtype
8644 -- indication has a constraint.
8646 Indic
:= Subtype_Indication
(Type_Def
);
8647 Constraint_Present
:= (Nkind
(Indic
) = N_Subtype_Indication
);
8649 -- Check that the type has visible discriminants. The type may be
8650 -- a private type with unknown discriminants whose full view has
8651 -- discriminants which are invisible.
8653 if Constraint_Present
then
8654 if not Has_Discriminants
(Parent_Base
)
8656 (Has_Unknown_Discriminants
(Parent_Base
)
8657 and then Is_Private_Type
(Parent_Base
))
8660 ("invalid constraint: type has no discriminant",
8661 Constraint
(Indic
));
8663 Constraint_Present
:= False;
8664 Rewrite
(Indic
, New_Copy_Tree
(Subtype_Mark
(Indic
)));
8666 elsif Is_Constrained
(Parent_Type
) then
8668 ("invalid constraint: parent type is already constrained",
8669 Constraint
(Indic
));
8671 Constraint_Present
:= False;
8672 Rewrite
(Indic
, New_Copy_Tree
(Subtype_Mark
(Indic
)));
8676 -- STEP 0b: If needed, apply transformation given in point 5. above
8678 if not Private_Extension
8679 and then Has_Discriminants
(Parent_Type
)
8680 and then not Discriminant_Specs
8681 and then (Is_Constrained
(Parent_Type
) or else Constraint_Present
)
8683 -- First, we must analyze the constraint (see comment in point 5.)
8684 -- The constraint may come from the subtype indication of the full
8687 if Constraint_Present
then
8688 New_Discrs
:= Build_Discriminant_Constraints
(Parent_Type
, Indic
);
8690 -- If there is no explicit constraint, there might be one that is
8691 -- inherited from a constrained parent type. In that case verify that
8692 -- it conforms to the constraint in the partial view. In perverse
8693 -- cases the parent subtypes of the partial and full view can have
8694 -- different constraints.
8696 elsif Present
(Stored_Constraint
(Parent_Type
)) then
8697 New_Discrs
:= Stored_Constraint
(Parent_Type
);
8700 New_Discrs
:= No_Elist
;
8703 if Has_Discriminants
(Derived_Type
)
8704 and then Has_Private_Declaration
(Derived_Type
)
8705 and then Present
(Discriminant_Constraint
(Derived_Type
))
8706 and then Present
(New_Discrs
)
8708 -- Verify that constraints of the full view statically match
8709 -- those given in the partial view.
8715 C1
:= First_Elmt
(New_Discrs
);
8716 C2
:= First_Elmt
(Discriminant_Constraint
(Derived_Type
));
8717 while Present
(C1
) and then Present
(C2
) loop
8718 if Fully_Conformant_Expressions
(Node
(C1
), Node
(C2
))
8720 (Is_OK_Static_Expression
(Node
(C1
))
8721 and then Is_OK_Static_Expression
(Node
(C2
))
8723 Expr_Value
(Node
(C1
)) = Expr_Value
(Node
(C2
)))
8728 if Constraint_Present
then
8730 ("constraint not conformant to previous declaration",
8734 ("constraint of full view is incompatible "
8735 & "with partial view", N
);
8745 -- Insert and analyze the declaration for the unconstrained base type
8747 New_Base
:= Create_Itype
(Ekind
(Derived_Type
), N
, Derived_Type
, 'B');
8750 Make_Full_Type_Declaration
(Loc
,
8751 Defining_Identifier
=> New_Base
,
8753 Make_Derived_Type_Definition
(Loc
,
8754 Abstract_Present
=> Abstract_Present
(Type_Def
),
8755 Limited_Present
=> Limited_Present
(Type_Def
),
8756 Subtype_Indication
=>
8757 New_Occurrence_Of
(Parent_Base
, Loc
),
8758 Record_Extension_Part
=>
8759 Relocate_Node
(Record_Extension_Part
(Type_Def
)),
8760 Interface_List
=> Interface_List
(Type_Def
)));
8762 Set_Parent
(New_Decl
, Parent
(N
));
8763 Mark_Rewrite_Insertion
(New_Decl
);
8764 Insert_Before
(N
, New_Decl
);
8766 -- In the extension case, make sure ancestor is frozen appropriately
8767 -- (see also non-discriminated case below).
8769 if Present
(Record_Extension_Part
(Type_Def
))
8770 or else Is_Interface
(Parent_Base
)
8772 Freeze_Before
(New_Decl
, Parent_Type
);
8775 -- Note that this call passes False for the Derive_Subps parameter
8776 -- because subprogram derivation is deferred until after creating
8777 -- the subtype (see below).
8780 (New_Decl
, Parent_Base
, New_Base
,
8781 Is_Completion
=> False, Derive_Subps
=> False);
8783 -- ??? This needs re-examination to determine whether the
8784 -- above call can simply be replaced by a call to Analyze.
8786 Set_Analyzed
(New_Decl
);
8788 -- Insert and analyze the declaration for the constrained subtype
8790 if Constraint_Present
then
8792 Make_Subtype_Indication
(Loc
,
8793 Subtype_Mark
=> New_Occurrence_Of
(New_Base
, Loc
),
8794 Constraint
=> Relocate_Node
(Constraint
(Indic
)));
8798 Constr_List
: constant List_Id
:= New_List
;
8803 C
:= First_Elmt
(Discriminant_Constraint
(Parent_Type
));
8804 while Present
(C
) loop
8807 -- It is safe here to call New_Copy_Tree since we called
8808 -- Force_Evaluation on each constraint previously
8809 -- in Build_Discriminant_Constraints.
8811 Append
(New_Copy_Tree
(Expr
), To
=> Constr_List
);
8817 Make_Subtype_Indication
(Loc
,
8818 Subtype_Mark
=> New_Occurrence_Of
(New_Base
, Loc
),
8820 Make_Index_Or_Discriminant_Constraint
(Loc
, Constr_List
));
8825 Make_Subtype_Declaration
(Loc
,
8826 Defining_Identifier
=> Derived_Type
,
8827 Subtype_Indication
=> New_Indic
));
8831 -- Derivation of subprograms must be delayed until the full subtype
8832 -- has been established, to ensure proper overriding of subprograms
8833 -- inherited by full types. If the derivations occurred as part of
8834 -- the call to Build_Derived_Type above, then the check for type
8835 -- conformance would fail because earlier primitive subprograms
8836 -- could still refer to the full type prior the change to the new
8837 -- subtype and hence would not match the new base type created here.
8838 -- Subprograms are not derived, however, when Derive_Subps is False
8839 -- (since otherwise there could be redundant derivations).
8841 if Derive_Subps
then
8842 Derive_Subprograms
(Parent_Type
, Derived_Type
);
8845 -- For tagged types the Discriminant_Constraint of the new base itype
8846 -- is inherited from the first subtype so that no subtype conformance
8847 -- problem arise when the first subtype overrides primitive
8848 -- operations inherited by the implicit base type.
8851 Set_Discriminant_Constraint
8852 (New_Base
, Discriminant_Constraint
(Derived_Type
));
8858 -- If we get here Derived_Type will have no discriminants or it will be
8859 -- a discriminated unconstrained base type.
8861 -- STEP 1a: perform preliminary actions/checks for derived tagged types
8865 -- The parent type is frozen for non-private extensions (RM 13.14(7))
8866 -- The declaration of a specific descendant of an interface type
8867 -- freezes the interface type (RM 13.14).
8869 if not Private_Extension
or else Is_Interface
(Parent_Base
) then
8870 Freeze_Before
(N
, Parent_Type
);
8873 -- In Ada 2005 (AI-344), the restriction that a derived tagged type
8874 -- cannot be declared at a deeper level than its parent type is
8875 -- removed. The check on derivation within a generic body is also
8876 -- relaxed, but there's a restriction that a derived tagged type
8877 -- cannot be declared in a generic body if it's derived directly
8878 -- or indirectly from a formal type of that generic.
8880 if Ada_Version
>= Ada_2005
then
8881 if Present
(Enclosing_Generic_Body
(Derived_Type
)) then
8883 Ancestor_Type
: Entity_Id
;
8886 -- Check to see if any ancestor of the derived type is a
8889 Ancestor_Type
:= Parent_Type
;
8890 while not Is_Generic_Type
(Ancestor_Type
)
8891 and then Etype
(Ancestor_Type
) /= Ancestor_Type
8893 Ancestor_Type
:= Etype
(Ancestor_Type
);
8896 -- If the derived type does have a formal type as an
8897 -- ancestor, then it's an error if the derived type is
8898 -- declared within the body of the generic unit that
8899 -- declares the formal type in its generic formal part. It's
8900 -- sufficient to check whether the ancestor type is declared
8901 -- inside the same generic body as the derived type (such as
8902 -- within a nested generic spec), in which case the
8903 -- derivation is legal. If the formal type is declared
8904 -- outside of that generic body, then it's guaranteed that
8905 -- the derived type is declared within the generic body of
8906 -- the generic unit declaring the formal type.
8908 if Is_Generic_Type
(Ancestor_Type
)
8909 and then Enclosing_Generic_Body
(Ancestor_Type
) /=
8910 Enclosing_Generic_Body
(Derived_Type
)
8913 ("parent type of& must not be descendant of formal type"
8914 & " of an enclosing generic body",
8915 Indic
, Derived_Type
);
8920 elsif Type_Access_Level
(Derived_Type
) /=
8921 Type_Access_Level
(Parent_Type
)
8922 and then not Is_Generic_Type
(Derived_Type
)
8924 if Is_Controlled
(Parent_Type
) then
8926 ("controlled type must be declared at the library level",
8930 ("type extension at deeper accessibility level than parent",
8936 GB
: constant Node_Id
:= Enclosing_Generic_Body
(Derived_Type
);
8939 and then GB
/= Enclosing_Generic_Body
(Parent_Base
)
8942 ("parent type of& must not be outside generic body"
8944 Indic
, Derived_Type
);
8950 -- Ada 2005 (AI-251)
8952 if Ada_Version
>= Ada_2005
and then Is_Tagged
then
8954 -- "The declaration of a specific descendant of an interface type
8955 -- freezes the interface type" (RM 13.14).
8960 if Is_Non_Empty_List
(Interface_List
(Type_Def
)) then
8961 Iface
:= First
(Interface_List
(Type_Def
));
8962 while Present
(Iface
) loop
8963 Freeze_Before
(N
, Etype
(Iface
));
8970 -- STEP 1b : preliminary cleanup of the full view of private types
8972 -- If the type is already marked as having discriminants, then it's the
8973 -- completion of a private type or private extension and we need to
8974 -- retain the discriminants from the partial view if the current
8975 -- declaration has Discriminant_Specifications so that we can verify
8976 -- conformance. However, we must remove any existing components that
8977 -- were inherited from the parent (and attached in Copy_And_Swap)
8978 -- because the full type inherits all appropriate components anyway, and
8979 -- we do not want the partial view's components interfering.
8981 if Has_Discriminants
(Derived_Type
) and then Discriminant_Specs
then
8982 Discrim
:= First_Discriminant
(Derived_Type
);
8984 Last_Discrim
:= Discrim
;
8985 Next_Discriminant
(Discrim
);
8986 exit when No
(Discrim
);
8989 Set_Last_Entity
(Derived_Type
, Last_Discrim
);
8991 -- In all other cases wipe out the list of inherited components (even
8992 -- inherited discriminants), it will be properly rebuilt here.
8995 Set_First_Entity
(Derived_Type
, Empty
);
8996 Set_Last_Entity
(Derived_Type
, Empty
);
8999 -- STEP 1c: Initialize some flags for the Derived_Type
9001 -- The following flags must be initialized here so that
9002 -- Process_Discriminants can check that discriminants of tagged types do
9003 -- not have a default initial value and that access discriminants are
9004 -- only specified for limited records. For completeness, these flags are
9005 -- also initialized along with all the other flags below.
9007 -- AI-419: Limitedness is not inherited from an interface parent, so to
9008 -- be limited in that case the type must be explicitly declared as
9009 -- limited. However, task and protected interfaces are always limited.
9011 if Limited_Present
(Type_Def
) then
9012 Set_Is_Limited_Record
(Derived_Type
);
9014 elsif Is_Limited_Record
(Parent_Type
)
9015 or else (Present
(Full_View
(Parent_Type
))
9016 and then Is_Limited_Record
(Full_View
(Parent_Type
)))
9018 if not Is_Interface
(Parent_Type
)
9019 or else Is_Synchronized_Interface
(Parent_Type
)
9020 or else Is_Protected_Interface
(Parent_Type
)
9021 or else Is_Task_Interface
(Parent_Type
)
9023 Set_Is_Limited_Record
(Derived_Type
);
9027 -- STEP 2a: process discriminants of derived type if any
9029 Push_Scope
(Derived_Type
);
9031 if Discriminant_Specs
then
9032 Set_Has_Unknown_Discriminants
(Derived_Type
, False);
9034 -- The following call initializes fields Has_Discriminants and
9035 -- Discriminant_Constraint, unless we are processing the completion
9036 -- of a private type declaration.
9038 Check_Or_Process_Discriminants
(N
, Derived_Type
);
9040 -- For untagged types, the constraint on the Parent_Type must be
9041 -- present and is used to rename the discriminants.
9043 if not Is_Tagged
and then not Has_Discriminants
(Parent_Type
) then
9044 Error_Msg_N
("untagged parent must have discriminants", Indic
);
9046 elsif not Is_Tagged
and then not Constraint_Present
then
9048 ("discriminant constraint needed for derived untagged records",
9051 -- Otherwise the parent subtype must be constrained unless we have a
9052 -- private extension.
9054 elsif not Constraint_Present
9055 and then not Private_Extension
9056 and then not Is_Constrained
(Parent_Type
)
9059 ("unconstrained type not allowed in this context", Indic
);
9061 elsif Constraint_Present
then
9062 -- The following call sets the field Corresponding_Discriminant
9063 -- for the discriminants in the Derived_Type.
9065 Discs
:= Build_Discriminant_Constraints
(Parent_Type
, Indic
, True);
9067 -- For untagged types all new discriminants must rename
9068 -- discriminants in the parent. For private extensions new
9069 -- discriminants cannot rename old ones (implied by [7.3(13)]).
9071 Discrim
:= First_Discriminant
(Derived_Type
);
9072 while Present
(Discrim
) loop
9074 and then No
(Corresponding_Discriminant
(Discrim
))
9077 ("new discriminants must constrain old ones", Discrim
);
9079 elsif Private_Extension
9080 and then Present
(Corresponding_Discriminant
(Discrim
))
9083 ("only static constraints allowed for parent"
9084 & " discriminants in the partial view", Indic
);
9088 -- If a new discriminant is used in the constraint, then its
9089 -- subtype must be statically compatible with the parent
9090 -- discriminant's subtype (3.7(15)).
9092 -- However, if the record contains an array constrained by
9093 -- the discriminant but with some different bound, the compiler
9094 -- tries to create a smaller range for the discriminant type.
9095 -- (See exp_ch3.Adjust_Discriminants). In this case, where
9096 -- the discriminant type is a scalar type, the check must use
9097 -- the original discriminant type in the parent declaration.
9100 Corr_Disc
: constant Entity_Id
:=
9101 Corresponding_Discriminant
(Discrim
);
9102 Disc_Type
: constant Entity_Id
:= Etype
(Discrim
);
9103 Corr_Type
: Entity_Id
;
9106 if Present
(Corr_Disc
) then
9107 if Is_Scalar_Type
(Disc_Type
) then
9109 Entity
(Discriminant_Type
(Parent
(Corr_Disc
)));
9111 Corr_Type
:= Etype
(Corr_Disc
);
9115 Subtypes_Statically_Compatible
(Disc_Type
, Corr_Type
)
9118 ("subtype must be compatible "
9119 & "with parent discriminant",
9125 Next_Discriminant
(Discrim
);
9128 -- Check whether the constraints of the full view statically
9129 -- match those imposed by the parent subtype [7.3(13)].
9131 if Present
(Stored_Constraint
(Derived_Type
)) then
9136 C1
:= First_Elmt
(Discs
);
9137 C2
:= First_Elmt
(Stored_Constraint
(Derived_Type
));
9138 while Present
(C1
) and then Present
(C2
) loop
9140 Fully_Conformant_Expressions
(Node
(C1
), Node
(C2
))
9143 ("not conformant with previous declaration",
9154 -- STEP 2b: No new discriminants, inherit discriminants if any
9157 if Private_Extension
then
9158 Set_Has_Unknown_Discriminants
9160 Has_Unknown_Discriminants
(Parent_Type
)
9161 or else Unknown_Discriminants_Present
(N
));
9163 -- The partial view of the parent may have unknown discriminants,
9164 -- but if the full view has discriminants and the parent type is
9165 -- in scope they must be inherited.
9167 elsif Has_Unknown_Discriminants
(Parent_Type
)
9169 (not Has_Discriminants
(Parent_Type
)
9170 or else not In_Open_Scopes
(Scope
(Parent_Base
)))
9172 Set_Has_Unknown_Discriminants
(Derived_Type
);
9175 if not Has_Unknown_Discriminants
(Derived_Type
)
9176 and then not Has_Unknown_Discriminants
(Parent_Base
)
9177 and then Has_Discriminants
(Parent_Type
)
9179 Inherit_Discrims
:= True;
9180 Set_Has_Discriminants
9181 (Derived_Type
, True);
9182 Set_Discriminant_Constraint
9183 (Derived_Type
, Discriminant_Constraint
(Parent_Base
));
9186 -- The following test is true for private types (remember
9187 -- transformation 5. is not applied to those) and in an error
9190 if Constraint_Present
then
9191 Discs
:= Build_Discriminant_Constraints
(Parent_Type
, Indic
);
9194 -- For now mark a new derived type as constrained only if it has no
9195 -- discriminants. At the end of Build_Derived_Record_Type we properly
9196 -- set this flag in the case of private extensions. See comments in
9197 -- point 9. just before body of Build_Derived_Record_Type.
9201 not (Inherit_Discrims
9202 or else Has_Unknown_Discriminants
(Derived_Type
)));
9205 -- STEP 3: initialize fields of derived type
9207 Set_Is_Tagged_Type
(Derived_Type
, Is_Tagged
);
9208 Set_Stored_Constraint
(Derived_Type
, No_Elist
);
9210 -- Ada 2005 (AI-251): Private type-declarations can implement interfaces
9211 -- but cannot be interfaces
9213 if not Private_Extension
9214 and then Ekind
(Derived_Type
) /= E_Private_Type
9215 and then Ekind
(Derived_Type
) /= E_Limited_Private_Type
9217 if Interface_Present
(Type_Def
) then
9218 Analyze_Interface_Declaration
(Derived_Type
, Type_Def
);
9221 Set_Interfaces
(Derived_Type
, No_Elist
);
9224 -- Fields inherited from the Parent_Type
9226 Set_Has_Specified_Layout
9227 (Derived_Type
, Has_Specified_Layout
(Parent_Type
));
9228 Set_Is_Limited_Composite
9229 (Derived_Type
, Is_Limited_Composite
(Parent_Type
));
9230 Set_Is_Private_Composite
9231 (Derived_Type
, Is_Private_Composite
(Parent_Type
));
9233 if Is_Tagged_Type
(Parent_Type
) then
9234 Set_No_Tagged_Streams_Pragma
9235 (Derived_Type
, No_Tagged_Streams_Pragma
(Parent_Type
));
9238 -- Fields inherited from the Parent_Base
9240 Set_Has_Controlled_Component
9241 (Derived_Type
, Has_Controlled_Component
(Parent_Base
));
9242 Set_Has_Non_Standard_Rep
9243 (Derived_Type
, Has_Non_Standard_Rep
(Parent_Base
));
9244 Set_Has_Primitive_Operations
9245 (Derived_Type
, Has_Primitive_Operations
(Parent_Base
));
9247 -- Set fields for private derived types
9249 if Is_Private_Type
(Derived_Type
) then
9250 Set_Depends_On_Private
(Derived_Type
, True);
9251 Set_Private_Dependents
(Derived_Type
, New_Elmt_List
);
9254 -- Inherit fields for non-private types. If this is the completion of a
9255 -- derivation from a private type, the parent itself is private and the
9256 -- attributes come from its full view, which must be present.
9258 if Is_Record_Type
(Derived_Type
) then
9260 Parent_Full
: Entity_Id
;
9263 if Is_Private_Type
(Parent_Base
)
9264 and then not Is_Record_Type
(Parent_Base
)
9266 Parent_Full
:= Full_View
(Parent_Base
);
9268 Parent_Full
:= Parent_Base
;
9271 Set_Component_Alignment
9272 (Derived_Type
, Component_Alignment
(Parent_Full
));
9274 (Derived_Type
, C_Pass_By_Copy
(Parent_Full
));
9275 Set_Has_Complex_Representation
9276 (Derived_Type
, Has_Complex_Representation
(Parent_Full
));
9278 -- For untagged types, inherit the layout by default to avoid
9279 -- costly changes of representation for type conversions.
9281 if not Is_Tagged
then
9282 Set_Is_Packed
(Derived_Type
, Is_Packed
(Parent_Full
));
9283 Set_No_Reordering
(Derived_Type
, No_Reordering
(Parent_Full
));
9288 -- Set fields for tagged types
9291 Set_Direct_Primitive_Operations
(Derived_Type
, New_Elmt_List
);
9293 -- All tagged types defined in Ada.Finalization are controlled
9295 if Chars
(Scope
(Derived_Type
)) = Name_Finalization
9296 and then Chars
(Scope
(Scope
(Derived_Type
))) = Name_Ada
9297 and then Scope
(Scope
(Scope
(Derived_Type
))) = Standard_Standard
9299 Set_Is_Controlled_Active
(Derived_Type
);
9301 Set_Is_Controlled_Active
9302 (Derived_Type
, Is_Controlled_Active
(Parent_Base
));
9305 -- Minor optimization: there is no need to generate the class-wide
9306 -- entity associated with an underlying record view.
9308 if not Is_Underlying_Record_View
(Derived_Type
) then
9309 Make_Class_Wide_Type
(Derived_Type
);
9312 Set_Is_Abstract_Type
(Derived_Type
, Abstract_Present
(Type_Def
));
9314 if Has_Discriminants
(Derived_Type
)
9315 and then Constraint_Present
9317 Set_Stored_Constraint
9318 (Derived_Type
, Expand_To_Stored_Constraint
(Parent_Base
, Discs
));
9321 if Ada_Version
>= Ada_2005
then
9323 Ifaces_List
: Elist_Id
;
9326 -- Checks rules 3.9.4 (13/2 and 14/2)
9328 if Comes_From_Source
(Derived_Type
)
9329 and then not Is_Private_Type
(Derived_Type
)
9330 and then Is_Interface
(Parent_Type
)
9331 and then not Is_Interface
(Derived_Type
)
9333 if Is_Task_Interface
(Parent_Type
) then
9335 ("(Ada 2005) task type required (RM 3.9.4 (13.2))",
9338 elsif Is_Protected_Interface
(Parent_Type
) then
9340 ("(Ada 2005) protected type required (RM 3.9.4 (14.2))",
9345 -- Check ARM rules 3.9.4 (15/2), 9.1 (9.d/2) and 9.4 (11.d/2)
9347 Check_Interfaces
(N
, Type_Def
);
9349 -- Ada 2005 (AI-251): Collect the list of progenitors that are
9350 -- not already in the parents.
9354 Ifaces_List
=> Ifaces_List
,
9355 Exclude_Parents
=> True);
9357 Set_Interfaces
(Derived_Type
, Ifaces_List
);
9359 -- If the derived type is the anonymous type created for
9360 -- a declaration whose parent has a constraint, propagate
9361 -- the interface list to the source type. This must be done
9362 -- prior to the completion of the analysis of the source type
9363 -- because the components in the extension may contain current
9364 -- instances whose legality depends on some ancestor.
9366 if Is_Itype
(Derived_Type
) then
9368 Def
: constant Node_Id
:=
9369 Associated_Node_For_Itype
(Derived_Type
);
9372 and then Nkind
(Def
) = N_Full_Type_Declaration
9375 (Defining_Identifier
(Def
), Ifaces_List
);
9380 -- A type extension is automatically Ghost when one of its
9381 -- progenitors is Ghost (SPARK RM 6.9(9)). This property is
9382 -- also inherited when the parent type is Ghost, but this is
9383 -- done in Build_Derived_Type as the mechanism also handles
9384 -- untagged derivations.
9386 if Implements_Ghost_Interface
(Derived_Type
) then
9387 Set_Is_Ghost_Entity
(Derived_Type
);
9393 -- STEP 4: Inherit components from the parent base and constrain them.
9394 -- Apply the second transformation described in point 6. above.
9396 if (not Is_Empty_Elmt_List
(Discs
) or else Inherit_Discrims
)
9397 or else not Has_Discriminants
(Parent_Type
)
9398 or else not Is_Constrained
(Parent_Type
)
9402 Constrs
:= Discriminant_Constraint
(Parent_Type
);
9407 (N
, Parent_Base
, Derived_Type
, Is_Tagged
, Inherit_Discrims
, Constrs
);
9409 -- STEP 5a: Copy the parent record declaration for untagged types
9411 Set_Has_Implicit_Dereference
9412 (Derived_Type
, Has_Implicit_Dereference
(Parent_Type
));
9414 if not Is_Tagged
then
9416 -- Discriminant_Constraint (Derived_Type) has been properly
9417 -- constructed. Save it and temporarily set it to Empty because we
9418 -- do not want the call to New_Copy_Tree below to mess this list.
9420 if Has_Discriminants
(Derived_Type
) then
9421 Save_Discr_Constr
:= Discriminant_Constraint
(Derived_Type
);
9422 Set_Discriminant_Constraint
(Derived_Type
, No_Elist
);
9424 Save_Discr_Constr
:= No_Elist
;
9427 -- Save the Etype field of Derived_Type. It is correctly set now,
9428 -- but the call to New_Copy tree may remap it to point to itself,
9429 -- which is not what we want. Ditto for the Next_Entity field.
9431 Save_Etype
:= Etype
(Derived_Type
);
9432 Save_Next_Entity
:= Next_Entity
(Derived_Type
);
9434 -- Assoc_List maps all stored discriminants in the Parent_Base to
9435 -- stored discriminants in the Derived_Type. It is fundamental that
9436 -- no types or itypes with discriminants other than the stored
9437 -- discriminants appear in the entities declared inside
9438 -- Derived_Type, since the back end cannot deal with it.
9442 (Parent
(Parent_Base
), Map
=> Assoc_List
, New_Sloc
=> Loc
);
9443 Copy_Dimensions_Of_Components
(Derived_Type
);
9445 -- Restore the fields saved prior to the New_Copy_Tree call
9446 -- and compute the stored constraint.
9448 Set_Etype
(Derived_Type
, Save_Etype
);
9449 Link_Entities
(Derived_Type
, Save_Next_Entity
);
9451 if Has_Discriminants
(Derived_Type
) then
9452 Set_Discriminant_Constraint
9453 (Derived_Type
, Save_Discr_Constr
);
9454 Set_Stored_Constraint
9455 (Derived_Type
, Expand_To_Stored_Constraint
(Parent_Type
, Discs
));
9457 Replace_Components
(Derived_Type
, New_Decl
);
9460 -- Insert the new derived type declaration
9462 Rewrite
(N
, New_Decl
);
9464 -- STEP 5b: Complete the processing for record extensions in generics
9466 -- There is no completion for record extensions declared in the
9467 -- parameter part of a generic, so we need to complete processing for
9468 -- these generic record extensions here. The Record_Type_Definition call
9469 -- will change the Ekind of the components from E_Void to E_Component.
9471 elsif Private_Extension
and then Is_Generic_Type
(Derived_Type
) then
9472 Record_Type_Definition
(Empty
, Derived_Type
);
9474 -- STEP 5c: Process the record extension for non private tagged types
9476 elsif not Private_Extension
then
9477 Expand_Record_Extension
(Derived_Type
, Type_Def
);
9479 -- Note : previously in ASIS mode we set the Parent_Subtype of the
9480 -- derived type to propagate some semantic information. This led
9481 -- to other ASIS failures and has been removed.
9483 -- Ada 2005 (AI-251): Addition of the Tag corresponding to all the
9484 -- implemented interfaces if we are in expansion mode
9487 and then Has_Interfaces
(Derived_Type
)
9489 Add_Interface_Tag_Components
(N
, Derived_Type
);
9492 -- Analyze the record extension
9494 Record_Type_Definition
9495 (Record_Extension_Part
(Type_Def
), Derived_Type
);
9500 -- Nothing else to do if there is an error in the derivation.
9501 -- An unusual case: the full view may be derived from a type in an
9502 -- instance, when the partial view was used illegally as an actual
9503 -- in that instance, leading to a circular definition.
9505 if Etype
(Derived_Type
) = Any_Type
9506 or else Etype
(Parent_Type
) = Derived_Type
9511 -- Set delayed freeze and then derive subprograms, we need to do
9512 -- this in this order so that derived subprograms inherit the
9513 -- derived freeze if necessary.
9515 Set_Has_Delayed_Freeze
(Derived_Type
);
9517 if Derive_Subps
then
9518 Derive_Subprograms
(Parent_Type
, Derived_Type
);
9521 -- If we have a private extension which defines a constrained derived
9522 -- type mark as constrained here after we have derived subprograms. See
9523 -- comment on point 9. just above the body of Build_Derived_Record_Type.
9525 if Private_Extension
and then Inherit_Discrims
then
9526 if Constraint_Present
and then not Is_Empty_Elmt_List
(Discs
) then
9527 Set_Is_Constrained
(Derived_Type
, True);
9528 Set_Discriminant_Constraint
(Derived_Type
, Discs
);
9530 elsif Is_Constrained
(Parent_Type
) then
9532 (Derived_Type
, True);
9533 Set_Discriminant_Constraint
9534 (Derived_Type
, Discriminant_Constraint
(Parent_Type
));
9538 -- Update the class-wide type, which shares the now-completed entity
9539 -- list with its specific type. In case of underlying record views,
9540 -- we do not generate the corresponding class wide entity.
9543 and then not Is_Underlying_Record_View
(Derived_Type
)
9546 (Class_Wide_Type
(Derived_Type
), First_Entity
(Derived_Type
));
9548 (Class_Wide_Type
(Derived_Type
), Last_Entity
(Derived_Type
));
9551 Check_Function_Writable_Actuals
(N
);
9552 end Build_Derived_Record_Type
;
9554 ------------------------
9555 -- Build_Derived_Type --
9556 ------------------------
9558 procedure Build_Derived_Type
9560 Parent_Type
: Entity_Id
;
9561 Derived_Type
: Entity_Id
;
9562 Is_Completion
: Boolean;
9563 Derive_Subps
: Boolean := True)
9565 Parent_Base
: constant Entity_Id
:= Base_Type
(Parent_Type
);
9568 -- Set common attributes
9570 Set_Scope
(Derived_Type
, Current_Scope
);
9571 Set_Etype
(Derived_Type
, Parent_Base
);
9572 Set_Ekind
(Derived_Type
, Ekind
(Parent_Base
));
9573 Propagate_Concurrent_Flags
(Derived_Type
, Parent_Base
);
9575 Set_Size_Info
(Derived_Type
, Parent_Type
);
9576 Set_RM_Size
(Derived_Type
, RM_Size
(Parent_Type
));
9578 Set_Is_Controlled_Active
9579 (Derived_Type
, Is_Controlled_Active
(Parent_Type
));
9581 Set_Disable_Controlled
(Derived_Type
, Disable_Controlled
(Parent_Type
));
9582 Set_Is_Tagged_Type
(Derived_Type
, Is_Tagged_Type
(Parent_Type
));
9583 Set_Is_Volatile
(Derived_Type
, Is_Volatile
(Parent_Type
));
9585 if Is_Tagged_Type
(Derived_Type
) then
9586 Set_No_Tagged_Streams_Pragma
9587 (Derived_Type
, No_Tagged_Streams_Pragma
(Parent_Type
));
9590 -- If the parent has primitive routines, set the derived type link
9592 if Has_Primitive_Operations
(Parent_Type
) then
9593 Set_Derived_Type_Link
(Parent_Base
, Derived_Type
);
9596 -- If the parent type is a private subtype, the convention on the base
9597 -- type may be set in the private part, and not propagated to the
9598 -- subtype until later, so we obtain the convention from the base type.
9600 Set_Convention
(Derived_Type
, Convention
(Parent_Base
));
9602 -- Set SSO default for record or array type
9604 if (Is_Array_Type
(Derived_Type
) or else Is_Record_Type
(Derived_Type
))
9605 and then Is_Base_Type
(Derived_Type
)
9607 Set_Default_SSO
(Derived_Type
);
9610 -- A derived type inherits the Default_Initial_Condition pragma coming
9611 -- from any parent type within the derivation chain.
9613 if Has_DIC
(Parent_Type
) then
9614 Set_Has_Inherited_DIC
(Derived_Type
);
9617 -- A derived type inherits any class-wide invariants coming from a
9618 -- parent type or an interface. Note that the invariant procedure of
9619 -- the parent type should not be inherited because the derived type may
9620 -- define invariants of its own.
9622 if not Is_Interface
(Derived_Type
) then
9623 if Has_Inherited_Invariants
(Parent_Type
)
9624 or else Has_Inheritable_Invariants
(Parent_Type
)
9626 Set_Has_Inherited_Invariants
(Derived_Type
);
9628 elsif Is_Concurrent_Type
(Derived_Type
)
9629 or else Is_Tagged_Type
(Derived_Type
)
9634 Iface_Elmt
: Elmt_Id
;
9639 Ifaces_List
=> Ifaces
,
9640 Exclude_Parents
=> True);
9642 if Present
(Ifaces
) then
9643 Iface_Elmt
:= First_Elmt
(Ifaces
);
9644 while Present
(Iface_Elmt
) loop
9645 Iface
:= Node
(Iface_Elmt
);
9647 if Has_Inheritable_Invariants
(Iface
) then
9648 Set_Has_Inherited_Invariants
(Derived_Type
);
9652 Next_Elmt
(Iface_Elmt
);
9659 -- We similarly inherit predicates. Note that for scalar derived types
9660 -- the predicate is inherited from the first subtype, and not from its
9661 -- (anonymous) base type.
9663 if Has_Predicates
(Parent_Type
)
9664 or else Has_Predicates
(First_Subtype
(Parent_Type
))
9666 Set_Has_Predicates
(Derived_Type
);
9669 -- The derived type inherits representation clauses from the parent
9670 -- type, and from any interfaces.
9672 Inherit_Rep_Item_Chain
(Derived_Type
, Parent_Type
);
9675 Iface
: Node_Id
:= First
(Abstract_Interface_List
(Derived_Type
));
9677 while Present
(Iface
) loop
9678 Inherit_Rep_Item_Chain
(Derived_Type
, Entity
(Iface
));
9683 -- If the parent type has delayed rep aspects, then mark the derived
9684 -- type as possibly inheriting a delayed rep aspect.
9686 if Has_Delayed_Rep_Aspects
(Parent_Type
) then
9687 Set_May_Inherit_Delayed_Rep_Aspects
(Derived_Type
);
9690 -- A derived type becomes Ghost when its parent type is also Ghost
9691 -- (SPARK RM 6.9(9)). Note that the Ghost-related attributes are not
9692 -- directly inherited because the Ghost policy in effect may differ.
9694 if Is_Ghost_Entity
(Parent_Type
) then
9695 Set_Is_Ghost_Entity
(Derived_Type
);
9698 -- Type dependent processing
9700 case Ekind
(Parent_Type
) is
9701 when Numeric_Kind
=>
9702 Build_Derived_Numeric_Type
(N
, Parent_Type
, Derived_Type
);
9705 Build_Derived_Array_Type
(N
, Parent_Type
, Derived_Type
);
9707 when Class_Wide_Kind
9711 Build_Derived_Record_Type
9712 (N
, Parent_Type
, Derived_Type
, Derive_Subps
);
9715 when Enumeration_Kind
=>
9716 Build_Derived_Enumeration_Type
(N
, Parent_Type
, Derived_Type
);
9719 Build_Derived_Access_Type
(N
, Parent_Type
, Derived_Type
);
9721 when Incomplete_Or_Private_Kind
=>
9722 Build_Derived_Private_Type
9723 (N
, Parent_Type
, Derived_Type
, Is_Completion
, Derive_Subps
);
9725 -- For discriminated types, the derivation includes deriving
9726 -- primitive operations. For others it is done below.
9728 if Is_Tagged_Type
(Parent_Type
)
9729 or else Has_Discriminants
(Parent_Type
)
9730 or else (Present
(Full_View
(Parent_Type
))
9731 and then Has_Discriminants
(Full_View
(Parent_Type
)))
9736 when Concurrent_Kind
=>
9737 Build_Derived_Concurrent_Type
(N
, Parent_Type
, Derived_Type
);
9740 raise Program_Error
;
9743 -- Nothing more to do if some error occurred
9745 if Etype
(Derived_Type
) = Any_Type
then
9749 -- Set delayed freeze and then derive subprograms, we need to do this
9750 -- in this order so that derived subprograms inherit the derived freeze
9753 Set_Has_Delayed_Freeze
(Derived_Type
);
9755 if Derive_Subps
then
9756 Derive_Subprograms
(Parent_Type
, Derived_Type
);
9759 Set_Has_Primitive_Operations
9760 (Base_Type
(Derived_Type
), Has_Primitive_Operations
(Parent_Type
));
9761 end Build_Derived_Type
;
9763 -----------------------
9764 -- Build_Discriminal --
9765 -----------------------
9767 procedure Build_Discriminal
(Discrim
: Entity_Id
) is
9768 D_Minal
: Entity_Id
;
9769 CR_Disc
: Entity_Id
;
9772 -- A discriminal has the same name as the discriminant
9774 D_Minal
:= Make_Defining_Identifier
(Sloc
(Discrim
), Chars
(Discrim
));
9776 Set_Ekind
(D_Minal
, E_In_Parameter
);
9777 Set_Mechanism
(D_Minal
, Default_Mechanism
);
9778 Set_Etype
(D_Minal
, Etype
(Discrim
));
9779 Set_Scope
(D_Minal
, Current_Scope
);
9780 Set_Parent
(D_Minal
, Parent
(Discrim
));
9782 Set_Discriminal
(Discrim
, D_Minal
);
9783 Set_Discriminal_Link
(D_Minal
, Discrim
);
9785 -- For task types, build at once the discriminants of the corresponding
9786 -- record, which are needed if discriminants are used in entry defaults
9787 -- and in family bounds.
9789 if Is_Concurrent_Type
(Current_Scope
)
9791 Is_Limited_Type
(Current_Scope
)
9793 CR_Disc
:= Make_Defining_Identifier
(Sloc
(Discrim
), Chars
(Discrim
));
9795 Set_Ekind
(CR_Disc
, E_In_Parameter
);
9796 Set_Mechanism
(CR_Disc
, Default_Mechanism
);
9797 Set_Etype
(CR_Disc
, Etype
(Discrim
));
9798 Set_Scope
(CR_Disc
, Current_Scope
);
9799 Set_Discriminal_Link
(CR_Disc
, Discrim
);
9800 Set_CR_Discriminant
(Discrim
, CR_Disc
);
9802 end Build_Discriminal
;
9804 ------------------------------------
9805 -- Build_Discriminant_Constraints --
9806 ------------------------------------
9808 function Build_Discriminant_Constraints
9811 Derived_Def
: Boolean := False) return Elist_Id
9813 C
: constant Node_Id
:= Constraint
(Def
);
9814 Nb_Discr
: constant Nat
:= Number_Discriminants
(T
);
9816 Discr_Expr
: array (1 .. Nb_Discr
) of Node_Id
:= (others => Empty
);
9817 -- Saves the expression corresponding to a given discriminant in T
9819 function Pos_Of_Discr
(T
: Entity_Id
; D
: Entity_Id
) return Nat
;
9820 -- Return the Position number within array Discr_Expr of a discriminant
9821 -- D within the discriminant list of the discriminated type T.
9823 procedure Process_Discriminant_Expression
9826 -- If this is a discriminant constraint on a partial view, do not
9827 -- generate an overflow check on the discriminant expression. The check
9828 -- will be generated when constraining the full view. Otherwise the
9829 -- backend creates duplicate symbols for the temporaries corresponding
9830 -- to the expressions to be checked, causing spurious assembler errors.
9836 function Pos_Of_Discr
(T
: Entity_Id
; D
: Entity_Id
) return Nat
is
9840 Disc
:= First_Discriminant
(T
);
9841 for J
in Discr_Expr
'Range loop
9846 Next_Discriminant
(Disc
);
9849 -- Note: Since this function is called on discriminants that are
9850 -- known to belong to the discriminated type, falling through the
9851 -- loop with no match signals an internal compiler error.
9853 raise Program_Error
;
9856 -------------------------------------
9857 -- Process_Discriminant_Expression --
9858 -------------------------------------
9860 procedure Process_Discriminant_Expression
9864 BDT
: constant Entity_Id
:= Base_Type
(Etype
(D
));
9867 -- If this is a discriminant constraint on a partial view, do
9868 -- not generate an overflow on the discriminant expression. The
9869 -- check will be generated when constraining the full view.
9871 if Is_Private_Type
(T
)
9872 and then Present
(Full_View
(T
))
9874 Analyze_And_Resolve
(Expr
, BDT
, Suppress
=> Overflow_Check
);
9876 Analyze_And_Resolve
(Expr
, BDT
);
9878 end Process_Discriminant_Expression
;
9880 -- Declarations local to Build_Discriminant_Constraints
9884 Elist
: constant Elist_Id
:= New_Elmt_List
;
9892 Discrim_Present
: Boolean := False;
9894 -- Start of processing for Build_Discriminant_Constraints
9897 -- The following loop will process positional associations only.
9898 -- For a positional association, the (single) discriminant is
9899 -- implicitly specified by position, in textual order (RM 3.7.2).
9901 Discr
:= First_Discriminant
(T
);
9902 Constr
:= First
(Constraints
(C
));
9903 for D
in Discr_Expr
'Range loop
9904 exit when Nkind
(Constr
) = N_Discriminant_Association
;
9907 Error_Msg_N
("too few discriminants given in constraint", C
);
9908 return New_Elmt_List
;
9910 elsif Nkind
(Constr
) = N_Range
9911 or else (Nkind
(Constr
) = N_Attribute_Reference
9912 and then Attribute_Name
(Constr
) = Name_Range
)
9915 ("a range is not a valid discriminant constraint", Constr
);
9916 Discr_Expr
(D
) := Error
;
9918 elsif Nkind
(Constr
) = N_Subtype_Indication
then
9920 ("a subtype indication is not a valid discriminant constraint",
9922 Discr_Expr
(D
) := Error
;
9925 Process_Discriminant_Expression
(Constr
, Discr
);
9926 Discr_Expr
(D
) := Constr
;
9929 Next_Discriminant
(Discr
);
9933 if No
(Discr
) and then Present
(Constr
) then
9934 Error_Msg_N
("too many discriminants given in constraint", Constr
);
9935 return New_Elmt_List
;
9938 -- Named associations can be given in any order, but if both positional
9939 -- and named associations are used in the same discriminant constraint,
9940 -- then positional associations must occur first, at their normal
9941 -- position. Hence once a named association is used, the rest of the
9942 -- discriminant constraint must use only named associations.
9944 while Present
(Constr
) loop
9946 -- Positional association forbidden after a named association
9948 if Nkind
(Constr
) /= N_Discriminant_Association
then
9949 Error_Msg_N
("positional association follows named one", Constr
);
9950 return New_Elmt_List
;
9952 -- Otherwise it is a named association
9955 -- E records the type of the discriminants in the named
9956 -- association. All the discriminants specified in the same name
9957 -- association must have the same type.
9961 -- Search the list of discriminants in T to see if the simple name
9962 -- given in the constraint matches any of them.
9964 Id
:= First
(Selector_Names
(Constr
));
9965 while Present
(Id
) loop
9968 -- If Original_Discriminant is present, we are processing a
9969 -- generic instantiation and this is an instance node. We need
9970 -- to find the name of the corresponding discriminant in the
9971 -- actual record type T and not the name of the discriminant in
9972 -- the generic formal. Example:
9975 -- type G (D : int) is private;
9977 -- subtype W is G (D => 1);
9979 -- type Rec (X : int) is record ... end record;
9980 -- package Q is new P (G => Rec);
9982 -- At the point of the instantiation, formal type G is Rec
9983 -- and therefore when reanalyzing "subtype W is G (D => 1);"
9984 -- which really looks like "subtype W is Rec (D => 1);" at
9985 -- the point of instantiation, we want to find the discriminant
9986 -- that corresponds to D in Rec, i.e. X.
9988 if Present
(Original_Discriminant
(Id
))
9989 and then In_Instance
9991 Discr
:= Find_Corresponding_Discriminant
(Id
, T
);
9995 Discr
:= First_Discriminant
(T
);
9996 while Present
(Discr
) loop
9997 if Chars
(Discr
) = Chars
(Id
) then
10002 Next_Discriminant
(Discr
);
10006 Error_Msg_N
("& does not match any discriminant", Id
);
10007 return New_Elmt_List
;
10009 -- If the parent type is a generic formal, preserve the
10010 -- name of the discriminant for subsequent instances.
10011 -- see comment at the beginning of this if statement.
10013 elsif Is_Generic_Type
(Root_Type
(T
)) then
10014 Set_Original_Discriminant
(Id
, Discr
);
10018 Position
:= Pos_Of_Discr
(T
, Discr
);
10020 if Present
(Discr_Expr
(Position
)) then
10021 Error_Msg_N
("duplicate constraint for discriminant&", Id
);
10024 -- Each discriminant specified in the same named association
10025 -- must be associated with a separate copy of the
10026 -- corresponding expression.
10028 if Present
(Next
(Id
)) then
10029 Expr
:= New_Copy_Tree
(Expression
(Constr
));
10030 Set_Parent
(Expr
, Parent
(Expression
(Constr
)));
10032 Expr
:= Expression
(Constr
);
10035 Discr_Expr
(Position
) := Expr
;
10036 Process_Discriminant_Expression
(Expr
, Discr
);
10039 -- A discriminant association with more than one discriminant
10040 -- name is only allowed if the named discriminants are all of
10041 -- the same type (RM 3.7.1(8)).
10044 E
:= Base_Type
(Etype
(Discr
));
10046 elsif Base_Type
(Etype
(Discr
)) /= E
then
10048 ("all discriminants in an association " &
10049 "must have the same type", Id
);
10059 -- A discriminant constraint must provide exactly one value for each
10060 -- discriminant of the type (RM 3.7.1(8)).
10062 for J
in Discr_Expr
'Range loop
10063 if No
(Discr_Expr
(J
)) then
10064 Error_Msg_N
("too few discriminants given in constraint", C
);
10065 return New_Elmt_List
;
10069 -- Determine if there are discriminant expressions in the constraint
10071 for J
in Discr_Expr
'Range loop
10072 if Denotes_Discriminant
10073 (Discr_Expr
(J
), Check_Concurrent
=> True)
10075 Discrim_Present
:= True;
10079 -- Build an element list consisting of the expressions given in the
10080 -- discriminant constraint and apply the appropriate checks. The list
10081 -- is constructed after resolving any named discriminant associations
10082 -- and therefore the expressions appear in the textual order of the
10085 Discr
:= First_Discriminant
(T
);
10086 for J
in Discr_Expr
'Range loop
10087 if Discr_Expr
(J
) /= Error
then
10088 Append_Elmt
(Discr_Expr
(J
), Elist
);
10090 -- If any of the discriminant constraints is given by a
10091 -- discriminant and we are in a derived type declaration we
10092 -- have a discriminant renaming. Establish link between new
10093 -- and old discriminant. The new discriminant has an implicit
10094 -- dereference if the old one does.
10096 if Denotes_Discriminant
(Discr_Expr
(J
)) then
10097 if Derived_Def
then
10099 New_Discr
: constant Entity_Id
:= Entity
(Discr_Expr
(J
));
10102 Set_Corresponding_Discriminant
(New_Discr
, Discr
);
10103 Set_Has_Implicit_Dereference
(New_Discr
,
10104 Has_Implicit_Dereference
(Discr
));
10108 -- Force the evaluation of non-discriminant expressions.
10109 -- If we have found a discriminant in the constraint 3.4(26)
10110 -- and 3.8(18) demand that no range checks are performed are
10111 -- after evaluation. If the constraint is for a component
10112 -- definition that has a per-object constraint, expressions are
10113 -- evaluated but not checked either. In all other cases perform
10117 if Discrim_Present
then
10120 elsif Nkind
(Parent
(Parent
(Def
))) = N_Component_Declaration
10121 and then Has_Per_Object_Constraint
10122 (Defining_Identifier
(Parent
(Parent
(Def
))))
10126 elsif Is_Access_Type
(Etype
(Discr
)) then
10127 Apply_Constraint_Check
(Discr_Expr
(J
), Etype
(Discr
));
10130 Apply_Range_Check
(Discr_Expr
(J
), Etype
(Discr
));
10133 Force_Evaluation
(Discr_Expr
(J
));
10136 -- Check that the designated type of an access discriminant's
10137 -- expression is not a class-wide type unless the discriminant's
10138 -- designated type is also class-wide.
10140 if Ekind
(Etype
(Discr
)) = E_Anonymous_Access_Type
10141 and then not Is_Class_Wide_Type
10142 (Designated_Type
(Etype
(Discr
)))
10143 and then Etype
(Discr_Expr
(J
)) /= Any_Type
10144 and then Is_Class_Wide_Type
10145 (Designated_Type
(Etype
(Discr_Expr
(J
))))
10147 Wrong_Type
(Discr_Expr
(J
), Etype
(Discr
));
10149 elsif Is_Access_Type
(Etype
(Discr
))
10150 and then not Is_Access_Constant
(Etype
(Discr
))
10151 and then Is_Access_Type
(Etype
(Discr_Expr
(J
)))
10152 and then Is_Access_Constant
(Etype
(Discr_Expr
(J
)))
10155 ("constraint for discriminant& must be access to variable",
10160 Next_Discriminant
(Discr
);
10164 end Build_Discriminant_Constraints
;
10166 ---------------------------------
10167 -- Build_Discriminated_Subtype --
10168 ---------------------------------
10170 procedure Build_Discriminated_Subtype
10172 Def_Id
: Entity_Id
;
10174 Related_Nod
: Node_Id
;
10175 For_Access
: Boolean := False)
10177 Has_Discrs
: constant Boolean := Has_Discriminants
(T
);
10178 Constrained
: constant Boolean :=
10180 and then not Is_Empty_Elmt_List
(Elist
)
10181 and then not Is_Class_Wide_Type
(T
))
10182 or else Is_Constrained
(T
);
10185 if Ekind
(T
) = E_Record_Type
then
10187 Set_Ekind
(Def_Id
, E_Private_Subtype
);
10188 Set_Is_For_Access_Subtype
(Def_Id
, True);
10190 Set_Ekind
(Def_Id
, E_Record_Subtype
);
10193 -- Inherit preelaboration flag from base, for types for which it
10194 -- may have been set: records, private types, protected types.
10196 Set_Known_To_Have_Preelab_Init
10197 (Def_Id
, Known_To_Have_Preelab_Init
(T
));
10199 elsif Ekind
(T
) = E_Task_Type
then
10200 Set_Ekind
(Def_Id
, E_Task_Subtype
);
10202 elsif Ekind
(T
) = E_Protected_Type
then
10203 Set_Ekind
(Def_Id
, E_Protected_Subtype
);
10204 Set_Known_To_Have_Preelab_Init
10205 (Def_Id
, Known_To_Have_Preelab_Init
(T
));
10207 elsif Is_Private_Type
(T
) then
10208 Set_Ekind
(Def_Id
, Subtype_Kind
(Ekind
(T
)));
10209 Set_Known_To_Have_Preelab_Init
10210 (Def_Id
, Known_To_Have_Preelab_Init
(T
));
10212 -- Private subtypes may have private dependents
10214 Set_Private_Dependents
(Def_Id
, New_Elmt_List
);
10216 elsif Is_Class_Wide_Type
(T
) then
10217 Set_Ekind
(Def_Id
, E_Class_Wide_Subtype
);
10220 -- Incomplete type. Attach subtype to list of dependents, to be
10221 -- completed with full view of parent type, unless is it the
10222 -- designated subtype of a record component within an init_proc.
10223 -- This last case arises for a component of an access type whose
10224 -- designated type is incomplete (e.g. a Taft Amendment type).
10225 -- The designated subtype is within an inner scope, and needs no
10226 -- elaboration, because only the access type is needed in the
10227 -- initialization procedure.
10229 if Ekind
(T
) = E_Incomplete_Type
then
10230 Set_Ekind
(Def_Id
, E_Incomplete_Subtype
);
10232 Set_Ekind
(Def_Id
, Ekind
(T
));
10235 if For_Access
and then Within_Init_Proc
then
10238 Append_Elmt
(Def_Id
, Private_Dependents
(T
));
10242 Set_Etype
(Def_Id
, T
);
10243 Init_Size_Align
(Def_Id
);
10244 Set_Has_Discriminants
(Def_Id
, Has_Discrs
);
10245 Set_Is_Constrained
(Def_Id
, Constrained
);
10247 Set_First_Entity
(Def_Id
, First_Entity
(T
));
10248 Set_Last_Entity
(Def_Id
, Last_Entity
(T
));
10249 Set_Has_Implicit_Dereference
10250 (Def_Id
, Has_Implicit_Dereference
(T
));
10251 Set_Has_Pragma_Unreferenced_Objects
10252 (Def_Id
, Has_Pragma_Unreferenced_Objects
(T
));
10254 -- If the subtype is the completion of a private declaration, there may
10255 -- have been representation clauses for the partial view, and they must
10256 -- be preserved. Build_Derived_Type chains the inherited clauses with
10257 -- the ones appearing on the extension. If this comes from a subtype
10258 -- declaration, all clauses are inherited.
10260 if No
(First_Rep_Item
(Def_Id
)) then
10261 Set_First_Rep_Item
(Def_Id
, First_Rep_Item
(T
));
10264 if Is_Tagged_Type
(T
) then
10265 Set_Is_Tagged_Type
(Def_Id
);
10266 Set_No_Tagged_Streams_Pragma
(Def_Id
, No_Tagged_Streams_Pragma
(T
));
10267 Make_Class_Wide_Type
(Def_Id
);
10270 Set_Stored_Constraint
(Def_Id
, No_Elist
);
10273 Set_Discriminant_Constraint
(Def_Id
, Elist
);
10274 Set_Stored_Constraint_From_Discriminant_Constraint
(Def_Id
);
10277 if Is_Tagged_Type
(T
) then
10279 -- Ada 2005 (AI-251): In case of concurrent types we inherit the
10280 -- concurrent record type (which has the list of primitive
10283 if Ada_Version
>= Ada_2005
10284 and then Is_Concurrent_Type
(T
)
10286 Set_Corresponding_Record_Type
(Def_Id
,
10287 Corresponding_Record_Type
(T
));
10289 Set_Direct_Primitive_Operations
(Def_Id
,
10290 Direct_Primitive_Operations
(T
));
10293 Set_Is_Abstract_Type
(Def_Id
, Is_Abstract_Type
(T
));
10296 -- Subtypes introduced by component declarations do not need to be
10297 -- marked as delayed, and do not get freeze nodes, because the semantics
10298 -- verifies that the parents of the subtypes are frozen before the
10299 -- enclosing record is frozen.
10301 if not Is_Type
(Scope
(Def_Id
)) then
10302 Set_Depends_On_Private
(Def_Id
, Depends_On_Private
(T
));
10304 if Is_Private_Type
(T
)
10305 and then Present
(Full_View
(T
))
10307 Conditional_Delay
(Def_Id
, Full_View
(T
));
10309 Conditional_Delay
(Def_Id
, T
);
10313 if Is_Record_Type
(T
) then
10314 Set_Is_Limited_Record
(Def_Id
, Is_Limited_Record
(T
));
10317 and then not Is_Empty_Elmt_List
(Elist
)
10318 and then not For_Access
10320 Create_Constrained_Components
(Def_Id
, Related_Nod
, T
, Elist
);
10322 elsif not For_Access
then
10323 Set_Cloned_Subtype
(Def_Id
, T
);
10326 end Build_Discriminated_Subtype
;
10328 ---------------------------
10329 -- Build_Itype_Reference --
10330 ---------------------------
10332 procedure Build_Itype_Reference
10336 IR
: constant Node_Id
:= Make_Itype_Reference
(Sloc
(Nod
));
10339 -- Itype references are only created for use by the back-end
10341 if Inside_A_Generic
then
10344 Set_Itype
(IR
, Ityp
);
10346 -- If Nod is a library unit entity, then Insert_After won't work,
10347 -- because Nod is not a member of any list. Therefore, we use
10348 -- Add_Global_Declaration in this case. This can happen if we have a
10349 -- build-in-place library function.
10351 if (Nkind
(Nod
) in N_Entity
and then Is_Compilation_Unit
(Nod
))
10353 (Nkind
(Nod
) = N_Defining_Program_Unit_Name
10354 and then Is_Compilation_Unit
(Defining_Identifier
(Nod
)))
10356 Add_Global_Declaration
(IR
);
10358 Insert_After
(Nod
, IR
);
10361 end Build_Itype_Reference
;
10363 ------------------------
10364 -- Build_Scalar_Bound --
10365 ------------------------
10367 function Build_Scalar_Bound
10370 Der_T
: Entity_Id
) return Node_Id
10372 New_Bound
: Entity_Id
;
10375 -- Note: not clear why this is needed, how can the original bound
10376 -- be unanalyzed at this point? and if it is, what business do we
10377 -- have messing around with it? and why is the base type of the
10378 -- parent type the right type for the resolution. It probably is
10379 -- not. It is OK for the new bound we are creating, but not for
10380 -- the old one??? Still if it never happens, no problem.
10382 Analyze_And_Resolve
(Bound
, Base_Type
(Par_T
));
10384 if Nkind_In
(Bound
, N_Integer_Literal
, N_Real_Literal
) then
10385 New_Bound
:= New_Copy
(Bound
);
10386 Set_Etype
(New_Bound
, Der_T
);
10387 Set_Analyzed
(New_Bound
);
10389 elsif Is_Entity_Name
(Bound
) then
10390 New_Bound
:= OK_Convert_To
(Der_T
, New_Copy
(Bound
));
10392 -- The following is almost certainly wrong. What business do we have
10393 -- relocating a node (Bound) that is presumably still attached to
10394 -- the tree elsewhere???
10397 New_Bound
:= OK_Convert_To
(Der_T
, Relocate_Node
(Bound
));
10400 Set_Etype
(New_Bound
, Der_T
);
10402 end Build_Scalar_Bound
;
10404 --------------------------------
10405 -- Build_Underlying_Full_View --
10406 --------------------------------
10408 procedure Build_Underlying_Full_View
10413 Loc
: constant Source_Ptr
:= Sloc
(N
);
10414 Subt
: constant Entity_Id
:=
10415 Make_Defining_Identifier
10416 (Loc
, New_External_Name
(Chars
(Typ
), 'S'));
10423 procedure Set_Discriminant_Name
(Id
: Node_Id
);
10424 -- If the derived type has discriminants, they may rename discriminants
10425 -- of the parent. When building the full view of the parent, we need to
10426 -- recover the names of the original discriminants if the constraint is
10427 -- given by named associations.
10429 ---------------------------
10430 -- Set_Discriminant_Name --
10431 ---------------------------
10433 procedure Set_Discriminant_Name
(Id
: Node_Id
) is
10437 Set_Original_Discriminant
(Id
, Empty
);
10439 if Has_Discriminants
(Typ
) then
10440 Disc
:= First_Discriminant
(Typ
);
10441 while Present
(Disc
) loop
10442 if Chars
(Disc
) = Chars
(Id
)
10443 and then Present
(Corresponding_Discriminant
(Disc
))
10445 Set_Chars
(Id
, Chars
(Corresponding_Discriminant
(Disc
)));
10447 Next_Discriminant
(Disc
);
10450 end Set_Discriminant_Name
;
10452 -- Start of processing for Build_Underlying_Full_View
10455 if Nkind
(N
) = N_Full_Type_Declaration
then
10456 Constr
:= Constraint
(Subtype_Indication
(Type_Definition
(N
)));
10458 elsif Nkind
(N
) = N_Subtype_Declaration
then
10459 Constr
:= New_Copy_Tree
(Constraint
(Subtype_Indication
(N
)));
10461 elsif Nkind
(N
) = N_Component_Declaration
then
10464 (Constraint
(Subtype_Indication
(Component_Definition
(N
))));
10467 raise Program_Error
;
10470 C
:= First
(Constraints
(Constr
));
10471 while Present
(C
) loop
10472 if Nkind
(C
) = N_Discriminant_Association
then
10473 Id
:= First
(Selector_Names
(C
));
10474 while Present
(Id
) loop
10475 Set_Discriminant_Name
(Id
);
10484 Make_Subtype_Declaration
(Loc
,
10485 Defining_Identifier
=> Subt
,
10486 Subtype_Indication
=>
10487 Make_Subtype_Indication
(Loc
,
10488 Subtype_Mark
=> New_Occurrence_Of
(Par
, Loc
),
10489 Constraint
=> New_Copy_Tree
(Constr
)));
10491 -- If this is a component subtype for an outer itype, it is not
10492 -- a list member, so simply set the parent link for analysis: if
10493 -- the enclosing type does not need to be in a declarative list,
10494 -- neither do the components.
10496 if Is_List_Member
(N
)
10497 and then Nkind
(N
) /= N_Component_Declaration
10499 Insert_Before
(N
, Indic
);
10501 Set_Parent
(Indic
, Parent
(N
));
10505 Set_Underlying_Full_View
(Typ
, Full_View
(Subt
));
10506 Set_Is_Underlying_Full_View
(Full_View
(Subt
));
10507 end Build_Underlying_Full_View
;
10509 -------------------------------
10510 -- Check_Abstract_Overriding --
10511 -------------------------------
10513 procedure Check_Abstract_Overriding
(T
: Entity_Id
) is
10514 Alias_Subp
: Entity_Id
;
10516 Op_List
: Elist_Id
;
10518 Type_Def
: Node_Id
;
10520 procedure Check_Pragma_Implemented
(Subp
: Entity_Id
);
10521 -- Ada 2012 (AI05-0030): Subprogram Subp overrides an interface routine
10522 -- which has pragma Implemented already set. Check whether Subp's entity
10523 -- kind conforms to the implementation kind of the overridden routine.
10525 procedure Check_Pragma_Implemented
10527 Iface_Subp
: Entity_Id
);
10528 -- Ada 2012 (AI05-0030): Subprogram Subp overrides interface routine
10529 -- Iface_Subp and both entities have pragma Implemented already set on
10530 -- them. Check whether the two implementation kinds are conforming.
10532 procedure Inherit_Pragma_Implemented
10534 Iface_Subp
: Entity_Id
);
10535 -- Ada 2012 (AI05-0030): Interface primitive Subp overrides interface
10536 -- subprogram Iface_Subp which has been marked by pragma Implemented.
10537 -- Propagate the implementation kind of Iface_Subp to Subp.
10539 ------------------------------
10540 -- Check_Pragma_Implemented --
10541 ------------------------------
10543 procedure Check_Pragma_Implemented
(Subp
: Entity_Id
) is
10544 Iface_Alias
: constant Entity_Id
:= Interface_Alias
(Subp
);
10545 Impl_Kind
: constant Name_Id
:= Implementation_Kind
(Iface_Alias
);
10546 Subp_Alias
: constant Entity_Id
:= Alias
(Subp
);
10547 Contr_Typ
: Entity_Id
;
10548 Impl_Subp
: Entity_Id
;
10551 -- Subp must have an alias since it is a hidden entity used to link
10552 -- an interface subprogram to its overriding counterpart.
10554 pragma Assert
(Present
(Subp_Alias
));
10556 -- Handle aliases to synchronized wrappers
10558 Impl_Subp
:= Subp_Alias
;
10560 if Is_Primitive_Wrapper
(Impl_Subp
) then
10561 Impl_Subp
:= Wrapped_Entity
(Impl_Subp
);
10564 -- Extract the type of the controlling formal
10566 Contr_Typ
:= Etype
(First_Formal
(Subp_Alias
));
10568 if Is_Concurrent_Record_Type
(Contr_Typ
) then
10569 Contr_Typ
:= Corresponding_Concurrent_Type
(Contr_Typ
);
10572 -- An interface subprogram whose implementation kind is By_Entry must
10573 -- be implemented by an entry.
10575 if Impl_Kind
= Name_By_Entry
10576 and then Ekind
(Impl_Subp
) /= E_Entry
10578 Error_Msg_Node_2
:= Iface_Alias
;
10580 ("type & must implement abstract subprogram & with an entry",
10581 Subp_Alias
, Contr_Typ
);
10583 elsif Impl_Kind
= Name_By_Protected_Procedure
then
10585 -- An interface subprogram whose implementation kind is By_
10586 -- Protected_Procedure cannot be implemented by a primitive
10587 -- procedure of a task type.
10589 if Ekind
(Contr_Typ
) /= E_Protected_Type
then
10590 Error_Msg_Node_2
:= Contr_Typ
;
10592 ("interface subprogram & cannot be implemented by a " &
10593 "primitive procedure of task type &", Subp_Alias
,
10596 -- An interface subprogram whose implementation kind is By_
10597 -- Protected_Procedure must be implemented by a procedure.
10599 elsif Ekind
(Impl_Subp
) /= E_Procedure
then
10600 Error_Msg_Node_2
:= Iface_Alias
;
10602 ("type & must implement abstract subprogram & with a " &
10603 "procedure", Subp_Alias
, Contr_Typ
);
10605 elsif Present
(Get_Rep_Pragma
(Impl_Subp
, Name_Implemented
))
10606 and then Implementation_Kind
(Impl_Subp
) /= Impl_Kind
10608 Error_Msg_Name_1
:= Impl_Kind
;
10610 ("overriding operation& must have synchronization%",
10614 -- If primitive has Optional synchronization, overriding operation
10615 -- must match if it has an explicit synchronization..
10617 elsif Present
(Get_Rep_Pragma
(Impl_Subp
, Name_Implemented
))
10618 and then Implementation_Kind
(Impl_Subp
) /= Impl_Kind
10620 Error_Msg_Name_1
:= Impl_Kind
;
10622 ("overriding operation& must have syncrhonization%",
10625 end Check_Pragma_Implemented
;
10627 ------------------------------
10628 -- Check_Pragma_Implemented --
10629 ------------------------------
10631 procedure Check_Pragma_Implemented
10633 Iface_Subp
: Entity_Id
)
10635 Iface_Kind
: constant Name_Id
:= Implementation_Kind
(Iface_Subp
);
10636 Subp_Kind
: constant Name_Id
:= Implementation_Kind
(Subp
);
10639 -- Ada 2012 (AI05-0030): The implementation kinds of an overridden
10640 -- and overriding subprogram are different. In general this is an
10641 -- error except when the implementation kind of the overridden
10642 -- subprograms is By_Any or Optional.
10644 if Iface_Kind
/= Subp_Kind
10645 and then Iface_Kind
/= Name_By_Any
10646 and then Iface_Kind
/= Name_Optional
10648 if Iface_Kind
= Name_By_Entry
then
10650 ("incompatible implementation kind, overridden subprogram " &
10651 "is marked By_Entry", Subp
);
10654 ("incompatible implementation kind, overridden subprogram " &
10655 "is marked By_Protected_Procedure", Subp
);
10658 end Check_Pragma_Implemented
;
10660 --------------------------------
10661 -- Inherit_Pragma_Implemented --
10662 --------------------------------
10664 procedure Inherit_Pragma_Implemented
10666 Iface_Subp
: Entity_Id
)
10668 Iface_Kind
: constant Name_Id
:= Implementation_Kind
(Iface_Subp
);
10669 Loc
: constant Source_Ptr
:= Sloc
(Subp
);
10670 Impl_Prag
: Node_Id
;
10673 -- Since the implementation kind is stored as a representation item
10674 -- rather than a flag, create a pragma node.
10678 Chars
=> Name_Implemented
,
10679 Pragma_Argument_Associations
=> New_List
(
10680 Make_Pragma_Argument_Association
(Loc
,
10681 Expression
=> New_Occurrence_Of
(Subp
, Loc
)),
10683 Make_Pragma_Argument_Association
(Loc
,
10684 Expression
=> Make_Identifier
(Loc
, Iface_Kind
))));
10686 -- The pragma doesn't need to be analyzed because it is internally
10687 -- built. It is safe to directly register it as a rep item since we
10688 -- are only interested in the characters of the implementation kind.
10690 Record_Rep_Item
(Subp
, Impl_Prag
);
10691 end Inherit_Pragma_Implemented
;
10693 -- Start of processing for Check_Abstract_Overriding
10696 Op_List
:= Primitive_Operations
(T
);
10698 -- Loop to check primitive operations
10700 Elmt
:= First_Elmt
(Op_List
);
10701 while Present
(Elmt
) loop
10702 Subp
:= Node
(Elmt
);
10703 Alias_Subp
:= Alias
(Subp
);
10705 -- Inherited subprograms are identified by the fact that they do not
10706 -- come from source, and the associated source location is the
10707 -- location of the first subtype of the derived type.
10709 -- Ada 2005 (AI-228): Apply the rules of RM-3.9.3(6/2) for
10710 -- subprograms that "require overriding".
10712 -- Special exception, do not complain about failure to override the
10713 -- stream routines _Input and _Output, as well as the primitive
10714 -- operations used in dispatching selects since we always provide
10715 -- automatic overridings for these subprograms.
10717 -- The partial view of T may have been a private extension, for
10718 -- which inherited functions dispatching on result are abstract.
10719 -- If the full view is a null extension, there is no need for
10720 -- overriding in Ada 2005, but wrappers need to be built for them
10721 -- (see exp_ch3, Build_Controlling_Function_Wrappers).
10723 if Is_Null_Extension
(T
)
10724 and then Has_Controlling_Result
(Subp
)
10725 and then Ada_Version
>= Ada_2005
10726 and then Present
(Alias_Subp
)
10727 and then not Comes_From_Source
(Subp
)
10728 and then not Is_Abstract_Subprogram
(Alias_Subp
)
10729 and then not Is_Access_Type
(Etype
(Subp
))
10733 -- Ada 2005 (AI-251): Internal entities of interfaces need no
10734 -- processing because this check is done with the aliased
10737 elsif Present
(Interface_Alias
(Subp
)) then
10740 elsif (Is_Abstract_Subprogram
(Subp
)
10741 or else Requires_Overriding
(Subp
)
10743 (Has_Controlling_Result
(Subp
)
10744 and then Present
(Alias_Subp
)
10745 and then not Comes_From_Source
(Subp
)
10746 and then Sloc
(Subp
) = Sloc
(First_Subtype
(T
))))
10747 and then not Is_TSS
(Subp
, TSS_Stream_Input
)
10748 and then not Is_TSS
(Subp
, TSS_Stream_Output
)
10749 and then not Is_Abstract_Type
(T
)
10750 and then not Is_Predefined_Interface_Primitive
(Subp
)
10752 -- Ada 2005 (AI-251): Do not consider hidden entities associated
10753 -- with abstract interface types because the check will be done
10754 -- with the aliased entity (otherwise we generate a duplicated
10757 and then not Present
(Interface_Alias
(Subp
))
10759 if Present
(Alias_Subp
) then
10761 -- Only perform the check for a derived subprogram when the
10762 -- type has an explicit record extension. This avoids incorrect
10763 -- flagging of abstract subprograms for the case of a type
10764 -- without an extension that is derived from a formal type
10765 -- with a tagged actual (can occur within a private part).
10767 -- Ada 2005 (AI-391): In the case of an inherited function with
10768 -- a controlling result of the type, the rule does not apply if
10769 -- the type is a null extension (unless the parent function
10770 -- itself is abstract, in which case the function must still be
10771 -- be overridden). The expander will generate an overriding
10772 -- wrapper function calling the parent subprogram (see
10773 -- Exp_Ch3.Make_Controlling_Wrapper_Functions).
10775 Type_Def
:= Type_Definition
(Parent
(T
));
10777 if Nkind
(Type_Def
) = N_Derived_Type_Definition
10778 and then Present
(Record_Extension_Part
(Type_Def
))
10780 (Ada_Version
< Ada_2005
10781 or else not Is_Null_Extension
(T
)
10782 or else Ekind
(Subp
) = E_Procedure
10783 or else not Has_Controlling_Result
(Subp
)
10784 or else Is_Abstract_Subprogram
(Alias_Subp
)
10785 or else Requires_Overriding
(Subp
)
10786 or else Is_Access_Type
(Etype
(Subp
)))
10788 -- Avoid reporting error in case of abstract predefined
10789 -- primitive inherited from interface type because the
10790 -- body of internally generated predefined primitives
10791 -- of tagged types are generated later by Freeze_Type
10793 if Is_Interface
(Root_Type
(T
))
10794 and then Is_Abstract_Subprogram
(Subp
)
10795 and then Is_Predefined_Dispatching_Operation
(Subp
)
10796 and then not Comes_From_Source
(Ultimate_Alias
(Subp
))
10800 -- A null extension is not obliged to override an inherited
10801 -- procedure subject to pragma Extensions_Visible with value
10802 -- False and at least one controlling OUT parameter
10803 -- (SPARK RM 6.1.7(6)).
10805 elsif Is_Null_Extension
(T
)
10806 and then Is_EVF_Procedure
(Subp
)
10812 ("type must be declared abstract or & overridden",
10815 -- Traverse the whole chain of aliased subprograms to
10816 -- complete the error notification. This is especially
10817 -- useful for traceability of the chain of entities when
10818 -- the subprogram corresponds with an interface
10819 -- subprogram (which may be defined in another package).
10821 if Present
(Alias_Subp
) then
10827 while Present
(Alias
(E
)) loop
10829 -- Avoid reporting redundant errors on entities
10830 -- inherited from interfaces
10832 if Sloc
(E
) /= Sloc
(T
) then
10833 Error_Msg_Sloc
:= Sloc
(E
);
10835 ("\& has been inherited #", T
, Subp
);
10841 Error_Msg_Sloc
:= Sloc
(E
);
10843 -- AI05-0068: report if there is an overriding
10844 -- non-abstract subprogram that is invisible.
10847 and then not Is_Abstract_Subprogram
(E
)
10850 ("\& subprogram# is not visible",
10853 -- Clarify the case where a non-null extension must
10854 -- override inherited procedure subject to pragma
10855 -- Extensions_Visible with value False and at least
10856 -- one controlling OUT param.
10858 elsif Is_EVF_Procedure
(E
) then
10860 ("\& # is subject to Extensions_Visible False",
10865 ("\& has been inherited from subprogram #",
10872 -- Ada 2005 (AI-345): Protected or task type implementing
10873 -- abstract interfaces.
10875 elsif Is_Concurrent_Record_Type
(T
)
10876 and then Present
(Interfaces
(T
))
10878 -- There is no need to check here RM 9.4(11.9/3) since we
10879 -- are processing the corresponding record type and the
10880 -- mode of the overriding subprograms was verified by
10881 -- Check_Conformance when the corresponding concurrent
10882 -- type declaration was analyzed.
10885 ("interface subprogram & must be overridden", T
, Subp
);
10887 -- Examine primitive operations of synchronized type to find
10888 -- homonyms that have the wrong profile.
10894 Prim
:= First_Entity
(Corresponding_Concurrent_Type
(T
));
10895 while Present
(Prim
) loop
10896 if Chars
(Prim
) = Chars
(Subp
) then
10898 ("profile is not type conformant with prefixed "
10899 & "view profile of inherited operation&",
10903 Next_Entity
(Prim
);
10909 Error_Msg_Node_2
:= T
;
10911 ("abstract subprogram& not allowed for type&", Subp
);
10913 -- Also post unconditional warning on the type (unconditional
10914 -- so that if there are more than one of these cases, we get
10915 -- them all, and not just the first one).
10917 Error_Msg_Node_2
:= Subp
;
10918 Error_Msg_N
("nonabstract type& has abstract subprogram&!", T
);
10921 -- A subprogram subject to pragma Extensions_Visible with value
10922 -- "True" cannot override a subprogram subject to the same pragma
10923 -- with value "False" (SPARK RM 6.1.7(5)).
10925 elsif Extensions_Visible_Status
(Subp
) = Extensions_Visible_True
10926 and then Present
(Overridden_Operation
(Subp
))
10927 and then Extensions_Visible_Status
(Overridden_Operation
(Subp
)) =
10928 Extensions_Visible_False
10930 Error_Msg_Sloc
:= Sloc
(Overridden_Operation
(Subp
));
10932 ("subprogram & with Extensions_Visible True cannot override "
10933 & "subprogram # with Extensions_Visible False", Subp
);
10936 -- Ada 2012 (AI05-0030): Perform checks related to pragma Implemented
10938 -- Subp is an expander-generated procedure which maps an interface
10939 -- alias to a protected wrapper. The interface alias is flagged by
10940 -- pragma Implemented. Ensure that Subp is a procedure when the
10941 -- implementation kind is By_Protected_Procedure or an entry when
10944 if Ada_Version
>= Ada_2012
10945 and then Is_Hidden
(Subp
)
10946 and then Present
(Interface_Alias
(Subp
))
10947 and then Has_Rep_Pragma
(Interface_Alias
(Subp
), Name_Implemented
)
10949 Check_Pragma_Implemented
(Subp
);
10952 -- Subp is an interface primitive which overrides another interface
10953 -- primitive marked with pragma Implemented.
10955 if Ada_Version
>= Ada_2012
10956 and then Present
(Overridden_Operation
(Subp
))
10957 and then Has_Rep_Pragma
10958 (Overridden_Operation
(Subp
), Name_Implemented
)
10960 -- If the overriding routine is also marked by Implemented, check
10961 -- that the two implementation kinds are conforming.
10963 if Has_Rep_Pragma
(Subp
, Name_Implemented
) then
10964 Check_Pragma_Implemented
10966 Iface_Subp
=> Overridden_Operation
(Subp
));
10968 -- Otherwise the overriding routine inherits the implementation
10969 -- kind from the overridden subprogram.
10972 Inherit_Pragma_Implemented
10974 Iface_Subp
=> Overridden_Operation
(Subp
));
10978 -- If the operation is a wrapper for a synchronized primitive, it
10979 -- may be called indirectly through a dispatching select. We assume
10980 -- that it will be referenced elsewhere indirectly, and suppress
10981 -- warnings about an unused entity.
10983 if Is_Primitive_Wrapper
(Subp
)
10984 and then Present
(Wrapped_Entity
(Subp
))
10986 Set_Referenced
(Wrapped_Entity
(Subp
));
10991 end Check_Abstract_Overriding
;
10993 ------------------------------------------------
10994 -- Check_Access_Discriminant_Requires_Limited --
10995 ------------------------------------------------
10997 procedure Check_Access_Discriminant_Requires_Limited
11002 -- A discriminant_specification for an access discriminant shall appear
11003 -- only in the declaration for a task or protected type, or for a type
11004 -- with the reserved word 'limited' in its definition or in one of its
11005 -- ancestors (RM 3.7(10)).
11007 -- AI-0063: The proper condition is that type must be immutably limited,
11008 -- or else be a partial view.
11010 if Nkind
(Discriminant_Type
(D
)) = N_Access_Definition
then
11011 if Is_Limited_View
(Current_Scope
)
11013 (Nkind
(Parent
(Current_Scope
)) = N_Private_Type_Declaration
11014 and then Limited_Present
(Parent
(Current_Scope
)))
11020 ("access discriminants allowed only for limited types", Loc
);
11023 end Check_Access_Discriminant_Requires_Limited
;
11025 -----------------------------------
11026 -- Check_Aliased_Component_Types --
11027 -----------------------------------
11029 procedure Check_Aliased_Component_Types
(T
: Entity_Id
) is
11033 -- ??? Also need to check components of record extensions, but not
11034 -- components of protected types (which are always limited).
11036 -- Ada 2005: AI-363 relaxes this rule, to allow heap objects of such
11037 -- types to be unconstrained. This is safe because it is illegal to
11038 -- create access subtypes to such types with explicit discriminant
11041 if not Is_Limited_Type
(T
) then
11042 if Ekind
(T
) = E_Record_Type
then
11043 C
:= First_Component
(T
);
11044 while Present
(C
) loop
11046 and then Has_Discriminants
(Etype
(C
))
11047 and then not Is_Constrained
(Etype
(C
))
11048 and then not In_Instance_Body
11049 and then Ada_Version
< Ada_2005
11052 ("aliased component must be constrained (RM 3.6(11))",
11056 Next_Component
(C
);
11059 elsif Ekind
(T
) = E_Array_Type
then
11060 if Has_Aliased_Components
(T
)
11061 and then Has_Discriminants
(Component_Type
(T
))
11062 and then not Is_Constrained
(Component_Type
(T
))
11063 and then not In_Instance_Body
11064 and then Ada_Version
< Ada_2005
11067 ("aliased component type must be constrained (RM 3.6(11))",
11072 end Check_Aliased_Component_Types
;
11074 ---------------------------------------
11075 -- Check_Anonymous_Access_Components --
11076 ---------------------------------------
11078 procedure Check_Anonymous_Access_Components
11079 (Typ_Decl
: Node_Id
;
11082 Comp_List
: Node_Id
)
11084 Loc
: constant Source_Ptr
:= Sloc
(Typ_Decl
);
11085 Anon_Access
: Entity_Id
;
11088 Comp_Def
: Node_Id
;
11090 Type_Def
: Node_Id
;
11092 procedure Build_Incomplete_Type_Declaration
;
11093 -- If the record type contains components that include an access to the
11094 -- current record, then create an incomplete type declaration for the
11095 -- record, to be used as the designated type of the anonymous access.
11096 -- This is done only once, and only if there is no previous partial
11097 -- view of the type.
11099 function Designates_T
(Subt
: Node_Id
) return Boolean;
11100 -- Check whether a node designates the enclosing record type, or 'Class
11103 function Mentions_T
(Acc_Def
: Node_Id
) return Boolean;
11104 -- Check whether an access definition includes a reference to
11105 -- the enclosing record type. The reference can be a subtype mark
11106 -- in the access definition itself, a 'Class attribute reference, or
11107 -- recursively a reference appearing in a parameter specification
11108 -- or result definition of an access_to_subprogram definition.
11110 --------------------------------------
11111 -- Build_Incomplete_Type_Declaration --
11112 --------------------------------------
11114 procedure Build_Incomplete_Type_Declaration
is
11119 -- Is_Tagged indicates whether the type is tagged. It is tagged if
11120 -- it's "is new ... with record" or else "is tagged record ...".
11122 Is_Tagged
: constant Boolean :=
11123 (Nkind
(Type_Definition
(Typ_Decl
)) = N_Derived_Type_Definition
11125 Present
(Record_Extension_Part
(Type_Definition
(Typ_Decl
))))
11127 (Nkind
(Type_Definition
(Typ_Decl
)) = N_Record_Definition
11128 and then Tagged_Present
(Type_Definition
(Typ_Decl
)));
11131 -- If there is a previous partial view, no need to create a new one
11132 -- If the partial view, given by Prev, is incomplete, If Prev is
11133 -- a private declaration, full declaration is flagged accordingly.
11135 if Prev
/= Typ
then
11137 Make_Class_Wide_Type
(Prev
);
11138 Set_Class_Wide_Type
(Typ
, Class_Wide_Type
(Prev
));
11139 Set_Etype
(Class_Wide_Type
(Typ
), Typ
);
11144 elsif Has_Private_Declaration
(Typ
) then
11146 -- If we refer to T'Class inside T, and T is the completion of a
11147 -- private type, then make sure the class-wide type exists.
11150 Make_Class_Wide_Type
(Typ
);
11155 -- If there was a previous anonymous access type, the incomplete
11156 -- type declaration will have been created already.
11158 elsif Present
(Current_Entity
(Typ
))
11159 and then Ekind
(Current_Entity
(Typ
)) = E_Incomplete_Type
11160 and then Full_View
(Current_Entity
(Typ
)) = Typ
11163 and then Comes_From_Source
(Current_Entity
(Typ
))
11164 and then not Is_Tagged_Type
(Current_Entity
(Typ
))
11166 Make_Class_Wide_Type
(Typ
);
11168 ("incomplete view of tagged type should be declared tagged??",
11169 Parent
(Current_Entity
(Typ
)));
11174 Inc_T
:= Make_Defining_Identifier
(Loc
, Chars
(Typ
));
11175 Decl
:= Make_Incomplete_Type_Declaration
(Loc
, Inc_T
);
11177 -- Type has already been inserted into the current scope. Remove
11178 -- it, and add incomplete declaration for type, so that subsequent
11179 -- anonymous access types can use it. The entity is unchained from
11180 -- the homonym list and from immediate visibility. After analysis,
11181 -- the entity in the incomplete declaration becomes immediately
11182 -- visible in the record declaration that follows.
11184 H
:= Current_Entity
(Typ
);
11187 Set_Name_Entity_Id
(Chars
(Typ
), Homonym
(Typ
));
11190 and then Homonym
(H
) /= Typ
11192 H
:= Homonym
(Typ
);
11195 Set_Homonym
(H
, Homonym
(Typ
));
11198 Insert_Before
(Typ_Decl
, Decl
);
11200 Set_Full_View
(Inc_T
, Typ
);
11204 -- Create a common class-wide type for both views, and set the
11205 -- Etype of the class-wide type to the full view.
11207 Make_Class_Wide_Type
(Inc_T
);
11208 Set_Class_Wide_Type
(Typ
, Class_Wide_Type
(Inc_T
));
11209 Set_Etype
(Class_Wide_Type
(Typ
), Typ
);
11212 end Build_Incomplete_Type_Declaration
;
11218 function Designates_T
(Subt
: Node_Id
) return Boolean is
11219 Type_Id
: constant Name_Id
:= Chars
(Typ
);
11221 function Names_T
(Nam
: Node_Id
) return Boolean;
11222 -- The record type has not been introduced in the current scope
11223 -- yet, so we must examine the name of the type itself, either
11224 -- an identifier T, or an expanded name of the form P.T, where
11225 -- P denotes the current scope.
11231 function Names_T
(Nam
: Node_Id
) return Boolean is
11233 if Nkind
(Nam
) = N_Identifier
then
11234 return Chars
(Nam
) = Type_Id
;
11236 elsif Nkind
(Nam
) = N_Selected_Component
then
11237 if Chars
(Selector_Name
(Nam
)) = Type_Id
then
11238 if Nkind
(Prefix
(Nam
)) = N_Identifier
then
11239 return Chars
(Prefix
(Nam
)) = Chars
(Current_Scope
);
11241 elsif Nkind
(Prefix
(Nam
)) = N_Selected_Component
then
11242 return Chars
(Selector_Name
(Prefix
(Nam
))) =
11243 Chars
(Current_Scope
);
11257 -- Start of processing for Designates_T
11260 if Nkind
(Subt
) = N_Identifier
then
11261 return Chars
(Subt
) = Type_Id
;
11263 -- Reference can be through an expanded name which has not been
11264 -- analyzed yet, and which designates enclosing scopes.
11266 elsif Nkind
(Subt
) = N_Selected_Component
then
11267 if Names_T
(Subt
) then
11270 -- Otherwise it must denote an entity that is already visible.
11271 -- The access definition may name a subtype of the enclosing
11272 -- type, if there is a previous incomplete declaration for it.
11275 Find_Selected_Component
(Subt
);
11277 Is_Entity_Name
(Subt
)
11278 and then Scope
(Entity
(Subt
)) = Current_Scope
11280 (Chars
(Base_Type
(Entity
(Subt
))) = Type_Id
11282 (Is_Class_Wide_Type
(Entity
(Subt
))
11284 Chars
(Etype
(Base_Type
(Entity
(Subt
)))) =
11288 -- A reference to the current type may appear as the prefix of
11289 -- a 'Class attribute.
11291 elsif Nkind
(Subt
) = N_Attribute_Reference
11292 and then Attribute_Name
(Subt
) = Name_Class
11294 return Names_T
(Prefix
(Subt
));
11305 function Mentions_T
(Acc_Def
: Node_Id
) return Boolean is
11306 Param_Spec
: Node_Id
;
11308 Acc_Subprg
: constant Node_Id
:=
11309 Access_To_Subprogram_Definition
(Acc_Def
);
11312 if No
(Acc_Subprg
) then
11313 return Designates_T
(Subtype_Mark
(Acc_Def
));
11316 -- Component is an access_to_subprogram: examine its formals,
11317 -- and result definition in the case of an access_to_function.
11319 Param_Spec
:= First
(Parameter_Specifications
(Acc_Subprg
));
11320 while Present
(Param_Spec
) loop
11321 if Nkind
(Parameter_Type
(Param_Spec
)) = N_Access_Definition
11322 and then Mentions_T
(Parameter_Type
(Param_Spec
))
11326 elsif Designates_T
(Parameter_Type
(Param_Spec
)) then
11333 if Nkind
(Acc_Subprg
) = N_Access_Function_Definition
then
11334 if Nkind
(Result_Definition
(Acc_Subprg
)) =
11335 N_Access_Definition
11337 return Mentions_T
(Result_Definition
(Acc_Subprg
));
11339 return Designates_T
(Result_Definition
(Acc_Subprg
));
11346 -- Start of processing for Check_Anonymous_Access_Components
11349 if No
(Comp_List
) then
11353 Comp
:= First
(Component_Items
(Comp_List
));
11354 while Present
(Comp
) loop
11355 if Nkind
(Comp
) = N_Component_Declaration
11357 (Access_Definition
(Component_Definition
(Comp
)))
11359 Mentions_T
(Access_Definition
(Component_Definition
(Comp
)))
11361 Comp_Def
:= Component_Definition
(Comp
);
11363 Access_To_Subprogram_Definition
(Access_Definition
(Comp_Def
));
11365 Build_Incomplete_Type_Declaration
;
11366 Anon_Access
:= Make_Temporary
(Loc
, 'S');
11368 -- Create a declaration for the anonymous access type: either
11369 -- an access_to_object or an access_to_subprogram.
11371 if Present
(Acc_Def
) then
11372 if Nkind
(Acc_Def
) = N_Access_Function_Definition
then
11374 Make_Access_Function_Definition
(Loc
,
11375 Parameter_Specifications
=>
11376 Parameter_Specifications
(Acc_Def
),
11377 Result_Definition
=> Result_Definition
(Acc_Def
));
11380 Make_Access_Procedure_Definition
(Loc
,
11381 Parameter_Specifications
=>
11382 Parameter_Specifications
(Acc_Def
));
11387 Make_Access_To_Object_Definition
(Loc
,
11388 Subtype_Indication
=>
11390 (Subtype_Mark
(Access_Definition
(Comp_Def
))));
11392 Set_Constant_Present
11393 (Type_Def
, Constant_Present
(Access_Definition
(Comp_Def
)));
11395 (Type_Def
, All_Present
(Access_Definition
(Comp_Def
)));
11398 Set_Null_Exclusion_Present
11400 Null_Exclusion_Present
(Access_Definition
(Comp_Def
)));
11403 Make_Full_Type_Declaration
(Loc
,
11404 Defining_Identifier
=> Anon_Access
,
11405 Type_Definition
=> Type_Def
);
11407 Insert_Before
(Typ_Decl
, Decl
);
11410 -- If an access to subprogram, create the extra formals
11412 if Present
(Acc_Def
) then
11413 Create_Extra_Formals
(Designated_Type
(Anon_Access
));
11415 -- If an access to object, preserve entity of designated type,
11416 -- for ASIS use, before rewriting the component definition.
11423 Desig
:= Entity
(Subtype_Indication
(Type_Def
));
11425 -- If the access definition is to the current record,
11426 -- the visible entity at this point is an incomplete
11427 -- type. Retrieve the full view to simplify ASIS queries
11429 if Ekind
(Desig
) = E_Incomplete_Type
then
11430 Desig
:= Full_View
(Desig
);
11434 (Subtype_Mark
(Access_Definition
(Comp_Def
)), Desig
);
11439 Make_Component_Definition
(Loc
,
11440 Subtype_Indication
=>
11441 New_Occurrence_Of
(Anon_Access
, Loc
)));
11443 if Ekind
(Designated_Type
(Anon_Access
)) = E_Subprogram_Type
then
11444 Set_Ekind
(Anon_Access
, E_Anonymous_Access_Subprogram_Type
);
11446 Set_Ekind
(Anon_Access
, E_Anonymous_Access_Type
);
11449 Set_Is_Local_Anonymous_Access
(Anon_Access
);
11455 if Present
(Variant_Part
(Comp_List
)) then
11459 V
:= First_Non_Pragma
(Variants
(Variant_Part
(Comp_List
)));
11460 while Present
(V
) loop
11461 Check_Anonymous_Access_Components
11462 (Typ_Decl
, Typ
, Prev
, Component_List
(V
));
11463 Next_Non_Pragma
(V
);
11467 end Check_Anonymous_Access_Components
;
11469 ----------------------
11470 -- Check_Completion --
11471 ----------------------
11473 procedure Check_Completion
(Body_Id
: Node_Id
:= Empty
) is
11476 procedure Post_Error
;
11477 -- Post error message for lack of completion for entity E
11483 procedure Post_Error
is
11484 procedure Missing_Body
;
11485 -- Output missing body message
11491 procedure Missing_Body
is
11493 -- Spec is in same unit, so we can post on spec
11495 if In_Same_Source_Unit
(Body_Id
, E
) then
11496 Error_Msg_N
("missing body for &", E
);
11498 -- Spec is in a separate unit, so we have to post on the body
11501 Error_Msg_NE
("missing body for & declared#!", Body_Id
, E
);
11505 -- Start of processing for Post_Error
11508 if not Comes_From_Source
(E
) then
11509 if Ekind_In
(E
, E_Task_Type
, E_Protected_Type
) then
11511 -- It may be an anonymous protected type created for a
11512 -- single variable. Post error on variable, if present.
11518 Var
:= First_Entity
(Current_Scope
);
11519 while Present
(Var
) loop
11520 exit when Etype
(Var
) = E
11521 and then Comes_From_Source
(Var
);
11526 if Present
(Var
) then
11533 -- If a generated entity has no completion, then either previous
11534 -- semantic errors have disabled the expansion phase, or else we had
11535 -- missing subunits, or else we are compiling without expansion,
11536 -- or else something is very wrong.
11538 if not Comes_From_Source
(E
) then
11540 (Serious_Errors_Detected
> 0
11541 or else Configurable_Run_Time_Violations
> 0
11542 or else Subunits_Missing
11543 or else not Expander_Active
);
11546 -- Here for source entity
11549 -- Here if no body to post the error message, so we post the error
11550 -- on the declaration that has no completion. This is not really
11551 -- the right place to post it, think about this later ???
11553 if No
(Body_Id
) then
11554 if Is_Type
(E
) then
11556 ("missing full declaration for }", Parent
(E
), E
);
11558 Error_Msg_NE
("missing body for &", Parent
(E
), E
);
11561 -- Package body has no completion for a declaration that appears
11562 -- in the corresponding spec. Post error on the body, with a
11563 -- reference to the non-completed declaration.
11566 Error_Msg_Sloc
:= Sloc
(E
);
11568 if Is_Type
(E
) then
11569 Error_Msg_NE
("missing full declaration for }!", Body_Id
, E
);
11571 elsif Is_Overloadable
(E
)
11572 and then Current_Entity_In_Scope
(E
) /= E
11574 -- It may be that the completion is mistyped and appears as
11575 -- a distinct overloading of the entity.
11578 Candidate
: constant Entity_Id
:=
11579 Current_Entity_In_Scope
(E
);
11580 Decl
: constant Node_Id
:=
11581 Unit_Declaration_Node
(Candidate
);
11584 if Is_Overloadable
(Candidate
)
11585 and then Ekind
(Candidate
) = Ekind
(E
)
11586 and then Nkind
(Decl
) = N_Subprogram_Body
11587 and then Acts_As_Spec
(Decl
)
11589 Check_Type_Conformant
(Candidate
, E
);
11605 Pack_Id
: constant Entity_Id
:= Current_Scope
;
11607 -- Start of processing for Check_Completion
11610 E
:= First_Entity
(Pack_Id
);
11611 while Present
(E
) loop
11612 if Is_Intrinsic_Subprogram
(E
) then
11615 -- The following situation requires special handling: a child unit
11616 -- that appears in the context clause of the body of its parent:
11618 -- procedure Parent.Child (...);
11620 -- with Parent.Child;
11621 -- package body Parent is
11623 -- Here Parent.Child appears as a local entity, but should not be
11624 -- flagged as requiring completion, because it is a compilation
11627 -- Ignore missing completion for a subprogram that does not come from
11628 -- source (including the _Call primitive operation of RAS types,
11629 -- which has to have the flag Comes_From_Source for other purposes):
11630 -- we assume that the expander will provide the missing completion.
11631 -- In case of previous errors, other expansion actions that provide
11632 -- bodies for null procedures with not be invoked, so inhibit message
11635 -- Note that E_Operator is not in the list that follows, because
11636 -- this kind is reserved for predefined operators, that are
11637 -- intrinsic and do not need completion.
11639 elsif Ekind_In
(E
, E_Function
,
11641 E_Generic_Function
,
11642 E_Generic_Procedure
)
11644 if Has_Completion
(E
) then
11647 elsif Is_Subprogram
(E
) and then Is_Abstract_Subprogram
(E
) then
11650 elsif Is_Subprogram
(E
)
11651 and then (not Comes_From_Source
(E
)
11652 or else Chars
(E
) = Name_uCall
)
11657 Nkind
(Parent
(Unit_Declaration_Node
(E
))) = N_Compilation_Unit
11661 elsif Nkind
(Parent
(E
)) = N_Procedure_Specification
11662 and then Null_Present
(Parent
(E
))
11663 and then Serious_Errors_Detected
> 0
11671 elsif Is_Entry
(E
) then
11672 if not Has_Completion
(E
) and then
11673 (Ekind
(Scope
(E
)) = E_Protected_Object
11674 or else Ekind
(Scope
(E
)) = E_Protected_Type
)
11679 elsif Is_Package_Or_Generic_Package
(E
) then
11680 if Unit_Requires_Body
(E
) then
11681 if not Has_Completion
(E
)
11682 and then Nkind
(Parent
(Unit_Declaration_Node
(E
))) /=
11688 elsif not Is_Child_Unit
(E
) then
11689 May_Need_Implicit_Body
(E
);
11692 -- A formal incomplete type (Ada 2012) does not require a completion;
11693 -- other incomplete type declarations do.
11695 elsif Ekind
(E
) = E_Incomplete_Type
11696 and then No
(Underlying_Type
(E
))
11697 and then not Is_Generic_Type
(E
)
11701 elsif Ekind_In
(E
, E_Task_Type
, E_Protected_Type
)
11702 and then not Has_Completion
(E
)
11706 -- A single task declared in the current scope is a constant, verify
11707 -- that the body of its anonymous type is in the same scope. If the
11708 -- task is defined elsewhere, this may be a renaming declaration for
11709 -- which no completion is needed.
11711 elsif Ekind
(E
) = E_Constant
11712 and then Ekind
(Etype
(E
)) = E_Task_Type
11713 and then not Has_Completion
(Etype
(E
))
11714 and then Scope
(Etype
(E
)) = Current_Scope
11718 elsif Ekind
(E
) = E_Protected_Object
11719 and then not Has_Completion
(Etype
(E
))
11723 elsif Ekind
(E
) = E_Record_Type
then
11724 if Is_Tagged_Type
(E
) then
11725 Check_Abstract_Overriding
(E
);
11726 Check_Conventions
(E
);
11729 Check_Aliased_Component_Types
(E
);
11731 elsif Ekind
(E
) = E_Array_Type
then
11732 Check_Aliased_Component_Types
(E
);
11738 end Check_Completion
;
11740 ------------------------------------
11741 -- Check_CPP_Type_Has_No_Defaults --
11742 ------------------------------------
11744 procedure Check_CPP_Type_Has_No_Defaults
(T
: Entity_Id
) is
11745 Tdef
: constant Node_Id
:= Type_Definition
(Declaration_Node
(T
));
11750 -- Obtain the component list
11752 if Nkind
(Tdef
) = N_Record_Definition
then
11753 Clist
:= Component_List
(Tdef
);
11754 else pragma Assert
(Nkind
(Tdef
) = N_Derived_Type_Definition
);
11755 Clist
:= Component_List
(Record_Extension_Part
(Tdef
));
11758 -- Check all components to ensure no default expressions
11760 if Present
(Clist
) then
11761 Comp
:= First
(Component_Items
(Clist
));
11762 while Present
(Comp
) loop
11763 if Present
(Expression
(Comp
)) then
11765 ("component of imported 'C'P'P type cannot have "
11766 & "default expression", Expression
(Comp
));
11772 end Check_CPP_Type_Has_No_Defaults
;
11774 ----------------------------
11775 -- Check_Delta_Expression --
11776 ----------------------------
11778 procedure Check_Delta_Expression
(E
: Node_Id
) is
11780 if not (Is_Real_Type
(Etype
(E
))) then
11781 Wrong_Type
(E
, Any_Real
);
11783 elsif not Is_OK_Static_Expression
(E
) then
11784 Flag_Non_Static_Expr
11785 ("non-static expression used for delta value!", E
);
11787 elsif not UR_Is_Positive
(Expr_Value_R
(E
)) then
11788 Error_Msg_N
("delta expression must be positive", E
);
11794 -- If any of above errors occurred, then replace the incorrect
11795 -- expression by the real 0.1, which should prevent further errors.
11798 Make_Real_Literal
(Sloc
(E
), Ureal_Tenth
));
11799 Analyze_And_Resolve
(E
, Standard_Float
);
11800 end Check_Delta_Expression
;
11802 -----------------------------
11803 -- Check_Digits_Expression --
11804 -----------------------------
11806 procedure Check_Digits_Expression
(E
: Node_Id
) is
11808 if not (Is_Integer_Type
(Etype
(E
))) then
11809 Wrong_Type
(E
, Any_Integer
);
11811 elsif not Is_OK_Static_Expression
(E
) then
11812 Flag_Non_Static_Expr
11813 ("non-static expression used for digits value!", E
);
11815 elsif Expr_Value
(E
) <= 0 then
11816 Error_Msg_N
("digits value must be greater than zero", E
);
11822 -- If any of above errors occurred, then replace the incorrect
11823 -- expression by the integer 1, which should prevent further errors.
11825 Rewrite
(E
, Make_Integer_Literal
(Sloc
(E
), 1));
11826 Analyze_And_Resolve
(E
, Standard_Integer
);
11828 end Check_Digits_Expression
;
11830 --------------------------
11831 -- Check_Initialization --
11832 --------------------------
11834 procedure Check_Initialization
(T
: Entity_Id
; Exp
: Node_Id
) is
11836 -- Special processing for limited types
11838 if Is_Limited_Type
(T
)
11839 and then not In_Instance
11840 and then not In_Inlined_Body
11842 if not OK_For_Limited_Init
(T
, Exp
) then
11844 -- In GNAT mode, this is just a warning, to allow it to be evilly
11845 -- turned off. Otherwise it is a real error.
11849 ("??cannot initialize entities of limited type!", Exp
);
11851 elsif Ada_Version
< Ada_2005
then
11853 -- The side effect removal machinery may generate illegal Ada
11854 -- code to avoid the usage of access types and 'reference in
11855 -- SPARK mode. Since this is legal code with respect to theorem
11856 -- proving, do not emit the error.
11859 and then Nkind
(Exp
) = N_Function_Call
11860 and then Nkind
(Parent
(Exp
)) = N_Object_Declaration
11861 and then not Comes_From_Source
11862 (Defining_Identifier
(Parent
(Exp
)))
11868 ("cannot initialize entities of limited type", Exp
);
11869 Explain_Limited_Type
(T
, Exp
);
11873 -- Specialize error message according to kind of illegal
11874 -- initial expression.
11876 if Nkind
(Exp
) = N_Type_Conversion
11877 and then Nkind
(Expression
(Exp
)) = N_Function_Call
11879 -- No error for internally-generated object declarations,
11880 -- which can come from build-in-place assignment statements.
11882 if Nkind
(Parent
(Exp
)) = N_Object_Declaration
11883 and then not Comes_From_Source
11884 (Defining_Identifier
(Parent
(Exp
)))
11890 ("illegal context for call to function with limited "
11896 ("initialization of limited object requires aggregate or "
11897 & "function call", Exp
);
11903 -- In gnatc or gnatprove mode, make sure set Do_Range_Check flag gets
11904 -- set unless we can be sure that no range check is required.
11906 if (GNATprove_Mode
or not Expander_Active
)
11907 and then Is_Scalar_Type
(T
)
11908 and then not Is_In_Range
(Exp
, T
, Assume_Valid
=> True)
11910 Set_Do_Range_Check
(Exp
);
11912 end Check_Initialization
;
11914 ----------------------
11915 -- Check_Interfaces --
11916 ----------------------
11918 procedure Check_Interfaces
(N
: Node_Id
; Def
: Node_Id
) is
11919 Parent_Type
: constant Entity_Id
:= Etype
(Defining_Identifier
(N
));
11922 Iface_Def
: Node_Id
;
11923 Iface_Typ
: Entity_Id
;
11924 Parent_Node
: Node_Id
;
11926 Is_Task
: Boolean := False;
11927 -- Set True if parent type or any progenitor is a task interface
11929 Is_Protected
: Boolean := False;
11930 -- Set True if parent type or any progenitor is a protected interface
11932 procedure Check_Ifaces
(Iface_Def
: Node_Id
; Error_Node
: Node_Id
);
11933 -- Check that a progenitor is compatible with declaration. If an error
11934 -- message is output, it is posted on Error_Node.
11940 procedure Check_Ifaces
(Iface_Def
: Node_Id
; Error_Node
: Node_Id
) is
11941 Iface_Id
: constant Entity_Id
:=
11942 Defining_Identifier
(Parent
(Iface_Def
));
11943 Type_Def
: Node_Id
;
11946 if Nkind
(N
) = N_Private_Extension_Declaration
then
11949 Type_Def
:= Type_Definition
(N
);
11952 if Is_Task_Interface
(Iface_Id
) then
11955 elsif Is_Protected_Interface
(Iface_Id
) then
11956 Is_Protected
:= True;
11959 if Is_Synchronized_Interface
(Iface_Id
) then
11961 -- A consequence of 3.9.4 (6/2) and 7.3 (7.2/2) is that a private
11962 -- extension derived from a synchronized interface must explicitly
11963 -- be declared synchronized, because the full view will be a
11964 -- synchronized type.
11966 if Nkind
(N
) = N_Private_Extension_Declaration
then
11967 if not Synchronized_Present
(N
) then
11969 ("private extension of& must be explicitly synchronized",
11973 -- However, by 3.9.4(16/2), a full type that is a record extension
11974 -- is never allowed to derive from a synchronized interface (note
11975 -- that interfaces must be excluded from this check, because those
11976 -- are represented by derived type definitions in some cases).
11978 elsif Nkind
(Type_Definition
(N
)) = N_Derived_Type_Definition
11979 and then not Interface_Present
(Type_Definition
(N
))
11981 Error_Msg_N
("record extension cannot derive from synchronized "
11982 & "interface", Error_Node
);
11986 -- Check that the characteristics of the progenitor are compatible
11987 -- with the explicit qualifier in the declaration.
11988 -- The check only applies to qualifiers that come from source.
11989 -- Limited_Present also appears in the declaration of corresponding
11990 -- records, and the check does not apply to them.
11992 if Limited_Present
(Type_Def
)
11994 Is_Concurrent_Record_Type
(Defining_Identifier
(N
))
11996 if Is_Limited_Interface
(Parent_Type
)
11997 and then not Is_Limited_Interface
(Iface_Id
)
12000 ("progenitor & must be limited interface",
12001 Error_Node
, Iface_Id
);
12004 (Task_Present
(Iface_Def
)
12005 or else Protected_Present
(Iface_Def
)
12006 or else Synchronized_Present
(Iface_Def
))
12007 and then Nkind
(N
) /= N_Private_Extension_Declaration
12008 and then not Error_Posted
(N
)
12011 ("progenitor & must be limited interface",
12012 Error_Node
, Iface_Id
);
12015 -- Protected interfaces can only inherit from limited, synchronized
12016 -- or protected interfaces.
12018 elsif Nkind
(N
) = N_Full_Type_Declaration
12019 and then Protected_Present
(Type_Def
)
12021 if Limited_Present
(Iface_Def
)
12022 or else Synchronized_Present
(Iface_Def
)
12023 or else Protected_Present
(Iface_Def
)
12027 elsif Task_Present
(Iface_Def
) then
12028 Error_Msg_N
("(Ada 2005) protected interface cannot inherit "
12029 & "from task interface", Error_Node
);
12032 Error_Msg_N
("(Ada 2005) protected interface cannot inherit "
12033 & "from non-limited interface", Error_Node
);
12036 -- Ada 2005 (AI-345): Synchronized interfaces can only inherit from
12037 -- limited and synchronized.
12039 elsif Synchronized_Present
(Type_Def
) then
12040 if Limited_Present
(Iface_Def
)
12041 or else Synchronized_Present
(Iface_Def
)
12045 elsif Protected_Present
(Iface_Def
)
12046 and then Nkind
(N
) /= N_Private_Extension_Declaration
12048 Error_Msg_N
("(Ada 2005) synchronized interface cannot inherit "
12049 & "from protected interface", Error_Node
);
12051 elsif Task_Present
(Iface_Def
)
12052 and then Nkind
(N
) /= N_Private_Extension_Declaration
12054 Error_Msg_N
("(Ada 2005) synchronized interface cannot inherit "
12055 & "from task interface", Error_Node
);
12057 elsif not Is_Limited_Interface
(Iface_Id
) then
12058 Error_Msg_N
("(Ada 2005) synchronized interface cannot inherit "
12059 & "from non-limited interface", Error_Node
);
12062 -- Ada 2005 (AI-345): Task interfaces can only inherit from limited,
12063 -- synchronized or task interfaces.
12065 elsif Nkind
(N
) = N_Full_Type_Declaration
12066 and then Task_Present
(Type_Def
)
12068 if Limited_Present
(Iface_Def
)
12069 or else Synchronized_Present
(Iface_Def
)
12070 or else Task_Present
(Iface_Def
)
12074 elsif Protected_Present
(Iface_Def
) then
12075 Error_Msg_N
("(Ada 2005) task interface cannot inherit from "
12076 & "protected interface", Error_Node
);
12079 Error_Msg_N
("(Ada 2005) task interface cannot inherit from "
12080 & "non-limited interface", Error_Node
);
12085 -- Start of processing for Check_Interfaces
12088 if Is_Interface
(Parent_Type
) then
12089 if Is_Task_Interface
(Parent_Type
) then
12092 elsif Is_Protected_Interface
(Parent_Type
) then
12093 Is_Protected
:= True;
12097 if Nkind
(N
) = N_Private_Extension_Declaration
then
12099 -- Check that progenitors are compatible with declaration
12101 Iface
:= First
(Interface_List
(Def
));
12102 while Present
(Iface
) loop
12103 Iface_Typ
:= Find_Type_Of_Subtype_Indic
(Iface
);
12105 Parent_Node
:= Parent
(Base_Type
(Iface_Typ
));
12106 Iface_Def
:= Type_Definition
(Parent_Node
);
12108 if not Is_Interface
(Iface_Typ
) then
12109 Diagnose_Interface
(Iface
, Iface_Typ
);
12111 Check_Ifaces
(Iface_Def
, Iface
);
12117 if Is_Task
and Is_Protected
then
12119 ("type cannot derive from task and protected interface", N
);
12125 -- Full type declaration of derived type.
12126 -- Check compatibility with parent if it is interface type
12128 if Nkind
(Type_Definition
(N
)) = N_Derived_Type_Definition
12129 and then Is_Interface
(Parent_Type
)
12131 Parent_Node
:= Parent
(Parent_Type
);
12133 -- More detailed checks for interface varieties
12136 (Iface_Def
=> Type_Definition
(Parent_Node
),
12137 Error_Node
=> Subtype_Indication
(Type_Definition
(N
)));
12140 Iface
:= First
(Interface_List
(Def
));
12141 while Present
(Iface
) loop
12142 Iface_Typ
:= Find_Type_Of_Subtype_Indic
(Iface
);
12144 Parent_Node
:= Parent
(Base_Type
(Iface_Typ
));
12145 Iface_Def
:= Type_Definition
(Parent_Node
);
12147 if not Is_Interface
(Iface_Typ
) then
12148 Diagnose_Interface
(Iface
, Iface_Typ
);
12151 -- "The declaration of a specific descendant of an interface
12152 -- type freezes the interface type" RM 13.14
12154 Freeze_Before
(N
, Iface_Typ
);
12155 Check_Ifaces
(Iface_Def
, Error_Node
=> Iface
);
12161 if Is_Task
and Is_Protected
then
12163 ("type cannot derive from task and protected interface", N
);
12165 end Check_Interfaces
;
12167 ------------------------------------
12168 -- Check_Or_Process_Discriminants --
12169 ------------------------------------
12171 -- If an incomplete or private type declaration was already given for the
12172 -- type, the discriminants may have already been processed if they were
12173 -- present on the incomplete declaration. In this case a full conformance
12174 -- check has been performed in Find_Type_Name, and we then recheck here
12175 -- some properties that can't be checked on the partial view alone.
12176 -- Otherwise we call Process_Discriminants.
12178 procedure Check_Or_Process_Discriminants
12181 Prev
: Entity_Id
:= Empty
)
12184 if Has_Discriminants
(T
) then
12186 -- Discriminants are already set on T if they were already present
12187 -- on the partial view. Make them visible to component declarations.
12191 -- Discriminant on T (full view) referencing expr on partial view
12193 Prev_D
: Entity_Id
;
12194 -- Entity of corresponding discriminant on partial view
12197 -- Discriminant specification for full view, expression is
12198 -- the syntactic copy on full view (which has been checked for
12199 -- conformance with partial view), only used here to post error
12203 D
:= First_Discriminant
(T
);
12204 New_D
:= First
(Discriminant_Specifications
(N
));
12205 while Present
(D
) loop
12206 Prev_D
:= Current_Entity
(D
);
12207 Set_Current_Entity
(D
);
12208 Set_Is_Immediately_Visible
(D
);
12209 Set_Homonym
(D
, Prev_D
);
12211 -- Handle the case where there is an untagged partial view and
12212 -- the full view is tagged: must disallow discriminants with
12213 -- defaults, unless compiling for Ada 2012, which allows a
12214 -- limited tagged type to have defaulted discriminants (see
12215 -- AI05-0214). However, suppress error here if it was already
12216 -- reported on the default expression of the partial view.
12218 if Is_Tagged_Type
(T
)
12219 and then Present
(Expression
(Parent
(D
)))
12220 and then (not Is_Limited_Type
(Current_Scope
)
12221 or else Ada_Version
< Ada_2012
)
12222 and then not Error_Posted
(Expression
(Parent
(D
)))
12224 if Ada_Version
>= Ada_2012
then
12226 ("discriminants of nonlimited tagged type cannot have "
12228 Expression
(New_D
));
12231 ("discriminants of tagged type cannot have defaults",
12232 Expression
(New_D
));
12236 -- Ada 2005 (AI-230): Access discriminant allowed in
12237 -- non-limited record types.
12239 if Ada_Version
< Ada_2005
then
12241 -- This restriction gets applied to the full type here. It
12242 -- has already been applied earlier to the partial view.
12244 Check_Access_Discriminant_Requires_Limited
(Parent
(D
), N
);
12247 Next_Discriminant
(D
);
12252 elsif Present
(Discriminant_Specifications
(N
)) then
12253 Process_Discriminants
(N
, Prev
);
12255 end Check_Or_Process_Discriminants
;
12257 ----------------------
12258 -- Check_Real_Bound --
12259 ----------------------
12261 procedure Check_Real_Bound
(Bound
: Node_Id
) is
12263 if not Is_Real_Type
(Etype
(Bound
)) then
12265 ("bound in real type definition must be of real type", Bound
);
12267 elsif not Is_OK_Static_Expression
(Bound
) then
12268 Flag_Non_Static_Expr
12269 ("non-static expression used for real type bound!", Bound
);
12276 (Bound
, Make_Real_Literal
(Sloc
(Bound
), Ureal_0
));
12278 Resolve
(Bound
, Standard_Float
);
12279 end Check_Real_Bound
;
12281 ------------------------------
12282 -- Complete_Private_Subtype --
12283 ------------------------------
12285 procedure Complete_Private_Subtype
12288 Full_Base
: Entity_Id
;
12289 Related_Nod
: Node_Id
)
12291 Save_Next_Entity
: Entity_Id
;
12292 Save_Homonym
: Entity_Id
;
12295 -- Set semantic attributes for (implicit) private subtype completion.
12296 -- If the full type has no discriminants, then it is a copy of the
12297 -- full view of the base. Otherwise, it is a subtype of the base with
12298 -- a possible discriminant constraint. Save and restore the original
12299 -- Next_Entity field of full to ensure that the calls to Copy_Node do
12300 -- not corrupt the entity chain.
12302 -- Note that the type of the full view is the same entity as the type
12303 -- of the partial view. In this fashion, the subtype has access to the
12304 -- correct view of the parent.
12306 Save_Next_Entity
:= Next_Entity
(Full
);
12307 Save_Homonym
:= Homonym
(Priv
);
12309 case Ekind
(Full_Base
) is
12310 when Class_Wide_Kind
12317 Copy_Node
(Priv
, Full
);
12319 Set_Has_Discriminants
12320 (Full
, Has_Discriminants
(Full_Base
));
12321 Set_Has_Unknown_Discriminants
12322 (Full
, Has_Unknown_Discriminants
(Full_Base
));
12323 Set_First_Entity
(Full
, First_Entity
(Full_Base
));
12324 Set_Last_Entity
(Full
, Last_Entity
(Full_Base
));
12326 -- If the underlying base type is constrained, we know that the
12327 -- full view of the subtype is constrained as well (the converse
12328 -- is not necessarily true).
12330 if Is_Constrained
(Full_Base
) then
12331 Set_Is_Constrained
(Full
);
12335 Copy_Node
(Full_Base
, Full
);
12337 Set_Chars
(Full
, Chars
(Priv
));
12338 Conditional_Delay
(Full
, Priv
);
12339 Set_Sloc
(Full
, Sloc
(Priv
));
12342 Link_Entities
(Full
, Save_Next_Entity
);
12343 Set_Homonym
(Full
, Save_Homonym
);
12344 Set_Associated_Node_For_Itype
(Full
, Related_Nod
);
12346 -- Set common attributes for all subtypes: kind, convention, etc.
12348 Set_Ekind
(Full
, Subtype_Kind
(Ekind
(Full_Base
)));
12349 Set_Convention
(Full
, Convention
(Full_Base
));
12351 -- The Etype of the full view is inconsistent. Gigi needs to see the
12352 -- structural full view, which is what the current scheme gives: the
12353 -- Etype of the full view is the etype of the full base. However, if the
12354 -- full base is a derived type, the full view then looks like a subtype
12355 -- of the parent, not a subtype of the full base. If instead we write:
12357 -- Set_Etype (Full, Full_Base);
12359 -- then we get inconsistencies in the front-end (confusion between
12360 -- views). Several outstanding bugs are related to this ???
12362 Set_Is_First_Subtype
(Full
, False);
12363 Set_Scope
(Full
, Scope
(Priv
));
12364 Set_Size_Info
(Full
, Full_Base
);
12365 Set_RM_Size
(Full
, RM_Size
(Full_Base
));
12366 Set_Is_Itype
(Full
);
12368 -- For the unusual case of a type with unknown discriminants whose
12369 -- completion is an array, use the proper full base.
12371 if Is_Array_Type
(Full_Base
)
12372 and then Has_Unknown_Discriminants
(Priv
)
12374 Set_Etype
(Full
, Full_Base
);
12377 -- A subtype of a private-type-without-discriminants, whose full-view
12378 -- has discriminants with default expressions, is not constrained.
12380 if not Has_Discriminants
(Priv
) then
12381 Set_Is_Constrained
(Full
, Is_Constrained
(Full_Base
));
12383 if Has_Discriminants
(Full_Base
) then
12384 Set_Discriminant_Constraint
12385 (Full
, Discriminant_Constraint
(Full_Base
));
12387 -- The partial view may have been indefinite, the full view
12390 Set_Has_Unknown_Discriminants
12391 (Full
, Has_Unknown_Discriminants
(Full_Base
));
12395 Set_First_Rep_Item
(Full
, First_Rep_Item
(Full_Base
));
12396 Set_Depends_On_Private
(Full
, Has_Private_Component
(Full
));
12398 -- Freeze the private subtype entity if its parent is delayed, and not
12399 -- already frozen. We skip this processing if the type is an anonymous
12400 -- subtype of a record component, or is the corresponding record of a
12401 -- protected type, since these are processed when the enclosing type
12402 -- is frozen. If the parent type is declared in a nested package then
12403 -- the freezing of the private and full views also happens later.
12405 if not Is_Type
(Scope
(Full
)) then
12407 and then In_Same_Source_Unit
(Full
, Full_Base
)
12408 and then Scope
(Full_Base
) /= Scope
(Full
)
12410 Set_Has_Delayed_Freeze
(Full
);
12411 Set_Has_Delayed_Freeze
(Priv
);
12414 Set_Has_Delayed_Freeze
(Full
,
12415 Has_Delayed_Freeze
(Full_Base
)
12416 and then not Is_Frozen
(Full_Base
));
12420 Set_Freeze_Node
(Full
, Empty
);
12421 Set_Is_Frozen
(Full
, False);
12422 Set_Full_View
(Priv
, Full
);
12424 if Has_Discriminants
(Full
) then
12425 Set_Stored_Constraint_From_Discriminant_Constraint
(Full
);
12426 Set_Stored_Constraint
(Priv
, Stored_Constraint
(Full
));
12428 if Has_Unknown_Discriminants
(Full
) then
12429 Set_Discriminant_Constraint
(Full
, No_Elist
);
12433 if Ekind
(Full_Base
) = E_Record_Type
12434 and then Has_Discriminants
(Full_Base
)
12435 and then Has_Discriminants
(Priv
) -- might not, if errors
12436 and then not Has_Unknown_Discriminants
(Priv
)
12437 and then not Is_Empty_Elmt_List
(Discriminant_Constraint
(Priv
))
12439 Create_Constrained_Components
12440 (Full
, Related_Nod
, Full_Base
, Discriminant_Constraint
(Priv
));
12442 -- If the full base is itself derived from private, build a congruent
12443 -- subtype of its underlying type, for use by the back end. For a
12444 -- constrained record component, the declaration cannot be placed on
12445 -- the component list, but it must nevertheless be built an analyzed, to
12446 -- supply enough information for Gigi to compute the size of component.
12448 elsif Ekind
(Full_Base
) in Private_Kind
12449 and then Is_Derived_Type
(Full_Base
)
12450 and then Has_Discriminants
(Full_Base
)
12451 and then (Ekind
(Current_Scope
) /= E_Record_Subtype
)
12453 if not Is_Itype
(Priv
)
12455 Nkind
(Subtype_Indication
(Parent
(Priv
))) = N_Subtype_Indication
12457 Build_Underlying_Full_View
12458 (Parent
(Priv
), Full
, Etype
(Full_Base
));
12460 elsif Nkind
(Related_Nod
) = N_Component_Declaration
then
12461 Build_Underlying_Full_View
(Related_Nod
, Full
, Etype
(Full_Base
));
12464 elsif Is_Record_Type
(Full_Base
) then
12466 -- Show Full is simply a renaming of Full_Base
12468 Set_Cloned_Subtype
(Full
, Full_Base
);
12471 -- It is unsafe to share the bounds of a scalar type, because the Itype
12472 -- is elaborated on demand, and if a bound is non-static then different
12473 -- orders of elaboration in different units will lead to different
12474 -- external symbols.
12476 if Is_Scalar_Type
(Full_Base
) then
12477 Set_Scalar_Range
(Full
,
12478 Make_Range
(Sloc
(Related_Nod
),
12480 Duplicate_Subexpr_No_Checks
(Type_Low_Bound
(Full_Base
)),
12482 Duplicate_Subexpr_No_Checks
(Type_High_Bound
(Full_Base
))));
12484 -- This completion inherits the bounds of the full parent, but if
12485 -- the parent is an unconstrained floating point type, so is the
12488 if Is_Floating_Point_Type
(Full_Base
) then
12489 Set_Includes_Infinities
12490 (Scalar_Range
(Full
), Has_Infinities
(Full_Base
));
12494 -- ??? It seems that a lot of fields are missing that should be copied
12495 -- from Full_Base to Full. Here are some that are introduced in a
12496 -- non-disruptive way but a cleanup is necessary.
12498 if Is_Tagged_Type
(Full_Base
) then
12499 Set_Is_Tagged_Type
(Full
);
12500 Set_Direct_Primitive_Operations
12501 (Full
, Direct_Primitive_Operations
(Full_Base
));
12502 Set_No_Tagged_Streams_Pragma
12503 (Full
, No_Tagged_Streams_Pragma
(Full_Base
));
12505 -- Inherit class_wide type of full_base in case the partial view was
12506 -- not tagged. Otherwise it has already been created when the private
12507 -- subtype was analyzed.
12509 if No
(Class_Wide_Type
(Full
)) then
12510 Set_Class_Wide_Type
(Full
, Class_Wide_Type
(Full_Base
));
12513 -- If this is a subtype of a protected or task type, constrain its
12514 -- corresponding record, unless this is a subtype without constraints,
12515 -- i.e. a simple renaming as with an actual subtype in an instance.
12517 elsif Is_Concurrent_Type
(Full_Base
) then
12518 if Has_Discriminants
(Full
)
12519 and then Present
(Corresponding_Record_Type
(Full_Base
))
12521 not Is_Empty_Elmt_List
(Discriminant_Constraint
(Full
))
12523 Set_Corresponding_Record_Type
(Full
,
12524 Constrain_Corresponding_Record
12525 (Full
, Corresponding_Record_Type
(Full_Base
), Related_Nod
));
12528 Set_Corresponding_Record_Type
(Full
,
12529 Corresponding_Record_Type
(Full_Base
));
12533 -- Link rep item chain, and also setting of Has_Predicates from private
12534 -- subtype to full subtype, since we will need these on the full subtype
12535 -- to create the predicate function. Note that the full subtype may
12536 -- already have rep items, inherited from the full view of the base
12537 -- type, so we must be sure not to overwrite these entries.
12542 Next_Item
: Node_Id
;
12543 Priv_Item
: Node_Id
;
12546 Item
:= First_Rep_Item
(Full
);
12547 Priv_Item
:= First_Rep_Item
(Priv
);
12549 -- If no existing rep items on full type, we can just link directly
12550 -- to the list of items on the private type, if any exist.. Same if
12551 -- the rep items are only those inherited from the base
12554 or else Nkind
(Item
) /= N_Aspect_Specification
12555 or else Entity
(Item
) = Full_Base
)
12556 and then Present
(First_Rep_Item
(Priv
))
12558 Set_First_Rep_Item
(Full
, Priv_Item
);
12560 -- Otherwise, search to the end of items currently linked to the full
12561 -- subtype and append the private items to the end. However, if Priv
12562 -- and Full already have the same list of rep items, then the append
12563 -- is not done, as that would create a circularity.
12565 -- The partial view may have a predicate and the rep item lists of
12566 -- both views agree when inherited from the same ancestor. In that
12567 -- case, simply propagate the list from one view to the other.
12568 -- A more complex analysis needed here ???
12570 elsif Present
(Priv_Item
)
12571 and then Item
= Next_Rep_Item
(Priv_Item
)
12573 Set_First_Rep_Item
(Full
, Priv_Item
);
12575 elsif Item
/= Priv_Item
then
12578 Next_Item
:= Next_Rep_Item
(Item
);
12579 exit when No
(Next_Item
);
12582 -- If the private view has aspect specifications, the full view
12583 -- inherits them. Since these aspects may already have been
12584 -- attached to the full view during derivation, do not append
12585 -- them if already present.
12587 if Item
= First_Rep_Item
(Priv
) then
12593 -- And link the private type items at the end of the chain
12596 Set_Next_Rep_Item
(Item
, First_Rep_Item
(Priv
));
12601 -- Make sure Has_Predicates is set on full type if it is set on the
12602 -- private type. Note that it may already be set on the full type and
12603 -- if so, we don't want to unset it. Similarly, propagate information
12604 -- about delayed aspects, because the corresponding pragmas must be
12605 -- analyzed when one of the views is frozen. This last step is needed
12606 -- in particular when the full type is a scalar type for which an
12607 -- anonymous base type is constructed.
12609 -- The predicate functions are generated either at the freeze point
12610 -- of the type or at the end of the visible part, and we must avoid
12611 -- generating them twice.
12613 if Has_Predicates
(Priv
) then
12614 Set_Has_Predicates
(Full
);
12616 if Present
(Predicate_Function
(Priv
))
12617 and then No
(Predicate_Function
(Full
))
12619 Set_Predicate_Function
(Full
, Predicate_Function
(Priv
));
12623 if Has_Delayed_Aspects
(Priv
) then
12624 Set_Has_Delayed_Aspects
(Full
);
12626 end Complete_Private_Subtype
;
12628 ----------------------------
12629 -- Constant_Redeclaration --
12630 ----------------------------
12632 procedure Constant_Redeclaration
12637 Prev
: constant Entity_Id
:= Current_Entity_In_Scope
(Id
);
12638 Obj_Def
: constant Node_Id
:= Object_Definition
(N
);
12641 procedure Check_Possible_Deferred_Completion
12642 (Prev_Id
: Entity_Id
;
12643 Prev_Obj_Def
: Node_Id
;
12644 Curr_Obj_Def
: Node_Id
);
12645 -- Determine whether the two object definitions describe the partial
12646 -- and the full view of a constrained deferred constant. Generate
12647 -- a subtype for the full view and verify that it statically matches
12648 -- the subtype of the partial view.
12650 procedure Check_Recursive_Declaration
(Typ
: Entity_Id
);
12651 -- If deferred constant is an access type initialized with an allocator,
12652 -- check whether there is an illegal recursion in the definition,
12653 -- through a default value of some record subcomponent. This is normally
12654 -- detected when generating init procs, but requires this additional
12655 -- mechanism when expansion is disabled.
12657 ----------------------------------------
12658 -- Check_Possible_Deferred_Completion --
12659 ----------------------------------------
12661 procedure Check_Possible_Deferred_Completion
12662 (Prev_Id
: Entity_Id
;
12663 Prev_Obj_Def
: Node_Id
;
12664 Curr_Obj_Def
: Node_Id
)
12667 if Nkind
(Prev_Obj_Def
) = N_Subtype_Indication
12668 and then Present
(Constraint
(Prev_Obj_Def
))
12669 and then Nkind
(Curr_Obj_Def
) = N_Subtype_Indication
12670 and then Present
(Constraint
(Curr_Obj_Def
))
12673 Loc
: constant Source_Ptr
:= Sloc
(N
);
12674 Def_Id
: constant Entity_Id
:= Make_Temporary
(Loc
, 'S');
12675 Decl
: constant Node_Id
:=
12676 Make_Subtype_Declaration
(Loc
,
12677 Defining_Identifier
=> Def_Id
,
12678 Subtype_Indication
=>
12679 Relocate_Node
(Curr_Obj_Def
));
12682 Insert_Before_And_Analyze
(N
, Decl
);
12683 Set_Etype
(Id
, Def_Id
);
12685 if not Subtypes_Statically_Match
(Etype
(Prev_Id
), Def_Id
) then
12686 Error_Msg_Sloc
:= Sloc
(Prev_Id
);
12687 Error_Msg_N
("subtype does not statically match deferred "
12688 & "declaration #", N
);
12692 end Check_Possible_Deferred_Completion
;
12694 ---------------------------------
12695 -- Check_Recursive_Declaration --
12696 ---------------------------------
12698 procedure Check_Recursive_Declaration
(Typ
: Entity_Id
) is
12702 if Is_Record_Type
(Typ
) then
12703 Comp
:= First_Component
(Typ
);
12704 while Present
(Comp
) loop
12705 if Comes_From_Source
(Comp
) then
12706 if Present
(Expression
(Parent
(Comp
)))
12707 and then Is_Entity_Name
(Expression
(Parent
(Comp
)))
12708 and then Entity
(Expression
(Parent
(Comp
))) = Prev
12710 Error_Msg_Sloc
:= Sloc
(Parent
(Comp
));
12712 ("illegal circularity with declaration for & #",
12716 elsif Is_Record_Type
(Etype
(Comp
)) then
12717 Check_Recursive_Declaration
(Etype
(Comp
));
12721 Next_Component
(Comp
);
12724 end Check_Recursive_Declaration
;
12726 -- Start of processing for Constant_Redeclaration
12729 if Nkind
(Parent
(Prev
)) = N_Object_Declaration
then
12730 if Nkind
(Object_Definition
12731 (Parent
(Prev
))) = N_Subtype_Indication
12733 -- Find type of new declaration. The constraints of the two
12734 -- views must match statically, but there is no point in
12735 -- creating an itype for the full view.
12737 if Nkind
(Obj_Def
) = N_Subtype_Indication
then
12738 Find_Type
(Subtype_Mark
(Obj_Def
));
12739 New_T
:= Entity
(Subtype_Mark
(Obj_Def
));
12742 Find_Type
(Obj_Def
);
12743 New_T
:= Entity
(Obj_Def
);
12749 -- The full view may impose a constraint, even if the partial
12750 -- view does not, so construct the subtype.
12752 New_T
:= Find_Type_Of_Object
(Obj_Def
, N
);
12757 -- Current declaration is illegal, diagnosed below in Enter_Name
12763 -- If previous full declaration or a renaming declaration exists, or if
12764 -- a homograph is present, let Enter_Name handle it, either with an
12765 -- error or with the removal of an overridden implicit subprogram.
12766 -- The previous one is a full declaration if it has an expression
12767 -- (which in the case of an aggregate is indicated by the Init flag).
12769 if Ekind
(Prev
) /= E_Constant
12770 or else Nkind
(Parent
(Prev
)) = N_Object_Renaming_Declaration
12771 or else Present
(Expression
(Parent
(Prev
)))
12772 or else Has_Init_Expression
(Parent
(Prev
))
12773 or else Present
(Full_View
(Prev
))
12777 -- Verify that types of both declarations match, or else that both types
12778 -- are anonymous access types whose designated subtypes statically match
12779 -- (as allowed in Ada 2005 by AI-385).
12781 elsif Base_Type
(Etype
(Prev
)) /= Base_Type
(New_T
)
12783 (Ekind
(Etype
(Prev
)) /= E_Anonymous_Access_Type
12784 or else Ekind
(Etype
(New_T
)) /= E_Anonymous_Access_Type
12785 or else Is_Access_Constant
(Etype
(New_T
)) /=
12786 Is_Access_Constant
(Etype
(Prev
))
12787 or else Can_Never_Be_Null
(Etype
(New_T
)) /=
12788 Can_Never_Be_Null
(Etype
(Prev
))
12789 or else Null_Exclusion_Present
(Parent
(Prev
)) /=
12790 Null_Exclusion_Present
(Parent
(Id
))
12791 or else not Subtypes_Statically_Match
12792 (Designated_Type
(Etype
(Prev
)),
12793 Designated_Type
(Etype
(New_T
))))
12795 Error_Msg_Sloc
:= Sloc
(Prev
);
12796 Error_Msg_N
("type does not match declaration#", N
);
12797 Set_Full_View
(Prev
, Id
);
12798 Set_Etype
(Id
, Any_Type
);
12800 -- A deferred constant whose type is an anonymous array is always
12801 -- illegal (unless imported). A detailed error message might be
12802 -- helpful for Ada beginners.
12804 if Nkind
(Object_Definition
(Parent
(Prev
)))
12805 = N_Constrained_Array_Definition
12806 and then Nkind
(Object_Definition
(N
))
12807 = N_Constrained_Array_Definition
12809 Error_Msg_N
("\each anonymous array is a distinct type", N
);
12810 Error_Msg_N
("a deferred constant must have a named type",
12811 Object_Definition
(Parent
(Prev
)));
12815 Null_Exclusion_Present
(Parent
(Prev
))
12816 and then not Null_Exclusion_Present
(N
)
12818 Error_Msg_Sloc
:= Sloc
(Prev
);
12819 Error_Msg_N
("null-exclusion does not match declaration#", N
);
12820 Set_Full_View
(Prev
, Id
);
12821 Set_Etype
(Id
, Any_Type
);
12823 -- If so, process the full constant declaration
12826 -- RM 7.4 (6): If the subtype defined by the subtype_indication in
12827 -- the deferred declaration is constrained, then the subtype defined
12828 -- by the subtype_indication in the full declaration shall match it
12831 Check_Possible_Deferred_Completion
12833 Prev_Obj_Def
=> Object_Definition
(Parent
(Prev
)),
12834 Curr_Obj_Def
=> Obj_Def
);
12836 Set_Full_View
(Prev
, Id
);
12837 Set_Is_Public
(Id
, Is_Public
(Prev
));
12838 Set_Is_Internal
(Id
);
12839 Append_Entity
(Id
, Current_Scope
);
12841 -- Check ALIASED present if present before (RM 7.4(7))
12843 if Is_Aliased
(Prev
)
12844 and then not Aliased_Present
(N
)
12846 Error_Msg_Sloc
:= Sloc
(Prev
);
12847 Error_Msg_N
("ALIASED required (see declaration #)", N
);
12850 -- Check that placement is in private part and that the incomplete
12851 -- declaration appeared in the visible part.
12853 if Ekind
(Current_Scope
) = E_Package
12854 and then not In_Private_Part
(Current_Scope
)
12856 Error_Msg_Sloc
:= Sloc
(Prev
);
12858 ("full constant for declaration # must be in private part", N
);
12860 elsif Ekind
(Current_Scope
) = E_Package
12862 List_Containing
(Parent
(Prev
)) /=
12863 Visible_Declarations
(Package_Specification
(Current_Scope
))
12866 ("deferred constant must be declared in visible part",
12870 if Is_Access_Type
(T
)
12871 and then Nkind
(Expression
(N
)) = N_Allocator
12873 Check_Recursive_Declaration
(Designated_Type
(T
));
12876 -- A deferred constant is a visible entity. If type has invariants,
12877 -- verify that the initial value satisfies them. This is not done in
12878 -- GNATprove mode, as GNATprove handles invariant checks itself.
12880 if Has_Invariants
(T
)
12881 and then Present
(Invariant_Procedure
(T
))
12882 and then not GNATprove_Mode
12885 Make_Invariant_Call
(New_Occurrence_Of
(Prev
, Sloc
(N
))));
12888 end Constant_Redeclaration
;
12890 ----------------------
12891 -- Constrain_Access --
12892 ----------------------
12894 procedure Constrain_Access
12895 (Def_Id
: in out Entity_Id
;
12897 Related_Nod
: Node_Id
)
12899 T
: constant Entity_Id
:= Entity
(Subtype_Mark
(S
));
12900 Desig_Type
: constant Entity_Id
:= Designated_Type
(T
);
12901 Desig_Subtype
: Entity_Id
:= Create_Itype
(E_Void
, Related_Nod
);
12902 Constraint_OK
: Boolean := True;
12905 if Is_Array_Type
(Desig_Type
) then
12906 Constrain_Array
(Desig_Subtype
, S
, Related_Nod
, Def_Id
, 'P');
12908 elsif (Is_Record_Type
(Desig_Type
)
12909 or else Is_Incomplete_Or_Private_Type
(Desig_Type
))
12910 and then not Is_Constrained
(Desig_Type
)
12912 -- ??? The following code is a temporary bypass to ignore a
12913 -- discriminant constraint on access type if it is constraining
12914 -- the current record. Avoid creating the implicit subtype of the
12915 -- record we are currently compiling since right now, we cannot
12916 -- handle these. For now, just return the access type itself.
12918 if Desig_Type
= Current_Scope
12919 and then No
(Def_Id
)
12921 Set_Ekind
(Desig_Subtype
, E_Record_Subtype
);
12922 Def_Id
:= Entity
(Subtype_Mark
(S
));
12924 -- This call added to ensure that the constraint is analyzed
12925 -- (needed for a B test). Note that we still return early from
12926 -- this procedure to avoid recursive processing. ???
12928 Constrain_Discriminated_Type
12929 (Desig_Subtype
, S
, Related_Nod
, For_Access
=> True);
12933 -- Enforce rule that the constraint is illegal if there is an
12934 -- unconstrained view of the designated type. This means that the
12935 -- partial view (either a private type declaration or a derivation
12936 -- from a private type) has no discriminants. (Defect Report
12937 -- 8652/0008, Technical Corrigendum 1, checked by ACATS B371001).
12939 -- Rule updated for Ada 2005: The private type is said to have
12940 -- a constrained partial view, given that objects of the type
12941 -- can be declared. Furthermore, the rule applies to all access
12942 -- types, unlike the rule concerning default discriminants (see
12945 if (Ekind
(T
) = E_General_Access_Type
or else Ada_Version
>= Ada_2005
)
12946 and then Has_Private_Declaration
(Desig_Type
)
12947 and then In_Open_Scopes
(Scope
(Desig_Type
))
12948 and then Has_Discriminants
(Desig_Type
)
12951 Pack
: constant Node_Id
:=
12952 Unit_Declaration_Node
(Scope
(Desig_Type
));
12957 if Nkind
(Pack
) = N_Package_Declaration
then
12958 Decls
:= Visible_Declarations
(Specification
(Pack
));
12959 Decl
:= First
(Decls
);
12960 while Present
(Decl
) loop
12961 if (Nkind
(Decl
) = N_Private_Type_Declaration
12962 and then Chars
(Defining_Identifier
(Decl
)) =
12963 Chars
(Desig_Type
))
12966 (Nkind
(Decl
) = N_Full_Type_Declaration
12968 Chars
(Defining_Identifier
(Decl
)) =
12970 and then Is_Derived_Type
(Desig_Type
)
12972 Has_Private_Declaration
(Etype
(Desig_Type
)))
12974 if No
(Discriminant_Specifications
(Decl
)) then
12976 ("cannot constrain access type if designated "
12977 & "type has constrained partial view", S
);
12989 Constrain_Discriminated_Type
(Desig_Subtype
, S
, Related_Nod
,
12990 For_Access
=> True);
12992 elsif Is_Concurrent_Type
(Desig_Type
)
12993 and then not Is_Constrained
(Desig_Type
)
12995 Constrain_Concurrent
(Desig_Subtype
, S
, Related_Nod
, Desig_Type
, ' ');
12998 Error_Msg_N
("invalid constraint on access type", S
);
13000 -- We simply ignore an invalid constraint
13002 Desig_Subtype
:= Desig_Type
;
13003 Constraint_OK
:= False;
13006 if No
(Def_Id
) then
13007 Def_Id
:= Create_Itype
(E_Access_Subtype
, Related_Nod
);
13009 Set_Ekind
(Def_Id
, E_Access_Subtype
);
13012 if Constraint_OK
then
13013 Set_Etype
(Def_Id
, Base_Type
(T
));
13015 if Is_Private_Type
(Desig_Type
) then
13016 Prepare_Private_Subtype_Completion
(Desig_Subtype
, Related_Nod
);
13019 Set_Etype
(Def_Id
, Any_Type
);
13022 Set_Size_Info
(Def_Id
, T
);
13023 Set_Is_Constrained
(Def_Id
, Constraint_OK
);
13024 Set_Directly_Designated_Type
(Def_Id
, Desig_Subtype
);
13025 Set_Depends_On_Private
(Def_Id
, Has_Private_Component
(Def_Id
));
13026 Set_Is_Access_Constant
(Def_Id
, Is_Access_Constant
(T
));
13028 Conditional_Delay
(Def_Id
, T
);
13030 -- AI-363 : Subtypes of general access types whose designated types have
13031 -- default discriminants are disallowed. In instances, the rule has to
13032 -- be checked against the actual, of which T is the subtype. In a
13033 -- generic body, the rule is checked assuming that the actual type has
13034 -- defaulted discriminants.
13036 if Ada_Version
>= Ada_2005
or else Warn_On_Ada_2005_Compatibility
then
13037 if Ekind
(Base_Type
(T
)) = E_General_Access_Type
13038 and then Has_Defaulted_Discriminants
(Desig_Type
)
13040 if Ada_Version
< Ada_2005
then
13042 ("access subtype of general access type would not " &
13043 "be allowed in Ada 2005?y?", S
);
13046 ("access subtype of general access type not allowed", S
);
13049 Error_Msg_N
("\discriminants have defaults", S
);
13051 elsif Is_Access_Type
(T
)
13052 and then Is_Generic_Type
(Desig_Type
)
13053 and then Has_Discriminants
(Desig_Type
)
13054 and then In_Package_Body
(Current_Scope
)
13056 if Ada_Version
< Ada_2005
then
13058 ("access subtype would not be allowed in generic body "
13059 & "in Ada 2005?y?", S
);
13062 ("access subtype not allowed in generic body", S
);
13066 ("\designated type is a discriminated formal", S
);
13069 end Constrain_Access
;
13071 ---------------------
13072 -- Constrain_Array --
13073 ---------------------
13075 procedure Constrain_Array
13076 (Def_Id
: in out Entity_Id
;
13078 Related_Nod
: Node_Id
;
13079 Related_Id
: Entity_Id
;
13080 Suffix
: Character)
13082 C
: constant Node_Id
:= Constraint
(SI
);
13083 Number_Of_Constraints
: Nat
:= 0;
13086 Constraint_OK
: Boolean := True;
13089 T
:= Entity
(Subtype_Mark
(SI
));
13091 if Is_Access_Type
(T
) then
13092 T
:= Designated_Type
(T
);
13095 -- If an index constraint follows a subtype mark in a subtype indication
13096 -- then the type or subtype denoted by the subtype mark must not already
13097 -- impose an index constraint. The subtype mark must denote either an
13098 -- unconstrained array type or an access type whose designated type
13099 -- is such an array type... (RM 3.6.1)
13101 if Is_Constrained
(T
) then
13102 Error_Msg_N
("array type is already constrained", Subtype_Mark
(SI
));
13103 Constraint_OK
:= False;
13106 S
:= First
(Constraints
(C
));
13107 while Present
(S
) loop
13108 Number_Of_Constraints
:= Number_Of_Constraints
+ 1;
13112 -- In either case, the index constraint must provide a discrete
13113 -- range for each index of the array type and the type of each
13114 -- discrete range must be the same as that of the corresponding
13115 -- index. (RM 3.6.1)
13117 if Number_Of_Constraints
/= Number_Dimensions
(T
) then
13118 Error_Msg_NE
("incorrect number of index constraints for }", C
, T
);
13119 Constraint_OK
:= False;
13122 S
:= First
(Constraints
(C
));
13123 Index
:= First_Index
(T
);
13126 -- Apply constraints to each index type
13128 for J
in 1 .. Number_Of_Constraints
loop
13129 Constrain_Index
(Index
, S
, Related_Nod
, Related_Id
, Suffix
, J
);
13137 if No
(Def_Id
) then
13139 Create_Itype
(E_Array_Subtype
, Related_Nod
, Related_Id
, Suffix
);
13140 Set_Parent
(Def_Id
, Related_Nod
);
13143 Set_Ekind
(Def_Id
, E_Array_Subtype
);
13146 Set_Size_Info
(Def_Id
, (T
));
13147 Set_First_Rep_Item
(Def_Id
, First_Rep_Item
(T
));
13148 Set_Etype
(Def_Id
, Base_Type
(T
));
13150 if Constraint_OK
then
13151 Set_First_Index
(Def_Id
, First
(Constraints
(C
)));
13153 Set_First_Index
(Def_Id
, First_Index
(T
));
13156 Set_Is_Constrained
(Def_Id
, True);
13157 Set_Is_Aliased
(Def_Id
, Is_Aliased
(T
));
13158 Set_Depends_On_Private
(Def_Id
, Has_Private_Component
(Def_Id
));
13160 Set_Is_Private_Composite
(Def_Id
, Is_Private_Composite
(T
));
13161 Set_Is_Limited_Composite
(Def_Id
, Is_Limited_Composite
(T
));
13163 -- A subtype does not inherit the Packed_Array_Impl_Type of is parent.
13164 -- We need to initialize the attribute because if Def_Id is previously
13165 -- analyzed through a limited_with clause, it will have the attributes
13166 -- of an incomplete type, one of which is an Elist that overlaps the
13167 -- Packed_Array_Impl_Type field.
13169 Set_Packed_Array_Impl_Type
(Def_Id
, Empty
);
13171 -- Build a freeze node if parent still needs one. Also make sure that
13172 -- the Depends_On_Private status is set because the subtype will need
13173 -- reprocessing at the time the base type does, and also we must set a
13174 -- conditional delay.
13176 Set_Depends_On_Private
(Def_Id
, Depends_On_Private
(T
));
13177 Conditional_Delay
(Def_Id
, T
);
13178 end Constrain_Array
;
13180 ------------------------------
13181 -- Constrain_Component_Type --
13182 ------------------------------
13184 function Constrain_Component_Type
13186 Constrained_Typ
: Entity_Id
;
13187 Related_Node
: Node_Id
;
13189 Constraints
: Elist_Id
) return Entity_Id
13191 Loc
: constant Source_Ptr
:= Sloc
(Constrained_Typ
);
13192 Compon_Type
: constant Entity_Id
:= Etype
(Comp
);
13194 function Build_Constrained_Array_Type
13195 (Old_Type
: Entity_Id
) return Entity_Id
;
13196 -- If Old_Type is an array type, one of whose indexes is constrained
13197 -- by a discriminant, build an Itype whose constraint replaces the
13198 -- discriminant with its value in the constraint.
13200 function Build_Constrained_Discriminated_Type
13201 (Old_Type
: Entity_Id
) return Entity_Id
;
13202 -- Ditto for record components
13204 function Build_Constrained_Access_Type
13205 (Old_Type
: Entity_Id
) return Entity_Id
;
13206 -- Ditto for access types. Makes use of previous two functions, to
13207 -- constrain designated type.
13209 function Build_Subtype
(T
: Entity_Id
; C
: List_Id
) return Entity_Id
;
13210 -- T is an array or discriminated type, C is a list of constraints
13211 -- that apply to T. This routine builds the constrained subtype.
13213 function Is_Discriminant
(Expr
: Node_Id
) return Boolean;
13214 -- Returns True if Expr is a discriminant
13216 function Get_Discr_Value
(Discrim
: Entity_Id
) return Node_Id
;
13217 -- Find the value of discriminant Discrim in Constraint
13219 -----------------------------------
13220 -- Build_Constrained_Access_Type --
13221 -----------------------------------
13223 function Build_Constrained_Access_Type
13224 (Old_Type
: Entity_Id
) return Entity_Id
13226 Desig_Type
: constant Entity_Id
:= Designated_Type
(Old_Type
);
13228 Desig_Subtype
: Entity_Id
;
13232 -- if the original access type was not embedded in the enclosing
13233 -- type definition, there is no need to produce a new access
13234 -- subtype. In fact every access type with an explicit constraint
13235 -- generates an itype whose scope is the enclosing record.
13237 if not Is_Type
(Scope
(Old_Type
)) then
13240 elsif Is_Array_Type
(Desig_Type
) then
13241 Desig_Subtype
:= Build_Constrained_Array_Type
(Desig_Type
);
13243 elsif Has_Discriminants
(Desig_Type
) then
13245 -- This may be an access type to an enclosing record type for
13246 -- which we are constructing the constrained components. Return
13247 -- the enclosing record subtype. This is not always correct,
13248 -- but avoids infinite recursion. ???
13250 Desig_Subtype
:= Any_Type
;
13252 for J
in reverse 0 .. Scope_Stack
.Last
loop
13253 Scop
:= Scope_Stack
.Table
(J
).Entity
;
13256 and then Base_Type
(Scop
) = Base_Type
(Desig_Type
)
13258 Desig_Subtype
:= Scop
;
13261 exit when not Is_Type
(Scop
);
13264 if Desig_Subtype
= Any_Type
then
13266 Build_Constrained_Discriminated_Type
(Desig_Type
);
13273 if Desig_Subtype
/= Desig_Type
then
13275 -- The Related_Node better be here or else we won't be able
13276 -- to attach new itypes to a node in the tree.
13278 pragma Assert
(Present
(Related_Node
));
13280 Itype
:= Create_Itype
(E_Access_Subtype
, Related_Node
);
13282 Set_Etype
(Itype
, Base_Type
(Old_Type
));
13283 Set_Size_Info
(Itype
, (Old_Type
));
13284 Set_Directly_Designated_Type
(Itype
, Desig_Subtype
);
13285 Set_Depends_On_Private
(Itype
, Has_Private_Component
13287 Set_Is_Access_Constant
(Itype
, Is_Access_Constant
13290 -- The new itype needs freezing when it depends on a not frozen
13291 -- type and the enclosing subtype needs freezing.
13293 if Has_Delayed_Freeze
(Constrained_Typ
)
13294 and then not Is_Frozen
(Constrained_Typ
)
13296 Conditional_Delay
(Itype
, Base_Type
(Old_Type
));
13304 end Build_Constrained_Access_Type
;
13306 ----------------------------------
13307 -- Build_Constrained_Array_Type --
13308 ----------------------------------
13310 function Build_Constrained_Array_Type
13311 (Old_Type
: Entity_Id
) return Entity_Id
13315 Old_Index
: Node_Id
;
13316 Range_Node
: Node_Id
;
13317 Constr_List
: List_Id
;
13319 Need_To_Create_Itype
: Boolean := False;
13322 Old_Index
:= First_Index
(Old_Type
);
13323 while Present
(Old_Index
) loop
13324 Get_Index_Bounds
(Old_Index
, Lo_Expr
, Hi_Expr
);
13326 if Is_Discriminant
(Lo_Expr
)
13328 Is_Discriminant
(Hi_Expr
)
13330 Need_To_Create_Itype
:= True;
13333 Next_Index
(Old_Index
);
13336 if Need_To_Create_Itype
then
13337 Constr_List
:= New_List
;
13339 Old_Index
:= First_Index
(Old_Type
);
13340 while Present
(Old_Index
) loop
13341 Get_Index_Bounds
(Old_Index
, Lo_Expr
, Hi_Expr
);
13343 if Is_Discriminant
(Lo_Expr
) then
13344 Lo_Expr
:= Get_Discr_Value
(Lo_Expr
);
13347 if Is_Discriminant
(Hi_Expr
) then
13348 Hi_Expr
:= Get_Discr_Value
(Hi_Expr
);
13353 (Loc
, New_Copy_Tree
(Lo_Expr
), New_Copy_Tree
(Hi_Expr
));
13355 Append
(Range_Node
, To
=> Constr_List
);
13357 Next_Index
(Old_Index
);
13360 return Build_Subtype
(Old_Type
, Constr_List
);
13365 end Build_Constrained_Array_Type
;
13367 ------------------------------------------
13368 -- Build_Constrained_Discriminated_Type --
13369 ------------------------------------------
13371 function Build_Constrained_Discriminated_Type
13372 (Old_Type
: Entity_Id
) return Entity_Id
13375 Constr_List
: List_Id
;
13376 Old_Constraint
: Elmt_Id
;
13378 Need_To_Create_Itype
: Boolean := False;
13381 Old_Constraint
:= First_Elmt
(Discriminant_Constraint
(Old_Type
));
13382 while Present
(Old_Constraint
) loop
13383 Expr
:= Node
(Old_Constraint
);
13385 if Is_Discriminant
(Expr
) then
13386 Need_To_Create_Itype
:= True;
13389 Next_Elmt
(Old_Constraint
);
13392 if Need_To_Create_Itype
then
13393 Constr_List
:= New_List
;
13395 Old_Constraint
:= First_Elmt
(Discriminant_Constraint
(Old_Type
));
13396 while Present
(Old_Constraint
) loop
13397 Expr
:= Node
(Old_Constraint
);
13399 if Is_Discriminant
(Expr
) then
13400 Expr
:= Get_Discr_Value
(Expr
);
13403 Append
(New_Copy_Tree
(Expr
), To
=> Constr_List
);
13405 Next_Elmt
(Old_Constraint
);
13408 return Build_Subtype
(Old_Type
, Constr_List
);
13413 end Build_Constrained_Discriminated_Type
;
13415 -------------------
13416 -- Build_Subtype --
13417 -------------------
13419 function Build_Subtype
(T
: Entity_Id
; C
: List_Id
) return Entity_Id
is
13421 Subtyp_Decl
: Node_Id
;
13422 Def_Id
: Entity_Id
;
13423 Btyp
: Entity_Id
:= Base_Type
(T
);
13426 -- The Related_Node better be here or else we won't be able to
13427 -- attach new itypes to a node in the tree.
13429 pragma Assert
(Present
(Related_Node
));
13431 -- If the view of the component's type is incomplete or private
13432 -- with unknown discriminants, then the constraint must be applied
13433 -- to the full type.
13435 if Has_Unknown_Discriminants
(Btyp
)
13436 and then Present
(Underlying_Type
(Btyp
))
13438 Btyp
:= Underlying_Type
(Btyp
);
13442 Make_Subtype_Indication
(Loc
,
13443 Subtype_Mark
=> New_Occurrence_Of
(Btyp
, Loc
),
13444 Constraint
=> Make_Index_Or_Discriminant_Constraint
(Loc
, C
));
13446 Def_Id
:= Create_Itype
(Ekind
(T
), Related_Node
);
13449 Make_Subtype_Declaration
(Loc
,
13450 Defining_Identifier
=> Def_Id
,
13451 Subtype_Indication
=> Indic
);
13453 Set_Parent
(Subtyp_Decl
, Parent
(Related_Node
));
13455 -- Itypes must be analyzed with checks off (see package Itypes)
13457 Analyze
(Subtyp_Decl
, Suppress
=> All_Checks
);
13459 if Is_Itype
(Def_Id
) and then Has_Predicates
(T
) then
13460 Inherit_Predicate_Flags
(Def_Id
, T
);
13462 -- Indicate where the predicate function may be found
13464 if Is_Itype
(T
) then
13465 if Present
(Predicate_Function
(Def_Id
)) then
13468 elsif Present
(Predicate_Function
(T
)) then
13469 Set_Predicate_Function
(Def_Id
, Predicate_Function
(T
));
13472 Set_Predicated_Parent
(Def_Id
, Predicated_Parent
(T
));
13475 elsif No
(Predicate_Function
(Def_Id
)) then
13476 Set_Predicated_Parent
(Def_Id
, T
);
13483 ---------------------
13484 -- Get_Discr_Value --
13485 ---------------------
13487 function Get_Discr_Value
(Discrim
: Entity_Id
) return Node_Id
is
13492 -- The discriminant may be declared for the type, in which case we
13493 -- find it by iterating over the list of discriminants. If the
13494 -- discriminant is inherited from a parent type, it appears as the
13495 -- corresponding discriminant of the current type. This will be the
13496 -- case when constraining an inherited component whose constraint is
13497 -- given by a discriminant of the parent.
13499 D
:= First_Discriminant
(Typ
);
13500 E
:= First_Elmt
(Constraints
);
13502 while Present
(D
) loop
13503 if D
= Entity
(Discrim
)
13504 or else D
= CR_Discriminant
(Entity
(Discrim
))
13505 or else Corresponding_Discriminant
(D
) = Entity
(Discrim
)
13510 Next_Discriminant
(D
);
13514 -- The Corresponding_Discriminant mechanism is incomplete, because
13515 -- the correspondence between new and old discriminants is not one
13516 -- to one: one new discriminant can constrain several old ones. In
13517 -- that case, scan sequentially the stored_constraint, the list of
13518 -- discriminants of the parents, and the constraints.
13520 -- Previous code checked for the present of the Stored_Constraint
13521 -- list for the derived type, but did not use it at all. Should it
13522 -- be present when the component is a discriminated task type?
13524 if Is_Derived_Type
(Typ
)
13525 and then Scope
(Entity
(Discrim
)) = Etype
(Typ
)
13527 D
:= First_Discriminant
(Etype
(Typ
));
13528 E
:= First_Elmt
(Constraints
);
13529 while Present
(D
) loop
13530 if D
= Entity
(Discrim
) then
13534 Next_Discriminant
(D
);
13539 -- Something is wrong if we did not find the value
13541 raise Program_Error
;
13542 end Get_Discr_Value
;
13544 ---------------------
13545 -- Is_Discriminant --
13546 ---------------------
13548 function Is_Discriminant
(Expr
: Node_Id
) return Boolean is
13549 Discrim_Scope
: Entity_Id
;
13552 if Denotes_Discriminant
(Expr
) then
13553 Discrim_Scope
:= Scope
(Entity
(Expr
));
13555 -- Either we have a reference to one of Typ's discriminants,
13557 pragma Assert
(Discrim_Scope
= Typ
13559 -- or to the discriminants of the parent type, in the case
13560 -- of a derivation of a tagged type with variants.
13562 or else Discrim_Scope
= Etype
(Typ
)
13563 or else Full_View
(Discrim_Scope
) = Etype
(Typ
)
13565 -- or same as above for the case where the discriminants
13566 -- were declared in Typ's private view.
13568 or else (Is_Private_Type
(Discrim_Scope
)
13569 and then Chars
(Discrim_Scope
) = Chars
(Typ
))
13571 -- or else we are deriving from the full view and the
13572 -- discriminant is declared in the private entity.
13574 or else (Is_Private_Type
(Typ
)
13575 and then Chars
(Discrim_Scope
) = Chars
(Typ
))
13577 -- Or we are constrained the corresponding record of a
13578 -- synchronized type that completes a private declaration.
13580 or else (Is_Concurrent_Record_Type
(Typ
)
13582 Corresponding_Concurrent_Type
(Typ
) = Discrim_Scope
)
13584 -- or we have a class-wide type, in which case make sure the
13585 -- discriminant found belongs to the root type.
13587 or else (Is_Class_Wide_Type
(Typ
)
13588 and then Etype
(Typ
) = Discrim_Scope
));
13593 -- In all other cases we have something wrong
13596 end Is_Discriminant
;
13598 -- Start of processing for Constrain_Component_Type
13601 if Nkind
(Parent
(Comp
)) = N_Component_Declaration
13602 and then Comes_From_Source
(Parent
(Comp
))
13603 and then Comes_From_Source
13604 (Subtype_Indication
(Component_Definition
(Parent
(Comp
))))
13607 (Subtype_Indication
(Component_Definition
(Parent
(Comp
))))
13609 return Compon_Type
;
13611 elsif Is_Array_Type
(Compon_Type
) then
13612 return Build_Constrained_Array_Type
(Compon_Type
);
13614 elsif Has_Discriminants
(Compon_Type
) then
13615 return Build_Constrained_Discriminated_Type
(Compon_Type
);
13617 elsif Is_Access_Type
(Compon_Type
) then
13618 return Build_Constrained_Access_Type
(Compon_Type
);
13621 return Compon_Type
;
13623 end Constrain_Component_Type
;
13625 --------------------------
13626 -- Constrain_Concurrent --
13627 --------------------------
13629 -- For concurrent types, the associated record value type carries the same
13630 -- discriminants, so when we constrain a concurrent type, we must constrain
13631 -- the corresponding record type as well.
13633 procedure Constrain_Concurrent
13634 (Def_Id
: in out Entity_Id
;
13636 Related_Nod
: Node_Id
;
13637 Related_Id
: Entity_Id
;
13638 Suffix
: Character)
13640 -- Retrieve Base_Type to ensure getting to the concurrent type in the
13641 -- case of a private subtype (needed when only doing semantic analysis).
13643 T_Ent
: Entity_Id
:= Base_Type
(Entity
(Subtype_Mark
(SI
)));
13647 if Is_Access_Type
(T_Ent
) then
13648 T_Ent
:= Designated_Type
(T_Ent
);
13651 T_Val
:= Corresponding_Record_Type
(T_Ent
);
13653 if Present
(T_Val
) then
13655 if No
(Def_Id
) then
13656 Def_Id
:= Create_Itype
(E_Void
, Related_Nod
, Related_Id
, Suffix
);
13658 -- Elaborate itype now, as it may be used in a subsequent
13659 -- synchronized operation in another scope.
13661 if Nkind
(Related_Nod
) = N_Full_Type_Declaration
then
13662 Build_Itype_Reference
(Def_Id
, Related_Nod
);
13666 Constrain_Discriminated_Type
(Def_Id
, SI
, Related_Nod
);
13667 Set_First_Private_Entity
(Def_Id
, First_Private_Entity
(T_Ent
));
13669 Set_Depends_On_Private
(Def_Id
, Has_Private_Component
(Def_Id
));
13670 Set_Corresponding_Record_Type
(Def_Id
,
13671 Constrain_Corresponding_Record
(Def_Id
, T_Val
, Related_Nod
));
13674 -- If there is no associated record, expansion is disabled and this
13675 -- is a generic context. Create a subtype in any case, so that
13676 -- semantic analysis can proceed.
13678 if No
(Def_Id
) then
13679 Def_Id
:= Create_Itype
(E_Void
, Related_Nod
, Related_Id
, Suffix
);
13682 Constrain_Discriminated_Type
(Def_Id
, SI
, Related_Nod
);
13684 end Constrain_Concurrent
;
13686 ------------------------------------
13687 -- Constrain_Corresponding_Record --
13688 ------------------------------------
13690 function Constrain_Corresponding_Record
13691 (Prot_Subt
: Entity_Id
;
13692 Corr_Rec
: Entity_Id
;
13693 Related_Nod
: Node_Id
) return Entity_Id
13695 T_Sub
: constant Entity_Id
:=
13697 (Ekind
=> E_Record_Subtype
,
13698 Related_Nod
=> Related_Nod
,
13699 Related_Id
=> Corr_Rec
,
13701 Suffix_Index
=> -1);
13704 Set_Etype
(T_Sub
, Corr_Rec
);
13705 Set_Has_Discriminants
(T_Sub
, Has_Discriminants
(Prot_Subt
));
13706 Set_Is_Constrained
(T_Sub
, True);
13707 Set_First_Entity
(T_Sub
, First_Entity
(Corr_Rec
));
13708 Set_Last_Entity
(T_Sub
, Last_Entity
(Corr_Rec
));
13710 if Has_Discriminants
(Prot_Subt
) then -- False only if errors.
13711 Set_Discriminant_Constraint
13712 (T_Sub
, Discriminant_Constraint
(Prot_Subt
));
13713 Set_Stored_Constraint_From_Discriminant_Constraint
(T_Sub
);
13714 Create_Constrained_Components
13715 (T_Sub
, Related_Nod
, Corr_Rec
, Discriminant_Constraint
(T_Sub
));
13718 Set_Depends_On_Private
(T_Sub
, Has_Private_Component
(T_Sub
));
13720 if Ekind
(Scope
(Prot_Subt
)) /= E_Record_Type
then
13721 Conditional_Delay
(T_Sub
, Corr_Rec
);
13724 -- This is a component subtype: it will be frozen in the context of
13725 -- the enclosing record's init_proc, so that discriminant references
13726 -- are resolved to discriminals. (Note: we used to skip freezing
13727 -- altogether in that case, which caused errors downstream for
13728 -- components of a bit packed array type).
13730 Set_Has_Delayed_Freeze
(T_Sub
);
13734 end Constrain_Corresponding_Record
;
13736 -----------------------
13737 -- Constrain_Decimal --
13738 -----------------------
13740 procedure Constrain_Decimal
(Def_Id
: Node_Id
; S
: Node_Id
) is
13741 T
: constant Entity_Id
:= Entity
(Subtype_Mark
(S
));
13742 C
: constant Node_Id
:= Constraint
(S
);
13743 Loc
: constant Source_Ptr
:= Sloc
(C
);
13744 Range_Expr
: Node_Id
;
13745 Digits_Expr
: Node_Id
;
13750 Set_Ekind
(Def_Id
, E_Decimal_Fixed_Point_Subtype
);
13752 if Nkind
(C
) = N_Range_Constraint
then
13753 Range_Expr
:= Range_Expression
(C
);
13754 Digits_Val
:= Digits_Value
(T
);
13757 pragma Assert
(Nkind
(C
) = N_Digits_Constraint
);
13759 Check_SPARK_05_Restriction
("digits constraint is not allowed", S
);
13761 Digits_Expr
:= Digits_Expression
(C
);
13762 Analyze_And_Resolve
(Digits_Expr
, Any_Integer
);
13764 Check_Digits_Expression
(Digits_Expr
);
13765 Digits_Val
:= Expr_Value
(Digits_Expr
);
13767 if Digits_Val
> Digits_Value
(T
) then
13769 ("digits expression is incompatible with subtype", C
);
13770 Digits_Val
:= Digits_Value
(T
);
13773 if Present
(Range_Constraint
(C
)) then
13774 Range_Expr
:= Range_Expression
(Range_Constraint
(C
));
13776 Range_Expr
:= Empty
;
13780 Set_Etype
(Def_Id
, Base_Type
(T
));
13781 Set_Size_Info
(Def_Id
, (T
));
13782 Set_First_Rep_Item
(Def_Id
, First_Rep_Item
(T
));
13783 Set_Delta_Value
(Def_Id
, Delta_Value
(T
));
13784 Set_Scale_Value
(Def_Id
, Scale_Value
(T
));
13785 Set_Small_Value
(Def_Id
, Small_Value
(T
));
13786 Set_Machine_Radix_10
(Def_Id
, Machine_Radix_10
(T
));
13787 Set_Digits_Value
(Def_Id
, Digits_Val
);
13789 -- Manufacture range from given digits value if no range present
13791 if No
(Range_Expr
) then
13792 Bound_Val
:= (Ureal_10
** Digits_Val
- Ureal_1
) * Small_Value
(T
);
13796 Convert_To
(T
, Make_Real_Literal
(Loc
, (-Bound_Val
))),
13798 Convert_To
(T
, Make_Real_Literal
(Loc
, Bound_Val
)));
13801 Set_Scalar_Range_For_Subtype
(Def_Id
, Range_Expr
, T
);
13802 Set_Discrete_RM_Size
(Def_Id
);
13804 -- Unconditionally delay the freeze, since we cannot set size
13805 -- information in all cases correctly until the freeze point.
13807 Set_Has_Delayed_Freeze
(Def_Id
);
13808 end Constrain_Decimal
;
13810 ----------------------------------
13811 -- Constrain_Discriminated_Type --
13812 ----------------------------------
13814 procedure Constrain_Discriminated_Type
13815 (Def_Id
: Entity_Id
;
13817 Related_Nod
: Node_Id
;
13818 For_Access
: Boolean := False)
13820 E
: Entity_Id
:= Entity
(Subtype_Mark
(S
));
13823 procedure Fixup_Bad_Constraint
;
13824 -- Called after finding a bad constraint, and after having posted an
13825 -- appropriate error message. The goal is to leave type Def_Id in as
13826 -- reasonable state as possible.
13828 --------------------------
13829 -- Fixup_Bad_Constraint --
13830 --------------------------
13832 procedure Fixup_Bad_Constraint
is
13834 -- Set a reasonable Ekind for the entity, including incomplete types.
13836 Set_Ekind
(Def_Id
, Subtype_Kind
(Ekind
(T
)));
13838 -- Set Etype to the known type, to reduce chances of cascaded errors
13840 Set_Etype
(Def_Id
, E
);
13841 Set_Error_Posted
(Def_Id
);
13842 end Fixup_Bad_Constraint
;
13847 Constr
: Elist_Id
:= New_Elmt_List
;
13849 -- Start of processing for Constrain_Discriminated_Type
13852 C
:= Constraint
(S
);
13854 -- A discriminant constraint is only allowed in a subtype indication,
13855 -- after a subtype mark. This subtype mark must denote either a type
13856 -- with discriminants, or an access type whose designated type is a
13857 -- type with discriminants. A discriminant constraint specifies the
13858 -- values of these discriminants (RM 3.7.2(5)).
13860 T
:= Base_Type
(Entity
(Subtype_Mark
(S
)));
13862 if Is_Access_Type
(T
) then
13863 T
:= Designated_Type
(T
);
13866 -- In an instance it may be necessary to retrieve the full view of a
13867 -- type with unknown discriminants, or a full view with defaulted
13868 -- discriminants. In other contexts the constraint is illegal.
13871 and then Is_Private_Type
(T
)
13872 and then Present
(Full_View
(T
))
13874 (Has_Unknown_Discriminants
(T
)
13876 (not Has_Discriminants
(T
)
13877 and then Has_Discriminants
(Full_View
(T
))
13878 and then Present
(Discriminant_Default_Value
13879 (First_Discriminant
(Full_View
(T
))))))
13881 T
:= Full_View
(T
);
13882 E
:= Full_View
(E
);
13885 -- Ada 2005 (AI-412): Constrained incomplete subtypes are illegal. Avoid
13886 -- generating an error for access-to-incomplete subtypes.
13888 if Ada_Version
>= Ada_2005
13889 and then Ekind
(T
) = E_Incomplete_Type
13890 and then Nkind
(Parent
(S
)) = N_Subtype_Declaration
13891 and then not Is_Itype
(Def_Id
)
13893 -- A little sanity check: emit an error message if the type has
13894 -- discriminants to begin with. Type T may be a regular incomplete
13895 -- type or imported via a limited with clause.
13897 if Has_Discriminants
(T
)
13898 or else (From_Limited_With
(T
)
13899 and then Present
(Non_Limited_View
(T
))
13900 and then Nkind
(Parent
(Non_Limited_View
(T
))) =
13901 N_Full_Type_Declaration
13902 and then Present
(Discriminant_Specifications
13903 (Parent
(Non_Limited_View
(T
)))))
13906 ("(Ada 2005) incomplete subtype may not be constrained", C
);
13908 Error_Msg_N
("invalid constraint: type has no discriminant", C
);
13911 Fixup_Bad_Constraint
;
13914 -- Check that the type has visible discriminants. The type may be
13915 -- a private type with unknown discriminants whose full view has
13916 -- discriminants which are invisible.
13918 elsif not Has_Discriminants
(T
)
13920 (Has_Unknown_Discriminants
(T
)
13921 and then Is_Private_Type
(T
))
13923 Error_Msg_N
("invalid constraint: type has no discriminant", C
);
13924 Fixup_Bad_Constraint
;
13927 elsif Is_Constrained
(E
)
13928 or else (Ekind
(E
) = E_Class_Wide_Subtype
13929 and then Present
(Discriminant_Constraint
(E
)))
13931 Error_Msg_N
("type is already constrained", Subtype_Mark
(S
));
13932 Fixup_Bad_Constraint
;
13936 -- T may be an unconstrained subtype (e.g. a generic actual). Constraint
13937 -- applies to the base type.
13939 T
:= Base_Type
(T
);
13941 Constr
:= Build_Discriminant_Constraints
(T
, S
);
13943 -- If the list returned was empty we had an error in building the
13944 -- discriminant constraint. We have also already signalled an error
13945 -- in the incomplete type case
13947 if Is_Empty_Elmt_List
(Constr
) then
13948 Fixup_Bad_Constraint
;
13952 Build_Discriminated_Subtype
(T
, Def_Id
, Constr
, Related_Nod
, For_Access
);
13953 end Constrain_Discriminated_Type
;
13955 ---------------------------
13956 -- Constrain_Enumeration --
13957 ---------------------------
13959 procedure Constrain_Enumeration
(Def_Id
: Node_Id
; S
: Node_Id
) is
13960 T
: constant Entity_Id
:= Entity
(Subtype_Mark
(S
));
13961 C
: constant Node_Id
:= Constraint
(S
);
13964 Set_Ekind
(Def_Id
, E_Enumeration_Subtype
);
13966 Set_First_Literal
(Def_Id
, First_Literal
(Base_Type
(T
)));
13968 Set_Etype
(Def_Id
, Base_Type
(T
));
13969 Set_Size_Info
(Def_Id
, (T
));
13970 Set_First_Rep_Item
(Def_Id
, First_Rep_Item
(T
));
13971 Set_Is_Character_Type
(Def_Id
, Is_Character_Type
(T
));
13973 Set_Scalar_Range_For_Subtype
(Def_Id
, Range_Expression
(C
), T
);
13975 Set_Discrete_RM_Size
(Def_Id
);
13976 end Constrain_Enumeration
;
13978 ----------------------
13979 -- Constrain_Float --
13980 ----------------------
13982 procedure Constrain_Float
(Def_Id
: Node_Id
; S
: Node_Id
) is
13983 T
: constant Entity_Id
:= Entity
(Subtype_Mark
(S
));
13989 Set_Ekind
(Def_Id
, E_Floating_Point_Subtype
);
13991 Set_Etype
(Def_Id
, Base_Type
(T
));
13992 Set_Size_Info
(Def_Id
, (T
));
13993 Set_First_Rep_Item
(Def_Id
, First_Rep_Item
(T
));
13995 -- Process the constraint
13997 C
:= Constraint
(S
);
13999 -- Digits constraint present
14001 if Nkind
(C
) = N_Digits_Constraint
then
14003 Check_SPARK_05_Restriction
("digits constraint is not allowed", S
);
14004 Check_Restriction
(No_Obsolescent_Features
, C
);
14006 if Warn_On_Obsolescent_Feature
then
14008 ("subtype digits constraint is an " &
14009 "obsolescent feature (RM J.3(8))?j?", C
);
14012 D
:= Digits_Expression
(C
);
14013 Analyze_And_Resolve
(D
, Any_Integer
);
14014 Check_Digits_Expression
(D
);
14015 Set_Digits_Value
(Def_Id
, Expr_Value
(D
));
14017 -- Check that digits value is in range. Obviously we can do this
14018 -- at compile time, but it is strictly a runtime check, and of
14019 -- course there is an ACVC test that checks this.
14021 if Digits_Value
(Def_Id
) > Digits_Value
(T
) then
14022 Error_Msg_Uint_1
:= Digits_Value
(T
);
14023 Error_Msg_N
("??digits value is too large, maximum is ^", D
);
14025 Make_Raise_Constraint_Error
(Sloc
(D
),
14026 Reason
=> CE_Range_Check_Failed
);
14027 Insert_Action
(Declaration_Node
(Def_Id
), Rais
);
14030 C
:= Range_Constraint
(C
);
14032 -- No digits constraint present
14035 Set_Digits_Value
(Def_Id
, Digits_Value
(T
));
14038 -- Range constraint present
14040 if Nkind
(C
) = N_Range_Constraint
then
14041 Set_Scalar_Range_For_Subtype
(Def_Id
, Range_Expression
(C
), T
);
14043 -- No range constraint present
14046 pragma Assert
(No
(C
));
14047 Set_Scalar_Range
(Def_Id
, Scalar_Range
(T
));
14050 Set_Is_Constrained
(Def_Id
);
14051 end Constrain_Float
;
14053 ---------------------
14054 -- Constrain_Index --
14055 ---------------------
14057 procedure Constrain_Index
14060 Related_Nod
: Node_Id
;
14061 Related_Id
: Entity_Id
;
14062 Suffix
: Character;
14063 Suffix_Index
: Nat
)
14065 Def_Id
: Entity_Id
;
14066 R
: Node_Id
:= Empty
;
14067 T
: constant Entity_Id
:= Etype
(Index
);
14071 Create_Itype
(E_Void
, Related_Nod
, Related_Id
, Suffix
, Suffix_Index
);
14072 Set_Etype
(Def_Id
, Base_Type
(T
));
14074 if Nkind
(S
) = N_Range
14076 (Nkind
(S
) = N_Attribute_Reference
14077 and then Attribute_Name
(S
) = Name_Range
)
14079 -- A Range attribute will be transformed into N_Range by Resolve
14085 Process_Range_Expr_In_Decl
(R
, T
);
14087 if not Error_Posted
(S
)
14089 (Nkind
(S
) /= N_Range
14090 or else not Covers
(T
, (Etype
(Low_Bound
(S
))))
14091 or else not Covers
(T
, (Etype
(High_Bound
(S
)))))
14093 if Base_Type
(T
) /= Any_Type
14094 and then Etype
(Low_Bound
(S
)) /= Any_Type
14095 and then Etype
(High_Bound
(S
)) /= Any_Type
14097 Error_Msg_N
("range expected", S
);
14101 elsif Nkind
(S
) = N_Subtype_Indication
then
14103 -- The parser has verified that this is a discrete indication
14105 Resolve_Discrete_Subtype_Indication
(S
, T
);
14106 Bad_Predicated_Subtype_Use
14107 ("subtype& has predicate, not allowed in index constraint",
14108 S
, Entity
(Subtype_Mark
(S
)));
14110 R
:= Range_Expression
(Constraint
(S
));
14112 -- Capture values of bounds and generate temporaries for them if
14113 -- needed, since checks may cause duplication of the expressions
14114 -- which must not be reevaluated.
14116 -- The forced evaluation removes side effects from expressions, which
14117 -- should occur also in GNATprove mode. Otherwise, we end up with
14118 -- unexpected insertions of actions at places where this is not
14119 -- supposed to occur, e.g. on default parameters of a call.
14121 if Expander_Active
or GNATprove_Mode
then
14123 (Low_Bound
(R
), Related_Id
=> Def_Id
, Is_Low_Bound
=> True);
14125 (High_Bound
(R
), Related_Id
=> Def_Id
, Is_High_Bound
=> True);
14128 elsif Nkind
(S
) = N_Discriminant_Association
then
14130 -- Syntactically valid in subtype indication
14132 Error_Msg_N
("invalid index constraint", S
);
14133 Rewrite
(S
, New_Occurrence_Of
(T
, Sloc
(S
)));
14136 -- Subtype_Mark case, no anonymous subtypes to construct
14141 if Is_Entity_Name
(S
) then
14142 if not Is_Type
(Entity
(S
)) then
14143 Error_Msg_N
("expect subtype mark for index constraint", S
);
14145 elsif Base_Type
(Entity
(S
)) /= Base_Type
(T
) then
14146 Wrong_Type
(S
, Base_Type
(T
));
14148 -- Check error of subtype with predicate in index constraint
14151 Bad_Predicated_Subtype_Use
14152 ("subtype& has predicate, not allowed in index constraint",
14159 Error_Msg_N
("invalid index constraint", S
);
14160 Rewrite
(S
, New_Occurrence_Of
(T
, Sloc
(S
)));
14165 -- Complete construction of the Itype
14167 if Is_Modular_Integer_Type
(T
) then
14168 Set_Ekind
(Def_Id
, E_Modular_Integer_Subtype
);
14170 elsif Is_Integer_Type
(T
) then
14171 Set_Ekind
(Def_Id
, E_Signed_Integer_Subtype
);
14174 Set_Ekind
(Def_Id
, E_Enumeration_Subtype
);
14175 Set_Is_Character_Type
(Def_Id
, Is_Character_Type
(T
));
14176 Set_First_Literal
(Def_Id
, First_Literal
(T
));
14179 Set_Size_Info
(Def_Id
, (T
));
14180 Set_RM_Size
(Def_Id
, RM_Size
(T
));
14181 Set_First_Rep_Item
(Def_Id
, First_Rep_Item
(T
));
14183 Set_Scalar_Range
(Def_Id
, R
);
14185 Set_Etype
(S
, Def_Id
);
14186 Set_Discrete_RM_Size
(Def_Id
);
14187 end Constrain_Index
;
14189 -----------------------
14190 -- Constrain_Integer --
14191 -----------------------
14193 procedure Constrain_Integer
(Def_Id
: Node_Id
; S
: Node_Id
) is
14194 T
: constant Entity_Id
:= Entity
(Subtype_Mark
(S
));
14195 C
: constant Node_Id
:= Constraint
(S
);
14198 Set_Scalar_Range_For_Subtype
(Def_Id
, Range_Expression
(C
), T
);
14200 if Is_Modular_Integer_Type
(T
) then
14201 Set_Ekind
(Def_Id
, E_Modular_Integer_Subtype
);
14203 Set_Ekind
(Def_Id
, E_Signed_Integer_Subtype
);
14206 Set_Etype
(Def_Id
, Base_Type
(T
));
14207 Set_Size_Info
(Def_Id
, (T
));
14208 Set_First_Rep_Item
(Def_Id
, First_Rep_Item
(T
));
14209 Set_Discrete_RM_Size
(Def_Id
);
14210 end Constrain_Integer
;
14212 ------------------------------
14213 -- Constrain_Ordinary_Fixed --
14214 ------------------------------
14216 procedure Constrain_Ordinary_Fixed
(Def_Id
: Node_Id
; S
: Node_Id
) is
14217 T
: constant Entity_Id
:= Entity
(Subtype_Mark
(S
));
14223 Set_Ekind
(Def_Id
, E_Ordinary_Fixed_Point_Subtype
);
14224 Set_Etype
(Def_Id
, Base_Type
(T
));
14225 Set_Size_Info
(Def_Id
, (T
));
14226 Set_First_Rep_Item
(Def_Id
, First_Rep_Item
(T
));
14227 Set_Small_Value
(Def_Id
, Small_Value
(T
));
14229 -- Process the constraint
14231 C
:= Constraint
(S
);
14233 -- Delta constraint present
14235 if Nkind
(C
) = N_Delta_Constraint
then
14237 Check_SPARK_05_Restriction
("delta constraint is not allowed", S
);
14238 Check_Restriction
(No_Obsolescent_Features
, C
);
14240 if Warn_On_Obsolescent_Feature
then
14242 ("subtype delta constraint is an " &
14243 "obsolescent feature (RM J.3(7))?j?");
14246 D
:= Delta_Expression
(C
);
14247 Analyze_And_Resolve
(D
, Any_Real
);
14248 Check_Delta_Expression
(D
);
14249 Set_Delta_Value
(Def_Id
, Expr_Value_R
(D
));
14251 -- Check that delta value is in range. Obviously we can do this
14252 -- at compile time, but it is strictly a runtime check, and of
14253 -- course there is an ACVC test that checks this.
14255 if Delta_Value
(Def_Id
) < Delta_Value
(T
) then
14256 Error_Msg_N
("??delta value is too small", D
);
14258 Make_Raise_Constraint_Error
(Sloc
(D
),
14259 Reason
=> CE_Range_Check_Failed
);
14260 Insert_Action
(Declaration_Node
(Def_Id
), Rais
);
14263 C
:= Range_Constraint
(C
);
14265 -- No delta constraint present
14268 Set_Delta_Value
(Def_Id
, Delta_Value
(T
));
14271 -- Range constraint present
14273 if Nkind
(C
) = N_Range_Constraint
then
14274 Set_Scalar_Range_For_Subtype
(Def_Id
, Range_Expression
(C
), T
);
14276 -- No range constraint present
14279 pragma Assert
(No
(C
));
14280 Set_Scalar_Range
(Def_Id
, Scalar_Range
(T
));
14283 Set_Discrete_RM_Size
(Def_Id
);
14285 -- Unconditionally delay the freeze, since we cannot set size
14286 -- information in all cases correctly until the freeze point.
14288 Set_Has_Delayed_Freeze
(Def_Id
);
14289 end Constrain_Ordinary_Fixed
;
14291 -----------------------
14292 -- Contain_Interface --
14293 -----------------------
14295 function Contain_Interface
14296 (Iface
: Entity_Id
;
14297 Ifaces
: Elist_Id
) return Boolean
14299 Iface_Elmt
: Elmt_Id
;
14302 if Present
(Ifaces
) then
14303 Iface_Elmt
:= First_Elmt
(Ifaces
);
14304 while Present
(Iface_Elmt
) loop
14305 if Node
(Iface_Elmt
) = Iface
then
14309 Next_Elmt
(Iface_Elmt
);
14314 end Contain_Interface
;
14316 ---------------------------
14317 -- Convert_Scalar_Bounds --
14318 ---------------------------
14320 procedure Convert_Scalar_Bounds
14322 Parent_Type
: Entity_Id
;
14323 Derived_Type
: Entity_Id
;
14326 Implicit_Base
: constant Entity_Id
:= Base_Type
(Derived_Type
);
14333 -- Defend against previous errors
14335 if No
(Scalar_Range
(Derived_Type
)) then
14336 Check_Error_Detected
;
14340 Lo
:= Build_Scalar_Bound
14341 (Type_Low_Bound
(Derived_Type
),
14342 Parent_Type
, Implicit_Base
);
14344 Hi
:= Build_Scalar_Bound
14345 (Type_High_Bound
(Derived_Type
),
14346 Parent_Type
, Implicit_Base
);
14353 Set_Includes_Infinities
(Rng
, Has_Infinities
(Derived_Type
));
14355 Set_Parent
(Rng
, N
);
14356 Set_Scalar_Range
(Derived_Type
, Rng
);
14358 -- Analyze the bounds
14360 Analyze_And_Resolve
(Lo
, Implicit_Base
);
14361 Analyze_And_Resolve
(Hi
, Implicit_Base
);
14363 -- Analyze the range itself, except that we do not analyze it if
14364 -- the bounds are real literals, and we have a fixed-point type.
14365 -- The reason for this is that we delay setting the bounds in this
14366 -- case till we know the final Small and Size values (see circuit
14367 -- in Freeze.Freeze_Fixed_Point_Type for further details).
14369 if Is_Fixed_Point_Type
(Parent_Type
)
14370 and then Nkind
(Lo
) = N_Real_Literal
14371 and then Nkind
(Hi
) = N_Real_Literal
14375 -- Here we do the analysis of the range
14377 -- Note: we do this manually, since if we do a normal Analyze and
14378 -- Resolve call, there are problems with the conversions used for
14379 -- the derived type range.
14382 Set_Etype
(Rng
, Implicit_Base
);
14383 Set_Analyzed
(Rng
, True);
14385 end Convert_Scalar_Bounds
;
14387 -------------------
14388 -- Copy_And_Swap --
14389 -------------------
14391 procedure Copy_And_Swap
(Priv
, Full
: Entity_Id
) is
14393 -- Initialize new full declaration entity by copying the pertinent
14394 -- fields of the corresponding private declaration entity.
14396 -- We temporarily set Ekind to a value appropriate for a type to
14397 -- avoid assert failures in Einfo from checking for setting type
14398 -- attributes on something that is not a type. Ekind (Priv) is an
14399 -- appropriate choice, since it allowed the attributes to be set
14400 -- in the first place. This Ekind value will be modified later.
14402 Set_Ekind
(Full
, Ekind
(Priv
));
14404 -- Also set Etype temporarily to Any_Type, again, in the absence
14405 -- of errors, it will be properly reset, and if there are errors,
14406 -- then we want a value of Any_Type to remain.
14408 Set_Etype
(Full
, Any_Type
);
14410 -- Now start copying attributes
14412 Set_Has_Discriminants
(Full
, Has_Discriminants
(Priv
));
14414 if Has_Discriminants
(Full
) then
14415 Set_Discriminant_Constraint
(Full
, Discriminant_Constraint
(Priv
));
14416 Set_Stored_Constraint
(Full
, Stored_Constraint
(Priv
));
14419 Set_First_Rep_Item
(Full
, First_Rep_Item
(Priv
));
14420 Set_Homonym
(Full
, Homonym
(Priv
));
14421 Set_Is_Immediately_Visible
(Full
, Is_Immediately_Visible
(Priv
));
14422 Set_Is_Public
(Full
, Is_Public
(Priv
));
14423 Set_Is_Pure
(Full
, Is_Pure
(Priv
));
14424 Set_Is_Tagged_Type
(Full
, Is_Tagged_Type
(Priv
));
14425 Set_Has_Pragma_Unmodified
(Full
, Has_Pragma_Unmodified
(Priv
));
14426 Set_Has_Pragma_Unreferenced
(Full
, Has_Pragma_Unreferenced
(Priv
));
14427 Set_Has_Pragma_Unreferenced_Objects
14428 (Full
, Has_Pragma_Unreferenced_Objects
14431 Conditional_Delay
(Full
, Priv
);
14433 if Is_Tagged_Type
(Full
) then
14434 Set_Direct_Primitive_Operations
14435 (Full
, Direct_Primitive_Operations
(Priv
));
14436 Set_No_Tagged_Streams_Pragma
14437 (Full
, No_Tagged_Streams_Pragma
(Priv
));
14439 if Is_Base_Type
(Priv
) then
14440 Set_Class_Wide_Type
(Full
, Class_Wide_Type
(Priv
));
14444 Set_Is_Volatile
(Full
, Is_Volatile
(Priv
));
14445 Set_Treat_As_Volatile
(Full
, Treat_As_Volatile
(Priv
));
14446 Set_Scope
(Full
, Scope
(Priv
));
14447 Set_Prev_Entity
(Full
, Prev_Entity
(Priv
));
14448 Set_Next_Entity
(Full
, Next_Entity
(Priv
));
14449 Set_First_Entity
(Full
, First_Entity
(Priv
));
14450 Set_Last_Entity
(Full
, Last_Entity
(Priv
));
14452 -- If access types have been recorded for later handling, keep them in
14453 -- the full view so that they get handled when the full view freeze
14454 -- node is expanded.
14456 if Present
(Freeze_Node
(Priv
))
14457 and then Present
(Access_Types_To_Process
(Freeze_Node
(Priv
)))
14459 Ensure_Freeze_Node
(Full
);
14460 Set_Access_Types_To_Process
14461 (Freeze_Node
(Full
),
14462 Access_Types_To_Process
(Freeze_Node
(Priv
)));
14465 -- Swap the two entities. Now Private is the full type entity and Full
14466 -- is the private one. They will be swapped back at the end of the
14467 -- private part. This swapping ensures that the entity that is visible
14468 -- in the private part is the full declaration.
14470 Exchange_Entities
(Priv
, Full
);
14471 Append_Entity
(Full
, Scope
(Full
));
14474 -------------------------------------
14475 -- Copy_Array_Base_Type_Attributes --
14476 -------------------------------------
14478 procedure Copy_Array_Base_Type_Attributes
(T1
, T2
: Entity_Id
) is
14480 Set_Component_Alignment
(T1
, Component_Alignment
(T2
));
14481 Set_Component_Type
(T1
, Component_Type
(T2
));
14482 Set_Component_Size
(T1
, Component_Size
(T2
));
14483 Set_Has_Controlled_Component
(T1
, Has_Controlled_Component
(T2
));
14484 Set_Has_Non_Standard_Rep
(T1
, Has_Non_Standard_Rep
(T2
));
14485 Propagate_Concurrent_Flags
(T1
, T2
);
14486 Set_Is_Packed
(T1
, Is_Packed
(T2
));
14487 Set_Has_Aliased_Components
(T1
, Has_Aliased_Components
(T2
));
14488 Set_Has_Atomic_Components
(T1
, Has_Atomic_Components
(T2
));
14489 Set_Has_Volatile_Components
(T1
, Has_Volatile_Components
(T2
));
14490 end Copy_Array_Base_Type_Attributes
;
14492 -----------------------------------
14493 -- Copy_Array_Subtype_Attributes --
14494 -----------------------------------
14496 procedure Copy_Array_Subtype_Attributes
(T1
, T2
: Entity_Id
) is
14498 Set_Size_Info
(T1
, T2
);
14500 Set_First_Index
(T1
, First_Index
(T2
));
14501 Set_Is_Aliased
(T1
, Is_Aliased
(T2
));
14502 Set_Is_Volatile
(T1
, Is_Volatile
(T2
));
14503 Set_Treat_As_Volatile
(T1
, Treat_As_Volatile
(T2
));
14504 Set_Is_Constrained
(T1
, Is_Constrained
(T2
));
14505 Set_Depends_On_Private
(T1
, Has_Private_Component
(T2
));
14506 Inherit_Rep_Item_Chain
(T1
, T2
);
14507 Set_Convention
(T1
, Convention
(T2
));
14508 Set_Is_Limited_Composite
(T1
, Is_Limited_Composite
(T2
));
14509 Set_Is_Private_Composite
(T1
, Is_Private_Composite
(T2
));
14510 Set_Packed_Array_Impl_Type
(T1
, Packed_Array_Impl_Type
(T2
));
14511 end Copy_Array_Subtype_Attributes
;
14513 -----------------------------------
14514 -- Create_Constrained_Components --
14515 -----------------------------------
14517 procedure Create_Constrained_Components
14519 Decl_Node
: Node_Id
;
14521 Constraints
: Elist_Id
)
14523 Loc
: constant Source_Ptr
:= Sloc
(Subt
);
14524 Comp_List
: constant Elist_Id
:= New_Elmt_List
;
14525 Parent_Type
: constant Entity_Id
:= Etype
(Typ
);
14526 Assoc_List
: constant List_Id
:= New_List
;
14527 Discr_Val
: Elmt_Id
;
14531 Is_Static
: Boolean := True;
14533 procedure Collect_Fixed_Components
(Typ
: Entity_Id
);
14534 -- Collect parent type components that do not appear in a variant part
14536 procedure Create_All_Components
;
14537 -- Iterate over Comp_List to create the components of the subtype
14539 function Create_Component
(Old_Compon
: Entity_Id
) return Entity_Id
;
14540 -- Creates a new component from Old_Compon, copying all the fields from
14541 -- it, including its Etype, inserts the new component in the Subt entity
14542 -- chain and returns the new component.
14544 function Is_Variant_Record
(T
: Entity_Id
) return Boolean;
14545 -- If true, and discriminants are static, collect only components from
14546 -- variants selected by discriminant values.
14548 ------------------------------
14549 -- Collect_Fixed_Components --
14550 ------------------------------
14552 procedure Collect_Fixed_Components
(Typ
: Entity_Id
) is
14554 -- Build association list for discriminants, and find components of the
14555 -- variant part selected by the values of the discriminants.
14557 Old_C
:= First_Discriminant
(Typ
);
14558 Discr_Val
:= First_Elmt
(Constraints
);
14559 while Present
(Old_C
) loop
14560 Append_To
(Assoc_List
,
14561 Make_Component_Association
(Loc
,
14562 Choices
=> New_List
(New_Occurrence_Of
(Old_C
, Loc
)),
14563 Expression
=> New_Copy
(Node
(Discr_Val
))));
14565 Next_Elmt
(Discr_Val
);
14566 Next_Discriminant
(Old_C
);
14569 -- The tag and the possible parent component are unconditionally in
14572 if Is_Tagged_Type
(Typ
) or else Has_Controlled_Component
(Typ
) then
14573 Old_C
:= First_Component
(Typ
);
14574 while Present
(Old_C
) loop
14575 if Nam_In
(Chars
(Old_C
), Name_uTag
, Name_uParent
) then
14576 Append_Elmt
(Old_C
, Comp_List
);
14579 Next_Component
(Old_C
);
14582 end Collect_Fixed_Components
;
14584 ---------------------------
14585 -- Create_All_Components --
14586 ---------------------------
14588 procedure Create_All_Components
is
14592 Comp
:= First_Elmt
(Comp_List
);
14593 while Present
(Comp
) loop
14594 Old_C
:= Node
(Comp
);
14595 New_C
:= Create_Component
(Old_C
);
14599 Constrain_Component_Type
14600 (Old_C
, Subt
, Decl_Node
, Typ
, Constraints
));
14601 Set_Is_Public
(New_C
, Is_Public
(Subt
));
14605 end Create_All_Components
;
14607 ----------------------
14608 -- Create_Component --
14609 ----------------------
14611 function Create_Component
(Old_Compon
: Entity_Id
) return Entity_Id
is
14612 New_Compon
: constant Entity_Id
:= New_Copy
(Old_Compon
);
14615 if Ekind
(Old_Compon
) = E_Discriminant
14616 and then Is_Completely_Hidden
(Old_Compon
)
14618 -- This is a shadow discriminant created for a discriminant of
14619 -- the parent type, which needs to be present in the subtype.
14620 -- Give the shadow discriminant an internal name that cannot
14621 -- conflict with that of visible components.
14623 Set_Chars
(New_Compon
, New_Internal_Name
('C'));
14626 -- Set the parent so we have a proper link for freezing etc. This is
14627 -- not a real parent pointer, since of course our parent does not own
14628 -- up to us and reference us, we are an illegitimate child of the
14629 -- original parent.
14631 Set_Parent
(New_Compon
, Parent
(Old_Compon
));
14633 -- We do not want this node marked as Comes_From_Source, since
14634 -- otherwise it would get first class status and a separate cross-
14635 -- reference line would be generated. Illegitimate children do not
14636 -- rate such recognition.
14638 Set_Comes_From_Source
(New_Compon
, False);
14640 -- But it is a real entity, and a birth certificate must be properly
14641 -- registered by entering it into the entity list, and setting its
14642 -- scope to the given subtype. This turns out to be useful for the
14643 -- LLVM code generator, but that scope is not used otherwise.
14645 Enter_Name
(New_Compon
);
14646 Set_Scope
(New_Compon
, Subt
);
14649 end Create_Component
;
14651 -----------------------
14652 -- Is_Variant_Record --
14653 -----------------------
14655 function Is_Variant_Record
(T
: Entity_Id
) return Boolean is
14657 return Nkind
(Parent
(T
)) = N_Full_Type_Declaration
14658 and then Nkind
(Type_Definition
(Parent
(T
))) = N_Record_Definition
14659 and then Present
(Component_List
(Type_Definition
(Parent
(T
))))
14662 (Variant_Part
(Component_List
(Type_Definition
(Parent
(T
)))));
14663 end Is_Variant_Record
;
14665 -- Start of processing for Create_Constrained_Components
14668 pragma Assert
(Subt
/= Base_Type
(Subt
));
14669 pragma Assert
(Typ
= Base_Type
(Typ
));
14671 Set_First_Entity
(Subt
, Empty
);
14672 Set_Last_Entity
(Subt
, Empty
);
14674 -- Check whether constraint is fully static, in which case we can
14675 -- optimize the list of components.
14677 Discr_Val
:= First_Elmt
(Constraints
);
14678 while Present
(Discr_Val
) loop
14679 if not Is_OK_Static_Expression
(Node
(Discr_Val
)) then
14680 Is_Static
:= False;
14684 Next_Elmt
(Discr_Val
);
14687 Set_Has_Static_Discriminants
(Subt
, Is_Static
);
14691 -- Inherit the discriminants of the parent type
14693 Add_Discriminants
: declare
14699 Old_C
:= First_Discriminant
(Typ
);
14701 while Present
(Old_C
) loop
14702 Num_Disc
:= Num_Disc
+ 1;
14703 New_C
:= Create_Component
(Old_C
);
14704 Set_Is_Public
(New_C
, Is_Public
(Subt
));
14705 Next_Discriminant
(Old_C
);
14708 -- For an untagged derived subtype, the number of discriminants may
14709 -- be smaller than the number of inherited discriminants, because
14710 -- several of them may be renamed by a single new discriminant or
14711 -- constrained. In this case, add the hidden discriminants back into
14712 -- the subtype, because they need to be present if the optimizer of
14713 -- the GCC 4.x back-end decides to break apart assignments between
14714 -- objects using the parent view into member-wise assignments.
14718 if Is_Derived_Type
(Typ
)
14719 and then not Is_Tagged_Type
(Typ
)
14721 Old_C
:= First_Stored_Discriminant
(Typ
);
14723 while Present
(Old_C
) loop
14724 Num_Gird
:= Num_Gird
+ 1;
14725 Next_Stored_Discriminant
(Old_C
);
14729 if Num_Gird
> Num_Disc
then
14731 -- Find out multiple uses of new discriminants, and add hidden
14732 -- components for the extra renamed discriminants. We recognize
14733 -- multiple uses through the Corresponding_Discriminant of a
14734 -- new discriminant: if it constrains several old discriminants,
14735 -- this field points to the last one in the parent type. The
14736 -- stored discriminants of the derived type have the same name
14737 -- as those of the parent.
14741 New_Discr
: Entity_Id
;
14742 Old_Discr
: Entity_Id
;
14745 Constr
:= First_Elmt
(Stored_Constraint
(Typ
));
14746 Old_Discr
:= First_Stored_Discriminant
(Typ
);
14747 while Present
(Constr
) loop
14748 if Is_Entity_Name
(Node
(Constr
))
14749 and then Ekind
(Entity
(Node
(Constr
))) = E_Discriminant
14751 New_Discr
:= Entity
(Node
(Constr
));
14753 if Chars
(Corresponding_Discriminant
(New_Discr
)) /=
14756 -- The new discriminant has been used to rename a
14757 -- subsequent old discriminant. Introduce a shadow
14758 -- component for the current old discriminant.
14760 New_C
:= Create_Component
(Old_Discr
);
14761 Set_Original_Record_Component
(New_C
, Old_Discr
);
14765 -- The constraint has eliminated the old discriminant.
14766 -- Introduce a shadow component.
14768 New_C
:= Create_Component
(Old_Discr
);
14769 Set_Original_Record_Component
(New_C
, Old_Discr
);
14772 Next_Elmt
(Constr
);
14773 Next_Stored_Discriminant
(Old_Discr
);
14777 end Add_Discriminants
;
14780 and then Is_Variant_Record
(Typ
)
14782 Collect_Fixed_Components
(Typ
);
14784 Gather_Components
(
14786 Component_List
(Type_Definition
(Parent
(Typ
))),
14787 Governed_By
=> Assoc_List
,
14789 Report_Errors
=> Errors
);
14790 pragma Assert
(not Errors
14791 or else Serious_Errors_Detected
> 0);
14793 Create_All_Components
;
14795 -- If the subtype declaration is created for a tagged type derivation
14796 -- with constraints, we retrieve the record definition of the parent
14797 -- type to select the components of the proper variant.
14800 and then Is_Tagged_Type
(Typ
)
14801 and then Nkind
(Parent
(Typ
)) = N_Full_Type_Declaration
14803 Nkind
(Type_Definition
(Parent
(Typ
))) = N_Derived_Type_Definition
14804 and then Is_Variant_Record
(Parent_Type
)
14806 Collect_Fixed_Components
(Typ
);
14810 Component_List
(Type_Definition
(Parent
(Parent_Type
))),
14811 Governed_By
=> Assoc_List
,
14813 Report_Errors
=> Errors
);
14815 -- Note: previously there was a check at this point that no errors
14816 -- were detected. As a consequence of AI05-220 there may be an error
14817 -- if an inherited discriminant that controls a variant has a non-
14818 -- static constraint.
14820 -- If the tagged derivation has a type extension, collect all the
14821 -- new components therein.
14823 if Present
(Record_Extension_Part
(Type_Definition
(Parent
(Typ
))))
14825 Old_C
:= First_Component
(Typ
);
14826 while Present
(Old_C
) loop
14827 if Original_Record_Component
(Old_C
) = Old_C
14828 and then Chars
(Old_C
) /= Name_uTag
14829 and then Chars
(Old_C
) /= Name_uParent
14831 Append_Elmt
(Old_C
, Comp_List
);
14834 Next_Component
(Old_C
);
14838 Create_All_Components
;
14841 -- If discriminants are not static, or if this is a multi-level type
14842 -- extension, we have to include all components of the parent type.
14844 Old_C
:= First_Component
(Typ
);
14845 while Present
(Old_C
) loop
14846 New_C
:= Create_Component
(Old_C
);
14850 Constrain_Component_Type
14851 (Old_C
, Subt
, Decl_Node
, Typ
, Constraints
));
14852 Set_Is_Public
(New_C
, Is_Public
(Subt
));
14854 Next_Component
(Old_C
);
14859 end Create_Constrained_Components
;
14861 ------------------------------------------
14862 -- Decimal_Fixed_Point_Type_Declaration --
14863 ------------------------------------------
14865 procedure Decimal_Fixed_Point_Type_Declaration
14869 Loc
: constant Source_Ptr
:= Sloc
(Def
);
14870 Digs_Expr
: constant Node_Id
:= Digits_Expression
(Def
);
14871 Delta_Expr
: constant Node_Id
:= Delta_Expression
(Def
);
14872 Implicit_Base
: Entity_Id
;
14879 Check_SPARK_05_Restriction
14880 ("decimal fixed point type is not allowed", Def
);
14881 Check_Restriction
(No_Fixed_Point
, Def
);
14883 -- Create implicit base type
14886 Create_Itype
(E_Decimal_Fixed_Point_Type
, Parent
(Def
), T
, 'B');
14887 Set_Etype
(Implicit_Base
, Implicit_Base
);
14889 -- Analyze and process delta expression
14891 Analyze_And_Resolve
(Delta_Expr
, Universal_Real
);
14893 Check_Delta_Expression
(Delta_Expr
);
14894 Delta_Val
:= Expr_Value_R
(Delta_Expr
);
14896 -- Check delta is power of 10, and determine scale value from it
14902 Scale_Val
:= Uint_0
;
14905 if Val
< Ureal_1
then
14906 while Val
< Ureal_1
loop
14907 Val
:= Val
* Ureal_10
;
14908 Scale_Val
:= Scale_Val
+ 1;
14911 if Scale_Val
> 18 then
14912 Error_Msg_N
("scale exceeds maximum value of 18", Def
);
14913 Scale_Val
:= UI_From_Int
(+18);
14917 while Val
> Ureal_1
loop
14918 Val
:= Val
/ Ureal_10
;
14919 Scale_Val
:= Scale_Val
- 1;
14922 if Scale_Val
< -18 then
14923 Error_Msg_N
("scale is less than minimum value of -18", Def
);
14924 Scale_Val
:= UI_From_Int
(-18);
14928 if Val
/= Ureal_1
then
14929 Error_Msg_N
("delta expression must be a power of 10", Def
);
14930 Delta_Val
:= Ureal_10
** (-Scale_Val
);
14934 -- Set delta, scale and small (small = delta for decimal type)
14936 Set_Delta_Value
(Implicit_Base
, Delta_Val
);
14937 Set_Scale_Value
(Implicit_Base
, Scale_Val
);
14938 Set_Small_Value
(Implicit_Base
, Delta_Val
);
14940 -- Analyze and process digits expression
14942 Analyze_And_Resolve
(Digs_Expr
, Any_Integer
);
14943 Check_Digits_Expression
(Digs_Expr
);
14944 Digs_Val
:= Expr_Value
(Digs_Expr
);
14946 if Digs_Val
> 18 then
14947 Digs_Val
:= UI_From_Int
(+18);
14948 Error_Msg_N
("digits value out of range, maximum is 18", Digs_Expr
);
14951 Set_Digits_Value
(Implicit_Base
, Digs_Val
);
14952 Bound_Val
:= UR_From_Uint
(10 ** Digs_Val
- 1) * Delta_Val
;
14954 -- Set range of base type from digits value for now. This will be
14955 -- expanded to represent the true underlying base range by Freeze.
14957 Set_Fixed_Range
(Implicit_Base
, Loc
, -Bound_Val
, Bound_Val
);
14959 -- Note: We leave size as zero for now, size will be set at freeze
14960 -- time. We have to do this for ordinary fixed-point, because the size
14961 -- depends on the specified small, and we might as well do the same for
14962 -- decimal fixed-point.
14964 pragma Assert
(Esize
(Implicit_Base
) = Uint_0
);
14966 -- If there are bounds given in the declaration use them as the
14967 -- bounds of the first named subtype.
14969 if Present
(Real_Range_Specification
(Def
)) then
14971 RRS
: constant Node_Id
:= Real_Range_Specification
(Def
);
14972 Low
: constant Node_Id
:= Low_Bound
(RRS
);
14973 High
: constant Node_Id
:= High_Bound
(RRS
);
14978 Analyze_And_Resolve
(Low
, Any_Real
);
14979 Analyze_And_Resolve
(High
, Any_Real
);
14980 Check_Real_Bound
(Low
);
14981 Check_Real_Bound
(High
);
14982 Low_Val
:= Expr_Value_R
(Low
);
14983 High_Val
:= Expr_Value_R
(High
);
14985 if Low_Val
< (-Bound_Val
) then
14987 ("range low bound too small for digits value", Low
);
14988 Low_Val
:= -Bound_Val
;
14991 if High_Val
> Bound_Val
then
14993 ("range high bound too large for digits value", High
);
14994 High_Val
:= Bound_Val
;
14997 Set_Fixed_Range
(T
, Loc
, Low_Val
, High_Val
);
15000 -- If no explicit range, use range that corresponds to given
15001 -- digits value. This will end up as the final range for the
15005 Set_Fixed_Range
(T
, Loc
, -Bound_Val
, Bound_Val
);
15008 -- Complete entity for first subtype. The inheritance of the rep item
15009 -- chain ensures that SPARK-related pragmas are not clobbered when the
15010 -- decimal fixed point type acts as a full view of a private type.
15012 Set_Ekind
(T
, E_Decimal_Fixed_Point_Subtype
);
15013 Set_Etype
(T
, Implicit_Base
);
15014 Set_Size_Info
(T
, Implicit_Base
);
15015 Inherit_Rep_Item_Chain
(T
, Implicit_Base
);
15016 Set_Digits_Value
(T
, Digs_Val
);
15017 Set_Delta_Value
(T
, Delta_Val
);
15018 Set_Small_Value
(T
, Delta_Val
);
15019 Set_Scale_Value
(T
, Scale_Val
);
15020 Set_Is_Constrained
(T
);
15021 end Decimal_Fixed_Point_Type_Declaration
;
15023 -----------------------------------
15024 -- Derive_Progenitor_Subprograms --
15025 -----------------------------------
15027 procedure Derive_Progenitor_Subprograms
15028 (Parent_Type
: Entity_Id
;
15029 Tagged_Type
: Entity_Id
)
15034 Iface_Alias
: Entity_Id
;
15035 Iface_Elmt
: Elmt_Id
;
15036 Iface_Subp
: Entity_Id
;
15037 New_Subp
: Entity_Id
:= Empty
;
15038 Prim_Elmt
: Elmt_Id
;
15043 pragma Assert
(Ada_Version
>= Ada_2005
15044 and then Is_Record_Type
(Tagged_Type
)
15045 and then Is_Tagged_Type
(Tagged_Type
)
15046 and then Has_Interfaces
(Tagged_Type
));
15048 -- Step 1: Transfer to the full-view primitives associated with the
15049 -- partial-view that cover interface primitives. Conceptually this
15050 -- work should be done later by Process_Full_View; done here to
15051 -- simplify its implementation at later stages. It can be safely
15052 -- done here because interfaces must be visible in the partial and
15053 -- private view (RM 7.3(7.3/2)).
15055 -- Small optimization: This work is only required if the parent may
15056 -- have entities whose Alias attribute reference an interface primitive.
15057 -- Such a situation may occur if the parent is an abstract type and the
15058 -- primitive has not been yet overridden or if the parent is a generic
15059 -- formal type covering interfaces.
15061 -- If the tagged type is not abstract, it cannot have abstract
15062 -- primitives (the only entities in the list of primitives of
15063 -- non-abstract tagged types that can reference abstract primitives
15064 -- through its Alias attribute are the internal entities that have
15065 -- attribute Interface_Alias, and these entities are generated later
15066 -- by Add_Internal_Interface_Entities).
15068 if In_Private_Part
(Current_Scope
)
15069 and then (Is_Abstract_Type
(Parent_Type
)
15071 Is_Generic_Type
(Parent_Type
))
15073 Elmt
:= First_Elmt
(Primitive_Operations
(Tagged_Type
));
15074 while Present
(Elmt
) loop
15075 Subp
:= Node
(Elmt
);
15077 -- At this stage it is not possible to have entities in the list
15078 -- of primitives that have attribute Interface_Alias.
15080 pragma Assert
(No
(Interface_Alias
(Subp
)));
15082 Typ
:= Find_Dispatching_Type
(Ultimate_Alias
(Subp
));
15084 if Is_Interface
(Typ
) then
15085 E
:= Find_Primitive_Covering_Interface
15086 (Tagged_Type
=> Tagged_Type
,
15087 Iface_Prim
=> Subp
);
15090 and then Find_Dispatching_Type
(Ultimate_Alias
(E
)) /= Typ
15092 Replace_Elmt
(Elmt
, E
);
15093 Remove_Homonym
(Subp
);
15101 -- Step 2: Add primitives of progenitors that are not implemented by
15102 -- parents of Tagged_Type.
15104 if Present
(Interfaces
(Base_Type
(Tagged_Type
))) then
15105 Iface_Elmt
:= First_Elmt
(Interfaces
(Base_Type
(Tagged_Type
)));
15106 while Present
(Iface_Elmt
) loop
15107 Iface
:= Node
(Iface_Elmt
);
15109 Prim_Elmt
:= First_Elmt
(Primitive_Operations
(Iface
));
15110 while Present
(Prim_Elmt
) loop
15111 Iface_Subp
:= Node
(Prim_Elmt
);
15112 Iface_Alias
:= Ultimate_Alias
(Iface_Subp
);
15114 -- Exclude derivation of predefined primitives except those
15115 -- that come from source, or are inherited from one that comes
15116 -- from source. Required to catch declarations of equality
15117 -- operators of interfaces. For example:
15119 -- type Iface is interface;
15120 -- function "=" (Left, Right : Iface) return Boolean;
15122 if not Is_Predefined_Dispatching_Operation
(Iface_Subp
)
15123 or else Comes_From_Source
(Iface_Alias
)
15126 Find_Primitive_Covering_Interface
15127 (Tagged_Type
=> Tagged_Type
,
15128 Iface_Prim
=> Iface_Subp
);
15130 -- If not found we derive a new primitive leaving its alias
15131 -- attribute referencing the interface primitive.
15135 (New_Subp
, Iface_Subp
, Tagged_Type
, Iface
);
15137 -- Ada 2012 (AI05-0197): If the covering primitive's name
15138 -- differs from the name of the interface primitive then it
15139 -- is a private primitive inherited from a parent type. In
15140 -- such case, given that Tagged_Type covers the interface,
15141 -- the inherited private primitive becomes visible. For such
15142 -- purpose we add a new entity that renames the inherited
15143 -- private primitive.
15145 elsif Chars
(E
) /= Chars
(Iface_Subp
) then
15146 pragma Assert
(Has_Suffix
(E
, 'P'));
15148 (New_Subp
, Iface_Subp
, Tagged_Type
, Iface
);
15149 Set_Alias
(New_Subp
, E
);
15150 Set_Is_Abstract_Subprogram
(New_Subp
,
15151 Is_Abstract_Subprogram
(E
));
15153 -- Propagate to the full view interface entities associated
15154 -- with the partial view.
15156 elsif In_Private_Part
(Current_Scope
)
15157 and then Present
(Alias
(E
))
15158 and then Alias
(E
) = Iface_Subp
15160 List_Containing
(Parent
(E
)) /=
15161 Private_Declarations
15163 (Unit_Declaration_Node
(Current_Scope
)))
15165 Append_Elmt
(E
, Primitive_Operations
(Tagged_Type
));
15169 Next_Elmt
(Prim_Elmt
);
15172 Next_Elmt
(Iface_Elmt
);
15175 end Derive_Progenitor_Subprograms
;
15177 -----------------------
15178 -- Derive_Subprogram --
15179 -----------------------
15181 procedure Derive_Subprogram
15182 (New_Subp
: out Entity_Id
;
15183 Parent_Subp
: Entity_Id
;
15184 Derived_Type
: Entity_Id
;
15185 Parent_Type
: Entity_Id
;
15186 Actual_Subp
: Entity_Id
:= Empty
)
15188 Formal
: Entity_Id
;
15189 -- Formal parameter of parent primitive operation
15191 Formal_Of_Actual
: Entity_Id
;
15192 -- Formal parameter of actual operation, when the derivation is to
15193 -- create a renaming for a primitive operation of an actual in an
15196 New_Formal
: Entity_Id
;
15197 -- Formal of inherited operation
15199 Visible_Subp
: Entity_Id
:= Parent_Subp
;
15201 function Is_Private_Overriding
return Boolean;
15202 -- If Subp is a private overriding of a visible operation, the inherited
15203 -- operation derives from the overridden op (even though its body is the
15204 -- overriding one) and the inherited operation is visible now. See
15205 -- sem_disp to see the full details of the handling of the overridden
15206 -- subprogram, which is removed from the list of primitive operations of
15207 -- the type. The overridden subprogram is saved locally in Visible_Subp,
15208 -- and used to diagnose abstract operations that need overriding in the
15211 procedure Replace_Type
(Id
, New_Id
: Entity_Id
);
15212 -- When the type is an anonymous access type, create a new access type
15213 -- designating the derived type.
15215 procedure Set_Derived_Name
;
15216 -- This procedure sets the appropriate Chars name for New_Subp. This
15217 -- is normally just a copy of the parent name. An exception arises for
15218 -- type support subprograms, where the name is changed to reflect the
15219 -- name of the derived type, e.g. if type foo is derived from type bar,
15220 -- then a procedure barDA is derived with a name fooDA.
15222 ---------------------------
15223 -- Is_Private_Overriding --
15224 ---------------------------
15226 function Is_Private_Overriding
return Boolean is
15230 -- If the parent is not a dispatching operation there is no
15231 -- need to investigate overridings
15233 if not Is_Dispatching_Operation
(Parent_Subp
) then
15237 -- The visible operation that is overridden is a homonym of the
15238 -- parent subprogram. We scan the homonym chain to find the one
15239 -- whose alias is the subprogram we are deriving.
15241 Prev
:= Current_Entity
(Parent_Subp
);
15242 while Present
(Prev
) loop
15243 if Ekind
(Prev
) = Ekind
(Parent_Subp
)
15244 and then Alias
(Prev
) = Parent_Subp
15245 and then Scope
(Parent_Subp
) = Scope
(Prev
)
15246 and then not Is_Hidden
(Prev
)
15248 Visible_Subp
:= Prev
;
15252 Prev
:= Homonym
(Prev
);
15256 end Is_Private_Overriding
;
15262 procedure Replace_Type
(Id
, New_Id
: Entity_Id
) is
15263 Id_Type
: constant Entity_Id
:= Etype
(Id
);
15264 Acc_Type
: Entity_Id
;
15265 Par
: constant Node_Id
:= Parent
(Derived_Type
);
15268 -- When the type is an anonymous access type, create a new access
15269 -- type designating the derived type. This itype must be elaborated
15270 -- at the point of the derivation, not on subsequent calls that may
15271 -- be out of the proper scope for Gigi, so we insert a reference to
15272 -- it after the derivation.
15274 if Ekind
(Id_Type
) = E_Anonymous_Access_Type
then
15276 Desig_Typ
: Entity_Id
:= Designated_Type
(Id_Type
);
15279 if Ekind
(Desig_Typ
) = E_Record_Type_With_Private
15280 and then Present
(Full_View
(Desig_Typ
))
15281 and then not Is_Private_Type
(Parent_Type
)
15283 Desig_Typ
:= Full_View
(Desig_Typ
);
15286 if Base_Type
(Desig_Typ
) = Base_Type
(Parent_Type
)
15288 -- Ada 2005 (AI-251): Handle also derivations of abstract
15289 -- interface primitives.
15291 or else (Is_Interface
(Desig_Typ
)
15292 and then not Is_Class_Wide_Type
(Desig_Typ
))
15294 Acc_Type
:= New_Copy
(Id_Type
);
15295 Set_Etype
(Acc_Type
, Acc_Type
);
15296 Set_Scope
(Acc_Type
, New_Subp
);
15298 -- Set size of anonymous access type. If we have an access
15299 -- to an unconstrained array, this is a fat pointer, so it
15300 -- is sizes at twice addtress size.
15302 if Is_Array_Type
(Desig_Typ
)
15303 and then not Is_Constrained
(Desig_Typ
)
15305 Init_Size
(Acc_Type
, 2 * System_Address_Size
);
15307 -- Other cases use a thin pointer
15310 Init_Size
(Acc_Type
, System_Address_Size
);
15313 -- Set remaining characterstics of anonymous access type
15315 Init_Alignment
(Acc_Type
);
15316 Set_Directly_Designated_Type
(Acc_Type
, Derived_Type
);
15318 Set_Etype
(New_Id
, Acc_Type
);
15319 Set_Scope
(New_Id
, New_Subp
);
15321 -- Create a reference to it
15323 Build_Itype_Reference
(Acc_Type
, Parent
(Derived_Type
));
15326 Set_Etype
(New_Id
, Id_Type
);
15330 -- In Ada2012, a formal may have an incomplete type but the type
15331 -- derivation that inherits the primitive follows the full view.
15333 elsif Base_Type
(Id_Type
) = Base_Type
(Parent_Type
)
15335 (Ekind
(Id_Type
) = E_Record_Type_With_Private
15336 and then Present
(Full_View
(Id_Type
))
15338 Base_Type
(Full_View
(Id_Type
)) = Base_Type
(Parent_Type
))
15340 (Ada_Version
>= Ada_2012
15341 and then Ekind
(Id_Type
) = E_Incomplete_Type
15342 and then Full_View
(Id_Type
) = Parent_Type
)
15344 -- Constraint checks on formals are generated during expansion,
15345 -- based on the signature of the original subprogram. The bounds
15346 -- of the derived type are not relevant, and thus we can use
15347 -- the base type for the formals. However, the return type may be
15348 -- used in a context that requires that the proper static bounds
15349 -- be used (a case statement, for example) and for those cases
15350 -- we must use the derived type (first subtype), not its base.
15352 -- If the derived_type_definition has no constraints, we know that
15353 -- the derived type has the same constraints as the first subtype
15354 -- of the parent, and we can also use it rather than its base,
15355 -- which can lead to more efficient code.
15357 if Etype
(Id
) = Parent_Type
then
15358 if Is_Scalar_Type
(Parent_Type
)
15360 Subtypes_Statically_Compatible
(Parent_Type
, Derived_Type
)
15362 Set_Etype
(New_Id
, Derived_Type
);
15364 elsif Nkind
(Par
) = N_Full_Type_Declaration
15366 Nkind
(Type_Definition
(Par
)) = N_Derived_Type_Definition
15369 (Subtype_Indication
(Type_Definition
(Par
)))
15371 Set_Etype
(New_Id
, Derived_Type
);
15374 Set_Etype
(New_Id
, Base_Type
(Derived_Type
));
15378 Set_Etype
(New_Id
, Base_Type
(Derived_Type
));
15382 Set_Etype
(New_Id
, Etype
(Id
));
15386 ----------------------
15387 -- Set_Derived_Name --
15388 ----------------------
15390 procedure Set_Derived_Name
is
15391 Nm
: constant TSS_Name_Type
:= Get_TSS_Name
(Parent_Subp
);
15393 if Nm
= TSS_Null
then
15394 Set_Chars
(New_Subp
, Chars
(Parent_Subp
));
15396 Set_Chars
(New_Subp
, Make_TSS_Name
(Base_Type
(Derived_Type
), Nm
));
15398 end Set_Derived_Name
;
15400 -- Start of processing for Derive_Subprogram
15403 New_Subp
:= New_Entity
(Nkind
(Parent_Subp
), Sloc
(Derived_Type
));
15404 Set_Ekind
(New_Subp
, Ekind
(Parent_Subp
));
15406 -- Check whether the inherited subprogram is a private operation that
15407 -- should be inherited but not yet made visible. Such subprograms can
15408 -- become visible at a later point (e.g., the private part of a public
15409 -- child unit) via Declare_Inherited_Private_Subprograms. If the
15410 -- following predicate is true, then this is not such a private
15411 -- operation and the subprogram simply inherits the name of the parent
15412 -- subprogram. Note the special check for the names of controlled
15413 -- operations, which are currently exempted from being inherited with
15414 -- a hidden name because they must be findable for generation of
15415 -- implicit run-time calls.
15417 if not Is_Hidden
(Parent_Subp
)
15418 or else Is_Internal
(Parent_Subp
)
15419 or else Is_Private_Overriding
15420 or else Is_Internal_Name
(Chars
(Parent_Subp
))
15421 or else (Is_Controlled
(Parent_Type
)
15422 and then Nam_In
(Chars
(Parent_Subp
), Name_Adjust
,
15428 -- An inherited dispatching equality will be overridden by an internally
15429 -- generated one, or by an explicit one, so preserve its name and thus
15430 -- its entry in the dispatch table. Otherwise, if Parent_Subp is a
15431 -- private operation it may become invisible if the full view has
15432 -- progenitors, and the dispatch table will be malformed.
15433 -- We check that the type is limited to handle the anomalous declaration
15434 -- of Limited_Controlled, which is derived from a non-limited type, and
15435 -- which is handled specially elsewhere as well.
15437 elsif Chars
(Parent_Subp
) = Name_Op_Eq
15438 and then Is_Dispatching_Operation
(Parent_Subp
)
15439 and then Etype
(Parent_Subp
) = Standard_Boolean
15440 and then not Is_Limited_Type
(Etype
(First_Formal
(Parent_Subp
)))
15442 Etype
(First_Formal
(Parent_Subp
)) =
15443 Etype
(Next_Formal
(First_Formal
(Parent_Subp
)))
15447 -- If parent is hidden, this can be a regular derivation if the
15448 -- parent is immediately visible in a non-instantiating context,
15449 -- or if we are in the private part of an instance. This test
15450 -- should still be refined ???
15452 -- The test for In_Instance_Not_Visible avoids inheriting the derived
15453 -- operation as a non-visible operation in cases where the parent
15454 -- subprogram might not be visible now, but was visible within the
15455 -- original generic, so it would be wrong to make the inherited
15456 -- subprogram non-visible now. (Not clear if this test is fully
15457 -- correct; are there any cases where we should declare the inherited
15458 -- operation as not visible to avoid it being overridden, e.g., when
15459 -- the parent type is a generic actual with private primitives ???)
15461 -- (they should be treated the same as other private inherited
15462 -- subprograms, but it's not clear how to do this cleanly). ???
15464 elsif (In_Open_Scopes
(Scope
(Base_Type
(Parent_Type
)))
15465 and then Is_Immediately_Visible
(Parent_Subp
)
15466 and then not In_Instance
)
15467 or else In_Instance_Not_Visible
15471 -- Ada 2005 (AI-251): Regular derivation if the parent subprogram
15472 -- overrides an interface primitive because interface primitives
15473 -- must be visible in the partial view of the parent (RM 7.3 (7.3/2))
15475 elsif Ada_Version
>= Ada_2005
15476 and then Is_Dispatching_Operation
(Parent_Subp
)
15477 and then Present
(Covered_Interface_Op
(Parent_Subp
))
15481 -- Otherwise, the type is inheriting a private operation, so enter it
15482 -- with a special name so it can't be overridden.
15485 Set_Chars
(New_Subp
, New_External_Name
(Chars
(Parent_Subp
), 'P'));
15488 Set_Parent
(New_Subp
, Parent
(Derived_Type
));
15490 if Present
(Actual_Subp
) then
15491 Replace_Type
(Actual_Subp
, New_Subp
);
15493 Replace_Type
(Parent_Subp
, New_Subp
);
15496 Conditional_Delay
(New_Subp
, Parent_Subp
);
15498 -- If we are creating a renaming for a primitive operation of an
15499 -- actual of a generic derived type, we must examine the signature
15500 -- of the actual primitive, not that of the generic formal, which for
15501 -- example may be an interface. However the name and initial value
15502 -- of the inherited operation are those of the formal primitive.
15504 Formal
:= First_Formal
(Parent_Subp
);
15506 if Present
(Actual_Subp
) then
15507 Formal_Of_Actual
:= First_Formal
(Actual_Subp
);
15509 Formal_Of_Actual
:= Empty
;
15512 while Present
(Formal
) loop
15513 New_Formal
:= New_Copy
(Formal
);
15515 -- Normally we do not go copying parents, but in the case of
15516 -- formals, we need to link up to the declaration (which is the
15517 -- parameter specification), and it is fine to link up to the
15518 -- original formal's parameter specification in this case.
15520 Set_Parent
(New_Formal
, Parent
(Formal
));
15521 Append_Entity
(New_Formal
, New_Subp
);
15523 if Present
(Formal_Of_Actual
) then
15524 Replace_Type
(Formal_Of_Actual
, New_Formal
);
15525 Next_Formal
(Formal_Of_Actual
);
15527 Replace_Type
(Formal
, New_Formal
);
15530 Next_Formal
(Formal
);
15533 -- If this derivation corresponds to a tagged generic actual, then
15534 -- primitive operations rename those of the actual. Otherwise the
15535 -- primitive operations rename those of the parent type, If the parent
15536 -- renames an intrinsic operator, so does the new subprogram. We except
15537 -- concatenation, which is always properly typed, and does not get
15538 -- expanded as other intrinsic operations.
15540 if No
(Actual_Subp
) then
15541 if Is_Intrinsic_Subprogram
(Parent_Subp
) then
15542 Set_Is_Intrinsic_Subprogram
(New_Subp
);
15544 if Present
(Alias
(Parent_Subp
))
15545 and then Chars
(Parent_Subp
) /= Name_Op_Concat
15547 Set_Alias
(New_Subp
, Alias
(Parent_Subp
));
15549 Set_Alias
(New_Subp
, Parent_Subp
);
15553 Set_Alias
(New_Subp
, Parent_Subp
);
15557 Set_Alias
(New_Subp
, Actual_Subp
);
15560 -- Derived subprograms of a tagged type must inherit the convention
15561 -- of the parent subprogram (a requirement of AI-117). Derived
15562 -- subprograms of untagged types simply get convention Ada by default.
15564 -- If the derived type is a tagged generic formal type with unknown
15565 -- discriminants, its convention is intrinsic (RM 6.3.1 (8)).
15567 -- However, if the type is derived from a generic formal, the further
15568 -- inherited subprogram has the convention of the non-generic ancestor.
15569 -- Otherwise there would be no way to override the operation.
15570 -- (This is subject to forthcoming ARG discussions).
15572 if Is_Tagged_Type
(Derived_Type
) then
15573 if Is_Generic_Type
(Derived_Type
)
15574 and then Has_Unknown_Discriminants
(Derived_Type
)
15576 Set_Convention
(New_Subp
, Convention_Intrinsic
);
15579 if Is_Generic_Type
(Parent_Type
)
15580 and then Has_Unknown_Discriminants
(Parent_Type
)
15582 Set_Convention
(New_Subp
, Convention
(Alias
(Parent_Subp
)));
15584 Set_Convention
(New_Subp
, Convention
(Parent_Subp
));
15589 -- Predefined controlled operations retain their name even if the parent
15590 -- is hidden (see above), but they are not primitive operations if the
15591 -- ancestor is not visible, for example if the parent is a private
15592 -- extension completed with a controlled extension. Note that a full
15593 -- type that is controlled can break privacy: the flag Is_Controlled is
15594 -- set on both views of the type.
15596 if Is_Controlled
(Parent_Type
)
15597 and then Nam_In
(Chars
(Parent_Subp
), Name_Initialize
,
15600 and then Is_Hidden
(Parent_Subp
)
15601 and then not Is_Visibly_Controlled
(Parent_Type
)
15603 Set_Is_Hidden
(New_Subp
);
15606 Set_Is_Imported
(New_Subp
, Is_Imported
(Parent_Subp
));
15607 Set_Is_Exported
(New_Subp
, Is_Exported
(Parent_Subp
));
15609 if Ekind
(Parent_Subp
) = E_Procedure
then
15610 Set_Is_Valued_Procedure
15611 (New_Subp
, Is_Valued_Procedure
(Parent_Subp
));
15613 Set_Has_Controlling_Result
15614 (New_Subp
, Has_Controlling_Result
(Parent_Subp
));
15617 -- No_Return must be inherited properly. If this is overridden in the
15618 -- case of a dispatching operation, then a check is made in Sem_Disp
15619 -- that the overriding operation is also No_Return (no such check is
15620 -- required for the case of non-dispatching operation.
15622 Set_No_Return
(New_Subp
, No_Return
(Parent_Subp
));
15624 -- A derived function with a controlling result is abstract. If the
15625 -- Derived_Type is a nonabstract formal generic derived type, then
15626 -- inherited operations are not abstract: the required check is done at
15627 -- instantiation time. If the derivation is for a generic actual, the
15628 -- function is not abstract unless the actual is.
15630 if Is_Generic_Type
(Derived_Type
)
15631 and then not Is_Abstract_Type
(Derived_Type
)
15635 -- Ada 2005 (AI-228): Calculate the "require overriding" and "abstract"
15636 -- properties of the subprogram, as defined in RM-3.9.3(4/2-6/2).
15638 -- A subprogram subject to pragma Extensions_Visible with value False
15639 -- requires overriding if the subprogram has at least one controlling
15640 -- OUT parameter (SPARK RM 6.1.7(6)).
15642 elsif Ada_Version
>= Ada_2005
15643 and then (Is_Abstract_Subprogram
(Alias
(New_Subp
))
15644 or else (Is_Tagged_Type
(Derived_Type
)
15645 and then Etype
(New_Subp
) = Derived_Type
15646 and then not Is_Null_Extension
(Derived_Type
))
15647 or else (Is_Tagged_Type
(Derived_Type
)
15648 and then Ekind
(Etype
(New_Subp
)) =
15649 E_Anonymous_Access_Type
15650 and then Designated_Type
(Etype
(New_Subp
)) =
15652 and then not Is_Null_Extension
(Derived_Type
))
15653 or else (Comes_From_Source
(Alias
(New_Subp
))
15654 and then Is_EVF_Procedure
(Alias
(New_Subp
))))
15655 and then No
(Actual_Subp
)
15657 if not Is_Tagged_Type
(Derived_Type
)
15658 or else Is_Abstract_Type
(Derived_Type
)
15659 or else Is_Abstract_Subprogram
(Alias
(New_Subp
))
15661 Set_Is_Abstract_Subprogram
(New_Subp
);
15663 Set_Requires_Overriding
(New_Subp
);
15666 elsif Ada_Version
< Ada_2005
15667 and then (Is_Abstract_Subprogram
(Alias
(New_Subp
))
15668 or else (Is_Tagged_Type
(Derived_Type
)
15669 and then Etype
(New_Subp
) = Derived_Type
15670 and then No
(Actual_Subp
)))
15672 Set_Is_Abstract_Subprogram
(New_Subp
);
15674 -- AI05-0097 : an inherited operation that dispatches on result is
15675 -- abstract if the derived type is abstract, even if the parent type
15676 -- is concrete and the derived type is a null extension.
15678 elsif Has_Controlling_Result
(Alias
(New_Subp
))
15679 and then Is_Abstract_Type
(Etype
(New_Subp
))
15681 Set_Is_Abstract_Subprogram
(New_Subp
);
15683 -- Finally, if the parent type is abstract we must verify that all
15684 -- inherited operations are either non-abstract or overridden, or that
15685 -- the derived type itself is abstract (this check is performed at the
15686 -- end of a package declaration, in Check_Abstract_Overriding). A
15687 -- private overriding in the parent type will not be visible in the
15688 -- derivation if we are not in an inner package or in a child unit of
15689 -- the parent type, in which case the abstractness of the inherited
15690 -- operation is carried to the new subprogram.
15692 elsif Is_Abstract_Type
(Parent_Type
)
15693 and then not In_Open_Scopes
(Scope
(Parent_Type
))
15694 and then Is_Private_Overriding
15695 and then Is_Abstract_Subprogram
(Visible_Subp
)
15697 if No
(Actual_Subp
) then
15698 Set_Alias
(New_Subp
, Visible_Subp
);
15699 Set_Is_Abstract_Subprogram
(New_Subp
, True);
15702 -- If this is a derivation for an instance of a formal derived
15703 -- type, abstractness comes from the primitive operation of the
15704 -- actual, not from the operation inherited from the ancestor.
15706 Set_Is_Abstract_Subprogram
15707 (New_Subp
, Is_Abstract_Subprogram
(Actual_Subp
));
15711 New_Overloaded_Entity
(New_Subp
, Derived_Type
);
15713 -- Ada RM 6.1.1 (15): If a subprogram inherits nonconforming class-wide
15714 -- preconditions and the derived type is abstract, the derived operation
15715 -- is abstract as well if parent subprogram is not abstract or null.
15717 if Is_Abstract_Type
(Derived_Type
)
15718 and then Has_Non_Trivial_Precondition
(Parent_Subp
)
15719 and then Present
(Interfaces
(Derived_Type
))
15722 -- Add useful attributes of subprogram before the freeze point,
15723 -- in case freezing is delayed or there are previous errors.
15725 Set_Is_Dispatching_Operation
(New_Subp
);
15728 Iface_Prim
: constant Entity_Id
:= Covered_Interface_Op
(New_Subp
);
15731 if Present
(Iface_Prim
)
15732 and then Has_Non_Trivial_Precondition
(Iface_Prim
)
15734 Set_Is_Abstract_Subprogram
(New_Subp
);
15739 -- Check for case of a derived subprogram for the instantiation of a
15740 -- formal derived tagged type, if so mark the subprogram as dispatching
15741 -- and inherit the dispatching attributes of the actual subprogram. The
15742 -- derived subprogram is effectively renaming of the actual subprogram,
15743 -- so it needs to have the same attributes as the actual.
15745 if Present
(Actual_Subp
)
15746 and then Is_Dispatching_Operation
(Actual_Subp
)
15748 Set_Is_Dispatching_Operation
(New_Subp
);
15750 if Present
(DTC_Entity
(Actual_Subp
)) then
15751 Set_DTC_Entity
(New_Subp
, DTC_Entity
(Actual_Subp
));
15752 Set_DT_Position_Value
(New_Subp
, DT_Position
(Actual_Subp
));
15756 -- Indicate that a derived subprogram does not require a body and that
15757 -- it does not require processing of default expressions.
15759 Set_Has_Completion
(New_Subp
);
15760 Set_Default_Expressions_Processed
(New_Subp
);
15762 if Ekind
(New_Subp
) = E_Function
then
15763 Set_Mechanism
(New_Subp
, Mechanism
(Parent_Subp
));
15765 end Derive_Subprogram
;
15767 ------------------------
15768 -- Derive_Subprograms --
15769 ------------------------
15771 procedure Derive_Subprograms
15772 (Parent_Type
: Entity_Id
;
15773 Derived_Type
: Entity_Id
;
15774 Generic_Actual
: Entity_Id
:= Empty
)
15776 Op_List
: constant Elist_Id
:=
15777 Collect_Primitive_Operations
(Parent_Type
);
15779 function Check_Derived_Type
return Boolean;
15780 -- Check that all the entities derived from Parent_Type are found in
15781 -- the list of primitives of Derived_Type exactly in the same order.
15783 procedure Derive_Interface_Subprogram
15784 (New_Subp
: out Entity_Id
;
15786 Actual_Subp
: Entity_Id
);
15787 -- Derive New_Subp from the ultimate alias of the parent subprogram Subp
15788 -- (which is an interface primitive). If Generic_Actual is present then
15789 -- Actual_Subp is the actual subprogram corresponding with the generic
15790 -- subprogram Subp.
15792 ------------------------
15793 -- Check_Derived_Type --
15794 ------------------------
15796 function Check_Derived_Type
return Boolean is
15800 New_Subp
: Entity_Id
;
15805 -- Traverse list of entities in the current scope searching for
15806 -- an incomplete type whose full-view is derived type.
15808 E
:= First_Entity
(Scope
(Derived_Type
));
15809 while Present
(E
) and then E
/= Derived_Type
loop
15810 if Ekind
(E
) = E_Incomplete_Type
15811 and then Present
(Full_View
(E
))
15812 and then Full_View
(E
) = Derived_Type
15814 -- Disable this test if Derived_Type completes an incomplete
15815 -- type because in such case more primitives can be added
15816 -- later to the list of primitives of Derived_Type by routine
15817 -- Process_Incomplete_Dependents
15822 E
:= Next_Entity
(E
);
15825 List
:= Collect_Primitive_Operations
(Derived_Type
);
15826 Elmt
:= First_Elmt
(List
);
15828 Op_Elmt
:= First_Elmt
(Op_List
);
15829 while Present
(Op_Elmt
) loop
15830 Subp
:= Node
(Op_Elmt
);
15831 New_Subp
:= Node
(Elmt
);
15833 -- At this early stage Derived_Type has no entities with attribute
15834 -- Interface_Alias. In addition, such primitives are always
15835 -- located at the end of the list of primitives of Parent_Type.
15836 -- Therefore, if found we can safely stop processing pending
15839 exit when Present
(Interface_Alias
(Subp
));
15841 -- Handle hidden entities
15843 if not Is_Predefined_Dispatching_Operation
(Subp
)
15844 and then Is_Hidden
(Subp
)
15846 if Present
(New_Subp
)
15847 and then Primitive_Names_Match
(Subp
, New_Subp
)
15853 if not Present
(New_Subp
)
15854 or else Ekind
(Subp
) /= Ekind
(New_Subp
)
15855 or else not Primitive_Names_Match
(Subp
, New_Subp
)
15863 Next_Elmt
(Op_Elmt
);
15867 end Check_Derived_Type
;
15869 ---------------------------------
15870 -- Derive_Interface_Subprogram --
15871 ---------------------------------
15873 procedure Derive_Interface_Subprogram
15874 (New_Subp
: out Entity_Id
;
15876 Actual_Subp
: Entity_Id
)
15878 Iface_Subp
: constant Entity_Id
:= Ultimate_Alias
(Subp
);
15879 Iface_Type
: constant Entity_Id
:= Find_Dispatching_Type
(Iface_Subp
);
15882 pragma Assert
(Is_Interface
(Iface_Type
));
15885 (New_Subp
=> New_Subp
,
15886 Parent_Subp
=> Iface_Subp
,
15887 Derived_Type
=> Derived_Type
,
15888 Parent_Type
=> Iface_Type
,
15889 Actual_Subp
=> Actual_Subp
);
15891 -- Given that this new interface entity corresponds with a primitive
15892 -- of the parent that was not overridden we must leave it associated
15893 -- with its parent primitive to ensure that it will share the same
15894 -- dispatch table slot when overridden. We must set the Alias to Subp
15895 -- (instead of Iface_Subp), and we must fix Is_Abstract_Subprogram
15896 -- (in case we inherited Subp from Iface_Type via a nonabstract
15897 -- generic formal type).
15899 if No
(Actual_Subp
) then
15900 Set_Alias
(New_Subp
, Subp
);
15903 T
: Entity_Id
:= Find_Dispatching_Type
(Subp
);
15905 while Etype
(T
) /= T
loop
15906 if Is_Generic_Type
(T
) and then not Is_Abstract_Type
(T
) then
15907 Set_Is_Abstract_Subprogram
(New_Subp
, False);
15915 -- For instantiations this is not needed since the previous call to
15916 -- Derive_Subprogram leaves the entity well decorated.
15919 pragma Assert
(Alias
(New_Subp
) = Actual_Subp
);
15922 end Derive_Interface_Subprogram
;
15926 Alias_Subp
: Entity_Id
;
15927 Act_List
: Elist_Id
;
15928 Act_Elmt
: Elmt_Id
;
15929 Act_Subp
: Entity_Id
:= Empty
;
15931 Need_Search
: Boolean := False;
15932 New_Subp
: Entity_Id
:= Empty
;
15933 Parent_Base
: Entity_Id
;
15936 -- Start of processing for Derive_Subprograms
15939 if Ekind
(Parent_Type
) = E_Record_Type_With_Private
15940 and then Has_Discriminants
(Parent_Type
)
15941 and then Present
(Full_View
(Parent_Type
))
15943 Parent_Base
:= Full_View
(Parent_Type
);
15945 Parent_Base
:= Parent_Type
;
15948 if Present
(Generic_Actual
) then
15949 Act_List
:= Collect_Primitive_Operations
(Generic_Actual
);
15950 Act_Elmt
:= First_Elmt
(Act_List
);
15952 Act_List
:= No_Elist
;
15953 Act_Elmt
:= No_Elmt
;
15956 -- Derive primitives inherited from the parent. Note that if the generic
15957 -- actual is present, this is not really a type derivation, it is a
15958 -- completion within an instance.
15960 -- Case 1: Derived_Type does not implement interfaces
15962 if not Is_Tagged_Type
(Derived_Type
)
15963 or else (not Has_Interfaces
(Derived_Type
)
15964 and then not (Present
(Generic_Actual
)
15965 and then Has_Interfaces
(Generic_Actual
)))
15967 Elmt
:= First_Elmt
(Op_List
);
15968 while Present
(Elmt
) loop
15969 Subp
:= Node
(Elmt
);
15971 -- Literals are derived earlier in the process of building the
15972 -- derived type, and are skipped here.
15974 if Ekind
(Subp
) = E_Enumeration_Literal
then
15977 -- The actual is a direct descendant and the common primitive
15978 -- operations appear in the same order.
15980 -- If the generic parent type is present, the derived type is an
15981 -- instance of a formal derived type, and within the instance its
15982 -- operations are those of the actual. We derive from the formal
15983 -- type but make the inherited operations aliases of the
15984 -- corresponding operations of the actual.
15987 pragma Assert
(No
(Node
(Act_Elmt
))
15988 or else (Primitive_Names_Match
(Subp
, Node
(Act_Elmt
))
15991 (Subp
, Node
(Act_Elmt
),
15992 Skip_Controlling_Formals
=> True)));
15995 (New_Subp
, Subp
, Derived_Type
, Parent_Base
, Node
(Act_Elmt
));
15997 if Present
(Act_Elmt
) then
15998 Next_Elmt
(Act_Elmt
);
16005 -- Case 2: Derived_Type implements interfaces
16008 -- If the parent type has no predefined primitives we remove
16009 -- predefined primitives from the list of primitives of generic
16010 -- actual to simplify the complexity of this algorithm.
16012 if Present
(Generic_Actual
) then
16014 Has_Predefined_Primitives
: Boolean := False;
16017 -- Check if the parent type has predefined primitives
16019 Elmt
:= First_Elmt
(Op_List
);
16020 while Present
(Elmt
) loop
16021 Subp
:= Node
(Elmt
);
16023 if Is_Predefined_Dispatching_Operation
(Subp
)
16024 and then not Comes_From_Source
(Ultimate_Alias
(Subp
))
16026 Has_Predefined_Primitives
:= True;
16033 -- Remove predefined primitives of Generic_Actual. We must use
16034 -- an auxiliary list because in case of tagged types the value
16035 -- returned by Collect_Primitive_Operations is the value stored
16036 -- in its Primitive_Operations attribute (and we don't want to
16037 -- modify its current contents).
16039 if not Has_Predefined_Primitives
then
16041 Aux_List
: constant Elist_Id
:= New_Elmt_List
;
16044 Elmt
:= First_Elmt
(Act_List
);
16045 while Present
(Elmt
) loop
16046 Subp
:= Node
(Elmt
);
16048 if not Is_Predefined_Dispatching_Operation
(Subp
)
16049 or else Comes_From_Source
(Subp
)
16051 Append_Elmt
(Subp
, Aux_List
);
16057 Act_List
:= Aux_List
;
16061 Act_Elmt
:= First_Elmt
(Act_List
);
16062 Act_Subp
:= Node
(Act_Elmt
);
16066 -- Stage 1: If the generic actual is not present we derive the
16067 -- primitives inherited from the parent type. If the generic parent
16068 -- type is present, the derived type is an instance of a formal
16069 -- derived type, and within the instance its operations are those of
16070 -- the actual. We derive from the formal type but make the inherited
16071 -- operations aliases of the corresponding operations of the actual.
16073 Elmt
:= First_Elmt
(Op_List
);
16074 while Present
(Elmt
) loop
16075 Subp
:= Node
(Elmt
);
16076 Alias_Subp
:= Ultimate_Alias
(Subp
);
16078 -- Do not derive internal entities of the parent that link
16079 -- interface primitives with their covering primitive. These
16080 -- entities will be added to this type when frozen.
16082 if Present
(Interface_Alias
(Subp
)) then
16086 -- If the generic actual is present find the corresponding
16087 -- operation in the generic actual. If the parent type is a
16088 -- direct ancestor of the derived type then, even if it is an
16089 -- interface, the operations are inherited from the primary
16090 -- dispatch table and are in the proper order. If we detect here
16091 -- that primitives are not in the same order we traverse the list
16092 -- of primitive operations of the actual to find the one that
16093 -- implements the interface primitive.
16097 (Present
(Generic_Actual
)
16098 and then Present
(Act_Subp
)
16100 (Primitive_Names_Match
(Subp
, Act_Subp
)
16102 Type_Conformant
(Subp
, Act_Subp
,
16103 Skip_Controlling_Formals
=> True)))
16105 pragma Assert
(not Is_Ancestor
(Parent_Base
, Generic_Actual
,
16106 Use_Full_View
=> True));
16108 -- Remember that we need searching for all pending primitives
16110 Need_Search
:= True;
16112 -- Handle entities associated with interface primitives
16114 if Present
(Alias_Subp
)
16115 and then Is_Interface
(Find_Dispatching_Type
(Alias_Subp
))
16116 and then not Is_Predefined_Dispatching_Operation
(Subp
)
16118 -- Search for the primitive in the homonym chain
16121 Find_Primitive_Covering_Interface
16122 (Tagged_Type
=> Generic_Actual
,
16123 Iface_Prim
=> Alias_Subp
);
16125 -- Previous search may not locate primitives covering
16126 -- interfaces defined in generics units or instantiations.
16127 -- (it fails if the covering primitive has formals whose
16128 -- type is also defined in generics or instantiations).
16129 -- In such case we search in the list of primitives of the
16130 -- generic actual for the internal entity that links the
16131 -- interface primitive and the covering primitive.
16134 and then Is_Generic_Type
(Parent_Type
)
16136 -- This code has been designed to handle only generic
16137 -- formals that implement interfaces that are defined
16138 -- in a generic unit or instantiation. If this code is
16139 -- needed for other cases we must review it because
16140 -- (given that it relies on Original_Location to locate
16141 -- the primitive of Generic_Actual that covers the
16142 -- interface) it could leave linked through attribute
16143 -- Alias entities of unrelated instantiations).
16147 (Scope
(Find_Dispatching_Type
(Alias_Subp
)))
16149 Instantiation_Depth
16150 (Sloc
(Find_Dispatching_Type
(Alias_Subp
))) > 0);
16153 Iface_Prim_Loc
: constant Source_Ptr
:=
16154 Original_Location
(Sloc
(Alias_Subp
));
16161 First_Elmt
(Primitive_Operations
(Generic_Actual
));
16163 Search
: while Present
(Elmt
) loop
16164 Prim
:= Node
(Elmt
);
16166 if Present
(Interface_Alias
(Prim
))
16167 and then Original_Location
16168 (Sloc
(Interface_Alias
(Prim
))) =
16171 Act_Subp
:= Alias
(Prim
);
16180 pragma Assert
(Present
(Act_Subp
)
16181 or else Is_Abstract_Type
(Generic_Actual
)
16182 or else Serious_Errors_Detected
> 0);
16184 -- Handle predefined primitives plus the rest of user-defined
16188 Act_Elmt
:= First_Elmt
(Act_List
);
16189 while Present
(Act_Elmt
) loop
16190 Act_Subp
:= Node
(Act_Elmt
);
16192 exit when Primitive_Names_Match
(Subp
, Act_Subp
)
16193 and then Type_Conformant
16195 Skip_Controlling_Formals
=> True)
16196 and then No
(Interface_Alias
(Act_Subp
));
16198 Next_Elmt
(Act_Elmt
);
16201 if No
(Act_Elmt
) then
16207 -- Case 1: If the parent is a limited interface then it has the
16208 -- predefined primitives of synchronized interfaces. However, the
16209 -- actual type may be a non-limited type and hence it does not
16210 -- have such primitives.
16212 if Present
(Generic_Actual
)
16213 and then not Present
(Act_Subp
)
16214 and then Is_Limited_Interface
(Parent_Base
)
16215 and then Is_Predefined_Interface_Primitive
(Subp
)
16219 -- Case 2: Inherit entities associated with interfaces that were
16220 -- not covered by the parent type. We exclude here null interface
16221 -- primitives because they do not need special management.
16223 -- We also exclude interface operations that are renamings. If the
16224 -- subprogram is an explicit renaming of an interface primitive,
16225 -- it is a regular primitive operation, and the presence of its
16226 -- alias is not relevant: it has to be derived like any other
16229 elsif Present
(Alias
(Subp
))
16230 and then Nkind
(Unit_Declaration_Node
(Subp
)) /=
16231 N_Subprogram_Renaming_Declaration
16232 and then Is_Interface
(Find_Dispatching_Type
(Alias_Subp
))
16234 (Nkind
(Parent
(Alias_Subp
)) = N_Procedure_Specification
16235 and then Null_Present
(Parent
(Alias_Subp
)))
16237 -- If this is an abstract private type then we transfer the
16238 -- derivation of the interface primitive from the partial view
16239 -- to the full view. This is safe because all the interfaces
16240 -- must be visible in the partial view. Done to avoid adding
16241 -- a new interface derivation to the private part of the
16242 -- enclosing package; otherwise this new derivation would be
16243 -- decorated as hidden when the analysis of the enclosing
16244 -- package completes.
16246 if Is_Abstract_Type
(Derived_Type
)
16247 and then In_Private_Part
(Current_Scope
)
16248 and then Has_Private_Declaration
(Derived_Type
)
16251 Partial_View
: Entity_Id
;
16256 Partial_View
:= First_Entity
(Current_Scope
);
16258 exit when No
(Partial_View
)
16259 or else (Has_Private_Declaration
(Partial_View
)
16261 Full_View
(Partial_View
) = Derived_Type
);
16263 Next_Entity
(Partial_View
);
16266 -- If the partial view was not found then the source code
16267 -- has errors and the derivation is not needed.
16269 if Present
(Partial_View
) then
16271 First_Elmt
(Primitive_Operations
(Partial_View
));
16272 while Present
(Elmt
) loop
16273 Ent
:= Node
(Elmt
);
16275 if Present
(Alias
(Ent
))
16276 and then Ultimate_Alias
(Ent
) = Alias
(Subp
)
16279 (Ent
, Primitive_Operations
(Derived_Type
));
16286 -- If the interface primitive was not found in the
16287 -- partial view then this interface primitive was
16288 -- overridden. We add a derivation to activate in
16289 -- Derive_Progenitor_Subprograms the machinery to
16293 Derive_Interface_Subprogram
16294 (New_Subp
=> New_Subp
,
16296 Actual_Subp
=> Act_Subp
);
16301 Derive_Interface_Subprogram
16302 (New_Subp
=> New_Subp
,
16304 Actual_Subp
=> Act_Subp
);
16307 -- Case 3: Common derivation
16311 (New_Subp
=> New_Subp
,
16312 Parent_Subp
=> Subp
,
16313 Derived_Type
=> Derived_Type
,
16314 Parent_Type
=> Parent_Base
,
16315 Actual_Subp
=> Act_Subp
);
16318 -- No need to update Act_Elm if we must search for the
16319 -- corresponding operation in the generic actual
16322 and then Present
(Act_Elmt
)
16324 Next_Elmt
(Act_Elmt
);
16325 Act_Subp
:= Node
(Act_Elmt
);
16332 -- Inherit additional operations from progenitors. If the derived
16333 -- type is a generic actual, there are not new primitive operations
16334 -- for the type because it has those of the actual, and therefore
16335 -- nothing needs to be done. The renamings generated above are not
16336 -- primitive operations, and their purpose is simply to make the
16337 -- proper operations visible within an instantiation.
16339 if No
(Generic_Actual
) then
16340 Derive_Progenitor_Subprograms
(Parent_Base
, Derived_Type
);
16344 -- Final check: Direct descendants must have their primitives in the
16345 -- same order. We exclude from this test untagged types and instances
16346 -- of formal derived types. We skip this test if we have already
16347 -- reported serious errors in the sources.
16349 pragma Assert
(not Is_Tagged_Type
(Derived_Type
)
16350 or else Present
(Generic_Actual
)
16351 or else Serious_Errors_Detected
> 0
16352 or else Check_Derived_Type
);
16353 end Derive_Subprograms
;
16355 --------------------------------
16356 -- Derived_Standard_Character --
16357 --------------------------------
16359 procedure Derived_Standard_Character
16361 Parent_Type
: Entity_Id
;
16362 Derived_Type
: Entity_Id
)
16364 Loc
: constant Source_Ptr
:= Sloc
(N
);
16365 Def
: constant Node_Id
:= Type_Definition
(N
);
16366 Indic
: constant Node_Id
:= Subtype_Indication
(Def
);
16367 Parent_Base
: constant Entity_Id
:= Base_Type
(Parent_Type
);
16368 Implicit_Base
: constant Entity_Id
:=
16370 (E_Enumeration_Type
, N
, Derived_Type
, 'B');
16376 Discard_Node
(Process_Subtype
(Indic
, N
));
16378 Set_Etype
(Implicit_Base
, Parent_Base
);
16379 Set_Size_Info
(Implicit_Base
, Root_Type
(Parent_Type
));
16380 Set_RM_Size
(Implicit_Base
, RM_Size
(Root_Type
(Parent_Type
)));
16382 Set_Is_Character_Type
(Implicit_Base
, True);
16383 Set_Has_Delayed_Freeze
(Implicit_Base
);
16385 -- The bounds of the implicit base are the bounds of the parent base.
16386 -- Note that their type is the parent base.
16388 Lo
:= New_Copy_Tree
(Type_Low_Bound
(Parent_Base
));
16389 Hi
:= New_Copy_Tree
(Type_High_Bound
(Parent_Base
));
16391 Set_Scalar_Range
(Implicit_Base
,
16394 High_Bound
=> Hi
));
16396 Conditional_Delay
(Derived_Type
, Parent_Type
);
16398 Set_Ekind
(Derived_Type
, E_Enumeration_Subtype
);
16399 Set_Etype
(Derived_Type
, Implicit_Base
);
16400 Set_Size_Info
(Derived_Type
, Parent_Type
);
16402 if Unknown_RM_Size
(Derived_Type
) then
16403 Set_RM_Size
(Derived_Type
, RM_Size
(Parent_Type
));
16406 Set_Is_Character_Type
(Derived_Type
, True);
16408 if Nkind
(Indic
) /= N_Subtype_Indication
then
16410 -- If no explicit constraint, the bounds are those
16411 -- of the parent type.
16413 Lo
:= New_Copy_Tree
(Type_Low_Bound
(Parent_Type
));
16414 Hi
:= New_Copy_Tree
(Type_High_Bound
(Parent_Type
));
16415 Set_Scalar_Range
(Derived_Type
, Make_Range
(Loc
, Lo
, Hi
));
16418 Convert_Scalar_Bounds
(N
, Parent_Type
, Derived_Type
, Loc
);
16420 -- Because the implicit base is used in the conversion of the bounds, we
16421 -- have to freeze it now. This is similar to what is done for numeric
16422 -- types, and it equally suspicious, but otherwise a non-static bound
16423 -- will have a reference to an unfrozen type, which is rejected by Gigi
16424 -- (???). This requires specific care for definition of stream
16425 -- attributes. For details, see comments at the end of
16426 -- Build_Derived_Numeric_Type.
16428 Freeze_Before
(N
, Implicit_Base
);
16429 end Derived_Standard_Character
;
16431 ------------------------------
16432 -- Derived_Type_Declaration --
16433 ------------------------------
16435 procedure Derived_Type_Declaration
16438 Is_Completion
: Boolean)
16440 Parent_Type
: Entity_Id
;
16442 function Comes_From_Generic
(Typ
: Entity_Id
) return Boolean;
16443 -- Check whether the parent type is a generic formal, or derives
16444 -- directly or indirectly from one.
16446 ------------------------
16447 -- Comes_From_Generic --
16448 ------------------------
16450 function Comes_From_Generic
(Typ
: Entity_Id
) return Boolean is
16452 if Is_Generic_Type
(Typ
) then
16455 elsif Is_Generic_Type
(Root_Type
(Parent_Type
)) then
16458 elsif Is_Private_Type
(Typ
)
16459 and then Present
(Full_View
(Typ
))
16460 and then Is_Generic_Type
(Root_Type
(Full_View
(Typ
)))
16464 elsif Is_Generic_Actual_Type
(Typ
) then
16470 end Comes_From_Generic
;
16474 Def
: constant Node_Id
:= Type_Definition
(N
);
16475 Iface_Def
: Node_Id
;
16476 Indic
: constant Node_Id
:= Subtype_Indication
(Def
);
16477 Extension
: constant Node_Id
:= Record_Extension_Part
(Def
);
16478 Parent_Node
: Node_Id
;
16481 -- Start of processing for Derived_Type_Declaration
16484 Parent_Type
:= Find_Type_Of_Subtype_Indic
(Indic
);
16487 and then Is_Tagged_Type
(Parent_Type
)
16490 Partial_View
: constant Entity_Id
:=
16491 Incomplete_Or_Partial_View
(Parent_Type
);
16494 -- If the partial view was not found then the parent type is not
16495 -- a private type. Otherwise check if the partial view is a tagged
16498 if Present
(Partial_View
)
16499 and then Is_Private_Type
(Partial_View
)
16500 and then not Is_Tagged_Type
(Partial_View
)
16503 ("cannot derive from & declared as untagged private "
16504 & "(SPARK RM 3.4(1))", N
, Partial_View
);
16509 -- Ada 2005 (AI-251): In case of interface derivation check that the
16510 -- parent is also an interface.
16512 if Interface_Present
(Def
) then
16513 Check_SPARK_05_Restriction
("interface is not allowed", Def
);
16515 if not Is_Interface
(Parent_Type
) then
16516 Diagnose_Interface
(Indic
, Parent_Type
);
16519 Parent_Node
:= Parent
(Base_Type
(Parent_Type
));
16520 Iface_Def
:= Type_Definition
(Parent_Node
);
16522 -- Ada 2005 (AI-251): Limited interfaces can only inherit from
16523 -- other limited interfaces.
16525 if Limited_Present
(Def
) then
16526 if Limited_Present
(Iface_Def
) then
16529 elsif Protected_Present
(Iface_Def
) then
16531 ("descendant of & must be declared as a protected "
16532 & "interface", N
, Parent_Type
);
16534 elsif Synchronized_Present
(Iface_Def
) then
16536 ("descendant of & must be declared as a synchronized "
16537 & "interface", N
, Parent_Type
);
16539 elsif Task_Present
(Iface_Def
) then
16541 ("descendant of & must be declared as a task interface",
16546 ("(Ada 2005) limited interface cannot inherit from "
16547 & "non-limited interface", Indic
);
16550 -- Ada 2005 (AI-345): Non-limited interfaces can only inherit
16551 -- from non-limited or limited interfaces.
16553 elsif not Protected_Present
(Def
)
16554 and then not Synchronized_Present
(Def
)
16555 and then not Task_Present
(Def
)
16557 if Limited_Present
(Iface_Def
) then
16560 elsif Protected_Present
(Iface_Def
) then
16562 ("descendant of & must be declared as a protected "
16563 & "interface", N
, Parent_Type
);
16565 elsif Synchronized_Present
(Iface_Def
) then
16567 ("descendant of & must be declared as a synchronized "
16568 & "interface", N
, Parent_Type
);
16570 elsif Task_Present
(Iface_Def
) then
16572 ("descendant of & must be declared as a task interface",
16581 if Is_Tagged_Type
(Parent_Type
)
16582 and then Is_Concurrent_Type
(Parent_Type
)
16583 and then not Is_Interface
(Parent_Type
)
16586 ("parent type of a record extension cannot be a synchronized "
16587 & "tagged type (RM 3.9.1 (3/1))", N
);
16588 Set_Etype
(T
, Any_Type
);
16592 -- Ada 2005 (AI-251): Decorate all the names in the list of ancestor
16595 if Is_Tagged_Type
(Parent_Type
)
16596 and then Is_Non_Empty_List
(Interface_List
(Def
))
16603 Intf
:= First
(Interface_List
(Def
));
16604 while Present
(Intf
) loop
16605 T
:= Find_Type_Of_Subtype_Indic
(Intf
);
16607 if not Is_Interface
(T
) then
16608 Diagnose_Interface
(Intf
, T
);
16610 -- Check the rules of 3.9.4(12/2) and 7.5(2/2) that disallow
16611 -- a limited type from having a nonlimited progenitor.
16613 elsif (Limited_Present
(Def
)
16614 or else (not Is_Interface
(Parent_Type
)
16615 and then Is_Limited_Type
(Parent_Type
)))
16616 and then not Is_Limited_Interface
(T
)
16619 ("progenitor interface& of limited type must be limited",
16628 if Parent_Type
= Any_Type
16629 or else Etype
(Parent_Type
) = Any_Type
16630 or else (Is_Class_Wide_Type
(Parent_Type
)
16631 and then Etype
(Parent_Type
) = T
)
16633 -- If Parent_Type is undefined or illegal, make new type into a
16634 -- subtype of Any_Type, and set a few attributes to prevent cascaded
16635 -- errors. If this is a self-definition, emit error now.
16637 if T
= Parent_Type
or else T
= Etype
(Parent_Type
) then
16638 Error_Msg_N
("type cannot be used in its own definition", Indic
);
16641 Set_Ekind
(T
, Ekind
(Parent_Type
));
16642 Set_Etype
(T
, Any_Type
);
16643 Set_Scalar_Range
(T
, Scalar_Range
(Any_Type
));
16645 if Is_Tagged_Type
(T
)
16646 and then Is_Record_Type
(T
)
16648 Set_Direct_Primitive_Operations
(T
, New_Elmt_List
);
16654 -- Ada 2005 (AI-251): The case in which the parent of the full-view is
16655 -- an interface is special because the list of interfaces in the full
16656 -- view can be given in any order. For example:
16658 -- type A is interface;
16659 -- type B is interface and A;
16660 -- type D is new B with private;
16662 -- type D is new A and B with null record; -- 1 --
16664 -- In this case we perform the following transformation of -1-:
16666 -- type D is new B and A with null record;
16668 -- If the parent of the full-view covers the parent of the partial-view
16669 -- we have two possible cases:
16671 -- 1) They have the same parent
16672 -- 2) The parent of the full-view implements some further interfaces
16674 -- In both cases we do not need to perform the transformation. In the
16675 -- first case the source program is correct and the transformation is
16676 -- not needed; in the second case the source program does not fulfill
16677 -- the no-hidden interfaces rule (AI-396) and the error will be reported
16680 -- This transformation not only simplifies the rest of the analysis of
16681 -- this type declaration but also simplifies the correct generation of
16682 -- the object layout to the expander.
16684 if In_Private_Part
(Current_Scope
)
16685 and then Is_Interface
(Parent_Type
)
16689 Partial_View
: Entity_Id
;
16690 Partial_View_Parent
: Entity_Id
;
16691 New_Iface
: Node_Id
;
16694 -- Look for the associated private type declaration
16696 Partial_View
:= Incomplete_Or_Partial_View
(T
);
16698 -- If the partial view was not found then the source code has
16699 -- errors and the transformation is not needed.
16701 if Present
(Partial_View
) then
16702 Partial_View_Parent
:= Etype
(Partial_View
);
16704 -- If the parent of the full-view covers the parent of the
16705 -- partial-view we have nothing else to do.
16707 if Interface_Present_In_Ancestor
16708 (Parent_Type
, Partial_View_Parent
)
16712 -- Traverse the list of interfaces of the full-view to look
16713 -- for the parent of the partial-view and perform the tree
16717 Iface
:= First
(Interface_List
(Def
));
16718 while Present
(Iface
) loop
16719 if Etype
(Iface
) = Etype
(Partial_View
) then
16720 Rewrite
(Subtype_Indication
(Def
),
16721 New_Copy
(Subtype_Indication
16722 (Parent
(Partial_View
))));
16725 Make_Identifier
(Sloc
(N
), Chars
(Parent_Type
));
16726 Append
(New_Iface
, Interface_List
(Def
));
16728 -- Analyze the transformed code
16730 Derived_Type_Declaration
(T
, N
, Is_Completion
);
16741 -- Only composite types other than array types are allowed to have
16744 if Present
(Discriminant_Specifications
(N
)) then
16745 if (Is_Elementary_Type
(Parent_Type
)
16747 Is_Array_Type
(Parent_Type
))
16748 and then not Error_Posted
(N
)
16751 ("elementary or array type cannot have discriminants",
16752 Defining_Identifier
(First
(Discriminant_Specifications
(N
))));
16754 -- Unset Has_Discriminants flag to prevent cascaded errors, but
16755 -- only if we are not already processing a malformed syntax tree.
16757 if Is_Type
(T
) then
16758 Set_Has_Discriminants
(T
, False);
16761 -- The type is allowed to have discriminants
16764 Check_SPARK_05_Restriction
("discriminant type is not allowed", N
);
16768 -- In Ada 83, a derived type defined in a package specification cannot
16769 -- be used for further derivation until the end of its visible part.
16770 -- Note that derivation in the private part of the package is allowed.
16772 if Ada_Version
= Ada_83
16773 and then Is_Derived_Type
(Parent_Type
)
16774 and then In_Visible_Part
(Scope
(Parent_Type
))
16776 if Ada_Version
= Ada_83
and then Comes_From_Source
(Indic
) then
16778 ("(Ada 83): premature use of type for derivation", Indic
);
16782 -- Check for early use of incomplete or private type
16784 if Ekind_In
(Parent_Type
, E_Void
, E_Incomplete_Type
) then
16785 Error_Msg_N
("premature derivation of incomplete type", Indic
);
16788 elsif (Is_Incomplete_Or_Private_Type
(Parent_Type
)
16789 and then not Comes_From_Generic
(Parent_Type
))
16790 or else Has_Private_Component
(Parent_Type
)
16792 -- The ancestor type of a formal type can be incomplete, in which
16793 -- case only the operations of the partial view are available in the
16794 -- generic. Subsequent checks may be required when the full view is
16795 -- analyzed to verify that a derivation from a tagged type has an
16798 if Nkind
(Original_Node
(N
)) = N_Formal_Type_Declaration
then
16801 elsif No
(Underlying_Type
(Parent_Type
))
16802 or else Has_Private_Component
(Parent_Type
)
16805 ("premature derivation of derived or private type", Indic
);
16807 -- Flag the type itself as being in error, this prevents some
16808 -- nasty problems with subsequent uses of the malformed type.
16810 Set_Error_Posted
(T
);
16812 -- Check that within the immediate scope of an untagged partial
16813 -- view it's illegal to derive from the partial view if the
16814 -- full view is tagged. (7.3(7))
16816 -- We verify that the Parent_Type is a partial view by checking
16817 -- that it is not a Full_Type_Declaration (i.e. a private type or
16818 -- private extension declaration), to distinguish a partial view
16819 -- from a derivation from a private type which also appears as
16820 -- E_Private_Type. If the parent base type is not declared in an
16821 -- enclosing scope there is no need to check.
16823 elsif Present
(Full_View
(Parent_Type
))
16824 and then Nkind
(Parent
(Parent_Type
)) /= N_Full_Type_Declaration
16825 and then not Is_Tagged_Type
(Parent_Type
)
16826 and then Is_Tagged_Type
(Full_View
(Parent_Type
))
16827 and then In_Open_Scopes
(Scope
(Base_Type
(Parent_Type
)))
16830 ("premature derivation from type with tagged full view",
16835 -- Check that form of derivation is appropriate
16837 Taggd
:= Is_Tagged_Type
(Parent_Type
);
16839 -- Set the parent type to the class-wide type's specific type in this
16840 -- case to prevent cascading errors
16842 if Present
(Extension
) and then Is_Class_Wide_Type
(Parent_Type
) then
16843 Error_Msg_N
("parent type must not be a class-wide type", Indic
);
16844 Set_Etype
(T
, Etype
(Parent_Type
));
16848 if Present
(Extension
) and then not Taggd
then
16850 ("type derived from untagged type cannot have extension", Indic
);
16852 elsif No
(Extension
) and then Taggd
then
16854 -- If this declaration is within a private part (or body) of a
16855 -- generic instantiation then the derivation is allowed (the parent
16856 -- type can only appear tagged in this case if it's a generic actual
16857 -- type, since it would otherwise have been rejected in the analysis
16858 -- of the generic template).
16860 if not Is_Generic_Actual_Type
(Parent_Type
)
16861 or else In_Visible_Part
(Scope
(Parent_Type
))
16863 if Is_Class_Wide_Type
(Parent_Type
) then
16865 ("parent type must not be a class-wide type", Indic
);
16867 -- Use specific type to prevent cascaded errors.
16869 Parent_Type
:= Etype
(Parent_Type
);
16873 ("type derived from tagged type must have extension", Indic
);
16878 -- AI-443: Synchronized formal derived types require a private
16879 -- extension. There is no point in checking the ancestor type or
16880 -- the progenitors since the construct is wrong to begin with.
16882 if Ada_Version
>= Ada_2005
16883 and then Is_Generic_Type
(T
)
16884 and then Present
(Original_Node
(N
))
16887 Decl
: constant Node_Id
:= Original_Node
(N
);
16890 if Nkind
(Decl
) = N_Formal_Type_Declaration
16891 and then Nkind
(Formal_Type_Definition
(Decl
)) =
16892 N_Formal_Derived_Type_Definition
16893 and then Synchronized_Present
(Formal_Type_Definition
(Decl
))
16894 and then No
(Extension
)
16896 -- Avoid emitting a duplicate error message
16898 and then not Error_Posted
(Indic
)
16901 ("synchronized derived type must have extension", N
);
16906 if Null_Exclusion_Present
(Def
)
16907 and then not Is_Access_Type
(Parent_Type
)
16909 Error_Msg_N
("null exclusion can only apply to an access type", N
);
16912 -- Avoid deriving parent primitives of underlying record views
16914 Build_Derived_Type
(N
, Parent_Type
, T
, Is_Completion
,
16915 Derive_Subps
=> not Is_Underlying_Record_View
(T
));
16917 -- AI-419: The parent type of an explicitly limited derived type must
16918 -- be a limited type or a limited interface.
16920 if Limited_Present
(Def
) then
16921 Set_Is_Limited_Record
(T
);
16923 if Is_Interface
(T
) then
16924 Set_Is_Limited_Interface
(T
);
16927 if not Is_Limited_Type
(Parent_Type
)
16929 (not Is_Interface
(Parent_Type
)
16930 or else not Is_Limited_Interface
(Parent_Type
))
16932 -- AI05-0096: a derivation in the private part of an instance is
16933 -- legal if the generic formal is untagged limited, and the actual
16936 if Is_Generic_Actual_Type
(Parent_Type
)
16937 and then In_Private_Part
(Current_Scope
)
16940 (Generic_Parent_Type
(Parent
(Parent_Type
)))
16946 ("parent type& of limited type must be limited",
16952 -- In SPARK, there are no derived type definitions other than type
16953 -- extensions of tagged record types.
16955 if No
(Extension
) then
16956 Check_SPARK_05_Restriction
16957 ("derived type is not allowed", Original_Node
(N
));
16959 end Derived_Type_Declaration
;
16961 ------------------------
16962 -- Diagnose_Interface --
16963 ------------------------
16965 procedure Diagnose_Interface
(N
: Node_Id
; E
: Entity_Id
) is
16967 if not Is_Interface
(E
) and then E
/= Any_Type
then
16968 Error_Msg_NE
("(Ada 2005) & must be an interface", N
, E
);
16970 end Diagnose_Interface
;
16972 ----------------------------------
16973 -- Enumeration_Type_Declaration --
16974 ----------------------------------
16976 procedure Enumeration_Type_Declaration
(T
: Entity_Id
; Def
: Node_Id
) is
16983 -- Create identifier node representing lower bound
16985 B_Node
:= New_Node
(N_Identifier
, Sloc
(Def
));
16986 L
:= First
(Literals
(Def
));
16987 Set_Chars
(B_Node
, Chars
(L
));
16988 Set_Entity
(B_Node
, L
);
16989 Set_Etype
(B_Node
, T
);
16990 Set_Is_Static_Expression
(B_Node
, True);
16992 R_Node
:= New_Node
(N_Range
, Sloc
(Def
));
16993 Set_Low_Bound
(R_Node
, B_Node
);
16995 Set_Ekind
(T
, E_Enumeration_Type
);
16996 Set_First_Literal
(T
, L
);
16998 Set_Is_Constrained
(T
);
17002 -- Loop through literals of enumeration type setting pos and rep values
17003 -- except that if the Ekind is already set, then it means the literal
17004 -- was already constructed (case of a derived type declaration and we
17005 -- should not disturb the Pos and Rep values.
17007 while Present
(L
) loop
17008 if Ekind
(L
) /= E_Enumeration_Literal
then
17009 Set_Ekind
(L
, E_Enumeration_Literal
);
17010 Set_Enumeration_Pos
(L
, Ev
);
17011 Set_Enumeration_Rep
(L
, Ev
);
17012 Set_Is_Known_Valid
(L
, True);
17016 New_Overloaded_Entity
(L
);
17017 Generate_Definition
(L
);
17018 Set_Convention
(L
, Convention_Intrinsic
);
17020 -- Case of character literal
17022 if Nkind
(L
) = N_Defining_Character_Literal
then
17023 Set_Is_Character_Type
(T
, True);
17025 -- Check violation of No_Wide_Characters
17027 if Restriction_Check_Required
(No_Wide_Characters
) then
17028 Get_Name_String
(Chars
(L
));
17030 if Name_Len
>= 3 and then Name_Buffer
(1 .. 2) = "QW" then
17031 Check_Restriction
(No_Wide_Characters
, L
);
17040 -- Now create a node representing upper bound
17042 B_Node
:= New_Node
(N_Identifier
, Sloc
(Def
));
17043 Set_Chars
(B_Node
, Chars
(Last
(Literals
(Def
))));
17044 Set_Entity
(B_Node
, Last
(Literals
(Def
)));
17045 Set_Etype
(B_Node
, T
);
17046 Set_Is_Static_Expression
(B_Node
, True);
17048 Set_High_Bound
(R_Node
, B_Node
);
17050 -- Initialize various fields of the type. Some of this information
17051 -- may be overwritten later through rep.clauses.
17053 Set_Scalar_Range
(T
, R_Node
);
17054 Set_RM_Size
(T
, UI_From_Int
(Minimum_Size
(T
)));
17055 Set_Enum_Esize
(T
);
17056 Set_Enum_Pos_To_Rep
(T
, Empty
);
17058 -- Set Discard_Names if configuration pragma set, or if there is
17059 -- a parameterless pragma in the current declarative region
17061 if Global_Discard_Names
or else Discard_Names
(Scope
(T
)) then
17062 Set_Discard_Names
(T
);
17065 -- Process end label if there is one
17067 if Present
(Def
) then
17068 Process_End_Label
(Def
, 'e', T
);
17070 end Enumeration_Type_Declaration
;
17072 ---------------------------------
17073 -- Expand_To_Stored_Constraint --
17074 ---------------------------------
17076 function Expand_To_Stored_Constraint
17078 Constraint
: Elist_Id
) return Elist_Id
17080 Explicitly_Discriminated_Type
: Entity_Id
;
17081 Expansion
: Elist_Id
;
17082 Discriminant
: Entity_Id
;
17084 function Type_With_Explicit_Discrims
(Id
: Entity_Id
) return Entity_Id
;
17085 -- Find the nearest type that actually specifies discriminants
17087 ---------------------------------
17088 -- Type_With_Explicit_Discrims --
17089 ---------------------------------
17091 function Type_With_Explicit_Discrims
(Id
: Entity_Id
) return Entity_Id
is
17092 Typ
: constant E
:= Base_Type
(Id
);
17095 if Ekind
(Typ
) in Incomplete_Or_Private_Kind
then
17096 if Present
(Full_View
(Typ
)) then
17097 return Type_With_Explicit_Discrims
(Full_View
(Typ
));
17101 if Has_Discriminants
(Typ
) then
17106 if Etype
(Typ
) = Typ
then
17108 elsif Has_Discriminants
(Typ
) then
17111 return Type_With_Explicit_Discrims
(Etype
(Typ
));
17114 end Type_With_Explicit_Discrims
;
17116 -- Start of processing for Expand_To_Stored_Constraint
17119 if No
(Constraint
) or else Is_Empty_Elmt_List
(Constraint
) then
17123 Explicitly_Discriminated_Type
:= Type_With_Explicit_Discrims
(Typ
);
17125 if No
(Explicitly_Discriminated_Type
) then
17129 Expansion
:= New_Elmt_List
;
17132 First_Stored_Discriminant
(Explicitly_Discriminated_Type
);
17133 while Present
(Discriminant
) loop
17135 (Get_Discriminant_Value
17136 (Discriminant
, Explicitly_Discriminated_Type
, Constraint
),
17138 Next_Stored_Discriminant
(Discriminant
);
17142 end Expand_To_Stored_Constraint
;
17144 ---------------------------
17145 -- Find_Hidden_Interface --
17146 ---------------------------
17148 function Find_Hidden_Interface
17150 Dest
: Elist_Id
) return Entity_Id
17153 Iface_Elmt
: Elmt_Id
;
17156 if Present
(Src
) and then Present
(Dest
) then
17157 Iface_Elmt
:= First_Elmt
(Src
);
17158 while Present
(Iface_Elmt
) loop
17159 Iface
:= Node
(Iface_Elmt
);
17161 if Is_Interface
(Iface
)
17162 and then not Contain_Interface
(Iface
, Dest
)
17167 Next_Elmt
(Iface_Elmt
);
17172 end Find_Hidden_Interface
;
17174 --------------------
17175 -- Find_Type_Name --
17176 --------------------
17178 function Find_Type_Name
(N
: Node_Id
) return Entity_Id
is
17179 Id
: constant Entity_Id
:= Defining_Identifier
(N
);
17180 New_Id
: Entity_Id
;
17182 Prev_Par
: Node_Id
;
17184 procedure Check_Duplicate_Aspects
;
17185 -- Check that aspects specified in a completion have not been specified
17186 -- already in the partial view.
17188 procedure Tag_Mismatch
;
17189 -- Diagnose a tagged partial view whose full view is untagged. We post
17190 -- the message on the full view, with a reference to the previous
17191 -- partial view. The partial view can be private or incomplete, and
17192 -- these are handled in a different manner, so we determine the position
17193 -- of the error message from the respective slocs of both.
17195 -----------------------------
17196 -- Check_Duplicate_Aspects --
17197 -----------------------------
17199 procedure Check_Duplicate_Aspects
is
17200 function Get_Partial_View_Aspect
(Asp
: Node_Id
) return Node_Id
;
17201 -- Return the corresponding aspect of the partial view which matches
17202 -- the aspect id of Asp. Return Empty is no such aspect exists.
17204 -----------------------------
17205 -- Get_Partial_View_Aspect --
17206 -----------------------------
17208 function Get_Partial_View_Aspect
(Asp
: Node_Id
) return Node_Id
is
17209 Asp_Id
: constant Aspect_Id
:= Get_Aspect_Id
(Asp
);
17210 Prev_Asps
: constant List_Id
:= Aspect_Specifications
(Prev_Par
);
17211 Prev_Asp
: Node_Id
;
17214 if Present
(Prev_Asps
) then
17215 Prev_Asp
:= First
(Prev_Asps
);
17216 while Present
(Prev_Asp
) loop
17217 if Get_Aspect_Id
(Prev_Asp
) = Asp_Id
then
17226 end Get_Partial_View_Aspect
;
17230 Full_Asps
: constant List_Id
:= Aspect_Specifications
(N
);
17231 Full_Asp
: Node_Id
;
17232 Part_Asp
: Node_Id
;
17234 -- Start of processing for Check_Duplicate_Aspects
17237 if Present
(Full_Asps
) then
17238 Full_Asp
:= First
(Full_Asps
);
17239 while Present
(Full_Asp
) loop
17240 Part_Asp
:= Get_Partial_View_Aspect
(Full_Asp
);
17242 -- An aspect and its class-wide counterpart are two distinct
17243 -- aspects and may apply to both views of an entity.
17245 if Present
(Part_Asp
)
17246 and then Class_Present
(Part_Asp
) = Class_Present
(Full_Asp
)
17249 ("aspect already specified in private declaration",
17256 if Has_Discriminants
(Prev
)
17257 and then not Has_Unknown_Discriminants
(Prev
)
17258 and then Get_Aspect_Id
(Full_Asp
) =
17259 Aspect_Implicit_Dereference
17262 ("cannot specify aspect if partial view has known "
17263 & "discriminants", Full_Asp
);
17269 end Check_Duplicate_Aspects
;
17275 procedure Tag_Mismatch
is
17277 if Sloc
(Prev
) < Sloc
(Id
) then
17278 if Ada_Version
>= Ada_2012
17279 and then Nkind
(N
) = N_Private_Type_Declaration
17282 ("declaration of private } must be a tagged type ", Id
, Prev
);
17285 ("full declaration of } must be a tagged type ", Id
, Prev
);
17289 if Ada_Version
>= Ada_2012
17290 and then Nkind
(N
) = N_Private_Type_Declaration
17293 ("declaration of private } must be a tagged type ", Prev
, Id
);
17296 ("full declaration of } must be a tagged type ", Prev
, Id
);
17301 -- Start of processing for Find_Type_Name
17304 -- Find incomplete declaration, if one was given
17306 Prev
:= Current_Entity_In_Scope
(Id
);
17308 -- New type declaration
17314 -- Previous declaration exists
17317 Prev_Par
:= Parent
(Prev
);
17319 -- Error if not incomplete/private case except if previous
17320 -- declaration is implicit, etc. Enter_Name will emit error if
17323 if not Is_Incomplete_Or_Private_Type
(Prev
) then
17327 -- Check invalid completion of private or incomplete type
17329 elsif not Nkind_In
(N
, N_Full_Type_Declaration
,
17330 N_Task_Type_Declaration
,
17331 N_Protected_Type_Declaration
)
17333 (Ada_Version
< Ada_2012
17334 or else not Is_Incomplete_Type
(Prev
)
17335 or else not Nkind_In
(N
, N_Private_Type_Declaration
,
17336 N_Private_Extension_Declaration
))
17338 -- Completion must be a full type declarations (RM 7.3(4))
17340 Error_Msg_Sloc
:= Sloc
(Prev
);
17341 Error_Msg_NE
("invalid completion of }", Id
, Prev
);
17343 -- Set scope of Id to avoid cascaded errors. Entity is never
17344 -- examined again, except when saving globals in generics.
17346 Set_Scope
(Id
, Current_Scope
);
17349 -- If this is a repeated incomplete declaration, no further
17350 -- checks are possible.
17352 if Nkind
(N
) = N_Incomplete_Type_Declaration
then
17356 -- Case of full declaration of incomplete type
17358 elsif Ekind
(Prev
) = E_Incomplete_Type
17359 and then (Ada_Version
< Ada_2012
17360 or else No
(Full_View
(Prev
))
17361 or else not Is_Private_Type
(Full_View
(Prev
)))
17363 -- Indicate that the incomplete declaration has a matching full
17364 -- declaration. The defining occurrence of the incomplete
17365 -- declaration remains the visible one, and the procedure
17366 -- Get_Full_View dereferences it whenever the type is used.
17368 if Present
(Full_View
(Prev
)) then
17369 Error_Msg_NE
("invalid redeclaration of }", Id
, Prev
);
17372 Set_Full_View
(Prev
, Id
);
17373 Append_Entity
(Id
, Current_Scope
);
17374 Set_Is_Public
(Id
, Is_Public
(Prev
));
17375 Set_Is_Internal
(Id
);
17378 -- If the incomplete view is tagged, a class_wide type has been
17379 -- created already. Use it for the private type as well, in order
17380 -- to prevent multiple incompatible class-wide types that may be
17381 -- created for self-referential anonymous access components.
17383 if Is_Tagged_Type
(Prev
)
17384 and then Present
(Class_Wide_Type
(Prev
))
17386 Set_Ekind
(Id
, Ekind
(Prev
)); -- will be reset later
17387 Set_Class_Wide_Type
(Id
, Class_Wide_Type
(Prev
));
17389 -- Type of the class-wide type is the current Id. Previously
17390 -- this was not done for private declarations because of order-
17391 -- of-elaboration issues in the back end, but gigi now handles
17394 Set_Etype
(Class_Wide_Type
(Id
), Id
);
17397 -- Case of full declaration of private type
17400 -- If the private type was a completion of an incomplete type then
17401 -- update Prev to reference the private type
17403 if Ada_Version
>= Ada_2012
17404 and then Ekind
(Prev
) = E_Incomplete_Type
17405 and then Present
(Full_View
(Prev
))
17406 and then Is_Private_Type
(Full_View
(Prev
))
17408 Prev
:= Full_View
(Prev
);
17409 Prev_Par
:= Parent
(Prev
);
17412 if Nkind
(N
) = N_Full_Type_Declaration
17414 (Type_Definition
(N
), N_Record_Definition
,
17415 N_Derived_Type_Definition
)
17416 and then Interface_Present
(Type_Definition
(N
))
17419 ("completion of private type cannot be an interface", N
);
17422 if Nkind
(Parent
(Prev
)) /= N_Private_Extension_Declaration
then
17423 if Etype
(Prev
) /= Prev
then
17425 -- Prev is a private subtype or a derived type, and needs
17428 Error_Msg_NE
("invalid redeclaration of }", Id
, Prev
);
17431 elsif Ekind
(Prev
) = E_Private_Type
17432 and then Nkind_In
(N
, N_Task_Type_Declaration
,
17433 N_Protected_Type_Declaration
)
17436 ("completion of nonlimited type cannot be limited", N
);
17438 elsif Ekind
(Prev
) = E_Record_Type_With_Private
17439 and then Nkind_In
(N
, N_Task_Type_Declaration
,
17440 N_Protected_Type_Declaration
)
17442 if not Is_Limited_Record
(Prev
) then
17444 ("completion of nonlimited type cannot be limited", N
);
17446 elsif No
(Interface_List
(N
)) then
17448 ("completion of tagged private type must be tagged",
17453 -- Ada 2005 (AI-251): Private extension declaration of a task
17454 -- type or a protected type. This case arises when covering
17455 -- interface types.
17457 elsif Nkind_In
(N
, N_Task_Type_Declaration
,
17458 N_Protected_Type_Declaration
)
17462 elsif Nkind
(N
) /= N_Full_Type_Declaration
17463 or else Nkind
(Type_Definition
(N
)) /= N_Derived_Type_Definition
17466 ("full view of private extension must be an extension", N
);
17468 elsif not (Abstract_Present
(Parent
(Prev
)))
17469 and then Abstract_Present
(Type_Definition
(N
))
17472 ("full view of non-abstract extension cannot be abstract", N
);
17475 if not In_Private_Part
(Current_Scope
) then
17477 ("declaration of full view must appear in private part", N
);
17480 if Ada_Version
>= Ada_2012
then
17481 Check_Duplicate_Aspects
;
17484 Copy_And_Swap
(Prev
, Id
);
17485 Set_Has_Private_Declaration
(Prev
);
17486 Set_Has_Private_Declaration
(Id
);
17488 -- AI12-0133: Indicate whether we have a partial view with
17489 -- unknown discriminants, in which case initialization of objects
17490 -- of the type do not receive an invariant check.
17492 Set_Partial_View_Has_Unknown_Discr
17493 (Prev
, Has_Unknown_Discriminants
(Id
));
17495 -- Preserve aspect and iterator flags that may have been set on
17496 -- the partial view.
17498 Set_Has_Delayed_Aspects
(Prev
, Has_Delayed_Aspects
(Id
));
17499 Set_Has_Implicit_Dereference
(Prev
, Has_Implicit_Dereference
(Id
));
17501 -- If no error, propagate freeze_node from private to full view.
17502 -- It may have been generated for an early operational item.
17504 if Present
(Freeze_Node
(Id
))
17505 and then Serious_Errors_Detected
= 0
17506 and then No
(Full_View
(Id
))
17508 Set_Freeze_Node
(Prev
, Freeze_Node
(Id
));
17509 Set_Freeze_Node
(Id
, Empty
);
17510 Set_First_Rep_Item
(Prev
, First_Rep_Item
(Id
));
17513 Set_Full_View
(Id
, Prev
);
17517 -- Verify that full declaration conforms to partial one
17519 if Is_Incomplete_Or_Private_Type
(Prev
)
17520 and then Present
(Discriminant_Specifications
(Prev_Par
))
17522 if Present
(Discriminant_Specifications
(N
)) then
17523 if Ekind
(Prev
) = E_Incomplete_Type
then
17524 Check_Discriminant_Conformance
(N
, Prev
, Prev
);
17526 Check_Discriminant_Conformance
(N
, Prev
, Id
);
17531 ("missing discriminants in full type declaration", N
);
17533 -- To avoid cascaded errors on subsequent use, share the
17534 -- discriminants of the partial view.
17536 Set_Discriminant_Specifications
(N
,
17537 Discriminant_Specifications
(Prev_Par
));
17541 -- A prior untagged partial view can have an associated class-wide
17542 -- type due to use of the class attribute, and in this case the full
17543 -- type must also be tagged. This Ada 95 usage is deprecated in favor
17544 -- of incomplete tagged declarations, but we check for it.
17547 and then (Is_Tagged_Type
(Prev
)
17548 or else Present
(Class_Wide_Type
(Prev
)))
17550 -- Ada 2012 (AI05-0162): A private type may be the completion of
17551 -- an incomplete type.
17553 if Ada_Version
>= Ada_2012
17554 and then Is_Incomplete_Type
(Prev
)
17555 and then Nkind_In
(N
, N_Private_Type_Declaration
,
17556 N_Private_Extension_Declaration
)
17558 -- No need to check private extensions since they are tagged
17560 if Nkind
(N
) = N_Private_Type_Declaration
17561 and then not Tagged_Present
(N
)
17566 -- The full declaration is either a tagged type (including
17567 -- a synchronized type that implements interfaces) or a
17568 -- type extension, otherwise this is an error.
17570 elsif Nkind_In
(N
, N_Task_Type_Declaration
,
17571 N_Protected_Type_Declaration
)
17573 if No
(Interface_List
(N
)) and then not Error_Posted
(N
) then
17577 elsif Nkind
(Type_Definition
(N
)) = N_Record_Definition
then
17579 -- Indicate that the previous declaration (tagged incomplete
17580 -- or private declaration) requires the same on the full one.
17582 if not Tagged_Present
(Type_Definition
(N
)) then
17584 Set_Is_Tagged_Type
(Id
);
17587 elsif Nkind
(Type_Definition
(N
)) = N_Derived_Type_Definition
then
17588 if No
(Record_Extension_Part
(Type_Definition
(N
))) then
17590 ("full declaration of } must be a record extension",
17593 -- Set some attributes to produce a usable full view
17595 Set_Is_Tagged_Type
(Id
);
17604 and then Nkind
(Parent
(Prev
)) = N_Incomplete_Type_Declaration
17605 and then Present
(Premature_Use
(Parent
(Prev
)))
17607 Error_Msg_Sloc
:= Sloc
(N
);
17609 ("\full declaration #", Premature_Use
(Parent
(Prev
)));
17614 end Find_Type_Name
;
17616 -------------------------
17617 -- Find_Type_Of_Object --
17618 -------------------------
17620 function Find_Type_Of_Object
17621 (Obj_Def
: Node_Id
;
17622 Related_Nod
: Node_Id
) return Entity_Id
17624 Def_Kind
: constant Node_Kind
:= Nkind
(Obj_Def
);
17625 P
: Node_Id
:= Parent
(Obj_Def
);
17630 -- If the parent is a component_definition node we climb to the
17631 -- component_declaration node
17633 if Nkind
(P
) = N_Component_Definition
then
17637 -- Case of an anonymous array subtype
17639 if Nkind_In
(Def_Kind
, N_Constrained_Array_Definition
,
17640 N_Unconstrained_Array_Definition
)
17643 Array_Type_Declaration
(T
, Obj_Def
);
17645 -- Create an explicit subtype whenever possible
17647 elsif Nkind
(P
) /= N_Component_Declaration
17648 and then Def_Kind
= N_Subtype_Indication
17650 -- Base name of subtype on object name, which will be unique in
17651 -- the current scope.
17653 -- If this is a duplicate declaration, return base type, to avoid
17654 -- generating duplicate anonymous types.
17656 if Error_Posted
(P
) then
17657 Analyze
(Subtype_Mark
(Obj_Def
));
17658 return Entity
(Subtype_Mark
(Obj_Def
));
17663 (Chars
(Defining_Identifier
(Related_Nod
)), 'S', 0, 'T');
17665 T
:= Make_Defining_Identifier
(Sloc
(P
), Nam
);
17667 Insert_Action
(Obj_Def
,
17668 Make_Subtype_Declaration
(Sloc
(P
),
17669 Defining_Identifier
=> T
,
17670 Subtype_Indication
=> Relocate_Node
(Obj_Def
)));
17672 -- This subtype may need freezing, and this will not be done
17673 -- automatically if the object declaration is not in declarative
17674 -- part. Since this is an object declaration, the type cannot always
17675 -- be frozen here. Deferred constants do not freeze their type
17676 -- (which often enough will be private).
17678 if Nkind
(P
) = N_Object_Declaration
17679 and then Constant_Present
(P
)
17680 and then No
(Expression
(P
))
17684 -- Here we freeze the base type of object type to catch premature use
17685 -- of discriminated private type without a full view.
17688 Insert_Actions
(Obj_Def
, Freeze_Entity
(Base_Type
(T
), P
));
17691 -- Ada 2005 AI-406: the object definition in an object declaration
17692 -- can be an access definition.
17694 elsif Def_Kind
= N_Access_Definition
then
17695 T
:= Access_Definition
(Related_Nod
, Obj_Def
);
17697 Set_Is_Local_Anonymous_Access
17699 V
=> (Ada_Version
< Ada_2012
)
17700 or else (Nkind
(P
) /= N_Object_Declaration
)
17701 or else Is_Library_Level_Entity
(Defining_Identifier
(P
)));
17703 -- Otherwise, the object definition is just a subtype_mark
17706 T
:= Process_Subtype
(Obj_Def
, Related_Nod
);
17708 -- If expansion is disabled an object definition that is an aggregate
17709 -- will not get expanded and may lead to scoping problems in the back
17710 -- end, if the object is referenced in an inner scope. In that case
17711 -- create an itype reference for the object definition now. This
17712 -- may be redundant in some cases, but harmless.
17715 and then Nkind
(Related_Nod
) = N_Object_Declaration
17718 Build_Itype_Reference
(T
, Related_Nod
);
17723 end Find_Type_Of_Object
;
17725 --------------------------------
17726 -- Find_Type_Of_Subtype_Indic --
17727 --------------------------------
17729 function Find_Type_Of_Subtype_Indic
(S
: Node_Id
) return Entity_Id
is
17733 -- Case of subtype mark with a constraint
17735 if Nkind
(S
) = N_Subtype_Indication
then
17736 Find_Type
(Subtype_Mark
(S
));
17737 Typ
:= Entity
(Subtype_Mark
(S
));
17740 Is_Valid_Constraint_Kind
(Ekind
(Typ
), Nkind
(Constraint
(S
)))
17743 ("incorrect constraint for this kind of type", Constraint
(S
));
17744 Rewrite
(S
, New_Copy_Tree
(Subtype_Mark
(S
)));
17747 -- Otherwise we have a subtype mark without a constraint
17749 elsif Error_Posted
(S
) then
17750 Rewrite
(S
, New_Occurrence_Of
(Any_Id
, Sloc
(S
)));
17758 -- Check No_Wide_Characters restriction
17760 Check_Wide_Character_Restriction
(Typ
, S
);
17763 end Find_Type_Of_Subtype_Indic
;
17765 -------------------------------------
17766 -- Floating_Point_Type_Declaration --
17767 -------------------------------------
17769 procedure Floating_Point_Type_Declaration
(T
: Entity_Id
; Def
: Node_Id
) is
17770 Digs
: constant Node_Id
:= Digits_Expression
(Def
);
17771 Max_Digs_Val
: constant Uint
:= Digits_Value
(Standard_Long_Long_Float
);
17773 Base_Typ
: Entity_Id
;
17774 Implicit_Base
: Entity_Id
;
17777 function Can_Derive_From
(E
: Entity_Id
) return Boolean;
17778 -- Find if given digits value, and possibly a specified range, allows
17779 -- derivation from specified type
17781 function Find_Base_Type
return Entity_Id
;
17782 -- Find a predefined base type that Def can derive from, or generate
17783 -- an error and substitute Long_Long_Float if none exists.
17785 ---------------------
17786 -- Can_Derive_From --
17787 ---------------------
17789 function Can_Derive_From
(E
: Entity_Id
) return Boolean is
17790 Spec
: constant Entity_Id
:= Real_Range_Specification
(Def
);
17793 -- Check specified "digits" constraint
17795 if Digs_Val
> Digits_Value
(E
) then
17799 -- Check for matching range, if specified
17801 if Present
(Spec
) then
17802 if Expr_Value_R
(Type_Low_Bound
(E
)) >
17803 Expr_Value_R
(Low_Bound
(Spec
))
17808 if Expr_Value_R
(Type_High_Bound
(E
)) <
17809 Expr_Value_R
(High_Bound
(Spec
))
17816 end Can_Derive_From
;
17818 --------------------
17819 -- Find_Base_Type --
17820 --------------------
17822 function Find_Base_Type
return Entity_Id
is
17823 Choice
: Elmt_Id
:= First_Elmt
(Predefined_Float_Types
);
17826 -- Iterate over the predefined types in order, returning the first
17827 -- one that Def can derive from.
17829 while Present
(Choice
) loop
17830 if Can_Derive_From
(Node
(Choice
)) then
17831 return Node
(Choice
);
17834 Next_Elmt
(Choice
);
17837 -- If we can't derive from any existing type, use Long_Long_Float
17838 -- and give appropriate message explaining the problem.
17840 if Digs_Val
> Max_Digs_Val
then
17841 -- It might be the case that there is a type with the requested
17842 -- range, just not the combination of digits and range.
17845 ("no predefined type has requested range and precision",
17846 Real_Range_Specification
(Def
));
17850 ("range too large for any predefined type",
17851 Real_Range_Specification
(Def
));
17854 return Standard_Long_Long_Float
;
17855 end Find_Base_Type
;
17857 -- Start of processing for Floating_Point_Type_Declaration
17860 Check_Restriction
(No_Floating_Point
, Def
);
17862 -- Create an implicit base type
17865 Create_Itype
(E_Floating_Point_Type
, Parent
(Def
), T
, 'B');
17867 -- Analyze and verify digits value
17869 Analyze_And_Resolve
(Digs
, Any_Integer
);
17870 Check_Digits_Expression
(Digs
);
17871 Digs_Val
:= Expr_Value
(Digs
);
17873 -- Process possible range spec and find correct type to derive from
17875 Process_Real_Range_Specification
(Def
);
17877 -- Check that requested number of digits is not too high.
17879 if Digs_Val
> Max_Digs_Val
then
17881 -- The check for Max_Base_Digits may be somewhat expensive, as it
17882 -- requires reading System, so only do it when necessary.
17885 Max_Base_Digits
: constant Uint
:=
17888 (Parent
(RTE
(RE_Max_Base_Digits
))));
17891 if Digs_Val
> Max_Base_Digits
then
17892 Error_Msg_Uint_1
:= Max_Base_Digits
;
17893 Error_Msg_N
("digits value out of range, maximum is ^", Digs
);
17895 elsif No
(Real_Range_Specification
(Def
)) then
17896 Error_Msg_Uint_1
:= Max_Digs_Val
;
17897 Error_Msg_N
("types with more than ^ digits need range spec "
17898 & "(RM 3.5.7(6))", Digs
);
17903 -- Find a suitable type to derive from or complain and use a substitute
17905 Base_Typ
:= Find_Base_Type
;
17907 -- If there are bounds given in the declaration use them as the bounds
17908 -- of the type, otherwise use the bounds of the predefined base type
17909 -- that was chosen based on the Digits value.
17911 if Present
(Real_Range_Specification
(Def
)) then
17912 Set_Scalar_Range
(T
, Real_Range_Specification
(Def
));
17913 Set_Is_Constrained
(T
);
17915 -- The bounds of this range must be converted to machine numbers
17916 -- in accordance with RM 4.9(38).
17918 Bound
:= Type_Low_Bound
(T
);
17920 if Nkind
(Bound
) = N_Real_Literal
then
17922 (Bound
, Machine
(Base_Typ
, Realval
(Bound
), Round
, Bound
));
17923 Set_Is_Machine_Number
(Bound
);
17926 Bound
:= Type_High_Bound
(T
);
17928 if Nkind
(Bound
) = N_Real_Literal
then
17930 (Bound
, Machine
(Base_Typ
, Realval
(Bound
), Round
, Bound
));
17931 Set_Is_Machine_Number
(Bound
);
17935 Set_Scalar_Range
(T
, Scalar_Range
(Base_Typ
));
17938 -- Complete definition of implicit base and declared first subtype. The
17939 -- inheritance of the rep item chain ensures that SPARK-related pragmas
17940 -- are not clobbered when the floating point type acts as a full view of
17943 Set_Etype
(Implicit_Base
, Base_Typ
);
17944 Set_Scalar_Range
(Implicit_Base
, Scalar_Range
(Base_Typ
));
17945 Set_Size_Info
(Implicit_Base
, Base_Typ
);
17946 Set_RM_Size
(Implicit_Base
, RM_Size
(Base_Typ
));
17947 Set_First_Rep_Item
(Implicit_Base
, First_Rep_Item
(Base_Typ
));
17948 Set_Digits_Value
(Implicit_Base
, Digits_Value
(Base_Typ
));
17949 Set_Float_Rep
(Implicit_Base
, Float_Rep
(Base_Typ
));
17951 Set_Ekind
(T
, E_Floating_Point_Subtype
);
17952 Set_Etype
(T
, Implicit_Base
);
17953 Set_Size_Info
(T
, Implicit_Base
);
17954 Set_RM_Size
(T
, RM_Size
(Implicit_Base
));
17955 Inherit_Rep_Item_Chain
(T
, Implicit_Base
);
17956 Set_Digits_Value
(T
, Digs_Val
);
17957 end Floating_Point_Type_Declaration
;
17959 ----------------------------
17960 -- Get_Discriminant_Value --
17961 ----------------------------
17963 -- This is the situation:
17965 -- There is a non-derived type
17967 -- type T0 (Dx, Dy, Dz...)
17969 -- There are zero or more levels of derivation, with each derivation
17970 -- either purely inheriting the discriminants, or defining its own.
17972 -- type Ti is new Ti-1
17974 -- type Ti (Dw) is new Ti-1(Dw, 1, X+Y)
17976 -- subtype Ti is ...
17978 -- The subtype issue is avoided by the use of Original_Record_Component,
17979 -- and the fact that derived subtypes also derive the constraints.
17981 -- This chain leads back from
17983 -- Typ_For_Constraint
17985 -- Typ_For_Constraint has discriminants, and the value for each
17986 -- discriminant is given by its corresponding Elmt of Constraints.
17988 -- Discriminant is some discriminant in this hierarchy
17990 -- We need to return its value
17992 -- We do this by recursively searching each level, and looking for
17993 -- Discriminant. Once we get to the bottom, we start backing up
17994 -- returning the value for it which may in turn be a discriminant
17995 -- further up, so on the backup we continue the substitution.
17997 function Get_Discriminant_Value
17998 (Discriminant
: Entity_Id
;
17999 Typ_For_Constraint
: Entity_Id
;
18000 Constraint
: Elist_Id
) return Node_Id
18002 function Root_Corresponding_Discriminant
18003 (Discr
: Entity_Id
) return Entity_Id
;
18004 -- Given a discriminant, traverse the chain of inherited discriminants
18005 -- and return the topmost discriminant.
18007 function Search_Derivation_Levels
18009 Discrim_Values
: Elist_Id
;
18010 Stored_Discrim_Values
: Boolean) return Node_Or_Entity_Id
;
18011 -- This is the routine that performs the recursive search of levels
18012 -- as described above.
18014 -------------------------------------
18015 -- Root_Corresponding_Discriminant --
18016 -------------------------------------
18018 function Root_Corresponding_Discriminant
18019 (Discr
: Entity_Id
) return Entity_Id
18025 while Present
(Corresponding_Discriminant
(D
)) loop
18026 D
:= Corresponding_Discriminant
(D
);
18030 end Root_Corresponding_Discriminant
;
18032 ------------------------------
18033 -- Search_Derivation_Levels --
18034 ------------------------------
18036 function Search_Derivation_Levels
18038 Discrim_Values
: Elist_Id
;
18039 Stored_Discrim_Values
: Boolean) return Node_Or_Entity_Id
18043 Result
: Node_Or_Entity_Id
;
18044 Result_Entity
: Node_Id
;
18047 -- If inappropriate type, return Error, this happens only in
18048 -- cascaded error situations, and we want to avoid a blow up.
18050 if not Is_Composite_Type
(Ti
) or else Is_Array_Type
(Ti
) then
18054 -- Look deeper if possible. Use Stored_Constraints only for
18055 -- untagged types. For tagged types use the given constraint.
18056 -- This asymmetry needs explanation???
18058 if not Stored_Discrim_Values
18059 and then Present
(Stored_Constraint
(Ti
))
18060 and then not Is_Tagged_Type
(Ti
)
18063 Search_Derivation_Levels
(Ti
, Stored_Constraint
(Ti
), True);
18067 Td
: Entity_Id
:= Etype
(Ti
);
18070 -- If the parent type is private, the full view may include
18071 -- renamed discriminants, and it is those stored values that
18072 -- may be needed (the partial view never has more information
18073 -- than the full view).
18075 if Is_Private_Type
(Td
) and then Present
(Full_View
(Td
)) then
18076 Td
:= Full_View
(Td
);
18080 Result
:= Discriminant
;
18083 if Present
(Stored_Constraint
(Ti
)) then
18085 Search_Derivation_Levels
18086 (Td
, Stored_Constraint
(Ti
), True);
18089 Search_Derivation_Levels
18090 (Td
, Discrim_Values
, Stored_Discrim_Values
);
18096 -- Extra underlying places to search, if not found above. For
18097 -- concurrent types, the relevant discriminant appears in the
18098 -- corresponding record. For a type derived from a private type
18099 -- without discriminant, the full view inherits the discriminants
18100 -- of the full view of the parent.
18102 if Result
= Discriminant
then
18103 if Is_Concurrent_Type
(Ti
)
18104 and then Present
(Corresponding_Record_Type
(Ti
))
18107 Search_Derivation_Levels
(
18108 Corresponding_Record_Type
(Ti
),
18110 Stored_Discrim_Values
);
18112 elsif Is_Private_Type
(Ti
)
18113 and then not Has_Discriminants
(Ti
)
18114 and then Present
(Full_View
(Ti
))
18115 and then Etype
(Full_View
(Ti
)) /= Ti
18118 Search_Derivation_Levels
(
18121 Stored_Discrim_Values
);
18125 -- If Result is not a (reference to a) discriminant, return it,
18126 -- otherwise set Result_Entity to the discriminant.
18128 if Nkind
(Result
) = N_Defining_Identifier
then
18129 pragma Assert
(Result
= Discriminant
);
18130 Result_Entity
:= Result
;
18133 if not Denotes_Discriminant
(Result
) then
18137 Result_Entity
:= Entity
(Result
);
18140 -- See if this level of derivation actually has discriminants because
18141 -- tagged derivations can add them, hence the lower levels need not
18144 if not Has_Discriminants
(Ti
) then
18148 -- Scan Ti's discriminants for Result_Entity, and return its
18149 -- corresponding value, if any.
18151 Result_Entity
:= Original_Record_Component
(Result_Entity
);
18153 Assoc
:= First_Elmt
(Discrim_Values
);
18155 if Stored_Discrim_Values
then
18156 Disc
:= First_Stored_Discriminant
(Ti
);
18158 Disc
:= First_Discriminant
(Ti
);
18161 while Present
(Disc
) loop
18163 -- If no further associations return the discriminant, value will
18164 -- be found on the second pass.
18170 if Original_Record_Component
(Disc
) = Result_Entity
then
18171 return Node
(Assoc
);
18176 if Stored_Discrim_Values
then
18177 Next_Stored_Discriminant
(Disc
);
18179 Next_Discriminant
(Disc
);
18183 -- Could not find it
18186 end Search_Derivation_Levels
;
18190 Result
: Node_Or_Entity_Id
;
18192 -- Start of processing for Get_Discriminant_Value
18195 -- ??? This routine is a gigantic mess and will be deleted. For the
18196 -- time being just test for the trivial case before calling recurse.
18198 -- We are now celebrating the 20th anniversary of this comment!
18200 if Base_Type
(Scope
(Discriminant
)) = Base_Type
(Typ_For_Constraint
) then
18206 D
:= First_Discriminant
(Typ_For_Constraint
);
18207 E
:= First_Elmt
(Constraint
);
18208 while Present
(D
) loop
18209 if Chars
(D
) = Chars
(Discriminant
) then
18213 Next_Discriminant
(D
);
18219 Result
:= Search_Derivation_Levels
18220 (Typ_For_Constraint
, Constraint
, False);
18222 -- ??? hack to disappear when this routine is gone
18224 if Nkind
(Result
) = N_Defining_Identifier
then
18230 D
:= First_Discriminant
(Typ_For_Constraint
);
18231 E
:= First_Elmt
(Constraint
);
18232 while Present
(D
) loop
18233 if Root_Corresponding_Discriminant
(D
) = Discriminant
then
18237 Next_Discriminant
(D
);
18243 pragma Assert
(Nkind
(Result
) /= N_Defining_Identifier
);
18245 end Get_Discriminant_Value
;
18247 --------------------------
18248 -- Has_Range_Constraint --
18249 --------------------------
18251 function Has_Range_Constraint
(N
: Node_Id
) return Boolean is
18252 C
: constant Node_Id
:= Constraint
(N
);
18255 if Nkind
(C
) = N_Range_Constraint
then
18258 elsif Nkind
(C
) = N_Digits_Constraint
then
18260 Is_Decimal_Fixed_Point_Type
(Entity
(Subtype_Mark
(N
)))
18261 or else Present
(Range_Constraint
(C
));
18263 elsif Nkind
(C
) = N_Delta_Constraint
then
18264 return Present
(Range_Constraint
(C
));
18269 end Has_Range_Constraint
;
18271 ------------------------
18272 -- Inherit_Components --
18273 ------------------------
18275 function Inherit_Components
18277 Parent_Base
: Entity_Id
;
18278 Derived_Base
: Entity_Id
;
18279 Is_Tagged
: Boolean;
18280 Inherit_Discr
: Boolean;
18281 Discs
: Elist_Id
) return Elist_Id
18283 Assoc_List
: constant Elist_Id
:= New_Elmt_List
;
18285 procedure Inherit_Component
18286 (Old_C
: Entity_Id
;
18287 Plain_Discrim
: Boolean := False;
18288 Stored_Discrim
: Boolean := False);
18289 -- Inherits component Old_C from Parent_Base to the Derived_Base. If
18290 -- Plain_Discrim is True, Old_C is a discriminant. If Stored_Discrim is
18291 -- True, Old_C is a stored discriminant. If they are both false then
18292 -- Old_C is a regular component.
18294 -----------------------
18295 -- Inherit_Component --
18296 -----------------------
18298 procedure Inherit_Component
18299 (Old_C
: Entity_Id
;
18300 Plain_Discrim
: Boolean := False;
18301 Stored_Discrim
: Boolean := False)
18303 procedure Set_Anonymous_Type
(Id
: Entity_Id
);
18304 -- Id denotes the entity of an access discriminant or anonymous
18305 -- access component. Set the type of Id to either the same type of
18306 -- Old_C or create a new one depending on whether the parent and
18307 -- the child types are in the same scope.
18309 ------------------------
18310 -- Set_Anonymous_Type --
18311 ------------------------
18313 procedure Set_Anonymous_Type
(Id
: Entity_Id
) is
18314 Old_Typ
: constant Entity_Id
:= Etype
(Old_C
);
18317 if Scope
(Parent_Base
) = Scope
(Derived_Base
) then
18318 Set_Etype
(Id
, Old_Typ
);
18320 -- The parent and the derived type are in two different scopes.
18321 -- Reuse the type of the original discriminant / component by
18322 -- copying it in order to preserve all attributes.
18326 Typ
: constant Entity_Id
:= New_Copy
(Old_Typ
);
18329 Set_Etype
(Id
, Typ
);
18331 -- Since we do not generate component declarations for
18332 -- inherited components, associate the itype with the
18335 Set_Associated_Node_For_Itype
(Typ
, Parent
(Derived_Base
));
18336 Set_Scope
(Typ
, Derived_Base
);
18339 end Set_Anonymous_Type
;
18341 -- Local variables and constants
18343 New_C
: constant Entity_Id
:= New_Copy
(Old_C
);
18345 Corr_Discrim
: Entity_Id
;
18346 Discrim
: Entity_Id
;
18348 -- Start of processing for Inherit_Component
18351 pragma Assert
(not Is_Tagged
or not Stored_Discrim
);
18353 Set_Parent
(New_C
, Parent
(Old_C
));
18355 -- Regular discriminants and components must be inserted in the scope
18356 -- of the Derived_Base. Do it here.
18358 if not Stored_Discrim
then
18359 Enter_Name
(New_C
);
18362 -- For tagged types the Original_Record_Component must point to
18363 -- whatever this field was pointing to in the parent type. This has
18364 -- already been achieved by the call to New_Copy above.
18366 if not Is_Tagged
then
18367 Set_Original_Record_Component
(New_C
, New_C
);
18368 Set_Corresponding_Record_Component
(New_C
, Old_C
);
18371 -- Set the proper type of an access discriminant
18373 if Ekind
(New_C
) = E_Discriminant
18374 and then Ekind
(Etype
(New_C
)) = E_Anonymous_Access_Type
18376 Set_Anonymous_Type
(New_C
);
18379 -- If we have inherited a component then see if its Etype contains
18380 -- references to Parent_Base discriminants. In this case, replace
18381 -- these references with the constraints given in Discs. We do not
18382 -- do this for the partial view of private types because this is
18383 -- not needed (only the components of the full view will be used
18384 -- for code generation) and cause problem. We also avoid this
18385 -- transformation in some error situations.
18387 if Ekind
(New_C
) = E_Component
then
18389 -- Set the proper type of an anonymous access component
18391 if Ekind
(Etype
(New_C
)) = E_Anonymous_Access_Type
then
18392 Set_Anonymous_Type
(New_C
);
18394 elsif (Is_Private_Type
(Derived_Base
)
18395 and then not Is_Generic_Type
(Derived_Base
))
18396 or else (Is_Empty_Elmt_List
(Discs
)
18397 and then not Expander_Active
)
18399 Set_Etype
(New_C
, Etype
(Old_C
));
18402 -- The current component introduces a circularity of the
18405 -- limited with Pack_2;
18406 -- package Pack_1 is
18407 -- type T_1 is tagged record
18408 -- Comp : access Pack_2.T_2;
18414 -- package Pack_2 is
18415 -- type T_2 is new Pack_1.T_1 with ...;
18420 Constrain_Component_Type
18421 (Old_C
, Derived_Base
, N
, Parent_Base
, Discs
));
18425 -- In derived tagged types it is illegal to reference a non
18426 -- discriminant component in the parent type. To catch this, mark
18427 -- these components with an Ekind of E_Void. This will be reset in
18428 -- Record_Type_Definition after processing the record extension of
18429 -- the derived type.
18431 -- If the declaration is a private extension, there is no further
18432 -- record extension to process, and the components retain their
18433 -- current kind, because they are visible at this point.
18435 if Is_Tagged
and then Ekind
(New_C
) = E_Component
18436 and then Nkind
(N
) /= N_Private_Extension_Declaration
18438 Set_Ekind
(New_C
, E_Void
);
18441 if Plain_Discrim
then
18442 Set_Corresponding_Discriminant
(New_C
, Old_C
);
18443 Build_Discriminal
(New_C
);
18445 -- If we are explicitly inheriting a stored discriminant it will be
18446 -- completely hidden.
18448 elsif Stored_Discrim
then
18449 Set_Corresponding_Discriminant
(New_C
, Empty
);
18450 Set_Discriminal
(New_C
, Empty
);
18451 Set_Is_Completely_Hidden
(New_C
);
18453 -- Set the Original_Record_Component of each discriminant in the
18454 -- derived base to point to the corresponding stored that we just
18457 Discrim
:= First_Discriminant
(Derived_Base
);
18458 while Present
(Discrim
) loop
18459 Corr_Discrim
:= Corresponding_Discriminant
(Discrim
);
18461 -- Corr_Discrim could be missing in an error situation
18463 if Present
(Corr_Discrim
)
18464 and then Original_Record_Component
(Corr_Discrim
) = Old_C
18466 Set_Original_Record_Component
(Discrim
, New_C
);
18467 Set_Corresponding_Record_Component
(Discrim
, Empty
);
18470 Next_Discriminant
(Discrim
);
18473 Append_Entity
(New_C
, Derived_Base
);
18476 if not Is_Tagged
then
18477 Append_Elmt
(Old_C
, Assoc_List
);
18478 Append_Elmt
(New_C
, Assoc_List
);
18480 end Inherit_Component
;
18482 -- Variables local to Inherit_Component
18484 Loc
: constant Source_Ptr
:= Sloc
(N
);
18486 Parent_Discrim
: Entity_Id
;
18487 Stored_Discrim
: Entity_Id
;
18489 Component
: Entity_Id
;
18491 -- Start of processing for Inherit_Components
18494 if not Is_Tagged
then
18495 Append_Elmt
(Parent_Base
, Assoc_List
);
18496 Append_Elmt
(Derived_Base
, Assoc_List
);
18499 -- Inherit parent discriminants if needed
18501 if Inherit_Discr
then
18502 Parent_Discrim
:= First_Discriminant
(Parent_Base
);
18503 while Present
(Parent_Discrim
) loop
18504 Inherit_Component
(Parent_Discrim
, Plain_Discrim
=> True);
18505 Next_Discriminant
(Parent_Discrim
);
18509 -- Create explicit stored discrims for untagged types when necessary
18511 if not Has_Unknown_Discriminants
(Derived_Base
)
18512 and then Has_Discriminants
(Parent_Base
)
18513 and then not Is_Tagged
18516 or else First_Discriminant
(Parent_Base
) /=
18517 First_Stored_Discriminant
(Parent_Base
))
18519 Stored_Discrim
:= First_Stored_Discriminant
(Parent_Base
);
18520 while Present
(Stored_Discrim
) loop
18521 Inherit_Component
(Stored_Discrim
, Stored_Discrim
=> True);
18522 Next_Stored_Discriminant
(Stored_Discrim
);
18526 -- See if we can apply the second transformation for derived types, as
18527 -- explained in point 6. in the comments above Build_Derived_Record_Type
18528 -- This is achieved by appending Derived_Base discriminants into Discs,
18529 -- which has the side effect of returning a non empty Discs list to the
18530 -- caller of Inherit_Components, which is what we want. This must be
18531 -- done for private derived types if there are explicit stored
18532 -- discriminants, to ensure that we can retrieve the values of the
18533 -- constraints provided in the ancestors.
18536 and then Is_Empty_Elmt_List
(Discs
)
18537 and then Present
(First_Discriminant
(Derived_Base
))
18539 (not Is_Private_Type
(Derived_Base
)
18540 or else Is_Completely_Hidden
18541 (First_Stored_Discriminant
(Derived_Base
))
18542 or else Is_Generic_Type
(Derived_Base
))
18544 D
:= First_Discriminant
(Derived_Base
);
18545 while Present
(D
) loop
18546 Append_Elmt
(New_Occurrence_Of
(D
, Loc
), Discs
);
18547 Next_Discriminant
(D
);
18551 -- Finally, inherit non-discriminant components unless they are not
18552 -- visible because defined or inherited from the full view of the
18553 -- parent. Don't inherit the _parent field of the parent type.
18555 Component
:= First_Entity
(Parent_Base
);
18556 while Present
(Component
) loop
18558 -- Ada 2005 (AI-251): Do not inherit components associated with
18559 -- secondary tags of the parent.
18561 if Ekind
(Component
) = E_Component
18562 and then Present
(Related_Type
(Component
))
18566 elsif Ekind
(Component
) /= E_Component
18567 or else Chars
(Component
) = Name_uParent
18571 -- If the derived type is within the parent type's declarative
18572 -- region, then the components can still be inherited even though
18573 -- they aren't visible at this point. This can occur for cases
18574 -- such as within public child units where the components must
18575 -- become visible upon entering the child unit's private part.
18577 elsif not Is_Visible_Component
(Component
)
18578 and then not In_Open_Scopes
(Scope
(Parent_Base
))
18582 elsif Ekind_In
(Derived_Base
, E_Private_Type
,
18583 E_Limited_Private_Type
)
18588 Inherit_Component
(Component
);
18591 Next_Entity
(Component
);
18594 -- For tagged derived types, inherited discriminants cannot be used in
18595 -- component declarations of the record extension part. To achieve this
18596 -- we mark the inherited discriminants as not visible.
18598 if Is_Tagged
and then Inherit_Discr
then
18599 D
:= First_Discriminant
(Derived_Base
);
18600 while Present
(D
) loop
18601 Set_Is_Immediately_Visible
(D
, False);
18602 Next_Discriminant
(D
);
18607 end Inherit_Components
;
18609 -----------------------------
18610 -- Inherit_Predicate_Flags --
18611 -----------------------------
18613 procedure Inherit_Predicate_Flags
(Subt
, Par
: Entity_Id
) is
18615 if Present
(Predicate_Function
(Subt
)) then
18619 Set_Has_Predicates
(Subt
, Has_Predicates
(Par
));
18620 Set_Has_Static_Predicate_Aspect
18621 (Subt
, Has_Static_Predicate_Aspect
(Par
));
18622 Set_Has_Dynamic_Predicate_Aspect
18623 (Subt
, Has_Dynamic_Predicate_Aspect
(Par
));
18625 -- A named subtype does not inherit the predicate function of its
18626 -- parent but an itype declared for a loop index needs the discrete
18627 -- predicate information of its parent to execute the loop properly.
18628 -- A non-discrete type may has a static predicate (for example True)
18629 -- but has no static_discrete_predicate.
18631 if Is_Itype
(Subt
) and then Present
(Predicate_Function
(Par
)) then
18632 Set_Subprograms_For_Type
(Subt
, Subprograms_For_Type
(Par
));
18634 if Has_Static_Predicate
(Par
) and then Is_Discrete_Type
(Par
) then
18635 Set_Static_Discrete_Predicate
18636 (Subt
, Static_Discrete_Predicate
(Par
));
18639 end Inherit_Predicate_Flags
;
18641 ----------------------
18642 -- Is_EVF_Procedure --
18643 ----------------------
18645 function Is_EVF_Procedure
(Subp
: Entity_Id
) return Boolean is
18646 Formal
: Entity_Id
;
18649 -- Examine the formals of an Extensions_Visible False procedure looking
18650 -- for a controlling OUT parameter.
18652 if Ekind
(Subp
) = E_Procedure
18653 and then Extensions_Visible_Status
(Subp
) = Extensions_Visible_False
18655 Formal
:= First_Formal
(Subp
);
18656 while Present
(Formal
) loop
18657 if Ekind
(Formal
) = E_Out_Parameter
18658 and then Is_Controlling_Formal
(Formal
)
18663 Next_Formal
(Formal
);
18668 end Is_EVF_Procedure
;
18670 -----------------------
18671 -- Is_Null_Extension --
18672 -----------------------
18674 function Is_Null_Extension
(T
: Entity_Id
) return Boolean is
18675 Type_Decl
: constant Node_Id
:= Parent
(Base_Type
(T
));
18676 Comp_List
: Node_Id
;
18680 if Nkind
(Type_Decl
) /= N_Full_Type_Declaration
18681 or else not Is_Tagged_Type
(T
)
18682 or else Nkind
(Type_Definition
(Type_Decl
)) /=
18683 N_Derived_Type_Definition
18684 or else No
(Record_Extension_Part
(Type_Definition
(Type_Decl
)))
18690 Component_List
(Record_Extension_Part
(Type_Definition
(Type_Decl
)));
18692 if Present
(Discriminant_Specifications
(Type_Decl
)) then
18695 elsif Present
(Comp_List
)
18696 and then Is_Non_Empty_List
(Component_Items
(Comp_List
))
18698 Comp
:= First
(Component_Items
(Comp_List
));
18700 -- Only user-defined components are relevant. The component list
18701 -- may also contain a parent component and internal components
18702 -- corresponding to secondary tags, but these do not determine
18703 -- whether this is a null extension.
18705 while Present
(Comp
) loop
18706 if Comes_From_Source
(Comp
) then
18718 end Is_Null_Extension
;
18720 ------------------------------
18721 -- Is_Valid_Constraint_Kind --
18722 ------------------------------
18724 function Is_Valid_Constraint_Kind
18725 (T_Kind
: Type_Kind
;
18726 Constraint_Kind
: Node_Kind
) return Boolean
18730 when Enumeration_Kind
18733 return Constraint_Kind
= N_Range_Constraint
;
18735 when Decimal_Fixed_Point_Kind
=>
18736 return Nkind_In
(Constraint_Kind
, N_Digits_Constraint
,
18737 N_Range_Constraint
);
18739 when Ordinary_Fixed_Point_Kind
=>
18740 return Nkind_In
(Constraint_Kind
, N_Delta_Constraint
,
18741 N_Range_Constraint
);
18744 return Nkind_In
(Constraint_Kind
, N_Digits_Constraint
,
18745 N_Range_Constraint
);
18752 | E_Incomplete_Type
18756 return Constraint_Kind
= N_Index_Or_Discriminant_Constraint
;
18759 return True; -- Error will be detected later
18761 end Is_Valid_Constraint_Kind
;
18763 --------------------------
18764 -- Is_Visible_Component --
18765 --------------------------
18767 function Is_Visible_Component
18769 N
: Node_Id
:= Empty
) return Boolean
18771 Original_Comp
: Entity_Id
:= Empty
;
18772 Original_Type
: Entity_Id
;
18773 Type_Scope
: Entity_Id
;
18775 function Is_Local_Type
(Typ
: Entity_Id
) return Boolean;
18776 -- Check whether parent type of inherited component is declared locally,
18777 -- possibly within a nested package or instance. The current scope is
18778 -- the derived record itself.
18780 -------------------
18781 -- Is_Local_Type --
18782 -------------------
18784 function Is_Local_Type
(Typ
: Entity_Id
) return Boolean is
18788 Scop
:= Scope
(Typ
);
18789 while Present
(Scop
)
18790 and then Scop
/= Standard_Standard
18792 if Scop
= Scope
(Current_Scope
) then
18796 Scop
:= Scope
(Scop
);
18802 -- Start of processing for Is_Visible_Component
18805 if Ekind_In
(C
, E_Component
, E_Discriminant
) then
18806 Original_Comp
:= Original_Record_Component
(C
);
18809 if No
(Original_Comp
) then
18811 -- Premature usage, or previous error
18816 Original_Type
:= Scope
(Original_Comp
);
18817 Type_Scope
:= Scope
(Base_Type
(Scope
(C
)));
18820 -- This test only concerns tagged types
18822 if not Is_Tagged_Type
(Original_Type
) then
18824 -- Check if this is a renamed discriminant (hidden either by the
18825 -- derived type or by some ancestor), unless we are analyzing code
18826 -- generated by the expander since it may reference such components
18827 -- (for example see the expansion of Deep_Adjust).
18829 if Ekind
(C
) = E_Discriminant
and then Present
(N
) then
18831 not Comes_From_Source
(N
)
18832 or else not Is_Completely_Hidden
(C
);
18837 -- If it is _Parent or _Tag, there is no visibility issue
18839 elsif not Comes_From_Source
(Original_Comp
) then
18842 -- Discriminants are visible unless the (private) type has unknown
18843 -- discriminants. If the discriminant reference is inserted for a
18844 -- discriminant check on a full view it is also visible.
18846 elsif Ekind
(Original_Comp
) = E_Discriminant
18848 (not Has_Unknown_Discriminants
(Original_Type
)
18849 or else (Present
(N
)
18850 and then Nkind
(N
) = N_Selected_Component
18851 and then Nkind
(Prefix
(N
)) = N_Type_Conversion
18852 and then not Comes_From_Source
(Prefix
(N
))))
18856 -- In the body of an instantiation, check the visibility of a component
18857 -- in case it has a homograph that is a primitive operation of a private
18858 -- type which was not visible in the generic unit.
18860 -- Should Is_Prefixed_Call be propagated from template to instance???
18862 elsif In_Instance_Body
then
18863 if not Is_Tagged_Type
(Original_Type
)
18864 or else not Is_Private_Type
(Original_Type
)
18870 Subp_Elmt
: Elmt_Id
;
18873 Subp_Elmt
:= First_Elmt
(Primitive_Operations
(Original_Type
));
18874 while Present
(Subp_Elmt
) loop
18876 -- The component is hidden by a primitive operation
18878 if Chars
(Node
(Subp_Elmt
)) = Chars
(C
) then
18882 Next_Elmt
(Subp_Elmt
);
18889 -- If the component has been declared in an ancestor which is currently
18890 -- a private type, then it is not visible. The same applies if the
18891 -- component's containing type is not in an open scope and the original
18892 -- component's enclosing type is a visible full view of a private type
18893 -- (which can occur in cases where an attempt is being made to reference
18894 -- a component in a sibling package that is inherited from a visible
18895 -- component of a type in an ancestor package; the component in the
18896 -- sibling package should not be visible even though the component it
18897 -- inherited from is visible). This does not apply however in the case
18898 -- where the scope of the type is a private child unit, or when the
18899 -- parent comes from a local package in which the ancestor is currently
18900 -- visible. The latter suppression of visibility is needed for cases
18901 -- that are tested in B730006.
18903 elsif Is_Private_Type
(Original_Type
)
18905 (not Is_Private_Descendant
(Type_Scope
)
18906 and then not In_Open_Scopes
(Type_Scope
)
18907 and then Has_Private_Declaration
(Original_Type
))
18909 -- If the type derives from an entity in a formal package, there
18910 -- are no additional visible components.
18912 if Nkind
(Original_Node
(Unit_Declaration_Node
(Type_Scope
))) =
18913 N_Formal_Package_Declaration
18917 -- if we are not in the private part of the current package, there
18918 -- are no additional visible components.
18920 elsif Ekind
(Scope
(Current_Scope
)) = E_Package
18921 and then not In_Private_Part
(Scope
(Current_Scope
))
18926 Is_Child_Unit
(Cunit_Entity
(Current_Sem_Unit
))
18927 and then In_Open_Scopes
(Scope
(Original_Type
))
18928 and then Is_Local_Type
(Type_Scope
);
18931 -- There is another weird way in which a component may be invisible when
18932 -- the private and the full view are not derived from the same ancestor.
18933 -- Here is an example :
18935 -- type A1 is tagged record F1 : integer; end record;
18936 -- type A2 is new A1 with record F2 : integer; end record;
18937 -- type T is new A1 with private;
18939 -- type T is new A2 with null record;
18941 -- In this case, the full view of T inherits F1 and F2 but the private
18942 -- view inherits only F1
18946 Ancestor
: Entity_Id
:= Scope
(C
);
18950 if Ancestor
= Original_Type
then
18953 -- The ancestor may have a partial view of the original type,
18954 -- but if the full view is in scope, as in a child body, the
18955 -- component is visible.
18957 elsif In_Private_Part
(Scope
(Original_Type
))
18958 and then Full_View
(Ancestor
) = Original_Type
18962 elsif Ancestor
= Etype
(Ancestor
) then
18964 -- No further ancestors to examine
18969 Ancestor
:= Etype
(Ancestor
);
18973 end Is_Visible_Component
;
18975 --------------------------
18976 -- Make_Class_Wide_Type --
18977 --------------------------
18979 procedure Make_Class_Wide_Type
(T
: Entity_Id
) is
18980 CW_Type
: Entity_Id
;
18982 Next_E
: Entity_Id
;
18983 Prev_E
: Entity_Id
;
18986 if Present
(Class_Wide_Type
(T
)) then
18988 -- The class-wide type is a partially decorated entity created for a
18989 -- unanalyzed tagged type referenced through a limited with clause.
18990 -- When the tagged type is analyzed, its class-wide type needs to be
18991 -- redecorated. Note that we reuse the entity created by Decorate_
18992 -- Tagged_Type in order to preserve all links.
18994 if Materialize_Entity
(Class_Wide_Type
(T
)) then
18995 CW_Type
:= Class_Wide_Type
(T
);
18996 Set_Materialize_Entity
(CW_Type
, False);
18998 -- The class wide type can have been defined by the partial view, in
18999 -- which case everything is already done.
19005 -- Default case, we need to create a new class-wide type
19009 New_External_Entity
(E_Void
, Scope
(T
), Sloc
(T
), T
, 'C', 0, 'T');
19012 -- Inherit root type characteristics
19014 CW_Name
:= Chars
(CW_Type
);
19015 Next_E
:= Next_Entity
(CW_Type
);
19016 Prev_E
:= Prev_Entity
(CW_Type
);
19017 Copy_Node
(T
, CW_Type
);
19018 Set_Comes_From_Source
(CW_Type
, False);
19019 Set_Chars
(CW_Type
, CW_Name
);
19020 Set_Parent
(CW_Type
, Parent
(T
));
19021 Set_Prev_Entity
(CW_Type
, Prev_E
);
19022 Set_Next_Entity
(CW_Type
, Next_E
);
19024 -- Ensure we have a new freeze node for the class-wide type. The partial
19025 -- view may have freeze action of its own, requiring a proper freeze
19026 -- node, and the same freeze node cannot be shared between the two
19029 Set_Has_Delayed_Freeze
(CW_Type
);
19030 Set_Freeze_Node
(CW_Type
, Empty
);
19032 -- Customize the class-wide type: It has no prim. op., it cannot be
19033 -- abstract, its Etype points back to the specific root type, and it
19034 -- cannot have any invariants.
19036 Set_Ekind
(CW_Type
, E_Class_Wide_Type
);
19037 Set_Is_Tagged_Type
(CW_Type
, True);
19038 Set_Direct_Primitive_Operations
(CW_Type
, New_Elmt_List
);
19039 Set_Is_Abstract_Type
(CW_Type
, False);
19040 Set_Is_Constrained
(CW_Type
, False);
19041 Set_Is_First_Subtype
(CW_Type
, Is_First_Subtype
(T
));
19042 Set_Default_SSO
(CW_Type
);
19043 Set_Has_Inheritable_Invariants
(CW_Type
, False);
19044 Set_Has_Inherited_Invariants
(CW_Type
, False);
19045 Set_Has_Own_Invariants
(CW_Type
, False);
19047 if Ekind
(T
) = E_Class_Wide_Subtype
then
19048 Set_Etype
(CW_Type
, Etype
(Base_Type
(T
)));
19050 Set_Etype
(CW_Type
, T
);
19053 Set_No_Tagged_Streams_Pragma
(CW_Type
, No_Tagged_Streams
);
19055 -- If this is the class_wide type of a constrained subtype, it does
19056 -- not have discriminants.
19058 Set_Has_Discriminants
(CW_Type
,
19059 Has_Discriminants
(T
) and then not Is_Constrained
(T
));
19061 Set_Has_Unknown_Discriminants
(CW_Type
, True);
19062 Set_Class_Wide_Type
(T
, CW_Type
);
19063 Set_Equivalent_Type
(CW_Type
, Empty
);
19065 -- The class-wide type of a class-wide type is itself (RM 3.9(14))
19067 Set_Class_Wide_Type
(CW_Type
, CW_Type
);
19068 end Make_Class_Wide_Type
;
19074 procedure Make_Index
19076 Related_Nod
: Node_Id
;
19077 Related_Id
: Entity_Id
:= Empty
;
19078 Suffix_Index
: Nat
:= 1;
19079 In_Iter_Schm
: Boolean := False)
19083 Def_Id
: Entity_Id
:= Empty
;
19084 Found
: Boolean := False;
19087 -- For a discrete range used in a constrained array definition and
19088 -- defined by a range, an implicit conversion to the predefined type
19089 -- INTEGER is assumed if each bound is either a numeric literal, a named
19090 -- number, or an attribute, and the type of both bounds (prior to the
19091 -- implicit conversion) is the type universal_integer. Otherwise, both
19092 -- bounds must be of the same discrete type, other than universal
19093 -- integer; this type must be determinable independently of the
19094 -- context, but using the fact that the type must be discrete and that
19095 -- both bounds must have the same type.
19097 -- Character literals also have a universal type in the absence of
19098 -- of additional context, and are resolved to Standard_Character.
19100 if Nkind
(N
) = N_Range
then
19102 -- The index is given by a range constraint. The bounds are known
19103 -- to be of a consistent type.
19105 if not Is_Overloaded
(N
) then
19108 -- For universal bounds, choose the specific predefined type
19110 if T
= Universal_Integer
then
19111 T
:= Standard_Integer
;
19113 elsif T
= Any_Character
then
19114 Ambiguous_Character
(Low_Bound
(N
));
19116 T
:= Standard_Character
;
19119 -- The node may be overloaded because some user-defined operators
19120 -- are available, but if a universal interpretation exists it is
19121 -- also the selected one.
19123 elsif Universal_Interpretation
(N
) = Universal_Integer
then
19124 T
:= Standard_Integer
;
19130 Ind
: Interp_Index
;
19134 Get_First_Interp
(N
, Ind
, It
);
19135 while Present
(It
.Typ
) loop
19136 if Is_Discrete_Type
(It
.Typ
) then
19139 and then not Covers
(It
.Typ
, T
)
19140 and then not Covers
(T
, It
.Typ
)
19142 Error_Msg_N
("ambiguous bounds in discrete range", N
);
19150 Get_Next_Interp
(Ind
, It
);
19153 if T
= Any_Type
then
19154 Error_Msg_N
("discrete type required for range", N
);
19155 Set_Etype
(N
, Any_Type
);
19158 elsif T
= Universal_Integer
then
19159 T
:= Standard_Integer
;
19164 if not Is_Discrete_Type
(T
) then
19165 Error_Msg_N
("discrete type required for range", N
);
19166 Set_Etype
(N
, Any_Type
);
19170 if Nkind
(Low_Bound
(N
)) = N_Attribute_Reference
19171 and then Attribute_Name
(Low_Bound
(N
)) = Name_First
19172 and then Is_Entity_Name
(Prefix
(Low_Bound
(N
)))
19173 and then Is_Type
(Entity
(Prefix
(Low_Bound
(N
))))
19174 and then Is_Discrete_Type
(Entity
(Prefix
(Low_Bound
(N
))))
19176 -- The type of the index will be the type of the prefix, as long
19177 -- as the upper bound is 'Last of the same type.
19179 Def_Id
:= Entity
(Prefix
(Low_Bound
(N
)));
19181 if Nkind
(High_Bound
(N
)) /= N_Attribute_Reference
19182 or else Attribute_Name
(High_Bound
(N
)) /= Name_Last
19183 or else not Is_Entity_Name
(Prefix
(High_Bound
(N
)))
19184 or else Entity
(Prefix
(High_Bound
(N
))) /= Def_Id
19191 Process_Range_Expr_In_Decl
(R
, T
, In_Iter_Schm
=> In_Iter_Schm
);
19193 elsif Nkind
(N
) = N_Subtype_Indication
then
19195 -- The index is given by a subtype with a range constraint
19197 T
:= Base_Type
(Entity
(Subtype_Mark
(N
)));
19199 if not Is_Discrete_Type
(T
) then
19200 Error_Msg_N
("discrete type required for range", N
);
19201 Set_Etype
(N
, Any_Type
);
19205 R
:= Range_Expression
(Constraint
(N
));
19208 Process_Range_Expr_In_Decl
19209 (R
, Entity
(Subtype_Mark
(N
)), In_Iter_Schm
=> In_Iter_Schm
);
19211 elsif Nkind
(N
) = N_Attribute_Reference
then
19213 -- Catch beginner's error (use of attribute other than 'Range)
19215 if Attribute_Name
(N
) /= Name_Range
then
19216 Error_Msg_N
("expect attribute ''Range", N
);
19217 Set_Etype
(N
, Any_Type
);
19221 -- If the node denotes the range of a type mark, that is also the
19222 -- resulting type, and we do not need to create an Itype for it.
19224 if Is_Entity_Name
(Prefix
(N
))
19225 and then Comes_From_Source
(N
)
19226 and then Is_Type
(Entity
(Prefix
(N
)))
19227 and then Is_Discrete_Type
(Entity
(Prefix
(N
)))
19229 Def_Id
:= Entity
(Prefix
(N
));
19232 Analyze_And_Resolve
(N
);
19236 -- If none of the above, must be a subtype. We convert this to a
19237 -- range attribute reference because in the case of declared first
19238 -- named subtypes, the types in the range reference can be different
19239 -- from the type of the entity. A range attribute normalizes the
19240 -- reference and obtains the correct types for the bounds.
19242 -- This transformation is in the nature of an expansion, is only
19243 -- done if expansion is active. In particular, it is not done on
19244 -- formal generic types, because we need to retain the name of the
19245 -- original index for instantiation purposes.
19248 if not Is_Entity_Name
(N
) or else not Is_Type
(Entity
(N
)) then
19249 Error_Msg_N
("invalid subtype mark in discrete range ", N
);
19250 Set_Etype
(N
, Any_Integer
);
19254 -- The type mark may be that of an incomplete type. It is only
19255 -- now that we can get the full view, previous analysis does
19256 -- not look specifically for a type mark.
19258 Set_Entity
(N
, Get_Full_View
(Entity
(N
)));
19259 Set_Etype
(N
, Entity
(N
));
19260 Def_Id
:= Entity
(N
);
19262 if not Is_Discrete_Type
(Def_Id
) then
19263 Error_Msg_N
("discrete type required for index", N
);
19264 Set_Etype
(N
, Any_Type
);
19269 if Expander_Active
then
19271 Make_Attribute_Reference
(Sloc
(N
),
19272 Attribute_Name
=> Name_Range
,
19273 Prefix
=> Relocate_Node
(N
)));
19275 -- The original was a subtype mark that does not freeze. This
19276 -- means that the rewritten version must not freeze either.
19278 Set_Must_Not_Freeze
(N
);
19279 Set_Must_Not_Freeze
(Prefix
(N
));
19280 Analyze_And_Resolve
(N
);
19284 -- If expander is inactive, type is legal, nothing else to construct
19291 if not Is_Discrete_Type
(T
) then
19292 Error_Msg_N
("discrete type required for range", N
);
19293 Set_Etype
(N
, Any_Type
);
19296 elsif T
= Any_Type
then
19297 Set_Etype
(N
, Any_Type
);
19301 -- We will now create the appropriate Itype to describe the range, but
19302 -- first a check. If we originally had a subtype, then we just label
19303 -- the range with this subtype. Not only is there no need to construct
19304 -- a new subtype, but it is wrong to do so for two reasons:
19306 -- 1. A legality concern, if we have a subtype, it must not freeze,
19307 -- and the Itype would cause freezing incorrectly
19309 -- 2. An efficiency concern, if we created an Itype, it would not be
19310 -- recognized as the same type for the purposes of eliminating
19311 -- checks in some circumstances.
19313 -- We signal this case by setting the subtype entity in Def_Id
19315 if No
(Def_Id
) then
19317 Create_Itype
(E_Void
, Related_Nod
, Related_Id
, 'D', Suffix_Index
);
19318 Set_Etype
(Def_Id
, Base_Type
(T
));
19320 if Is_Signed_Integer_Type
(T
) then
19321 Set_Ekind
(Def_Id
, E_Signed_Integer_Subtype
);
19323 elsif Is_Modular_Integer_Type
(T
) then
19324 Set_Ekind
(Def_Id
, E_Modular_Integer_Subtype
);
19327 Set_Ekind
(Def_Id
, E_Enumeration_Subtype
);
19328 Set_Is_Character_Type
(Def_Id
, Is_Character_Type
(T
));
19329 Set_First_Literal
(Def_Id
, First_Literal
(T
));
19332 Set_Size_Info
(Def_Id
, (T
));
19333 Set_RM_Size
(Def_Id
, RM_Size
(T
));
19334 Set_First_Rep_Item
(Def_Id
, First_Rep_Item
(T
));
19336 Set_Scalar_Range
(Def_Id
, R
);
19337 Conditional_Delay
(Def_Id
, T
);
19339 if Nkind
(N
) = N_Subtype_Indication
then
19340 Inherit_Predicate_Flags
(Def_Id
, Entity
(Subtype_Mark
(N
)));
19343 -- In the subtype indication case, if the immediate parent of the
19344 -- new subtype is non-static, then the subtype we create is non-
19345 -- static, even if its bounds are static.
19347 if Nkind
(N
) = N_Subtype_Indication
19348 and then not Is_OK_Static_Subtype
(Entity
(Subtype_Mark
(N
)))
19350 Set_Is_Non_Static_Subtype
(Def_Id
);
19354 -- Final step is to label the index with this constructed type
19356 Set_Etype
(N
, Def_Id
);
19359 ------------------------------
19360 -- Modular_Type_Declaration --
19361 ------------------------------
19363 procedure Modular_Type_Declaration
(T
: Entity_Id
; Def
: Node_Id
) is
19364 Mod_Expr
: constant Node_Id
:= Expression
(Def
);
19367 procedure Set_Modular_Size
(Bits
: Int
);
19368 -- Sets RM_Size to Bits, and Esize to normal word size above this
19370 ----------------------
19371 -- Set_Modular_Size --
19372 ----------------------
19374 procedure Set_Modular_Size
(Bits
: Int
) is
19376 Set_RM_Size
(T
, UI_From_Int
(Bits
));
19381 elsif Bits
<= 16 then
19382 Init_Esize
(T
, 16);
19384 elsif Bits
<= 32 then
19385 Init_Esize
(T
, 32);
19388 Init_Esize
(T
, System_Max_Binary_Modulus_Power
);
19391 if not Non_Binary_Modulus
(T
) and then Esize
(T
) = RM_Size
(T
) then
19392 Set_Is_Known_Valid
(T
);
19394 end Set_Modular_Size
;
19396 -- Start of processing for Modular_Type_Declaration
19399 -- If the mod expression is (exactly) 2 * literal, where literal is
19400 -- 64 or less,then almost certainly the * was meant to be **. Warn.
19402 if Warn_On_Suspicious_Modulus_Value
19403 and then Nkind
(Mod_Expr
) = N_Op_Multiply
19404 and then Nkind
(Left_Opnd
(Mod_Expr
)) = N_Integer_Literal
19405 and then Intval
(Left_Opnd
(Mod_Expr
)) = Uint_2
19406 and then Nkind
(Right_Opnd
(Mod_Expr
)) = N_Integer_Literal
19407 and then Intval
(Right_Opnd
(Mod_Expr
)) <= Uint_64
19410 ("suspicious MOD value, was '*'* intended'??M?", Mod_Expr
);
19413 -- Proceed with analysis of mod expression
19415 Analyze_And_Resolve
(Mod_Expr
, Any_Integer
);
19417 Set_Ekind
(T
, E_Modular_Integer_Type
);
19418 Init_Alignment
(T
);
19419 Set_Is_Constrained
(T
);
19421 if not Is_OK_Static_Expression
(Mod_Expr
) then
19422 Flag_Non_Static_Expr
19423 ("non-static expression used for modular type bound!", Mod_Expr
);
19424 M_Val
:= 2 ** System_Max_Binary_Modulus_Power
;
19426 M_Val
:= Expr_Value
(Mod_Expr
);
19430 Error_Msg_N
("modulus value must be positive", Mod_Expr
);
19431 M_Val
:= 2 ** System_Max_Binary_Modulus_Power
;
19434 if M_Val
> 2 ** Standard_Long_Integer_Size
then
19435 Check_Restriction
(No_Long_Long_Integers
, Mod_Expr
);
19438 Set_Modulus
(T
, M_Val
);
19440 -- Create bounds for the modular type based on the modulus given in
19441 -- the type declaration and then analyze and resolve those bounds.
19443 Set_Scalar_Range
(T
,
19444 Make_Range
(Sloc
(Mod_Expr
),
19445 Low_Bound
=> Make_Integer_Literal
(Sloc
(Mod_Expr
), 0),
19446 High_Bound
=> Make_Integer_Literal
(Sloc
(Mod_Expr
), M_Val
- 1)));
19448 -- Properly analyze the literals for the range. We do this manually
19449 -- because we can't go calling Resolve, since we are resolving these
19450 -- bounds with the type, and this type is certainly not complete yet.
19452 Set_Etype
(Low_Bound
(Scalar_Range
(T
)), T
);
19453 Set_Etype
(High_Bound
(Scalar_Range
(T
)), T
);
19454 Set_Is_Static_Expression
(Low_Bound
(Scalar_Range
(T
)));
19455 Set_Is_Static_Expression
(High_Bound
(Scalar_Range
(T
)));
19457 -- Loop through powers of two to find number of bits required
19459 for Bits
in Int
range 0 .. System_Max_Binary_Modulus_Power
loop
19463 if M_Val
= 2 ** Bits
then
19464 Set_Modular_Size
(Bits
);
19469 elsif M_Val
< 2 ** Bits
then
19470 Check_SPARK_05_Restriction
("modulus should be a power of 2", T
);
19471 Set_Non_Binary_Modulus
(T
);
19473 if Bits
> System_Max_Nonbinary_Modulus_Power
then
19474 Error_Msg_Uint_1
:=
19475 UI_From_Int
(System_Max_Nonbinary_Modulus_Power
);
19477 ("nonbinary modulus exceeds limit (2 '*'*^ - 1)", Mod_Expr
);
19478 Set_Modular_Size
(System_Max_Binary_Modulus_Power
);
19482 -- In the nonbinary case, set size as per RM 13.3(55)
19484 Set_Modular_Size
(Bits
);
19491 -- If we fall through, then the size exceed System.Max_Binary_Modulus
19492 -- so we just signal an error and set the maximum size.
19494 Error_Msg_Uint_1
:= UI_From_Int
(System_Max_Binary_Modulus_Power
);
19495 Error_Msg_F
("modulus exceeds limit (2 '*'*^)", Mod_Expr
);
19497 Set_Modular_Size
(System_Max_Binary_Modulus_Power
);
19498 Init_Alignment
(T
);
19500 end Modular_Type_Declaration
;
19502 --------------------------
19503 -- New_Concatenation_Op --
19504 --------------------------
19506 procedure New_Concatenation_Op
(Typ
: Entity_Id
) is
19507 Loc
: constant Source_Ptr
:= Sloc
(Typ
);
19510 function Make_Op_Formal
(Typ
, Op
: Entity_Id
) return Entity_Id
;
19511 -- Create abbreviated declaration for the formal of a predefined
19512 -- Operator 'Op' of type 'Typ'
19514 --------------------
19515 -- Make_Op_Formal --
19516 --------------------
19518 function Make_Op_Formal
(Typ
, Op
: Entity_Id
) return Entity_Id
is
19519 Formal
: Entity_Id
;
19521 Formal
:= New_Internal_Entity
(E_In_Parameter
, Op
, Loc
, 'P');
19522 Set_Etype
(Formal
, Typ
);
19523 Set_Mechanism
(Formal
, Default_Mechanism
);
19525 end Make_Op_Formal
;
19527 -- Start of processing for New_Concatenation_Op
19530 Op
:= Make_Defining_Operator_Symbol
(Loc
, Name_Op_Concat
);
19532 Set_Ekind
(Op
, E_Operator
);
19533 Set_Scope
(Op
, Current_Scope
);
19534 Set_Etype
(Op
, Typ
);
19535 Set_Homonym
(Op
, Get_Name_Entity_Id
(Name_Op_Concat
));
19536 Set_Is_Immediately_Visible
(Op
);
19537 Set_Is_Intrinsic_Subprogram
(Op
);
19538 Set_Has_Completion
(Op
);
19539 Append_Entity
(Op
, Current_Scope
);
19541 Set_Name_Entity_Id
(Name_Op_Concat
, Op
);
19543 Append_Entity
(Make_Op_Formal
(Typ
, Op
), Op
);
19544 Append_Entity
(Make_Op_Formal
(Typ
, Op
), Op
);
19545 end New_Concatenation_Op
;
19547 -------------------------
19548 -- OK_For_Limited_Init --
19549 -------------------------
19551 -- ???Check all calls of this, and compare the conditions under which it's
19554 function OK_For_Limited_Init
19556 Exp
: Node_Id
) return Boolean
19559 return Is_CPP_Constructor_Call
(Exp
)
19560 or else (Ada_Version
>= Ada_2005
19561 and then not Debug_Flag_Dot_L
19562 and then OK_For_Limited_Init_In_05
(Typ
, Exp
));
19563 end OK_For_Limited_Init
;
19565 -------------------------------
19566 -- OK_For_Limited_Init_In_05 --
19567 -------------------------------
19569 function OK_For_Limited_Init_In_05
19571 Exp
: Node_Id
) return Boolean
19574 -- An object of a limited interface type can be initialized with any
19575 -- expression of a nonlimited descendant type. However this does not
19576 -- apply if this is a view conversion of some other expression. This
19577 -- is checked below.
19579 if Is_Class_Wide_Type
(Typ
)
19580 and then Is_Limited_Interface
(Typ
)
19581 and then not Is_Limited_Type
(Etype
(Exp
))
19582 and then Nkind
(Exp
) /= N_Type_Conversion
19587 -- Ada 2005 (AI-287, AI-318): Relax the strictness of the front end in
19588 -- case of limited aggregates (including extension aggregates), and
19589 -- function calls. The function call may have been given in prefixed
19590 -- notation, in which case the original node is an indexed component.
19591 -- If the function is parameterless, the original node was an explicit
19592 -- dereference. The function may also be parameterless, in which case
19593 -- the source node is just an identifier.
19595 -- A branch of a conditional expression may have been removed if the
19596 -- condition is statically known. This happens during expansion, and
19597 -- thus will not happen if previous errors were encountered. The check
19598 -- will have been performed on the chosen branch, which replaces the
19599 -- original conditional expression.
19605 case Nkind
(Original_Node
(Exp
)) is
19607 | N_Extension_Aggregate
19613 when N_Identifier
=>
19614 return Present
(Entity
(Original_Node
(Exp
)))
19615 and then Ekind
(Entity
(Original_Node
(Exp
))) = E_Function
;
19617 when N_Qualified_Expression
=>
19619 OK_For_Limited_Init_In_05
19620 (Typ
, Expression
(Original_Node
(Exp
)));
19622 -- Ada 2005 (AI-251): If a class-wide interface object is initialized
19623 -- with a function call, the expander has rewritten the call into an
19624 -- N_Type_Conversion node to force displacement of the pointer to
19625 -- reference the component containing the secondary dispatch table.
19626 -- Otherwise a type conversion is not a legal context.
19627 -- A return statement for a build-in-place function returning a
19628 -- synchronized type also introduces an unchecked conversion.
19630 when N_Type_Conversion
19631 | N_Unchecked_Type_Conversion
19633 return not Comes_From_Source
(Exp
)
19635 OK_For_Limited_Init_In_05
19636 (Typ
, Expression
(Original_Node
(Exp
)));
19638 when N_Explicit_Dereference
19639 | N_Indexed_Component
19640 | N_Selected_Component
19642 return Nkind
(Exp
) = N_Function_Call
;
19644 -- A use of 'Input is a function call, hence allowed. Normally the
19645 -- attribute will be changed to a call, but the attribute by itself
19646 -- can occur with -gnatc.
19648 when N_Attribute_Reference
=>
19649 return Attribute_Name
(Original_Node
(Exp
)) = Name_Input
;
19651 -- "return raise ..." is OK
19653 when N_Raise_Expression
=>
19656 -- For a case expression, all dependent expressions must be legal
19658 when N_Case_Expression
=>
19663 Alt
:= First
(Alternatives
(Original_Node
(Exp
)));
19664 while Present
(Alt
) loop
19665 if not OK_For_Limited_Init_In_05
(Typ
, Expression
(Alt
)) then
19675 -- For an if expression, all dependent expressions must be legal
19677 when N_If_Expression
=>
19679 Then_Expr
: constant Node_Id
:=
19680 Next
(First
(Expressions
(Original_Node
(Exp
))));
19681 Else_Expr
: constant Node_Id
:= Next
(Then_Expr
);
19683 return OK_For_Limited_Init_In_05
(Typ
, Then_Expr
)
19685 OK_For_Limited_Init_In_05
(Typ
, Else_Expr
);
19691 end OK_For_Limited_Init_In_05
;
19693 -------------------------------------------
19694 -- Ordinary_Fixed_Point_Type_Declaration --
19695 -------------------------------------------
19697 procedure Ordinary_Fixed_Point_Type_Declaration
19701 Loc
: constant Source_Ptr
:= Sloc
(Def
);
19702 Delta_Expr
: constant Node_Id
:= Delta_Expression
(Def
);
19703 RRS
: constant Node_Id
:= Real_Range_Specification
(Def
);
19704 Implicit_Base
: Entity_Id
;
19711 Check_Restriction
(No_Fixed_Point
, Def
);
19713 -- Create implicit base type
19716 Create_Itype
(E_Ordinary_Fixed_Point_Type
, Parent
(Def
), T
, 'B');
19717 Set_Etype
(Implicit_Base
, Implicit_Base
);
19719 -- Analyze and process delta expression
19721 Analyze_And_Resolve
(Delta_Expr
, Any_Real
);
19723 Check_Delta_Expression
(Delta_Expr
);
19724 Delta_Val
:= Expr_Value_R
(Delta_Expr
);
19726 Set_Delta_Value
(Implicit_Base
, Delta_Val
);
19728 -- Compute default small from given delta, which is the largest power
19729 -- of two that does not exceed the given delta value.
19739 if Delta_Val
< Ureal_1
then
19740 while Delta_Val
< Tmp
loop
19741 Tmp
:= Tmp
/ Ureal_2
;
19742 Scale
:= Scale
+ 1;
19747 Tmp
:= Tmp
* Ureal_2
;
19748 exit when Tmp
> Delta_Val
;
19749 Scale
:= Scale
- 1;
19753 Small_Val
:= UR_From_Components
(Uint_1
, UI_From_Int
(Scale
), 2);
19756 Set_Small_Value
(Implicit_Base
, Small_Val
);
19758 -- If no range was given, set a dummy range
19760 if RRS
<= Empty_Or_Error
then
19761 Low_Val
:= -Small_Val
;
19762 High_Val
:= Small_Val
;
19764 -- Otherwise analyze and process given range
19768 Low
: constant Node_Id
:= Low_Bound
(RRS
);
19769 High
: constant Node_Id
:= High_Bound
(RRS
);
19772 Analyze_And_Resolve
(Low
, Any_Real
);
19773 Analyze_And_Resolve
(High
, Any_Real
);
19774 Check_Real_Bound
(Low
);
19775 Check_Real_Bound
(High
);
19777 -- Obtain and set the range
19779 Low_Val
:= Expr_Value_R
(Low
);
19780 High_Val
:= Expr_Value_R
(High
);
19782 if Low_Val
> High_Val
then
19783 Error_Msg_NE
("??fixed point type& has null range", Def
, T
);
19788 -- The range for both the implicit base and the declared first subtype
19789 -- cannot be set yet, so we use the special routine Set_Fixed_Range to
19790 -- set a temporary range in place. Note that the bounds of the base
19791 -- type will be widened to be symmetrical and to fill the available
19792 -- bits when the type is frozen.
19794 -- We could do this with all discrete types, and probably should, but
19795 -- we absolutely have to do it for fixed-point, since the end-points
19796 -- of the range and the size are determined by the small value, which
19797 -- could be reset before the freeze point.
19799 Set_Fixed_Range
(Implicit_Base
, Loc
, Low_Val
, High_Val
);
19800 Set_Fixed_Range
(T
, Loc
, Low_Val
, High_Val
);
19802 -- Complete definition of first subtype. The inheritance of the rep item
19803 -- chain ensures that SPARK-related pragmas are not clobbered when the
19804 -- ordinary fixed point type acts as a full view of a private type.
19806 Set_Ekind
(T
, E_Ordinary_Fixed_Point_Subtype
);
19807 Set_Etype
(T
, Implicit_Base
);
19808 Init_Size_Align
(T
);
19809 Inherit_Rep_Item_Chain
(T
, Implicit_Base
);
19810 Set_Small_Value
(T
, Small_Val
);
19811 Set_Delta_Value
(T
, Delta_Val
);
19812 Set_Is_Constrained
(T
);
19813 end Ordinary_Fixed_Point_Type_Declaration
;
19815 ----------------------------------
19816 -- Preanalyze_Assert_Expression --
19817 ----------------------------------
19819 procedure Preanalyze_Assert_Expression
(N
: Node_Id
; T
: Entity_Id
) is
19821 In_Assertion_Expr
:= In_Assertion_Expr
+ 1;
19822 Preanalyze_Spec_Expression
(N
, T
);
19823 In_Assertion_Expr
:= In_Assertion_Expr
- 1;
19824 end Preanalyze_Assert_Expression
;
19826 -----------------------------------
19827 -- Preanalyze_Default_Expression --
19828 -----------------------------------
19830 procedure Preanalyze_Default_Expression
(N
: Node_Id
; T
: Entity_Id
) is
19831 Save_In_Default_Expr
: constant Boolean := In_Default_Expr
;
19832 Save_In_Spec_Expression
: constant Boolean := In_Spec_Expression
;
19835 In_Default_Expr
:= True;
19836 In_Spec_Expression
:= True;
19838 Preanalyze_With_Freezing_And_Resolve
(N
, T
);
19840 In_Default_Expr
:= Save_In_Default_Expr
;
19841 In_Spec_Expression
:= Save_In_Spec_Expression
;
19842 end Preanalyze_Default_Expression
;
19844 --------------------------------
19845 -- Preanalyze_Spec_Expression --
19846 --------------------------------
19848 procedure Preanalyze_Spec_Expression
(N
: Node_Id
; T
: Entity_Id
) is
19849 Save_In_Spec_Expression
: constant Boolean := In_Spec_Expression
;
19851 In_Spec_Expression
:= True;
19852 Preanalyze_And_Resolve
(N
, T
);
19853 In_Spec_Expression
:= Save_In_Spec_Expression
;
19854 end Preanalyze_Spec_Expression
;
19856 ----------------------------------------
19857 -- Prepare_Private_Subtype_Completion --
19858 ----------------------------------------
19860 procedure Prepare_Private_Subtype_Completion
19862 Related_Nod
: Node_Id
)
19864 Id_B
: constant Entity_Id
:= Base_Type
(Id
);
19865 Full_B
: Entity_Id
:= Full_View
(Id_B
);
19869 if Present
(Full_B
) then
19871 -- Get to the underlying full view if necessary
19873 if Is_Private_Type
(Full_B
)
19874 and then Present
(Underlying_Full_View
(Full_B
))
19876 Full_B
:= Underlying_Full_View
(Full_B
);
19879 -- The Base_Type is already completed, we can complete the subtype
19880 -- now. We have to create a new entity with the same name, Thus we
19881 -- can't use Create_Itype.
19883 Full
:= Make_Defining_Identifier
(Sloc
(Id
), Chars
(Id
));
19884 Set_Is_Itype
(Full
);
19885 Set_Associated_Node_For_Itype
(Full
, Related_Nod
);
19886 Complete_Private_Subtype
(Id
, Full
, Full_B
, Related_Nod
);
19889 -- The parent subtype may be private, but the base might not, in some
19890 -- nested instances. In that case, the subtype does not need to be
19891 -- exchanged. It would still be nice to make private subtypes and their
19892 -- bases consistent at all times ???
19894 if Is_Private_Type
(Id_B
) then
19895 Append_Elmt
(Id
, Private_Dependents
(Id_B
));
19897 end Prepare_Private_Subtype_Completion
;
19899 ---------------------------
19900 -- Process_Discriminants --
19901 ---------------------------
19903 procedure Process_Discriminants
19905 Prev
: Entity_Id
:= Empty
)
19907 Elist
: constant Elist_Id
:= New_Elmt_List
;
19910 Discr_Number
: Uint
;
19911 Discr_Type
: Entity_Id
;
19912 Default_Present
: Boolean := False;
19913 Default_Not_Present
: Boolean := False;
19916 -- A composite type other than an array type can have discriminants.
19917 -- On entry, the current scope is the composite type.
19919 -- The discriminants are initially entered into the scope of the type
19920 -- via Enter_Name with the default Ekind of E_Void to prevent premature
19921 -- use, as explained at the end of this procedure.
19923 Discr
:= First
(Discriminant_Specifications
(N
));
19924 while Present
(Discr
) loop
19925 Enter_Name
(Defining_Identifier
(Discr
));
19927 -- For navigation purposes we add a reference to the discriminant
19928 -- in the entity for the type. If the current declaration is a
19929 -- completion, place references on the partial view. Otherwise the
19930 -- type is the current scope.
19932 if Present
(Prev
) then
19934 -- The references go on the partial view, if present. If the
19935 -- partial view has discriminants, the references have been
19936 -- generated already.
19938 if not Has_Discriminants
(Prev
) then
19939 Generate_Reference
(Prev
, Defining_Identifier
(Discr
), 'd');
19943 (Current_Scope
, Defining_Identifier
(Discr
), 'd');
19946 if Nkind
(Discriminant_Type
(Discr
)) = N_Access_Definition
then
19947 Discr_Type
:= Access_Definition
(Discr
, Discriminant_Type
(Discr
));
19949 -- Ada 2005 (AI-254)
19951 if Present
(Access_To_Subprogram_Definition
19952 (Discriminant_Type
(Discr
)))
19953 and then Protected_Present
(Access_To_Subprogram_Definition
19954 (Discriminant_Type
(Discr
)))
19957 Replace_Anonymous_Access_To_Protected_Subprogram
(Discr
);
19961 Find_Type
(Discriminant_Type
(Discr
));
19962 Discr_Type
:= Etype
(Discriminant_Type
(Discr
));
19964 if Error_Posted
(Discriminant_Type
(Discr
)) then
19965 Discr_Type
:= Any_Type
;
19969 -- Handling of discriminants that are access types
19971 if Is_Access_Type
(Discr_Type
) then
19973 -- Ada 2005 (AI-230): Access discriminant allowed in non-
19974 -- limited record types
19976 if Ada_Version
< Ada_2005
then
19977 Check_Access_Discriminant_Requires_Limited
19978 (Discr
, Discriminant_Type
(Discr
));
19981 if Ada_Version
= Ada_83
and then Comes_From_Source
(Discr
) then
19983 ("(Ada 83) access discriminant not allowed", Discr
);
19986 -- If not access type, must be a discrete type
19988 elsif not Is_Discrete_Type
(Discr_Type
) then
19990 ("discriminants must have a discrete or access type",
19991 Discriminant_Type
(Discr
));
19994 Set_Etype
(Defining_Identifier
(Discr
), Discr_Type
);
19996 -- If a discriminant specification includes the assignment compound
19997 -- delimiter followed by an expression, the expression is the default
19998 -- expression of the discriminant; the default expression must be of
19999 -- the type of the discriminant. (RM 3.7.1) Since this expression is
20000 -- a default expression, we do the special preanalysis, since this
20001 -- expression does not freeze (see section "Handling of Default and
20002 -- Per-Object Expressions" in spec of package Sem).
20004 if Present
(Expression
(Discr
)) then
20005 Preanalyze_Spec_Expression
(Expression
(Discr
), Discr_Type
);
20009 if Nkind
(N
) = N_Formal_Type_Declaration
then
20011 ("discriminant defaults not allowed for formal type",
20012 Expression
(Discr
));
20014 -- Flag an error for a tagged type with defaulted discriminants,
20015 -- excluding limited tagged types when compiling for Ada 2012
20016 -- (see AI05-0214).
20018 elsif Is_Tagged_Type
(Current_Scope
)
20019 and then (not Is_Limited_Type
(Current_Scope
)
20020 or else Ada_Version
< Ada_2012
)
20021 and then Comes_From_Source
(N
)
20023 -- Note: see similar test in Check_Or_Process_Discriminants, to
20024 -- handle the (illegal) case of the completion of an untagged
20025 -- view with discriminants with defaults by a tagged full view.
20026 -- We skip the check if Discr does not come from source, to
20027 -- account for the case of an untagged derived type providing
20028 -- defaults for a renamed discriminant from a private untagged
20029 -- ancestor with a tagged full view (ACATS B460006).
20031 if Ada_Version
>= Ada_2012
then
20033 ("discriminants of nonlimited tagged type cannot have"
20035 Expression
(Discr
));
20038 ("discriminants of tagged type cannot have defaults",
20039 Expression
(Discr
));
20043 Default_Present
:= True;
20044 Append_Elmt
(Expression
(Discr
), Elist
);
20046 -- Tag the defining identifiers for the discriminants with
20047 -- their corresponding default expressions from the tree.
20049 Set_Discriminant_Default_Value
20050 (Defining_Identifier
(Discr
), Expression
(Discr
));
20053 -- In gnatc or gnatprove mode, make sure set Do_Range_Check flag
20054 -- gets set unless we can be sure that no range check is required.
20056 if (GNATprove_Mode
or not Expander_Active
)
20059 (Expression
(Discr
), Discr_Type
, Assume_Valid
=> True)
20061 Set_Do_Range_Check
(Expression
(Discr
));
20064 -- No default discriminant value given
20067 Default_Not_Present
:= True;
20070 -- Ada 2005 (AI-231): Create an Itype that is a duplicate of
20071 -- Discr_Type but with the null-exclusion attribute
20073 if Ada_Version
>= Ada_2005
then
20075 -- Ada 2005 (AI-231): Static checks
20077 if Can_Never_Be_Null
(Discr_Type
) then
20078 Null_Exclusion_Static_Checks
(Discr
);
20080 elsif Is_Access_Type
(Discr_Type
)
20081 and then Null_Exclusion_Present
(Discr
)
20083 -- No need to check itypes because in their case this check
20084 -- was done at their point of creation
20086 and then not Is_Itype
(Discr_Type
)
20088 if Can_Never_Be_Null
(Discr_Type
) then
20090 ("`NOT NULL` not allowed (& already excludes null)",
20095 Set_Etype
(Defining_Identifier
(Discr
),
20096 Create_Null_Excluding_Itype
20098 Related_Nod
=> Discr
));
20100 -- Check for improper null exclusion if the type is otherwise
20101 -- legal for a discriminant.
20103 elsif Null_Exclusion_Present
(Discr
)
20104 and then Is_Discrete_Type
(Discr_Type
)
20107 ("null exclusion can only apply to an access type", Discr
);
20110 -- Ada 2005 (AI-402): access discriminants of nonlimited types
20111 -- can't have defaults. Synchronized types, or types that are
20112 -- explicitly limited are fine, but special tests apply to derived
20113 -- types in generics: in a generic body we have to assume the
20114 -- worst, and therefore defaults are not allowed if the parent is
20115 -- a generic formal private type (see ACATS B370001).
20117 if Is_Access_Type
(Discr_Type
) and then Default_Present
then
20118 if Ekind
(Discr_Type
) /= E_Anonymous_Access_Type
20119 or else Is_Limited_Record
(Current_Scope
)
20120 or else Is_Concurrent_Type
(Current_Scope
)
20121 or else Is_Concurrent_Record_Type
(Current_Scope
)
20122 or else Ekind
(Current_Scope
) = E_Limited_Private_Type
20124 if not Is_Derived_Type
(Current_Scope
)
20125 or else not Is_Generic_Type
(Etype
(Current_Scope
))
20126 or else not In_Package_Body
(Scope
(Etype
(Current_Scope
)))
20127 or else Limited_Present
20128 (Type_Definition
(Parent
(Current_Scope
)))
20134 ("access discriminants of nonlimited types cannot "
20135 & "have defaults", Expression
(Discr
));
20138 elsif Present
(Expression
(Discr
)) then
20140 ("(Ada 2005) access discriminants of nonlimited types "
20141 & "cannot have defaults", Expression
(Discr
));
20146 -- A discriminant cannot be effectively volatile (SPARK RM 7.1.3(4)).
20147 -- This check is relevant only when SPARK_Mode is on as it is not a
20148 -- standard Ada legality rule.
20151 and then Is_Effectively_Volatile
(Defining_Identifier
(Discr
))
20153 Error_Msg_N
("discriminant cannot be volatile", Discr
);
20159 -- An element list consisting of the default expressions of the
20160 -- discriminants is constructed in the above loop and used to set
20161 -- the Discriminant_Constraint attribute for the type. If an object
20162 -- is declared of this (record or task) type without any explicit
20163 -- discriminant constraint given, this element list will form the
20164 -- actual parameters for the corresponding initialization procedure
20167 Set_Discriminant_Constraint
(Current_Scope
, Elist
);
20168 Set_Stored_Constraint
(Current_Scope
, No_Elist
);
20170 -- Default expressions must be provided either for all or for none
20171 -- of the discriminants of a discriminant part. (RM 3.7.1)
20173 if Default_Present
and then Default_Not_Present
then
20175 ("incomplete specification of defaults for discriminants", N
);
20178 -- The use of the name of a discriminant is not allowed in default
20179 -- expressions of a discriminant part if the specification of the
20180 -- discriminant is itself given in the discriminant part. (RM 3.7.1)
20182 -- To detect this, the discriminant names are entered initially with an
20183 -- Ekind of E_Void (which is the default Ekind given by Enter_Name). Any
20184 -- attempt to use a void entity (for example in an expression that is
20185 -- type-checked) produces the error message: premature usage. Now after
20186 -- completing the semantic analysis of the discriminant part, we can set
20187 -- the Ekind of all the discriminants appropriately.
20189 Discr
:= First
(Discriminant_Specifications
(N
));
20190 Discr_Number
:= Uint_1
;
20191 while Present
(Discr
) loop
20192 Id
:= Defining_Identifier
(Discr
);
20193 Set_Ekind
(Id
, E_Discriminant
);
20194 Init_Component_Location
(Id
);
20196 Set_Discriminant_Number
(Id
, Discr_Number
);
20198 -- Make sure this is always set, even in illegal programs
20200 Set_Corresponding_Discriminant
(Id
, Empty
);
20202 -- Initialize the Original_Record_Component to the entity itself.
20203 -- Inherit_Components will propagate the right value to
20204 -- discriminants in derived record types.
20206 Set_Original_Record_Component
(Id
, Id
);
20208 -- Create the discriminal for the discriminant
20210 Build_Discriminal
(Id
);
20213 Discr_Number
:= Discr_Number
+ 1;
20216 Set_Has_Discriminants
(Current_Scope
);
20217 end Process_Discriminants
;
20219 -----------------------
20220 -- Process_Full_View --
20221 -----------------------
20223 -- WARNING: This routine manages Ghost regions. Return statements must be
20224 -- replaced by gotos which jump to the end of the routine and restore the
20227 procedure Process_Full_View
(N
: Node_Id
; Full_T
, Priv_T
: Entity_Id
) is
20228 procedure Collect_Implemented_Interfaces
20230 Ifaces
: Elist_Id
);
20231 -- Ada 2005: Gather all the interfaces that Typ directly or
20232 -- inherently implements. Duplicate entries are not added to
20233 -- the list Ifaces.
20235 ------------------------------------
20236 -- Collect_Implemented_Interfaces --
20237 ------------------------------------
20239 procedure Collect_Implemented_Interfaces
20244 Iface_Elmt
: Elmt_Id
;
20247 -- Abstract interfaces are only associated with tagged record types
20249 if not Is_Tagged_Type
(Typ
) or else not Is_Record_Type
(Typ
) then
20253 -- Recursively climb to the ancestors
20255 if Etype
(Typ
) /= Typ
20257 -- Protect the frontend against wrong cyclic declarations like:
20259 -- type B is new A with private;
20260 -- type C is new A with private;
20262 -- type B is new C with null record;
20263 -- type C is new B with null record;
20265 and then Etype
(Typ
) /= Priv_T
20266 and then Etype
(Typ
) /= Full_T
20268 -- Keep separate the management of private type declarations
20270 if Ekind
(Typ
) = E_Record_Type_With_Private
then
20272 -- Handle the following illegal usage:
20273 -- type Private_Type is tagged private;
20275 -- type Private_Type is new Type_Implementing_Iface;
20277 if Present
(Full_View
(Typ
))
20278 and then Etype
(Typ
) /= Full_View
(Typ
)
20280 if Is_Interface
(Etype
(Typ
)) then
20281 Append_Unique_Elmt
(Etype
(Typ
), Ifaces
);
20284 Collect_Implemented_Interfaces
(Etype
(Typ
), Ifaces
);
20287 -- Non-private types
20290 if Is_Interface
(Etype
(Typ
)) then
20291 Append_Unique_Elmt
(Etype
(Typ
), Ifaces
);
20294 Collect_Implemented_Interfaces
(Etype
(Typ
), Ifaces
);
20298 -- Handle entities in the list of abstract interfaces
20300 if Present
(Interfaces
(Typ
)) then
20301 Iface_Elmt
:= First_Elmt
(Interfaces
(Typ
));
20302 while Present
(Iface_Elmt
) loop
20303 Iface
:= Node
(Iface_Elmt
);
20305 pragma Assert
(Is_Interface
(Iface
));
20307 if not Contain_Interface
(Iface
, Ifaces
) then
20308 Append_Elmt
(Iface
, Ifaces
);
20309 Collect_Implemented_Interfaces
(Iface
, Ifaces
);
20312 Next_Elmt
(Iface_Elmt
);
20315 end Collect_Implemented_Interfaces
;
20319 Saved_GM
: constant Ghost_Mode_Type
:= Ghost_Mode
;
20320 Saved_IGR
: constant Node_Id
:= Ignored_Ghost_Region
;
20321 -- Save the Ghost-related attributes to restore on exit
20323 Full_Indic
: Node_Id
;
20324 Full_Parent
: Entity_Id
;
20325 Priv_Parent
: Entity_Id
;
20327 -- Start of processing for Process_Full_View
20330 Mark_And_Set_Ghost_Completion
(N
, Priv_T
);
20332 -- First some sanity checks that must be done after semantic
20333 -- decoration of the full view and thus cannot be placed with other
20334 -- similar checks in Find_Type_Name
20336 if not Is_Limited_Type
(Priv_T
)
20337 and then (Is_Limited_Type
(Full_T
)
20338 or else Is_Limited_Composite
(Full_T
))
20340 if In_Instance
then
20344 ("completion of nonlimited type cannot be limited", Full_T
);
20345 Explain_Limited_Type
(Full_T
, Full_T
);
20348 elsif Is_Abstract_Type
(Full_T
)
20349 and then not Is_Abstract_Type
(Priv_T
)
20352 ("completion of nonabstract type cannot be abstract", Full_T
);
20354 elsif Is_Tagged_Type
(Priv_T
)
20355 and then Is_Limited_Type
(Priv_T
)
20356 and then not Is_Limited_Type
(Full_T
)
20358 -- If pragma CPP_Class was applied to the private declaration
20359 -- propagate the limitedness to the full-view
20361 if Is_CPP_Class
(Priv_T
) then
20362 Set_Is_Limited_Record
(Full_T
);
20364 -- GNAT allow its own definition of Limited_Controlled to disobey
20365 -- this rule in order in ease the implementation. This test is safe
20366 -- because Root_Controlled is defined in a child of System that
20367 -- normal programs are not supposed to use.
20369 elsif Is_RTE
(Etype
(Full_T
), RE_Root_Controlled
) then
20370 Set_Is_Limited_Composite
(Full_T
);
20373 ("completion of limited tagged type must be limited", Full_T
);
20376 elsif Is_Generic_Type
(Priv_T
) then
20377 Error_Msg_N
("generic type cannot have a completion", Full_T
);
20380 -- Check that ancestor interfaces of private and full views are
20381 -- consistent. We omit this check for synchronized types because
20382 -- they are performed on the corresponding record type when frozen.
20384 if Ada_Version
>= Ada_2005
20385 and then Is_Tagged_Type
(Priv_T
)
20386 and then Is_Tagged_Type
(Full_T
)
20387 and then not Is_Concurrent_Type
(Full_T
)
20391 Priv_T_Ifaces
: constant Elist_Id
:= New_Elmt_List
;
20392 Full_T_Ifaces
: constant Elist_Id
:= New_Elmt_List
;
20395 Collect_Implemented_Interfaces
(Priv_T
, Priv_T_Ifaces
);
20396 Collect_Implemented_Interfaces
(Full_T
, Full_T_Ifaces
);
20398 -- Ada 2005 (AI-251): The partial view shall be a descendant of
20399 -- an interface type if and only if the full type is descendant
20400 -- of the interface type (AARM 7.3 (7.3/2)).
20402 Iface
:= Find_Hidden_Interface
(Priv_T_Ifaces
, Full_T_Ifaces
);
20404 if Present
(Iface
) then
20406 ("interface in partial view& not implemented by full type "
20407 & "(RM-2005 7.3 (7.3/2))", Full_T
, Iface
);
20410 Iface
:= Find_Hidden_Interface
(Full_T_Ifaces
, Priv_T_Ifaces
);
20412 if Present
(Iface
) then
20414 ("interface & not implemented by partial view "
20415 & "(RM-2005 7.3 (7.3/2))", Full_T
, Iface
);
20420 if Is_Tagged_Type
(Priv_T
)
20421 and then Nkind
(Parent
(Priv_T
)) = N_Private_Extension_Declaration
20422 and then Is_Derived_Type
(Full_T
)
20424 Priv_Parent
:= Etype
(Priv_T
);
20426 -- The full view of a private extension may have been transformed
20427 -- into an unconstrained derived type declaration and a subtype
20428 -- declaration (see build_derived_record_type for details).
20430 if Nkind
(N
) = N_Subtype_Declaration
then
20431 Full_Indic
:= Subtype_Indication
(N
);
20432 Full_Parent
:= Etype
(Base_Type
(Full_T
));
20434 Full_Indic
:= Subtype_Indication
(Type_Definition
(N
));
20435 Full_Parent
:= Etype
(Full_T
);
20438 -- Check that the parent type of the full type is a descendant of
20439 -- the ancestor subtype given in the private extension. If either
20440 -- entity has an Etype equal to Any_Type then we had some previous
20441 -- error situation [7.3(8)].
20443 if Priv_Parent
= Any_Type
or else Full_Parent
= Any_Type
then
20446 -- Ada 2005 (AI-251): Interfaces in the full type can be given in
20447 -- any order. Therefore we don't have to check that its parent must
20448 -- be a descendant of the parent of the private type declaration.
20450 elsif Is_Interface
(Priv_Parent
)
20451 and then Is_Interface
(Full_Parent
)
20455 -- Ada 2005 (AI-251): If the parent of the private type declaration
20456 -- is an interface there is no need to check that it is an ancestor
20457 -- of the associated full type declaration. The required tests for
20458 -- this case are performed by Build_Derived_Record_Type.
20460 elsif not Is_Interface
(Base_Type
(Priv_Parent
))
20461 and then not Is_Ancestor
(Base_Type
(Priv_Parent
), Full_Parent
)
20464 ("parent of full type must descend from parent of private "
20465 & "extension", Full_Indic
);
20467 -- First check a formal restriction, and then proceed with checking
20468 -- Ada rules. Since the formal restriction is not a serious error, we
20469 -- don't prevent further error detection for this check, hence the
20473 -- In formal mode, when completing a private extension the type
20474 -- named in the private part must be exactly the same as that
20475 -- named in the visible part.
20477 if Priv_Parent
/= Full_Parent
then
20478 Error_Msg_Name_1
:= Chars
(Priv_Parent
);
20479 Check_SPARK_05_Restriction
("% expected", Full_Indic
);
20482 -- Check the rules of 7.3(10): if the private extension inherits
20483 -- known discriminants, then the full type must also inherit those
20484 -- discriminants from the same (ancestor) type, and the parent
20485 -- subtype of the full type must be constrained if and only if
20486 -- the ancestor subtype of the private extension is constrained.
20488 if No
(Discriminant_Specifications
(Parent
(Priv_T
)))
20489 and then not Has_Unknown_Discriminants
(Priv_T
)
20490 and then Has_Discriminants
(Base_Type
(Priv_Parent
))
20493 Priv_Indic
: constant Node_Id
:=
20494 Subtype_Indication
(Parent
(Priv_T
));
20496 Priv_Constr
: constant Boolean :=
20497 Is_Constrained
(Priv_Parent
)
20499 Nkind
(Priv_Indic
) = N_Subtype_Indication
20501 Is_Constrained
(Entity
(Priv_Indic
));
20503 Full_Constr
: constant Boolean :=
20504 Is_Constrained
(Full_Parent
)
20506 Nkind
(Full_Indic
) = N_Subtype_Indication
20508 Is_Constrained
(Entity
(Full_Indic
));
20510 Priv_Discr
: Entity_Id
;
20511 Full_Discr
: Entity_Id
;
20514 Priv_Discr
:= First_Discriminant
(Priv_Parent
);
20515 Full_Discr
:= First_Discriminant
(Full_Parent
);
20516 while Present
(Priv_Discr
) and then Present
(Full_Discr
) loop
20517 if Original_Record_Component
(Priv_Discr
) =
20518 Original_Record_Component
(Full_Discr
)
20520 Corresponding_Discriminant
(Priv_Discr
) =
20521 Corresponding_Discriminant
(Full_Discr
)
20528 Next_Discriminant
(Priv_Discr
);
20529 Next_Discriminant
(Full_Discr
);
20532 if Present
(Priv_Discr
) or else Present
(Full_Discr
) then
20534 ("full view must inherit discriminants of the parent "
20535 & "type used in the private extension", Full_Indic
);
20537 elsif Priv_Constr
and then not Full_Constr
then
20539 ("parent subtype of full type must be constrained",
20542 elsif Full_Constr
and then not Priv_Constr
then
20544 ("parent subtype of full type must be unconstrained",
20549 -- Check the rules of 7.3(12): if a partial view has neither
20550 -- known or unknown discriminants, then the full type
20551 -- declaration shall define a definite subtype.
20553 elsif not Has_Unknown_Discriminants
(Priv_T
)
20554 and then not Has_Discriminants
(Priv_T
)
20555 and then not Is_Constrained
(Full_T
)
20558 ("full view must define a constrained type if partial view "
20559 & "has no discriminants", Full_T
);
20562 -- ??????? Do we implement the following properly ?????
20563 -- If the ancestor subtype of a private extension has constrained
20564 -- discriminants, then the parent subtype of the full view shall
20565 -- impose a statically matching constraint on those discriminants
20570 -- For untagged types, verify that a type without discriminants is
20571 -- not completed with an unconstrained type. A separate error message
20572 -- is produced if the full type has defaulted discriminants.
20574 if Is_Definite_Subtype
(Priv_T
)
20575 and then not Is_Definite_Subtype
(Full_T
)
20577 Error_Msg_Sloc
:= Sloc
(Parent
(Priv_T
));
20579 ("full view of& not compatible with declaration#",
20582 if not Is_Tagged_Type
(Full_T
) then
20584 ("\one is constrained, the other unconstrained", Full_T
);
20589 -- AI-419: verify that the use of "limited" is consistent
20592 Orig_Decl
: constant Node_Id
:= Original_Node
(N
);
20595 if Nkind
(Parent
(Priv_T
)) = N_Private_Extension_Declaration
20596 and then Nkind
(Orig_Decl
) = N_Full_Type_Declaration
20598 (Type_Definition
(Orig_Decl
)) = N_Derived_Type_Definition
20600 if not Limited_Present
(Parent
(Priv_T
))
20601 and then not Synchronized_Present
(Parent
(Priv_T
))
20602 and then Limited_Present
(Type_Definition
(Orig_Decl
))
20605 ("full view of non-limited extension cannot be limited", N
);
20607 -- Conversely, if the partial view carries the limited keyword,
20608 -- the full view must as well, even if it may be redundant.
20610 elsif Limited_Present
(Parent
(Priv_T
))
20611 and then not Limited_Present
(Type_Definition
(Orig_Decl
))
20614 ("full view of limited extension must be explicitly limited",
20620 -- Ada 2005 (AI-443): A synchronized private extension must be
20621 -- completed by a task or protected type.
20623 if Ada_Version
>= Ada_2005
20624 and then Nkind
(Parent
(Priv_T
)) = N_Private_Extension_Declaration
20625 and then Synchronized_Present
(Parent
(Priv_T
))
20626 and then not Is_Concurrent_Type
(Full_T
)
20628 Error_Msg_N
("full view of synchronized extension must " &
20629 "be synchronized type", N
);
20632 -- Ada 2005 AI-363: if the full view has discriminants with
20633 -- defaults, it is illegal to declare constrained access subtypes
20634 -- whose designated type is the current type. This allows objects
20635 -- of the type that are declared in the heap to be unconstrained.
20637 if not Has_Unknown_Discriminants
(Priv_T
)
20638 and then not Has_Discriminants
(Priv_T
)
20639 and then Has_Discriminants
(Full_T
)
20641 Present
(Discriminant_Default_Value
(First_Discriminant
(Full_T
)))
20643 Set_Has_Constrained_Partial_View
(Full_T
);
20644 Set_Has_Constrained_Partial_View
(Priv_T
);
20647 -- Create a full declaration for all its subtypes recorded in
20648 -- Private_Dependents and swap them similarly to the base type. These
20649 -- are subtypes that have been define before the full declaration of
20650 -- the private type. We also swap the entry in Private_Dependents list
20651 -- so we can properly restore the private view on exit from the scope.
20654 Priv_Elmt
: Elmt_Id
;
20655 Priv_Scop
: Entity_Id
;
20660 Priv_Elmt
:= First_Elmt
(Private_Dependents
(Priv_T
));
20661 while Present
(Priv_Elmt
) loop
20662 Priv
:= Node
(Priv_Elmt
);
20663 Priv_Scop
:= Scope
(Priv
);
20665 if Ekind_In
(Priv
, E_Private_Subtype
,
20666 E_Limited_Private_Subtype
,
20667 E_Record_Subtype_With_Private
)
20669 Full
:= Make_Defining_Identifier
(Sloc
(Priv
), Chars
(Priv
));
20670 Set_Is_Itype
(Full
);
20671 Set_Parent
(Full
, Parent
(Priv
));
20672 Set_Associated_Node_For_Itype
(Full
, N
);
20674 -- Now we need to complete the private subtype, but since the
20675 -- base type has already been swapped, we must also swap the
20676 -- subtypes (and thus, reverse the arguments in the call to
20677 -- Complete_Private_Subtype). Also note that we may need to
20678 -- re-establish the scope of the private subtype.
20680 Copy_And_Swap
(Priv
, Full
);
20682 if not In_Open_Scopes
(Priv_Scop
) then
20683 Push_Scope
(Priv_Scop
);
20686 -- Reset Priv_Scop to Empty to indicate no scope was pushed
20688 Priv_Scop
:= Empty
;
20691 Complete_Private_Subtype
(Full
, Priv
, Full_T
, N
);
20693 if Present
(Priv_Scop
) then
20697 Replace_Elmt
(Priv_Elmt
, Full
);
20700 Next_Elmt
(Priv_Elmt
);
20704 -- If the private view was tagged, copy the new primitive operations
20705 -- from the private view to the full view.
20707 if Is_Tagged_Type
(Full_T
) then
20709 Disp_Typ
: Entity_Id
;
20710 Full_List
: Elist_Id
;
20712 Prim_Elmt
: Elmt_Id
;
20713 Priv_List
: Elist_Id
;
20717 L
: Elist_Id
) return Boolean;
20718 -- Determine whether list L contains element E
20726 L
: Elist_Id
) return Boolean
20728 List_Elmt
: Elmt_Id
;
20731 List_Elmt
:= First_Elmt
(L
);
20732 while Present
(List_Elmt
) loop
20733 if Node
(List_Elmt
) = E
then
20737 Next_Elmt
(List_Elmt
);
20743 -- Start of processing
20746 if Is_Tagged_Type
(Priv_T
) then
20747 Priv_List
:= Primitive_Operations
(Priv_T
);
20748 Prim_Elmt
:= First_Elmt
(Priv_List
);
20750 -- In the case of a concurrent type completing a private tagged
20751 -- type, primitives may have been declared in between the two
20752 -- views. These subprograms need to be wrapped the same way
20753 -- entries and protected procedures are handled because they
20754 -- cannot be directly shared by the two views.
20756 if Is_Concurrent_Type
(Full_T
) then
20758 Conc_Typ
: constant Entity_Id
:=
20759 Corresponding_Record_Type
(Full_T
);
20760 Curr_Nod
: Node_Id
:= Parent
(Conc_Typ
);
20761 Wrap_Spec
: Node_Id
;
20764 while Present
(Prim_Elmt
) loop
20765 Prim
:= Node
(Prim_Elmt
);
20767 if Comes_From_Source
(Prim
)
20768 and then not Is_Abstract_Subprogram
(Prim
)
20771 Make_Subprogram_Declaration
(Sloc
(Prim
),
20775 Obj_Typ
=> Conc_Typ
,
20777 Parameter_Specifications
20780 Insert_After
(Curr_Nod
, Wrap_Spec
);
20781 Curr_Nod
:= Wrap_Spec
;
20783 Analyze
(Wrap_Spec
);
20785 -- Remove the wrapper from visibility to avoid
20786 -- spurious conflict with the wrapped entity.
20788 Set_Is_Immediately_Visible
20789 (Defining_Entity
(Specification
(Wrap_Spec
)),
20793 Next_Elmt
(Prim_Elmt
);
20799 -- For non-concurrent types, transfer explicit primitives, but
20800 -- omit those inherited from the parent of the private view
20801 -- since they will be re-inherited later on.
20804 Full_List
:= Primitive_Operations
(Full_T
);
20805 while Present
(Prim_Elmt
) loop
20806 Prim
:= Node
(Prim_Elmt
);
20808 if Comes_From_Source
(Prim
)
20809 and then not Contains
(Prim
, Full_List
)
20811 Append_Elmt
(Prim
, Full_List
);
20814 Next_Elmt
(Prim_Elmt
);
20818 -- Untagged private view
20821 Full_List
:= Primitive_Operations
(Full_T
);
20823 -- In this case the partial view is untagged, so here we locate
20824 -- all of the earlier primitives that need to be treated as
20825 -- dispatching (those that appear between the two views). Note
20826 -- that these additional operations must all be new operations
20827 -- (any earlier operations that override inherited operations
20828 -- of the full view will already have been inserted in the
20829 -- primitives list, marked by Check_Operation_From_Private_View
20830 -- as dispatching. Note that implicit "/=" operators are
20831 -- excluded from being added to the primitives list since they
20832 -- shouldn't be treated as dispatching (tagged "/=" is handled
20835 Prim
:= Next_Entity
(Full_T
);
20836 while Present
(Prim
) and then Prim
/= Priv_T
loop
20837 if Ekind_In
(Prim
, E_Procedure
, E_Function
) then
20838 Disp_Typ
:= Find_Dispatching_Type
(Prim
);
20840 if Disp_Typ
= Full_T
20841 and then (Chars
(Prim
) /= Name_Op_Ne
20842 or else Comes_From_Source
(Prim
))
20844 Check_Controlling_Formals
(Full_T
, Prim
);
20846 if Is_Suitable_Primitive
(Prim
)
20847 and then not Is_Dispatching_Operation
(Prim
)
20849 Append_Elmt
(Prim
, Full_List
);
20850 Set_Is_Dispatching_Operation
(Prim
);
20851 Set_DT_Position_Value
(Prim
, No_Uint
);
20854 elsif Is_Dispatching_Operation
(Prim
)
20855 and then Disp_Typ
/= Full_T
20857 -- Verify that it is not otherwise controlled by a
20858 -- formal or a return value of type T.
20860 Check_Controlling_Formals
(Disp_Typ
, Prim
);
20864 Next_Entity
(Prim
);
20868 -- For the tagged case, the two views can share the same primitive
20869 -- operations list and the same class-wide type. Update attributes
20870 -- of the class-wide type which depend on the full declaration.
20872 if Is_Tagged_Type
(Priv_T
) then
20873 Set_Direct_Primitive_Operations
(Priv_T
, Full_List
);
20874 Set_Class_Wide_Type
20875 (Base_Type
(Full_T
), Class_Wide_Type
(Priv_T
));
20877 Propagate_Concurrent_Flags
(Class_Wide_Type
(Priv_T
), Full_T
);
20882 -- Ada 2005 AI 161: Check preelaborable initialization consistency
20884 if Known_To_Have_Preelab_Init
(Priv_T
) then
20886 -- Case where there is a pragma Preelaborable_Initialization. We
20887 -- always allow this in predefined units, which is cheating a bit,
20888 -- but it means we don't have to struggle to meet the requirements in
20889 -- the RM for having Preelaborable Initialization. Otherwise we
20890 -- require that the type meets the RM rules. But we can't check that
20891 -- yet, because of the rule about overriding Initialize, so we simply
20892 -- set a flag that will be checked at freeze time.
20894 if not In_Predefined_Unit
(Full_T
) then
20895 Set_Must_Have_Preelab_Init
(Full_T
);
20899 -- If pragma CPP_Class was applied to the private type declaration,
20900 -- propagate it now to the full type declaration.
20902 if Is_CPP_Class
(Priv_T
) then
20903 Set_Is_CPP_Class
(Full_T
);
20904 Set_Convention
(Full_T
, Convention_CPP
);
20906 -- Check that components of imported CPP types do not have default
20909 Check_CPP_Type_Has_No_Defaults
(Full_T
);
20912 -- If the private view has user specified stream attributes, then so has
20915 -- Why the test, how could these flags be already set in Full_T ???
20917 if Has_Specified_Stream_Read
(Priv_T
) then
20918 Set_Has_Specified_Stream_Read
(Full_T
);
20921 if Has_Specified_Stream_Write
(Priv_T
) then
20922 Set_Has_Specified_Stream_Write
(Full_T
);
20925 if Has_Specified_Stream_Input
(Priv_T
) then
20926 Set_Has_Specified_Stream_Input
(Full_T
);
20929 if Has_Specified_Stream_Output
(Priv_T
) then
20930 Set_Has_Specified_Stream_Output
(Full_T
);
20933 -- Propagate Default_Initial_Condition-related attributes from the
20934 -- partial view to the full view and its base type.
20936 Propagate_DIC_Attributes
(Full_T
, From_Typ
=> Priv_T
);
20937 Propagate_DIC_Attributes
(Base_Type
(Full_T
), From_Typ
=> Priv_T
);
20939 -- Propagate invariant-related attributes from the partial view to the
20940 -- full view and its base type.
20942 Propagate_Invariant_Attributes
(Full_T
, From_Typ
=> Priv_T
);
20943 Propagate_Invariant_Attributes
(Base_Type
(Full_T
), From_Typ
=> Priv_T
);
20945 -- AI12-0041: Detect an attempt to inherit a class-wide type invariant
20946 -- in the full view without advertising the inheritance in the partial
20947 -- view. This can only occur when the partial view has no parent type
20948 -- and the full view has an interface as a parent. Any other scenarios
20949 -- are illegal because implemented interfaces must match between the
20952 if Is_Tagged_Type
(Priv_T
) and then Is_Tagged_Type
(Full_T
) then
20954 Full_Par
: constant Entity_Id
:= Etype
(Full_T
);
20955 Priv_Par
: constant Entity_Id
:= Etype
(Priv_T
);
20958 if not Is_Interface
(Priv_Par
)
20959 and then Is_Interface
(Full_Par
)
20960 and then Has_Inheritable_Invariants
(Full_Par
)
20963 ("hidden inheritance of class-wide type invariants not "
20969 -- Propagate predicates to full type, and predicate function if already
20970 -- defined. It is not clear that this can actually happen? the partial
20971 -- view cannot be frozen yet, and the predicate function has not been
20972 -- built. Still it is a cheap check and seems safer to make it.
20974 if Has_Predicates
(Priv_T
) then
20975 Set_Has_Predicates
(Full_T
);
20977 if Present
(Predicate_Function
(Priv_T
)) then
20978 Set_Predicate_Function
(Full_T
, Predicate_Function
(Priv_T
));
20983 Restore_Ghost_Region
(Saved_GM
, Saved_IGR
);
20984 end Process_Full_View
;
20986 -----------------------------------
20987 -- Process_Incomplete_Dependents --
20988 -----------------------------------
20990 procedure Process_Incomplete_Dependents
20992 Full_T
: Entity_Id
;
20995 Inc_Elmt
: Elmt_Id
;
20996 Priv_Dep
: Entity_Id
;
20997 New_Subt
: Entity_Id
;
20999 Disc_Constraint
: Elist_Id
;
21002 if No
(Private_Dependents
(Inc_T
)) then
21006 -- Itypes that may be generated by the completion of an incomplete
21007 -- subtype are not used by the back-end and not attached to the tree.
21008 -- They are created only for constraint-checking purposes.
21010 Inc_Elmt
:= First_Elmt
(Private_Dependents
(Inc_T
));
21011 while Present
(Inc_Elmt
) loop
21012 Priv_Dep
:= Node
(Inc_Elmt
);
21014 if Ekind
(Priv_Dep
) = E_Subprogram_Type
then
21016 -- An Access_To_Subprogram type may have a return type or a
21017 -- parameter type that is incomplete. Replace with the full view.
21019 if Etype
(Priv_Dep
) = Inc_T
then
21020 Set_Etype
(Priv_Dep
, Full_T
);
21024 Formal
: Entity_Id
;
21027 Formal
:= First_Formal
(Priv_Dep
);
21028 while Present
(Formal
) loop
21029 if Etype
(Formal
) = Inc_T
then
21030 Set_Etype
(Formal
, Full_T
);
21033 Next_Formal
(Formal
);
21037 elsif Is_Overloadable
(Priv_Dep
) then
21039 -- If a subprogram in the incomplete dependents list is primitive
21040 -- for a tagged full type then mark it as a dispatching operation,
21041 -- check whether it overrides an inherited subprogram, and check
21042 -- restrictions on its controlling formals. Note that a protected
21043 -- operation is never dispatching: only its wrapper operation
21044 -- (which has convention Ada) is.
21046 if Is_Tagged_Type
(Full_T
)
21047 and then Is_Primitive
(Priv_Dep
)
21048 and then Convention
(Priv_Dep
) /= Convention_Protected
21050 Check_Operation_From_Incomplete_Type
(Priv_Dep
, Inc_T
);
21051 Set_Is_Dispatching_Operation
(Priv_Dep
);
21052 Check_Controlling_Formals
(Full_T
, Priv_Dep
);
21055 elsif Ekind
(Priv_Dep
) = E_Subprogram_Body
then
21057 -- Can happen during processing of a body before the completion
21058 -- of a TA type. Ignore, because spec is also on dependent list.
21062 -- Ada 2005 (AI-412): Transform a regular incomplete subtype into a
21063 -- corresponding subtype of the full view.
21065 elsif Ekind
(Priv_Dep
) = E_Incomplete_Subtype
21066 and then Comes_From_Source
(Priv_Dep
)
21068 Set_Subtype_Indication
21069 (Parent
(Priv_Dep
), New_Occurrence_Of
(Full_T
, Sloc
(Priv_Dep
)));
21070 Set_Etype
(Priv_Dep
, Full_T
);
21071 Set_Ekind
(Priv_Dep
, Subtype_Kind
(Ekind
(Full_T
)));
21072 Set_Analyzed
(Parent
(Priv_Dep
), False);
21074 -- Reanalyze the declaration, suppressing the call to Enter_Name
21075 -- to avoid duplicate names.
21077 Analyze_Subtype_Declaration
21078 (N
=> Parent
(Priv_Dep
),
21081 -- Dependent is a subtype
21084 -- We build a new subtype indication using the full view of the
21085 -- incomplete parent. The discriminant constraints have been
21086 -- elaborated already at the point of the subtype declaration.
21088 New_Subt
:= Create_Itype
(E_Void
, N
);
21090 if Has_Discriminants
(Full_T
) then
21091 Disc_Constraint
:= Discriminant_Constraint
(Priv_Dep
);
21093 Disc_Constraint
:= No_Elist
;
21096 Build_Discriminated_Subtype
(Full_T
, New_Subt
, Disc_Constraint
, N
);
21097 Set_Full_View
(Priv_Dep
, New_Subt
);
21100 Next_Elmt
(Inc_Elmt
);
21102 end Process_Incomplete_Dependents
;
21104 --------------------------------
21105 -- Process_Range_Expr_In_Decl --
21106 --------------------------------
21108 procedure Process_Range_Expr_In_Decl
21111 Subtyp
: Entity_Id
:= Empty
;
21112 Check_List
: List_Id
:= Empty_List
;
21113 R_Check_Off
: Boolean := False;
21114 In_Iter_Schm
: Boolean := False)
21117 R_Checks
: Check_Result
;
21118 Insert_Node
: Node_Id
;
21119 Def_Id
: Entity_Id
;
21122 Analyze_And_Resolve
(R
, Base_Type
(T
));
21124 if Nkind
(R
) = N_Range
then
21126 -- In SPARK, all ranges should be static, with the exception of the
21127 -- discrete type definition of a loop parameter specification.
21129 if not In_Iter_Schm
21130 and then not Is_OK_Static_Range
(R
)
21132 Check_SPARK_05_Restriction
("range should be static", R
);
21135 Lo
:= Low_Bound
(R
);
21136 Hi
:= High_Bound
(R
);
21138 -- Validity checks on the range of a quantified expression are
21139 -- delayed until the construct is transformed into a loop.
21141 if Nkind
(Parent
(R
)) = N_Loop_Parameter_Specification
21142 and then Nkind
(Parent
(Parent
(R
))) = N_Quantified_Expression
21146 -- We need to ensure validity of the bounds here, because if we
21147 -- go ahead and do the expansion, then the expanded code will get
21148 -- analyzed with range checks suppressed and we miss the check.
21150 -- WARNING: The capture of the range bounds with xxx_FIRST/_LAST and
21151 -- the temporaries generated by routine Remove_Side_Effects by means
21152 -- of validity checks must use the same names. When a range appears
21153 -- in the parent of a generic, the range is processed with checks
21154 -- disabled as part of the generic context and with checks enabled
21155 -- for code generation purposes. This leads to link issues as the
21156 -- generic contains references to xxx_FIRST/_LAST, but the inlined
21157 -- template sees the temporaries generated by Remove_Side_Effects.
21160 Validity_Check_Range
(R
, Subtyp
);
21163 -- If there were errors in the declaration, try and patch up some
21164 -- common mistakes in the bounds. The cases handled are literals
21165 -- which are Integer where the expected type is Real and vice versa.
21166 -- These corrections allow the compilation process to proceed further
21167 -- along since some basic assumptions of the format of the bounds
21170 if Etype
(R
) = Any_Type
then
21171 if Nkind
(Lo
) = N_Integer_Literal
and then Is_Real_Type
(T
) then
21173 Make_Real_Literal
(Sloc
(Lo
), UR_From_Uint
(Intval
(Lo
))));
21175 elsif Nkind
(Hi
) = N_Integer_Literal
and then Is_Real_Type
(T
) then
21177 Make_Real_Literal
(Sloc
(Hi
), UR_From_Uint
(Intval
(Hi
))));
21179 elsif Nkind
(Lo
) = N_Real_Literal
and then Is_Integer_Type
(T
) then
21181 Make_Integer_Literal
(Sloc
(Lo
), UR_To_Uint
(Realval
(Lo
))));
21183 elsif Nkind
(Hi
) = N_Real_Literal
and then Is_Integer_Type
(T
) then
21185 Make_Integer_Literal
(Sloc
(Hi
), UR_To_Uint
(Realval
(Hi
))));
21192 -- If the bounds of the range have been mistakenly given as string
21193 -- literals (perhaps in place of character literals), then an error
21194 -- has already been reported, but we rewrite the string literal as a
21195 -- bound of the range's type to avoid blowups in later processing
21196 -- that looks at static values.
21198 if Nkind
(Lo
) = N_String_Literal
then
21200 Make_Attribute_Reference
(Sloc
(Lo
),
21201 Prefix
=> New_Occurrence_Of
(T
, Sloc
(Lo
)),
21202 Attribute_Name
=> Name_First
));
21203 Analyze_And_Resolve
(Lo
);
21206 if Nkind
(Hi
) = N_String_Literal
then
21208 Make_Attribute_Reference
(Sloc
(Hi
),
21209 Prefix
=> New_Occurrence_Of
(T
, Sloc
(Hi
)),
21210 Attribute_Name
=> Name_First
));
21211 Analyze_And_Resolve
(Hi
);
21214 -- If bounds aren't scalar at this point then exit, avoiding
21215 -- problems with further processing of the range in this procedure.
21217 if not Is_Scalar_Type
(Etype
(Lo
)) then
21221 -- Resolve (actually Sem_Eval) has checked that the bounds are in
21222 -- then range of the base type. Here we check whether the bounds
21223 -- are in the range of the subtype itself. Note that if the bounds
21224 -- represent the null range the Constraint_Error exception should
21227 -- ??? The following code should be cleaned up as follows
21229 -- 1. The Is_Null_Range (Lo, Hi) test should disappear since it
21230 -- is done in the call to Range_Check (R, T); below
21232 -- 2. The use of R_Check_Off should be investigated and possibly
21233 -- removed, this would clean up things a bit.
21235 if Is_Null_Range
(Lo
, Hi
) then
21239 -- Capture values of bounds and generate temporaries for them
21240 -- if needed, before applying checks, since checks may cause
21241 -- duplication of the expression without forcing evaluation.
21243 -- The forced evaluation removes side effects from expressions,
21244 -- which should occur also in GNATprove mode. Otherwise, we end up
21245 -- with unexpected insertions of actions at places where this is
21246 -- not supposed to occur, e.g. on default parameters of a call.
21248 if Expander_Active
or GNATprove_Mode
then
21250 -- Call Force_Evaluation to create declarations as needed to
21251 -- deal with side effects, and also create typ_FIRST/LAST
21252 -- entities for bounds if we have a subtype name.
21254 -- Note: we do this transformation even if expansion is not
21255 -- active if we are in GNATprove_Mode since the transformation
21256 -- is in general required to ensure that the resulting tree has
21257 -- proper Ada semantics.
21260 (Lo
, Related_Id
=> Subtyp
, Is_Low_Bound
=> True);
21262 (Hi
, Related_Id
=> Subtyp
, Is_High_Bound
=> True);
21265 -- We use a flag here instead of suppressing checks on the type
21266 -- because the type we check against isn't necessarily the place
21267 -- where we put the check.
21269 if not R_Check_Off
then
21270 R_Checks
:= Get_Range_Checks
(R
, T
);
21272 -- Look up tree to find an appropriate insertion point. We
21273 -- can't just use insert_actions because later processing
21274 -- depends on the insertion node. Prior to Ada 2012 the
21275 -- insertion point could only be a declaration or a loop, but
21276 -- quantified expressions can appear within any context in an
21277 -- expression, and the insertion point can be any statement,
21278 -- pragma, or declaration.
21280 Insert_Node
:= Parent
(R
);
21281 while Present
(Insert_Node
) loop
21283 Nkind
(Insert_Node
) in N_Declaration
21286 (Insert_Node
, N_Component_Declaration
,
21287 N_Loop_Parameter_Specification
,
21288 N_Function_Specification
,
21289 N_Procedure_Specification
);
21291 exit when Nkind
(Insert_Node
) in N_Later_Decl_Item
21292 or else Nkind
(Insert_Node
) in
21293 N_Statement_Other_Than_Procedure_Call
21294 or else Nkind_In
(Insert_Node
, N_Procedure_Call_Statement
,
21297 Insert_Node
:= Parent
(Insert_Node
);
21300 -- Why would Type_Decl not be present??? Without this test,
21301 -- short regression tests fail.
21303 if Present
(Insert_Node
) then
21305 -- Case of loop statement. Verify that the range is part
21306 -- of the subtype indication of the iteration scheme.
21308 if Nkind
(Insert_Node
) = N_Loop_Statement
then
21313 Indic
:= Parent
(R
);
21314 while Present
(Indic
)
21315 and then Nkind
(Indic
) /= N_Subtype_Indication
21317 Indic
:= Parent
(Indic
);
21320 if Present
(Indic
) then
21321 Def_Id
:= Etype
(Subtype_Mark
(Indic
));
21323 Insert_Range_Checks
21327 Sloc
(Insert_Node
),
21329 Do_Before
=> True);
21333 -- Insertion before a declaration. If the declaration
21334 -- includes discriminants, the list of applicable checks
21335 -- is given by the caller.
21337 elsif Nkind
(Insert_Node
) in N_Declaration
then
21338 Def_Id
:= Defining_Identifier
(Insert_Node
);
21340 if (Ekind
(Def_Id
) = E_Record_Type
21341 and then Depends_On_Discriminant
(R
))
21343 (Ekind
(Def_Id
) = E_Protected_Type
21344 and then Has_Discriminants
(Def_Id
))
21346 Append_Range_Checks
21348 Check_List
, Def_Id
, Sloc
(Insert_Node
), R
);
21351 Insert_Range_Checks
21353 Insert_Node
, Def_Id
, Sloc
(Insert_Node
), R
);
21357 -- Insertion before a statement. Range appears in the
21358 -- context of a quantified expression. Insertion will
21359 -- take place when expression is expanded.
21368 -- Case of other than an explicit N_Range node
21370 -- The forced evaluation removes side effects from expressions, which
21371 -- should occur also in GNATprove mode. Otherwise, we end up with
21372 -- unexpected insertions of actions at places where this is not
21373 -- supposed to occur, e.g. on default parameters of a call.
21375 elsif Expander_Active
or GNATprove_Mode
then
21376 Get_Index_Bounds
(R
, Lo
, Hi
);
21377 Force_Evaluation
(Lo
);
21378 Force_Evaluation
(Hi
);
21380 end Process_Range_Expr_In_Decl
;
21382 --------------------------------------
21383 -- Process_Real_Range_Specification --
21384 --------------------------------------
21386 procedure Process_Real_Range_Specification
(Def
: Node_Id
) is
21387 Spec
: constant Node_Id
:= Real_Range_Specification
(Def
);
21390 Err
: Boolean := False;
21392 procedure Analyze_Bound
(N
: Node_Id
);
21393 -- Analyze and check one bound
21395 -------------------
21396 -- Analyze_Bound --
21397 -------------------
21399 procedure Analyze_Bound
(N
: Node_Id
) is
21401 Analyze_And_Resolve
(N
, Any_Real
);
21403 if not Is_OK_Static_Expression
(N
) then
21404 Flag_Non_Static_Expr
21405 ("bound in real type definition is not static!", N
);
21410 -- Start of processing for Process_Real_Range_Specification
21413 if Present
(Spec
) then
21414 Lo
:= Low_Bound
(Spec
);
21415 Hi
:= High_Bound
(Spec
);
21416 Analyze_Bound
(Lo
);
21417 Analyze_Bound
(Hi
);
21419 -- If error, clear away junk range specification
21422 Set_Real_Range_Specification
(Def
, Empty
);
21425 end Process_Real_Range_Specification
;
21427 ---------------------
21428 -- Process_Subtype --
21429 ---------------------
21431 function Process_Subtype
21433 Related_Nod
: Node_Id
;
21434 Related_Id
: Entity_Id
:= Empty
;
21435 Suffix
: Character := ' ') return Entity_Id
21438 Def_Id
: Entity_Id
;
21439 Error_Node
: Node_Id
;
21440 Full_View_Id
: Entity_Id
;
21441 Subtype_Mark_Id
: Entity_Id
;
21443 May_Have_Null_Exclusion
: Boolean;
21445 procedure Check_Incomplete
(T
: Node_Id
);
21446 -- Called to verify that an incomplete type is not used prematurely
21448 ----------------------
21449 -- Check_Incomplete --
21450 ----------------------
21452 procedure Check_Incomplete
(T
: Node_Id
) is
21454 -- Ada 2005 (AI-412): Incomplete subtypes are legal
21456 if Ekind
(Root_Type
(Entity
(T
))) = E_Incomplete_Type
21458 not (Ada_Version
>= Ada_2005
21460 (Nkind
(Parent
(T
)) = N_Subtype_Declaration
21461 or else (Nkind
(Parent
(T
)) = N_Subtype_Indication
21462 and then Nkind
(Parent
(Parent
(T
))) =
21463 N_Subtype_Declaration
)))
21465 Error_Msg_N
("invalid use of type before its full declaration", T
);
21467 end Check_Incomplete
;
21469 -- Start of processing for Process_Subtype
21472 -- Case of no constraints present
21474 if Nkind
(S
) /= N_Subtype_Indication
then
21477 -- No way to proceed if the subtype indication is malformed. This
21478 -- will happen for example when the subtype indication in an object
21479 -- declaration is missing altogether and the expression is analyzed
21480 -- as if it were that indication.
21482 if not Is_Entity_Name
(S
) then
21486 Check_Incomplete
(S
);
21489 -- Ada 2005 (AI-231): Static check
21491 if Ada_Version
>= Ada_2005
21492 and then Present
(P
)
21493 and then Null_Exclusion_Present
(P
)
21494 and then Nkind
(P
) /= N_Access_To_Object_Definition
21495 and then not Is_Access_Type
(Entity
(S
))
21497 Error_Msg_N
("`NOT NULL` only allowed for an access type", S
);
21500 -- The following is ugly, can't we have a range or even a flag???
21502 May_Have_Null_Exclusion
:=
21503 Nkind_In
(P
, N_Access_Definition
,
21504 N_Access_Function_Definition
,
21505 N_Access_Procedure_Definition
,
21506 N_Access_To_Object_Definition
,
21508 N_Component_Definition
)
21510 Nkind_In
(P
, N_Derived_Type_Definition
,
21511 N_Discriminant_Specification
,
21512 N_Formal_Object_Declaration
,
21513 N_Object_Declaration
,
21514 N_Object_Renaming_Declaration
,
21515 N_Parameter_Specification
,
21516 N_Subtype_Declaration
);
21518 -- Create an Itype that is a duplicate of Entity (S) but with the
21519 -- null-exclusion attribute.
21521 if May_Have_Null_Exclusion
21522 and then Is_Access_Type
(Entity
(S
))
21523 and then Null_Exclusion_Present
(P
)
21525 -- No need to check the case of an access to object definition.
21526 -- It is correct to define double not-null pointers.
21529 -- type Not_Null_Int_Ptr is not null access Integer;
21530 -- type Acc is not null access Not_Null_Int_Ptr;
21532 and then Nkind
(P
) /= N_Access_To_Object_Definition
21534 if Can_Never_Be_Null
(Entity
(S
)) then
21535 case Nkind
(Related_Nod
) is
21536 when N_Full_Type_Declaration
=>
21537 if Nkind
(Type_Definition
(Related_Nod
))
21538 in N_Array_Type_Definition
21542 (Component_Definition
21543 (Type_Definition
(Related_Nod
)));
21546 Subtype_Indication
(Type_Definition
(Related_Nod
));
21549 when N_Subtype_Declaration
=>
21550 Error_Node
:= Subtype_Indication
(Related_Nod
);
21552 when N_Object_Declaration
=>
21553 Error_Node
:= Object_Definition
(Related_Nod
);
21555 when N_Component_Declaration
=>
21557 Subtype_Indication
(Component_Definition
(Related_Nod
));
21559 when N_Allocator
=>
21560 Error_Node
:= Expression
(Related_Nod
);
21563 pragma Assert
(False);
21564 Error_Node
:= Related_Nod
;
21568 ("`NOT NULL` not allowed (& already excludes null)",
21574 Create_Null_Excluding_Itype
21576 Related_Nod
=> P
));
21577 Set_Entity
(S
, Etype
(S
));
21582 -- Case of constraint present, so that we have an N_Subtype_Indication
21583 -- node (this node is created only if constraints are present).
21586 Find_Type
(Subtype_Mark
(S
));
21588 if Nkind
(Parent
(S
)) /= N_Access_To_Object_Definition
21590 (Nkind
(Parent
(S
)) = N_Subtype_Declaration
21591 and then Is_Itype
(Defining_Identifier
(Parent
(S
))))
21593 Check_Incomplete
(Subtype_Mark
(S
));
21597 Subtype_Mark_Id
:= Entity
(Subtype_Mark
(S
));
21599 -- Explicit subtype declaration case
21601 if Nkind
(P
) = N_Subtype_Declaration
then
21602 Def_Id
:= Defining_Identifier
(P
);
21604 -- Explicit derived type definition case
21606 elsif Nkind
(P
) = N_Derived_Type_Definition
then
21607 Def_Id
:= Defining_Identifier
(Parent
(P
));
21609 -- Implicit case, the Def_Id must be created as an implicit type.
21610 -- The one exception arises in the case of concurrent types, array
21611 -- and access types, where other subsidiary implicit types may be
21612 -- created and must appear before the main implicit type. In these
21613 -- cases we leave Def_Id set to Empty as a signal that Create_Itype
21614 -- has not yet been called to create Def_Id.
21617 if Is_Array_Type
(Subtype_Mark_Id
)
21618 or else Is_Concurrent_Type
(Subtype_Mark_Id
)
21619 or else Is_Access_Type
(Subtype_Mark_Id
)
21623 -- For the other cases, we create a new unattached Itype,
21624 -- and set the indication to ensure it gets attached later.
21628 Create_Itype
(E_Void
, Related_Nod
, Related_Id
, Suffix
);
21632 -- If the kind of constraint is invalid for this kind of type,
21633 -- then give an error, and then pretend no constraint was given.
21635 if not Is_Valid_Constraint_Kind
21636 (Ekind
(Subtype_Mark_Id
), Nkind
(Constraint
(S
)))
21639 ("incorrect constraint for this kind of type", Constraint
(S
));
21641 Rewrite
(S
, New_Copy_Tree
(Subtype_Mark
(S
)));
21643 -- Set Ekind of orphan itype, to prevent cascaded errors
21645 if Present
(Def_Id
) then
21646 Set_Ekind
(Def_Id
, Ekind
(Any_Type
));
21649 -- Make recursive call, having got rid of the bogus constraint
21651 return Process_Subtype
(S
, Related_Nod
, Related_Id
, Suffix
);
21654 -- Remaining processing depends on type. Select on Base_Type kind to
21655 -- ensure getting to the concrete type kind in the case of a private
21656 -- subtype (needed when only doing semantic analysis).
21658 case Ekind
(Base_Type
(Subtype_Mark_Id
)) is
21659 when Access_Kind
=>
21661 -- If this is a constraint on a class-wide type, discard it.
21662 -- There is currently no way to express a partial discriminant
21663 -- constraint on a type with unknown discriminants. This is
21664 -- a pathology that the ACATS wisely decides not to test.
21666 if Is_Class_Wide_Type
(Designated_Type
(Subtype_Mark_Id
)) then
21667 if Comes_From_Source
(S
) then
21669 ("constraint on class-wide type ignored??",
21673 if Nkind
(P
) = N_Subtype_Declaration
then
21674 Set_Subtype_Indication
(P
,
21675 New_Occurrence_Of
(Subtype_Mark_Id
, Sloc
(S
)));
21678 return Subtype_Mark_Id
;
21681 Constrain_Access
(Def_Id
, S
, Related_Nod
);
21684 and then Is_Itype
(Designated_Type
(Def_Id
))
21685 and then Nkind
(Related_Nod
) = N_Subtype_Declaration
21686 and then not Is_Incomplete_Type
(Designated_Type
(Def_Id
))
21688 Build_Itype_Reference
21689 (Designated_Type
(Def_Id
), Related_Nod
);
21693 Constrain_Array
(Def_Id
, S
, Related_Nod
, Related_Id
, Suffix
);
21695 when Decimal_Fixed_Point_Kind
=>
21696 Constrain_Decimal
(Def_Id
, S
);
21698 when Enumeration_Kind
=>
21699 Constrain_Enumeration
(Def_Id
, S
);
21701 when Ordinary_Fixed_Point_Kind
=>
21702 Constrain_Ordinary_Fixed
(Def_Id
, S
);
21705 Constrain_Float
(Def_Id
, S
);
21707 when Integer_Kind
=>
21708 Constrain_Integer
(Def_Id
, S
);
21710 when Class_Wide_Kind
21711 | E_Incomplete_Type
21715 Constrain_Discriminated_Type
(Def_Id
, S
, Related_Nod
);
21717 if Ekind
(Def_Id
) = E_Incomplete_Type
then
21718 Set_Private_Dependents
(Def_Id
, New_Elmt_List
);
21721 when Private_Kind
=>
21723 -- A private type with unknown discriminants may be completed
21724 -- by an unconstrained array type.
21726 if Has_Unknown_Discriminants
(Subtype_Mark_Id
)
21727 and then Present
(Full_View
(Subtype_Mark_Id
))
21728 and then Is_Array_Type
(Full_View
(Subtype_Mark_Id
))
21730 Constrain_Array
(Def_Id
, S
, Related_Nod
, Related_Id
, Suffix
);
21732 -- ... but more commonly is completed by a discriminated record
21736 Constrain_Discriminated_Type
(Def_Id
, S
, Related_Nod
);
21739 -- The base type may be private but Def_Id may be a full view
21742 if Is_Private_Type
(Def_Id
) then
21743 Set_Private_Dependents
(Def_Id
, New_Elmt_List
);
21746 -- In case of an invalid constraint prevent further processing
21747 -- since the type constructed is missing expected fields.
21749 if Etype
(Def_Id
) = Any_Type
then
21753 -- If the full view is that of a task with discriminants,
21754 -- we must constrain both the concurrent type and its
21755 -- corresponding record type. Otherwise we will just propagate
21756 -- the constraint to the full view, if available.
21758 if Present
(Full_View
(Subtype_Mark_Id
))
21759 and then Has_Discriminants
(Subtype_Mark_Id
)
21760 and then Is_Concurrent_Type
(Full_View
(Subtype_Mark_Id
))
21763 Create_Itype
(E_Void
, Related_Nod
, Related_Id
, Suffix
);
21765 Set_Entity
(Subtype_Mark
(S
), Full_View
(Subtype_Mark_Id
));
21766 Constrain_Concurrent
(Full_View_Id
, S
,
21767 Related_Nod
, Related_Id
, Suffix
);
21768 Set_Entity
(Subtype_Mark
(S
), Subtype_Mark_Id
);
21769 Set_Full_View
(Def_Id
, Full_View_Id
);
21771 -- Introduce an explicit reference to the private subtype,
21772 -- to prevent scope anomalies in gigi if first use appears
21773 -- in a nested context, e.g. a later function body.
21774 -- Should this be generated in other contexts than a full
21775 -- type declaration?
21777 if Is_Itype
(Def_Id
)
21779 Nkind
(Parent
(P
)) = N_Full_Type_Declaration
21781 Build_Itype_Reference
(Def_Id
, Parent
(P
));
21785 Prepare_Private_Subtype_Completion
(Def_Id
, Related_Nod
);
21788 when Concurrent_Kind
=>
21789 Constrain_Concurrent
(Def_Id
, S
,
21790 Related_Nod
, Related_Id
, Suffix
);
21793 Error_Msg_N
("invalid subtype mark in subtype indication", S
);
21796 -- Size, Alignment, Representation aspects and Convention are always
21797 -- inherited from the base type.
21799 Set_Size_Info
(Def_Id
, (Subtype_Mark_Id
));
21800 Set_Rep_Info
(Def_Id
, (Subtype_Mark_Id
));
21801 Set_Convention
(Def_Id
, Convention
(Subtype_Mark_Id
));
21803 -- The anonymous subtype created for the subtype indication
21804 -- inherits the predicates of the parent.
21806 if Has_Predicates
(Subtype_Mark_Id
) then
21807 Inherit_Predicate_Flags
(Def_Id
, Subtype_Mark_Id
);
21809 -- Indicate where the predicate function may be found
21811 if No
(Predicate_Function
(Def_Id
)) and then Is_Itype
(Def_Id
) then
21812 Set_Predicated_Parent
(Def_Id
, Subtype_Mark_Id
);
21818 end Process_Subtype
;
21820 -----------------------------
21821 -- Record_Type_Declaration --
21822 -----------------------------
21824 procedure Record_Type_Declaration
21829 Def
: constant Node_Id
:= Type_Definition
(N
);
21830 Is_Tagged
: Boolean;
21831 Tag_Comp
: Entity_Id
;
21834 -- These flags must be initialized before calling Process_Discriminants
21835 -- because this routine makes use of them.
21837 Set_Ekind
(T
, E_Record_Type
);
21839 Init_Size_Align
(T
);
21840 Set_Interfaces
(T
, No_Elist
);
21841 Set_Stored_Constraint
(T
, No_Elist
);
21842 Set_Default_SSO
(T
);
21843 Set_No_Reordering
(T
, No_Component_Reordering
);
21847 if Ada_Version
< Ada_2005
or else not Interface_Present
(Def
) then
21848 if Limited_Present
(Def
) then
21849 Check_SPARK_05_Restriction
("limited is not allowed", N
);
21852 if Abstract_Present
(Def
) then
21853 Check_SPARK_05_Restriction
("abstract is not allowed", N
);
21856 -- The flag Is_Tagged_Type might have already been set by
21857 -- Find_Type_Name if it detected an error for declaration T. This
21858 -- arises in the case of private tagged types where the full view
21859 -- omits the word tagged.
21862 Tagged_Present
(Def
)
21863 or else (Serious_Errors_Detected
> 0 and then Is_Tagged_Type
(T
));
21865 Set_Is_Limited_Record
(T
, Limited_Present
(Def
));
21868 Set_Is_Tagged_Type
(T
, True);
21869 Set_No_Tagged_Streams_Pragma
(T
, No_Tagged_Streams
);
21872 -- Type is abstract if full declaration carries keyword, or if
21873 -- previous partial view did.
21875 Set_Is_Abstract_Type
(T
, Is_Abstract_Type
(T
)
21876 or else Abstract_Present
(Def
));
21879 Check_SPARK_05_Restriction
("interface is not allowed", N
);
21882 Analyze_Interface_Declaration
(T
, Def
);
21884 if Present
(Discriminant_Specifications
(N
)) then
21886 ("interface types cannot have discriminants",
21887 Defining_Identifier
21888 (First
(Discriminant_Specifications
(N
))));
21892 -- First pass: if there are self-referential access components,
21893 -- create the required anonymous access type declarations, and if
21894 -- need be an incomplete type declaration for T itself.
21896 Check_Anonymous_Access_Components
(N
, T
, Prev
, Component_List
(Def
));
21898 if Ada_Version
>= Ada_2005
21899 and then Present
(Interface_List
(Def
))
21901 Check_Interfaces
(N
, Def
);
21904 Ifaces_List
: Elist_Id
;
21907 -- Ada 2005 (AI-251): Collect the list of progenitors that are not
21908 -- already in the parents.
21912 Ifaces_List
=> Ifaces_List
,
21913 Exclude_Parents
=> True);
21915 Set_Interfaces
(T
, Ifaces_List
);
21919 -- Records constitute a scope for the component declarations within.
21920 -- The scope is created prior to the processing of these declarations.
21921 -- Discriminants are processed first, so that they are visible when
21922 -- processing the other components. The Ekind of the record type itself
21923 -- is set to E_Record_Type (subtypes appear as E_Record_Subtype).
21925 -- Enter record scope
21929 -- If an incomplete or private type declaration was already given for
21930 -- the type, then this scope already exists, and the discriminants have
21931 -- been declared within. We must verify that the full declaration
21932 -- matches the incomplete one.
21934 Check_Or_Process_Discriminants
(N
, T
, Prev
);
21936 Set_Is_Constrained
(T
, not Has_Discriminants
(T
));
21937 Set_Has_Delayed_Freeze
(T
, True);
21939 -- For tagged types add a manually analyzed component corresponding
21940 -- to the component _tag, the corresponding piece of tree will be
21941 -- expanded as part of the freezing actions if it is not a CPP_Class.
21945 -- Do not add the tag unless we are in expansion mode
21947 if Expander_Active
then
21948 Tag_Comp
:= Make_Defining_Identifier
(Sloc
(Def
), Name_uTag
);
21949 Enter_Name
(Tag_Comp
);
21951 Set_Ekind
(Tag_Comp
, E_Component
);
21952 Set_Is_Tag
(Tag_Comp
);
21953 Set_Is_Aliased
(Tag_Comp
);
21954 Set_Etype
(Tag_Comp
, RTE
(RE_Tag
));
21955 Set_DT_Entry_Count
(Tag_Comp
, No_Uint
);
21956 Set_Original_Record_Component
(Tag_Comp
, Tag_Comp
);
21957 Init_Component_Location
(Tag_Comp
);
21959 -- Ada 2005 (AI-251): Addition of the Tag corresponding to all the
21960 -- implemented interfaces.
21962 if Has_Interfaces
(T
) then
21963 Add_Interface_Tag_Components
(N
, T
);
21967 Make_Class_Wide_Type
(T
);
21968 Set_Direct_Primitive_Operations
(T
, New_Elmt_List
);
21971 -- We must suppress range checks when processing record components in
21972 -- the presence of discriminants, since we don't want spurious checks to
21973 -- be generated during their analysis, but Suppress_Range_Checks flags
21974 -- must be reset the after processing the record definition.
21976 -- Note: this is the only use of Kill_Range_Checks, and is a bit odd,
21977 -- couldn't we just use the normal range check suppression method here.
21978 -- That would seem cleaner ???
21980 if Has_Discriminants
(T
) and then not Range_Checks_Suppressed
(T
) then
21981 Set_Kill_Range_Checks
(T
, True);
21982 Record_Type_Definition
(Def
, Prev
);
21983 Set_Kill_Range_Checks
(T
, False);
21985 Record_Type_Definition
(Def
, Prev
);
21988 -- Exit from record scope
21992 -- Ada 2005 (AI-251 and AI-345): Derive the interface subprograms of all
21993 -- the implemented interfaces and associate them an aliased entity.
21996 and then not Is_Empty_List
(Interface_List
(Def
))
21998 Derive_Progenitor_Subprograms
(T
, T
);
22001 Check_Function_Writable_Actuals
(N
);
22002 end Record_Type_Declaration
;
22004 ----------------------------
22005 -- Record_Type_Definition --
22006 ----------------------------
22008 procedure Record_Type_Definition
(Def
: Node_Id
; Prev_T
: Entity_Id
) is
22009 Component
: Entity_Id
;
22010 Ctrl_Components
: Boolean := False;
22011 Final_Storage_Only
: Boolean;
22015 if Ekind
(Prev_T
) = E_Incomplete_Type
then
22016 T
:= Full_View
(Prev_T
);
22021 -- In SPARK, tagged types and type extensions may only be declared in
22022 -- the specification of library unit packages.
22024 if Present
(Def
) and then Is_Tagged_Type
(T
) then
22030 if Nkind
(Parent
(Def
)) = N_Full_Type_Declaration
then
22031 Typ
:= Parent
(Def
);
22034 (Nkind
(Parent
(Def
)) = N_Derived_Type_Definition
);
22035 Typ
:= Parent
(Parent
(Def
));
22038 Ctxt
:= Parent
(Typ
);
22040 if Nkind
(Ctxt
) = N_Package_Body
22041 and then Nkind
(Parent
(Ctxt
)) = N_Compilation_Unit
22043 Check_SPARK_05_Restriction
22044 ("type should be defined in package specification", Typ
);
22046 elsif Nkind
(Ctxt
) /= N_Package_Specification
22047 or else Nkind
(Parent
(Parent
(Ctxt
))) /= N_Compilation_Unit
22049 Check_SPARK_05_Restriction
22050 ("type should be defined in library unit package", Typ
);
22055 Final_Storage_Only
:= not Is_Controlled
(T
);
22057 -- Ada 2005: Check whether an explicit Limited is present in a derived
22058 -- type declaration.
22060 if Nkind
(Parent
(Def
)) = N_Derived_Type_Definition
22061 and then Limited_Present
(Parent
(Def
))
22063 Set_Is_Limited_Record
(T
);
22066 -- If the component list of a record type is defined by the reserved
22067 -- word null and there is no discriminant part, then the record type has
22068 -- no components and all records of the type are null records (RM 3.7)
22069 -- This procedure is also called to process the extension part of a
22070 -- record extension, in which case the current scope may have inherited
22074 or else No
(Component_List
(Def
))
22075 or else Null_Present
(Component_List
(Def
))
22077 if not Is_Tagged_Type
(T
) then
22078 Check_SPARK_05_Restriction
("untagged record cannot be null", Def
);
22082 Analyze_Declarations
(Component_Items
(Component_List
(Def
)));
22084 if Present
(Variant_Part
(Component_List
(Def
))) then
22085 Check_SPARK_05_Restriction
("variant part is not allowed", Def
);
22086 Analyze
(Variant_Part
(Component_List
(Def
)));
22090 -- After completing the semantic analysis of the record definition,
22091 -- record components, both new and inherited, are accessible. Set their
22092 -- kind accordingly. Exclude malformed itypes from illegal declarations,
22093 -- whose Ekind may be void.
22095 Component
:= First_Entity
(Current_Scope
);
22096 while Present
(Component
) loop
22097 if Ekind
(Component
) = E_Void
22098 and then not Is_Itype
(Component
)
22100 Set_Ekind
(Component
, E_Component
);
22101 Init_Component_Location
(Component
);
22104 Propagate_Concurrent_Flags
(T
, Etype
(Component
));
22106 if Ekind
(Component
) /= E_Component
then
22109 -- Do not set Has_Controlled_Component on a class-wide equivalent
22110 -- type. See Make_CW_Equivalent_Type.
22112 elsif not Is_Class_Wide_Equivalent_Type
(T
)
22113 and then (Has_Controlled_Component
(Etype
(Component
))
22114 or else (Chars
(Component
) /= Name_uParent
22115 and then Is_Controlled
(Etype
(Component
))))
22117 Set_Has_Controlled_Component
(T
, True);
22118 Final_Storage_Only
:=
22120 and then Finalize_Storage_Only
(Etype
(Component
));
22121 Ctrl_Components
:= True;
22124 Next_Entity
(Component
);
22127 -- A Type is Finalize_Storage_Only only if all its controlled components
22130 if Ctrl_Components
then
22131 Set_Finalize_Storage_Only
(T
, Final_Storage_Only
);
22134 -- Place reference to end record on the proper entity, which may
22135 -- be a partial view.
22137 if Present
(Def
) then
22138 Process_End_Label
(Def
, 'e', Prev_T
);
22140 end Record_Type_Definition
;
22142 ------------------------
22143 -- Replace_Components --
22144 ------------------------
22146 procedure Replace_Components
(Typ
: Entity_Id
; Decl
: Node_Id
) is
22147 function Process
(N
: Node_Id
) return Traverse_Result
;
22153 function Process
(N
: Node_Id
) return Traverse_Result
is
22157 if Nkind
(N
) = N_Discriminant_Specification
then
22158 Comp
:= First_Discriminant
(Typ
);
22159 while Present
(Comp
) loop
22160 if Chars
(Comp
) = Chars
(Defining_Identifier
(N
)) then
22161 Set_Defining_Identifier
(N
, Comp
);
22165 Next_Discriminant
(Comp
);
22168 elsif Nkind
(N
) = N_Variant_Part
then
22169 Comp
:= First_Discriminant
(Typ
);
22170 while Present
(Comp
) loop
22171 if Chars
(Comp
) = Chars
(Name
(N
)) then
22172 Set_Entity
(Name
(N
), Comp
);
22176 Next_Discriminant
(Comp
);
22179 elsif Nkind
(N
) = N_Component_Declaration
then
22180 Comp
:= First_Component
(Typ
);
22181 while Present
(Comp
) loop
22182 if Chars
(Comp
) = Chars
(Defining_Identifier
(N
)) then
22183 Set_Defining_Identifier
(N
, Comp
);
22187 Next_Component
(Comp
);
22194 procedure Replace
is new Traverse_Proc
(Process
);
22196 -- Start of processing for Replace_Components
22200 end Replace_Components
;
22202 -------------------------------
22203 -- Set_Completion_Referenced --
22204 -------------------------------
22206 procedure Set_Completion_Referenced
(E
: Entity_Id
) is
22208 -- If in main unit, mark entity that is a completion as referenced,
22209 -- warnings go on the partial view when needed.
22211 if In_Extended_Main_Source_Unit
(E
) then
22212 Set_Referenced
(E
);
22214 end Set_Completion_Referenced
;
22216 ---------------------
22217 -- Set_Default_SSO --
22218 ---------------------
22220 procedure Set_Default_SSO
(T
: Entity_Id
) is
22222 case Opt
.Default_SSO
is
22226 Set_SSO_Set_Low_By_Default
(T
, True);
22228 Set_SSO_Set_High_By_Default
(T
, True);
22230 raise Program_Error
;
22232 end Set_Default_SSO
;
22234 ---------------------
22235 -- Set_Fixed_Range --
22236 ---------------------
22238 -- The range for fixed-point types is complicated by the fact that we
22239 -- do not know the exact end points at the time of the declaration. This
22240 -- is true for three reasons:
22242 -- A size clause may affect the fudging of the end-points.
22243 -- A small clause may affect the values of the end-points.
22244 -- We try to include the end-points if it does not affect the size.
22246 -- This means that the actual end-points must be established at the
22247 -- point when the type is frozen. Meanwhile, we first narrow the range
22248 -- as permitted (so that it will fit if necessary in a small specified
22249 -- size), and then build a range subtree with these narrowed bounds.
22250 -- Set_Fixed_Range constructs the range from real literal values, and
22251 -- sets the range as the Scalar_Range of the given fixed-point type entity.
22253 -- The parent of this range is set to point to the entity so that it is
22254 -- properly hooked into the tree (unlike normal Scalar_Range entries for
22255 -- other scalar types, which are just pointers to the range in the
22256 -- original tree, this would otherwise be an orphan).
22258 -- The tree is left unanalyzed. When the type is frozen, the processing
22259 -- in Freeze.Freeze_Fixed_Point_Type notices that the range is not
22260 -- analyzed, and uses this as an indication that it should complete
22261 -- work on the range (it will know the final small and size values).
22263 procedure Set_Fixed_Range
22269 S
: constant Node_Id
:=
22271 Low_Bound
=> Make_Real_Literal
(Loc
, Lo
),
22272 High_Bound
=> Make_Real_Literal
(Loc
, Hi
));
22274 Set_Scalar_Range
(E
, S
);
22277 -- Before the freeze point, the bounds of a fixed point are universal
22278 -- and carry the corresponding type.
22280 Set_Etype
(Low_Bound
(S
), Universal_Real
);
22281 Set_Etype
(High_Bound
(S
), Universal_Real
);
22282 end Set_Fixed_Range
;
22284 ----------------------------------
22285 -- Set_Scalar_Range_For_Subtype --
22286 ----------------------------------
22288 procedure Set_Scalar_Range_For_Subtype
22289 (Def_Id
: Entity_Id
;
22293 Kind
: constant Entity_Kind
:= Ekind
(Def_Id
);
22296 -- Defend against previous error
22298 if Nkind
(R
) = N_Error
then
22302 Set_Scalar_Range
(Def_Id
, R
);
22304 -- We need to link the range into the tree before resolving it so
22305 -- that types that are referenced, including importantly the subtype
22306 -- itself, are properly frozen (Freeze_Expression requires that the
22307 -- expression be properly linked into the tree). Of course if it is
22308 -- already linked in, then we do not disturb the current link.
22310 if No
(Parent
(R
)) then
22311 Set_Parent
(R
, Def_Id
);
22314 -- Reset the kind of the subtype during analysis of the range, to
22315 -- catch possible premature use in the bounds themselves.
22317 Set_Ekind
(Def_Id
, E_Void
);
22318 Process_Range_Expr_In_Decl
(R
, Subt
, Subtyp
=> Def_Id
);
22319 Set_Ekind
(Def_Id
, Kind
);
22320 end Set_Scalar_Range_For_Subtype
;
22322 --------------------------------------------------------
22323 -- Set_Stored_Constraint_From_Discriminant_Constraint --
22324 --------------------------------------------------------
22326 procedure Set_Stored_Constraint_From_Discriminant_Constraint
22330 -- Make sure set if encountered during Expand_To_Stored_Constraint
22332 Set_Stored_Constraint
(E
, No_Elist
);
22334 -- Give it the right value
22336 if Is_Constrained
(E
) and then Has_Discriminants
(E
) then
22337 Set_Stored_Constraint
(E
,
22338 Expand_To_Stored_Constraint
(E
, Discriminant_Constraint
(E
)));
22340 end Set_Stored_Constraint_From_Discriminant_Constraint
;
22342 -------------------------------------
22343 -- Signed_Integer_Type_Declaration --
22344 -------------------------------------
22346 procedure Signed_Integer_Type_Declaration
(T
: Entity_Id
; Def
: Node_Id
) is
22347 Implicit_Base
: Entity_Id
;
22348 Base_Typ
: Entity_Id
;
22351 Errs
: Boolean := False;
22355 function Can_Derive_From
(E
: Entity_Id
) return Boolean;
22356 -- Determine whether given bounds allow derivation from specified type
22358 procedure Check_Bound
(Expr
: Node_Id
);
22359 -- Check bound to make sure it is integral and static. If not, post
22360 -- appropriate error message and set Errs flag
22362 ---------------------
22363 -- Can_Derive_From --
22364 ---------------------
22366 -- Note we check both bounds against both end values, to deal with
22367 -- strange types like ones with a range of 0 .. -12341234.
22369 function Can_Derive_From
(E
: Entity_Id
) return Boolean is
22370 Lo
: constant Uint
:= Expr_Value
(Type_Low_Bound
(E
));
22371 Hi
: constant Uint
:= Expr_Value
(Type_High_Bound
(E
));
22373 return Lo
<= Lo_Val
and then Lo_Val
<= Hi
22375 Lo
<= Hi_Val
and then Hi_Val
<= Hi
;
22376 end Can_Derive_From
;
22382 procedure Check_Bound
(Expr
: Node_Id
) is
22384 -- If a range constraint is used as an integer type definition, each
22385 -- bound of the range must be defined by a static expression of some
22386 -- integer type, but the two bounds need not have the same integer
22387 -- type (Negative bounds are allowed.) (RM 3.5.4)
22389 if not Is_Integer_Type
(Etype
(Expr
)) then
22391 ("integer type definition bounds must be of integer type", Expr
);
22394 elsif not Is_OK_Static_Expression
(Expr
) then
22395 Flag_Non_Static_Expr
22396 ("non-static expression used for integer type bound!", Expr
);
22399 -- The bounds are folded into literals, and we set their type to be
22400 -- universal, to avoid typing difficulties: we cannot set the type
22401 -- of the literal to the new type, because this would be a forward
22402 -- reference for the back end, and if the original type is user-
22403 -- defined this can lead to spurious semantic errors (e.g. 2928-003).
22406 if Is_Entity_Name
(Expr
) then
22407 Fold_Uint
(Expr
, Expr_Value
(Expr
), True);
22410 Set_Etype
(Expr
, Universal_Integer
);
22414 -- Start of processing for Signed_Integer_Type_Declaration
22417 -- Create an anonymous base type
22420 Create_Itype
(E_Signed_Integer_Type
, Parent
(Def
), T
, 'B');
22422 -- Analyze and check the bounds, they can be of any integer type
22424 Lo
:= Low_Bound
(Def
);
22425 Hi
:= High_Bound
(Def
);
22427 -- Arbitrarily use Integer as the type if either bound had an error
22429 if Hi
= Error
or else Lo
= Error
then
22430 Base_Typ
:= Any_Integer
;
22431 Set_Error_Posted
(T
, True);
22433 -- Here both bounds are OK expressions
22436 Analyze_And_Resolve
(Lo
, Any_Integer
);
22437 Analyze_And_Resolve
(Hi
, Any_Integer
);
22443 Hi
:= Type_High_Bound
(Standard_Long_Long_Integer
);
22444 Lo
:= Type_Low_Bound
(Standard_Long_Long_Integer
);
22447 -- Find type to derive from
22449 Lo_Val
:= Expr_Value
(Lo
);
22450 Hi_Val
:= Expr_Value
(Hi
);
22452 if Can_Derive_From
(Standard_Short_Short_Integer
) then
22453 Base_Typ
:= Base_Type
(Standard_Short_Short_Integer
);
22455 elsif Can_Derive_From
(Standard_Short_Integer
) then
22456 Base_Typ
:= Base_Type
(Standard_Short_Integer
);
22458 elsif Can_Derive_From
(Standard_Integer
) then
22459 Base_Typ
:= Base_Type
(Standard_Integer
);
22461 elsif Can_Derive_From
(Standard_Long_Integer
) then
22462 Base_Typ
:= Base_Type
(Standard_Long_Integer
);
22464 elsif Can_Derive_From
(Standard_Long_Long_Integer
) then
22465 Check_Restriction
(No_Long_Long_Integers
, Def
);
22466 Base_Typ
:= Base_Type
(Standard_Long_Long_Integer
);
22469 Base_Typ
:= Base_Type
(Standard_Long_Long_Integer
);
22470 Error_Msg_N
("integer type definition bounds out of range", Def
);
22471 Hi
:= Type_High_Bound
(Standard_Long_Long_Integer
);
22472 Lo
:= Type_Low_Bound
(Standard_Long_Long_Integer
);
22476 -- Complete both implicit base and declared first subtype entities. The
22477 -- inheritance of the rep item chain ensures that SPARK-related pragmas
22478 -- are not clobbered when the signed integer type acts as a full view of
22481 Set_Etype
(Implicit_Base
, Base_Typ
);
22482 Set_Size_Info
(Implicit_Base
, Base_Typ
);
22483 Set_RM_Size
(Implicit_Base
, RM_Size
(Base_Typ
));
22484 Set_First_Rep_Item
(Implicit_Base
, First_Rep_Item
(Base_Typ
));
22485 Set_Scalar_Range
(Implicit_Base
, Scalar_Range
(Base_Typ
));
22487 Set_Ekind
(T
, E_Signed_Integer_Subtype
);
22488 Set_Etype
(T
, Implicit_Base
);
22489 Set_Size_Info
(T
, Implicit_Base
);
22490 Inherit_Rep_Item_Chain
(T
, Implicit_Base
);
22491 Set_Scalar_Range
(T
, Def
);
22492 Set_RM_Size
(T
, UI_From_Int
(Minimum_Size
(T
)));
22493 Set_Is_Constrained
(T
);
22494 end Signed_Integer_Type_Declaration
;