]>
Commit | Line | Data |
---|---|---|
996ae0b0 RK |
1 | ------------------------------------------------------------------------------ |
2 | -- -- | |
3 | -- GNAT COMPILER COMPONENTS -- | |
4 | -- -- | |
d4129bfa | 5 | -- S E M _ C H 8 -- |
996ae0b0 RK |
6 | -- -- |
7 | -- B o d y -- | |
8 | -- -- | |
67c0e662 | 9 | -- Copyright (C) 1992-2015, 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; | |
024d33d8 | 31 | with Exp_Disp; use Exp_Disp; |
d239991f | 32 | with Exp_Tss; use Exp_Tss; |
996ae0b0 RK |
33 | with Exp_Util; use Exp_Util; |
34 | with Fname; use Fname; | |
35 | with Freeze; use Freeze; | |
8636f52f | 36 | with Ghost; use Ghost; |
16ca248a | 37 | with Impunit; use Impunit; |
996ae0b0 RK |
38 | with Lib; use Lib; |
39 | with Lib.Load; use Lib.Load; | |
40 | with Lib.Xref; use Lib.Xref; | |
41 | with Namet; use Namet; | |
294ccb21 | 42 | with Namet.Sp; use Namet.Sp; |
996ae0b0 RK |
43 | with Nlists; use Nlists; |
44 | with Nmake; use Nmake; | |
45 | with Opt; use Opt; | |
46 | with Output; use Output; | |
47 | with Restrict; use Restrict; | |
6e937c1c | 48 | with Rident; use Rident; |
996ae0b0 RK |
49 | with Rtsfind; use Rtsfind; |
50 | with Sem; use Sem; | |
a4100e55 | 51 | with Sem_Aux; use Sem_Aux; |
fbf5a39b | 52 | with Sem_Cat; use Sem_Cat; |
996ae0b0 RK |
53 | with Sem_Ch3; use Sem_Ch3; |
54 | with Sem_Ch4; use Sem_Ch4; | |
55 | with Sem_Ch6; use Sem_Ch6; | |
56 | with Sem_Ch12; use Sem_Ch12; | |
ef992452 | 57 | with Sem_Ch13; use Sem_Ch13; |
dec6faf1 | 58 | with Sem_Dim; use Sem_Dim; |
82c80734 | 59 | with Sem_Disp; use Sem_Disp; |
a77842bd | 60 | with Sem_Dist; use Sem_Dist; |
a2dc5812 | 61 | with Sem_Eval; use Sem_Eval; |
996ae0b0 RK |
62 | with Sem_Res; use Sem_Res; |
63 | with Sem_Util; use Sem_Util; | |
64 | with Sem_Type; use Sem_Type; | |
65 | with Stand; use Stand; | |
66 | with Sinfo; use Sinfo; | |
67 | with Sinfo.CN; use Sinfo.CN; | |
68 | with Snames; use Snames; | |
69 | with Style; use Style; | |
70 | with Table; | |
ddc1515a | 71 | with Targparm; use Targparm; |
996ae0b0 RK |
72 | with Tbuild; use Tbuild; |
73 | with Uintp; use Uintp; | |
74 | ||
996ae0b0 RK |
75 | package body Sem_Ch8 is |
76 | ||
77 | ------------------------------------ | |
78 | -- Visibility and Name Resolution -- | |
79 | ------------------------------------ | |
80 | ||
2c1b72d7 | 81 | -- This package handles name resolution and the collection of possible |
996ae0b0 RK |
82 | -- interpretations for overloaded names, prior to overload resolution. |
83 | ||
84 | -- Name resolution is the process that establishes a mapping between source | |
85 | -- identifiers and the entities they denote at each point in the program. | |
86 | -- Each entity is represented by a defining occurrence. Each identifier | |
87 | -- that denotes an entity points to the corresponding defining occurrence. | |
88 | -- This is the entity of the applied occurrence. Each occurrence holds | |
89 | -- an index into the names table, where source identifiers are stored. | |
90 | ||
91 | -- Each entry in the names table for an identifier or designator uses the | |
92 | -- Info pointer to hold a link to the currently visible entity that has | |
93 | -- this name (see subprograms Get_Name_Entity_Id and Set_Name_Entity_Id | |
94 | -- in package Sem_Util). The visibility is initialized at the beginning of | |
95 | -- semantic processing to make entities in package Standard immediately | |
96 | -- visible. The visibility table is used in a more subtle way when | |
97 | -- compiling subunits (see below). | |
98 | ||
99 | -- Entities that have the same name (i.e. homonyms) are chained. In the | |
100 | -- case of overloaded entities, this chain holds all the possible meanings | |
101 | -- of a given identifier. The process of overload resolution uses type | |
102 | -- information to select from this chain the unique meaning of a given | |
103 | -- identifier. | |
104 | ||
105 | -- Entities are also chained in their scope, through the Next_Entity link. | |
106 | -- As a consequence, the name space is organized as a sparse matrix, where | |
107 | -- each row corresponds to a scope, and each column to a source identifier. | |
108 | -- Open scopes, that is to say scopes currently being compiled, have their | |
109 | -- corresponding rows of entities in order, innermost scope first. | |
110 | ||
111 | -- The scopes of packages that are mentioned in context clauses appear in | |
112 | -- no particular order, interspersed among open scopes. This is because | |
113 | -- in the course of analyzing the context of a compilation, a package | |
114 | -- declaration is first an open scope, and subsequently an element of the | |
115 | -- context. If subunits or child units are present, a parent unit may | |
116 | -- appear under various guises at various times in the compilation. | |
117 | ||
118 | -- When the compilation of the innermost scope is complete, the entities | |
119 | -- defined therein are no longer visible. If the scope is not a package | |
120 | -- declaration, these entities are never visible subsequently, and can be | |
121 | -- removed from visibility chains. If the scope is a package declaration, | |
122 | -- its visible declarations may still be accessible. Therefore the entities | |
123 | -- defined in such a scope are left on the visibility chains, and only | |
124 | -- their visibility (immediately visibility or potential use-visibility) | |
125 | -- is affected. | |
126 | ||
127 | -- The ordering of homonyms on their chain does not necessarily follow | |
128 | -- the order of their corresponding scopes on the scope stack. For | |
129 | -- example, if package P and the enclosing scope both contain entities | |
130 | -- named E, then when compiling the package body the chain for E will | |
131 | -- hold the global entity first, and the local one (corresponding to | |
132 | -- the current inner scope) next. As a result, name resolution routines | |
133 | -- do not assume any relative ordering of the homonym chains, either | |
134 | -- for scope nesting or to order of appearance of context clauses. | |
135 | ||
136 | -- When compiling a child unit, entities in the parent scope are always | |
137 | -- immediately visible. When compiling the body of a child unit, private | |
138 | -- entities in the parent must also be made immediately visible. There | |
139 | -- are separate routines to make the visible and private declarations | |
140 | -- visible at various times (see package Sem_Ch7). | |
141 | ||
142 | -- +--------+ +-----+ | |
143 | -- | In use |-------->| EU1 |--------------------------> | |
144 | -- +--------+ +-----+ | |
145 | -- | | | |
146 | -- +--------+ +-----+ +-----+ | |
147 | -- | Stand. |---------------->| ES1 |--------------->| ES2 |---> | |
148 | -- +--------+ +-----+ +-----+ | |
149 | -- | | | |
150 | -- +---------+ | +-----+ | |
151 | -- | with'ed |------------------------------>| EW2 |---> | |
152 | -- +---------+ | +-----+ | |
153 | -- | | | |
154 | -- +--------+ +-----+ +-----+ | |
155 | -- | Scope2 |---------------->| E12 |--------------->| E22 |---> | |
156 | -- +--------+ +-----+ +-----+ | |
157 | -- | | | |
158 | -- +--------+ +-----+ +-----+ | |
159 | -- | Scope1 |---------------->| E11 |--------------->| E12 |---> | |
160 | -- +--------+ +-----+ +-----+ | |
161 | -- ^ | | | |
162 | -- | | | | |
163 | -- | +---------+ | | | |
164 | -- | | with'ed |-----------------------------------------> | |
165 | -- | +---------+ | | | |
166 | -- | | | | |
167 | -- Scope stack | | | |
168 | -- (innermost first) | | | |
169 | -- +----------------------------+ | |
170 | -- Names table => | Id1 | | | | Id2 | | |
171 | -- +----------------------------+ | |
172 | ||
173 | -- Name resolution must deal with several syntactic forms: simple names, | |
174 | -- qualified names, indexed names, and various forms of calls. | |
175 | ||
176 | -- Each identifier points to an entry in the names table. The resolution | |
177 | -- of a simple name consists in traversing the homonym chain, starting | |
178 | -- from the names table. If an entry is immediately visible, it is the one | |
fbf5a39b | 179 | -- designated by the identifier. If only potentially use-visible entities |
996ae0b0 RK |
180 | -- are on the chain, we must verify that they do not hide each other. If |
181 | -- the entity we find is overloadable, we collect all other overloadable | |
182 | -- entities on the chain as long as they are not hidden. | |
183 | -- | |
184 | -- To resolve expanded names, we must find the entity at the intersection | |
185 | -- of the entity chain for the scope (the prefix) and the homonym chain | |
186 | -- for the selector. In general, homonym chains will be much shorter than | |
187 | -- entity chains, so it is preferable to start from the names table as | |
188 | -- well. If the entity found is overloadable, we must collect all other | |
189 | -- interpretations that are defined in the scope denoted by the prefix. | |
190 | ||
191 | -- For records, protected types, and tasks, their local entities are | |
192 | -- removed from visibility chains on exit from the corresponding scope. | |
193 | -- From the outside, these entities are always accessed by selected | |
194 | -- notation, and the entity chain for the record type, protected type, | |
195 | -- etc. is traversed sequentially in order to find the designated entity. | |
196 | ||
197 | -- The discriminants of a type and the operations of a protected type or | |
198 | -- task are unchained on exit from the first view of the type, (such as | |
199 | -- a private or incomplete type declaration, or a protected type speci- | |
fbf5a39b | 200 | -- fication) and re-chained when compiling the second view. |
996ae0b0 RK |
201 | |
202 | -- In the case of operators, we do not make operators on derived types | |
203 | -- explicit. As a result, the notation P."+" may denote either a user- | |
204 | -- defined function with name "+", or else an implicit declaration of the | |
205 | -- operator "+" in package P. The resolution of expanded names always | |
206 | -- tries to resolve an operator name as such an implicitly defined entity, | |
207 | -- in addition to looking for explicit declarations. | |
208 | ||
209 | -- All forms of names that denote entities (simple names, expanded names, | |
210 | -- character literals in some cases) have a Entity attribute, which | |
211 | -- identifies the entity denoted by the name. | |
212 | ||
213 | --------------------- | |
214 | -- The Scope Stack -- | |
215 | --------------------- | |
216 | ||
217 | -- The Scope stack keeps track of the scopes currently been compiled. | |
218 | -- Every entity that contains declarations (including records) is placed | |
219 | -- on the scope stack while it is being processed, and removed at the end. | |
220 | -- Whenever a non-package scope is exited, the entities defined therein | |
221 | -- are removed from the visibility table, so that entities in outer scopes | |
222 | -- become visible (see previous description). On entry to Sem, the scope | |
223 | -- stack only contains the package Standard. As usual, subunits complicate | |
224 | -- this picture ever so slightly. | |
225 | ||
226 | -- The Rtsfind mechanism can force a call to Semantics while another | |
227 | -- compilation is in progress. The unit retrieved by Rtsfind must be | |
228 | -- compiled in its own context, and has no access to the visibility of | |
229 | -- the unit currently being compiled. The procedures Save_Scope_Stack and | |
230 | -- Restore_Scope_Stack make entities in current open scopes invisible | |
231 | -- before compiling the retrieved unit, and restore the compilation | |
232 | -- environment afterwards. | |
233 | ||
234 | ------------------------ | |
235 | -- Compiling subunits -- | |
236 | ------------------------ | |
237 | ||
16ca248a ES |
238 | -- Subunits must be compiled in the environment of the corresponding stub, |
239 | -- that is to say with the same visibility into the parent (and its | |
996ae0b0 RK |
240 | -- context) that is available at the point of the stub declaration, but |
241 | -- with the additional visibility provided by the context clause of the | |
242 | -- subunit itself. As a result, compilation of a subunit forces compilation | |
243 | -- of the parent (see description in lib-). At the point of the stub | |
16ca248a ES |
244 | -- declaration, Analyze is called recursively to compile the proper body of |
245 | -- the subunit, but without reinitializing the names table, nor the scope | |
246 | -- stack (i.e. standard is not pushed on the stack). In this fashion the | |
247 | -- context of the subunit is added to the context of the parent, and the | |
248 | -- subunit is compiled in the correct environment. Note that in the course | |
249 | -- of processing the context of a subunit, Standard will appear twice on | |
250 | -- the scope stack: once for the parent of the subunit, and once for the | |
251 | -- unit in the context clause being compiled. However, the two sets of | |
252 | -- entities are not linked by homonym chains, so that the compilation of | |
253 | -- any context unit happens in a fresh visibility environment. | |
996ae0b0 RK |
254 | |
255 | ------------------------------- | |
256 | -- Processing of USE Clauses -- | |
257 | ------------------------------- | |
258 | ||
259 | -- Every defining occurrence has a flag indicating if it is potentially use | |
260 | -- visible. Resolution of simple names examines this flag. The processing | |
261 | -- of use clauses consists in setting this flag on all visible entities | |
262 | -- defined in the corresponding package. On exit from the scope of the use | |
263 | -- clause, the corresponding flag must be reset. However, a package may | |
a90bd866 | 264 | -- appear in several nested use clauses (pathological but legal, alas) |
996ae0b0 RK |
265 | -- which forces us to use a slightly more involved scheme: |
266 | ||
267 | -- a) The defining occurrence for a package holds a flag -In_Use- to | |
268 | -- indicate that it is currently in the scope of a use clause. If a | |
44d6a706 | 269 | -- redundant use clause is encountered, then the corresponding occurrence |
996ae0b0 RK |
270 | -- of the package name is flagged -Redundant_Use-. |
271 | ||
272 | -- b) On exit from a scope, the use clauses in its declarative part are | |
273 | -- scanned. The visibility flag is reset in all entities declared in | |
274 | -- package named in a use clause, as long as the package is not flagged | |
275 | -- as being in a redundant use clause (in which case the outer use | |
276 | -- clause is still in effect, and the direct visibility of its entities | |
277 | -- must be retained). | |
278 | ||
279 | -- Note that entities are not removed from their homonym chains on exit | |
280 | -- from the package specification. A subsequent use clause does not need | |
281 | -- to rechain the visible entities, but only to establish their direct | |
282 | -- visibility. | |
283 | ||
284 | ----------------------------------- | |
285 | -- Handling private declarations -- | |
286 | ----------------------------------- | |
287 | ||
288 | -- The principle that each entity has a single defining occurrence clashes | |
289 | -- with the presence of two separate definitions for private types: the | |
290 | -- first is the private type declaration, and second is the full type | |
291 | -- declaration. It is important that all references to the type point to | |
44d6a706 | 292 | -- the same defining occurrence, namely the first one. To enforce the two |
996ae0b0 RK |
293 | -- separate views of the entity, the corresponding information is swapped |
294 | -- between the two declarations. Outside of the package, the defining | |
44d6a706 | 295 | -- occurrence only contains the private declaration information, while in |
996ae0b0 RK |
296 | -- the private part and the body of the package the defining occurrence |
297 | -- contains the full declaration. To simplify the swap, the defining | |
298 | -- occurrence that currently holds the private declaration points to the | |
44d6a706 | 299 | -- full declaration. During semantic processing the defining occurrence |
16ca248a ES |
300 | -- also points to a list of private dependents, that is to say access types |
301 | -- or composite types whose designated types or component types are | |
996ae0b0 RK |
302 | -- subtypes or derived types of the private type in question. After the |
303 | -- full declaration has been seen, the private dependents are updated to | |
304 | -- indicate that they have full definitions. | |
305 | ||
306 | ------------------------------------ | |
307 | -- Handling of Undefined Messages -- | |
308 | ------------------------------------ | |
309 | ||
310 | -- In normal mode, only the first use of an undefined identifier generates | |
311 | -- a message. The table Urefs is used to record error messages that have | |
312 | -- been issued so that second and subsequent ones do not generate further | |
313 | -- messages. However, the second reference causes text to be added to the | |
314 | -- original undefined message noting "(more references follow)". The | |
315 | -- full error list option (-gnatf) forces messages to be generated for | |
316 | -- every reference and disconnects the use of this table. | |
317 | ||
318 | type Uref_Entry is record | |
319 | Node : Node_Id; | |
320 | -- Node for identifier for which original message was posted. The | |
321 | -- Chars field of this identifier is used to detect later references | |
322 | -- to the same identifier. | |
323 | ||
324 | Err : Error_Msg_Id; | |
325 | -- Records error message Id of original undefined message. Reset to | |
326 | -- No_Error_Msg after the second occurrence, where it is used to add | |
327 | -- text to the original message as described above. | |
328 | ||
329 | Nvis : Boolean; | |
330 | -- Set if the message is not visible rather than undefined | |
331 | ||
332 | Loc : Source_Ptr; | |
333 | -- Records location of error message. Used to make sure that we do | |
334 | -- not consider a, b : undefined as two separate instances, which | |
335 | -- would otherwise happen, since the parser converts this sequence | |
336 | -- to a : undefined; b : undefined. | |
337 | ||
338 | end record; | |
339 | ||
340 | package Urefs is new Table.Table ( | |
341 | Table_Component_Type => Uref_Entry, | |
342 | Table_Index_Type => Nat, | |
343 | Table_Low_Bound => 1, | |
344 | Table_Initial => 10, | |
345 | Table_Increment => 100, | |
346 | Table_Name => "Urefs"); | |
347 | ||
348 | Candidate_Renaming : Entity_Id; | |
349 | -- Holds a candidate interpretation that appears in a subprogram renaming | |
350 | -- declaration and does not match the given specification, but matches at | |
351 | -- least on the first formal. Allows better error message when given | |
352 | -- specification omits defaulted parameters, a common error. | |
353 | ||
354 | ----------------------- | |
355 | -- Local Subprograms -- | |
356 | ----------------------- | |
357 | ||
358 | procedure Analyze_Generic_Renaming | |
359 | (N : Node_Id; | |
360 | K : Entity_Kind); | |
361 | -- Common processing for all three kinds of generic renaming declarations. | |
362 | -- Enter new name and indicate that it renames the generic unit. | |
363 | ||
364 | procedure Analyze_Renamed_Character | |
365 | (N : Node_Id; | |
366 | New_S : Entity_Id; | |
367 | Is_Body : Boolean); | |
368 | -- Renamed entity is given by a character literal, which must belong | |
369 | -- to the return type of the new entity. Is_Body indicates whether the | |
370 | -- declaration is a renaming_as_body. If the original declaration has | |
371 | -- already been frozen (because of an intervening body, e.g.) the body of | |
372 | -- the function must be built now. The same applies to the following | |
373 | -- various renaming procedures. | |
374 | ||
375 | procedure Analyze_Renamed_Dereference | |
376 | (N : Node_Id; | |
377 | New_S : Entity_Id; | |
378 | Is_Body : Boolean); | |
379 | -- Renamed entity is given by an explicit dereference. Prefix must be a | |
380 | -- conformant access_to_subprogram type. | |
381 | ||
382 | procedure Analyze_Renamed_Entry | |
383 | (N : Node_Id; | |
384 | New_S : Entity_Id; | |
385 | Is_Body : Boolean); | |
386 | -- If the renamed entity in a subprogram renaming is an entry or protected | |
387 | -- subprogram, build a body for the new entity whose only statement is a | |
388 | -- call to the renamed entity. | |
389 | ||
390 | procedure Analyze_Renamed_Family_Member | |
391 | (N : Node_Id; | |
392 | New_S : Entity_Id; | |
393 | Is_Body : Boolean); | |
394 | -- Used when the renamed entity is an indexed component. The prefix must | |
395 | -- denote an entry family. | |
396 | ||
294ccb21 RD |
397 | procedure Analyze_Renamed_Primitive_Operation |
398 | (N : Node_Id; | |
399 | New_S : Entity_Id; | |
400 | Is_Body : Boolean); | |
401 | -- If the renamed entity in a subprogram renaming is a primitive operation | |
c5d00db0 AC |
402 | -- or a class-wide operation in prefix form, save the target object, |
403 | -- which must be added to the list of actuals in any subsequent call. | |
404 | -- The renaming operation is intrinsic because the compiler must in | |
405 | -- fact generate a wrapper for it (6.3.1 (10 1/2)). | |
294ccb21 | 406 | |
fbf5a39b | 407 | function Applicable_Use (Pack_Name : Node_Id) return Boolean; |
c42bfef2 RD |
408 | -- Common code to Use_One_Package and Set_Use, to determine whether use |
409 | -- clause must be processed. Pack_Name is an entity name that references | |
410 | -- the package in question. | |
fbf5a39b | 411 | |
996ae0b0 | 412 | procedure Attribute_Renaming (N : Node_Id); |
4c8a5bb8 AC |
413 | -- Analyze renaming of attribute as subprogram. The renaming declaration N |
414 | -- is rewritten as a subprogram body that returns the attribute reference | |
996ae0b0 RK |
415 | -- applied to the formals of the function. |
416 | ||
4c484f40 | 417 | procedure Set_Entity_Or_Discriminal (N : Node_Id; E : Entity_Id); |
c42bfef2 RD |
418 | -- Set Entity, with style check if need be. For a discriminant reference, |
419 | -- replace by the corresponding discriminal, i.e. the parameter of the | |
420 | -- initialization procedure that corresponds to the discriminant. | |
4c484f40 | 421 | |
996ae0b0 RK |
422 | procedure Check_Frozen_Renaming (N : Node_Id; Subp : Entity_Id); |
423 | -- A renaming_as_body may occur after the entity of the original decla- | |
424 | -- ration has been frozen. In that case, the body of the new entity must | |
425 | -- be built now, because the usual mechanism of building the renamed | |
426 | -- body at the point of freezing will not work. Subp is the subprogram | |
427 | -- for which N provides the Renaming_As_Body. | |
428 | ||
fbf5a39b AC |
429 | procedure Check_In_Previous_With_Clause |
430 | (N : Node_Id; | |
431 | Nam : Node_Id); | |
432 | -- N is a use_package clause and Nam the package name, or N is a use_type | |
433 | -- clause and Nam is the prefix of the type name. In either case, verify | |
434 | -- that the package is visible at that point in the context: either it | |
435 | -- appears in a previous with_clause, or because it is a fully qualified | |
436 | -- name and the root ancestor appears in a previous with_clause. | |
437 | ||
996ae0b0 RK |
438 | procedure Check_Library_Unit_Renaming (N : Node_Id; Old_E : Entity_Id); |
439 | -- Verify that the entity in a renaming declaration that is a library unit | |
440 | -- is itself a library unit and not a nested unit or subunit. Also check | |
441 | -- that if the renaming is a child unit of a generic parent, then the | |
442 | -- renamed unit must also be a child unit of that parent. Finally, verify | |
443 | -- that a renamed generic unit is not an implicit child declared within | |
444 | -- an instance of the parent. | |
445 | ||
446 | procedure Chain_Use_Clause (N : Node_Id); | |
d4810530 ES |
447 | -- Chain use clause onto list of uses clauses headed by First_Use_Clause in |
448 | -- the proper scope table entry. This is usually the current scope, but it | |
449 | -- will be an inner scope when installing the use clauses of the private | |
450 | -- declarations of a parent unit prior to compiling the private part of a | |
451 | -- child unit. This chain is traversed when installing/removing use clauses | |
452 | -- when compiling a subunit or instantiating a generic body on the fly, | |
453 | -- when it is necessary to save and restore full environments. | |
996ae0b0 | 454 | |
ac7d724d ES |
455 | function Enclosing_Instance return Entity_Id; |
456 | -- In an instance nested within another one, several semantic checks are | |
457 | -- unnecessary because the legality of the nested instance has been checked | |
458 | -- in the enclosing generic unit. This applies in particular to legality | |
459 | -- checks on actuals for formal subprograms of the inner instance, which | |
460 | -- are checked as subprogram renamings, and may be complicated by confusion | |
461 | -- in private/full views. This function returns the instance enclosing the | |
462 | -- current one if there is such, else it returns Empty. | |
463 | -- | |
464 | -- If the renaming determines the entity for the default of a formal | |
465 | -- subprogram nested within another instance, choose the innermost | |
466 | -- candidate. This is because if the formal has a box, and we are within | |
467 | -- an enclosing instance where some candidate interpretations are local | |
468 | -- to this enclosing instance, we know that the default was properly | |
469 | -- resolved when analyzing the generic, so we prefer the local | |
470 | -- candidates to those that are external. This is not always the case | |
471 | -- but is a reasonable heuristic on the use of nested generics. The | |
472 | -- proper solution requires a full renaming model. | |
473 | ||
996ae0b0 RK |
474 | function Has_Implicit_Character_Literal (N : Node_Id) return Boolean; |
475 | -- Find a type derived from Character or Wide_Character in the prefix of N. | |
476 | -- Used to resolved qualified names whose selector is a character literal. | |
477 | ||
9bc856dd | 478 | function Has_Private_With (E : Entity_Id) return Boolean; |
0ab80019 | 479 | -- Ada 2005 (AI-262): Determines if the current compilation unit has a |
cdc8c54c | 480 | -- private with on E. |
9bc856dd | 481 | |
fbf5a39b | 482 | procedure Find_Expanded_Name (N : Node_Id); |
1d801f21 | 483 | -- The input is a selected component known to be an expanded name. Verify |
30196a76 RD |
484 | -- legality of selector given the scope denoted by prefix, and change node |
485 | -- N into a expanded name with a properly set Entity field. | |
fbf5a39b | 486 | |
996ae0b0 RK |
487 | function Find_Renamed_Entity |
488 | (N : Node_Id; | |
489 | Nam : Node_Id; | |
490 | New_S : Entity_Id; | |
491 | Is_Actual : Boolean := False) return Entity_Id; | |
492 | -- Find the renamed entity that corresponds to the given parameter profile | |
493 | -- in a subprogram renaming declaration. The renamed entity may be an | |
494 | -- operator, a subprogram, an entry, or a protected operation. Is_Actual | |
495 | -- indicates that the renaming is the one generated for an actual subpro- | |
496 | -- gram in an instance, for which special visibility checks apply. | |
497 | ||
fbf5a39b | 498 | function Has_Implicit_Operator (N : Node_Id) return Boolean; |
f3d57416 | 499 | -- N is an expanded name whose selector is an operator name (e.g. P."+"). |
16ca248a ES |
500 | -- declarative part contains an implicit declaration of an operator if it |
501 | -- has a declaration of a type to which one of the predefined operators | |
502 | -- apply. The existence of this routine is an implementation artifact. A | |
503 | -- more straightforward but more space-consuming choice would be to make | |
504 | -- all inherited operators explicit in the symbol table. | |
fbf5a39b | 505 | |
996ae0b0 RK |
506 | procedure Inherit_Renamed_Profile (New_S : Entity_Id; Old_S : Entity_Id); |
507 | -- A subprogram defined by a renaming declaration inherits the parameter | |
508 | -- profile of the renamed entity. The subtypes given in the subprogram | |
509 | -- specification are discarded and replaced with those of the renamed | |
510 | -- subprogram, which are then used to recheck the default values. | |
511 | ||
fbf5a39b | 512 | function Is_Appropriate_For_Record (T : Entity_Id) return Boolean; |
16ca248a ES |
513 | -- Prefix is appropriate for record if it is of a record type, or an access |
514 | -- to such. | |
fbf5a39b AC |
515 | |
516 | function Is_Appropriate_For_Entry_Prefix (T : Entity_Id) return Boolean; | |
16ca248a ES |
517 | -- True if it is of a task type, a protected type, or else an access to one |
518 | -- of these types. | |
fbf5a39b | 519 | |
d4810530 | 520 | procedure Note_Redundant_Use (Clause : Node_Id); |
16ca248a ES |
521 | -- Mark the name in a use clause as redundant if the corresponding entity |
522 | -- is already use-visible. Emit a warning if the use clause comes from | |
523 | -- source and the proper warnings are enabled. | |
d4810530 | 524 | |
996ae0b0 | 525 | procedure Premature_Usage (N : Node_Id); |
bc41faa2 | 526 | -- Diagnose usage of an entity before it is visible |
996ae0b0 | 527 | |
fbf5a39b AC |
528 | procedure Use_One_Package (P : Entity_Id; N : Node_Id); |
529 | -- Make visible entities declared in package P potentially use-visible | |
530 | -- in the current context. Also used in the analysis of subunits, when | |
531 | -- re-installing use clauses of parent units. N is the use_clause that | |
532 | -- names P (and possibly other packages). | |
533 | ||
7ff2d234 | 534 | procedure Use_One_Type (Id : Node_Id; Installed : Boolean := False); |
fbf5a39b | 535 | -- Id is the subtype mark from a use type clause. This procedure makes |
7ff2d234 AC |
536 | -- the primitive operators of the type potentially use-visible. The |
537 | -- boolean flag Installed indicates that the clause is being reinstalled | |
538 | -- after previous analysis, and primitive operations are already chained | |
539 | -- on the Used_Operations list of the clause. | |
fbf5a39b | 540 | |
996ae0b0 RK |
541 | procedure Write_Info; |
542 | -- Write debugging information on entities declared in current scope | |
543 | ||
996ae0b0 RK |
544 | -------------------------------- |
545 | -- Analyze_Exception_Renaming -- | |
546 | -------------------------------- | |
547 | ||
16ca248a ES |
548 | -- The language only allows a single identifier, but the tree holds an |
549 | -- identifier list. The parser has already issued an error message if | |
550 | -- there is more than one element in the list. | |
996ae0b0 RK |
551 | |
552 | procedure Analyze_Exception_Renaming (N : Node_Id) is | |
553 | Id : constant Node_Id := Defining_Identifier (N); | |
554 | Nam : constant Node_Id := Name (N); | |
555 | ||
556 | begin | |
8636f52f HK |
557 | -- The exception renaming declaration may be subject to pragma Ghost |
558 | -- with policy Ignore. Set the mode now to ensure that any nodes | |
559 | -- generated during analysis and expansion are properly flagged as | |
560 | -- ignored Ghost. | |
561 | ||
562 | Set_Ghost_Mode (N); | |
ce5ba43a | 563 | Check_SPARK_05_Restriction ("exception renaming is not allowed", N); |
1d801f21 | 564 | |
996ae0b0 RK |
565 | Enter_Name (Id); |
566 | Analyze (Nam); | |
567 | ||
568 | Set_Ekind (Id, E_Exception); | |
996ae0b0 RK |
569 | Set_Etype (Id, Standard_Exception_Type); |
570 | Set_Is_Pure (Id, Is_Pure (Current_Scope)); | |
571 | ||
c5cec2fe AC |
572 | if not Is_Entity_Name (Nam) |
573 | or else Ekind (Entity (Nam)) /= E_Exception | |
996ae0b0 RK |
574 | then |
575 | Error_Msg_N ("invalid exception name in renaming", Nam); | |
576 | else | |
577 | if Present (Renamed_Object (Entity (Nam))) then | |
578 | Set_Renamed_Object (Id, Renamed_Object (Entity (Nam))); | |
579 | else | |
580 | Set_Renamed_Object (Id, Entity (Nam)); | |
581 | end if; | |
c5cec2fe AC |
582 | |
583 | -- An exception renaming is Ghost if the renamed entity is Ghost or | |
584 | -- the construct appears within a Ghost scope. | |
585 | ||
8636f52f | 586 | if Is_Ghost_Entity (Entity (Nam)) or else Ghost_Mode > None then |
c5cec2fe AC |
587 | Set_Is_Ghost_Entity (Id); |
588 | end if; | |
996ae0b0 | 589 | end if; |
42f1d661 AC |
590 | |
591 | -- Implementation-defined aspect specifications can appear in a renaming | |
592 | -- declaration, but not language-defined ones. The call to procedure | |
593 | -- Analyze_Aspect_Specifications will take care of this error check. | |
594 | ||
595 | if Has_Aspects (N) then | |
596 | Analyze_Aspect_Specifications (N, Id); | |
597 | end if; | |
996ae0b0 RK |
598 | end Analyze_Exception_Renaming; |
599 | ||
600 | --------------------------- | |
601 | -- Analyze_Expanded_Name -- | |
602 | --------------------------- | |
603 | ||
604 | procedure Analyze_Expanded_Name (N : Node_Id) is | |
605 | begin | |
16ca248a ES |
606 | -- If the entity pointer is already set, this is an internal node, or a |
607 | -- node that is analyzed more than once, after a tree modification. In | |
608 | -- such a case there is no resolution to perform, just set the type. For | |
609 | -- completeness, analyze prefix as well. | |
996ae0b0 RK |
610 | |
611 | if Present (Entity (N)) then | |
612 | if Is_Type (Entity (N)) then | |
613 | Set_Etype (N, Entity (N)); | |
614 | else | |
615 | Set_Etype (N, Etype (Entity (N))); | |
616 | end if; | |
617 | ||
618 | Analyze (Prefix (N)); | |
619 | return; | |
620 | else | |
621 | Find_Expanded_Name (N); | |
622 | end if; | |
0929eaeb AC |
623 | |
624 | Analyze_Dimension (N); | |
996ae0b0 RK |
625 | end Analyze_Expanded_Name; |
626 | ||
15ce9ca2 AC |
627 | --------------------------------------- |
628 | -- Analyze_Generic_Function_Renaming -- | |
629 | --------------------------------------- | |
996ae0b0 RK |
630 | |
631 | procedure Analyze_Generic_Function_Renaming (N : Node_Id) is | |
632 | begin | |
633 | Analyze_Generic_Renaming (N, E_Generic_Function); | |
634 | end Analyze_Generic_Function_Renaming; | |
635 | ||
15ce9ca2 AC |
636 | -------------------------------------- |
637 | -- Analyze_Generic_Package_Renaming -- | |
638 | -------------------------------------- | |
996ae0b0 RK |
639 | |
640 | procedure Analyze_Generic_Package_Renaming (N : Node_Id) is | |
641 | begin | |
e80f0cb0 RD |
642 | -- Test for the Text_IO special unit case here, since we may be renaming |
643 | -- one of the subpackages of Text_IO, then join common routine. | |
996ae0b0 | 644 | |
2bd67690 | 645 | Check_Text_IO_Special_Unit (Name (N)); |
996ae0b0 RK |
646 | |
647 | Analyze_Generic_Renaming (N, E_Generic_Package); | |
648 | end Analyze_Generic_Package_Renaming; | |
649 | ||
15ce9ca2 AC |
650 | ---------------------------------------- |
651 | -- Analyze_Generic_Procedure_Renaming -- | |
652 | ---------------------------------------- | |
996ae0b0 RK |
653 | |
654 | procedure Analyze_Generic_Procedure_Renaming (N : Node_Id) is | |
655 | begin | |
656 | Analyze_Generic_Renaming (N, E_Generic_Procedure); | |
657 | end Analyze_Generic_Procedure_Renaming; | |
658 | ||
659 | ------------------------------ | |
660 | -- Analyze_Generic_Renaming -- | |
661 | ------------------------------ | |
662 | ||
663 | procedure Analyze_Generic_Renaming | |
664 | (N : Node_Id; | |
665 | K : Entity_Kind) | |
666 | is | |
fbf5a39b | 667 | New_P : constant Entity_Id := Defining_Entity (N); |
996ae0b0 RK |
668 | Old_P : Entity_Id; |
669 | Inst : Boolean := False; -- prevent junk warning | |
670 | ||
671 | begin | |
ed4a1468 RD |
672 | if Name (N) = Error then |
673 | return; | |
674 | end if; | |
675 | ||
8636f52f HK |
676 | -- The generic renaming declaration may be subject to pragma Ghost with |
677 | -- policy Ignore. Set the mode now to ensure that any nodes generated | |
678 | -- during analysis and expansion are properly flagged as ignored Ghost. | |
679 | ||
680 | Set_Ghost_Mode (N); | |
ce5ba43a | 681 | Check_SPARK_05_Restriction ("generic renaming is not allowed", N); |
fe5d3068 | 682 | |
996ae0b0 RK |
683 | Generate_Definition (New_P); |
684 | ||
685 | if Current_Scope /= Standard_Standard then | |
686 | Set_Is_Pure (New_P, Is_Pure (Current_Scope)); | |
687 | end if; | |
688 | ||
689 | if Nkind (Name (N)) = N_Selected_Component then | |
690 | Check_Generic_Child_Unit (Name (N), Inst); | |
691 | else | |
692 | Analyze (Name (N)); | |
693 | end if; | |
694 | ||
695 | if not Is_Entity_Name (Name (N)) then | |
696 | Error_Msg_N ("expect entity name in renaming declaration", Name (N)); | |
697 | Old_P := Any_Id; | |
698 | else | |
699 | Old_P := Entity (Name (N)); | |
700 | end if; | |
701 | ||
702 | Enter_Name (New_P); | |
703 | Set_Ekind (New_P, K); | |
704 | ||
705 | if Etype (Old_P) = Any_Type then | |
706 | null; | |
707 | ||
708 | elsif Ekind (Old_P) /= K then | |
709 | Error_Msg_N ("invalid generic unit name", Name (N)); | |
710 | ||
711 | else | |
712 | if Present (Renamed_Object (Old_P)) then | |
713 | Set_Renamed_Object (New_P, Renamed_Object (Old_P)); | |
714 | else | |
715 | Set_Renamed_Object (New_P, Old_P); | |
716 | end if; | |
717 | ||
923fa078 RD |
718 | Set_Is_Pure (New_P, Is_Pure (Old_P)); |
719 | Set_Is_Preelaborated (New_P, Is_Preelaborated (Old_P)); | |
720 | ||
996ae0b0 RK |
721 | Set_Etype (New_P, Etype (Old_P)); |
722 | Set_Has_Completion (New_P); | |
723 | ||
c5cec2fe AC |
724 | -- An generic renaming is Ghost if the renamed entity is Ghost or the |
725 | -- construct appears within a Ghost scope. | |
726 | ||
8636f52f | 727 | if Is_Ghost_Entity (Old_P) or else Ghost_Mode > None then |
c5cec2fe AC |
728 | Set_Is_Ghost_Entity (New_P); |
729 | end if; | |
730 | ||
996ae0b0 RK |
731 | if In_Open_Scopes (Old_P) then |
732 | Error_Msg_N ("within its scope, generic denotes its instance", N); | |
733 | end if; | |
734 | ||
7b966a95 AC |
735 | -- For subprograms, propagate the Intrinsic flag, to allow, e.g. |
736 | -- renamings and subsequent instantiations of Unchecked_Conversion. | |
737 | ||
738 | if Ekind_In (Old_P, E_Generic_Function, E_Generic_Procedure) then | |
739 | Set_Is_Intrinsic_Subprogram | |
740 | (New_P, Is_Intrinsic_Subprogram (Old_P)); | |
741 | end if; | |
742 | ||
996ae0b0 RK |
743 | Check_Library_Unit_Renaming (N, Old_P); |
744 | end if; | |
42f1d661 AC |
745 | |
746 | -- Implementation-defined aspect specifications can appear in a renaming | |
747 | -- declaration, but not language-defined ones. The call to procedure | |
748 | -- Analyze_Aspect_Specifications will take care of this error check. | |
749 | ||
750 | if Has_Aspects (N) then | |
751 | Analyze_Aspect_Specifications (N, New_P); | |
752 | end if; | |
996ae0b0 RK |
753 | end Analyze_Generic_Renaming; |
754 | ||
755 | ----------------------------- | |
756 | -- Analyze_Object_Renaming -- | |
757 | ----------------------------- | |
758 | ||
759 | procedure Analyze_Object_Renaming (N : Node_Id) is | |
1378bf10 AC |
760 | Loc : constant Source_Ptr := Sloc (N); |
761 | Id : constant Entity_Id := Defining_Identifier (N); | |
996ae0b0 | 762 | Dec : Node_Id; |
1378bf10 | 763 | Nam : constant Node_Id := Name (N); |
996ae0b0 RK |
764 | T : Entity_Id; |
765 | T2 : Entity_Id; | |
766 | ||
3f5a8fee AC |
767 | procedure Check_Constrained_Object; |
768 | -- If the nominal type is unconstrained but the renamed object is | |
769 | -- constrained, as can happen with renaming an explicit dereference or | |
770 | -- a function return, build a constrained subtype from the object. If | |
771 | -- the renaming is for a formal in an accept statement, the analysis | |
772 | -- has already established its actual subtype. This is only relevant | |
773 | -- if the renamed object is an explicit dereference. | |
774 | ||
923fa078 RD |
775 | function In_Generic_Scope (E : Entity_Id) return Boolean; |
776 | -- Determine whether entity E is inside a generic cope | |
777 | ||
3f5a8fee AC |
778 | ------------------------------ |
779 | -- Check_Constrained_Object -- | |
780 | ------------------------------ | |
781 | ||
782 | procedure Check_Constrained_Object is | |
b887f1a0 | 783 | Typ : constant Entity_Id := Etype (Nam); |
3f5a8fee AC |
784 | Subt : Entity_Id; |
785 | ||
786 | begin | |
e917aec2 | 787 | if Nkind_In (Nam, N_Function_Call, N_Explicit_Dereference) |
3f5a8fee AC |
788 | and then Is_Composite_Type (Etype (Nam)) |
789 | and then not Is_Constrained (Etype (Nam)) | |
790 | and then not Has_Unknown_Discriminants (Etype (Nam)) | |
791 | and then Expander_Active | |
792 | then | |
e917aec2 | 793 | -- If Actual_Subtype is already set, nothing to do |
3f5a8fee | 794 | |
e917aec2 | 795 | if Ekind_In (Id, E_Variable, E_Constant) |
3f5a8fee AC |
796 | and then Present (Actual_Subtype (Id)) |
797 | then | |
798 | null; | |
799 | ||
42f1d661 | 800 | -- A renaming of an unchecked union has no actual subtype |
14848f57 | 801 | |
b887f1a0 | 802 | elsif Is_Unchecked_Union (Typ) then |
14848f57 AC |
803 | null; |
804 | ||
2780d174 AC |
805 | -- If a record is limited its size is invariant. This is the case |
806 | -- in particular with record types with an access discirminant | |
807 | -- that are used in iterators. This is an optimization, but it | |
808 | -- also prevents typing anomalies when the prefix is further | |
b887f1a0 | 809 | -- expanded. Limited types with discriminants are included. |
2780d174 | 810 | |
b887f1a0 | 811 | elsif Is_Limited_Record (Typ) |
150ac76e AC |
812 | or else |
813 | (Ekind (Typ) = E_Limited_Private_Type | |
814 | and then Has_Discriminants (Typ) | |
815 | and then Is_Access_Type (Etype (First_Discriminant (Typ)))) | |
b887f1a0 | 816 | then |
2780d174 AC |
817 | null; |
818 | ||
3f5a8fee AC |
819 | else |
820 | Subt := Make_Temporary (Loc, 'T'); | |
821 | Remove_Side_Effects (Nam); | |
822 | Insert_Action (N, | |
823 | Make_Subtype_Declaration (Loc, | |
824 | Defining_Identifier => Subt, | |
825 | Subtype_Indication => | |
b887f1a0 | 826 | Make_Subtype_From_Expr (Nam, Typ))); |
3f5a8fee AC |
827 | Rewrite (Subtype_Mark (N), New_Occurrence_Of (Subt, Loc)); |
828 | Set_Etype (Nam, Subt); | |
303fbb20 AC |
829 | |
830 | -- Freeze subtype at once, to prevent order of elaboration | |
831 | -- issues in the backend. The renamed object exists, so its | |
832 | -- type is already frozen in any case. | |
833 | ||
834 | Freeze_Before (N, Subt); | |
3f5a8fee AC |
835 | end if; |
836 | end if; | |
837 | end Check_Constrained_Object; | |
838 | ||
923fa078 RD |
839 | ---------------------- |
840 | -- In_Generic_Scope -- | |
841 | ---------------------- | |
842 | ||
843 | function In_Generic_Scope (E : Entity_Id) return Boolean is | |
844 | S : Entity_Id; | |
845 | ||
846 | begin | |
847 | S := Scope (E); | |
848 | while Present (S) and then S /= Standard_Standard loop | |
849 | if Is_Generic_Unit (S) then | |
850 | return True; | |
851 | end if; | |
852 | ||
853 | S := Scope (S); | |
854 | end loop; | |
855 | ||
856 | return False; | |
857 | end In_Generic_Scope; | |
858 | ||
859 | -- Start of processing for Analyze_Object_Renaming | |
860 | ||
996ae0b0 | 861 | begin |
ed4a1468 RD |
862 | if Nam = Error then |
863 | return; | |
864 | end if; | |
865 | ||
8636f52f HK |
866 | -- The object renaming declaration may be subject to pragma Ghost with |
867 | -- policy Ignore. Set the mode now to ensure that any nodes generated | |
868 | -- during analysis and expansion are properly flagged as ignored Ghost. | |
869 | ||
870 | Set_Ghost_Mode (N); | |
ce5ba43a | 871 | Check_SPARK_05_Restriction ("object renaming is not allowed", N); |
fe5d3068 | 872 | |
996ae0b0 RK |
873 | Set_Is_Pure (Id, Is_Pure (Current_Scope)); |
874 | Enter_Name (Id); | |
875 | ||
16ca248a ES |
876 | -- The renaming of a component that depends on a discriminant requires |
877 | -- an actual subtype, because in subsequent use of the object Gigi will | |
878 | -- be unable to locate the actual bounds. This explicit step is required | |
879 | -- when the renaming is generated in removing side effects of an | |
880 | -- already-analyzed expression. | |
996ae0b0 | 881 | |
42f1d661 | 882 | if Nkind (Nam) = N_Selected_Component and then Analyzed (Nam) then |
996ae0b0 | 883 | T := Etype (Nam); |
c5cec2fe | 884 | Dec := Build_Actual_Subtype_Of_Component (Etype (Nam), Nam); |
996ae0b0 RK |
885 | |
886 | if Present (Dec) then | |
887 | Insert_Action (N, Dec); | |
888 | T := Defining_Identifier (Dec); | |
889 | Set_Etype (Nam, T); | |
890 | end if; | |
891 | ||
11560bcc | 892 | -- Complete analysis of the subtype mark in any case, for ASIS use |
fbe627af RD |
893 | |
894 | if Present (Subtype_Mark (N)) then | |
895 | Find_Type (Subtype_Mark (N)); | |
896 | end if; | |
897 | ||
6e937c1c AC |
898 | elsif Present (Subtype_Mark (N)) then |
899 | Find_Type (Subtype_Mark (N)); | |
900 | T := Entity (Subtype_Mark (N)); | |
fbe627af RD |
901 | Analyze (Nam); |
902 | ||
6cce2156 GD |
903 | -- Reject renamings of conversions unless the type is tagged, or |
904 | -- the conversion is implicit (which can occur for cases of anonymous | |
905 | -- access types in Ada 2012). | |
906 | ||
fbe627af | 907 | if Nkind (Nam) = N_Type_Conversion |
6cce2156 GD |
908 | and then Comes_From_Source (Nam) |
909 | and then not Is_Tagged_Type (T) | |
fbe627af RD |
910 | then |
911 | Error_Msg_N | |
912 | ("renaming of conversion only allowed for tagged types", Nam); | |
913 | end if; | |
914 | ||
915 | Resolve (Nam, T); | |
6e937c1c | 916 | |
1378bf10 AC |
917 | -- If the renamed object is a function call of a limited type, |
918 | -- the expansion of the renaming is complicated by the presence | |
919 | -- of various temporaries and subtypes that capture constraints | |
920 | -- of the renamed object. Rewrite node as an object declaration, | |
921 | -- whose expansion is simpler. Given that the object is limited | |
922 | -- there is no copy involved and no performance hit. | |
923 | ||
924 | if Nkind (Nam) = N_Function_Call | |
51245e2d | 925 | and then Is_Limited_View (Etype (Nam)) |
92db5dee | 926 | and then not Is_Constrained (Etype (Nam)) |
1378bf10 AC |
927 | and then Comes_From_Source (N) |
928 | then | |
929 | Set_Etype (Id, T); | |
930 | Set_Ekind (Id, E_Constant); | |
931 | Rewrite (N, | |
932 | Make_Object_Declaration (Loc, | |
933 | Defining_Identifier => Id, | |
934 | Constant_Present => True, | |
92db5dee | 935 | Object_Definition => New_Occurrence_Of (Etype (Nam), Loc), |
1378bf10 AC |
936 | Expression => Relocate_Node (Nam))); |
937 | return; | |
938 | end if; | |
939 | ||
6cce2156 GD |
940 | -- Ada 2012 (AI05-149): Reject renaming of an anonymous access object |
941 | -- when renaming declaration has a named access type. The Ada 2012 | |
942 | -- coverage rules allow an anonymous access type in the context of | |
943 | -- an expected named general access type, but the renaming rules | |
944 | -- require the types to be the same. (An exception is when the type | |
945 | -- of the renaming is also an anonymous access type, which can only | |
946 | -- happen due to a renaming created by the expander.) | |
947 | ||
948 | if Nkind (Nam) = N_Type_Conversion | |
949 | and then not Comes_From_Source (Nam) | |
950 | and then Ekind (Etype (Expression (Nam))) = E_Anonymous_Access_Type | |
951 | and then Ekind (T) /= E_Anonymous_Access_Type | |
952 | then | |
953 | Wrong_Type (Expression (Nam), T); -- Should we give better error??? | |
954 | end if; | |
955 | ||
7d823354 ES |
956 | -- Check that a class-wide object is not being renamed as an object |
957 | -- of a specific type. The test for access types is needed to exclude | |
958 | -- cases where the renamed object is a dynamically tagged access | |
959 | -- result, such as occurs in certain expansions. | |
960 | ||
4755cce9 JM |
961 | if Is_Tagged_Type (T) then |
962 | Check_Dynamically_Tagged_Expression | |
963 | (Expr => Nam, | |
964 | Typ => T, | |
965 | Related_Nod => N); | |
7d823354 ES |
966 | end if; |
967 | ||
0ab80019 | 968 | -- Ada 2005 (AI-230/AI-254): Access renaming |
6e937c1c | 969 | |
9bc856dd | 970 | else pragma Assert (Present (Access_Definition (N))); |
6e937c1c AC |
971 | T := Access_Definition |
972 | (Related_Nod => N, | |
973 | N => Access_Definition (N)); | |
35b7fa6a | 974 | |
f16d05d9 AC |
975 | Analyze (Nam); |
976 | ||
977 | -- Ada 2005 AI05-105: if the declaration has an anonymous access | |
978 | -- type, the renamed object must also have an anonymous type, and | |
92db5dee AC |
979 | -- this is a name resolution rule. This was implicit in the last part |
980 | -- of the first sentence in 8.5.1(3/2), and is made explicit by this | |
981 | -- recent AI. | |
f16d05d9 AC |
982 | |
983 | if not Is_Overloaded (Nam) then | |
984 | if Ekind (Etype (Nam)) /= Ekind (T) then | |
985 | Error_Msg_N | |
a2dc5812 | 986 | ("expect anonymous access type in object renaming", N); |
f16d05d9 | 987 | end if; |
3c19e9be | 988 | |
f16d05d9 AC |
989 | else |
990 | declare | |
3c19e9be ES |
991 | I : Interp_Index; |
992 | It : Interp; | |
993 | Typ : Entity_Id := Empty; | |
e34ca162 | 994 | Seen : Boolean := False; |
f16d05d9 AC |
995 | |
996 | begin | |
997 | Get_First_Interp (Nam, I, It); | |
998 | while Present (It.Typ) loop | |
3c19e9be ES |
999 | |
1000 | -- Renaming is ambiguous if more than one candidate | |
1001 | -- interpretation is type-conformant with the context. | |
1002 | ||
1003 | if Ekind (It.Typ) = Ekind (T) then | |
1004 | if Ekind (T) = E_Anonymous_Access_Subprogram_Type | |
e34ca162 AC |
1005 | and then |
1006 | Type_Conformant | |
1007 | (Designated_Type (T), Designated_Type (It.Typ)) | |
f16d05d9 | 1008 | then |
3c19e9be ES |
1009 | if not Seen then |
1010 | Seen := True; | |
1011 | else | |
1012 | Error_Msg_N | |
1013 | ("ambiguous expression in renaming", Nam); | |
1014 | end if; | |
1015 | ||
1016 | elsif Ekind (T) = E_Anonymous_Access_Type | |
e34ca162 AC |
1017 | and then |
1018 | Covers (Designated_Type (T), Designated_Type (It.Typ)) | |
3c19e9be ES |
1019 | then |
1020 | if not Seen then | |
1021 | Seen := True; | |
1022 | else | |
1023 | Error_Msg_N | |
1024 | ("ambiguous expression in renaming", Nam); | |
1025 | end if; | |
1026 | end if; | |
1027 | ||
1028 | if Covers (T, It.Typ) then | |
f16d05d9 AC |
1029 | Typ := It.Typ; |
1030 | Set_Etype (Nam, Typ); | |
1031 | Set_Is_Overloaded (Nam, False); | |
1032 | end if; | |
f16d05d9 AC |
1033 | end if; |
1034 | ||
1035 | Get_Next_Interp (I, It); | |
1036 | end loop; | |
1037 | end; | |
1038 | end if; | |
1039 | ||
1040 | Resolve (Nam, T); | |
6e937c1c | 1041 | |
d18bbd25 | 1042 | -- Ada 2005 (AI-231): In the case where the type is defined by an |
0fb2ea01 AC |
1043 | -- access_definition, the renamed entity shall be of an access-to- |
1044 | -- constant type if and only if the access_definition defines an | |
d18bbd25 | 1045 | -- access-to-constant type. ARM 8.5.1(4) |
35b7fa6a AC |
1046 | |
1047 | if Constant_Present (Access_Definition (N)) | |
1048 | and then not Is_Access_Constant (Etype (Nam)) | |
1049 | then | |
0ab80019 | 1050 | Error_Msg_N ("(Ada 2005): the renamed object is not " |
11560bcc | 1051 | & "access-to-constant (RM 8.5.1(6))", N); |
a2dc5812 AC |
1052 | |
1053 | elsif not Constant_Present (Access_Definition (N)) | |
1054 | and then Is_Access_Constant (Etype (Nam)) | |
1055 | then | |
1056 | Error_Msg_N ("(Ada 2005): the renamed object is not " | |
1057 | & "access-to-variable (RM 8.5.1(6))", N); | |
1058 | end if; | |
1059 | ||
1060 | if Is_Access_Subprogram_Type (Etype (Nam)) then | |
1061 | Check_Subtype_Conformant | |
1062 | (Designated_Type (T), Designated_Type (Etype (Nam))); | |
1063 | ||
1064 | elsif not Subtypes_Statically_Match | |
df3e68b1 HK |
1065 | (Designated_Type (T), |
1066 | Available_View (Designated_Type (Etype (Nam)))) | |
a2dc5812 AC |
1067 | then |
1068 | Error_Msg_N | |
1069 | ("subtype of renamed object does not statically match", N); | |
35b7fa6a | 1070 | end if; |
996ae0b0 RK |
1071 | end if; |
1072 | ||
426d2717 AC |
1073 | -- Special processing for renaming function return object. Some errors |
1074 | -- and warnings are produced only for calls that come from source. | |
fbe627af | 1075 | |
426d2717 | 1076 | if Nkind (Nam) = N_Function_Call then |
fbe627af RD |
1077 | case Ada_Version is |
1078 | ||
c05ba1f1 AC |
1079 | -- Usage is illegal in Ada 83, but renamings are also introduced |
1080 | -- during expansion, and error does not apply to those. | |
fbe627af RD |
1081 | |
1082 | when Ada_83 => | |
c05ba1f1 | 1083 | if Comes_From_Source (N) then |
426d2717 AC |
1084 | Error_Msg_N |
1085 | ("(Ada 83) cannot rename function return object", Nam); | |
1086 | end if; | |
fbe627af RD |
1087 | |
1088 | -- In Ada 95, warn for odd case of renaming parameterless function | |
426d2717 | 1089 | -- call if this is not a limited type (where this is useful). |
fbe627af RD |
1090 | |
1091 | when others => | |
1092 | if Warn_On_Object_Renames_Function | |
1093 | and then No (Parameter_Associations (Nam)) | |
1094 | and then not Is_Limited_Type (Etype (Nam)) | |
426d2717 | 1095 | and then Comes_From_Source (Nam) |
fbe627af RD |
1096 | then |
1097 | Error_Msg_N | |
dbfeb4fa | 1098 | ("renaming function result object is suspicious?R?", Nam); |
fbe627af | 1099 | Error_Msg_NE |
dbfeb4fa | 1100 | ("\function & will be called only once?R?", Nam, |
426d2717 | 1101 | Entity (Name (Nam))); |
ed2233dc | 1102 | Error_Msg_N -- CODEFIX |
dbfeb4fa RD |
1103 | ("\suggest using an initialized constant " |
1104 | & "object instead?R?", Nam); | |
fbe627af | 1105 | end if; |
fd366a46 | 1106 | |
fbe627af RD |
1107 | end case; |
1108 | end if; | |
1109 | ||
3f5a8fee AC |
1110 | Check_Constrained_Object; |
1111 | ||
16ca248a ES |
1112 | -- An object renaming requires an exact match of the type. Class-wide |
1113 | -- matching is not allowed. | |
996ae0b0 RK |
1114 | |
1115 | if Is_Class_Wide_Type (T) | |
1116 | and then Base_Type (Etype (Nam)) /= Base_Type (T) | |
1117 | then | |
1118 | Wrong_Type (Nam, T); | |
1119 | end if; | |
1120 | ||
1121 | T2 := Etype (Nam); | |
4de287c4 | 1122 | |
92db5dee | 1123 | -- Ada 2005 (AI-326): Handle wrong use of incomplete type |
4de287c4 ES |
1124 | |
1125 | if Nkind (Nam) = N_Explicit_Dereference | |
1126 | and then Ekind (Etype (T2)) = E_Incomplete_Type | |
1127 | then | |
3c829e3c ES |
1128 | Error_Msg_NE ("invalid use of incomplete type&", Id, T2); |
1129 | return; | |
426d2717 | 1130 | |
3c829e3c ES |
1131 | elsif Ekind (Etype (T)) = E_Incomplete_Type then |
1132 | Error_Msg_NE ("invalid use of incomplete type&", Id, T); | |
4de287c4 ES |
1133 | return; |
1134 | end if; | |
1135 | ||
923fa078 RD |
1136 | -- Ada 2005 (AI-327) |
1137 | ||
0791fbe9 | 1138 | if Ada_Version >= Ada_2005 |
923fa078 RD |
1139 | and then Nkind (Nam) = N_Attribute_Reference |
1140 | and then Attribute_Name (Nam) = Name_Priority | |
1141 | then | |
1142 | null; | |
1143 | ||
ac7d724d | 1144 | elsif Ada_Version >= Ada_2005 and then Nkind (Nam) in N_Has_Entity then |
923fa078 | 1145 | declare |
426d2717 AC |
1146 | Nam_Decl : Node_Id; |
1147 | Nam_Ent : Entity_Id; | |
923fa078 RD |
1148 | |
1149 | begin | |
1150 | if Nkind (Nam) = N_Attribute_Reference then | |
1151 | Nam_Ent := Entity (Prefix (Nam)); | |
1152 | else | |
1153 | Nam_Ent := Entity (Nam); | |
1154 | end if; | |
1155 | ||
426d2717 | 1156 | Nam_Decl := Parent (Nam_Ent); |
923fa078 RD |
1157 | |
1158 | if Has_Null_Exclusion (N) | |
1159 | and then not Has_Null_Exclusion (Nam_Decl) | |
1160 | then | |
1161 | -- Ada 2005 (AI-423): If the object name denotes a generic | |
1162 | -- formal object of a generic unit G, and the object renaming | |
1163 | -- declaration occurs within the body of G or within the body | |
1164 | -- of a generic unit declared within the declarative region | |
fbe627af | 1165 | -- of G, then the declaration of the formal object of G must |
a3c39f83 | 1166 | -- have a null exclusion or a null-excluding subtype. |
923fa078 RD |
1167 | |
1168 | if Is_Formal_Object (Nam_Ent) | |
ac7d724d | 1169 | and then In_Generic_Scope (Id) |
923fa078 | 1170 | then |
a3c39f83 ES |
1171 | if not Can_Never_Be_Null (Etype (Nam_Ent)) then |
1172 | Error_Msg_N | |
1173 | ("renamed formal does not exclude `NULL` " | |
1174 | & "(RM 8.5.1(4.6/2))", N); | |
1175 | ||
1176 | elsif In_Package_Body (Scope (Id)) then | |
1177 | Error_Msg_N | |
1178 | ("formal object does not have a null exclusion" | |
1179 | & "(RM 8.5.1(4.6/2))", N); | |
1180 | end if; | |
923fa078 | 1181 | |
16ca248a ES |
1182 | -- Ada 2005 (AI-423): Otherwise, the subtype of the object name |
1183 | -- shall exclude null. | |
923fa078 | 1184 | |
21d27997 | 1185 | elsif not Can_Never_Be_Null (Etype (Nam_Ent)) then |
fbe627af | 1186 | Error_Msg_N |
21d27997 RD |
1187 | ("renamed object does not exclude `NULL` " |
1188 | & "(RM 8.5.1(4.6/2))", N); | |
aecf0203 | 1189 | |
a3c39f83 ES |
1190 | -- An instance is illegal if it contains a renaming that |
1191 | -- excludes null, and the actual does not. The renaming | |
1192 | -- declaration has already indicated that the declaration | |
1193 | -- of the renamed actual in the instance will raise | |
1194 | -- constraint_error. | |
1195 | ||
426d2717 | 1196 | elsif Nkind (Nam_Decl) = N_Object_Declaration |
a3c39f83 | 1197 | and then In_Instance |
ac7d724d ES |
1198 | and then |
1199 | Present (Corresponding_Generic_Association (Nam_Decl)) | |
1200 | and then Nkind (Expression (Nam_Decl)) = | |
1201 | N_Raise_Constraint_Error | |
a3c39f83 ES |
1202 | then |
1203 | Error_Msg_N | |
1204 | ("renamed actual does not exclude `NULL` " | |
1205 | & "(RM 8.5.1(4.6/2))", N); | |
1206 | ||
1207 | -- Finally, if there is a null exclusion, the subtype mark | |
1208 | -- must not be null-excluding. | |
1209 | ||
1210 | elsif No (Access_Definition (N)) | |
426d2717 | 1211 | and then Can_Never_Be_Null (T) |
a3c39f83 | 1212 | then |
aecf0203 | 1213 | Error_Msg_NE |
a3c39f83 ES |
1214 | ("`NOT NULL` not allowed (& already excludes null)", |
1215 | N, T); | |
fa961f76 | 1216 | |
923fa078 | 1217 | end if; |
fa961f76 | 1218 | |
a3c39f83 ES |
1219 | elsif Can_Never_Be_Null (T) |
1220 | and then not Can_Never_Be_Null (Etype (Nam_Ent)) | |
1221 | then | |
1222 | Error_Msg_N | |
1223 | ("renamed object does not exclude `NULL` " | |
1224 | & "(RM 8.5.1(4.6/2))", N); | |
1225 | ||
fa961f76 ES |
1226 | elsif Has_Null_Exclusion (N) |
1227 | and then No (Access_Definition (N)) | |
1228 | and then Can_Never_Be_Null (T) | |
1229 | then | |
1230 | Error_Msg_NE | |
1231 | ("`NOT NULL` not allowed (& already excludes null)", N, T); | |
923fa078 RD |
1232 | end if; |
1233 | end; | |
1234 | end if; | |
1235 | ||
2db5b47e AC |
1236 | -- Set the Ekind of the entity, unless it has been set already, as is |
1237 | -- the case for the iteration object over a container with no variable | |
3e247e58 RD |
1238 | -- indexing. In that case it's been marked as a constant, and we do not |
1239 | -- want to change it to a variable. | |
2db5b47e AC |
1240 | |
1241 | if Ekind (Id) /= E_Constant then | |
1242 | Set_Ekind (Id, E_Variable); | |
1243 | end if; | |
996c8821 RD |
1244 | |
1245 | -- Initialize the object size and alignment. Note that we used to call | |
1246 | -- Init_Size_Align here, but that's wrong for objects which have only | |
a90bd866 | 1247 | -- an Esize, not an RM_Size field. |
996c8821 | 1248 | |
d15f9422 | 1249 | Init_Object_Size_Align (Id); |
996ae0b0 RK |
1250 | |
1251 | if T = Any_Type or else Etype (Nam) = Any_Type then | |
1252 | return; | |
1253 | ||
923fa078 RD |
1254 | -- Verify that the renamed entity is an object or a function call. It |
1255 | -- may have been rewritten in several ways. | |
996ae0b0 RK |
1256 | |
1257 | elsif Is_Object_Reference (Nam) then | |
124092ee AC |
1258 | if Comes_From_Source (N) then |
1259 | if Is_Dependent_Component_Of_Mutable_Object (Nam) then | |
1260 | Error_Msg_N | |
1261 | ("illegal renaming of discriminant-dependent component", Nam); | |
1262 | end if; | |
1263 | ||
1264 | -- If the renaming comes from source and the renamed object is a | |
1265 | -- dereference, then mark the prefix as needing debug information, | |
1266 | -- since it might have been rewritten hence internally generated | |
1267 | -- and Debug_Renaming_Declaration will link the renaming to it. | |
1268 | ||
1269 | if Nkind (Nam) = N_Explicit_Dereference | |
1270 | and then Is_Entity_Name (Prefix (Nam)) | |
1271 | then | |
1272 | Set_Debug_Info_Needed (Entity (Prefix (Nam))); | |
1273 | end if; | |
996ae0b0 RK |
1274 | end if; |
1275 | ||
1276 | -- A static function call may have been folded into a literal | |
1277 | ||
1278 | elsif Nkind (Original_Node (Nam)) = N_Function_Call | |
1279 | ||
28e18b4f AC |
1280 | -- When expansion is disabled, attribute reference is not rewritten |
1281 | -- as function call. Otherwise it may be rewritten as a conversion, | |
1282 | -- so check original node. | |
996ae0b0 RK |
1283 | |
1284 | or else (Nkind (Original_Node (Nam)) = N_Attribute_Reference | |
1285 | and then Is_Function_Attribute_Name | |
294ccb21 | 1286 | (Attribute_Name (Original_Node (Nam)))) |
996ae0b0 | 1287 | |
28e18b4f AC |
1288 | -- Weird but legal, equivalent to renaming a function call. Illegal |
1289 | -- if the literal is the result of constant-folding an attribute | |
1290 | -- reference that is not a function. | |
996ae0b0 RK |
1291 | |
1292 | or else (Is_Entity_Name (Nam) | |
d4810530 ES |
1293 | and then Ekind (Entity (Nam)) = E_Enumeration_Literal |
1294 | and then | |
1295 | Nkind (Original_Node (Nam)) /= N_Attribute_Reference) | |
996ae0b0 RK |
1296 | |
1297 | or else (Nkind (Nam) = N_Type_Conversion | |
ac7d724d | 1298 | and then Is_Tagged_Type (Entity (Subtype_Mark (Nam)))) |
996ae0b0 RK |
1299 | then |
1300 | null; | |
1301 | ||
923fa078 RD |
1302 | elsif Nkind (Nam) = N_Type_Conversion then |
1303 | Error_Msg_N | |
1304 | ("renaming of conversion only allowed for tagged types", Nam); | |
996ae0b0 | 1305 | |
923fa078 RD |
1306 | -- Ada 2005 (AI-327) |
1307 | ||
0791fbe9 | 1308 | elsif Ada_Version >= Ada_2005 |
923fa078 RD |
1309 | and then Nkind (Nam) = N_Attribute_Reference |
1310 | and then Attribute_Name (Nam) = Name_Priority | |
1311 | then | |
1312 | null; | |
1313 | ||
21d27997 RD |
1314 | -- Allow internally generated x'Reference expression |
1315 | ||
1316 | elsif Nkind (Nam) = N_Reference then | |
1317 | null; | |
1318 | ||
923fa078 RD |
1319 | else |
1320 | Error_Msg_N ("expect object name in renaming", Nam); | |
996ae0b0 RK |
1321 | end if; |
1322 | ||
1323 | Set_Etype (Id, T2); | |
1324 | ||
1325 | if not Is_Variable (Nam) then | |
1326 | Set_Ekind (Id, E_Constant); | |
fbf5a39b | 1327 | Set_Never_Set_In_Source (Id, True); |
996ae0b0 RK |
1328 | Set_Is_True_Constant (Id, True); |
1329 | end if; | |
1330 | ||
c5cec2fe AC |
1331 | -- An object renaming is Ghost if the renamed entity is Ghost or the |
1332 | -- construct appears within a Ghost scope. | |
1333 | ||
1334 | if (Is_Entity_Name (Nam) | |
1335 | and then Is_Ghost_Entity (Entity (Nam))) | |
8636f52f | 1336 | or else Ghost_Mode > None |
c5cec2fe AC |
1337 | then |
1338 | Set_Is_Ghost_Entity (Id); | |
1339 | end if; | |
1340 | ||
28e18b4f AC |
1341 | -- The entity of the renaming declaration needs to reflect whether the |
1342 | -- renamed object is volatile. Is_Volatile is set if the renamed object | |
1343 | -- is volatile in the RM legality sense. | |
1344 | ||
1345 | Set_Is_Volatile (Id, Is_Volatile_Object (Nam)); | |
1346 | ||
c2cfccb1 | 1347 | -- Also copy settings of Atomic/Independent/Volatile_Full_Access |
6333ad3d AC |
1348 | |
1349 | if Is_Entity_Name (Nam) then | |
c2cfccb1 AC |
1350 | Set_Is_Atomic (Id, Is_Atomic (Entity (Nam))); |
1351 | Set_Is_Independent (Id, Is_Independent (Entity (Nam))); | |
1352 | Set_Has_Volatile_Full_Access (Id, | |
1353 | Has_Volatile_Full_Access (Entity (Nam))); | |
6333ad3d AC |
1354 | end if; |
1355 | ||
28e18b4f AC |
1356 | -- Treat as volatile if we just set the Volatile flag |
1357 | ||
1358 | if Is_Volatile (Id) | |
1359 | ||
1360 | -- Or if we are renaming an entity which was marked this way | |
1361 | ||
1362 | -- Are there more cases, e.g. X(J) where X is Treat_As_Volatile ??? | |
1363 | ||
1364 | or else (Is_Entity_Name (Nam) | |
1365 | and then Treat_As_Volatile (Entity (Nam))) | |
1366 | then | |
1367 | Set_Treat_As_Volatile (Id, True); | |
1368 | end if; | |
1369 | ||
1370 | -- Now make the link to the renamed object | |
1371 | ||
996ae0b0 | 1372 | Set_Renamed_Object (Id, Nam); |
42f1d661 AC |
1373 | |
1374 | -- Implementation-defined aspect specifications can appear in a renaming | |
1375 | -- declaration, but not language-defined ones. The call to procedure | |
1376 | -- Analyze_Aspect_Specifications will take care of this error check. | |
1377 | ||
1378 | if Has_Aspects (N) then | |
1379 | Analyze_Aspect_Specifications (N, Id); | |
1380 | end if; | |
1381 | ||
1382 | -- Deal with dimensions | |
1383 | ||
dec6faf1 | 1384 | Analyze_Dimension (N); |
996ae0b0 RK |
1385 | end Analyze_Object_Renaming; |
1386 | ||
1387 | ------------------------------ | |
1388 | -- Analyze_Package_Renaming -- | |
1389 | ------------------------------ | |
1390 | ||
1391 | procedure Analyze_Package_Renaming (N : Node_Id) is | |
1392 | New_P : constant Entity_Id := Defining_Entity (N); | |
1393 | Old_P : Entity_Id; | |
1394 | Spec : Node_Id; | |
1395 | ||
1396 | begin | |
ed4a1468 RD |
1397 | if Name (N) = Error then |
1398 | return; | |
1399 | end if; | |
1400 | ||
8636f52f HK |
1401 | -- The package renaming declaration may be subject to pragma Ghost with |
1402 | -- policy Ignore. Set the mode now to ensure that any nodes generated | |
1403 | -- during analysis and expansion are properly flagged as ignored Ghost. | |
1404 | ||
1405 | Set_Ghost_Mode (N); | |
1406 | ||
e80f0cb0 | 1407 | -- Check for Text_IO special unit (we may be renaming a Text_IO child) |
996ae0b0 | 1408 | |
2bd67690 | 1409 | Check_Text_IO_Special_Unit (Name (N)); |
996ae0b0 RK |
1410 | |
1411 | if Current_Scope /= Standard_Standard then | |
1412 | Set_Is_Pure (New_P, Is_Pure (Current_Scope)); | |
1413 | end if; | |
1414 | ||
1415 | Enter_Name (New_P); | |
1416 | Analyze (Name (N)); | |
16ca248a | 1417 | |
996ae0b0 RK |
1418 | if Is_Entity_Name (Name (N)) then |
1419 | Old_P := Entity (Name (N)); | |
1420 | else | |
1421 | Old_P := Any_Id; | |
1422 | end if; | |
1423 | ||
1424 | if Etype (Old_P) = Any_Type then | |
426d2717 | 1425 | Error_Msg_N ("expect package name in renaming", Name (N)); |
657a9dd9 | 1426 | |
996ae0b0 RK |
1427 | elsif Ekind (Old_P) /= E_Package |
1428 | and then not (Ekind (Old_P) = E_Generic_Package | |
1429 | and then In_Open_Scopes (Old_P)) | |
1430 | then | |
1431 | if Ekind (Old_P) = E_Generic_Package then | |
1432 | Error_Msg_N | |
1433 | ("generic package cannot be renamed as a package", Name (N)); | |
1434 | else | |
1435 | Error_Msg_Sloc := Sloc (Old_P); | |
1436 | Error_Msg_NE | |
1437 | ("expect package name in renaming, found& declared#", | |
1438 | Name (N), Old_P); | |
1439 | end if; | |
1440 | ||
bc41faa2 | 1441 | -- Set basic attributes to minimize cascaded errors |
996ae0b0 RK |
1442 | |
1443 | Set_Ekind (New_P, E_Package); | |
1444 | Set_Etype (New_P, Standard_Void_Type); | |
1445 | ||
294ccb21 RD |
1446 | -- Here for OK package renaming |
1447 | ||
996ae0b0 | 1448 | else |
923fa078 RD |
1449 | -- Entities in the old package are accessible through the renaming |
1450 | -- entity. The simplest implementation is to have both packages share | |
1451 | -- the entity list. | |
996ae0b0 RK |
1452 | |
1453 | Set_Ekind (New_P, E_Package); | |
1454 | Set_Etype (New_P, Standard_Void_Type); | |
1455 | ||
1456 | if Present (Renamed_Object (Old_P)) then | |
1457 | Set_Renamed_Object (New_P, Renamed_Object (Old_P)); | |
1458 | else | |
4de287c4 | 1459 | Set_Renamed_Object (New_P, Old_P); |
996ae0b0 RK |
1460 | end if; |
1461 | ||
1462 | Set_Has_Completion (New_P); | |
1463 | ||
1464 | Set_First_Entity (New_P, First_Entity (Old_P)); | |
1465 | Set_Last_Entity (New_P, Last_Entity (Old_P)); | |
1466 | Set_First_Private_Entity (New_P, First_Private_Entity (Old_P)); | |
1467 | Check_Library_Unit_Renaming (N, Old_P); | |
1468 | Generate_Reference (Old_P, Name (N)); | |
1469 | ||
c5cec2fe AC |
1470 | -- A package renaming is Ghost if the renamed entity is Ghost or |
1471 | -- the construct appears within a Ghost scope. | |
1472 | ||
8636f52f | 1473 | if Is_Ghost_Entity (Old_P) or else Ghost_Mode > None then |
c5cec2fe AC |
1474 | Set_Is_Ghost_Entity (New_P); |
1475 | end if; | |
1476 | ||
294ccb21 | 1477 | -- If the renaming is in the visible part of a package, then we set |
7d823354 | 1478 | -- Renamed_In_Spec for the renamed package, to prevent giving |
294ccb21 RD |
1479 | -- warnings about no entities referenced. Such a warning would be |
1480 | -- overenthusiastic, since clients can see entities in the renamed | |
1481 | -- package via the visible package renaming. | |
1482 | ||
1483 | declare | |
1484 | Ent : constant Entity_Id := Cunit_Entity (Current_Sem_Unit); | |
1485 | begin | |
1486 | if Ekind (Ent) = E_Package | |
1487 | and then not In_Private_Part (Ent) | |
1488 | and then In_Extended_Main_Source_Unit (N) | |
1489 | and then Ekind (Old_P) = E_Package | |
1490 | then | |
1491 | Set_Renamed_In_Spec (Old_P); | |
1492 | end if; | |
1493 | end; | |
1494 | ||
996ae0b0 RK |
1495 | -- If this is the renaming declaration of a package instantiation |
1496 | -- within itself, it is the declaration that ends the list of actuals | |
1497 | -- for the instantiation. At this point, the subtypes that rename | |
1498 | -- the actuals are flagged as generic, to avoid spurious ambiguities | |
1499 | -- if the actuals for two distinct formals happen to coincide. If | |
1500 | -- the actual is a private type, the subtype has a private completion | |
1501 | -- that is flagged in the same fashion. | |
1502 | ||
1503 | -- Resolution is identical to what is was in the original generic. | |
1504 | -- On exit from the generic instance, these are turned into regular | |
1505 | -- subtypes again, so they are compatible with types in their class. | |
1506 | ||
1507 | if not Is_Generic_Instance (Old_P) then | |
1508 | return; | |
1509 | else | |
1510 | Spec := Specification (Unit_Declaration_Node (Old_P)); | |
1511 | end if; | |
1512 | ||
1513 | if Nkind (Spec) = N_Package_Specification | |
1514 | and then Present (Generic_Parent (Spec)) | |
1515 | and then Old_P = Current_Scope | |
1516 | and then Chars (New_P) = Chars (Generic_Parent (Spec)) | |
1517 | then | |
1518 | declare | |
16ca248a ES |
1519 | E : Entity_Id; |
1520 | ||
996ae0b0 | 1521 | begin |
16ca248a | 1522 | E := First_Entity (Old_P); |
ac7d724d | 1523 | while Present (E) and then E /= New_P loop |
996ae0b0 RK |
1524 | if Is_Type (E) |
1525 | and then Nkind (Parent (E)) = N_Subtype_Declaration | |
1526 | then | |
1527 | Set_Is_Generic_Actual_Type (E); | |
1528 | ||
1529 | if Is_Private_Type (E) | |
1530 | and then Present (Full_View (E)) | |
1531 | then | |
1532 | Set_Is_Generic_Actual_Type (Full_View (E)); | |
1533 | end if; | |
1534 | end if; | |
1535 | ||
1536 | Next_Entity (E); | |
1537 | end loop; | |
1538 | end; | |
1539 | end if; | |
1540 | end if; | |
42f1d661 AC |
1541 | |
1542 | -- Implementation-defined aspect specifications can appear in a renaming | |
1543 | -- declaration, but not language-defined ones. The call to procedure | |
1544 | -- Analyze_Aspect_Specifications will take care of this error check. | |
1545 | ||
1546 | if Has_Aspects (N) then | |
1547 | Analyze_Aspect_Specifications (N, New_P); | |
1548 | end if; | |
996ae0b0 RK |
1549 | end Analyze_Package_Renaming; |
1550 | ||
1551 | ------------------------------- | |
1552 | -- Analyze_Renamed_Character -- | |
1553 | ------------------------------- | |
1554 | ||
1555 | procedure Analyze_Renamed_Character | |
1556 | (N : Node_Id; | |
1557 | New_S : Entity_Id; | |
1558 | Is_Body : Boolean) | |
1559 | is | |
1560 | C : constant Node_Id := Name (N); | |
1561 | ||
1562 | begin | |
1563 | if Ekind (New_S) = E_Function then | |
1564 | Resolve (C, Etype (New_S)); | |
1565 | ||
1566 | if Is_Body then | |
1567 | Check_Frozen_Renaming (N, New_S); | |
1568 | end if; | |
1569 | ||
1570 | else | |
1571 | Error_Msg_N ("character literal can only be renamed as function", N); | |
1572 | end if; | |
1573 | end Analyze_Renamed_Character; | |
1574 | ||
1575 | --------------------------------- | |
1576 | -- Analyze_Renamed_Dereference -- | |
1577 | --------------------------------- | |
1578 | ||
1579 | procedure Analyze_Renamed_Dereference | |
1580 | (N : Node_Id; | |
1581 | New_S : Entity_Id; | |
1582 | Is_Body : Boolean) | |
1583 | is | |
1584 | Nam : constant Node_Id := Name (N); | |
1585 | P : constant Node_Id := Prefix (Nam); | |
1586 | Typ : Entity_Id; | |
fbf5a39b | 1587 | Ind : Interp_Index; |
996ae0b0 RK |
1588 | It : Interp; |
1589 | ||
1590 | begin | |
1591 | if not Is_Overloaded (P) then | |
996ae0b0 | 1592 | if Ekind (Etype (Nam)) /= E_Subprogram_Type |
bce79204 AC |
1593 | or else not Type_Conformant (Etype (Nam), New_S) |
1594 | then | |
996ae0b0 RK |
1595 | Error_Msg_N ("designated type does not match specification", P); |
1596 | else | |
fbf5a39b | 1597 | Resolve (P); |
996ae0b0 RK |
1598 | end if; |
1599 | ||
1600 | return; | |
1601 | ||
1602 | else | |
1603 | Typ := Any_Type; | |
fbf5a39b | 1604 | Get_First_Interp (Nam, Ind, It); |
996ae0b0 RK |
1605 | |
1606 | while Present (It.Nam) loop | |
1607 | ||
1608 | if Ekind (It.Nam) = E_Subprogram_Type | |
bce79204 AC |
1609 | and then Type_Conformant (It.Nam, New_S) |
1610 | then | |
996ae0b0 RK |
1611 | if Typ /= Any_Id then |
1612 | Error_Msg_N ("ambiguous renaming", P); | |
1613 | return; | |
1614 | else | |
1615 | Typ := It.Nam; | |
1616 | end if; | |
1617 | end if; | |
1618 | ||
fbf5a39b | 1619 | Get_Next_Interp (Ind, It); |
996ae0b0 RK |
1620 | end loop; |
1621 | ||
1622 | if Typ = Any_Type then | |
1623 | Error_Msg_N ("designated type does not match specification", P); | |
1624 | else | |
1625 | Resolve (N, Typ); | |
1626 | ||
1627 | if Is_Body then | |
1628 | Check_Frozen_Renaming (N, New_S); | |
1629 | end if; | |
1630 | end if; | |
1631 | end if; | |
1632 | end Analyze_Renamed_Dereference; | |
1633 | ||
1634 | --------------------------- | |
1635 | -- Analyze_Renamed_Entry -- | |
1636 | --------------------------- | |
1637 | ||
1638 | procedure Analyze_Renamed_Entry | |
1639 | (N : Node_Id; | |
1640 | New_S : Entity_Id; | |
1641 | Is_Body : Boolean) | |
1642 | is | |
c92e8586 AC |
1643 | Nam : constant Node_Id := Name (N); |
1644 | Sel : constant Node_Id := Selector_Name (Nam); | |
1645 | Is_Actual : constant Boolean := Present (Corresponding_Formal_Spec (N)); | |
1646 | Old_S : Entity_Id; | |
996ae0b0 RK |
1647 | |
1648 | begin | |
1649 | if Entity (Sel) = Any_Id then | |
1650 | ||
bc41faa2 | 1651 | -- Selector is undefined on prefix. Error emitted already |
996ae0b0 RK |
1652 | |
1653 | Set_Has_Completion (New_S); | |
1654 | return; | |
1655 | end if; | |
1656 | ||
16ca248a | 1657 | -- Otherwise find renamed entity and build body of New_S as a call to it |
996ae0b0 RK |
1658 | |
1659 | Old_S := Find_Renamed_Entity (N, Selector_Name (Nam), New_S); | |
1660 | ||
1661 | if Old_S = Any_Id then | |
1662 | Error_Msg_N (" no subprogram or entry matches specification", N); | |
1663 | else | |
1664 | if Is_Body then | |
1665 | Check_Subtype_Conformant (New_S, Old_S, N); | |
1666 | Generate_Reference (New_S, Defining_Entity (N), 'b'); | |
1667 | Style.Check_Identifier (Defining_Entity (N), New_S); | |
725393ea ES |
1668 | |
1669 | else | |
d4810530 | 1670 | -- Only mode conformance required for a renaming_as_declaration |
725393ea ES |
1671 | |
1672 | Check_Mode_Conformant (New_S, Old_S, N); | |
996ae0b0 RK |
1673 | end if; |
1674 | ||
1675 | Inherit_Renamed_Profile (New_S, Old_S); | |
294ccb21 | 1676 | |
c92e8586 AC |
1677 | -- The prefix can be an arbitrary expression that yields a task or |
1678 | -- protected object, so it must be resolved. | |
294ccb21 RD |
1679 | |
1680 | Resolve (Prefix (Nam), Scope (Old_S)); | |
996ae0b0 RK |
1681 | end if; |
1682 | ||
1683 | Set_Convention (New_S, Convention (Old_S)); | |
1684 | Set_Has_Completion (New_S, Inside_A_Generic); | |
1685 | ||
c92e8586 AC |
1686 | -- AI05-0225: If the renamed entity is a procedure or entry of a |
1687 | -- protected object, the target object must be a variable. | |
1688 | ||
1689 | if Ekind (Scope (Old_S)) in Protected_Kind | |
1690 | and then Ekind (New_S) = E_Procedure | |
1691 | and then not Is_Variable (Prefix (Nam)) | |
1692 | then | |
1693 | if Is_Actual then | |
1694 | Error_Msg_N | |
1695 | ("target object of protected operation used as actual for " | |
1696 | & "formal procedure must be a variable", Nam); | |
1697 | else | |
1698 | Error_Msg_N | |
1699 | ("target object of protected operation renamed as procedure, " | |
1700 | & "must be a variable", Nam); | |
1701 | end if; | |
1702 | end if; | |
1703 | ||
996ae0b0 RK |
1704 | if Is_Body then |
1705 | Check_Frozen_Renaming (N, New_S); | |
1706 | end if; | |
1707 | end Analyze_Renamed_Entry; | |
1708 | ||
1709 | ----------------------------------- | |
1710 | -- Analyze_Renamed_Family_Member -- | |
1711 | ----------------------------------- | |
1712 | ||
1713 | procedure Analyze_Renamed_Family_Member | |
1714 | (N : Node_Id; | |
1715 | New_S : Entity_Id; | |
1716 | Is_Body : Boolean) | |
1717 | is | |
fbf5a39b AC |
1718 | Nam : constant Node_Id := Name (N); |
1719 | P : constant Node_Id := Prefix (Nam); | |
996ae0b0 RK |
1720 | Old_S : Entity_Id; |
1721 | ||
1722 | begin | |
1723 | if (Is_Entity_Name (P) and then Ekind (Entity (P)) = E_Entry_Family) | |
1724 | or else (Nkind (P) = N_Selected_Component | |
ac7d724d | 1725 | and then Ekind (Entity (Selector_Name (P))) = E_Entry_Family) |
996ae0b0 RK |
1726 | then |
1727 | if Is_Entity_Name (P) then | |
1728 | Old_S := Entity (P); | |
1729 | else | |
1730 | Old_S := Entity (Selector_Name (P)); | |
1731 | end if; | |
1732 | ||
1733 | if not Entity_Matches_Spec (Old_S, New_S) then | |
1734 | Error_Msg_N ("entry family does not match specification", N); | |
1735 | ||
1736 | elsif Is_Body then | |
1737 | Check_Subtype_Conformant (New_S, Old_S, N); | |
1738 | Generate_Reference (New_S, Defining_Entity (N), 'b'); | |
1739 | Style.Check_Identifier (Defining_Entity (N), New_S); | |
1740 | end if; | |
16ca248a | 1741 | |
996ae0b0 RK |
1742 | else |
1743 | Error_Msg_N ("no entry family matches specification", N); | |
1744 | end if; | |
1745 | ||
1746 | Set_Has_Completion (New_S, Inside_A_Generic); | |
1747 | ||
1748 | if Is_Body then | |
1749 | Check_Frozen_Renaming (N, New_S); | |
1750 | end if; | |
1751 | end Analyze_Renamed_Family_Member; | |
1752 | ||
294ccb21 RD |
1753 | ----------------------------------------- |
1754 | -- Analyze_Renamed_Primitive_Operation -- | |
1755 | ----------------------------------------- | |
1756 | ||
1757 | procedure Analyze_Renamed_Primitive_Operation | |
1758 | (N : Node_Id; | |
1759 | New_S : Entity_Id; | |
1760 | Is_Body : Boolean) | |
1761 | is | |
1762 | Old_S : Entity_Id; | |
1763 | ||
1764 | function Conforms | |
1765 | (Subp : Entity_Id; | |
1766 | Ctyp : Conformance_Type) return Boolean; | |
1767 | -- Verify that the signatures of the renamed entity and the new entity | |
1768 | -- match. The first formal of the renamed entity is skipped because it | |
1769 | -- is the target object in any subsequent call. | |
1770 | ||
c5d00db0 AC |
1771 | -------------- |
1772 | -- Conforms -- | |
1773 | -------------- | |
1774 | ||
294ccb21 RD |
1775 | function Conforms |
1776 | (Subp : Entity_Id; | |
1777 | Ctyp : Conformance_Type) return Boolean | |
1778 | is | |
1779 | Old_F : Entity_Id; | |
1780 | New_F : Entity_Id; | |
1781 | ||
1782 | begin | |
1783 | if Ekind (Subp) /= Ekind (New_S) then | |
1784 | return False; | |
1785 | end if; | |
1786 | ||
1787 | Old_F := Next_Formal (First_Formal (Subp)); | |
1788 | New_F := First_Formal (New_S); | |
1789 | while Present (Old_F) and then Present (New_F) loop | |
1790 | if not Conforming_Types (Etype (Old_F), Etype (New_F), Ctyp) then | |
1791 | return False; | |
1792 | end if; | |
1793 | ||
1794 | if Ctyp >= Mode_Conformant | |
1795 | and then Ekind (Old_F) /= Ekind (New_F) | |
1796 | then | |
1797 | return False; | |
1798 | end if; | |
1799 | ||
1800 | Next_Formal (New_F); | |
1801 | Next_Formal (Old_F); | |
1802 | end loop; | |
1803 | ||
1804 | return True; | |
1805 | end Conforms; | |
1806 | ||
c5d00db0 AC |
1807 | -- Start of processing for Analyze_Renamed_Primitive_Operation |
1808 | ||
294ccb21 RD |
1809 | begin |
1810 | if not Is_Overloaded (Selector_Name (Name (N))) then | |
1811 | Old_S := Entity (Selector_Name (Name (N))); | |
1812 | ||
1813 | if not Conforms (Old_S, Type_Conformant) then | |
1814 | Old_S := Any_Id; | |
1815 | end if; | |
1816 | ||
1817 | else | |
1818 | -- Find the operation that matches the given signature | |
1819 | ||
1820 | declare | |
1821 | It : Interp; | |
1822 | Ind : Interp_Index; | |
1823 | ||
1824 | begin | |
1825 | Old_S := Any_Id; | |
1826 | Get_First_Interp (Selector_Name (Name (N)), Ind, It); | |
1827 | ||
1828 | while Present (It.Nam) loop | |
1829 | if Conforms (It.Nam, Type_Conformant) then | |
1830 | Old_S := It.Nam; | |
1831 | end if; | |
1832 | ||
1833 | Get_Next_Interp (Ind, It); | |
1834 | end loop; | |
1835 | end; | |
1836 | end if; | |
1837 | ||
1838 | if Old_S = Any_Id then | |
1839 | Error_Msg_N (" no subprogram or entry matches specification", N); | |
1840 | ||
1841 | else | |
1842 | if Is_Body then | |
1843 | if not Conforms (Old_S, Subtype_Conformant) then | |
1844 | Error_Msg_N ("subtype conformance error in renaming", N); | |
1845 | end if; | |
1846 | ||
1847 | Generate_Reference (New_S, Defining_Entity (N), 'b'); | |
1848 | Style.Check_Identifier (Defining_Entity (N), New_S); | |
1849 | ||
1850 | else | |
1851 | -- Only mode conformance required for a renaming_as_declaration | |
1852 | ||
1853 | if not Conforms (Old_S, Mode_Conformant) then | |
1854 | Error_Msg_N ("mode conformance error in renaming", N); | |
1855 | end if; | |
c5d00db0 AC |
1856 | |
1857 | -- Enforce the rule given in (RM 6.3.1 (10.1/2)): a prefixed | |
1858 | -- view of a subprogram is intrinsic, because the compiler has | |
1859 | -- to generate a wrapper for any call to it. If the name in a | |
1860 | -- subprogram renaming is a prefixed view, the entity is thus | |
1861 | -- intrinsic, and 'Access cannot be applied to it. | |
1862 | ||
1863 | Set_Convention (New_S, Convention_Intrinsic); | |
294ccb21 RD |
1864 | end if; |
1865 | ||
1866 | -- Inherit_Renamed_Profile (New_S, Old_S); | |
1867 | ||
1868 | -- The prefix can be an arbitrary expression that yields an | |
1869 | -- object, so it must be resolved. | |
1870 | ||
1871 | Resolve (Prefix (Name (N))); | |
1872 | end if; | |
1873 | end Analyze_Renamed_Primitive_Operation; | |
1874 | ||
996ae0b0 RK |
1875 | --------------------------------- |
1876 | -- Analyze_Subprogram_Renaming -- | |
1877 | --------------------------------- | |
1878 | ||
1879 | procedure Analyze_Subprogram_Renaming (N : Node_Id) is | |
fc193526 HK |
1880 | Formal_Spec : constant Entity_Id := Corresponding_Formal_Spec (N); |
1881 | Is_Actual : constant Boolean := Present (Formal_Spec); | |
0ab80019 | 1882 | Nam : constant Node_Id := Name (N); |
923fa078 | 1883 | Save_AV : constant Ada_Version_Type := Ada_Version; |
fb620b37 | 1884 | Save_AVP : constant Node_Id := Ada_Version_Pragma; |
923fa078 RD |
1885 | Save_AV_Exp : constant Ada_Version_Type := Ada_Version_Explicit; |
1886 | Spec : constant Node_Id := Specification (N); | |
1887 | ||
fc193526 HK |
1888 | Old_S : Entity_Id := Empty; |
1889 | Rename_Spec : Entity_Id; | |
1890 | ||
1891 | procedure Build_Class_Wide_Wrapper | |
1892 | (Ren_Id : out Entity_Id; | |
1893 | Wrap_Id : out Entity_Id); | |
1894 | -- Ada 2012 (AI05-0071): A generic/instance scenario involving a formal | |
1895 | -- type with unknown discriminants and a generic primitive operation of | |
1896 | -- the said type with a box require special processing when the actual | |
1897 | -- is a class-wide type: | |
2feb1f84 | 1898 | -- |
fc193526 HK |
1899 | -- generic |
1900 | -- type Formal_Typ (<>) is private; | |
1901 | -- with procedure Prim_Op (Param : Formal_Typ) is <>; | |
1902 | -- package Gen is ... | |
2feb1f84 | 1903 | -- |
fc193526 | 1904 | -- package Inst is new Gen (Actual_Typ'Class); |
2feb1f84 | 1905 | -- |
fc193526 HK |
1906 | -- In this case the general renaming mechanism used in the prologue of |
1907 | -- an instance no longer applies: | |
2feb1f84 | 1908 | -- |
fc193526 | 1909 | -- procedure Prim_Op (Param : Formal_Typ) renames Prim_Op; |
2feb1f84 | 1910 | -- |
fc193526 | 1911 | -- The above is replaced the following wrapper/renaming combination: |
2feb1f84 | 1912 | -- |
6d0b56ad | 1913 | -- procedure Wrapper (Param : Formal_Typ) is -- wrapper |
fc193526 HK |
1914 | -- begin |
1915 | -- Prim_Op (Param); -- primitive | |
1916 | -- end Wrapper; | |
2feb1f84 | 1917 | -- |
6d0b56ad | 1918 | -- procedure Prim_Op (Param : Formal_Typ) renames Wrapper; |
2feb1f84 | 1919 | -- |
fc193526 HK |
1920 | -- This transformation applies only if there is no explicit visible |
1921 | -- class-wide operation at the point of the instantiation. Ren_Id is | |
1922 | -- the entity of the renaming declaration. Wrap_Id is the entity of | |
1923 | -- the generated class-wide wrapper (or Any_Id). | |
1924 | ||
923fa078 RD |
1925 | procedure Check_Null_Exclusion |
1926 | (Ren : Entity_Id; | |
1927 | Sub : Entity_Id); | |
1928 | -- Ada 2005 (AI-423): Given renaming Ren of subprogram Sub, check the | |
1929 | -- following AI rules: | |
16ca248a ES |
1930 | -- |
1931 | -- If Ren is a renaming of a formal subprogram and one of its | |
1932 | -- parameters has a null exclusion, then the corresponding formal | |
1933 | -- in Sub must also have one. Otherwise the subtype of the Sub's | |
1934 | -- formal parameter must exclude null. | |
1935 | -- | |
f3d57416 | 1936 | -- If Ren is a renaming of a formal function and its return |
16ca248a ES |
1937 | -- profile has a null exclusion, then Sub's return profile must |
1938 | -- have one. Otherwise the subtype of Sub's return profile must | |
1939 | -- exclude null. | |
996ae0b0 | 1940 | |
02e4edea AC |
1941 | procedure Freeze_Actual_Profile; |
1942 | -- In Ada 2012, enforce the freezing rule concerning formal incomplete | |
1943 | -- types: a callable entity freezes its profile, unless it has an | |
1944 | -- incomplete untagged formal (RM 13.14(10.2/3)). | |
1945 | ||
fc193526 HK |
1946 | function Has_Class_Wide_Actual return Boolean; |
1947 | -- Ada 2012 (AI05-071, AI05-0131): True if N is the renaming for a | |
1948 | -- defaulted formal subprogram where the actual for the controlling | |
1949 | -- formal type is class-wide. | |
1950 | ||
07fc65c4 | 1951 | function Original_Subprogram (Subp : Entity_Id) return Entity_Id; |
16ca248a ES |
1952 | -- Find renamed entity when the declaration is a renaming_as_body and |
1953 | -- the renamed entity may itself be a renaming_as_body. Used to enforce | |
1954 | -- rule that a renaming_as_body is illegal if the declaration occurs | |
1955 | -- before the subprogram it completes is frozen, and renaming indirectly | |
1956 | -- renames the subprogram itself.(Defect Report 8652/0027). | |
07fc65c4 | 1957 | |
fc193526 HK |
1958 | ------------------------------ |
1959 | -- Build_Class_Wide_Wrapper -- | |
1960 | ------------------------------ | |
1138cf59 | 1961 | |
fc193526 HK |
1962 | procedure Build_Class_Wide_Wrapper |
1963 | (Ren_Id : out Entity_Id; | |
1964 | Wrap_Id : out Entity_Id) | |
1965 | is | |
1138cf59 AC |
1966 | Loc : constant Source_Ptr := Sloc (N); |
1967 | ||
fc193526 HK |
1968 | function Build_Call |
1969 | (Subp_Id : Entity_Id; | |
1970 | Params : List_Id) return Node_Id; | |
1971 | -- Create a dispatching call to invoke routine Subp_Id with actuals | |
1972 | -- built from the parameter specifications of list Params. | |
1138cf59 | 1973 | |
fc193526 HK |
1974 | function Build_Spec (Subp_Id : Entity_Id) return Node_Id; |
1975 | -- Create a subprogram specification based on the subprogram profile | |
1976 | -- of Subp_Id. | |
1138cf59 | 1977 | |
fc193526 HK |
1978 | function Find_Primitive (Typ : Entity_Id) return Entity_Id; |
1979 | -- Find a primitive subprogram of type Typ which matches the profile | |
1980 | -- of the renaming declaration. | |
1138cf59 | 1981 | |
fc193526 HK |
1982 | procedure Interpretation_Error (Subp_Id : Entity_Id); |
1983 | -- Emit a continuation error message suggesting subprogram Subp_Id as | |
1984 | -- a possible interpretation. | |
1138cf59 | 1985 | |
b6621d10 AC |
1986 | function Is_Intrinsic_Equality (Subp_Id : Entity_Id) return Boolean; |
1987 | -- Determine whether subprogram Subp_Id denotes the intrinsic "=" | |
1988 | -- operator. | |
1989 | ||
1990 | function Is_Suitable_Candidate (Subp_Id : Entity_Id) return Boolean; | |
1991 | -- Determine whether subprogram Subp_Id is a suitable candidate for | |
1992 | -- the role of a wrapped subprogram. | |
1993 | ||
fc193526 HK |
1994 | ---------------- |
1995 | -- Build_Call -- | |
1996 | ---------------- | |
1997 | ||
1998 | function Build_Call | |
1999 | (Subp_Id : Entity_Id; | |
2000 | Params : List_Id) return Node_Id | |
2001 | is | |
2002 | Actuals : constant List_Id := New_List; | |
2003 | Call_Ref : constant Node_Id := New_Occurrence_Of (Subp_Id, Loc); | |
2004 | Formal : Node_Id; | |
1138cf59 AC |
2005 | |
2006 | begin | |
fc193526 HK |
2007 | -- Build the actual parameters of the call |
2008 | ||
2009 | Formal := First (Params); | |
2010 | while Present (Formal) loop | |
1138cf59 | 2011 | Append_To (Actuals, |
fc193526 | 2012 | Make_Identifier (Loc, Chars (Defining_Identifier (Formal)))); |
fc193526 | 2013 | Next (Formal); |
1138cf59 AC |
2014 | end loop; |
2015 | ||
fc193526 HK |
2016 | -- Generate: |
2017 | -- return Subp_Id (Actuals); | |
2018 | ||
2019 | if Ekind_In (Subp_Id, E_Function, E_Operator) then | |
2020 | return | |
2021 | Make_Simple_Return_Statement (Loc, | |
2022 | Expression => | |
2023 | Make_Function_Call (Loc, | |
2024 | Name => Call_Ref, | |
2025 | Parameter_Associations => Actuals)); | |
2026 | ||
2027 | -- Generate: | |
2028 | -- Subp_Id (Actuals); | |
2029 | ||
1138cf59 AC |
2030 | else |
2031 | return | |
2032 | Make_Procedure_Call_Statement (Loc, | |
fc193526 HK |
2033 | Name => Call_Ref, |
2034 | Parameter_Associations => Actuals); | |
1138cf59 | 2035 | end if; |
fc193526 | 2036 | end Build_Call; |
1138cf59 | 2037 | |
fc193526 HK |
2038 | ---------------- |
2039 | -- Build_Spec -- | |
2040 | ---------------- | |
1138cf59 | 2041 | |
fc193526 HK |
2042 | function Build_Spec (Subp_Id : Entity_Id) return Node_Id is |
2043 | Params : constant List_Id := Copy_Parameter_List (Subp_Id); | |
2044 | Spec_Id : constant Entity_Id := | |
6d0b56ad AC |
2045 | Make_Defining_Identifier (Loc, |
2046 | Chars => New_External_Name (Chars (Subp_Id), 'R')); | |
1138cf59 AC |
2047 | |
2048 | begin | |
fc193526 | 2049 | if Ekind (Formal_Spec) = E_Procedure then |
1138cf59 AC |
2050 | return |
2051 | Make_Procedure_Specification (Loc, | |
fc193526 HK |
2052 | Defining_Unit_Name => Spec_Id, |
2053 | Parameter_Specifications => Params); | |
1138cf59 AC |
2054 | else |
2055 | return | |
fc193526 HK |
2056 | Make_Function_Specification (Loc, |
2057 | Defining_Unit_Name => Spec_Id, | |
2058 | Parameter_Specifications => Params, | |
2059 | Result_Definition => | |
2060 | New_Copy_Tree (Result_Definition (Spec))); | |
1138cf59 | 2061 | end if; |
fc193526 HK |
2062 | end Build_Spec; |
2063 | ||
2064 | -------------------- | |
2065 | -- Find_Primitive -- | |
2066 | -------------------- | |
2067 | ||
2068 | function Find_Primitive (Typ : Entity_Id) return Entity_Id is | |
2069 | procedure Replace_Parameter_Types (Spec : Node_Id); | |
2070 | -- Given a specification Spec, replace all class-wide parameter | |
2071 | -- types with reference to type Typ. | |
1138cf59 | 2072 | |
fc193526 HK |
2073 | ----------------------------- |
2074 | -- Replace_Parameter_Types -- | |
2075 | ----------------------------- | |
2076 | ||
2077 | procedure Replace_Parameter_Types (Spec : Node_Id) is | |
2078 | Formal : Node_Id; | |
2079 | Formal_Id : Entity_Id; | |
2080 | Formal_Typ : Node_Id; | |
2081 | ||
2082 | begin | |
2083 | Formal := First (Parameter_Specifications (Spec)); | |
2084 | while Present (Formal) loop | |
2085 | Formal_Id := Defining_Identifier (Formal); | |
2086 | Formal_Typ := Parameter_Type (Formal); | |
2087 | ||
2088 | -- Create a new entity for each class-wide formal to prevent | |
2089 | -- aliasing with the original renaming. Replace the type of | |
2090 | -- such a parameter with the candidate type. | |
2091 | ||
2092 | if Nkind (Formal_Typ) = N_Identifier | |
2093 | and then Is_Class_Wide_Type (Etype (Formal_Typ)) | |
2094 | then | |
2095 | Set_Defining_Identifier (Formal, | |
2096 | Make_Defining_Identifier (Loc, Chars (Formal_Id))); | |
2097 | ||
2098 | Set_Parameter_Type (Formal, New_Occurrence_Of (Typ, Loc)); | |
2099 | end if; | |
2100 | ||
2101 | Next (Formal); | |
2102 | end loop; | |
2103 | end Replace_Parameter_Types; | |
2104 | ||
2105 | -- Local variables | |
2106 | ||
2107 | Alt_Ren : constant Node_Id := New_Copy_Tree (N); | |
2108 | Alt_Nam : constant Node_Id := Name (Alt_Ren); | |
2109 | Alt_Spec : constant Node_Id := Specification (Alt_Ren); | |
2110 | Subp_Id : Entity_Id; | |
2111 | ||
2112 | -- Start of processing for Find_Primitive | |
2113 | ||
2114 | begin | |
2115 | -- Each attempt to find a suitable primitive of a particular type | |
2116 | -- operates on its own copy of the original renaming. As a result | |
2117 | -- the original renaming is kept decoration and side-effect free. | |
2118 | ||
2119 | -- Inherit the overloaded status of the renamed subprogram name | |
2120 | ||
2121 | if Is_Overloaded (Nam) then | |
2122 | Set_Is_Overloaded (Alt_Nam); | |
2123 | Save_Interps (Nam, Alt_Nam); | |
2124 | end if; | |
2125 | ||
2126 | -- The copied renaming is hidden from visibility to prevent the | |
2127 | -- pollution of the enclosing context. | |
2128 | ||
2129 | Set_Defining_Unit_Name (Alt_Spec, Make_Temporary (Loc, 'R')); | |
2130 | ||
2131 | -- The types of all class-wide parameters must be changed to the | |
2132 | -- candidate type. | |
2133 | ||
2134 | Replace_Parameter_Types (Alt_Spec); | |
2135 | ||
2136 | -- Try to find a suitable primitive which matches the altered | |
2137 | -- profile of the renaming specification. | |
2138 | ||
2139 | Subp_Id := | |
2140 | Find_Renamed_Entity | |
2141 | (N => Alt_Ren, | |
2142 | Nam => Name (Alt_Ren), | |
2143 | New_S => Analyze_Subprogram_Specification (Alt_Spec), | |
2144 | Is_Actual => Is_Actual); | |
2145 | ||
2146 | -- Do not return Any_Id if the resolion of the altered profile | |
2147 | -- failed as this complicates further checks on the caller side, | |
2148 | -- return Empty instead. | |
2149 | ||
2150 | if Subp_Id = Any_Id then | |
2151 | return Empty; | |
2152 | else | |
2153 | return Subp_Id; | |
2154 | end if; | |
2155 | end Find_Primitive; | |
2156 | ||
2157 | -------------------------- | |
2158 | -- Interpretation_Error -- | |
2159 | -------------------------- | |
2160 | ||
2161 | procedure Interpretation_Error (Subp_Id : Entity_Id) is | |
2162 | begin | |
2163 | Error_Msg_Sloc := Sloc (Subp_Id); | |
b6621d10 AC |
2164 | |
2165 | if Is_Internal (Subp_Id) then | |
2166 | Error_Msg_NE | |
2167 | ("\\possible interpretation: predefined & #", | |
2168 | Spec, Formal_Spec); | |
2169 | else | |
2170 | Error_Msg_NE | |
2171 | ("\\possible interpretation: & defined #", Spec, Formal_Spec); | |
2172 | end if; | |
fc193526 HK |
2173 | end Interpretation_Error; |
2174 | ||
b6621d10 AC |
2175 | --------------------------- |
2176 | -- Is_Intrinsic_Equality -- | |
2177 | --------------------------- | |
2178 | ||
2179 | function Is_Intrinsic_Equality (Subp_Id : Entity_Id) return Boolean is | |
2180 | begin | |
2181 | return | |
2182 | Ekind (Subp_Id) = E_Operator | |
2183 | and then Chars (Subp_Id) = Name_Op_Eq | |
2184 | and then Is_Intrinsic_Subprogram (Subp_Id); | |
2185 | end Is_Intrinsic_Equality; | |
2186 | ||
2187 | --------------------------- | |
2188 | -- Is_Suitable_Candidate -- | |
2189 | --------------------------- | |
2190 | ||
2191 | function Is_Suitable_Candidate (Subp_Id : Entity_Id) return Boolean is | |
2192 | begin | |
2193 | if No (Subp_Id) then | |
2194 | return False; | |
2195 | ||
2196 | -- An intrinsic subprogram is never a good candidate. This is an | |
2197 | -- indication of a missing primitive, either defined directly or | |
2198 | -- inherited from a parent tagged type. | |
2199 | ||
2200 | elsif Is_Intrinsic_Subprogram (Subp_Id) then | |
2201 | return False; | |
2202 | ||
2203 | else | |
2204 | return True; | |
2205 | end if; | |
2206 | end Is_Suitable_Candidate; | |
2207 | ||
fc193526 HK |
2208 | -- Local variables |
2209 | ||
2210 | Actual_Typ : Entity_Id := Empty; | |
2211 | -- The actual class-wide type for Formal_Typ | |
2212 | ||
b6621d10 | 2213 | CW_Prim_OK : Boolean; |
fc193526 | 2214 | CW_Prim_Op : Entity_Id; |
b6621d10 AC |
2215 | -- The class-wide subprogram (if available) which corresponds to the |
2216 | -- renamed generic formal subprogram. | |
fc193526 HK |
2217 | |
2218 | Formal_Typ : Entity_Id := Empty; | |
b6621d10 | 2219 | -- The generic formal type with unknown discriminants |
fc193526 | 2220 | |
b6621d10 | 2221 | Root_Prim_OK : Boolean; |
fc193526 | 2222 | Root_Prim_Op : Entity_Id; |
b6621d10 AC |
2223 | -- The root type primitive (if available) which corresponds to the |
2224 | -- renamed generic formal subprogram. | |
2225 | ||
2226 | Root_Typ : Entity_Id := Empty; | |
2227 | -- The root type of Actual_Typ | |
fc193526 HK |
2228 | |
2229 | Body_Decl : Node_Id; | |
2230 | Formal : Node_Id; | |
2231 | Prim_Op : Entity_Id; | |
2232 | Spec_Decl : Node_Id; | |
2233 | ||
2234 | -- Start of processing for Build_Class_Wide_Wrapper | |
1138cf59 AC |
2235 | |
2236 | begin | |
fc193526 HK |
2237 | -- Analyze the specification of the renaming in case the generation |
2238 | -- of the class-wide wrapper fails. | |
2239 | ||
2240 | Ren_Id := Analyze_Subprogram_Specification (Spec); | |
2241 | Wrap_Id := Any_Id; | |
2242 | ||
2243 | -- Do not attempt to build a wrapper if the renaming is in error | |
2244 | ||
2245 | if Error_Posted (Nam) then | |
2246 | return; | |
2247 | end if; | |
2248 | ||
2249 | -- Analyze the renamed name, but do not resolve it. The resolution is | |
b6621d10 | 2250 | -- completed once a suitable subprogram is found. |
fc193526 HK |
2251 | |
2252 | Analyze (Nam); | |
2253 | ||
b6621d10 AC |
2254 | -- When the renamed name denotes the intrinsic operator equals, the |
2255 | -- name must be treated as overloaded. This allows for a potential | |
2256 | -- match against the root type's predefined equality function. | |
2257 | ||
2258 | if Is_Intrinsic_Equality (Entity (Nam)) then | |
2259 | Set_Is_Overloaded (Nam); | |
2260 | Collect_Interps (Nam); | |
2261 | end if; | |
2262 | ||
fc193526 HK |
2263 | -- Step 1: Find the generic formal type with unknown discriminants |
2264 | -- and its corresponding class-wide actual type from the renamed | |
2265 | -- generic formal subprogram. | |
2266 | ||
2267 | Formal := First_Formal (Formal_Spec); | |
2268 | while Present (Formal) loop | |
2269 | if Has_Unknown_Discriminants (Etype (Formal)) | |
2270 | and then not Is_Class_Wide_Type (Etype (Formal)) | |
2271 | and then Is_Class_Wide_Type (Get_Instance_Of (Etype (Formal))) | |
1138cf59 | 2272 | then |
fc193526 HK |
2273 | Formal_Typ := Etype (Formal); |
2274 | Actual_Typ := Get_Instance_Of (Formal_Typ); | |
b6621d10 | 2275 | Root_Typ := Etype (Actual_Typ); |
1138cf59 AC |
2276 | exit; |
2277 | end if; | |
2278 | ||
fc193526 | 2279 | Next_Formal (Formal); |
1138cf59 AC |
2280 | end loop; |
2281 | ||
fc193526 HK |
2282 | -- The specification of the generic formal subprogram should always |
2283 | -- contain a formal type with unknown discriminants whose actual is | |
2284 | -- a class-wide type, otherwise this indicates a failure in routine | |
2285 | -- Has_Class_Wide_Actual. | |
1138cf59 | 2286 | |
fc193526 | 2287 | pragma Assert (Present (Formal_Typ)); |
1138cf59 | 2288 | |
b6621d10 AC |
2289 | -- Step 2: Find the proper class-wide subprogram or primitive which |
2290 | -- corresponds to the renamed generic formal subprogram. | |
1138cf59 | 2291 | |
fc193526 | 2292 | CW_Prim_Op := Find_Primitive (Actual_Typ); |
b6621d10 AC |
2293 | CW_Prim_OK := Is_Suitable_Candidate (CW_Prim_Op); |
2294 | Root_Prim_Op := Find_Primitive (Root_Typ); | |
2295 | Root_Prim_OK := Is_Suitable_Candidate (Root_Prim_Op); | |
1138cf59 | 2296 | |
b6621d10 | 2297 | -- The class-wide actual type has two subprograms which correspond to |
fc193526 | 2298 | -- the renamed generic formal subprogram: |
1138cf59 | 2299 | |
fc193526 HK |
2300 | -- with procedure Prim_Op (Param : Formal_Typ); |
2301 | ||
2302 | -- procedure Prim_Op (Param : Actual_Typ); -- may be inherited | |
2303 | -- procedure Prim_Op (Param : Actual_Typ'Class); | |
2304 | ||
b6621d10 AC |
2305 | -- Even though the declaration of the two subprograms is legal, a |
2306 | -- call to either one is ambiguous and therefore illegal. | |
fc193526 | 2307 | |
b6621d10 | 2308 | if CW_Prim_OK and Root_Prim_OK then |
fc193526 | 2309 | |
b6621d10 | 2310 | -- A user-defined primitive has precedence over a predefined one |
fc193526 | 2311 | |
b6621d10 AC |
2312 | if Is_Internal (CW_Prim_Op) |
2313 | and then not Is_Internal (Root_Prim_Op) | |
fc193526 | 2314 | then |
fc193526 | 2315 | Prim_Op := Root_Prim_Op; |
1138cf59 | 2316 | |
b6621d10 AC |
2317 | elsif Is_Internal (Root_Prim_Op) |
2318 | and then not Is_Internal (CW_Prim_Op) | |
2319 | then | |
fc193526 | 2320 | Prim_Op := CW_Prim_Op; |
1138cf59 | 2321 | |
fc193526 HK |
2322 | elsif CW_Prim_Op = Root_Prim_Op then |
2323 | Prim_Op := Root_Prim_Op; | |
1138cf59 | 2324 | |
b6621d10 AC |
2325 | -- Otherwise both candidate subprograms are user-defined and |
2326 | -- ambiguous. | |
1138cf59 | 2327 | |
fc193526 HK |
2328 | else |
2329 | Error_Msg_NE | |
2330 | ("ambiguous actual for generic subprogram &", | |
b6621d10 | 2331 | Spec, Formal_Spec); |
fc193526 | 2332 | Interpretation_Error (Root_Prim_Op); |
b6621d10 | 2333 | Interpretation_Error (CW_Prim_Op); |
fc193526 | 2334 | return; |
f4f92d9d | 2335 | end if; |
1138cf59 | 2336 | |
b6621d10 | 2337 | elsif CW_Prim_OK and not Root_Prim_OK then |
fc193526 HK |
2338 | Prim_Op := CW_Prim_Op; |
2339 | ||
b6621d10 AC |
2340 | elsif not CW_Prim_OK and Root_Prim_OK then |
2341 | Prim_Op := Root_Prim_Op; | |
2342 | ||
2343 | -- An intrinsic equality may act as a suitable candidate in the case | |
2344 | -- of a null type extension where the parent's equality is hidden. A | |
2345 | -- call to an intrinsic equality is expanded as dispatching. | |
2346 | ||
2347 | elsif Present (Root_Prim_Op) | |
2348 | and then Is_Intrinsic_Equality (Root_Prim_Op) | |
2349 | then | |
fc193526 HK |
2350 | Prim_Op := Root_Prim_Op; |
2351 | ||
b6621d10 | 2352 | -- Otherwise there are no candidate subprograms. Let the caller |
fc193526 HK |
2353 | -- diagnose the error. |
2354 | ||
2355 | else | |
2356 | return; | |
2357 | end if; | |
2358 | ||
6d0b56ad AC |
2359 | -- At this point resolution has taken place and the name is no longer |
2360 | -- overloaded. Mark the primitive as referenced. | |
fc193526 | 2361 | |
6d0b56ad | 2362 | Set_Is_Overloaded (Name (N), False); |
ad5edba5 | 2363 | Set_Referenced (Prim_Op); |
fc193526 HK |
2364 | |
2365 | -- Step 3: Create the declaration and the body of the wrapper, insert | |
2366 | -- all the pieces into the tree. | |
2367 | ||
2368 | Spec_Decl := | |
2369 | Make_Subprogram_Declaration (Loc, | |
2370 | Specification => Build_Spec (Ren_Id)); | |
6d0b56ad AC |
2371 | Insert_Before_And_Analyze (N, Spec_Decl); |
2372 | ||
2373 | -- If the operator carries an Eliminated pragma, indicate that the | |
2374 | -- wrapper is also to be eliminated, to prevent spurious error when | |
2375 | -- using gnatelim on programs that include box-initialization of | |
2376 | -- equality operators. | |
2377 | ||
2378 | Wrap_Id := Defining_Entity (Spec_Decl); | |
2379 | Set_Is_Eliminated (Wrap_Id, Is_Eliminated (Prim_Op)); | |
fc193526 HK |
2380 | |
2381 | Body_Decl := | |
2382 | Make_Subprogram_Body (Loc, | |
2383 | Specification => Build_Spec (Ren_Id), | |
2384 | Declarations => New_List, | |
2385 | Handled_Statement_Sequence => | |
2386 | Make_Handled_Sequence_Of_Statements (Loc, | |
2387 | Statements => New_List ( | |
2388 | Build_Call | |
2389 | (Subp_Id => Prim_Op, | |
2390 | Params => | |
2391 | Parameter_Specifications | |
2392 | (Specification (Spec_Decl)))))); | |
2393 | ||
fc193526 HK |
2394 | -- The generated body does not freeze and must be analyzed when the |
2395 | -- class-wide wrapper is frozen. The body is only needed if expansion | |
2396 | -- is enabled. | |
2397 | ||
2398 | if Expander_Active then | |
2399 | Append_Freeze_Action (Wrap_Id, Body_Decl); | |
1138cf59 AC |
2400 | end if; |
2401 | ||
6d0b56ad | 2402 | -- Step 4: The subprogram renaming aliases the wrapper |
1138cf59 | 2403 | |
6d0b56ad | 2404 | Rewrite (Nam, New_Occurrence_Of (Wrap_Id, Loc)); |
fc193526 | 2405 | end Build_Class_Wide_Wrapper; |
1138cf59 | 2406 | |
923fa078 RD |
2407 | -------------------------- |
2408 | -- Check_Null_Exclusion -- | |
2409 | -------------------------- | |
2410 | ||
2411 | procedure Check_Null_Exclusion | |
2412 | (Ren : Entity_Id; | |
2413 | Sub : Entity_Id) | |
2414 | is | |
16ca248a ES |
2415 | Ren_Formal : Entity_Id; |
2416 | Sub_Formal : Entity_Id; | |
923fa078 RD |
2417 | |
2418 | begin | |
2419 | -- Parameter check | |
2420 | ||
16ca248a ES |
2421 | Ren_Formal := First_Formal (Ren); |
2422 | Sub_Formal := First_Formal (Sub); | |
ac7d724d | 2423 | while Present (Ren_Formal) and then Present (Sub_Formal) loop |
923fa078 RD |
2424 | if Has_Null_Exclusion (Parent (Ren_Formal)) |
2425 | and then | |
2426 | not (Has_Null_Exclusion (Parent (Sub_Formal)) | |
ac7d724d | 2427 | or else Can_Never_Be_Null (Etype (Sub_Formal))) |
923fa078 | 2428 | then |
fbe627af RD |
2429 | Error_Msg_NE |
2430 | ("`NOT NULL` required for parameter &", | |
2431 | Parent (Sub_Formal), Sub_Formal); | |
923fa078 RD |
2432 | end if; |
2433 | ||
2434 | Next_Formal (Ren_Formal); | |
2435 | Next_Formal (Sub_Formal); | |
2436 | end loop; | |
2437 | ||
2438 | -- Return profile check | |
2439 | ||
2440 | if Nkind (Parent (Ren)) = N_Function_Specification | |
2441 | and then Nkind (Parent (Sub)) = N_Function_Specification | |
2442 | and then Has_Null_Exclusion (Parent (Ren)) | |
ac7d724d ES |
2443 | and then not (Has_Null_Exclusion (Parent (Sub)) |
2444 | or else Can_Never_Be_Null (Etype (Sub))) | |
923fa078 | 2445 | then |
fbe627af RD |
2446 | Error_Msg_N |
2447 | ("return must specify `NOT NULL`", | |
2448 | Result_Definition (Parent (Sub))); | |
923fa078 RD |
2449 | end if; |
2450 | end Check_Null_Exclusion; | |
2451 | ||
02e4edea AC |
2452 | --------------------------- |
2453 | -- Freeze_Actual_Profile -- | |
2454 | --------------------------- | |
2455 | ||
2456 | procedure Freeze_Actual_Profile is | |
2457 | F : Entity_Id; | |
2458 | Has_Untagged_Inc : Boolean; | |
2459 | Instantiation_Node : constant Node_Id := Parent (N); | |
2460 | ||
2461 | begin | |
2462 | if Ada_Version >= Ada_2012 then | |
2463 | F := First_Formal (Formal_Spec); | |
2464 | Has_Untagged_Inc := False; | |
2465 | while Present (F) loop | |
2466 | if Ekind (Etype (F)) = E_Incomplete_Type | |
2467 | and then not Is_Tagged_Type (Etype (F)) | |
2468 | then | |
2469 | Has_Untagged_Inc := True; | |
2470 | exit; | |
2471 | end if; | |
2472 | ||
2473 | F := Next_Formal (F); | |
2474 | end loop; | |
2475 | ||
2476 | if Ekind (Formal_Spec) = E_Function | |
2477 | and then Ekind (Etype (Formal_Spec)) = E_Incomplete_Type | |
2478 | and then not Is_Tagged_Type (Etype (F)) | |
2479 | then | |
2480 | Has_Untagged_Inc := True; | |
2481 | end if; | |
2482 | ||
2483 | if not Has_Untagged_Inc then | |
2484 | F := First_Formal (Old_S); | |
2485 | while Present (F) loop | |
2486 | Freeze_Before (Instantiation_Node, Etype (F)); | |
2487 | ||
2488 | if Is_Incomplete_Or_Private_Type (Etype (F)) | |
2489 | and then No (Underlying_Type (Etype (F))) | |
02e4edea | 2490 | then |
6ee07c61 AC |
2491 | -- Exclude generic types, or types derived from them. |
2492 | -- They will be frozen in the enclosing instance. | |
2493 | ||
2494 | if Is_Generic_Type (Etype (F)) | |
2495 | or else Is_Generic_Type (Root_Type (Etype (F))) | |
2496 | then | |
2497 | null; | |
2498 | else | |
2499 | Error_Msg_NE | |
2500 | ("type& must be frozen before this point", | |
67a90476 | 2501 | Instantiation_Node, Etype (F)); |
6ee07c61 | 2502 | end if; |
02e4edea AC |
2503 | end if; |
2504 | ||
2505 | F := Next_Formal (F); | |
2506 | end loop; | |
2507 | end if; | |
2508 | end if; | |
2509 | end Freeze_Actual_Profile; | |
2510 | ||
fd3d2680 AC |
2511 | --------------------------- |
2512 | -- Has_Class_Wide_Actual -- | |
2513 | --------------------------- | |
2514 | ||
2515 | function Has_Class_Wide_Actual return Boolean is | |
fc193526 HK |
2516 | Formal : Entity_Id; |
2517 | Formal_Typ : Entity_Id; | |
fd3d2680 AC |
2518 | |
2519 | begin | |
fc193526 HK |
2520 | if Is_Actual then |
2521 | Formal := First_Formal (Formal_Spec); | |
2522 | while Present (Formal) loop | |
2523 | Formal_Typ := Etype (Formal); | |
2524 | ||
2525 | if Has_Unknown_Discriminants (Formal_Typ) | |
2526 | and then not Is_Class_Wide_Type (Formal_Typ) | |
2527 | and then Is_Class_Wide_Type (Get_Instance_Of (Formal_Typ)) | |
fd3d2680 AC |
2528 | then |
2529 | return True; | |
2530 | end if; | |
2531 | ||
fc193526 | 2532 | Next_Formal (Formal); |
fd3d2680 AC |
2533 | end loop; |
2534 | end if; | |
2535 | ||
2536 | return False; | |
2537 | end Has_Class_Wide_Actual; | |
2538 | ||
07fc65c4 GB |
2539 | ------------------------- |
2540 | -- Original_Subprogram -- | |
2541 | ------------------------- | |
2542 | ||
2543 | function Original_Subprogram (Subp : Entity_Id) return Entity_Id is | |
2544 | Orig_Decl : Node_Id; | |
2545 | Orig_Subp : Entity_Id; | |
2546 | ||
2547 | begin | |
2548 | -- First case: renamed entity is itself a renaming | |
2549 | ||
2550 | if Present (Alias (Subp)) then | |
2551 | return Alias (Subp); | |
2552 | ||
ac7d724d ES |
2553 | elsif Nkind (Unit_Declaration_Node (Subp)) = N_Subprogram_Declaration |
2554 | and then Present (Corresponding_Body (Unit_Declaration_Node (Subp))) | |
07fc65c4 GB |
2555 | then |
2556 | -- Check if renamed entity is a renaming_as_body | |
2557 | ||
2558 | Orig_Decl := | |
2559 | Unit_Declaration_Node | |
2560 | (Corresponding_Body (Unit_Declaration_Node (Subp))); | |
2561 | ||
2562 | if Nkind (Orig_Decl) = N_Subprogram_Renaming_Declaration then | |
2563 | Orig_Subp := Entity (Name (Orig_Decl)); | |
2564 | ||
2565 | if Orig_Subp = Rename_Spec then | |
2566 | ||
bc41faa2 | 2567 | -- Circularity detected |
07fc65c4 GB |
2568 | |
2569 | return Orig_Subp; | |
2570 | ||
2571 | else | |
2572 | return (Original_Subprogram (Orig_Subp)); | |
2573 | end if; | |
2574 | else | |
2575 | return Subp; | |
2576 | end if; | |
2577 | else | |
2578 | return Subp; | |
2579 | end if; | |
2580 | end Original_Subprogram; | |
2581 | ||
fc193526 HK |
2582 | -- Local variables |
2583 | ||
fd3d2680 AC |
2584 | CW_Actual : constant Boolean := Has_Class_Wide_Actual; |
2585 | -- Ada 2012 (AI05-071, AI05-0131): True if the renaming is for a | |
2586 | -- defaulted formal subprogram when the actual for a related formal | |
2587 | -- type is class-wide. | |
2588 | ||
fc193526 HK |
2589 | Inst_Node : Node_Id := Empty; |
2590 | New_S : Entity_Id; | |
2591 | ||
fbf5a39b | 2592 | -- Start of processing for Analyze_Subprogram_Renaming |
07fc65c4 | 2593 | |
996ae0b0 | 2594 | begin |
8636f52f HK |
2595 | -- The subprogram renaming declaration may be subject to pragma Ghost |
2596 | -- with policy Ignore. Set the mode now to ensure that any nodes | |
2597 | -- generated during analysis and expansion are properly flagged as | |
2598 | -- ignored Ghost. | |
2599 | ||
2600 | Set_Ghost_Mode (N); | |
2601 | ||
996ae0b0 RK |
2602 | -- We must test for the attribute renaming case before the Analyze |
2603 | -- call because otherwise Sem_Attr will complain that the attribute | |
2604 | -- is missing an argument when it is analyzed. | |
2605 | ||
2606 | if Nkind (Nam) = N_Attribute_Reference then | |
d239991f | 2607 | |
16ca248a ES |
2608 | -- In the case of an abstract formal subprogram association, rewrite |
2609 | -- an actual given by a stream attribute as the name of the | |
2610 | -- corresponding stream primitive of the type. | |
d239991f | 2611 | |
16ca248a ES |
2612 | -- In a generic context the stream operations are not generated, and |
2613 | -- this must be treated as a normal attribute reference, to be | |
2614 | -- expanded in subsequent instantiations. | |
d4810530 | 2615 | |
ac7d724d ES |
2616 | if Is_Actual |
2617 | and then Is_Abstract_Subprogram (Formal_Spec) | |
4460a9bc | 2618 | and then Expander_Active |
d4810530 | 2619 | then |
d239991f GD |
2620 | declare |
2621 | Stream_Prim : Entity_Id; | |
2622 | Prefix_Type : constant Entity_Id := Entity (Prefix (Nam)); | |
2623 | ||
2624 | begin | |
2625 | -- The class-wide forms of the stream attributes are not | |
2626 | -- primitive dispatching operations (even though they | |
2627 | -- internally dispatch to a stream attribute). | |
2628 | ||
2629 | if Is_Class_Wide_Type (Prefix_Type) then | |
2630 | Error_Msg_N | |
2631 | ("attribute must be a primitive dispatching operation", | |
2632 | Nam); | |
2633 | return; | |
2634 | end if; | |
2635 | ||
2636 | -- Retrieve the primitive subprogram associated with the | |
16ca248a ES |
2637 | -- attribute. This can only be a stream attribute, since those |
2638 | -- are the only ones that are dispatching (and the actual for | |
2639 | -- an abstract formal subprogram must be dispatching | |
2640 | -- operation). | |
d239991f | 2641 | |
6a4d72a6 ES |
2642 | begin |
2643 | case Attribute_Name (Nam) is | |
2644 | when Name_Input => | |
2645 | Stream_Prim := | |
2646 | Find_Prim_Op (Prefix_Type, TSS_Stream_Input); | |
2647 | when Name_Output => | |
2648 | Stream_Prim := | |
2649 | Find_Prim_Op (Prefix_Type, TSS_Stream_Output); | |
2650 | when Name_Read => | |
2651 | Stream_Prim := | |
2652 | Find_Prim_Op (Prefix_Type, TSS_Stream_Read); | |
2653 | when Name_Write => | |
2654 | Stream_Prim := | |
2655 | Find_Prim_Op (Prefix_Type, TSS_Stream_Write); | |
2656 | when others => | |
2657 | Error_Msg_N | |
2658 | ("attribute must be a primitive" | |
2659 | & " dispatching operation", Nam); | |
2660 | return; | |
2661 | end case; | |
a7a0d4dd | 2662 | |
6a4d72a6 ES |
2663 | exception |
2664 | ||
2665 | -- If no operation was found, and the type is limited, | |
2666 | -- the user should have defined one. | |
2667 | ||
2668 | when Program_Error => | |
2669 | if Is_Limited_Type (Prefix_Type) then | |
2670 | Error_Msg_NE | |
2671 | ("stream operation not defined for type&", | |
2672 | N, Prefix_Type); | |
2673 | return; | |
2674 | ||
a7a0d4dd | 2675 | -- Otherwise, compiler should have generated default |
6a4d72a6 ES |
2676 | |
2677 | else | |
2678 | raise; | |
2679 | end if; | |
2680 | end; | |
d239991f GD |
2681 | |
2682 | -- Rewrite the attribute into the name of its corresponding | |
2683 | -- primitive dispatching subprogram. We can then proceed with | |
2684 | -- the usual processing for subprogram renamings. | |
2685 | ||
2686 | declare | |
2687 | Prim_Name : constant Node_Id := | |
2688 | Make_Identifier (Sloc (Nam), | |
2689 | Chars => Chars (Stream_Prim)); | |
2690 | begin | |
2691 | Set_Entity (Prim_Name, Stream_Prim); | |
2692 | Rewrite (Nam, Prim_Name); | |
2693 | Analyze (Nam); | |
2694 | end; | |
2695 | end; | |
2696 | ||
2697 | -- Normal processing for a renaming of an attribute | |
2698 | ||
2699 | else | |
2700 | Attribute_Renaming (N); | |
2701 | return; | |
2702 | end if; | |
996ae0b0 RK |
2703 | end if; |
2704 | ||
2705 | -- Check whether this declaration corresponds to the instantiation | |
82c80734 | 2706 | -- of a formal subprogram. |
996ae0b0 | 2707 | |
16ca248a ES |
2708 | -- If this is an instantiation, the corresponding actual is frozen and |
2709 | -- error messages can be made more precise. If this is a default | |
2710 | -- subprogram, the entity is already established in the generic, and is | |
2711 | -- not retrieved by visibility. If it is a default with a box, the | |
996ae0b0 | 2712 | -- candidate interpretations, if any, have been collected when building |
16ca248a ES |
2713 | -- the renaming declaration. If overloaded, the proper interpretation is |
2714 | -- determined in Find_Renamed_Entity. If the entity is an operator, | |
996ae0b0 RK |
2715 | -- Find_Renamed_Entity applies additional visibility checks. |
2716 | ||
d239991f GD |
2717 | if Is_Actual then |
2718 | Inst_Node := Unit_Declaration_Node (Formal_Spec); | |
996ae0b0 | 2719 | |
fd3d2680 AC |
2720 | -- Check whether the renaming is for a defaulted actual subprogram |
2721 | -- with a class-wide actual. | |
2722 | ||
1c85591c AC |
2723 | -- The class-wide wrapper is not needed in GNATprove_Mode and there |
2724 | -- is an external axiomatization on the package. | |
c3831524 AC |
2725 | |
2726 | if CW_Actual | |
2727 | and then Box_Present (Inst_Node) | |
1c85591c AC |
2728 | and then not |
2729 | (GNATprove_Mode | |
2730 | and then | |
2731 | Present (Containing_Package_With_Ext_Axioms (Formal_Spec))) | |
c3831524 | 2732 | then |
fc193526 | 2733 | Build_Class_Wide_Wrapper (New_S, Old_S); |
fd3d2680 AC |
2734 | |
2735 | elsif Is_Entity_Name (Nam) | |
996ae0b0 RK |
2736 | and then Present (Entity (Nam)) |
2737 | and then not Comes_From_Source (Nam) | |
2738 | and then not Is_Overloaded (Nam) | |
2739 | then | |
2740 | Old_S := Entity (Nam); | |
fbf5a39b | 2741 | New_S := Analyze_Subprogram_Specification (Spec); |
996ae0b0 | 2742 | |
2e071734 AC |
2743 | -- Operator case |
2744 | ||
2745 | if Ekind (Entity (Nam)) = E_Operator then | |
2746 | ||
2747 | -- Box present | |
2748 | ||
2749 | if Box_Present (Inst_Node) then | |
2750 | Old_S := Find_Renamed_Entity (N, Name (N), New_S, Is_Actual); | |
2751 | ||
2752 | -- If there is an immediately visible homonym of the operator | |
2753 | -- and the declaration has a default, this is worth a warning | |
2754 | -- because the user probably did not intend to get the pre- | |
16ca248a ES |
2755 | -- defined operator, visible in the generic declaration. To |
2756 | -- find if there is an intended candidate, analyze the renaming | |
2757 | -- again in the current context. | |
2e071734 AC |
2758 | |
2759 | elsif Scope (Old_S) = Standard_Standard | |
2760 | and then Present (Default_Name (Inst_Node)) | |
2761 | then | |
2762 | declare | |
2763 | Decl : constant Node_Id := New_Copy_Tree (N); | |
2764 | Hidden : Entity_Id; | |
2765 | ||
2766 | begin | |
2767 | Set_Entity (Name (Decl), Empty); | |
2768 | Analyze (Name (Decl)); | |
2769 | Hidden := | |
2770 | Find_Renamed_Entity (Decl, Name (Decl), New_S, True); | |
2771 | ||
2772 | if Present (Hidden) | |
2773 | and then In_Open_Scopes (Scope (Hidden)) | |
2774 | and then Is_Immediately_Visible (Hidden) | |
2775 | and then Comes_From_Source (Hidden) | |
923fa078 | 2776 | and then Hidden /= Old_S |
2e071734 AC |
2777 | then |
2778 | Error_Msg_Sloc := Sloc (Hidden); | |
dbfeb4fa | 2779 | Error_Msg_N ("default subprogram is resolved " & |
2e071734 | 2780 | "in the generic declaration " & |
dbfeb4fa RD |
2781 | "(RM 12.6(17))??", N); |
2782 | Error_Msg_NE ("\and will not use & #??", N, Hidden); | |
2e071734 AC |
2783 | end if; |
2784 | end; | |
2785 | end if; | |
996ae0b0 RK |
2786 | end if; |
2787 | ||
2788 | else | |
2789 | Analyze (Nam); | |
fbf5a39b | 2790 | New_S := Analyze_Subprogram_Specification (Spec); |
996ae0b0 RK |
2791 | end if; |
2792 | ||
996ae0b0 RK |
2793 | else |
2794 | -- Renamed entity must be analyzed first, to avoid being hidden by | |
2795 | -- new name (which might be the same in a generic instance). | |
2796 | ||
2797 | Analyze (Nam); | |
2798 | ||
2799 | -- The renaming defines a new overloaded entity, which is analyzed | |
2800 | -- like a subprogram declaration. | |
2801 | ||
fbf5a39b | 2802 | New_S := Analyze_Subprogram_Specification (Spec); |
996ae0b0 RK |
2803 | end if; |
2804 | ||
2805 | if Current_Scope /= Standard_Standard then | |
2806 | Set_Is_Pure (New_S, Is_Pure (Current_Scope)); | |
2807 | end if; | |
2808 | ||
74c10109 AC |
2809 | -- Set SPARK mode from current context |
2810 | ||
2811 | Set_SPARK_Pragma (New_S, SPARK_Mode_Pragma); | |
2812 | Set_SPARK_Pragma_Inherited (New_S, True); | |
2813 | ||
996ae0b0 RK |
2814 | Rename_Spec := Find_Corresponding_Spec (N); |
2815 | ||
294ccb21 RD |
2816 | -- Case of Renaming_As_Body |
2817 | ||
996ae0b0 RK |
2818 | if Present (Rename_Spec) then |
2819 | ||
294ccb21 RD |
2820 | -- Renaming declaration is the completion of the declaration of |
2821 | -- Rename_Spec. We build an actual body for it at the freezing point. | |
996ae0b0 RK |
2822 | |
2823 | Set_Corresponding_Spec (N, Rename_Spec); | |
fbe627af | 2824 | |
ff81221b ES |
2825 | -- Deal with special case of stream functions of abstract types |
2826 | -- and interfaces. | |
294ccb21 | 2827 | |
d4810530 ES |
2828 | if Nkind (Unit_Declaration_Node (Rename_Spec)) = |
2829 | N_Abstract_Subprogram_Declaration | |
2830 | then | |
ff81221b ES |
2831 | -- Input stream functions are abstract if the object type is |
2832 | -- abstract. Similarly, all default stream functions for an | |
30783513 | 2833 | -- interface type are abstract. However, these subprograms may |
ff81221b ES |
2834 | -- receive explicit declarations in representation clauses, making |
2835 | -- the attribute subprograms usable as defaults in subsequent | |
2836 | -- type extensions. | |
d4810530 ES |
2837 | -- In this case we rewrite the declaration to make the subprogram |
2838 | -- non-abstract. We remove the previous declaration, and insert | |
2839 | -- the new one at the point of the renaming, to prevent premature | |
2840 | -- access to unfrozen types. The new declaration reuses the | |
2841 | -- specification of the previous one, and must not be analyzed. | |
2842 | ||
ff81221b ES |
2843 | pragma Assert |
2844 | (Is_Primitive (Entity (Nam)) | |
ac7d724d ES |
2845 | and then |
2846 | Is_Abstract_Type (Find_Dispatching_Type (Entity (Nam)))); | |
d4810530 ES |
2847 | declare |
2848 | Old_Decl : constant Node_Id := | |
2849 | Unit_Declaration_Node (Rename_Spec); | |
2850 | New_Decl : constant Node_Id := | |
2851 | Make_Subprogram_Declaration (Sloc (N), | |
2852 | Specification => | |
2853 | Relocate_Node (Specification (Old_Decl))); | |
2854 | begin | |
2855 | Remove (Old_Decl); | |
2856 | Insert_After (N, New_Decl); | |
16ca248a | 2857 | Set_Is_Abstract_Subprogram (Rename_Spec, False); |
d4810530 ES |
2858 | Set_Analyzed (New_Decl); |
2859 | end; | |
2860 | end if; | |
2861 | ||
996ae0b0 RK |
2862 | Set_Corresponding_Body (Unit_Declaration_Node (Rename_Spec), New_S); |
2863 | ||
0ab80019 | 2864 | if Ada_Version = Ada_83 and then Comes_From_Source (N) then |
996ae0b0 RK |
2865 | Error_Msg_N ("(Ada 83) renaming cannot serve as a body", N); |
2866 | end if; | |
2867 | ||
923fa078 | 2868 | Set_Convention (New_S, Convention (Rename_Spec)); |
996ae0b0 RK |
2869 | Check_Fully_Conformant (New_S, Rename_Spec); |
2870 | Set_Public_Status (New_S); | |
2871 | ||
294ccb21 RD |
2872 | -- The specification does not introduce new formals, but only |
2873 | -- repeats the formals of the original subprogram declaration. | |
2874 | -- For cross-reference purposes, and for refactoring tools, we | |
2875 | -- treat the formals of the renaming declaration as body formals. | |
2876 | ||
2877 | Reference_Body_Formals (Rename_Spec, New_S); | |
2878 | ||
4de287c4 ES |
2879 | -- Indicate that the entity in the declaration functions like the |
2880 | -- corresponding body, and is not a new entity. The body will be | |
2881 | -- constructed later at the freeze point, so indicate that the | |
2882 | -- completion has not been seen yet. | |
996ae0b0 RK |
2883 | |
2884 | Set_Ekind (New_S, E_Subprogram_Body); | |
2885 | New_S := Rename_Spec; | |
5eb10f25 | 2886 | Set_Has_Completion (Rename_Spec, False); |
996ae0b0 | 2887 | |
4de287c4 | 2888 | -- Ada 2005: check overriding indicator |
edd63e9b | 2889 | |
038140ed | 2890 | if Present (Overridden_Operation (Rename_Spec)) then |
235f4375 AC |
2891 | if Must_Not_Override (Specification (N)) then |
2892 | Error_Msg_NE | |
2893 | ("subprogram& overrides inherited operation", | |
2894 | N, Rename_Spec); | |
2895 | elsif | |
2896 | Style_Check and then not Must_Override (Specification (N)) | |
2897 | then | |
2898 | Style.Missing_Overriding (N, Rename_Spec); | |
2899 | end if; | |
edd63e9b | 2900 | |
235f4375 AC |
2901 | elsif Must_Override (Specification (N)) then |
2902 | Error_Msg_NE ("subprogram& is not overriding", N, Rename_Spec); | |
edd63e9b ES |
2903 | end if; |
2904 | ||
294ccb21 RD |
2905 | -- Normal subprogram renaming (not renaming as body) |
2906 | ||
996ae0b0 RK |
2907 | else |
2908 | Generate_Definition (New_S); | |
2909 | New_Overloaded_Entity (New_S); | |
edd63e9b | 2910 | |
996ae0b0 RK |
2911 | if Is_Entity_Name (Nam) |
2912 | and then Is_Intrinsic_Subprogram (Entity (Nam)) | |
2913 | then | |
2914 | null; | |
2915 | else | |
2916 | Check_Delayed_Subprogram (New_S); | |
2917 | end if; | |
2918 | end if; | |
2919 | ||
4de287c4 ES |
2920 | -- There is no need for elaboration checks on the new entity, which may |
2921 | -- be called before the next freezing point where the body will appear. | |
2922 | -- Elaboration checks refer to the real entity, not the one created by | |
2923 | -- the renaming declaration. | |
996ae0b0 | 2924 | |
ee6208f2 AC |
2925 | Set_Kill_Elaboration_Checks (New_S, True); |
2926 | ||
2927 | -- If we had a previous error, indicate a completely is present to stop | |
2928 | -- junk cascaded messages, but don't take any further action. | |
996ae0b0 RK |
2929 | |
2930 | if Etype (Nam) = Any_Type then | |
2931 | Set_Has_Completion (New_S); | |
2932 | return; | |
2933 | ||
ee6208f2 AC |
2934 | -- Case where name has the form of a selected component |
2935 | ||
996ae0b0 RK |
2936 | elsif Nkind (Nam) = N_Selected_Component then |
2937 | ||
ee6208f2 | 2938 | -- A name which has the form A.B can designate an entry of task A, a |
294ccb21 RD |
2939 | -- protected operation of protected object A, or finally a primitive |
2940 | -- operation of object A. In the later case, A is an object of some | |
2941 | -- tagged type, or an access type that denotes one such. To further | |
2942 | -- distinguish these cases, note that the scope of a task entry or | |
2943 | -- protected operation is type of the prefix. | |
996ae0b0 | 2944 | |
294ccb21 RD |
2945 | -- The prefix could be an overloaded function call that returns both |
2946 | -- kinds of operations. This overloading pathology is left to the | |
2947 | -- dedicated reader ??? | |
2948 | ||
2949 | declare | |
2950 | T : constant Entity_Id := Etype (Prefix (Nam)); | |
2951 | ||
2952 | begin | |
2953 | if Present (T) | |
2954 | and then | |
2955 | (Is_Tagged_Type (T) | |
2956 | or else | |
2957 | (Is_Access_Type (T) | |
ac7d724d | 2958 | and then Is_Tagged_Type (Designated_Type (T)))) |
294ccb21 RD |
2959 | and then Scope (Entity (Selector_Name (Nam))) /= T |
2960 | then | |
2961 | Analyze_Renamed_Primitive_Operation | |
2962 | (N, New_S, Present (Rename_Spec)); | |
2963 | return; | |
2964 | ||
2965 | else | |
2966 | -- Renamed entity is an entry or protected operation. For those | |
2967 | -- cases an explicit body is built (at the point of freezing of | |
2968 | -- this entity) that contains a call to the renamed entity. | |
2969 | ||
2970 | -- This is not allowed for renaming as body if the renamed | |
2971 | -- spec is already frozen (see RM 8.5.4(5) for details). | |
2972 | ||
ac7d724d | 2973 | if Present (Rename_Spec) and then Is_Frozen (Rename_Spec) then |
294ccb21 RD |
2974 | Error_Msg_N |
2975 | ("renaming-as-body cannot rename entry as subprogram", N); | |
2976 | Error_Msg_NE | |
2977 | ("\since & is already frozen (RM 8.5.4(5))", | |
2978 | N, Rename_Spec); | |
2979 | else | |
2980 | Analyze_Renamed_Entry (N, New_S, Present (Rename_Spec)); | |
2981 | end if; | |
2982 | ||
2983 | return; | |
2984 | end if; | |
2985 | end; | |
996ae0b0 | 2986 | |
ee6208f2 AC |
2987 | -- Case where name is an explicit dereference X.all |
2988 | ||
996ae0b0 RK |
2989 | elsif Nkind (Nam) = N_Explicit_Dereference then |
2990 | ||
2991 | -- Renamed entity is designated by access_to_subprogram expression. | |
2992 | -- Must build body to encapsulate call, as in the entry case. | |
2993 | ||
2994 | Analyze_Renamed_Dereference (N, New_S, Present (Rename_Spec)); | |
2995 | return; | |
2996 | ||
ee6208f2 AC |
2997 | -- Indexed component |
2998 | ||
996ae0b0 RK |
2999 | elsif Nkind (Nam) = N_Indexed_Component then |
3000 | Analyze_Renamed_Family_Member (N, New_S, Present (Rename_Spec)); | |
3001 | return; | |
3002 | ||
ee6208f2 AC |
3003 | -- Character literal |
3004 | ||
996ae0b0 RK |
3005 | elsif Nkind (Nam) = N_Character_Literal then |
3006 | Analyze_Renamed_Character (N, New_S, Present (Rename_Spec)); | |
3007 | return; | |
3008 | ||
fc193526 HK |
3009 | -- Only remaining case is where we have a non-entity name, or a renaming |
3010 | -- of some other non-overloadable entity. | |
ee6208f2 | 3011 | |
a3f2babd | 3012 | elsif not Is_Entity_Name (Nam) |
996ae0b0 RK |
3013 | or else not Is_Overloadable (Entity (Nam)) |
3014 | then | |
4674dd21 AC |
3015 | -- Do not mention the renaming if it comes from an instance |
3016 | ||
3017 | if not Is_Actual then | |
3018 | Error_Msg_N ("expect valid subprogram name in renaming", N); | |
4674dd21 AC |
3019 | else |
3020 | Error_Msg_NE ("no visible subprogram for formal&", N, Nam); | |
3021 | end if; | |
3022 | ||
996ae0b0 | 3023 | return; |
996ae0b0 RK |
3024 | end if; |
3025 | ||
11560bcc TQ |
3026 | -- Find the renamed entity that matches the given specification. Disable |
3027 | -- Ada_83 because there is no requirement of full conformance between | |
3028 | -- renamed entity and new entity, even though the same circuit is used. | |
3029 | ||
e80f0cb0 RD |
3030 | -- This is a bit of an odd case, which introduces a really irregular use |
3031 | -- of Ada_Version[_Explicit]. Would be nice to find cleaner way to do | |
3032 | -- this. ??? | |
11560bcc TQ |
3033 | |
3034 | Ada_Version := Ada_Version_Type'Max (Ada_Version, Ada_95); | |
fb620b37 | 3035 | Ada_Version_Pragma := Empty; |
11560bcc TQ |
3036 | Ada_Version_Explicit := Ada_Version; |
3037 | ||
3038 | if No (Old_S) then | |
3039 | Old_S := Find_Renamed_Entity (N, Name (N), New_S, Is_Actual); | |
3040 | ||
1366997b AC |
3041 | -- The visible operation may be an inherited abstract operation that |
3042 | -- was overridden in the private part, in which case a call will | |
3043 | -- dispatch to the overriding operation. Use the overriding one in | |
3044 | -- the renaming declaration, to prevent spurious errors below. | |
3045 | ||
3046 | if Is_Overloadable (Old_S) | |
3047 | and then Is_Abstract_Subprogram (Old_S) | |
3048 | and then No (DTC_Entity (Old_S)) | |
3049 | and then Present (Alias (Old_S)) | |
3050 | and then not Is_Abstract_Subprogram (Alias (Old_S)) | |
038140ed | 3051 | and then Present (Overridden_Operation (Alias (Old_S))) |
1366997b AC |
3052 | then |
3053 | Old_S := Alias (Old_S); | |
3054 | end if; | |
3055 | ||
11560bcc TQ |
3056 | -- When the renamed subprogram is overloaded and used as an actual |
3057 | -- of a generic, its entity is set to the first available homonym. | |
3058 | -- We must first disambiguate the name, then set the proper entity. | |
3059 | ||
1378bf10 | 3060 | if Is_Actual and then Is_Overloaded (Nam) then |
11560bcc TQ |
3061 | Set_Entity (Nam, Old_S); |
3062 | end if; | |
3063 | end if; | |
3064 | ||
4de287c4 ES |
3065 | -- Most common case: subprogram renames subprogram. No body is generated |
3066 | -- in this case, so we must indicate the declaration is complete as is. | |
b2c4d56d | 3067 | -- and inherit various attributes of the renamed subprogram. |
996ae0b0 RK |
3068 | |
3069 | if No (Rename_Spec) then | |
923fa078 | 3070 | Set_Has_Completion (New_S); |
b2c4d56d | 3071 | Set_Is_Imported (New_S, Is_Imported (Entity (Nam))); |
923fa078 RD |
3072 | Set_Is_Pure (New_S, Is_Pure (Entity (Nam))); |
3073 | Set_Is_Preelaborated (New_S, Is_Preelaborated (Entity (Nam))); | |
3074 | ||
c5cec2fe AC |
3075 | -- A subprogram renaming is Ghost if the renamed entity is Ghost or |
3076 | -- the construct appears within a Ghost scope. | |
3077 | ||
8636f52f | 3078 | if Is_Ghost_Entity (Entity (Nam)) or else Ghost_Mode > None then |
c5cec2fe AC |
3079 | Set_Is_Ghost_Entity (New_S); |
3080 | end if; | |
3081 | ||
923fa078 | 3082 | -- Ada 2005 (AI-423): Check the consistency of null exclusions |
11560bcc | 3083 | -- between a subprogram and its correct renaming. |
923fa078 | 3084 | |
11560bcc TQ |
3085 | -- Note: the Any_Id check is a guard that prevents compiler crashes |
3086 | -- when performing a null exclusion check between a renaming and a | |
3087 | -- renamed subprogram that has been found to be illegal. | |
3088 | ||
ac7d724d | 3089 | if Ada_Version >= Ada_2005 and then Entity (Nam) /= Any_Id then |
923fa078 RD |
3090 | Check_Null_Exclusion |
3091 | (Ren => New_S, | |
3092 | Sub => Entity (Nam)); | |
3093 | end if; | |
90067a15 ES |
3094 | |
3095 | -- Enforce the Ada 2005 rule that the renamed entity cannot require | |
3096 | -- overriding. The flag Requires_Overriding is set very selectively | |
3097 | -- and misses some other illegal cases. The additional conditions | |
3098 | -- checked below are sufficient but not necessary ??? | |
3099 | ||
3100 | -- The rule does not apply to the renaming generated for an actual | |
3101 | -- subprogram in an instance. | |
3102 | ||
3103 | if Is_Actual then | |
3104 | null; | |
3105 | ||
f3d57416 | 3106 | -- Guard against previous errors, and omit renamings of predefined |
90067a15 ES |
3107 | -- operators. |
3108 | ||
bce79204 | 3109 | elsif not Ekind_In (Old_S, E_Function, E_Procedure) then |
90067a15 ES |
3110 | null; |
3111 | ||
3112 | elsif Requires_Overriding (Old_S) | |
3113 | or else | |
3114 | (Is_Abstract_Subprogram (Old_S) | |
3115 | and then Present (Find_Dispatching_Type (Old_S)) | |
3116 | and then | |
3117 | not Is_Abstract_Type (Find_Dispatching_Type (Old_S))) | |
3118 | then | |
3119 | Error_Msg_N | |
3120 | ("renamed entity cannot be " | |
3121 | & "subprogram that requires overriding (RM 8.5.4 (5.1))", N); | |
3122 | end if; | |
996ae0b0 RK |
3123 | end if; |
3124 | ||
996ae0b0 | 3125 | if Old_S /= Any_Id then |
1378bf10 | 3126 | if Is_Actual and then From_Default (N) then |
ff4f0ed0 | 3127 | |
996ae0b0 RK |
3128 | -- This is an implicit reference to the default actual |
3129 | ||
3130 | Generate_Reference (Old_S, Nam, Typ => 'i', Force => True); | |
ff4f0ed0 | 3131 | |
996ae0b0 RK |
3132 | else |
3133 | Generate_Reference (Old_S, Nam); | |
3134 | end if; | |
3135 | ||
c92e8586 AC |
3136 | Check_Internal_Protected_Use (N, Old_S); |
3137 | ||
edd63e9b ES |
3138 | -- For a renaming-as-body, require subtype conformance, but if the |
3139 | -- declaration being completed has not been frozen, then inherit the | |
3140 | -- convention of the renamed subprogram prior to checking conformance | |
3141 | -- (unless the renaming has an explicit convention established; the | |
996ae0b0 RK |
3142 | -- rule stated in the RM doesn't seem to address this ???). |
3143 | ||
3144 | if Present (Rename_Spec) then | |
3145 | Generate_Reference (Rename_Spec, Defining_Entity (Spec), 'b'); | |
3146 | Style.Check_Identifier (Defining_Entity (Spec), Rename_Spec); | |
3147 | ||
07fc65c4 GB |
3148 | if not Is_Frozen (Rename_Spec) then |
3149 | if not Has_Convention_Pragma (Rename_Spec) then | |
3150 | Set_Convention (New_S, Convention (Old_S)); | |
3151 | end if; | |
3152 | ||
3153 | if Ekind (Old_S) /= E_Operator then | |
3154 | Check_Mode_Conformant (New_S, Old_S, Spec); | |
3155 | end if; | |
3156 | ||
3157 | if Original_Subprogram (Old_S) = Rename_Spec then | |
3158 | Error_Msg_N ("unfrozen subprogram cannot rename itself ", N); | |
3159 | end if; | |
3160 | else | |
3161 | Check_Subtype_Conformant (New_S, Old_S, Spec); | |
996ae0b0 RK |
3162 | end if; |
3163 | ||
3164 | Check_Frozen_Renaming (N, Rename_Spec); | |
996ae0b0 | 3165 | |
5eb10f25 | 3166 | -- Check explicitly that renamed entity is not intrinsic, because |
16b05213 | 3167 | -- in a generic the renamed body is not built. In this case, |
5eb10f25 ES |
3168 | -- the renaming_as_body is a completion. |
3169 | ||
3170 | if Inside_A_Generic then | |
3171 | if Is_Frozen (Rename_Spec) | |
3172 | and then Is_Intrinsic_Subprogram (Old_S) | |
3173 | then | |
3174 | Error_Msg_N | |
3175 | ("subprogram in renaming_as_body cannot be intrinsic", | |
3176 | Name (N)); | |
3177 | end if; | |
3178 | ||
3179 | Set_Has_Completion (Rename_Spec); | |
3180 | end if; | |
3181 | ||
996ae0b0 | 3182 | elsif Ekind (Old_S) /= E_Operator then |
1138cf59 | 3183 | |
2ba431e5 YM |
3184 | -- If this a defaulted subprogram for a class-wide actual there is |
3185 | -- no check for mode conformance, given that the signatures don't | |
3e24afaa | 3186 | -- match (the source mentions T but the actual mentions T'Class). |
1138cf59 | 3187 | |
afc8324d | 3188 | if CW_Actual then |
1138cf59 | 3189 | null; |
ac7d724d | 3190 | elsif not Is_Actual or else No (Enclosing_Instance) then |
1138cf59 AC |
3191 | Check_Mode_Conformant (New_S, Old_S); |
3192 | end if; | |
996ae0b0 | 3193 | |
ac7d724d | 3194 | if Is_Actual and then Error_Posted (New_S) then |
996ae0b0 RK |
3195 | Error_Msg_NE ("invalid actual subprogram: & #!", N, Old_S); |
3196 | end if; | |
3197 | end if; | |
3198 | ||
3199 | if No (Rename_Spec) then | |
3200 | ||
3201 | -- The parameter profile of the new entity is that of the renamed | |
3202 | -- entity: the subtypes given in the specification are irrelevant. | |
3203 | ||
3204 | Inherit_Renamed_Profile (New_S, Old_S); | |
3205 | ||
3206 | -- A call to the subprogram is transformed into a call to the | |
3207 | -- renamed entity. This is transitive if the renamed entity is | |
3208 | -- itself a renaming. | |
3209 | ||
3210 | if Present (Alias (Old_S)) then | |
3211 | Set_Alias (New_S, Alias (Old_S)); | |
3212 | else | |
3213 | Set_Alias (New_S, Old_S); | |
3214 | end if; | |
3215 | ||
edd63e9b ES |
3216 | -- Note that we do not set Is_Intrinsic_Subprogram if we have a |
3217 | -- renaming as body, since the entity in this case is not an | |
3218 | -- intrinsic (it calls an intrinsic, but we have a real body for | |
3219 | -- this call, and it is in this body that the required intrinsic | |
3220 | -- processing will take place). | |
996ae0b0 | 3221 | |
edd63e9b ES |
3222 | -- Also, if this is a renaming of inequality, the renamed operator |
3223 | -- is intrinsic, but what matters is the corresponding equality | |
3224 | -- operator, which may be user-defined. | |
fbf5a39b | 3225 | |
996ae0b0 | 3226 | Set_Is_Intrinsic_Subprogram |
fbf5a39b | 3227 | (New_S, |
ac7d724d ES |
3228 | Is_Intrinsic_Subprogram (Old_S) |
3229 | and then | |
3230 | (Chars (Old_S) /= Name_Op_Ne | |
3231 | or else Ekind (Old_S) = E_Operator | |
3232 | or else Is_Intrinsic_Subprogram | |
3233 | (Corresponding_Equality (Old_S)))); | |
996ae0b0 RK |
3234 | |
3235 | if Ekind (Alias (New_S)) = E_Operator then | |
3236 | Set_Has_Delayed_Freeze (New_S, False); | |
3237 | end if; | |
3238 | ||
82c80734 RD |
3239 | -- If the renaming corresponds to an association for an abstract |
3240 | -- formal subprogram, then various attributes must be set to | |
3241 | -- indicate that the renaming is an abstract dispatching operation | |
3242 | -- with a controlling type. | |
3243 | ||
16ca248a ES |
3244 | if Is_Actual and then Is_Abstract_Subprogram (Formal_Spec) then |
3245 | ||
82c80734 RD |
3246 | -- Mark the renaming as abstract here, so Find_Dispatching_Type |
3247 | -- see it as corresponding to a generic association for a | |
3248 | -- formal abstract subprogram | |
3249 | ||
16ca248a | 3250 | Set_Is_Abstract_Subprogram (New_S); |
82c80734 RD |
3251 | |
3252 | declare | |
3253 | New_S_Ctrl_Type : constant Entity_Id := | |
3254 | Find_Dispatching_Type (New_S); | |
3255 | Old_S_Ctrl_Type : constant Entity_Id := | |
3256 | Find_Dispatching_Type (Old_S); | |
3257 | ||
3258 | begin | |
3259 | if Old_S_Ctrl_Type /= New_S_Ctrl_Type then | |
3260 | Error_Msg_NE | |
3261 | ("actual must be dispatching subprogram for type&", | |
3262 | Nam, New_S_Ctrl_Type); | |
3263 | ||
3264 | else | |
3265 | Set_Is_Dispatching_Operation (New_S); | |
3266 | Check_Controlling_Formals (New_S_Ctrl_Type, New_S); | |
3267 | ||
16ca248a ES |
3268 | -- If the actual in the formal subprogram is itself a |
3269 | -- formal abstract subprogram association, there's no | |
3270 | -- dispatch table component or position to inherit. | |
82c80734 RD |
3271 | |
3272 | if Present (DTC_Entity (Old_S)) then | |
3273 | Set_DTC_Entity (New_S, DTC_Entity (Old_S)); | |
024d33d8 | 3274 | Set_DT_Position_Value (New_S, DT_Position (Old_S)); |
82c80734 RD |
3275 | end if; |
3276 | end if; | |
3277 | end; | |
3278 | end if; | |
996ae0b0 RK |
3279 | end if; |
3280 | ||
c91dbd18 AC |
3281 | if Is_Actual then |
3282 | null; | |
3283 | ||
3284 | -- The following is illegal, because F hides whatever other F may | |
3285 | -- be around: | |
a1390a6e | 3286 | -- function F (...) renames F; |
c91dbd18 AC |
3287 | |
3288 | elsif Old_S = New_S | |
3289 | or else (Nkind (Nam) /= N_Expanded_Name | |
3290 | and then Chars (Old_S) = Chars (New_S)) | |
3291 | then | |
3292 | Error_Msg_N ("subprogram cannot rename itself", N); | |
3293 | ||
a1390a6e AC |
3294 | -- This is illegal even if we use a selector: |
3295 | -- function F (...) renames Pkg.F; | |
3296 | -- because F is still hidden. | |
3297 | ||
c91dbd18 AC |
3298 | elsif Nkind (Nam) = N_Expanded_Name |
3299 | and then Entity (Prefix (Nam)) = Current_Scope | |
3300 | and then Chars (Selector_Name (Nam)) = Chars (New_S) | |
996ae0b0 | 3301 | then |
354c3840 AC |
3302 | -- This is an error, but we overlook the error and accept the |
3303 | -- renaming if the special Overriding_Renamings mode is in effect. | |
9b7424a7 | 3304 | |
354c3840 | 3305 | if not Overriding_Renamings then |
9b7424a7 | 3306 | Error_Msg_NE |
354c3840 AC |
3307 | ("implicit operation& is not visible (RM 8.3 (15))", |
3308 | Nam, Old_S); | |
9b7424a7 | 3309 | end if; |
996ae0b0 RK |
3310 | end if; |
3311 | ||
3312 | Set_Convention (New_S, Convention (Old_S)); | |
16ca248a ES |
3313 | |
3314 | if Is_Abstract_Subprogram (Old_S) then | |
3315 | if Present (Rename_Spec) then | |
3316 | Error_Msg_N | |
3317 | ("a renaming-as-body cannot rename an abstract subprogram", | |
3318 | N); | |
3319 | Set_Has_Completion (Rename_Spec); | |
3320 | else | |
3321 | Set_Is_Abstract_Subprogram (New_S); | |
3322 | end if; | |
3323 | end if; | |
3324 | ||
996ae0b0 RK |
3325 | Check_Library_Unit_Renaming (N, Old_S); |
3326 | ||
edd63e9b ES |
3327 | -- Pathological case: procedure renames entry in the scope of its |
3328 | -- task. Entry is given by simple name, but body must be built for | |
3329 | -- procedure. Of course if called it will deadlock. | |
996ae0b0 RK |
3330 | |
3331 | if Ekind (Old_S) = E_Entry then | |
3332 | Set_Has_Completion (New_S, False); | |
3333 | Set_Alias (New_S, Empty); | |
3334 | end if; | |
3335 | ||
3336 | if Is_Actual then | |
3337 | Freeze_Before (N, Old_S); | |
02e4edea | 3338 | Freeze_Actual_Profile; |
996ae0b0 RK |
3339 | Set_Has_Delayed_Freeze (New_S, False); |
3340 | Freeze_Before (N, New_S); | |
3341 | ||
82c80734 RD |
3342 | -- An abstract subprogram is only allowed as an actual in the case |
3343 | -- where the formal subprogram is also abstract. | |
3344 | ||
996ae0b0 | 3345 | if (Ekind (Old_S) = E_Procedure or else Ekind (Old_S) = E_Function) |
16ca248a ES |
3346 | and then Is_Abstract_Subprogram (Old_S) |
3347 | and then not Is_Abstract_Subprogram (Formal_Spec) | |
996ae0b0 RK |
3348 | then |
3349 | Error_Msg_N | |
3350 | ("abstract subprogram not allowed as generic actual", Nam); | |
3351 | end if; | |
3352 | end if; | |
3353 | ||
3354 | else | |
edd63e9b ES |
3355 | -- A common error is to assume that implicit operators for types are |
3356 | -- defined in Standard, or in the scope of a subtype. In those cases | |
3357 | -- where the renamed entity is given with an expanded name, it is | |
3358 | -- worth mentioning that operators for the type are not declared in | |
3359 | -- the scope given by the prefix. | |
996ae0b0 RK |
3360 | |
3361 | if Nkind (Nam) = N_Expanded_Name | |
3362 | and then Nkind (Selector_Name (Nam)) = N_Operator_Symbol | |
3363 | and then Scope (Entity (Nam)) = Standard_Standard | |
3364 | then | |
3365 | declare | |
3366 | T : constant Entity_Id := | |
3367 | Base_Type (Etype (First_Formal (New_S))); | |
996ae0b0 RK |
3368 | begin |
3369 | Error_Msg_Node_2 := Prefix (Nam); | |
fbf5a39b AC |
3370 | Error_Msg_NE |
3371 | ("operator for type& is not declared in&", Prefix (Nam), T); | |
996ae0b0 | 3372 | end; |
fbf5a39b | 3373 | |
996ae0b0 RK |
3374 | else |
3375 | Error_Msg_NE | |
3376 | ("no visible subprogram matches the specification for&", | |
3377 | Spec, New_S); | |
3378 | end if; | |
3379 | ||
3380 | if Present (Candidate_Renaming) then | |
3381 | declare | |
3382 | F1 : Entity_Id; | |
3383 | F2 : Entity_Id; | |
70b70ce8 | 3384 | T1 : Entity_Id; |
996ae0b0 RK |
3385 | |
3386 | begin | |
3387 | F1 := First_Formal (Candidate_Renaming); | |
3388 | F2 := First_Formal (New_S); | |
70b70ce8 | 3389 | T1 := First_Subtype (Etype (F1)); |
996ae0b0 RK |
3390 | while Present (F1) and then Present (F2) loop |
3391 | Next_Formal (F1); | |
3392 | Next_Formal (F2); | |
3393 | end loop; | |
3394 | ||
3395 | if Present (F1) and then Present (Default_Value (F1)) then | |
3396 | if Present (Next_Formal (F1)) then | |
3397 | Error_Msg_NE | |
3398 | ("\missing specification for &" & | |
3399 | " and other formals with defaults", Spec, F1); | |
3400 | else | |
3401 | Error_Msg_NE | |
3402 | ("\missing specification for &", Spec, F1); | |
3403 | end if; | |
3404 | end if; | |
70b70ce8 AC |
3405 | |
3406 | if Nkind (Nam) = N_Operator_Symbol | |
3407 | and then From_Default (N) | |
3408 | then | |
3409 | Error_Msg_Node_2 := T1; | |
3410 | Error_Msg_NE | |
3411 | ("default & on & is not directly visible", | |
3412 | Nam, Nam); | |
3413 | end if; | |
996ae0b0 RK |
3414 | end; |
3415 | end if; | |
3416 | end if; | |
3417 | ||
edd63e9b ES |
3418 | -- Ada 2005 AI 404: if the new subprogram is dispatching, verify that |
3419 | -- controlling access parameters are known non-null for the renamed | |
3420 | -- subprogram. Test also applies to a subprogram instantiation that | |
cdc8c54c BD |
3421 | -- is dispatching. Test is skipped if some previous error was detected |
3422 | -- that set Old_S to Any_Id. | |
edd63e9b | 3423 | |
0791fbe9 | 3424 | if Ada_Version >= Ada_2005 |
cdc8c54c | 3425 | and then Old_S /= Any_Id |
edd63e9b ES |
3426 | and then not Is_Dispatching_Operation (Old_S) |
3427 | and then Is_Dispatching_Operation (New_S) | |
3428 | then | |
3429 | declare | |
3430 | Old_F : Entity_Id; | |
3431 | New_F : Entity_Id; | |
3432 | ||
3433 | begin | |
3434 | Old_F := First_Formal (Old_S); | |
3435 | New_F := First_Formal (New_S); | |
3436 | while Present (Old_F) loop | |
3437 | if Ekind (Etype (Old_F)) = E_Anonymous_Access_Type | |
3438 | and then Is_Controlling_Formal (New_F) | |
3439 | and then not Can_Never_Be_Null (Old_F) | |
3440 | then | |
3441 | Error_Msg_N ("access parameter is controlling,", New_F); | |
fbe627af RD |
3442 | Error_Msg_NE |
3443 | ("\corresponding parameter of& " | |
3444 | & "must be explicitly null excluding", New_F, Old_S); | |
edd63e9b ES |
3445 | end if; |
3446 | ||
3447 | Next_Formal (Old_F); | |
3448 | Next_Formal (New_F); | |
3449 | end loop; | |
3450 | end; | |
3451 | end if; | |
3452 | ||
725393ea | 3453 | -- A useful warning, suggested by Ada Bug Finder (Ada-Europe 2005) |
b5c739f9 | 3454 | -- is to warn if an operator is being renamed as a different operator. |
880dabb5 AC |
3455 | -- If the operator is predefined, examine the kind of the entity, not |
3456 | -- the abbreviated declaration in Standard. | |
725393ea ES |
3457 | |
3458 | if Comes_From_Source (N) | |
3459 | and then Present (Old_S) | |
ac7d724d ES |
3460 | and then (Nkind (Old_S) = N_Defining_Operator_Symbol |
3461 | or else Ekind (Old_S) = E_Operator) | |
725393ea ES |
3462 | and then Nkind (New_S) = N_Defining_Operator_Symbol |
3463 | and then Chars (Old_S) /= Chars (New_S) | |
3464 | then | |
3465 | Error_Msg_NE | |
dbfeb4fa | 3466 | ("& is being renamed as a different operator??", N, Old_S); |
725393ea ES |
3467 | end if; |
3468 | ||
b5c739f9 RD |
3469 | -- Check for renaming of obsolescent subprogram |
3470 | ||
3471 | Check_Obsolescent_2005_Entity (Entity (Nam), Nam); | |
3472 | ||
11560bcc TQ |
3473 | -- Another warning or some utility: if the new subprogram as the same |
3474 | -- name as the old one, the old one is not hidden by an outer homograph, | |
3475 | -- the new one is not a public symbol, and the old one is otherwise | |
3476 | -- directly visible, the renaming is superfluous. | |
3477 | ||
3478 | if Chars (Old_S) = Chars (New_S) | |
3479 | and then Comes_From_Source (N) | |
3480 | and then Scope (Old_S) /= Standard_Standard | |
3481 | and then Warn_On_Redundant_Constructs | |
ac7d724d ES |
3482 | and then (Is_Immediately_Visible (Old_S) |
3483 | or else Is_Potentially_Use_Visible (Old_S)) | |
11560bcc TQ |
3484 | and then Is_Overloadable (Current_Scope) |
3485 | and then Chars (Current_Scope) /= Chars (Old_S) | |
3486 | then | |
3487 | Error_Msg_N | |
dbfeb4fa | 3488 | ("redundant renaming, entity is directly visible?r?", Name (N)); |
11560bcc TQ |
3489 | end if; |
3490 | ||
ef992452 | 3491 | -- Implementation-defined aspect specifications can appear in a renaming |
cc96a1b8 AC |
3492 | -- declaration, but not language-defined ones. The call to procedure |
3493 | -- Analyze_Aspect_Specifications will take care of this error check. | |
ef992452 AC |
3494 | |
3495 | if Has_Aspects (N) then | |
3496 | Analyze_Aspect_Specifications (N, New_S); | |
3497 | end if; | |
3498 | ||
0ab80019 | 3499 | Ada_Version := Save_AV; |
fb620b37 | 3500 | Ada_Version_Pragma := Save_AVP; |
edd63e9b | 3501 | Ada_Version_Explicit := Save_AV_Exp; |
948ed277 AC |
3502 | |
3503 | -- In GNATprove mode, the renamings of actual subprograms are replaced | |
3504 | -- with wrapper functions that make it easier to propagate axioms to the | |
a1954e97 AC |
3505 | -- points of call within an instance. Wrappers are generated if formal |
3506 | -- subprogram is subject to axiomatization. | |
948ed277 | 3507 | |
1a779058 AC |
3508 | -- The types in the wrapper profiles are obtained from (instances of) |
3509 | -- the types of the formal subprogram. | |
3510 | ||
948ed277 AC |
3511 | if Is_Actual |
3512 | and then GNATprove_Mode | |
a1954e97 | 3513 | and then Present (Containing_Package_With_Ext_Axioms (Formal_Spec)) |
948ed277 AC |
3514 | and then not Inside_A_Generic |
3515 | then | |
3516 | if Ekind (Old_S) = E_Function then | |
1a779058 | 3517 | Rewrite (N, Build_Function_Wrapper (Formal_Spec, Old_S)); |
948ed277 | 3518 | Analyze (N); |
fc6d9796 | 3519 | |
948ed277 | 3520 | elsif Ekind (Old_S) = E_Operator then |
fc6d9796 | 3521 | Rewrite (N, Build_Operator_Wrapper (Formal_Spec, Old_S)); |
948ed277 AC |
3522 | Analyze (N); |
3523 | end if; | |
3524 | end if; | |
996ae0b0 RK |
3525 | end Analyze_Subprogram_Renaming; |
3526 | ||
3527 | ------------------------- | |
3528 | -- Analyze_Use_Package -- | |
3529 | ------------------------- | |
3530 | ||
3531 | -- Resolve the package names in the use clause, and make all the visible | |
3532 | -- entities defined in the package potentially use-visible. If the package | |
3533 | -- is already in use from a previous use clause, its visible entities are | |
3534 | -- already use-visible. In that case, mark the occurrence as a redundant | |
3535 | -- use. If the package is an open scope, i.e. if the use clause occurs | |
3536 | -- within the package itself, ignore it. | |
3537 | ||
3538 | procedure Analyze_Use_Package (N : Node_Id) is | |
3539 | Pack_Name : Node_Id; | |
3540 | Pack : Entity_Id; | |
3541 | ||
996ae0b0 RK |
3542 | -- Start of processing for Analyze_Use_Package |
3543 | ||
3544 | begin | |
ce5ba43a | 3545 | Check_SPARK_05_Restriction ("use clause is not allowed", N); |
1d801f21 | 3546 | |
996ae0b0 RK |
3547 | Set_Hidden_By_Use_Clause (N, No_Elist); |
3548 | ||
7394c8cc AC |
3549 | -- Use clause not allowed in a spec of a predefined package declaration |
3550 | -- except that packages whose file name starts a-n are OK (these are | |
3551 | -- children of Ada.Numerics, which are never loaded by Rtsfind). | |
996ae0b0 RK |
3552 | |
3553 | if Is_Predefined_File_Name (Unit_File_Name (Current_Sem_Unit)) | |
3554 | and then Name_Buffer (1 .. 3) /= "a-n" | |
3555 | and then | |
3556 | Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Declaration | |
3557 | then | |
3558 | Error_Msg_N ("use clause not allowed in predefined spec", N); | |
3559 | end if; | |
3560 | ||
bc41faa2 | 3561 | -- Chain clause to list of use clauses in current scope |
996ae0b0 RK |
3562 | |
3563 | if Nkind (Parent (N)) /= N_Compilation_Unit then | |
3564 | Chain_Use_Clause (N); | |
3565 | end if; | |
3566 | ||
3567 | -- Loop through package names to identify referenced packages | |
3568 | ||
3569 | Pack_Name := First (Names (N)); | |
996ae0b0 RK |
3570 | while Present (Pack_Name) loop |
3571 | Analyze (Pack_Name); | |
3572 | ||
3573 | if Nkind (Parent (N)) = N_Compilation_Unit | |
3574 | and then Nkind (Pack_Name) = N_Expanded_Name | |
3575 | then | |
3576 | declare | |
16ca248a | 3577 | Pref : Node_Id; |
996ae0b0 RK |
3578 | |
3579 | begin | |
16ca248a | 3580 | Pref := Prefix (Pack_Name); |
996ae0b0 RK |
3581 | while Nkind (Pref) = N_Expanded_Name loop |
3582 | Pref := Prefix (Pref); | |
3583 | end loop; | |
3584 | ||
3585 | if Entity (Pref) = Standard_Standard then | |
3586 | Error_Msg_N | |
3587 | ("predefined package Standard cannot appear" | |
3588 | & " in a context clause", Pref); | |
3589 | end if; | |
3590 | end; | |
3591 | end if; | |
3592 | ||
3593 | Next (Pack_Name); | |
3594 | end loop; | |
3595 | ||
3596 | -- Loop through package names to mark all entities as potentially | |
3597 | -- use visible. | |
3598 | ||
3599 | Pack_Name := First (Names (N)); | |
996ae0b0 | 3600 | while Present (Pack_Name) loop |
996ae0b0 RK |
3601 | if Is_Entity_Name (Pack_Name) then |
3602 | Pack := Entity (Pack_Name); | |
3603 | ||
ac7d724d | 3604 | if Ekind (Pack) /= E_Package and then Etype (Pack) /= Any_Type then |
996ae0b0 | 3605 | if Ekind (Pack) = E_Generic_Package then |
483c78cb | 3606 | Error_Msg_N -- CODEFIX |
0566484a AC |
3607 | ("a generic package is not allowed in a use clause", |
3608 | Pack_Name); | |
3609 | ||
3610 | elsif Ekind_In (Pack, E_Generic_Function, E_Generic_Package) | |
3611 | then | |
3612 | Error_Msg_N -- CODEFIX | |
3613 | ("a generic subprogram is not allowed in a use clause", | |
3614 | Pack_Name); | |
3615 | ||
3616 | elsif Ekind_In (Pack, E_Function, E_Procedure, E_Operator) then | |
3617 | Error_Msg_N -- CODEFIX | |
3618 | ("a subprogram is not allowed in a use clause", | |
3619 | Pack_Name); | |
3620 | ||
996ae0b0 | 3621 | else |
0566484a | 3622 | Error_Msg_N ("& is not allowed in a use clause", Pack_Name); |
996ae0b0 RK |
3623 | end if; |
3624 | ||
fbf5a39b AC |
3625 | else |
3626 | if Nkind (Parent (N)) = N_Compilation_Unit then | |
3627 | Check_In_Previous_With_Clause (N, Pack_Name); | |
3628 | end if; | |
996ae0b0 | 3629 | |
fbf5a39b AC |
3630 | if Applicable_Use (Pack_Name) then |
3631 | Use_One_Package (Pack, N); | |
3632 | end if; | |
996ae0b0 | 3633 | end if; |
462c31ef ST |
3634 | |
3635 | -- Report error because name denotes something other than a package | |
3636 | ||
3637 | else | |
3638 | Error_Msg_N ("& is not a package", Pack_Name); | |
996ae0b0 RK |
3639 | end if; |
3640 | ||
3641 | Next (Pack_Name); | |
3642 | end loop; | |
996ae0b0 RK |
3643 | end Analyze_Use_Package; |
3644 | ||
3645 | ---------------------- | |
3646 | -- Analyze_Use_Type -- | |
3647 | ---------------------- | |
3648 | ||
3649 | procedure Analyze_Use_Type (N : Node_Id) is | |
954c111a | 3650 | E : Entity_Id; |
ecc4ddde | 3651 | Id : Node_Id; |
996ae0b0 RK |
3652 | |
3653 | begin | |
3654 | Set_Hidden_By_Use_Clause (N, No_Elist); | |
3655 | ||
bc41faa2 | 3656 | -- Chain clause to list of use clauses in current scope |
996ae0b0 RK |
3657 | |
3658 | if Nkind (Parent (N)) /= N_Compilation_Unit then | |
3659 | Chain_Use_Clause (N); | |
3660 | end if; | |
3661 | ||
780d052e RD |
3662 | -- If the Used_Operations list is already initialized, the clause has |
3663 | -- been analyzed previously, and it is begin reinstalled, for example | |
3664 | -- when the clause appears in a package spec and we are compiling the | |
3665 | -- corresponding package body. In that case, make the entities on the | |
806f6d37 | 3666 | -- existing list use_visible, and mark the corresponding types In_Use. |
29efbb8c | 3667 | |
780d052e | 3668 | if Present (Used_Operations (N)) then |
29efbb8c | 3669 | declare |
806f6d37 | 3670 | Mark : Node_Id; |
29efbb8c | 3671 | Elmt : Elmt_Id; |
806f6d37 | 3672 | |
29efbb8c | 3673 | begin |
806f6d37 AC |
3674 | Mark := First (Subtype_Marks (N)); |
3675 | while Present (Mark) loop | |
7ff2d234 | 3676 | Use_One_Type (Mark, Installed => True); |
806f6d37 AC |
3677 | Next (Mark); |
3678 | end loop; | |
3679 | ||
29efbb8c ES |
3680 | Elmt := First_Elmt (Used_Operations (N)); |
3681 | while Present (Elmt) loop | |
3682 | Set_Is_Potentially_Use_Visible (Node (Elmt)); | |
3683 | Next_Elmt (Elmt); | |
3684 | end loop; | |
3685 | end; | |
3686 | ||
3687 | return; | |
3688 | end if; | |
3689 | ||
780d052e RD |
3690 | -- Otherwise, create new list and attach to it the operations that |
3691 | -- are made use-visible by the clause. | |
3692 | ||
29efbb8c | 3693 | Set_Used_Operations (N, New_Elmt_List); |
996ae0b0 | 3694 | Id := First (Subtype_Marks (N)); |
996ae0b0 RK |
3695 | while Present (Id) loop |
3696 | Find_Type (Id); | |
954c111a | 3697 | E := Entity (Id); |
996ae0b0 | 3698 | |
954c111a | 3699 | if E /= Any_Type then |
07fc65c4 | 3700 | Use_One_Type (Id); |
fbf5a39b AC |
3701 | |
3702 | if Nkind (Parent (N)) = N_Compilation_Unit then | |
923fa078 | 3703 | if Nkind (Id) = N_Identifier then |
edd63e9b | 3704 | Error_Msg_N ("type is not directly visible", Id); |
fbf5a39b | 3705 | |
954c111a HK |
3706 | elsif Is_Child_Unit (Scope (E)) |
3707 | and then Scope (E) /= System_Aux_Id | |
fbf5a39b AC |
3708 | then |
3709 | Check_In_Previous_With_Clause (N, Prefix (Id)); | |
3710 | end if; | |
3711 | end if; | |
ecc4ddde AC |
3712 | |
3713 | else | |
4c8a5bb8 | 3714 | -- If the use_type_clause appears in a compilation unit context, |
ecc4ddde | 3715 | -- check whether it comes from a unit that may appear in a |
4c8a5bb8 | 3716 | -- limited_with_clause, for a better error message. |
ecc4ddde AC |
3717 | |
3718 | if Nkind (Parent (N)) = N_Compilation_Unit | |
3719 | and then Nkind (Id) /= N_Identifier | |
3720 | then | |
3721 | declare | |
3722 | Item : Node_Id; | |
3723 | Pref : Node_Id; | |
3724 | ||
3725 | function Mentioned (Nam : Node_Id) return Boolean; | |
4c8a5bb8 AC |
3726 | -- Check whether the prefix of expanded name for the type |
3727 | -- appears in the prefix of some limited_with_clause. | |
3728 | ||
3729 | --------------- | |
3730 | -- Mentioned -- | |
3731 | --------------- | |
ecc4ddde AC |
3732 | |
3733 | function Mentioned (Nam : Node_Id) return Boolean is | |
3734 | begin | |
4c8a5bb8 | 3735 | return Nkind (Name (Item)) = N_Selected_Component |
ac7d724d | 3736 | and then Chars (Prefix (Name (Item))) = Chars (Nam); |
ecc4ddde AC |
3737 | end Mentioned; |
3738 | ||
3739 | begin | |
3740 | Pref := Prefix (Id); | |
3741 | Item := First (Context_Items (Parent (N))); | |
4c8a5bb8 | 3742 | while Present (Item) and then Item /= N loop |
ecc4ddde AC |
3743 | if Nkind (Item) = N_With_Clause |
3744 | and then Limited_Present (Item) | |
3745 | and then Mentioned (Pref) | |
3746 | then | |
4c8a5bb8 AC |
3747 | Change_Error_Text |
3748 | (Get_Msg_Id, "premature usage of incomplete type"); | |
ecc4ddde AC |
3749 | end if; |
3750 | ||
3751 | Next (Item); | |
3752 | end loop; | |
3753 | end; | |
3754 | end if; | |
996ae0b0 RK |
3755 | end if; |
3756 | ||
3757 | Next (Id); | |
3758 | end loop; | |
3759 | end Analyze_Use_Type; | |
3760 | ||
3761 | -------------------- | |
3762 | -- Applicable_Use -- | |
3763 | -------------------- | |
3764 | ||
3765 | function Applicable_Use (Pack_Name : Node_Id) return Boolean is | |
3766 | Pack : constant Entity_Id := Entity (Pack_Name); | |
3767 | ||
3768 | begin | |
3769 | if In_Open_Scopes (Pack) then | |
ac7d724d | 3770 | if Warn_On_Redundant_Constructs and then Pack = Current_Scope then |
ed2233dc | 3771 | Error_Msg_NE -- CODEFIX |
dbfeb4fa | 3772 | ("& is already use-visible within itself?r?", Pack_Name, Pack); |
954c111a HK |
3773 | end if; |
3774 | ||
996ae0b0 RK |
3775 | return False; |
3776 | ||
3777 | elsif In_Use (Pack) then | |
d4810530 | 3778 | Note_Redundant_Use (Pack_Name); |
996ae0b0 RK |
3779 | return False; |
3780 | ||
3781 | elsif Present (Renamed_Object (Pack)) | |
3782 | and then In_Use (Renamed_Object (Pack)) | |
3783 | then | |
d4810530 | 3784 | Note_Redundant_Use (Pack_Name); |
996ae0b0 RK |
3785 | return False; |
3786 | ||
3787 | else | |
3788 | return True; | |
3789 | end if; | |
3790 | end Applicable_Use; | |
3791 | ||
3792 | ------------------------ | |
3793 | -- Attribute_Renaming -- | |
3794 | ------------------------ | |
3795 | ||
3796 | procedure Attribute_Renaming (N : Node_Id) is | |
8d80ff64 AC |
3797 | Loc : constant Source_Ptr := Sloc (N); |
3798 | Nam : constant Node_Id := Name (N); | |
3799 | Spec : constant Node_Id := Specification (N); | |
3800 | New_S : constant Entity_Id := Defining_Unit_Name (Spec); | |
3801 | Aname : constant Name_Id := Attribute_Name (Nam); | |
996ae0b0 | 3802 | |
8d80ff64 AC |
3803 | Form_Num : Nat := 0; |
3804 | Expr_List : List_Id := No_List; | |
996ae0b0 RK |
3805 | |
3806 | Attr_Node : Node_Id; | |
3807 | Body_Node : Node_Id; | |
3808 | Param_Spec : Node_Id; | |
3809 | ||
3810 | begin | |
3811 | Generate_Definition (New_S); | |
3812 | ||
4c8a5bb8 AC |
3813 | -- This procedure is called in the context of subprogram renaming, and |
3814 | -- thus the attribute must be one that is a subprogram. All of those | |
ba0c6e47 RD |
3815 | -- have at least one formal parameter, with the exceptions of the GNAT |
3816 | -- attribute 'Img, which GNAT treats as renameable. | |
996ae0b0 RK |
3817 | |
3818 | if not Is_Non_Empty_List (Parameter_Specifications (Spec)) then | |
ba0c6e47 | 3819 | if Aname /= Name_Img then |
996ae0b0 RK |
3820 | Error_Msg_N |
3821 | ("subprogram renaming an attribute must have formals", N); | |
3822 | return; | |
3823 | end if; | |
3824 | ||
3825 | else | |
3826 | Param_Spec := First (Parameter_Specifications (Spec)); | |
996ae0b0 RK |
3827 | while Present (Param_Spec) loop |
3828 | Form_Num := Form_Num + 1; | |
3829 | ||
3830 | if Nkind (Parameter_Type (Param_Spec)) /= N_Access_Definition then | |
3831 | Find_Type (Parameter_Type (Param_Spec)); | |
3832 | ||
3833 | -- The profile of the new entity denotes the base type (s) of | |
3834 | -- the types given in the specification. For access parameters | |
3835 | -- there are no subtypes involved. | |
3836 | ||
3837 | Rewrite (Parameter_Type (Param_Spec), | |
e4494292 | 3838 | New_Occurrence_Of |
8d80ff64 | 3839 | (Base_Type (Entity (Parameter_Type (Param_Spec))), Loc)); |
996ae0b0 RK |
3840 | end if; |
3841 | ||
3842 | if No (Expr_List) then | |
3843 | Expr_List := New_List; | |
3844 | end if; | |
3845 | ||
3846 | Append_To (Expr_List, | |
3847 | Make_Identifier (Loc, | |
3848 | Chars => Chars (Defining_Identifier (Param_Spec)))); | |
3849 | ||
fbf5a39b | 3850 | -- The expressions in the attribute reference are not freeze |
4c8a5bb8 | 3851 | -- points. Neither is the attribute as a whole, see below. |
fbf5a39b AC |
3852 | |
3853 | Set_Must_Not_Freeze (Last (Expr_List)); | |
996ae0b0 RK |
3854 | Next (Param_Spec); |
3855 | end loop; | |
3856 | end if; | |
3857 | ||
4c8a5bb8 AC |
3858 | -- Immediate error if too many formals. Other mismatches in number or |
3859 | -- types of parameters are detected when we analyze the body of the | |
3860 | -- subprogram that we construct. | |
996ae0b0 RK |
3861 | |
3862 | if Form_Num > 2 then | |
3863 | Error_Msg_N ("too many formals for attribute", N); | |
3864 | ||
4c8a5bb8 AC |
3865 | -- Error if the attribute reference has expressions that look like |
3866 | -- formal parameters. | |
0da2c8ac AC |
3867 | |
3868 | elsif Present (Expressions (Nam)) then | |
3869 | Error_Msg_N ("illegal expressions in attribute reference", Nam); | |
3870 | ||
996ae0b0 | 3871 | elsif |
b69cd36a AC |
3872 | Nam_In (Aname, Name_Compose, Name_Exponent, Name_Leading_Part, |
3873 | Name_Pos, Name_Round, Name_Scaling, | |
3874 | Name_Val) | |
996ae0b0 RK |
3875 | then |
3876 | if Nkind (N) = N_Subprogram_Renaming_Declaration | |
82c80734 | 3877 | and then Present (Corresponding_Formal_Spec (N)) |
996ae0b0 RK |
3878 | then |
3879 | Error_Msg_N | |
3880 | ("generic actual cannot be attribute involving universal type", | |
3881 | Nam); | |
3882 | else | |
3883 | Error_Msg_N | |
3884 | ("attribute involving a universal type cannot be renamed", | |
3885 | Nam); | |
3886 | end if; | |
3887 | end if; | |
3888 | ||
ba0c6e47 RD |
3889 | -- Rewrite attribute node to have a list of expressions corresponding to |
3890 | -- the subprogram formals. A renaming declaration is not a freeze point, | |
3891 | -- and the analysis of the attribute reference should not freeze the | |
3892 | -- type of the prefix. We use the original node in the renaming so that | |
3893 | -- its source location is preserved, and checks on stream attributes are | |
3894 | -- properly applied. | |
996ae0b0 | 3895 | |
ba0c6e47 RD |
3896 | Attr_Node := Relocate_Node (Nam); |
3897 | Set_Expressions (Attr_Node, Expr_List); | |
996ae0b0 | 3898 | |
ba0c6e47 RD |
3899 | Set_Must_Not_Freeze (Attr_Node); |
3900 | Set_Must_Not_Freeze (Prefix (Nam)); | |
996ae0b0 RK |
3901 | |
3902 | -- Case of renaming a function | |
3903 | ||
3904 | if Nkind (Spec) = N_Function_Specification then | |
996ae0b0 RK |
3905 | if Is_Procedure_Attribute_Name (Aname) then |
3906 | Error_Msg_N ("attribute can only be renamed as procedure", Nam); | |
3907 | return; | |
3908 | end if; | |
3909 | ||
725393ea ES |
3910 | Find_Type (Result_Definition (Spec)); |
3911 | Rewrite (Result_Definition (Spec), | |
e4494292 | 3912 | New_Occurrence_Of |
4bcf6815 | 3913 | (Base_Type (Entity (Result_Definition (Spec))), Loc)); |
996ae0b0 RK |
3914 | |
3915 | Body_Node := | |
3916 | Make_Subprogram_Body (Loc, | |
3917 | Specification => Spec, | |
3918 | Declarations => New_List, | |
3919 | Handled_Statement_Sequence => | |
3920 | Make_Handled_Sequence_Of_Statements (Loc, | |
3921 | Statements => New_List ( | |
11560bcc | 3922 | Make_Simple_Return_Statement (Loc, |
996ae0b0 RK |
3923 | Expression => Attr_Node)))); |
3924 | ||
3925 | -- Case of renaming a procedure | |
3926 | ||
3927 | else | |
3928 | if not Is_Procedure_Attribute_Name (Aname) then | |
3929 | Error_Msg_N ("attribute can only be renamed as function", Nam); | |
3930 | return; | |
3931 | end if; | |
3932 | ||
3933 | Body_Node := | |
3934 | Make_Subprogram_Body (Loc, | |
3935 | Specification => Spec, | |
3936 | Declarations => New_List, | |
3937 | Handled_Statement_Sequence => | |
3938 | Make_Handled_Sequence_Of_Statements (Loc, | |
3939 | Statements => New_List (Attr_Node))); | |
3940 | end if; | |
3941 | ||
fbe627af RD |
3942 | -- In case of tagged types we add the body of the generated function to |
3943 | -- the freezing actions of the type (because in the general case such | |
3944 | -- type is still not frozen). We exclude from this processing generic | |
ba0c6e47 | 3945 | -- formal subprograms found in instantiations. |
fbe627af | 3946 | |
6b81741c AC |
3947 | -- We must exclude VM targets and restricted run-time libraries because |
3948 | -- entity AST_Handler is defined in package System.Aux_Dec which is not | |
9d1e0e72 JR |
3949 | -- available in those platforms. Note that we cannot use the function |
3950 | -- Restricted_Profile (instead of Configurable_Run_Time_Mode) because | |
3951 | -- the ZFP run-time library is not defined as a profile, and we do not | |
3952 | -- want to deal with AST_Handler in ZFP mode. | |
ddc1515a AC |
3953 | |
3954 | if VM_Target = No_VM | |
9d1e0e72 | 3955 | and then not Configurable_Run_Time_Mode |
ddc1515a | 3956 | and then not Present (Corresponding_Formal_Spec (N)) |
fbe627af RD |
3957 | and then Etype (Nam) /= RTE (RE_AST_Handler) |
3958 | then | |
3959 | declare | |
a530b8bb | 3960 | P : constant Node_Id := Prefix (Nam); |
fbe627af RD |
3961 | |
3962 | begin | |
8d80ff64 AC |
3963 | -- The prefix of 'Img is an object that is evaluated for each call |
3964 | -- of the function that renames it. | |
a530b8bb AC |
3965 | |
3966 | if Aname = Name_Img then | |
3967 | Preanalyze_And_Resolve (P); | |
3968 | ||
8d80ff64 | 3969 | -- For all other attribute renamings, the prefix is a subtype |
a530b8bb AC |
3970 | |
3971 | else | |
3972 | Find_Type (P); | |
3973 | end if; | |
fbe627af | 3974 | |
4bcf6815 AC |
3975 | -- If the target type is not yet frozen, add the body to the |
3976 | -- actions to be elaborated at freeze time. | |
3977 | ||
3978 | if Is_Tagged_Type (Etype (P)) | |
3979 | and then In_Open_Scopes (Scope (Etype (P))) | |
3980 | then | |
fbe627af RD |
3981 | Ensure_Freeze_Node (Etype (P)); |
3982 | Append_Freeze_Action (Etype (P), Body_Node); | |
3983 | else | |
3984 | Rewrite (N, Body_Node); | |
3985 | Analyze (N); | |
3986 | Set_Etype (New_S, Base_Type (Etype (New_S))); | |
3987 | end if; | |
3988 | end; | |
3989 | ||
3990 | -- Generic formal subprograms or AST_Handler renaming | |
3991 | ||
3992 | else | |
3993 | Rewrite (N, Body_Node); | |
3994 | Analyze (N); | |
3995 | Set_Etype (New_S, Base_Type (Etype (New_S))); | |
3996 | end if; | |
996ae0b0 | 3997 | |
615cbd95 AC |
3998 | if Is_Compilation_Unit (New_S) then |
3999 | Error_Msg_N | |
4000 | ("a library unit can only rename another library unit", N); | |
4001 | end if; | |
4002 | ||
996ae0b0 RK |
4003 | -- We suppress elaboration warnings for the resulting entity, since |
4004 | -- clearly they are not needed, and more particularly, in the case | |
4005 | -- of a generic formal subprogram, the resulting entity can appear | |
4006 | -- after the instantiation itself, and thus look like a bogus case | |
4007 | -- of access before elaboration. | |
4008 | ||
4009 | Set_Suppress_Elaboration_Warnings (New_S); | |
4010 | ||
4011 | end Attribute_Renaming; | |
4012 | ||
4013 | ---------------------- | |
4014 | -- Chain_Use_Clause -- | |
4015 | ---------------------- | |
4016 | ||
4017 | procedure Chain_Use_Clause (N : Node_Id) is | |
d4810530 ES |
4018 | Pack : Entity_Id; |
4019 | Level : Int := Scope_Stack.Last; | |
4020 | ||
996ae0b0 | 4021 | begin |
d4810530 ES |
4022 | if not Is_Compilation_Unit (Current_Scope) |
4023 | or else not Is_Child_Unit (Current_Scope) | |
4024 | then | |
4025 | null; -- Common case | |
4026 | ||
4027 | elsif Defining_Entity (Parent (N)) = Current_Scope then | |
4028 | null; -- Common case for compilation unit | |
4029 | ||
4030 | else | |
4031 | -- If declaration appears in some other scope, it must be in some | |
4032 | -- parent unit when compiling a child. | |
4033 | ||
4034 | Pack := Defining_Entity (Parent (N)); | |
4035 | if not In_Open_Scopes (Pack) then | |
4036 | null; -- default as well | |
4037 | ||
3830827c AC |
4038 | -- If the use clause appears in an ancestor and we are in the |
4039 | -- private part of the immediate parent, the use clauses are | |
4040 | -- already installed. | |
4041 | ||
4042 | elsif Pack /= Scope (Current_Scope) | |
4043 | and then In_Private_Part (Scope (Current_Scope)) | |
4044 | then | |
4045 | null; | |
4046 | ||
d4810530 ES |
4047 | else |
4048 | -- Find entry for parent unit in scope stack | |
4049 | ||
4050 | while Scope_Stack.Table (Level).Entity /= Pack loop | |
4051 | Level := Level - 1; | |
4052 | end loop; | |
4053 | end if; | |
4054 | end if; | |
4055 | ||
996ae0b0 | 4056 | Set_Next_Use_Clause (N, |
d4810530 ES |
4057 | Scope_Stack.Table (Level).First_Use_Clause); |
4058 | Scope_Stack.Table (Level).First_Use_Clause := N; | |
996ae0b0 RK |
4059 | end Chain_Use_Clause; |
4060 | ||
15ce9ca2 AC |
4061 | --------------------------- |
4062 | -- Check_Frozen_Renaming -- | |
4063 | --------------------------- | |
996ae0b0 RK |
4064 | |
4065 | procedure Check_Frozen_Renaming (N : Node_Id; Subp : Entity_Id) is | |
4066 | B_Node : Node_Id; | |
4067 | Old_S : Entity_Id; | |
4068 | ||
4069 | begin | |
ac7d724d | 4070 | if Is_Frozen (Subp) and then not Has_Completion (Subp) then |
996ae0b0 RK |
4071 | B_Node := |
4072 | Build_Renamed_Body | |
4073 | (Parent (Declaration_Node (Subp)), Defining_Entity (N)); | |
4074 | ||
4075 | if Is_Entity_Name (Name (N)) then | |
4076 | Old_S := Entity (Name (N)); | |
4077 | ||
fbf5a39b AC |
4078 | if not Is_Frozen (Old_S) |
4079 | and then Operating_Mode /= Check_Semantics | |
4080 | then | |
4081 | Append_Freeze_Action (Old_S, B_Node); | |
996ae0b0 RK |
4082 | else |
4083 | Insert_After (N, B_Node); | |
4084 | Analyze (B_Node); | |
4085 | end if; | |
4086 | ||
ac7d724d | 4087 | if Is_Intrinsic_Subprogram (Old_S) and then not In_Instance then |
996ae0b0 RK |
4088 | Error_Msg_N |
4089 | ("subprogram used in renaming_as_body cannot be intrinsic", | |
ac7d724d | 4090 | Name (N)); |
996ae0b0 RK |
4091 | end if; |
4092 | ||
4093 | else | |
4094 | Insert_After (N, B_Node); | |
4095 | Analyze (B_Node); | |
4096 | end if; | |
4097 | end if; | |
4098 | end Check_Frozen_Renaming; | |
4099 | ||
4c484f40 AC |
4100 | ------------------------------- |
4101 | -- Set_Entity_Or_Discriminal -- | |
4102 | ------------------------------- | |
4103 | ||
4104 | procedure Set_Entity_Or_Discriminal (N : Node_Id; E : Entity_Id) is | |
4105 | P : Node_Id; | |
4106 | ||
4107 | begin | |
4108 | -- If the entity is not a discriminant, or else expansion is disabled, | |
4109 | -- simply set the entity. | |
4110 | ||
4111 | if not In_Spec_Expression | |
4112 | or else Ekind (E) /= E_Discriminant | |
4113 | or else Inside_A_Generic | |
4114 | then | |
e7ba564f | 4115 | Set_Entity_With_Checks (N, E); |
4c484f40 AC |
4116 | |
4117 | -- The replacement of a discriminant by the corresponding discriminal | |
4118 | -- is not done for a task discriminant that appears in a default | |
8779dffa | 4119 | -- expression of an entry parameter. See Exp_Ch2.Expand_Discriminant |
4c484f40 AC |
4120 | -- for details on their handling. |
4121 | ||
4122 | elsif Is_Concurrent_Type (Scope (E)) then | |
4c484f40 AC |
4123 | P := Parent (N); |
4124 | while Present (P) | |
4125 | and then not Nkind_In (P, N_Parameter_Specification, | |
ac7d724d | 4126 | N_Component_Declaration) |
4c484f40 AC |
4127 | loop |
4128 | P := Parent (P); | |
4129 | end loop; | |
4130 | ||
4131 | if Present (P) | |
4132 | and then Nkind (P) = N_Parameter_Specification | |
4133 | then | |
4134 | null; | |
4135 | ||
4136 | else | |
4137 | Set_Entity (N, Discriminal (E)); | |
4138 | end if; | |
4139 | ||
4140 | -- Otherwise, this is a discriminant in a context in which | |
4141 | -- it is a reference to the corresponding parameter of the | |
4142 | -- init proc for the enclosing type. | |
4143 | ||
4144 | else | |
4145 | Set_Entity (N, Discriminal (E)); | |
4146 | end if; | |
4147 | end Set_Entity_Or_Discriminal; | |
4148 | ||
fbf5a39b AC |
4149 | ----------------------------------- |
4150 | -- Check_In_Previous_With_Clause -- | |
4151 | ----------------------------------- | |
4152 | ||
4153 | procedure Check_In_Previous_With_Clause | |
4154 | (N : Node_Id; | |
4155 | Nam : Entity_Id) | |
4156 | is | |
4157 | Pack : constant Entity_Id := Entity (Original_Node (Nam)); | |
4158 | Item : Node_Id; | |
4159 | Par : Node_Id; | |
4160 | ||
4161 | begin | |
4162 | Item := First (Context_Items (Parent (N))); | |
ac7d724d | 4163 | while Present (Item) and then Item /= N loop |
fbf5a39b | 4164 | if Nkind (Item) = N_With_Clause |
edd63e9b | 4165 | |
ac7d724d | 4166 | -- Protect the frontend against previous critical errors |
edd63e9b ES |
4167 | |
4168 | and then Nkind (Name (Item)) /= N_Selected_Component | |
fbf5a39b AC |
4169 | and then Entity (Name (Item)) = Pack |
4170 | then | |
4171 | Par := Nam; | |
4172 | ||
bc41faa2 | 4173 | -- Find root library unit in with_clause |
fbf5a39b AC |
4174 | |
4175 | while Nkind (Par) = N_Expanded_Name loop | |
4176 | Par := Prefix (Par); | |
4177 | end loop; | |
4178 | ||
4179 | if Is_Child_Unit (Entity (Original_Node (Par))) then | |
ed2233dc | 4180 | Error_Msg_NE ("& is not directly visible", Par, Entity (Par)); |
fbf5a39b AC |
4181 | else |
4182 | return; | |
4183 | end if; | |
4184 | end if; | |
4185 | ||
4186 | Next (Item); | |
4187 | end loop; | |
4188 | ||
4189 | -- On exit, package is not mentioned in a previous with_clause. | |
4190 | -- Check if its prefix is. | |
4191 | ||
4192 | if Nkind (Nam) = N_Expanded_Name then | |
4193 | Check_In_Previous_With_Clause (N, Prefix (Nam)); | |
4194 | ||
4195 | elsif Pack /= Any_Id then | |
4196 | Error_Msg_NE ("& is not visible", Nam, Pack); | |
4197 | end if; | |
4198 | end Check_In_Previous_With_Clause; | |
4199 | ||
996ae0b0 RK |
4200 | --------------------------------- |
4201 | -- Check_Library_Unit_Renaming -- | |
4202 | --------------------------------- | |
4203 | ||
4204 | procedure Check_Library_Unit_Renaming (N : Node_Id; Old_E : Entity_Id) is | |
4205 | New_E : Entity_Id; | |
4206 | ||
4207 | begin | |
4208 | if Nkind (Parent (N)) /= N_Compilation_Unit then | |
4209 | return; | |
4210 | ||
fbe627af RD |
4211 | -- Check for library unit. Note that we used to check for the scope |
4212 | -- being Standard here, but that was wrong for Standard itself. | |
4213 | ||
4214 | elsif not Is_Compilation_Unit (Old_E) | |
996ae0b0 RK |
4215 | and then not Is_Child_Unit (Old_E) |
4216 | then | |
4217 | Error_Msg_N ("renamed unit must be a library unit", Name (N)); | |
4218 | ||
615cbd95 AC |
4219 | -- Entities defined in Standard (operators and boolean literals) cannot |
4220 | -- be renamed as library units. | |
4221 | ||
4222 | elsif Scope (Old_E) = Standard_Standard | |
4223 | and then Sloc (Old_E) = Standard_Location | |
4224 | then | |
4225 | Error_Msg_N ("renamed unit must be a library unit", Name (N)); | |
4226 | ||
996ae0b0 RK |
4227 | elsif Present (Parent_Spec (N)) |
4228 | and then Nkind (Unit (Parent_Spec (N))) = N_Generic_Package_Declaration | |
4229 | and then not Is_Child_Unit (Old_E) | |
4230 | then | |
4231 | Error_Msg_N | |
4232 | ("renamed unit must be a child unit of generic parent", Name (N)); | |
4233 | ||
4234 | elsif Nkind (N) in N_Generic_Renaming_Declaration | |
ac7d724d ES |
4235 | and then Nkind (Name (N)) = N_Expanded_Name |
4236 | and then Is_Generic_Instance (Entity (Prefix (Name (N)))) | |
4237 | and then Is_Generic_Unit (Old_E) | |
996ae0b0 RK |
4238 | then |
4239 | Error_Msg_N | |
4240 | ("renamed generic unit must be a library unit", Name (N)); | |
4241 | ||
b9b2405f ST |
4242 | elsif Is_Package_Or_Generic_Package (Old_E) then |
4243 | ||
996ae0b0 RK |
4244 | -- Inherit categorization flags |
4245 | ||
4246 | New_E := Defining_Entity (N); | |
4247 | Set_Is_Pure (New_E, Is_Pure (Old_E)); | |
4248 | Set_Is_Preelaborated (New_E, Is_Preelaborated (Old_E)); | |
4249 | Set_Is_Remote_Call_Interface (New_E, | |
4250 | Is_Remote_Call_Interface (Old_E)); | |
4251 | Set_Is_Remote_Types (New_E, Is_Remote_Types (Old_E)); | |
4252 | Set_Is_Shared_Passive (New_E, Is_Shared_Passive (Old_E)); | |
4253 | end if; | |
4254 | end Check_Library_Unit_Renaming; | |
4255 | ||
ac7d724d ES |
4256 | ------------------------ |
4257 | -- Enclosing_Instance -- | |
4258 | ------------------------ | |
4259 | ||
4260 | function Enclosing_Instance return Entity_Id is | |
4261 | S : Entity_Id; | |
4262 | ||
4263 | begin | |
4264 | if not Is_Generic_Instance (Current_Scope) then | |
4265 | return Empty; | |
4266 | end if; | |
4267 | ||
4268 | S := Scope (Current_Scope); | |
4269 | while S /= Standard_Standard loop | |
4270 | if Is_Generic_Instance (S) then | |
4271 | return S; | |
4272 | end if; | |
4273 | ||
4274 | S := Scope (S); | |
4275 | end loop; | |
4276 | ||
4277 | return Empty; | |
4278 | end Enclosing_Instance; | |
4279 | ||
996ae0b0 RK |
4280 | --------------- |
4281 | -- End_Scope -- | |
4282 | --------------- | |
4283 | ||
4284 | procedure End_Scope is | |
4285 | Id : Entity_Id; | |
4286 | Prev : Entity_Id; | |
4287 | Outer : Entity_Id; | |
4288 | ||
4289 | begin | |
4290 | Id := First_Entity (Current_Scope); | |
996ae0b0 RK |
4291 | while Present (Id) loop |
4292 | -- An entity in the current scope is not necessarily the first one | |
4293 | -- on its homonym chain. Find its predecessor if any, | |
4294 | -- If it is an internal entity, it will not be in the visibility | |
4295 | -- chain altogether, and there is nothing to unchain. | |
4296 | ||
4297 | if Id /= Current_Entity (Id) then | |
4298 | Prev := Current_Entity (Id); | |
4299 | while Present (Prev) | |
4300 | and then Present (Homonym (Prev)) | |
4301 | and then Homonym (Prev) /= Id | |
4302 | loop | |
4303 | Prev := Homonym (Prev); | |
4304 | end loop; | |
4305 | ||
4306 | -- Skip to end of loop if Id is not in the visibility chain | |
4307 | ||
4308 | if No (Prev) or else Homonym (Prev) /= Id then | |
4309 | goto Next_Ent; | |
4310 | end if; | |
4311 | ||
4312 | else | |
4313 | Prev := Empty; | |
4314 | end if; | |
4315 | ||
996ae0b0 RK |
4316 | Set_Is_Immediately_Visible (Id, False); |
4317 | ||
16ca248a | 4318 | Outer := Homonym (Id); |
996ae0b0 RK |
4319 | while Present (Outer) and then Scope (Outer) = Current_Scope loop |
4320 | Outer := Homonym (Outer); | |
4321 | end loop; | |
4322 | ||
4323 | -- Reset homonym link of other entities, but do not modify link | |
4324 | -- between entities in current scope, so that the back-end can have | |
4325 | -- a proper count of local overloadings. | |
4326 | ||
4327 | if No (Prev) then | |
4328 | Set_Name_Entity_Id (Chars (Id), Outer); | |
4329 | ||
4330 | elsif Scope (Prev) /= Scope (Id) then | |
4331 | Set_Homonym (Prev, Outer); | |
4332 | end if; | |
4333 | ||
4334 | <<Next_Ent>> | |
4335 | Next_Entity (Id); | |
4336 | end loop; | |
4337 | ||
4338 | -- If the scope generated freeze actions, place them before the | |
4339 | -- current declaration and analyze them. Type declarations and | |
4340 | -- the bodies of initialization procedures can generate such nodes. | |
4341 | -- We follow the parent chain until we reach a list node, which is | |
4342 | -- the enclosing list of declarations. If the list appears within | |
4343 | -- a protected definition, move freeze nodes outside the protected | |
4344 | -- type altogether. | |
4345 | ||
4346 | if Present | |
4347 | (Scope_Stack.Table (Scope_Stack.Last).Pending_Freeze_Actions) | |
4348 | then | |
4349 | declare | |
4350 | Decl : Node_Id; | |
4351 | L : constant List_Id := Scope_Stack.Table | |
4352 | (Scope_Stack.Last).Pending_Freeze_Actions; | |
4353 | ||
4354 | begin | |
4355 | if Is_Itype (Current_Scope) then | |
4356 | Decl := Associated_Node_For_Itype (Current_Scope); | |
4357 | else | |
4358 | Decl := Parent (Current_Scope); | |
4359 | end if; | |
4360 | ||
4361 | Pop_Scope; | |
4362 | ||
4363 | while not (Is_List_Member (Decl)) | |
294ccb21 RD |
4364 | or else Nkind_In (Parent (Decl), N_Protected_Definition, |
4365 | N_Task_Definition) | |
996ae0b0 RK |
4366 | loop |
4367 | Decl := Parent (Decl); | |
4368 | end loop; | |
4369 | ||
4370 | Insert_List_Before_And_Analyze (Decl, L); | |
4371 | end; | |
4372 | ||
4373 | else | |
4374 | Pop_Scope; | |
4375 | end if; | |
996ae0b0 RK |
4376 | end End_Scope; |
4377 | ||
4378 | --------------------- | |
4379 | -- End_Use_Clauses -- | |
4380 | --------------------- | |
4381 | ||
4382 | procedure End_Use_Clauses (Clause : Node_Id) is | |
fbf5a39b | 4383 | U : Node_Id; |
996ae0b0 RK |
4384 | |
4385 | begin | |
fbf5a39b AC |
4386 | -- Remove Use_Type clauses first, because they affect the |
4387 | -- visibility of operators in subsequent used packages. | |
4388 | ||
4389 | U := Clause; | |
4390 | while Present (U) loop | |
4391 | if Nkind (U) = N_Use_Type_Clause then | |
4392 | End_Use_Type (U); | |
4393 | end if; | |
4394 | ||
4395 | Next_Use_Clause (U); | |
4396 | end loop; | |
4397 | ||
4398 | U := Clause; | |
996ae0b0 RK |
4399 | while Present (U) loop |
4400 | if Nkind (U) = N_Use_Package_Clause then | |
4401 | End_Use_Package (U); | |
996ae0b0 RK |
4402 | end if; |
4403 | ||
4404 | Next_Use_Clause (U); | |
4405 | end loop; | |
4406 | end End_Use_Clauses; | |
4407 | ||
4408 | --------------------- | |
4409 | -- End_Use_Package -- | |
4410 | --------------------- | |
4411 | ||
4412 | procedure End_Use_Package (N : Node_Id) is | |
4413 | Pack_Name : Node_Id; | |
4414 | Pack : Entity_Id; | |
4415 | Id : Entity_Id; | |
4416 | Elmt : Elmt_Id; | |
4417 | ||
a780db15 | 4418 | function Is_Primitive_Operator_In_Use |
2e071734 AC |
4419 | (Op : Entity_Id; |
4420 | F : Entity_Id) return Boolean; | |
fbf5a39b AC |
4421 | -- Check whether Op is a primitive operator of a use-visible type |
4422 | ||
a780db15 AC |
4423 | ---------------------------------- |
4424 | -- Is_Primitive_Operator_In_Use -- | |
4425 | ---------------------------------- | |
fbf5a39b | 4426 | |
a780db15 | 4427 | function Is_Primitive_Operator_In_Use |
2e071734 AC |
4428 | (Op : Entity_Id; |
4429 | F : Entity_Id) return Boolean | |
fbf5a39b | 4430 | is |
95eb8b69 | 4431 | T : constant Entity_Id := Base_Type (Etype (F)); |
fbf5a39b | 4432 | begin |
95eb8b69 | 4433 | return In_Use (T) and then Scope (T) = Scope (Op); |
a780db15 | 4434 | end Is_Primitive_Operator_In_Use; |
fbf5a39b AC |
4435 | |
4436 | -- Start of processing for End_Use_Package | |
4437 | ||
996ae0b0 RK |
4438 | begin |
4439 | Pack_Name := First (Names (N)); | |
996ae0b0 | 4440 | while Present (Pack_Name) loop |
996ae0b0 | 4441 | |
462c31ef ST |
4442 | -- Test that Pack_Name actually denotes a package before processing |
4443 | ||
4444 | if Is_Entity_Name (Pack_Name) | |
4445 | and then Ekind (Entity (Pack_Name)) = E_Package | |
4446 | then | |
4447 | Pack := Entity (Pack_Name); | |
4448 | ||
996ae0b0 RK |
4449 | if In_Open_Scopes (Pack) then |
4450 | null; | |
4451 | ||
4452 | elsif not Redundant_Use (Pack_Name) then | |
4453 | Set_In_Use (Pack, False); | |
d4810530 | 4454 | Set_Current_Use_Clause (Pack, Empty); |
996ae0b0 | 4455 | |
16ca248a | 4456 | Id := First_Entity (Pack); |
996ae0b0 RK |
4457 | while Present (Id) loop |
4458 | ||
fbf5a39b | 4459 | -- Preserve use-visibility of operators that are primitive |
954c111a | 4460 | -- operators of a type that is use-visible through an active |
fbf5a39b | 4461 | -- use_type clause. |
996ae0b0 RK |
4462 | |
4463 | if Nkind (Id) = N_Defining_Operator_Symbol | |
4464 | and then | |
ac7d724d ES |
4465 | (Is_Primitive_Operator_In_Use (Id, First_Formal (Id)) |
4466 | or else | |
4467 | (Present (Next_Formal (First_Formal (Id))) | |
4468 | and then | |
4469 | Is_Primitive_Operator_In_Use | |
4470 | (Id, Next_Formal (First_Formal (Id))))) | |
996ae0b0 RK |
4471 | then |
4472 | null; | |
996ae0b0 RK |
4473 | else |
4474 | Set_Is_Potentially_Use_Visible (Id, False); | |
4475 | end if; | |
4476 | ||
4477 | if Is_Private_Type (Id) | |
4478 | and then Present (Full_View (Id)) | |
4479 | then | |
4480 | Set_Is_Potentially_Use_Visible (Full_View (Id), False); | |
4481 | end if; | |
4482 | ||
4483 | Next_Entity (Id); | |
4484 | end loop; | |
4485 | ||
4486 | if Present (Renamed_Object (Pack)) then | |
4487 | Set_In_Use (Renamed_Object (Pack), False); | |
d4810530 | 4488 | Set_Current_Use_Clause (Renamed_Object (Pack), Empty); |
996ae0b0 RK |
4489 | end if; |
4490 | ||
4491 | if Chars (Pack) = Name_System | |
4492 | and then Scope (Pack) = Standard_Standard | |
4493 | and then Present_System_Aux | |
4494 | then | |
4495 | Id := First_Entity (System_Aux_Id); | |
996ae0b0 RK |
4496 | while Present (Id) loop |
4497 | Set_Is_Potentially_Use_Visible (Id, False); | |
4498 | ||
4499 | if Is_Private_Type (Id) | |
4500 | and then Present (Full_View (Id)) | |
4501 | then | |
4502 | Set_Is_Potentially_Use_Visible (Full_View (Id), False); | |
4503 | end if; | |
4504 | ||
4505 | Next_Entity (Id); | |
4506 | end loop; | |
4507 | ||
4508 | Set_In_Use (System_Aux_Id, False); | |
4509 | end if; | |
4510 | ||
4511 | else | |
4512 | Set_Redundant_Use (Pack_Name, False); | |
4513 | end if; | |
996ae0b0 RK |
4514 | end if; |
4515 | ||
4516 | Next (Pack_Name); | |
4517 | end loop; | |
4518 | ||
4519 | if Present (Hidden_By_Use_Clause (N)) then | |
4520 | Elmt := First_Elmt (Hidden_By_Use_Clause (N)); | |
996ae0b0 | 4521 | while Present (Elmt) loop |
e69614ad AC |
4522 | declare |
4523 | E : constant Entity_Id := Node (Elmt); | |
4524 | ||
4525 | begin | |
4526 | -- Reset either Use_Visibility or Direct_Visibility, depending | |
4527 | -- on how the entity was hidden by the use clause. | |
4528 | ||
4529 | if In_Use (Scope (E)) | |
4530 | and then Used_As_Generic_Actual (Scope (E)) | |
4531 | then | |
4532 | Set_Is_Potentially_Use_Visible (Node (Elmt)); | |
4533 | else | |
4534 | Set_Is_Immediately_Visible (Node (Elmt)); | |
4535 | end if; | |
4536 | ||
4537 | Next_Elmt (Elmt); | |
4538 | end; | |
996ae0b0 RK |
4539 | end loop; |
4540 | ||
4541 | Set_Hidden_By_Use_Clause (N, No_Elist); | |
4542 | end if; | |
4543 | end End_Use_Package; | |
4544 | ||
4545 | ------------------ | |
4546 | -- End_Use_Type -- | |
4547 | ------------------ | |
4548 | ||
4549 | procedure End_Use_Type (N : Node_Id) is | |
4a214958 | 4550 | Elmt : Elmt_Id; |
996ae0b0 | 4551 | Id : Entity_Id; |
996ae0b0 RK |
4552 | T : Entity_Id; |
4553 | ||
4a214958 AC |
4554 | -- Start of processing for End_Use_Type |
4555 | ||
996ae0b0 RK |
4556 | begin |
4557 | Id := First (Subtype_Marks (N)); | |
996ae0b0 | 4558 | while Present (Id) loop |
fbf5a39b | 4559 | |
4a214958 | 4560 | -- A call to Rtsfind may occur while analyzing a use_type clause, |
fbf5a39b AC |
4561 | -- in which case the type marks are not resolved yet, and there is |
4562 | -- nothing to remove. | |
4563 | ||
4a214958 | 4564 | if not Is_Entity_Name (Id) or else No (Entity (Id)) then |
fbf5a39b AC |
4565 | goto Continue; |
4566 | end if; | |
4567 | ||
996ae0b0 RK |
4568 | T := Entity (Id); |
4569 | ||
7b56a91b | 4570 | if T = Any_Type or else From_Limited_With (T) then |
996ae0b0 RK |
4571 | null; |
4572 | ||
4a214958 | 4573 | -- Note that the use_type clause may mention a subtype of the type |
16ca248a ES |
4574 | -- whose primitive operations have been made visible. Here as |
4575 | -- elsewhere, it is the base type that matters for visibility. | |
996ae0b0 RK |
4576 | |
4577 | elsif In_Open_Scopes (Scope (Base_Type (T))) then | |
4578 | null; | |
4579 | ||
4580 | elsif not Redundant_Use (Id) then | |
4581 | Set_In_Use (T, False); | |
4582 | Set_In_Use (Base_Type (T), False); | |
21d27997 RD |
4583 | Set_Current_Use_Clause (T, Empty); |
4584 | Set_Current_Use_Clause (Base_Type (T), Empty); | |
996ae0b0 RK |
4585 | end if; |
4586 | ||
fbf5a39b | 4587 | <<Continue>> |
29efbb8c | 4588 | Next (Id); |
996ae0b0 | 4589 | end loop; |
29efbb8c ES |
4590 | |
4591 | if Is_Empty_Elmt_List (Used_Operations (N)) then | |
4592 | return; | |
4593 | ||
4594 | else | |
4595 | Elmt := First_Elmt (Used_Operations (N)); | |
4596 | while Present (Elmt) loop | |
4597 | Set_Is_Potentially_Use_Visible (Node (Elmt), False); | |
4598 | Next_Elmt (Elmt); | |
4599 | end loop; | |
4600 | end if; | |
996ae0b0 RK |
4601 | end End_Use_Type; |
4602 | ||
4603 | ---------------------- | |
4604 | -- Find_Direct_Name -- | |
4605 | ---------------------- | |
4606 | ||
4607 | procedure Find_Direct_Name (N : Node_Id) is | |
4608 | E : Entity_Id; | |
4609 | E2 : Entity_Id; | |
4610 | Msg : Boolean; | |
4611 | ||
4612 | Inst : Entity_Id := Empty; | |
bc41faa2 | 4613 | -- Enclosing instance, if any |
996ae0b0 RK |
4614 | |
4615 | Homonyms : Entity_Id; | |
4616 | -- Saves start of homonym chain | |
4617 | ||
4618 | Nvis_Entity : Boolean; | |
3764bb00 BD |
4619 | -- Set True to indicate that there is at least one entity on the homonym |
4620 | -- chain which, while not visible, is visible enough from the user point | |
4621 | -- of view to warrant an error message of "not visible" rather than | |
4622 | -- undefined. | |
996ae0b0 | 4623 | |
9bc856dd | 4624 | Nvis_Is_Private_Subprg : Boolean := False; |
0ab80019 | 4625 | -- Ada 2005 (AI-262): Set True to indicate that a form of Beaujolais |
9bc856dd AC |
4626 | -- effect concerning library subprograms has been detected. Used to |
4627 | -- generate the precise error message. | |
4628 | ||
996ae0b0 | 4629 | function From_Actual_Package (E : Entity_Id) return Boolean; |
fba9ebfc | 4630 | -- Returns true if the entity is an actual for a package that is itself |
996ae0b0 | 4631 | -- an actual for a formal package of the current instance. Such an |
fba9ebfc AC |
4632 | -- entity requires special handling because it may be use-visible but |
4633 | -- hides directly visible entities defined outside the instance, because | |
4634 | -- the corresponding formal did so in the generic. | |
996ae0b0 | 4635 | |
67ce0d7e RD |
4636 | function Is_Actual_Parameter return Boolean; |
4637 | -- This function checks if the node N is an identifier that is an actual | |
4638 | -- parameter of a procedure call. If so it returns True, otherwise it | |
4639 | -- return False. The reason for this check is that at this stage we do | |
4640 | -- not know what procedure is being called if the procedure might be | |
4641 | -- overloaded, so it is premature to go setting referenced flags or | |
4642 | -- making calls to Generate_Reference. We will wait till Resolve_Actuals | |
4643 | -- for that processing | |
4644 | ||
996ae0b0 | 4645 | function Known_But_Invisible (E : Entity_Id) return Boolean; |
a43f6434 AC |
4646 | -- This function determines whether a reference to the entity E, which |
4647 | -- is not visible, can reasonably be considered to be known to the | |
4648 | -- writer of the reference. This is a heuristic test, used only for | |
4649 | -- the purposes of figuring out whether we prefer to complain that an | |
4650 | -- entity is undefined or invisible (and identify the declaration of | |
4651 | -- the invisible entity in the latter case). The point here is that we | |
4652 | -- don't want to complain that something is invisible and then point to | |
4653 | -- something entirely mysterious to the writer. | |
996ae0b0 RK |
4654 | |
4655 | procedure Nvis_Messages; | |
4656 | -- Called if there are no visible entries for N, but there is at least | |
4657 | -- one non-directly visible, or hidden declaration. This procedure | |
4658 | -- outputs an appropriate set of error messages. | |
4659 | ||
4660 | procedure Undefined (Nvis : Boolean); | |
4661 | -- This function is called if the current node has no corresponding | |
4662 | -- visible entity or entities. The value set in Msg indicates whether | |
4663 | -- an error message was generated (multiple error messages for the | |
4664 | -- same variable are generally suppressed, see body for details). | |
4665 | -- Msg is True if an error message was generated, False if not. This | |
4666 | -- value is used by the caller to determine whether or not to output | |
4667 | -- additional messages where appropriate. The parameter is set False | |
4668 | -- to get the message "X is undefined", and True to get the message | |
4669 | -- "X is not visible". | |
4670 | ||
4671 | ------------------------- | |
4672 | -- From_Actual_Package -- | |
4673 | ------------------------- | |
4674 | ||
4675 | function From_Actual_Package (E : Entity_Id) return Boolean is | |
4676 | Scop : constant Entity_Id := Scope (E); | |
fba9ebfc AC |
4677 | -- Declared scope of candidate entity |
4678 | ||
4679 | Act : Entity_Id; | |
4680 | ||
4681 | function Declared_In_Actual (Pack : Entity_Id) return Boolean; | |
4682 | -- Recursive function that does the work and examines actuals of | |
4683 | -- actual packages of current instance. | |
4684 | ||
4685 | ------------------------ | |
4686 | -- Declared_In_Actual -- | |
4687 | ------------------------ | |
4688 | ||
4689 | function Declared_In_Actual (Pack : Entity_Id) return Boolean is | |
4690 | Act : Entity_Id; | |
4691 | ||
4692 | begin | |
4693 | if No (Associated_Formal_Package (Pack)) then | |
4694 | return False; | |
4695 | ||
4696 | else | |
4697 | Act := First_Entity (Pack); | |
4698 | while Present (Act) loop | |
4699 | if Renamed_Object (Pack) = Scop then | |
4700 | return True; | |
4701 | ||
4702 | -- Check for end of list of actuals. | |
4703 | ||
4704 | elsif Ekind (Act) = E_Package | |
4705 | and then Renamed_Object (Act) = Pack | |
4706 | then | |
4707 | return False; | |
4708 | ||
4709 | elsif Ekind (Act) = E_Package | |
4710 | and then Declared_In_Actual (Act) | |
4711 | then | |
4712 | return True; | |
4713 | end if; | |
4714 | ||
4715 | Next_Entity (Act); | |
4716 | end loop; | |
4717 | ||
4718 | return False; | |
4719 | end if; | |
4720 | end Declared_In_Actual; | |
4721 | ||
4722 | -- Start of processing for From_Actual_Package | |
996ae0b0 RK |
4723 | |
4724 | begin | |
4725 | if not In_Instance then | |
4726 | return False; | |
fba9ebfc | 4727 | |
996ae0b0 RK |
4728 | else |
4729 | Inst := Current_Scope; | |
996ae0b0 RK |
4730 | while Present (Inst) |
4731 | and then Ekind (Inst) /= E_Package | |
4732 | and then not Is_Generic_Instance (Inst) | |
4733 | loop | |
4734 | Inst := Scope (Inst); | |
4735 | end loop; | |
4736 | ||
4737 | if No (Inst) then | |
4738 | return False; | |
4739 | end if; | |
4740 | ||
4741 | Act := First_Entity (Inst); | |
996ae0b0 | 4742 | while Present (Act) loop |
fba9ebfc AC |
4743 | if Ekind (Act) = E_Package |
4744 | and then Declared_In_Actual (Act) | |
4745 | then | |
4746 | return True; | |
996ae0b0 | 4747 | end if; |
fba9ebfc AC |
4748 | |
4749 | Next_Entity (Act); | |
996ae0b0 RK |
4750 | end loop; |
4751 | ||
4752 | return False; | |
4753 | end if; | |
4754 | end From_Actual_Package; | |
4755 | ||
67ce0d7e RD |
4756 | ------------------------- |
4757 | -- Is_Actual_Parameter -- | |
4758 | ------------------------- | |
4759 | ||
4760 | function Is_Actual_Parameter return Boolean is | |
4761 | begin | |
4762 | return | |
4763 | Nkind (N) = N_Identifier | |
4764 | and then | |
4765 | (Nkind (Parent (N)) = N_Procedure_Call_Statement | |
ac7d724d ES |
4766 | or else |
4767 | (Nkind (Parent (N)) = N_Parameter_Association | |
4768 | and then N = Explicit_Actual_Parameter (Parent (N)) | |
4769 | and then Nkind (Parent (Parent (N))) = | |
67ce0d7e RD |
4770 | N_Procedure_Call_Statement)); |
4771 | end Is_Actual_Parameter; | |
4772 | ||
996ae0b0 RK |
4773 | ------------------------- |
4774 | -- Known_But_Invisible -- | |
4775 | ------------------------- | |
4776 | ||
4777 | function Known_But_Invisible (E : Entity_Id) return Boolean is | |
4778 | Fname : File_Name_Type; | |
4779 | ||
4780 | begin | |
4781 | -- Entities in Standard are always considered to be known | |
4782 | ||
4783 | if Sloc (E) <= Standard_Location then | |
4784 | return True; | |
4785 | ||
4786 | -- An entity that does not come from source is always considered | |
4787 | -- to be unknown, since it is an artifact of code expansion. | |
4788 | ||
4789 | elsif not Comes_From_Source (E) then | |
4790 | return False; | |
4791 | ||
a43f6434 AC |
4792 | -- In gnat internal mode, we consider all entities known. The |
4793 | -- historical reason behind this discrepancy is not known??? But the | |
4794 | -- only effect is to modify the error message given, so it is not | |
4795 | -- critical. Since it only affects the exact wording of error | |
4796 | -- messages in illegal programs, we do not mention this as an | |
4797 | -- effect of -gnatg, since it is not a language modification. | |
996ae0b0 RK |
4798 | |
4799 | elsif GNAT_Mode then | |
4800 | return True; | |
4801 | end if; | |
4802 | ||
4803 | -- Here we have an entity that is not from package Standard, and | |
4804 | -- which comes from Source. See if it comes from an internal file. | |
4805 | ||
4806 | Fname := Unit_File_Name (Get_Source_Unit (E)); | |
4807 | ||
4808 | -- Case of from internal file | |
4809 | ||
4810 | if Is_Internal_File_Name (Fname) then | |
4811 | ||
4812 | -- Private part entities in internal files are never considered | |
4813 | -- to be known to the writer of normal application code. | |
4814 | ||
4815 | if Is_Hidden (E) then | |
4816 | return False; | |
4817 | end if; | |
4818 | ||
4819 | -- Entities from System packages other than System and | |
4820 | -- System.Storage_Elements are not considered to be known. | |
4821 | -- System.Auxxxx files are also considered known to the user. | |
4822 | ||
4823 | -- Should refine this at some point to generally distinguish | |
4824 | -- between known and unknown internal files ??? | |
4825 | ||
4826 | Get_Name_String (Fname); | |
4827 | ||
4828 | return | |
4829 | Name_Len < 2 | |
4830 | or else | |
4831 | Name_Buffer (1 .. 2) /= "s-" | |
4832 | or else | |
4833 | Name_Buffer (3 .. 8) = "stoele" | |
4834 | or else | |
4835 | Name_Buffer (3 .. 5) = "aux"; | |
4836 | ||
4837 | -- If not an internal file, then entity is definitely known, | |
4838 | -- even if it is in a private part (the message generated will | |
4839 | -- note that it is in a private part) | |
4840 | ||
4841 | else | |
4842 | return True; | |
4843 | end if; | |
4844 | end Known_But_Invisible; | |
4845 | ||
4846 | ------------------- | |
4847 | -- Nvis_Messages -- | |
4848 | ------------------- | |
4849 | ||
4850 | procedure Nvis_Messages is | |
9bc856dd AC |
4851 | Comp_Unit : Node_Id; |
4852 | Ent : Entity_Id; | |
1175f0b6 | 4853 | Found : Boolean := False; |
9bc856dd AC |
4854 | Hidden : Boolean := False; |
4855 | Item : Node_Id; | |
996ae0b0 RK |
4856 | |
4857 | begin | |
0ab80019 | 4858 | -- Ada 2005 (AI-262): Generate a precise error concerning the |
9bc856dd AC |
4859 | -- Beaujolais effect that was previously detected |
4860 | ||
4861 | if Nvis_Is_Private_Subprg then | |
4862 | ||
4863 | pragma Assert (Nkind (E2) = N_Defining_Identifier | |
16ca248a ES |
4864 | and then Ekind (E2) = E_Function |
4865 | and then Scope (E2) = Standard_Standard | |
4866 | and then Has_Private_With (E2)); | |
9bc856dd AC |
4867 | |
4868 | -- Find the sloc corresponding to the private with'ed unit | |
4869 | ||
16ca248a | 4870 | Comp_Unit := Cunit (Current_Sem_Unit); |
9bc856dd AC |
4871 | Error_Msg_Sloc := No_Location; |
4872 | ||
16ca248a | 4873 | Item := First (Context_Items (Comp_Unit)); |
9bc856dd AC |
4874 | while Present (Item) loop |
4875 | if Nkind (Item) = N_With_Clause | |
4876 | and then Private_Present (Item) | |
4877 | and then Entity (Name (Item)) = E2 | |
4878 | then | |
4879 | Error_Msg_Sloc := Sloc (Item); | |
4880 | exit; | |
4881 | end if; | |
4882 | ||
4883 | Next (Item); | |
4884 | end loop; | |
4885 | ||
4886 | pragma Assert (Error_Msg_Sloc /= No_Location); | |
4887 | ||
0ab80019 | 4888 | Error_Msg_N ("(Ada 2005): hidden by private with clause #", N); |
9bc856dd AC |
4889 | return; |
4890 | end if; | |
4891 | ||
996ae0b0 RK |
4892 | Undefined (Nvis => True); |
4893 | ||
4894 | if Msg then | |
4895 | ||
4896 | -- First loop does hidden declarations | |
4897 | ||
4898 | Ent := Homonyms; | |
4899 | while Present (Ent) loop | |
4900 | if Is_Potentially_Use_Visible (Ent) then | |
996ae0b0 | 4901 | if not Hidden then |
deef4289 AC |
4902 | Error_Msg_N -- CODEFIX |
4903 | ("multiple use clauses cause hiding!", N); | |
996ae0b0 RK |
4904 | Hidden := True; |
4905 | end if; | |
4906 | ||
4907 | Error_Msg_Sloc := Sloc (Ent); | |
4e7a4f6e AC |
4908 | Error_Msg_N -- CODEFIX |
4909 | ("hidden declaration#!", N); | |
996ae0b0 RK |
4910 | end if; |
4911 | ||
4912 | Ent := Homonym (Ent); | |
4913 | end loop; | |
4914 | ||
4915 | -- If we found hidden declarations, then that's enough, don't | |
4916 | -- bother looking for non-visible declarations as well. | |
4917 | ||
4918 | if Hidden then | |
4919 | return; | |
4920 | end if; | |
4921 | ||
4922 | -- Second loop does non-directly visible declarations | |
4923 | ||
4924 | Ent := Homonyms; | |
4925 | while Present (Ent) loop | |
4926 | if not Is_Potentially_Use_Visible (Ent) then | |
4927 | ||
4928 | -- Do not bother the user with unknown entities | |
4929 | ||
4930 | if not Known_But_Invisible (Ent) then | |
4931 | goto Continue; | |
4932 | end if; | |
4933 | ||
4934 | Error_Msg_Sloc := Sloc (Ent); | |
4935 | ||
4936 | -- Output message noting that there is a non-visible | |
4937 | -- declaration, distinguishing the private part case. | |
4938 | ||
4939 | if Is_Hidden (Ent) then | |
4940 | Error_Msg_N ("non-visible (private) declaration#!", N); | |
1175f0b6 AC |
4941 | |
4942 | -- If the entity is declared in a generic package, it | |
4943 | -- cannot be visible, so there is no point in adding it | |
4944 | -- to the list of candidates if another homograph from a | |
4945 | -- non-generic package has been seen. | |
4946 | ||
4947 | elsif Ekind (Scope (Ent)) = E_Generic_Package | |
4948 | and then Found | |
4949 | then | |
4950 | null; | |
4951 | ||
996ae0b0 | 4952 | else |
483c78cb RD |
4953 | Error_Msg_N -- CODEFIX |
4954 | ("non-visible declaration#!", N); | |
fbf5a39b | 4955 | |
1175f0b6 AC |
4956 | if Ekind (Scope (Ent)) /= E_Generic_Package then |
4957 | Found := True; | |
4958 | end if; | |
4959 | ||
fbf5a39b AC |
4960 | if Is_Compilation_Unit (Ent) |
4961 | and then | |
4962 | Nkind (Parent (Parent (N))) = N_Use_Package_Clause | |
4963 | then | |
16ca248a | 4964 | Error_Msg_Qual_Level := 99; |
ed2233dc AC |
4965 | Error_Msg_NE -- CODEFIX |
4966 | ("\\missing `WITH &;`", N, Ent); | |
16ca248a | 4967 | Error_Msg_Qual_Level := 0; |
fbf5a39b | 4968 | end if; |
e1b871e9 AC |
4969 | |
4970 | if Ekind (Ent) = E_Discriminant | |
4971 | and then Present (Corresponding_Discriminant (Ent)) | |
4972 | and then Scope (Corresponding_Discriminant (Ent)) = | |
4973 | Etype (Scope (Ent)) | |
4974 | then | |
4975 | Error_Msg_N | |
4976 | ("inherited discriminant not allowed here" & | |
4977 | " (RM 3.8 (12), 3.8.1 (6))!", N); | |
4978 | end if; | |
996ae0b0 | 4979 | end if; |
07fc65c4 GB |
4980 | |
4981 | -- Set entity and its containing package as referenced. We | |
4982 | -- can't be sure of this, but this seems a better choice | |
4983 | -- to avoid unused entity messages. | |
4984 | ||
4985 | if Comes_From_Source (Ent) then | |
4986 | Set_Referenced (Ent); | |
4987 | Set_Referenced (Cunit_Entity (Get_Source_Unit (Ent))); | |
4988 | end if; | |
996ae0b0 RK |
4989 | end if; |
4990 | ||
4991 | <<Continue>> | |
4992 | Ent := Homonym (Ent); | |
4993 | end loop; | |
996ae0b0 RK |
4994 | end if; |
4995 | end Nvis_Messages; | |
4996 | ||
4997 | --------------- | |
4998 | -- Undefined -- | |
4999 | --------------- | |
5000 | ||
5001 | procedure Undefined (Nvis : Boolean) is | |
5002 | Emsg : Error_Msg_Id; | |
5003 | ||
5004 | begin | |
fbf5a39b AC |
5005 | -- We should never find an undefined internal name. If we do, then |
5006 | -- see if we have previous errors. If so, ignore on the grounds that | |
5007 | -- it is probably a cascaded message (e.g. a block label from a badly | |
5008 | -- formed block). If no previous errors, then we have a real internal | |
5009 | -- error of some kind so raise an exception. | |
5010 | ||
5011 | if Is_Internal_Name (Chars (N)) then | |
5012 | if Total_Errors_Detected /= 0 then | |
5013 | return; | |
5014 | else | |
5015 | raise Program_Error; | |
5016 | end if; | |
5017 | end if; | |
5018 | ||
996ae0b0 RK |
5019 | -- A very specialized error check, if the undefined variable is |
5020 | -- a case tag, and the case type is an enumeration type, check | |
5021 | -- for a possible misspelling, and if so, modify the identifier | |
5022 | ||
5023 | -- Named aggregate should also be handled similarly ??? | |
5024 | ||
5025 | if Nkind (N) = N_Identifier | |
5026 | and then Nkind (Parent (N)) = N_Case_Statement_Alternative | |
5027 | then | |
996ae0b0 | 5028 | declare |
996ae0b0 RK |
5029 | Case_Stm : constant Node_Id := Parent (Parent (N)); |
5030 | Case_Typ : constant Entity_Id := Etype (Expression (Case_Stm)); | |
5031 | ||
5032 | Lit : Node_Id; | |
5033 | ||
5034 | begin | |
5035 | if Is_Enumeration_Type (Case_Typ) | |
21d27997 | 5036 | and then not Is_Standard_Character_Type (Case_Typ) |
996ae0b0 RK |
5037 | then |
5038 | Lit := First_Literal (Case_Typ); | |
5039 | Get_Name_String (Chars (Lit)); | |
5040 | ||
5041 | if Chars (Lit) /= Chars (N) | |
0b7f0f0e AC |
5042 | and then Is_Bad_Spelling_Of (Chars (N), Chars (Lit)) |
5043 | then | |
996ae0b0 | 5044 | Error_Msg_Node_2 := Lit; |
ed2233dc | 5045 | Error_Msg_N -- CODEFIX |
996ae0b0 RK |
5046 | ("& is undefined, assume misspelling of &", N); |
5047 | Rewrite (N, New_Occurrence_Of (Lit, Sloc (N))); | |
5048 | return; | |
5049 | end if; | |
5050 | ||
5051 | Lit := Next_Literal (Lit); | |
5052 | end if; | |
5053 | end; | |
5054 | end if; | |
5055 | ||
5056 | -- Normal processing | |
5057 | ||
5058 | Set_Entity (N, Any_Id); | |
5059 | Set_Etype (N, Any_Type); | |
5060 | ||
5061 | -- We use the table Urefs to keep track of entities for which we | |
5062 | -- have issued errors for undefined references. Multiple errors | |
5063 | -- for a single name are normally suppressed, however we modify | |
5064 | -- the error message to alert the programmer to this effect. | |
5065 | ||
5066 | for J in Urefs.First .. Urefs.Last loop | |
5067 | if Chars (N) = Chars (Urefs.Table (J).Node) then | |
5068 | if Urefs.Table (J).Err /= No_Error_Msg | |
5069 | and then Sloc (N) /= Urefs.Table (J).Loc | |
5070 | then | |
5071 | Error_Msg_Node_1 := Urefs.Table (J).Node; | |
5072 | ||
5073 | if Urefs.Table (J).Nvis then | |
5074 | Change_Error_Text (Urefs.Table (J).Err, | |
5075 | "& is not visible (more references follow)"); | |
5076 | else | |
5077 | Change_Error_Text (Urefs.Table (J).Err, | |
5078 | "& is undefined (more references follow)"); | |
5079 | end if; | |
5080 | ||
5081 | Urefs.Table (J).Err := No_Error_Msg; | |
5082 | end if; | |
5083 | ||
5084 | -- Although we will set Msg False, and thus suppress the | |
5085 | -- message, we also set Error_Posted True, to avoid any | |
5086 | -- cascaded messages resulting from the undefined reference. | |
5087 | ||
5088 | Msg := False; | |
5089 | Set_Error_Posted (N, True); | |
5090 | return; | |
5091 | end if; | |
5092 | end loop; | |
5093 | ||
5094 | -- If entry not found, this is first undefined occurrence | |
5095 | ||
5096 | if Nvis then | |
5097 | Error_Msg_N ("& is not visible!", N); | |
5098 | Emsg := Get_Msg_Id; | |
5099 | ||
5100 | else | |
5101 | Error_Msg_N ("& is undefined!", N); | |
5102 | Emsg := Get_Msg_Id; | |
5103 | ||
5104 | -- A very bizarre special check, if the undefined identifier | |
5105 | -- is put or put_line, then add a special error message (since | |
5106 | -- this is a very common error for beginners to make). | |
5107 | ||
b69cd36a | 5108 | if Nam_In (Chars (N), Name_Put, Name_Put_Line) then |
ed2233dc | 5109 | Error_Msg_N -- CODEFIX |
16ca248a ES |
5110 | ("\\possible missing `WITH Ada.Text_'I'O; " & |
5111 | "USE Ada.Text_'I'O`!", N); | |
5112 | ||
5113 | -- Another special check if N is the prefix of a selected | |
5114 | -- component which is a known unit, add message complaining | |
fbe627af | 5115 | -- about missing with for this unit. |
16ca248a ES |
5116 | |
5117 | elsif Nkind (Parent (N)) = N_Selected_Component | |
5118 | and then N = Prefix (Parent (N)) | |
5119 | and then Is_Known_Unit (Parent (N)) | |
5120 | then | |
5121 | Error_Msg_Node_2 := Selector_Name (Parent (N)); | |
ed2233dc AC |
5122 | Error_Msg_N -- CODEFIX |
5123 | ("\\missing `WITH &.&;`", Prefix (Parent (N))); | |
996ae0b0 RK |
5124 | end if; |
5125 | ||
5126 | -- Now check for possible misspellings | |
5127 | ||
996ae0b0 RK |
5128 | declare |
5129 | E : Entity_Id; | |
5130 | Ematch : Entity_Id := Empty; | |
5131 | ||
5132 | Last_Name_Id : constant Name_Id := | |
5133 | Name_Id (Nat (First_Name_Id) + | |
5134 | Name_Entries_Count - 1); | |
5135 | ||
996ae0b0 | 5136 | begin |
294ccb21 RD |
5137 | for Nam in First_Name_Id .. Last_Name_Id loop |
5138 | E := Get_Name_Entity_Id (Nam); | |
996ae0b0 RK |
5139 | |
5140 | if Present (E) | |
5141 | and then (Is_Immediately_Visible (E) | |
5142 | or else | |
5143 | Is_Potentially_Use_Visible (E)) | |
5144 | then | |
294ccb21 | 5145 | if Is_Bad_Spelling_Of (Chars (N), Nam) then |
996ae0b0 RK |
5146 | Ematch := E; |
5147 | exit; | |
5148 | end if; | |
5149 | end if; | |
5150 | end loop; | |
5151 | ||
5152 | if Present (Ematch) then | |
deef4289 AC |
5153 | Error_Msg_NE -- CODEFIX |
5154 | ("\possible misspelling of&", N, Ematch); | |
996ae0b0 RK |
5155 | end if; |
5156 | end; | |
5157 | end if; | |
5158 | ||
16ca248a ES |
5159 | -- Make entry in undefined references table unless the full errors |
5160 | -- switch is set, in which case by refraining from generating the | |
5161 | -- table entry, we guarantee that we get an error message for every | |
5162 | -- undefined reference. | |
996ae0b0 RK |
5163 | |
5164 | if not All_Errors_Mode then | |
11560bcc TQ |
5165 | Urefs.Append ( |
5166 | (Node => N, | |
5167 | Err => Emsg, | |
5168 | Nvis => Nvis, | |
5169 | Loc => Sloc (N))); | |
996ae0b0 RK |
5170 | end if; |
5171 | ||
5172 | Msg := True; | |
5173 | end Undefined; | |
5174 | ||
5175 | -- Start of processing for Find_Direct_Name | |
5176 | ||
5177 | begin | |
5178 | -- If the entity pointer is already set, this is an internal node, or | |
5179 | -- a node that is analyzed more than once, after a tree modification. | |
5180 | -- In such a case there is no resolution to perform, just set the type. | |
5181 | ||
5182 | if Present (Entity (N)) then | |
5183 | if Is_Type (Entity (N)) then | |
5184 | Set_Etype (N, Entity (N)); | |
5185 | ||
5186 | else | |
5187 | declare | |
5188 | Entyp : constant Entity_Id := Etype (Entity (N)); | |
5189 | ||
5190 | begin | |
5191 | -- One special case here. If the Etype field is already set, | |
5192 | -- and references the packed array type corresponding to the | |
5193 | -- etype of the referenced entity, then leave it alone. This | |
5194 | -- happens for trees generated from Exp_Pakd, where expressions | |
5195 | -- can be deliberately "mis-typed" to the packed array type. | |
5196 | ||
5197 | if Is_Array_Type (Entyp) | |
5198 | and then Is_Packed (Entyp) | |
5199 | and then Present (Etype (N)) | |
8ca597af | 5200 | and then Etype (N) = Packed_Array_Impl_Type (Entyp) |
996ae0b0 RK |
5201 | then |
5202 | null; | |
5203 | ||
5204 | -- If not that special case, then just reset the Etype | |
5205 | ||
5206 | else | |
5207 | Set_Etype (N, Etype (Entity (N))); | |
5208 | end if; | |
5209 | end; | |
5210 | end if; | |
5211 | ||
5212 | return; | |
5213 | end if; | |
5214 | ||
5215 | -- Here if Entity pointer was not set, we need full visibility analysis | |
5216 | -- First we generate debugging output if the debug E flag is set. | |
5217 | ||
5218 | if Debug_Flag_E then | |
5219 | Write_Str ("Looking for "); | |
5220 | Write_Name (Chars (N)); | |
5221 | Write_Eol; | |
5222 | end if; | |
5223 | ||
5224 | Homonyms := Current_Entity (N); | |
5225 | Nvis_Entity := False; | |
5226 | ||
5227 | E := Homonyms; | |
5228 | while Present (E) loop | |
5229 | ||
ff81221b ES |
5230 | -- If entity is immediately visible or potentially use visible, then |
5231 | -- process the entity and we are done. | |
996ae0b0 RK |
5232 | |
5233 | if Is_Immediately_Visible (E) then | |
5234 | goto Immediately_Visible_Entity; | |
5235 | ||
5236 | elsif Is_Potentially_Use_Visible (E) then | |
5237 | goto Potentially_Use_Visible_Entity; | |
5238 | ||
5239 | -- Note if a known but invisible entity encountered | |
5240 | ||
5241 | elsif Known_But_Invisible (E) then | |
5242 | Nvis_Entity := True; | |
5243 | end if; | |
5244 | ||
5245 | -- Move to next entity in chain and continue search | |
5246 | ||
5247 | E := Homonym (E); | |
5248 | end loop; | |
5249 | ||
5250 | -- If no entries on homonym chain that were potentially visible, | |
5251 | -- and no entities reasonably considered as non-visible, then | |
5252 | -- we have a plain undefined reference, with no additional | |
a90bd866 | 5253 | -- explanation required. |
996ae0b0 RK |
5254 | |
5255 | if not Nvis_Entity then | |
5256 | Undefined (Nvis => False); | |
996ae0b0 RK |
5257 | |
5258 | -- Otherwise there is at least one entry on the homonym chain that | |
5259 | -- is reasonably considered as being known and non-visible. | |
5260 | ||
5261 | else | |
5262 | Nvis_Messages; | |
996ae0b0 RK |
5263 | end if; |
5264 | ||
18dae814 | 5265 | goto Done; |
fbf5a39b | 5266 | |
996ae0b0 RK |
5267 | -- Processing for a potentially use visible entry found. We must search |
5268 | -- the rest of the homonym chain for two reasons. First, if there is a | |
5269 | -- directly visible entry, then none of the potentially use-visible | |
5270 | -- entities are directly visible (RM 8.4(10)). Second, we need to check | |
5271 | -- for the case of multiple potentially use-visible entries hiding one | |
5272 | -- another and as a result being non-directly visible (RM 8.4(11)). | |
5273 | ||
5274 | <<Potentially_Use_Visible_Entity>> declare | |
5275 | Only_One_Visible : Boolean := True; | |
5276 | All_Overloadable : Boolean := Is_Overloadable (E); | |
5277 | ||
5278 | begin | |
5279 | E2 := Homonym (E); | |
996ae0b0 RK |
5280 | while Present (E2) loop |
5281 | if Is_Immediately_Visible (E2) then | |
5282 | ||
5283 | -- If the use-visible entity comes from the actual for a | |
5284 | -- formal package, it hides a directly visible entity from | |
5285 | -- outside the instance. | |
5286 | ||
5287 | if From_Actual_Package (E) | |
5288 | and then Scope_Depth (E2) < Scope_Depth (Inst) | |
5289 | then | |
5290 | goto Found; | |
5291 | else | |
5292 | E := E2; | |
5293 | goto Immediately_Visible_Entity; | |
5294 | end if; | |
5295 | ||
5296 | elsif Is_Potentially_Use_Visible (E2) then | |
5297 | Only_One_Visible := False; | |
5298 | All_Overloadable := All_Overloadable and Is_Overloadable (E2); | |
9bc856dd | 5299 | |
30783513 | 5300 | -- Ada 2005 (AI-262): Protect against a form of Beaujolais effect |
f3d57416 | 5301 | -- that can occur in private_with clauses. Example: |
9bc856dd AC |
5302 | |
5303 | -- with A; | |
5304 | -- private with B; package A is | |
5305 | -- package C is function B return Integer; | |
5306 | -- use A; end A; | |
5307 | -- V1 : Integer := B; | |
5308 | -- private function B return Integer; | |
5309 | -- V2 : Integer := B; | |
5310 | -- end C; | |
5311 | ||
bc41faa2 | 5312 | -- V1 resolves to A.B, but V2 resolves to library unit B |
9bc856dd AC |
5313 | |
5314 | elsif Ekind (E2) = E_Function | |
5315 | and then Scope (E2) = Standard_Standard | |
5316 | and then Has_Private_With (E2) | |
5317 | then | |
5318 | Only_One_Visible := False; | |
5319 | All_Overloadable := False; | |
5320 | Nvis_Is_Private_Subprg := True; | |
5321 | exit; | |
996ae0b0 RK |
5322 | end if; |
5323 | ||
5324 | E2 := Homonym (E2); | |
5325 | end loop; | |
5326 | ||
5327 | -- On falling through this loop, we have checked that there are no | |
5328 | -- immediately visible entities. Only_One_Visible is set if exactly | |
5329 | -- one potentially use visible entity exists. All_Overloadable is | |
5330 | -- set if all the potentially use visible entities are overloadable. | |
5331 | -- The condition for legality is that either there is one potentially | |
5332 | -- use visible entity, or if there is more than one, then all of them | |
5333 | -- are overloadable. | |
5334 | ||
5335 | if Only_One_Visible or All_Overloadable then | |
5336 | goto Found; | |
5337 | ||
5338 | -- If there is more than one potentially use-visible entity and at | |
4ff4293f | 5339 | -- least one of them non-overloadable, we have an error (RM 8.4(11)). |
996ae0b0 RK |
5340 | -- Note that E points to the first such entity on the homonym list. |
5341 | -- Special case: if one of the entities is declared in an actual | |
5342 | -- package, it was visible in the generic, and takes precedence over | |
fbf5a39b AC |
5343 | -- other entities that are potentially use-visible. Same if it is |
5344 | -- declared in a local instantiation of the current instance. | |
996ae0b0 RK |
5345 | |
5346 | else | |
5347 | if In_Instance then | |
fbf5a39b | 5348 | |
bc41faa2 | 5349 | -- Find current instance |
fbf5a39b | 5350 | |
16ca248a | 5351 | Inst := Current_Scope; |
ac7d724d | 5352 | while Present (Inst) and then Inst /= Standard_Standard loop |
fbf5a39b AC |
5353 | if Is_Generic_Instance (Inst) then |
5354 | exit; | |
5355 | end if; | |
5356 | ||
5357 | Inst := Scope (Inst); | |
5358 | end loop; | |
5359 | ||
996ae0b0 | 5360 | E2 := E; |
996ae0b0 | 5361 | while Present (E2) loop |
fbf5a39b AC |
5362 | if From_Actual_Package (E2) |
5363 | or else | |
5364 | (Is_Generic_Instance (Scope (E2)) | |
5365 | and then Scope_Depth (Scope (E2)) > Scope_Depth (Inst)) | |
5366 | then | |
996ae0b0 RK |
5367 | E := E2; |
5368 | goto Found; | |
5369 | end if; | |
5370 | ||
5371 | E2 := Homonym (E2); | |
5372 | end loop; | |
5373 | ||
5374 | Nvis_Messages; | |
18dae814 | 5375 | goto Done; |
996ae0b0 | 5376 | |
5eb10f25 ES |
5377 | elsif |
5378 | Is_Predefined_File_Name (Unit_File_Name (Current_Sem_Unit)) | |
5379 | then | |
4de287c4 ES |
5380 | -- A use-clause in the body of a system file creates conflict |
5381 | -- with some entity in a user scope, while rtsfind is active. | |
5382 | -- Keep only the entity coming from another predefined unit. | |
5eb10f25 ES |
5383 | |
5384 | E2 := E; | |
5385 | while Present (E2) loop | |
5386 | if Is_Predefined_File_Name | |
5387 | (Unit_File_Name (Get_Source_Unit (Sloc (E2)))) | |
5388 | then | |
5389 | E := E2; | |
5390 | goto Found; | |
5391 | end if; | |
5392 | ||
5393 | E2 := Homonym (E2); | |
5394 | end loop; | |
5395 | ||
4de287c4 | 5396 | -- Entity must exist because predefined unit is correct |
5eb10f25 ES |
5397 | |
5398 | raise Program_Error; | |
5399 | ||
996ae0b0 RK |
5400 | else |
5401 | Nvis_Messages; | |
18dae814 | 5402 | goto Done; |
996ae0b0 RK |
5403 | end if; |
5404 | end if; | |
5405 | end; | |
5406 | ||
5407 | -- Come here with E set to the first immediately visible entity on | |
5408 | -- the homonym chain. This is the one we want unless there is another | |
ff81221b ES |
5409 | -- immediately visible entity further on in the chain for an inner |
5410 | -- scope (RM 8.3(8)). | |
996ae0b0 RK |
5411 | |
5412 | <<Immediately_Visible_Entity>> declare | |
5413 | Level : Int; | |
5414 | Scop : Entity_Id; | |
5415 | ||
5416 | begin | |
ff81221b | 5417 | -- Find scope level of initial entity. When compiling through |
996ae0b0 RK |
5418 | -- Rtsfind, the previous context is not completely invisible, and |
5419 | -- an outer entity may appear on the chain, whose scope is below | |
5420 | -- the entry for Standard that delimits the current scope stack. | |
5421 | -- Indicate that the level for this spurious entry is outside of | |
5422 | -- the current scope stack. | |
5423 | ||
5424 | Level := Scope_Stack.Last; | |
5425 | loop | |
5426 | Scop := Scope_Stack.Table (Level).Entity; | |
5427 | exit when Scop = Scope (E); | |
5428 | Level := Level - 1; | |
5429 | exit when Scop = Standard_Standard; | |
5430 | end loop; | |
5431 | ||
5432 | -- Now search remainder of homonym chain for more inner entry | |
5433 | -- If the entity is Standard itself, it has no scope, and we | |
5434 | -- compare it with the stack entry directly. | |
5435 | ||
5436 | E2 := Homonym (E); | |
5437 | while Present (E2) loop | |
5438 | if Is_Immediately_Visible (E2) then | |
4de287c4 ES |
5439 | |
5440 | -- If a generic package contains a local declaration that | |
5441 | -- has the same name as the generic, there may be a visibility | |
5442 | -- conflict in an instance, where the local declaration must | |
5443 | -- also hide the name of the corresponding package renaming. | |
5444 | -- We check explicitly for a package declared by a renaming, | |
5445 | -- whose renamed entity is an instance that is on the scope | |
5446 | -- stack, and that contains a homonym in the same scope. Once | |
5447 | -- we have found it, we know that the package renaming is not | |
5448 | -- immediately visible, and that the identifier denotes the | |
5449 | -- other entity (and its homonyms if overloaded). | |
5450 | ||
5451 | if Scope (E) = Scope (E2) | |
5452 | and then Ekind (E) = E_Package | |
5453 | and then Present (Renamed_Object (E)) | |
5454 | and then Is_Generic_Instance (Renamed_Object (E)) | |
5455 | and then In_Open_Scopes (Renamed_Object (E)) | |
5456 | and then Comes_From_Source (N) | |
5457 | then | |
5458 | Set_Is_Immediately_Visible (E, False); | |
5459 | E := E2; | |
5460 | ||
5461 | else | |
5462 | for J in Level + 1 .. Scope_Stack.Last loop | |
5463 | if Scope_Stack.Table (J).Entity = Scope (E2) | |
5464 | or else Scope_Stack.Table (J).Entity = E2 | |
5465 | then | |
5466 | Level := J; | |
5467 | E := E2; | |
5468 | exit; | |
5469 | end if; | |
5470 | end loop; | |
5471 | end if; | |
996ae0b0 RK |
5472 | end if; |
5473 | ||
5474 | E2 := Homonym (E2); | |
5475 | end loop; | |
5476 | ||
5477 | -- At the end of that loop, E is the innermost immediately | |
5478 | -- visible entity, so we are all set. | |
5479 | end; | |
5480 | ||
5481 | -- Come here with entity found, and stored in E | |
5482 | ||
5483 | <<Found>> begin | |
5484 | ||
30196a76 RD |
5485 | -- Check violation of No_Wide_Characters restriction |
5486 | ||
5487 | Check_Wide_Character_Restriction (E, N); | |
5488 | ||
294ccb21 RD |
5489 | -- When distribution features are available (Get_PCS_Name /= |
5490 | -- Name_No_DSA), a remote access-to-subprogram type is converted | |
5491 | -- into a record type holding whatever information is needed to | |
f3d57416 | 5492 | -- perform a remote call on an RCI subprogram. In that case we |
294ccb21 RD |
5493 | -- rewrite any occurrence of the RAS type into the equivalent record |
5494 | -- type here. 'Access attribute references and RAS dereferences are | |
5495 | -- then implemented using specific TSSs. However when distribution is | |
5496 | -- not available (case of Get_PCS_Name = Name_No_DSA), we bypass the | |
5497 | -- generation of these TSSs, and we must keep the RAS type in its | |
5498 | -- original access-to-subprogram form (since all calls through a | |
5499 | -- value of such type will be local anyway in the absence of a PCS). | |
5500 | ||
996ae0b0 RK |
5501 | if Comes_From_Source (N) |
5502 | and then Is_Remote_Access_To_Subprogram_Type (E) | |
d1d81616 | 5503 | and then Ekind (E) = E_Access_Subprogram_Type |
996ae0b0 | 5504 | and then Expander_Active |
a77842bd | 5505 | and then Get_PCS_Name /= Name_No_DSA |
996ae0b0 | 5506 | then |
18dae814 RD |
5507 | Rewrite (N, New_Occurrence_Of (Equivalent_Type (E), Sloc (N))); |
5508 | goto Done; | |
996ae0b0 RK |
5509 | end if; |
5510 | ||
6989bc1f | 5511 | -- Set the entity. Note that the reason we call Set_Entity for the |
e7ba564f | 5512 | -- overloadable case, as opposed to Set_Entity_With_Checks is |
6989bc1f AC |
5513 | -- that in the overloaded case, the initial call can set the wrong |
5514 | -- homonym. The call that sets the right homonym is in Sem_Res and | |
e7ba564f | 5515 | -- that call does use Set_Entity_With_Checks, so we don't miss |
6989bc1f AC |
5516 | -- a style check. |
5517 | ||
5518 | if Is_Overloadable (E) then | |
5519 | Set_Entity (N, E); | |
5520 | else | |
e7ba564f | 5521 | Set_Entity_With_Checks (N, E); |
6989bc1f | 5522 | end if; |
996ae0b0 RK |
5523 | |
5524 | if Is_Type (E) then | |
5525 | Set_Etype (N, E); | |
5526 | else | |
5527 | Set_Etype (N, Get_Full_View (Etype (E))); | |
5528 | end if; | |
5529 | ||
5530 | if Debug_Flag_E then | |
5531 | Write_Str (" found "); | |
5532 | Write_Entity_Info (E, " "); | |
5533 | end if; | |
5534 | ||
5535 | -- If the Ekind of the entity is Void, it means that all homonyms | |
5536 | -- are hidden from all visibility (RM 8.3(5,14-20)). However, this | |
5537 | -- test is skipped if the current scope is a record and the name is | |
5538 | -- a pragma argument expression (case of Atomic and Volatile pragmas | |
5539 | -- and possibly other similar pragmas added later, which are allowed | |
5540 | -- to reference components in the current record). | |
5541 | ||
5542 | if Ekind (E) = E_Void | |
5543 | and then | |
5544 | (not Is_Record_Type (Current_Scope) | |
5545 | or else Nkind (Parent (N)) /= N_Pragma_Argument_Association) | |
5546 | then | |
5547 | Premature_Usage (N); | |
5548 | ||
16ca248a ES |
5549 | -- If the entity is overloadable, collect all interpretations of the |
5550 | -- name for subsequent overload resolution. We optimize a bit here to | |
5551 | -- do this only if we have an overloadable entity that is not on its | |
5552 | -- own on the homonym chain. | |
996ae0b0 RK |
5553 | |
5554 | elsif Is_Overloadable (E) | |
5555 | and then (Present (Homonym (E)) or else Current_Entity (N) /= E) | |
5556 | then | |
5557 | Collect_Interps (N); | |
5558 | ||
bc41faa2 | 5559 | -- If no homonyms were visible, the entity is unambiguous |
996ae0b0 RK |
5560 | |
5561 | if not Is_Overloaded (N) then | |
67ce0d7e RD |
5562 | if not Is_Actual_Parameter then |
5563 | Generate_Reference (E, N); | |
5564 | end if; | |
996ae0b0 RK |
5565 | end if; |
5566 | ||
5567 | -- Case of non-overloadable entity, set the entity providing that | |
5568 | -- we do not have the case of a discriminant reference within a | |
5569 | -- default expression. Such references are replaced with the | |
5570 | -- corresponding discriminal, which is the formal corresponding to | |
5571 | -- to the discriminant in the initialization procedure. | |
5572 | ||
996ae0b0 | 5573 | else |
294ccb21 RD |
5574 | -- Entity is unambiguous, indicate that it is referenced here |
5575 | ||
5576 | -- For a renaming of an object, always generate simple reference, | |
5114f3ff AC |
5577 | -- we don't try to keep track of assignments in this case, except |
5578 | -- in SPARK mode where renamings are traversed for generating | |
5579 | -- local effects of subprograms. | |
294ccb21 | 5580 | |
5114f3ff AC |
5581 | if Is_Object (E) |
5582 | and then Present (Renamed_Object (E)) | |
f5da7a97 | 5583 | and then not GNATprove_Mode |
5114f3ff | 5584 | then |
294ccb21 | 5585 | Generate_Reference (E, N); |
996ae0b0 | 5586 | |
21d27997 RD |
5587 | -- If the renamed entity is a private protected component, |
5588 | -- reference the original component as well. This needs to be | |
5589 | -- done because the private renamings are installed before any | |
f3d0f304 | 5590 | -- analysis has occurred. Reference to a private component will |
21d27997 RD |
5591 | -- resolve to the renaming and the original component will be |
5592 | -- left unreferenced, hence the following. | |
5593 | ||
5594 | if Is_Prival (E) then | |
5595 | Generate_Reference (Prival_Link (E), N); | |
5596 | end if; | |
5597 | ||
294ccb21 RD |
5598 | -- One odd case is that we do not want to set the Referenced flag |
5599 | -- if the entity is a label, and the identifier is the label in | |
5600 | -- the source, since this is not a reference from the point of | |
5601 | -- view of the user. | |
5602 | ||
5603 | elsif Nkind (Parent (N)) = N_Label then | |
996ae0b0 RK |
5604 | declare |
5605 | R : constant Boolean := Referenced (E); | |
294ccb21 | 5606 | |
996ae0b0 | 5607 | begin |
294ccb21 RD |
5608 | -- Generate reference unless this is an actual parameter |
5609 | -- (see comment below) | |
5610 | ||
5611 | if Is_Actual_Parameter then | |
67ce0d7e RD |
5612 | Generate_Reference (E, N); |
5613 | Set_Referenced (E, R); | |
5614 | end if; | |
996ae0b0 RK |
5615 | end; |
5616 | ||
11560bcc TQ |
5617 | -- Normal case, not a label: generate reference |
5618 | ||
a54ffd6c AC |
5619 | else |
5620 | if not Is_Actual_Parameter then | |
61c161b2 | 5621 | |
a54ffd6c | 5622 | -- Package or generic package is always a simple reference |
61c161b2 | 5623 | |
a54ffd6c AC |
5624 | if Ekind_In (E, E_Package, E_Generic_Package) then |
5625 | Generate_Reference (E, N, 'r'); | |
5626 | ||
5627 | -- Else see if we have a left hand side | |
fbf5a39b | 5628 | |
84df40f7 | 5629 | else |
a54ffd6c AC |
5630 | case Is_LHS (N) is |
5631 | when Yes => | |
5632 | Generate_Reference (E, N, 'm'); | |
5633 | ||
5634 | when No => | |
5635 | Generate_Reference (E, N, 'r'); | |
5636 | ||
5637 | -- If we don't know now, generate reference later | |
5638 | ||
5639 | when Unknown => | |
5640 | Deferred_References.Append ((E, N)); | |
5641 | end case; | |
84df40f7 | 5642 | end if; |
67ce0d7e RD |
5643 | end if; |
5644 | ||
f8dae9bb | 5645 | Check_Nested_Access (E); |
996ae0b0 RK |
5646 | end if; |
5647 | ||
4c484f40 | 5648 | Set_Entity_Or_Discriminal (N, E); |
d50f4827 | 5649 | |
27dd0dde ES |
5650 | -- The name may designate a generalized reference, in which case |
5651 | -- the dereference interpretation will be included. | |
5652 | ||
d50f4827 | 5653 | if Ada_Version >= Ada_2012 |
444acbdd AC |
5654 | and then |
5655 | (Nkind (Parent (N)) in N_Subexpr | |
73534138 AC |
5656 | or else Nkind_In (Parent (N), N_Object_Declaration, |
5657 | N_Assignment_Statement)) | |
d50f4827 AC |
5658 | then |
5659 | Check_Implicit_Dereference (N, Etype (E)); | |
5660 | end if; | |
996ae0b0 RK |
5661 | end if; |
5662 | end; | |
18dae814 RD |
5663 | |
5664 | -- Come here with entity set | |
5665 | ||
5666 | <<Done>> | |
5667 | Check_Restriction_No_Use_Of_Entity (N); | |
996ae0b0 RK |
5668 | end Find_Direct_Name; |
5669 | ||
5670 | ------------------------ | |
5671 | -- Find_Expanded_Name -- | |
5672 | ------------------------ | |
5673 | ||
5674 | -- This routine searches the homonym chain of the entity until it finds | |
5675 | -- an entity declared in the scope denoted by the prefix. If the entity | |
5676 | -- is private, it may nevertheless be immediately visible, if we are in | |
5677 | -- the scope of its declaration. | |
5678 | ||
5679 | procedure Find_Expanded_Name (N : Node_Id) is | |
dc726757 HK |
5680 | function In_Pragmas_Depends_Or_Global (N : Node_Id) return Boolean; |
5681 | -- Determine whether an arbitrary node N appears in pragmas [Refined_] | |
5682 | -- Depends or [Refined_]Global. | |
5683 | ||
5684 | ---------------------------------- | |
5685 | -- In_Pragmas_Depends_Or_Global -- | |
5686 | ---------------------------------- | |
5687 | ||
5688 | function In_Pragmas_Depends_Or_Global (N : Node_Id) return Boolean is | |
5689 | Par : Node_Id; | |
5690 | ||
5691 | begin | |
5692 | -- Climb the parent chain looking for a pragma | |
5693 | ||
5694 | Par := N; | |
5695 | while Present (Par) loop | |
5696 | if Nkind (Par) = N_Pragma | |
5697 | and then Nam_In (Pragma_Name (Par), Name_Depends, | |
5698 | Name_Global, | |
5699 | Name_Refined_Depends, | |
5700 | Name_Refined_Global) | |
5701 | then | |
5702 | return True; | |
5703 | ||
5704 | -- Prevent the search from going too far | |
5705 | ||
5706 | elsif Is_Body_Or_Package_Declaration (Par) then | |
5707 | return False; | |
5708 | end if; | |
5709 | ||
5710 | Par := Parent (Par); | |
5711 | end loop; | |
5712 | ||
5713 | return False; | |
5714 | end In_Pragmas_Depends_Or_Global; | |
5715 | ||
5716 | -- Local variables | |
5717 | ||
07fc65c4 GB |
5718 | Selector : constant Node_Id := Selector_Name (N); |
5719 | Candidate : Entity_Id := Empty; | |
996ae0b0 | 5720 | P_Name : Entity_Id; |
996ae0b0 RK |
5721 | Id : Entity_Id; |
5722 | ||
dc726757 HK |
5723 | -- Start of processing for Find_Expanded_Name |
5724 | ||
996ae0b0 RK |
5725 | begin |
5726 | P_Name := Entity (Prefix (N)); | |
996ae0b0 | 5727 | |
ff81221b ES |
5728 | -- If the prefix is a renamed package, look for the entity in the |
5729 | -- original package. | |
996ae0b0 RK |
5730 | |
5731 | if Ekind (P_Name) = E_Package | |
5732 | and then Present (Renamed_Object (P_Name)) | |
5733 | then | |
5734 | P_Name := Renamed_Object (P_Name); | |
5735 | ||
5736 | -- Rewrite node with entity field pointing to renamed object | |
5737 | ||
5738 | Rewrite (Prefix (N), New_Copy (Prefix (N))); | |
5739 | Set_Entity (Prefix (N), P_Name); | |
5740 | ||
5741 | -- If the prefix is an object of a concurrent type, look for | |
5742 | -- the entity in the associated task or protected type. | |
5743 | ||
5744 | elsif Is_Concurrent_Type (Etype (P_Name)) then | |
5745 | P_Name := Etype (P_Name); | |
5746 | end if; | |
5747 | ||
5748 | Id := Current_Entity (Selector); | |
5749 | ||
923fa078 RD |
5750 | declare |
5751 | Is_New_Candidate : Boolean; | |
996ae0b0 | 5752 | |
923fa078 RD |
5753 | begin |
5754 | while Present (Id) loop | |
5755 | if Scope (Id) = P_Name then | |
5756 | Candidate := Id; | |
5757 | Is_New_Candidate := True; | |
5758 | ||
dc726757 HK |
5759 | -- Handle abstract views of states and variables. These are |
5760 | -- acceptable only when the reference to the view appears in | |
5761 | -- pragmas [Refined_]Depends and [Refined_]Global. | |
5762 | ||
5763 | if Ekind (Id) = E_Abstract_State | |
5764 | and then From_Limited_With (Id) | |
5765 | and then Present (Non_Limited_View (Id)) | |
5766 | then | |
5767 | if In_Pragmas_Depends_Or_Global (N) then | |
5768 | Candidate := Non_Limited_View (Id); | |
5769 | Is_New_Candidate := True; | |
5770 | ||
1f0b1e48 | 5771 | -- Hide candidate because it is not used in a proper context |
dc726757 HK |
5772 | |
5773 | else | |
5774 | Candidate := Empty; | |
5775 | Is_New_Candidate := False; | |
5776 | end if; | |
5777 | end if; | |
5778 | ||
47346923 AC |
5779 | -- Ada 2005 (AI-217): Handle shadow entities associated with |
5780 | -- types declared in limited-withed nested packages. We don't need | |
5781 | -- to handle E_Incomplete_Subtype entities because the entities | |
5782 | -- in the limited view are always E_Incomplete_Type and | |
5783 | -- E_Class_Wide_Type entities (see Build_Limited_Views). | |
5784 | ||
5785 | -- Regarding the expression used to evaluate the scope, it | |
5786 | -- is important to note that the limited view also has shadow | |
5787 | -- entities associated nested packages. For this reason the | |
5788 | -- correct scope of the entity is the scope of the real entity. | |
11560bcc TQ |
5789 | -- The non-limited view may itself be incomplete, in which case |
5790 | -- get the full view if available. | |
923fa078 | 5791 | |
47346923 | 5792 | elsif Ekind_In (Id, E_Incomplete_Type, E_Class_Wide_Type) |
dc726757 | 5793 | and then From_Limited_With (Id) |
923fa078 RD |
5794 | and then Present (Non_Limited_View (Id)) |
5795 | and then Scope (Non_Limited_View (Id)) = P_Name | |
5796 | then | |
11560bcc | 5797 | Candidate := Get_Full_View (Non_Limited_View (Id)); |
923fa078 | 5798 | Is_New_Candidate := True; |
996ae0b0 RK |
5799 | |
5800 | else | |
923fa078 | 5801 | Is_New_Candidate := False; |
996ae0b0 | 5802 | end if; |
996ae0b0 | 5803 | |
923fa078 | 5804 | if Is_New_Candidate then |
ddbc55d8 AC |
5805 | |
5806 | -- If entity is a child unit, either it is a visible child of | |
5807 | -- the prefix, or we are in the body of a generic prefix, as | |
5808 | -- will happen when a child unit is instantiated in the body | |
5809 | -- of a generic parent. This is because the instance body does | |
5810 | -- not restore the full compilation context, given that all | |
5811 | -- non-local references have been captured. | |
5812 | ||
8ca1ee5d | 5813 | if Is_Child_Unit (Id) or else P_Name = Standard_Standard then |
ddbc55d8 AC |
5814 | exit when Is_Visible_Lib_Unit (Id) |
5815 | or else (Is_Child_Unit (Id) | |
5816 | and then In_Open_Scopes (Scope (Id)) | |
5817 | and then In_Instance_Body); | |
923fa078 | 5818 | else |
8398e82e | 5819 | exit when not Is_Hidden (Id); |
923fa078 | 5820 | end if; |
8398e82e AC |
5821 | |
5822 | exit when Is_Immediately_Visible (Id); | |
923fa078 RD |
5823 | end if; |
5824 | ||
5825 | Id := Homonym (Id); | |
5826 | end loop; | |
5827 | end; | |
996ae0b0 RK |
5828 | |
5829 | if No (Id) | |
ac7d724d | 5830 | and then Ekind_In (P_Name, E_Procedure, E_Function) |
996ae0b0 RK |
5831 | and then Is_Generic_Instance (P_Name) |
5832 | then | |
5833 | -- Expanded name denotes entity in (instance of) generic subprogram. | |
5834 | -- The entity may be in the subprogram instance, or may denote one of | |
5835 | -- the formals, which is declared in the enclosing wrapper package. | |
5836 | ||
5837 | P_Name := Scope (P_Name); | |
996ae0b0 | 5838 | |
bc41faa2 | 5839 | Id := Current_Entity (Selector); |
996ae0b0 | 5840 | while Present (Id) loop |
bc41faa2 | 5841 | exit when Scope (Id) = P_Name; |
996ae0b0 RK |
5842 | Id := Homonym (Id); |
5843 | end loop; | |
5844 | end if; | |
5845 | ||
bc41faa2 | 5846 | if No (Id) or else Chars (Id) /= Chars (Selector) then |
996ae0b0 RK |
5847 | Set_Etype (N, Any_Type); |
5848 | ||
ff81221b ES |
5849 | -- If we are looking for an entity defined in System, try to find it |
5850 | -- in the child package that may have been provided as an extension | |
5851 | -- to System. The Extend_System pragma will have supplied the name of | |
5852 | -- the extension, which may have to be loaded. | |
996ae0b0 RK |
5853 | |
5854 | if Chars (P_Name) = Name_System | |
5855 | and then Scope (P_Name) = Standard_Standard | |
fbf5a39b | 5856 | and then Present (System_Extend_Unit) |
996ae0b0 RK |
5857 | and then Present_System_Aux (N) |
5858 | then | |
5859 | Set_Entity (Prefix (N), System_Aux_Id); | |
5860 | Find_Expanded_Name (N); | |
5861 | return; | |
5862 | ||
fbf5a39b AC |
5863 | elsif Nkind (Selector) = N_Operator_Symbol |
5864 | and then Has_Implicit_Operator (N) | |
996ae0b0 RK |
5865 | then |
5866 | -- There is an implicit instance of the predefined operator in | |
5867 | -- the given scope. The operator entity is defined in Standard. | |
5868 | -- Has_Implicit_Operator makes the node into an Expanded_Name. | |
5869 | ||
5870 | return; | |
5871 | ||
5872 | elsif Nkind (Selector) = N_Character_Literal | |
5873 | and then Has_Implicit_Character_Literal (N) | |
5874 | then | |
5875 | -- If there is no literal defined in the scope denoted by the | |
5876 | -- prefix, the literal may belong to (a type derived from) | |
5877 | -- Standard_Character, for which we have no explicit literals. | |
5878 | ||
5879 | return; | |
5880 | ||
5881 | else | |
ff81221b ES |
5882 | -- If the prefix is a single concurrent object, use its name in |
5883 | -- the error message, rather than that of the anonymous type. | |
996ae0b0 RK |
5884 | |
5885 | if Is_Concurrent_Type (P_Name) | |
5886 | and then Is_Internal_Name (Chars (P_Name)) | |
5887 | then | |
5888 | Error_Msg_Node_2 := Entity (Prefix (N)); | |
5889 | else | |
5890 | Error_Msg_Node_2 := P_Name; | |
5891 | end if; | |
5892 | ||
5893 | if P_Name = System_Aux_Id then | |
5894 | P_Name := Scope (P_Name); | |
5895 | Set_Entity (Prefix (N), P_Name); | |
5896 | end if; | |
5897 | ||
5898 | if Present (Candidate) then | |
5899 | ||
16ca248a ES |
5900 | -- If we know that the unit is a child unit we can give a more |
5901 | -- accurate error message. | |
5902 | ||
996ae0b0 | 5903 | if Is_Child_Unit (Candidate) then |
edd63e9b | 5904 | |
16ca248a ES |
5905 | -- If the candidate is a private child unit and we are in |
5906 | -- the visible part of a public unit, specialize the error | |
5907 | -- message. There might be a private with_clause for it, | |
5908 | -- but it is not currently active. | |
edd63e9b ES |
5909 | |
5910 | if Is_Private_Descendant (Candidate) | |
5911 | and then Ekind (Current_Scope) = E_Package | |
5912 | and then not In_Private_Part (Current_Scope) | |
5913 | and then not Is_Private_Descendant (Current_Scope) | |
5914 | then | |
5915 | Error_Msg_N ("private child unit& is not visible here", | |
16ca248a ES |
5916 | Selector); |
5917 | ||
5918 | -- Normal case where we have a missing with for a child unit | |
5919 | ||
edd63e9b | 5920 | else |
16ca248a | 5921 | Error_Msg_Qual_Level := 99; |
ed2233dc AC |
5922 | Error_Msg_NE -- CODEFIX |
5923 | ("missing `WITH &;`", Selector, Candidate); | |
16ca248a | 5924 | Error_Msg_Qual_Level := 0; |
edd63e9b | 5925 | end if; |
16ca248a ES |
5926 | |
5927 | -- Here we don't know that this is a child unit | |
5928 | ||
996ae0b0 RK |
5929 | else |
5930 | Error_Msg_NE ("& is not a visible entity of&", N, Selector); | |
5931 | end if; | |
5932 | ||
5933 | else | |
5934 | -- Within the instantiation of a child unit, the prefix may | |
16ca248a | 5935 | -- denote the parent instance, but the selector has the name |
58747e48 AC |
5936 | -- of the original child. That is to say, when A.B appears |
5937 | -- within an instantiation of generic child unit B, the scope | |
5938 | -- stack includes an instance of A (P_Name) and an instance | |
5939 | -- of B under some other name. We scan the scope to find this | |
5940 | -- child instance, which is the desired entity. | |
5941 | -- Note that the parent may itself be a child instance, if | |
5942 | -- the reference is of the form A.B.C, in which case A.B has | |
5943 | -- already been rewritten with the proper entity. | |
5944 | ||
5945 | if In_Open_Scopes (P_Name) | |
996ae0b0 RK |
5946 | and then Is_Generic_Instance (P_Name) |
5947 | then | |
5948 | declare | |
58747e48 AC |
5949 | Gen_Par : constant Entity_Id := |
5950 | Generic_Parent (Specification | |
5951 | (Unit_Declaration_Node (P_Name))); | |
996ae0b0 RK |
5952 | S : Entity_Id := Current_Scope; |
5953 | P : Entity_Id; | |
5954 | ||
5955 | begin | |
5956 | for J in reverse 0 .. Scope_Stack.Last loop | |
5957 | S := Scope_Stack.Table (J).Entity; | |
5958 | ||
5959 | exit when S = Standard_Standard; | |
5960 | ||
bce79204 AC |
5961 | if Ekind_In (S, E_Function, |
5962 | E_Package, | |
5963 | E_Procedure) | |
996ae0b0 RK |
5964 | then |
5965 | P := Generic_Parent (Specification | |
5966 | (Unit_Declaration_Node (S))); | |
5967 | ||
58747e48 AC |
5968 | -- Check that P is a generic child of the generic |
5969 | -- parent of the prefix. | |
5970 | ||
996ae0b0 | 5971 | if Present (P) |
996ae0b0 | 5972 | and then Chars (P) = Chars (Selector) |
58747e48 | 5973 | and then Scope (P) = Gen_Par |
996ae0b0 RK |
5974 | then |
5975 | Id := S; | |
a77842bd | 5976 | goto Found; |
996ae0b0 RK |
5977 | end if; |
5978 | end if; | |
5979 | ||
5980 | end loop; | |
5981 | end; | |
5982 | end if; | |
5983 | ||
16ca248a ES |
5984 | -- If this is a selection from Ada, System or Interfaces, then |
5985 | -- we assume a missing with for the corresponding package. | |
5986 | ||
5987 | if Is_Known_Unit (N) then | |
fbe627af RD |
5988 | if not Error_Posted (N) then |
5989 | Error_Msg_Node_2 := Selector; | |
ed2233dc AC |
5990 | Error_Msg_N -- CODEFIX |
5991 | ("missing `WITH &.&;`", Prefix (N)); | |
fbe627af | 5992 | end if; |
996ae0b0 | 5993 | |
16ca248a ES |
5994 | -- If this is a selection from a dummy package, then suppress |
5995 | -- the error message, of course the entity is missing if the | |
a90bd866 | 5996 | -- package is missing. |
996ae0b0 RK |
5997 | |
5998 | elsif Sloc (Error_Msg_Node_2) = No_Location then | |
5999 | null; | |
6000 | ||
6001 | -- Here we have the case of an undefined component | |
6002 | ||
6003 | else | |
d6a24cdb AC |
6004 | |
6005 | -- The prefix may hide a homonym in the context that | |
6006 | -- declares the desired entity. This error can use a | |
6007 | -- specialized message. | |
6008 | ||
8398e82e | 6009 | if In_Open_Scopes (P_Name) then |
d6a24cdb AC |
6010 | declare |
6011 | H : constant Entity_Id := Homonym (P_Name); | |
0d354370 | 6012 | |
d6a24cdb | 6013 | begin |
8398e82e AC |
6014 | if Present (H) |
6015 | and then Is_Compilation_Unit (H) | |
6016 | and then | |
6017 | (Is_Immediately_Visible (H) | |
6018 | or else Is_Visible_Lib_Unit (H)) | |
6019 | then | |
6020 | Id := First_Entity (H); | |
6021 | while Present (Id) loop | |
6022 | if Chars (Id) = Chars (Selector) then | |
6023 | Error_Msg_Qual_Level := 99; | |
6024 | Error_Msg_Name_1 := Chars (Selector); | |
6025 | Error_Msg_NE | |
6026 | ("% not declared in&", N, P_Name); | |
6027 | Error_Msg_NE | |
6028 | ("\use fully qualified name starting with " | |
6029 | & "Standard to make& visible", N, H); | |
6030 | Error_Msg_Qual_Level := 0; | |
6031 | goto Done; | |
6032 | end if; | |
d6a24cdb | 6033 | |
8398e82e AC |
6034 | Next_Entity (Id); |
6035 | end loop; | |
6036 | end if; | |
689cb4ac | 6037 | |
690943fc | 6038 | -- If not found, standard error message |
689cb4ac AC |
6039 | |
6040 | Error_Msg_NE ("& not declared in&", N, Selector); | |
6041 | ||
6042 | <<Done>> null; | |
d6a24cdb AC |
6043 | end; |
6044 | ||
6045 | else | |
6046 | Error_Msg_NE ("& not declared in&", N, Selector); | |
6047 | end if; | |
996ae0b0 | 6048 | |
bc41faa2 | 6049 | -- Check for misspelling of some entity in prefix |
996ae0b0 RK |
6050 | |
6051 | Id := First_Entity (P_Name); | |
294ccb21 RD |
6052 | while Present (Id) loop |
6053 | if Is_Bad_Spelling_Of (Chars (Id), Chars (Selector)) | |
6054 | and then not Is_Internal_Name (Chars (Id)) | |
6055 | then | |
deef4289 | 6056 | Error_Msg_NE -- CODEFIX |
294ccb21 RD |
6057 | ("possible misspelling of&", Selector, Id); |
6058 | exit; | |
6059 | end if; | |
996ae0b0 | 6060 | |
294ccb21 RD |
6061 | Next_Entity (Id); |
6062 | end loop; | |
996ae0b0 RK |
6063 | |
6064 | -- Specialize the message if this may be an instantiation | |
6065 | -- of a child unit that was not mentioned in the context. | |
6066 | ||
6067 | if Nkind (Parent (N)) = N_Package_Instantiation | |
6068 | and then Is_Generic_Instance (Entity (Prefix (N))) | |
6069 | and then Is_Compilation_Unit | |
294ccb21 | 6070 | (Generic_Parent (Parent (Entity (Prefix (N))))) |
996ae0b0 | 6071 | then |
16ca248a | 6072 | Error_Msg_Node_2 := Selector; |
ed2233dc AC |
6073 | Error_Msg_N -- CODEFIX |
6074 | ("\missing `WITH &.&;`", Prefix (N)); | |
996ae0b0 RK |
6075 | end if; |
6076 | end if; | |
6077 | end if; | |
6078 | ||
6079 | Id := Any_Id; | |
6080 | end if; | |
6081 | end if; | |
6082 | ||
a77842bd | 6083 | <<Found>> |
996ae0b0 RK |
6084 | if Comes_From_Source (N) |
6085 | and then Is_Remote_Access_To_Subprogram_Type (Id) | |
d1d81616 | 6086 | and then Ekind (Id) = E_Access_Subprogram_Type |
a77842bd | 6087 | and then Present (Equivalent_Type (Id)) |
996ae0b0 | 6088 | then |
16ca248a ES |
6089 | -- If we are not actually generating distribution code (i.e. the |
6090 | -- current PCS is the dummy non-distributed version), then the | |
6091 | -- Equivalent_Type will be missing, and Id should be treated as | |
6092 | -- a regular access-to-subprogram type. | |
a77842bd | 6093 | |
996ae0b0 RK |
6094 | Id := Equivalent_Type (Id); |
6095 | Set_Chars (Selector, Chars (Id)); | |
6096 | end if; | |
6097 | ||
0ab80019 | 6098 | -- Ada 2005 (AI-50217): Check usage of entities in limited withed units |
19f0526a | 6099 | |
7b56a91b AC |
6100 | if Ekind (P_Name) = E_Package and then From_Limited_With (P_Name) then |
6101 | if From_Limited_With (Id) | |
0fb2ea01 AC |
6102 | or else Is_Type (Id) |
6103 | or else Ekind (Id) = E_Package | |
996ae0b0 RK |
6104 | then |
6105 | null; | |
6106 | else | |
6107 | Error_Msg_N | |
657a9dd9 | 6108 | ("limited withed package can only be used to access " |
dc726757 | 6109 | & "incomplete types", N); |
996ae0b0 RK |
6110 | end if; |
6111 | end if; | |
6112 | ||
6113 | if Is_Task_Type (P_Name) | |
6114 | and then ((Ekind (Id) = E_Entry | |
ac7d724d | 6115 | and then Nkind (Parent (N)) /= N_Attribute_Reference) |
294ccb21 | 6116 | or else |
ac7d724d ES |
6117 | (Ekind (Id) = E_Entry_Family |
6118 | and then | |
6119 | Nkind (Parent (Parent (N))) /= N_Attribute_Reference)) | |
996ae0b0 | 6120 | then |
a53c5613 AC |
6121 | -- If both the task type and the entry are in scope, this may still |
6122 | -- be the expanded name of an entry formal. | |
996ae0b0 | 6123 | |
a53c5613 AC |
6124 | if In_Open_Scopes (Id) |
6125 | and then Nkind (Parent (N)) = N_Selected_Component | |
6126 | then | |
6127 | null; | |
6128 | ||
6129 | else | |
6130 | -- It is an entry call after all, either to the current task | |
6131 | -- (which will deadlock) or to an enclosing task. | |
6132 | ||
6133 | Analyze_Selected_Component (N); | |
6134 | return; | |
6135 | end if; | |
996ae0b0 RK |
6136 | end if; |
6137 | ||
6138 | Change_Selected_Component_To_Expanded_Name (N); | |
07fc65c4 | 6139 | |
a54ffd6c AC |
6140 | -- Set appropriate type |
6141 | ||
6142 | if Is_Type (Id) then | |
6143 | Set_Etype (N, Id); | |
6144 | else | |
6145 | Set_Etype (N, Get_Full_View (Etype (Id))); | |
6146 | end if; | |
6147 | ||
07fc65c4 | 6148 | -- Do style check and generate reference, but skip both steps if this |
16ca248a ES |
6149 | -- entity has homonyms, since we may not have the right homonym set yet. |
6150 | -- The proper homonym will be set during the resolve phase. | |
07fc65c4 GB |
6151 | |
6152 | if Has_Homonym (Id) then | |
6153 | Set_Entity (N, Id); | |
a54ffd6c | 6154 | |
07fc65c4 | 6155 | else |
4c484f40 | 6156 | Set_Entity_Or_Discriminal (N, Id); |
84df40f7 | 6157 | |
a54ffd6c AC |
6158 | case Is_LHS (N) is |
6159 | when Yes => | |
6160 | Generate_Reference (Id, N, 'm'); | |
6161 | when No => | |
6162 | Generate_Reference (Id, N, 'r'); | |
6163 | when Unknown => | |
6164 | Deferred_References.Append ((Id, N)); | |
6165 | end case; | |
996ae0b0 RK |
6166 | end if; |
6167 | ||
30196a76 RD |
6168 | -- Check for violation of No_Wide_Characters |
6169 | ||
6170 | Check_Wide_Character_Restriction (Id, N); | |
6171 | ||
16ca248a ES |
6172 | -- If the Ekind of the entity is Void, it means that all homonyms are |
6173 | -- hidden from all visibility (RM 8.3(5,14-20)). | |
996ae0b0 RK |
6174 | |
6175 | if Ekind (Id) = E_Void then | |
6176 | Premature_Usage (N); | |
6177 | ||
ac7d724d | 6178 | elsif Is_Overloadable (Id) and then Present (Homonym (Id)) then |
996ae0b0 RK |
6179 | declare |
6180 | H : Entity_Id := Homonym (Id); | |
6181 | ||
6182 | begin | |
6183 | while Present (H) loop | |
35ae2ed8 | 6184 | if Scope (H) = Scope (Id) |
ac7d724d ES |
6185 | and then (not Is_Hidden (H) |
6186 | or else Is_Immediately_Visible (H)) | |
35ae2ed8 | 6187 | then |
996ae0b0 RK |
6188 | Collect_Interps (N); |
6189 | exit; | |
6190 | end if; | |
6191 | ||
6192 | H := Homonym (H); | |
6193 | end loop; | |
fbf5a39b | 6194 | |
16ca248a ES |
6195 | -- If an extension of System is present, collect possible explicit |
6196 | -- overloadings declared in the extension. | |
fbf5a39b AC |
6197 | |
6198 | if Chars (P_Name) = Name_System | |
6199 | and then Scope (P_Name) = Standard_Standard | |
6200 | and then Present (System_Extend_Unit) | |
6201 | and then Present_System_Aux (N) | |
6202 | then | |
6203 | H := Current_Entity (Id); | |
6204 | ||
6205 | while Present (H) loop | |
6206 | if Scope (H) = System_Aux_Id then | |
6207 | Add_One_Interp (N, H, Etype (H)); | |
6208 | end if; | |
6209 | ||
6210 | H := Homonym (H); | |
6211 | end loop; | |
6212 | end if; | |
996ae0b0 RK |
6213 | end; |
6214 | end if; | |
6215 | ||
6216 | if Nkind (Selector_Name (N)) = N_Operator_Symbol | |
6217 | and then Scope (Id) /= Standard_Standard | |
6218 | then | |
16ca248a ES |
6219 | -- In addition to user-defined operators in the given scope, there |
6220 | -- may be an implicit instance of the predefined operator. The | |
6221 | -- operator (defined in Standard) is found in Has_Implicit_Operator, | |
6222 | -- and added to the interpretations. Procedure Add_One_Interp will | |
6223 | -- determine which hides which. | |
996ae0b0 RK |
6224 | |
6225 | if Has_Implicit_Operator (N) then | |
6226 | null; | |
6227 | end if; | |
6228 | end if; | |
be4c5193 AC |
6229 | |
6230 | -- If there is a single interpretation for N we can generate a | |
6231 | -- reference to the unique entity found. | |
6232 | ||
6233 | if Is_Overloadable (Id) and then not Is_Overloaded (N) then | |
6234 | Generate_Reference (Id, N); | |
6235 | end if; | |
996ae0b0 RK |
6236 | end Find_Expanded_Name; |
6237 | ||
6238 | ------------------------- | |
6239 | -- Find_Renamed_Entity -- | |
6240 | ------------------------- | |
6241 | ||
6242 | function Find_Renamed_Entity | |
6243 | (N : Node_Id; | |
6244 | Nam : Node_Id; | |
6245 | New_S : Entity_Id; | |
6246 | Is_Actual : Boolean := False) return Entity_Id | |
6247 | is | |
fbf5a39b | 6248 | Ind : Interp_Index; |
996ae0b0 RK |
6249 | I1 : Interp_Index := 0; -- Suppress junk warnings |
6250 | It : Interp; | |
6251 | It1 : Interp; | |
6252 | Old_S : Entity_Id; | |
6253 | Inst : Entity_Id; | |
6254 | ||
996ae0b0 RK |
6255 | function Is_Visible_Operation (Op : Entity_Id) return Boolean; |
6256 | -- If the renamed entity is an implicit operator, check whether it is | |
16ca248a ES |
6257 | -- visible because its operand type is properly visible. This check |
6258 | -- applies to explicit renamed entities that appear in the source in a | |
6259 | -- renaming declaration or a formal subprogram instance, but not to | |
6260 | -- default generic actuals with a name. | |
996ae0b0 | 6261 | |
923fa078 RD |
6262 | function Report_Overload return Entity_Id; |
6263 | -- List possible interpretations, and specialize message in the | |
6264 | -- case of a generic actual. | |
6265 | ||
6266 | function Within (Inner, Outer : Entity_Id) return Boolean; | |
16ca248a ES |
6267 | -- Determine whether a candidate subprogram is defined within the |
6268 | -- enclosing instance. If yes, it has precedence over outer candidates. | |
923fa078 | 6269 | |
996ae0b0 RK |
6270 | -------------------------- |
6271 | -- Is_Visible_Operation -- | |
6272 | -------------------------- | |
6273 | ||
6274 | function Is_Visible_Operation (Op : Entity_Id) return Boolean is | |
6275 | Scop : Entity_Id; | |
6276 | Typ : Entity_Id; | |
6277 | Btyp : Entity_Id; | |
6278 | ||
6279 | begin | |
6280 | if Ekind (Op) /= E_Operator | |
6281 | or else Scope (Op) /= Standard_Standard | |
6282 | or else (In_Instance | |
ac7d724d ES |
6283 | and then (not Is_Actual |
6284 | or else Present (Enclosing_Instance))) | |
996ae0b0 RK |
6285 | then |
6286 | return True; | |
6287 | ||
6288 | else | |
6289 | -- For a fixed point type operator, check the resulting type, | |
6290 | -- because it may be a mixed mode integer * fixed operation. | |
6291 | ||
6292 | if Present (Next_Formal (First_Formal (New_S))) | |
6293 | and then Is_Fixed_Point_Type (Etype (New_S)) | |
6294 | then | |
6295 | Typ := Etype (New_S); | |
6296 | else | |
6297 | Typ := Etype (First_Formal (New_S)); | |
6298 | end if; | |
6299 | ||
6300 | Btyp := Base_Type (Typ); | |
6301 | ||
6302 | if Nkind (Nam) /= N_Expanded_Name then | |
6303 | return (In_Open_Scopes (Scope (Btyp)) | |
6304 | or else Is_Potentially_Use_Visible (Btyp) | |
6305 | or else In_Use (Btyp) | |
6306 | or else In_Use (Scope (Btyp))); | |
6307 | ||
6308 | else | |
6309 | Scop := Entity (Prefix (Nam)); | |
6310 | ||
6311 | if Ekind (Scop) = E_Package | |
6312 | and then Present (Renamed_Object (Scop)) | |
6313 | then | |
6314 | Scop := Renamed_Object (Scop); | |
6315 | end if; | |
6316 | ||
6317 | -- Operator is visible if prefix of expanded name denotes | |
16b05213 | 6318 | -- scope of type, or else type is defined in System_Aux |
996ae0b0 RK |
6319 | -- and the prefix denotes System. |
6320 | ||
6321 | return Scope (Btyp) = Scop | |
6322 | or else (Scope (Btyp) = System_Aux_Id | |
6323 | and then Scope (Scope (Btyp)) = Scop); | |
6324 | end if; | |
6325 | end if; | |
6326 | end Is_Visible_Operation; | |
6327 | ||
6328 | ------------ | |
6329 | -- Within -- | |
6330 | ------------ | |
6331 | ||
6332 | function Within (Inner, Outer : Entity_Id) return Boolean is | |
16ca248a | 6333 | Sc : Entity_Id; |
996ae0b0 RK |
6334 | |
6335 | begin | |
16ca248a | 6336 | Sc := Scope (Inner); |
996ae0b0 | 6337 | while Sc /= Standard_Standard loop |
996ae0b0 RK |
6338 | if Sc = Outer then |
6339 | return True; | |
6340 | else | |
6341 | Sc := Scope (Sc); | |
6342 | end if; | |
6343 | end loop; | |
6344 | ||
6345 | return False; | |
6346 | end Within; | |
6347 | ||
923fa078 RD |
6348 | --------------------- |
6349 | -- Report_Overload -- | |
6350 | --------------------- | |
fbf5a39b AC |
6351 | |
6352 | function Report_Overload return Entity_Id is | |
6353 | begin | |
6354 | if Is_Actual then | |
ed2233dc | 6355 | Error_Msg_NE -- CODEFIX |
fbf5a39b | 6356 | ("ambiguous actual subprogram&, " & |
923fa078 | 6357 | "possible interpretations:", N, Nam); |
fbf5a39b | 6358 | else |
ed2233dc | 6359 | Error_Msg_N -- CODEFIX |
fbf5a39b | 6360 | ("ambiguous subprogram, " & |
923fa078 | 6361 | "possible interpretations:", N); |
fbf5a39b AC |
6362 | end if; |
6363 | ||
6364 | List_Interps (Nam, N); | |
6365 | return Old_S; | |
6366 | end Report_Overload; | |
6367 | ||
0187b60e | 6368 | -- Start of processing for Find_Renamed_Entity |
996ae0b0 RK |
6369 | |
6370 | begin | |
6371 | Old_S := Any_Id; | |
6372 | Candidate_Renaming := Empty; | |
6373 | ||
fc193526 | 6374 | if Is_Overloaded (Nam) then |
fbf5a39b | 6375 | Get_First_Interp (Nam, Ind, It); |
996ae0b0 | 6376 | while Present (It.Nam) loop |
996ae0b0 | 6377 | if Entity_Matches_Spec (It.Nam, New_S) |
fc193526 | 6378 | and then Is_Visible_Operation (It.Nam) |
996ae0b0 RK |
6379 | then |
6380 | if Old_S /= Any_Id then | |
6381 | ||
6382 | -- Note: The call to Disambiguate only happens if a | |
6383 | -- previous interpretation was found, in which case I1 | |
6384 | -- has received a value. | |
6385 | ||
fbf5a39b | 6386 | It1 := Disambiguate (Nam, I1, Ind, Etype (Old_S)); |
996ae0b0 RK |
6387 | |
6388 | if It1 = No_Interp then | |
996ae0b0 RK |
6389 | Inst := Enclosing_Instance; |
6390 | ||
6391 | if Present (Inst) then | |
996ae0b0 | 6392 | if Within (It.Nam, Inst) then |
444acbdd AC |
6393 | if Within (Old_S, Inst) then |
6394 | ||
6395 | -- Choose the innermost subprogram, which would | |
6396 | -- have hidden the outer one in the generic. | |
6397 | ||
6398 | if Scope_Depth (It.Nam) < | |
6399 | Scope_Depth (Old_S) | |
6400 | then | |
6401 | return Old_S; | |
444acbdd AC |
6402 | else |
6403 | return It.Nam; | |
6404 | end if; | |
6405 | end if; | |
6406 | ||
996ae0b0 RK |
6407 | elsif Within (Old_S, Inst) then |
6408 | return (Old_S); | |
444acbdd | 6409 | |
996ae0b0 | 6410 | else |
fbf5a39b | 6411 | return Report_Overload; |
996ae0b0 RK |
6412 | end if; |
6413 | ||
3ddd922e | 6414 | -- If not within an instance, ambiguity is real |
444acbdd | 6415 | |
996ae0b0 | 6416 | else |
fbf5a39b | 6417 | return Report_Overload; |
996ae0b0 RK |
6418 | end if; |
6419 | ||
6420 | else | |
6421 | Old_S := It1.Nam; | |
6422 | exit; | |
6423 | end if; | |
6424 | ||
6425 | else | |
fbf5a39b | 6426 | I1 := Ind; |
996ae0b0 RK |
6427 | Old_S := It.Nam; |
6428 | end if; | |
6429 | ||
6430 | elsif | |
6431 | Present (First_Formal (It.Nam)) | |
6432 | and then Present (First_Formal (New_S)) | |
ac7d724d ES |
6433 | and then (Base_Type (Etype (First_Formal (It.Nam))) = |
6434 | Base_Type (Etype (First_Formal (New_S)))) | |
996ae0b0 RK |
6435 | then |
6436 | Candidate_Renaming := It.Nam; | |
6437 | end if; | |
6438 | ||
fbf5a39b | 6439 | Get_Next_Interp (Ind, It); |
996ae0b0 RK |
6440 | end loop; |
6441 | ||
6442 | Set_Entity (Nam, Old_S); | |
1138cf59 AC |
6443 | |
6444 | if Old_S /= Any_Id then | |
6445 | Set_Is_Overloaded (Nam, False); | |
6446 | end if; | |
fc193526 HK |
6447 | |
6448 | -- Non-overloaded case | |
6449 | ||
6450 | else | |
6451 | if Is_Actual and then Present (Enclosing_Instance) then | |
6452 | Old_S := Entity (Nam); | |
6453 | ||
6454 | elsif Entity_Matches_Spec (Entity (Nam), New_S) then | |
6455 | Candidate_Renaming := New_S; | |
6456 | ||
6457 | if Is_Visible_Operation (Entity (Nam)) then | |
6458 | Old_S := Entity (Nam); | |
6459 | end if; | |
6460 | ||
6461 | elsif Present (First_Formal (Entity (Nam))) | |
6462 | and then Present (First_Formal (New_S)) | |
6463 | and then (Base_Type (Etype (First_Formal (Entity (Nam)))) = | |
6464 | Base_Type (Etype (First_Formal (New_S)))) | |
6465 | then | |
6466 | Candidate_Renaming := Entity (Nam); | |
6467 | end if; | |
996ae0b0 RK |
6468 | end if; |
6469 | ||
6470 | return Old_S; | |
6471 | end Find_Renamed_Entity; | |
6472 | ||
6473 | ----------------------------- | |
6474 | -- Find_Selected_Component -- | |
6475 | ----------------------------- | |
6476 | ||
6477 | procedure Find_Selected_Component (N : Node_Id) is | |
fbf5a39b | 6478 | P : constant Node_Id := Prefix (N); |
996ae0b0 RK |
6479 | |
6480 | P_Name : Entity_Id; | |
6481 | -- Entity denoted by prefix | |
6482 | ||
6483 | P_Type : Entity_Id; | |
6484 | -- and its type | |
6485 | ||
6486 | Nam : Node_Id; | |
6487 | ||
95e00a3a ES |
6488 | function Available_Subtype return Boolean; |
6489 | -- A small optimization: if the prefix is constrained and the component | |
6490 | -- is an array type we may already have a usable subtype for it, so we | |
6491 | -- can use it rather than generating a new one, because the bounds | |
6492 | -- will be the values of the discriminants and not discriminant refs. | |
c9d70ab1 AC |
6493 | -- This simplifies value tracing in GNATProve. For consistency, both |
6494 | -- the entity name and the subtype come from the constrained component. | |
95e00a3a | 6495 | |
2e70d415 AC |
6496 | function Is_Reference_In_Subunit return Boolean; |
6497 | -- In a subunit, the scope depth is not a proper measure of hiding, | |
6498 | -- because the context of the proper body may itself hide entities in | |
6499 | -- parent units. This rare case requires inspecting the tree directly | |
6500 | -- because the proper body is inserted in the main unit and its context | |
6501 | -- is simply added to that of the parent. | |
6502 | ||
95e00a3a ES |
6503 | ----------------------- |
6504 | -- Available_Subtype -- | |
6505 | ----------------------- | |
6506 | ||
6507 | function Available_Subtype return Boolean is | |
6508 | Comp : Entity_Id; | |
c9d70ab1 | 6509 | |
95e00a3a ES |
6510 | begin |
6511 | Comp := First_Entity (Etype (P)); | |
6512 | while Present (Comp) loop | |
6513 | if Chars (Comp) = Chars (Selector_Name (N)) then | |
6514 | Set_Etype (N, Etype (Comp)); | |
c9d70ab1 AC |
6515 | Set_Entity (Selector_Name (N), Comp); |
6516 | Set_Etype (Selector_Name (N), Etype (Comp)); | |
95e00a3a ES |
6517 | return True; |
6518 | end if; | |
6519 | ||
6520 | Next_Component (Comp); | |
6521 | end loop; | |
6522 | ||
6523 | return False; | |
6524 | end Available_Subtype; | |
6525 | ||
2e70d415 AC |
6526 | ----------------------------- |
6527 | -- Is_Reference_In_Subunit -- | |
6528 | ----------------------------- | |
6529 | ||
6530 | function Is_Reference_In_Subunit return Boolean is | |
6531 | Clause : Node_Id; | |
6532 | Comp_Unit : Node_Id; | |
6533 | ||
6534 | begin | |
6535 | Comp_Unit := N; | |
6536 | while Present (Comp_Unit) | |
f5f6d8d7 | 6537 | and then Nkind (Comp_Unit) /= N_Compilation_Unit |
2e70d415 AC |
6538 | loop |
6539 | Comp_Unit := Parent (Comp_Unit); | |
6540 | end loop; | |
6541 | ||
f5f6d8d7 | 6542 | if No (Comp_Unit) or else Nkind (Unit (Comp_Unit)) /= N_Subunit then |
2e70d415 AC |
6543 | return False; |
6544 | end if; | |
6545 | ||
6546 | -- Now check whether the package is in the context of the subunit | |
6547 | ||
6548 | Clause := First (Context_Items (Comp_Unit)); | |
2e70d415 AC |
6549 | while Present (Clause) loop |
6550 | if Nkind (Clause) = N_With_Clause | |
6551 | and then Entity (Name (Clause)) = P_Name | |
6552 | then | |
6553 | return True; | |
6554 | end if; | |
6555 | ||
6556 | Clause := Next (Clause); | |
6557 | end loop; | |
6558 | ||
6559 | return False; | |
6560 | end Is_Reference_In_Subunit; | |
6561 | ||
f5f6d8d7 AC |
6562 | -- Start of processing for Find_Selected_Component |
6563 | ||
996ae0b0 RK |
6564 | begin |
6565 | Analyze (P); | |
6566 | ||
6567 | if Nkind (P) = N_Error then | |
6568 | return; | |
23685ae6 AC |
6569 | end if; |
6570 | ||
6571 | -- Selector name cannot be a character literal or an operator symbol in | |
db72f10a | 6572 | -- SPARK, except for the operator symbol in a renaming. |
23685ae6 | 6573 | |
6480338a | 6574 | if Restriction_Check_Required (SPARK_05) then |
23685ae6 | 6575 | if Nkind (Selector_Name (N)) = N_Character_Literal then |
ce5ba43a | 6576 | Check_SPARK_05_Restriction |
23685ae6 | 6577 | ("character literal cannot be prefixed", N); |
db72f10a AC |
6578 | elsif Nkind (Selector_Name (N)) = N_Operator_Symbol |
6579 | and then Nkind (Parent (N)) /= N_Subprogram_Renaming_Declaration | |
6580 | then | |
ce5ba43a AC |
6581 | Check_SPARK_05_Restriction |
6582 | ("operator symbol cannot be prefixed", N); | |
23685ae6 AC |
6583 | end if; |
6584 | end if; | |
996ae0b0 | 6585 | |
16ca248a ES |
6586 | -- If the selector already has an entity, the node has been constructed |
6587 | -- in the course of expansion, and is known to be valid. Do not verify | |
6588 | -- that it is defined for the type (it may be a private component used | |
6589 | -- in the expansion of record equality). | |
996ae0b0 | 6590 | |
23685ae6 | 6591 | if Present (Entity (Selector_Name (N))) then |
f5f6d8d7 | 6592 | if No (Etype (N)) or else Etype (N) = Any_Type then |
996ae0b0 | 6593 | declare |
fbf5a39b AC |
6594 | Sel_Name : constant Node_Id := Selector_Name (N); |
6595 | Selector : constant Entity_Id := Entity (Sel_Name); | |
996ae0b0 RK |
6596 | C_Etype : Node_Id; |
6597 | ||
6598 | begin | |
6599 | Set_Etype (Sel_Name, Etype (Selector)); | |
6600 | ||
6601 | if not Is_Entity_Name (P) then | |
fbf5a39b | 6602 | Resolve (P); |
996ae0b0 RK |
6603 | end if; |
6604 | ||
6605 | -- Build an actual subtype except for the first parameter | |
fbf5a39b | 6606 | -- of an init proc, where this actual subtype is by |
996ae0b0 RK |
6607 | -- definition incorrect, since the object is uninitialized |
6608 | -- (and does not even have defined discriminants etc.) | |
6609 | ||
6610 | if Is_Entity_Name (P) | |
6611 | and then Ekind (Entity (P)) = E_Function | |
6612 | then | |
6613 | Nam := New_Copy (P); | |
6614 | ||
6615 | if Is_Overloaded (P) then | |
6616 | Save_Interps (P, Nam); | |
6617 | end if; | |
6618 | ||
f5f6d8d7 | 6619 | Rewrite (P, Make_Function_Call (Sloc (P), Name => Nam)); |
996ae0b0 RK |
6620 | Analyze_Call (P); |
6621 | Analyze_Selected_Component (N); | |
6622 | return; | |
6623 | ||
6624 | elsif Ekind (Selector) = E_Component | |
6625 | and then (not Is_Entity_Name (P) | |
6626 | or else Chars (Entity (P)) /= Name_uInit) | |
6627 | then | |
5a271a7f RD |
6628 | -- Check if we already have an available subtype we can use |
6629 | ||
e0c23ac7 | 6630 | if Ekind (Etype (P)) = E_Record_Subtype |
95e00a3a ES |
6631 | and then Nkind (Parent (Etype (P))) = N_Subtype_Declaration |
6632 | and then Is_Array_Type (Etype (Selector)) | |
6633 | and then not Is_Packed (Etype (Selector)) | |
6634 | and then Available_Subtype | |
6635 | then | |
6636 | return; | |
6637 | ||
9fc2854d AC |
6638 | -- Do not build the subtype when referencing components of |
6639 | -- dispatch table wrappers. Required to avoid generating | |
df3e68b1 HK |
6640 | -- elaboration code with HI runtimes. JVM and .NET use a |
6641 | -- modified version of Ada.Tags which does not contain RE_ | |
6642 | -- Dispatch_Table_Wrapper and RE_No_Dispatch_Table_Wrapper. | |
6643 | -- Avoid raising RE_Not_Available exception in those cases. | |
9fc2854d | 6644 | |
95e00a3a | 6645 | elsif VM_Target = No_VM |
df3e68b1 HK |
6646 | and then RTU_Loaded (Ada_Tags) |
6647 | and then | |
6648 | ((RTE_Available (RE_Dispatch_Table_Wrapper) | |
2c1b72d7 | 6649 | and then Scope (Selector) = |
df3e68b1 | 6650 | RTE (RE_Dispatch_Table_Wrapper)) |
f5f6d8d7 AC |
6651 | or else |
6652 | (RTE_Available (RE_No_Dispatch_Table_Wrapper) | |
6653 | and then Scope (Selector) = | |
6654 | RTE (RE_No_Dispatch_Table_Wrapper))) | |
9fc2854d AC |
6655 | then |
6656 | C_Etype := Empty; | |
9fc2854d AC |
6657 | else |
6658 | C_Etype := | |
2c1b72d7 AC |
6659 | Build_Actual_Subtype_Of_Component |
6660 | (Etype (Selector), N); | |
9fc2854d AC |
6661 | end if; |
6662 | ||
996ae0b0 RK |
6663 | else |
6664 | C_Etype := Empty; | |
6665 | end if; | |
6666 | ||
6667 | if No (C_Etype) then | |
6668 | C_Etype := Etype (Selector); | |
6669 | else | |
6670 | Insert_Action (N, C_Etype); | |
6671 | C_Etype := Defining_Identifier (C_Etype); | |
6672 | end if; | |
6673 | ||
6674 | Set_Etype (N, C_Etype); | |
6675 | end; | |
6676 | ||
6677 | -- If this is the name of an entry or protected operation, and | |
6678 | -- the prefix is an access type, insert an explicit dereference, | |
6679 | -- so that entry calls are treated uniformly. | |
6680 | ||
6681 | if Is_Access_Type (Etype (P)) | |
6682 | and then Is_Concurrent_Type (Designated_Type (Etype (P))) | |
6683 | then | |
6684 | declare | |
fbf5a39b AC |
6685 | New_P : constant Node_Id := |
6686 | Make_Explicit_Dereference (Sloc (P), | |
6687 | Prefix => Relocate_Node (P)); | |
996ae0b0 RK |
6688 | begin |
6689 | Rewrite (P, New_P); | |
6690 | Set_Etype (P, Designated_Type (Etype (Prefix (P)))); | |
6691 | end; | |
6692 | end if; | |
6693 | ||
6694 | -- If the selected component appears within a default expression | |
6695 | -- and it has an actual subtype, the pre-analysis has not yet | |
6696 | -- completed its analysis, because Insert_Actions is disabled in | |
fbf5a39b | 6697 | -- that context. Within the init proc of the enclosing type we |
996ae0b0 RK |
6698 | -- must complete this analysis, if an actual subtype was created. |
6699 | ||
6700 | elsif Inside_Init_Proc then | |
6701 | declare | |
6702 | Typ : constant Entity_Id := Etype (N); | |
6703 | Decl : constant Node_Id := Declaration_Node (Typ); | |
996ae0b0 RK |
6704 | begin |
6705 | if Nkind (Decl) = N_Subtype_Declaration | |
6706 | and then not Analyzed (Decl) | |
6707 | and then Is_List_Member (Decl) | |
6708 | and then No (Parent (Decl)) | |
6709 | then | |
6710 | Remove (Decl); | |
6711 | Insert_Action (N, Decl); | |
6712 | end if; | |
6713 | end; | |
6714 | end if; | |
6715 | ||
6716 | return; | |
6717 | ||
6718 | elsif Is_Entity_Name (P) then | |
6719 | P_Name := Entity (P); | |
6720 | ||
6721 | -- The prefix may denote an enclosing type which is the completion | |
6722 | -- of an incomplete type declaration. | |
6723 | ||
6724 | if Is_Type (P_Name) then | |
6725 | Set_Entity (P, Get_Full_View (P_Name)); | |
6726 | Set_Etype (P, Entity (P)); | |
6727 | P_Name := Entity (P); | |
6728 | end if; | |
6729 | ||
6730 | P_Type := Base_Type (Etype (P)); | |
6731 | ||
6732 | if Debug_Flag_E then | |
6733 | Write_Str ("Found prefix type to be "); | |
6734 | Write_Entity_Info (P_Type, " "); Write_Eol; | |
6735 | end if; | |
6736 | ||
38cea80d ES |
6737 | -- The designated type may be a limited view with no components. |
6738 | -- Check whether the non-limited view is available, because in some | |
47346923 | 6739 | -- cases this will not be set when installing the context. |
38cea80d ES |
6740 | |
6741 | if Is_Access_Type (P_Type) then | |
6742 | declare | |
6743 | D : constant Entity_Id := Directly_Designated_Type (P_Type); | |
6744 | begin | |
6745 | if Is_Incomplete_Type (D) | |
38cea80d ES |
6746 | and then From_Limited_With (D) |
6747 | and then Present (Non_Limited_View (D)) | |
38cea80d ES |
6748 | then |
6749 | Set_Directly_Designated_Type (P_Type, Non_Limited_View (D)); | |
6750 | end if; | |
6751 | end; | |
6752 | end if; | |
6753 | ||
996ae0b0 RK |
6754 | -- First check for components of a record object (not the |
6755 | -- result of a call, which is handled below). | |
6756 | ||
6757 | if Is_Appropriate_For_Record (P_Type) | |
6758 | and then not Is_Overloadable (P_Name) | |
6759 | and then not Is_Type (P_Name) | |
6760 | then | |
6761 | -- Selected component of record. Type checking will validate | |
6762 | -- name of selector. | |
dbfeb4fa RD |
6763 | |
6764 | -- ??? Could we rewrite an implicit dereference into an explicit | |
11560bcc | 6765 | -- one here? |
996ae0b0 RK |
6766 | |
6767 | Analyze_Selected_Component (N); | |
6768 | ||
f6b5dc8e AC |
6769 | -- Reference to type name in predicate/invariant expression |
6770 | ||
996ae0b0 RK |
6771 | elsif Is_Appropriate_For_Entry_Prefix (P_Type) |
6772 | and then not In_Open_Scopes (P_Name) | |
6773 | and then (not Is_Concurrent_Type (Etype (P_Name)) | |
ac7d724d | 6774 | or else not In_Open_Scopes (Etype (P_Name))) |
996ae0b0 RK |
6775 | then |
6776 | -- Call to protected operation or entry. Type checking is | |
6777 | -- needed on the prefix. | |
6778 | ||
6779 | Analyze_Selected_Component (N); | |
6780 | ||
6781 | elsif (In_Open_Scopes (P_Name) | |
f6b5dc8e AC |
6782 | and then Ekind (P_Name) /= E_Void |
6783 | and then not Is_Overloadable (P_Name)) | |
996ae0b0 | 6784 | or else (Is_Concurrent_Type (Etype (P_Name)) |
f6b5dc8e | 6785 | and then In_Open_Scopes (Etype (P_Name))) |
996ae0b0 RK |
6786 | then |
6787 | -- Prefix denotes an enclosing loop, block, or task, i.e. an | |
6788 | -- enclosing construct that is not a subprogram or accept. | |
6789 | ||
6790 | Find_Expanded_Name (N); | |
6791 | ||
6792 | elsif Ekind (P_Name) = E_Package then | |
6793 | Find_Expanded_Name (N); | |
6794 | ||
6795 | elsif Is_Overloadable (P_Name) then | |
6796 | ||
6797 | -- The subprogram may be a renaming (of an enclosing scope) as | |
6798 | -- in the case of the name of the generic within an instantiation. | |
6799 | ||
f6b5dc8e | 6800 | if Ekind_In (P_Name, E_Procedure, E_Function) |
996ae0b0 RK |
6801 | and then Present (Alias (P_Name)) |
6802 | and then Is_Generic_Instance (Alias (P_Name)) | |
6803 | then | |
6804 | P_Name := Alias (P_Name); | |
6805 | end if; | |
6806 | ||
6807 | if Is_Overloaded (P) then | |
6808 | ||
bc41faa2 | 6809 | -- The prefix must resolve to a unique enclosing construct |
996ae0b0 RK |
6810 | |
6811 | declare | |
6812 | Found : Boolean := False; | |
fbf5a39b | 6813 | Ind : Interp_Index; |
996ae0b0 RK |
6814 | It : Interp; |
6815 | ||
6816 | begin | |
fbf5a39b | 6817 | Get_First_Interp (P, Ind, It); |
996ae0b0 | 6818 | while Present (It.Nam) loop |
996ae0b0 RK |
6819 | if In_Open_Scopes (It.Nam) then |
6820 | if Found then | |
6821 | Error_Msg_N ( | |
6822 | "prefix must be unique enclosing scope", N); | |
6823 | Set_Entity (N, Any_Id); | |
6824 | Set_Etype (N, Any_Type); | |
6825 | return; | |
6826 | ||
6827 | else | |
6828 | Found := True; | |
6829 | P_Name := It.Nam; | |
6830 | end if; | |
6831 | end if; | |
6832 | ||
fbf5a39b | 6833 | Get_Next_Interp (Ind, It); |
996ae0b0 RK |
6834 | end loop; |
6835 | end; | |
6836 | end if; | |
6837 | ||
6838 | if In_Open_Scopes (P_Name) then | |
6839 | Set_Entity (P, P_Name); | |
6840 | Set_Is_Overloaded (P, False); | |
6841 | Find_Expanded_Name (N); | |
6842 | ||
6843 | else | |
6844 | -- If no interpretation as an expanded name is possible, it | |
6845 | -- must be a selected component of a record returned by a | |
16ca248a | 6846 | -- function call. Reformat prefix as a function call, the rest |
2757c5bf AC |
6847 | -- is done by type resolution. |
6848 | ||
6849 | -- Error if the prefix is procedure or entry, as is P.X | |
996ae0b0 RK |
6850 | |
6851 | if Ekind (P_Name) /= E_Function | |
ac7d724d ES |
6852 | and then |
6853 | (not Is_Overloaded (P) | |
6854 | or else Nkind (Parent (N)) = N_Procedure_Call_Statement) | |
996ae0b0 | 6855 | then |
996ae0b0 | 6856 | -- Prefix may mention a package that is hidden by a local |
290986ed GB |
6857 | -- declaration: let the user know. Scan the full homonym |
6858 | -- chain, the candidate package may be anywhere on it. | |
996ae0b0 | 6859 | |
290986ed | 6860 | if Present (Homonym (Current_Entity (P_Name))) then |
290986ed | 6861 | P_Name := Current_Entity (P_Name); |
996ae0b0 RK |
6862 | |
6863 | while Present (P_Name) loop | |
6864 | exit when Ekind (P_Name) = E_Package; | |
6865 | P_Name := Homonym (P_Name); | |
6866 | end loop; | |
6867 | ||
6868 | if Present (P_Name) then | |
2e70d415 AC |
6869 | if not Is_Reference_In_Subunit then |
6870 | Error_Msg_Sloc := Sloc (Entity (Prefix (N))); | |
2e70d415 | 6871 | Error_Msg_NE |
f5f6d8d7 | 6872 | ("package& is hidden by declaration#", N, P_Name); |
2e70d415 | 6873 | end if; |
996ae0b0 RK |
6874 | |
6875 | Set_Entity (Prefix (N), P_Name); | |
6876 | Find_Expanded_Name (N); | |
6877 | return; | |
2757c5bf | 6878 | |
996ae0b0 RK |
6879 | else |
6880 | P_Name := Entity (Prefix (N)); | |
6881 | end if; | |
6882 | end if; | |
6883 | ||
6884 | Error_Msg_NE | |
6885 | ("invalid prefix in selected component&", N, P_Name); | |
6886 | Change_Selected_Component_To_Expanded_Name (N); | |
6887 | Set_Entity (N, Any_Id); | |
6888 | Set_Etype (N, Any_Type); | |
6889 | ||
2757c5bf AC |
6890 | -- Here we have a function call, so do the reformatting |
6891 | ||
996ae0b0 RK |
6892 | else |
6893 | Nam := New_Copy (P); | |
6894 | Save_Interps (P, Nam); | |
2757c5bf AC |
6895 | |
6896 | -- We use Replace here because this is one of those cases | |
6897 | -- where the parser has missclassified the node, and we | |
6898 | -- fix things up and then do the semantic analysis on the | |
6899 | -- fixed up node. Normally we do this using one of the | |
6900 | -- Sinfo.CN routines, but this is too tricky for that. | |
6901 | ||
6902 | -- Note that using Rewrite would be wrong, because we | |
6903 | -- would have a tree where the original node is unanalyzed, | |
6904 | -- and this violates the required interface for ASIS. | |
6905 | ||
6906 | Replace (P, | |
996ae0b0 | 6907 | Make_Function_Call (Sloc (P), Name => Nam)); |
2757c5bf AC |
6908 | |
6909 | -- Now analyze the reformatted node | |
6910 | ||
996ae0b0 RK |
6911 | Analyze_Call (P); |
6912 | Analyze_Selected_Component (N); | |
6913 | end if; | |
6914 | end if; | |
6915 | ||
6916 | -- Remaining cases generate various error messages | |
6917 | ||
6918 | else | |
6919 | -- Format node as expanded name, to avoid cascaded errors | |
6920 | ||
fbf5a39b | 6921 | Change_Selected_Component_To_Expanded_Name (N); |
996ae0b0 RK |
6922 | Set_Entity (N, Any_Id); |
6923 | Set_Etype (N, Any_Type); | |
6924 | ||
996ae0b0 RK |
6925 | -- Issue error message, but avoid this if error issued already. |
6926 | -- Use identifier of prefix if one is available. | |
6927 | ||
6928 | if P_Name = Any_Id then | |
6929 | null; | |
6930 | ||
6931 | elsif Ekind (P_Name) = E_Void then | |
6932 | Premature_Usage (P); | |
6933 | ||
6934 | elsif Nkind (P) /= N_Attribute_Reference then | |
67c0e662 RD |
6935 | |
6936 | -- This may have been meant as a prefixed call to a primitive | |
6937 | -- of an untagged type. | |
6938 | ||
6939 | declare | |
6940 | F : constant Entity_Id := | |
6941 | Current_Entity (Selector_Name (N)); | |
6942 | begin | |
6943 | if Present (F) | |
6944 | and then Is_Overloadable (F) | |
6945 | and then Present (First_Entity (F)) | |
6946 | and then Etype (First_Entity (F)) = Etype (P) | |
6947 | and then not Is_Tagged_Type (Etype (P)) | |
6948 | then | |
6949 | Error_Msg_N | |
6950 | ("prefixed call is only allowed for objects " | |
6951 | & "of a tagged type", N); | |
6952 | end if; | |
6953 | end; | |
6954 | ||
6955 | Error_Msg_N ("invalid prefix in selected component&", P); | |
996ae0b0 | 6956 | |
9596236a AC |
6957 | if Is_Access_Type (P_Type) |
6958 | and then Ekind (Designated_Type (P_Type)) = E_Incomplete_Type | |
6959 | then | |
65356e64 | 6960 | Error_Msg_N |
67c0e662 RD |
6961 | ("\dereference must not be of an incomplete type " |
6962 | & "(RM 3.10.1)", P); | |
9596236a AC |
6963 | end if; |
6964 | ||
996ae0b0 | 6965 | else |
67c0e662 | 6966 | Error_Msg_N ("invalid prefix in selected component", P); |
996ae0b0 RK |
6967 | end if; |
6968 | end if; | |
6969 | ||
db72f10a AC |
6970 | -- Selector name is restricted in SPARK |
6971 | ||
6972 | if Nkind (N) = N_Expanded_Name | |
6480338a | 6973 | and then Restriction_Check_Required (SPARK_05) |
db72f10a AC |
6974 | then |
6975 | if Is_Subprogram (P_Name) then | |
ce5ba43a | 6976 | Check_SPARK_05_Restriction |
db72f10a AC |
6977 | ("prefix of expanded name cannot be a subprogram", P); |
6978 | elsif Ekind (P_Name) = E_Loop then | |
ce5ba43a | 6979 | Check_SPARK_05_Restriction |
db72f10a AC |
6980 | ("prefix of expanded name cannot be a loop statement", P); |
6981 | end if; | |
6982 | end if; | |
6983 | ||
996ae0b0 RK |
6984 | else |
6985 | -- If prefix is not the name of an entity, it must be an expression, | |
6986 | -- whose type is appropriate for a record. This is determined by | |
6987 | -- type resolution. | |
6988 | ||
6989 | Analyze_Selected_Component (N); | |
6990 | end if; | |
0929eaeb AC |
6991 | |
6992 | Analyze_Dimension (N); | |
996ae0b0 RK |
6993 | end Find_Selected_Component; |
6994 | ||
6995 | --------------- | |
6996 | -- Find_Type -- | |
6997 | --------------- | |
6998 | ||
6999 | procedure Find_Type (N : Node_Id) is | |
7000 | C : Entity_Id; | |
7001 | Typ : Entity_Id; | |
7002 | T : Entity_Id; | |
7003 | T_Name : Entity_Id; | |
7004 | ||
7005 | begin | |
7006 | if N = Error then | |
7007 | return; | |
7008 | ||
7009 | elsif Nkind (N) = N_Attribute_Reference then | |
7010 | ||
11560bcc TQ |
7011 | -- Class attribute. This is not valid in Ada 83 mode, but we do not |
7012 | -- need to enforce that at this point, since the declaration of the | |
7013 | -- tagged type in the prefix would have been flagged already. | |
996ae0b0 RK |
7014 | |
7015 | if Attribute_Name (N) = Name_Class then | |
7016 | Check_Restriction (No_Dispatch, N); | |
7017 | Find_Type (Prefix (N)); | |
7018 | ||
7019 | -- Propagate error from bad prefix | |
7020 | ||
7021 | if Etype (Prefix (N)) = Any_Type then | |
7022 | Set_Entity (N, Any_Type); | |
7023 | Set_Etype (N, Any_Type); | |
7024 | return; | |
7025 | end if; | |
7026 | ||
7027 | T := Base_Type (Entity (Prefix (N))); | |
7028 | ||
11560bcc TQ |
7029 | -- Case where type is not known to be tagged. Its appearance in |
7030 | -- the prefix of the 'Class attribute indicates that the full view | |
16ca248a | 7031 | -- will be tagged. |
996ae0b0 RK |
7032 | |
7033 | if not Is_Tagged_Type (T) then | |
7034 | if Ekind (T) = E_Incomplete_Type then | |
7035 | ||
7036 | -- It is legal to denote the class type of an incomplete | |
7037 | -- type. The full type will have to be tagged, of course. | |
90067a15 | 7038 | -- In Ada 2005 this usage is declared obsolescent, so we |
ae247488 ES |
7039 | -- warn accordingly. This usage is only legal if the type |
7040 | -- is completed in the current scope, and not for a limited | |
7041 | -- view of a type. | |
7042 | ||
2f7b7467 AC |
7043 | if Ada_Version >= Ada_2005 then |
7044 | ||
7045 | -- Test whether the Available_View of a limited type view | |
7046 | -- is tagged, since the limited view may not be marked as | |
7047 | -- tagged if the type itself has an untagged incomplete | |
7048 | -- type view in its package. | |
7049 | ||
7b56a91b | 7050 | if From_Limited_With (T) |
2f7b7467 AC |
7051 | and then not Is_Tagged_Type (Available_View (T)) |
7052 | then | |
ae247488 ES |
7053 | Error_Msg_N |
7054 | ("prefix of Class attribute must be tagged", N); | |
7055 | Set_Etype (N, Any_Type); | |
7056 | Set_Entity (N, Any_Type); | |
7057 | return; | |
11560bcc | 7058 | |
dbfeb4fa RD |
7059 | -- ??? This test is temporarily disabled (always |
7060 | -- False) because it causes an unwanted warning on | |
7061 | -- GNAT sources (built with -gnatg, which includes | |
7062 | -- Warn_On_Obsolescent_ Feature). Once this issue | |
7063 | -- is cleared in the sources, it can be enabled. | |
11560bcc | 7064 | |
ac7d724d | 7065 | elsif Warn_On_Obsolescent_Feature and then False then |
ae247488 ES |
7066 | Error_Msg_N |
7067 | ("applying 'Class to an untagged incomplete type" | |
dbfeb4fa | 7068 | & " is an obsolescent feature (RM J.11)?r?", N); |
ae247488 | 7069 | end if; |
11560bcc | 7070 | end if; |
996ae0b0 RK |
7071 | |
7072 | Set_Is_Tagged_Type (T); | |
ef2a63ba | 7073 | Set_Direct_Primitive_Operations (T, New_Elmt_List); |
996ae0b0 RK |
7074 | Make_Class_Wide_Type (T); |
7075 | Set_Entity (N, Class_Wide_Type (T)); | |
7076 | Set_Etype (N, Class_Wide_Type (T)); | |
7077 | ||
7078 | elsif Ekind (T) = E_Private_Type | |
7079 | and then not Is_Generic_Type (T) | |
7080 | and then In_Private_Part (Scope (T)) | |
7081 | then | |
16ca248a ES |
7082 | -- The Class attribute can be applied to an untagged private |
7083 | -- type fulfilled by a tagged type prior to the full type | |
7084 | -- declaration (but only within the parent package's private | |
7085 | -- part). Create the class-wide type now and check that the | |
7086 | -- full type is tagged later during its analysis. Note that | |
7087 | -- we do not mark the private type as tagged, unlike the | |
7088 | -- case of incomplete types, because the type must still | |
996ae0b0 RK |
7089 | -- appear untagged to outside units. |
7090 | ||
cdc8c54c | 7091 | if No (Class_Wide_Type (T)) then |
996ae0b0 RK |
7092 | Make_Class_Wide_Type (T); |
7093 | end if; | |
7094 | ||
7095 | Set_Entity (N, Class_Wide_Type (T)); | |
7096 | Set_Etype (N, Class_Wide_Type (T)); | |
7097 | ||
7098 | else | |
16ca248a ES |
7099 | -- Should we introduce a type Any_Tagged and use Wrong_Type |
7100 | -- here, it would be a bit more consistent??? | |
996ae0b0 RK |
7101 | |
7102 | Error_Msg_NE | |
7103 | ("tagged type required, found}", | |
7104 | Prefix (N), First_Subtype (T)); | |
7105 | Set_Entity (N, Any_Type); | |
7106 | return; | |
7107 | end if; | |
7108 | ||
7109 | -- Case of tagged type | |
7110 | ||
7111 | else | |
39edfb45 | 7112 | if Is_Concurrent_Type (T) then |
cdc8c54c BD |
7113 | if No (Corresponding_Record_Type (Entity (Prefix (N)))) then |
7114 | ||
7115 | -- Previous error. Use current type, which at least | |
7116 | -- provides some operations. | |
7117 | ||
7118 | C := Entity (Prefix (N)); | |
7119 | ||
7120 | else | |
7121 | C := Class_Wide_Type | |
7122 | (Corresponding_Record_Type (Entity (Prefix (N)))); | |
7123 | end if; | |
7124 | ||
39edfb45 JM |
7125 | else |
7126 | C := Class_Wide_Type (Entity (Prefix (N))); | |
7127 | end if; | |
7128 | ||
e7ba564f | 7129 | Set_Entity_With_Checks (N, C); |
996ae0b0 RK |
7130 | Generate_Reference (C, N); |
7131 | Set_Etype (N, C); | |
996ae0b0 RK |
7132 | end if; |
7133 | ||
0ab80019 | 7134 | -- Base attribute, not allowed in Ada 83 |
996ae0b0 RK |
7135 | |
7136 | elsif Attribute_Name (N) = Name_Base then | |
7a489a2b | 7137 | Error_Msg_Name_1 := Name_Base; |
ce5ba43a | 7138 | Check_SPARK_05_Restriction |
7a489a2b AC |
7139 | ("attribute% is only allowed as prefix of another attribute", N); |
7140 | ||
0ab80019 | 7141 | if Ada_Version = Ada_83 and then Comes_From_Source (N) then |
996ae0b0 RK |
7142 | Error_Msg_N |
7143 | ("(Ada 83) Base attribute not allowed in subtype mark", N); | |
7144 | ||
7145 | else | |
7146 | Find_Type (Prefix (N)); | |
7147 | Typ := Entity (Prefix (N)); | |
7148 | ||
0ab80019 | 7149 | if Ada_Version >= Ada_95 |
fbf5a39b AC |
7150 | and then not Is_Scalar_Type (Typ) |
7151 | and then not Is_Generic_Type (Typ) | |
7152 | then | |
7153 | Error_Msg_N | |
bc41faa2 AC |
7154 | ("prefix of Base attribute must be scalar type", |
7155 | Prefix (N)); | |
fbf5a39b | 7156 | |
a8930b80 | 7157 | elsif Warn_On_Redundant_Constructs |
996ae0b0 | 7158 | and then Base_Type (Typ) = Typ |
996ae0b0 | 7159 | then |
ed2233dc | 7160 | Error_Msg_NE -- CODEFIX |
dbfeb4fa | 7161 | ("redundant attribute, & is its own base type?r?", N, Typ); |
996ae0b0 RK |
7162 | end if; |
7163 | ||
7164 | T := Base_Type (Typ); | |
996ae0b0 RK |
7165 | |
7166 | -- Rewrite attribute reference with type itself (see similar | |
a8930b80 AC |
7167 | -- processing in Analyze_Attribute, case Base). Preserve prefix |
7168 | -- if present, for other legality checks. | |
fbf5a39b AC |
7169 | |
7170 | if Nkind (Prefix (N)) = N_Expanded_Name then | |
7171 | Rewrite (N, | |
7172 | Make_Expanded_Name (Sloc (N), | |
11560bcc TQ |
7173 | Chars => Chars (T), |
7174 | Prefix => New_Copy (Prefix (Prefix (N))), | |
e4494292 | 7175 | Selector_Name => New_Occurrence_Of (T, Sloc (N)))); |
996ae0b0 | 7176 | |
fbf5a39b | 7177 | else |
e4494292 | 7178 | Rewrite (N, New_Occurrence_Of (T, Sloc (N))); |
fbf5a39b AC |
7179 | end if; |
7180 | ||
7181 | Set_Entity (N, T); | |
996ae0b0 RK |
7182 | Set_Etype (N, T); |
7183 | end if; | |
7184 | ||
923fa078 RD |
7185 | elsif Attribute_Name (N) = Name_Stub_Type then |
7186 | ||
7187 | -- This is handled in Analyze_Attribute | |
7188 | ||
7189 | Analyze (N); | |
7190 | ||
996ae0b0 RK |
7191 | -- All other attributes are invalid in a subtype mark |
7192 | ||
7193 | else | |
7194 | Error_Msg_N ("invalid attribute in subtype mark", N); | |
7195 | end if; | |
7196 | ||
7197 | else | |
7198 | Analyze (N); | |
7199 | ||
7200 | if Is_Entity_Name (N) then | |
7201 | T_Name := Entity (N); | |
7202 | else | |
7203 | Error_Msg_N ("subtype mark required in this context", N); | |
7204 | Set_Etype (N, Any_Type); | |
7205 | return; | |
7206 | end if; | |
7207 | ||
7208 | if T_Name = Any_Id or else Etype (N) = Any_Type then | |
7209 | ||
7210 | -- Undefined id. Make it into a valid type | |
7211 | ||
7212 | Set_Entity (N, Any_Type); | |
7213 | ||
7214 | elsif not Is_Type (T_Name) | |
7215 | and then T_Name /= Standard_Void_Type | |
7216 | then | |
7217 | Error_Msg_Sloc := Sloc (T_Name); | |
7218 | Error_Msg_N ("subtype mark required in this context", N); | |
923fa078 | 7219 | Error_Msg_NE ("\\found & declared#", N, T_Name); |
996ae0b0 RK |
7220 | Set_Entity (N, Any_Type); |
7221 | ||
7222 | else | |
11560bcc TQ |
7223 | -- If the type is an incomplete type created to handle |
7224 | -- anonymous access components of a record type, then the | |
7225 | -- incomplete type is the visible entity and subsequent | |
7226 | -- references will point to it. Mark the original full | |
7227 | -- type as referenced, to prevent spurious warnings. | |
7228 | ||
7229 | if Is_Incomplete_Type (T_Name) | |
7230 | and then Present (Full_View (T_Name)) | |
7231 | and then not Comes_From_Source (T_Name) | |
7232 | then | |
7233 | Set_Referenced (Full_View (T_Name)); | |
7234 | end if; | |
7235 | ||
996ae0b0 RK |
7236 | T_Name := Get_Full_View (T_Name); |
7237 | ||
11560bcc TQ |
7238 | -- Ada 2005 (AI-251, AI-50217): Handle interfaces visible through |
7239 | -- limited-with clauses | |
7240 | ||
7b56a91b | 7241 | if From_Limited_With (T_Name) |
11560bcc TQ |
7242 | and then Ekind (T_Name) in Incomplete_Kind |
7243 | and then Present (Non_Limited_View (T_Name)) | |
7244 | and then Is_Interface (Non_Limited_View (T_Name)) | |
7245 | then | |
7246 | T_Name := Non_Limited_View (T_Name); | |
7247 | end if; | |
7248 | ||
996ae0b0 RK |
7249 | if In_Open_Scopes (T_Name) then |
7250 | if Ekind (Base_Type (T_Name)) = E_Task_Type then | |
923fa078 RD |
7251 | |
7252 | -- In Ada 2005, a task name can be used in an access | |
e264efcc AC |
7253 | -- definition within its own body. It cannot be used |
7254 | -- in the discriminant part of the task declaration, | |
7255 | -- nor anywhere else in the declaration because entries | |
7256 | -- cannot have access parameters. | |
923fa078 | 7257 | |
0791fbe9 | 7258 | if Ada_Version >= Ada_2005 |
923fa078 RD |
7259 | and then Nkind (Parent (N)) = N_Access_Definition |
7260 | then | |
7261 | Set_Entity (N, T_Name); | |
7262 | Set_Etype (N, T_Name); | |
e264efcc AC |
7263 | |
7264 | if Has_Completion (T_Name) then | |
7265 | return; | |
7266 | ||
7267 | else | |
7268 | Error_Msg_N | |
7269 | ("task type cannot be used as type mark " & | |
7270 | "within its own declaration", N); | |
7271 | end if; | |
923fa078 RD |
7272 | |
7273 | else | |
7274 | Error_Msg_N | |
7275 | ("task type cannot be used as type mark " & | |
fbe627af | 7276 | "within its own spec or body", N); |
923fa078 | 7277 | end if; |
fbe627af RD |
7278 | |
7279 | elsif Ekind (Base_Type (T_Name)) = E_Protected_Type then | |
7280 | ||
7281 | -- In Ada 2005, a protected name can be used in an access | |
7282 | -- definition within its own body. | |
7283 | ||
0791fbe9 | 7284 | if Ada_Version >= Ada_2005 |
fbe627af RD |
7285 | and then Nkind (Parent (N)) = N_Access_Definition |
7286 | then | |
7287 | Set_Entity (N, T_Name); | |
7288 | Set_Etype (N, T_Name); | |
7289 | return; | |
7290 | ||
7291 | else | |
7292 | Error_Msg_N | |
7293 | ("protected type cannot be used as type mark " & | |
7294 | "within its own spec or body", N); | |
7295 | end if; | |
7296 | ||
996ae0b0 RK |
7297 | else |
7298 | Error_Msg_N ("type declaration cannot refer to itself", N); | |
7299 | end if; | |
7300 | ||
7301 | Set_Etype (N, Any_Type); | |
7302 | Set_Entity (N, Any_Type); | |
7303 | Set_Error_Posted (T_Name); | |
7304 | return; | |
7305 | end if; | |
7306 | ||
7307 | Set_Entity (N, T_Name); | |
7308 | Set_Etype (N, T_Name); | |
7309 | end if; | |
7310 | end if; | |
7311 | ||
07fc65c4 | 7312 | if Present (Etype (N)) and then Comes_From_Source (N) then |
996ae0b0 RK |
7313 | if Is_Fixed_Point_Type (Etype (N)) then |
7314 | Check_Restriction (No_Fixed_Point, N); | |
7315 | elsif Is_Floating_Point_Type (Etype (N)) then | |
7316 | Check_Restriction (No_Floating_Point, N); | |
7317 | end if; | |
8636f52f HK |
7318 | |
7319 | -- A Ghost type must appear in a specific context | |
7320 | ||
7321 | if Is_Ghost_Entity (Etype (N)) then | |
7322 | Check_Ghost_Context (Etype (N), N); | |
7323 | end if; | |
996ae0b0 RK |
7324 | end if; |
7325 | end Find_Type; | |
7326 | ||
996ae0b0 RK |
7327 | ------------------------------------ |
7328 | -- Has_Implicit_Character_Literal -- | |
7329 | ------------------------------------ | |
7330 | ||
7331 | function Has_Implicit_Character_Literal (N : Node_Id) return Boolean is | |
7332 | Id : Entity_Id; | |
7333 | Found : Boolean := False; | |
7334 | P : constant Entity_Id := Entity (Prefix (N)); | |
7335 | Priv_Id : Entity_Id := Empty; | |
7336 | ||
7337 | begin | |
ac7d724d | 7338 | if Ekind (P) = E_Package and then not In_Open_Scopes (P) then |
996ae0b0 RK |
7339 | Priv_Id := First_Private_Entity (P); |
7340 | end if; | |
7341 | ||
7342 | if P = Standard_Standard then | |
7343 | Change_Selected_Component_To_Expanded_Name (N); | |
7344 | Rewrite (N, Selector_Name (N)); | |
7345 | Analyze (N); | |
7346 | Set_Etype (Original_Node (N), Standard_Character); | |
7347 | return True; | |
7348 | end if; | |
7349 | ||
7350 | Id := First_Entity (P); | |
ac7d724d | 7351 | while Present (Id) and then Id /= Priv_Id loop |
d347f572 AC |
7352 | if Is_Standard_Character_Type (Id) and then Is_Base_Type (Id) then |
7353 | ||
996ae0b0 RK |
7354 | -- We replace the node with the literal itself, resolve as a |
7355 | -- character, and set the type correctly. | |
7356 | ||
7357 | if not Found then | |
7358 | Change_Selected_Component_To_Expanded_Name (N); | |
7359 | Rewrite (N, Selector_Name (N)); | |
7360 | Analyze (N); | |
7361 | Set_Etype (N, Id); | |
7362 | Set_Etype (Original_Node (N), Id); | |
7363 | Found := True; | |
7364 | ||
7365 | else | |
7366 | -- More than one type derived from Character in given scope. | |
7367 | -- Collect all possible interpretations. | |
7368 | ||
7369 | Add_One_Interp (N, Id, Id); | |
7370 | end if; | |
7371 | end if; | |
7372 | ||
7373 | Next_Entity (Id); | |
7374 | end loop; | |
7375 | ||
7376 | return Found; | |
7377 | end Has_Implicit_Character_Literal; | |
7378 | ||
9bc856dd AC |
7379 | ---------------------- |
7380 | -- Has_Private_With -- | |
7381 | ---------------------- | |
7382 | ||
7383 | function Has_Private_With (E : Entity_Id) return Boolean is | |
7384 | Comp_Unit : constant Node_Id := Cunit (Current_Sem_Unit); | |
7385 | Item : Node_Id; | |
7386 | ||
7387 | begin | |
7388 | Item := First (Context_Items (Comp_Unit)); | |
7389 | while Present (Item) loop | |
7390 | if Nkind (Item) = N_With_Clause | |
7391 | and then Private_Present (Item) | |
7392 | and then Entity (Name (Item)) = E | |
7393 | then | |
7394 | return True; | |
7395 | end if; | |
7396 | ||
7397 | Next (Item); | |
7398 | end loop; | |
7399 | ||
7400 | return False; | |
7401 | end Has_Private_With; | |
7402 | ||
996ae0b0 RK |
7403 | --------------------------- |
7404 | -- Has_Implicit_Operator -- | |
7405 | --------------------------- | |
7406 | ||
7407 | function Has_Implicit_Operator (N : Node_Id) return Boolean is | |
7408 | Op_Id : constant Name_Id := Chars (Selector_Name (N)); | |
7409 | P : constant Entity_Id := Entity (Prefix (N)); | |
7410 | Id : Entity_Id; | |
7411 | Priv_Id : Entity_Id := Empty; | |
7412 | ||
fbf5a39b AC |
7413 | procedure Add_Implicit_Operator |
7414 | (T : Entity_Id; | |
7415 | Op_Type : Entity_Id := Empty); | |
fbe627af RD |
7416 | -- Add implicit interpretation to node N, using the type for which a |
7417 | -- predefined operator exists. If the operator yields a boolean type, | |
7418 | -- the Operand_Type is implicitly referenced by the operator, and a | |
7419 | -- reference to it must be generated. | |
996ae0b0 RK |
7420 | |
7421 | --------------------------- | |
7422 | -- Add_Implicit_Operator -- | |
7423 | --------------------------- | |
7424 | ||
fbf5a39b AC |
7425 | procedure Add_Implicit_Operator |
7426 | (T : Entity_Id; | |
7427 | Op_Type : Entity_Id := Empty) | |
7428 | is | |
996ae0b0 RK |
7429 | Predef_Op : Entity_Id; |
7430 | ||
7431 | begin | |
7432 | Predef_Op := Current_Entity (Selector_Name (N)); | |
996ae0b0 RK |
7433 | while Present (Predef_Op) |
7434 | and then Scope (Predef_Op) /= Standard_Standard | |
7435 | loop | |
7436 | Predef_Op := Homonym (Predef_Op); | |
7437 | end loop; | |
7438 | ||
7439 | if Nkind (N) = N_Selected_Component then | |
7440 | Change_Selected_Component_To_Expanded_Name (N); | |
7441 | end if; | |
7442 | ||
719aaf4d AC |
7443 | -- If the context is an unanalyzed function call, determine whether |
7444 | -- a binary or unary interpretation is required. | |
996ae0b0 | 7445 | |
719aaf4d AC |
7446 | if Nkind (Parent (N)) = N_Indexed_Component then |
7447 | declare | |
964f13da RD |
7448 | Is_Binary_Call : constant Boolean := |
7449 | Present | |
7450 | (Next (First (Expressions (Parent (N))))); | |
7451 | Is_Binary_Op : constant Boolean := | |
7452 | First_Entity | |
7453 | (Predef_Op) /= Last_Entity (Predef_Op); | |
719aaf4d AC |
7454 | Predef_Op2 : constant Entity_Id := Homonym (Predef_Op); |
7455 | ||
7456 | begin | |
7457 | if Is_Binary_Call then | |
7458 | if Is_Binary_Op then | |
7459 | Add_One_Interp (N, Predef_Op, T); | |
7460 | else | |
7461 | Add_One_Interp (N, Predef_Op2, T); | |
7462 | end if; | |
996ae0b0 | 7463 | |
719aaf4d AC |
7464 | else |
7465 | if not Is_Binary_Op then | |
7466 | Add_One_Interp (N, Predef_Op, T); | |
7467 | else | |
7468 | Add_One_Interp (N, Predef_Op2, T); | |
7469 | end if; | |
7470 | end if; | |
7471 | end; | |
7472 | ||
7473 | else | |
7474 | Add_One_Interp (N, Predef_Op, T); | |
7475 | ||
7476 | -- For operators with unary and binary interpretations, if | |
7477 | -- context is not a call, add both | |
7478 | ||
7479 | if Present (Homonym (Predef_Op)) then | |
7480 | Add_One_Interp (N, Homonym (Predef_Op), T); | |
7481 | end if; | |
996ae0b0 | 7482 | end if; |
fbf5a39b AC |
7483 | |
7484 | -- The node is a reference to a predefined operator, and | |
7485 | -- an implicit reference to the type of its operands. | |
7486 | ||
7487 | if Present (Op_Type) then | |
7488 | Generate_Operator_Reference (N, Op_Type); | |
7489 | else | |
7490 | Generate_Operator_Reference (N, T); | |
7491 | end if; | |
996ae0b0 RK |
7492 | end Add_Implicit_Operator; |
7493 | ||
7494 | -- Start of processing for Has_Implicit_Operator | |
7495 | ||
7496 | begin | |
ac7d724d | 7497 | if Ekind (P) = E_Package and then not In_Open_Scopes (P) then |
996ae0b0 RK |
7498 | Priv_Id := First_Private_Entity (P); |
7499 | end if; | |
7500 | ||
7501 | Id := First_Entity (P); | |
7502 | ||
7503 | case Op_Id is | |
7504 | ||
7505 | -- Boolean operators: an implicit declaration exists if the scope | |
7506 | -- contains a declaration for a derived Boolean type, or for an | |
7507 | -- array of Boolean type. | |
7508 | ||
7509 | when Name_Op_And | Name_Op_Not | Name_Op_Or | Name_Op_Xor => | |
996ae0b0 | 7510 | while Id /= Priv_Id loop |
d347f572 | 7511 | if Valid_Boolean_Arg (Id) and then Is_Base_Type (Id) then |
996ae0b0 RK |
7512 | Add_Implicit_Operator (Id); |
7513 | return True; | |
7514 | end if; | |
7515 | ||
7516 | Next_Entity (Id); | |
7517 | end loop; | |
7518 | ||
bc41faa2 | 7519 | -- Equality: look for any non-limited type (result is Boolean) |
996ae0b0 RK |
7520 | |
7521 | when Name_Op_Eq | Name_Op_Ne => | |
996ae0b0 | 7522 | while Id /= Priv_Id loop |
996ae0b0 RK |
7523 | if Is_Type (Id) |
7524 | and then not Is_Limited_Type (Id) | |
d347f572 | 7525 | and then Is_Base_Type (Id) |
996ae0b0 | 7526 | then |
fbf5a39b | 7527 | Add_Implicit_Operator (Standard_Boolean, Id); |
996ae0b0 RK |
7528 | return True; |
7529 | end if; | |
7530 | ||
7531 | Next_Entity (Id); | |
7532 | end loop; | |
7533 | ||
bc41faa2 | 7534 | -- Comparison operators: scalar type, or array of scalar |
996ae0b0 RK |
7535 | |
7536 | when Name_Op_Lt | Name_Op_Le | Name_Op_Gt | Name_Op_Ge => | |
996ae0b0 RK |
7537 | while Id /= Priv_Id loop |
7538 | if (Is_Scalar_Type (Id) | |
d347f572 AC |
7539 | or else (Is_Array_Type (Id) |
7540 | and then Is_Scalar_Type (Component_Type (Id)))) | |
7541 | and then Is_Base_Type (Id) | |
996ae0b0 | 7542 | then |
fbf5a39b | 7543 | Add_Implicit_Operator (Standard_Boolean, Id); |
996ae0b0 RK |
7544 | return True; |
7545 | end if; | |
7546 | ||
7547 | Next_Entity (Id); | |
7548 | end loop; | |
7549 | ||
7550 | -- Arithmetic operators: any numeric type | |
7551 | ||
7552 | when Name_Op_Abs | | |
7553 | Name_Op_Add | | |
7554 | Name_Op_Mod | | |
7555 | Name_Op_Rem | | |
7556 | Name_Op_Subtract | | |
7557 | Name_Op_Multiply | | |
7558 | Name_Op_Divide | | |
7559 | Name_Op_Expon => | |
996ae0b0 | 7560 | while Id /= Priv_Id loop |
d347f572 | 7561 | if Is_Numeric_Type (Id) and then Is_Base_Type (Id) then |
996ae0b0 RK |
7562 | Add_Implicit_Operator (Id); |
7563 | return True; | |
7564 | end if; | |
7565 | ||
7566 | Next_Entity (Id); | |
7567 | end loop; | |
7568 | ||
7569 | -- Concatenation: any one-dimensional array type | |
7570 | ||
7571 | when Name_Op_Concat => | |
996ae0b0 | 7572 | while Id /= Priv_Id loop |
d347f572 AC |
7573 | if Is_Array_Type (Id) |
7574 | and then Number_Dimensions (Id) = 1 | |
7575 | and then Is_Base_Type (Id) | |
996ae0b0 RK |
7576 | then |
7577 | Add_Implicit_Operator (Id); | |
7578 | return True; | |
7579 | end if; | |
7580 | ||
7581 | Next_Entity (Id); | |
7582 | end loop; | |
7583 | ||
7584 | -- What is the others condition here? Should we be using a | |
7585 | -- subtype of Name_Id that would restrict to operators ??? | |
7586 | ||
7587 | when others => null; | |
996ae0b0 RK |
7588 | end case; |
7589 | ||
7590 | -- If we fall through, then we do not have an implicit operator | |
7591 | ||
7592 | return False; | |
7593 | ||
7594 | end Has_Implicit_Operator; | |
7595 | ||
607d0635 AC |
7596 | ----------------------------------- |
7597 | -- Has_Loop_In_Inner_Open_Scopes -- | |
7598 | ----------------------------------- | |
7599 | ||
7600 | function Has_Loop_In_Inner_Open_Scopes (S : Entity_Id) return Boolean is | |
7601 | begin | |
7602 | -- Several scope stacks are maintained by Scope_Stack. The base of the | |
7603 | -- currently active scope stack is denoted by the Is_Active_Stack_Base | |
7604 | -- flag in the scope stack entry. Note that the scope stacks used to | |
7605 | -- simply be delimited implicitly by the presence of Standard_Standard | |
7606 | -- at their base, but there now are cases where this is not sufficient | |
7607 | -- because Standard_Standard actually may appear in the middle of the | |
7608 | -- active set of scopes. | |
7609 | ||
7610 | for J in reverse 0 .. Scope_Stack.Last loop | |
8d606a78 RD |
7611 | |
7612 | -- S was reached without seing a loop scope first | |
7613 | ||
607d0635 | 7614 | if Scope_Stack.Table (J).Entity = S then |
607d0635 | 7615 | return False; |
8d606a78 RD |
7616 | |
7617 | -- S was not yet reached, so it contains at least one inner loop | |
7618 | ||
607d0635 | 7619 | elsif Ekind (Scope_Stack.Table (J).Entity) = E_Loop then |
607d0635 AC |
7620 | return True; |
7621 | end if; | |
7622 | ||
7623 | -- Check Is_Active_Stack_Base to tell us when to stop, as there are | |
7624 | -- cases where Standard_Standard appears in the middle of the active | |
7625 | -- set of scopes. This affects the declaration and overriding of | |
7626 | -- private inherited operations in instantiations of generic child | |
7627 | -- units. | |
7628 | ||
7629 | pragma Assert (not Scope_Stack.Table (J).Is_Active_Stack_Base); | |
7630 | end loop; | |
7631 | ||
2010d078 | 7632 | raise Program_Error; -- unreachable |
607d0635 AC |
7633 | end Has_Loop_In_Inner_Open_Scopes; |
7634 | ||
996ae0b0 RK |
7635 | -------------------- |
7636 | -- In_Open_Scopes -- | |
7637 | -------------------- | |
7638 | ||
7639 | function In_Open_Scopes (S : Entity_Id) return Boolean is | |
7640 | begin | |
923fa078 RD |
7641 | -- Several scope stacks are maintained by Scope_Stack. The base of the |
7642 | -- currently active scope stack is denoted by the Is_Active_Stack_Base | |
7643 | -- flag in the scope stack entry. Note that the scope stacks used to | |
7644 | -- simply be delimited implicitly by the presence of Standard_Standard | |
7645 | -- at their base, but there now are cases where this is not sufficient | |
7646 | -- because Standard_Standard actually may appear in the middle of the | |
7647 | -- active set of scopes. | |
996ae0b0 RK |
7648 | |
7649 | for J in reverse 0 .. Scope_Stack.Last loop | |
7650 | if Scope_Stack.Table (J).Entity = S then | |
7651 | return True; | |
7652 | end if; | |
7653 | ||
923fa078 RD |
7654 | -- Check Is_Active_Stack_Base to tell us when to stop, as there are |
7655 | -- cases where Standard_Standard appears in the middle of the active | |
7656 | -- set of scopes. This affects the declaration and overriding of | |
7657 | -- private inherited operations in instantiations of generic child | |
7658 | -- units. | |
996ae0b0 RK |
7659 | |
7660 | exit when Scope_Stack.Table (J).Is_Active_Stack_Base; | |
7661 | end loop; | |
7662 | ||
7663 | return False; | |
7664 | end In_Open_Scopes; | |
7665 | ||
7666 | ----------------------------- | |
7667 | -- Inherit_Renamed_Profile -- | |
7668 | ----------------------------- | |
7669 | ||
7670 | procedure Inherit_Renamed_Profile (New_S : Entity_Id; Old_S : Entity_Id) is | |
7671 | New_F : Entity_Id; | |
7672 | Old_F : Entity_Id; | |
7673 | Old_T : Entity_Id; | |
7674 | New_T : Entity_Id; | |
7675 | ||
7676 | begin | |
7677 | if Ekind (Old_S) = E_Operator then | |
996ae0b0 RK |
7678 | New_F := First_Formal (New_S); |
7679 | ||
7680 | while Present (New_F) loop | |
7681 | Set_Etype (New_F, Base_Type (Etype (New_F))); | |
7682 | Next_Formal (New_F); | |
7683 | end loop; | |
7684 | ||
7685 | Set_Etype (New_S, Base_Type (Etype (New_S))); | |
7686 | ||
7687 | else | |
7688 | New_F := First_Formal (New_S); | |
7689 | Old_F := First_Formal (Old_S); | |
7690 | ||
7691 | while Present (New_F) loop | |
7692 | New_T := Etype (New_F); | |
7693 | Old_T := Etype (Old_F); | |
7694 | ||
7695 | -- If the new type is a renaming of the old one, as is the | |
7696 | -- case for actuals in instances, retain its name, to simplify | |
7697 | -- later disambiguation. | |
7698 | ||
7699 | if Nkind (Parent (New_T)) = N_Subtype_Declaration | |
7700 | and then Is_Entity_Name (Subtype_Indication (Parent (New_T))) | |
7701 | and then Entity (Subtype_Indication (Parent (New_T))) = Old_T | |
7702 | then | |
7703 | null; | |
7704 | else | |
7705 | Set_Etype (New_F, Old_T); | |
7706 | end if; | |
7707 | ||
7708 | Next_Formal (New_F); | |
7709 | Next_Formal (Old_F); | |
7710 | end loop; | |
7711 | ||
bce79204 | 7712 | if Ekind_In (Old_S, E_Function, E_Enumeration_Literal) then |
996ae0b0 RK |
7713 | Set_Etype (New_S, Etype (Old_S)); |
7714 | end if; | |
7715 | end if; | |
7716 | end Inherit_Renamed_Profile; | |
7717 | ||
7718 | ---------------- | |
7719 | -- Initialize -- | |
7720 | ---------------- | |
7721 | ||
7722 | procedure Initialize is | |
7723 | begin | |
7724 | Urefs.Init; | |
7725 | end Initialize; | |
7726 | ||
7727 | ------------------------- | |
7728 | -- Install_Use_Clauses -- | |
7729 | ------------------------- | |
7730 | ||
0da2c8ac AC |
7731 | procedure Install_Use_Clauses |
7732 | (Clause : Node_Id; | |
7733 | Force_Installation : Boolean := False) | |
7734 | is | |
16ca248a | 7735 | U : Node_Id; |
996ae0b0 RK |
7736 | P : Node_Id; |
7737 | Id : Entity_Id; | |
7738 | ||
7739 | begin | |
16ca248a | 7740 | U := Clause; |
996ae0b0 RK |
7741 | while Present (U) loop |
7742 | ||
7743 | -- Case of USE package | |
7744 | ||
7745 | if Nkind (U) = N_Use_Package_Clause then | |
7746 | P := First (Names (U)); | |
996ae0b0 RK |
7747 | while Present (P) loop |
7748 | Id := Entity (P); | |
7749 | ||
7750 | if Ekind (Id) = E_Package then | |
996ae0b0 | 7751 | if In_Use (Id) then |
d4810530 | 7752 | Note_Redundant_Use (P); |
996ae0b0 RK |
7753 | |
7754 | elsif Present (Renamed_Object (Id)) | |
7755 | and then In_Use (Renamed_Object (Id)) | |
7756 | then | |
d4810530 | 7757 | Note_Redundant_Use (P); |
996ae0b0 | 7758 | |
0da2c8ac | 7759 | elsif Force_Installation or else Applicable_Use (P) then |
996ae0b0 | 7760 | Use_One_Package (Id, U); |
0da2c8ac | 7761 | |
996ae0b0 RK |
7762 | end if; |
7763 | end if; | |
7764 | ||
7765 | Next (P); | |
7766 | end loop; | |
7767 | ||
16ca248a | 7768 | -- Case of USE TYPE |
996ae0b0 RK |
7769 | |
7770 | else | |
7771 | P := First (Subtype_Marks (U)); | |
996ae0b0 | 7772 | while Present (P) loop |
fbf5a39b AC |
7773 | if not Is_Entity_Name (P) |
7774 | or else No (Entity (P)) | |
7775 | then | |
7776 | null; | |
996ae0b0 | 7777 | |
fbf5a39b | 7778 | elsif Entity (P) /= Any_Type then |
07fc65c4 | 7779 | Use_One_Type (P); |
996ae0b0 RK |
7780 | end if; |
7781 | ||
7782 | Next (P); | |
7783 | end loop; | |
7784 | end if; | |
7785 | ||
7786 | Next_Use_Clause (U); | |
7787 | end loop; | |
7788 | end Install_Use_Clauses; | |
7789 | ||
7790 | ------------------------------------- | |
7791 | -- Is_Appropriate_For_Entry_Prefix -- | |
7792 | ------------------------------------- | |
7793 | ||
7794 | function Is_Appropriate_For_Entry_Prefix (T : Entity_Id) return Boolean is | |
7795 | P_Type : Entity_Id := T; | |
7796 | ||
7797 | begin | |
7798 | if Is_Access_Type (P_Type) then | |
7799 | P_Type := Designated_Type (P_Type); | |
7800 | end if; | |
7801 | ||
7802 | return Is_Task_Type (P_Type) or else Is_Protected_Type (P_Type); | |
7803 | end Is_Appropriate_For_Entry_Prefix; | |
7804 | ||
7805 | ------------------------------- | |
7806 | -- Is_Appropriate_For_Record -- | |
7807 | ------------------------------- | |
7808 | ||
2e071734 AC |
7809 | function Is_Appropriate_For_Record (T : Entity_Id) return Boolean is |
7810 | ||
996ae0b0 RK |
7811 | function Has_Components (T1 : Entity_Id) return Boolean; |
7812 | -- Determine if given type has components (i.e. is either a record | |
7813 | -- type or a type that has discriminants). | |
7814 | ||
16ca248a ES |
7815 | -------------------- |
7816 | -- Has_Components -- | |
7817 | -------------------- | |
7818 | ||
996ae0b0 RK |
7819 | function Has_Components (T1 : Entity_Id) return Boolean is |
7820 | begin | |
7821 | return Is_Record_Type (T1) | |
7822 | or else (Is_Private_Type (T1) and then Has_Discriminants (T1)) | |
16ca248a ES |
7823 | or else (Is_Task_Type (T1) and then Has_Discriminants (T1)) |
7824 | or else (Is_Incomplete_Type (T1) | |
7b56a91b | 7825 | and then From_Limited_With (T1) |
16ca248a | 7826 | and then Present (Non_Limited_View (T1)) |
11560bcc TQ |
7827 | and then Is_Record_Type |
7828 | (Get_Full_View (Non_Limited_View (T1)))); | |
996ae0b0 RK |
7829 | end Has_Components; |
7830 | ||
7831 | -- Start of processing for Is_Appropriate_For_Record | |
7832 | ||
7833 | begin | |
7834 | return | |
7835 | Present (T) | |
7836 | and then (Has_Components (T) | |
16ca248a ES |
7837 | or else (Is_Access_Type (T) |
7838 | and then Has_Components (Designated_Type (T)))); | |
996ae0b0 RK |
7839 | end Is_Appropriate_For_Record; |
7840 | ||
d4810530 ES |
7841 | ------------------------ |
7842 | -- Note_Redundant_Use -- | |
7843 | ------------------------ | |
7844 | ||
7845 | procedure Note_Redundant_Use (Clause : Node_Id) is | |
7846 | Pack_Name : constant Entity_Id := Entity (Clause); | |
7847 | Cur_Use : constant Node_Id := Current_Use_Clause (Pack_Name); | |
7848 | Decl : constant Node_Id := Parent (Clause); | |
7849 | ||
7850 | Prev_Use : Node_Id := Empty; | |
7851 | Redundant : Node_Id := Empty; | |
f7ca1d04 AC |
7852 | -- The Use_Clause which is actually redundant. In the simplest case it |
7853 | -- is Pack itself, but when we compile a body we install its context | |
7854 | -- before that of its spec, in which case it is the use_clause in the | |
7855 | -- spec that will appear to be redundant, and we want the warning to be | |
7856 | -- placed on the body. Similar complications appear when the redundancy | |
7857 | -- is between a child unit and one of its ancestors. | |
d4810530 ES |
7858 | |
7859 | begin | |
7860 | Set_Redundant_Use (Clause, True); | |
7861 | ||
7862 | if not Comes_From_Source (Clause) | |
7863 | or else In_Instance | |
7864 | or else not Warn_On_Redundant_Constructs | |
7865 | then | |
7866 | return; | |
7867 | end if; | |
7868 | ||
7869 | if not Is_Compilation_Unit (Current_Scope) then | |
7870 | ||
f7ca1d04 AC |
7871 | -- If the use_clause is in an inner scope, it is made redundant by |
7872 | -- some clause in the current context, with one exception: If we're | |
7873 | -- compiling a nested package body, and the use_clause comes from the | |
7874 | -- corresponding spec, the clause is not necessarily fully redundant, | |
7875 | -- so we should not warn. If a warning was warranted, it would have | |
7876 | -- been given when the spec was processed. | |
cdc8c54c BD |
7877 | |
7878 | if Nkind (Parent (Decl)) = N_Package_Specification then | |
7879 | declare | |
7880 | Package_Spec_Entity : constant Entity_Id := | |
7881 | Defining_Unit_Name (Parent (Decl)); | |
7882 | begin | |
7883 | if In_Package_Body (Package_Spec_Entity) then | |
7884 | return; | |
7885 | end if; | |
7886 | end; | |
7887 | end if; | |
d4810530 ES |
7888 | |
7889 | Redundant := Clause; | |
7890 | Prev_Use := Cur_Use; | |
7891 | ||
7892 | elsif Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Body then | |
7893 | declare | |
7894 | Cur_Unit : constant Unit_Number_Type := Get_Source_Unit (Cur_Use); | |
7895 | New_Unit : constant Unit_Number_Type := Get_Source_Unit (Clause); | |
7896 | Scop : Entity_Id; | |
7897 | ||
7898 | begin | |
7899 | if Cur_Unit = New_Unit then | |
7900 | ||
7901 | -- Redundant clause in same body | |
7902 | ||
7903 | Redundant := Clause; | |
7904 | Prev_Use := Cur_Use; | |
7905 | ||
7906 | elsif Cur_Unit = Current_Sem_Unit then | |
7907 | ||
7908 | -- If the new clause is not in the current unit it has been | |
7909 | -- analyzed first, and it makes the other one redundant. | |
7910 | -- However, if the new clause appears in a subunit, Cur_Unit | |
7911 | -- is still the parent, and in that case the redundant one | |
7912 | -- is the one appearing in the subunit. | |
7913 | ||
7914 | if Nkind (Unit (Cunit (New_Unit))) = N_Subunit then | |
7915 | Redundant := Clause; | |
7916 | Prev_Use := Cur_Use; | |
7917 | ||
7918 | -- Most common case: redundant clause in body, | |
7919 | -- original clause in spec. Current scope is spec entity. | |
7920 | ||
7921 | elsif | |
7922 | Current_Scope = | |
7923 | Defining_Entity ( | |
7924 | Unit (Library_Unit (Cunit (Current_Sem_Unit)))) | |
7925 | then | |
7926 | Redundant := Cur_Use; | |
7927 | Prev_Use := Clause; | |
7928 | ||
7929 | else | |
7930 | -- The new clause may appear in an unrelated unit, when | |
7931 | -- the parents of a generic are being installed prior to | |
7932 | -- instantiation. In this case there must be no warning. | |
7933 | -- We detect this case by checking whether the current top | |
7934 | -- of the stack is related to the current compilation. | |
7935 | ||
7936 | Scop := Current_Scope; | |
ac7d724d | 7937 | while Present (Scop) and then Scop /= Standard_Standard loop |
d4810530 ES |
7938 | if Is_Compilation_Unit (Scop) |
7939 | and then not Is_Child_Unit (Scop) | |
7940 | then | |
7941 | return; | |
7942 | ||
7943 | elsif Scop = Cunit_Entity (Current_Sem_Unit) then | |
7944 | exit; | |
7945 | end if; | |
7946 | ||
7947 | Scop := Scope (Scop); | |
7948 | end loop; | |
7949 | ||
7950 | Redundant := Cur_Use; | |
7951 | Prev_Use := Clause; | |
7952 | end if; | |
7953 | ||
7954 | elsif New_Unit = Current_Sem_Unit then | |
7955 | Redundant := Clause; | |
7956 | Prev_Use := Cur_Use; | |
7957 | ||
7958 | else | |
7959 | -- Neither is the current unit, so they appear in parent or | |
7960 | -- sibling units. Warning will be emitted elsewhere. | |
7961 | ||
7962 | return; | |
7963 | end if; | |
7964 | end; | |
7965 | ||
7966 | elsif Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Declaration | |
7967 | and then Present (Parent_Spec (Unit (Cunit (Current_Sem_Unit)))) | |
7968 | then | |
f7ca1d04 AC |
7969 | -- Use_clause is in child unit of current unit, and the child unit |
7970 | -- appears in the context of the body of the parent, so it has been | |
7971 | -- installed first, even though it is the redundant one. Depending on | |
7972 | -- their placement in the context, the visible or the private parts | |
7973 | -- of the two units, either might appear as redundant, but the | |
7974 | -- message has to be on the current unit. | |
d4810530 ES |
7975 | |
7976 | if Get_Source_Unit (Cur_Use) = Current_Sem_Unit then | |
7977 | Redundant := Cur_Use; | |
7978 | Prev_Use := Clause; | |
7979 | else | |
7980 | Redundant := Clause; | |
7981 | Prev_Use := Cur_Use; | |
7982 | end if; | |
7983 | ||
7984 | -- If the new use clause appears in the private part of a parent unit | |
f3d57416 | 7985 | -- it may appear to be redundant w.r.t. a use clause in a child unit, |
d4810530 ES |
7986 | -- but the previous use clause was needed in the visible part of the |
7987 | -- child, and no warning should be emitted. | |
7988 | ||
7989 | if Nkind (Parent (Decl)) = N_Package_Specification | |
7990 | and then | |
7991 | List_Containing (Decl) = Private_Declarations (Parent (Decl)) | |
7992 | then | |
7993 | declare | |
7994 | Par : constant Entity_Id := Defining_Entity (Parent (Decl)); | |
7995 | Spec : constant Node_Id := | |
7996 | Specification (Unit (Cunit (Current_Sem_Unit))); | |
7997 | ||
7998 | begin | |
7999 | if Is_Compilation_Unit (Par) | |
8000 | and then Par /= Cunit_Entity (Current_Sem_Unit) | |
8001 | and then Parent (Cur_Use) = Spec | |
8002 | and then | |
8003 | List_Containing (Cur_Use) = Visible_Declarations (Spec) | |
8004 | then | |
8005 | return; | |
8006 | end if; | |
8007 | end; | |
8008 | end if; | |
8009 | ||
ff81221b ES |
8010 | -- Finally, if the current use clause is in the context then |
8011 | -- the clause is redundant when it is nested within the unit. | |
8012 | ||
8013 | elsif Nkind (Parent (Cur_Use)) = N_Compilation_Unit | |
8014 | and then Nkind (Parent (Parent (Clause))) /= N_Compilation_Unit | |
8015 | and then Get_Source_Unit (Cur_Use) = Get_Source_Unit (Clause) | |
8016 | then | |
8017 | Redundant := Clause; | |
8018 | Prev_Use := Cur_Use; | |
8019 | ||
d4810530 ES |
8020 | else |
8021 | null; | |
8022 | end if; | |
8023 | ||
8024 | if Present (Redundant) then | |
8025 | Error_Msg_Sloc := Sloc (Prev_Use); | |
ed2233dc | 8026 | Error_Msg_NE -- CODEFIX |
dbfeb4fa | 8027 | ("& is already use-visible through previous use clause #??", |
954c111a | 8028 | Redundant, Pack_Name); |
d4810530 ES |
8029 | end if; |
8030 | end Note_Redundant_Use; | |
8031 | ||
996ae0b0 RK |
8032 | --------------- |
8033 | -- Pop_Scope -- | |
8034 | --------------- | |
8035 | ||
8036 | procedure Pop_Scope is | |
fbf5a39b | 8037 | SST : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last); |
fab2daeb | 8038 | S : constant Entity_Id := SST.Entity; |
996ae0b0 RK |
8039 | |
8040 | begin | |
8041 | if Debug_Flag_E then | |
8042 | Write_Info; | |
8043 | end if; | |
8044 | ||
fab2daeb AC |
8045 | -- Set Default_Storage_Pool field of the library unit if necessary |
8046 | ||
8047 | if Ekind_In (S, E_Package, E_Generic_Package) | |
8048 | and then | |
8049 | Nkind (Parent (Unit_Declaration_Node (S))) = N_Compilation_Unit | |
8050 | then | |
8051 | declare | |
8052 | Aux : constant Node_Id := | |
4adf3c50 | 8053 | Aux_Decls_Node (Parent (Unit_Declaration_Node (S))); |
fab2daeb AC |
8054 | begin |
8055 | if No (Default_Storage_Pool (Aux)) then | |
8056 | Set_Default_Storage_Pool (Aux, Default_Pool); | |
8057 | end if; | |
8058 | end; | |
8059 | end if; | |
8060 | ||
21d27997 | 8061 | Scope_Suppress := SST.Save_Scope_Suppress; |
11560bcc | 8062 | Local_Suppress_Stack_Top := SST.Save_Local_Suppress_Stack_Top; |
21d27997 | 8063 | Check_Policy_List := SST.Save_Check_Policy_List; |
fab2daeb | 8064 | Default_Pool := SST.Save_Default_Storage_Pool; |
49d41397 | 8065 | No_Tagged_Streams := SST.Save_No_Tagged_Streams; |
43417b90 | 8066 | SPARK_Mode := SST.Save_SPARK_Mode; |
579847c2 | 8067 | SPARK_Mode_Pragma := SST.Save_SPARK_Mode_Pragma; |
220d1fd9 | 8068 | Default_SSO := SST.Save_Default_SSO; |
96e90ac1 | 8069 | Uneval_Old := SST.Save_Uneval_Old; |
996ae0b0 RK |
8070 | |
8071 | if Debug_Flag_W then | |
fab2daeb | 8072 | Write_Str ("<-- exiting scope: "); |
996ae0b0 RK |
8073 | Write_Name (Chars (Current_Scope)); |
8074 | Write_Str (", Depth="); | |
8075 | Write_Int (Int (Scope_Stack.Last)); | |
8076 | Write_Eol; | |
8077 | end if; | |
8078 | ||
fbf5a39b | 8079 | End_Use_Clauses (SST.First_Use_Clause); |
996ae0b0 RK |
8080 | |
8081 | -- If the actions to be wrapped are still there they will get lost | |
8082 | -- causing incomplete code to be generated. It is better to abort in | |
fbf5a39b | 8083 | -- this case (and we do the abort even with assertions off since the |
5eeeed5e | 8084 | -- penalty is incorrect code generation). |
996ae0b0 | 8085 | |
36295779 | 8086 | if SST.Actions_To_Be_Wrapped /= Scope_Actions'(others => No_List) then |
46202729 | 8087 | raise Program_Error; |
fbf5a39b | 8088 | end if; |
996ae0b0 RK |
8089 | |
8090 | -- Free last subprogram name if allocated, and pop scope | |
8091 | ||
fbf5a39b | 8092 | Free (SST.Last_Subprogram_Name); |
996ae0b0 RK |
8093 | Scope_Stack.Decrement_Last; |
8094 | end Pop_Scope; | |
8095 | ||
fbe627af RD |
8096 | --------------- |
8097 | -- Push_Scope -- | |
8098 | --------------- | |
8099 | ||
8100 | procedure Push_Scope (S : Entity_Id) is | |
fab2daeb | 8101 | E : constant Entity_Id := Scope (S); |
fbe627af RD |
8102 | |
8103 | begin | |
8104 | if Ekind (S) = E_Void then | |
8105 | null; | |
8106 | ||
f7ca1d04 AC |
8107 | -- Set scope depth if not a non-concurrent type, and we have not yet set |
8108 | -- the scope depth. This means that we have the first occurrence of the | |
8109 | -- scope, and this is where the depth is set. | |
fbe627af RD |
8110 | |
8111 | elsif (not Is_Type (S) or else Is_Concurrent_Type (S)) | |
8112 | and then not Scope_Depth_Set (S) | |
8113 | then | |
8114 | if S = Standard_Standard then | |
8115 | Set_Scope_Depth_Value (S, Uint_0); | |
8116 | ||
8117 | elsif Is_Child_Unit (S) then | |
8118 | Set_Scope_Depth_Value (S, Uint_1); | |
8119 | ||
8120 | elsif not Is_Record_Type (Current_Scope) then | |
8121 | if Ekind (S) = E_Loop then | |
8122 | Set_Scope_Depth_Value (S, Scope_Depth (Current_Scope)); | |
8123 | else | |
8124 | Set_Scope_Depth_Value (S, Scope_Depth (Current_Scope) + 1); | |
8125 | end if; | |
8126 | end if; | |
8127 | end if; | |
8128 | ||
8129 | Scope_Stack.Increment_Last; | |
8130 | ||
8131 | declare | |
8132 | SST : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last); | |
8133 | ||
8134 | begin | |
11560bcc TQ |
8135 | SST.Entity := S; |
8136 | SST.Save_Scope_Suppress := Scope_Suppress; | |
8137 | SST.Save_Local_Suppress_Stack_Top := Local_Suppress_Stack_Top; | |
21d27997 | 8138 | SST.Save_Check_Policy_List := Check_Policy_List; |
fab2daeb | 8139 | SST.Save_Default_Storage_Pool := Default_Pool; |
49d41397 | 8140 | SST.Save_No_Tagged_Streams := No_Tagged_Streams; |
43417b90 | 8141 | SST.Save_SPARK_Mode := SPARK_Mode; |
579847c2 | 8142 | SST.Save_SPARK_Mode_Pragma := SPARK_Mode_Pragma; |
220d1fd9 | 8143 | SST.Save_Default_SSO := Default_SSO; |
96e90ac1 | 8144 | SST.Save_Uneval_Old := Uneval_Old; |
fbe627af RD |
8145 | |
8146 | if Scope_Stack.Last > Scope_Stack.First then | |
8147 | SST.Component_Alignment_Default := Scope_Stack.Table | |
8148 | (Scope_Stack.Last - 1). | |
8149 | Component_Alignment_Default; | |
8150 | end if; | |
8151 | ||
8152 | SST.Last_Subprogram_Name := null; | |
8153 | SST.Is_Transient := False; | |
8154 | SST.Node_To_Be_Wrapped := Empty; | |
8155 | SST.Pending_Freeze_Actions := No_List; | |
36295779 | 8156 | SST.Actions_To_Be_Wrapped := (others => No_List); |
fbe627af RD |
8157 | SST.First_Use_Clause := Empty; |
8158 | SST.Is_Active_Stack_Base := False; | |
8159 | SST.Previous_Visibility := False; | |
8071b771 | 8160 | SST.Locked_Shared_Objects := No_Elist; |
fbe627af RD |
8161 | end; |
8162 | ||
8163 | if Debug_Flag_W then | |
8164 | Write_Str ("--> new scope: "); | |
8165 | Write_Name (Chars (Current_Scope)); | |
8166 | Write_Str (", Id="); | |
8167 | Write_Int (Int (Current_Scope)); | |
8168 | Write_Str (", Depth="); | |
8169 | Write_Int (Int (Scope_Stack.Last)); | |
8170 | Write_Eol; | |
8171 | end if; | |
8172 | ||
f7ca1d04 AC |
8173 | -- Deal with copying flags from the previous scope to this one. This is |
8174 | -- not necessary if either scope is standard, or if the new scope is a | |
8175 | -- child unit. | |
fbe627af RD |
8176 | |
8177 | if S /= Standard_Standard | |
8178 | and then Scope (S) /= Standard_Standard | |
8179 | and then not Is_Child_Unit (S) | |
8180 | then | |
fbe627af RD |
8181 | if Nkind (E) not in N_Entity then |
8182 | return; | |
8183 | end if; | |
8184 | ||
8185 | -- Copy categorization flags from Scope (S) to S, this is not done | |
8186 | -- when Scope (S) is Standard_Standard since propagation is from | |
8187 | -- library unit entity inwards. Copy other relevant attributes as | |
8188 | -- well (Discard_Names in particular). | |
8189 | ||
8190 | -- We only propagate inwards for library level entities, | |
8191 | -- inner level subprograms do not inherit the categorization. | |
8192 | ||
8193 | if Is_Library_Level_Entity (S) then | |
8194 | Set_Is_Preelaborated (S, Is_Preelaborated (E)); | |
8195 | Set_Is_Shared_Passive (S, Is_Shared_Passive (E)); | |
8196 | Set_Discard_Names (S, Discard_Names (E)); | |
8197 | Set_Suppress_Value_Tracking_On_Call | |
8198 | (S, Suppress_Value_Tracking_On_Call (E)); | |
8199 | Set_Categorization_From_Scope (E => S, Scop => E); | |
8200 | end if; | |
8201 | end if; | |
fab2daeb AC |
8202 | |
8203 | if Is_Child_Unit (S) | |
8204 | and then Present (E) | |
8205 | and then Ekind_In (E, E_Package, E_Generic_Package) | |
8206 | and then | |
8207 | Nkind (Parent (Unit_Declaration_Node (E))) = N_Compilation_Unit | |
8208 | then | |
8209 | declare | |
8210 | Aux : constant Node_Id := | |
4adf3c50 | 8211 | Aux_Decls_Node (Parent (Unit_Declaration_Node (E))); |
fab2daeb AC |
8212 | begin |
8213 | if Present (Default_Storage_Pool (Aux)) then | |
8214 | Default_Pool := Default_Storage_Pool (Aux); | |
8215 | end if; | |
8216 | end; | |
8217 | end if; | |
fbe627af RD |
8218 | end Push_Scope; |
8219 | ||
996ae0b0 RK |
8220 | --------------------- |
8221 | -- Premature_Usage -- | |
8222 | --------------------- | |
8223 | ||
8224 | procedure Premature_Usage (N : Node_Id) is | |
fbf5a39b | 8225 | Kind : constant Node_Kind := Nkind (Parent (Entity (N))); |
996ae0b0 RK |
8226 | E : Entity_Id := Entity (N); |
8227 | ||
8228 | begin | |
8229 | -- Within an instance, the analysis of the actual for a formal object | |
16ca248a ES |
8230 | -- does not see the name of the object itself. This is significant only |
8231 | -- if the object is an aggregate, where its analysis does not do any | |
8232 | -- name resolution on component associations. (see 4717-008). In such a | |
8233 | -- case, look for the visible homonym on the chain. | |
996ae0b0 | 8234 | |
ac7d724d | 8235 | if In_Instance and then Present (Homonym (E)) then |
996ae0b0 | 8236 | E := Homonym (E); |
ac7d724d | 8237 | while Present (E) and then not In_Open_Scopes (Scope (E)) loop |
996ae0b0 RK |
8238 | E := Homonym (E); |
8239 | end loop; | |
8240 | ||
8241 | if Present (E) then | |
8242 | Set_Entity (N, E); | |
8243 | Set_Etype (N, Etype (E)); | |
8244 | return; | |
8245 | end if; | |
8246 | end if; | |
8247 | ||
8248 | if Kind = N_Component_Declaration then | |
8249 | Error_Msg_N | |
8250 | ("component&! cannot be used before end of record declaration", N); | |
8251 | ||
8252 | elsif Kind = N_Parameter_Specification then | |
8253 | Error_Msg_N | |
8254 | ("formal parameter&! cannot be used before end of specification", | |
8255 | N); | |
8256 | ||
8257 | elsif Kind = N_Discriminant_Specification then | |
8258 | Error_Msg_N | |
8259 | ("discriminant&! cannot be used before end of discriminant part", | |
8260 | N); | |
8261 | ||
8262 | elsif Kind = N_Procedure_Specification | |
8263 | or else Kind = N_Function_Specification | |
8264 | then | |
8265 | Error_Msg_N | |
8266 | ("subprogram&! cannot be used before end of its declaration", | |
8267 | N); | |
90067a15 ES |
8268 | |
8269 | elsif Kind = N_Full_Type_Declaration then | |
8270 | Error_Msg_N | |
8271 | ("type& cannot be used before end of its declaration!", N); | |
8272 | ||
996ae0b0 RK |
8273 | else |
8274 | Error_Msg_N | |
8275 | ("object& cannot be used before end of its declaration!", N); | |
8276 | end if; | |
8277 | end Premature_Usage; | |
8278 | ||
8279 | ------------------------ | |
8280 | -- Present_System_Aux -- | |
8281 | ------------------------ | |
8282 | ||
8283 | function Present_System_Aux (N : Node_Id := Empty) return Boolean is | |
8284 | Loc : Source_Ptr; | |
fbe627af | 8285 | Aux_Name : Unit_Name_Type; |
996ae0b0 RK |
8286 | Unum : Unit_Number_Type; |
8287 | Withn : Node_Id; | |
8288 | With_Sys : Node_Id; | |
8289 | The_Unit : Node_Id; | |
8290 | ||
8291 | function Find_System (C_Unit : Node_Id) return Entity_Id; | |
16ca248a | 8292 | -- Scan context clause of compilation unit to find with_clause |
996ae0b0 RK |
8293 | -- for System. |
8294 | ||
2e071734 AC |
8295 | ----------------- |
8296 | -- Find_System -- | |
8297 | ----------------- | |
8298 | ||
996ae0b0 RK |
8299 | function Find_System (C_Unit : Node_Id) return Entity_Id is |
8300 | With_Clause : Node_Id; | |
8301 | ||
8302 | begin | |
8303 | With_Clause := First (Context_Items (C_Unit)); | |
996ae0b0 RK |
8304 | while Present (With_Clause) loop |
8305 | if (Nkind (With_Clause) = N_With_Clause | |
8306 | and then Chars (Name (With_Clause)) = Name_System) | |
8307 | and then Comes_From_Source (With_Clause) | |
8308 | then | |
8309 | return With_Clause; | |
8310 | end if; | |
8311 | ||
8312 | Next (With_Clause); | |
8313 | end loop; | |
8314 | ||
8315 | return Empty; | |
8316 | end Find_System; | |
8317 | ||
8318 | -- Start of processing for Present_System_Aux | |
8319 | ||
8320 | begin | |
bc41faa2 | 8321 | -- The child unit may have been loaded and analyzed already |
996ae0b0 RK |
8322 | |
8323 | if Present (System_Aux_Id) then | |
8324 | return True; | |
8325 | ||
8326 | -- If no previous pragma for System.Aux, nothing to load | |
8327 | ||
fbf5a39b | 8328 | elsif No (System_Extend_Unit) then |
996ae0b0 RK |
8329 | return False; |
8330 | ||
8331 | -- Use the unit name given in the pragma to retrieve the unit. | |
8332 | -- Verify that System itself appears in the context clause of the | |
8333 | -- current compilation. If System is not present, an error will | |
8334 | -- have been reported already. | |
8335 | ||
8336 | else | |
8337 | With_Sys := Find_System (Cunit (Current_Sem_Unit)); | |
8338 | ||
8339 | The_Unit := Unit (Cunit (Current_Sem_Unit)); | |
8340 | ||
8341 | if No (With_Sys) | |
294ccb21 RD |
8342 | and then |
8343 | (Nkind (The_Unit) = N_Package_Body | |
ac7d724d ES |
8344 | or else (Nkind (The_Unit) = N_Subprogram_Body |
8345 | and then not Acts_As_Spec (Cunit (Current_Sem_Unit)))) | |
996ae0b0 RK |
8346 | then |
8347 | With_Sys := Find_System (Library_Unit (Cunit (Current_Sem_Unit))); | |
8348 | end if; | |
8349 | ||
ac7d724d ES |
8350 | if No (With_Sys) and then Present (N) then |
8351 | ||
996ae0b0 RK |
8352 | -- If we are compiling a subunit, we need to examine its |
8353 | -- context as well (Current_Sem_Unit is the parent unit); | |
8354 | ||
8355 | The_Unit := Parent (N); | |
996ae0b0 RK |
8356 | while Nkind (The_Unit) /= N_Compilation_Unit loop |
8357 | The_Unit := Parent (The_Unit); | |
8358 | end loop; | |
8359 | ||
8360 | if Nkind (Unit (The_Unit)) = N_Subunit then | |
8361 | With_Sys := Find_System (The_Unit); | |
8362 | end if; | |
8363 | end if; | |
8364 | ||
8365 | if No (With_Sys) then | |
8366 | return False; | |
8367 | end if; | |
8368 | ||
8369 | Loc := Sloc (With_Sys); | |
fbf5a39b | 8370 | Get_Name_String (Chars (Expression (System_Extend_Unit))); |
996ae0b0 RK |
8371 | Name_Buffer (8 .. Name_Len + 7) := Name_Buffer (1 .. Name_Len); |
8372 | Name_Buffer (1 .. 7) := "system."; | |
8373 | Name_Buffer (Name_Len + 8) := '%'; | |
8374 | Name_Buffer (Name_Len + 9) := 's'; | |
8375 | Name_Len := Name_Len + 9; | |
8376 | Aux_Name := Name_Find; | |
8377 | ||
8378 | Unum := | |
8379 | Load_Unit | |
8380 | (Load_Name => Aux_Name, | |
8381 | Required => False, | |
8382 | Subunit => False, | |
8383 | Error_Node => With_Sys); | |
8384 | ||
8385 | if Unum /= No_Unit then | |
8386 | Semantics (Cunit (Unum)); | |
8387 | System_Aux_Id := | |
8388 | Defining_Entity (Specification (Unit (Cunit (Unum)))); | |
8389 | ||
16ca248a ES |
8390 | Withn := |
8391 | Make_With_Clause (Loc, | |
8392 | Name => | |
8393 | Make_Expanded_Name (Loc, | |
8394 | Chars => Chars (System_Aux_Id), | |
e4494292 RD |
8395 | Prefix => New_Occurrence_Of (Scope (System_Aux_Id), Loc), |
8396 | Selector_Name => New_Occurrence_Of (System_Aux_Id, Loc))); | |
996ae0b0 RK |
8397 | |
8398 | Set_Entity (Name (Withn), System_Aux_Id); | |
8399 | ||
16ca248a ES |
8400 | Set_Library_Unit (Withn, Cunit (Unum)); |
8401 | Set_Corresponding_Spec (Withn, System_Aux_Id); | |
8402 | Set_First_Name (Withn, True); | |
8403 | Set_Implicit_With (Withn, True); | |
996ae0b0 RK |
8404 | |
8405 | Insert_After (With_Sys, Withn); | |
8406 | Mark_Rewrite_Insertion (Withn); | |
8407 | Set_Context_Installed (Withn); | |
8408 | ||
8409 | return True; | |
8410 | ||
8411 | -- Here if unit load failed | |
8412 | ||
8413 | else | |
8414 | Error_Msg_Name_1 := Name_System; | |
fbf5a39b | 8415 | Error_Msg_Name_2 := Chars (Expression (System_Extend_Unit)); |
996ae0b0 RK |
8416 | Error_Msg_N |
8417 | ("extension package `%.%` does not exist", | |
fbf5a39b | 8418 | Opt.System_Extend_Unit); |
996ae0b0 RK |
8419 | return False; |
8420 | end if; | |
8421 | end if; | |
8422 | end Present_System_Aux; | |
8423 | ||
8424 | ------------------------- | |
8425 | -- Restore_Scope_Stack -- | |
8426 | ------------------------- | |
8427 | ||
e530a2d1 AC |
8428 | procedure Restore_Scope_Stack |
8429 | (List : Elist_Id; | |
8430 | Handle_Use : Boolean := True) | |
8431 | is | |
8432 | SS_Last : constant Int := Scope_Stack.Last; | |
8433 | Elmt : Elmt_Id; | |
996ae0b0 RK |
8434 | |
8435 | begin | |
9e40f163 AC |
8436 | -- Restore visibility of previous scope stack, if any, using the list |
8437 | -- we saved (we use Remove, since this list will not be used again). | |
996ae0b0 | 8438 | |
9e40f163 AC |
8439 | loop |
8440 | Elmt := Last_Elmt (List); | |
8441 | exit when Elmt = No_Elmt; | |
e530a2d1 | 8442 | Set_Is_Immediately_Visible (Node (Elmt)); |
9e40f163 | 8443 | Remove_Last_Elmt (List); |
996ae0b0 | 8444 | end loop; |
fbf5a39b | 8445 | |
9e40f163 AC |
8446 | -- Restore use clauses |
8447 | ||
fbf5a39b AC |
8448 | if SS_Last >= Scope_Stack.First |
8449 | and then Scope_Stack.Table (SS_Last).Entity /= Standard_Standard | |
ecad994d | 8450 | and then Handle_Use |
fbf5a39b AC |
8451 | then |
8452 | Install_Use_Clauses (Scope_Stack.Table (SS_Last).First_Use_Clause); | |
8453 | end if; | |
996ae0b0 RK |
8454 | end Restore_Scope_Stack; |
8455 | ||
8456 | ---------------------- | |
8457 | -- Save_Scope_Stack -- | |
8458 | ---------------------- | |
8459 | ||
9e40f163 AC |
8460 | -- Save_Scope_Stack/Restore_Scope_Stack were originally designed to avoid |
8461 | -- consuming any memory. That is, Save_Scope_Stack took care of removing | |
8462 | -- from immediate visibility entities and Restore_Scope_Stack took care | |
8463 | -- of restoring their visibility analyzing the context of each entity. The | |
8464 | -- problem of such approach is that it was fragile and caused unexpected | |
8465 | -- visibility problems, and indeed one test was found where there was a | |
8466 | -- real problem. | |
8467 | ||
8468 | -- Furthermore, the following experiment was carried out: | |
8469 | ||
8470 | -- - Save_Scope_Stack was modified to store in an Elist1 all those | |
8471 | -- entities whose attribute Is_Immediately_Visible is modified | |
8472 | -- from True to False. | |
8473 | ||
8474 | -- - Restore_Scope_Stack was modified to store in another Elist2 | |
8475 | -- all the entities whose attribute Is_Immediately_Visible is | |
8476 | -- modified from False to True. | |
8477 | ||
8478 | -- - Extra code was added to verify that all the elements of Elist1 | |
8479 | -- are found in Elist2 | |
8480 | ||
a35017dc | 8481 | -- This test shows that there may be more occurrences of this problem which |
9e40f163 AC |
8482 | -- have not yet been detected. As a result, we replaced that approach by |
8483 | -- the current one in which Save_Scope_Stack returns the list of entities | |
a35017dc | 8484 | -- whose visibility is changed, and that list is passed to Restore_Scope_ |
9e40f163 AC |
8485 | -- Stack to undo that change. This approach is simpler and safer, although |
8486 | -- it consumes more memory. | |
8487 | ||
e530a2d1 AC |
8488 | function Save_Scope_Stack (Handle_Use : Boolean := True) return Elist_Id is |
8489 | Result : constant Elist_Id := New_Elmt_List; | |
996ae0b0 RK |
8490 | E : Entity_Id; |
8491 | S : Entity_Id; | |
8492 | SS_Last : constant Int := Scope_Stack.Last; | |
8493 | ||
e530a2d1 AC |
8494 | procedure Remove_From_Visibility (E : Entity_Id); |
8495 | -- If E is immediately visible then append it to the result and remove | |
85f6a831 RD |
8496 | -- it temporarily from visibility. |
8497 | ||
8498 | ---------------------------- | |
8499 | -- Remove_From_Visibility -- | |
8500 | ---------------------------- | |
8501 | ||
e530a2d1 AC |
8502 | procedure Remove_From_Visibility (E : Entity_Id) is |
8503 | begin | |
8504 | if Is_Immediately_Visible (E) then | |
8505 | Append_Elmt (E, Result); | |
8506 | Set_Is_Immediately_Visible (E, False); | |
8507 | end if; | |
8508 | end Remove_From_Visibility; | |
8509 | ||
85f6a831 RD |
8510 | -- Start of processing for Save_Scope_Stack |
8511 | ||
996ae0b0 RK |
8512 | begin |
8513 | if SS_Last >= Scope_Stack.First | |
8514 | and then Scope_Stack.Table (SS_Last).Entity /= Standard_Standard | |
8515 | then | |
ecad994d AC |
8516 | if Handle_Use then |
8517 | End_Use_Clauses (Scope_Stack.Table (SS_Last).First_Use_Clause); | |
8518 | end if; | |
fbf5a39b | 8519 | |
16ca248a ES |
8520 | -- If the call is from within a compilation unit, as when called from |
8521 | -- Rtsfind, make current entries in scope stack invisible while we | |
8522 | -- analyze the new unit. | |
996ae0b0 RK |
8523 | |
8524 | for J in reverse 0 .. SS_Last loop | |
8525 | exit when Scope_Stack.Table (J).Entity = Standard_Standard | |
8526 | or else No (Scope_Stack.Table (J).Entity); | |
8527 | ||
8528 | S := Scope_Stack.Table (J).Entity; | |
e530a2d1 AC |
8529 | |
8530 | Remove_From_Visibility (S); | |
996ae0b0 | 8531 | |
16ca248a | 8532 | E := First_Entity (S); |
996ae0b0 | 8533 | while Present (E) loop |
e530a2d1 | 8534 | Remove_From_Visibility (E); |
996ae0b0 RK |
8535 | Next_Entity (E); |
8536 | end loop; | |
8537 | end loop; | |
8538 | ||
8539 | end if; | |
e530a2d1 AC |
8540 | |
8541 | return Result; | |
996ae0b0 RK |
8542 | end Save_Scope_Stack; |
8543 | ||
8544 | ------------- | |
8545 | -- Set_Use -- | |
8546 | ------------- | |
8547 | ||
8548 | procedure Set_Use (L : List_Id) is | |
8549 | Decl : Node_Id; | |
8550 | Pack_Name : Node_Id; | |
8551 | Pack : Entity_Id; | |
8552 | Id : Entity_Id; | |
8553 | ||
8554 | begin | |
8555 | if Present (L) then | |
8556 | Decl := First (L); | |
996ae0b0 RK |
8557 | while Present (Decl) loop |
8558 | if Nkind (Decl) = N_Use_Package_Clause then | |
8559 | Chain_Use_Clause (Decl); | |
996ae0b0 | 8560 | |
16ca248a | 8561 | Pack_Name := First (Names (Decl)); |
996ae0b0 RK |
8562 | while Present (Pack_Name) loop |
8563 | Pack := Entity (Pack_Name); | |
8564 | ||
8565 | if Ekind (Pack) = E_Package | |
8566 | and then Applicable_Use (Pack_Name) | |
8567 | then | |
8568 | Use_One_Package (Pack, Decl); | |
8569 | end if; | |
8570 | ||
8571 | Next (Pack_Name); | |
8572 | end loop; | |
8573 | ||
8574 | elsif Nkind (Decl) = N_Use_Type_Clause then | |
8575 | Chain_Use_Clause (Decl); | |
996ae0b0 | 8576 | |
16ca248a | 8577 | Id := First (Subtype_Marks (Decl)); |
996ae0b0 RK |
8578 | while Present (Id) loop |
8579 | if Entity (Id) /= Any_Type then | |
07fc65c4 | 8580 | Use_One_Type (Id); |
996ae0b0 RK |
8581 | end if; |
8582 | ||
8583 | Next (Id); | |
8584 | end loop; | |
8585 | end if; | |
8586 | ||
8587 | Next (Decl); | |
8588 | end loop; | |
8589 | end if; | |
8590 | end Set_Use; | |
8591 | ||
8592 | --------------------- | |
8593 | -- Use_One_Package -- | |
8594 | --------------------- | |
8595 | ||
8596 | procedure Use_One_Package (P : Entity_Id; N : Node_Id) is | |
8597 | Id : Entity_Id; | |
8598 | Prev : Entity_Id; | |
8599 | Current_Instance : Entity_Id := Empty; | |
8600 | Real_P : Entity_Id; | |
9bc856dd | 8601 | Private_With_OK : Boolean := False; |
996ae0b0 RK |
8602 | |
8603 | begin | |
8604 | if Ekind (P) /= E_Package then | |
8605 | return; | |
8606 | end if; | |
8607 | ||
8608 | Set_In_Use (P); | |
d4810530 | 8609 | Set_Current_Use_Clause (P, N); |
996ae0b0 | 8610 | |
0ab80019 | 8611 | -- Ada 2005 (AI-50217): Check restriction |
19f0526a | 8612 | |
7b56a91b | 8613 | if From_Limited_With (P) then |
657a9dd9 | 8614 | Error_Msg_N ("limited withed package cannot appear in use clause", N); |
996ae0b0 RK |
8615 | end if; |
8616 | ||
bc41faa2 | 8617 | -- Find enclosing instance, if any |
996ae0b0 RK |
8618 | |
8619 | if In_Instance then | |
8620 | Current_Instance := Current_Scope; | |
996ae0b0 RK |
8621 | while not Is_Generic_Instance (Current_Instance) loop |
8622 | Current_Instance := Scope (Current_Instance); | |
8623 | end loop; | |
8624 | ||
8625 | if No (Hidden_By_Use_Clause (N)) then | |
8626 | Set_Hidden_By_Use_Clause (N, New_Elmt_List); | |
8627 | end if; | |
8628 | end if; | |
8629 | ||
8630 | -- If unit is a package renaming, indicate that the renamed | |
8631 | -- package is also in use (the flags on both entities must | |
8632 | -- remain consistent, and a subsequent use of either of them | |
8633 | -- should be recognized as redundant). | |
8634 | ||
8635 | if Present (Renamed_Object (P)) then | |
8636 | Set_In_Use (Renamed_Object (P)); | |
d4810530 | 8637 | Set_Current_Use_Clause (Renamed_Object (P), N); |
996ae0b0 RK |
8638 | Real_P := Renamed_Object (P); |
8639 | else | |
8640 | Real_P := P; | |
8641 | end if; | |
8642 | ||
0ab80019 | 8643 | -- Ada 2005 (AI-262): Check the use_clause of a private withed package |
9bc856dd AC |
8644 | -- found in the private part of a package specification |
8645 | ||
8646 | if In_Private_Part (Current_Scope) | |
8647 | and then Has_Private_With (P) | |
8648 | and then Is_Child_Unit (Current_Scope) | |
8649 | and then Is_Child_Unit (P) | |
8650 | and then Is_Ancestor_Package (Scope (Current_Scope), P) | |
8651 | then | |
8652 | Private_With_OK := True; | |
8653 | end if; | |
8654 | ||
996ae0b0 RK |
8655 | -- Loop through entities in one package making them potentially |
8656 | -- use-visible. | |
8657 | ||
8658 | Id := First_Entity (P); | |
8659 | while Present (Id) | |
9bc856dd | 8660 | and then (Id /= First_Private_Entity (P) |
ac7d724d | 8661 | or else Private_With_OK) -- Ada 2005 (AI-262) |
996ae0b0 RK |
8662 | loop |
8663 | Prev := Current_Entity (Id); | |
996ae0b0 RK |
8664 | while Present (Prev) loop |
8665 | if Is_Immediately_Visible (Prev) | |
8666 | and then (not Is_Overloadable (Prev) | |
8667 | or else not Is_Overloadable (Id) | |
8668 | or else (Type_Conformant (Id, Prev))) | |
8669 | then | |
8670 | if No (Current_Instance) then | |
8671 | ||
8672 | -- Potentially use-visible entity remains hidden | |
8673 | ||
8674 | goto Next_Usable_Entity; | |
8675 | ||
16ca248a ES |
8676 | -- A use clause within an instance hides outer global entities, |
8677 | -- which are not used to resolve local entities in the | |
8678 | -- instance. Note that the predefined entities in Standard | |
8679 | -- could not have been hidden in the generic by a use clause, | |
8680 | -- and therefore remain visible. Other compilation units whose | |
8681 | -- entities appear in Standard must be hidden in an instance. | |
996ae0b0 RK |
8682 | |
8683 | -- To determine whether an entity is external to the instance | |
8684 | -- we compare the scope depth of its scope with that of the | |
8685 | -- current instance. However, a generic actual of a subprogram | |
8686 | -- instance is declared in the wrapper package but will not be | |
e074d476 AC |
8687 | -- hidden by a use-visible entity. similarly, an entity that is |
8688 | -- declared in an enclosing instance will not be hidden by an | |
8689 | -- an entity declared in a generic actual, which can only have | |
8690 | -- been use-visible in the generic and will not have hidden the | |
8691 | -- entity in the generic parent. | |
996ae0b0 | 8692 | |
82c80734 RD |
8693 | -- If Id is called Standard, the predefined package with the |
8694 | -- same name is in the homonym chain. It has to be ignored | |
8695 | -- because it has no defined scope (being the only entity in | |
8696 | -- the system with this mandated behavior). | |
8697 | ||
996ae0b0 | 8698 | elsif not Is_Hidden (Id) |
82c80734 | 8699 | and then Present (Scope (Prev)) |
996ae0b0 RK |
8700 | and then not Is_Wrapper_Package (Scope (Prev)) |
8701 | and then Scope_Depth (Scope (Prev)) < | |
8702 | Scope_Depth (Current_Instance) | |
8703 | and then (Scope (Prev) /= Standard_Standard | |
8704 | or else Sloc (Prev) > Standard_Location) | |
8705 | then | |
e074d476 AC |
8706 | if In_Open_Scopes (Scope (Prev)) |
8707 | and then Is_Generic_Instance (Scope (Prev)) | |
c94a0b9d AC |
8708 | and then Present (Associated_Formal_Package (P)) |
8709 | then | |
8710 | null; | |
8711 | ||
8712 | else | |
8713 | Set_Is_Potentially_Use_Visible (Id); | |
8714 | Set_Is_Immediately_Visible (Prev, False); | |
8715 | Append_Elmt (Prev, Hidden_By_Use_Clause (N)); | |
8716 | end if; | |
996ae0b0 RK |
8717 | end if; |
8718 | ||
16ca248a ES |
8719 | -- A user-defined operator is not use-visible if the predefined |
8720 | -- operator for the type is immediately visible, which is the case | |
8721 | -- if the type of the operand is in an open scope. This does not | |
8722 | -- apply to user-defined operators that have operands of different | |
8723 | -- types, because the predefined mixed mode operations (multiply | |
8724 | -- and divide) apply to universal types and do not hide anything. | |
996ae0b0 RK |
8725 | |
8726 | elsif Ekind (Prev) = E_Operator | |
8727 | and then Operator_Matches_Spec (Prev, Id) | |
8728 | and then In_Open_Scopes | |
ac7d724d | 8729 | (Scope (Base_Type (Etype (First_Formal (Id))))) |
996ae0b0 | 8730 | and then (No (Next_Formal (First_Formal (Id))) |
ac7d724d ES |
8731 | or else Etype (First_Formal (Id)) = |
8732 | Etype (Next_Formal (First_Formal (Id))) | |
996ae0b0 RK |
8733 | or else Chars (Prev) = Name_Op_Expon) |
8734 | then | |
8735 | goto Next_Usable_Entity; | |
e69614ad AC |
8736 | |
8737 | -- In an instance, two homonyms may become use_visible through the | |
8738 | -- actuals of distinct formal packages. In the generic, only the | |
8739 | -- current one would have been visible, so make the other one | |
8740 | -- not use_visible. | |
8741 | ||
8742 | elsif Present (Current_Instance) | |
8743 | and then Is_Potentially_Use_Visible (Prev) | |
8744 | and then not Is_Overloadable (Prev) | |
8745 | and then Scope (Id) /= Scope (Prev) | |
8746 | and then Used_As_Generic_Actual (Scope (Prev)) | |
8747 | and then Used_As_Generic_Actual (Scope (Id)) | |
30196a76 RD |
8748 | and then not In_Same_List (Current_Use_Clause (Scope (Prev)), |
8749 | Current_Use_Clause (Scope (Id))) | |
e69614ad AC |
8750 | then |
8751 | Set_Is_Potentially_Use_Visible (Prev, False); | |
8752 | Append_Elmt (Prev, Hidden_By_Use_Clause (N)); | |
996ae0b0 RK |
8753 | end if; |
8754 | ||
8755 | Prev := Homonym (Prev); | |
8756 | end loop; | |
8757 | ||
bc41faa2 | 8758 | -- On exit, we know entity is not hidden, unless it is private |
996ae0b0 RK |
8759 | |
8760 | if not Is_Hidden (Id) | |
ac7d724d | 8761 | and then ((not Is_Child_Unit (Id)) or else Is_Visible_Lib_Unit (Id)) |
996ae0b0 RK |
8762 | then |
8763 | Set_Is_Potentially_Use_Visible (Id); | |
8764 | ||
ac7d724d | 8765 | if Is_Private_Type (Id) and then Present (Full_View (Id)) then |
996ae0b0 RK |
8766 | Set_Is_Potentially_Use_Visible (Full_View (Id)); |
8767 | end if; | |
8768 | end if; | |
8769 | ||
8770 | <<Next_Usable_Entity>> | |
8771 | Next_Entity (Id); | |
8772 | end loop; | |
8773 | ||
16ca248a ES |
8774 | -- Child units are also made use-visible by a use clause, but they may |
8775 | -- appear after all visible declarations in the parent entity list. | |
996ae0b0 RK |
8776 | |
8777 | while Present (Id) loop | |
8398e82e | 8778 | if Is_Child_Unit (Id) and then Is_Visible_Lib_Unit (Id) then |
996ae0b0 RK |
8779 | Set_Is_Potentially_Use_Visible (Id); |
8780 | end if; | |
8781 | ||
8782 | Next_Entity (Id); | |
8783 | end loop; | |
8784 | ||
8785 | if Chars (Real_P) = Name_System | |
8786 | and then Scope (Real_P) = Standard_Standard | |
8787 | and then Present_System_Aux (N) | |
8788 | then | |
8789 | Use_One_Package (System_Aux_Id, N); | |
8790 | end if; | |
8791 | ||
8792 | end Use_One_Package; | |
8793 | ||
8794 | ------------------ | |
8795 | -- Use_One_Type -- | |
8796 | ------------------ | |
8797 | ||
7ff2d234 | 8798 | procedure Use_One_Type (Id : Node_Id; Installed : Boolean := False) is |
954c111a HK |
8799 | Elmt : Elmt_Id; |
8800 | Is_Known_Used : Boolean; | |
8801 | Op_List : Elist_Id; | |
8802 | T : Entity_Id; | |
8803 | ||
8804 | function Spec_Reloaded_For_Body return Boolean; | |
8805 | -- Determine whether the compilation unit is a package body and the use | |
8806 | -- type clause is in the spec of the same package. Even though the spec | |
8807 | -- was analyzed first, its context is reloaded when analysing the body. | |
8808 | ||
29efbb8c ES |
8809 | procedure Use_Class_Wide_Operations (Typ : Entity_Id); |
8810 | -- AI05-150: if the use_type_clause carries the "all" qualifier, | |
8811 | -- class-wide operations of ancestor types are use-visible if the | |
8812 | -- ancestor type is visible. | |
8813 | ||
954c111a HK |
8814 | ---------------------------- |
8815 | -- Spec_Reloaded_For_Body -- | |
8816 | ---------------------------- | |
8817 | ||
8818 | function Spec_Reloaded_For_Body return Boolean is | |
8819 | begin | |
8820 | if Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Body then | |
8821 | declare | |
8822 | Spec : constant Node_Id := | |
8823 | Parent (List_Containing (Parent (Id))); | |
f146302c | 8824 | |
d99ff0f4 | 8825 | begin |
f146302c AC |
8826 | -- Check whether type is declared in a package specification, |
8827 | -- and current unit is the corresponding package body. The | |
8828 | -- use clauses themselves may be within a nested package. | |
8829 | ||
954c111a HK |
8830 | return |
8831 | Nkind (Spec) = N_Package_Specification | |
d99ff0f4 AC |
8832 | and then |
8833 | In_Same_Source_Unit (Corresponding_Body (Parent (Spec)), | |
8834 | Cunit_Entity (Current_Sem_Unit)); | |
954c111a HK |
8835 | end; |
8836 | end if; | |
8837 | ||
8838 | return False; | |
8839 | end Spec_Reloaded_For_Body; | |
8840 | ||
29efbb8c ES |
8841 | ------------------------------- |
8842 | -- Use_Class_Wide_Operations -- | |
8843 | ------------------------------- | |
8844 | ||
8845 | procedure Use_Class_Wide_Operations (Typ : Entity_Id) is | |
8846 | Scop : Entity_Id; | |
8847 | Ent : Entity_Id; | |
8848 | ||
8849 | function Is_Class_Wide_Operation_Of | |
8850 | (Op : Entity_Id; | |
8851 | T : Entity_Id) return Boolean; | |
8852 | -- Determine whether a subprogram has a class-wide parameter or | |
8853 | -- result that is T'Class. | |
8854 | ||
8855 | --------------------------------- | |
8856 | -- Is_Class_Wide_Operation_Of -- | |
8857 | --------------------------------- | |
8858 | ||
8859 | function Is_Class_Wide_Operation_Of | |
8860 | (Op : Entity_Id; | |
8861 | T : Entity_Id) return Boolean | |
8862 | is | |
8863 | Formal : Entity_Id; | |
8864 | ||
8865 | begin | |
8866 | Formal := First_Formal (Op); | |
8867 | while Present (Formal) loop | |
8868 | if Etype (Formal) = Class_Wide_Type (T) then | |
8869 | return True; | |
8870 | end if; | |
8871 | Next_Formal (Formal); | |
8872 | end loop; | |
8873 | ||
8874 | if Etype (Op) = Class_Wide_Type (T) then | |
8875 | return True; | |
8876 | end if; | |
8877 | ||
8878 | return False; | |
8879 | end Is_Class_Wide_Operation_Of; | |
8880 | ||
8881 | -- Start of processing for Use_Class_Wide_Operations | |
8882 | ||
8883 | begin | |
8884 | Scop := Scope (Typ); | |
8885 | if not Is_Hidden (Scop) then | |
8886 | Ent := First_Entity (Scop); | |
8887 | while Present (Ent) loop | |
8888 | if Is_Overloadable (Ent) | |
8889 | and then Is_Class_Wide_Operation_Of (Ent, Typ) | |
8890 | and then not Is_Potentially_Use_Visible (Ent) | |
8891 | then | |
8892 | Set_Is_Potentially_Use_Visible (Ent); | |
8893 | Append_Elmt (Ent, Used_Operations (Parent (Id))); | |
8894 | end if; | |
8895 | ||
8896 | Next_Entity (Ent); | |
8897 | end loop; | |
8898 | end if; | |
8899 | ||
8900 | if Is_Derived_Type (Typ) then | |
8901 | Use_Class_Wide_Operations (Etype (Base_Type (Typ))); | |
8902 | end if; | |
8903 | end Use_Class_Wide_Operations; | |
8904 | ||
dea1d3dc | 8905 | -- Start of processing for Use_One_Type |
996ae0b0 RK |
8906 | |
8907 | begin | |
8908 | -- It is the type determined by the subtype mark (8.4(8)) whose | |
8909 | -- operations become potentially use-visible. | |
8910 | ||
8911 | T := Base_Type (Entity (Id)); | |
8912 | ||
954c111a HK |
8913 | -- Either the type itself is used, the package where it is declared |
8914 | -- is in use or the entity is declared in the current package, thus | |
8915 | -- use-visible. | |
8916 | ||
8917 | Is_Known_Used := | |
8918 | In_Use (T) | |
8919 | or else In_Use (Scope (T)) | |
8920 | or else Scope (T) = Current_Scope; | |
8921 | ||
8922 | Set_Redundant_Use (Id, | |
8923 | Is_Known_Used or else Is_Potentially_Use_Visible (T)); | |
996ae0b0 | 8924 | |
ecc4ddde AC |
8925 | if Ekind (T) = E_Incomplete_Type then |
8926 | Error_Msg_N ("premature usage of incomplete type", Id); | |
8927 | ||
8928 | elsif In_Open_Scopes (Scope (T)) then | |
996ae0b0 RK |
8929 | null; |
8930 | ||
f7ca1d04 AC |
8931 | -- A limited view cannot appear in a use_type clause. However, an access |
8932 | -- type whose designated type is limited has the flag but is not itself | |
8933 | -- a limited view unless we only have a limited view of its enclosing | |
8934 | -- package. | |
294ccb21 | 8935 | |
7b56a91b | 8936 | elsif From_Limited_With (T) and then From_Limited_With (Scope (T)) then |
923fa078 RD |
8937 | Error_Msg_N |
8938 | ("incomplete type from limited view " | |
ac7d724d | 8939 | & "cannot appear in use clause", Id); |
923fa078 | 8940 | |
fbf5a39b AC |
8941 | -- If the subtype mark designates a subtype in a different package, |
8942 | -- we have to check that the parent type is visible, otherwise the | |
8943 | -- use type clause is a noop. Not clear how to do that??? | |
8944 | ||
996ae0b0 RK |
8945 | elsif not Redundant_Use (Id) then |
8946 | Set_In_Use (T); | |
c3b36d48 AC |
8947 | |
8948 | -- If T is tagged, primitive operators on class-wide operands | |
8949 | -- are also available. | |
8950 | ||
8951 | if Is_Tagged_Type (T) then | |
8952 | Set_In_Use (Class_Wide_Type (T)); | |
8953 | end if; | |
8954 | ||
21d27997 | 8955 | Set_Current_Use_Clause (T, Parent (Id)); |
996ae0b0 | 8956 | |
29efbb8c ES |
8957 | -- Iterate over primitive operations of the type. If an operation is |
8958 | -- already use_visible, it is the result of a previous use_clause, | |
7ff2d234 AC |
8959 | -- and already appears on the corresponding entity chain. If the |
8960 | -- clause is being reinstalled, operations are already use-visible. | |
29efbb8c | 8961 | |
7ff2d234 AC |
8962 | if Installed then |
8963 | null; | |
29efbb8c | 8964 | |
7ff2d234 AC |
8965 | else |
8966 | Op_List := Collect_Primitive_Operations (T); | |
8967 | Elmt := First_Elmt (Op_List); | |
8968 | while Present (Elmt) loop | |
8969 | if (Nkind (Node (Elmt)) = N_Defining_Operator_Symbol | |
8970 | or else Chars (Node (Elmt)) in Any_Operator_Name) | |
8971 | and then not Is_Hidden (Node (Elmt)) | |
8972 | and then not Is_Potentially_Use_Visible (Node (Elmt)) | |
8973 | then | |
8974 | Set_Is_Potentially_Use_Visible (Node (Elmt)); | |
8975 | Append_Elmt (Node (Elmt), Used_Operations (Parent (Id))); | |
996ae0b0 | 8976 | |
7ff2d234 AC |
8977 | elsif Ada_Version >= Ada_2012 |
8978 | and then All_Present (Parent (Id)) | |
8979 | and then not Is_Hidden (Node (Elmt)) | |
8980 | and then not Is_Potentially_Use_Visible (Node (Elmt)) | |
8981 | then | |
8982 | Set_Is_Potentially_Use_Visible (Node (Elmt)); | |
8983 | Append_Elmt (Node (Elmt), Used_Operations (Parent (Id))); | |
8984 | end if; | |
954c111a | 8985 | |
7ff2d234 AC |
8986 | Next_Elmt (Elmt); |
8987 | end loop; | |
8988 | end if; | |
8989 | ||
8990 | if Ada_Version >= Ada_2012 | |
8991 | and then All_Present (Parent (Id)) | |
8992 | and then Is_Tagged_Type (T) | |
8993 | then | |
8994 | Use_Class_Wide_Operations (T); | |
8995 | end if; | |
29efbb8c ES |
8996 | end if; |
8997 | ||
954c111a HK |
8998 | -- If warning on redundant constructs, check for unnecessary WITH |
8999 | ||
9000 | if Warn_On_Redundant_Constructs | |
9001 | and then Is_Known_Used | |
9002 | ||
ac7d724d ES |
9003 | -- with P; with P; use P; |
9004 | -- package P is package X is package body X is | |
9005 | -- type T ... use P.T; | |
954c111a | 9006 | |
ac7d724d ES |
9007 | -- The compilation unit is the body of X. GNAT first compiles the |
9008 | -- spec of X, then proceeds to the body. At that point P is marked | |
9009 | -- as use visible. The analysis then reinstalls the spec along with | |
9010 | -- its context. The use clause P.T is now recognized as redundant, | |
9011 | -- but in the wrong context. Do not emit a warning in such cases. | |
9012 | -- Do not emit a warning either if we are in an instance, there is | |
9013 | -- no redundancy between an outer use_clause and one that appears | |
9014 | -- within the generic. | |
954c111a HK |
9015 | |
9016 | and then not Spec_Reloaded_For_Body | |
c56094bd | 9017 | and then not In_Instance |
954c111a HK |
9018 | then |
9019 | -- The type already has a use clause | |
9020 | ||
9021 | if In_Use (T) then | |
3ea52b2e ES |
9022 | |
9023 | -- Case where we know the current use clause for the type | |
9024 | ||
21d27997 | 9025 | if Present (Current_Use_Clause (T)) then |
44b90160 | 9026 | Use_Clause_Known : declare |
21d27997 RD |
9027 | Clause1 : constant Node_Id := Parent (Id); |
9028 | Clause2 : constant Node_Id := Current_Use_Clause (T); | |
3ea52b2e ES |
9029 | Ent1 : Entity_Id; |
9030 | Ent2 : Entity_Id; | |
21d27997 RD |
9031 | Err_No : Node_Id; |
9032 | Unit1 : Node_Id; | |
9033 | Unit2 : Node_Id; | |
9034 | ||
7ca139d3 TQ |
9035 | function Entity_Of_Unit (U : Node_Id) return Entity_Id; |
9036 | -- Return the appropriate entity for determining which unit | |
9037 | -- has a deeper scope: the defining entity for U, unless U | |
9038 | -- is a package instance, in which case we retrieve the | |
9039 | -- entity of the instance spec. | |
9040 | ||
9041 | -------------------- | |
9042 | -- Entity_Of_Unit -- | |
9043 | -------------------- | |
9044 | ||
9045 | function Entity_Of_Unit (U : Node_Id) return Entity_Id is | |
9046 | begin | |
9047 | if Nkind (U) = N_Package_Instantiation | |
9048 | and then Analyzed (U) | |
9049 | then | |
9050 | return Defining_Entity (Instance_Spec (U)); | |
9051 | else | |
9052 | return Defining_Entity (U); | |
9053 | end if; | |
9054 | end Entity_Of_Unit; | |
9055 | ||
44b90160 RD |
9056 | -- Start of processing for Use_Clause_Known |
9057 | ||
21d27997 | 9058 | begin |
f7ca1d04 AC |
9059 | -- If both current use type clause and the use type clause |
9060 | -- for the type are at the compilation unit level, one of | |
9061 | -- the units must be an ancestor of the other, and the | |
9062 | -- warning belongs on the descendant. | |
3ea52b2e | 9063 | |
21d27997 | 9064 | if Nkind (Parent (Clause1)) = N_Compilation_Unit |
3ea52b2e ES |
9065 | and then |
9066 | Nkind (Parent (Clause2)) = N_Compilation_Unit | |
21d27997 | 9067 | then |
b0d3b11d AC |
9068 | -- If the unit is a subprogram body that acts as spec, |
9069 | -- the context clause is shared with the constructed | |
9070 | -- subprogram spec. Clearly there is no redundancy. | |
9071 | ||
9072 | if Clause1 = Clause2 then | |
9073 | return; | |
9074 | end if; | |
9075 | ||
3ea52b2e ES |
9076 | Unit1 := Unit (Parent (Clause1)); |
9077 | Unit2 := Unit (Parent (Clause2)); | |
9078 | ||
32beb1f3 AC |
9079 | -- If both clauses are on same unit, or one is the body |
9080 | -- of the other, or one of them is in a subunit, report | |
9081 | -- redundancy on the later one. | |
f7ca1d04 AC |
9082 | |
9083 | if Unit1 = Unit2 then | |
9084 | Error_Msg_Sloc := Sloc (Current_Use_Clause (T)); | |
ed2233dc | 9085 | Error_Msg_NE -- CODEFIX |
f7ca1d04 | 9086 | ("& is already use-visible through previous " |
dbfeb4fa | 9087 | & "use_type_clause #??", Clause1, T); |
f7ca1d04 | 9088 | return; |
32beb1f3 AC |
9089 | |
9090 | elsif Nkind (Unit1) = N_Subunit then | |
9091 | Error_Msg_Sloc := Sloc (Current_Use_Clause (T)); | |
ed2233dc | 9092 | Error_Msg_NE -- CODEFIX |
32beb1f3 | 9093 | ("& is already use-visible through previous " |
dbfeb4fa | 9094 | & "use_type_clause #??", Clause1, T); |
32beb1f3 AC |
9095 | return; |
9096 | ||
9097 | elsif Nkind_In (Unit2, N_Package_Body, N_Subprogram_Body) | |
9098 | and then Nkind (Unit1) /= Nkind (Unit2) | |
9099 | and then Nkind (Unit1) /= N_Subunit | |
9100 | then | |
9101 | Error_Msg_Sloc := Sloc (Clause1); | |
ed2233dc | 9102 | Error_Msg_NE -- CODEFIX |
32beb1f3 | 9103 | ("& is already use-visible through previous " |
dbfeb4fa | 9104 | & "use_type_clause #??", Current_Use_Clause (T), T); |
32beb1f3 | 9105 | return; |
f7ca1d04 AC |
9106 | end if; |
9107 | ||
21d27997 RD |
9108 | -- There is a redundant use type clause in a child unit. |
9109 | -- Determine which of the units is more deeply nested. | |
3ea52b2e | 9110 | -- If a unit is a package instance, retrieve the entity |
7ca139d3 | 9111 | -- and its scope from the instance spec. |
21d27997 | 9112 | |
7ca139d3 TQ |
9113 | Ent1 := Entity_Of_Unit (Unit1); |
9114 | Ent2 := Entity_Of_Unit (Unit2); | |
3ea52b2e ES |
9115 | |
9116 | if Scope (Ent2) = Standard_Standard then | |
21d27997 RD |
9117 | Error_Msg_Sloc := Sloc (Current_Use_Clause (T)); |
9118 | Err_No := Clause1; | |
9119 | ||
3ea52b2e | 9120 | elsif Scope (Ent1) = Standard_Standard then |
21d27997 RD |
9121 | Error_Msg_Sloc := Sloc (Id); |
9122 | Err_No := Clause2; | |
9123 | ||
7ca139d3 TQ |
9124 | -- If both units are child units, we determine which one |
9125 | -- is the descendant by the scope distance to the | |
3ea52b2e | 9126 | -- ultimate parent unit. |
21d27997 | 9127 | |
3ea52b2e | 9128 | else |
21d27997 RD |
9129 | declare |
9130 | S1, S2 : Entity_Id; | |
9131 | ||
9132 | begin | |
3ea52b2e ES |
9133 | S1 := Scope (Ent1); |
9134 | S2 := Scope (Ent2); | |
c97c0163 AC |
9135 | while Present (S1) |
9136 | and then Present (S2) | |
9137 | and then S1 /= Standard_Standard | |
9138 | and then S2 /= Standard_Standard | |
21d27997 RD |
9139 | loop |
9140 | S1 := Scope (S1); | |
9141 | S2 := Scope (S2); | |
9142 | end loop; | |
9143 | ||
9144 | if S1 = Standard_Standard then | |
9145 | Error_Msg_Sloc := Sloc (Id); | |
9146 | Err_No := Clause2; | |
9147 | else | |
9148 | Error_Msg_Sloc := Sloc (Current_Use_Clause (T)); | |
9149 | Err_No := Clause1; | |
9150 | end if; | |
9151 | end; | |
9152 | end if; | |
9153 | ||
ed2233dc | 9154 | Error_Msg_NE -- CODEFIX |
21d27997 | 9155 | ("& is already use-visible through previous " |
dbfeb4fa | 9156 | & "use_type_clause #??", Err_No, Id); |
3ea52b2e ES |
9157 | |
9158 | -- Case where current use type clause and the use type | |
9159 | -- clause for the type are not both at the compilation unit | |
9160 | -- level. In this case we don't have location information. | |
9161 | ||
21d27997 | 9162 | else |
ed2233dc | 9163 | Error_Msg_NE -- CODEFIX |
3ea52b2e | 9164 | ("& is already use-visible through previous " |
dbfeb4fa | 9165 | & "use type clause??", Id, T); |
21d27997 | 9166 | end if; |
44b90160 | 9167 | end Use_Clause_Known; |
3ea52b2e ES |
9168 | |
9169 | -- Here if Current_Use_Clause is not set for T, another case | |
9170 | -- where we do not have the location information available. | |
9171 | ||
21d27997 | 9172 | else |
ed2233dc | 9173 | Error_Msg_NE -- CODEFIX |
3ea52b2e | 9174 | ("& is already use-visible through previous " |
dbfeb4fa | 9175 | & "use type clause??", Id, T); |
21d27997 | 9176 | end if; |
954c111a HK |
9177 | |
9178 | -- The package where T is declared is already used | |
9179 | ||
9180 | elsif In_Use (Scope (T)) then | |
9181 | Error_Msg_Sloc := Sloc (Current_Use_Clause (Scope (T))); | |
ed2233dc | 9182 | Error_Msg_NE -- CODEFIX |
dbfeb4fa | 9183 | ("& is already use-visible through package use clause #??", |
37951d8e | 9184 | Id, T); |
954c111a HK |
9185 | |
9186 | -- The current scope is the package where T is declared | |
9187 | ||
9188 | else | |
9189 | Error_Msg_Node_2 := Scope (T); | |
ed2233dc | 9190 | Error_Msg_NE -- CODEFIX |
dbfeb4fa | 9191 | ("& is already use-visible inside package &??", Id, T); |
954c111a HK |
9192 | end if; |
9193 | end if; | |
996ae0b0 RK |
9194 | end Use_One_Type; |
9195 | ||
9196 | ---------------- | |
9197 | -- Write_Info -- | |
9198 | ---------------- | |
9199 | ||
9200 | procedure Write_Info is | |
9201 | Id : Entity_Id := First_Entity (Current_Scope); | |
9202 | ||
9203 | begin | |
9204 | -- No point in dumping standard entities | |
9205 | ||
9206 | if Current_Scope = Standard_Standard then | |
9207 | return; | |
9208 | end if; | |
9209 | ||
9210 | Write_Str ("========================================================"); | |
9211 | Write_Eol; | |
9212 | Write_Str (" Defined Entities in "); | |
9213 | Write_Name (Chars (Current_Scope)); | |
9214 | Write_Eol; | |
9215 | Write_Str ("========================================================"); | |
9216 | Write_Eol; | |
9217 | ||
9218 | if No (Id) then | |
9219 | Write_Str ("-- none --"); | |
9220 | Write_Eol; | |
9221 | ||
9222 | else | |
9223 | while Present (Id) loop | |
9224 | Write_Entity_Info (Id, " "); | |
9225 | Next_Entity (Id); | |
9226 | end loop; | |
9227 | end if; | |
9228 | ||
9229 | if Scope (Current_Scope) = Standard_Standard then | |
9230 | ||
9231 | -- Print information on the current unit itself | |
9232 | ||
9233 | Write_Entity_Info (Current_Scope, " "); | |
9234 | end if; | |
9235 | ||
9236 | Write_Eol; | |
9237 | end Write_Info; | |
9238 | ||
67536dcb RD |
9239 | -------- |
9240 | -- ws -- | |
9241 | -------- | |
996ae0b0 | 9242 | |
67536dcb | 9243 | procedure ws is |
996ae0b0 | 9244 | S : Entity_Id; |
996ae0b0 RK |
9245 | begin |
9246 | for J in reverse 1 .. Scope_Stack.Last loop | |
9247 | S := Scope_Stack.Table (J).Entity; | |
9248 | Write_Int (Int (S)); | |
9249 | Write_Str (" === "); | |
9250 | Write_Name (Chars (S)); | |
9251 | Write_Eol; | |
9252 | end loop; | |
67536dcb | 9253 | end ws; |
996ae0b0 | 9254 | |
c1ce0691 ES |
9255 | -------- |
9256 | -- we -- | |
9257 | -------- | |
9258 | ||
9259 | procedure we (S : Entity_Id) is | |
9260 | E : Entity_Id; | |
9261 | begin | |
9262 | E := First_Entity (S); | |
9263 | while Present (E) loop | |
9264 | Write_Int (Int (E)); | |
9265 | Write_Str (" === "); | |
9266 | Write_Name (Chars (E)); | |
9267 | Write_Eol; | |
c1ce0691 ES |
9268 | Next_Entity (E); |
9269 | end loop; | |
9270 | end we; | |
996ae0b0 | 9271 | end Sem_Ch8; |