1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2008, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with 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_Cat; use Sem_Cat;
50 with Sem_Ch3; use Sem_Ch3;
51 with Sem_Ch4; use Sem_Ch4;
52 with Sem_Ch6; use Sem_Ch6;
53 with Sem_Ch12; use Sem_Ch12;
54 with Sem_Disp; use Sem_Disp;
55 with Sem_Dist; use Sem_Dist;
56 with Sem_Res; use Sem_Res;
57 with Sem_Util; use Sem_Util;
58 with Sem_Type; use Sem_Type;
59 with Stand; use Stand;
60 with Sinfo; use Sinfo;
61 with Sinfo.CN; use Sinfo.CN;
62 with Snames; use Snames;
63 with Style; use Style;
65 with Tbuild; use Tbuild;
66 with Uintp; use Uintp;
68 package body Sem_Ch8 is
70 ------------------------------------
71 -- Visibility and Name Resolution --
72 ------------------------------------
74 -- This package handles name resolution and the collection of
75 -- interpretations for overloaded names, prior to overload resolution.
77 -- Name resolution is the process that establishes a mapping between source
78 -- identifiers and the entities they denote at each point in the program.
79 -- Each entity is represented by a defining occurrence. Each identifier
80 -- that denotes an entity points to the corresponding defining occurrence.
81 -- This is the entity of the applied occurrence. Each occurrence holds
82 -- an index into the names table, where source identifiers are stored.
84 -- Each entry in the names table for an identifier or designator uses the
85 -- Info pointer to hold a link to the currently visible entity that has
86 -- this name (see subprograms Get_Name_Entity_Id and Set_Name_Entity_Id
87 -- in package Sem_Util). The visibility is initialized at the beginning of
88 -- semantic processing to make entities in package Standard immediately
89 -- visible. The visibility table is used in a more subtle way when
90 -- compiling subunits (see below).
92 -- Entities that have the same name (i.e. homonyms) are chained. In the
93 -- case of overloaded entities, this chain holds all the possible meanings
94 -- of a given identifier. The process of overload resolution uses type
95 -- information to select from this chain the unique meaning of a given
98 -- Entities are also chained in their scope, through the Next_Entity link.
99 -- As a consequence, the name space is organized as a sparse matrix, where
100 -- each row corresponds to a scope, and each column to a source identifier.
101 -- Open scopes, that is to say scopes currently being compiled, have their
102 -- corresponding rows of entities in order, innermost scope first.
104 -- The scopes of packages that are mentioned in context clauses appear in
105 -- no particular order, interspersed among open scopes. This is because
106 -- in the course of analyzing the context of a compilation, a package
107 -- declaration is first an open scope, and subsequently an element of the
108 -- context. If subunits or child units are present, a parent unit may
109 -- appear under various guises at various times in the compilation.
111 -- When the compilation of the innermost scope is complete, the entities
112 -- defined therein are no longer visible. If the scope is not a package
113 -- declaration, these entities are never visible subsequently, and can be
114 -- removed from visibility chains. If the scope is a package declaration,
115 -- its visible declarations may still be accessible. Therefore the entities
116 -- defined in such a scope are left on the visibility chains, and only
117 -- their visibility (immediately visibility or potential use-visibility)
120 -- The ordering of homonyms on their chain does not necessarily follow
121 -- the order of their corresponding scopes on the scope stack. For
122 -- example, if package P and the enclosing scope both contain entities
123 -- named E, then when compiling the package body the chain for E will
124 -- hold the global entity first, and the local one (corresponding to
125 -- the current inner scope) next. As a result, name resolution routines
126 -- do not assume any relative ordering of the homonym chains, either
127 -- for scope nesting or to order of appearance of context clauses.
129 -- When compiling a child unit, entities in the parent scope are always
130 -- immediately visible. When compiling the body of a child unit, private
131 -- entities in the parent must also be made immediately visible. There
132 -- are separate routines to make the visible and private declarations
133 -- visible at various times (see package Sem_Ch7).
135 -- +--------+ +-----+
136 -- | In use |-------->| EU1 |-------------------------->
137 -- +--------+ +-----+
139 -- +--------+ +-----+ +-----+
140 -- | Stand. |---------------->| ES1 |--------------->| ES2 |--->
141 -- +--------+ +-----+ +-----+
143 -- +---------+ | +-----+
144 -- | with'ed |------------------------------>| EW2 |--->
145 -- +---------+ | +-----+
147 -- +--------+ +-----+ +-----+
148 -- | Scope2 |---------------->| E12 |--------------->| E22 |--->
149 -- +--------+ +-----+ +-----+
151 -- +--------+ +-----+ +-----+
152 -- | Scope1 |---------------->| E11 |--------------->| E12 |--->
153 -- +--------+ +-----+ +-----+
157 -- | | with'ed |----------------------------------------->
161 -- (innermost first) | |
162 -- +----------------------------+
163 -- Names table => | Id1 | | | | Id2 |
164 -- +----------------------------+
166 -- Name resolution must deal with several syntactic forms: simple names,
167 -- qualified names, indexed names, and various forms of calls.
169 -- Each identifier points to an entry in the names table. The resolution
170 -- of a simple name consists in traversing the homonym chain, starting
171 -- from the names table. If an entry is immediately visible, it is the one
172 -- designated by the identifier. If only potentially use-visible entities
173 -- are on the chain, we must verify that they do not hide each other. If
174 -- the entity we find is overloadable, we collect all other overloadable
175 -- entities on the chain as long as they are not hidden.
177 -- To resolve expanded names, we must find the entity at the intersection
178 -- of the entity chain for the scope (the prefix) and the homonym chain
179 -- for the selector. In general, homonym chains will be much shorter than
180 -- entity chains, so it is preferable to start from the names table as
181 -- well. If the entity found is overloadable, we must collect all other
182 -- interpretations that are defined in the scope denoted by the prefix.
184 -- For records, protected types, and tasks, their local entities are
185 -- removed from visibility chains on exit from the corresponding scope.
186 -- From the outside, these entities are always accessed by selected
187 -- notation, and the entity chain for the record type, protected type,
188 -- etc. is traversed sequentially in order to find the designated entity.
190 -- The discriminants of a type and the operations of a protected type or
191 -- task are unchained on exit from the first view of the type, (such as
192 -- a private or incomplete type declaration, or a protected type speci-
193 -- fication) and re-chained when compiling the second view.
195 -- In the case of operators, we do not make operators on derived types
196 -- explicit. As a result, the notation P."+" may denote either a user-
197 -- defined function with name "+", or else an implicit declaration of the
198 -- operator "+" in package P. The resolution of expanded names always
199 -- tries to resolve an operator name as such an implicitly defined entity,
200 -- in addition to looking for explicit declarations.
202 -- All forms of names that denote entities (simple names, expanded names,
203 -- character literals in some cases) have a Entity attribute, which
204 -- identifies the entity denoted by the name.
206 ---------------------
207 -- The Scope Stack --
208 ---------------------
210 -- The Scope stack keeps track of the scopes currently been compiled.
211 -- Every entity that contains declarations (including records) is placed
212 -- on the scope stack while it is being processed, and removed at the end.
213 -- Whenever a non-package scope is exited, the entities defined therein
214 -- are removed from the visibility table, so that entities in outer scopes
215 -- become visible (see previous description). On entry to Sem, the scope
216 -- stack only contains the package Standard. As usual, subunits complicate
217 -- this picture ever so slightly.
219 -- The Rtsfind mechanism can force a call to Semantics while another
220 -- compilation is in progress. The unit retrieved by Rtsfind must be
221 -- compiled in its own context, and has no access to the visibility of
222 -- the unit currently being compiled. The procedures Save_Scope_Stack and
223 -- Restore_Scope_Stack make entities in current open scopes invisible
224 -- before compiling the retrieved unit, and restore the compilation
225 -- environment afterwards.
227 ------------------------
228 -- Compiling subunits --
229 ------------------------
231 -- Subunits must be compiled in the environment of the corresponding stub,
232 -- that is to say with the same visibility into the parent (and its
233 -- context) that is available at the point of the stub declaration, but
234 -- with the additional visibility provided by the context clause of the
235 -- subunit itself. As a result, compilation of a subunit forces compilation
236 -- of the parent (see description in lib-). At the point of the stub
237 -- declaration, Analyze is called recursively to compile the proper body of
238 -- the subunit, but without reinitializing the names table, nor the scope
239 -- stack (i.e. standard is not pushed on the stack). In this fashion the
240 -- context of the subunit is added to the context of the parent, and the
241 -- subunit is compiled in the correct environment. Note that in the course
242 -- of processing the context of a subunit, Standard will appear twice on
243 -- the scope stack: once for the parent of the subunit, and once for the
244 -- unit in the context clause being compiled. However, the two sets of
245 -- entities are not linked by homonym chains, so that the compilation of
246 -- any context unit happens in a fresh visibility environment.
248 -------------------------------
249 -- Processing of USE Clauses --
250 -------------------------------
252 -- Every defining occurrence has a flag indicating if it is potentially use
253 -- visible. Resolution of simple names examines this flag. The processing
254 -- of use clauses consists in setting this flag on all visible entities
255 -- defined in the corresponding package. On exit from the scope of the use
256 -- clause, the corresponding flag must be reset. However, a package may
257 -- appear in several nested use clauses (pathological but legal, alas!)
258 -- which forces us to use a slightly more involved scheme:
260 -- a) The defining occurrence for a package holds a flag -In_Use- to
261 -- indicate that it is currently in the scope of a use clause. If a
262 -- redundant use clause is encountered, then the corresponding occurrence
263 -- of the package name is flagged -Redundant_Use-.
265 -- b) On exit from a scope, the use clauses in its declarative part are
266 -- scanned. The visibility flag is reset in all entities declared in
267 -- package named in a use clause, as long as the package is not flagged
268 -- as being in a redundant use clause (in which case the outer use
269 -- clause is still in effect, and the direct visibility of its entities
270 -- must be retained).
272 -- Note that entities are not removed from their homonym chains on exit
273 -- from the package specification. A subsequent use clause does not need
274 -- to rechain the visible entities, but only to establish their direct
277 -----------------------------------
278 -- Handling private declarations --
279 -----------------------------------
281 -- The principle that each entity has a single defining occurrence clashes
282 -- with the presence of two separate definitions for private types: the
283 -- first is the private type declaration, and second is the full type
284 -- declaration. It is important that all references to the type point to
285 -- the same defining occurrence, namely the first one. To enforce the two
286 -- separate views of the entity, the corresponding information is swapped
287 -- between the two declarations. Outside of the package, the defining
288 -- occurrence only contains the private declaration information, while in
289 -- the private part and the body of the package the defining occurrence
290 -- contains the full declaration. To simplify the swap, the defining
291 -- occurrence that currently holds the private declaration points to the
292 -- full declaration. During semantic processing the defining occurrence
293 -- also points to a list of private dependents, that is to say access types
294 -- or composite types whose designated types or component types are
295 -- subtypes or derived types of the private type in question. After the
296 -- full declaration has been seen, the private dependents are updated to
297 -- indicate that they have full definitions.
299 ------------------------------------
300 -- Handling of Undefined Messages --
301 ------------------------------------
303 -- In normal mode, only the first use of an undefined identifier generates
304 -- a message. The table Urefs is used to record error messages that have
305 -- been issued so that second and subsequent ones do not generate further
306 -- messages. However, the second reference causes text to be added to the
307 -- original undefined message noting "(more references follow)". The
308 -- full error list option (-gnatf) forces messages to be generated for
309 -- every reference and disconnects the use of this table.
311 type Uref_Entry is record
313 -- Node for identifier for which original message was posted. The
314 -- Chars field of this identifier is used to detect later references
315 -- to the same identifier.
318 -- Records error message Id of original undefined message. Reset to
319 -- No_Error_Msg after the second occurrence, where it is used to add
320 -- text to the original message as described above.
323 -- Set if the message is not visible rather than undefined
326 -- Records location of error message. Used to make sure that we do
327 -- not consider a, b : undefined as two separate instances, which
328 -- would otherwise happen, since the parser converts this sequence
329 -- to a : undefined; b : undefined.
333 package Urefs is new Table.Table (
334 Table_Component_Type => Uref_Entry,
335 Table_Index_Type => Nat,
336 Table_Low_Bound => 1,
338 Table_Increment => 100,
339 Table_Name => "Urefs");
341 Candidate_Renaming : Entity_Id;
342 -- Holds a candidate interpretation that appears in a subprogram renaming
343 -- declaration and does not match the given specification, but matches at
344 -- least on the first formal. Allows better error message when given
345 -- specification omits defaulted parameters, a common error.
347 -----------------------
348 -- Local Subprograms --
349 -----------------------
351 procedure Analyze_Generic_Renaming
354 -- Common processing for all three kinds of generic renaming declarations.
355 -- Enter new name and indicate that it renames the generic unit.
357 procedure Analyze_Renamed_Character
361 -- Renamed entity is given by a character literal, which must belong
362 -- to the return type of the new entity. Is_Body indicates whether the
363 -- declaration is a renaming_as_body. If the original declaration has
364 -- already been frozen (because of an intervening body, e.g.) the body of
365 -- the function must be built now. The same applies to the following
366 -- various renaming procedures.
368 procedure Analyze_Renamed_Dereference
372 -- Renamed entity is given by an explicit dereference. Prefix must be a
373 -- conformant access_to_subprogram type.
375 procedure Analyze_Renamed_Entry
379 -- If the renamed entity in a subprogram renaming is an entry or protected
380 -- subprogram, build a body for the new entity whose only statement is a
381 -- call to the renamed entity.
383 procedure Analyze_Renamed_Family_Member
387 -- Used when the renamed entity is an indexed component. The prefix must
388 -- denote an entry family.
390 procedure Analyze_Renamed_Primitive_Operation
394 -- If the renamed entity in a subprogram renaming is a primitive operation
395 -- or a class-wide operation in prefix form, save the target object, which
396 -- must be added to the list of actuals in any subsequent call.
398 function Applicable_Use (Pack_Name : Node_Id) return Boolean;
399 -- Common code to Use_One_Package and Set_Use, to determine whether
400 -- use clause must be processed. Pack_Name is an entity name that
401 -- references the package in question.
403 procedure Attribute_Renaming (N : Node_Id);
404 -- Analyze renaming of attribute as function. The renaming declaration N
405 -- is rewritten as a function body that returns the attribute reference
406 -- applied to the formals of the function.
408 procedure Check_Frozen_Renaming (N : Node_Id; Subp : Entity_Id);
409 -- A renaming_as_body may occur after the entity of the original decla-
410 -- ration has been frozen. In that case, the body of the new entity must
411 -- be built now, because the usual mechanism of building the renamed
412 -- body at the point of freezing will not work. Subp is the subprogram
413 -- for which N provides the Renaming_As_Body.
415 procedure Check_In_Previous_With_Clause
418 -- N is a use_package clause and Nam the package name, or N is a use_type
419 -- clause and Nam is the prefix of the type name. In either case, verify
420 -- that the package is visible at that point in the context: either it
421 -- appears in a previous with_clause, or because it is a fully qualified
422 -- name and the root ancestor appears in a previous with_clause.
424 procedure Check_Library_Unit_Renaming (N : Node_Id; Old_E : Entity_Id);
425 -- Verify that the entity in a renaming declaration that is a library unit
426 -- is itself a library unit and not a nested unit or subunit. Also check
427 -- that if the renaming is a child unit of a generic parent, then the
428 -- renamed unit must also be a child unit of that parent. Finally, verify
429 -- that a renamed generic unit is not an implicit child declared within
430 -- an instance of the parent.
432 procedure Chain_Use_Clause (N : Node_Id);
433 -- Chain use clause onto list of uses clauses headed by First_Use_Clause in
434 -- the proper scope table entry. This is usually the current scope, but it
435 -- will be an inner scope when installing the use clauses of the private
436 -- declarations of a parent unit prior to compiling the private part of a
437 -- child unit. This chain is traversed when installing/removing use clauses
438 -- when compiling a subunit or instantiating a generic body on the fly,
439 -- when it is necessary to save and restore full environments.
441 function Has_Implicit_Character_Literal (N : Node_Id) return Boolean;
442 -- Find a type derived from Character or Wide_Character in the prefix of N.
443 -- Used to resolved qualified names whose selector is a character literal.
445 function Has_Private_With (E : Entity_Id) return Boolean;
446 -- Ada 2005 (AI-262): Determines if the current compilation unit has a
447 -- private with on E.
449 procedure Find_Expanded_Name (N : Node_Id);
450 -- Selected component is known to be expanded name. Verify legality
451 -- of selector given the scope denoted by prefix.
453 function Find_Renamed_Entity
457 Is_Actual : Boolean := False) return Entity_Id;
458 -- Find the renamed entity that corresponds to the given parameter profile
459 -- in a subprogram renaming declaration. The renamed entity may be an
460 -- operator, a subprogram, an entry, or a protected operation. Is_Actual
461 -- indicates that the renaming is the one generated for an actual subpro-
462 -- gram in an instance, for which special visibility checks apply.
464 function Has_Implicit_Operator (N : Node_Id) return Boolean;
465 -- N is an expanded name whose selector is an operator name (e.g. P."+").
466 -- declarative part contains an implicit declaration of an operator if it
467 -- has a declaration of a type to which one of the predefined operators
468 -- apply. The existence of this routine is an implementation artifact. A
469 -- more straightforward but more space-consuming choice would be to make
470 -- all inherited operators explicit in the symbol table.
472 procedure Inherit_Renamed_Profile (New_S : Entity_Id; Old_S : Entity_Id);
473 -- A subprogram defined by a renaming declaration inherits the parameter
474 -- profile of the renamed entity. The subtypes given in the subprogram
475 -- specification are discarded and replaced with those of the renamed
476 -- subprogram, which are then used to recheck the default values.
478 function Is_Appropriate_For_Record (T : Entity_Id) return Boolean;
479 -- Prefix is appropriate for record if it is of a record type, or an access
482 function Is_Appropriate_For_Entry_Prefix (T : Entity_Id) return Boolean;
483 -- True if it is of a task type, a protected type, or else an access to one
486 procedure Note_Redundant_Use (Clause : Node_Id);
487 -- Mark the name in a use clause as redundant if the corresponding entity
488 -- is already use-visible. Emit a warning if the use clause comes from
489 -- source and the proper warnings are enabled.
491 procedure Premature_Usage (N : Node_Id);
492 -- Diagnose usage of an entity before it is visible
494 procedure Use_One_Package (P : Entity_Id; N : Node_Id);
495 -- Make visible entities declared in package P potentially use-visible
496 -- in the current context. Also used in the analysis of subunits, when
497 -- re-installing use clauses of parent units. N is the use_clause that
498 -- names P (and possibly other packages).
500 procedure Use_One_Type (Id : Node_Id);
501 -- Id is the subtype mark from a use type clause. This procedure makes
502 -- the primitive operators of the type potentially use-visible.
504 procedure Write_Info;
505 -- Write debugging information on entities declared in current scope
507 procedure Write_Scopes;
508 pragma Warnings (Off, Write_Scopes);
509 -- Debugging information: dump all entities on scope stack
511 --------------------------------
512 -- Analyze_Exception_Renaming --
513 --------------------------------
515 -- The language only allows a single identifier, but the tree holds an
516 -- identifier list. The parser has already issued an error message if
517 -- there is more than one element in the list.
519 procedure Analyze_Exception_Renaming (N : Node_Id) is
520 Id : constant Node_Id := Defining_Identifier (N);
521 Nam : constant Node_Id := Name (N);
527 Set_Ekind (Id, E_Exception);
528 Set_Exception_Code (Id, Uint_0);
529 Set_Etype (Id, Standard_Exception_Type);
530 Set_Is_Pure (Id, Is_Pure (Current_Scope));
532 if not Is_Entity_Name (Nam) or else
533 Ekind (Entity (Nam)) /= E_Exception
535 Error_Msg_N ("invalid exception name in renaming", Nam);
537 if Present (Renamed_Object (Entity (Nam))) then
538 Set_Renamed_Object (Id, Renamed_Object (Entity (Nam)));
540 Set_Renamed_Object (Id, Entity (Nam));
543 end Analyze_Exception_Renaming;
545 ---------------------------
546 -- Analyze_Expanded_Name --
547 ---------------------------
549 procedure Analyze_Expanded_Name (N : Node_Id) is
551 -- If the entity pointer is already set, this is an internal node, or a
552 -- node that is analyzed more than once, after a tree modification. In
553 -- such a case there is no resolution to perform, just set the type. For
554 -- completeness, analyze prefix as well.
556 if Present (Entity (N)) then
557 if Is_Type (Entity (N)) then
558 Set_Etype (N, Entity (N));
560 Set_Etype (N, Etype (Entity (N)));
563 Analyze (Prefix (N));
566 Find_Expanded_Name (N);
568 end Analyze_Expanded_Name;
570 ---------------------------------------
571 -- Analyze_Generic_Function_Renaming --
572 ---------------------------------------
574 procedure Analyze_Generic_Function_Renaming (N : Node_Id) is
576 Analyze_Generic_Renaming (N, E_Generic_Function);
577 end Analyze_Generic_Function_Renaming;
579 --------------------------------------
580 -- Analyze_Generic_Package_Renaming --
581 --------------------------------------
583 procedure Analyze_Generic_Package_Renaming (N : Node_Id) is
585 -- Apply the Text_IO Kludge here, since we may be renaming one of the
586 -- subpackages of Text_IO, then join common routine.
588 Text_IO_Kludge (Name (N));
590 Analyze_Generic_Renaming (N, E_Generic_Package);
591 end Analyze_Generic_Package_Renaming;
593 ----------------------------------------
594 -- Analyze_Generic_Procedure_Renaming --
595 ----------------------------------------
597 procedure Analyze_Generic_Procedure_Renaming (N : Node_Id) is
599 Analyze_Generic_Renaming (N, E_Generic_Procedure);
600 end Analyze_Generic_Procedure_Renaming;
602 ------------------------------
603 -- Analyze_Generic_Renaming --
604 ------------------------------
606 procedure Analyze_Generic_Renaming
610 New_P : constant Entity_Id := Defining_Entity (N);
612 Inst : Boolean := False; -- prevent junk warning
615 if Name (N) = Error then
619 Generate_Definition (New_P);
621 if Current_Scope /= Standard_Standard then
622 Set_Is_Pure (New_P, Is_Pure (Current_Scope));
625 if Nkind (Name (N)) = N_Selected_Component then
626 Check_Generic_Child_Unit (Name (N), Inst);
631 if not Is_Entity_Name (Name (N)) then
632 Error_Msg_N ("expect entity name in renaming declaration", Name (N));
635 Old_P := Entity (Name (N));
639 Set_Ekind (New_P, K);
641 if Etype (Old_P) = Any_Type then
644 elsif Ekind (Old_P) /= K then
645 Error_Msg_N ("invalid generic unit name", Name (N));
648 if Present (Renamed_Object (Old_P)) then
649 Set_Renamed_Object (New_P, Renamed_Object (Old_P));
651 Set_Renamed_Object (New_P, Old_P);
654 Set_Is_Pure (New_P, Is_Pure (Old_P));
655 Set_Is_Preelaborated (New_P, Is_Preelaborated (Old_P));
657 Set_Etype (New_P, Etype (Old_P));
658 Set_Has_Completion (New_P);
660 if In_Open_Scopes (Old_P) then
661 Error_Msg_N ("within its scope, generic denotes its instance", N);
664 Check_Library_Unit_Renaming (N, Old_P);
666 end Analyze_Generic_Renaming;
668 -----------------------------
669 -- Analyze_Object_Renaming --
670 -----------------------------
672 procedure Analyze_Object_Renaming (N : Node_Id) is
673 Id : constant Entity_Id := Defining_Identifier (N);
675 Nam : constant Node_Id := Name (N);
679 function In_Generic_Scope (E : Entity_Id) return Boolean;
680 -- Determine whether entity E is inside a generic cope
682 ----------------------
683 -- In_Generic_Scope --
684 ----------------------
686 function In_Generic_Scope (E : Entity_Id) return Boolean is
691 while Present (S) and then S /= Standard_Standard loop
692 if Is_Generic_Unit (S) then
700 end In_Generic_Scope;
702 -- Start of processing for Analyze_Object_Renaming
709 Set_Is_Pure (Id, Is_Pure (Current_Scope));
712 -- The renaming of a component that depends on a discriminant requires
713 -- an actual subtype, because in subsequent use of the object Gigi will
714 -- be unable to locate the actual bounds. This explicit step is required
715 -- when the renaming is generated in removing side effects of an
716 -- already-analyzed expression.
718 if Nkind (Nam) = N_Selected_Component
719 and then Analyzed (Nam)
722 Dec := Build_Actual_Subtype_Of_Component (Etype (Nam), Nam);
724 if Present (Dec) then
725 Insert_Action (N, Dec);
726 T := Defining_Identifier (Dec);
730 -- Complete analysis of the subtype mark in any case, for ASIS use
732 if Present (Subtype_Mark (N)) then
733 Find_Type (Subtype_Mark (N));
736 elsif Present (Subtype_Mark (N)) then
737 Find_Type (Subtype_Mark (N));
738 T := Entity (Subtype_Mark (N));
741 if Nkind (Nam) = N_Type_Conversion
742 and then not Is_Tagged_Type (T)
745 ("renaming of conversion only allowed for tagged types", Nam);
750 -- Check that a class-wide object is not being renamed as an object
751 -- of a specific type. The test for access types is needed to exclude
752 -- cases where the renamed object is a dynamically tagged access
753 -- result, such as occurs in certain expansions.
755 if (Is_Class_Wide_Type (Etype (Nam))
756 or else (Is_Dynamically_Tagged (Nam)
757 and then not Is_Access_Type (T)))
758 and then not Is_Class_Wide_Type (T)
760 Error_Msg_N ("dynamically tagged expression not allowed!", Nam);
763 -- Ada 2005 (AI-230/AI-254): Access renaming
765 else pragma Assert (Present (Access_Definition (N)));
766 T := Access_Definition
768 N => Access_Definition (N));
770 Analyze_And_Resolve (Nam, T);
772 -- Ada 2005 (AI-231): "In the case where the type is defined by an
773 -- access_definition, the renamed entity shall be of an access-to-
774 -- constant type if and only if the access_definition defines an
775 -- access-to-constant type" ARM 8.5.1(4)
777 if Constant_Present (Access_Definition (N))
778 and then not Is_Access_Constant (Etype (Nam))
780 Error_Msg_N ("(Ada 2005): the renamed object is not "
781 & "access-to-constant (RM 8.5.1(6))", N);
785 -- Special processing for renaming function return object
787 if Nkind (Nam) = N_Function_Call
788 and then Comes_From_Source (Nam)
792 -- Usage is illegal in Ada 83
796 ("(Ada 83) cannot rename function return object", Nam);
798 -- In Ada 95, warn for odd case of renaming parameterless function
799 -- call if this is not a limited type (where this is useful)
802 if Warn_On_Object_Renames_Function
803 and then No (Parameter_Associations (Nam))
804 and then not Is_Limited_Type (Etype (Nam))
807 ("?renaming function result object is suspicious",
810 ("\?function & will be called only once",
811 Nam, Entity (Name (Nam)));
813 ("\?suggest using an initialized constant object instead",
819 -- An object renaming requires an exact match of the type. Class-wide
820 -- matching is not allowed.
822 if Is_Class_Wide_Type (T)
823 and then Base_Type (Etype (Nam)) /= Base_Type (T)
830 -- (Ada 2005: AI-326): Handle wrong use of incomplete type
832 if Nkind (Nam) = N_Explicit_Dereference
833 and then Ekind (Etype (T2)) = E_Incomplete_Type
835 Error_Msg_N ("invalid use of incomplete type", Id);
841 if Ada_Version >= Ada_05
842 and then Nkind (Nam) = N_Attribute_Reference
843 and then Attribute_Name (Nam) = Name_Priority
847 elsif Ada_Version >= Ada_05
848 and then Nkind (Nam) in N_Has_Entity
855 if Nkind (Nam) = N_Attribute_Reference then
856 Nam_Ent := Entity (Prefix (Nam));
858 Nam_Ent := Entity (Nam);
861 Nam_Decl := Parent (Nam_Ent);
863 if Has_Null_Exclusion (N)
864 and then not Has_Null_Exclusion (Nam_Decl)
866 -- Ada 2005 (AI-423): If the object name denotes a generic
867 -- formal object of a generic unit G, and the object renaming
868 -- declaration occurs within the body of G or within the body
869 -- of a generic unit declared within the declarative region
870 -- of G, then the declaration of the formal object of G must
871 -- have a null exclusion.
873 if Is_Formal_Object (Nam_Ent)
874 and then In_Generic_Scope (Id)
877 ("renamed formal does not exclude `NULL` "
878 & "(RM 8.5.1(4.6/2))", N);
880 -- Ada 2005 (AI-423): Otherwise, the subtype of the object name
881 -- shall exclude null.
883 elsif not Can_Never_Be_Null (Etype (Nam_Ent)) then
885 ("renamed object does not exclude `NULL` "
886 & "(RM 8.5.1(4.6/2))", N);
892 Set_Ekind (Id, E_Variable);
893 Init_Size_Align (Id);
895 if T = Any_Type or else Etype (Nam) = Any_Type then
898 -- Verify that the renamed entity is an object or a function call. It
899 -- may have been rewritten in several ways.
901 elsif Is_Object_Reference (Nam) then
902 if Comes_From_Source (N)
903 and then Is_Dependent_Component_Of_Mutable_Object (Nam)
906 ("illegal renaming of discriminant-dependent component", Nam);
911 -- A static function call may have been folded into a literal
913 elsif Nkind (Original_Node (Nam)) = N_Function_Call
915 -- When expansion is disabled, attribute reference is not
916 -- rewritten as function call. Otherwise it may be rewritten
917 -- as a conversion, so check original node.
919 or else (Nkind (Original_Node (Nam)) = N_Attribute_Reference
920 and then Is_Function_Attribute_Name
921 (Attribute_Name (Original_Node (Nam))))
923 -- Weird but legal, equivalent to renaming a function call.
924 -- Illegal if the literal is the result of constant-folding an
925 -- attribute reference that is not a function.
927 or else (Is_Entity_Name (Nam)
928 and then Ekind (Entity (Nam)) = E_Enumeration_Literal
930 Nkind (Original_Node (Nam)) /= N_Attribute_Reference)
932 or else (Nkind (Nam) = N_Type_Conversion
933 and then Is_Tagged_Type (Entity (Subtype_Mark (Nam))))
937 elsif Nkind (Nam) = N_Type_Conversion then
939 ("renaming of conversion only allowed for tagged types", Nam);
943 elsif Ada_Version >= Ada_05
944 and then Nkind (Nam) = N_Attribute_Reference
945 and then Attribute_Name (Nam) = Name_Priority
949 -- Allow internally generated x'Reference expression
951 elsif Nkind (Nam) = N_Reference then
955 Error_Msg_N ("expect object name in renaming", Nam);
960 if not Is_Variable (Nam) then
961 Set_Ekind (Id, E_Constant);
962 Set_Never_Set_In_Source (Id, True);
963 Set_Is_True_Constant (Id, True);
966 Set_Renamed_Object (Id, Nam);
967 end Analyze_Object_Renaming;
969 ------------------------------
970 -- Analyze_Package_Renaming --
971 ------------------------------
973 procedure Analyze_Package_Renaming (N : Node_Id) is
974 New_P : constant Entity_Id := Defining_Entity (N);
979 if Name (N) = Error then
983 -- Apply Text_IO kludge here, since we may be renaming one of the
984 -- children of Text_IO.
986 Text_IO_Kludge (Name (N));
988 if Current_Scope /= Standard_Standard then
989 Set_Is_Pure (New_P, Is_Pure (Current_Scope));
995 if Is_Entity_Name (Name (N)) then
996 Old_P := Entity (Name (N));
1001 if Etype (Old_P) = Any_Type then
1003 ("expect package name in renaming", Name (N));
1005 elsif Ekind (Old_P) /= E_Package
1006 and then not (Ekind (Old_P) = E_Generic_Package
1007 and then In_Open_Scopes (Old_P))
1009 if Ekind (Old_P) = E_Generic_Package then
1011 ("generic package cannot be renamed as a package", Name (N));
1013 Error_Msg_Sloc := Sloc (Old_P);
1015 ("expect package name in renaming, found& declared#",
1019 -- Set basic attributes to minimize cascaded errors
1021 Set_Ekind (New_P, E_Package);
1022 Set_Etype (New_P, Standard_Void_Type);
1024 -- Here for OK package renaming
1027 -- Entities in the old package are accessible through the renaming
1028 -- entity. The simplest implementation is to have both packages share
1031 Set_Ekind (New_P, E_Package);
1032 Set_Etype (New_P, Standard_Void_Type);
1034 if Present (Renamed_Object (Old_P)) then
1035 Set_Renamed_Object (New_P, Renamed_Object (Old_P));
1037 Set_Renamed_Object (New_P, Old_P);
1040 Set_Has_Completion (New_P);
1042 Set_First_Entity (New_P, First_Entity (Old_P));
1043 Set_Last_Entity (New_P, Last_Entity (Old_P));
1044 Set_First_Private_Entity (New_P, First_Private_Entity (Old_P));
1045 Check_Library_Unit_Renaming (N, Old_P);
1046 Generate_Reference (Old_P, Name (N));
1048 -- If the renaming is in the visible part of a package, then we set
1049 -- Renamed_In_Spec for the renamed package, to prevent giving
1050 -- warnings about no entities referenced. Such a warning would be
1051 -- overenthusiastic, since clients can see entities in the renamed
1052 -- package via the visible package renaming.
1055 Ent : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
1057 if Ekind (Ent) = E_Package
1058 and then not In_Private_Part (Ent)
1059 and then In_Extended_Main_Source_Unit (N)
1060 and then Ekind (Old_P) = E_Package
1062 Set_Renamed_In_Spec (Old_P);
1066 -- If this is the renaming declaration of a package instantiation
1067 -- within itself, it is the declaration that ends the list of actuals
1068 -- for the instantiation. At this point, the subtypes that rename
1069 -- the actuals are flagged as generic, to avoid spurious ambiguities
1070 -- if the actuals for two distinct formals happen to coincide. If
1071 -- the actual is a private type, the subtype has a private completion
1072 -- that is flagged in the same fashion.
1074 -- Resolution is identical to what is was in the original generic.
1075 -- On exit from the generic instance, these are turned into regular
1076 -- subtypes again, so they are compatible with types in their class.
1078 if not Is_Generic_Instance (Old_P) then
1081 Spec := Specification (Unit_Declaration_Node (Old_P));
1084 if Nkind (Spec) = N_Package_Specification
1085 and then Present (Generic_Parent (Spec))
1086 and then Old_P = Current_Scope
1087 and then Chars (New_P) = Chars (Generic_Parent (Spec))
1093 E := First_Entity (Old_P);
1098 and then Nkind (Parent (E)) = N_Subtype_Declaration
1100 Set_Is_Generic_Actual_Type (E);
1102 if Is_Private_Type (E)
1103 and then Present (Full_View (E))
1105 Set_Is_Generic_Actual_Type (Full_View (E));
1114 end Analyze_Package_Renaming;
1116 -------------------------------
1117 -- Analyze_Renamed_Character --
1118 -------------------------------
1120 procedure Analyze_Renamed_Character
1125 C : constant Node_Id := Name (N);
1128 if Ekind (New_S) = E_Function then
1129 Resolve (C, Etype (New_S));
1132 Check_Frozen_Renaming (N, New_S);
1136 Error_Msg_N ("character literal can only be renamed as function", N);
1138 end Analyze_Renamed_Character;
1140 ---------------------------------
1141 -- Analyze_Renamed_Dereference --
1142 ---------------------------------
1144 procedure Analyze_Renamed_Dereference
1149 Nam : constant Node_Id := Name (N);
1150 P : constant Node_Id := Prefix (Nam);
1156 if not Is_Overloaded (P) then
1157 if Ekind (Etype (Nam)) /= E_Subprogram_Type
1158 or else not Type_Conformant (Etype (Nam), New_S) then
1159 Error_Msg_N ("designated type does not match specification", P);
1168 Get_First_Interp (Nam, Ind, It);
1170 while Present (It.Nam) loop
1172 if Ekind (It.Nam) = E_Subprogram_Type
1173 and then Type_Conformant (It.Nam, New_S) then
1175 if Typ /= Any_Id then
1176 Error_Msg_N ("ambiguous renaming", P);
1183 Get_Next_Interp (Ind, It);
1186 if Typ = Any_Type then
1187 Error_Msg_N ("designated type does not match specification", P);
1192 Check_Frozen_Renaming (N, New_S);
1196 end Analyze_Renamed_Dereference;
1198 ---------------------------
1199 -- Analyze_Renamed_Entry --
1200 ---------------------------
1202 procedure Analyze_Renamed_Entry
1207 Nam : constant Node_Id := Name (N);
1208 Sel : constant Node_Id := Selector_Name (Nam);
1212 if Entity (Sel) = Any_Id then
1214 -- Selector is undefined on prefix. Error emitted already
1216 Set_Has_Completion (New_S);
1220 -- Otherwise find renamed entity and build body of New_S as a call to it
1222 Old_S := Find_Renamed_Entity (N, Selector_Name (Nam), New_S);
1224 if Old_S = Any_Id then
1225 Error_Msg_N (" no subprogram or entry matches specification", N);
1228 Check_Subtype_Conformant (New_S, Old_S, N);
1229 Generate_Reference (New_S, Defining_Entity (N), 'b');
1230 Style.Check_Identifier (Defining_Entity (N), New_S);
1233 -- Only mode conformance required for a renaming_as_declaration
1235 Check_Mode_Conformant (New_S, Old_S, N);
1238 Inherit_Renamed_Profile (New_S, Old_S);
1240 -- The prefix can be an arbitrary expression that yields a task
1241 -- type, so it must be resolved.
1243 Resolve (Prefix (Nam), Scope (Old_S));
1246 Set_Convention (New_S, Convention (Old_S));
1247 Set_Has_Completion (New_S, Inside_A_Generic);
1250 Check_Frozen_Renaming (N, New_S);
1252 end Analyze_Renamed_Entry;
1254 -----------------------------------
1255 -- Analyze_Renamed_Family_Member --
1256 -----------------------------------
1258 procedure Analyze_Renamed_Family_Member
1263 Nam : constant Node_Id := Name (N);
1264 P : constant Node_Id := Prefix (Nam);
1268 if (Is_Entity_Name (P) and then Ekind (Entity (P)) = E_Entry_Family)
1269 or else (Nkind (P) = N_Selected_Component
1271 Ekind (Entity (Selector_Name (P))) = E_Entry_Family)
1273 if Is_Entity_Name (P) then
1274 Old_S := Entity (P);
1276 Old_S := Entity (Selector_Name (P));
1279 if not Entity_Matches_Spec (Old_S, New_S) then
1280 Error_Msg_N ("entry family does not match specification", N);
1283 Check_Subtype_Conformant (New_S, Old_S, N);
1284 Generate_Reference (New_S, Defining_Entity (N), 'b');
1285 Style.Check_Identifier (Defining_Entity (N), New_S);
1289 Error_Msg_N ("no entry family matches specification", N);
1292 Set_Has_Completion (New_S, Inside_A_Generic);
1295 Check_Frozen_Renaming (N, New_S);
1297 end Analyze_Renamed_Family_Member;
1299 -----------------------------------------
1300 -- Analyze_Renamed_Primitive_Operation --
1301 -----------------------------------------
1303 procedure Analyze_Renamed_Primitive_Operation
1312 Ctyp : Conformance_Type) return Boolean;
1313 -- Verify that the signatures of the renamed entity and the new entity
1314 -- match. The first formal of the renamed entity is skipped because it
1315 -- is the target object in any subsequent call.
1319 Ctyp : Conformance_Type) return Boolean
1325 if Ekind (Subp) /= Ekind (New_S) then
1329 Old_F := Next_Formal (First_Formal (Subp));
1330 New_F := First_Formal (New_S);
1331 while Present (Old_F) and then Present (New_F) loop
1332 if not Conforming_Types (Etype (Old_F), Etype (New_F), Ctyp) then
1336 if Ctyp >= Mode_Conformant
1337 and then Ekind (Old_F) /= Ekind (New_F)
1342 Next_Formal (New_F);
1343 Next_Formal (Old_F);
1350 if not Is_Overloaded (Selector_Name (Name (N))) then
1351 Old_S := Entity (Selector_Name (Name (N)));
1353 if not Conforms (Old_S, Type_Conformant) then
1358 -- Find the operation that matches the given signature
1366 Get_First_Interp (Selector_Name (Name (N)), Ind, It);
1368 while Present (It.Nam) loop
1369 if Conforms (It.Nam, Type_Conformant) then
1373 Get_Next_Interp (Ind, It);
1378 if Old_S = Any_Id then
1379 Error_Msg_N (" no subprogram or entry matches specification", N);
1383 if not Conforms (Old_S, Subtype_Conformant) then
1384 Error_Msg_N ("subtype conformance error in renaming", N);
1387 Generate_Reference (New_S, Defining_Entity (N), 'b');
1388 Style.Check_Identifier (Defining_Entity (N), New_S);
1391 -- Only mode conformance required for a renaming_as_declaration
1393 if not Conforms (Old_S, Mode_Conformant) then
1394 Error_Msg_N ("mode conformance error in renaming", N);
1398 -- Inherit_Renamed_Profile (New_S, Old_S);
1400 -- The prefix can be an arbitrary expression that yields an
1401 -- object, so it must be resolved.
1403 Resolve (Prefix (Name (N)));
1405 end Analyze_Renamed_Primitive_Operation;
1407 ---------------------------------
1408 -- Analyze_Subprogram_Renaming --
1409 ---------------------------------
1411 procedure Analyze_Subprogram_Renaming (N : Node_Id) is
1412 Formal_Spec : constant Node_Id := Corresponding_Formal_Spec (N);
1413 Is_Actual : constant Boolean := Present (Formal_Spec);
1414 Inst_Node : Node_Id := Empty;
1415 Nam : constant Node_Id := Name (N);
1417 Old_S : Entity_Id := Empty;
1418 Rename_Spec : Entity_Id;
1419 Save_AV : constant Ada_Version_Type := Ada_Version;
1420 Save_AV_Exp : constant Ada_Version_Type := Ada_Version_Explicit;
1421 Spec : constant Node_Id := Specification (N);
1423 procedure Check_Null_Exclusion
1426 -- Ada 2005 (AI-423): Given renaming Ren of subprogram Sub, check the
1427 -- following AI rules:
1429 -- If Ren is a renaming of a formal subprogram and one of its
1430 -- parameters has a null exclusion, then the corresponding formal
1431 -- in Sub must also have one. Otherwise the subtype of the Sub's
1432 -- formal parameter must exclude null.
1434 -- If Ren is a renaming of a formal function and its return
1435 -- profile has a null exclusion, then Sub's return profile must
1436 -- have one. Otherwise the subtype of Sub's return profile must
1439 function Original_Subprogram (Subp : Entity_Id) return Entity_Id;
1440 -- Find renamed entity when the declaration is a renaming_as_body and
1441 -- the renamed entity may itself be a renaming_as_body. Used to enforce
1442 -- rule that a renaming_as_body is illegal if the declaration occurs
1443 -- before the subprogram it completes is frozen, and renaming indirectly
1444 -- renames the subprogram itself.(Defect Report 8652/0027).
1446 --------------------------
1447 -- Check_Null_Exclusion --
1448 --------------------------
1450 procedure Check_Null_Exclusion
1454 Ren_Formal : Entity_Id;
1455 Sub_Formal : Entity_Id;
1460 Ren_Formal := First_Formal (Ren);
1461 Sub_Formal := First_Formal (Sub);
1462 while Present (Ren_Formal)
1463 and then Present (Sub_Formal)
1465 if Has_Null_Exclusion (Parent (Ren_Formal))
1467 not (Has_Null_Exclusion (Parent (Sub_Formal))
1468 or else Can_Never_Be_Null (Etype (Sub_Formal)))
1471 ("`NOT NULL` required for parameter &",
1472 Parent (Sub_Formal), Sub_Formal);
1475 Next_Formal (Ren_Formal);
1476 Next_Formal (Sub_Formal);
1479 -- Return profile check
1481 if Nkind (Parent (Ren)) = N_Function_Specification
1482 and then Nkind (Parent (Sub)) = N_Function_Specification
1483 and then Has_Null_Exclusion (Parent (Ren))
1485 not (Has_Null_Exclusion (Parent (Sub))
1486 or else Can_Never_Be_Null (Etype (Sub)))
1489 ("return must specify `NOT NULL`",
1490 Result_Definition (Parent (Sub)));
1492 end Check_Null_Exclusion;
1494 -------------------------
1495 -- Original_Subprogram --
1496 -------------------------
1498 function Original_Subprogram (Subp : Entity_Id) return Entity_Id is
1499 Orig_Decl : Node_Id;
1500 Orig_Subp : Entity_Id;
1503 -- First case: renamed entity is itself a renaming
1505 if Present (Alias (Subp)) then
1506 return Alias (Subp);
1509 Nkind (Unit_Declaration_Node (Subp)) = N_Subprogram_Declaration
1511 (Corresponding_Body (Unit_Declaration_Node (Subp)))
1513 -- Check if renamed entity is a renaming_as_body
1516 Unit_Declaration_Node
1517 (Corresponding_Body (Unit_Declaration_Node (Subp)));
1519 if Nkind (Orig_Decl) = N_Subprogram_Renaming_Declaration then
1520 Orig_Subp := Entity (Name (Orig_Decl));
1522 if Orig_Subp = Rename_Spec then
1524 -- Circularity detected
1529 return (Original_Subprogram (Orig_Subp));
1537 end Original_Subprogram;
1539 -- Start of processing for Analyze_Subprogram_Renaming
1542 -- We must test for the attribute renaming case before the Analyze
1543 -- call because otherwise Sem_Attr will complain that the attribute
1544 -- is missing an argument when it is analyzed.
1546 if Nkind (Nam) = N_Attribute_Reference then
1548 -- In the case of an abstract formal subprogram association, rewrite
1549 -- an actual given by a stream attribute as the name of the
1550 -- corresponding stream primitive of the type.
1552 -- In a generic context the stream operations are not generated, and
1553 -- this must be treated as a normal attribute reference, to be
1554 -- expanded in subsequent instantiations.
1556 if Is_Actual and then Is_Abstract_Subprogram (Formal_Spec)
1557 and then Expander_Active
1560 Stream_Prim : Entity_Id;
1561 Prefix_Type : constant Entity_Id := Entity (Prefix (Nam));
1564 -- The class-wide forms of the stream attributes are not
1565 -- primitive dispatching operations (even though they
1566 -- internally dispatch to a stream attribute).
1568 if Is_Class_Wide_Type (Prefix_Type) then
1570 ("attribute must be a primitive dispatching operation",
1575 -- Retrieve the primitive subprogram associated with the
1576 -- attribute. This can only be a stream attribute, since those
1577 -- are the only ones that are dispatching (and the actual for
1578 -- an abstract formal subprogram must be dispatching
1581 case Attribute_Name (Nam) is
1584 Find_Prim_Op (Prefix_Type, TSS_Stream_Input);
1587 Find_Prim_Op (Prefix_Type, TSS_Stream_Output);
1590 Find_Prim_Op (Prefix_Type, TSS_Stream_Read);
1593 Find_Prim_Op (Prefix_Type, TSS_Stream_Write);
1596 ("attribute must be a primitive dispatching operation",
1601 -- Rewrite the attribute into the name of its corresponding
1602 -- primitive dispatching subprogram. We can then proceed with
1603 -- the usual processing for subprogram renamings.
1606 Prim_Name : constant Node_Id :=
1607 Make_Identifier (Sloc (Nam),
1608 Chars => Chars (Stream_Prim));
1610 Set_Entity (Prim_Name, Stream_Prim);
1611 Rewrite (Nam, Prim_Name);
1616 -- Normal processing for a renaming of an attribute
1619 Attribute_Renaming (N);
1624 -- Check whether this declaration corresponds to the instantiation
1625 -- of a formal subprogram.
1627 -- If this is an instantiation, the corresponding actual is frozen and
1628 -- error messages can be made more precise. If this is a default
1629 -- subprogram, the entity is already established in the generic, and is
1630 -- not retrieved by visibility. If it is a default with a box, the
1631 -- candidate interpretations, if any, have been collected when building
1632 -- the renaming declaration. If overloaded, the proper interpretation is
1633 -- determined in Find_Renamed_Entity. If the entity is an operator,
1634 -- Find_Renamed_Entity applies additional visibility checks.
1637 Inst_Node := Unit_Declaration_Node (Formal_Spec);
1639 if Is_Entity_Name (Nam)
1640 and then Present (Entity (Nam))
1641 and then not Comes_From_Source (Nam)
1642 and then not Is_Overloaded (Nam)
1644 Old_S := Entity (Nam);
1645 New_S := Analyze_Subprogram_Specification (Spec);
1649 if Ekind (Entity (Nam)) = E_Operator then
1653 if Box_Present (Inst_Node) then
1654 Old_S := Find_Renamed_Entity (N, Name (N), New_S, Is_Actual);
1656 -- If there is an immediately visible homonym of the operator
1657 -- and the declaration has a default, this is worth a warning
1658 -- because the user probably did not intend to get the pre-
1659 -- defined operator, visible in the generic declaration. To
1660 -- find if there is an intended candidate, analyze the renaming
1661 -- again in the current context.
1663 elsif Scope (Old_S) = Standard_Standard
1664 and then Present (Default_Name (Inst_Node))
1667 Decl : constant Node_Id := New_Copy_Tree (N);
1671 Set_Entity (Name (Decl), Empty);
1672 Analyze (Name (Decl));
1674 Find_Renamed_Entity (Decl, Name (Decl), New_S, True);
1677 and then In_Open_Scopes (Scope (Hidden))
1678 and then Is_Immediately_Visible (Hidden)
1679 and then Comes_From_Source (Hidden)
1680 and then Hidden /= Old_S
1682 Error_Msg_Sloc := Sloc (Hidden);
1683 Error_Msg_N ("?default subprogram is resolved " &
1684 "in the generic declaration " &
1685 "(RM 12.6(17))", N);
1686 Error_Msg_NE ("\?and will not use & #", N, Hidden);
1694 New_S := Analyze_Subprogram_Specification (Spec);
1698 -- Renamed entity must be analyzed first, to avoid being hidden by
1699 -- new name (which might be the same in a generic instance).
1703 -- The renaming defines a new overloaded entity, which is analyzed
1704 -- like a subprogram declaration.
1706 New_S := Analyze_Subprogram_Specification (Spec);
1709 if Current_Scope /= Standard_Standard then
1710 Set_Is_Pure (New_S, Is_Pure (Current_Scope));
1713 Rename_Spec := Find_Corresponding_Spec (N);
1715 -- Case of Renaming_As_Body
1717 if Present (Rename_Spec) then
1719 -- Renaming declaration is the completion of the declaration of
1720 -- Rename_Spec. We build an actual body for it at the freezing point.
1722 Set_Corresponding_Spec (N, Rename_Spec);
1724 -- Deal with special case of Input and Output stream functions
1726 if Nkind (Unit_Declaration_Node (Rename_Spec)) =
1727 N_Abstract_Subprogram_Declaration
1729 -- Input and Output stream functions are abstract if the object
1730 -- type is abstract. However, these functions may receive explicit
1731 -- declarations in representation clauses, making the attribute
1732 -- subprograms usable as defaults in subsequent type extensions.
1733 -- In this case we rewrite the declaration to make the subprogram
1734 -- non-abstract. We remove the previous declaration, and insert
1735 -- the new one at the point of the renaming, to prevent premature
1736 -- access to unfrozen types. The new declaration reuses the
1737 -- specification of the previous one, and must not be analyzed.
1739 pragma Assert (Is_TSS (Rename_Spec, TSS_Stream_Output)
1740 or else Is_TSS (Rename_Spec, TSS_Stream_Input));
1743 Old_Decl : constant Node_Id :=
1744 Unit_Declaration_Node (Rename_Spec);
1745 New_Decl : constant Node_Id :=
1746 Make_Subprogram_Declaration (Sloc (N),
1748 Relocate_Node (Specification (Old_Decl)));
1751 Insert_After (N, New_Decl);
1752 Set_Is_Abstract_Subprogram (Rename_Spec, False);
1753 Set_Analyzed (New_Decl);
1757 Set_Corresponding_Body (Unit_Declaration_Node (Rename_Spec), New_S);
1759 if Ada_Version = Ada_83 and then Comes_From_Source (N) then
1760 Error_Msg_N ("(Ada 83) renaming cannot serve as a body", N);
1763 Set_Convention (New_S, Convention (Rename_Spec));
1764 Check_Fully_Conformant (New_S, Rename_Spec);
1765 Set_Public_Status (New_S);
1767 -- The specification does not introduce new formals, but only
1768 -- repeats the formals of the original subprogram declaration.
1769 -- For cross-reference purposes, and for refactoring tools, we
1770 -- treat the formals of the renaming declaration as body formals.
1772 Reference_Body_Formals (Rename_Spec, New_S);
1774 -- Indicate that the entity in the declaration functions like the
1775 -- corresponding body, and is not a new entity. The body will be
1776 -- constructed later at the freeze point, so indicate that the
1777 -- completion has not been seen yet.
1779 Set_Ekind (New_S, E_Subprogram_Body);
1780 New_S := Rename_Spec;
1781 Set_Has_Completion (Rename_Spec, False);
1783 -- Ada 2005: check overriding indicator
1785 if Must_Override (Specification (N))
1786 and then not Is_Overriding_Operation (Rename_Spec)
1788 Error_Msg_NE ("subprogram& is not overriding", N, Rename_Spec);
1790 elsif Must_Not_Override (Specification (N))
1791 and then Is_Overriding_Operation (Rename_Spec)
1794 ("subprogram& overrides inherited operation", N, Rename_Spec);
1797 -- Normal subprogram renaming (not renaming as body)
1800 Generate_Definition (New_S);
1801 New_Overloaded_Entity (New_S);
1803 if Is_Entity_Name (Nam)
1804 and then Is_Intrinsic_Subprogram (Entity (Nam))
1808 Check_Delayed_Subprogram (New_S);
1812 -- There is no need for elaboration checks on the new entity, which may
1813 -- be called before the next freezing point where the body will appear.
1814 -- Elaboration checks refer to the real entity, not the one created by
1815 -- the renaming declaration.
1817 Set_Kill_Elaboration_Checks (New_S, True);
1819 if Etype (Nam) = Any_Type then
1820 Set_Has_Completion (New_S);
1823 elsif Nkind (Nam) = N_Selected_Component then
1825 -- A prefix of the form A.B can designate an entry of task A, a
1826 -- protected operation of protected object A, or finally a primitive
1827 -- operation of object A. In the later case, A is an object of some
1828 -- tagged type, or an access type that denotes one such. To further
1829 -- distinguish these cases, note that the scope of a task entry or
1830 -- protected operation is type of the prefix.
1832 -- The prefix could be an overloaded function call that returns both
1833 -- kinds of operations. This overloading pathology is left to the
1834 -- dedicated reader ???
1837 T : constant Entity_Id := Etype (Prefix (Nam));
1846 Is_Tagged_Type (Designated_Type (T))))
1847 and then Scope (Entity (Selector_Name (Nam))) /= T
1849 Analyze_Renamed_Primitive_Operation
1850 (N, New_S, Present (Rename_Spec));
1854 -- Renamed entity is an entry or protected operation. For those
1855 -- cases an explicit body is built (at the point of freezing of
1856 -- this entity) that contains a call to the renamed entity.
1858 -- This is not allowed for renaming as body if the renamed
1859 -- spec is already frozen (see RM 8.5.4(5) for details).
1861 if Present (Rename_Spec)
1862 and then Is_Frozen (Rename_Spec)
1865 ("renaming-as-body cannot rename entry as subprogram", N);
1867 ("\since & is already frozen (RM 8.5.4(5))",
1870 Analyze_Renamed_Entry (N, New_S, Present (Rename_Spec));
1877 elsif Nkind (Nam) = N_Explicit_Dereference then
1879 -- Renamed entity is designated by access_to_subprogram expression.
1880 -- Must build body to encapsulate call, as in the entry case.
1882 Analyze_Renamed_Dereference (N, New_S, Present (Rename_Spec));
1885 elsif Nkind (Nam) = N_Indexed_Component then
1886 Analyze_Renamed_Family_Member (N, New_S, Present (Rename_Spec));
1889 elsif Nkind (Nam) = N_Character_Literal then
1890 Analyze_Renamed_Character (N, New_S, Present (Rename_Spec));
1893 elsif (not Is_Entity_Name (Nam)
1894 and then Nkind (Nam) /= N_Operator_Symbol)
1895 or else not Is_Overloadable (Entity (Nam))
1897 Error_Msg_N ("expect valid subprogram name in renaming", N);
1901 -- Find the renamed entity that matches the given specification. Disable
1902 -- Ada_83 because there is no requirement of full conformance between
1903 -- renamed entity and new entity, even though the same circuit is used.
1905 -- This is a bit of a kludge, which introduces a really irregular use of
1906 -- Ada_Version[_Explicit]. Would be nice to find cleaner way to do this
1909 Ada_Version := Ada_Version_Type'Max (Ada_Version, Ada_95);
1910 Ada_Version_Explicit := Ada_Version;
1913 Old_S := Find_Renamed_Entity (N, Name (N), New_S, Is_Actual);
1915 -- When the renamed subprogram is overloaded and used as an actual
1916 -- of a generic, its entity is set to the first available homonym.
1917 -- We must first disambiguate the name, then set the proper entity.
1920 and then Is_Overloaded (Nam)
1922 Set_Entity (Nam, Old_S);
1926 -- Most common case: subprogram renames subprogram. No body is generated
1927 -- in this case, so we must indicate the declaration is complete as is.
1929 if No (Rename_Spec) then
1930 Set_Has_Completion (New_S);
1931 Set_Is_Pure (New_S, Is_Pure (Entity (Nam)));
1932 Set_Is_Preelaborated (New_S, Is_Preelaborated (Entity (Nam)));
1934 -- Ada 2005 (AI-423): Check the consistency of null exclusions
1935 -- between a subprogram and its correct renaming.
1937 -- Note: the Any_Id check is a guard that prevents compiler crashes
1938 -- when performing a null exclusion check between a renaming and a
1939 -- renamed subprogram that has been found to be illegal.
1941 if Ada_Version >= Ada_05
1942 and then Entity (Nam) /= Any_Id
1944 Check_Null_Exclusion
1946 Sub => Entity (Nam));
1949 -- Enforce the Ada 2005 rule that the renamed entity cannot require
1950 -- overriding. The flag Requires_Overriding is set very selectively
1951 -- and misses some other illegal cases. The additional conditions
1952 -- checked below are sufficient but not necessary ???
1954 -- The rule does not apply to the renaming generated for an actual
1955 -- subprogram in an instance.
1960 -- Guard against previous errors, and omit renamings of predefined
1963 elsif Ekind (Old_S) /= E_Function
1964 and then Ekind (Old_S) /= E_Procedure
1968 elsif Requires_Overriding (Old_S)
1970 (Is_Abstract_Subprogram (Old_S)
1971 and then Present (Find_Dispatching_Type (Old_S))
1973 not Is_Abstract_Type (Find_Dispatching_Type (Old_S)))
1976 ("renamed entity cannot be "
1977 & "subprogram that requires overriding (RM 8.5.4 (5.1))", N);
1981 if Old_S /= Any_Id then
1983 and then From_Default (N)
1985 -- This is an implicit reference to the default actual
1987 Generate_Reference (Old_S, Nam, Typ => 'i', Force => True);
1989 Generate_Reference (Old_S, Nam);
1992 -- For a renaming-as-body, require subtype conformance, but if the
1993 -- declaration being completed has not been frozen, then inherit the
1994 -- convention of the renamed subprogram prior to checking conformance
1995 -- (unless the renaming has an explicit convention established; the
1996 -- rule stated in the RM doesn't seem to address this ???).
1998 if Present (Rename_Spec) then
1999 Generate_Reference (Rename_Spec, Defining_Entity (Spec), 'b');
2000 Style.Check_Identifier (Defining_Entity (Spec), Rename_Spec);
2002 if not Is_Frozen (Rename_Spec) then
2003 if not Has_Convention_Pragma (Rename_Spec) then
2004 Set_Convention (New_S, Convention (Old_S));
2007 if Ekind (Old_S) /= E_Operator then
2008 Check_Mode_Conformant (New_S, Old_S, Spec);
2011 if Original_Subprogram (Old_S) = Rename_Spec then
2012 Error_Msg_N ("unfrozen subprogram cannot rename itself ", N);
2015 Check_Subtype_Conformant (New_S, Old_S, Spec);
2018 Check_Frozen_Renaming (N, Rename_Spec);
2020 -- Check explicitly that renamed entity is not intrinsic, because
2021 -- in in a generic the renamed body is not built. In this case,
2022 -- the renaming_as_body is a completion.
2024 if Inside_A_Generic then
2025 if Is_Frozen (Rename_Spec)
2026 and then Is_Intrinsic_Subprogram (Old_S)
2029 ("subprogram in renaming_as_body cannot be intrinsic",
2033 Set_Has_Completion (Rename_Spec);
2036 elsif Ekind (Old_S) /= E_Operator then
2037 Check_Mode_Conformant (New_S, Old_S);
2040 and then Error_Posted (New_S)
2042 Error_Msg_NE ("invalid actual subprogram: & #!", N, Old_S);
2046 if No (Rename_Spec) then
2048 -- The parameter profile of the new entity is that of the renamed
2049 -- entity: the subtypes given in the specification are irrelevant.
2051 Inherit_Renamed_Profile (New_S, Old_S);
2053 -- A call to the subprogram is transformed into a call to the
2054 -- renamed entity. This is transitive if the renamed entity is
2055 -- itself a renaming.
2057 if Present (Alias (Old_S)) then
2058 Set_Alias (New_S, Alias (Old_S));
2060 Set_Alias (New_S, Old_S);
2063 -- Note that we do not set Is_Intrinsic_Subprogram if we have a
2064 -- renaming as body, since the entity in this case is not an
2065 -- intrinsic (it calls an intrinsic, but we have a real body for
2066 -- this call, and it is in this body that the required intrinsic
2067 -- processing will take place).
2069 -- Also, if this is a renaming of inequality, the renamed operator
2070 -- is intrinsic, but what matters is the corresponding equality
2071 -- operator, which may be user-defined.
2073 Set_Is_Intrinsic_Subprogram
2075 Is_Intrinsic_Subprogram (Old_S)
2077 (Chars (Old_S) /= Name_Op_Ne
2078 or else Ekind (Old_S) = E_Operator
2080 Is_Intrinsic_Subprogram
2081 (Corresponding_Equality (Old_S))));
2083 if Ekind (Alias (New_S)) = E_Operator then
2084 Set_Has_Delayed_Freeze (New_S, False);
2087 -- If the renaming corresponds to an association for an abstract
2088 -- formal subprogram, then various attributes must be set to
2089 -- indicate that the renaming is an abstract dispatching operation
2090 -- with a controlling type.
2092 if Is_Actual and then Is_Abstract_Subprogram (Formal_Spec) then
2094 -- Mark the renaming as abstract here, so Find_Dispatching_Type
2095 -- see it as corresponding to a generic association for a
2096 -- formal abstract subprogram
2098 Set_Is_Abstract_Subprogram (New_S);
2101 New_S_Ctrl_Type : constant Entity_Id :=
2102 Find_Dispatching_Type (New_S);
2103 Old_S_Ctrl_Type : constant Entity_Id :=
2104 Find_Dispatching_Type (Old_S);
2107 if Old_S_Ctrl_Type /= New_S_Ctrl_Type then
2109 ("actual must be dispatching subprogram for type&",
2110 Nam, New_S_Ctrl_Type);
2113 Set_Is_Dispatching_Operation (New_S);
2114 Check_Controlling_Formals (New_S_Ctrl_Type, New_S);
2116 -- If the actual in the formal subprogram is itself a
2117 -- formal abstract subprogram association, there's no
2118 -- dispatch table component or position to inherit.
2120 if Present (DTC_Entity (Old_S)) then
2121 Set_DTC_Entity (New_S, DTC_Entity (Old_S));
2122 Set_DT_Position (New_S, DT_Position (Old_S));
2130 and then (Old_S = New_S
2131 or else (Nkind (Nam) /= N_Expanded_Name
2132 and then Chars (Old_S) = Chars (New_S)))
2134 Error_Msg_N ("subprogram cannot rename itself", N);
2137 Set_Convention (New_S, Convention (Old_S));
2139 if Is_Abstract_Subprogram (Old_S) then
2140 if Present (Rename_Spec) then
2142 ("a renaming-as-body cannot rename an abstract subprogram",
2144 Set_Has_Completion (Rename_Spec);
2146 Set_Is_Abstract_Subprogram (New_S);
2150 Check_Library_Unit_Renaming (N, Old_S);
2152 -- Pathological case: procedure renames entry in the scope of its
2153 -- task. Entry is given by simple name, but body must be built for
2154 -- procedure. Of course if called it will deadlock.
2156 if Ekind (Old_S) = E_Entry then
2157 Set_Has_Completion (New_S, False);
2158 Set_Alias (New_S, Empty);
2162 Freeze_Before (N, Old_S);
2163 Set_Has_Delayed_Freeze (New_S, False);
2164 Freeze_Before (N, New_S);
2166 -- An abstract subprogram is only allowed as an actual in the case
2167 -- where the formal subprogram is also abstract.
2169 if (Ekind (Old_S) = E_Procedure or else Ekind (Old_S) = E_Function)
2170 and then Is_Abstract_Subprogram (Old_S)
2171 and then not Is_Abstract_Subprogram (Formal_Spec)
2174 ("abstract subprogram not allowed as generic actual", Nam);
2179 -- A common error is to assume that implicit operators for types are
2180 -- defined in Standard, or in the scope of a subtype. In those cases
2181 -- where the renamed entity is given with an expanded name, it is
2182 -- worth mentioning that operators for the type are not declared in
2183 -- the scope given by the prefix.
2185 if Nkind (Nam) = N_Expanded_Name
2186 and then Nkind (Selector_Name (Nam)) = N_Operator_Symbol
2187 and then Scope (Entity (Nam)) = Standard_Standard
2190 T : constant Entity_Id :=
2191 Base_Type (Etype (First_Formal (New_S)));
2193 Error_Msg_Node_2 := Prefix (Nam);
2195 ("operator for type& is not declared in&", Prefix (Nam), T);
2200 ("no visible subprogram matches the specification for&",
2204 if Present (Candidate_Renaming) then
2210 F1 := First_Formal (Candidate_Renaming);
2211 F2 := First_Formal (New_S);
2213 while Present (F1) and then Present (F2) loop
2218 if Present (F1) and then Present (Default_Value (F1)) then
2219 if Present (Next_Formal (F1)) then
2221 ("\missing specification for &" &
2222 " and other formals with defaults", Spec, F1);
2225 ("\missing specification for &", Spec, F1);
2232 -- Ada 2005 AI 404: if the new subprogram is dispatching, verify that
2233 -- controlling access parameters are known non-null for the renamed
2234 -- subprogram. Test also applies to a subprogram instantiation that
2235 -- is dispatching. Test is skipped if some previous error was detected
2236 -- that set Old_S to Any_Id.
2238 if Ada_Version >= Ada_05
2239 and then Old_S /= Any_Id
2240 and then not Is_Dispatching_Operation (Old_S)
2241 and then Is_Dispatching_Operation (New_S)
2248 Old_F := First_Formal (Old_S);
2249 New_F := First_Formal (New_S);
2250 while Present (Old_F) loop
2251 if Ekind (Etype (Old_F)) = E_Anonymous_Access_Type
2252 and then Is_Controlling_Formal (New_F)
2253 and then not Can_Never_Be_Null (Old_F)
2255 Error_Msg_N ("access parameter is controlling,", New_F);
2257 ("\corresponding parameter of& "
2258 & "must be explicitly null excluding", New_F, Old_S);
2261 Next_Formal (Old_F);
2262 Next_Formal (New_F);
2267 -- A useful warning, suggested by Ada Bug Finder (Ada-Europe 2005)
2269 if Comes_From_Source (N)
2270 and then Present (Old_S)
2271 and then Nkind (Old_S) = N_Defining_Operator_Symbol
2272 and then Nkind (New_S) = N_Defining_Operator_Symbol
2273 and then Chars (Old_S) /= Chars (New_S)
2276 ("?& is being renamed as a different operator",
2280 -- Another warning or some utility: if the new subprogram as the same
2281 -- name as the old one, the old one is not hidden by an outer homograph,
2282 -- the new one is not a public symbol, and the old one is otherwise
2283 -- directly visible, the renaming is superfluous.
2285 if Chars (Old_S) = Chars (New_S)
2286 and then Comes_From_Source (N)
2287 and then Scope (Old_S) /= Standard_Standard
2288 and then Warn_On_Redundant_Constructs
2290 (Is_Immediately_Visible (Old_S)
2291 or else Is_Potentially_Use_Visible (Old_S))
2292 and then Is_Overloadable (Current_Scope)
2293 and then Chars (Current_Scope) /= Chars (Old_S)
2296 ("?redundant renaming, entity is directly visible", Name (N));
2299 Ada_Version := Save_AV;
2300 Ada_Version_Explicit := Save_AV_Exp;
2301 end Analyze_Subprogram_Renaming;
2303 -------------------------
2304 -- Analyze_Use_Package --
2305 -------------------------
2307 -- Resolve the package names in the use clause, and make all the visible
2308 -- entities defined in the package potentially use-visible. If the package
2309 -- is already in use from a previous use clause, its visible entities are
2310 -- already use-visible. In that case, mark the occurrence as a redundant
2311 -- use. If the package is an open scope, i.e. if the use clause occurs
2312 -- within the package itself, ignore it.
2314 procedure Analyze_Use_Package (N : Node_Id) is
2315 Pack_Name : Node_Id;
2318 -- Start of processing for Analyze_Use_Package
2321 Set_Hidden_By_Use_Clause (N, No_Elist);
2323 -- Use clause is not allowed in a spec of a predefined package
2324 -- declaration except that packages whose file name starts a-n are OK
2325 -- (these are children of Ada.Numerics, and such packages are never
2326 -- loaded by Rtsfind).
2328 if Is_Predefined_File_Name (Unit_File_Name (Current_Sem_Unit))
2329 and then Name_Buffer (1 .. 3) /= "a-n"
2331 Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Declaration
2333 Error_Msg_N ("use clause not allowed in predefined spec", N);
2336 -- Chain clause to list of use clauses in current scope
2338 if Nkind (Parent (N)) /= N_Compilation_Unit then
2339 Chain_Use_Clause (N);
2342 -- Loop through package names to identify referenced packages
2344 Pack_Name := First (Names (N));
2345 while Present (Pack_Name) loop
2346 Analyze (Pack_Name);
2348 if Nkind (Parent (N)) = N_Compilation_Unit
2349 and then Nkind (Pack_Name) = N_Expanded_Name
2355 Pref := Prefix (Pack_Name);
2356 while Nkind (Pref) = N_Expanded_Name loop
2357 Pref := Prefix (Pref);
2360 if Entity (Pref) = Standard_Standard then
2362 ("predefined package Standard cannot appear"
2363 & " in a context clause", Pref);
2371 -- Loop through package names to mark all entities as potentially
2374 Pack_Name := First (Names (N));
2375 while Present (Pack_Name) loop
2376 if Is_Entity_Name (Pack_Name) then
2377 Pack := Entity (Pack_Name);
2379 if Ekind (Pack) /= E_Package
2380 and then Etype (Pack) /= Any_Type
2382 if Ekind (Pack) = E_Generic_Package then
2384 ("a generic package is not allowed in a use clause",
2387 Error_Msg_N ("& is not a usable package", Pack_Name);
2391 if Nkind (Parent (N)) = N_Compilation_Unit then
2392 Check_In_Previous_With_Clause (N, Pack_Name);
2395 if Applicable_Use (Pack_Name) then
2396 Use_One_Package (Pack, N);
2400 -- Report error because name denotes something other than a package
2403 Error_Msg_N ("& is not a package", Pack_Name);
2408 end Analyze_Use_Package;
2410 ----------------------
2411 -- Analyze_Use_Type --
2412 ----------------------
2414 procedure Analyze_Use_Type (N : Node_Id) is
2419 Set_Hidden_By_Use_Clause (N, No_Elist);
2421 -- Chain clause to list of use clauses in current scope
2423 if Nkind (Parent (N)) /= N_Compilation_Unit then
2424 Chain_Use_Clause (N);
2427 Id := First (Subtype_Marks (N));
2428 while Present (Id) loop
2432 if E /= Any_Type then
2435 if Nkind (Parent (N)) = N_Compilation_Unit then
2436 if Nkind (Id) = N_Identifier then
2437 Error_Msg_N ("type is not directly visible", Id);
2439 elsif Is_Child_Unit (Scope (E))
2440 and then Scope (E) /= System_Aux_Id
2442 Check_In_Previous_With_Clause (N, Prefix (Id));
2449 end Analyze_Use_Type;
2451 --------------------
2452 -- Applicable_Use --
2453 --------------------
2455 function Applicable_Use (Pack_Name : Node_Id) return Boolean is
2456 Pack : constant Entity_Id := Entity (Pack_Name);
2459 if In_Open_Scopes (Pack) then
2460 if Warn_On_Redundant_Constructs
2461 and then Pack = Current_Scope
2464 ("& is already use-visible within itself?", Pack_Name, Pack);
2469 elsif In_Use (Pack) then
2470 Note_Redundant_Use (Pack_Name);
2473 elsif Present (Renamed_Object (Pack))
2474 and then In_Use (Renamed_Object (Pack))
2476 Note_Redundant_Use (Pack_Name);
2484 ------------------------
2485 -- Attribute_Renaming --
2486 ------------------------
2488 procedure Attribute_Renaming (N : Node_Id) is
2489 Loc : constant Source_Ptr := Sloc (N);
2490 Nam : constant Node_Id := Name (N);
2491 Spec : constant Node_Id := Specification (N);
2492 New_S : constant Entity_Id := Defining_Unit_Name (Spec);
2493 Aname : constant Name_Id := Attribute_Name (Nam);
2495 Form_Num : Nat := 0;
2496 Expr_List : List_Id := No_List;
2498 Attr_Node : Node_Id;
2499 Body_Node : Node_Id;
2500 Param_Spec : Node_Id;
2503 Generate_Definition (New_S);
2505 -- This procedure is called in the context of subprogram renaming,
2506 -- and thus the attribute must be one that is a subprogram. All of
2507 -- those have at least one formal parameter, with the singular
2508 -- exception of AST_Entry (which is a real oddity, it is odd that
2509 -- this can be renamed at all!)
2511 if not Is_Non_Empty_List (Parameter_Specifications (Spec)) then
2512 if Aname /= Name_AST_Entry then
2514 ("subprogram renaming an attribute must have formals", N);
2519 Param_Spec := First (Parameter_Specifications (Spec));
2520 while Present (Param_Spec) loop
2521 Form_Num := Form_Num + 1;
2523 if Nkind (Parameter_Type (Param_Spec)) /= N_Access_Definition then
2524 Find_Type (Parameter_Type (Param_Spec));
2526 -- The profile of the new entity denotes the base type (s) of
2527 -- the types given in the specification. For access parameters
2528 -- there are no subtypes involved.
2530 Rewrite (Parameter_Type (Param_Spec),
2532 (Base_Type (Entity (Parameter_Type (Param_Spec))), Loc));
2535 if No (Expr_List) then
2536 Expr_List := New_List;
2539 Append_To (Expr_List,
2540 Make_Identifier (Loc,
2541 Chars => Chars (Defining_Identifier (Param_Spec))));
2543 -- The expressions in the attribute reference are not freeze
2544 -- points. Neither is the attribute as a whole, see below.
2546 Set_Must_Not_Freeze (Last (Expr_List));
2551 -- Immediate error if too many formals. Other mismatches in numbers
2552 -- of number of types of parameters are detected when we analyze the
2553 -- body of the subprogram that we construct.
2555 if Form_Num > 2 then
2556 Error_Msg_N ("too many formals for attribute", N);
2558 -- Error if the attribute reference has expressions that look
2559 -- like formal parameters.
2561 elsif Present (Expressions (Nam)) then
2562 Error_Msg_N ("illegal expressions in attribute reference", Nam);
2565 Aname = Name_Compose or else
2566 Aname = Name_Exponent or else
2567 Aname = Name_Leading_Part or else
2568 Aname = Name_Pos or else
2569 Aname = Name_Round or else
2570 Aname = Name_Scaling or else
2573 if Nkind (N) = N_Subprogram_Renaming_Declaration
2574 and then Present (Corresponding_Formal_Spec (N))
2577 ("generic actual cannot be attribute involving universal type",
2581 ("attribute involving a universal type cannot be renamed",
2586 -- AST_Entry is an odd case. It doesn't really make much sense to
2587 -- allow it to be renamed, but that's the DEC rule, so we have to
2588 -- do it right. The point is that the AST_Entry call should be made
2589 -- now, and what the function will return is the returned value.
2591 -- Note that there is no Expr_List in this case anyway
2593 if Aname = Name_AST_Entry then
2599 Ent := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
2602 Make_Object_Declaration (Loc,
2603 Defining_Identifier => Ent,
2604 Object_Definition =>
2605 New_Occurrence_Of (RTE (RE_AST_Handler), Loc),
2607 Constant_Present => True);
2609 Set_Assignment_OK (Decl, True);
2610 Insert_Action (N, Decl);
2611 Attr_Node := Make_Identifier (Loc, Chars (Ent));
2614 -- For all other attributes, we rewrite the attribute node to have
2615 -- a list of expressions corresponding to the subprogram formals.
2616 -- A renaming declaration is not a freeze point, and the analysis of
2617 -- the attribute reference should not freeze the type of the prefix.
2621 Make_Attribute_Reference (Loc,
2622 Prefix => Prefix (Nam),
2623 Attribute_Name => Aname,
2624 Expressions => Expr_List);
2626 Set_Must_Not_Freeze (Attr_Node);
2627 Set_Must_Not_Freeze (Prefix (Nam));
2630 -- Case of renaming a function
2632 if Nkind (Spec) = N_Function_Specification then
2633 if Is_Procedure_Attribute_Name (Aname) then
2634 Error_Msg_N ("attribute can only be renamed as procedure", Nam);
2638 Find_Type (Result_Definition (Spec));
2639 Rewrite (Result_Definition (Spec),
2641 Base_Type (Entity (Result_Definition (Spec))), Loc));
2644 Make_Subprogram_Body (Loc,
2645 Specification => Spec,
2646 Declarations => New_List,
2647 Handled_Statement_Sequence =>
2648 Make_Handled_Sequence_Of_Statements (Loc,
2649 Statements => New_List (
2650 Make_Simple_Return_Statement (Loc,
2651 Expression => Attr_Node))));
2653 -- Case of renaming a procedure
2656 if not Is_Procedure_Attribute_Name (Aname) then
2657 Error_Msg_N ("attribute can only be renamed as function", Nam);
2662 Make_Subprogram_Body (Loc,
2663 Specification => Spec,
2664 Declarations => New_List,
2665 Handled_Statement_Sequence =>
2666 Make_Handled_Sequence_Of_Statements (Loc,
2667 Statements => New_List (Attr_Node)));
2670 -- In case of tagged types we add the body of the generated function to
2671 -- the freezing actions of the type (because in the general case such
2672 -- type is still not frozen). We exclude from this processing generic
2673 -- formal subprograms found in instantiations and AST_Entry renamings.
2675 if not Present (Corresponding_Formal_Spec (N))
2676 and then Etype (Nam) /= RTE (RE_AST_Handler)
2679 P : constant Entity_Id := Prefix (Nam);
2684 if Is_Tagged_Type (Etype (P)) then
2685 Ensure_Freeze_Node (Etype (P));
2686 Append_Freeze_Action (Etype (P), Body_Node);
2688 Rewrite (N, Body_Node);
2690 Set_Etype (New_S, Base_Type (Etype (New_S)));
2694 -- Generic formal subprograms or AST_Handler renaming
2697 Rewrite (N, Body_Node);
2699 Set_Etype (New_S, Base_Type (Etype (New_S)));
2702 if Is_Compilation_Unit (New_S) then
2704 ("a library unit can only rename another library unit", N);
2707 -- We suppress elaboration warnings for the resulting entity, since
2708 -- clearly they are not needed, and more particularly, in the case
2709 -- of a generic formal subprogram, the resulting entity can appear
2710 -- after the instantiation itself, and thus look like a bogus case
2711 -- of access before elaboration.
2713 Set_Suppress_Elaboration_Warnings (New_S);
2715 end Attribute_Renaming;
2717 ----------------------
2718 -- Chain_Use_Clause --
2719 ----------------------
2721 procedure Chain_Use_Clause (N : Node_Id) is
2723 Level : Int := Scope_Stack.Last;
2726 if not Is_Compilation_Unit (Current_Scope)
2727 or else not Is_Child_Unit (Current_Scope)
2729 null; -- Common case
2731 elsif Defining_Entity (Parent (N)) = Current_Scope then
2732 null; -- Common case for compilation unit
2735 -- If declaration appears in some other scope, it must be in some
2736 -- parent unit when compiling a child.
2738 Pack := Defining_Entity (Parent (N));
2739 if not In_Open_Scopes (Pack) then
2740 null; -- default as well
2743 -- Find entry for parent unit in scope stack
2745 while Scope_Stack.Table (Level).Entity /= Pack loop
2751 Set_Next_Use_Clause (N,
2752 Scope_Stack.Table (Level).First_Use_Clause);
2753 Scope_Stack.Table (Level).First_Use_Clause := N;
2754 end Chain_Use_Clause;
2756 ---------------------------
2757 -- Check_Frozen_Renaming --
2758 ---------------------------
2760 procedure Check_Frozen_Renaming (N : Node_Id; Subp : Entity_Id) is
2766 and then not Has_Completion (Subp)
2770 (Parent (Declaration_Node (Subp)), Defining_Entity (N));
2772 if Is_Entity_Name (Name (N)) then
2773 Old_S := Entity (Name (N));
2775 if not Is_Frozen (Old_S)
2776 and then Operating_Mode /= Check_Semantics
2778 Append_Freeze_Action (Old_S, B_Node);
2780 Insert_After (N, B_Node);
2784 if Is_Intrinsic_Subprogram (Old_S)
2785 and then not In_Instance
2788 ("subprogram used in renaming_as_body cannot be intrinsic",
2793 Insert_After (N, B_Node);
2797 end Check_Frozen_Renaming;
2799 -----------------------------------
2800 -- Check_In_Previous_With_Clause --
2801 -----------------------------------
2803 procedure Check_In_Previous_With_Clause
2807 Pack : constant Entity_Id := Entity (Original_Node (Nam));
2812 Item := First (Context_Items (Parent (N)));
2814 while Present (Item)
2817 if Nkind (Item) = N_With_Clause
2819 -- Protect the frontend against previous critical errors
2821 and then Nkind (Name (Item)) /= N_Selected_Component
2822 and then Entity (Name (Item)) = Pack
2826 -- Find root library unit in with_clause
2828 while Nkind (Par) = N_Expanded_Name loop
2829 Par := Prefix (Par);
2832 if Is_Child_Unit (Entity (Original_Node (Par))) then
2834 ("& is not directly visible", Par, Entity (Par));
2843 -- On exit, package is not mentioned in a previous with_clause.
2844 -- Check if its prefix is.
2846 if Nkind (Nam) = N_Expanded_Name then
2847 Check_In_Previous_With_Clause (N, Prefix (Nam));
2849 elsif Pack /= Any_Id then
2850 Error_Msg_NE ("& is not visible", Nam, Pack);
2852 end Check_In_Previous_With_Clause;
2854 ---------------------------------
2855 -- Check_Library_Unit_Renaming --
2856 ---------------------------------
2858 procedure Check_Library_Unit_Renaming (N : Node_Id; Old_E : Entity_Id) is
2862 if Nkind (Parent (N)) /= N_Compilation_Unit then
2865 -- Check for library unit. Note that we used to check for the scope
2866 -- being Standard here, but that was wrong for Standard itself.
2868 elsif not Is_Compilation_Unit (Old_E)
2869 and then not Is_Child_Unit (Old_E)
2871 Error_Msg_N ("renamed unit must be a library unit", Name (N));
2873 -- Entities defined in Standard (operators and boolean literals) cannot
2874 -- be renamed as library units.
2876 elsif Scope (Old_E) = Standard_Standard
2877 and then Sloc (Old_E) = Standard_Location
2879 Error_Msg_N ("renamed unit must be a library unit", Name (N));
2881 elsif Present (Parent_Spec (N))
2882 and then Nkind (Unit (Parent_Spec (N))) = N_Generic_Package_Declaration
2883 and then not Is_Child_Unit (Old_E)
2886 ("renamed unit must be a child unit of generic parent", Name (N));
2888 elsif Nkind (N) in N_Generic_Renaming_Declaration
2889 and then Nkind (Name (N)) = N_Expanded_Name
2890 and then Is_Generic_Instance (Entity (Prefix (Name (N))))
2891 and then Is_Generic_Unit (Old_E)
2894 ("renamed generic unit must be a library unit", Name (N));
2896 elsif Ekind (Old_E) = E_Package
2897 or else Ekind (Old_E) = E_Generic_Package
2899 -- Inherit categorization flags
2901 New_E := Defining_Entity (N);
2902 Set_Is_Pure (New_E, Is_Pure (Old_E));
2903 Set_Is_Preelaborated (New_E, Is_Preelaborated (Old_E));
2904 Set_Is_Remote_Call_Interface (New_E,
2905 Is_Remote_Call_Interface (Old_E));
2906 Set_Is_Remote_Types (New_E, Is_Remote_Types (Old_E));
2907 Set_Is_Shared_Passive (New_E, Is_Shared_Passive (Old_E));
2909 end Check_Library_Unit_Renaming;
2915 procedure End_Scope is
2921 Id := First_Entity (Current_Scope);
2922 while Present (Id) loop
2923 -- An entity in the current scope is not necessarily the first one
2924 -- on its homonym chain. Find its predecessor if any,
2925 -- If it is an internal entity, it will not be in the visibility
2926 -- chain altogether, and there is nothing to unchain.
2928 if Id /= Current_Entity (Id) then
2929 Prev := Current_Entity (Id);
2930 while Present (Prev)
2931 and then Present (Homonym (Prev))
2932 and then Homonym (Prev) /= Id
2934 Prev := Homonym (Prev);
2937 -- Skip to end of loop if Id is not in the visibility chain
2939 if No (Prev) or else Homonym (Prev) /= Id then
2947 Set_Is_Immediately_Visible (Id, False);
2949 Outer := Homonym (Id);
2950 while Present (Outer) and then Scope (Outer) = Current_Scope loop
2951 Outer := Homonym (Outer);
2954 -- Reset homonym link of other entities, but do not modify link
2955 -- between entities in current scope, so that the back-end can have
2956 -- a proper count of local overloadings.
2959 Set_Name_Entity_Id (Chars (Id), Outer);
2961 elsif Scope (Prev) /= Scope (Id) then
2962 Set_Homonym (Prev, Outer);
2969 -- If the scope generated freeze actions, place them before the
2970 -- current declaration and analyze them. Type declarations and
2971 -- the bodies of initialization procedures can generate such nodes.
2972 -- We follow the parent chain until we reach a list node, which is
2973 -- the enclosing list of declarations. If the list appears within
2974 -- a protected definition, move freeze nodes outside the protected
2978 (Scope_Stack.Table (Scope_Stack.Last).Pending_Freeze_Actions)
2982 L : constant List_Id := Scope_Stack.Table
2983 (Scope_Stack.Last).Pending_Freeze_Actions;
2986 if Is_Itype (Current_Scope) then
2987 Decl := Associated_Node_For_Itype (Current_Scope);
2989 Decl := Parent (Current_Scope);
2994 while not (Is_List_Member (Decl))
2995 or else Nkind_In (Parent (Decl), N_Protected_Definition,
2998 Decl := Parent (Decl);
3001 Insert_List_Before_And_Analyze (Decl, L);
3010 ---------------------
3011 -- End_Use_Clauses --
3012 ---------------------
3014 procedure End_Use_Clauses (Clause : Node_Id) is
3018 -- Remove Use_Type clauses first, because they affect the
3019 -- visibility of operators in subsequent used packages.
3022 while Present (U) loop
3023 if Nkind (U) = N_Use_Type_Clause then
3027 Next_Use_Clause (U);
3031 while Present (U) loop
3032 if Nkind (U) = N_Use_Package_Clause then
3033 End_Use_Package (U);
3036 Next_Use_Clause (U);
3038 end End_Use_Clauses;
3040 ---------------------
3041 -- End_Use_Package --
3042 ---------------------
3044 procedure End_Use_Package (N : Node_Id) is
3045 Pack_Name : Node_Id;
3050 function Is_Primitive_Operator
3052 F : Entity_Id) return Boolean;
3053 -- Check whether Op is a primitive operator of a use-visible type
3055 ---------------------------
3056 -- Is_Primitive_Operator --
3057 ---------------------------
3059 function Is_Primitive_Operator
3061 F : Entity_Id) return Boolean
3063 T : constant Entity_Id := Etype (F);
3066 and then Scope (T) = Scope (Op);
3067 end Is_Primitive_Operator;
3069 -- Start of processing for End_Use_Package
3072 Pack_Name := First (Names (N));
3073 while Present (Pack_Name) loop
3075 -- Test that Pack_Name actually denotes a package before processing
3077 if Is_Entity_Name (Pack_Name)
3078 and then Ekind (Entity (Pack_Name)) = E_Package
3080 Pack := Entity (Pack_Name);
3082 if In_Open_Scopes (Pack) then
3085 elsif not Redundant_Use (Pack_Name) then
3086 Set_In_Use (Pack, False);
3087 Set_Current_Use_Clause (Pack, Empty);
3089 Id := First_Entity (Pack);
3090 while Present (Id) loop
3092 -- Preserve use-visibility of operators that are primitive
3093 -- operators of a type that is use-visible through an active
3096 if Nkind (Id) = N_Defining_Operator_Symbol
3098 (Is_Primitive_Operator (Id, First_Formal (Id))
3100 (Present (Next_Formal (First_Formal (Id)))
3102 Is_Primitive_Operator
3103 (Id, Next_Formal (First_Formal (Id)))))
3108 Set_Is_Potentially_Use_Visible (Id, False);
3111 if Is_Private_Type (Id)
3112 and then Present (Full_View (Id))
3114 Set_Is_Potentially_Use_Visible (Full_View (Id), False);
3120 if Present (Renamed_Object (Pack)) then
3121 Set_In_Use (Renamed_Object (Pack), False);
3122 Set_Current_Use_Clause (Renamed_Object (Pack), Empty);
3125 if Chars (Pack) = Name_System
3126 and then Scope (Pack) = Standard_Standard
3127 and then Present_System_Aux
3129 Id := First_Entity (System_Aux_Id);
3130 while Present (Id) loop
3131 Set_Is_Potentially_Use_Visible (Id, False);
3133 if Is_Private_Type (Id)
3134 and then Present (Full_View (Id))
3136 Set_Is_Potentially_Use_Visible (Full_View (Id), False);
3142 Set_In_Use (System_Aux_Id, False);
3146 Set_Redundant_Use (Pack_Name, False);
3153 if Present (Hidden_By_Use_Clause (N)) then
3154 Elmt := First_Elmt (Hidden_By_Use_Clause (N));
3155 while Present (Elmt) loop
3156 Set_Is_Immediately_Visible (Node (Elmt));
3160 Set_Hidden_By_Use_Clause (N, No_Elist);
3162 end End_Use_Package;
3168 procedure End_Use_Type (N : Node_Id) is
3175 Id := First (Subtype_Marks (N));
3176 while Present (Id) loop
3178 -- A call to rtsfind may occur while analyzing a use_type clause,
3179 -- in which case the type marks are not resolved yet, and there is
3180 -- nothing to remove.
3182 if not Is_Entity_Name (Id)
3183 or else No (Entity (Id))
3191 or else From_With_Type (T)
3195 -- Note that the use_Type clause may mention a subtype of the type
3196 -- whose primitive operations have been made visible. Here as
3197 -- elsewhere, it is the base type that matters for visibility.
3199 elsif In_Open_Scopes (Scope (Base_Type (T))) then
3202 elsif not Redundant_Use (Id) then
3203 Set_In_Use (T, False);
3204 Set_In_Use (Base_Type (T), False);
3205 Set_Current_Use_Clause (T, Empty);
3206 Set_Current_Use_Clause (Base_Type (T), Empty);
3207 Op_List := Collect_Primitive_Operations (T);
3209 Elmt := First_Elmt (Op_List);
3210 while Present (Elmt) loop
3211 if Nkind (Node (Elmt)) = N_Defining_Operator_Symbol then
3212 Set_Is_Potentially_Use_Visible (Node (Elmt), False);
3224 ----------------------
3225 -- Find_Direct_Name --
3226 ----------------------
3228 procedure Find_Direct_Name (N : Node_Id) is
3233 Inst : Entity_Id := Empty;
3234 -- Enclosing instance, if any
3236 Homonyms : Entity_Id;
3237 -- Saves start of homonym chain
3239 Nvis_Entity : Boolean;
3240 -- Set True to indicate that at there is at least one entity on the
3241 -- homonym chain which, while not visible, is visible enough from the
3242 -- user point of view to warrant an error message of "not visible"
3243 -- rather than undefined.
3245 Nvis_Is_Private_Subprg : Boolean := False;
3246 -- Ada 2005 (AI-262): Set True to indicate that a form of Beaujolais
3247 -- effect concerning library subprograms has been detected. Used to
3248 -- generate the precise error message.
3250 function From_Actual_Package (E : Entity_Id) return Boolean;
3251 -- Returns true if the entity is declared in a package that is
3252 -- an actual for a formal package of the current instance. Such an
3253 -- entity requires special handling because it may be use-visible
3254 -- but hides directly visible entities defined outside the instance.
3256 function Is_Actual_Parameter return Boolean;
3257 -- This function checks if the node N is an identifier that is an actual
3258 -- parameter of a procedure call. If so it returns True, otherwise it
3259 -- return False. The reason for this check is that at this stage we do
3260 -- not know what procedure is being called if the procedure might be
3261 -- overloaded, so it is premature to go setting referenced flags or
3262 -- making calls to Generate_Reference. We will wait till Resolve_Actuals
3263 -- for that processing
3265 function Known_But_Invisible (E : Entity_Id) return Boolean;
3266 -- This function determines whether the entity E (which is not
3267 -- visible) can reasonably be considered to be known to the writer
3268 -- of the reference. This is a heuristic test, used only for the
3269 -- purposes of figuring out whether we prefer to complain that an
3270 -- entity is undefined or invisible (and identify the declaration
3271 -- of the invisible entity in the latter case). The point here is
3272 -- that we don't want to complain that something is invisible and
3273 -- then point to something entirely mysterious to the writer.
3275 procedure Nvis_Messages;
3276 -- Called if there are no visible entries for N, but there is at least
3277 -- one non-directly visible, or hidden declaration. This procedure
3278 -- outputs an appropriate set of error messages.
3280 procedure Undefined (Nvis : Boolean);
3281 -- This function is called if the current node has no corresponding
3282 -- visible entity or entities. The value set in Msg indicates whether
3283 -- an error message was generated (multiple error messages for the
3284 -- same variable are generally suppressed, see body for details).
3285 -- Msg is True if an error message was generated, False if not. This
3286 -- value is used by the caller to determine whether or not to output
3287 -- additional messages where appropriate. The parameter is set False
3288 -- to get the message "X is undefined", and True to get the message
3289 -- "X is not visible".
3291 -------------------------
3292 -- From_Actual_Package --
3293 -------------------------
3295 function From_Actual_Package (E : Entity_Id) return Boolean is
3296 Scop : constant Entity_Id := Scope (E);
3300 if not In_Instance then
3303 Inst := Current_Scope;
3304 while Present (Inst)
3305 and then Ekind (Inst) /= E_Package
3306 and then not Is_Generic_Instance (Inst)
3308 Inst := Scope (Inst);
3315 Act := First_Entity (Inst);
3316 while Present (Act) loop
3317 if Ekind (Act) = E_Package then
3319 -- Check for end of actuals list
3321 if Renamed_Object (Act) = Inst then
3324 elsif Present (Associated_Formal_Package (Act))
3325 and then Renamed_Object (Act) = Scop
3327 -- Entity comes from (instance of) formal package
3342 end From_Actual_Package;
3344 -------------------------
3345 -- Is_Actual_Parameter --
3346 -------------------------
3348 function Is_Actual_Parameter return Boolean is
3351 Nkind (N) = N_Identifier
3353 (Nkind (Parent (N)) = N_Procedure_Call_Statement
3355 (Nkind (Parent (N)) = N_Parameter_Association
3356 and then N = Explicit_Actual_Parameter (Parent (N))
3357 and then Nkind (Parent (Parent (N))) =
3358 N_Procedure_Call_Statement));
3359 end Is_Actual_Parameter;
3361 -------------------------
3362 -- Known_But_Invisible --
3363 -------------------------
3365 function Known_But_Invisible (E : Entity_Id) return Boolean is
3366 Fname : File_Name_Type;
3369 -- Entities in Standard are always considered to be known
3371 if Sloc (E) <= Standard_Location then
3374 -- An entity that does not come from source is always considered
3375 -- to be unknown, since it is an artifact of code expansion.
3377 elsif not Comes_From_Source (E) then
3380 -- In gnat internal mode, we consider all entities known
3382 elsif GNAT_Mode then
3386 -- Here we have an entity that is not from package Standard, and
3387 -- which comes from Source. See if it comes from an internal file.
3389 Fname := Unit_File_Name (Get_Source_Unit (E));
3391 -- Case of from internal file
3393 if Is_Internal_File_Name (Fname) then
3395 -- Private part entities in internal files are never considered
3396 -- to be known to the writer of normal application code.
3398 if Is_Hidden (E) then
3402 -- Entities from System packages other than System and
3403 -- System.Storage_Elements are not considered to be known.
3404 -- System.Auxxxx files are also considered known to the user.
3406 -- Should refine this at some point to generally distinguish
3407 -- between known and unknown internal files ???
3409 Get_Name_String (Fname);
3414 Name_Buffer (1 .. 2) /= "s-"
3416 Name_Buffer (3 .. 8) = "stoele"
3418 Name_Buffer (3 .. 5) = "aux";
3420 -- If not an internal file, then entity is definitely known,
3421 -- even if it is in a private part (the message generated will
3422 -- note that it is in a private part)
3427 end Known_But_Invisible;
3433 procedure Nvis_Messages is
3434 Comp_Unit : Node_Id;
3436 Hidden : Boolean := False;
3440 -- Ada 2005 (AI-262): Generate a precise error concerning the
3441 -- Beaujolais effect that was previously detected
3443 if Nvis_Is_Private_Subprg then
3445 pragma Assert (Nkind (E2) = N_Defining_Identifier
3446 and then Ekind (E2) = E_Function
3447 and then Scope (E2) = Standard_Standard
3448 and then Has_Private_With (E2));
3450 -- Find the sloc corresponding to the private with'ed unit
3452 Comp_Unit := Cunit (Current_Sem_Unit);
3453 Error_Msg_Sloc := No_Location;
3455 Item := First (Context_Items (Comp_Unit));
3456 while Present (Item) loop
3457 if Nkind (Item) = N_With_Clause
3458 and then Private_Present (Item)
3459 and then Entity (Name (Item)) = E2
3461 Error_Msg_Sloc := Sloc (Item);
3468 pragma Assert (Error_Msg_Sloc /= No_Location);
3470 Error_Msg_N ("(Ada 2005): hidden by private with clause #", N);
3474 Undefined (Nvis => True);
3478 -- First loop does hidden declarations
3481 while Present (Ent) loop
3482 if Is_Potentially_Use_Visible (Ent) then
3484 Error_Msg_N ("multiple use clauses cause hiding!", N);
3488 Error_Msg_Sloc := Sloc (Ent);
3489 Error_Msg_N ("hidden declaration#!", N);
3492 Ent := Homonym (Ent);
3495 -- If we found hidden declarations, then that's enough, don't
3496 -- bother looking for non-visible declarations as well.
3502 -- Second loop does non-directly visible declarations
3505 while Present (Ent) loop
3506 if not Is_Potentially_Use_Visible (Ent) then
3508 -- Do not bother the user with unknown entities
3510 if not Known_But_Invisible (Ent) then
3514 Error_Msg_Sloc := Sloc (Ent);
3516 -- Output message noting that there is a non-visible
3517 -- declaration, distinguishing the private part case.
3519 if Is_Hidden (Ent) then
3520 Error_Msg_N ("non-visible (private) declaration#!", N);
3522 Error_Msg_N ("non-visible declaration#!", N);
3524 if Is_Compilation_Unit (Ent)
3526 Nkind (Parent (Parent (N))) = N_Use_Package_Clause
3528 Error_Msg_Qual_Level := 99;
3529 Error_Msg_NE ("\\missing `WITH &;`", N, Ent);
3530 Error_Msg_Qual_Level := 0;
3534 -- Set entity and its containing package as referenced. We
3535 -- can't be sure of this, but this seems a better choice
3536 -- to avoid unused entity messages.
3538 if Comes_From_Source (Ent) then
3539 Set_Referenced (Ent);
3540 Set_Referenced (Cunit_Entity (Get_Source_Unit (Ent)));
3545 Ent := Homonym (Ent);
3554 procedure Undefined (Nvis : Boolean) is
3555 Emsg : Error_Msg_Id;
3558 -- We should never find an undefined internal name. If we do, then
3559 -- see if we have previous errors. If so, ignore on the grounds that
3560 -- it is probably a cascaded message (e.g. a block label from a badly
3561 -- formed block). If no previous errors, then we have a real internal
3562 -- error of some kind so raise an exception.
3564 if Is_Internal_Name (Chars (N)) then
3565 if Total_Errors_Detected /= 0 then
3568 raise Program_Error;
3572 -- A very specialized error check, if the undefined variable is
3573 -- a case tag, and the case type is an enumeration type, check
3574 -- for a possible misspelling, and if so, modify the identifier
3576 -- Named aggregate should also be handled similarly ???
3578 if Nkind (N) = N_Identifier
3579 and then Nkind (Parent (N)) = N_Case_Statement_Alternative
3582 Case_Stm : constant Node_Id := Parent (Parent (N));
3583 Case_Typ : constant Entity_Id := Etype (Expression (Case_Stm));
3588 if Is_Enumeration_Type (Case_Typ)
3589 and then not Is_Standard_Character_Type (Case_Typ)
3591 Lit := First_Literal (Case_Typ);
3592 Get_Name_String (Chars (Lit));
3594 if Chars (Lit) /= Chars (N)
3595 and then Is_Bad_Spelling_Of (Chars (N), Chars (Lit)) then
3596 Error_Msg_Node_2 := Lit;
3598 ("& is undefined, assume misspelling of &", N);
3599 Rewrite (N, New_Occurrence_Of (Lit, Sloc (N)));
3603 Lit := Next_Literal (Lit);
3608 -- Normal processing
3610 Set_Entity (N, Any_Id);
3611 Set_Etype (N, Any_Type);
3613 -- We use the table Urefs to keep track of entities for which we
3614 -- have issued errors for undefined references. Multiple errors
3615 -- for a single name are normally suppressed, however we modify
3616 -- the error message to alert the programmer to this effect.
3618 for J in Urefs.First .. Urefs.Last loop
3619 if Chars (N) = Chars (Urefs.Table (J).Node) then
3620 if Urefs.Table (J).Err /= No_Error_Msg
3621 and then Sloc (N) /= Urefs.Table (J).Loc
3623 Error_Msg_Node_1 := Urefs.Table (J).Node;
3625 if Urefs.Table (J).Nvis then
3626 Change_Error_Text (Urefs.Table (J).Err,
3627 "& is not visible (more references follow)");
3629 Change_Error_Text (Urefs.Table (J).Err,
3630 "& is undefined (more references follow)");
3633 Urefs.Table (J).Err := No_Error_Msg;
3636 -- Although we will set Msg False, and thus suppress the
3637 -- message, we also set Error_Posted True, to avoid any
3638 -- cascaded messages resulting from the undefined reference.
3641 Set_Error_Posted (N, True);
3646 -- If entry not found, this is first undefined occurrence
3649 Error_Msg_N ("& is not visible!", N);
3653 Error_Msg_N ("& is undefined!", N);
3656 -- A very bizarre special check, if the undefined identifier
3657 -- is put or put_line, then add a special error message (since
3658 -- this is a very common error for beginners to make).
3660 if Chars (N) = Name_Put or else Chars (N) = Name_Put_Line then
3662 ("\\possible missing `WITH Ada.Text_'I'O; " &
3663 "USE Ada.Text_'I'O`!", N);
3665 -- Another special check if N is the prefix of a selected
3666 -- component which is a known unit, add message complaining
3667 -- about missing with for this unit.
3669 elsif Nkind (Parent (N)) = N_Selected_Component
3670 and then N = Prefix (Parent (N))
3671 and then Is_Known_Unit (Parent (N))
3673 Error_Msg_Node_2 := Selector_Name (Parent (N));
3674 Error_Msg_N ("\\missing `WITH &.&;`", Prefix (Parent (N)));
3677 -- Now check for possible misspellings
3681 Ematch : Entity_Id := Empty;
3683 Last_Name_Id : constant Name_Id :=
3684 Name_Id (Nat (First_Name_Id) +
3685 Name_Entries_Count - 1);
3688 for Nam in First_Name_Id .. Last_Name_Id loop
3689 E := Get_Name_Entity_Id (Nam);
3692 and then (Is_Immediately_Visible (E)
3694 Is_Potentially_Use_Visible (E))
3696 if Is_Bad_Spelling_Of (Chars (N), Nam) then
3703 if Present (Ematch) then
3704 Error_Msg_NE ("\possible misspelling of&", N, Ematch);
3709 -- Make entry in undefined references table unless the full errors
3710 -- switch is set, in which case by refraining from generating the
3711 -- table entry, we guarantee that we get an error message for every
3712 -- undefined reference.
3714 if not All_Errors_Mode then
3725 -- Start of processing for Find_Direct_Name
3728 -- If the entity pointer is already set, this is an internal node, or
3729 -- a node that is analyzed more than once, after a tree modification.
3730 -- In such a case there is no resolution to perform, just set the type.
3732 if Present (Entity (N)) then
3733 if Is_Type (Entity (N)) then
3734 Set_Etype (N, Entity (N));
3738 Entyp : constant Entity_Id := Etype (Entity (N));
3741 -- One special case here. If the Etype field is already set,
3742 -- and references the packed array type corresponding to the
3743 -- etype of the referenced entity, then leave it alone. This
3744 -- happens for trees generated from Exp_Pakd, where expressions
3745 -- can be deliberately "mis-typed" to the packed array type.
3747 if Is_Array_Type (Entyp)
3748 and then Is_Packed (Entyp)
3749 and then Present (Etype (N))
3750 and then Etype (N) = Packed_Array_Type (Entyp)
3754 -- If not that special case, then just reset the Etype
3757 Set_Etype (N, Etype (Entity (N)));
3765 -- Here if Entity pointer was not set, we need full visibility analysis
3766 -- First we generate debugging output if the debug E flag is set.
3768 if Debug_Flag_E then
3769 Write_Str ("Looking for ");
3770 Write_Name (Chars (N));
3774 Homonyms := Current_Entity (N);
3775 Nvis_Entity := False;
3778 while Present (E) loop
3780 -- If entity is immediately visible or potentially use
3781 -- visible, then process the entity and we are done.
3783 if Is_Immediately_Visible (E) then
3784 goto Immediately_Visible_Entity;
3786 elsif Is_Potentially_Use_Visible (E) then
3787 goto Potentially_Use_Visible_Entity;
3789 -- Note if a known but invisible entity encountered
3791 elsif Known_But_Invisible (E) then
3792 Nvis_Entity := True;
3795 -- Move to next entity in chain and continue search
3800 -- If no entries on homonym chain that were potentially visible,
3801 -- and no entities reasonably considered as non-visible, then
3802 -- we have a plain undefined reference, with no additional
3803 -- explanation required!
3805 if not Nvis_Entity then
3806 Undefined (Nvis => False);
3808 -- Otherwise there is at least one entry on the homonym chain that
3809 -- is reasonably considered as being known and non-visible.
3817 -- Processing for a potentially use visible entry found. We must search
3818 -- the rest of the homonym chain for two reasons. First, if there is a
3819 -- directly visible entry, then none of the potentially use-visible
3820 -- entities are directly visible (RM 8.4(10)). Second, we need to check
3821 -- for the case of multiple potentially use-visible entries hiding one
3822 -- another and as a result being non-directly visible (RM 8.4(11)).
3824 <<Potentially_Use_Visible_Entity>> declare
3825 Only_One_Visible : Boolean := True;
3826 All_Overloadable : Boolean := Is_Overloadable (E);
3830 while Present (E2) loop
3831 if Is_Immediately_Visible (E2) then
3833 -- If the use-visible entity comes from the actual for a
3834 -- formal package, it hides a directly visible entity from
3835 -- outside the instance.
3837 if From_Actual_Package (E)
3838 and then Scope_Depth (E2) < Scope_Depth (Inst)
3843 goto Immediately_Visible_Entity;
3846 elsif Is_Potentially_Use_Visible (E2) then
3847 Only_One_Visible := False;
3848 All_Overloadable := All_Overloadable and Is_Overloadable (E2);
3850 -- Ada 2005 (AI-262): Protect against a form of Beujolais effect
3851 -- that can occur in private_with clauses. Example:
3854 -- private with B; package A is
3855 -- package C is function B return Integer;
3857 -- V1 : Integer := B;
3858 -- private function B return Integer;
3859 -- V2 : Integer := B;
3862 -- V1 resolves to A.B, but V2 resolves to library unit B
3864 elsif Ekind (E2) = E_Function
3865 and then Scope (E2) = Standard_Standard
3866 and then Has_Private_With (E2)
3868 Only_One_Visible := False;
3869 All_Overloadable := False;
3870 Nvis_Is_Private_Subprg := True;
3877 -- On falling through this loop, we have checked that there are no
3878 -- immediately visible entities. Only_One_Visible is set if exactly
3879 -- one potentially use visible entity exists. All_Overloadable is
3880 -- set if all the potentially use visible entities are overloadable.
3881 -- The condition for legality is that either there is one potentially
3882 -- use visible entity, or if there is more than one, then all of them
3883 -- are overloadable.
3885 if Only_One_Visible or All_Overloadable then
3888 -- If there is more than one potentially use-visible entity and at
3889 -- least one of them non-overloadable, we have an error (RM 8.4(11).
3890 -- Note that E points to the first such entity on the homonym list.
3891 -- Special case: if one of the entities is declared in an actual
3892 -- package, it was visible in the generic, and takes precedence over
3893 -- other entities that are potentially use-visible. Same if it is
3894 -- declared in a local instantiation of the current instance.
3899 -- Find current instance
3901 Inst := Current_Scope;
3902 while Present (Inst)
3903 and then Inst /= Standard_Standard
3905 if Is_Generic_Instance (Inst) then
3909 Inst := Scope (Inst);
3913 while Present (E2) loop
3914 if From_Actual_Package (E2)
3916 (Is_Generic_Instance (Scope (E2))
3917 and then Scope_Depth (Scope (E2)) > Scope_Depth (Inst))
3930 Is_Predefined_File_Name (Unit_File_Name (Current_Sem_Unit))
3932 -- A use-clause in the body of a system file creates conflict
3933 -- with some entity in a user scope, while rtsfind is active.
3934 -- Keep only the entity coming from another predefined unit.
3937 while Present (E2) loop
3938 if Is_Predefined_File_Name
3939 (Unit_File_Name (Get_Source_Unit (Sloc (E2))))
3948 -- Entity must exist because predefined unit is correct
3950 raise Program_Error;
3959 -- Come here with E set to the first immediately visible entity on
3960 -- the homonym chain. This is the one we want unless there is another
3961 -- immediately visible entity further on in the chain for a more
3962 -- inner scope (RM 8.3(8)).
3964 <<Immediately_Visible_Entity>> declare
3969 -- Find scope level of initial entity. When compiling through
3970 -- Rtsfind, the previous context is not completely invisible, and
3971 -- an outer entity may appear on the chain, whose scope is below
3972 -- the entry for Standard that delimits the current scope stack.
3973 -- Indicate that the level for this spurious entry is outside of
3974 -- the current scope stack.
3976 Level := Scope_Stack.Last;
3978 Scop := Scope_Stack.Table (Level).Entity;
3979 exit when Scop = Scope (E);
3981 exit when Scop = Standard_Standard;
3984 -- Now search remainder of homonym chain for more inner entry
3985 -- If the entity is Standard itself, it has no scope, and we
3986 -- compare it with the stack entry directly.
3989 while Present (E2) loop
3990 if Is_Immediately_Visible (E2) then
3992 -- If a generic package contains a local declaration that
3993 -- has the same name as the generic, there may be a visibility
3994 -- conflict in an instance, where the local declaration must
3995 -- also hide the name of the corresponding package renaming.
3996 -- We check explicitly for a package declared by a renaming,
3997 -- whose renamed entity is an instance that is on the scope
3998 -- stack, and that contains a homonym in the same scope. Once
3999 -- we have found it, we know that the package renaming is not
4000 -- immediately visible, and that the identifier denotes the
4001 -- other entity (and its homonyms if overloaded).
4003 if Scope (E) = Scope (E2)
4004 and then Ekind (E) = E_Package
4005 and then Present (Renamed_Object (E))
4006 and then Is_Generic_Instance (Renamed_Object (E))
4007 and then In_Open_Scopes (Renamed_Object (E))
4008 and then Comes_From_Source (N)
4010 Set_Is_Immediately_Visible (E, False);
4014 for J in Level + 1 .. Scope_Stack.Last loop
4015 if Scope_Stack.Table (J).Entity = Scope (E2)
4016 or else Scope_Stack.Table (J).Entity = E2
4029 -- At the end of that loop, E is the innermost immediately
4030 -- visible entity, so we are all set.
4033 -- Come here with entity found, and stored in E
4037 -- When distribution features are available (Get_PCS_Name /=
4038 -- Name_No_DSA), a remote access-to-subprogram type is converted
4039 -- into a record type holding whatever information is needed to
4040 -- perform a remote call on an RCI subprogram. In that case we
4041 -- rewrite any occurrence of the RAS type into the equivalent record
4042 -- type here. 'Access attribute references and RAS dereferences are
4043 -- then implemented using specific TSSs. However when distribution is
4044 -- not available (case of Get_PCS_Name = Name_No_DSA), we bypass the
4045 -- generation of these TSSs, and we must keep the RAS type in its
4046 -- original access-to-subprogram form (since all calls through a
4047 -- value of such type will be local anyway in the absence of a PCS).
4049 if Comes_From_Source (N)
4050 and then Is_Remote_Access_To_Subprogram_Type (E)
4051 and then Expander_Active
4052 and then Get_PCS_Name /= Name_No_DSA
4055 New_Occurrence_Of (Equivalent_Type (E), Sloc (N)));
4060 -- Why no Style_Check here???
4065 Set_Etype (N, Get_Full_View (Etype (E)));
4068 if Debug_Flag_E then
4069 Write_Str (" found ");
4070 Write_Entity_Info (E, " ");
4073 -- If the Ekind of the entity is Void, it means that all homonyms
4074 -- are hidden from all visibility (RM 8.3(5,14-20)). However, this
4075 -- test is skipped if the current scope is a record and the name is
4076 -- a pragma argument expression (case of Atomic and Volatile pragmas
4077 -- and possibly other similar pragmas added later, which are allowed
4078 -- to reference components in the current record).
4080 if Ekind (E) = E_Void
4082 (not Is_Record_Type (Current_Scope)
4083 or else Nkind (Parent (N)) /= N_Pragma_Argument_Association)
4085 Premature_Usage (N);
4087 -- If the entity is overloadable, collect all interpretations of the
4088 -- name for subsequent overload resolution. We optimize a bit here to
4089 -- do this only if we have an overloadable entity that is not on its
4090 -- own on the homonym chain.
4092 elsif Is_Overloadable (E)
4093 and then (Present (Homonym (E)) or else Current_Entity (N) /= E)
4095 Collect_Interps (N);
4097 -- If no homonyms were visible, the entity is unambiguous
4099 if not Is_Overloaded (N) then
4100 if not Is_Actual_Parameter then
4101 Generate_Reference (E, N);
4105 -- Case of non-overloadable entity, set the entity providing that
4106 -- we do not have the case of a discriminant reference within a
4107 -- default expression. Such references are replaced with the
4108 -- corresponding discriminal, which is the formal corresponding to
4109 -- to the discriminant in the initialization procedure.
4112 -- Entity is unambiguous, indicate that it is referenced here
4114 -- For a renaming of an object, always generate simple reference,
4115 -- we don't try to keep track of assignments in this case.
4117 if Is_Object (E) and then Present (Renamed_Object (E)) then
4118 Generate_Reference (E, N);
4120 -- If the renamed entity is a private protected component,
4121 -- reference the original component as well. This needs to be
4122 -- done because the private renamings are installed before any
4123 -- analysis has occurred. Reference to a private component will
4124 -- resolve to the renaming and the original component will be
4125 -- left unreferenced, hence the following.
4127 if Is_Prival (E) then
4128 Generate_Reference (Prival_Link (E), N);
4131 -- One odd case is that we do not want to set the Referenced flag
4132 -- if the entity is a label, and the identifier is the label in
4133 -- the source, since this is not a reference from the point of
4134 -- view of the user.
4136 elsif Nkind (Parent (N)) = N_Label then
4138 R : constant Boolean := Referenced (E);
4141 -- Generate reference unless this is an actual parameter
4142 -- (see comment below)
4144 if Is_Actual_Parameter then
4145 Generate_Reference (E, N);
4146 Set_Referenced (E, R);
4150 -- Normal case, not a label: generate reference
4152 -- ??? It is too early to generate a reference here even if
4153 -- the entity is unambiguous, because the tree is not
4154 -- sufficiently typed at this point for Generate_Reference to
4155 -- determine whether this reference modifies the denoted object
4156 -- (because implicit dereferences cannot be identified prior to
4157 -- full type resolution).
4159 -- The Is_Actual_Parameter routine takes care of one of these
4160 -- cases but there are others probably ???
4163 if not Is_Actual_Parameter then
4164 Generate_Reference (E, N);
4167 Check_Nested_Access (E);
4170 -- Set Entity, with style check if need be. For a discriminant
4171 -- reference, replace by the corresponding discriminal, i.e. the
4172 -- parameter of the initialization procedure that corresponds to
4173 -- the discriminant. If this replacement is being performed, there
4174 -- is no style check to perform.
4176 -- This replacement must not be done if we are currently
4177 -- processing a generic spec or body, because the discriminal
4178 -- has not been not generated in this case.
4180 -- The replacement is also skipped if we are in special
4181 -- spec-expression mode. Why is this skipped in this case ???
4183 if not In_Spec_Expression
4184 or else Ekind (E) /= E_Discriminant
4185 or else Inside_A_Generic
4187 Set_Entity_With_Style_Check (N, E);
4189 -- The replacement is not done either for a task discriminant that
4190 -- appears in a default expression of an entry parameter. See
4191 -- Expand_Discriminant in exp_ch2 for details on their handling.
4193 elsif Is_Concurrent_Type (Scope (E)) then
4200 and then not Nkind_In (P, N_Parameter_Specification,
4201 N_Component_Declaration)
4207 and then Nkind (P) = N_Parameter_Specification
4211 Set_Entity (N, Discriminal (E));
4215 -- Otherwise, this is a discriminant in a context in which
4216 -- it is a reference to the corresponding parameter of the
4217 -- init proc for the enclosing type.
4220 Set_Entity (N, Discriminal (E));
4224 end Find_Direct_Name;
4226 ------------------------
4227 -- Find_Expanded_Name --
4228 ------------------------
4230 -- This routine searches the homonym chain of the entity until it finds
4231 -- an entity declared in the scope denoted by the prefix. If the entity
4232 -- is private, it may nevertheless be immediately visible, if we are in
4233 -- the scope of its declaration.
4235 procedure Find_Expanded_Name (N : Node_Id) is
4236 Selector : constant Node_Id := Selector_Name (N);
4237 Candidate : Entity_Id := Empty;
4243 P_Name := Entity (Prefix (N));
4246 -- If the prefix is a renamed package, look for the entity
4247 -- in the original package.
4249 if Ekind (P_Name) = E_Package
4250 and then Present (Renamed_Object (P_Name))
4252 P_Name := Renamed_Object (P_Name);
4254 -- Rewrite node with entity field pointing to renamed object
4256 Rewrite (Prefix (N), New_Copy (Prefix (N)));
4257 Set_Entity (Prefix (N), P_Name);
4259 -- If the prefix is an object of a concurrent type, look for
4260 -- the entity in the associated task or protected type.
4262 elsif Is_Concurrent_Type (Etype (P_Name)) then
4263 P_Name := Etype (P_Name);
4266 Id := Current_Entity (Selector);
4269 Is_New_Candidate : Boolean;
4272 while Present (Id) loop
4273 if Scope (Id) = P_Name then
4275 Is_New_Candidate := True;
4277 -- Ada 2005 (AI-217): Handle shadow entities associated with types
4278 -- declared in limited-withed nested packages. We don't need to
4279 -- handle E_Incomplete_Subtype entities because the entities in
4280 -- the limited view are always E_Incomplete_Type entities (see
4281 -- Build_Limited_Views). Regarding the expression used to evaluate
4282 -- the scope, it is important to note that the limited view also
4283 -- has shadow entities associated nested packages. For this reason
4284 -- the correct scope of the entity is the scope of the real entity
4285 -- The non-limited view may itself be incomplete, in which case
4286 -- get the full view if available.
4288 elsif From_With_Type (Id)
4289 and then Is_Type (Id)
4290 and then Ekind (Id) = E_Incomplete_Type
4291 and then Present (Non_Limited_View (Id))
4292 and then Scope (Non_Limited_View (Id)) = P_Name
4294 Candidate := Get_Full_View (Non_Limited_View (Id));
4295 Is_New_Candidate := True;
4298 Is_New_Candidate := False;
4301 if Is_New_Candidate then
4302 if Is_Child_Unit (Id) then
4303 exit when Is_Visible_Child_Unit (Id)
4304 or else Is_Immediately_Visible (Id);
4307 exit when not Is_Hidden (Id)
4308 or else Is_Immediately_Visible (Id);
4317 and then (Ekind (P_Name) = E_Procedure
4319 Ekind (P_Name) = E_Function)
4320 and then Is_Generic_Instance (P_Name)
4322 -- Expanded name denotes entity in (instance of) generic subprogram.
4323 -- The entity may be in the subprogram instance, or may denote one of
4324 -- the formals, which is declared in the enclosing wrapper package.
4326 P_Name := Scope (P_Name);
4328 Id := Current_Entity (Selector);
4329 while Present (Id) loop
4330 exit when Scope (Id) = P_Name;
4335 if No (Id) or else Chars (Id) /= Chars (Selector) then
4336 Set_Etype (N, Any_Type);
4338 -- If we are looking for an entity defined in System, try to
4339 -- find it in the child package that may have been provided as
4340 -- an extension to System. The Extend_System pragma will have
4341 -- supplied the name of the extension, which may have to be loaded.
4343 if Chars (P_Name) = Name_System
4344 and then Scope (P_Name) = Standard_Standard
4345 and then Present (System_Extend_Unit)
4346 and then Present_System_Aux (N)
4348 Set_Entity (Prefix (N), System_Aux_Id);
4349 Find_Expanded_Name (N);
4352 elsif Nkind (Selector) = N_Operator_Symbol
4353 and then Has_Implicit_Operator (N)
4355 -- There is an implicit instance of the predefined operator in
4356 -- the given scope. The operator entity is defined in Standard.
4357 -- Has_Implicit_Operator makes the node into an Expanded_Name.
4361 elsif Nkind (Selector) = N_Character_Literal
4362 and then Has_Implicit_Character_Literal (N)
4364 -- If there is no literal defined in the scope denoted by the
4365 -- prefix, the literal may belong to (a type derived from)
4366 -- Standard_Character, for which we have no explicit literals.
4371 -- If the prefix is a single concurrent object, use its
4372 -- name in the error message, rather than that of the
4375 if Is_Concurrent_Type (P_Name)
4376 and then Is_Internal_Name (Chars (P_Name))
4378 Error_Msg_Node_2 := Entity (Prefix (N));
4380 Error_Msg_Node_2 := P_Name;
4383 if P_Name = System_Aux_Id then
4384 P_Name := Scope (P_Name);
4385 Set_Entity (Prefix (N), P_Name);
4388 if Present (Candidate) then
4390 -- If we know that the unit is a child unit we can give a more
4391 -- accurate error message.
4393 if Is_Child_Unit (Candidate) then
4395 -- If the candidate is a private child unit and we are in
4396 -- the visible part of a public unit, specialize the error
4397 -- message. There might be a private with_clause for it,
4398 -- but it is not currently active.
4400 if Is_Private_Descendant (Candidate)
4401 and then Ekind (Current_Scope) = E_Package
4402 and then not In_Private_Part (Current_Scope)
4403 and then not Is_Private_Descendant (Current_Scope)
4405 Error_Msg_N ("private child unit& is not visible here",
4408 -- Normal case where we have a missing with for a child unit
4411 Error_Msg_Qual_Level := 99;
4412 Error_Msg_NE ("missing `WITH &;`", Selector, Candidate);
4413 Error_Msg_Qual_Level := 0;
4416 -- Here we don't know that this is a child unit
4419 Error_Msg_NE ("& is not a visible entity of&", N, Selector);
4423 -- Within the instantiation of a child unit, the prefix may
4424 -- denote the parent instance, but the selector has the name
4425 -- of the original child. Find whether we are within the
4426 -- corresponding instance, and get the proper entity, which
4427 -- can only be an enclosing scope.
4430 and then In_Open_Scopes (P_Name)
4431 and then Is_Generic_Instance (P_Name)
4434 S : Entity_Id := Current_Scope;
4438 for J in reverse 0 .. Scope_Stack.Last loop
4439 S := Scope_Stack.Table (J).Entity;
4441 exit when S = Standard_Standard;
4443 if Ekind (S) = E_Function
4444 or else Ekind (S) = E_Package
4445 or else Ekind (S) = E_Procedure
4447 P := Generic_Parent (Specification
4448 (Unit_Declaration_Node (S)));
4451 and then Chars (Scope (P)) = Chars (O_Name)
4452 and then Chars (P) = Chars (Selector)
4463 -- If this is a selection from Ada, System or Interfaces, then
4464 -- we assume a missing with for the corresponding package.
4466 if Is_Known_Unit (N) then
4467 if not Error_Posted (N) then
4468 Error_Msg_Node_2 := Selector;
4469 Error_Msg_N ("missing `WITH &.&;`", Prefix (N));
4472 -- If this is a selection from a dummy package, then suppress
4473 -- the error message, of course the entity is missing if the
4474 -- package is missing!
4476 elsif Sloc (Error_Msg_Node_2) = No_Location then
4479 -- Here we have the case of an undefined component
4482 Error_Msg_NE ("& not declared in&", N, Selector);
4484 -- Check for misspelling of some entity in prefix
4486 Id := First_Entity (P_Name);
4487 while Present (Id) loop
4488 if Is_Bad_Spelling_Of (Chars (Id), Chars (Selector))
4489 and then not Is_Internal_Name (Chars (Id))
4492 ("possible misspelling of&", Selector, Id);
4499 -- Specialize the message if this may be an instantiation
4500 -- of a child unit that was not mentioned in the context.
4502 if Nkind (Parent (N)) = N_Package_Instantiation
4503 and then Is_Generic_Instance (Entity (Prefix (N)))
4504 and then Is_Compilation_Unit
4505 (Generic_Parent (Parent (Entity (Prefix (N)))))
4507 Error_Msg_Node_2 := Selector;
4508 Error_Msg_N ("\missing `WITH &.&;`", Prefix (N));
4518 if Comes_From_Source (N)
4519 and then Is_Remote_Access_To_Subprogram_Type (Id)
4520 and then Present (Equivalent_Type (Id))
4522 -- If we are not actually generating distribution code (i.e. the
4523 -- current PCS is the dummy non-distributed version), then the
4524 -- Equivalent_Type will be missing, and Id should be treated as
4525 -- a regular access-to-subprogram type.
4527 Id := Equivalent_Type (Id);
4528 Set_Chars (Selector, Chars (Id));
4531 -- Ada 2005 (AI-50217): Check usage of entities in limited withed units
4533 if Ekind (P_Name) = E_Package
4534 and then From_With_Type (P_Name)
4536 if From_With_Type (Id)
4537 or else Is_Type (Id)
4538 or else Ekind (Id) = E_Package
4543 ("limited withed package can only be used to access "
4544 & "incomplete types",
4549 if Is_Task_Type (P_Name)
4550 and then ((Ekind (Id) = E_Entry
4551 and then Nkind (Parent (N)) /= N_Attribute_Reference)
4553 (Ekind (Id) = E_Entry_Family
4555 Nkind (Parent (Parent (N))) /= N_Attribute_Reference))
4557 -- It is an entry call after all, either to the current task (which
4558 -- will deadlock) or to an enclosing task.
4560 Analyze_Selected_Component (N);
4564 Change_Selected_Component_To_Expanded_Name (N);
4566 -- Do style check and generate reference, but skip both steps if this
4567 -- entity has homonyms, since we may not have the right homonym set yet.
4568 -- The proper homonym will be set during the resolve phase.
4570 if Has_Homonym (Id) then
4573 Set_Entity_With_Style_Check (N, Id);
4574 Generate_Reference (Id, N);
4577 if Is_Type (Id) then
4580 Set_Etype (N, Get_Full_View (Etype (Id)));
4583 -- If the Ekind of the entity is Void, it means that all homonyms are
4584 -- hidden from all visibility (RM 8.3(5,14-20)).
4586 if Ekind (Id) = E_Void then
4587 Premature_Usage (N);
4589 elsif Is_Overloadable (Id)
4590 and then Present (Homonym (Id))
4593 H : Entity_Id := Homonym (Id);
4596 while Present (H) loop
4597 if Scope (H) = Scope (Id)
4600 or else Is_Immediately_Visible (H))
4602 Collect_Interps (N);
4609 -- If an extension of System is present, collect possible explicit
4610 -- overloadings declared in the extension.
4612 if Chars (P_Name) = Name_System
4613 and then Scope (P_Name) = Standard_Standard
4614 and then Present (System_Extend_Unit)
4615 and then Present_System_Aux (N)
4617 H := Current_Entity (Id);
4619 while Present (H) loop
4620 if Scope (H) = System_Aux_Id then
4621 Add_One_Interp (N, H, Etype (H));
4630 if Nkind (Selector_Name (N)) = N_Operator_Symbol
4631 and then Scope (Id) /= Standard_Standard
4633 -- In addition to user-defined operators in the given scope, there
4634 -- may be an implicit instance of the predefined operator. The
4635 -- operator (defined in Standard) is found in Has_Implicit_Operator,
4636 -- and added to the interpretations. Procedure Add_One_Interp will
4637 -- determine which hides which.
4639 if Has_Implicit_Operator (N) then
4643 end Find_Expanded_Name;
4645 -------------------------
4646 -- Find_Renamed_Entity --
4647 -------------------------
4649 function Find_Renamed_Entity
4653 Is_Actual : Boolean := False) return Entity_Id
4656 I1 : Interp_Index := 0; -- Suppress junk warnings
4662 function Enclosing_Instance return Entity_Id;
4663 -- If the renaming determines the entity for the default of a formal
4664 -- subprogram nested within another instance, choose the innermost
4665 -- candidate. This is because if the formal has a box, and we are within
4666 -- an enclosing instance where some candidate interpretations are local
4667 -- to this enclosing instance, we know that the default was properly
4668 -- resolved when analyzing the generic, so we prefer the local
4669 -- candidates to those that are external. This is not always the case
4670 -- but is a reasonable heuristic on the use of nested generics. The
4671 -- proper solution requires a full renaming model.
4673 function Is_Visible_Operation (Op : Entity_Id) return Boolean;
4674 -- If the renamed entity is an implicit operator, check whether it is
4675 -- visible because its operand type is properly visible. This check
4676 -- applies to explicit renamed entities that appear in the source in a
4677 -- renaming declaration or a formal subprogram instance, but not to
4678 -- default generic actuals with a name.
4680 function Report_Overload return Entity_Id;
4681 -- List possible interpretations, and specialize message in the
4682 -- case of a generic actual.
4684 function Within (Inner, Outer : Entity_Id) return Boolean;
4685 -- Determine whether a candidate subprogram is defined within the
4686 -- enclosing instance. If yes, it has precedence over outer candidates.
4688 ------------------------
4689 -- Enclosing_Instance --
4690 ------------------------
4692 function Enclosing_Instance return Entity_Id is
4696 if not Is_Generic_Instance (Current_Scope)
4697 and then not Is_Actual
4702 S := Scope (Current_Scope);
4703 while S /= Standard_Standard loop
4704 if Is_Generic_Instance (S) then
4712 end Enclosing_Instance;
4714 --------------------------
4715 -- Is_Visible_Operation --
4716 --------------------------
4718 function Is_Visible_Operation (Op : Entity_Id) return Boolean is
4724 if Ekind (Op) /= E_Operator
4725 or else Scope (Op) /= Standard_Standard
4726 or else (In_Instance
4729 or else Present (Enclosing_Instance)))
4734 -- For a fixed point type operator, check the resulting type,
4735 -- because it may be a mixed mode integer * fixed operation.
4737 if Present (Next_Formal (First_Formal (New_S)))
4738 and then Is_Fixed_Point_Type (Etype (New_S))
4740 Typ := Etype (New_S);
4742 Typ := Etype (First_Formal (New_S));
4745 Btyp := Base_Type (Typ);
4747 if Nkind (Nam) /= N_Expanded_Name then
4748 return (In_Open_Scopes (Scope (Btyp))
4749 or else Is_Potentially_Use_Visible (Btyp)
4750 or else In_Use (Btyp)
4751 or else In_Use (Scope (Btyp)));
4754 Scop := Entity (Prefix (Nam));
4756 if Ekind (Scop) = E_Package
4757 and then Present (Renamed_Object (Scop))
4759 Scop := Renamed_Object (Scop);
4762 -- Operator is visible if prefix of expanded name denotes
4763 -- scope of type, or else type type is defined in System_Aux
4764 -- and the prefix denotes System.
4766 return Scope (Btyp) = Scop
4767 or else (Scope (Btyp) = System_Aux_Id
4768 and then Scope (Scope (Btyp)) = Scop);
4771 end Is_Visible_Operation;
4777 function Within (Inner, Outer : Entity_Id) return Boolean is
4781 Sc := Scope (Inner);
4782 while Sc /= Standard_Standard loop
4793 ---------------------
4794 -- Report_Overload --
4795 ---------------------
4797 function Report_Overload return Entity_Id is
4801 ("ambiguous actual subprogram&, " &
4802 "possible interpretations:", N, Nam);
4805 ("ambiguous subprogram, " &
4806 "possible interpretations:", N);
4809 List_Interps (Nam, N);
4811 end Report_Overload;
4813 -- Start of processing for Find_Renamed_Entry
4817 Candidate_Renaming := Empty;
4819 if not Is_Overloaded (Nam) then
4820 if Entity_Matches_Spec (Entity (Nam), New_S)
4821 and then Is_Visible_Operation (Entity (Nam))
4823 Old_S := Entity (Nam);
4826 Present (First_Formal (Entity (Nam)))
4827 and then Present (First_Formal (New_S))
4828 and then (Base_Type (Etype (First_Formal (Entity (Nam))))
4829 = Base_Type (Etype (First_Formal (New_S))))
4831 Candidate_Renaming := Entity (Nam);
4835 Get_First_Interp (Nam, Ind, It);
4836 while Present (It.Nam) loop
4837 if Entity_Matches_Spec (It.Nam, New_S)
4838 and then Is_Visible_Operation (It.Nam)
4840 if Old_S /= Any_Id then
4842 -- Note: The call to Disambiguate only happens if a
4843 -- previous interpretation was found, in which case I1
4844 -- has received a value.
4846 It1 := Disambiguate (Nam, I1, Ind, Etype (Old_S));
4848 if It1 = No_Interp then
4849 Inst := Enclosing_Instance;
4851 if Present (Inst) then
4852 if Within (It.Nam, Inst) then
4854 elsif Within (Old_S, Inst) then
4857 return Report_Overload;
4861 return Report_Overload;
4875 Present (First_Formal (It.Nam))
4876 and then Present (First_Formal (New_S))
4877 and then (Base_Type (Etype (First_Formal (It.Nam)))
4878 = Base_Type (Etype (First_Formal (New_S))))
4880 Candidate_Renaming := It.Nam;
4883 Get_Next_Interp (Ind, It);
4886 Set_Entity (Nam, Old_S);
4887 Set_Is_Overloaded (Nam, False);
4891 end Find_Renamed_Entity;
4893 -----------------------------
4894 -- Find_Selected_Component --
4895 -----------------------------
4897 procedure Find_Selected_Component (N : Node_Id) is
4898 P : constant Node_Id := Prefix (N);
4901 -- Entity denoted by prefix
4911 if Nkind (P) = N_Error then
4914 -- If the selector already has an entity, the node has been constructed
4915 -- in the course of expansion, and is known to be valid. Do not verify
4916 -- that it is defined for the type (it may be a private component used
4917 -- in the expansion of record equality).
4919 elsif Present (Entity (Selector_Name (N))) then
4922 or else Etype (N) = Any_Type
4925 Sel_Name : constant Node_Id := Selector_Name (N);
4926 Selector : constant Entity_Id := Entity (Sel_Name);
4930 Set_Etype (Sel_Name, Etype (Selector));
4932 if not Is_Entity_Name (P) then
4936 -- Build an actual subtype except for the first parameter
4937 -- of an init proc, where this actual subtype is by
4938 -- definition incorrect, since the object is uninitialized
4939 -- (and does not even have defined discriminants etc.)
4941 if Is_Entity_Name (P)
4942 and then Ekind (Entity (P)) = E_Function
4944 Nam := New_Copy (P);
4946 if Is_Overloaded (P) then
4947 Save_Interps (P, Nam);
4951 Make_Function_Call (Sloc (P), Name => Nam));
4953 Analyze_Selected_Component (N);
4956 elsif Ekind (Selector) = E_Component
4957 and then (not Is_Entity_Name (P)
4958 or else Chars (Entity (P)) /= Name_uInit)
4961 Build_Actual_Subtype_Of_Component (
4962 Etype (Selector), N);
4967 if No (C_Etype) then
4968 C_Etype := Etype (Selector);
4970 Insert_Action (N, C_Etype);
4971 C_Etype := Defining_Identifier (C_Etype);
4974 Set_Etype (N, C_Etype);
4977 -- If this is the name of an entry or protected operation, and
4978 -- the prefix is an access type, insert an explicit dereference,
4979 -- so that entry calls are treated uniformly.
4981 if Is_Access_Type (Etype (P))
4982 and then Is_Concurrent_Type (Designated_Type (Etype (P)))
4985 New_P : constant Node_Id :=
4986 Make_Explicit_Dereference (Sloc (P),
4987 Prefix => Relocate_Node (P));
4990 Set_Etype (P, Designated_Type (Etype (Prefix (P))));
4994 -- If the selected component appears within a default expression
4995 -- and it has an actual subtype, the pre-analysis has not yet
4996 -- completed its analysis, because Insert_Actions is disabled in
4997 -- that context. Within the init proc of the enclosing type we
4998 -- must complete this analysis, if an actual subtype was created.
5000 elsif Inside_Init_Proc then
5002 Typ : constant Entity_Id := Etype (N);
5003 Decl : constant Node_Id := Declaration_Node (Typ);
5005 if Nkind (Decl) = N_Subtype_Declaration
5006 and then not Analyzed (Decl)
5007 and then Is_List_Member (Decl)
5008 and then No (Parent (Decl))
5011 Insert_Action (N, Decl);
5018 elsif Is_Entity_Name (P) then
5019 P_Name := Entity (P);
5021 -- The prefix may denote an enclosing type which is the completion
5022 -- of an incomplete type declaration.
5024 if Is_Type (P_Name) then
5025 Set_Entity (P, Get_Full_View (P_Name));
5026 Set_Etype (P, Entity (P));
5027 P_Name := Entity (P);
5030 P_Type := Base_Type (Etype (P));
5032 if Debug_Flag_E then
5033 Write_Str ("Found prefix type to be ");
5034 Write_Entity_Info (P_Type, " "); Write_Eol;
5037 -- First check for components of a record object (not the
5038 -- result of a call, which is handled below).
5040 if Is_Appropriate_For_Record (P_Type)
5041 and then not Is_Overloadable (P_Name)
5042 and then not Is_Type (P_Name)
5044 -- Selected component of record. Type checking will validate
5045 -- name of selector.
5046 -- ??? could we rewrite an implicit dereference into an explicit
5049 Analyze_Selected_Component (N);
5051 elsif Is_Appropriate_For_Entry_Prefix (P_Type)
5052 and then not In_Open_Scopes (P_Name)
5053 and then (not Is_Concurrent_Type (Etype (P_Name))
5054 or else not In_Open_Scopes (Etype (P_Name)))
5056 -- Call to protected operation or entry. Type checking is
5057 -- needed on the prefix.
5059 Analyze_Selected_Component (N);
5061 elsif (In_Open_Scopes (P_Name)
5062 and then Ekind (P_Name) /= E_Void
5063 and then not Is_Overloadable (P_Name))
5064 or else (Is_Concurrent_Type (Etype (P_Name))
5065 and then In_Open_Scopes (Etype (P_Name)))
5067 -- Prefix denotes an enclosing loop, block, or task, i.e. an
5068 -- enclosing construct that is not a subprogram or accept.
5070 Find_Expanded_Name (N);
5072 elsif Ekind (P_Name) = E_Package then
5073 Find_Expanded_Name (N);
5075 elsif Is_Overloadable (P_Name) then
5077 -- The subprogram may be a renaming (of an enclosing scope) as
5078 -- in the case of the name of the generic within an instantiation.
5080 if (Ekind (P_Name) = E_Procedure
5081 or else Ekind (P_Name) = E_Function)
5082 and then Present (Alias (P_Name))
5083 and then Is_Generic_Instance (Alias (P_Name))
5085 P_Name := Alias (P_Name);
5088 if Is_Overloaded (P) then
5090 -- The prefix must resolve to a unique enclosing construct
5093 Found : Boolean := False;
5098 Get_First_Interp (P, Ind, It);
5099 while Present (It.Nam) loop
5100 if In_Open_Scopes (It.Nam) then
5103 "prefix must be unique enclosing scope", N);
5104 Set_Entity (N, Any_Id);
5105 Set_Etype (N, Any_Type);
5114 Get_Next_Interp (Ind, It);
5119 if In_Open_Scopes (P_Name) then
5120 Set_Entity (P, P_Name);
5121 Set_Is_Overloaded (P, False);
5122 Find_Expanded_Name (N);
5125 -- If no interpretation as an expanded name is possible, it
5126 -- must be a selected component of a record returned by a
5127 -- function call. Reformat prefix as a function call, the rest
5128 -- is done by type resolution. If the prefix is procedure or
5129 -- entry, as is P.X; this is an error.
5131 if Ekind (P_Name) /= E_Function
5132 and then (not Is_Overloaded (P)
5134 Nkind (Parent (N)) = N_Procedure_Call_Statement)
5136 -- Prefix may mention a package that is hidden by a local
5137 -- declaration: let the user know. Scan the full homonym
5138 -- chain, the candidate package may be anywhere on it.
5140 if Present (Homonym (Current_Entity (P_Name))) then
5142 P_Name := Current_Entity (P_Name);
5144 while Present (P_Name) loop
5145 exit when Ekind (P_Name) = E_Package;
5146 P_Name := Homonym (P_Name);
5149 if Present (P_Name) then
5150 Error_Msg_Sloc := Sloc (Entity (Prefix (N)));
5153 ("package& is hidden by declaration#",
5156 Set_Entity (Prefix (N), P_Name);
5157 Find_Expanded_Name (N);
5160 P_Name := Entity (Prefix (N));
5165 ("invalid prefix in selected component&", N, P_Name);
5166 Change_Selected_Component_To_Expanded_Name (N);
5167 Set_Entity (N, Any_Id);
5168 Set_Etype (N, Any_Type);
5171 Nam := New_Copy (P);
5172 Save_Interps (P, Nam);
5174 Make_Function_Call (Sloc (P), Name => Nam));
5176 Analyze_Selected_Component (N);
5180 -- Remaining cases generate various error messages
5183 -- Format node as expanded name, to avoid cascaded errors
5185 Change_Selected_Component_To_Expanded_Name (N);
5186 Set_Entity (N, Any_Id);
5187 Set_Etype (N, Any_Type);
5189 -- Issue error message, but avoid this if error issued already.
5190 -- Use identifier of prefix if one is available.
5192 if P_Name = Any_Id then
5195 elsif Ekind (P_Name) = E_Void then
5196 Premature_Usage (P);
5198 elsif Nkind (P) /= N_Attribute_Reference then
5200 "invalid prefix in selected component&", P);
5202 if Is_Access_Type (P_Type)
5203 and then Ekind (Designated_Type (P_Type)) = E_Incomplete_Type
5206 ("\dereference must not be of an incomplete type " &
5212 "invalid prefix in selected component", P);
5217 -- If prefix is not the name of an entity, it must be an expression,
5218 -- whose type is appropriate for a record. This is determined by
5221 Analyze_Selected_Component (N);
5223 end Find_Selected_Component;
5229 procedure Find_Type (N : Node_Id) is
5239 elsif Nkind (N) = N_Attribute_Reference then
5241 -- Class attribute. This is not valid in Ada 83 mode, but we do not
5242 -- need to enforce that at this point, since the declaration of the
5243 -- tagged type in the prefix would have been flagged already.
5245 if Attribute_Name (N) = Name_Class then
5246 Check_Restriction (No_Dispatch, N);
5247 Find_Type (Prefix (N));
5249 -- Propagate error from bad prefix
5251 if Etype (Prefix (N)) = Any_Type then
5252 Set_Entity (N, Any_Type);
5253 Set_Etype (N, Any_Type);
5257 T := Base_Type (Entity (Prefix (N)));
5259 -- Case where type is not known to be tagged. Its appearance in
5260 -- the prefix of the 'Class attribute indicates that the full view
5263 if not Is_Tagged_Type (T) then
5264 if Ekind (T) = E_Incomplete_Type then
5266 -- It is legal to denote the class type of an incomplete
5267 -- type. The full type will have to be tagged, of course.
5268 -- In Ada 2005 this usage is declared obsolescent, so we
5269 -- warn accordingly.
5271 -- ??? This test is temporarily disabled (always False)
5272 -- because it causes an unwanted warning on GNAT sources
5273 -- (built with -gnatg, which includes Warn_On_Obsolescent_
5274 -- Feature). Once this issue is cleared in the sources, it
5277 if not Is_Tagged_Type (T)
5278 and then Ada_Version >= Ada_05
5279 and then Warn_On_Obsolescent_Feature
5283 ("applying 'Class to an untagged incomplete type"
5284 & " is an obsolescent feature (RM J.11)", N);
5287 Set_Is_Tagged_Type (T);
5288 Set_Primitive_Operations (T, New_Elmt_List);
5289 Make_Class_Wide_Type (T);
5290 Set_Entity (N, Class_Wide_Type (T));
5291 Set_Etype (N, Class_Wide_Type (T));
5293 elsif Ekind (T) = E_Private_Type
5294 and then not Is_Generic_Type (T)
5295 and then In_Private_Part (Scope (T))
5297 -- The Class attribute can be applied to an untagged private
5298 -- type fulfilled by a tagged type prior to the full type
5299 -- declaration (but only within the parent package's private
5300 -- part). Create the class-wide type now and check that the
5301 -- full type is tagged later during its analysis. Note that
5302 -- we do not mark the private type as tagged, unlike the
5303 -- case of incomplete types, because the type must still
5304 -- appear untagged to outside units.
5306 if No (Class_Wide_Type (T)) then
5307 Make_Class_Wide_Type (T);
5310 Set_Entity (N, Class_Wide_Type (T));
5311 Set_Etype (N, Class_Wide_Type (T));
5314 -- Should we introduce a type Any_Tagged and use Wrong_Type
5315 -- here, it would be a bit more consistent???
5318 ("tagged type required, found}",
5319 Prefix (N), First_Subtype (T));
5320 Set_Entity (N, Any_Type);
5324 -- Case of tagged type
5327 if Is_Concurrent_Type (T) then
5328 if No (Corresponding_Record_Type (Entity (Prefix (N)))) then
5330 -- Previous error. Use current type, which at least
5331 -- provides some operations.
5333 C := Entity (Prefix (N));
5336 C := Class_Wide_Type
5337 (Corresponding_Record_Type (Entity (Prefix (N))));
5341 C := Class_Wide_Type (Entity (Prefix (N)));
5344 Set_Entity_With_Style_Check (N, C);
5345 Generate_Reference (C, N);
5349 -- Base attribute, not allowed in Ada 83
5351 elsif Attribute_Name (N) = Name_Base then
5352 if Ada_Version = Ada_83 and then Comes_From_Source (N) then
5354 ("(Ada 83) Base attribute not allowed in subtype mark", N);
5357 Find_Type (Prefix (N));
5358 Typ := Entity (Prefix (N));
5360 if Ada_Version >= Ada_95
5361 and then not Is_Scalar_Type (Typ)
5362 and then not Is_Generic_Type (Typ)
5365 ("prefix of Base attribute must be scalar type",
5368 elsif Sloc (Typ) = Standard_Location
5369 and then Base_Type (Typ) = Typ
5370 and then Warn_On_Redundant_Constructs
5373 ("?redundant attribute, & is its own base type", N, Typ);
5376 T := Base_Type (Typ);
5378 -- Rewrite attribute reference with type itself (see similar
5379 -- processing in Analyze_Attribute, case Base). Preserve
5380 -- prefix if present, for other legality checks.
5382 if Nkind (Prefix (N)) = N_Expanded_Name then
5384 Make_Expanded_Name (Sloc (N),
5386 Prefix => New_Copy (Prefix (Prefix (N))),
5387 Selector_Name => New_Reference_To (T, Sloc (N))));
5390 Rewrite (N, New_Reference_To (T, Sloc (N)));
5397 elsif Attribute_Name (N) = Name_Stub_Type then
5399 -- This is handled in Analyze_Attribute
5403 -- All other attributes are invalid in a subtype mark
5406 Error_Msg_N ("invalid attribute in subtype mark", N);
5412 if Is_Entity_Name (N) then
5413 T_Name := Entity (N);
5415 Error_Msg_N ("subtype mark required in this context", N);
5416 Set_Etype (N, Any_Type);
5420 if T_Name = Any_Id or else Etype (N) = Any_Type then
5422 -- Undefined id. Make it into a valid type
5424 Set_Entity (N, Any_Type);
5426 elsif not Is_Type (T_Name)
5427 and then T_Name /= Standard_Void_Type
5429 Error_Msg_Sloc := Sloc (T_Name);
5430 Error_Msg_N ("subtype mark required in this context", N);
5431 Error_Msg_NE ("\\found & declared#", N, T_Name);
5432 Set_Entity (N, Any_Type);
5435 -- If the type is an incomplete type created to handle
5436 -- anonymous access components of a record type, then the
5437 -- incomplete type is the visible entity and subsequent
5438 -- references will point to it. Mark the original full
5439 -- type as referenced, to prevent spurious warnings.
5441 if Is_Incomplete_Type (T_Name)
5442 and then Present (Full_View (T_Name))
5443 and then not Comes_From_Source (T_Name)
5445 Set_Referenced (Full_View (T_Name));
5448 T_Name := Get_Full_View (T_Name);
5450 -- Ada 2005 (AI-251, AI-50217): Handle interfaces visible through
5451 -- limited-with clauses
5453 if From_With_Type (T_Name)
5454 and then Ekind (T_Name) in Incomplete_Kind
5455 and then Present (Non_Limited_View (T_Name))
5456 and then Is_Interface (Non_Limited_View (T_Name))
5458 T_Name := Non_Limited_View (T_Name);
5461 if In_Open_Scopes (T_Name) then
5462 if Ekind (Base_Type (T_Name)) = E_Task_Type then
5464 -- In Ada 2005, a task name can be used in an access
5465 -- definition within its own body.
5467 if Ada_Version >= Ada_05
5468 and then Nkind (Parent (N)) = N_Access_Definition
5470 Set_Entity (N, T_Name);
5471 Set_Etype (N, T_Name);
5476 ("task type cannot be used as type mark " &
5477 "within its own spec or body", N);
5480 elsif Ekind (Base_Type (T_Name)) = E_Protected_Type then
5482 -- In Ada 2005, a protected name can be used in an access
5483 -- definition within its own body.
5485 if Ada_Version >= Ada_05
5486 and then Nkind (Parent (N)) = N_Access_Definition
5488 Set_Entity (N, T_Name);
5489 Set_Etype (N, T_Name);
5494 ("protected type cannot be used as type mark " &
5495 "within its own spec or body", N);
5499 Error_Msg_N ("type declaration cannot refer to itself", N);
5502 Set_Etype (N, Any_Type);
5503 Set_Entity (N, Any_Type);
5504 Set_Error_Posted (T_Name);
5508 Set_Entity (N, T_Name);
5509 Set_Etype (N, T_Name);
5513 if Present (Etype (N)) and then Comes_From_Source (N) then
5514 if Is_Fixed_Point_Type (Etype (N)) then
5515 Check_Restriction (No_Fixed_Point, N);
5516 elsif Is_Floating_Point_Type (Etype (N)) then
5517 Check_Restriction (No_Floating_Point, N);
5522 ------------------------------------
5523 -- Has_Implicit_Character_Literal --
5524 ------------------------------------
5526 function Has_Implicit_Character_Literal (N : Node_Id) return Boolean is
5528 Found : Boolean := False;
5529 P : constant Entity_Id := Entity (Prefix (N));
5530 Priv_Id : Entity_Id := Empty;
5533 if Ekind (P) = E_Package
5534 and then not In_Open_Scopes (P)
5536 Priv_Id := First_Private_Entity (P);
5539 if P = Standard_Standard then
5540 Change_Selected_Component_To_Expanded_Name (N);
5541 Rewrite (N, Selector_Name (N));
5543 Set_Etype (Original_Node (N), Standard_Character);
5547 Id := First_Entity (P);
5549 and then Id /= Priv_Id
5551 if Is_Standard_Character_Type (Id)
5552 and then Id = Base_Type (Id)
5554 -- We replace the node with the literal itself, resolve as a
5555 -- character, and set the type correctly.
5558 Change_Selected_Component_To_Expanded_Name (N);
5559 Rewrite (N, Selector_Name (N));
5562 Set_Etype (Original_Node (N), Id);
5566 -- More than one type derived from Character in given scope.
5567 -- Collect all possible interpretations.
5569 Add_One_Interp (N, Id, Id);
5577 end Has_Implicit_Character_Literal;
5579 ----------------------
5580 -- Has_Private_With --
5581 ----------------------
5583 function Has_Private_With (E : Entity_Id) return Boolean is
5584 Comp_Unit : constant Node_Id := Cunit (Current_Sem_Unit);
5588 Item := First (Context_Items (Comp_Unit));
5589 while Present (Item) loop
5590 if Nkind (Item) = N_With_Clause
5591 and then Private_Present (Item)
5592 and then Entity (Name (Item)) = E
5601 end Has_Private_With;
5603 ---------------------------
5604 -- Has_Implicit_Operator --
5605 ---------------------------
5607 function Has_Implicit_Operator (N : Node_Id) return Boolean is
5608 Op_Id : constant Name_Id := Chars (Selector_Name (N));
5609 P : constant Entity_Id := Entity (Prefix (N));
5611 Priv_Id : Entity_Id := Empty;
5613 procedure Add_Implicit_Operator
5615 Op_Type : Entity_Id := Empty);
5616 -- Add implicit interpretation to node N, using the type for which a
5617 -- predefined operator exists. If the operator yields a boolean type,
5618 -- the Operand_Type is implicitly referenced by the operator, and a
5619 -- reference to it must be generated.
5621 ---------------------------
5622 -- Add_Implicit_Operator --
5623 ---------------------------
5625 procedure Add_Implicit_Operator
5627 Op_Type : Entity_Id := Empty)
5629 Predef_Op : Entity_Id;
5632 Predef_Op := Current_Entity (Selector_Name (N));
5634 while Present (Predef_Op)
5635 and then Scope (Predef_Op) /= Standard_Standard
5637 Predef_Op := Homonym (Predef_Op);
5640 if Nkind (N) = N_Selected_Component then
5641 Change_Selected_Component_To_Expanded_Name (N);
5644 Add_One_Interp (N, Predef_Op, T);
5646 -- For operators with unary and binary interpretations, add both
5648 if Present (Homonym (Predef_Op)) then
5649 Add_One_Interp (N, Homonym (Predef_Op), T);
5652 -- The node is a reference to a predefined operator, and
5653 -- an implicit reference to the type of its operands.
5655 if Present (Op_Type) then
5656 Generate_Operator_Reference (N, Op_Type);
5658 Generate_Operator_Reference (N, T);
5660 end Add_Implicit_Operator;
5662 -- Start of processing for Has_Implicit_Operator
5665 if Ekind (P) = E_Package
5666 and then not In_Open_Scopes (P)
5668 Priv_Id := First_Private_Entity (P);
5671 Id := First_Entity (P);
5675 -- Boolean operators: an implicit declaration exists if the scope
5676 -- contains a declaration for a derived Boolean type, or for an
5677 -- array of Boolean type.
5679 when Name_Op_And | Name_Op_Not | Name_Op_Or | Name_Op_Xor =>
5680 while Id /= Priv_Id loop
5681 if Valid_Boolean_Arg (Id)
5682 and then Id = Base_Type (Id)
5684 Add_Implicit_Operator (Id);
5691 -- Equality: look for any non-limited type (result is Boolean)
5693 when Name_Op_Eq | Name_Op_Ne =>
5694 while Id /= Priv_Id loop
5696 and then not Is_Limited_Type (Id)
5697 and then Id = Base_Type (Id)
5699 Add_Implicit_Operator (Standard_Boolean, Id);
5706 -- Comparison operators: scalar type, or array of scalar
5708 when Name_Op_Lt | Name_Op_Le | Name_Op_Gt | Name_Op_Ge =>
5709 while Id /= Priv_Id loop
5710 if (Is_Scalar_Type (Id)
5711 or else (Is_Array_Type (Id)
5712 and then Is_Scalar_Type (Component_Type (Id))))
5713 and then Id = Base_Type (Id)
5715 Add_Implicit_Operator (Standard_Boolean, Id);
5722 -- Arithmetic operators: any numeric type
5732 while Id /= Priv_Id loop
5733 if Is_Numeric_Type (Id)
5734 and then Id = Base_Type (Id)
5736 Add_Implicit_Operator (Id);
5743 -- Concatenation: any one-dimensional array type
5745 when Name_Op_Concat =>
5746 while Id /= Priv_Id loop
5747 if Is_Array_Type (Id) and then Number_Dimensions (Id) = 1
5748 and then Id = Base_Type (Id)
5750 Add_Implicit_Operator (Id);
5757 -- What is the others condition here? Should we be using a
5758 -- subtype of Name_Id that would restrict to operators ???
5760 when others => null;
5763 -- If we fall through, then we do not have an implicit operator
5767 end Has_Implicit_Operator;
5769 --------------------
5770 -- In_Open_Scopes --
5771 --------------------
5773 function In_Open_Scopes (S : Entity_Id) return Boolean is
5775 -- Several scope stacks are maintained by Scope_Stack. The base of the
5776 -- currently active scope stack is denoted by the Is_Active_Stack_Base
5777 -- flag in the scope stack entry. Note that the scope stacks used to
5778 -- simply be delimited implicitly by the presence of Standard_Standard
5779 -- at their base, but there now are cases where this is not sufficient
5780 -- because Standard_Standard actually may appear in the middle of the
5781 -- active set of scopes.
5783 for J in reverse 0 .. Scope_Stack.Last loop
5784 if Scope_Stack.Table (J).Entity = S then
5788 -- Check Is_Active_Stack_Base to tell us when to stop, as there are
5789 -- cases where Standard_Standard appears in the middle of the active
5790 -- set of scopes. This affects the declaration and overriding of
5791 -- private inherited operations in instantiations of generic child
5794 exit when Scope_Stack.Table (J).Is_Active_Stack_Base;
5800 -----------------------------
5801 -- Inherit_Renamed_Profile --
5802 -----------------------------
5804 procedure Inherit_Renamed_Profile (New_S : Entity_Id; Old_S : Entity_Id) is
5811 if Ekind (Old_S) = E_Operator then
5812 New_F := First_Formal (New_S);
5814 while Present (New_F) loop
5815 Set_Etype (New_F, Base_Type (Etype (New_F)));
5816 Next_Formal (New_F);
5819 Set_Etype (New_S, Base_Type (Etype (New_S)));
5822 New_F := First_Formal (New_S);
5823 Old_F := First_Formal (Old_S);
5825 while Present (New_F) loop
5826 New_T := Etype (New_F);
5827 Old_T := Etype (Old_F);
5829 -- If the new type is a renaming of the old one, as is the
5830 -- case for actuals in instances, retain its name, to simplify
5831 -- later disambiguation.
5833 if Nkind (Parent (New_T)) = N_Subtype_Declaration
5834 and then Is_Entity_Name (Subtype_Indication (Parent (New_T)))
5835 and then Entity (Subtype_Indication (Parent (New_T))) = Old_T
5839 Set_Etype (New_F, Old_T);
5842 Next_Formal (New_F);
5843 Next_Formal (Old_F);
5846 if Ekind (Old_S) = E_Function
5847 or else Ekind (Old_S) = E_Enumeration_Literal
5849 Set_Etype (New_S, Etype (Old_S));
5852 end Inherit_Renamed_Profile;
5858 procedure Initialize is
5863 -------------------------
5864 -- Install_Use_Clauses --
5865 -------------------------
5867 procedure Install_Use_Clauses
5869 Force_Installation : Boolean := False)
5877 while Present (U) loop
5879 -- Case of USE package
5881 if Nkind (U) = N_Use_Package_Clause then
5882 P := First (Names (U));
5883 while Present (P) loop
5886 if Ekind (Id) = E_Package then
5888 Note_Redundant_Use (P);
5890 elsif Present (Renamed_Object (Id))
5891 and then In_Use (Renamed_Object (Id))
5893 Note_Redundant_Use (P);
5895 elsif Force_Installation or else Applicable_Use (P) then
5896 Use_One_Package (Id, U);
5907 P := First (Subtype_Marks (U));
5908 while Present (P) loop
5909 if not Is_Entity_Name (P)
5910 or else No (Entity (P))
5914 elsif Entity (P) /= Any_Type then
5922 Next_Use_Clause (U);
5924 end Install_Use_Clauses;
5926 -------------------------------------
5927 -- Is_Appropriate_For_Entry_Prefix --
5928 -------------------------------------
5930 function Is_Appropriate_For_Entry_Prefix (T : Entity_Id) return Boolean is
5931 P_Type : Entity_Id := T;
5934 if Is_Access_Type (P_Type) then
5935 P_Type := Designated_Type (P_Type);
5938 return Is_Task_Type (P_Type) or else Is_Protected_Type (P_Type);
5939 end Is_Appropriate_For_Entry_Prefix;
5941 -------------------------------
5942 -- Is_Appropriate_For_Record --
5943 -------------------------------
5945 function Is_Appropriate_For_Record (T : Entity_Id) return Boolean is
5947 function Has_Components (T1 : Entity_Id) return Boolean;
5948 -- Determine if given type has components (i.e. is either a record
5949 -- type or a type that has discriminants).
5951 --------------------
5952 -- Has_Components --
5953 --------------------
5955 function Has_Components (T1 : Entity_Id) return Boolean is
5957 return Is_Record_Type (T1)
5958 or else (Is_Private_Type (T1) and then Has_Discriminants (T1))
5959 or else (Is_Task_Type (T1) and then Has_Discriminants (T1))
5960 or else (Is_Incomplete_Type (T1)
5961 and then From_With_Type (T1)
5962 and then Present (Non_Limited_View (T1))
5963 and then Is_Record_Type
5964 (Get_Full_View (Non_Limited_View (T1))));
5967 -- Start of processing for Is_Appropriate_For_Record
5972 and then (Has_Components (T)
5973 or else (Is_Access_Type (T)
5974 and then Has_Components (Designated_Type (T))));
5975 end Is_Appropriate_For_Record;
5977 ------------------------
5978 -- Note_Redundant_Use --
5979 ------------------------
5981 procedure Note_Redundant_Use (Clause : Node_Id) is
5982 Pack_Name : constant Entity_Id := Entity (Clause);
5983 Cur_Use : constant Node_Id := Current_Use_Clause (Pack_Name);
5984 Decl : constant Node_Id := Parent (Clause);
5986 Prev_Use : Node_Id := Empty;
5987 Redundant : Node_Id := Empty;
5988 -- The Use_Clause which is actually redundant. In the simplest case
5989 -- it is Pack itself, but when we compile a body we install its
5990 -- context before that of its spec, in which case it is the use_clause
5991 -- in the spec that will appear to be redundant, and we want the
5992 -- warning to be placed on the body. Similar complications appear when
5993 -- the redundancy is between a child unit and one of its ancestors.
5996 Set_Redundant_Use (Clause, True);
5998 if not Comes_From_Source (Clause)
6000 or else not Warn_On_Redundant_Constructs
6005 if not Is_Compilation_Unit (Current_Scope) then
6007 -- If the use_clause is in an inner scope, it is made redundant
6008 -- by some clause in the current context, with one exception:
6009 -- If we're compiling a nested package body, and the use_clause
6010 -- comes from the corresponding spec, the clause is not necessarily
6011 -- fully redundant, so we should not warn. If a warning was
6012 -- warranted, it would have been given when the spec was processed.
6014 if Nkind (Parent (Decl)) = N_Package_Specification then
6016 Package_Spec_Entity : constant Entity_Id :=
6017 Defining_Unit_Name (Parent (Decl));
6019 if In_Package_Body (Package_Spec_Entity) then
6025 Redundant := Clause;
6026 Prev_Use := Cur_Use;
6028 elsif Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Body then
6030 Cur_Unit : constant Unit_Number_Type := Get_Source_Unit (Cur_Use);
6031 New_Unit : constant Unit_Number_Type := Get_Source_Unit (Clause);
6035 if Cur_Unit = New_Unit then
6037 -- Redundant clause in same body
6039 Redundant := Clause;
6040 Prev_Use := Cur_Use;
6042 elsif Cur_Unit = Current_Sem_Unit then
6044 -- If the new clause is not in the current unit it has been
6045 -- analyzed first, and it makes the other one redundant.
6046 -- However, if the new clause appears in a subunit, Cur_Unit
6047 -- is still the parent, and in that case the redundant one
6048 -- is the one appearing in the subunit.
6050 if Nkind (Unit (Cunit (New_Unit))) = N_Subunit then
6051 Redundant := Clause;
6052 Prev_Use := Cur_Use;
6054 -- Most common case: redundant clause in body,
6055 -- original clause in spec. Current scope is spec entity.
6060 Unit (Library_Unit (Cunit (Current_Sem_Unit))))
6062 Redundant := Cur_Use;
6066 -- The new clause may appear in an unrelated unit, when
6067 -- the parents of a generic are being installed prior to
6068 -- instantiation. In this case there must be no warning.
6069 -- We detect this case by checking whether the current top
6070 -- of the stack is related to the current compilation.
6072 Scop := Current_Scope;
6073 while Present (Scop)
6074 and then Scop /= Standard_Standard
6076 if Is_Compilation_Unit (Scop)
6077 and then not Is_Child_Unit (Scop)
6081 elsif Scop = Cunit_Entity (Current_Sem_Unit) then
6085 Scop := Scope (Scop);
6088 Redundant := Cur_Use;
6092 elsif New_Unit = Current_Sem_Unit then
6093 Redundant := Clause;
6094 Prev_Use := Cur_Use;
6097 -- Neither is the current unit, so they appear in parent or
6098 -- sibling units. Warning will be emitted elsewhere.
6104 elsif Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Declaration
6105 and then Present (Parent_Spec (Unit (Cunit (Current_Sem_Unit))))
6107 -- Use_clause is in child unit of current unit, and the child
6108 -- unit appears in the context of the body of the parent, so it
6109 -- has been installed first, even though it is the redundant one.
6110 -- Depending on their placement in the context, the visible or the
6111 -- private parts of the two units, either might appear as redundant,
6112 -- but the message has to be on the current unit.
6114 if Get_Source_Unit (Cur_Use) = Current_Sem_Unit then
6115 Redundant := Cur_Use;
6118 Redundant := Clause;
6119 Prev_Use := Cur_Use;
6122 -- If the new use clause appears in the private part of a parent unit
6123 -- it may appear to be redundant w.r.t. a use clause in a child unit,
6124 -- but the previous use clause was needed in the visible part of the
6125 -- child, and no warning should be emitted.
6127 if Nkind (Parent (Decl)) = N_Package_Specification
6129 List_Containing (Decl) = Private_Declarations (Parent (Decl))
6132 Par : constant Entity_Id := Defining_Entity (Parent (Decl));
6133 Spec : constant Node_Id :=
6134 Specification (Unit (Cunit (Current_Sem_Unit)));
6137 if Is_Compilation_Unit (Par)
6138 and then Par /= Cunit_Entity (Current_Sem_Unit)
6139 and then Parent (Cur_Use) = Spec
6141 List_Containing (Cur_Use) = Visible_Declarations (Spec)
6152 if Present (Redundant) then
6153 Error_Msg_Sloc := Sloc (Prev_Use);
6155 ("& is already use-visible through previous use clause #?",
6156 Redundant, Pack_Name);
6158 end Note_Redundant_Use;
6164 procedure Pop_Scope is
6165 SST : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last);
6168 if Debug_Flag_E then
6172 Scope_Suppress := SST.Save_Scope_Suppress;
6173 Local_Suppress_Stack_Top := SST.Save_Local_Suppress_Stack_Top;
6174 Check_Policy_List := SST.Save_Check_Policy_List;
6176 if Debug_Flag_W then
6177 Write_Str ("--> exiting scope: ");
6178 Write_Name (Chars (Current_Scope));
6179 Write_Str (", Depth=");
6180 Write_Int (Int (Scope_Stack.Last));
6184 End_Use_Clauses (SST.First_Use_Clause);
6186 -- If the actions to be wrapped are still there they will get lost
6187 -- causing incomplete code to be generated. It is better to abort in
6188 -- this case (and we do the abort even with assertions off since the
6189 -- penalty is incorrect code generation)
6191 if SST.Actions_To_Be_Wrapped_Before /= No_List
6193 SST.Actions_To_Be_Wrapped_After /= No_List
6198 -- Free last subprogram name if allocated, and pop scope
6200 Free (SST.Last_Subprogram_Name);
6201 Scope_Stack.Decrement_Last;
6208 procedure Push_Scope (S : Entity_Id) is
6212 if Ekind (S) = E_Void then
6215 -- Set scope depth if not a non-concurrent type, and we have not
6216 -- yet set the scope depth. This means that we have the first
6217 -- occurrence of the scope, and this is where the depth is set.
6219 elsif (not Is_Type (S) or else Is_Concurrent_Type (S))
6220 and then not Scope_Depth_Set (S)
6222 if S = Standard_Standard then
6223 Set_Scope_Depth_Value (S, Uint_0);
6225 elsif Is_Child_Unit (S) then
6226 Set_Scope_Depth_Value (S, Uint_1);
6228 elsif not Is_Record_Type (Current_Scope) then
6229 if Ekind (S) = E_Loop then
6230 Set_Scope_Depth_Value (S, Scope_Depth (Current_Scope));
6232 Set_Scope_Depth_Value (S, Scope_Depth (Current_Scope) + 1);
6237 Scope_Stack.Increment_Last;
6240 SST : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last);
6244 SST.Save_Scope_Suppress := Scope_Suppress;
6245 SST.Save_Local_Suppress_Stack_Top := Local_Suppress_Stack_Top;
6246 SST.Save_Check_Policy_List := Check_Policy_List;
6248 if Scope_Stack.Last > Scope_Stack.First then
6249 SST.Component_Alignment_Default := Scope_Stack.Table
6250 (Scope_Stack.Last - 1).
6251 Component_Alignment_Default;
6254 SST.Last_Subprogram_Name := null;
6255 SST.Is_Transient := False;
6256 SST.Node_To_Be_Wrapped := Empty;
6257 SST.Pending_Freeze_Actions := No_List;
6258 SST.Actions_To_Be_Wrapped_Before := No_List;
6259 SST.Actions_To_Be_Wrapped_After := No_List;
6260 SST.First_Use_Clause := Empty;
6261 SST.Is_Active_Stack_Base := False;
6262 SST.Previous_Visibility := False;
6265 if Debug_Flag_W then
6266 Write_Str ("--> new scope: ");
6267 Write_Name (Chars (Current_Scope));
6268 Write_Str (", Id=");
6269 Write_Int (Int (Current_Scope));
6270 Write_Str (", Depth=");
6271 Write_Int (Int (Scope_Stack.Last));
6275 -- Deal with copying flags from the previous scope to this one. This
6276 -- is not necessary if either scope is standard, or if the new scope
6279 if S /= Standard_Standard
6280 and then Scope (S) /= Standard_Standard
6281 and then not Is_Child_Unit (S)
6285 if Nkind (E) not in N_Entity then
6289 -- Copy categorization flags from Scope (S) to S, this is not done
6290 -- when Scope (S) is Standard_Standard since propagation is from
6291 -- library unit entity inwards. Copy other relevant attributes as
6292 -- well (Discard_Names in particular).
6294 -- We only propagate inwards for library level entities,
6295 -- inner level subprograms do not inherit the categorization.
6297 if Is_Library_Level_Entity (S) then
6298 Set_Is_Preelaborated (S, Is_Preelaborated (E));
6299 Set_Is_Shared_Passive (S, Is_Shared_Passive (E));
6300 Set_Discard_Names (S, Discard_Names (E));
6301 Set_Suppress_Value_Tracking_On_Call
6302 (S, Suppress_Value_Tracking_On_Call (E));
6303 Set_Categorization_From_Scope (E => S, Scop => E);
6308 ---------------------
6309 -- Premature_Usage --
6310 ---------------------
6312 procedure Premature_Usage (N : Node_Id) is
6313 Kind : constant Node_Kind := Nkind (Parent (Entity (N)));
6314 E : Entity_Id := Entity (N);
6317 -- Within an instance, the analysis of the actual for a formal object
6318 -- does not see the name of the object itself. This is significant only
6319 -- if the object is an aggregate, where its analysis does not do any
6320 -- name resolution on component associations. (see 4717-008). In such a
6321 -- case, look for the visible homonym on the chain.
6324 and then Present (Homonym (E))
6329 and then not In_Open_Scopes (Scope (E))
6336 Set_Etype (N, Etype (E));
6341 if Kind = N_Component_Declaration then
6343 ("component&! cannot be used before end of record declaration", N);
6345 elsif Kind = N_Parameter_Specification then
6347 ("formal parameter&! cannot be used before end of specification",
6350 elsif Kind = N_Discriminant_Specification then
6352 ("discriminant&! cannot be used before end of discriminant part",
6355 elsif Kind = N_Procedure_Specification
6356 or else Kind = N_Function_Specification
6359 ("subprogram&! cannot be used before end of its declaration",
6362 elsif Kind = N_Full_Type_Declaration then
6364 ("type& cannot be used before end of its declaration!", N);
6368 ("object& cannot be used before end of its declaration!", N);
6370 end Premature_Usage;
6372 ------------------------
6373 -- Present_System_Aux --
6374 ------------------------
6376 function Present_System_Aux (N : Node_Id := Empty) return Boolean is
6378 Aux_Name : Unit_Name_Type;
6379 Unum : Unit_Number_Type;
6384 function Find_System (C_Unit : Node_Id) return Entity_Id;
6385 -- Scan context clause of compilation unit to find with_clause
6392 function Find_System (C_Unit : Node_Id) return Entity_Id is
6393 With_Clause : Node_Id;
6396 With_Clause := First (Context_Items (C_Unit));
6397 while Present (With_Clause) loop
6398 if (Nkind (With_Clause) = N_With_Clause
6399 and then Chars (Name (With_Clause)) = Name_System)
6400 and then Comes_From_Source (With_Clause)
6411 -- Start of processing for Present_System_Aux
6414 -- The child unit may have been loaded and analyzed already
6416 if Present (System_Aux_Id) then
6419 -- If no previous pragma for System.Aux, nothing to load
6421 elsif No (System_Extend_Unit) then
6424 -- Use the unit name given in the pragma to retrieve the unit.
6425 -- Verify that System itself appears in the context clause of the
6426 -- current compilation. If System is not present, an error will
6427 -- have been reported already.
6430 With_Sys := Find_System (Cunit (Current_Sem_Unit));
6432 The_Unit := Unit (Cunit (Current_Sem_Unit));
6436 (Nkind (The_Unit) = N_Package_Body
6437 or else (Nkind (The_Unit) = N_Subprogram_Body
6439 not Acts_As_Spec (Cunit (Current_Sem_Unit))))
6441 With_Sys := Find_System (Library_Unit (Cunit (Current_Sem_Unit)));
6445 and then Present (N)
6447 -- If we are compiling a subunit, we need to examine its
6448 -- context as well (Current_Sem_Unit is the parent unit);
6450 The_Unit := Parent (N);
6451 while Nkind (The_Unit) /= N_Compilation_Unit loop
6452 The_Unit := Parent (The_Unit);
6455 if Nkind (Unit (The_Unit)) = N_Subunit then
6456 With_Sys := Find_System (The_Unit);
6460 if No (With_Sys) then
6464 Loc := Sloc (With_Sys);
6465 Get_Name_String (Chars (Expression (System_Extend_Unit)));
6466 Name_Buffer (8 .. Name_Len + 7) := Name_Buffer (1 .. Name_Len);
6467 Name_Buffer (1 .. 7) := "system.";
6468 Name_Buffer (Name_Len + 8) := '%';
6469 Name_Buffer (Name_Len + 9) := 's';
6470 Name_Len := Name_Len + 9;
6471 Aux_Name := Name_Find;
6475 (Load_Name => Aux_Name,
6478 Error_Node => With_Sys);
6480 if Unum /= No_Unit then
6481 Semantics (Cunit (Unum));
6483 Defining_Entity (Specification (Unit (Cunit (Unum))));
6486 Make_With_Clause (Loc,
6488 Make_Expanded_Name (Loc,
6489 Chars => Chars (System_Aux_Id),
6490 Prefix => New_Reference_To (Scope (System_Aux_Id), Loc),
6491 Selector_Name => New_Reference_To (System_Aux_Id, Loc)));
6493 Set_Entity (Name (Withn), System_Aux_Id);
6495 Set_Library_Unit (Withn, Cunit (Unum));
6496 Set_Corresponding_Spec (Withn, System_Aux_Id);
6497 Set_First_Name (Withn, True);
6498 Set_Implicit_With (Withn, True);
6500 Insert_After (With_Sys, Withn);
6501 Mark_Rewrite_Insertion (Withn);
6502 Set_Context_Installed (Withn);
6506 -- Here if unit load failed
6509 Error_Msg_Name_1 := Name_System;
6510 Error_Msg_Name_2 := Chars (Expression (System_Extend_Unit));
6512 ("extension package `%.%` does not exist",
6513 Opt.System_Extend_Unit);
6517 end Present_System_Aux;
6519 -------------------------
6520 -- Restore_Scope_Stack --
6521 -------------------------
6523 procedure Restore_Scope_Stack (Handle_Use : Boolean := True) is
6526 Comp_Unit : Node_Id;
6527 In_Child : Boolean := False;
6528 Full_Vis : Boolean := True;
6529 SS_Last : constant Int := Scope_Stack.Last;
6532 -- Restore visibility of previous scope stack, if any
6534 for J in reverse 0 .. Scope_Stack.Last loop
6535 exit when Scope_Stack.Table (J).Entity = Standard_Standard
6536 or else No (Scope_Stack.Table (J).Entity);
6538 S := Scope_Stack.Table (J).Entity;
6540 if not Is_Hidden_Open_Scope (S) then
6542 -- If the parent scope is hidden, its entities are hidden as
6543 -- well, unless the entity is the instantiation currently
6546 if not Is_Hidden_Open_Scope (Scope (S))
6547 or else not Analyzed (Parent (S))
6548 or else Scope (S) = Standard_Standard
6550 Set_Is_Immediately_Visible (S, True);
6553 E := First_Entity (S);
6554 while Present (E) loop
6555 if Is_Child_Unit (E) then
6556 Set_Is_Immediately_Visible (E,
6557 Is_Visible_Child_Unit (E) or else In_Open_Scopes (E));
6559 Set_Is_Immediately_Visible (E, True);
6564 if not Full_Vis then
6565 exit when E = First_Private_Entity (S);
6569 -- The visibility of child units (siblings of current compilation)
6570 -- must be restored in any case. Their declarations may appear
6571 -- after the private part of the parent.
6573 if not Full_Vis then
6574 while Present (E) loop
6575 if Is_Child_Unit (E) then
6576 Set_Is_Immediately_Visible (E,
6577 Is_Visible_Child_Unit (E) or else In_Open_Scopes (E));
6585 if Is_Child_Unit (S)
6586 and not In_Child -- check only for current unit
6590 -- Restore visibility of parents according to whether the child
6591 -- is private and whether we are in its visible part.
6593 Comp_Unit := Parent (Unit_Declaration_Node (S));
6595 if Nkind (Comp_Unit) = N_Compilation_Unit
6596 and then Private_Present (Comp_Unit)
6600 elsif (Ekind (S) = E_Package
6601 or else Ekind (S) = E_Generic_Package)
6602 and then (In_Private_Part (S)
6603 or else In_Package_Body (S))
6607 -- if S is the scope of some instance (which has already been
6608 -- seen on the stack) it does not affect the visibility of
6611 elsif Is_Hidden_Open_Scope (S) then
6614 elsif (Ekind (S) = E_Procedure
6615 or else Ekind (S) = E_Function)
6616 and then Has_Completion (S)
6627 if SS_Last >= Scope_Stack.First
6628 and then Scope_Stack.Table (SS_Last).Entity /= Standard_Standard
6631 Install_Use_Clauses (Scope_Stack.Table (SS_Last).First_Use_Clause);
6633 end Restore_Scope_Stack;
6635 ----------------------
6636 -- Save_Scope_Stack --
6637 ----------------------
6639 procedure Save_Scope_Stack (Handle_Use : Boolean := True) is
6642 SS_Last : constant Int := Scope_Stack.Last;
6645 if SS_Last >= Scope_Stack.First
6646 and then Scope_Stack.Table (SS_Last).Entity /= Standard_Standard
6649 End_Use_Clauses (Scope_Stack.Table (SS_Last).First_Use_Clause);
6652 -- If the call is from within a compilation unit, as when called from
6653 -- Rtsfind, make current entries in scope stack invisible while we
6654 -- analyze the new unit.
6656 for J in reverse 0 .. SS_Last loop
6657 exit when Scope_Stack.Table (J).Entity = Standard_Standard
6658 or else No (Scope_Stack.Table (J).Entity);
6660 S := Scope_Stack.Table (J).Entity;
6661 Set_Is_Immediately_Visible (S, False);
6663 E := First_Entity (S);
6664 while Present (E) loop
6665 Set_Is_Immediately_Visible (E, False);
6671 end Save_Scope_Stack;
6677 procedure Set_Use (L : List_Id) is
6679 Pack_Name : Node_Id;
6686 while Present (Decl) loop
6687 if Nkind (Decl) = N_Use_Package_Clause then
6688 Chain_Use_Clause (Decl);
6690 Pack_Name := First (Names (Decl));
6691 while Present (Pack_Name) loop
6692 Pack := Entity (Pack_Name);
6694 if Ekind (Pack) = E_Package
6695 and then Applicable_Use (Pack_Name)
6697 Use_One_Package (Pack, Decl);
6703 elsif Nkind (Decl) = N_Use_Type_Clause then
6704 Chain_Use_Clause (Decl);
6706 Id := First (Subtype_Marks (Decl));
6707 while Present (Id) loop
6708 if Entity (Id) /= Any_Type then
6721 ---------------------
6722 -- Use_One_Package --
6723 ---------------------
6725 procedure Use_One_Package (P : Entity_Id; N : Node_Id) is
6728 Current_Instance : Entity_Id := Empty;
6730 Private_With_OK : Boolean := False;
6733 if Ekind (P) /= E_Package then
6738 Set_Current_Use_Clause (P, N);
6740 -- Ada 2005 (AI-50217): Check restriction
6742 if From_With_Type (P) then
6743 Error_Msg_N ("limited withed package cannot appear in use clause", N);
6746 -- Find enclosing instance, if any
6749 Current_Instance := Current_Scope;
6750 while not Is_Generic_Instance (Current_Instance) loop
6751 Current_Instance := Scope (Current_Instance);
6754 if No (Hidden_By_Use_Clause (N)) then
6755 Set_Hidden_By_Use_Clause (N, New_Elmt_List);
6759 -- If unit is a package renaming, indicate that the renamed
6760 -- package is also in use (the flags on both entities must
6761 -- remain consistent, and a subsequent use of either of them
6762 -- should be recognized as redundant).
6764 if Present (Renamed_Object (P)) then
6765 Set_In_Use (Renamed_Object (P));
6766 Set_Current_Use_Clause (Renamed_Object (P), N);
6767 Real_P := Renamed_Object (P);
6772 -- Ada 2005 (AI-262): Check the use_clause of a private withed package
6773 -- found in the private part of a package specification
6775 if In_Private_Part (Current_Scope)
6776 and then Has_Private_With (P)
6777 and then Is_Child_Unit (Current_Scope)
6778 and then Is_Child_Unit (P)
6779 and then Is_Ancestor_Package (Scope (Current_Scope), P)
6781 Private_With_OK := True;
6784 -- Loop through entities in one package making them potentially
6787 Id := First_Entity (P);
6789 and then (Id /= First_Private_Entity (P)
6790 or else Private_With_OK) -- Ada 2005 (AI-262)
6792 Prev := Current_Entity (Id);
6793 while Present (Prev) loop
6794 if Is_Immediately_Visible (Prev)
6795 and then (not Is_Overloadable (Prev)
6796 or else not Is_Overloadable (Id)
6797 or else (Type_Conformant (Id, Prev)))
6799 if No (Current_Instance) then
6801 -- Potentially use-visible entity remains hidden
6803 goto Next_Usable_Entity;
6805 -- A use clause within an instance hides outer global entities,
6806 -- which are not used to resolve local entities in the
6807 -- instance. Note that the predefined entities in Standard
6808 -- could not have been hidden in the generic by a use clause,
6809 -- and therefore remain visible. Other compilation units whose
6810 -- entities appear in Standard must be hidden in an instance.
6812 -- To determine whether an entity is external to the instance
6813 -- we compare the scope depth of its scope with that of the
6814 -- current instance. However, a generic actual of a subprogram
6815 -- instance is declared in the wrapper package but will not be
6816 -- hidden by a use-visible entity.
6818 -- If Id is called Standard, the predefined package with the
6819 -- same name is in the homonym chain. It has to be ignored
6820 -- because it has no defined scope (being the only entity in
6821 -- the system with this mandated behavior).
6823 elsif not Is_Hidden (Id)
6824 and then Present (Scope (Prev))
6825 and then not Is_Wrapper_Package (Scope (Prev))
6826 and then Scope_Depth (Scope (Prev)) <
6827 Scope_Depth (Current_Instance)
6828 and then (Scope (Prev) /= Standard_Standard
6829 or else Sloc (Prev) > Standard_Location)
6831 Set_Is_Potentially_Use_Visible (Id);
6832 Set_Is_Immediately_Visible (Prev, False);
6833 Append_Elmt (Prev, Hidden_By_Use_Clause (N));
6836 -- A user-defined operator is not use-visible if the predefined
6837 -- operator for the type is immediately visible, which is the case
6838 -- if the type of the operand is in an open scope. This does not
6839 -- apply to user-defined operators that have operands of different
6840 -- types, because the predefined mixed mode operations (multiply
6841 -- and divide) apply to universal types and do not hide anything.
6843 elsif Ekind (Prev) = E_Operator
6844 and then Operator_Matches_Spec (Prev, Id)
6845 and then In_Open_Scopes
6846 (Scope (Base_Type (Etype (First_Formal (Id)))))
6847 and then (No (Next_Formal (First_Formal (Id)))
6848 or else Etype (First_Formal (Id))
6849 = Etype (Next_Formal (First_Formal (Id)))
6850 or else Chars (Prev) = Name_Op_Expon)
6852 goto Next_Usable_Entity;
6855 Prev := Homonym (Prev);
6858 -- On exit, we know entity is not hidden, unless it is private
6860 if not Is_Hidden (Id)
6861 and then ((not Is_Child_Unit (Id))
6862 or else Is_Visible_Child_Unit (Id))
6864 Set_Is_Potentially_Use_Visible (Id);
6866 if Is_Private_Type (Id)
6867 and then Present (Full_View (Id))
6869 Set_Is_Potentially_Use_Visible (Full_View (Id));
6873 <<Next_Usable_Entity>>
6877 -- Child units are also made use-visible by a use clause, but they may
6878 -- appear after all visible declarations in the parent entity list.
6880 while Present (Id) loop
6881 if Is_Child_Unit (Id)
6882 and then Is_Visible_Child_Unit (Id)
6884 Set_Is_Potentially_Use_Visible (Id);
6890 if Chars (Real_P) = Name_System
6891 and then Scope (Real_P) = Standard_Standard
6892 and then Present_System_Aux (N)
6894 Use_One_Package (System_Aux_Id, N);
6897 end Use_One_Package;
6903 procedure Use_One_Type (Id : Node_Id) is
6905 Is_Known_Used : Boolean;
6909 function Spec_Reloaded_For_Body return Boolean;
6910 -- Determine whether the compilation unit is a package body and the use
6911 -- type clause is in the spec of the same package. Even though the spec
6912 -- was analyzed first, its context is reloaded when analysing the body.
6914 ----------------------------
6915 -- Spec_Reloaded_For_Body --
6916 ----------------------------
6918 function Spec_Reloaded_For_Body return Boolean is
6920 if Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Body then
6922 Spec : constant Node_Id :=
6923 Parent (List_Containing (Parent (Id)));
6926 Nkind (Spec) = N_Package_Specification
6927 and then Corresponding_Body (Parent (Spec)) =
6928 Cunit_Entity (Current_Sem_Unit);
6933 end Spec_Reloaded_For_Body;
6935 -- Start of processing for Use_One_Type;
6938 -- It is the type determined by the subtype mark (8.4(8)) whose
6939 -- operations become potentially use-visible.
6941 T := Base_Type (Entity (Id));
6943 -- Either the type itself is used, the package where it is declared
6944 -- is in use or the entity is declared in the current package, thus
6949 or else In_Use (Scope (T))
6950 or else Scope (T) = Current_Scope;
6952 Set_Redundant_Use (Id,
6953 Is_Known_Used or else Is_Potentially_Use_Visible (T));
6955 if In_Open_Scopes (Scope (T)) then
6958 -- A limited view cannot appear in a use_type clause. However, an
6959 -- access type whose designated type is limited has the flag but
6960 -- is not itself a limited view unless we only have a limited view
6961 -- of its enclosing package.
6963 elsif From_With_Type (T)
6964 and then From_With_Type (Scope (T))
6967 ("incomplete type from limited view "
6968 & "cannot appear in use clause", Id);
6970 -- If the subtype mark designates a subtype in a different package,
6971 -- we have to check that the parent type is visible, otherwise the
6972 -- use type clause is a noop. Not clear how to do that???
6974 elsif not Redundant_Use (Id) then
6976 Set_Current_Use_Clause (T, Parent (Id));
6977 Op_List := Collect_Primitive_Operations (T);
6979 Elmt := First_Elmt (Op_List);
6980 while Present (Elmt) loop
6981 if (Nkind (Node (Elmt)) = N_Defining_Operator_Symbol
6982 or else Chars (Node (Elmt)) in Any_Operator_Name)
6983 and then not Is_Hidden (Node (Elmt))
6985 Set_Is_Potentially_Use_Visible (Node (Elmt));
6992 -- If warning on redundant constructs, check for unnecessary WITH
6994 if Warn_On_Redundant_Constructs
6995 and then Is_Known_Used
6997 -- with P; with P; use P;
6998 -- package P is package X is package body X is
6999 -- type T ... use P.T;
7001 -- The compilation unit is the body of X. GNAT first compiles the
7002 -- spec of X, then proceeds to the body. At that point P is marked
7003 -- as use visible. The analysis then reinstalls the spec along with
7004 -- its context. The use clause P.T is now recognized as redundant,
7005 -- but in the wrong context. Do not emit a warning in such cases.
7007 and then not Spec_Reloaded_For_Body
7009 -- The type already has a use clause
7012 if Present (Current_Use_Clause (T)) then
7014 Clause1 : constant Node_Id := Parent (Id);
7015 Clause2 : constant Node_Id := Current_Use_Clause (T);
7021 if Nkind (Parent (Clause1)) = N_Compilation_Unit
7022 and then Nkind (Parent (Clause2)) = N_Compilation_Unit
7024 -- There is a redundant use type clause in a child unit.
7025 -- Determine which of the units is more deeply nested.
7027 Unit1 := Defining_Entity (Unit (Parent (Clause1)));
7028 Unit2 := Defining_Entity (Unit (Parent (Clause2)));
7030 if Scope (Unit2) = Standard_Standard then
7031 Error_Msg_Sloc := Sloc (Current_Use_Clause (T));
7034 elsif Scope (Unit1) = Standard_Standard then
7035 Error_Msg_Sloc := Sloc (Id);
7039 -- Determine which is the descendant unit
7045 S1 := Scope (Unit1);
7046 S2 := Scope (Unit2);
7047 while S1 /= Standard_Standard
7048 and then S2 /= Standard_Standard
7054 if S1 = Standard_Standard then
7055 Error_Msg_Sloc := Sloc (Id);
7058 Error_Msg_Sloc := Sloc (Current_Use_Clause (T));
7065 ("& is already use-visible through previous "
7066 & "use_type_clause #?", Err_No, Id);
7069 ("& is already use-visible through previous use type "
7070 & "clause?", Id, Id);
7075 ("& is already use-visible through previous use type "
7076 & "clause?", Id, Id);
7079 -- The package where T is declared is already used
7081 elsif In_Use (Scope (T)) then
7082 Error_Msg_Sloc := Sloc (Current_Use_Clause (Scope (T)));
7084 ("& is already use-visible through package use clause #?",
7087 -- The current scope is the package where T is declared
7090 Error_Msg_Node_2 := Scope (T);
7092 ("& is already use-visible inside package &?", Id, Id);
7101 procedure Write_Info is
7102 Id : Entity_Id := First_Entity (Current_Scope);
7105 -- No point in dumping standard entities
7107 if Current_Scope = Standard_Standard then
7111 Write_Str ("========================================================");
7113 Write_Str (" Defined Entities in ");
7114 Write_Name (Chars (Current_Scope));
7116 Write_Str ("========================================================");
7120 Write_Str ("-- none --");
7124 while Present (Id) loop
7125 Write_Entity_Info (Id, " ");
7130 if Scope (Current_Scope) = Standard_Standard then
7132 -- Print information on the current unit itself
7134 Write_Entity_Info (Current_Scope, " ");
7144 procedure Write_Scopes is
7147 for J in reverse 1 .. Scope_Stack.Last loop
7148 S := Scope_Stack.Table (J).Entity;
7149 Write_Int (Int (S));
7150 Write_Str (" === ");
7151 Write_Name (Chars (S));
OSDN Git Service
