]>
Commit | Line | Data |
---|---|---|
4094dca5 | 1 | ------------------------------------------------------------------------------ |
ee6ba406 | 2 | -- -- |
3 | -- GNAT COMPILER COMPONENTS -- | |
4 | -- -- | |
5 | -- E X P _ C H 6 -- | |
6 | -- -- | |
7 | -- B o d y -- | |
8 | -- -- | |
e9c75a1a | 9 | -- Copyright (C) 1992-2019, Free Software Foundation, Inc. -- |
ee6ba406 | 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- -- | |
80df182a | 13 | -- ware Foundation; either version 3, or (at your option) any later ver- -- |
ee6ba406 | 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 -- | |
80df182a | 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. -- | |
ee6ba406 | 20 | -- -- |
21 | -- GNAT was originally developed by the GNAT team at New York University. -- | |
e78e8c8e | 22 | -- Extensive contributions were provided by Ada Core Technologies Inc. -- |
ee6ba406 | 23 | -- -- |
24 | ------------------------------------------------------------------------------ | |
25 | ||
5f443c6d | 26 | with Atree; use Atree; |
1ab3cdde | 27 | with Aspects; use Aspects; |
5f443c6d | 28 | with Checks; use Checks; |
29 | with Contracts; use Contracts; | |
30 | with Debug; use Debug; | |
31 | with Einfo; use Einfo; | |
32 | with Errout; use Errout; | |
33 | with Elists; use Elists; | |
8b3a98b2 | 34 | with Expander; use Expander; |
5f443c6d | 35 | with Exp_Aggr; use Exp_Aggr; |
36 | with Exp_Atag; use Exp_Atag; | |
37 | with Exp_Ch2; use Exp_Ch2; | |
38 | with Exp_Ch3; use Exp_Ch3; | |
39 | with Exp_Ch7; use Exp_Ch7; | |
40 | with Exp_Ch9; use Exp_Ch9; | |
41 | with Exp_Dbug; use Exp_Dbug; | |
42 | with Exp_Disp; use Exp_Disp; | |
43 | with Exp_Dist; use Exp_Dist; | |
44 | with Exp_Intr; use Exp_Intr; | |
45 | with Exp_Pakd; use Exp_Pakd; | |
46 | with Exp_Tss; use Exp_Tss; | |
5f443c6d | 47 | with Exp_Util; use Exp_Util; |
48 | with Freeze; use Freeze; | |
5f443c6d | 49 | with Inline; use Inline; |
8b3a98b2 | 50 | with Itypes; use Itypes; |
5f443c6d | 51 | with Lib; use Lib; |
52 | with Namet; use Namet; | |
53 | with Nlists; use Nlists; | |
54 | with Nmake; use Nmake; | |
55 | with Opt; use Opt; | |
56 | with Restrict; use Restrict; | |
57 | with Rident; use Rident; | |
58 | with Rtsfind; use Rtsfind; | |
59 | with Sem; use Sem; | |
60 | with Sem_Aux; use Sem_Aux; | |
61 | with Sem_Ch6; use Sem_Ch6; | |
62 | with Sem_Ch8; use Sem_Ch8; | |
63 | with Sem_Ch13; use Sem_Ch13; | |
64 | with Sem_Dim; use Sem_Dim; | |
65 | with Sem_Disp; use Sem_Disp; | |
66 | with Sem_Dist; use Sem_Dist; | |
67 | with Sem_Eval; use Sem_Eval; | |
68 | with Sem_Mech; use Sem_Mech; | |
69 | with Sem_Res; use Sem_Res; | |
70 | with Sem_SCIL; use Sem_SCIL; | |
71 | with Sem_Util; use Sem_Util; | |
72 | with Sinfo; use Sinfo; | |
73 | with Snames; use Snames; | |
74 | with Stand; use Stand; | |
5f443c6d | 75 | with Tbuild; use Tbuild; |
76 | with Uintp; use Uintp; | |
77 | with Validsw; use Validsw; | |
ee6ba406 | 78 | |
79 | package body Exp_Ch6 is | |
80 | ||
81 | ----------------------- | |
82 | -- Local Subprograms -- | |
83 | ----------------------- | |
84 | ||
578f27c9 | 85 | procedure Add_Access_Actual_To_Build_In_Place_Call |
86 | (Function_Call : Node_Id; | |
87 | Function_Id : Entity_Id; | |
21ec6442 | 88 | Return_Object : Node_Id; |
89 | Is_Access : Boolean := False); | |
578f27c9 | 90 | -- Ada 2005 (AI-318-02): Apply the Unrestricted_Access attribute to the |
91 | -- object name given by Return_Object and add the attribute to the end of | |
92 | -- the actual parameter list associated with the build-in-place function | |
21ec6442 | 93 | -- call denoted by Function_Call. However, if Is_Access is True, then |
94 | -- Return_Object is already an access expression, in which case it's passed | |
95 | -- along directly to the build-in-place function. Finally, if Return_Object | |
96 | -- is empty, then pass a null literal as the actual. | |
97 | ||
52b3bcf2 | 98 | procedure Add_Unconstrained_Actuals_To_Build_In_Place_Call |
21ec6442 | 99 | (Function_Call : Node_Id; |
100 | Function_Id : Entity_Id; | |
101 | Alloc_Form : BIP_Allocation_Form := Unspecified; | |
52b3bcf2 | 102 | Alloc_Form_Exp : Node_Id := Empty; |
103 | Pool_Actual : Node_Id := Make_Null (No_Location)); | |
104 | -- Ada 2005 (AI-318-02): Add the actuals needed for a build-in-place | |
105 | -- function call that returns a caller-unknown-size result (BIP_Alloc_Form | |
106 | -- and BIP_Storage_Pool). If Alloc_Form_Exp is present, then use it, | |
107 | -- otherwise pass a literal corresponding to the Alloc_Form parameter | |
108 | -- (which must not be Unspecified in that case). Pool_Actual is the | |
109 | -- parameter to pass to BIP_Storage_Pool. | |
21ec6442 | 110 | |
57acff55 | 111 | procedure Add_Finalization_Master_Actual_To_Build_In_Place_Call |
e4caa3ff | 112 | (Func_Call : Node_Id; |
113 | Func_Id : Entity_Id; | |
114 | Ptr_Typ : Entity_Id := Empty; | |
115 | Master_Exp : Node_Id := Empty); | |
bb3b440a | 116 | -- Ada 2005 (AI-318-02): If the result type of a build-in-place call needs |
117 | -- finalization actions, add an actual parameter which is a pointer to the | |
e4caa3ff | 118 | -- finalization master of the caller. If Master_Exp is not Empty, then that |
119 | -- will be passed as the actual. Otherwise, if Ptr_Typ is left Empty, this | |
120 | -- will result in an automatic "null" value for the actual. | |
21ec6442 | 121 | |
122 | procedure Add_Task_Actuals_To_Build_In_Place_Call | |
123 | (Function_Call : Node_Id; | |
124 | Function_Id : Entity_Id; | |
baac2ff7 | 125 | Master_Actual : Node_Id; |
126 | Chain : Node_Id := Empty); | |
21ec6442 | 127 | -- Ada 2005 (AI-318-02): For a build-in-place call, if the result type |
128 | -- contains tasks, add two actual parameters: the master, and a pointer to | |
129 | -- the caller's activation chain. Master_Actual is the actual parameter | |
130 | -- expression to pass for the master. In most cases, this is the current | |
131 | -- master (_master). The two exceptions are: If the function call is the | |
132 | -- initialization expression for an allocator, we pass the master of the | |
c7f8b065 | 133 | -- access type. If the function call is the initialization expression for a |
baac2ff7 | 134 | -- return object, we pass along the master passed in by the caller. In most |
135 | -- contexts, the activation chain to pass is the local one, which is | |
136 | -- indicated by No (Chain). However, in an allocator, the caller passes in | |
137 | -- the activation Chain. Note: Master_Actual can be Empty, but only if | |
138 | -- there are no tasks. | |
578f27c9 | 139 | |
37066559 | 140 | function Caller_Known_Size |
85bbb15a | 141 | (Func_Call : Node_Id; |
142 | Result_Subt : Entity_Id) return Boolean; | |
37066559 | 143 | -- True if result subtype is definite, or has a size that does not require |
144 | -- secondary stack usage (i.e. no variant part or components whose type | |
145 | -- depends on discriminants). In particular, untagged types with only | |
146 | -- access discriminants do not require secondary stack use. Note we must | |
147 | -- always use the secondary stack for dispatching-on-result calls. | |
148 | ||
ee6ba406 | 149 | procedure Check_Overriding_Operation (Subp : Entity_Id); |
150 | -- Subp is a dispatching operation. Check whether it may override an | |
151 | -- inherited private operation, in which case its DT entry is that of | |
152 | -- the hidden operation, not the one it may have received earlier. | |
153 | -- This must be done before emitting the code to set the corresponding | |
154 | -- DT to the address of the subprogram. The actual placement of Subp in | |
155 | -- the proper place in the list of primitive operations is done in | |
156 | -- Declare_Inherited_Private_Subprograms, which also has to deal with | |
157 | -- implicit operations. This duplication is unavoidable for now??? | |
158 | ||
159 | procedure Detect_Infinite_Recursion (N : Node_Id; Spec : Entity_Id); | |
160 | -- This procedure is called only if the subprogram body N, whose spec | |
161 | -- has the given entity Spec, contains a parameterless recursive call. | |
162 | -- It attempts to generate runtime code to detect if this a case of | |
163 | -- infinite recursion. | |
164 | -- | |
165 | -- The body is scanned to determine dependencies. If the only external | |
166 | -- dependencies are on a small set of scalar variables, then the values | |
167 | -- of these variables are captured on entry to the subprogram, and if | |
168 | -- the values are not changed for the call, we know immediately that | |
169 | -- we have an infinite recursion. | |
170 | ||
f1ce0b4e | 171 | procedure Expand_Actuals |
328d8eaa | 172 | (N : Node_Id; |
173 | Subp : Entity_Id; | |
174 | Post_Call : out List_Id); | |
175 | -- Return a list of actions to take place after the call in Post_Call. The | |
176 | -- call will later be rewritten as an Expression_With_Actions, with the | |
177 | -- Post_Call actions inserted, and the call inside. | |
f1ce0b4e | 178 | -- |
328d8eaa | 179 | -- For each actual of an in-out or out parameter which is a numeric (view) |
180 | -- conversion of the form T (A), where A denotes a variable, we insert the | |
181 | -- declaration: | |
f37968de | 182 | -- |
183 | -- Temp : T[ := T (A)]; | |
184 | -- | |
185 | -- prior to the call. Then we replace the actual with a reference to Temp, | |
186 | -- and append the assignment: | |
187 | -- | |
188 | -- A := TypeA (Temp); | |
189 | -- | |
190 | -- after the call. Here TypeA is the actual type of variable A. For out | |
191 | -- parameters, the initial declaration has no expression. If A is not an | |
192 | -- entity name, we generate instead: | |
193 | -- | |
194 | -- Var : TypeA renames A; | |
195 | -- Temp : T := Var; -- omitting expression for out parameter. | |
196 | -- ... | |
197 | -- Var := TypeA (Temp); | |
198 | -- | |
199 | -- For other in-out parameters, we emit the required constraint checks | |
200 | -- before and/or after the call. | |
201 | -- | |
202 | -- For all parameter modes, actuals that denote components and slices of | |
203 | -- packed arrays are expanded into suitable temporaries. | |
204 | -- | |
5d2fb1fa | 205 | -- For nonscalar objects that are possibly unaligned, add call by copy code |
206 | -- (copy in for IN and IN OUT, copy out for OUT and IN OUT). | |
f37968de | 207 | -- |
1c38ef3f | 208 | -- For OUT and IN OUT parameters, add predicate checks after the call |
209 | -- based on the predicates of the actual type. | |
f1ce0b4e | 210 | |
211 | procedure Expand_Call_Helper (N : Node_Id; Post_Call : out List_Id); | |
328d8eaa | 212 | -- Does the main work of Expand_Call. Post_Call is as for Expand_Actuals. |
f37968de | 213 | |
bb3b440a | 214 | procedure Expand_Ctrl_Function_Call (N : Node_Id); |
215 | -- N is a function call which returns a controlled object. Transform the | |
216 | -- call into a temporary which retrieves the returned object from the | |
217 | -- secondary stack using 'reference. | |
218 | ||
047bb428 | 219 | procedure Expand_Non_Function_Return (N : Node_Id); |
ed695684 | 220 | -- Expand a simple return statement found in a procedure body, entry body, |
221 | -- accept statement, or an extended return statement. Note that all non- | |
222 | -- function returns are simple return statements. | |
047bb428 | 223 | |
ee6ba406 | 224 | function Expand_Protected_Object_Reference |
225 | (N : Node_Id; | |
578f27c9 | 226 | Scop : Entity_Id) return Node_Id; |
ee6ba406 | 227 | |
228 | procedure Expand_Protected_Subprogram_Call | |
229 | (N : Node_Id; | |
230 | Subp : Entity_Id; | |
231 | Scop : Entity_Id); | |
232 | -- A call to a protected subprogram within the protected object may appear | |
233 | -- as a regular call. The list of actuals must be expanded to contain a | |
234 | -- reference to the object itself, and the call becomes a call to the | |
235 | -- corresponding protected subprogram. | |
236 | ||
afefc6b6 | 237 | procedure Expand_Simple_Function_Return (N : Node_Id); |
238 | -- Expand simple return from function. In the case where we are returning | |
239 | -- from a function body this is called by Expand_N_Simple_Return_Statement. | |
240 | ||
302f6546 | 241 | function Has_Unconstrained_Access_Discriminants |
242 | (Subtyp : Entity_Id) return Boolean; | |
afefc6b6 | 243 | -- Returns True if the given subtype is unconstrained and has one or more |
244 | -- access discriminants. | |
047bb428 | 245 | |
328d8eaa | 246 | procedure Insert_Post_Call_Actions (N : Node_Id; Post_Call : List_Id); |
247 | -- Insert the Post_Call list previously produced by routine Expand_Actuals | |
248 | -- or Expand_Call_Helper into the tree. | |
249 | ||
8b3a98b2 | 250 | procedure Replace_Renaming_Declaration_Id |
251 | (New_Decl : Node_Id; | |
252 | Orig_Decl : Node_Id); | |
253 | -- Replace the internal identifier of the new renaming declaration New_Decl | |
254 | -- with the identifier of its original declaration Orig_Decl exchanging the | |
255 | -- entities containing their defining identifiers to ensure the correct | |
256 | -- replacement of the object declaration by the object renaming declaration | |
257 | -- to avoid homograph conflicts (since the object declaration's defining | |
258 | -- identifier was already entered in the current scope). The Next_Entity | |
259 | -- links of the two entities are also swapped since the entities are part | |
260 | -- of the return scope's entity list and the list structure would otherwise | |
261 | -- be corrupted. The homonym chain is preserved as well. | |
262 | ||
41a8d10f | 263 | procedure Rewrite_Function_Call_For_C (N : Node_Id); |
264 | -- When generating C code, replace a call to a function that returns an | |
265 | -- array into the generated procedure with an additional out parameter. | |
266 | ||
a10589ee | 267 | procedure Set_Enclosing_Sec_Stack_Return (N : Node_Id); |
268 | -- N is a return statement for a function that returns its result on the | |
269 | -- secondary stack. This sets the Sec_Stack_Needed_For_Return flag on the | |
270 | -- function and all blocks and loops that the return statement is jumping | |
271 | -- out of. This ensures that the secondary stack is not released; otherwise | |
272 | -- the function result would be reclaimed before returning to the caller. | |
273 | ||
578f27c9 | 274 | ---------------------------------------------- |
275 | -- Add_Access_Actual_To_Build_In_Place_Call -- | |
276 | ---------------------------------------------- | |
277 | ||
278 | procedure Add_Access_Actual_To_Build_In_Place_Call | |
279 | (Function_Call : Node_Id; | |
280 | Function_Id : Entity_Id; | |
21ec6442 | 281 | Return_Object : Node_Id; |
282 | Is_Access : Boolean := False) | |
578f27c9 | 283 | is |
284 | Loc : constant Source_Ptr := Sloc (Function_Call); | |
285 | Obj_Address : Node_Id; | |
21ec6442 | 286 | Obj_Acc_Formal : Entity_Id; |
578f27c9 | 287 | |
288 | begin | |
21ec6442 | 289 | -- Locate the implicit access parameter in the called function |
578f27c9 | 290 | |
21ec6442 | 291 | Obj_Acc_Formal := Build_In_Place_Formal (Function_Id, BIP_Object_Access); |
578f27c9 | 292 | |
21ec6442 | 293 | -- If no return object is provided, then pass null |
294 | ||
295 | if not Present (Return_Object) then | |
296 | Obj_Address := Make_Null (Loc); | |
4907451e | 297 | Set_Parent (Obj_Address, Function_Call); |
578f27c9 | 298 | |
21ec6442 | 299 | -- If Return_Object is already an expression of an access type, then use |
300 | -- it directly, since it must be an access value denoting the return | |
301 | -- object, and couldn't possibly be the return object itself. | |
302 | ||
303 | elsif Is_Access then | |
304 | Obj_Address := Return_Object; | |
4907451e | 305 | Set_Parent (Obj_Address, Function_Call); |
578f27c9 | 306 | |
307 | -- Apply Unrestricted_Access to caller's return object | |
308 | ||
21ec6442 | 309 | else |
310 | Obj_Address := | |
311 | Make_Attribute_Reference (Loc, | |
312 | Prefix => Return_Object, | |
313 | Attribute_Name => Name_Unrestricted_Access); | |
4907451e | 314 | |
315 | Set_Parent (Return_Object, Obj_Address); | |
316 | Set_Parent (Obj_Address, Function_Call); | |
21ec6442 | 317 | end if; |
578f27c9 | 318 | |
319 | Analyze_And_Resolve (Obj_Address, Etype (Obj_Acc_Formal)); | |
320 | ||
321 | -- Build the parameter association for the new actual and add it to the | |
322 | -- end of the function's actuals. | |
323 | ||
21ec6442 | 324 | Add_Extra_Actual_To_Call (Function_Call, Obj_Acc_Formal, Obj_Address); |
325 | end Add_Access_Actual_To_Build_In_Place_Call; | |
326 | ||
3ab42ff7 | 327 | ------------------------------------------------------ |
52b3bcf2 | 328 | -- Add_Unconstrained_Actuals_To_Build_In_Place_Call -- |
3ab42ff7 | 329 | ------------------------------------------------------ |
21ec6442 | 330 | |
52b3bcf2 | 331 | procedure Add_Unconstrained_Actuals_To_Build_In_Place_Call |
21ec6442 | 332 | (Function_Call : Node_Id; |
333 | Function_Id : Entity_Id; | |
334 | Alloc_Form : BIP_Allocation_Form := Unspecified; | |
52b3bcf2 | 335 | Alloc_Form_Exp : Node_Id := Empty; |
336 | Pool_Actual : Node_Id := Make_Null (No_Location)) | |
21ec6442 | 337 | is |
36c80e26 | 338 | Loc : constant Source_Ptr := Sloc (Function_Call); |
339 | ||
21ec6442 | 340 | Alloc_Form_Actual : Node_Id; |
341 | Alloc_Form_Formal : Node_Id; | |
52b3bcf2 | 342 | Pool_Formal : Node_Id; |
21ec6442 | 343 | |
344 | begin | |
36c80e26 | 345 | -- Nothing to do when the size of the object is known, and the caller is |
346 | -- in charge of allocating it, and the callee doesn't unconditionally | |
347 | -- require an allocation form (such as due to having a tagged result). | |
348 | ||
349 | if not Needs_BIP_Alloc_Form (Function_Id) then | |
4907451e | 350 | return; |
351 | end if; | |
352 | ||
21ec6442 | 353 | -- Locate the implicit allocation form parameter in the called function. |
354 | -- Maybe it would be better for each implicit formal of a build-in-place | |
355 | -- function to have a flag or a Uint attribute to identify it. ??? | |
356 | ||
357 | Alloc_Form_Formal := Build_In_Place_Formal (Function_Id, BIP_Alloc_Form); | |
358 | ||
359 | if Present (Alloc_Form_Exp) then | |
360 | pragma Assert (Alloc_Form = Unspecified); | |
361 | ||
362 | Alloc_Form_Actual := Alloc_Form_Exp; | |
363 | ||
364 | else | |
365 | pragma Assert (Alloc_Form /= Unspecified); | |
366 | ||
367 | Alloc_Form_Actual := | |
368 | Make_Integer_Literal (Loc, | |
369 | Intval => UI_From_Int (BIP_Allocation_Form'Pos (Alloc_Form))); | |
370 | end if; | |
371 | ||
372 | Analyze_And_Resolve (Alloc_Form_Actual, Etype (Alloc_Form_Formal)); | |
373 | ||
374 | -- Build the parameter association for the new actual and add it to the | |
375 | -- end of the function's actuals. | |
376 | ||
377 | Add_Extra_Actual_To_Call | |
378 | (Function_Call, Alloc_Form_Formal, Alloc_Form_Actual); | |
52b3bcf2 | 379 | |
36c80e26 | 380 | -- Pass the Storage_Pool parameter. This parameter is omitted on ZFP as |
381 | -- those targets do not support pools. | |
52b3bcf2 | 382 | |
36ac5fbb | 383 | if RTE_Available (RE_Root_Storage_Pool_Ptr) then |
3295b1fa | 384 | Pool_Formal := Build_In_Place_Formal (Function_Id, BIP_Storage_Pool); |
385 | Analyze_And_Resolve (Pool_Actual, Etype (Pool_Formal)); | |
386 | Add_Extra_Actual_To_Call | |
387 | (Function_Call, Pool_Formal, Pool_Actual); | |
388 | end if; | |
52b3bcf2 | 389 | end Add_Unconstrained_Actuals_To_Build_In_Place_Call; |
21ec6442 | 390 | |
57acff55 | 391 | ----------------------------------------------------------- |
392 | -- Add_Finalization_Master_Actual_To_Build_In_Place_Call -- | |
393 | ----------------------------------------------------------- | |
bb3b440a | 394 | |
57acff55 | 395 | procedure Add_Finalization_Master_Actual_To_Build_In_Place_Call |
e4caa3ff | 396 | (Func_Call : Node_Id; |
397 | Func_Id : Entity_Id; | |
398 | Ptr_Typ : Entity_Id := Empty; | |
399 | Master_Exp : Node_Id := Empty) | |
bb3b440a | 400 | is |
401 | begin | |
57acff55 | 402 | if not Needs_BIP_Finalization_Master (Func_Id) then |
bb3b440a | 403 | return; |
404 | end if; | |
405 | ||
406 | declare | |
407 | Formal : constant Entity_Id := | |
57acff55 | 408 | Build_In_Place_Formal (Func_Id, BIP_Finalization_Master); |
bb3b440a | 409 | Loc : constant Source_Ptr := Sloc (Func_Call); |
410 | ||
411 | Actual : Node_Id; | |
412 | Desig_Typ : Entity_Id; | |
413 | ||
414 | begin | |
e4caa3ff | 415 | -- If there is a finalization master actual, such as the implicit |
416 | -- finalization master of an enclosing build-in-place function, | |
417 | -- then this must be added as an extra actual of the call. | |
418 | ||
419 | if Present (Master_Exp) then | |
420 | Actual := Master_Exp; | |
421 | ||
57acff55 | 422 | -- Case where the context does not require an actual master |
bb3b440a | 423 | |
e4caa3ff | 424 | elsif No (Ptr_Typ) then |
bb3b440a | 425 | Actual := Make_Null (Loc); |
426 | ||
427 | else | |
428 | Desig_Typ := Directly_Designated_Type (Ptr_Typ); | |
429 | ||
430 | -- Check for a library-level access type whose designated type has | |
1ef2e6ef | 431 | -- suppressed finalization or the access type is subject to pragma |
432 | -- No_Heap_Finalization. Such an access type lacks a master. Pass | |
433 | -- a null actual to callee in order to signal a missing master. | |
bb3b440a | 434 | |
435 | if Is_Library_Level_Entity (Ptr_Typ) | |
3db675d2 | 436 | and then (Finalize_Storage_Only (Desig_Typ) |
1ef2e6ef | 437 | or else No_Heap_Finalization (Ptr_Typ)) |
bb3b440a | 438 | then |
439 | Actual := Make_Null (Loc); | |
440 | ||
441 | -- Types in need of finalization actions | |
442 | ||
443 | elsif Needs_Finalization (Desig_Typ) then | |
444 | ||
57acff55 | 445 | -- The general mechanism of creating finalization masters for |
446 | -- anonymous access types is disabled by default, otherwise | |
447 | -- finalization masters will pop all over the place. Such types | |
448 | -- use context-specific masters. | |
bb3b440a | 449 | |
450 | if Ekind (Ptr_Typ) = E_Anonymous_Access_Type | |
57acff55 | 451 | and then No (Finalization_Master (Ptr_Typ)) |
bb3b440a | 452 | then |
f74a102b | 453 | Build_Anonymous_Master (Ptr_Typ); |
bb3b440a | 454 | end if; |
455 | ||
57acff55 | 456 | -- Access-to-controlled types should always have a master |
bb3b440a | 457 | |
57acff55 | 458 | pragma Assert (Present (Finalization_Master (Ptr_Typ))); |
bb3b440a | 459 | |
460 | Actual := | |
461 | Make_Attribute_Reference (Loc, | |
462 | Prefix => | |
83c6c069 | 463 | New_Occurrence_Of (Finalization_Master (Ptr_Typ), Loc), |
bb3b440a | 464 | Attribute_Name => Name_Unrestricted_Access); |
465 | ||
466 | -- Tagged types | |
467 | ||
468 | else | |
469 | Actual := Make_Null (Loc); | |
470 | end if; | |
471 | end if; | |
472 | ||
473 | Analyze_And_Resolve (Actual, Etype (Formal)); | |
474 | ||
475 | -- Build the parameter association for the new actual and add it to | |
476 | -- the end of the function's actuals. | |
477 | ||
478 | Add_Extra_Actual_To_Call (Func_Call, Formal, Actual); | |
479 | end; | |
57acff55 | 480 | end Add_Finalization_Master_Actual_To_Build_In_Place_Call; |
bb3b440a | 481 | |
21ec6442 | 482 | ------------------------------ |
483 | -- Add_Extra_Actual_To_Call -- | |
484 | ------------------------------ | |
485 | ||
486 | procedure Add_Extra_Actual_To_Call | |
487 | (Subprogram_Call : Node_Id; | |
488 | Extra_Formal : Entity_Id; | |
489 | Extra_Actual : Node_Id) | |
490 | is | |
491 | Loc : constant Source_Ptr := Sloc (Subprogram_Call); | |
492 | Param_Assoc : Node_Id; | |
493 | ||
494 | begin | |
578f27c9 | 495 | Param_Assoc := |
496 | Make_Parameter_Association (Loc, | |
21ec6442 | 497 | Selector_Name => New_Occurrence_Of (Extra_Formal, Loc), |
498 | Explicit_Actual_Parameter => Extra_Actual); | |
578f27c9 | 499 | |
21ec6442 | 500 | Set_Parent (Param_Assoc, Subprogram_Call); |
501 | Set_Parent (Extra_Actual, Param_Assoc); | |
578f27c9 | 502 | |
21ec6442 | 503 | if Present (Parameter_Associations (Subprogram_Call)) then |
504 | if Nkind (Last (Parameter_Associations (Subprogram_Call))) = | |
578f27c9 | 505 | N_Parameter_Association |
506 | then | |
21ec6442 | 507 | |
508 | -- Find last named actual, and append | |
509 | ||
510 | declare | |
511 | L : Node_Id; | |
512 | begin | |
513 | L := First_Actual (Subprogram_Call); | |
514 | while Present (L) loop | |
515 | if No (Next_Actual (L)) then | |
516 | Set_Next_Named_Actual (Parent (L), Extra_Actual); | |
517 | exit; | |
518 | end if; | |
519 | Next_Actual (L); | |
520 | end loop; | |
521 | end; | |
522 | ||
578f27c9 | 523 | else |
21ec6442 | 524 | Set_First_Named_Actual (Subprogram_Call, Extra_Actual); |
578f27c9 | 525 | end if; |
526 | ||
21ec6442 | 527 | Append (Param_Assoc, To => Parameter_Associations (Subprogram_Call)); |
578f27c9 | 528 | |
529 | else | |
21ec6442 | 530 | Set_Parameter_Associations (Subprogram_Call, New_List (Param_Assoc)); |
531 | Set_First_Named_Actual (Subprogram_Call, Extra_Actual); | |
578f27c9 | 532 | end if; |
21ec6442 | 533 | end Add_Extra_Actual_To_Call; |
534 | ||
21ec6442 | 535 | --------------------------------------------- |
536 | -- Add_Task_Actuals_To_Build_In_Place_Call -- | |
537 | --------------------------------------------- | |
538 | ||
539 | procedure Add_Task_Actuals_To_Build_In_Place_Call | |
540 | (Function_Call : Node_Id; | |
541 | Function_Id : Entity_Id; | |
baac2ff7 | 542 | Master_Actual : Node_Id; |
543 | Chain : Node_Id := Empty) | |
21ec6442 | 544 | is |
59f2fcab | 545 | Loc : constant Source_Ptr := Sloc (Function_Call); |
546 | Result_Subt : constant Entity_Id := | |
547 | Available_View (Etype (Function_Id)); | |
548 | Actual : Node_Id; | |
549 | Chain_Actual : Node_Id; | |
550 | Chain_Formal : Node_Id; | |
551 | Master_Formal : Node_Id; | |
c7f8b065 | 552 | |
21ec6442 | 553 | begin |
554 | -- No such extra parameters are needed if there are no tasks | |
555 | ||
43602818 | 556 | if not Has_Task (Result_Subt) then |
21ec6442 | 557 | return; |
558 | end if; | |
559 | ||
59f2fcab | 560 | Actual := Master_Actual; |
561 | ||
51c733e0 | 562 | -- Use a dummy _master actual in case of No_Task_Hierarchy |
563 | ||
564 | if Restriction_Active (No_Task_Hierarchy) then | |
565 | Actual := New_Occurrence_Of (RTE (RE_Library_Task_Level), Loc); | |
3b21faf2 | 566 | |
567 | -- In the case where we use the master associated with an access type, | |
568 | -- the actual is an entity and requires an explicit reference. | |
569 | ||
570 | elsif Nkind (Actual) = N_Defining_Identifier then | |
83c6c069 | 571 | Actual := New_Occurrence_Of (Actual, Loc); |
51c733e0 | 572 | end if; |
573 | ||
59f2fcab | 574 | -- Locate the implicit master parameter in the called function |
21ec6442 | 575 | |
59f2fcab | 576 | Master_Formal := Build_In_Place_Formal (Function_Id, BIP_Task_Master); |
577 | Analyze_And_Resolve (Actual, Etype (Master_Formal)); | |
21ec6442 | 578 | |
59f2fcab | 579 | -- Build the parameter association for the new actual and add it to the |
580 | -- end of the function's actuals. | |
21ec6442 | 581 | |
59f2fcab | 582 | Add_Extra_Actual_To_Call (Function_Call, Master_Formal, Actual); |
0429d533 | 583 | |
59f2fcab | 584 | -- Locate the implicit activation chain parameter in the called function |
21ec6442 | 585 | |
59f2fcab | 586 | Chain_Formal := |
587 | Build_In_Place_Formal (Function_Id, BIP_Activation_Chain); | |
21ec6442 | 588 | |
59f2fcab | 589 | -- Create the actual which is a pointer to the current activation chain |
21ec6442 | 590 | |
baac2ff7 | 591 | if No (Chain) then |
592 | Chain_Actual := | |
593 | Make_Attribute_Reference (Loc, | |
594 | Prefix => Make_Identifier (Loc, Name_uChain), | |
595 | Attribute_Name => Name_Unrestricted_Access); | |
596 | ||
597 | -- Allocator case; make a reference to the Chain passed in by the caller | |
598 | ||
599 | else | |
600 | Chain_Actual := | |
601 | Make_Attribute_Reference (Loc, | |
602 | Prefix => New_Occurrence_Of (Chain, Loc), | |
603 | Attribute_Name => Name_Unrestricted_Access); | |
604 | end if; | |
21ec6442 | 605 | |
59f2fcab | 606 | Analyze_And_Resolve (Chain_Actual, Etype (Chain_Formal)); |
21ec6442 | 607 | |
59f2fcab | 608 | -- Build the parameter association for the new actual and add it to the |
609 | -- end of the function's actuals. | |
21ec6442 | 610 | |
59f2fcab | 611 | Add_Extra_Actual_To_Call (Function_Call, Chain_Formal, Chain_Actual); |
21ec6442 | 612 | end Add_Task_Actuals_To_Build_In_Place_Call; |
613 | ||
614 | ----------------------- | |
615 | -- BIP_Formal_Suffix -- | |
616 | ----------------------- | |
617 | ||
618 | function BIP_Formal_Suffix (Kind : BIP_Formal_Kind) return String is | |
619 | begin | |
620 | case Kind is | |
99378362 | 621 | when BIP_Alloc_Form => |
21ec6442 | 622 | return "BIPalloc"; |
99378362 | 623 | |
624 | when BIP_Storage_Pool => | |
52b3bcf2 | 625 | return "BIPstoragepool"; |
99378362 | 626 | |
57acff55 | 627 | when BIP_Finalization_Master => |
628 | return "BIPfinalizationmaster"; | |
99378362 | 629 | |
630 | when BIP_Task_Master => | |
59f2fcab | 631 | return "BIPtaskmaster"; |
99378362 | 632 | |
633 | when BIP_Activation_Chain => | |
21ec6442 | 634 | return "BIPactivationchain"; |
99378362 | 635 | |
636 | when BIP_Object_Access => | |
21ec6442 | 637 | return "BIPaccess"; |
638 | end case; | |
639 | end BIP_Formal_Suffix; | |
640 | ||
641 | --------------------------- | |
642 | -- Build_In_Place_Formal -- | |
643 | --------------------------- | |
644 | ||
645 | function Build_In_Place_Formal | |
646 | (Func : Entity_Id; | |
647 | Kind : BIP_Formal_Kind) return Entity_Id | |
648 | is | |
72514638 | 649 | Formal_Suffix : constant String := BIP_Formal_Suffix (Kind); |
21ec6442 | 650 | Extra_Formal : Entity_Id := Extra_Formals (Func); |
651 | ||
652 | begin | |
653 | -- Maybe it would be better for each implicit formal of a build-in-place | |
654 | -- function to have a flag or a Uint attribute to identify it. ??? | |
655 | ||
96c33aee | 656 | -- The return type in the function declaration may have been a limited |
657 | -- view, and the extra formals for the function were not generated at | |
ccb072b1 | 658 | -- that point. At the point of call the full view must be available and |
96c33aee | 659 | -- the extra formals can be created. |
660 | ||
661 | if No (Extra_Formal) then | |
662 | Create_Extra_Formals (Func); | |
663 | Extra_Formal := Extra_Formals (Func); | |
664 | end if; | |
665 | ||
72514638 | 666 | -- We search for a formal with a matching suffix. We can't search |
667 | -- for the full name, because of the code at the end of Sem_Ch6.- | |
668 | -- Create_Extra_Formals, which copies the Extra_Formals over to | |
669 | -- the Alias of an instance, which will cause the formals to have | |
670 | -- "incorrect" names. | |
671 | ||
21ec6442 | 672 | loop |
236f09e1 | 673 | pragma Assert (Present (Extra_Formal)); |
72514638 | 674 | declare |
675 | Name : constant String := Get_Name_String (Chars (Extra_Formal)); | |
676 | begin | |
677 | exit when Name'Length >= Formal_Suffix'Length | |
678 | and then Formal_Suffix = | |
679 | Name (Name'Last - Formal_Suffix'Length + 1 .. Name'Last); | |
680 | end; | |
59f2fcab | 681 | |
21ec6442 | 682 | Next_Formal_With_Extras (Extra_Formal); |
683 | end loop; | |
684 | ||
21ec6442 | 685 | return Extra_Formal; |
686 | end Build_In_Place_Formal; | |
578f27c9 | 687 | |
d48649eb | 688 | ------------------------------- |
689 | -- Build_Procedure_Body_Form -- | |
690 | ------------------------------- | |
691 | ||
692 | function Build_Procedure_Body_Form | |
693 | (Func_Id : Entity_Id; | |
694 | Func_Body : Node_Id) return Node_Id | |
695 | is | |
696 | Loc : constant Source_Ptr := Sloc (Func_Body); | |
697 | ||
698 | Proc_Decl : constant Node_Id := | |
699 | Next (Unit_Declaration_Node (Func_Id)); | |
700 | -- It is assumed that the next node following the declaration of the | |
701 | -- corresponding subprogram spec is the declaration of the procedure | |
702 | -- form. | |
703 | ||
704 | Proc_Id : constant Entity_Id := Defining_Entity (Proc_Decl); | |
705 | ||
706 | procedure Replace_Returns (Param_Id : Entity_Id; Stmts : List_Id); | |
707 | -- Replace each return statement found in the list Stmts with an | |
708 | -- assignment of the return expression to parameter Param_Id. | |
709 | ||
710 | --------------------- | |
711 | -- Replace_Returns -- | |
712 | --------------------- | |
713 | ||
714 | procedure Replace_Returns (Param_Id : Entity_Id; Stmts : List_Id) is | |
715 | Stmt : Node_Id; | |
716 | ||
717 | begin | |
718 | Stmt := First (Stmts); | |
719 | while Present (Stmt) loop | |
720 | if Nkind (Stmt) = N_Block_Statement then | |
c80715e7 | 721 | Replace_Returns (Param_Id, |
722 | Statements (Handled_Statement_Sequence (Stmt))); | |
d48649eb | 723 | |
724 | elsif Nkind (Stmt) = N_Case_Statement then | |
725 | declare | |
726 | Alt : Node_Id; | |
727 | begin | |
728 | Alt := First (Alternatives (Stmt)); | |
729 | while Present (Alt) loop | |
730 | Replace_Returns (Param_Id, Statements (Alt)); | |
731 | Next (Alt); | |
732 | end loop; | |
733 | end; | |
734 | ||
4d9be73d | 735 | elsif Nkind (Stmt) = N_Extended_Return_Statement then |
736 | declare | |
737 | Ret_Obj : constant Entity_Id := | |
738 | Defining_Entity | |
739 | (First (Return_Object_Declarations (Stmt))); | |
740 | Assign : constant Node_Id := | |
741 | Make_Assignment_Statement (Sloc (Stmt), | |
742 | Name => | |
743 | New_Occurrence_Of (Param_Id, Loc), | |
744 | Expression => | |
745 | New_Occurrence_Of (Ret_Obj, Sloc (Stmt))); | |
f4e18891 | 746 | Stmts : List_Id; |
4d9be73d | 747 | |
748 | begin | |
bfbd9cf4 | 749 | -- The extended return may just contain the declaration |
f4e18891 | 750 | |
751 | if Present (Handled_Statement_Sequence (Stmt)) then | |
bfbd9cf4 | 752 | Stmts := Statements (Handled_Statement_Sequence (Stmt)); |
f4e18891 | 753 | else |
754 | Stmts := New_List; | |
755 | end if; | |
756 | ||
4d9be73d | 757 | Set_Assignment_OK (Name (Assign)); |
758 | ||
759 | Rewrite (Stmt, | |
760 | Make_Block_Statement (Sloc (Stmt), | |
761 | Declarations => | |
762 | Return_Object_Declarations (Stmt), | |
763 | Handled_Statement_Sequence => | |
764 | Make_Handled_Sequence_Of_Statements (Loc, | |
f4e18891 | 765 | Statements => Stmts))); |
4d9be73d | 766 | |
767 | Replace_Returns (Param_Id, Stmts); | |
768 | ||
769 | Append_To (Stmts, Assign); | |
770 | Append_To (Stmts, Make_Simple_Return_Statement (Loc)); | |
771 | end; | |
772 | ||
d48649eb | 773 | elsif Nkind (Stmt) = N_If_Statement then |
774 | Replace_Returns (Param_Id, Then_Statements (Stmt)); | |
775 | Replace_Returns (Param_Id, Else_Statements (Stmt)); | |
776 | ||
777 | declare | |
778 | Part : Node_Id; | |
779 | begin | |
780 | Part := First (Elsif_Parts (Stmt)); | |
781 | while Present (Part) loop | |
59332088 | 782 | Replace_Returns (Param_Id, Then_Statements (Part)); |
d48649eb | 783 | Next (Part); |
784 | end loop; | |
785 | end; | |
786 | ||
787 | elsif Nkind (Stmt) = N_Loop_Statement then | |
788 | Replace_Returns (Param_Id, Statements (Stmt)); | |
789 | ||
790 | elsif Nkind (Stmt) = N_Simple_Return_Statement then | |
791 | ||
792 | -- Generate: | |
793 | -- Param := Expr; | |
794 | -- return; | |
795 | ||
796 | Rewrite (Stmt, | |
797 | Make_Assignment_Statement (Sloc (Stmt), | |
798 | Name => New_Occurrence_Of (Param_Id, Loc), | |
799 | Expression => Relocate_Node (Expression (Stmt)))); | |
800 | ||
801 | Insert_After (Stmt, Make_Simple_Return_Statement (Loc)); | |
802 | ||
803 | -- Skip the added return | |
804 | ||
805 | Next (Stmt); | |
806 | end if; | |
807 | ||
808 | Next (Stmt); | |
809 | end loop; | |
810 | end Replace_Returns; | |
811 | ||
812 | -- Local variables | |
813 | ||
814 | Stmts : List_Id; | |
815 | New_Body : Node_Id; | |
816 | ||
817 | -- Start of processing for Build_Procedure_Body_Form | |
818 | ||
819 | begin | |
820 | -- This routine replaces the original function body: | |
821 | ||
822 | -- function F (...) return Array_Typ is | |
823 | -- begin | |
824 | -- ... | |
825 | -- return Something; | |
826 | -- end F; | |
827 | ||
828 | -- with the following: | |
829 | ||
830 | -- procedure P (..., Result : out Array_Typ) is | |
831 | -- begin | |
832 | -- ... | |
833 | -- Result := Something; | |
834 | -- end P; | |
835 | ||
836 | Stmts := | |
837 | Statements (Handled_Statement_Sequence (Func_Body)); | |
838 | Replace_Returns (Last_Entity (Proc_Id), Stmts); | |
839 | ||
840 | New_Body := | |
841 | Make_Subprogram_Body (Loc, | |
842 | Specification => | |
843 | Copy_Subprogram_Spec (Specification (Proc_Decl)), | |
844 | Declarations => Declarations (Func_Body), | |
845 | Handled_Statement_Sequence => | |
846 | Make_Handled_Sequence_Of_Statements (Loc, | |
847 | Statements => Stmts)); | |
848 | ||
59332088 | 849 | -- If the function is a generic instance, so is the new procedure. |
850 | -- Set flag accordingly so that the proper renaming declarations are | |
851 | -- generated. | |
852 | ||
853 | Set_Is_Generic_Instance (Proc_Id, Is_Generic_Instance (Func_Id)); | |
d48649eb | 854 | return New_Body; |
855 | end Build_Procedure_Body_Form; | |
856 | ||
37066559 | 857 | ----------------------- |
858 | -- Caller_Known_Size -- | |
859 | ----------------------- | |
860 | ||
861 | function Caller_Known_Size | |
85bbb15a | 862 | (Func_Call : Node_Id; |
863 | Result_Subt : Entity_Id) return Boolean | |
864 | is | |
37066559 | 865 | begin |
85bbb15a | 866 | return |
867 | (Is_Definite_Subtype (Underlying_Type (Result_Subt)) | |
868 | and then No (Controlling_Argument (Func_Call))) | |
869 | or else not Requires_Transient_Scope (Underlying_Type (Result_Subt)); | |
37066559 | 870 | end Caller_Known_Size; |
871 | ||
6af1bdbc | 872 | -------------------------------- |
873 | -- Check_Overriding_Operation -- | |
874 | -------------------------------- | |
ee6ba406 | 875 | |
876 | procedure Check_Overriding_Operation (Subp : Entity_Id) is | |
877 | Typ : constant Entity_Id := Find_Dispatching_Type (Subp); | |
878 | Op_List : constant Elist_Id := Primitive_Operations (Typ); | |
879 | Op_Elmt : Elmt_Id; | |
880 | Prim_Op : Entity_Id; | |
881 | Par_Op : Entity_Id; | |
882 | ||
883 | begin | |
884 | if Is_Derived_Type (Typ) | |
885 | and then not Is_Private_Type (Typ) | |
886 | and then In_Open_Scopes (Scope (Etype (Typ))) | |
5b990e08 | 887 | and then Is_Base_Type (Typ) |
ee6ba406 | 888 | then |
948ef2b8 | 889 | -- Subp overrides an inherited private operation if there is an |
890 | -- inherited operation with a different name than Subp (see | |
891 | -- Derive_Subprogram) whose Alias is a hidden subprogram with the | |
892 | -- same name as Subp. | |
ee6ba406 | 893 | |
894 | Op_Elmt := First_Elmt (Op_List); | |
895 | while Present (Op_Elmt) loop | |
896 | Prim_Op := Node (Op_Elmt); | |
897 | Par_Op := Alias (Prim_Op); | |
898 | ||
899 | if Present (Par_Op) | |
900 | and then not Comes_From_Source (Prim_Op) | |
901 | and then Chars (Prim_Op) /= Chars (Par_Op) | |
902 | and then Chars (Par_Op) = Chars (Subp) | |
903 | and then Is_Hidden (Par_Op) | |
904 | and then Type_Conformant (Prim_Op, Subp) | |
905 | then | |
ad274a73 | 906 | Set_DT_Position_Value (Subp, DT_Position (Prim_Op)); |
ee6ba406 | 907 | end if; |
908 | ||
909 | Next_Elmt (Op_Elmt); | |
910 | end loop; | |
911 | end if; | |
912 | end Check_Overriding_Operation; | |
913 | ||
914 | ------------------------------- | |
915 | -- Detect_Infinite_Recursion -- | |
916 | ------------------------------- | |
917 | ||
918 | procedure Detect_Infinite_Recursion (N : Node_Id; Spec : Entity_Id) is | |
919 | Loc : constant Source_Ptr := Sloc (N); | |
920 | ||
9dfe12ae | 921 | Var_List : constant Elist_Id := New_Elmt_List; |
ee6ba406 | 922 | -- List of globals referenced by body of procedure |
923 | ||
9dfe12ae | 924 | Call_List : constant Elist_Id := New_Elmt_List; |
ee6ba406 | 925 | -- List of recursive calls in body of procedure |
926 | ||
9dfe12ae | 927 | Shad_List : constant Elist_Id := New_Elmt_List; |
948ef2b8 | 928 | -- List of entity id's for entities created to capture the value of |
929 | -- referenced globals on entry to the procedure. | |
ee6ba406 | 930 | |
931 | Scop : constant Uint := Scope_Depth (Spec); | |
948ef2b8 | 932 | -- This is used to record the scope depth of the current procedure, so |
933 | -- that we can identify global references. | |
ee6ba406 | 934 | |
935 | Max_Vars : constant := 4; | |
936 | -- Do not test more than four global variables | |
937 | ||
938 | Count_Vars : Natural := 0; | |
939 | -- Count variables found so far | |
940 | ||
941 | Var : Entity_Id; | |
942 | Elm : Elmt_Id; | |
943 | Ent : Entity_Id; | |
944 | Call : Elmt_Id; | |
945 | Decl : Node_Id; | |
946 | Test : Node_Id; | |
947 | Elm1 : Elmt_Id; | |
948 | Elm2 : Elmt_Id; | |
949 | Last : Node_Id; | |
950 | ||
951 | function Process (Nod : Node_Id) return Traverse_Result; | |
952 | -- Function to traverse the subprogram body (using Traverse_Func) | |
953 | ||
954 | ------------- | |
955 | -- Process -- | |
956 | ------------- | |
957 | ||
958 | function Process (Nod : Node_Id) return Traverse_Result is | |
959 | begin | |
960 | -- Procedure call | |
961 | ||
962 | if Nkind (Nod) = N_Procedure_Call_Statement then | |
963 | ||
964 | -- Case of one of the detected recursive calls | |
965 | ||
966 | if Is_Entity_Name (Name (Nod)) | |
967 | and then Has_Recursive_Call (Entity (Name (Nod))) | |
968 | and then Entity (Name (Nod)) = Spec | |
969 | then | |
970 | Append_Elmt (Nod, Call_List); | |
971 | return Skip; | |
972 | ||
973 | -- Any other procedure call may have side effects | |
974 | ||
975 | else | |
976 | return Abandon; | |
977 | end if; | |
978 | ||
979 | -- A call to a pure function can always be ignored | |
980 | ||
981 | elsif Nkind (Nod) = N_Function_Call | |
982 | and then Is_Entity_Name (Name (Nod)) | |
983 | and then Is_Pure (Entity (Name (Nod))) | |
984 | then | |
985 | return Skip; | |
986 | ||
987 | -- Case of an identifier reference | |
988 | ||
989 | elsif Nkind (Nod) = N_Identifier then | |
990 | Ent := Entity (Nod); | |
991 | ||
992 | -- If no entity, then ignore the reference | |
993 | ||
994 | -- Not clear why this can happen. To investigate, remove this | |
995 | -- test and look at the crash that occurs here in 3401-004 ??? | |
996 | ||
997 | if No (Ent) then | |
998 | return Skip; | |
999 | ||
1000 | -- Ignore entities with no Scope, again not clear how this | |
1001 | -- can happen, to investigate, look at 4108-008 ??? | |
1002 | ||
1003 | elsif No (Scope (Ent)) then | |
1004 | return Skip; | |
1005 | ||
1006 | -- Ignore the reference if not to a more global object | |
1007 | ||
1008 | elsif Scope_Depth (Scope (Ent)) >= Scop then | |
1009 | return Skip; | |
1010 | ||
1011 | -- References to types, exceptions and constants are always OK | |
1012 | ||
1013 | elsif Is_Type (Ent) | |
1014 | or else Ekind (Ent) = E_Exception | |
1015 | or else Ekind (Ent) = E_Constant | |
1016 | then | |
1017 | return Skip; | |
1018 | ||
1019 | -- If other than a non-volatile scalar variable, we have some | |
1020 | -- kind of global reference (e.g. to a function) that we cannot | |
1021 | -- deal with so we forget the attempt. | |
1022 | ||
1023 | elsif Ekind (Ent) /= E_Variable | |
1024 | or else not Is_Scalar_Type (Etype (Ent)) | |
9dfe12ae | 1025 | or else Treat_As_Volatile (Ent) |
ee6ba406 | 1026 | then |
1027 | return Abandon; | |
1028 | ||
1029 | -- Otherwise we have a reference to a global scalar | |
1030 | ||
1031 | else | |
1032 | -- Loop through global entities already detected | |
1033 | ||
1034 | Elm := First_Elmt (Var_List); | |
1035 | loop | |
1036 | -- If not detected before, record this new global reference | |
1037 | ||
1038 | if No (Elm) then | |
1039 | Count_Vars := Count_Vars + 1; | |
1040 | ||
1041 | if Count_Vars <= Max_Vars then | |
1042 | Append_Elmt (Entity (Nod), Var_List); | |
1043 | else | |
1044 | return Abandon; | |
1045 | end if; | |
1046 | ||
1047 | exit; | |
1048 | ||
1049 | -- If recorded before, ignore | |
1050 | ||
1051 | elsif Node (Elm) = Entity (Nod) then | |
1052 | return Skip; | |
1053 | ||
1054 | -- Otherwise keep looking | |
1055 | ||
1056 | else | |
1057 | Next_Elmt (Elm); | |
1058 | end if; | |
1059 | end loop; | |
1060 | ||
1061 | return Skip; | |
1062 | end if; | |
1063 | ||
1064 | -- For all other node kinds, recursively visit syntactic children | |
1065 | ||
1066 | else | |
1067 | return OK; | |
1068 | end if; | |
1069 | end Process; | |
1070 | ||
578f27c9 | 1071 | function Traverse_Body is new Traverse_Func (Process); |
ee6ba406 | 1072 | |
1073 | -- Start of processing for Detect_Infinite_Recursion | |
1074 | ||
1075 | begin | |
948ef2b8 | 1076 | -- Do not attempt detection in No_Implicit_Conditional mode, since we |
1077 | -- won't be able to generate the code to handle the recursion in any | |
1078 | -- case. | |
ee6ba406 | 1079 | |
1e16c51c | 1080 | if Restriction_Active (No_Implicit_Conditionals) then |
ee6ba406 | 1081 | return; |
1082 | end if; | |
1083 | ||
1084 | -- Otherwise do traversal and quit if we get abandon signal | |
1085 | ||
1086 | if Traverse_Body (N) = Abandon then | |
1087 | return; | |
1088 | ||
948ef2b8 | 1089 | -- We must have a call, since Has_Recursive_Call was set. If not just |
1090 | -- ignore (this is only an error check, so if we have a funny situation, | |
39a0c1d3 | 1091 | -- due to bugs or errors, we do not want to bomb). |
ee6ba406 | 1092 | |
1093 | elsif Is_Empty_Elmt_List (Call_List) then | |
1094 | return; | |
1095 | end if; | |
1096 | ||
1097 | -- Here is the case where we detect recursion at compile time | |
1098 | ||
948ef2b8 | 1099 | -- Push our current scope for analyzing the declarations and code that |
1100 | -- we will insert for the checking. | |
ee6ba406 | 1101 | |
4907451e | 1102 | Push_Scope (Spec); |
ee6ba406 | 1103 | |
948ef2b8 | 1104 | -- This loop builds temporary variables for each of the referenced |
1105 | -- globals, so that at the end of the loop the list Shad_List contains | |
1106 | -- these temporaries in one-to-one correspondence with the elements in | |
1107 | -- Var_List. | |
ee6ba406 | 1108 | |
1109 | Last := Empty; | |
1110 | Elm := First_Elmt (Var_List); | |
1111 | while Present (Elm) loop | |
1112 | Var := Node (Elm); | |
e0394eca | 1113 | Ent := Make_Temporary (Loc, 'S'); |
ee6ba406 | 1114 | Append_Elmt (Ent, Shad_List); |
1115 | ||
948ef2b8 | 1116 | -- Insert a declaration for this temporary at the start of the |
1117 | -- declarations for the procedure. The temporaries are declared as | |
1118 | -- constant objects initialized to the current values of the | |
1119 | -- corresponding temporaries. | |
ee6ba406 | 1120 | |
1121 | Decl := | |
1122 | Make_Object_Declaration (Loc, | |
1123 | Defining_Identifier => Ent, | |
1124 | Object_Definition => New_Occurrence_Of (Etype (Var), Loc), | |
1125 | Constant_Present => True, | |
1126 | Expression => New_Occurrence_Of (Var, Loc)); | |
1127 | ||
1128 | if No (Last) then | |
1129 | Prepend (Decl, Declarations (N)); | |
1130 | else | |
1131 | Insert_After (Last, Decl); | |
1132 | end if; | |
1133 | ||
1134 | Last := Decl; | |
1135 | Analyze (Decl); | |
1136 | Next_Elmt (Elm); | |
1137 | end loop; | |
1138 | ||
1139 | -- Loop through calls | |
1140 | ||
1141 | Call := First_Elmt (Call_List); | |
1142 | while Present (Call) loop | |
1143 | ||
1144 | -- Build a predicate expression of the form | |
1145 | ||
1146 | -- True | |
1147 | -- and then global1 = temp1 | |
1148 | -- and then global2 = temp2 | |
1149 | -- ... | |
1150 | ||
1151 | -- This predicate determines if any of the global values | |
1152 | -- referenced by the procedure have changed since the | |
1153 | -- current call, if not an infinite recursion is assured. | |
1154 | ||
1155 | Test := New_Occurrence_Of (Standard_True, Loc); | |
1156 | ||
1157 | Elm1 := First_Elmt (Var_List); | |
1158 | Elm2 := First_Elmt (Shad_List); | |
1159 | while Present (Elm1) loop | |
1160 | Test := | |
1161 | Make_And_Then (Loc, | |
1162 | Left_Opnd => Test, | |
1163 | Right_Opnd => | |
1164 | Make_Op_Eq (Loc, | |
1165 | Left_Opnd => New_Occurrence_Of (Node (Elm1), Loc), | |
1166 | Right_Opnd => New_Occurrence_Of (Node (Elm2), Loc))); | |
1167 | ||
1168 | Next_Elmt (Elm1); | |
1169 | Next_Elmt (Elm2); | |
1170 | end loop; | |
1171 | ||
1172 | -- Now we replace the call with the sequence | |
1173 | ||
1174 | -- if no-changes (see above) then | |
1175 | -- raise Storage_Error; | |
1176 | -- else | |
1177 | -- original-call | |
1178 | -- end if; | |
1179 | ||
1180 | Rewrite (Node (Call), | |
1181 | Make_If_Statement (Loc, | |
1182 | Condition => Test, | |
1183 | Then_Statements => New_List ( | |
f15731c4 | 1184 | Make_Raise_Storage_Error (Loc, |
1185 | Reason => SE_Infinite_Recursion)), | |
ee6ba406 | 1186 | |
1187 | Else_Statements => New_List ( | |
1188 | Relocate_Node (Node (Call))))); | |
1189 | ||
1190 | Analyze (Node (Call)); | |
1191 | ||
1192 | Next_Elmt (Call); | |
1193 | end loop; | |
1194 | ||
1195 | -- Remove temporary scope stack entry used for analysis | |
1196 | ||
1197 | Pop_Scope; | |
1198 | end Detect_Infinite_Recursion; | |
1199 | ||
1200 | -------------------- | |
1201 | -- Expand_Actuals -- | |
1202 | -------------------- | |
1203 | ||
f1ce0b4e | 1204 | procedure Expand_Actuals |
328d8eaa | 1205 | (N : Node_Id; |
1206 | Subp : Entity_Id; | |
1207 | Post_Call : out List_Id) | |
f1ce0b4e | 1208 | is |
ee6ba406 | 1209 | Loc : constant Source_Ptr := Sloc (N); |
1210 | Actual : Node_Id; | |
1211 | Formal : Entity_Id; | |
1212 | N_Node : Node_Id; | |
e04e8bab | 1213 | E_Actual : Entity_Id; |
ee6ba406 | 1214 | E_Formal : Entity_Id; |
1215 | ||
1216 | procedure Add_Call_By_Copy_Code; | |
9dfe12ae | 1217 | -- For cases where the parameter must be passed by copy, this routine |
1218 | -- generates a temporary variable into which the actual is copied and | |
1219 | -- then passes this as the parameter. For an OUT or IN OUT parameter, | |
1220 | -- an assignment is also generated to copy the result back. The call | |
1221 | -- also takes care of any constraint checks required for the type | |
1222 | -- conversion case (on both the way in and the way out). | |
ee6ba406 | 1223 | |
ba40b4af | 1224 | procedure Add_Simple_Call_By_Copy_Code; |
1225 | -- This is similar to the above, but is used in cases where we know | |
1226 | -- that all that is needed is to simply create a temporary and copy | |
1227 | -- the value in and out of the temporary. | |
ee6ba406 | 1228 | |
49adf385 | 1229 | procedure Add_Validation_Call_By_Copy_Code (Act : Node_Id); |
1230 | -- Perform copy-back for actual parameter Act which denotes a validation | |
1231 | -- variable. | |
1232 | ||
ee6ba406 | 1233 | procedure Check_Fortran_Logical; |
1234 | -- A value of type Logical that is passed through a formal parameter | |
1235 | -- must be normalized because .TRUE. usually does not have the same | |
1236 | -- representation as True. We assume that .FALSE. = False = 0. | |
1237 | -- What about functions that return a logical type ??? | |
1238 | ||
aad6babd | 1239 | function Is_Legal_Copy return Boolean; |
1240 | -- Check that an actual can be copied before generating the temporary | |
1241 | -- to be used in the call. If the actual is of a by_reference type then | |
1242 | -- the program is illegal (this can only happen in the presence of | |
1243 | -- rep. clauses that force an incorrect alignment). If the formal is | |
1244 | -- a by_reference parameter imposed by a DEC pragma, emit a warning to | |
1245 | -- the effect that this might lead to unaligned arguments. | |
1246 | ||
ee6ba406 | 1247 | function Make_Var (Actual : Node_Id) return Entity_Id; |
f37968de | 1248 | -- Returns an entity that refers to the given actual parameter, Actual |
1249 | -- (not including any type conversion). If Actual is an entity name, | |
1250 | -- then this entity is returned unchanged, otherwise a renaming is | |
1251 | -- created to provide an entity for the actual. | |
ee6ba406 | 1252 | |
1253 | procedure Reset_Packed_Prefix; | |
1254 | -- The expansion of a packed array component reference is delayed in | |
1255 | -- the context of a call. Now we need to complete the expansion, so we | |
1256 | -- unmark the analyzed bits in all prefixes. | |
1257 | ||
1258 | --------------------------- | |
1259 | -- Add_Call_By_Copy_Code -- | |
1260 | --------------------------- | |
1261 | ||
1262 | procedure Add_Call_By_Copy_Code is | |
12760d32 | 1263 | Crep : Boolean; |
a05205b0 | 1264 | Expr : Node_Id; |
12760d32 | 1265 | F_Typ : Entity_Id := Etype (Formal); |
1266 | Indic : Node_Id; | |
a05205b0 | 1267 | Init : Node_Id; |
1268 | Temp : Entity_Id; | |
a05205b0 | 1269 | V_Typ : Entity_Id; |
12760d32 | 1270 | Var : Entity_Id; |
ee6ba406 | 1271 | |
1272 | begin | |
aad6babd | 1273 | if not Is_Legal_Copy then |
1274 | return; | |
1275 | end if; | |
1276 | ||
10f7f083 | 1277 | Temp := Make_Temporary (Loc, 'T', Actual); |
ee6ba406 | 1278 | |
12760d32 | 1279 | -- Handle formals whose type comes from the limited view |
1280 | ||
1281 | if From_Limited_With (F_Typ) | |
1282 | and then Has_Non_Limited_View (F_Typ) | |
1283 | then | |
1284 | F_Typ := Non_Limited_View (F_Typ); | |
1285 | end if; | |
1286 | ||
ba40b4af | 1287 | -- Use formal type for temp, unless formal type is an unconstrained |
1288 | -- array, in which case we don't have to worry about bounds checks, | |
aad6babd | 1289 | -- and we use the actual type, since that has appropriate bounds. |
ba40b4af | 1290 | |
1291 | if Is_Array_Type (F_Typ) and then not Is_Constrained (F_Typ) then | |
1292 | Indic := New_Occurrence_Of (Etype (Actual), Loc); | |
1293 | else | |
12760d32 | 1294 | Indic := New_Occurrence_Of (F_Typ, Loc); |
ba40b4af | 1295 | end if; |
1296 | ||
e54cffd1 | 1297 | -- The new code will be properly analyzed below and the setting of |
1298 | -- the Do_Range_Check flag recomputed so remove the obsolete one. | |
1299 | ||
1300 | Set_Do_Range_Check (Actual, False); | |
1301 | ||
ee6ba406 | 1302 | if Nkind (Actual) = N_Type_Conversion then |
e54cffd1 | 1303 | Set_Do_Range_Check (Expression (Actual), False); |
1304 | ||
ee6ba406 | 1305 | V_Typ := Etype (Expression (Actual)); |
a4740ca0 | 1306 | |
1307 | -- If the formal is an (in-)out parameter, capture the name | |
1308 | -- of the variable in order to build the post-call assignment. | |
37cb33b0 | 1309 | |
1310 | Var := Make_Var (Expression (Actual)); | |
a4740ca0 | 1311 | |
9988dae3 | 1312 | Crep := not Same_Representation |
80d4fec4 | 1313 | (F_Typ, Etype (Expression (Actual))); |
9988dae3 | 1314 | |
ee6ba406 | 1315 | else |
1316 | V_Typ := Etype (Actual); | |
1317 | Var := Make_Var (Actual); | |
1318 | Crep := False; | |
1319 | end if; | |
1320 | ||
1321 | -- Setup initialization for case of in out parameter, or an out | |
1322 | -- parameter where the formal is an unconstrained array (in the | |
1323 | -- latter case, we have to pass in an object with bounds). | |
1324 | ||
a05205b0 | 1325 | -- If this is an out parameter, the initial copy is wasteful, so as |
1326 | -- an optimization for the one-dimensional case we extract the | |
1327 | -- bounds of the actual and build an uninitialized temporary of the | |
1328 | -- right size. | |
1329 | ||
bc6efd33 | 1330 | -- If the formal is an out parameter with discriminants, the |
1331 | -- discriminants must be captured even if the rest of the object | |
1332 | -- is in principle uninitialized, because the discriminants may | |
1333 | -- be read by the called subprogram. | |
1334 | ||
ee6ba406 | 1335 | if Ekind (Formal) = E_In_Out_Parameter |
80d4fec4 | 1336 | or else (Is_Array_Type (F_Typ) and then not Is_Constrained (F_Typ)) |
bc6efd33 | 1337 | or else Has_Discriminants (F_Typ) |
ee6ba406 | 1338 | then |
1339 | if Nkind (Actual) = N_Type_Conversion then | |
1340 | if Conversion_OK (Actual) then | |
80d4fec4 | 1341 | Init := OK_Convert_To (F_Typ, New_Occurrence_Of (Var, Loc)); |
ee6ba406 | 1342 | else |
80d4fec4 | 1343 | Init := Convert_To (F_Typ, New_Occurrence_Of (Var, Loc)); |
ee6ba406 | 1344 | end if; |
a05205b0 | 1345 | |
1346 | elsif Ekind (Formal) = E_Out_Parameter | |
80d4fec4 | 1347 | and then Is_Array_Type (F_Typ) |
1348 | and then Number_Dimensions (F_Typ) = 1 | |
1349 | and then not Has_Non_Null_Base_Init_Proc (F_Typ) | |
a05205b0 | 1350 | then |
1351 | -- Actual is a one-dimensional array or slice, and the type | |
1352 | -- requires no initialization. Create a temporary of the | |
ba40b4af | 1353 | -- right size, but do not copy actual into it (optimization). |
a05205b0 | 1354 | |
1355 | Init := Empty; | |
1356 | Indic := | |
1357 | Make_Subtype_Indication (Loc, | |
1c38ef3f | 1358 | Subtype_Mark => New_Occurrence_Of (F_Typ, Loc), |
a05205b0 | 1359 | Constraint => |
1360 | Make_Index_Or_Discriminant_Constraint (Loc, | |
1361 | Constraints => New_List ( | |
1362 | Make_Range (Loc, | |
1363 | Low_Bound => | |
1364 | Make_Attribute_Reference (Loc, | |
1c38ef3f | 1365 | Prefix => New_Occurrence_Of (Var, Loc), |
041aa047 | 1366 | Attribute_Name => Name_First), |
a05205b0 | 1367 | High_Bound => |
1368 | Make_Attribute_Reference (Loc, | |
1c38ef3f | 1369 | Prefix => New_Occurrence_Of (Var, Loc), |
a05205b0 | 1370 | Attribute_Name => Name_Last))))); |
1371 | ||
ee6ba406 | 1372 | else |
1373 | Init := New_Occurrence_Of (Var, Loc); | |
1374 | end if; | |
1375 | ||
1376 | -- An initialization is created for packed conversions as | |
1377 | -- actuals for out parameters to enable Make_Object_Declaration | |
1378 | -- to determine the proper subtype for N_Node. Note that this | |
1379 | -- is wasteful because the extra copying on the call side is | |
1380 | -- not required for such out parameters. ??? | |
1381 | ||
1382 | elsif Ekind (Formal) = E_Out_Parameter | |
1383 | and then Nkind (Actual) = N_Type_Conversion | |
80d4fec4 | 1384 | and then (Is_Bit_Packed_Array (F_Typ) |
ee6ba406 | 1385 | or else |
1386 | Is_Bit_Packed_Array (Etype (Expression (Actual)))) | |
1387 | then | |
1388 | if Conversion_OK (Actual) then | |
ba40b4af | 1389 | Init := OK_Convert_To (F_Typ, New_Occurrence_Of (Var, Loc)); |
ee6ba406 | 1390 | else |
ba40b4af | 1391 | Init := Convert_To (F_Typ, New_Occurrence_Of (Var, Loc)); |
ee6ba406 | 1392 | end if; |
752e1833 | 1393 | |
1394 | elsif Ekind (Formal) = E_In_Parameter then | |
578f27c9 | 1395 | |
1396 | -- Handle the case in which the actual is a type conversion | |
1397 | ||
1398 | if Nkind (Actual) = N_Type_Conversion then | |
1399 | if Conversion_OK (Actual) then | |
1400 | Init := OK_Convert_To (F_Typ, New_Occurrence_Of (Var, Loc)); | |
1401 | else | |
1402 | Init := Convert_To (F_Typ, New_Occurrence_Of (Var, Loc)); | |
1403 | end if; | |
1404 | else | |
1405 | Init := New_Occurrence_Of (Var, Loc); | |
1406 | end if; | |
752e1833 | 1407 | |
fec0c7f6 | 1408 | -- Access types are passed in without checks, but if a copy-back is |
1409 | -- required for a null-excluding check on an in-out or out parameter, | |
1410 | -- then the initial value is that of the actual. | |
1411 | ||
1412 | elsif Is_Access_Type (E_Formal) | |
1413 | and then Can_Never_Be_Null (Etype (Actual)) | |
1414 | and then not Can_Never_Be_Null (E_Formal) | |
1415 | then | |
1416 | Init := New_Occurrence_Of (Var, Loc); | |
1417 | ||
ee6ba406 | 1418 | else |
1419 | Init := Empty; | |
1420 | end if; | |
1421 | ||
1422 | N_Node := | |
1423 | Make_Object_Declaration (Loc, | |
1424 | Defining_Identifier => Temp, | |
a05205b0 | 1425 | Object_Definition => Indic, |
ba40b4af | 1426 | Expression => Init); |
ee6ba406 | 1427 | Set_Assignment_OK (N_Node); |
1428 | Insert_Action (N, N_Node); | |
1429 | ||
1430 | -- Now, normally the deal here is that we use the defining | |
1431 | -- identifier created by that object declaration. There is | |
1432 | -- one exception to this. In the change of representation case | |
1433 | -- the above declaration will end up looking like: | |
1434 | ||
1435 | -- temp : type := identifier; | |
1436 | ||
1437 | -- And in this case we might as well use the identifier directly | |
1438 | -- and eliminate the temporary. Note that the analysis of the | |
1439 | -- declaration was not a waste of time in that case, since it is | |
1440 | -- what generated the necessary change of representation code. If | |
1441 | -- the change of representation introduced additional code, as in | |
1442 | -- a fixed-integer conversion, the expression is not an identifier | |
1443 | -- and must be kept. | |
1444 | ||
1445 | if Crep | |
1446 | and then Present (Expression (N_Node)) | |
1447 | and then Is_Entity_Name (Expression (N_Node)) | |
1448 | then | |
1449 | Temp := Entity (Expression (N_Node)); | |
1450 | Rewrite (N_Node, Make_Null_Statement (Loc)); | |
1451 | end if; | |
1452 | ||
9dfe12ae | 1453 | -- For IN parameter, all we do is to replace the actual |
ee6ba406 | 1454 | |
9dfe12ae | 1455 | if Ekind (Formal) = E_In_Parameter then |
83c6c069 | 1456 | Rewrite (Actual, New_Occurrence_Of (Temp, Loc)); |
9dfe12ae | 1457 | Analyze (Actual); |
1458 | ||
1459 | -- Processing for OUT or IN OUT parameter | |
1460 | ||
1461 | else | |
33b6091b | 1462 | -- Kill current value indications for the temporary variable we |
1463 | -- created, since we just passed it as an OUT parameter. | |
1464 | ||
1465 | Kill_Current_Values (Temp); | |
ed195555 | 1466 | Set_Is_Known_Valid (Temp, False); |
a367d7bc | 1467 | Set_Is_True_Constant (Temp, False); |
33b6091b | 1468 | |
9dfe12ae | 1469 | -- If type conversion, use reverse conversion on exit |
1470 | ||
1471 | if Nkind (Actual) = N_Type_Conversion then | |
1472 | if Conversion_OK (Actual) then | |
1473 | Expr := OK_Convert_To (V_Typ, New_Occurrence_Of (Temp, Loc)); | |
1474 | else | |
1475 | Expr := Convert_To (V_Typ, New_Occurrence_Of (Temp, Loc)); | |
1476 | end if; | |
ee6ba406 | 1477 | else |
9dfe12ae | 1478 | Expr := New_Occurrence_Of (Temp, Loc); |
ee6ba406 | 1479 | end if; |
ee6ba406 | 1480 | |
83c6c069 | 1481 | Rewrite (Actual, New_Occurrence_Of (Temp, Loc)); |
9dfe12ae | 1482 | Analyze (Actual); |
ee6ba406 | 1483 | |
a3e461ac | 1484 | -- If the actual is a conversion of a packed reference, it may |
1485 | -- already have been expanded by Remove_Side_Effects, and the | |
1486 | -- resulting variable is a temporary which does not designate | |
1487 | -- the proper out-parameter, which may not be addressable. In | |
1488 | -- that case, generate an assignment to the original expression | |
d3931fdc | 1489 | -- (before expansion of the packed reference) so that the proper |
a3e461ac | 1490 | -- expansion of assignment to a packed component can take place. |
ee6ba406 | 1491 | |
a3e461ac | 1492 | declare |
1493 | Obj : Node_Id; | |
1494 | Lhs : Node_Id; | |
1495 | ||
1496 | begin | |
1497 | if Is_Renaming_Of_Object (Var) | |
1498 | and then Nkind (Renamed_Object (Var)) = N_Selected_Component | |
a3e461ac | 1499 | and then Nkind (Original_Node (Prefix (Renamed_Object (Var)))) |
1500 | = N_Indexed_Component | |
1501 | and then | |
1502 | Has_Non_Standard_Rep (Etype (Prefix (Renamed_Object (Var)))) | |
1503 | then | |
1504 | Obj := Renamed_Object (Var); | |
1505 | Lhs := | |
1506 | Make_Selected_Component (Loc, | |
1507 | Prefix => | |
1508 | New_Copy_Tree (Original_Node (Prefix (Obj))), | |
1509 | Selector_Name => New_Copy (Selector_Name (Obj))); | |
1510 | Reset_Analyzed_Flags (Lhs); | |
1511 | ||
1512 | else | |
ab8a61d0 | 1513 | Lhs := New_Occurrence_Of (Var, Loc); |
a3e461ac | 1514 | end if; |
1515 | ||
1516 | Set_Assignment_OK (Lhs); | |
1517 | ||
47d210a3 | 1518 | if Is_Access_Type (E_Formal) |
1519 | and then Is_Entity_Name (Lhs) | |
1a9cc6cd | 1520 | and then |
1521 | Present (Effective_Extra_Accessibility (Entity (Lhs))) | |
47d210a3 | 1522 | then |
57c2f209 | 1523 | -- Copyback target is an Ada 2012 stand-alone object of an |
1524 | -- anonymous access type. | |
47d210a3 | 1525 | |
1526 | pragma Assert (Ada_Version >= Ada_2012); | |
1527 | ||
1528 | if Type_Access_Level (E_Formal) > | |
1a9cc6cd | 1529 | Object_Access_Level (Lhs) |
1530 | then | |
1531 | Append_To (Post_Call, | |
1532 | Make_Raise_Program_Error (Loc, | |
1533 | Reason => PE_Accessibility_Check_Failed)); | |
47d210a3 | 1534 | end if; |
1535 | ||
1536 | Append_To (Post_Call, | |
1537 | Make_Assignment_Statement (Loc, | |
1538 | Name => Lhs, | |
1539 | Expression => Expr)); | |
1540 | ||
1a9cc6cd | 1541 | -- We would like to somehow suppress generation of the |
1542 | -- extra_accessibility assignment generated by the expansion | |
1543 | -- of the above assignment statement. It's not a correctness | |
1544 | -- issue because the following assignment renders it dead, | |
1545 | -- but generating back-to-back assignments to the same | |
1546 | -- target is undesirable. ??? | |
47d210a3 | 1547 | |
1548 | Append_To (Post_Call, | |
1549 | Make_Assignment_Statement (Loc, | |
1550 | Name => New_Occurrence_Of ( | |
1551 | Effective_Extra_Accessibility (Entity (Lhs)), Loc), | |
1552 | Expression => Make_Integer_Literal (Loc, | |
1553 | Type_Access_Level (E_Formal)))); | |
1a9cc6cd | 1554 | |
47d210a3 | 1555 | else |
fec0c7f6 | 1556 | if Is_Access_Type (E_Formal) |
1557 | and then Can_Never_Be_Null (Etype (Actual)) | |
1558 | and then not Can_Never_Be_Null (E_Formal) | |
1559 | then | |
1560 | Append_To (Post_Call, | |
1561 | Make_Raise_Constraint_Error (Loc, | |
1562 | Condition => | |
1563 | Make_Op_Eq (Loc, | |
1564 | Left_Opnd => New_Occurrence_Of (Temp, Loc), | |
1565 | Right_Opnd => Make_Null (Loc)), | |
1566 | Reason => CE_Access_Check_Failed)); | |
1567 | end if; | |
1568 | ||
47d210a3 | 1569 | Append_To (Post_Call, |
1570 | Make_Assignment_Statement (Loc, | |
1571 | Name => Lhs, | |
1572 | Expression => Expr)); | |
1573 | end if; | |
a3e461ac | 1574 | end; |
9dfe12ae | 1575 | end if; |
ee6ba406 | 1576 | end Add_Call_By_Copy_Code; |
1577 | ||
1578 | ---------------------------------- | |
ba40b4af | 1579 | -- Add_Simple_Call_By_Copy_Code -- |
ee6ba406 | 1580 | ---------------------------------- |
1581 | ||
ba40b4af | 1582 | procedure Add_Simple_Call_By_Copy_Code is |
aad6babd | 1583 | Decl : Node_Id; |
12760d32 | 1584 | F_Typ : Entity_Id := Etype (Formal); |
ee6ba406 | 1585 | Incod : Node_Id; |
12760d32 | 1586 | Indic : Node_Id; |
ee6ba406 | 1587 | Lhs : Node_Id; |
12760d32 | 1588 | Outcod : Node_Id; |
ee6ba406 | 1589 | Rhs : Node_Id; |
12760d32 | 1590 | Temp : Entity_Id; |
ee6ba406 | 1591 | |
1592 | begin | |
aad6babd | 1593 | if not Is_Legal_Copy then |
1594 | return; | |
1595 | end if; | |
1596 | ||
12760d32 | 1597 | -- Handle formals whose type comes from the limited view |
1598 | ||
1599 | if From_Limited_With (F_Typ) | |
1600 | and then Has_Non_Limited_View (F_Typ) | |
1601 | then | |
1602 | F_Typ := Non_Limited_View (F_Typ); | |
1603 | end if; | |
1604 | ||
ba40b4af | 1605 | -- Use formal type for temp, unless formal type is an unconstrained |
1606 | -- array, in which case we don't have to worry about bounds checks, | |
aad6babd | 1607 | -- and we use the actual type, since that has appropriate bounds. |
ba40b4af | 1608 | |
1609 | if Is_Array_Type (F_Typ) and then not Is_Constrained (F_Typ) then | |
1610 | Indic := New_Occurrence_Of (Etype (Actual), Loc); | |
1611 | else | |
12760d32 | 1612 | Indic := New_Occurrence_Of (F_Typ, Loc); |
ba40b4af | 1613 | end if; |
ee6ba406 | 1614 | |
1615 | -- Prepare to generate code | |
1616 | ||
ba40b4af | 1617 | Reset_Packed_Prefix; |
1618 | ||
10f7f083 | 1619 | Temp := Make_Temporary (Loc, 'T', Actual); |
ee6ba406 | 1620 | Incod := Relocate_Node (Actual); |
1621 | Outcod := New_Copy_Tree (Incod); | |
1622 | ||
1623 | -- Generate declaration of temporary variable, initializing it | |
586402e1 | 1624 | -- with the input parameter unless we have an OUT formal or |
aad6babd | 1625 | -- this is an initialization call. |
ee6ba406 | 1626 | |
586402e1 | 1627 | -- If the formal is an out parameter with discriminants, the |
1628 | -- discriminants must be captured even if the rest of the object | |
1629 | -- is in principle uninitialized, because the discriminants may | |
1630 | -- be read by the called subprogram. | |
1631 | ||
ee6ba406 | 1632 | if Ekind (Formal) = E_Out_Parameter then |
1633 | Incod := Empty; | |
aad6babd | 1634 | |
12760d32 | 1635 | if Has_Discriminants (F_Typ) then |
586402e1 | 1636 | Indic := New_Occurrence_Of (Etype (Actual), Loc); |
1637 | end if; | |
1638 | ||
aad6babd | 1639 | elsif Inside_Init_Proc then |
586402e1 | 1640 | |
1641 | -- Could use a comment here to match comment below ??? | |
1642 | ||
aad6babd | 1643 | if Nkind (Actual) /= N_Selected_Component |
1644 | or else | |
1645 | not Has_Discriminant_Dependent_Constraint | |
1646 | (Entity (Selector_Name (Actual))) | |
1647 | then | |
1648 | Incod := Empty; | |
1649 | ||
586402e1 | 1650 | -- Otherwise, keep the component in order to generate the proper |
1651 | -- actual subtype, that depends on enclosing discriminants. | |
aad6babd | 1652 | |
586402e1 | 1653 | else |
aad6babd | 1654 | null; |
1655 | end if; | |
ee6ba406 | 1656 | end if; |
1657 | ||
aad6babd | 1658 | Decl := |
ee6ba406 | 1659 | Make_Object_Declaration (Loc, |
1660 | Defining_Identifier => Temp, | |
ba40b4af | 1661 | Object_Definition => Indic, |
aad6babd | 1662 | Expression => Incod); |
1663 | ||
1664 | if Inside_Init_Proc | |
1665 | and then No (Incod) | |
1666 | then | |
1667 | -- If the call is to initialize a component of a composite type, | |
1668 | -- and the component does not depend on discriminants, use the | |
1669 | -- actual type of the component. This is required in case the | |
1670 | -- component is constrained, because in general the formal of the | |
1671 | -- initialization procedure will be unconstrained. Note that if | |
1672 | -- the component being initialized is constrained by an enclosing | |
1673 | -- discriminant, the presence of the initialization in the | |
1674 | -- declaration will generate an expression for the actual subtype. | |
1675 | ||
1676 | Set_No_Initialization (Decl); | |
1677 | Set_Object_Definition (Decl, | |
1678 | New_Occurrence_Of (Etype (Actual), Loc)); | |
1679 | end if; | |
1680 | ||
1681 | Insert_Action (N, Decl); | |
ee6ba406 | 1682 | |
1683 | -- The actual is simply a reference to the temporary | |
1684 | ||
1685 | Rewrite (Actual, New_Occurrence_Of (Temp, Loc)); | |
1686 | ||
1687 | -- Generate copy out if OUT or IN OUT parameter | |
1688 | ||
1689 | if Ekind (Formal) /= E_In_Parameter then | |
1690 | Lhs := Outcod; | |
1691 | Rhs := New_Occurrence_Of (Temp, Loc); | |
a367d7bc | 1692 | Set_Is_True_Constant (Temp, False); |
ee6ba406 | 1693 | |
1694 | -- Deal with conversion | |
1695 | ||
1696 | if Nkind (Lhs) = N_Type_Conversion then | |
1697 | Lhs := Expression (Lhs); | |
1698 | Rhs := Convert_To (Etype (Actual), Rhs); | |
1699 | end if; | |
1700 | ||
1701 | Append_To (Post_Call, | |
1702 | Make_Assignment_Statement (Loc, | |
1703 | Name => Lhs, | |
1704 | Expression => Rhs)); | |
ba40b4af | 1705 | Set_Assignment_OK (Name (Last (Post_Call))); |
ee6ba406 | 1706 | end if; |
ba40b4af | 1707 | end Add_Simple_Call_By_Copy_Code; |
ee6ba406 | 1708 | |
49adf385 | 1709 | -------------------------------------- |
1710 | -- Add_Validation_Call_By_Copy_Code -- | |
1711 | -------------------------------------- | |
1712 | ||
1713 | procedure Add_Validation_Call_By_Copy_Code (Act : Node_Id) is | |
1714 | Expr : Node_Id; | |
1715 | Obj : Node_Id; | |
1716 | Obj_Typ : Entity_Id; | |
37066559 | 1717 | Var : constant Node_Id := Unqual_Conv (Act); |
49adf385 | 1718 | Var_Id : Entity_Id; |
1719 | ||
1720 | begin | |
e54cffd1 | 1721 | -- Generate range check if required |
1722 | ||
1723 | if Do_Range_Check (Actual) then | |
1724 | Generate_Range_Check (Actual, E_Formal, CE_Range_Check_Failed); | |
1725 | end if; | |
1726 | ||
1727 | -- If there is a type conversion in the actual, it will be reinstated | |
1728 | -- below, the new instance will be properly analyzed and the setting | |
1729 | -- of the Do_Range_Check flag recomputed so remove the obsolete one. | |
1730 | ||
1731 | if Nkind (Actual) = N_Type_Conversion then | |
1732 | Set_Do_Range_Check (Expression (Actual), False); | |
1733 | end if; | |
1734 | ||
49adf385 | 1735 | -- Copy the value of the validation variable back into the object |
1736 | -- being validated. | |
1737 | ||
1738 | if Is_Entity_Name (Var) then | |
1739 | Var_Id := Entity (Var); | |
1740 | Obj := Validated_Object (Var_Id); | |
1741 | Obj_Typ := Etype (Obj); | |
1742 | ||
1743 | Expr := New_Occurrence_Of (Var_Id, Loc); | |
1744 | ||
1745 | -- A type conversion is needed when the validation variable and | |
1746 | -- the validated object carry different types. This case occurs | |
1747 | -- when the actual is qualified in some fashion. | |
1748 | ||
1749 | -- Common: | |
1750 | -- subtype Int is Integer range ...; | |
1751 | -- procedure Call (Val : in out Integer); | |
1752 | ||
1753 | -- Original: | |
1754 | -- Object : Int; | |
1755 | -- Call (Integer (Object)); | |
1756 | ||
1757 | -- Expanded: | |
1758 | -- Object : Int; | |
1759 | -- Var : Integer := Object; -- conversion to base type | |
1760 | -- if not Var'Valid then -- validity check | |
1761 | -- Call (Var); -- modify Var | |
1762 | -- Object := Int (Var); -- conversion to subtype | |
1763 | ||
1764 | if Etype (Var_Id) /= Obj_Typ then | |
1765 | Expr := | |
1766 | Make_Type_Conversion (Loc, | |
1767 | Subtype_Mark => New_Occurrence_Of (Obj_Typ, Loc), | |
1768 | Expression => Expr); | |
1769 | end if; | |
1770 | ||
1771 | -- Generate: | |
1772 | -- Object := Var; | |
1773 | -- <or> | |
1774 | -- Object := Object_Type (Var); | |
1775 | ||
1776 | Append_To (Post_Call, | |
1777 | Make_Assignment_Statement (Loc, | |
1778 | Name => Obj, | |
1779 | Expression => Expr)); | |
1780 | ||
1781 | -- If the flow reaches this point, then this routine was invoked with | |
1782 | -- an actual which does not denote a validation variable. | |
1783 | ||
1784 | else | |
1785 | pragma Assert (False); | |
1786 | null; | |
1787 | end if; | |
1788 | end Add_Validation_Call_By_Copy_Code; | |
1789 | ||
ee6ba406 | 1790 | --------------------------- |
1791 | -- Check_Fortran_Logical -- | |
1792 | --------------------------- | |
1793 | ||
1794 | procedure Check_Fortran_Logical is | |
9dfe12ae | 1795 | Logical : constant Entity_Id := Etype (Formal); |
ee6ba406 | 1796 | Var : Entity_Id; |
1797 | ||
1798 | -- Note: this is very incomplete, e.g. it does not handle arrays | |
1799 | -- of logical values. This is really not the right approach at all???) | |
1800 | ||
1801 | begin | |
1802 | if Convention (Subp) = Convention_Fortran | |
1803 | and then Root_Type (Etype (Formal)) = Standard_Boolean | |
1804 | and then Ekind (Formal) /= E_In_Parameter | |
1805 | then | |
1806 | Var := Make_Var (Actual); | |
1807 | Append_To (Post_Call, | |
1808 | Make_Assignment_Statement (Loc, | |
1809 | Name => New_Occurrence_Of (Var, Loc), | |
1810 | Expression => | |
1811 | Unchecked_Convert_To ( | |
1812 | Logical, | |
1813 | Make_Op_Ne (Loc, | |
1814 | Left_Opnd => New_Occurrence_Of (Var, Loc), | |
1815 | Right_Opnd => | |
1816 | Unchecked_Convert_To ( | |
1817 | Logical, | |
1818 | New_Occurrence_Of (Standard_False, Loc)))))); | |
1819 | end if; | |
1820 | end Check_Fortran_Logical; | |
1821 | ||
aad6babd | 1822 | ------------------- |
1823 | -- Is_Legal_Copy -- | |
1824 | ------------------- | |
1825 | ||
1826 | function Is_Legal_Copy return Boolean is | |
1827 | begin | |
1828 | -- An attempt to copy a value of such a type can only occur if | |
1829 | -- representation clauses give the actual a misaligned address. | |
1830 | ||
1831 | if Is_By_Reference_Type (Etype (Formal)) then | |
b3ba409d | 1832 | |
3a7fe2f3 | 1833 | -- The actual may in fact be properly aligned but there is not |
1834 | -- enough front-end information to determine this. In that case | |
1835 | -- gigi will emit an error if a copy is not legal, or generate | |
1836 | -- the proper code. | |
b3ba409d | 1837 | |
aad6babd | 1838 | return False; |
1839 | ||
1840 | -- For users of Starlet, we assume that the specification of by- | |
4907451e | 1841 | -- reference mechanism is mandatory. This may lead to unaligned |
aad6babd | 1842 | -- objects but at least for DEC legacy code it is known to work. |
1843 | -- The warning will alert users of this code that a problem may | |
1844 | -- be lurking. | |
1845 | ||
1846 | elsif Mechanism (Formal) = By_Reference | |
1847 | and then Is_Valued_Procedure (Scope (Formal)) | |
1848 | then | |
1849 | Error_Msg_N | |
cb97ae5c | 1850 | ("by_reference actual may be misaligned??", Actual); |
aad6babd | 1851 | return False; |
1852 | ||
1853 | else | |
1854 | return True; | |
1855 | end if; | |
1856 | end Is_Legal_Copy; | |
1857 | ||
ee6ba406 | 1858 | -------------- |
1859 | -- Make_Var -- | |
1860 | -------------- | |
1861 | ||
1862 | function Make_Var (Actual : Node_Id) return Entity_Id is | |
1863 | Var : Entity_Id; | |
1864 | ||
1865 | begin | |
1866 | if Is_Entity_Name (Actual) then | |
1867 | return Entity (Actual); | |
1868 | ||
1869 | else | |
10f7f083 | 1870 | Var := Make_Temporary (Loc, 'T', Actual); |
ee6ba406 | 1871 | |
1872 | N_Node := | |
1873 | Make_Object_Renaming_Declaration (Loc, | |
1874 | Defining_Identifier => Var, | |
1875 | Subtype_Mark => | |
1876 | New_Occurrence_Of (Etype (Actual), Loc), | |
1877 | Name => Relocate_Node (Actual)); | |
1878 | ||
1879 | Insert_Action (N, N_Node); | |
1880 | return Var; | |
1881 | end if; | |
1882 | end Make_Var; | |
1883 | ||
1884 | ------------------------- | |
1885 | -- Reset_Packed_Prefix -- | |
1886 | ------------------------- | |
1887 | ||
1888 | procedure Reset_Packed_Prefix is | |
1889 | Pfx : Node_Id := Actual; | |
ee6ba406 | 1890 | begin |
1891 | loop | |
1892 | Set_Analyzed (Pfx, False); | |
d34432fa | 1893 | exit when |
1894 | not Nkind_In (Pfx, N_Selected_Component, N_Indexed_Component); | |
ee6ba406 | 1895 | Pfx := Prefix (Pfx); |
1896 | end loop; | |
1897 | end Reset_Packed_Prefix; | |
1898 | ||
1899 | -- Start of processing for Expand_Actuals | |
1900 | ||
1901 | begin | |
ee6ba406 | 1902 | Post_Call := New_List; |
1903 | ||
948ef2b8 | 1904 | Formal := First_Formal (Subp); |
1905 | Actual := First_Actual (N); | |
ee6ba406 | 1906 | while Present (Formal) loop |
1907 | E_Formal := Etype (Formal); | |
e04e8bab | 1908 | E_Actual := Etype (Actual); |
ee6ba406 | 1909 | |
12760d32 | 1910 | -- Handle formals whose type comes from the limited view |
1911 | ||
1912 | if From_Limited_With (E_Formal) | |
1913 | and then Has_Non_Limited_View (E_Formal) | |
1914 | then | |
1915 | E_Formal := Non_Limited_View (E_Formal); | |
1916 | end if; | |
1917 | ||
ee6ba406 | 1918 | if Is_Scalar_Type (E_Formal) |
1919 | or else Nkind (Actual) = N_Slice | |
1920 | then | |
1921 | Check_Fortran_Logical; | |
1922 | ||
1923 | -- RM 6.4.1 (11) | |
1924 | ||
1925 | elsif Ekind (Formal) /= E_Out_Parameter then | |
1926 | ||
1927 | -- The unusual case of the current instance of a protected type | |
1928 | -- requires special handling. This can only occur in the context | |
1929 | -- of a call within the body of a protected operation. | |
1930 | ||
1931 | if Is_Entity_Name (Actual) | |
1932 | and then Ekind (Entity (Actual)) = E_Protected_Type | |
1933 | and then In_Open_Scopes (Entity (Actual)) | |
1934 | then | |
1935 | if Scope (Subp) /= Entity (Actual) then | |
cb97ae5c | 1936 | Error_Msg_N |
1937 | ("operation outside protected type may not " | |
1938 | & "call back its protected operations??", Actual); | |
ee6ba406 | 1939 | end if; |
1940 | ||
1941 | Rewrite (Actual, | |
1942 | Expand_Protected_Object_Reference (N, Entity (Actual))); | |
1943 | end if; | |
1944 | ||
578f27c9 | 1945 | -- Ada 2005 (AI-318-02): If the actual parameter is a call to a |
1946 | -- build-in-place function, then a temporary return object needs | |
1947 | -- to be created and access to it must be passed to the function. | |
21ec6442 | 1948 | -- Currently we limit such functions to those with inherently |
1949 | -- limited result subtypes, but eventually we plan to expand the | |
1950 | -- functions that are treated as build-in-place to include other | |
1951 | -- composite result types. | |
578f27c9 | 1952 | |
c6b238e7 | 1953 | if Is_Build_In_Place_Function_Call (Actual) then |
578f27c9 | 1954 | Make_Build_In_Place_Call_In_Anonymous_Context (Actual); |
8b3a98b2 | 1955 | |
1956 | -- Ada 2005 (AI-318-02): Specialization of the previous case for | |
1957 | -- actuals containing build-in-place function calls whose returned | |
1958 | -- object covers interface types. | |
1959 | ||
1960 | elsif Present (Unqual_BIP_Iface_Function_Call (Actual)) then | |
1961 | Make_Build_In_Place_Iface_Call_In_Anonymous_Context (Actual); | |
578f27c9 | 1962 | end if; |
1963 | ||
ee6ba406 | 1964 | Apply_Constraint_Check (Actual, E_Formal); |
1965 | ||
1966 | -- Out parameter case. No constraint checks on access type | |
fec0c7f6 | 1967 | -- RM 6.4.1 (13), but on return a null-excluding check may be |
1968 | -- required (see below). | |
ee6ba406 | 1969 | |
1970 | elsif Is_Access_Type (E_Formal) then | |
1971 | null; | |
1972 | ||
1973 | -- RM 6.4.1 (14) | |
1974 | ||
1975 | elsif Has_Discriminants (Base_Type (E_Formal)) | |
1976 | or else Has_Non_Null_Base_Init_Proc (E_Formal) | |
1977 | then | |
1978 | Apply_Constraint_Check (Actual, E_Formal); | |
1979 | ||
1980 | -- RM 6.4.1 (15) | |
1981 | ||
1982 | else | |
1983 | Apply_Constraint_Check (Actual, Base_Type (E_Formal)); | |
1984 | end if; | |
1985 | ||
1986 | -- Processing for IN-OUT and OUT parameters | |
1987 | ||
1988 | if Ekind (Formal) /= E_In_Parameter then | |
1989 | ||
1990 | -- For type conversions of arrays, apply length/range checks | |
1991 | ||
1992 | if Is_Array_Type (E_Formal) | |
1993 | and then Nkind (Actual) = N_Type_Conversion | |
1994 | then | |
1995 | if Is_Constrained (E_Formal) then | |
1996 | Apply_Length_Check (Expression (Actual), E_Formal); | |
1997 | else | |
1998 | Apply_Range_Check (Expression (Actual), E_Formal); | |
1999 | end if; | |
2000 | end if; | |
2001 | ||
49adf385 | 2002 | -- The actual denotes a variable which captures the value of an |
2003 | -- object for validation purposes. Add a copy-back to reflect any | |
2004 | -- potential changes in value back into the original object. | |
2005 | ||
2006 | -- Var : ... := Object; | |
2007 | -- if not Var'Valid then -- validity check | |
2008 | -- Call (Var); -- modify var | |
2009 | -- Object := Var; -- update Object | |
2010 | ||
2011 | -- This case is given higher priority because the subsequent check | |
2012 | -- for type conversion may add an extra copy of the variable and | |
2013 | -- prevent proper value propagation back in the original object. | |
2014 | ||
2015 | if Is_Validation_Variable_Reference (Actual) then | |
2016 | Add_Validation_Call_By_Copy_Code (Actual); | |
ee6ba406 | 2017 | |
49adf385 | 2018 | -- If argument is a type conversion for a type that is passed by |
2019 | -- copy, then we must pass the parameter by copy. | |
2020 | ||
2021 | elsif Nkind (Actual) = N_Type_Conversion | |
ee6ba406 | 2022 | and then |
2023 | (Is_Numeric_Type (E_Formal) | |
2024 | or else Is_Access_Type (E_Formal) | |
2025 | or else Is_Enumeration_Type (E_Formal) | |
2026 | or else Is_Bit_Packed_Array (Etype (Formal)) | |
2027 | or else Is_Bit_Packed_Array (Etype (Expression (Actual))) | |
2028 | ||
2029 | -- Also pass by copy if change of representation | |
2030 | ||
2031 | or else not Same_Representation | |
f37968de | 2032 | (Etype (Formal), |
2033 | Etype (Expression (Actual)))) | |
ee6ba406 | 2034 | then |
2035 | Add_Call_By_Copy_Code; | |
2036 | ||
3610cd03 | 2037 | -- References to components of bit-packed arrays are expanded |
ee6ba406 | 2038 | -- at this point, rather than at the point of analysis of the |
2039 | -- actuals, to handle the expansion of the assignment to | |
2040 | -- [in] out parameters. | |
2041 | ||
2042 | elsif Is_Ref_To_Bit_Packed_Array (Actual) then | |
ba40b4af | 2043 | Add_Simple_Call_By_Copy_Code; |
2044 | ||
5d2fb1fa | 2045 | -- If a nonscalar actual is possibly bit-aligned, we need a copy |
578f27c9 | 2046 | -- because the back-end cannot cope with such objects. In other |
2047 | -- cases where alignment forces a copy, the back-end generates | |
2048 | -- it properly. It should not be generated unconditionally in the | |
2049 | -- front-end because it does not know precisely the alignment | |
2050 | -- requirements of the target, and makes too conservative an | |
2051 | -- estimate, leading to superfluous copies or spurious errors | |
2052 | -- on by-reference parameters. | |
ba40b4af | 2053 | |
578f27c9 | 2054 | elsif Nkind (Actual) = N_Selected_Component |
2055 | and then | |
2056 | Component_May_Be_Bit_Aligned (Entity (Selector_Name (Actual))) | |
ba40b4af | 2057 | and then not Represented_As_Scalar (Etype (Formal)) |
2058 | then | |
2059 | Add_Simple_Call_By_Copy_Code; | |
ee6ba406 | 2060 | |
3610cd03 | 2061 | -- References to slices of bit-packed arrays are expanded |
ee6ba406 | 2062 | |
2063 | elsif Is_Ref_To_Bit_Packed_Slice (Actual) then | |
2064 | Add_Call_By_Copy_Code; | |
2065 | ||
9dfe12ae | 2066 | -- References to possibly unaligned slices of arrays are expanded |
2067 | ||
2068 | elsif Is_Possibly_Unaligned_Slice (Actual) then | |
2069 | Add_Call_By_Copy_Code; | |
2070 | ||
4907451e | 2071 | -- Deal with access types where the actual subtype and the |
ee6ba406 | 2072 | -- formal subtype are not the same, requiring a check. |
2073 | ||
da253936 | 2074 | -- It is necessary to exclude tagged types because of "downward |
fec0c7f6 | 2075 | -- conversion" errors, but null-excluding checks on return may be |
2076 | -- required. | |
ee6ba406 | 2077 | |
2078 | elsif Is_Access_Type (E_Formal) | |
ee6ba406 | 2079 | and then not Is_Tagged_Type (Designated_Type (E_Formal)) |
fec0c7f6 | 2080 | and then (not Same_Type (E_Formal, E_Actual) |
2081 | or else (Can_Never_Be_Null (E_Actual) | |
2082 | and then not Can_Never_Be_Null (E_Formal))) | |
ee6ba406 | 2083 | then |
2084 | Add_Call_By_Copy_Code; | |
2085 | ||
877a38b6 | 2086 | -- If the actual is not a scalar and is marked for volatile |
2087 | -- treatment, whereas the formal is not volatile, then pass | |
2088 | -- by copy unless it is a by-reference type. | |
2089 | ||
09001c4f | 2090 | -- Note: we use Is_Volatile here rather than Treat_As_Volatile, |
2091 | -- because this is the enforcement of a language rule that applies | |
2092 | -- only to "real" volatile variables, not e.g. to the address | |
2093 | -- clause overlay case. | |
2094 | ||
ee6ba406 | 2095 | elsif Is_Entity_Name (Actual) |
09001c4f | 2096 | and then Is_Volatile (Entity (Actual)) |
e04e8bab | 2097 | and then not Is_By_Reference_Type (E_Actual) |
ee6ba406 | 2098 | and then not Is_Scalar_Type (Etype (Entity (Actual))) |
09001c4f | 2099 | and then not Is_Volatile (E_Formal) |
ee6ba406 | 2100 | then |
2101 | Add_Call_By_Copy_Code; | |
2102 | ||
2103 | elsif Nkind (Actual) = N_Indexed_Component | |
2104 | and then Is_Entity_Name (Prefix (Actual)) | |
2105 | and then Has_Volatile_Components (Entity (Prefix (Actual))) | |
2106 | then | |
2107 | Add_Call_By_Copy_Code; | |
a9b57347 | 2108 | |
2109 | -- Add call-by-copy code for the case of scalar out parameters | |
2110 | -- when it is not known at compile time that the subtype of the | |
865909d3 | 2111 | -- formal is a subrange of the subtype of the actual (or vice |
2112 | -- versa for in out parameters), in order to get range checks | |
2113 | -- on such actuals. (Maybe this case should be handled earlier | |
2114 | -- in the if statement???) | |
a9b57347 | 2115 | |
2116 | elsif Is_Scalar_Type (E_Formal) | |
865909d3 | 2117 | and then |
e04e8bab | 2118 | (not In_Subrange_Of (E_Formal, E_Actual) |
865909d3 | 2119 | or else |
2120 | (Ekind (Formal) = E_In_Out_Parameter | |
e04e8bab | 2121 | and then not In_Subrange_Of (E_Actual, E_Formal))) |
a9b57347 | 2122 | then |
a9b57347 | 2123 | Add_Call_By_Copy_Code; |
ee6ba406 | 2124 | end if; |
2125 | ||
1c38ef3f | 2126 | -- RM 3.2.4 (23/3): A predicate is checked on in-out and out |
e04e8bab | 2127 | -- by-reference parameters on exit from the call. If the actual |
2128 | -- is a derived type and the operation is inherited, the body | |
2129 | -- of the operation will not contain a call to the predicate | |
2130 | -- function, so it must be done explicitly after the call. Ditto | |
2131 | -- if the actual is an entity of a predicated subtype. | |
2132 | ||
be0abd94 | 2133 | -- The rule refers to by-reference types, but a check is needed |
2134 | -- for by-copy types as well. That check is subsumed by the rule | |
2135 | -- for subtype conversion on assignment, but we can generate the | |
2136 | -- required check now. | |
2137 | ||
adf351ab | 2138 | -- Note also that Subp may be either a subprogram entity for |
f2780d56 | 2139 | -- direct calls, or a type entity for indirect calls, which must |
2140 | -- be handled separately because the name does not denote an | |
2141 | -- overloadable entity. | |
adf351ab | 2142 | |
b02fd639 | 2143 | By_Ref_Predicate_Check : declare |
1c38ef3f | 2144 | Aund : constant Entity_Id := Underlying_Type (E_Actual); |
2145 | Atyp : Entity_Id; | |
2146 | ||
b02fd639 | 2147 | function Is_Public_Subp return Boolean; |
2148 | -- Check whether the subprogram being called is a visible | |
2149 | -- operation of the type of the actual. Used to determine | |
2150 | -- whether an invariant check must be generated on the | |
2151 | -- caller side. | |
2152 | ||
2153 | --------------------- | |
2154 | -- Is_Public_Subp -- | |
2155 | --------------------- | |
2156 | ||
2157 | function Is_Public_Subp return Boolean is | |
2158 | Pack : constant Entity_Id := Scope (Subp); | |
2159 | Subp_Decl : Node_Id; | |
2160 | ||
2161 | begin | |
2162 | if not Is_Subprogram (Subp) then | |
2163 | return False; | |
2164 | ||
2165 | -- The operation may be inherited, or a primitive of the | |
2166 | -- root type. | |
2167 | ||
2168 | elsif | |
2169 | Nkind_In (Parent (Subp), N_Private_Extension_Declaration, | |
2170 | N_Full_Type_Declaration) | |
2171 | then | |
2172 | Subp_Decl := Parent (Subp); | |
2173 | ||
2174 | else | |
2175 | Subp_Decl := Unit_Declaration_Node (Subp); | |
2176 | end if; | |
2177 | ||
2178 | return Ekind (Pack) = E_Package | |
2179 | and then | |
2180 | List_Containing (Subp_Decl) = | |
2181 | Visible_Declarations | |
2182 | (Specification (Unit_Declaration_Node (Pack))); | |
2183 | end Is_Public_Subp; | |
2184 | ||
2185 | -- Start of processing for By_Ref_Predicate_Check | |
2186 | ||
1c38ef3f | 2187 | begin |
2188 | if No (Aund) then | |
2189 | Atyp := E_Actual; | |
2190 | else | |
2191 | Atyp := Aund; | |
2192 | end if; | |
2193 | ||
2194 | if Has_Predicates (Atyp) | |
2195 | and then Present (Predicate_Function (Atyp)) | |
2196 | ||
2197 | -- Skip predicate checks for special cases | |
2198 | ||
85a11867 | 2199 | and then Predicate_Tests_On_Arguments (Subp) |
1c38ef3f | 2200 | then |
2201 | Append_To (Post_Call, | |
2202 | Make_Predicate_Check (Atyp, Actual)); | |
2203 | end if; | |
b02fd639 | 2204 | |
2205 | -- We generated caller-side invariant checks in two cases: | |
2206 | ||
2207 | -- a) when calling an inherited operation, where there is an | |
2208 | -- implicit view conversion of the actual to the parent type. | |
2209 | ||
2210 | -- b) When the conversion is explicit | |
2211 | ||
2212 | -- We treat these cases separately because the required | |
2213 | -- conversion for a) is added later when expanding the call. | |
2214 | ||
2215 | if Has_Invariants (Etype (Actual)) | |
2216 | and then | |
2217 | Nkind (Parent (Subp)) = N_Private_Extension_Declaration | |
2218 | then | |
724539dd | 2219 | if Comes_From_Source (N) and then Is_Public_Subp then |
b02fd639 | 2220 | Append_To (Post_Call, Make_Invariant_Call (Actual)); |
2221 | end if; | |
2222 | ||
2223 | elsif Nkind (Actual) = N_Type_Conversion | |
2224 | and then Has_Invariants (Etype (Expression (Actual))) | |
2225 | then | |
2226 | if Comes_From_Source (N) and then Is_Public_Subp then | |
2227 | Append_To (Post_Call, | |
2228 | Make_Invariant_Call (Expression (Actual))); | |
2229 | end if; | |
2230 | end if; | |
2231 | end By_Ref_Predicate_Check; | |
e04e8bab | 2232 | |
9dfe12ae | 2233 | -- Processing for IN parameters |
ee6ba406 | 2234 | |
2235 | else | |
e54cffd1 | 2236 | -- Generate range check if required |
2237 | ||
2238 | if Do_Range_Check (Actual) then | |
2239 | Generate_Range_Check (Actual, E_Formal, CE_Range_Check_Failed); | |
2240 | end if; | |
2241 | ||
3610cd03 | 2242 | -- For IN parameters in the bit-packed array case, we expand an |
9dfe12ae | 2243 | -- indexed component (the circuit in Exp_Ch4 deliberately left |
2244 | -- indexed components appearing as actuals untouched, so that | |
2245 | -- the special processing above for the OUT and IN OUT cases | |
2246 | -- could be performed. We could make the test in Exp_Ch4 more | |
2247 | -- complex and have it detect the parameter mode, but it is | |
ba40b4af | 2248 | -- easier simply to handle all cases here.) |
9dfe12ae | 2249 | |
ee6ba406 | 2250 | if Nkind (Actual) = N_Indexed_Component |
7214e56d | 2251 | and then Is_Bit_Packed_Array (Etype (Prefix (Actual))) |
ee6ba406 | 2252 | then |
2253 | Reset_Packed_Prefix; | |
2254 | Expand_Packed_Element_Reference (Actual); | |
2255 | ||
3610cd03 | 2256 | -- If we have a reference to a bit-packed array, we copy it, since |
09001c4f | 2257 | -- the actual must be byte aligned. |
ee6ba406 | 2258 | |
9dfe12ae | 2259 | -- Is this really necessary in all cases??? |
ee6ba406 | 2260 | |
9dfe12ae | 2261 | elsif Is_Ref_To_Bit_Packed_Array (Actual) then |
ba40b4af | 2262 | Add_Simple_Call_By_Copy_Code; |
2263 | ||
5d2fb1fa | 2264 | -- If a nonscalar actual is possibly unaligned, we need a copy |
ba40b4af | 2265 | |
2266 | elsif Is_Possibly_Unaligned_Object (Actual) | |
2267 | and then not Represented_As_Scalar (Etype (Formal)) | |
2268 | then | |
2269 | Add_Simple_Call_By_Copy_Code; | |
ee6ba406 | 2270 | |
9dfe12ae | 2271 | -- Similarly, we have to expand slices of packed arrays here |
2272 | -- because the result must be byte aligned. | |
ee6ba406 | 2273 | |
9dfe12ae | 2274 | elsif Is_Ref_To_Bit_Packed_Slice (Actual) then |
2275 | Add_Call_By_Copy_Code; | |
ee6ba406 | 2276 | |
9dfe12ae | 2277 | -- Only processing remaining is to pass by copy if this is a |
2278 | -- reference to a possibly unaligned slice, since the caller | |
2279 | -- expects an appropriately aligned argument. | |
ee6ba406 | 2280 | |
9dfe12ae | 2281 | elsif Is_Possibly_Unaligned_Slice (Actual) then |
2282 | Add_Call_By_Copy_Code; | |
4d9b288b | 2283 | |
2284 | -- An unusual case: a current instance of an enclosing task can be | |
2285 | -- an actual, and must be replaced by a reference to self. | |
2286 | ||
2287 | elsif Is_Entity_Name (Actual) | |
2288 | and then Is_Task_Type (Entity (Actual)) | |
2289 | then | |
2290 | if In_Open_Scopes (Entity (Actual)) then | |
2291 | Rewrite (Actual, | |
2292 | (Make_Function_Call (Loc, | |
f37968de | 2293 | Name => New_Occurrence_Of (RTE (RE_Self), Loc)))); |
4d9b288b | 2294 | Analyze (Actual); |
2295 | ||
2296 | -- A task type cannot otherwise appear as an actual | |
2297 | ||
2298 | else | |
2299 | raise Program_Error; | |
2300 | end if; | |
ee6ba406 | 2301 | end if; |
2302 | end if; | |
2303 | ||
2304 | Next_Formal (Formal); | |
2305 | Next_Actual (Actual); | |
2306 | end loop; | |
ee6ba406 | 2307 | end Expand_Actuals; |
2308 | ||
2309 | ----------------- | |
2310 | -- Expand_Call -- | |
2311 | ----------------- | |
2312 | ||
f1ce0b4e | 2313 | procedure Expand_Call (N : Node_Id) is |
2314 | Post_Call : List_Id; | |
e0e76328 | 2315 | |
f1ce0b4e | 2316 | begin |
e0e76328 | 2317 | pragma Assert (Nkind_In (N, N_Entry_Call_Statement, |
2318 | N_Function_Call, | |
2319 | N_Procedure_Call_Statement)); | |
2320 | ||
f1ce0b4e | 2321 | Expand_Call_Helper (N, Post_Call); |
2322 | Insert_Post_Call_Actions (N, Post_Call); | |
2323 | end Expand_Call; | |
2324 | ||
2325 | ------------------------ | |
2326 | -- Expand_Call_Helper -- | |
2327 | ------------------------ | |
2328 | ||
ee6ba406 | 2329 | -- This procedure handles expansion of function calls and procedure call |
2330 | -- statements (i.e. it serves as the body for Expand_N_Function_Call and | |
041aa047 | 2331 | -- Expand_N_Procedure_Call_Statement). Processing for calls includes: |
ee6ba406 | 2332 | |
041aa047 | 2333 | -- Replace call to Raise_Exception by Raise_Exception_Always if possible |
ee6ba406 | 2334 | -- Provide values of actuals for all formals in Extra_Formals list |
2335 | -- Replace "call" to enumeration literal function by literal itself | |
2336 | -- Rewrite call to predefined operator as operator | |
2337 | -- Replace actuals to in-out parameters that are numeric conversions, | |
2338 | -- with explicit assignment to temporaries before and after the call. | |
ee6ba406 | 2339 | |
2340 | -- Note that the list of actuals has been filled with default expressions | |
2341 | -- during semantic analysis of the call. Only the extra actuals required | |
2342 | -- for the 'Constrained attribute and for accessibility checks are added | |
2343 | -- at this point. | |
2344 | ||
f1ce0b4e | 2345 | procedure Expand_Call_Helper (N : Node_Id; Post_Call : out List_Id) is |
ee6ba406 | 2346 | Loc : constant Source_Ptr := Sloc (N); |
c7f8b065 | 2347 | Call_Node : Node_Id := N; |
ee6ba406 | 2348 | Extra_Actuals : List_Id := No_List; |
fdd18a7c | 2349 | Prev : Node_Id := Empty; |
aad6babd | 2350 | |
ee6ba406 | 2351 | procedure Add_Actual_Parameter (Insert_Param : Node_Id); |
2352 | -- Adds one entry to the end of the actual parameter list. Used for | |
948ef2b8 | 2353 | -- default parameters and for extra actuals (for Extra_Formals). The |
2354 | -- argument is an N_Parameter_Association node. | |
ee6ba406 | 2355 | |
2356 | procedure Add_Extra_Actual (Expr : Node_Id; EF : Entity_Id); | |
948ef2b8 | 2357 | -- Adds an extra actual to the list of extra actuals. Expr is the |
2358 | -- expression for the value of the actual, EF is the entity for the | |
2359 | -- extra formal. | |
ee6ba406 | 2360 | |
f10fcdcc | 2361 | procedure Add_View_Conversion_Invariants |
2362 | (Formal : Entity_Id; | |
2363 | Actual : Node_Id); | |
0903a8a4 | 2364 | -- Adds invariant checks for every intermediate type between the range |
2365 | -- of a view converted argument to its ancestor (from parent to child). | |
718edc45 | 2366 | |
3da5e0d4 | 2367 | function Can_Fold_Predicate_Call (P : Entity_Id) return Boolean; |
2368 | -- Try to constant-fold a predicate check, which often enough is a | |
2369 | -- simple arithmetic expression that can be computed statically if | |
2370 | -- its argument is static. This cleans up the output of CCG, even | |
2371 | -- though useless predicate checks will be generally removed by | |
2372 | -- back-end optimizations. | |
2373 | ||
ee6ba406 | 2374 | function Inherited_From_Formal (S : Entity_Id) return Entity_Id; |
d1a2e31b | 2375 | -- Within an instance, a type derived from an untagged formal derived |
041aa047 | 2376 | -- type inherits from the original parent, not from the actual. The |
2377 | -- current derivation mechanism has the derived type inherit from the | |
2378 | -- actual, which is only correct outside of the instance. If the | |
2379 | -- subprogram is inherited, we test for this particular case through a | |
2380 | -- convoluted tree traversal before setting the proper subprogram to be | |
2381 | -- called. | |
ee6ba406 | 2382 | |
9ef23ec9 | 2383 | function In_Unfrozen_Instance (E : Entity_Id) return Boolean; |
2384 | -- Return true if E comes from an instance that is not yet frozen | |
2385 | ||
2ac657bd | 2386 | function Is_Class_Wide_Interface_Type (E : Entity_Id) return Boolean; |
2387 | -- Return True when E is a class-wide interface type or an access to | |
2388 | -- a class-wide interface type. | |
2389 | ||
bb3b440a | 2390 | function Is_Direct_Deep_Call (Subp : Entity_Id) return Boolean; |
b3190af0 | 2391 | -- Determine if Subp denotes a non-dispatching call to a Deep routine |
bb3b440a | 2392 | |
a828619e | 2393 | function New_Value (From : Node_Id) return Node_Id; |
2394 | -- From is the original Expression. New_Value is equivalent to a call | |
2395 | -- to Duplicate_Subexpr with an explicit dereference when From is an | |
2396 | -- access parameter. | |
2397 | ||
ee6ba406 | 2398 | -------------------------- |
2399 | -- Add_Actual_Parameter -- | |
2400 | -------------------------- | |
2401 | ||
2402 | procedure Add_Actual_Parameter (Insert_Param : Node_Id) is | |
2403 | Actual_Expr : constant Node_Id := | |
2404 | Explicit_Actual_Parameter (Insert_Param); | |
2405 | ||
2406 | begin | |
2407 | -- Case of insertion is first named actual | |
2408 | ||
2409 | if No (Prev) or else | |
2410 | Nkind (Parent (Prev)) /= N_Parameter_Association | |
2411 | then | |
c7f8b065 | 2412 | Set_Next_Named_Actual |
2413 | (Insert_Param, First_Named_Actual (Call_Node)); | |
2414 | Set_First_Named_Actual (Call_Node, Actual_Expr); | |
ee6ba406 | 2415 | |
2416 | if No (Prev) then | |
c7f8b065 | 2417 | if No (Parameter_Associations (Call_Node)) then |
2418 | Set_Parameter_Associations (Call_Node, New_List); | |
ee6ba406 | 2419 | end if; |
0c6b5982 | 2420 | |
2421 | Append (Insert_Param, Parameter_Associations (Call_Node)); | |
2422 | ||
ee6ba406 | 2423 | else |
2424 | Insert_After (Prev, Insert_Param); | |
2425 | end if; | |
2426 | ||
2427 | -- Case of insertion is not first named actual | |
2428 | ||
2429 | else | |
2430 | Set_Next_Named_Actual | |
2431 | (Insert_Param, Next_Named_Actual (Parent (Prev))); | |
2432 | Set_Next_Named_Actual (Parent (Prev), Actual_Expr); | |
c7f8b065 | 2433 | Append (Insert_Param, Parameter_Associations (Call_Node)); |
ee6ba406 | 2434 | end if; |
2435 | ||
2436 | Prev := Actual_Expr; | |
2437 | end Add_Actual_Parameter; | |
2438 | ||
2439 | ---------------------- | |
2440 | -- Add_Extra_Actual -- | |
2441 | ---------------------- | |
2442 | ||
2443 | procedure Add_Extra_Actual (Expr : Node_Id; EF : Entity_Id) is | |
2444 | Loc : constant Source_Ptr := Sloc (Expr); | |
2445 | ||
2446 | begin | |
2447 | if Extra_Actuals = No_List then | |
2448 | Extra_Actuals := New_List; | |
c7f8b065 | 2449 | Set_Parent (Extra_Actuals, Call_Node); |
ee6ba406 | 2450 | end if; |
2451 | ||
2452 | Append_To (Extra_Actuals, | |
2453 | Make_Parameter_Association (Loc, | |
1e4f3cfb | 2454 | Selector_Name => New_Occurrence_Of (EF, Loc), |
52307e9c | 2455 | Explicit_Actual_Parameter => Expr)); |
ee6ba406 | 2456 | |
2457 | Analyze_And_Resolve (Expr, Etype (EF)); | |
0429d533 | 2458 | |
c7f8b065 | 2459 | if Nkind (Call_Node) = N_Function_Call then |
0429d533 | 2460 | Set_Is_Accessibility_Actual (Parent (Expr)); |
2461 | end if; | |
ee6ba406 | 2462 | end Add_Extra_Actual; |
2463 | ||
f10fcdcc | 2464 | ------------------------------------ |
2465 | -- Add_View_Conversion_Invariants -- | |
2466 | ------------------------------------ | |
718edc45 | 2467 | |
f10fcdcc | 2468 | procedure Add_View_Conversion_Invariants |
2469 | (Formal : Entity_Id; | |
2470 | Actual : Node_Id) | |
2471 | is | |
718edc45 | 2472 | Arg : Entity_Id; |
0903a8a4 | 2473 | Curr_Typ : Entity_Id; |
718edc45 | 2474 | Inv_Checks : List_Id; |
2475 | Par_Typ : Entity_Id; | |
2476 | ||
2477 | begin | |
2478 | Inv_Checks := No_List; | |
2479 | ||
0903a8a4 | 2480 | -- Extract the argument from a potentially nested set of view |
2481 | -- conversions. | |
718edc45 | 2482 | |
2483 | Arg := Actual; | |
2484 | while Nkind (Arg) = N_Type_Conversion loop | |
2485 | Arg := Expression (Arg); | |
2486 | end loop; | |
2487 | ||
0903a8a4 | 2488 | -- Move up the derivation chain starting with the type of the formal |
2489 | -- parameter down to the type of the actual object. | |
718edc45 | 2490 | |
0903a8a4 | 2491 | Curr_Typ := Empty; |
2492 | Par_Typ := Etype (Arg); | |
718edc45 | 2493 | while Par_Typ /= Etype (Formal) and Par_Typ /= Curr_Typ loop |
2494 | Curr_Typ := Par_Typ; | |
0903a8a4 | 2495 | |
718edc45 | 2496 | if Has_Invariants (Curr_Typ) |
2497 | and then Present (Invariant_Procedure (Curr_Typ)) | |
2498 | then | |
2499 | -- Verify the invariate of the current type. Generate: | |
0903a8a4 | 2500 | |
2501 | -- <Curr_Typ>Invariant (Curr_Typ (Arg)); | |
718edc45 | 2502 | |
2503 | Prepend_New_To (Inv_Checks, | |
2504 | Make_Procedure_Call_Statement (Loc, | |
2505 | Name => | |
2506 | New_Occurrence_Of | |
2507 | (Invariant_Procedure (Curr_Typ), Loc), | |
2508 | Parameter_Associations => New_List ( | |
2509 | Make_Type_Conversion (Loc, | |
2510 | Subtype_Mark => New_Occurrence_Of (Curr_Typ, Loc), | |
2511 | Expression => New_Copy_Tree (Arg))))); | |
2512 | end if; | |
2513 | ||
2514 | Par_Typ := Base_Type (Etype (Curr_Typ)); | |
2515 | end loop; | |
2516 | ||
2517 | if not Is_Empty_List (Inv_Checks) then | |
2518 | Insert_Actions_After (N, Inv_Checks); | |
2519 | end if; | |
f10fcdcc | 2520 | end Add_View_Conversion_Invariants; |
718edc45 | 2521 | |
3da5e0d4 | 2522 | ----------------------------- |
2523 | -- Can_Fold_Predicate_Call -- | |
2524 | ----------------------------- | |
2525 | ||
2526 | function Can_Fold_Predicate_Call (P : Entity_Id) return Boolean is | |
180bd06b | 2527 | Actual : Node_Id; |
3da5e0d4 | 2528 | |
2529 | function May_Fold (N : Node_Id) return Traverse_Result; | |
2530 | -- The predicate expression is foldable if it only contains operators | |
2531 | -- and literals. During this check, we also replace occurrences of | |
2532 | -- the formal of the constructed predicate function with the static | |
2533 | -- value of the actual. This is done on a copy of the analyzed | |
2534 | -- expression for the predicate. | |
2535 | ||
53904d64 | 2536 | -------------- |
2537 | -- May_Fold -- | |
2538 | -------------- | |
2539 | ||
3da5e0d4 | 2540 | function May_Fold (N : Node_Id) return Traverse_Result is |
2541 | begin | |
2542 | case Nkind (N) is | |
53904d64 | 2543 | when N_Binary_Op |
2544 | | N_Unary_Op | |
2545 | => | |
3da5e0d4 | 2546 | return OK; |
2547 | ||
53904d64 | 2548 | when N_Expanded_Name |
2549 | | N_Identifier | |
2550 | => | |
3da5e0d4 | 2551 | if Ekind (Entity (N)) = E_In_Parameter |
2552 | and then Entity (N) = First_Entity (P) | |
2553 | then | |
2554 | Rewrite (N, New_Copy (Actual)); | |
2555 | Set_Is_Static_Expression (N); | |
2556 | return OK; | |
2557 | ||
2558 | elsif Ekind (Entity (N)) = E_Enumeration_Literal then | |
2559 | return OK; | |
2560 | ||
2561 | else | |
2562 | return Abandon; | |
2563 | end if; | |
2564 | ||
53904d64 | 2565 | when N_Case_Expression |
2566 | | N_If_Expression | |
2567 | => | |
3da5e0d4 | 2568 | return OK; |
2569 | ||
2570 | when N_Integer_Literal => | |
2571 | return OK; | |
2572 | ||
2573 | when others => | |
2574 | return Abandon; | |
2575 | end case; | |
2576 | end May_Fold; | |
2577 | ||
2578 | function Try_Fold is new Traverse_Func (May_Fold); | |
2579 | ||
180bd06b | 2580 | -- Other lLocal variables |
53904d64 | 2581 | |
180bd06b | 2582 | Subt : constant Entity_Id := Etype (First_Entity (P)); |
2583 | Aspect : Node_Id; | |
2584 | Pred : Node_Id; | |
53904d64 | 2585 | |
3da5e0d4 | 2586 | -- Start of processing for Can_Fold_Predicate_Call |
2587 | ||
2588 | begin | |
2589 | -- Folding is only interesting if the actual is static and its type | |
2590 | -- has a Dynamic_Predicate aspect. For CodePeer we preserve the | |
2591 | -- function call. | |
2592 | ||
180bd06b | 2593 | Actual := First (Parameter_Associations (Call_Node)); |
2594 | Aspect := Find_Aspect (Subt, Aspect_Dynamic_Predicate); | |
2595 | ||
2596 | -- If actual is a declared constant, retrieve its value | |
2597 | ||
2598 | if Is_Entity_Name (Actual) | |
2599 | and then Ekind (Entity (Actual)) = E_Constant | |
2600 | then | |
2601 | Actual := Constant_Value (Entity (Actual)); | |
2602 | end if; | |
2603 | ||
2604 | if No (Actual) | |
2605 | or else Nkind (Actual) /= N_Integer_Literal | |
3da5e0d4 | 2606 | or else not Has_Dynamic_Predicate_Aspect (Subt) |
180bd06b | 2607 | or else No (Aspect) |
3da5e0d4 | 2608 | or else CodePeer_Mode |
2609 | then | |
2610 | return False; | |
2611 | end if; | |
2612 | ||
2613 | -- Retrieve the analyzed expression for the predicate | |
2614 | ||
180bd06b | 2615 | Pred := New_Copy_Tree (Expression (Aspect)); |
3da5e0d4 | 2616 | |
2617 | if Try_Fold (Pred) = OK then | |
2618 | Rewrite (Call_Node, Pred); | |
2619 | Analyze_And_Resolve (Call_Node, Standard_Boolean); | |
2620 | return True; | |
2621 | ||
53904d64 | 2622 | -- Otherwise continue the expansion of the function call |
3da5e0d4 | 2623 | |
53904d64 | 2624 | else |
3da5e0d4 | 2625 | return False; |
2626 | end if; | |
2627 | end Can_Fold_Predicate_Call; | |
2628 | ||
ee6ba406 | 2629 | --------------------------- |
2630 | -- Inherited_From_Formal -- | |
2631 | --------------------------- | |
2632 | ||
2633 | function Inherited_From_Formal (S : Entity_Id) return Entity_Id is | |
2634 | Par : Entity_Id; | |
2635 | Gen_Par : Entity_Id; | |
2636 | Gen_Prim : Elist_Id; | |
2637 | Elmt : Elmt_Id; | |
2638 | Indic : Node_Id; | |
2639 | ||
2640 | begin | |
2641 | -- If the operation is inherited, it is attached to the corresponding | |
2642 | -- type derivation. If the parent in the derivation is a generic | |
2643 | -- actual, it is a subtype of the actual, and we have to recover the | |
2644 | -- original derived type declaration to find the proper parent. | |
2645 | ||
2646 | if Nkind (Parent (S)) /= N_Full_Type_Declaration | |
9dfe12ae | 2647 | or else not Is_Derived_Type (Defining_Identifier (Parent (S))) |
948ef2b8 | 2648 | or else Nkind (Type_Definition (Original_Node (Parent (S)))) /= |
2649 | N_Derived_Type_Definition | |
9dfe12ae | 2650 | or else not In_Instance |
ee6ba406 | 2651 | then |
2652 | return Empty; | |
2653 | ||
2654 | else | |
2655 | Indic := | |
b0e684c8 | 2656 | Subtype_Indication |
2657 | (Type_Definition (Original_Node (Parent (S)))); | |
ee6ba406 | 2658 | |
2659 | if Nkind (Indic) = N_Subtype_Indication then | |
2660 | Par := Entity (Subtype_Mark (Indic)); | |
2661 | else | |
2662 | Par := Entity (Indic); | |
2663 | end if; | |
2664 | end if; | |
2665 | ||
2666 | if not Is_Generic_Actual_Type (Par) | |
2667 | or else Is_Tagged_Type (Par) | |
2668 | or else Nkind (Parent (Par)) /= N_Subtype_Declaration | |
2669 | or else not In_Open_Scopes (Scope (Par)) | |
ee6ba406 | 2670 | then |
2671 | return Empty; | |
ee6ba406 | 2672 | else |
2673 | Gen_Par := Generic_Parent_Type (Parent (Par)); | |
2674 | end if; | |
2675 | ||
4907451e | 2676 | -- If the actual has no generic parent type, the formal is not |
2677 | -- a formal derived type, so nothing to inherit. | |
2678 | ||
2679 | if No (Gen_Par) then | |
2680 | return Empty; | |
2681 | end if; | |
2682 | ||
948ef2b8 | 2683 | -- If the generic parent type is still the generic type, this is a |
2684 | -- private formal, not a derived formal, and there are no operations | |
2685 | -- inherited from the formal. | |
9dfe12ae | 2686 | |
2687 | if Nkind (Parent (Gen_Par)) = N_Formal_Type_Declaration then | |
2688 | return Empty; | |
2689 | end if; | |
2690 | ||
ee6ba406 | 2691 | Gen_Prim := Collect_Primitive_Operations (Gen_Par); |
ee6ba406 | 2692 | |
948ef2b8 | 2693 | Elmt := First_Elmt (Gen_Prim); |
ee6ba406 | 2694 | while Present (Elmt) loop |
2695 | if Chars (Node (Elmt)) = Chars (S) then | |
2696 | declare | |
2697 | F1 : Entity_Id; | |
2698 | F2 : Entity_Id; | |
ee6ba406 | 2699 | |
948ef2b8 | 2700 | begin |
ee6ba406 | 2701 | F1 := First_Formal (S); |
2702 | F2 := First_Formal (Node (Elmt)); | |
ee6ba406 | 2703 | while Present (F1) |
2704 | and then Present (F2) | |
2705 | loop | |
ee6ba406 | 2706 | if Etype (F1) = Etype (F2) |
2707 | or else Etype (F2) = Gen_Par | |
2708 | then | |
2709 | Next_Formal (F1); | |
2710 | Next_Formal (F2); | |
2711 | else | |
2712 | Next_Elmt (Elmt); | |
2713 | exit; -- not the right subprogram | |
2714 | end if; | |
2715 | ||
2716 | return Node (Elmt); | |
2717 | end loop; | |
2718 | end; | |
2719 | ||
2720 | else | |
2721 | Next_Elmt (Elmt); | |
2722 | end if; | |
2723 | end loop; | |
2724 | ||
2725 | raise Program_Error; | |
2726 | end Inherited_From_Formal; | |
2727 | ||
9ef23ec9 | 2728 | -------------------------- |
2729 | -- In_Unfrozen_Instance -- | |
2730 | -------------------------- | |
2731 | ||
2732 | function In_Unfrozen_Instance (E : Entity_Id) return Boolean is | |
019bce56 | 2733 | S : Entity_Id; |
9ef23ec9 | 2734 | |
2735 | begin | |
019bce56 | 2736 | S := E; |
2737 | while Present (S) and then S /= Standard_Standard loop | |
9ef23ec9 | 2738 | if Is_Generic_Instance (S) |
2739 | and then Present (Freeze_Node (S)) | |
2740 | and then not Analyzed (Freeze_Node (S)) | |
2741 | then | |
2742 | return True; | |
2743 | end if; | |
2744 | ||
2745 | S := Scope (S); | |
2746 | end loop; | |
2747 | ||
2748 | return False; | |
2749 | end In_Unfrozen_Instance; | |
2750 | ||
2ac657bd | 2751 | ---------------------------------- |
2752 | -- Is_Class_Wide_Interface_Type -- | |
2753 | ---------------------------------- | |
2754 | ||
2755 | function Is_Class_Wide_Interface_Type (E : Entity_Id) return Boolean is | |
2ac657bd | 2756 | DDT : Entity_Id; |
8c21443b | 2757 | Typ : Entity_Id := E; |
2ac657bd | 2758 | |
2759 | begin | |
2760 | if Has_Non_Limited_View (Typ) then | |
2761 | Typ := Non_Limited_View (Typ); | |
2762 | end if; | |
2763 | ||
2764 | if Ekind (Typ) = E_Anonymous_Access_Type then | |
2765 | DDT := Directly_Designated_Type (Typ); | |
2766 | ||
2767 | if Has_Non_Limited_View (DDT) then | |
2768 | DDT := Non_Limited_View (DDT); | |
2769 | end if; | |
2770 | ||
2771 | return Is_Class_Wide_Type (DDT) and then Is_Interface (DDT); | |
2772 | else | |
2773 | return Is_Class_Wide_Type (Typ) and then Is_Interface (Typ); | |
2774 | end if; | |
2775 | end Is_Class_Wide_Interface_Type; | |
2776 | ||
bb3b440a | 2777 | ------------------------- |
2778 | -- Is_Direct_Deep_Call -- | |
2779 | ------------------------- | |
2780 | ||
2781 | function Is_Direct_Deep_Call (Subp : Entity_Id) return Boolean is | |
2782 | begin | |
2783 | if Is_TSS (Subp, TSS_Deep_Adjust) | |
2784 | or else Is_TSS (Subp, TSS_Deep_Finalize) | |
2785 | or else Is_TSS (Subp, TSS_Deep_Initialize) | |
2786 | then | |
2787 | declare | |
2788 | Actual : Node_Id; | |
2789 | Formal : Node_Id; | |
2790 | ||
2791 | begin | |
2792 | Actual := First (Parameter_Associations (N)); | |
2793 | Formal := First_Formal (Subp); | |
2794 | while Present (Actual) | |
2795 | and then Present (Formal) | |
2796 | loop | |
2797 | if Nkind (Actual) = N_Identifier | |
2798 | and then Is_Controlling_Actual (Actual) | |
2799 | and then Etype (Actual) = Etype (Formal) | |
2800 | then | |
2801 | return True; | |
2802 | end if; | |
2803 | ||
2804 | Next (Actual); | |
2805 | Next_Formal (Formal); | |
2806 | end loop; | |
2807 | end; | |
2808 | end if; | |
2809 | ||
2810 | return False; | |
2811 | end Is_Direct_Deep_Call; | |
2812 | ||
a828619e | 2813 | --------------- |
2814 | -- New_Value -- | |
2815 | --------------- | |
2816 | ||
2817 | function New_Value (From : Node_Id) return Node_Id is | |
2818 | Res : constant Node_Id := Duplicate_Subexpr (From); | |
2819 | begin | |
2820 | if Is_Access_Type (Etype (From)) then | |
019bce56 | 2821 | return Make_Explicit_Dereference (Sloc (From), Prefix => Res); |
a828619e | 2822 | else |
2823 | return Res; | |
2824 | end if; | |
2825 | end New_Value; | |
2826 | ||
fdd18a7c | 2827 | -- Local variables |
2828 | ||
9e52df9c | 2829 | Remote : constant Boolean := Is_Remote_Call (Call_Node); |
fdd18a7c | 2830 | Actual : Node_Id; |
2831 | Formal : Entity_Id; | |
2832 | Orig_Subp : Entity_Id := Empty; | |
2833 | Param_Count : Natural := 0; | |
2834 | Parent_Formal : Entity_Id; | |
2835 | Parent_Subp : Entity_Id; | |
ad75f6a5 | 2836 | Pref_Entity : Entity_Id; |
fdd18a7c | 2837 | Scop : Entity_Id; |
2838 | Subp : Entity_Id; | |
2839 | ||
b0e684c8 | 2840 | Prev_Orig : Node_Id; |
fdd18a7c | 2841 | -- Original node for an actual, which may have been rewritten. If the |
2842 | -- actual is a function call that has been transformed from a selected | |
2843 | -- component, the original node is unanalyzed. Otherwise, it carries | |
2844 | -- semantic information used to generate additional actuals. | |
2845 | ||
2846 | CW_Interface_Formals_Present : Boolean := False; | |
2847 | ||
f1ce0b4e | 2848 | -- Start of processing for Expand_Call_Helper |
ee6ba406 | 2849 | |
2850 | begin | |
f1ce0b4e | 2851 | Post_Call := New_List; |
2852 | ||
ea6969d4 | 2853 | -- Expand the function or procedure call if the first actual has a |
2854 | -- declared dimension aspect, and the subprogram is declared in one | |
2855 | -- of the dimension I/O packages. | |
85696508 | 2856 | |
2857 | if Ada_Version >= Ada_2012 | |
ea6969d4 | 2858 | and then |
2859 | Nkind_In (Call_Node, N_Procedure_Call_Statement, N_Function_Call) | |
85696508 | 2860 | and then Present (Parameter_Associations (Call_Node)) |
2861 | then | |
2b184b2f | 2862 | Expand_Put_Call_With_Symbol (Call_Node); |
85696508 | 2863 | end if; |
2864 | ||
f15731c4 | 2865 | -- Ignore if previous error |
2866 | ||
c7f8b065 | 2867 | if Nkind (Call_Node) in N_Has_Etype |
2868 | and then Etype (Call_Node) = Any_Type | |
2869 | then | |
f15731c4 | 2870 | return; |
2871 | end if; | |
2872 | ||
ee6ba406 | 2873 | -- Call using access to subprogram with explicit dereference |
2874 | ||
c7f8b065 | 2875 | if Nkind (Name (Call_Node)) = N_Explicit_Dereference then |
2876 | Subp := Etype (Name (Call_Node)); | |
ee6ba406 | 2877 | Parent_Subp := Empty; |
2878 | ||
2879 | -- Case of call to simple entry, where the Name is a selected component | |
2880 | -- whose prefix is the task, and whose selector name is the entry name | |
2881 | ||
c7f8b065 | 2882 | elsif Nkind (Name (Call_Node)) = N_Selected_Component then |
2883 | Subp := Entity (Selector_Name (Name (Call_Node))); | |
ee6ba406 | 2884 | Parent_Subp := Empty; |
2885 | ||
2886 | -- Case of call to member of entry family, where Name is an indexed | |
2887 | -- component, with the prefix being a selected component giving the | |
2888 | -- task and entry family name, and the index being the entry index. | |
2889 | ||
c7f8b065 | 2890 | elsif Nkind (Name (Call_Node)) = N_Indexed_Component then |
2891 | Subp := Entity (Selector_Name (Prefix (Name (Call_Node)))); | |
ee6ba406 | 2892 | Parent_Subp := Empty; |
2893 | ||
2894 | -- Normal case | |
2895 | ||
2896 | else | |
c7f8b065 | 2897 | Subp := Entity (Name (Call_Node)); |
ee6ba406 | 2898 | Parent_Subp := Alias (Subp); |
2899 | ||
2900 | -- Replace call to Raise_Exception by call to Raise_Exception_Always | |
2901 | -- if we can tell that the first parameter cannot possibly be null. | |
041aa047 | 2902 | -- This improves efficiency by avoiding a run-time test. |
ee6ba406 | 2903 | |
4907451e | 2904 | -- We do not do this if Raise_Exception_Always does not exist, which |
2905 | -- can happen in configurable run time profiles which provide only a | |
041aa047 | 2906 | -- Raise_Exception. |
4907451e | 2907 | |
2908 | if Is_RTE (Subp, RE_Raise_Exception) | |
2909 | and then RTE_Available (RE_Raise_Exception_Always) | |
ee6ba406 | 2910 | then |
2911 | declare | |
752dfce0 | 2912 | FA : constant Node_Id := |
2913 | Original_Node (First_Actual (Call_Node)); | |
2914 | ||
ee6ba406 | 2915 | begin |
2916 | -- The case we catch is where the first argument is obtained | |
948ef2b8 | 2917 | -- using the Identity attribute (which must always be |
2918 | -- non-null). | |
ee6ba406 | 2919 | |
2920 | if Nkind (FA) = N_Attribute_Reference | |
2921 | and then Attribute_Name (FA) = Name_Identity | |
2922 | then | |
2923 | Subp := RTE (RE_Raise_Exception_Always); | |
c7f8b065 | 2924 | Set_Name (Call_Node, New_Occurrence_Of (Subp, Loc)); |
ee6ba406 | 2925 | end if; |
2926 | end; | |
2927 | end if; | |
2928 | ||
2929 | if Ekind (Subp) = E_Entry then | |
2930 | Parent_Subp := Empty; | |
2931 | end if; | |
2932 | end if; | |
2933 | ||
76a1c25b | 2934 | -- Ada 2005 (AI-345): We have a procedure call as a triggering |
2935 | -- alternative in an asynchronous select or as an entry call in | |
2936 | -- a conditional or timed select. Check whether the procedure call | |
2937 | -- is a renaming of an entry and rewrite it as an entry call. | |
2938 | ||
de54c5ab | 2939 | if Ada_Version >= Ada_2005 |
c7f8b065 | 2940 | and then Nkind (Call_Node) = N_Procedure_Call_Statement |
76a1c25b | 2941 | and then |
c7f8b065 | 2942 | ((Nkind (Parent (Call_Node)) = N_Triggering_Alternative |
752dfce0 | 2943 | and then Triggering_Statement (Parent (Call_Node)) = Call_Node) |
76a1c25b | 2944 | or else |
c7f8b065 | 2945 | (Nkind (Parent (Call_Node)) = N_Entry_Call_Alternative |
752dfce0 | 2946 | and then Entry_Call_Statement (Parent (Call_Node)) = Call_Node)) |
76a1c25b | 2947 | then |
2948 | declare | |
2949 | Ren_Decl : Node_Id; | |
2950 | Ren_Root : Entity_Id := Subp; | |
2951 | ||
2952 | begin | |
2953 | -- This may be a chain of renamings, find the root | |
2954 | ||
2955 | if Present (Alias (Ren_Root)) then | |
2956 | Ren_Root := Alias (Ren_Root); | |
2957 | end if; | |
2958 | ||
2959 | if Present (Original_Node (Parent (Parent (Ren_Root)))) then | |
2960 | Ren_Decl := Original_Node (Parent (Parent (Ren_Root))); | |
2961 | ||
2962 | if Nkind (Ren_Decl) = N_Subprogram_Renaming_Declaration then | |
c7f8b065 | 2963 | Rewrite (Call_Node, |
76a1c25b | 2964 | Make_Entry_Call_Statement (Loc, |
2965 | Name => | |
2966 | New_Copy_Tree (Name (Ren_Decl)), | |
2967 | Parameter_Associations => | |
c7f8b065 | 2968 | New_Copy_List_Tree |
2969 | (Parameter_Associations (Call_Node)))); | |
76a1c25b | 2970 | |
2971 | return; | |
2972 | end if; | |
2973 | end if; | |
2974 | end; | |
2975 | end if; | |
2976 | ||
3da5e0d4 | 2977 | -- if this is a call to a predicate function, try to constant |
2978 | -- fold it. | |
2979 | ||
2980 | if Nkind (Call_Node) = N_Function_Call | |
2981 | and then Is_Entity_Name (Name (Call_Node)) | |
2982 | and then Is_Predicate_Function (Subp) | |
2983 | and then Can_Fold_Predicate_Call (Subp) | |
2984 | then | |
2985 | return; | |
2986 | end if; | |
2987 | ||
41a8d10f | 2988 | if Modify_Tree_For_C |
2989 | and then Nkind (Call_Node) = N_Function_Call | |
2990 | and then Is_Entity_Name (Name (Call_Node)) | |
41a8d10f | 2991 | then |
a1a88d23 | 2992 | declare |
2993 | Func_Id : constant Entity_Id := | |
2994 | Ultimate_Alias (Entity (Name (Call_Node))); | |
2995 | begin | |
2996 | -- When generating C code, transform a function call that returns | |
2997 | -- a constrained array type into procedure form. | |
b63b3ba9 | 2998 | |
a1a88d23 | 2999 | if Rewritten_For_C (Func_Id) then |
3000 | ||
3001 | -- For internally generated calls ensure that they reference | |
3002 | -- the entity of the spec of the called function (needed since | |
3003 | -- the expander may generate calls using the entity of their | |
3004 | -- body). See for example Expand_Boolean_Operator(). | |
3005 | ||
3006 | if not (Comes_From_Source (Call_Node)) | |
3007 | and then Nkind (Unit_Declaration_Node (Func_Id)) = | |
3008 | N_Subprogram_Body | |
3009 | then | |
3010 | Set_Entity (Name (Call_Node), | |
3011 | Corresponding_Function | |
3012 | (Corresponding_Procedure (Func_Id))); | |
3013 | end if; | |
3014 | ||
3015 | Rewrite_Function_Call_For_C (Call_Node); | |
3016 | return; | |
3017 | ||
3018 | -- Also introduce a temporary for functions that return a record | |
3019 | -- called within another procedure or function call, since records | |
3020 | -- are passed by pointer in the generated C code, and we cannot | |
3021 | -- take a pointer from a subprogram call. | |
3022 | ||
3023 | elsif Nkind (Parent (Call_Node)) in N_Subprogram_Call | |
3024 | and then Is_Record_Type (Etype (Func_Id)) | |
3025 | then | |
3026 | declare | |
3027 | Temp_Id : constant Entity_Id := Make_Temporary (Loc, 'T'); | |
3028 | Decl : Node_Id; | |
3029 | ||
3030 | begin | |
3031 | -- Generate: | |
3032 | -- Temp : ... := Func_Call (...); | |
3033 | ||
3034 | Decl := | |
3035 | Make_Object_Declaration (Loc, | |
3036 | Defining_Identifier => Temp_Id, | |
3037 | Object_Definition => | |
3038 | New_Occurrence_Of (Etype (Func_Id), Loc), | |
3039 | Expression => | |
3040 | Make_Function_Call (Loc, | |
3041 | Name => | |
3042 | New_Occurrence_Of (Func_Id, Loc), | |
3043 | Parameter_Associations => | |
3044 | Parameter_Associations (Call_Node))); | |
3045 | ||
3046 | Insert_Action (Parent (Call_Node), Decl); | |
3047 | Rewrite (Call_Node, New_Occurrence_Of (Temp_Id, Loc)); | |
3048 | return; | |
3049 | end; | |
3050 | end if; | |
3051 | end; | |
41a8d10f | 3052 | end if; |
3053 | ||
b0e684c8 | 3054 | -- First step, compute extra actuals, corresponding to any Extra_Formals |
3055 | -- present. Note that we do not access Extra_Formals directly, instead | |
3056 | -- we simply note the presence of the extra formals as we process the | |
3057 | -- regular formals collecting corresponding actuals in Extra_Actuals. | |
ee6ba406 | 3058 | |
865909d3 | 3059 | -- We also generate any required range checks for actuals for in formals |
3060 | -- as we go through the loop, since this is a convenient place to do it. | |
3061 | -- (Though it seems that this would be better done in Expand_Actuals???) | |
9dfe12ae | 3062 | |
cdc5a761 | 3063 | -- Special case: Thunks must not compute the extra actuals; they must |
3064 | -- just propagate to the target primitive their extra actuals. | |
3065 | ||
3066 | if Is_Thunk (Current_Scope) | |
3067 | and then Thunk_Entity (Current_Scope) = Subp | |
3068 | and then Present (Extra_Formals (Subp)) | |
3069 | then | |
3070 | pragma Assert (Present (Extra_Formals (Current_Scope))); | |
3071 | ||
3072 | declare | |
3073 | Target_Formal : Entity_Id; | |
3074 | Thunk_Formal : Entity_Id; | |
3075 | ||
3076 | begin | |
3077 | Target_Formal := Extra_Formals (Subp); | |
3078 | Thunk_Formal := Extra_Formals (Current_Scope); | |
3079 | while Present (Target_Formal) loop | |
3080 | Add_Extra_Actual | |
4cb8adff | 3081 | (Expr => New_Occurrence_Of (Thunk_Formal, Loc), |
3082 | EF => Thunk_Formal); | |
cdc5a761 | 3083 | |
3084 | Target_Formal := Extra_Formal (Target_Formal); | |
3085 | Thunk_Formal := Extra_Formal (Thunk_Formal); | |
3086 | end loop; | |
3087 | ||
3088 | while Is_Non_Empty_List (Extra_Actuals) loop | |
3089 | Add_Actual_Parameter (Remove_Head (Extra_Actuals)); | |
3090 | end loop; | |
3091 | ||
f1ce0b4e | 3092 | Expand_Actuals (Call_Node, Subp, Post_Call); |
3093 | pragma Assert (Is_Empty_List (Post_Call)); | |
cdc5a761 | 3094 | return; |
3095 | end; | |
3096 | end if; | |
3097 | ||
3465b71e | 3098 | Formal := First_Formal (Subp); |
3099 | Actual := First_Actual (Call_Node); | |
fdd18a7c | 3100 | Param_Count := 1; |
ee6ba406 | 3101 | while Present (Formal) loop |
9dfe12ae | 3102 | -- Prepare to examine current entry |
3103 | ||
ee6ba406 | 3104 | Prev := Actual; |
3105 | Prev_Orig := Original_Node (Prev); | |
3106 | ||
aad6babd | 3107 | -- Ada 2005 (AI-251): Check if any formal is a class-wide interface |
948ef2b8 | 3108 | -- to expand it in a further round. |
aad6babd | 3109 | |
3110 | CW_Interface_Formals_Present := | |
3111 | CW_Interface_Formals_Present | |
2ac657bd | 3112 | or else Is_Class_Wide_Interface_Type (Etype (Formal)); |
aad6babd | 3113 | |
3114 | -- Create possible extra actual for constrained case. Usually, the | |
3115 | -- extra actual is of the form actual'constrained, but since this | |
3116 | -- attribute is only available for unconstrained records, TRUE is | |
3117 | -- expanded if the type of the formal happens to be constrained (for | |
3118 | -- instance when this procedure is inherited from an unconstrained | |
3119 | -- record to a constrained one) or if the actual has no discriminant | |
3120 | -- (its type is constrained). An exception to this is the case of a | |
3121 | -- private type without discriminants. In this case we pass FALSE | |
3122 | -- because the object has underlying discriminants with defaults. | |
ee6ba406 | 3123 | |
3124 | if Present (Extra_Constrained (Formal)) then | |
3125 | if Ekind (Etype (Prev)) in Private_Kind | |
3126 | and then not Has_Discriminants (Base_Type (Etype (Prev))) | |
3127 | then | |
4094dca5 | 3128 | Add_Extra_Actual |
4cb8adff | 3129 | (Expr => New_Occurrence_Of (Standard_False, Loc), |
3130 | EF => Extra_Constrained (Formal)); | |
ee6ba406 | 3131 | |
3132 | elsif Is_Constrained (Etype (Formal)) | |
3133 | or else not Has_Discriminants (Etype (Prev)) | |
3134 | then | |
4094dca5 | 3135 | Add_Extra_Actual |
4cb8adff | 3136 | (Expr => New_Occurrence_Of (Standard_True, Loc), |
3137 | EF => Extra_Constrained (Formal)); | |
ee6ba406 | 3138 | |
00f91aef | 3139 | -- Do not produce extra actuals for Unchecked_Union parameters. |
3140 | -- Jump directly to the end of the loop. | |
3141 | ||
3142 | elsif Is_Unchecked_Union (Base_Type (Etype (Actual))) then | |
3143 | goto Skip_Extra_Actual_Generation; | |
3144 | ||
ee6ba406 | 3145 | else |
3146 | -- If the actual is a type conversion, then the constrained | |
3147 | -- test applies to the actual, not the target type. | |
3148 | ||
3149 | declare | |
948ef2b8 | 3150 | Act_Prev : Node_Id; |
ee6ba406 | 3151 | |
3152 | begin | |
948ef2b8 | 3153 | -- Test for unchecked conversions as well, which can occur |
3154 | -- as out parameter actuals on calls to stream procedures. | |
ee6ba406 | 3155 | |
948ef2b8 | 3156 | Act_Prev := Prev; |
d34432fa | 3157 | while Nkind_In (Act_Prev, N_Type_Conversion, |
3158 | N_Unchecked_Type_Conversion) | |
9dfe12ae | 3159 | loop |
ee6ba406 | 3160 | Act_Prev := Expression (Act_Prev); |
9dfe12ae | 3161 | end loop; |
ee6ba406 | 3162 | |
448545d4 | 3163 | -- If the expression is a conversion of a dereference, this |
3164 | -- is internally generated code that manipulates addresses, | |
3165 | -- e.g. when building interface tables. No check should | |
3166 | -- occur in this case, and the discriminated object is not | |
3167 | -- directly a hand. | |
76a1c25b | 3168 | |
3169 | if not Comes_From_Source (Actual) | |
3170 | and then Nkind (Actual) = N_Unchecked_Type_Conversion | |
3171 | and then Nkind (Act_Prev) = N_Explicit_Dereference | |
3172 | then | |
3173 | Add_Extra_Actual | |
4cb8adff | 3174 | (Expr => New_Occurrence_Of (Standard_False, Loc), |
3175 | EF => Extra_Constrained (Formal)); | |
76a1c25b | 3176 | |
3177 | else | |
3178 | Add_Extra_Actual | |
4cb8adff | 3179 | (Expr => |
3180 | Make_Attribute_Reference (Sloc (Prev), | |
3181 | Prefix => | |
3182 | Duplicate_Subexpr_No_Checks | |
3183 | (Act_Prev, Name_Req => True), | |
3184 | Attribute_Name => Name_Constrained), | |
3185 | EF => Extra_Constrained (Formal)); | |
76a1c25b | 3186 | end if; |
ee6ba406 | 3187 | end; |
3188 | end if; | |
3189 | end if; | |
3190 | ||
3191 | -- Create possible extra actual for accessibility level | |
3192 | ||
3193 | if Present (Extra_Accessibility (Formal)) then | |
4907451e | 3194 | |
3195 | -- Ada 2005 (AI-252): If the actual was rewritten as an Access | |
3196 | -- attribute, then the original actual may be an aliased object | |
3197 | -- occurring as the prefix in a call using "Object.Operation" | |
3198 | -- notation. In that case we must pass the level of the object, | |
3199 | -- so Prev_Orig is reset to Prev and the attribute will be | |
3200 | -- processed by the code for Access attributes further below. | |
3201 | ||
3202 | if Prev_Orig /= Prev | |
3203 | and then Nkind (Prev) = N_Attribute_Reference | |
b11290d7 | 3204 | and then Get_Attribute_Id (Attribute_Name (Prev)) = |
3205 | Attribute_Access | |
4907451e | 3206 | and then Is_Aliased_View (Prev_Orig) |
3207 | then | |
3208 | Prev_Orig := Prev; | |
61b6f3d9 | 3209 | |
0d6c8847 | 3210 | -- A class-wide precondition generates a test in which formals of |
3211 | -- the subprogram are replaced by actuals that came from source. | |
3212 | -- In that case as well, the accessiblity comes from the actual. | |
3213 | -- This is the one case in which there are references to formals | |
3214 | -- outside of their subprogram. | |
3215 | ||
3216 | elsif Prev_Orig /= Prev | |
3217 | and then Is_Entity_Name (Prev_Orig) | |
3218 | and then Present (Entity (Prev_Orig)) | |
3219 | and then Is_Formal (Entity (Prev_Orig)) | |
3220 | and then not In_Open_Scopes (Scope (Entity (Prev_Orig))) | |
3221 | then | |
3222 | Prev_Orig := Prev; | |
3223 | ||
61b6f3d9 | 3224 | -- If the actual is a formal of an enclosing subprogram it is |
3225 | -- the right entity, even if it is a rewriting. This happens | |
3226 | -- when the call is within an inherited condition or predicate. | |
3227 | ||
3228 | elsif Is_Entity_Name (Actual) | |
3229 | and then Is_Formal (Entity (Actual)) | |
3230 | and then In_Open_Scopes (Scope (Entity (Actual))) | |
3231 | then | |
3232 | Prev_Orig := Prev; | |
ad75f6a5 | 3233 | |
3234 | elsif Nkind (Prev_Orig) = N_Type_Conversion then | |
3235 | Prev_Orig := Expression (Prev_Orig); | |
4907451e | 3236 | end if; |
3237 | ||
52307e9c | 3238 | -- Ada 2005 (AI-251): Thunks must propagate the extra actuals of |
3239 | -- accessibility levels. | |
fdd18a7c | 3240 | |
b1961352 | 3241 | if Is_Thunk (Current_Scope) then |
fdd18a7c | 3242 | declare |
3243 | Parm_Ent : Entity_Id; | |
3244 | ||
3245 | begin | |
3246 | if Is_Controlling_Actual (Actual) then | |
3247 | ||
3248 | -- Find the corresponding actual of the thunk | |
3249 | ||
3250 | Parm_Ent := First_Entity (Current_Scope); | |
3251 | for J in 2 .. Param_Count loop | |
3252 | Next_Entity (Parm_Ent); | |
3253 | end loop; | |
3254 | ||
984d005d | 3255 | -- Handle unchecked conversion of access types generated |
b98fca2b | 3256 | -- in thunks (cf. Expand_Interface_Thunk). |
984d005d | 3257 | |
3258 | elsif Is_Access_Type (Etype (Actual)) | |
3259 | and then Nkind (Actual) = N_Unchecked_Type_Conversion | |
3260 | then | |
3261 | Parm_Ent := Entity (Expression (Actual)); | |
3262 | ||
fdd18a7c | 3263 | else pragma Assert (Is_Entity_Name (Actual)); |
3264 | Parm_Ent := Entity (Actual); | |
3265 | end if; | |
3266 | ||
3267 | Add_Extra_Actual | |
4cb8adff | 3268 | (Expr => |
3269 | New_Occurrence_Of (Extra_Accessibility (Parm_Ent), Loc), | |
3270 | EF => Extra_Accessibility (Formal)); | |
fdd18a7c | 3271 | end; |
3272 | ||
3273 | elsif Is_Entity_Name (Prev_Orig) then | |
ee6ba406 | 3274 | |
a3e461ac | 3275 | -- When passing an access parameter, or a renaming of an access |
3276 | -- parameter, as the actual to another access parameter we need | |
3277 | -- to pass along the actual's own access level parameter. This | |
3278 | -- is done if we are within the scope of the formal access | |
3279 | -- parameter (if this is an inlined body the extra formal is | |
3280 | -- irrelevant). | |
3281 | ||
3282 | if (Is_Formal (Entity (Prev_Orig)) | |
3283 | or else | |
3284 | (Present (Renamed_Object (Entity (Prev_Orig))) | |
3285 | and then | |
3286 | Is_Entity_Name (Renamed_Object (Entity (Prev_Orig))) | |
3287 | and then | |
3288 | Is_Formal | |
3289 | (Entity (Renamed_Object (Entity (Prev_Orig)))))) | |
ee6ba406 | 3290 | and then Ekind (Etype (Prev_Orig)) = E_Anonymous_Access_Type |
3291 | and then In_Open_Scopes (Scope (Entity (Prev_Orig))) | |
3292 | then | |
3293 | declare | |
3294 | Parm_Ent : constant Entity_Id := Param_Entity (Prev_Orig); | |
3295 | ||
3296 | begin | |
3297 | pragma Assert (Present (Parm_Ent)); | |
3298 | ||
3299 | if Present (Extra_Accessibility (Parm_Ent)) then | |
76a1c25b | 3300 | Add_Extra_Actual |
4cb8adff | 3301 | (Expr => |
3302 | New_Occurrence_Of | |
3303 | (Extra_Accessibility (Parm_Ent), Loc), | |
3304 | EF => Extra_Accessibility (Formal)); | |
ee6ba406 | 3305 | |
3306 | -- If the actual access parameter does not have an | |
3307 | -- associated extra formal providing its scope level, | |
3308 | -- then treat the actual as having library-level | |
3309 | -- accessibility. | |
3310 | ||
3311 | else | |
76a1c25b | 3312 | Add_Extra_Actual |
4cb8adff | 3313 | (Expr => |
3314 | Make_Integer_Literal (Loc, | |
3315 | Intval => Scope_Depth (Standard_Standard)), | |
3316 | EF => Extra_Accessibility (Formal)); | |
ee6ba406 | 3317 | end if; |
3318 | end; | |
3319 | ||
4907451e | 3320 | -- The actual is a normal access value, so just pass the level |
3321 | -- of the actual's access type. | |
ee6ba406 | 3322 | |
3323 | else | |
76a1c25b | 3324 | Add_Extra_Actual |
4cb8adff | 3325 | (Expr => Dynamic_Accessibility_Level (Prev_Orig), |
3326 | EF => Extra_Accessibility (Formal)); | |
ee6ba406 | 3327 | end if; |
3328 | ||
4094dca5 | 3329 | -- If the actual is an access discriminant, then pass the level |
3330 | -- of the enclosing object (RM05-3.10.2(12.4/2)). | |
3331 | ||
3332 | elsif Nkind (Prev_Orig) = N_Selected_Component | |
3333 | and then Ekind (Entity (Selector_Name (Prev_Orig))) = | |
3334 | E_Discriminant | |
3335 | and then Ekind (Etype (Entity (Selector_Name (Prev_Orig)))) = | |
3336 | E_Anonymous_Access_Type | |
3337 | then | |
3338 | Add_Extra_Actual | |
4cb8adff | 3339 | (Expr => |
3340 | Make_Integer_Literal (Loc, | |
3341 | Intval => Object_Access_Level (Prefix (Prev_Orig))), | |
3342 | EF => Extra_Accessibility (Formal)); | |
4094dca5 | 3343 | |
3344 | -- All other cases | |
fdd18a7c | 3345 | |
ee6ba406 | 3346 | else |
3347 | case Nkind (Prev_Orig) is | |
ee6ba406 | 3348 | when N_Attribute_Reference => |
ee6ba406 | 3349 | case Get_Attribute_Id (Attribute_Name (Prev_Orig)) is |
3350 | ||
0429d533 | 3351 | -- For X'Access, pass on the level of the prefix X |
ee6ba406 | 3352 | |
3353 | when Attribute_Access => | |
1a9cc6cd | 3354 | |
4cb8adff | 3355 | -- Accessibility level of S'Access is that of A |
ad75f6a5 | 3356 | |
3357 | Prev_Orig := Prefix (Prev_Orig); | |
3358 | ||
4cb8adff | 3359 | -- If the expression is a view conversion, the |
3360 | -- accessibility level is that of the expression. | |
ad75f6a5 | 3361 | |
4cb8adff | 3362 | if Nkind (Original_Node (Prev_Orig)) = |
3363 | N_Type_Conversion | |
ad75f6a5 | 3364 | and then |
4cb8adff | 3365 | Nkind (Expression (Original_Node (Prev_Orig))) = |
3366 | N_Explicit_Dereference | |
ad75f6a5 | 3367 | then |
3368 | Prev_Orig := | |
3369 | Expression (Original_Node (Prev_Orig)); | |
3370 | end if; | |
3371 | ||
d071cd96 | 3372 | -- If this is an Access attribute applied to the |
3373 | -- the current instance object passed to a type | |
3374 | -- initialization procedure, then use the level | |
3375 | -- of the type itself. This is not really correct, | |
3376 | -- as there should be an extra level parameter | |
3377 | -- passed in with _init formals (only in the case | |
3378 | -- where the type is immutably limited), but we | |
3379 | -- don't have an easy way currently to create such | |
3380 | -- an extra formal (init procs aren't ever frozen). | |
3381 | -- For now we just use the level of the type, | |
3382 | -- which may be too shallow, but that works better | |
3383 | -- than passing Object_Access_Level of the type, | |
3384 | -- which can be one level too deep in some cases. | |
3385 | -- ??? | |
3386 | ||
ad75f6a5 | 3387 | -- A further case that requires special handling |
06d78d4c | 3388 | -- is the common idiom E.all'access. If E is a |
ad75f6a5 | 3389 | -- formal of the enclosing subprogram, the |
3390 | -- accessibility of the expression is that of E. | |
3391 | ||
3392 | if Is_Entity_Name (Prev_Orig) then | |
3393 | Pref_Entity := Entity (Prev_Orig); | |
3394 | ||
3395 | elsif Nkind (Prev_Orig) = N_Explicit_Dereference | |
4cb8adff | 3396 | and then Is_Entity_Name (Prefix (Prev_Orig)) |
ad75f6a5 | 3397 | then |
3398 | Pref_Entity := Entity (Prefix ((Prev_Orig))); | |
3399 | ||
3400 | else | |
3401 | Pref_Entity := Empty; | |
3402 | end if; | |
3403 | ||
3404 | if Is_Entity_Name (Prev_Orig) | |
3405 | and then Is_Type (Entity (Prev_Orig)) | |
d071cd96 | 3406 | then |
3407 | Add_Extra_Actual | |
4cb8adff | 3408 | (Expr => |
3409 | Make_Integer_Literal (Loc, | |
3410 | Intval => | |
3411 | Type_Access_Level (Pref_Entity)), | |
3412 | EF => Extra_Accessibility (Formal)); | |
ad75f6a5 | 3413 | |
3414 | elsif Nkind (Prev_Orig) = N_Explicit_Dereference | |
3415 | and then Present (Pref_Entity) | |
3416 | and then Is_Formal (Pref_Entity) | |
3417 | and then Present | |
4cb8adff | 3418 | (Extra_Accessibility (Pref_Entity)) |
ad75f6a5 | 3419 | then |
4cb8adff | 3420 | Add_Extra_Actual |
3421 | (Expr => | |
3422 | New_Occurrence_Of | |
3423 | (Extra_Accessibility (Pref_Entity), Loc), | |
3424 | EF => Extra_Accessibility (Formal)); | |
d071cd96 | 3425 | |
3426 | else | |
3427 | Add_Extra_Actual | |
4cb8adff | 3428 | (Expr => |
3429 | Make_Integer_Literal (Loc, | |
3430 | Intval => | |
3431 | Object_Access_Level (Prev_Orig)), | |
3432 | EF => Extra_Accessibility (Formal)); | |
d071cd96 | 3433 | end if; |
ee6ba406 | 3434 | |
3435 | -- Treat the unchecked attributes as library-level | |
3436 | ||
99378362 | 3437 | when Attribute_Unchecked_Access |
3438 | | Attribute_Unrestricted_Access | |
3439 | => | |
4094dca5 | 3440 | Add_Extra_Actual |
4cb8adff | 3441 | (Expr => |
3442 | Make_Integer_Literal (Loc, | |
3443 | Intval => Scope_Depth (Standard_Standard)), | |
3444 | EF => Extra_Accessibility (Formal)); | |
ee6ba406 | 3445 | |
3446 | -- No other cases of attributes returning access | |
52307e9c | 3447 | -- values that can be passed to access parameters. |
ee6ba406 | 3448 | |
3449 | when others => | |
3450 | raise Program_Error; | |
3451 | ||
3452 | end case; | |
3453 | ||
b68acde5 | 3454 | -- For allocators we pass the level of the execution of the |
3455 | -- called subprogram, which is one greater than the current | |
0e6f6ee1 | 3456 | -- scope level. However, according to RM 3.10.2(14/3) this |
3457 | -- is wrong since for an anonymous allocator defining the | |
3458 | -- value of an access parameter, the accessibility level is | |
3459 | -- that of the innermost master of the call??? | |
ee6ba406 | 3460 | |
3461 | when N_Allocator => | |
4094dca5 | 3462 | Add_Extra_Actual |
4cb8adff | 3463 | (Expr => |
3464 | Make_Integer_Literal (Loc, | |
3465 | Intval => Scope_Depth (Current_Scope) + 1), | |
3466 | EF => Extra_Accessibility (Formal)); | |
ee6ba406 | 3467 | |
47d210a3 | 3468 | -- For most other cases we simply pass the level of the |
3469 | -- actual's access type. The type is retrieved from | |
3470 | -- Prev rather than Prev_Orig, because in some cases | |
3471 | -- Prev_Orig denotes an original expression that has | |
3472 | -- not been analyzed. | |
ee6ba406 | 3473 | |
3474 | when others => | |
4094dca5 | 3475 | Add_Extra_Actual |
4cb8adff | 3476 | (Expr => Dynamic_Accessibility_Level (Prev), |
3477 | EF => Extra_Accessibility (Formal)); | |
ee6ba406 | 3478 | end case; |
3479 | end if; | |
3480 | end if; | |
3481 | ||
948ef2b8 | 3482 | -- Perform the check of 4.6(49) that prevents a null value from being |
a0fc8c5b | 3483 | -- passed as an actual to an access parameter. Note that the check |
3484 | -- is elided in the common cases of passing an access attribute or | |
948ef2b8 | 3485 | -- access parameter as an actual. Also, we currently don't enforce |
3486 | -- this check for expander-generated actuals and when -gnatdj is set. | |
ee6ba406 | 3487 | |
de54c5ab | 3488 | if Ada_Version >= Ada_2005 then |
ee6ba406 | 3489 | |
a0fc8c5b | 3490 | -- Ada 2005 (AI-231): Check null-excluding access types. Note that |
3491 | -- the intent of 6.4.1(13) is that null-exclusion checks should | |
3492 | -- not be done for 'out' parameters, even though it refers only | |
6fb3c314 | 3493 | -- to constraint checks, and a null_exclusion is not a constraint. |
a0fc8c5b | 3494 | -- Note that AI05-0196-1 corrects this mistake in the RM. |
ee6ba406 | 3495 | |
948ef2b8 | 3496 | if Is_Access_Type (Etype (Formal)) |
3497 | and then Can_Never_Be_Null (Etype (Formal)) | |
a0fc8c5b | 3498 | and then Ekind (Formal) /= E_Out_Parameter |
948ef2b8 | 3499 | and then Nkind (Prev) /= N_Raise_Constraint_Error |
a3e461ac | 3500 | and then (Known_Null (Prev) |
1a9cc6cd | 3501 | or else not Can_Never_Be_Null (Etype (Prev))) |
948ef2b8 | 3502 | then |
3503 | Install_Null_Excluding_Check (Prev); | |
3504 | end if; | |
ee6ba406 | 3505 | |
de54c5ab | 3506 | -- Ada_Version < Ada_2005 |
ee6ba406 | 3507 | |
948ef2b8 | 3508 | else |
3509 | if Ekind (Etype (Formal)) /= E_Anonymous_Access_Type | |
3510 | or else Access_Checks_Suppressed (Subp) | |
3511 | then | |
3512 | null; | |
ee6ba406 | 3513 | |
948ef2b8 | 3514 | elsif Debug_Flag_J then |
3515 | null; | |
ee6ba406 | 3516 | |
948ef2b8 | 3517 | elsif not Comes_From_Source (Prev) then |
3518 | null; | |
ee6ba406 | 3519 | |
948ef2b8 | 3520 | elsif Is_Entity_Name (Prev) |
3521 | and then Ekind (Etype (Prev)) = E_Anonymous_Access_Type | |
3522 | then | |
3523 | null; | |
fa7497e8 | 3524 | |
d34432fa | 3525 | elsif Nkind_In (Prev, N_Allocator, N_Attribute_Reference) then |
948ef2b8 | 3526 | null; |
3527 | ||
948ef2b8 | 3528 | else |
3529 | Install_Null_Excluding_Check (Prev); | |
3530 | end if; | |
ee6ba406 | 3531 | end if; |
3532 | ||
9dfe12ae | 3533 | -- Perform appropriate validity checks on parameters that |
3534 | -- are entities. | |
ee6ba406 | 3535 | |
3536 | if Validity_Checks_On then | |
284faf8b | 3537 | if (Ekind (Formal) = E_In_Parameter |
1a9cc6cd | 3538 | and then Validity_Check_In_Params) |
284faf8b | 3539 | or else |
3540 | (Ekind (Formal) = E_In_Out_Parameter | |
1a9cc6cd | 3541 | and then Validity_Check_In_Out_Params) |
ee6ba406 | 3542 | then |
4907451e | 3543 | -- If the actual is an indexed component of a packed type (or |
3544 | -- is an indexed or selected component whose prefix recursively | |
3545 | -- meets this condition), it has not been expanded yet. It will | |
3546 | -- be copied in the validity code that follows, and has to be | |
3547 | -- expanded appropriately, so reanalyze it. | |
9988dae3 | 3548 | |
4907451e | 3549 | -- What we do is just to unset analyzed bits on prefixes till |
3550 | -- we reach something that does not have a prefix. | |
3551 | ||
3552 | declare | |
3553 | Nod : Node_Id; | |
3554 | ||
3555 | begin | |
3556 | Nod := Actual; | |
d34432fa | 3557 | while Nkind_In (Nod, N_Indexed_Component, |
3558 | N_Selected_Component) | |
4907451e | 3559 | loop |
3560 | Set_Analyzed (Nod, False); | |
3561 | Nod := Prefix (Nod); | |
3562 | end loop; | |
3563 | end; | |
9988dae3 | 3564 | |
ee6ba406 | 3565 | Ensure_Valid (Actual); |
ee6ba406 | 3566 | end if; |
3567 | end if; | |
3568 | ||
3569 | -- For IN OUT and OUT parameters, ensure that subscripts are valid | |
3570 | -- since this is a left side reference. We only do this for calls | |
3571 | -- from the source program since we assume that compiler generated | |
3572 | -- calls explicitly generate any required checks. We also need it | |
a0fc8c5b | 3573 | -- only if we are doing standard validity checks, since clearly it is |
3574 | -- not needed if validity checks are off, and in subscript validity | |
3575 | -- checking mode, all indexed components are checked with a call | |
3576 | -- directly from Expand_N_Indexed_Component. | |
ee6ba406 | 3577 | |
c7f8b065 | 3578 | if Comes_From_Source (Call_Node) |
ee6ba406 | 3579 | and then Ekind (Formal) /= E_In_Parameter |
3580 | and then Validity_Checks_On | |
3581 | and then Validity_Check_Default | |
3582 | and then not Validity_Check_Subscripts | |
3583 | then | |
3584 | Check_Valid_Lvalue_Subscripts (Actual); | |
3585 | end if; | |
3586 | ||
33b6091b | 3587 | -- Mark any scalar OUT parameter that is a simple variable as no |
3588 | -- longer known to be valid (unless the type is always valid). This | |
3589 | -- reflects the fact that if an OUT parameter is never set in a | |
3590 | -- procedure, then it can become invalid on the procedure return. | |
9dfe12ae | 3591 | |
3592 | if Ekind (Formal) = E_Out_Parameter | |
3593 | and then Is_Entity_Name (Actual) | |
3594 | and then Ekind (Entity (Actual)) = E_Variable | |
3595 | and then not Is_Known_Valid (Etype (Actual)) | |
3596 | then | |
3597 | Set_Is_Known_Valid (Entity (Actual), False); | |
3598 | end if; | |
3599 | ||
33b6091b | 3600 | -- For an OUT or IN OUT parameter, if the actual is an entity, then |
3601 | -- clear current values, since they can be clobbered. We are probably | |
3602 | -- doing this in more places than we need to, but better safe than | |
39a0c1d3 | 3603 | -- sorry when it comes to retaining bad current values. |
9dfe12ae | 3604 | |
3605 | if Ekind (Formal) /= E_In_Parameter | |
3606 | and then Is_Entity_Name (Actual) | |
96da3284 | 3607 | and then Present (Entity (Actual)) |
9dfe12ae | 3608 | then |
96da3284 | 3609 | declare |
3610 | Ent : constant Entity_Id := Entity (Actual); | |
3611 | Sav : Node_Id; | |
3612 | ||
3613 | begin | |
d34432fa | 3614 | -- For an OUT or IN OUT parameter that is an assignable entity, |
3615 | -- we do not want to clobber the Last_Assignment field, since | |
3616 | -- if it is set, it was precisely because it is indeed an OUT | |
39a0c1d3 | 3617 | -- or IN OUT parameter. We do reset the Is_Known_Valid flag |
ed195555 | 3618 | -- since the subprogram could have returned in invalid value. |
d34432fa | 3619 | |
e54cffd1 | 3620 | if Is_Assignable (Ent) then |
96da3284 | 3621 | Sav := Last_Assignment (Ent); |
3622 | Kill_Current_Values (Ent); | |
3623 | Set_Last_Assignment (Ent, Sav); | |
ed195555 | 3624 | Set_Is_Known_Valid (Ent, False); |
a367d7bc | 3625 | Set_Is_True_Constant (Ent, False); |
96da3284 | 3626 | |
57c2f209 | 3627 | -- For all other cases, just kill the current values |
96da3284 | 3628 | |
3629 | else | |
3630 | Kill_Current_Values (Ent); | |
3631 | end if; | |
3632 | end; | |
9dfe12ae | 3633 | end if; |
3634 | ||
ee6ba406 | 3635 | -- If the formal is class wide and the actual is an aggregate, force |
3636 | -- evaluation so that the back end who does not know about class-wide | |
3637 | -- type, does not generate a temporary of the wrong size. | |
3638 | ||
3639 | if not Is_Class_Wide_Type (Etype (Formal)) then | |
3640 | null; | |
3641 | ||
3642 | elsif Nkind (Actual) = N_Aggregate | |
3643 | or else (Nkind (Actual) = N_Qualified_Expression | |
3644 | and then Nkind (Expression (Actual)) = N_Aggregate) | |
3645 | then | |
3646 | Force_Evaluation (Actual); | |
3647 | end if; | |
3648 | ||
3649 | -- In a remote call, if the formal is of a class-wide type, check | |
3650 | -- that the actual meets the requirements described in E.4(18). | |
3651 | ||
4907451e | 3652 | if Remote and then Is_Class_Wide_Type (Etype (Formal)) then |
ee6ba406 | 3653 | Insert_Action (Actual, |
4907451e | 3654 | Make_Transportable_Check (Loc, |
3655 | Duplicate_Subexpr_Move_Checks (Actual))); | |
ee6ba406 | 3656 | end if; |
3657 | ||
f10fcdcc | 3658 | -- Perform invariant checks for all intermediate types in a view |
3659 | -- conversion after successful return from a call that passes the | |
3660 | -- view conversion as an IN OUT or OUT parameter (RM 7.3.2 (12/3, | |
3661 | -- 13/3, 14/3)). Consider only source conversion in order to avoid | |
3662 | -- generating spurious checks on complex expansion such as object | |
3663 | -- initialization through an extension aggregate. | |
718edc45 | 3664 | |
f10fcdcc | 3665 | if Comes_From_Source (N) |
3666 | and then Ekind (Formal) /= E_In_Parameter | |
718edc45 | 3667 | and then Nkind (Actual) = N_Type_Conversion |
3668 | then | |
f10fcdcc | 3669 | Add_View_Conversion_Invariants (Formal, Actual); |
718edc45 | 3670 | end if; |
3671 | ||
c2fc26e5 | 3672 | -- Generating C the initialization of an allocator is performed by |
3673 | -- means of individual statements, and hence it must be done before | |
3674 | -- the call. | |
3675 | ||
3676 | if Modify_Tree_For_C | |
3677 | and then Nkind (Actual) = N_Allocator | |
3678 | and then Nkind (Expression (Actual)) = N_Qualified_Expression | |
3679 | then | |
3680 | Remove_Side_Effects (Actual); | |
3681 | end if; | |
3682 | ||
00f91aef | 3683 | -- This label is required when skipping extra actual generation for |
3684 | -- Unchecked_Union parameters. | |
3685 | ||
3686 | <<Skip_Extra_Actual_Generation>> | |
3687 | ||
fdd18a7c | 3688 | Param_Count := Param_Count + 1; |
ee6ba406 | 3689 | Next_Actual (Actual); |
3690 | Next_Formal (Formal); | |
3691 | end loop; | |
3692 | ||
e6a29bf1 | 3693 | -- If we are calling an Ada 2012 function which needs to have the |
302f6546 | 3694 | -- "accessibility level determined by the point of call" (AI05-0234) |
3695 | -- passed in to it, then pass it in. | |
3696 | ||
df8fb77e | 3697 | if Ekind_In (Subp, E_Function, E_Operator, E_Subprogram_Type) |
0c6b5982 | 3698 | and then |
3699 | Present (Extra_Accessibility_Of_Result (Ultimate_Alias (Subp))) | |
302f6546 | 3700 | then |
3701 | declare | |
3702 | Ancestor : Node_Id := Parent (Call_Node); | |
3703 | Level : Node_Id := Empty; | |
3704 | Defer : Boolean := False; | |
3705 | ||
3706 | begin | |
3707 | -- Unimplemented: if Subp returns an anonymous access type, then | |
0c6b5982 | 3708 | |
302f6546 | 3709 | -- a) if the call is the operand of an explict conversion, then |
3710 | -- the target type of the conversion (a named access type) | |
3711 | -- determines the accessibility level pass in; | |
0c6b5982 | 3712 | |
302f6546 | 3713 | -- b) if the call defines an access discriminant of an object |
3714 | -- (e.g., the discriminant of an object being created by an | |
3715 | -- allocator, or the discriminant of a function result), | |
3716 | -- then the accessibility level to pass in is that of the | |
3717 | -- discriminated object being initialized). | |
3718 | ||
0c6b5982 | 3719 | -- ??? |
3720 | ||
302f6546 | 3721 | while Nkind (Ancestor) = N_Qualified_Expression |
3722 | loop | |
3723 | Ancestor := Parent (Ancestor); | |
3724 | end loop; | |
3725 | ||
3726 | case Nkind (Ancestor) is | |
3727 | when N_Allocator => | |
4be04311 | 3728 | |
302f6546 | 3729 | -- At this point, we'd like to assign |
4be04311 | 3730 | |
302f6546 | 3731 | -- Level := Dynamic_Accessibility_Level (Ancestor); |
4be04311 | 3732 | |
302f6546 | 3733 | -- but Etype of Ancestor may not have been set yet, |
3734 | -- so that doesn't work. | |
4be04311 | 3735 | |
302f6546 | 3736 | -- Handle this later in Expand_Allocator_Expression. |
3737 | ||
3738 | Defer := True; | |
3739 | ||
99378362 | 3740 | when N_Object_Declaration |
3741 | | N_Object_Renaming_Declaration | |
3742 | => | |
302f6546 | 3743 | declare |
3744 | Def_Id : constant Entity_Id := | |
3745 | Defining_Identifier (Ancestor); | |
4be04311 | 3746 | |
302f6546 | 3747 | begin |
3748 | if Is_Return_Object (Def_Id) then | |
3749 | if Present (Extra_Accessibility_Of_Result | |
3750 | (Return_Applies_To (Scope (Def_Id)))) | |
3751 | then | |
3752 | -- Pass along value that was passed in if the | |
3753 | -- routine we are returning from also has an | |
3754 | -- Accessibility_Of_Result formal. | |
3755 | ||
3756 | Level := | |
3757 | New_Occurrence_Of | |
3758 | (Extra_Accessibility_Of_Result | |
4be04311 | 3759 | (Return_Applies_To (Scope (Def_Id))), Loc); |
302f6546 | 3760 | end if; |
3761 | else | |
4be04311 | 3762 | Level := |
3763 | Make_Integer_Literal (Loc, | |
3764 | Intval => Object_Access_Level (Def_Id)); | |
302f6546 | 3765 | end if; |
3766 | end; | |
3767 | ||
3768 | when N_Simple_Return_Statement => | |
3769 | if Present (Extra_Accessibility_Of_Result | |
4be04311 | 3770 | (Return_Applies_To |
3771 | (Return_Statement_Entity (Ancestor)))) | |
302f6546 | 3772 | then |
7098bc8c | 3773 | -- Pass along value that was passed in if the returned |
3774 | -- routine also has an Accessibility_Of_Result formal. | |
302f6546 | 3775 | |
3776 | Level := | |
3777 | New_Occurrence_Of | |
3778 | (Extra_Accessibility_Of_Result | |
99378362 | 3779 | (Return_Applies_To |
3780 | (Return_Statement_Entity (Ancestor))), Loc); | |
302f6546 | 3781 | end if; |
3782 | ||
3783 | when others => | |
3784 | null; | |
3785 | end case; | |
3786 | ||
3787 | if not Defer then | |
3788 | if not Present (Level) then | |
4be04311 | 3789 | |
302f6546 | 3790 | -- The "innermost master that evaluates the function call". |
4be04311 | 3791 | |
5ffd087f | 3792 | -- ??? - Should we use Integer'Last here instead in order |
3793 | -- to deal with (some of) the problems associated with | |
3794 | -- calls to subps whose enclosing scope is unknown (e.g., | |
3795 | -- Anon_Access_To_Subp_Param.all)? | |
302f6546 | 3796 | |
99378362 | 3797 | Level := |
3798 | Make_Integer_Literal (Loc, | |
3799 | Intval => Scope_Depth (Current_Scope) + 1); | |
302f6546 | 3800 | end if; |
3801 | ||
0c6b5982 | 3802 | Add_Extra_Actual |
4cb8adff | 3803 | (Expr => Level, |
3804 | EF => | |
3805 | Extra_Accessibility_Of_Result (Ultimate_Alias (Subp))); | |
302f6546 | 3806 | end if; |
3807 | end; | |
3808 | end if; | |
3809 | ||
57c2f209 | 3810 | -- If we are expanding the RHS of an assignment we need to check if tag |
33b6091b | 3811 | -- propagation is needed. You might expect this processing to be in |
3812 | -- Analyze_Assignment but has to be done earlier (bottom-up) because the | |
3813 | -- assignment might be transformed to a declaration for an unconstrained | |
3814 | -- value if the expression is classwide. | |
ee6ba406 | 3815 | |
c7f8b065 | 3816 | if Nkind (Call_Node) = N_Function_Call |
3817 | and then Is_Tag_Indeterminate (Call_Node) | |
3818 | and then Is_Entity_Name (Name (Call_Node)) | |
ee6ba406 | 3819 | then |
3820 | declare | |
3821 | Ass : Node_Id := Empty; | |
3822 | ||
3823 | begin | |
c7f8b065 | 3824 | if Nkind (Parent (Call_Node)) = N_Assignment_Statement then |
3825 | Ass := Parent (Call_Node); | |
ee6ba406 | 3826 | |
c7f8b065 | 3827 | elsif Nkind (Parent (Call_Node)) = N_Qualified_Expression |
752dfce0 | 3828 | and then Nkind (Parent (Parent (Call_Node))) = |
3829 | N_Assignment_Statement | |
ee6ba406 | 3830 | then |
c7f8b065 | 3831 | Ass := Parent (Parent (Call_Node)); |
578f27c9 | 3832 | |
c7f8b065 | 3833 | elsif Nkind (Parent (Call_Node)) = N_Explicit_Dereference |
752dfce0 | 3834 | and then Nkind (Parent (Parent (Call_Node))) = |
3835 | N_Assignment_Statement | |
578f27c9 | 3836 | then |
c7f8b065 | 3837 | Ass := Parent (Parent (Call_Node)); |
ee6ba406 | 3838 | end if; |
3839 | ||
3840 | if Present (Ass) | |
3841 | and then Is_Class_Wide_Type (Etype (Name (Ass))) | |
3842 | then | |
c7f8b065 | 3843 | if Is_Access_Type (Etype (Call_Node)) then |
3844 | if Designated_Type (Etype (Call_Node)) /= | |
578f27c9 | 3845 | Root_Type (Etype (Name (Ass))) |
3846 | then | |
3847 | Error_Msg_NE | |
a740d7fa | 3848 | ("tag-indeterminate expression must have designated " |
3849 | & "type& (RM 5.2 (6))", | |
752dfce0 | 3850 | Call_Node, Root_Type (Etype (Name (Ass)))); |
578f27c9 | 3851 | else |
c7f8b065 | 3852 | Propagate_Tag (Name (Ass), Call_Node); |
578f27c9 | 3853 | end if; |
3854 | ||
c7f8b065 | 3855 | elsif Etype (Call_Node) /= Root_Type (Etype (Name (Ass))) then |
9dfe12ae | 3856 | Error_Msg_NE |
a740d7fa | 3857 | ("tag-indeterminate expression must have type & " |
3858 | & "(RM 5.2 (6))", | |
c7f8b065 | 3859 | Call_Node, Root_Type (Etype (Name (Ass)))); |
578f27c9 | 3860 | |
9dfe12ae | 3861 | else |
c7f8b065 | 3862 | Propagate_Tag (Name (Ass), Call_Node); |
9dfe12ae | 3863 | end if; |
3864 | ||
3865 | -- The call will be rewritten as a dispatching call, and | |
3866 | -- expanded as such. | |
3867 | ||
ee6ba406 | 3868 | return; |
3869 | end if; | |
3870 | end; | |
3871 | end if; | |
3872 | ||
aad6babd | 3873 | -- Ada 2005 (AI-251): If some formal is a class-wide interface, expand |
3874 | -- it to point to the correct secondary virtual table | |
3875 | ||
37d19a65 | 3876 | if Nkind (Call_Node) in N_Subprogram_Call |
aad6babd | 3877 | and then CW_Interface_Formals_Present |
3878 | then | |
c7f8b065 | 3879 | Expand_Interface_Actuals (Call_Node); |
aad6babd | 3880 | end if; |
3881 | ||
ee6ba406 | 3882 | -- Deals with Dispatch_Call if we still have a call, before expanding |
3883 | -- extra actuals since this will be done on the re-analysis of the | |
a0fc8c5b | 3884 | -- dispatching call. Note that we do not try to shorten the actual list |
3885 | -- for a dispatching call, it would not make sense to do so. Expansion | |
36ac5fbb | 3886 | -- of dispatching calls is suppressed for VM targets, because the VM |
a0fc8c5b | 3887 | -- back-ends directly handle the generation of dispatching calls and |
3888 | -- would have to undo any expansion to an indirect call. | |
ee6ba406 | 3889 | |
37d19a65 | 3890 | if Nkind (Call_Node) in N_Subprogram_Call |
c7f8b065 | 3891 | and then Present (Controlling_Argument (Call_Node)) |
ee6ba406 | 3892 | then |
c7f8b065 | 3893 | declare |
a828619e | 3894 | Call_Typ : constant Entity_Id := Etype (Call_Node); |
c7f8b065 | 3895 | Typ : constant Entity_Id := Find_Dispatching_Type (Subp); |
3896 | Eq_Prim_Op : Entity_Id := Empty; | |
a828619e | 3897 | New_Call : Node_Id; |
3898 | Param : Node_Id; | |
3899 | Prev_Call : Node_Id; | |
9dfe12ae | 3900 | |
c7f8b065 | 3901 | begin |
3902 | if not Is_Limited_Type (Typ) then | |
3903 | Eq_Prim_Op := Find_Prim_Op (Typ, Name_Op_Eq); | |
3904 | end if; | |
9dfe12ae | 3905 | |
c7f8b065 | 3906 | if Tagged_Type_Expansion then |
3907 | Expand_Dispatching_Call (Call_Node); | |
041aa047 | 3908 | |
c7f8b065 | 3909 | -- The following return is worrisome. Is it really OK to skip |
3910 | -- all remaining processing in this procedure ??? | |
cd534f03 | 3911 | |
c7f8b065 | 3912 | return; |
cd534f03 | 3913 | |
c7f8b065 | 3914 | -- VM targets |
3915 | ||
3916 | else | |
3917 | Apply_Tag_Checks (Call_Node); | |
3918 | ||
a828619e | 3919 | -- If this is a dispatching "=", we must first compare the |
3920 | -- tags so we generate: x.tag = y.tag and then x = y | |
3921 | ||
3922 | if Subp = Eq_Prim_Op then | |
3923 | ||
736b80cc | 3924 | -- Mark the node as analyzed to avoid reanalyzing this |
a828619e | 3925 | -- dispatching call (which would cause a never-ending loop) |
3926 | ||
3927 | Prev_Call := Relocate_Node (Call_Node); | |
3928 | Set_Analyzed (Prev_Call); | |
3929 | ||
3930 | Param := First_Actual (Call_Node); | |
3931 | New_Call := | |
3932 | Make_And_Then (Loc, | |
3933 | Left_Opnd => | |
3934 | Make_Op_Eq (Loc, | |
3935 | Left_Opnd => | |
3936 | Make_Selected_Component (Loc, | |
3937 | Prefix => New_Value (Param), | |
3938 | Selector_Name => | |
83c6c069 | 3939 | New_Occurrence_Of |
3940 | (First_Tag_Component (Typ), Loc)), | |
a828619e | 3941 | |
3942 | Right_Opnd => | |
3943 | Make_Selected_Component (Loc, | |
3944 | Prefix => | |
3945 | Unchecked_Convert_To (Typ, | |
3946 | New_Value (Next_Actual (Param))), | |
3947 | Selector_Name => | |
83c6c069 | 3948 | New_Occurrence_Of |
a828619e | 3949 | (First_Tag_Component (Typ), Loc))), |
3950 | Right_Opnd => Prev_Call); | |
3951 | ||
3952 | Rewrite (Call_Node, New_Call); | |
3953 | ||
3954 | Analyze_And_Resolve | |
3955 | (Call_Node, Call_Typ, Suppress => All_Checks); | |
3956 | end if; | |
3957 | ||
c7f8b065 | 3958 | -- Expansion of a dispatching call results in an indirect call, |
3959 | -- which in turn causes current values to be killed (see | |
3960 | -- Resolve_Call), so on VM targets we do the call here to | |
3961 | -- ensure consistent warnings between VM and non-VM targets. | |
3962 | ||
3963 | Kill_Current_Values; | |
3964 | end if; | |
3965 | ||
3966 | -- If this is a dispatching "=" then we must update the reference | |
3967 | -- to the call node because we generated: | |
3968 | -- x.tag = y.tag and then x = y | |
3969 | ||
a828619e | 3970 | if Subp = Eq_Prim_Op then |
c7f8b065 | 3971 | Call_Node := Right_Opnd (Call_Node); |
3972 | end if; | |
3973 | end; | |
041aa047 | 3974 | end if; |
ee6ba406 | 3975 | |
3976 | -- Similarly, expand calls to RCI subprograms on which pragma | |
3977 | -- All_Calls_Remote applies. The rewriting will be reanalyzed | |
a0fc8c5b | 3978 | -- later. Do this only when the call comes from source since we |
3979 | -- do not want such a rewriting to occur in expanded code. | |
ee6ba406 | 3980 | |
c7f8b065 | 3981 | if Is_All_Remote_Call (Call_Node) then |
3982 | Expand_All_Calls_Remote_Subprogram_Call (Call_Node); | |
ee6ba406 | 3983 | |
3984 | -- Similarly, do not add extra actuals for an entry call whose entity | |
3985 | -- is a protected procedure, or for an internal protected subprogram | |
3986 | -- call, because it will be rewritten as a protected subprogram call | |
3987 | -- and reanalyzed (see Expand_Protected_Subprogram_Call). | |
3988 | ||
3989 | elsif Is_Protected_Type (Scope (Subp)) | |
3990 | and then (Ekind (Subp) = E_Procedure | |
3991 | or else Ekind (Subp) = E_Function) | |
3992 | then | |
3993 | null; | |
3994 | ||
3995 | -- During that loop we gathered the extra actuals (the ones that | |
3996 | -- correspond to Extra_Formals), so now they can be appended. | |
3997 | ||
3998 | else | |
3999 | while Is_Non_Empty_List (Extra_Actuals) loop | |
4000 | Add_Actual_Parameter (Remove_Head (Extra_Actuals)); | |
4001 | end loop; | |
4002 | end if; | |
4003 | ||
a0fc8c5b | 4004 | -- At this point we have all the actuals, so this is the point at which |
4005 | -- the various expansion activities for actuals is carried out. | |
ba40b4af | 4006 | |
f1ce0b4e | 4007 | Expand_Actuals (Call_Node, Subp, Post_Call); |
ee6ba406 | 4008 | |
3b045963 | 4009 | -- Verify that the actuals do not share storage. This check must be done |
4010 | -- on the caller side rather that inside the subprogram to avoid issues | |
4011 | -- of parameter passing. | |
4012 | ||
4013 | if Check_Aliasing_Of_Parameters then | |
4014 | Apply_Parameter_Aliasing_Checks (Call_Node, Subp); | |
4015 | end if; | |
4016 | ||
a0fc8c5b | 4017 | -- If the subprogram is a renaming, or if it is inherited, replace it in |
4018 | -- the call with the name of the actual subprogram being called. If this | |
4019 | -- is a dispatching call, the run-time decides what to call. The Alias | |
4020 | -- attribute does not apply to entries. | |
ee6ba406 | 4021 | |
c7f8b065 | 4022 | if Nkind (Call_Node) /= N_Entry_Call_Statement |
4023 | and then No (Controlling_Argument (Call_Node)) | |
ee6ba406 | 4024 | and then Present (Parent_Subp) |
bb3b440a | 4025 | and then not Is_Direct_Deep_Call (Subp) |
ee6ba406 | 4026 | then |
4027 | if Present (Inherited_From_Formal (Subp)) then | |
4028 | Parent_Subp := Inherited_From_Formal (Subp); | |
4029 | else | |
fc2907f6 | 4030 | Parent_Subp := Ultimate_Alias (Parent_Subp); |
ee6ba406 | 4031 | end if; |
4032 | ||
33b6091b | 4033 | -- The below setting of Entity is suspect, see F109-018 discussion??? |
4034 | ||
c7f8b065 | 4035 | Set_Entity (Name (Call_Node), Parent_Subp); |
ee6ba406 | 4036 | |
21ec6442 | 4037 | if Is_Abstract_Subprogram (Parent_Subp) |
ee6ba406 | 4038 | and then not In_Instance |
4039 | then | |
4040 | Error_Msg_NE | |
c7f8b065 | 4041 | ("cannot call abstract subprogram &!", |
4042 | Name (Call_Node), Parent_Subp); | |
ee6ba406 | 4043 | end if; |
4044 | ||
b12c8e27 | 4045 | -- Inspect all formals of derived subprogram Subp. Compare parameter |
4046 | -- types with the parent subprogram and check whether an actual may | |
4047 | -- need a type conversion to the corresponding formal of the parent | |
4048 | -- subprogram. | |
ee6ba406 | 4049 | |
b12c8e27 | 4050 | -- Not clear whether intrinsic subprograms need such conversions. ??? |
ee6ba406 | 4051 | |
4052 | if not Is_Intrinsic_Subprogram (Parent_Subp) | |
4053 | or else Is_Generic_Instance (Parent_Subp) | |
4054 | then | |
b12c8e27 | 4055 | declare |
4056 | procedure Convert (Act : Node_Id; Typ : Entity_Id); | |
4057 | -- Rewrite node Act as a type conversion of Act to Typ. Analyze | |
4058 | -- and resolve the newly generated construct. | |
ee6ba406 | 4059 | |
b12c8e27 | 4060 | ------------- |
4061 | -- Convert -- | |
4062 | ------------- | |
ee6ba406 | 4063 | |
b12c8e27 | 4064 | procedure Convert (Act : Node_Id; Typ : Entity_Id) is |
4065 | begin | |
4066 | Rewrite (Act, OK_Convert_To (Typ, Relocate_Node (Act))); | |
4067 | Analyze (Act); | |
4068 | Resolve (Act, Typ); | |
4069 | end Convert; | |
4070 | ||
4071 | -- Local variables | |
4072 | ||
4073 | Actual_Typ : Entity_Id; | |
4074 | Formal_Typ : Entity_Id; | |
4075 | Parent_Typ : Entity_Id; | |
4076 | ||
4077 | begin | |
c7f8b065 | 4078 | Actual := First_Actual (Call_Node); |
b12c8e27 | 4079 | Formal := First_Formal (Subp); |
4080 | Parent_Formal := First_Formal (Parent_Subp); | |
4081 | while Present (Formal) loop | |
4082 | Actual_Typ := Etype (Actual); | |
4083 | Formal_Typ := Etype (Formal); | |
4084 | Parent_Typ := Etype (Parent_Formal); | |
4085 | ||
4086 | -- For an IN parameter of a scalar type, the parent formal | |
4087 | -- type and derived formal type differ or the parent formal | |
4088 | -- type and actual type do not match statically. | |
4089 | ||
4090 | if Is_Scalar_Type (Formal_Typ) | |
4091 | and then Ekind (Formal) = E_In_Parameter | |
4092 | and then Formal_Typ /= Parent_Typ | |
4093 | and then | |
4094 | not Subtypes_Statically_Match (Parent_Typ, Actual_Typ) | |
4095 | and then not Raises_Constraint_Error (Actual) | |
4096 | then | |
4097 | Convert (Actual, Parent_Typ); | |
4098 | Enable_Range_Check (Actual); | |
4099 | ||
a9b57347 | 4100 | -- If the actual has been marked as requiring a range |
4101 | -- check, then generate it here. | |
4102 | ||
4103 | if Do_Range_Check (Actual) then | |
a9b57347 | 4104 | Generate_Range_Check |
4105 | (Actual, Etype (Formal), CE_Range_Check_Failed); | |
4106 | end if; | |
4107 | ||
b12c8e27 | 4108 | -- For access types, the parent formal type and actual type |
4109 | -- differ. | |
4110 | ||
4111 | elsif Is_Access_Type (Formal_Typ) | |
4112 | and then Base_Type (Parent_Typ) /= Base_Type (Actual_Typ) | |
ee6ba406 | 4113 | then |
b12c8e27 | 4114 | if Ekind (Formal) /= E_In_Parameter then |
4115 | Convert (Actual, Parent_Typ); | |
4116 | ||
4117 | elsif Ekind (Parent_Typ) = E_Anonymous_Access_Type | |
4118 | and then Designated_Type (Parent_Typ) /= | |
4119 | Designated_Type (Actual_Typ) | |
4120 | and then not Is_Controlling_Formal (Formal) | |
4121 | then | |
4122 | -- This unchecked conversion is not necessary unless | |
4123 | -- inlining is enabled, because in that case the type | |
4124 | -- mismatch may become visible in the body about to be | |
4125 | -- inlined. | |
4126 | ||
4127 | Rewrite (Actual, | |
4128 | Unchecked_Convert_To (Parent_Typ, | |
4129 | Relocate_Node (Actual))); | |
b12c8e27 | 4130 | Analyze (Actual); |
4131 | Resolve (Actual, Parent_Typ); | |
4132 | end if; | |
ee6ba406 | 4133 | |
04d38ee4 | 4134 | -- If there is a change of representation, then generate a |
4135 | -- warning, and do the change of representation. | |
4136 | ||
4137 | elsif not Same_Representation (Formal_Typ, Parent_Typ) then | |
4138 | Error_Msg_N | |
4139 | ("??change of representation required", Actual); | |
4140 | Convert (Actual, Parent_Typ); | |
4141 | ||
b12c8e27 | 4142 | -- For array and record types, the parent formal type and |
4143 | -- derived formal type have different sizes or pragma Pack | |
4144 | -- status. | |
ee6ba406 | 4145 | |
b12c8e27 | 4146 | elsif ((Is_Array_Type (Formal_Typ) |
04d38ee4 | 4147 | and then Is_Array_Type (Parent_Typ)) |
b12c8e27 | 4148 | or else |
4149 | (Is_Record_Type (Formal_Typ) | |
04d38ee4 | 4150 | and then Is_Record_Type (Parent_Typ))) |
b12c8e27 | 4151 | and then |
4152 | (Esize (Formal_Typ) /= Esize (Parent_Typ) | |
04d38ee4 | 4153 | or else Has_Pragma_Pack (Formal_Typ) /= |
4154 | Has_Pragma_Pack (Parent_Typ)) | |
b12c8e27 | 4155 | then |
4156 | Convert (Actual, Parent_Typ); | |
ee6ba406 | 4157 | end if; |
ee6ba406 | 4158 | |
b12c8e27 | 4159 | Next_Actual (Actual); |
4160 | Next_Formal (Formal); | |
4161 | Next_Formal (Parent_Formal); | |
4162 | end loop; | |
4163 | end; | |
ee6ba406 | 4164 | end if; |
4165 | ||
4166 | Orig_Subp := Subp; | |
4167 | Subp := Parent_Subp; | |
4168 | end if; | |
4169 | ||
9756a605 | 4170 | -- Deal with case where call is an explicit dereference |
4171 | ||
c7f8b065 | 4172 | if Nkind (Name (Call_Node)) = N_Explicit_Dereference then |
ee6ba406 | 4173 | |
4174 | -- Handle case of access to protected subprogram type | |
4175 | ||
21ec6442 | 4176 | if Is_Access_Protected_Subprogram_Type |
c7f8b065 | 4177 | (Base_Type (Etype (Prefix (Name (Call_Node))))) |
ee6ba406 | 4178 | then |
a0fc8c5b | 4179 | -- If this is a call through an access to protected operation, the |
4180 | -- prefix has the form (object'address, operation'access). Rewrite | |
4181 | -- as a for other protected calls: the object is the 1st parameter | |
4182 | -- of the list of actuals. | |
ee6ba406 | 4183 | |
4184 | declare | |
4185 | Call : Node_Id; | |
4186 | Parm : List_Id; | |
4187 | Nam : Node_Id; | |
4188 | Obj : Node_Id; | |
c7f8b065 | 4189 | Ptr : constant Node_Id := Prefix (Name (Call_Node)); |
9dfe12ae | 4190 | |
4191 | T : constant Entity_Id := | |
4192 | Equivalent_Type (Base_Type (Etype (Ptr))); | |
4193 | ||
4194 | D_T : constant Entity_Id := | |
4195 | Designated_Type (Base_Type (Etype (Ptr))); | |
ee6ba406 | 4196 | |
4197 | begin | |
ba40b4af | 4198 | Obj := |
4199 | Make_Selected_Component (Loc, | |
4200 | Prefix => Unchecked_Convert_To (T, Ptr), | |
4201 | Selector_Name => | |
4202 | New_Occurrence_Of (First_Entity (T), Loc)); | |
4203 | ||
4204 | Nam := | |
4205 | Make_Selected_Component (Loc, | |
4206 | Prefix => Unchecked_Convert_To (T, Ptr), | |
4207 | Selector_Name => | |
4208 | New_Occurrence_Of (Next_Entity (First_Entity (T)), Loc)); | |
ee6ba406 | 4209 | |
578f27c9 | 4210 | Nam := |
4211 | Make_Explicit_Dereference (Loc, | |
4212 | Prefix => Nam); | |
ee6ba406 | 4213 | |
97d14ea2 | 4214 | if Present (Parameter_Associations (Call_Node)) then |
c7f8b065 | 4215 | Parm := Parameter_Associations (Call_Node); |
ee6ba406 | 4216 | else |
4217 | Parm := New_List; | |
4218 | end if; | |
4219 | ||
4220 | Prepend (Obj, Parm); | |
4221 | ||
4222 | if Etype (D_T) = Standard_Void_Type then | |
578f27c9 | 4223 | Call := |
4224 | Make_Procedure_Call_Statement (Loc, | |
4225 | Name => Nam, | |
4226 | Parameter_Associations => Parm); | |
ee6ba406 | 4227 | else |
578f27c9 | 4228 | Call := |
4229 | Make_Function_Call (Loc, | |
4230 | Name => Nam, | |
4231 | Parameter_Associations => Parm); | |
ee6ba406 | 4232 | end if; |
4233 | ||
c7f8b065 | 4234 | Set_First_Named_Actual (Call, First_Named_Actual (Call_Node)); |
ee6ba406 | 4235 | Set_Etype (Call, Etype (D_T)); |
4236 | ||
4237 | -- We do not re-analyze the call to avoid infinite recursion. | |
4238 | -- We analyze separately the prefix and the object, and set | |
4239 | -- the checks on the prefix that would otherwise be emitted | |
4240 | -- when resolving a call. | |
4241 | ||
c7f8b065 | 4242 | Rewrite (Call_Node, Call); |
ee6ba406 | 4243 | Analyze (Nam); |
4244 | Apply_Access_Check (Nam); | |
4245 | Analyze (Obj); | |
4246 | return; | |
4247 | end; | |
4248 | end if; | |
4249 | end if; | |
4250 | ||
4251 | -- If this is a call to an intrinsic subprogram, then perform the | |
4252 | -- appropriate expansion to the corresponding tree node and we | |
39a0c1d3 | 4253 | -- are all done (since after that the call is gone). |
ee6ba406 | 4254 | |
f4d93199 | 4255 | -- In the case where the intrinsic is to be processed by the back end, |
4256 | -- the call to Expand_Intrinsic_Call will do nothing, which is fine, | |
a0fc8c5b | 4257 | -- since the idea in this case is to pass the call unchanged. If the |
4258 | -- intrinsic is an inherited unchecked conversion, and the derived type | |
4259 | -- is the target type of the conversion, we must retain it as the return | |
4260 | -- type of the expression. Otherwise the expansion below, which uses the | |
4261 | -- parent operation, will yield the wrong type. | |
f4d93199 | 4262 | |
ee6ba406 | 4263 | if Is_Intrinsic_Subprogram (Subp) then |
c7f8b065 | 4264 | Expand_Intrinsic_Call (Call_Node, Subp); |
a3e461ac | 4265 | |
c7f8b065 | 4266 | if Nkind (Call_Node) = N_Unchecked_Type_Conversion |
a3e461ac | 4267 | and then Parent_Subp /= Orig_Subp |
4268 | and then Etype (Parent_Subp) /= Etype (Orig_Subp) | |
4269 | then | |
c7f8b065 | 4270 | Set_Etype (Call_Node, Etype (Orig_Subp)); |
a3e461ac | 4271 | end if; |
4272 | ||
ee6ba406 | 4273 | return; |
4274 | end if; | |
4275 | ||
6cd460aa | 4276 | if Ekind_In (Subp, E_Function, E_Procedure) then |
4277 | ||
01ec5a4d | 4278 | -- We perform a simple optimization on calls for To_Address by |
4279 | -- replacing them with an unchecked conversion. Not only is this | |
4280 | -- efficient, but it also avoids order of elaboration problems when | |
4281 | -- address clauses are inlined (address expression elaborated at the | |
f1ce0b4e | 4282 | -- wrong point). |
880342e5 | 4283 | |
01ec5a4d | 4284 | -- We perform this optimization regardless of whether we are in the |
880342e5 | 4285 | -- main unit or in a unit in the context of the main unit, to ensure |
f1ce0b4e | 4286 | -- that the generated tree is the same in both cases, for CodePeer |
4287 | -- use. | |
880342e5 | 4288 | |
4289 | if Is_RTE (Subp, RE_To_Address) then | |
c7f8b065 | 4290 | Rewrite (Call_Node, |
880342e5 | 4291 | Unchecked_Convert_To |
c7f8b065 | 4292 | (RTE (RE_Address), Relocate_Node (First_Actual (Call_Node)))); |
880342e5 | 4293 | return; |
d49bc1d9 | 4294 | |
a613cd8a | 4295 | -- A call to a null procedure is replaced by a null statement, but we |
4296 | -- are not allowed to ignore possible side effects of the call, so we | |
4297 | -- make sure that actuals are evaluated. | |
bfed3e04 | 4298 | -- We also suppress this optimization for GNATCoverage. |
d49bc1d9 | 4299 | |
bfed3e04 | 4300 | elsif Is_Null_Procedure (Subp) |
4301 | and then not Opt.Suppress_Control_Flow_Optimizations | |
4302 | then | |
d49bc1d9 | 4303 | Actual := First_Actual (Call_Node); |
4304 | while Present (Actual) loop | |
4305 | Remove_Side_Effects (Actual); | |
4306 | Next_Actual (Actual); | |
4307 | end loop; | |
4308 | ||
4309 | Rewrite (Call_Node, Make_Null_Statement (Loc)); | |
4310 | return; | |
a5b5e9bd | 4311 | end if; |
4312 | ||
8378fab6 | 4313 | -- Handle inlining. No action needed if the subprogram is not inlined |
9fac98bb | 4314 | |
8378fab6 | 4315 | if not Is_Inlined (Subp) then |
4316 | null; | |
9fac98bb | 4317 | |
b212de5b | 4318 | -- Front-end inlining of expression functions (performed also when |
4319 | -- back-end inlining is enabled). | |
fdc73c17 | 4320 | |
4321 | elsif Is_Inlinable_Expression_Function (Subp) then | |
4322 | Rewrite (N, New_Copy (Expression_Of_Expression_Function (Subp))); | |
4323 | Analyze (N); | |
4324 | return; | |
4325 | ||
b212de5b | 4326 | -- Handle front-end inlining |
9ef23ec9 | 4327 | |
8378fab6 | 4328 | elsif not Back_End_Inlining then |
913ab0bc | 4329 | Inlined_Subprogram : declare |
9dfe12ae | 4330 | Bod : Node_Id; |
4331 | Must_Inline : Boolean := False; | |
4332 | Spec : constant Node_Id := Unit_Declaration_Node (Subp); | |
913ab0bc | 4333 | |
ee6ba406 | 4334 | begin |
948ef2b8 | 4335 | -- Verify that the body to inline has already been seen, and |
4336 | -- that if the body is in the current unit the inlining does | |
4337 | -- not occur earlier. This avoids order-of-elaboration problems | |
4338 | -- in the back end. | |
4339 | ||
4340 | -- This should be documented in sinfo/einfo ??? | |
ee6ba406 | 4341 | |
9dfe12ae | 4342 | if No (Spec) |
4343 | or else Nkind (Spec) /= N_Subprogram_Declaration | |
4344 | or else No (Body_To_Inline (Spec)) | |
ee6ba406 | 4345 | then |
9dfe12ae | 4346 | Must_Inline := False; |
4347 | ||
880342e5 | 4348 | -- If this an inherited function that returns a private type, |
4349 | -- do not inline if the full view is an unconstrained array, | |
4350 | -- because such calls cannot be inlined. | |
cc5c9949 | 4351 | |
4352 | elsif Present (Orig_Subp) | |
4353 | and then Is_Array_Type (Etype (Orig_Subp)) | |
4354 | and then not Is_Constrained (Etype (Orig_Subp)) | |
4355 | then | |
4356 | Must_Inline := False; | |
4357 | ||
9ef23ec9 | 4358 | elsif In_Unfrozen_Instance (Scope (Subp)) then |
cc5c9949 | 4359 | Must_Inline := False; |
4360 | ||
9dfe12ae | 4361 | else |
4362 | Bod := Body_To_Inline (Spec); | |
4363 | ||
c7f8b065 | 4364 | if (In_Extended_Main_Code_Unit (Call_Node) |
4365 | or else In_Extended_Main_Code_Unit (Parent (Call_Node)) | |
d34432fa | 4366 | or else Has_Pragma_Inline_Always (Subp)) |
9dfe12ae | 4367 | and then (not In_Same_Extended_Unit (Sloc (Bod), Loc) |
4368 | or else | |
4369 | Earlier_In_Extended_Unit (Sloc (Bod), Loc)) | |
4370 | then | |
4371 | Must_Inline := True; | |
4372 | ||
4373 | -- If we are compiling a package body that is not the main | |
4374 | -- unit, it must be for inlining/instantiation purposes, | |
4375 | -- in which case we inline the call to insure that the same | |
4376 | -- temporaries are generated when compiling the body by | |
4377 | -- itself. Otherwise link errors can occur. | |
4378 | ||
fa7497e8 | 4379 | -- If the function being called is itself in the main unit, |
4380 | -- we cannot inline, because there is a risk of double | |
4381 | -- elaboration and/or circularity: the inlining can make | |
4382 | -- visible a private entity in the body of the main unit, | |
4383 | -- that gigi will see before its sees its proper definition. | |
4384 | ||
c7f8b065 | 4385 | elsif not (In_Extended_Main_Code_Unit (Call_Node)) |
9dfe12ae | 4386 | and then In_Package_Body |
4387 | then | |
fa7497e8 | 4388 | Must_Inline := not In_Extended_Main_Source_Unit (Subp); |
2de214f6 | 4389 | |
4390 | -- Inline calls to _postconditions when generating C code | |
4391 | ||
c8dfb75f | 4392 | elsif Modify_Tree_For_C |
2de214f6 | 4393 | and then In_Same_Extended_Unit (Sloc (Bod), Loc) |
4394 | and then Chars (Name (N)) = Name_uPostconditions | |
4395 | then | |
4396 | Must_Inline := True; | |
9dfe12ae | 4397 | end if; |
4398 | end if; | |
4399 | ||
4400 | if Must_Inline then | |
c7f8b065 | 4401 | Expand_Inlined_Call (Call_Node, Subp, Orig_Subp); |
ee6ba406 | 4402 | |
4403 | else | |
9dfe12ae | 4404 | -- Let the back end handle it |
ee6ba406 | 4405 | |
32d2c8a5 | 4406 | Add_Inlined_Body (Subp, Call_Node); |
ee6ba406 | 4407 | |
4408 | if Front_End_Inlining | |
4409 | and then Nkind (Spec) = N_Subprogram_Declaration | |
c7f8b065 | 4410 | and then (In_Extended_Main_Code_Unit (Call_Node)) |
ee6ba406 | 4411 | and then No (Body_To_Inline (Spec)) |
4412 | and then not Has_Completion (Subp) | |
4413 | and then In_Same_Extended_Unit (Sloc (Spec), Loc) | |
ee6ba406 | 4414 | then |
9dfe12ae | 4415 | Cannot_Inline |
cb97ae5c | 4416 | ("cannot inline& (body not seen yet)?", |
4417 | Call_Node, Subp); | |
ee6ba406 | 4418 | end if; |
4419 | end if; | |
913ab0bc | 4420 | end Inlined_Subprogram; |
9ef23ec9 | 4421 | |
b212de5b | 4422 | -- Front-end expansion of simple functions returning unconstrained |
4423 | -- types (see Check_And_Split_Unconstrained_Function). Note that the | |
4424 | -- case of a simple renaming (Body_To_Inline in N_Entity below, see | |
4425 | -- also Build_Renamed_Body) cannot be expanded here because this may | |
4426 | -- give rise to order-of-elaboration issues for the types of the | |
4427 | -- parameters of the subprogram, if any. | |
8378fab6 | 4428 | |
b212de5b | 4429 | elsif Present (Unit_Declaration_Node (Subp)) |
4430 | and then Nkind (Unit_Declaration_Node (Subp)) = | |
4431 | N_Subprogram_Declaration | |
4432 | and then Present (Body_To_Inline (Unit_Declaration_Node (Subp))) | |
4433 | and then | |
4434 | Nkind (Body_To_Inline (Unit_Declaration_Node (Subp))) not in | |
4435 | N_Entity | |
4436 | then | |
4437 | Expand_Inlined_Call (Call_Node, Subp, Orig_Subp); | |
4438 | ||
4439 | -- Back-end inlining either if optimization is enabled or the call is | |
4440 | -- required to be inlined. | |
4441 | ||
4442 | elsif Optimization_Level > 0 | |
4443 | or else Has_Pragma_Inline_Always (Subp) | |
8378fab6 | 4444 | then |
32d2c8a5 | 4445 | Add_Inlined_Body (Subp, Call_Node); |
ee6ba406 | 4446 | end if; |
4447 | end if; | |
4448 | ||
880342e5 | 4449 | -- Check for protected subprogram. This is either an intra-object call, |
4450 | -- or a protected function call. Protected procedure calls are rewritten | |
4451 | -- as entry calls and handled accordingly. | |
ee6ba406 | 4452 | |
880342e5 | 4453 | -- In Ada 2005, this may be an indirect call to an access parameter that |
4454 | -- is an access_to_subprogram. In that case the anonymous type has a | |
4455 | -- scope that is a protected operation, but the call is a regular one. | |
c06ded51 | 4456 | -- In either case do not expand call if subprogram is eliminated. |
33b6091b | 4457 | |
ee6ba406 | 4458 | Scop := Scope (Subp); |
4459 | ||
c7f8b065 | 4460 | if Nkind (Call_Node) /= N_Entry_Call_Statement |
ee6ba406 | 4461 | and then Is_Protected_Type (Scop) |
33b6091b | 4462 | and then Ekind (Subp) /= E_Subprogram_Type |
c06ded51 | 4463 | and then not Is_Eliminated (Subp) |
ee6ba406 | 4464 | then |
880342e5 | 4465 | -- If the call is an internal one, it is rewritten as a call to the |
4466 | -- corresponding unprotected subprogram. | |
ee6ba406 | 4467 | |
c7f8b065 | 4468 | Expand_Protected_Subprogram_Call (Call_Node, Subp, Scop); |
ee6ba406 | 4469 | end if; |
4470 | ||
bb3b440a | 4471 | -- Functions returning controlled objects need special attention. If |
4472 | -- the return type is limited, then the context is initialization and | |
4473 | -- different processing applies. If the call is to a protected function, | |
4474 | -- the expansion above will call Expand_Call recursively. Otherwise the | |
4475 | -- function call is transformed into a temporary which obtains the | |
4476 | -- result from the secondary stack. | |
ee6ba406 | 4477 | |
f3dfb204 | 4478 | if Needs_Finalization (Etype (Subp)) then |
468233ce | 4479 | if not Is_Build_In_Place_Function_Call (Call_Node) |
4480 | and then | |
4481 | (No (First_Formal (Subp)) | |
e0e76328 | 4482 | or else |
4483 | not Is_Concurrent_Record_Type (Etype (First_Formal (Subp)))) | |
468233ce | 4484 | then |
4485 | Expand_Ctrl_Function_Call (Call_Node); | |
4486 | ||
f3dfb204 | 4487 | -- Build-in-place function calls which appear in anonymous contexts |
4488 | -- need a transient scope to ensure the proper finalization of the | |
4489 | -- intermediate result after its use. | |
4490 | ||
468233ce | 4491 | elsif Is_Build_In_Place_Function_Call (Call_Node) |
e0e76328 | 4492 | and then Nkind_In (Parent (Unqual_Conv (Call_Node)), |
4493 | N_Attribute_Reference, | |
4494 | N_Function_Call, | |
4495 | N_Indexed_Component, | |
4496 | N_Object_Renaming_Declaration, | |
4497 | N_Procedure_Call_Statement, | |
4498 | N_Selected_Component, | |
4499 | N_Slice) | |
6eaa3246 | 4500 | and then |
4501 | (Ekind (Current_Scope) /= E_Loop | |
4502 | or else Nkind (Parent (N)) /= N_Function_Call | |
4503 | or else not Is_Build_In_Place_Function_Call (Parent (N))) | |
f3dfb204 | 4504 | then |
2149b10c | 4505 | Establish_Transient_Scope (Call_Node, Manage_Sec_Stack => True); |
f3dfb204 | 4506 | end if; |
ee6ba406 | 4507 | end if; |
f1ce0b4e | 4508 | end Expand_Call_Helper; |
ee6ba406 | 4509 | |
bb3b440a | 4510 | ------------------------------- |
4511 | -- Expand_Ctrl_Function_Call -- | |
4512 | ------------------------------- | |
4513 | ||
4514 | procedure Expand_Ctrl_Function_Call (N : Node_Id) is | |
199ab4c3 | 4515 | function Is_Element_Reference (N : Node_Id) return Boolean; |
4516 | -- Determine whether node N denotes a reference to an Ada 2012 container | |
4517 | -- element. | |
4518 | ||
4519 | -------------------------- | |
4520 | -- Is_Element_Reference -- | |
4521 | -------------------------- | |
4522 | ||
4523 | function Is_Element_Reference (N : Node_Id) return Boolean is | |
4524 | Ref : constant Node_Id := Original_Node (N); | |
4525 | ||
4526 | begin | |
4527 | -- Analysis marks an element reference by setting the generalized | |
4528 | -- indexing attribute of an indexed component before the component | |
4529 | -- is rewritten into a function call. | |
4530 | ||
4531 | return | |
4532 | Nkind (Ref) = N_Indexed_Component | |
4533 | and then Present (Generalized_Indexing (Ref)); | |
4534 | end Is_Element_Reference; | |
4535 | ||
199ab4c3 | 4536 | -- Start of processing for Expand_Ctrl_Function_Call |
4537 | ||
bb3b440a | 4538 | begin |
4539 | -- Optimization, if the returned value (which is on the sec-stack) is | |
4540 | -- returned again, no need to copy/readjust/finalize, we can just pass | |
4541 | -- the value thru (see Expand_N_Simple_Return_Statement), and thus no | |
4542 | -- attachment is needed | |
4543 | ||
4544 | if Nkind (Parent (N)) = N_Simple_Return_Statement then | |
4545 | return; | |
4546 | end if; | |
4547 | ||
4548 | -- Resolution is now finished, make sure we don't start analysis again | |
4549 | -- because of the duplication. | |
4550 | ||
4551 | Set_Analyzed (N); | |
4552 | ||
4553 | -- A function which returns a controlled object uses the secondary | |
4554 | -- stack. Rewrite the call into a temporary which obtains the result of | |
4555 | -- the function using 'reference. | |
4556 | ||
4557 | Remove_Side_Effects (N); | |
714e7f2d | 4558 | |
545d732b | 4559 | -- The side effect removal of the function call produced a temporary. |
4560 | -- When the context is a case expression, if expression, or expression | |
4561 | -- with actions, the lifetime of the temporary must be extended to match | |
4562 | -- that of the context. Otherwise the function result will be finalized | |
4563 | -- too early and affect the result of the expression. To prevent this | |
4564 | -- unwanted effect, the temporary should not be considered for clean up | |
4565 | -- actions by the general finalization machinery. | |
4566 | ||
4567 | -- Exception to this rule are references to Ada 2012 container elements. | |
199ab4c3 | 4568 | -- Such references must be finalized at the end of each iteration of the |
4569 | -- related quantified expression, otherwise the container will remain | |
4570 | -- busy. | |
4571 | ||
545d732b | 4572 | if Nkind (N) = N_Explicit_Dereference |
199ab4c3 | 4573 | and then Within_Case_Or_If_Expression (N) |
545d732b | 4574 | and then not Is_Element_Reference (N) |
714e7f2d | 4575 | then |
545d732b | 4576 | Set_Is_Ignored_Transient (Entity (Prefix (N))); |
714e7f2d | 4577 | end if; |
bb3b440a | 4578 | end Expand_Ctrl_Function_Call; |
4579 | ||
047bb428 | 4580 | ---------------------------------------- |
4581 | -- Expand_N_Extended_Return_Statement -- | |
4582 | ---------------------------------------- | |
4583 | ||
4584 | -- If there is a Handled_Statement_Sequence, we rewrite this: | |
4585 | ||
4586 | -- return Result : T := <expression> do | |
4587 | -- <handled_seq_of_stms> | |
4588 | -- end return; | |
4589 | ||
4590 | -- to be: | |
4591 | ||
4592 | -- declare | |
4593 | -- Result : T := <expression>; | |
4594 | -- begin | |
4595 | -- <handled_seq_of_stms> | |
4596 | -- return Result; | |
4597 | -- end; | |
4598 | ||
4599 | -- Otherwise (no Handled_Statement_Sequence), we rewrite this: | |
4600 | ||
4601 | -- return Result : T := <expression>; | |
4602 | ||
4603 | -- to be: | |
4604 | ||
4605 | -- return <expression>; | |
4606 | ||
4607 | -- unless it's build-in-place or there's no <expression>, in which case | |
4608 | -- we generate: | |
4609 | ||
4610 | -- declare | |
4611 | -- Result : T := <expression>; | |
4612 | -- begin | |
4613 | -- return Result; | |
4614 | -- end; | |
4615 | ||
4616 | -- Note that this case could have been written by the user as an extended | |
4617 | -- return statement, or could have been transformed to this from a simple | |
4618 | -- return statement. | |
4619 | ||
4620 | -- That is, we need to have a reified return object if there are statements | |
4621 | -- (which might refer to it) or if we're doing build-in-place (so we can | |
4622 | -- set its address to the final resting place or if there is no expression | |
36c80e26 | 4623 | -- (in which case default initial values might need to be set)). |
047bb428 | 4624 | |
4625 | procedure Expand_N_Extended_Return_Statement (N : Node_Id) is | |
4626 | Loc : constant Source_Ptr := Sloc (N); | |
4627 | ||
36c80e26 | 4628 | function Build_Heap_Or_Pool_Allocator |
bb3b440a | 4629 | (Temp_Id : Entity_Id; |
4630 | Temp_Typ : Entity_Id; | |
4631 | Func_Id : Entity_Id; | |
4632 | Ret_Typ : Entity_Id; | |
4633 | Alloc_Expr : Node_Id) return Node_Id; | |
4634 | -- Create the statements necessary to allocate a return object on the | |
36c80e26 | 4635 | -- heap or user-defined storage pool. The object may need finalization |
4636 | -- actions depending on the return type. | |
bb3b440a | 4637 | -- |
36c80e26 | 4638 | -- * Controlled case |
4639 | -- | |
4640 | -- if BIPfinalizationmaster = null then | |
4641 | -- Temp_Id := <Alloc_Expr>; | |
4642 | -- else | |
4643 | -- declare | |
4644 | -- type Ptr_Typ is access Ret_Typ; | |
4645 | -- for Ptr_Typ'Storage_Pool use | |
4646 | -- Base_Pool (BIPfinalizationmaster.all).all; | |
4647 | -- Local : Ptr_Typ; | |
bb3b440a | 4648 | -- |
bb3b440a | 4649 | -- begin |
36c80e26 | 4650 | -- procedure Allocate (...) is |
4651 | -- begin | |
4652 | -- System.Storage_Pools.Subpools.Allocate_Any (...); | |
4653 | -- end Allocate; | |
bb3b440a | 4654 | -- |
36c80e26 | 4655 | -- Local := <Alloc_Expr>; |
4656 | -- Temp_Id := Temp_Typ (Local); | |
4657 | -- end; | |
4658 | -- end if; | |
4659 | -- | |
4660 | -- * Non-controlled case | |
4661 | -- | |
4662 | -- Temp_Id := <Alloc_Expr>; | |
bb3b440a | 4663 | -- |
4664 | -- Temp_Id is the temporary which is used to reference the internally | |
4665 | -- created object in all allocation forms. Temp_Typ is the type of the | |
4666 | -- temporary. Func_Id is the enclosing function. Ret_Typ is the return | |
4667 | -- type of Func_Id. Alloc_Expr is the actual allocator. | |
047bb428 | 4668 | |
f1cabbf4 | 4669 | function Move_Activation_Chain (Func_Id : Entity_Id) return Node_Id; |
047bb428 | 4670 | -- Construct a call to System.Tasking.Stages.Move_Activation_Chain |
4671 | -- with parameters: | |
4672 | -- From current activation chain | |
4673 | -- To activation chain passed in by the caller | |
4674 | -- New_Master master passed in by the caller | |
f1cabbf4 | 4675 | -- |
4676 | -- Func_Id is the entity of the function where the extended return | |
4677 | -- statement appears. | |
047bb428 | 4678 | |
36c80e26 | 4679 | ---------------------------------- |
4680 | -- Build_Heap_Or_Pool_Allocator -- | |
4681 | ---------------------------------- | |
bb3b440a | 4682 | |
36c80e26 | 4683 | function Build_Heap_Or_Pool_Allocator |
bb3b440a | 4684 | (Temp_Id : Entity_Id; |
4685 | Temp_Typ : Entity_Id; | |
4686 | Func_Id : Entity_Id; | |
4687 | Ret_Typ : Entity_Id; | |
4688 | Alloc_Expr : Node_Id) return Node_Id | |
4689 | is | |
4690 | begin | |
52b3bcf2 | 4691 | pragma Assert (Is_Build_In_Place_Function (Func_Id)); |
4692 | ||
36c80e26 | 4693 | -- Processing for objects that require finalization actions |
bb3b440a | 4694 | |
36ac5fbb | 4695 | if Needs_Finalization (Ret_Typ) then |
bb3b440a | 4696 | declare |
57acff55 | 4697 | Decls : constant List_Id := New_List; |
4698 | Fin_Mas_Id : constant Entity_Id := | |
4699 | Build_In_Place_Formal | |
4700 | (Func_Id, BIP_Finalization_Master); | |
062f0dee | 4701 | Orig_Expr : constant Node_Id := |
4702 | New_Copy_Tree | |
4703 | (Source => Alloc_Expr, | |
4704 | Scopes_In_EWA_OK => True); | |
57acff55 | 4705 | Stmts : constant List_Id := New_List; |
cce84b09 | 4706 | Desig_Typ : Entity_Id; |
4707 | Local_Id : Entity_Id; | |
4708 | Pool_Id : Entity_Id; | |
4709 | Ptr_Typ : Entity_Id; | |
bb3b440a | 4710 | |
4711 | begin | |
4712 | -- Generate: | |
57acff55 | 4713 | -- Pool_Id renames Base_Pool (BIPfinalizationmaster.all).all; |
bb3b440a | 4714 | |
4715 | Pool_Id := Make_Temporary (Loc, 'P'); | |
4716 | ||
4717 | Append_To (Decls, | |
4718 | Make_Object_Renaming_Declaration (Loc, | |
4719 | Defining_Identifier => Pool_Id, | |
b3190af0 | 4720 | Subtype_Mark => |
83c6c069 | 4721 | New_Occurrence_Of (RTE (RE_Root_Storage_Pool), Loc), |
b3190af0 | 4722 | Name => |
bb3b440a | 4723 | Make_Explicit_Dereference (Loc, |
4724 | Prefix => | |
4725 | Make_Function_Call (Loc, | |
b3190af0 | 4726 | Name => |
83c6c069 | 4727 | New_Occurrence_Of (RTE (RE_Base_Pool), Loc), |
bb3b440a | 4728 | Parameter_Associations => New_List ( |
4729 | Make_Explicit_Dereference (Loc, | |
57acff55 | 4730 | Prefix => |
83c6c069 | 4731 | New_Occurrence_Of (Fin_Mas_Id, Loc))))))); |
bb3b440a | 4732 | |
4733 | -- Create an access type which uses the storage pool of the | |
57acff55 | 4734 | -- caller's master. This additional type is necessary because |
4735 | -- the finalization master cannot be associated with the type | |
bb3b440a | 4736 | -- of the temporary. Otherwise the secondary stack allocation |
4737 | -- will fail. | |
4738 | ||
cce84b09 | 4739 | Desig_Typ := Ret_Typ; |
4740 | ||
4741 | -- Ensure that the build-in-place machinery uses a fat pointer | |
4742 | -- when allocating an unconstrained array on the heap. In this | |
4743 | -- case the result object type is a constrained array type even | |
4744 | -- though the function type is unconstrained. | |
4745 | ||
4746 | if Ekind (Desig_Typ) = E_Array_Subtype then | |
4747 | Desig_Typ := Base_Type (Desig_Typ); | |
4748 | end if; | |
4749 | ||
bb3b440a | 4750 | -- Generate: |
cce84b09 | 4751 | -- type Ptr_Typ is access Desig_Typ; |
bb3b440a | 4752 | |
4753 | Ptr_Typ := Make_Temporary (Loc, 'P'); | |
4754 | ||
4755 | Append_To (Decls, | |
4756 | Make_Full_Type_Declaration (Loc, | |
4757 | Defining_Identifier => Ptr_Typ, | |
b3190af0 | 4758 | Type_Definition => |
bb3b440a | 4759 | Make_Access_To_Object_Definition (Loc, |
4760 | Subtype_Indication => | |
83c6c069 | 4761 | New_Occurrence_Of (Desig_Typ, Loc)))); |
bb3b440a | 4762 | |
57acff55 | 4763 | -- Perform minor decoration in order to set the master and the |
4764 | -- storage pool attributes. | |
bb3b440a | 4765 | |
36c80e26 | 4766 | Set_Ekind (Ptr_Typ, E_Access_Type); |
57acff55 | 4767 | Set_Finalization_Master (Ptr_Typ, Fin_Mas_Id); |
bb3b440a | 4768 | Set_Associated_Storage_Pool (Ptr_Typ, Pool_Id); |
4769 | ||
4770 | -- Create the temporary, generate: | |
bb3b440a | 4771 | -- Local_Id : Ptr_Typ; |
4772 | ||
4773 | Local_Id := Make_Temporary (Loc, 'T'); | |
4774 | ||
4775 | Append_To (Decls, | |
4776 | Make_Object_Declaration (Loc, | |
4777 | Defining_Identifier => Local_Id, | |
b3190af0 | 4778 | Object_Definition => |
83c6c069 | 4779 | New_Occurrence_Of (Ptr_Typ, Loc))); |
bb3b440a | 4780 | |
4781 | -- Allocate the object, generate: | |
bb3b440a | 4782 | -- Local_Id := <Alloc_Expr>; |
4783 | ||
4784 | Append_To (Stmts, | |
4785 | Make_Assignment_Statement (Loc, | |
83c6c069 | 4786 | Name => New_Occurrence_Of (Local_Id, Loc), |
bb3b440a | 4787 | Expression => Alloc_Expr)); |
4788 | ||
4789 | -- Generate: | |
4790 | -- Temp_Id := Temp_Typ (Local_Id); | |
4791 | ||
4792 | Append_To (Stmts, | |
4793 | Make_Assignment_Statement (Loc, | |
83c6c069 | 4794 | Name => New_Occurrence_Of (Temp_Id, Loc), |
bb3b440a | 4795 | Expression => |
4796 | Unchecked_Convert_To (Temp_Typ, | |
83c6c069 | 4797 | New_Occurrence_Of (Local_Id, Loc)))); |
bb3b440a | 4798 | |
4799 | -- Wrap the allocation in a block. This is further conditioned | |
57acff55 | 4800 | -- by checking the caller finalization master at runtime. A |
4801 | -- null value indicates a non-existent master, most likely due | |
4802 | -- to a Finalize_Storage_Only allocation. | |
bb3b440a | 4803 | |
4804 | -- Generate: | |
36c80e26 | 4805 | -- if BIPfinalizationmaster = null then |
4806 | -- Temp_Id := <Orig_Expr>; | |
4807 | -- else | |
bb3b440a | 4808 | -- declare |
4809 | -- <Decls> | |
4810 | -- begin | |
4811 | -- <Stmts> | |
4812 | -- end; | |
4813 | -- end if; | |
4814 | ||
4815 | return | |
4816 | Make_If_Statement (Loc, | |
b3190af0 | 4817 | Condition => |
36c80e26 | 4818 | Make_Op_Eq (Loc, |
83c6c069 | 4819 | Left_Opnd => New_Occurrence_Of (Fin_Mas_Id, Loc), |
b3190af0 | 4820 | Right_Opnd => Make_Null (Loc)), |
bb3b440a | 4821 | |
4822 | Then_Statements => New_List ( | |
36c80e26 | 4823 | Make_Assignment_Statement (Loc, |
4824 | Name => New_Occurrence_Of (Temp_Id, Loc), | |
4825 | Expression => Orig_Expr)), | |
4826 | ||
4827 | Else_Statements => New_List ( | |
bb3b440a | 4828 | Make_Block_Statement (Loc, |
b3190af0 | 4829 | Declarations => Decls, |
bb3b440a | 4830 | Handled_Statement_Sequence => |
4831 | Make_Handled_Sequence_Of_Statements (Loc, | |
4832 | Statements => Stmts)))); | |
4833 | end; | |
4834 | ||
4835 | -- For all other cases, generate: | |
bb3b440a | 4836 | -- Temp_Id := <Alloc_Expr>; |
4837 | ||
4838 | else | |
4839 | return | |
4840 | Make_Assignment_Statement (Loc, | |
83c6c069 | 4841 | Name => New_Occurrence_Of (Temp_Id, Loc), |
bb3b440a | 4842 | Expression => Alloc_Expr); |
4843 | end if; | |
36c80e26 | 4844 | end Build_Heap_Or_Pool_Allocator; |
047bb428 | 4845 | |
047bb428 | 4846 | --------------------------- |
4847 | -- Move_Activation_Chain -- | |
4848 | --------------------------- | |
4849 | ||
f1cabbf4 | 4850 | function Move_Activation_Chain (Func_Id : Entity_Id) return Node_Id is |
047bb428 | 4851 | begin |
047bb428 | 4852 | return |
4853 | Make_Procedure_Call_Statement (Loc, | |
b3190af0 | 4854 | Name => |
83c6c069 | 4855 | New_Occurrence_Of (RTE (RE_Move_Activation_Chain), Loc), |
4d8497ea | 4856 | |
4857 | Parameter_Associations => New_List ( | |
4858 | ||
4859 | -- Source chain | |
4860 | ||
4861 | Make_Attribute_Reference (Loc, | |
4862 | Prefix => Make_Identifier (Loc, Name_uChain), | |
4863 | Attribute_Name => Name_Unrestricted_Access), | |
4864 | ||
4865 | -- Destination chain | |
4866 | ||
83c6c069 | 4867 | New_Occurrence_Of |
f1cabbf4 | 4868 | (Build_In_Place_Formal (Func_Id, BIP_Activation_Chain), Loc), |
4d8497ea | 4869 | |
4870 | -- New master | |
4871 | ||
83c6c069 | 4872 | New_Occurrence_Of |
f1cabbf4 | 4873 | (Build_In_Place_Formal (Func_Id, BIP_Task_Master), Loc))); |
047bb428 | 4874 | end Move_Activation_Chain; |
4875 | ||
f1cabbf4 | 4876 | -- Local variables |
4877 | ||
4878 | Func_Id : constant Entity_Id := | |
4879 | Return_Applies_To (Return_Statement_Entity (N)); | |
4880 | Is_BIP_Func : constant Boolean := | |
4881 | Is_Build_In_Place_Function (Func_Id); | |
4882 | Ret_Obj_Id : constant Entity_Id := | |
4883 | First_Entity (Return_Statement_Entity (N)); | |
4884 | Ret_Obj_Decl : constant Node_Id := Parent (Ret_Obj_Id); | |
4885 | Ret_Typ : constant Entity_Id := Etype (Func_Id); | |
4886 | ||
4887 | Exp : Node_Id; | |
4888 | HSS : Node_Id; | |
4889 | Result : Node_Id; | |
f1cabbf4 | 4890 | Stmts : List_Id; |
4891 | ||
5bb74b99 | 4892 | Return_Stmt : Node_Id := Empty; |
4893 | -- Force initialization to facilitate static analysis | |
4894 | ||
bb3b440a | 4895 | -- Start of processing for Expand_N_Extended_Return_Statement |
047bb428 | 4896 | |
bb3b440a | 4897 | begin |
61ce7f9f | 4898 | -- Given that functionality of interface thunks is simple (just displace |
4899 | -- the pointer to the object) they are always handled by means of | |
4900 | -- simple return statements. | |
4901 | ||
a67bba01 | 4902 | pragma Assert (not Is_Thunk (Current_Subprogram)); |
61ce7f9f | 4903 | |
bb3b440a | 4904 | if Nkind (Ret_Obj_Decl) = N_Object_Declaration then |
4905 | Exp := Expression (Ret_Obj_Decl); | |
15a97f6f | 4906 | |
4907 | -- Assert that if F says "return R : T := G(...) do..." | |
4908 | -- then F and G are both b-i-p, or neither b-i-p. | |
4909 | ||
4910 | if Nkind (Exp) = N_Function_Call then | |
a67bba01 | 4911 | pragma Assert (Ekind (Current_Subprogram) = E_Function); |
15a97f6f | 4912 | pragma Assert |
a67bba01 | 4913 | (Is_Build_In_Place_Function (Current_Subprogram) = |
15a97f6f | 4914 | Is_Build_In_Place_Function_Call (Exp)); |
4915 | null; | |
4916 | end if; | |
bb3b440a | 4917 | else |
4918 | Exp := Empty; | |
4919 | end if; | |
047bb428 | 4920 | |
bb3b440a | 4921 | HSS := Handled_Statement_Sequence (N); |
047bb428 | 4922 | |
bb3b440a | 4923 | -- If the returned object needs finalization actions, the function must |
4924 | -- perform the appropriate cleanup should it fail to return. The state | |
4925 | -- of the function itself is tracked through a flag which is coupled | |
4926 | -- with the scope finalizer. There is one flag per each return object | |
4927 | -- in case of multiple returns. | |
047bb428 | 4928 | |
f1cabbf4 | 4929 | if Is_BIP_Func and then Needs_Finalization (Etype (Ret_Obj_Id)) then |
bb3b440a | 4930 | declare |
4931 | Flag_Decl : Node_Id; | |
4932 | Flag_Id : Entity_Id; | |
4933 | Func_Bod : Node_Id; | |
047bb428 | 4934 | |
bb3b440a | 4935 | begin |
4936 | -- Recover the function body | |
047bb428 | 4937 | |
f1cabbf4 | 4938 | Func_Bod := Unit_Declaration_Node (Func_Id); |
4d8497ea | 4939 | |
bb3b440a | 4940 | if Nkind (Func_Bod) = N_Subprogram_Declaration then |
4941 | Func_Bod := Parent (Parent (Corresponding_Body (Func_Bod))); | |
4942 | end if; | |
047bb428 | 4943 | |
cd24e497 | 4944 | if Nkind (Func_Bod) = N_Function_Specification then |
4945 | Func_Bod := Parent (Func_Bod); -- one more level for child units | |
4946 | end if; | |
4947 | ||
4948 | pragma Assert (Nkind (Func_Bod) = N_Subprogram_Body); | |
4949 | ||
bb3b440a | 4950 | -- Create a flag to track the function state |
047bb428 | 4951 | |
bb3b440a | 4952 | Flag_Id := Make_Temporary (Loc, 'F'); |
714e7f2d | 4953 | Set_Status_Flag_Or_Transient_Decl (Ret_Obj_Id, Flag_Id); |
047bb428 | 4954 | |
bb3b440a | 4955 | -- Insert the flag at the beginning of the function declarations, |
4956 | -- generate: | |
4957 | -- Fnn : Boolean := False; | |
047bb428 | 4958 | |
bb3b440a | 4959 | Flag_Decl := |
4960 | Make_Object_Declaration (Loc, | |
4961 | Defining_Identifier => Flag_Id, | |
b3190af0 | 4962 | Object_Definition => |
83c6c069 | 4963 | New_Occurrence_Of (Standard_Boolean, Loc), |
4964 | Expression => | |
4965 | New_Occurrence_Of (Standard_False, Loc)); | |
047bb428 | 4966 | |
bb3b440a | 4967 | Prepend_To (Declarations (Func_Bod), Flag_Decl); |
4968 | Analyze (Flag_Decl); | |
4969 | end; | |
4970 | end if; | |
047bb428 | 4971 | |
4972 | -- Build a simple_return_statement that returns the return object when | |
4973 | -- there is a statement sequence, or no expression, or the result will | |
4974 | -- be built in place. Note however that we currently do this for all | |
cd24e497 | 4975 | -- composite cases, even though not all are built in place. |
047bb428 | 4976 | |
bb3b440a | 4977 | if Present (HSS) |
f1cabbf4 | 4978 | or else Is_Composite_Type (Ret_Typ) |
047bb428 | 4979 | or else No (Exp) |
4980 | then | |
bb3b440a | 4981 | if No (HSS) then |
4982 | Stmts := New_List; | |
047bb428 | 4983 | |
4984 | -- If the extended return has a handled statement sequence, then wrap | |
4985 | -- it in a block and use the block as the first statement. | |
4986 | ||
4987 | else | |
bb3b440a | 4988 | Stmts := New_List ( |
4989 | Make_Block_Statement (Loc, | |
b3190af0 | 4990 | Declarations => New_List, |
bb3b440a | 4991 | Handled_Statement_Sequence => HSS)); |
047bb428 | 4992 | end if; |
4993 | ||
bb3b440a | 4994 | -- If the result type contains tasks, we call Move_Activation_Chain. |
4995 | -- Later, the cleanup code will call Complete_Master, which will | |
4996 | -- terminate any unactivated tasks belonging to the return statement | |
4997 | -- master. But Move_Activation_Chain updates their master to be that | |
4998 | -- of the caller, so they will not be terminated unless the return | |
4999 | -- statement completes unsuccessfully due to exception, abort, goto, | |
5000 | -- or exit. As a formality, we test whether the function requires the | |
5001 | -- result to be built in place, though that's necessarily true for | |
5002 | -- the case of result types with task parts. | |
047bb428 | 5003 | |
f1cabbf4 | 5004 | if Is_BIP_Func and then Has_Task (Ret_Typ) then |
5005 | ||
749b64b7 | 5006 | -- The return expression is an aggregate for a complex type which |
5007 | -- contains tasks. This particular case is left unexpanded since | |
5008 | -- the regular expansion would insert all temporaries and | |
5009 | -- initialization code in the wrong block. | |
5010 | ||
5011 | if Nkind (Exp) = N_Aggregate then | |
5012 | Expand_N_Aggregate (Exp); | |
5013 | end if; | |
5014 | ||
43602818 | 5015 | -- Do not move the activation chain if the return object does not |
5016 | -- contain tasks. | |
5017 | ||
5018 | if Has_Task (Etype (Ret_Obj_Id)) then | |
f1cabbf4 | 5019 | Append_To (Stmts, Move_Activation_Chain (Func_Id)); |
43602818 | 5020 | end if; |
047bb428 | 5021 | end if; |
5022 | ||
bb3b440a | 5023 | -- Update the state of the function right before the object is |
5024 | -- returned. | |
5025 | ||
f1cabbf4 | 5026 | if Is_BIP_Func and then Needs_Finalization (Etype (Ret_Obj_Id)) then |
bb3b440a | 5027 | declare |
008ad845 | 5028 | Flag_Id : constant Entity_Id := |
714e7f2d | 5029 | Status_Flag_Or_Transient_Decl (Ret_Obj_Id); |
7f6744cb | 5030 | |
bb3b440a | 5031 | begin |
5032 | -- Generate: | |
5033 | -- Fnn := True; | |
5034 | ||
5035 | Append_To (Stmts, | |
5036 | Make_Assignment_Statement (Loc, | |
83c6c069 | 5037 | Name => New_Occurrence_Of (Flag_Id, Loc), |
5038 | Expression => New_Occurrence_Of (Standard_True, Loc))); | |
bb3b440a | 5039 | end; |
047bb428 | 5040 | end if; |
5041 | ||
5042 | -- Build a simple_return_statement that returns the return object | |
5043 | ||
bb3b440a | 5044 | Return_Stmt := |
047bb428 | 5045 | Make_Simple_Return_Statement (Loc, |
b3190af0 | 5046 | Expression => New_Occurrence_Of (Ret_Obj_Id, Loc)); |
bb3b440a | 5047 | Append_To (Stmts, Return_Stmt); |
047bb428 | 5048 | |
bb3b440a | 5049 | HSS := Make_Handled_Sequence_Of_Statements (Loc, Stmts); |
047bb428 | 5050 | end if; |
5051 | ||
bb3b440a | 5052 | -- Case where we build a return statement block |
047bb428 | 5053 | |
bb3b440a | 5054 | if Present (HSS) then |
047bb428 | 5055 | Result := |
5056 | Make_Block_Statement (Loc, | |
b3190af0 | 5057 | Declarations => Return_Object_Declarations (N), |
bb3b440a | 5058 | Handled_Statement_Sequence => HSS); |
047bb428 | 5059 | |
5060 | -- We set the entity of the new block statement to be that of the | |
5061 | -- return statement. This is necessary so that various fields, such | |
5062 | -- as Finalization_Chain_Entity carry over from the return statement | |
5063 | -- to the block. Note that this block is unusual, in that its entity | |
5064 | -- is an E_Return_Statement rather than an E_Block. | |
5065 | ||
5066 | Set_Identifier | |
5067 | (Result, New_Occurrence_Of (Return_Statement_Entity (N), Loc)); | |
5068 | ||
8fc2605c | 5069 | -- If the object decl was already rewritten as a renaming, then we |
603fc431 | 5070 | -- don't want to do the object allocation and transformation of |
8fc2605c | 5071 | -- the return object declaration to a renaming. This case occurs |
047bb428 | 5072 | -- when the return object is initialized by a call to another |
8fc2605c | 5073 | -- build-in-place function, and that function is responsible for |
5074 | -- the allocation of the return object. | |
047bb428 | 5075 | |
f1cabbf4 | 5076 | if Is_BIP_Func |
bb3b440a | 5077 | and then Nkind (Ret_Obj_Decl) = N_Object_Renaming_Declaration |
047bb428 | 5078 | then |
bb3b440a | 5079 | pragma Assert |
5080 | (Nkind (Original_Node (Ret_Obj_Decl)) = N_Object_Declaration | |
8b3a98b2 | 5081 | and then |
5082 | ||
5083 | -- It is a regular BIP object declaration | |
5084 | ||
5085 | (Is_Build_In_Place_Function_Call | |
5086 | (Expression (Original_Node (Ret_Obj_Decl))) | |
5087 | ||
5088 | -- It is a BIP object declaration that displaces the pointer | |
5089 | -- to the object to reference a convered interface type. | |
5090 | ||
5091 | or else | |
5092 | Present (Unqual_BIP_Iface_Function_Call | |
5093 | (Expression (Original_Node (Ret_Obj_Decl)))))); | |
bb3b440a | 5094 | |
5095 | -- Return the build-in-place result by reference | |
047bb428 | 5096 | |
bb3b440a | 5097 | Set_By_Ref (Return_Stmt); |
047bb428 | 5098 | |
f1cabbf4 | 5099 | elsif Is_BIP_Func then |
047bb428 | 5100 | |
5101 | -- Locate the implicit access parameter associated with the | |
5102 | -- caller-supplied return object and convert the return | |
5103 | -- statement's return object declaration to a renaming of a | |
5104 | -- dereference of the access parameter. If the return object's | |
5105 | -- declaration includes an expression that has not already been | |
5106 | -- expanded as separate assignments, then add an assignment | |
5107 | -- statement to ensure the return object gets initialized. | |
5108 | ||
bb3b440a | 5109 | -- declare |
5110 | -- Result : T [:= <expression>]; | |
5111 | -- begin | |
5112 | -- ... | |
047bb428 | 5113 | |
5114 | -- is converted to | |
5115 | ||
bb3b440a | 5116 | -- declare |
5117 | -- Result : T renames FuncRA.all; | |
5118 | -- [Result := <expression;] | |
5119 | -- begin | |
5120 | -- ... | |
047bb428 | 5121 | |
5122 | declare | |
f1cabbf4 | 5123 | Ret_Obj_Expr : constant Node_Id := Expression (Ret_Obj_Decl); |
5124 | Ret_Obj_Typ : constant Entity_Id := Etype (Ret_Obj_Id); | |
5125 | ||
047bb428 | 5126 | Init_Assignment : Node_Id := Empty; |
f1cabbf4 | 5127 | Obj_Acc_Formal : Entity_Id; |
5128 | Obj_Acc_Deref : Node_Id; | |
5129 | Obj_Alloc_Formal : Entity_Id; | |
047bb428 | 5130 | |
5131 | begin | |
5132 | -- Build-in-place results must be returned by reference | |
5133 | ||
bb3b440a | 5134 | Set_By_Ref (Return_Stmt); |
047bb428 | 5135 | |
5136 | -- Retrieve the implicit access parameter passed by the caller | |
5137 | ||
f1cabbf4 | 5138 | Obj_Acc_Formal := |
5139 | Build_In_Place_Formal (Func_Id, BIP_Object_Access); | |
047bb428 | 5140 | |
5141 | -- If the return object's declaration includes an expression | |
5142 | -- and the declaration isn't marked as No_Initialization, then | |
5143 | -- we need to generate an assignment to the object and insert | |
5144 | -- it after the declaration before rewriting it as a renaming | |
5145 | -- (otherwise we'll lose the initialization). The case where | |
5146 | -- the result type is an interface (or class-wide interface) | |
5147 | -- is also excluded because the context of the function call | |
5148 | -- must be unconstrained, so the initialization will always | |
5149 | -- be done as part of an allocator evaluation (storage pool | |
5150 | -- or secondary stack), never to a constrained target object | |
5151 | -- passed in by the caller. Besides the assignment being | |
5152 | -- unneeded in this case, it avoids problems with trying to | |
5153 | -- generate a dispatching assignment when the return expression | |
5154 | -- is a nonlimited descendant of a limited interface (the | |
5155 | -- interface has no assignment operation). | |
5156 | ||
f1cabbf4 | 5157 | if Present (Ret_Obj_Expr) |
bb3b440a | 5158 | and then not No_Initialization (Ret_Obj_Decl) |
f1cabbf4 | 5159 | and then not Is_Interface (Ret_Obj_Typ) |
047bb428 | 5160 | then |
5161 | Init_Assignment := | |
5162 | Make_Assignment_Statement (Loc, | |
f1cabbf4 | 5163 | Name => New_Occurrence_Of (Ret_Obj_Id, Loc), |
062f0dee | 5164 | Expression => |
5165 | New_Copy_Tree | |
5166 | (Source => Ret_Obj_Expr, | |
5167 | Scopes_In_EWA_OK => True)); | |
bb3b440a | 5168 | |
f1cabbf4 | 5169 | Set_Etype (Name (Init_Assignment), Etype (Ret_Obj_Id)); |
047bb428 | 5170 | Set_Assignment_OK (Name (Init_Assignment)); |
5171 | Set_No_Ctrl_Actions (Init_Assignment); | |
5172 | ||
5173 | Set_Parent (Name (Init_Assignment), Init_Assignment); | |
5174 | Set_Parent (Expression (Init_Assignment), Init_Assignment); | |
5175 | ||
bb3b440a | 5176 | Set_Expression (Ret_Obj_Decl, Empty); |
047bb428 | 5177 | |
f1cabbf4 | 5178 | if Is_Class_Wide_Type (Etype (Ret_Obj_Id)) |
047bb428 | 5179 | and then not Is_Class_Wide_Type |
5180 | (Etype (Expression (Init_Assignment))) | |
5181 | then | |
5182 | Rewrite (Expression (Init_Assignment), | |
5183 | Make_Type_Conversion (Loc, | |
5184 | Subtype_Mark => | |
f1cabbf4 | 5185 | New_Occurrence_Of (Etype (Ret_Obj_Id), Loc), |
b3190af0 | 5186 | Expression => |
047bb428 | 5187 | Relocate_Node (Expression (Init_Assignment)))); |
5188 | end if; | |
5189 | ||
5190 | -- In the case of functions where the calling context can | |
5191 | -- determine the form of allocation needed, initialization | |
5192 | -- is done with each part of the if statement that handles | |
5193 | -- the different forms of allocation (this is true for | |
36c80e26 | 5194 | -- unconstrained, tagged, and controlled result subtypes). |
047bb428 | 5195 | |
36c80e26 | 5196 | if not Needs_BIP_Alloc_Form (Func_Id) then |
bb3b440a | 5197 | Insert_After (Ret_Obj_Decl, Init_Assignment); |
047bb428 | 5198 | end if; |
5199 | end if; | |
5200 | ||
5201 | -- When the function's subtype is unconstrained, a run-time | |
5202 | -- test is needed to determine the form of allocation to use | |
5203 | -- for the return object. The function has an implicit formal | |
5204 | -- parameter indicating this. If the BIP_Alloc_Form formal has | |
5205 | -- the value one, then the caller has passed access to an | |
5206 | -- existing object for use as the return object. If the value | |
5207 | -- is two, then the return object must be allocated on the | |
5208 | -- secondary stack. Otherwise, the object must be allocated in | |
9a666241 | 5209 | -- a storage pool. We generate an if statement to test the |
5210 | -- implicit allocation formal and initialize a local access | |
5211 | -- value appropriately, creating allocators in the secondary | |
36c80e26 | 5212 | -- stack and global heap cases. The special formal also exists |
9a666241 | 5213 | -- and must be tested when the function has a tagged result, |
5214 | -- even when the result subtype is constrained, because in | |
5215 | -- general such functions can be called in dispatching contexts | |
5216 | -- and must be handled similarly to functions with a class-wide | |
5217 | -- result. | |
047bb428 | 5218 | |
36c80e26 | 5219 | if Needs_BIP_Alloc_Form (Func_Id) then |
047bb428 | 5220 | Obj_Alloc_Formal := |
f1cabbf4 | 5221 | Build_In_Place_Formal (Func_Id, BIP_Alloc_Form); |
047bb428 | 5222 | |
5223 | declare | |
3295b1fa | 5224 | Pool_Id : constant Entity_Id := |
5225 | Make_Temporary (Loc, 'P'); | |
047bb428 | 5226 | Alloc_Obj_Id : Entity_Id; |
5227 | Alloc_Obj_Decl : Node_Id; | |
5228 | Alloc_If_Stmt : Node_Id; | |
77b577f9 | 5229 | Guard_Except : Node_Id; |
52b3bcf2 | 5230 | Heap_Allocator : Node_Id; |
52b3bcf2 | 5231 | Pool_Decl : Node_Id; |
5232 | Pool_Allocator : Node_Id; | |
3295b1fa | 5233 | Ptr_Type_Decl : Node_Id; |
5234 | Ref_Type : Entity_Id; | |
5235 | SS_Allocator : Node_Id; | |
047bb428 | 5236 | |
5237 | begin | |
5238 | -- Reuse the itype created for the function's implicit | |
5239 | -- access formal. This avoids the need to create a new | |
5240 | -- access type here, plus it allows assigning the access | |
5241 | -- formal directly without applying a conversion. | |
5242 | ||
bb3b440a | 5243 | -- Ref_Type := Etype (Object_Access); |
047bb428 | 5244 | |
5245 | -- Create an access type designating the function's | |
5246 | -- result subtype. | |
5247 | ||
5248 | Ref_Type := Make_Temporary (Loc, 'A'); | |
5249 | ||
5250 | Ptr_Type_Decl := | |
5251 | Make_Full_Type_Declaration (Loc, | |
5252 | Defining_Identifier => Ref_Type, | |
b3190af0 | 5253 | Type_Definition => |
047bb428 | 5254 | Make_Access_To_Object_Definition (Loc, |
b3190af0 | 5255 | All_Present => True, |
047bb428 | 5256 | Subtype_Indication => |
f1cabbf4 | 5257 | New_Occurrence_Of (Ret_Obj_Typ, Loc))); |
047bb428 | 5258 | |
bb3b440a | 5259 | Insert_Before (Ret_Obj_Decl, Ptr_Type_Decl); |
047bb428 | 5260 | |
5261 | -- Create an access object that will be initialized to an | |
5262 | -- access value denoting the return object, either coming | |
5263 | -- from an implicit access value passed in by the caller | |
5264 | -- or from the result of an allocator. | |
5265 | ||
5266 | Alloc_Obj_Id := Make_Temporary (Loc, 'R'); | |
5267 | Set_Etype (Alloc_Obj_Id, Ref_Type); | |
5268 | ||
5269 | Alloc_Obj_Decl := | |
5270 | Make_Object_Declaration (Loc, | |
5271 | Defining_Identifier => Alloc_Obj_Id, | |
b3190af0 | 5272 | Object_Definition => |
83c6c069 | 5273 | New_Occurrence_Of (Ref_Type, Loc)); |
047bb428 | 5274 | |
bb3b440a | 5275 | Insert_Before (Ret_Obj_Decl, Alloc_Obj_Decl); |
047bb428 | 5276 | |
5277 | -- Create allocators for both the secondary stack and | |
5278 | -- global heap. If there's an initialization expression, | |
5279 | -- then create these as initialized allocators. | |
5280 | ||
f1cabbf4 | 5281 | if Present (Ret_Obj_Expr) |
bb3b440a | 5282 | and then not No_Initialization (Ret_Obj_Decl) |
047bb428 | 5283 | then |
5284 | -- Always use the type of the expression for the | |
5285 | -- qualified expression, rather than the result type. | |
5286 | -- In general we cannot always use the result type | |
5287 | -- for the allocator, because the expression might be | |
5288 | -- of a specific type, such as in the case of an | |
5289 | -- aggregate or even a nonlimited object when the | |
5290 | -- result type is a limited class-wide interface type. | |
5291 | ||
5292 | Heap_Allocator := | |
5293 | Make_Allocator (Loc, | |
5294 | Expression => | |
5295 | Make_Qualified_Expression (Loc, | |
5296 | Subtype_Mark => | |
83c6c069 | 5297 | New_Occurrence_Of |
f1cabbf4 | 5298 | (Etype (Ret_Obj_Expr), Loc), |
062f0dee | 5299 | Expression => |
5300 | New_Copy_Tree | |
5301 | (Source => Ret_Obj_Expr, | |
5302 | Scopes_In_EWA_OK => True))); | |
047bb428 | 5303 | |
5304 | else | |
5305 | -- If the function returns a class-wide type we cannot | |
5306 | -- use the return type for the allocator. Instead we | |
5307 | -- use the type of the expression, which must be an | |
5308 | -- aggregate of a definite type. | |
5309 | ||
f1cabbf4 | 5310 | if Is_Class_Wide_Type (Ret_Obj_Typ) then |
047bb428 | 5311 | Heap_Allocator := |
5312 | Make_Allocator (Loc, | |
5313 | Expression => | |
83c6c069 | 5314 | New_Occurrence_Of |
f1cabbf4 | 5315 | (Etype (Ret_Obj_Expr), Loc)); |
047bb428 | 5316 | else |
5317 | Heap_Allocator := | |
5318 | Make_Allocator (Loc, | |
5319 | Expression => | |
f1cabbf4 | 5320 | New_Occurrence_Of (Ret_Obj_Typ, Loc)); |
047bb428 | 5321 | end if; |
5322 | ||
5323 | -- If the object requires default initialization then | |
5324 | -- that will happen later following the elaboration of | |
5325 | -- the object renaming. If we don't turn it off here | |
5326 | -- then the object will be default initialized twice. | |
5327 | ||
5328 | Set_No_Initialization (Heap_Allocator); | |
5329 | end if; | |
5330 | ||
cd1a4900 | 5331 | -- Set the flag indicating that the allocator came from |
5332 | -- a build-in-place return statement, so we can avoid | |
5333 | -- adjusting the allocated object. Note that this flag | |
5334 | -- will be inherited by the copies made below. | |
5335 | ||
5336 | Set_Alloc_For_BIP_Return (Heap_Allocator); | |
5337 | ||
52b3bcf2 | 5338 | -- The Pool_Allocator is just like the Heap_Allocator, |
3295b1fa | 5339 | -- except we set Storage_Pool and Procedure_To_Call so |
5340 | -- it will use the user-defined storage pool. | |
52b3bcf2 | 5341 | |
062f0dee | 5342 | Pool_Allocator := |
5343 | New_Copy_Tree | |
5344 | (Source => Heap_Allocator, | |
5345 | Scopes_In_EWA_OK => True); | |
5346 | ||
cd1a4900 | 5347 | pragma Assert (Alloc_For_BIP_Return (Pool_Allocator)); |
3295b1fa | 5348 | |
5349 | -- Do not generate the renaming of the build-in-place | |
36ac5fbb | 5350 | -- pool parameter on ZFP because the parameter is not |
5351 | -- created in the first place. | |
3295b1fa | 5352 | |
36ac5fbb | 5353 | if RTE_Available (RE_Root_Storage_Pool_Ptr) then |
3295b1fa | 5354 | Pool_Decl := |
5355 | Make_Object_Renaming_Declaration (Loc, | |
5356 | Defining_Identifier => Pool_Id, | |
5357 | Subtype_Mark => | |
83c6c069 | 5358 | New_Occurrence_Of |
3295b1fa | 5359 | (RTE (RE_Root_Storage_Pool), Loc), |
5360 | Name => | |
5361 | Make_Explicit_Dereference (Loc, | |
83c6c069 | 5362 | New_Occurrence_Of |
3295b1fa | 5363 | (Build_In_Place_Formal |
f1cabbf4 | 5364 | (Func_Id, BIP_Storage_Pool), Loc))); |
3295b1fa | 5365 | Set_Storage_Pool (Pool_Allocator, Pool_Id); |
5366 | Set_Procedure_To_Call | |
5367 | (Pool_Allocator, RTE (RE_Allocate_Any)); | |
5368 | else | |
5369 | Pool_Decl := Make_Null_Statement (Loc); | |
5370 | end if; | |
52b3bcf2 | 5371 | |
047bb428 | 5372 | -- If the No_Allocators restriction is active, then only |
5373 | -- an allocator for secondary stack allocation is needed. | |
5374 | -- It's OK for such allocators to have Comes_From_Source | |
5375 | -- set to False, because gigi knows not to flag them as | |
5376 | -- being a violation of No_Implicit_Heap_Allocations. | |
5377 | ||
5378 | if Restriction_Active (No_Allocators) then | |
5379 | SS_Allocator := Heap_Allocator; | |
5380 | Heap_Allocator := Make_Null (Loc); | |
52b3bcf2 | 5381 | Pool_Allocator := Make_Null (Loc); |
047bb428 | 5382 | |
52b3bcf2 | 5383 | -- Otherwise the heap and pool allocators may be needed, |
5384 | -- so we make another allocator for secondary stack | |
5385 | -- allocation. | |
047bb428 | 5386 | |
5387 | else | |
062f0dee | 5388 | SS_Allocator := |
5389 | New_Copy_Tree | |
5390 | (Source => Heap_Allocator, | |
5391 | Scopes_In_EWA_OK => True); | |
5392 | ||
cd1a4900 | 5393 | pragma Assert (Alloc_For_BIP_Return (SS_Allocator)); |
047bb428 | 5394 | |
3ab42ff7 | 5395 | -- The heap and pool allocators are marked as |
52b3bcf2 | 5396 | -- Comes_From_Source since they correspond to an |
5397 | -- explicit user-written allocator (that is, it will | |
5398 | -- only be executed on behalf of callers that call the | |
3ab42ff7 | 5399 | -- function as initialization for such an allocator). |
5400 | -- Prevents errors when No_Implicit_Heap_Allocations | |
5401 | -- is in force. | |
047bb428 | 5402 | |
5403 | Set_Comes_From_Source (Heap_Allocator, True); | |
52b3bcf2 | 5404 | Set_Comes_From_Source (Pool_Allocator, True); |
047bb428 | 5405 | end if; |
5406 | ||
c8ea0fb4 | 5407 | -- The allocator is returned on the secondary stack |
047bb428 | 5408 | |
c8ea0fb4 | 5409 | Check_Restriction (No_Secondary_Stack, N); |
36ac5fbb | 5410 | Set_Storage_Pool (SS_Allocator, RTE (RE_SS_Pool)); |
5411 | Set_Procedure_To_Call | |
5412 | (SS_Allocator, RTE (RE_SS_Allocate)); | |
5413 | ||
5414 | -- The allocator is returned on the secondary stack, | |
5415 | -- so indicate that the function return, as well as | |
a10589ee | 5416 | -- all blocks that encloses the allocator, must not |
36ac5fbb | 5417 | -- release it. The flags must be set now because |
5418 | -- the decision to use the secondary stack is done | |
5419 | -- very late in the course of expanding the return | |
5420 | -- statement, past the point where these flags are | |
5421 | -- normally set. | |
5422 | ||
f1cabbf4 | 5423 | Set_Uses_Sec_Stack (Func_Id); |
36ac5fbb | 5424 | Set_Uses_Sec_Stack (Return_Statement_Entity (N)); |
a10589ee | 5425 | Set_Sec_Stack_Needed_For_Return |
5426 | (Return_Statement_Entity (N)); | |
5427 | Set_Enclosing_Sec_Stack_Return (N); | |
047bb428 | 5428 | |
77b577f9 | 5429 | -- Guard against poor expansion on the caller side by |
5430 | -- using a raise statement to catch out-of-range values | |
5431 | -- of formal parameter BIP_Alloc_Form. | |
5432 | ||
5433 | if Exceptions_OK then | |
5434 | Guard_Except := | |
5435 | Make_Raise_Program_Error (Loc, | |
5436 | Reason => PE_Build_In_Place_Mismatch); | |
5437 | else | |
5438 | Guard_Except := Make_Null_Statement (Loc); | |
5439 | end if; | |
5440 | ||
047bb428 | 5441 | -- Create an if statement to test the BIP_Alloc_Form |
5442 | -- formal and initialize the access object to either the | |
52b3bcf2 | 5443 | -- BIP_Object_Access formal (BIP_Alloc_Form = |
5444 | -- Caller_Allocation), the result of allocating the | |
5445 | -- object in the secondary stack (BIP_Alloc_Form = | |
5446 | -- Secondary_Stack), or else an allocator to create the | |
5447 | -- return object in the heap or user-defined pool | |
5448 | -- (BIP_Alloc_Form = Global_Heap or User_Storage_Pool). | |
047bb428 | 5449 | |
5450 | -- ??? An unchecked type conversion must be made in the | |
5451 | -- case of assigning the access object formal to the | |
5452 | -- local access object, because a normal conversion would | |
5453 | -- be illegal in some cases (such as converting access- | |
5454 | -- to-unconstrained to access-to-constrained), but the | |
5455 | -- the unchecked conversion will presumably fail to work | |
5456 | -- right in just such cases. It's not clear at all how to | |
5457 | -- handle this. ??? | |
5458 | ||
5459 | Alloc_If_Stmt := | |
5460 | Make_If_Statement (Loc, | |
bb3b440a | 5461 | Condition => |
047bb428 | 5462 | Make_Op_Eq (Loc, |
b3190af0 | 5463 | Left_Opnd => |
83c6c069 | 5464 | New_Occurrence_Of (Obj_Alloc_Formal, Loc), |
047bb428 | 5465 | Right_Opnd => |
5466 | Make_Integer_Literal (Loc, | |
5467 | UI_From_Int (BIP_Allocation_Form'Pos | |
5468 | (Caller_Allocation)))), | |
bb3b440a | 5469 | |
5470 | Then_Statements => New_List ( | |
5471 | Make_Assignment_Statement (Loc, | |
b3190af0 | 5472 | Name => |
83c6c069 | 5473 | New_Occurrence_Of (Alloc_Obj_Id, Loc), |
bb3b440a | 5474 | Expression => |
5475 | Make_Unchecked_Type_Conversion (Loc, | |
5476 | Subtype_Mark => | |
83c6c069 | 5477 | New_Occurrence_Of (Ref_Type, Loc), |
b3190af0 | 5478 | Expression => |
f1cabbf4 | 5479 | New_Occurrence_Of (Obj_Acc_Formal, Loc)))), |
bb3b440a | 5480 | |
5481 | Elsif_Parts => New_List ( | |
5482 | Make_Elsif_Part (Loc, | |
5483 | Condition => | |
5484 | Make_Op_Eq (Loc, | |
b3190af0 | 5485 | Left_Opnd => |
83c6c069 | 5486 | New_Occurrence_Of (Obj_Alloc_Formal, Loc), |
bb3b440a | 5487 | Right_Opnd => |
5488 | Make_Integer_Literal (Loc, | |
5489 | UI_From_Int (BIP_Allocation_Form'Pos | |
047bb428 | 5490 | (Secondary_Stack)))), |
bb3b440a | 5491 | |
5492 | Then_Statements => New_List ( | |
5493 | Make_Assignment_Statement (Loc, | |
b3190af0 | 5494 | Name => |
83c6c069 | 5495 | New_Occurrence_Of (Alloc_Obj_Id, Loc), |
52b3bcf2 | 5496 | Expression => SS_Allocator))), |
5497 | ||
5498 | Make_Elsif_Part (Loc, | |
5499 | Condition => | |
5500 | Make_Op_Eq (Loc, | |
5501 | Left_Opnd => | |
83c6c069 | 5502 | New_Occurrence_Of (Obj_Alloc_Formal, Loc), |
52b3bcf2 | 5503 | Right_Opnd => |
5504 | Make_Integer_Literal (Loc, | |
5505 | UI_From_Int (BIP_Allocation_Form'Pos | |
5506 | (Global_Heap)))), | |
5507 | ||
5508 | Then_Statements => New_List ( | |
36c80e26 | 5509 | Build_Heap_Or_Pool_Allocator |
52b3bcf2 | 5510 | (Temp_Id => Alloc_Obj_Id, |
5511 | Temp_Typ => Ref_Type, | |
f1cabbf4 | 5512 | Func_Id => Func_Id, |
5513 | Ret_Typ => Ret_Obj_Typ, | |
026dbb2e | 5514 | Alloc_Expr => Heap_Allocator))), |
5515 | ||
5516 | -- ???If all is well, we can put the following | |
5517 | -- 'elsif' in the 'else', but this is a useful | |
5518 | -- self-check in case caller and callee don't agree | |
5519 | -- on whether BIPAlloc and so on should be passed. | |
5520 | ||
5521 | Make_Elsif_Part (Loc, | |
5522 | Condition => | |
5523 | Make_Op_Eq (Loc, | |
5524 | Left_Opnd => | |
5525 | New_Occurrence_Of (Obj_Alloc_Formal, Loc), | |
5526 | Right_Opnd => | |
5527 | Make_Integer_Literal (Loc, | |
5528 | UI_From_Int (BIP_Allocation_Form'Pos | |
5529 | (User_Storage_Pool)))), | |
5530 | ||
5531 | Then_Statements => New_List ( | |
5532 | Pool_Decl, | |
36c80e26 | 5533 | Build_Heap_Or_Pool_Allocator |
026dbb2e | 5534 | (Temp_Id => Alloc_Obj_Id, |
5535 | Temp_Typ => Ref_Type, | |
5536 | Func_Id => Func_Id, | |
5537 | Ret_Typ => Ret_Obj_Typ, | |
5538 | Alloc_Expr => Pool_Allocator)))), | |
5539 | ||
5540 | -- Raise Program_Error if it's none of the above; | |
2f38e956 | 5541 | -- this is a compiler bug. |
bb3b440a | 5542 | |
77b577f9 | 5543 | Else_Statements => New_List (Guard_Except)); |
047bb428 | 5544 | |
5545 | -- If a separate initialization assignment was created | |
5546 | -- earlier, append that following the assignment of the | |
5547 | -- implicit access formal to the access object, to ensure | |
8fc2605c | 5548 | -- that the return object is initialized in that case. In |
5549 | -- this situation, the target of the assignment must be | |
5550 | -- rewritten to denote a dereference of the access to the | |
5551 | -- return object passed in by the caller. | |
047bb428 | 5552 | |
5553 | if Present (Init_Assignment) then | |
5554 | Rewrite (Name (Init_Assignment), | |
5555 | Make_Explicit_Dereference (Loc, | |
83c6c069 | 5556 | Prefix => New_Occurrence_Of (Alloc_Obj_Id, Loc))); |
156d2484 | 5557 | pragma Assert |
5558 | (Assignment_OK | |
5559 | (Original_Node (Name (Init_Assignment)))); | |
5560 | Set_Assignment_OK (Name (Init_Assignment)); | |
bb3b440a | 5561 | |
f1cabbf4 | 5562 | Set_Etype (Name (Init_Assignment), Etype (Ret_Obj_Id)); |
047bb428 | 5563 | |
5564 | Append_To | |
b3190af0 | 5565 | (Then_Statements (Alloc_If_Stmt), Init_Assignment); |
047bb428 | 5566 | end if; |
5567 | ||
bb3b440a | 5568 | Insert_Before (Ret_Obj_Decl, Alloc_If_Stmt); |
047bb428 | 5569 | |
5570 | -- Remember the local access object for use in the | |
5571 | -- dereference of the renaming created below. | |
5572 | ||
f1cabbf4 | 5573 | Obj_Acc_Formal := Alloc_Obj_Id; |
047bb428 | 5574 | end; |
5575 | end if; | |
5576 | ||
5577 | -- Replace the return object declaration with a renaming of a | |
5578 | -- dereference of the access value designating the return | |
5579 | -- object. | |
5580 | ||
5581 | Obj_Acc_Deref := | |
5582 | Make_Explicit_Dereference (Loc, | |
f1cabbf4 | 5583 | Prefix => New_Occurrence_Of (Obj_Acc_Formal, Loc)); |
047bb428 | 5584 | |
bb3b440a | 5585 | Rewrite (Ret_Obj_Decl, |
047bb428 | 5586 | Make_Object_Renaming_Declaration (Loc, |
f1cabbf4 | 5587 | Defining_Identifier => Ret_Obj_Id, |
b3190af0 | 5588 | Access_Definition => Empty, |
f1cabbf4 | 5589 | Subtype_Mark => New_Occurrence_Of (Ret_Obj_Typ, Loc), |
b3190af0 | 5590 | Name => Obj_Acc_Deref)); |
047bb428 | 5591 | |
f1cabbf4 | 5592 | Set_Renamed_Object (Ret_Obj_Id, Obj_Acc_Deref); |
047bb428 | 5593 | end; |
5594 | end if; | |
5595 | ||
5596 | -- Case where we do not build a block | |
5597 | ||
5598 | else | |
bb3b440a | 5599 | -- We're about to drop Return_Object_Declarations on the floor, so |
5600 | -- we need to insert it, in case it got expanded into useful code. | |
047bb428 | 5601 | -- Remove side effects from expression, which may be duplicated in |
5602 | -- subsequent checks (see Expand_Simple_Function_Return). | |
5603 | ||
bb3b440a | 5604 | Insert_List_Before (N, Return_Object_Declarations (N)); |
047bb428 | 5605 | Remove_Side_Effects (Exp); |
5606 | ||
5607 | -- Build simple_return_statement that returns the expression directly | |
5608 | ||
bb3b440a | 5609 | Return_Stmt := Make_Simple_Return_Statement (Loc, Expression => Exp); |
5610 | Result := Return_Stmt; | |
047bb428 | 5611 | end if; |
5612 | ||
5613 | -- Set the flag to prevent infinite recursion | |
5614 | ||
bb3b440a | 5615 | Set_Comes_From_Extended_Return_Statement (Return_Stmt); |
047bb428 | 5616 | |
5617 | Rewrite (N, Result); | |
80012fc8 | 5618 | |
5619 | declare | |
5620 | T : constant Entity_Id := Etype (Ret_Obj_Id); | |
5621 | begin | |
5622 | Analyze (N, Suppress => All_Checks); | |
5623 | ||
5624 | -- In some cases, analysis of N can set the Etype of an N_Identifier | |
5625 | -- to a subtype of the Etype of the Entity of the N_Identifier, which | |
5626 | -- gigi doesn't like. Reset the Etypes correctly here. | |
5627 | ||
5628 | if Nkind (Expression (Return_Stmt)) = N_Identifier | |
5629 | and then Entity (Expression (Return_Stmt)) = Ret_Obj_Id | |
5630 | then | |
5631 | Set_Etype (Ret_Obj_Id, T); | |
5632 | Set_Etype (Expression (Return_Stmt), T); | |
5633 | end if; | |
5634 | end; | |
047bb428 | 5635 | end Expand_N_Extended_Return_Statement; |
5636 | ||
ee6ba406 | 5637 | ---------------------------- |
5638 | -- Expand_N_Function_Call -- | |
5639 | ---------------------------- | |
5640 | ||
5641 | procedure Expand_N_Function_Call (N : Node_Id) is | |
ee6ba406 | 5642 | begin |
d34432fa | 5643 | Expand_Call (N); |
ee6ba406 | 5644 | end Expand_N_Function_Call; |
5645 | ||
5646 | --------------------------------------- | |
5647 | -- Expand_N_Procedure_Call_Statement -- | |
5648 | --------------------------------------- | |
5649 | ||
5650 | procedure Expand_N_Procedure_Call_Statement (N : Node_Id) is | |
5651 | begin | |
30f8d103 | 5652 | Expand_Call (N); |
ee6ba406 | 5653 | end Expand_N_Procedure_Call_Statement; |
5654 | ||
047bb428 | 5655 | -------------------------------------- |
5656 | -- Expand_N_Simple_Return_Statement -- | |
5657 | -------------------------------------- | |
5658 | ||
5659 | procedure Expand_N_Simple_Return_Statement (N : Node_Id) is | |
5660 | begin | |
5661 | -- Defend against previous errors (i.e. the return statement calls a | |
5662 | -- function that is not available in configurable runtime). | |
5663 | ||
5664 | if Present (Expression (N)) | |
5665 | and then Nkind (Expression (N)) = N_Empty | |
5666 | then | |
dba36b60 | 5667 | Check_Error_Detected; |
047bb428 | 5668 | return; |
5669 | end if; | |
5670 | ||
5671 | -- Distinguish the function and non-function cases: | |
5672 | ||
5673 | case Ekind (Return_Applies_To (Return_Statement_Entity (N))) is | |
99378362 | 5674 | when E_Function |
5675 | | E_Generic_Function | |
5676 | => | |
047bb428 | 5677 | Expand_Simple_Function_Return (N); |
5678 | ||
99378362 | 5679 | when E_Entry |
5680 | | E_Entry_Family | |
5681 | | E_Generic_Procedure | |
5682 | | E_Procedure | |
5683 | | E_Return_Statement | |
5684 | => | |
047bb428 | 5685 | Expand_Non_Function_Return (N); |
5686 | ||
5687 | when others => | |
5688 | raise Program_Error; | |
5689 | end case; | |
5690 | ||
5691 | exception | |
5692 | when RE_Not_Available => | |
5693 | return; | |
5694 | end Expand_N_Simple_Return_Statement; | |
5695 | ||
ee6ba406 | 5696 | ------------------------------ |
5697 | -- Expand_N_Subprogram_Body -- | |
5698 | ------------------------------ | |
5699 | ||
ed1c90f6 | 5700 | -- Add poll call if ATC polling is enabled, unless the body will be inlined |
5701 | -- by the back-end. | |
ee6ba406 | 5702 | |
4907451e | 5703 | -- Add dummy push/pop label nodes at start and end to clear any local |
ed1c90f6 | 5704 | -- exception indications if local-exception-to-goto optimization is active. |
4907451e | 5705 | |
ba40b4af | 5706 | -- Add return statement if last statement in body is not a return statement |
5707 | -- (this makes things easier on Gigi which does not want to have to handle | |
5708 | -- a missing return). | |
ee6ba406 | 5709 | |
5710 | -- Add call to Activate_Tasks if body is a task activator | |
5711 | ||
5712 | -- Deal with possible detection of infinite recursion | |
5713 | ||
5714 | -- Eliminate body completely if convention stubbed | |
5715 | ||
5716 | -- Encode entity names within body, since we will not need to reference | |
5717 | -- these entities any longer in the front end. | |
5718 | ||
5719 | -- Initialize scalar out parameters if Initialize/Normalize_Scalars | |
5720 | ||
6af1bdbc | 5721 | -- Reset Pure indication if any parameter has root type System.Address |
fe2a1ea0 | 5722 | -- or has any parameters of limited types, where limited means that the |
5723 | -- run-time view is limited (i.e. the full type is limited). | |
6af1bdbc | 5724 | |
cafd02b3 | 5725 | -- Wrap thread body |
5726 | ||
ee6ba406 | 5727 | procedure Expand_N_Subprogram_Body (N : Node_Id) is |
30f8d103 | 5728 | Body_Id : constant Entity_Id := Defining_Entity (N); |
5729 | HSS : constant Node_Id := Handled_Statement_Sequence (N); | |
5730 | Loc : constant Source_Ptr := Sloc (N); | |
ee6ba406 | 5731 | |
41a8d10f | 5732 | procedure Add_Return (Spec_Id : Entity_Id; Stmts : List_Id); |
5733 | -- Append a return statement to the statement sequence Stmts if the last | |
5734 | -- statement is not already a return or a goto statement. Note that the | |
5735 | -- latter test is not critical, it does not matter if we add a few extra | |
5736 | -- returns, since they get eliminated anyway later on. Spec_Id denotes | |
5737 | -- the corresponding spec of the subprogram body. | |
5738 | ||
ee6ba406 | 5739 | ---------------- |
5740 | -- Add_Return -- | |
5741 | ---------------- | |
5742 | ||
41a8d10f | 5743 | procedure Add_Return (Spec_Id : Entity_Id; Stmts : List_Id) is |
ed695684 | 5744 | Last_Stmt : Node_Id; |
5745 | Loc : Source_Ptr; | |
5746 | Stmt : Node_Id; | |
cafd02b3 | 5747 | |
5748 | begin | |
4907451e | 5749 | -- Get last statement, ignoring any Pop_xxx_Label nodes, which are |
5750 | -- not relevant in this context since they are not executable. | |
cafd02b3 | 5751 | |
41a8d10f | 5752 | Last_Stmt := Last (Stmts); |
ed695684 | 5753 | while Nkind (Last_Stmt) in N_Pop_xxx_Label loop |
5754 | Prev (Last_Stmt); | |
4907451e | 5755 | end loop; |
cafd02b3 | 5756 | |
4907451e | 5757 | -- Now insert return unless last statement is a transfer |
cafd02b3 | 5758 | |
ed695684 | 5759 | if not Is_Transfer (Last_Stmt) then |
cafd02b3 | 5760 | |
4907451e | 5761 | -- The source location for the return is the end label of the |
5762 | -- procedure if present. Otherwise use the sloc of the last | |
5763 | -- statement in the list. If the list comes from a generated | |
5764 | -- exception handler and we are not debugging generated code, | |
5765 | -- all the statements within the handler are made invisible | |
5766 | -- to the debugger. | |
cafd02b3 | 5767 | |
41a8d10f | 5768 | if Nkind (Parent (Stmts)) = N_Exception_Handler |
5769 | and then not Comes_From_Source (Parent (Stmts)) | |
4907451e | 5770 | then |
ed695684 | 5771 | Loc := Sloc (Last_Stmt); |
f9e26ff7 | 5772 | elsif Present (End_Label (HSS)) then |
5773 | Loc := Sloc (End_Label (HSS)); | |
4907451e | 5774 | else |
ed695684 | 5775 | Loc := Sloc (Last_Stmt); |
4907451e | 5776 | end if; |
cafd02b3 | 5777 | |
ed695684 | 5778 | -- Append return statement, and set analyzed manually. We can't |
5779 | -- call Analyze on this return since the scope is wrong. | |
53f083ab | 5780 | |
ed695684 | 5781 | -- Note: it almost works to push the scope and then do the Analyze |
5782 | -- call, but something goes wrong in some weird cases and it is | |
5783 | -- not worth worrying about ??? | |
53f083ab | 5784 | |
ed695684 | 5785 | Stmt := Make_Simple_Return_Statement (Loc); |
53f083ab | 5786 | |
ed695684 | 5787 | -- The return statement is handled properly, and the call to the |
5788 | -- postcondition, inserted below, does not require information | |
5789 | -- from the body either. However, that call is analyzed in the | |
5790 | -- enclosing scope, and an elaboration check might improperly be | |
5791 | -- added to it. A guard in Sem_Elab is needed to prevent that | |
5792 | -- spurious check, see Check_Elab_Call. | |
dae843bc | 5793 | |
41a8d10f | 5794 | Append_To (Stmts, Stmt); |
ed695684 | 5795 | Set_Analyzed (Stmt); |
53f083ab | 5796 | |
ed695684 | 5797 | -- Call the _Postconditions procedure if the related subprogram |
5798 | -- has contract assertions that need to be verified on exit. | |
53f083ab | 5799 | |
ed695684 | 5800 | if Ekind (Spec_Id) = E_Procedure |
5801 | and then Present (Postconditions_Proc (Spec_Id)) | |
5802 | then | |
5803 | Insert_Action (Stmt, | |
5804 | Make_Procedure_Call_Statement (Loc, | |
5805 | Name => | |
5806 | New_Occurrence_Of (Postconditions_Proc (Spec_Id), Loc))); | |
5807 | end if; | |
cafd02b3 | 5808 | end if; |
4907451e | 5809 | end Add_Return; |
cafd02b3 | 5810 | |
d48649eb | 5811 | -- Local variables |
f9e26ff7 | 5812 | |
41a8d10f | 5813 | Except_H : Node_Id; |
5814 | L : List_Id; | |
5815 | Spec_Id : Entity_Id; | |
5816 | ||
ee6ba406 | 5817 | -- Start of processing for Expand_N_Subprogram_Body |
5818 | ||
5819 | begin | |
30f8d103 | 5820 | if Present (Corresponding_Spec (N)) then |
5821 | Spec_Id := Corresponding_Spec (N); | |
5822 | else | |
5823 | Spec_Id := Body_Id; | |
5824 | end if; | |
f9e26ff7 | 5825 | |
c4462fa4 | 5826 | -- If this is a Pure function which has any parameters whose root type |
5827 | -- is System.Address, reset the Pure indication. | |
5828 | -- This check is also performed when the subprogram is frozen, but we | |
5829 | -- repeat it on the body so that the indication is consistent, and so | |
5830 | -- it applies as well to bodies without separate specifications. | |
5831 | ||
5832 | if Is_Pure (Spec_Id) | |
5833 | and then Is_Subprogram (Spec_Id) | |
5834 | and then not Has_Pragma_Pure_Function (Spec_Id) | |
5835 | then | |
5836 | Check_Function_With_Address_Parameter (Spec_Id); | |
5837 | ||
5838 | if Spec_Id /= Body_Id then | |
5839 | Set_Is_Pure (Body_Id, Is_Pure (Spec_Id)); | |
5840 | end if; | |
5841 | end if; | |
5842 | ||
ed1c90f6 | 5843 | -- Set L to either the list of declarations if present, or to the list |
5844 | -- of statements if no declarations are present. This is used to insert | |
5845 | -- new stuff at the start. | |
ee6ba406 | 5846 | |
5847 | if Is_Non_Empty_List (Declarations (N)) then | |
5848 | L := Declarations (N); | |
5849 | else | |
f9e26ff7 | 5850 | L := Statements (HSS); |
4907451e | 5851 | end if; |
5852 | ||
5853 | -- If local-exception-to-goto optimization active, insert dummy push | |
8f979dbe | 5854 | -- statements at start, and dummy pop statements at end, but inhibit |
5855 | -- this if we have No_Exception_Handlers, since they are useless and | |
32ed0eeb | 5856 | -- interfere with analysis, e.g. by CodePeer. We also don't need these |
5857 | -- if we're unnesting subprograms because the only purpose of these | |
5858 | -- nodes is to ensure we don't set a label in one subprogram and branch | |
5859 | -- to it in another. | |
4907451e | 5860 | |
5861 | if (Debug_Flag_Dot_G | |
5862 | or else Restriction_Active (No_Exception_Propagation)) | |
8f979dbe | 5863 | and then not Restriction_Active (No_Exception_Handlers) |
5864 | and then not CodePeer_Mode | |
32ed0eeb | 5865 | and then not Unnest_Subprogram_Mode |
4907451e | 5866 | and then Is_Non_Empty_List (L) |
5867 | then | |
5868 | declare | |
5869 | FS : constant Node_Id := First (L); | |
5870 | FL : constant Source_Ptr := Sloc (FS); | |
5871 | LS : Node_Id; | |
5872 | LL : Source_Ptr; | |
5873 | ||
5874 | begin | |
5875 | -- LS points to either last statement, if statements are present | |
5876 | -- or to the last declaration if there are no statements present. | |
5877 | -- It is the node after which the pop's are generated. | |
5878 | ||
f9e26ff7 | 5879 | if Is_Non_Empty_List (Statements (HSS)) then |
5880 | LS := Last (Statements (HSS)); | |
4907451e | 5881 | else |
5882 | LS := Last (L); | |
5883 | end if; | |
5884 | ||
5885 | LL := Sloc (LS); | |
5886 | ||
5887 | Insert_List_Before_And_Analyze (FS, New_List ( | |
5888 | Make_Push_Constraint_Error_Label (FL), | |
5889 | Make_Push_Program_Error_Label (FL), | |
5890 | Make_Push_Storage_Error_Label (FL))); | |
5891 | ||
5892 | Insert_List_After_And_Analyze (LS, New_List ( | |
5893 | Make_Pop_Constraint_Error_Label (LL), | |
5894 | Make_Pop_Program_Error_Label (LL), | |
5895 | Make_Pop_Storage_Error_Label (LL))); | |
5896 | end; | |
ee6ba406 | 5897 | end if; |
5898 | ||
4907451e | 5899 | -- Need poll on entry to subprogram if polling enabled. We only do this |
5900 | -- for non-empty subprograms, since it does not seem necessary to poll | |
ed1c90f6 | 5901 | -- for a dummy null subprogram. |
44d43e97 | 5902 | |
5903 | if Is_Non_Empty_List (L) then | |
ed1c90f6 | 5904 | |
5905 | -- Do not add a polling call if the subprogram is to be inlined by | |
5906 | -- the back-end, to avoid repeated calls with multiple inlinings. | |
5907 | ||
44d43e97 | 5908 | if Is_Inlined (Spec_Id) |
5909 | and then Front_End_Inlining | |
5910 | and then Optimization_Level > 1 | |
5911 | then | |
5912 | null; | |
5913 | else | |
5914 | Generate_Poll_Call (First (L)); | |
5915 | end if; | |
5916 | end if; | |
5917 | ||
ee6ba406 | 5918 | -- Initialize any scalar OUT args if Initialize/Normalize_Scalars |
5919 | ||
5920 | if Init_Or_Norm_Scalars and then Is_Subprogram (Spec_Id) then | |
5921 | declare | |
948ef2b8 | 5922 | F : Entity_Id; |
8b013a86 | 5923 | A : Node_Id; |
ee6ba406 | 5924 | |
5925 | begin | |
ee6ba406 | 5926 | -- Loop through formals |
5927 | ||
948ef2b8 | 5928 | F := First_Formal (Spec_Id); |
ee6ba406 | 5929 | while Present (F) loop |
5930 | if Is_Scalar_Type (Etype (F)) | |
5931 | and then Ekind (F) = E_Out_Parameter | |
5932 | then | |
041aa047 | 5933 | Check_Restriction (No_Default_Initialization, F); |
5934 | ||
578f27c9 | 5935 | -- Insert the initialization. We turn off validity checks |
5936 | -- for this assignment, since we do not want any check on | |
5937 | -- the initial value itself (which may well be invalid). | |
8b013a86 | 5938 | -- Predicate checks are disabled as well (RM 6.4.1 (13/3)) |
578f27c9 | 5939 | |
ed695684 | 5940 | A := |
5941 | Make_Assignment_Statement (Loc, | |
578f27c9 | 5942 | Name => New_Occurrence_Of (F, Loc), |
8b013a86 | 5943 | Expression => Get_Simple_Init_Val (Etype (F), N)); |
5944 | Set_Suppress_Assignment_Checks (A); | |
5945 | ||
5946 | Insert_Before_And_Analyze (First (L), | |
5947 | A, Suppress => Validity_Check); | |
ee6ba406 | 5948 | end if; |
5949 | ||
5950 | Next_Formal (F); | |
5951 | end loop; | |
ee6ba406 | 5952 | end; |
5953 | end if; | |
5954 | ||
5955 | -- Clear out statement list for stubbed procedure | |
5956 | ||
5957 | if Present (Corresponding_Spec (N)) then | |
5958 | Set_Elaboration_Flag (N, Spec_Id); | |
5959 | ||
5960 | if Convention (Spec_Id) = Convention_Stubbed | |
5961 | or else Is_Eliminated (Spec_Id) | |
5962 | then | |
5963 | Set_Declarations (N, Empty_List); | |
5964 | Set_Handled_Statement_Sequence (N, | |
5965 | Make_Handled_Sequence_Of_Statements (Loc, | |
b3190af0 | 5966 | Statements => New_List (Make_Null_Statement (Loc)))); |
f9e26ff7 | 5967 | |
ee6ba406 | 5968 | return; |
5969 | end if; | |
5970 | end if; | |
5971 | ||
041aa047 | 5972 | -- Create a set of discriminals for the next protected subprogram body |
5973 | ||
5974 | if Is_List_Member (N) | |
5975 | and then Present (Parent (List_Containing (N))) | |
5976 | and then Nkind (Parent (List_Containing (N))) = N_Protected_Body | |
5977 | and then Present (Next_Protected_Operation (N)) | |
5978 | then | |
5979 | Set_Discriminals (Parent (Base_Type (Scope (Spec_Id)))); | |
5980 | end if; | |
5981 | ||
ed1c90f6 | 5982 | -- Returns_By_Ref flag is normally set when the subprogram is frozen but |
5983 | -- subprograms with no specs are not frozen. | |
ee6ba406 | 5984 | |
5985 | declare | |
5986 | Typ : constant Entity_Id := Etype (Spec_Id); | |
5987 | Utyp : constant Entity_Id := Underlying_Type (Typ); | |
5988 | ||
5989 | begin | |
1e0f1e8e | 5990 | if Is_Limited_View (Typ) then |
ee6ba406 | 5991 | Set_Returns_By_Ref (Spec_Id); |
5992 | ||
45851103 | 5993 | elsif Present (Utyp) and then CW_Or_Has_Controlled_Part (Utyp) then |
ee6ba406 | 5994 | Set_Returns_By_Ref (Spec_Id); |
5995 | end if; | |
5996 | end; | |
5997 | ||
ed1c90f6 | 5998 | -- For a procedure, we add a return for all possible syntactic ends of |
5999 | -- the subprogram. | |
ee6ba406 | 6000 | |
6cd460aa | 6001 | if Ekind_In (Spec_Id, E_Procedure, E_Generic_Procedure) then |
41a8d10f | 6002 | Add_Return (Spec_Id, Statements (HSS)); |
ee6ba406 | 6003 | |
f9e26ff7 | 6004 | if Present (Exception_Handlers (HSS)) then |
6005 | Except_H := First_Non_Pragma (Exception_Handlers (HSS)); | |
ee6ba406 | 6006 | while Present (Except_H) loop |
41a8d10f | 6007 | Add_Return (Spec_Id, Statements (Except_H)); |
ee6ba406 | 6008 | Next_Non_Pragma (Except_H); |
6009 | end loop; | |
6010 | end if; | |
6011 | ||
f4d93199 | 6012 | -- For a function, we must deal with the case where there is at least |
6013 | -- one missing return. What we do is to wrap the entire body of the | |
6014 | -- function in a block: | |
ee6ba406 | 6015 | |
6016 | -- begin | |
6017 | -- ... | |
6018 | -- end; | |
6019 | ||
6020 | -- becomes | |
6021 | ||
6022 | -- begin | |
6023 | -- begin | |
6024 | -- ... | |
6025 | -- end; | |
6026 | ||
6027 | -- raise Program_Error; | |
6028 | -- end; | |
6029 | ||
ed1c90f6 | 6030 | -- This approach is necessary because the raise must be signalled to the |
6031 | -- caller, not handled by any local handler (RM 6.4(11)). | |
ee6ba406 | 6032 | |
ed1c90f6 | 6033 | -- Note: we do not need to analyze the constructed sequence here, since |
6034 | -- it has no handler, and an attempt to analyze the handled statement | |
6035 | -- sequence twice is risky in various ways (e.g. the issue of expanding | |
6036 | -- cleanup actions twice). | |
ee6ba406 | 6037 | |
6038 | elsif Has_Missing_Return (Spec_Id) then | |
6039 | declare | |
f9e26ff7 | 6040 | Hloc : constant Source_Ptr := Sloc (HSS); |
ee6ba406 | 6041 | Blok : constant Node_Id := |
6042 | Make_Block_Statement (Hloc, | |
f9e26ff7 | 6043 | Handled_Statement_Sequence => HSS); |
ee6ba406 | 6044 | Rais : constant Node_Id := |
f15731c4 | 6045 | Make_Raise_Program_Error (Hloc, |
6046 | Reason => PE_Missing_Return); | |
ee6ba406 | 6047 | |
6048 | begin | |
6049 | Set_Handled_Statement_Sequence (N, | |
6050 | Make_Handled_Sequence_Of_Statements (Hloc, | |
6051 | Statements => New_List (Blok, Rais))); | |
6052 | ||
4907451e | 6053 | Push_Scope (Spec_Id); |
ee6ba406 | 6054 | Analyze (Blok); |
6055 | Analyze (Rais); | |
6056 | Pop_Scope; | |
6057 | end; | |
6058 | end if; | |
6059 | ||
ee6ba406 | 6060 | -- If subprogram contains a parameterless recursive call, then we may |
6061 | -- have an infinite recursion, so see if we can generate code to check | |
6062 | -- for this possibility if storage checks are not suppressed. | |
6063 | ||
6064 | if Ekind (Spec_Id) = E_Procedure | |
6065 | and then Has_Recursive_Call (Spec_Id) | |
6066 | and then not Storage_Checks_Suppressed (Spec_Id) | |
6067 | then | |
6068 | Detect_Infinite_Recursion (N, Spec_Id); | |
6069 | end if; | |
6070 | ||
ee6ba406 | 6071 | -- Set to encode entity names in package body before gigi is called |
6072 | ||
6073 | Qualify_Entity_Names (N); | |
7e933b61 | 6074 | |
6075 | -- If the body belongs to a nonabstract library-level source primitive | |
6076 | -- of a tagged type, install an elaboration check which ensures that a | |
6077 | -- dispatching call targeting the primitive will not execute the body | |
6078 | -- without it being previously elaborated. | |
6079 | ||
6080 | Install_Primitive_Elaboration_Check (N); | |
ee6ba406 | 6081 | end Expand_N_Subprogram_Body; |
6082 | ||
6083 | ----------------------------------- | |
6084 | -- Expand_N_Subprogram_Body_Stub -- | |
6085 | ----------------------------------- | |
6086 | ||
6087 | procedure Expand_N_Subprogram_Body_Stub (N : Node_Id) is | |
3f5a114d | 6088 | Bod : Node_Id; |
27117a58 | 6089 | |
ee6ba406 | 6090 | begin |
6091 | if Present (Corresponding_Body (N)) then | |
3f5a114d | 6092 | Bod := Unit_Declaration_Node (Corresponding_Body (N)); |
6093 | ||
6094 | -- The body may have been expanded already when it is analyzed | |
6095 | -- through the subunit node. Do no expand again: it interferes | |
6096 | -- with the construction of unnesting tables when generating C. | |
6097 | ||
6098 | if not Analyzed (Bod) then | |
6099 | Expand_N_Subprogram_Body (Bod); | |
6100 | end if; | |
6101 | ||
6102 | -- Add full qualification to entities that may be created late | |
6103 | -- during unnesting. | |
6104 | ||
6105 | Qualify_Entity_Names (N); | |
ee6ba406 | 6106 | end if; |
ee6ba406 | 6107 | end Expand_N_Subprogram_Body_Stub; |
6108 | ||
6109 | ------------------------------------- | |
6110 | -- Expand_N_Subprogram_Declaration -- | |
6111 | ------------------------------------- | |
6112 | ||
ee6ba406 | 6113 | -- If the declaration appears within a protected body, it is a private |
6114 | -- operation of the protected type. We must create the corresponding | |
6115 | -- protected subprogram an associated formals. For a normal protected | |
6116 | -- operation, this is done when expanding the protected type declaration. | |
6117 | ||
aad6babd | 6118 | -- If the declaration is for a null procedure, emit null body |
6119 | ||
ee6ba406 | 6120 | procedure Expand_N_Subprogram_Declaration (N : Node_Id) is |
41a8d10f | 6121 | Loc : constant Source_Ptr := Sloc (N); |
6122 | Subp : constant Entity_Id := Defining_Entity (N); | |
6123 | ||
41a8d10f | 6124 | -- Local variables |
6125 | ||
30f8d103 | 6126 | Scop : constant Entity_Id := Scope (Subp); |
9dfe12ae | 6127 | Prot_Bod : Node_Id; |
f9e26ff7 | 6128 | Prot_Decl : Node_Id; |
9dfe12ae | 6129 | Prot_Id : Entity_Id; |
ee6ba406 | 6130 | |
41a8d10f | 6131 | -- Start of processing for Expand_N_Subprogram_Declaration |
6132 | ||
ee6ba406 | 6133 | begin |
9eaf25fa | 6134 | -- In SPARK, subprogram declarations are only allowed in package |
6135 | -- specifications. | |
714221b0 | 6136 | |
3bf0edc6 | 6137 | if Nkind (Parent (N)) /= N_Package_Specification then |
6138 | if Nkind (Parent (N)) = N_Compilation_Unit then | |
8a1e3cde | 6139 | Check_SPARK_05_Restriction |
3bf0edc6 | 6140 | ("subprogram declaration is not a library item", N); |
6141 | ||
6142 | elsif Present (Next (N)) | |
714221b0 | 6143 | and then Nkind (Next (N)) = N_Pragma |
2af7349d | 6144 | and then Get_Pragma_Id (Next (N)) = Pragma_Import |
714221b0 | 6145 | then |
9eaf25fa | 6146 | -- In SPARK, subprogram declarations are also permitted in |
714221b0 | 6147 | -- declarative parts when immediately followed by a corresponding |
6148 | -- pragma Import. We only check here that there is some pragma | |
6149 | -- Import. | |
6150 | ||
6151 | null; | |
6152 | else | |
8a1e3cde | 6153 | Check_SPARK_05_Restriction |
3bf0edc6 | 6154 | ("subprogram declaration is not allowed here", N); |
714221b0 | 6155 | end if; |
6156 | end if; | |
6157 | ||
948ef2b8 | 6158 | -- Deal with case of protected subprogram. Do not generate protected |
6159 | -- operation if operation is flagged as eliminated. | |
ee6ba406 | 6160 | |
6161 | if Is_List_Member (N) | |
6162 | and then Present (Parent (List_Containing (N))) | |
6163 | and then Nkind (Parent (List_Containing (N))) = N_Protected_Body | |
6164 | and then Is_Protected_Type (Scop) | |
6165 | then | |
60fd8afc | 6166 | if No (Protected_Body_Subprogram (Subp)) |
6167 | and then not Is_Eliminated (Subp) | |
6168 | then | |
9dfe12ae | 6169 | Prot_Decl := |
ee6ba406 | 6170 | Make_Subprogram_Declaration (Loc, |
6171 | Specification => | |
6172 | Build_Protected_Sub_Specification | |
948ef2b8 | 6173 | (N, Scop, Unprotected_Mode)); |
ee6ba406 | 6174 | |
6175 | -- The protected subprogram is declared outside of the protected | |
6176 | -- body. Given that the body has frozen all entities so far, we | |
9dfe12ae | 6177 | -- analyze the subprogram and perform freezing actions explicitly. |
236f09e1 | 6178 | -- including the generation of an explicit freeze node, to ensure |
6179 | -- that gigi has the proper order of elaboration. | |
9dfe12ae | 6180 | -- If the body is a subunit, the insertion point is before the |
6181 | -- stub in the parent. | |
ee6ba406 | 6182 | |
6183 | Prot_Bod := Parent (List_Containing (N)); | |
6184 | ||
6185 | if Nkind (Parent (Prot_Bod)) = N_Subunit then | |
6186 | Prot_Bod := Corresponding_Stub (Parent (Prot_Bod)); | |
6187 | end if; | |
6188 | ||
9dfe12ae | 6189 | Insert_Before (Prot_Bod, Prot_Decl); |
6190 | Prot_Id := Defining_Unit_Name (Specification (Prot_Decl)); | |
236f09e1 | 6191 | Set_Has_Delayed_Freeze (Prot_Id); |
ee6ba406 | 6192 | |
4907451e | 6193 | Push_Scope (Scope (Scop)); |
9dfe12ae | 6194 | Analyze (Prot_Decl); |
59d0f0f2 | 6195 | Freeze_Before (N, Prot_Id); |
9dfe12ae | 6196 | Set_Protected_Body_Subprogram (Subp, Prot_Id); |
4606d5a9 | 6197 | |
6198 | -- Create protected operation as well. Even though the operation | |
6199 | -- is only accessible within the body, it is possible to make it | |
6200 | -- available outside of the protected object by using 'Access to | |
86ab3fb8 | 6201 | -- provide a callback, so build protected version in all cases. |
4606d5a9 | 6202 | |
6203 | Prot_Decl := | |
86ab3fb8 | 6204 | Make_Subprogram_Declaration (Loc, |
6205 | Specification => | |
6206 | Build_Protected_Sub_Specification (N, Scop, Protected_Mode)); | |
4606d5a9 | 6207 | Insert_Before (Prot_Bod, Prot_Decl); |
6208 | Analyze (Prot_Decl); | |
6209 | ||
ee6ba406 | 6210 | Pop_Scope; |
6211 | end if; | |
aad6babd | 6212 | |
8fc2605c | 6213 | -- Ada 2005 (AI-348): Generate body for a null procedure. In most |
6214 | -- cases this is superfluous because calls to it will be automatically | |
6215 | -- inlined, but we definitely need the body if preconditions for the | |
2fa03fa9 | 6216 | -- procedure are present, or if performing coverage analysis. |
578f27c9 | 6217 | |
aad6babd | 6218 | elsif Nkind (Specification (N)) = N_Procedure_Specification |
6219 | and then Null_Present (Specification (N)) | |
6220 | then | |
6221 | declare | |
55bf42ad | 6222 | Bod : constant Node_Id := Body_To_Inline (N); |
1680f245 | 6223 | |
aad6babd | 6224 | begin |
55bf42ad | 6225 | Set_Has_Completion (Subp, False); |
6226 | Append_Freeze_Action (Subp, Bod); | |
586402e1 | 6227 | |
55bf42ad | 6228 | -- The body now contains raise statements, so calls to it will |
6229 | -- not be inlined. | |
586402e1 | 6230 | |
55bf42ad | 6231 | Set_Is_Inlined (Subp, False); |
aad6babd | 6232 | end; |
ee6ba406 | 6233 | end if; |
41a8d10f | 6234 | |
6235 | -- When generating C code, transform a function that returns a | |
6236 | -- constrained array type into a procedure with an out parameter | |
6237 | -- that carries the return value. | |
6238 | ||
adf9e48c | 6239 | -- We skip this transformation for unchecked conversions, since they |
6240 | -- are not needed by the C generator (and this also produces cleaner | |
6241 | -- output). | |
6242 | ||
41a8d10f | 6243 | if Modify_Tree_For_C |
6244 | and then Nkind (Specification (N)) = N_Function_Specification | |
6245 | and then Is_Array_Type (Etype (Subp)) | |
6246 | and then Is_Constrained (Etype (Subp)) | |
adf9e48c | 6247 | and then not Is_Unchecked_Conversion_Instance (Subp) |
41a8d10f | 6248 | then |
b0e188fe | 6249 | Build_Procedure_Form (N); |
41a8d10f | 6250 | end if; |
ee6ba406 | 6251 | end Expand_N_Subprogram_Declaration; |
6252 | ||
047bb428 | 6253 | -------------------------------- |
6254 | -- Expand_Non_Function_Return -- | |
6255 | -------------------------------- | |
6256 | ||
6257 | procedure Expand_Non_Function_Return (N : Node_Id) is | |
6258 | pragma Assert (No (Expression (N))); | |
6259 | ||
ed695684 | 6260 | Loc : constant Source_Ptr := Sloc (N); |
6261 | Scope_Id : Entity_Id := Return_Applies_To (Return_Statement_Entity (N)); | |
6262 | Kind : constant Entity_Kind := Ekind (Scope_Id); | |
6263 | Call : Node_Id; | |
6264 | Acc_Stat : Node_Id; | |
6265 | Goto_Stat : Node_Id; | |
6266 | Lab_Node : Node_Id; | |
047bb428 | 6267 | |
6268 | begin | |
ed695684 | 6269 | -- Call the _Postconditions procedure if the related subprogram has |
6270 | -- contract assertions that need to be verified on exit. | |
6271 | ||
6272 | if Ekind_In (Scope_Id, E_Entry, E_Entry_Family, E_Procedure) | |
6273 | and then Present (Postconditions_Proc (Scope_Id)) | |
047bb428 | 6274 | then |
047bb428 | 6275 | Insert_Action (N, |
6276 | Make_Procedure_Call_Statement (Loc, | |
ed695684 | 6277 | Name => New_Occurrence_Of (Postconditions_Proc (Scope_Id), Loc))); |
047bb428 | 6278 | end if; |
6279 | ||
6280 | -- If it is a return from a procedure do no extra steps | |
6281 | ||
6282 | if Kind = E_Procedure or else Kind = E_Generic_Procedure then | |
6283 | return; | |
6284 | ||
6285 | -- If it is a nested return within an extended one, replace it with a | |
6286 | -- return of the previously declared return object. | |
6287 | ||
6288 | elsif Kind = E_Return_Statement then | |
6289 | Rewrite (N, | |
6290 | Make_Simple_Return_Statement (Loc, | |
6291 | Expression => | |
6292 | New_Occurrence_Of (First_Entity (Scope_Id), Loc))); | |
6293 | Set_Comes_From_Extended_Return_Statement (N); | |
6294 | Set_Return_Statement_Entity (N, Scope_Id); | |
6295 | Expand_Simple_Function_Return (N); | |
6296 | return; | |
6297 | end if; | |
6298 | ||
6299 | pragma Assert (Is_Entry (Scope_Id)); | |
6300 | ||
6301 | -- Look at the enclosing block to see whether the return is from an | |
6302 | -- accept statement or an entry body. | |
6303 | ||
6304 | for J in reverse 0 .. Scope_Stack.Last loop | |
6305 | Scope_Id := Scope_Stack.Table (J).Entity; | |
6306 | exit when Is_Concurrent_Type (Scope_Id); | |
6307 | end loop; | |
6308 | ||
6309 | -- If it is a return from accept statement it is expanded as call to | |
6310 | -- RTS Complete_Rendezvous and a goto to the end of the accept body. | |
6311 | ||
6312 | -- (cf : Expand_N_Accept_Statement, Expand_N_Selective_Accept, | |
6313 | -- Expand_N_Accept_Alternative in exp_ch9.adb) | |
6314 | ||
6315 | if Is_Task_Type (Scope_Id) then | |
6316 | ||
6317 | Call := | |
6318 | Make_Procedure_Call_Statement (Loc, | |
83c6c069 | 6319 | Name => New_Occurrence_Of (RTE (RE_Complete_Rendezvous), Loc)); |
047bb428 | 6320 | Insert_Before (N, Call); |
6321 | -- why not insert actions here??? | |
6322 | Analyze (Call); | |
6323 | ||
6324 | Acc_Stat := Parent (N); | |
6325 | while Nkind (Acc_Stat) /= N_Accept_Statement loop | |
6326 | Acc_Stat := Parent (Acc_Stat); | |
6327 | end loop; | |
6328 | ||
6329 | Lab_Node := Last (Statements | |
6330 | (Handled_Statement_Sequence (Acc_Stat))); | |
6331 | ||
6332 | Goto_Stat := Make_Goto_Statement (Loc, | |
6333 | Name => New_Occurrence_Of | |
6334 | (Entity (Identifier (Lab_Node)), Loc)); | |
6335 | ||
6336 | Set_Analyzed (Goto_Stat); | |
6337 | ||
6338 | Rewrite (N, Goto_Stat); | |
6339 | Analyze (N); | |
6340 | ||
6341 | -- If it is a return from an entry body, put a Complete_Entry_Body call | |
6342 | -- in front of the return. | |
6343 | ||
6344 | elsif Is_Protected_Type (Scope_Id) then | |
6345 | Call := | |
6346 | Make_Procedure_Call_Statement (Loc, | |
6347 | Name => | |
83c6c069 | 6348 | New_Occurrence_Of (RTE (RE_Complete_Entry_Body), Loc), |
047bb428 | 6349 | Parameter_Associations => New_List ( |
6350 | Make_Attribute_Reference (Loc, | |
b3190af0 | 6351 | Prefix => |
83c6c069 | 6352 | New_Occurrence_Of |
047bb428 | 6353 | (Find_Protection_Object (Current_Scope), Loc), |
b3190af0 | 6354 | Attribute_Name => Name_Unchecked_Access))); |
047bb428 | 6355 | |
6356 | Insert_Before (N, Call); | |
6357 | Analyze (Call); | |
6358 | end if; | |
6359 | end Expand_Non_Function_Return; | |
6360 | ||
ee6ba406 | 6361 | --------------------------------------- |
6362 | -- Expand_Protected_Object_Reference -- | |
6363 | --------------------------------------- | |
6364 | ||
6365 | function Expand_Protected_Object_Reference | |
6366 | (N : Node_Id; | |
578f27c9 | 6367 | Scop : Entity_Id) return Node_Id |
ee6ba406 | 6368 | is |
6369 | Loc : constant Source_Ptr := Sloc (N); | |
6370 | Corr : Entity_Id; | |
6371 | Rec : Node_Id; | |
6372 | Param : Entity_Id; | |
6373 | Proc : Entity_Id; | |
6374 | ||
6375 | begin | |
55868293 | 6376 | Rec := Make_Identifier (Loc, Name_uObject); |
ee6ba406 | 6377 | Set_Etype (Rec, Corresponding_Record_Type (Scop)); |
6378 | ||
948ef2b8 | 6379 | -- Find enclosing protected operation, and retrieve its first parameter, |
6380 | -- which denotes the enclosing protected object. If the enclosing | |
6381 | -- operation is an entry, we are immediately within the protected body, | |
6382 | -- and we can retrieve the object from the service entries procedure. A | |
bf3e1520 | 6383 | -- barrier function has the same signature as an entry. A barrier |
948ef2b8 | 6384 | -- function is compiled within the protected object, but unlike |
6385 | -- protected operations its never needs locks, so that its protected | |
6386 | -- body subprogram points to itself. | |
ee6ba406 | 6387 | |
6388 | Proc := Current_Scope; | |
ee6ba406 | 6389 | while Present (Proc) |
6390 | and then Scope (Proc) /= Scop | |
6391 | loop | |
6392 | Proc := Scope (Proc); | |
6393 | end loop; | |
6394 | ||
6395 | Corr := Protected_Body_Subprogram (Proc); | |
6396 | ||
6397 | if No (Corr) then | |
6398 | ||
6399 | -- Previous error left expansion incomplete. | |
6400 | -- Nothing to do on this call. | |
6401 | ||
6402 | return Empty; | |
6403 | end if; | |
6404 | ||
6405 | Param := | |
6406 | Defining_Identifier | |
6407 | (First (Parameter_Specifications (Parent (Corr)))); | |
6408 | ||
d7487d7d | 6409 | if Is_Subprogram (Proc) and then Proc /= Corr then |
6410 | ||
f4d93199 | 6411 | -- Protected function or procedure |
ee6ba406 | 6412 | |
6413 | Set_Entity (Rec, Param); | |
6414 | ||
948ef2b8 | 6415 | -- Rec is a reference to an entity which will not be in scope when |
6416 | -- the call is reanalyzed, and needs no further analysis. | |
ee6ba406 | 6417 | |
6418 | Set_Analyzed (Rec); | |
6419 | ||
6420 | else | |
948ef2b8 | 6421 | -- Entry or barrier function for entry body. The first parameter of |
6422 | -- the entry body procedure is pointer to the object. We create a | |
6423 | -- local variable of the proper type, duplicating what is done to | |
6424 | -- define _object later on. | |
ee6ba406 | 6425 | |
6426 | declare | |
e0394eca | 6427 | Decls : List_Id; |
ab8a61d0 | 6428 | Obj_Ptr : constant Entity_Id := Make_Temporary (Loc, 'T'); |
9dfe12ae | 6429 | |
ee6ba406 | 6430 | begin |
6431 | Decls := New_List ( | |
6432 | Make_Full_Type_Declaration (Loc, | |
6433 | Defining_Identifier => Obj_Ptr, | |
b3190af0 | 6434 | Type_Definition => |
ee6ba406 | 6435 | Make_Access_To_Object_Definition (Loc, |
6436 | Subtype_Indication => | |
83c6c069 | 6437 | New_Occurrence_Of |
e0394eca | 6438 | (Corresponding_Record_Type (Scop), Loc)))); |
ee6ba406 | 6439 | |
6440 | Insert_Actions (N, Decls); | |
59d0f0f2 | 6441 | Freeze_Before (N, Obj_Ptr); |
ee6ba406 | 6442 | |
6443 | Rec := | |
6444 | Make_Explicit_Dereference (Loc, | |
b3190af0 | 6445 | Prefix => |
6446 | Unchecked_Convert_To (Obj_Ptr, | |
6447 | New_Occurrence_Of (Param, Loc))); | |
ee6ba406 | 6448 | |
948ef2b8 | 6449 | -- Analyze new actual. Other actuals in calls are already analyzed |
4907451e | 6450 | -- and the list of actuals is not reanalyzed after rewriting. |
ee6ba406 | 6451 | |
6452 | Set_Parent (Rec, N); | |
6453 | Analyze (Rec); | |
6454 | end; | |
6455 | end if; | |
6456 | ||
6457 | return Rec; | |
6458 | end Expand_Protected_Object_Reference; | |
6459 | ||
6460 | -------------------------------------- | |
6461 | -- Expand_Protected_Subprogram_Call -- | |
6462 | -------------------------------------- | |
6463 | ||
6464 | procedure Expand_Protected_Subprogram_Call | |
6465 | (N : Node_Id; | |
6466 | Subp : Entity_Id; | |
6467 | Scop : Entity_Id) | |
6468 | is | |
71d4161f | 6469 | Rec : Node_Id; |
ee6ba406 | 6470 | |
22fe687d | 6471 | procedure Expand_Internal_Init_Call; |
6472 | -- A call to an operation of the type may occur in the initialization | |
6473 | -- of a private component. In that case the prefix of the call is an | |
6474 | -- entity name and the call is treated as internal even though it | |
6475 | -- appears in code outside of the protected type. | |
6476 | ||
15a67a0a | 6477 | procedure Freeze_Called_Function; |
6478 | -- If it is a function call it can appear in elaboration code and | |
6479 | -- the called entity must be frozen before the call. This must be | |
6480 | -- done before the call is expanded, as the expansion may rewrite it | |
6481 | -- to something other than a call (e.g. a temporary initialized in a | |
6482 | -- transient block). | |
6483 | ||
22fe687d | 6484 | ------------------------------- |
6485 | -- Expand_Internal_Init_Call -- | |
6486 | ------------------------------- | |
6487 | ||
6488 | procedure Expand_Internal_Init_Call is | |
6489 | begin | |
6490 | -- If the context is a protected object (rather than a protected | |
6491 | -- type) the call itself is bound to raise program_error because | |
6492 | -- the protected body will not have been elaborated yet. This is | |
6493 | -- diagnosed subsequently in Sem_Elab. | |
6494 | ||
6495 | Freeze_Called_Function; | |
6496 | ||
6497 | -- The target of the internal call is the first formal of the | |
6498 | -- enclosing initialization procedure. | |
6499 | ||
6500 | Rec := New_Occurrence_Of (First_Formal (Current_Scope), Sloc (N)); | |
6501 | Build_Protected_Subprogram_Call (N, | |
6502 | Name => Name (N), | |
6503 | Rec => Rec, | |
6504 | External => False); | |
6505 | Analyze (N); | |
6506 | Resolve (N, Etype (Subp)); | |
6507 | end Expand_Internal_Init_Call; | |
6508 | ||
15a67a0a | 6509 | ---------------------------- |
6510 | -- Freeze_Called_Function -- | |
6511 | ---------------------------- | |
6512 | ||
6513 | procedure Freeze_Called_Function is | |
6514 | begin | |
6515 | if Ekind (Subp) = E_Function then | |
6516 | Freeze_Expression (Name (N)); | |
6517 | end if; | |
6518 | end Freeze_Called_Function; | |
6519 | ||
6520 | -- Start of processing for Expand_Protected_Subprogram_Call | |
6521 | ||
ee6ba406 | 6522 | begin |
8fc2605c | 6523 | -- If the protected object is not an enclosing scope, this is an inter- |
6524 | -- object function call. Inter-object procedure calls are expanded by | |
6525 | -- Exp_Ch9.Build_Simple_Entry_Call. The call is intra-object only if the | |
6526 | -- subprogram being called is in the protected body being compiled, and | |
6527 | -- if the protected object in the call is statically the enclosing type. | |
67e0f1f2 | 6528 | -- The object may be a component of some other data structure, in which |
8fc2605c | 6529 | -- case this must be handled as an inter-object call. |
ee6ba406 | 6530 | |
6531 | if not In_Open_Scopes (Scop) | |
180e56c5 | 6532 | or else Is_Entry_Wrapper (Current_Scope) |
71d4161f | 6533 | or else not Is_Entity_Name (Name (N)) |
ee6ba406 | 6534 | then |
6535 | if Nkind (Name (N)) = N_Selected_Component then | |
6536 | Rec := Prefix (Name (N)); | |
6537 | ||
22fe687d | 6538 | elsif Nkind (Name (N)) = N_Indexed_Component then |
ee6ba406 | 6539 | Rec := Prefix (Prefix (Name (N))); |
22fe687d | 6540 | |
84a97922 | 6541 | -- If this is a call within an entry wrapper, it appears within a |
6542 | -- precondition that calls another primitive of the synchronized | |
6543 | -- type. The target object of the call is the first actual on the | |
6544 | -- wrapper. Note that this is an external call, because the wrapper | |
6545 | -- is called outside of the synchronized object. This means that | |
6546 | -- an entry call to an entry with preconditions involves two | |
6547 | -- synchronized operations. | |
6548 | ||
6549 | elsif Ekind (Current_Scope) = E_Procedure | |
6550 | and then Is_Entry_Wrapper (Current_Scope) | |
6551 | then | |
6552 | Rec := New_Occurrence_Of (First_Entity (Current_Scope), Sloc (N)); | |
6553 | ||
5048305b | 6554 | -- A default parameter of a protected operation may be a call to |
6555 | -- a protected function of the type. This appears as an internal | |
6556 | -- call in the profile of the operation, but if the context is an | |
6557 | -- external call we must convert the call into an external one, | |
6558 | -- using the protected object that is the target, so that: | |
6559 | ||
6560 | -- Prot.P (F) | |
6561 | -- is transformed into | |
6562 | -- Prot.P (Prot.F) | |
6563 | ||
6564 | elsif Nkind (Parent (N)) = N_Procedure_Call_Statement | |
6565 | and then Nkind (Name (Parent (N))) = N_Selected_Component | |
6566 | and then Is_Protected_Type (Etype (Prefix (Name (Parent (N))))) | |
6567 | and then Is_Entity_Name (Name (N)) | |
6568 | and then Scope (Entity (Name (N))) = | |
96cb18c0 | 6569 | Etype (Prefix (Name (Parent (N)))) |
5048305b | 6570 | then |
6571 | Rewrite (Name (N), | |
6572 | Make_Selected_Component (Sloc (N), | |
96cb18c0 | 6573 | Prefix => New_Copy_Tree (Prefix (Name (Parent (N)))), |
5048305b | 6574 | Selector_Name => Relocate_Node (Name (N)))); |
96cb18c0 | 6575 | |
5048305b | 6576 | Analyze_And_Resolve (N); |
6577 | return; | |
6578 | ||
22fe687d | 6579 | else |
6580 | -- If the context is the initialization procedure for a protected | |
6581 | -- type, the call is legal because the called entity must be a | |
6582 | -- function of that enclosing type, and this is treated as an | |
6583 | -- internal call. | |
6584 | ||
71d4161f | 6585 | pragma Assert |
6586 | (Is_Entity_Name (Name (N)) and then Inside_Init_Proc); | |
6587 | ||
22fe687d | 6588 | Expand_Internal_Init_Call; |
6589 | return; | |
ee6ba406 | 6590 | end if; |
6591 | ||
15a67a0a | 6592 | Freeze_Called_Function; |
ee6ba406 | 6593 | Build_Protected_Subprogram_Call (N, |
b3190af0 | 6594 | Name => New_Occurrence_Of (Subp, Sloc (N)), |
423eae38 | 6595 | Rec => Convert_Concurrent (Rec, Etype (Rec)), |
ee6ba406 | 6596 | External => True); |
6597 | ||
6598 | else | |
6599 | Rec := Expand_Protected_Object_Reference (N, Scop); | |
6600 | ||
6601 | if No (Rec) then | |
6602 | return; | |
6603 | end if; | |
6604 | ||
15a67a0a | 6605 | Freeze_Called_Function; |
ee6ba406 | 6606 | Build_Protected_Subprogram_Call (N, |
6607 | Name => Name (N), | |
6608 | Rec => Rec, | |
6609 | External => False); | |
ee6ba406 | 6610 | end if; |
6611 | ||
bfef19fd | 6612 | -- Analyze and resolve the new call. The actuals have already been |
d3931fdc | 6613 | -- resolved, but expansion of a function call will add extra actuals |
bfef19fd | 6614 | -- if needed. Analysis of a procedure call already includes resolution. |
6615 | ||
6616 | Analyze (N); | |
6617 | ||
6618 | if Ekind (Subp) = E_Function then | |
6619 | Resolve (N, Etype (Subp)); | |
6620 | end if; | |
ee6ba406 | 6621 | end Expand_Protected_Subprogram_Call; |
6622 | ||
047bb428 | 6623 | ----------------------------------- |
6624 | -- Expand_Simple_Function_Return -- | |
6625 | ----------------------------------- | |
6626 | ||
8fc2605c | 6627 | -- The "simple" comes from the syntax rule simple_return_statement. The |
39a0c1d3 | 6628 | -- semantics are not at all simple. |
047bb428 | 6629 | |
6630 | procedure Expand_Simple_Function_Return (N : Node_Id) is | |
6631 | Loc : constant Source_Ptr := Sloc (N); | |
6632 | ||
6633 | Scope_Id : constant Entity_Id := | |
6634 | Return_Applies_To (Return_Statement_Entity (N)); | |
6635 | -- The function we are returning from | |
6636 | ||
6637 | R_Type : constant Entity_Id := Etype (Scope_Id); | |
6638 | -- The result type of the function | |
6639 | ||
6640 | Utyp : constant Entity_Id := Underlying_Type (R_Type); | |
6641 | ||
3ea9a938 | 6642 | Exp : Node_Id := Expression (N); |
047bb428 | 6643 | pragma Assert (Present (Exp)); |
6644 | ||
6645 | Exptyp : constant Entity_Id := Etype (Exp); | |
6646 | -- The type of the expression (not necessarily the same as R_Type) | |
6647 | ||
6648 | Subtype_Ind : Node_Id; | |
8fc2605c | 6649 | -- If the result type of the function is class-wide and the expression |
6650 | -- has a specific type, then we use the expression's type as the type of | |
6651 | -- the return object. In cases where the expression is an aggregate that | |
6652 | -- is built in place, this avoids the need for an expensive conversion | |
6653 | -- of the return object to the specific type on assignments to the | |
6654 | -- individual components. | |
047bb428 | 6655 | |
6656 | begin | |
6657 | if Is_Class_Wide_Type (R_Type) | |
3ea9a938 | 6658 | and then not Is_Class_Wide_Type (Exptyp) |
6659 | and then Nkind (Exp) /= N_Type_Conversion | |
047bb428 | 6660 | then |
3ea9a938 | 6661 | Subtype_Ind := New_Occurrence_Of (Exptyp, Loc); |
047bb428 | 6662 | else |
6663 | Subtype_Ind := New_Occurrence_Of (R_Type, Loc); | |
3ea9a938 | 6664 | |
6665 | -- If the result type is class-wide and the expression is a view | |
6666 | -- conversion, the conversion plays no role in the expansion because | |
6667 | -- it does not modify the tag of the object. Remove the conversion | |
6668 | -- altogether to prevent tag overwriting. | |
6669 | ||
6670 | if Is_Class_Wide_Type (R_Type) | |
6671 | and then not Is_Class_Wide_Type (Exptyp) | |
6672 | and then Nkind (Exp) = N_Type_Conversion | |
6673 | then | |
6674 | Exp := Expression (Exp); | |
6675 | end if; | |
047bb428 | 6676 | end if; |
6677 | ||
15a97f6f | 6678 | -- Assert that if F says "return G(...);" |
6679 | -- then F and G are both b-i-p, or neither b-i-p. | |
6680 | ||
6681 | if Nkind (Exp) = N_Function_Call then | |
6682 | pragma Assert (Ekind (Scope_Id) = E_Function); | |
6683 | pragma Assert | |
6684 | (Is_Build_In_Place_Function (Scope_Id) = | |
6685 | Is_Build_In_Place_Function_Call (Exp)); | |
6686 | null; | |
6687 | end if; | |
6688 | ||
468233ce | 6689 | -- For the case of a simple return that does not come from an |
6690 | -- extended return, in the case of build-in-place, we rewrite | |
6691 | -- "return <expression>;" to be: | |
047bb428 | 6692 | |
6693 | -- return _anon_ : <return_subtype> := <expression> | |
6694 | ||
6695 | -- The expansion produced by Expand_N_Extended_Return_Statement will | |
6696 | -- contain simple return statements (for example, a block containing | |
6697 | -- simple return of the return object), which brings us back here with | |
6698 | -- Comes_From_Extended_Return_Statement set. The reason for the barrier | |
6699 | -- checking for a simple return that does not come from an extended | |
6700 | -- return is to avoid this infinite recursion. | |
6701 | ||
6702 | -- The reason for this design is that for Ada 2005 limited returns, we | |
6703 | -- need to reify the return object, so we can build it "in place", and | |
6704 | -- we need a block statement to hang finalization and tasking stuff. | |
6705 | ||
6706 | -- ??? In order to avoid disruption, we avoid translating to extended | |
6707 | -- return except in the cases where we really need to (Ada 2005 for | |
6708 | -- inherently limited). We might prefer to do this translation in all | |
6709 | -- cases (except perhaps for the case of Ada 95 inherently limited), | |
6710 | -- in order to fully exercise the Expand_N_Extended_Return_Statement | |
6711 | -- code. This would also allow us to do the build-in-place optimization | |
6712 | -- for efficiency even in cases where it is semantically not required. | |
6713 | ||
6714 | -- As before, we check the type of the return expression rather than the | |
6715 | -- return type of the function, because the latter may be a limited | |
6716 | -- class-wide interface type, which is not a limited type, even though | |
6717 | -- the type of the expression may be. | |
6718 | ||
cd24e497 | 6719 | pragma Assert |
6720 | (Comes_From_Extended_Return_Statement (N) | |
e0e76328 | 6721 | or else not Is_Build_In_Place_Function_Call (Exp) |
6722 | or else Is_Build_In_Place_Function (Scope_Id)); | |
cd24e497 | 6723 | |
047bb428 | 6724 | if not Comes_From_Extended_Return_Statement (N) |
cd24e497 | 6725 | and then Is_Build_In_Place_Function (Scope_Id) |
047bb428 | 6726 | and then not Debug_Flag_Dot_L |
61ce7f9f | 6727 | |
6728 | -- The functionality of interface thunks is simple and it is always | |
6729 | -- handled by means of simple return statements. This leaves their | |
6730 | -- expansion simple and clean. | |
6731 | ||
b1961352 | 6732 | and then not Is_Thunk (Current_Scope) |
047bb428 | 6733 | then |
6734 | declare | |
6735 | Return_Object_Entity : constant Entity_Id := | |
6736 | Make_Temporary (Loc, 'R', Exp); | |
61ce7f9f | 6737 | |
047bb428 | 6738 | Obj_Decl : constant Node_Id := |
6739 | Make_Object_Declaration (Loc, | |
6740 | Defining_Identifier => Return_Object_Entity, | |
6741 | Object_Definition => Subtype_Ind, | |
6742 | Expression => Exp); | |
6743 | ||
61ce7f9f | 6744 | Ext : constant Node_Id := |
6745 | Make_Extended_Return_Statement (Loc, | |
6746 | Return_Object_Declarations => New_List (Obj_Decl)); | |
047bb428 | 6747 | -- Do not perform this high-level optimization if the result type |
6748 | -- is an interface because the "this" pointer must be displaced. | |
6749 | ||
6750 | begin | |
6751 | Rewrite (N, Ext); | |
6752 | Analyze (N); | |
6753 | return; | |
6754 | end; | |
6755 | end if; | |
6756 | ||
6757 | -- Here we have a simple return statement that is part of the expansion | |
6758 | -- of an extended return statement (either written by the user, or | |
6759 | -- generated by the above code). | |
6760 | ||
6761 | -- Always normalize C/Fortran boolean result. This is not always needed, | |
6762 | -- but it seems a good idea to minimize the passing around of non- | |
6763 | -- normalized values, and in any case this handles the processing of | |
6764 | -- barrier functions for protected types, which turn the condition into | |
6765 | -- a return statement. | |
6766 | ||
6767 | if Is_Boolean_Type (Exptyp) | |
6768 | and then Nonzero_Is_True (Exptyp) | |
6769 | then | |
6770 | Adjust_Condition (Exp); | |
6771 | Adjust_Result_Type (Exp, Exptyp); | |
6772 | end if; | |
6773 | ||
6774 | -- Do validity check if enabled for returns | |
6775 | ||
6776 | if Validity_Checks_On | |
6777 | and then Validity_Check_Returns | |
6778 | then | |
6779 | Ensure_Valid (Exp); | |
6780 | end if; | |
6781 | ||
6782 | -- Check the result expression of a scalar function against the subtype | |
6783 | -- of the function by inserting a conversion. This conversion must | |
6784 | -- eventually be performed for other classes of types, but for now it's | |
6785 | -- only done for scalars. | |
6786 | -- ??? | |
6787 | ||
6788 | if Is_Scalar_Type (Exptyp) then | |
6789 | Rewrite (Exp, Convert_To (R_Type, Exp)); | |
6790 | ||
6791 | -- The expression is resolved to ensure that the conversion gets | |
6792 | -- expanded to generate a possible constraint check. | |
6793 | ||
6794 | Analyze_And_Resolve (Exp, R_Type); | |
6795 | end if; | |
6796 | ||
6797 | -- Deal with returning variable length objects and controlled types | |
6798 | ||
6799 | -- Nothing to do if we are returning by reference, or this is not a | |
6800 | -- type that requires special processing (indicated by the fact that | |
6801 | -- it requires a cleanup scope for the secondary stack case). | |
6802 | ||
cd24e497 | 6803 | if Is_Build_In_Place_Function (Scope_Id) |
047bb428 | 6804 | or else Is_Limited_Interface (Exptyp) |
6805 | then | |
6806 | null; | |
6807 | ||
61ce7f9f | 6808 | -- No copy needed for thunks returning interface type objects since |
6809 | -- the object is returned by reference and the maximum functionality | |
6810 | -- required is just to displace the pointer. | |
6811 | ||
4d4b0e0d | 6812 | elsif Is_Thunk (Current_Scope) and then Is_Interface (Exptyp) then |
61ce7f9f | 6813 | null; |
6814 | ||
e2c7aa50 | 6815 | -- If the call is within a thunk and the type is a limited view, the |
6816 | -- backend will eventually see the non-limited view of the type. | |
6817 | ||
c06a893f | 6818 | elsif Is_Thunk (Current_Scope) and then Is_Incomplete_Type (Exptyp) then |
e2c7aa50 | 6819 | return; |
6820 | ||
047bb428 | 6821 | elsif not Requires_Transient_Scope (R_Type) then |
6822 | ||
84458720 | 6823 | -- Mutable records with variable-length components are not returned |
6824 | -- on the sec-stack, so we need to make sure that the back end will | |
6825 | -- only copy back the size of the actual value, and not the maximum | |
6826 | -- size. We create an actual subtype for this purpose. However we | |
6827 | -- need not do it if the expression is a function call since this | |
6828 | -- will be done in the called function and doing it here too would | |
6829 | -- cause a temporary with maximum size to be created. | |
047bb428 | 6830 | |
6831 | declare | |
6832 | Ubt : constant Entity_Id := Underlying_Type (Base_Type (Exptyp)); | |
6833 | Decl : Node_Id; | |
6834 | Ent : Entity_Id; | |
6835 | begin | |
84458720 | 6836 | if Nkind (Exp) /= N_Function_Call |
6837 | and then Has_Discriminants (Ubt) | |
047bb428 | 6838 | and then not Is_Constrained (Ubt) |
6839 | and then not Has_Unchecked_Union (Ubt) | |
6840 | then | |
6841 | Decl := Build_Actual_Subtype (Ubt, Exp); | |
6842 | Ent := Defining_Identifier (Decl); | |
6843 | Insert_Action (Exp, Decl); | |
6844 | Rewrite (Exp, Unchecked_Convert_To (Ent, Exp)); | |
6845 | Analyze_And_Resolve (Exp); | |
6846 | end if; | |
6847 | end; | |
6848 | ||
6849 | -- Here if secondary stack is used | |
6850 | ||
6851 | else | |
a360a0f7 | 6852 | -- Prevent the reclamation of the secondary stack by all enclosing |
a10589ee | 6853 | -- blocks and loops as well as the related function; otherwise the |
6854 | -- result would be reclaimed too early. | |
757d44b9 | 6855 | |
a10589ee | 6856 | Set_Enclosing_Sec_Stack_Return (N); |
047bb428 | 6857 | |
6858 | -- Optimize the case where the result is a function call. In this | |
6859 | -- case either the result is already on the secondary stack, or is | |
6860 | -- already being returned with the stack pointer depressed and no | |
8fc2605c | 6861 | -- further processing is required except to set the By_Ref flag |
6862 | -- to ensure that gigi does not attempt an extra unnecessary copy. | |
047bb428 | 6863 | -- (actually not just unnecessary but harmfully wrong in the case |
6864 | -- of a controlled type, where gigi does not know how to do a copy). | |
8fc2605c | 6865 | -- To make up for a gcc 2.8.1 deficiency (???), we perform the copy |
6866 | -- for array types if the constrained status of the target type is | |
6867 | -- different from that of the expression. | |
047bb428 | 6868 | |
6869 | if Requires_Transient_Scope (Exptyp) | |
6870 | and then | |
6871 | (not Is_Array_Type (Exptyp) | |
6872 | or else Is_Constrained (Exptyp) = Is_Constrained (R_Type) | |
6873 | or else CW_Or_Has_Controlled_Part (Utyp)) | |
6874 | and then Nkind (Exp) = N_Function_Call | |
6875 | then | |
6876 | Set_By_Ref (N); | |
6877 | ||
6878 | -- Remove side effects from the expression now so that other parts | |
6879 | -- of the expander do not have to reanalyze this node without this | |
6880 | -- optimization | |
6881 | ||
6882 | Rewrite (Exp, Duplicate_Subexpr_No_Checks (Exp)); | |
6883 | ||
fd890137 | 6884 | -- Ada 2005 (AI-251): If the type of the returned object is |
6885 | -- an interface then add an implicit type conversion to force | |
6886 | -- displacement of the "this" pointer. | |
6887 | ||
6888 | if Is_Interface (R_Type) then | |
6889 | Rewrite (Exp, Convert_To (R_Type, Relocate_Node (Exp))); | |
6890 | end if; | |
6891 | ||
6892 | Analyze_And_Resolve (Exp, R_Type); | |
6893 | ||
047bb428 | 6894 | -- For controlled types, do the allocation on the secondary stack |
6895 | -- manually in order to call adjust at the right time: | |
6896 | ||
6897 | -- type Anon1 is access R_Type; | |
6898 | -- for Anon1'Storage_pool use ss_pool; | |
6899 | -- Anon2 : anon1 := new R_Type'(expr); | |
6900 | -- return Anon2.all; | |
6901 | ||
6902 | -- We do the same for classwide types that are not potentially | |
6903 | -- controlled (by the virtue of restriction No_Finalization) because | |
6904 | -- gigi is not able to properly allocate class-wide types. | |
6905 | ||
6906 | elsif CW_Or_Has_Controlled_Part (Utyp) then | |
6907 | declare | |
6908 | Loc : constant Source_Ptr := Sloc (N); | |
6909 | Acc_Typ : constant Entity_Id := Make_Temporary (Loc, 'A'); | |
6910 | Alloc_Node : Node_Id; | |
6911 | Temp : Entity_Id; | |
6912 | ||
6913 | begin | |
6914 | Set_Ekind (Acc_Typ, E_Access_Type); | |
6915 | ||
6916 | Set_Associated_Storage_Pool (Acc_Typ, RTE (RE_SS_Pool)); | |
6917 | ||
6918 | -- This is an allocator for the secondary stack, and it's fine | |
6919 | -- to have Comes_From_Source set False on it, as gigi knows not | |
6920 | -- to flag it as a violation of No_Implicit_Heap_Allocations. | |
6921 | ||
6922 | Alloc_Node := | |
6923 | Make_Allocator (Loc, | |
6924 | Expression => | |
6925 | Make_Qualified_Expression (Loc, | |
83c6c069 | 6926 | Subtype_Mark => New_Occurrence_Of (Etype (Exp), Loc), |
047bb428 | 6927 | Expression => Relocate_Node (Exp))); |
6928 | ||
6929 | -- We do not want discriminant checks on the declaration, | |
6930 | -- given that it gets its value from the allocator. | |
6931 | ||
6932 | Set_No_Initialization (Alloc_Node); | |
6933 | ||
6934 | Temp := Make_Temporary (Loc, 'R', Alloc_Node); | |
6935 | ||
6936 | Insert_List_Before_And_Analyze (N, New_List ( | |
6937 | Make_Full_Type_Declaration (Loc, | |
6938 | Defining_Identifier => Acc_Typ, | |
6939 | Type_Definition => | |
6940 | Make_Access_To_Object_Definition (Loc, | |
6941 | Subtype_Indication => Subtype_Ind)), | |
6942 | ||
6943 | Make_Object_Declaration (Loc, | |
6944 | Defining_Identifier => Temp, | |
83c6c069 | 6945 | Object_Definition => New_Occurrence_Of (Acc_Typ, Loc), |
047bb428 | 6946 | Expression => Alloc_Node))); |
6947 | ||
6948 | Rewrite (Exp, | |
6949 | Make_Explicit_Dereference (Loc, | |
83c6c069 | 6950 | Prefix => New_Occurrence_Of (Temp, Loc))); |
047bb428 | 6951 | |
95deda50 | 6952 | -- Ada 2005 (AI-251): If the type of the returned object is |
6953 | -- an interface then add an implicit type conversion to force | |
6954 | -- displacement of the "this" pointer. | |
6955 | ||
6956 | if Is_Interface (R_Type) then | |
6957 | Rewrite (Exp, Convert_To (R_Type, Relocate_Node (Exp))); | |
6958 | end if; | |
6959 | ||
047bb428 | 6960 | Analyze_And_Resolve (Exp, R_Type); |
6961 | end; | |
6962 | ||
6963 | -- Otherwise use the gigi mechanism to allocate result on the | |
6964 | -- secondary stack. | |
6965 | ||
6966 | else | |
6967 | Check_Restriction (No_Secondary_Stack, N); | |
6968 | Set_Storage_Pool (N, RTE (RE_SS_Pool)); | |
36ac5fbb | 6969 | Set_Procedure_To_Call (N, RTE (RE_SS_Allocate)); |
047bb428 | 6970 | end if; |
6971 | end if; | |
6972 | ||
8fc2605c | 6973 | -- Implement the rules of 6.5(8-10), which require a tag check in |
6974 | -- the case of a limited tagged return type, and tag reassignment for | |
047bb428 | 6975 | -- nonlimited tagged results. These actions are needed when the return |
6976 | -- type is a specific tagged type and the result expression is a | |
8fc2605c | 6977 | -- conversion or a formal parameter, because in that case the tag of |
6978 | -- the expression might differ from the tag of the specific result type. | |
047bb428 | 6979 | |
45680027 | 6980 | -- We must also verify an underlying type exists for the return type in |
6981 | -- case it is incomplete - in which case is not necessary to generate a | |
6982 | -- check anyway since an incomplete limited tagged return type would | |
6983 | -- qualify as a premature usage. | |
6984 | ||
6985 | if Present (Utyp) | |
6986 | and then Is_Tagged_Type (Utyp) | |
047bb428 | 6987 | and then not Is_Class_Wide_Type (Utyp) |
6988 | and then (Nkind_In (Exp, N_Type_Conversion, | |
6989 | N_Unchecked_Type_Conversion) | |
6990 | or else (Is_Entity_Name (Exp) | |
a0e14d4a | 6991 | and then Is_Formal (Entity (Exp)))) |
047bb428 | 6992 | then |
8fc2605c | 6993 | -- When the return type is limited, perform a check that the tag of |
6994 | -- the result is the same as the tag of the return type. | |
047bb428 | 6995 | |
6996 | if Is_Limited_Type (R_Type) then | |
6997 | Insert_Action (Exp, | |
6998 | Make_Raise_Constraint_Error (Loc, | |
6999 | Condition => | |
7000 | Make_Op_Ne (Loc, | |
b3190af0 | 7001 | Left_Opnd => |
047bb428 | 7002 | Make_Selected_Component (Loc, |
55868293 | 7003 | Prefix => Duplicate_Subexpr (Exp), |
7004 | Selector_Name => Make_Identifier (Loc, Name_uTag)), | |
047bb428 | 7005 | Right_Opnd => |
7006 | Make_Attribute_Reference (Loc, | |
b3190af0 | 7007 | Prefix => |
7008 | New_Occurrence_Of (Base_Type (Utyp), Loc), | |
047bb428 | 7009 | Attribute_Name => Name_Tag)), |
b3190af0 | 7010 | Reason => CE_Tag_Check_Failed)); |
047bb428 | 7011 | |
7012 | -- If the result type is a specific nonlimited tagged type, then we | |
7013 | -- have to ensure that the tag of the result is that of the result | |
8fc2605c | 7014 | -- type. This is handled by making a copy of the expression in |
7015 | -- the case where it might have a different tag, namely when the | |
047bb428 | 7016 | -- expression is a conversion or a formal parameter. We create a new |
7017 | -- object of the result type and initialize it from the expression, | |
7018 | -- which will implicitly force the tag to be set appropriately. | |
7019 | ||
7020 | else | |
7021 | declare | |
7022 | ExpR : constant Node_Id := Relocate_Node (Exp); | |
7023 | Result_Id : constant Entity_Id := | |
7024 | Make_Temporary (Loc, 'R', ExpR); | |
7025 | Result_Exp : constant Node_Id := | |
83c6c069 | 7026 | New_Occurrence_Of (Result_Id, Loc); |
047bb428 | 7027 | Result_Obj : constant Node_Id := |
7028 | Make_Object_Declaration (Loc, | |
7029 | Defining_Identifier => Result_Id, | |
7030 | Object_Definition => | |
83c6c069 | 7031 | New_Occurrence_Of (R_Type, Loc), |
047bb428 | 7032 | Constant_Present => True, |
7033 | Expression => ExpR); | |
7034 | ||
7035 | begin | |
7036 | Set_Assignment_OK (Result_Obj); | |
7037 | Insert_Action (Exp, Result_Obj); | |
7038 | ||
7039 | Rewrite (Exp, Result_Exp); | |
7040 | Analyze_And_Resolve (Exp, R_Type); | |
7041 | end; | |
7042 | end if; | |
7043 | ||
7044 | -- Ada 2005 (AI-344): If the result type is class-wide, then insert | |
7045 | -- a check that the level of the return expression's underlying type | |
7046 | -- is not deeper than the level of the master enclosing the function. | |
7047 | -- Always generate the check when the type of the return expression | |
7048 | -- is class-wide, when it's a type conversion, or when it's a formal | |
7049 | -- parameter. Otherwise, suppress the check in the case where the | |
7050 | -- return expression has a specific type whose level is known not to | |
7051 | -- be statically deeper than the function's result type. | |
7052 | ||
228836e8 | 7053 | -- No runtime check needed in interface thunks since it is performed |
7054 | -- by the target primitive associated with the thunk. | |
7055 | ||
047bb428 | 7056 | -- Note: accessibility check is skipped in the VM case, since there |
7057 | -- does not seem to be any practical way to implement this check. | |
7058 | ||
de54c5ab | 7059 | elsif Ada_Version >= Ada_2005 |
047bb428 | 7060 | and then Tagged_Type_Expansion |
7061 | and then Is_Class_Wide_Type (R_Type) | |
228836e8 | 7062 | and then not Is_Thunk (Current_Scope) |
fafc6b97 | 7063 | and then not Scope_Suppress.Suppress (Accessibility_Check) |
047bb428 | 7064 | and then |
7065 | (Is_Class_Wide_Type (Etype (Exp)) | |
7066 | or else Nkind_In (Exp, N_Type_Conversion, | |
7067 | N_Unchecked_Type_Conversion) | |
7068 | or else (Is_Entity_Name (Exp) | |
a0e14d4a | 7069 | and then Is_Formal (Entity (Exp))) |
047bb428 | 7070 | or else Scope_Depth (Enclosing_Dynamic_Scope (Etype (Exp))) > |
7071 | Scope_Depth (Enclosing_Dynamic_Scope (Scope_Id))) | |
7072 | then | |
7073 | declare | |
7074 | Tag_Node : Node_Id; | |
7075 | ||
7076 | begin | |
7077 | -- Ada 2005 (AI-251): In class-wide interface objects we displace | |
229c2354 | 7078 | -- "this" to reference the base of the object. This is required to |
7079 | -- get access to the TSD of the object. | |
047bb428 | 7080 | |
7081 | if Is_Class_Wide_Type (Etype (Exp)) | |
7082 | and then Is_Interface (Etype (Exp)) | |
047bb428 | 7083 | then |
603fc431 | 7084 | -- If the expression is an explicit dereference then we can |
7085 | -- directly displace the pointer to reference the base of | |
7086 | -- the object. | |
7087 | ||
7088 | if Nkind (Exp) = N_Explicit_Dereference then | |
7089 | Tag_Node := | |
7090 | Make_Explicit_Dereference (Loc, | |
7091 | Prefix => | |
7092 | Unchecked_Convert_To (RTE (RE_Tag_Ptr), | |
7093 | Make_Function_Call (Loc, | |
7094 | Name => | |
7095 | New_Occurrence_Of (RTE (RE_Base_Address), Loc), | |
7096 | Parameter_Associations => New_List ( | |
7097 | Unchecked_Convert_To (RTE (RE_Address), | |
7098 | Duplicate_Subexpr (Prefix (Exp))))))); | |
7099 | ||
7100 | -- Similar case to the previous one but the expression is a | |
7101 | -- renaming of an explicit dereference. | |
7102 | ||
7103 | elsif Nkind (Exp) = N_Identifier | |
7104 | and then Present (Renamed_Object (Entity (Exp))) | |
7105 | and then Nkind (Renamed_Object (Entity (Exp))) | |
7106 | = N_Explicit_Dereference | |
7107 | then | |
7108 | Tag_Node := | |
7109 | Make_Explicit_Dereference (Loc, | |
7110 | Prefix => | |
7111 | Unchecked_Convert_To (RTE (RE_Tag_Ptr), | |
7112 | Make_Function_Call (Loc, | |
7113 | Name => | |
7114 | New_Occurrence_Of (RTE (RE_Base_Address), Loc), | |
7115 | Parameter_Associations => New_List ( | |
7116 | Unchecked_Convert_To (RTE (RE_Address), | |
7117 | Duplicate_Subexpr | |
7118 | (Prefix | |
7119 | (Renamed_Object (Entity (Exp))))))))); | |
7120 | ||
7121 | -- Common case: obtain the address of the actual object and | |
7122 | -- displace the pointer to reference the base of the object. | |
7123 | ||
7124 | else | |
7125 | Tag_Node := | |
7126 | Make_Explicit_Dereference (Loc, | |
7127 | Prefix => | |
7128 | Unchecked_Convert_To (RTE (RE_Tag_Ptr), | |
7129 | Make_Function_Call (Loc, | |
7130 | Name => | |
7131 | New_Occurrence_Of (RTE (RE_Base_Address), Loc), | |
7132 | Parameter_Associations => New_List ( | |
7133 | Make_Attribute_Reference (Loc, | |
7134 | Prefix => Duplicate_Subexpr (Exp), | |
7135 | Attribute_Name => Name_Address))))); | |
7136 | end if; | |
047bb428 | 7137 | else |
7138 | Tag_Node := | |
7139 | Make_Attribute_Reference (Loc, | |
b3190af0 | 7140 | Prefix => Duplicate_Subexpr (Exp), |
047bb428 | 7141 | Attribute_Name => Name_Tag); |
7142 | end if; | |
7143 | ||
3ded5588 | 7144 | -- CodePeer does not do anything useful with |
7145 | -- Ada.Tags.Type_Specific_Data components. | |
051826ee | 7146 | |
3ded5588 | 7147 | if not CodePeer_Mode then |
051826ee | 7148 | Insert_Action (Exp, |
7149 | Make_Raise_Program_Error (Loc, | |
7150 | Condition => | |
7151 | Make_Op_Gt (Loc, | |
7152 | Left_Opnd => Build_Get_Access_Level (Loc, Tag_Node), | |
7153 | Right_Opnd => | |
7154 | Make_Integer_Literal (Loc, | |
7155 | Scope_Depth (Enclosing_Dynamic_Scope (Scope_Id)))), | |
3ded5588 | 7156 | Reason => PE_Accessibility_Check_Failed)); |
051826ee | 7157 | end if; |
047bb428 | 7158 | end; |
7159 | ||
7160 | -- AI05-0073: If function has a controlling access result, check that | |
7161 | -- the tag of the return value, if it is not null, matches designated | |
7162 | -- type of return type. | |
29448168 | 7163 | |
7164 | -- The return expression is referenced twice in the code below, so it | |
7165 | -- must be made free of side effects. Given that different compilers | |
047bb428 | 7166 | -- may evaluate these parameters in different order, both occurrences |
7167 | -- perform a copy. | |
7168 | ||
7169 | elsif Ekind (R_Type) = E_Anonymous_Access_Type | |
7170 | and then Has_Controlling_Result (Scope_Id) | |
7171 | then | |
7172 | Insert_Action (N, | |
7173 | Make_Raise_Constraint_Error (Loc, | |
7174 | Condition => | |
7175 | Make_And_Then (Loc, | |
7176 | Left_Opnd => | |
7177 | Make_Op_Ne (Loc, | |
7178 | Left_Opnd => Duplicate_Subexpr (Exp), | |
7179 | Right_Opnd => Make_Null (Loc)), | |
4be04311 | 7180 | |
047bb428 | 7181 | Right_Opnd => Make_Op_Ne (Loc, |
7182 | Left_Opnd => | |
7183 | Make_Selected_Component (Loc, | |
7184 | Prefix => Duplicate_Subexpr (Exp), | |
55868293 | 7185 | Selector_Name => Make_Identifier (Loc, Name_uTag)), |
4be04311 | 7186 | |
047bb428 | 7187 | Right_Opnd => |
7188 | Make_Attribute_Reference (Loc, | |
7189 | Prefix => | |
7190 | New_Occurrence_Of (Designated_Type (R_Type), Loc), | |
7191 | Attribute_Name => Name_Tag))), | |
4be04311 | 7192 | |
047bb428 | 7193 | Reason => CE_Tag_Check_Failed), |
7194 | Suppress => All_Checks); | |
7195 | end if; | |
7196 | ||
302f6546 | 7197 | -- AI05-0234: RM 6.5(21/3). Check access discriminants to |
7198 | -- ensure that the function result does not outlive an | |
7199 | -- object designated by one of it discriminants. | |
7200 | ||
0c6b5982 | 7201 | if Present (Extra_Accessibility_Of_Result (Scope_Id)) |
302f6546 | 7202 | and then Has_Unconstrained_Access_Discriminants (R_Type) |
7203 | then | |
7204 | declare | |
4be04311 | 7205 | Discrim_Source : Node_Id; |
302f6546 | 7206 | |
7207 | procedure Check_Against_Result_Level (Level : Node_Id); | |
4be04311 | 7208 | -- Check the given accessibility level against the level |
7209 | -- determined by the point of call. (AI05-0234). | |
302f6546 | 7210 | |
7211 | -------------------------------- | |
7212 | -- Check_Against_Result_Level -- | |
7213 | -------------------------------- | |
7214 | ||
7215 | procedure Check_Against_Result_Level (Level : Node_Id) is | |
7216 | begin | |
7217 | Insert_Action (N, | |
7218 | Make_Raise_Program_Error (Loc, | |
7219 | Condition => | |
7220 | Make_Op_Gt (Loc, | |
7221 | Left_Opnd => Level, | |
7222 | Right_Opnd => | |
7223 | New_Occurrence_Of | |
7224 | (Extra_Accessibility_Of_Result (Scope_Id), Loc)), | |
7225 | Reason => PE_Accessibility_Check_Failed)); | |
7226 | end Check_Against_Result_Level; | |
4be04311 | 7227 | |
302f6546 | 7228 | begin |
4be04311 | 7229 | Discrim_Source := Exp; |
302f6546 | 7230 | while Nkind (Discrim_Source) = N_Qualified_Expression loop |
7231 | Discrim_Source := Expression (Discrim_Source); | |
7232 | end loop; | |
7233 | ||
7234 | if Nkind (Discrim_Source) = N_Identifier | |
7235 | and then Is_Return_Object (Entity (Discrim_Source)) | |
7236 | then | |
302f6546 | 7237 | Discrim_Source := Entity (Discrim_Source); |
7238 | ||
7239 | if Is_Constrained (Etype (Discrim_Source)) then | |
7240 | Discrim_Source := Etype (Discrim_Source); | |
7241 | else | |
7242 | Discrim_Source := Expression (Parent (Discrim_Source)); | |
7243 | end if; | |
7244 | ||
7245 | elsif Nkind (Discrim_Source) = N_Identifier | |
7246 | and then Nkind_In (Original_Node (Discrim_Source), | |
7247 | N_Aggregate, N_Extension_Aggregate) | |
7248 | then | |
302f6546 | 7249 | Discrim_Source := Original_Node (Discrim_Source); |
7250 | ||
7251 | elsif Nkind (Discrim_Source) = N_Explicit_Dereference and then | |
7252 | Nkind (Original_Node (Discrim_Source)) = N_Function_Call | |
7253 | then | |
302f6546 | 7254 | Discrim_Source := Original_Node (Discrim_Source); |
302f6546 | 7255 | end if; |
7256 | ||
37066559 | 7257 | Discrim_Source := Unqual_Conv (Discrim_Source); |
302f6546 | 7258 | |
7259 | case Nkind (Discrim_Source) is | |
7260 | when N_Defining_Identifier => | |
8fc2605c | 7261 | pragma Assert (Is_Composite_Type (Discrim_Source) |
7262 | and then Has_Discriminants (Discrim_Source) | |
7263 | and then Is_Constrained (Discrim_Source)); | |
302f6546 | 7264 | |
7265 | declare | |
7266 | Discrim : Entity_Id := | |
7267 | First_Discriminant (Base_Type (R_Type)); | |
7268 | Disc_Elmt : Elmt_Id := | |
7269 | First_Elmt (Discriminant_Constraint | |
7270 | (Discrim_Source)); | |
7271 | begin | |
7272 | loop | |
7273 | if Ekind (Etype (Discrim)) = | |
8fc2605c | 7274 | E_Anonymous_Access_Type |
7275 | then | |
302f6546 | 7276 | Check_Against_Result_Level |
7277 | (Dynamic_Accessibility_Level (Node (Disc_Elmt))); | |
7278 | end if; | |
7279 | ||
7280 | Next_Elmt (Disc_Elmt); | |
7281 | Next_Discriminant (Discrim); | |
7282 | exit when not Present (Discrim); | |
7283 | end loop; | |
7284 | end; | |
7285 | ||
99378362 | 7286 | when N_Aggregate |
7287 | | N_Extension_Aggregate | |
7288 | => | |
8fc2605c | 7289 | -- Unimplemented: extension aggregate case where discrims |
7290 | -- come from ancestor part, not extension part. | |
302f6546 | 7291 | |
7292 | declare | |
7293 | Discrim : Entity_Id := | |
7294 | First_Discriminant (Base_Type (R_Type)); | |
7295 | ||
7296 | Disc_Exp : Node_Id := Empty; | |
7297 | ||
7298 | Positionals_Exhausted | |
7299 | : Boolean := not Present (Expressions | |
7300 | (Discrim_Source)); | |
7301 | ||
7302 | function Associated_Expr | |
7303 | (Comp_Id : Entity_Id; | |
7304 | Associations : List_Id) return Node_Id; | |
7305 | ||
7306 | -- Given a component and a component associations list, | |
7307 | -- locate the expression for that component; returns | |
7308 | -- Empty if no such expression is found. | |
7309 | ||
7310 | --------------------- | |
7311 | -- Associated_Expr -- | |
7312 | --------------------- | |
7313 | ||
7314 | function Associated_Expr | |
7315 | (Comp_Id : Entity_Id; | |
7316 | Associations : List_Id) return Node_Id | |
7317 | is | |
8fc2605c | 7318 | Assoc : Node_Id; |
302f6546 | 7319 | Choice : Node_Id; |
8fc2605c | 7320 | |
302f6546 | 7321 | begin |
7322 | -- Simple linear search seems ok here | |
7323 | ||
8fc2605c | 7324 | Assoc := First (Associations); |
302f6546 | 7325 | while Present (Assoc) loop |
7326 | Choice := First (Choices (Assoc)); | |
302f6546 | 7327 | while Present (Choice) loop |
7328 | if (Nkind (Choice) = N_Identifier | |
8fc2605c | 7329 | and then Chars (Choice) = Chars (Comp_Id)) |
7330 | or else (Nkind (Choice) = N_Others_Choice) | |
302f6546 | 7331 | then |
7332 | return Expression (Assoc); | |
7333 | end if; | |
7334 | ||
7335 | Next (Choice); | |
7336 | end loop; | |
7337 | ||
7338 | Next (Assoc); | |
7339 | end loop; | |
7340 | ||
7341 | return Empty; | |
7342 | end Associated_Expr; | |
7343 | ||
302f6546 | 7344 | begin |
7345 | if not Positionals_Exhausted then | |
7346 | Disc_Exp := First (Expressions (Discrim_Source)); | |
7347 | end if; | |
7348 | ||
7349 | loop | |
7350 | if Positionals_Exhausted then | |
8fc2605c | 7351 | Disc_Exp := |
7352 | Associated_Expr | |
7353 | (Discrim, | |
7354 | Component_Associations (Discrim_Source)); | |
302f6546 | 7355 | end if; |
7356 | ||
7357 | if Ekind (Etype (Discrim)) = | |
8fc2605c | 7358 | E_Anonymous_Access_Type |
7359 | then | |
302f6546 | 7360 | Check_Against_Result_Level |
7361 | (Dynamic_Accessibility_Level (Disc_Exp)); | |
7362 | end if; | |
7363 | ||
7364 | Next_Discriminant (Discrim); | |
7365 | exit when not Present (Discrim); | |
7366 | ||
7367 | if not Positionals_Exhausted then | |
7368 | Next (Disc_Exp); | |
7369 | Positionals_Exhausted := not Present (Disc_Exp); | |
7370 | end if; | |
7371 | end loop; | |
7372 | end; | |
7373 | ||
7374 | when N_Function_Call => | |
8fc2605c | 7375 | |
7376 | -- No check needed (check performed by callee) | |
7377 | ||
302f6546 | 7378 | null; |
7379 | ||
7380 | when others => | |
302f6546 | 7381 | declare |
7382 | Level : constant Node_Id := | |
8fc2605c | 7383 | Make_Integer_Literal (Loc, |
7384 | Object_Access_Level (Discrim_Source)); | |
7385 | ||
302f6546 | 7386 | begin |
7387 | -- Unimplemented: check for name prefix that includes | |
7388 | -- a dereference of an access value with a dynamic | |
7389 | -- accessibility level (e.g., an access param or a | |
7390 | -- saooaaat) and use dynamic level in that case. For | |
7391 | -- example: | |
7392 | -- return Access_Param.all(Some_Index).Some_Component; | |
8fc2605c | 7393 | -- ??? |
302f6546 | 7394 | |
7395 | Set_Etype (Level, Standard_Natural); | |
7396 | Check_Against_Result_Level (Level); | |
7397 | end; | |
302f6546 | 7398 | end case; |
7399 | end; | |
7400 | end if; | |
7401 | ||
5d2fb1fa | 7402 | -- If we are returning a nonscalar object that is possibly unaligned, |
7403 | -- then copy the value into a temporary first. This copy may need to | |
7404 | -- expand to a loop of component operations. | |
047bb428 | 7405 | |
7406 | if Is_Possibly_Unaligned_Slice (Exp) | |
5d2fb1fa | 7407 | or else (Is_Possibly_Unaligned_Object (Exp) |
7408 | and then not Represented_As_Scalar (Etype (Exp))) | |
047bb428 | 7409 | then |
7410 | declare | |
7411 | ExpR : constant Node_Id := Relocate_Node (Exp); | |
7412 | Tnn : constant Entity_Id := Make_Temporary (Loc, 'T', ExpR); | |
7413 | begin | |
7414 | Insert_Action (Exp, | |
7415 | Make_Object_Declaration (Loc, | |
7416 | Defining_Identifier => Tnn, | |
7417 | Constant_Present => True, | |
7418 | Object_Definition => New_Occurrence_Of (R_Type, Loc), | |
7419 | Expression => ExpR), | |
b3190af0 | 7420 | Suppress => All_Checks); |
047bb428 | 7421 | Rewrite (Exp, New_Occurrence_Of (Tnn, Loc)); |
7422 | end; | |
7423 | end if; | |
7424 | ||
ed695684 | 7425 | -- Call the _Postconditions procedure if the related function has |
7426 | -- contract assertions that need to be verified on exit. | |
047bb428 | 7427 | |
7428 | if Ekind (Scope_Id) = E_Function | |
ed695684 | 7429 | and then Present (Postconditions_Proc (Scope_Id)) |
047bb428 | 7430 | then |
6c5793cd | 7431 | -- In the case of discriminated objects, we have created a |
7432 | -- constrained subtype above, and used the underlying type. This | |
7433 | -- transformation is post-analysis and harmless, except that now the | |
7434 | -- call to the post-condition will be analyzed and the type kinds | |
7435 | -- have to match. | |
7436 | ||
7437 | if Nkind (Exp) = N_Unchecked_Type_Conversion | |
7438 | and then Is_Private_Type (R_Type) /= Is_Private_Type (Etype (Exp)) | |
047bb428 | 7439 | then |
6c5793cd | 7440 | Rewrite (Exp, Expression (Relocate_Node (Exp))); |
7441 | end if; | |
047bb428 | 7442 | |
6c5793cd | 7443 | -- We are going to reference the returned value twice in this case, |
7444 | -- once in the call to _Postconditions, and once in the actual return | |
7445 | -- statement, but we can't have side effects happening twice. | |
047bb428 | 7446 | |
c09c4671 | 7447 | Force_Evaluation (Exp, Mode => Strict); |
047bb428 | 7448 | |
ed695684 | 7449 | -- Generate call to _Postconditions |
047bb428 | 7450 | |
7451 | Insert_Action (Exp, | |
7452 | Make_Procedure_Call_Statement (Loc, | |
ed695684 | 7453 | Name => |
7454 | New_Occurrence_Of (Postconditions_Proc (Scope_Id), Loc), | |
6c5793cd | 7455 | Parameter_Associations => New_List (New_Copy_Tree (Exp)))); |
047bb428 | 7456 | end if; |
7457 | ||
7458 | -- Ada 2005 (AI-251): If this return statement corresponds with an | |
7459 | -- simple return statement associated with an extended return statement | |
7460 | -- and the type of the returned object is an interface then generate an | |
7461 | -- implicit conversion to force displacement of the "this" pointer. | |
7462 | ||
de54c5ab | 7463 | if Ada_Version >= Ada_2005 |
047bb428 | 7464 | and then Comes_From_Extended_Return_Statement (N) |
7465 | and then Nkind (Expression (N)) = N_Identifier | |
7466 | and then Is_Interface (Utyp) | |
7467 | and then Utyp /= Underlying_Type (Exptyp) | |
7468 | then | |
7469 | Rewrite (Exp, Convert_To (Utyp, Relocate_Node (Exp))); | |
7470 | Analyze_And_Resolve (Exp); | |
7471 | end if; | |
7472 | end Expand_Simple_Function_Return; | |
7473 | ||
578f27c9 | 7474 | ----------------------- |
7475 | -- Freeze_Subprogram -- | |
7476 | ----------------------- | |
aad6babd | 7477 | |
578f27c9 | 7478 | procedure Freeze_Subprogram (N : Node_Id) is |
7479 | Loc : constant Source_Ptr := Sloc (N); | |
e1c20931 | 7480 | |
578f27c9 | 7481 | procedure Register_Predefined_DT_Entry (Prim : Entity_Id); |
7482 | -- (Ada 2005): Register a predefined primitive in all the secondary | |
7483 | -- dispatch tables of its primitive type. | |
e1c20931 | 7484 | |
76a1c25b | 7485 | ---------------------------------- |
7486 | -- Register_Predefined_DT_Entry -- | |
7487 | ---------------------------------- | |
7488 | ||
7489 | procedure Register_Predefined_DT_Entry (Prim : Entity_Id) is | |
7490 | Iface_DT_Ptr : Elmt_Id; | |
578f27c9 | 7491 | Tagged_Typ : Entity_Id; |
76a1c25b | 7492 | Thunk_Id : Entity_Id; |
4907451e | 7493 | Thunk_Code : Node_Id; |
76a1c25b | 7494 | |
7495 | begin | |
578f27c9 | 7496 | Tagged_Typ := Find_Dispatching_Type (Prim); |
76a1c25b | 7497 | |
578f27c9 | 7498 | if No (Access_Disp_Table (Tagged_Typ)) |
a652dd51 | 7499 | or else not Has_Interfaces (Tagged_Typ) |
33b6091b | 7500 | or else not RTE_Available (RE_Interface_Tag) |
21ec6442 | 7501 | or else Restriction_Active (No_Dispatching_Calls) |
76a1c25b | 7502 | then |
7503 | return; | |
7504 | end if; | |
7505 | ||
acf97c11 | 7506 | -- Skip the first two access-to-dispatch-table pointers since they |
7507 | -- leads to the primary dispatch table (predefined DT and user | |
7508 | -- defined DT). We are only concerned with the secondary dispatch | |
7509 | -- table pointers. Note that the access-to- dispatch-table pointer | |
7510 | -- corresponds to the first implemented interface retrieved below. | |
76a1c25b | 7511 | |
578f27c9 | 7512 | Iface_DT_Ptr := |
acf97c11 | 7513 | Next_Elmt (Next_Elmt (First_Elmt (Access_Disp_Table (Tagged_Typ)))); |
21ec6442 | 7514 | |
4907451e | 7515 | while Present (Iface_DT_Ptr) |
bb3b440a | 7516 | and then Ekind (Node (Iface_DT_Ptr)) = E_Constant |
4907451e | 7517 | loop |
d34432fa | 7518 | pragma Assert (Has_Thunks (Node (Iface_DT_Ptr))); |
a3e461ac | 7519 | Expand_Interface_Thunk (Prim, Thunk_Id, Thunk_Code); |
4907451e | 7520 | |
7521 | if Present (Thunk_Code) then | |
d34432fa | 7522 | Insert_Actions_After (N, New_List ( |
4907451e | 7523 | Thunk_Code, |
7524 | ||
7525 | Build_Set_Predefined_Prim_Op_Address (Loc, | |
8fc2605c | 7526 | Tag_Node => |
83c6c069 | 7527 | New_Occurrence_Of (Node (Next_Elmt (Iface_DT_Ptr)), Loc), |
8fc2605c | 7528 | Position => DT_Position (Prim), |
4907451e | 7529 | Address_Node => |
041aa047 | 7530 | Unchecked_Convert_To (RTE (RE_Prim_Ptr), |
acf97c11 | 7531 | Make_Attribute_Reference (Loc, |
83c6c069 | 7532 | Prefix => New_Occurrence_Of (Thunk_Id, Loc), |
acf97c11 | 7533 | Attribute_Name => Name_Unrestricted_Access))), |
d34432fa | 7534 | |
7535 | Build_Set_Predefined_Prim_Op_Address (Loc, | |
8fc2605c | 7536 | Tag_Node => |
83c6c069 | 7537 | New_Occurrence_Of |
acf97c11 | 7538 | (Node (Next_Elmt (Next_Elmt (Next_Elmt (Iface_DT_Ptr)))), |
7539 | Loc), | |
8fc2605c | 7540 | Position => DT_Position (Prim), |
d34432fa | 7541 | Address_Node => |
041aa047 | 7542 | Unchecked_Convert_To (RTE (RE_Prim_Ptr), |
acf97c11 | 7543 | Make_Attribute_Reference (Loc, |
83c6c069 | 7544 | Prefix => New_Occurrence_Of (Prim, Loc), |
acf97c11 | 7545 | Attribute_Name => Name_Unrestricted_Access))))); |
4907451e | 7546 | end if; |
76a1c25b | 7547 | |
acf97c11 | 7548 | -- Skip the tag of the predefined primitives dispatch table |
7549 | ||
7550 | Next_Elmt (Iface_DT_Ptr); | |
7551 | pragma Assert (Has_Thunks (Node (Iface_DT_Ptr))); | |
7552 | ||
8fc2605c | 7553 | -- Skip tag of the no-thunks dispatch table |
acf97c11 | 7554 | |
7555 | Next_Elmt (Iface_DT_Ptr); | |
7556 | pragma Assert (not Has_Thunks (Node (Iface_DT_Ptr))); | |
7557 | ||
8fc2605c | 7558 | -- Skip tag of predefined primitives no-thunks dispatch table |
acf97c11 | 7559 | |
d34432fa | 7560 | Next_Elmt (Iface_DT_Ptr); |
7561 | pragma Assert (not Has_Thunks (Node (Iface_DT_Ptr))); | |
7562 | ||
76a1c25b | 7563 | Next_Elmt (Iface_DT_Ptr); |
76a1c25b | 7564 | end loop; |
7565 | end Register_Predefined_DT_Entry; | |
7566 | ||
4907451e | 7567 | -- Local variables |
e1c20931 | 7568 | |
bb3b440a | 7569 | Subp : constant Entity_Id := Entity (N); |
e1c20931 | 7570 | |
d34432fa | 7571 | -- Start of processing for Freeze_Subprogram |
7572 | ||
4907451e | 7573 | begin |
a3e461ac | 7574 | -- We suppress the initialization of the dispatch table entry when |
36ac5fbb | 7575 | -- not Tagged_Type_Expansion because the dispatching mechanism is |
7576 | -- handled internally by the target. | |
a3e461ac | 7577 | |
7578 | if Is_Dispatching_Operation (Subp) | |
7579 | and then not Is_Abstract_Subprogram (Subp) | |
7580 | and then Present (DTC_Entity (Subp)) | |
7581 | and then Present (Scope (DTC_Entity (Subp))) | |
662256db | 7582 | and then Tagged_Type_Expansion |
a3e461ac | 7583 | and then not Restriction_Active (No_Dispatching_Calls) |
7584 | and then RTE_Available (RE_Tag) | |
7585 | then | |
4907451e | 7586 | declare |
a3e461ac | 7587 | Typ : constant Entity_Id := Scope (DTC_Entity (Subp)); |
33b6091b | 7588 | |
4907451e | 7589 | begin |
36b938a3 | 7590 | -- Handle private overridden primitives |
33b6091b | 7591 | |
a3e461ac | 7592 | if not Is_CPP_Class (Typ) then |
7593 | Check_Overriding_Operation (Subp); | |
4907451e | 7594 | end if; |
33b6091b | 7595 | |
a3e461ac | 7596 | -- We assume that imported CPP primitives correspond with objects |
7597 | -- whose constructor is in the CPP side; therefore we don't need | |
7598 | -- to generate code to register them in the dispatch table. | |
33b6091b | 7599 | |
a3e461ac | 7600 | if Is_CPP_Class (Typ) then |
7601 | null; | |
e1c20931 | 7602 | |
a3e461ac | 7603 | -- Handle CPP primitives found in derivations of CPP_Class types. |
7604 | -- These primitives must have been inherited from some parent, and | |
7605 | -- there is no need to register them in the dispatch table because | |
2ba58bb7 | 7606 | -- Build_Inherit_Prims takes care of initializing these slots. |
e1c20931 | 7607 | |
a3e461ac | 7608 | elsif Is_Imported (Subp) |
8fc2605c | 7609 | and then (Convention (Subp) = Convention_CPP |
7610 | or else Convention (Subp) = Convention_C) | |
a3e461ac | 7611 | then |
7612 | null; | |
7613 | ||
7614 | -- Generate code to register the primitive in non statically | |
7615 | -- allocated dispatch tables | |
7616 | ||
9a479e51 | 7617 | elsif not Building_Static_DT (Scope (DTC_Entity (Subp))) then |
7618 | ||
a3e461ac | 7619 | -- When a primitive is frozen, enter its name in its dispatch |
7620 | -- table slot. | |
76a1c25b | 7621 | |
a3e461ac | 7622 | if not Is_Interface (Typ) |
a652dd51 | 7623 | or else Present (Interface_Alias (Subp)) |
a3e461ac | 7624 | then |
7625 | if Is_Predefined_Dispatching_Operation (Subp) then | |
7626 | Register_Predefined_DT_Entry (Subp); | |
4907451e | 7627 | end if; |
a3e461ac | 7628 | |
49260fa5 | 7629 | Insert_Actions_After (N, |
7630 | Register_Primitive (Loc, Prim => Subp)); | |
4907451e | 7631 | end if; |
7632 | end if; | |
7633 | end; | |
ee6ba406 | 7634 | end if; |
7635 | ||
4907451e | 7636 | -- Mark functions that return by reference. Note that it cannot be part |
7637 | -- of the normal semantic analysis of the spec since the underlying | |
7638 | -- returned type may not be known yet (for private types). | |
ee6ba406 | 7639 | |
a3e461ac | 7640 | declare |
7641 | Typ : constant Entity_Id := Etype (Subp); | |
7642 | Utyp : constant Entity_Id := Underlying_Type (Typ); | |
1e0f1e8e | 7643 | |
a3e461ac | 7644 | begin |
d7e97115 | 7645 | if Is_Limited_View (Typ) then |
a3e461ac | 7646 | Set_Returns_By_Ref (Subp); |
1e0f1e8e | 7647 | |
45851103 | 7648 | elsif Present (Utyp) and then CW_Or_Has_Controlled_Part (Utyp) then |
a3e461ac | 7649 | Set_Returns_By_Ref (Subp); |
7650 | end if; | |
7651 | end; | |
3701df7c | 7652 | |
7653 | -- Wnen freezing a null procedure, analyze its delayed aspects now | |
7654 | -- because we may not have reached the end of the declarative list when | |
7655 | -- delayed aspects are normally analyzed. This ensures that dispatching | |
7656 | -- calls are properly rewritten when the generated _Postcondition | |
7657 | -- procedure is analyzed in the null procedure body. | |
7658 | ||
7659 | if Nkind (Parent (Subp)) = N_Procedure_Specification | |
7660 | and then Null_Present (Parent (Subp)) | |
7661 | then | |
c02dccca | 7662 | Analyze_Entry_Or_Subprogram_Contract (Subp); |
3701df7c | 7663 | end if; |
ee6ba406 | 7664 | end Freeze_Subprogram; |
7665 | ||
36c80e26 | 7666 | -------------------------------------------- |
7667 | -- Has_Unconstrained_Access_Discriminants -- | |
7668 | -------------------------------------------- | |
7669 | ||
7670 | function Has_Unconstrained_Access_Discriminants | |
7671 | (Subtyp : Entity_Id) return Boolean | |
7672 | is | |
7673 | Discr : Entity_Id; | |
7674 | ||
7675 | begin | |
7676 | if Has_Discriminants (Subtyp) | |
7677 | and then not Is_Constrained (Subtyp) | |
7678 | then | |
7679 | Discr := First_Discriminant (Subtyp); | |
7680 | while Present (Discr) loop | |
7681 | if Ekind (Etype (Discr)) = E_Anonymous_Access_Type then | |
7682 | return True; | |
7683 | end if; | |
7684 | ||
7685 | Next_Discriminant (Discr); | |
7686 | end loop; | |
7687 | end if; | |
7688 | ||
7689 | return False; | |
7690 | end Has_Unconstrained_Access_Discriminants; | |
7691 | ||
f1ce0b4e | 7692 | ------------------------------ |
7693 | -- Insert_Post_Call_Actions -- | |
7694 | ------------------------------ | |
7695 | ||
328d8eaa | 7696 | procedure Insert_Post_Call_Actions (N : Node_Id; Post_Call : List_Id) is |
62b79df4 | 7697 | Context : constant Node_Id := Parent (N); |
7698 | ||
f1ce0b4e | 7699 | begin |
7700 | if Is_Empty_List (Post_Call) then | |
7701 | return; | |
7702 | end if; | |
7703 | ||
328d8eaa | 7704 | -- Cases where the call is not a member of a statement list. This |
7705 | -- includes the case where the call is an actual in another function | |
7706 | -- call or indexing, i.e. an expression context as well. | |
f1ce0b4e | 7707 | |
7708 | if not Is_List_Member (N) | |
62b79df4 | 7709 | or else Nkind_In (Context, N_Function_Call, N_Indexed_Component) |
f1ce0b4e | 7710 | then |
7711 | -- In Ada 2012 the call may be a function call in an expression | |
328d8eaa | 7712 | -- (since OUT and IN OUT parameters are now allowed for such calls). |
7713 | -- The write-back of (in)-out parameters is handled by the back-end, | |
7714 | -- but the constraint checks generated when subtypes of formal and | |
7715 | -- actual don't match must be inserted in the form of assignments. | |
f1ce0b4e | 7716 | |
7717 | if Nkind (Original_Node (N)) = N_Function_Call then | |
7718 | pragma Assert (Ada_Version >= Ada_2012); | |
7719 | -- Functions with '[in] out' parameters are only allowed in Ada | |
7720 | -- 2012. | |
7721 | ||
7722 | -- We used to handle this by climbing up parents to a | |
7723 | -- non-statement/declaration and then simply making a call to | |
7724 | -- Insert_Actions_After (P, Post_Call), but that doesn't work | |
7725 | -- for Ada 2012. If we are in the middle of an expression, e.g. | |
7726 | -- the condition of an IF, this call would insert after the IF | |
328d8eaa | 7727 | -- statement, which is much too late to be doing the write back. |
7728 | -- For example: | |
f1ce0b4e | 7729 | |
7730 | -- if Clobber (X) then | |
7731 | -- Put_Line (X'Img); | |
7732 | -- else | |
7733 | -- goto Junk | |
7734 | -- end if; | |
7735 | ||
328d8eaa | 7736 | -- Now assume Clobber changes X, if we put the write back after |
7737 | -- the IF, the Put_Line gets the wrong value and the goto causes | |
7738 | -- the write back to be skipped completely. | |
f1ce0b4e | 7739 | |
7740 | -- To deal with this, we replace the call by | |
7741 | ||
7742 | -- do | |
7743 | -- Tnnn : constant function-result-type := function-call; | |
7744 | -- Post_Call actions | |
7745 | -- in | |
7746 | -- Tnnn; | |
7747 | -- end; | |
7748 | ||
7749 | declare | |
7750 | Loc : constant Source_Ptr := Sloc (N); | |
7751 | Tnnn : constant Entity_Id := Make_Temporary (Loc, 'T'); | |
7752 | FRTyp : constant Entity_Id := Etype (N); | |
7753 | Name : constant Node_Id := Relocate_Node (N); | |
7754 | ||
7755 | begin | |
7756 | Prepend_To (Post_Call, | |
7757 | Make_Object_Declaration (Loc, | |
7758 | Defining_Identifier => Tnnn, | |
7759 | Object_Definition => New_Occurrence_Of (FRTyp, Loc), | |
7760 | Constant_Present => True, | |
7761 | Expression => Name)); | |
7762 | ||
7763 | Rewrite (N, | |
7764 | Make_Expression_With_Actions (Loc, | |
7765 | Actions => Post_Call, | |
7766 | Expression => New_Occurrence_Of (Tnnn, Loc))); | |
7767 | ||
7768 | -- We don't want to just blindly call Analyze_And_Resolve | |
7769 | -- because that would cause unwanted recursion on the call. | |
7770 | -- So for a moment set the call as analyzed to prevent that | |
7771 | -- recursion, and get the rest analyzed properly, then reset | |
7772 | -- the analyzed flag, so our caller can continue. | |
7773 | ||
7774 | Set_Analyzed (Name, True); | |
7775 | Analyze_And_Resolve (N, FRTyp); | |
7776 | Set_Analyzed (Name, False); | |
7777 | end; | |
7778 | ||
328d8eaa | 7779 | -- If not the special Ada 2012 case of a function call, then we must |
7780 | -- have the triggering statement of a triggering alternative or an | |
7781 | -- entry call alternative, and we can add the post call stuff to the | |
7782 | -- corresponding statement list. | |
f1ce0b4e | 7783 | |
7784 | else | |
62b79df4 | 7785 | pragma Assert (Nkind_In (Context, N_Entry_Call_Alternative, |
7786 | N_Triggering_Alternative)); | |
f1ce0b4e | 7787 | |
62b79df4 | 7788 | if Is_Non_Empty_List (Statements (Context)) then |
7789 | Insert_List_Before_And_Analyze | |
7790 | (First (Statements (Context)), Post_Call); | |
7791 | else | |
7792 | Set_Statements (Context, Post_Call); | |
7793 | end if; | |
f1ce0b4e | 7794 | end if; |
7795 | ||
62b79df4 | 7796 | -- A procedure call is always part of a declarative or statement list, |
7797 | -- however a function call may appear nested within a construct. Most | |
7798 | -- cases of function call nesting are handled in the special case above. | |
7799 | -- The only exception is when the function call acts as an actual in a | |
7800 | -- procedure call. In this case the function call is in a list, but the | |
7801 | -- post-call actions must be inserted after the procedure call. | |
7802 | ||
7803 | elsif Nkind (Context) = N_Procedure_Call_Statement then | |
7804 | Insert_Actions_After (Context, Post_Call); | |
7805 | ||
328d8eaa | 7806 | -- Otherwise, normal case where N is in a statement sequence, just put |
7807 | -- the post-call stuff after the call statement. | |
f1ce0b4e | 7808 | |
7809 | else | |
7810 | Insert_Actions_After (N, Post_Call); | |
7811 | end if; | |
7812 | end Insert_Post_Call_Actions; | |
7813 | ||
36c80e26 | 7814 | ----------------------------------- |
7815 | -- Is_Build_In_Place_Result_Type -- | |
7816 | ----------------------------------- | |
7817 | ||
7818 | function Is_Build_In_Place_Result_Type (Typ : Entity_Id) return Boolean is | |
7819 | begin | |
7820 | if not Expander_Active then | |
7821 | return False; | |
7822 | end if; | |
7823 | ||
7824 | -- In Ada 2005 all functions with an inherently limited return type | |
7825 | -- must be handled using a build-in-place profile, including the case | |
7826 | -- of a function with a limited interface result, where the function | |
7827 | -- may return objects of nonlimited descendants. | |
7828 | ||
7829 | if Is_Limited_View (Typ) then | |
7830 | return Ada_Version >= Ada_2005 and then not Debug_Flag_Dot_L; | |
7831 | ||
7832 | else | |
7833 | if Debug_Flag_Dot_9 then | |
7834 | return False; | |
7835 | end if; | |
7836 | ||
7837 | if Has_Interfaces (Typ) then | |
7838 | return False; | |
7839 | end if; | |
7840 | ||
7841 | declare | |
7842 | T : Entity_Id := Typ; | |
7843 | begin | |
7844 | -- For T'Class, return True if it's True for T. This is necessary | |
7845 | -- because a class-wide function might say "return F (...)", where | |
7846 | -- F returns the corresponding specific type. We need a loop in | |
7847 | -- case T is a subtype of a class-wide type. | |
7848 | ||
7849 | while Is_Class_Wide_Type (T) loop | |
7850 | T := Etype (T); | |
7851 | end loop; | |
7852 | ||
7853 | -- If this is a generic formal type in an instance, return True if | |
7854 | -- it's True for the generic actual type. | |
7855 | ||
7856 | if Nkind (Parent (T)) = N_Subtype_Declaration | |
7857 | and then Present (Generic_Parent_Type (Parent (T))) | |
7858 | then | |
7859 | T := Entity (Subtype_Indication (Parent (T))); | |
7860 | ||
7861 | if Present (Full_View (T)) then | |
7862 | T := Full_View (T); | |
7863 | end if; | |
7864 | end if; | |
7865 | ||
7866 | if Present (Underlying_Type (T)) then | |
7867 | T := Underlying_Type (T); | |
7868 | end if; | |
7869 | ||
7870 | declare | |
7871 | Result : Boolean; | |
7872 | -- So we can stop here in the debugger | |
7873 | begin | |
7874 | -- ???For now, enable build-in-place for a very narrow set of | |
7875 | -- controlled types. Change "if True" to "if False" to | |
7876 | -- experiment with more controlled types. Eventually, we might | |
7877 | -- like to enable build-in-place for all tagged types, all | |
7878 | -- types that need finalization, and all caller-unknown-size | |
7879 | -- types. | |
7880 | ||
7881 | if True then | |
7882 | Result := Is_Controlled (T) | |
7883 | and then Present (Enclosing_Subprogram (T)) | |
7884 | and then not Is_Compilation_Unit (Enclosing_Subprogram (T)) | |
7885 | and then Ekind (Enclosing_Subprogram (T)) = E_Procedure; | |
7886 | else | |
7887 | Result := Is_Controlled (T); | |
7888 | end if; | |
7889 | ||
7890 | return Result; | |
7891 | end; | |
7892 | end; | |
7893 | end if; | |
7894 | end Is_Build_In_Place_Result_Type; | |
7895 | ||
7896 | -------------------------------- | |
7897 | -- Is_Build_In_Place_Function -- | |
7898 | -------------------------------- | |
7899 | ||
7900 | function Is_Build_In_Place_Function (E : Entity_Id) return Boolean is | |
7901 | begin | |
7902 | -- This function is called from Expand_Subtype_From_Expr during | |
7903 | -- semantic analysis, even when expansion is off. In those cases | |
7904 | -- the build_in_place expansion will not take place. | |
7905 | ||
7906 | if not Expander_Active then | |
7907 | return False; | |
7908 | end if; | |
7909 | ||
7910 | -- For now we test whether E denotes a function or access-to-function | |
7911 | -- type whose result subtype is inherently limited. Later this test | |
2d8a0eb3 | 7912 | -- may be revised to allow composite nonlimited types. |
36c80e26 | 7913 | |
7914 | if Ekind_In (E, E_Function, E_Generic_Function) | |
7915 | or else (Ekind (E) = E_Subprogram_Type | |
7916 | and then Etype (E) /= Standard_Void_Type) | |
7917 | then | |
2d8a0eb3 | 7918 | -- If the function is imported from a foreign language, we don't do |
7919 | -- build-in-place. Note that Import (Ada) functions can do | |
7920 | -- build-in-place. Note that it is OK for a build-in-place function | |
7921 | -- to return a type with a foreign convention; the build-in-place | |
7922 | -- machinery will ensure there is no copying. | |
36c80e26 | 7923 | |
7924 | return Is_Build_In_Place_Result_Type (Etype (E)) | |
2d8a0eb3 | 7925 | and then not (Has_Foreign_Convention (E) and then Is_Imported (E)) |
36c80e26 | 7926 | and then not Debug_Flag_Dot_L; |
7927 | else | |
7928 | return False; | |
7929 | end if; | |
7930 | end Is_Build_In_Place_Function; | |
7931 | ||
7932 | ------------------------------------- | |
7933 | -- Is_Build_In_Place_Function_Call -- | |
7934 | ------------------------------------- | |
7935 | ||
7936 | function Is_Build_In_Place_Function_Call (N : Node_Id) return Boolean is | |
7937 | Exp_Node : constant Node_Id := Unqual_Conv (N); | |
7938 | Function_Id : Entity_Id; | |
7939 | ||
7940 | begin | |
7941 | -- Return False if the expander is currently inactive, since awareness | |
7942 | -- of build-in-place treatment is only relevant during expansion. Note | |
7943 | -- that Is_Build_In_Place_Function, which is called as part of this | |
7944 | -- function, is also conditioned this way, but we need to check here as | |
7945 | -- well to avoid blowing up on processing protected calls when expansion | |
7946 | -- is disabled (such as with -gnatc) since those would trip over the | |
7947 | -- raise of Program_Error below. | |
7948 | ||
7949 | -- In SPARK mode, build-in-place calls are not expanded, so that we | |
7950 | -- may end up with a call that is neither resolved to an entity, nor | |
7951 | -- an indirect call. | |
7952 | ||
7953 | if not Expander_Active or else Nkind (Exp_Node) /= N_Function_Call then | |
7954 | return False; | |
7955 | end if; | |
7956 | ||
7957 | if Is_Entity_Name (Name (Exp_Node)) then | |
7958 | Function_Id := Entity (Name (Exp_Node)); | |
7959 | ||
7960 | -- In the case of an explicitly dereferenced call, use the subprogram | |
7961 | -- type generated for the dereference. | |
7962 | ||
7963 | elsif Nkind (Name (Exp_Node)) = N_Explicit_Dereference then | |
7964 | Function_Id := Etype (Name (Exp_Node)); | |
7965 | ||
7966 | -- This may be a call to a protected function. | |
7967 | ||
7968 | elsif Nkind (Name (Exp_Node)) = N_Selected_Component then | |
7969 | Function_Id := Etype (Entity (Selector_Name (Name (Exp_Node)))); | |
7970 | ||
7971 | else | |
7972 | raise Program_Error; | |
7973 | end if; | |
7974 | ||
7975 | declare | |
7976 | Result : constant Boolean := Is_Build_In_Place_Function (Function_Id); | |
7977 | -- So we can stop here in the debugger | |
7978 | begin | |
7979 | return Result; | |
7980 | end; | |
7981 | end Is_Build_In_Place_Function_Call; | |
7982 | ||
a5b5e9bd | 7983 | ----------------------- |
7984 | -- Is_Null_Procedure -- | |
7985 | ----------------------- | |
7986 | ||
7987 | function Is_Null_Procedure (Subp : Entity_Id) return Boolean is | |
7988 | Decl : constant Node_Id := Unit_Declaration_Node (Subp); | |
7989 | ||
7990 | begin | |
7991 | if Ekind (Subp) /= E_Procedure then | |
7992 | return False; | |
7993 | ||
7994 | -- Check if this is a declared null procedure | |
7995 | ||
7996 | elsif Nkind (Decl) = N_Subprogram_Declaration then | |
55bf42ad | 7997 | if not Null_Present (Specification (Decl)) then |
7998 | return False; | |
a5b5e9bd | 7999 | |
8000 | elsif No (Body_To_Inline (Decl)) then | |
8001 | return False; | |
8002 | ||
8003 | -- Check if the body contains only a null statement, followed by | |
8004 | -- the return statement added during expansion. | |
8005 | ||
8006 | else | |
8007 | declare | |
8008 | Orig_Bod : constant Node_Id := Body_To_Inline (Decl); | |
8009 | ||
8010 | Stat : Node_Id; | |
8011 | Stat2 : Node_Id; | |
8012 | ||
8013 | begin | |
8014 | if Nkind (Orig_Bod) /= N_Subprogram_Body then | |
8015 | return False; | |
8016 | else | |
d215f619 | 8017 | -- We must skip SCIL nodes because they are currently |
8018 | -- implemented as special N_Null_Statement nodes. | |
8019 | ||
a5b5e9bd | 8020 | Stat := |
d215f619 | 8021 | First_Non_SCIL_Node |
a5b5e9bd | 8022 | (Statements (Handled_Statement_Sequence (Orig_Bod))); |
d215f619 | 8023 | Stat2 := Next_Non_SCIL_Node (Stat); |
a5b5e9bd | 8024 | |
8025 | return | |
55bf42ad | 8026 | Is_Empty_List (Declarations (Orig_Bod)) |
8027 | and then Nkind (Stat) = N_Null_Statement | |
8028 | and then | |
a5b5e9bd | 8029 | (No (Stat2) |
8030 | or else | |
8031 | (Nkind (Stat2) = N_Simple_Return_Statement | |
8032 | and then No (Next (Stat2)))); | |
8033 | end if; | |
8034 | end; | |
8035 | end if; | |
8036 | ||
8037 | else | |
8038 | return False; | |
8039 | end if; | |
8040 | end Is_Null_Procedure; | |
8041 | ||
578f27c9 | 8042 | ------------------------------------------- |
8043 | -- Make_Build_In_Place_Call_In_Allocator -- | |
8044 | ------------------------------------------- | |
8045 | ||
8046 | procedure Make_Build_In_Place_Call_In_Allocator | |
8047 | (Allocator : Node_Id; | |
8048 | Function_Call : Node_Id) | |
8049 | is | |
3b21faf2 | 8050 | Acc_Type : constant Entity_Id := Etype (Allocator); |
fe48a434 | 8051 | Loc : constant Source_Ptr := Sloc (Function_Call); |
578f27c9 | 8052 | Func_Call : Node_Id := Function_Call; |
baac2ff7 | 8053 | Ref_Func_Call : Node_Id; |
578f27c9 | 8054 | Function_Id : Entity_Id; |
8055 | Result_Subt : Entity_Id; | |
578f27c9 | 8056 | New_Allocator : Node_Id; |
baac2ff7 | 8057 | Return_Obj_Access : Entity_Id; -- temp for function result |
8058 | Temp_Init : Node_Id; -- initial value of Return_Obj_Access | |
8059 | Alloc_Form : BIP_Allocation_Form; | |
8060 | Pool : Node_Id; -- nonnull if Alloc_Form = User_Storage_Pool | |
8061 | Return_Obj_Actual : Node_Id; -- the temp.all, in caller-allocates case | |
8062 | Chain : Entity_Id; -- activation chain, in case of tasks | |
578f27c9 | 8063 | |
8064 | begin | |
236f09e1 | 8065 | -- Step past qualification or unchecked conversion (the latter can occur |
8066 | -- in cases of calls to 'Input). | |
8067 | ||
36c80e26 | 8068 | if Nkind_In (Func_Call, N_Qualified_Expression, |
8069 | N_Type_Conversion, | |
8070 | N_Unchecked_Type_Conversion) | |
236f09e1 | 8071 | then |
578f27c9 | 8072 | Func_Call := Expression (Func_Call); |
8073 | end if; | |
8074 | ||
fdd18a7c | 8075 | -- Mark the call as processed as a build-in-place call |
8076 | ||
cd24e497 | 8077 | pragma Assert (not Is_Expanded_Build_In_Place_Call (Func_Call)); |
fdd18a7c | 8078 | Set_Is_Expanded_Build_In_Place_Call (Func_Call); |
8079 | ||
578f27c9 | 8080 | if Is_Entity_Name (Name (Func_Call)) then |
8081 | Function_Id := Entity (Name (Func_Call)); | |
8082 | ||
8083 | elsif Nkind (Name (Func_Call)) = N_Explicit_Dereference then | |
8084 | Function_Id := Etype (Name (Func_Call)); | |
8085 | ||
8086 | else | |
8087 | raise Program_Error; | |
8088 | end if; | |
8089 | ||
3b21faf2 | 8090 | Result_Subt := Available_View (Etype (Function_Id)); |
578f27c9 | 8091 | |
baac2ff7 | 8092 | -- Create a temp for the function result. In the caller-allocates case, |
8093 | -- this will be initialized to the result of a new uninitialized | |
8094 | -- allocator. Note: we do not use Allocator as the Related_Node of | |
8095 | -- Return_Obj_Access in call to Make_Temporary below as this would | |
8096 | -- create a sort of infinite "recursion". | |
96c33aee | 8097 | |
baac2ff7 | 8098 | Return_Obj_Access := Make_Temporary (Loc, 'R'); |
8099 | Set_Etype (Return_Obj_Access, Acc_Type); | |
cd24e497 | 8100 | Set_Can_Never_Be_Null (Acc_Type, False); |
e0e76328 | 8101 | -- It gets initialized to null, so we can't have that |
96c33aee | 8102 | |
36c80e26 | 8103 | -- When the result subtype is constrained, the return object is created |
8104 | -- on the caller side, and access to it is passed to the function. This | |
8105 | -- optimization is disabled when the result subtype needs finalization | |
8106 | -- actions because the caller side allocation may result in undesirable | |
8107 | -- finalization. Consider the following example: | |
8108 | -- | |
8109 | -- function Make_Lim_Ctrl return Lim_Ctrl is | |
8110 | -- begin | |
8111 | -- return Result : Lim_Ctrl := raise Program_Error do | |
8112 | -- null; | |
8113 | -- end return; | |
8114 | -- end Make_Lim_Ctrl; | |
8115 | -- | |
8116 | -- Obj : Lim_Ctrl_Ptr := new Lim_Ctrl'(Make_Lim_Ctrl); | |
8117 | -- | |
8118 | -- Even though the size of limited controlled type Lim_Ctrl is known, | |
8119 | -- allocating Obj at the caller side will chain Obj on Lim_Ctrl_Ptr's | |
8120 | -- finalization master. The subsequent call to Make_Lim_Ctrl will fail | |
8121 | -- during the initialization actions for Result, which implies that | |
8122 | -- Result (and Obj by extension) should not be finalized. However Obj | |
8123 | -- will be finalized when access type Lim_Ctrl_Ptr goes out of scope | |
8124 | -- since it is already attached on the related finalization master. | |
578f27c9 | 8125 | |
4907451e | 8126 | -- Here and in related routines, we must examine the full view of the |
80012fc8 | 8127 | -- type, because the view at the point of call may differ from the |
8128 | -- one in the function body, and the expansion mechanism depends on | |
4907451e | 8129 | -- the characteristics of the full view. |
8130 | ||
80012fc8 | 8131 | if Needs_BIP_Alloc_Form (Function_Id) then |
8132 | Temp_Init := Empty; | |
8133 | ||
8134 | -- Case of a user-defined storage pool. Pass an allocation parameter | |
8135 | -- indicating that the function should allocate its result in the | |
8136 | -- pool, and pass the pool. Use 'Unrestricted_Access because the | |
8137 | -- pool may not be aliased. | |
8138 | ||
8139 | if Present (Associated_Storage_Pool (Acc_Type)) then | |
8140 | Alloc_Form := User_Storage_Pool; | |
8141 | Pool := | |
8142 | Make_Attribute_Reference (Loc, | |
8143 | Prefix => | |
8144 | New_Occurrence_Of | |
8145 | (Associated_Storage_Pool (Acc_Type), Loc), | |
8146 | Attribute_Name => Name_Unrestricted_Access); | |
8147 | ||
8148 | -- No user-defined pool; pass an allocation parameter indicating that | |
8149 | -- the function should allocate its result on the heap. | |
8150 | ||
8151 | else | |
8152 | Alloc_Form := Global_Heap; | |
8153 | Pool := Make_Null (No_Location); | |
8154 | end if; | |
8155 | ||
8156 | -- The caller does not provide the return object in this case, so we | |
8157 | -- have to pass null for the object access actual. | |
8158 | ||
8159 | Return_Obj_Actual := Empty; | |
8160 | ||
8161 | else | |
21ec6442 | 8162 | -- Replace the initialized allocator of form "new T'(Func (...))" |
8163 | -- with an uninitialized allocator of form "new T", where T is the | |
8164 | -- result subtype of the called function. The call to the function | |
8165 | -- is handled separately further below. | |
578f27c9 | 8166 | |
21ec6442 | 8167 | New_Allocator := |
19b4517d | 8168 | Make_Allocator (Loc, |
83c6c069 | 8169 | Expression => New_Occurrence_Of (Result_Subt, Loc)); |
19b4517d | 8170 | Set_No_Initialization (New_Allocator); |
8171 | ||
8172 | -- Copy attributes to new allocator. Note that the new allocator | |
8173 | -- logically comes from source if the original one did, so copy the | |
8174 | -- relevant flag. This ensures proper treatment of the restriction | |
8175 | -- No_Implicit_Heap_Allocations in this case. | |
578f27c9 | 8176 | |
19b4517d | 8177 | Set_Storage_Pool (New_Allocator, Storage_Pool (Allocator)); |
21ec6442 | 8178 | Set_Procedure_To_Call (New_Allocator, Procedure_To_Call (Allocator)); |
19b4517d | 8179 | Set_Comes_From_Source (New_Allocator, Comes_From_Source (Allocator)); |
578f27c9 | 8180 | |
21ec6442 | 8181 | Rewrite (Allocator, New_Allocator); |
578f27c9 | 8182 | |
baac2ff7 | 8183 | -- Initial value of the temp is the result of the uninitialized |
fe48a434 | 8184 | -- allocator. Unchecked_Convert is needed for T'Input where T is |
8185 | -- derived from a controlled type. | |
578f27c9 | 8186 | |
baac2ff7 | 8187 | Temp_Init := Relocate_Node (Allocator); |
21ec6442 | 8188 | |
36c80e26 | 8189 | if Nkind_In (Function_Call, N_Type_Conversion, |
8190 | N_Unchecked_Type_Conversion) | |
fe48a434 | 8191 | then |
8192 | Temp_Init := Unchecked_Convert_To (Acc_Type, Temp_Init); | |
8193 | end if; | |
8194 | ||
baac2ff7 | 8195 | -- Indicate that caller allocates, and pass in the return object |
8196 | ||
8197 | Alloc_Form := Caller_Allocation; | |
8198 | Pool := Make_Null (No_Location); | |
8199 | Return_Obj_Actual := | |
8200 | Make_Unchecked_Type_Conversion (Loc, | |
8201 | Subtype_Mark => New_Occurrence_Of (Result_Subt, Loc), | |
8202 | Expression => | |
8203 | Make_Explicit_Dereference (Loc, | |
8204 | Prefix => New_Occurrence_Of (Return_Obj_Access, Loc))); | |
21ec6442 | 8205 | |
8206 | -- When the result subtype is unconstrained, the function itself must | |
8207 | -- perform the allocation of the return object, so we pass parameters | |
baac2ff7 | 8208 | -- indicating that. |
21ec6442 | 8209 | |
baac2ff7 | 8210 | end if; |
8211 | ||
8212 | -- Declare the temp object | |
8213 | ||
8214 | Insert_Action (Allocator, | |
8215 | Make_Object_Declaration (Loc, | |
8216 | Defining_Identifier => Return_Obj_Access, | |
8217 | Object_Definition => New_Occurrence_Of (Acc_Type, Loc), | |
8218 | Expression => Temp_Init)); | |
8219 | ||
8220 | Ref_Func_Call := Make_Reference (Loc, Func_Call); | |
8221 | ||
8222 | -- Ada 2005 (AI-251): If the type of the allocator is an interface | |
8223 | -- then generate an implicit conversion to force displacement of the | |
8224 | -- "this" pointer. | |
8225 | ||
8226 | if Is_Interface (Designated_Type (Acc_Type)) then | |
8227 | Rewrite | |
8228 | (Ref_Func_Call, | |
8229 | OK_Convert_To (Acc_Type, Ref_Func_Call)); | |
fe48a434 | 8230 | |
8231 | -- If the types are incompatible, we need an unchecked conversion. Note | |
8232 | -- that the full types will be compatible, but the types not visibly | |
8233 | -- compatible. | |
8234 | ||
36c80e26 | 8235 | elsif Nkind_In (Function_Call, N_Type_Conversion, |
8236 | N_Unchecked_Type_Conversion) | |
fe48a434 | 8237 | then |
8238 | Ref_Func_Call := Unchecked_Convert_To (Acc_Type, Ref_Func_Call); | |
21ec6442 | 8239 | end if; |
578f27c9 | 8240 | |
baac2ff7 | 8241 | declare |
8242 | Assign : constant Node_Id := | |
36c80e26 | 8243 | Make_Assignment_Statement (Loc, |
8244 | Name => New_Occurrence_Of (Return_Obj_Access, Loc), | |
8245 | Expression => Ref_Func_Call); | |
baac2ff7 | 8246 | -- Assign the result of the function call into the temp. In the |
8247 | -- caller-allocates case, this is overwriting the temp with its | |
8248 | -- initial value, which has no effect. In the callee-allocates case, | |
8249 | -- this is setting the temp to point to the object allocated by the | |
fe48a434 | 8250 | -- callee. Unchecked_Convert is needed for T'Input where T is derived |
8251 | -- from a controlled type. | |
baac2ff7 | 8252 | |
8253 | Actions : List_Id; | |
8254 | -- Actions to be inserted. If there are no tasks, this is just the | |
8255 | -- assignment statement. If the allocated object has tasks, we need | |
8256 | -- to wrap the assignment in a block that activates them. The | |
8257 | -- activation chain of that block must be passed to the function, | |
8258 | -- rather than some outer chain. | |
36c80e26 | 8259 | |
baac2ff7 | 8260 | begin |
8261 | if Has_Task (Result_Subt) then | |
8262 | Actions := New_List; | |
8263 | Build_Task_Allocate_Block_With_Init_Stmts | |
8264 | (Actions, Allocator, Init_Stmts => New_List (Assign)); | |
8265 | Chain := Activation_Chain_Entity (Last (Actions)); | |
8266 | else | |
8267 | Actions := New_List (Assign); | |
8268 | Chain := Empty; | |
8269 | end if; | |
8270 | ||
8271 | Insert_Actions (Allocator, Actions); | |
8272 | end; | |
8273 | ||
8274 | -- When the function has a controlling result, an allocation-form | |
8275 | -- parameter must be passed indicating that the caller is allocating | |
8276 | -- the result object. This is needed because such a function can be | |
8277 | -- called as a dispatching operation and must be treated similarly | |
8278 | -- to functions with unconstrained result subtypes. | |
8279 | ||
8280 | Add_Unconstrained_Actuals_To_Build_In_Place_Call | |
8281 | (Func_Call, Function_Id, Alloc_Form, Pool_Actual => Pool); | |
8282 | ||
8283 | Add_Finalization_Master_Actual_To_Build_In_Place_Call | |
8284 | (Func_Call, Function_Id, Acc_Type); | |
8285 | ||
8286 | Add_Task_Actuals_To_Build_In_Place_Call | |
8287 | (Func_Call, Function_Id, Master_Actual => Master_Id (Acc_Type), | |
8288 | Chain => Chain); | |
8289 | ||
8290 | -- Add an implicit actual to the function call that provides access | |
8291 | -- to the allocated object. An unchecked conversion to the (specific) | |
8292 | -- result subtype of the function is inserted to handle cases where | |
8293 | -- the access type of the allocator has a class-wide designated type. | |
8294 | ||
8295 | Add_Access_Actual_To_Build_In_Place_Call | |
8296 | (Func_Call, Function_Id, Return_Obj_Actual); | |
8297 | ||
baac2ff7 | 8298 | -- Finally, replace the allocator node with a reference to the temp |
578f27c9 | 8299 | |
baac2ff7 | 8300 | Rewrite (Allocator, New_Occurrence_Of (Return_Obj_Access, Loc)); |
00234530 | 8301 | |
578f27c9 | 8302 | Analyze_And_Resolve (Allocator, Acc_Type); |
8303 | end Make_Build_In_Place_Call_In_Allocator; | |
8304 | ||
8305 | --------------------------------------------------- | |
8306 | -- Make_Build_In_Place_Call_In_Anonymous_Context -- | |
8307 | --------------------------------------------------- | |
8308 | ||
8309 | procedure Make_Build_In_Place_Call_In_Anonymous_Context | |
8310 | (Function_Call : Node_Id) | |
8311 | is | |
fe48a434 | 8312 | Loc : constant Source_Ptr := Sloc (Function_Call); |
37066559 | 8313 | Func_Call : constant Node_Id := Unqual_Conv (Function_Call); |
578f27c9 | 8314 | Function_Id : Entity_Id; |
8315 | Result_Subt : Entity_Id; | |
8316 | Return_Obj_Id : Entity_Id; | |
8317 | Return_Obj_Decl : Entity_Id; | |
8318 | ||
8319 | begin | |
fdd18a7c | 8320 | -- If the call has already been processed to add build-in-place actuals |
8321 | -- then return. One place this can occur is for calls to build-in-place | |
8322 | -- functions that occur within a call to a protected operation, where | |
8323 | -- due to rewriting and expansion of the protected call there can be | |
8324 | -- more than one call to Expand_Actuals for the same set of actuals. | |
8325 | ||
8326 | if Is_Expanded_Build_In_Place_Call (Func_Call) then | |
8327 | return; | |
8328 | end if; | |
8329 | ||
8330 | -- Mark the call as processed as a build-in-place call | |
8331 | ||
8332 | Set_Is_Expanded_Build_In_Place_Call (Func_Call); | |
8333 | ||
578f27c9 | 8334 | if Is_Entity_Name (Name (Func_Call)) then |
8335 | Function_Id := Entity (Name (Func_Call)); | |
8336 | ||
8337 | elsif Nkind (Name (Func_Call)) = N_Explicit_Dereference then | |
8338 | Function_Id := Etype (Name (Func_Call)); | |
8339 | ||
8340 | else | |
8341 | raise Program_Error; | |
8342 | end if; | |
8343 | ||
8344 | Result_Subt := Etype (Function_Id); | |
8345 | ||
bb3b440a | 8346 | -- If the build-in-place function returns a controlled object, then the |
8347 | -- object needs to be finalized immediately after the context. Since | |
8348 | -- this case produces a transient scope, the servicing finalizer needs | |
8349 | -- to name the returned object. Create a temporary which is initialized | |
8350 | -- with the function call: | |
8351 | -- | |
8352 | -- Temp_Id : Func_Type := BIP_Func_Call; | |
8353 | -- | |
8354 | -- The initialization expression of the temporary will be rewritten by | |
8355 | -- the expander using the appropriate mechanism in Make_Build_In_Place_ | |
8356 | -- Call_In_Object_Declaration. | |
8357 | ||
8358 | if Needs_Finalization (Result_Subt) then | |
8359 | declare | |
8360 | Temp_Id : constant Entity_Id := Make_Temporary (Loc, 'R'); | |
8361 | Temp_Decl : Node_Id; | |
8362 | ||
8363 | begin | |
8364 | -- Reset the guard on the function call since the following does | |
8365 | -- not perform actual call expansion. | |
8366 | ||
8367 | Set_Is_Expanded_Build_In_Place_Call (Func_Call, False); | |
8368 | ||
8369 | Temp_Decl := | |
8370 | Make_Object_Declaration (Loc, | |
8371 | Defining_Identifier => Temp_Id, | |
8372 | Object_Definition => | |
83c6c069 | 8373 | New_Occurrence_Of (Result_Subt, Loc), |
bb3b440a | 8374 | Expression => |
8375 | New_Copy_Tree (Function_Call)); | |
8376 | ||
8377 | Insert_Action (Function_Call, Temp_Decl); | |
8378 | ||
83c6c069 | 8379 | Rewrite (Function_Call, New_Occurrence_Of (Temp_Id, Loc)); |
bb3b440a | 8380 | Analyze (Function_Call); |
8381 | end; | |
8382 | ||
1d0930b5 | 8383 | -- When the result subtype is definite, an object of the subtype is |
21ec6442 | 8384 | -- declared and an access value designating it is passed as an actual. |
578f27c9 | 8385 | |
37066559 | 8386 | elsif Caller_Known_Size (Func_Call, Result_Subt) then |
578f27c9 | 8387 | |
21ec6442 | 8388 | -- Create a temporary object to hold the function result |
8389 | ||
e0394eca | 8390 | Return_Obj_Id := Make_Temporary (Loc, 'R'); |
21ec6442 | 8391 | Set_Etype (Return_Obj_Id, Result_Subt); |
578f27c9 | 8392 | |
21ec6442 | 8393 | Return_Obj_Decl := |
8394 | Make_Object_Declaration (Loc, | |
8395 | Defining_Identifier => Return_Obj_Id, | |
8396 | Aliased_Present => True, | |
83c6c069 | 8397 | Object_Definition => New_Occurrence_Of (Result_Subt, Loc)); |
578f27c9 | 8398 | |
21ec6442 | 8399 | Set_No_Initialization (Return_Obj_Decl); |
578f27c9 | 8400 | |
21ec6442 | 8401 | Insert_Action (Func_Call, Return_Obj_Decl); |
578f27c9 | 8402 | |
4907451e | 8403 | -- When the function has a controlling result, an allocation-form |
8404 | -- parameter must be passed indicating that the caller is allocating | |
8405 | -- the result object. This is needed because such a function can be | |
8406 | -- called as a dispatching operation and must be treated similarly | |
8407 | -- to functions with unconstrained result subtypes. | |
8408 | ||
52b3bcf2 | 8409 | Add_Unconstrained_Actuals_To_Build_In_Place_Call |
4907451e | 8410 | (Func_Call, Function_Id, Alloc_Form => Caller_Allocation); |
8411 | ||
57acff55 | 8412 | Add_Finalization_Master_Actual_To_Build_In_Place_Call |
bb3b440a | 8413 | (Func_Call, Function_Id); |
21ec6442 | 8414 | |
21ec6442 | 8415 | Add_Task_Actuals_To_Build_In_Place_Call |
8416 | (Func_Call, Function_Id, Make_Identifier (Loc, Name_uMaster)); | |
4907451e | 8417 | |
8418 | -- Add an implicit actual to the function call that provides access | |
8419 | -- to the caller's return object. | |
8420 | ||
21ec6442 | 8421 | Add_Access_Actual_To_Build_In_Place_Call |
83c6c069 | 8422 | (Func_Call, Function_Id, New_Occurrence_Of (Return_Obj_Id, Loc)); |
21ec6442 | 8423 | |
8424 | -- When the result subtype is unconstrained, the function must allocate | |
8425 | -- the return object in the secondary stack, so appropriate implicit | |
8426 | -- parameters are added to the call to indicate that. A transient | |
8427 | -- scope is established to ensure eventual cleanup of the result. | |
8428 | ||
8429 | else | |
8430 | -- Pass an allocation parameter indicating that the function should | |
8431 | -- allocate its result on the secondary stack. | |
8432 | ||
52b3bcf2 | 8433 | Add_Unconstrained_Actuals_To_Build_In_Place_Call |
21ec6442 | 8434 | (Func_Call, Function_Id, Alloc_Form => Secondary_Stack); |
8435 | ||
57acff55 | 8436 | Add_Finalization_Master_Actual_To_Build_In_Place_Call |
bb3b440a | 8437 | (Func_Call, Function_Id); |
21ec6442 | 8438 | |
21ec6442 | 8439 | Add_Task_Actuals_To_Build_In_Place_Call |
8440 | (Func_Call, Function_Id, Make_Identifier (Loc, Name_uMaster)); | |
4907451e | 8441 | |
8442 | -- Pass a null value to the function since no return object is | |
8443 | -- available on the caller side. | |
8444 | ||
21ec6442 | 8445 | Add_Access_Actual_To_Build_In_Place_Call |
8446 | (Func_Call, Function_Id, Empty); | |
21ec6442 | 8447 | end if; |
578f27c9 | 8448 | end Make_Build_In_Place_Call_In_Anonymous_Context; |
8449 | ||
52c4f4e6 | 8450 | -------------------------------------------- |
578f27c9 | 8451 | -- Make_Build_In_Place_Call_In_Assignment -- |
52c4f4e6 | 8452 | -------------------------------------------- |
578f27c9 | 8453 | |
8454 | procedure Make_Build_In_Place_Call_In_Assignment | |
8455 | (Assign : Node_Id; | |
8456 | Function_Call : Node_Id) | |
8457 | is | |
e0e76328 | 8458 | Func_Call : constant Node_Id := Unqual_Conv (Function_Call); |
8459 | Lhs : constant Node_Id := Name (Assign); | |
cd24e497 | 8460 | Loc : constant Source_Ptr := Sloc (Function_Call); |
e0e76328 | 8461 | Func_Id : Entity_Id; |
035e891d | 8462 | Obj_Decl : Node_Id; |
8463 | Obj_Id : Entity_Id; | |
8464 | Ptr_Typ : Entity_Id; | |
8465 | Ptr_Typ_Decl : Node_Id; | |
472ea160 | 8466 | New_Expr : Node_Id; |
035e891d | 8467 | Result_Subt : Entity_Id; |
578f27c9 | 8468 | |
8469 | begin | |
fdd18a7c | 8470 | -- Mark the call as processed as a build-in-place call |
8471 | ||
cd24e497 | 8472 | pragma Assert (not Is_Expanded_Build_In_Place_Call (Func_Call)); |
fdd18a7c | 8473 | Set_Is_Expanded_Build_In_Place_Call (Func_Call); |
8474 | ||
578f27c9 | 8475 | if Is_Entity_Name (Name (Func_Call)) then |
035e891d | 8476 | Func_Id := Entity (Name (Func_Call)); |
578f27c9 | 8477 | |
8478 | elsif Nkind (Name (Func_Call)) = N_Explicit_Dereference then | |
035e891d | 8479 | Func_Id := Etype (Name (Func_Call)); |
578f27c9 | 8480 | |
8481 | else | |
8482 | raise Program_Error; | |
8483 | end if; | |
8484 | ||
035e891d | 8485 | Result_Subt := Etype (Func_Id); |
578f27c9 | 8486 | |
21ec6442 | 8487 | -- When the result subtype is unconstrained, an additional actual must |
8488 | -- be passed to indicate that the caller is providing the return object. | |
4907451e | 8489 | -- This parameter must also be passed when the called function has a |
8490 | -- controlling result, because dispatching calls to the function needs | |
8491 | -- to be treated effectively the same as calls to class-wide functions. | |
21ec6442 | 8492 | |
52b3bcf2 | 8493 | Add_Unconstrained_Actuals_To_Build_In_Place_Call |
035e891d | 8494 | (Func_Call, Func_Id, Alloc_Form => Caller_Allocation); |
21ec6442 | 8495 | |
57acff55 | 8496 | Add_Finalization_Master_Actual_To_Build_In_Place_Call |
bb3b440a | 8497 | (Func_Call, Func_Id); |
578f27c9 | 8498 | |
21ec6442 | 8499 | Add_Task_Actuals_To_Build_In_Place_Call |
035e891d | 8500 | (Func_Call, Func_Id, Make_Identifier (Loc, Name_uMaster)); |
4907451e | 8501 | |
8502 | -- Add an implicit actual to the function call that provides access to | |
8503 | -- the caller's return object. | |
8504 | ||
578f27c9 | 8505 | Add_Access_Actual_To_Build_In_Place_Call |
8506 | (Func_Call, | |
035e891d | 8507 | Func_Id, |
578f27c9 | 8508 | Make_Unchecked_Type_Conversion (Loc, |
83c6c069 | 8509 | Subtype_Mark => New_Occurrence_Of (Result_Subt, Loc), |
578f27c9 | 8510 | Expression => Relocate_Node (Lhs))); |
8511 | ||
8512 | -- Create an access type designating the function's result subtype | |
8513 | ||
e0394eca | 8514 | Ptr_Typ := Make_Temporary (Loc, 'A'); |
578f27c9 | 8515 | |
8516 | Ptr_Typ_Decl := | |
8517 | Make_Full_Type_Declaration (Loc, | |
035e891d | 8518 | Defining_Identifier => Ptr_Typ, |
b3190af0 | 8519 | Type_Definition => |
578f27c9 | 8520 | Make_Access_To_Object_Definition (Loc, |
b3190af0 | 8521 | All_Present => True, |
578f27c9 | 8522 | Subtype_Indication => |
83c6c069 | 8523 | New_Occurrence_Of (Result_Subt, Loc))); |
578f27c9 | 8524 | Insert_After_And_Analyze (Assign, Ptr_Typ_Decl); |
8525 | ||
8526 | -- Finally, create an access object initialized to a reference to the | |
23056195 | 8527 | -- function call. We know this access value is non-null, so mark the |
8528 | -- entity accordingly to suppress junk access checks. | |
578f27c9 | 8529 | |
472ea160 | 8530 | New_Expr := Make_Reference (Loc, Relocate_Node (Func_Call)); |
8531 | ||
cd24e497 | 8532 | -- Add a conversion if it's the wrong type |
8533 | ||
8534 | if Etype (New_Expr) /= Ptr_Typ then | |
e0e76328 | 8535 | New_Expr := |
8536 | Make_Unchecked_Type_Conversion (Loc, | |
8537 | New_Occurrence_Of (Ptr_Typ, Loc), New_Expr); | |
cd24e497 | 8538 | end if; |
8539 | ||
472ea160 | 8540 | Obj_Id := Make_Temporary (Loc, 'R', New_Expr); |
035e891d | 8541 | Set_Etype (Obj_Id, Ptr_Typ); |
472ea160 | 8542 | Set_Is_Known_Non_Null (Obj_Id); |
578f27c9 | 8543 | |
035e891d | 8544 | Obj_Decl := |
578f27c9 | 8545 | Make_Object_Declaration (Loc, |
035e891d | 8546 | Defining_Identifier => Obj_Id, |
83c6c069 | 8547 | Object_Definition => New_Occurrence_Of (Ptr_Typ, Loc), |
472ea160 | 8548 | Expression => New_Expr); |
035e891d | 8549 | Insert_After_And_Analyze (Ptr_Typ_Decl, Obj_Decl); |
578f27c9 | 8550 | |
8551 | Rewrite (Assign, Make_Null_Statement (Loc)); | |
8552 | end Make_Build_In_Place_Call_In_Assignment; | |
8553 | ||
8554 | ---------------------------------------------------- | |
8555 | -- Make_Build_In_Place_Call_In_Object_Declaration -- | |
8556 | ---------------------------------------------------- | |
8557 | ||
8558 | procedure Make_Build_In_Place_Call_In_Object_Declaration | |
f1cabbf4 | 8559 | (Obj_Decl : Node_Id; |
578f27c9 | 8560 | Function_Call : Node_Id) |
8561 | is | |
9a666241 | 8562 | function Get_Function_Id (Func_Call : Node_Id) return Entity_Id; |
8563 | -- Get the value of Function_Id, below | |
8564 | ||
e0e76328 | 8565 | --------------------- |
8566 | -- Get_Function_Id -- | |
8567 | --------------------- | |
8568 | ||
9a666241 | 8569 | function Get_Function_Id (Func_Call : Node_Id) return Entity_Id is |
8570 | begin | |
8571 | if Is_Entity_Name (Name (Func_Call)) then | |
8572 | return Entity (Name (Func_Call)); | |
8573 | ||
8574 | elsif Nkind (Name (Func_Call)) = N_Explicit_Dereference then | |
8575 | return Etype (Name (Func_Call)); | |
8576 | ||
8577 | else | |
8578 | raise Program_Error; | |
8579 | end if; | |
8580 | end Get_Function_Id; | |
8581 | ||
e0e76328 | 8582 | -- Local variables |
9a666241 | 8583 | |
e0e76328 | 8584 | Func_Call : constant Node_Id := Unqual_Conv (Function_Call); |
8585 | Function_Id : constant Entity_Id := Get_Function_Id (Func_Call); | |
8586 | Loc : constant Source_Ptr := Sloc (Function_Call); | |
8587 | Obj_Loc : constant Source_Ptr := Sloc (Obj_Decl); | |
8588 | Obj_Def_Id : constant Entity_Id := Defining_Identifier (Obj_Decl); | |
8589 | Obj_Typ : constant Entity_Id := Etype (Obj_Def_Id); | |
8590 | Encl_Func : constant Entity_Id := Enclosing_Subprogram (Obj_Def_Id); | |
8591 | Result_Subt : constant Entity_Id := Etype (Function_Id); | |
f1cabbf4 | 8592 | |
3295b1fa | 8593 | Call_Deref : Node_Id; |
8594 | Caller_Object : Node_Id; | |
8595 | Def_Id : Entity_Id; | |
e0e76328 | 8596 | Designated_Type : Entity_Id; |
e4caa3ff | 8597 | Fmaster_Actual : Node_Id := Empty; |
3295b1fa | 8598 | Pool_Actual : Node_Id; |
0fa54be6 | 8599 | Ptr_Typ : Entity_Id; |
3295b1fa | 8600 | Ptr_Typ_Decl : Node_Id; |
21ec6442 | 8601 | Pass_Caller_Acc : Boolean := False; |
285cdf4d | 8602 | Res_Decl : Node_Id; |
9a666241 | 8603 | |
8604 | Definite : constant Boolean := | |
8605 | Caller_Known_Size (Func_Call, Result_Subt) | |
e0e76328 | 8606 | and then not Is_Class_Wide_Type (Obj_Typ); |
9a666241 | 8607 | -- In the case of "X : T'Class := F(...);", where F returns a |
8608 | -- Caller_Known_Size (specific) tagged type, we treat it as | |
8609 | -- indefinite, because the code for the Definite case below sets the | |
8610 | -- initialization expression of the object to Empty, which would be | |
c5685d96 | 8611 | -- illegal Ada, and would cause gigi to misallocate X. |
8612 | ||
8613 | -- Start of processing for Make_Build_In_Place_Call_In_Object_Declaration | |
6287ef56 | 8614 | |
578f27c9 | 8615 | begin |
c5685d96 | 8616 | -- If the call has already been processed to add build-in-place actuals |
8617 | -- then return. | |
8618 | ||
8619 | if Is_Expanded_Build_In_Place_Call (Func_Call) then | |
8620 | return; | |
8621 | end if; | |
8622 | ||
fdd18a7c | 8623 | -- Mark the call as processed as a build-in-place call |
8624 | ||
8625 | Set_Is_Expanded_Build_In_Place_Call (Func_Call); | |
8626 | ||
9a666241 | 8627 | -- Create an access type designating the function's result subtype. |
8628 | -- We use the type of the original call because it may be a call to an | |
8629 | -- inherited operation, which the expansion has replaced with the parent | |
8630 | -- operation that yields the parent type. Note that this access type | |
8631 | -- must be declared before we establish a transient scope, so that it | |
8632 | -- receives the proper accessibility level. | |
578f27c9 | 8633 | |
9a666241 | 8634 | if Is_Class_Wide_Type (Obj_Typ) |
8635 | and then not Is_Interface (Obj_Typ) | |
8636 | and then not Is_Class_Wide_Type (Etype (Function_Call)) | |
8637 | then | |
8638 | Designated_Type := Obj_Typ; | |
8639 | else | |
8640 | Designated_Type := Etype (Function_Call); | |
8641 | end if; | |
578f27c9 | 8642 | |
9a666241 | 8643 | Ptr_Typ := Make_Temporary (Loc, 'A'); |
8644 | Ptr_Typ_Decl := | |
8645 | Make_Full_Type_Declaration (Loc, | |
8646 | Defining_Identifier => Ptr_Typ, | |
8647 | Type_Definition => | |
8648 | Make_Access_To_Object_Definition (Loc, | |
8649 | All_Present => True, | |
8650 | Subtype_Indication => | |
8651 | New_Occurrence_Of (Designated_Type, Loc))); | |
8652 | ||
8653 | -- The access type and its accompanying object must be inserted after | |
8654 | -- the object declaration in the constrained case, so that the function | |
8655 | -- call can be passed access to the object. In the indefinite case, or | |
8656 | -- if the object declaration is for a return object, the access type and | |
8657 | -- object must be inserted before the object, since the object | |
8658 | -- declaration is rewritten to be a renaming of a dereference of the | |
8659 | -- access object. Note: we need to freeze Ptr_Typ explicitly, because | |
8660 | -- the result object is in a different (transient) scope, so won't cause | |
8661 | -- freezing. | |
8662 | ||
e0e76328 | 8663 | if Definite and then not Is_Return_Object (Obj_Def_Id) then |
1ab3cdde | 8664 | |
8665 | -- The presence of an address clause complicates the build-in-place | |
8666 | -- expansion because the indicated address must be processed before | |
8667 | -- the indirect call is generated (including the definition of a | |
06d78d4c | 8668 | -- local pointer to the object). The address clause may come from |
1ab3cdde | 8669 | -- an aspect specification or from an explicit attribute |
8670 | -- specification appearing after the object declaration. These two | |
8671 | -- cases require different processing. | |
8672 | ||
8673 | if Has_Aspect (Obj_Def_Id, Aspect_Address) then | |
8674 | ||
8675 | -- Skip non-delayed pragmas that correspond to other aspects, if | |
8676 | -- any, to find proper insertion point for freeze node of object. | |
8677 | ||
8678 | declare | |
8679 | D : Node_Id := Obj_Decl; | |
8680 | N : Node_Id := Next (D); | |
8681 | ||
8682 | begin | |
8683 | while Present (N) | |
46e8d317 | 8684 | and then Nkind_In (N, N_Attribute_Reference, N_Pragma) |
1ab3cdde | 8685 | loop |
8686 | Analyze (N); | |
8687 | D := N; | |
8688 | Next (N); | |
8689 | end loop; | |
8690 | ||
8691 | Insert_After (D, Ptr_Typ_Decl); | |
8692 | ||
8693 | -- Freeze object before pointer declaration, to ensure that | |
8694 | -- generated attribute for address is inserted at the proper | |
8695 | -- place. | |
8696 | ||
8697 | Freeze_Before (Ptr_Typ_Decl, Obj_Def_Id); | |
8698 | end; | |
8699 | ||
8700 | Analyze (Ptr_Typ_Decl); | |
8701 | ||
8702 | elsif Present (Following_Address_Clause (Obj_Decl)) then | |
8703 | ||
8704 | -- Locate explicit address clause, which may also follow pragmas | |
8705 | -- generated by other aspect specifications. | |
8706 | ||
8707 | declare | |
8708 | Addr : constant Node_Id := Following_Address_Clause (Obj_Decl); | |
8709 | D : Node_Id := Next (Obj_Decl); | |
8710 | ||
8711 | begin | |
8712 | while Present (D) loop | |
8713 | Analyze (D); | |
8714 | exit when D = Addr; | |
8715 | Next (D); | |
8716 | end loop; | |
8717 | ||
8718 | Insert_After_And_Analyze (Addr, Ptr_Typ_Decl); | |
8719 | end; | |
8720 | ||
8721 | else | |
8722 | Insert_After_And_Analyze (Obj_Decl, Ptr_Typ_Decl); | |
8723 | end if; | |
578f27c9 | 8724 | else |
9a666241 | 8725 | Insert_Action (Obj_Decl, Ptr_Typ_Decl); |
578f27c9 | 8726 | end if; |
8727 | ||
9a666241 | 8728 | -- Force immediate freezing of Ptr_Typ because Res_Decl will be |
8729 | -- elaborated in an inner (transient) scope and thus won't cause | |
8730 | -- freezing by itself. It's not an itype, but it needs to be frozen | |
8731 | -- inside the current subprogram (see Freeze_Outside in freeze.adb). | |
8732 | ||
8733 | Freeze_Itype (Ptr_Typ, Ptr_Typ_Decl); | |
8734 | ||
8735 | -- If the object is a return object of an enclosing build-in-place | |
8736 | -- function, then the implicit build-in-place parameters of the | |
8737 | -- enclosing function are simply passed along to the called function. | |
8738 | -- (Unfortunately, this won't cover the case of extension aggregates | |
8739 | -- where the ancestor part is a build-in-place indefinite function | |
8740 | -- call that should be passed along the caller's parameters. | |
8741 | -- Currently those get mishandled by reassigning the result of the | |
8742 | -- call to the aggregate return object, when the call result should | |
8743 | -- really be directly built in place in the aggregate and not in a | |
8744 | -- temporary. ???) | |
8745 | ||
8746 | if Is_Return_Object (Obj_Def_Id) then | |
8747 | Pass_Caller_Acc := True; | |
8748 | ||
8749 | -- When the enclosing function has a BIP_Alloc_Form formal then we | |
e0e76328 | 8750 | -- pass it along to the callee (such as when the enclosing function |
8751 | -- has an unconstrained or tagged result type). | |
9a666241 | 8752 | |
8753 | if Needs_BIP_Alloc_Form (Encl_Func) then | |
8754 | if RTE_Available (RE_Root_Storage_Pool_Ptr) then | |
8755 | Pool_Actual := | |
8756 | New_Occurrence_Of | |
8757 | (Build_In_Place_Formal | |
8758 | (Encl_Func, BIP_Storage_Pool), Loc); | |
578f27c9 | 8759 | |
9a666241 | 8760 | -- The build-in-place pool formal is not built on e.g. ZFP |
85bbb15a | 8761 | |
9a666241 | 8762 | else |
8763 | Pool_Actual := Empty; | |
8764 | end if; | |
8765 | ||
8766 | Add_Unconstrained_Actuals_To_Build_In_Place_Call | |
8767 | (Function_Call => Func_Call, | |
8768 | Function_Id => Function_Id, | |
8769 | Alloc_Form_Exp => | |
8770 | New_Occurrence_Of | |
8771 | (Build_In_Place_Formal (Encl_Func, BIP_Alloc_Form), Loc), | |
8772 | Pool_Actual => Pool_Actual); | |
8773 | ||
8774 | -- Otherwise, if enclosing function has a definite result subtype, | |
8775 | -- then caller allocation will be used. | |
cd24e497 | 8776 | |
37066559 | 8777 | else |
9a666241 | 8778 | Add_Unconstrained_Actuals_To_Build_In_Place_Call |
8779 | (Func_Call, Function_Id, Alloc_Form => Caller_Allocation); | |
37066559 | 8780 | end if; |
0fa54be6 | 8781 | |
9a666241 | 8782 | if Needs_BIP_Finalization_Master (Encl_Func) then |
8783 | Fmaster_Actual := | |
8784 | New_Occurrence_Of | |
8785 | (Build_In_Place_Formal | |
8786 | (Encl_Func, BIP_Finalization_Master), Loc); | |
8787 | end if; | |
0fa54be6 | 8788 | |
9a666241 | 8789 | -- Retrieve the BIPacc formal from the enclosing function and convert |
8790 | -- it to the access type of the callee's BIP_Object_Access formal. | |
37066559 | 8791 | |
9a666241 | 8792 | Caller_Object := |
8793 | Make_Unchecked_Type_Conversion (Loc, | |
8794 | Subtype_Mark => | |
8795 | New_Occurrence_Of | |
e0e76328 | 8796 | (Etype (Build_In_Place_Formal |
8797 | (Function_Id, BIP_Object_Access)), | |
9a666241 | 8798 | Loc), |
8799 | Expression => | |
8800 | New_Occurrence_Of | |
8801 | (Build_In_Place_Formal (Encl_Func, BIP_Object_Access), | |
8802 | Loc)); | |
37066559 | 8803 | |
9a666241 | 8804 | -- In the definite case, add an implicit actual to the function call |
8805 | -- that provides access to the declared object. An unchecked conversion | |
8806 | -- to the (specific) result type of the function is inserted to handle | |
8807 | -- the case where the object is declared with a class-wide type. | |
37066559 | 8808 | |
9a666241 | 8809 | elsif Definite then |
8810 | Caller_Object := | |
8811 | Make_Unchecked_Type_Conversion (Loc, | |
8812 | Subtype_Mark => New_Occurrence_Of (Result_Subt, Loc), | |
8813 | Expression => New_Occurrence_Of (Obj_Def_Id, Loc)); | |
37066559 | 8814 | |
9a666241 | 8815 | -- When the function has a controlling result, an allocation-form |
8816 | -- parameter must be passed indicating that the caller is allocating | |
8817 | -- the result object. This is needed because such a function can be | |
8818 | -- called as a dispatching operation and must be treated similarly to | |
8819 | -- functions with indefinite result subtypes. | |
0fa54be6 | 8820 | |
9a666241 | 8821 | Add_Unconstrained_Actuals_To_Build_In_Place_Call |
8822 | (Func_Call, Function_Id, Alloc_Form => Caller_Allocation); | |
37066559 | 8823 | |
9a666241 | 8824 | -- The allocation for indefinite library-level objects occurs on the |
8825 | -- heap as opposed to the secondary stack. This accommodates DLLs where | |
8826 | -- the secondary stack is destroyed after each library unload. This is a | |
8827 | -- hybrid mechanism where a stack-allocated object lives on the heap. | |
3295b1fa | 8828 | |
9a666241 | 8829 | elsif Is_Library_Level_Entity (Obj_Def_Id) |
8830 | and then not Restriction_Active (No_Implicit_Heap_Allocations) | |
8831 | then | |
8832 | Add_Unconstrained_Actuals_To_Build_In_Place_Call | |
8833 | (Func_Call, Function_Id, Alloc_Form => Global_Heap); | |
8834 | Caller_Object := Empty; | |
3295b1fa | 8835 | |
9a666241 | 8836 | -- Create a finalization master for the access result type to ensure |
8837 | -- that the heap allocation can properly chain the object and later | |
8838 | -- finalize it when the library unit goes out of scope. | |
3295b1fa | 8839 | |
9a666241 | 8840 | if Needs_Finalization (Etype (Func_Call)) then |
8841 | Build_Finalization_Master | |
8842 | (Typ => Ptr_Typ, | |
8843 | For_Lib_Level => True, | |
8844 | Insertion_Node => Ptr_Typ_Decl); | |
5198c524 | 8845 | |
9a666241 | 8846 | Fmaster_Actual := |
8847 | Make_Attribute_Reference (Loc, | |
8848 | Prefix => | |
8849 | New_Occurrence_Of (Finalization_Master (Ptr_Typ), Loc), | |
8850 | Attribute_Name => Name_Unrestricted_Access); | |
8851 | end if; | |
5198c524 | 8852 | |
2149b10c | 8853 | -- In other indefinite cases, pass an indication to do the allocation |
8854 | -- on the secondary stack and set Caller_Object to Empty so that a null | |
9a666241 | 8855 | -- value will be passed for the caller's object address. A transient |
8856 | -- scope is established to ensure eventual cleanup of the result. | |
5198c524 | 8857 | |
9a666241 | 8858 | else |
8859 | Add_Unconstrained_Actuals_To_Build_In_Place_Call | |
8860 | (Func_Call, Function_Id, Alloc_Form => Secondary_Stack); | |
8861 | Caller_Object := Empty; | |
5198c524 | 8862 | |
2149b10c | 8863 | Establish_Transient_Scope (Obj_Decl, Manage_Sec_Stack => True); |
9a666241 | 8864 | end if; |
5198c524 | 8865 | |
9a666241 | 8866 | -- Pass along any finalization master actual, which is needed in the |
8867 | -- case where the called function initializes a return object of an | |
8868 | -- enclosing build-in-place function. | |
5198c524 | 8869 | |
9a666241 | 8870 | Add_Finalization_Master_Actual_To_Build_In_Place_Call |
8871 | (Func_Call => Func_Call, | |
8872 | Func_Id => Function_Id, | |
8873 | Master_Exp => Fmaster_Actual); | |
7687b035 | 8874 | |
9a666241 | 8875 | if Nkind (Parent (Obj_Decl)) = N_Extended_Return_Statement |
8876 | and then Has_Task (Result_Subt) | |
8877 | then | |
8878 | -- Here we're passing along the master that was passed in to this | |
8879 | -- function. | |
7687b035 | 8880 | |
9a666241 | 8881 | Add_Task_Actuals_To_Build_In_Place_Call |
8882 | (Func_Call, Function_Id, | |
8883 | Master_Actual => | |
8884 | New_Occurrence_Of | |
8885 | (Build_In_Place_Formal (Encl_Func, BIP_Task_Master), Loc)); | |
7687b035 | 8886 | |
9a666241 | 8887 | else |
8888 | Add_Task_Actuals_To_Build_In_Place_Call | |
8889 | (Func_Call, Function_Id, Make_Identifier (Loc, Name_uMaster)); | |
8890 | end if; | |
7687b035 | 8891 | |
9a666241 | 8892 | Add_Access_Actual_To_Build_In_Place_Call |
8893 | (Func_Call, | |
8894 | Function_Id, | |
8895 | Caller_Object, | |
8896 | Is_Access => Pass_Caller_Acc); | |
7687b035 | 8897 | |
9a666241 | 8898 | -- Finally, create an access object initialized to a reference to the |
8899 | -- function call. We know this access value cannot be null, so mark the | |
8900 | -- entity accordingly to suppress the access check. | |
e4caa3ff | 8901 | |
9a666241 | 8902 | Def_Id := Make_Temporary (Loc, 'R', Func_Call); |
8903 | Set_Etype (Def_Id, Ptr_Typ); | |
8904 | Set_Is_Known_Non_Null (Def_Id); | |
4907451e | 8905 | |
e0e76328 | 8906 | if Nkind_In (Function_Call, N_Type_Conversion, |
8907 | N_Unchecked_Type_Conversion) | |
0f3c49a4 | 8908 | then |
9a666241 | 8909 | Res_Decl := |
8910 | Make_Object_Declaration (Loc, | |
8911 | Defining_Identifier => Def_Id, | |
8912 | Constant_Present => True, | |
8913 | Object_Definition => New_Occurrence_Of (Ptr_Typ, Loc), | |
8914 | Expression => | |
e0e76328 | 8915 | Make_Unchecked_Type_Conversion (Loc, |
8916 | New_Occurrence_Of (Ptr_Typ, Loc), | |
8917 | Make_Reference (Loc, Relocate_Node (Func_Call)))); | |
9a666241 | 8918 | else |
8919 | Res_Decl := | |
8920 | Make_Object_Declaration (Loc, | |
8921 | Defining_Identifier => Def_Id, | |
8922 | Constant_Present => True, | |
8923 | Object_Definition => New_Occurrence_Of (Ptr_Typ, Loc), | |
8924 | Expression => | |
8925 | Make_Reference (Loc, Relocate_Node (Func_Call))); | |
8926 | end if; | |
4907451e | 8927 | |
9a666241 | 8928 | Insert_After_And_Analyze (Ptr_Typ_Decl, Res_Decl); |
4907451e | 8929 | |
9a666241 | 8930 | -- If the result subtype of the called function is definite and is not |
8931 | -- itself the return expression of an enclosing BIP function, then mark | |
8932 | -- the object as having no initialization. | |
4907451e | 8933 | |
e0e76328 | 8934 | if Definite and then not Is_Return_Object (Obj_Def_Id) then |
8935 | ||
9a666241 | 8936 | -- The related object declaration is encased in a transient block |
8937 | -- because the build-in-place function call contains at least one | |
8938 | -- nested function call that produces a controlled transient | |
8939 | -- temporary: | |
578f27c9 | 8940 | |
9a666241 | 8941 | -- Obj : ... := BIP_Func_Call (Ctrl_Func_Call); |
578f27c9 | 8942 | |
9a666241 | 8943 | -- Since the build-in-place expansion decouples the call from the |
8944 | -- object declaration, the finalization machinery lacks the context | |
8945 | -- which prompted the generation of the transient block. To resolve | |
8946 | -- this scenario, store the build-in-place call. | |
e0394eca | 8947 | |
9a666241 | 8948 | if Scope_Is_Transient and then Node_To_Be_Wrapped = Obj_Decl then |
8949 | Set_BIP_Initialization_Call (Obj_Def_Id, Res_Decl); | |
cd24e497 | 8950 | end if; |
0fa54be6 | 8951 | |
9a666241 | 8952 | Set_Expression (Obj_Decl, Empty); |
8953 | Set_No_Initialization (Obj_Decl); | |
21ec6442 | 8954 | |
9a666241 | 8955 | -- In case of an indefinite result subtype, or if the call is the |
8956 | -- return expression of an enclosing BIP function, rewrite the object | |
8957 | -- declaration as an object renaming where the renamed object is a | |
8958 | -- dereference of <function_Call>'reference: | |
8959 | -- | |
8960 | -- Obj : Subt renames <function_call>'Ref.all; | |
21ec6442 | 8961 | |
9a666241 | 8962 | else |
8963 | Call_Deref := | |
8964 | Make_Explicit_Dereference (Obj_Loc, | |
8965 | Prefix => New_Occurrence_Of (Def_Id, Obj_Loc)); | |
8966 | ||
8967 | Rewrite (Obj_Decl, | |
8968 | Make_Object_Renaming_Declaration (Obj_Loc, | |
8969 | Defining_Identifier => Make_Temporary (Obj_Loc, 'D'), | |
e0e76328 | 8970 | Subtype_Mark => |
9a666241 | 8971 | New_Occurrence_Of (Designated_Type, Obj_Loc), |
e0e76328 | 8972 | Name => Call_Deref)); |
9a666241 | 8973 | |
fe48a434 | 8974 | -- At this point, Defining_Identifier (Obj_Decl) is no longer equal |
8975 | -- to Obj_Def_Id. | |
8976 | ||
8977 | Set_Renamed_Object (Defining_Identifier (Obj_Decl), Call_Deref); | |
9a666241 | 8978 | |
8979 | -- If the original entity comes from source, then mark the new | |
8980 | -- entity as needing debug information, even though it's defined | |
8981 | -- by a generated renaming that does not come from source, so that | |
8982 | -- the Materialize_Entity flag will be set on the entity when | |
8983 | -- Debug_Renaming_Declaration is called during analysis. | |
8984 | ||
8985 | if Comes_From_Source (Obj_Def_Id) then | |
fe48a434 | 8986 | Set_Debug_Info_Needed (Defining_Identifier (Obj_Decl)); |
37066559 | 8987 | end if; |
468233ce | 8988 | |
9a666241 | 8989 | Analyze (Obj_Decl); |
8990 | Replace_Renaming_Declaration_Id | |
8991 | (Obj_Decl, Original_Node (Obj_Decl)); | |
468233ce | 8992 | end if; |
578f27c9 | 8993 | end Make_Build_In_Place_Call_In_Object_Declaration; |
8994 | ||
8b3a98b2 | 8995 | ------------------------------------------------- |
8996 | -- Make_Build_In_Place_Iface_Call_In_Allocator -- | |
8997 | ------------------------------------------------- | |
8998 | ||
8999 | procedure Make_Build_In_Place_Iface_Call_In_Allocator | |
9000 | (Allocator : Node_Id; | |
9001 | Function_Call : Node_Id) | |
9002 | is | |
9003 | BIP_Func_Call : constant Node_Id := | |
9004 | Unqual_BIP_Iface_Function_Call (Function_Call); | |
9005 | Loc : constant Source_Ptr := Sloc (Function_Call); | |
9006 | ||
9007 | Anon_Type : Entity_Id; | |
9008 | Tmp_Decl : Node_Id; | |
9009 | Tmp_Id : Entity_Id; | |
9010 | ||
9011 | begin | |
9012 | -- No action of the call has already been processed | |
9013 | ||
9014 | if Is_Expanded_Build_In_Place_Call (BIP_Func_Call) then | |
9015 | return; | |
9016 | end if; | |
9017 | ||
9018 | Tmp_Id := Make_Temporary (Loc, 'D'); | |
9019 | ||
9020 | -- Insert a temporary before N initialized with the BIP function call | |
9021 | -- without its enclosing type conversions and analyze it without its | |
9022 | -- expansion. This temporary facilitates us reusing the BIP machinery, | |
9023 | -- which takes care of adding the extra build-in-place actuals and | |
9024 | -- transforms this object declaration into an object renaming | |
9025 | -- declaration. | |
9026 | ||
9027 | Anon_Type := Create_Itype (E_Anonymous_Access_Type, Function_Call); | |
9028 | Set_Directly_Designated_Type (Anon_Type, Etype (BIP_Func_Call)); | |
9029 | Set_Etype (Anon_Type, Anon_Type); | |
9030 | ||
9031 | Tmp_Decl := | |
9032 | Make_Object_Declaration (Loc, | |
9033 | Defining_Identifier => Tmp_Id, | |
9034 | Object_Definition => New_Occurrence_Of (Anon_Type, Loc), | |
9035 | Expression => | |
9036 | Make_Allocator (Loc, | |
9037 | Expression => | |
9038 | Make_Qualified_Expression (Loc, | |
9039 | Subtype_Mark => | |
9040 | New_Occurrence_Of (Etype (BIP_Func_Call), Loc), | |
9041 | Expression => New_Copy_Tree (BIP_Func_Call)))); | |
9042 | ||
9043 | Expander_Mode_Save_And_Set (False); | |
9044 | Insert_Action (Allocator, Tmp_Decl); | |
9045 | Expander_Mode_Restore; | |
9046 | ||
9047 | Make_Build_In_Place_Call_In_Allocator | |
9048 | (Allocator => Expression (Tmp_Decl), | |
9049 | Function_Call => Expression (Expression (Tmp_Decl))); | |
9050 | ||
9051 | Rewrite (Allocator, New_Occurrence_Of (Tmp_Id, Loc)); | |
9052 | end Make_Build_In_Place_Iface_Call_In_Allocator; | |
9053 | ||
9054 | --------------------------------------------------------- | |
9055 | -- Make_Build_In_Place_Iface_Call_In_Anonymous_Context -- | |
9056 | --------------------------------------------------------- | |
9057 | ||
9058 | procedure Make_Build_In_Place_Iface_Call_In_Anonymous_Context | |
9059 | (Function_Call : Node_Id) | |
9060 | is | |
9061 | BIP_Func_Call : constant Node_Id := | |
9062 | Unqual_BIP_Iface_Function_Call (Function_Call); | |
9063 | Loc : constant Source_Ptr := Sloc (Function_Call); | |
9064 | ||
9065 | Tmp_Decl : Node_Id; | |
9066 | Tmp_Id : Entity_Id; | |
9067 | ||
9068 | begin | |
9069 | -- No action of the call has already been processed | |
9070 | ||
9071 | if Is_Expanded_Build_In_Place_Call (BIP_Func_Call) then | |
9072 | return; | |
9073 | end if; | |
9074 | ||
9075 | pragma Assert (Needs_Finalization (Etype (BIP_Func_Call))); | |
9076 | ||
9077 | -- Insert a temporary before the call initialized with function call to | |
9078 | -- reuse the BIP machinery which takes care of adding the extra build-in | |
9079 | -- place actuals and transforms this object declaration into an object | |
9080 | -- renaming declaration. | |
9081 | ||
9082 | Tmp_Id := Make_Temporary (Loc, 'D'); | |
9083 | ||
9084 | Tmp_Decl := | |
9085 | Make_Object_Declaration (Loc, | |
9086 | Defining_Identifier => Tmp_Id, | |
9087 | Object_Definition => | |
9088 | New_Occurrence_Of (Etype (Function_Call), Loc), | |
9089 | Expression => Relocate_Node (Function_Call)); | |
9090 | ||
9091 | Expander_Mode_Save_And_Set (False); | |
9092 | Insert_Action (Function_Call, Tmp_Decl); | |
9093 | Expander_Mode_Restore; | |
9094 | ||
9095 | Make_Build_In_Place_Iface_Call_In_Object_Declaration | |
9096 | (Obj_Decl => Tmp_Decl, | |
9097 | Function_Call => Expression (Tmp_Decl)); | |
9098 | end Make_Build_In_Place_Iface_Call_In_Anonymous_Context; | |
9099 | ||
9100 | ---------------------------------------------------------- | |
9101 | -- Make_Build_In_Place_Iface_Call_In_Object_Declaration -- | |
9102 | ---------------------------------------------------------- | |
9103 | ||
9104 | procedure Make_Build_In_Place_Iface_Call_In_Object_Declaration | |
9105 | (Obj_Decl : Node_Id; | |
9106 | Function_Call : Node_Id) | |
9107 | is | |
9108 | BIP_Func_Call : constant Node_Id := | |
9109 | Unqual_BIP_Iface_Function_Call (Function_Call); | |
9110 | Loc : constant Source_Ptr := Sloc (Function_Call); | |
9111 | Obj_Id : constant Entity_Id := Defining_Entity (Obj_Decl); | |
9112 | ||
9113 | Tmp_Decl : Node_Id; | |
9114 | Tmp_Id : Entity_Id; | |
9115 | ||
9116 | begin | |
9117 | -- No action of the call has already been processed | |
9118 | ||
9119 | if Is_Expanded_Build_In_Place_Call (BIP_Func_Call) then | |
9120 | return; | |
9121 | end if; | |
9122 | ||
9123 | Tmp_Id := Make_Temporary (Loc, 'D'); | |
9124 | ||
9125 | -- Insert a temporary before N initialized with the BIP function call | |
9126 | -- without its enclosing type conversions and analyze it without its | |
9127 | -- expansion. This temporary facilitates us reusing the BIP machinery, | |
9128 | -- which takes care of adding the extra build-in-place actuals and | |
9129 | -- transforms this object declaration into an object renaming | |
9130 | -- declaration. | |
9131 | ||
9132 | Tmp_Decl := | |
9133 | Make_Object_Declaration (Loc, | |
9134 | Defining_Identifier => Tmp_Id, | |
9135 | Object_Definition => | |
9136 | New_Occurrence_Of (Etype (BIP_Func_Call), Loc), | |
9137 | Expression => New_Copy_Tree (BIP_Func_Call)); | |
9138 | ||
9139 | Expander_Mode_Save_And_Set (False); | |
9140 | Insert_Action (Obj_Decl, Tmp_Decl); | |
9141 | Expander_Mode_Restore; | |
9142 | ||
9143 | Make_Build_In_Place_Call_In_Object_Declaration | |
9144 | (Obj_Decl => Tmp_Decl, | |
9145 | Function_Call => Expression (Tmp_Decl)); | |
9146 | ||
9147 | pragma Assert (Nkind (Tmp_Decl) = N_Object_Renaming_Declaration); | |
9148 | ||
9149 | -- Replace the original build-in-place function call by a reference to | |
9150 | -- the resulting temporary object renaming declaration. In this way, | |
9151 | -- all the interface conversions performed in the original Function_Call | |
9152 | -- on the build-in-place object are preserved. | |
9153 | ||
9154 | Rewrite (BIP_Func_Call, New_Occurrence_Of (Tmp_Id, Loc)); | |
9155 | ||
9156 | -- Replace the original object declaration by an internal object | |
9157 | -- renaming declaration. This leaves the generated code more clean (the | |
9158 | -- build-in-place function call in an object renaming declaration and | |
9159 | -- displacements of the pointer to the build-in-place object in another | |
9160 | -- renaming declaration) and allows us to invoke the routine that takes | |
9161 | -- care of replacing the identifier of the renaming declaration (routine | |
9162 | -- originally developed for the regular build-in-place management). | |
9163 | ||
9164 | Rewrite (Obj_Decl, | |
9165 | Make_Object_Renaming_Declaration (Loc, | |
9166 | Defining_Identifier => Make_Temporary (Loc, 'D'), | |
9167 | Subtype_Mark => New_Occurrence_Of (Etype (Obj_Id), Loc), | |
9168 | Name => Function_Call)); | |
9169 | Analyze (Obj_Decl); | |
9170 | ||
9171 | Replace_Renaming_Declaration_Id (Obj_Decl, Original_Node (Obj_Decl)); | |
9172 | end Make_Build_In_Place_Iface_Call_In_Object_Declaration; | |
9173 | ||
693dfc0f | 9174 | -------------------------------------------- |
9175 | -- Make_CPP_Constructor_Call_In_Allocator -- | |
9176 | -------------------------------------------- | |
9177 | ||
9178 | procedure Make_CPP_Constructor_Call_In_Allocator | |
9179 | (Allocator : Node_Id; | |
9180 | Function_Call : Node_Id) | |
9181 | is | |
9182 | Loc : constant Source_Ptr := Sloc (Function_Call); | |
9183 | Acc_Type : constant Entity_Id := Etype (Allocator); | |
9184 | Function_Id : constant Entity_Id := Entity (Name (Function_Call)); | |
9185 | Result_Subt : constant Entity_Id := Available_View (Etype (Function_Id)); | |
9186 | ||
9187 | New_Allocator : Node_Id; | |
9188 | Return_Obj_Access : Entity_Id; | |
9189 | Tmp_Obj : Node_Id; | |
9190 | ||
9191 | begin | |
9192 | pragma Assert (Nkind (Allocator) = N_Allocator | |
285cdf4d | 9193 | and then Nkind (Function_Call) = N_Function_Call); |
693dfc0f | 9194 | pragma Assert (Convention (Function_Id) = Convention_CPP |
285cdf4d | 9195 | and then Is_Constructor (Function_Id)); |
693dfc0f | 9196 | pragma Assert (Is_Constrained (Underlying_Type (Result_Subt))); |
9197 | ||
9198 | -- Replace the initialized allocator of form "new T'(Func (...))" with | |
9199 | -- an uninitialized allocator of form "new T", where T is the result | |
9200 | -- subtype of the called function. The call to the function is handled | |
9201 | -- separately further below. | |
9202 | ||
9203 | New_Allocator := | |
9204 | Make_Allocator (Loc, | |
83c6c069 | 9205 | Expression => New_Occurrence_Of (Result_Subt, Loc)); |
693dfc0f | 9206 | Set_No_Initialization (New_Allocator); |
9207 | ||
9208 | -- Copy attributes to new allocator. Note that the new allocator | |
9209 | -- logically comes from source if the original one did, so copy the | |
9210 | -- relevant flag. This ensures proper treatment of the restriction | |
9211 | -- No_Implicit_Heap_Allocations in this case. | |
9212 | ||
9213 | Set_Storage_Pool (New_Allocator, Storage_Pool (Allocator)); | |
9214 | Set_Procedure_To_Call (New_Allocator, Procedure_To_Call (Allocator)); | |
9215 | Set_Comes_From_Source (New_Allocator, Comes_From_Source (Allocator)); | |
9216 | ||
9217 | Rewrite (Allocator, New_Allocator); | |
9218 | ||
9219 | -- Create a new access object and initialize it to the result of the | |
9220 | -- new uninitialized allocator. Note: we do not use Allocator as the | |
9221 | -- Related_Node of Return_Obj_Access in call to Make_Temporary below | |
9222 | -- as this would create a sort of infinite "recursion". | |
9223 | ||
9224 | Return_Obj_Access := Make_Temporary (Loc, 'R'); | |
9225 | Set_Etype (Return_Obj_Access, Acc_Type); | |
9226 | ||
9227 | -- Generate: | |
9228 | -- Rnnn : constant ptr_T := new (T); | |
9229 | -- Init (Rnn.all,...); | |
9230 | ||
9231 | Tmp_Obj := | |
9232 | Make_Object_Declaration (Loc, | |
9233 | Defining_Identifier => Return_Obj_Access, | |
9234 | Constant_Present => True, | |
83c6c069 | 9235 | Object_Definition => New_Occurrence_Of (Acc_Type, Loc), |
693dfc0f | 9236 | Expression => Relocate_Node (Allocator)); |
9237 | Insert_Action (Allocator, Tmp_Obj); | |
9238 | ||
9239 | Insert_List_After_And_Analyze (Tmp_Obj, | |
9240 | Build_Initialization_Call (Loc, | |
9241 | Id_Ref => | |
9242 | Make_Explicit_Dereference (Loc, | |
83c6c069 | 9243 | Prefix => New_Occurrence_Of (Return_Obj_Access, Loc)), |
693dfc0f | 9244 | Typ => Etype (Function_Id), |
9245 | Constructor_Ref => Function_Call)); | |
9246 | ||
9247 | -- Finally, replace the allocator node with a reference to the result of | |
9248 | -- the function call itself (which will effectively be an access to the | |
9249 | -- object created by the allocator). | |
9250 | ||
83c6c069 | 9251 | Rewrite (Allocator, New_Occurrence_Of (Return_Obj_Access, Loc)); |
693dfc0f | 9252 | |
9253 | -- Ada 2005 (AI-251): If the type of the allocator is an interface then | |
9254 | -- generate an implicit conversion to force displacement of the "this" | |
9255 | -- pointer. | |
9256 | ||
9257 | if Is_Interface (Designated_Type (Acc_Type)) then | |
9258 | Rewrite (Allocator, Convert_To (Acc_Type, Relocate_Node (Allocator))); | |
9259 | end if; | |
9260 | ||
9261 | Analyze_And_Resolve (Allocator, Acc_Type); | |
9262 | end Make_CPP_Constructor_Call_In_Allocator; | |
9263 | ||
57acff55 | 9264 | ----------------------------------- |
9265 | -- Needs_BIP_Finalization_Master -- | |
9266 | ----------------------------------- | |
af32d209 | 9267 | |
57acff55 | 9268 | function Needs_BIP_Finalization_Master |
9269 | (Func_Id : Entity_Id) return Boolean | |
9270 | is | |
bb3b440a | 9271 | pragma Assert (Is_Build_In_Place_Function (Func_Id)); |
9272 | Func_Typ : constant Entity_Id := Underlying_Type (Etype (Func_Id)); | |
45851103 | 9273 | begin |
18cb6d78 | 9274 | -- A formal giving the finalization master is needed for build-in-place |
9275 | -- functions whose result type needs finalization or is a tagged type. | |
9276 | -- Tagged primitive build-in-place functions need such a formal because | |
9277 | -- they can be called by a dispatching call, and extensions may require | |
9278 | -- finalization even if the root type doesn't. This means they're also | |
9279 | -- needed for tagged nonprimitive build-in-place functions with tagged | |
9280 | -- results, since such functions can be called via access-to-function | |
9281 | -- types, and those can be used to call primitives, so masters have to | |
9282 | -- be passed to all such build-in-place functions, primitive or not. | |
9283 | ||
bb3b440a | 9284 | return |
9285 | not Restriction_Active (No_Finalization) | |
18cb6d78 | 9286 | and then (Needs_Finalization (Func_Typ) |
9287 | or else Is_Tagged_Type (Func_Typ)); | |
57acff55 | 9288 | end Needs_BIP_Finalization_Master; |
45851103 | 9289 | |
5198c524 | 9290 | -------------------------- |
9291 | -- Needs_BIP_Alloc_Form -- | |
9292 | -------------------------- | |
9293 | ||
9294 | function Needs_BIP_Alloc_Form (Func_Id : Entity_Id) return Boolean is | |
9295 | pragma Assert (Is_Build_In_Place_Function (Func_Id)); | |
9296 | Func_Typ : constant Entity_Id := Underlying_Type (Etype (Func_Id)); | |
5198c524 | 9297 | begin |
80012fc8 | 9298 | return Requires_Transient_Scope (Func_Typ); |
5198c524 | 9299 | end Needs_BIP_Alloc_Form; |
9300 | ||
302f6546 | 9301 | -------------------------------------- |
9302 | -- Needs_Result_Accessibility_Level -- | |
9303 | -------------------------------------- | |
9304 | ||
9305 | function Needs_Result_Accessibility_Level | |
9306 | (Func_Id : Entity_Id) return Boolean | |
9307 | is | |
9308 | Func_Typ : constant Entity_Id := Underlying_Type (Etype (Func_Id)); | |
9309 | ||
9310 | function Has_Unconstrained_Access_Discriminant_Component | |
4be04311 | 9311 | (Comp_Typ : Entity_Id) return Boolean; |
9312 | -- Returns True if any component of the type has an unconstrained access | |
9313 | -- discriminant. | |
302f6546 | 9314 | |
9315 | ----------------------------------------------------- | |
9316 | -- Has_Unconstrained_Access_Discriminant_Component -- | |
9317 | ----------------------------------------------------- | |
9318 | ||
9319 | function Has_Unconstrained_Access_Discriminant_Component | |
9320 | (Comp_Typ : Entity_Id) return Boolean | |
9321 | is | |
9322 | begin | |
9323 | if not Is_Limited_Type (Comp_Typ) then | |
9324 | return False; | |
4be04311 | 9325 | |
302f6546 | 9326 | -- Only limited types can have access discriminants with |
9327 | -- defaults. | |
9328 | ||
9329 | elsif Has_Unconstrained_Access_Discriminants (Comp_Typ) then | |
9330 | return True; | |
9331 | ||
9332 | elsif Is_Array_Type (Comp_Typ) then | |
9333 | return Has_Unconstrained_Access_Discriminant_Component | |
9334 | (Underlying_Type (Component_Type (Comp_Typ))); | |
9335 | ||
9336 | elsif Is_Record_Type (Comp_Typ) then | |
9337 | declare | |
4be04311 | 9338 | Comp : Entity_Id; |
9339 | ||
302f6546 | 9340 | begin |
4be04311 | 9341 | Comp := First_Component (Comp_Typ); |
302f6546 | 9342 | while Present (Comp) loop |
9343 | if Has_Unconstrained_Access_Discriminant_Component | |
9344 | (Underlying_Type (Etype (Comp))) | |
9345 | then | |
9346 | return True; | |
9347 | end if; | |
9348 | ||
9349 | Next_Component (Comp); | |
9350 | end loop; | |
9351 | end; | |
9352 | end if; | |
9353 | ||
9354 | return False; | |
9355 | end Has_Unconstrained_Access_Discriminant_Component; | |
9356 | ||
e1415398 | 9357 | Disable_Coextension_Cases : constant Boolean := True; |
9358 | -- Flag used to temporarily disable a "True" result for types with | |
9359 | -- access discriminants and related coextension cases. | |
0c6b5982 | 9360 | |
302f6546 | 9361 | -- Start of processing for Needs_Result_Accessibility_Level |
9362 | ||
9363 | begin | |
4be04311 | 9364 | -- False if completion unavailable (how does this happen???) |
9365 | ||
9366 | if not Present (Func_Typ) then | |
9367 | return False; | |
302f6546 | 9368 | |
4be04311 | 9369 | -- False if not a function, also handle enum-lit renames case |
302f6546 | 9370 | |
4be04311 | 9371 | elsif Func_Typ = Standard_Void_Type |
9372 | or else Is_Scalar_Type (Func_Typ) | |
302f6546 | 9373 | then |
9374 | return False; | |
302f6546 | 9375 | |
4be04311 | 9376 | -- Handle a corner case, a cross-dialect subp renaming. For example, |
8cd57b24 | 9377 | -- an Ada 2012 renaming of an Ada 2005 subprogram. This can occur when |
9378 | -- an Ada 2005 (or earlier) unit references predefined run-time units. | |
4be04311 | 9379 | |
9380 | elsif Present (Alias (Func_Id)) then | |
9381 | ||
302f6546 | 9382 | -- Unimplemented: a cross-dialect subp renaming which does not set |
9383 | -- the Alias attribute (e.g., a rename of a dereference of an access | |
8fc2605c | 9384 | -- to subprogram value). ??? |
302f6546 | 9385 | |
9386 | return Present (Extra_Accessibility_Of_Result (Alias (Func_Id))); | |
302f6546 | 9387 | |
4be04311 | 9388 | -- Remaining cases require Ada 2012 mode |
9389 | ||
9390 | elsif Ada_Version < Ada_2012 then | |
302f6546 | 9391 | return False; |
302f6546 | 9392 | |
e1415398 | 9393 | -- Handle the situation where a result is an anonymous access type |
9394 | -- RM 3.10.2 (10.3/3). | |
9395 | ||
9396 | elsif Ekind (Func_Typ) = E_Anonymous_Access_Type then | |
9397 | return True; | |
9398 | ||
9399 | -- The following cases are related to coextensions and do not fully | |
9400 | -- cover everything mentioned in RM 3.10.2 (12) ??? | |
9401 | ||
9402 | -- Temporarily disabled ??? | |
9403 | ||
9404 | elsif Disable_Coextension_Cases then | |
9405 | return False; | |
9406 | ||
9407 | -- In the case of, say, a null tagged record result type, the need for | |
9408 | -- this extra parameter might not be obvious so this function returns | |
9409 | -- True for all tagged types for compatibility reasons. | |
9410 | ||
9411 | -- A function with, say, a tagged null controlling result type might | |
9412 | -- be overridden by a primitive of an extension having an access | |
9413 | -- discriminant and the overrider and overridden must have compatible | |
9414 | -- calling conventions (including implicitly declared parameters). | |
9415 | ||
9416 | -- Similarly, values of one access-to-subprogram type might designate | |
9417 | -- both a primitive subprogram of a given type and a function which is, | |
9418 | -- for example, not a primitive subprogram of any type. Again, this | |
9419 | -- requires calling convention compatibility. It might be possible to | |
9420 | -- solve these issues by introducing wrappers, but that is not the | |
9421 | -- approach that was chosen. | |
302f6546 | 9422 | |
e1415398 | 9423 | elsif Is_Tagged_Type (Func_Typ) then |
302f6546 | 9424 | return True; |
302f6546 | 9425 | |
4be04311 | 9426 | elsif Has_Unconstrained_Access_Discriminants (Func_Typ) then |
302f6546 | 9427 | return True; |
302f6546 | 9428 | |
4be04311 | 9429 | elsif Has_Unconstrained_Access_Discriminant_Component (Func_Typ) then |
302f6546 | 9430 | return True; |
302f6546 | 9431 | |
4be04311 | 9432 | -- False for all other cases |
9433 | ||
9434 | else | |
9435 | return False; | |
9436 | end if; | |
302f6546 | 9437 | end Needs_Result_Accessibility_Level; |
9438 | ||
8b3a98b2 | 9439 | ------------------------------------- |
9440 | -- Replace_Renaming_Declaration_Id -- | |
9441 | ------------------------------------- | |
9442 | ||
9443 | procedure Replace_Renaming_Declaration_Id | |
9444 | (New_Decl : Node_Id; | |
9445 | Orig_Decl : Node_Id) | |
9446 | is | |
9447 | New_Id : constant Entity_Id := Defining_Entity (New_Decl); | |
9448 | Orig_Id : constant Entity_Id := Defining_Entity (Orig_Decl); | |
9449 | ||
9450 | begin | |
9451 | Set_Chars (New_Id, Chars (Orig_Id)); | |
9452 | ||
9453 | -- Swap next entity links in preparation for exchanging entities | |
9454 | ||
9455 | declare | |
9456 | Next_Id : constant Entity_Id := Next_Entity (New_Id); | |
9457 | begin | |
585796c0 | 9458 | Link_Entities (New_Id, Next_Entity (Orig_Id)); |
9459 | Link_Entities (Orig_Id, Next_Id); | |
8b3a98b2 | 9460 | end; |
9461 | ||
9462 | Set_Homonym (New_Id, Homonym (Orig_Id)); | |
9463 | Exchange_Entities (New_Id, Orig_Id); | |
9464 | ||
9465 | -- Preserve source indication of original declaration, so that xref | |
9466 | -- information is properly generated for the right entity. | |
9467 | ||
9468 | Preserve_Comes_From_Source (New_Decl, Orig_Decl); | |
9469 | Preserve_Comes_From_Source (Orig_Id, Orig_Decl); | |
9470 | ||
9471 | Set_Comes_From_Source (New_Id, False); | |
9472 | end Replace_Renaming_Declaration_Id; | |
9473 | ||
41a8d10f | 9474 | --------------------------------- |
9475 | -- Rewrite_Function_Call_For_C -- | |
9476 | --------------------------------- | |
9477 | ||
9478 | procedure Rewrite_Function_Call_For_C (N : Node_Id) is | |
0fa03311 | 9479 | Orig_Func : constant Entity_Id := Entity (Name (N)); |
9480 | Func_Id : constant Entity_Id := Ultimate_Alias (Orig_Func); | |
8bbeda6a | 9481 | Par : constant Node_Id := Parent (N); |
9e52df9c | 9482 | Proc_Id : constant Entity_Id := Corresponding_Procedure (Func_Id); |
dc02550c | 9483 | Loc : constant Source_Ptr := Sloc (Par); |
8bbeda6a | 9484 | Actuals : List_Id; |
0fa03311 | 9485 | Last_Actual : Node_Id; |
8bbeda6a | 9486 | Last_Formal : Entity_Id; |
41a8d10f | 9487 | |
b63b3ba9 | 9488 | -- Start of processing for Rewrite_Function_Call_For_C |
9489 | ||
41a8d10f | 9490 | begin |
dc02550c | 9491 | -- The actuals may be given by named associations, so the added actual |
9492 | -- that is the target of the return value of the call must be a named | |
9493 | -- association as well, so we retrieve the name of the generated | |
9494 | -- out_formal. | |
8bbeda6a | 9495 | |
9496 | Last_Formal := First_Formal (Proc_Id); | |
9497 | while Present (Next_Formal (Last_Formal)) loop | |
9498 | Last_Formal := Next_Formal (Last_Formal); | |
9499 | end loop; | |
9500 | ||
41a8d10f | 9501 | Actuals := Parameter_Associations (N); |
9502 | ||
c90564bd | 9503 | -- The original function may lack parameters |
7761c830 | 9504 | |
9505 | if No (Actuals) then | |
9506 | Actuals := New_List; | |
9507 | end if; | |
9508 | ||
41a8d10f | 9509 | -- If the function call is the expression of an assignment statement, |
9510 | -- transform the assignment into a procedure call. Generate: | |
9511 | ||
9512 | -- LHS := Func_Call (...); | |
9513 | ||
9514 | -- Proc_Call (..., LHS); | |
9515 | ||
0fa03311 | 9516 | -- If function is inherited, a conversion may be necessary. |
9517 | ||
41a8d10f | 9518 | if Nkind (Par) = N_Assignment_Statement then |
0fa03311 | 9519 | Last_Actual := Name (Par); |
9520 | ||
9521 | if not Comes_From_Source (Orig_Func) | |
9522 | and then Etype (Orig_Func) /= Etype (Func_Id) | |
9523 | then | |
f2a38ba8 | 9524 | Last_Actual := |
9525 | Make_Type_Conversion (Loc, | |
9526 | New_Occurrence_Of (Etype (Func_Id), Loc), | |
9527 | Last_Actual); | |
0fa03311 | 9528 | end if; |
9529 | ||
8bbeda6a | 9530 | Append_To (Actuals, |
9531 | Make_Parameter_Association (Loc, | |
dc02550c | 9532 | Selector_Name => |
9533 | Make_Identifier (Loc, Chars (Last_Formal)), | |
0fa03311 | 9534 | Explicit_Actual_Parameter => Last_Actual)); |
dc02550c | 9535 | |
41a8d10f | 9536 | Rewrite (Par, |
9537 | Make_Procedure_Call_Statement (Loc, | |
9538 | Name => New_Occurrence_Of (Proc_Id, Loc), | |
9539 | Parameter_Associations => Actuals)); | |
9540 | Analyze (Par); | |
9541 | ||
9542 | -- Otherwise the context is an expression. Generate a temporary and a | |
9543 | -- procedure call to obtain the function result. Generate: | |
9544 | ||
9545 | -- ... Func_Call (...) ... | |
9546 | ||
9547 | -- Temp : ...; | |
9548 | -- Proc_Call (..., Temp); | |
9549 | -- ... Temp ... | |
9550 | ||
9551 | else | |
9552 | declare | |
9553 | Temp_Id : constant Entity_Id := Make_Temporary (Loc, 'T'); | |
9554 | Call : Node_Id; | |
9555 | Decl : Node_Id; | |
9556 | ||
9557 | begin | |
9558 | -- Generate: | |
9559 | -- Temp : ...; | |
9560 | ||
9561 | Decl := | |
9562 | Make_Object_Declaration (Loc, | |
9563 | Defining_Identifier => Temp_Id, | |
9564 | Object_Definition => | |
9565 | New_Occurrence_Of (Etype (Func_Id), Loc)); | |
9566 | ||
9567 | -- Generate: | |
9568 | -- Proc_Call (..., Temp); | |
9569 | ||
8bbeda6a | 9570 | Append_To (Actuals, |
9571 | Make_Parameter_Association (Loc, | |
dc02550c | 9572 | Selector_Name => |
9573 | Make_Identifier (Loc, Chars (Last_Formal)), | |
9574 | Explicit_Actual_Parameter => | |
9575 | New_Occurrence_Of (Temp_Id, Loc))); | |
9576 | ||
41a8d10f | 9577 | Call := |
9578 | Make_Procedure_Call_Statement (Loc, | |
9579 | Name => New_Occurrence_Of (Proc_Id, Loc), | |
9580 | Parameter_Associations => Actuals); | |
9581 | ||
9582 | Insert_Actions (Par, New_List (Decl, Call)); | |
9583 | Rewrite (N, New_Occurrence_Of (Temp_Id, Loc)); | |
9584 | end; | |
9585 | end if; | |
9586 | end Rewrite_Function_Call_For_C; | |
9587 | ||
a10589ee | 9588 | ------------------------------------ |
9589 | -- Set_Enclosing_Sec_Stack_Return -- | |
9590 | ------------------------------------ | |
9591 | ||
9592 | procedure Set_Enclosing_Sec_Stack_Return (N : Node_Id) is | |
9593 | P : Node_Id := N; | |
9594 | ||
9595 | begin | |
9596 | -- Due to a possible mix of internally generated blocks, source blocks | |
9597 | -- and loops, the scope stack may not be contiguous as all labels are | |
9598 | -- inserted at the top level within the related function. Instead, | |
9599 | -- perform a parent-based traversal and mark all appropriate constructs. | |
9600 | ||
9601 | while Present (P) loop | |
9602 | ||
9603 | -- Mark the label of a source or internally generated block or | |
9604 | -- loop. | |
9605 | ||
9606 | if Nkind_In (P, N_Block_Statement, N_Loop_Statement) then | |
9607 | Set_Sec_Stack_Needed_For_Return (Entity (Identifier (P))); | |
9608 | ||
9609 | -- Mark the enclosing function | |
9610 | ||
9611 | elsif Nkind (P) = N_Subprogram_Body then | |
9612 | if Present (Corresponding_Spec (P)) then | |
9613 | Set_Sec_Stack_Needed_For_Return (Corresponding_Spec (P)); | |
9614 | else | |
9615 | Set_Sec_Stack_Needed_For_Return (Defining_Entity (P)); | |
9616 | end if; | |
9617 | ||
9618 | -- Do not go beyond the enclosing function | |
9619 | ||
9620 | exit; | |
9621 | end if; | |
9622 | ||
9623 | P := Parent (P); | |
9624 | end loop; | |
9625 | end Set_Enclosing_Sec_Stack_Return; | |
9626 | ||
8b3a98b2 | 9627 | ------------------------------------ |
9628 | -- Unqual_BIP_Iface_Function_Call -- | |
9629 | ------------------------------------ | |
9630 | ||
9631 | function Unqual_BIP_Iface_Function_Call (Expr : Node_Id) return Node_Id is | |
9632 | Has_Pointer_Displacement : Boolean := False; | |
9633 | On_Object_Declaration : Boolean := False; | |
9634 | -- Remember if processing the renaming expressions on recursion we have | |
9635 | -- traversed an object declaration, since we can traverse many object | |
9636 | -- declaration renamings but just one regular object declaration. | |
9637 | ||
9638 | function Unqual_BIP_Function_Call (Expr : Node_Id) return Node_Id; | |
9639 | -- Search for a build-in-place function call skipping any qualification | |
9640 | -- including qualified expressions, type conversions, references, calls | |
9641 | -- to displace the pointer to the object, and renamings. Return Empty if | |
9642 | -- no build-in-place function call is found. | |
9643 | ||
9644 | ------------------------------ | |
9645 | -- Unqual_BIP_Function_Call -- | |
9646 | ------------------------------ | |
9647 | ||
9648 | function Unqual_BIP_Function_Call (Expr : Node_Id) return Node_Id is | |
9649 | begin | |
9650 | -- Recurse to handle case of multiple levels of qualification and/or | |
9651 | -- conversion. | |
9652 | ||
9653 | if Nkind_In (Expr, N_Qualified_Expression, | |
9654 | N_Type_Conversion, | |
9655 | N_Unchecked_Type_Conversion) | |
9656 | then | |
9657 | return Unqual_BIP_Function_Call (Expression (Expr)); | |
9658 | ||
9659 | -- Recurse to handle case of multiple levels of references and | |
9660 | -- explicit dereferences. | |
9661 | ||
9662 | elsif Nkind_In (Expr, N_Attribute_Reference, | |
9663 | N_Explicit_Dereference, | |
9664 | N_Reference) | |
9665 | then | |
9666 | return Unqual_BIP_Function_Call (Prefix (Expr)); | |
9667 | ||
9668 | -- Recurse on object renamings | |
9669 | ||
9670 | elsif Nkind (Expr) = N_Identifier | |
0d1fd194 | 9671 | and then Present (Entity (Expr)) |
8b3a98b2 | 9672 | and then Ekind_In (Entity (Expr), E_Constant, E_Variable) |
9673 | and then Nkind (Parent (Entity (Expr))) = | |
9674 | N_Object_Renaming_Declaration | |
9675 | and then Present (Renamed_Object (Entity (Expr))) | |
9676 | then | |
9677 | return Unqual_BIP_Function_Call (Renamed_Object (Entity (Expr))); | |
9678 | ||
9679 | -- Recurse on the initializing expression of the first reference of | |
9680 | -- an object declaration. | |
9681 | ||
9682 | elsif not On_Object_Declaration | |
9683 | and then Nkind (Expr) = N_Identifier | |
0d1fd194 | 9684 | and then Present (Entity (Expr)) |
8b3a98b2 | 9685 | and then Ekind_In (Entity (Expr), E_Constant, E_Variable) |
9686 | and then Nkind (Parent (Entity (Expr))) = N_Object_Declaration | |
9687 | and then Present (Expression (Parent (Entity (Expr)))) | |
9688 | then | |
9689 | On_Object_Declaration := True; | |
9690 | return | |
e0e76328 | 9691 | Unqual_BIP_Function_Call (Expression (Parent (Entity (Expr)))); |
8b3a98b2 | 9692 | |
9693 | -- Recurse to handle calls to displace the pointer to the object to | |
9694 | -- reference a secondary dispatch table. | |
9695 | ||
9696 | elsif Nkind (Expr) = N_Function_Call | |
9697 | and then Nkind (Name (Expr)) in N_Has_Entity | |
0d1fd194 | 9698 | and then Present (Entity (Name (Expr))) |
8b3a98b2 | 9699 | and then RTU_Loaded (Ada_Tags) |
9700 | and then RTE_Available (RE_Displace) | |
9701 | and then Is_RTE (Entity (Name (Expr)), RE_Displace) | |
9702 | then | |
9703 | Has_Pointer_Displacement := True; | |
9704 | return | |
9705 | Unqual_BIP_Function_Call (First (Parameter_Associations (Expr))); | |
9706 | ||
9707 | -- Normal case: check if the inner expression is a BIP function call | |
9708 | -- and the pointer to the object is displaced. | |
9709 | ||
9710 | elsif Has_Pointer_Displacement | |
9711 | and then Is_Build_In_Place_Function_Call (Expr) | |
9712 | then | |
9713 | return Expr; | |
9714 | ||
9715 | else | |
9716 | return Empty; | |
9717 | end if; | |
9718 | end Unqual_BIP_Function_Call; | |
9719 | ||
9720 | -- Start of processing for Unqual_BIP_Iface_Function_Call | |
9721 | ||
9722 | begin | |
cd24e497 | 9723 | if Nkind (Expr) = N_Identifier and then No (Entity (Expr)) then |
e0e76328 | 9724 | |
9725 | -- Can happen for X'Elab_Spec in the binder-generated file | |
9726 | ||
cd24e497 | 9727 | return Empty; |
9728 | end if; | |
9729 | ||
8b3a98b2 | 9730 | return Unqual_BIP_Function_Call (Expr); |
9731 | end Unqual_BIP_Iface_Function_Call; | |
9732 | ||
ee6ba406 | 9733 | end Exp_Ch6; |