1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2012, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree
; use Atree
;
27 with Debug
; use Debug
;
28 with Einfo
; use Einfo
;
29 with Elists
; use Elists
;
30 with Errout
; use Errout
;
31 with Exp_Tss
; use Exp_Tss
;
32 with Exp_Util
; use Exp_Util
;
33 with Fname
; use Fname
;
34 with Freeze
; use Freeze
;
35 with Impunit
; use Impunit
;
37 with Lib
.Load
; use Lib
.Load
;
38 with Lib
.Xref
; use Lib
.Xref
;
39 with Namet
; use Namet
;
40 with Namet
.Sp
; use Namet
.Sp
;
41 with Nlists
; use Nlists
;
42 with Nmake
; use Nmake
;
44 with Output
; use Output
;
45 with Restrict
; use Restrict
;
46 with Rident
; use Rident
;
47 with Rtsfind
; use Rtsfind
;
49 with Sem_Aux
; use Sem_Aux
;
50 with Sem_Cat
; use Sem_Cat
;
51 with Sem_Ch3
; use Sem_Ch3
;
52 with Sem_Ch4
; use Sem_Ch4
;
53 with Sem_Ch6
; use Sem_Ch6
;
54 with Sem_Ch12
; use Sem_Ch12
;
55 with Sem_Ch13
; use Sem_Ch13
;
56 with Sem_Dim
; use Sem_Dim
;
57 with Sem_Disp
; use Sem_Disp
;
58 with Sem_Dist
; use Sem_Dist
;
59 with Sem_Eval
; use Sem_Eval
;
60 with Sem_Res
; use Sem_Res
;
61 with Sem_Util
; use Sem_Util
;
62 with Sem_Type
; use Sem_Type
;
63 with Stand
; use Stand
;
64 with Sinfo
; use Sinfo
;
65 with Sinfo
.CN
; use Sinfo
.CN
;
66 with Snames
; use Snames
;
67 with Style
; use Style
;
69 with Targparm
; use Targparm
;
70 with Tbuild
; use Tbuild
;
71 with Uintp
; use Uintp
;
73 package body Sem_Ch8
is
75 ------------------------------------
76 -- Visibility and Name Resolution --
77 ------------------------------------
79 -- This package handles name resolution and the collection of possible
80 -- interpretations for overloaded names, prior to overload resolution.
82 -- Name resolution is the process that establishes a mapping between source
83 -- identifiers and the entities they denote at each point in the program.
84 -- Each entity is represented by a defining occurrence. Each identifier
85 -- that denotes an entity points to the corresponding defining occurrence.
86 -- This is the entity of the applied occurrence. Each occurrence holds
87 -- an index into the names table, where source identifiers are stored.
89 -- Each entry in the names table for an identifier or designator uses the
90 -- Info pointer to hold a link to the currently visible entity that has
91 -- this name (see subprograms Get_Name_Entity_Id and Set_Name_Entity_Id
92 -- in package Sem_Util). The visibility is initialized at the beginning of
93 -- semantic processing to make entities in package Standard immediately
94 -- visible. The visibility table is used in a more subtle way when
95 -- compiling subunits (see below).
97 -- Entities that have the same name (i.e. homonyms) are chained. In the
98 -- case of overloaded entities, this chain holds all the possible meanings
99 -- of a given identifier. The process of overload resolution uses type
100 -- information to select from this chain the unique meaning of a given
103 -- Entities are also chained in their scope, through the Next_Entity link.
104 -- As a consequence, the name space is organized as a sparse matrix, where
105 -- each row corresponds to a scope, and each column to a source identifier.
106 -- Open scopes, that is to say scopes currently being compiled, have their
107 -- corresponding rows of entities in order, innermost scope first.
109 -- The scopes of packages that are mentioned in context clauses appear in
110 -- no particular order, interspersed among open scopes. This is because
111 -- in the course of analyzing the context of a compilation, a package
112 -- declaration is first an open scope, and subsequently an element of the
113 -- context. If subunits or child units are present, a parent unit may
114 -- appear under various guises at various times in the compilation.
116 -- When the compilation of the innermost scope is complete, the entities
117 -- defined therein are no longer visible. If the scope is not a package
118 -- declaration, these entities are never visible subsequently, and can be
119 -- removed from visibility chains. If the scope is a package declaration,
120 -- its visible declarations may still be accessible. Therefore the entities
121 -- defined in such a scope are left on the visibility chains, and only
122 -- their visibility (immediately visibility or potential use-visibility)
125 -- The ordering of homonyms on their chain does not necessarily follow
126 -- the order of their corresponding scopes on the scope stack. For
127 -- example, if package P and the enclosing scope both contain entities
128 -- named E, then when compiling the package body the chain for E will
129 -- hold the global entity first, and the local one (corresponding to
130 -- the current inner scope) next. As a result, name resolution routines
131 -- do not assume any relative ordering of the homonym chains, either
132 -- for scope nesting or to order of appearance of context clauses.
134 -- When compiling a child unit, entities in the parent scope are always
135 -- immediately visible. When compiling the body of a child unit, private
136 -- entities in the parent must also be made immediately visible. There
137 -- are separate routines to make the visible and private declarations
138 -- visible at various times (see package Sem_Ch7).
140 -- +--------+ +-----+
141 -- | In use |-------->| EU1 |-------------------------->
142 -- +--------+ +-----+
144 -- +--------+ +-----+ +-----+
145 -- | Stand. |---------------->| ES1 |--------------->| ES2 |--->
146 -- +--------+ +-----+ +-----+
148 -- +---------+ | +-----+
149 -- | with'ed |------------------------------>| EW2 |--->
150 -- +---------+ | +-----+
152 -- +--------+ +-----+ +-----+
153 -- | Scope2 |---------------->| E12 |--------------->| E22 |--->
154 -- +--------+ +-----+ +-----+
156 -- +--------+ +-----+ +-----+
157 -- | Scope1 |---------------->| E11 |--------------->| E12 |--->
158 -- +--------+ +-----+ +-----+
162 -- | | with'ed |----------------------------------------->
166 -- (innermost first) | |
167 -- +----------------------------+
168 -- Names table => | Id1 | | | | Id2 |
169 -- +----------------------------+
171 -- Name resolution must deal with several syntactic forms: simple names,
172 -- qualified names, indexed names, and various forms of calls.
174 -- Each identifier points to an entry in the names table. The resolution
175 -- of a simple name consists in traversing the homonym chain, starting
176 -- from the names table. If an entry is immediately visible, it is the one
177 -- designated by the identifier. If only potentially use-visible entities
178 -- are on the chain, we must verify that they do not hide each other. If
179 -- the entity we find is overloadable, we collect all other overloadable
180 -- entities on the chain as long as they are not hidden.
182 -- To resolve expanded names, we must find the entity at the intersection
183 -- of the entity chain for the scope (the prefix) and the homonym chain
184 -- for the selector. In general, homonym chains will be much shorter than
185 -- entity chains, so it is preferable to start from the names table as
186 -- well. If the entity found is overloadable, we must collect all other
187 -- interpretations that are defined in the scope denoted by the prefix.
189 -- For records, protected types, and tasks, their local entities are
190 -- removed from visibility chains on exit from the corresponding scope.
191 -- From the outside, these entities are always accessed by selected
192 -- notation, and the entity chain for the record type, protected type,
193 -- etc. is traversed sequentially in order to find the designated entity.
195 -- The discriminants of a type and the operations of a protected type or
196 -- task are unchained on exit from the first view of the type, (such as
197 -- a private or incomplete type declaration, or a protected type speci-
198 -- fication) and re-chained when compiling the second view.
200 -- In the case of operators, we do not make operators on derived types
201 -- explicit. As a result, the notation P."+" may denote either a user-
202 -- defined function with name "+", or else an implicit declaration of the
203 -- operator "+" in package P. The resolution of expanded names always
204 -- tries to resolve an operator name as such an implicitly defined entity,
205 -- in addition to looking for explicit declarations.
207 -- All forms of names that denote entities (simple names, expanded names,
208 -- character literals in some cases) have a Entity attribute, which
209 -- identifies the entity denoted by the name.
211 ---------------------
212 -- The Scope Stack --
213 ---------------------
215 -- The Scope stack keeps track of the scopes currently been compiled.
216 -- Every entity that contains declarations (including records) is placed
217 -- on the scope stack while it is being processed, and removed at the end.
218 -- Whenever a non-package scope is exited, the entities defined therein
219 -- are removed from the visibility table, so that entities in outer scopes
220 -- become visible (see previous description). On entry to Sem, the scope
221 -- stack only contains the package Standard. As usual, subunits complicate
222 -- this picture ever so slightly.
224 -- The Rtsfind mechanism can force a call to Semantics while another
225 -- compilation is in progress. The unit retrieved by Rtsfind must be
226 -- compiled in its own context, and has no access to the visibility of
227 -- the unit currently being compiled. The procedures Save_Scope_Stack and
228 -- Restore_Scope_Stack make entities in current open scopes invisible
229 -- before compiling the retrieved unit, and restore the compilation
230 -- environment afterwards.
232 ------------------------
233 -- Compiling subunits --
234 ------------------------
236 -- Subunits must be compiled in the environment of the corresponding stub,
237 -- that is to say with the same visibility into the parent (and its
238 -- context) that is available at the point of the stub declaration, but
239 -- with the additional visibility provided by the context clause of the
240 -- subunit itself. As a result, compilation of a subunit forces compilation
241 -- of the parent (see description in lib-). At the point of the stub
242 -- declaration, Analyze is called recursively to compile the proper body of
243 -- the subunit, but without reinitializing the names table, nor the scope
244 -- stack (i.e. standard is not pushed on the stack). In this fashion the
245 -- context of the subunit is added to the context of the parent, and the
246 -- subunit is compiled in the correct environment. Note that in the course
247 -- of processing the context of a subunit, Standard will appear twice on
248 -- the scope stack: once for the parent of the subunit, and once for the
249 -- unit in the context clause being compiled. However, the two sets of
250 -- entities are not linked by homonym chains, so that the compilation of
251 -- any context unit happens in a fresh visibility environment.
253 -------------------------------
254 -- Processing of USE Clauses --
255 -------------------------------
257 -- Every defining occurrence has a flag indicating if it is potentially use
258 -- visible. Resolution of simple names examines this flag. The processing
259 -- of use clauses consists in setting this flag on all visible entities
260 -- defined in the corresponding package. On exit from the scope of the use
261 -- clause, the corresponding flag must be reset. However, a package may
262 -- appear in several nested use clauses (pathological but legal, alas!)
263 -- which forces us to use a slightly more involved scheme:
265 -- a) The defining occurrence for a package holds a flag -In_Use- to
266 -- indicate that it is currently in the scope of a use clause. If a
267 -- redundant use clause is encountered, then the corresponding occurrence
268 -- of the package name is flagged -Redundant_Use-.
270 -- b) On exit from a scope, the use clauses in its declarative part are
271 -- scanned. The visibility flag is reset in all entities declared in
272 -- package named in a use clause, as long as the package is not flagged
273 -- as being in a redundant use clause (in which case the outer use
274 -- clause is still in effect, and the direct visibility of its entities
275 -- must be retained).
277 -- Note that entities are not removed from their homonym chains on exit
278 -- from the package specification. A subsequent use clause does not need
279 -- to rechain the visible entities, but only to establish their direct
282 -----------------------------------
283 -- Handling private declarations --
284 -----------------------------------
286 -- The principle that each entity has a single defining occurrence clashes
287 -- with the presence of two separate definitions for private types: the
288 -- first is the private type declaration, and second is the full type
289 -- declaration. It is important that all references to the type point to
290 -- the same defining occurrence, namely the first one. To enforce the two
291 -- separate views of the entity, the corresponding information is swapped
292 -- between the two declarations. Outside of the package, the defining
293 -- occurrence only contains the private declaration information, while in
294 -- the private part and the body of the package the defining occurrence
295 -- contains the full declaration. To simplify the swap, the defining
296 -- occurrence that currently holds the private declaration points to the
297 -- full declaration. During semantic processing the defining occurrence
298 -- also points to a list of private dependents, that is to say access types
299 -- or composite types whose designated types or component types are
300 -- subtypes or derived types of the private type in question. After the
301 -- full declaration has been seen, the private dependents are updated to
302 -- indicate that they have full definitions.
304 ------------------------------------
305 -- Handling of Undefined Messages --
306 ------------------------------------
308 -- In normal mode, only the first use of an undefined identifier generates
309 -- a message. The table Urefs is used to record error messages that have
310 -- been issued so that second and subsequent ones do not generate further
311 -- messages. However, the second reference causes text to be added to the
312 -- original undefined message noting "(more references follow)". The
313 -- full error list option (-gnatf) forces messages to be generated for
314 -- every reference and disconnects the use of this table.
316 type Uref_Entry
is record
318 -- Node for identifier for which original message was posted. The
319 -- Chars field of this identifier is used to detect later references
320 -- to the same identifier.
323 -- Records error message Id of original undefined message. Reset to
324 -- No_Error_Msg after the second occurrence, where it is used to add
325 -- text to the original message as described above.
328 -- Set if the message is not visible rather than undefined
331 -- Records location of error message. Used to make sure that we do
332 -- not consider a, b : undefined as two separate instances, which
333 -- would otherwise happen, since the parser converts this sequence
334 -- to a : undefined; b : undefined.
338 package Urefs
is new Table
.Table
(
339 Table_Component_Type
=> Uref_Entry
,
340 Table_Index_Type
=> Nat
,
341 Table_Low_Bound
=> 1,
343 Table_Increment
=> 100,
344 Table_Name
=> "Urefs");
346 Candidate_Renaming
: Entity_Id
;
347 -- Holds a candidate interpretation that appears in a subprogram renaming
348 -- declaration and does not match the given specification, but matches at
349 -- least on the first formal. Allows better error message when given
350 -- specification omits defaulted parameters, a common error.
352 -----------------------
353 -- Local Subprograms --
354 -----------------------
356 procedure Analyze_Generic_Renaming
359 -- Common processing for all three kinds of generic renaming declarations.
360 -- Enter new name and indicate that it renames the generic unit.
362 procedure Analyze_Renamed_Character
366 -- Renamed entity is given by a character literal, which must belong
367 -- to the return type of the new entity. Is_Body indicates whether the
368 -- declaration is a renaming_as_body. If the original declaration has
369 -- already been frozen (because of an intervening body, e.g.) the body of
370 -- the function must be built now. The same applies to the following
371 -- various renaming procedures.
373 procedure Analyze_Renamed_Dereference
377 -- Renamed entity is given by an explicit dereference. Prefix must be a
378 -- conformant access_to_subprogram type.
380 procedure Analyze_Renamed_Entry
384 -- If the renamed entity in a subprogram renaming is an entry or protected
385 -- subprogram, build a body for the new entity whose only statement is a
386 -- call to the renamed entity.
388 procedure Analyze_Renamed_Family_Member
392 -- Used when the renamed entity is an indexed component. The prefix must
393 -- denote an entry family.
395 procedure Analyze_Renamed_Primitive_Operation
399 -- If the renamed entity in a subprogram renaming is a primitive operation
400 -- or a class-wide operation in prefix form, save the target object, which
401 -- must be added to the list of actuals in any subsequent call.
403 function Applicable_Use
(Pack_Name
: Node_Id
) return Boolean;
404 -- Common code to Use_One_Package and Set_Use, to determine whether use
405 -- clause must be processed. Pack_Name is an entity name that references
406 -- the package in question.
408 procedure Attribute_Renaming
(N
: Node_Id
);
409 -- Analyze renaming of attribute as subprogram. The renaming declaration N
410 -- is rewritten as a subprogram body that returns the attribute reference
411 -- applied to the formals of the function.
413 procedure Set_Entity_Or_Discriminal
(N
: Node_Id
; E
: Entity_Id
);
414 -- Set Entity, with style check if need be. For a discriminant reference,
415 -- replace by the corresponding discriminal, i.e. the parameter of the
416 -- initialization procedure that corresponds to the discriminant.
418 procedure Check_Frozen_Renaming
(N
: Node_Id
; Subp
: Entity_Id
);
419 -- A renaming_as_body may occur after the entity of the original decla-
420 -- ration has been frozen. In that case, the body of the new entity must
421 -- be built now, because the usual mechanism of building the renamed
422 -- body at the point of freezing will not work. Subp is the subprogram
423 -- for which N provides the Renaming_As_Body.
425 procedure Check_In_Previous_With_Clause
428 -- N is a use_package clause and Nam the package name, or N is a use_type
429 -- clause and Nam is the prefix of the type name. In either case, verify
430 -- that the package is visible at that point in the context: either it
431 -- appears in a previous with_clause, or because it is a fully qualified
432 -- name and the root ancestor appears in a previous with_clause.
434 procedure Check_Library_Unit_Renaming
(N
: Node_Id
; Old_E
: Entity_Id
);
435 -- Verify that the entity in a renaming declaration that is a library unit
436 -- is itself a library unit and not a nested unit or subunit. Also check
437 -- that if the renaming is a child unit of a generic parent, then the
438 -- renamed unit must also be a child unit of that parent. Finally, verify
439 -- that a renamed generic unit is not an implicit child declared within
440 -- an instance of the parent.
442 procedure Chain_Use_Clause
(N
: Node_Id
);
443 -- Chain use clause onto list of uses clauses headed by First_Use_Clause in
444 -- the proper scope table entry. This is usually the current scope, but it
445 -- will be an inner scope when installing the use clauses of the private
446 -- declarations of a parent unit prior to compiling the private part of a
447 -- child unit. This chain is traversed when installing/removing use clauses
448 -- when compiling a subunit or instantiating a generic body on the fly,
449 -- when it is necessary to save and restore full environments.
451 function Has_Implicit_Character_Literal
(N
: Node_Id
) return Boolean;
452 -- Find a type derived from Character or Wide_Character in the prefix of N.
453 -- Used to resolved qualified names whose selector is a character literal.
455 function Has_Private_With
(E
: Entity_Id
) return Boolean;
456 -- Ada 2005 (AI-262): Determines if the current compilation unit has a
457 -- private with on E.
459 procedure Find_Expanded_Name
(N
: Node_Id
);
460 -- The input is a selected component known to be an expanded name. Verify
461 -- legality of selector given the scope denoted by prefix, and change node
462 -- N into a expanded name with a properly set Entity field.
464 function Find_Renamed_Entity
468 Is_Actual
: Boolean := False) return Entity_Id
;
469 -- Find the renamed entity that corresponds to the given parameter profile
470 -- in a subprogram renaming declaration. The renamed entity may be an
471 -- operator, a subprogram, an entry, or a protected operation. Is_Actual
472 -- indicates that the renaming is the one generated for an actual subpro-
473 -- gram in an instance, for which special visibility checks apply.
475 function Has_Implicit_Operator
(N
: Node_Id
) return Boolean;
476 -- N is an expanded name whose selector is an operator name (e.g. P."+").
477 -- declarative part contains an implicit declaration of an operator if it
478 -- has a declaration of a type to which one of the predefined operators
479 -- apply. The existence of this routine is an implementation artifact. A
480 -- more straightforward but more space-consuming choice would be to make
481 -- all inherited operators explicit in the symbol table.
483 procedure Inherit_Renamed_Profile
(New_S
: Entity_Id
; Old_S
: Entity_Id
);
484 -- A subprogram defined by a renaming declaration inherits the parameter
485 -- profile of the renamed entity. The subtypes given in the subprogram
486 -- specification are discarded and replaced with those of the renamed
487 -- subprogram, which are then used to recheck the default values.
489 function Is_Appropriate_For_Record
(T
: Entity_Id
) return Boolean;
490 -- Prefix is appropriate for record if it is of a record type, or an access
493 function Is_Appropriate_For_Entry_Prefix
(T
: Entity_Id
) return Boolean;
494 -- True if it is of a task type, a protected type, or else an access to one
497 procedure Note_Redundant_Use
(Clause
: Node_Id
);
498 -- Mark the name in a use clause as redundant if the corresponding entity
499 -- is already use-visible. Emit a warning if the use clause comes from
500 -- source and the proper warnings are enabled.
502 procedure Premature_Usage
(N
: Node_Id
);
503 -- Diagnose usage of an entity before it is visible
505 procedure Use_One_Package
(P
: Entity_Id
; N
: Node_Id
);
506 -- Make visible entities declared in package P potentially use-visible
507 -- in the current context. Also used in the analysis of subunits, when
508 -- re-installing use clauses of parent units. N is the use_clause that
509 -- names P (and possibly other packages).
511 procedure Use_One_Type
(Id
: Node_Id
; Installed
: Boolean := False);
512 -- Id is the subtype mark from a use type clause. This procedure makes
513 -- the primitive operators of the type potentially use-visible. The
514 -- boolean flag Installed indicates that the clause is being reinstalled
515 -- after previous analysis, and primitive operations are already chained
516 -- on the Used_Operations list of the clause.
518 procedure Write_Info
;
519 -- Write debugging information on entities declared in current scope
521 --------------------------------
522 -- Analyze_Exception_Renaming --
523 --------------------------------
525 -- The language only allows a single identifier, but the tree holds an
526 -- identifier list. The parser has already issued an error message if
527 -- there is more than one element in the list.
529 procedure Analyze_Exception_Renaming
(N
: Node_Id
) is
530 Id
: constant Node_Id
:= Defining_Identifier
(N
);
531 Nam
: constant Node_Id
:= Name
(N
);
534 Check_SPARK_Restriction
("exception renaming is not allowed", N
);
539 Set_Ekind
(Id
, E_Exception
);
540 Set_Exception_Code
(Id
, Uint_0
);
541 Set_Etype
(Id
, Standard_Exception_Type
);
542 Set_Is_Pure
(Id
, Is_Pure
(Current_Scope
));
544 if not Is_Entity_Name
(Nam
) or else
545 Ekind
(Entity
(Nam
)) /= E_Exception
547 Error_Msg_N
("invalid exception name in renaming", Nam
);
549 if Present
(Renamed_Object
(Entity
(Nam
))) then
550 Set_Renamed_Object
(Id
, Renamed_Object
(Entity
(Nam
)));
552 Set_Renamed_Object
(Id
, Entity
(Nam
));
555 end Analyze_Exception_Renaming
;
557 ---------------------------
558 -- Analyze_Expanded_Name --
559 ---------------------------
561 procedure Analyze_Expanded_Name
(N
: Node_Id
) is
563 -- If the entity pointer is already set, this is an internal node, or a
564 -- node that is analyzed more than once, after a tree modification. In
565 -- such a case there is no resolution to perform, just set the type. For
566 -- completeness, analyze prefix as well.
568 if Present
(Entity
(N
)) then
569 if Is_Type
(Entity
(N
)) then
570 Set_Etype
(N
, Entity
(N
));
572 Set_Etype
(N
, Etype
(Entity
(N
)));
575 Analyze
(Prefix
(N
));
578 Find_Expanded_Name
(N
);
580 end Analyze_Expanded_Name
;
582 ---------------------------------------
583 -- Analyze_Generic_Function_Renaming --
584 ---------------------------------------
586 procedure Analyze_Generic_Function_Renaming
(N
: Node_Id
) is
588 Analyze_Generic_Renaming
(N
, E_Generic_Function
);
589 end Analyze_Generic_Function_Renaming
;
591 --------------------------------------
592 -- Analyze_Generic_Package_Renaming --
593 --------------------------------------
595 procedure Analyze_Generic_Package_Renaming
(N
: Node_Id
) is
597 -- Apply the Text_IO Kludge here, since we may be renaming one of the
598 -- subpackages of Text_IO, then join common routine.
600 Text_IO_Kludge
(Name
(N
));
602 Analyze_Generic_Renaming
(N
, E_Generic_Package
);
603 end Analyze_Generic_Package_Renaming
;
605 ----------------------------------------
606 -- Analyze_Generic_Procedure_Renaming --
607 ----------------------------------------
609 procedure Analyze_Generic_Procedure_Renaming
(N
: Node_Id
) is
611 Analyze_Generic_Renaming
(N
, E_Generic_Procedure
);
612 end Analyze_Generic_Procedure_Renaming
;
614 ------------------------------
615 -- Analyze_Generic_Renaming --
616 ------------------------------
618 procedure Analyze_Generic_Renaming
622 New_P
: constant Entity_Id
:= Defining_Entity
(N
);
624 Inst
: Boolean := False; -- prevent junk warning
627 if Name
(N
) = Error
then
631 Check_SPARK_Restriction
("generic renaming is not allowed", N
);
633 Generate_Definition
(New_P
);
635 if Current_Scope
/= Standard_Standard
then
636 Set_Is_Pure
(New_P
, Is_Pure
(Current_Scope
));
639 if Nkind
(Name
(N
)) = N_Selected_Component
then
640 Check_Generic_Child_Unit
(Name
(N
), Inst
);
645 if not Is_Entity_Name
(Name
(N
)) then
646 Error_Msg_N
("expect entity name in renaming declaration", Name
(N
));
649 Old_P
:= Entity
(Name
(N
));
653 Set_Ekind
(New_P
, K
);
655 if Etype
(Old_P
) = Any_Type
then
658 elsif Ekind
(Old_P
) /= K
then
659 Error_Msg_N
("invalid generic unit name", Name
(N
));
662 if Present
(Renamed_Object
(Old_P
)) then
663 Set_Renamed_Object
(New_P
, Renamed_Object
(Old_P
));
665 Set_Renamed_Object
(New_P
, Old_P
);
668 Set_Is_Pure
(New_P
, Is_Pure
(Old_P
));
669 Set_Is_Preelaborated
(New_P
, Is_Preelaborated
(Old_P
));
671 Set_Etype
(New_P
, Etype
(Old_P
));
672 Set_Has_Completion
(New_P
);
674 if In_Open_Scopes
(Old_P
) then
675 Error_Msg_N
("within its scope, generic denotes its instance", N
);
678 Check_Library_Unit_Renaming
(N
, Old_P
);
680 end Analyze_Generic_Renaming
;
682 -----------------------------
683 -- Analyze_Object_Renaming --
684 -----------------------------
686 procedure Analyze_Object_Renaming
(N
: Node_Id
) is
687 Loc
: constant Source_Ptr
:= Sloc
(N
);
688 Id
: constant Entity_Id
:= Defining_Identifier
(N
);
690 Nam
: constant Node_Id
:= Name
(N
);
694 procedure Check_Constrained_Object
;
695 -- If the nominal type is unconstrained but the renamed object is
696 -- constrained, as can happen with renaming an explicit dereference or
697 -- a function return, build a constrained subtype from the object. If
698 -- the renaming is for a formal in an accept statement, the analysis
699 -- has already established its actual subtype. This is only relevant
700 -- if the renamed object is an explicit dereference.
702 function In_Generic_Scope
(E
: Entity_Id
) return Boolean;
703 -- Determine whether entity E is inside a generic cope
705 ------------------------------
706 -- Check_Constrained_Object --
707 ------------------------------
709 procedure Check_Constrained_Object
is
713 if Nkind_In
(Nam
, N_Function_Call
, N_Explicit_Dereference
)
714 and then Is_Composite_Type
(Etype
(Nam
))
715 and then not Is_Constrained
(Etype
(Nam
))
716 and then not Has_Unknown_Discriminants
(Etype
(Nam
))
717 and then Expander_Active
719 -- If Actual_Subtype is already set, nothing to do
721 if Ekind_In
(Id
, E_Variable
, E_Constant
)
722 and then Present
(Actual_Subtype
(Id
))
726 -- A renaming of an unchecked union does not have an
729 elsif Is_Unchecked_Union
(Etype
(Nam
)) then
733 Subt
:= Make_Temporary
(Loc
, 'T');
734 Remove_Side_Effects
(Nam
);
736 Make_Subtype_Declaration
(Loc
,
737 Defining_Identifier
=> Subt
,
738 Subtype_Indication
=>
739 Make_Subtype_From_Expr
(Nam
, Etype
(Nam
))));
740 Rewrite
(Subtype_Mark
(N
), New_Occurrence_Of
(Subt
, Loc
));
741 Set_Etype
(Nam
, Subt
);
744 end Check_Constrained_Object
;
746 ----------------------
747 -- In_Generic_Scope --
748 ----------------------
750 function In_Generic_Scope
(E
: Entity_Id
) return Boolean is
755 while Present
(S
) and then S
/= Standard_Standard
loop
756 if Is_Generic_Unit
(S
) then
764 end In_Generic_Scope
;
766 -- Start of processing for Analyze_Object_Renaming
773 Check_SPARK_Restriction
("object renaming is not allowed", N
);
775 Set_Is_Pure
(Id
, Is_Pure
(Current_Scope
));
778 -- The renaming of a component that depends on a discriminant requires
779 -- an actual subtype, because in subsequent use of the object Gigi will
780 -- be unable to locate the actual bounds. This explicit step is required
781 -- when the renaming is generated in removing side effects of an
782 -- already-analyzed expression.
784 if Nkind
(Nam
) = N_Selected_Component
785 and then Analyzed
(Nam
)
788 Dec
:= Build_Actual_Subtype_Of_Component
(Etype
(Nam
), Nam
);
790 if Present
(Dec
) then
791 Insert_Action
(N
, Dec
);
792 T
:= Defining_Identifier
(Dec
);
796 -- Complete analysis of the subtype mark in any case, for ASIS use
798 if Present
(Subtype_Mark
(N
)) then
799 Find_Type
(Subtype_Mark
(N
));
802 elsif Present
(Subtype_Mark
(N
)) then
803 Find_Type
(Subtype_Mark
(N
));
804 T
:= Entity
(Subtype_Mark
(N
));
807 -- Reject renamings of conversions unless the type is tagged, or
808 -- the conversion is implicit (which can occur for cases of anonymous
809 -- access types in Ada 2012).
811 if Nkind
(Nam
) = N_Type_Conversion
812 and then Comes_From_Source
(Nam
)
813 and then not Is_Tagged_Type
(T
)
816 ("renaming of conversion only allowed for tagged types", Nam
);
821 -- If the renamed object is a function call of a limited type,
822 -- the expansion of the renaming is complicated by the presence
823 -- of various temporaries and subtypes that capture constraints
824 -- of the renamed object. Rewrite node as an object declaration,
825 -- whose expansion is simpler. Given that the object is limited
826 -- there is no copy involved and no performance hit.
828 if Nkind
(Nam
) = N_Function_Call
829 and then Is_Immutably_Limited_Type
(Etype
(Nam
))
830 and then not Is_Constrained
(Etype
(Nam
))
831 and then Comes_From_Source
(N
)
834 Set_Ekind
(Id
, E_Constant
);
836 Make_Object_Declaration
(Loc
,
837 Defining_Identifier
=> Id
,
838 Constant_Present
=> True,
839 Object_Definition
=> New_Occurrence_Of
(Etype
(Nam
), Loc
),
840 Expression
=> Relocate_Node
(Nam
)));
844 -- Ada 2012 (AI05-149): Reject renaming of an anonymous access object
845 -- when renaming declaration has a named access type. The Ada 2012
846 -- coverage rules allow an anonymous access type in the context of
847 -- an expected named general access type, but the renaming rules
848 -- require the types to be the same. (An exception is when the type
849 -- of the renaming is also an anonymous access type, which can only
850 -- happen due to a renaming created by the expander.)
852 if Nkind
(Nam
) = N_Type_Conversion
853 and then not Comes_From_Source
(Nam
)
854 and then Ekind
(Etype
(Expression
(Nam
))) = E_Anonymous_Access_Type
855 and then Ekind
(T
) /= E_Anonymous_Access_Type
857 Wrong_Type
(Expression
(Nam
), T
); -- Should we give better error???
860 -- Check that a class-wide object is not being renamed as an object
861 -- of a specific type. The test for access types is needed to exclude
862 -- cases where the renamed object is a dynamically tagged access
863 -- result, such as occurs in certain expansions.
865 if Is_Tagged_Type
(T
) then
866 Check_Dynamically_Tagged_Expression
872 -- Ada 2005 (AI-230/AI-254): Access renaming
874 else pragma Assert
(Present
(Access_Definition
(N
)));
875 T
:= Access_Definition
877 N
=> Access_Definition
(N
));
881 -- Ada 2005 AI05-105: if the declaration has an anonymous access
882 -- type, the renamed object must also have an anonymous type, and
883 -- this is a name resolution rule. This was implicit in the last part
884 -- of the first sentence in 8.5.1(3/2), and is made explicit by this
887 if not Is_Overloaded
(Nam
) then
888 if Ekind
(Etype
(Nam
)) /= Ekind
(T
) then
890 ("expect anonymous access type in object renaming", N
);
897 Typ
: Entity_Id
:= Empty
;
898 Seen
: Boolean := False;
901 Get_First_Interp
(Nam
, I
, It
);
902 while Present
(It
.Typ
) loop
904 -- Renaming is ambiguous if more than one candidate
905 -- interpretation is type-conformant with the context.
907 if Ekind
(It
.Typ
) = Ekind
(T
) then
908 if Ekind
(T
) = E_Anonymous_Access_Subprogram_Type
911 (Designated_Type
(T
), Designated_Type
(It
.Typ
))
917 ("ambiguous expression in renaming", Nam
);
920 elsif Ekind
(T
) = E_Anonymous_Access_Type
922 Covers
(Designated_Type
(T
), Designated_Type
(It
.Typ
))
928 ("ambiguous expression in renaming", Nam
);
932 if Covers
(T
, It
.Typ
) then
934 Set_Etype
(Nam
, Typ
);
935 Set_Is_Overloaded
(Nam
, False);
939 Get_Next_Interp
(I
, It
);
946 -- Ada 2005 (AI-231): "In the case where the type is defined by an
947 -- access_definition, the renamed entity shall be of an access-to-
948 -- constant type if and only if the access_definition defines an
949 -- access-to-constant type" ARM 8.5.1(4)
951 if Constant_Present
(Access_Definition
(N
))
952 and then not Is_Access_Constant
(Etype
(Nam
))
954 Error_Msg_N
("(Ada 2005): the renamed object is not "
955 & "access-to-constant (RM 8.5.1(6))", N
);
957 elsif not Constant_Present
(Access_Definition
(N
))
958 and then Is_Access_Constant
(Etype
(Nam
))
960 Error_Msg_N
("(Ada 2005): the renamed object is not "
961 & "access-to-variable (RM 8.5.1(6))", N
);
964 if Is_Access_Subprogram_Type
(Etype
(Nam
)) then
965 Check_Subtype_Conformant
966 (Designated_Type
(T
), Designated_Type
(Etype
(Nam
)));
968 elsif not Subtypes_Statically_Match
969 (Designated_Type
(T
),
970 Available_View
(Designated_Type
(Etype
(Nam
))))
973 ("subtype of renamed object does not statically match", N
);
977 -- Special processing for renaming function return object. Some errors
978 -- and warnings are produced only for calls that come from source.
980 if Nkind
(Nam
) = N_Function_Call
then
983 -- Usage is illegal in Ada 83
986 if Comes_From_Source
(Nam
) then
988 ("(Ada 83) cannot rename function return object", Nam
);
991 -- In Ada 95, warn for odd case of renaming parameterless function
992 -- call if this is not a limited type (where this is useful).
995 if Warn_On_Object_Renames_Function
996 and then No
(Parameter_Associations
(Nam
))
997 and then not Is_Limited_Type
(Etype
(Nam
))
998 and then Comes_From_Source
(Nam
)
1001 ("?renaming function result object is suspicious", Nam
);
1003 ("\?function & will be called only once", Nam
,
1004 Entity
(Name
(Nam
)));
1005 Error_Msg_N
-- CODEFIX
1006 ("\?suggest using an initialized constant object instead",
1013 Check_Constrained_Object
;
1015 -- An object renaming requires an exact match of the type. Class-wide
1016 -- matching is not allowed.
1018 if Is_Class_Wide_Type
(T
)
1019 and then Base_Type
(Etype
(Nam
)) /= Base_Type
(T
)
1021 Wrong_Type
(Nam
, T
);
1026 -- Ada 2005 (AI-326): Handle wrong use of incomplete type
1028 if Nkind
(Nam
) = N_Explicit_Dereference
1029 and then Ekind
(Etype
(T2
)) = E_Incomplete_Type
1031 Error_Msg_NE
("invalid use of incomplete type&", Id
, T2
);
1034 elsif Ekind
(Etype
(T
)) = E_Incomplete_Type
then
1035 Error_Msg_NE
("invalid use of incomplete type&", Id
, T
);
1039 -- Ada 2005 (AI-327)
1041 if Ada_Version
>= Ada_2005
1042 and then Nkind
(Nam
) = N_Attribute_Reference
1043 and then Attribute_Name
(Nam
) = Name_Priority
1047 elsif Ada_Version
>= Ada_2005
1048 and then Nkind
(Nam
) in N_Has_Entity
1052 Nam_Ent
: Entity_Id
;
1055 if Nkind
(Nam
) = N_Attribute_Reference
then
1056 Nam_Ent
:= Entity
(Prefix
(Nam
));
1058 Nam_Ent
:= Entity
(Nam
);
1061 Nam_Decl
:= Parent
(Nam_Ent
);
1063 if Has_Null_Exclusion
(N
)
1064 and then not Has_Null_Exclusion
(Nam_Decl
)
1066 -- Ada 2005 (AI-423): If the object name denotes a generic
1067 -- formal object of a generic unit G, and the object renaming
1068 -- declaration occurs within the body of G or within the body
1069 -- of a generic unit declared within the declarative region
1070 -- of G, then the declaration of the formal object of G must
1071 -- have a null exclusion or a null-excluding subtype.
1073 if Is_Formal_Object
(Nam_Ent
)
1074 and then In_Generic_Scope
(Id
)
1076 if not Can_Never_Be_Null
(Etype
(Nam_Ent
)) then
1078 ("renamed formal does not exclude `NULL` "
1079 & "(RM 8.5.1(4.6/2))", N
);
1081 elsif In_Package_Body
(Scope
(Id
)) then
1083 ("formal object does not have a null exclusion"
1084 & "(RM 8.5.1(4.6/2))", N
);
1087 -- Ada 2005 (AI-423): Otherwise, the subtype of the object name
1088 -- shall exclude null.
1090 elsif not Can_Never_Be_Null
(Etype
(Nam_Ent
)) then
1092 ("renamed object does not exclude `NULL` "
1093 & "(RM 8.5.1(4.6/2))", N
);
1095 -- An instance is illegal if it contains a renaming that
1096 -- excludes null, and the actual does not. The renaming
1097 -- declaration has already indicated that the declaration
1098 -- of the renamed actual in the instance will raise
1099 -- constraint_error.
1101 elsif Nkind
(Nam_Decl
) = N_Object_Declaration
1102 and then In_Instance
1104 (Corresponding_Generic_Association
(Nam_Decl
))
1105 and then Nkind
(Expression
(Nam_Decl
))
1106 = N_Raise_Constraint_Error
1109 ("renamed actual does not exclude `NULL` "
1110 & "(RM 8.5.1(4.6/2))", N
);
1112 -- Finally, if there is a null exclusion, the subtype mark
1113 -- must not be null-excluding.
1115 elsif No
(Access_Definition
(N
))
1116 and then Can_Never_Be_Null
(T
)
1119 ("`NOT NULL` not allowed (& already excludes null)",
1124 elsif Can_Never_Be_Null
(T
)
1125 and then not Can_Never_Be_Null
(Etype
(Nam_Ent
))
1128 ("renamed object does not exclude `NULL` "
1129 & "(RM 8.5.1(4.6/2))", N
);
1131 elsif Has_Null_Exclusion
(N
)
1132 and then No
(Access_Definition
(N
))
1133 and then Can_Never_Be_Null
(T
)
1136 ("`NOT NULL` not allowed (& already excludes null)", N
, T
);
1141 Set_Ekind
(Id
, E_Variable
);
1143 -- Initialize the object size and alignment. Note that we used to call
1144 -- Init_Size_Align here, but that's wrong for objects which have only
1145 -- an Esize, not an RM_Size field!
1147 Init_Object_Size_Align
(Id
);
1149 if T
= Any_Type
or else Etype
(Nam
) = Any_Type
then
1152 -- Verify that the renamed entity is an object or a function call. It
1153 -- may have been rewritten in several ways.
1155 elsif Is_Object_Reference
(Nam
) then
1156 if Comes_From_Source
(N
)
1157 and then Is_Dependent_Component_Of_Mutable_Object
(Nam
)
1160 ("illegal renaming of discriminant-dependent component", Nam
);
1163 -- A static function call may have been folded into a literal
1165 elsif Nkind
(Original_Node
(Nam
)) = N_Function_Call
1167 -- When expansion is disabled, attribute reference is not
1168 -- rewritten as function call. Otherwise it may be rewritten
1169 -- as a conversion, so check original node.
1171 or else (Nkind
(Original_Node
(Nam
)) = N_Attribute_Reference
1172 and then Is_Function_Attribute_Name
1173 (Attribute_Name
(Original_Node
(Nam
))))
1175 -- Weird but legal, equivalent to renaming a function call.
1176 -- Illegal if the literal is the result of constant-folding an
1177 -- attribute reference that is not a function.
1179 or else (Is_Entity_Name
(Nam
)
1180 and then Ekind
(Entity
(Nam
)) = E_Enumeration_Literal
1182 Nkind
(Original_Node
(Nam
)) /= N_Attribute_Reference
)
1184 or else (Nkind
(Nam
) = N_Type_Conversion
1185 and then Is_Tagged_Type
(Entity
(Subtype_Mark
(Nam
))))
1189 elsif Nkind
(Nam
) = N_Type_Conversion
then
1191 ("renaming of conversion only allowed for tagged types", Nam
);
1193 -- Ada 2005 (AI-327)
1195 elsif Ada_Version
>= Ada_2005
1196 and then Nkind
(Nam
) = N_Attribute_Reference
1197 and then Attribute_Name
(Nam
) = Name_Priority
1201 -- Allow internally generated x'Reference expression
1203 elsif Nkind
(Nam
) = N_Reference
then
1207 Error_Msg_N
("expect object name in renaming", Nam
);
1212 if not Is_Variable
(Nam
) then
1213 Set_Ekind
(Id
, E_Constant
);
1214 Set_Never_Set_In_Source
(Id
, True);
1215 Set_Is_True_Constant
(Id
, True);
1218 Set_Renamed_Object
(Id
, Nam
);
1219 Analyze_Dimension
(N
);
1220 end Analyze_Object_Renaming
;
1222 ------------------------------
1223 -- Analyze_Package_Renaming --
1224 ------------------------------
1226 procedure Analyze_Package_Renaming
(N
: Node_Id
) is
1227 New_P
: constant Entity_Id
:= Defining_Entity
(N
);
1232 if Name
(N
) = Error
then
1236 -- Apply Text_IO kludge here since we may be renaming a child of Text_IO
1238 Text_IO_Kludge
(Name
(N
));
1240 if Current_Scope
/= Standard_Standard
then
1241 Set_Is_Pure
(New_P
, Is_Pure
(Current_Scope
));
1247 if Is_Entity_Name
(Name
(N
)) then
1248 Old_P
:= Entity
(Name
(N
));
1253 if Etype
(Old_P
) = Any_Type
then
1254 Error_Msg_N
("expect package name in renaming", Name
(N
));
1256 elsif Ekind
(Old_P
) /= E_Package
1257 and then not (Ekind
(Old_P
) = E_Generic_Package
1258 and then In_Open_Scopes
(Old_P
))
1260 if Ekind
(Old_P
) = E_Generic_Package
then
1262 ("generic package cannot be renamed as a package", Name
(N
));
1264 Error_Msg_Sloc
:= Sloc
(Old_P
);
1266 ("expect package name in renaming, found& declared#",
1270 -- Set basic attributes to minimize cascaded errors
1272 Set_Ekind
(New_P
, E_Package
);
1273 Set_Etype
(New_P
, Standard_Void_Type
);
1275 -- Here for OK package renaming
1278 -- Entities in the old package are accessible through the renaming
1279 -- entity. The simplest implementation is to have both packages share
1282 Set_Ekind
(New_P
, E_Package
);
1283 Set_Etype
(New_P
, Standard_Void_Type
);
1285 if Present
(Renamed_Object
(Old_P
)) then
1286 Set_Renamed_Object
(New_P
, Renamed_Object
(Old_P
));
1288 Set_Renamed_Object
(New_P
, Old_P
);
1291 Set_Has_Completion
(New_P
);
1293 Set_First_Entity
(New_P
, First_Entity
(Old_P
));
1294 Set_Last_Entity
(New_P
, Last_Entity
(Old_P
));
1295 Set_First_Private_Entity
(New_P
, First_Private_Entity
(Old_P
));
1296 Check_Library_Unit_Renaming
(N
, Old_P
);
1297 Generate_Reference
(Old_P
, Name
(N
));
1299 -- If the renaming is in the visible part of a package, then we set
1300 -- Renamed_In_Spec for the renamed package, to prevent giving
1301 -- warnings about no entities referenced. Such a warning would be
1302 -- overenthusiastic, since clients can see entities in the renamed
1303 -- package via the visible package renaming.
1306 Ent
: constant Entity_Id
:= Cunit_Entity
(Current_Sem_Unit
);
1308 if Ekind
(Ent
) = E_Package
1309 and then not In_Private_Part
(Ent
)
1310 and then In_Extended_Main_Source_Unit
(N
)
1311 and then Ekind
(Old_P
) = E_Package
1313 Set_Renamed_In_Spec
(Old_P
);
1317 -- If this is the renaming declaration of a package instantiation
1318 -- within itself, it is the declaration that ends the list of actuals
1319 -- for the instantiation. At this point, the subtypes that rename
1320 -- the actuals are flagged as generic, to avoid spurious ambiguities
1321 -- if the actuals for two distinct formals happen to coincide. If
1322 -- the actual is a private type, the subtype has a private completion
1323 -- that is flagged in the same fashion.
1325 -- Resolution is identical to what is was in the original generic.
1326 -- On exit from the generic instance, these are turned into regular
1327 -- subtypes again, so they are compatible with types in their class.
1329 if not Is_Generic_Instance
(Old_P
) then
1332 Spec
:= Specification
(Unit_Declaration_Node
(Old_P
));
1335 if Nkind
(Spec
) = N_Package_Specification
1336 and then Present
(Generic_Parent
(Spec
))
1337 and then Old_P
= Current_Scope
1338 and then Chars
(New_P
) = Chars
(Generic_Parent
(Spec
))
1344 E
:= First_Entity
(Old_P
);
1349 and then Nkind
(Parent
(E
)) = N_Subtype_Declaration
1351 Set_Is_Generic_Actual_Type
(E
);
1353 if Is_Private_Type
(E
)
1354 and then Present
(Full_View
(E
))
1356 Set_Is_Generic_Actual_Type
(Full_View
(E
));
1365 end Analyze_Package_Renaming
;
1367 -------------------------------
1368 -- Analyze_Renamed_Character --
1369 -------------------------------
1371 procedure Analyze_Renamed_Character
1376 C
: constant Node_Id
:= Name
(N
);
1379 if Ekind
(New_S
) = E_Function
then
1380 Resolve
(C
, Etype
(New_S
));
1383 Check_Frozen_Renaming
(N
, New_S
);
1387 Error_Msg_N
("character literal can only be renamed as function", N
);
1389 end Analyze_Renamed_Character
;
1391 ---------------------------------
1392 -- Analyze_Renamed_Dereference --
1393 ---------------------------------
1395 procedure Analyze_Renamed_Dereference
1400 Nam
: constant Node_Id
:= Name
(N
);
1401 P
: constant Node_Id
:= Prefix
(Nam
);
1407 if not Is_Overloaded
(P
) then
1408 if Ekind
(Etype
(Nam
)) /= E_Subprogram_Type
1409 or else not Type_Conformant
(Etype
(Nam
), New_S
)
1411 Error_Msg_N
("designated type does not match specification", P
);
1420 Get_First_Interp
(Nam
, Ind
, It
);
1422 while Present
(It
.Nam
) loop
1424 if Ekind
(It
.Nam
) = E_Subprogram_Type
1425 and then Type_Conformant
(It
.Nam
, New_S
)
1427 if Typ
/= Any_Id
then
1428 Error_Msg_N
("ambiguous renaming", P
);
1435 Get_Next_Interp
(Ind
, It
);
1438 if Typ
= Any_Type
then
1439 Error_Msg_N
("designated type does not match specification", P
);
1444 Check_Frozen_Renaming
(N
, New_S
);
1448 end Analyze_Renamed_Dereference
;
1450 ---------------------------
1451 -- Analyze_Renamed_Entry --
1452 ---------------------------
1454 procedure Analyze_Renamed_Entry
1459 Nam
: constant Node_Id
:= Name
(N
);
1460 Sel
: constant Node_Id
:= Selector_Name
(Nam
);
1464 if Entity
(Sel
) = Any_Id
then
1466 -- Selector is undefined on prefix. Error emitted already
1468 Set_Has_Completion
(New_S
);
1472 -- Otherwise find renamed entity and build body of New_S as a call to it
1474 Old_S
:= Find_Renamed_Entity
(N
, Selector_Name
(Nam
), New_S
);
1476 if Old_S
= Any_Id
then
1477 Error_Msg_N
(" no subprogram or entry matches specification", N
);
1480 Check_Subtype_Conformant
(New_S
, Old_S
, N
);
1481 Generate_Reference
(New_S
, Defining_Entity
(N
), 'b');
1482 Style
.Check_Identifier
(Defining_Entity
(N
), New_S
);
1485 -- Only mode conformance required for a renaming_as_declaration
1487 Check_Mode_Conformant
(New_S
, Old_S
, N
);
1490 Inherit_Renamed_Profile
(New_S
, Old_S
);
1492 -- The prefix can be an arbitrary expression that yields a task type,
1493 -- so it must be resolved.
1495 Resolve
(Prefix
(Nam
), Scope
(Old_S
));
1498 Set_Convention
(New_S
, Convention
(Old_S
));
1499 Set_Has_Completion
(New_S
, Inside_A_Generic
);
1502 Check_Frozen_Renaming
(N
, New_S
);
1504 end Analyze_Renamed_Entry
;
1506 -----------------------------------
1507 -- Analyze_Renamed_Family_Member --
1508 -----------------------------------
1510 procedure Analyze_Renamed_Family_Member
1515 Nam
: constant Node_Id
:= Name
(N
);
1516 P
: constant Node_Id
:= Prefix
(Nam
);
1520 if (Is_Entity_Name
(P
) and then Ekind
(Entity
(P
)) = E_Entry_Family
)
1521 or else (Nkind
(P
) = N_Selected_Component
1523 Ekind
(Entity
(Selector_Name
(P
))) = E_Entry_Family
)
1525 if Is_Entity_Name
(P
) then
1526 Old_S
:= Entity
(P
);
1528 Old_S
:= Entity
(Selector_Name
(P
));
1531 if not Entity_Matches_Spec
(Old_S
, New_S
) then
1532 Error_Msg_N
("entry family does not match specification", N
);
1535 Check_Subtype_Conformant
(New_S
, Old_S
, N
);
1536 Generate_Reference
(New_S
, Defining_Entity
(N
), 'b');
1537 Style
.Check_Identifier
(Defining_Entity
(N
), New_S
);
1541 Error_Msg_N
("no entry family matches specification", N
);
1544 Set_Has_Completion
(New_S
, Inside_A_Generic
);
1547 Check_Frozen_Renaming
(N
, New_S
);
1549 end Analyze_Renamed_Family_Member
;
1551 -----------------------------------------
1552 -- Analyze_Renamed_Primitive_Operation --
1553 -----------------------------------------
1555 procedure Analyze_Renamed_Primitive_Operation
1564 Ctyp
: Conformance_Type
) return Boolean;
1565 -- Verify that the signatures of the renamed entity and the new entity
1566 -- match. The first formal of the renamed entity is skipped because it
1567 -- is the target object in any subsequent call.
1571 Ctyp
: Conformance_Type
) return Boolean
1577 if Ekind
(Subp
) /= Ekind
(New_S
) then
1581 Old_F
:= Next_Formal
(First_Formal
(Subp
));
1582 New_F
:= First_Formal
(New_S
);
1583 while Present
(Old_F
) and then Present
(New_F
) loop
1584 if not Conforming_Types
(Etype
(Old_F
), Etype
(New_F
), Ctyp
) then
1588 if Ctyp
>= Mode_Conformant
1589 and then Ekind
(Old_F
) /= Ekind
(New_F
)
1594 Next_Formal
(New_F
);
1595 Next_Formal
(Old_F
);
1602 if not Is_Overloaded
(Selector_Name
(Name
(N
))) then
1603 Old_S
:= Entity
(Selector_Name
(Name
(N
)));
1605 if not Conforms
(Old_S
, Type_Conformant
) then
1610 -- Find the operation that matches the given signature
1618 Get_First_Interp
(Selector_Name
(Name
(N
)), Ind
, It
);
1620 while Present
(It
.Nam
) loop
1621 if Conforms
(It
.Nam
, Type_Conformant
) then
1625 Get_Next_Interp
(Ind
, It
);
1630 if Old_S
= Any_Id
then
1631 Error_Msg_N
(" no subprogram or entry matches specification", N
);
1635 if not Conforms
(Old_S
, Subtype_Conformant
) then
1636 Error_Msg_N
("subtype conformance error in renaming", N
);
1639 Generate_Reference
(New_S
, Defining_Entity
(N
), 'b');
1640 Style
.Check_Identifier
(Defining_Entity
(N
), New_S
);
1643 -- Only mode conformance required for a renaming_as_declaration
1645 if not Conforms
(Old_S
, Mode_Conformant
) then
1646 Error_Msg_N
("mode conformance error in renaming", N
);
1650 -- Inherit_Renamed_Profile (New_S, Old_S);
1652 -- The prefix can be an arbitrary expression that yields an
1653 -- object, so it must be resolved.
1655 Resolve
(Prefix
(Name
(N
)));
1657 end Analyze_Renamed_Primitive_Operation
;
1659 ---------------------------------
1660 -- Analyze_Subprogram_Renaming --
1661 ---------------------------------
1663 procedure Analyze_Subprogram_Renaming
(N
: Node_Id
) is
1664 Formal_Spec
: constant Node_Id
:= Corresponding_Formal_Spec
(N
);
1665 Is_Actual
: constant Boolean := Present
(Formal_Spec
);
1666 Inst_Node
: Node_Id
:= Empty
;
1667 Nam
: constant Node_Id
:= Name
(N
);
1669 Old_S
: Entity_Id
:= Empty
;
1670 Rename_Spec
: Entity_Id
;
1671 Save_AV
: constant Ada_Version_Type
:= Ada_Version
;
1672 Save_AV_Exp
: constant Ada_Version_Type
:= Ada_Version_Explicit
;
1673 Spec
: constant Node_Id
:= Specification
(N
);
1675 procedure Check_Null_Exclusion
1678 -- Ada 2005 (AI-423): Given renaming Ren of subprogram Sub, check the
1679 -- following AI rules:
1681 -- If Ren is a renaming of a formal subprogram and one of its
1682 -- parameters has a null exclusion, then the corresponding formal
1683 -- in Sub must also have one. Otherwise the subtype of the Sub's
1684 -- formal parameter must exclude null.
1686 -- If Ren is a renaming of a formal function and its return
1687 -- profile has a null exclusion, then Sub's return profile must
1688 -- have one. Otherwise the subtype of Sub's return profile must
1691 procedure Freeze_Actual_Profile
;
1692 -- In Ada 2012, enforce the freezing rule concerning formal incomplete
1693 -- types: a callable entity freezes its profile, unless it has an
1694 -- incomplete untagged formal (RM 13.14(10.2/3)).
1696 function Original_Subprogram
(Subp
: Entity_Id
) return Entity_Id
;
1697 -- Find renamed entity when the declaration is a renaming_as_body and
1698 -- the renamed entity may itself be a renaming_as_body. Used to enforce
1699 -- rule that a renaming_as_body is illegal if the declaration occurs
1700 -- before the subprogram it completes is frozen, and renaming indirectly
1701 -- renames the subprogram itself.(Defect Report 8652/0027).
1703 function Check_Class_Wide_Actual
return Entity_Id
;
1704 -- AI05-0071: In an instance, if the actual for a formal type FT with
1705 -- unknown discriminants is a class-wide type CT, and the generic has
1706 -- a formal subprogram with a box for a primitive operation of FT,
1707 -- then the corresponding actual subprogram denoted by the default is a
1708 -- class-wide operation whose body is a dispatching call. We replace the
1709 -- generated renaming declaration:
1711 -- procedure P (X : CT) renames P;
1713 -- by a different renaming and a class-wide operation:
1715 -- procedure Pr (X : T) renames P; -- renames primitive operation
1716 -- procedure P (X : CT); -- class-wide operation
1718 -- procedure P (X : CT) is begin Pr (X); end; -- dispatching call
1720 -- This rule only applies if there is no explicit visible class-wide
1721 -- operation at the point of the instantiation.
1723 function Has_Class_Wide_Actual
return Boolean;
1724 -- Ada 2012 (AI05-071, AI05-0131): True if N is the renaming for a
1725 -- defaulted formal subprogram when the actual for the controlling
1726 -- formal type is class-wide.
1728 -----------------------------
1729 -- Check_Class_Wide_Actual --
1730 -----------------------------
1732 function Check_Class_Wide_Actual
return Entity_Id
is
1733 Loc
: constant Source_Ptr
:= Sloc
(N
);
1736 Formal_Type
: Entity_Id
;
1737 Actual_Type
: Entity_Id
;
1742 function Make_Call
(Prim_Op
: Entity_Id
) return Node_Id
;
1743 -- Build dispatching call for body of class-wide operation
1745 function Make_Spec
return Node_Id
;
1746 -- Create subprogram specification for declaration and body of
1747 -- class-wide operation, using signature of renaming declaration.
1753 function Make_Call
(Prim_Op
: Entity_Id
) return Node_Id
is
1758 Actuals
:= New_List
;
1759 F
:= First
(Parameter_Specifications
(Specification
(New_Decl
)));
1760 while Present
(F
) loop
1762 Make_Identifier
(Loc
, Chars
(Defining_Identifier
(F
))));
1766 if Ekind_In
(Prim_Op
, E_Function
, E_Operator
) then
1767 return Make_Simple_Return_Statement
(Loc
,
1769 Make_Function_Call
(Loc
,
1770 Name
=> New_Occurrence_Of
(Prim_Op
, Loc
),
1771 Parameter_Associations
=> Actuals
));
1774 Make_Procedure_Call_Statement
(Loc
,
1775 Name
=> New_Occurrence_Of
(Prim_Op
, Loc
),
1776 Parameter_Associations
=> Actuals
);
1784 function Make_Spec
return Node_Id
is
1785 Param_Specs
: constant List_Id
:= Copy_Parameter_List
(New_S
);
1788 if Ekind
(New_S
) = E_Procedure
then
1790 Make_Procedure_Specification
(Loc
,
1791 Defining_Unit_Name
=>
1792 Make_Defining_Identifier
(Loc
,
1793 Chars
(Defining_Unit_Name
(Spec
))),
1794 Parameter_Specifications
=> Param_Specs
);
1797 Make_Function_Specification
(Loc
,
1798 Defining_Unit_Name
=>
1799 Make_Defining_Identifier
(Loc
,
1800 Chars
(Defining_Unit_Name
(Spec
))),
1801 Parameter_Specifications
=> Param_Specs
,
1802 Result_Definition
=>
1803 New_Copy_Tree
(Result_Definition
(Spec
)));
1807 -- Start of processing for Check_Class_Wide_Actual
1811 Formal_Type
:= Empty
;
1812 Actual_Type
:= Empty
;
1814 F
:= First_Formal
(Formal_Spec
);
1815 while Present
(F
) loop
1816 if Has_Unknown_Discriminants
(Etype
(F
))
1817 and then not Is_Class_Wide_Type
(Etype
(F
))
1818 and then Is_Class_Wide_Type
(Get_Instance_Of
(Etype
(F
)))
1820 Formal_Type
:= Etype
(F
);
1821 Actual_Type
:= Etype
(Get_Instance_Of
(Formal_Type
));
1828 if Present
(Formal_Type
) then
1830 -- Create declaration and body for class-wide operation
1833 Make_Subprogram_Declaration
(Loc
, Specification
=> Make_Spec
);
1836 Make_Subprogram_Body
(Loc
,
1837 Specification
=> Make_Spec
,
1838 Declarations
=> No_List
,
1839 Handled_Statement_Sequence
=>
1840 Make_Handled_Sequence_Of_Statements
(Loc
, New_List
));
1842 -- Modify Spec and create internal name for renaming of primitive
1845 Set_Defining_Unit_Name
(Spec
, Make_Temporary
(Loc
, 'R'));
1846 F
:= First
(Parameter_Specifications
(Spec
));
1847 while Present
(F
) loop
1848 if Nkind
(Parameter_Type
(F
)) = N_Identifier
1849 and then Is_Class_Wide_Type
(Entity
(Parameter_Type
(F
)))
1851 Set_Parameter_Type
(F
, New_Occurrence_Of
(Actual_Type
, Loc
));
1856 New_S
:= Analyze_Subprogram_Specification
(Spec
);
1857 Result
:= Find_Renamed_Entity
(N
, Name
(N
), New_S
, Is_Actual
);
1860 if Result
/= Any_Id
then
1861 Insert_Before
(N
, New_Decl
);
1864 -- Add dispatching call to body of class-wide operation
1866 Append
(Make_Call
(Result
),
1867 Statements
(Handled_Statement_Sequence
(New_Body
)));
1869 -- The generated body does not freeze. It is analyzed when the
1870 -- generated operation is frozen. This body is only needed if
1871 -- expansion is enabled.
1873 if Expander_Active
then
1874 Append_Freeze_Action
(Defining_Entity
(New_Decl
), New_Body
);
1877 Result
:= Defining_Entity
(New_Decl
);
1880 -- Return the class-wide operation if one was created
1883 end Check_Class_Wide_Actual
;
1885 --------------------------
1886 -- Check_Null_Exclusion --
1887 --------------------------
1889 procedure Check_Null_Exclusion
1893 Ren_Formal
: Entity_Id
;
1894 Sub_Formal
: Entity_Id
;
1899 Ren_Formal
:= First_Formal
(Ren
);
1900 Sub_Formal
:= First_Formal
(Sub
);
1901 while Present
(Ren_Formal
)
1902 and then Present
(Sub_Formal
)
1904 if Has_Null_Exclusion
(Parent
(Ren_Formal
))
1906 not (Has_Null_Exclusion
(Parent
(Sub_Formal
))
1907 or else Can_Never_Be_Null
(Etype
(Sub_Formal
)))
1910 ("`NOT NULL` required for parameter &",
1911 Parent
(Sub_Formal
), Sub_Formal
);
1914 Next_Formal
(Ren_Formal
);
1915 Next_Formal
(Sub_Formal
);
1918 -- Return profile check
1920 if Nkind
(Parent
(Ren
)) = N_Function_Specification
1921 and then Nkind
(Parent
(Sub
)) = N_Function_Specification
1922 and then Has_Null_Exclusion
(Parent
(Ren
))
1924 not (Has_Null_Exclusion
(Parent
(Sub
))
1925 or else Can_Never_Be_Null
(Etype
(Sub
)))
1928 ("return must specify `NOT NULL`",
1929 Result_Definition
(Parent
(Sub
)));
1931 end Check_Null_Exclusion
;
1933 ---------------------------
1934 -- Freeze_Actual_Profile --
1935 ---------------------------
1937 procedure Freeze_Actual_Profile
is
1939 Has_Untagged_Inc
: Boolean;
1940 Instantiation_Node
: constant Node_Id
:= Parent
(N
);
1943 if Ada_Version
>= Ada_2012
then
1944 F
:= First_Formal
(Formal_Spec
);
1945 Has_Untagged_Inc
:= False;
1946 while Present
(F
) loop
1947 if Ekind
(Etype
(F
)) = E_Incomplete_Type
1948 and then not Is_Tagged_Type
(Etype
(F
))
1950 Has_Untagged_Inc
:= True;
1954 F
:= Next_Formal
(F
);
1957 if Ekind
(Formal_Spec
) = E_Function
1958 and then Ekind
(Etype
(Formal_Spec
)) = E_Incomplete_Type
1959 and then not Is_Tagged_Type
(Etype
(F
))
1961 Has_Untagged_Inc
:= True;
1964 if not Has_Untagged_Inc
then
1965 F
:= First_Formal
(Old_S
);
1966 while Present
(F
) loop
1967 Freeze_Before
(Instantiation_Node
, Etype
(F
));
1969 if Is_Incomplete_Or_Private_Type
(Etype
(F
))
1970 and then No
(Underlying_Type
(Etype
(F
)))
1971 and then not Is_Generic_Type
(Etype
(F
))
1974 ("type& must be frozen before this point",
1975 Instantiation_Node
, Etype
(F
));
1978 F
:= Next_Formal
(F
);
1982 end Freeze_Actual_Profile
;
1984 ---------------------------
1985 -- Has_Class_Wide_Actual --
1986 ---------------------------
1988 function Has_Class_Wide_Actual
return Boolean is
1994 and then Nkind
(Nam
) in N_Has_Entity
1995 and then Present
(Entity
(Nam
))
1996 and then Is_Dispatching_Operation
(Entity
(Nam
))
1998 F_Nam
:= First_Entity
(Entity
(Nam
));
1999 F_Spec
:= First_Formal
(Formal_Spec
);
2000 while Present
(F_Nam
)
2001 and then Present
(F_Spec
)
2003 if Is_Controlling_Formal
(F_Nam
)
2004 and then Has_Unknown_Discriminants
(Etype
(F_Spec
))
2005 and then not Is_Class_Wide_Type
(Etype
(F_Spec
))
2006 and then Is_Class_Wide_Type
(Get_Instance_Of
(Etype
(F_Spec
)))
2011 Next_Entity
(F_Nam
);
2012 Next_Formal
(F_Spec
);
2017 end Has_Class_Wide_Actual
;
2019 -------------------------
2020 -- Original_Subprogram --
2021 -------------------------
2023 function Original_Subprogram
(Subp
: Entity_Id
) return Entity_Id
is
2024 Orig_Decl
: Node_Id
;
2025 Orig_Subp
: Entity_Id
;
2028 -- First case: renamed entity is itself a renaming
2030 if Present
(Alias
(Subp
)) then
2031 return Alias
(Subp
);
2034 Nkind
(Unit_Declaration_Node
(Subp
)) = N_Subprogram_Declaration
2036 (Corresponding_Body
(Unit_Declaration_Node
(Subp
)))
2038 -- Check if renamed entity is a renaming_as_body
2041 Unit_Declaration_Node
2042 (Corresponding_Body
(Unit_Declaration_Node
(Subp
)));
2044 if Nkind
(Orig_Decl
) = N_Subprogram_Renaming_Declaration
then
2045 Orig_Subp
:= Entity
(Name
(Orig_Decl
));
2047 if Orig_Subp
= Rename_Spec
then
2049 -- Circularity detected
2054 return (Original_Subprogram
(Orig_Subp
));
2062 end Original_Subprogram
;
2064 CW_Actual
: constant Boolean := Has_Class_Wide_Actual
;
2065 -- Ada 2012 (AI05-071, AI05-0131): True if the renaming is for a
2066 -- defaulted formal subprogram when the actual for a related formal
2067 -- type is class-wide.
2069 -- Start of processing for Analyze_Subprogram_Renaming
2072 -- We must test for the attribute renaming case before the Analyze
2073 -- call because otherwise Sem_Attr will complain that the attribute
2074 -- is missing an argument when it is analyzed.
2076 if Nkind
(Nam
) = N_Attribute_Reference
then
2078 -- In the case of an abstract formal subprogram association, rewrite
2079 -- an actual given by a stream attribute as the name of the
2080 -- corresponding stream primitive of the type.
2082 -- In a generic context the stream operations are not generated, and
2083 -- this must be treated as a normal attribute reference, to be
2084 -- expanded in subsequent instantiations.
2086 if Is_Actual
and then Is_Abstract_Subprogram
(Formal_Spec
)
2087 and then Full_Expander_Active
2090 Stream_Prim
: Entity_Id
;
2091 Prefix_Type
: constant Entity_Id
:= Entity
(Prefix
(Nam
));
2094 -- The class-wide forms of the stream attributes are not
2095 -- primitive dispatching operations (even though they
2096 -- internally dispatch to a stream attribute).
2098 if Is_Class_Wide_Type
(Prefix_Type
) then
2100 ("attribute must be a primitive dispatching operation",
2105 -- Retrieve the primitive subprogram associated with the
2106 -- attribute. This can only be a stream attribute, since those
2107 -- are the only ones that are dispatching (and the actual for
2108 -- an abstract formal subprogram must be dispatching
2112 case Attribute_Name
(Nam
) is
2115 Find_Prim_Op
(Prefix_Type
, TSS_Stream_Input
);
2118 Find_Prim_Op
(Prefix_Type
, TSS_Stream_Output
);
2121 Find_Prim_Op
(Prefix_Type
, TSS_Stream_Read
);
2124 Find_Prim_Op
(Prefix_Type
, TSS_Stream_Write
);
2127 ("attribute must be a primitive"
2128 & " dispatching operation", Nam
);
2134 -- If no operation was found, and the type is limited,
2135 -- the user should have defined one.
2137 when Program_Error
=>
2138 if Is_Limited_Type
(Prefix_Type
) then
2140 ("stream operation not defined for type&",
2144 -- Otherwise, compiler should have generated default
2151 -- Rewrite the attribute into the name of its corresponding
2152 -- primitive dispatching subprogram. We can then proceed with
2153 -- the usual processing for subprogram renamings.
2156 Prim_Name
: constant Node_Id
:=
2157 Make_Identifier
(Sloc
(Nam
),
2158 Chars
=> Chars
(Stream_Prim
));
2160 Set_Entity
(Prim_Name
, Stream_Prim
);
2161 Rewrite
(Nam
, Prim_Name
);
2166 -- Normal processing for a renaming of an attribute
2169 Attribute_Renaming
(N
);
2174 -- Check whether this declaration corresponds to the instantiation
2175 -- of a formal subprogram.
2177 -- If this is an instantiation, the corresponding actual is frozen and
2178 -- error messages can be made more precise. If this is a default
2179 -- subprogram, the entity is already established in the generic, and is
2180 -- not retrieved by visibility. If it is a default with a box, the
2181 -- candidate interpretations, if any, have been collected when building
2182 -- the renaming declaration. If overloaded, the proper interpretation is
2183 -- determined in Find_Renamed_Entity. If the entity is an operator,
2184 -- Find_Renamed_Entity applies additional visibility checks.
2187 Inst_Node
:= Unit_Declaration_Node
(Formal_Spec
);
2189 -- Check whether the renaming is for a defaulted actual subprogram
2190 -- with a class-wide actual.
2193 New_S
:= Analyze_Subprogram_Specification
(Spec
);
2194 Old_S
:= Check_Class_Wide_Actual
;
2196 elsif Is_Entity_Name
(Nam
)
2197 and then Present
(Entity
(Nam
))
2198 and then not Comes_From_Source
(Nam
)
2199 and then not Is_Overloaded
(Nam
)
2201 Old_S
:= Entity
(Nam
);
2202 New_S
:= Analyze_Subprogram_Specification
(Spec
);
2206 if Ekind
(Entity
(Nam
)) = E_Operator
then
2210 if Box_Present
(Inst_Node
) then
2211 Old_S
:= Find_Renamed_Entity
(N
, Name
(N
), New_S
, Is_Actual
);
2213 -- If there is an immediately visible homonym of the operator
2214 -- and the declaration has a default, this is worth a warning
2215 -- because the user probably did not intend to get the pre-
2216 -- defined operator, visible in the generic declaration. To
2217 -- find if there is an intended candidate, analyze the renaming
2218 -- again in the current context.
2220 elsif Scope
(Old_S
) = Standard_Standard
2221 and then Present
(Default_Name
(Inst_Node
))
2224 Decl
: constant Node_Id
:= New_Copy_Tree
(N
);
2228 Set_Entity
(Name
(Decl
), Empty
);
2229 Analyze
(Name
(Decl
));
2231 Find_Renamed_Entity
(Decl
, Name
(Decl
), New_S
, True);
2234 and then In_Open_Scopes
(Scope
(Hidden
))
2235 and then Is_Immediately_Visible
(Hidden
)
2236 and then Comes_From_Source
(Hidden
)
2237 and then Hidden
/= Old_S
2239 Error_Msg_Sloc
:= Sloc
(Hidden
);
2240 Error_Msg_N
("?default subprogram is resolved " &
2241 "in the generic declaration " &
2242 "(RM 12.6(17))", N
);
2243 Error_Msg_NE
("\?and will not use & #", N
, Hidden
);
2251 New_S
:= Analyze_Subprogram_Specification
(Spec
);
2255 -- Renamed entity must be analyzed first, to avoid being hidden by
2256 -- new name (which might be the same in a generic instance).
2260 -- The renaming defines a new overloaded entity, which is analyzed
2261 -- like a subprogram declaration.
2263 New_S
:= Analyze_Subprogram_Specification
(Spec
);
2266 if Current_Scope
/= Standard_Standard
then
2267 Set_Is_Pure
(New_S
, Is_Pure
(Current_Scope
));
2270 Rename_Spec
:= Find_Corresponding_Spec
(N
);
2272 -- Case of Renaming_As_Body
2274 if Present
(Rename_Spec
) then
2276 -- Renaming declaration is the completion of the declaration of
2277 -- Rename_Spec. We build an actual body for it at the freezing point.
2279 Set_Corresponding_Spec
(N
, Rename_Spec
);
2281 -- Deal with special case of stream functions of abstract types
2284 if Nkind
(Unit_Declaration_Node
(Rename_Spec
)) =
2285 N_Abstract_Subprogram_Declaration
2287 -- Input stream functions are abstract if the object type is
2288 -- abstract. Similarly, all default stream functions for an
2289 -- interface type are abstract. However, these subprograms may
2290 -- receive explicit declarations in representation clauses, making
2291 -- the attribute subprograms usable as defaults in subsequent
2293 -- In this case we rewrite the declaration to make the subprogram
2294 -- non-abstract. We remove the previous declaration, and insert
2295 -- the new one at the point of the renaming, to prevent premature
2296 -- access to unfrozen types. The new declaration reuses the
2297 -- specification of the previous one, and must not be analyzed.
2300 (Is_Primitive
(Entity
(Nam
))
2302 Is_Abstract_Type
(Find_Dispatching_Type
(Entity
(Nam
))));
2304 Old_Decl
: constant Node_Id
:=
2305 Unit_Declaration_Node
(Rename_Spec
);
2306 New_Decl
: constant Node_Id
:=
2307 Make_Subprogram_Declaration
(Sloc
(N
),
2309 Relocate_Node
(Specification
(Old_Decl
)));
2312 Insert_After
(N
, New_Decl
);
2313 Set_Is_Abstract_Subprogram
(Rename_Spec
, False);
2314 Set_Analyzed
(New_Decl
);
2318 Set_Corresponding_Body
(Unit_Declaration_Node
(Rename_Spec
), New_S
);
2320 if Ada_Version
= Ada_83
and then Comes_From_Source
(N
) then
2321 Error_Msg_N
("(Ada 83) renaming cannot serve as a body", N
);
2324 Set_Convention
(New_S
, Convention
(Rename_Spec
));
2325 Check_Fully_Conformant
(New_S
, Rename_Spec
);
2326 Set_Public_Status
(New_S
);
2328 -- The specification does not introduce new formals, but only
2329 -- repeats the formals of the original subprogram declaration.
2330 -- For cross-reference purposes, and for refactoring tools, we
2331 -- treat the formals of the renaming declaration as body formals.
2333 Reference_Body_Formals
(Rename_Spec
, New_S
);
2335 -- Indicate that the entity in the declaration functions like the
2336 -- corresponding body, and is not a new entity. The body will be
2337 -- constructed later at the freeze point, so indicate that the
2338 -- completion has not been seen yet.
2340 Set_Ekind
(New_S
, E_Subprogram_Body
);
2341 New_S
:= Rename_Spec
;
2342 Set_Has_Completion
(Rename_Spec
, False);
2344 -- Ada 2005: check overriding indicator
2346 if Present
(Overridden_Operation
(Rename_Spec
)) then
2347 if Must_Not_Override
(Specification
(N
)) then
2349 ("subprogram& overrides inherited operation",
2352 Style_Check
and then not Must_Override
(Specification
(N
))
2354 Style
.Missing_Overriding
(N
, Rename_Spec
);
2357 elsif Must_Override
(Specification
(N
)) then
2358 Error_Msg_NE
("subprogram& is not overriding", N
, Rename_Spec
);
2361 -- Normal subprogram renaming (not renaming as body)
2364 Generate_Definition
(New_S
);
2365 New_Overloaded_Entity
(New_S
);
2367 if Is_Entity_Name
(Nam
)
2368 and then Is_Intrinsic_Subprogram
(Entity
(Nam
))
2372 Check_Delayed_Subprogram
(New_S
);
2376 -- There is no need for elaboration checks on the new entity, which may
2377 -- be called before the next freezing point where the body will appear.
2378 -- Elaboration checks refer to the real entity, not the one created by
2379 -- the renaming declaration.
2381 Set_Kill_Elaboration_Checks
(New_S
, True);
2383 if Etype
(Nam
) = Any_Type
then
2384 Set_Has_Completion
(New_S
);
2387 elsif Nkind
(Nam
) = N_Selected_Component
then
2389 -- A prefix of the form A.B can designate an entry of task A, a
2390 -- protected operation of protected object A, or finally a primitive
2391 -- operation of object A. In the later case, A is an object of some
2392 -- tagged type, or an access type that denotes one such. To further
2393 -- distinguish these cases, note that the scope of a task entry or
2394 -- protected operation is type of the prefix.
2396 -- The prefix could be an overloaded function call that returns both
2397 -- kinds of operations. This overloading pathology is left to the
2398 -- dedicated reader ???
2401 T
: constant Entity_Id
:= Etype
(Prefix
(Nam
));
2410 Is_Tagged_Type
(Designated_Type
(T
))))
2411 and then Scope
(Entity
(Selector_Name
(Nam
))) /= T
2413 Analyze_Renamed_Primitive_Operation
2414 (N
, New_S
, Present
(Rename_Spec
));
2418 -- Renamed entity is an entry or protected operation. For those
2419 -- cases an explicit body is built (at the point of freezing of
2420 -- this entity) that contains a call to the renamed entity.
2422 -- This is not allowed for renaming as body if the renamed
2423 -- spec is already frozen (see RM 8.5.4(5) for details).
2425 if Present
(Rename_Spec
)
2426 and then Is_Frozen
(Rename_Spec
)
2429 ("renaming-as-body cannot rename entry as subprogram", N
);
2431 ("\since & is already frozen (RM 8.5.4(5))",
2434 Analyze_Renamed_Entry
(N
, New_S
, Present
(Rename_Spec
));
2441 elsif Nkind
(Nam
) = N_Explicit_Dereference
then
2443 -- Renamed entity is designated by access_to_subprogram expression.
2444 -- Must build body to encapsulate call, as in the entry case.
2446 Analyze_Renamed_Dereference
(N
, New_S
, Present
(Rename_Spec
));
2449 elsif Nkind
(Nam
) = N_Indexed_Component
then
2450 Analyze_Renamed_Family_Member
(N
, New_S
, Present
(Rename_Spec
));
2453 elsif Nkind
(Nam
) = N_Character_Literal
then
2454 Analyze_Renamed_Character
(N
, New_S
, Present
(Rename_Spec
));
2457 elsif not Is_Entity_Name
(Nam
)
2458 or else not Is_Overloadable
(Entity
(Nam
))
2460 -- Do not mention the renaming if it comes from an instance
2462 if not Is_Actual
then
2463 Error_Msg_N
("expect valid subprogram name in renaming", N
);
2465 Error_Msg_NE
("no visible subprogram for formal&", N
, Nam
);
2471 -- Find the renamed entity that matches the given specification. Disable
2472 -- Ada_83 because there is no requirement of full conformance between
2473 -- renamed entity and new entity, even though the same circuit is used.
2475 -- This is a bit of a kludge, which introduces a really irregular use of
2476 -- Ada_Version[_Explicit]. Would be nice to find cleaner way to do this
2479 Ada_Version
:= Ada_Version_Type
'Max (Ada_Version
, Ada_95
);
2480 Ada_Version_Explicit
:= Ada_Version
;
2483 Old_S
:= Find_Renamed_Entity
(N
, Name
(N
), New_S
, Is_Actual
);
2485 -- The visible operation may be an inherited abstract operation that
2486 -- was overridden in the private part, in which case a call will
2487 -- dispatch to the overriding operation. Use the overriding one in
2488 -- the renaming declaration, to prevent spurious errors below.
2490 if Is_Overloadable
(Old_S
)
2491 and then Is_Abstract_Subprogram
(Old_S
)
2492 and then No
(DTC_Entity
(Old_S
))
2493 and then Present
(Alias
(Old_S
))
2494 and then not Is_Abstract_Subprogram
(Alias
(Old_S
))
2495 and then Present
(Overridden_Operation
(Alias
(Old_S
)))
2497 Old_S
:= Alias
(Old_S
);
2500 -- When the renamed subprogram is overloaded and used as an actual
2501 -- of a generic, its entity is set to the first available homonym.
2502 -- We must first disambiguate the name, then set the proper entity.
2504 if Is_Actual
and then Is_Overloaded
(Nam
) then
2505 Set_Entity
(Nam
, Old_S
);
2509 -- Most common case: subprogram renames subprogram. No body is generated
2510 -- in this case, so we must indicate the declaration is complete as is.
2511 -- and inherit various attributes of the renamed subprogram.
2513 if No
(Rename_Spec
) then
2514 Set_Has_Completion
(New_S
);
2515 Set_Is_Imported
(New_S
, Is_Imported
(Entity
(Nam
)));
2516 Set_Is_Pure
(New_S
, Is_Pure
(Entity
(Nam
)));
2517 Set_Is_Preelaborated
(New_S
, Is_Preelaborated
(Entity
(Nam
)));
2519 -- Ada 2005 (AI-423): Check the consistency of null exclusions
2520 -- between a subprogram and its correct renaming.
2522 -- Note: the Any_Id check is a guard that prevents compiler crashes
2523 -- when performing a null exclusion check between a renaming and a
2524 -- renamed subprogram that has been found to be illegal.
2526 if Ada_Version
>= Ada_2005
2527 and then Entity
(Nam
) /= Any_Id
2529 Check_Null_Exclusion
2531 Sub
=> Entity
(Nam
));
2534 -- Enforce the Ada 2005 rule that the renamed entity cannot require
2535 -- overriding. The flag Requires_Overriding is set very selectively
2536 -- and misses some other illegal cases. The additional conditions
2537 -- checked below are sufficient but not necessary ???
2539 -- The rule does not apply to the renaming generated for an actual
2540 -- subprogram in an instance.
2545 -- Guard against previous errors, and omit renamings of predefined
2548 elsif not Ekind_In
(Old_S
, E_Function
, E_Procedure
) then
2551 elsif Requires_Overriding
(Old_S
)
2553 (Is_Abstract_Subprogram
(Old_S
)
2554 and then Present
(Find_Dispatching_Type
(Old_S
))
2556 not Is_Abstract_Type
(Find_Dispatching_Type
(Old_S
)))
2559 ("renamed entity cannot be "
2560 & "subprogram that requires overriding (RM 8.5.4 (5.1))", N
);
2564 if Old_S
/= Any_Id
then
2565 if Is_Actual
and then From_Default
(N
) then
2567 -- This is an implicit reference to the default actual
2569 Generate_Reference
(Old_S
, Nam
, Typ
=> 'i', Force
=> True);
2572 Generate_Reference
(Old_S
, Nam
);
2575 -- For a renaming-as-body, require subtype conformance, but if the
2576 -- declaration being completed has not been frozen, then inherit the
2577 -- convention of the renamed subprogram prior to checking conformance
2578 -- (unless the renaming has an explicit convention established; the
2579 -- rule stated in the RM doesn't seem to address this ???).
2581 if Present
(Rename_Spec
) then
2582 Generate_Reference
(Rename_Spec
, Defining_Entity
(Spec
), 'b');
2583 Style
.Check_Identifier
(Defining_Entity
(Spec
), Rename_Spec
);
2585 if not Is_Frozen
(Rename_Spec
) then
2586 if not Has_Convention_Pragma
(Rename_Spec
) then
2587 Set_Convention
(New_S
, Convention
(Old_S
));
2590 if Ekind
(Old_S
) /= E_Operator
then
2591 Check_Mode_Conformant
(New_S
, Old_S
, Spec
);
2594 if Original_Subprogram
(Old_S
) = Rename_Spec
then
2595 Error_Msg_N
("unfrozen subprogram cannot rename itself ", N
);
2598 Check_Subtype_Conformant
(New_S
, Old_S
, Spec
);
2601 Check_Frozen_Renaming
(N
, Rename_Spec
);
2603 -- Check explicitly that renamed entity is not intrinsic, because
2604 -- in a generic the renamed body is not built. In this case,
2605 -- the renaming_as_body is a completion.
2607 if Inside_A_Generic
then
2608 if Is_Frozen
(Rename_Spec
)
2609 and then Is_Intrinsic_Subprogram
(Old_S
)
2612 ("subprogram in renaming_as_body cannot be intrinsic",
2616 Set_Has_Completion
(Rename_Spec
);
2619 elsif Ekind
(Old_S
) /= E_Operator
then
2621 -- If this a defaulted subprogram for a class-wide actual there is
2622 -- no check for mode conformance, given that the signatures don't
2623 -- match (the source mentions T but the actual mentions T'Class).
2628 Check_Mode_Conformant
(New_S
, Old_S
);
2632 and then Error_Posted
(New_S
)
2634 Error_Msg_NE
("invalid actual subprogram: & #!", N
, Old_S
);
2638 if No
(Rename_Spec
) then
2640 -- The parameter profile of the new entity is that of the renamed
2641 -- entity: the subtypes given in the specification are irrelevant.
2643 Inherit_Renamed_Profile
(New_S
, Old_S
);
2645 -- A call to the subprogram is transformed into a call to the
2646 -- renamed entity. This is transitive if the renamed entity is
2647 -- itself a renaming.
2649 if Present
(Alias
(Old_S
)) then
2650 Set_Alias
(New_S
, Alias
(Old_S
));
2652 Set_Alias
(New_S
, Old_S
);
2655 -- Note that we do not set Is_Intrinsic_Subprogram if we have a
2656 -- renaming as body, since the entity in this case is not an
2657 -- intrinsic (it calls an intrinsic, but we have a real body for
2658 -- this call, and it is in this body that the required intrinsic
2659 -- processing will take place).
2661 -- Also, if this is a renaming of inequality, the renamed operator
2662 -- is intrinsic, but what matters is the corresponding equality
2663 -- operator, which may be user-defined.
2665 Set_Is_Intrinsic_Subprogram
2667 Is_Intrinsic_Subprogram
(Old_S
)
2669 (Chars
(Old_S
) /= Name_Op_Ne
2670 or else Ekind
(Old_S
) = E_Operator
2672 Is_Intrinsic_Subprogram
2673 (Corresponding_Equality
(Old_S
))));
2675 if Ekind
(Alias
(New_S
)) = E_Operator
then
2676 Set_Has_Delayed_Freeze
(New_S
, False);
2679 -- If the renaming corresponds to an association for an abstract
2680 -- formal subprogram, then various attributes must be set to
2681 -- indicate that the renaming is an abstract dispatching operation
2682 -- with a controlling type.
2684 if Is_Actual
and then Is_Abstract_Subprogram
(Formal_Spec
) then
2686 -- Mark the renaming as abstract here, so Find_Dispatching_Type
2687 -- see it as corresponding to a generic association for a
2688 -- formal abstract subprogram
2690 Set_Is_Abstract_Subprogram
(New_S
);
2693 New_S_Ctrl_Type
: constant Entity_Id
:=
2694 Find_Dispatching_Type
(New_S
);
2695 Old_S_Ctrl_Type
: constant Entity_Id
:=
2696 Find_Dispatching_Type
(Old_S
);
2699 if Old_S_Ctrl_Type
/= New_S_Ctrl_Type
then
2701 ("actual must be dispatching subprogram for type&",
2702 Nam
, New_S_Ctrl_Type
);
2705 Set_Is_Dispatching_Operation
(New_S
);
2706 Check_Controlling_Formals
(New_S_Ctrl_Type
, New_S
);
2708 -- If the actual in the formal subprogram is itself a
2709 -- formal abstract subprogram association, there's no
2710 -- dispatch table component or position to inherit.
2712 if Present
(DTC_Entity
(Old_S
)) then
2713 Set_DTC_Entity
(New_S
, DTC_Entity
(Old_S
));
2714 Set_DT_Position
(New_S
, DT_Position
(Old_S
));
2722 and then (Old_S
= New_S
2724 (Nkind
(Nam
) /= N_Expanded_Name
2725 and then Chars
(Old_S
) = Chars
(New_S
))
2727 (Nkind
(Nam
) = N_Expanded_Name
2728 and then Entity
(Prefix
(Nam
)) = Current_Scope
2730 Chars
(Selector_Name
(Nam
)) = Chars
(New_S
)))
2732 Error_Msg_N
("subprogram cannot rename itself", N
);
2735 Set_Convention
(New_S
, Convention
(Old_S
));
2737 if Is_Abstract_Subprogram
(Old_S
) then
2738 if Present
(Rename_Spec
) then
2740 ("a renaming-as-body cannot rename an abstract subprogram",
2742 Set_Has_Completion
(Rename_Spec
);
2744 Set_Is_Abstract_Subprogram
(New_S
);
2748 Check_Library_Unit_Renaming
(N
, Old_S
);
2750 -- Pathological case: procedure renames entry in the scope of its
2751 -- task. Entry is given by simple name, but body must be built for
2752 -- procedure. Of course if called it will deadlock.
2754 if Ekind
(Old_S
) = E_Entry
then
2755 Set_Has_Completion
(New_S
, False);
2756 Set_Alias
(New_S
, Empty
);
2760 Freeze_Before
(N
, Old_S
);
2761 Freeze_Actual_Profile
;
2762 Set_Has_Delayed_Freeze
(New_S
, False);
2763 Freeze_Before
(N
, New_S
);
2765 -- An abstract subprogram is only allowed as an actual in the case
2766 -- where the formal subprogram is also abstract.
2768 if (Ekind
(Old_S
) = E_Procedure
or else Ekind
(Old_S
) = E_Function
)
2769 and then Is_Abstract_Subprogram
(Old_S
)
2770 and then not Is_Abstract_Subprogram
(Formal_Spec
)
2773 ("abstract subprogram not allowed as generic actual", Nam
);
2778 -- A common error is to assume that implicit operators for types are
2779 -- defined in Standard, or in the scope of a subtype. In those cases
2780 -- where the renamed entity is given with an expanded name, it is
2781 -- worth mentioning that operators for the type are not declared in
2782 -- the scope given by the prefix.
2784 if Nkind
(Nam
) = N_Expanded_Name
2785 and then Nkind
(Selector_Name
(Nam
)) = N_Operator_Symbol
2786 and then Scope
(Entity
(Nam
)) = Standard_Standard
2789 T
: constant Entity_Id
:=
2790 Base_Type
(Etype
(First_Formal
(New_S
)));
2792 Error_Msg_Node_2
:= Prefix
(Nam
);
2794 ("operator for type& is not declared in&", Prefix
(Nam
), T
);
2799 ("no visible subprogram matches the specification for&",
2803 if Present
(Candidate_Renaming
) then
2810 F1
:= First_Formal
(Candidate_Renaming
);
2811 F2
:= First_Formal
(New_S
);
2812 T1
:= First_Subtype
(Etype
(F1
));
2814 while Present
(F1
) and then Present
(F2
) loop
2819 if Present
(F1
) and then Present
(Default_Value
(F1
)) then
2820 if Present
(Next_Formal
(F1
)) then
2822 ("\missing specification for &" &
2823 " and other formals with defaults", Spec
, F1
);
2826 ("\missing specification for &", Spec
, F1
);
2830 if Nkind
(Nam
) = N_Operator_Symbol
2831 and then From_Default
(N
)
2833 Error_Msg_Node_2
:= T1
;
2835 ("default & on & is not directly visible",
2842 -- Ada 2005 AI 404: if the new subprogram is dispatching, verify that
2843 -- controlling access parameters are known non-null for the renamed
2844 -- subprogram. Test also applies to a subprogram instantiation that
2845 -- is dispatching. Test is skipped if some previous error was detected
2846 -- that set Old_S to Any_Id.
2848 if Ada_Version
>= Ada_2005
2849 and then Old_S
/= Any_Id
2850 and then not Is_Dispatching_Operation
(Old_S
)
2851 and then Is_Dispatching_Operation
(New_S
)
2858 Old_F
:= First_Formal
(Old_S
);
2859 New_F
:= First_Formal
(New_S
);
2860 while Present
(Old_F
) loop
2861 if Ekind
(Etype
(Old_F
)) = E_Anonymous_Access_Type
2862 and then Is_Controlling_Formal
(New_F
)
2863 and then not Can_Never_Be_Null
(Old_F
)
2865 Error_Msg_N
("access parameter is controlling,", New_F
);
2867 ("\corresponding parameter of& "
2868 & "must be explicitly null excluding", New_F
, Old_S
);
2871 Next_Formal
(Old_F
);
2872 Next_Formal
(New_F
);
2877 -- A useful warning, suggested by Ada Bug Finder (Ada-Europe 2005)
2878 -- is to warn if an operator is being renamed as a different operator.
2879 -- If the operator is predefined, examine the kind of the entity, not
2880 -- the abbreviated declaration in Standard.
2882 if Comes_From_Source
(N
)
2883 and then Present
(Old_S
)
2885 (Nkind
(Old_S
) = N_Defining_Operator_Symbol
2886 or else Ekind
(Old_S
) = E_Operator
)
2887 and then Nkind
(New_S
) = N_Defining_Operator_Symbol
2888 and then Chars
(Old_S
) /= Chars
(New_S
)
2891 ("?& is being renamed as a different operator", N
, Old_S
);
2894 -- Check for renaming of obsolescent subprogram
2896 Check_Obsolescent_2005_Entity
(Entity
(Nam
), Nam
);
2898 -- Another warning or some utility: if the new subprogram as the same
2899 -- name as the old one, the old one is not hidden by an outer homograph,
2900 -- the new one is not a public symbol, and the old one is otherwise
2901 -- directly visible, the renaming is superfluous.
2903 if Chars
(Old_S
) = Chars
(New_S
)
2904 and then Comes_From_Source
(N
)
2905 and then Scope
(Old_S
) /= Standard_Standard
2906 and then Warn_On_Redundant_Constructs
2908 (Is_Immediately_Visible
(Old_S
)
2909 or else Is_Potentially_Use_Visible
(Old_S
))
2910 and then Is_Overloadable
(Current_Scope
)
2911 and then Chars
(Current_Scope
) /= Chars
(Old_S
)
2914 ("?redundant renaming, entity is directly visible", Name
(N
));
2917 -- Implementation-defined aspect specifications can appear in a renaming
2918 -- declaration, but not language-defined ones. The call to procedure
2919 -- Analyze_Aspect_Specifications will take care of this error check.
2921 if Has_Aspects
(N
) then
2922 Analyze_Aspect_Specifications
(N
, New_S
);
2925 Ada_Version
:= Save_AV
;
2926 Ada_Version_Explicit
:= Save_AV_Exp
;
2927 end Analyze_Subprogram_Renaming
;
2929 -------------------------
2930 -- Analyze_Use_Package --
2931 -------------------------
2933 -- Resolve the package names in the use clause, and make all the visible
2934 -- entities defined in the package potentially use-visible. If the package
2935 -- is already in use from a previous use clause, its visible entities are
2936 -- already use-visible. In that case, mark the occurrence as a redundant
2937 -- use. If the package is an open scope, i.e. if the use clause occurs
2938 -- within the package itself, ignore it.
2940 procedure Analyze_Use_Package
(N
: Node_Id
) is
2941 Pack_Name
: Node_Id
;
2944 -- Start of processing for Analyze_Use_Package
2947 Check_SPARK_Restriction
("use clause is not allowed", N
);
2949 Set_Hidden_By_Use_Clause
(N
, No_Elist
);
2951 -- Use clause not allowed in a spec of a predefined package declaration
2952 -- except that packages whose file name starts a-n are OK (these are
2953 -- children of Ada.Numerics, which are never loaded by Rtsfind).
2955 if Is_Predefined_File_Name
(Unit_File_Name
(Current_Sem_Unit
))
2956 and then Name_Buffer
(1 .. 3) /= "a-n"
2958 Nkind
(Unit
(Cunit
(Current_Sem_Unit
))) = N_Package_Declaration
2960 Error_Msg_N
("use clause not allowed in predefined spec", N
);
2963 -- Chain clause to list of use clauses in current scope
2965 if Nkind
(Parent
(N
)) /= N_Compilation_Unit
then
2966 Chain_Use_Clause
(N
);
2969 -- Loop through package names to identify referenced packages
2971 Pack_Name
:= First
(Names
(N
));
2972 while Present
(Pack_Name
) loop
2973 Analyze
(Pack_Name
);
2975 if Nkind
(Parent
(N
)) = N_Compilation_Unit
2976 and then Nkind
(Pack_Name
) = N_Expanded_Name
2982 Pref
:= Prefix
(Pack_Name
);
2983 while Nkind
(Pref
) = N_Expanded_Name
loop
2984 Pref
:= Prefix
(Pref
);
2987 if Entity
(Pref
) = Standard_Standard
then
2989 ("predefined package Standard cannot appear"
2990 & " in a context clause", Pref
);
2998 -- Loop through package names to mark all entities as potentially
3001 Pack_Name
:= First
(Names
(N
));
3002 while Present
(Pack_Name
) loop
3003 if Is_Entity_Name
(Pack_Name
) then
3004 Pack
:= Entity
(Pack_Name
);
3006 if Ekind
(Pack
) /= E_Package
3007 and then Etype
(Pack
) /= Any_Type
3009 if Ekind
(Pack
) = E_Generic_Package
then
3010 Error_Msg_N
-- CODEFIX
3011 ("a generic package is not allowed in a use clause",
3014 Error_Msg_N
("& is not a usable package", Pack_Name
);
3018 if Nkind
(Parent
(N
)) = N_Compilation_Unit
then
3019 Check_In_Previous_With_Clause
(N
, Pack_Name
);
3022 if Applicable_Use
(Pack_Name
) then
3023 Use_One_Package
(Pack
, N
);
3027 -- Report error because name denotes something other than a package
3030 Error_Msg_N
("& is not a package", Pack_Name
);
3035 end Analyze_Use_Package
;
3037 ----------------------
3038 -- Analyze_Use_Type --
3039 ----------------------
3041 procedure Analyze_Use_Type
(N
: Node_Id
) is
3046 Set_Hidden_By_Use_Clause
(N
, No_Elist
);
3048 -- Chain clause to list of use clauses in current scope
3050 if Nkind
(Parent
(N
)) /= N_Compilation_Unit
then
3051 Chain_Use_Clause
(N
);
3054 -- If the Used_Operations list is already initialized, the clause has
3055 -- been analyzed previously, and it is begin reinstalled, for example
3056 -- when the clause appears in a package spec and we are compiling the
3057 -- corresponding package body. In that case, make the entities on the
3058 -- existing list use_visible, and mark the corresponding types In_Use.
3060 if Present
(Used_Operations
(N
)) then
3066 Mark
:= First
(Subtype_Marks
(N
));
3067 while Present
(Mark
) loop
3068 Use_One_Type
(Mark
, Installed
=> True);
3072 Elmt
:= First_Elmt
(Used_Operations
(N
));
3073 while Present
(Elmt
) loop
3074 Set_Is_Potentially_Use_Visible
(Node
(Elmt
));
3082 -- Otherwise, create new list and attach to it the operations that
3083 -- are made use-visible by the clause.
3085 Set_Used_Operations
(N
, New_Elmt_List
);
3086 Id
:= First
(Subtype_Marks
(N
));
3087 while Present
(Id
) loop
3091 if E
/= Any_Type
then
3094 if Nkind
(Parent
(N
)) = N_Compilation_Unit
then
3095 if Nkind
(Id
) = N_Identifier
then
3096 Error_Msg_N
("type is not directly visible", Id
);
3098 elsif Is_Child_Unit
(Scope
(E
))
3099 and then Scope
(E
) /= System_Aux_Id
3101 Check_In_Previous_With_Clause
(N
, Prefix
(Id
));
3106 -- If the use_type_clause appears in a compilation unit context,
3107 -- check whether it comes from a unit that may appear in a
3108 -- limited_with_clause, for a better error message.
3110 if Nkind
(Parent
(N
)) = N_Compilation_Unit
3111 and then Nkind
(Id
) /= N_Identifier
3117 function Mentioned
(Nam
: Node_Id
) return Boolean;
3118 -- Check whether the prefix of expanded name for the type
3119 -- appears in the prefix of some limited_with_clause.
3125 function Mentioned
(Nam
: Node_Id
) return Boolean is
3127 return Nkind
(Name
(Item
)) = N_Selected_Component
3129 Chars
(Prefix
(Name
(Item
))) = Chars
(Nam
);
3133 Pref
:= Prefix
(Id
);
3134 Item
:= First
(Context_Items
(Parent
(N
)));
3136 while Present
(Item
) and then Item
/= N
loop
3137 if Nkind
(Item
) = N_With_Clause
3138 and then Limited_Present
(Item
)
3139 and then Mentioned
(Pref
)
3142 (Get_Msg_Id
, "premature usage of incomplete type");
3153 end Analyze_Use_Type
;
3155 --------------------
3156 -- Applicable_Use --
3157 --------------------
3159 function Applicable_Use
(Pack_Name
: Node_Id
) return Boolean is
3160 Pack
: constant Entity_Id
:= Entity
(Pack_Name
);
3163 if In_Open_Scopes
(Pack
) then
3164 if Warn_On_Redundant_Constructs
3165 and then Pack
= Current_Scope
3167 Error_Msg_NE
-- CODEFIX
3168 ("& is already use-visible within itself?", Pack_Name
, Pack
);
3173 elsif In_Use
(Pack
) then
3174 Note_Redundant_Use
(Pack_Name
);
3177 elsif Present
(Renamed_Object
(Pack
))
3178 and then In_Use
(Renamed_Object
(Pack
))
3180 Note_Redundant_Use
(Pack_Name
);
3188 ------------------------
3189 -- Attribute_Renaming --
3190 ------------------------
3192 procedure Attribute_Renaming
(N
: Node_Id
) is
3193 Loc
: constant Source_Ptr
:= Sloc
(N
);
3194 Nam
: constant Node_Id
:= Name
(N
);
3195 Spec
: constant Node_Id
:= Specification
(N
);
3196 New_S
: constant Entity_Id
:= Defining_Unit_Name
(Spec
);
3197 Aname
: constant Name_Id
:= Attribute_Name
(Nam
);
3199 Form_Num
: Nat
:= 0;
3200 Expr_List
: List_Id
:= No_List
;
3202 Attr_Node
: Node_Id
;
3203 Body_Node
: Node_Id
;
3204 Param_Spec
: Node_Id
;
3207 Generate_Definition
(New_S
);
3209 -- This procedure is called in the context of subprogram renaming, and
3210 -- thus the attribute must be one that is a subprogram. All of those
3211 -- have at least one formal parameter, with the singular exception of
3212 -- AST_Entry (which is a real oddity, it is odd that this can be renamed
3215 if not Is_Non_Empty_List
(Parameter_Specifications
(Spec
)) then
3216 if Aname
/= Name_AST_Entry
then
3218 ("subprogram renaming an attribute must have formals", N
);
3223 Param_Spec
:= First
(Parameter_Specifications
(Spec
));
3224 while Present
(Param_Spec
) loop
3225 Form_Num
:= Form_Num
+ 1;
3227 if Nkind
(Parameter_Type
(Param_Spec
)) /= N_Access_Definition
then
3228 Find_Type
(Parameter_Type
(Param_Spec
));
3230 -- The profile of the new entity denotes the base type (s) of
3231 -- the types given in the specification. For access parameters
3232 -- there are no subtypes involved.
3234 Rewrite
(Parameter_Type
(Param_Spec
),
3236 (Base_Type
(Entity
(Parameter_Type
(Param_Spec
))), Loc
));
3239 if No
(Expr_List
) then
3240 Expr_List
:= New_List
;
3243 Append_To
(Expr_List
,
3244 Make_Identifier
(Loc
,
3245 Chars
=> Chars
(Defining_Identifier
(Param_Spec
))));
3247 -- The expressions in the attribute reference are not freeze
3248 -- points. Neither is the attribute as a whole, see below.
3250 Set_Must_Not_Freeze
(Last
(Expr_List
));
3255 -- Immediate error if too many formals. Other mismatches in number or
3256 -- types of parameters are detected when we analyze the body of the
3257 -- subprogram that we construct.
3259 if Form_Num
> 2 then
3260 Error_Msg_N
("too many formals for attribute", N
);
3262 -- Error if the attribute reference has expressions that look like
3263 -- formal parameters.
3265 elsif Present
(Expressions
(Nam
)) then
3266 Error_Msg_N
("illegal expressions in attribute reference", Nam
);
3269 Aname
= Name_Compose
or else
3270 Aname
= Name_Exponent
or else
3271 Aname
= Name_Leading_Part
or else
3272 Aname
= Name_Pos
or else
3273 Aname
= Name_Round
or else
3274 Aname
= Name_Scaling
or else
3277 if Nkind
(N
) = N_Subprogram_Renaming_Declaration
3278 and then Present
(Corresponding_Formal_Spec
(N
))
3281 ("generic actual cannot be attribute involving universal type",
3285 ("attribute involving a universal type cannot be renamed",
3290 -- AST_Entry is an odd case. It doesn't really make much sense to allow
3291 -- it to be renamed, but that's the DEC rule, so we have to do it right.
3292 -- The point is that the AST_Entry call should be made now, and what the
3293 -- function will return is the returned value.
3295 -- Note that there is no Expr_List in this case anyway
3297 if Aname
= Name_AST_Entry
then
3299 Ent
: constant Entity_Id
:= Make_Temporary
(Loc
, 'R', Nam
);
3304 Make_Object_Declaration
(Loc
,
3305 Defining_Identifier
=> Ent
,
3306 Object_Definition
=>
3307 New_Occurrence_Of
(RTE
(RE_AST_Handler
), Loc
),
3309 Constant_Present
=> True);
3311 Set_Assignment_OK
(Decl
, True);
3312 Insert_Action
(N
, Decl
);
3313 Attr_Node
:= Make_Identifier
(Loc
, Chars
(Ent
));
3316 -- For all other attributes, we rewrite the attribute node to have
3317 -- a list of expressions corresponding to the subprogram formals.
3318 -- A renaming declaration is not a freeze point, and the analysis of
3319 -- the attribute reference should not freeze the type of the prefix.
3323 Make_Attribute_Reference
(Loc
,
3324 Prefix
=> Prefix
(Nam
),
3325 Attribute_Name
=> Aname
,
3326 Expressions
=> Expr_List
);
3328 Set_Must_Not_Freeze
(Attr_Node
);
3329 Set_Must_Not_Freeze
(Prefix
(Nam
));
3332 -- Case of renaming a function
3334 if Nkind
(Spec
) = N_Function_Specification
then
3335 if Is_Procedure_Attribute_Name
(Aname
) then
3336 Error_Msg_N
("attribute can only be renamed as procedure", Nam
);
3340 Find_Type
(Result_Definition
(Spec
));
3341 Rewrite
(Result_Definition
(Spec
),
3343 Base_Type
(Entity
(Result_Definition
(Spec
))), Loc
));
3346 Make_Subprogram_Body
(Loc
,
3347 Specification
=> Spec
,
3348 Declarations
=> New_List
,
3349 Handled_Statement_Sequence
=>
3350 Make_Handled_Sequence_Of_Statements
(Loc
,
3351 Statements
=> New_List
(
3352 Make_Simple_Return_Statement
(Loc
,
3353 Expression
=> Attr_Node
))));
3355 -- Case of renaming a procedure
3358 if not Is_Procedure_Attribute_Name
(Aname
) then
3359 Error_Msg_N
("attribute can only be renamed as function", Nam
);
3364 Make_Subprogram_Body
(Loc
,
3365 Specification
=> Spec
,
3366 Declarations
=> New_List
,
3367 Handled_Statement_Sequence
=>
3368 Make_Handled_Sequence_Of_Statements
(Loc
,
3369 Statements
=> New_List
(Attr_Node
)));
3372 -- In case of tagged types we add the body of the generated function to
3373 -- the freezing actions of the type (because in the general case such
3374 -- type is still not frozen). We exclude from this processing generic
3375 -- formal subprograms found in instantiations and AST_Entry renamings.
3377 -- We must exclude VM targets and restricted run-time libraries because
3378 -- entity AST_Handler is defined in package System.Aux_Dec which is not
3379 -- available in those platforms. Note that we cannot use the function
3380 -- Restricted_Profile (instead of Configurable_Run_Time_Mode) because
3381 -- the ZFP run-time library is not defined as a profile, and we do not
3382 -- want to deal with AST_Handler in ZFP mode.
3384 if VM_Target
= No_VM
3385 and then not Configurable_Run_Time_Mode
3386 and then not Present
(Corresponding_Formal_Spec
(N
))
3387 and then Etype
(Nam
) /= RTE
(RE_AST_Handler
)
3390 P
: constant Entity_Id
:= Prefix
(Nam
);
3395 if Is_Tagged_Type
(Etype
(P
)) then
3396 Ensure_Freeze_Node
(Etype
(P
));
3397 Append_Freeze_Action
(Etype
(P
), Body_Node
);
3399 Rewrite
(N
, Body_Node
);
3401 Set_Etype
(New_S
, Base_Type
(Etype
(New_S
)));
3405 -- Generic formal subprograms or AST_Handler renaming
3408 Rewrite
(N
, Body_Node
);
3410 Set_Etype
(New_S
, Base_Type
(Etype
(New_S
)));
3413 if Is_Compilation_Unit
(New_S
) then
3415 ("a library unit can only rename another library unit", N
);
3418 -- We suppress elaboration warnings for the resulting entity, since
3419 -- clearly they are not needed, and more particularly, in the case
3420 -- of a generic formal subprogram, the resulting entity can appear
3421 -- after the instantiation itself, and thus look like a bogus case
3422 -- of access before elaboration.
3424 Set_Suppress_Elaboration_Warnings
(New_S
);
3426 end Attribute_Renaming
;
3428 ----------------------
3429 -- Chain_Use_Clause --
3430 ----------------------
3432 procedure Chain_Use_Clause
(N
: Node_Id
) is
3434 Level
: Int
:= Scope_Stack
.Last
;
3437 if not Is_Compilation_Unit
(Current_Scope
)
3438 or else not Is_Child_Unit
(Current_Scope
)
3440 null; -- Common case
3442 elsif Defining_Entity
(Parent
(N
)) = Current_Scope
then
3443 null; -- Common case for compilation unit
3446 -- If declaration appears in some other scope, it must be in some
3447 -- parent unit when compiling a child.
3449 Pack
:= Defining_Entity
(Parent
(N
));
3450 if not In_Open_Scopes
(Pack
) then
3451 null; -- default as well
3454 -- Find entry for parent unit in scope stack
3456 while Scope_Stack
.Table
(Level
).Entity
/= Pack
loop
3462 Set_Next_Use_Clause
(N
,
3463 Scope_Stack
.Table
(Level
).First_Use_Clause
);
3464 Scope_Stack
.Table
(Level
).First_Use_Clause
:= N
;
3465 end Chain_Use_Clause
;
3467 ---------------------------
3468 -- Check_Frozen_Renaming --
3469 ---------------------------
3471 procedure Check_Frozen_Renaming
(N
: Node_Id
; Subp
: Entity_Id
) is
3477 and then not Has_Completion
(Subp
)
3481 (Parent
(Declaration_Node
(Subp
)), Defining_Entity
(N
));
3483 if Is_Entity_Name
(Name
(N
)) then
3484 Old_S
:= Entity
(Name
(N
));
3486 if not Is_Frozen
(Old_S
)
3487 and then Operating_Mode
/= Check_Semantics
3489 Append_Freeze_Action
(Old_S
, B_Node
);
3491 Insert_After
(N
, B_Node
);
3495 if Is_Intrinsic_Subprogram
(Old_S
)
3496 and then not In_Instance
3499 ("subprogram used in renaming_as_body cannot be intrinsic",
3504 Insert_After
(N
, B_Node
);
3508 end Check_Frozen_Renaming
;
3510 -------------------------------
3511 -- Set_Entity_Or_Discriminal --
3512 -------------------------------
3514 procedure Set_Entity_Or_Discriminal
(N
: Node_Id
; E
: Entity_Id
) is
3518 -- If the entity is not a discriminant, or else expansion is disabled,
3519 -- simply set the entity.
3521 if not In_Spec_Expression
3522 or else Ekind
(E
) /= E_Discriminant
3523 or else Inside_A_Generic
3525 Set_Entity_With_Style_Check
(N
, E
);
3527 -- The replacement of a discriminant by the corresponding discriminal
3528 -- is not done for a task discriminant that appears in a default
3529 -- expression of an entry parameter. See Exp_Ch2.Expand_Discriminant
3530 -- for details on their handling.
3532 elsif Is_Concurrent_Type
(Scope
(E
)) then
3536 and then not Nkind_In
(P
, N_Parameter_Specification
,
3537 N_Component_Declaration
)
3543 and then Nkind
(P
) = N_Parameter_Specification
3548 Set_Entity
(N
, Discriminal
(E
));
3551 -- Otherwise, this is a discriminant in a context in which
3552 -- it is a reference to the corresponding parameter of the
3553 -- init proc for the enclosing type.
3556 Set_Entity
(N
, Discriminal
(E
));
3558 end Set_Entity_Or_Discriminal
;
3560 -----------------------------------
3561 -- Check_In_Previous_With_Clause --
3562 -----------------------------------
3564 procedure Check_In_Previous_With_Clause
3568 Pack
: constant Entity_Id
:= Entity
(Original_Node
(Nam
));
3573 Item
:= First
(Context_Items
(Parent
(N
)));
3575 while Present
(Item
)
3578 if Nkind
(Item
) = N_With_Clause
3580 -- Protect the frontend against previous critical errors
3582 and then Nkind
(Name
(Item
)) /= N_Selected_Component
3583 and then Entity
(Name
(Item
)) = Pack
3587 -- Find root library unit in with_clause
3589 while Nkind
(Par
) = N_Expanded_Name
loop
3590 Par
:= Prefix
(Par
);
3593 if Is_Child_Unit
(Entity
(Original_Node
(Par
))) then
3594 Error_Msg_NE
("& is not directly visible", Par
, Entity
(Par
));
3603 -- On exit, package is not mentioned in a previous with_clause.
3604 -- Check if its prefix is.
3606 if Nkind
(Nam
) = N_Expanded_Name
then
3607 Check_In_Previous_With_Clause
(N
, Prefix
(Nam
));
3609 elsif Pack
/= Any_Id
then
3610 Error_Msg_NE
("& is not visible", Nam
, Pack
);
3612 end Check_In_Previous_With_Clause
;
3614 ---------------------------------
3615 -- Check_Library_Unit_Renaming --
3616 ---------------------------------
3618 procedure Check_Library_Unit_Renaming
(N
: Node_Id
; Old_E
: Entity_Id
) is
3622 if Nkind
(Parent
(N
)) /= N_Compilation_Unit
then
3625 -- Check for library unit. Note that we used to check for the scope
3626 -- being Standard here, but that was wrong for Standard itself.
3628 elsif not Is_Compilation_Unit
(Old_E
)
3629 and then not Is_Child_Unit
(Old_E
)
3631 Error_Msg_N
("renamed unit must be a library unit", Name
(N
));
3633 -- Entities defined in Standard (operators and boolean literals) cannot
3634 -- be renamed as library units.
3636 elsif Scope
(Old_E
) = Standard_Standard
3637 and then Sloc
(Old_E
) = Standard_Location
3639 Error_Msg_N
("renamed unit must be a library unit", Name
(N
));
3641 elsif Present
(Parent_Spec
(N
))
3642 and then Nkind
(Unit
(Parent_Spec
(N
))) = N_Generic_Package_Declaration
3643 and then not Is_Child_Unit
(Old_E
)
3646 ("renamed unit must be a child unit of generic parent", Name
(N
));
3648 elsif Nkind
(N
) in N_Generic_Renaming_Declaration
3649 and then Nkind
(Name
(N
)) = N_Expanded_Name
3650 and then Is_Generic_Instance
(Entity
(Prefix
(Name
(N
))))
3651 and then Is_Generic_Unit
(Old_E
)
3654 ("renamed generic unit must be a library unit", Name
(N
));
3656 elsif Is_Package_Or_Generic_Package
(Old_E
) then
3658 -- Inherit categorization flags
3660 New_E
:= Defining_Entity
(N
);
3661 Set_Is_Pure
(New_E
, Is_Pure
(Old_E
));
3662 Set_Is_Preelaborated
(New_E
, Is_Preelaborated
(Old_E
));
3663 Set_Is_Remote_Call_Interface
(New_E
,
3664 Is_Remote_Call_Interface
(Old_E
));
3665 Set_Is_Remote_Types
(New_E
, Is_Remote_Types
(Old_E
));
3666 Set_Is_Shared_Passive
(New_E
, Is_Shared_Passive
(Old_E
));
3668 end Check_Library_Unit_Renaming
;
3674 procedure End_Scope
is
3680 Id
:= First_Entity
(Current_Scope
);
3681 while Present
(Id
) loop
3682 -- An entity in the current scope is not necessarily the first one
3683 -- on its homonym chain. Find its predecessor if any,
3684 -- If it is an internal entity, it will not be in the visibility
3685 -- chain altogether, and there is nothing to unchain.
3687 if Id
/= Current_Entity
(Id
) then
3688 Prev
:= Current_Entity
(Id
);
3689 while Present
(Prev
)
3690 and then Present
(Homonym
(Prev
))
3691 and then Homonym
(Prev
) /= Id
3693 Prev
:= Homonym
(Prev
);
3696 -- Skip to end of loop if Id is not in the visibility chain
3698 if No
(Prev
) or else Homonym
(Prev
) /= Id
then
3706 Set_Is_Immediately_Visible
(Id
, False);
3708 Outer
:= Homonym
(Id
);
3709 while Present
(Outer
) and then Scope
(Outer
) = Current_Scope
loop
3710 Outer
:= Homonym
(Outer
);
3713 -- Reset homonym link of other entities, but do not modify link
3714 -- between entities in current scope, so that the back-end can have
3715 -- a proper count of local overloadings.
3718 Set_Name_Entity_Id
(Chars
(Id
), Outer
);
3720 elsif Scope
(Prev
) /= Scope
(Id
) then
3721 Set_Homonym
(Prev
, Outer
);
3728 -- If the scope generated freeze actions, place them before the
3729 -- current declaration and analyze them. Type declarations and
3730 -- the bodies of initialization procedures can generate such nodes.
3731 -- We follow the parent chain until we reach a list node, which is
3732 -- the enclosing list of declarations. If the list appears within
3733 -- a protected definition, move freeze nodes outside the protected
3737 (Scope_Stack
.Table
(Scope_Stack
.Last
).Pending_Freeze_Actions
)
3741 L
: constant List_Id
:= Scope_Stack
.Table
3742 (Scope_Stack
.Last
).Pending_Freeze_Actions
;
3745 if Is_Itype
(Current_Scope
) then
3746 Decl
:= Associated_Node_For_Itype
(Current_Scope
);
3748 Decl
:= Parent
(Current_Scope
);
3753 while not (Is_List_Member
(Decl
))
3754 or else Nkind_In
(Parent
(Decl
), N_Protected_Definition
,
3757 Decl
:= Parent
(Decl
);
3760 Insert_List_Before_And_Analyze
(Decl
, L
);
3769 ---------------------
3770 -- End_Use_Clauses --
3771 ---------------------
3773 procedure End_Use_Clauses
(Clause
: Node_Id
) is
3777 -- Remove Use_Type clauses first, because they affect the
3778 -- visibility of operators in subsequent used packages.
3781 while Present
(U
) loop
3782 if Nkind
(U
) = N_Use_Type_Clause
then
3786 Next_Use_Clause
(U
);
3790 while Present
(U
) loop
3791 if Nkind
(U
) = N_Use_Package_Clause
then
3792 End_Use_Package
(U
);
3795 Next_Use_Clause
(U
);
3797 end End_Use_Clauses
;
3799 ---------------------
3800 -- End_Use_Package --
3801 ---------------------
3803 procedure End_Use_Package
(N
: Node_Id
) is
3804 Pack_Name
: Node_Id
;
3809 function Is_Primitive_Operator_In_Use
3811 F
: Entity_Id
) return Boolean;
3812 -- Check whether Op is a primitive operator of a use-visible type
3814 ----------------------------------
3815 -- Is_Primitive_Operator_In_Use --
3816 ----------------------------------
3818 function Is_Primitive_Operator_In_Use
3820 F
: Entity_Id
) return Boolean
3822 T
: constant Entity_Id
:= Base_Type
(Etype
(F
));
3824 return In_Use
(T
) and then Scope
(T
) = Scope
(Op
);
3825 end Is_Primitive_Operator_In_Use
;
3827 -- Start of processing for End_Use_Package
3830 Pack_Name
:= First
(Names
(N
));
3831 while Present
(Pack_Name
) loop
3833 -- Test that Pack_Name actually denotes a package before processing
3835 if Is_Entity_Name
(Pack_Name
)
3836 and then Ekind
(Entity
(Pack_Name
)) = E_Package
3838 Pack
:= Entity
(Pack_Name
);
3840 if In_Open_Scopes
(Pack
) then
3843 elsif not Redundant_Use
(Pack_Name
) then
3844 Set_In_Use
(Pack
, False);
3845 Set_Current_Use_Clause
(Pack
, Empty
);
3847 Id
:= First_Entity
(Pack
);
3848 while Present
(Id
) loop
3850 -- Preserve use-visibility of operators that are primitive
3851 -- operators of a type that is use-visible through an active
3854 if Nkind
(Id
) = N_Defining_Operator_Symbol
3856 (Is_Primitive_Operator_In_Use
3857 (Id
, First_Formal
(Id
))
3859 (Present
(Next_Formal
(First_Formal
(Id
)))
3861 Is_Primitive_Operator_In_Use
3862 (Id
, Next_Formal
(First_Formal
(Id
)))))
3867 Set_Is_Potentially_Use_Visible
(Id
, False);
3870 if Is_Private_Type
(Id
)
3871 and then Present
(Full_View
(Id
))
3873 Set_Is_Potentially_Use_Visible
(Full_View
(Id
), False);
3879 if Present
(Renamed_Object
(Pack
)) then
3880 Set_In_Use
(Renamed_Object
(Pack
), False);
3881 Set_Current_Use_Clause
(Renamed_Object
(Pack
), Empty
);
3884 if Chars
(Pack
) = Name_System
3885 and then Scope
(Pack
) = Standard_Standard
3886 and then Present_System_Aux
3888 Id
:= First_Entity
(System_Aux_Id
);
3889 while Present
(Id
) loop
3890 Set_Is_Potentially_Use_Visible
(Id
, False);
3892 if Is_Private_Type
(Id
)
3893 and then Present
(Full_View
(Id
))
3895 Set_Is_Potentially_Use_Visible
(Full_View
(Id
), False);
3901 Set_In_Use
(System_Aux_Id
, False);
3905 Set_Redundant_Use
(Pack_Name
, False);
3912 if Present
(Hidden_By_Use_Clause
(N
)) then
3913 Elmt
:= First_Elmt
(Hidden_By_Use_Clause
(N
));
3914 while Present
(Elmt
) loop
3916 E
: constant Entity_Id
:= Node
(Elmt
);
3919 -- Reset either Use_Visibility or Direct_Visibility, depending
3920 -- on how the entity was hidden by the use clause.
3922 if In_Use
(Scope
(E
))
3923 and then Used_As_Generic_Actual
(Scope
(E
))
3925 Set_Is_Potentially_Use_Visible
(Node
(Elmt
));
3927 Set_Is_Immediately_Visible
(Node
(Elmt
));
3934 Set_Hidden_By_Use_Clause
(N
, No_Elist
);
3936 end End_Use_Package
;
3942 procedure End_Use_Type
(N
: Node_Id
) is
3947 -- Start of processing for End_Use_Type
3950 Id
:= First
(Subtype_Marks
(N
));
3951 while Present
(Id
) loop
3953 -- A call to Rtsfind may occur while analyzing a use_type clause,
3954 -- in which case the type marks are not resolved yet, and there is
3955 -- nothing to remove.
3957 if not Is_Entity_Name
(Id
) or else No
(Entity
(Id
)) then
3963 if T
= Any_Type
or else From_With_Type
(T
) then
3966 -- Note that the use_type clause may mention a subtype of the type
3967 -- whose primitive operations have been made visible. Here as
3968 -- elsewhere, it is the base type that matters for visibility.
3970 elsif In_Open_Scopes
(Scope
(Base_Type
(T
))) then
3973 elsif not Redundant_Use
(Id
) then
3974 Set_In_Use
(T
, False);
3975 Set_In_Use
(Base_Type
(T
), False);
3976 Set_Current_Use_Clause
(T
, Empty
);
3977 Set_Current_Use_Clause
(Base_Type
(T
), Empty
);
3984 if Is_Empty_Elmt_List
(Used_Operations
(N
)) then
3988 Elmt
:= First_Elmt
(Used_Operations
(N
));
3989 while Present
(Elmt
) loop
3990 Set_Is_Potentially_Use_Visible
(Node
(Elmt
), False);
3996 ----------------------
3997 -- Find_Direct_Name --
3998 ----------------------
4000 procedure Find_Direct_Name
(N
: Node_Id
) is
4005 Inst
: Entity_Id
:= Empty
;
4006 -- Enclosing instance, if any
4008 Homonyms
: Entity_Id
;
4009 -- Saves start of homonym chain
4011 Nvis_Entity
: Boolean;
4012 -- Set True to indicate that there is at least one entity on the homonym
4013 -- chain which, while not visible, is visible enough from the user point
4014 -- of view to warrant an error message of "not visible" rather than
4017 Nvis_Is_Private_Subprg
: Boolean := False;
4018 -- Ada 2005 (AI-262): Set True to indicate that a form of Beaujolais
4019 -- effect concerning library subprograms has been detected. Used to
4020 -- generate the precise error message.
4022 function From_Actual_Package
(E
: Entity_Id
) return Boolean;
4023 -- Returns true if the entity is declared in a package that is
4024 -- an actual for a formal package of the current instance. Such an
4025 -- entity requires special handling because it may be use-visible
4026 -- but hides directly visible entities defined outside the instance.
4028 function Is_Actual_Parameter
return Boolean;
4029 -- This function checks if the node N is an identifier that is an actual
4030 -- parameter of a procedure call. If so it returns True, otherwise it
4031 -- return False. The reason for this check is that at this stage we do
4032 -- not know what procedure is being called if the procedure might be
4033 -- overloaded, so it is premature to go setting referenced flags or
4034 -- making calls to Generate_Reference. We will wait till Resolve_Actuals
4035 -- for that processing
4037 function Known_But_Invisible
(E
: Entity_Id
) return Boolean;
4038 -- This function determines whether the entity E (which is not
4039 -- visible) can reasonably be considered to be known to the writer
4040 -- of the reference. This is a heuristic test, used only for the
4041 -- purposes of figuring out whether we prefer to complain that an
4042 -- entity is undefined or invisible (and identify the declaration
4043 -- of the invisible entity in the latter case). The point here is
4044 -- that we don't want to complain that something is invisible and
4045 -- then point to something entirely mysterious to the writer.
4047 procedure Nvis_Messages
;
4048 -- Called if there are no visible entries for N, but there is at least
4049 -- one non-directly visible, or hidden declaration. This procedure
4050 -- outputs an appropriate set of error messages.
4052 procedure Undefined
(Nvis
: Boolean);
4053 -- This function is called if the current node has no corresponding
4054 -- visible entity or entities. The value set in Msg indicates whether
4055 -- an error message was generated (multiple error messages for the
4056 -- same variable are generally suppressed, see body for details).
4057 -- Msg is True if an error message was generated, False if not. This
4058 -- value is used by the caller to determine whether or not to output
4059 -- additional messages where appropriate. The parameter is set False
4060 -- to get the message "X is undefined", and True to get the message
4061 -- "X is not visible".
4063 -------------------------
4064 -- From_Actual_Package --
4065 -------------------------
4067 function From_Actual_Package
(E
: Entity_Id
) return Boolean is
4068 Scop
: constant Entity_Id
:= Scope
(E
);
4072 if not In_Instance
then
4075 Inst
:= Current_Scope
;
4076 while Present
(Inst
)
4077 and then Ekind
(Inst
) /= E_Package
4078 and then not Is_Generic_Instance
(Inst
)
4080 Inst
:= Scope
(Inst
);
4087 Act
:= First_Entity
(Inst
);
4088 while Present
(Act
) loop
4089 if Ekind
(Act
) = E_Package
then
4091 -- Check for end of actuals list
4093 if Renamed_Object
(Act
) = Inst
then
4096 elsif Present
(Associated_Formal_Package
(Act
))
4097 and then Renamed_Object
(Act
) = Scop
4099 -- Entity comes from (instance of) formal package
4114 end From_Actual_Package
;
4116 -------------------------
4117 -- Is_Actual_Parameter --
4118 -------------------------
4120 function Is_Actual_Parameter
return Boolean is
4123 Nkind
(N
) = N_Identifier
4125 (Nkind
(Parent
(N
)) = N_Procedure_Call_Statement
4127 (Nkind
(Parent
(N
)) = N_Parameter_Association
4128 and then N
= Explicit_Actual_Parameter
(Parent
(N
))
4129 and then Nkind
(Parent
(Parent
(N
))) =
4130 N_Procedure_Call_Statement
));
4131 end Is_Actual_Parameter
;
4133 -------------------------
4134 -- Known_But_Invisible --
4135 -------------------------
4137 function Known_But_Invisible
(E
: Entity_Id
) return Boolean is
4138 Fname
: File_Name_Type
;
4141 -- Entities in Standard are always considered to be known
4143 if Sloc
(E
) <= Standard_Location
then
4146 -- An entity that does not come from source is always considered
4147 -- to be unknown, since it is an artifact of code expansion.
4149 elsif not Comes_From_Source
(E
) then
4152 -- In gnat internal mode, we consider all entities known
4154 elsif GNAT_Mode
then
4158 -- Here we have an entity that is not from package Standard, and
4159 -- which comes from Source. See if it comes from an internal file.
4161 Fname
:= Unit_File_Name
(Get_Source_Unit
(E
));
4163 -- Case of from internal file
4165 if Is_Internal_File_Name
(Fname
) then
4167 -- Private part entities in internal files are never considered
4168 -- to be known to the writer of normal application code.
4170 if Is_Hidden
(E
) then
4174 -- Entities from System packages other than System and
4175 -- System.Storage_Elements are not considered to be known.
4176 -- System.Auxxxx files are also considered known to the user.
4178 -- Should refine this at some point to generally distinguish
4179 -- between known and unknown internal files ???
4181 Get_Name_String
(Fname
);
4186 Name_Buffer
(1 .. 2) /= "s-"
4188 Name_Buffer
(3 .. 8) = "stoele"
4190 Name_Buffer
(3 .. 5) = "aux";
4192 -- If not an internal file, then entity is definitely known,
4193 -- even if it is in a private part (the message generated will
4194 -- note that it is in a private part)
4199 end Known_But_Invisible
;
4205 procedure Nvis_Messages
is
4206 Comp_Unit
: Node_Id
;
4208 Found
: Boolean := False;
4209 Hidden
: Boolean := False;
4213 -- Ada 2005 (AI-262): Generate a precise error concerning the
4214 -- Beaujolais effect that was previously detected
4216 if Nvis_Is_Private_Subprg
then
4218 pragma Assert
(Nkind
(E2
) = N_Defining_Identifier
4219 and then Ekind
(E2
) = E_Function
4220 and then Scope
(E2
) = Standard_Standard
4221 and then Has_Private_With
(E2
));
4223 -- Find the sloc corresponding to the private with'ed unit
4225 Comp_Unit
:= Cunit
(Current_Sem_Unit
);
4226 Error_Msg_Sloc
:= No_Location
;
4228 Item
:= First
(Context_Items
(Comp_Unit
));
4229 while Present
(Item
) loop
4230 if Nkind
(Item
) = N_With_Clause
4231 and then Private_Present
(Item
)
4232 and then Entity
(Name
(Item
)) = E2
4234 Error_Msg_Sloc
:= Sloc
(Item
);
4241 pragma Assert
(Error_Msg_Sloc
/= No_Location
);
4243 Error_Msg_N
("(Ada 2005): hidden by private with clause #", N
);
4247 Undefined
(Nvis
=> True);
4251 -- First loop does hidden declarations
4254 while Present
(Ent
) loop
4255 if Is_Potentially_Use_Visible
(Ent
) then
4257 Error_Msg_N
-- CODEFIX
4258 ("multiple use clauses cause hiding!", N
);
4262 Error_Msg_Sloc
:= Sloc
(Ent
);
4263 Error_Msg_N
-- CODEFIX
4264 ("hidden declaration#!", N
);
4267 Ent
:= Homonym
(Ent
);
4270 -- If we found hidden declarations, then that's enough, don't
4271 -- bother looking for non-visible declarations as well.
4277 -- Second loop does non-directly visible declarations
4280 while Present
(Ent
) loop
4281 if not Is_Potentially_Use_Visible
(Ent
) then
4283 -- Do not bother the user with unknown entities
4285 if not Known_But_Invisible
(Ent
) then
4289 Error_Msg_Sloc
:= Sloc
(Ent
);
4291 -- Output message noting that there is a non-visible
4292 -- declaration, distinguishing the private part case.
4294 if Is_Hidden
(Ent
) then
4295 Error_Msg_N
("non-visible (private) declaration#!", N
);
4297 -- If the entity is declared in a generic package, it
4298 -- cannot be visible, so there is no point in adding it
4299 -- to the list of candidates if another homograph from a
4300 -- non-generic package has been seen.
4302 elsif Ekind
(Scope
(Ent
)) = E_Generic_Package
4308 Error_Msg_N
-- CODEFIX
4309 ("non-visible declaration#!", N
);
4311 if Ekind
(Scope
(Ent
)) /= E_Generic_Package
then
4315 if Is_Compilation_Unit
(Ent
)
4317 Nkind
(Parent
(Parent
(N
))) = N_Use_Package_Clause
4319 Error_Msg_Qual_Level
:= 99;
4320 Error_Msg_NE
-- CODEFIX
4321 ("\\missing `WITH &;`", N
, Ent
);
4322 Error_Msg_Qual_Level
:= 0;
4325 if Ekind
(Ent
) = E_Discriminant
4326 and then Present
(Corresponding_Discriminant
(Ent
))
4327 and then Scope
(Corresponding_Discriminant
(Ent
)) =
4331 ("inherited discriminant not allowed here" &
4332 " (RM 3.8 (12), 3.8.1 (6))!", N
);
4336 -- Set entity and its containing package as referenced. We
4337 -- can't be sure of this, but this seems a better choice
4338 -- to avoid unused entity messages.
4340 if Comes_From_Source
(Ent
) then
4341 Set_Referenced
(Ent
);
4342 Set_Referenced
(Cunit_Entity
(Get_Source_Unit
(Ent
)));
4347 Ent
:= Homonym
(Ent
);
4356 procedure Undefined
(Nvis
: Boolean) is
4357 Emsg
: Error_Msg_Id
;
4360 -- We should never find an undefined internal name. If we do, then
4361 -- see if we have previous errors. If so, ignore on the grounds that
4362 -- it is probably a cascaded message (e.g. a block label from a badly
4363 -- formed block). If no previous errors, then we have a real internal
4364 -- error of some kind so raise an exception.
4366 if Is_Internal_Name
(Chars
(N
)) then
4367 if Total_Errors_Detected
/= 0 then
4370 raise Program_Error
;
4374 -- A very specialized error check, if the undefined variable is
4375 -- a case tag, and the case type is an enumeration type, check
4376 -- for a possible misspelling, and if so, modify the identifier
4378 -- Named aggregate should also be handled similarly ???
4380 if Nkind
(N
) = N_Identifier
4381 and then Nkind
(Parent
(N
)) = N_Case_Statement_Alternative
4384 Case_Stm
: constant Node_Id
:= Parent
(Parent
(N
));
4385 Case_Typ
: constant Entity_Id
:= Etype
(Expression
(Case_Stm
));
4390 if Is_Enumeration_Type
(Case_Typ
)
4391 and then not Is_Standard_Character_Type
(Case_Typ
)
4393 Lit
:= First_Literal
(Case_Typ
);
4394 Get_Name_String
(Chars
(Lit
));
4396 if Chars
(Lit
) /= Chars
(N
)
4397 and then Is_Bad_Spelling_Of
(Chars
(N
), Chars
(Lit
)) then
4398 Error_Msg_Node_2
:= Lit
;
4399 Error_Msg_N
-- CODEFIX
4400 ("& is undefined, assume misspelling of &", N
);
4401 Rewrite
(N
, New_Occurrence_Of
(Lit
, Sloc
(N
)));
4405 Lit
:= Next_Literal
(Lit
);
4410 -- Normal processing
4412 Set_Entity
(N
, Any_Id
);
4413 Set_Etype
(N
, Any_Type
);
4415 -- We use the table Urefs to keep track of entities for which we
4416 -- have issued errors for undefined references. Multiple errors
4417 -- for a single name are normally suppressed, however we modify
4418 -- the error message to alert the programmer to this effect.
4420 for J
in Urefs
.First
.. Urefs
.Last
loop
4421 if Chars
(N
) = Chars
(Urefs
.Table
(J
).Node
) then
4422 if Urefs
.Table
(J
).Err
/= No_Error_Msg
4423 and then Sloc
(N
) /= Urefs
.Table
(J
).Loc
4425 Error_Msg_Node_1
:= Urefs
.Table
(J
).Node
;
4427 if Urefs
.Table
(J
).Nvis
then
4428 Change_Error_Text
(Urefs
.Table
(J
).Err
,
4429 "& is not visible (more references follow)");
4431 Change_Error_Text
(Urefs
.Table
(J
).Err
,
4432 "& is undefined (more references follow)");
4435 Urefs
.Table
(J
).Err
:= No_Error_Msg
;
4438 -- Although we will set Msg False, and thus suppress the
4439 -- message, we also set Error_Posted True, to avoid any
4440 -- cascaded messages resulting from the undefined reference.
4443 Set_Error_Posted
(N
, True);
4448 -- If entry not found, this is first undefined occurrence
4451 Error_Msg_N
("& is not visible!", N
);
4455 Error_Msg_N
("& is undefined!", N
);
4458 -- A very bizarre special check, if the undefined identifier
4459 -- is put or put_line, then add a special error message (since
4460 -- this is a very common error for beginners to make).
4462 if Chars
(N
) = Name_Put
or else Chars
(N
) = Name_Put_Line
then
4463 Error_Msg_N
-- CODEFIX
4464 ("\\possible missing `WITH Ada.Text_'I'O; " &
4465 "USE Ada.Text_'I'O`!", N
);
4467 -- Another special check if N is the prefix of a selected
4468 -- component which is a known unit, add message complaining
4469 -- about missing with for this unit.
4471 elsif Nkind
(Parent
(N
)) = N_Selected_Component
4472 and then N
= Prefix
(Parent
(N
))
4473 and then Is_Known_Unit
(Parent
(N
))
4475 Error_Msg_Node_2
:= Selector_Name
(Parent
(N
));
4476 Error_Msg_N
-- CODEFIX
4477 ("\\missing `WITH &.&;`", Prefix
(Parent
(N
)));
4480 -- Now check for possible misspellings
4484 Ematch
: Entity_Id
:= Empty
;
4486 Last_Name_Id
: constant Name_Id
:=
4487 Name_Id
(Nat
(First_Name_Id
) +
4488 Name_Entries_Count
- 1);
4491 for Nam
in First_Name_Id
.. Last_Name_Id
loop
4492 E
:= Get_Name_Entity_Id
(Nam
);
4495 and then (Is_Immediately_Visible
(E
)
4497 Is_Potentially_Use_Visible
(E
))
4499 if Is_Bad_Spelling_Of
(Chars
(N
), Nam
) then
4506 if Present
(Ematch
) then
4507 Error_Msg_NE
-- CODEFIX
4508 ("\possible misspelling of&", N
, Ematch
);
4513 -- Make entry in undefined references table unless the full errors
4514 -- switch is set, in which case by refraining from generating the
4515 -- table entry, we guarantee that we get an error message for every
4516 -- undefined reference.
4518 if not All_Errors_Mode
then
4529 -- Start of processing for Find_Direct_Name
4532 -- If the entity pointer is already set, this is an internal node, or
4533 -- a node that is analyzed more than once, after a tree modification.
4534 -- In such a case there is no resolution to perform, just set the type.
4536 if Present
(Entity
(N
)) then
4537 if Is_Type
(Entity
(N
)) then
4538 Set_Etype
(N
, Entity
(N
));
4542 Entyp
: constant Entity_Id
:= Etype
(Entity
(N
));
4545 -- One special case here. If the Etype field is already set,
4546 -- and references the packed array type corresponding to the
4547 -- etype of the referenced entity, then leave it alone. This
4548 -- happens for trees generated from Exp_Pakd, where expressions
4549 -- can be deliberately "mis-typed" to the packed array type.
4551 if Is_Array_Type
(Entyp
)
4552 and then Is_Packed
(Entyp
)
4553 and then Present
(Etype
(N
))
4554 and then Etype
(N
) = Packed_Array_Type
(Entyp
)
4558 -- If not that special case, then just reset the Etype
4561 Set_Etype
(N
, Etype
(Entity
(N
)));
4569 -- Here if Entity pointer was not set, we need full visibility analysis
4570 -- First we generate debugging output if the debug E flag is set.
4572 if Debug_Flag_E
then
4573 Write_Str
("Looking for ");
4574 Write_Name
(Chars
(N
));
4578 Homonyms
:= Current_Entity
(N
);
4579 Nvis_Entity
:= False;
4582 while Present
(E
) loop
4584 -- If entity is immediately visible or potentially use visible, then
4585 -- process the entity and we are done.
4587 if Is_Immediately_Visible
(E
) then
4588 goto Immediately_Visible_Entity
;
4590 elsif Is_Potentially_Use_Visible
(E
) then
4591 goto Potentially_Use_Visible_Entity
;
4593 -- Note if a known but invisible entity encountered
4595 elsif Known_But_Invisible
(E
) then
4596 Nvis_Entity
:= True;
4599 -- Move to next entity in chain and continue search
4604 -- If no entries on homonym chain that were potentially visible,
4605 -- and no entities reasonably considered as non-visible, then
4606 -- we have a plain undefined reference, with no additional
4607 -- explanation required!
4609 if not Nvis_Entity
then
4610 Undefined
(Nvis
=> False);
4612 -- Otherwise there is at least one entry on the homonym chain that
4613 -- is reasonably considered as being known and non-visible.
4621 -- Processing for a potentially use visible entry found. We must search
4622 -- the rest of the homonym chain for two reasons. First, if there is a
4623 -- directly visible entry, then none of the potentially use-visible
4624 -- entities are directly visible (RM 8.4(10)). Second, we need to check
4625 -- for the case of multiple potentially use-visible entries hiding one
4626 -- another and as a result being non-directly visible (RM 8.4(11)).
4628 <<Potentially_Use_Visible_Entity
>> declare
4629 Only_One_Visible
: Boolean := True;
4630 All_Overloadable
: Boolean := Is_Overloadable
(E
);
4634 while Present
(E2
) loop
4635 if Is_Immediately_Visible
(E2
) then
4637 -- If the use-visible entity comes from the actual for a
4638 -- formal package, it hides a directly visible entity from
4639 -- outside the instance.
4641 if From_Actual_Package
(E
)
4642 and then Scope_Depth
(E2
) < Scope_Depth
(Inst
)
4647 goto Immediately_Visible_Entity
;
4650 elsif Is_Potentially_Use_Visible
(E2
) then
4651 Only_One_Visible
:= False;
4652 All_Overloadable
:= All_Overloadable
and Is_Overloadable
(E2
);
4654 -- Ada 2005 (AI-262): Protect against a form of Beaujolais effect
4655 -- that can occur in private_with clauses. Example:
4658 -- private with B; package A is
4659 -- package C is function B return Integer;
4661 -- V1 : Integer := B;
4662 -- private function B return Integer;
4663 -- V2 : Integer := B;
4666 -- V1 resolves to A.B, but V2 resolves to library unit B
4668 elsif Ekind
(E2
) = E_Function
4669 and then Scope
(E2
) = Standard_Standard
4670 and then Has_Private_With
(E2
)
4672 Only_One_Visible
:= False;
4673 All_Overloadable
:= False;
4674 Nvis_Is_Private_Subprg
:= True;
4681 -- On falling through this loop, we have checked that there are no
4682 -- immediately visible entities. Only_One_Visible is set if exactly
4683 -- one potentially use visible entity exists. All_Overloadable is
4684 -- set if all the potentially use visible entities are overloadable.
4685 -- The condition for legality is that either there is one potentially
4686 -- use visible entity, or if there is more than one, then all of them
4687 -- are overloadable.
4689 if Only_One_Visible
or All_Overloadable
then
4692 -- If there is more than one potentially use-visible entity and at
4693 -- least one of them non-overloadable, we have an error (RM 8.4(11).
4694 -- Note that E points to the first such entity on the homonym list.
4695 -- Special case: if one of the entities is declared in an actual
4696 -- package, it was visible in the generic, and takes precedence over
4697 -- other entities that are potentially use-visible. Same if it is
4698 -- declared in a local instantiation of the current instance.
4703 -- Find current instance
4705 Inst
:= Current_Scope
;
4706 while Present
(Inst
)
4707 and then Inst
/= Standard_Standard
4709 if Is_Generic_Instance
(Inst
) then
4713 Inst
:= Scope
(Inst
);
4717 while Present
(E2
) loop
4718 if From_Actual_Package
(E2
)
4720 (Is_Generic_Instance
(Scope
(E2
))
4721 and then Scope_Depth
(Scope
(E2
)) > Scope_Depth
(Inst
))
4734 Is_Predefined_File_Name
(Unit_File_Name
(Current_Sem_Unit
))
4736 -- A use-clause in the body of a system file creates conflict
4737 -- with some entity in a user scope, while rtsfind is active.
4738 -- Keep only the entity coming from another predefined unit.
4741 while Present
(E2
) loop
4742 if Is_Predefined_File_Name
4743 (Unit_File_Name
(Get_Source_Unit
(Sloc
(E2
))))
4752 -- Entity must exist because predefined unit is correct
4754 raise Program_Error
;
4763 -- Come here with E set to the first immediately visible entity on
4764 -- the homonym chain. This is the one we want unless there is another
4765 -- immediately visible entity further on in the chain for an inner
4766 -- scope (RM 8.3(8)).
4768 <<Immediately_Visible_Entity
>> declare
4773 -- Find scope level of initial entity. When compiling through
4774 -- Rtsfind, the previous context is not completely invisible, and
4775 -- an outer entity may appear on the chain, whose scope is below
4776 -- the entry for Standard that delimits the current scope stack.
4777 -- Indicate that the level for this spurious entry is outside of
4778 -- the current scope stack.
4780 Level
:= Scope_Stack
.Last
;
4782 Scop
:= Scope_Stack
.Table
(Level
).Entity
;
4783 exit when Scop
= Scope
(E
);
4785 exit when Scop
= Standard_Standard
;
4788 -- Now search remainder of homonym chain for more inner entry
4789 -- If the entity is Standard itself, it has no scope, and we
4790 -- compare it with the stack entry directly.
4793 while Present
(E2
) loop
4794 if Is_Immediately_Visible
(E2
) then
4796 -- If a generic package contains a local declaration that
4797 -- has the same name as the generic, there may be a visibility
4798 -- conflict in an instance, where the local declaration must
4799 -- also hide the name of the corresponding package renaming.
4800 -- We check explicitly for a package declared by a renaming,
4801 -- whose renamed entity is an instance that is on the scope
4802 -- stack, and that contains a homonym in the same scope. Once
4803 -- we have found it, we know that the package renaming is not
4804 -- immediately visible, and that the identifier denotes the
4805 -- other entity (and its homonyms if overloaded).
4807 if Scope
(E
) = Scope
(E2
)
4808 and then Ekind
(E
) = E_Package
4809 and then Present
(Renamed_Object
(E
))
4810 and then Is_Generic_Instance
(Renamed_Object
(E
))
4811 and then In_Open_Scopes
(Renamed_Object
(E
))
4812 and then Comes_From_Source
(N
)
4814 Set_Is_Immediately_Visible
(E
, False);
4818 for J
in Level
+ 1 .. Scope_Stack
.Last
loop
4819 if Scope_Stack
.Table
(J
).Entity
= Scope
(E2
)
4820 or else Scope_Stack
.Table
(J
).Entity
= E2
4833 -- At the end of that loop, E is the innermost immediately
4834 -- visible entity, so we are all set.
4837 -- Come here with entity found, and stored in E
4841 -- Check violation of No_Wide_Characters restriction
4843 Check_Wide_Character_Restriction
(E
, N
);
4845 -- When distribution features are available (Get_PCS_Name /=
4846 -- Name_No_DSA), a remote access-to-subprogram type is converted
4847 -- into a record type holding whatever information is needed to
4848 -- perform a remote call on an RCI subprogram. In that case we
4849 -- rewrite any occurrence of the RAS type into the equivalent record
4850 -- type here. 'Access attribute references and RAS dereferences are
4851 -- then implemented using specific TSSs. However when distribution is
4852 -- not available (case of Get_PCS_Name = Name_No_DSA), we bypass the
4853 -- generation of these TSSs, and we must keep the RAS type in its
4854 -- original access-to-subprogram form (since all calls through a
4855 -- value of such type will be local anyway in the absence of a PCS).
4857 if Comes_From_Source
(N
)
4858 and then Is_Remote_Access_To_Subprogram_Type
(E
)
4859 and then Expander_Active
4860 and then Get_PCS_Name
/= Name_No_DSA
4863 New_Occurrence_Of
(Equivalent_Type
(E
), Sloc
(N
)));
4867 -- Set the entity. Note that the reason we call Set_Entity for the
4868 -- overloadable case, as opposed to Set_Entity_With_Style_Check is
4869 -- that in the overloaded case, the initial call can set the wrong
4870 -- homonym. The call that sets the right homonym is in Sem_Res and
4871 -- that call does use Set_Entity_With_Style_Check, so we don't miss
4874 if Is_Overloadable
(E
) then
4877 Set_Entity_With_Style_Check
(N
, E
);
4883 Set_Etype
(N
, Get_Full_View
(Etype
(E
)));
4886 if Debug_Flag_E
then
4887 Write_Str
(" found ");
4888 Write_Entity_Info
(E
, " ");
4891 -- If the Ekind of the entity is Void, it means that all homonyms
4892 -- are hidden from all visibility (RM 8.3(5,14-20)). However, this
4893 -- test is skipped if the current scope is a record and the name is
4894 -- a pragma argument expression (case of Atomic and Volatile pragmas
4895 -- and possibly other similar pragmas added later, which are allowed
4896 -- to reference components in the current record).
4898 if Ekind
(E
) = E_Void
4900 (not Is_Record_Type
(Current_Scope
)
4901 or else Nkind
(Parent
(N
)) /= N_Pragma_Argument_Association
)
4903 Premature_Usage
(N
);
4905 -- If the entity is overloadable, collect all interpretations of the
4906 -- name for subsequent overload resolution. We optimize a bit here to
4907 -- do this only if we have an overloadable entity that is not on its
4908 -- own on the homonym chain.
4910 elsif Is_Overloadable
(E
)
4911 and then (Present
(Homonym
(E
)) or else Current_Entity
(N
) /= E
)
4913 Collect_Interps
(N
);
4915 -- If no homonyms were visible, the entity is unambiguous
4917 if not Is_Overloaded
(N
) then
4918 if not Is_Actual_Parameter
then
4919 Generate_Reference
(E
, N
);
4923 -- Case of non-overloadable entity, set the entity providing that
4924 -- we do not have the case of a discriminant reference within a
4925 -- default expression. Such references are replaced with the
4926 -- corresponding discriminal, which is the formal corresponding to
4927 -- to the discriminant in the initialization procedure.
4930 -- Entity is unambiguous, indicate that it is referenced here
4932 -- For a renaming of an object, always generate simple reference,
4933 -- we don't try to keep track of assignments in this case.
4935 if Is_Object
(E
) and then Present
(Renamed_Object
(E
)) then
4936 Generate_Reference
(E
, N
);
4938 -- If the renamed entity is a private protected component,
4939 -- reference the original component as well. This needs to be
4940 -- done because the private renamings are installed before any
4941 -- analysis has occurred. Reference to a private component will
4942 -- resolve to the renaming and the original component will be
4943 -- left unreferenced, hence the following.
4945 if Is_Prival
(E
) then
4946 Generate_Reference
(Prival_Link
(E
), N
);
4949 -- One odd case is that we do not want to set the Referenced flag
4950 -- if the entity is a label, and the identifier is the label in
4951 -- the source, since this is not a reference from the point of
4952 -- view of the user.
4954 elsif Nkind
(Parent
(N
)) = N_Label
then
4956 R
: constant Boolean := Referenced
(E
);
4959 -- Generate reference unless this is an actual parameter
4960 -- (see comment below)
4962 if Is_Actual_Parameter
then
4963 Generate_Reference
(E
, N
);
4964 Set_Referenced
(E
, R
);
4968 -- Normal case, not a label: generate reference
4970 -- ??? It is too early to generate a reference here even if the
4971 -- entity is unambiguous, because the tree is not sufficiently
4972 -- typed at this point for Generate_Reference to determine
4973 -- whether this reference modifies the denoted object (because
4974 -- implicit dereferences cannot be identified prior to full type
4977 -- The Is_Actual_Parameter routine takes care of one of these
4978 -- cases but there are others probably ???
4980 -- If the entity is the LHS of an assignment, and is a variable
4981 -- (rather than a package prefix), we can mark it as a
4982 -- modification right away, to avoid duplicate references.
4985 if not Is_Actual_Parameter
then
4987 and then Ekind
(E
) /= E_Package
4988 and then Ekind
(E
) /= E_Generic_Package
4990 Generate_Reference
(E
, N
, 'm');
4992 Generate_Reference
(E
, N
);
4996 Check_Nested_Access
(E
);
4999 Set_Entity_Or_Discriminal
(N
, E
);
5001 if Ada_Version
>= Ada_2012
5003 (Nkind
(Parent
(N
)) in N_Subexpr
5004 or else Nkind
(Parent
(N
)) = N_Object_Declaration
)
5006 Check_Implicit_Dereference
(N
, Etype
(E
));
5010 end Find_Direct_Name
;
5012 ------------------------
5013 -- Find_Expanded_Name --
5014 ------------------------
5016 -- This routine searches the homonym chain of the entity until it finds
5017 -- an entity declared in the scope denoted by the prefix. If the entity
5018 -- is private, it may nevertheless be immediately visible, if we are in
5019 -- the scope of its declaration.
5021 procedure Find_Expanded_Name
(N
: Node_Id
) is
5022 Selector
: constant Node_Id
:= Selector_Name
(N
);
5023 Candidate
: Entity_Id
:= Empty
;
5029 P_Name
:= Entity
(Prefix
(N
));
5032 -- If the prefix is a renamed package, look for the entity in the
5033 -- original package.
5035 if Ekind
(P_Name
) = E_Package
5036 and then Present
(Renamed_Object
(P_Name
))
5038 P_Name
:= Renamed_Object
(P_Name
);
5040 -- Rewrite node with entity field pointing to renamed object
5042 Rewrite
(Prefix
(N
), New_Copy
(Prefix
(N
)));
5043 Set_Entity
(Prefix
(N
), P_Name
);
5045 -- If the prefix is an object of a concurrent type, look for
5046 -- the entity in the associated task or protected type.
5048 elsif Is_Concurrent_Type
(Etype
(P_Name
)) then
5049 P_Name
:= Etype
(P_Name
);
5052 Id
:= Current_Entity
(Selector
);
5055 Is_New_Candidate
: Boolean;
5058 while Present
(Id
) loop
5059 if Scope
(Id
) = P_Name
then
5061 Is_New_Candidate
:= True;
5063 -- Ada 2005 (AI-217): Handle shadow entities associated with types
5064 -- declared in limited-withed nested packages. We don't need to
5065 -- handle E_Incomplete_Subtype entities because the entities in
5066 -- the limited view are always E_Incomplete_Type entities (see
5067 -- Build_Limited_Views). Regarding the expression used to evaluate
5068 -- the scope, it is important to note that the limited view also
5069 -- has shadow entities associated nested packages. For this reason
5070 -- the correct scope of the entity is the scope of the real entity
5071 -- The non-limited view may itself be incomplete, in which case
5072 -- get the full view if available.
5074 elsif From_With_Type
(Id
)
5075 and then Is_Type
(Id
)
5076 and then Ekind
(Id
) = E_Incomplete_Type
5077 and then Present
(Non_Limited_View
(Id
))
5078 and then Scope
(Non_Limited_View
(Id
)) = P_Name
5080 Candidate
:= Get_Full_View
(Non_Limited_View
(Id
));
5081 Is_New_Candidate
:= True;
5084 Is_New_Candidate
:= False;
5087 if Is_New_Candidate
then
5088 if Is_Child_Unit
(Id
) then
5089 exit when Is_Visible_Child_Unit
(Id
)
5090 or else Is_Immediately_Visible
(Id
);
5093 exit when not Is_Hidden
(Id
)
5094 or else Is_Immediately_Visible
(Id
);
5103 and then (Ekind
(P_Name
) = E_Procedure
5105 Ekind
(P_Name
) = E_Function
)
5106 and then Is_Generic_Instance
(P_Name
)
5108 -- Expanded name denotes entity in (instance of) generic subprogram.
5109 -- The entity may be in the subprogram instance, or may denote one of
5110 -- the formals, which is declared in the enclosing wrapper package.
5112 P_Name
:= Scope
(P_Name
);
5114 Id
:= Current_Entity
(Selector
);
5115 while Present
(Id
) loop
5116 exit when Scope
(Id
) = P_Name
;
5121 if No
(Id
) or else Chars
(Id
) /= Chars
(Selector
) then
5122 Set_Etype
(N
, Any_Type
);
5124 -- If we are looking for an entity defined in System, try to find it
5125 -- in the child package that may have been provided as an extension
5126 -- to System. The Extend_System pragma will have supplied the name of
5127 -- the extension, which may have to be loaded.
5129 if Chars
(P_Name
) = Name_System
5130 and then Scope
(P_Name
) = Standard_Standard
5131 and then Present
(System_Extend_Unit
)
5132 and then Present_System_Aux
(N
)
5134 Set_Entity
(Prefix
(N
), System_Aux_Id
);
5135 Find_Expanded_Name
(N
);
5138 elsif Nkind
(Selector
) = N_Operator_Symbol
5139 and then Has_Implicit_Operator
(N
)
5141 -- There is an implicit instance of the predefined operator in
5142 -- the given scope. The operator entity is defined in Standard.
5143 -- Has_Implicit_Operator makes the node into an Expanded_Name.
5147 elsif Nkind
(Selector
) = N_Character_Literal
5148 and then Has_Implicit_Character_Literal
(N
)
5150 -- If there is no literal defined in the scope denoted by the
5151 -- prefix, the literal may belong to (a type derived from)
5152 -- Standard_Character, for which we have no explicit literals.
5157 -- If the prefix is a single concurrent object, use its name in
5158 -- the error message, rather than that of the anonymous type.
5160 if Is_Concurrent_Type
(P_Name
)
5161 and then Is_Internal_Name
(Chars
(P_Name
))
5163 Error_Msg_Node_2
:= Entity
(Prefix
(N
));
5165 Error_Msg_Node_2
:= P_Name
;
5168 if P_Name
= System_Aux_Id
then
5169 P_Name
:= Scope
(P_Name
);
5170 Set_Entity
(Prefix
(N
), P_Name
);
5173 if Present
(Candidate
) then
5175 -- If we know that the unit is a child unit we can give a more
5176 -- accurate error message.
5178 if Is_Child_Unit
(Candidate
) then
5180 -- If the candidate is a private child unit and we are in
5181 -- the visible part of a public unit, specialize the error
5182 -- message. There might be a private with_clause for it,
5183 -- but it is not currently active.
5185 if Is_Private_Descendant
(Candidate
)
5186 and then Ekind
(Current_Scope
) = E_Package
5187 and then not In_Private_Part
(Current_Scope
)
5188 and then not Is_Private_Descendant
(Current_Scope
)
5190 Error_Msg_N
("private child unit& is not visible here",
5193 -- Normal case where we have a missing with for a child unit
5196 Error_Msg_Qual_Level
:= 99;
5197 Error_Msg_NE
-- CODEFIX
5198 ("missing `WITH &;`", Selector
, Candidate
);
5199 Error_Msg_Qual_Level
:= 0;
5202 -- Here we don't know that this is a child unit
5205 Error_Msg_NE
("& is not a visible entity of&", N
, Selector
);
5209 -- Within the instantiation of a child unit, the prefix may
5210 -- denote the parent instance, but the selector has the name
5211 -- of the original child. Find whether we are within the
5212 -- corresponding instance, and get the proper entity, which
5213 -- can only be an enclosing scope.
5216 and then In_Open_Scopes
(P_Name
)
5217 and then Is_Generic_Instance
(P_Name
)
5220 S
: Entity_Id
:= Current_Scope
;
5224 for J
in reverse 0 .. Scope_Stack
.Last
loop
5225 S
:= Scope_Stack
.Table
(J
).Entity
;
5227 exit when S
= Standard_Standard
;
5229 if Ekind_In
(S
, E_Function
,
5233 P
:= Generic_Parent
(Specification
5234 (Unit_Declaration_Node
(S
)));
5237 and then Chars
(Scope
(P
)) = Chars
(O_Name
)
5238 and then Chars
(P
) = Chars
(Selector
)
5249 -- If this is a selection from Ada, System or Interfaces, then
5250 -- we assume a missing with for the corresponding package.
5252 if Is_Known_Unit
(N
) then
5253 if not Error_Posted
(N
) then
5254 Error_Msg_Node_2
:= Selector
;
5255 Error_Msg_N
-- CODEFIX
5256 ("missing `WITH &.&;`", Prefix
(N
));
5259 -- If this is a selection from a dummy package, then suppress
5260 -- the error message, of course the entity is missing if the
5261 -- package is missing!
5263 elsif Sloc
(Error_Msg_Node_2
) = No_Location
then
5266 -- Here we have the case of an undefined component
5270 -- The prefix may hide a homonym in the context that
5271 -- declares the desired entity. This error can use a
5272 -- specialized message.
5274 if In_Open_Scopes
(P_Name
)
5275 and then Present
(Homonym
(P_Name
))
5276 and then Is_Compilation_Unit
(Homonym
(P_Name
))
5278 (Is_Immediately_Visible
(Homonym
(P_Name
))
5279 or else Is_Visible_Child_Unit
(Homonym
(P_Name
)))
5282 H
: constant Entity_Id
:= Homonym
(P_Name
);
5285 Id
:= First_Entity
(H
);
5286 while Present
(Id
) loop
5287 if Chars
(Id
) = Chars
(Selector
) then
5288 Error_Msg_Qual_Level
:= 99;
5289 Error_Msg_Name_1
:= Chars
(Selector
);
5291 ("% not declared in&", N
, P_Name
);
5293 ("\use fully qualified name starting with"
5294 & " Standard to make& visible", N
, H
);
5295 Error_Msg_Qual_Level
:= 0;
5302 -- If not found, standard error message
5304 Error_Msg_NE
("& not declared in&", N
, Selector
);
5310 Error_Msg_NE
("& not declared in&", N
, Selector
);
5313 -- Check for misspelling of some entity in prefix
5315 Id
:= First_Entity
(P_Name
);
5316 while Present
(Id
) loop
5317 if Is_Bad_Spelling_Of
(Chars
(Id
), Chars
(Selector
))
5318 and then not Is_Internal_Name
(Chars
(Id
))
5320 Error_Msg_NE
-- CODEFIX
5321 ("possible misspelling of&", Selector
, Id
);
5328 -- Specialize the message if this may be an instantiation
5329 -- of a child unit that was not mentioned in the context.
5331 if Nkind
(Parent
(N
)) = N_Package_Instantiation
5332 and then Is_Generic_Instance
(Entity
(Prefix
(N
)))
5333 and then Is_Compilation_Unit
5334 (Generic_Parent
(Parent
(Entity
(Prefix
(N
)))))
5336 Error_Msg_Node_2
:= Selector
;
5337 Error_Msg_N
-- CODEFIX
5338 ("\missing `WITH &.&;`", Prefix
(N
));
5348 if Comes_From_Source
(N
)
5349 and then Is_Remote_Access_To_Subprogram_Type
(Id
)
5350 and then Present
(Equivalent_Type
(Id
))
5352 -- If we are not actually generating distribution code (i.e. the
5353 -- current PCS is the dummy non-distributed version), then the
5354 -- Equivalent_Type will be missing, and Id should be treated as
5355 -- a regular access-to-subprogram type.
5357 Id
:= Equivalent_Type
(Id
);
5358 Set_Chars
(Selector
, Chars
(Id
));
5361 -- Ada 2005 (AI-50217): Check usage of entities in limited withed units
5363 if Ekind
(P_Name
) = E_Package
5364 and then From_With_Type
(P_Name
)
5366 if From_With_Type
(Id
)
5367 or else Is_Type
(Id
)
5368 or else Ekind
(Id
) = E_Package
5373 ("limited withed package can only be used to access "
5374 & "incomplete types",
5379 if Is_Task_Type
(P_Name
)
5380 and then ((Ekind
(Id
) = E_Entry
5381 and then Nkind
(Parent
(N
)) /= N_Attribute_Reference
)
5383 (Ekind
(Id
) = E_Entry_Family
5385 Nkind
(Parent
(Parent
(N
))) /= N_Attribute_Reference
))
5387 -- It is an entry call after all, either to the current task (which
5388 -- will deadlock) or to an enclosing task.
5390 Analyze_Selected_Component
(N
);
5394 Change_Selected_Component_To_Expanded_Name
(N
);
5396 -- Do style check and generate reference, but skip both steps if this
5397 -- entity has homonyms, since we may not have the right homonym set yet.
5398 -- The proper homonym will be set during the resolve phase.
5400 if Has_Homonym
(Id
) then
5403 Set_Entity_Or_Discriminal
(N
, Id
);
5406 Generate_Reference
(Id
, N
, 'm');
5408 Generate_Reference
(Id
, N
);
5412 if Is_Type
(Id
) then
5415 Set_Etype
(N
, Get_Full_View
(Etype
(Id
)));
5418 -- Check for violation of No_Wide_Characters
5420 Check_Wide_Character_Restriction
(Id
, N
);
5422 -- If the Ekind of the entity is Void, it means that all homonyms are
5423 -- hidden from all visibility (RM 8.3(5,14-20)).
5425 if Ekind
(Id
) = E_Void
then
5426 Premature_Usage
(N
);
5428 elsif Is_Overloadable
(Id
)
5429 and then Present
(Homonym
(Id
))
5432 H
: Entity_Id
:= Homonym
(Id
);
5435 while Present
(H
) loop
5436 if Scope
(H
) = Scope
(Id
)
5439 or else Is_Immediately_Visible
(H
))
5441 Collect_Interps
(N
);
5448 -- If an extension of System is present, collect possible explicit
5449 -- overloadings declared in the extension.
5451 if Chars
(P_Name
) = Name_System
5452 and then Scope
(P_Name
) = Standard_Standard
5453 and then Present
(System_Extend_Unit
)
5454 and then Present_System_Aux
(N
)
5456 H
:= Current_Entity
(Id
);
5458 while Present
(H
) loop
5459 if Scope
(H
) = System_Aux_Id
then
5460 Add_One_Interp
(N
, H
, Etype
(H
));
5469 if Nkind
(Selector_Name
(N
)) = N_Operator_Symbol
5470 and then Scope
(Id
) /= Standard_Standard
5472 -- In addition to user-defined operators in the given scope, there
5473 -- may be an implicit instance of the predefined operator. The
5474 -- operator (defined in Standard) is found in Has_Implicit_Operator,
5475 -- and added to the interpretations. Procedure Add_One_Interp will
5476 -- determine which hides which.
5478 if Has_Implicit_Operator
(N
) then
5482 end Find_Expanded_Name
;
5484 -------------------------
5485 -- Find_Renamed_Entity --
5486 -------------------------
5488 function Find_Renamed_Entity
5492 Is_Actual
: Boolean := False) return Entity_Id
5495 I1
: Interp_Index
:= 0; -- Suppress junk warnings
5501 function Enclosing_Instance
return Entity_Id
;
5502 -- If the renaming determines the entity for the default of a formal
5503 -- subprogram nested within another instance, choose the innermost
5504 -- candidate. This is because if the formal has a box, and we are within
5505 -- an enclosing instance where some candidate interpretations are local
5506 -- to this enclosing instance, we know that the default was properly
5507 -- resolved when analyzing the generic, so we prefer the local
5508 -- candidates to those that are external. This is not always the case
5509 -- but is a reasonable heuristic on the use of nested generics. The
5510 -- proper solution requires a full renaming model.
5512 function Is_Visible_Operation
(Op
: Entity_Id
) return Boolean;
5513 -- If the renamed entity is an implicit operator, check whether it is
5514 -- visible because its operand type is properly visible. This check
5515 -- applies to explicit renamed entities that appear in the source in a
5516 -- renaming declaration or a formal subprogram instance, but not to
5517 -- default generic actuals with a name.
5519 function Report_Overload
return Entity_Id
;
5520 -- List possible interpretations, and specialize message in the
5521 -- case of a generic actual.
5523 function Within
(Inner
, Outer
: Entity_Id
) return Boolean;
5524 -- Determine whether a candidate subprogram is defined within the
5525 -- enclosing instance. If yes, it has precedence over outer candidates.
5527 ------------------------
5528 -- Enclosing_Instance --
5529 ------------------------
5531 function Enclosing_Instance
return Entity_Id
is
5535 if not Is_Generic_Instance
(Current_Scope
)
5536 and then not Is_Actual
5541 S
:= Scope
(Current_Scope
);
5542 while S
/= Standard_Standard
loop
5543 if Is_Generic_Instance
(S
) then
5551 end Enclosing_Instance
;
5553 --------------------------
5554 -- Is_Visible_Operation --
5555 --------------------------
5557 function Is_Visible_Operation
(Op
: Entity_Id
) return Boolean is
5563 if Ekind
(Op
) /= E_Operator
5564 or else Scope
(Op
) /= Standard_Standard
5565 or else (In_Instance
5568 or else Present
(Enclosing_Instance
)))
5573 -- For a fixed point type operator, check the resulting type,
5574 -- because it may be a mixed mode integer * fixed operation.
5576 if Present
(Next_Formal
(First_Formal
(New_S
)))
5577 and then Is_Fixed_Point_Type
(Etype
(New_S
))
5579 Typ
:= Etype
(New_S
);
5581 Typ
:= Etype
(First_Formal
(New_S
));
5584 Btyp
:= Base_Type
(Typ
);
5586 if Nkind
(Nam
) /= N_Expanded_Name
then
5587 return (In_Open_Scopes
(Scope
(Btyp
))
5588 or else Is_Potentially_Use_Visible
(Btyp
)
5589 or else In_Use
(Btyp
)
5590 or else In_Use
(Scope
(Btyp
)));
5593 Scop
:= Entity
(Prefix
(Nam
));
5595 if Ekind
(Scop
) = E_Package
5596 and then Present
(Renamed_Object
(Scop
))
5598 Scop
:= Renamed_Object
(Scop
);
5601 -- Operator is visible if prefix of expanded name denotes
5602 -- scope of type, or else type is defined in System_Aux
5603 -- and the prefix denotes System.
5605 return Scope
(Btyp
) = Scop
5606 or else (Scope
(Btyp
) = System_Aux_Id
5607 and then Scope
(Scope
(Btyp
)) = Scop
);
5610 end Is_Visible_Operation
;
5616 function Within
(Inner
, Outer
: Entity_Id
) return Boolean is
5620 Sc
:= Scope
(Inner
);
5621 while Sc
/= Standard_Standard
loop
5632 ---------------------
5633 -- Report_Overload --
5634 ---------------------
5636 function Report_Overload
return Entity_Id
is
5639 Error_Msg_NE
-- CODEFIX
5640 ("ambiguous actual subprogram&, " &
5641 "possible interpretations:", N
, Nam
);
5643 Error_Msg_N
-- CODEFIX
5644 ("ambiguous subprogram, " &
5645 "possible interpretations:", N
);
5648 List_Interps
(Nam
, N
);
5650 end Report_Overload
;
5652 -- Start of processing for Find_Renamed_Entity
5656 Candidate_Renaming
:= Empty
;
5658 if not Is_Overloaded
(Nam
) then
5659 if Entity_Matches_Spec
(Entity
(Nam
), New_S
) then
5660 Candidate_Renaming
:= New_S
;
5662 if Is_Visible_Operation
(Entity
(Nam
)) then
5663 Old_S
:= Entity
(Nam
);
5667 Present
(First_Formal
(Entity
(Nam
)))
5668 and then Present
(First_Formal
(New_S
))
5669 and then (Base_Type
(Etype
(First_Formal
(Entity
(Nam
))))
5670 = Base_Type
(Etype
(First_Formal
(New_S
))))
5672 Candidate_Renaming
:= Entity
(Nam
);
5676 Get_First_Interp
(Nam
, Ind
, It
);
5677 while Present
(It
.Nam
) loop
5678 if Entity_Matches_Spec
(It
.Nam
, New_S
)
5679 and then Is_Visible_Operation
(It
.Nam
)
5681 if Old_S
/= Any_Id
then
5683 -- Note: The call to Disambiguate only happens if a
5684 -- previous interpretation was found, in which case I1
5685 -- has received a value.
5687 It1
:= Disambiguate
(Nam
, I1
, Ind
, Etype
(Old_S
));
5689 if It1
= No_Interp
then
5690 Inst
:= Enclosing_Instance
;
5692 if Present
(Inst
) then
5693 if Within
(It
.Nam
, Inst
) then
5694 if Within
(Old_S
, Inst
) then
5696 -- Choose the innermost subprogram, which would
5697 -- have hidden the outer one in the generic.
5699 if Scope_Depth
(It
.Nam
) <
5708 elsif Within
(Old_S
, Inst
) then
5712 return Report_Overload
;
5715 -- If not within an instance, ambiguity is real
5718 return Report_Overload
;
5732 Present
(First_Formal
(It
.Nam
))
5733 and then Present
(First_Formal
(New_S
))
5734 and then (Base_Type
(Etype
(First_Formal
(It
.Nam
)))
5735 = Base_Type
(Etype
(First_Formal
(New_S
))))
5737 Candidate_Renaming
:= It
.Nam
;
5740 Get_Next_Interp
(Ind
, It
);
5743 Set_Entity
(Nam
, Old_S
);
5745 if Old_S
/= Any_Id
then
5746 Set_Is_Overloaded
(Nam
, False);
5751 end Find_Renamed_Entity
;
5753 -----------------------------
5754 -- Find_Selected_Component --
5755 -----------------------------
5757 procedure Find_Selected_Component
(N
: Node_Id
) is
5758 P
: constant Node_Id
:= Prefix
(N
);
5761 -- Entity denoted by prefix
5771 if Nkind
(P
) = N_Error
then
5775 -- Selector name cannot be a character literal or an operator symbol in
5776 -- SPARK, except for the operator symbol in a renaming.
5778 if Restriction_Check_Required
(SPARK
) then
5779 if Nkind
(Selector_Name
(N
)) = N_Character_Literal
then
5780 Check_SPARK_Restriction
5781 ("character literal cannot be prefixed", N
);
5782 elsif Nkind
(Selector_Name
(N
)) = N_Operator_Symbol
5783 and then Nkind
(Parent
(N
)) /= N_Subprogram_Renaming_Declaration
5785 Check_SPARK_Restriction
("operator symbol cannot be prefixed", N
);
5789 -- If the selector already has an entity, the node has been constructed
5790 -- in the course of expansion, and is known to be valid. Do not verify
5791 -- that it is defined for the type (it may be a private component used
5792 -- in the expansion of record equality).
5794 if Present
(Entity
(Selector_Name
(N
))) then
5796 or else Etype
(N
) = Any_Type
5799 Sel_Name
: constant Node_Id
:= Selector_Name
(N
);
5800 Selector
: constant Entity_Id
:= Entity
(Sel_Name
);
5804 Set_Etype
(Sel_Name
, Etype
(Selector
));
5806 if not Is_Entity_Name
(P
) then
5810 -- Build an actual subtype except for the first parameter
5811 -- of an init proc, where this actual subtype is by
5812 -- definition incorrect, since the object is uninitialized
5813 -- (and does not even have defined discriminants etc.)
5815 if Is_Entity_Name
(P
)
5816 and then Ekind
(Entity
(P
)) = E_Function
5818 Nam
:= New_Copy
(P
);
5820 if Is_Overloaded
(P
) then
5821 Save_Interps
(P
, Nam
);
5825 Make_Function_Call
(Sloc
(P
), Name
=> Nam
));
5827 Analyze_Selected_Component
(N
);
5830 elsif Ekind
(Selector
) = E_Component
5831 and then (not Is_Entity_Name
(P
)
5832 or else Chars
(Entity
(P
)) /= Name_uInit
)
5834 -- Do not build the subtype when referencing components of
5835 -- dispatch table wrappers. Required to avoid generating
5836 -- elaboration code with HI runtimes. JVM and .NET use a
5837 -- modified version of Ada.Tags which does not contain RE_
5838 -- Dispatch_Table_Wrapper and RE_No_Dispatch_Table_Wrapper.
5839 -- Avoid raising RE_Not_Available exception in those cases.
5841 if VM_Target
= No_VM
5842 and then RTU_Loaded
(Ada_Tags
)
5844 ((RTE_Available
(RE_Dispatch_Table_Wrapper
)
5845 and then Scope
(Selector
) =
5846 RTE
(RE_Dispatch_Table_Wrapper
))
5848 (RTE_Available
(RE_No_Dispatch_Table_Wrapper
)
5849 and then Scope
(Selector
) =
5850 RTE
(RE_No_Dispatch_Table_Wrapper
)))
5856 Build_Actual_Subtype_Of_Component
5857 (Etype
(Selector
), N
);
5864 if No
(C_Etype
) then
5865 C_Etype
:= Etype
(Selector
);
5867 Insert_Action
(N
, C_Etype
);
5868 C_Etype
:= Defining_Identifier
(C_Etype
);
5871 Set_Etype
(N
, C_Etype
);
5874 -- If this is the name of an entry or protected operation, and
5875 -- the prefix is an access type, insert an explicit dereference,
5876 -- so that entry calls are treated uniformly.
5878 if Is_Access_Type
(Etype
(P
))
5879 and then Is_Concurrent_Type
(Designated_Type
(Etype
(P
)))
5882 New_P
: constant Node_Id
:=
5883 Make_Explicit_Dereference
(Sloc
(P
),
5884 Prefix
=> Relocate_Node
(P
));
5887 Set_Etype
(P
, Designated_Type
(Etype
(Prefix
(P
))));
5891 -- If the selected component appears within a default expression
5892 -- and it has an actual subtype, the pre-analysis has not yet
5893 -- completed its analysis, because Insert_Actions is disabled in
5894 -- that context. Within the init proc of the enclosing type we
5895 -- must complete this analysis, if an actual subtype was created.
5897 elsif Inside_Init_Proc
then
5899 Typ
: constant Entity_Id
:= Etype
(N
);
5900 Decl
: constant Node_Id
:= Declaration_Node
(Typ
);
5902 if Nkind
(Decl
) = N_Subtype_Declaration
5903 and then not Analyzed
(Decl
)
5904 and then Is_List_Member
(Decl
)
5905 and then No
(Parent
(Decl
))
5908 Insert_Action
(N
, Decl
);
5915 elsif Is_Entity_Name
(P
) then
5916 P_Name
:= Entity
(P
);
5918 -- The prefix may denote an enclosing type which is the completion
5919 -- of an incomplete type declaration.
5921 if Is_Type
(P_Name
) then
5922 Set_Entity
(P
, Get_Full_View
(P_Name
));
5923 Set_Etype
(P
, Entity
(P
));
5924 P_Name
:= Entity
(P
);
5927 P_Type
:= Base_Type
(Etype
(P
));
5929 if Debug_Flag_E
then
5930 Write_Str
("Found prefix type to be ");
5931 Write_Entity_Info
(P_Type
, " "); Write_Eol
;
5934 -- First check for components of a record object (not the
5935 -- result of a call, which is handled below).
5937 if Is_Appropriate_For_Record
(P_Type
)
5938 and then not Is_Overloadable
(P_Name
)
5939 and then not Is_Type
(P_Name
)
5941 -- Selected component of record. Type checking will validate
5942 -- name of selector.
5943 -- ??? could we rewrite an implicit dereference into an explicit
5946 Analyze_Selected_Component
(N
);
5948 -- Reference to type name in predicate/invariant expression
5950 elsif Is_Appropriate_For_Entry_Prefix
(P_Type
)
5951 and then not In_Open_Scopes
(P_Name
)
5952 and then (not Is_Concurrent_Type
(Etype
(P_Name
))
5953 or else not In_Open_Scopes
(Etype
(P_Name
)))
5955 -- Call to protected operation or entry. Type checking is
5956 -- needed on the prefix.
5958 Analyze_Selected_Component
(N
);
5960 elsif (In_Open_Scopes
(P_Name
)
5961 and then Ekind
(P_Name
) /= E_Void
5962 and then not Is_Overloadable
(P_Name
))
5963 or else (Is_Concurrent_Type
(Etype
(P_Name
))
5964 and then In_Open_Scopes
(Etype
(P_Name
)))
5966 -- Prefix denotes an enclosing loop, block, or task, i.e. an
5967 -- enclosing construct that is not a subprogram or accept.
5969 Find_Expanded_Name
(N
);
5971 elsif Ekind
(P_Name
) = E_Package
then
5972 Find_Expanded_Name
(N
);
5974 elsif Is_Overloadable
(P_Name
) then
5976 -- The subprogram may be a renaming (of an enclosing scope) as
5977 -- in the case of the name of the generic within an instantiation.
5979 if Ekind_In
(P_Name
, E_Procedure
, E_Function
)
5980 and then Present
(Alias
(P_Name
))
5981 and then Is_Generic_Instance
(Alias
(P_Name
))
5983 P_Name
:= Alias
(P_Name
);
5986 if Is_Overloaded
(P
) then
5988 -- The prefix must resolve to a unique enclosing construct
5991 Found
: Boolean := False;
5996 Get_First_Interp
(P
, Ind
, It
);
5997 while Present
(It
.Nam
) loop
5998 if In_Open_Scopes
(It
.Nam
) then
6001 "prefix must be unique enclosing scope", N
);
6002 Set_Entity
(N
, Any_Id
);
6003 Set_Etype
(N
, Any_Type
);
6012 Get_Next_Interp
(Ind
, It
);
6017 if In_Open_Scopes
(P_Name
) then
6018 Set_Entity
(P
, P_Name
);
6019 Set_Is_Overloaded
(P
, False);
6020 Find_Expanded_Name
(N
);
6023 -- If no interpretation as an expanded name is possible, it
6024 -- must be a selected component of a record returned by a
6025 -- function call. Reformat prefix as a function call, the rest
6026 -- is done by type resolution. If the prefix is procedure or
6027 -- entry, as is P.X; this is an error.
6029 if Ekind
(P_Name
) /= E_Function
6030 and then (not Is_Overloaded
(P
)
6032 Nkind
(Parent
(N
)) = N_Procedure_Call_Statement
)
6034 -- Prefix may mention a package that is hidden by a local
6035 -- declaration: let the user know. Scan the full homonym
6036 -- chain, the candidate package may be anywhere on it.
6038 if Present
(Homonym
(Current_Entity
(P_Name
))) then
6040 P_Name
:= Current_Entity
(P_Name
);
6042 while Present
(P_Name
) loop
6043 exit when Ekind
(P_Name
) = E_Package
;
6044 P_Name
:= Homonym
(P_Name
);
6047 if Present
(P_Name
) then
6048 Error_Msg_Sloc
:= Sloc
(Entity
(Prefix
(N
)));
6051 ("package& is hidden by declaration#",
6054 Set_Entity
(Prefix
(N
), P_Name
);
6055 Find_Expanded_Name
(N
);
6058 P_Name
:= Entity
(Prefix
(N
));
6063 ("invalid prefix in selected component&", N
, P_Name
);
6064 Change_Selected_Component_To_Expanded_Name
(N
);
6065 Set_Entity
(N
, Any_Id
);
6066 Set_Etype
(N
, Any_Type
);
6069 Nam
:= New_Copy
(P
);
6070 Save_Interps
(P
, Nam
);
6072 Make_Function_Call
(Sloc
(P
), Name
=> Nam
));
6074 Analyze_Selected_Component
(N
);
6078 -- Remaining cases generate various error messages
6081 -- Format node as expanded name, to avoid cascaded errors
6083 Change_Selected_Component_To_Expanded_Name
(N
);
6084 Set_Entity
(N
, Any_Id
);
6085 Set_Etype
(N
, Any_Type
);
6087 -- Issue error message, but avoid this if error issued already.
6088 -- Use identifier of prefix if one is available.
6090 if P_Name
= Any_Id
then
6093 elsif Ekind
(P_Name
) = E_Void
then
6094 Premature_Usage
(P
);
6096 elsif Nkind
(P
) /= N_Attribute_Reference
then
6098 "invalid prefix in selected component&", P
);
6100 if Is_Access_Type
(P_Type
)
6101 and then Ekind
(Designated_Type
(P_Type
)) = E_Incomplete_Type
6104 ("\dereference must not be of an incomplete type " &
6110 "invalid prefix in selected component", P
);
6114 -- Selector name is restricted in SPARK
6116 if Nkind
(N
) = N_Expanded_Name
6117 and then Restriction_Check_Required
(SPARK
)
6119 if Is_Subprogram
(P_Name
) then
6120 Check_SPARK_Restriction
6121 ("prefix of expanded name cannot be a subprogram", P
);
6122 elsif Ekind
(P_Name
) = E_Loop
then
6123 Check_SPARK_Restriction
6124 ("prefix of expanded name cannot be a loop statement", P
);
6129 -- If prefix is not the name of an entity, it must be an expression,
6130 -- whose type is appropriate for a record. This is determined by
6133 Analyze_Selected_Component
(N
);
6135 end Find_Selected_Component
;
6141 procedure Find_Type
(N
: Node_Id
) is
6151 elsif Nkind
(N
) = N_Attribute_Reference
then
6153 -- Class attribute. This is not valid in Ada 83 mode, but we do not
6154 -- need to enforce that at this point, since the declaration of the
6155 -- tagged type in the prefix would have been flagged already.
6157 if Attribute_Name
(N
) = Name_Class
then
6158 Check_Restriction
(No_Dispatch
, N
);
6159 Find_Type
(Prefix
(N
));
6161 -- Propagate error from bad prefix
6163 if Etype
(Prefix
(N
)) = Any_Type
then
6164 Set_Entity
(N
, Any_Type
);
6165 Set_Etype
(N
, Any_Type
);
6169 T
:= Base_Type
(Entity
(Prefix
(N
)));
6171 -- Case where type is not known to be tagged. Its appearance in
6172 -- the prefix of the 'Class attribute indicates that the full view
6175 if not Is_Tagged_Type
(T
) then
6176 if Ekind
(T
) = E_Incomplete_Type
then
6178 -- It is legal to denote the class type of an incomplete
6179 -- type. The full type will have to be tagged, of course.
6180 -- In Ada 2005 this usage is declared obsolescent, so we
6181 -- warn accordingly. This usage is only legal if the type
6182 -- is completed in the current scope, and not for a limited
6185 if Ada_Version
>= Ada_2005
then
6187 -- Test whether the Available_View of a limited type view
6188 -- is tagged, since the limited view may not be marked as
6189 -- tagged if the type itself has an untagged incomplete
6190 -- type view in its package.
6192 if From_With_Type
(T
)
6193 and then not Is_Tagged_Type
(Available_View
(T
))
6196 ("prefix of Class attribute must be tagged", N
);
6197 Set_Etype
(N
, Any_Type
);
6198 Set_Entity
(N
, Any_Type
);
6201 -- ??? This test is temporarily disabled (always False)
6202 -- because it causes an unwanted warning on GNAT sources
6203 -- (built with -gnatg, which includes Warn_On_Obsolescent_
6204 -- Feature). Once this issue is cleared in the sources, it
6207 elsif Warn_On_Obsolescent_Feature
6211 ("applying 'Class to an untagged incomplete type"
6212 & " is an obsolescent feature (RM J.11)", N
);
6216 Set_Is_Tagged_Type
(T
);
6217 Set_Direct_Primitive_Operations
(T
, New_Elmt_List
);
6218 Make_Class_Wide_Type
(T
);
6219 Set_Entity
(N
, Class_Wide_Type
(T
));
6220 Set_Etype
(N
, Class_Wide_Type
(T
));
6222 elsif Ekind
(T
) = E_Private_Type
6223 and then not Is_Generic_Type
(T
)
6224 and then In_Private_Part
(Scope
(T
))
6226 -- The Class attribute can be applied to an untagged private
6227 -- type fulfilled by a tagged type prior to the full type
6228 -- declaration (but only within the parent package's private
6229 -- part). Create the class-wide type now and check that the
6230 -- full type is tagged later during its analysis. Note that
6231 -- we do not mark the private type as tagged, unlike the
6232 -- case of incomplete types, because the type must still
6233 -- appear untagged to outside units.
6235 if No
(Class_Wide_Type
(T
)) then
6236 Make_Class_Wide_Type
(T
);
6239 Set_Entity
(N
, Class_Wide_Type
(T
));
6240 Set_Etype
(N
, Class_Wide_Type
(T
));
6243 -- Should we introduce a type Any_Tagged and use Wrong_Type
6244 -- here, it would be a bit more consistent???
6247 ("tagged type required, found}",
6248 Prefix
(N
), First_Subtype
(T
));
6249 Set_Entity
(N
, Any_Type
);
6253 -- Case of tagged type
6256 if Is_Concurrent_Type
(T
) then
6257 if No
(Corresponding_Record_Type
(Entity
(Prefix
(N
)))) then
6259 -- Previous error. Use current type, which at least
6260 -- provides some operations.
6262 C
:= Entity
(Prefix
(N
));
6265 C
:= Class_Wide_Type
6266 (Corresponding_Record_Type
(Entity
(Prefix
(N
))));
6270 C
:= Class_Wide_Type
(Entity
(Prefix
(N
)));
6273 Set_Entity_With_Style_Check
(N
, C
);
6274 Generate_Reference
(C
, N
);
6278 -- Base attribute, not allowed in Ada 83
6280 elsif Attribute_Name
(N
) = Name_Base
then
6281 Error_Msg_Name_1
:= Name_Base
;
6282 Check_SPARK_Restriction
6283 ("attribute% is only allowed as prefix of another attribute", N
);
6285 if Ada_Version
= Ada_83
and then Comes_From_Source
(N
) then
6287 ("(Ada 83) Base attribute not allowed in subtype mark", N
);
6290 Find_Type
(Prefix
(N
));
6291 Typ
:= Entity
(Prefix
(N
));
6293 if Ada_Version
>= Ada_95
6294 and then not Is_Scalar_Type
(Typ
)
6295 and then not Is_Generic_Type
(Typ
)
6298 ("prefix of Base attribute must be scalar type",
6301 elsif Warn_On_Redundant_Constructs
6302 and then Base_Type
(Typ
) = Typ
6304 Error_Msg_NE
-- CODEFIX
6305 ("?redundant attribute, & is its own base type", N
, Typ
);
6308 T
:= Base_Type
(Typ
);
6310 -- Rewrite attribute reference with type itself (see similar
6311 -- processing in Analyze_Attribute, case Base). Preserve prefix
6312 -- if present, for other legality checks.
6314 if Nkind
(Prefix
(N
)) = N_Expanded_Name
then
6316 Make_Expanded_Name
(Sloc
(N
),
6318 Prefix
=> New_Copy
(Prefix
(Prefix
(N
))),
6319 Selector_Name
=> New_Reference_To
(T
, Sloc
(N
))));
6322 Rewrite
(N
, New_Reference_To
(T
, Sloc
(N
)));
6329 elsif Attribute_Name
(N
) = Name_Stub_Type
then
6331 -- This is handled in Analyze_Attribute
6335 -- All other attributes are invalid in a subtype mark
6338 Error_Msg_N
("invalid attribute in subtype mark", N
);
6344 if Is_Entity_Name
(N
) then
6345 T_Name
:= Entity
(N
);
6347 Error_Msg_N
("subtype mark required in this context", N
);
6348 Set_Etype
(N
, Any_Type
);
6352 if T_Name
= Any_Id
or else Etype
(N
) = Any_Type
then
6354 -- Undefined id. Make it into a valid type
6356 Set_Entity
(N
, Any_Type
);
6358 elsif not Is_Type
(T_Name
)
6359 and then T_Name
/= Standard_Void_Type
6361 Error_Msg_Sloc
:= Sloc
(T_Name
);
6362 Error_Msg_N
("subtype mark required in this context", N
);
6363 Error_Msg_NE
("\\found & declared#", N
, T_Name
);
6364 Set_Entity
(N
, Any_Type
);
6367 -- If the type is an incomplete type created to handle
6368 -- anonymous access components of a record type, then the
6369 -- incomplete type is the visible entity and subsequent
6370 -- references will point to it. Mark the original full
6371 -- type as referenced, to prevent spurious warnings.
6373 if Is_Incomplete_Type
(T_Name
)
6374 and then Present
(Full_View
(T_Name
))
6375 and then not Comes_From_Source
(T_Name
)
6377 Set_Referenced
(Full_View
(T_Name
));
6380 T_Name
:= Get_Full_View
(T_Name
);
6382 -- Ada 2005 (AI-251, AI-50217): Handle interfaces visible through
6383 -- limited-with clauses
6385 if From_With_Type
(T_Name
)
6386 and then Ekind
(T_Name
) in Incomplete_Kind
6387 and then Present
(Non_Limited_View
(T_Name
))
6388 and then Is_Interface
(Non_Limited_View
(T_Name
))
6390 T_Name
:= Non_Limited_View
(T_Name
);
6393 if In_Open_Scopes
(T_Name
) then
6394 if Ekind
(Base_Type
(T_Name
)) = E_Task_Type
then
6396 -- In Ada 2005, a task name can be used in an access
6397 -- definition within its own body. It cannot be used
6398 -- in the discriminant part of the task declaration,
6399 -- nor anywhere else in the declaration because entries
6400 -- cannot have access parameters.
6402 if Ada_Version
>= Ada_2005
6403 and then Nkind
(Parent
(N
)) = N_Access_Definition
6405 Set_Entity
(N
, T_Name
);
6406 Set_Etype
(N
, T_Name
);
6408 if Has_Completion
(T_Name
) then
6413 ("task type cannot be used as type mark " &
6414 "within its own declaration", N
);
6419 ("task type cannot be used as type mark " &
6420 "within its own spec or body", N
);
6423 elsif Ekind
(Base_Type
(T_Name
)) = E_Protected_Type
then
6425 -- In Ada 2005, a protected name can be used in an access
6426 -- definition within its own body.
6428 if Ada_Version
>= Ada_2005
6429 and then Nkind
(Parent
(N
)) = N_Access_Definition
6431 Set_Entity
(N
, T_Name
);
6432 Set_Etype
(N
, T_Name
);
6437 ("protected type cannot be used as type mark " &
6438 "within its own spec or body", N
);
6442 Error_Msg_N
("type declaration cannot refer to itself", N
);
6445 Set_Etype
(N
, Any_Type
);
6446 Set_Entity
(N
, Any_Type
);
6447 Set_Error_Posted
(T_Name
);
6451 Set_Entity
(N
, T_Name
);
6452 Set_Etype
(N
, T_Name
);
6456 if Present
(Etype
(N
)) and then Comes_From_Source
(N
) then
6457 if Is_Fixed_Point_Type
(Etype
(N
)) then
6458 Check_Restriction
(No_Fixed_Point
, N
);
6459 elsif Is_Floating_Point_Type
(Etype
(N
)) then
6460 Check_Restriction
(No_Floating_Point
, N
);
6465 ------------------------------------
6466 -- Has_Implicit_Character_Literal --
6467 ------------------------------------
6469 function Has_Implicit_Character_Literal
(N
: Node_Id
) return Boolean is
6471 Found
: Boolean := False;
6472 P
: constant Entity_Id
:= Entity
(Prefix
(N
));
6473 Priv_Id
: Entity_Id
:= Empty
;
6476 if Ekind
(P
) = E_Package
6477 and then not In_Open_Scopes
(P
)
6479 Priv_Id
:= First_Private_Entity
(P
);
6482 if P
= Standard_Standard
then
6483 Change_Selected_Component_To_Expanded_Name
(N
);
6484 Rewrite
(N
, Selector_Name
(N
));
6486 Set_Etype
(Original_Node
(N
), Standard_Character
);
6490 Id
:= First_Entity
(P
);
6492 and then Id
/= Priv_Id
6494 if Is_Standard_Character_Type
(Id
) and then Is_Base_Type
(Id
) then
6496 -- We replace the node with the literal itself, resolve as a
6497 -- character, and set the type correctly.
6500 Change_Selected_Component_To_Expanded_Name
(N
);
6501 Rewrite
(N
, Selector_Name
(N
));
6504 Set_Etype
(Original_Node
(N
), Id
);
6508 -- More than one type derived from Character in given scope.
6509 -- Collect all possible interpretations.
6511 Add_One_Interp
(N
, Id
, Id
);
6519 end Has_Implicit_Character_Literal
;
6521 ----------------------
6522 -- Has_Private_With --
6523 ----------------------
6525 function Has_Private_With
(E
: Entity_Id
) return Boolean is
6526 Comp_Unit
: constant Node_Id
:= Cunit
(Current_Sem_Unit
);
6530 Item
:= First
(Context_Items
(Comp_Unit
));
6531 while Present
(Item
) loop
6532 if Nkind
(Item
) = N_With_Clause
6533 and then Private_Present
(Item
)
6534 and then Entity
(Name
(Item
)) = E
6543 end Has_Private_With
;
6545 ---------------------------
6546 -- Has_Implicit_Operator --
6547 ---------------------------
6549 function Has_Implicit_Operator
(N
: Node_Id
) return Boolean is
6550 Op_Id
: constant Name_Id
:= Chars
(Selector_Name
(N
));
6551 P
: constant Entity_Id
:= Entity
(Prefix
(N
));
6553 Priv_Id
: Entity_Id
:= Empty
;
6555 procedure Add_Implicit_Operator
6557 Op_Type
: Entity_Id
:= Empty
);
6558 -- Add implicit interpretation to node N, using the type for which a
6559 -- predefined operator exists. If the operator yields a boolean type,
6560 -- the Operand_Type is implicitly referenced by the operator, and a
6561 -- reference to it must be generated.
6563 ---------------------------
6564 -- Add_Implicit_Operator --
6565 ---------------------------
6567 procedure Add_Implicit_Operator
6569 Op_Type
: Entity_Id
:= Empty
)
6571 Predef_Op
: Entity_Id
;
6574 Predef_Op
:= Current_Entity
(Selector_Name
(N
));
6576 while Present
(Predef_Op
)
6577 and then Scope
(Predef_Op
) /= Standard_Standard
6579 Predef_Op
:= Homonym
(Predef_Op
);
6582 if Nkind
(N
) = N_Selected_Component
then
6583 Change_Selected_Component_To_Expanded_Name
(N
);
6586 -- If the context is an unanalyzed function call, determine whether
6587 -- a binary or unary interpretation is required.
6589 if Nkind
(Parent
(N
)) = N_Indexed_Component
then
6591 Is_Binary_Call
: constant Boolean :=
6593 (Next
(First
(Expressions
(Parent
(N
)))));
6594 Is_Binary_Op
: constant Boolean :=
6596 (Predef_Op
) /= Last_Entity
(Predef_Op
);
6597 Predef_Op2
: constant Entity_Id
:= Homonym
(Predef_Op
);
6600 if Is_Binary_Call
then
6601 if Is_Binary_Op
then
6602 Add_One_Interp
(N
, Predef_Op
, T
);
6604 Add_One_Interp
(N
, Predef_Op2
, T
);
6608 if not Is_Binary_Op
then
6609 Add_One_Interp
(N
, Predef_Op
, T
);
6611 Add_One_Interp
(N
, Predef_Op2
, T
);
6617 Add_One_Interp
(N
, Predef_Op
, T
);
6619 -- For operators with unary and binary interpretations, if
6620 -- context is not a call, add both
6622 if Present
(Homonym
(Predef_Op
)) then
6623 Add_One_Interp
(N
, Homonym
(Predef_Op
), T
);
6627 -- The node is a reference to a predefined operator, and
6628 -- an implicit reference to the type of its operands.
6630 if Present
(Op_Type
) then
6631 Generate_Operator_Reference
(N
, Op_Type
);
6633 Generate_Operator_Reference
(N
, T
);
6635 end Add_Implicit_Operator
;
6637 -- Start of processing for Has_Implicit_Operator
6640 if Ekind
(P
) = E_Package
6641 and then not In_Open_Scopes
(P
)
6643 Priv_Id
:= First_Private_Entity
(P
);
6646 Id
:= First_Entity
(P
);
6650 -- Boolean operators: an implicit declaration exists if the scope
6651 -- contains a declaration for a derived Boolean type, or for an
6652 -- array of Boolean type.
6654 when Name_Op_And | Name_Op_Not | Name_Op_Or | Name_Op_Xor
=>
6655 while Id
/= Priv_Id
loop
6656 if Valid_Boolean_Arg
(Id
) and then Is_Base_Type
(Id
) then
6657 Add_Implicit_Operator
(Id
);
6664 -- Equality: look for any non-limited type (result is Boolean)
6666 when Name_Op_Eq | Name_Op_Ne
=>
6667 while Id
/= Priv_Id
loop
6669 and then not Is_Limited_Type
(Id
)
6670 and then Is_Base_Type
(Id
)
6672 Add_Implicit_Operator
(Standard_Boolean
, Id
);
6679 -- Comparison operators: scalar type, or array of scalar
6681 when Name_Op_Lt | Name_Op_Le | Name_Op_Gt | Name_Op_Ge
=>
6682 while Id
/= Priv_Id
loop
6683 if (Is_Scalar_Type
(Id
)
6684 or else (Is_Array_Type
(Id
)
6685 and then Is_Scalar_Type
(Component_Type
(Id
))))
6686 and then Is_Base_Type
(Id
)
6688 Add_Implicit_Operator
(Standard_Boolean
, Id
);
6695 -- Arithmetic operators: any numeric type
6705 while Id
/= Priv_Id
loop
6706 if Is_Numeric_Type
(Id
) and then Is_Base_Type
(Id
) then
6707 Add_Implicit_Operator
(Id
);
6714 -- Concatenation: any one-dimensional array type
6716 when Name_Op_Concat
=>
6717 while Id
/= Priv_Id
loop
6718 if Is_Array_Type
(Id
)
6719 and then Number_Dimensions
(Id
) = 1
6720 and then Is_Base_Type
(Id
)
6722 Add_Implicit_Operator
(Id
);
6729 -- What is the others condition here? Should we be using a
6730 -- subtype of Name_Id that would restrict to operators ???
6732 when others => null;
6735 -- If we fall through, then we do not have an implicit operator
6739 end Has_Implicit_Operator
;
6741 -----------------------------------
6742 -- Has_Loop_In_Inner_Open_Scopes --
6743 -----------------------------------
6745 function Has_Loop_In_Inner_Open_Scopes
(S
: Entity_Id
) return Boolean is
6747 -- Several scope stacks are maintained by Scope_Stack. The base of the
6748 -- currently active scope stack is denoted by the Is_Active_Stack_Base
6749 -- flag in the scope stack entry. Note that the scope stacks used to
6750 -- simply be delimited implicitly by the presence of Standard_Standard
6751 -- at their base, but there now are cases where this is not sufficient
6752 -- because Standard_Standard actually may appear in the middle of the
6753 -- active set of scopes.
6755 for J
in reverse 0 .. Scope_Stack
.Last
loop
6757 -- S was reached without seing a loop scope first
6759 if Scope_Stack
.Table
(J
).Entity
= S
then
6762 -- S was not yet reached, so it contains at least one inner loop
6764 elsif Ekind
(Scope_Stack
.Table
(J
).Entity
) = E_Loop
then
6768 -- Check Is_Active_Stack_Base to tell us when to stop, as there are
6769 -- cases where Standard_Standard appears in the middle of the active
6770 -- set of scopes. This affects the declaration and overriding of
6771 -- private inherited operations in instantiations of generic child
6774 pragma Assert
(not Scope_Stack
.Table
(J
).Is_Active_Stack_Base
);
6777 raise Program_Error
; -- unreachable
6778 end Has_Loop_In_Inner_Open_Scopes
;
6780 --------------------
6781 -- In_Open_Scopes --
6782 --------------------
6784 function In_Open_Scopes
(S
: Entity_Id
) return Boolean is
6786 -- Several scope stacks are maintained by Scope_Stack. The base of the
6787 -- currently active scope stack is denoted by the Is_Active_Stack_Base
6788 -- flag in the scope stack entry. Note that the scope stacks used to
6789 -- simply be delimited implicitly by the presence of Standard_Standard
6790 -- at their base, but there now are cases where this is not sufficient
6791 -- because Standard_Standard actually may appear in the middle of the
6792 -- active set of scopes.
6794 for J
in reverse 0 .. Scope_Stack
.Last
loop
6795 if Scope_Stack
.Table
(J
).Entity
= S
then
6799 -- Check Is_Active_Stack_Base to tell us when to stop, as there are
6800 -- cases where Standard_Standard appears in the middle of the active
6801 -- set of scopes. This affects the declaration and overriding of
6802 -- private inherited operations in instantiations of generic child
6805 exit when Scope_Stack
.Table
(J
).Is_Active_Stack_Base
;
6811 -----------------------------
6812 -- Inherit_Renamed_Profile --
6813 -----------------------------
6815 procedure Inherit_Renamed_Profile
(New_S
: Entity_Id
; Old_S
: Entity_Id
) is
6822 if Ekind
(Old_S
) = E_Operator
then
6823 New_F
:= First_Formal
(New_S
);
6825 while Present
(New_F
) loop
6826 Set_Etype
(New_F
, Base_Type
(Etype
(New_F
)));
6827 Next_Formal
(New_F
);
6830 Set_Etype
(New_S
, Base_Type
(Etype
(New_S
)));
6833 New_F
:= First_Formal
(New_S
);
6834 Old_F
:= First_Formal
(Old_S
);
6836 while Present
(New_F
) loop
6837 New_T
:= Etype
(New_F
);
6838 Old_T
:= Etype
(Old_F
);
6840 -- If the new type is a renaming of the old one, as is the
6841 -- case for actuals in instances, retain its name, to simplify
6842 -- later disambiguation.
6844 if Nkind
(Parent
(New_T
)) = N_Subtype_Declaration
6845 and then Is_Entity_Name
(Subtype_Indication
(Parent
(New_T
)))
6846 and then Entity
(Subtype_Indication
(Parent
(New_T
))) = Old_T
6850 Set_Etype
(New_F
, Old_T
);
6853 Next_Formal
(New_F
);
6854 Next_Formal
(Old_F
);
6857 if Ekind_In
(Old_S
, E_Function
, E_Enumeration_Literal
) then
6858 Set_Etype
(New_S
, Etype
(Old_S
));
6861 end Inherit_Renamed_Profile
;
6867 procedure Initialize
is
6872 -------------------------
6873 -- Install_Use_Clauses --
6874 -------------------------
6876 procedure Install_Use_Clauses
6878 Force_Installation
: Boolean := False)
6886 while Present
(U
) loop
6888 -- Case of USE package
6890 if Nkind
(U
) = N_Use_Package_Clause
then
6891 P
:= First
(Names
(U
));
6892 while Present
(P
) loop
6895 if Ekind
(Id
) = E_Package
then
6897 Note_Redundant_Use
(P
);
6899 elsif Present
(Renamed_Object
(Id
))
6900 and then In_Use
(Renamed_Object
(Id
))
6902 Note_Redundant_Use
(P
);
6904 elsif Force_Installation
or else Applicable_Use
(P
) then
6905 Use_One_Package
(Id
, U
);
6916 P
:= First
(Subtype_Marks
(U
));
6917 while Present
(P
) loop
6918 if not Is_Entity_Name
(P
)
6919 or else No
(Entity
(P
))
6923 elsif Entity
(P
) /= Any_Type
then
6931 Next_Use_Clause
(U
);
6933 end Install_Use_Clauses
;
6935 -------------------------------------
6936 -- Is_Appropriate_For_Entry_Prefix --
6937 -------------------------------------
6939 function Is_Appropriate_For_Entry_Prefix
(T
: Entity_Id
) return Boolean is
6940 P_Type
: Entity_Id
:= T
;
6943 if Is_Access_Type
(P_Type
) then
6944 P_Type
:= Designated_Type
(P_Type
);
6947 return Is_Task_Type
(P_Type
) or else Is_Protected_Type
(P_Type
);
6948 end Is_Appropriate_For_Entry_Prefix
;
6950 -------------------------------
6951 -- Is_Appropriate_For_Record --
6952 -------------------------------
6954 function Is_Appropriate_For_Record
(T
: Entity_Id
) return Boolean is
6956 function Has_Components
(T1
: Entity_Id
) return Boolean;
6957 -- Determine if given type has components (i.e. is either a record
6958 -- type or a type that has discriminants).
6960 --------------------
6961 -- Has_Components --
6962 --------------------
6964 function Has_Components
(T1
: Entity_Id
) return Boolean is
6966 return Is_Record_Type
(T1
)
6967 or else (Is_Private_Type
(T1
) and then Has_Discriminants
(T1
))
6968 or else (Is_Task_Type
(T1
) and then Has_Discriminants
(T1
))
6969 or else (Is_Incomplete_Type
(T1
)
6970 and then From_With_Type
(T1
)
6971 and then Present
(Non_Limited_View
(T1
))
6972 and then Is_Record_Type
6973 (Get_Full_View
(Non_Limited_View
(T1
))));
6976 -- Start of processing for Is_Appropriate_For_Record
6981 and then (Has_Components
(T
)
6982 or else (Is_Access_Type
(T
)
6983 and then Has_Components
(Designated_Type
(T
))));
6984 end Is_Appropriate_For_Record
;
6986 ------------------------
6987 -- Note_Redundant_Use --
6988 ------------------------
6990 procedure Note_Redundant_Use
(Clause
: Node_Id
) is
6991 Pack_Name
: constant Entity_Id
:= Entity
(Clause
);
6992 Cur_Use
: constant Node_Id
:= Current_Use_Clause
(Pack_Name
);
6993 Decl
: constant Node_Id
:= Parent
(Clause
);
6995 Prev_Use
: Node_Id
:= Empty
;
6996 Redundant
: Node_Id
:= Empty
;
6997 -- The Use_Clause which is actually redundant. In the simplest case it
6998 -- is Pack itself, but when we compile a body we install its context
6999 -- before that of its spec, in which case it is the use_clause in the
7000 -- spec that will appear to be redundant, and we want the warning to be
7001 -- placed on the body. Similar complications appear when the redundancy
7002 -- is between a child unit and one of its ancestors.
7005 Set_Redundant_Use
(Clause
, True);
7007 if not Comes_From_Source
(Clause
)
7009 or else not Warn_On_Redundant_Constructs
7014 if not Is_Compilation_Unit
(Current_Scope
) then
7016 -- If the use_clause is in an inner scope, it is made redundant by
7017 -- some clause in the current context, with one exception: If we're
7018 -- compiling a nested package body, and the use_clause comes from the
7019 -- corresponding spec, the clause is not necessarily fully redundant,
7020 -- so we should not warn. If a warning was warranted, it would have
7021 -- been given when the spec was processed.
7023 if Nkind
(Parent
(Decl
)) = N_Package_Specification
then
7025 Package_Spec_Entity
: constant Entity_Id
:=
7026 Defining_Unit_Name
(Parent
(Decl
));
7028 if In_Package_Body
(Package_Spec_Entity
) then
7034 Redundant
:= Clause
;
7035 Prev_Use
:= Cur_Use
;
7037 elsif Nkind
(Unit
(Cunit
(Current_Sem_Unit
))) = N_Package_Body
then
7039 Cur_Unit
: constant Unit_Number_Type
:= Get_Source_Unit
(Cur_Use
);
7040 New_Unit
: constant Unit_Number_Type
:= Get_Source_Unit
(Clause
);
7044 if Cur_Unit
= New_Unit
then
7046 -- Redundant clause in same body
7048 Redundant
:= Clause
;
7049 Prev_Use
:= Cur_Use
;
7051 elsif Cur_Unit
= Current_Sem_Unit
then
7053 -- If the new clause is not in the current unit it has been
7054 -- analyzed first, and it makes the other one redundant.
7055 -- However, if the new clause appears in a subunit, Cur_Unit
7056 -- is still the parent, and in that case the redundant one
7057 -- is the one appearing in the subunit.
7059 if Nkind
(Unit
(Cunit
(New_Unit
))) = N_Subunit
then
7060 Redundant
:= Clause
;
7061 Prev_Use
:= Cur_Use
;
7063 -- Most common case: redundant clause in body,
7064 -- original clause in spec. Current scope is spec entity.
7069 Unit
(Library_Unit
(Cunit
(Current_Sem_Unit
))))
7071 Redundant
:= Cur_Use
;
7075 -- The new clause may appear in an unrelated unit, when
7076 -- the parents of a generic are being installed prior to
7077 -- instantiation. In this case there must be no warning.
7078 -- We detect this case by checking whether the current top
7079 -- of the stack is related to the current compilation.
7081 Scop
:= Current_Scope
;
7082 while Present
(Scop
)
7083 and then Scop
/= Standard_Standard
7085 if Is_Compilation_Unit
(Scop
)
7086 and then not Is_Child_Unit
(Scop
)
7090 elsif Scop
= Cunit_Entity
(Current_Sem_Unit
) then
7094 Scop
:= Scope
(Scop
);
7097 Redundant
:= Cur_Use
;
7101 elsif New_Unit
= Current_Sem_Unit
then
7102 Redundant
:= Clause
;
7103 Prev_Use
:= Cur_Use
;
7106 -- Neither is the current unit, so they appear in parent or
7107 -- sibling units. Warning will be emitted elsewhere.
7113 elsif Nkind
(Unit
(Cunit
(Current_Sem_Unit
))) = N_Package_Declaration
7114 and then Present
(Parent_Spec
(Unit
(Cunit
(Current_Sem_Unit
))))
7116 -- Use_clause is in child unit of current unit, and the child unit
7117 -- appears in the context of the body of the parent, so it has been
7118 -- installed first, even though it is the redundant one. Depending on
7119 -- their placement in the context, the visible or the private parts
7120 -- of the two units, either might appear as redundant, but the
7121 -- message has to be on the current unit.
7123 if Get_Source_Unit
(Cur_Use
) = Current_Sem_Unit
then
7124 Redundant
:= Cur_Use
;
7127 Redundant
:= Clause
;
7128 Prev_Use
:= Cur_Use
;
7131 -- If the new use clause appears in the private part of a parent unit
7132 -- it may appear to be redundant w.r.t. a use clause in a child unit,
7133 -- but the previous use clause was needed in the visible part of the
7134 -- child, and no warning should be emitted.
7136 if Nkind
(Parent
(Decl
)) = N_Package_Specification
7138 List_Containing
(Decl
) = Private_Declarations
(Parent
(Decl
))
7141 Par
: constant Entity_Id
:= Defining_Entity
(Parent
(Decl
));
7142 Spec
: constant Node_Id
:=
7143 Specification
(Unit
(Cunit
(Current_Sem_Unit
)));
7146 if Is_Compilation_Unit
(Par
)
7147 and then Par
/= Cunit_Entity
(Current_Sem_Unit
)
7148 and then Parent
(Cur_Use
) = Spec
7150 List_Containing
(Cur_Use
) = Visible_Declarations
(Spec
)
7157 -- Finally, if the current use clause is in the context then
7158 -- the clause is redundant when it is nested within the unit.
7160 elsif Nkind
(Parent
(Cur_Use
)) = N_Compilation_Unit
7161 and then Nkind
(Parent
(Parent
(Clause
))) /= N_Compilation_Unit
7162 and then Get_Source_Unit
(Cur_Use
) = Get_Source_Unit
(Clause
)
7164 Redundant
:= Clause
;
7165 Prev_Use
:= Cur_Use
;
7171 if Present
(Redundant
) then
7172 Error_Msg_Sloc
:= Sloc
(Prev_Use
);
7173 Error_Msg_NE
-- CODEFIX
7174 ("& is already use-visible through previous use clause #?",
7175 Redundant
, Pack_Name
);
7177 end Note_Redundant_Use
;
7183 procedure Pop_Scope
is
7184 SST
: Scope_Stack_Entry
renames Scope_Stack
.Table
(Scope_Stack
.Last
);
7185 S
: constant Entity_Id
:= SST
.Entity
;
7188 if Debug_Flag_E
then
7192 -- Set Default_Storage_Pool field of the library unit if necessary
7194 if Ekind_In
(S
, E_Package
, E_Generic_Package
)
7196 Nkind
(Parent
(Unit_Declaration_Node
(S
))) = N_Compilation_Unit
7199 Aux
: constant Node_Id
:=
7200 Aux_Decls_Node
(Parent
(Unit_Declaration_Node
(S
)));
7202 if No
(Default_Storage_Pool
(Aux
)) then
7203 Set_Default_Storage_Pool
(Aux
, Default_Pool
);
7208 Scope_Suppress
:= SST
.Save_Scope_Suppress
;
7209 Local_Suppress_Stack_Top
:= SST
.Save_Local_Suppress_Stack_Top
;
7210 Check_Policy_List
:= SST
.Save_Check_Policy_List
;
7211 Default_Pool
:= SST
.Save_Default_Storage_Pool
;
7213 if Debug_Flag_W
then
7214 Write_Str
("<-- exiting scope: ");
7215 Write_Name
(Chars
(Current_Scope
));
7216 Write_Str
(", Depth=");
7217 Write_Int
(Int
(Scope_Stack
.Last
));
7221 End_Use_Clauses
(SST
.First_Use_Clause
);
7223 -- If the actions to be wrapped are still there they will get lost
7224 -- causing incomplete code to be generated. It is better to abort in
7225 -- this case (and we do the abort even with assertions off since the
7226 -- penalty is incorrect code generation).
7228 if SST
.Actions_To_Be_Wrapped_Before
/= No_List
7230 SST
.Actions_To_Be_Wrapped_After
/= No_List
7232 raise Program_Error
;
7235 -- Free last subprogram name if allocated, and pop scope
7237 Free
(SST
.Last_Subprogram_Name
);
7238 Scope_Stack
.Decrement_Last
;
7245 procedure Push_Scope
(S
: Entity_Id
) is
7246 E
: constant Entity_Id
:= Scope
(S
);
7249 if Ekind
(S
) = E_Void
then
7252 -- Set scope depth if not a non-concurrent type, and we have not yet set
7253 -- the scope depth. This means that we have the first occurrence of the
7254 -- scope, and this is where the depth is set.
7256 elsif (not Is_Type
(S
) or else Is_Concurrent_Type
(S
))
7257 and then not Scope_Depth_Set
(S
)
7259 if S
= Standard_Standard
then
7260 Set_Scope_Depth_Value
(S
, Uint_0
);
7262 elsif Is_Child_Unit
(S
) then
7263 Set_Scope_Depth_Value
(S
, Uint_1
);
7265 elsif not Is_Record_Type
(Current_Scope
) then
7266 if Ekind
(S
) = E_Loop
then
7267 Set_Scope_Depth_Value
(S
, Scope_Depth
(Current_Scope
));
7269 Set_Scope_Depth_Value
(S
, Scope_Depth
(Current_Scope
) + 1);
7274 Scope_Stack
.Increment_Last
;
7277 SST
: Scope_Stack_Entry
renames Scope_Stack
.Table
(Scope_Stack
.Last
);
7281 SST
.Save_Scope_Suppress
:= Scope_Suppress
;
7282 SST
.Save_Local_Suppress_Stack_Top
:= Local_Suppress_Stack_Top
;
7283 SST
.Save_Check_Policy_List
:= Check_Policy_List
;
7284 SST
.Save_Default_Storage_Pool
:= Default_Pool
;
7286 if Scope_Stack
.Last
> Scope_Stack
.First
then
7287 SST
.Component_Alignment_Default
:= Scope_Stack
.Table
7288 (Scope_Stack
.Last
- 1).
7289 Component_Alignment_Default
;
7292 SST
.Last_Subprogram_Name
:= null;
7293 SST
.Is_Transient
:= False;
7294 SST
.Node_To_Be_Wrapped
:= Empty
;
7295 SST
.Pending_Freeze_Actions
:= No_List
;
7296 SST
.Actions_To_Be_Wrapped_Before
:= No_List
;
7297 SST
.Actions_To_Be_Wrapped_After
:= No_List
;
7298 SST
.First_Use_Clause
:= Empty
;
7299 SST
.Is_Active_Stack_Base
:= False;
7300 SST
.Previous_Visibility
:= False;
7303 if Debug_Flag_W
then
7304 Write_Str
("--> new scope: ");
7305 Write_Name
(Chars
(Current_Scope
));
7306 Write_Str
(", Id=");
7307 Write_Int
(Int
(Current_Scope
));
7308 Write_Str
(", Depth=");
7309 Write_Int
(Int
(Scope_Stack
.Last
));
7313 -- Deal with copying flags from the previous scope to this one. This is
7314 -- not necessary if either scope is standard, or if the new scope is a
7317 if S
/= Standard_Standard
7318 and then Scope
(S
) /= Standard_Standard
7319 and then not Is_Child_Unit
(S
)
7321 if Nkind
(E
) not in N_Entity
then
7325 -- Copy categorization flags from Scope (S) to S, this is not done
7326 -- when Scope (S) is Standard_Standard since propagation is from
7327 -- library unit entity inwards. Copy other relevant attributes as
7328 -- well (Discard_Names in particular).
7330 -- We only propagate inwards for library level entities,
7331 -- inner level subprograms do not inherit the categorization.
7333 if Is_Library_Level_Entity
(S
) then
7334 Set_Is_Preelaborated
(S
, Is_Preelaborated
(E
));
7335 Set_Is_Shared_Passive
(S
, Is_Shared_Passive
(E
));
7336 Set_Discard_Names
(S
, Discard_Names
(E
));
7337 Set_Suppress_Value_Tracking_On_Call
7338 (S
, Suppress_Value_Tracking_On_Call
(E
));
7339 Set_Categorization_From_Scope
(E
=> S
, Scop
=> E
);
7343 if Is_Child_Unit
(S
)
7344 and then Present
(E
)
7345 and then Ekind_In
(E
, E_Package
, E_Generic_Package
)
7347 Nkind
(Parent
(Unit_Declaration_Node
(E
))) = N_Compilation_Unit
7350 Aux
: constant Node_Id
:=
7351 Aux_Decls_Node
(Parent
(Unit_Declaration_Node
(E
)));
7353 if Present
(Default_Storage_Pool
(Aux
)) then
7354 Default_Pool
:= Default_Storage_Pool
(Aux
);
7360 ---------------------
7361 -- Premature_Usage --
7362 ---------------------
7364 procedure Premature_Usage
(N
: Node_Id
) is
7365 Kind
: constant Node_Kind
:= Nkind
(Parent
(Entity
(N
)));
7366 E
: Entity_Id
:= Entity
(N
);
7369 -- Within an instance, the analysis of the actual for a formal object
7370 -- does not see the name of the object itself. This is significant only
7371 -- if the object is an aggregate, where its analysis does not do any
7372 -- name resolution on component associations. (see 4717-008). In such a
7373 -- case, look for the visible homonym on the chain.
7376 and then Present
(Homonym
(E
))
7381 and then not In_Open_Scopes
(Scope
(E
))
7388 Set_Etype
(N
, Etype
(E
));
7393 if Kind
= N_Component_Declaration
then
7395 ("component&! cannot be used before end of record declaration", N
);
7397 elsif Kind
= N_Parameter_Specification
then
7399 ("formal parameter&! cannot be used before end of specification",
7402 elsif Kind
= N_Discriminant_Specification
then
7404 ("discriminant&! cannot be used before end of discriminant part",
7407 elsif Kind
= N_Procedure_Specification
7408 or else Kind
= N_Function_Specification
7411 ("subprogram&! cannot be used before end of its declaration",
7414 elsif Kind
= N_Full_Type_Declaration
then
7416 ("type& cannot be used before end of its declaration!", N
);
7420 ("object& cannot be used before end of its declaration!", N
);
7422 end Premature_Usage
;
7424 ------------------------
7425 -- Present_System_Aux --
7426 ------------------------
7428 function Present_System_Aux
(N
: Node_Id
:= Empty
) return Boolean is
7430 Aux_Name
: Unit_Name_Type
;
7431 Unum
: Unit_Number_Type
;
7436 function Find_System
(C_Unit
: Node_Id
) return Entity_Id
;
7437 -- Scan context clause of compilation unit to find with_clause
7444 function Find_System
(C_Unit
: Node_Id
) return Entity_Id
is
7445 With_Clause
: Node_Id
;
7448 With_Clause
:= First
(Context_Items
(C_Unit
));
7449 while Present
(With_Clause
) loop
7450 if (Nkind
(With_Clause
) = N_With_Clause
7451 and then Chars
(Name
(With_Clause
)) = Name_System
)
7452 and then Comes_From_Source
(With_Clause
)
7463 -- Start of processing for Present_System_Aux
7466 -- The child unit may have been loaded and analyzed already
7468 if Present
(System_Aux_Id
) then
7471 -- If no previous pragma for System.Aux, nothing to load
7473 elsif No
(System_Extend_Unit
) then
7476 -- Use the unit name given in the pragma to retrieve the unit.
7477 -- Verify that System itself appears in the context clause of the
7478 -- current compilation. If System is not present, an error will
7479 -- have been reported already.
7482 With_Sys
:= Find_System
(Cunit
(Current_Sem_Unit
));
7484 The_Unit
:= Unit
(Cunit
(Current_Sem_Unit
));
7488 (Nkind
(The_Unit
) = N_Package_Body
7489 or else (Nkind
(The_Unit
) = N_Subprogram_Body
7491 not Acts_As_Spec
(Cunit
(Current_Sem_Unit
))))
7493 With_Sys
:= Find_System
(Library_Unit
(Cunit
(Current_Sem_Unit
)));
7497 and then Present
(N
)
7499 -- If we are compiling a subunit, we need to examine its
7500 -- context as well (Current_Sem_Unit is the parent unit);
7502 The_Unit
:= Parent
(N
);
7503 while Nkind
(The_Unit
) /= N_Compilation_Unit
loop
7504 The_Unit
:= Parent
(The_Unit
);
7507 if Nkind
(Unit
(The_Unit
)) = N_Subunit
then
7508 With_Sys
:= Find_System
(The_Unit
);
7512 if No
(With_Sys
) then
7516 Loc
:= Sloc
(With_Sys
);
7517 Get_Name_String
(Chars
(Expression
(System_Extend_Unit
)));
7518 Name_Buffer
(8 .. Name_Len
+ 7) := Name_Buffer
(1 .. Name_Len
);
7519 Name_Buffer
(1 .. 7) := "system.";
7520 Name_Buffer
(Name_Len
+ 8) := '%';
7521 Name_Buffer
(Name_Len
+ 9) := 's';
7522 Name_Len
:= Name_Len
+ 9;
7523 Aux_Name
:= Name_Find
;
7527 (Load_Name
=> Aux_Name
,
7530 Error_Node
=> With_Sys
);
7532 if Unum
/= No_Unit
then
7533 Semantics
(Cunit
(Unum
));
7535 Defining_Entity
(Specification
(Unit
(Cunit
(Unum
))));
7538 Make_With_Clause
(Loc
,
7540 Make_Expanded_Name
(Loc
,
7541 Chars
=> Chars
(System_Aux_Id
),
7542 Prefix
=> New_Reference_To
(Scope
(System_Aux_Id
), Loc
),
7543 Selector_Name
=> New_Reference_To
(System_Aux_Id
, Loc
)));
7545 Set_Entity
(Name
(Withn
), System_Aux_Id
);
7547 Set_Library_Unit
(Withn
, Cunit
(Unum
));
7548 Set_Corresponding_Spec
(Withn
, System_Aux_Id
);
7549 Set_First_Name
(Withn
, True);
7550 Set_Implicit_With
(Withn
, True);
7552 Insert_After
(With_Sys
, Withn
);
7553 Mark_Rewrite_Insertion
(Withn
);
7554 Set_Context_Installed
(Withn
);
7558 -- Here if unit load failed
7561 Error_Msg_Name_1
:= Name_System
;
7562 Error_Msg_Name_2
:= Chars
(Expression
(System_Extend_Unit
));
7564 ("extension package `%.%` does not exist",
7565 Opt
.System_Extend_Unit
);
7569 end Present_System_Aux
;
7571 -------------------------
7572 -- Restore_Scope_Stack --
7573 -------------------------
7575 procedure Restore_Scope_Stack
(Handle_Use
: Boolean := True) is
7578 Comp_Unit
: Node_Id
;
7579 In_Child
: Boolean := False;
7580 Full_Vis
: Boolean := True;
7581 SS_Last
: constant Int
:= Scope_Stack
.Last
;
7584 -- Restore visibility of previous scope stack, if any
7586 for J
in reverse 0 .. Scope_Stack
.Last
loop
7587 exit when Scope_Stack
.Table
(J
).Entity
= Standard_Standard
7588 or else No
(Scope_Stack
.Table
(J
).Entity
);
7590 S
:= Scope_Stack
.Table
(J
).Entity
;
7592 if not Is_Hidden_Open_Scope
(S
) then
7594 -- If the parent scope is hidden, its entities are hidden as
7595 -- well, unless the entity is the instantiation currently
7598 if not Is_Hidden_Open_Scope
(Scope
(S
))
7599 or else not Analyzed
(Parent
(S
))
7600 or else Scope
(S
) = Standard_Standard
7602 Set_Is_Immediately_Visible
(S
, True);
7605 E
:= First_Entity
(S
);
7606 while Present
(E
) loop
7607 if Is_Child_Unit
(E
) then
7608 if not From_With_Type
(E
) then
7609 Set_Is_Immediately_Visible
(E
,
7610 Is_Visible_Child_Unit
(E
) or else In_Open_Scopes
(E
));
7614 (Nkind
(Parent
(E
)) = N_Defining_Program_Unit_Name
7616 Nkind
(Parent
(Parent
(E
))) = N_Package_Specification
);
7617 Set_Is_Immediately_Visible
(E
,
7618 Limited_View_Installed
(Parent
(Parent
(E
))));
7621 Set_Is_Immediately_Visible
(E
, True);
7627 and then Is_Package_Or_Generic_Package
(S
)
7629 -- We are in the visible part of the package scope
7631 exit when E
= First_Private_Entity
(S
);
7635 -- The visibility of child units (siblings of current compilation)
7636 -- must be restored in any case. Their declarations may appear
7637 -- after the private part of the parent.
7639 if not Full_Vis
then
7640 while Present
(E
) loop
7641 if Is_Child_Unit
(E
) then
7642 Set_Is_Immediately_Visible
(E
,
7643 Is_Visible_Child_Unit
(E
) or else In_Open_Scopes
(E
));
7651 if Is_Child_Unit
(S
)
7652 and not In_Child
-- check only for current unit
7656 -- Restore visibility of parents according to whether the child
7657 -- is private and whether we are in its visible part.
7659 Comp_Unit
:= Parent
(Unit_Declaration_Node
(S
));
7661 if Nkind
(Comp_Unit
) = N_Compilation_Unit
7662 and then Private_Present
(Comp_Unit
)
7666 elsif Is_Package_Or_Generic_Package
(S
)
7667 and then (In_Private_Part
(S
) or else In_Package_Body
(S
))
7671 -- if S is the scope of some instance (which has already been
7672 -- seen on the stack) it does not affect the visibility of
7675 elsif Is_Hidden_Open_Scope
(S
) then
7678 elsif (Ekind
(S
) = E_Procedure
7679 or else Ekind
(S
) = E_Function
)
7680 and then Has_Completion
(S
)
7691 if SS_Last
>= Scope_Stack
.First
7692 and then Scope_Stack
.Table
(SS_Last
).Entity
/= Standard_Standard
7695 Install_Use_Clauses
(Scope_Stack
.Table
(SS_Last
).First_Use_Clause
);
7697 end Restore_Scope_Stack
;
7699 ----------------------
7700 -- Save_Scope_Stack --
7701 ----------------------
7703 procedure Save_Scope_Stack
(Handle_Use
: Boolean := True) is
7706 SS_Last
: constant Int
:= Scope_Stack
.Last
;
7709 if SS_Last
>= Scope_Stack
.First
7710 and then Scope_Stack
.Table
(SS_Last
).Entity
/= Standard_Standard
7713 End_Use_Clauses
(Scope_Stack
.Table
(SS_Last
).First_Use_Clause
);
7716 -- If the call is from within a compilation unit, as when called from
7717 -- Rtsfind, make current entries in scope stack invisible while we
7718 -- analyze the new unit.
7720 for J
in reverse 0 .. SS_Last
loop
7721 exit when Scope_Stack
.Table
(J
).Entity
= Standard_Standard
7722 or else No
(Scope_Stack
.Table
(J
).Entity
);
7724 S
:= Scope_Stack
.Table
(J
).Entity
;
7725 Set_Is_Immediately_Visible
(S
, False);
7727 E
:= First_Entity
(S
);
7728 while Present
(E
) loop
7729 Set_Is_Immediately_Visible
(E
, False);
7735 end Save_Scope_Stack
;
7741 procedure Set_Use
(L
: List_Id
) is
7743 Pack_Name
: Node_Id
;
7750 while Present
(Decl
) loop
7751 if Nkind
(Decl
) = N_Use_Package_Clause
then
7752 Chain_Use_Clause
(Decl
);
7754 Pack_Name
:= First
(Names
(Decl
));
7755 while Present
(Pack_Name
) loop
7756 Pack
:= Entity
(Pack_Name
);
7758 if Ekind
(Pack
) = E_Package
7759 and then Applicable_Use
(Pack_Name
)
7761 Use_One_Package
(Pack
, Decl
);
7767 elsif Nkind
(Decl
) = N_Use_Type_Clause
then
7768 Chain_Use_Clause
(Decl
);
7770 Id
:= First
(Subtype_Marks
(Decl
));
7771 while Present
(Id
) loop
7772 if Entity
(Id
) /= Any_Type
then
7785 ---------------------
7786 -- Use_One_Package --
7787 ---------------------
7789 procedure Use_One_Package
(P
: Entity_Id
; N
: Node_Id
) is
7792 Current_Instance
: Entity_Id
:= Empty
;
7794 Private_With_OK
: Boolean := False;
7797 if Ekind
(P
) /= E_Package
then
7802 Set_Current_Use_Clause
(P
, N
);
7804 -- Ada 2005 (AI-50217): Check restriction
7806 if From_With_Type
(P
) then
7807 Error_Msg_N
("limited withed package cannot appear in use clause", N
);
7810 -- Find enclosing instance, if any
7813 Current_Instance
:= Current_Scope
;
7814 while not Is_Generic_Instance
(Current_Instance
) loop
7815 Current_Instance
:= Scope
(Current_Instance
);
7818 if No
(Hidden_By_Use_Clause
(N
)) then
7819 Set_Hidden_By_Use_Clause
(N
, New_Elmt_List
);
7823 -- If unit is a package renaming, indicate that the renamed
7824 -- package is also in use (the flags on both entities must
7825 -- remain consistent, and a subsequent use of either of them
7826 -- should be recognized as redundant).
7828 if Present
(Renamed_Object
(P
)) then
7829 Set_In_Use
(Renamed_Object
(P
));
7830 Set_Current_Use_Clause
(Renamed_Object
(P
), N
);
7831 Real_P
:= Renamed_Object
(P
);
7836 -- Ada 2005 (AI-262): Check the use_clause of a private withed package
7837 -- found in the private part of a package specification
7839 if In_Private_Part
(Current_Scope
)
7840 and then Has_Private_With
(P
)
7841 and then Is_Child_Unit
(Current_Scope
)
7842 and then Is_Child_Unit
(P
)
7843 and then Is_Ancestor_Package
(Scope
(Current_Scope
), P
)
7845 Private_With_OK
:= True;
7848 -- Loop through entities in one package making them potentially
7851 Id
:= First_Entity
(P
);
7853 and then (Id
/= First_Private_Entity
(P
)
7854 or else Private_With_OK
) -- Ada 2005 (AI-262)
7856 Prev
:= Current_Entity
(Id
);
7857 while Present
(Prev
) loop
7858 if Is_Immediately_Visible
(Prev
)
7859 and then (not Is_Overloadable
(Prev
)
7860 or else not Is_Overloadable
(Id
)
7861 or else (Type_Conformant
(Id
, Prev
)))
7863 if No
(Current_Instance
) then
7865 -- Potentially use-visible entity remains hidden
7867 goto Next_Usable_Entity
;
7869 -- A use clause within an instance hides outer global entities,
7870 -- which are not used to resolve local entities in the
7871 -- instance. Note that the predefined entities in Standard
7872 -- could not have been hidden in the generic by a use clause,
7873 -- and therefore remain visible. Other compilation units whose
7874 -- entities appear in Standard must be hidden in an instance.
7876 -- To determine whether an entity is external to the instance
7877 -- we compare the scope depth of its scope with that of the
7878 -- current instance. However, a generic actual of a subprogram
7879 -- instance is declared in the wrapper package but will not be
7880 -- hidden by a use-visible entity. similarly, an entity that is
7881 -- declared in an enclosing instance will not be hidden by an
7882 -- an entity declared in a generic actual, which can only have
7883 -- been use-visible in the generic and will not have hidden the
7884 -- entity in the generic parent.
7886 -- If Id is called Standard, the predefined package with the
7887 -- same name is in the homonym chain. It has to be ignored
7888 -- because it has no defined scope (being the only entity in
7889 -- the system with this mandated behavior).
7891 elsif not Is_Hidden
(Id
)
7892 and then Present
(Scope
(Prev
))
7893 and then not Is_Wrapper_Package
(Scope
(Prev
))
7894 and then Scope_Depth
(Scope
(Prev
)) <
7895 Scope_Depth
(Current_Instance
)
7896 and then (Scope
(Prev
) /= Standard_Standard
7897 or else Sloc
(Prev
) > Standard_Location
)
7899 if In_Open_Scopes
(Scope
(Prev
))
7900 and then Is_Generic_Instance
(Scope
(Prev
))
7901 and then Present
(Associated_Formal_Package
(P
))
7906 Set_Is_Potentially_Use_Visible
(Id
);
7907 Set_Is_Immediately_Visible
(Prev
, False);
7908 Append_Elmt
(Prev
, Hidden_By_Use_Clause
(N
));
7912 -- A user-defined operator is not use-visible if the predefined
7913 -- operator for the type is immediately visible, which is the case
7914 -- if the type of the operand is in an open scope. This does not
7915 -- apply to user-defined operators that have operands of different
7916 -- types, because the predefined mixed mode operations (multiply
7917 -- and divide) apply to universal types and do not hide anything.
7919 elsif Ekind
(Prev
) = E_Operator
7920 and then Operator_Matches_Spec
(Prev
, Id
)
7921 and then In_Open_Scopes
7922 (Scope
(Base_Type
(Etype
(First_Formal
(Id
)))))
7923 and then (No
(Next_Formal
(First_Formal
(Id
)))
7924 or else Etype
(First_Formal
(Id
))
7925 = Etype
(Next_Formal
(First_Formal
(Id
)))
7926 or else Chars
(Prev
) = Name_Op_Expon
)
7928 goto Next_Usable_Entity
;
7930 -- In an instance, two homonyms may become use_visible through the
7931 -- actuals of distinct formal packages. In the generic, only the
7932 -- current one would have been visible, so make the other one
7935 elsif Present
(Current_Instance
)
7936 and then Is_Potentially_Use_Visible
(Prev
)
7937 and then not Is_Overloadable
(Prev
)
7938 and then Scope
(Id
) /= Scope
(Prev
)
7939 and then Used_As_Generic_Actual
(Scope
(Prev
))
7940 and then Used_As_Generic_Actual
(Scope
(Id
))
7941 and then not In_Same_List
(Current_Use_Clause
(Scope
(Prev
)),
7942 Current_Use_Clause
(Scope
(Id
)))
7944 Set_Is_Potentially_Use_Visible
(Prev
, False);
7945 Append_Elmt
(Prev
, Hidden_By_Use_Clause
(N
));
7948 Prev
:= Homonym
(Prev
);
7951 -- On exit, we know entity is not hidden, unless it is private
7953 if not Is_Hidden
(Id
)
7954 and then ((not Is_Child_Unit
(Id
))
7955 or else Is_Visible_Child_Unit
(Id
))
7957 Set_Is_Potentially_Use_Visible
(Id
);
7959 if Is_Private_Type
(Id
)
7960 and then Present
(Full_View
(Id
))
7962 Set_Is_Potentially_Use_Visible
(Full_View
(Id
));
7966 <<Next_Usable_Entity
>>
7970 -- Child units are also made use-visible by a use clause, but they may
7971 -- appear after all visible declarations in the parent entity list.
7973 while Present
(Id
) loop
7974 if Is_Child_Unit
(Id
)
7975 and then Is_Visible_Child_Unit
(Id
)
7977 Set_Is_Potentially_Use_Visible
(Id
);
7983 if Chars
(Real_P
) = Name_System
7984 and then Scope
(Real_P
) = Standard_Standard
7985 and then Present_System_Aux
(N
)
7987 Use_One_Package
(System_Aux_Id
, N
);
7990 end Use_One_Package
;
7996 procedure Use_One_Type
(Id
: Node_Id
; Installed
: Boolean := False) is
7998 Is_Known_Used
: Boolean;
8002 function Spec_Reloaded_For_Body
return Boolean;
8003 -- Determine whether the compilation unit is a package body and the use
8004 -- type clause is in the spec of the same package. Even though the spec
8005 -- was analyzed first, its context is reloaded when analysing the body.
8007 procedure Use_Class_Wide_Operations
(Typ
: Entity_Id
);
8008 -- AI05-150: if the use_type_clause carries the "all" qualifier,
8009 -- class-wide operations of ancestor types are use-visible if the
8010 -- ancestor type is visible.
8012 ----------------------------
8013 -- Spec_Reloaded_For_Body --
8014 ----------------------------
8016 function Spec_Reloaded_For_Body
return Boolean is
8018 if Nkind
(Unit
(Cunit
(Current_Sem_Unit
))) = N_Package_Body
then
8020 Spec
: constant Node_Id
:=
8021 Parent
(List_Containing
(Parent
(Id
)));
8024 -- Check whether type is declared in a package specification,
8025 -- and current unit is the corresponding package body. The
8026 -- use clauses themselves may be within a nested package.
8029 Nkind
(Spec
) = N_Package_Specification
8031 In_Same_Source_Unit
(Corresponding_Body
(Parent
(Spec
)),
8032 Cunit_Entity
(Current_Sem_Unit
));
8037 end Spec_Reloaded_For_Body
;
8039 -------------------------------
8040 -- Use_Class_Wide_Operations --
8041 -------------------------------
8043 procedure Use_Class_Wide_Operations
(Typ
: Entity_Id
) is
8047 function Is_Class_Wide_Operation_Of
8049 T
: Entity_Id
) return Boolean;
8050 -- Determine whether a subprogram has a class-wide parameter or
8051 -- result that is T'Class.
8053 ---------------------------------
8054 -- Is_Class_Wide_Operation_Of --
8055 ---------------------------------
8057 function Is_Class_Wide_Operation_Of
8059 T
: Entity_Id
) return Boolean
8064 Formal
:= First_Formal
(Op
);
8065 while Present
(Formal
) loop
8066 if Etype
(Formal
) = Class_Wide_Type
(T
) then
8069 Next_Formal
(Formal
);
8072 if Etype
(Op
) = Class_Wide_Type
(T
) then
8077 end Is_Class_Wide_Operation_Of
;
8079 -- Start of processing for Use_Class_Wide_Operations
8082 Scop
:= Scope
(Typ
);
8083 if not Is_Hidden
(Scop
) then
8084 Ent
:= First_Entity
(Scop
);
8085 while Present
(Ent
) loop
8086 if Is_Overloadable
(Ent
)
8087 and then Is_Class_Wide_Operation_Of
(Ent
, Typ
)
8088 and then not Is_Potentially_Use_Visible
(Ent
)
8090 Set_Is_Potentially_Use_Visible
(Ent
);
8091 Append_Elmt
(Ent
, Used_Operations
(Parent
(Id
)));
8098 if Is_Derived_Type
(Typ
) then
8099 Use_Class_Wide_Operations
(Etype
(Base_Type
(Typ
)));
8101 end Use_Class_Wide_Operations
;
8103 -- Start of processing for Use_One_Type
8106 -- It is the type determined by the subtype mark (8.4(8)) whose
8107 -- operations become potentially use-visible.
8109 T
:= Base_Type
(Entity
(Id
));
8111 -- Either the type itself is used, the package where it is declared
8112 -- is in use or the entity is declared in the current package, thus
8117 or else In_Use
(Scope
(T
))
8118 or else Scope
(T
) = Current_Scope
;
8120 Set_Redundant_Use
(Id
,
8121 Is_Known_Used
or else Is_Potentially_Use_Visible
(T
));
8123 if Ekind
(T
) = E_Incomplete_Type
then
8124 Error_Msg_N
("premature usage of incomplete type", Id
);
8126 elsif In_Open_Scopes
(Scope
(T
)) then
8129 -- A limited view cannot appear in a use_type clause. However, an access
8130 -- type whose designated type is limited has the flag but is not itself
8131 -- a limited view unless we only have a limited view of its enclosing
8134 elsif From_With_Type
(T
)
8135 and then From_With_Type
(Scope
(T
))
8138 ("incomplete type from limited view "
8139 & "cannot appear in use clause", Id
);
8141 -- If the subtype mark designates a subtype in a different package,
8142 -- we have to check that the parent type is visible, otherwise the
8143 -- use type clause is a noop. Not clear how to do that???
8145 elsif not Redundant_Use
(Id
) then
8148 -- If T is tagged, primitive operators on class-wide operands
8149 -- are also available.
8151 if Is_Tagged_Type
(T
) then
8152 Set_In_Use
(Class_Wide_Type
(T
));
8155 Set_Current_Use_Clause
(T
, Parent
(Id
));
8157 -- Iterate over primitive operations of the type. If an operation is
8158 -- already use_visible, it is the result of a previous use_clause,
8159 -- and already appears on the corresponding entity chain. If the
8160 -- clause is being reinstalled, operations are already use-visible.
8166 Op_List
:= Collect_Primitive_Operations
(T
);
8167 Elmt
:= First_Elmt
(Op_List
);
8168 while Present
(Elmt
) loop
8169 if (Nkind
(Node
(Elmt
)) = N_Defining_Operator_Symbol
8170 or else Chars
(Node
(Elmt
)) in Any_Operator_Name
)
8171 and then not Is_Hidden
(Node
(Elmt
))
8172 and then not Is_Potentially_Use_Visible
(Node
(Elmt
))
8174 Set_Is_Potentially_Use_Visible
(Node
(Elmt
));
8175 Append_Elmt
(Node
(Elmt
), Used_Operations
(Parent
(Id
)));
8177 elsif Ada_Version
>= Ada_2012
8178 and then All_Present
(Parent
(Id
))
8179 and then not Is_Hidden
(Node
(Elmt
))
8180 and then not Is_Potentially_Use_Visible
(Node
(Elmt
))
8182 Set_Is_Potentially_Use_Visible
(Node
(Elmt
));
8183 Append_Elmt
(Node
(Elmt
), Used_Operations
(Parent
(Id
)));
8190 if Ada_Version
>= Ada_2012
8191 and then All_Present
(Parent
(Id
))
8192 and then Is_Tagged_Type
(T
)
8194 Use_Class_Wide_Operations
(T
);
8198 -- If warning on redundant constructs, check for unnecessary WITH
8200 if Warn_On_Redundant_Constructs
8201 and then Is_Known_Used
8203 -- with P; with P; use P;
8204 -- package P is package X is package body X is
8205 -- type T ... use P.T;
8207 -- The compilation unit is the body of X. GNAT first compiles the
8208 -- spec of X, then proceeds to the body. At that point P is marked
8209 -- as use visible. The analysis then reinstalls the spec along with
8210 -- its context. The use clause P.T is now recognized as redundant,
8211 -- but in the wrong context. Do not emit a warning in such cases.
8212 -- Do not emit a warning either if we are in an instance, there is
8213 -- no redundancy between an outer use_clause and one that appears
8214 -- within the generic.
8216 and then not Spec_Reloaded_For_Body
8217 and then not In_Instance
8219 -- The type already has a use clause
8223 -- Case where we know the current use clause for the type
8225 if Present
(Current_Use_Clause
(T
)) then
8226 Use_Clause_Known
: declare
8227 Clause1
: constant Node_Id
:= Parent
(Id
);
8228 Clause2
: constant Node_Id
:= Current_Use_Clause
(T
);
8235 function Entity_Of_Unit
(U
: Node_Id
) return Entity_Id
;
8236 -- Return the appropriate entity for determining which unit
8237 -- has a deeper scope: the defining entity for U, unless U
8238 -- is a package instance, in which case we retrieve the
8239 -- entity of the instance spec.
8241 --------------------
8242 -- Entity_Of_Unit --
8243 --------------------
8245 function Entity_Of_Unit
(U
: Node_Id
) return Entity_Id
is
8247 if Nkind
(U
) = N_Package_Instantiation
8248 and then Analyzed
(U
)
8250 return Defining_Entity
(Instance_Spec
(U
));
8252 return Defining_Entity
(U
);
8256 -- Start of processing for Use_Clause_Known
8259 -- If both current use type clause and the use type clause
8260 -- for the type are at the compilation unit level, one of
8261 -- the units must be an ancestor of the other, and the
8262 -- warning belongs on the descendant.
8264 if Nkind
(Parent
(Clause1
)) = N_Compilation_Unit
8266 Nkind
(Parent
(Clause2
)) = N_Compilation_Unit
8269 -- If the unit is a subprogram body that acts as spec,
8270 -- the context clause is shared with the constructed
8271 -- subprogram spec. Clearly there is no redundancy.
8273 if Clause1
= Clause2
then
8277 Unit1
:= Unit
(Parent
(Clause1
));
8278 Unit2
:= Unit
(Parent
(Clause2
));
8280 -- If both clauses are on same unit, or one is the body
8281 -- of the other, or one of them is in a subunit, report
8282 -- redundancy on the later one.
8284 if Unit1
= Unit2
then
8285 Error_Msg_Sloc
:= Sloc
(Current_Use_Clause
(T
));
8286 Error_Msg_NE
-- CODEFIX
8287 ("& is already use-visible through previous "
8288 & "use_type_clause #?", Clause1
, T
);
8291 elsif Nkind
(Unit1
) = N_Subunit
then
8292 Error_Msg_Sloc
:= Sloc
(Current_Use_Clause
(T
));
8293 Error_Msg_NE
-- CODEFIX
8294 ("& is already use-visible through previous "
8295 & "use_type_clause #?", Clause1
, T
);
8298 elsif Nkind_In
(Unit2
, N_Package_Body
, N_Subprogram_Body
)
8299 and then Nkind
(Unit1
) /= Nkind
(Unit2
)
8300 and then Nkind
(Unit1
) /= N_Subunit
8302 Error_Msg_Sloc
:= Sloc
(Clause1
);
8303 Error_Msg_NE
-- CODEFIX
8304 ("& is already use-visible through previous "
8305 & "use_type_clause #?", Current_Use_Clause
(T
), T
);
8309 -- There is a redundant use type clause in a child unit.
8310 -- Determine which of the units is more deeply nested.
8311 -- If a unit is a package instance, retrieve the entity
8312 -- and its scope from the instance spec.
8314 Ent1
:= Entity_Of_Unit
(Unit1
);
8315 Ent2
:= Entity_Of_Unit
(Unit2
);
8317 if Scope
(Ent2
) = Standard_Standard
then
8318 Error_Msg_Sloc
:= Sloc
(Current_Use_Clause
(T
));
8321 elsif Scope
(Ent1
) = Standard_Standard
then
8322 Error_Msg_Sloc
:= Sloc
(Id
);
8325 -- If both units are child units, we determine which one
8326 -- is the descendant by the scope distance to the
8327 -- ultimate parent unit.
8337 and then Present
(S2
)
8338 and then S1
/= Standard_Standard
8339 and then S2
/= Standard_Standard
8345 if S1
= Standard_Standard
then
8346 Error_Msg_Sloc
:= Sloc
(Id
);
8349 Error_Msg_Sloc
:= Sloc
(Current_Use_Clause
(T
));
8355 Error_Msg_NE
-- CODEFIX
8356 ("& is already use-visible through previous "
8357 & "use_type_clause #?", Err_No
, Id
);
8359 -- Case where current use type clause and the use type
8360 -- clause for the type are not both at the compilation unit
8361 -- level. In this case we don't have location information.
8364 Error_Msg_NE
-- CODEFIX
8365 ("& is already use-visible through previous "
8366 & "use type clause?", Id
, T
);
8368 end Use_Clause_Known
;
8370 -- Here if Current_Use_Clause is not set for T, another case
8371 -- where we do not have the location information available.
8374 Error_Msg_NE
-- CODEFIX
8375 ("& is already use-visible through previous "
8376 & "use type clause?", Id
, T
);
8379 -- The package where T is declared is already used
8381 elsif In_Use
(Scope
(T
)) then
8382 Error_Msg_Sloc
:= Sloc
(Current_Use_Clause
(Scope
(T
)));
8383 Error_Msg_NE
-- CODEFIX
8384 ("& is already use-visible through package use clause #?",
8387 -- The current scope is the package where T is declared
8390 Error_Msg_Node_2
:= Scope
(T
);
8391 Error_Msg_NE
-- CODEFIX
8392 ("& is already use-visible inside package &?", Id
, T
);
8401 procedure Write_Info
is
8402 Id
: Entity_Id
:= First_Entity
(Current_Scope
);
8405 -- No point in dumping standard entities
8407 if Current_Scope
= Standard_Standard
then
8411 Write_Str
("========================================================");
8413 Write_Str
(" Defined Entities in ");
8414 Write_Name
(Chars
(Current_Scope
));
8416 Write_Str
("========================================================");
8420 Write_Str
("-- none --");
8424 while Present
(Id
) loop
8425 Write_Entity_Info
(Id
, " ");
8430 if Scope
(Current_Scope
) = Standard_Standard
then
8432 -- Print information on the current unit itself
8434 Write_Entity_Info
(Current_Scope
, " ");
8447 for J
in reverse 1 .. Scope_Stack
.Last
loop
8448 S
:= Scope_Stack
.Table
(J
).Entity
;
8449 Write_Int
(Int
(S
));
8450 Write_Str
(" === ");
8451 Write_Name
(Chars
(S
));