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_NE ("invalid use of incomplete type&", Id, T2);
837 elsif Ekind (Etype (T)) = E_Incomplete_Type then
838 Error_Msg_NE ("invalid use of incomplete type&", Id, T);
844 if Ada_Version >= Ada_05
845 and then Nkind (Nam) = N_Attribute_Reference
846 and then Attribute_Name (Nam) = Name_Priority
850 elsif Ada_Version >= Ada_05
851 and then Nkind (Nam) in N_Has_Entity
858 if Nkind (Nam) = N_Attribute_Reference then
859 Nam_Ent := Entity (Prefix (Nam));
861 Nam_Ent := Entity (Nam);
864 Nam_Decl := Parent (Nam_Ent);
866 if Has_Null_Exclusion (N)
867 and then not Has_Null_Exclusion (Nam_Decl)
869 -- Ada 2005 (AI-423): If the object name denotes a generic
870 -- formal object of a generic unit G, and the object renaming
871 -- declaration occurs within the body of G or within the body
872 -- of a generic unit declared within the declarative region
873 -- of G, then the declaration of the formal object of G must
874 -- have a null exclusion.
876 if Is_Formal_Object (Nam_Ent)
877 and then In_Generic_Scope (Id)
880 ("renamed formal does not exclude `NULL` "
881 & "(RM 8.5.1(4.6/2))", N);
883 -- Ada 2005 (AI-423): Otherwise, the subtype of the object name
884 -- shall exclude null.
886 elsif not Can_Never_Be_Null (Etype (Nam_Ent)) then
888 ("renamed object does not exclude `NULL` "
889 & "(RM 8.5.1(4.6/2))", N);
891 elsif Can_Never_Be_Null (Etype (Nam_Ent)) then
893 ("`NOT NULL` not allowed (type of& already excludes null)",
898 elsif Has_Null_Exclusion (N)
899 and then No (Access_Definition (N))
900 and then Can_Never_Be_Null (T)
903 ("`NOT NULL` not allowed (& already excludes null)", N, T);
908 Set_Ekind (Id, E_Variable);
909 Init_Size_Align (Id);
911 if T = Any_Type or else Etype (Nam) = Any_Type then
914 -- Verify that the renamed entity is an object or a function call. It
915 -- may have been rewritten in several ways.
917 elsif Is_Object_Reference (Nam) then
918 if Comes_From_Source (N)
919 and then Is_Dependent_Component_Of_Mutable_Object (Nam)
922 ("illegal renaming of discriminant-dependent component", Nam);
927 -- A static function call may have been folded into a literal
929 elsif Nkind (Original_Node (Nam)) = N_Function_Call
931 -- When expansion is disabled, attribute reference is not
932 -- rewritten as function call. Otherwise it may be rewritten
933 -- as a conversion, so check original node.
935 or else (Nkind (Original_Node (Nam)) = N_Attribute_Reference
936 and then Is_Function_Attribute_Name
937 (Attribute_Name (Original_Node (Nam))))
939 -- Weird but legal, equivalent to renaming a function call.
940 -- Illegal if the literal is the result of constant-folding an
941 -- attribute reference that is not a function.
943 or else (Is_Entity_Name (Nam)
944 and then Ekind (Entity (Nam)) = E_Enumeration_Literal
946 Nkind (Original_Node (Nam)) /= N_Attribute_Reference)
948 or else (Nkind (Nam) = N_Type_Conversion
949 and then Is_Tagged_Type (Entity (Subtype_Mark (Nam))))
953 elsif Nkind (Nam) = N_Type_Conversion then
955 ("renaming of conversion only allowed for tagged types", Nam);
959 elsif Ada_Version >= Ada_05
960 and then Nkind (Nam) = N_Attribute_Reference
961 and then Attribute_Name (Nam) = Name_Priority
965 -- Allow internally generated x'Reference expression
967 elsif Nkind (Nam) = N_Reference then
971 Error_Msg_N ("expect object name in renaming", Nam);
976 if not Is_Variable (Nam) then
977 Set_Ekind (Id, E_Constant);
978 Set_Never_Set_In_Source (Id, True);
979 Set_Is_True_Constant (Id, True);
982 Set_Renamed_Object (Id, Nam);
983 end Analyze_Object_Renaming;
985 ------------------------------
986 -- Analyze_Package_Renaming --
987 ------------------------------
989 procedure Analyze_Package_Renaming (N : Node_Id) is
990 New_P : constant Entity_Id := Defining_Entity (N);
995 if Name (N) = Error then
999 -- Apply Text_IO kludge here, since we may be renaming one of the
1000 -- children of Text_IO.
1002 Text_IO_Kludge (Name (N));
1004 if Current_Scope /= Standard_Standard then
1005 Set_Is_Pure (New_P, Is_Pure (Current_Scope));
1011 if Is_Entity_Name (Name (N)) then
1012 Old_P := Entity (Name (N));
1017 if Etype (Old_P) = Any_Type then
1019 ("expect package name in renaming", Name (N));
1021 elsif Ekind (Old_P) /= E_Package
1022 and then not (Ekind (Old_P) = E_Generic_Package
1023 and then In_Open_Scopes (Old_P))
1025 if Ekind (Old_P) = E_Generic_Package then
1027 ("generic package cannot be renamed as a package", Name (N));
1029 Error_Msg_Sloc := Sloc (Old_P);
1031 ("expect package name in renaming, found& declared#",
1035 -- Set basic attributes to minimize cascaded errors
1037 Set_Ekind (New_P, E_Package);
1038 Set_Etype (New_P, Standard_Void_Type);
1040 -- Here for OK package renaming
1043 -- Entities in the old package are accessible through the renaming
1044 -- entity. The simplest implementation is to have both packages share
1047 Set_Ekind (New_P, E_Package);
1048 Set_Etype (New_P, Standard_Void_Type);
1050 if Present (Renamed_Object (Old_P)) then
1051 Set_Renamed_Object (New_P, Renamed_Object (Old_P));
1053 Set_Renamed_Object (New_P, Old_P);
1056 Set_Has_Completion (New_P);
1058 Set_First_Entity (New_P, First_Entity (Old_P));
1059 Set_Last_Entity (New_P, Last_Entity (Old_P));
1060 Set_First_Private_Entity (New_P, First_Private_Entity (Old_P));
1061 Check_Library_Unit_Renaming (N, Old_P);
1062 Generate_Reference (Old_P, Name (N));
1064 -- If the renaming is in the visible part of a package, then we set
1065 -- Renamed_In_Spec for the renamed package, to prevent giving
1066 -- warnings about no entities referenced. Such a warning would be
1067 -- overenthusiastic, since clients can see entities in the renamed
1068 -- package via the visible package renaming.
1071 Ent : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
1073 if Ekind (Ent) = E_Package
1074 and then not In_Private_Part (Ent)
1075 and then In_Extended_Main_Source_Unit (N)
1076 and then Ekind (Old_P) = E_Package
1078 Set_Renamed_In_Spec (Old_P);
1082 -- If this is the renaming declaration of a package instantiation
1083 -- within itself, it is the declaration that ends the list of actuals
1084 -- for the instantiation. At this point, the subtypes that rename
1085 -- the actuals are flagged as generic, to avoid spurious ambiguities
1086 -- if the actuals for two distinct formals happen to coincide. If
1087 -- the actual is a private type, the subtype has a private completion
1088 -- that is flagged in the same fashion.
1090 -- Resolution is identical to what is was in the original generic.
1091 -- On exit from the generic instance, these are turned into regular
1092 -- subtypes again, so they are compatible with types in their class.
1094 if not Is_Generic_Instance (Old_P) then
1097 Spec := Specification (Unit_Declaration_Node (Old_P));
1100 if Nkind (Spec) = N_Package_Specification
1101 and then Present (Generic_Parent (Spec))
1102 and then Old_P = Current_Scope
1103 and then Chars (New_P) = Chars (Generic_Parent (Spec))
1109 E := First_Entity (Old_P);
1114 and then Nkind (Parent (E)) = N_Subtype_Declaration
1116 Set_Is_Generic_Actual_Type (E);
1118 if Is_Private_Type (E)
1119 and then Present (Full_View (E))
1121 Set_Is_Generic_Actual_Type (Full_View (E));
1130 end Analyze_Package_Renaming;
1132 -------------------------------
1133 -- Analyze_Renamed_Character --
1134 -------------------------------
1136 procedure Analyze_Renamed_Character
1141 C : constant Node_Id := Name (N);
1144 if Ekind (New_S) = E_Function then
1145 Resolve (C, Etype (New_S));
1148 Check_Frozen_Renaming (N, New_S);
1152 Error_Msg_N ("character literal can only be renamed as function", N);
1154 end Analyze_Renamed_Character;
1156 ---------------------------------
1157 -- Analyze_Renamed_Dereference --
1158 ---------------------------------
1160 procedure Analyze_Renamed_Dereference
1165 Nam : constant Node_Id := Name (N);
1166 P : constant Node_Id := Prefix (Nam);
1172 if not Is_Overloaded (P) then
1173 if Ekind (Etype (Nam)) /= E_Subprogram_Type
1174 or else not Type_Conformant (Etype (Nam), New_S) then
1175 Error_Msg_N ("designated type does not match specification", P);
1184 Get_First_Interp (Nam, Ind, It);
1186 while Present (It.Nam) loop
1188 if Ekind (It.Nam) = E_Subprogram_Type
1189 and then Type_Conformant (It.Nam, New_S) then
1191 if Typ /= Any_Id then
1192 Error_Msg_N ("ambiguous renaming", P);
1199 Get_Next_Interp (Ind, It);
1202 if Typ = Any_Type then
1203 Error_Msg_N ("designated type does not match specification", P);
1208 Check_Frozen_Renaming (N, New_S);
1212 end Analyze_Renamed_Dereference;
1214 ---------------------------
1215 -- Analyze_Renamed_Entry --
1216 ---------------------------
1218 procedure Analyze_Renamed_Entry
1223 Nam : constant Node_Id := Name (N);
1224 Sel : constant Node_Id := Selector_Name (Nam);
1228 if Entity (Sel) = Any_Id then
1230 -- Selector is undefined on prefix. Error emitted already
1232 Set_Has_Completion (New_S);
1236 -- Otherwise find renamed entity and build body of New_S as a call to it
1238 Old_S := Find_Renamed_Entity (N, Selector_Name (Nam), New_S);
1240 if Old_S = Any_Id then
1241 Error_Msg_N (" no subprogram or entry matches specification", N);
1244 Check_Subtype_Conformant (New_S, Old_S, N);
1245 Generate_Reference (New_S, Defining_Entity (N), 'b');
1246 Style.Check_Identifier (Defining_Entity (N), New_S);
1249 -- Only mode conformance required for a renaming_as_declaration
1251 Check_Mode_Conformant (New_S, Old_S, N);
1254 Inherit_Renamed_Profile (New_S, Old_S);
1256 -- The prefix can be an arbitrary expression that yields a task
1257 -- type, so it must be resolved.
1259 Resolve (Prefix (Nam), Scope (Old_S));
1262 Set_Convention (New_S, Convention (Old_S));
1263 Set_Has_Completion (New_S, Inside_A_Generic);
1266 Check_Frozen_Renaming (N, New_S);
1268 end Analyze_Renamed_Entry;
1270 -----------------------------------
1271 -- Analyze_Renamed_Family_Member --
1272 -----------------------------------
1274 procedure Analyze_Renamed_Family_Member
1279 Nam : constant Node_Id := Name (N);
1280 P : constant Node_Id := Prefix (Nam);
1284 if (Is_Entity_Name (P) and then Ekind (Entity (P)) = E_Entry_Family)
1285 or else (Nkind (P) = N_Selected_Component
1287 Ekind (Entity (Selector_Name (P))) = E_Entry_Family)
1289 if Is_Entity_Name (P) then
1290 Old_S := Entity (P);
1292 Old_S := Entity (Selector_Name (P));
1295 if not Entity_Matches_Spec (Old_S, New_S) then
1296 Error_Msg_N ("entry family does not match specification", N);
1299 Check_Subtype_Conformant (New_S, Old_S, N);
1300 Generate_Reference (New_S, Defining_Entity (N), 'b');
1301 Style.Check_Identifier (Defining_Entity (N), New_S);
1305 Error_Msg_N ("no entry family matches specification", N);
1308 Set_Has_Completion (New_S, Inside_A_Generic);
1311 Check_Frozen_Renaming (N, New_S);
1313 end Analyze_Renamed_Family_Member;
1315 -----------------------------------------
1316 -- Analyze_Renamed_Primitive_Operation --
1317 -----------------------------------------
1319 procedure Analyze_Renamed_Primitive_Operation
1328 Ctyp : Conformance_Type) return Boolean;
1329 -- Verify that the signatures of the renamed entity and the new entity
1330 -- match. The first formal of the renamed entity is skipped because it
1331 -- is the target object in any subsequent call.
1335 Ctyp : Conformance_Type) return Boolean
1341 if Ekind (Subp) /= Ekind (New_S) then
1345 Old_F := Next_Formal (First_Formal (Subp));
1346 New_F := First_Formal (New_S);
1347 while Present (Old_F) and then Present (New_F) loop
1348 if not Conforming_Types (Etype (Old_F), Etype (New_F), Ctyp) then
1352 if Ctyp >= Mode_Conformant
1353 and then Ekind (Old_F) /= Ekind (New_F)
1358 Next_Formal (New_F);
1359 Next_Formal (Old_F);
1366 if not Is_Overloaded (Selector_Name (Name (N))) then
1367 Old_S := Entity (Selector_Name (Name (N)));
1369 if not Conforms (Old_S, Type_Conformant) then
1374 -- Find the operation that matches the given signature
1382 Get_First_Interp (Selector_Name (Name (N)), Ind, It);
1384 while Present (It.Nam) loop
1385 if Conforms (It.Nam, Type_Conformant) then
1389 Get_Next_Interp (Ind, It);
1394 if Old_S = Any_Id then
1395 Error_Msg_N (" no subprogram or entry matches specification", N);
1399 if not Conforms (Old_S, Subtype_Conformant) then
1400 Error_Msg_N ("subtype conformance error in renaming", N);
1403 Generate_Reference (New_S, Defining_Entity (N), 'b');
1404 Style.Check_Identifier (Defining_Entity (N), New_S);
1407 -- Only mode conformance required for a renaming_as_declaration
1409 if not Conforms (Old_S, Mode_Conformant) then
1410 Error_Msg_N ("mode conformance error in renaming", N);
1414 -- Inherit_Renamed_Profile (New_S, Old_S);
1416 -- The prefix can be an arbitrary expression that yields an
1417 -- object, so it must be resolved.
1419 Resolve (Prefix (Name (N)));
1421 end Analyze_Renamed_Primitive_Operation;
1423 ---------------------------------
1424 -- Analyze_Subprogram_Renaming --
1425 ---------------------------------
1427 procedure Analyze_Subprogram_Renaming (N : Node_Id) is
1428 Formal_Spec : constant Node_Id := Corresponding_Formal_Spec (N);
1429 Is_Actual : constant Boolean := Present (Formal_Spec);
1430 Inst_Node : Node_Id := Empty;
1431 Nam : constant Node_Id := Name (N);
1433 Old_S : Entity_Id := Empty;
1434 Rename_Spec : Entity_Id;
1435 Save_AV : constant Ada_Version_Type := Ada_Version;
1436 Save_AV_Exp : constant Ada_Version_Type := Ada_Version_Explicit;
1437 Spec : constant Node_Id := Specification (N);
1439 procedure Check_Null_Exclusion
1442 -- Ada 2005 (AI-423): Given renaming Ren of subprogram Sub, check the
1443 -- following AI rules:
1445 -- If Ren is a renaming of a formal subprogram and one of its
1446 -- parameters has a null exclusion, then the corresponding formal
1447 -- in Sub must also have one. Otherwise the subtype of the Sub's
1448 -- formal parameter must exclude null.
1450 -- If Ren is a renaming of a formal function and its return
1451 -- profile has a null exclusion, then Sub's return profile must
1452 -- have one. Otherwise the subtype of Sub's return profile must
1455 function Original_Subprogram (Subp : Entity_Id) return Entity_Id;
1456 -- Find renamed entity when the declaration is a renaming_as_body and
1457 -- the renamed entity may itself be a renaming_as_body. Used to enforce
1458 -- rule that a renaming_as_body is illegal if the declaration occurs
1459 -- before the subprogram it completes is frozen, and renaming indirectly
1460 -- renames the subprogram itself.(Defect Report 8652/0027).
1462 --------------------------
1463 -- Check_Null_Exclusion --
1464 --------------------------
1466 procedure Check_Null_Exclusion
1470 Ren_Formal : Entity_Id;
1471 Sub_Formal : Entity_Id;
1476 Ren_Formal := First_Formal (Ren);
1477 Sub_Formal := First_Formal (Sub);
1478 while Present (Ren_Formal)
1479 and then Present (Sub_Formal)
1481 if Has_Null_Exclusion (Parent (Ren_Formal))
1483 not (Has_Null_Exclusion (Parent (Sub_Formal))
1484 or else Can_Never_Be_Null (Etype (Sub_Formal)))
1487 ("`NOT NULL` required for parameter &",
1488 Parent (Sub_Formal), Sub_Formal);
1491 Next_Formal (Ren_Formal);
1492 Next_Formal (Sub_Formal);
1495 -- Return profile check
1497 if Nkind (Parent (Ren)) = N_Function_Specification
1498 and then Nkind (Parent (Sub)) = N_Function_Specification
1499 and then Has_Null_Exclusion (Parent (Ren))
1501 not (Has_Null_Exclusion (Parent (Sub))
1502 or else Can_Never_Be_Null (Etype (Sub)))
1505 ("return must specify `NOT NULL`",
1506 Result_Definition (Parent (Sub)));
1508 end Check_Null_Exclusion;
1510 -------------------------
1511 -- Original_Subprogram --
1512 -------------------------
1514 function Original_Subprogram (Subp : Entity_Id) return Entity_Id is
1515 Orig_Decl : Node_Id;
1516 Orig_Subp : Entity_Id;
1519 -- First case: renamed entity is itself a renaming
1521 if Present (Alias (Subp)) then
1522 return Alias (Subp);
1525 Nkind (Unit_Declaration_Node (Subp)) = N_Subprogram_Declaration
1527 (Corresponding_Body (Unit_Declaration_Node (Subp)))
1529 -- Check if renamed entity is a renaming_as_body
1532 Unit_Declaration_Node
1533 (Corresponding_Body (Unit_Declaration_Node (Subp)));
1535 if Nkind (Orig_Decl) = N_Subprogram_Renaming_Declaration then
1536 Orig_Subp := Entity (Name (Orig_Decl));
1538 if Orig_Subp = Rename_Spec then
1540 -- Circularity detected
1545 return (Original_Subprogram (Orig_Subp));
1553 end Original_Subprogram;
1555 -- Start of processing for Analyze_Subprogram_Renaming
1558 -- We must test for the attribute renaming case before the Analyze
1559 -- call because otherwise Sem_Attr will complain that the attribute
1560 -- is missing an argument when it is analyzed.
1562 if Nkind (Nam) = N_Attribute_Reference then
1564 -- In the case of an abstract formal subprogram association, rewrite
1565 -- an actual given by a stream attribute as the name of the
1566 -- corresponding stream primitive of the type.
1568 -- In a generic context the stream operations are not generated, and
1569 -- this must be treated as a normal attribute reference, to be
1570 -- expanded in subsequent instantiations.
1572 if Is_Actual and then Is_Abstract_Subprogram (Formal_Spec)
1573 and then Expander_Active
1576 Stream_Prim : Entity_Id;
1577 Prefix_Type : constant Entity_Id := Entity (Prefix (Nam));
1580 -- The class-wide forms of the stream attributes are not
1581 -- primitive dispatching operations (even though they
1582 -- internally dispatch to a stream attribute).
1584 if Is_Class_Wide_Type (Prefix_Type) then
1586 ("attribute must be a primitive dispatching operation",
1591 -- Retrieve the primitive subprogram associated with the
1592 -- attribute. This can only be a stream attribute, since those
1593 -- are the only ones that are dispatching (and the actual for
1594 -- an abstract formal subprogram must be dispatching
1598 case Attribute_Name (Nam) is
1601 Find_Prim_Op (Prefix_Type, TSS_Stream_Input);
1604 Find_Prim_Op (Prefix_Type, TSS_Stream_Output);
1607 Find_Prim_Op (Prefix_Type, TSS_Stream_Read);
1610 Find_Prim_Op (Prefix_Type, TSS_Stream_Write);
1613 ("attribute must be a primitive"
1614 & " dispatching operation", Nam);
1620 -- If no operation was found, and the type is limited,
1621 -- the user should have defined one.
1623 when Program_Error =>
1624 if Is_Limited_Type (Prefix_Type) then
1626 ("stream operation not defined for type&",
1630 -- Otherwise, compiler should have generated default
1637 -- Rewrite the attribute into the name of its corresponding
1638 -- primitive dispatching subprogram. We can then proceed with
1639 -- the usual processing for subprogram renamings.
1642 Prim_Name : constant Node_Id :=
1643 Make_Identifier (Sloc (Nam),
1644 Chars => Chars (Stream_Prim));
1646 Set_Entity (Prim_Name, Stream_Prim);
1647 Rewrite (Nam, Prim_Name);
1652 -- Normal processing for a renaming of an attribute
1655 Attribute_Renaming (N);
1660 -- Check whether this declaration corresponds to the instantiation
1661 -- of a formal subprogram.
1663 -- If this is an instantiation, the corresponding actual is frozen and
1664 -- error messages can be made more precise. If this is a default
1665 -- subprogram, the entity is already established in the generic, and is
1666 -- not retrieved by visibility. If it is a default with a box, the
1667 -- candidate interpretations, if any, have been collected when building
1668 -- the renaming declaration. If overloaded, the proper interpretation is
1669 -- determined in Find_Renamed_Entity. If the entity is an operator,
1670 -- Find_Renamed_Entity applies additional visibility checks.
1673 Inst_Node := Unit_Declaration_Node (Formal_Spec);
1675 if Is_Entity_Name (Nam)
1676 and then Present (Entity (Nam))
1677 and then not Comes_From_Source (Nam)
1678 and then not Is_Overloaded (Nam)
1680 Old_S := Entity (Nam);
1681 New_S := Analyze_Subprogram_Specification (Spec);
1685 if Ekind (Entity (Nam)) = E_Operator then
1689 if Box_Present (Inst_Node) then
1690 Old_S := Find_Renamed_Entity (N, Name (N), New_S, Is_Actual);
1692 -- If there is an immediately visible homonym of the operator
1693 -- and the declaration has a default, this is worth a warning
1694 -- because the user probably did not intend to get the pre-
1695 -- defined operator, visible in the generic declaration. To
1696 -- find if there is an intended candidate, analyze the renaming
1697 -- again in the current context.
1699 elsif Scope (Old_S) = Standard_Standard
1700 and then Present (Default_Name (Inst_Node))
1703 Decl : constant Node_Id := New_Copy_Tree (N);
1707 Set_Entity (Name (Decl), Empty);
1708 Analyze (Name (Decl));
1710 Find_Renamed_Entity (Decl, Name (Decl), New_S, True);
1713 and then In_Open_Scopes (Scope (Hidden))
1714 and then Is_Immediately_Visible (Hidden)
1715 and then Comes_From_Source (Hidden)
1716 and then Hidden /= Old_S
1718 Error_Msg_Sloc := Sloc (Hidden);
1719 Error_Msg_N ("?default subprogram is resolved " &
1720 "in the generic declaration " &
1721 "(RM 12.6(17))", N);
1722 Error_Msg_NE ("\?and will not use & #", N, Hidden);
1730 New_S := Analyze_Subprogram_Specification (Spec);
1734 -- Renamed entity must be analyzed first, to avoid being hidden by
1735 -- new name (which might be the same in a generic instance).
1739 -- The renaming defines a new overloaded entity, which is analyzed
1740 -- like a subprogram declaration.
1742 New_S := Analyze_Subprogram_Specification (Spec);
1745 if Current_Scope /= Standard_Standard then
1746 Set_Is_Pure (New_S, Is_Pure (Current_Scope));
1749 Rename_Spec := Find_Corresponding_Spec (N);
1751 -- Case of Renaming_As_Body
1753 if Present (Rename_Spec) then
1755 -- Renaming declaration is the completion of the declaration of
1756 -- Rename_Spec. We build an actual body for it at the freezing point.
1758 Set_Corresponding_Spec (N, Rename_Spec);
1760 -- Deal with special case of stream functions of abstract types
1763 if Nkind (Unit_Declaration_Node (Rename_Spec)) =
1764 N_Abstract_Subprogram_Declaration
1766 -- Input stream functions are abstract if the object type is
1767 -- abstract. Similarly, all default stream functions for an
1768 -- interface type are abstract. However, these subprograms may
1769 -- receive explicit declarations in representation clauses, making
1770 -- the attribute subprograms usable as defaults in subsequent
1772 -- In this case we rewrite the declaration to make the subprogram
1773 -- non-abstract. We remove the previous declaration, and insert
1774 -- the new one at the point of the renaming, to prevent premature
1775 -- access to unfrozen types. The new declaration reuses the
1776 -- specification of the previous one, and must not be analyzed.
1779 (Is_Primitive (Entity (Nam))
1781 Is_Abstract_Type (Find_Dispatching_Type (Entity (Nam))));
1783 Old_Decl : constant Node_Id :=
1784 Unit_Declaration_Node (Rename_Spec);
1785 New_Decl : constant Node_Id :=
1786 Make_Subprogram_Declaration (Sloc (N),
1788 Relocate_Node (Specification (Old_Decl)));
1791 Insert_After (N, New_Decl);
1792 Set_Is_Abstract_Subprogram (Rename_Spec, False);
1793 Set_Analyzed (New_Decl);
1797 Set_Corresponding_Body (Unit_Declaration_Node (Rename_Spec), New_S);
1799 if Ada_Version = Ada_83 and then Comes_From_Source (N) then
1800 Error_Msg_N ("(Ada 83) renaming cannot serve as a body", N);
1803 Set_Convention (New_S, Convention (Rename_Spec));
1804 Check_Fully_Conformant (New_S, Rename_Spec);
1805 Set_Public_Status (New_S);
1807 -- The specification does not introduce new formals, but only
1808 -- repeats the formals of the original subprogram declaration.
1809 -- For cross-reference purposes, and for refactoring tools, we
1810 -- treat the formals of the renaming declaration as body formals.
1812 Reference_Body_Formals (Rename_Spec, New_S);
1814 -- Indicate that the entity in the declaration functions like the
1815 -- corresponding body, and is not a new entity. The body will be
1816 -- constructed later at the freeze point, so indicate that the
1817 -- completion has not been seen yet.
1819 Set_Ekind (New_S, E_Subprogram_Body);
1820 New_S := Rename_Spec;
1821 Set_Has_Completion (Rename_Spec, False);
1823 -- Ada 2005: check overriding indicator
1825 if Must_Override (Specification (N))
1826 and then not Is_Overriding_Operation (Rename_Spec)
1828 Error_Msg_NE ("subprogram& is not overriding", N, Rename_Spec);
1830 elsif Must_Not_Override (Specification (N))
1831 and then Is_Overriding_Operation (Rename_Spec)
1834 ("subprogram& overrides inherited operation", N, Rename_Spec);
1837 -- Normal subprogram renaming (not renaming as body)
1840 Generate_Definition (New_S);
1841 New_Overloaded_Entity (New_S);
1843 if Is_Entity_Name (Nam)
1844 and then Is_Intrinsic_Subprogram (Entity (Nam))
1848 Check_Delayed_Subprogram (New_S);
1852 -- There is no need for elaboration checks on the new entity, which may
1853 -- be called before the next freezing point where the body will appear.
1854 -- Elaboration checks refer to the real entity, not the one created by
1855 -- the renaming declaration.
1857 Set_Kill_Elaboration_Checks (New_S, True);
1859 if Etype (Nam) = Any_Type then
1860 Set_Has_Completion (New_S);
1863 elsif Nkind (Nam) = N_Selected_Component then
1865 -- A prefix of the form A.B can designate an entry of task A, a
1866 -- protected operation of protected object A, or finally a primitive
1867 -- operation of object A. In the later case, A is an object of some
1868 -- tagged type, or an access type that denotes one such. To further
1869 -- distinguish these cases, note that the scope of a task entry or
1870 -- protected operation is type of the prefix.
1872 -- The prefix could be an overloaded function call that returns both
1873 -- kinds of operations. This overloading pathology is left to the
1874 -- dedicated reader ???
1877 T : constant Entity_Id := Etype (Prefix (Nam));
1886 Is_Tagged_Type (Designated_Type (T))))
1887 and then Scope (Entity (Selector_Name (Nam))) /= T
1889 Analyze_Renamed_Primitive_Operation
1890 (N, New_S, Present (Rename_Spec));
1894 -- Renamed entity is an entry or protected operation. For those
1895 -- cases an explicit body is built (at the point of freezing of
1896 -- this entity) that contains a call to the renamed entity.
1898 -- This is not allowed for renaming as body if the renamed
1899 -- spec is already frozen (see RM 8.5.4(5) for details).
1901 if Present (Rename_Spec)
1902 and then Is_Frozen (Rename_Spec)
1905 ("renaming-as-body cannot rename entry as subprogram", N);
1907 ("\since & is already frozen (RM 8.5.4(5))",
1910 Analyze_Renamed_Entry (N, New_S, Present (Rename_Spec));
1917 elsif Nkind (Nam) = N_Explicit_Dereference then
1919 -- Renamed entity is designated by access_to_subprogram expression.
1920 -- Must build body to encapsulate call, as in the entry case.
1922 Analyze_Renamed_Dereference (N, New_S, Present (Rename_Spec));
1925 elsif Nkind (Nam) = N_Indexed_Component then
1926 Analyze_Renamed_Family_Member (N, New_S, Present (Rename_Spec));
1929 elsif Nkind (Nam) = N_Character_Literal then
1930 Analyze_Renamed_Character (N, New_S, Present (Rename_Spec));
1933 elsif (not Is_Entity_Name (Nam)
1934 and then Nkind (Nam) /= N_Operator_Symbol)
1935 or else not Is_Overloadable (Entity (Nam))
1937 Error_Msg_N ("expect valid subprogram name in renaming", N);
1941 -- Find the renamed entity that matches the given specification. Disable
1942 -- Ada_83 because there is no requirement of full conformance between
1943 -- renamed entity and new entity, even though the same circuit is used.
1945 -- This is a bit of a kludge, which introduces a really irregular use of
1946 -- Ada_Version[_Explicit]. Would be nice to find cleaner way to do this
1949 Ada_Version := Ada_Version_Type'Max (Ada_Version, Ada_95);
1950 Ada_Version_Explicit := Ada_Version;
1953 Old_S := Find_Renamed_Entity (N, Name (N), New_S, Is_Actual);
1955 -- When the renamed subprogram is overloaded and used as an actual
1956 -- of a generic, its entity is set to the first available homonym.
1957 -- We must first disambiguate the name, then set the proper entity.
1960 and then Is_Overloaded (Nam)
1962 Set_Entity (Nam, Old_S);
1966 -- Most common case: subprogram renames subprogram. No body is generated
1967 -- in this case, so we must indicate the declaration is complete as is.
1969 if No (Rename_Spec) then
1970 Set_Has_Completion (New_S);
1971 Set_Is_Pure (New_S, Is_Pure (Entity (Nam)));
1972 Set_Is_Preelaborated (New_S, Is_Preelaborated (Entity (Nam)));
1974 -- Ada 2005 (AI-423): Check the consistency of null exclusions
1975 -- between a subprogram and its correct renaming.
1977 -- Note: the Any_Id check is a guard that prevents compiler crashes
1978 -- when performing a null exclusion check between a renaming and a
1979 -- renamed subprogram that has been found to be illegal.
1981 if Ada_Version >= Ada_05
1982 and then Entity (Nam) /= Any_Id
1984 Check_Null_Exclusion
1986 Sub => Entity (Nam));
1989 -- Enforce the Ada 2005 rule that the renamed entity cannot require
1990 -- overriding. The flag Requires_Overriding is set very selectively
1991 -- and misses some other illegal cases. The additional conditions
1992 -- checked below are sufficient but not necessary ???
1994 -- The rule does not apply to the renaming generated for an actual
1995 -- subprogram in an instance.
2000 -- Guard against previous errors, and omit renamings of predefined
2003 elsif Ekind (Old_S) /= E_Function
2004 and then Ekind (Old_S) /= E_Procedure
2008 elsif Requires_Overriding (Old_S)
2010 (Is_Abstract_Subprogram (Old_S)
2011 and then Present (Find_Dispatching_Type (Old_S))
2013 not Is_Abstract_Type (Find_Dispatching_Type (Old_S)))
2016 ("renamed entity cannot be "
2017 & "subprogram that requires overriding (RM 8.5.4 (5.1))", N);
2021 if Old_S /= Any_Id then
2023 and then From_Default (N)
2025 -- This is an implicit reference to the default actual
2027 Generate_Reference (Old_S, Nam, Typ => 'i', Force => True);
2029 Generate_Reference (Old_S, Nam);
2032 -- For a renaming-as-body, require subtype conformance, but if the
2033 -- declaration being completed has not been frozen, then inherit the
2034 -- convention of the renamed subprogram prior to checking conformance
2035 -- (unless the renaming has an explicit convention established; the
2036 -- rule stated in the RM doesn't seem to address this ???).
2038 if Present (Rename_Spec) then
2039 Generate_Reference (Rename_Spec, Defining_Entity (Spec), 'b');
2040 Style.Check_Identifier (Defining_Entity (Spec), Rename_Spec);
2042 if not Is_Frozen (Rename_Spec) then
2043 if not Has_Convention_Pragma (Rename_Spec) then
2044 Set_Convention (New_S, Convention (Old_S));
2047 if Ekind (Old_S) /= E_Operator then
2048 Check_Mode_Conformant (New_S, Old_S, Spec);
2051 if Original_Subprogram (Old_S) = Rename_Spec then
2052 Error_Msg_N ("unfrozen subprogram cannot rename itself ", N);
2055 Check_Subtype_Conformant (New_S, Old_S, Spec);
2058 Check_Frozen_Renaming (N, Rename_Spec);
2060 -- Check explicitly that renamed entity is not intrinsic, because
2061 -- in in a generic the renamed body is not built. In this case,
2062 -- the renaming_as_body is a completion.
2064 if Inside_A_Generic then
2065 if Is_Frozen (Rename_Spec)
2066 and then Is_Intrinsic_Subprogram (Old_S)
2069 ("subprogram in renaming_as_body cannot be intrinsic",
2073 Set_Has_Completion (Rename_Spec);
2076 elsif Ekind (Old_S) /= E_Operator then
2077 Check_Mode_Conformant (New_S, Old_S);
2080 and then Error_Posted (New_S)
2082 Error_Msg_NE ("invalid actual subprogram: & #!", N, Old_S);
2086 if No (Rename_Spec) then
2088 -- The parameter profile of the new entity is that of the renamed
2089 -- entity: the subtypes given in the specification are irrelevant.
2091 Inherit_Renamed_Profile (New_S, Old_S);
2093 -- A call to the subprogram is transformed into a call to the
2094 -- renamed entity. This is transitive if the renamed entity is
2095 -- itself a renaming.
2097 if Present (Alias (Old_S)) then
2098 Set_Alias (New_S, Alias (Old_S));
2100 Set_Alias (New_S, Old_S);
2103 -- Note that we do not set Is_Intrinsic_Subprogram if we have a
2104 -- renaming as body, since the entity in this case is not an
2105 -- intrinsic (it calls an intrinsic, but we have a real body for
2106 -- this call, and it is in this body that the required intrinsic
2107 -- processing will take place).
2109 -- Also, if this is a renaming of inequality, the renamed operator
2110 -- is intrinsic, but what matters is the corresponding equality
2111 -- operator, which may be user-defined.
2113 Set_Is_Intrinsic_Subprogram
2115 Is_Intrinsic_Subprogram (Old_S)
2117 (Chars (Old_S) /= Name_Op_Ne
2118 or else Ekind (Old_S) = E_Operator
2120 Is_Intrinsic_Subprogram
2121 (Corresponding_Equality (Old_S))));
2123 if Ekind (Alias (New_S)) = E_Operator then
2124 Set_Has_Delayed_Freeze (New_S, False);
2127 -- If the renaming corresponds to an association for an abstract
2128 -- formal subprogram, then various attributes must be set to
2129 -- indicate that the renaming is an abstract dispatching operation
2130 -- with a controlling type.
2132 if Is_Actual and then Is_Abstract_Subprogram (Formal_Spec) then
2134 -- Mark the renaming as abstract here, so Find_Dispatching_Type
2135 -- see it as corresponding to a generic association for a
2136 -- formal abstract subprogram
2138 Set_Is_Abstract_Subprogram (New_S);
2141 New_S_Ctrl_Type : constant Entity_Id :=
2142 Find_Dispatching_Type (New_S);
2143 Old_S_Ctrl_Type : constant Entity_Id :=
2144 Find_Dispatching_Type (Old_S);
2147 if Old_S_Ctrl_Type /= New_S_Ctrl_Type then
2149 ("actual must be dispatching subprogram for type&",
2150 Nam, New_S_Ctrl_Type);
2153 Set_Is_Dispatching_Operation (New_S);
2154 Check_Controlling_Formals (New_S_Ctrl_Type, New_S);
2156 -- If the actual in the formal subprogram is itself a
2157 -- formal abstract subprogram association, there's no
2158 -- dispatch table component or position to inherit.
2160 if Present (DTC_Entity (Old_S)) then
2161 Set_DTC_Entity (New_S, DTC_Entity (Old_S));
2162 Set_DT_Position (New_S, DT_Position (Old_S));
2170 and then (Old_S = New_S
2171 or else (Nkind (Nam) /= N_Expanded_Name
2172 and then Chars (Old_S) = Chars (New_S)))
2174 Error_Msg_N ("subprogram cannot rename itself", N);
2177 Set_Convention (New_S, Convention (Old_S));
2179 if Is_Abstract_Subprogram (Old_S) then
2180 if Present (Rename_Spec) then
2182 ("a renaming-as-body cannot rename an abstract subprogram",
2184 Set_Has_Completion (Rename_Spec);
2186 Set_Is_Abstract_Subprogram (New_S);
2190 Check_Library_Unit_Renaming (N, Old_S);
2192 -- Pathological case: procedure renames entry in the scope of its
2193 -- task. Entry is given by simple name, but body must be built for
2194 -- procedure. Of course if called it will deadlock.
2196 if Ekind (Old_S) = E_Entry then
2197 Set_Has_Completion (New_S, False);
2198 Set_Alias (New_S, Empty);
2202 Freeze_Before (N, Old_S);
2203 Set_Has_Delayed_Freeze (New_S, False);
2204 Freeze_Before (N, New_S);
2206 -- An abstract subprogram is only allowed as an actual in the case
2207 -- where the formal subprogram is also abstract.
2209 if (Ekind (Old_S) = E_Procedure or else Ekind (Old_S) = E_Function)
2210 and then Is_Abstract_Subprogram (Old_S)
2211 and then not Is_Abstract_Subprogram (Formal_Spec)
2214 ("abstract subprogram not allowed as generic actual", Nam);
2219 -- A common error is to assume that implicit operators for types are
2220 -- defined in Standard, or in the scope of a subtype. In those cases
2221 -- where the renamed entity is given with an expanded name, it is
2222 -- worth mentioning that operators for the type are not declared in
2223 -- the scope given by the prefix.
2225 if Nkind (Nam) = N_Expanded_Name
2226 and then Nkind (Selector_Name (Nam)) = N_Operator_Symbol
2227 and then Scope (Entity (Nam)) = Standard_Standard
2230 T : constant Entity_Id :=
2231 Base_Type (Etype (First_Formal (New_S)));
2233 Error_Msg_Node_2 := Prefix (Nam);
2235 ("operator for type& is not declared in&", Prefix (Nam), T);
2240 ("no visible subprogram matches the specification for&",
2244 if Present (Candidate_Renaming) then
2250 F1 := First_Formal (Candidate_Renaming);
2251 F2 := First_Formal (New_S);
2253 while Present (F1) and then Present (F2) loop
2258 if Present (F1) and then Present (Default_Value (F1)) then
2259 if Present (Next_Formal (F1)) then
2261 ("\missing specification for &" &
2262 " and other formals with defaults", Spec, F1);
2265 ("\missing specification for &", Spec, F1);
2272 -- Ada 2005 AI 404: if the new subprogram is dispatching, verify that
2273 -- controlling access parameters are known non-null for the renamed
2274 -- subprogram. Test also applies to a subprogram instantiation that
2275 -- is dispatching. Test is skipped if some previous error was detected
2276 -- that set Old_S to Any_Id.
2278 if Ada_Version >= Ada_05
2279 and then Old_S /= Any_Id
2280 and then not Is_Dispatching_Operation (Old_S)
2281 and then Is_Dispatching_Operation (New_S)
2288 Old_F := First_Formal (Old_S);
2289 New_F := First_Formal (New_S);
2290 while Present (Old_F) loop
2291 if Ekind (Etype (Old_F)) = E_Anonymous_Access_Type
2292 and then Is_Controlling_Formal (New_F)
2293 and then not Can_Never_Be_Null (Old_F)
2295 Error_Msg_N ("access parameter is controlling,", New_F);
2297 ("\corresponding parameter of& "
2298 & "must be explicitly null excluding", New_F, Old_S);
2301 Next_Formal (Old_F);
2302 Next_Formal (New_F);
2307 -- A useful warning, suggested by Ada Bug Finder (Ada-Europe 2005)
2309 if Comes_From_Source (N)
2310 and then Present (Old_S)
2311 and then Nkind (Old_S) = N_Defining_Operator_Symbol
2312 and then Nkind (New_S) = N_Defining_Operator_Symbol
2313 and then Chars (Old_S) /= Chars (New_S)
2316 ("?& is being renamed as a different operator",
2320 -- Another warning or some utility: if the new subprogram as the same
2321 -- name as the old one, the old one is not hidden by an outer homograph,
2322 -- the new one is not a public symbol, and the old one is otherwise
2323 -- directly visible, the renaming is superfluous.
2325 if Chars (Old_S) = Chars (New_S)
2326 and then Comes_From_Source (N)
2327 and then Scope (Old_S) /= Standard_Standard
2328 and then Warn_On_Redundant_Constructs
2330 (Is_Immediately_Visible (Old_S)
2331 or else Is_Potentially_Use_Visible (Old_S))
2332 and then Is_Overloadable (Current_Scope)
2333 and then Chars (Current_Scope) /= Chars (Old_S)
2336 ("?redundant renaming, entity is directly visible", Name (N));
2339 Ada_Version := Save_AV;
2340 Ada_Version_Explicit := Save_AV_Exp;
2341 end Analyze_Subprogram_Renaming;
2343 -------------------------
2344 -- Analyze_Use_Package --
2345 -------------------------
2347 -- Resolve the package names in the use clause, and make all the visible
2348 -- entities defined in the package potentially use-visible. If the package
2349 -- is already in use from a previous use clause, its visible entities are
2350 -- already use-visible. In that case, mark the occurrence as a redundant
2351 -- use. If the package is an open scope, i.e. if the use clause occurs
2352 -- within the package itself, ignore it.
2354 procedure Analyze_Use_Package (N : Node_Id) is
2355 Pack_Name : Node_Id;
2358 -- Start of processing for Analyze_Use_Package
2361 Set_Hidden_By_Use_Clause (N, No_Elist);
2363 -- Use clause is not allowed in a spec of a predefined package
2364 -- declaration except that packages whose file name starts a-n are OK
2365 -- (these are children of Ada.Numerics, and such packages are never
2366 -- loaded by Rtsfind).
2368 if Is_Predefined_File_Name (Unit_File_Name (Current_Sem_Unit))
2369 and then Name_Buffer (1 .. 3) /= "a-n"
2371 Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Declaration
2373 Error_Msg_N ("use clause not allowed in predefined spec", N);
2376 -- Chain clause to list of use clauses in current scope
2378 if Nkind (Parent (N)) /= N_Compilation_Unit then
2379 Chain_Use_Clause (N);
2382 -- Loop through package names to identify referenced packages
2384 Pack_Name := First (Names (N));
2385 while Present (Pack_Name) loop
2386 Analyze (Pack_Name);
2388 if Nkind (Parent (N)) = N_Compilation_Unit
2389 and then Nkind (Pack_Name) = N_Expanded_Name
2395 Pref := Prefix (Pack_Name);
2396 while Nkind (Pref) = N_Expanded_Name loop
2397 Pref := Prefix (Pref);
2400 if Entity (Pref) = Standard_Standard then
2402 ("predefined package Standard cannot appear"
2403 & " in a context clause", Pref);
2411 -- Loop through package names to mark all entities as potentially
2414 Pack_Name := First (Names (N));
2415 while Present (Pack_Name) loop
2416 if Is_Entity_Name (Pack_Name) then
2417 Pack := Entity (Pack_Name);
2419 if Ekind (Pack) /= E_Package
2420 and then Etype (Pack) /= Any_Type
2422 if Ekind (Pack) = E_Generic_Package then
2424 ("a generic package is not allowed in a use clause",
2427 Error_Msg_N ("& is not a usable package", Pack_Name);
2431 if Nkind (Parent (N)) = N_Compilation_Unit then
2432 Check_In_Previous_With_Clause (N, Pack_Name);
2435 if Applicable_Use (Pack_Name) then
2436 Use_One_Package (Pack, N);
2440 -- Report error because name denotes something other than a package
2443 Error_Msg_N ("& is not a package", Pack_Name);
2448 end Analyze_Use_Package;
2450 ----------------------
2451 -- Analyze_Use_Type --
2452 ----------------------
2454 procedure Analyze_Use_Type (N : Node_Id) is
2459 Set_Hidden_By_Use_Clause (N, No_Elist);
2461 -- Chain clause to list of use clauses in current scope
2463 if Nkind (Parent (N)) /= N_Compilation_Unit then
2464 Chain_Use_Clause (N);
2467 Id := First (Subtype_Marks (N));
2468 while Present (Id) loop
2472 if E /= Any_Type then
2475 if Nkind (Parent (N)) = N_Compilation_Unit then
2476 if Nkind (Id) = N_Identifier then
2477 Error_Msg_N ("type is not directly visible", Id);
2479 elsif Is_Child_Unit (Scope (E))
2480 and then Scope (E) /= System_Aux_Id
2482 Check_In_Previous_With_Clause (N, Prefix (Id));
2489 end Analyze_Use_Type;
2491 --------------------
2492 -- Applicable_Use --
2493 --------------------
2495 function Applicable_Use (Pack_Name : Node_Id) return Boolean is
2496 Pack : constant Entity_Id := Entity (Pack_Name);
2499 if In_Open_Scopes (Pack) then
2500 if Warn_On_Redundant_Constructs
2501 and then Pack = Current_Scope
2504 ("& is already use-visible within itself?", Pack_Name, Pack);
2509 elsif In_Use (Pack) then
2510 Note_Redundant_Use (Pack_Name);
2513 elsif Present (Renamed_Object (Pack))
2514 and then In_Use (Renamed_Object (Pack))
2516 Note_Redundant_Use (Pack_Name);
2524 ------------------------
2525 -- Attribute_Renaming --
2526 ------------------------
2528 procedure Attribute_Renaming (N : Node_Id) is
2529 Loc : constant Source_Ptr := Sloc (N);
2530 Nam : constant Node_Id := Name (N);
2531 Spec : constant Node_Id := Specification (N);
2532 New_S : constant Entity_Id := Defining_Unit_Name (Spec);
2533 Aname : constant Name_Id := Attribute_Name (Nam);
2535 Form_Num : Nat := 0;
2536 Expr_List : List_Id := No_List;
2538 Attr_Node : Node_Id;
2539 Body_Node : Node_Id;
2540 Param_Spec : Node_Id;
2543 Generate_Definition (New_S);
2545 -- This procedure is called in the context of subprogram renaming,
2546 -- and thus the attribute must be one that is a subprogram. All of
2547 -- those have at least one formal parameter, with the singular
2548 -- exception of AST_Entry (which is a real oddity, it is odd that
2549 -- this can be renamed at all!)
2551 if not Is_Non_Empty_List (Parameter_Specifications (Spec)) then
2552 if Aname /= Name_AST_Entry then
2554 ("subprogram renaming an attribute must have formals", N);
2559 Param_Spec := First (Parameter_Specifications (Spec));
2560 while Present (Param_Spec) loop
2561 Form_Num := Form_Num + 1;
2563 if Nkind (Parameter_Type (Param_Spec)) /= N_Access_Definition then
2564 Find_Type (Parameter_Type (Param_Spec));
2566 -- The profile of the new entity denotes the base type (s) of
2567 -- the types given in the specification. For access parameters
2568 -- there are no subtypes involved.
2570 Rewrite (Parameter_Type (Param_Spec),
2572 (Base_Type (Entity (Parameter_Type (Param_Spec))), Loc));
2575 if No (Expr_List) then
2576 Expr_List := New_List;
2579 Append_To (Expr_List,
2580 Make_Identifier (Loc,
2581 Chars => Chars (Defining_Identifier (Param_Spec))));
2583 -- The expressions in the attribute reference are not freeze
2584 -- points. Neither is the attribute as a whole, see below.
2586 Set_Must_Not_Freeze (Last (Expr_List));
2591 -- Immediate error if too many formals. Other mismatches in numbers
2592 -- of number of types of parameters are detected when we analyze the
2593 -- body of the subprogram that we construct.
2595 if Form_Num > 2 then
2596 Error_Msg_N ("too many formals for attribute", N);
2598 -- Error if the attribute reference has expressions that look
2599 -- like formal parameters.
2601 elsif Present (Expressions (Nam)) then
2602 Error_Msg_N ("illegal expressions in attribute reference", Nam);
2605 Aname = Name_Compose or else
2606 Aname = Name_Exponent or else
2607 Aname = Name_Leading_Part or else
2608 Aname = Name_Pos or else
2609 Aname = Name_Round or else
2610 Aname = Name_Scaling or else
2613 if Nkind (N) = N_Subprogram_Renaming_Declaration
2614 and then Present (Corresponding_Formal_Spec (N))
2617 ("generic actual cannot be attribute involving universal type",
2621 ("attribute involving a universal type cannot be renamed",
2626 -- AST_Entry is an odd case. It doesn't really make much sense to
2627 -- allow it to be renamed, but that's the DEC rule, so we have to
2628 -- do it right. The point is that the AST_Entry call should be made
2629 -- now, and what the function will return is the returned value.
2631 -- Note that there is no Expr_List in this case anyway
2633 if Aname = Name_AST_Entry then
2639 Ent := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
2642 Make_Object_Declaration (Loc,
2643 Defining_Identifier => Ent,
2644 Object_Definition =>
2645 New_Occurrence_Of (RTE (RE_AST_Handler), Loc),
2647 Constant_Present => True);
2649 Set_Assignment_OK (Decl, True);
2650 Insert_Action (N, Decl);
2651 Attr_Node := Make_Identifier (Loc, Chars (Ent));
2654 -- For all other attributes, we rewrite the attribute node to have
2655 -- a list of expressions corresponding to the subprogram formals.
2656 -- A renaming declaration is not a freeze point, and the analysis of
2657 -- the attribute reference should not freeze the type of the prefix.
2661 Make_Attribute_Reference (Loc,
2662 Prefix => Prefix (Nam),
2663 Attribute_Name => Aname,
2664 Expressions => Expr_List);
2666 Set_Must_Not_Freeze (Attr_Node);
2667 Set_Must_Not_Freeze (Prefix (Nam));
2670 -- Case of renaming a function
2672 if Nkind (Spec) = N_Function_Specification then
2673 if Is_Procedure_Attribute_Name (Aname) then
2674 Error_Msg_N ("attribute can only be renamed as procedure", Nam);
2678 Find_Type (Result_Definition (Spec));
2679 Rewrite (Result_Definition (Spec),
2681 Base_Type (Entity (Result_Definition (Spec))), Loc));
2684 Make_Subprogram_Body (Loc,
2685 Specification => Spec,
2686 Declarations => New_List,
2687 Handled_Statement_Sequence =>
2688 Make_Handled_Sequence_Of_Statements (Loc,
2689 Statements => New_List (
2690 Make_Simple_Return_Statement (Loc,
2691 Expression => Attr_Node))));
2693 -- Case of renaming a procedure
2696 if not Is_Procedure_Attribute_Name (Aname) then
2697 Error_Msg_N ("attribute can only be renamed as function", Nam);
2702 Make_Subprogram_Body (Loc,
2703 Specification => Spec,
2704 Declarations => New_List,
2705 Handled_Statement_Sequence =>
2706 Make_Handled_Sequence_Of_Statements (Loc,
2707 Statements => New_List (Attr_Node)));
2710 -- In case of tagged types we add the body of the generated function to
2711 -- the freezing actions of the type (because in the general case such
2712 -- type is still not frozen). We exclude from this processing generic
2713 -- formal subprograms found in instantiations and AST_Entry renamings.
2715 if not Present (Corresponding_Formal_Spec (N))
2716 and then Etype (Nam) /= RTE (RE_AST_Handler)
2719 P : constant Entity_Id := Prefix (Nam);
2724 if Is_Tagged_Type (Etype (P)) then
2725 Ensure_Freeze_Node (Etype (P));
2726 Append_Freeze_Action (Etype (P), Body_Node);
2728 Rewrite (N, Body_Node);
2730 Set_Etype (New_S, Base_Type (Etype (New_S)));
2734 -- Generic formal subprograms or AST_Handler renaming
2737 Rewrite (N, Body_Node);
2739 Set_Etype (New_S, Base_Type (Etype (New_S)));
2742 if Is_Compilation_Unit (New_S) then
2744 ("a library unit can only rename another library unit", N);
2747 -- We suppress elaboration warnings for the resulting entity, since
2748 -- clearly they are not needed, and more particularly, in the case
2749 -- of a generic formal subprogram, the resulting entity can appear
2750 -- after the instantiation itself, and thus look like a bogus case
2751 -- of access before elaboration.
2753 Set_Suppress_Elaboration_Warnings (New_S);
2755 end Attribute_Renaming;
2757 ----------------------
2758 -- Chain_Use_Clause --
2759 ----------------------
2761 procedure Chain_Use_Clause (N : Node_Id) is
2763 Level : Int := Scope_Stack.Last;
2766 if not Is_Compilation_Unit (Current_Scope)
2767 or else not Is_Child_Unit (Current_Scope)
2769 null; -- Common case
2771 elsif Defining_Entity (Parent (N)) = Current_Scope then
2772 null; -- Common case for compilation unit
2775 -- If declaration appears in some other scope, it must be in some
2776 -- parent unit when compiling a child.
2778 Pack := Defining_Entity (Parent (N));
2779 if not In_Open_Scopes (Pack) then
2780 null; -- default as well
2783 -- Find entry for parent unit in scope stack
2785 while Scope_Stack.Table (Level).Entity /= Pack loop
2791 Set_Next_Use_Clause (N,
2792 Scope_Stack.Table (Level).First_Use_Clause);
2793 Scope_Stack.Table (Level).First_Use_Clause := N;
2794 end Chain_Use_Clause;
2796 ---------------------------
2797 -- Check_Frozen_Renaming --
2798 ---------------------------
2800 procedure Check_Frozen_Renaming (N : Node_Id; Subp : Entity_Id) is
2806 and then not Has_Completion (Subp)
2810 (Parent (Declaration_Node (Subp)), Defining_Entity (N));
2812 if Is_Entity_Name (Name (N)) then
2813 Old_S := Entity (Name (N));
2815 if not Is_Frozen (Old_S)
2816 and then Operating_Mode /= Check_Semantics
2818 Append_Freeze_Action (Old_S, B_Node);
2820 Insert_After (N, B_Node);
2824 if Is_Intrinsic_Subprogram (Old_S)
2825 and then not In_Instance
2828 ("subprogram used in renaming_as_body cannot be intrinsic",
2833 Insert_After (N, B_Node);
2837 end Check_Frozen_Renaming;
2839 -----------------------------------
2840 -- Check_In_Previous_With_Clause --
2841 -----------------------------------
2843 procedure Check_In_Previous_With_Clause
2847 Pack : constant Entity_Id := Entity (Original_Node (Nam));
2852 Item := First (Context_Items (Parent (N)));
2854 while Present (Item)
2857 if Nkind (Item) = N_With_Clause
2859 -- Protect the frontend against previous critical errors
2861 and then Nkind (Name (Item)) /= N_Selected_Component
2862 and then Entity (Name (Item)) = Pack
2866 -- Find root library unit in with_clause
2868 while Nkind (Par) = N_Expanded_Name loop
2869 Par := Prefix (Par);
2872 if Is_Child_Unit (Entity (Original_Node (Par))) then
2874 ("& is not directly visible", Par, Entity (Par));
2883 -- On exit, package is not mentioned in a previous with_clause.
2884 -- Check if its prefix is.
2886 if Nkind (Nam) = N_Expanded_Name then
2887 Check_In_Previous_With_Clause (N, Prefix (Nam));
2889 elsif Pack /= Any_Id then
2890 Error_Msg_NE ("& is not visible", Nam, Pack);
2892 end Check_In_Previous_With_Clause;
2894 ---------------------------------
2895 -- Check_Library_Unit_Renaming --
2896 ---------------------------------
2898 procedure Check_Library_Unit_Renaming (N : Node_Id; Old_E : Entity_Id) is
2902 if Nkind (Parent (N)) /= N_Compilation_Unit then
2905 -- Check for library unit. Note that we used to check for the scope
2906 -- being Standard here, but that was wrong for Standard itself.
2908 elsif not Is_Compilation_Unit (Old_E)
2909 and then not Is_Child_Unit (Old_E)
2911 Error_Msg_N ("renamed unit must be a library unit", Name (N));
2913 -- Entities defined in Standard (operators and boolean literals) cannot
2914 -- be renamed as library units.
2916 elsif Scope (Old_E) = Standard_Standard
2917 and then Sloc (Old_E) = Standard_Location
2919 Error_Msg_N ("renamed unit must be a library unit", Name (N));
2921 elsif Present (Parent_Spec (N))
2922 and then Nkind (Unit (Parent_Spec (N))) = N_Generic_Package_Declaration
2923 and then not Is_Child_Unit (Old_E)
2926 ("renamed unit must be a child unit of generic parent", Name (N));
2928 elsif Nkind (N) in N_Generic_Renaming_Declaration
2929 and then Nkind (Name (N)) = N_Expanded_Name
2930 and then Is_Generic_Instance (Entity (Prefix (Name (N))))
2931 and then Is_Generic_Unit (Old_E)
2934 ("renamed generic unit must be a library unit", Name (N));
2936 elsif Is_Package_Or_Generic_Package (Old_E) then
2938 -- Inherit categorization flags
2940 New_E := Defining_Entity (N);
2941 Set_Is_Pure (New_E, Is_Pure (Old_E));
2942 Set_Is_Preelaborated (New_E, Is_Preelaborated (Old_E));
2943 Set_Is_Remote_Call_Interface (New_E,
2944 Is_Remote_Call_Interface (Old_E));
2945 Set_Is_Remote_Types (New_E, Is_Remote_Types (Old_E));
2946 Set_Is_Shared_Passive (New_E, Is_Shared_Passive (Old_E));
2948 end Check_Library_Unit_Renaming;
2954 procedure End_Scope is
2960 Id := First_Entity (Current_Scope);
2961 while Present (Id) loop
2962 -- An entity in the current scope is not necessarily the first one
2963 -- on its homonym chain. Find its predecessor if any,
2964 -- If it is an internal entity, it will not be in the visibility
2965 -- chain altogether, and there is nothing to unchain.
2967 if Id /= Current_Entity (Id) then
2968 Prev := Current_Entity (Id);
2969 while Present (Prev)
2970 and then Present (Homonym (Prev))
2971 and then Homonym (Prev) /= Id
2973 Prev := Homonym (Prev);
2976 -- Skip to end of loop if Id is not in the visibility chain
2978 if No (Prev) or else Homonym (Prev) /= Id then
2986 Set_Is_Immediately_Visible (Id, False);
2988 Outer := Homonym (Id);
2989 while Present (Outer) and then Scope (Outer) = Current_Scope loop
2990 Outer := Homonym (Outer);
2993 -- Reset homonym link of other entities, but do not modify link
2994 -- between entities in current scope, so that the back-end can have
2995 -- a proper count of local overloadings.
2998 Set_Name_Entity_Id (Chars (Id), Outer);
3000 elsif Scope (Prev) /= Scope (Id) then
3001 Set_Homonym (Prev, Outer);
3008 -- If the scope generated freeze actions, place them before the
3009 -- current declaration and analyze them. Type declarations and
3010 -- the bodies of initialization procedures can generate such nodes.
3011 -- We follow the parent chain until we reach a list node, which is
3012 -- the enclosing list of declarations. If the list appears within
3013 -- a protected definition, move freeze nodes outside the protected
3017 (Scope_Stack.Table (Scope_Stack.Last).Pending_Freeze_Actions)
3021 L : constant List_Id := Scope_Stack.Table
3022 (Scope_Stack.Last).Pending_Freeze_Actions;
3025 if Is_Itype (Current_Scope) then
3026 Decl := Associated_Node_For_Itype (Current_Scope);
3028 Decl := Parent (Current_Scope);
3033 while not (Is_List_Member (Decl))
3034 or else Nkind_In (Parent (Decl), N_Protected_Definition,
3037 Decl := Parent (Decl);
3040 Insert_List_Before_And_Analyze (Decl, L);
3049 ---------------------
3050 -- End_Use_Clauses --
3051 ---------------------
3053 procedure End_Use_Clauses (Clause : Node_Id) is
3057 -- Remove Use_Type clauses first, because they affect the
3058 -- visibility of operators in subsequent used packages.
3061 while Present (U) loop
3062 if Nkind (U) = N_Use_Type_Clause then
3066 Next_Use_Clause (U);
3070 while Present (U) loop
3071 if Nkind (U) = N_Use_Package_Clause then
3072 End_Use_Package (U);
3075 Next_Use_Clause (U);
3077 end End_Use_Clauses;
3079 ---------------------
3080 -- End_Use_Package --
3081 ---------------------
3083 procedure End_Use_Package (N : Node_Id) is
3084 Pack_Name : Node_Id;
3089 function Is_Primitive_Operator
3091 F : Entity_Id) return Boolean;
3092 -- Check whether Op is a primitive operator of a use-visible type
3094 ---------------------------
3095 -- Is_Primitive_Operator --
3096 ---------------------------
3098 function Is_Primitive_Operator
3100 F : Entity_Id) return Boolean
3102 T : constant Entity_Id := Etype (F);
3105 and then Scope (T) = Scope (Op);
3106 end Is_Primitive_Operator;
3108 -- Start of processing for End_Use_Package
3111 Pack_Name := First (Names (N));
3112 while Present (Pack_Name) loop
3114 -- Test that Pack_Name actually denotes a package before processing
3116 if Is_Entity_Name (Pack_Name)
3117 and then Ekind (Entity (Pack_Name)) = E_Package
3119 Pack := Entity (Pack_Name);
3121 if In_Open_Scopes (Pack) then
3124 elsif not Redundant_Use (Pack_Name) then
3125 Set_In_Use (Pack, False);
3126 Set_Current_Use_Clause (Pack, Empty);
3128 Id := First_Entity (Pack);
3129 while Present (Id) loop
3131 -- Preserve use-visibility of operators that are primitive
3132 -- operators of a type that is use-visible through an active
3135 if Nkind (Id) = N_Defining_Operator_Symbol
3137 (Is_Primitive_Operator (Id, First_Formal (Id))
3139 (Present (Next_Formal (First_Formal (Id)))
3141 Is_Primitive_Operator
3142 (Id, Next_Formal (First_Formal (Id)))))
3147 Set_Is_Potentially_Use_Visible (Id, False);
3150 if Is_Private_Type (Id)
3151 and then Present (Full_View (Id))
3153 Set_Is_Potentially_Use_Visible (Full_View (Id), False);
3159 if Present (Renamed_Object (Pack)) then
3160 Set_In_Use (Renamed_Object (Pack), False);
3161 Set_Current_Use_Clause (Renamed_Object (Pack), Empty);
3164 if Chars (Pack) = Name_System
3165 and then Scope (Pack) = Standard_Standard
3166 and then Present_System_Aux
3168 Id := First_Entity (System_Aux_Id);
3169 while Present (Id) loop
3170 Set_Is_Potentially_Use_Visible (Id, False);
3172 if Is_Private_Type (Id)
3173 and then Present (Full_View (Id))
3175 Set_Is_Potentially_Use_Visible (Full_View (Id), False);
3181 Set_In_Use (System_Aux_Id, False);
3185 Set_Redundant_Use (Pack_Name, False);
3192 if Present (Hidden_By_Use_Clause (N)) then
3193 Elmt := First_Elmt (Hidden_By_Use_Clause (N));
3194 while Present (Elmt) loop
3195 Set_Is_Immediately_Visible (Node (Elmt));
3199 Set_Hidden_By_Use_Clause (N, No_Elist);
3201 end End_Use_Package;
3207 procedure End_Use_Type (N : Node_Id) is
3214 Id := First (Subtype_Marks (N));
3215 while Present (Id) loop
3217 -- A call to rtsfind may occur while analyzing a use_type clause,
3218 -- in which case the type marks are not resolved yet, and there is
3219 -- nothing to remove.
3221 if not Is_Entity_Name (Id)
3222 or else No (Entity (Id))
3230 or else From_With_Type (T)
3234 -- Note that the use_Type clause may mention a subtype of the type
3235 -- whose primitive operations have been made visible. Here as
3236 -- elsewhere, it is the base type that matters for visibility.
3238 elsif In_Open_Scopes (Scope (Base_Type (T))) then
3241 elsif not Redundant_Use (Id) then
3242 Set_In_Use (T, False);
3243 Set_In_Use (Base_Type (T), False);
3244 Set_Current_Use_Clause (T, Empty);
3245 Set_Current_Use_Clause (Base_Type (T), Empty);
3246 Op_List := Collect_Primitive_Operations (T);
3248 Elmt := First_Elmt (Op_List);
3249 while Present (Elmt) loop
3250 if Nkind (Node (Elmt)) = N_Defining_Operator_Symbol then
3251 Set_Is_Potentially_Use_Visible (Node (Elmt), False);
3263 ----------------------
3264 -- Find_Direct_Name --
3265 ----------------------
3267 procedure Find_Direct_Name (N : Node_Id) is
3272 Inst : Entity_Id := Empty;
3273 -- Enclosing instance, if any
3275 Homonyms : Entity_Id;
3276 -- Saves start of homonym chain
3278 Nvis_Entity : Boolean;
3279 -- Set True to indicate that at there is at least one entity on the
3280 -- homonym chain which, while not visible, is visible enough from the
3281 -- user point of view to warrant an error message of "not visible"
3282 -- rather than undefined.
3284 Nvis_Is_Private_Subprg : Boolean := False;
3285 -- Ada 2005 (AI-262): Set True to indicate that a form of Beaujolais
3286 -- effect concerning library subprograms has been detected. Used to
3287 -- generate the precise error message.
3289 function From_Actual_Package (E : Entity_Id) return Boolean;
3290 -- Returns true if the entity is declared in a package that is
3291 -- an actual for a formal package of the current instance. Such an
3292 -- entity requires special handling because it may be use-visible
3293 -- but hides directly visible entities defined outside the instance.
3295 function Is_Actual_Parameter return Boolean;
3296 -- This function checks if the node N is an identifier that is an actual
3297 -- parameter of a procedure call. If so it returns True, otherwise it
3298 -- return False. The reason for this check is that at this stage we do
3299 -- not know what procedure is being called if the procedure might be
3300 -- overloaded, so it is premature to go setting referenced flags or
3301 -- making calls to Generate_Reference. We will wait till Resolve_Actuals
3302 -- for that processing
3304 function Known_But_Invisible (E : Entity_Id) return Boolean;
3305 -- This function determines whether the entity E (which is not
3306 -- visible) can reasonably be considered to be known to the writer
3307 -- of the reference. This is a heuristic test, used only for the
3308 -- purposes of figuring out whether we prefer to complain that an
3309 -- entity is undefined or invisible (and identify the declaration
3310 -- of the invisible entity in the latter case). The point here is
3311 -- that we don't want to complain that something is invisible and
3312 -- then point to something entirely mysterious to the writer.
3314 procedure Nvis_Messages;
3315 -- Called if there are no visible entries for N, but there is at least
3316 -- one non-directly visible, or hidden declaration. This procedure
3317 -- outputs an appropriate set of error messages.
3319 procedure Undefined (Nvis : Boolean);
3320 -- This function is called if the current node has no corresponding
3321 -- visible entity or entities. The value set in Msg indicates whether
3322 -- an error message was generated (multiple error messages for the
3323 -- same variable are generally suppressed, see body for details).
3324 -- Msg is True if an error message was generated, False if not. This
3325 -- value is used by the caller to determine whether or not to output
3326 -- additional messages where appropriate. The parameter is set False
3327 -- to get the message "X is undefined", and True to get the message
3328 -- "X is not visible".
3330 -------------------------
3331 -- From_Actual_Package --
3332 -------------------------
3334 function From_Actual_Package (E : Entity_Id) return Boolean is
3335 Scop : constant Entity_Id := Scope (E);
3339 if not In_Instance then
3342 Inst := Current_Scope;
3343 while Present (Inst)
3344 and then Ekind (Inst) /= E_Package
3345 and then not Is_Generic_Instance (Inst)
3347 Inst := Scope (Inst);
3354 Act := First_Entity (Inst);
3355 while Present (Act) loop
3356 if Ekind (Act) = E_Package then
3358 -- Check for end of actuals list
3360 if Renamed_Object (Act) = Inst then
3363 elsif Present (Associated_Formal_Package (Act))
3364 and then Renamed_Object (Act) = Scop
3366 -- Entity comes from (instance of) formal package
3381 end From_Actual_Package;
3383 -------------------------
3384 -- Is_Actual_Parameter --
3385 -------------------------
3387 function Is_Actual_Parameter return Boolean is
3390 Nkind (N) = N_Identifier
3392 (Nkind (Parent (N)) = N_Procedure_Call_Statement
3394 (Nkind (Parent (N)) = N_Parameter_Association
3395 and then N = Explicit_Actual_Parameter (Parent (N))
3396 and then Nkind (Parent (Parent (N))) =
3397 N_Procedure_Call_Statement));
3398 end Is_Actual_Parameter;
3400 -------------------------
3401 -- Known_But_Invisible --
3402 -------------------------
3404 function Known_But_Invisible (E : Entity_Id) return Boolean is
3405 Fname : File_Name_Type;
3408 -- Entities in Standard are always considered to be known
3410 if Sloc (E) <= Standard_Location then
3413 -- An entity that does not come from source is always considered
3414 -- to be unknown, since it is an artifact of code expansion.
3416 elsif not Comes_From_Source (E) then
3419 -- In gnat internal mode, we consider all entities known
3421 elsif GNAT_Mode then
3425 -- Here we have an entity that is not from package Standard, and
3426 -- which comes from Source. See if it comes from an internal file.
3428 Fname := Unit_File_Name (Get_Source_Unit (E));
3430 -- Case of from internal file
3432 if Is_Internal_File_Name (Fname) then
3434 -- Private part entities in internal files are never considered
3435 -- to be known to the writer of normal application code.
3437 if Is_Hidden (E) then
3441 -- Entities from System packages other than System and
3442 -- System.Storage_Elements are not considered to be known.
3443 -- System.Auxxxx files are also considered known to the user.
3445 -- Should refine this at some point to generally distinguish
3446 -- between known and unknown internal files ???
3448 Get_Name_String (Fname);
3453 Name_Buffer (1 .. 2) /= "s-"
3455 Name_Buffer (3 .. 8) = "stoele"
3457 Name_Buffer (3 .. 5) = "aux";
3459 -- If not an internal file, then entity is definitely known,
3460 -- even if it is in a private part (the message generated will
3461 -- note that it is in a private part)
3466 end Known_But_Invisible;
3472 procedure Nvis_Messages is
3473 Comp_Unit : Node_Id;
3475 Hidden : Boolean := False;
3479 -- Ada 2005 (AI-262): Generate a precise error concerning the
3480 -- Beaujolais effect that was previously detected
3482 if Nvis_Is_Private_Subprg then
3484 pragma Assert (Nkind (E2) = N_Defining_Identifier
3485 and then Ekind (E2) = E_Function
3486 and then Scope (E2) = Standard_Standard
3487 and then Has_Private_With (E2));
3489 -- Find the sloc corresponding to the private with'ed unit
3491 Comp_Unit := Cunit (Current_Sem_Unit);
3492 Error_Msg_Sloc := No_Location;
3494 Item := First (Context_Items (Comp_Unit));
3495 while Present (Item) loop
3496 if Nkind (Item) = N_With_Clause
3497 and then Private_Present (Item)
3498 and then Entity (Name (Item)) = E2
3500 Error_Msg_Sloc := Sloc (Item);
3507 pragma Assert (Error_Msg_Sloc /= No_Location);
3509 Error_Msg_N ("(Ada 2005): hidden by private with clause #", N);
3513 Undefined (Nvis => True);
3517 -- First loop does hidden declarations
3520 while Present (Ent) loop
3521 if Is_Potentially_Use_Visible (Ent) then
3523 Error_Msg_N ("multiple use clauses cause hiding!", N);
3527 Error_Msg_Sloc := Sloc (Ent);
3528 Error_Msg_N ("hidden declaration#!", N);
3531 Ent := Homonym (Ent);
3534 -- If we found hidden declarations, then that's enough, don't
3535 -- bother looking for non-visible declarations as well.
3541 -- Second loop does non-directly visible declarations
3544 while Present (Ent) loop
3545 if not Is_Potentially_Use_Visible (Ent) then
3547 -- Do not bother the user with unknown entities
3549 if not Known_But_Invisible (Ent) then
3553 Error_Msg_Sloc := Sloc (Ent);
3555 -- Output message noting that there is a non-visible
3556 -- declaration, distinguishing the private part case.
3558 if Is_Hidden (Ent) then
3559 Error_Msg_N ("non-visible (private) declaration#!", N);
3561 Error_Msg_N ("non-visible declaration#!", N);
3563 if Is_Compilation_Unit (Ent)
3565 Nkind (Parent (Parent (N))) = N_Use_Package_Clause
3567 Error_Msg_Qual_Level := 99;
3568 Error_Msg_NE ("\\missing `WITH &;`", N, Ent);
3569 Error_Msg_Qual_Level := 0;
3573 -- Set entity and its containing package as referenced. We
3574 -- can't be sure of this, but this seems a better choice
3575 -- to avoid unused entity messages.
3577 if Comes_From_Source (Ent) then
3578 Set_Referenced (Ent);
3579 Set_Referenced (Cunit_Entity (Get_Source_Unit (Ent)));
3584 Ent := Homonym (Ent);
3593 procedure Undefined (Nvis : Boolean) is
3594 Emsg : Error_Msg_Id;
3597 -- We should never find an undefined internal name. If we do, then
3598 -- see if we have previous errors. If so, ignore on the grounds that
3599 -- it is probably a cascaded message (e.g. a block label from a badly
3600 -- formed block). If no previous errors, then we have a real internal
3601 -- error of some kind so raise an exception.
3603 if Is_Internal_Name (Chars (N)) then
3604 if Total_Errors_Detected /= 0 then
3607 raise Program_Error;
3611 -- A very specialized error check, if the undefined variable is
3612 -- a case tag, and the case type is an enumeration type, check
3613 -- for a possible misspelling, and if so, modify the identifier
3615 -- Named aggregate should also be handled similarly ???
3617 if Nkind (N) = N_Identifier
3618 and then Nkind (Parent (N)) = N_Case_Statement_Alternative
3621 Case_Stm : constant Node_Id := Parent (Parent (N));
3622 Case_Typ : constant Entity_Id := Etype (Expression (Case_Stm));
3627 if Is_Enumeration_Type (Case_Typ)
3628 and then not Is_Standard_Character_Type (Case_Typ)
3630 Lit := First_Literal (Case_Typ);
3631 Get_Name_String (Chars (Lit));
3633 if Chars (Lit) /= Chars (N)
3634 and then Is_Bad_Spelling_Of (Chars (N), Chars (Lit)) then
3635 Error_Msg_Node_2 := Lit;
3637 ("& is undefined, assume misspelling of &", N);
3638 Rewrite (N, New_Occurrence_Of (Lit, Sloc (N)));
3642 Lit := Next_Literal (Lit);
3647 -- Normal processing
3649 Set_Entity (N, Any_Id);
3650 Set_Etype (N, Any_Type);
3652 -- We use the table Urefs to keep track of entities for which we
3653 -- have issued errors for undefined references. Multiple errors
3654 -- for a single name are normally suppressed, however we modify
3655 -- the error message to alert the programmer to this effect.
3657 for J in Urefs.First .. Urefs.Last loop
3658 if Chars (N) = Chars (Urefs.Table (J).Node) then
3659 if Urefs.Table (J).Err /= No_Error_Msg
3660 and then Sloc (N) /= Urefs.Table (J).Loc
3662 Error_Msg_Node_1 := Urefs.Table (J).Node;
3664 if Urefs.Table (J).Nvis then
3665 Change_Error_Text (Urefs.Table (J).Err,
3666 "& is not visible (more references follow)");
3668 Change_Error_Text (Urefs.Table (J).Err,
3669 "& is undefined (more references follow)");
3672 Urefs.Table (J).Err := No_Error_Msg;
3675 -- Although we will set Msg False, and thus suppress the
3676 -- message, we also set Error_Posted True, to avoid any
3677 -- cascaded messages resulting from the undefined reference.
3680 Set_Error_Posted (N, True);
3685 -- If entry not found, this is first undefined occurrence
3688 Error_Msg_N ("& is not visible!", N);
3692 Error_Msg_N ("& is undefined!", N);
3695 -- A very bizarre special check, if the undefined identifier
3696 -- is put or put_line, then add a special error message (since
3697 -- this is a very common error for beginners to make).
3699 if Chars (N) = Name_Put or else Chars (N) = Name_Put_Line then
3701 ("\\possible missing `WITH Ada.Text_'I'O; " &
3702 "USE Ada.Text_'I'O`!", N);
3704 -- Another special check if N is the prefix of a selected
3705 -- component which is a known unit, add message complaining
3706 -- about missing with for this unit.
3708 elsif Nkind (Parent (N)) = N_Selected_Component
3709 and then N = Prefix (Parent (N))
3710 and then Is_Known_Unit (Parent (N))
3712 Error_Msg_Node_2 := Selector_Name (Parent (N));
3713 Error_Msg_N ("\\missing `WITH &.&;`", Prefix (Parent (N)));
3716 -- Now check for possible misspellings
3720 Ematch : Entity_Id := Empty;
3722 Last_Name_Id : constant Name_Id :=
3723 Name_Id (Nat (First_Name_Id) +
3724 Name_Entries_Count - 1);
3727 for Nam in First_Name_Id .. Last_Name_Id loop
3728 E := Get_Name_Entity_Id (Nam);
3731 and then (Is_Immediately_Visible (E)
3733 Is_Potentially_Use_Visible (E))
3735 if Is_Bad_Spelling_Of (Chars (N), Nam) then
3742 if Present (Ematch) then
3743 Error_Msg_NE ("\possible misspelling of&", N, Ematch);
3748 -- Make entry in undefined references table unless the full errors
3749 -- switch is set, in which case by refraining from generating the
3750 -- table entry, we guarantee that we get an error message for every
3751 -- undefined reference.
3753 if not All_Errors_Mode then
3764 -- Start of processing for Find_Direct_Name
3767 -- If the entity pointer is already set, this is an internal node, or
3768 -- a node that is analyzed more than once, after a tree modification.
3769 -- In such a case there is no resolution to perform, just set the type.
3771 if Present (Entity (N)) then
3772 if Is_Type (Entity (N)) then
3773 Set_Etype (N, Entity (N));
3777 Entyp : constant Entity_Id := Etype (Entity (N));
3780 -- One special case here. If the Etype field is already set,
3781 -- and references the packed array type corresponding to the
3782 -- etype of the referenced entity, then leave it alone. This
3783 -- happens for trees generated from Exp_Pakd, where expressions
3784 -- can be deliberately "mis-typed" to the packed array type.
3786 if Is_Array_Type (Entyp)
3787 and then Is_Packed (Entyp)
3788 and then Present (Etype (N))
3789 and then Etype (N) = Packed_Array_Type (Entyp)
3793 -- If not that special case, then just reset the Etype
3796 Set_Etype (N, Etype (Entity (N)));
3804 -- Here if Entity pointer was not set, we need full visibility analysis
3805 -- First we generate debugging output if the debug E flag is set.
3807 if Debug_Flag_E then
3808 Write_Str ("Looking for ");
3809 Write_Name (Chars (N));
3813 Homonyms := Current_Entity (N);
3814 Nvis_Entity := False;
3817 while Present (E) loop
3819 -- If entity is immediately visible or potentially use visible, then
3820 -- process the entity and we are done.
3822 if Is_Immediately_Visible (E) then
3823 goto Immediately_Visible_Entity;
3825 elsif Is_Potentially_Use_Visible (E) then
3826 goto Potentially_Use_Visible_Entity;
3828 -- Note if a known but invisible entity encountered
3830 elsif Known_But_Invisible (E) then
3831 Nvis_Entity := True;
3834 -- Move to next entity in chain and continue search
3839 -- If no entries on homonym chain that were potentially visible,
3840 -- and no entities reasonably considered as non-visible, then
3841 -- we have a plain undefined reference, with no additional
3842 -- explanation required!
3844 if not Nvis_Entity then
3845 Undefined (Nvis => False);
3847 -- Otherwise there is at least one entry on the homonym chain that
3848 -- is reasonably considered as being known and non-visible.
3856 -- Processing for a potentially use visible entry found. We must search
3857 -- the rest of the homonym chain for two reasons. First, if there is a
3858 -- directly visible entry, then none of the potentially use-visible
3859 -- entities are directly visible (RM 8.4(10)). Second, we need to check
3860 -- for the case of multiple potentially use-visible entries hiding one
3861 -- another and as a result being non-directly visible (RM 8.4(11)).
3863 <<Potentially_Use_Visible_Entity>> declare
3864 Only_One_Visible : Boolean := True;
3865 All_Overloadable : Boolean := Is_Overloadable (E);
3869 while Present (E2) loop
3870 if Is_Immediately_Visible (E2) then
3872 -- If the use-visible entity comes from the actual for a
3873 -- formal package, it hides a directly visible entity from
3874 -- outside the instance.
3876 if From_Actual_Package (E)
3877 and then Scope_Depth (E2) < Scope_Depth (Inst)
3882 goto Immediately_Visible_Entity;
3885 elsif Is_Potentially_Use_Visible (E2) then
3886 Only_One_Visible := False;
3887 All_Overloadable := All_Overloadable and Is_Overloadable (E2);
3889 -- Ada 2005 (AI-262): Protect against a form of Beaujolais effect
3890 -- that can occur in private_with clauses. Example:
3893 -- private with B; package A is
3894 -- package C is function B return Integer;
3896 -- V1 : Integer := B;
3897 -- private function B return Integer;
3898 -- V2 : Integer := B;
3901 -- V1 resolves to A.B, but V2 resolves to library unit B
3903 elsif Ekind (E2) = E_Function
3904 and then Scope (E2) = Standard_Standard
3905 and then Has_Private_With (E2)
3907 Only_One_Visible := False;
3908 All_Overloadable := False;
3909 Nvis_Is_Private_Subprg := True;
3916 -- On falling through this loop, we have checked that there are no
3917 -- immediately visible entities. Only_One_Visible is set if exactly
3918 -- one potentially use visible entity exists. All_Overloadable is
3919 -- set if all the potentially use visible entities are overloadable.
3920 -- The condition for legality is that either there is one potentially
3921 -- use visible entity, or if there is more than one, then all of them
3922 -- are overloadable.
3924 if Only_One_Visible or All_Overloadable then
3927 -- If there is more than one potentially use-visible entity and at
3928 -- least one of them non-overloadable, we have an error (RM 8.4(11).
3929 -- Note that E points to the first such entity on the homonym list.
3930 -- Special case: if one of the entities is declared in an actual
3931 -- package, it was visible in the generic, and takes precedence over
3932 -- other entities that are potentially use-visible. Same if it is
3933 -- declared in a local instantiation of the current instance.
3938 -- Find current instance
3940 Inst := Current_Scope;
3941 while Present (Inst)
3942 and then Inst /= Standard_Standard
3944 if Is_Generic_Instance (Inst) then
3948 Inst := Scope (Inst);
3952 while Present (E2) loop
3953 if From_Actual_Package (E2)
3955 (Is_Generic_Instance (Scope (E2))
3956 and then Scope_Depth (Scope (E2)) > Scope_Depth (Inst))
3969 Is_Predefined_File_Name (Unit_File_Name (Current_Sem_Unit))
3971 -- A use-clause in the body of a system file creates conflict
3972 -- with some entity in a user scope, while rtsfind is active.
3973 -- Keep only the entity coming from another predefined unit.
3976 while Present (E2) loop
3977 if Is_Predefined_File_Name
3978 (Unit_File_Name (Get_Source_Unit (Sloc (E2))))
3987 -- Entity must exist because predefined unit is correct
3989 raise Program_Error;
3998 -- Come here with E set to the first immediately visible entity on
3999 -- the homonym chain. This is the one we want unless there is another
4000 -- immediately visible entity further on in the chain for an inner
4001 -- scope (RM 8.3(8)).
4003 <<Immediately_Visible_Entity>> declare
4008 -- Find scope level of initial entity. When compiling through
4009 -- Rtsfind, the previous context is not completely invisible, and
4010 -- an outer entity may appear on the chain, whose scope is below
4011 -- the entry for Standard that delimits the current scope stack.
4012 -- Indicate that the level for this spurious entry is outside of
4013 -- the current scope stack.
4015 Level := Scope_Stack.Last;
4017 Scop := Scope_Stack.Table (Level).Entity;
4018 exit when Scop = Scope (E);
4020 exit when Scop = Standard_Standard;
4023 -- Now search remainder of homonym chain for more inner entry
4024 -- If the entity is Standard itself, it has no scope, and we
4025 -- compare it with the stack entry directly.
4028 while Present (E2) loop
4029 if Is_Immediately_Visible (E2) then
4031 -- If a generic package contains a local declaration that
4032 -- has the same name as the generic, there may be a visibility
4033 -- conflict in an instance, where the local declaration must
4034 -- also hide the name of the corresponding package renaming.
4035 -- We check explicitly for a package declared by a renaming,
4036 -- whose renamed entity is an instance that is on the scope
4037 -- stack, and that contains a homonym in the same scope. Once
4038 -- we have found it, we know that the package renaming is not
4039 -- immediately visible, and that the identifier denotes the
4040 -- other entity (and its homonyms if overloaded).
4042 if Scope (E) = Scope (E2)
4043 and then Ekind (E) = E_Package
4044 and then Present (Renamed_Object (E))
4045 and then Is_Generic_Instance (Renamed_Object (E))
4046 and then In_Open_Scopes (Renamed_Object (E))
4047 and then Comes_From_Source (N)
4049 Set_Is_Immediately_Visible (E, False);
4053 for J in Level + 1 .. Scope_Stack.Last loop
4054 if Scope_Stack.Table (J).Entity = Scope (E2)
4055 or else Scope_Stack.Table (J).Entity = E2
4068 -- At the end of that loop, E is the innermost immediately
4069 -- visible entity, so we are all set.
4072 -- Come here with entity found, and stored in E
4076 -- When distribution features are available (Get_PCS_Name /=
4077 -- Name_No_DSA), a remote access-to-subprogram type is converted
4078 -- into a record type holding whatever information is needed to
4079 -- perform a remote call on an RCI subprogram. In that case we
4080 -- rewrite any occurrence of the RAS type into the equivalent record
4081 -- type here. 'Access attribute references and RAS dereferences are
4082 -- then implemented using specific TSSs. However when distribution is
4083 -- not available (case of Get_PCS_Name = Name_No_DSA), we bypass the
4084 -- generation of these TSSs, and we must keep the RAS type in its
4085 -- original access-to-subprogram form (since all calls through a
4086 -- value of such type will be local anyway in the absence of a PCS).
4088 if Comes_From_Source (N)
4089 and then Is_Remote_Access_To_Subprogram_Type (E)
4090 and then Expander_Active
4091 and then Get_PCS_Name /= Name_No_DSA
4094 New_Occurrence_Of (Equivalent_Type (E), Sloc (N)));
4099 -- Why no Style_Check here???
4104 Set_Etype (N, Get_Full_View (Etype (E)));
4107 if Debug_Flag_E then
4108 Write_Str (" found ");
4109 Write_Entity_Info (E, " ");
4112 -- If the Ekind of the entity is Void, it means that all homonyms
4113 -- are hidden from all visibility (RM 8.3(5,14-20)). However, this
4114 -- test is skipped if the current scope is a record and the name is
4115 -- a pragma argument expression (case of Atomic and Volatile pragmas
4116 -- and possibly other similar pragmas added later, which are allowed
4117 -- to reference components in the current record).
4119 if Ekind (E) = E_Void
4121 (not Is_Record_Type (Current_Scope)
4122 or else Nkind (Parent (N)) /= N_Pragma_Argument_Association)
4124 Premature_Usage (N);
4126 -- If the entity is overloadable, collect all interpretations of the
4127 -- name for subsequent overload resolution. We optimize a bit here to
4128 -- do this only if we have an overloadable entity that is not on its
4129 -- own on the homonym chain.
4131 elsif Is_Overloadable (E)
4132 and then (Present (Homonym (E)) or else Current_Entity (N) /= E)
4134 Collect_Interps (N);
4136 -- If no homonyms were visible, the entity is unambiguous
4138 if not Is_Overloaded (N) then
4139 if not Is_Actual_Parameter then
4140 Generate_Reference (E, N);
4144 -- Case of non-overloadable entity, set the entity providing that
4145 -- we do not have the case of a discriminant reference within a
4146 -- default expression. Such references are replaced with the
4147 -- corresponding discriminal, which is the formal corresponding to
4148 -- to the discriminant in the initialization procedure.
4151 -- Entity is unambiguous, indicate that it is referenced here
4153 -- For a renaming of an object, always generate simple reference,
4154 -- we don't try to keep track of assignments in this case.
4156 if Is_Object (E) and then Present (Renamed_Object (E)) then
4157 Generate_Reference (E, N);
4159 -- If the renamed entity is a private protected component,
4160 -- reference the original component as well. This needs to be
4161 -- done because the private renamings are installed before any
4162 -- analysis has occurred. Reference to a private component will
4163 -- resolve to the renaming and the original component will be
4164 -- left unreferenced, hence the following.
4166 if Is_Prival (E) then
4167 Generate_Reference (Prival_Link (E), N);
4170 -- One odd case is that we do not want to set the Referenced flag
4171 -- if the entity is a label, and the identifier is the label in
4172 -- the source, since this is not a reference from the point of
4173 -- view of the user.
4175 elsif Nkind (Parent (N)) = N_Label then
4177 R : constant Boolean := Referenced (E);
4180 -- Generate reference unless this is an actual parameter
4181 -- (see comment below)
4183 if Is_Actual_Parameter then
4184 Generate_Reference (E, N);
4185 Set_Referenced (E, R);
4189 -- Normal case, not a label: generate reference
4191 -- ??? It is too early to generate a reference here even if
4192 -- the entity is unambiguous, because the tree is not
4193 -- sufficiently typed at this point for Generate_Reference to
4194 -- determine whether this reference modifies the denoted object
4195 -- (because implicit dereferences cannot be identified prior to
4196 -- full type resolution).
4198 -- The Is_Actual_Parameter routine takes care of one of these
4199 -- cases but there are others probably ???
4202 if not Is_Actual_Parameter then
4203 Generate_Reference (E, N);
4206 Check_Nested_Access (E);
4209 -- Set Entity, with style check if need be. For a discriminant
4210 -- reference, replace by the corresponding discriminal, i.e. the
4211 -- parameter of the initialization procedure that corresponds to
4212 -- the discriminant. If this replacement is being performed, there
4213 -- is no style check to perform.
4215 -- This replacement must not be done if we are currently
4216 -- processing a generic spec or body, because the discriminal
4217 -- has not been not generated in this case.
4219 -- The replacement is also skipped if we are in special
4220 -- spec-expression mode. Why is this skipped in this case ???
4222 if not In_Spec_Expression
4223 or else Ekind (E) /= E_Discriminant
4224 or else Inside_A_Generic
4226 Set_Entity_With_Style_Check (N, E);
4228 -- The replacement is not done either for a task discriminant that
4229 -- appears in a default expression of an entry parameter. See
4230 -- Expand_Discriminant in exp_ch2 for details on their handling.
4232 elsif Is_Concurrent_Type (Scope (E)) then
4239 and then not Nkind_In (P, N_Parameter_Specification,
4240 N_Component_Declaration)
4246 and then Nkind (P) = N_Parameter_Specification
4250 Set_Entity (N, Discriminal (E));
4254 -- Otherwise, this is a discriminant in a context in which
4255 -- it is a reference to the corresponding parameter of the
4256 -- init proc for the enclosing type.
4259 Set_Entity (N, Discriminal (E));
4263 end Find_Direct_Name;
4265 ------------------------
4266 -- Find_Expanded_Name --
4267 ------------------------
4269 -- This routine searches the homonym chain of the entity until it finds
4270 -- an entity declared in the scope denoted by the prefix. If the entity
4271 -- is private, it may nevertheless be immediately visible, if we are in
4272 -- the scope of its declaration.
4274 procedure Find_Expanded_Name (N : Node_Id) is
4275 Selector : constant Node_Id := Selector_Name (N);
4276 Candidate : Entity_Id := Empty;
4282 P_Name := Entity (Prefix (N));
4285 -- If the prefix is a renamed package, look for the entity in the
4286 -- original package.
4288 if Ekind (P_Name) = E_Package
4289 and then Present (Renamed_Object (P_Name))
4291 P_Name := Renamed_Object (P_Name);
4293 -- Rewrite node with entity field pointing to renamed object
4295 Rewrite (Prefix (N), New_Copy (Prefix (N)));
4296 Set_Entity (Prefix (N), P_Name);
4298 -- If the prefix is an object of a concurrent type, look for
4299 -- the entity in the associated task or protected type.
4301 elsif Is_Concurrent_Type (Etype (P_Name)) then
4302 P_Name := Etype (P_Name);
4305 Id := Current_Entity (Selector);
4308 Is_New_Candidate : Boolean;
4311 while Present (Id) loop
4312 if Scope (Id) = P_Name then
4314 Is_New_Candidate := True;
4316 -- Ada 2005 (AI-217): Handle shadow entities associated with types
4317 -- declared in limited-withed nested packages. We don't need to
4318 -- handle E_Incomplete_Subtype entities because the entities in
4319 -- the limited view are always E_Incomplete_Type entities (see
4320 -- Build_Limited_Views). Regarding the expression used to evaluate
4321 -- the scope, it is important to note that the limited view also
4322 -- has shadow entities associated nested packages. For this reason
4323 -- the correct scope of the entity is the scope of the real entity
4324 -- The non-limited view may itself be incomplete, in which case
4325 -- get the full view if available.
4327 elsif From_With_Type (Id)
4328 and then Is_Type (Id)
4329 and then Ekind (Id) = E_Incomplete_Type
4330 and then Present (Non_Limited_View (Id))
4331 and then Scope (Non_Limited_View (Id)) = P_Name
4333 Candidate := Get_Full_View (Non_Limited_View (Id));
4334 Is_New_Candidate := True;
4337 Is_New_Candidate := False;
4340 if Is_New_Candidate then
4341 if Is_Child_Unit (Id) then
4342 exit when Is_Visible_Child_Unit (Id)
4343 or else Is_Immediately_Visible (Id);
4346 exit when not Is_Hidden (Id)
4347 or else Is_Immediately_Visible (Id);
4356 and then (Ekind (P_Name) = E_Procedure
4358 Ekind (P_Name) = E_Function)
4359 and then Is_Generic_Instance (P_Name)
4361 -- Expanded name denotes entity in (instance of) generic subprogram.
4362 -- The entity may be in the subprogram instance, or may denote one of
4363 -- the formals, which is declared in the enclosing wrapper package.
4365 P_Name := Scope (P_Name);
4367 Id := Current_Entity (Selector);
4368 while Present (Id) loop
4369 exit when Scope (Id) = P_Name;
4374 if No (Id) or else Chars (Id) /= Chars (Selector) then
4375 Set_Etype (N, Any_Type);
4377 -- If we are looking for an entity defined in System, try to find it
4378 -- in the child package that may have been provided as an extension
4379 -- to System. The Extend_System pragma will have supplied the name of
4380 -- the extension, which may have to be loaded.
4382 if Chars (P_Name) = Name_System
4383 and then Scope (P_Name) = Standard_Standard
4384 and then Present (System_Extend_Unit)
4385 and then Present_System_Aux (N)
4387 Set_Entity (Prefix (N), System_Aux_Id);
4388 Find_Expanded_Name (N);
4391 elsif Nkind (Selector) = N_Operator_Symbol
4392 and then Has_Implicit_Operator (N)
4394 -- There is an implicit instance of the predefined operator in
4395 -- the given scope. The operator entity is defined in Standard.
4396 -- Has_Implicit_Operator makes the node into an Expanded_Name.
4400 elsif Nkind (Selector) = N_Character_Literal
4401 and then Has_Implicit_Character_Literal (N)
4403 -- If there is no literal defined in the scope denoted by the
4404 -- prefix, the literal may belong to (a type derived from)
4405 -- Standard_Character, for which we have no explicit literals.
4410 -- If the prefix is a single concurrent object, use its name in
4411 -- the error message, rather than that of the anonymous type.
4413 if Is_Concurrent_Type (P_Name)
4414 and then Is_Internal_Name (Chars (P_Name))
4416 Error_Msg_Node_2 := Entity (Prefix (N));
4418 Error_Msg_Node_2 := P_Name;
4421 if P_Name = System_Aux_Id then
4422 P_Name := Scope (P_Name);
4423 Set_Entity (Prefix (N), P_Name);
4426 if Present (Candidate) then
4428 -- If we know that the unit is a child unit we can give a more
4429 -- accurate error message.
4431 if Is_Child_Unit (Candidate) then
4433 -- If the candidate is a private child unit and we are in
4434 -- the visible part of a public unit, specialize the error
4435 -- message. There might be a private with_clause for it,
4436 -- but it is not currently active.
4438 if Is_Private_Descendant (Candidate)
4439 and then Ekind (Current_Scope) = E_Package
4440 and then not In_Private_Part (Current_Scope)
4441 and then not Is_Private_Descendant (Current_Scope)
4443 Error_Msg_N ("private child unit& is not visible here",
4446 -- Normal case where we have a missing with for a child unit
4449 Error_Msg_Qual_Level := 99;
4450 Error_Msg_NE ("missing `WITH &;`", Selector, Candidate);
4451 Error_Msg_Qual_Level := 0;
4454 -- Here we don't know that this is a child unit
4457 Error_Msg_NE ("& is not a visible entity of&", N, Selector);
4461 -- Within the instantiation of a child unit, the prefix may
4462 -- denote the parent instance, but the selector has the name
4463 -- of the original child. Find whether we are within the
4464 -- corresponding instance, and get the proper entity, which
4465 -- can only be an enclosing scope.
4468 and then In_Open_Scopes (P_Name)
4469 and then Is_Generic_Instance (P_Name)
4472 S : Entity_Id := Current_Scope;
4476 for J in reverse 0 .. Scope_Stack.Last loop
4477 S := Scope_Stack.Table (J).Entity;
4479 exit when S = Standard_Standard;
4481 if Ekind (S) = E_Function
4482 or else Ekind (S) = E_Package
4483 or else Ekind (S) = E_Procedure
4485 P := Generic_Parent (Specification
4486 (Unit_Declaration_Node (S)));
4489 and then Chars (Scope (P)) = Chars (O_Name)
4490 and then Chars (P) = Chars (Selector)
4501 -- If this is a selection from Ada, System or Interfaces, then
4502 -- we assume a missing with for the corresponding package.
4504 if Is_Known_Unit (N) then
4505 if not Error_Posted (N) then
4506 Error_Msg_Node_2 := Selector;
4507 Error_Msg_N ("missing `WITH &.&;`", Prefix (N));
4510 -- If this is a selection from a dummy package, then suppress
4511 -- the error message, of course the entity is missing if the
4512 -- package is missing!
4514 elsif Sloc (Error_Msg_Node_2) = No_Location then
4517 -- Here we have the case of an undefined component
4520 Error_Msg_NE ("& not declared in&", N, Selector);
4522 -- Check for misspelling of some entity in prefix
4524 Id := First_Entity (P_Name);
4525 while Present (Id) loop
4526 if Is_Bad_Spelling_Of (Chars (Id), Chars (Selector))
4527 and then not Is_Internal_Name (Chars (Id))
4530 ("possible misspelling of&", Selector, Id);
4537 -- Specialize the message if this may be an instantiation
4538 -- of a child unit that was not mentioned in the context.
4540 if Nkind (Parent (N)) = N_Package_Instantiation
4541 and then Is_Generic_Instance (Entity (Prefix (N)))
4542 and then Is_Compilation_Unit
4543 (Generic_Parent (Parent (Entity (Prefix (N)))))
4545 Error_Msg_Node_2 := Selector;
4546 Error_Msg_N ("\missing `WITH &.&;`", Prefix (N));
4556 if Comes_From_Source (N)
4557 and then Is_Remote_Access_To_Subprogram_Type (Id)
4558 and then Present (Equivalent_Type (Id))
4560 -- If we are not actually generating distribution code (i.e. the
4561 -- current PCS is the dummy non-distributed version), then the
4562 -- Equivalent_Type will be missing, and Id should be treated as
4563 -- a regular access-to-subprogram type.
4565 Id := Equivalent_Type (Id);
4566 Set_Chars (Selector, Chars (Id));
4569 -- Ada 2005 (AI-50217): Check usage of entities in limited withed units
4571 if Ekind (P_Name) = E_Package
4572 and then From_With_Type (P_Name)
4574 if From_With_Type (Id)
4575 or else Is_Type (Id)
4576 or else Ekind (Id) = E_Package
4581 ("limited withed package can only be used to access "
4582 & "incomplete types",
4587 if Is_Task_Type (P_Name)
4588 and then ((Ekind (Id) = E_Entry
4589 and then Nkind (Parent (N)) /= N_Attribute_Reference)
4591 (Ekind (Id) = E_Entry_Family
4593 Nkind (Parent (Parent (N))) /= N_Attribute_Reference))
4595 -- It is an entry call after all, either to the current task (which
4596 -- will deadlock) or to an enclosing task.
4598 Analyze_Selected_Component (N);
4602 Change_Selected_Component_To_Expanded_Name (N);
4604 -- Do style check and generate reference, but skip both steps if this
4605 -- entity has homonyms, since we may not have the right homonym set yet.
4606 -- The proper homonym will be set during the resolve phase.
4608 if Has_Homonym (Id) then
4611 Set_Entity_With_Style_Check (N, Id);
4612 Generate_Reference (Id, N);
4615 if Is_Type (Id) then
4618 Set_Etype (N, Get_Full_View (Etype (Id)));
4621 -- If the Ekind of the entity is Void, it means that all homonyms are
4622 -- hidden from all visibility (RM 8.3(5,14-20)).
4624 if Ekind (Id) = E_Void then
4625 Premature_Usage (N);
4627 elsif Is_Overloadable (Id)
4628 and then Present (Homonym (Id))
4631 H : Entity_Id := Homonym (Id);
4634 while Present (H) loop
4635 if Scope (H) = Scope (Id)
4638 or else Is_Immediately_Visible (H))
4640 Collect_Interps (N);
4647 -- If an extension of System is present, collect possible explicit
4648 -- overloadings declared in the extension.
4650 if Chars (P_Name) = Name_System
4651 and then Scope (P_Name) = Standard_Standard
4652 and then Present (System_Extend_Unit)
4653 and then Present_System_Aux (N)
4655 H := Current_Entity (Id);
4657 while Present (H) loop
4658 if Scope (H) = System_Aux_Id then
4659 Add_One_Interp (N, H, Etype (H));
4668 if Nkind (Selector_Name (N)) = N_Operator_Symbol
4669 and then Scope (Id) /= Standard_Standard
4671 -- In addition to user-defined operators in the given scope, there
4672 -- may be an implicit instance of the predefined operator. The
4673 -- operator (defined in Standard) is found in Has_Implicit_Operator,
4674 -- and added to the interpretations. Procedure Add_One_Interp will
4675 -- determine which hides which.
4677 if Has_Implicit_Operator (N) then
4681 end Find_Expanded_Name;
4683 -------------------------
4684 -- Find_Renamed_Entity --
4685 -------------------------
4687 function Find_Renamed_Entity
4691 Is_Actual : Boolean := False) return Entity_Id
4694 I1 : Interp_Index := 0; -- Suppress junk warnings
4700 function Enclosing_Instance return Entity_Id;
4701 -- If the renaming determines the entity for the default of a formal
4702 -- subprogram nested within another instance, choose the innermost
4703 -- candidate. This is because if the formal has a box, and we are within
4704 -- an enclosing instance where some candidate interpretations are local
4705 -- to this enclosing instance, we know that the default was properly
4706 -- resolved when analyzing the generic, so we prefer the local
4707 -- candidates to those that are external. This is not always the case
4708 -- but is a reasonable heuristic on the use of nested generics. The
4709 -- proper solution requires a full renaming model.
4711 function Is_Visible_Operation (Op : Entity_Id) return Boolean;
4712 -- If the renamed entity is an implicit operator, check whether it is
4713 -- visible because its operand type is properly visible. This check
4714 -- applies to explicit renamed entities that appear in the source in a
4715 -- renaming declaration or a formal subprogram instance, but not to
4716 -- default generic actuals with a name.
4718 function Report_Overload return Entity_Id;
4719 -- List possible interpretations, and specialize message in the
4720 -- case of a generic actual.
4722 function Within (Inner, Outer : Entity_Id) return Boolean;
4723 -- Determine whether a candidate subprogram is defined within the
4724 -- enclosing instance. If yes, it has precedence over outer candidates.
4726 ------------------------
4727 -- Enclosing_Instance --
4728 ------------------------
4730 function Enclosing_Instance return Entity_Id is
4734 if not Is_Generic_Instance (Current_Scope)
4735 and then not Is_Actual
4740 S := Scope (Current_Scope);
4741 while S /= Standard_Standard loop
4742 if Is_Generic_Instance (S) then
4750 end Enclosing_Instance;
4752 --------------------------
4753 -- Is_Visible_Operation --
4754 --------------------------
4756 function Is_Visible_Operation (Op : Entity_Id) return Boolean is
4762 if Ekind (Op) /= E_Operator
4763 or else Scope (Op) /= Standard_Standard
4764 or else (In_Instance
4767 or else Present (Enclosing_Instance)))
4772 -- For a fixed point type operator, check the resulting type,
4773 -- because it may be a mixed mode integer * fixed operation.
4775 if Present (Next_Formal (First_Formal (New_S)))
4776 and then Is_Fixed_Point_Type (Etype (New_S))
4778 Typ := Etype (New_S);
4780 Typ := Etype (First_Formal (New_S));
4783 Btyp := Base_Type (Typ);
4785 if Nkind (Nam) /= N_Expanded_Name then
4786 return (In_Open_Scopes (Scope (Btyp))
4787 or else Is_Potentially_Use_Visible (Btyp)
4788 or else In_Use (Btyp)
4789 or else In_Use (Scope (Btyp)));
4792 Scop := Entity (Prefix (Nam));
4794 if Ekind (Scop) = E_Package
4795 and then Present (Renamed_Object (Scop))
4797 Scop := Renamed_Object (Scop);
4800 -- Operator is visible if prefix of expanded name denotes
4801 -- scope of type, or else type type is defined in System_Aux
4802 -- and the prefix denotes System.
4804 return Scope (Btyp) = Scop
4805 or else (Scope (Btyp) = System_Aux_Id
4806 and then Scope (Scope (Btyp)) = Scop);
4809 end Is_Visible_Operation;
4815 function Within (Inner, Outer : Entity_Id) return Boolean is
4819 Sc := Scope (Inner);
4820 while Sc /= Standard_Standard loop
4831 ---------------------
4832 -- Report_Overload --
4833 ---------------------
4835 function Report_Overload return Entity_Id is
4839 ("ambiguous actual subprogram&, " &
4840 "possible interpretations:", N, Nam);
4843 ("ambiguous subprogram, " &
4844 "possible interpretations:", N);
4847 List_Interps (Nam, N);
4849 end Report_Overload;
4851 -- Start of processing for Find_Renamed_Entry
4855 Candidate_Renaming := Empty;
4857 if not Is_Overloaded (Nam) then
4858 if Entity_Matches_Spec (Entity (Nam), New_S)
4859 and then Is_Visible_Operation (Entity (Nam))
4861 Old_S := Entity (Nam);
4864 Present (First_Formal (Entity (Nam)))
4865 and then Present (First_Formal (New_S))
4866 and then (Base_Type (Etype (First_Formal (Entity (Nam))))
4867 = Base_Type (Etype (First_Formal (New_S))))
4869 Candidate_Renaming := Entity (Nam);
4873 Get_First_Interp (Nam, Ind, It);
4874 while Present (It.Nam) loop
4875 if Entity_Matches_Spec (It.Nam, New_S)
4876 and then Is_Visible_Operation (It.Nam)
4878 if Old_S /= Any_Id then
4880 -- Note: The call to Disambiguate only happens if a
4881 -- previous interpretation was found, in which case I1
4882 -- has received a value.
4884 It1 := Disambiguate (Nam, I1, Ind, Etype (Old_S));
4886 if It1 = No_Interp then
4887 Inst := Enclosing_Instance;
4889 if Present (Inst) then
4890 if Within (It.Nam, Inst) then
4892 elsif Within (Old_S, Inst) then
4895 return Report_Overload;
4899 return Report_Overload;
4913 Present (First_Formal (It.Nam))
4914 and then Present (First_Formal (New_S))
4915 and then (Base_Type (Etype (First_Formal (It.Nam)))
4916 = Base_Type (Etype (First_Formal (New_S))))
4918 Candidate_Renaming := It.Nam;
4921 Get_Next_Interp (Ind, It);
4924 Set_Entity (Nam, Old_S);
4925 Set_Is_Overloaded (Nam, False);
4929 end Find_Renamed_Entity;
4931 -----------------------------
4932 -- Find_Selected_Component --
4933 -----------------------------
4935 procedure Find_Selected_Component (N : Node_Id) is
4936 P : constant Node_Id := Prefix (N);
4939 -- Entity denoted by prefix
4949 if Nkind (P) = N_Error then
4952 -- If the selector already has an entity, the node has been constructed
4953 -- in the course of expansion, and is known to be valid. Do not verify
4954 -- that it is defined for the type (it may be a private component used
4955 -- in the expansion of record equality).
4957 elsif Present (Entity (Selector_Name (N))) then
4959 or else Etype (N) = Any_Type
4962 Sel_Name : constant Node_Id := Selector_Name (N);
4963 Selector : constant Entity_Id := Entity (Sel_Name);
4967 Set_Etype (Sel_Name, Etype (Selector));
4969 if not Is_Entity_Name (P) then
4973 -- Build an actual subtype except for the first parameter
4974 -- of an init proc, where this actual subtype is by
4975 -- definition incorrect, since the object is uninitialized
4976 -- (and does not even have defined discriminants etc.)
4978 if Is_Entity_Name (P)
4979 and then Ekind (Entity (P)) = E_Function
4981 Nam := New_Copy (P);
4983 if Is_Overloaded (P) then
4984 Save_Interps (P, Nam);
4988 Make_Function_Call (Sloc (P), Name => Nam));
4990 Analyze_Selected_Component (N);
4993 elsif Ekind (Selector) = E_Component
4994 and then (not Is_Entity_Name (P)
4995 or else Chars (Entity (P)) /= Name_uInit)
4998 Build_Actual_Subtype_Of_Component (
4999 Etype (Selector), N);
5004 if No (C_Etype) then
5005 C_Etype := Etype (Selector);
5007 Insert_Action (N, C_Etype);
5008 C_Etype := Defining_Identifier (C_Etype);
5011 Set_Etype (N, C_Etype);
5014 -- If this is the name of an entry or protected operation, and
5015 -- the prefix is an access type, insert an explicit dereference,
5016 -- so that entry calls are treated uniformly.
5018 if Is_Access_Type (Etype (P))
5019 and then Is_Concurrent_Type (Designated_Type (Etype (P)))
5022 New_P : constant Node_Id :=
5023 Make_Explicit_Dereference (Sloc (P),
5024 Prefix => Relocate_Node (P));
5027 Set_Etype (P, Designated_Type (Etype (Prefix (P))));
5031 -- If the selected component appears within a default expression
5032 -- and it has an actual subtype, the pre-analysis has not yet
5033 -- completed its analysis, because Insert_Actions is disabled in
5034 -- that context. Within the init proc of the enclosing type we
5035 -- must complete this analysis, if an actual subtype was created.
5037 elsif Inside_Init_Proc then
5039 Typ : constant Entity_Id := Etype (N);
5040 Decl : constant Node_Id := Declaration_Node (Typ);
5042 if Nkind (Decl) = N_Subtype_Declaration
5043 and then not Analyzed (Decl)
5044 and then Is_List_Member (Decl)
5045 and then No (Parent (Decl))
5048 Insert_Action (N, Decl);
5055 elsif Is_Entity_Name (P) then
5056 P_Name := Entity (P);
5058 -- The prefix may denote an enclosing type which is the completion
5059 -- of an incomplete type declaration.
5061 if Is_Type (P_Name) then
5062 Set_Entity (P, Get_Full_View (P_Name));
5063 Set_Etype (P, Entity (P));
5064 P_Name := Entity (P);
5067 P_Type := Base_Type (Etype (P));
5069 if Debug_Flag_E then
5070 Write_Str ("Found prefix type to be ");
5071 Write_Entity_Info (P_Type, " "); Write_Eol;
5074 -- First check for components of a record object (not the
5075 -- result of a call, which is handled below).
5077 if Is_Appropriate_For_Record (P_Type)
5078 and then not Is_Overloadable (P_Name)
5079 and then not Is_Type (P_Name)
5081 -- Selected component of record. Type checking will validate
5082 -- name of selector.
5083 -- ??? could we rewrite an implicit dereference into an explicit
5086 Analyze_Selected_Component (N);
5088 elsif Is_Appropriate_For_Entry_Prefix (P_Type)
5089 and then not In_Open_Scopes (P_Name)
5090 and then (not Is_Concurrent_Type (Etype (P_Name))
5091 or else not In_Open_Scopes (Etype (P_Name)))
5093 -- Call to protected operation or entry. Type checking is
5094 -- needed on the prefix.
5096 Analyze_Selected_Component (N);
5098 elsif (In_Open_Scopes (P_Name)
5099 and then Ekind (P_Name) /= E_Void
5100 and then not Is_Overloadable (P_Name))
5101 or else (Is_Concurrent_Type (Etype (P_Name))
5102 and then In_Open_Scopes (Etype (P_Name)))
5104 -- Prefix denotes an enclosing loop, block, or task, i.e. an
5105 -- enclosing construct that is not a subprogram or accept.
5107 Find_Expanded_Name (N);
5109 elsif Ekind (P_Name) = E_Package then
5110 Find_Expanded_Name (N);
5112 elsif Is_Overloadable (P_Name) then
5114 -- The subprogram may be a renaming (of an enclosing scope) as
5115 -- in the case of the name of the generic within an instantiation.
5117 if (Ekind (P_Name) = E_Procedure
5118 or else Ekind (P_Name) = E_Function)
5119 and then Present (Alias (P_Name))
5120 and then Is_Generic_Instance (Alias (P_Name))
5122 P_Name := Alias (P_Name);
5125 if Is_Overloaded (P) then
5127 -- The prefix must resolve to a unique enclosing construct
5130 Found : Boolean := False;
5135 Get_First_Interp (P, Ind, It);
5136 while Present (It.Nam) loop
5137 if In_Open_Scopes (It.Nam) then
5140 "prefix must be unique enclosing scope", N);
5141 Set_Entity (N, Any_Id);
5142 Set_Etype (N, Any_Type);
5151 Get_Next_Interp (Ind, It);
5156 if In_Open_Scopes (P_Name) then
5157 Set_Entity (P, P_Name);
5158 Set_Is_Overloaded (P, False);
5159 Find_Expanded_Name (N);
5162 -- If no interpretation as an expanded name is possible, it
5163 -- must be a selected component of a record returned by a
5164 -- function call. Reformat prefix as a function call, the rest
5165 -- is done by type resolution. If the prefix is procedure or
5166 -- entry, as is P.X; this is an error.
5168 if Ekind (P_Name) /= E_Function
5169 and then (not Is_Overloaded (P)
5171 Nkind (Parent (N)) = N_Procedure_Call_Statement)
5173 -- Prefix may mention a package that is hidden by a local
5174 -- declaration: let the user know. Scan the full homonym
5175 -- chain, the candidate package may be anywhere on it.
5177 if Present (Homonym (Current_Entity (P_Name))) then
5179 P_Name := Current_Entity (P_Name);
5181 while Present (P_Name) loop
5182 exit when Ekind (P_Name) = E_Package;
5183 P_Name := Homonym (P_Name);
5186 if Present (P_Name) then
5187 Error_Msg_Sloc := Sloc (Entity (Prefix (N)));
5190 ("package& is hidden by declaration#",
5193 Set_Entity (Prefix (N), P_Name);
5194 Find_Expanded_Name (N);
5197 P_Name := Entity (Prefix (N));
5202 ("invalid prefix in selected component&", N, P_Name);
5203 Change_Selected_Component_To_Expanded_Name (N);
5204 Set_Entity (N, Any_Id);
5205 Set_Etype (N, Any_Type);
5208 Nam := New_Copy (P);
5209 Save_Interps (P, Nam);
5211 Make_Function_Call (Sloc (P), Name => Nam));
5213 Analyze_Selected_Component (N);
5217 -- Remaining cases generate various error messages
5220 -- Format node as expanded name, to avoid cascaded errors
5222 Change_Selected_Component_To_Expanded_Name (N);
5223 Set_Entity (N, Any_Id);
5224 Set_Etype (N, Any_Type);
5226 -- Issue error message, but avoid this if error issued already.
5227 -- Use identifier of prefix if one is available.
5229 if P_Name = Any_Id then
5232 elsif Ekind (P_Name) = E_Void then
5233 Premature_Usage (P);
5235 elsif Nkind (P) /= N_Attribute_Reference then
5237 "invalid prefix in selected component&", P);
5239 if Is_Access_Type (P_Type)
5240 and then Ekind (Designated_Type (P_Type)) = E_Incomplete_Type
5243 ("\dereference must not be of an incomplete type " &
5249 "invalid prefix in selected component", P);
5254 -- If prefix is not the name of an entity, it must be an expression,
5255 -- whose type is appropriate for a record. This is determined by
5258 Analyze_Selected_Component (N);
5260 end Find_Selected_Component;
5266 procedure Find_Type (N : Node_Id) is
5276 elsif Nkind (N) = N_Attribute_Reference then
5278 -- Class attribute. This is not valid in Ada 83 mode, but we do not
5279 -- need to enforce that at this point, since the declaration of the
5280 -- tagged type in the prefix would have been flagged already.
5282 if Attribute_Name (N) = Name_Class then
5283 Check_Restriction (No_Dispatch, N);
5284 Find_Type (Prefix (N));
5286 -- Propagate error from bad prefix
5288 if Etype (Prefix (N)) = Any_Type then
5289 Set_Entity (N, Any_Type);
5290 Set_Etype (N, Any_Type);
5294 T := Base_Type (Entity (Prefix (N)));
5296 -- Case where type is not known to be tagged. Its appearance in
5297 -- the prefix of the 'Class attribute indicates that the full view
5300 if not Is_Tagged_Type (T) then
5301 if Ekind (T) = E_Incomplete_Type then
5303 -- It is legal to denote the class type of an incomplete
5304 -- type. The full type will have to be tagged, of course.
5305 -- In Ada 2005 this usage is declared obsolescent, so we
5306 -- warn accordingly.
5308 -- ??? This test is temporarily disabled (always False)
5309 -- because it causes an unwanted warning on GNAT sources
5310 -- (built with -gnatg, which includes Warn_On_Obsolescent_
5311 -- Feature). Once this issue is cleared in the sources, it
5314 if not Is_Tagged_Type (T)
5315 and then Ada_Version >= Ada_05
5316 and then Warn_On_Obsolescent_Feature
5320 ("applying 'Class to an untagged incomplete type"
5321 & " is an obsolescent feature (RM J.11)", N);
5324 Set_Is_Tagged_Type (T);
5325 Set_Primitive_Operations (T, New_Elmt_List);
5326 Make_Class_Wide_Type (T);
5327 Set_Entity (N, Class_Wide_Type (T));
5328 Set_Etype (N, Class_Wide_Type (T));
5330 elsif Ekind (T) = E_Private_Type
5331 and then not Is_Generic_Type (T)
5332 and then In_Private_Part (Scope (T))
5334 -- The Class attribute can be applied to an untagged private
5335 -- type fulfilled by a tagged type prior to the full type
5336 -- declaration (but only within the parent package's private
5337 -- part). Create the class-wide type now and check that the
5338 -- full type is tagged later during its analysis. Note that
5339 -- we do not mark the private type as tagged, unlike the
5340 -- case of incomplete types, because the type must still
5341 -- appear untagged to outside units.
5343 if No (Class_Wide_Type (T)) then
5344 Make_Class_Wide_Type (T);
5347 Set_Entity (N, Class_Wide_Type (T));
5348 Set_Etype (N, Class_Wide_Type (T));
5351 -- Should we introduce a type Any_Tagged and use Wrong_Type
5352 -- here, it would be a bit more consistent???
5355 ("tagged type required, found}",
5356 Prefix (N), First_Subtype (T));
5357 Set_Entity (N, Any_Type);
5361 -- Case of tagged type
5364 if Is_Concurrent_Type (T) then
5365 if No (Corresponding_Record_Type (Entity (Prefix (N)))) then
5367 -- Previous error. Use current type, which at least
5368 -- provides some operations.
5370 C := Entity (Prefix (N));
5373 C := Class_Wide_Type
5374 (Corresponding_Record_Type (Entity (Prefix (N))));
5378 C := Class_Wide_Type (Entity (Prefix (N)));
5381 Set_Entity_With_Style_Check (N, C);
5382 Generate_Reference (C, N);
5386 -- Base attribute, not allowed in Ada 83
5388 elsif Attribute_Name (N) = Name_Base then
5389 if Ada_Version = Ada_83 and then Comes_From_Source (N) then
5391 ("(Ada 83) Base attribute not allowed in subtype mark", N);
5394 Find_Type (Prefix (N));
5395 Typ := Entity (Prefix (N));
5397 if Ada_Version >= Ada_95
5398 and then not Is_Scalar_Type (Typ)
5399 and then not Is_Generic_Type (Typ)
5402 ("prefix of Base attribute must be scalar type",
5405 elsif Sloc (Typ) = Standard_Location
5406 and then Base_Type (Typ) = Typ
5407 and then Warn_On_Redundant_Constructs
5410 ("?redundant attribute, & is its own base type", N, Typ);
5413 T := Base_Type (Typ);
5415 -- Rewrite attribute reference with type itself (see similar
5416 -- processing in Analyze_Attribute, case Base). Preserve
5417 -- prefix if present, for other legality checks.
5419 if Nkind (Prefix (N)) = N_Expanded_Name then
5421 Make_Expanded_Name (Sloc (N),
5423 Prefix => New_Copy (Prefix (Prefix (N))),
5424 Selector_Name => New_Reference_To (T, Sloc (N))));
5427 Rewrite (N, New_Reference_To (T, Sloc (N)));
5434 elsif Attribute_Name (N) = Name_Stub_Type then
5436 -- This is handled in Analyze_Attribute
5440 -- All other attributes are invalid in a subtype mark
5443 Error_Msg_N ("invalid attribute in subtype mark", N);
5449 if Is_Entity_Name (N) then
5450 T_Name := Entity (N);
5452 Error_Msg_N ("subtype mark required in this context", N);
5453 Set_Etype (N, Any_Type);
5457 if T_Name = Any_Id or else Etype (N) = Any_Type then
5459 -- Undefined id. Make it into a valid type
5461 Set_Entity (N, Any_Type);
5463 elsif not Is_Type (T_Name)
5464 and then T_Name /= Standard_Void_Type
5466 Error_Msg_Sloc := Sloc (T_Name);
5467 Error_Msg_N ("subtype mark required in this context", N);
5468 Error_Msg_NE ("\\found & declared#", N, T_Name);
5469 Set_Entity (N, Any_Type);
5472 -- If the type is an incomplete type created to handle
5473 -- anonymous access components of a record type, then the
5474 -- incomplete type is the visible entity and subsequent
5475 -- references will point to it. Mark the original full
5476 -- type as referenced, to prevent spurious warnings.
5478 if Is_Incomplete_Type (T_Name)
5479 and then Present (Full_View (T_Name))
5480 and then not Comes_From_Source (T_Name)
5482 Set_Referenced (Full_View (T_Name));
5485 T_Name := Get_Full_View (T_Name);
5487 -- Ada 2005 (AI-251, AI-50217): Handle interfaces visible through
5488 -- limited-with clauses
5490 if From_With_Type (T_Name)
5491 and then Ekind (T_Name) in Incomplete_Kind
5492 and then Present (Non_Limited_View (T_Name))
5493 and then Is_Interface (Non_Limited_View (T_Name))
5495 T_Name := Non_Limited_View (T_Name);
5498 if In_Open_Scopes (T_Name) then
5499 if Ekind (Base_Type (T_Name)) = E_Task_Type then
5501 -- In Ada 2005, a task name can be used in an access
5502 -- definition within its own body.
5504 if Ada_Version >= Ada_05
5505 and then Nkind (Parent (N)) = N_Access_Definition
5507 Set_Entity (N, T_Name);
5508 Set_Etype (N, T_Name);
5513 ("task type cannot be used as type mark " &
5514 "within its own spec or body", N);
5517 elsif Ekind (Base_Type (T_Name)) = E_Protected_Type then
5519 -- In Ada 2005, a protected name can be used in an access
5520 -- definition within its own body.
5522 if Ada_Version >= Ada_05
5523 and then Nkind (Parent (N)) = N_Access_Definition
5525 Set_Entity (N, T_Name);
5526 Set_Etype (N, T_Name);
5531 ("protected type cannot be used as type mark " &
5532 "within its own spec or body", N);
5536 Error_Msg_N ("type declaration cannot refer to itself", N);
5539 Set_Etype (N, Any_Type);
5540 Set_Entity (N, Any_Type);
5541 Set_Error_Posted (T_Name);
5545 Set_Entity (N, T_Name);
5546 Set_Etype (N, T_Name);
5550 if Present (Etype (N)) and then Comes_From_Source (N) then
5551 if Is_Fixed_Point_Type (Etype (N)) then
5552 Check_Restriction (No_Fixed_Point, N);
5553 elsif Is_Floating_Point_Type (Etype (N)) then
5554 Check_Restriction (No_Floating_Point, N);
5559 ------------------------------------
5560 -- Has_Implicit_Character_Literal --
5561 ------------------------------------
5563 function Has_Implicit_Character_Literal (N : Node_Id) return Boolean is
5565 Found : Boolean := False;
5566 P : constant Entity_Id := Entity (Prefix (N));
5567 Priv_Id : Entity_Id := Empty;
5570 if Ekind (P) = E_Package
5571 and then not In_Open_Scopes (P)
5573 Priv_Id := First_Private_Entity (P);
5576 if P = Standard_Standard then
5577 Change_Selected_Component_To_Expanded_Name (N);
5578 Rewrite (N, Selector_Name (N));
5580 Set_Etype (Original_Node (N), Standard_Character);
5584 Id := First_Entity (P);
5586 and then Id /= Priv_Id
5588 if Is_Standard_Character_Type (Id)
5589 and then Id = Base_Type (Id)
5591 -- We replace the node with the literal itself, resolve as a
5592 -- character, and set the type correctly.
5595 Change_Selected_Component_To_Expanded_Name (N);
5596 Rewrite (N, Selector_Name (N));
5599 Set_Etype (Original_Node (N), Id);
5603 -- More than one type derived from Character in given scope.
5604 -- Collect all possible interpretations.
5606 Add_One_Interp (N, Id, Id);
5614 end Has_Implicit_Character_Literal;
5616 ----------------------
5617 -- Has_Private_With --
5618 ----------------------
5620 function Has_Private_With (E : Entity_Id) return Boolean is
5621 Comp_Unit : constant Node_Id := Cunit (Current_Sem_Unit);
5625 Item := First (Context_Items (Comp_Unit));
5626 while Present (Item) loop
5627 if Nkind (Item) = N_With_Clause
5628 and then Private_Present (Item)
5629 and then Entity (Name (Item)) = E
5638 end Has_Private_With;
5640 ---------------------------
5641 -- Has_Implicit_Operator --
5642 ---------------------------
5644 function Has_Implicit_Operator (N : Node_Id) return Boolean is
5645 Op_Id : constant Name_Id := Chars (Selector_Name (N));
5646 P : constant Entity_Id := Entity (Prefix (N));
5648 Priv_Id : Entity_Id := Empty;
5650 procedure Add_Implicit_Operator
5652 Op_Type : Entity_Id := Empty);
5653 -- Add implicit interpretation to node N, using the type for which a
5654 -- predefined operator exists. If the operator yields a boolean type,
5655 -- the Operand_Type is implicitly referenced by the operator, and a
5656 -- reference to it must be generated.
5658 ---------------------------
5659 -- Add_Implicit_Operator --
5660 ---------------------------
5662 procedure Add_Implicit_Operator
5664 Op_Type : Entity_Id := Empty)
5666 Predef_Op : Entity_Id;
5669 Predef_Op := Current_Entity (Selector_Name (N));
5671 while Present (Predef_Op)
5672 and then Scope (Predef_Op) /= Standard_Standard
5674 Predef_Op := Homonym (Predef_Op);
5677 if Nkind (N) = N_Selected_Component then
5678 Change_Selected_Component_To_Expanded_Name (N);
5681 Add_One_Interp (N, Predef_Op, T);
5683 -- For operators with unary and binary interpretations, add both
5685 if Present (Homonym (Predef_Op)) then
5686 Add_One_Interp (N, Homonym (Predef_Op), T);
5689 -- The node is a reference to a predefined operator, and
5690 -- an implicit reference to the type of its operands.
5692 if Present (Op_Type) then
5693 Generate_Operator_Reference (N, Op_Type);
5695 Generate_Operator_Reference (N, T);
5697 end Add_Implicit_Operator;
5699 -- Start of processing for Has_Implicit_Operator
5702 if Ekind (P) = E_Package
5703 and then not In_Open_Scopes (P)
5705 Priv_Id := First_Private_Entity (P);
5708 Id := First_Entity (P);
5712 -- Boolean operators: an implicit declaration exists if the scope
5713 -- contains a declaration for a derived Boolean type, or for an
5714 -- array of Boolean type.
5716 when Name_Op_And | Name_Op_Not | Name_Op_Or | Name_Op_Xor =>
5717 while Id /= Priv_Id loop
5718 if Valid_Boolean_Arg (Id)
5719 and then Id = Base_Type (Id)
5721 Add_Implicit_Operator (Id);
5728 -- Equality: look for any non-limited type (result is Boolean)
5730 when Name_Op_Eq | Name_Op_Ne =>
5731 while Id /= Priv_Id loop
5733 and then not Is_Limited_Type (Id)
5734 and then Id = Base_Type (Id)
5736 Add_Implicit_Operator (Standard_Boolean, Id);
5743 -- Comparison operators: scalar type, or array of scalar
5745 when Name_Op_Lt | Name_Op_Le | Name_Op_Gt | Name_Op_Ge =>
5746 while Id /= Priv_Id loop
5747 if (Is_Scalar_Type (Id)
5748 or else (Is_Array_Type (Id)
5749 and then Is_Scalar_Type (Component_Type (Id))))
5750 and then Id = Base_Type (Id)
5752 Add_Implicit_Operator (Standard_Boolean, Id);
5759 -- Arithmetic operators: any numeric type
5769 while Id /= Priv_Id loop
5770 if Is_Numeric_Type (Id)
5771 and then Id = Base_Type (Id)
5773 Add_Implicit_Operator (Id);
5780 -- Concatenation: any one-dimensional array type
5782 when Name_Op_Concat =>
5783 while Id /= Priv_Id loop
5784 if Is_Array_Type (Id) and then Number_Dimensions (Id) = 1
5785 and then Id = Base_Type (Id)
5787 Add_Implicit_Operator (Id);
5794 -- What is the others condition here? Should we be using a
5795 -- subtype of Name_Id that would restrict to operators ???
5797 when others => null;
5800 -- If we fall through, then we do not have an implicit operator
5804 end Has_Implicit_Operator;
5806 --------------------
5807 -- In_Open_Scopes --
5808 --------------------
5810 function In_Open_Scopes (S : Entity_Id) return Boolean is
5812 -- Several scope stacks are maintained by Scope_Stack. The base of the
5813 -- currently active scope stack is denoted by the Is_Active_Stack_Base
5814 -- flag in the scope stack entry. Note that the scope stacks used to
5815 -- simply be delimited implicitly by the presence of Standard_Standard
5816 -- at their base, but there now are cases where this is not sufficient
5817 -- because Standard_Standard actually may appear in the middle of the
5818 -- active set of scopes.
5820 for J in reverse 0 .. Scope_Stack.Last loop
5821 if Scope_Stack.Table (J).Entity = S then
5825 -- Check Is_Active_Stack_Base to tell us when to stop, as there are
5826 -- cases where Standard_Standard appears in the middle of the active
5827 -- set of scopes. This affects the declaration and overriding of
5828 -- private inherited operations in instantiations of generic child
5831 exit when Scope_Stack.Table (J).Is_Active_Stack_Base;
5837 -----------------------------
5838 -- Inherit_Renamed_Profile --
5839 -----------------------------
5841 procedure Inherit_Renamed_Profile (New_S : Entity_Id; Old_S : Entity_Id) is
5848 if Ekind (Old_S) = E_Operator then
5849 New_F := First_Formal (New_S);
5851 while Present (New_F) loop
5852 Set_Etype (New_F, Base_Type (Etype (New_F)));
5853 Next_Formal (New_F);
5856 Set_Etype (New_S, Base_Type (Etype (New_S)));
5859 New_F := First_Formal (New_S);
5860 Old_F := First_Formal (Old_S);
5862 while Present (New_F) loop
5863 New_T := Etype (New_F);
5864 Old_T := Etype (Old_F);
5866 -- If the new type is a renaming of the old one, as is the
5867 -- case for actuals in instances, retain its name, to simplify
5868 -- later disambiguation.
5870 if Nkind (Parent (New_T)) = N_Subtype_Declaration
5871 and then Is_Entity_Name (Subtype_Indication (Parent (New_T)))
5872 and then Entity (Subtype_Indication (Parent (New_T))) = Old_T
5876 Set_Etype (New_F, Old_T);
5879 Next_Formal (New_F);
5880 Next_Formal (Old_F);
5883 if Ekind (Old_S) = E_Function
5884 or else Ekind (Old_S) = E_Enumeration_Literal
5886 Set_Etype (New_S, Etype (Old_S));
5889 end Inherit_Renamed_Profile;
5895 procedure Initialize is
5900 -------------------------
5901 -- Install_Use_Clauses --
5902 -------------------------
5904 procedure Install_Use_Clauses
5906 Force_Installation : Boolean := False)
5914 while Present (U) loop
5916 -- Case of USE package
5918 if Nkind (U) = N_Use_Package_Clause then
5919 P := First (Names (U));
5920 while Present (P) loop
5923 if Ekind (Id) = E_Package then
5925 Note_Redundant_Use (P);
5927 elsif Present (Renamed_Object (Id))
5928 and then In_Use (Renamed_Object (Id))
5930 Note_Redundant_Use (P);
5932 elsif Force_Installation or else Applicable_Use (P) then
5933 Use_One_Package (Id, U);
5944 P := First (Subtype_Marks (U));
5945 while Present (P) loop
5946 if not Is_Entity_Name (P)
5947 or else No (Entity (P))
5951 elsif Entity (P) /= Any_Type then
5959 Next_Use_Clause (U);
5961 end Install_Use_Clauses;
5963 -------------------------------------
5964 -- Is_Appropriate_For_Entry_Prefix --
5965 -------------------------------------
5967 function Is_Appropriate_For_Entry_Prefix (T : Entity_Id) return Boolean is
5968 P_Type : Entity_Id := T;
5971 if Is_Access_Type (P_Type) then
5972 P_Type := Designated_Type (P_Type);
5975 return Is_Task_Type (P_Type) or else Is_Protected_Type (P_Type);
5976 end Is_Appropriate_For_Entry_Prefix;
5978 -------------------------------
5979 -- Is_Appropriate_For_Record --
5980 -------------------------------
5982 function Is_Appropriate_For_Record (T : Entity_Id) return Boolean is
5984 function Has_Components (T1 : Entity_Id) return Boolean;
5985 -- Determine if given type has components (i.e. is either a record
5986 -- type or a type that has discriminants).
5988 --------------------
5989 -- Has_Components --
5990 --------------------
5992 function Has_Components (T1 : Entity_Id) return Boolean is
5994 return Is_Record_Type (T1)
5995 or else (Is_Private_Type (T1) and then Has_Discriminants (T1))
5996 or else (Is_Task_Type (T1) and then Has_Discriminants (T1))
5997 or else (Is_Incomplete_Type (T1)
5998 and then From_With_Type (T1)
5999 and then Present (Non_Limited_View (T1))
6000 and then Is_Record_Type
6001 (Get_Full_View (Non_Limited_View (T1))));
6004 -- Start of processing for Is_Appropriate_For_Record
6009 and then (Has_Components (T)
6010 or else (Is_Access_Type (T)
6011 and then Has_Components (Designated_Type (T))));
6012 end Is_Appropriate_For_Record;
6014 ------------------------
6015 -- Note_Redundant_Use --
6016 ------------------------
6018 procedure Note_Redundant_Use (Clause : Node_Id) is
6019 Pack_Name : constant Entity_Id := Entity (Clause);
6020 Cur_Use : constant Node_Id := Current_Use_Clause (Pack_Name);
6021 Decl : constant Node_Id := Parent (Clause);
6023 Prev_Use : Node_Id := Empty;
6024 Redundant : Node_Id := Empty;
6025 -- The Use_Clause which is actually redundant. In the simplest case
6026 -- it is Pack itself, but when we compile a body we install its
6027 -- context before that of its spec, in which case it is the use_clause
6028 -- in the spec that will appear to be redundant, and we want the
6029 -- warning to be placed on the body. Similar complications appear when
6030 -- the redundancy is between a child unit and one of its ancestors.
6033 Set_Redundant_Use (Clause, True);
6035 if not Comes_From_Source (Clause)
6037 or else not Warn_On_Redundant_Constructs
6042 if not Is_Compilation_Unit (Current_Scope) then
6044 -- If the use_clause is in an inner scope, it is made redundant
6045 -- by some clause in the current context, with one exception:
6046 -- If we're compiling a nested package body, and the use_clause
6047 -- comes from the corresponding spec, the clause is not necessarily
6048 -- fully redundant, so we should not warn. If a warning was
6049 -- warranted, it would have been given when the spec was processed.
6051 if Nkind (Parent (Decl)) = N_Package_Specification then
6053 Package_Spec_Entity : constant Entity_Id :=
6054 Defining_Unit_Name (Parent (Decl));
6056 if In_Package_Body (Package_Spec_Entity) then
6062 Redundant := Clause;
6063 Prev_Use := Cur_Use;
6065 elsif Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Body then
6067 Cur_Unit : constant Unit_Number_Type := Get_Source_Unit (Cur_Use);
6068 New_Unit : constant Unit_Number_Type := Get_Source_Unit (Clause);
6072 if Cur_Unit = New_Unit then
6074 -- Redundant clause in same body
6076 Redundant := Clause;
6077 Prev_Use := Cur_Use;
6079 elsif Cur_Unit = Current_Sem_Unit then
6081 -- If the new clause is not in the current unit it has been
6082 -- analyzed first, and it makes the other one redundant.
6083 -- However, if the new clause appears in a subunit, Cur_Unit
6084 -- is still the parent, and in that case the redundant one
6085 -- is the one appearing in the subunit.
6087 if Nkind (Unit (Cunit (New_Unit))) = N_Subunit then
6088 Redundant := Clause;
6089 Prev_Use := Cur_Use;
6091 -- Most common case: redundant clause in body,
6092 -- original clause in spec. Current scope is spec entity.
6097 Unit (Library_Unit (Cunit (Current_Sem_Unit))))
6099 Redundant := Cur_Use;
6103 -- The new clause may appear in an unrelated unit, when
6104 -- the parents of a generic are being installed prior to
6105 -- instantiation. In this case there must be no warning.
6106 -- We detect this case by checking whether the current top
6107 -- of the stack is related to the current compilation.
6109 Scop := Current_Scope;
6110 while Present (Scop)
6111 and then Scop /= Standard_Standard
6113 if Is_Compilation_Unit (Scop)
6114 and then not Is_Child_Unit (Scop)
6118 elsif Scop = Cunit_Entity (Current_Sem_Unit) then
6122 Scop := Scope (Scop);
6125 Redundant := Cur_Use;
6129 elsif New_Unit = Current_Sem_Unit then
6130 Redundant := Clause;
6131 Prev_Use := Cur_Use;
6134 -- Neither is the current unit, so they appear in parent or
6135 -- sibling units. Warning will be emitted elsewhere.
6141 elsif Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Declaration
6142 and then Present (Parent_Spec (Unit (Cunit (Current_Sem_Unit))))
6144 -- Use_clause is in child unit of current unit, and the child
6145 -- unit appears in the context of the body of the parent, so it
6146 -- has been installed first, even though it is the redundant one.
6147 -- Depending on their placement in the context, the visible or the
6148 -- private parts of the two units, either might appear as redundant,
6149 -- but the message has to be on the current unit.
6151 if Get_Source_Unit (Cur_Use) = Current_Sem_Unit then
6152 Redundant := Cur_Use;
6155 Redundant := Clause;
6156 Prev_Use := Cur_Use;
6159 -- If the new use clause appears in the private part of a parent unit
6160 -- it may appear to be redundant w.r.t. a use clause in a child unit,
6161 -- but the previous use clause was needed in the visible part of the
6162 -- child, and no warning should be emitted.
6164 if Nkind (Parent (Decl)) = N_Package_Specification
6166 List_Containing (Decl) = Private_Declarations (Parent (Decl))
6169 Par : constant Entity_Id := Defining_Entity (Parent (Decl));
6170 Spec : constant Node_Id :=
6171 Specification (Unit (Cunit (Current_Sem_Unit)));
6174 if Is_Compilation_Unit (Par)
6175 and then Par /= Cunit_Entity (Current_Sem_Unit)
6176 and then Parent (Cur_Use) = Spec
6178 List_Containing (Cur_Use) = Visible_Declarations (Spec)
6185 -- Finally, if the current use clause is in the context then
6186 -- the clause is redundant when it is nested within the unit.
6188 elsif Nkind (Parent (Cur_Use)) = N_Compilation_Unit
6189 and then Nkind (Parent (Parent (Clause))) /= N_Compilation_Unit
6190 and then Get_Source_Unit (Cur_Use) = Get_Source_Unit (Clause)
6192 Redundant := Clause;
6193 Prev_Use := Cur_Use;
6199 if Present (Redundant) then
6200 Error_Msg_Sloc := Sloc (Prev_Use);
6202 ("& is already use-visible through previous use clause #?",
6203 Redundant, Pack_Name);
6205 end Note_Redundant_Use;
6211 procedure Pop_Scope is
6212 SST : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last);
6215 if Debug_Flag_E then
6219 Scope_Suppress := SST.Save_Scope_Suppress;
6220 Local_Suppress_Stack_Top := SST.Save_Local_Suppress_Stack_Top;
6221 Check_Policy_List := SST.Save_Check_Policy_List;
6223 if Debug_Flag_W then
6224 Write_Str ("--> exiting scope: ");
6225 Write_Name (Chars (Current_Scope));
6226 Write_Str (", Depth=");
6227 Write_Int (Int (Scope_Stack.Last));
6231 End_Use_Clauses (SST.First_Use_Clause);
6233 -- If the actions to be wrapped are still there they will get lost
6234 -- causing incomplete code to be generated. It is better to abort in
6235 -- this case (and we do the abort even with assertions off since the
6236 -- penalty is incorrect code generation)
6238 if SST.Actions_To_Be_Wrapped_Before /= No_List
6240 SST.Actions_To_Be_Wrapped_After /= No_List
6245 -- Free last subprogram name if allocated, and pop scope
6247 Free (SST.Last_Subprogram_Name);
6248 Scope_Stack.Decrement_Last;
6255 procedure Push_Scope (S : Entity_Id) is
6259 if Ekind (S) = E_Void then
6262 -- Set scope depth if not a non-concurrent type, and we have not
6263 -- yet set the scope depth. This means that we have the first
6264 -- occurrence of the scope, and this is where the depth is set.
6266 elsif (not Is_Type (S) or else Is_Concurrent_Type (S))
6267 and then not Scope_Depth_Set (S)
6269 if S = Standard_Standard then
6270 Set_Scope_Depth_Value (S, Uint_0);
6272 elsif Is_Child_Unit (S) then
6273 Set_Scope_Depth_Value (S, Uint_1);
6275 elsif not Is_Record_Type (Current_Scope) then
6276 if Ekind (S) = E_Loop then
6277 Set_Scope_Depth_Value (S, Scope_Depth (Current_Scope));
6279 Set_Scope_Depth_Value (S, Scope_Depth (Current_Scope) + 1);
6284 Scope_Stack.Increment_Last;
6287 SST : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last);
6291 SST.Save_Scope_Suppress := Scope_Suppress;
6292 SST.Save_Local_Suppress_Stack_Top := Local_Suppress_Stack_Top;
6293 SST.Save_Check_Policy_List := Check_Policy_List;
6295 if Scope_Stack.Last > Scope_Stack.First then
6296 SST.Component_Alignment_Default := Scope_Stack.Table
6297 (Scope_Stack.Last - 1).
6298 Component_Alignment_Default;
6301 SST.Last_Subprogram_Name := null;
6302 SST.Is_Transient := False;
6303 SST.Node_To_Be_Wrapped := Empty;
6304 SST.Pending_Freeze_Actions := No_List;
6305 SST.Actions_To_Be_Wrapped_Before := No_List;
6306 SST.Actions_To_Be_Wrapped_After := No_List;
6307 SST.First_Use_Clause := Empty;
6308 SST.Is_Active_Stack_Base := False;
6309 SST.Previous_Visibility := False;
6312 if Debug_Flag_W then
6313 Write_Str ("--> new scope: ");
6314 Write_Name (Chars (Current_Scope));
6315 Write_Str (", Id=");
6316 Write_Int (Int (Current_Scope));
6317 Write_Str (", Depth=");
6318 Write_Int (Int (Scope_Stack.Last));
6322 -- Deal with copying flags from the previous scope to this one. This
6323 -- is not necessary if either scope is standard, or if the new scope
6326 if S /= Standard_Standard
6327 and then Scope (S) /= Standard_Standard
6328 and then not Is_Child_Unit (S)
6332 if Nkind (E) not in N_Entity then
6336 -- Copy categorization flags from Scope (S) to S, this is not done
6337 -- when Scope (S) is Standard_Standard since propagation is from
6338 -- library unit entity inwards. Copy other relevant attributes as
6339 -- well (Discard_Names in particular).
6341 -- We only propagate inwards for library level entities,
6342 -- inner level subprograms do not inherit the categorization.
6344 if Is_Library_Level_Entity (S) then
6345 Set_Is_Preelaborated (S, Is_Preelaborated (E));
6346 Set_Is_Shared_Passive (S, Is_Shared_Passive (E));
6347 Set_Discard_Names (S, Discard_Names (E));
6348 Set_Suppress_Value_Tracking_On_Call
6349 (S, Suppress_Value_Tracking_On_Call (E));
6350 Set_Categorization_From_Scope (E => S, Scop => E);
6355 ---------------------
6356 -- Premature_Usage --
6357 ---------------------
6359 procedure Premature_Usage (N : Node_Id) is
6360 Kind : constant Node_Kind := Nkind (Parent (Entity (N)));
6361 E : Entity_Id := Entity (N);
6364 -- Within an instance, the analysis of the actual for a formal object
6365 -- does not see the name of the object itself. This is significant only
6366 -- if the object is an aggregate, where its analysis does not do any
6367 -- name resolution on component associations. (see 4717-008). In such a
6368 -- case, look for the visible homonym on the chain.
6371 and then Present (Homonym (E))
6376 and then not In_Open_Scopes (Scope (E))
6383 Set_Etype (N, Etype (E));
6388 if Kind = N_Component_Declaration then
6390 ("component&! cannot be used before end of record declaration", N);
6392 elsif Kind = N_Parameter_Specification then
6394 ("formal parameter&! cannot be used before end of specification",
6397 elsif Kind = N_Discriminant_Specification then
6399 ("discriminant&! cannot be used before end of discriminant part",
6402 elsif Kind = N_Procedure_Specification
6403 or else Kind = N_Function_Specification
6406 ("subprogram&! cannot be used before end of its declaration",
6409 elsif Kind = N_Full_Type_Declaration then
6411 ("type& cannot be used before end of its declaration!", N);
6415 ("object& cannot be used before end of its declaration!", N);
6417 end Premature_Usage;
6419 ------------------------
6420 -- Present_System_Aux --
6421 ------------------------
6423 function Present_System_Aux (N : Node_Id := Empty) return Boolean is
6425 Aux_Name : Unit_Name_Type;
6426 Unum : Unit_Number_Type;
6431 function Find_System (C_Unit : Node_Id) return Entity_Id;
6432 -- Scan context clause of compilation unit to find with_clause
6439 function Find_System (C_Unit : Node_Id) return Entity_Id is
6440 With_Clause : Node_Id;
6443 With_Clause := First (Context_Items (C_Unit));
6444 while Present (With_Clause) loop
6445 if (Nkind (With_Clause) = N_With_Clause
6446 and then Chars (Name (With_Clause)) = Name_System)
6447 and then Comes_From_Source (With_Clause)
6458 -- Start of processing for Present_System_Aux
6461 -- The child unit may have been loaded and analyzed already
6463 if Present (System_Aux_Id) then
6466 -- If no previous pragma for System.Aux, nothing to load
6468 elsif No (System_Extend_Unit) then
6471 -- Use the unit name given in the pragma to retrieve the unit.
6472 -- Verify that System itself appears in the context clause of the
6473 -- current compilation. If System is not present, an error will
6474 -- have been reported already.
6477 With_Sys := Find_System (Cunit (Current_Sem_Unit));
6479 The_Unit := Unit (Cunit (Current_Sem_Unit));
6483 (Nkind (The_Unit) = N_Package_Body
6484 or else (Nkind (The_Unit) = N_Subprogram_Body
6486 not Acts_As_Spec (Cunit (Current_Sem_Unit))))
6488 With_Sys := Find_System (Library_Unit (Cunit (Current_Sem_Unit)));
6492 and then Present (N)
6494 -- If we are compiling a subunit, we need to examine its
6495 -- context as well (Current_Sem_Unit is the parent unit);
6497 The_Unit := Parent (N);
6498 while Nkind (The_Unit) /= N_Compilation_Unit loop
6499 The_Unit := Parent (The_Unit);
6502 if Nkind (Unit (The_Unit)) = N_Subunit then
6503 With_Sys := Find_System (The_Unit);
6507 if No (With_Sys) then
6511 Loc := Sloc (With_Sys);
6512 Get_Name_String (Chars (Expression (System_Extend_Unit)));
6513 Name_Buffer (8 .. Name_Len + 7) := Name_Buffer (1 .. Name_Len);
6514 Name_Buffer (1 .. 7) := "system.";
6515 Name_Buffer (Name_Len + 8) := '%';
6516 Name_Buffer (Name_Len + 9) := 's';
6517 Name_Len := Name_Len + 9;
6518 Aux_Name := Name_Find;
6522 (Load_Name => Aux_Name,
6525 Error_Node => With_Sys);
6527 if Unum /= No_Unit then
6528 Semantics (Cunit (Unum));
6530 Defining_Entity (Specification (Unit (Cunit (Unum))));
6533 Make_With_Clause (Loc,
6535 Make_Expanded_Name (Loc,
6536 Chars => Chars (System_Aux_Id),
6537 Prefix => New_Reference_To (Scope (System_Aux_Id), Loc),
6538 Selector_Name => New_Reference_To (System_Aux_Id, Loc)));
6540 Set_Entity (Name (Withn), System_Aux_Id);
6542 Set_Library_Unit (Withn, Cunit (Unum));
6543 Set_Corresponding_Spec (Withn, System_Aux_Id);
6544 Set_First_Name (Withn, True);
6545 Set_Implicit_With (Withn, True);
6547 Insert_After (With_Sys, Withn);
6548 Mark_Rewrite_Insertion (Withn);
6549 Set_Context_Installed (Withn);
6553 -- Here if unit load failed
6556 Error_Msg_Name_1 := Name_System;
6557 Error_Msg_Name_2 := Chars (Expression (System_Extend_Unit));
6559 ("extension package `%.%` does not exist",
6560 Opt.System_Extend_Unit);
6564 end Present_System_Aux;
6566 -------------------------
6567 -- Restore_Scope_Stack --
6568 -------------------------
6570 procedure Restore_Scope_Stack (Handle_Use : Boolean := True) is
6573 Comp_Unit : Node_Id;
6574 In_Child : Boolean := False;
6575 Full_Vis : Boolean := True;
6576 SS_Last : constant Int := Scope_Stack.Last;
6579 -- Restore visibility of previous scope stack, if any
6581 for J in reverse 0 .. Scope_Stack.Last loop
6582 exit when Scope_Stack.Table (J).Entity = Standard_Standard
6583 or else No (Scope_Stack.Table (J).Entity);
6585 S := Scope_Stack.Table (J).Entity;
6587 if not Is_Hidden_Open_Scope (S) then
6589 -- If the parent scope is hidden, its entities are hidden as
6590 -- well, unless the entity is the instantiation currently
6593 if not Is_Hidden_Open_Scope (Scope (S))
6594 or else not Analyzed (Parent (S))
6595 or else Scope (S) = Standard_Standard
6597 Set_Is_Immediately_Visible (S, True);
6600 E := First_Entity (S);
6601 while Present (E) loop
6602 if Is_Child_Unit (E) then
6603 Set_Is_Immediately_Visible (E,
6604 Is_Visible_Child_Unit (E) or else In_Open_Scopes (E));
6606 Set_Is_Immediately_Visible (E, True);
6611 if not Full_Vis then
6612 exit when E = First_Private_Entity (S);
6616 -- The visibility of child units (siblings of current compilation)
6617 -- must be restored in any case. Their declarations may appear
6618 -- after the private part of the parent.
6620 if not Full_Vis then
6621 while Present (E) loop
6622 if Is_Child_Unit (E) then
6623 Set_Is_Immediately_Visible (E,
6624 Is_Visible_Child_Unit (E) or else In_Open_Scopes (E));
6632 if Is_Child_Unit (S)
6633 and not In_Child -- check only for current unit
6637 -- Restore visibility of parents according to whether the child
6638 -- is private and whether we are in its visible part.
6640 Comp_Unit := Parent (Unit_Declaration_Node (S));
6642 if Nkind (Comp_Unit) = N_Compilation_Unit
6643 and then Private_Present (Comp_Unit)
6647 elsif Is_Package_Or_Generic_Package (S)
6648 and then (In_Private_Part (S)
6649 or else In_Package_Body (S))
6653 -- if S is the scope of some instance (which has already been
6654 -- seen on the stack) it does not affect the visibility of
6657 elsif Is_Hidden_Open_Scope (S) then
6660 elsif (Ekind (S) = E_Procedure
6661 or else Ekind (S) = E_Function)
6662 and then Has_Completion (S)
6673 if SS_Last >= Scope_Stack.First
6674 and then Scope_Stack.Table (SS_Last).Entity /= Standard_Standard
6677 Install_Use_Clauses (Scope_Stack.Table (SS_Last).First_Use_Clause);
6679 end Restore_Scope_Stack;
6681 ----------------------
6682 -- Save_Scope_Stack --
6683 ----------------------
6685 procedure Save_Scope_Stack (Handle_Use : Boolean := True) is
6688 SS_Last : constant Int := Scope_Stack.Last;
6691 if SS_Last >= Scope_Stack.First
6692 and then Scope_Stack.Table (SS_Last).Entity /= Standard_Standard
6695 End_Use_Clauses (Scope_Stack.Table (SS_Last).First_Use_Clause);
6698 -- If the call is from within a compilation unit, as when called from
6699 -- Rtsfind, make current entries in scope stack invisible while we
6700 -- analyze the new unit.
6702 for J in reverse 0 .. SS_Last loop
6703 exit when Scope_Stack.Table (J).Entity = Standard_Standard
6704 or else No (Scope_Stack.Table (J).Entity);
6706 S := Scope_Stack.Table (J).Entity;
6707 Set_Is_Immediately_Visible (S, False);
6709 E := First_Entity (S);
6710 while Present (E) loop
6711 Set_Is_Immediately_Visible (E, False);
6717 end Save_Scope_Stack;
6723 procedure Set_Use (L : List_Id) is
6725 Pack_Name : Node_Id;
6732 while Present (Decl) loop
6733 if Nkind (Decl) = N_Use_Package_Clause then
6734 Chain_Use_Clause (Decl);
6736 Pack_Name := First (Names (Decl));
6737 while Present (Pack_Name) loop
6738 Pack := Entity (Pack_Name);
6740 if Ekind (Pack) = E_Package
6741 and then Applicable_Use (Pack_Name)
6743 Use_One_Package (Pack, Decl);
6749 elsif Nkind (Decl) = N_Use_Type_Clause then
6750 Chain_Use_Clause (Decl);
6752 Id := First (Subtype_Marks (Decl));
6753 while Present (Id) loop
6754 if Entity (Id) /= Any_Type then
6767 ---------------------
6768 -- Use_One_Package --
6769 ---------------------
6771 procedure Use_One_Package (P : Entity_Id; N : Node_Id) is
6774 Current_Instance : Entity_Id := Empty;
6776 Private_With_OK : Boolean := False;
6779 if Ekind (P) /= E_Package then
6784 Set_Current_Use_Clause (P, N);
6786 -- Ada 2005 (AI-50217): Check restriction
6788 if From_With_Type (P) then
6789 Error_Msg_N ("limited withed package cannot appear in use clause", N);
6792 -- Find enclosing instance, if any
6795 Current_Instance := Current_Scope;
6796 while not Is_Generic_Instance (Current_Instance) loop
6797 Current_Instance := Scope (Current_Instance);
6800 if No (Hidden_By_Use_Clause (N)) then
6801 Set_Hidden_By_Use_Clause (N, New_Elmt_List);
6805 -- If unit is a package renaming, indicate that the renamed
6806 -- package is also in use (the flags on both entities must
6807 -- remain consistent, and a subsequent use of either of them
6808 -- should be recognized as redundant).
6810 if Present (Renamed_Object (P)) then
6811 Set_In_Use (Renamed_Object (P));
6812 Set_Current_Use_Clause (Renamed_Object (P), N);
6813 Real_P := Renamed_Object (P);
6818 -- Ada 2005 (AI-262): Check the use_clause of a private withed package
6819 -- found in the private part of a package specification
6821 if In_Private_Part (Current_Scope)
6822 and then Has_Private_With (P)
6823 and then Is_Child_Unit (Current_Scope)
6824 and then Is_Child_Unit (P)
6825 and then Is_Ancestor_Package (Scope (Current_Scope), P)
6827 Private_With_OK := True;
6830 -- Loop through entities in one package making them potentially
6833 Id := First_Entity (P);
6835 and then (Id /= First_Private_Entity (P)
6836 or else Private_With_OK) -- Ada 2005 (AI-262)
6838 Prev := Current_Entity (Id);
6839 while Present (Prev) loop
6840 if Is_Immediately_Visible (Prev)
6841 and then (not Is_Overloadable (Prev)
6842 or else not Is_Overloadable (Id)
6843 or else (Type_Conformant (Id, Prev)))
6845 if No (Current_Instance) then
6847 -- Potentially use-visible entity remains hidden
6849 goto Next_Usable_Entity;
6851 -- A use clause within an instance hides outer global entities,
6852 -- which are not used to resolve local entities in the
6853 -- instance. Note that the predefined entities in Standard
6854 -- could not have been hidden in the generic by a use clause,
6855 -- and therefore remain visible. Other compilation units whose
6856 -- entities appear in Standard must be hidden in an instance.
6858 -- To determine whether an entity is external to the instance
6859 -- we compare the scope depth of its scope with that of the
6860 -- current instance. However, a generic actual of a subprogram
6861 -- instance is declared in the wrapper package but will not be
6862 -- hidden by a use-visible entity.
6864 -- If Id is called Standard, the predefined package with the
6865 -- same name is in the homonym chain. It has to be ignored
6866 -- because it has no defined scope (being the only entity in
6867 -- the system with this mandated behavior).
6869 elsif not Is_Hidden (Id)
6870 and then Present (Scope (Prev))
6871 and then not Is_Wrapper_Package (Scope (Prev))
6872 and then Scope_Depth (Scope (Prev)) <
6873 Scope_Depth (Current_Instance)
6874 and then (Scope (Prev) /= Standard_Standard
6875 or else Sloc (Prev) > Standard_Location)
6877 Set_Is_Potentially_Use_Visible (Id);
6878 Set_Is_Immediately_Visible (Prev, False);
6879 Append_Elmt (Prev, Hidden_By_Use_Clause (N));
6882 -- A user-defined operator is not use-visible if the predefined
6883 -- operator for the type is immediately visible, which is the case
6884 -- if the type of the operand is in an open scope. This does not
6885 -- apply to user-defined operators that have operands of different
6886 -- types, because the predefined mixed mode operations (multiply
6887 -- and divide) apply to universal types and do not hide anything.
6889 elsif Ekind (Prev) = E_Operator
6890 and then Operator_Matches_Spec (Prev, Id)
6891 and then In_Open_Scopes
6892 (Scope (Base_Type (Etype (First_Formal (Id)))))
6893 and then (No (Next_Formal (First_Formal (Id)))
6894 or else Etype (First_Formal (Id))
6895 = Etype (Next_Formal (First_Formal (Id)))
6896 or else Chars (Prev) = Name_Op_Expon)
6898 goto Next_Usable_Entity;
6901 Prev := Homonym (Prev);
6904 -- On exit, we know entity is not hidden, unless it is private
6906 if not Is_Hidden (Id)
6907 and then ((not Is_Child_Unit (Id))
6908 or else Is_Visible_Child_Unit (Id))
6910 Set_Is_Potentially_Use_Visible (Id);
6912 if Is_Private_Type (Id)
6913 and then Present (Full_View (Id))
6915 Set_Is_Potentially_Use_Visible (Full_View (Id));
6919 <<Next_Usable_Entity>>
6923 -- Child units are also made use-visible by a use clause, but they may
6924 -- appear after all visible declarations in the parent entity list.
6926 while Present (Id) loop
6927 if Is_Child_Unit (Id)
6928 and then Is_Visible_Child_Unit (Id)
6930 Set_Is_Potentially_Use_Visible (Id);
6936 if Chars (Real_P) = Name_System
6937 and then Scope (Real_P) = Standard_Standard
6938 and then Present_System_Aux (N)
6940 Use_One_Package (System_Aux_Id, N);
6943 end Use_One_Package;
6949 procedure Use_One_Type (Id : Node_Id) is
6951 Is_Known_Used : Boolean;
6955 function Spec_Reloaded_For_Body return Boolean;
6956 -- Determine whether the compilation unit is a package body and the use
6957 -- type clause is in the spec of the same package. Even though the spec
6958 -- was analyzed first, its context is reloaded when analysing the body.
6960 ----------------------------
6961 -- Spec_Reloaded_For_Body --
6962 ----------------------------
6964 function Spec_Reloaded_For_Body return Boolean is
6966 if Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Body then
6968 Spec : constant Node_Id :=
6969 Parent (List_Containing (Parent (Id)));
6972 Nkind (Spec) = N_Package_Specification
6973 and then Corresponding_Body (Parent (Spec)) =
6974 Cunit_Entity (Current_Sem_Unit);
6979 end Spec_Reloaded_For_Body;
6981 -- Start of processing for Use_One_Type;
6984 -- It is the type determined by the subtype mark (8.4(8)) whose
6985 -- operations become potentially use-visible.
6987 T := Base_Type (Entity (Id));
6989 -- Either the type itself is used, the package where it is declared
6990 -- is in use or the entity is declared in the current package, thus
6995 or else In_Use (Scope (T))
6996 or else Scope (T) = Current_Scope;
6998 Set_Redundant_Use (Id,
6999 Is_Known_Used or else Is_Potentially_Use_Visible (T));
7001 if In_Open_Scopes (Scope (T)) then
7004 -- A limited view cannot appear in a use_type clause. However, an
7005 -- access type whose designated type is limited has the flag but
7006 -- is not itself a limited view unless we only have a limited view
7007 -- of its enclosing package.
7009 elsif From_With_Type (T)
7010 and then From_With_Type (Scope (T))
7013 ("incomplete type from limited view "
7014 & "cannot appear in use clause", Id);
7016 -- If the subtype mark designates a subtype in a different package,
7017 -- we have to check that the parent type is visible, otherwise the
7018 -- use type clause is a noop. Not clear how to do that???
7020 elsif not Redundant_Use (Id) then
7022 Set_Current_Use_Clause (T, Parent (Id));
7023 Op_List := Collect_Primitive_Operations (T);
7025 Elmt := First_Elmt (Op_List);
7026 while Present (Elmt) loop
7027 if (Nkind (Node (Elmt)) = N_Defining_Operator_Symbol
7028 or else Chars (Node (Elmt)) in Any_Operator_Name)
7029 and then not Is_Hidden (Node (Elmt))
7031 Set_Is_Potentially_Use_Visible (Node (Elmt));
7038 -- If warning on redundant constructs, check for unnecessary WITH
7040 if Warn_On_Redundant_Constructs
7041 and then Is_Known_Used
7043 -- with P; with P; use P;
7044 -- package P is package X is package body X is
7045 -- type T ... use P.T;
7047 -- The compilation unit is the body of X. GNAT first compiles the
7048 -- spec of X, then proceeds to the body. At that point P is marked
7049 -- as use visible. The analysis then reinstalls the spec along with
7050 -- its context. The use clause P.T is now recognized as redundant,
7051 -- but in the wrong context. Do not emit a warning in such cases.
7053 and then not Spec_Reloaded_For_Body
7055 -- The type already has a use clause
7058 if Present (Current_Use_Clause (T)) then
7060 Clause1 : constant Node_Id := Parent (Id);
7061 Clause2 : constant Node_Id := Current_Use_Clause (T);
7067 if Nkind (Parent (Clause1)) = N_Compilation_Unit
7068 and then Nkind (Parent (Clause2)) = N_Compilation_Unit
7070 -- There is a redundant use type clause in a child unit.
7071 -- Determine which of the units is more deeply nested.
7073 Unit1 := Defining_Entity (Unit (Parent (Clause1)));
7074 Unit2 := Defining_Entity (Unit (Parent (Clause2)));
7076 if Scope (Unit2) = Standard_Standard then
7077 Error_Msg_Sloc := Sloc (Current_Use_Clause (T));
7080 elsif Scope (Unit1) = Standard_Standard then
7081 Error_Msg_Sloc := Sloc (Id);
7085 -- Determine which is the descendant unit
7091 S1 := Scope (Unit1);
7092 S2 := Scope (Unit2);
7093 while S1 /= Standard_Standard
7094 and then S2 /= Standard_Standard
7100 if S1 = Standard_Standard then
7101 Error_Msg_Sloc := Sloc (Id);
7104 Error_Msg_Sloc := Sloc (Current_Use_Clause (T));
7111 ("& is already use-visible through previous "
7112 & "use_type_clause #?", Err_No, Id);
7115 ("& is already use-visible through previous use type "
7116 & "clause?", Id, Id);
7121 ("& is already use-visible through previous use type "
7122 & "clause?", Id, Id);
7125 -- The package where T is declared is already used
7127 elsif In_Use (Scope (T)) then
7128 Error_Msg_Sloc := Sloc (Current_Use_Clause (Scope (T)));
7130 ("& is already use-visible through package use clause #?",
7133 -- The current scope is the package where T is declared
7136 Error_Msg_Node_2 := Scope (T);
7138 ("& is already use-visible inside package &?", Id, Id);
7147 procedure Write_Info is
7148 Id : Entity_Id := First_Entity (Current_Scope);
7151 -- No point in dumping standard entities
7153 if Current_Scope = Standard_Standard then
7157 Write_Str ("========================================================");
7159 Write_Str (" Defined Entities in ");
7160 Write_Name (Chars (Current_Scope));
7162 Write_Str ("========================================================");
7166 Write_Str ("-- none --");
7170 while Present (Id) loop
7171 Write_Entity_Info (Id, " ");
7176 if Scope (Current_Scope) = Standard_Standard then
7178 -- Print information on the current unit itself
7180 Write_Entity_Info (Current_Scope, " ");
7190 procedure Write_Scopes is
7193 for J in reverse 1 .. Scope_Stack.Last loop
7194 S := Scope_Stack.Table (J).Entity;
7195 Write_Int (Int (S));
7196 Write_Str (" === ");
7197 Write_Name (Chars (S));
OSDN Git Service
