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
1582 case Attribute_Name (Nam) is
1585 Find_Prim_Op (Prefix_Type, TSS_Stream_Input);
1588 Find_Prim_Op (Prefix_Type, TSS_Stream_Output);
1591 Find_Prim_Op (Prefix_Type, TSS_Stream_Read);
1594 Find_Prim_Op (Prefix_Type, TSS_Stream_Write);
1597 ("attribute must be a primitive"
1598 & " dispatching operation", Nam);
1604 -- If no operation was found, and the type is limited,
1605 -- the user should have defined one.
1607 when Program_Error =>
1608 if Is_Limited_Type (Prefix_Type) then
1610 ("stream operation not defined for type&",
1614 -- Otherwise, compiler should have generated default
1621 -- Rewrite the attribute into the name of its corresponding
1622 -- primitive dispatching subprogram. We can then proceed with
1623 -- the usual processing for subprogram renamings.
1626 Prim_Name : constant Node_Id :=
1627 Make_Identifier (Sloc (Nam),
1628 Chars => Chars (Stream_Prim));
1630 Set_Entity (Prim_Name, Stream_Prim);
1631 Rewrite (Nam, Prim_Name);
1636 -- Normal processing for a renaming of an attribute
1639 Attribute_Renaming (N);
1644 -- Check whether this declaration corresponds to the instantiation
1645 -- of a formal subprogram.
1647 -- If this is an instantiation, the corresponding actual is frozen and
1648 -- error messages can be made more precise. If this is a default
1649 -- subprogram, the entity is already established in the generic, and is
1650 -- not retrieved by visibility. If it is a default with a box, the
1651 -- candidate interpretations, if any, have been collected when building
1652 -- the renaming declaration. If overloaded, the proper interpretation is
1653 -- determined in Find_Renamed_Entity. If the entity is an operator,
1654 -- Find_Renamed_Entity applies additional visibility checks.
1657 Inst_Node := Unit_Declaration_Node (Formal_Spec);
1659 if Is_Entity_Name (Nam)
1660 and then Present (Entity (Nam))
1661 and then not Comes_From_Source (Nam)
1662 and then not Is_Overloaded (Nam)
1664 Old_S := Entity (Nam);
1665 New_S := Analyze_Subprogram_Specification (Spec);
1669 if Ekind (Entity (Nam)) = E_Operator then
1673 if Box_Present (Inst_Node) then
1674 Old_S := Find_Renamed_Entity (N, Name (N), New_S, Is_Actual);
1676 -- If there is an immediately visible homonym of the operator
1677 -- and the declaration has a default, this is worth a warning
1678 -- because the user probably did not intend to get the pre-
1679 -- defined operator, visible in the generic declaration. To
1680 -- find if there is an intended candidate, analyze the renaming
1681 -- again in the current context.
1683 elsif Scope (Old_S) = Standard_Standard
1684 and then Present (Default_Name (Inst_Node))
1687 Decl : constant Node_Id := New_Copy_Tree (N);
1691 Set_Entity (Name (Decl), Empty);
1692 Analyze (Name (Decl));
1694 Find_Renamed_Entity (Decl, Name (Decl), New_S, True);
1697 and then In_Open_Scopes (Scope (Hidden))
1698 and then Is_Immediately_Visible (Hidden)
1699 and then Comes_From_Source (Hidden)
1700 and then Hidden /= Old_S
1702 Error_Msg_Sloc := Sloc (Hidden);
1703 Error_Msg_N ("?default subprogram is resolved " &
1704 "in the generic declaration " &
1705 "(RM 12.6(17))", N);
1706 Error_Msg_NE ("\?and will not use & #", N, Hidden);
1714 New_S := Analyze_Subprogram_Specification (Spec);
1718 -- Renamed entity must be analyzed first, to avoid being hidden by
1719 -- new name (which might be the same in a generic instance).
1723 -- The renaming defines a new overloaded entity, which is analyzed
1724 -- like a subprogram declaration.
1726 New_S := Analyze_Subprogram_Specification (Spec);
1729 if Current_Scope /= Standard_Standard then
1730 Set_Is_Pure (New_S, Is_Pure (Current_Scope));
1733 Rename_Spec := Find_Corresponding_Spec (N);
1735 -- Case of Renaming_As_Body
1737 if Present (Rename_Spec) then
1739 -- Renaming declaration is the completion of the declaration of
1740 -- Rename_Spec. We build an actual body for it at the freezing point.
1742 Set_Corresponding_Spec (N, Rename_Spec);
1744 -- Deal with special case of stream functions of abstract types
1747 if Nkind (Unit_Declaration_Node (Rename_Spec)) =
1748 N_Abstract_Subprogram_Declaration
1750 -- Input stream functions are abstract if the object type is
1751 -- abstract. Similarly, all default stream functions for an
1752 -- interface type are abstract. However, these subprograms may
1753 -- receive explicit declarations in representation clauses, making
1754 -- the attribute subprograms usable as defaults in subsequent
1756 -- In this case we rewrite the declaration to make the subprogram
1757 -- non-abstract. We remove the previous declaration, and insert
1758 -- the new one at the point of the renaming, to prevent premature
1759 -- access to unfrozen types. The new declaration reuses the
1760 -- specification of the previous one, and must not be analyzed.
1763 (Is_Primitive (Entity (Nam))
1765 Is_Abstract_Type (Find_Dispatching_Type (Entity (Nam))));
1767 Old_Decl : constant Node_Id :=
1768 Unit_Declaration_Node (Rename_Spec);
1769 New_Decl : constant Node_Id :=
1770 Make_Subprogram_Declaration (Sloc (N),
1772 Relocate_Node (Specification (Old_Decl)));
1775 Insert_After (N, New_Decl);
1776 Set_Is_Abstract_Subprogram (Rename_Spec, False);
1777 Set_Analyzed (New_Decl);
1781 Set_Corresponding_Body (Unit_Declaration_Node (Rename_Spec), New_S);
1783 if Ada_Version = Ada_83 and then Comes_From_Source (N) then
1784 Error_Msg_N ("(Ada 83) renaming cannot serve as a body", N);
1787 Set_Convention (New_S, Convention (Rename_Spec));
1788 Check_Fully_Conformant (New_S, Rename_Spec);
1789 Set_Public_Status (New_S);
1791 -- The specification does not introduce new formals, but only
1792 -- repeats the formals of the original subprogram declaration.
1793 -- For cross-reference purposes, and for refactoring tools, we
1794 -- treat the formals of the renaming declaration as body formals.
1796 Reference_Body_Formals (Rename_Spec, New_S);
1798 -- Indicate that the entity in the declaration functions like the
1799 -- corresponding body, and is not a new entity. The body will be
1800 -- constructed later at the freeze point, so indicate that the
1801 -- completion has not been seen yet.
1803 Set_Ekind (New_S, E_Subprogram_Body);
1804 New_S := Rename_Spec;
1805 Set_Has_Completion (Rename_Spec, False);
1807 -- Ada 2005: check overriding indicator
1809 if Must_Override (Specification (N))
1810 and then not Is_Overriding_Operation (Rename_Spec)
1812 Error_Msg_NE ("subprogram& is not overriding", N, Rename_Spec);
1814 elsif Must_Not_Override (Specification (N))
1815 and then Is_Overriding_Operation (Rename_Spec)
1818 ("subprogram& overrides inherited operation", N, Rename_Spec);
1821 -- Normal subprogram renaming (not renaming as body)
1824 Generate_Definition (New_S);
1825 New_Overloaded_Entity (New_S);
1827 if Is_Entity_Name (Nam)
1828 and then Is_Intrinsic_Subprogram (Entity (Nam))
1832 Check_Delayed_Subprogram (New_S);
1836 -- There is no need for elaboration checks on the new entity, which may
1837 -- be called before the next freezing point where the body will appear.
1838 -- Elaboration checks refer to the real entity, not the one created by
1839 -- the renaming declaration.
1841 Set_Kill_Elaboration_Checks (New_S, True);
1843 if Etype (Nam) = Any_Type then
1844 Set_Has_Completion (New_S);
1847 elsif Nkind (Nam) = N_Selected_Component then
1849 -- A prefix of the form A.B can designate an entry of task A, a
1850 -- protected operation of protected object A, or finally a primitive
1851 -- operation of object A. In the later case, A is an object of some
1852 -- tagged type, or an access type that denotes one such. To further
1853 -- distinguish these cases, note that the scope of a task entry or
1854 -- protected operation is type of the prefix.
1856 -- The prefix could be an overloaded function call that returns both
1857 -- kinds of operations. This overloading pathology is left to the
1858 -- dedicated reader ???
1861 T : constant Entity_Id := Etype (Prefix (Nam));
1870 Is_Tagged_Type (Designated_Type (T))))
1871 and then Scope (Entity (Selector_Name (Nam))) /= T
1873 Analyze_Renamed_Primitive_Operation
1874 (N, New_S, Present (Rename_Spec));
1878 -- Renamed entity is an entry or protected operation. For those
1879 -- cases an explicit body is built (at the point of freezing of
1880 -- this entity) that contains a call to the renamed entity.
1882 -- This is not allowed for renaming as body if the renamed
1883 -- spec is already frozen (see RM 8.5.4(5) for details).
1885 if Present (Rename_Spec)
1886 and then Is_Frozen (Rename_Spec)
1889 ("renaming-as-body cannot rename entry as subprogram", N);
1891 ("\since & is already frozen (RM 8.5.4(5))",
1894 Analyze_Renamed_Entry (N, New_S, Present (Rename_Spec));
1901 elsif Nkind (Nam) = N_Explicit_Dereference then
1903 -- Renamed entity is designated by access_to_subprogram expression.
1904 -- Must build body to encapsulate call, as in the entry case.
1906 Analyze_Renamed_Dereference (N, New_S, Present (Rename_Spec));
1909 elsif Nkind (Nam) = N_Indexed_Component then
1910 Analyze_Renamed_Family_Member (N, New_S, Present (Rename_Spec));
1913 elsif Nkind (Nam) = N_Character_Literal then
1914 Analyze_Renamed_Character (N, New_S, Present (Rename_Spec));
1917 elsif (not Is_Entity_Name (Nam)
1918 and then Nkind (Nam) /= N_Operator_Symbol)
1919 or else not Is_Overloadable (Entity (Nam))
1921 Error_Msg_N ("expect valid subprogram name in renaming", N);
1925 -- Find the renamed entity that matches the given specification. Disable
1926 -- Ada_83 because there is no requirement of full conformance between
1927 -- renamed entity and new entity, even though the same circuit is used.
1929 -- This is a bit of a kludge, which introduces a really irregular use of
1930 -- Ada_Version[_Explicit]. Would be nice to find cleaner way to do this
1933 Ada_Version := Ada_Version_Type'Max (Ada_Version, Ada_95);
1934 Ada_Version_Explicit := Ada_Version;
1937 Old_S := Find_Renamed_Entity (N, Name (N), New_S, Is_Actual);
1939 -- When the renamed subprogram is overloaded and used as an actual
1940 -- of a generic, its entity is set to the first available homonym.
1941 -- We must first disambiguate the name, then set the proper entity.
1944 and then Is_Overloaded (Nam)
1946 Set_Entity (Nam, Old_S);
1950 -- Most common case: subprogram renames subprogram. No body is generated
1951 -- in this case, so we must indicate the declaration is complete as is.
1953 if No (Rename_Spec) then
1954 Set_Has_Completion (New_S);
1955 Set_Is_Pure (New_S, Is_Pure (Entity (Nam)));
1956 Set_Is_Preelaborated (New_S, Is_Preelaborated (Entity (Nam)));
1958 -- Ada 2005 (AI-423): Check the consistency of null exclusions
1959 -- between a subprogram and its correct renaming.
1961 -- Note: the Any_Id check is a guard that prevents compiler crashes
1962 -- when performing a null exclusion check between a renaming and a
1963 -- renamed subprogram that has been found to be illegal.
1965 if Ada_Version >= Ada_05
1966 and then Entity (Nam) /= Any_Id
1968 Check_Null_Exclusion
1970 Sub => Entity (Nam));
1973 -- Enforce the Ada 2005 rule that the renamed entity cannot require
1974 -- overriding. The flag Requires_Overriding is set very selectively
1975 -- and misses some other illegal cases. The additional conditions
1976 -- checked below are sufficient but not necessary ???
1978 -- The rule does not apply to the renaming generated for an actual
1979 -- subprogram in an instance.
1984 -- Guard against previous errors, and omit renamings of predefined
1987 elsif Ekind (Old_S) /= E_Function
1988 and then Ekind (Old_S) /= E_Procedure
1992 elsif Requires_Overriding (Old_S)
1994 (Is_Abstract_Subprogram (Old_S)
1995 and then Present (Find_Dispatching_Type (Old_S))
1997 not Is_Abstract_Type (Find_Dispatching_Type (Old_S)))
2000 ("renamed entity cannot be "
2001 & "subprogram that requires overriding (RM 8.5.4 (5.1))", N);
2005 if Old_S /= Any_Id then
2007 and then From_Default (N)
2009 -- This is an implicit reference to the default actual
2011 Generate_Reference (Old_S, Nam, Typ => 'i', Force => True);
2013 Generate_Reference (Old_S, Nam);
2016 -- For a renaming-as-body, require subtype conformance, but if the
2017 -- declaration being completed has not been frozen, then inherit the
2018 -- convention of the renamed subprogram prior to checking conformance
2019 -- (unless the renaming has an explicit convention established; the
2020 -- rule stated in the RM doesn't seem to address this ???).
2022 if Present (Rename_Spec) then
2023 Generate_Reference (Rename_Spec, Defining_Entity (Spec), 'b');
2024 Style.Check_Identifier (Defining_Entity (Spec), Rename_Spec);
2026 if not Is_Frozen (Rename_Spec) then
2027 if not Has_Convention_Pragma (Rename_Spec) then
2028 Set_Convention (New_S, Convention (Old_S));
2031 if Ekind (Old_S) /= E_Operator then
2032 Check_Mode_Conformant (New_S, Old_S, Spec);
2035 if Original_Subprogram (Old_S) = Rename_Spec then
2036 Error_Msg_N ("unfrozen subprogram cannot rename itself ", N);
2039 Check_Subtype_Conformant (New_S, Old_S, Spec);
2042 Check_Frozen_Renaming (N, Rename_Spec);
2044 -- Check explicitly that renamed entity is not intrinsic, because
2045 -- in in a generic the renamed body is not built. In this case,
2046 -- the renaming_as_body is a completion.
2048 if Inside_A_Generic then
2049 if Is_Frozen (Rename_Spec)
2050 and then Is_Intrinsic_Subprogram (Old_S)
2053 ("subprogram in renaming_as_body cannot be intrinsic",
2057 Set_Has_Completion (Rename_Spec);
2060 elsif Ekind (Old_S) /= E_Operator then
2061 Check_Mode_Conformant (New_S, Old_S);
2064 and then Error_Posted (New_S)
2066 Error_Msg_NE ("invalid actual subprogram: & #!", N, Old_S);
2070 if No (Rename_Spec) then
2072 -- The parameter profile of the new entity is that of the renamed
2073 -- entity: the subtypes given in the specification are irrelevant.
2075 Inherit_Renamed_Profile (New_S, Old_S);
2077 -- A call to the subprogram is transformed into a call to the
2078 -- renamed entity. This is transitive if the renamed entity is
2079 -- itself a renaming.
2081 if Present (Alias (Old_S)) then
2082 Set_Alias (New_S, Alias (Old_S));
2084 Set_Alias (New_S, Old_S);
2087 -- Note that we do not set Is_Intrinsic_Subprogram if we have a
2088 -- renaming as body, since the entity in this case is not an
2089 -- intrinsic (it calls an intrinsic, but we have a real body for
2090 -- this call, and it is in this body that the required intrinsic
2091 -- processing will take place).
2093 -- Also, if this is a renaming of inequality, the renamed operator
2094 -- is intrinsic, but what matters is the corresponding equality
2095 -- operator, which may be user-defined.
2097 Set_Is_Intrinsic_Subprogram
2099 Is_Intrinsic_Subprogram (Old_S)
2101 (Chars (Old_S) /= Name_Op_Ne
2102 or else Ekind (Old_S) = E_Operator
2104 Is_Intrinsic_Subprogram
2105 (Corresponding_Equality (Old_S))));
2107 if Ekind (Alias (New_S)) = E_Operator then
2108 Set_Has_Delayed_Freeze (New_S, False);
2111 -- If the renaming corresponds to an association for an abstract
2112 -- formal subprogram, then various attributes must be set to
2113 -- indicate that the renaming is an abstract dispatching operation
2114 -- with a controlling type.
2116 if Is_Actual and then Is_Abstract_Subprogram (Formal_Spec) then
2118 -- Mark the renaming as abstract here, so Find_Dispatching_Type
2119 -- see it as corresponding to a generic association for a
2120 -- formal abstract subprogram
2122 Set_Is_Abstract_Subprogram (New_S);
2125 New_S_Ctrl_Type : constant Entity_Id :=
2126 Find_Dispatching_Type (New_S);
2127 Old_S_Ctrl_Type : constant Entity_Id :=
2128 Find_Dispatching_Type (Old_S);
2131 if Old_S_Ctrl_Type /= New_S_Ctrl_Type then
2133 ("actual must be dispatching subprogram for type&",
2134 Nam, New_S_Ctrl_Type);
2137 Set_Is_Dispatching_Operation (New_S);
2138 Check_Controlling_Formals (New_S_Ctrl_Type, New_S);
2140 -- If the actual in the formal subprogram is itself a
2141 -- formal abstract subprogram association, there's no
2142 -- dispatch table component or position to inherit.
2144 if Present (DTC_Entity (Old_S)) then
2145 Set_DTC_Entity (New_S, DTC_Entity (Old_S));
2146 Set_DT_Position (New_S, DT_Position (Old_S));
2154 and then (Old_S = New_S
2155 or else (Nkind (Nam) /= N_Expanded_Name
2156 and then Chars (Old_S) = Chars (New_S)))
2158 Error_Msg_N ("subprogram cannot rename itself", N);
2161 Set_Convention (New_S, Convention (Old_S));
2163 if Is_Abstract_Subprogram (Old_S) then
2164 if Present (Rename_Spec) then
2166 ("a renaming-as-body cannot rename an abstract subprogram",
2168 Set_Has_Completion (Rename_Spec);
2170 Set_Is_Abstract_Subprogram (New_S);
2174 Check_Library_Unit_Renaming (N, Old_S);
2176 -- Pathological case: procedure renames entry in the scope of its
2177 -- task. Entry is given by simple name, but body must be built for
2178 -- procedure. Of course if called it will deadlock.
2180 if Ekind (Old_S) = E_Entry then
2181 Set_Has_Completion (New_S, False);
2182 Set_Alias (New_S, Empty);
2186 Freeze_Before (N, Old_S);
2187 Set_Has_Delayed_Freeze (New_S, False);
2188 Freeze_Before (N, New_S);
2190 -- An abstract subprogram is only allowed as an actual in the case
2191 -- where the formal subprogram is also abstract.
2193 if (Ekind (Old_S) = E_Procedure or else Ekind (Old_S) = E_Function)
2194 and then Is_Abstract_Subprogram (Old_S)
2195 and then not Is_Abstract_Subprogram (Formal_Spec)
2198 ("abstract subprogram not allowed as generic actual", Nam);
2203 -- A common error is to assume that implicit operators for types are
2204 -- defined in Standard, or in the scope of a subtype. In those cases
2205 -- where the renamed entity is given with an expanded name, it is
2206 -- worth mentioning that operators for the type are not declared in
2207 -- the scope given by the prefix.
2209 if Nkind (Nam) = N_Expanded_Name
2210 and then Nkind (Selector_Name (Nam)) = N_Operator_Symbol
2211 and then Scope (Entity (Nam)) = Standard_Standard
2214 T : constant Entity_Id :=
2215 Base_Type (Etype (First_Formal (New_S)));
2217 Error_Msg_Node_2 := Prefix (Nam);
2219 ("operator for type& is not declared in&", Prefix (Nam), T);
2224 ("no visible subprogram matches the specification for&",
2228 if Present (Candidate_Renaming) then
2234 F1 := First_Formal (Candidate_Renaming);
2235 F2 := First_Formal (New_S);
2237 while Present (F1) and then Present (F2) loop
2242 if Present (F1) and then Present (Default_Value (F1)) then
2243 if Present (Next_Formal (F1)) then
2245 ("\missing specification for &" &
2246 " and other formals with defaults", Spec, F1);
2249 ("\missing specification for &", Spec, F1);
2256 -- Ada 2005 AI 404: if the new subprogram is dispatching, verify that
2257 -- controlling access parameters are known non-null for the renamed
2258 -- subprogram. Test also applies to a subprogram instantiation that
2259 -- is dispatching. Test is skipped if some previous error was detected
2260 -- that set Old_S to Any_Id.
2262 if Ada_Version >= Ada_05
2263 and then Old_S /= Any_Id
2264 and then not Is_Dispatching_Operation (Old_S)
2265 and then Is_Dispatching_Operation (New_S)
2272 Old_F := First_Formal (Old_S);
2273 New_F := First_Formal (New_S);
2274 while Present (Old_F) loop
2275 if Ekind (Etype (Old_F)) = E_Anonymous_Access_Type
2276 and then Is_Controlling_Formal (New_F)
2277 and then not Can_Never_Be_Null (Old_F)
2279 Error_Msg_N ("access parameter is controlling,", New_F);
2281 ("\corresponding parameter of& "
2282 & "must be explicitly null excluding", New_F, Old_S);
2285 Next_Formal (Old_F);
2286 Next_Formal (New_F);
2291 -- A useful warning, suggested by Ada Bug Finder (Ada-Europe 2005)
2293 if Comes_From_Source (N)
2294 and then Present (Old_S)
2295 and then Nkind (Old_S) = N_Defining_Operator_Symbol
2296 and then Nkind (New_S) = N_Defining_Operator_Symbol
2297 and then Chars (Old_S) /= Chars (New_S)
2300 ("?& is being renamed as a different operator",
2304 -- Another warning or some utility: if the new subprogram as the same
2305 -- name as the old one, the old one is not hidden by an outer homograph,
2306 -- the new one is not a public symbol, and the old one is otherwise
2307 -- directly visible, the renaming is superfluous.
2309 if Chars (Old_S) = Chars (New_S)
2310 and then Comes_From_Source (N)
2311 and then Scope (Old_S) /= Standard_Standard
2312 and then Warn_On_Redundant_Constructs
2314 (Is_Immediately_Visible (Old_S)
2315 or else Is_Potentially_Use_Visible (Old_S))
2316 and then Is_Overloadable (Current_Scope)
2317 and then Chars (Current_Scope) /= Chars (Old_S)
2320 ("?redundant renaming, entity is directly visible", Name (N));
2323 Ada_Version := Save_AV;
2324 Ada_Version_Explicit := Save_AV_Exp;
2325 end Analyze_Subprogram_Renaming;
2327 -------------------------
2328 -- Analyze_Use_Package --
2329 -------------------------
2331 -- Resolve the package names in the use clause, and make all the visible
2332 -- entities defined in the package potentially use-visible. If the package
2333 -- is already in use from a previous use clause, its visible entities are
2334 -- already use-visible. In that case, mark the occurrence as a redundant
2335 -- use. If the package is an open scope, i.e. if the use clause occurs
2336 -- within the package itself, ignore it.
2338 procedure Analyze_Use_Package (N : Node_Id) is
2339 Pack_Name : Node_Id;
2342 -- Start of processing for Analyze_Use_Package
2345 Set_Hidden_By_Use_Clause (N, No_Elist);
2347 -- Use clause is not allowed in a spec of a predefined package
2348 -- declaration except that packages whose file name starts a-n are OK
2349 -- (these are children of Ada.Numerics, and such packages are never
2350 -- loaded by Rtsfind).
2352 if Is_Predefined_File_Name (Unit_File_Name (Current_Sem_Unit))
2353 and then Name_Buffer (1 .. 3) /= "a-n"
2355 Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Declaration
2357 Error_Msg_N ("use clause not allowed in predefined spec", N);
2360 -- Chain clause to list of use clauses in current scope
2362 if Nkind (Parent (N)) /= N_Compilation_Unit then
2363 Chain_Use_Clause (N);
2366 -- Loop through package names to identify referenced packages
2368 Pack_Name := First (Names (N));
2369 while Present (Pack_Name) loop
2370 Analyze (Pack_Name);
2372 if Nkind (Parent (N)) = N_Compilation_Unit
2373 and then Nkind (Pack_Name) = N_Expanded_Name
2379 Pref := Prefix (Pack_Name);
2380 while Nkind (Pref) = N_Expanded_Name loop
2381 Pref := Prefix (Pref);
2384 if Entity (Pref) = Standard_Standard then
2386 ("predefined package Standard cannot appear"
2387 & " in a context clause", Pref);
2395 -- Loop through package names to mark all entities as potentially
2398 Pack_Name := First (Names (N));
2399 while Present (Pack_Name) loop
2400 if Is_Entity_Name (Pack_Name) then
2401 Pack := Entity (Pack_Name);
2403 if Ekind (Pack) /= E_Package
2404 and then Etype (Pack) /= Any_Type
2406 if Ekind (Pack) = E_Generic_Package then
2408 ("a generic package is not allowed in a use clause",
2411 Error_Msg_N ("& is not a usable package", Pack_Name);
2415 if Nkind (Parent (N)) = N_Compilation_Unit then
2416 Check_In_Previous_With_Clause (N, Pack_Name);
2419 if Applicable_Use (Pack_Name) then
2420 Use_One_Package (Pack, N);
2424 -- Report error because name denotes something other than a package
2427 Error_Msg_N ("& is not a package", Pack_Name);
2432 end Analyze_Use_Package;
2434 ----------------------
2435 -- Analyze_Use_Type --
2436 ----------------------
2438 procedure Analyze_Use_Type (N : Node_Id) is
2443 Set_Hidden_By_Use_Clause (N, No_Elist);
2445 -- Chain clause to list of use clauses in current scope
2447 if Nkind (Parent (N)) /= N_Compilation_Unit then
2448 Chain_Use_Clause (N);
2451 Id := First (Subtype_Marks (N));
2452 while Present (Id) loop
2456 if E /= Any_Type then
2459 if Nkind (Parent (N)) = N_Compilation_Unit then
2460 if Nkind (Id) = N_Identifier then
2461 Error_Msg_N ("type is not directly visible", Id);
2463 elsif Is_Child_Unit (Scope (E))
2464 and then Scope (E) /= System_Aux_Id
2466 Check_In_Previous_With_Clause (N, Prefix (Id));
2473 end Analyze_Use_Type;
2475 --------------------
2476 -- Applicable_Use --
2477 --------------------
2479 function Applicable_Use (Pack_Name : Node_Id) return Boolean is
2480 Pack : constant Entity_Id := Entity (Pack_Name);
2483 if In_Open_Scopes (Pack) then
2484 if Warn_On_Redundant_Constructs
2485 and then Pack = Current_Scope
2488 ("& is already use-visible within itself?", Pack_Name, Pack);
2493 elsif In_Use (Pack) then
2494 Note_Redundant_Use (Pack_Name);
2497 elsif Present (Renamed_Object (Pack))
2498 and then In_Use (Renamed_Object (Pack))
2500 Note_Redundant_Use (Pack_Name);
2508 ------------------------
2509 -- Attribute_Renaming --
2510 ------------------------
2512 procedure Attribute_Renaming (N : Node_Id) is
2513 Loc : constant Source_Ptr := Sloc (N);
2514 Nam : constant Node_Id := Name (N);
2515 Spec : constant Node_Id := Specification (N);
2516 New_S : constant Entity_Id := Defining_Unit_Name (Spec);
2517 Aname : constant Name_Id := Attribute_Name (Nam);
2519 Form_Num : Nat := 0;
2520 Expr_List : List_Id := No_List;
2522 Attr_Node : Node_Id;
2523 Body_Node : Node_Id;
2524 Param_Spec : Node_Id;
2527 Generate_Definition (New_S);
2529 -- This procedure is called in the context of subprogram renaming,
2530 -- and thus the attribute must be one that is a subprogram. All of
2531 -- those have at least one formal parameter, with the singular
2532 -- exception of AST_Entry (which is a real oddity, it is odd that
2533 -- this can be renamed at all!)
2535 if not Is_Non_Empty_List (Parameter_Specifications (Spec)) then
2536 if Aname /= Name_AST_Entry then
2538 ("subprogram renaming an attribute must have formals", N);
2543 Param_Spec := First (Parameter_Specifications (Spec));
2544 while Present (Param_Spec) loop
2545 Form_Num := Form_Num + 1;
2547 if Nkind (Parameter_Type (Param_Spec)) /= N_Access_Definition then
2548 Find_Type (Parameter_Type (Param_Spec));
2550 -- The profile of the new entity denotes the base type (s) of
2551 -- the types given in the specification. For access parameters
2552 -- there are no subtypes involved.
2554 Rewrite (Parameter_Type (Param_Spec),
2556 (Base_Type (Entity (Parameter_Type (Param_Spec))), Loc));
2559 if No (Expr_List) then
2560 Expr_List := New_List;
2563 Append_To (Expr_List,
2564 Make_Identifier (Loc,
2565 Chars => Chars (Defining_Identifier (Param_Spec))));
2567 -- The expressions in the attribute reference are not freeze
2568 -- points. Neither is the attribute as a whole, see below.
2570 Set_Must_Not_Freeze (Last (Expr_List));
2575 -- Immediate error if too many formals. Other mismatches in numbers
2576 -- of number of types of parameters are detected when we analyze the
2577 -- body of the subprogram that we construct.
2579 if Form_Num > 2 then
2580 Error_Msg_N ("too many formals for attribute", N);
2582 -- Error if the attribute reference has expressions that look
2583 -- like formal parameters.
2585 elsif Present (Expressions (Nam)) then
2586 Error_Msg_N ("illegal expressions in attribute reference", Nam);
2589 Aname = Name_Compose or else
2590 Aname = Name_Exponent or else
2591 Aname = Name_Leading_Part or else
2592 Aname = Name_Pos or else
2593 Aname = Name_Round or else
2594 Aname = Name_Scaling or else
2597 if Nkind (N) = N_Subprogram_Renaming_Declaration
2598 and then Present (Corresponding_Formal_Spec (N))
2601 ("generic actual cannot be attribute involving universal type",
2605 ("attribute involving a universal type cannot be renamed",
2610 -- AST_Entry is an odd case. It doesn't really make much sense to
2611 -- allow it to be renamed, but that's the DEC rule, so we have to
2612 -- do it right. The point is that the AST_Entry call should be made
2613 -- now, and what the function will return is the returned value.
2615 -- Note that there is no Expr_List in this case anyway
2617 if Aname = Name_AST_Entry then
2623 Ent := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
2626 Make_Object_Declaration (Loc,
2627 Defining_Identifier => Ent,
2628 Object_Definition =>
2629 New_Occurrence_Of (RTE (RE_AST_Handler), Loc),
2631 Constant_Present => True);
2633 Set_Assignment_OK (Decl, True);
2634 Insert_Action (N, Decl);
2635 Attr_Node := Make_Identifier (Loc, Chars (Ent));
2638 -- For all other attributes, we rewrite the attribute node to have
2639 -- a list of expressions corresponding to the subprogram formals.
2640 -- A renaming declaration is not a freeze point, and the analysis of
2641 -- the attribute reference should not freeze the type of the prefix.
2645 Make_Attribute_Reference (Loc,
2646 Prefix => Prefix (Nam),
2647 Attribute_Name => Aname,
2648 Expressions => Expr_List);
2650 Set_Must_Not_Freeze (Attr_Node);
2651 Set_Must_Not_Freeze (Prefix (Nam));
2654 -- Case of renaming a function
2656 if Nkind (Spec) = N_Function_Specification then
2657 if Is_Procedure_Attribute_Name (Aname) then
2658 Error_Msg_N ("attribute can only be renamed as procedure", Nam);
2662 Find_Type (Result_Definition (Spec));
2663 Rewrite (Result_Definition (Spec),
2665 Base_Type (Entity (Result_Definition (Spec))), Loc));
2668 Make_Subprogram_Body (Loc,
2669 Specification => Spec,
2670 Declarations => New_List,
2671 Handled_Statement_Sequence =>
2672 Make_Handled_Sequence_Of_Statements (Loc,
2673 Statements => New_List (
2674 Make_Simple_Return_Statement (Loc,
2675 Expression => Attr_Node))));
2677 -- Case of renaming a procedure
2680 if not Is_Procedure_Attribute_Name (Aname) then
2681 Error_Msg_N ("attribute can only be renamed as function", Nam);
2686 Make_Subprogram_Body (Loc,
2687 Specification => Spec,
2688 Declarations => New_List,
2689 Handled_Statement_Sequence =>
2690 Make_Handled_Sequence_Of_Statements (Loc,
2691 Statements => New_List (Attr_Node)));
2694 -- In case of tagged types we add the body of the generated function to
2695 -- the freezing actions of the type (because in the general case such
2696 -- type is still not frozen). We exclude from this processing generic
2697 -- formal subprograms found in instantiations and AST_Entry renamings.
2699 if not Present (Corresponding_Formal_Spec (N))
2700 and then Etype (Nam) /= RTE (RE_AST_Handler)
2703 P : constant Entity_Id := Prefix (Nam);
2708 if Is_Tagged_Type (Etype (P)) then
2709 Ensure_Freeze_Node (Etype (P));
2710 Append_Freeze_Action (Etype (P), Body_Node);
2712 Rewrite (N, Body_Node);
2714 Set_Etype (New_S, Base_Type (Etype (New_S)));
2718 -- Generic formal subprograms or AST_Handler renaming
2721 Rewrite (N, Body_Node);
2723 Set_Etype (New_S, Base_Type (Etype (New_S)));
2726 if Is_Compilation_Unit (New_S) then
2728 ("a library unit can only rename another library unit", N);
2731 -- We suppress elaboration warnings for the resulting entity, since
2732 -- clearly they are not needed, and more particularly, in the case
2733 -- of a generic formal subprogram, the resulting entity can appear
2734 -- after the instantiation itself, and thus look like a bogus case
2735 -- of access before elaboration.
2737 Set_Suppress_Elaboration_Warnings (New_S);
2739 end Attribute_Renaming;
2741 ----------------------
2742 -- Chain_Use_Clause --
2743 ----------------------
2745 procedure Chain_Use_Clause (N : Node_Id) is
2747 Level : Int := Scope_Stack.Last;
2750 if not Is_Compilation_Unit (Current_Scope)
2751 or else not Is_Child_Unit (Current_Scope)
2753 null; -- Common case
2755 elsif Defining_Entity (Parent (N)) = Current_Scope then
2756 null; -- Common case for compilation unit
2759 -- If declaration appears in some other scope, it must be in some
2760 -- parent unit when compiling a child.
2762 Pack := Defining_Entity (Parent (N));
2763 if not In_Open_Scopes (Pack) then
2764 null; -- default as well
2767 -- Find entry for parent unit in scope stack
2769 while Scope_Stack.Table (Level).Entity /= Pack loop
2775 Set_Next_Use_Clause (N,
2776 Scope_Stack.Table (Level).First_Use_Clause);
2777 Scope_Stack.Table (Level).First_Use_Clause := N;
2778 end Chain_Use_Clause;
2780 ---------------------------
2781 -- Check_Frozen_Renaming --
2782 ---------------------------
2784 procedure Check_Frozen_Renaming (N : Node_Id; Subp : Entity_Id) is
2790 and then not Has_Completion (Subp)
2794 (Parent (Declaration_Node (Subp)), Defining_Entity (N));
2796 if Is_Entity_Name (Name (N)) then
2797 Old_S := Entity (Name (N));
2799 if not Is_Frozen (Old_S)
2800 and then Operating_Mode /= Check_Semantics
2802 Append_Freeze_Action (Old_S, B_Node);
2804 Insert_After (N, B_Node);
2808 if Is_Intrinsic_Subprogram (Old_S)
2809 and then not In_Instance
2812 ("subprogram used in renaming_as_body cannot be intrinsic",
2817 Insert_After (N, B_Node);
2821 end Check_Frozen_Renaming;
2823 -----------------------------------
2824 -- Check_In_Previous_With_Clause --
2825 -----------------------------------
2827 procedure Check_In_Previous_With_Clause
2831 Pack : constant Entity_Id := Entity (Original_Node (Nam));
2836 Item := First (Context_Items (Parent (N)));
2838 while Present (Item)
2841 if Nkind (Item) = N_With_Clause
2843 -- Protect the frontend against previous critical errors
2845 and then Nkind (Name (Item)) /= N_Selected_Component
2846 and then Entity (Name (Item)) = Pack
2850 -- Find root library unit in with_clause
2852 while Nkind (Par) = N_Expanded_Name loop
2853 Par := Prefix (Par);
2856 if Is_Child_Unit (Entity (Original_Node (Par))) then
2858 ("& is not directly visible", Par, Entity (Par));
2867 -- On exit, package is not mentioned in a previous with_clause.
2868 -- Check if its prefix is.
2870 if Nkind (Nam) = N_Expanded_Name then
2871 Check_In_Previous_With_Clause (N, Prefix (Nam));
2873 elsif Pack /= Any_Id then
2874 Error_Msg_NE ("& is not visible", Nam, Pack);
2876 end Check_In_Previous_With_Clause;
2878 ---------------------------------
2879 -- Check_Library_Unit_Renaming --
2880 ---------------------------------
2882 procedure Check_Library_Unit_Renaming (N : Node_Id; Old_E : Entity_Id) is
2886 if Nkind (Parent (N)) /= N_Compilation_Unit then
2889 -- Check for library unit. Note that we used to check for the scope
2890 -- being Standard here, but that was wrong for Standard itself.
2892 elsif not Is_Compilation_Unit (Old_E)
2893 and then not Is_Child_Unit (Old_E)
2895 Error_Msg_N ("renamed unit must be a library unit", Name (N));
2897 -- Entities defined in Standard (operators and boolean literals) cannot
2898 -- be renamed as library units.
2900 elsif Scope (Old_E) = Standard_Standard
2901 and then Sloc (Old_E) = Standard_Location
2903 Error_Msg_N ("renamed unit must be a library unit", Name (N));
2905 elsif Present (Parent_Spec (N))
2906 and then Nkind (Unit (Parent_Spec (N))) = N_Generic_Package_Declaration
2907 and then not Is_Child_Unit (Old_E)
2910 ("renamed unit must be a child unit of generic parent", Name (N));
2912 elsif Nkind (N) in N_Generic_Renaming_Declaration
2913 and then Nkind (Name (N)) = N_Expanded_Name
2914 and then Is_Generic_Instance (Entity (Prefix (Name (N))))
2915 and then Is_Generic_Unit (Old_E)
2918 ("renamed generic unit must be a library unit", Name (N));
2920 elsif Ekind (Old_E) = E_Package
2921 or else Ekind (Old_E) = E_Generic_Package
2923 -- Inherit categorization flags
2925 New_E := Defining_Entity (N);
2926 Set_Is_Pure (New_E, Is_Pure (Old_E));
2927 Set_Is_Preelaborated (New_E, Is_Preelaborated (Old_E));
2928 Set_Is_Remote_Call_Interface (New_E,
2929 Is_Remote_Call_Interface (Old_E));
2930 Set_Is_Remote_Types (New_E, Is_Remote_Types (Old_E));
2931 Set_Is_Shared_Passive (New_E, Is_Shared_Passive (Old_E));
2933 end Check_Library_Unit_Renaming;
2939 procedure End_Scope is
2945 Id := First_Entity (Current_Scope);
2946 while Present (Id) loop
2947 -- An entity in the current scope is not necessarily the first one
2948 -- on its homonym chain. Find its predecessor if any,
2949 -- If it is an internal entity, it will not be in the visibility
2950 -- chain altogether, and there is nothing to unchain.
2952 if Id /= Current_Entity (Id) then
2953 Prev := Current_Entity (Id);
2954 while Present (Prev)
2955 and then Present (Homonym (Prev))
2956 and then Homonym (Prev) /= Id
2958 Prev := Homonym (Prev);
2961 -- Skip to end of loop if Id is not in the visibility chain
2963 if No (Prev) or else Homonym (Prev) /= Id then
2971 Set_Is_Immediately_Visible (Id, False);
2973 Outer := Homonym (Id);
2974 while Present (Outer) and then Scope (Outer) = Current_Scope loop
2975 Outer := Homonym (Outer);
2978 -- Reset homonym link of other entities, but do not modify link
2979 -- between entities in current scope, so that the back-end can have
2980 -- a proper count of local overloadings.
2983 Set_Name_Entity_Id (Chars (Id), Outer);
2985 elsif Scope (Prev) /= Scope (Id) then
2986 Set_Homonym (Prev, Outer);
2993 -- If the scope generated freeze actions, place them before the
2994 -- current declaration and analyze them. Type declarations and
2995 -- the bodies of initialization procedures can generate such nodes.
2996 -- We follow the parent chain until we reach a list node, which is
2997 -- the enclosing list of declarations. If the list appears within
2998 -- a protected definition, move freeze nodes outside the protected
3002 (Scope_Stack.Table (Scope_Stack.Last).Pending_Freeze_Actions)
3006 L : constant List_Id := Scope_Stack.Table
3007 (Scope_Stack.Last).Pending_Freeze_Actions;
3010 if Is_Itype (Current_Scope) then
3011 Decl := Associated_Node_For_Itype (Current_Scope);
3013 Decl := Parent (Current_Scope);
3018 while not (Is_List_Member (Decl))
3019 or else Nkind_In (Parent (Decl), N_Protected_Definition,
3022 Decl := Parent (Decl);
3025 Insert_List_Before_And_Analyze (Decl, L);
3034 ---------------------
3035 -- End_Use_Clauses --
3036 ---------------------
3038 procedure End_Use_Clauses (Clause : Node_Id) is
3042 -- Remove Use_Type clauses first, because they affect the
3043 -- visibility of operators in subsequent used packages.
3046 while Present (U) loop
3047 if Nkind (U) = N_Use_Type_Clause then
3051 Next_Use_Clause (U);
3055 while Present (U) loop
3056 if Nkind (U) = N_Use_Package_Clause then
3057 End_Use_Package (U);
3060 Next_Use_Clause (U);
3062 end End_Use_Clauses;
3064 ---------------------
3065 -- End_Use_Package --
3066 ---------------------
3068 procedure End_Use_Package (N : Node_Id) is
3069 Pack_Name : Node_Id;
3074 function Is_Primitive_Operator
3076 F : Entity_Id) return Boolean;
3077 -- Check whether Op is a primitive operator of a use-visible type
3079 ---------------------------
3080 -- Is_Primitive_Operator --
3081 ---------------------------
3083 function Is_Primitive_Operator
3085 F : Entity_Id) return Boolean
3087 T : constant Entity_Id := Etype (F);
3090 and then Scope (T) = Scope (Op);
3091 end Is_Primitive_Operator;
3093 -- Start of processing for End_Use_Package
3096 Pack_Name := First (Names (N));
3097 while Present (Pack_Name) loop
3099 -- Test that Pack_Name actually denotes a package before processing
3101 if Is_Entity_Name (Pack_Name)
3102 and then Ekind (Entity (Pack_Name)) = E_Package
3104 Pack := Entity (Pack_Name);
3106 if In_Open_Scopes (Pack) then
3109 elsif not Redundant_Use (Pack_Name) then
3110 Set_In_Use (Pack, False);
3111 Set_Current_Use_Clause (Pack, Empty);
3113 Id := First_Entity (Pack);
3114 while Present (Id) loop
3116 -- Preserve use-visibility of operators that are primitive
3117 -- operators of a type that is use-visible through an active
3120 if Nkind (Id) = N_Defining_Operator_Symbol
3122 (Is_Primitive_Operator (Id, First_Formal (Id))
3124 (Present (Next_Formal (First_Formal (Id)))
3126 Is_Primitive_Operator
3127 (Id, Next_Formal (First_Formal (Id)))))
3132 Set_Is_Potentially_Use_Visible (Id, False);
3135 if Is_Private_Type (Id)
3136 and then Present (Full_View (Id))
3138 Set_Is_Potentially_Use_Visible (Full_View (Id), False);
3144 if Present (Renamed_Object (Pack)) then
3145 Set_In_Use (Renamed_Object (Pack), False);
3146 Set_Current_Use_Clause (Renamed_Object (Pack), Empty);
3149 if Chars (Pack) = Name_System
3150 and then Scope (Pack) = Standard_Standard
3151 and then Present_System_Aux
3153 Id := First_Entity (System_Aux_Id);
3154 while Present (Id) loop
3155 Set_Is_Potentially_Use_Visible (Id, False);
3157 if Is_Private_Type (Id)
3158 and then Present (Full_View (Id))
3160 Set_Is_Potentially_Use_Visible (Full_View (Id), False);
3166 Set_In_Use (System_Aux_Id, False);
3170 Set_Redundant_Use (Pack_Name, False);
3177 if Present (Hidden_By_Use_Clause (N)) then
3178 Elmt := First_Elmt (Hidden_By_Use_Clause (N));
3179 while Present (Elmt) loop
3180 Set_Is_Immediately_Visible (Node (Elmt));
3184 Set_Hidden_By_Use_Clause (N, No_Elist);
3186 end End_Use_Package;
3192 procedure End_Use_Type (N : Node_Id) is
3199 Id := First (Subtype_Marks (N));
3200 while Present (Id) loop
3202 -- A call to rtsfind may occur while analyzing a use_type clause,
3203 -- in which case the type marks are not resolved yet, and there is
3204 -- nothing to remove.
3206 if not Is_Entity_Name (Id)
3207 or else No (Entity (Id))
3215 or else From_With_Type (T)
3219 -- Note that the use_Type clause may mention a subtype of the type
3220 -- whose primitive operations have been made visible. Here as
3221 -- elsewhere, it is the base type that matters for visibility.
3223 elsif In_Open_Scopes (Scope (Base_Type (T))) then
3226 elsif not Redundant_Use (Id) then
3227 Set_In_Use (T, False);
3228 Set_In_Use (Base_Type (T), False);
3229 Set_Current_Use_Clause (T, Empty);
3230 Set_Current_Use_Clause (Base_Type (T), Empty);
3231 Op_List := Collect_Primitive_Operations (T);
3233 Elmt := First_Elmt (Op_List);
3234 while Present (Elmt) loop
3235 if Nkind (Node (Elmt)) = N_Defining_Operator_Symbol then
3236 Set_Is_Potentially_Use_Visible (Node (Elmt), False);
3248 ----------------------
3249 -- Find_Direct_Name --
3250 ----------------------
3252 procedure Find_Direct_Name (N : Node_Id) is
3257 Inst : Entity_Id := Empty;
3258 -- Enclosing instance, if any
3260 Homonyms : Entity_Id;
3261 -- Saves start of homonym chain
3263 Nvis_Entity : Boolean;
3264 -- Set True to indicate that at there is at least one entity on the
3265 -- homonym chain which, while not visible, is visible enough from the
3266 -- user point of view to warrant an error message of "not visible"
3267 -- rather than undefined.
3269 Nvis_Is_Private_Subprg : Boolean := False;
3270 -- Ada 2005 (AI-262): Set True to indicate that a form of Beaujolais
3271 -- effect concerning library subprograms has been detected. Used to
3272 -- generate the precise error message.
3274 function From_Actual_Package (E : Entity_Id) return Boolean;
3275 -- Returns true if the entity is declared in a package that is
3276 -- an actual for a formal package of the current instance. Such an
3277 -- entity requires special handling because it may be use-visible
3278 -- but hides directly visible entities defined outside the instance.
3280 function Is_Actual_Parameter return Boolean;
3281 -- This function checks if the node N is an identifier that is an actual
3282 -- parameter of a procedure call. If so it returns True, otherwise it
3283 -- return False. The reason for this check is that at this stage we do
3284 -- not know what procedure is being called if the procedure might be
3285 -- overloaded, so it is premature to go setting referenced flags or
3286 -- making calls to Generate_Reference. We will wait till Resolve_Actuals
3287 -- for that processing
3289 function Known_But_Invisible (E : Entity_Id) return Boolean;
3290 -- This function determines whether the entity E (which is not
3291 -- visible) can reasonably be considered to be known to the writer
3292 -- of the reference. This is a heuristic test, used only for the
3293 -- purposes of figuring out whether we prefer to complain that an
3294 -- entity is undefined or invisible (and identify the declaration
3295 -- of the invisible entity in the latter case). The point here is
3296 -- that we don't want to complain that something is invisible and
3297 -- then point to something entirely mysterious to the writer.
3299 procedure Nvis_Messages;
3300 -- Called if there are no visible entries for N, but there is at least
3301 -- one non-directly visible, or hidden declaration. This procedure
3302 -- outputs an appropriate set of error messages.
3304 procedure Undefined (Nvis : Boolean);
3305 -- This function is called if the current node has no corresponding
3306 -- visible entity or entities. The value set in Msg indicates whether
3307 -- an error message was generated (multiple error messages for the
3308 -- same variable are generally suppressed, see body for details).
3309 -- Msg is True if an error message was generated, False if not. This
3310 -- value is used by the caller to determine whether or not to output
3311 -- additional messages where appropriate. The parameter is set False
3312 -- to get the message "X is undefined", and True to get the message
3313 -- "X is not visible".
3315 -------------------------
3316 -- From_Actual_Package --
3317 -------------------------
3319 function From_Actual_Package (E : Entity_Id) return Boolean is
3320 Scop : constant Entity_Id := Scope (E);
3324 if not In_Instance then
3327 Inst := Current_Scope;
3328 while Present (Inst)
3329 and then Ekind (Inst) /= E_Package
3330 and then not Is_Generic_Instance (Inst)
3332 Inst := Scope (Inst);
3339 Act := First_Entity (Inst);
3340 while Present (Act) loop
3341 if Ekind (Act) = E_Package then
3343 -- Check for end of actuals list
3345 if Renamed_Object (Act) = Inst then
3348 elsif Present (Associated_Formal_Package (Act))
3349 and then Renamed_Object (Act) = Scop
3351 -- Entity comes from (instance of) formal package
3366 end From_Actual_Package;
3368 -------------------------
3369 -- Is_Actual_Parameter --
3370 -------------------------
3372 function Is_Actual_Parameter return Boolean is
3375 Nkind (N) = N_Identifier
3377 (Nkind (Parent (N)) = N_Procedure_Call_Statement
3379 (Nkind (Parent (N)) = N_Parameter_Association
3380 and then N = Explicit_Actual_Parameter (Parent (N))
3381 and then Nkind (Parent (Parent (N))) =
3382 N_Procedure_Call_Statement));
3383 end Is_Actual_Parameter;
3385 -------------------------
3386 -- Known_But_Invisible --
3387 -------------------------
3389 function Known_But_Invisible (E : Entity_Id) return Boolean is
3390 Fname : File_Name_Type;
3393 -- Entities in Standard are always considered to be known
3395 if Sloc (E) <= Standard_Location then
3398 -- An entity that does not come from source is always considered
3399 -- to be unknown, since it is an artifact of code expansion.
3401 elsif not Comes_From_Source (E) then
3404 -- In gnat internal mode, we consider all entities known
3406 elsif GNAT_Mode then
3410 -- Here we have an entity that is not from package Standard, and
3411 -- which comes from Source. See if it comes from an internal file.
3413 Fname := Unit_File_Name (Get_Source_Unit (E));
3415 -- Case of from internal file
3417 if Is_Internal_File_Name (Fname) then
3419 -- Private part entities in internal files are never considered
3420 -- to be known to the writer of normal application code.
3422 if Is_Hidden (E) then
3426 -- Entities from System packages other than System and
3427 -- System.Storage_Elements are not considered to be known.
3428 -- System.Auxxxx files are also considered known to the user.
3430 -- Should refine this at some point to generally distinguish
3431 -- between known and unknown internal files ???
3433 Get_Name_String (Fname);
3438 Name_Buffer (1 .. 2) /= "s-"
3440 Name_Buffer (3 .. 8) = "stoele"
3442 Name_Buffer (3 .. 5) = "aux";
3444 -- If not an internal file, then entity is definitely known,
3445 -- even if it is in a private part (the message generated will
3446 -- note that it is in a private part)
3451 end Known_But_Invisible;
3457 procedure Nvis_Messages is
3458 Comp_Unit : Node_Id;
3460 Hidden : Boolean := False;
3464 -- Ada 2005 (AI-262): Generate a precise error concerning the
3465 -- Beaujolais effect that was previously detected
3467 if Nvis_Is_Private_Subprg then
3469 pragma Assert (Nkind (E2) = N_Defining_Identifier
3470 and then Ekind (E2) = E_Function
3471 and then Scope (E2) = Standard_Standard
3472 and then Has_Private_With (E2));
3474 -- Find the sloc corresponding to the private with'ed unit
3476 Comp_Unit := Cunit (Current_Sem_Unit);
3477 Error_Msg_Sloc := No_Location;
3479 Item := First (Context_Items (Comp_Unit));
3480 while Present (Item) loop
3481 if Nkind (Item) = N_With_Clause
3482 and then Private_Present (Item)
3483 and then Entity (Name (Item)) = E2
3485 Error_Msg_Sloc := Sloc (Item);
3492 pragma Assert (Error_Msg_Sloc /= No_Location);
3494 Error_Msg_N ("(Ada 2005): hidden by private with clause #", N);
3498 Undefined (Nvis => True);
3502 -- First loop does hidden declarations
3505 while Present (Ent) loop
3506 if Is_Potentially_Use_Visible (Ent) then
3508 Error_Msg_N ("multiple use clauses cause hiding!", N);
3512 Error_Msg_Sloc := Sloc (Ent);
3513 Error_Msg_N ("hidden declaration#!", N);
3516 Ent := Homonym (Ent);
3519 -- If we found hidden declarations, then that's enough, don't
3520 -- bother looking for non-visible declarations as well.
3526 -- Second loop does non-directly visible declarations
3529 while Present (Ent) loop
3530 if not Is_Potentially_Use_Visible (Ent) then
3532 -- Do not bother the user with unknown entities
3534 if not Known_But_Invisible (Ent) then
3538 Error_Msg_Sloc := Sloc (Ent);
3540 -- Output message noting that there is a non-visible
3541 -- declaration, distinguishing the private part case.
3543 if Is_Hidden (Ent) then
3544 Error_Msg_N ("non-visible (private) declaration#!", N);
3546 Error_Msg_N ("non-visible declaration#!", N);
3548 if Is_Compilation_Unit (Ent)
3550 Nkind (Parent (Parent (N))) = N_Use_Package_Clause
3552 Error_Msg_Qual_Level := 99;
3553 Error_Msg_NE ("\\missing `WITH &;`", N, Ent);
3554 Error_Msg_Qual_Level := 0;
3558 -- Set entity and its containing package as referenced. We
3559 -- can't be sure of this, but this seems a better choice
3560 -- to avoid unused entity messages.
3562 if Comes_From_Source (Ent) then
3563 Set_Referenced (Ent);
3564 Set_Referenced (Cunit_Entity (Get_Source_Unit (Ent)));
3569 Ent := Homonym (Ent);
3578 procedure Undefined (Nvis : Boolean) is
3579 Emsg : Error_Msg_Id;
3582 -- We should never find an undefined internal name. If we do, then
3583 -- see if we have previous errors. If so, ignore on the grounds that
3584 -- it is probably a cascaded message (e.g. a block label from a badly
3585 -- formed block). If no previous errors, then we have a real internal
3586 -- error of some kind so raise an exception.
3588 if Is_Internal_Name (Chars (N)) then
3589 if Total_Errors_Detected /= 0 then
3592 raise Program_Error;
3596 -- A very specialized error check, if the undefined variable is
3597 -- a case tag, and the case type is an enumeration type, check
3598 -- for a possible misspelling, and if so, modify the identifier
3600 -- Named aggregate should also be handled similarly ???
3602 if Nkind (N) = N_Identifier
3603 and then Nkind (Parent (N)) = N_Case_Statement_Alternative
3606 Case_Stm : constant Node_Id := Parent (Parent (N));
3607 Case_Typ : constant Entity_Id := Etype (Expression (Case_Stm));
3612 if Is_Enumeration_Type (Case_Typ)
3613 and then not Is_Standard_Character_Type (Case_Typ)
3615 Lit := First_Literal (Case_Typ);
3616 Get_Name_String (Chars (Lit));
3618 if Chars (Lit) /= Chars (N)
3619 and then Is_Bad_Spelling_Of (Chars (N), Chars (Lit)) then
3620 Error_Msg_Node_2 := Lit;
3622 ("& is undefined, assume misspelling of &", N);
3623 Rewrite (N, New_Occurrence_Of (Lit, Sloc (N)));
3627 Lit := Next_Literal (Lit);
3632 -- Normal processing
3634 Set_Entity (N, Any_Id);
3635 Set_Etype (N, Any_Type);
3637 -- We use the table Urefs to keep track of entities for which we
3638 -- have issued errors for undefined references. Multiple errors
3639 -- for a single name are normally suppressed, however we modify
3640 -- the error message to alert the programmer to this effect.
3642 for J in Urefs.First .. Urefs.Last loop
3643 if Chars (N) = Chars (Urefs.Table (J).Node) then
3644 if Urefs.Table (J).Err /= No_Error_Msg
3645 and then Sloc (N) /= Urefs.Table (J).Loc
3647 Error_Msg_Node_1 := Urefs.Table (J).Node;
3649 if Urefs.Table (J).Nvis then
3650 Change_Error_Text (Urefs.Table (J).Err,
3651 "& is not visible (more references follow)");
3653 Change_Error_Text (Urefs.Table (J).Err,
3654 "& is undefined (more references follow)");
3657 Urefs.Table (J).Err := No_Error_Msg;
3660 -- Although we will set Msg False, and thus suppress the
3661 -- message, we also set Error_Posted True, to avoid any
3662 -- cascaded messages resulting from the undefined reference.
3665 Set_Error_Posted (N, True);
3670 -- If entry not found, this is first undefined occurrence
3673 Error_Msg_N ("& is not visible!", N);
3677 Error_Msg_N ("& is undefined!", N);
3680 -- A very bizarre special check, if the undefined identifier
3681 -- is put or put_line, then add a special error message (since
3682 -- this is a very common error for beginners to make).
3684 if Chars (N) = Name_Put or else Chars (N) = Name_Put_Line then
3686 ("\\possible missing `WITH Ada.Text_'I'O; " &
3687 "USE Ada.Text_'I'O`!", N);
3689 -- Another special check if N is the prefix of a selected
3690 -- component which is a known unit, add message complaining
3691 -- about missing with for this unit.
3693 elsif Nkind (Parent (N)) = N_Selected_Component
3694 and then N = Prefix (Parent (N))
3695 and then Is_Known_Unit (Parent (N))
3697 Error_Msg_Node_2 := Selector_Name (Parent (N));
3698 Error_Msg_N ("\\missing `WITH &.&;`", Prefix (Parent (N)));
3701 -- Now check for possible misspellings
3705 Ematch : Entity_Id := Empty;
3707 Last_Name_Id : constant Name_Id :=
3708 Name_Id (Nat (First_Name_Id) +
3709 Name_Entries_Count - 1);
3712 for Nam in First_Name_Id .. Last_Name_Id loop
3713 E := Get_Name_Entity_Id (Nam);
3716 and then (Is_Immediately_Visible (E)
3718 Is_Potentially_Use_Visible (E))
3720 if Is_Bad_Spelling_Of (Chars (N), Nam) then
3727 if Present (Ematch) then
3728 Error_Msg_NE ("\possible misspelling of&", N, Ematch);
3733 -- Make entry in undefined references table unless the full errors
3734 -- switch is set, in which case by refraining from generating the
3735 -- table entry, we guarantee that we get an error message for every
3736 -- undefined reference.
3738 if not All_Errors_Mode then
3749 -- Start of processing for Find_Direct_Name
3752 -- If the entity pointer is already set, this is an internal node, or
3753 -- a node that is analyzed more than once, after a tree modification.
3754 -- In such a case there is no resolution to perform, just set the type.
3756 if Present (Entity (N)) then
3757 if Is_Type (Entity (N)) then
3758 Set_Etype (N, Entity (N));
3762 Entyp : constant Entity_Id := Etype (Entity (N));
3765 -- One special case here. If the Etype field is already set,
3766 -- and references the packed array type corresponding to the
3767 -- etype of the referenced entity, then leave it alone. This
3768 -- happens for trees generated from Exp_Pakd, where expressions
3769 -- can be deliberately "mis-typed" to the packed array type.
3771 if Is_Array_Type (Entyp)
3772 and then Is_Packed (Entyp)
3773 and then Present (Etype (N))
3774 and then Etype (N) = Packed_Array_Type (Entyp)
3778 -- If not that special case, then just reset the Etype
3781 Set_Etype (N, Etype (Entity (N)));
3789 -- Here if Entity pointer was not set, we need full visibility analysis
3790 -- First we generate debugging output if the debug E flag is set.
3792 if Debug_Flag_E then
3793 Write_Str ("Looking for ");
3794 Write_Name (Chars (N));
3798 Homonyms := Current_Entity (N);
3799 Nvis_Entity := False;
3802 while Present (E) loop
3804 -- If entity is immediately visible or potentially use visible, then
3805 -- process the entity and we are done.
3807 if Is_Immediately_Visible (E) then
3808 goto Immediately_Visible_Entity;
3810 elsif Is_Potentially_Use_Visible (E) then
3811 goto Potentially_Use_Visible_Entity;
3813 -- Note if a known but invisible entity encountered
3815 elsif Known_But_Invisible (E) then
3816 Nvis_Entity := True;
3819 -- Move to next entity in chain and continue search
3824 -- If no entries on homonym chain that were potentially visible,
3825 -- and no entities reasonably considered as non-visible, then
3826 -- we have a plain undefined reference, with no additional
3827 -- explanation required!
3829 if not Nvis_Entity then
3830 Undefined (Nvis => False);
3832 -- Otherwise there is at least one entry on the homonym chain that
3833 -- is reasonably considered as being known and non-visible.
3841 -- Processing for a potentially use visible entry found. We must search
3842 -- the rest of the homonym chain for two reasons. First, if there is a
3843 -- directly visible entry, then none of the potentially use-visible
3844 -- entities are directly visible (RM 8.4(10)). Second, we need to check
3845 -- for the case of multiple potentially use-visible entries hiding one
3846 -- another and as a result being non-directly visible (RM 8.4(11)).
3848 <<Potentially_Use_Visible_Entity>> declare
3849 Only_One_Visible : Boolean := True;
3850 All_Overloadable : Boolean := Is_Overloadable (E);
3854 while Present (E2) loop
3855 if Is_Immediately_Visible (E2) then
3857 -- If the use-visible entity comes from the actual for a
3858 -- formal package, it hides a directly visible entity from
3859 -- outside the instance.
3861 if From_Actual_Package (E)
3862 and then Scope_Depth (E2) < Scope_Depth (Inst)
3867 goto Immediately_Visible_Entity;
3870 elsif Is_Potentially_Use_Visible (E2) then
3871 Only_One_Visible := False;
3872 All_Overloadable := All_Overloadable and Is_Overloadable (E2);
3874 -- Ada 2005 (AI-262): Protect against a form of Beaujolais effect
3875 -- that can occur in private_with clauses. Example:
3878 -- private with B; package A is
3879 -- package C is function B return Integer;
3881 -- V1 : Integer := B;
3882 -- private function B return Integer;
3883 -- V2 : Integer := B;
3886 -- V1 resolves to A.B, but V2 resolves to library unit B
3888 elsif Ekind (E2) = E_Function
3889 and then Scope (E2) = Standard_Standard
3890 and then Has_Private_With (E2)
3892 Only_One_Visible := False;
3893 All_Overloadable := False;
3894 Nvis_Is_Private_Subprg := True;
3901 -- On falling through this loop, we have checked that there are no
3902 -- immediately visible entities. Only_One_Visible is set if exactly
3903 -- one potentially use visible entity exists. All_Overloadable is
3904 -- set if all the potentially use visible entities are overloadable.
3905 -- The condition for legality is that either there is one potentially
3906 -- use visible entity, or if there is more than one, then all of them
3907 -- are overloadable.
3909 if Only_One_Visible or All_Overloadable then
3912 -- If there is more than one potentially use-visible entity and at
3913 -- least one of them non-overloadable, we have an error (RM 8.4(11).
3914 -- Note that E points to the first such entity on the homonym list.
3915 -- Special case: if one of the entities is declared in an actual
3916 -- package, it was visible in the generic, and takes precedence over
3917 -- other entities that are potentially use-visible. Same if it is
3918 -- declared in a local instantiation of the current instance.
3923 -- Find current instance
3925 Inst := Current_Scope;
3926 while Present (Inst)
3927 and then Inst /= Standard_Standard
3929 if Is_Generic_Instance (Inst) then
3933 Inst := Scope (Inst);
3937 while Present (E2) loop
3938 if From_Actual_Package (E2)
3940 (Is_Generic_Instance (Scope (E2))
3941 and then Scope_Depth (Scope (E2)) > Scope_Depth (Inst))
3954 Is_Predefined_File_Name (Unit_File_Name (Current_Sem_Unit))
3956 -- A use-clause in the body of a system file creates conflict
3957 -- with some entity in a user scope, while rtsfind is active.
3958 -- Keep only the entity coming from another predefined unit.
3961 while Present (E2) loop
3962 if Is_Predefined_File_Name
3963 (Unit_File_Name (Get_Source_Unit (Sloc (E2))))
3972 -- Entity must exist because predefined unit is correct
3974 raise Program_Error;
3983 -- Come here with E set to the first immediately visible entity on
3984 -- the homonym chain. This is the one we want unless there is another
3985 -- immediately visible entity further on in the chain for an inner
3986 -- scope (RM 8.3(8)).
3988 <<Immediately_Visible_Entity>> declare
3993 -- Find scope level of initial entity. When compiling through
3994 -- Rtsfind, the previous context is not completely invisible, and
3995 -- an outer entity may appear on the chain, whose scope is below
3996 -- the entry for Standard that delimits the current scope stack.
3997 -- Indicate that the level for this spurious entry is outside of
3998 -- the current scope stack.
4000 Level := Scope_Stack.Last;
4002 Scop := Scope_Stack.Table (Level).Entity;
4003 exit when Scop = Scope (E);
4005 exit when Scop = Standard_Standard;
4008 -- Now search remainder of homonym chain for more inner entry
4009 -- If the entity is Standard itself, it has no scope, and we
4010 -- compare it with the stack entry directly.
4013 while Present (E2) loop
4014 if Is_Immediately_Visible (E2) then
4016 -- If a generic package contains a local declaration that
4017 -- has the same name as the generic, there may be a visibility
4018 -- conflict in an instance, where the local declaration must
4019 -- also hide the name of the corresponding package renaming.
4020 -- We check explicitly for a package declared by a renaming,
4021 -- whose renamed entity is an instance that is on the scope
4022 -- stack, and that contains a homonym in the same scope. Once
4023 -- we have found it, we know that the package renaming is not
4024 -- immediately visible, and that the identifier denotes the
4025 -- other entity (and its homonyms if overloaded).
4027 if Scope (E) = Scope (E2)
4028 and then Ekind (E) = E_Package
4029 and then Present (Renamed_Object (E))
4030 and then Is_Generic_Instance (Renamed_Object (E))
4031 and then In_Open_Scopes (Renamed_Object (E))
4032 and then Comes_From_Source (N)
4034 Set_Is_Immediately_Visible (E, False);
4038 for J in Level + 1 .. Scope_Stack.Last loop
4039 if Scope_Stack.Table (J).Entity = Scope (E2)
4040 or else Scope_Stack.Table (J).Entity = E2
4053 -- At the end of that loop, E is the innermost immediately
4054 -- visible entity, so we are all set.
4057 -- Come here with entity found, and stored in E
4061 -- When distribution features are available (Get_PCS_Name /=
4062 -- Name_No_DSA), a remote access-to-subprogram type is converted
4063 -- into a record type holding whatever information is needed to
4064 -- perform a remote call on an RCI subprogram. In that case we
4065 -- rewrite any occurrence of the RAS type into the equivalent record
4066 -- type here. 'Access attribute references and RAS dereferences are
4067 -- then implemented using specific TSSs. However when distribution is
4068 -- not available (case of Get_PCS_Name = Name_No_DSA), we bypass the
4069 -- generation of these TSSs, and we must keep the RAS type in its
4070 -- original access-to-subprogram form (since all calls through a
4071 -- value of such type will be local anyway in the absence of a PCS).
4073 if Comes_From_Source (N)
4074 and then Is_Remote_Access_To_Subprogram_Type (E)
4075 and then Expander_Active
4076 and then Get_PCS_Name /= Name_No_DSA
4079 New_Occurrence_Of (Equivalent_Type (E), Sloc (N)));
4084 -- Why no Style_Check here???
4089 Set_Etype (N, Get_Full_View (Etype (E)));
4092 if Debug_Flag_E then
4093 Write_Str (" found ");
4094 Write_Entity_Info (E, " ");
4097 -- If the Ekind of the entity is Void, it means that all homonyms
4098 -- are hidden from all visibility (RM 8.3(5,14-20)). However, this
4099 -- test is skipped if the current scope is a record and the name is
4100 -- a pragma argument expression (case of Atomic and Volatile pragmas
4101 -- and possibly other similar pragmas added later, which are allowed
4102 -- to reference components in the current record).
4104 if Ekind (E) = E_Void
4106 (not Is_Record_Type (Current_Scope)
4107 or else Nkind (Parent (N)) /= N_Pragma_Argument_Association)
4109 Premature_Usage (N);
4111 -- If the entity is overloadable, collect all interpretations of the
4112 -- name for subsequent overload resolution. We optimize a bit here to
4113 -- do this only if we have an overloadable entity that is not on its
4114 -- own on the homonym chain.
4116 elsif Is_Overloadable (E)
4117 and then (Present (Homonym (E)) or else Current_Entity (N) /= E)
4119 Collect_Interps (N);
4121 -- If no homonyms were visible, the entity is unambiguous
4123 if not Is_Overloaded (N) then
4124 if not Is_Actual_Parameter then
4125 Generate_Reference (E, N);
4129 -- Case of non-overloadable entity, set the entity providing that
4130 -- we do not have the case of a discriminant reference within a
4131 -- default expression. Such references are replaced with the
4132 -- corresponding discriminal, which is the formal corresponding to
4133 -- to the discriminant in the initialization procedure.
4136 -- Entity is unambiguous, indicate that it is referenced here
4138 -- For a renaming of an object, always generate simple reference,
4139 -- we don't try to keep track of assignments in this case.
4141 if Is_Object (E) and then Present (Renamed_Object (E)) then
4142 Generate_Reference (E, N);
4144 -- If the renamed entity is a private protected component,
4145 -- reference the original component as well. This needs to be
4146 -- done because the private renamings are installed before any
4147 -- analysis has occurred. Reference to a private component will
4148 -- resolve to the renaming and the original component will be
4149 -- left unreferenced, hence the following.
4151 if Is_Prival (E) then
4152 Generate_Reference (Prival_Link (E), N);
4155 -- One odd case is that we do not want to set the Referenced flag
4156 -- if the entity is a label, and the identifier is the label in
4157 -- the source, since this is not a reference from the point of
4158 -- view of the user.
4160 elsif Nkind (Parent (N)) = N_Label then
4162 R : constant Boolean := Referenced (E);
4165 -- Generate reference unless this is an actual parameter
4166 -- (see comment below)
4168 if Is_Actual_Parameter then
4169 Generate_Reference (E, N);
4170 Set_Referenced (E, R);
4174 -- Normal case, not a label: generate reference
4176 -- ??? It is too early to generate a reference here even if
4177 -- the entity is unambiguous, because the tree is not
4178 -- sufficiently typed at this point for Generate_Reference to
4179 -- determine whether this reference modifies the denoted object
4180 -- (because implicit dereferences cannot be identified prior to
4181 -- full type resolution).
4183 -- The Is_Actual_Parameter routine takes care of one of these
4184 -- cases but there are others probably ???
4187 if not Is_Actual_Parameter then
4188 Generate_Reference (E, N);
4191 Check_Nested_Access (E);
4194 -- Set Entity, with style check if need be. For a discriminant
4195 -- reference, replace by the corresponding discriminal, i.e. the
4196 -- parameter of the initialization procedure that corresponds to
4197 -- the discriminant. If this replacement is being performed, there
4198 -- is no style check to perform.
4200 -- This replacement must not be done if we are currently
4201 -- processing a generic spec or body, because the discriminal
4202 -- has not been not generated in this case.
4204 -- The replacement is also skipped if we are in special
4205 -- spec-expression mode. Why is this skipped in this case ???
4207 if not In_Spec_Expression
4208 or else Ekind (E) /= E_Discriminant
4209 or else Inside_A_Generic
4211 Set_Entity_With_Style_Check (N, E);
4213 -- The replacement is not done either for a task discriminant that
4214 -- appears in a default expression of an entry parameter. See
4215 -- Expand_Discriminant in exp_ch2 for details on their handling.
4217 elsif Is_Concurrent_Type (Scope (E)) then
4224 and then not Nkind_In (P, N_Parameter_Specification,
4225 N_Component_Declaration)
4231 and then Nkind (P) = N_Parameter_Specification
4235 Set_Entity (N, Discriminal (E));
4239 -- Otherwise, this is a discriminant in a context in which
4240 -- it is a reference to the corresponding parameter of the
4241 -- init proc for the enclosing type.
4244 Set_Entity (N, Discriminal (E));
4248 end Find_Direct_Name;
4250 ------------------------
4251 -- Find_Expanded_Name --
4252 ------------------------
4254 -- This routine searches the homonym chain of the entity until it finds
4255 -- an entity declared in the scope denoted by the prefix. If the entity
4256 -- is private, it may nevertheless be immediately visible, if we are in
4257 -- the scope of its declaration.
4259 procedure Find_Expanded_Name (N : Node_Id) is
4260 Selector : constant Node_Id := Selector_Name (N);
4261 Candidate : Entity_Id := Empty;
4267 P_Name := Entity (Prefix (N));
4270 -- If the prefix is a renamed package, look for the entity in the
4271 -- original package.
4273 if Ekind (P_Name) = E_Package
4274 and then Present (Renamed_Object (P_Name))
4276 P_Name := Renamed_Object (P_Name);
4278 -- Rewrite node with entity field pointing to renamed object
4280 Rewrite (Prefix (N), New_Copy (Prefix (N)));
4281 Set_Entity (Prefix (N), P_Name);
4283 -- If the prefix is an object of a concurrent type, look for
4284 -- the entity in the associated task or protected type.
4286 elsif Is_Concurrent_Type (Etype (P_Name)) then
4287 P_Name := Etype (P_Name);
4290 Id := Current_Entity (Selector);
4293 Is_New_Candidate : Boolean;
4296 while Present (Id) loop
4297 if Scope (Id) = P_Name then
4299 Is_New_Candidate := True;
4301 -- Ada 2005 (AI-217): Handle shadow entities associated with types
4302 -- declared in limited-withed nested packages. We don't need to
4303 -- handle E_Incomplete_Subtype entities because the entities in
4304 -- the limited view are always E_Incomplete_Type entities (see
4305 -- Build_Limited_Views). Regarding the expression used to evaluate
4306 -- the scope, it is important to note that the limited view also
4307 -- has shadow entities associated nested packages. For this reason
4308 -- the correct scope of the entity is the scope of the real entity
4309 -- The non-limited view may itself be incomplete, in which case
4310 -- get the full view if available.
4312 elsif From_With_Type (Id)
4313 and then Is_Type (Id)
4314 and then Ekind (Id) = E_Incomplete_Type
4315 and then Present (Non_Limited_View (Id))
4316 and then Scope (Non_Limited_View (Id)) = P_Name
4318 Candidate := Get_Full_View (Non_Limited_View (Id));
4319 Is_New_Candidate := True;
4322 Is_New_Candidate := False;
4325 if Is_New_Candidate then
4326 if Is_Child_Unit (Id) then
4327 exit when Is_Visible_Child_Unit (Id)
4328 or else Is_Immediately_Visible (Id);
4331 exit when not Is_Hidden (Id)
4332 or else Is_Immediately_Visible (Id);
4341 and then (Ekind (P_Name) = E_Procedure
4343 Ekind (P_Name) = E_Function)
4344 and then Is_Generic_Instance (P_Name)
4346 -- Expanded name denotes entity in (instance of) generic subprogram.
4347 -- The entity may be in the subprogram instance, or may denote one of
4348 -- the formals, which is declared in the enclosing wrapper package.
4350 P_Name := Scope (P_Name);
4352 Id := Current_Entity (Selector);
4353 while Present (Id) loop
4354 exit when Scope (Id) = P_Name;
4359 if No (Id) or else Chars (Id) /= Chars (Selector) then
4360 Set_Etype (N, Any_Type);
4362 -- If we are looking for an entity defined in System, try to find it
4363 -- in the child package that may have been provided as an extension
4364 -- to System. The Extend_System pragma will have supplied the name of
4365 -- the extension, which may have to be loaded.
4367 if Chars (P_Name) = Name_System
4368 and then Scope (P_Name) = Standard_Standard
4369 and then Present (System_Extend_Unit)
4370 and then Present_System_Aux (N)
4372 Set_Entity (Prefix (N), System_Aux_Id);
4373 Find_Expanded_Name (N);
4376 elsif Nkind (Selector) = N_Operator_Symbol
4377 and then Has_Implicit_Operator (N)
4379 -- There is an implicit instance of the predefined operator in
4380 -- the given scope. The operator entity is defined in Standard.
4381 -- Has_Implicit_Operator makes the node into an Expanded_Name.
4385 elsif Nkind (Selector) = N_Character_Literal
4386 and then Has_Implicit_Character_Literal (N)
4388 -- If there is no literal defined in the scope denoted by the
4389 -- prefix, the literal may belong to (a type derived from)
4390 -- Standard_Character, for which we have no explicit literals.
4395 -- If the prefix is a single concurrent object, use its name in
4396 -- the error message, rather than that of the anonymous type.
4398 if Is_Concurrent_Type (P_Name)
4399 and then Is_Internal_Name (Chars (P_Name))
4401 Error_Msg_Node_2 := Entity (Prefix (N));
4403 Error_Msg_Node_2 := P_Name;
4406 if P_Name = System_Aux_Id then
4407 P_Name := Scope (P_Name);
4408 Set_Entity (Prefix (N), P_Name);
4411 if Present (Candidate) then
4413 -- If we know that the unit is a child unit we can give a more
4414 -- accurate error message.
4416 if Is_Child_Unit (Candidate) then
4418 -- If the candidate is a private child unit and we are in
4419 -- the visible part of a public unit, specialize the error
4420 -- message. There might be a private with_clause for it,
4421 -- but it is not currently active.
4423 if Is_Private_Descendant (Candidate)
4424 and then Ekind (Current_Scope) = E_Package
4425 and then not In_Private_Part (Current_Scope)
4426 and then not Is_Private_Descendant (Current_Scope)
4428 Error_Msg_N ("private child unit& is not visible here",
4431 -- Normal case where we have a missing with for a child unit
4434 Error_Msg_Qual_Level := 99;
4435 Error_Msg_NE ("missing `WITH &;`", Selector, Candidate);
4436 Error_Msg_Qual_Level := 0;
4439 -- Here we don't know that this is a child unit
4442 Error_Msg_NE ("& is not a visible entity of&", N, Selector);
4446 -- Within the instantiation of a child unit, the prefix may
4447 -- denote the parent instance, but the selector has the name
4448 -- of the original child. Find whether we are within the
4449 -- corresponding instance, and get the proper entity, which
4450 -- can only be an enclosing scope.
4453 and then In_Open_Scopes (P_Name)
4454 and then Is_Generic_Instance (P_Name)
4457 S : Entity_Id := Current_Scope;
4461 for J in reverse 0 .. Scope_Stack.Last loop
4462 S := Scope_Stack.Table (J).Entity;
4464 exit when S = Standard_Standard;
4466 if Ekind (S) = E_Function
4467 or else Ekind (S) = E_Package
4468 or else Ekind (S) = E_Procedure
4470 P := Generic_Parent (Specification
4471 (Unit_Declaration_Node (S)));
4474 and then Chars (Scope (P)) = Chars (O_Name)
4475 and then Chars (P) = Chars (Selector)
4486 -- If this is a selection from Ada, System or Interfaces, then
4487 -- we assume a missing with for the corresponding package.
4489 if Is_Known_Unit (N) then
4490 if not Error_Posted (N) then
4491 Error_Msg_Node_2 := Selector;
4492 Error_Msg_N ("missing `WITH &.&;`", Prefix (N));
4495 -- If this is a selection from a dummy package, then suppress
4496 -- the error message, of course the entity is missing if the
4497 -- package is missing!
4499 elsif Sloc (Error_Msg_Node_2) = No_Location then
4502 -- Here we have the case of an undefined component
4505 Error_Msg_NE ("& not declared in&", N, Selector);
4507 -- Check for misspelling of some entity in prefix
4509 Id := First_Entity (P_Name);
4510 while Present (Id) loop
4511 if Is_Bad_Spelling_Of (Chars (Id), Chars (Selector))
4512 and then not Is_Internal_Name (Chars (Id))
4515 ("possible misspelling of&", Selector, Id);
4522 -- Specialize the message if this may be an instantiation
4523 -- of a child unit that was not mentioned in the context.
4525 if Nkind (Parent (N)) = N_Package_Instantiation
4526 and then Is_Generic_Instance (Entity (Prefix (N)))
4527 and then Is_Compilation_Unit
4528 (Generic_Parent (Parent (Entity (Prefix (N)))))
4530 Error_Msg_Node_2 := Selector;
4531 Error_Msg_N ("\missing `WITH &.&;`", Prefix (N));
4541 if Comes_From_Source (N)
4542 and then Is_Remote_Access_To_Subprogram_Type (Id)
4543 and then Present (Equivalent_Type (Id))
4545 -- If we are not actually generating distribution code (i.e. the
4546 -- current PCS is the dummy non-distributed version), then the
4547 -- Equivalent_Type will be missing, and Id should be treated as
4548 -- a regular access-to-subprogram type.
4550 Id := Equivalent_Type (Id);
4551 Set_Chars (Selector, Chars (Id));
4554 -- Ada 2005 (AI-50217): Check usage of entities in limited withed units
4556 if Ekind (P_Name) = E_Package
4557 and then From_With_Type (P_Name)
4559 if From_With_Type (Id)
4560 or else Is_Type (Id)
4561 or else Ekind (Id) = E_Package
4566 ("limited withed package can only be used to access "
4567 & "incomplete types",
4572 if Is_Task_Type (P_Name)
4573 and then ((Ekind (Id) = E_Entry
4574 and then Nkind (Parent (N)) /= N_Attribute_Reference)
4576 (Ekind (Id) = E_Entry_Family
4578 Nkind (Parent (Parent (N))) /= N_Attribute_Reference))
4580 -- It is an entry call after all, either to the current task (which
4581 -- will deadlock) or to an enclosing task.
4583 Analyze_Selected_Component (N);
4587 Change_Selected_Component_To_Expanded_Name (N);
4589 -- Do style check and generate reference, but skip both steps if this
4590 -- entity has homonyms, since we may not have the right homonym set yet.
4591 -- The proper homonym will be set during the resolve phase.
4593 if Has_Homonym (Id) then
4596 Set_Entity_With_Style_Check (N, Id);
4597 Generate_Reference (Id, N);
4600 if Is_Type (Id) then
4603 Set_Etype (N, Get_Full_View (Etype (Id)));
4606 -- If the Ekind of the entity is Void, it means that all homonyms are
4607 -- hidden from all visibility (RM 8.3(5,14-20)).
4609 if Ekind (Id) = E_Void then
4610 Premature_Usage (N);
4612 elsif Is_Overloadable (Id)
4613 and then Present (Homonym (Id))
4616 H : Entity_Id := Homonym (Id);
4619 while Present (H) loop
4620 if Scope (H) = Scope (Id)
4623 or else Is_Immediately_Visible (H))
4625 Collect_Interps (N);
4632 -- If an extension of System is present, collect possible explicit
4633 -- overloadings declared in the extension.
4635 if Chars (P_Name) = Name_System
4636 and then Scope (P_Name) = Standard_Standard
4637 and then Present (System_Extend_Unit)
4638 and then Present_System_Aux (N)
4640 H := Current_Entity (Id);
4642 while Present (H) loop
4643 if Scope (H) = System_Aux_Id then
4644 Add_One_Interp (N, H, Etype (H));
4653 if Nkind (Selector_Name (N)) = N_Operator_Symbol
4654 and then Scope (Id) /= Standard_Standard
4656 -- In addition to user-defined operators in the given scope, there
4657 -- may be an implicit instance of the predefined operator. The
4658 -- operator (defined in Standard) is found in Has_Implicit_Operator,
4659 -- and added to the interpretations. Procedure Add_One_Interp will
4660 -- determine which hides which.
4662 if Has_Implicit_Operator (N) then
4666 end Find_Expanded_Name;
4668 -------------------------
4669 -- Find_Renamed_Entity --
4670 -------------------------
4672 function Find_Renamed_Entity
4676 Is_Actual : Boolean := False) return Entity_Id
4679 I1 : Interp_Index := 0; -- Suppress junk warnings
4685 function Enclosing_Instance return Entity_Id;
4686 -- If the renaming determines the entity for the default of a formal
4687 -- subprogram nested within another instance, choose the innermost
4688 -- candidate. This is because if the formal has a box, and we are within
4689 -- an enclosing instance where some candidate interpretations are local
4690 -- to this enclosing instance, we know that the default was properly
4691 -- resolved when analyzing the generic, so we prefer the local
4692 -- candidates to those that are external. This is not always the case
4693 -- but is a reasonable heuristic on the use of nested generics. The
4694 -- proper solution requires a full renaming model.
4696 function Is_Visible_Operation (Op : Entity_Id) return Boolean;
4697 -- If the renamed entity is an implicit operator, check whether it is
4698 -- visible because its operand type is properly visible. This check
4699 -- applies to explicit renamed entities that appear in the source in a
4700 -- renaming declaration or a formal subprogram instance, but not to
4701 -- default generic actuals with a name.
4703 function Report_Overload return Entity_Id;
4704 -- List possible interpretations, and specialize message in the
4705 -- case of a generic actual.
4707 function Within (Inner, Outer : Entity_Id) return Boolean;
4708 -- Determine whether a candidate subprogram is defined within the
4709 -- enclosing instance. If yes, it has precedence over outer candidates.
4711 ------------------------
4712 -- Enclosing_Instance --
4713 ------------------------
4715 function Enclosing_Instance return Entity_Id is
4719 if not Is_Generic_Instance (Current_Scope)
4720 and then not Is_Actual
4725 S := Scope (Current_Scope);
4726 while S /= Standard_Standard loop
4727 if Is_Generic_Instance (S) then
4735 end Enclosing_Instance;
4737 --------------------------
4738 -- Is_Visible_Operation --
4739 --------------------------
4741 function Is_Visible_Operation (Op : Entity_Id) return Boolean is
4747 if Ekind (Op) /= E_Operator
4748 or else Scope (Op) /= Standard_Standard
4749 or else (In_Instance
4752 or else Present (Enclosing_Instance)))
4757 -- For a fixed point type operator, check the resulting type,
4758 -- because it may be a mixed mode integer * fixed operation.
4760 if Present (Next_Formal (First_Formal (New_S)))
4761 and then Is_Fixed_Point_Type (Etype (New_S))
4763 Typ := Etype (New_S);
4765 Typ := Etype (First_Formal (New_S));
4768 Btyp := Base_Type (Typ);
4770 if Nkind (Nam) /= N_Expanded_Name then
4771 return (In_Open_Scopes (Scope (Btyp))
4772 or else Is_Potentially_Use_Visible (Btyp)
4773 or else In_Use (Btyp)
4774 or else In_Use (Scope (Btyp)));
4777 Scop := Entity (Prefix (Nam));
4779 if Ekind (Scop) = E_Package
4780 and then Present (Renamed_Object (Scop))
4782 Scop := Renamed_Object (Scop);
4785 -- Operator is visible if prefix of expanded name denotes
4786 -- scope of type, or else type type is defined in System_Aux
4787 -- and the prefix denotes System.
4789 return Scope (Btyp) = Scop
4790 or else (Scope (Btyp) = System_Aux_Id
4791 and then Scope (Scope (Btyp)) = Scop);
4794 end Is_Visible_Operation;
4800 function Within (Inner, Outer : Entity_Id) return Boolean is
4804 Sc := Scope (Inner);
4805 while Sc /= Standard_Standard loop
4816 ---------------------
4817 -- Report_Overload --
4818 ---------------------
4820 function Report_Overload return Entity_Id is
4824 ("ambiguous actual subprogram&, " &
4825 "possible interpretations:", N, Nam);
4828 ("ambiguous subprogram, " &
4829 "possible interpretations:", N);
4832 List_Interps (Nam, N);
4834 end Report_Overload;
4836 -- Start of processing for Find_Renamed_Entry
4840 Candidate_Renaming := Empty;
4842 if not Is_Overloaded (Nam) then
4843 if Entity_Matches_Spec (Entity (Nam), New_S)
4844 and then Is_Visible_Operation (Entity (Nam))
4846 Old_S := Entity (Nam);
4849 Present (First_Formal (Entity (Nam)))
4850 and then Present (First_Formal (New_S))
4851 and then (Base_Type (Etype (First_Formal (Entity (Nam))))
4852 = Base_Type (Etype (First_Formal (New_S))))
4854 Candidate_Renaming := Entity (Nam);
4858 Get_First_Interp (Nam, Ind, It);
4859 while Present (It.Nam) loop
4860 if Entity_Matches_Spec (It.Nam, New_S)
4861 and then Is_Visible_Operation (It.Nam)
4863 if Old_S /= Any_Id then
4865 -- Note: The call to Disambiguate only happens if a
4866 -- previous interpretation was found, in which case I1
4867 -- has received a value.
4869 It1 := Disambiguate (Nam, I1, Ind, Etype (Old_S));
4871 if It1 = No_Interp then
4872 Inst := Enclosing_Instance;
4874 if Present (Inst) then
4875 if Within (It.Nam, Inst) then
4877 elsif Within (Old_S, Inst) then
4880 return Report_Overload;
4884 return Report_Overload;
4898 Present (First_Formal (It.Nam))
4899 and then Present (First_Formal (New_S))
4900 and then (Base_Type (Etype (First_Formal (It.Nam)))
4901 = Base_Type (Etype (First_Formal (New_S))))
4903 Candidate_Renaming := It.Nam;
4906 Get_Next_Interp (Ind, It);
4909 Set_Entity (Nam, Old_S);
4910 Set_Is_Overloaded (Nam, False);
4914 end Find_Renamed_Entity;
4916 -----------------------------
4917 -- Find_Selected_Component --
4918 -----------------------------
4920 procedure Find_Selected_Component (N : Node_Id) is
4921 P : constant Node_Id := Prefix (N);
4924 -- Entity denoted by prefix
4934 if Nkind (P) = N_Error then
4937 -- If the selector already has an entity, the node has been constructed
4938 -- in the course of expansion, and is known to be valid. Do not verify
4939 -- that it is defined for the type (it may be a private component used
4940 -- in the expansion of record equality).
4942 elsif Present (Entity (Selector_Name (N))) then
4944 or else Etype (N) = Any_Type
4947 Sel_Name : constant Node_Id := Selector_Name (N);
4948 Selector : constant Entity_Id := Entity (Sel_Name);
4952 Set_Etype (Sel_Name, Etype (Selector));
4954 if not Is_Entity_Name (P) then
4958 -- Build an actual subtype except for the first parameter
4959 -- of an init proc, where this actual subtype is by
4960 -- definition incorrect, since the object is uninitialized
4961 -- (and does not even have defined discriminants etc.)
4963 if Is_Entity_Name (P)
4964 and then Ekind (Entity (P)) = E_Function
4966 Nam := New_Copy (P);
4968 if Is_Overloaded (P) then
4969 Save_Interps (P, Nam);
4973 Make_Function_Call (Sloc (P), Name => Nam));
4975 Analyze_Selected_Component (N);
4978 elsif Ekind (Selector) = E_Component
4979 and then (not Is_Entity_Name (P)
4980 or else Chars (Entity (P)) /= Name_uInit)
4983 Build_Actual_Subtype_Of_Component (
4984 Etype (Selector), N);
4989 if No (C_Etype) then
4990 C_Etype := Etype (Selector);
4992 Insert_Action (N, C_Etype);
4993 C_Etype := Defining_Identifier (C_Etype);
4996 Set_Etype (N, C_Etype);
4999 -- If this is the name of an entry or protected operation, and
5000 -- the prefix is an access type, insert an explicit dereference,
5001 -- so that entry calls are treated uniformly.
5003 if Is_Access_Type (Etype (P))
5004 and then Is_Concurrent_Type (Designated_Type (Etype (P)))
5007 New_P : constant Node_Id :=
5008 Make_Explicit_Dereference (Sloc (P),
5009 Prefix => Relocate_Node (P));
5012 Set_Etype (P, Designated_Type (Etype (Prefix (P))));
5016 -- If the selected component appears within a default expression
5017 -- and it has an actual subtype, the pre-analysis has not yet
5018 -- completed its analysis, because Insert_Actions is disabled in
5019 -- that context. Within the init proc of the enclosing type we
5020 -- must complete this analysis, if an actual subtype was created.
5022 elsif Inside_Init_Proc then
5024 Typ : constant Entity_Id := Etype (N);
5025 Decl : constant Node_Id := Declaration_Node (Typ);
5027 if Nkind (Decl) = N_Subtype_Declaration
5028 and then not Analyzed (Decl)
5029 and then Is_List_Member (Decl)
5030 and then No (Parent (Decl))
5033 Insert_Action (N, Decl);
5040 elsif Is_Entity_Name (P) then
5041 P_Name := Entity (P);
5043 -- The prefix may denote an enclosing type which is the completion
5044 -- of an incomplete type declaration.
5046 if Is_Type (P_Name) then
5047 Set_Entity (P, Get_Full_View (P_Name));
5048 Set_Etype (P, Entity (P));
5049 P_Name := Entity (P);
5052 P_Type := Base_Type (Etype (P));
5054 if Debug_Flag_E then
5055 Write_Str ("Found prefix type to be ");
5056 Write_Entity_Info (P_Type, " "); Write_Eol;
5059 -- First check for components of a record object (not the
5060 -- result of a call, which is handled below).
5062 if Is_Appropriate_For_Record (P_Type)
5063 and then not Is_Overloadable (P_Name)
5064 and then not Is_Type (P_Name)
5066 -- Selected component of record. Type checking will validate
5067 -- name of selector.
5068 -- ??? could we rewrite an implicit dereference into an explicit
5071 Analyze_Selected_Component (N);
5073 elsif Is_Appropriate_For_Entry_Prefix (P_Type)
5074 and then not In_Open_Scopes (P_Name)
5075 and then (not Is_Concurrent_Type (Etype (P_Name))
5076 or else not In_Open_Scopes (Etype (P_Name)))
5078 -- Call to protected operation or entry. Type checking is
5079 -- needed on the prefix.
5081 Analyze_Selected_Component (N);
5083 elsif (In_Open_Scopes (P_Name)
5084 and then Ekind (P_Name) /= E_Void
5085 and then not Is_Overloadable (P_Name))
5086 or else (Is_Concurrent_Type (Etype (P_Name))
5087 and then In_Open_Scopes (Etype (P_Name)))
5089 -- Prefix denotes an enclosing loop, block, or task, i.e. an
5090 -- enclosing construct that is not a subprogram or accept.
5092 Find_Expanded_Name (N);
5094 elsif Ekind (P_Name) = E_Package then
5095 Find_Expanded_Name (N);
5097 elsif Is_Overloadable (P_Name) then
5099 -- The subprogram may be a renaming (of an enclosing scope) as
5100 -- in the case of the name of the generic within an instantiation.
5102 if (Ekind (P_Name) = E_Procedure
5103 or else Ekind (P_Name) = E_Function)
5104 and then Present (Alias (P_Name))
5105 and then Is_Generic_Instance (Alias (P_Name))
5107 P_Name := Alias (P_Name);
5110 if Is_Overloaded (P) then
5112 -- The prefix must resolve to a unique enclosing construct
5115 Found : Boolean := False;
5120 Get_First_Interp (P, Ind, It);
5121 while Present (It.Nam) loop
5122 if In_Open_Scopes (It.Nam) then
5125 "prefix must be unique enclosing scope", N);
5126 Set_Entity (N, Any_Id);
5127 Set_Etype (N, Any_Type);
5136 Get_Next_Interp (Ind, It);
5141 if In_Open_Scopes (P_Name) then
5142 Set_Entity (P, P_Name);
5143 Set_Is_Overloaded (P, False);
5144 Find_Expanded_Name (N);
5147 -- If no interpretation as an expanded name is possible, it
5148 -- must be a selected component of a record returned by a
5149 -- function call. Reformat prefix as a function call, the rest
5150 -- is done by type resolution. If the prefix is procedure or
5151 -- entry, as is P.X; this is an error.
5153 if Ekind (P_Name) /= E_Function
5154 and then (not Is_Overloaded (P)
5156 Nkind (Parent (N)) = N_Procedure_Call_Statement)
5158 -- Prefix may mention a package that is hidden by a local
5159 -- declaration: let the user know. Scan the full homonym
5160 -- chain, the candidate package may be anywhere on it.
5162 if Present (Homonym (Current_Entity (P_Name))) then
5164 P_Name := Current_Entity (P_Name);
5166 while Present (P_Name) loop
5167 exit when Ekind (P_Name) = E_Package;
5168 P_Name := Homonym (P_Name);
5171 if Present (P_Name) then
5172 Error_Msg_Sloc := Sloc (Entity (Prefix (N)));
5175 ("package& is hidden by declaration#",
5178 Set_Entity (Prefix (N), P_Name);
5179 Find_Expanded_Name (N);
5182 P_Name := Entity (Prefix (N));
5187 ("invalid prefix in selected component&", N, P_Name);
5188 Change_Selected_Component_To_Expanded_Name (N);
5189 Set_Entity (N, Any_Id);
5190 Set_Etype (N, Any_Type);
5193 Nam := New_Copy (P);
5194 Save_Interps (P, Nam);
5196 Make_Function_Call (Sloc (P), Name => Nam));
5198 Analyze_Selected_Component (N);
5202 -- Remaining cases generate various error messages
5205 -- Format node as expanded name, to avoid cascaded errors
5207 Change_Selected_Component_To_Expanded_Name (N);
5208 Set_Entity (N, Any_Id);
5209 Set_Etype (N, Any_Type);
5211 -- Issue error message, but avoid this if error issued already.
5212 -- Use identifier of prefix if one is available.
5214 if P_Name = Any_Id then
5217 elsif Ekind (P_Name) = E_Void then
5218 Premature_Usage (P);
5220 elsif Nkind (P) /= N_Attribute_Reference then
5222 "invalid prefix in selected component&", P);
5224 if Is_Access_Type (P_Type)
5225 and then Ekind (Designated_Type (P_Type)) = E_Incomplete_Type
5228 ("\dereference must not be of an incomplete type " &
5234 "invalid prefix in selected component", P);
5239 -- If prefix is not the name of an entity, it must be an expression,
5240 -- whose type is appropriate for a record. This is determined by
5243 Analyze_Selected_Component (N);
5245 end Find_Selected_Component;
5251 procedure Find_Type (N : Node_Id) is
5261 elsif Nkind (N) = N_Attribute_Reference then
5263 -- Class attribute. This is not valid in Ada 83 mode, but we do not
5264 -- need to enforce that at this point, since the declaration of the
5265 -- tagged type in the prefix would have been flagged already.
5267 if Attribute_Name (N) = Name_Class then
5268 Check_Restriction (No_Dispatch, N);
5269 Find_Type (Prefix (N));
5271 -- Propagate error from bad prefix
5273 if Etype (Prefix (N)) = Any_Type then
5274 Set_Entity (N, Any_Type);
5275 Set_Etype (N, Any_Type);
5279 T := Base_Type (Entity (Prefix (N)));
5281 -- Case where type is not known to be tagged. Its appearance in
5282 -- the prefix of the 'Class attribute indicates that the full view
5285 if not Is_Tagged_Type (T) then
5286 if Ekind (T) = E_Incomplete_Type then
5288 -- It is legal to denote the class type of an incomplete
5289 -- type. The full type will have to be tagged, of course.
5290 -- In Ada 2005 this usage is declared obsolescent, so we
5291 -- warn accordingly.
5293 -- ??? This test is temporarily disabled (always False)
5294 -- because it causes an unwanted warning on GNAT sources
5295 -- (built with -gnatg, which includes Warn_On_Obsolescent_
5296 -- Feature). Once this issue is cleared in the sources, it
5299 if not Is_Tagged_Type (T)
5300 and then Ada_Version >= Ada_05
5301 and then Warn_On_Obsolescent_Feature
5305 ("applying 'Class to an untagged incomplete type"
5306 & " is an obsolescent feature (RM J.11)", N);
5309 Set_Is_Tagged_Type (T);
5310 Set_Primitive_Operations (T, New_Elmt_List);
5311 Make_Class_Wide_Type (T);
5312 Set_Entity (N, Class_Wide_Type (T));
5313 Set_Etype (N, Class_Wide_Type (T));
5315 elsif Ekind (T) = E_Private_Type
5316 and then not Is_Generic_Type (T)
5317 and then In_Private_Part (Scope (T))
5319 -- The Class attribute can be applied to an untagged private
5320 -- type fulfilled by a tagged type prior to the full type
5321 -- declaration (but only within the parent package's private
5322 -- part). Create the class-wide type now and check that the
5323 -- full type is tagged later during its analysis. Note that
5324 -- we do not mark the private type as tagged, unlike the
5325 -- case of incomplete types, because the type must still
5326 -- appear untagged to outside units.
5328 if No (Class_Wide_Type (T)) then
5329 Make_Class_Wide_Type (T);
5332 Set_Entity (N, Class_Wide_Type (T));
5333 Set_Etype (N, Class_Wide_Type (T));
5336 -- Should we introduce a type Any_Tagged and use Wrong_Type
5337 -- here, it would be a bit more consistent???
5340 ("tagged type required, found}",
5341 Prefix (N), First_Subtype (T));
5342 Set_Entity (N, Any_Type);
5346 -- Case of tagged type
5349 if Is_Concurrent_Type (T) then
5350 if No (Corresponding_Record_Type (Entity (Prefix (N)))) then
5352 -- Previous error. Use current type, which at least
5353 -- provides some operations.
5355 C := Entity (Prefix (N));
5358 C := Class_Wide_Type
5359 (Corresponding_Record_Type (Entity (Prefix (N))));
5363 C := Class_Wide_Type (Entity (Prefix (N)));
5366 Set_Entity_With_Style_Check (N, C);
5367 Generate_Reference (C, N);
5371 -- Base attribute, not allowed in Ada 83
5373 elsif Attribute_Name (N) = Name_Base then
5374 if Ada_Version = Ada_83 and then Comes_From_Source (N) then
5376 ("(Ada 83) Base attribute not allowed in subtype mark", N);
5379 Find_Type (Prefix (N));
5380 Typ := Entity (Prefix (N));
5382 if Ada_Version >= Ada_95
5383 and then not Is_Scalar_Type (Typ)
5384 and then not Is_Generic_Type (Typ)
5387 ("prefix of Base attribute must be scalar type",
5390 elsif Sloc (Typ) = Standard_Location
5391 and then Base_Type (Typ) = Typ
5392 and then Warn_On_Redundant_Constructs
5395 ("?redundant attribute, & is its own base type", N, Typ);
5398 T := Base_Type (Typ);
5400 -- Rewrite attribute reference with type itself (see similar
5401 -- processing in Analyze_Attribute, case Base). Preserve
5402 -- prefix if present, for other legality checks.
5404 if Nkind (Prefix (N)) = N_Expanded_Name then
5406 Make_Expanded_Name (Sloc (N),
5408 Prefix => New_Copy (Prefix (Prefix (N))),
5409 Selector_Name => New_Reference_To (T, Sloc (N))));
5412 Rewrite (N, New_Reference_To (T, Sloc (N)));
5419 elsif Attribute_Name (N) = Name_Stub_Type then
5421 -- This is handled in Analyze_Attribute
5425 -- All other attributes are invalid in a subtype mark
5428 Error_Msg_N ("invalid attribute in subtype mark", N);
5434 if Is_Entity_Name (N) then
5435 T_Name := Entity (N);
5437 Error_Msg_N ("subtype mark required in this context", N);
5438 Set_Etype (N, Any_Type);
5442 if T_Name = Any_Id or else Etype (N) = Any_Type then
5444 -- Undefined id. Make it into a valid type
5446 Set_Entity (N, Any_Type);
5448 elsif not Is_Type (T_Name)
5449 and then T_Name /= Standard_Void_Type
5451 Error_Msg_Sloc := Sloc (T_Name);
5452 Error_Msg_N ("subtype mark required in this context", N);
5453 Error_Msg_NE ("\\found & declared#", N, T_Name);
5454 Set_Entity (N, Any_Type);
5457 -- If the type is an incomplete type created to handle
5458 -- anonymous access components of a record type, then the
5459 -- incomplete type is the visible entity and subsequent
5460 -- references will point to it. Mark the original full
5461 -- type as referenced, to prevent spurious warnings.
5463 if Is_Incomplete_Type (T_Name)
5464 and then Present (Full_View (T_Name))
5465 and then not Comes_From_Source (T_Name)
5467 Set_Referenced (Full_View (T_Name));
5470 T_Name := Get_Full_View (T_Name);
5472 -- Ada 2005 (AI-251, AI-50217): Handle interfaces visible through
5473 -- limited-with clauses
5475 if From_With_Type (T_Name)
5476 and then Ekind (T_Name) in Incomplete_Kind
5477 and then Present (Non_Limited_View (T_Name))
5478 and then Is_Interface (Non_Limited_View (T_Name))
5480 T_Name := Non_Limited_View (T_Name);
5483 if In_Open_Scopes (T_Name) then
5484 if Ekind (Base_Type (T_Name)) = E_Task_Type then
5486 -- In Ada 2005, a task name can be used in an access
5487 -- definition within its own body.
5489 if Ada_Version >= Ada_05
5490 and then Nkind (Parent (N)) = N_Access_Definition
5492 Set_Entity (N, T_Name);
5493 Set_Etype (N, T_Name);
5498 ("task type cannot be used as type mark " &
5499 "within its own spec or body", N);
5502 elsif Ekind (Base_Type (T_Name)) = E_Protected_Type then
5504 -- In Ada 2005, a protected name can be used in an access
5505 -- definition within its own body.
5507 if Ada_Version >= Ada_05
5508 and then Nkind (Parent (N)) = N_Access_Definition
5510 Set_Entity (N, T_Name);
5511 Set_Etype (N, T_Name);
5516 ("protected type cannot be used as type mark " &
5517 "within its own spec or body", N);
5521 Error_Msg_N ("type declaration cannot refer to itself", N);
5524 Set_Etype (N, Any_Type);
5525 Set_Entity (N, Any_Type);
5526 Set_Error_Posted (T_Name);
5530 Set_Entity (N, T_Name);
5531 Set_Etype (N, T_Name);
5535 if Present (Etype (N)) and then Comes_From_Source (N) then
5536 if Is_Fixed_Point_Type (Etype (N)) then
5537 Check_Restriction (No_Fixed_Point, N);
5538 elsif Is_Floating_Point_Type (Etype (N)) then
5539 Check_Restriction (No_Floating_Point, N);
5544 ------------------------------------
5545 -- Has_Implicit_Character_Literal --
5546 ------------------------------------
5548 function Has_Implicit_Character_Literal (N : Node_Id) return Boolean is
5550 Found : Boolean := False;
5551 P : constant Entity_Id := Entity (Prefix (N));
5552 Priv_Id : Entity_Id := Empty;
5555 if Ekind (P) = E_Package
5556 and then not In_Open_Scopes (P)
5558 Priv_Id := First_Private_Entity (P);
5561 if P = Standard_Standard then
5562 Change_Selected_Component_To_Expanded_Name (N);
5563 Rewrite (N, Selector_Name (N));
5565 Set_Etype (Original_Node (N), Standard_Character);
5569 Id := First_Entity (P);
5571 and then Id /= Priv_Id
5573 if Is_Standard_Character_Type (Id)
5574 and then Id = Base_Type (Id)
5576 -- We replace the node with the literal itself, resolve as a
5577 -- character, and set the type correctly.
5580 Change_Selected_Component_To_Expanded_Name (N);
5581 Rewrite (N, Selector_Name (N));
5584 Set_Etype (Original_Node (N), Id);
5588 -- More than one type derived from Character in given scope.
5589 -- Collect all possible interpretations.
5591 Add_One_Interp (N, Id, Id);
5599 end Has_Implicit_Character_Literal;
5601 ----------------------
5602 -- Has_Private_With --
5603 ----------------------
5605 function Has_Private_With (E : Entity_Id) return Boolean is
5606 Comp_Unit : constant Node_Id := Cunit (Current_Sem_Unit);
5610 Item := First (Context_Items (Comp_Unit));
5611 while Present (Item) loop
5612 if Nkind (Item) = N_With_Clause
5613 and then Private_Present (Item)
5614 and then Entity (Name (Item)) = E
5623 end Has_Private_With;
5625 ---------------------------
5626 -- Has_Implicit_Operator --
5627 ---------------------------
5629 function Has_Implicit_Operator (N : Node_Id) return Boolean is
5630 Op_Id : constant Name_Id := Chars (Selector_Name (N));
5631 P : constant Entity_Id := Entity (Prefix (N));
5633 Priv_Id : Entity_Id := Empty;
5635 procedure Add_Implicit_Operator
5637 Op_Type : Entity_Id := Empty);
5638 -- Add implicit interpretation to node N, using the type for which a
5639 -- predefined operator exists. If the operator yields a boolean type,
5640 -- the Operand_Type is implicitly referenced by the operator, and a
5641 -- reference to it must be generated.
5643 ---------------------------
5644 -- Add_Implicit_Operator --
5645 ---------------------------
5647 procedure Add_Implicit_Operator
5649 Op_Type : Entity_Id := Empty)
5651 Predef_Op : Entity_Id;
5654 Predef_Op := Current_Entity (Selector_Name (N));
5656 while Present (Predef_Op)
5657 and then Scope (Predef_Op) /= Standard_Standard
5659 Predef_Op := Homonym (Predef_Op);
5662 if Nkind (N) = N_Selected_Component then
5663 Change_Selected_Component_To_Expanded_Name (N);
5666 Add_One_Interp (N, Predef_Op, T);
5668 -- For operators with unary and binary interpretations, add both
5670 if Present (Homonym (Predef_Op)) then
5671 Add_One_Interp (N, Homonym (Predef_Op), T);
5674 -- The node is a reference to a predefined operator, and
5675 -- an implicit reference to the type of its operands.
5677 if Present (Op_Type) then
5678 Generate_Operator_Reference (N, Op_Type);
5680 Generate_Operator_Reference (N, T);
5682 end Add_Implicit_Operator;
5684 -- Start of processing for Has_Implicit_Operator
5687 if Ekind (P) = E_Package
5688 and then not In_Open_Scopes (P)
5690 Priv_Id := First_Private_Entity (P);
5693 Id := First_Entity (P);
5697 -- Boolean operators: an implicit declaration exists if the scope
5698 -- contains a declaration for a derived Boolean type, or for an
5699 -- array of Boolean type.
5701 when Name_Op_And | Name_Op_Not | Name_Op_Or | Name_Op_Xor =>
5702 while Id /= Priv_Id loop
5703 if Valid_Boolean_Arg (Id)
5704 and then Id = Base_Type (Id)
5706 Add_Implicit_Operator (Id);
5713 -- Equality: look for any non-limited type (result is Boolean)
5715 when Name_Op_Eq | Name_Op_Ne =>
5716 while Id /= Priv_Id loop
5718 and then not Is_Limited_Type (Id)
5719 and then Id = Base_Type (Id)
5721 Add_Implicit_Operator (Standard_Boolean, Id);
5728 -- Comparison operators: scalar type, or array of scalar
5730 when Name_Op_Lt | Name_Op_Le | Name_Op_Gt | Name_Op_Ge =>
5731 while Id /= Priv_Id loop
5732 if (Is_Scalar_Type (Id)
5733 or else (Is_Array_Type (Id)
5734 and then Is_Scalar_Type (Component_Type (Id))))
5735 and then Id = Base_Type (Id)
5737 Add_Implicit_Operator (Standard_Boolean, Id);
5744 -- Arithmetic operators: any numeric type
5754 while Id /= Priv_Id loop
5755 if Is_Numeric_Type (Id)
5756 and then Id = Base_Type (Id)
5758 Add_Implicit_Operator (Id);
5765 -- Concatenation: any one-dimensional array type
5767 when Name_Op_Concat =>
5768 while Id /= Priv_Id loop
5769 if Is_Array_Type (Id) and then Number_Dimensions (Id) = 1
5770 and then Id = Base_Type (Id)
5772 Add_Implicit_Operator (Id);
5779 -- What is the others condition here? Should we be using a
5780 -- subtype of Name_Id that would restrict to operators ???
5782 when others => null;
5785 -- If we fall through, then we do not have an implicit operator
5789 end Has_Implicit_Operator;
5791 --------------------
5792 -- In_Open_Scopes --
5793 --------------------
5795 function In_Open_Scopes (S : Entity_Id) return Boolean is
5797 -- Several scope stacks are maintained by Scope_Stack. The base of the
5798 -- currently active scope stack is denoted by the Is_Active_Stack_Base
5799 -- flag in the scope stack entry. Note that the scope stacks used to
5800 -- simply be delimited implicitly by the presence of Standard_Standard
5801 -- at their base, but there now are cases where this is not sufficient
5802 -- because Standard_Standard actually may appear in the middle of the
5803 -- active set of scopes.
5805 for J in reverse 0 .. Scope_Stack.Last loop
5806 if Scope_Stack.Table (J).Entity = S then
5810 -- Check Is_Active_Stack_Base to tell us when to stop, as there are
5811 -- cases where Standard_Standard appears in the middle of the active
5812 -- set of scopes. This affects the declaration and overriding of
5813 -- private inherited operations in instantiations of generic child
5816 exit when Scope_Stack.Table (J).Is_Active_Stack_Base;
5822 -----------------------------
5823 -- Inherit_Renamed_Profile --
5824 -----------------------------
5826 procedure Inherit_Renamed_Profile (New_S : Entity_Id; Old_S : Entity_Id) is
5833 if Ekind (Old_S) = E_Operator then
5834 New_F := First_Formal (New_S);
5836 while Present (New_F) loop
5837 Set_Etype (New_F, Base_Type (Etype (New_F)));
5838 Next_Formal (New_F);
5841 Set_Etype (New_S, Base_Type (Etype (New_S)));
5844 New_F := First_Formal (New_S);
5845 Old_F := First_Formal (Old_S);
5847 while Present (New_F) loop
5848 New_T := Etype (New_F);
5849 Old_T := Etype (Old_F);
5851 -- If the new type is a renaming of the old one, as is the
5852 -- case for actuals in instances, retain its name, to simplify
5853 -- later disambiguation.
5855 if Nkind (Parent (New_T)) = N_Subtype_Declaration
5856 and then Is_Entity_Name (Subtype_Indication (Parent (New_T)))
5857 and then Entity (Subtype_Indication (Parent (New_T))) = Old_T
5861 Set_Etype (New_F, Old_T);
5864 Next_Formal (New_F);
5865 Next_Formal (Old_F);
5868 if Ekind (Old_S) = E_Function
5869 or else Ekind (Old_S) = E_Enumeration_Literal
5871 Set_Etype (New_S, Etype (Old_S));
5874 end Inherit_Renamed_Profile;
5880 procedure Initialize is
5885 -------------------------
5886 -- Install_Use_Clauses --
5887 -------------------------
5889 procedure Install_Use_Clauses
5891 Force_Installation : Boolean := False)
5899 while Present (U) loop
5901 -- Case of USE package
5903 if Nkind (U) = N_Use_Package_Clause then
5904 P := First (Names (U));
5905 while Present (P) loop
5908 if Ekind (Id) = E_Package then
5910 Note_Redundant_Use (P);
5912 elsif Present (Renamed_Object (Id))
5913 and then In_Use (Renamed_Object (Id))
5915 Note_Redundant_Use (P);
5917 elsif Force_Installation or else Applicable_Use (P) then
5918 Use_One_Package (Id, U);
5929 P := First (Subtype_Marks (U));
5930 while Present (P) loop
5931 if not Is_Entity_Name (P)
5932 or else No (Entity (P))
5936 elsif Entity (P) /= Any_Type then
5944 Next_Use_Clause (U);
5946 end Install_Use_Clauses;
5948 -------------------------------------
5949 -- Is_Appropriate_For_Entry_Prefix --
5950 -------------------------------------
5952 function Is_Appropriate_For_Entry_Prefix (T : Entity_Id) return Boolean is
5953 P_Type : Entity_Id := T;
5956 if Is_Access_Type (P_Type) then
5957 P_Type := Designated_Type (P_Type);
5960 return Is_Task_Type (P_Type) or else Is_Protected_Type (P_Type);
5961 end Is_Appropriate_For_Entry_Prefix;
5963 -------------------------------
5964 -- Is_Appropriate_For_Record --
5965 -------------------------------
5967 function Is_Appropriate_For_Record (T : Entity_Id) return Boolean is
5969 function Has_Components (T1 : Entity_Id) return Boolean;
5970 -- Determine if given type has components (i.e. is either a record
5971 -- type or a type that has discriminants).
5973 --------------------
5974 -- Has_Components --
5975 --------------------
5977 function Has_Components (T1 : Entity_Id) return Boolean is
5979 return Is_Record_Type (T1)
5980 or else (Is_Private_Type (T1) and then Has_Discriminants (T1))
5981 or else (Is_Task_Type (T1) and then Has_Discriminants (T1))
5982 or else (Is_Incomplete_Type (T1)
5983 and then From_With_Type (T1)
5984 and then Present (Non_Limited_View (T1))
5985 and then Is_Record_Type
5986 (Get_Full_View (Non_Limited_View (T1))));
5989 -- Start of processing for Is_Appropriate_For_Record
5994 and then (Has_Components (T)
5995 or else (Is_Access_Type (T)
5996 and then Has_Components (Designated_Type (T))));
5997 end Is_Appropriate_For_Record;
5999 ------------------------
6000 -- Note_Redundant_Use --
6001 ------------------------
6003 procedure Note_Redundant_Use (Clause : Node_Id) is
6004 Pack_Name : constant Entity_Id := Entity (Clause);
6005 Cur_Use : constant Node_Id := Current_Use_Clause (Pack_Name);
6006 Decl : constant Node_Id := Parent (Clause);
6008 Prev_Use : Node_Id := Empty;
6009 Redundant : Node_Id := Empty;
6010 -- The Use_Clause which is actually redundant. In the simplest case
6011 -- it is Pack itself, but when we compile a body we install its
6012 -- context before that of its spec, in which case it is the use_clause
6013 -- in the spec that will appear to be redundant, and we want the
6014 -- warning to be placed on the body. Similar complications appear when
6015 -- the redundancy is between a child unit and one of its ancestors.
6018 Set_Redundant_Use (Clause, True);
6020 if not Comes_From_Source (Clause)
6022 or else not Warn_On_Redundant_Constructs
6027 if not Is_Compilation_Unit (Current_Scope) then
6029 -- If the use_clause is in an inner scope, it is made redundant
6030 -- by some clause in the current context, with one exception:
6031 -- If we're compiling a nested package body, and the use_clause
6032 -- comes from the corresponding spec, the clause is not necessarily
6033 -- fully redundant, so we should not warn. If a warning was
6034 -- warranted, it would have been given when the spec was processed.
6036 if Nkind (Parent (Decl)) = N_Package_Specification then
6038 Package_Spec_Entity : constant Entity_Id :=
6039 Defining_Unit_Name (Parent (Decl));
6041 if In_Package_Body (Package_Spec_Entity) then
6047 Redundant := Clause;
6048 Prev_Use := Cur_Use;
6050 elsif Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Body then
6052 Cur_Unit : constant Unit_Number_Type := Get_Source_Unit (Cur_Use);
6053 New_Unit : constant Unit_Number_Type := Get_Source_Unit (Clause);
6057 if Cur_Unit = New_Unit then
6059 -- Redundant clause in same body
6061 Redundant := Clause;
6062 Prev_Use := Cur_Use;
6064 elsif Cur_Unit = Current_Sem_Unit then
6066 -- If the new clause is not in the current unit it has been
6067 -- analyzed first, and it makes the other one redundant.
6068 -- However, if the new clause appears in a subunit, Cur_Unit
6069 -- is still the parent, and in that case the redundant one
6070 -- is the one appearing in the subunit.
6072 if Nkind (Unit (Cunit (New_Unit))) = N_Subunit then
6073 Redundant := Clause;
6074 Prev_Use := Cur_Use;
6076 -- Most common case: redundant clause in body,
6077 -- original clause in spec. Current scope is spec entity.
6082 Unit (Library_Unit (Cunit (Current_Sem_Unit))))
6084 Redundant := Cur_Use;
6088 -- The new clause may appear in an unrelated unit, when
6089 -- the parents of a generic are being installed prior to
6090 -- instantiation. In this case there must be no warning.
6091 -- We detect this case by checking whether the current top
6092 -- of the stack is related to the current compilation.
6094 Scop := Current_Scope;
6095 while Present (Scop)
6096 and then Scop /= Standard_Standard
6098 if Is_Compilation_Unit (Scop)
6099 and then not Is_Child_Unit (Scop)
6103 elsif Scop = Cunit_Entity (Current_Sem_Unit) then
6107 Scop := Scope (Scop);
6110 Redundant := Cur_Use;
6114 elsif New_Unit = Current_Sem_Unit then
6115 Redundant := Clause;
6116 Prev_Use := Cur_Use;
6119 -- Neither is the current unit, so they appear in parent or
6120 -- sibling units. Warning will be emitted elsewhere.
6126 elsif Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Declaration
6127 and then Present (Parent_Spec (Unit (Cunit (Current_Sem_Unit))))
6129 -- Use_clause is in child unit of current unit, and the child
6130 -- unit appears in the context of the body of the parent, so it
6131 -- has been installed first, even though it is the redundant one.
6132 -- Depending on their placement in the context, the visible or the
6133 -- private parts of the two units, either might appear as redundant,
6134 -- but the message has to be on the current unit.
6136 if Get_Source_Unit (Cur_Use) = Current_Sem_Unit then
6137 Redundant := Cur_Use;
6140 Redundant := Clause;
6141 Prev_Use := Cur_Use;
6144 -- If the new use clause appears in the private part of a parent unit
6145 -- it may appear to be redundant w.r.t. a use clause in a child unit,
6146 -- but the previous use clause was needed in the visible part of the
6147 -- child, and no warning should be emitted.
6149 if Nkind (Parent (Decl)) = N_Package_Specification
6151 List_Containing (Decl) = Private_Declarations (Parent (Decl))
6154 Par : constant Entity_Id := Defining_Entity (Parent (Decl));
6155 Spec : constant Node_Id :=
6156 Specification (Unit (Cunit (Current_Sem_Unit)));
6159 if Is_Compilation_Unit (Par)
6160 and then Par /= Cunit_Entity (Current_Sem_Unit)
6161 and then Parent (Cur_Use) = Spec
6163 List_Containing (Cur_Use) = Visible_Declarations (Spec)
6170 -- Finally, if the current use clause is in the context then
6171 -- the clause is redundant when it is nested within the unit.
6173 elsif Nkind (Parent (Cur_Use)) = N_Compilation_Unit
6174 and then Nkind (Parent (Parent (Clause))) /= N_Compilation_Unit
6175 and then Get_Source_Unit (Cur_Use) = Get_Source_Unit (Clause)
6177 Redundant := Clause;
6178 Prev_Use := Cur_Use;
6184 if Present (Redundant) then
6185 Error_Msg_Sloc := Sloc (Prev_Use);
6187 ("& is already use-visible through previous use clause #?",
6188 Redundant, Pack_Name);
6190 end Note_Redundant_Use;
6196 procedure Pop_Scope is
6197 SST : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last);
6200 if Debug_Flag_E then
6204 Scope_Suppress := SST.Save_Scope_Suppress;
6205 Local_Suppress_Stack_Top := SST.Save_Local_Suppress_Stack_Top;
6206 Check_Policy_List := SST.Save_Check_Policy_List;
6208 if Debug_Flag_W then
6209 Write_Str ("--> exiting scope: ");
6210 Write_Name (Chars (Current_Scope));
6211 Write_Str (", Depth=");
6212 Write_Int (Int (Scope_Stack.Last));
6216 End_Use_Clauses (SST.First_Use_Clause);
6218 -- If the actions to be wrapped are still there they will get lost
6219 -- causing incomplete code to be generated. It is better to abort in
6220 -- this case (and we do the abort even with assertions off since the
6221 -- penalty is incorrect code generation)
6223 if SST.Actions_To_Be_Wrapped_Before /= No_List
6225 SST.Actions_To_Be_Wrapped_After /= No_List
6230 -- Free last subprogram name if allocated, and pop scope
6232 Free (SST.Last_Subprogram_Name);
6233 Scope_Stack.Decrement_Last;
6240 procedure Push_Scope (S : Entity_Id) is
6244 if Ekind (S) = E_Void then
6247 -- Set scope depth if not a non-concurrent type, and we have not
6248 -- yet set the scope depth. This means that we have the first
6249 -- occurrence of the scope, and this is where the depth is set.
6251 elsif (not Is_Type (S) or else Is_Concurrent_Type (S))
6252 and then not Scope_Depth_Set (S)
6254 if S = Standard_Standard then
6255 Set_Scope_Depth_Value (S, Uint_0);
6257 elsif Is_Child_Unit (S) then
6258 Set_Scope_Depth_Value (S, Uint_1);
6260 elsif not Is_Record_Type (Current_Scope) then
6261 if Ekind (S) = E_Loop then
6262 Set_Scope_Depth_Value (S, Scope_Depth (Current_Scope));
6264 Set_Scope_Depth_Value (S, Scope_Depth (Current_Scope) + 1);
6269 Scope_Stack.Increment_Last;
6272 SST : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last);
6276 SST.Save_Scope_Suppress := Scope_Suppress;
6277 SST.Save_Local_Suppress_Stack_Top := Local_Suppress_Stack_Top;
6278 SST.Save_Check_Policy_List := Check_Policy_List;
6280 if Scope_Stack.Last > Scope_Stack.First then
6281 SST.Component_Alignment_Default := Scope_Stack.Table
6282 (Scope_Stack.Last - 1).
6283 Component_Alignment_Default;
6286 SST.Last_Subprogram_Name := null;
6287 SST.Is_Transient := False;
6288 SST.Node_To_Be_Wrapped := Empty;
6289 SST.Pending_Freeze_Actions := No_List;
6290 SST.Actions_To_Be_Wrapped_Before := No_List;
6291 SST.Actions_To_Be_Wrapped_After := No_List;
6292 SST.First_Use_Clause := Empty;
6293 SST.Is_Active_Stack_Base := False;
6294 SST.Previous_Visibility := False;
6297 if Debug_Flag_W then
6298 Write_Str ("--> new scope: ");
6299 Write_Name (Chars (Current_Scope));
6300 Write_Str (", Id=");
6301 Write_Int (Int (Current_Scope));
6302 Write_Str (", Depth=");
6303 Write_Int (Int (Scope_Stack.Last));
6307 -- Deal with copying flags from the previous scope to this one. This
6308 -- is not necessary if either scope is standard, or if the new scope
6311 if S /= Standard_Standard
6312 and then Scope (S) /= Standard_Standard
6313 and then not Is_Child_Unit (S)
6317 if Nkind (E) not in N_Entity then
6321 -- Copy categorization flags from Scope (S) to S, this is not done
6322 -- when Scope (S) is Standard_Standard since propagation is from
6323 -- library unit entity inwards. Copy other relevant attributes as
6324 -- well (Discard_Names in particular).
6326 -- We only propagate inwards for library level entities,
6327 -- inner level subprograms do not inherit the categorization.
6329 if Is_Library_Level_Entity (S) then
6330 Set_Is_Preelaborated (S, Is_Preelaborated (E));
6331 Set_Is_Shared_Passive (S, Is_Shared_Passive (E));
6332 Set_Discard_Names (S, Discard_Names (E));
6333 Set_Suppress_Value_Tracking_On_Call
6334 (S, Suppress_Value_Tracking_On_Call (E));
6335 Set_Categorization_From_Scope (E => S, Scop => E);
6340 ---------------------
6341 -- Premature_Usage --
6342 ---------------------
6344 procedure Premature_Usage (N : Node_Id) is
6345 Kind : constant Node_Kind := Nkind (Parent (Entity (N)));
6346 E : Entity_Id := Entity (N);
6349 -- Within an instance, the analysis of the actual for a formal object
6350 -- does not see the name of the object itself. This is significant only
6351 -- if the object is an aggregate, where its analysis does not do any
6352 -- name resolution on component associations. (see 4717-008). In such a
6353 -- case, look for the visible homonym on the chain.
6356 and then Present (Homonym (E))
6361 and then not In_Open_Scopes (Scope (E))
6368 Set_Etype (N, Etype (E));
6373 if Kind = N_Component_Declaration then
6375 ("component&! cannot be used before end of record declaration", N);
6377 elsif Kind = N_Parameter_Specification then
6379 ("formal parameter&! cannot be used before end of specification",
6382 elsif Kind = N_Discriminant_Specification then
6384 ("discriminant&! cannot be used before end of discriminant part",
6387 elsif Kind = N_Procedure_Specification
6388 or else Kind = N_Function_Specification
6391 ("subprogram&! cannot be used before end of its declaration",
6394 elsif Kind = N_Full_Type_Declaration then
6396 ("type& cannot be used before end of its declaration!", N);
6400 ("object& cannot be used before end of its declaration!", N);
6402 end Premature_Usage;
6404 ------------------------
6405 -- Present_System_Aux --
6406 ------------------------
6408 function Present_System_Aux (N : Node_Id := Empty) return Boolean is
6410 Aux_Name : Unit_Name_Type;
6411 Unum : Unit_Number_Type;
6416 function Find_System (C_Unit : Node_Id) return Entity_Id;
6417 -- Scan context clause of compilation unit to find with_clause
6424 function Find_System (C_Unit : Node_Id) return Entity_Id is
6425 With_Clause : Node_Id;
6428 With_Clause := First (Context_Items (C_Unit));
6429 while Present (With_Clause) loop
6430 if (Nkind (With_Clause) = N_With_Clause
6431 and then Chars (Name (With_Clause)) = Name_System)
6432 and then Comes_From_Source (With_Clause)
6443 -- Start of processing for Present_System_Aux
6446 -- The child unit may have been loaded and analyzed already
6448 if Present (System_Aux_Id) then
6451 -- If no previous pragma for System.Aux, nothing to load
6453 elsif No (System_Extend_Unit) then
6456 -- Use the unit name given in the pragma to retrieve the unit.
6457 -- Verify that System itself appears in the context clause of the
6458 -- current compilation. If System is not present, an error will
6459 -- have been reported already.
6462 With_Sys := Find_System (Cunit (Current_Sem_Unit));
6464 The_Unit := Unit (Cunit (Current_Sem_Unit));
6468 (Nkind (The_Unit) = N_Package_Body
6469 or else (Nkind (The_Unit) = N_Subprogram_Body
6471 not Acts_As_Spec (Cunit (Current_Sem_Unit))))
6473 With_Sys := Find_System (Library_Unit (Cunit (Current_Sem_Unit)));
6477 and then Present (N)
6479 -- If we are compiling a subunit, we need to examine its
6480 -- context as well (Current_Sem_Unit is the parent unit);
6482 The_Unit := Parent (N);
6483 while Nkind (The_Unit) /= N_Compilation_Unit loop
6484 The_Unit := Parent (The_Unit);
6487 if Nkind (Unit (The_Unit)) = N_Subunit then
6488 With_Sys := Find_System (The_Unit);
6492 if No (With_Sys) then
6496 Loc := Sloc (With_Sys);
6497 Get_Name_String (Chars (Expression (System_Extend_Unit)));
6498 Name_Buffer (8 .. Name_Len + 7) := Name_Buffer (1 .. Name_Len);
6499 Name_Buffer (1 .. 7) := "system.";
6500 Name_Buffer (Name_Len + 8) := '%';
6501 Name_Buffer (Name_Len + 9) := 's';
6502 Name_Len := Name_Len + 9;
6503 Aux_Name := Name_Find;
6507 (Load_Name => Aux_Name,
6510 Error_Node => With_Sys);
6512 if Unum /= No_Unit then
6513 Semantics (Cunit (Unum));
6515 Defining_Entity (Specification (Unit (Cunit (Unum))));
6518 Make_With_Clause (Loc,
6520 Make_Expanded_Name (Loc,
6521 Chars => Chars (System_Aux_Id),
6522 Prefix => New_Reference_To (Scope (System_Aux_Id), Loc),
6523 Selector_Name => New_Reference_To (System_Aux_Id, Loc)));
6525 Set_Entity (Name (Withn), System_Aux_Id);
6527 Set_Library_Unit (Withn, Cunit (Unum));
6528 Set_Corresponding_Spec (Withn, System_Aux_Id);
6529 Set_First_Name (Withn, True);
6530 Set_Implicit_With (Withn, True);
6532 Insert_After (With_Sys, Withn);
6533 Mark_Rewrite_Insertion (Withn);
6534 Set_Context_Installed (Withn);
6538 -- Here if unit load failed
6541 Error_Msg_Name_1 := Name_System;
6542 Error_Msg_Name_2 := Chars (Expression (System_Extend_Unit));
6544 ("extension package `%.%` does not exist",
6545 Opt.System_Extend_Unit);
6549 end Present_System_Aux;
6551 -------------------------
6552 -- Restore_Scope_Stack --
6553 -------------------------
6555 procedure Restore_Scope_Stack (Handle_Use : Boolean := True) is
6558 Comp_Unit : Node_Id;
6559 In_Child : Boolean := False;
6560 Full_Vis : Boolean := True;
6561 SS_Last : constant Int := Scope_Stack.Last;
6564 -- Restore visibility of previous scope stack, if any
6566 for J in reverse 0 .. Scope_Stack.Last loop
6567 exit when Scope_Stack.Table (J).Entity = Standard_Standard
6568 or else No (Scope_Stack.Table (J).Entity);
6570 S := Scope_Stack.Table (J).Entity;
6572 if not Is_Hidden_Open_Scope (S) then
6574 -- If the parent scope is hidden, its entities are hidden as
6575 -- well, unless the entity is the instantiation currently
6578 if not Is_Hidden_Open_Scope (Scope (S))
6579 or else not Analyzed (Parent (S))
6580 or else Scope (S) = Standard_Standard
6582 Set_Is_Immediately_Visible (S, True);
6585 E := First_Entity (S);
6586 while Present (E) loop
6587 if Is_Child_Unit (E) then
6588 Set_Is_Immediately_Visible (E,
6589 Is_Visible_Child_Unit (E) or else In_Open_Scopes (E));
6591 Set_Is_Immediately_Visible (E, True);
6596 if not Full_Vis then
6597 exit when E = First_Private_Entity (S);
6601 -- The visibility of child units (siblings of current compilation)
6602 -- must be restored in any case. Their declarations may appear
6603 -- after the private part of the parent.
6605 if not Full_Vis then
6606 while Present (E) loop
6607 if Is_Child_Unit (E) then
6608 Set_Is_Immediately_Visible (E,
6609 Is_Visible_Child_Unit (E) or else In_Open_Scopes (E));
6617 if Is_Child_Unit (S)
6618 and not In_Child -- check only for current unit
6622 -- Restore visibility of parents according to whether the child
6623 -- is private and whether we are in its visible part.
6625 Comp_Unit := Parent (Unit_Declaration_Node (S));
6627 if Nkind (Comp_Unit) = N_Compilation_Unit
6628 and then Private_Present (Comp_Unit)
6632 elsif (Ekind (S) = E_Package
6633 or else Ekind (S) = E_Generic_Package)
6634 and then (In_Private_Part (S)
6635 or else In_Package_Body (S))
6639 -- if S is the scope of some instance (which has already been
6640 -- seen on the stack) it does not affect the visibility of
6643 elsif Is_Hidden_Open_Scope (S) then
6646 elsif (Ekind (S) = E_Procedure
6647 or else Ekind (S) = E_Function)
6648 and then Has_Completion (S)
6659 if SS_Last >= Scope_Stack.First
6660 and then Scope_Stack.Table (SS_Last).Entity /= Standard_Standard
6663 Install_Use_Clauses (Scope_Stack.Table (SS_Last).First_Use_Clause);
6665 end Restore_Scope_Stack;
6667 ----------------------
6668 -- Save_Scope_Stack --
6669 ----------------------
6671 procedure Save_Scope_Stack (Handle_Use : Boolean := True) is
6674 SS_Last : constant Int := Scope_Stack.Last;
6677 if SS_Last >= Scope_Stack.First
6678 and then Scope_Stack.Table (SS_Last).Entity /= Standard_Standard
6681 End_Use_Clauses (Scope_Stack.Table (SS_Last).First_Use_Clause);
6684 -- If the call is from within a compilation unit, as when called from
6685 -- Rtsfind, make current entries in scope stack invisible while we
6686 -- analyze the new unit.
6688 for J in reverse 0 .. SS_Last loop
6689 exit when Scope_Stack.Table (J).Entity = Standard_Standard
6690 or else No (Scope_Stack.Table (J).Entity);
6692 S := Scope_Stack.Table (J).Entity;
6693 Set_Is_Immediately_Visible (S, False);
6695 E := First_Entity (S);
6696 while Present (E) loop
6697 Set_Is_Immediately_Visible (E, False);
6703 end Save_Scope_Stack;
6709 procedure Set_Use (L : List_Id) is
6711 Pack_Name : Node_Id;
6718 while Present (Decl) loop
6719 if Nkind (Decl) = N_Use_Package_Clause then
6720 Chain_Use_Clause (Decl);
6722 Pack_Name := First (Names (Decl));
6723 while Present (Pack_Name) loop
6724 Pack := Entity (Pack_Name);
6726 if Ekind (Pack) = E_Package
6727 and then Applicable_Use (Pack_Name)
6729 Use_One_Package (Pack, Decl);
6735 elsif Nkind (Decl) = N_Use_Type_Clause then
6736 Chain_Use_Clause (Decl);
6738 Id := First (Subtype_Marks (Decl));
6739 while Present (Id) loop
6740 if Entity (Id) /= Any_Type then
6753 ---------------------
6754 -- Use_One_Package --
6755 ---------------------
6757 procedure Use_One_Package (P : Entity_Id; N : Node_Id) is
6760 Current_Instance : Entity_Id := Empty;
6762 Private_With_OK : Boolean := False;
6765 if Ekind (P) /= E_Package then
6770 Set_Current_Use_Clause (P, N);
6772 -- Ada 2005 (AI-50217): Check restriction
6774 if From_With_Type (P) then
6775 Error_Msg_N ("limited withed package cannot appear in use clause", N);
6778 -- Find enclosing instance, if any
6781 Current_Instance := Current_Scope;
6782 while not Is_Generic_Instance (Current_Instance) loop
6783 Current_Instance := Scope (Current_Instance);
6786 if No (Hidden_By_Use_Clause (N)) then
6787 Set_Hidden_By_Use_Clause (N, New_Elmt_List);
6791 -- If unit is a package renaming, indicate that the renamed
6792 -- package is also in use (the flags on both entities must
6793 -- remain consistent, and a subsequent use of either of them
6794 -- should be recognized as redundant).
6796 if Present (Renamed_Object (P)) then
6797 Set_In_Use (Renamed_Object (P));
6798 Set_Current_Use_Clause (Renamed_Object (P), N);
6799 Real_P := Renamed_Object (P);
6804 -- Ada 2005 (AI-262): Check the use_clause of a private withed package
6805 -- found in the private part of a package specification
6807 if In_Private_Part (Current_Scope)
6808 and then Has_Private_With (P)
6809 and then Is_Child_Unit (Current_Scope)
6810 and then Is_Child_Unit (P)
6811 and then Is_Ancestor_Package (Scope (Current_Scope), P)
6813 Private_With_OK := True;
6816 -- Loop through entities in one package making them potentially
6819 Id := First_Entity (P);
6821 and then (Id /= First_Private_Entity (P)
6822 or else Private_With_OK) -- Ada 2005 (AI-262)
6824 Prev := Current_Entity (Id);
6825 while Present (Prev) loop
6826 if Is_Immediately_Visible (Prev)
6827 and then (not Is_Overloadable (Prev)
6828 or else not Is_Overloadable (Id)
6829 or else (Type_Conformant (Id, Prev)))
6831 if No (Current_Instance) then
6833 -- Potentially use-visible entity remains hidden
6835 goto Next_Usable_Entity;
6837 -- A use clause within an instance hides outer global entities,
6838 -- which are not used to resolve local entities in the
6839 -- instance. Note that the predefined entities in Standard
6840 -- could not have been hidden in the generic by a use clause,
6841 -- and therefore remain visible. Other compilation units whose
6842 -- entities appear in Standard must be hidden in an instance.
6844 -- To determine whether an entity is external to the instance
6845 -- we compare the scope depth of its scope with that of the
6846 -- current instance. However, a generic actual of a subprogram
6847 -- instance is declared in the wrapper package but will not be
6848 -- hidden by a use-visible entity.
6850 -- If Id is called Standard, the predefined package with the
6851 -- same name is in the homonym chain. It has to be ignored
6852 -- because it has no defined scope (being the only entity in
6853 -- the system with this mandated behavior).
6855 elsif not Is_Hidden (Id)
6856 and then Present (Scope (Prev))
6857 and then not Is_Wrapper_Package (Scope (Prev))
6858 and then Scope_Depth (Scope (Prev)) <
6859 Scope_Depth (Current_Instance)
6860 and then (Scope (Prev) /= Standard_Standard
6861 or else Sloc (Prev) > Standard_Location)
6863 Set_Is_Potentially_Use_Visible (Id);
6864 Set_Is_Immediately_Visible (Prev, False);
6865 Append_Elmt (Prev, Hidden_By_Use_Clause (N));
6868 -- A user-defined operator is not use-visible if the predefined
6869 -- operator for the type is immediately visible, which is the case
6870 -- if the type of the operand is in an open scope. This does not
6871 -- apply to user-defined operators that have operands of different
6872 -- types, because the predefined mixed mode operations (multiply
6873 -- and divide) apply to universal types and do not hide anything.
6875 elsif Ekind (Prev) = E_Operator
6876 and then Operator_Matches_Spec (Prev, Id)
6877 and then In_Open_Scopes
6878 (Scope (Base_Type (Etype (First_Formal (Id)))))
6879 and then (No (Next_Formal (First_Formal (Id)))
6880 or else Etype (First_Formal (Id))
6881 = Etype (Next_Formal (First_Formal (Id)))
6882 or else Chars (Prev) = Name_Op_Expon)
6884 goto Next_Usable_Entity;
6887 Prev := Homonym (Prev);
6890 -- On exit, we know entity is not hidden, unless it is private
6892 if not Is_Hidden (Id)
6893 and then ((not Is_Child_Unit (Id))
6894 or else Is_Visible_Child_Unit (Id))
6896 Set_Is_Potentially_Use_Visible (Id);
6898 if Is_Private_Type (Id)
6899 and then Present (Full_View (Id))
6901 Set_Is_Potentially_Use_Visible (Full_View (Id));
6905 <<Next_Usable_Entity>>
6909 -- Child units are also made use-visible by a use clause, but they may
6910 -- appear after all visible declarations in the parent entity list.
6912 while Present (Id) loop
6913 if Is_Child_Unit (Id)
6914 and then Is_Visible_Child_Unit (Id)
6916 Set_Is_Potentially_Use_Visible (Id);
6922 if Chars (Real_P) = Name_System
6923 and then Scope (Real_P) = Standard_Standard
6924 and then Present_System_Aux (N)
6926 Use_One_Package (System_Aux_Id, N);
6929 end Use_One_Package;
6935 procedure Use_One_Type (Id : Node_Id) is
6937 Is_Known_Used : Boolean;
6941 function Spec_Reloaded_For_Body return Boolean;
6942 -- Determine whether the compilation unit is a package body and the use
6943 -- type clause is in the spec of the same package. Even though the spec
6944 -- was analyzed first, its context is reloaded when analysing the body.
6946 ----------------------------
6947 -- Spec_Reloaded_For_Body --
6948 ----------------------------
6950 function Spec_Reloaded_For_Body return Boolean is
6952 if Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Body then
6954 Spec : constant Node_Id :=
6955 Parent (List_Containing (Parent (Id)));
6958 Nkind (Spec) = N_Package_Specification
6959 and then Corresponding_Body (Parent (Spec)) =
6960 Cunit_Entity (Current_Sem_Unit);
6965 end Spec_Reloaded_For_Body;
6967 -- Start of processing for Use_One_Type;
6970 -- It is the type determined by the subtype mark (8.4(8)) whose
6971 -- operations become potentially use-visible.
6973 T := Base_Type (Entity (Id));
6975 -- Either the type itself is used, the package where it is declared
6976 -- is in use or the entity is declared in the current package, thus
6981 or else In_Use (Scope (T))
6982 or else Scope (T) = Current_Scope;
6984 Set_Redundant_Use (Id,
6985 Is_Known_Used or else Is_Potentially_Use_Visible (T));
6987 if In_Open_Scopes (Scope (T)) then
6990 -- A limited view cannot appear in a use_type clause. However, an
6991 -- access type whose designated type is limited has the flag but
6992 -- is not itself a limited view unless we only have a limited view
6993 -- of its enclosing package.
6995 elsif From_With_Type (T)
6996 and then From_With_Type (Scope (T))
6999 ("incomplete type from limited view "
7000 & "cannot appear in use clause", Id);
7002 -- If the subtype mark designates a subtype in a different package,
7003 -- we have to check that the parent type is visible, otherwise the
7004 -- use type clause is a noop. Not clear how to do that???
7006 elsif not Redundant_Use (Id) then
7008 Set_Current_Use_Clause (T, Parent (Id));
7009 Op_List := Collect_Primitive_Operations (T);
7011 Elmt := First_Elmt (Op_List);
7012 while Present (Elmt) loop
7013 if (Nkind (Node (Elmt)) = N_Defining_Operator_Symbol
7014 or else Chars (Node (Elmt)) in Any_Operator_Name)
7015 and then not Is_Hidden (Node (Elmt))
7017 Set_Is_Potentially_Use_Visible (Node (Elmt));
7024 -- If warning on redundant constructs, check for unnecessary WITH
7026 if Warn_On_Redundant_Constructs
7027 and then Is_Known_Used
7029 -- with P; with P; use P;
7030 -- package P is package X is package body X is
7031 -- type T ... use P.T;
7033 -- The compilation unit is the body of X. GNAT first compiles the
7034 -- spec of X, then proceeds to the body. At that point P is marked
7035 -- as use visible. The analysis then reinstalls the spec along with
7036 -- its context. The use clause P.T is now recognized as redundant,
7037 -- but in the wrong context. Do not emit a warning in such cases.
7039 and then not Spec_Reloaded_For_Body
7041 -- The type already has a use clause
7044 if Present (Current_Use_Clause (T)) then
7046 Clause1 : constant Node_Id := Parent (Id);
7047 Clause2 : constant Node_Id := Current_Use_Clause (T);
7053 if Nkind (Parent (Clause1)) = N_Compilation_Unit
7054 and then Nkind (Parent (Clause2)) = N_Compilation_Unit
7056 -- There is a redundant use type clause in a child unit.
7057 -- Determine which of the units is more deeply nested.
7059 Unit1 := Defining_Entity (Unit (Parent (Clause1)));
7060 Unit2 := Defining_Entity (Unit (Parent (Clause2)));
7062 if Scope (Unit2) = Standard_Standard then
7063 Error_Msg_Sloc := Sloc (Current_Use_Clause (T));
7066 elsif Scope (Unit1) = Standard_Standard then
7067 Error_Msg_Sloc := Sloc (Id);
7071 -- Determine which is the descendant unit
7077 S1 := Scope (Unit1);
7078 S2 := Scope (Unit2);
7079 while S1 /= Standard_Standard
7080 and then S2 /= Standard_Standard
7086 if S1 = Standard_Standard then
7087 Error_Msg_Sloc := Sloc (Id);
7090 Error_Msg_Sloc := Sloc (Current_Use_Clause (T));
7097 ("& is already use-visible through previous "
7098 & "use_type_clause #?", Err_No, Id);
7101 ("& is already use-visible through previous use type "
7102 & "clause?", Id, Id);
7107 ("& is already use-visible through previous use type "
7108 & "clause?", Id, Id);
7111 -- The package where T is declared is already used
7113 elsif In_Use (Scope (T)) then
7114 Error_Msg_Sloc := Sloc (Current_Use_Clause (Scope (T)));
7116 ("& is already use-visible through package use clause #?",
7119 -- The current scope is the package where T is declared
7122 Error_Msg_Node_2 := Scope (T);
7124 ("& is already use-visible inside package &?", Id, Id);
7133 procedure Write_Info is
7134 Id : Entity_Id := First_Entity (Current_Scope);
7137 -- No point in dumping standard entities
7139 if Current_Scope = Standard_Standard then
7143 Write_Str ("========================================================");
7145 Write_Str (" Defined Entities in ");
7146 Write_Name (Chars (Current_Scope));
7148 Write_Str ("========================================================");
7152 Write_Str ("-- none --");
7156 while Present (Id) loop
7157 Write_Entity_Info (Id, " ");
7162 if Scope (Current_Scope) = Standard_Standard then
7164 -- Print information on the current unit itself
7166 Write_Entity_Info (Current_Scope, " ");
7176 procedure Write_Scopes is
7179 for J in reverse 1 .. Scope_Stack.Last loop
7180 S := Scope_Stack.Table (J).Entity;
7181 Write_Int (Int (S));
7182 Write_Str (" === ");
7183 Write_Name (Chars (S));
OSDN Git Service
