]>
Commit | Line | Data |
---|---|---|
996ae0b0 RK |
1 | ------------------------------------------------------------------------------ |
2 | -- -- | |
3 | -- GNAT COMPILER COMPONENTS -- | |
4 | -- -- | |
5 | -- S E M . C H 8 -- | |
6 | -- -- | |
7 | -- B o d y -- | |
8 | -- -- | |
c91dbd18 | 9 | -- Copyright (C) 1992-2013, Free Software Foundation, Inc. -- |
996ae0b0 RK |
10 | -- -- |
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- -- | |
b5c84c3c | 13 | -- ware Foundation; either version 3, or (at your option) any later ver- -- |
996ae0b0 RK |
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 -- | |
b5c84c3c RD |
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. -- | |
996ae0b0 RK |
20 | -- -- |
21 | -- GNAT was originally developed by the GNAT team at New York University. -- | |
71ff80dc | 22 | -- Extensive contributions were provided by Ada Core Technologies Inc. -- |
996ae0b0 RK |
23 | -- -- |
24 | ------------------------------------------------------------------------------ | |
25 | ||
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; | |
d239991f | 31 | with Exp_Tss; use Exp_Tss; |
996ae0b0 RK |
32 | with Exp_Util; use Exp_Util; |
33 | with Fname; use Fname; | |
34 | with Freeze; use Freeze; | |
16ca248a | 35 | with Impunit; use Impunit; |
996ae0b0 RK |
36 | with Lib; use Lib; |
37 | with Lib.Load; use Lib.Load; | |
38 | with Lib.Xref; use Lib.Xref; | |
39 | with Namet; use Namet; | |
294ccb21 | 40 | with Namet.Sp; use Namet.Sp; |
996ae0b0 RK |
41 | with Nlists; use Nlists; |
42 | with Nmake; use Nmake; | |
43 | with Opt; use Opt; | |
44 | with Output; use Output; | |
45 | with Restrict; use Restrict; | |
6e937c1c | 46 | with Rident; use Rident; |
996ae0b0 RK |
47 | with Rtsfind; use Rtsfind; |
48 | with Sem; use Sem; | |
a4100e55 | 49 | with Sem_Aux; use Sem_Aux; |
fbf5a39b | 50 | with Sem_Cat; use Sem_Cat; |
996ae0b0 RK |
51 | with Sem_Ch3; use Sem_Ch3; |
52 | with Sem_Ch4; use Sem_Ch4; | |
53 | with Sem_Ch6; use Sem_Ch6; | |
54 | with Sem_Ch12; use Sem_Ch12; | |
ef992452 | 55 | with Sem_Ch13; use Sem_Ch13; |
dec6faf1 | 56 | with Sem_Dim; use Sem_Dim; |
82c80734 | 57 | with Sem_Disp; use Sem_Disp; |
a77842bd | 58 | with Sem_Dist; use Sem_Dist; |
a2dc5812 | 59 | with Sem_Eval; use Sem_Eval; |
996ae0b0 RK |
60 | with Sem_Res; use Sem_Res; |
61 | with Sem_Util; use Sem_Util; | |
62 | with Sem_Type; use Sem_Type; | |
63 | with Stand; use Stand; | |
64 | with Sinfo; use Sinfo; | |
65 | with Sinfo.CN; use Sinfo.CN; | |
66 | with Snames; use Snames; | |
67 | with Style; use Style; | |
68 | with Table; | |
ddc1515a | 69 | with Targparm; use Targparm; |
996ae0b0 RK |
70 | with Tbuild; use Tbuild; |
71 | with Uintp; use Uintp; | |
72 | ||
996ae0b0 RK |
73 | package body Sem_Ch8 is |
74 | ||
75 | ------------------------------------ | |
76 | -- Visibility and Name Resolution -- | |
77 | ------------------------------------ | |
78 | ||
2c1b72d7 | 79 | -- This package handles name resolution and the collection of possible |
996ae0b0 RK |
80 | -- interpretations for overloaded names, prior to overload resolution. |
81 | ||
82 | -- Name resolution is the process that establishes a mapping between source | |
83 | -- identifiers and the entities they denote at each point in the program. | |
84 | -- Each entity is represented by a defining occurrence. Each identifier | |
85 | -- that denotes an entity points to the corresponding defining occurrence. | |
86 | -- This is the entity of the applied occurrence. Each occurrence holds | |
87 | -- an index into the names table, where source identifiers are stored. | |
88 | ||
89 | -- Each entry in the names table for an identifier or designator uses the | |
90 | -- Info pointer to hold a link to the currently visible entity that has | |
91 | -- this name (see subprograms Get_Name_Entity_Id and Set_Name_Entity_Id | |
92 | -- in package Sem_Util). The visibility is initialized at the beginning of | |
93 | -- semantic processing to make entities in package Standard immediately | |
94 | -- visible. The visibility table is used in a more subtle way when | |
95 | -- compiling subunits (see below). | |
96 | ||
97 | -- Entities that have the same name (i.e. homonyms) are chained. In the | |
98 | -- case of overloaded entities, this chain holds all the possible meanings | |
99 | -- of a given identifier. The process of overload resolution uses type | |
100 | -- information to select from this chain the unique meaning of a given | |
101 | -- identifier. | |
102 | ||
103 | -- Entities are also chained in their scope, through the Next_Entity link. | |
104 | -- As a consequence, the name space is organized as a sparse matrix, where | |
105 | -- each row corresponds to a scope, and each column to a source identifier. | |
106 | -- Open scopes, that is to say scopes currently being compiled, have their | |
107 | -- corresponding rows of entities in order, innermost scope first. | |
108 | ||
109 | -- The scopes of packages that are mentioned in context clauses appear in | |
110 | -- no particular order, interspersed among open scopes. This is because | |
111 | -- in the course of analyzing the context of a compilation, a package | |
112 | -- declaration is first an open scope, and subsequently an element of the | |
113 | -- context. If subunits or child units are present, a parent unit may | |
114 | -- appear under various guises at various times in the compilation. | |
115 | ||
116 | -- When the compilation of the innermost scope is complete, the entities | |
117 | -- defined therein are no longer visible. If the scope is not a package | |
118 | -- declaration, these entities are never visible subsequently, and can be | |
119 | -- removed from visibility chains. If the scope is a package declaration, | |
120 | -- its visible declarations may still be accessible. Therefore the entities | |
121 | -- defined in such a scope are left on the visibility chains, and only | |
122 | -- their visibility (immediately visibility or potential use-visibility) | |
123 | -- is affected. | |
124 | ||
125 | -- The ordering of homonyms on their chain does not necessarily follow | |
126 | -- the order of their corresponding scopes on the scope stack. For | |
127 | -- example, if package P and the enclosing scope both contain entities | |
128 | -- named E, then when compiling the package body the chain for E will | |
129 | -- hold the global entity first, and the local one (corresponding to | |
130 | -- the current inner scope) next. As a result, name resolution routines | |
131 | -- do not assume any relative ordering of the homonym chains, either | |
132 | -- for scope nesting or to order of appearance of context clauses. | |
133 | ||
134 | -- When compiling a child unit, entities in the parent scope are always | |
135 | -- immediately visible. When compiling the body of a child unit, private | |
136 | -- entities in the parent must also be made immediately visible. There | |
137 | -- are separate routines to make the visible and private declarations | |
138 | -- visible at various times (see package Sem_Ch7). | |
139 | ||
140 | -- +--------+ +-----+ | |
141 | -- | In use |-------->| EU1 |--------------------------> | |
142 | -- +--------+ +-----+ | |
143 | -- | | | |
144 | -- +--------+ +-----+ +-----+ | |
145 | -- | Stand. |---------------->| ES1 |--------------->| ES2 |---> | |
146 | -- +--------+ +-----+ +-----+ | |
147 | -- | | | |
148 | -- +---------+ | +-----+ | |
149 | -- | with'ed |------------------------------>| EW2 |---> | |
150 | -- +---------+ | +-----+ | |
151 | -- | | | |
152 | -- +--------+ +-----+ +-----+ | |
153 | -- | Scope2 |---------------->| E12 |--------------->| E22 |---> | |
154 | -- +--------+ +-----+ +-----+ | |
155 | -- | | | |
156 | -- +--------+ +-----+ +-----+ | |
157 | -- | Scope1 |---------------->| E11 |--------------->| E12 |---> | |
158 | -- +--------+ +-----+ +-----+ | |
159 | -- ^ | | | |
160 | -- | | | | |
161 | -- | +---------+ | | | |
162 | -- | | with'ed |-----------------------------------------> | |
163 | -- | +---------+ | | | |
164 | -- | | | | |
165 | -- Scope stack | | | |
166 | -- (innermost first) | | | |
167 | -- +----------------------------+ | |
168 | -- Names table => | Id1 | | | | Id2 | | |
169 | -- +----------------------------+ | |
170 | ||
171 | -- Name resolution must deal with several syntactic forms: simple names, | |
172 | -- qualified names, indexed names, and various forms of calls. | |
173 | ||
174 | -- Each identifier points to an entry in the names table. The resolution | |
175 | -- of a simple name consists in traversing the homonym chain, starting | |
176 | -- from the names table. If an entry is immediately visible, it is the one | |
fbf5a39b | 177 | -- designated by the identifier. If only potentially use-visible entities |
996ae0b0 RK |
178 | -- are on the chain, we must verify that they do not hide each other. If |
179 | -- the entity we find is overloadable, we collect all other overloadable | |
180 | -- entities on the chain as long as they are not hidden. | |
181 | -- | |
182 | -- To resolve expanded names, we must find the entity at the intersection | |
183 | -- of the entity chain for the scope (the prefix) and the homonym chain | |
184 | -- for the selector. In general, homonym chains will be much shorter than | |
185 | -- entity chains, so it is preferable to start from the names table as | |
186 | -- well. If the entity found is overloadable, we must collect all other | |
187 | -- interpretations that are defined in the scope denoted by the prefix. | |
188 | ||
189 | -- For records, protected types, and tasks, their local entities are | |
190 | -- removed from visibility chains on exit from the corresponding scope. | |
191 | -- From the outside, these entities are always accessed by selected | |
192 | -- notation, and the entity chain for the record type, protected type, | |
193 | -- etc. is traversed sequentially in order to find the designated entity. | |
194 | ||
195 | -- The discriminants of a type and the operations of a protected type or | |
196 | -- task are unchained on exit from the first view of the type, (such as | |
197 | -- a private or incomplete type declaration, or a protected type speci- | |
fbf5a39b | 198 | -- fication) and re-chained when compiling the second view. |
996ae0b0 RK |
199 | |
200 | -- In the case of operators, we do not make operators on derived types | |
201 | -- explicit. As a result, the notation P."+" may denote either a user- | |
202 | -- defined function with name "+", or else an implicit declaration of the | |
203 | -- operator "+" in package P. The resolution of expanded names always | |
204 | -- tries to resolve an operator name as such an implicitly defined entity, | |
205 | -- in addition to looking for explicit declarations. | |
206 | ||
207 | -- All forms of names that denote entities (simple names, expanded names, | |
208 | -- character literals in some cases) have a Entity attribute, which | |
209 | -- identifies the entity denoted by the name. | |
210 | ||
211 | --------------------- | |
212 | -- The Scope Stack -- | |
213 | --------------------- | |
214 | ||
215 | -- The Scope stack keeps track of the scopes currently been compiled. | |
216 | -- Every entity that contains declarations (including records) is placed | |
217 | -- on the scope stack while it is being processed, and removed at the end. | |
218 | -- Whenever a non-package scope is exited, the entities defined therein | |
219 | -- are removed from the visibility table, so that entities in outer scopes | |
220 | -- become visible (see previous description). On entry to Sem, the scope | |
221 | -- stack only contains the package Standard. As usual, subunits complicate | |
222 | -- this picture ever so slightly. | |
223 | ||
224 | -- The Rtsfind mechanism can force a call to Semantics while another | |
225 | -- compilation is in progress. The unit retrieved by Rtsfind must be | |
226 | -- compiled in its own context, and has no access to the visibility of | |
227 | -- the unit currently being compiled. The procedures Save_Scope_Stack and | |
228 | -- Restore_Scope_Stack make entities in current open scopes invisible | |
229 | -- before compiling the retrieved unit, and restore the compilation | |
230 | -- environment afterwards. | |
231 | ||
232 | ------------------------ | |
233 | -- Compiling subunits -- | |
234 | ------------------------ | |
235 | ||
16ca248a ES |
236 | -- Subunits must be compiled in the environment of the corresponding stub, |
237 | -- that is to say with the same visibility into the parent (and its | |
996ae0b0 RK |
238 | -- context) that is available at the point of the stub declaration, but |
239 | -- with the additional visibility provided by the context clause of the | |
240 | -- subunit itself. As a result, compilation of a subunit forces compilation | |
241 | -- of the parent (see description in lib-). At the point of the stub | |
16ca248a ES |
242 | -- declaration, Analyze is called recursively to compile the proper body of |
243 | -- the subunit, but without reinitializing the names table, nor the scope | |
244 | -- stack (i.e. standard is not pushed on the stack). In this fashion the | |
245 | -- context of the subunit is added to the context of the parent, and the | |
246 | -- subunit is compiled in the correct environment. Note that in the course | |
247 | -- of processing the context of a subunit, Standard will appear twice on | |
248 | -- the scope stack: once for the parent of the subunit, and once for the | |
249 | -- unit in the context clause being compiled. However, the two sets of | |
250 | -- entities are not linked by homonym chains, so that the compilation of | |
251 | -- any context unit happens in a fresh visibility environment. | |
996ae0b0 RK |
252 | |
253 | ------------------------------- | |
254 | -- Processing of USE Clauses -- | |
255 | ------------------------------- | |
256 | ||
257 | -- Every defining occurrence has a flag indicating if it is potentially use | |
258 | -- visible. Resolution of simple names examines this flag. The processing | |
259 | -- of use clauses consists in setting this flag on all visible entities | |
260 | -- defined in the corresponding package. On exit from the scope of the use | |
261 | -- clause, the corresponding flag must be reset. However, a package may | |
262 | -- appear in several nested use clauses (pathological but legal, alas!) | |
263 | -- which forces us to use a slightly more involved scheme: | |
264 | ||
265 | -- a) The defining occurrence for a package holds a flag -In_Use- to | |
266 | -- indicate that it is currently in the scope of a use clause. If a | |
44d6a706 | 267 | -- redundant use clause is encountered, then the corresponding occurrence |
996ae0b0 RK |
268 | -- of the package name is flagged -Redundant_Use-. |
269 | ||
270 | -- b) On exit from a scope, the use clauses in its declarative part are | |
271 | -- scanned. The visibility flag is reset in all entities declared in | |
272 | -- package named in a use clause, as long as the package is not flagged | |
273 | -- as being in a redundant use clause (in which case the outer use | |
274 | -- clause is still in effect, and the direct visibility of its entities | |
275 | -- must be retained). | |
276 | ||
277 | -- Note that entities are not removed from their homonym chains on exit | |
278 | -- from the package specification. A subsequent use clause does not need | |
279 | -- to rechain the visible entities, but only to establish their direct | |
280 | -- visibility. | |
281 | ||
282 | ----------------------------------- | |
283 | -- Handling private declarations -- | |
284 | ----------------------------------- | |
285 | ||
286 | -- The principle that each entity has a single defining occurrence clashes | |
287 | -- with the presence of two separate definitions for private types: the | |
288 | -- first is the private type declaration, and second is the full type | |
289 | -- declaration. It is important that all references to the type point to | |
44d6a706 | 290 | -- the same defining occurrence, namely the first one. To enforce the two |
996ae0b0 RK |
291 | -- separate views of the entity, the corresponding information is swapped |
292 | -- between the two declarations. Outside of the package, the defining | |
44d6a706 | 293 | -- occurrence only contains the private declaration information, while in |
996ae0b0 RK |
294 | -- the private part and the body of the package the defining occurrence |
295 | -- contains the full declaration. To simplify the swap, the defining | |
296 | -- occurrence that currently holds the private declaration points to the | |
44d6a706 | 297 | -- full declaration. During semantic processing the defining occurrence |
16ca248a ES |
298 | -- also points to a list of private dependents, that is to say access types |
299 | -- or composite types whose designated types or component types are | |
996ae0b0 RK |
300 | -- subtypes or derived types of the private type in question. After the |
301 | -- full declaration has been seen, the private dependents are updated to | |
302 | -- indicate that they have full definitions. | |
303 | ||
304 | ------------------------------------ | |
305 | -- Handling of Undefined Messages -- | |
306 | ------------------------------------ | |
307 | ||
308 | -- In normal mode, only the first use of an undefined identifier generates | |
309 | -- a message. The table Urefs is used to record error messages that have | |
310 | -- been issued so that second and subsequent ones do not generate further | |
311 | -- messages. However, the second reference causes text to be added to the | |
312 | -- original undefined message noting "(more references follow)". The | |
313 | -- full error list option (-gnatf) forces messages to be generated for | |
314 | -- every reference and disconnects the use of this table. | |
315 | ||
316 | type Uref_Entry is record | |
317 | Node : Node_Id; | |
318 | -- Node for identifier for which original message was posted. The | |
319 | -- Chars field of this identifier is used to detect later references | |
320 | -- to the same identifier. | |
321 | ||
322 | Err : Error_Msg_Id; | |
323 | -- Records error message Id of original undefined message. Reset to | |
324 | -- No_Error_Msg after the second occurrence, where it is used to add | |
325 | -- text to the original message as described above. | |
326 | ||
327 | Nvis : Boolean; | |
328 | -- Set if the message is not visible rather than undefined | |
329 | ||
330 | Loc : Source_Ptr; | |
331 | -- Records location of error message. Used to make sure that we do | |
332 | -- not consider a, b : undefined as two separate instances, which | |
333 | -- would otherwise happen, since the parser converts this sequence | |
334 | -- to a : undefined; b : undefined. | |
335 | ||
336 | end record; | |
337 | ||
338 | package Urefs is new Table.Table ( | |
339 | Table_Component_Type => Uref_Entry, | |
340 | Table_Index_Type => Nat, | |
341 | Table_Low_Bound => 1, | |
342 | Table_Initial => 10, | |
343 | Table_Increment => 100, | |
344 | Table_Name => "Urefs"); | |
345 | ||
346 | Candidate_Renaming : Entity_Id; | |
347 | -- Holds a candidate interpretation that appears in a subprogram renaming | |
348 | -- declaration and does not match the given specification, but matches at | |
349 | -- least on the first formal. Allows better error message when given | |
350 | -- specification omits defaulted parameters, a common error. | |
351 | ||
352 | ----------------------- | |
353 | -- Local Subprograms -- | |
354 | ----------------------- | |
355 | ||
356 | procedure Analyze_Generic_Renaming | |
357 | (N : Node_Id; | |
358 | K : Entity_Kind); | |
359 | -- Common processing for all three kinds of generic renaming declarations. | |
360 | -- Enter new name and indicate that it renames the generic unit. | |
361 | ||
362 | procedure Analyze_Renamed_Character | |
363 | (N : Node_Id; | |
364 | New_S : Entity_Id; | |
365 | Is_Body : Boolean); | |
366 | -- Renamed entity is given by a character literal, which must belong | |
367 | -- to the return type of the new entity. Is_Body indicates whether the | |
368 | -- declaration is a renaming_as_body. If the original declaration has | |
369 | -- already been frozen (because of an intervening body, e.g.) the body of | |
370 | -- the function must be built now. The same applies to the following | |
371 | -- various renaming procedures. | |
372 | ||
373 | procedure Analyze_Renamed_Dereference | |
374 | (N : Node_Id; | |
375 | New_S : Entity_Id; | |
376 | Is_Body : Boolean); | |
377 | -- Renamed entity is given by an explicit dereference. Prefix must be a | |
378 | -- conformant access_to_subprogram type. | |
379 | ||
380 | procedure Analyze_Renamed_Entry | |
381 | (N : Node_Id; | |
382 | New_S : Entity_Id; | |
383 | Is_Body : Boolean); | |
384 | -- If the renamed entity in a subprogram renaming is an entry or protected | |
385 | -- subprogram, build a body for the new entity whose only statement is a | |
386 | -- call to the renamed entity. | |
387 | ||
388 | procedure Analyze_Renamed_Family_Member | |
389 | (N : Node_Id; | |
390 | New_S : Entity_Id; | |
391 | Is_Body : Boolean); | |
392 | -- Used when the renamed entity is an indexed component. The prefix must | |
393 | -- denote an entry family. | |
394 | ||
294ccb21 RD |
395 | procedure Analyze_Renamed_Primitive_Operation |
396 | (N : Node_Id; | |
397 | New_S : Entity_Id; | |
398 | Is_Body : Boolean); | |
399 | -- If the renamed entity in a subprogram renaming is a primitive operation | |
c5d00db0 AC |
400 | -- or a class-wide operation in prefix form, save the target object, |
401 | -- which must be added to the list of actuals in any subsequent call. | |
402 | -- The renaming operation is intrinsic because the compiler must in | |
403 | -- fact generate a wrapper for it (6.3.1 (10 1/2)). | |
294ccb21 | 404 | |
fbf5a39b | 405 | function Applicable_Use (Pack_Name : Node_Id) return Boolean; |
c42bfef2 RD |
406 | -- Common code to Use_One_Package and Set_Use, to determine whether use |
407 | -- clause must be processed. Pack_Name is an entity name that references | |
408 | -- the package in question. | |
fbf5a39b | 409 | |
996ae0b0 | 410 | procedure Attribute_Renaming (N : Node_Id); |
4c8a5bb8 AC |
411 | -- Analyze renaming of attribute as subprogram. The renaming declaration N |
412 | -- is rewritten as a subprogram body that returns the attribute reference | |
996ae0b0 RK |
413 | -- applied to the formals of the function. |
414 | ||
4c484f40 | 415 | procedure Set_Entity_Or_Discriminal (N : Node_Id; E : Entity_Id); |
c42bfef2 RD |
416 | -- Set Entity, with style check if need be. For a discriminant reference, |
417 | -- replace by the corresponding discriminal, i.e. the parameter of the | |
418 | -- initialization procedure that corresponds to the discriminant. | |
4c484f40 | 419 | |
996ae0b0 RK |
420 | procedure Check_Frozen_Renaming (N : Node_Id; Subp : Entity_Id); |
421 | -- A renaming_as_body may occur after the entity of the original decla- | |
422 | -- ration has been frozen. In that case, the body of the new entity must | |
423 | -- be built now, because the usual mechanism of building the renamed | |
424 | -- body at the point of freezing will not work. Subp is the subprogram | |
425 | -- for which N provides the Renaming_As_Body. | |
426 | ||
fbf5a39b AC |
427 | procedure Check_In_Previous_With_Clause |
428 | (N : Node_Id; | |
429 | Nam : Node_Id); | |
430 | -- N is a use_package clause and Nam the package name, or N is a use_type | |
431 | -- clause and Nam is the prefix of the type name. In either case, verify | |
432 | -- that the package is visible at that point in the context: either it | |
433 | -- appears in a previous with_clause, or because it is a fully qualified | |
434 | -- name and the root ancestor appears in a previous with_clause. | |
435 | ||
996ae0b0 RK |
436 | procedure Check_Library_Unit_Renaming (N : Node_Id; Old_E : Entity_Id); |
437 | -- Verify that the entity in a renaming declaration that is a library unit | |
438 | -- is itself a library unit and not a nested unit or subunit. Also check | |
439 | -- that if the renaming is a child unit of a generic parent, then the | |
440 | -- renamed unit must also be a child unit of that parent. Finally, verify | |
441 | -- that a renamed generic unit is not an implicit child declared within | |
442 | -- an instance of the parent. | |
443 | ||
444 | procedure Chain_Use_Clause (N : Node_Id); | |
d4810530 ES |
445 | -- Chain use clause onto list of uses clauses headed by First_Use_Clause in |
446 | -- the proper scope table entry. This is usually the current scope, but it | |
447 | -- will be an inner scope when installing the use clauses of the private | |
448 | -- declarations of a parent unit prior to compiling the private part of a | |
449 | -- child unit. This chain is traversed when installing/removing use clauses | |
450 | -- when compiling a subunit or instantiating a generic body on the fly, | |
451 | -- when it is necessary to save and restore full environments. | |
996ae0b0 | 452 | |
ac7d724d ES |
453 | function Enclosing_Instance return Entity_Id; |
454 | -- In an instance nested within another one, several semantic checks are | |
455 | -- unnecessary because the legality of the nested instance has been checked | |
456 | -- in the enclosing generic unit. This applies in particular to legality | |
457 | -- checks on actuals for formal subprograms of the inner instance, which | |
458 | -- are checked as subprogram renamings, and may be complicated by confusion | |
459 | -- in private/full views. This function returns the instance enclosing the | |
460 | -- current one if there is such, else it returns Empty. | |
461 | -- | |
462 | -- If the renaming determines the entity for the default of a formal | |
463 | -- subprogram nested within another instance, choose the innermost | |
464 | -- candidate. This is because if the formal has a box, and we are within | |
465 | -- an enclosing instance where some candidate interpretations are local | |
466 | -- to this enclosing instance, we know that the default was properly | |
467 | -- resolved when analyzing the generic, so we prefer the local | |
468 | -- candidates to those that are external. This is not always the case | |
469 | -- but is a reasonable heuristic on the use of nested generics. The | |
470 | -- proper solution requires a full renaming model. | |
471 | ||
996ae0b0 RK |
472 | function Has_Implicit_Character_Literal (N : Node_Id) return Boolean; |
473 | -- Find a type derived from Character or Wide_Character in the prefix of N. | |
474 | -- Used to resolved qualified names whose selector is a character literal. | |
475 | ||
9bc856dd | 476 | function Has_Private_With (E : Entity_Id) return Boolean; |
0ab80019 | 477 | -- Ada 2005 (AI-262): Determines if the current compilation unit has a |
cdc8c54c | 478 | -- private with on E. |
9bc856dd | 479 | |
fbf5a39b | 480 | procedure Find_Expanded_Name (N : Node_Id); |
1d801f21 | 481 | -- The input is a selected component known to be an expanded name. Verify |
30196a76 RD |
482 | -- legality of selector given the scope denoted by prefix, and change node |
483 | -- N into a expanded name with a properly set Entity field. | |
fbf5a39b | 484 | |
996ae0b0 RK |
485 | function Find_Renamed_Entity |
486 | (N : Node_Id; | |
487 | Nam : Node_Id; | |
488 | New_S : Entity_Id; | |
489 | Is_Actual : Boolean := False) return Entity_Id; | |
490 | -- Find the renamed entity that corresponds to the given parameter profile | |
491 | -- in a subprogram renaming declaration. The renamed entity may be an | |
492 | -- operator, a subprogram, an entry, or a protected operation. Is_Actual | |
493 | -- indicates that the renaming is the one generated for an actual subpro- | |
494 | -- gram in an instance, for which special visibility checks apply. | |
495 | ||
fbf5a39b | 496 | function Has_Implicit_Operator (N : Node_Id) return Boolean; |
f3d57416 | 497 | -- N is an expanded name whose selector is an operator name (e.g. P."+"). |
16ca248a ES |
498 | -- declarative part contains an implicit declaration of an operator if it |
499 | -- has a declaration of a type to which one of the predefined operators | |
500 | -- apply. The existence of this routine is an implementation artifact. A | |
501 | -- more straightforward but more space-consuming choice would be to make | |
502 | -- all inherited operators explicit in the symbol table. | |
fbf5a39b | 503 | |
996ae0b0 RK |
504 | procedure Inherit_Renamed_Profile (New_S : Entity_Id; Old_S : Entity_Id); |
505 | -- A subprogram defined by a renaming declaration inherits the parameter | |
506 | -- profile of the renamed entity. The subtypes given in the subprogram | |
507 | -- specification are discarded and replaced with those of the renamed | |
508 | -- subprogram, which are then used to recheck the default values. | |
509 | ||
fbf5a39b | 510 | function Is_Appropriate_For_Record (T : Entity_Id) return Boolean; |
16ca248a ES |
511 | -- Prefix is appropriate for record if it is of a record type, or an access |
512 | -- to such. | |
fbf5a39b AC |
513 | |
514 | function Is_Appropriate_For_Entry_Prefix (T : Entity_Id) return Boolean; | |
16ca248a ES |
515 | -- True if it is of a task type, a protected type, or else an access to one |
516 | -- of these types. | |
fbf5a39b | 517 | |
d4810530 | 518 | procedure Note_Redundant_Use (Clause : Node_Id); |
16ca248a ES |
519 | -- Mark the name in a use clause as redundant if the corresponding entity |
520 | -- is already use-visible. Emit a warning if the use clause comes from | |
521 | -- source and the proper warnings are enabled. | |
d4810530 | 522 | |
996ae0b0 | 523 | procedure Premature_Usage (N : Node_Id); |
bc41faa2 | 524 | -- Diagnose usage of an entity before it is visible |
996ae0b0 | 525 | |
fbf5a39b AC |
526 | procedure Use_One_Package (P : Entity_Id; N : Node_Id); |
527 | -- Make visible entities declared in package P potentially use-visible | |
528 | -- in the current context. Also used in the analysis of subunits, when | |
529 | -- re-installing use clauses of parent units. N is the use_clause that | |
530 | -- names P (and possibly other packages). | |
531 | ||
7ff2d234 | 532 | procedure Use_One_Type (Id : Node_Id; Installed : Boolean := False); |
fbf5a39b | 533 | -- Id is the subtype mark from a use type clause. This procedure makes |
7ff2d234 AC |
534 | -- the primitive operators of the type potentially use-visible. The |
535 | -- boolean flag Installed indicates that the clause is being reinstalled | |
536 | -- after previous analysis, and primitive operations are already chained | |
537 | -- on the Used_Operations list of the clause. | |
fbf5a39b | 538 | |
996ae0b0 RK |
539 | procedure Write_Info; |
540 | -- Write debugging information on entities declared in current scope | |
541 | ||
996ae0b0 RK |
542 | -------------------------------- |
543 | -- Analyze_Exception_Renaming -- | |
544 | -------------------------------- | |
545 | ||
16ca248a ES |
546 | -- The language only allows a single identifier, but the tree holds an |
547 | -- identifier list. The parser has already issued an error message if | |
548 | -- there is more than one element in the list. | |
996ae0b0 RK |
549 | |
550 | procedure Analyze_Exception_Renaming (N : Node_Id) is | |
551 | Id : constant Node_Id := Defining_Identifier (N); | |
552 | Nam : constant Node_Id := Name (N); | |
553 | ||
554 | begin | |
2ba431e5 | 555 | Check_SPARK_Restriction ("exception renaming is not allowed", N); |
1d801f21 | 556 | |
996ae0b0 RK |
557 | Enter_Name (Id); |
558 | Analyze (Nam); | |
559 | ||
560 | Set_Ekind (Id, E_Exception); | |
561 | Set_Exception_Code (Id, Uint_0); | |
562 | Set_Etype (Id, Standard_Exception_Type); | |
563 | Set_Is_Pure (Id, Is_Pure (Current_Scope)); | |
564 | ||
565 | if not Is_Entity_Name (Nam) or else | |
566 | Ekind (Entity (Nam)) /= E_Exception | |
567 | then | |
568 | Error_Msg_N ("invalid exception name in renaming", Nam); | |
569 | else | |
570 | if Present (Renamed_Object (Entity (Nam))) then | |
571 | Set_Renamed_Object (Id, Renamed_Object (Entity (Nam))); | |
572 | else | |
573 | Set_Renamed_Object (Id, Entity (Nam)); | |
574 | end if; | |
575 | end if; | |
42f1d661 AC |
576 | |
577 | -- Implementation-defined aspect specifications can appear in a renaming | |
578 | -- declaration, but not language-defined ones. The call to procedure | |
579 | -- Analyze_Aspect_Specifications will take care of this error check. | |
580 | ||
581 | if Has_Aspects (N) then | |
582 | Analyze_Aspect_Specifications (N, Id); | |
583 | end if; | |
996ae0b0 RK |
584 | end Analyze_Exception_Renaming; |
585 | ||
586 | --------------------------- | |
587 | -- Analyze_Expanded_Name -- | |
588 | --------------------------- | |
589 | ||
590 | procedure Analyze_Expanded_Name (N : Node_Id) is | |
591 | begin | |
16ca248a ES |
592 | -- If the entity pointer is already set, this is an internal node, or a |
593 | -- node that is analyzed more than once, after a tree modification. In | |
594 | -- such a case there is no resolution to perform, just set the type. For | |
595 | -- completeness, analyze prefix as well. | |
996ae0b0 RK |
596 | |
597 | if Present (Entity (N)) then | |
598 | if Is_Type (Entity (N)) then | |
599 | Set_Etype (N, Entity (N)); | |
600 | else | |
601 | Set_Etype (N, Etype (Entity (N))); | |
602 | end if; | |
603 | ||
604 | Analyze (Prefix (N)); | |
605 | return; | |
606 | else | |
607 | Find_Expanded_Name (N); | |
608 | end if; | |
0929eaeb AC |
609 | |
610 | Analyze_Dimension (N); | |
996ae0b0 RK |
611 | end Analyze_Expanded_Name; |
612 | ||
15ce9ca2 AC |
613 | --------------------------------------- |
614 | -- Analyze_Generic_Function_Renaming -- | |
615 | --------------------------------------- | |
996ae0b0 RK |
616 | |
617 | procedure Analyze_Generic_Function_Renaming (N : Node_Id) is | |
618 | begin | |
619 | Analyze_Generic_Renaming (N, E_Generic_Function); | |
620 | end Analyze_Generic_Function_Renaming; | |
621 | ||
15ce9ca2 AC |
622 | -------------------------------------- |
623 | -- Analyze_Generic_Package_Renaming -- | |
624 | -------------------------------------- | |
996ae0b0 RK |
625 | |
626 | procedure Analyze_Generic_Package_Renaming (N : Node_Id) is | |
627 | begin | |
16ca248a ES |
628 | -- Apply the Text_IO Kludge here, since we may be renaming one of the |
629 | -- subpackages of Text_IO, then join common routine. | |
996ae0b0 RK |
630 | |
631 | Text_IO_Kludge (Name (N)); | |
632 | ||
633 | Analyze_Generic_Renaming (N, E_Generic_Package); | |
634 | end Analyze_Generic_Package_Renaming; | |
635 | ||
15ce9ca2 AC |
636 | ---------------------------------------- |
637 | -- Analyze_Generic_Procedure_Renaming -- | |
638 | ---------------------------------------- | |
996ae0b0 RK |
639 | |
640 | procedure Analyze_Generic_Procedure_Renaming (N : Node_Id) is | |
641 | begin | |
642 | Analyze_Generic_Renaming (N, E_Generic_Procedure); | |
643 | end Analyze_Generic_Procedure_Renaming; | |
644 | ||
645 | ------------------------------ | |
646 | -- Analyze_Generic_Renaming -- | |
647 | ------------------------------ | |
648 | ||
649 | procedure Analyze_Generic_Renaming | |
650 | (N : Node_Id; | |
651 | K : Entity_Kind) | |
652 | is | |
fbf5a39b | 653 | New_P : constant Entity_Id := Defining_Entity (N); |
996ae0b0 RK |
654 | Old_P : Entity_Id; |
655 | Inst : Boolean := False; -- prevent junk warning | |
656 | ||
657 | begin | |
ed4a1468 RD |
658 | if Name (N) = Error then |
659 | return; | |
660 | end if; | |
661 | ||
2ba431e5 | 662 | Check_SPARK_Restriction ("generic renaming is not allowed", N); |
fe5d3068 | 663 | |
996ae0b0 RK |
664 | Generate_Definition (New_P); |
665 | ||
666 | if Current_Scope /= Standard_Standard then | |
667 | Set_Is_Pure (New_P, Is_Pure (Current_Scope)); | |
668 | end if; | |
669 | ||
670 | if Nkind (Name (N)) = N_Selected_Component then | |
671 | Check_Generic_Child_Unit (Name (N), Inst); | |
672 | else | |
673 | Analyze (Name (N)); | |
674 | end if; | |
675 | ||
676 | if not Is_Entity_Name (Name (N)) then | |
677 | Error_Msg_N ("expect entity name in renaming declaration", Name (N)); | |
678 | Old_P := Any_Id; | |
679 | else | |
680 | Old_P := Entity (Name (N)); | |
681 | end if; | |
682 | ||
683 | Enter_Name (New_P); | |
684 | Set_Ekind (New_P, K); | |
685 | ||
686 | if Etype (Old_P) = Any_Type then | |
687 | null; | |
688 | ||
689 | elsif Ekind (Old_P) /= K then | |
690 | Error_Msg_N ("invalid generic unit name", Name (N)); | |
691 | ||
692 | else | |
693 | if Present (Renamed_Object (Old_P)) then | |
694 | Set_Renamed_Object (New_P, Renamed_Object (Old_P)); | |
695 | else | |
696 | Set_Renamed_Object (New_P, Old_P); | |
697 | end if; | |
698 | ||
923fa078 RD |
699 | Set_Is_Pure (New_P, Is_Pure (Old_P)); |
700 | Set_Is_Preelaborated (New_P, Is_Preelaborated (Old_P)); | |
701 | ||
996ae0b0 RK |
702 | Set_Etype (New_P, Etype (Old_P)); |
703 | Set_Has_Completion (New_P); | |
704 | ||
705 | if In_Open_Scopes (Old_P) then | |
706 | Error_Msg_N ("within its scope, generic denotes its instance", N); | |
707 | end if; | |
708 | ||
709 | Check_Library_Unit_Renaming (N, Old_P); | |
710 | end if; | |
42f1d661 AC |
711 | |
712 | -- Implementation-defined aspect specifications can appear in a renaming | |
713 | -- declaration, but not language-defined ones. The call to procedure | |
714 | -- Analyze_Aspect_Specifications will take care of this error check. | |
715 | ||
716 | if Has_Aspects (N) then | |
717 | Analyze_Aspect_Specifications (N, New_P); | |
718 | end if; | |
996ae0b0 RK |
719 | end Analyze_Generic_Renaming; |
720 | ||
721 | ----------------------------- | |
722 | -- Analyze_Object_Renaming -- | |
723 | ----------------------------- | |
724 | ||
725 | procedure Analyze_Object_Renaming (N : Node_Id) is | |
1378bf10 AC |
726 | Loc : constant Source_Ptr := Sloc (N); |
727 | Id : constant Entity_Id := Defining_Identifier (N); | |
996ae0b0 | 728 | Dec : Node_Id; |
1378bf10 | 729 | Nam : constant Node_Id := Name (N); |
996ae0b0 RK |
730 | T : Entity_Id; |
731 | T2 : Entity_Id; | |
732 | ||
3f5a8fee AC |
733 | procedure Check_Constrained_Object; |
734 | -- If the nominal type is unconstrained but the renamed object is | |
735 | -- constrained, as can happen with renaming an explicit dereference or | |
736 | -- a function return, build a constrained subtype from the object. If | |
737 | -- the renaming is for a formal in an accept statement, the analysis | |
738 | -- has already established its actual subtype. This is only relevant | |
739 | -- if the renamed object is an explicit dereference. | |
740 | ||
923fa078 RD |
741 | function In_Generic_Scope (E : Entity_Id) return Boolean; |
742 | -- Determine whether entity E is inside a generic cope | |
743 | ||
3f5a8fee AC |
744 | ------------------------------ |
745 | -- Check_Constrained_Object -- | |
746 | ------------------------------ | |
747 | ||
748 | procedure Check_Constrained_Object is | |
b887f1a0 | 749 | Typ : constant Entity_Id := Etype (Nam); |
3f5a8fee AC |
750 | Subt : Entity_Id; |
751 | ||
752 | begin | |
e917aec2 | 753 | if Nkind_In (Nam, N_Function_Call, N_Explicit_Dereference) |
3f5a8fee AC |
754 | and then Is_Composite_Type (Etype (Nam)) |
755 | and then not Is_Constrained (Etype (Nam)) | |
756 | and then not Has_Unknown_Discriminants (Etype (Nam)) | |
757 | and then Expander_Active | |
758 | then | |
e917aec2 | 759 | -- If Actual_Subtype is already set, nothing to do |
3f5a8fee | 760 | |
e917aec2 | 761 | if Ekind_In (Id, E_Variable, E_Constant) |
3f5a8fee AC |
762 | and then Present (Actual_Subtype (Id)) |
763 | then | |
764 | null; | |
765 | ||
42f1d661 | 766 | -- A renaming of an unchecked union has no actual subtype |
14848f57 | 767 | |
b887f1a0 | 768 | elsif Is_Unchecked_Union (Typ) then |
14848f57 AC |
769 | null; |
770 | ||
2780d174 AC |
771 | -- If a record is limited its size is invariant. This is the case |
772 | -- in particular with record types with an access discirminant | |
773 | -- that are used in iterators. This is an optimization, but it | |
774 | -- also prevents typing anomalies when the prefix is further | |
b887f1a0 | 775 | -- expanded. Limited types with discriminants are included. |
2780d174 | 776 | |
b887f1a0 | 777 | elsif Is_Limited_Record (Typ) |
150ac76e AC |
778 | or else |
779 | (Ekind (Typ) = E_Limited_Private_Type | |
780 | and then Has_Discriminants (Typ) | |
781 | and then Is_Access_Type (Etype (First_Discriminant (Typ)))) | |
b887f1a0 | 782 | then |
2780d174 AC |
783 | null; |
784 | ||
3f5a8fee AC |
785 | else |
786 | Subt := Make_Temporary (Loc, 'T'); | |
787 | Remove_Side_Effects (Nam); | |
788 | Insert_Action (N, | |
789 | Make_Subtype_Declaration (Loc, | |
790 | Defining_Identifier => Subt, | |
791 | Subtype_Indication => | |
b887f1a0 | 792 | Make_Subtype_From_Expr (Nam, Typ))); |
3f5a8fee AC |
793 | Rewrite (Subtype_Mark (N), New_Occurrence_Of (Subt, Loc)); |
794 | Set_Etype (Nam, Subt); | |
303fbb20 AC |
795 | |
796 | -- Freeze subtype at once, to prevent order of elaboration | |
797 | -- issues in the backend. The renamed object exists, so its | |
798 | -- type is already frozen in any case. | |
799 | ||
800 | Freeze_Before (N, Subt); | |
3f5a8fee AC |
801 | end if; |
802 | end if; | |
803 | end Check_Constrained_Object; | |
804 | ||
923fa078 RD |
805 | ---------------------- |
806 | -- In_Generic_Scope -- | |
807 | ---------------------- | |
808 | ||
809 | function In_Generic_Scope (E : Entity_Id) return Boolean is | |
810 | S : Entity_Id; | |
811 | ||
812 | begin | |
813 | S := Scope (E); | |
814 | while Present (S) and then S /= Standard_Standard loop | |
815 | if Is_Generic_Unit (S) then | |
816 | return True; | |
817 | end if; | |
818 | ||
819 | S := Scope (S); | |
820 | end loop; | |
821 | ||
822 | return False; | |
823 | end In_Generic_Scope; | |
824 | ||
825 | -- Start of processing for Analyze_Object_Renaming | |
826 | ||
996ae0b0 | 827 | begin |
ed4a1468 RD |
828 | if Nam = Error then |
829 | return; | |
830 | end if; | |
831 | ||
2ba431e5 | 832 | Check_SPARK_Restriction ("object renaming is not allowed", N); |
fe5d3068 | 833 | |
996ae0b0 RK |
834 | Set_Is_Pure (Id, Is_Pure (Current_Scope)); |
835 | Enter_Name (Id); | |
836 | ||
16ca248a ES |
837 | -- The renaming of a component that depends on a discriminant requires |
838 | -- an actual subtype, because in subsequent use of the object Gigi will | |
839 | -- be unable to locate the actual bounds. This explicit step is required | |
840 | -- when the renaming is generated in removing side effects of an | |
841 | -- already-analyzed expression. | |
996ae0b0 | 842 | |
42f1d661 | 843 | if Nkind (Nam) = N_Selected_Component and then Analyzed (Nam) then |
996ae0b0 RK |
844 | T := Etype (Nam); |
845 | Dec := Build_Actual_Subtype_Of_Component (Etype (Nam), Nam); | |
846 | ||
847 | if Present (Dec) then | |
848 | Insert_Action (N, Dec); | |
849 | T := Defining_Identifier (Dec); | |
850 | Set_Etype (Nam, T); | |
851 | end if; | |
852 | ||
11560bcc | 853 | -- Complete analysis of the subtype mark in any case, for ASIS use |
fbe627af RD |
854 | |
855 | if Present (Subtype_Mark (N)) then | |
856 | Find_Type (Subtype_Mark (N)); | |
857 | end if; | |
858 | ||
6e937c1c AC |
859 | elsif Present (Subtype_Mark (N)) then |
860 | Find_Type (Subtype_Mark (N)); | |
861 | T := Entity (Subtype_Mark (N)); | |
fbe627af RD |
862 | Analyze (Nam); |
863 | ||
6cce2156 GD |
864 | -- Reject renamings of conversions unless the type is tagged, or |
865 | -- the conversion is implicit (which can occur for cases of anonymous | |
866 | -- access types in Ada 2012). | |
867 | ||
fbe627af | 868 | if Nkind (Nam) = N_Type_Conversion |
6cce2156 GD |
869 | and then Comes_From_Source (Nam) |
870 | and then not Is_Tagged_Type (T) | |
fbe627af RD |
871 | then |
872 | Error_Msg_N | |
873 | ("renaming of conversion only allowed for tagged types", Nam); | |
874 | end if; | |
875 | ||
876 | Resolve (Nam, T); | |
6e937c1c | 877 | |
1378bf10 AC |
878 | -- If the renamed object is a function call of a limited type, |
879 | -- the expansion of the renaming is complicated by the presence | |
880 | -- of various temporaries and subtypes that capture constraints | |
881 | -- of the renamed object. Rewrite node as an object declaration, | |
882 | -- whose expansion is simpler. Given that the object is limited | |
883 | -- there is no copy involved and no performance hit. | |
884 | ||
885 | if Nkind (Nam) = N_Function_Call | |
886 | and then Is_Immutably_Limited_Type (Etype (Nam)) | |
92db5dee | 887 | and then not Is_Constrained (Etype (Nam)) |
1378bf10 AC |
888 | and then Comes_From_Source (N) |
889 | then | |
890 | Set_Etype (Id, T); | |
891 | Set_Ekind (Id, E_Constant); | |
892 | Rewrite (N, | |
893 | Make_Object_Declaration (Loc, | |
894 | Defining_Identifier => Id, | |
895 | Constant_Present => True, | |
92db5dee | 896 | Object_Definition => New_Occurrence_Of (Etype (Nam), Loc), |
1378bf10 AC |
897 | Expression => Relocate_Node (Nam))); |
898 | return; | |
899 | end if; | |
900 | ||
6cce2156 GD |
901 | -- Ada 2012 (AI05-149): Reject renaming of an anonymous access object |
902 | -- when renaming declaration has a named access type. The Ada 2012 | |
903 | -- coverage rules allow an anonymous access type in the context of | |
904 | -- an expected named general access type, but the renaming rules | |
905 | -- require the types to be the same. (An exception is when the type | |
906 | -- of the renaming is also an anonymous access type, which can only | |
907 | -- happen due to a renaming created by the expander.) | |
908 | ||
909 | if Nkind (Nam) = N_Type_Conversion | |
910 | and then not Comes_From_Source (Nam) | |
911 | and then Ekind (Etype (Expression (Nam))) = E_Anonymous_Access_Type | |
912 | and then Ekind (T) /= E_Anonymous_Access_Type | |
913 | then | |
914 | Wrong_Type (Expression (Nam), T); -- Should we give better error??? | |
915 | end if; | |
916 | ||
7d823354 ES |
917 | -- Check that a class-wide object is not being renamed as an object |
918 | -- of a specific type. The test for access types is needed to exclude | |
919 | -- cases where the renamed object is a dynamically tagged access | |
920 | -- result, such as occurs in certain expansions. | |
921 | ||
4755cce9 JM |
922 | if Is_Tagged_Type (T) then |
923 | Check_Dynamically_Tagged_Expression | |
924 | (Expr => Nam, | |
925 | Typ => T, | |
926 | Related_Nod => N); | |
7d823354 ES |
927 | end if; |
928 | ||
0ab80019 | 929 | -- Ada 2005 (AI-230/AI-254): Access renaming |
6e937c1c | 930 | |
9bc856dd | 931 | else pragma Assert (Present (Access_Definition (N))); |
6e937c1c AC |
932 | T := Access_Definition |
933 | (Related_Nod => N, | |
934 | N => Access_Definition (N)); | |
35b7fa6a | 935 | |
f16d05d9 AC |
936 | Analyze (Nam); |
937 | ||
938 | -- Ada 2005 AI05-105: if the declaration has an anonymous access | |
939 | -- type, the renamed object must also have an anonymous type, and | |
92db5dee AC |
940 | -- this is a name resolution rule. This was implicit in the last part |
941 | -- of the first sentence in 8.5.1(3/2), and is made explicit by this | |
942 | -- recent AI. | |
f16d05d9 AC |
943 | |
944 | if not Is_Overloaded (Nam) then | |
945 | if Ekind (Etype (Nam)) /= Ekind (T) then | |
946 | Error_Msg_N | |
a2dc5812 | 947 | ("expect anonymous access type in object renaming", N); |
f16d05d9 | 948 | end if; |
3c19e9be | 949 | |
f16d05d9 AC |
950 | else |
951 | declare | |
3c19e9be ES |
952 | I : Interp_Index; |
953 | It : Interp; | |
954 | Typ : Entity_Id := Empty; | |
e34ca162 | 955 | Seen : Boolean := False; |
f16d05d9 AC |
956 | |
957 | begin | |
958 | Get_First_Interp (Nam, I, It); | |
959 | while Present (It.Typ) loop | |
3c19e9be ES |
960 | |
961 | -- Renaming is ambiguous if more than one candidate | |
962 | -- interpretation is type-conformant with the context. | |
963 | ||
964 | if Ekind (It.Typ) = Ekind (T) then | |
965 | if Ekind (T) = E_Anonymous_Access_Subprogram_Type | |
e34ca162 AC |
966 | and then |
967 | Type_Conformant | |
968 | (Designated_Type (T), Designated_Type (It.Typ)) | |
f16d05d9 | 969 | then |
3c19e9be ES |
970 | if not Seen then |
971 | Seen := True; | |
972 | else | |
973 | Error_Msg_N | |
974 | ("ambiguous expression in renaming", Nam); | |
975 | end if; | |
976 | ||
977 | elsif Ekind (T) = E_Anonymous_Access_Type | |
e34ca162 AC |
978 | and then |
979 | Covers (Designated_Type (T), Designated_Type (It.Typ)) | |
3c19e9be ES |
980 | then |
981 | if not Seen then | |
982 | Seen := True; | |
983 | else | |
984 | Error_Msg_N | |
985 | ("ambiguous expression in renaming", Nam); | |
986 | end if; | |
987 | end if; | |
988 | ||
989 | if Covers (T, It.Typ) then | |
f16d05d9 AC |
990 | Typ := It.Typ; |
991 | Set_Etype (Nam, Typ); | |
992 | Set_Is_Overloaded (Nam, False); | |
993 | end if; | |
f16d05d9 AC |
994 | end if; |
995 | ||
996 | Get_Next_Interp (I, It); | |
997 | end loop; | |
998 | end; | |
999 | end if; | |
1000 | ||
1001 | Resolve (Nam, T); | |
6e937c1c | 1002 | |
0ab80019 | 1003 | -- Ada 2005 (AI-231): "In the case where the type is defined by an |
0fb2ea01 AC |
1004 | -- access_definition, the renamed entity shall be of an access-to- |
1005 | -- constant type if and only if the access_definition defines an | |
1006 | -- access-to-constant type" ARM 8.5.1(4) | |
35b7fa6a AC |
1007 | |
1008 | if Constant_Present (Access_Definition (N)) | |
1009 | and then not Is_Access_Constant (Etype (Nam)) | |
1010 | then | |
0ab80019 | 1011 | Error_Msg_N ("(Ada 2005): the renamed object is not " |
11560bcc | 1012 | & "access-to-constant (RM 8.5.1(6))", N); |
a2dc5812 AC |
1013 | |
1014 | elsif not Constant_Present (Access_Definition (N)) | |
1015 | and then Is_Access_Constant (Etype (Nam)) | |
1016 | then | |
1017 | Error_Msg_N ("(Ada 2005): the renamed object is not " | |
1018 | & "access-to-variable (RM 8.5.1(6))", N); | |
1019 | end if; | |
1020 | ||
1021 | if Is_Access_Subprogram_Type (Etype (Nam)) then | |
1022 | Check_Subtype_Conformant | |
1023 | (Designated_Type (T), Designated_Type (Etype (Nam))); | |
1024 | ||
1025 | elsif not Subtypes_Statically_Match | |
df3e68b1 HK |
1026 | (Designated_Type (T), |
1027 | Available_View (Designated_Type (Etype (Nam)))) | |
a2dc5812 AC |
1028 | then |
1029 | Error_Msg_N | |
1030 | ("subtype of renamed object does not statically match", N); | |
35b7fa6a | 1031 | end if; |
996ae0b0 RK |
1032 | end if; |
1033 | ||
426d2717 AC |
1034 | -- Special processing for renaming function return object. Some errors |
1035 | -- and warnings are produced only for calls that come from source. | |
fbe627af | 1036 | |
426d2717 | 1037 | if Nkind (Nam) = N_Function_Call then |
fbe627af RD |
1038 | case Ada_Version is |
1039 | ||
1040 | -- Usage is illegal in Ada 83 | |
1041 | ||
1042 | when Ada_83 => | |
426d2717 AC |
1043 | if Comes_From_Source (Nam) then |
1044 | Error_Msg_N | |
1045 | ("(Ada 83) cannot rename function return object", Nam); | |
1046 | end if; | |
fbe627af RD |
1047 | |
1048 | -- In Ada 95, warn for odd case of renaming parameterless function | |
426d2717 | 1049 | -- call if this is not a limited type (where this is useful). |
fbe627af RD |
1050 | |
1051 | when others => | |
1052 | if Warn_On_Object_Renames_Function | |
1053 | and then No (Parameter_Associations (Nam)) | |
1054 | and then not Is_Limited_Type (Etype (Nam)) | |
426d2717 | 1055 | and then Comes_From_Source (Nam) |
fbe627af RD |
1056 | then |
1057 | Error_Msg_N | |
dbfeb4fa | 1058 | ("renaming function result object is suspicious?R?", Nam); |
fbe627af | 1059 | Error_Msg_NE |
dbfeb4fa | 1060 | ("\function & will be called only once?R?", Nam, |
426d2717 | 1061 | Entity (Name (Nam))); |
ed2233dc | 1062 | Error_Msg_N -- CODEFIX |
dbfeb4fa RD |
1063 | ("\suggest using an initialized constant " |
1064 | & "object instead?R?", Nam); | |
fbe627af | 1065 | end if; |
fd366a46 | 1066 | |
fbe627af RD |
1067 | end case; |
1068 | end if; | |
1069 | ||
3f5a8fee AC |
1070 | Check_Constrained_Object; |
1071 | ||
16ca248a ES |
1072 | -- An object renaming requires an exact match of the type. Class-wide |
1073 | -- matching is not allowed. | |
996ae0b0 RK |
1074 | |
1075 | if Is_Class_Wide_Type (T) | |
1076 | and then Base_Type (Etype (Nam)) /= Base_Type (T) | |
1077 | then | |
1078 | Wrong_Type (Nam, T); | |
1079 | end if; | |
1080 | ||
1081 | T2 := Etype (Nam); | |
4de287c4 | 1082 | |
92db5dee | 1083 | -- Ada 2005 (AI-326): Handle wrong use of incomplete type |
4de287c4 ES |
1084 | |
1085 | if Nkind (Nam) = N_Explicit_Dereference | |
1086 | and then Ekind (Etype (T2)) = E_Incomplete_Type | |
1087 | then | |
3c829e3c ES |
1088 | Error_Msg_NE ("invalid use of incomplete type&", Id, T2); |
1089 | return; | |
426d2717 | 1090 | |
3c829e3c ES |
1091 | elsif Ekind (Etype (T)) = E_Incomplete_Type then |
1092 | Error_Msg_NE ("invalid use of incomplete type&", Id, T); | |
4de287c4 ES |
1093 | return; |
1094 | end if; | |
1095 | ||
923fa078 RD |
1096 | -- Ada 2005 (AI-327) |
1097 | ||
0791fbe9 | 1098 | if Ada_Version >= Ada_2005 |
923fa078 RD |
1099 | and then Nkind (Nam) = N_Attribute_Reference |
1100 | and then Attribute_Name (Nam) = Name_Priority | |
1101 | then | |
1102 | null; | |
1103 | ||
ac7d724d | 1104 | elsif Ada_Version >= Ada_2005 and then Nkind (Nam) in N_Has_Entity then |
923fa078 | 1105 | declare |
426d2717 AC |
1106 | Nam_Decl : Node_Id; |
1107 | Nam_Ent : Entity_Id; | |
923fa078 RD |
1108 | |
1109 | begin | |
1110 | if Nkind (Nam) = N_Attribute_Reference then | |
1111 | Nam_Ent := Entity (Prefix (Nam)); | |
1112 | else | |
1113 | Nam_Ent := Entity (Nam); | |
1114 | end if; | |
1115 | ||
426d2717 | 1116 | Nam_Decl := Parent (Nam_Ent); |
923fa078 RD |
1117 | |
1118 | if Has_Null_Exclusion (N) | |
1119 | and then not Has_Null_Exclusion (Nam_Decl) | |
1120 | then | |
1121 | -- Ada 2005 (AI-423): If the object name denotes a generic | |
1122 | -- formal object of a generic unit G, and the object renaming | |
1123 | -- declaration occurs within the body of G or within the body | |
1124 | -- of a generic unit declared within the declarative region | |
fbe627af | 1125 | -- of G, then the declaration of the formal object of G must |
a3c39f83 | 1126 | -- have a null exclusion or a null-excluding subtype. |
923fa078 RD |
1127 | |
1128 | if Is_Formal_Object (Nam_Ent) | |
ac7d724d | 1129 | and then In_Generic_Scope (Id) |
923fa078 | 1130 | then |
a3c39f83 ES |
1131 | if not Can_Never_Be_Null (Etype (Nam_Ent)) then |
1132 | Error_Msg_N | |
1133 | ("renamed formal does not exclude `NULL` " | |
1134 | & "(RM 8.5.1(4.6/2))", N); | |
1135 | ||
1136 | elsif In_Package_Body (Scope (Id)) then | |
1137 | Error_Msg_N | |
1138 | ("formal object does not have a null exclusion" | |
1139 | & "(RM 8.5.1(4.6/2))", N); | |
1140 | end if; | |
923fa078 | 1141 | |
16ca248a ES |
1142 | -- Ada 2005 (AI-423): Otherwise, the subtype of the object name |
1143 | -- shall exclude null. | |
923fa078 | 1144 | |
21d27997 | 1145 | elsif not Can_Never_Be_Null (Etype (Nam_Ent)) then |
fbe627af | 1146 | Error_Msg_N |
21d27997 RD |
1147 | ("renamed object does not exclude `NULL` " |
1148 | & "(RM 8.5.1(4.6/2))", N); | |
aecf0203 | 1149 | |
a3c39f83 ES |
1150 | -- An instance is illegal if it contains a renaming that |
1151 | -- excludes null, and the actual does not. The renaming | |
1152 | -- declaration has already indicated that the declaration | |
1153 | -- of the renamed actual in the instance will raise | |
1154 | -- constraint_error. | |
1155 | ||
426d2717 | 1156 | elsif Nkind (Nam_Decl) = N_Object_Declaration |
a3c39f83 | 1157 | and then In_Instance |
ac7d724d ES |
1158 | and then |
1159 | Present (Corresponding_Generic_Association (Nam_Decl)) | |
1160 | and then Nkind (Expression (Nam_Decl)) = | |
1161 | N_Raise_Constraint_Error | |
a3c39f83 ES |
1162 | then |
1163 | Error_Msg_N | |
1164 | ("renamed actual does not exclude `NULL` " | |
1165 | & "(RM 8.5.1(4.6/2))", N); | |
1166 | ||
1167 | -- Finally, if there is a null exclusion, the subtype mark | |
1168 | -- must not be null-excluding. | |
1169 | ||
1170 | elsif No (Access_Definition (N)) | |
426d2717 | 1171 | and then Can_Never_Be_Null (T) |
a3c39f83 | 1172 | then |
aecf0203 | 1173 | Error_Msg_NE |
a3c39f83 ES |
1174 | ("`NOT NULL` not allowed (& already excludes null)", |
1175 | N, T); | |
fa961f76 | 1176 | |
923fa078 | 1177 | end if; |
fa961f76 | 1178 | |
a3c39f83 ES |
1179 | elsif Can_Never_Be_Null (T) |
1180 | and then not Can_Never_Be_Null (Etype (Nam_Ent)) | |
1181 | then | |
1182 | Error_Msg_N | |
1183 | ("renamed object does not exclude `NULL` " | |
1184 | & "(RM 8.5.1(4.6/2))", N); | |
1185 | ||
fa961f76 ES |
1186 | elsif Has_Null_Exclusion (N) |
1187 | and then No (Access_Definition (N)) | |
1188 | and then Can_Never_Be_Null (T) | |
1189 | then | |
1190 | Error_Msg_NE | |
1191 | ("`NOT NULL` not allowed (& already excludes null)", N, T); | |
923fa078 RD |
1192 | end if; |
1193 | end; | |
1194 | end if; | |
1195 | ||
996ae0b0 | 1196 | Set_Ekind (Id, E_Variable); |
996c8821 RD |
1197 | |
1198 | -- Initialize the object size and alignment. Note that we used to call | |
1199 | -- Init_Size_Align here, but that's wrong for objects which have only | |
1200 | -- an Esize, not an RM_Size field! | |
1201 | ||
d15f9422 | 1202 | Init_Object_Size_Align (Id); |
996ae0b0 RK |
1203 | |
1204 | if T = Any_Type or else Etype (Nam) = Any_Type then | |
1205 | return; | |
1206 | ||
923fa078 RD |
1207 | -- Verify that the renamed entity is an object or a function call. It |
1208 | -- may have been rewritten in several ways. | |
996ae0b0 RK |
1209 | |
1210 | elsif Is_Object_Reference (Nam) then | |
124092ee AC |
1211 | if Comes_From_Source (N) then |
1212 | if Is_Dependent_Component_Of_Mutable_Object (Nam) then | |
1213 | Error_Msg_N | |
1214 | ("illegal renaming of discriminant-dependent component", Nam); | |
1215 | end if; | |
1216 | ||
1217 | -- If the renaming comes from source and the renamed object is a | |
1218 | -- dereference, then mark the prefix as needing debug information, | |
1219 | -- since it might have been rewritten hence internally generated | |
1220 | -- and Debug_Renaming_Declaration will link the renaming to it. | |
1221 | ||
1222 | if Nkind (Nam) = N_Explicit_Dereference | |
1223 | and then Is_Entity_Name (Prefix (Nam)) | |
1224 | then | |
1225 | Set_Debug_Info_Needed (Entity (Prefix (Nam))); | |
1226 | end if; | |
996ae0b0 RK |
1227 | end if; |
1228 | ||
1229 | -- A static function call may have been folded into a literal | |
1230 | ||
1231 | elsif Nkind (Original_Node (Nam)) = N_Function_Call | |
1232 | ||
1233 | -- When expansion is disabled, attribute reference is not | |
1234 | -- rewritten as function call. Otherwise it may be rewritten | |
1235 | -- as a conversion, so check original node. | |
1236 | ||
1237 | or else (Nkind (Original_Node (Nam)) = N_Attribute_Reference | |
1238 | and then Is_Function_Attribute_Name | |
294ccb21 | 1239 | (Attribute_Name (Original_Node (Nam)))) |
996ae0b0 | 1240 | |
923fa078 RD |
1241 | -- Weird but legal, equivalent to renaming a function call. |
1242 | -- Illegal if the literal is the result of constant-folding an | |
1243 | -- attribute reference that is not a function. | |
996ae0b0 RK |
1244 | |
1245 | or else (Is_Entity_Name (Nam) | |
d4810530 ES |
1246 | and then Ekind (Entity (Nam)) = E_Enumeration_Literal |
1247 | and then | |
1248 | Nkind (Original_Node (Nam)) /= N_Attribute_Reference) | |
996ae0b0 RK |
1249 | |
1250 | or else (Nkind (Nam) = N_Type_Conversion | |
ac7d724d | 1251 | and then Is_Tagged_Type (Entity (Subtype_Mark (Nam)))) |
996ae0b0 RK |
1252 | then |
1253 | null; | |
1254 | ||
923fa078 RD |
1255 | elsif Nkind (Nam) = N_Type_Conversion then |
1256 | Error_Msg_N | |
1257 | ("renaming of conversion only allowed for tagged types", Nam); | |
996ae0b0 | 1258 | |
923fa078 RD |
1259 | -- Ada 2005 (AI-327) |
1260 | ||
0791fbe9 | 1261 | elsif Ada_Version >= Ada_2005 |
923fa078 RD |
1262 | and then Nkind (Nam) = N_Attribute_Reference |
1263 | and then Attribute_Name (Nam) = Name_Priority | |
1264 | then | |
1265 | null; | |
1266 | ||
21d27997 RD |
1267 | -- Allow internally generated x'Reference expression |
1268 | ||
1269 | elsif Nkind (Nam) = N_Reference then | |
1270 | null; | |
1271 | ||
923fa078 RD |
1272 | else |
1273 | Error_Msg_N ("expect object name in renaming", Nam); | |
996ae0b0 RK |
1274 | end if; |
1275 | ||
1276 | Set_Etype (Id, T2); | |
1277 | ||
1278 | if not Is_Variable (Nam) then | |
1279 | Set_Ekind (Id, E_Constant); | |
fbf5a39b | 1280 | Set_Never_Set_In_Source (Id, True); |
996ae0b0 RK |
1281 | Set_Is_True_Constant (Id, True); |
1282 | end if; | |
1283 | ||
1284 | Set_Renamed_Object (Id, Nam); | |
42f1d661 AC |
1285 | |
1286 | -- Implementation-defined aspect specifications can appear in a renaming | |
1287 | -- declaration, but not language-defined ones. The call to procedure | |
1288 | -- Analyze_Aspect_Specifications will take care of this error check. | |
1289 | ||
1290 | if Has_Aspects (N) then | |
1291 | Analyze_Aspect_Specifications (N, Id); | |
1292 | end if; | |
1293 | ||
1294 | -- Deal with dimensions | |
1295 | ||
dec6faf1 | 1296 | Analyze_Dimension (N); |
996ae0b0 RK |
1297 | end Analyze_Object_Renaming; |
1298 | ||
1299 | ------------------------------ | |
1300 | -- Analyze_Package_Renaming -- | |
1301 | ------------------------------ | |
1302 | ||
1303 | procedure Analyze_Package_Renaming (N : Node_Id) is | |
1304 | New_P : constant Entity_Id := Defining_Entity (N); | |
1305 | Old_P : Entity_Id; | |
1306 | Spec : Node_Id; | |
1307 | ||
1308 | begin | |
ed4a1468 RD |
1309 | if Name (N) = Error then |
1310 | return; | |
1311 | end if; | |
1312 | ||
426d2717 | 1313 | -- Apply Text_IO kludge here since we may be renaming a child of Text_IO |
996ae0b0 RK |
1314 | |
1315 | Text_IO_Kludge (Name (N)); | |
1316 | ||
1317 | if Current_Scope /= Standard_Standard then | |
1318 | Set_Is_Pure (New_P, Is_Pure (Current_Scope)); | |
1319 | end if; | |
1320 | ||
1321 | Enter_Name (New_P); | |
1322 | Analyze (Name (N)); | |
16ca248a | 1323 | |
996ae0b0 RK |
1324 | if Is_Entity_Name (Name (N)) then |
1325 | Old_P := Entity (Name (N)); | |
1326 | else | |
1327 | Old_P := Any_Id; | |
1328 | end if; | |
1329 | ||
1330 | if Etype (Old_P) = Any_Type then | |
426d2717 | 1331 | Error_Msg_N ("expect package name in renaming", Name (N)); |
657a9dd9 | 1332 | |
996ae0b0 RK |
1333 | elsif Ekind (Old_P) /= E_Package |
1334 | and then not (Ekind (Old_P) = E_Generic_Package | |
1335 | and then In_Open_Scopes (Old_P)) | |
1336 | then | |
1337 | if Ekind (Old_P) = E_Generic_Package then | |
1338 | Error_Msg_N | |
1339 | ("generic package cannot be renamed as a package", Name (N)); | |
1340 | else | |
1341 | Error_Msg_Sloc := Sloc (Old_P); | |
1342 | Error_Msg_NE | |
1343 | ("expect package name in renaming, found& declared#", | |
1344 | Name (N), Old_P); | |
1345 | end if; | |
1346 | ||
bc41faa2 | 1347 | -- Set basic attributes to minimize cascaded errors |
996ae0b0 RK |
1348 | |
1349 | Set_Ekind (New_P, E_Package); | |
1350 | Set_Etype (New_P, Standard_Void_Type); | |
1351 | ||
294ccb21 RD |
1352 | -- Here for OK package renaming |
1353 | ||
996ae0b0 | 1354 | else |
923fa078 RD |
1355 | -- Entities in the old package are accessible through the renaming |
1356 | -- entity. The simplest implementation is to have both packages share | |
1357 | -- the entity list. | |
996ae0b0 RK |
1358 | |
1359 | Set_Ekind (New_P, E_Package); | |
1360 | Set_Etype (New_P, Standard_Void_Type); | |
1361 | ||
1362 | if Present (Renamed_Object (Old_P)) then | |
1363 | Set_Renamed_Object (New_P, Renamed_Object (Old_P)); | |
1364 | else | |
4de287c4 | 1365 | Set_Renamed_Object (New_P, Old_P); |
996ae0b0 RK |
1366 | end if; |
1367 | ||
1368 | Set_Has_Completion (New_P); | |
1369 | ||
1370 | Set_First_Entity (New_P, First_Entity (Old_P)); | |
1371 | Set_Last_Entity (New_P, Last_Entity (Old_P)); | |
1372 | Set_First_Private_Entity (New_P, First_Private_Entity (Old_P)); | |
1373 | Check_Library_Unit_Renaming (N, Old_P); | |
1374 | Generate_Reference (Old_P, Name (N)); | |
1375 | ||
294ccb21 | 1376 | -- If the renaming is in the visible part of a package, then we set |
7d823354 | 1377 | -- Renamed_In_Spec for the renamed package, to prevent giving |
294ccb21 RD |
1378 | -- warnings about no entities referenced. Such a warning would be |
1379 | -- overenthusiastic, since clients can see entities in the renamed | |
1380 | -- package via the visible package renaming. | |
1381 | ||
1382 | declare | |
1383 | Ent : constant Entity_Id := Cunit_Entity (Current_Sem_Unit); | |
1384 | begin | |
1385 | if Ekind (Ent) = E_Package | |
1386 | and then not In_Private_Part (Ent) | |
1387 | and then In_Extended_Main_Source_Unit (N) | |
1388 | and then Ekind (Old_P) = E_Package | |
1389 | then | |
1390 | Set_Renamed_In_Spec (Old_P); | |
1391 | end if; | |
1392 | end; | |
1393 | ||
996ae0b0 RK |
1394 | -- If this is the renaming declaration of a package instantiation |
1395 | -- within itself, it is the declaration that ends the list of actuals | |
1396 | -- for the instantiation. At this point, the subtypes that rename | |
1397 | -- the actuals are flagged as generic, to avoid spurious ambiguities | |
1398 | -- if the actuals for two distinct formals happen to coincide. If | |
1399 | -- the actual is a private type, the subtype has a private completion | |
1400 | -- that is flagged in the same fashion. | |
1401 | ||
1402 | -- Resolution is identical to what is was in the original generic. | |
1403 | -- On exit from the generic instance, these are turned into regular | |
1404 | -- subtypes again, so they are compatible with types in their class. | |
1405 | ||
1406 | if not Is_Generic_Instance (Old_P) then | |
1407 | return; | |
1408 | else | |
1409 | Spec := Specification (Unit_Declaration_Node (Old_P)); | |
1410 | end if; | |
1411 | ||
1412 | if Nkind (Spec) = N_Package_Specification | |
1413 | and then Present (Generic_Parent (Spec)) | |
1414 | and then Old_P = Current_Scope | |
1415 | and then Chars (New_P) = Chars (Generic_Parent (Spec)) | |
1416 | then | |
1417 | declare | |
16ca248a ES |
1418 | E : Entity_Id; |
1419 | ||
996ae0b0 | 1420 | begin |
16ca248a | 1421 | E := First_Entity (Old_P); |
ac7d724d | 1422 | while Present (E) and then E /= New_P loop |
996ae0b0 RK |
1423 | if Is_Type (E) |
1424 | and then Nkind (Parent (E)) = N_Subtype_Declaration | |
1425 | then | |
1426 | Set_Is_Generic_Actual_Type (E); | |
1427 | ||
1428 | if Is_Private_Type (E) | |
1429 | and then Present (Full_View (E)) | |
1430 | then | |
1431 | Set_Is_Generic_Actual_Type (Full_View (E)); | |
1432 | end if; | |
1433 | end if; | |
1434 | ||
1435 | Next_Entity (E); | |
1436 | end loop; | |
1437 | end; | |
1438 | end if; | |
1439 | end if; | |
42f1d661 AC |
1440 | |
1441 | -- Implementation-defined aspect specifications can appear in a renaming | |
1442 | -- declaration, but not language-defined ones. The call to procedure | |
1443 | -- Analyze_Aspect_Specifications will take care of this error check. | |
1444 | ||
1445 | if Has_Aspects (N) then | |
1446 | Analyze_Aspect_Specifications (N, New_P); | |
1447 | end if; | |
996ae0b0 RK |
1448 | end Analyze_Package_Renaming; |
1449 | ||
1450 | ------------------------------- | |
1451 | -- Analyze_Renamed_Character -- | |
1452 | ------------------------------- | |
1453 | ||
1454 | procedure Analyze_Renamed_Character | |
1455 | (N : Node_Id; | |
1456 | New_S : Entity_Id; | |
1457 | Is_Body : Boolean) | |
1458 | is | |
1459 | C : constant Node_Id := Name (N); | |
1460 | ||
1461 | begin | |
1462 | if Ekind (New_S) = E_Function then | |
1463 | Resolve (C, Etype (New_S)); | |
1464 | ||
1465 | if Is_Body then | |
1466 | Check_Frozen_Renaming (N, New_S); | |
1467 | end if; | |
1468 | ||
1469 | else | |
1470 | Error_Msg_N ("character literal can only be renamed as function", N); | |
1471 | end if; | |
1472 | end Analyze_Renamed_Character; | |
1473 | ||
1474 | --------------------------------- | |
1475 | -- Analyze_Renamed_Dereference -- | |
1476 | --------------------------------- | |
1477 | ||
1478 | procedure Analyze_Renamed_Dereference | |
1479 | (N : Node_Id; | |
1480 | New_S : Entity_Id; | |
1481 | Is_Body : Boolean) | |
1482 | is | |
1483 | Nam : constant Node_Id := Name (N); | |
1484 | P : constant Node_Id := Prefix (Nam); | |
1485 | Typ : Entity_Id; | |
fbf5a39b | 1486 | Ind : Interp_Index; |
996ae0b0 RK |
1487 | It : Interp; |
1488 | ||
1489 | begin | |
1490 | if not Is_Overloaded (P) then | |
996ae0b0 | 1491 | if Ekind (Etype (Nam)) /= E_Subprogram_Type |
bce79204 AC |
1492 | or else not Type_Conformant (Etype (Nam), New_S) |
1493 | then | |
996ae0b0 RK |
1494 | Error_Msg_N ("designated type does not match specification", P); |
1495 | else | |
fbf5a39b | 1496 | Resolve (P); |
996ae0b0 RK |
1497 | end if; |
1498 | ||
1499 | return; | |
1500 | ||
1501 | else | |
1502 | Typ := Any_Type; | |
fbf5a39b | 1503 | Get_First_Interp (Nam, Ind, It); |
996ae0b0 RK |
1504 | |
1505 | while Present (It.Nam) loop | |
1506 | ||
1507 | if Ekind (It.Nam) = E_Subprogram_Type | |
bce79204 AC |
1508 | and then Type_Conformant (It.Nam, New_S) |
1509 | then | |
996ae0b0 RK |
1510 | if Typ /= Any_Id then |
1511 | Error_Msg_N ("ambiguous renaming", P); | |
1512 | return; | |
1513 | else | |
1514 | Typ := It.Nam; | |
1515 | end if; | |
1516 | end if; | |
1517 | ||
fbf5a39b | 1518 | Get_Next_Interp (Ind, It); |
996ae0b0 RK |
1519 | end loop; |
1520 | ||
1521 | if Typ = Any_Type then | |
1522 | Error_Msg_N ("designated type does not match specification", P); | |
1523 | else | |
1524 | Resolve (N, Typ); | |
1525 | ||
1526 | if Is_Body then | |
1527 | Check_Frozen_Renaming (N, New_S); | |
1528 | end if; | |
1529 | end if; | |
1530 | end if; | |
1531 | end Analyze_Renamed_Dereference; | |
1532 | ||
1533 | --------------------------- | |
1534 | -- Analyze_Renamed_Entry -- | |
1535 | --------------------------- | |
1536 | ||
1537 | procedure Analyze_Renamed_Entry | |
1538 | (N : Node_Id; | |
1539 | New_S : Entity_Id; | |
1540 | Is_Body : Boolean) | |
1541 | is | |
c92e8586 AC |
1542 | Nam : constant Node_Id := Name (N); |
1543 | Sel : constant Node_Id := Selector_Name (Nam); | |
1544 | Is_Actual : constant Boolean := Present (Corresponding_Formal_Spec (N)); | |
1545 | Old_S : Entity_Id; | |
996ae0b0 RK |
1546 | |
1547 | begin | |
1548 | if Entity (Sel) = Any_Id then | |
1549 | ||
bc41faa2 | 1550 | -- Selector is undefined on prefix. Error emitted already |
996ae0b0 RK |
1551 | |
1552 | Set_Has_Completion (New_S); | |
1553 | return; | |
1554 | end if; | |
1555 | ||
16ca248a | 1556 | -- Otherwise find renamed entity and build body of New_S as a call to it |
996ae0b0 RK |
1557 | |
1558 | Old_S := Find_Renamed_Entity (N, Selector_Name (Nam), New_S); | |
1559 | ||
1560 | if Old_S = Any_Id then | |
1561 | Error_Msg_N (" no subprogram or entry matches specification", N); | |
1562 | else | |
1563 | if Is_Body then | |
1564 | Check_Subtype_Conformant (New_S, Old_S, N); | |
1565 | Generate_Reference (New_S, Defining_Entity (N), 'b'); | |
1566 | Style.Check_Identifier (Defining_Entity (N), New_S); | |
725393ea ES |
1567 | |
1568 | else | |
d4810530 | 1569 | -- Only mode conformance required for a renaming_as_declaration |
725393ea ES |
1570 | |
1571 | Check_Mode_Conformant (New_S, Old_S, N); | |
996ae0b0 RK |
1572 | end if; |
1573 | ||
1574 | Inherit_Renamed_Profile (New_S, Old_S); | |
294ccb21 | 1575 | |
c92e8586 AC |
1576 | -- The prefix can be an arbitrary expression that yields a task or |
1577 | -- protected object, so it must be resolved. | |
294ccb21 RD |
1578 | |
1579 | Resolve (Prefix (Nam), Scope (Old_S)); | |
996ae0b0 RK |
1580 | end if; |
1581 | ||
1582 | Set_Convention (New_S, Convention (Old_S)); | |
1583 | Set_Has_Completion (New_S, Inside_A_Generic); | |
1584 | ||
c92e8586 AC |
1585 | -- AI05-0225: If the renamed entity is a procedure or entry of a |
1586 | -- protected object, the target object must be a variable. | |
1587 | ||
1588 | if Ekind (Scope (Old_S)) in Protected_Kind | |
1589 | and then Ekind (New_S) = E_Procedure | |
1590 | and then not Is_Variable (Prefix (Nam)) | |
1591 | then | |
1592 | if Is_Actual then | |
1593 | Error_Msg_N | |
1594 | ("target object of protected operation used as actual for " | |
1595 | & "formal procedure must be a variable", Nam); | |
1596 | else | |
1597 | Error_Msg_N | |
1598 | ("target object of protected operation renamed as procedure, " | |
1599 | & "must be a variable", Nam); | |
1600 | end if; | |
1601 | end if; | |
1602 | ||
996ae0b0 RK |
1603 | if Is_Body then |
1604 | Check_Frozen_Renaming (N, New_S); | |
1605 | end if; | |
1606 | end Analyze_Renamed_Entry; | |
1607 | ||
1608 | ----------------------------------- | |
1609 | -- Analyze_Renamed_Family_Member -- | |
1610 | ----------------------------------- | |
1611 | ||
1612 | procedure Analyze_Renamed_Family_Member | |
1613 | (N : Node_Id; | |
1614 | New_S : Entity_Id; | |
1615 | Is_Body : Boolean) | |
1616 | is | |
fbf5a39b AC |
1617 | Nam : constant Node_Id := Name (N); |
1618 | P : constant Node_Id := Prefix (Nam); | |
996ae0b0 RK |
1619 | Old_S : Entity_Id; |
1620 | ||
1621 | begin | |
1622 | if (Is_Entity_Name (P) and then Ekind (Entity (P)) = E_Entry_Family) | |
1623 | or else (Nkind (P) = N_Selected_Component | |
ac7d724d | 1624 | and then Ekind (Entity (Selector_Name (P))) = E_Entry_Family) |
996ae0b0 RK |
1625 | then |
1626 | if Is_Entity_Name (P) then | |
1627 | Old_S := Entity (P); | |
1628 | else | |
1629 | Old_S := Entity (Selector_Name (P)); | |
1630 | end if; | |
1631 | ||
1632 | if not Entity_Matches_Spec (Old_S, New_S) then | |
1633 | Error_Msg_N ("entry family does not match specification", N); | |
1634 | ||
1635 | elsif Is_Body then | |
1636 | Check_Subtype_Conformant (New_S, Old_S, N); | |
1637 | Generate_Reference (New_S, Defining_Entity (N), 'b'); | |
1638 | Style.Check_Identifier (Defining_Entity (N), New_S); | |
1639 | end if; | |
16ca248a | 1640 | |
996ae0b0 RK |
1641 | else |
1642 | Error_Msg_N ("no entry family matches specification", N); | |
1643 | end if; | |
1644 | ||
1645 | Set_Has_Completion (New_S, Inside_A_Generic); | |
1646 | ||
1647 | if Is_Body then | |
1648 | Check_Frozen_Renaming (N, New_S); | |
1649 | end if; | |
1650 | end Analyze_Renamed_Family_Member; | |
1651 | ||
294ccb21 RD |
1652 | ----------------------------------------- |
1653 | -- Analyze_Renamed_Primitive_Operation -- | |
1654 | ----------------------------------------- | |
1655 | ||
1656 | procedure Analyze_Renamed_Primitive_Operation | |
1657 | (N : Node_Id; | |
1658 | New_S : Entity_Id; | |
1659 | Is_Body : Boolean) | |
1660 | is | |
1661 | Old_S : Entity_Id; | |
1662 | ||
1663 | function Conforms | |
1664 | (Subp : Entity_Id; | |
1665 | Ctyp : Conformance_Type) return Boolean; | |
1666 | -- Verify that the signatures of the renamed entity and the new entity | |
1667 | -- match. The first formal of the renamed entity is skipped because it | |
1668 | -- is the target object in any subsequent call. | |
1669 | ||
c5d00db0 AC |
1670 | -------------- |
1671 | -- Conforms -- | |
1672 | -------------- | |
1673 | ||
294ccb21 RD |
1674 | function Conforms |
1675 | (Subp : Entity_Id; | |
1676 | Ctyp : Conformance_Type) return Boolean | |
1677 | is | |
1678 | Old_F : Entity_Id; | |
1679 | New_F : Entity_Id; | |
1680 | ||
1681 | begin | |
1682 | if Ekind (Subp) /= Ekind (New_S) then | |
1683 | return False; | |
1684 | end if; | |
1685 | ||
1686 | Old_F := Next_Formal (First_Formal (Subp)); | |
1687 | New_F := First_Formal (New_S); | |
1688 | while Present (Old_F) and then Present (New_F) loop | |
1689 | if not Conforming_Types (Etype (Old_F), Etype (New_F), Ctyp) then | |
1690 | return False; | |
1691 | end if; | |
1692 | ||
1693 | if Ctyp >= Mode_Conformant | |
1694 | and then Ekind (Old_F) /= Ekind (New_F) | |
1695 | then | |
1696 | return False; | |
1697 | end if; | |
1698 | ||
1699 | Next_Formal (New_F); | |
1700 | Next_Formal (Old_F); | |
1701 | end loop; | |
1702 | ||
1703 | return True; | |
1704 | end Conforms; | |
1705 | ||
c5d00db0 AC |
1706 | -- Start of processing for Analyze_Renamed_Primitive_Operation |
1707 | ||
294ccb21 RD |
1708 | begin |
1709 | if not Is_Overloaded (Selector_Name (Name (N))) then | |
1710 | Old_S := Entity (Selector_Name (Name (N))); | |
1711 | ||
1712 | if not Conforms (Old_S, Type_Conformant) then | |
1713 | Old_S := Any_Id; | |
1714 | end if; | |
1715 | ||
1716 | else | |
1717 | -- Find the operation that matches the given signature | |
1718 | ||
1719 | declare | |
1720 | It : Interp; | |
1721 | Ind : Interp_Index; | |
1722 | ||
1723 | begin | |
1724 | Old_S := Any_Id; | |
1725 | Get_First_Interp (Selector_Name (Name (N)), Ind, It); | |
1726 | ||
1727 | while Present (It.Nam) loop | |
1728 | if Conforms (It.Nam, Type_Conformant) then | |
1729 | Old_S := It.Nam; | |
1730 | end if; | |
1731 | ||
1732 | Get_Next_Interp (Ind, It); | |
1733 | end loop; | |
1734 | end; | |
1735 | end if; | |
1736 | ||
1737 | if Old_S = Any_Id then | |
1738 | Error_Msg_N (" no subprogram or entry matches specification", N); | |
1739 | ||
1740 | else | |
1741 | if Is_Body then | |
1742 | if not Conforms (Old_S, Subtype_Conformant) then | |
1743 | Error_Msg_N ("subtype conformance error in renaming", N); | |
1744 | end if; | |
1745 | ||
1746 | Generate_Reference (New_S, Defining_Entity (N), 'b'); | |
1747 | Style.Check_Identifier (Defining_Entity (N), New_S); | |
1748 | ||
1749 | else | |
1750 | -- Only mode conformance required for a renaming_as_declaration | |
1751 | ||
1752 | if not Conforms (Old_S, Mode_Conformant) then | |
1753 | Error_Msg_N ("mode conformance error in renaming", N); | |
1754 | end if; | |
c5d00db0 AC |
1755 | |
1756 | -- Enforce the rule given in (RM 6.3.1 (10.1/2)): a prefixed | |
1757 | -- view of a subprogram is intrinsic, because the compiler has | |
1758 | -- to generate a wrapper for any call to it. If the name in a | |
1759 | -- subprogram renaming is a prefixed view, the entity is thus | |
1760 | -- intrinsic, and 'Access cannot be applied to it. | |
1761 | ||
1762 | Set_Convention (New_S, Convention_Intrinsic); | |
294ccb21 RD |
1763 | end if; |
1764 | ||
1765 | -- Inherit_Renamed_Profile (New_S, Old_S); | |
1766 | ||
1767 | -- The prefix can be an arbitrary expression that yields an | |
1768 | -- object, so it must be resolved. | |
1769 | ||
1770 | Resolve (Prefix (Name (N))); | |
1771 | end if; | |
1772 | end Analyze_Renamed_Primitive_Operation; | |
1773 | ||
996ae0b0 RK |
1774 | --------------------------------- |
1775 | -- Analyze_Subprogram_Renaming -- | |
1776 | --------------------------------- | |
1777 | ||
1778 | procedure Analyze_Subprogram_Renaming (N : Node_Id) is | |
afc8324d AC |
1779 | Formal_Spec : constant Node_Id := Corresponding_Formal_Spec (N); |
1780 | Is_Actual : constant Boolean := Present (Formal_Spec); | |
923fa078 | 1781 | Inst_Node : Node_Id := Empty; |
0ab80019 | 1782 | Nam : constant Node_Id := Name (N); |
996ae0b0 | 1783 | New_S : Entity_Id; |
d239991f | 1784 | Old_S : Entity_Id := Empty; |
996ae0b0 | 1785 | Rename_Spec : Entity_Id; |
923fa078 | 1786 | Save_AV : constant Ada_Version_Type := Ada_Version; |
fb620b37 | 1787 | Save_AVP : constant Node_Id := Ada_Version_Pragma; |
923fa078 RD |
1788 | Save_AV_Exp : constant Ada_Version_Type := Ada_Version_Explicit; |
1789 | Spec : constant Node_Id := Specification (N); | |
1790 | ||
1791 | procedure Check_Null_Exclusion | |
1792 | (Ren : Entity_Id; | |
1793 | Sub : Entity_Id); | |
1794 | -- Ada 2005 (AI-423): Given renaming Ren of subprogram Sub, check the | |
1795 | -- following AI rules: | |
16ca248a ES |
1796 | -- |
1797 | -- If Ren is a renaming of a formal subprogram and one of its | |
1798 | -- parameters has a null exclusion, then the corresponding formal | |
1799 | -- in Sub must also have one. Otherwise the subtype of the Sub's | |
1800 | -- formal parameter must exclude null. | |
1801 | -- | |
f3d57416 | 1802 | -- If Ren is a renaming of a formal function and its return |
16ca248a ES |
1803 | -- profile has a null exclusion, then Sub's return profile must |
1804 | -- have one. Otherwise the subtype of Sub's return profile must | |
1805 | -- exclude null. | |
996ae0b0 | 1806 | |
02e4edea AC |
1807 | procedure Freeze_Actual_Profile; |
1808 | -- In Ada 2012, enforce the freezing rule concerning formal incomplete | |
1809 | -- types: a callable entity freezes its profile, unless it has an | |
1810 | -- incomplete untagged formal (RM 13.14(10.2/3)). | |
1811 | ||
07fc65c4 | 1812 | function Original_Subprogram (Subp : Entity_Id) return Entity_Id; |
16ca248a ES |
1813 | -- Find renamed entity when the declaration is a renaming_as_body and |
1814 | -- the renamed entity may itself be a renaming_as_body. Used to enforce | |
1815 | -- rule that a renaming_as_body is illegal if the declaration occurs | |
1816 | -- before the subprogram it completes is frozen, and renaming indirectly | |
1817 | -- renames the subprogram itself.(Defect Report 8652/0027). | |
07fc65c4 | 1818 | |
1138cf59 AC |
1819 | function Check_Class_Wide_Actual return Entity_Id; |
1820 | -- AI05-0071: In an instance, if the actual for a formal type FT with | |
1821 | -- unknown discriminants is a class-wide type CT, and the generic has | |
1822 | -- a formal subprogram with a box for a primitive operation of FT, | |
1823 | -- then the corresponding actual subprogram denoted by the default is a | |
1824 | -- class-wide operation whose body is a dispatching call. We replace the | |
1825 | -- generated renaming declaration: | |
1826 | -- | |
c7b9d548 | 1827 | -- procedure P (X : CT) renames P; |
1138cf59 AC |
1828 | -- |
1829 | -- by a different renaming and a class-wide operation: | |
1830 | -- | |
c7b9d548 AC |
1831 | -- procedure Pr (X : T) renames P; -- renames primitive operation |
1832 | -- procedure P (X : CT); -- class-wide operation | |
1833 | -- ... | |
1834 | -- procedure P (X : CT) is begin Pr (X); end; -- dispatching call | |
1835 | -- | |
1138cf59 AC |
1836 | -- This rule only applies if there is no explicit visible class-wide |
1837 | -- operation at the point of the instantiation. | |
1838 | ||
fd3d2680 AC |
1839 | function Has_Class_Wide_Actual return Boolean; |
1840 | -- Ada 2012 (AI05-071, AI05-0131): True if N is the renaming for a | |
1841 | -- defaulted formal subprogram when the actual for the controlling | |
1842 | -- formal type is class-wide. | |
1843 | ||
1138cf59 AC |
1844 | ----------------------------- |
1845 | -- Check_Class_Wide_Actual -- | |
1846 | ----------------------------- | |
1847 | ||
1848 | function Check_Class_Wide_Actual return Entity_Id is | |
1849 | Loc : constant Source_Ptr := Sloc (N); | |
1850 | ||
1851 | F : Entity_Id; | |
1852 | Formal_Type : Entity_Id; | |
1853 | Actual_Type : Entity_Id; | |
1854 | New_Body : Node_Id; | |
1855 | New_Decl : Node_Id; | |
1856 | Result : Entity_Id; | |
1857 | ||
1858 | function Make_Call (Prim_Op : Entity_Id) return Node_Id; | |
1859 | -- Build dispatching call for body of class-wide operation | |
1860 | ||
1861 | function Make_Spec return Node_Id; | |
1862 | -- Create subprogram specification for declaration and body of | |
1863 | -- class-wide operation, using signature of renaming declaration. | |
1864 | ||
1865 | --------------- | |
1866 | -- Make_Call -- | |
1867 | --------------- | |
1868 | ||
1869 | function Make_Call (Prim_Op : Entity_Id) return Node_Id is | |
1870 | Actuals : List_Id; | |
1871 | F : Node_Id; | |
1872 | ||
1873 | begin | |
1874 | Actuals := New_List; | |
1875 | F := First (Parameter_Specifications (Specification (New_Decl))); | |
1876 | while Present (F) loop | |
1877 | Append_To (Actuals, | |
1878 | Make_Identifier (Loc, Chars (Defining_Identifier (F)))); | |
1879 | Next (F); | |
1880 | end loop; | |
1881 | ||
fd3d2680 | 1882 | if Ekind_In (Prim_Op, E_Function, E_Operator) then |
1138cf59 AC |
1883 | return Make_Simple_Return_Statement (Loc, |
1884 | Expression => | |
1885 | Make_Function_Call (Loc, | |
1886 | Name => New_Occurrence_Of (Prim_Op, Loc), | |
1887 | Parameter_Associations => Actuals)); | |
1888 | else | |
1889 | return | |
1890 | Make_Procedure_Call_Statement (Loc, | |
1891 | Name => New_Occurrence_Of (Prim_Op, Loc), | |
1892 | Parameter_Associations => Actuals); | |
1893 | end if; | |
1894 | end Make_Call; | |
1895 | ||
1896 | --------------- | |
1897 | -- Make_Spec -- | |
1898 | --------------- | |
1899 | ||
1900 | function Make_Spec return Node_Id is | |
1901 | Param_Specs : constant List_Id := Copy_Parameter_List (New_S); | |
1902 | ||
1903 | begin | |
1904 | if Ekind (New_S) = E_Procedure then | |
1905 | return | |
1906 | Make_Procedure_Specification (Loc, | |
1907 | Defining_Unit_Name => | |
1908 | Make_Defining_Identifier (Loc, | |
1909 | Chars (Defining_Unit_Name (Spec))), | |
1910 | Parameter_Specifications => Param_Specs); | |
1911 | else | |
1912 | return | |
1913 | Make_Function_Specification (Loc, | |
1914 | Defining_Unit_Name => | |
1915 | Make_Defining_Identifier (Loc, | |
1916 | Chars (Defining_Unit_Name (Spec))), | |
1917 | Parameter_Specifications => Param_Specs, | |
1918 | Result_Definition => | |
1919 | New_Copy_Tree (Result_Definition (Spec))); | |
1920 | end if; | |
1921 | end Make_Spec; | |
1922 | ||
1923 | -- Start of processing for Check_Class_Wide_Actual | |
1924 | ||
1925 | begin | |
1926 | Result := Any_Id; | |
1927 | Formal_Type := Empty; | |
1928 | Actual_Type := Empty; | |
1929 | ||
1930 | F := First_Formal (Formal_Spec); | |
1931 | while Present (F) loop | |
1932 | if Has_Unknown_Discriminants (Etype (F)) | |
fd3d2680 | 1933 | and then not Is_Class_Wide_Type (Etype (F)) |
1138cf59 AC |
1934 | and then Is_Class_Wide_Type (Get_Instance_Of (Etype (F))) |
1935 | then | |
1936 | Formal_Type := Etype (F); | |
1937 | Actual_Type := Etype (Get_Instance_Of (Formal_Type)); | |
1938 | exit; | |
1939 | end if; | |
1940 | ||
1941 | Next_Formal (F); | |
1942 | end loop; | |
1943 | ||
1944 | if Present (Formal_Type) then | |
1945 | ||
1946 | -- Create declaration and body for class-wide operation | |
1947 | ||
1948 | New_Decl := | |
1949 | Make_Subprogram_Declaration (Loc, Specification => Make_Spec); | |
1950 | ||
1951 | New_Body := | |
1952 | Make_Subprogram_Body (Loc, | |
1953 | Specification => Make_Spec, | |
1954 | Declarations => No_List, | |
1955 | Handled_Statement_Sequence => | |
1956 | Make_Handled_Sequence_Of_Statements (Loc, New_List)); | |
1957 | ||
1958 | -- Modify Spec and create internal name for renaming of primitive | |
1959 | -- operation. | |
1960 | ||
1961 | Set_Defining_Unit_Name (Spec, Make_Temporary (Loc, 'R')); | |
1962 | F := First (Parameter_Specifications (Spec)); | |
1963 | while Present (F) loop | |
1964 | if Nkind (Parameter_Type (F)) = N_Identifier | |
1965 | and then Is_Class_Wide_Type (Entity (Parameter_Type (F))) | |
1966 | then | |
1967 | Set_Parameter_Type (F, New_Occurrence_Of (Actual_Type, Loc)); | |
1968 | end if; | |
1969 | Next (F); | |
1970 | end loop; | |
1971 | ||
1972 | New_S := Analyze_Subprogram_Specification (Spec); | |
0469274e | 1973 | Result := Find_Renamed_Entity (N, Name (N), New_S, Is_Actual); |
1138cf59 AC |
1974 | end if; |
1975 | ||
1976 | if Result /= Any_Id then | |
1977 | Insert_Before (N, New_Decl); | |
1978 | Analyze (New_Decl); | |
1979 | ||
1980 | -- Add dispatching call to body of class-wide operation | |
1981 | ||
1982 | Append (Make_Call (Result), | |
1983 | Statements (Handled_Statement_Sequence (New_Body))); | |
1984 | ||
1985 | -- The generated body does not freeze. It is analyzed when the | |
f4f92d9d AC |
1986 | -- generated operation is frozen. This body is only needed if |
1987 | -- expansion is enabled. | |
1138cf59 | 1988 | |
f4f92d9d AC |
1989 | if Expander_Active then |
1990 | Append_Freeze_Action (Defining_Entity (New_Decl), New_Body); | |
1991 | end if; | |
1138cf59 AC |
1992 | |
1993 | Result := Defining_Entity (New_Decl); | |
1994 | end if; | |
1995 | ||
3e24afaa | 1996 | -- Return the class-wide operation if one was created |
1138cf59 AC |
1997 | |
1998 | return Result; | |
1999 | end Check_Class_Wide_Actual; | |
2000 | ||
923fa078 RD |
2001 | -------------------------- |
2002 | -- Check_Null_Exclusion -- | |
2003 | -------------------------- | |
2004 | ||
2005 | procedure Check_Null_Exclusion | |
2006 | (Ren : Entity_Id; | |
2007 | Sub : Entity_Id) | |
2008 | is | |
16ca248a ES |
2009 | Ren_Formal : Entity_Id; |
2010 | Sub_Formal : Entity_Id; | |
923fa078 RD |
2011 | |
2012 | begin | |
2013 | -- Parameter check | |
2014 | ||
16ca248a ES |
2015 | Ren_Formal := First_Formal (Ren); |
2016 | Sub_Formal := First_Formal (Sub); | |
ac7d724d | 2017 | while Present (Ren_Formal) and then Present (Sub_Formal) loop |
923fa078 RD |
2018 | if Has_Null_Exclusion (Parent (Ren_Formal)) |
2019 | and then | |
2020 | not (Has_Null_Exclusion (Parent (Sub_Formal)) | |
ac7d724d | 2021 | or else Can_Never_Be_Null (Etype (Sub_Formal))) |
923fa078 | 2022 | then |
fbe627af RD |
2023 | Error_Msg_NE |
2024 | ("`NOT NULL` required for parameter &", | |
2025 | Parent (Sub_Formal), Sub_Formal); | |
923fa078 RD |
2026 | end if; |
2027 | ||
2028 | Next_Formal (Ren_Formal); | |
2029 | Next_Formal (Sub_Formal); | |
2030 | end loop; | |
2031 | ||
2032 | -- Return profile check | |
2033 | ||
2034 | if Nkind (Parent (Ren)) = N_Function_Specification | |
2035 | and then Nkind (Parent (Sub)) = N_Function_Specification | |
2036 | and then Has_Null_Exclusion (Parent (Ren)) | |
ac7d724d ES |
2037 | and then not (Has_Null_Exclusion (Parent (Sub)) |
2038 | or else Can_Never_Be_Null (Etype (Sub))) | |
923fa078 | 2039 | then |
fbe627af RD |
2040 | Error_Msg_N |
2041 | ("return must specify `NOT NULL`", | |
2042 | Result_Definition (Parent (Sub))); | |
923fa078 RD |
2043 | end if; |
2044 | end Check_Null_Exclusion; | |
2045 | ||
02e4edea AC |
2046 | --------------------------- |
2047 | -- Freeze_Actual_Profile -- | |
2048 | --------------------------- | |
2049 | ||
2050 | procedure Freeze_Actual_Profile is | |
2051 | F : Entity_Id; | |
2052 | Has_Untagged_Inc : Boolean; | |
2053 | Instantiation_Node : constant Node_Id := Parent (N); | |
2054 | ||
2055 | begin | |
2056 | if Ada_Version >= Ada_2012 then | |
2057 | F := First_Formal (Formal_Spec); | |
2058 | Has_Untagged_Inc := False; | |
2059 | while Present (F) loop | |
2060 | if Ekind (Etype (F)) = E_Incomplete_Type | |
2061 | and then not Is_Tagged_Type (Etype (F)) | |
2062 | then | |
2063 | Has_Untagged_Inc := True; | |
2064 | exit; | |
2065 | end if; | |
2066 | ||
2067 | F := Next_Formal (F); | |
2068 | end loop; | |
2069 | ||
2070 | if Ekind (Formal_Spec) = E_Function | |
2071 | and then Ekind (Etype (Formal_Spec)) = E_Incomplete_Type | |
2072 | and then not Is_Tagged_Type (Etype (F)) | |
2073 | then | |
2074 | Has_Untagged_Inc := True; | |
2075 | end if; | |
2076 | ||
2077 | if not Has_Untagged_Inc then | |
2078 | F := First_Formal (Old_S); | |
2079 | while Present (F) loop | |
2080 | Freeze_Before (Instantiation_Node, Etype (F)); | |
2081 | ||
2082 | if Is_Incomplete_Or_Private_Type (Etype (F)) | |
2083 | and then No (Underlying_Type (Etype (F))) | |
02e4edea | 2084 | then |
6ee07c61 AC |
2085 | |
2086 | -- Exclude generic types, or types derived from them. | |
2087 | -- They will be frozen in the enclosing instance. | |
2088 | ||
2089 | if Is_Generic_Type (Etype (F)) | |
2090 | or else Is_Generic_Type (Root_Type (Etype (F))) | |
2091 | then | |
2092 | null; | |
2093 | else | |
2094 | Error_Msg_NE | |
2095 | ("type& must be frozen before this point", | |
67a90476 | 2096 | Instantiation_Node, Etype (F)); |
6ee07c61 | 2097 | end if; |
02e4edea AC |
2098 | end if; |
2099 | ||
2100 | F := Next_Formal (F); | |
2101 | end loop; | |
2102 | end if; | |
2103 | end if; | |
2104 | end Freeze_Actual_Profile; | |
2105 | ||
fd3d2680 AC |
2106 | --------------------------- |
2107 | -- Has_Class_Wide_Actual -- | |
2108 | --------------------------- | |
2109 | ||
2110 | function Has_Class_Wide_Actual return Boolean is | |
2111 | F_Nam : Entity_Id; | |
2112 | F_Spec : Entity_Id; | |
2113 | ||
2114 | begin | |
2115 | if Is_Actual | |
2116 | and then Nkind (Nam) in N_Has_Entity | |
2117 | and then Present (Entity (Nam)) | |
2118 | and then Is_Dispatching_Operation (Entity (Nam)) | |
2119 | then | |
2120 | F_Nam := First_Entity (Entity (Nam)); | |
2121 | F_Spec := First_Formal (Formal_Spec); | |
ac7d724d | 2122 | while Present (F_Nam) and then Present (F_Spec) loop |
fd3d2680 AC |
2123 | if Is_Controlling_Formal (F_Nam) |
2124 | and then Has_Unknown_Discriminants (Etype (F_Spec)) | |
2125 | and then not Is_Class_Wide_Type (Etype (F_Spec)) | |
2126 | and then Is_Class_Wide_Type (Get_Instance_Of (Etype (F_Spec))) | |
2127 | then | |
2128 | return True; | |
2129 | end if; | |
2130 | ||
2131 | Next_Entity (F_Nam); | |
2132 | Next_Formal (F_Spec); | |
2133 | end loop; | |
2134 | end if; | |
2135 | ||
2136 | return False; | |
2137 | end Has_Class_Wide_Actual; | |
2138 | ||
07fc65c4 GB |
2139 | ------------------------- |
2140 | -- Original_Subprogram -- | |
2141 | ------------------------- | |
2142 | ||
2143 | function Original_Subprogram (Subp : Entity_Id) return Entity_Id is | |
2144 | Orig_Decl : Node_Id; | |
2145 | Orig_Subp : Entity_Id; | |
2146 | ||
2147 | begin | |
2148 | -- First case: renamed entity is itself a renaming | |
2149 | ||
2150 | if Present (Alias (Subp)) then | |
2151 | return Alias (Subp); | |
2152 | ||
ac7d724d ES |
2153 | elsif Nkind (Unit_Declaration_Node (Subp)) = N_Subprogram_Declaration |
2154 | and then Present (Corresponding_Body (Unit_Declaration_Node (Subp))) | |
07fc65c4 GB |
2155 | then |
2156 | -- Check if renamed entity is a renaming_as_body | |
2157 | ||
2158 | Orig_Decl := | |
2159 | Unit_Declaration_Node | |
2160 | (Corresponding_Body (Unit_Declaration_Node (Subp))); | |
2161 | ||
2162 | if Nkind (Orig_Decl) = N_Subprogram_Renaming_Declaration then | |
2163 | Orig_Subp := Entity (Name (Orig_Decl)); | |
2164 | ||
2165 | if Orig_Subp = Rename_Spec then | |
2166 | ||
bc41faa2 | 2167 | -- Circularity detected |
07fc65c4 GB |
2168 | |
2169 | return Orig_Subp; | |
2170 | ||
2171 | else | |
2172 | return (Original_Subprogram (Orig_Subp)); | |
2173 | end if; | |
2174 | else | |
2175 | return Subp; | |
2176 | end if; | |
2177 | else | |
2178 | return Subp; | |
2179 | end if; | |
2180 | end Original_Subprogram; | |
2181 | ||
fd3d2680 AC |
2182 | CW_Actual : constant Boolean := Has_Class_Wide_Actual; |
2183 | -- Ada 2012 (AI05-071, AI05-0131): True if the renaming is for a | |
2184 | -- defaulted formal subprogram when the actual for a related formal | |
2185 | -- type is class-wide. | |
2186 | ||
fbf5a39b | 2187 | -- Start of processing for Analyze_Subprogram_Renaming |
07fc65c4 | 2188 | |
996ae0b0 RK |
2189 | begin |
2190 | -- We must test for the attribute renaming case before the Analyze | |
2191 | -- call because otherwise Sem_Attr will complain that the attribute | |
2192 | -- is missing an argument when it is analyzed. | |
2193 | ||
2194 | if Nkind (Nam) = N_Attribute_Reference then | |
d239991f | 2195 | |
16ca248a ES |
2196 | -- In the case of an abstract formal subprogram association, rewrite |
2197 | -- an actual given by a stream attribute as the name of the | |
2198 | -- corresponding stream primitive of the type. | |
d239991f | 2199 | |
16ca248a ES |
2200 | -- In a generic context the stream operations are not generated, and |
2201 | -- this must be treated as a normal attribute reference, to be | |
2202 | -- expanded in subsequent instantiations. | |
d4810530 | 2203 | |
ac7d724d ES |
2204 | if Is_Actual |
2205 | and then Is_Abstract_Subprogram (Formal_Spec) | |
56812278 | 2206 | and then Full_Expander_Active |
d4810530 | 2207 | then |
d239991f GD |
2208 | declare |
2209 | Stream_Prim : Entity_Id; | |
2210 | Prefix_Type : constant Entity_Id := Entity (Prefix (Nam)); | |
2211 | ||
2212 | begin | |
2213 | -- The class-wide forms of the stream attributes are not | |
2214 | -- primitive dispatching operations (even though they | |
2215 | -- internally dispatch to a stream attribute). | |
2216 | ||
2217 | if Is_Class_Wide_Type (Prefix_Type) then | |
2218 | Error_Msg_N | |
2219 | ("attribute must be a primitive dispatching operation", | |
2220 | Nam); | |
2221 | return; | |
2222 | end if; | |
2223 | ||
2224 | -- Retrieve the primitive subprogram associated with the | |
16ca248a ES |
2225 | -- attribute. This can only be a stream attribute, since those |
2226 | -- are the only ones that are dispatching (and the actual for | |
2227 | -- an abstract formal subprogram must be dispatching | |
2228 | -- operation). | |
d239991f | 2229 | |
6a4d72a6 ES |
2230 | begin |
2231 | case Attribute_Name (Nam) is | |
2232 | when Name_Input => | |
2233 | Stream_Prim := | |
2234 | Find_Prim_Op (Prefix_Type, TSS_Stream_Input); | |
2235 | when Name_Output => | |
2236 | Stream_Prim := | |
2237 | Find_Prim_Op (Prefix_Type, TSS_Stream_Output); | |
2238 | when Name_Read => | |
2239 | Stream_Prim := | |
2240 | Find_Prim_Op (Prefix_Type, TSS_Stream_Read); | |
2241 | when Name_Write => | |
2242 | Stream_Prim := | |
2243 | Find_Prim_Op (Prefix_Type, TSS_Stream_Write); | |
2244 | when others => | |
2245 | Error_Msg_N | |
2246 | ("attribute must be a primitive" | |
2247 | & " dispatching operation", Nam); | |
2248 | return; | |
2249 | end case; | |
a7a0d4dd | 2250 | |
6a4d72a6 ES |
2251 | exception |
2252 | ||
2253 | -- If no operation was found, and the type is limited, | |
2254 | -- the user should have defined one. | |
2255 | ||
2256 | when Program_Error => | |
2257 | if Is_Limited_Type (Prefix_Type) then | |
2258 | Error_Msg_NE | |
2259 | ("stream operation not defined for type&", | |
2260 | N, Prefix_Type); | |
2261 | return; | |
2262 | ||
a7a0d4dd | 2263 | -- Otherwise, compiler should have generated default |
6a4d72a6 ES |
2264 | |
2265 | else | |
2266 | raise; | |
2267 | end if; | |
2268 | end; | |
d239991f GD |
2269 | |
2270 | -- Rewrite the attribute into the name of its corresponding | |
2271 | -- primitive dispatching subprogram. We can then proceed with | |
2272 | -- the usual processing for subprogram renamings. | |
2273 | ||
2274 | declare | |
2275 | Prim_Name : constant Node_Id := | |
2276 | Make_Identifier (Sloc (Nam), | |
2277 | Chars => Chars (Stream_Prim)); | |
2278 | begin | |
2279 | Set_Entity (Prim_Name, Stream_Prim); | |
2280 | Rewrite (Nam, Prim_Name); | |
2281 | Analyze (Nam); | |
2282 | end; | |
2283 | end; | |
2284 | ||
2285 | -- Normal processing for a renaming of an attribute | |
2286 | ||
2287 | else | |
2288 | Attribute_Renaming (N); | |
2289 | return; | |
2290 | end if; | |
996ae0b0 RK |
2291 | end if; |
2292 | ||
2293 | -- Check whether this declaration corresponds to the instantiation | |
82c80734 | 2294 | -- of a formal subprogram. |
996ae0b0 | 2295 | |
16ca248a ES |
2296 | -- If this is an instantiation, the corresponding actual is frozen and |
2297 | -- error messages can be made more precise. If this is a default | |
2298 | -- subprogram, the entity is already established in the generic, and is | |
2299 | -- not retrieved by visibility. If it is a default with a box, the | |
996ae0b0 | 2300 | -- candidate interpretations, if any, have been collected when building |
16ca248a ES |
2301 | -- the renaming declaration. If overloaded, the proper interpretation is |
2302 | -- determined in Find_Renamed_Entity. If the entity is an operator, | |
996ae0b0 RK |
2303 | -- Find_Renamed_Entity applies additional visibility checks. |
2304 | ||
d239991f GD |
2305 | if Is_Actual then |
2306 | Inst_Node := Unit_Declaration_Node (Formal_Spec); | |
996ae0b0 | 2307 | |
fd3d2680 AC |
2308 | -- Check whether the renaming is for a defaulted actual subprogram |
2309 | -- with a class-wide actual. | |
2310 | ||
2311 | if CW_Actual then | |
2312 | New_S := Analyze_Subprogram_Specification (Spec); | |
2313 | Old_S := Check_Class_Wide_Actual; | |
2314 | ||
2315 | elsif Is_Entity_Name (Nam) | |
996ae0b0 RK |
2316 | and then Present (Entity (Nam)) |
2317 | and then not Comes_From_Source (Nam) | |
2318 | and then not Is_Overloaded (Nam) | |
2319 | then | |
2320 | Old_S := Entity (Nam); | |
fbf5a39b | 2321 | New_S := Analyze_Subprogram_Specification (Spec); |
996ae0b0 | 2322 | |
2e071734 AC |
2323 | -- Operator case |
2324 | ||
2325 | if Ekind (Entity (Nam)) = E_Operator then | |
2326 | ||
2327 | -- Box present | |
2328 | ||
2329 | if Box_Present (Inst_Node) then | |
2330 | Old_S := Find_Renamed_Entity (N, Name (N), New_S, Is_Actual); | |
2331 | ||
2332 | -- If there is an immediately visible homonym of the operator | |
2333 | -- and the declaration has a default, this is worth a warning | |
2334 | -- because the user probably did not intend to get the pre- | |
16ca248a ES |
2335 | -- defined operator, visible in the generic declaration. To |
2336 | -- find if there is an intended candidate, analyze the renaming | |
2337 | -- again in the current context. | |
2e071734 AC |
2338 | |
2339 | elsif Scope (Old_S) = Standard_Standard | |
2340 | and then Present (Default_Name (Inst_Node)) | |
2341 | then | |
2342 | declare | |
2343 | Decl : constant Node_Id := New_Copy_Tree (N); | |
2344 | Hidden : Entity_Id; | |
2345 | ||
2346 | begin | |
2347 | Set_Entity (Name (Decl), Empty); | |
2348 | Analyze (Name (Decl)); | |
2349 | Hidden := | |
2350 | Find_Renamed_Entity (Decl, Name (Decl), New_S, True); | |
2351 | ||
2352 | if Present (Hidden) | |
2353 | and then In_Open_Scopes (Scope (Hidden)) | |
2354 | and then Is_Immediately_Visible (Hidden) | |
2355 | and then Comes_From_Source (Hidden) | |
923fa078 | 2356 | and then Hidden /= Old_S |
2e071734 AC |
2357 | then |
2358 | Error_Msg_Sloc := Sloc (Hidden); | |
dbfeb4fa | 2359 | Error_Msg_N ("default subprogram is resolved " & |
2e071734 | 2360 | "in the generic declaration " & |
dbfeb4fa RD |
2361 | "(RM 12.6(17))??", N); |
2362 | Error_Msg_NE ("\and will not use & #??", N, Hidden); | |
2e071734 AC |
2363 | end if; |
2364 | end; | |
2365 | end if; | |
996ae0b0 RK |
2366 | end if; |
2367 | ||
2368 | else | |
2369 | Analyze (Nam); | |
fbf5a39b | 2370 | New_S := Analyze_Subprogram_Specification (Spec); |
996ae0b0 RK |
2371 | end if; |
2372 | ||
996ae0b0 RK |
2373 | else |
2374 | -- Renamed entity must be analyzed first, to avoid being hidden by | |
2375 | -- new name (which might be the same in a generic instance). | |
2376 | ||
2377 | Analyze (Nam); | |
2378 | ||
2379 | -- The renaming defines a new overloaded entity, which is analyzed | |
2380 | -- like a subprogram declaration. | |
2381 | ||
fbf5a39b | 2382 | New_S := Analyze_Subprogram_Specification (Spec); |
996ae0b0 RK |
2383 | end if; |
2384 | ||
2385 | if Current_Scope /= Standard_Standard then | |
2386 | Set_Is_Pure (New_S, Is_Pure (Current_Scope)); | |
2387 | end if; | |
2388 | ||
2389 | Rename_Spec := Find_Corresponding_Spec (N); | |
2390 | ||
294ccb21 RD |
2391 | -- Case of Renaming_As_Body |
2392 | ||
996ae0b0 RK |
2393 | if Present (Rename_Spec) then |
2394 | ||
294ccb21 RD |
2395 | -- Renaming declaration is the completion of the declaration of |
2396 | -- Rename_Spec. We build an actual body for it at the freezing point. | |
996ae0b0 RK |
2397 | |
2398 | Set_Corresponding_Spec (N, Rename_Spec); | |
fbe627af | 2399 | |
ff81221b ES |
2400 | -- Deal with special case of stream functions of abstract types |
2401 | -- and interfaces. | |
294ccb21 | 2402 | |
d4810530 ES |
2403 | if Nkind (Unit_Declaration_Node (Rename_Spec)) = |
2404 | N_Abstract_Subprogram_Declaration | |
2405 | then | |
ff81221b ES |
2406 | -- Input stream functions are abstract if the object type is |
2407 | -- abstract. Similarly, all default stream functions for an | |
30783513 | 2408 | -- interface type are abstract. However, these subprograms may |
ff81221b ES |
2409 | -- receive explicit declarations in representation clauses, making |
2410 | -- the attribute subprograms usable as defaults in subsequent | |
2411 | -- type extensions. | |
d4810530 ES |
2412 | -- In this case we rewrite the declaration to make the subprogram |
2413 | -- non-abstract. We remove the previous declaration, and insert | |
2414 | -- the new one at the point of the renaming, to prevent premature | |
2415 | -- access to unfrozen types. The new declaration reuses the | |
2416 | -- specification of the previous one, and must not be analyzed. | |
2417 | ||
ff81221b ES |
2418 | pragma Assert |
2419 | (Is_Primitive (Entity (Nam)) | |
ac7d724d ES |
2420 | and then |
2421 | Is_Abstract_Type (Find_Dispatching_Type (Entity (Nam)))); | |
d4810530 ES |
2422 | declare |
2423 | Old_Decl : constant Node_Id := | |
2424 | Unit_Declaration_Node (Rename_Spec); | |
2425 | New_Decl : constant Node_Id := | |
2426 | Make_Subprogram_Declaration (Sloc (N), | |
2427 | Specification => | |
2428 | Relocate_Node (Specification (Old_Decl))); | |
2429 | begin | |
2430 | Remove (Old_Decl); | |
2431 | Insert_After (N, New_Decl); | |
16ca248a | 2432 | Set_Is_Abstract_Subprogram (Rename_Spec, False); |
d4810530 ES |
2433 | Set_Analyzed (New_Decl); |
2434 | end; | |
2435 | end if; | |
2436 | ||
996ae0b0 RK |
2437 | Set_Corresponding_Body (Unit_Declaration_Node (Rename_Spec), New_S); |
2438 | ||
0ab80019 | 2439 | if Ada_Version = Ada_83 and then Comes_From_Source (N) then |
996ae0b0 RK |
2440 | Error_Msg_N ("(Ada 83) renaming cannot serve as a body", N); |
2441 | end if; | |
2442 | ||
923fa078 | 2443 | Set_Convention (New_S, Convention (Rename_Spec)); |
996ae0b0 RK |
2444 | Check_Fully_Conformant (New_S, Rename_Spec); |
2445 | Set_Public_Status (New_S); | |
2446 | ||
294ccb21 RD |
2447 | -- The specification does not introduce new formals, but only |
2448 | -- repeats the formals of the original subprogram declaration. | |
2449 | -- For cross-reference purposes, and for refactoring tools, we | |
2450 | -- treat the formals of the renaming declaration as body formals. | |
2451 | ||
2452 | Reference_Body_Formals (Rename_Spec, New_S); | |
2453 | ||
4de287c4 ES |
2454 | -- Indicate that the entity in the declaration functions like the |
2455 | -- corresponding body, and is not a new entity. The body will be | |
2456 | -- constructed later at the freeze point, so indicate that the | |
2457 | -- completion has not been seen yet. | |
996ae0b0 | 2458 | |
dd3b3672 | 2459 | Set_Contract (New_S, Empty); |
996ae0b0 RK |
2460 | Set_Ekind (New_S, E_Subprogram_Body); |
2461 | New_S := Rename_Spec; | |
5eb10f25 | 2462 | Set_Has_Completion (Rename_Spec, False); |
996ae0b0 | 2463 | |
4de287c4 | 2464 | -- Ada 2005: check overriding indicator |
edd63e9b | 2465 | |
038140ed | 2466 | if Present (Overridden_Operation (Rename_Spec)) then |
235f4375 AC |
2467 | if Must_Not_Override (Specification (N)) then |
2468 | Error_Msg_NE | |
2469 | ("subprogram& overrides inherited operation", | |
2470 | N, Rename_Spec); | |
2471 | elsif | |
2472 | Style_Check and then not Must_Override (Specification (N)) | |
2473 | then | |
2474 | Style.Missing_Overriding (N, Rename_Spec); | |
2475 | end if; | |
edd63e9b | 2476 | |
235f4375 AC |
2477 | elsif Must_Override (Specification (N)) then |
2478 | Error_Msg_NE ("subprogram& is not overriding", N, Rename_Spec); | |
edd63e9b ES |
2479 | end if; |
2480 | ||
294ccb21 RD |
2481 | -- Normal subprogram renaming (not renaming as body) |
2482 | ||
996ae0b0 RK |
2483 | else |
2484 | Generate_Definition (New_S); | |
2485 | New_Overloaded_Entity (New_S); | |
edd63e9b | 2486 | |
996ae0b0 RK |
2487 | if Is_Entity_Name (Nam) |
2488 | and then Is_Intrinsic_Subprogram (Entity (Nam)) | |
2489 | then | |
2490 | null; | |
2491 | else | |
2492 | Check_Delayed_Subprogram (New_S); | |
2493 | end if; | |
2494 | end if; | |
2495 | ||
4de287c4 ES |
2496 | -- There is no need for elaboration checks on the new entity, which may |
2497 | -- be called before the next freezing point where the body will appear. | |
2498 | -- Elaboration checks refer to the real entity, not the one created by | |
2499 | -- the renaming declaration. | |
996ae0b0 | 2500 | |
fbf5a39b | 2501 | Set_Kill_Elaboration_Checks (New_S, True); |
996ae0b0 RK |
2502 | |
2503 | if Etype (Nam) = Any_Type then | |
2504 | Set_Has_Completion (New_S); | |
2505 | return; | |
2506 | ||
2507 | elsif Nkind (Nam) = N_Selected_Component then | |
2508 | ||
294ccb21 RD |
2509 | -- A prefix of the form A.B can designate an entry of task A, a |
2510 | -- protected operation of protected object A, or finally a primitive | |
2511 | -- operation of object A. In the later case, A is an object of some | |
2512 | -- tagged type, or an access type that denotes one such. To further | |
2513 | -- distinguish these cases, note that the scope of a task entry or | |
2514 | -- protected operation is type of the prefix. | |
996ae0b0 | 2515 | |
294ccb21 RD |
2516 | -- The prefix could be an overloaded function call that returns both |
2517 | -- kinds of operations. This overloading pathology is left to the | |
2518 | -- dedicated reader ??? | |
2519 | ||
2520 | declare | |
2521 | T : constant Entity_Id := Etype (Prefix (Nam)); | |
2522 | ||
2523 | begin | |
2524 | if Present (T) | |
2525 | and then | |
2526 | (Is_Tagged_Type (T) | |
2527 | or else | |
2528 | (Is_Access_Type (T) | |
ac7d724d | 2529 | and then Is_Tagged_Type (Designated_Type (T)))) |
294ccb21 RD |
2530 | and then Scope (Entity (Selector_Name (Nam))) /= T |
2531 | then | |
2532 | Analyze_Renamed_Primitive_Operation | |
2533 | (N, New_S, Present (Rename_Spec)); | |
2534 | return; | |
2535 | ||
2536 | else | |
2537 | -- Renamed entity is an entry or protected operation. For those | |
2538 | -- cases an explicit body is built (at the point of freezing of | |
2539 | -- this entity) that contains a call to the renamed entity. | |
2540 | ||
2541 | -- This is not allowed for renaming as body if the renamed | |
2542 | -- spec is already frozen (see RM 8.5.4(5) for details). | |
2543 | ||
ac7d724d | 2544 | if Present (Rename_Spec) and then Is_Frozen (Rename_Spec) then |
294ccb21 RD |
2545 | Error_Msg_N |
2546 | ("renaming-as-body cannot rename entry as subprogram", N); | |
2547 | Error_Msg_NE | |
2548 | ("\since & is already frozen (RM 8.5.4(5))", | |
2549 | N, Rename_Spec); | |
2550 | else | |
2551 | Analyze_Renamed_Entry (N, New_S, Present (Rename_Spec)); | |
2552 | end if; | |
2553 | ||
2554 | return; | |
2555 | end if; | |
2556 | end; | |
996ae0b0 RK |
2557 | |
2558 | elsif Nkind (Nam) = N_Explicit_Dereference then | |
2559 | ||
2560 | -- Renamed entity is designated by access_to_subprogram expression. | |
2561 | -- Must build body to encapsulate call, as in the entry case. | |
2562 | ||
2563 | Analyze_Renamed_Dereference (N, New_S, Present (Rename_Spec)); | |
2564 | return; | |
2565 | ||
2566 | elsif Nkind (Nam) = N_Indexed_Component then | |
2567 | Analyze_Renamed_Family_Member (N, New_S, Present (Rename_Spec)); | |
2568 | return; | |
2569 | ||
2570 | elsif Nkind (Nam) = N_Character_Literal then | |
2571 | Analyze_Renamed_Character (N, New_S, Present (Rename_Spec)); | |
2572 | return; | |
2573 | ||
a3f2babd | 2574 | elsif not Is_Entity_Name (Nam) |
996ae0b0 RK |
2575 | or else not Is_Overloadable (Entity (Nam)) |
2576 | then | |
4674dd21 AC |
2577 | -- Do not mention the renaming if it comes from an instance |
2578 | ||
2579 | if not Is_Actual then | |
2580 | Error_Msg_N ("expect valid subprogram name in renaming", N); | |
4674dd21 AC |
2581 | else |
2582 | Error_Msg_NE ("no visible subprogram for formal&", N, Nam); | |
2583 | end if; | |
2584 | ||
996ae0b0 | 2585 | return; |
996ae0b0 RK |
2586 | end if; |
2587 | ||
11560bcc TQ |
2588 | -- Find the renamed entity that matches the given specification. Disable |
2589 | -- Ada_83 because there is no requirement of full conformance between | |
2590 | -- renamed entity and new entity, even though the same circuit is used. | |
2591 | ||
2592 | -- This is a bit of a kludge, which introduces a really irregular use of | |
2593 | -- Ada_Version[_Explicit]. Would be nice to find cleaner way to do this | |
2594 | -- ??? | |
2595 | ||
2596 | Ada_Version := Ada_Version_Type'Max (Ada_Version, Ada_95); | |
fb620b37 | 2597 | Ada_Version_Pragma := Empty; |
11560bcc TQ |
2598 | Ada_Version_Explicit := Ada_Version; |
2599 | ||
2600 | if No (Old_S) then | |
2601 | Old_S := Find_Renamed_Entity (N, Name (N), New_S, Is_Actual); | |
2602 | ||
1366997b AC |
2603 | -- The visible operation may be an inherited abstract operation that |
2604 | -- was overridden in the private part, in which case a call will | |
2605 | -- dispatch to the overriding operation. Use the overriding one in | |
2606 | -- the renaming declaration, to prevent spurious errors below. | |
2607 | ||
2608 | if Is_Overloadable (Old_S) | |
2609 | and then Is_Abstract_Subprogram (Old_S) | |
2610 | and then No (DTC_Entity (Old_S)) | |
2611 | and then Present (Alias (Old_S)) | |
2612 | and then not Is_Abstract_Subprogram (Alias (Old_S)) | |
038140ed | 2613 | and then Present (Overridden_Operation (Alias (Old_S))) |
1366997b AC |
2614 | then |
2615 | Old_S := Alias (Old_S); | |
2616 | end if; | |
2617 | ||
11560bcc TQ |
2618 | -- When the renamed subprogram is overloaded and used as an actual |
2619 | -- of a generic, its entity is set to the first available homonym. | |
2620 | -- We must first disambiguate the name, then set the proper entity. | |
2621 | ||
1378bf10 | 2622 | if Is_Actual and then Is_Overloaded (Nam) then |
11560bcc TQ |
2623 | Set_Entity (Nam, Old_S); |
2624 | end if; | |
2625 | end if; | |
2626 | ||
4de287c4 ES |
2627 | -- Most common case: subprogram renames subprogram. No body is generated |
2628 | -- in this case, so we must indicate the declaration is complete as is. | |
b2c4d56d | 2629 | -- and inherit various attributes of the renamed subprogram. |
996ae0b0 RK |
2630 | |
2631 | if No (Rename_Spec) then | |
923fa078 | 2632 | Set_Has_Completion (New_S); |
b2c4d56d | 2633 | Set_Is_Imported (New_S, Is_Imported (Entity (Nam))); |
923fa078 RD |
2634 | Set_Is_Pure (New_S, Is_Pure (Entity (Nam))); |
2635 | Set_Is_Preelaborated (New_S, Is_Preelaborated (Entity (Nam))); | |
2636 | ||
2637 | -- Ada 2005 (AI-423): Check the consistency of null exclusions | |
11560bcc | 2638 | -- between a subprogram and its correct renaming. |
923fa078 | 2639 | |
11560bcc TQ |
2640 | -- Note: the Any_Id check is a guard that prevents compiler crashes |
2641 | -- when performing a null exclusion check between a renaming and a | |
2642 | -- renamed subprogram that has been found to be illegal. | |
2643 | ||
ac7d724d | 2644 | if Ada_Version >= Ada_2005 and then Entity (Nam) /= Any_Id then |
923fa078 RD |
2645 | Check_Null_Exclusion |
2646 | (Ren => New_S, | |
2647 | Sub => Entity (Nam)); | |
2648 | end if; | |
90067a15 ES |
2649 | |
2650 | -- Enforce the Ada 2005 rule that the renamed entity cannot require | |
2651 | -- overriding. The flag Requires_Overriding is set very selectively | |
2652 | -- and misses some other illegal cases. The additional conditions | |
2653 | -- checked below are sufficient but not necessary ??? | |
2654 | ||
2655 | -- The rule does not apply to the renaming generated for an actual | |
2656 | -- subprogram in an instance. | |
2657 | ||
2658 | if Is_Actual then | |
2659 | null; | |
2660 | ||
f3d57416 | 2661 | -- Guard against previous errors, and omit renamings of predefined |
90067a15 ES |
2662 | -- operators. |
2663 | ||
bce79204 | 2664 | elsif not Ekind_In (Old_S, E_Function, E_Procedure) then |
90067a15 ES |
2665 | null; |
2666 | ||
2667 | elsif Requires_Overriding (Old_S) | |
2668 | or else | |
2669 | (Is_Abstract_Subprogram (Old_S) | |
2670 | and then Present (Find_Dispatching_Type (Old_S)) | |
2671 | and then | |
2672 | not Is_Abstract_Type (Find_Dispatching_Type (Old_S))) | |
2673 | then | |
2674 | Error_Msg_N | |
2675 | ("renamed entity cannot be " | |
2676 | & "subprogram that requires overriding (RM 8.5.4 (5.1))", N); | |
2677 | end if; | |
996ae0b0 RK |
2678 | end if; |
2679 | ||
996ae0b0 | 2680 | if Old_S /= Any_Id then |
1378bf10 | 2681 | if Is_Actual and then From_Default (N) then |
ff4f0ed0 | 2682 | |
996ae0b0 RK |
2683 | -- This is an implicit reference to the default actual |
2684 | ||
2685 | Generate_Reference (Old_S, Nam, Typ => 'i', Force => True); | |
ff4f0ed0 | 2686 | |
996ae0b0 RK |
2687 | else |
2688 | Generate_Reference (Old_S, Nam); | |
2689 | end if; | |
2690 | ||
c92e8586 AC |
2691 | Check_Internal_Protected_Use (N, Old_S); |
2692 | ||
edd63e9b ES |
2693 | -- For a renaming-as-body, require subtype conformance, but if the |
2694 | -- declaration being completed has not been frozen, then inherit the | |
2695 | -- convention of the renamed subprogram prior to checking conformance | |
2696 | -- (unless the renaming has an explicit convention established; the | |
996ae0b0 RK |
2697 | -- rule stated in the RM doesn't seem to address this ???). |
2698 | ||
2699 | if Present (Rename_Spec) then | |
2700 | Generate_Reference (Rename_Spec, Defining_Entity (Spec), 'b'); | |
2701 | Style.Check_Identifier (Defining_Entity (Spec), Rename_Spec); | |
2702 | ||
07fc65c4 GB |
2703 | if not Is_Frozen (Rename_Spec) then |
2704 | if not Has_Convention_Pragma (Rename_Spec) then | |
2705 | Set_Convention (New_S, Convention (Old_S)); | |
2706 | end if; | |
2707 | ||
2708 | if Ekind (Old_S) /= E_Operator then | |
2709 | Check_Mode_Conformant (New_S, Old_S, Spec); | |
2710 | end if; | |
2711 | ||
2712 | if Original_Subprogram (Old_S) = Rename_Spec then | |
2713 | Error_Msg_N ("unfrozen subprogram cannot rename itself ", N); | |
2714 | end if; | |
2715 | else | |
2716 | Check_Subtype_Conformant (New_S, Old_S, Spec); | |
996ae0b0 RK |
2717 | end if; |
2718 | ||
2719 | Check_Frozen_Renaming (N, Rename_Spec); | |
996ae0b0 | 2720 | |
5eb10f25 | 2721 | -- Check explicitly that renamed entity is not intrinsic, because |
16b05213 | 2722 | -- in a generic the renamed body is not built. In this case, |
5eb10f25 ES |
2723 | -- the renaming_as_body is a completion. |
2724 | ||
2725 | if Inside_A_Generic then | |
2726 | if Is_Frozen (Rename_Spec) | |
2727 | and then Is_Intrinsic_Subprogram (Old_S) | |
2728 | then | |
2729 | Error_Msg_N | |
2730 | ("subprogram in renaming_as_body cannot be intrinsic", | |
2731 | Name (N)); | |
2732 | end if; | |
2733 | ||
2734 | Set_Has_Completion (Rename_Spec); | |
2735 | end if; | |
2736 | ||
996ae0b0 | 2737 | elsif Ekind (Old_S) /= E_Operator then |
1138cf59 | 2738 | |
2ba431e5 YM |
2739 | -- If this a defaulted subprogram for a class-wide actual there is |
2740 | -- no check for mode conformance, given that the signatures don't | |
3e24afaa | 2741 | -- match (the source mentions T but the actual mentions T'Class). |
1138cf59 | 2742 | |
afc8324d | 2743 | if CW_Actual then |
1138cf59 | 2744 | null; |
ac7d724d | 2745 | elsif not Is_Actual or else No (Enclosing_Instance) then |
1138cf59 AC |
2746 | Check_Mode_Conformant (New_S, Old_S); |
2747 | end if; | |
996ae0b0 | 2748 | |
ac7d724d | 2749 | if Is_Actual and then Error_Posted (New_S) then |
996ae0b0 RK |
2750 | Error_Msg_NE ("invalid actual subprogram: & #!", N, Old_S); |
2751 | end if; | |
2752 | end if; | |
2753 | ||
2754 | if No (Rename_Spec) then | |
2755 | ||
2756 | -- The parameter profile of the new entity is that of the renamed | |
2757 | -- entity: the subtypes given in the specification are irrelevant. | |
2758 | ||
2759 | Inherit_Renamed_Profile (New_S, Old_S); | |
2760 | ||
2761 | -- A call to the subprogram is transformed into a call to the | |
2762 | -- renamed entity. This is transitive if the renamed entity is | |
2763 | -- itself a renaming. | |
2764 | ||
2765 | if Present (Alias (Old_S)) then | |
2766 | Set_Alias (New_S, Alias (Old_S)); | |
2767 | else | |
2768 | Set_Alias (New_S, Old_S); | |
2769 | end if; | |
2770 | ||
edd63e9b ES |
2771 | -- Note that we do not set Is_Intrinsic_Subprogram if we have a |
2772 | -- renaming as body, since the entity in this case is not an | |
2773 | -- intrinsic (it calls an intrinsic, but we have a real body for | |
2774 | -- this call, and it is in this body that the required intrinsic | |
2775 | -- processing will take place). | |
996ae0b0 | 2776 | |
edd63e9b ES |
2777 | -- Also, if this is a renaming of inequality, the renamed operator |
2778 | -- is intrinsic, but what matters is the corresponding equality | |
2779 | -- operator, which may be user-defined. | |
fbf5a39b | 2780 | |
996ae0b0 | 2781 | Set_Is_Intrinsic_Subprogram |
fbf5a39b | 2782 | (New_S, |
ac7d724d ES |
2783 | Is_Intrinsic_Subprogram (Old_S) |
2784 | and then | |
2785 | (Chars (Old_S) /= Name_Op_Ne | |
2786 | or else Ekind (Old_S) = E_Operator | |
2787 | or else Is_Intrinsic_Subprogram | |
2788 | (Corresponding_Equality (Old_S)))); | |
996ae0b0 RK |
2789 | |
2790 | if Ekind (Alias (New_S)) = E_Operator then | |
2791 | Set_Has_Delayed_Freeze (New_S, False); | |
2792 | end if; | |
2793 | ||
82c80734 RD |
2794 | -- If the renaming corresponds to an association for an abstract |
2795 | -- formal subprogram, then various attributes must be set to | |
2796 | -- indicate that the renaming is an abstract dispatching operation | |
2797 | -- with a controlling type. | |
2798 | ||
16ca248a ES |
2799 | if Is_Actual and then Is_Abstract_Subprogram (Formal_Spec) then |
2800 | ||
82c80734 RD |
2801 | -- Mark the renaming as abstract here, so Find_Dispatching_Type |
2802 | -- see it as corresponding to a generic association for a | |
2803 | -- formal abstract subprogram | |
2804 | ||
16ca248a | 2805 | Set_Is_Abstract_Subprogram (New_S); |
82c80734 RD |
2806 | |
2807 | declare | |
2808 | New_S_Ctrl_Type : constant Entity_Id := | |
2809 | Find_Dispatching_Type (New_S); | |
2810 | Old_S_Ctrl_Type : constant Entity_Id := | |
2811 | Find_Dispatching_Type (Old_S); | |
2812 | ||
2813 | begin | |
2814 | if Old_S_Ctrl_Type /= New_S_Ctrl_Type then | |
2815 | Error_Msg_NE | |
2816 | ("actual must be dispatching subprogram for type&", | |
2817 | Nam, New_S_Ctrl_Type); | |
2818 | ||
2819 | else | |
2820 | Set_Is_Dispatching_Operation (New_S); | |
2821 | Check_Controlling_Formals (New_S_Ctrl_Type, New_S); | |
2822 | ||
16ca248a ES |
2823 | -- If the actual in the formal subprogram is itself a |
2824 | -- formal abstract subprogram association, there's no | |
2825 | -- dispatch table component or position to inherit. | |
82c80734 RD |
2826 | |
2827 | if Present (DTC_Entity (Old_S)) then | |
2828 | Set_DTC_Entity (New_S, DTC_Entity (Old_S)); | |
2829 | Set_DT_Position (New_S, DT_Position (Old_S)); | |
2830 | end if; | |
2831 | end if; | |
2832 | end; | |
2833 | end if; | |
996ae0b0 RK |
2834 | end if; |
2835 | ||
c91dbd18 AC |
2836 | if Is_Actual then |
2837 | null; | |
2838 | ||
2839 | -- The following is illegal, because F hides whatever other F may | |
2840 | -- be around: | |
a1390a6e | 2841 | -- function F (...) renames F; |
c91dbd18 AC |
2842 | |
2843 | elsif Old_S = New_S | |
2844 | or else (Nkind (Nam) /= N_Expanded_Name | |
2845 | and then Chars (Old_S) = Chars (New_S)) | |
2846 | then | |
2847 | Error_Msg_N ("subprogram cannot rename itself", N); | |
2848 | ||
a1390a6e AC |
2849 | -- This is illegal even if we use a selector: |
2850 | -- function F (...) renames Pkg.F; | |
2851 | -- because F is still hidden. | |
2852 | ||
c91dbd18 AC |
2853 | elsif Nkind (Nam) = N_Expanded_Name |
2854 | and then Entity (Prefix (Nam)) = Current_Scope | |
2855 | and then Chars (Selector_Name (Nam)) = Chars (New_S) | |
996ae0b0 | 2856 | then |
354c3840 AC |
2857 | -- This is an error, but we overlook the error and accept the |
2858 | -- renaming if the special Overriding_Renamings mode is in effect. | |
9b7424a7 | 2859 | |
354c3840 | 2860 | if not Overriding_Renamings then |
9b7424a7 | 2861 | Error_Msg_NE |
354c3840 AC |
2862 | ("implicit operation& is not visible (RM 8.3 (15))", |
2863 | Nam, Old_S); | |
9b7424a7 | 2864 | end if; |
996ae0b0 RK |
2865 | end if; |
2866 | ||
2867 | Set_Convention (New_S, Convention (Old_S)); | |
16ca248a ES |
2868 | |
2869 | if Is_Abstract_Subprogram (Old_S) then | |
2870 | if Present (Rename_Spec) then | |
2871 | Error_Msg_N | |
2872 | ("a renaming-as-body cannot rename an abstract subprogram", | |
2873 | N); | |
2874 | Set_Has_Completion (Rename_Spec); | |
2875 | else | |
2876 | Set_Is_Abstract_Subprogram (New_S); | |
2877 | end if; | |
2878 | end if; | |
2879 | ||
996ae0b0 RK |
2880 | Check_Library_Unit_Renaming (N, Old_S); |
2881 | ||
edd63e9b ES |
2882 | -- Pathological case: procedure renames entry in the scope of its |
2883 | -- task. Entry is given by simple name, but body must be built for | |
2884 | -- procedure. Of course if called it will deadlock. | |
996ae0b0 RK |
2885 | |
2886 | if Ekind (Old_S) = E_Entry then | |
2887 | Set_Has_Completion (New_S, False); | |
2888 | Set_Alias (New_S, Empty); | |
2889 | end if; | |
2890 | ||
2891 | if Is_Actual then | |
2892 | Freeze_Before (N, Old_S); | |
02e4edea | 2893 | Freeze_Actual_Profile; |
996ae0b0 RK |
2894 | Set_Has_Delayed_Freeze (New_S, False); |
2895 | Freeze_Before (N, New_S); | |
2896 | ||
82c80734 RD |
2897 | -- An abstract subprogram is only allowed as an actual in the case |
2898 | -- where the formal subprogram is also abstract. | |
2899 | ||
996ae0b0 | 2900 | if (Ekind (Old_S) = E_Procedure or else Ekind (Old_S) = E_Function) |
16ca248a ES |
2901 | and then Is_Abstract_Subprogram (Old_S) |
2902 | and then not Is_Abstract_Subprogram (Formal_Spec) | |
996ae0b0 RK |
2903 | then |
2904 | Error_Msg_N | |
2905 | ("abstract subprogram not allowed as generic actual", Nam); | |
2906 | end if; | |
2907 | end if; | |
2908 | ||
2909 | else | |
edd63e9b ES |
2910 | -- A common error is to assume that implicit operators for types are |
2911 | -- defined in Standard, or in the scope of a subtype. In those cases | |
2912 | -- where the renamed entity is given with an expanded name, it is | |
2913 | -- worth mentioning that operators for the type are not declared in | |
2914 | -- the scope given by the prefix. | |
996ae0b0 RK |
2915 | |
2916 | if Nkind (Nam) = N_Expanded_Name | |
2917 | and then Nkind (Selector_Name (Nam)) = N_Operator_Symbol | |
2918 | and then Scope (Entity (Nam)) = Standard_Standard | |
2919 | then | |
2920 | declare | |
2921 | T : constant Entity_Id := | |
2922 | Base_Type (Etype (First_Formal (New_S))); | |
996ae0b0 RK |
2923 | begin |
2924 | Error_Msg_Node_2 := Prefix (Nam); | |
fbf5a39b AC |
2925 | Error_Msg_NE |
2926 | ("operator for type& is not declared in&", Prefix (Nam), T); | |
996ae0b0 | 2927 | end; |
fbf5a39b | 2928 | |
996ae0b0 RK |
2929 | else |
2930 | Error_Msg_NE | |
2931 | ("no visible subprogram matches the specification for&", | |
2932 | Spec, New_S); | |
2933 | end if; | |
2934 | ||
2935 | if Present (Candidate_Renaming) then | |
2936 | declare | |
2937 | F1 : Entity_Id; | |
2938 | F2 : Entity_Id; | |
70b70ce8 | 2939 | T1 : Entity_Id; |
996ae0b0 RK |
2940 | |
2941 | begin | |
2942 | F1 := First_Formal (Candidate_Renaming); | |
2943 | F2 := First_Formal (New_S); | |
70b70ce8 | 2944 | T1 := First_Subtype (Etype (F1)); |
996ae0b0 RK |
2945 | while Present (F1) and then Present (F2) loop |
2946 | Next_Formal (F1); | |
2947 | Next_Formal (F2); | |
2948 | end loop; | |
2949 | ||
2950 | if Present (F1) and then Present (Default_Value (F1)) then | |
2951 | if Present (Next_Formal (F1)) then | |
2952 | Error_Msg_NE | |
2953 | ("\missing specification for &" & | |
2954 | " and other formals with defaults", Spec, F1); | |
2955 | else | |
2956 | Error_Msg_NE | |
2957 | ("\missing specification for &", Spec, F1); | |
2958 | end if; | |
2959 | end if; | |
70b70ce8 AC |
2960 | |
2961 | if Nkind (Nam) = N_Operator_Symbol | |
2962 | and then From_Default (N) | |
2963 | then | |
2964 | Error_Msg_Node_2 := T1; | |
2965 | Error_Msg_NE | |
2966 | ("default & on & is not directly visible", | |
2967 | Nam, Nam); | |
2968 | end if; | |
996ae0b0 RK |
2969 | end; |
2970 | end if; | |
2971 | end if; | |
2972 | ||
edd63e9b ES |
2973 | -- Ada 2005 AI 404: if the new subprogram is dispatching, verify that |
2974 | -- controlling access parameters are known non-null for the renamed | |
2975 | -- subprogram. Test also applies to a subprogram instantiation that | |
cdc8c54c BD |
2976 | -- is dispatching. Test is skipped if some previous error was detected |
2977 | -- that set Old_S to Any_Id. | |
edd63e9b | 2978 | |
0791fbe9 | 2979 | if Ada_Version >= Ada_2005 |
cdc8c54c | 2980 | and then Old_S /= Any_Id |
edd63e9b ES |
2981 | and then not Is_Dispatching_Operation (Old_S) |
2982 | and then Is_Dispatching_Operation (New_S) | |
2983 | then | |
2984 | declare | |
2985 | Old_F : Entity_Id; | |
2986 | New_F : Entity_Id; | |
2987 | ||
2988 | begin | |
2989 | Old_F := First_Formal (Old_S); | |
2990 | New_F := First_Formal (New_S); | |
2991 | while Present (Old_F) loop | |
2992 | if Ekind (Etype (Old_F)) = E_Anonymous_Access_Type | |
2993 | and then Is_Controlling_Formal (New_F) | |
2994 | and then not Can_Never_Be_Null (Old_F) | |
2995 | then | |
2996 | Error_Msg_N ("access parameter is controlling,", New_F); | |
fbe627af RD |
2997 | Error_Msg_NE |
2998 | ("\corresponding parameter of& " | |
2999 | & "must be explicitly null excluding", New_F, Old_S); | |
edd63e9b ES |
3000 | end if; |
3001 | ||
3002 | Next_Formal (Old_F); | |
3003 | Next_Formal (New_F); | |
3004 | end loop; | |
3005 | end; | |
3006 | end if; | |
3007 | ||
725393ea | 3008 | -- A useful warning, suggested by Ada Bug Finder (Ada-Europe 2005) |
b5c739f9 | 3009 | -- is to warn if an operator is being renamed as a different operator. |
880dabb5 AC |
3010 | -- If the operator is predefined, examine the kind of the entity, not |
3011 | -- the abbreviated declaration in Standard. | |
725393ea ES |
3012 | |
3013 | if Comes_From_Source (N) | |
3014 | and then Present (Old_S) | |
ac7d724d ES |
3015 | and then (Nkind (Old_S) = N_Defining_Operator_Symbol |
3016 | or else Ekind (Old_S) = E_Operator) | |
725393ea ES |
3017 | and then Nkind (New_S) = N_Defining_Operator_Symbol |
3018 | and then Chars (Old_S) /= Chars (New_S) | |
3019 | then | |
3020 | Error_Msg_NE | |
dbfeb4fa | 3021 | ("& is being renamed as a different operator??", N, Old_S); |
725393ea ES |
3022 | end if; |
3023 | ||
b5c739f9 RD |
3024 | -- Check for renaming of obsolescent subprogram |
3025 | ||
3026 | Check_Obsolescent_2005_Entity (Entity (Nam), Nam); | |
3027 | ||
11560bcc TQ |
3028 | -- Another warning or some utility: if the new subprogram as the same |
3029 | -- name as the old one, the old one is not hidden by an outer homograph, | |
3030 | -- the new one is not a public symbol, and the old one is otherwise | |
3031 | -- directly visible, the renaming is superfluous. | |
3032 | ||
3033 | if Chars (Old_S) = Chars (New_S) | |
3034 | and then Comes_From_Source (N) | |
3035 | and then Scope (Old_S) /= Standard_Standard | |
3036 | and then Warn_On_Redundant_Constructs | |
ac7d724d ES |
3037 | and then (Is_Immediately_Visible (Old_S) |
3038 | or else Is_Potentially_Use_Visible (Old_S)) | |
11560bcc TQ |
3039 | and then Is_Overloadable (Current_Scope) |
3040 | and then Chars (Current_Scope) /= Chars (Old_S) | |
3041 | then | |
3042 | Error_Msg_N | |
dbfeb4fa | 3043 | ("redundant renaming, entity is directly visible?r?", Name (N)); |
11560bcc TQ |
3044 | end if; |
3045 | ||
ef992452 | 3046 | -- Implementation-defined aspect specifications can appear in a renaming |
cc96a1b8 AC |
3047 | -- declaration, but not language-defined ones. The call to procedure |
3048 | -- Analyze_Aspect_Specifications will take care of this error check. | |
ef992452 AC |
3049 | |
3050 | if Has_Aspects (N) then | |
3051 | Analyze_Aspect_Specifications (N, New_S); | |
3052 | end if; | |
3053 | ||
0ab80019 | 3054 | Ada_Version := Save_AV; |
fb620b37 | 3055 | Ada_Version_Pragma := Save_AVP; |
edd63e9b | 3056 | Ada_Version_Explicit := Save_AV_Exp; |
996ae0b0 RK |
3057 | end Analyze_Subprogram_Renaming; |
3058 | ||
3059 | ------------------------- | |
3060 | -- Analyze_Use_Package -- | |
3061 | ------------------------- | |
3062 | ||
3063 | -- Resolve the package names in the use clause, and make all the visible | |
3064 | -- entities defined in the package potentially use-visible. If the package | |
3065 | -- is already in use from a previous use clause, its visible entities are | |
3066 | -- already use-visible. In that case, mark the occurrence as a redundant | |
3067 | -- use. If the package is an open scope, i.e. if the use clause occurs | |
3068 | -- within the package itself, ignore it. | |
3069 | ||
3070 | procedure Analyze_Use_Package (N : Node_Id) is | |
3071 | Pack_Name : Node_Id; | |
3072 | Pack : Entity_Id; | |
3073 | ||
996ae0b0 RK |
3074 | -- Start of processing for Analyze_Use_Package |
3075 | ||
3076 | begin | |
2ba431e5 | 3077 | Check_SPARK_Restriction ("use clause is not allowed", N); |
1d801f21 | 3078 | |
996ae0b0 RK |
3079 | Set_Hidden_By_Use_Clause (N, No_Elist); |
3080 | ||
7394c8cc AC |
3081 | -- Use clause not allowed in a spec of a predefined package declaration |
3082 | -- except that packages whose file name starts a-n are OK (these are | |
3083 | -- children of Ada.Numerics, which are never loaded by Rtsfind). | |
996ae0b0 RK |
3084 | |
3085 | if Is_Predefined_File_Name (Unit_File_Name (Current_Sem_Unit)) | |
3086 | and then Name_Buffer (1 .. 3) /= "a-n" | |
3087 | and then | |
3088 | Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Declaration | |
3089 | then | |
3090 | Error_Msg_N ("use clause not allowed in predefined spec", N); | |
3091 | end if; | |
3092 | ||
bc41faa2 | 3093 | -- Chain clause to list of use clauses in current scope |
996ae0b0 RK |
3094 | |
3095 | if Nkind (Parent (N)) /= N_Compilation_Unit then | |
3096 | Chain_Use_Clause (N); | |
3097 | end if; | |
3098 | ||
3099 | -- Loop through package names to identify referenced packages | |
3100 | ||
3101 | Pack_Name := First (Names (N)); | |
996ae0b0 RK |
3102 | while Present (Pack_Name) loop |
3103 | Analyze (Pack_Name); | |
3104 | ||
3105 | if Nkind (Parent (N)) = N_Compilation_Unit | |
3106 | and then Nkind (Pack_Name) = N_Expanded_Name | |
3107 | then | |
3108 | declare | |
16ca248a | 3109 | Pref : Node_Id; |
996ae0b0 RK |
3110 | |
3111 | begin | |
16ca248a | 3112 | Pref := Prefix (Pack_Name); |
996ae0b0 RK |
3113 | while Nkind (Pref) = N_Expanded_Name loop |
3114 | Pref := Prefix (Pref); | |
3115 | end loop; | |
3116 | ||
3117 | if Entity (Pref) = Standard_Standard then | |
3118 | Error_Msg_N | |
3119 | ("predefined package Standard cannot appear" | |
3120 | & " in a context clause", Pref); | |
3121 | end if; | |
3122 | end; | |
3123 | end if; | |
3124 | ||
3125 | Next (Pack_Name); | |
3126 | end loop; | |
3127 | ||
3128 | -- Loop through package names to mark all entities as potentially | |
3129 | -- use visible. | |
3130 | ||
3131 | Pack_Name := First (Names (N)); | |
996ae0b0 | 3132 | while Present (Pack_Name) loop |
996ae0b0 RK |
3133 | if Is_Entity_Name (Pack_Name) then |
3134 | Pack := Entity (Pack_Name); | |
3135 | ||
ac7d724d | 3136 | if Ekind (Pack) /= E_Package and then Etype (Pack) /= Any_Type then |
996ae0b0 | 3137 | if Ekind (Pack) = E_Generic_Package then |
483c78cb | 3138 | Error_Msg_N -- CODEFIX |
996ae0b0 RK |
3139 | ("a generic package is not allowed in a use clause", |
3140 | Pack_Name); | |
3141 | else | |
ed2233dc | 3142 | Error_Msg_N ("& is not a usable package", Pack_Name); |
996ae0b0 RK |
3143 | end if; |
3144 | ||
fbf5a39b AC |
3145 | else |
3146 | if Nkind (Parent (N)) = N_Compilation_Unit then | |
3147 | Check_In_Previous_With_Clause (N, Pack_Name); | |
3148 | end if; | |
996ae0b0 | 3149 | |
fbf5a39b AC |
3150 | if Applicable_Use (Pack_Name) then |
3151 | Use_One_Package (Pack, N); | |
3152 | end if; | |
996ae0b0 | 3153 | end if; |
462c31ef ST |
3154 | |
3155 | -- Report error because name denotes something other than a package | |
3156 | ||
3157 | else | |
3158 | Error_Msg_N ("& is not a package", Pack_Name); | |
996ae0b0 RK |
3159 | end if; |
3160 | ||
3161 | Next (Pack_Name); | |
3162 | end loop; | |
996ae0b0 RK |
3163 | end Analyze_Use_Package; |
3164 | ||
3165 | ---------------------- | |
3166 | -- Analyze_Use_Type -- | |
3167 | ---------------------- | |
3168 | ||
3169 | procedure Analyze_Use_Type (N : Node_Id) is | |
954c111a | 3170 | E : Entity_Id; |
ecc4ddde | 3171 | Id : Node_Id; |
996ae0b0 RK |
3172 | |
3173 | begin | |
3174 | Set_Hidden_By_Use_Clause (N, No_Elist); | |
3175 | ||
bc41faa2 | 3176 | -- Chain clause to list of use clauses in current scope |
996ae0b0 RK |
3177 | |
3178 | if Nkind (Parent (N)) /= N_Compilation_Unit then | |
3179 | Chain_Use_Clause (N); | |
3180 | end if; | |
3181 | ||
780d052e RD |
3182 | -- If the Used_Operations list is already initialized, the clause has |
3183 | -- been analyzed previously, and it is begin reinstalled, for example | |
3184 | -- when the clause appears in a package spec and we are compiling the | |
3185 | -- corresponding package body. In that case, make the entities on the | |
806f6d37 | 3186 | -- existing list use_visible, and mark the corresponding types In_Use. |
29efbb8c | 3187 | |
780d052e | 3188 | if Present (Used_Operations (N)) then |
29efbb8c | 3189 | declare |
806f6d37 | 3190 | Mark : Node_Id; |
29efbb8c | 3191 | Elmt : Elmt_Id; |
806f6d37 | 3192 | |
29efbb8c | 3193 | begin |
806f6d37 AC |
3194 | Mark := First (Subtype_Marks (N)); |
3195 | while Present (Mark) loop | |
7ff2d234 | 3196 | Use_One_Type (Mark, Installed => True); |
806f6d37 AC |
3197 | Next (Mark); |
3198 | end loop; | |
3199 | ||
29efbb8c ES |
3200 | Elmt := First_Elmt (Used_Operations (N)); |
3201 | while Present (Elmt) loop | |
3202 | Set_Is_Potentially_Use_Visible (Node (Elmt)); | |
3203 | Next_Elmt (Elmt); | |
3204 | end loop; | |
3205 | end; | |
3206 | ||
3207 | return; | |
3208 | end if; | |
3209 | ||
780d052e RD |
3210 | -- Otherwise, create new list and attach to it the operations that |
3211 | -- are made use-visible by the clause. | |
3212 | ||
29efbb8c | 3213 | Set_Used_Operations (N, New_Elmt_List); |
996ae0b0 | 3214 | Id := First (Subtype_Marks (N)); |
996ae0b0 RK |
3215 | while Present (Id) loop |
3216 | Find_Type (Id); | |
954c111a | 3217 | E := Entity (Id); |
996ae0b0 | 3218 | |
954c111a | 3219 | if E /= Any_Type then |
07fc65c4 | 3220 | Use_One_Type (Id); |
fbf5a39b AC |
3221 | |
3222 | if Nkind (Parent (N)) = N_Compilation_Unit then | |
923fa078 | 3223 | if Nkind (Id) = N_Identifier then |
edd63e9b | 3224 | Error_Msg_N ("type is not directly visible", Id); |
fbf5a39b | 3225 | |
954c111a HK |
3226 | elsif Is_Child_Unit (Scope (E)) |
3227 | and then Scope (E) /= System_Aux_Id | |
fbf5a39b AC |
3228 | then |
3229 | Check_In_Previous_With_Clause (N, Prefix (Id)); | |
3230 | end if; | |
3231 | end if; | |
ecc4ddde AC |
3232 | |
3233 | else | |
4c8a5bb8 | 3234 | -- If the use_type_clause appears in a compilation unit context, |
ecc4ddde | 3235 | -- check whether it comes from a unit that may appear in a |
4c8a5bb8 | 3236 | -- limited_with_clause, for a better error message. |
ecc4ddde AC |
3237 | |
3238 | if Nkind (Parent (N)) = N_Compilation_Unit | |
3239 | and then Nkind (Id) /= N_Identifier | |
3240 | then | |
3241 | declare | |
3242 | Item : Node_Id; | |
3243 | Pref : Node_Id; | |
3244 | ||
3245 | function Mentioned (Nam : Node_Id) return Boolean; | |
4c8a5bb8 AC |
3246 | -- Check whether the prefix of expanded name for the type |
3247 | -- appears in the prefix of some limited_with_clause. | |
3248 | ||
3249 | --------------- | |
3250 | -- Mentioned -- | |
3251 | --------------- | |
ecc4ddde AC |
3252 | |
3253 | function Mentioned (Nam : Node_Id) return Boolean is | |
3254 | begin | |
4c8a5bb8 | 3255 | return Nkind (Name (Item)) = N_Selected_Component |
ac7d724d | 3256 | and then Chars (Prefix (Name (Item))) = Chars (Nam); |
ecc4ddde AC |
3257 | end Mentioned; |
3258 | ||
3259 | begin | |
3260 | Pref := Prefix (Id); | |
3261 | Item := First (Context_Items (Parent (N))); | |
4c8a5bb8 | 3262 | while Present (Item) and then Item /= N loop |
ecc4ddde AC |
3263 | if Nkind (Item) = N_With_Clause |
3264 | and then Limited_Present (Item) | |
3265 | and then Mentioned (Pref) | |
3266 | then | |
4c8a5bb8 AC |
3267 | Change_Error_Text |
3268 | (Get_Msg_Id, "premature usage of incomplete type"); | |
ecc4ddde AC |
3269 | end if; |
3270 | ||
3271 | Next (Item); | |
3272 | end loop; | |
3273 | end; | |
3274 | end if; | |
996ae0b0 RK |
3275 | end if; |
3276 | ||
3277 | Next (Id); | |
3278 | end loop; | |
3279 | end Analyze_Use_Type; | |
3280 | ||
3281 | -------------------- | |
3282 | -- Applicable_Use -- | |
3283 | -------------------- | |
3284 | ||
3285 | function Applicable_Use (Pack_Name : Node_Id) return Boolean is | |
3286 | Pack : constant Entity_Id := Entity (Pack_Name); | |
3287 | ||
3288 | begin | |
3289 | if In_Open_Scopes (Pack) then | |
ac7d724d | 3290 | if Warn_On_Redundant_Constructs and then Pack = Current_Scope then |
ed2233dc | 3291 | Error_Msg_NE -- CODEFIX |
dbfeb4fa | 3292 | ("& is already use-visible within itself?r?", Pack_Name, Pack); |
954c111a HK |
3293 | end if; |
3294 | ||
996ae0b0 RK |
3295 | return False; |
3296 | ||
3297 | elsif In_Use (Pack) then | |
d4810530 | 3298 | Note_Redundant_Use (Pack_Name); |
996ae0b0 RK |
3299 | return False; |
3300 | ||
3301 | elsif Present (Renamed_Object (Pack)) | |
3302 | and then In_Use (Renamed_Object (Pack)) | |
3303 | then | |
d4810530 | 3304 | Note_Redundant_Use (Pack_Name); |
996ae0b0 RK |
3305 | return False; |
3306 | ||
3307 | else | |
3308 | return True; | |
3309 | end if; | |
3310 | end Applicable_Use; | |
3311 | ||
3312 | ------------------------ | |
3313 | -- Attribute_Renaming -- | |
3314 | ------------------------ | |
3315 | ||
3316 | procedure Attribute_Renaming (N : Node_Id) is | |
8d80ff64 AC |
3317 | Loc : constant Source_Ptr := Sloc (N); |
3318 | Nam : constant Node_Id := Name (N); | |
3319 | Spec : constant Node_Id := Specification (N); | |
3320 | New_S : constant Entity_Id := Defining_Unit_Name (Spec); | |
3321 | Aname : constant Name_Id := Attribute_Name (Nam); | |
996ae0b0 | 3322 | |
8d80ff64 AC |
3323 | Form_Num : Nat := 0; |
3324 | Expr_List : List_Id := No_List; | |
996ae0b0 RK |
3325 | |
3326 | Attr_Node : Node_Id; | |
3327 | Body_Node : Node_Id; | |
3328 | Param_Spec : Node_Id; | |
3329 | ||
3330 | begin | |
3331 | Generate_Definition (New_S); | |
3332 | ||
4c8a5bb8 AC |
3333 | -- This procedure is called in the context of subprogram renaming, and |
3334 | -- thus the attribute must be one that is a subprogram. All of those | |
a530b8bb AC |
3335 | -- have at least one formal parameter, with the exceptions of AST_Entry |
3336 | -- (which is a real oddity, it is odd that this can be renamed at all!) | |
3337 | -- and the GNAT attribute 'Img, which GNAT treats as renameable. | |
996ae0b0 RK |
3338 | |
3339 | if not Is_Non_Empty_List (Parameter_Specifications (Spec)) then | |
8d80ff64 | 3340 | if Aname /= Name_AST_Entry and then Aname /= Name_Img then |
996ae0b0 RK |
3341 | Error_Msg_N |
3342 | ("subprogram renaming an attribute must have formals", N); | |
3343 | return; | |
3344 | end if; | |
3345 | ||
3346 | else | |
3347 | Param_Spec := First (Parameter_Specifications (Spec)); | |
996ae0b0 RK |
3348 | while Present (Param_Spec) loop |
3349 | Form_Num := Form_Num + 1; | |
3350 | ||
3351 | if Nkind (Parameter_Type (Param_Spec)) /= N_Access_Definition then | |
3352 | Find_Type (Parameter_Type (Param_Spec)); | |
3353 | ||
3354 | -- The profile of the new entity denotes the base type (s) of | |
3355 | -- the types given in the specification. For access parameters | |
3356 | -- there are no subtypes involved. | |
3357 | ||
3358 | Rewrite (Parameter_Type (Param_Spec), | |
8d80ff64 AC |
3359 | New_Reference_To |
3360 | (Base_Type (Entity (Parameter_Type (Param_Spec))), Loc)); | |
996ae0b0 RK |
3361 | end if; |
3362 | ||
3363 | if No (Expr_List) then | |
3364 | Expr_List := New_List; | |
3365 | end if; | |
3366 | ||
3367 | Append_To (Expr_List, | |
3368 | Make_Identifier (Loc, | |
3369 | Chars => Chars (Defining_Identifier (Param_Spec)))); | |
3370 | ||
fbf5a39b | 3371 | -- The expressions in the attribute reference are not freeze |
4c8a5bb8 | 3372 | -- points. Neither is the attribute as a whole, see below. |
fbf5a39b AC |
3373 | |
3374 | Set_Must_Not_Freeze (Last (Expr_List)); | |
996ae0b0 RK |
3375 | Next (Param_Spec); |
3376 | end loop; | |
3377 | end if; | |
3378 | ||
4c8a5bb8 AC |
3379 | -- Immediate error if too many formals. Other mismatches in number or |
3380 | -- types of parameters are detected when we analyze the body of the | |
3381 | -- subprogram that we construct. | |
996ae0b0 RK |
3382 | |
3383 | if Form_Num > 2 then | |
3384 | Error_Msg_N ("too many formals for attribute", N); | |
3385 | ||
4c8a5bb8 AC |
3386 | -- Error if the attribute reference has expressions that look like |
3387 | -- formal parameters. | |
0da2c8ac AC |
3388 | |
3389 | elsif Present (Expressions (Nam)) then | |
3390 | Error_Msg_N ("illegal expressions in attribute reference", Nam); | |
3391 | ||
996ae0b0 | 3392 | elsif |
b69cd36a AC |
3393 | Nam_In (Aname, Name_Compose, Name_Exponent, Name_Leading_Part, |
3394 | Name_Pos, Name_Round, Name_Scaling, | |
3395 | Name_Val) | |
996ae0b0 RK |
3396 | then |
3397 | if Nkind (N) = N_Subprogram_Renaming_Declaration | |
82c80734 | 3398 | and then Present (Corresponding_Formal_Spec (N)) |
996ae0b0 RK |
3399 | then |
3400 | Error_Msg_N | |
3401 | ("generic actual cannot be attribute involving universal type", | |
3402 | Nam); | |
3403 | else | |
3404 | Error_Msg_N | |
3405 | ("attribute involving a universal type cannot be renamed", | |
3406 | Nam); | |
3407 | end if; | |
3408 | end if; | |
3409 | ||
4c8a5bb8 AC |
3410 | -- AST_Entry is an odd case. It doesn't really make much sense to allow |
3411 | -- it to be renamed, but that's the DEC rule, so we have to do it right. | |
3412 | -- The point is that the AST_Entry call should be made now, and what the | |
3413 | -- function will return is the returned value. | |
996ae0b0 RK |
3414 | |
3415 | -- Note that there is no Expr_List in this case anyway | |
3416 | ||
3417 | if Aname = Name_AST_Entry then | |
996ae0b0 | 3418 | declare |
092ef350 | 3419 | Ent : constant Entity_Id := Make_Temporary (Loc, 'R', Nam); |
996ae0b0 RK |
3420 | Decl : Node_Id; |
3421 | ||
3422 | begin | |
996ae0b0 RK |
3423 | Decl := |
3424 | Make_Object_Declaration (Loc, | |
3425 | Defining_Identifier => Ent, | |
092ef350 | 3426 | Object_Definition => |
996ae0b0 | 3427 | New_Occurrence_Of (RTE (RE_AST_Handler), Loc), |
092ef350 RD |
3428 | Expression => Nam, |
3429 | Constant_Present => True); | |
996ae0b0 RK |
3430 | |
3431 | Set_Assignment_OK (Decl, True); | |
3432 | Insert_Action (N, Decl); | |
3433 | Attr_Node := Make_Identifier (Loc, Chars (Ent)); | |
3434 | end; | |
3435 | ||
3436 | -- For all other attributes, we rewrite the attribute node to have | |
3437 | -- a list of expressions corresponding to the subprogram formals. | |
3438 | -- A renaming declaration is not a freeze point, and the analysis of | |
3439 | -- the attribute reference should not freeze the type of the prefix. | |
3440 | ||
3441 | else | |
3442 | Attr_Node := | |
3443 | Make_Attribute_Reference (Loc, | |
3444 | Prefix => Prefix (Nam), | |
3445 | Attribute_Name => Aname, | |
3446 | Expressions => Expr_List); | |
3447 | ||
3448 | Set_Must_Not_Freeze (Attr_Node); | |
3449 | Set_Must_Not_Freeze (Prefix (Nam)); | |
3450 | end if; | |
3451 | ||
3452 | -- Case of renaming a function | |
3453 | ||
3454 | if Nkind (Spec) = N_Function_Specification then | |
996ae0b0 RK |
3455 | if Is_Procedure_Attribute_Name (Aname) then |
3456 | Error_Msg_N ("attribute can only be renamed as procedure", Nam); | |
3457 | return; | |
3458 | end if; | |
3459 | ||
725393ea ES |
3460 | Find_Type (Result_Definition (Spec)); |
3461 | Rewrite (Result_Definition (Spec), | |
3462 | New_Reference_To ( | |
3463 | Base_Type (Entity (Result_Definition (Spec))), Loc)); | |
996ae0b0 RK |
3464 | |
3465 | Body_Node := | |
3466 | Make_Subprogram_Body (Loc, | |
3467 | Specification => Spec, | |
3468 | Declarations => New_List, | |
3469 | Handled_Statement_Sequence => | |
3470 | Make_Handled_Sequence_Of_Statements (Loc, | |
3471 | Statements => New_List ( | |
11560bcc | 3472 | Make_Simple_Return_Statement (Loc, |
996ae0b0 RK |
3473 | Expression => Attr_Node)))); |
3474 | ||
3475 | -- Case of renaming a procedure | |
3476 | ||
3477 | else | |
3478 | if not Is_Procedure_Attribute_Name (Aname) then | |
3479 | Error_Msg_N ("attribute can only be renamed as function", Nam); | |
3480 | return; | |
3481 | end if; | |
3482 | ||
3483 | Body_Node := | |
3484 | Make_Subprogram_Body (Loc, | |
3485 | Specification => Spec, | |
3486 | Declarations => New_List, | |
3487 | Handled_Statement_Sequence => | |
3488 | Make_Handled_Sequence_Of_Statements (Loc, | |
3489 | Statements => New_List (Attr_Node))); | |
3490 | end if; | |
3491 | ||
fbe627af RD |
3492 | -- In case of tagged types we add the body of the generated function to |
3493 | -- the freezing actions of the type (because in the general case such | |
3494 | -- type is still not frozen). We exclude from this processing generic | |
3495 | -- formal subprograms found in instantiations and AST_Entry renamings. | |
3496 | ||
6b81741c AC |
3497 | -- We must exclude VM targets and restricted run-time libraries because |
3498 | -- entity AST_Handler is defined in package System.Aux_Dec which is not | |
9d1e0e72 JR |
3499 | -- available in those platforms. Note that we cannot use the function |
3500 | -- Restricted_Profile (instead of Configurable_Run_Time_Mode) because | |
3501 | -- the ZFP run-time library is not defined as a profile, and we do not | |
3502 | -- want to deal with AST_Handler in ZFP mode. | |
ddc1515a AC |
3503 | |
3504 | if VM_Target = No_VM | |
9d1e0e72 | 3505 | and then not Configurable_Run_Time_Mode |
ddc1515a | 3506 | and then not Present (Corresponding_Formal_Spec (N)) |
fbe627af RD |
3507 | and then Etype (Nam) /= RTE (RE_AST_Handler) |
3508 | then | |
3509 | declare | |
a530b8bb | 3510 | P : constant Node_Id := Prefix (Nam); |
fbe627af RD |
3511 | |
3512 | begin | |
8d80ff64 AC |
3513 | -- The prefix of 'Img is an object that is evaluated for each call |
3514 | -- of the function that renames it. | |
a530b8bb AC |
3515 | |
3516 | if Aname = Name_Img then | |
3517 | Preanalyze_And_Resolve (P); | |
3518 | ||
8d80ff64 | 3519 | -- For all other attribute renamings, the prefix is a subtype |
a530b8bb AC |
3520 | |
3521 | else | |
3522 | Find_Type (P); | |
3523 | end if; | |
fbe627af RD |
3524 | |
3525 | if Is_Tagged_Type (Etype (P)) then | |
3526 | Ensure_Freeze_Node (Etype (P)); | |
3527 | Append_Freeze_Action (Etype (P), Body_Node); | |
3528 | else | |
3529 | Rewrite (N, Body_Node); | |
3530 | Analyze (N); | |
3531 | Set_Etype (New_S, Base_Type (Etype (New_S))); | |
3532 | end if; | |
3533 | end; | |
3534 | ||
3535 | -- Generic formal subprograms or AST_Handler renaming | |
3536 | ||
3537 | else | |
3538 | Rewrite (N, Body_Node); | |
3539 | Analyze (N); | |
3540 | Set_Etype (New_S, Base_Type (Etype (New_S))); | |
3541 | end if; | |
996ae0b0 | 3542 | |
615cbd95 AC |
3543 | if Is_Compilation_Unit (New_S) then |
3544 | Error_Msg_N | |
3545 | ("a library unit can only rename another library unit", N); | |
3546 | end if; | |
3547 | ||
996ae0b0 RK |
3548 | -- We suppress elaboration warnings for the resulting entity, since |
3549 | -- clearly they are not needed, and more particularly, in the case | |
3550 | -- of a generic formal subprogram, the resulting entity can appear | |
3551 | -- after the instantiation itself, and thus look like a bogus case | |
3552 | -- of access before elaboration. | |
3553 | ||
3554 | Set_Suppress_Elaboration_Warnings (New_S); | |
3555 | ||
3556 | end Attribute_Renaming; | |
3557 | ||
3558 | ---------------------- | |
3559 | -- Chain_Use_Clause -- | |
3560 | ---------------------- | |
3561 | ||
3562 | procedure Chain_Use_Clause (N : Node_Id) is | |
d4810530 ES |
3563 | Pack : Entity_Id; |
3564 | Level : Int := Scope_Stack.Last; | |
3565 | ||
996ae0b0 | 3566 | begin |
d4810530 ES |
3567 | if not Is_Compilation_Unit (Current_Scope) |
3568 | or else not Is_Child_Unit (Current_Scope) | |
3569 | then | |
3570 | null; -- Common case | |
3571 | ||
3572 | elsif Defining_Entity (Parent (N)) = Current_Scope then | |
3573 | null; -- Common case for compilation unit | |
3574 | ||
3575 | else | |
3576 | -- If declaration appears in some other scope, it must be in some | |
3577 | -- parent unit when compiling a child. | |
3578 | ||
3579 | Pack := Defining_Entity (Parent (N)); | |
3580 | if not In_Open_Scopes (Pack) then | |
3581 | null; -- default as well | |
3582 | ||
3583 | else | |
3584 | -- Find entry for parent unit in scope stack | |
3585 | ||
3586 | while Scope_Stack.Table (Level).Entity /= Pack loop | |
3587 | Level := Level - 1; | |
3588 | end loop; | |
3589 | end if; | |
3590 | end if; | |
3591 | ||
996ae0b0 | 3592 | Set_Next_Use_Clause (N, |
d4810530 ES |
3593 | Scope_Stack.Table (Level).First_Use_Clause); |
3594 | Scope_Stack.Table (Level).First_Use_Clause := N; | |
996ae0b0 RK |
3595 | end Chain_Use_Clause; |
3596 | ||
15ce9ca2 AC |
3597 | --------------------------- |
3598 | -- Check_Frozen_Renaming -- | |
3599 | --------------------------- | |
996ae0b0 RK |
3600 | |
3601 | procedure Check_Frozen_Renaming (N : Node_Id; Subp : Entity_Id) is | |
3602 | B_Node : Node_Id; | |
3603 | Old_S : Entity_Id; | |
3604 | ||
3605 | begin | |
ac7d724d | 3606 | if Is_Frozen (Subp) and then not Has_Completion (Subp) then |
996ae0b0 RK |
3607 | B_Node := |
3608 | Build_Renamed_Body | |
3609 | (Parent (Declaration_Node (Subp)), Defining_Entity (N)); | |
3610 | ||
3611 | if Is_Entity_Name (Name (N)) then | |
3612 | Old_S := Entity (Name (N)); | |
3613 | ||
fbf5a39b AC |
3614 | if not Is_Frozen (Old_S) |
3615 | and then Operating_Mode /= Check_Semantics | |
3616 | then | |
3617 | Append_Freeze_Action (Old_S, B_Node); | |
996ae0b0 RK |
3618 | else |
3619 | Insert_After (N, B_Node); | |
3620 | Analyze (B_Node); | |
3621 | end if; | |
3622 | ||
ac7d724d | 3623 | if Is_Intrinsic_Subprogram (Old_S) and then not In_Instance then |
996ae0b0 RK |
3624 | Error_Msg_N |
3625 | ("subprogram used in renaming_as_body cannot be intrinsic", | |
ac7d724d | 3626 | Name (N)); |
996ae0b0 RK |
3627 | end if; |
3628 | ||
3629 | else | |
3630 | Insert_After (N, B_Node); | |
3631 | Analyze (B_Node); | |
3632 | end if; | |
3633 | end if; | |
3634 | end Check_Frozen_Renaming; | |
3635 | ||
4c484f40 AC |
3636 | ------------------------------- |
3637 | -- Set_Entity_Or_Discriminal -- | |
3638 | ------------------------------- | |
3639 | ||
3640 | procedure Set_Entity_Or_Discriminal (N : Node_Id; E : Entity_Id) is | |
3641 | P : Node_Id; | |
3642 | ||
3643 | begin | |
3644 | -- If the entity is not a discriminant, or else expansion is disabled, | |
3645 | -- simply set the entity. | |
3646 | ||
3647 | if not In_Spec_Expression | |
3648 | or else Ekind (E) /= E_Discriminant | |
3649 | or else Inside_A_Generic | |
3650 | then | |
3651 | Set_Entity_With_Style_Check (N, E); | |
3652 | ||
3653 | -- The replacement of a discriminant by the corresponding discriminal | |
3654 | -- is not done for a task discriminant that appears in a default | |
8779dffa | 3655 | -- expression of an entry parameter. See Exp_Ch2.Expand_Discriminant |
4c484f40 AC |
3656 | -- for details on their handling. |
3657 | ||
3658 | elsif Is_Concurrent_Type (Scope (E)) then | |
4c484f40 AC |
3659 | P := Parent (N); |
3660 | while Present (P) | |
3661 | and then not Nkind_In (P, N_Parameter_Specification, | |
ac7d724d | 3662 | N_Component_Declaration) |
4c484f40 AC |
3663 | loop |
3664 | P := Parent (P); | |
3665 | end loop; | |
3666 | ||
3667 | if Present (P) | |
3668 | and then Nkind (P) = N_Parameter_Specification | |
3669 | then | |
3670 | null; | |
3671 | ||
3672 | else | |
3673 | Set_Entity (N, Discriminal (E)); | |
3674 | end if; | |
3675 | ||
3676 | -- Otherwise, this is a discriminant in a context in which | |
3677 | -- it is a reference to the corresponding parameter of the | |
3678 | -- init proc for the enclosing type. | |
3679 | ||
3680 | else | |
3681 | Set_Entity (N, Discriminal (E)); | |
3682 | end if; | |
3683 | end Set_Entity_Or_Discriminal; | |
3684 | ||
fbf5a39b AC |
3685 | ----------------------------------- |
3686 | -- Check_In_Previous_With_Clause -- | |
3687 | ----------------------------------- | |
3688 | ||
3689 | procedure Check_In_Previous_With_Clause | |
3690 | (N : Node_Id; | |
3691 | Nam : Entity_Id) | |
3692 | is | |
3693 | Pack : constant Entity_Id := Entity (Original_Node (Nam)); | |
3694 | Item : Node_Id; | |
3695 | Par : Node_Id; | |
3696 | ||
3697 | begin | |
3698 | Item := First (Context_Items (Parent (N))); | |
ac7d724d | 3699 | while Present (Item) and then Item /= N loop |
fbf5a39b | 3700 | if Nkind (Item) = N_With_Clause |
edd63e9b | 3701 | |
ac7d724d | 3702 | -- Protect the frontend against previous critical errors |
edd63e9b ES |
3703 | |
3704 | and then Nkind (Name (Item)) /= N_Selected_Component | |
fbf5a39b AC |
3705 | and then Entity (Name (Item)) = Pack |
3706 | then | |
3707 | Par := Nam; | |
3708 | ||
bc41faa2 | 3709 | -- Find root library unit in with_clause |
fbf5a39b AC |
3710 | |
3711 | while Nkind (Par) = N_Expanded_Name loop | |
3712 | Par := Prefix (Par); | |
3713 | end loop; | |
3714 | ||
3715 | if Is_Child_Unit (Entity (Original_Node (Par))) then | |
ed2233dc | 3716 | Error_Msg_NE ("& is not directly visible", Par, Entity (Par)); |
fbf5a39b AC |
3717 | else |
3718 | return; | |
3719 | end if; | |
3720 | end if; | |
3721 | ||
3722 | Next (Item); | |
3723 | end loop; | |
3724 | ||
3725 | -- On exit, package is not mentioned in a previous with_clause. | |
3726 | -- Check if its prefix is. | |
3727 | ||
3728 | if Nkind (Nam) = N_Expanded_Name then | |
3729 | Check_In_Previous_With_Clause (N, Prefix (Nam)); | |
3730 | ||
3731 | elsif Pack /= Any_Id then | |
3732 | Error_Msg_NE ("& is not visible", Nam, Pack); | |
3733 | end if; | |
3734 | end Check_In_Previous_With_Clause; | |
3735 | ||
996ae0b0 RK |
3736 | --------------------------------- |
3737 | -- Check_Library_Unit_Renaming -- | |
3738 | --------------------------------- | |
3739 | ||
3740 | procedure Check_Library_Unit_Renaming (N : Node_Id; Old_E : Entity_Id) is | |
3741 | New_E : Entity_Id; | |
3742 | ||
3743 | begin | |
3744 | if Nkind (Parent (N)) /= N_Compilation_Unit then | |
3745 | return; | |
3746 | ||
fbe627af RD |
3747 | -- Check for library unit. Note that we used to check for the scope |
3748 | -- being Standard here, but that was wrong for Standard itself. | |
3749 | ||
3750 | elsif not Is_Compilation_Unit (Old_E) | |
996ae0b0 RK |
3751 | and then not Is_Child_Unit (Old_E) |
3752 | then | |
3753 | Error_Msg_N ("renamed unit must be a library unit", Name (N)); | |
3754 | ||
615cbd95 AC |
3755 | -- Entities defined in Standard (operators and boolean literals) cannot |
3756 | -- be renamed as library units. | |
3757 | ||
3758 | elsif Scope (Old_E) = Standard_Standard | |
3759 | and then Sloc (Old_E) = Standard_Location | |
3760 | then | |
3761 | Error_Msg_N ("renamed unit must be a library unit", Name (N)); | |
3762 | ||
996ae0b0 RK |
3763 | elsif Present (Parent_Spec (N)) |
3764 | and then Nkind (Unit (Parent_Spec (N))) = N_Generic_Package_Declaration | |
3765 | and then not Is_Child_Unit (Old_E) | |
3766 | then | |
3767 | Error_Msg_N | |
3768 | ("renamed unit must be a child unit of generic parent", Name (N)); | |
3769 | ||
3770 | elsif Nkind (N) in N_Generic_Renaming_Declaration | |
ac7d724d ES |
3771 | and then Nkind (Name (N)) = N_Expanded_Name |
3772 | and then Is_Generic_Instance (Entity (Prefix (Name (N)))) | |
3773 | and then Is_Generic_Unit (Old_E) | |
996ae0b0 RK |
3774 | then |
3775 | Error_Msg_N | |
3776 | ("renamed generic unit must be a library unit", Name (N)); | |
3777 | ||
b9b2405f ST |
3778 | elsif Is_Package_Or_Generic_Package (Old_E) then |
3779 | ||
996ae0b0 RK |
3780 | -- Inherit categorization flags |
3781 | ||
3782 | New_E := Defining_Entity (N); | |
3783 | Set_Is_Pure (New_E, Is_Pure (Old_E)); | |
3784 | Set_Is_Preelaborated (New_E, Is_Preelaborated (Old_E)); | |
3785 | Set_Is_Remote_Call_Interface (New_E, | |
3786 | Is_Remote_Call_Interface (Old_E)); | |
3787 | Set_Is_Remote_Types (New_E, Is_Remote_Types (Old_E)); | |
3788 | Set_Is_Shared_Passive (New_E, Is_Shared_Passive (Old_E)); | |
3789 | end if; | |
3790 | end Check_Library_Unit_Renaming; | |
3791 | ||
ac7d724d ES |
3792 | ------------------------ |
3793 | -- Enclosing_Instance -- | |
3794 | ------------------------ | |
3795 | ||
3796 | function Enclosing_Instance return Entity_Id is | |
3797 | S : Entity_Id; | |
3798 | ||
3799 | begin | |
3800 | if not Is_Generic_Instance (Current_Scope) then | |
3801 | return Empty; | |
3802 | end if; | |
3803 | ||
3804 | S := Scope (Current_Scope); | |
3805 | while S /= Standard_Standard loop | |
3806 | if Is_Generic_Instance (S) then | |
3807 | return S; | |
3808 | end if; | |
3809 | ||
3810 | S := Scope (S); | |
3811 | end loop; | |
3812 | ||
3813 | return Empty; | |
3814 | end Enclosing_Instance; | |
3815 | ||
996ae0b0 RK |
3816 | --------------- |
3817 | -- End_Scope -- | |
3818 | --------------- | |
3819 | ||
3820 | procedure End_Scope is | |
3821 | Id : Entity_Id; | |
3822 | Prev : Entity_Id; | |
3823 | Outer : Entity_Id; | |
3824 | ||
3825 | begin | |
3826 | Id := First_Entity (Current_Scope); | |
996ae0b0 RK |
3827 | while Present (Id) loop |
3828 | -- An entity in the current scope is not necessarily the first one | |
3829 | -- on its homonym chain. Find its predecessor if any, | |
3830 | -- If it is an internal entity, it will not be in the visibility | |
3831 | -- chain altogether, and there is nothing to unchain. | |
3832 | ||
3833 | if Id /= Current_Entity (Id) then | |
3834 | Prev := Current_Entity (Id); | |
3835 | while Present (Prev) | |
3836 | and then Present (Homonym (Prev)) | |
3837 | and then Homonym (Prev) /= Id | |
3838 | loop | |
3839 | Prev := Homonym (Prev); | |
3840 | end loop; | |
3841 | ||
3842 | -- Skip to end of loop if Id is not in the visibility chain | |
3843 | ||
3844 | if No (Prev) or else Homonym (Prev) /= Id then | |
3845 | goto Next_Ent; | |
3846 | end if; | |
3847 | ||
3848 | else | |
3849 | Prev := Empty; | |
3850 | end if; | |
3851 | ||
996ae0b0 RK |
3852 | Set_Is_Immediately_Visible (Id, False); |
3853 | ||
16ca248a | 3854 | Outer := Homonym (Id); |
996ae0b0 RK |
3855 | while Present (Outer) and then Scope (Outer) = Current_Scope loop |
3856 | Outer := Homonym (Outer); | |
3857 | end loop; | |
3858 | ||
3859 | -- Reset homonym link of other entities, but do not modify link | |
3860 | -- between entities in current scope, so that the back-end can have | |
3861 | -- a proper count of local overloadings. | |
3862 | ||
3863 | if No (Prev) then | |
3864 | Set_Name_Entity_Id (Chars (Id), Outer); | |
3865 | ||
3866 | elsif Scope (Prev) /= Scope (Id) then | |
3867 | Set_Homonym (Prev, Outer); | |
3868 | end if; | |
3869 | ||
3870 | <<Next_Ent>> | |
3871 | Next_Entity (Id); | |
3872 | end loop; | |
3873 | ||
3874 | -- If the scope generated freeze actions, place them before the | |
3875 | -- current declaration and analyze them. Type declarations and | |
3876 | -- the bodies of initialization procedures can generate such nodes. | |
3877 | -- We follow the parent chain until we reach a list node, which is | |
3878 | -- the enclosing list of declarations. If the list appears within | |
3879 | -- a protected definition, move freeze nodes outside the protected | |
3880 | -- type altogether. | |
3881 | ||
3882 | if Present | |
3883 | (Scope_Stack.Table (Scope_Stack.Last).Pending_Freeze_Actions) | |
3884 | then | |
3885 | declare | |
3886 | Decl : Node_Id; | |
3887 | L : constant List_Id := Scope_Stack.Table | |
3888 | (Scope_Stack.Last).Pending_Freeze_Actions; | |
3889 | ||
3890 | begin | |
3891 | if Is_Itype (Current_Scope) then | |
3892 | Decl := Associated_Node_For_Itype (Current_Scope); | |
3893 | else | |
3894 | Decl := Parent (Current_Scope); | |
3895 | end if; | |
3896 | ||
3897 | Pop_Scope; | |
3898 | ||
3899 | while not (Is_List_Member (Decl)) | |
294ccb21 RD |
3900 | or else Nkind_In (Parent (Decl), N_Protected_Definition, |
3901 | N_Task_Definition) | |
996ae0b0 RK |
3902 | loop |
3903 | Decl := Parent (Decl); | |
3904 | end loop; | |
3905 | ||
3906 | Insert_List_Before_And_Analyze (Decl, L); | |
3907 | end; | |
3908 | ||
3909 | else | |
3910 | Pop_Scope; | |
3911 | end if; | |
3912 | ||
3913 | end End_Scope; | |
3914 | ||
3915 | --------------------- | |
3916 | -- End_Use_Clauses -- | |
3917 | --------------------- | |
3918 | ||
3919 | procedure End_Use_Clauses (Clause : Node_Id) is | |
fbf5a39b | 3920 | U : Node_Id; |
996ae0b0 RK |
3921 | |
3922 | begin | |
fbf5a39b AC |
3923 | -- Remove Use_Type clauses first, because they affect the |
3924 | -- visibility of operators in subsequent used packages. | |
3925 | ||
3926 | U := Clause; | |
3927 | while Present (U) loop | |
3928 | if Nkind (U) = N_Use_Type_Clause then | |
3929 | End_Use_Type (U); | |
3930 | end if; | |
3931 | ||
3932 | Next_Use_Clause (U); | |
3933 | end loop; | |
3934 | ||
3935 | U := Clause; | |
996ae0b0 RK |
3936 | while Present (U) loop |
3937 | if Nkind (U) = N_Use_Package_Clause then | |
3938 | End_Use_Package (U); | |
996ae0b0 RK |
3939 | end if; |
3940 | ||
3941 | Next_Use_Clause (U); | |
3942 | end loop; | |
3943 | end End_Use_Clauses; | |
3944 | ||
3945 | --------------------- | |
3946 | -- End_Use_Package -- | |
3947 | --------------------- | |
3948 | ||
3949 | procedure End_Use_Package (N : Node_Id) is | |
3950 | Pack_Name : Node_Id; | |
3951 | Pack : Entity_Id; | |
3952 | Id : Entity_Id; | |
3953 | Elmt : Elmt_Id; | |
3954 | ||
a780db15 | 3955 | function Is_Primitive_Operator_In_Use |
2e071734 AC |
3956 | (Op : Entity_Id; |
3957 | F : Entity_Id) return Boolean; | |
fbf5a39b AC |
3958 | -- Check whether Op is a primitive operator of a use-visible type |
3959 | ||
a780db15 AC |
3960 | ---------------------------------- |
3961 | -- Is_Primitive_Operator_In_Use -- | |
3962 | ---------------------------------- | |
fbf5a39b | 3963 | |
a780db15 | 3964 | function Is_Primitive_Operator_In_Use |
2e071734 AC |
3965 | (Op : Entity_Id; |
3966 | F : Entity_Id) return Boolean | |
fbf5a39b | 3967 | is |
95eb8b69 | 3968 | T : constant Entity_Id := Base_Type (Etype (F)); |
fbf5a39b | 3969 | begin |
95eb8b69 | 3970 | return In_Use (T) and then Scope (T) = Scope (Op); |
a780db15 | 3971 | end Is_Primitive_Operator_In_Use; |
fbf5a39b AC |
3972 | |
3973 | -- Start of processing for End_Use_Package | |
3974 | ||
996ae0b0 RK |
3975 | begin |
3976 | Pack_Name := First (Names (N)); | |
996ae0b0 | 3977 | while Present (Pack_Name) loop |
996ae0b0 | 3978 | |
462c31ef ST |
3979 | -- Test that Pack_Name actually denotes a package before processing |
3980 | ||
3981 | if Is_Entity_Name (Pack_Name) | |
3982 | and then Ekind (Entity (Pack_Name)) = E_Package | |
3983 | then | |
3984 | Pack := Entity (Pack_Name); | |
3985 | ||
996ae0b0 RK |
3986 | if In_Open_Scopes (Pack) then |
3987 | null; | |
3988 | ||
3989 | elsif not Redundant_Use (Pack_Name) then | |
3990 | Set_In_Use (Pack, False); | |
d4810530 | 3991 | Set_Current_Use_Clause (Pack, Empty); |
996ae0b0 | 3992 | |
16ca248a | 3993 | Id := First_Entity (Pack); |
996ae0b0 RK |
3994 | while Present (Id) loop |
3995 | ||
fbf5a39b | 3996 | -- Preserve use-visibility of operators that are primitive |
954c111a | 3997 | -- operators of a type that is use-visible through an active |
fbf5a39b | 3998 | -- use_type clause. |
996ae0b0 RK |
3999 | |
4000 | if Nkind (Id) = N_Defining_Operator_Symbol | |
4001 | and then | |
ac7d724d ES |
4002 | (Is_Primitive_Operator_In_Use (Id, First_Formal (Id)) |
4003 | or else | |
4004 | (Present (Next_Formal (First_Formal (Id))) | |
4005 | and then | |
4006 | Is_Primitive_Operator_In_Use | |
4007 | (Id, Next_Formal (First_Formal (Id))))) | |
996ae0b0 RK |
4008 | then |
4009 | null; | |
996ae0b0 RK |
4010 | else |
4011 | Set_Is_Potentially_Use_Visible (Id, False); | |
4012 | end if; | |
4013 | ||
4014 | if Is_Private_Type (Id) | |
4015 | and then Present (Full_View (Id)) | |
4016 | then | |
4017 | Set_Is_Potentially_Use_Visible (Full_View (Id), False); | |
4018 | end if; | |
4019 | ||
4020 | Next_Entity (Id); | |
4021 | end loop; | |
4022 | ||
4023 | if Present (Renamed_Object (Pack)) then | |
4024 | Set_In_Use (Renamed_Object (Pack), False); | |
d4810530 | 4025 | Set_Current_Use_Clause (Renamed_Object (Pack), Empty); |
996ae0b0 RK |
4026 | end if; |
4027 | ||
4028 | if Chars (Pack) = Name_System | |
4029 | and then Scope (Pack) = Standard_Standard | |
4030 | and then Present_System_Aux | |
4031 | then | |
4032 | Id := First_Entity (System_Aux_Id); | |
996ae0b0 RK |
4033 | while Present (Id) loop |
4034 | Set_Is_Potentially_Use_Visible (Id, False); | |
4035 | ||
4036 | if Is_Private_Type (Id) | |
4037 | and then Present (Full_View (Id)) | |
4038 | then | |
4039 | Set_Is_Potentially_Use_Visible (Full_View (Id), False); | |
4040 | end if; | |
4041 | ||
4042 | Next_Entity (Id); | |
4043 | end loop; | |
4044 | ||
4045 | Set_In_Use (System_Aux_Id, False); | |
4046 | end if; | |
4047 | ||
4048 | else | |
4049 | Set_Redundant_Use (Pack_Name, False); | |
4050 | end if; | |
996ae0b0 RK |
4051 | end if; |
4052 | ||
4053 | Next (Pack_Name); | |
4054 | end loop; | |
4055 | ||
4056 | if Present (Hidden_By_Use_Clause (N)) then | |
4057 | Elmt := First_Elmt (Hidden_By_Use_Clause (N)); | |
996ae0b0 | 4058 | while Present (Elmt) loop |
e69614ad AC |
4059 | declare |
4060 | E : constant Entity_Id := Node (Elmt); | |
4061 | ||
4062 | begin | |
4063 | -- Reset either Use_Visibility or Direct_Visibility, depending | |
4064 | -- on how the entity was hidden by the use clause. | |
4065 | ||
4066 | if In_Use (Scope (E)) | |
4067 | and then Used_As_Generic_Actual (Scope (E)) | |
4068 | then | |
4069 | Set_Is_Potentially_Use_Visible (Node (Elmt)); | |
4070 | else | |
4071 | Set_Is_Immediately_Visible (Node (Elmt)); | |
4072 | end if; | |
4073 | ||
4074 | Next_Elmt (Elmt); | |
4075 | end; | |
996ae0b0 RK |
4076 | end loop; |
4077 | ||
4078 | Set_Hidden_By_Use_Clause (N, No_Elist); | |
4079 | end if; | |
4080 | end End_Use_Package; | |
4081 | ||
4082 | ------------------ | |
4083 | -- End_Use_Type -- | |
4084 | ------------------ | |
4085 | ||
4086 | procedure End_Use_Type (N : Node_Id) is | |
4a214958 | 4087 | Elmt : Elmt_Id; |
996ae0b0 | 4088 | Id : Entity_Id; |
996ae0b0 RK |
4089 | T : Entity_Id; |
4090 | ||
4a214958 AC |
4091 | -- Start of processing for End_Use_Type |
4092 | ||
996ae0b0 RK |
4093 | begin |
4094 | Id := First (Subtype_Marks (N)); | |
996ae0b0 | 4095 | while Present (Id) loop |
fbf5a39b | 4096 | |
4a214958 | 4097 | -- A call to Rtsfind may occur while analyzing a use_type clause, |
fbf5a39b AC |
4098 | -- in which case the type marks are not resolved yet, and there is |
4099 | -- nothing to remove. | |
4100 | ||
4a214958 | 4101 | if not Is_Entity_Name (Id) or else No (Entity (Id)) then |
fbf5a39b AC |
4102 | goto Continue; |
4103 | end if; | |
4104 | ||
996ae0b0 RK |
4105 | T := Entity (Id); |
4106 | ||
4a214958 | 4107 | if T = Any_Type or else From_With_Type (T) then |
996ae0b0 RK |
4108 | null; |
4109 | ||
4a214958 | 4110 | -- Note that the use_type clause may mention a subtype of the type |
16ca248a ES |
4111 | -- whose primitive operations have been made visible. Here as |
4112 | -- elsewhere, it is the base type that matters for visibility. | |
996ae0b0 RK |
4113 | |
4114 | elsif In_Open_Scopes (Scope (Base_Type (T))) then | |
4115 | null; | |
4116 | ||
4117 | elsif not Redundant_Use (Id) then | |
4118 | Set_In_Use (T, False); | |
4119 | Set_In_Use (Base_Type (T), False); | |
21d27997 RD |
4120 | Set_Current_Use_Clause (T, Empty); |
4121 | Set_Current_Use_Clause (Base_Type (T), Empty); | |
996ae0b0 RK |
4122 | end if; |
4123 | ||
fbf5a39b | 4124 | <<Continue>> |
29efbb8c | 4125 | Next (Id); |
996ae0b0 | 4126 | end loop; |
29efbb8c ES |
4127 | |
4128 | if Is_Empty_Elmt_List (Used_Operations (N)) then | |
4129 | return; | |
4130 | ||
4131 | else | |
4132 | Elmt := First_Elmt (Used_Operations (N)); | |
4133 | while Present (Elmt) loop | |
4134 | Set_Is_Potentially_Use_Visible (Node (Elmt), False); | |
4135 | Next_Elmt (Elmt); | |
4136 | end loop; | |
4137 | end if; | |
996ae0b0 RK |
4138 | end End_Use_Type; |
4139 | ||
4140 | ---------------------- | |
4141 | -- Find_Direct_Name -- | |
4142 | ---------------------- | |
4143 | ||
4144 | procedure Find_Direct_Name (N : Node_Id) is | |
4145 | E : Entity_Id; | |
4146 | E2 : Entity_Id; | |
4147 | Msg : Boolean; | |
4148 | ||
4149 | Inst : Entity_Id := Empty; | |
bc41faa2 | 4150 | -- Enclosing instance, if any |
996ae0b0 RK |
4151 | |
4152 | Homonyms : Entity_Id; | |
4153 | -- Saves start of homonym chain | |
4154 | ||
4155 | Nvis_Entity : Boolean; | |
3764bb00 BD |
4156 | -- Set True to indicate that there is at least one entity on the homonym |
4157 | -- chain which, while not visible, is visible enough from the user point | |
4158 | -- of view to warrant an error message of "not visible" rather than | |
4159 | -- undefined. | |
996ae0b0 | 4160 | |
9bc856dd | 4161 | Nvis_Is_Private_Subprg : Boolean := False; |
0ab80019 | 4162 | -- Ada 2005 (AI-262): Set True to indicate that a form of Beaujolais |
9bc856dd AC |
4163 | -- effect concerning library subprograms has been detected. Used to |
4164 | -- generate the precise error message. | |
4165 | ||
996ae0b0 RK |
4166 | function From_Actual_Package (E : Entity_Id) return Boolean; |
4167 | -- Returns true if the entity is declared in a package that is | |
4168 | -- an actual for a formal package of the current instance. Such an | |
4169 | -- entity requires special handling because it may be use-visible | |
4170 | -- but hides directly visible entities defined outside the instance. | |
4171 | ||
67ce0d7e RD |
4172 | function Is_Actual_Parameter return Boolean; |
4173 | -- This function checks if the node N is an identifier that is an actual | |
4174 | -- parameter of a procedure call. If so it returns True, otherwise it | |
4175 | -- return False. The reason for this check is that at this stage we do | |
4176 | -- not know what procedure is being called if the procedure might be | |
4177 | -- overloaded, so it is premature to go setting referenced flags or | |
4178 | -- making calls to Generate_Reference. We will wait till Resolve_Actuals | |
4179 | -- for that processing | |
4180 | ||
996ae0b0 RK |
4181 | function Known_But_Invisible (E : Entity_Id) return Boolean; |
4182 | -- This function determines whether the entity E (which is not | |
4183 | -- visible) can reasonably be considered to be known to the writer | |
4184 | -- of the reference. This is a heuristic test, used only for the | |
4185 | -- purposes of figuring out whether we prefer to complain that an | |
4186 | -- entity is undefined or invisible (and identify the declaration | |
4187 | -- of the invisible entity in the latter case). The point here is | |
4188 | -- that we don't want to complain that something is invisible and | |
4189 | -- then point to something entirely mysterious to the writer. | |
4190 | ||
4191 | procedure Nvis_Messages; | |
4192 | -- Called if there are no visible entries for N, but there is at least | |
4193 | -- one non-directly visible, or hidden declaration. This procedure | |
4194 | -- outputs an appropriate set of error messages. | |
4195 | ||
4196 | procedure Undefined (Nvis : Boolean); | |
4197 | -- This function is called if the current node has no corresponding | |
4198 | -- visible entity or entities. The value set in Msg indicates whether | |
4199 | -- an error message was generated (multiple error messages for the | |
4200 | -- same variable are generally suppressed, see body for details). | |
4201 | -- Msg is True if an error message was generated, False if not. This | |
4202 | -- value is used by the caller to determine whether or not to output | |
4203 | -- additional messages where appropriate. The parameter is set False | |
4204 | -- to get the message "X is undefined", and True to get the message | |
4205 | -- "X is not visible". | |
4206 | ||
4207 | ------------------------- | |
4208 | -- From_Actual_Package -- | |
4209 | ------------------------- | |
4210 | ||
4211 | function From_Actual_Package (E : Entity_Id) return Boolean is | |
4212 | Scop : constant Entity_Id := Scope (E); | |
4213 | Act : Entity_Id; | |
4214 | ||
4215 | begin | |
4216 | if not In_Instance then | |
4217 | return False; | |
4218 | else | |
4219 | Inst := Current_Scope; | |
996ae0b0 RK |
4220 | while Present (Inst) |
4221 | and then Ekind (Inst) /= E_Package | |
4222 | and then not Is_Generic_Instance (Inst) | |
4223 | loop | |
4224 | Inst := Scope (Inst); | |
4225 | end loop; | |
4226 | ||
4227 | if No (Inst) then | |
4228 | return False; | |
4229 | end if; | |
4230 | ||
4231 | Act := First_Entity (Inst); | |
996ae0b0 RK |
4232 | while Present (Act) loop |
4233 | if Ekind (Act) = E_Package then | |
4234 | ||
4235 | -- Check for end of actuals list | |
4236 | ||
4237 | if Renamed_Object (Act) = Inst then | |
4238 | return False; | |
4239 | ||
4240 | elsif Present (Associated_Formal_Package (Act)) | |
4241 | and then Renamed_Object (Act) = Scop | |
4242 | then | |
4243 | -- Entity comes from (instance of) formal package | |
4244 | ||
4245 | return True; | |
4246 | ||
4247 | else | |
4248 | Next_Entity (Act); | |
4249 | end if; | |
4250 | ||
4251 | else | |
4252 | Next_Entity (Act); | |
4253 | end if; | |
4254 | end loop; | |
4255 | ||
4256 | return False; | |
4257 | end if; | |
4258 | end From_Actual_Package; | |
4259 | ||
67ce0d7e RD |
4260 | ------------------------- |
4261 | -- Is_Actual_Parameter -- | |
4262 | ------------------------- | |
4263 | ||
4264 | function Is_Actual_Parameter return Boolean is | |
4265 | begin | |
4266 | return | |
4267 | Nkind (N) = N_Identifier | |
4268 | and then | |
4269 | (Nkind (Parent (N)) = N_Procedure_Call_Statement | |
ac7d724d ES |
4270 | or else |
4271 | (Nkind (Parent (N)) = N_Parameter_Association | |
4272 | and then N = Explicit_Actual_Parameter (Parent (N)) | |
4273 | and then Nkind (Parent (Parent (N))) = | |
67ce0d7e RD |
4274 | N_Procedure_Call_Statement)); |
4275 | end Is_Actual_Parameter; | |
4276 | ||
996ae0b0 RK |
4277 | ------------------------- |
4278 | -- Known_But_Invisible -- | |
4279 | ------------------------- | |
4280 | ||
4281 | function Known_But_Invisible (E : Entity_Id) return Boolean is | |
4282 | Fname : File_Name_Type; | |
4283 | ||
4284 | begin | |
4285 | -- Entities in Standard are always considered to be known | |
4286 | ||
4287 | if Sloc (E) <= Standard_Location then | |
4288 | return True; | |
4289 | ||
4290 | -- An entity that does not come from source is always considered | |
4291 | -- to be unknown, since it is an artifact of code expansion. | |
4292 | ||
4293 | elsif not Comes_From_Source (E) then | |
4294 | return False; | |
4295 | ||
4296 | -- In gnat internal mode, we consider all entities known | |
4297 | ||
4298 | elsif GNAT_Mode then | |
4299 | return True; | |
4300 | end if; | |
4301 | ||
4302 | -- Here we have an entity that is not from package Standard, and | |
4303 | -- which comes from Source. See if it comes from an internal file. | |
4304 | ||
4305 | Fname := Unit_File_Name (Get_Source_Unit (E)); | |
4306 | ||
4307 | -- Case of from internal file | |
4308 | ||
4309 | if Is_Internal_File_Name (Fname) then | |
4310 | ||
4311 | -- Private part entities in internal files are never considered | |
4312 | -- to be known to the writer of normal application code. | |
4313 | ||
4314 | if Is_Hidden (E) then | |
4315 | return False; | |
4316 | end if; | |
4317 | ||
4318 | -- Entities from System packages other than System and | |
4319 | -- System.Storage_Elements are not considered to be known. | |
4320 | -- System.Auxxxx files are also considered known to the user. | |
4321 | ||
4322 | -- Should refine this at some point to generally distinguish | |
4323 | -- between known and unknown internal files ??? | |
4324 | ||
4325 | Get_Name_String (Fname); | |
4326 | ||
4327 | return | |
4328 | Name_Len < 2 | |
4329 | or else | |
4330 | Name_Buffer (1 .. 2) /= "s-" | |
4331 | or else | |
4332 | Name_Buffer (3 .. 8) = "stoele" | |
4333 | or else | |
4334 | Name_Buffer (3 .. 5) = "aux"; | |
4335 | ||
4336 | -- If not an internal file, then entity is definitely known, | |
4337 | -- even if it is in a private part (the message generated will | |
4338 | -- note that it is in a private part) | |
4339 | ||
4340 | else | |
4341 | return True; | |
4342 | end if; | |
4343 | end Known_But_Invisible; | |
4344 | ||
4345 | ------------------- | |
4346 | -- Nvis_Messages -- | |
4347 | ------------------- | |
4348 | ||
4349 | procedure Nvis_Messages is | |
9bc856dd AC |
4350 | Comp_Unit : Node_Id; |
4351 | Ent : Entity_Id; | |
1175f0b6 | 4352 | Found : Boolean := False; |
9bc856dd AC |
4353 | Hidden : Boolean := False; |
4354 | Item : Node_Id; | |
996ae0b0 RK |
4355 | |
4356 | begin | |
0ab80019 | 4357 | -- Ada 2005 (AI-262): Generate a precise error concerning the |
9bc856dd AC |
4358 | -- Beaujolais effect that was previously detected |
4359 | ||
4360 | if Nvis_Is_Private_Subprg then | |
4361 | ||
4362 | pragma Assert (Nkind (E2) = N_Defining_Identifier | |
16ca248a ES |
4363 | and then Ekind (E2) = E_Function |
4364 | and then Scope (E2) = Standard_Standard | |
4365 | and then Has_Private_With (E2)); | |
9bc856dd AC |
4366 | |
4367 | -- Find the sloc corresponding to the private with'ed unit | |
4368 | ||
16ca248a | 4369 | Comp_Unit := Cunit (Current_Sem_Unit); |
9bc856dd AC |
4370 | Error_Msg_Sloc := No_Location; |
4371 | ||
16ca248a | 4372 | Item := First (Context_Items (Comp_Unit)); |
9bc856dd AC |
4373 | while Present (Item) loop |
4374 | if Nkind (Item) = N_With_Clause | |
4375 | and then Private_Present (Item) | |
4376 | and then Entity (Name (Item)) = E2 | |
4377 | then | |
4378 | Error_Msg_Sloc := Sloc (Item); | |
4379 | exit; | |
4380 | end if; | |
4381 | ||
4382 | Next (Item); | |
4383 | end loop; | |
4384 | ||
4385 | pragma Assert (Error_Msg_Sloc /= No_Location); | |
4386 | ||
0ab80019 | 4387 | Error_Msg_N ("(Ada 2005): hidden by private with clause #", N); |
9bc856dd AC |
4388 | return; |
4389 | end if; | |
4390 | ||
996ae0b0 RK |
4391 | Undefined (Nvis => True); |
4392 | ||
4393 | if Msg then | |
4394 | ||
4395 | -- First loop does hidden declarations | |
4396 | ||
4397 | Ent := Homonyms; | |
4398 | while Present (Ent) loop | |
4399 | if Is_Potentially_Use_Visible (Ent) then | |
996ae0b0 | 4400 | if not Hidden then |
deef4289 AC |
4401 | Error_Msg_N -- CODEFIX |
4402 | ("multiple use clauses cause hiding!", N); | |
996ae0b0 RK |
4403 | Hidden := True; |
4404 | end if; | |
4405 | ||
4406 | Error_Msg_Sloc := Sloc (Ent); | |
4e7a4f6e AC |
4407 | Error_Msg_N -- CODEFIX |
4408 | ("hidden declaration#!", N); | |
996ae0b0 RK |
4409 | end if; |
4410 | ||
4411 | Ent := Homonym (Ent); | |
4412 | end loop; | |
4413 | ||
4414 | -- If we found hidden declarations, then that's enough, don't | |
4415 | -- bother looking for non-visible declarations as well. | |
4416 | ||
4417 | if Hidden then | |
4418 | return; | |
4419 | end if; | |
4420 | ||
4421 | -- Second loop does non-directly visible declarations | |
4422 | ||
4423 | Ent := Homonyms; | |
4424 | while Present (Ent) loop | |
4425 | if not Is_Potentially_Use_Visible (Ent) then | |
4426 | ||
4427 | -- Do not bother the user with unknown entities | |
4428 | ||
4429 | if not Known_But_Invisible (Ent) then | |
4430 | goto Continue; | |
4431 | end if; | |
4432 | ||
4433 | Error_Msg_Sloc := Sloc (Ent); | |
4434 | ||
4435 | -- Output message noting that there is a non-visible | |
4436 | -- declaration, distinguishing the private part case. | |
4437 | ||
4438 | if Is_Hidden (Ent) then | |
4439 | Error_Msg_N ("non-visible (private) declaration#!", N); | |
1175f0b6 AC |
4440 | |
4441 | -- If the entity is declared in a generic package, it | |
4442 | -- cannot be visible, so there is no point in adding it | |
4443 | -- to the list of candidates if another homograph from a | |
4444 | -- non-generic package has been seen. | |
4445 | ||
4446 | elsif Ekind (Scope (Ent)) = E_Generic_Package | |
4447 | and then Found | |
4448 | then | |
4449 | null; | |
4450 | ||
996ae0b0 | 4451 | else |
483c78cb RD |
4452 | Error_Msg_N -- CODEFIX |
4453 | ("non-visible declaration#!", N); | |
fbf5a39b | 4454 | |
1175f0b6 AC |
4455 | if Ekind (Scope (Ent)) /= E_Generic_Package then |
4456 | Found := True; | |
4457 | end if; | |
4458 | ||
fbf5a39b AC |
4459 | if Is_Compilation_Unit (Ent) |
4460 | and then | |
4461 | Nkind (Parent (Parent (N))) = N_Use_Package_Clause | |
4462 | then | |
16ca248a | 4463 | Error_Msg_Qual_Level := 99; |
ed2233dc AC |
4464 | Error_Msg_NE -- CODEFIX |
4465 | ("\\missing `WITH &;`", N, Ent); | |
16ca248a | 4466 | Error_Msg_Qual_Level := 0; |
fbf5a39b | 4467 | end if; |
e1b871e9 AC |
4468 | |
4469 | if Ekind (Ent) = E_Discriminant | |
4470 | and then Present (Corresponding_Discriminant (Ent)) | |
4471 | and then Scope (Corresponding_Discriminant (Ent)) = | |
4472 | Etype (Scope (Ent)) | |
4473 | then | |
4474 | Error_Msg_N | |
4475 | ("inherited discriminant not allowed here" & | |
4476 | " (RM 3.8 (12), 3.8.1 (6))!", N); | |
4477 | end if; | |
996ae0b0 | 4478 | end if; |
07fc65c4 GB |
4479 | |
4480 | -- Set entity and its containing package as referenced. We | |
4481 | -- can't be sure of this, but this seems a better choice | |
4482 | -- to avoid unused entity messages. | |
4483 | ||
4484 | if Comes_From_Source (Ent) then | |
4485 | Set_Referenced (Ent); | |
4486 | Set_Referenced (Cunit_Entity (Get_Source_Unit (Ent))); | |
4487 | end if; | |
996ae0b0 RK |
4488 | end if; |
4489 | ||
4490 | <<Continue>> | |
4491 | Ent := Homonym (Ent); | |
4492 | end loop; | |
996ae0b0 RK |
4493 | end if; |
4494 | end Nvis_Messages; | |
4495 | ||
4496 | --------------- | |
4497 | -- Undefined -- | |
4498 | --------------- | |
4499 | ||
4500 | procedure Undefined (Nvis : Boolean) is | |
4501 | Emsg : Error_Msg_Id; | |
4502 | ||
4503 | begin | |
fbf5a39b AC |
4504 | -- We should never find an undefined internal name. If we do, then |
4505 | -- see if we have previous errors. If so, ignore on the grounds that | |
4506 | -- it is probably a cascaded message (e.g. a block label from a badly | |
4507 | -- formed block). If no previous errors, then we have a real internal | |
4508 | -- error of some kind so raise an exception. | |
4509 | ||
4510 | if Is_Internal_Name (Chars (N)) then | |
4511 | if Total_Errors_Detected /= 0 then | |
4512 | return; | |
4513 | else | |
4514 | raise Program_Error; | |
4515 | end if; | |
4516 | end if; | |
4517 | ||
996ae0b0 RK |
4518 | -- A very specialized error check, if the undefined variable is |
4519 | -- a case tag, and the case type is an enumeration type, check | |
4520 | -- for a possible misspelling, and if so, modify the identifier | |
4521 | ||
4522 | -- Named aggregate should also be handled similarly ??? | |
4523 | ||
4524 | if Nkind (N) = N_Identifier | |
4525 | and then Nkind (Parent (N)) = N_Case_Statement_Alternative | |
4526 | then | |
996ae0b0 | 4527 | declare |
996ae0b0 RK |
4528 | Case_Stm : constant Node_Id := Parent (Parent (N)); |
4529 | Case_Typ : constant Entity_Id := Etype (Expression (Case_Stm)); | |
4530 | ||
4531 | Lit : Node_Id; | |
4532 | ||
4533 | begin | |
4534 | if Is_Enumeration_Type (Case_Typ) | |
21d27997 | 4535 | and then not Is_Standard_Character_Type (Case_Typ) |
996ae0b0 RK |
4536 | then |
4537 | Lit := First_Literal (Case_Typ); | |
4538 | Get_Name_String (Chars (Lit)); | |
4539 | ||
4540 | if Chars (Lit) /= Chars (N) | |
294ccb21 | 4541 | and then Is_Bad_Spelling_Of (Chars (N), Chars (Lit)) then |
996ae0b0 | 4542 | Error_Msg_Node_2 := Lit; |
ed2233dc | 4543 | Error_Msg_N -- CODEFIX |
996ae0b0 RK |
4544 | ("& is undefined, assume misspelling of &", N); |
4545 | Rewrite (N, New_Occurrence_Of (Lit, Sloc (N))); | |
4546 | return; | |
4547 | end if; | |
4548 | ||
4549 | Lit := Next_Literal (Lit); | |
4550 | end if; | |
4551 | end; | |
4552 | end if; | |
4553 | ||
4554 | -- Normal processing | |
4555 | ||
4556 | Set_Entity (N, Any_Id); | |
4557 | Set_Etype (N, Any_Type); | |
4558 | ||
4559 | -- We use the table Urefs to keep track of entities for which we | |
4560 | -- have issued errors for undefined references. Multiple errors | |
4561 | -- for a single name are normally suppressed, however we modify | |
4562 | -- the error message to alert the programmer to this effect. | |
4563 | ||
4564 | for J in Urefs.First .. Urefs.Last loop | |
4565 | if Chars (N) = Chars (Urefs.Table (J).Node) then | |
4566 | if Urefs.Table (J).Err /= No_Error_Msg | |
4567 | and then Sloc (N) /= Urefs.Table (J).Loc | |
4568 | then | |
4569 | Error_Msg_Node_1 := Urefs.Table (J).Node; | |
4570 | ||
4571 | if Urefs.Table (J).Nvis then | |
4572 | Change_Error_Text (Urefs.Table (J).Err, | |
4573 | "& is not visible (more references follow)"); | |
4574 | else | |
4575 | Change_Error_Text (Urefs.Table (J).Err, | |
4576 | "& is undefined (more references follow)"); | |
4577 | end if; | |
4578 | ||
4579 | Urefs.Table (J).Err := No_Error_Msg; | |
4580 | end if; | |
4581 | ||
4582 | -- Although we will set Msg False, and thus suppress the | |
4583 | -- message, we also set Error_Posted True, to avoid any | |
4584 | -- cascaded messages resulting from the undefined reference. | |
4585 | ||
4586 | Msg := False; | |
4587 | Set_Error_Posted (N, True); | |
4588 | return; | |
4589 | end if; | |
4590 | end loop; | |
4591 | ||
4592 | -- If entry not found, this is first undefined occurrence | |
4593 | ||
4594 | if Nvis then | |
4595 | Error_Msg_N ("& is not visible!", N); | |
4596 | Emsg := Get_Msg_Id; | |
4597 | ||
4598 | else | |
4599 | Error_Msg_N ("& is undefined!", N); | |
4600 | Emsg := Get_Msg_Id; | |
4601 | ||
4602 | -- A very bizarre special check, if the undefined identifier | |
4603 | -- is put or put_line, then add a special error message (since | |
4604 | -- this is a very common error for beginners to make). | |
4605 | ||
b69cd36a | 4606 | if Nam_In (Chars (N), Name_Put, Name_Put_Line) then |
ed2233dc | 4607 | Error_Msg_N -- CODEFIX |
16ca248a ES |
4608 | ("\\possible missing `WITH Ada.Text_'I'O; " & |
4609 | "USE Ada.Text_'I'O`!", N); | |
4610 | ||
4611 | -- Another special check if N is the prefix of a selected | |
4612 | -- component which is a known unit, add message complaining | |
fbe627af | 4613 | -- about missing with for this unit. |
16ca248a ES |
4614 | |
4615 | elsif Nkind (Parent (N)) = N_Selected_Component | |
4616 | and then N = Prefix (Parent (N)) | |
4617 | and then Is_Known_Unit (Parent (N)) | |
4618 | then | |
4619 | Error_Msg_Node_2 := Selector_Name (Parent (N)); | |
ed2233dc AC |
4620 | Error_Msg_N -- CODEFIX |
4621 | ("\\missing `WITH &.&;`", Prefix (Parent (N))); | |
996ae0b0 RK |
4622 | end if; |
4623 | ||
4624 | -- Now check for possible misspellings | |
4625 | ||
996ae0b0 RK |
4626 | declare |
4627 | E : Entity_Id; | |
4628 | Ematch : Entity_Id := Empty; | |
4629 | ||
4630 | Last_Name_Id : constant Name_Id := | |
4631 | Name_Id (Nat (First_Name_Id) + | |
4632 | Name_Entries_Count - 1); | |
4633 | ||
996ae0b0 | 4634 | begin |
294ccb21 RD |
4635 | for Nam in First_Name_Id .. Last_Name_Id loop |
4636 | E := Get_Name_Entity_Id (Nam); | |
996ae0b0 RK |
4637 | |
4638 | if Present (E) | |
4639 | and then (Is_Immediately_Visible (E) | |
4640 | or else | |
4641 | Is_Potentially_Use_Visible (E)) | |
4642 | then | |
294ccb21 | 4643 | if Is_Bad_Spelling_Of (Chars (N), Nam) then |
996ae0b0 RK |
4644 | Ematch := E; |
4645 | exit; | |
4646 | end if; | |
4647 | end if; | |
4648 | end loop; | |
4649 | ||
4650 | if Present (Ematch) then | |
deef4289 AC |
4651 | Error_Msg_NE -- CODEFIX |
4652 | ("\possible misspelling of&", N, Ematch); | |
996ae0b0 RK |
4653 | end if; |
4654 | end; | |
4655 | end if; | |
4656 | ||
16ca248a ES |
4657 | -- Make entry in undefined references table unless the full errors |
4658 | -- switch is set, in which case by refraining from generating the | |
4659 | -- table entry, we guarantee that we get an error message for every | |
4660 | -- undefined reference. | |
996ae0b0 RK |
4661 | |
4662 | if not All_Errors_Mode then | |
11560bcc TQ |
4663 | Urefs.Append ( |
4664 | (Node => N, | |
4665 | Err => Emsg, | |
4666 | Nvis => Nvis, | |
4667 | Loc => Sloc (N))); | |
996ae0b0 RK |
4668 | end if; |
4669 | ||
4670 | Msg := True; | |
4671 | end Undefined; | |
4672 | ||
4673 | -- Start of processing for Find_Direct_Name | |
4674 | ||
4675 | begin | |
4676 | -- If the entity pointer is already set, this is an internal node, or | |
4677 | -- a node that is analyzed more than once, after a tree modification. | |
4678 | -- In such a case there is no resolution to perform, just set the type. | |
4679 | ||
4680 | if Present (Entity (N)) then | |
4681 | if Is_Type (Entity (N)) then | |
4682 | Set_Etype (N, Entity (N)); | |
4683 | ||
4684 | else | |
4685 | declare | |
4686 | Entyp : constant Entity_Id := Etype (Entity (N)); | |
4687 | ||
4688 | begin | |
4689 | -- One special case here. If the Etype field is already set, | |
4690 | -- and references the packed array type corresponding to the | |
4691 | -- etype of the referenced entity, then leave it alone. This | |
4692 | -- happens for trees generated from Exp_Pakd, where expressions | |
4693 | -- can be deliberately "mis-typed" to the packed array type. | |
4694 | ||
4695 | if Is_Array_Type (Entyp) | |
4696 | and then Is_Packed (Entyp) | |
4697 | and then Present (Etype (N)) | |
4698 | and then Etype (N) = Packed_Array_Type (Entyp) | |
4699 | then | |
4700 | null; | |
4701 | ||
4702 | -- If not that special case, then just reset the Etype | |
4703 | ||
4704 | else | |
4705 | Set_Etype (N, Etype (Entity (N))); | |
4706 | end if; | |
4707 | end; | |
4708 | end if; | |
4709 | ||
4710 | return; | |
4711 | end if; | |
4712 | ||
4713 | -- Here if Entity pointer was not set, we need full visibility analysis | |
4714 | -- First we generate debugging output if the debug E flag is set. | |
4715 | ||
4716 | if Debug_Flag_E then | |
4717 | Write_Str ("Looking for "); | |
4718 | Write_Name (Chars (N)); | |
4719 | Write_Eol; | |
4720 | end if; | |
4721 | ||
4722 | Homonyms := Current_Entity (N); | |
4723 | Nvis_Entity := False; | |
4724 | ||
4725 | E := Homonyms; | |
4726 | while Present (E) loop | |
4727 | ||
ff81221b ES |
4728 | -- If entity is immediately visible or potentially use visible, then |
4729 | -- process the entity and we are done. | |
996ae0b0 RK |
4730 | |
4731 | if Is_Immediately_Visible (E) then | |
4732 | goto Immediately_Visible_Entity; | |
4733 | ||
4734 | elsif Is_Potentially_Use_Visible (E) then | |
4735 | goto Potentially_Use_Visible_Entity; | |
4736 | ||
4737 | -- Note if a known but invisible entity encountered | |
4738 | ||
4739 | elsif Known_But_Invisible (E) then | |
4740 | Nvis_Entity := True; | |
4741 | end if; | |
4742 | ||
4743 | -- Move to next entity in chain and continue search | |
4744 | ||
4745 | E := Homonym (E); | |
4746 | end loop; | |
4747 | ||
4748 | -- If no entries on homonym chain that were potentially visible, | |
4749 | -- and no entities reasonably considered as non-visible, then | |
4750 | -- we have a plain undefined reference, with no additional | |
4751 | -- explanation required! | |
4752 | ||
4753 | if not Nvis_Entity then | |
4754 | Undefined (Nvis => False); | |
996ae0b0 RK |
4755 | |
4756 | -- Otherwise there is at least one entry on the homonym chain that | |
4757 | -- is reasonably considered as being known and non-visible. | |
4758 | ||
4759 | else | |
4760 | Nvis_Messages; | |
996ae0b0 RK |
4761 | end if; |
4762 | ||
fbf5a39b AC |
4763 | return; |
4764 | ||
996ae0b0 RK |
4765 | -- Processing for a potentially use visible entry found. We must search |
4766 | -- the rest of the homonym chain for two reasons. First, if there is a | |
4767 | -- directly visible entry, then none of the potentially use-visible | |
4768 | -- entities are directly visible (RM 8.4(10)). Second, we need to check | |
4769 | -- for the case of multiple potentially use-visible entries hiding one | |
4770 | -- another and as a result being non-directly visible (RM 8.4(11)). | |
4771 | ||
4772 | <<Potentially_Use_Visible_Entity>> declare | |
4773 | Only_One_Visible : Boolean := True; | |
4774 | All_Overloadable : Boolean := Is_Overloadable (E); | |
4775 | ||
4776 | begin | |
4777 | E2 := Homonym (E); | |
996ae0b0 RK |
4778 | while Present (E2) loop |
4779 | if Is_Immediately_Visible (E2) then | |
4780 | ||
4781 | -- If the use-visible entity comes from the actual for a | |
4782 | -- formal package, it hides a directly visible entity from | |
4783 | -- outside the instance. | |
4784 | ||
4785 | if From_Actual_Package (E) | |
4786 | and then Scope_Depth (E2) < Scope_Depth (Inst) | |
4787 | then | |
4788 | goto Found; | |
4789 | else | |
4790 | E := E2; | |
4791 | goto Immediately_Visible_Entity; | |
4792 | end if; | |
4793 | ||
4794 | elsif Is_Potentially_Use_Visible (E2) then | |
4795 | Only_One_Visible := False; | |
4796 | All_Overloadable := All_Overloadable and Is_Overloadable (E2); | |
9bc856dd | 4797 | |
30783513 | 4798 | -- Ada 2005 (AI-262): Protect against a form of Beaujolais effect |
f3d57416 | 4799 | -- that can occur in private_with clauses. Example: |
9bc856dd AC |
4800 | |
4801 | -- with A; | |
4802 | -- private with B; package A is | |
4803 | -- package C is function B return Integer; | |
4804 | -- use A; end A; | |
4805 | -- V1 : Integer := B; | |
4806 | -- private function B return Integer; | |
4807 | -- V2 : Integer := B; | |
4808 | -- end C; | |
4809 | ||
bc41faa2 | 4810 | -- V1 resolves to A.B, but V2 resolves to library unit B |
9bc856dd AC |
4811 | |
4812 | elsif Ekind (E2) = E_Function | |
4813 | and then Scope (E2) = Standard_Standard | |
4814 | and then Has_Private_With (E2) | |
4815 | then | |
4816 | Only_One_Visible := False; | |
4817 | All_Overloadable := False; | |
4818 | Nvis_Is_Private_Subprg := True; | |
4819 | exit; | |
996ae0b0 RK |
4820 | end if; |
4821 | ||
4822 | E2 := Homonym (E2); | |
4823 | end loop; | |
4824 | ||
4825 | -- On falling through this loop, we have checked that there are no | |
4826 | -- immediately visible entities. Only_One_Visible is set if exactly | |
4827 | -- one potentially use visible entity exists. All_Overloadable is | |
4828 | -- set if all the potentially use visible entities are overloadable. | |
4829 | -- The condition for legality is that either there is one potentially | |
4830 | -- use visible entity, or if there is more than one, then all of them | |
4831 | -- are overloadable. | |
4832 | ||
4833 | if Only_One_Visible or All_Overloadable then | |
4834 | goto Found; | |
4835 | ||
4836 | -- If there is more than one potentially use-visible entity and at | |
4ff4293f | 4837 | -- least one of them non-overloadable, we have an error (RM 8.4(11)). |
996ae0b0 RK |
4838 | -- Note that E points to the first such entity on the homonym list. |
4839 | -- Special case: if one of the entities is declared in an actual | |
4840 | -- package, it was visible in the generic, and takes precedence over | |
fbf5a39b AC |
4841 | -- other entities that are potentially use-visible. Same if it is |
4842 | -- declared in a local instantiation of the current instance. | |
996ae0b0 RK |
4843 | |
4844 | else | |
4845 | if In_Instance then | |
fbf5a39b | 4846 | |
bc41faa2 | 4847 | -- Find current instance |
fbf5a39b | 4848 | |
16ca248a | 4849 | Inst := Current_Scope; |
ac7d724d | 4850 | while Present (Inst) and then Inst /= Standard_Standard loop |
fbf5a39b AC |
4851 | if Is_Generic_Instance (Inst) then |
4852 | exit; | |
4853 | end if; | |
4854 | ||
4855 | Inst := Scope (Inst); | |
4856 | end loop; | |
4857 | ||
996ae0b0 | 4858 | E2 := E; |
996ae0b0 | 4859 | while Present (E2) loop |
fbf5a39b AC |
4860 | if From_Actual_Package (E2) |
4861 | or else | |
4862 | (Is_Generic_Instance (Scope (E2)) | |
4863 | and then Scope_Depth (Scope (E2)) > Scope_Depth (Inst)) | |
4864 | then | |
996ae0b0 RK |
4865 | E := E2; |
4866 | goto Found; | |
4867 | end if; | |
4868 | ||
4869 | E2 := Homonym (E2); | |
4870 | end loop; | |
4871 | ||
4872 | Nvis_Messages; | |
4873 | return; | |
4874 | ||
5eb10f25 ES |
4875 | elsif |
4876 | Is_Predefined_File_Name (Unit_File_Name (Current_Sem_Unit)) | |
4877 | then | |
4de287c4 ES |
4878 | -- A use-clause in the body of a system file creates conflict |
4879 | -- with some entity in a user scope, while rtsfind is active. | |
4880 | -- Keep only the entity coming from another predefined unit. | |
5eb10f25 ES |
4881 | |
4882 | E2 := E; | |
4883 | while Present (E2) loop | |
4884 | if Is_Predefined_File_Name | |
4885 | (Unit_File_Name (Get_Source_Unit (Sloc (E2)))) | |
4886 | then | |
4887 | E := E2; | |
4888 | goto Found; | |
4889 | end if; | |
4890 | ||
4891 | E2 := Homonym (E2); | |
4892 | end loop; | |
4893 | ||
4de287c4 | 4894 | -- Entity must exist because predefined unit is correct |
5eb10f25 ES |
4895 | |
4896 | raise Program_Error; | |
4897 | ||
996ae0b0 RK |
4898 | else |
4899 | Nvis_Messages; | |
4900 | return; | |
4901 | end if; | |
4902 | end if; | |
4903 | end; | |
4904 | ||
4905 | -- Come here with E set to the first immediately visible entity on | |
4906 | -- the homonym chain. This is the one we want unless there is another | |
ff81221b ES |
4907 | -- immediately visible entity further on in the chain for an inner |
4908 | -- scope (RM 8.3(8)). | |
996ae0b0 RK |
4909 | |
4910 | <<Immediately_Visible_Entity>> declare | |
4911 | Level : Int; | |
4912 | Scop : Entity_Id; | |
4913 | ||
4914 | begin | |
ff81221b | 4915 | -- Find scope level of initial entity. When compiling through |
996ae0b0 RK |
4916 | -- Rtsfind, the previous context is not completely invisible, and |
4917 | -- an outer entity may appear on the chain, whose scope is below | |
4918 | -- the entry for Standard that delimits the current scope stack. | |
4919 | -- Indicate that the level for this spurious entry is outside of | |
4920 | -- the current scope stack. | |
4921 | ||
4922 | Level := Scope_Stack.Last; | |
4923 | loop | |
4924 | Scop := Scope_Stack.Table (Level).Entity; | |
4925 | exit when Scop = Scope (E); | |
4926 | Level := Level - 1; | |
4927 | exit when Scop = Standard_Standard; | |
4928 | end loop; | |
4929 | ||
4930 | -- Now search remainder of homonym chain for more inner entry | |
4931 | -- If the entity is Standard itself, it has no scope, and we | |
4932 | -- compare it with the stack entry directly. | |
4933 | ||
4934 | E2 := Homonym (E); | |
4935 | while Present (E2) loop | |
4936 | if Is_Immediately_Visible (E2) then | |
4de287c4 ES |
4937 | |
4938 | -- If a generic package contains a local declaration that | |
4939 | -- has the same name as the generic, there may be a visibility | |
4940 | -- conflict in an instance, where the local declaration must | |
4941 | -- also hide the name of the corresponding package renaming. | |
4942 | -- We check explicitly for a package declared by a renaming, | |
4943 | -- whose renamed entity is an instance that is on the scope | |
4944 | -- stack, and that contains a homonym in the same scope. Once | |
4945 | -- we have found it, we know that the package renaming is not | |
4946 | -- immediately visible, and that the identifier denotes the | |
4947 | -- other entity (and its homonyms if overloaded). | |
4948 | ||
4949 | if Scope (E) = Scope (E2) | |
4950 | and then Ekind (E) = E_Package | |
4951 | and then Present (Renamed_Object (E)) | |
4952 | and then Is_Generic_Instance (Renamed_Object (E)) | |
4953 | and then In_Open_Scopes (Renamed_Object (E)) | |
4954 | and then Comes_From_Source (N) | |
4955 | then | |
4956 | Set_Is_Immediately_Visible (E, False); | |
4957 | E := E2; | |
4958 | ||
4959 | else | |
4960 | for J in Level + 1 .. Scope_Stack.Last loop | |
4961 | if Scope_Stack.Table (J).Entity = Scope (E2) | |
4962 | or else Scope_Stack.Table (J).Entity = E2 | |
4963 | then | |
4964 | Level := J; | |
4965 | E := E2; | |
4966 | exit; | |
4967 | end if; | |
4968 | end loop; | |
4969 | end if; | |
996ae0b0 RK |
4970 | end if; |
4971 | ||
4972 | E2 := Homonym (E2); | |
4973 | end loop; | |
4974 | ||
4975 | -- At the end of that loop, E is the innermost immediately | |
4976 | -- visible entity, so we are all set. | |
4977 | end; | |
4978 | ||
4979 | -- Come here with entity found, and stored in E | |
4980 | ||
4981 | <<Found>> begin | |
4982 | ||
30196a76 RD |
4983 | -- Check violation of No_Wide_Characters restriction |
4984 | ||
4985 | Check_Wide_Character_Restriction (E, N); | |
4986 | ||
294ccb21 RD |
4987 | -- When distribution features are available (Get_PCS_Name /= |
4988 | -- Name_No_DSA), a remote access-to-subprogram type is converted | |
4989 | -- into a record type holding whatever information is needed to | |
f3d57416 | 4990 | -- perform a remote call on an RCI subprogram. In that case we |
294ccb21 RD |
4991 | -- rewrite any occurrence of the RAS type into the equivalent record |
4992 | -- type here. 'Access attribute references and RAS dereferences are | |
4993 | -- then implemented using specific TSSs. However when distribution is | |
4994 | -- not available (case of Get_PCS_Name = Name_No_DSA), we bypass the | |
4995 | -- generation of these TSSs, and we must keep the RAS type in its | |
4996 | -- original access-to-subprogram form (since all calls through a | |
4997 | -- value of such type will be local anyway in the absence of a PCS). | |
4998 | ||
996ae0b0 RK |
4999 | if Comes_From_Source (N) |
5000 | and then Is_Remote_Access_To_Subprogram_Type (E) | |
d1d81616 | 5001 | and then Ekind (E) = E_Access_Subprogram_Type |
996ae0b0 | 5002 | and then Expander_Active |
a77842bd | 5003 | and then Get_PCS_Name /= Name_No_DSA |
996ae0b0 RK |
5004 | then |
5005 | Rewrite (N, | |
5006 | New_Occurrence_Of (Equivalent_Type (E), Sloc (N))); | |
5007 | return; | |
5008 | end if; | |
5009 | ||
6989bc1f AC |
5010 | -- Set the entity. Note that the reason we call Set_Entity for the |
5011 | -- overloadable case, as opposed to Set_Entity_With_Style_Check is | |
5012 | -- that in the overloaded case, the initial call can set the wrong | |
5013 | -- homonym. The call that sets the right homonym is in Sem_Res and | |
5014 | -- that call does use Set_Entity_With_Style_Check, so we don't miss | |
5015 | -- a style check. | |
5016 | ||
5017 | if Is_Overloadable (E) then | |
5018 | Set_Entity (N, E); | |
5019 | else | |
5020 | Set_Entity_With_Style_Check (N, E); | |
5021 | end if; | |
996ae0b0 RK |
5022 | |
5023 | if Is_Type (E) then | |
5024 | Set_Etype (N, E); | |
5025 | else | |
5026 | Set_Etype (N, Get_Full_View (Etype (E))); | |
5027 | end if; | |
5028 | ||
5029 | if Debug_Flag_E then | |
5030 | Write_Str (" found "); | |
5031 | Write_Entity_Info (E, " "); | |
5032 | end if; | |
5033 | ||
5034 | -- If the Ekind of the entity is Void, it means that all homonyms | |
5035 | -- are hidden from all visibility (RM 8.3(5,14-20)). However, this | |
5036 | -- test is skipped if the current scope is a record and the name is | |
5037 | -- a pragma argument expression (case of Atomic and Volatile pragmas | |
5038 | -- and possibly other similar pragmas added later, which are allowed | |
5039 | -- to reference components in the current record). | |
5040 | ||
5041 | if Ekind (E) = E_Void | |
5042 | and then | |
5043 | (not Is_Record_Type (Current_Scope) | |
5044 | or else Nkind (Parent (N)) /= N_Pragma_Argument_Association) | |
5045 | then | |
5046 | Premature_Usage (N); | |
5047 | ||
16ca248a ES |
5048 | -- If the entity is overloadable, collect all interpretations of the |
5049 | -- name for subsequent overload resolution. We optimize a bit here to | |
5050 | -- do this only if we have an overloadable entity that is not on its | |
5051 | -- own on the homonym chain. | |
996ae0b0 RK |
5052 | |
5053 | elsif Is_Overloadable (E) | |
5054 | and then (Present (Homonym (E)) or else Current_Entity (N) /= E) | |
5055 | then | |
5056 | Collect_Interps (N); | |
5057 | ||
bc41faa2 | 5058 | -- If no homonyms were visible, the entity is unambiguous |
996ae0b0 RK |
5059 | |
5060 | if not Is_Overloaded (N) then | |
67ce0d7e RD |
5061 | if not Is_Actual_Parameter then |
5062 | Generate_Reference (E, N); | |
5063 | end if; | |
996ae0b0 RK |
5064 | end if; |
5065 | ||
5066 | -- Case of non-overloadable entity, set the entity providing that | |
5067 | -- we do not have the case of a discriminant reference within a | |
5068 | -- default expression. Such references are replaced with the | |
5069 | -- corresponding discriminal, which is the formal corresponding to | |
5070 | -- to the discriminant in the initialization procedure. | |
5071 | ||
996ae0b0 | 5072 | else |
294ccb21 RD |
5073 | -- Entity is unambiguous, indicate that it is referenced here |
5074 | ||
5075 | -- For a renaming of an object, always generate simple reference, | |
5114f3ff AC |
5076 | -- we don't try to keep track of assignments in this case, except |
5077 | -- in SPARK mode where renamings are traversed for generating | |
5078 | -- local effects of subprograms. | |
294ccb21 | 5079 | |
5114f3ff AC |
5080 | if Is_Object (E) |
5081 | and then Present (Renamed_Object (E)) | |
5082 | and then not SPARK_Mode | |
5083 | then | |
294ccb21 | 5084 | Generate_Reference (E, N); |
996ae0b0 | 5085 | |
21d27997 RD |
5086 | -- If the renamed entity is a private protected component, |
5087 | -- reference the original component as well. This needs to be | |
5088 | -- done because the private renamings are installed before any | |
f3d0f304 | 5089 | -- analysis has occurred. Reference to a private component will |
21d27997 RD |
5090 | -- resolve to the renaming and the original component will be |
5091 | -- left unreferenced, hence the following. | |
5092 | ||
5093 | if Is_Prival (E) then | |
5094 | Generate_Reference (Prival_Link (E), N); | |
5095 | end if; | |
5096 | ||
294ccb21 RD |
5097 | -- One odd case is that we do not want to set the Referenced flag |
5098 | -- if the entity is a label, and the identifier is the label in | |
5099 | -- the source, since this is not a reference from the point of | |
5100 | -- view of the user. | |
5101 | ||
5102 | elsif Nkind (Parent (N)) = N_Label then | |
996ae0b0 RK |
5103 | declare |
5104 | R : constant Boolean := Referenced (E); | |
294ccb21 | 5105 | |
996ae0b0 | 5106 | begin |
294ccb21 RD |
5107 | -- Generate reference unless this is an actual parameter |
5108 | -- (see comment below) | |
5109 | ||
5110 | if Is_Actual_Parameter then | |
67ce0d7e RD |
5111 | Generate_Reference (E, N); |
5112 | Set_Referenced (E, R); | |
5113 | end if; | |
996ae0b0 RK |
5114 | end; |
5115 | ||
11560bcc TQ |
5116 | -- Normal case, not a label: generate reference |
5117 | ||
61c161b2 AC |
5118 | -- ??? It is too early to generate a reference here even if the |
5119 | -- entity is unambiguous, because the tree is not sufficiently | |
5120 | -- typed at this point for Generate_Reference to determine | |
5121 | -- whether this reference modifies the denoted object (because | |
5122 | -- implicit dereferences cannot be identified prior to full type | |
5123 | -- resolution). | |
5124 | ||
21d27997 RD |
5125 | -- The Is_Actual_Parameter routine takes care of one of these |
5126 | -- cases but there are others probably ??? | |
61c161b2 | 5127 | |
84df40f7 | 5128 | -- If the entity is the LHS of an assignment, and is a variable |
61c161b2 | 5129 | -- (rather than a package prefix), we can mark it as a |
84df40f7 | 5130 | -- modification right away, to avoid duplicate references. |
fbf5a39b | 5131 | |
996ae0b0 | 5132 | else |
67ce0d7e | 5133 | if not Is_Actual_Parameter then |
84df40f7 AC |
5134 | if Is_LHS (N) |
5135 | and then Ekind (E) /= E_Package | |
5136 | and then Ekind (E) /= E_Generic_Package | |
5137 | then | |
5138 | Generate_Reference (E, N, 'm'); | |
5139 | else | |
5140 | Generate_Reference (E, N); | |
5141 | end if; | |
67ce0d7e RD |
5142 | end if; |
5143 | ||
fbe627af | 5144 | Check_Nested_Access (E); |
996ae0b0 RK |
5145 | end if; |
5146 | ||
4c484f40 | 5147 | Set_Entity_Or_Discriminal (N, E); |
d50f4827 | 5148 | |
27dd0dde ES |
5149 | -- The name may designate a generalized reference, in which case |
5150 | -- the dereference interpretation will be included. | |
5151 | ||
d50f4827 | 5152 | if Ada_Version >= Ada_2012 |
444acbdd AC |
5153 | and then |
5154 | (Nkind (Parent (N)) in N_Subexpr | |
73534138 AC |
5155 | or else Nkind_In (Parent (N), N_Object_Declaration, |
5156 | N_Assignment_Statement)) | |
d50f4827 AC |
5157 | then |
5158 | Check_Implicit_Dereference (N, Etype (E)); | |
5159 | end if; | |
996ae0b0 RK |
5160 | end if; |
5161 | end; | |
5162 | end Find_Direct_Name; | |
5163 | ||
5164 | ------------------------ | |
5165 | -- Find_Expanded_Name -- | |
5166 | ------------------------ | |
5167 | ||
5168 | -- This routine searches the homonym chain of the entity until it finds | |
5169 | -- an entity declared in the scope denoted by the prefix. If the entity | |
5170 | -- is private, it may nevertheless be immediately visible, if we are in | |
5171 | -- the scope of its declaration. | |
5172 | ||
5173 | procedure Find_Expanded_Name (N : Node_Id) is | |
07fc65c4 GB |
5174 | Selector : constant Node_Id := Selector_Name (N); |
5175 | Candidate : Entity_Id := Empty; | |
996ae0b0 | 5176 | P_Name : Entity_Id; |
996ae0b0 RK |
5177 | Id : Entity_Id; |
5178 | ||
5179 | begin | |
5180 | P_Name := Entity (Prefix (N)); | |
996ae0b0 | 5181 | |
ff81221b ES |
5182 | -- If the prefix is a renamed package, look for the entity in the |
5183 | -- original package. | |
996ae0b0 RK |
5184 | |
5185 | if Ekind (P_Name) = E_Package | |
5186 | and then Present (Renamed_Object (P_Name)) | |
5187 | then | |
5188 | P_Name := Renamed_Object (P_Name); | |
5189 | ||
5190 | -- Rewrite node with entity field pointing to renamed object | |
5191 | ||
5192 | Rewrite (Prefix (N), New_Copy (Prefix (N))); | |
5193 | Set_Entity (Prefix (N), P_Name); | |
5194 | ||
5195 | -- If the prefix is an object of a concurrent type, look for | |
5196 | -- the entity in the associated task or protected type. | |
5197 | ||
5198 | elsif Is_Concurrent_Type (Etype (P_Name)) then | |
5199 | P_Name := Etype (P_Name); | |
5200 | end if; | |
5201 | ||
5202 | Id := Current_Entity (Selector); | |
5203 | ||
923fa078 RD |
5204 | declare |
5205 | Is_New_Candidate : Boolean; | |
996ae0b0 | 5206 | |
923fa078 RD |
5207 | begin |
5208 | while Present (Id) loop | |
5209 | if Scope (Id) = P_Name then | |
5210 | Candidate := Id; | |
5211 | Is_New_Candidate := True; | |
5212 | ||
5213 | -- Ada 2005 (AI-217): Handle shadow entities associated with types | |
5214 | -- declared in limited-withed nested packages. We don't need to | |
5215 | -- handle E_Incomplete_Subtype entities because the entities in | |
5216 | -- the limited view are always E_Incomplete_Type entities (see | |
5217 | -- Build_Limited_Views). Regarding the expression used to evaluate | |
5218 | -- the scope, it is important to note that the limited view also | |
5219 | -- has shadow entities associated nested packages. For this reason | |
5220 | -- the correct scope of the entity is the scope of the real entity | |
11560bcc TQ |
5221 | -- The non-limited view may itself be incomplete, in which case |
5222 | -- get the full view if available. | |
923fa078 RD |
5223 | |
5224 | elsif From_With_Type (Id) | |
5225 | and then Is_Type (Id) | |
5226 | and then Ekind (Id) = E_Incomplete_Type | |
5227 | and then Present (Non_Limited_View (Id)) | |
5228 | and then Scope (Non_Limited_View (Id)) = P_Name | |
5229 | then | |
11560bcc | 5230 | Candidate := Get_Full_View (Non_Limited_View (Id)); |
923fa078 | 5231 | Is_New_Candidate := True; |
996ae0b0 RK |
5232 | |
5233 | else | |
923fa078 | 5234 | Is_New_Candidate := False; |
996ae0b0 | 5235 | end if; |
996ae0b0 | 5236 | |
923fa078 | 5237 | if Is_New_Candidate then |
8ca1ee5d | 5238 | if Is_Child_Unit (Id) or else P_Name = Standard_Standard then |
8398e82e | 5239 | exit when Is_Visible_Lib_Unit (Id); |
923fa078 | 5240 | else |
8398e82e | 5241 | exit when not Is_Hidden (Id); |
923fa078 | 5242 | end if; |
8398e82e AC |
5243 | |
5244 | exit when Is_Immediately_Visible (Id); | |
923fa078 RD |
5245 | end if; |
5246 | ||
5247 | Id := Homonym (Id); | |
5248 | end loop; | |
5249 | end; | |
996ae0b0 RK |
5250 | |
5251 | if No (Id) | |
ac7d724d | 5252 | and then Ekind_In (P_Name, E_Procedure, E_Function) |
996ae0b0 RK |
5253 | and then Is_Generic_Instance (P_Name) |
5254 | then | |
5255 | -- Expanded name denotes entity in (instance of) generic subprogram. | |
5256 | -- The entity may be in the subprogram instance, or may denote one of | |
5257 | -- the formals, which is declared in the enclosing wrapper package. | |
5258 | ||
5259 | P_Name := Scope (P_Name); | |
996ae0b0 | 5260 | |
bc41faa2 | 5261 | Id := Current_Entity (Selector); |
996ae0b0 | 5262 | while Present (Id) loop |
bc41faa2 | 5263 | exit when Scope (Id) = P_Name; |
996ae0b0 RK |
5264 | Id := Homonym (Id); |
5265 | end loop; | |
5266 | end if; | |
5267 | ||
bc41faa2 | 5268 | if No (Id) or else Chars (Id) /= Chars (Selector) then |
996ae0b0 RK |
5269 | Set_Etype (N, Any_Type); |
5270 | ||
ff81221b ES |
5271 | -- If we are looking for an entity defined in System, try to find it |
5272 | -- in the child package that may have been provided as an extension | |
5273 | -- to System. The Extend_System pragma will have supplied the name of | |
5274 | -- the extension, which may have to be loaded. | |
996ae0b0 RK |
5275 | |
5276 | if Chars (P_Name) = Name_System | |
5277 | and then Scope (P_Name) = Standard_Standard | |
fbf5a39b | 5278 | and then Present (System_Extend_Unit) |
996ae0b0 RK |
5279 | and then Present_System_Aux (N) |
5280 | then | |
5281 | Set_Entity (Prefix (N), System_Aux_Id); | |
5282 | Find_Expanded_Name (N); | |
5283 | return; | |
5284 | ||
fbf5a39b AC |
5285 | elsif Nkind (Selector) = N_Operator_Symbol |
5286 | and then Has_Implicit_Operator (N) | |
996ae0b0 RK |
5287 | then |
5288 | -- There is an implicit instance of the predefined operator in | |
5289 | -- the given scope. The operator entity is defined in Standard. | |
5290 | -- Has_Implicit_Operator makes the node into an Expanded_Name. | |
5291 | ||
5292 | return; | |
5293 | ||
5294 | elsif Nkind (Selector) = N_Character_Literal | |
5295 | and then Has_Implicit_Character_Literal (N) | |
5296 | then | |
5297 | -- If there is no literal defined in the scope denoted by the | |
5298 | -- prefix, the literal may belong to (a type derived from) | |
5299 | -- Standard_Character, for which we have no explicit literals. | |
5300 | ||
5301 | return; | |
5302 | ||
5303 | else | |
ff81221b ES |
5304 | -- If the prefix is a single concurrent object, use its name in |
5305 | -- the error message, rather than that of the anonymous type. | |
996ae0b0 RK |
5306 | |
5307 | if Is_Concurrent_Type (P_Name) | |
5308 | and then Is_Internal_Name (Chars (P_Name)) | |
5309 | then | |
5310 | Error_Msg_Node_2 := Entity (Prefix (N)); | |
5311 | else | |
5312 | Error_Msg_Node_2 := P_Name; | |
5313 | end if; | |
5314 | ||
5315 | if P_Name = System_Aux_Id then | |
5316 | P_Name := Scope (P_Name); | |
5317 | Set_Entity (Prefix (N), P_Name); | |
5318 | end if; | |
5319 | ||
5320 | if Present (Candidate) then | |
5321 | ||
16ca248a ES |
5322 | -- If we know that the unit is a child unit we can give a more |
5323 | -- accurate error message. | |
5324 | ||
996ae0b0 | 5325 | if Is_Child_Unit (Candidate) then |
edd63e9b | 5326 | |
16ca248a ES |
5327 | -- If the candidate is a private child unit and we are in |
5328 | -- the visible part of a public unit, specialize the error | |
5329 | -- message. There might be a private with_clause for it, | |
5330 | -- but it is not currently active. | |
edd63e9b ES |
5331 | |
5332 | if Is_Private_Descendant (Candidate) | |
5333 | and then Ekind (Current_Scope) = E_Package | |
5334 | and then not In_Private_Part (Current_Scope) | |
5335 | and then not Is_Private_Descendant (Current_Scope) | |
5336 | then | |
5337 | Error_Msg_N ("private child unit& is not visible here", | |
16ca248a ES |
5338 | Selector); |
5339 | ||
5340 | -- Normal case where we have a missing with for a child unit | |
5341 | ||
edd63e9b | 5342 | else |
16ca248a | 5343 | Error_Msg_Qual_Level := 99; |
ed2233dc AC |
5344 | Error_Msg_NE -- CODEFIX |
5345 | ("missing `WITH &;`", Selector, Candidate); | |
16ca248a | 5346 | Error_Msg_Qual_Level := 0; |
edd63e9b | 5347 | end if; |
16ca248a ES |
5348 | |
5349 | -- Here we don't know that this is a child unit | |
5350 | ||
996ae0b0 RK |
5351 | else |
5352 | Error_Msg_NE ("& is not a visible entity of&", N, Selector); | |
5353 | end if; | |
5354 | ||
5355 | else | |
5356 | -- Within the instantiation of a child unit, the prefix may | |
16ca248a | 5357 | -- denote the parent instance, but the selector has the name |
58747e48 AC |
5358 | -- of the original child. That is to say, when A.B appears |
5359 | -- within an instantiation of generic child unit B, the scope | |
5360 | -- stack includes an instance of A (P_Name) and an instance | |
5361 | -- of B under some other name. We scan the scope to find this | |
5362 | -- child instance, which is the desired entity. | |
5363 | -- Note that the parent may itself be a child instance, if | |
5364 | -- the reference is of the form A.B.C, in which case A.B has | |
5365 | -- already been rewritten with the proper entity. | |
5366 | ||
5367 | if In_Open_Scopes (P_Name) | |
996ae0b0 RK |
5368 | and then Is_Generic_Instance (P_Name) |
5369 | then | |
5370 | declare | |
58747e48 AC |
5371 | Gen_Par : constant Entity_Id := |
5372 | Generic_Parent (Specification | |
5373 | (Unit_Declaration_Node (P_Name))); | |
996ae0b0 RK |
5374 | S : Entity_Id := Current_Scope; |
5375 | P : Entity_Id; | |
5376 | ||
5377 | begin | |
5378 | for J in reverse 0 .. Scope_Stack.Last loop | |
5379 | S := Scope_Stack.Table (J).Entity; | |
5380 | ||
5381 | exit when S = Standard_Standard; | |
5382 | ||
bce79204 AC |
5383 | if Ekind_In (S, E_Function, |
5384 | E_Package, | |
5385 | E_Procedure) | |
996ae0b0 RK |
5386 | then |
5387 | P := Generic_Parent (Specification | |
5388 | (Unit_Declaration_Node (S))); | |
5389 | ||
58747e48 AC |
5390 | -- Check that P is a generic child of the generic |
5391 | -- parent of the prefix. | |
5392 | ||
996ae0b0 | 5393 | if Present (P) |
996ae0b0 | 5394 | and then Chars (P) = Chars (Selector) |
58747e48 | 5395 | and then Scope (P) = Gen_Par |
996ae0b0 RK |
5396 | then |
5397 | Id := S; | |
a77842bd | 5398 | goto Found; |
996ae0b0 RK |
5399 | end if; |
5400 | end if; | |
5401 | ||
5402 | end loop; | |
5403 | end; | |
5404 | end if; | |
5405 | ||
16ca248a ES |
5406 | -- If this is a selection from Ada, System or Interfaces, then |
5407 | -- we assume a missing with for the corresponding package. | |
5408 | ||
5409 | if Is_Known_Unit (N) then | |
fbe627af RD |
5410 | if not Error_Posted (N) then |
5411 | Error_Msg_Node_2 := Selector; | |
ed2233dc AC |
5412 | Error_Msg_N -- CODEFIX |
5413 | ("missing `WITH &.&;`", Prefix (N)); | |
fbe627af | 5414 | end if; |
996ae0b0 | 5415 | |
16ca248a ES |
5416 | -- If this is a selection from a dummy package, then suppress |
5417 | -- the error message, of course the entity is missing if the | |
5418 | -- package is missing! | |
996ae0b0 RK |
5419 | |
5420 | elsif Sloc (Error_Msg_Node_2) = No_Location then | |
5421 | null; | |
5422 | ||
5423 | -- Here we have the case of an undefined component | |
5424 | ||
5425 | else | |
d6a24cdb AC |
5426 | |
5427 | -- The prefix may hide a homonym in the context that | |
5428 | -- declares the desired entity. This error can use a | |
5429 | -- specialized message. | |
5430 | ||
8398e82e | 5431 | if In_Open_Scopes (P_Name) then |
d6a24cdb AC |
5432 | declare |
5433 | H : constant Entity_Id := Homonym (P_Name); | |
0d354370 | 5434 | |
d6a24cdb | 5435 | begin |
8398e82e AC |
5436 | if Present (H) |
5437 | and then Is_Compilation_Unit (H) | |
5438 | and then | |
5439 | (Is_Immediately_Visible (H) | |
5440 | or else Is_Visible_Lib_Unit (H)) | |
5441 | then | |
5442 | Id := First_Entity (H); | |
5443 | while Present (Id) loop | |
5444 | if Chars (Id) = Chars (Selector) then | |
5445 | Error_Msg_Qual_Level := 99; | |
5446 | Error_Msg_Name_1 := Chars (Selector); | |
5447 | Error_Msg_NE | |
5448 | ("% not declared in&", N, P_Name); | |
5449 | Error_Msg_NE | |
5450 | ("\use fully qualified name starting with " | |
5451 | & "Standard to make& visible", N, H); | |
5452 | Error_Msg_Qual_Level := 0; | |
5453 | goto Done; | |
5454 | end if; | |
d6a24cdb | 5455 | |
8398e82e AC |
5456 | Next_Entity (Id); |
5457 | end loop; | |
5458 | end if; | |
689cb4ac | 5459 | |
690943fc | 5460 | -- If not found, standard error message |
689cb4ac AC |
5461 | |
5462 | Error_Msg_NE ("& not declared in&", N, Selector); | |
5463 | ||
5464 | <<Done>> null; | |
d6a24cdb AC |
5465 | end; |
5466 | ||
5467 | else | |
5468 | Error_Msg_NE ("& not declared in&", N, Selector); | |
5469 | end if; | |
996ae0b0 | 5470 | |
bc41faa2 | 5471 | -- Check for misspelling of some entity in prefix |
996ae0b0 RK |
5472 | |
5473 | Id := First_Entity (P_Name); | |
294ccb21 RD |
5474 | while Present (Id) loop |
5475 | if Is_Bad_Spelling_Of (Chars (Id), Chars (Selector)) | |
5476 | and then not Is_Internal_Name (Chars (Id)) | |
5477 | then | |
deef4289 | 5478 | Error_Msg_NE -- CODEFIX |
294ccb21 RD |
5479 | ("possible misspelling of&", Selector, Id); |
5480 | exit; | |
5481 | end if; | |
996ae0b0 | 5482 | |
294ccb21 RD |
5483 | Next_Entity (Id); |
5484 | end loop; | |
996ae0b0 RK |
5485 | |
5486 | -- Specialize the message if this may be an instantiation | |
5487 | -- of a child unit that was not mentioned in the context. | |
5488 | ||
5489 | if Nkind (Parent (N)) = N_Package_Instantiation | |
5490 | and then Is_Generic_Instance (Entity (Prefix (N))) | |
5491 | and then Is_Compilation_Unit | |
294ccb21 | 5492 | (Generic_Parent (Parent (Entity (Prefix (N))))) |
996ae0b0 | 5493 | then |
16ca248a | 5494 | Error_Msg_Node_2 := Selector; |
ed2233dc AC |
5495 | Error_Msg_N -- CODEFIX |
5496 | ("\missing `WITH &.&;`", Prefix (N)); | |
996ae0b0 RK |
5497 | end if; |
5498 | end if; | |
5499 | end if; | |
5500 | ||
5501 | Id := Any_Id; | |
5502 | end if; | |
5503 | end if; | |
5504 | ||
a77842bd | 5505 | <<Found>> |
996ae0b0 RK |
5506 | if Comes_From_Source (N) |
5507 | and then Is_Remote_Access_To_Subprogram_Type (Id) | |
d1d81616 | 5508 | and then Ekind (Id) = E_Access_Subprogram_Type |
a77842bd | 5509 | and then Present (Equivalent_Type (Id)) |
996ae0b0 | 5510 | then |
16ca248a ES |
5511 | -- If we are not actually generating distribution code (i.e. the |
5512 | -- current PCS is the dummy non-distributed version), then the | |
5513 | -- Equivalent_Type will be missing, and Id should be treated as | |
5514 | -- a regular access-to-subprogram type. | |
a77842bd | 5515 | |
996ae0b0 RK |
5516 | Id := Equivalent_Type (Id); |
5517 | Set_Chars (Selector, Chars (Id)); | |
5518 | end if; | |
5519 | ||
0ab80019 | 5520 | -- Ada 2005 (AI-50217): Check usage of entities in limited withed units |
19f0526a | 5521 | |
ac7d724d | 5522 | if Ekind (P_Name) = E_Package and then From_With_Type (P_Name) then |
996ae0b0 | 5523 | if From_With_Type (Id) |
0fb2ea01 AC |
5524 | or else Is_Type (Id) |
5525 | or else Ekind (Id) = E_Package | |
996ae0b0 RK |
5526 | then |
5527 | null; | |
5528 | else | |
5529 | Error_Msg_N | |
657a9dd9 | 5530 | ("limited withed package can only be used to access " |
21d27997 | 5531 | & "incomplete types", |
996ae0b0 RK |
5532 | N); |
5533 | end if; | |
5534 | end if; | |
5535 | ||
5536 | if Is_Task_Type (P_Name) | |
5537 | and then ((Ekind (Id) = E_Entry | |
ac7d724d | 5538 | and then Nkind (Parent (N)) /= N_Attribute_Reference) |
294ccb21 | 5539 | or else |
ac7d724d ES |
5540 | (Ekind (Id) = E_Entry_Family |
5541 | and then | |
5542 | Nkind (Parent (Parent (N))) /= N_Attribute_Reference)) | |
996ae0b0 | 5543 | then |
a53c5613 AC |
5544 | -- If both the task type and the entry are in scope, this may still |
5545 | -- be the expanded name of an entry formal. | |
996ae0b0 | 5546 | |
a53c5613 AC |
5547 | if In_Open_Scopes (Id) |
5548 | and then Nkind (Parent (N)) = N_Selected_Component | |
5549 | then | |
5550 | null; | |
5551 | ||
5552 | else | |
5553 | -- It is an entry call after all, either to the current task | |
5554 | -- (which will deadlock) or to an enclosing task. | |
5555 | ||
5556 | Analyze_Selected_Component (N); | |
5557 | return; | |
5558 | end if; | |
996ae0b0 RK |
5559 | end if; |
5560 | ||
5561 | Change_Selected_Component_To_Expanded_Name (N); | |
07fc65c4 GB |
5562 | |
5563 | -- Do style check and generate reference, but skip both steps if this | |
16ca248a ES |
5564 | -- entity has homonyms, since we may not have the right homonym set yet. |
5565 | -- The proper homonym will be set during the resolve phase. | |
07fc65c4 GB |
5566 | |
5567 | if Has_Homonym (Id) then | |
5568 | Set_Entity (N, Id); | |
5569 | else | |
4c484f40 | 5570 | Set_Entity_Or_Discriminal (N, Id); |
84df40f7 AC |
5571 | |
5572 | if Is_LHS (N) then | |
5573 | Generate_Reference (Id, N, 'm'); | |
5574 | else | |
5575 | Generate_Reference (Id, N); | |
5576 | end if; | |
07fc65c4 | 5577 | end if; |
996ae0b0 RK |
5578 | |
5579 | if Is_Type (Id) then | |
5580 | Set_Etype (N, Id); | |
5581 | else | |
5582 | Set_Etype (N, Get_Full_View (Etype (Id))); | |
5583 | end if; | |
5584 | ||
30196a76 RD |
5585 | -- Check for violation of No_Wide_Characters |
5586 | ||
5587 | Check_Wide_Character_Restriction (Id, N); | |
5588 | ||
16ca248a ES |
5589 | -- If the Ekind of the entity is Void, it means that all homonyms are |
5590 | -- hidden from all visibility (RM 8.3(5,14-20)). | |
996ae0b0 RK |
5591 | |
5592 | if Ekind (Id) = E_Void then | |
5593 | Premature_Usage (N); | |
5594 | ||
ac7d724d | 5595 | elsif Is_Overloadable (Id) and then Present (Homonym (Id)) then |
996ae0b0 RK |
5596 | declare |
5597 | H : Entity_Id := Homonym (Id); | |
5598 | ||
5599 | begin | |
5600 | while Present (H) loop | |
35ae2ed8 | 5601 | if Scope (H) = Scope (Id) |
ac7d724d ES |
5602 | and then (not Is_Hidden (H) |
5603 | or else Is_Immediately_Visible (H)) | |
35ae2ed8 | 5604 | then |
996ae0b0 RK |
5605 | Collect_Interps (N); |
5606 | exit; | |
5607 | end if; | |
5608 | ||
5609 | H := Homonym (H); | |
5610 | end loop; | |
fbf5a39b | 5611 | |
16ca248a ES |
5612 | -- If an extension of System is present, collect possible explicit |
5613 | -- overloadings declared in the extension. | |
fbf5a39b AC |
5614 | |
5615 | if Chars (P_Name) = Name_System | |
5616 | and then Scope (P_Name) = Standard_Standard | |
5617 | and then Present (System_Extend_Unit) | |
5618 | and then Present_System_Aux (N) | |
5619 | then | |
5620 | H := Current_Entity (Id); | |
5621 | ||
5622 | while Present (H) loop | |
5623 | if Scope (H) = System_Aux_Id then | |
5624 | Add_One_Interp (N, H, Etype (H)); | |
5625 | end if; | |
5626 | ||
5627 | H := Homonym (H); | |
5628 | end loop; | |
5629 | end if; | |
996ae0b0 RK |
5630 | end; |
5631 | end if; | |
5632 | ||
5633 | if Nkind (Selector_Name (N)) = N_Operator_Symbol | |
5634 | and then Scope (Id) /= Standard_Standard | |
5635 | then | |
16ca248a ES |
5636 | -- In addition to user-defined operators in the given scope, there |
5637 | -- may be an implicit instance of the predefined operator. The | |
5638 | -- operator (defined in Standard) is found in Has_Implicit_Operator, | |
5639 | -- and added to the interpretations. Procedure Add_One_Interp will | |
5640 | -- determine which hides which. | |
996ae0b0 RK |
5641 | |
5642 | if Has_Implicit_Operator (N) then | |
5643 | null; | |
5644 | end if; | |
5645 | end if; | |
be4c5193 AC |
5646 | |
5647 | -- If there is a single interpretation for N we can generate a | |
5648 | -- reference to the unique entity found. | |
5649 | ||
5650 | if Is_Overloadable (Id) and then not Is_Overloaded (N) then | |
5651 | Generate_Reference (Id, N); | |
5652 | end if; | |
996ae0b0 RK |
5653 | end Find_Expanded_Name; |
5654 | ||
5655 | ------------------------- | |
5656 | -- Find_Renamed_Entity -- | |
5657 | ------------------------- | |
5658 | ||
5659 | function Find_Renamed_Entity | |
5660 | (N : Node_Id; | |
5661 | Nam : Node_Id; | |
5662 | New_S : Entity_Id; | |
5663 | Is_Actual : Boolean := False) return Entity_Id | |
5664 | is | |
fbf5a39b | 5665 | Ind : Interp_Index; |
996ae0b0 RK |
5666 | I1 : Interp_Index := 0; -- Suppress junk warnings |
5667 | It : Interp; | |
5668 | It1 : Interp; | |
5669 | Old_S : Entity_Id; | |
5670 | Inst : Entity_Id; | |
5671 | ||
996ae0b0 RK |
5672 | function Is_Visible_Operation (Op : Entity_Id) return Boolean; |
5673 | -- If the renamed entity is an implicit operator, check whether it is | |
16ca248a ES |
5674 | -- visible because its operand type is properly visible. This check |
5675 | -- applies to explicit renamed entities that appear in the source in a | |
5676 | -- renaming declaration or a formal subprogram instance, but not to | |
5677 | -- default generic actuals with a name. | |
996ae0b0 | 5678 | |
923fa078 RD |
5679 | function Report_Overload return Entity_Id; |
5680 | -- List possible interpretations, and specialize message in the | |
5681 | -- case of a generic actual. | |
5682 | ||
5683 | function Within (Inner, Outer : Entity_Id) return Boolean; | |
16ca248a ES |
5684 | -- Determine whether a candidate subprogram is defined within the |
5685 | -- enclosing instance. If yes, it has precedence over outer candidates. | |
923fa078 | 5686 | |
996ae0b0 RK |
5687 | -------------------------- |
5688 | -- Is_Visible_Operation -- | |
5689 | -------------------------- | |
5690 | ||
5691 | function Is_Visible_Operation (Op : Entity_Id) return Boolean is | |
5692 | Scop : Entity_Id; | |
5693 | Typ : Entity_Id; | |
5694 | Btyp : Entity_Id; | |
5695 | ||
5696 | begin | |
5697 | if Ekind (Op) /= E_Operator | |
5698 | or else Scope (Op) /= Standard_Standard | |
5699 | or else (In_Instance | |
ac7d724d ES |
5700 | and then (not Is_Actual |
5701 | or else Present (Enclosing_Instance))) | |
996ae0b0 RK |
5702 | then |
5703 | return True; | |
5704 | ||
5705 | else | |
5706 | -- For a fixed point type operator, check the resulting type, | |
5707 | -- because it may be a mixed mode integer * fixed operation. | |
5708 | ||
5709 | if Present (Next_Formal (First_Formal (New_S))) | |
5710 | and then Is_Fixed_Point_Type (Etype (New_S)) | |
5711 | then | |
5712 | Typ := Etype (New_S); | |
5713 | else | |
5714 | Typ := Etype (First_Formal (New_S)); | |
5715 | end if; | |
5716 | ||
5717 | Btyp := Base_Type (Typ); | |
5718 | ||
5719 | if Nkind (Nam) /= N_Expanded_Name then | |
5720 | return (In_Open_Scopes (Scope (Btyp)) | |
5721 | or else Is_Potentially_Use_Visible (Btyp) | |
5722 | or else In_Use (Btyp) | |
5723 | or else In_Use (Scope (Btyp))); | |
5724 | ||
5725 | else | |
5726 | Scop := Entity (Prefix (Nam)); | |
5727 | ||
5728 | if Ekind (Scop) = E_Package | |
5729 | and then Present (Renamed_Object (Scop)) | |
5730 | then | |
5731 | Scop := Renamed_Object (Scop); | |
5732 | end if; | |
5733 | ||
5734 | -- Operator is visible if prefix of expanded name denotes | |
16b05213 | 5735 | -- scope of type, or else type is defined in System_Aux |
996ae0b0 RK |
5736 | -- and the prefix denotes System. |
5737 | ||
5738 | return Scope (Btyp) = Scop | |
5739 | or else (Scope (Btyp) = System_Aux_Id | |
5740 | and then Scope (Scope (Btyp)) = Scop); | |
5741 | end if; | |
5742 | end if; | |
5743 | end Is_Visible_Operation; | |
5744 | ||
5745 | ------------ | |
5746 | -- Within -- | |
5747 | ------------ | |
5748 | ||
5749 | function Within (Inner, Outer : Entity_Id) return Boolean is | |
16ca248a | 5750 | Sc : Entity_Id; |
996ae0b0 RK |
5751 | |
5752 | begin | |
16ca248a | 5753 | Sc := Scope (Inner); |
996ae0b0 | 5754 | while Sc /= Standard_Standard loop |
996ae0b0 RK |
5755 | if Sc = Outer then |
5756 | return True; | |
5757 | else | |
5758 | Sc := Scope (Sc); | |
5759 | end if; | |
5760 | end loop; | |
5761 | ||
5762 | return False; | |
5763 | end Within; | |
5764 | ||
923fa078 RD |
5765 | --------------------- |
5766 | -- Report_Overload -- | |
5767 | --------------------- | |
fbf5a39b AC |
5768 | |
5769 | function Report_Overload return Entity_Id is | |
5770 | begin | |
5771 | if Is_Actual then | |
ed2233dc | 5772 | Error_Msg_NE -- CODEFIX |
fbf5a39b | 5773 | ("ambiguous actual subprogram&, " & |
923fa078 | 5774 | "possible interpretations:", N, Nam); |
fbf5a39b | 5775 | else |
ed2233dc | 5776 | Error_Msg_N -- CODEFIX |
fbf5a39b | 5777 | ("ambiguous subprogram, " & |
923fa078 | 5778 | "possible interpretations:", N); |
fbf5a39b AC |
5779 | end if; |
5780 | ||
5781 | List_Interps (Nam, N); | |
5782 | return Old_S; | |
5783 | end Report_Overload; | |
5784 | ||
0187b60e | 5785 | -- Start of processing for Find_Renamed_Entity |
996ae0b0 RK |
5786 | |
5787 | begin | |
5788 | Old_S := Any_Id; | |
5789 | Candidate_Renaming := Empty; | |
5790 | ||
5791 | if not Is_Overloaded (Nam) then | |
ac7d724d ES |
5792 | if Is_Actual and then Present (Enclosing_Instance) then |
5793 | Old_S := Entity (Nam); | |
5794 | ||
5795 | elsif Entity_Matches_Spec (Entity (Nam), New_S) then | |
70b70ce8 AC |
5796 | Candidate_Renaming := New_S; |
5797 | ||
5798 | if Is_Visible_Operation (Entity (Nam)) then | |
5799 | Old_S := Entity (Nam); | |
5800 | end if; | |
996ae0b0 RK |
5801 | |
5802 | elsif | |
5803 | Present (First_Formal (Entity (Nam))) | |
5804 | and then Present (First_Formal (New_S)) | |
ac7d724d ES |
5805 | and then (Base_Type (Etype (First_Formal (Entity (Nam)))) = |
5806 | Base_Type (Etype (First_Formal (New_S)))) | |
996ae0b0 RK |
5807 | then |
5808 | Candidate_Renaming := Entity (Nam); | |
5809 | end if; | |
5810 | ||
5811 | else | |
fbf5a39b | 5812 | Get_First_Interp (Nam, Ind, It); |
996ae0b0 | 5813 | while Present (It.Nam) loop |
996ae0b0 RK |
5814 | if Entity_Matches_Spec (It.Nam, New_S) |
5815 | and then Is_Visible_Operation (It.Nam) | |
5816 | then | |
5817 | if Old_S /= Any_Id then | |
5818 | ||
5819 | -- Note: The call to Disambiguate only happens if a | |
5820 | -- previous interpretation was found, in which case I1 | |
5821 | -- has received a value. | |
5822 | ||
fbf5a39b | 5823 | It1 := Disambiguate (Nam, I1, Ind, Etype (Old_S)); |
996ae0b0 RK |
5824 | |
5825 | if It1 = No_Interp then | |
996ae0b0 RK |
5826 | Inst := Enclosing_Instance; |
5827 | ||
5828 | if Present (Inst) then | |
996ae0b0 | 5829 | if Within (It.Nam, Inst) then |
444acbdd AC |
5830 | if Within (Old_S, Inst) then |
5831 | ||
5832 | -- Choose the innermost subprogram, which would | |
5833 | -- have hidden the outer one in the generic. | |
5834 | ||
5835 | if Scope_Depth (It.Nam) < | |
5836 | Scope_Depth (Old_S) | |
5837 | then | |
5838 | return Old_S; | |
444acbdd AC |
5839 | else |
5840 | return It.Nam; | |
5841 | end if; | |
5842 | end if; | |
5843 | ||
996ae0b0 RK |
5844 | elsif Within (Old_S, Inst) then |
5845 | return (Old_S); | |
444acbdd | 5846 | |
996ae0b0 | 5847 | else |
fbf5a39b | 5848 | return Report_Overload; |
996ae0b0 RK |
5849 | end if; |
5850 | ||
3ddd922e | 5851 | -- If not within an instance, ambiguity is real |
444acbdd | 5852 | |
996ae0b0 | 5853 | else |
fbf5a39b | 5854 | return Report_Overload; |
996ae0b0 RK |
5855 | end if; |
5856 | ||
5857 | else | |
5858 | Old_S := It1.Nam; | |
5859 | exit; | |
5860 | end if; | |
5861 | ||
5862 | else | |
fbf5a39b | 5863 | I1 := Ind; |
996ae0b0 RK |
5864 | Old_S := It.Nam; |
5865 | end if; | |
5866 | ||
5867 | elsif | |
5868 | Present (First_Formal (It.Nam)) | |
5869 | and then Present (First_Formal (New_S)) | |
ac7d724d ES |
5870 | and then (Base_Type (Etype (First_Formal (It.Nam))) = |
5871 | Base_Type (Etype (First_Formal (New_S)))) | |
996ae0b0 RK |
5872 | then |
5873 | Candidate_Renaming := It.Nam; | |
5874 | end if; | |
5875 | ||
fbf5a39b | 5876 | Get_Next_Interp (Ind, It); |
996ae0b0 RK |
5877 | end loop; |
5878 | ||
5879 | Set_Entity (Nam, Old_S); | |
1138cf59 AC |
5880 | |
5881 | if Old_S /= Any_Id then | |
5882 | Set_Is_Overloaded (Nam, False); | |
5883 | end if; | |
996ae0b0 RK |
5884 | end if; |
5885 | ||
5886 | return Old_S; | |
5887 | end Find_Renamed_Entity; | |
5888 | ||
5889 | ----------------------------- | |
5890 | -- Find_Selected_Component -- | |
5891 | ----------------------------- | |
5892 | ||
5893 | procedure Find_Selected_Component (N : Node_Id) is | |
fbf5a39b | 5894 | P : constant Node_Id := Prefix (N); |
996ae0b0 RK |
5895 | |
5896 | P_Name : Entity_Id; | |
5897 | -- Entity denoted by prefix | |
5898 | ||
5899 | P_Type : Entity_Id; | |
5900 | -- and its type | |
5901 | ||
5902 | Nam : Node_Id; | |
5903 | ||
5904 | begin | |
5905 | Analyze (P); | |
5906 | ||
5907 | if Nkind (P) = N_Error then | |
5908 | return; | |
23685ae6 AC |
5909 | end if; |
5910 | ||
5911 | -- Selector name cannot be a character literal or an operator symbol in | |
db72f10a | 5912 | -- SPARK, except for the operator symbol in a renaming. |
23685ae6 | 5913 | |
6480338a | 5914 | if Restriction_Check_Required (SPARK_05) then |
23685ae6 | 5915 | if Nkind (Selector_Name (N)) = N_Character_Literal then |
2ba431e5 | 5916 | Check_SPARK_Restriction |
23685ae6 | 5917 | ("character literal cannot be prefixed", N); |
db72f10a AC |
5918 | elsif Nkind (Selector_Name (N)) = N_Operator_Symbol |
5919 | and then Nkind (Parent (N)) /= N_Subprogram_Renaming_Declaration | |
5920 | then | |
2ba431e5 | 5921 | Check_SPARK_Restriction ("operator symbol cannot be prefixed", N); |
23685ae6 AC |
5922 | end if; |
5923 | end if; | |
996ae0b0 | 5924 | |
16ca248a ES |
5925 | -- If the selector already has an entity, the node has been constructed |
5926 | -- in the course of expansion, and is known to be valid. Do not verify | |
5927 | -- that it is defined for the type (it may be a private component used | |
5928 | -- in the expansion of record equality). | |
996ae0b0 | 5929 | |
23685ae6 | 5930 | if Present (Entity (Selector_Name (N))) then |
996ae0b0 RK |
5931 | if No (Etype (N)) |
5932 | or else Etype (N) = Any_Type | |
5933 | then | |
5934 | declare | |
fbf5a39b AC |
5935 | Sel_Name : constant Node_Id := Selector_Name (N); |
5936 | Selector : constant Entity_Id := Entity (Sel_Name); | |
996ae0b0 RK |
5937 | C_Etype : Node_Id; |
5938 | ||
5939 | begin | |
5940 | Set_Etype (Sel_Name, Etype (Selector)); | |
5941 | ||
5942 | if not Is_Entity_Name (P) then | |
fbf5a39b | 5943 | Resolve (P); |
996ae0b0 RK |
5944 | end if; |
5945 | ||
5946 | -- Build an actual subtype except for the first parameter | |
fbf5a39b | 5947 | -- of an init proc, where this actual subtype is by |
996ae0b0 RK |
5948 | -- definition incorrect, since the object is uninitialized |
5949 | -- (and does not even have defined discriminants etc.) | |
5950 | ||
5951 | if Is_Entity_Name (P) | |
5952 | and then Ekind (Entity (P)) = E_Function | |
5953 | then | |
5954 | Nam := New_Copy (P); | |
5955 | ||
5956 | if Is_Overloaded (P) then | |
5957 | Save_Interps (P, Nam); | |
5958 | end if; | |
5959 | ||
5960 | Rewrite (P, | |
5961 | Make_Function_Call (Sloc (P), Name => Nam)); | |
5962 | Analyze_Call (P); | |
5963 | Analyze_Selected_Component (N); | |
5964 | return; | |
5965 | ||
5966 | elsif Ekind (Selector) = E_Component | |
5967 | and then (not Is_Entity_Name (P) | |
5968 | or else Chars (Entity (P)) /= Name_uInit) | |
5969 | then | |
9fc2854d AC |
5970 | -- Do not build the subtype when referencing components of |
5971 | -- dispatch table wrappers. Required to avoid generating | |
df3e68b1 HK |
5972 | -- elaboration code with HI runtimes. JVM and .NET use a |
5973 | -- modified version of Ada.Tags which does not contain RE_ | |
5974 | -- Dispatch_Table_Wrapper and RE_No_Dispatch_Table_Wrapper. | |
5975 | -- Avoid raising RE_Not_Available exception in those cases. | |
9fc2854d | 5976 | |
df3e68b1 HK |
5977 | if VM_Target = No_VM |
5978 | and then RTU_Loaded (Ada_Tags) | |
5979 | and then | |
5980 | ((RTE_Available (RE_Dispatch_Table_Wrapper) | |
2c1b72d7 | 5981 | and then Scope (Selector) = |
df3e68b1 | 5982 | RTE (RE_Dispatch_Table_Wrapper)) |
ac7d724d ES |
5983 | or else |
5984 | (RTE_Available (RE_No_Dispatch_Table_Wrapper) | |
5985 | and then Scope (Selector) = | |
5986 | RTE (RE_No_Dispatch_Table_Wrapper))) | |
9fc2854d AC |
5987 | then |
5988 | C_Etype := Empty; | |
5989 | ||
5990 | else | |
5991 | C_Etype := | |
2c1b72d7 AC |
5992 | Build_Actual_Subtype_Of_Component |
5993 | (Etype (Selector), N); | |
9fc2854d AC |
5994 | end if; |
5995 | ||
996ae0b0 RK |
5996 | else |
5997 | C_Etype := Empty; | |
5998 | end if; | |
5999 | ||
6000 | if No (C_Etype) then | |
6001 | C_Etype := Etype (Selector); | |
6002 | else | |
6003 | Insert_Action (N, C_Etype); | |
6004 | C_Etype := Defining_Identifier (C_Etype); | |
6005 | end if; | |
6006 | ||
6007 | Set_Etype (N, C_Etype); | |
6008 | end; | |
6009 | ||
6010 | -- If this is the name of an entry or protected operation, and | |
6011 | -- the prefix is an access type, insert an explicit dereference, | |
6012 | -- so that entry calls are treated uniformly. | |
6013 | ||
6014 | if Is_Access_Type (Etype (P)) | |
6015 | and then Is_Concurrent_Type (Designated_Type (Etype (P))) | |
6016 | then | |
6017 | declare | |
fbf5a39b AC |
6018 | New_P : constant Node_Id := |
6019 | Make_Explicit_Dereference (Sloc (P), | |
6020 | Prefix => Relocate_Node (P)); | |
996ae0b0 RK |
6021 | begin |
6022 | Rewrite (P, New_P); | |
6023 | Set_Etype (P, Designated_Type (Etype (Prefix (P)))); | |
6024 | end; | |
6025 | end if; | |
6026 | ||
6027 | -- If the selected component appears within a default expression | |
6028 | -- and it has an actual subtype, the pre-analysis has not yet | |
6029 | -- completed its analysis, because Insert_Actions is disabled in | |
fbf5a39b | 6030 | -- that context. Within the init proc of the enclosing type we |
996ae0b0 RK |
6031 | -- must complete this analysis, if an actual subtype was created. |
6032 | ||
6033 | elsif Inside_Init_Proc then | |
6034 | declare | |
6035 | Typ : constant Entity_Id := Etype (N); | |
6036 | Decl : constant Node_Id := Declaration_Node (Typ); | |
996ae0b0 RK |
6037 | begin |
6038 | if Nkind (Decl) = N_Subtype_Declaration | |
6039 | and then not Analyzed (Decl) | |
6040 | and then Is_List_Member (Decl) | |
6041 | and then No (Parent (Decl)) | |
6042 | then | |
6043 | Remove (Decl); | |
6044 | Insert_Action (N, Decl); | |
6045 | end if; | |
6046 | end; | |
6047 | end if; | |
6048 | ||
6049 | return; | |
6050 | ||
6051 | elsif Is_Entity_Name (P) then | |
6052 | P_Name := Entity (P); | |
6053 | ||
6054 | -- The prefix may denote an enclosing type which is the completion | |
6055 | -- of an incomplete type declaration. | |
6056 | ||
6057 | if Is_Type (P_Name) then | |
6058 | Set_Entity (P, Get_Full_View (P_Name)); | |
6059 | Set_Etype (P, Entity (P)); | |
6060 | P_Name := Entity (P); | |
6061 | end if; | |
6062 | ||
6063 | P_Type := Base_Type (Etype (P)); | |
6064 | ||
6065 | if Debug_Flag_E then | |
6066 | Write_Str ("Found prefix type to be "); | |
6067 | Write_Entity_Info (P_Type, " "); Write_Eol; | |
6068 | end if; | |
6069 | ||
6070 | -- First check for components of a record object (not the | |
6071 | -- result of a call, which is handled below). | |
6072 | ||
6073 | if Is_Appropriate_For_Record (P_Type) | |
6074 | and then not Is_Overloadable (P_Name) | |
6075 | and then not Is_Type (P_Name) | |
6076 | then | |
6077 | -- Selected component of record. Type checking will validate | |
6078 | -- name of selector. | |
dbfeb4fa RD |
6079 | |
6080 | -- ??? Could we rewrite an implicit dereference into an explicit | |
11560bcc | 6081 | -- one here? |
996ae0b0 RK |
6082 | |
6083 | Analyze_Selected_Component (N); | |
6084 | ||
f6b5dc8e AC |
6085 | -- Reference to type name in predicate/invariant expression |
6086 | ||
996ae0b0 RK |
6087 | elsif Is_Appropriate_For_Entry_Prefix (P_Type) |
6088 | and then not In_Open_Scopes (P_Name) | |
6089 | and then (not Is_Concurrent_Type (Etype (P_Name)) | |
ac7d724d | 6090 | or else not In_Open_Scopes (Etype (P_Name))) |
996ae0b0 RK |
6091 | then |
6092 | -- Call to protected operation or entry. Type checking is | |
6093 | -- needed on the prefix. | |
6094 | ||
6095 | Analyze_Selected_Component (N); | |
6096 | ||
6097 | elsif (In_Open_Scopes (P_Name) | |
f6b5dc8e AC |
6098 | and then Ekind (P_Name) /= E_Void |
6099 | and then not Is_Overloadable (P_Name)) | |
996ae0b0 | 6100 | or else (Is_Concurrent_Type (Etype (P_Name)) |
f6b5dc8e | 6101 | and then In_Open_Scopes (Etype (P_Name))) |
996ae0b0 RK |
6102 | then |
6103 | -- Prefix denotes an enclosing loop, block, or task, i.e. an | |
6104 | -- enclosing construct that is not a subprogram or accept. | |
6105 | ||
6106 | Find_Expanded_Name (N); | |
6107 | ||
6108 | elsif Ekind (P_Name) = E_Package then | |
6109 | Find_Expanded_Name (N); | |
6110 | ||
6111 | elsif Is_Overloadable (P_Name) then | |
6112 | ||
6113 | -- The subprogram may be a renaming (of an enclosing scope) as | |
6114 | -- in the case of the name of the generic within an instantiation. | |
6115 | ||
f6b5dc8e | 6116 | if Ekind_In (P_Name, E_Procedure, E_Function) |
996ae0b0 RK |
6117 | and then Present (Alias (P_Name)) |
6118 | and then Is_Generic_Instance (Alias (P_Name)) | |
6119 | then | |
6120 | P_Name := Alias (P_Name); | |
6121 | end if; | |
6122 | ||
6123 | if Is_Overloaded (P) then | |
6124 | ||
bc41faa2 | 6125 | -- The prefix must resolve to a unique enclosing construct |
996ae0b0 RK |
6126 | |
6127 | declare | |
6128 | Found : Boolean := False; | |
fbf5a39b | 6129 | Ind : Interp_Index; |
996ae0b0 RK |
6130 | It : Interp; |
6131 | ||
6132 | begin | |
fbf5a39b | 6133 | Get_First_Interp (P, Ind, It); |
996ae0b0 | 6134 | while Present (It.Nam) loop |
996ae0b0 RK |
6135 | if In_Open_Scopes (It.Nam) then |
6136 | if Found then | |
6137 | Error_Msg_N ( | |
6138 | "prefix must be unique enclosing scope", N); | |
6139 | Set_Entity (N, Any_Id); | |
6140 | Set_Etype (N, Any_Type); | |
6141 | return; | |
6142 | ||
6143 | else | |
6144 | Found := True; | |
6145 | P_Name := It.Nam; | |
6146 | end if; | |
6147 | end if; | |
6148 | ||
fbf5a39b | 6149 | Get_Next_Interp (Ind, It); |
996ae0b0 RK |
6150 | end loop; |
6151 | end; | |
6152 | end if; | |
6153 | ||
6154 | if In_Open_Scopes (P_Name) then | |
6155 | Set_Entity (P, P_Name); | |
6156 | Set_Is_Overloaded (P, False); | |
6157 | Find_Expanded_Name (N); | |
6158 | ||
6159 | else | |
6160 | -- If no interpretation as an expanded name is possible, it | |
6161 | -- must be a selected component of a record returned by a | |
16ca248a ES |
6162 | -- function call. Reformat prefix as a function call, the rest |
6163 | -- is done by type resolution. If the prefix is procedure or | |
6164 | -- entry, as is P.X; this is an error. | |
996ae0b0 RK |
6165 | |
6166 | if Ekind (P_Name) /= E_Function | |
ac7d724d ES |
6167 | and then |
6168 | (not Is_Overloaded (P) | |
6169 | or else Nkind (Parent (N)) = N_Procedure_Call_Statement) | |
996ae0b0 | 6170 | then |
996ae0b0 | 6171 | -- Prefix may mention a package that is hidden by a local |
290986ed GB |
6172 | -- declaration: let the user know. Scan the full homonym |
6173 | -- chain, the candidate package may be anywhere on it. | |
996ae0b0 | 6174 | |
290986ed GB |
6175 | if Present (Homonym (Current_Entity (P_Name))) then |
6176 | ||
6177 | P_Name := Current_Entity (P_Name); | |
996ae0b0 RK |
6178 | |
6179 | while Present (P_Name) loop | |
6180 | exit when Ekind (P_Name) = E_Package; | |
6181 | P_Name := Homonym (P_Name); | |
6182 | end loop; | |
6183 | ||
6184 | if Present (P_Name) then | |
6185 | Error_Msg_Sloc := Sloc (Entity (Prefix (N))); | |
6186 | ||
6187 | Error_Msg_NE | |
6188 | ("package& is hidden by declaration#", | |
6189 | N, P_Name); | |
6190 | ||
6191 | Set_Entity (Prefix (N), P_Name); | |
6192 | Find_Expanded_Name (N); | |
6193 | return; | |
6194 | else | |
6195 | P_Name := Entity (Prefix (N)); | |
6196 | end if; | |
6197 | end if; | |
6198 | ||
6199 | Error_Msg_NE | |
6200 | ("invalid prefix in selected component&", N, P_Name); | |
6201 | Change_Selected_Component_To_Expanded_Name (N); | |
6202 | Set_Entity (N, Any_Id); | |
6203 | Set_Etype (N, Any_Type); | |
6204 | ||
6205 | else | |
6206 | Nam := New_Copy (P); | |
6207 | Save_Interps (P, Nam); | |
6208 | Rewrite (P, | |
6209 | Make_Function_Call (Sloc (P), Name => Nam)); | |
6210 | Analyze_Call (P); | |
6211 | Analyze_Selected_Component (N); | |
6212 | end if; | |
6213 | end if; | |
6214 | ||
6215 | -- Remaining cases generate various error messages | |
6216 | ||
6217 | else | |
6218 | -- Format node as expanded name, to avoid cascaded errors | |
6219 | ||
fbf5a39b | 6220 | Change_Selected_Component_To_Expanded_Name (N); |
996ae0b0 RK |
6221 | Set_Entity (N, Any_Id); |
6222 | Set_Etype (N, Any_Type); | |
6223 | ||
996ae0b0 RK |
6224 | -- Issue error message, but avoid this if error issued already. |
6225 | -- Use identifier of prefix if one is available. | |
6226 | ||
6227 | if P_Name = Any_Id then | |
6228 | null; | |
6229 | ||
6230 | elsif Ekind (P_Name) = E_Void then | |
6231 | Premature_Usage (P); | |
6232 | ||
6233 | elsif Nkind (P) /= N_Attribute_Reference then | |
6234 | Error_Msg_N ( | |
6235 | "invalid prefix in selected component&", P); | |
6236 | ||
9596236a AC |
6237 | if Is_Access_Type (P_Type) |
6238 | and then Ekind (Designated_Type (P_Type)) = E_Incomplete_Type | |
6239 | then | |
65356e64 AC |
6240 | Error_Msg_N |
6241 | ("\dereference must not be of an incomplete type " & | |
11560bcc | 6242 | "(RM 3.10.1)", P); |
9596236a AC |
6243 | end if; |
6244 | ||
996ae0b0 RK |
6245 | else |
6246 | Error_Msg_N ( | |
6247 | "invalid prefix in selected component", P); | |
6248 | end if; | |
6249 | end if; | |
6250 | ||
db72f10a AC |
6251 | -- Selector name is restricted in SPARK |
6252 | ||
6253 | if Nkind (N) = N_Expanded_Name | |
6480338a | 6254 | and then Restriction_Check_Required (SPARK_05) |
db72f10a AC |
6255 | then |
6256 | if Is_Subprogram (P_Name) then | |
2ba431e5 | 6257 | Check_SPARK_Restriction |
db72f10a AC |
6258 | ("prefix of expanded name cannot be a subprogram", P); |
6259 | elsif Ekind (P_Name) = E_Loop then | |
2ba431e5 | 6260 | Check_SPARK_Restriction |
db72f10a AC |
6261 | ("prefix of expanded name cannot be a loop statement", P); |
6262 | end if; | |
6263 | end if; | |
6264 | ||
996ae0b0 RK |
6265 | else |
6266 | -- If prefix is not the name of an entity, it must be an expression, | |
6267 | -- whose type is appropriate for a record. This is determined by | |
6268 | -- type resolution. | |
6269 | ||
6270 | Analyze_Selected_Component (N); | |
6271 | end if; | |
0929eaeb AC |
6272 | |
6273 | Analyze_Dimension (N); | |
996ae0b0 RK |
6274 | end Find_Selected_Component; |
6275 | ||
6276 | --------------- | |
6277 | -- Find_Type -- | |
6278 | --------------- | |
6279 | ||
6280 | procedure Find_Type (N : Node_Id) is | |
6281 | C : Entity_Id; | |
6282 | Typ : Entity_Id; | |
6283 | T : Entity_Id; | |
6284 | T_Name : Entity_Id; | |
6285 | ||
6286 | begin | |
6287 | if N = Error then | |
6288 | return; | |
6289 | ||
6290 | elsif Nkind (N) = N_Attribute_Reference then | |
6291 | ||
11560bcc TQ |
6292 | -- Class attribute. This is not valid in Ada 83 mode, but we do not |
6293 | -- need to enforce that at this point, since the declaration of the | |
6294 | -- tagged type in the prefix would have been flagged already. | |
996ae0b0 RK |
6295 | |
6296 | if Attribute_Name (N) = Name_Class then | |
6297 | Check_Restriction (No_Dispatch, N); | |
6298 | Find_Type (Prefix (N)); | |
6299 | ||
6300 | -- Propagate error from bad prefix | |
6301 | ||
6302 | if Etype (Prefix (N)) = Any_Type then | |
6303 | Set_Entity (N, Any_Type); | |
6304 | Set_Etype (N, Any_Type); | |
6305 | return; | |
6306 | end if; | |
6307 | ||
6308 | T := Base_Type (Entity (Prefix (N))); | |
6309 | ||
11560bcc TQ |
6310 | -- Case where type is not known to be tagged. Its appearance in |
6311 | -- the prefix of the 'Class attribute indicates that the full view | |
16ca248a | 6312 | -- will be tagged. |
996ae0b0 RK |
6313 | |
6314 | if not Is_Tagged_Type (T) then | |
6315 | if Ekind (T) = E_Incomplete_Type then | |
6316 | ||
6317 | -- It is legal to denote the class type of an incomplete | |
6318 | -- type. The full type will have to be tagged, of course. | |
90067a15 | 6319 | -- In Ada 2005 this usage is declared obsolescent, so we |
ae247488 ES |
6320 | -- warn accordingly. This usage is only legal if the type |
6321 | -- is completed in the current scope, and not for a limited | |
6322 | -- view of a type. | |
6323 | ||
2f7b7467 AC |
6324 | if Ada_Version >= Ada_2005 then |
6325 | ||
6326 | -- Test whether the Available_View of a limited type view | |
6327 | -- is tagged, since the limited view may not be marked as | |
6328 | -- tagged if the type itself has an untagged incomplete | |
6329 | -- type view in its package. | |
6330 | ||
6331 | if From_With_Type (T) | |
6332 | and then not Is_Tagged_Type (Available_View (T)) | |
6333 | then | |
ae247488 ES |
6334 | Error_Msg_N |
6335 | ("prefix of Class attribute must be tagged", N); | |
6336 | Set_Etype (N, Any_Type); | |
6337 | Set_Entity (N, Any_Type); | |
6338 | return; | |
11560bcc | 6339 | |
dbfeb4fa RD |
6340 | -- ??? This test is temporarily disabled (always |
6341 | -- False) because it causes an unwanted warning on | |
6342 | -- GNAT sources (built with -gnatg, which includes | |
6343 | -- Warn_On_Obsolescent_ Feature). Once this issue | |
6344 | -- is cleared in the sources, it can be enabled. | |
11560bcc | 6345 | |
ac7d724d | 6346 | elsif Warn_On_Obsolescent_Feature and then False then |
ae247488 ES |
6347 | Error_Msg_N |
6348 | ("applying 'Class to an untagged incomplete type" | |
dbfeb4fa | 6349 | & " is an obsolescent feature (RM J.11)?r?", N); |
ae247488 | 6350 | end if; |
11560bcc | 6351 | end if; |
996ae0b0 RK |
6352 | |
6353 | Set_Is_Tagged_Type (T); | |
ef2a63ba | 6354 | Set_Direct_Primitive_Operations (T, New_Elmt_List); |
996ae0b0 RK |
6355 | Make_Class_Wide_Type (T); |
6356 | Set_Entity (N, Class_Wide_Type (T)); | |
6357 | Set_Etype (N, Class_Wide_Type (T)); | |
6358 | ||
6359 | elsif Ekind (T) = E_Private_Type | |
6360 | and then not Is_Generic_Type (T) | |
6361 | and then In_Private_Part (Scope (T)) | |
6362 | then | |
16ca248a ES |
6363 | -- The Class attribute can be applied to an untagged private |
6364 | -- type fulfilled by a tagged type prior to the full type | |
6365 | -- declaration (but only within the parent package's private | |
6366 | -- part). Create the class-wide type now and check that the | |
6367 | -- full type is tagged later during its analysis. Note that | |
6368 | -- we do not mark the private type as tagged, unlike the | |
6369 | -- case of incomplete types, because the type must still | |
996ae0b0 RK |
6370 | -- appear untagged to outside units. |
6371 | ||
cdc8c54c | 6372 | if No (Class_Wide_Type (T)) then |
996ae0b0 RK |
6373 | Make_Class_Wide_Type (T); |
6374 | end if; | |
6375 | ||
6376 | Set_Entity (N, Class_Wide_Type (T)); | |
6377 | Set_Etype (N, Class_Wide_Type (T)); | |
6378 | ||
6379 | else | |
16ca248a ES |
6380 | -- Should we introduce a type Any_Tagged and use Wrong_Type |
6381 | -- here, it would be a bit more consistent??? | |
996ae0b0 RK |
6382 | |
6383 | Error_Msg_NE | |
6384 | ("tagged type required, found}", | |
6385 | Prefix (N), First_Subtype (T)); | |
6386 | Set_Entity (N, Any_Type); | |
6387 | return; | |
6388 | end if; | |
6389 | ||
6390 | -- Case of tagged type | |
6391 | ||
6392 | else | |
39edfb45 | 6393 | if Is_Concurrent_Type (T) then |
cdc8c54c BD |
6394 | if No (Corresponding_Record_Type (Entity (Prefix (N)))) then |
6395 | ||
6396 | -- Previous error. Use current type, which at least | |
6397 | -- provides some operations. | |
6398 | ||
6399 | C := Entity (Prefix (N)); | |
6400 | ||
6401 | else | |
6402 | C := Class_Wide_Type | |
6403 | (Corresponding_Record_Type (Entity (Prefix (N)))); | |
6404 | end if; | |
6405 | ||
39edfb45 JM |
6406 | else |
6407 | C := Class_Wide_Type (Entity (Prefix (N))); | |
6408 | end if; | |
6409 | ||
996ae0b0 RK |
6410 | Set_Entity_With_Style_Check (N, C); |
6411 | Generate_Reference (C, N); | |
6412 | Set_Etype (N, C); | |
996ae0b0 RK |
6413 | end if; |
6414 | ||
0ab80019 | 6415 | -- Base attribute, not allowed in Ada 83 |
996ae0b0 RK |
6416 | |
6417 | elsif Attribute_Name (N) = Name_Base then | |
7a489a2b | 6418 | Error_Msg_Name_1 := Name_Base; |
2ba431e5 | 6419 | Check_SPARK_Restriction |
7a489a2b AC |
6420 | ("attribute% is only allowed as prefix of another attribute", N); |
6421 | ||
0ab80019 | 6422 | if Ada_Version = Ada_83 and then Comes_From_Source (N) then |
996ae0b0 RK |
6423 | Error_Msg_N |
6424 | ("(Ada 83) Base attribute not allowed in subtype mark", N); | |
6425 | ||
6426 | else | |
6427 | Find_Type (Prefix (N)); | |
6428 | Typ := Entity (Prefix (N)); | |
6429 | ||
0ab80019 | 6430 | if Ada_Version >= Ada_95 |
fbf5a39b AC |
6431 | and then not Is_Scalar_Type (Typ) |
6432 | and then not Is_Generic_Type (Typ) | |
6433 | then | |
6434 | Error_Msg_N | |
bc41faa2 AC |
6435 | ("prefix of Base attribute must be scalar type", |
6436 | Prefix (N)); | |
fbf5a39b | 6437 | |
a8930b80 | 6438 | elsif Warn_On_Redundant_Constructs |
996ae0b0 | 6439 | and then Base_Type (Typ) = Typ |
996ae0b0 | 6440 | then |
ed2233dc | 6441 | Error_Msg_NE -- CODEFIX |
dbfeb4fa | 6442 | ("redundant attribute, & is its own base type?r?", N, Typ); |
996ae0b0 RK |
6443 | end if; |
6444 | ||
6445 | T := Base_Type (Typ); | |
996ae0b0 RK |
6446 | |
6447 | -- Rewrite attribute reference with type itself (see similar | |
a8930b80 AC |
6448 | -- processing in Analyze_Attribute, case Base). Preserve prefix |
6449 | -- if present, for other legality checks. | |
fbf5a39b AC |
6450 | |
6451 | if Nkind (Prefix (N)) = N_Expanded_Name then | |
6452 | Rewrite (N, | |
6453 | Make_Expanded_Name (Sloc (N), | |
11560bcc TQ |
6454 | Chars => Chars (T), |
6455 | Prefix => New_Copy (Prefix (Prefix (N))), | |
6456 | Selector_Name => New_Reference_To (T, Sloc (N)))); | |
996ae0b0 | 6457 | |
fbf5a39b | 6458 | else |
11560bcc | 6459 | Rewrite (N, New_Reference_To (T, Sloc (N))); |
fbf5a39b AC |
6460 | end if; |
6461 | ||
6462 | Set_Entity (N, T); | |
996ae0b0 RK |
6463 | Set_Etype (N, T); |
6464 | end if; | |
6465 | ||
923fa078 RD |
6466 | elsif Attribute_Name (N) = Name_Stub_Type then |
6467 | ||
6468 | -- This is handled in Analyze_Attribute | |
6469 | ||
6470 | Analyze (N); | |
6471 | ||
996ae0b0 RK |
6472 | -- All other attributes are invalid in a subtype mark |
6473 | ||
6474 | else | |
6475 | Error_Msg_N ("invalid attribute in subtype mark", N); | |
6476 | end if; | |
6477 | ||
6478 | else | |
6479 | Analyze (N); | |
6480 | ||
6481 | if Is_Entity_Name (N) then | |
6482 | T_Name := Entity (N); | |
6483 | else | |
6484 | Error_Msg_N ("subtype mark required in this context", N); | |
6485 | Set_Etype (N, Any_Type); | |
6486 | return; | |
6487 | end if; | |
6488 | ||
6489 | if T_Name = Any_Id or else Etype (N) = Any_Type then | |
6490 | ||
6491 | -- Undefined id. Make it into a valid type | |
6492 | ||
6493 | Set_Entity (N, Any_Type); | |
6494 | ||
6495 | elsif not Is_Type (T_Name) | |
6496 | and then T_Name /= Standard_Void_Type | |
6497 | then | |
6498 | Error_Msg_Sloc := Sloc (T_Name); | |
6499 | Error_Msg_N ("subtype mark required in this context", N); | |
923fa078 | 6500 | Error_Msg_NE ("\\found & declared#", N, T_Name); |
996ae0b0 RK |
6501 | Set_Entity (N, Any_Type); |
6502 | ||
6503 | else | |
11560bcc TQ |
6504 | -- If the type is an incomplete type created to handle |
6505 | -- anonymous access components of a record type, then the | |
6506 | -- incomplete type is the visible entity and subsequent | |
6507 | -- references will point to it. Mark the original full | |
6508 | -- type as referenced, to prevent spurious warnings. | |
6509 | ||
6510 | if Is_Incomplete_Type (T_Name) | |
6511 | and then Present (Full_View (T_Name)) | |
6512 | and then not Comes_From_Source (T_Name) | |
6513 | then | |
6514 | Set_Referenced (Full_View (T_Name)); | |
6515 | end if; | |
6516 | ||
996ae0b0 RK |
6517 | T_Name := Get_Full_View (T_Name); |
6518 | ||
11560bcc TQ |
6519 | -- Ada 2005 (AI-251, AI-50217): Handle interfaces visible through |
6520 | -- limited-with clauses | |
6521 | ||
6522 | if From_With_Type (T_Name) | |
6523 | and then Ekind (T_Name) in Incomplete_Kind | |
6524 | and then Present (Non_Limited_View (T_Name)) | |
6525 | and then Is_Interface (Non_Limited_View (T_Name)) | |
6526 | then | |
6527 | T_Name := Non_Limited_View (T_Name); | |
6528 | end if; | |
6529 | ||
996ae0b0 RK |
6530 | if In_Open_Scopes (T_Name) then |
6531 | if Ekind (Base_Type (T_Name)) = E_Task_Type then | |
923fa078 RD |
6532 | |
6533 | -- In Ada 2005, a task name can be used in an access | |
e264efcc AC |
6534 | -- definition within its own body. It cannot be used |
6535 | -- in the discriminant part of the task declaration, | |
6536 | -- nor anywhere else in the declaration because entries | |
6537 | -- cannot have access parameters. | |
923fa078 | 6538 | |
0791fbe9 | 6539 | if Ada_Version >= Ada_2005 |
923fa078 RD |
6540 | and then Nkind (Parent (N)) = N_Access_Definition |
6541 | then | |
6542 | Set_Entity (N, T_Name); | |
6543 | Set_Etype (N, T_Name); | |
e264efcc AC |
6544 | |
6545 | if Has_Completion (T_Name) then | |
6546 | return; | |
6547 | ||
6548 | else | |
6549 | Error_Msg_N | |
6550 | ("task type cannot be used as type mark " & | |
6551 | "within its own declaration", N); | |
6552 | end if; | |
923fa078 RD |
6553 | |
6554 | else | |
6555 | Error_Msg_N | |
6556 | ("task type cannot be used as type mark " & | |
fbe627af | 6557 | "within its own spec or body", N); |
923fa078 | 6558 | end if; |
fbe627af RD |
6559 | |
6560 | elsif Ekind (Base_Type (T_Name)) = E_Protected_Type then | |
6561 | ||
6562 | -- In Ada 2005, a protected name can be used in an access | |
6563 | -- definition within its own body. | |
6564 | ||
0791fbe9 | 6565 | if Ada_Version >= Ada_2005 |
fbe627af RD |
6566 | and then Nkind (Parent (N)) = N_Access_Definition |
6567 | then | |
6568 | Set_Entity (N, T_Name); | |
6569 | Set_Etype (N, T_Name); | |
6570 | return; | |
6571 | ||
6572 | else | |
6573 | Error_Msg_N | |
6574 | ("protected type cannot be used as type mark " & | |
6575 | "within its own spec or body", N); | |
6576 | end if; | |
6577 | ||
996ae0b0 RK |
6578 | else |
6579 | Error_Msg_N ("type declaration cannot refer to itself", N); | |
6580 | end if; | |
6581 | ||
6582 | Set_Etype (N, Any_Type); | |
6583 | Set_Entity (N, Any_Type); | |
6584 | Set_Error_Posted (T_Name); | |
6585 | return; | |
6586 | end if; | |
6587 | ||
6588 | Set_Entity (N, T_Name); | |
6589 | Set_Etype (N, T_Name); | |
6590 | end if; | |
6591 | end if; | |
6592 | ||
07fc65c4 | 6593 | if Present (Etype (N)) and then Comes_From_Source (N) then |
996ae0b0 RK |
6594 | if Is_Fixed_Point_Type (Etype (N)) then |
6595 | Check_Restriction (No_Fixed_Point, N); | |
6596 | elsif Is_Floating_Point_Type (Etype (N)) then | |
6597 | Check_Restriction (No_Floating_Point, N); | |
6598 | end if; | |
6599 | end if; | |
6600 | end Find_Type; | |
6601 | ||
996ae0b0 RK |
6602 | ------------------------------------ |
6603 | -- Has_Implicit_Character_Literal -- | |
6604 | ------------------------------------ | |
6605 | ||
6606 | function Has_Implicit_Character_Literal (N : Node_Id) return Boolean is | |
6607 | Id : Entity_Id; | |
6608 | Found : Boolean := False; | |
6609 | P : constant Entity_Id := Entity (Prefix (N)); | |
6610 | Priv_Id : Entity_Id := Empty; | |
6611 | ||
6612 | begin | |
ac7d724d | 6613 | if Ekind (P) = E_Package and then not In_Open_Scopes (P) then |
996ae0b0 RK |
6614 | Priv_Id := First_Private_Entity (P); |
6615 | end if; | |
6616 | ||
6617 | if P = Standard_Standard then | |
6618 | Change_Selected_Component_To_Expanded_Name (N); | |
6619 | Rewrite (N, Selector_Name (N)); | |
6620 | Analyze (N); | |
6621 | Set_Etype (Original_Node (N), Standard_Character); | |
6622 | return True; | |
6623 | end if; | |
6624 | ||
6625 | Id := First_Entity (P); | |
ac7d724d | 6626 | while Present (Id) and then Id /= Priv_Id loop |
d347f572 AC |
6627 | if Is_Standard_Character_Type (Id) and then Is_Base_Type (Id) then |
6628 | ||
996ae0b0 RK |
6629 | -- We replace the node with the literal itself, resolve as a |
6630 | -- character, and set the type correctly. | |
6631 | ||
6632 | if not Found then | |
6633 | Change_Selected_Component_To_Expanded_Name (N); | |
6634 | Rewrite (N, Selector_Name (N)); | |
6635 | Analyze (N); | |
6636 | Set_Etype (N, Id); | |
6637 | Set_Etype (Original_Node (N), Id); | |
6638 | Found := True; | |
6639 | ||
6640 | else | |
6641 | -- More than one type derived from Character in given scope. | |
6642 | -- Collect all possible interpretations. | |
6643 | ||
6644 | Add_One_Interp (N, Id, Id); | |
6645 | end if; | |
6646 | end if; | |
6647 | ||
6648 | Next_Entity (Id); | |
6649 | end loop; | |
6650 | ||
6651 | return Found; | |
6652 | end Has_Implicit_Character_Literal; | |
6653 | ||
9bc856dd AC |
6654 | ---------------------- |
6655 | -- Has_Private_With -- | |
6656 | ---------------------- | |
6657 | ||
6658 | function Has_Private_With (E : Entity_Id) return Boolean is | |
6659 | Comp_Unit : constant Node_Id := Cunit (Current_Sem_Unit); | |
6660 | Item : Node_Id; | |
6661 | ||
6662 | begin | |
6663 | Item := First (Context_Items (Comp_Unit)); | |
6664 | while Present (Item) loop | |
6665 | if Nkind (Item) = N_With_Clause | |
6666 | and then Private_Present (Item) | |
6667 | and then Entity (Name (Item)) = E | |
6668 | then | |
6669 | return True; | |
6670 | end if; | |
6671 | ||
6672 | Next (Item); | |
6673 | end loop; | |
6674 | ||
6675 | return False; | |
6676 | end Has_Private_With; | |
6677 | ||
996ae0b0 RK |
6678 | --------------------------- |
6679 | -- Has_Implicit_Operator -- | |
6680 | --------------------------- | |
6681 | ||
6682 | function Has_Implicit_Operator (N : Node_Id) return Boolean is | |
6683 | Op_Id : constant Name_Id := Chars (Selector_Name (N)); | |
6684 | P : constant Entity_Id := Entity (Prefix (N)); | |
6685 | Id : Entity_Id; | |
6686 | Priv_Id : Entity_Id := Empty; | |
6687 | ||
fbf5a39b AC |
6688 | procedure Add_Implicit_Operator |
6689 | (T : Entity_Id; | |
6690 | Op_Type : Entity_Id := Empty); | |
fbe627af RD |
6691 | -- Add implicit interpretation to node N, using the type for which a |
6692 | -- predefined operator exists. If the operator yields a boolean type, | |
6693 | -- the Operand_Type is implicitly referenced by the operator, and a | |
6694 | -- reference to it must be generated. | |
996ae0b0 RK |
6695 | |
6696 | --------------------------- | |
6697 | -- Add_Implicit_Operator -- | |
6698 | --------------------------- | |
6699 | ||
fbf5a39b AC |
6700 | procedure Add_Implicit_Operator |
6701 | (T : Entity_Id; | |
6702 | Op_Type : Entity_Id := Empty) | |
6703 | is | |
996ae0b0 RK |
6704 | Predef_Op : Entity_Id; |
6705 | ||
6706 | begin | |
6707 | Predef_Op := Current_Entity (Selector_Name (N)); | |
996ae0b0 RK |
6708 | while Present (Predef_Op) |
6709 | and then Scope (Predef_Op) /= Standard_Standard | |
6710 | loop | |
6711 | Predef_Op := Homonym (Predef_Op); | |
6712 | end loop; | |
6713 | ||
6714 | if Nkind (N) = N_Selected_Component then | |
6715 | Change_Selected_Component_To_Expanded_Name (N); | |
6716 | end if; | |
6717 | ||
719aaf4d AC |
6718 | -- If the context is an unanalyzed function call, determine whether |
6719 | -- a binary or unary interpretation is required. | |
996ae0b0 | 6720 | |
719aaf4d AC |
6721 | if Nkind (Parent (N)) = N_Indexed_Component then |
6722 | declare | |
964f13da RD |
6723 | Is_Binary_Call : constant Boolean := |
6724 | Present | |
6725 | (Next (First (Expressions (Parent (N))))); | |
6726 | Is_Binary_Op : constant Boolean := | |
6727 | First_Entity | |
6728 | (Predef_Op) /= Last_Entity (Predef_Op); | |
719aaf4d AC |
6729 | Predef_Op2 : constant Entity_Id := Homonym (Predef_Op); |
6730 | ||
6731 | begin | |
6732 | if Is_Binary_Call then | |
6733 | if Is_Binary_Op then | |
6734 | Add_One_Interp (N, Predef_Op, T); | |
6735 | else | |
6736 | Add_One_Interp (N, Predef_Op2, T); | |
6737 | end if; | |
996ae0b0 | 6738 | |
719aaf4d AC |
6739 | else |
6740 | if not Is_Binary_Op then | |
6741 | Add_One_Interp (N, Predef_Op, T); | |
6742 | else | |
6743 | Add_One_Interp (N, Predef_Op2, T); | |
6744 | end if; | |
6745 | end if; | |
6746 | end; | |
6747 | ||
6748 | else | |
6749 | Add_One_Interp (N, Predef_Op, T); | |
6750 | ||
6751 | -- For operators with unary and binary interpretations, if | |
6752 | -- context is not a call, add both | |
6753 | ||
6754 | if Present (Homonym (Predef_Op)) then | |
6755 | Add_One_Interp (N, Homonym (Predef_Op), T); | |
6756 | end if; | |
996ae0b0 | 6757 | end if; |
fbf5a39b AC |
6758 | |
6759 | -- The node is a reference to a predefined operator, and | |
6760 | -- an implicit reference to the type of its operands. | |
6761 | ||
6762 | if Present (Op_Type) then | |
6763 | Generate_Operator_Reference (N, Op_Type); | |
6764 | else | |
6765 | Generate_Operator_Reference (N, T); | |
6766 | end if; | |
996ae0b0 RK |
6767 | end Add_Implicit_Operator; |
6768 | ||
6769 | -- Start of processing for Has_Implicit_Operator | |
6770 | ||
6771 | begin | |
ac7d724d | 6772 | if Ekind (P) = E_Package and then not In_Open_Scopes (P) then |
996ae0b0 RK |
6773 | Priv_Id := First_Private_Entity (P); |
6774 | end if; | |
6775 | ||
6776 | Id := First_Entity (P); | |
6777 | ||
6778 | case Op_Id is | |
6779 | ||
6780 | -- Boolean operators: an implicit declaration exists if the scope | |
6781 | -- contains a declaration for a derived Boolean type, or for an | |
6782 | -- array of Boolean type. | |
6783 | ||
6784 | when Name_Op_And | Name_Op_Not | Name_Op_Or | Name_Op_Xor => | |
996ae0b0 | 6785 | while Id /= Priv_Id loop |
d347f572 | 6786 | if Valid_Boolean_Arg (Id) and then Is_Base_Type (Id) then |
996ae0b0 RK |
6787 | Add_Implicit_Operator (Id); |
6788 | return True; | |
6789 | end if; | |
6790 | ||
6791 | Next_Entity (Id); | |
6792 | end loop; | |
6793 | ||
bc41faa2 | 6794 | -- Equality: look for any non-limited type (result is Boolean) |
996ae0b0 RK |
6795 | |
6796 | when Name_Op_Eq | Name_Op_Ne => | |
996ae0b0 | 6797 | while Id /= Priv_Id loop |
996ae0b0 RK |
6798 | if Is_Type (Id) |
6799 | and then not Is_Limited_Type (Id) | |
d347f572 | 6800 | and then Is_Base_Type (Id) |
996ae0b0 | 6801 | then |
fbf5a39b | 6802 | Add_Implicit_Operator (Standard_Boolean, Id); |
996ae0b0 RK |
6803 | return True; |
6804 | end if; | |
6805 | ||
6806 | Next_Entity (Id); | |
6807 | end loop; | |
6808 | ||
bc41faa2 | 6809 | -- Comparison operators: scalar type, or array of scalar |
996ae0b0 RK |
6810 | |
6811 | when Name_Op_Lt | Name_Op_Le | Name_Op_Gt | Name_Op_Ge => | |
996ae0b0 RK |
6812 | while Id /= Priv_Id loop |
6813 | if (Is_Scalar_Type (Id) | |
d347f572 AC |
6814 | or else (Is_Array_Type (Id) |
6815 | and then Is_Scalar_Type (Component_Type (Id)))) | |
6816 | and then Is_Base_Type (Id) | |
996ae0b0 | 6817 | then |
fbf5a39b | 6818 | Add_Implicit_Operator (Standard_Boolean, Id); |
996ae0b0 RK |
6819 | return True; |
6820 | end if; | |
6821 | ||
6822 | Next_Entity (Id); | |
6823 | end loop; | |
6824 | ||
6825 | -- Arithmetic operators: any numeric type | |
6826 | ||
6827 | when Name_Op_Abs | | |
6828 | Name_Op_Add | | |
6829 | Name_Op_Mod | | |
6830 | Name_Op_Rem | | |
6831 | Name_Op_Subtract | | |
6832 | Name_Op_Multiply | | |
6833 | Name_Op_Divide | | |
6834 | Name_Op_Expon => | |
996ae0b0 | 6835 | while Id /= Priv_Id loop |
d347f572 | 6836 | if Is_Numeric_Type (Id) and then Is_Base_Type (Id) then |
996ae0b0 RK |
6837 | Add_Implicit_Operator (Id); |
6838 | return True; | |
6839 | end if; | |
6840 | ||
6841 | Next_Entity (Id); | |
6842 | end loop; | |
6843 | ||
6844 | -- Concatenation: any one-dimensional array type | |
6845 | ||
6846 | when Name_Op_Concat => | |
996ae0b0 | 6847 | while Id /= Priv_Id loop |
d347f572 AC |
6848 | if Is_Array_Type (Id) |
6849 | and then Number_Dimensions (Id) = 1 | |
6850 | and then Is_Base_Type (Id) | |
996ae0b0 RK |
6851 | then |
6852 | Add_Implicit_Operator (Id); | |
6853 | return True; | |
6854 | end if; | |
6855 | ||
6856 | Next_Entity (Id); | |
6857 | end loop; | |
6858 | ||
6859 | -- What is the others condition here? Should we be using a | |
6860 | -- subtype of Name_Id that would restrict to operators ??? | |
6861 | ||
6862 | when others => null; | |
996ae0b0 RK |
6863 | end case; |
6864 | ||
6865 | -- If we fall through, then we do not have an implicit operator | |
6866 | ||
6867 | return False; | |
6868 | ||
6869 | end Has_Implicit_Operator; | |
6870 | ||
607d0635 AC |
6871 | ----------------------------------- |
6872 | -- Has_Loop_In_Inner_Open_Scopes -- | |
6873 | ----------------------------------- | |
6874 | ||
6875 | function Has_Loop_In_Inner_Open_Scopes (S : Entity_Id) return Boolean is | |
6876 | begin | |
6877 | -- Several scope stacks are maintained by Scope_Stack. The base of the | |
6878 | -- currently active scope stack is denoted by the Is_Active_Stack_Base | |
6879 | -- flag in the scope stack entry. Note that the scope stacks used to | |
6880 | -- simply be delimited implicitly by the presence of Standard_Standard | |
6881 | -- at their base, but there now are cases where this is not sufficient | |
6882 | -- because Standard_Standard actually may appear in the middle of the | |
6883 | -- active set of scopes. | |
6884 | ||
6885 | for J in reverse 0 .. Scope_Stack.Last loop | |
8d606a78 RD |
6886 | |
6887 | -- S was reached without seing a loop scope first | |
6888 | ||
607d0635 | 6889 | if Scope_Stack.Table (J).Entity = S then |
607d0635 | 6890 | return False; |
8d606a78 RD |
6891 | |
6892 | -- S was not yet reached, so it contains at least one inner loop | |
6893 | ||
607d0635 | 6894 | elsif Ekind (Scope_Stack.Table (J).Entity) = E_Loop then |
607d0635 AC |
6895 | return True; |
6896 | end if; | |
6897 | ||
6898 | -- Check Is_Active_Stack_Base to tell us when to stop, as there are | |
6899 | -- cases where Standard_Standard appears in the middle of the active | |
6900 | -- set of scopes. This affects the declaration and overriding of | |
6901 | -- private inherited operations in instantiations of generic child | |
6902 | -- units. | |
6903 | ||
6904 | pragma Assert (not Scope_Stack.Table (J).Is_Active_Stack_Base); | |
6905 | end loop; | |
6906 | ||
2010d078 | 6907 | raise Program_Error; -- unreachable |
607d0635 AC |
6908 | end Has_Loop_In_Inner_Open_Scopes; |
6909 | ||
996ae0b0 RK |
6910 | -------------------- |
6911 | -- In_Open_Scopes -- | |
6912 | -------------------- | |
6913 | ||
6914 | function In_Open_Scopes (S : Entity_Id) return Boolean is | |
6915 | begin | |
923fa078 RD |
6916 | -- Several scope stacks are maintained by Scope_Stack. The base of the |
6917 | -- currently active scope stack is denoted by the Is_Active_Stack_Base | |
6918 | -- flag in the scope stack entry. Note that the scope stacks used to | |
6919 | -- simply be delimited implicitly by the presence of Standard_Standard | |
6920 | -- at their base, but there now are cases where this is not sufficient | |
6921 | -- because Standard_Standard actually may appear in the middle of the | |
6922 | -- active set of scopes. | |
996ae0b0 RK |
6923 | |
6924 | for J in reverse 0 .. Scope_Stack.Last loop | |
6925 | if Scope_Stack.Table (J).Entity = S then | |
6926 | return True; | |
6927 | end if; | |
6928 | ||
923fa078 RD |
6929 | -- Check Is_Active_Stack_Base to tell us when to stop, as there are |
6930 | -- cases where Standard_Standard appears in the middle of the active | |
6931 | -- set of scopes. This affects the declaration and overriding of | |
6932 | -- private inherited operations in instantiations of generic child | |
6933 | -- units. | |
996ae0b0 RK |
6934 | |
6935 | exit when Scope_Stack.Table (J).Is_Active_Stack_Base; | |
6936 | end loop; | |
6937 | ||
6938 | return False; | |
6939 | end In_Open_Scopes; | |
6940 | ||
6941 | ----------------------------- | |
6942 | -- Inherit_Renamed_Profile -- | |
6943 | ----------------------------- | |
6944 | ||
6945 | procedure Inherit_Renamed_Profile (New_S : Entity_Id; Old_S : Entity_Id) is | |
6946 | New_F : Entity_Id; | |
6947 | Old_F : Entity_Id; | |
6948 | Old_T : Entity_Id; | |
6949 | New_T : Entity_Id; | |
6950 | ||
6951 | begin | |
6952 | if Ekind (Old_S) = E_Operator then | |
996ae0b0 RK |
6953 | New_F := First_Formal (New_S); |
6954 | ||
6955 | while Present (New_F) loop | |
6956 | Set_Etype (New_F, Base_Type (Etype (New_F))); | |
6957 | Next_Formal (New_F); | |
6958 | end loop; | |
6959 | ||
6960 | Set_Etype (New_S, Base_Type (Etype (New_S))); | |
6961 | ||
6962 | else | |
6963 | New_F := First_Formal (New_S); | |
6964 | Old_F := First_Formal (Old_S); | |
6965 | ||
6966 | while Present (New_F) loop | |
6967 | New_T := Etype (New_F); | |
6968 | Old_T := Etype (Old_F); | |
6969 | ||
6970 | -- If the new type is a renaming of the old one, as is the | |
6971 | -- case for actuals in instances, retain its name, to simplify | |
6972 | -- later disambiguation. | |
6973 | ||
6974 | if Nkind (Parent (New_T)) = N_Subtype_Declaration | |
6975 | and then Is_Entity_Name (Subtype_Indication (Parent (New_T))) | |
6976 | and then Entity (Subtype_Indication (Parent (New_T))) = Old_T | |
6977 | then | |
6978 | null; | |
6979 | else | |
6980 | Set_Etype (New_F, Old_T); | |
6981 | end if; | |
6982 | ||
6983 | Next_Formal (New_F); | |
6984 | Next_Formal (Old_F); | |
6985 | end loop; | |
6986 | ||
bce79204 | 6987 | if Ekind_In (Old_S, E_Function, E_Enumeration_Literal) then |
996ae0b0 RK |
6988 | Set_Etype (New_S, Etype (Old_S)); |
6989 | end if; | |
6990 | end if; | |
6991 | end Inherit_Renamed_Profile; | |
6992 | ||
6993 | ---------------- | |
6994 | -- Initialize -- | |
6995 | ---------------- | |
6996 | ||
6997 | procedure Initialize is | |
6998 | begin | |
6999 | Urefs.Init; | |
7000 | end Initialize; | |
7001 | ||
7002 | ------------------------- | |
7003 | -- Install_Use_Clauses -- | |
7004 | ------------------------- | |
7005 | ||
0da2c8ac AC |
7006 | procedure Install_Use_Clauses |
7007 | (Clause : Node_Id; | |
7008 | Force_Installation : Boolean := False) | |
7009 | is | |
16ca248a | 7010 | U : Node_Id; |
996ae0b0 RK |
7011 | P : Node_Id; |
7012 | Id : Entity_Id; | |
7013 | ||
7014 | begin | |
16ca248a | 7015 | U := Clause; |
996ae0b0 RK |
7016 | while Present (U) loop |
7017 | ||
7018 | -- Case of USE package | |
7019 | ||
7020 | if Nkind (U) = N_Use_Package_Clause then | |
7021 | P := First (Names (U)); | |
996ae0b0 RK |
7022 | while Present (P) loop |
7023 | Id := Entity (P); | |
7024 | ||
7025 | if Ekind (Id) = E_Package then | |
996ae0b0 | 7026 | if In_Use (Id) then |
d4810530 | 7027 | Note_Redundant_Use (P); |
996ae0b0 RK |
7028 | |
7029 | elsif Present (Renamed_Object (Id)) | |
7030 | and then In_Use (Renamed_Object (Id)) | |
7031 | then | |
d4810530 | 7032 | Note_Redundant_Use (P); |
996ae0b0 | 7033 | |
0da2c8ac | 7034 | elsif Force_Installation or else Applicable_Use (P) then |
996ae0b0 | 7035 | Use_One_Package (Id, U); |
0da2c8ac | 7036 | |
996ae0b0 RK |
7037 | end if; |
7038 | end if; | |
7039 | ||
7040 | Next (P); | |
7041 | end loop; | |
7042 | ||
16ca248a | 7043 | -- Case of USE TYPE |
996ae0b0 RK |
7044 | |
7045 | else | |
7046 | P := First (Subtype_Marks (U)); | |
996ae0b0 | 7047 | while Present (P) loop |
fbf5a39b AC |
7048 | if not Is_Entity_Name (P) |
7049 | or else No (Entity (P)) | |
7050 | then | |
7051 | null; | |
996ae0b0 | 7052 | |
fbf5a39b | 7053 | elsif Entity (P) /= Any_Type then |
07fc65c4 | 7054 | Use_One_Type (P); |
996ae0b0 RK |
7055 | end if; |
7056 | ||
7057 | Next (P); | |
7058 | end loop; | |
7059 | end if; | |
7060 | ||
7061 | Next_Use_Clause (U); | |
7062 | end loop; | |
7063 | end Install_Use_Clauses; | |
7064 | ||
7065 | ------------------------------------- | |
7066 | -- Is_Appropriate_For_Entry_Prefix -- | |
7067 | ------------------------------------- | |
7068 | ||
7069 | function Is_Appropriate_For_Entry_Prefix (T : Entity_Id) return Boolean is | |
7070 | P_Type : Entity_Id := T; | |
7071 | ||
7072 | begin | |
7073 | if Is_Access_Type (P_Type) then | |
7074 | P_Type := Designated_Type (P_Type); | |
7075 | end if; | |
7076 | ||
7077 | return Is_Task_Type (P_Type) or else Is_Protected_Type (P_Type); | |
7078 | end Is_Appropriate_For_Entry_Prefix; | |
7079 | ||
7080 | ------------------------------- | |
7081 | -- Is_Appropriate_For_Record -- | |
7082 | ------------------------------- | |
7083 | ||
2e071734 AC |
7084 | function Is_Appropriate_For_Record (T : Entity_Id) return Boolean is |
7085 | ||
996ae0b0 RK |
7086 | function Has_Components (T1 : Entity_Id) return Boolean; |
7087 | -- Determine if given type has components (i.e. is either a record | |
7088 | -- type or a type that has discriminants). | |
7089 | ||
16ca248a ES |
7090 | -------------------- |
7091 | -- Has_Components -- | |
7092 | -------------------- | |
7093 | ||
996ae0b0 RK |
7094 | function Has_Components (T1 : Entity_Id) return Boolean is |
7095 | begin | |
7096 | return Is_Record_Type (T1) | |
7097 | or else (Is_Private_Type (T1) and then Has_Discriminants (T1)) | |
16ca248a ES |
7098 | or else (Is_Task_Type (T1) and then Has_Discriminants (T1)) |
7099 | or else (Is_Incomplete_Type (T1) | |
7100 | and then From_With_Type (T1) | |
7101 | and then Present (Non_Limited_View (T1)) | |
11560bcc TQ |
7102 | and then Is_Record_Type |
7103 | (Get_Full_View (Non_Limited_View (T1)))); | |
996ae0b0 RK |
7104 | end Has_Components; |
7105 | ||
7106 | -- Start of processing for Is_Appropriate_For_Record | |
7107 | ||
7108 | begin | |
7109 | return | |
7110 | Present (T) | |
7111 | and then (Has_Components (T) | |
16ca248a ES |
7112 | or else (Is_Access_Type (T) |
7113 | and then Has_Components (Designated_Type (T)))); | |
996ae0b0 RK |
7114 | end Is_Appropriate_For_Record; |
7115 | ||
d4810530 ES |
7116 | ------------------------ |
7117 | -- Note_Redundant_Use -- | |
7118 | ------------------------ | |
7119 | ||
7120 | procedure Note_Redundant_Use (Clause : Node_Id) is | |
7121 | Pack_Name : constant Entity_Id := Entity (Clause); | |
7122 | Cur_Use : constant Node_Id := Current_Use_Clause (Pack_Name); | |
7123 | Decl : constant Node_Id := Parent (Clause); | |
7124 | ||
7125 | Prev_Use : Node_Id := Empty; | |
7126 | Redundant : Node_Id := Empty; | |
f7ca1d04 AC |
7127 | -- The Use_Clause which is actually redundant. In the simplest case it |
7128 | -- is Pack itself, but when we compile a body we install its context | |
7129 | -- before that of its spec, in which case it is the use_clause in the | |
7130 | -- spec that will appear to be redundant, and we want the warning to be | |
7131 | -- placed on the body. Similar complications appear when the redundancy | |
7132 | -- is between a child unit and one of its ancestors. | |
d4810530 ES |
7133 | |
7134 | begin | |
7135 | Set_Redundant_Use (Clause, True); | |
7136 | ||
7137 | if not Comes_From_Source (Clause) | |
7138 | or else In_Instance | |
7139 | or else not Warn_On_Redundant_Constructs | |
7140 | then | |
7141 | return; | |
7142 | end if; | |
7143 | ||
7144 | if not Is_Compilation_Unit (Current_Scope) then | |
7145 | ||
f7ca1d04 AC |
7146 | -- If the use_clause is in an inner scope, it is made redundant by |
7147 | -- some clause in the current context, with one exception: If we're | |
7148 | -- compiling a nested package body, and the use_clause comes from the | |
7149 | -- corresponding spec, the clause is not necessarily fully redundant, | |
7150 | -- so we should not warn. If a warning was warranted, it would have | |
7151 | -- been given when the spec was processed. | |
cdc8c54c BD |
7152 | |
7153 | if Nkind (Parent (Decl)) = N_Package_Specification then | |
7154 | declare | |
7155 | Package_Spec_Entity : constant Entity_Id := | |
7156 | Defining_Unit_Name (Parent (Decl)); | |
7157 | begin | |
7158 | if In_Package_Body (Package_Spec_Entity) then | |
7159 | return; | |
7160 | end if; | |
7161 | end; | |
7162 | end if; | |
d4810530 ES |
7163 | |
7164 | Redundant := Clause; | |
7165 | Prev_Use := Cur_Use; | |
7166 | ||
7167 | elsif Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Body then | |
7168 | declare | |
7169 | Cur_Unit : constant Unit_Number_Type := Get_Source_Unit (Cur_Use); | |
7170 | New_Unit : constant Unit_Number_Type := Get_Source_Unit (Clause); | |
7171 | Scop : Entity_Id; | |
7172 | ||
7173 | begin | |
7174 | if Cur_Unit = New_Unit then | |
7175 | ||
7176 | -- Redundant clause in same body | |
7177 | ||
7178 | Redundant := Clause; | |
7179 | Prev_Use := Cur_Use; | |
7180 | ||
7181 | elsif Cur_Unit = Current_Sem_Unit then | |
7182 | ||
7183 | -- If the new clause is not in the current unit it has been | |
7184 | -- analyzed first, and it makes the other one redundant. | |
7185 | -- However, if the new clause appears in a subunit, Cur_Unit | |
7186 | -- is still the parent, and in that case the redundant one | |
7187 | -- is the one appearing in the subunit. | |
7188 | ||
7189 | if Nkind (Unit (Cunit (New_Unit))) = N_Subunit then | |
7190 | Redundant := Clause; | |
7191 | Prev_Use := Cur_Use; | |
7192 | ||
7193 | -- Most common case: redundant clause in body, | |
7194 | -- original clause in spec. Current scope is spec entity. | |
7195 | ||
7196 | elsif | |
7197 | Current_Scope = | |
7198 | Defining_Entity ( | |
7199 | Unit (Library_Unit (Cunit (Current_Sem_Unit)))) | |
7200 | then | |
7201 | Redundant := Cur_Use; | |
7202 | Prev_Use := Clause; | |
7203 | ||
7204 | else | |
7205 | -- The new clause may appear in an unrelated unit, when | |
7206 | -- the parents of a generic are being installed prior to | |
7207 | -- instantiation. In this case there must be no warning. | |
7208 | -- We detect this case by checking whether the current top | |
7209 | -- of the stack is related to the current compilation. | |
7210 | ||
7211 | Scop := Current_Scope; | |
ac7d724d | 7212 | while Present (Scop) and then Scop /= Standard_Standard loop |
d4810530 ES |
7213 | if Is_Compilation_Unit (Scop) |
7214 | and then not Is_Child_Unit (Scop) | |
7215 | then | |
7216 | return; | |
7217 | ||
7218 | elsif Scop = Cunit_Entity (Current_Sem_Unit) then | |
7219 | exit; | |
7220 | end if; | |
7221 | ||
7222 | Scop := Scope (Scop); | |
7223 | end loop; | |
7224 | ||
7225 | Redundant := Cur_Use; | |
7226 | Prev_Use := Clause; | |
7227 | end if; | |
7228 | ||
7229 | elsif New_Unit = Current_Sem_Unit then | |
7230 | Redundant := Clause; | |
7231 | Prev_Use := Cur_Use; | |
7232 | ||
7233 | else | |
7234 | -- Neither is the current unit, so they appear in parent or | |
7235 | -- sibling units. Warning will be emitted elsewhere. | |
7236 | ||
7237 | return; | |
7238 | end if; | |
7239 | end; | |
7240 | ||
7241 | elsif Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Declaration | |
7242 | and then Present (Parent_Spec (Unit (Cunit (Current_Sem_Unit)))) | |
7243 | then | |
f7ca1d04 AC |
7244 | -- Use_clause is in child unit of current unit, and the child unit |
7245 | -- appears in the context of the body of the parent, so it has been | |
7246 | -- installed first, even though it is the redundant one. Depending on | |
7247 | -- their placement in the context, the visible or the private parts | |
7248 | -- of the two units, either might appear as redundant, but the | |
7249 | -- message has to be on the current unit. | |
d4810530 ES |
7250 | |
7251 | if Get_Source_Unit (Cur_Use) = Current_Sem_Unit then | |
7252 | Redundant := Cur_Use; | |
7253 | Prev_Use := Clause; | |
7254 | else | |
7255 | Redundant := Clause; | |
7256 | Prev_Use := Cur_Use; | |
7257 | end if; | |
7258 | ||
7259 | -- If the new use clause appears in the private part of a parent unit | |
f3d57416 | 7260 | -- it may appear to be redundant w.r.t. a use clause in a child unit, |
d4810530 ES |
7261 | -- but the previous use clause was needed in the visible part of the |
7262 | -- child, and no warning should be emitted. | |
7263 | ||
7264 | if Nkind (Parent (Decl)) = N_Package_Specification | |
7265 | and then | |
7266 | List_Containing (Decl) = Private_Declarations (Parent (Decl)) | |
7267 | then | |
7268 | declare | |
7269 | Par : constant Entity_Id := Defining_Entity (Parent (Decl)); | |
7270 | Spec : constant Node_Id := | |
7271 | Specification (Unit (Cunit (Current_Sem_Unit))); | |
7272 | ||
7273 | begin | |
7274 | if Is_Compilation_Unit (Par) | |
7275 | and then Par /= Cunit_Entity (Current_Sem_Unit) | |
7276 | and then Parent (Cur_Use) = Spec | |
7277 | and then | |
7278 | List_Containing (Cur_Use) = Visible_Declarations (Spec) | |
7279 | then | |
7280 | return; | |
7281 | end if; | |
7282 | end; | |
7283 | end if; | |
7284 | ||
ff81221b ES |
7285 | -- Finally, if the current use clause is in the context then |
7286 | -- the clause is redundant when it is nested within the unit. | |
7287 | ||
7288 | elsif Nkind (Parent (Cur_Use)) = N_Compilation_Unit | |
7289 | and then Nkind (Parent (Parent (Clause))) /= N_Compilation_Unit | |
7290 | and then Get_Source_Unit (Cur_Use) = Get_Source_Unit (Clause) | |
7291 | then | |
7292 | Redundant := Clause; | |
7293 | Prev_Use := Cur_Use; | |
7294 | ||
d4810530 ES |
7295 | else |
7296 | null; | |
7297 | end if; | |
7298 | ||
7299 | if Present (Redundant) then | |
7300 | Error_Msg_Sloc := Sloc (Prev_Use); | |
ed2233dc | 7301 | Error_Msg_NE -- CODEFIX |
dbfeb4fa | 7302 | ("& is already use-visible through previous use clause #??", |
954c111a | 7303 | Redundant, Pack_Name); |
d4810530 ES |
7304 | end if; |
7305 | end Note_Redundant_Use; | |
7306 | ||
996ae0b0 RK |
7307 | --------------- |
7308 | -- Pop_Scope -- | |
7309 | --------------- | |
7310 | ||
7311 | procedure Pop_Scope is | |
fbf5a39b | 7312 | SST : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last); |
fab2daeb | 7313 | S : constant Entity_Id := SST.Entity; |
996ae0b0 RK |
7314 | |
7315 | begin | |
7316 | if Debug_Flag_E then | |
7317 | Write_Info; | |
7318 | end if; | |
7319 | ||
fab2daeb AC |
7320 | -- Set Default_Storage_Pool field of the library unit if necessary |
7321 | ||
7322 | if Ekind_In (S, E_Package, E_Generic_Package) | |
7323 | and then | |
7324 | Nkind (Parent (Unit_Declaration_Node (S))) = N_Compilation_Unit | |
7325 | then | |
7326 | declare | |
7327 | Aux : constant Node_Id := | |
4adf3c50 | 7328 | Aux_Decls_Node (Parent (Unit_Declaration_Node (S))); |
fab2daeb AC |
7329 | begin |
7330 | if No (Default_Storage_Pool (Aux)) then | |
7331 | Set_Default_Storage_Pool (Aux, Default_Pool); | |
7332 | end if; | |
7333 | end; | |
7334 | end if; | |
7335 | ||
21d27997 | 7336 | Scope_Suppress := SST.Save_Scope_Suppress; |
11560bcc | 7337 | Local_Suppress_Stack_Top := SST.Save_Local_Suppress_Stack_Top; |
21d27997 | 7338 | Check_Policy_List := SST.Save_Check_Policy_List; |
fab2daeb | 7339 | Default_Pool := SST.Save_Default_Storage_Pool; |
996ae0b0 RK |
7340 | |
7341 | if Debug_Flag_W then | |
fab2daeb | 7342 | Write_Str ("<-- exiting scope: "); |
996ae0b0 RK |
7343 | Write_Name (Chars (Current_Scope)); |
7344 | Write_Str (", Depth="); | |
7345 | Write_Int (Int (Scope_Stack.Last)); | |
7346 | Write_Eol; | |
7347 | end if; | |
7348 | ||
fbf5a39b | 7349 | End_Use_Clauses (SST.First_Use_Clause); |
996ae0b0 RK |
7350 | |
7351 | -- If the actions to be wrapped are still there they will get lost | |
7352 | -- causing incomplete code to be generated. It is better to abort in | |
fbf5a39b | 7353 | -- this case (and we do the abort even with assertions off since the |
5eeeed5e | 7354 | -- penalty is incorrect code generation). |
996ae0b0 | 7355 | |
fbf5a39b AC |
7356 | if SST.Actions_To_Be_Wrapped_Before /= No_List |
7357 | or else | |
7358 | SST.Actions_To_Be_Wrapped_After /= No_List | |
7359 | then | |
46202729 | 7360 | raise Program_Error; |
fbf5a39b | 7361 | end if; |
996ae0b0 RK |
7362 | |
7363 | -- Free last subprogram name if allocated, and pop scope | |
7364 | ||
fbf5a39b | 7365 | Free (SST.Last_Subprogram_Name); |
996ae0b0 RK |
7366 | Scope_Stack.Decrement_Last; |
7367 | end Pop_Scope; | |
7368 | ||
fbe627af RD |
7369 | --------------- |
7370 | -- Push_Scope -- | |
7371 | --------------- | |
7372 | ||
7373 | procedure Push_Scope (S : Entity_Id) is | |
fab2daeb | 7374 | E : constant Entity_Id := Scope (S); |
fbe627af RD |
7375 | |
7376 | begin | |
7377 | if Ekind (S) = E_Void then | |
7378 | null; | |
7379 | ||
f7ca1d04 AC |
7380 | -- Set scope depth if not a non-concurrent type, and we have not yet set |
7381 | -- the scope depth. This means that we have the first occurrence of the | |
7382 | -- scope, and this is where the depth is set. | |
fbe627af RD |
7383 | |
7384 | elsif (not Is_Type (S) or else Is_Concurrent_Type (S)) | |
7385 | and then not Scope_Depth_Set (S) | |
7386 | then | |
7387 | if S = Standard_Standard then | |
7388 | Set_Scope_Depth_Value (S, Uint_0); | |
7389 | ||
7390 | elsif Is_Child_Unit (S) then | |
7391 | Set_Scope_Depth_Value (S, Uint_1); | |
7392 | ||
7393 | elsif not Is_Record_Type (Current_Scope) then | |
7394 | if Ekind (S) = E_Loop then | |
7395 | Set_Scope_Depth_Value (S, Scope_Depth (Current_Scope)); | |
7396 | else | |
7397 | Set_Scope_Depth_Value (S, Scope_Depth (Current_Scope) + 1); | |
7398 | end if; | |
7399 | end if; | |
7400 | end if; | |
7401 | ||
7402 | Scope_Stack.Increment_Last; | |
7403 | ||
7404 | declare | |
7405 | SST : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last); | |
7406 | ||
7407 | begin | |
11560bcc TQ |
7408 | SST.Entity := S; |
7409 | SST.Save_Scope_Suppress := Scope_Suppress; | |
7410 | SST.Save_Local_Suppress_Stack_Top := Local_Suppress_Stack_Top; | |
21d27997 | 7411 | SST.Save_Check_Policy_List := Check_Policy_List; |
fab2daeb | 7412 | SST.Save_Default_Storage_Pool := Default_Pool; |
fbe627af RD |
7413 | |
7414 | if Scope_Stack.Last > Scope_Stack.First then | |
7415 | SST.Component_Alignment_Default := Scope_Stack.Table | |
7416 | (Scope_Stack.Last - 1). | |
7417 | Component_Alignment_Default; | |
7418 | end if; | |
7419 | ||
7420 | SST.Last_Subprogram_Name := null; | |
7421 | SST.Is_Transient := False; | |
7422 | SST.Node_To_Be_Wrapped := Empty; | |
7423 | SST.Pending_Freeze_Actions := No_List; | |
7424 | SST.Actions_To_Be_Wrapped_Before := No_List; | |
7425 | SST.Actions_To_Be_Wrapped_After := No_List; | |
7426 | SST.First_Use_Clause := Empty; | |
7427 | SST.Is_Active_Stack_Base := False; | |
7428 | SST.Previous_Visibility := False; | |
7429 | end; | |
7430 | ||
7431 | if Debug_Flag_W then | |
7432 | Write_Str ("--> new scope: "); | |
7433 | Write_Name (Chars (Current_Scope)); | |
7434 | Write_Str (", Id="); | |
7435 | Write_Int (Int (Current_Scope)); | |
7436 | Write_Str (", Depth="); | |
7437 | Write_Int (Int (Scope_Stack.Last)); | |
7438 | Write_Eol; | |
7439 | end if; | |
7440 | ||
f7ca1d04 AC |
7441 | -- Deal with copying flags from the previous scope to this one. This is |
7442 | -- not necessary if either scope is standard, or if the new scope is a | |
7443 | -- child unit. | |
fbe627af RD |
7444 | |
7445 | if S /= Standard_Standard | |
7446 | and then Scope (S) /= Standard_Standard | |
7447 | and then not Is_Child_Unit (S) | |
7448 | then | |
fbe627af RD |
7449 | if Nkind (E) not in N_Entity then |
7450 | return; | |
7451 | end if; | |
7452 | ||
7453 | -- Copy categorization flags from Scope (S) to S, this is not done | |
7454 | -- when Scope (S) is Standard_Standard since propagation is from | |
7455 | -- library unit entity inwards. Copy other relevant attributes as | |
7456 | -- well (Discard_Names in particular). | |
7457 | ||
7458 | -- We only propagate inwards for library level entities, | |
7459 | -- inner level subprograms do not inherit the categorization. | |
7460 | ||
7461 | if Is_Library_Level_Entity (S) then | |
7462 | Set_Is_Preelaborated (S, Is_Preelaborated (E)); | |
7463 | Set_Is_Shared_Passive (S, Is_Shared_Passive (E)); | |
7464 | Set_Discard_Names (S, Discard_Names (E)); | |
7465 | Set_Suppress_Value_Tracking_On_Call | |
7466 | (S, Suppress_Value_Tracking_On_Call (E)); | |
7467 | Set_Categorization_From_Scope (E => S, Scop => E); | |
7468 | end if; | |
7469 | end if; | |
fab2daeb AC |
7470 | |
7471 | if Is_Child_Unit (S) | |
7472 | and then Present (E) | |
7473 | and then Ekind_In (E, E_Package, E_Generic_Package) | |
7474 | and then | |
7475 | Nkind (Parent (Unit_Declaration_Node (E))) = N_Compilation_Unit | |
7476 | then | |
7477 | declare | |
7478 | Aux : constant Node_Id := | |
4adf3c50 | 7479 | Aux_Decls_Node (Parent (Unit_Declaration_Node (E))); |
fab2daeb AC |
7480 | begin |
7481 | if Present (Default_Storage_Pool (Aux)) then | |
7482 | Default_Pool := Default_Storage_Pool (Aux); | |
7483 | end if; | |
7484 | end; | |
7485 | end if; | |
fbe627af RD |
7486 | end Push_Scope; |
7487 | ||
996ae0b0 RK |
7488 | --------------------- |
7489 | -- Premature_Usage -- | |
7490 | --------------------- | |
7491 | ||
7492 | procedure Premature_Usage (N : Node_Id) is | |
fbf5a39b | 7493 | Kind : constant Node_Kind := Nkind (Parent (Entity (N))); |
996ae0b0 RK |
7494 | E : Entity_Id := Entity (N); |
7495 | ||
7496 | begin | |
7497 | -- Within an instance, the analysis of the actual for a formal object | |
16ca248a ES |
7498 | -- does not see the name of the object itself. This is significant only |
7499 | -- if the object is an aggregate, where its analysis does not do any | |
7500 | -- name resolution on component associations. (see 4717-008). In such a | |
7501 | -- case, look for the visible homonym on the chain. | |
996ae0b0 | 7502 | |
ac7d724d | 7503 | if In_Instance and then Present (Homonym (E)) then |
996ae0b0 | 7504 | E := Homonym (E); |
ac7d724d | 7505 | while Present (E) and then not In_Open_Scopes (Scope (E)) loop |
996ae0b0 RK |
7506 | E := Homonym (E); |
7507 | end loop; | |
7508 | ||
7509 | if Present (E) then | |
7510 | Set_Entity (N, E); | |
7511 | Set_Etype (N, Etype (E)); | |
7512 | return; | |
7513 | end if; | |
7514 | end if; | |
7515 | ||
7516 | if Kind = N_Component_Declaration then | |
7517 | Error_Msg_N | |
7518 | ("component&! cannot be used before end of record declaration", N); | |
7519 | ||
7520 | elsif Kind = N_Parameter_Specification then | |
7521 | Error_Msg_N | |
7522 | ("formal parameter&! cannot be used before end of specification", | |
7523 | N); | |
7524 | ||
7525 | elsif Kind = N_Discriminant_Specification then | |
7526 | Error_Msg_N | |
7527 | ("discriminant&! cannot be used before end of discriminant part", | |
7528 | N); | |
7529 | ||
7530 | elsif Kind = N_Procedure_Specification | |
7531 | or else Kind = N_Function_Specification | |
7532 | then | |
7533 | Error_Msg_N | |
7534 | ("subprogram&! cannot be used before end of its declaration", | |
7535 | N); | |
90067a15 ES |
7536 | |
7537 | elsif Kind = N_Full_Type_Declaration then | |
7538 | Error_Msg_N | |
7539 | ("type& cannot be used before end of its declaration!", N); | |
7540 | ||
996ae0b0 RK |
7541 | else |
7542 | Error_Msg_N | |
7543 | ("object& cannot be used before end of its declaration!", N); | |
7544 | end if; | |
7545 | end Premature_Usage; | |
7546 | ||
7547 | ------------------------ | |
7548 | -- Present_System_Aux -- | |
7549 | ------------------------ | |
7550 | ||
7551 | function Present_System_Aux (N : Node_Id := Empty) return Boolean is | |
7552 | Loc : Source_Ptr; | |
fbe627af | 7553 | Aux_Name : Unit_Name_Type; |
996ae0b0 RK |
7554 | Unum : Unit_Number_Type; |
7555 | Withn : Node_Id; | |
7556 | With_Sys : Node_Id; | |
7557 | The_Unit : Node_Id; | |
7558 | ||
7559 | function Find_System (C_Unit : Node_Id) return Entity_Id; | |
16ca248a | 7560 | -- Scan context clause of compilation unit to find with_clause |
996ae0b0 RK |
7561 | -- for System. |
7562 | ||
2e071734 AC |
7563 | ----------------- |
7564 | -- Find_System -- | |
7565 | ----------------- | |
7566 | ||
996ae0b0 RK |
7567 | function Find_System (C_Unit : Node_Id) return Entity_Id is |
7568 | With_Clause : Node_Id; | |
7569 | ||
7570 | begin | |
7571 | With_Clause := First (Context_Items (C_Unit)); | |
996ae0b0 RK |
7572 | while Present (With_Clause) loop |
7573 | if (Nkind (With_Clause) = N_With_Clause | |
7574 | and then Chars (Name (With_Clause)) = Name_System) | |
7575 | and then Comes_From_Source (With_Clause) | |
7576 | then | |
7577 | return With_Clause; | |
7578 | end if; | |
7579 | ||
7580 | Next (With_Clause); | |
7581 | end loop; | |
7582 | ||
7583 | return Empty; | |
7584 | end Find_System; | |
7585 | ||
7586 | -- Start of processing for Present_System_Aux | |
7587 | ||
7588 | begin | |
bc41faa2 | 7589 | -- The child unit may have been loaded and analyzed already |
996ae0b0 RK |
7590 | |
7591 | if Present (System_Aux_Id) then | |
7592 | return True; | |
7593 | ||
7594 | -- If no previous pragma for System.Aux, nothing to load | |
7595 | ||
fbf5a39b | 7596 | elsif No (System_Extend_Unit) then |
996ae0b0 RK |
7597 | return False; |
7598 | ||
7599 | -- Use the unit name given in the pragma to retrieve the unit. | |
7600 | -- Verify that System itself appears in the context clause of the | |
7601 | -- current compilation. If System is not present, an error will | |
7602 | -- have been reported already. | |
7603 | ||
7604 | else | |
7605 | With_Sys := Find_System (Cunit (Current_Sem_Unit)); | |
7606 | ||
7607 | The_Unit := Unit (Cunit (Current_Sem_Unit)); | |
7608 | ||
7609 | if No (With_Sys) | |
294ccb21 RD |
7610 | and then |
7611 | (Nkind (The_Unit) = N_Package_Body | |
ac7d724d ES |
7612 | or else (Nkind (The_Unit) = N_Subprogram_Body |
7613 | and then not Acts_As_Spec (Cunit (Current_Sem_Unit)))) | |
996ae0b0 RK |
7614 | then |
7615 | With_Sys := Find_System (Library_Unit (Cunit (Current_Sem_Unit))); | |
7616 | end if; | |
7617 | ||
ac7d724d ES |
7618 | if No (With_Sys) and then Present (N) then |
7619 | ||
996ae0b0 RK |
7620 | -- If we are compiling a subunit, we need to examine its |
7621 | -- context as well (Current_Sem_Unit is the parent unit); | |
7622 | ||
7623 | The_Unit := Parent (N); | |
996ae0b0 RK |
7624 | while Nkind (The_Unit) /= N_Compilation_Unit loop |
7625 | The_Unit := Parent (The_Unit); | |
7626 | end loop; | |
7627 | ||
7628 | if Nkind (Unit (The_Unit)) = N_Subunit then | |
7629 | With_Sys := Find_System (The_Unit); | |
7630 | end if; | |
7631 | end if; | |
7632 | ||
7633 | if No (With_Sys) then | |
7634 | return False; | |
7635 | end if; | |
7636 | ||
7637 | Loc := Sloc (With_Sys); | |
fbf5a39b | 7638 | Get_Name_String (Chars (Expression (System_Extend_Unit))); |
996ae0b0 RK |
7639 | Name_Buffer (8 .. Name_Len + 7) := Name_Buffer (1 .. Name_Len); |
7640 | Name_Buffer (1 .. 7) := "system."; | |
7641 | Name_Buffer (Name_Len + 8) := '%'; | |
7642 | Name_Buffer (Name_Len + 9) := 's'; | |
7643 | Name_Len := Name_Len + 9; | |
7644 | Aux_Name := Name_Find; | |
7645 | ||
7646 | Unum := | |
7647 | Load_Unit | |
7648 | (Load_Name => Aux_Name, | |
7649 | Required => False, | |
7650 | Subunit => False, | |
7651 | Error_Node => With_Sys); | |
7652 | ||
7653 | if Unum /= No_Unit then | |
7654 | Semantics (Cunit (Unum)); | |
7655 | System_Aux_Id := | |
7656 | Defining_Entity (Specification (Unit (Cunit (Unum)))); | |
7657 | ||
16ca248a ES |
7658 | Withn := |
7659 | Make_With_Clause (Loc, | |
7660 | Name => | |
7661 | Make_Expanded_Name (Loc, | |
7662 | Chars => Chars (System_Aux_Id), | |
7663 | Prefix => New_Reference_To (Scope (System_Aux_Id), Loc), | |
7664 | Selector_Name => New_Reference_To (System_Aux_Id, Loc))); | |
996ae0b0 RK |
7665 | |
7666 | Set_Entity (Name (Withn), System_Aux_Id); | |
7667 | ||
16ca248a ES |
7668 | Set_Library_Unit (Withn, Cunit (Unum)); |
7669 | Set_Corresponding_Spec (Withn, System_Aux_Id); | |
7670 | Set_First_Name (Withn, True); | |
7671 | Set_Implicit_With (Withn, True); | |
996ae0b0 RK |
7672 | |
7673 | Insert_After (With_Sys, Withn); | |
7674 | Mark_Rewrite_Insertion (Withn); | |
7675 | Set_Context_Installed (Withn); | |
7676 | ||
7677 | return True; | |
7678 | ||
7679 | -- Here if unit load failed | |
7680 | ||
7681 | else | |
7682 | Error_Msg_Name_1 := Name_System; | |
fbf5a39b | 7683 | Error_Msg_Name_2 := Chars (Expression (System_Extend_Unit)); |
996ae0b0 RK |
7684 | Error_Msg_N |
7685 | ("extension package `%.%` does not exist", | |
fbf5a39b | 7686 | Opt.System_Extend_Unit); |
996ae0b0 RK |
7687 | return False; |
7688 | end if; | |
7689 | end if; | |
7690 | end Present_System_Aux; | |
7691 | ||
7692 | ------------------------- | |
7693 | -- Restore_Scope_Stack -- | |
7694 | ------------------------- | |
7695 | ||
e530a2d1 AC |
7696 | procedure Restore_Scope_Stack |
7697 | (List : Elist_Id; | |
7698 | Handle_Use : Boolean := True) | |
7699 | is | |
7700 | SS_Last : constant Int := Scope_Stack.Last; | |
7701 | Elmt : Elmt_Id; | |
996ae0b0 RK |
7702 | |
7703 | begin | |
9e40f163 AC |
7704 | -- Restore visibility of previous scope stack, if any, using the list |
7705 | -- we saved (we use Remove, since this list will not be used again). | |
996ae0b0 | 7706 | |
9e40f163 AC |
7707 | loop |
7708 | Elmt := Last_Elmt (List); | |
7709 | exit when Elmt = No_Elmt; | |
e530a2d1 | 7710 | Set_Is_Immediately_Visible (Node (Elmt)); |
9e40f163 | 7711 | Remove_Last_Elmt (List); |
996ae0b0 | 7712 | end loop; |
fbf5a39b | 7713 | |
9e40f163 AC |
7714 | -- Restore use clauses |
7715 | ||
fbf5a39b AC |
7716 | if SS_Last >= Scope_Stack.First |
7717 | and then Scope_Stack.Table (SS_Last).Entity /= Standard_Standard | |
ecad994d | 7718 | and then Handle_Use |
fbf5a39b AC |
7719 | then |
7720 | Install_Use_Clauses (Scope_Stack.Table (SS_Last).First_Use_Clause); | |
7721 | end if; | |
996ae0b0 RK |
7722 | end Restore_Scope_Stack; |
7723 | ||
7724 | ---------------------- | |
7725 | -- Save_Scope_Stack -- | |
7726 | ---------------------- | |
7727 | ||
9e40f163 AC |
7728 | -- Save_Scope_Stack/Restore_Scope_Stack were originally designed to avoid |
7729 | -- consuming any memory. That is, Save_Scope_Stack took care of removing | |
7730 | -- from immediate visibility entities and Restore_Scope_Stack took care | |
7731 | -- of restoring their visibility analyzing the context of each entity. The | |
7732 | -- problem of such approach is that it was fragile and caused unexpected | |
7733 | -- visibility problems, and indeed one test was found where there was a | |
7734 | -- real problem. | |
7735 | ||
7736 | -- Furthermore, the following experiment was carried out: | |
7737 | ||
7738 | -- - Save_Scope_Stack was modified to store in an Elist1 all those | |
7739 | -- entities whose attribute Is_Immediately_Visible is modified | |
7740 | -- from True to False. | |
7741 | ||
7742 | -- - Restore_Scope_Stack was modified to store in another Elist2 | |
7743 | -- all the entities whose attribute Is_Immediately_Visible is | |
7744 | -- modified from False to True. | |
7745 | ||
7746 | -- - Extra code was added to verify that all the elements of Elist1 | |
7747 | -- are found in Elist2 | |
7748 | ||
a35017dc | 7749 | -- This test shows that there may be more occurrences of this problem which |
9e40f163 AC |
7750 | -- have not yet been detected. As a result, we replaced that approach by |
7751 | -- the current one in which Save_Scope_Stack returns the list of entities | |
a35017dc | 7752 | -- whose visibility is changed, and that list is passed to Restore_Scope_ |
9e40f163 AC |
7753 | -- Stack to undo that change. This approach is simpler and safer, although |
7754 | -- it consumes more memory. | |
7755 | ||
e530a2d1 AC |
7756 | function Save_Scope_Stack (Handle_Use : Boolean := True) return Elist_Id is |
7757 | Result : constant Elist_Id := New_Elmt_List; | |
996ae0b0 RK |
7758 | E : Entity_Id; |
7759 | S : Entity_Id; | |
7760 | SS_Last : constant Int := Scope_Stack.Last; | |
7761 | ||
e530a2d1 AC |
7762 | procedure Remove_From_Visibility (E : Entity_Id); |
7763 | -- If E is immediately visible then append it to the result and remove | |
85f6a831 RD |
7764 | -- it temporarily from visibility. |
7765 | ||
7766 | ---------------------------- | |
7767 | -- Remove_From_Visibility -- | |
7768 | ---------------------------- | |
7769 | ||
e530a2d1 AC |
7770 | procedure Remove_From_Visibility (E : Entity_Id) is |
7771 | begin | |
7772 | if Is_Immediately_Visible (E) then | |
7773 | Append_Elmt (E, Result); | |
7774 | Set_Is_Immediately_Visible (E, False); | |
7775 | end if; | |
7776 | end Remove_From_Visibility; | |
7777 | ||
85f6a831 RD |
7778 | -- Start of processing for Save_Scope_Stack |
7779 | ||
996ae0b0 RK |
7780 | begin |
7781 | if SS_Last >= Scope_Stack.First | |
7782 | and then Scope_Stack.Table (SS_Last).Entity /= Standard_Standard | |
7783 | then | |
ecad994d AC |
7784 | if Handle_Use then |
7785 | End_Use_Clauses (Scope_Stack.Table (SS_Last).First_Use_Clause); | |
7786 | end if; | |
fbf5a39b | 7787 | |
16ca248a ES |
7788 | -- If the call is from within a compilation unit, as when called from |
7789 | -- Rtsfind, make current entries in scope stack invisible while we | |
7790 | -- analyze the new unit. | |
996ae0b0 RK |
7791 | |
7792 | for J in reverse 0 .. SS_Last loop | |
7793 | exit when Scope_Stack.Table (J).Entity = Standard_Standard | |
7794 | or else No (Scope_Stack.Table (J).Entity); | |
7795 | ||
7796 | S := Scope_Stack.Table (J).Entity; | |
e530a2d1 AC |
7797 | |
7798 | Remove_From_Visibility (S); | |
996ae0b0 | 7799 | |
16ca248a | 7800 | E := First_Entity (S); |
996ae0b0 | 7801 | while Present (E) loop |
e530a2d1 | 7802 | Remove_From_Visibility (E); |
996ae0b0 RK |
7803 | Next_Entity (E); |
7804 | end loop; | |
7805 | end loop; | |
7806 | ||
7807 | end if; | |
e530a2d1 AC |
7808 | |
7809 | return Result; | |
996ae0b0 RK |
7810 | end Save_Scope_Stack; |
7811 | ||
7812 | ------------- | |
7813 | -- Set_Use -- | |
7814 | ------------- | |
7815 | ||
7816 | procedure Set_Use (L : List_Id) is | |
7817 | Decl : Node_Id; | |
7818 | Pack_Name : Node_Id; | |
7819 | Pack : Entity_Id; | |
7820 | Id : Entity_Id; | |
7821 | ||
7822 | begin | |
7823 | if Present (L) then | |
7824 | Decl := First (L); | |
996ae0b0 RK |
7825 | while Present (Decl) loop |
7826 | if Nkind (Decl) = N_Use_Package_Clause then | |
7827 | Chain_Use_Clause (Decl); | |
996ae0b0 | 7828 | |
16ca248a | 7829 | Pack_Name := First (Names (Decl)); |
996ae0b0 RK |
7830 | while Present (Pack_Name) loop |
7831 | Pack := Entity (Pack_Name); | |
7832 | ||
7833 | if Ekind (Pack) = E_Package | |
7834 | and then Applicable_Use (Pack_Name) | |
7835 | then | |
7836 | Use_One_Package (Pack, Decl); | |
7837 | end if; | |
7838 | ||
7839 | Next (Pack_Name); | |
7840 | end loop; | |
7841 | ||
7842 | elsif Nkind (Decl) = N_Use_Type_Clause then | |
7843 | Chain_Use_Clause (Decl); | |
996ae0b0 | 7844 | |
16ca248a | 7845 | Id := First (Subtype_Marks (Decl)); |
996ae0b0 RK |
7846 | while Present (Id) loop |
7847 | if Entity (Id) /= Any_Type then | |
07fc65c4 | 7848 | Use_One_Type (Id); |
996ae0b0 RK |
7849 | end if; |
7850 | ||
7851 | Next (Id); | |
7852 | end loop; | |
7853 | end if; | |
7854 | ||
7855 | Next (Decl); | |
7856 | end loop; | |
7857 | end if; | |
7858 | end Set_Use; | |
7859 | ||
7860 | --------------------- | |
7861 | -- Use_One_Package -- | |
7862 | --------------------- | |
7863 | ||
7864 | procedure Use_One_Package (P : Entity_Id; N : Node_Id) is | |
7865 | Id : Entity_Id; | |
7866 | Prev : Entity_Id; | |
7867 | Current_Instance : Entity_Id := Empty; | |
7868 | Real_P : Entity_Id; | |
9bc856dd | 7869 | Private_With_OK : Boolean := False; |
996ae0b0 RK |
7870 | |
7871 | begin | |
7872 | if Ekind (P) /= E_Package then | |
7873 | return; | |
7874 | end if; | |
7875 | ||
7876 | Set_In_Use (P); | |
d4810530 | 7877 | Set_Current_Use_Clause (P, N); |
996ae0b0 | 7878 | |
0ab80019 | 7879 | -- Ada 2005 (AI-50217): Check restriction |
19f0526a | 7880 | |
996ae0b0 | 7881 | if From_With_Type (P) then |
657a9dd9 | 7882 | Error_Msg_N ("limited withed package cannot appear in use clause", N); |
996ae0b0 RK |
7883 | end if; |
7884 | ||
bc41faa2 | 7885 | -- Find enclosing instance, if any |
996ae0b0 RK |
7886 | |
7887 | if In_Instance then | |
7888 | Current_Instance := Current_Scope; | |
996ae0b0 RK |
7889 | while not Is_Generic_Instance (Current_Instance) loop |
7890 | Current_Instance := Scope (Current_Instance); | |
7891 | end loop; | |
7892 | ||
7893 | if No (Hidden_By_Use_Clause (N)) then | |
7894 | Set_Hidden_By_Use_Clause (N, New_Elmt_List); | |
7895 | end if; | |
7896 | end if; | |
7897 | ||
7898 | -- If unit is a package renaming, indicate that the renamed | |
7899 | -- package is also in use (the flags on both entities must | |
7900 | -- remain consistent, and a subsequent use of either of them | |
7901 | -- should be recognized as redundant). | |
7902 | ||
7903 | if Present (Renamed_Object (P)) then | |
7904 | Set_In_Use (Renamed_Object (P)); | |
d4810530 | 7905 | Set_Current_Use_Clause (Renamed_Object (P), N); |
996ae0b0 RK |
7906 | Real_P := Renamed_Object (P); |
7907 | else | |
7908 | Real_P := P; | |
7909 | end if; | |
7910 | ||
0ab80019 | 7911 | -- Ada 2005 (AI-262): Check the use_clause of a private withed package |
9bc856dd AC |
7912 | -- found in the private part of a package specification |
7913 | ||
7914 | if In_Private_Part (Current_Scope) | |
7915 | and then Has_Private_With (P) | |
7916 | and then Is_Child_Unit (Current_Scope) | |
7917 | and then Is_Child_Unit (P) | |
7918 | and then Is_Ancestor_Package (Scope (Current_Scope), P) | |
7919 | then | |
7920 | Private_With_OK := True; | |
7921 | end if; | |
7922 | ||
996ae0b0 RK |
7923 | -- Loop through entities in one package making them potentially |
7924 | -- use-visible. | |
7925 | ||
7926 | Id := First_Entity (P); | |
7927 | while Present (Id) | |
9bc856dd | 7928 | and then (Id /= First_Private_Entity (P) |
ac7d724d | 7929 | or else Private_With_OK) -- Ada 2005 (AI-262) |
996ae0b0 RK |
7930 | loop |
7931 | Prev := Current_Entity (Id); | |
996ae0b0 RK |
7932 | while Present (Prev) loop |
7933 | if Is_Immediately_Visible (Prev) | |
7934 | and then (not Is_Overloadable (Prev) | |
7935 | or else not Is_Overloadable (Id) | |
7936 | or else (Type_Conformant (Id, Prev))) | |
7937 | then | |
7938 | if No (Current_Instance) then | |
7939 | ||
7940 | -- Potentially use-visible entity remains hidden | |
7941 | ||
7942 | goto Next_Usable_Entity; | |
7943 | ||
16ca248a ES |
7944 | -- A use clause within an instance hides outer global entities, |
7945 | -- which are not used to resolve local entities in the | |
7946 | -- instance. Note that the predefined entities in Standard | |
7947 | -- could not have been hidden in the generic by a use clause, | |
7948 | -- and therefore remain visible. Other compilation units whose | |
7949 | -- entities appear in Standard must be hidden in an instance. | |
996ae0b0 RK |
7950 | |
7951 | -- To determine whether an entity is external to the instance | |
7952 | -- we compare the scope depth of its scope with that of the | |
7953 | -- current instance. However, a generic actual of a subprogram | |
7954 | -- instance is declared in the wrapper package but will not be | |
e074d476 AC |
7955 | -- hidden by a use-visible entity. similarly, an entity that is |
7956 | -- declared in an enclosing instance will not be hidden by an | |
7957 | -- an entity declared in a generic actual, which can only have | |
7958 | -- been use-visible in the generic and will not have hidden the | |
7959 | -- entity in the generic parent. | |
996ae0b0 | 7960 | |
82c80734 RD |
7961 | -- If Id is called Standard, the predefined package with the |
7962 | -- same name is in the homonym chain. It has to be ignored | |
7963 | -- because it has no defined scope (being the only entity in | |
7964 | -- the system with this mandated behavior). | |
7965 | ||
996ae0b0 | 7966 | elsif not Is_Hidden (Id) |
82c80734 | 7967 | and then Present (Scope (Prev)) |
996ae0b0 RK |
7968 | and then not Is_Wrapper_Package (Scope (Prev)) |
7969 | and then Scope_Depth (Scope (Prev)) < | |
7970 | Scope_Depth (Current_Instance) | |
7971 | and then (Scope (Prev) /= Standard_Standard | |
7972 | or else Sloc (Prev) > Standard_Location) | |
7973 | then | |
e074d476 AC |
7974 | if In_Open_Scopes (Scope (Prev)) |
7975 | and then Is_Generic_Instance (Scope (Prev)) | |
c94a0b9d AC |
7976 | and then Present (Associated_Formal_Package (P)) |
7977 | then | |
7978 | null; | |
7979 | ||
7980 | else | |
7981 | Set_Is_Potentially_Use_Visible (Id); | |
7982 | Set_Is_Immediately_Visible (Prev, False); | |
7983 | Append_Elmt (Prev, Hidden_By_Use_Clause (N)); | |
7984 | end if; | |
996ae0b0 RK |
7985 | end if; |
7986 | ||
16ca248a ES |
7987 | -- A user-defined operator is not use-visible if the predefined |
7988 | -- operator for the type is immediately visible, which is the case | |
7989 | -- if the type of the operand is in an open scope. This does not | |
7990 | -- apply to user-defined operators that have operands of different | |
7991 | -- types, because the predefined mixed mode operations (multiply | |
7992 | -- and divide) apply to universal types and do not hide anything. | |
996ae0b0 RK |
7993 | |
7994 | elsif Ekind (Prev) = E_Operator | |
7995 | and then Operator_Matches_Spec (Prev, Id) | |
7996 | and then In_Open_Scopes | |
ac7d724d | 7997 | (Scope (Base_Type (Etype (First_Formal (Id))))) |
996ae0b0 | 7998 | and then (No (Next_Formal (First_Formal (Id))) |
ac7d724d ES |
7999 | or else Etype (First_Formal (Id)) = |
8000 | Etype (Next_Formal (First_Formal (Id))) | |
996ae0b0 RK |
8001 | or else Chars (Prev) = Name_Op_Expon) |
8002 | then | |
8003 | goto Next_Usable_Entity; | |
e69614ad AC |
8004 | |
8005 | -- In an instance, two homonyms may become use_visible through the | |
8006 | -- actuals of distinct formal packages. In the generic, only the | |
8007 | -- current one would have been visible, so make the other one | |
8008 | -- not use_visible. | |
8009 | ||
8010 | elsif Present (Current_Instance) | |
8011 | and then Is_Potentially_Use_Visible (Prev) | |
8012 | and then not Is_Overloadable (Prev) | |
8013 | and then Scope (Id) /= Scope (Prev) | |
8014 | and then Used_As_Generic_Actual (Scope (Prev)) | |
8015 | and then Used_As_Generic_Actual (Scope (Id)) | |
30196a76 RD |
8016 | and then not In_Same_List (Current_Use_Clause (Scope (Prev)), |
8017 | Current_Use_Clause (Scope (Id))) | |
e69614ad AC |
8018 | then |
8019 | Set_Is_Potentially_Use_Visible (Prev, False); | |
8020 | Append_Elmt (Prev, Hidden_By_Use_Clause (N)); | |
996ae0b0 RK |
8021 | end if; |
8022 | ||
8023 | Prev := Homonym (Prev); | |
8024 | end loop; | |
8025 | ||
bc41faa2 | 8026 | -- On exit, we know entity is not hidden, unless it is private |
996ae0b0 RK |
8027 | |
8028 | if not Is_Hidden (Id) | |
ac7d724d | 8029 | and then ((not Is_Child_Unit (Id)) or else Is_Visible_Lib_Unit (Id)) |
996ae0b0 RK |
8030 | then |
8031 | Set_Is_Potentially_Use_Visible (Id); | |
8032 | ||
ac7d724d | 8033 | if Is_Private_Type (Id) and then Present (Full_View (Id)) then |
996ae0b0 RK |
8034 | Set_Is_Potentially_Use_Visible (Full_View (Id)); |
8035 | end if; | |
8036 | end if; | |
8037 | ||
8038 | <<Next_Usable_Entity>> | |
8039 | Next_Entity (Id); | |
8040 | end loop; | |
8041 | ||
16ca248a ES |
8042 | -- Child units are also made use-visible by a use clause, but they may |
8043 | -- appear after all visible declarations in the parent entity list. | |
996ae0b0 RK |
8044 | |
8045 | while Present (Id) loop | |
8398e82e | 8046 | if Is_Child_Unit (Id) and then Is_Visible_Lib_Unit (Id) then |
996ae0b0 RK |
8047 | Set_Is_Potentially_Use_Visible (Id); |
8048 | end if; | |
8049 | ||
8050 | Next_Entity (Id); | |
8051 | end loop; | |
8052 | ||
8053 | if Chars (Real_P) = Name_System | |
8054 | and then Scope (Real_P) = Standard_Standard | |
8055 | and then Present_System_Aux (N) | |
8056 | then | |
8057 | Use_One_Package (System_Aux_Id, N); | |
8058 | end if; | |
8059 | ||
8060 | end Use_One_Package; | |
8061 | ||
8062 | ------------------ | |
8063 | -- Use_One_Type -- | |
8064 | ------------------ | |
8065 | ||
7ff2d234 | 8066 | procedure Use_One_Type (Id : Node_Id; Installed : Boolean := False) is |
954c111a HK |
8067 | Elmt : Elmt_Id; |
8068 | Is_Known_Used : Boolean; | |
8069 | Op_List : Elist_Id; | |
8070 | T : Entity_Id; | |
8071 | ||
8072 | function Spec_Reloaded_For_Body return Boolean; | |
8073 | -- Determine whether the compilation unit is a package body and the use | |
8074 | -- type clause is in the spec of the same package. Even though the spec | |
8075 | -- was analyzed first, its context is reloaded when analysing the body. | |
8076 | ||
29efbb8c ES |
8077 | procedure Use_Class_Wide_Operations (Typ : Entity_Id); |
8078 | -- AI05-150: if the use_type_clause carries the "all" qualifier, | |
8079 | -- class-wide operations of ancestor types are use-visible if the | |
8080 | -- ancestor type is visible. | |
8081 | ||
954c111a HK |
8082 | ---------------------------- |
8083 | -- Spec_Reloaded_For_Body -- | |
8084 | ---------------------------- | |
8085 | ||
8086 | function Spec_Reloaded_For_Body return Boolean is | |
8087 | begin | |
8088 | if Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Body then | |
8089 | declare | |
8090 | Spec : constant Node_Id := | |
8091 | Parent (List_Containing (Parent (Id))); | |
f146302c | 8092 | |
d99ff0f4 | 8093 | begin |
f146302c AC |
8094 | -- Check whether type is declared in a package specification, |
8095 | -- and current unit is the corresponding package body. The | |
8096 | -- use clauses themselves may be within a nested package. | |
8097 | ||
954c111a HK |
8098 | return |
8099 | Nkind (Spec) = N_Package_Specification | |
d99ff0f4 AC |
8100 | and then |
8101 | In_Same_Source_Unit (Corresponding_Body (Parent (Spec)), | |
8102 | Cunit_Entity (Current_Sem_Unit)); | |
954c111a HK |
8103 | end; |
8104 | end if; | |
8105 | ||
8106 | return False; | |
8107 | end Spec_Reloaded_For_Body; | |
8108 | ||
29efbb8c ES |
8109 | ------------------------------- |
8110 | -- Use_Class_Wide_Operations -- | |
8111 | ------------------------------- | |
8112 | ||
8113 | procedure Use_Class_Wide_Operations (Typ : Entity_Id) is | |
8114 | Scop : Entity_Id; | |
8115 | Ent : Entity_Id; | |
8116 | ||
8117 | function Is_Class_Wide_Operation_Of | |
8118 | (Op : Entity_Id; | |
8119 | T : Entity_Id) return Boolean; | |
8120 | -- Determine whether a subprogram has a class-wide parameter or | |
8121 | -- result that is T'Class. | |
8122 | ||
8123 | --------------------------------- | |
8124 | -- Is_Class_Wide_Operation_Of -- | |
8125 | --------------------------------- | |
8126 | ||
8127 | function Is_Class_Wide_Operation_Of | |
8128 | (Op : Entity_Id; | |
8129 | T : Entity_Id) return Boolean | |
8130 | is | |
8131 | Formal : Entity_Id; | |
8132 | ||
8133 | begin | |
8134 | Formal := First_Formal (Op); | |
8135 | while Present (Formal) loop | |
8136 | if Etype (Formal) = Class_Wide_Type (T) then | |
8137 | return True; | |
8138 | end if; | |
8139 | Next_Formal (Formal); | |
8140 | end loop; | |
8141 | ||
8142 | if Etype (Op) = Class_Wide_Type (T) then | |
8143 | return True; | |
8144 | end if; | |
8145 | ||
8146 | return False; | |
8147 | end Is_Class_Wide_Operation_Of; | |
8148 | ||
8149 | -- Start of processing for Use_Class_Wide_Operations | |
8150 | ||
8151 | begin | |
8152 | Scop := Scope (Typ); | |
8153 | if not Is_Hidden (Scop) then | |
8154 | Ent := First_Entity (Scop); | |
8155 | while Present (Ent) loop | |
8156 | if Is_Overloadable (Ent) | |
8157 | and then Is_Class_Wide_Operation_Of (Ent, Typ) | |
8158 | and then not Is_Potentially_Use_Visible (Ent) | |
8159 | then | |
8160 | Set_Is_Potentially_Use_Visible (Ent); | |
8161 | Append_Elmt (Ent, Used_Operations (Parent (Id))); | |
8162 | end if; | |
8163 | ||
8164 | Next_Entity (Ent); | |
8165 | end loop; | |
8166 | end if; | |
8167 | ||
8168 | if Is_Derived_Type (Typ) then | |
8169 | Use_Class_Wide_Operations (Etype (Base_Type (Typ))); | |
8170 | end if; | |
8171 | end Use_Class_Wide_Operations; | |
8172 | ||
dea1d3dc | 8173 | -- Start of processing for Use_One_Type |
996ae0b0 RK |
8174 | |
8175 | begin | |
8176 | -- It is the type determined by the subtype mark (8.4(8)) whose | |
8177 | -- operations become potentially use-visible. | |
8178 | ||
8179 | T := Base_Type (Entity (Id)); | |
8180 | ||
954c111a HK |
8181 | -- Either the type itself is used, the package where it is declared |
8182 | -- is in use or the entity is declared in the current package, thus | |
8183 | -- use-visible. | |
8184 | ||
8185 | Is_Known_Used := | |
8186 | In_Use (T) | |
8187 | or else In_Use (Scope (T)) | |
8188 | or else Scope (T) = Current_Scope; | |
8189 | ||
8190 | Set_Redundant_Use (Id, | |
8191 | Is_Known_Used or else Is_Potentially_Use_Visible (T)); | |
996ae0b0 | 8192 | |
ecc4ddde AC |
8193 | if Ekind (T) = E_Incomplete_Type then |
8194 | Error_Msg_N ("premature usage of incomplete type", Id); | |
8195 | ||
8196 | elsif In_Open_Scopes (Scope (T)) then | |
996ae0b0 RK |
8197 | null; |
8198 | ||
f7ca1d04 AC |
8199 | -- A limited view cannot appear in a use_type clause. However, an access |
8200 | -- type whose designated type is limited has the flag but is not itself | |
8201 | -- a limited view unless we only have a limited view of its enclosing | |
8202 | -- package. | |
294ccb21 | 8203 | |
ac7d724d | 8204 | elsif From_With_Type (T) and then From_With_Type (Scope (T)) then |
923fa078 RD |
8205 | Error_Msg_N |
8206 | ("incomplete type from limited view " | |
ac7d724d | 8207 | & "cannot appear in use clause", Id); |
923fa078 | 8208 | |
fbf5a39b AC |
8209 | -- If the subtype mark designates a subtype in a different package, |
8210 | -- we have to check that the parent type is visible, otherwise the | |
8211 | -- use type clause is a noop. Not clear how to do that??? | |
8212 | ||
996ae0b0 RK |
8213 | elsif not Redundant_Use (Id) then |
8214 | Set_In_Use (T); | |
c3b36d48 AC |
8215 | |
8216 | -- If T is tagged, primitive operators on class-wide operands | |
8217 | -- are also available. | |
8218 | ||
8219 | if Is_Tagged_Type (T) then | |
8220 | Set_In_Use (Class_Wide_Type (T)); | |
8221 | end if; | |
8222 | ||
21d27997 | 8223 | Set_Current_Use_Clause (T, Parent (Id)); |
996ae0b0 | 8224 | |
29efbb8c ES |
8225 | -- Iterate over primitive operations of the type. If an operation is |
8226 | -- already use_visible, it is the result of a previous use_clause, | |
7ff2d234 AC |
8227 | -- and already appears on the corresponding entity chain. If the |
8228 | -- clause is being reinstalled, operations are already use-visible. | |
29efbb8c | 8229 | |
7ff2d234 AC |
8230 | if Installed then |
8231 | null; | |
29efbb8c | 8232 | |
7ff2d234 AC |
8233 | else |
8234 | Op_List := Collect_Primitive_Operations (T); | |
8235 | Elmt := First_Elmt (Op_List); | |
8236 | while Present (Elmt) loop | |
8237 | if (Nkind (Node (Elmt)) = N_Defining_Operator_Symbol | |
8238 | or else Chars (Node (Elmt)) in Any_Operator_Name) | |
8239 | and then not Is_Hidden (Node (Elmt)) | |
8240 | and then not Is_Potentially_Use_Visible (Node (Elmt)) | |
8241 | then | |
8242 | Set_Is_Potentially_Use_Visible (Node (Elmt)); | |
8243 | Append_Elmt (Node (Elmt), Used_Operations (Parent (Id))); | |
996ae0b0 | 8244 | |
7ff2d234 AC |
8245 | elsif Ada_Version >= Ada_2012 |
8246 | and then All_Present (Parent (Id)) | |
8247 | and then not Is_Hidden (Node (Elmt)) | |
8248 | and then not Is_Potentially_Use_Visible (Node (Elmt)) | |
8249 | then | |
8250 | Set_Is_Potentially_Use_Visible (Node (Elmt)); | |
8251 | Append_Elmt (Node (Elmt), Used_Operations (Parent (Id))); | |
8252 | end if; | |
954c111a | 8253 | |
7ff2d234 AC |
8254 | Next_Elmt (Elmt); |
8255 | end loop; | |
8256 | end if; | |
8257 | ||
8258 | if Ada_Version >= Ada_2012 | |
8259 | and then All_Present (Parent (Id)) | |
8260 | and then Is_Tagged_Type (T) | |
8261 | then | |
8262 | Use_Class_Wide_Operations (T); | |
8263 | end if; | |
29efbb8c ES |
8264 | end if; |
8265 | ||
954c111a HK |
8266 | -- If warning on redundant constructs, check for unnecessary WITH |
8267 | ||
8268 | if Warn_On_Redundant_Constructs | |
8269 | and then Is_Known_Used | |
8270 | ||
ac7d724d ES |
8271 | -- with P; with P; use P; |
8272 | -- package P is package X is package body X is | |
8273 | -- type T ... use P.T; | |
954c111a | 8274 | |
ac7d724d ES |
8275 | -- The compilation unit is the body of X. GNAT first compiles the |
8276 | -- spec of X, then proceeds to the body. At that point P is marked | |
8277 | -- as use visible. The analysis then reinstalls the spec along with | |
8278 | -- its context. The use clause P.T is now recognized as redundant, | |
8279 | -- but in the wrong context. Do not emit a warning in such cases. | |
8280 | -- Do not emit a warning either if we are in an instance, there is | |
8281 | -- no redundancy between an outer use_clause and one that appears | |
8282 | -- within the generic. | |
954c111a HK |
8283 | |
8284 | and then not Spec_Reloaded_For_Body | |
c56094bd | 8285 | and then not In_Instance |
954c111a HK |
8286 | then |
8287 | -- The type already has a use clause | |
8288 | ||
8289 | if In_Use (T) then | |
3ea52b2e ES |
8290 | |
8291 | -- Case where we know the current use clause for the type | |
8292 | ||
21d27997 | 8293 | if Present (Current_Use_Clause (T)) then |
44b90160 | 8294 | Use_Clause_Known : declare |
21d27997 RD |
8295 | Clause1 : constant Node_Id := Parent (Id); |
8296 | Clause2 : constant Node_Id := Current_Use_Clause (T); | |
3ea52b2e ES |
8297 | Ent1 : Entity_Id; |
8298 | Ent2 : Entity_Id; | |
21d27997 RD |
8299 | Err_No : Node_Id; |
8300 | Unit1 : Node_Id; | |
8301 | Unit2 : Node_Id; | |
8302 | ||
7ca139d3 TQ |
8303 | function Entity_Of_Unit (U : Node_Id) return Entity_Id; |
8304 | -- Return the appropriate entity for determining which unit | |
8305 | -- has a deeper scope: the defining entity for U, unless U | |
8306 | -- is a package instance, in which case we retrieve the | |
8307 | -- entity of the instance spec. | |
8308 | ||
8309 | -------------------- | |
8310 | -- Entity_Of_Unit -- | |
8311 | -------------------- | |
8312 | ||
8313 | function Entity_Of_Unit (U : Node_Id) return Entity_Id is | |
8314 | begin | |
8315 | if Nkind (U) = N_Package_Instantiation | |
8316 | and then Analyzed (U) | |
8317 | then | |
8318 | return Defining_Entity (Instance_Spec (U)); | |
8319 | else | |
8320 | return Defining_Entity (U); | |
8321 | end if; | |
8322 | end Entity_Of_Unit; | |
8323 | ||
44b90160 RD |
8324 | -- Start of processing for Use_Clause_Known |
8325 | ||
21d27997 | 8326 | begin |
f7ca1d04 AC |
8327 | -- If both current use type clause and the use type clause |
8328 | -- for the type are at the compilation unit level, one of | |
8329 | -- the units must be an ancestor of the other, and the | |
8330 | -- warning belongs on the descendant. | |
3ea52b2e | 8331 | |
21d27997 | 8332 | if Nkind (Parent (Clause1)) = N_Compilation_Unit |
3ea52b2e ES |
8333 | and then |
8334 | Nkind (Parent (Clause2)) = N_Compilation_Unit | |
21d27997 | 8335 | then |
b0d3b11d AC |
8336 | -- If the unit is a subprogram body that acts as spec, |
8337 | -- the context clause is shared with the constructed | |
8338 | -- subprogram spec. Clearly there is no redundancy. | |
8339 | ||
8340 | if Clause1 = Clause2 then | |
8341 | return; | |
8342 | end if; | |
8343 | ||
3ea52b2e ES |
8344 | Unit1 := Unit (Parent (Clause1)); |
8345 | Unit2 := Unit (Parent (Clause2)); | |
8346 | ||
32beb1f3 AC |
8347 | -- If both clauses are on same unit, or one is the body |
8348 | -- of the other, or one of them is in a subunit, report | |
8349 | -- redundancy on the later one. | |
f7ca1d04 AC |
8350 | |
8351 | if Unit1 = Unit2 then | |
8352 | Error_Msg_Sloc := Sloc (Current_Use_Clause (T)); | |
ed2233dc | 8353 | Error_Msg_NE -- CODEFIX |
f7ca1d04 | 8354 | ("& is already use-visible through previous " |
dbfeb4fa | 8355 | & "use_type_clause #??", Clause1, T); |
f7ca1d04 | 8356 | return; |
32beb1f3 AC |
8357 | |
8358 | elsif Nkind (Unit1) = N_Subunit then | |
8359 | Error_Msg_Sloc := Sloc (Current_Use_Clause (T)); | |
ed2233dc | 8360 | Error_Msg_NE -- CODEFIX |
32beb1f3 | 8361 | ("& is already use-visible through previous " |
dbfeb4fa | 8362 | & "use_type_clause #??", Clause1, T); |
32beb1f3 AC |
8363 | return; |
8364 | ||
8365 | elsif Nkind_In (Unit2, N_Package_Body, N_Subprogram_Body) | |
8366 | and then Nkind (Unit1) /= Nkind (Unit2) | |
8367 | and then Nkind (Unit1) /= N_Subunit | |
8368 | then | |
8369 | Error_Msg_Sloc := Sloc (Clause1); | |
ed2233dc | 8370 | Error_Msg_NE -- CODEFIX |
32beb1f3 | 8371 | ("& is already use-visible through previous " |
dbfeb4fa | 8372 | & "use_type_clause #??", Current_Use_Clause (T), T); |
32beb1f3 | 8373 | return; |
f7ca1d04 AC |
8374 | end if; |
8375 | ||
21d27997 RD |
8376 | -- There is a redundant use type clause in a child unit. |
8377 | -- Determine which of the units is more deeply nested. | |
3ea52b2e | 8378 | -- If a unit is a package instance, retrieve the entity |
7ca139d3 | 8379 | -- and its scope from the instance spec. |
21d27997 | 8380 | |
7ca139d3 TQ |
8381 | Ent1 := Entity_Of_Unit (Unit1); |
8382 | Ent2 := Entity_Of_Unit (Unit2); | |
3ea52b2e ES |
8383 | |
8384 | if Scope (Ent2) = Standard_Standard then | |
21d27997 RD |
8385 | Error_Msg_Sloc := Sloc (Current_Use_Clause (T)); |
8386 | Err_No := Clause1; | |
8387 | ||
3ea52b2e | 8388 | elsif Scope (Ent1) = Standard_Standard then |
21d27997 RD |
8389 | Error_Msg_Sloc := Sloc (Id); |
8390 | Err_No := Clause2; | |
8391 | ||
7ca139d3 TQ |
8392 | -- If both units are child units, we determine which one |
8393 | -- is the descendant by the scope distance to the | |
3ea52b2e | 8394 | -- ultimate parent unit. |
21d27997 | 8395 | |
3ea52b2e | 8396 | else |
21d27997 RD |
8397 | declare |
8398 | S1, S2 : Entity_Id; | |
8399 | ||
8400 | begin | |
3ea52b2e ES |
8401 | S1 := Scope (Ent1); |
8402 | S2 := Scope (Ent2); | |
c97c0163 AC |
8403 | while Present (S1) |
8404 | and then Present (S2) | |
8405 | and then S1 /= Standard_Standard | |
8406 | and then S2 /= Standard_Standard | |
21d27997 RD |
8407 | loop |
8408 | S1 := Scope (S1); | |
8409 | S2 := Scope (S2); | |
8410 | end loop; | |
8411 | ||
8412 | if S1 = Standard_Standard then | |
8413 | Error_Msg_Sloc := Sloc (Id); | |
8414 | Err_No := Clause2; | |
8415 | else | |
8416 | Error_Msg_Sloc := Sloc (Current_Use_Clause (T)); | |
8417 | Err_No := Clause1; | |
8418 | end if; | |
8419 | end; | |
8420 | end if; | |
8421 | ||
ed2233dc | 8422 | Error_Msg_NE -- CODEFIX |
21d27997 | 8423 | ("& is already use-visible through previous " |
dbfeb4fa | 8424 | & "use_type_clause #??", Err_No, Id); |
3ea52b2e ES |
8425 | |
8426 | -- Case where current use type clause and the use type | |
8427 | -- clause for the type are not both at the compilation unit | |
8428 | -- level. In this case we don't have location information. | |
8429 | ||
21d27997 | 8430 | else |
ed2233dc | 8431 | Error_Msg_NE -- CODEFIX |
3ea52b2e | 8432 | ("& is already use-visible through previous " |
dbfeb4fa | 8433 | & "use type clause??", Id, T); |
21d27997 | 8434 | end if; |
44b90160 | 8435 | end Use_Clause_Known; |
3ea52b2e ES |
8436 | |
8437 | -- Here if Current_Use_Clause is not set for T, another case | |
8438 | -- where we do not have the location information available. | |
8439 | ||
21d27997 | 8440 | else |
ed2233dc | 8441 | Error_Msg_NE -- CODEFIX |
3ea52b2e | 8442 | ("& is already use-visible through previous " |
dbfeb4fa | 8443 | & "use type clause??", Id, T); |
21d27997 | 8444 | end if; |
954c111a HK |
8445 | |
8446 | -- The package where T is declared is already used | |
8447 | ||
8448 | elsif In_Use (Scope (T)) then | |
8449 | Error_Msg_Sloc := Sloc (Current_Use_Clause (Scope (T))); | |
ed2233dc | 8450 | Error_Msg_NE -- CODEFIX |
dbfeb4fa | 8451 | ("& is already use-visible through package use clause #??", |
37951d8e | 8452 | Id, T); |
954c111a HK |
8453 | |
8454 | -- The current scope is the package where T is declared | |
8455 | ||
8456 | else | |
8457 | Error_Msg_Node_2 := Scope (T); | |
ed2233dc | 8458 | Error_Msg_NE -- CODEFIX |
dbfeb4fa | 8459 | ("& is already use-visible inside package &??", Id, T); |
954c111a HK |
8460 | end if; |
8461 | end if; | |
996ae0b0 RK |
8462 | end Use_One_Type; |
8463 | ||
8464 | ---------------- | |
8465 | -- Write_Info -- | |
8466 | ---------------- | |
8467 | ||
8468 | procedure Write_Info is | |
8469 | Id : Entity_Id := First_Entity (Current_Scope); | |
8470 | ||
8471 | begin | |
8472 | -- No point in dumping standard entities | |
8473 | ||
8474 | if Current_Scope = Standard_Standard then | |
8475 | return; | |
8476 | end if; | |
8477 | ||
8478 | Write_Str ("========================================================"); | |
8479 | Write_Eol; | |
8480 | Write_Str (" Defined Entities in "); | |
8481 | Write_Name (Chars (Current_Scope)); | |
8482 | Write_Eol; | |
8483 | Write_Str ("========================================================"); | |
8484 | Write_Eol; | |
8485 | ||
8486 | if No (Id) then | |
8487 | Write_Str ("-- none --"); | |
8488 | Write_Eol; | |
8489 | ||
8490 | else | |
8491 | while Present (Id) loop | |
8492 | Write_Entity_Info (Id, " "); | |
8493 | Next_Entity (Id); | |
8494 | end loop; | |
8495 | end if; | |
8496 | ||
8497 | if Scope (Current_Scope) = Standard_Standard then | |
8498 | ||
8499 | -- Print information on the current unit itself | |
8500 | ||
8501 | Write_Entity_Info (Current_Scope, " "); | |
8502 | end if; | |
8503 | ||
8504 | Write_Eol; | |
8505 | end Write_Info; | |
8506 | ||
67536dcb RD |
8507 | -------- |
8508 | -- ws -- | |
8509 | -------- | |
996ae0b0 | 8510 | |
67536dcb | 8511 | procedure ws is |
996ae0b0 | 8512 | S : Entity_Id; |
996ae0b0 RK |
8513 | begin |
8514 | for J in reverse 1 .. Scope_Stack.Last loop | |
8515 | S := Scope_Stack.Table (J).Entity; | |
8516 | Write_Int (Int (S)); | |
8517 | Write_Str (" === "); | |
8518 | Write_Name (Chars (S)); | |
8519 | Write_Eol; | |
8520 | end loop; | |
67536dcb | 8521 | end ws; |
996ae0b0 | 8522 | |
c1ce0691 ES |
8523 | -------- |
8524 | -- we -- | |
8525 | -------- | |
8526 | ||
8527 | procedure we (S : Entity_Id) is | |
8528 | E : Entity_Id; | |
8529 | begin | |
8530 | E := First_Entity (S); | |
8531 | while Present (E) loop | |
8532 | Write_Int (Int (E)); | |
8533 | Write_Str (" === "); | |
8534 | Write_Name (Chars (E)); | |
8535 | Write_Eol; | |
c1ce0691 ES |
8536 | Next_Entity (E); |
8537 | end loop; | |
8538 | end we; | |
996ae0b0 | 8539 | end Sem_Ch8; |