1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2011, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 -- This package contains virtually all expansion mechanisms related to
30 with Atree; use Atree;
31 with Debug; use Debug;
32 with Einfo; use Einfo;
33 with Elists; use Elists;
34 with Errout; use Errout;
35 with Exp_Ch6; use Exp_Ch6;
36 with Exp_Ch9; use Exp_Ch9;
37 with Exp_Ch11; use Exp_Ch11;
38 with Exp_Dbug; use Exp_Dbug;
39 with Exp_Dist; use Exp_Dist;
40 with Exp_Disp; use Exp_Disp;
41 with Exp_Tss; use Exp_Tss;
42 with Exp_Util; use Exp_Util;
43 with Freeze; use Freeze;
45 with Nlists; use Nlists;
46 with Nmake; use Nmake;
48 with Output; use Output;
49 with Restrict; use Restrict;
50 with Rident; use Rident;
51 with Rtsfind; use Rtsfind;
52 with Sinfo; use Sinfo;
54 with Sem_Aux; use Sem_Aux;
55 with Sem_Ch3; use Sem_Ch3;
56 with Sem_Ch7; use Sem_Ch7;
57 with Sem_Ch8; use Sem_Ch8;
58 with Sem_Res; use Sem_Res;
59 with Sem_Util; use Sem_Util;
60 with Snames; use Snames;
61 with Stand; use Stand;
62 with Targparm; use Targparm;
63 with Tbuild; use Tbuild;
64 with Ttypes; use Ttypes;
65 with Uintp; use Uintp;
67 package body Exp_Ch7 is
69 --------------------------------
70 -- Transient Scope Management --
71 --------------------------------
73 -- A transient scope is created when temporary objects are created by the
74 -- compiler. These temporary objects are allocated on the secondary stack
75 -- and the transient scope is responsible for finalizing the object when
76 -- appropriate and reclaiming the memory at the right time. The temporary
77 -- objects are generally the objects allocated to store the result of a
78 -- function returning an unconstrained or a tagged value. Expressions
79 -- needing to be wrapped in a transient scope (functions calls returning
80 -- unconstrained or tagged values) may appear in 3 different contexts which
81 -- lead to 3 different kinds of transient scope expansion:
83 -- 1. In a simple statement (procedure call, assignment, ...). In
84 -- this case the instruction is wrapped into a transient block.
85 -- (See Wrap_Transient_Statement for details)
87 -- 2. In an expression of a control structure (test in a IF statement,
88 -- expression in a CASE statement, ...).
89 -- (See Wrap_Transient_Expression for details)
91 -- 3. In a expression of an object_declaration. No wrapping is possible
92 -- here, so the finalization actions, if any, are done right after the
93 -- declaration and the secondary stack deallocation is done in the
94 -- proper enclosing scope (see Wrap_Transient_Declaration for details)
96 -- Note about functions returning tagged types: it has been decided to
97 -- always allocate their result in the secondary stack, even though is not
98 -- absolutely mandatory when the tagged type is constrained because the
99 -- caller knows the size of the returned object and thus could allocate the
100 -- result in the primary stack. An exception to this is when the function
101 -- builds its result in place, as is done for functions with inherently
102 -- limited result types for Ada 2005. In that case, certain callers may
103 -- pass the address of a constrained object as the target object for the
106 -- By allocating tagged results in the secondary stack a number of
107 -- implementation difficulties are avoided:
109 -- - If it is a dispatching function call, the computation of the size of
110 -- the result is possible but complex from the outside.
112 -- - If the returned type is controlled, the assignment of the returned
113 -- value to the anonymous object involves an Adjust, and we have no
114 -- easy way to access the anonymous object created by the back end.
116 -- - If the returned type is class-wide, this is an unconstrained type
119 -- Furthermore, the small loss in efficiency which is the result of this
120 -- decision is not such a big deal because functions returning tagged types
121 -- are not as common in practice compared to functions returning access to
124 --------------------------------------------------
125 -- Transient Blocks and Finalization Management --
126 --------------------------------------------------
128 function Find_Node_To_Be_Wrapped (N : Node_Id) return Node_Id;
129 -- N is a node which may generate a transient scope. Loop over the parent
130 -- pointers of N until it find the appropriate node to wrap. If it returns
131 -- Empty, it means that no transient scope is needed in this context.
133 procedure Insert_Actions_In_Scope_Around (N : Node_Id);
134 -- Insert the before-actions kept in the scope stack before N, and the
135 -- after-actions after N, which must be a member of a list.
137 function Make_Transient_Block
140 Par : Node_Id) return Node_Id;
141 -- Action is a single statement or object declaration. Par is the proper
142 -- parent of the generated block. Create a transient block whose name is
143 -- the current scope and the only handled statement is Action. If Action
144 -- involves controlled objects or secondary stack usage, the corresponding
145 -- cleanup actions are performed at the end of the block.
147 procedure Set_Node_To_Be_Wrapped (N : Node_Id);
148 -- Set the field Node_To_Be_Wrapped of the current scope
150 -- ??? The entire comment needs to be rewritten
152 -----------------------------
153 -- Finalization Management --
154 -----------------------------
156 -- This part describe how Initialization/Adjustment/Finalization procedures
157 -- are generated and called. Two cases must be considered, types that are
158 -- Controlled (Is_Controlled flag set) and composite types that contain
159 -- controlled components (Has_Controlled_Component flag set). In the first
160 -- case the procedures to call are the user-defined primitive operations
161 -- Initialize/Adjust/Finalize. In the second case, GNAT generates
162 -- Deep_Initialize, Deep_Adjust and Deep_Finalize that are in charge
163 -- of calling the former procedures on the controlled components.
165 -- For records with Has_Controlled_Component set, a hidden "controller"
166 -- component is inserted. This controller component contains its own
167 -- finalization list on which all controlled components are attached
168 -- creating an indirection on the upper-level Finalization list. This
169 -- technique facilitates the management of objects whose number of
170 -- controlled components changes during execution. This controller
171 -- component is itself controlled and is attached to the upper-level
172 -- finalization chain. Its adjust primitive is in charge of calling adjust
173 -- on the components and adjusting the finalization pointer to match their
174 -- new location (see a-finali.adb).
176 -- It is not possible to use a similar technique for arrays that have
177 -- Has_Controlled_Component set. In this case, deep procedures are
178 -- generated that call initialize/adjust/finalize + attachment or
179 -- detachment on the finalization list for all component.
181 -- Initialize calls: they are generated for declarations or dynamic
182 -- allocations of Controlled objects with no initial value. They are always
183 -- followed by an attachment to the current Finalization Chain. For the
184 -- dynamic allocation case this the chain attached to the scope of the
185 -- access type definition otherwise, this is the chain of the current
188 -- Adjust Calls: They are generated on 2 occasions: (1) for
189 -- declarations or dynamic allocations of Controlled objects with an
190 -- initial value. (2) after an assignment. In the first case they are
191 -- followed by an attachment to the final chain, in the second case
194 -- Finalization Calls: They are generated on (1) scope exit, (2)
195 -- assignments, (3) unchecked deallocations. In case (3) they have to
196 -- be detached from the final chain, in case (2) they must not and in
197 -- case (1) this is not important since we are exiting the scope anyway.
201 -- Type extensions will have a new record controller at each derivation
202 -- level containing controlled components. The record controller for
203 -- the parent/ancestor is attached to the finalization list of the
204 -- extension's record controller (i.e. the parent is like a component
205 -- of the extension).
207 -- For types that are both Is_Controlled and Has_Controlled_Components,
208 -- the record controller and the object itself are handled separately.
209 -- It could seem simpler to attach the object at the end of its record
210 -- controller but this would not tackle view conversions properly.
212 -- A classwide type can always potentially have controlled components
213 -- but the record controller of the corresponding actual type may not
214 -- be known at compile time so the dispatch table contains a special
215 -- field that allows to compute the offset of the record controller
216 -- dynamically. See s-finimp.Deep_Tag_Attach and a-tags.RC_Offset.
218 -- Here is a simple example of the expansion of a controlled block :
222 -- Y : Controlled := Init;
228 -- Z : R := (C => X);
237 -- _L : System.FI.Finalizable_Ptr;
239 -- procedure _Clean is
242 -- System.FI.Finalize_List (_L);
250 -- Attach_To_Final_List (_L, Finalizable (X), 1);
251 -- at end: Abort_Undefer;
252 -- Y : Controlled := Init;
254 -- Attach_To_Final_List (_L, Finalizable (Y), 1);
262 -- Deep_Initialize (W, _L, 1);
263 -- at end: Abort_Under;
264 -- Z : R := (C => X);
265 -- Deep_Adjust (Z, _L, 1);
269 -- Deep_Finalize (W, False);
270 -- <save W's final pointers>
272 -- <restore W's final pointers>
273 -- Deep_Adjust (W, _L, 0);
278 type Final_Primitives is
279 (Initialize_Case, Adjust_Case, Finalize_Case, Address_Case);
280 -- This enumeration type is defined in order to ease sharing code for
281 -- building finalization procedures for composite types.
283 Name_Of : constant array (Final_Primitives) of Name_Id :=
284 (Initialize_Case => Name_Initialize,
285 Adjust_Case => Name_Adjust,
286 Finalize_Case => Name_Finalize,
287 Address_Case => Name_Finalize_Address);
288 Deep_Name_Of : constant array (Final_Primitives) of TSS_Name_Type :=
289 (Initialize_Case => TSS_Deep_Initialize,
290 Adjust_Case => TSS_Deep_Adjust,
291 Finalize_Case => TSS_Deep_Finalize,
292 Address_Case => TSS_Finalize_Address);
294 procedure Build_Array_Deep_Procs (Typ : Entity_Id);
295 -- Build the deep Initialize/Adjust/Finalize for a record Typ with
296 -- Has_Controlled_Component set and store them using the TSS mechanism.
298 function Build_Cleanup_Statements (N : Node_Id) return List_Id;
299 -- Create the clean up calls for an asynchronous call block, task master,
300 -- protected subprogram body, task allocation block or task body. If the
301 -- context does not contain the above constructs, the routine returns an
304 procedure Build_Finalizer
306 Clean_Stmts : List_Id;
309 Defer_Abort : Boolean;
310 Fin_Id : out Entity_Id);
311 -- N may denote an accept statement, block, entry body, package body,
312 -- package spec, protected body, subprogram body, and a task body. Create
313 -- a procedure which contains finalization calls for all controlled objects
314 -- declared in the declarative or statement region of N. The calls are
315 -- built in reverse order relative to the original declarations. In the
316 -- case of a tack body, the routine delays the creation of the finalizer
317 -- until all statements have been moved to the task body procedure.
318 -- Clean_Stmts may contain additional context-dependent code used to abort
319 -- asynchronous calls or complete tasks (see Build_Cleanup_Statements).
320 -- Mark_Id is the secondary stack used in the current context or Empty if
321 -- missing. Top_Decls is the list on which the declaration of the finalizer
322 -- is attached in the non-package case. Defer_Abort indicates that the
323 -- statements passed in perform actions that require abort to be deferred,
324 -- such as for task termination. Fin_Id is the finalizer declaration
327 procedure Build_Finalizer_Call (N : Node_Id; Fin_Id : Entity_Id);
328 -- N is a construct which contains a handled sequence of statements, Fin_Id
329 -- is the entity of a finalizer. Create an At_End handler which covers the
330 -- statements of N and calls Fin_Id. If the handled statement sequence has
331 -- an exception handler, the statements will be wrapped in a block to avoid
332 -- unwanted interaction with the new At_End handler.
334 procedure Build_Record_Deep_Procs (Typ : Entity_Id);
335 -- Build the deep Initialize/Adjust/Finalize for a record Typ with
336 -- Has_Component_Component set and store them using the TSS mechanism.
338 procedure Check_Visibly_Controlled
339 (Prim : Final_Primitives;
341 E : in out Entity_Id;
342 Cref : in out Node_Id);
343 -- The controlled operation declared for a derived type may not be
344 -- overriding, if the controlled operations of the parent type are hidden,
345 -- for example when the parent is a private type whose full view is
346 -- controlled. For other primitive operations we modify the name of the
347 -- operation to indicate that it is not overriding, but this is not
348 -- possible for Initialize, etc. because they have to be retrievable by
349 -- name. Before generating the proper call to one of these operations we
350 -- check whether Typ is known to be controlled at the point of definition.
351 -- If it is not then we must retrieve the hidden operation of the parent
352 -- and use it instead. This is one case that might be solved more cleanly
353 -- once Overriding pragmas or declarations are in place.
355 function Convert_View
358 Ind : Pos := 1) return Node_Id;
359 -- Proc is one of the Initialize/Adjust/Finalize operations, and Arg is the
360 -- argument being passed to it. Ind indicates which formal of procedure
361 -- Proc we are trying to match. This function will, if necessary, generate
362 -- a conversion between the partial and full view of Arg to match the type
363 -- of the formal of Proc, or force a conversion to the class-wide type in
364 -- the case where the operation is abstract.
366 function Enclosing_Function (E : Entity_Id) return Entity_Id;
367 -- Given an arbitrary entity, traverse the scope chain looking for the
368 -- first enclosing function. Return Empty if no function was found.
374 For_Parent : Boolean := False) return Node_Id;
375 -- Subsidiary to Make_Adjust_Call and Make_Final_Call. Given the entity of
376 -- routine [Deep_]Adjust / Finalize and an object parameter, create an
377 -- adjust / finalization call. Flag For_Parent should be set when field
378 -- _parent is being processed.
380 function Make_Deep_Proc
381 (Prim : Final_Primitives;
383 Stmts : List_Id) return Node_Id;
384 -- This function generates the tree for Deep_Initialize, Deep_Adjust or
385 -- Deep_Finalize procedures according to the first parameter, these
386 -- procedures operate on the type Typ. The Stmts parameter gives the body
389 function Make_Deep_Array_Body
390 (Prim : Final_Primitives;
391 Typ : Entity_Id) return List_Id;
392 -- This function generates the list of statements for implementing
393 -- Deep_Initialize, Deep_Adjust or Deep_Finalize procedures according to
394 -- the first parameter, these procedures operate on the array type Typ.
396 function Make_Deep_Record_Body
397 (Prim : Final_Primitives;
399 Is_Local : Boolean := False) return List_Id;
400 -- This function generates the list of statements for implementing
401 -- Deep_Initialize, Deep_Adjust or Deep_Finalize procedures according to
402 -- the first parameter, these procedures operate on the record type Typ.
403 -- Flag Is_Local is used in conjunction with Deep_Finalize to designate
404 -- whether the inner logic should be dictated by state counters.
406 function Make_Finalize_Address_Stmts (Typ : Entity_Id) return List_Id;
407 -- Subsidiary to Make_Finalize_Address_Body, Make_Deep_Array_Body and
408 -- Make_Deep_Record_Body. Generate the following statements:
411 -- type Acc_Typ is access all Typ;
412 -- for Acc_Typ'Storage_Size use 0;
414 -- [Deep_]Finalize (Acc_Typ (V).all);
417 ----------------------------
418 -- Build_Array_Deep_Procs --
419 ----------------------------
421 procedure Build_Array_Deep_Procs (Typ : Entity_Id) is
425 (Prim => Initialize_Case,
427 Stmts => Make_Deep_Array_Body (Initialize_Case, Typ)));
429 if not Is_Immutably_Limited_Type (Typ) then
432 (Prim => Adjust_Case,
434 Stmts => Make_Deep_Array_Body (Adjust_Case, Typ)));
437 -- Do not generate Deep_Finalize and Finalize_Address if finalization is
438 -- suppressed since these routine will not be used.
440 if not Restriction_Active (No_Finalization) then
443 (Prim => Finalize_Case,
445 Stmts => Make_Deep_Array_Body (Finalize_Case, Typ)));
447 -- Create TSS primitive Finalize_Address for non-VM targets. JVM and
448 -- .NET do not support address arithmetic and unchecked conversions.
450 if VM_Target = No_VM then
453 (Prim => Address_Case,
455 Stmts => Make_Deep_Array_Body (Address_Case, Typ)));
458 end Build_Array_Deep_Procs;
460 ------------------------------
461 -- Build_Cleanup_Statements --
462 ------------------------------
464 function Build_Cleanup_Statements (N : Node_Id) return List_Id is
465 Is_Asynchronous_Call : constant Boolean :=
466 Nkind (N) = N_Block_Statement
467 and then Is_Asynchronous_Call_Block (N);
468 Is_Master : constant Boolean :=
469 Nkind (N) /= N_Entry_Body
470 and then Is_Task_Master (N);
471 Is_Protected_Body : constant Boolean :=
472 Nkind (N) = N_Subprogram_Body
473 and then Is_Protected_Subprogram_Body (N);
474 Is_Task_Allocation : constant Boolean :=
475 Nkind (N) = N_Block_Statement
476 and then Is_Task_Allocation_Block (N);
477 Is_Task_Body : constant Boolean :=
478 Nkind (Original_Node (N)) = N_Task_Body;
480 Loc : constant Source_Ptr := Sloc (N);
481 Stmts : constant List_Id := New_List;
485 if Restricted_Profile then
487 Build_Runtime_Call (Loc, RE_Complete_Restricted_Task));
489 Append_To (Stmts, Build_Runtime_Call (Loc, RE_Complete_Task));
493 if Restriction_Active (No_Task_Hierarchy) = False then
494 Append_To (Stmts, Build_Runtime_Call (Loc, RE_Complete_Master));
497 -- Add statements to unlock the protected object parameter and to
498 -- undefer abort. If the context is a protected procedure and the object
499 -- has entries, call the entry service routine.
501 -- NOTE: The generated code references _object, a parameter to the
504 elsif Is_Protected_Body then
506 Spec : constant Node_Id := Parent (Corresponding_Spec (N));
507 Conc_Typ : Entity_Id;
510 Param_Typ : Entity_Id;
513 -- Find the _object parameter representing the protected object
515 Param := First (Parameter_Specifications (Spec));
517 Param_Typ := Etype (Parameter_Type (Param));
519 if Ekind (Param_Typ) = E_Record_Type then
520 Conc_Typ := Corresponding_Concurrent_Type (Param_Typ);
523 exit when No (Param) or else Present (Conc_Typ);
527 pragma Assert (Present (Param));
529 -- If the associated protected object has entries, a protected
530 -- procedure has to service entry queues. In this case generate:
532 -- Service_Entries (_object._object'Access);
534 if Nkind (Specification (N)) = N_Procedure_Specification
535 and then Has_Entries (Conc_Typ)
537 case Corresponding_Runtime_Package (Conc_Typ) is
538 when System_Tasking_Protected_Objects_Entries =>
539 Nam := New_Reference_To (RTE (RE_Service_Entries), Loc);
541 when System_Tasking_Protected_Objects_Single_Entry =>
542 Nam := New_Reference_To (RTE (RE_Service_Entry), Loc);
549 Make_Procedure_Call_Statement (Loc,
551 Parameter_Associations => New_List (
552 Make_Attribute_Reference (Loc,
554 Make_Selected_Component (Loc,
555 Prefix => New_Reference_To (
556 Defining_Identifier (Param), Loc),
558 Make_Identifier (Loc, Name_uObject)),
559 Attribute_Name => Name_Unchecked_Access))));
563 -- Unlock (_object._object'Access);
565 case Corresponding_Runtime_Package (Conc_Typ) is
566 when System_Tasking_Protected_Objects_Entries =>
567 Nam := New_Reference_To (RTE (RE_Unlock_Entries), Loc);
569 when System_Tasking_Protected_Objects_Single_Entry =>
570 Nam := New_Reference_To (RTE (RE_Unlock_Entry), Loc);
572 when System_Tasking_Protected_Objects =>
573 Nam := New_Reference_To (RTE (RE_Unlock), Loc);
580 Make_Procedure_Call_Statement (Loc,
582 Parameter_Associations => New_List (
583 Make_Attribute_Reference (Loc,
585 Make_Selected_Component (Loc,
588 (Defining_Identifier (Param), Loc),
590 Make_Identifier (Loc, Name_uObject)),
591 Attribute_Name => Name_Unchecked_Access))));
597 if Abort_Allowed then
599 Make_Procedure_Call_Statement (Loc,
601 New_Reference_To (RTE (RE_Abort_Undefer), Loc),
602 Parameter_Associations => Empty_List));
606 -- Add a call to Expunge_Unactivated_Tasks for dynamically allocated
607 -- tasks. Other unactivated tasks are completed by Complete_Task or
610 -- NOTE: The generated code references _chain, a local object
612 elsif Is_Task_Allocation then
615 -- Expunge_Unactivated_Tasks (_chain);
617 -- where _chain is the list of tasks created by the allocator but not
618 -- yet activated. This list will be empty unless the block completes
622 Make_Procedure_Call_Statement (Loc,
625 (RTE (RE_Expunge_Unactivated_Tasks), Loc),
626 Parameter_Associations => New_List (
627 New_Reference_To (Activation_Chain_Entity (N), Loc))));
629 -- Attempt to cancel an asynchronous entry call whenever the block which
630 -- contains the abortable part is exited.
632 -- NOTE: The generated code references Cnn, a local object
634 elsif Is_Asynchronous_Call then
636 Cancel_Param : constant Entity_Id :=
637 Entry_Cancel_Parameter (Entity (Identifier (N)));
640 -- If it is of type Communication_Block, this must be a protected
641 -- entry call. Generate:
643 -- if Enqueued (Cancel_Param) then
644 -- Cancel_Protected_Entry_Call (Cancel_Param);
647 if Is_RTE (Etype (Cancel_Param), RE_Communication_Block) then
649 Make_If_Statement (Loc,
651 Make_Function_Call (Loc,
653 New_Reference_To (RTE (RE_Enqueued), Loc),
654 Parameter_Associations => New_List (
655 New_Reference_To (Cancel_Param, Loc))),
657 Then_Statements => New_List (
658 Make_Procedure_Call_Statement (Loc,
661 (RTE (RE_Cancel_Protected_Entry_Call), Loc),
662 Parameter_Associations => New_List (
663 New_Reference_To (Cancel_Param, Loc))))));
665 -- Asynchronous delay, generate:
666 -- Cancel_Async_Delay (Cancel_Param);
668 elsif Is_RTE (Etype (Cancel_Param), RE_Delay_Block) then
670 Make_Procedure_Call_Statement (Loc,
672 New_Reference_To (RTE (RE_Cancel_Async_Delay), Loc),
673 Parameter_Associations => New_List (
674 Make_Attribute_Reference (Loc,
676 New_Reference_To (Cancel_Param, Loc),
677 Attribute_Name => Name_Unchecked_Access))));
679 -- Task entry call, generate:
680 -- Cancel_Task_Entry_Call (Cancel_Param);
684 Make_Procedure_Call_Statement (Loc,
686 New_Reference_To (RTE (RE_Cancel_Task_Entry_Call), Loc),
687 Parameter_Associations => New_List (
688 New_Reference_To (Cancel_Param, Loc))));
694 end Build_Cleanup_Statements;
696 -----------------------------
697 -- Build_Controlling_Procs --
698 -----------------------------
700 procedure Build_Controlling_Procs (Typ : Entity_Id) is
702 if Is_Array_Type (Typ) then
703 Build_Array_Deep_Procs (Typ);
704 else pragma Assert (Is_Record_Type (Typ));
705 Build_Record_Deep_Procs (Typ);
707 end Build_Controlling_Procs;
709 -----------------------------
710 -- Build_Exception_Handler --
711 -----------------------------
713 function Build_Exception_Handler
714 (Data : Finalization_Exception_Data;
715 For_Library : Boolean := False) return Node_Id
718 Proc_To_Call : Entity_Id;
721 pragma Assert (Present (Data.E_Id));
722 pragma Assert (Present (Data.Raised_Id));
725 -- Get_Current_Excep.all.all
727 Actuals := New_List (
728 Make_Explicit_Dereference (Data.Loc,
730 Make_Function_Call (Data.Loc,
732 Make_Explicit_Dereference (Data.Loc,
734 New_Reference_To (RTE (RE_Get_Current_Excep),
737 if For_Library and then not Restricted_Profile then
738 Proc_To_Call := RTE (RE_Save_Library_Occurrence);
741 Proc_To_Call := RTE (RE_Save_Occurrence);
742 Prepend_To (Actuals, New_Reference_To (Data.E_Id, Data.Loc));
747 -- if not Raised_Id then
748 -- Raised_Id := True;
750 -- Save_Occurrence (E_Id, Get_Current_Excep.all.all);
752 -- Save_Library_Occurrence (Get_Current_Excep.all.all);
756 Make_Exception_Handler (Data.Loc,
758 New_List (Make_Others_Choice (Data.Loc)),
759 Statements => New_List (
760 Make_If_Statement (Data.Loc,
762 Make_Op_Not (Data.Loc,
763 Right_Opnd => New_Reference_To (Data.Raised_Id, Data.Loc)),
765 Then_Statements => New_List (
766 Make_Assignment_Statement (Data.Loc,
767 Name => New_Reference_To (Data.Raised_Id, Data.Loc),
768 Expression => New_Reference_To (Standard_True, Data.Loc)),
770 Make_Procedure_Call_Statement (Data.Loc,
772 New_Reference_To (Proc_To_Call, Data.Loc),
773 Parameter_Associations => Actuals)))));
774 end Build_Exception_Handler;
776 -------------------------------
777 -- Build_Finalization_Master --
778 -------------------------------
780 procedure Build_Finalization_Master
782 Ins_Node : Node_Id := Empty;
783 Encl_Scope : Entity_Id := Empty)
785 Desig_Typ : constant Entity_Id := Directly_Designated_Type (Typ);
786 Ptr_Typ : Entity_Id := Root_Type (Base_Type (Typ));
788 function In_Deallocation_Instance (E : Entity_Id) return Boolean;
789 -- Determine whether entity E is inside a wrapper package created for
790 -- an instance of Ada.Unchecked_Deallocation.
792 ------------------------------
793 -- In_Deallocation_Instance --
794 ------------------------------
796 function In_Deallocation_Instance (E : Entity_Id) return Boolean is
797 Pkg : constant Entity_Id := Scope (E);
798 Par : Node_Id := Empty;
801 if Ekind (Pkg) = E_Package
802 and then Present (Related_Instance (Pkg))
803 and then Ekind (Related_Instance (Pkg)) = E_Procedure
805 Par := Generic_Parent (Parent (Related_Instance (Pkg)));
809 and then Chars (Par) = Name_Unchecked_Deallocation
810 and then Chars (Scope (Par)) = Name_Ada
811 and then Scope (Scope (Par)) = Standard_Standard;
815 end In_Deallocation_Instance;
817 -- Start of processing for Build_Finalization_Master
820 if Is_Private_Type (Ptr_Typ)
821 and then Present (Full_View (Ptr_Typ))
823 Ptr_Typ := Full_View (Ptr_Typ);
826 -- Certain run-time configurations and targets do not provide support
827 -- for controlled types.
829 if Restriction_Active (No_Finalization) then
832 -- Do not process C, C++, CIL and Java types since it is assumend that
833 -- the non-Ada side will handle their clean up.
835 elsif Convention (Desig_Typ) = Convention_C
836 or else Convention (Desig_Typ) = Convention_CIL
837 or else Convention (Desig_Typ) = Convention_CPP
838 or else Convention (Desig_Typ) = Convention_Java
842 -- Various machinery such as freezing may have already created a
843 -- finalization master.
845 elsif Present (Finalization_Master (Ptr_Typ)) then
848 -- Do not process types that return on the secondary stack
850 elsif Present (Associated_Storage_Pool (Ptr_Typ))
851 and then Is_RTE (Associated_Storage_Pool (Ptr_Typ), RE_SS_Pool)
855 -- Do not process types which may never allocate an object
857 elsif No_Pool_Assigned (Ptr_Typ) then
860 -- Do not process access types coming from Ada.Unchecked_Deallocation
861 -- instances. Even though the designated type may be controlled, the
862 -- access type will never participate in allocation.
864 elsif In_Deallocation_Instance (Ptr_Typ) then
867 -- Ignore the general use of anonymous access types unless the context
868 -- requires a finalization master.
870 elsif Ekind (Ptr_Typ) = E_Anonymous_Access_Type
871 and then No (Ins_Node)
875 -- Do not process non-library access types when restriction No_Nested_
876 -- Finalization is in effect since masters are controlled objects.
878 elsif Restriction_Active (No_Nested_Finalization)
879 and then not Is_Library_Level_Entity (Ptr_Typ)
883 -- For .NET/JVM targets, allow the processing of access-to-controlled
884 -- types where the designated type is explicitly derived from [Limited_]
887 elsif VM_Target /= No_VM
888 and then not Is_Controlled (Desig_Typ)
892 -- Do not create finalization masters in Alfa mode because they result
893 -- in unwanted expansion.
900 Loc : constant Source_Ptr := Sloc (Ptr_Typ);
901 Actions : constant List_Id := New_List;
902 Fin_Mas_Id : Entity_Id;
907 -- Fnn : aliased Finalization_Master;
909 -- Source access types use fixed master names since the master is
910 -- inserted in the same source unit only once. The only exception to
911 -- this are instances using the same access type as generic actual.
913 if Comes_From_Source (Ptr_Typ)
914 and then not Inside_A_Generic
917 Make_Defining_Identifier (Loc,
918 Chars => New_External_Name (Chars (Ptr_Typ), "FM"));
920 -- Internally generated access types use temporaries as their names
921 -- due to possible collision with identical names coming from other
925 Fin_Mas_Id := Make_Temporary (Loc, 'F');
929 Make_Object_Declaration (Loc,
930 Defining_Identifier => Fin_Mas_Id,
931 Aliased_Present => True,
933 New_Reference_To (RTE (RE_Finalization_Master), Loc)));
935 -- Storage pool selection and attribute decoration of the generated
936 -- master. Since .NET/JVM compilers do not support pools, this step
939 if VM_Target = No_VM then
941 -- If the access type has a user-defined pool, use it as the base
942 -- storage medium for the finalization pool.
944 if Present (Associated_Storage_Pool (Ptr_Typ)) then
945 Pool_Id := Associated_Storage_Pool (Ptr_Typ);
947 -- The default choice is the global pool
950 Pool_Id := Get_Global_Pool_For_Access_Type (Ptr_Typ);
951 Set_Associated_Storage_Pool (Ptr_Typ, Pool_Id);
955 -- Set_Base_Pool (Fnn, Pool_Id'Unchecked_Access);
958 Make_Procedure_Call_Statement (Loc,
960 New_Reference_To (RTE (RE_Set_Base_Pool), Loc),
961 Parameter_Associations => New_List (
962 New_Reference_To (Fin_Mas_Id, Loc),
963 Make_Attribute_Reference (Loc,
964 Prefix => New_Reference_To (Pool_Id, Loc),
965 Attribute_Name => Name_Unrestricted_Access))));
968 Set_Finalization_Master (Ptr_Typ, Fin_Mas_Id);
970 -- A finalization master created for an anonymous access type must be
971 -- inserted before a context-dependent node.
973 if Present (Ins_Node) then
974 Push_Scope (Encl_Scope);
976 -- Treat use clauses as declarations and insert directly in front
979 if Nkind_In (Ins_Node, N_Use_Package_Clause,
982 Insert_List_Before_And_Analyze (Ins_Node, Actions);
984 Insert_Actions (Ins_Node, Actions);
989 elsif Ekind (Desig_Typ) = E_Incomplete_Type
990 and then Has_Completion_In_Body (Desig_Typ)
992 Insert_Actions (Parent (Ptr_Typ), Actions);
994 -- If the designated type is not yet frozen, then append the actions
995 -- to that type's freeze actions. The actions need to be appended to
996 -- whichever type is frozen later, similarly to what Freeze_Type does
997 -- for appending the storage pool declaration for an access type.
998 -- Otherwise, the call to Set_Storage_Pool_Ptr might reference the
999 -- pool object before it's declared. However, it's not clear that
1000 -- this is exactly the right test to accomplish that here. ???
1002 elsif Present (Freeze_Node (Desig_Typ))
1003 and then not Analyzed (Freeze_Node (Desig_Typ))
1005 Append_Freeze_Actions (Desig_Typ, Actions);
1007 elsif Present (Freeze_Node (Ptr_Typ))
1008 and then not Analyzed (Freeze_Node (Ptr_Typ))
1010 Append_Freeze_Actions (Ptr_Typ, Actions);
1012 -- If there's a pool created locally for the access type, then we
1013 -- need to ensure that the master gets created after the pool object,
1014 -- because otherwise we can have a forward reference, so we force the
1015 -- master actions to be inserted and analyzed after the pool entity.
1016 -- Note that both the access type and its designated type may have
1017 -- already been frozen and had their freezing actions analyzed at
1018 -- this point. (This seems a little unclean.???)
1020 elsif VM_Target = No_VM
1021 and then Scope (Pool_Id) = Scope (Ptr_Typ)
1023 Insert_List_After_And_Analyze (Parent (Pool_Id), Actions);
1026 Insert_Actions (Parent (Ptr_Typ), Actions);
1029 end Build_Finalization_Master;
1031 ---------------------
1032 -- Build_Finalizer --
1033 ---------------------
1035 procedure Build_Finalizer
1037 Clean_Stmts : List_Id;
1038 Mark_Id : Entity_Id;
1039 Top_Decls : List_Id;
1040 Defer_Abort : Boolean;
1041 Fin_Id : out Entity_Id)
1043 Acts_As_Clean : constant Boolean :=
1046 (Present (Clean_Stmts)
1047 and then Is_Non_Empty_List (Clean_Stmts));
1048 Exceptions_OK : constant Boolean :=
1049 not Restriction_Active (No_Exception_Propagation);
1050 For_Package_Body : constant Boolean := Nkind (N) = N_Package_Body;
1051 For_Package_Spec : constant Boolean := Nkind (N) = N_Package_Declaration;
1052 For_Package : constant Boolean :=
1053 For_Package_Body or else For_Package_Spec;
1054 Loc : constant Source_Ptr := Sloc (N);
1056 -- NOTE: Local variable declarations are conservative and do not create
1057 -- structures right from the start. Entities and lists are created once
1058 -- it has been established that N has at least one controlled object.
1060 Components_Built : Boolean := False;
1061 -- A flag used to avoid double initialization of entities and lists. If
1062 -- the flag is set then the following variables have been initialized:
1069 Counter_Id : Entity_Id := Empty;
1070 Counter_Val : Int := 0;
1071 -- Name and value of the state counter
1073 Decls : List_Id := No_List;
1074 -- Declarative region of N (if available). If N is a package declaration
1075 -- Decls denotes the visible declarations.
1077 Finalizer_Data : Finalization_Exception_Data;
1078 -- Data for the exception
1080 Finalizer_Decls : List_Id := No_List;
1081 -- Local variable declarations. This list holds the label declarations
1082 -- of all jump block alternatives as well as the declaration of the
1083 -- local exception occurence and the raised flag.
1085 -- E : Exception_Occurrence;
1086 -- Raised : Boolean := False;
1087 -- L<counter value> : label;
1089 Finalizer_Insert_Nod : Node_Id := Empty;
1090 -- Insertion point for the finalizer body. Depending on the context
1091 -- (Nkind of N) and the individual grouping of controlled objects, this
1092 -- node may denote a package declaration or body, package instantiation,
1093 -- block statement or a counter update statement.
1095 Finalizer_Stmts : List_Id := No_List;
1096 -- The statement list of the finalizer body. It contains the following:
1098 -- Abort_Defer; -- Added if abort is allowed
1099 -- <call to Prev_At_End> -- Added if exists
1100 -- <cleanup statements> -- Added if Acts_As_Clean
1101 -- <jump block> -- Added if Has_Ctrl_Objs
1102 -- <finalization statements> -- Added if Has_Ctrl_Objs
1103 -- <stack release> -- Added if Mark_Id exists
1104 -- Abort_Undefer; -- Added if abort is allowed
1106 Has_Ctrl_Objs : Boolean := False;
1107 -- A general flag which denotes whether N has at least one controlled
1110 Has_Tagged_Types : Boolean := False;
1111 -- A general flag which indicates whether N has at least one library-
1112 -- level tagged type declaration.
1114 HSS : Node_Id := Empty;
1115 -- The sequence of statements of N (if available)
1117 Jump_Alts : List_Id := No_List;
1118 -- Jump block alternatives. Depending on the value of the state counter,
1119 -- the control flow jumps to a sequence of finalization statements. This
1120 -- list contains the following:
1122 -- when <counter value> =>
1123 -- goto L<counter value>;
1125 Jump_Block_Insert_Nod : Node_Id := Empty;
1126 -- Specific point in the finalizer statements where the jump block is
1129 Last_Top_Level_Ctrl_Construct : Node_Id := Empty;
1130 -- The last controlled construct encountered when processing the top
1131 -- level lists of N. This can be a nested package, an instantiation or
1132 -- an object declaration.
1134 Prev_At_End : Entity_Id := Empty;
1135 -- The previous at end procedure of the handled statements block of N
1137 Priv_Decls : List_Id := No_List;
1138 -- The private declarations of N if N is a package declaration
1140 Spec_Id : Entity_Id := Empty;
1141 Spec_Decls : List_Id := Top_Decls;
1142 Stmts : List_Id := No_List;
1144 Tagged_Type_Stmts : List_Id := No_List;
1145 -- Contains calls to Ada.Tags.Unregister_Tag for all library-level
1146 -- tagged types found in N.
1148 -----------------------
1149 -- Local subprograms --
1150 -----------------------
1152 procedure Build_Components;
1153 -- Create all entites and initialize all lists used in the creation of
1156 procedure Create_Finalizer;
1157 -- Create the spec and body of the finalizer and insert them in the
1158 -- proper place in the tree depending on the context.
1160 procedure Process_Declarations
1162 Preprocess : Boolean := False;
1163 Top_Level : Boolean := False);
1164 -- Inspect a list of declarations or statements which may contain
1165 -- objects that need finalization. When flag Preprocess is set, the
1166 -- routine will simply count the total number of controlled objects in
1167 -- Decls. Flag Top_Level denotes whether the processing is done for
1168 -- objects in nested package declarations or instances.
1170 procedure Process_Object_Declaration
1172 Has_No_Init : Boolean := False;
1173 Is_Protected : Boolean := False);
1174 -- Generate all the machinery associated with the finalization of a
1175 -- single object. Flag Has_No_Init is used to denote certain contexts
1176 -- where Decl does not have initialization call(s). Flag Is_Protected
1177 -- is set when Decl denotes a simple protected object.
1179 procedure Process_Tagged_Type_Declaration (Decl : Node_Id);
1180 -- Generate all the code necessary to unregister the external tag of a
1183 ----------------------
1184 -- Build_Components --
1185 ----------------------
1187 procedure Build_Components is
1188 Counter_Decl : Node_Id;
1189 Counter_Typ : Entity_Id;
1190 Counter_Typ_Decl : Node_Id;
1193 pragma Assert (Present (Decls));
1195 -- This routine might be invoked several times when dealing with
1196 -- constructs that have two lists (either two declarative regions
1197 -- or declarations and statements). Avoid double initialization.
1199 if Components_Built then
1203 Components_Built := True;
1205 if Has_Ctrl_Objs then
1207 -- Create entities for the counter, its type, the local exception
1208 -- and the raised flag.
1210 Counter_Id := Make_Temporary (Loc, 'C');
1211 Counter_Typ := Make_Temporary (Loc, 'T');
1213 Finalizer_Decls := New_List;
1215 if Exceptions_OK then
1216 Build_Object_Declarations
1217 (Finalizer_Data, Finalizer_Decls, Loc, For_Package);
1220 -- Since the total number of controlled objects is always known,
1221 -- build a subtype of Natural with precise bounds. This allows
1222 -- the backend to optimize the case statement. Generate:
1224 -- subtype Tnn is Natural range 0 .. Counter_Val;
1227 Make_Subtype_Declaration (Loc,
1228 Defining_Identifier => Counter_Typ,
1229 Subtype_Indication =>
1230 Make_Subtype_Indication (Loc,
1231 Subtype_Mark => New_Reference_To (Standard_Natural, Loc),
1233 Make_Range_Constraint (Loc,
1237 Make_Integer_Literal (Loc, Uint_0),
1239 Make_Integer_Literal (Loc, Counter_Val)))));
1241 -- Generate the declaration of the counter itself:
1243 -- Counter : Integer := 0;
1246 Make_Object_Declaration (Loc,
1247 Defining_Identifier => Counter_Id,
1248 Object_Definition => New_Reference_To (Counter_Typ, Loc),
1249 Expression => Make_Integer_Literal (Loc, 0));
1251 -- Set the type of the counter explicitly to prevent errors when
1252 -- examining object declarations later on.
1254 Set_Etype (Counter_Id, Counter_Typ);
1256 -- The counter and its type are inserted before the source
1257 -- declarations of N.
1259 Prepend_To (Decls, Counter_Decl);
1260 Prepend_To (Decls, Counter_Typ_Decl);
1262 -- The counter and its associated type must be manually analized
1263 -- since N has already been analyzed. Use the scope of the spec
1264 -- when inserting in a package.
1267 Push_Scope (Spec_Id);
1268 Analyze (Counter_Typ_Decl);
1269 Analyze (Counter_Decl);
1273 Analyze (Counter_Typ_Decl);
1274 Analyze (Counter_Decl);
1277 Jump_Alts := New_List;
1280 -- If the context requires additional clean up, the finalization
1281 -- machinery is added after the clean up code.
1283 if Acts_As_Clean then
1284 Finalizer_Stmts := Clean_Stmts;
1285 Jump_Block_Insert_Nod := Last (Finalizer_Stmts);
1287 Finalizer_Stmts := New_List;
1290 if Has_Tagged_Types then
1291 Tagged_Type_Stmts := New_List;
1293 end Build_Components;
1295 ----------------------
1296 -- Create_Finalizer --
1297 ----------------------
1299 procedure Create_Finalizer is
1300 Body_Id : Entity_Id;
1303 Jump_Block : Node_Id;
1305 Label_Id : Entity_Id;
1307 function New_Finalizer_Name return Name_Id;
1308 -- Create a fully qualified name of a package spec or body finalizer.
1309 -- The generated name is of the form: xx__yy__finalize_[spec|body].
1311 ------------------------
1312 -- New_Finalizer_Name --
1313 ------------------------
1315 function New_Finalizer_Name return Name_Id is
1316 procedure New_Finalizer_Name (Id : Entity_Id);
1317 -- Place "__<name-of-Id>" in the name buffer. If the identifier
1318 -- has a non-standard scope, process the scope first.
1320 ------------------------
1321 -- New_Finalizer_Name --
1322 ------------------------
1324 procedure New_Finalizer_Name (Id : Entity_Id) is
1326 if Scope (Id) = Standard_Standard then
1327 Get_Name_String (Chars (Id));
1330 New_Finalizer_Name (Scope (Id));
1331 Add_Str_To_Name_Buffer ("__");
1332 Add_Str_To_Name_Buffer (Get_Name_String (Chars (Id)));
1334 end New_Finalizer_Name;
1336 -- Start of processing for New_Finalizer_Name
1339 -- Create the fully qualified name of the enclosing scope
1341 New_Finalizer_Name (Spec_Id);
1344 -- __finalize_[spec|body]
1346 Add_Str_To_Name_Buffer ("__finalize_");
1348 if For_Package_Spec then
1349 Add_Str_To_Name_Buffer ("spec");
1351 Add_Str_To_Name_Buffer ("body");
1355 end New_Finalizer_Name;
1357 -- Start of processing for Create_Finalizer
1360 -- Step 1: Creation of the finalizer name
1362 -- Packages must use a distinct name for their finalizers since the
1363 -- binder will have to generate calls to them by name. The name is
1364 -- of the following form:
1366 -- xx__yy__finalize_[spec|body]
1369 Fin_Id := Make_Defining_Identifier (Loc, New_Finalizer_Name);
1370 Set_Has_Qualified_Name (Fin_Id);
1371 Set_Has_Fully_Qualified_Name (Fin_Id);
1373 -- The default name is _finalizer
1377 Make_Defining_Identifier (Loc,
1378 Chars => New_External_Name (Name_uFinalizer));
1381 -- Step 2: Creation of the finalizer specification
1384 -- procedure Fin_Id;
1387 Make_Subprogram_Declaration (Loc,
1389 Make_Procedure_Specification (Loc,
1390 Defining_Unit_Name => Fin_Id));
1392 -- Step 3: Creation of the finalizer body
1394 if Has_Ctrl_Objs then
1396 -- Add L0, the default destination to the jump block
1398 Label_Id := Make_Identifier (Loc, New_External_Name ('L', 0));
1399 Set_Entity (Label_Id,
1400 Make_Defining_Identifier (Loc, Chars (Label_Id)));
1401 Label := Make_Label (Loc, Label_Id);
1406 Prepend_To (Finalizer_Decls,
1407 Make_Implicit_Label_Declaration (Loc,
1408 Defining_Identifier => Entity (Label_Id),
1409 Label_Construct => Label));
1415 Append_To (Jump_Alts,
1416 Make_Case_Statement_Alternative (Loc,
1417 Discrete_Choices => New_List (Make_Others_Choice (Loc)),
1418 Statements => New_List (
1419 Make_Goto_Statement (Loc,
1420 Name => New_Reference_To (Entity (Label_Id), Loc)))));
1425 Append_To (Finalizer_Stmts, Label);
1427 -- The local exception does not need to be reraised for library-
1428 -- level finalizers. Generate:
1430 -- if Raised and then not Abort then
1431 -- Raise_From_Controlled_Operation (E);
1435 and then Exceptions_OK
1437 Append_To (Finalizer_Stmts,
1438 Build_Raise_Statement (Finalizer_Data));
1441 -- Create the jump block which controls the finalization flow
1442 -- depending on the value of the state counter.
1445 Make_Case_Statement (Loc,
1446 Expression => Make_Identifier (Loc, Chars (Counter_Id)),
1447 Alternatives => Jump_Alts);
1450 and then Present (Jump_Block_Insert_Nod)
1452 Insert_After (Jump_Block_Insert_Nod, Jump_Block);
1454 Prepend_To (Finalizer_Stmts, Jump_Block);
1458 -- Add the library-level tagged type unregistration machinery before
1459 -- the jump block circuitry. This ensures that external tags will be
1460 -- removed even if a finalization exception occurs at some point.
1462 if Has_Tagged_Types then
1463 Prepend_List_To (Finalizer_Stmts, Tagged_Type_Stmts);
1466 -- Add a call to the previous At_End handler if it exists. The call
1467 -- must always precede the jump block.
1469 if Present (Prev_At_End) then
1470 Prepend_To (Finalizer_Stmts,
1471 Make_Procedure_Call_Statement (Loc, Prev_At_End));
1473 -- Clear the At_End handler since we have already generated the
1474 -- proper replacement call for it.
1476 Set_At_End_Proc (HSS, Empty);
1479 -- Release the secondary stack mark
1481 if Present (Mark_Id) then
1482 Append_To (Finalizer_Stmts,
1483 Make_Procedure_Call_Statement (Loc,
1485 New_Reference_To (RTE (RE_SS_Release), Loc),
1486 Parameter_Associations => New_List (
1487 New_Reference_To (Mark_Id, Loc))));
1490 -- Protect the statements with abort defer/undefer. This is only when
1491 -- aborts are allowed and the clean up statements require deferral or
1492 -- there are controlled objects to be finalized.
1496 (Defer_Abort or else Has_Ctrl_Objs)
1498 Prepend_To (Finalizer_Stmts,
1499 Make_Procedure_Call_Statement (Loc,
1500 Name => New_Reference_To (RTE (RE_Abort_Defer), Loc)));
1502 Append_To (Finalizer_Stmts,
1503 Make_Procedure_Call_Statement (Loc,
1504 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc)));
1508 -- procedure Fin_Id is
1509 -- Abort : constant Boolean := Triggered_By_Abort;
1511 -- Abort : constant Boolean := False; -- no abort
1513 -- E : Exception_Occurrence; -- All added if flag
1514 -- Raised : Boolean := False; -- Has_Ctrl_Objs is set
1520 -- Abort_Defer; -- Added if abort is allowed
1521 -- <call to Prev_At_End> -- Added if exists
1522 -- <cleanup statements> -- Added if Acts_As_Clean
1523 -- <jump block> -- Added if Has_Ctrl_Objs
1524 -- <finalization statements> -- Added if Has_Ctrl_Objs
1525 -- <stack release> -- Added if Mark_Id exists
1526 -- Abort_Undefer; -- Added if abort is allowed
1529 -- Create the body of the finalizer
1531 Body_Id := Make_Defining_Identifier (Loc, Chars (Fin_Id));
1534 Set_Has_Qualified_Name (Body_Id);
1535 Set_Has_Fully_Qualified_Name (Body_Id);
1539 Make_Subprogram_Body (Loc,
1541 Make_Procedure_Specification (Loc,
1542 Defining_Unit_Name => Body_Id),
1544 Declarations => Finalizer_Decls,
1546 Handled_Statement_Sequence =>
1547 Make_Handled_Sequence_Of_Statements (Loc, Finalizer_Stmts));
1549 -- Step 4: Spec and body insertion, analysis
1553 -- If the package spec has private declarations, the finalizer
1554 -- body must be added to the end of the list in order to have
1555 -- visibility of all private controlled objects.
1557 if For_Package_Spec then
1558 if Present (Priv_Decls) then
1559 Append_To (Priv_Decls, Fin_Spec);
1560 Append_To (Priv_Decls, Fin_Body);
1562 Append_To (Decls, Fin_Spec);
1563 Append_To (Decls, Fin_Body);
1566 -- For package bodies, both the finalizer spec and body are
1567 -- inserted at the end of the package declarations.
1570 Append_To (Decls, Fin_Spec);
1571 Append_To (Decls, Fin_Body);
1574 -- Push the name of the package
1576 Push_Scope (Spec_Id);
1584 -- Create the spec for the finalizer. The At_End handler must be
1585 -- able to call the body which resides in a nested structure.
1589 -- procedure Fin_Id; -- Spec
1591 -- <objects and possibly statements>
1592 -- procedure Fin_Id is ... -- Body
1595 -- Fin_Id; -- At_End handler
1598 pragma Assert (Present (Spec_Decls));
1600 Append_To (Spec_Decls, Fin_Spec);
1603 -- When the finalizer acts solely as a clean up routine, the body
1604 -- is inserted right after the spec.
1607 and then not Has_Ctrl_Objs
1609 Insert_After (Fin_Spec, Fin_Body);
1611 -- In all other cases the body is inserted after either:
1613 -- 1) The counter update statement of the last controlled object
1614 -- 2) The last top level nested controlled package
1615 -- 3) The last top level controlled instantiation
1618 -- Manually freeze the spec. This is somewhat of a hack because
1619 -- a subprogram is frozen when its body is seen and the freeze
1620 -- node appears right before the body. However, in this case,
1621 -- the spec must be frozen earlier since the At_End handler
1622 -- must be able to call it.
1625 -- procedure Fin_Id; -- Spec
1626 -- [Fin_Id] -- Freeze node
1630 -- Fin_Id; -- At_End handler
1633 Ensure_Freeze_Node (Fin_Id);
1634 Insert_After (Fin_Spec, Freeze_Node (Fin_Id));
1635 Set_Is_Frozen (Fin_Id);
1637 -- In the case where the last construct to contain a controlled
1638 -- object is either a nested package, an instantiation or a
1639 -- freeze node, the body must be inserted directly after the
1642 if Nkind_In (Last_Top_Level_Ctrl_Construct,
1644 N_Package_Declaration,
1647 Finalizer_Insert_Nod := Last_Top_Level_Ctrl_Construct;
1650 Insert_After (Finalizer_Insert_Nod, Fin_Body);
1655 end Create_Finalizer;
1657 --------------------------
1658 -- Process_Declarations --
1659 --------------------------
1661 procedure Process_Declarations
1663 Preprocess : Boolean := False;
1664 Top_Level : Boolean := False)
1669 Obj_Typ : Entity_Id;
1670 Pack_Id : Entity_Id;
1674 Old_Counter_Val : Int;
1675 -- This variable is used to determine whether a nested package or
1676 -- instance contains at least one controlled object.
1678 procedure Processing_Actions
1679 (Has_No_Init : Boolean := False;
1680 Is_Protected : Boolean := False);
1681 -- Depending on the mode of operation of Process_Declarations, either
1682 -- increment the controlled object counter, set the controlled object
1683 -- flag and store the last top level construct or process the current
1684 -- declaration. Flag Has_No_Init is used to propagate scenarios where
1685 -- the current declaration may not have initialization proc(s). Flag
1686 -- Is_Protected should be set when the current declaration denotes a
1687 -- simple protected object.
1689 ------------------------
1690 -- Processing_Actions --
1691 ------------------------
1693 procedure Processing_Actions
1694 (Has_No_Init : Boolean := False;
1695 Is_Protected : Boolean := False)
1698 -- Library-level tagged type
1700 if Nkind (Decl) = N_Full_Type_Declaration then
1702 Has_Tagged_Types := True;
1705 and then No (Last_Top_Level_Ctrl_Construct)
1707 Last_Top_Level_Ctrl_Construct := Decl;
1711 Process_Tagged_Type_Declaration (Decl);
1714 -- Controlled object declaration
1718 Counter_Val := Counter_Val + 1;
1719 Has_Ctrl_Objs := True;
1722 and then No (Last_Top_Level_Ctrl_Construct)
1724 Last_Top_Level_Ctrl_Construct := Decl;
1728 Process_Object_Declaration (Decl, Has_No_Init, Is_Protected);
1731 end Processing_Actions;
1733 -- Start of processing for Process_Declarations
1736 if No (Decls) or else Is_Empty_List (Decls) then
1740 -- Process all declarations in reverse order
1742 Decl := Last_Non_Pragma (Decls);
1743 while Present (Decl) loop
1745 -- Library-level tagged types
1747 if Nkind (Decl) = N_Full_Type_Declaration then
1748 Typ := Defining_Identifier (Decl);
1750 if Is_Tagged_Type (Typ)
1751 and then Is_Library_Level_Entity (Typ)
1752 and then Convention (Typ) = Convention_Ada
1753 and then Present (Access_Disp_Table (Typ))
1754 and then RTE_Available (RE_Register_Tag)
1755 and then not No_Run_Time_Mode
1756 and then not Is_Abstract_Type (Typ)
1761 -- Regular object declarations
1763 elsif Nkind (Decl) = N_Object_Declaration then
1764 Obj_Id := Defining_Identifier (Decl);
1765 Obj_Typ := Base_Type (Etype (Obj_Id));
1766 Expr := Expression (Decl);
1768 -- Bypass any form of processing for objects which have their
1769 -- finalization disabled. This applies only to objects at the
1773 and then Finalize_Storage_Only (Obj_Typ)
1777 -- Transient variables are treated separately in order to
1778 -- minimize the size of the generated code. See Process_
1779 -- Transient_Objects.
1781 elsif Is_Processed_Transient (Obj_Id) then
1784 -- The object is of the form:
1785 -- Obj : Typ [:= Expr];
1787 -- Do not process the incomplete view of a deferred constant.
1788 -- Do not consider tag-to-class-wide conversions.
1790 elsif not Is_Imported (Obj_Id)
1791 and then Needs_Finalization (Obj_Typ)
1792 and then not (Ekind (Obj_Id) = E_Constant
1793 and then not Has_Completion (Obj_Id))
1794 and then not Is_Tag_To_CW_Conversion (Obj_Id)
1798 -- The object is of the form:
1799 -- Obj : Access_Typ := Non_BIP_Function_Call'reference;
1801 -- Obj : Access_Typ :=
1802 -- BIP_Function_Call
1803 -- (..., BIPaccess => null, ...)'reference;
1805 elsif Is_Access_Type (Obj_Typ)
1806 and then Needs_Finalization
1807 (Available_View (Designated_Type (Obj_Typ)))
1808 and then Present (Expr)
1810 (Is_Null_Access_BIP_Func_Call (Expr)
1811 or else (Is_Non_BIP_Func_Call (Expr)
1813 Is_Related_To_Func_Return (Obj_Id)))
1815 Processing_Actions (Has_No_Init => True);
1817 -- Processing for "hook" objects generated for controlled
1818 -- transients declared inside an Expression_With_Actions.
1820 elsif Is_Access_Type (Obj_Typ)
1821 and then Present (Return_Flag_Or_Transient_Decl (Obj_Id))
1822 and then Nkind (Return_Flag_Or_Transient_Decl (Obj_Id)) =
1823 N_Object_Declaration
1824 and then Is_Finalizable_Transient
1825 (Return_Flag_Or_Transient_Decl (Obj_Id), Decl)
1827 Processing_Actions (Has_No_Init => True);
1829 -- Simple protected objects which use type System.Tasking.
1830 -- Protected_Objects.Protection to manage their locks should
1831 -- be treated as controlled since they require manual cleanup.
1832 -- The only exception is illustrated in the following example:
1835 -- type Ctrl is new Controlled ...
1836 -- procedure Finalize (Obj : in out Ctrl);
1840 -- package body Pkg is
1841 -- protected Prot is
1842 -- procedure Do_Something (Obj : in out Ctrl);
1845 -- protected body Prot is
1846 -- procedure Do_Something (Obj : in out Ctrl) is ...
1849 -- procedure Finalize (Obj : in out Ctrl) is
1851 -- Prot.Do_Something (Obj);
1855 -- Since for the most part entities in package bodies depend on
1856 -- those in package specs, Prot's lock should be cleaned up
1857 -- first. The subsequent cleanup of the spec finalizes Lib_Obj.
1858 -- This act however attempts to invoke Do_Something and fails
1859 -- because the lock has disappeared.
1861 elsif Ekind (Obj_Id) = E_Variable
1862 and then not In_Library_Level_Package_Body (Obj_Id)
1864 (Is_Simple_Protected_Type (Obj_Typ)
1865 or else Has_Simple_Protected_Object (Obj_Typ))
1867 Processing_Actions (Is_Protected => True);
1870 -- Specific cases of object renamings
1872 elsif Nkind (Decl) = N_Object_Renaming_Declaration
1873 and then Nkind (Name (Decl)) = N_Explicit_Dereference
1874 and then Nkind (Prefix (Name (Decl))) = N_Identifier
1876 Obj_Id := Defining_Identifier (Decl);
1877 Obj_Typ := Base_Type (Etype (Obj_Id));
1879 -- Bypass any form of processing for objects which have their
1880 -- finalization disabled. This applies only to objects at the
1884 and then Finalize_Storage_Only (Obj_Typ)
1888 -- Return object of a build-in-place function. This case is
1889 -- recognized and marked by the expansion of an extended return
1890 -- statement (see Expand_N_Extended_Return_Statement).
1892 elsif Needs_Finalization (Obj_Typ)
1893 and then Is_Return_Object (Obj_Id)
1894 and then Present (Return_Flag_Or_Transient_Decl (Obj_Id))
1896 Processing_Actions (Has_No_Init => True);
1899 -- Inspect the freeze node of an access-to-controlled type and
1900 -- look for a delayed finalization master. This case arises when
1901 -- the freeze actions are inserted at a later time than the
1902 -- expansion of the context. Since Build_Finalizer is never called
1903 -- on a single construct twice, the master will be ultimately
1904 -- left out and never finalized. This is also needed for freeze
1905 -- actions of designated types themselves, since in some cases the
1906 -- finalization master is associated with a designated type's
1907 -- freeze node rather than that of the access type (see handling
1908 -- for freeze actions in Build_Finalization_Master).
1910 elsif Nkind (Decl) = N_Freeze_Entity
1911 and then Present (Actions (Decl))
1913 Typ := Entity (Decl);
1915 if (Is_Access_Type (Typ)
1916 and then not Is_Access_Subprogram_Type (Typ)
1917 and then Needs_Finalization
1918 (Available_View (Designated_Type (Typ))))
1919 or else (Is_Type (Typ) and then Needs_Finalization (Typ))
1921 Old_Counter_Val := Counter_Val;
1923 -- Freeze nodes are considered to be identical to packages
1924 -- and blocks in terms of nesting. The difference is that
1925 -- a finalization master created inside the freeze node is
1926 -- at the same nesting level as the node itself.
1928 Process_Declarations (Actions (Decl), Preprocess);
1930 -- The freeze node contains a finalization master
1934 and then No (Last_Top_Level_Ctrl_Construct)
1935 and then Counter_Val > Old_Counter_Val
1937 Last_Top_Level_Ctrl_Construct := Decl;
1941 -- Nested package declarations, avoid generics
1943 elsif Nkind (Decl) = N_Package_Declaration then
1944 Spec := Specification (Decl);
1945 Pack_Id := Defining_Unit_Name (Spec);
1947 if Nkind (Pack_Id) = N_Defining_Program_Unit_Name then
1948 Pack_Id := Defining_Identifier (Pack_Id);
1951 if Ekind (Pack_Id) /= E_Generic_Package then
1952 Old_Counter_Val := Counter_Val;
1953 Process_Declarations
1954 (Private_Declarations (Spec), Preprocess);
1955 Process_Declarations
1956 (Visible_Declarations (Spec), Preprocess);
1958 -- Either the visible or the private declarations contain a
1959 -- controlled object. The nested package declaration is the
1960 -- last such construct.
1964 and then No (Last_Top_Level_Ctrl_Construct)
1965 and then Counter_Val > Old_Counter_Val
1967 Last_Top_Level_Ctrl_Construct := Decl;
1971 -- Nested package bodies, avoid generics
1973 elsif Nkind (Decl) = N_Package_Body then
1974 Spec := Corresponding_Spec (Decl);
1976 if Ekind (Spec) /= E_Generic_Package then
1977 Old_Counter_Val := Counter_Val;
1978 Process_Declarations (Declarations (Decl), Preprocess);
1980 -- The nested package body is the last construct to contain
1981 -- a controlled object.
1985 and then No (Last_Top_Level_Ctrl_Construct)
1986 and then Counter_Val > Old_Counter_Val
1988 Last_Top_Level_Ctrl_Construct := Decl;
1992 -- Handle a rare case caused by a controlled transient variable
1993 -- created as part of a record init proc. The variable is wrapped
1994 -- in a block, but the block is not associated with a transient
1997 elsif Nkind (Decl) = N_Block_Statement
1998 and then Inside_Init_Proc
2000 Old_Counter_Val := Counter_Val;
2002 if Present (Handled_Statement_Sequence (Decl)) then
2003 Process_Declarations
2004 (Statements (Handled_Statement_Sequence (Decl)),
2008 Process_Declarations (Declarations (Decl), Preprocess);
2010 -- Either the declaration or statement list of the block has a
2011 -- controlled object.
2015 and then No (Last_Top_Level_Ctrl_Construct)
2016 and then Counter_Val > Old_Counter_Val
2018 Last_Top_Level_Ctrl_Construct := Decl;
2022 Prev_Non_Pragma (Decl);
2024 end Process_Declarations;
2026 --------------------------------
2027 -- Process_Object_Declaration --
2028 --------------------------------
2030 procedure Process_Object_Declaration
2032 Has_No_Init : Boolean := False;
2033 Is_Protected : Boolean := False)
2035 Obj_Id : constant Entity_Id := Defining_Identifier (Decl);
2036 Loc : constant Source_Ptr := Sloc (Decl);
2038 Count_Ins : Node_Id;
2040 Fin_Stmts : List_Id;
2043 Label_Id : Entity_Id;
2045 Obj_Typ : Entity_Id;
2047 function Build_BIP_Cleanup_Stmts (Func_Id : Entity_Id) return Node_Id;
2048 -- Once it has been established that the current object is in fact a
2049 -- return object of build-in-place function Func_Id, generate the
2050 -- following cleanup code:
2052 -- if BIPallocfrom > Secondary_Stack'Pos
2053 -- and then BIPfinalizationmaster /= null
2056 -- type Ptr_Typ is access Obj_Typ;
2057 -- for Ptr_Typ'Storage_Pool
2058 -- use Base_Pool (BIPfinalizationmaster);
2061 -- Free (Ptr_Typ (Temp));
2065 -- Obj_Typ is the type of the current object, Temp is the original
2066 -- allocation which Obj_Id renames.
2068 procedure Find_Last_Init
2071 Last_Init : out Node_Id;
2072 Body_Insert : out Node_Id);
2073 -- An object declaration has at least one and at most two init calls:
2074 -- that of the type and the user-defined initialize. Given an object
2075 -- declaration, Last_Init denotes the last initialization call which
2076 -- follows the declaration. Body_Insert denotes the place where the
2077 -- finalizer body could be potentially inserted.
2079 -----------------------------
2080 -- Build_BIP_Cleanup_Stmts --
2081 -----------------------------
2083 function Build_BIP_Cleanup_Stmts
2084 (Func_Id : Entity_Id) return Node_Id
2086 Decls : constant List_Id := New_List;
2087 Fin_Mas_Id : constant Entity_Id :=
2088 Build_In_Place_Formal
2089 (Func_Id, BIP_Finalization_Master);
2090 Obj_Typ : constant Entity_Id := Etype (Func_Id);
2091 Temp_Id : constant Entity_Id :=
2092 Entity (Prefix (Name (Parent (Obj_Id))));
2096 Free_Stmt : Node_Id;
2097 Pool_Id : Entity_Id;
2098 Ptr_Typ : Entity_Id;
2102 -- Pool_Id renames Base_Pool (BIPfinalizationmaster.all).all;
2104 Pool_Id := Make_Temporary (Loc, 'P');
2107 Make_Object_Renaming_Declaration (Loc,
2108 Defining_Identifier => Pool_Id,
2110 New_Reference_To (RTE (RE_Root_Storage_Pool), Loc),
2112 Make_Explicit_Dereference (Loc,
2114 Make_Function_Call (Loc,
2116 New_Reference_To (RTE (RE_Base_Pool), Loc),
2117 Parameter_Associations => New_List (
2118 Make_Explicit_Dereference (Loc,
2119 Prefix => New_Reference_To (Fin_Mas_Id, Loc)))))));
2121 -- Create an access type which uses the storage pool of the
2122 -- caller's finalization master.
2125 -- type Ptr_Typ is access Obj_Typ;
2127 Ptr_Typ := Make_Temporary (Loc, 'P');
2130 Make_Full_Type_Declaration (Loc,
2131 Defining_Identifier => Ptr_Typ,
2133 Make_Access_To_Object_Definition (Loc,
2134 Subtype_Indication => New_Reference_To (Obj_Typ, Loc))));
2136 -- Perform minor decoration in order to set the master and the
2137 -- storage pool attributes.
2139 Set_Ekind (Ptr_Typ, E_Access_Type);
2140 Set_Finalization_Master (Ptr_Typ, Fin_Mas_Id);
2141 Set_Associated_Storage_Pool (Ptr_Typ, Pool_Id);
2143 -- Create an explicit free statement. Note that the free uses the
2144 -- caller's pool expressed as a renaming.
2147 Make_Free_Statement (Loc,
2149 Unchecked_Convert_To (Ptr_Typ,
2150 New_Reference_To (Temp_Id, Loc)));
2152 Set_Storage_Pool (Free_Stmt, Pool_Id);
2154 -- Create a block to house the dummy type and the instantiation as
2155 -- well as to perform the cleanup the temporary.
2161 -- Free (Ptr_Typ (Temp_Id));
2165 Make_Block_Statement (Loc,
2166 Declarations => Decls,
2167 Handled_Statement_Sequence =>
2168 Make_Handled_Sequence_Of_Statements (Loc,
2169 Statements => New_List (Free_Stmt)));
2172 -- if BIPfinalizationmaster /= null then
2176 Left_Opnd => New_Reference_To (Fin_Mas_Id, Loc),
2177 Right_Opnd => Make_Null (Loc));
2179 -- For constrained or tagged results escalate the condition to
2180 -- include the allocation format. Generate:
2182 -- if BIPallocform > Secondary_Stack'Pos
2183 -- and then BIPfinalizationmaster /= null
2186 if not Is_Constrained (Obj_Typ)
2187 or else Is_Tagged_Type (Obj_Typ)
2190 Alloc : constant Entity_Id :=
2191 Build_In_Place_Formal (Func_Id, BIP_Alloc_Form);
2197 Left_Opnd => New_Reference_To (Alloc, Loc),
2199 Make_Integer_Literal (Loc,
2201 (BIP_Allocation_Form'Pos (Secondary_Stack)))),
2203 Right_Opnd => Cond);
2213 Make_If_Statement (Loc,
2215 Then_Statements => New_List (Free_Blk));
2216 end Build_BIP_Cleanup_Stmts;
2218 --------------------
2219 -- Find_Last_Init --
2220 --------------------
2222 procedure Find_Last_Init
2225 Last_Init : out Node_Id;
2226 Body_Insert : out Node_Id)
2228 Nod_1 : Node_Id := Empty;
2229 Nod_2 : Node_Id := Empty;
2232 function Is_Init_Call
2234 Typ : Entity_Id) return Boolean;
2235 -- Given an arbitrary node, determine whether N is a procedure
2236 -- call and if it is, try to match the name of the call with the
2237 -- [Deep_]Initialize proc of Typ.
2239 function Next_Suitable_Statement (Stmt : Node_Id) return Node_Id;
2240 -- Given a statement which is part of a list, return the next
2241 -- real statement while skipping over dynamic elab checks.
2247 function Is_Init_Call
2249 Typ : Entity_Id) return Boolean
2252 -- A call to [Deep_]Initialize is always direct
2254 if Nkind (N) = N_Procedure_Call_Statement
2255 and then Nkind (Name (N)) = N_Identifier
2258 Call_Ent : constant Entity_Id := Entity (Name (N));
2259 Deep_Init : constant Entity_Id :=
2260 TSS (Typ, TSS_Deep_Initialize);
2261 Init : Entity_Id := Empty;
2264 -- A type may have controlled components but not be
2267 if Is_Controlled (Typ) then
2268 Init := Find_Prim_Op (Typ, Name_Initialize);
2270 if Present (Init) then
2271 Init := Ultimate_Alias (Init);
2276 (Present (Deep_Init)
2277 and then Call_Ent = Deep_Init)
2280 and then Call_Ent = Init);
2287 -----------------------------
2288 -- Next_Suitable_Statement --
2289 -----------------------------
2291 function Next_Suitable_Statement (Stmt : Node_Id) return Node_Id is
2292 Result : Node_Id := Next (Stmt);
2295 -- Skip over access-before-elaboration checks
2297 if Dynamic_Elaboration_Checks
2298 and then Nkind (Result) = N_Raise_Program_Error
2300 Result := Next (Result);
2304 end Next_Suitable_Statement;
2306 -- Start of processing for Find_Last_Init
2310 Body_Insert := Empty;
2312 -- Object renamings and objects associated with controlled
2313 -- function results do not have initialization calls.
2319 if Is_Concurrent_Type (Typ) then
2320 Utyp := Corresponding_Record_Type (Typ);
2325 if Is_Private_Type (Utyp)
2326 and then Present (Full_View (Utyp))
2328 Utyp := Full_View (Utyp);
2331 -- The init procedures are arranged as follows:
2333 -- Object : Controlled_Type;
2334 -- Controlled_TypeIP (Object);
2335 -- [[Deep_]Initialize (Object);]
2337 -- where the user-defined initialize may be optional or may appear
2338 -- inside a block when abort deferral is needed.
2340 Nod_1 := Next_Suitable_Statement (Decl);
2341 if Present (Nod_1) then
2342 Nod_2 := Next_Suitable_Statement (Nod_1);
2344 -- The statement following an object declaration is always a
2345 -- call to the type init proc.
2350 -- Optional user-defined init or deep init processing
2352 if Present (Nod_2) then
2354 -- The statement following the type init proc may be a block
2355 -- statement in cases where abort deferral is required.
2357 if Nkind (Nod_2) = N_Block_Statement then
2359 HSS : constant Node_Id :=
2360 Handled_Statement_Sequence (Nod_2);
2365 and then Present (Statements (HSS))
2367 Stmt := First (Statements (HSS));
2369 -- Examine individual block statements and locate the
2370 -- call to [Deep_]Initialze.
2372 while Present (Stmt) loop
2373 if Is_Init_Call (Stmt, Utyp) then
2375 Body_Insert := Nod_2;
2385 elsif Is_Init_Call (Nod_2, Utyp) then
2391 -- Start of processing for Process_Object_Declaration
2394 Obj_Ref := New_Reference_To (Obj_Id, Loc);
2395 Obj_Typ := Base_Type (Etype (Obj_Id));
2397 -- Handle access types
2399 if Is_Access_Type (Obj_Typ) then
2400 Obj_Ref := Make_Explicit_Dereference (Loc, Obj_Ref);
2401 Obj_Typ := Directly_Designated_Type (Obj_Typ);
2404 Set_Etype (Obj_Ref, Obj_Typ);
2406 -- Set a new value for the state counter and insert the statement
2407 -- after the object declaration. Generate:
2409 -- Counter := <value>;
2412 Make_Assignment_Statement (Loc,
2413 Name => New_Reference_To (Counter_Id, Loc),
2414 Expression => Make_Integer_Literal (Loc, Counter_Val));
2416 -- Insert the counter after all initialization has been done. The
2417 -- place of insertion depends on the context. When dealing with a
2418 -- controlled function, the counter is inserted directly after the
2419 -- declaration because such objects lack init calls.
2421 Find_Last_Init (Decl, Obj_Typ, Count_Ins, Body_Ins);
2423 Insert_After (Count_Ins, Inc_Decl);
2426 -- If the current declaration is the last in the list, the finalizer
2427 -- body needs to be inserted after the set counter statement for the
2428 -- current object declaration. This is complicated by the fact that
2429 -- the set counter statement may appear in abort deferred block. In
2430 -- that case, the proper insertion place is after the block.
2432 if No (Finalizer_Insert_Nod) then
2434 -- Insertion after an abort deffered block
2436 if Present (Body_Ins) then
2437 Finalizer_Insert_Nod := Body_Ins;
2439 Finalizer_Insert_Nod := Inc_Decl;
2443 -- Create the associated label with this object, generate:
2445 -- L<counter> : label;
2448 Make_Identifier (Loc, New_External_Name ('L', Counter_Val));
2449 Set_Entity (Label_Id,
2450 Make_Defining_Identifier (Loc, Chars (Label_Id)));
2451 Label := Make_Label (Loc, Label_Id);
2453 Prepend_To (Finalizer_Decls,
2454 Make_Implicit_Label_Declaration (Loc,
2455 Defining_Identifier => Entity (Label_Id),
2456 Label_Construct => Label));
2458 -- Create the associated jump with this object, generate:
2460 -- when <counter> =>
2463 Prepend_To (Jump_Alts,
2464 Make_Case_Statement_Alternative (Loc,
2465 Discrete_Choices => New_List (
2466 Make_Integer_Literal (Loc, Counter_Val)),
2467 Statements => New_List (
2468 Make_Goto_Statement (Loc,
2469 Name => New_Reference_To (Entity (Label_Id), Loc)))));
2471 -- Insert the jump destination, generate:
2475 Append_To (Finalizer_Stmts, Label);
2477 -- Processing for simple protected objects. Such objects require
2478 -- manual finalization of their lock managers.
2480 if Is_Protected then
2481 Fin_Stmts := No_List;
2483 if Is_Simple_Protected_Type (Obj_Typ) then
2484 Fin_Call := Cleanup_Protected_Object (Decl, Obj_Ref);
2485 if Present (Fin_Call) then
2486 Fin_Stmts := New_List (Fin_Call);
2489 elsif Has_Simple_Protected_Object (Obj_Typ) then
2490 if Is_Record_Type (Obj_Typ) then
2491 Fin_Stmts := Cleanup_Record (Decl, Obj_Ref, Obj_Typ);
2493 elsif Is_Array_Type (Obj_Typ) then
2494 Fin_Stmts := Cleanup_Array (Decl, Obj_Ref, Obj_Typ);
2500 -- System.Tasking.Protected_Objects.Finalize_Protection
2508 if Present (Fin_Stmts) then
2509 Append_To (Finalizer_Stmts,
2510 Make_Block_Statement (Loc,
2511 Handled_Statement_Sequence =>
2512 Make_Handled_Sequence_Of_Statements (Loc,
2513 Statements => Fin_Stmts,
2515 Exception_Handlers => New_List (
2516 Make_Exception_Handler (Loc,
2517 Exception_Choices => New_List (
2518 Make_Others_Choice (Loc)),
2520 Statements => New_List (
2521 Make_Null_Statement (Loc)))))));
2524 -- Processing for regular controlled objects
2528 -- [Deep_]Finalize (Obj); -- No_Exception_Propagation
2530 -- begin -- Exception handlers allowed
2531 -- [Deep_]Finalize (Obj);
2534 -- when Id : others =>
2535 -- if not Raised then
2537 -- Save_Occurrence (E, Id);
2546 if Exceptions_OK then
2547 Fin_Stmts := New_List (
2548 Make_Block_Statement (Loc,
2549 Handled_Statement_Sequence =>
2550 Make_Handled_Sequence_Of_Statements (Loc,
2551 Statements => New_List (Fin_Call),
2553 Exception_Handlers => New_List (
2554 Build_Exception_Handler
2555 (Finalizer_Data, For_Package)))));
2557 -- When exception handlers are prohibited, the finalization call
2558 -- appears unprotected. Any exception raised during finalization
2559 -- will bypass the circuitry which ensures the cleanup of all
2560 -- remaining objects.
2563 Fin_Stmts := New_List (Fin_Call);
2566 -- If we are dealing with a return object of a build-in-place
2567 -- function, generate the following cleanup statements:
2569 -- if BIPallocfrom > Secondary_Stack'Pos
2570 -- and then BIPfinalizationmaster /= null
2573 -- type Ptr_Typ is access Obj_Typ;
2574 -- for Ptr_Typ'Storage_Pool use
2575 -- Base_Pool (BIPfinalizationmaster.all).all;
2578 -- Free (Ptr_Typ (Temp));
2582 -- The generated code effectively detaches the temporary from the
2583 -- caller finalization master and deallocates the object. This is
2584 -- disabled on .NET/JVM because pools are not supported.
2586 if VM_Target = No_VM and then Is_Return_Object (Obj_Id) then
2588 Func_Id : constant Entity_Id := Enclosing_Function (Obj_Id);
2590 if Is_Build_In_Place_Function (Func_Id)
2591 and then Needs_BIP_Finalization_Master (Func_Id)
2593 Append_To (Fin_Stmts, Build_BIP_Cleanup_Stmts (Func_Id));
2598 if Ekind_In (Obj_Id, E_Constant, E_Variable)
2599 and then Present (Return_Flag_Or_Transient_Decl (Obj_Id))
2601 -- Return objects use a flag to aid their potential
2602 -- finalization when the enclosing function fails to return
2603 -- properly. Generate:
2606 -- <object finalization statements>
2609 if Is_Return_Object (Obj_Id) then
2610 Fin_Stmts := New_List (
2611 Make_If_Statement (Loc,
2616 (Return_Flag_Or_Transient_Decl (Obj_Id), Loc)),
2618 Then_Statements => Fin_Stmts));
2620 -- Temporaries created for the purpose of "exporting" a
2621 -- controlled transient out of an Expression_With_Actions (EWA)
2622 -- need guards. The following illustrates the usage of such
2625 -- Access_Typ : access [all] Obj_Typ;
2626 -- Temp : Access_Typ := null;
2627 -- <Counter> := ...;
2630 -- Ctrl_Trans : [access [all]] Obj_Typ := ...;
2631 -- Temp := Access_Typ (Ctrl_Trans); -- when a pointer
2633 -- Temp := Ctrl_Trans'Unchecked_Access;
2636 -- The finalization machinery does not process EWA nodes as
2637 -- this may lead to premature finalization of expressions. Note
2638 -- that Temp is marked as being properly initialized regardless
2639 -- of whether the initialization of Ctrl_Trans succeeded. Since
2640 -- a failed initialization may leave Temp with a value of null,
2641 -- add a guard to handle this case:
2643 -- if Obj /= null then
2644 -- <object finalization statements>
2649 (Nkind (Return_Flag_Or_Transient_Decl (Obj_Id)) =
2650 N_Object_Declaration);
2652 Fin_Stmts := New_List (
2653 Make_If_Statement (Loc,
2656 Left_Opnd => New_Reference_To (Obj_Id, Loc),
2657 Right_Opnd => Make_Null (Loc)),
2659 Then_Statements => Fin_Stmts));
2664 Append_List_To (Finalizer_Stmts, Fin_Stmts);
2666 -- Since the declarations are examined in reverse, the state counter
2667 -- must be decremented in order to keep with the true position of
2670 Counter_Val := Counter_Val - 1;
2671 end Process_Object_Declaration;
2673 -------------------------------------
2674 -- Process_Tagged_Type_Declaration --
2675 -------------------------------------
2677 procedure Process_Tagged_Type_Declaration (Decl : Node_Id) is
2678 Typ : constant Entity_Id := Defining_Identifier (Decl);
2679 DT_Ptr : constant Entity_Id :=
2680 Node (First_Elmt (Access_Disp_Table (Typ)));
2683 -- Ada.Tags.Unregister_Tag (<Typ>P);
2685 Append_To (Tagged_Type_Stmts,
2686 Make_Procedure_Call_Statement (Loc,
2688 New_Reference_To (RTE (RE_Unregister_Tag), Loc),
2689 Parameter_Associations => New_List (
2690 New_Reference_To (DT_Ptr, Loc))));
2691 end Process_Tagged_Type_Declaration;
2693 -- Start of processing for Build_Finalizer
2698 -- Do not perform this expansion in Alfa mode because it is not
2705 -- Step 1: Extract all lists which may contain controlled objects or
2706 -- library-level tagged types.
2708 if For_Package_Spec then
2709 Decls := Visible_Declarations (Specification (N));
2710 Priv_Decls := Private_Declarations (Specification (N));
2712 -- Retrieve the package spec id
2714 Spec_Id := Defining_Unit_Name (Specification (N));
2716 if Nkind (Spec_Id) = N_Defining_Program_Unit_Name then
2717 Spec_Id := Defining_Identifier (Spec_Id);
2720 -- Accept statement, block, entry body, package body, protected body,
2721 -- subprogram body or task body.
2724 Decls := Declarations (N);
2725 HSS := Handled_Statement_Sequence (N);
2727 if Present (HSS) then
2728 if Present (Statements (HSS)) then
2729 Stmts := Statements (HSS);
2732 if Present (At_End_Proc (HSS)) then
2733 Prev_At_End := At_End_Proc (HSS);
2737 -- Retrieve the package spec id for package bodies
2739 if For_Package_Body then
2740 Spec_Id := Corresponding_Spec (N);
2744 -- Do not process nested packages since those are handled by the
2745 -- enclosing scope's finalizer. Do not process non-expanded package
2746 -- instantiations since those will be re-analyzed and re-expanded.
2750 (not Is_Library_Level_Entity (Spec_Id)
2752 -- Nested packages are considered to be library level entities,
2753 -- but do not need to be processed separately. True library level
2754 -- packages have a scope value of 1.
2756 or else Scope_Depth_Value (Spec_Id) /= Uint_1
2757 or else (Is_Generic_Instance (Spec_Id)
2758 and then Package_Instantiation (Spec_Id) /= N))
2763 -- Step 2: Object [pre]processing
2767 -- Preprocess the visible declarations now in order to obtain the
2768 -- correct number of controlled object by the time the private
2769 -- declarations are processed.
2771 Process_Declarations (Decls, Preprocess => True, Top_Level => True);
2773 -- From all the possible contexts, only package specifications may
2774 -- have private declarations.
2776 if For_Package_Spec then
2777 Process_Declarations
2778 (Priv_Decls, Preprocess => True, Top_Level => True);
2781 -- The current context may lack controlled objects, but require some
2782 -- other form of completion (task termination for instance). In such
2783 -- cases, the finalizer must be created and carry the additional
2786 if Acts_As_Clean or Has_Ctrl_Objs or Has_Tagged_Types then
2790 -- The preprocessing has determined that the context has controlled
2791 -- objects or library-level tagged types.
2793 if Has_Ctrl_Objs or Has_Tagged_Types then
2795 -- Private declarations are processed first in order to preserve
2796 -- possible dependencies between public and private objects.
2798 if For_Package_Spec then
2799 Process_Declarations (Priv_Decls);
2802 Process_Declarations (Decls);
2808 -- Preprocess both declarations and statements
2810 Process_Declarations (Decls, Preprocess => True, Top_Level => True);
2811 Process_Declarations (Stmts, Preprocess => True, Top_Level => True);
2813 -- At this point it is known that N has controlled objects. Ensure
2814 -- that N has a declarative list since the finalizer spec will be
2817 if Has_Ctrl_Objs and then No (Decls) then
2818 Set_Declarations (N, New_List);
2819 Decls := Declarations (N);
2820 Spec_Decls := Decls;
2823 -- The current context may lack controlled objects, but require some
2824 -- other form of completion (task termination for instance). In such
2825 -- cases, the finalizer must be created and carry the additional
2828 if Acts_As_Clean or Has_Ctrl_Objs or Has_Tagged_Types then
2832 if Has_Ctrl_Objs or Has_Tagged_Types then
2833 Process_Declarations (Stmts);
2834 Process_Declarations (Decls);
2838 -- Step 3: Finalizer creation
2840 if Acts_As_Clean or Has_Ctrl_Objs or Has_Tagged_Types then
2843 end Build_Finalizer;
2845 --------------------------
2846 -- Build_Finalizer_Call --
2847 --------------------------
2849 procedure Build_Finalizer_Call (N : Node_Id; Fin_Id : Entity_Id) is
2850 Loc : constant Source_Ptr := Sloc (N);
2851 HSS : Node_Id := Handled_Statement_Sequence (N);
2853 Is_Prot_Body : constant Boolean :=
2854 Nkind (N) = N_Subprogram_Body
2855 and then Is_Protected_Subprogram_Body (N);
2856 -- Determine whether N denotes the protected version of a subprogram
2857 -- which belongs to a protected type.
2860 -- Do not perform this expansion in Alfa mode because we do not create
2861 -- finalizers in the first place.
2867 -- The At_End handler should have been assimilated by the finalizer
2869 pragma Assert (No (At_End_Proc (HSS)));
2871 -- If the construct to be cleaned up is a protected subprogram body, the
2872 -- finalizer call needs to be associated with the block which wraps the
2873 -- unprotected version of the subprogram. The following illustrates this
2876 -- procedure Prot_SubpP is
2877 -- procedure finalizer is
2879 -- Service_Entries (Prot_Obj);
2886 -- Prot_SubpN (Prot_Obj);
2892 if Is_Prot_Body then
2893 HSS := Handled_Statement_Sequence (Last (Statements (HSS)));
2895 -- An At_End handler and regular exception handlers cannot coexist in
2896 -- the same statement sequence. Wrap the original statements in a block.
2898 elsif Present (Exception_Handlers (HSS)) then
2900 End_Lab : constant Node_Id := End_Label (HSS);
2905 Make_Block_Statement (Loc, Handled_Statement_Sequence => HSS);
2907 Set_Handled_Statement_Sequence (N,
2908 Make_Handled_Sequence_Of_Statements (Loc, New_List (Block)));
2910 HSS := Handled_Statement_Sequence (N);
2911 Set_End_Label (HSS, End_Lab);
2915 Set_At_End_Proc (HSS, New_Reference_To (Fin_Id, Loc));
2917 Analyze (At_End_Proc (HSS));
2918 Expand_At_End_Handler (HSS, Empty);
2919 end Build_Finalizer_Call;
2921 ---------------------
2922 -- Build_Late_Proc --
2923 ---------------------
2925 procedure Build_Late_Proc (Typ : Entity_Id; Nam : Name_Id) is
2927 for Final_Prim in Name_Of'Range loop
2928 if Name_Of (Final_Prim) = Nam then
2931 (Prim => Final_Prim,
2933 Stmts => Make_Deep_Record_Body (Final_Prim, Typ)));
2936 end Build_Late_Proc;
2938 -------------------------------
2939 -- Build_Object_Declarations --
2940 -------------------------------
2942 procedure Build_Object_Declarations
2943 (Data : out Finalization_Exception_Data;
2946 For_Package : Boolean := False)
2952 pragma Assert (Decls /= No_List);
2954 if Restriction_Active (No_Exception_Propagation) then
2955 Data.Abort_Id := Empty;
2957 Data.Raised_Id := Empty;
2961 Data.Abort_Id := Make_Temporary (Loc, 'A');
2962 Data.E_Id := Make_Temporary (Loc, 'E');
2963 Data.Raised_Id := Make_Temporary (Loc, 'R');
2966 -- In certain scenarios, finalization can be triggered by an abort. If
2967 -- the finalization itself fails and raises an exception, the resulting
2968 -- Program_Error must be supressed and replaced by an abort signal. In
2969 -- order to detect this scenario, save the state of entry into the
2970 -- finalization code.
2972 -- No need to do this for VM case, since VM version of Ada.Exceptions
2973 -- does not include routine Raise_From_Controlled_Operation which is the
2974 -- the sole user of flag Abort.
2976 -- This is not needed for library-level finalizers as they are called
2977 -- by the environment task and cannot be aborted.
2980 and then VM_Target = No_VM
2981 and then not For_Package
2983 A_Expr := New_Reference_To (RTE (RE_Triggered_By_Abort), Loc);
2985 -- No abort, .NET/JVM or library-level finalizers
2988 A_Expr := New_Reference_To (Standard_False, Loc);
2992 -- Abort_Id : constant Boolean := <A_Expr>;
2995 Make_Object_Declaration (Loc,
2996 Defining_Identifier => Data.Abort_Id,
2997 Constant_Present => True,
2998 Object_Definition => New_Reference_To (Standard_Boolean, Loc),
2999 Expression => A_Expr));
3002 -- E_Id : Exception_Occurrence;
3005 Make_Object_Declaration (Loc,
3006 Defining_Identifier => Data.E_Id,
3007 Object_Definition =>
3008 New_Reference_To (RTE (RE_Exception_Occurrence), Loc));
3009 Set_No_Initialization (E_Decl);
3011 Append_To (Decls, E_Decl);
3014 -- Raised_Id : Boolean := False;
3017 Make_Object_Declaration (Loc,
3018 Defining_Identifier => Data.Raised_Id,
3019 Object_Definition => New_Reference_To (Standard_Boolean, Loc),
3020 Expression => New_Reference_To (Standard_False, Loc)));
3021 end Build_Object_Declarations;
3023 ---------------------------
3024 -- Build_Raise_Statement --
3025 ---------------------------
3027 function Build_Raise_Statement
3028 (Data : Finalization_Exception_Data) return Node_Id
3033 -- Standard run-time and .NET/JVM targets use the specialized routine
3034 -- Raise_From_Controlled_Operation.
3036 if RTE_Available (RE_Raise_From_Controlled_Operation) then
3038 Make_Procedure_Call_Statement (Data.Loc,
3041 (RTE (RE_Raise_From_Controlled_Operation), Data.Loc),
3042 Parameter_Associations =>
3043 New_List (New_Reference_To (Data.E_Id, Data.Loc)));
3045 -- Restricted run-time: exception messages are not supported and hence
3046 -- Raise_From_Controlled_Operation is not supported. Raise Program_Error
3051 Make_Raise_Program_Error (Data.Loc,
3052 Reason => PE_Finalize_Raised_Exception);
3056 -- if Raised_Id and then not Abort_Id then
3057 -- Raise_From_Controlled_Operation (E_Id);
3059 -- raise Program_Error; -- restricted runtime
3063 Make_If_Statement (Data.Loc,
3065 Make_And_Then (Data.Loc,
3066 Left_Opnd => New_Reference_To (Data.Raised_Id, Data.Loc),
3068 Make_Op_Not (Data.Loc,
3069 Right_Opnd => New_Reference_To (Data.Abort_Id, Data.Loc))),
3071 Then_Statements => New_List (Stmt));
3072 end Build_Raise_Statement;
3074 -----------------------------
3075 -- Build_Record_Deep_Procs --
3076 -----------------------------
3078 procedure Build_Record_Deep_Procs (Typ : Entity_Id) is
3082 (Prim => Initialize_Case,
3084 Stmts => Make_Deep_Record_Body (Initialize_Case, Typ)));
3086 if not Is_Immutably_Limited_Type (Typ) then
3089 (Prim => Adjust_Case,
3091 Stmts => Make_Deep_Record_Body (Adjust_Case, Typ)));
3094 -- Do not generate Deep_Finalize and Finalize_Address if finalization is
3095 -- suppressed since these routine will not be used.
3097 if not Restriction_Active (No_Finalization) then
3100 (Prim => Finalize_Case,
3102 Stmts => Make_Deep_Record_Body (Finalize_Case, Typ)));
3104 -- Create TSS primitive Finalize_Address for non-VM targets. JVM and
3105 -- .NET do not support address arithmetic and unchecked conversions.
3107 if VM_Target = No_VM then
3110 (Prim => Address_Case,
3112 Stmts => Make_Deep_Record_Body (Address_Case, Typ)));
3115 end Build_Record_Deep_Procs;
3121 function Cleanup_Array
3124 Typ : Entity_Id) return List_Id
3126 Loc : constant Source_Ptr := Sloc (N);
3127 Index_List : constant List_Id := New_List;
3129 function Free_Component return List_Id;
3130 -- Generate the code to finalize the task or protected subcomponents
3131 -- of a single component of the array.
3133 function Free_One_Dimension (Dim : Int) return List_Id;
3134 -- Generate a loop over one dimension of the array
3136 --------------------
3137 -- Free_Component --
3138 --------------------
3140 function Free_Component return List_Id is
3141 Stmts : List_Id := New_List;
3143 C_Typ : constant Entity_Id := Component_Type (Typ);
3146 -- Component type is known to contain tasks or protected objects
3149 Make_Indexed_Component (Loc,
3150 Prefix => Duplicate_Subexpr_No_Checks (Obj),
3151 Expressions => Index_List);
3153 Set_Etype (Tsk, C_Typ);
3155 if Is_Task_Type (C_Typ) then
3156 Append_To (Stmts, Cleanup_Task (N, Tsk));
3158 elsif Is_Simple_Protected_Type (C_Typ) then
3159 Append_To (Stmts, Cleanup_Protected_Object (N, Tsk));
3161 elsif Is_Record_Type (C_Typ) then
3162 Stmts := Cleanup_Record (N, Tsk, C_Typ);
3164 elsif Is_Array_Type (C_Typ) then
3165 Stmts := Cleanup_Array (N, Tsk, C_Typ);
3171 ------------------------
3172 -- Free_One_Dimension --
3173 ------------------------
3175 function Free_One_Dimension (Dim : Int) return List_Id is
3179 if Dim > Number_Dimensions (Typ) then
3180 return Free_Component;
3182 -- Here we generate the required loop
3185 Index := Make_Temporary (Loc, 'J');
3186 Append (New_Reference_To (Index, Loc), Index_List);
3189 Make_Implicit_Loop_Statement (N,
3190 Identifier => Empty,
3192 Make_Iteration_Scheme (Loc,
3193 Loop_Parameter_Specification =>
3194 Make_Loop_Parameter_Specification (Loc,
3195 Defining_Identifier => Index,
3196 Discrete_Subtype_Definition =>
3197 Make_Attribute_Reference (Loc,
3198 Prefix => Duplicate_Subexpr (Obj),
3199 Attribute_Name => Name_Range,
3200 Expressions => New_List (
3201 Make_Integer_Literal (Loc, Dim))))),
3202 Statements => Free_One_Dimension (Dim + 1)));
3204 end Free_One_Dimension;
3206 -- Start of processing for Cleanup_Array
3209 return Free_One_Dimension (1);
3212 --------------------
3213 -- Cleanup_Record --
3214 --------------------
3216 function Cleanup_Record
3219 Typ : Entity_Id) return List_Id
3221 Loc : constant Source_Ptr := Sloc (N);
3224 Stmts : constant List_Id := New_List;
3225 U_Typ : constant Entity_Id := Underlying_Type (Typ);
3228 if Has_Discriminants (U_Typ)
3229 and then Nkind (Parent (U_Typ)) = N_Full_Type_Declaration
3231 Nkind (Type_Definition (Parent (U_Typ))) = N_Record_Definition
3234 (Variant_Part (Component_List (Type_Definition (Parent (U_Typ)))))
3236 -- For now, do not attempt to free a component that may appear in a
3237 -- variant, and instead issue a warning. Doing this "properly" would
3238 -- require building a case statement and would be quite a mess. Note
3239 -- that the RM only requires that free "work" for the case of a task
3240 -- access value, so already we go way beyond this in that we deal
3241 -- with the array case and non-discriminated record cases.
3244 ("task/protected object in variant record will not be freed?", N);
3245 return New_List (Make_Null_Statement (Loc));
3248 Comp := First_Component (Typ);
3249 while Present (Comp) loop
3250 if Has_Task (Etype (Comp))
3251 or else Has_Simple_Protected_Object (Etype (Comp))
3254 Make_Selected_Component (Loc,
3255 Prefix => Duplicate_Subexpr_No_Checks (Obj),
3256 Selector_Name => New_Occurrence_Of (Comp, Loc));
3257 Set_Etype (Tsk, Etype (Comp));
3259 if Is_Task_Type (Etype (Comp)) then
3260 Append_To (Stmts, Cleanup_Task (N, Tsk));
3262 elsif Is_Simple_Protected_Type (Etype (Comp)) then
3263 Append_To (Stmts, Cleanup_Protected_Object (N, Tsk));
3265 elsif Is_Record_Type (Etype (Comp)) then
3267 -- Recurse, by generating the prefix of the argument to
3268 -- the eventual cleanup call.
3270 Append_List_To (Stmts, Cleanup_Record (N, Tsk, Etype (Comp)));
3272 elsif Is_Array_Type (Etype (Comp)) then
3273 Append_List_To (Stmts, Cleanup_Array (N, Tsk, Etype (Comp)));
3277 Next_Component (Comp);
3283 ------------------------------
3284 -- Cleanup_Protected_Object --
3285 ------------------------------
3287 function Cleanup_Protected_Object
3289 Ref : Node_Id) return Node_Id
3291 Loc : constant Source_Ptr := Sloc (N);
3294 -- For restricted run-time libraries (Ravenscar), tasks are
3295 -- non-terminating, and protected objects can only appear at library
3296 -- level, so we do not want finalization of protected objects.
3298 if Restricted_Profile then
3303 Make_Procedure_Call_Statement (Loc,
3305 New_Reference_To (RTE (RE_Finalize_Protection), Loc),
3306 Parameter_Associations => New_List (Concurrent_Ref (Ref)));
3308 end Cleanup_Protected_Object;
3314 function Cleanup_Task
3316 Ref : Node_Id) return Node_Id
3318 Loc : constant Source_Ptr := Sloc (N);
3321 -- For restricted run-time libraries (Ravenscar), tasks are
3322 -- non-terminating and they can only appear at library level, so we do
3323 -- not want finalization of task objects.
3325 if Restricted_Profile then
3330 Make_Procedure_Call_Statement (Loc,
3332 New_Reference_To (RTE (RE_Free_Task), Loc),
3333 Parameter_Associations => New_List (Concurrent_Ref (Ref)));
3337 ------------------------------
3338 -- Check_Visibly_Controlled --
3339 ------------------------------
3341 procedure Check_Visibly_Controlled
3342 (Prim : Final_Primitives;
3344 E : in out Entity_Id;
3345 Cref : in out Node_Id)
3347 Parent_Type : Entity_Id;
3351 if Is_Derived_Type (Typ)
3352 and then Comes_From_Source (E)
3353 and then not Present (Overridden_Operation (E))
3355 -- We know that the explicit operation on the type does not override
3356 -- the inherited operation of the parent, and that the derivation
3357 -- is from a private type that is not visibly controlled.
3359 Parent_Type := Etype (Typ);
3360 Op := Find_Prim_Op (Parent_Type, Name_Of (Prim));
3362 if Present (Op) then
3365 -- Wrap the object to be initialized into the proper
3366 -- unchecked conversion, to be compatible with the operation
3369 if Nkind (Cref) = N_Unchecked_Type_Conversion then
3370 Cref := Unchecked_Convert_To (Parent_Type, Expression (Cref));
3372 Cref := Unchecked_Convert_To (Parent_Type, Cref);
3376 end Check_Visibly_Controlled;
3378 -------------------------------
3379 -- CW_Or_Has_Controlled_Part --
3380 -------------------------------
3382 function CW_Or_Has_Controlled_Part (T : Entity_Id) return Boolean is
3384 return Is_Class_Wide_Type (T) or else Needs_Finalization (T);
3385 end CW_Or_Has_Controlled_Part;
3391 function Convert_View
3394 Ind : Pos := 1) return Node_Id
3396 Fent : Entity_Id := First_Entity (Proc);
3401 for J in 2 .. Ind loop
3405 Ftyp := Etype (Fent);
3407 if Nkind_In (Arg, N_Type_Conversion, N_Unchecked_Type_Conversion) then
3408 Atyp := Entity (Subtype_Mark (Arg));
3410 Atyp := Etype (Arg);
3413 if Is_Abstract_Subprogram (Proc) and then Is_Tagged_Type (Ftyp) then
3414 return Unchecked_Convert_To (Class_Wide_Type (Ftyp), Arg);
3417 and then Present (Atyp)
3418 and then (Is_Private_Type (Ftyp) or else Is_Private_Type (Atyp))
3419 and then Base_Type (Underlying_Type (Atyp)) =
3420 Base_Type (Underlying_Type (Ftyp))
3422 return Unchecked_Convert_To (Ftyp, Arg);
3424 -- If the argument is already a conversion, as generated by
3425 -- Make_Init_Call, set the target type to the type of the formal
3426 -- directly, to avoid spurious typing problems.
3428 elsif Nkind_In (Arg, N_Unchecked_Type_Conversion, N_Type_Conversion)
3429 and then not Is_Class_Wide_Type (Atyp)
3431 Set_Subtype_Mark (Arg, New_Occurrence_Of (Ftyp, Sloc (Arg)));
3432 Set_Etype (Arg, Ftyp);
3440 ------------------------
3441 -- Enclosing_Function --
3442 ------------------------
3444 function Enclosing_Function (E : Entity_Id) return Entity_Id is
3445 Func_Id : Entity_Id;
3449 while Present (Func_Id)
3450 and then Func_Id /= Standard_Standard
3452 if Ekind (Func_Id) = E_Function then
3456 Func_Id := Scope (Func_Id);
3460 end Enclosing_Function;
3462 -------------------------------
3463 -- Establish_Transient_Scope --
3464 -------------------------------
3466 -- This procedure is called each time a transient block has to be inserted
3467 -- that is to say for each call to a function with unconstrained or tagged
3468 -- result. It creates a new scope on the stack scope in order to enclose
3469 -- all transient variables generated
3471 procedure Establish_Transient_Scope (N : Node_Id; Sec_Stack : Boolean) is
3472 Loc : constant Source_Ptr := Sloc (N);
3473 Wrap_Node : Node_Id;
3476 -- Do not create a transient scope if we are already inside one
3478 for S in reverse Scope_Stack.First .. Scope_Stack.Last loop
3479 if Scope_Stack.Table (S).Is_Transient then
3481 Set_Uses_Sec_Stack (Scope_Stack.Table (S).Entity);
3486 -- If we have encountered Standard there are no enclosing
3487 -- transient scopes.
3489 elsif Scope_Stack.Table (S).Entity = Standard_Standard then
3494 Wrap_Node := Find_Node_To_Be_Wrapped (N);
3496 -- Case of no wrap node, false alert, no transient scope needed
3498 if No (Wrap_Node) then
3501 -- If the node to wrap is an iteration_scheme, the expression is
3502 -- one of the bounds, and the expansion will make an explicit
3503 -- declaration for it (see Analyze_Iteration_Scheme, sem_ch5.adb),
3504 -- so do not apply any transformations here.
3506 elsif Nkind (Wrap_Node) = N_Iteration_Scheme then
3509 -- In formal verification mode, if the node to wrap is a pragma check,
3510 -- this node and enclosed expression are not expanded, so do not apply
3511 -- any transformations here.
3514 and then Nkind (Wrap_Node) = N_Pragma
3515 and then Get_Pragma_Id (Wrap_Node) = Pragma_Check
3520 Push_Scope (New_Internal_Entity (E_Block, Current_Scope, Loc, 'B'));
3521 Set_Scope_Is_Transient;
3524 Set_Uses_Sec_Stack (Current_Scope);
3525 Check_Restriction (No_Secondary_Stack, N);
3528 Set_Etype (Current_Scope, Standard_Void_Type);
3529 Set_Node_To_Be_Wrapped (Wrap_Node);
3531 if Debug_Flag_W then
3532 Write_Str (" <Transient>");
3536 end Establish_Transient_Scope;
3538 ----------------------------
3539 -- Expand_Cleanup_Actions --
3540 ----------------------------
3542 procedure Expand_Cleanup_Actions (N : Node_Id) is
3543 Scop : constant Entity_Id := Current_Scope;
3545 Is_Asynchronous_Call : constant Boolean :=
3546 Nkind (N) = N_Block_Statement
3547 and then Is_Asynchronous_Call_Block (N);
3548 Is_Master : constant Boolean :=
3549 Nkind (N) /= N_Entry_Body
3550 and then Is_Task_Master (N);
3551 Is_Protected_Body : constant Boolean :=
3552 Nkind (N) = N_Subprogram_Body
3553 and then Is_Protected_Subprogram_Body (N);
3554 Is_Task_Allocation : constant Boolean :=
3555 Nkind (N) = N_Block_Statement
3556 and then Is_Task_Allocation_Block (N);
3557 Is_Task_Body : constant Boolean :=
3558 Nkind (Original_Node (N)) = N_Task_Body;
3559 Needs_Sec_Stack_Mark : constant Boolean :=
3560 Uses_Sec_Stack (Scop)
3562 not Sec_Stack_Needed_For_Return (Scop)
3563 and then VM_Target = No_VM;
3565 Actions_Required : constant Boolean :=
3566 Requires_Cleanup_Actions (N)
3567 or else Is_Asynchronous_Call
3569 or else Is_Protected_Body
3570 or else Is_Task_Allocation
3571 or else Is_Task_Body
3572 or else Needs_Sec_Stack_Mark;
3574 HSS : Node_Id := Handled_Statement_Sequence (N);
3577 procedure Wrap_HSS_In_Block;
3578 -- Move HSS inside a new block along with the original exception
3579 -- handlers. Make the newly generated block the sole statement of HSS.
3581 -----------------------
3582 -- Wrap_HSS_In_Block --
3583 -----------------------
3585 procedure Wrap_HSS_In_Block is
3590 -- Preserve end label to provide proper cross-reference information
3592 End_Lab := End_Label (HSS);
3594 Make_Block_Statement (Loc,
3595 Handled_Statement_Sequence => HSS);
3597 Set_Handled_Statement_Sequence (N,
3598 Make_Handled_Sequence_Of_Statements (Loc, New_List (Block)));
3599 HSS := Handled_Statement_Sequence (N);
3601 Set_First_Real_Statement (HSS, Block);
3602 Set_End_Label (HSS, End_Lab);
3604 -- Comment needed here, see RH for 1.306 ???
3606 if Nkind (N) = N_Subprogram_Body then
3607 Set_Has_Nested_Block_With_Handler (Scop);
3609 end Wrap_HSS_In_Block;
3611 -- Start of processing for Expand_Cleanup_Actions
3614 -- The current construct does not need any form of servicing
3616 if not Actions_Required then
3619 -- If the current node is a rewritten task body and the descriptors have
3620 -- not been delayed (due to some nested instantiations), do not generate
3621 -- redundant cleanup actions.
3624 and then Nkind (N) = N_Subprogram_Body
3625 and then not Delay_Subprogram_Descriptors (Corresponding_Spec (N))
3631 Decls : List_Id := Declarations (N);
3633 Mark : Entity_Id := Empty;
3634 New_Decls : List_Id;
3638 -- If we are generating expanded code for debugging purposes, use the
3639 -- Sloc of the point of insertion for the cleanup code. The Sloc will
3640 -- be updated subsequently to reference the proper line in .dg files.
3641 -- If we are not debugging generated code, use No_Location instead,
3642 -- so that no debug information is generated for the cleanup code.
3643 -- This makes the behavior of the NEXT command in GDB monotonic, and
3644 -- makes the placement of breakpoints more accurate.
3646 if Debug_Generated_Code then
3652 -- Set polling off. The finalization and cleanup code is executed
3653 -- with aborts deferred.
3655 Old_Poll := Polling_Required;
3656 Polling_Required := False;
3658 -- A task activation call has already been built for a task
3659 -- allocation block.
3661 if not Is_Task_Allocation then
3662 Build_Task_Activation_Call (N);
3666 Establish_Task_Master (N);
3669 New_Decls := New_List;
3671 -- If secondary stack is in use, generate:
3673 -- Mnn : constant Mark_Id := SS_Mark;
3675 -- Suppress calls to SS_Mark and SS_Release if VM_Target, since the
3676 -- secondary stack is never used on a VM.
3678 if Needs_Sec_Stack_Mark then
3679 Mark := Make_Temporary (Loc, 'M');
3681 Append_To (New_Decls,
3682 Make_Object_Declaration (Loc,
3683 Defining_Identifier => Mark,
3684 Object_Definition =>
3685 New_Reference_To (RTE (RE_Mark_Id), Loc),
3687 Make_Function_Call (Loc,
3688 Name => New_Reference_To (RTE (RE_SS_Mark), Loc))));
3690 Set_Uses_Sec_Stack (Scop, False);
3693 -- If exception handlers are present, wrap the sequence of statements
3694 -- in a block since it is not possible to have exception handlers and
3695 -- an At_End handler in the same construct.
3697 if Present (Exception_Handlers (HSS)) then
3700 -- Ensure that the First_Real_Statement field is set
3702 elsif No (First_Real_Statement (HSS)) then
3703 Set_First_Real_Statement (HSS, First (Statements (HSS)));
3706 -- Do not move the Activation_Chain declaration in the context of
3707 -- task allocation blocks. Task allocation blocks use _chain in their
3708 -- cleanup handlers and gigi complains if it is declared in the
3709 -- sequence of statements of the scope that declares the handler.
3711 if Is_Task_Allocation then
3713 Chain : constant Entity_Id := Activation_Chain_Entity (N);
3717 Decl := First (Decls);
3718 while Nkind (Decl) /= N_Object_Declaration
3719 or else Defining_Identifier (Decl) /= Chain
3723 -- A task allocation block should always include a _chain
3726 pragma Assert (Present (Decl));
3730 Prepend_To (New_Decls, Decl);
3734 -- Ensure the presence of a declaration list in order to successfully
3735 -- append all original statements to it.
3738 Set_Declarations (N, New_List);
3739 Decls := Declarations (N);
3742 -- Move the declarations into the sequence of statements in order to
3743 -- have them protected by the At_End handler. It may seem weird to
3744 -- put declarations in the sequence of statement but in fact nothing
3745 -- forbids that at the tree level.
3747 Append_List_To (Decls, Statements (HSS));
3748 Set_Statements (HSS, Decls);
3750 -- Reset the Sloc of the handled statement sequence to properly
3751 -- reflect the new initial "statement" in the sequence.
3753 Set_Sloc (HSS, Sloc (First (Decls)));
3755 -- The declarations of finalizer spec and auxiliary variables replace
3756 -- the old declarations that have been moved inward.
3758 Set_Declarations (N, New_Decls);
3759 Analyze_Declarations (New_Decls);
3761 -- Generate finalization calls for all controlled objects appearing
3762 -- in the statements of N. Add context specific cleanup for various
3767 Clean_Stmts => Build_Cleanup_Statements (N),
3769 Top_Decls => New_Decls,
3770 Defer_Abort => Nkind (Original_Node (N)) = N_Task_Body
3774 if Present (Fin_Id) then
3775 Build_Finalizer_Call (N, Fin_Id);
3778 -- Restore saved polling mode
3780 Polling_Required := Old_Poll;
3782 end Expand_Cleanup_Actions;
3784 ---------------------------
3785 -- Expand_N_Package_Body --
3786 ---------------------------
3788 -- Add call to Activate_Tasks if body is an activator (actual processing
3789 -- is in chapter 9).
3791 -- Generate subprogram descriptor for elaboration routine
3793 -- Encode entity names in package body
3795 procedure Expand_N_Package_Body (N : Node_Id) is
3796 Spec_Ent : constant Entity_Id := Corresponding_Spec (N);
3800 -- This is done only for non-generic packages
3802 if Ekind (Spec_Ent) = E_Package then
3803 Push_Scope (Corresponding_Spec (N));
3805 -- Build dispatch tables of library level tagged types
3807 if Tagged_Type_Expansion
3808 and then Is_Library_Level_Entity (Spec_Ent)
3810 Build_Static_Dispatch_Tables (N);
3813 Build_Task_Activation_Call (N);
3817 Set_Elaboration_Flag (N, Corresponding_Spec (N));
3818 Set_In_Package_Body (Spec_Ent, False);
3820 -- Set to encode entity names in package body before gigi is called
3822 Qualify_Entity_Names (N);
3824 if Ekind (Spec_Ent) /= E_Generic_Package then
3827 Clean_Stmts => No_List,
3829 Top_Decls => No_List,
3830 Defer_Abort => False,
3833 if Present (Fin_Id) then
3835 Body_Ent : Node_Id := Defining_Unit_Name (N);
3838 if Nkind (Body_Ent) = N_Defining_Program_Unit_Name then
3839 Body_Ent := Defining_Identifier (Body_Ent);
3842 Set_Finalizer (Body_Ent, Fin_Id);
3846 end Expand_N_Package_Body;
3848 ----------------------------------
3849 -- Expand_N_Package_Declaration --
3850 ----------------------------------
3852 -- Add call to Activate_Tasks if there are tasks declared and the package
3853 -- has no body. Note that in Ada83, this may result in premature activation
3854 -- of some tasks, given that we cannot tell whether a body will eventually
3857 procedure Expand_N_Package_Declaration (N : Node_Id) is
3858 Id : constant Entity_Id := Defining_Entity (N);
3859 Spec : constant Node_Id := Specification (N);
3863 No_Body : Boolean := False;
3864 -- True in the case of a package declaration that is a compilation
3865 -- unit and for which no associated body will be compiled in this
3869 -- Case of a package declaration other than a compilation unit
3871 if Nkind (Parent (N)) /= N_Compilation_Unit then
3874 -- Case of a compilation unit that does not require a body
3876 elsif not Body_Required (Parent (N))
3877 and then not Unit_Requires_Body (Id)
3881 -- Special case of generating calling stubs for a remote call interface
3882 -- package: even though the package declaration requires one, the body
3883 -- won't be processed in this compilation (so any stubs for RACWs
3884 -- declared in the package must be generated here, along with the spec).
3886 elsif Parent (N) = Cunit (Main_Unit)
3887 and then Is_Remote_Call_Interface (Id)
3888 and then Distribution_Stub_Mode = Generate_Caller_Stub_Body
3893 -- For a nested instance, delay processing until freeze point
3895 if Has_Delayed_Freeze (Id)
3896 and then Nkind (Parent (N)) /= N_Compilation_Unit
3901 -- For a package declaration that implies no associated body, generate
3902 -- task activation call and RACW supporting bodies now (since we won't
3903 -- have a specific separate compilation unit for that).
3908 if Has_RACW (Id) then
3910 -- Generate RACW subprogram bodies
3912 Decls := Private_Declarations (Spec);
3915 Decls := Visible_Declarations (Spec);
3920 Set_Visible_Declarations (Spec, Decls);
3923 Append_RACW_Bodies (Decls, Id);
3924 Analyze_List (Decls);
3927 if Present (Activation_Chain_Entity (N)) then
3929 -- Generate task activation call as last step of elaboration
3931 Build_Task_Activation_Call (N);
3937 -- Build dispatch tables of library level tagged types
3939 if Tagged_Type_Expansion
3940 and then (Is_Compilation_Unit (Id)
3941 or else (Is_Generic_Instance (Id)
3942 and then Is_Library_Level_Entity (Id)))
3944 Build_Static_Dispatch_Tables (N);
3947 -- Note: it is not necessary to worry about generating a subprogram
3948 -- descriptor, since the only way to get exception handlers into a
3949 -- package spec is to include instantiations, and that would cause
3950 -- generation of subprogram descriptors to be delayed in any case.
3952 -- Set to encode entity names in package spec before gigi is called
3954 Qualify_Entity_Names (N);
3956 if Ekind (Id) /= E_Generic_Package then
3959 Clean_Stmts => No_List,
3961 Top_Decls => No_List,
3962 Defer_Abort => False,
3965 Set_Finalizer (Id, Fin_Id);
3967 end Expand_N_Package_Declaration;
3969 -----------------------------
3970 -- Find_Node_To_Be_Wrapped --
3971 -----------------------------
3973 function Find_Node_To_Be_Wrapped (N : Node_Id) return Node_Id is
3975 The_Parent : Node_Id;
3981 pragma Assert (P /= Empty);
3982 The_Parent := Parent (P);
3984 case Nkind (The_Parent) is
3986 -- Simple statement can be wrapped
3991 -- Usually assignments are good candidate for wrapping
3992 -- except when they have been generated as part of a
3993 -- controlled aggregate where the wrapping should take
3994 -- place more globally.
3996 when N_Assignment_Statement =>
3997 if No_Ctrl_Actions (The_Parent) then
4003 -- An entry call statement is a special case if it occurs in
4004 -- the context of a Timed_Entry_Call. In this case we wrap
4005 -- the entire timed entry call.
4007 when N_Entry_Call_Statement |
4008 N_Procedure_Call_Statement =>
4009 if Nkind (Parent (The_Parent)) = N_Entry_Call_Alternative
4010 and then Nkind_In (Parent (Parent (The_Parent)),
4012 N_Conditional_Entry_Call)
4014 return Parent (Parent (The_Parent));
4019 -- Object declarations are also a boundary for the transient scope
4020 -- even if they are not really wrapped
4021 -- (see Wrap_Transient_Declaration)
4023 when N_Object_Declaration |
4024 N_Object_Renaming_Declaration |
4025 N_Subtype_Declaration =>
4028 -- The expression itself is to be wrapped if its parent is a
4029 -- compound statement or any other statement where the expression
4030 -- is known to be scalar
4032 when N_Accept_Alternative |
4033 N_Attribute_Definition_Clause |
4036 N_Delay_Alternative |
4037 N_Delay_Until_Statement |
4038 N_Delay_Relative_Statement |
4039 N_Discriminant_Association |
4041 N_Entry_Body_Formal_Part |
4044 N_Iteration_Scheme |
4045 N_Terminate_Alternative =>
4048 when N_Attribute_Reference =>
4050 if Is_Procedure_Attribute_Name
4051 (Attribute_Name (The_Parent))
4056 -- A raise statement can be wrapped. This will arise when the
4057 -- expression in a raise_with_expression uses the secondary
4058 -- stack, for example.
4060 when N_Raise_Statement =>
4063 -- If the expression is within the iteration scheme of a loop,
4064 -- we must create a declaration for it, followed by an assignment
4065 -- in order to have a usable statement to wrap.
4067 when N_Loop_Parameter_Specification =>
4068 return Parent (The_Parent);
4070 -- The following nodes contains "dummy calls" which don't
4071 -- need to be wrapped.
4073 when N_Parameter_Specification |
4074 N_Discriminant_Specification |
4075 N_Component_Declaration =>
4078 -- The return statement is not to be wrapped when the function
4079 -- itself needs wrapping at the outer-level
4081 when N_Simple_Return_Statement =>
4083 Applies_To : constant Entity_Id :=
4085 (Return_Statement_Entity (The_Parent));
4086 Return_Type : constant Entity_Id := Etype (Applies_To);
4088 if Requires_Transient_Scope (Return_Type) then
4095 -- If we leave a scope without having been able to find a node to
4096 -- wrap, something is going wrong but this can happen in error
4097 -- situation that are not detected yet (such as a dynamic string
4098 -- in a pragma export)
4100 when N_Subprogram_Body |
4101 N_Package_Declaration |
4103 N_Block_Statement =>
4106 -- otherwise continue the search
4112 end Find_Node_To_Be_Wrapped;
4114 -------------------------------------
4115 -- Get_Global_Pool_For_Access_Type --
4116 -------------------------------------
4118 function Get_Global_Pool_For_Access_Type (T : Entity_Id) return Entity_Id is
4120 -- Access types whose size is smaller than System.Address size can
4121 -- exist only on VMS. We can't use the usual global pool which returns
4122 -- an object of type Address as truncation will make it invalid.
4123 -- To handle this case, VMS has a dedicated global pool that returns
4124 -- addresses that fit into 32 bit accesses.
4126 if Opt.True_VMS_Target and then Esize (T) = 32 then
4127 return RTE (RE_Global_Pool_32_Object);
4129 return RTE (RE_Global_Pool_Object);
4131 end Get_Global_Pool_For_Access_Type;
4133 ----------------------------------
4134 -- Has_New_Controlled_Component --
4135 ----------------------------------
4137 function Has_New_Controlled_Component (E : Entity_Id) return Boolean is
4141 if not Is_Tagged_Type (E) then
4142 return Has_Controlled_Component (E);
4143 elsif not Is_Derived_Type (E) then
4144 return Has_Controlled_Component (E);
4147 Comp := First_Component (E);
4148 while Present (Comp) loop
4149 if Chars (Comp) = Name_uParent then
4152 elsif Scope (Original_Record_Component (Comp)) = E
4153 and then Needs_Finalization (Etype (Comp))
4158 Next_Component (Comp);
4162 end Has_New_Controlled_Component;
4164 ---------------------------------
4165 -- Has_Simple_Protected_Object --
4166 ---------------------------------
4168 function Has_Simple_Protected_Object (T : Entity_Id) return Boolean is
4170 if Has_Task (T) then
4173 elsif Is_Simple_Protected_Type (T) then
4176 elsif Is_Array_Type (T) then
4177 return Has_Simple_Protected_Object (Component_Type (T));
4179 elsif Is_Record_Type (T) then
4184 Comp := First_Component (T);
4185 while Present (Comp) loop
4186 if Has_Simple_Protected_Object (Etype (Comp)) then
4190 Next_Component (Comp);
4199 end Has_Simple_Protected_Object;
4201 ------------------------------------
4202 -- Insert_Actions_In_Scope_Around --
4203 ------------------------------------
4205 procedure Insert_Actions_In_Scope_Around (N : Node_Id) is
4206 SE : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last);
4207 After : List_Id renames SE.Actions_To_Be_Wrapped_After;
4208 Before : List_Id renames SE.Actions_To_Be_Wrapped_Before;
4210 procedure Process_Transient_Objects
4211 (First_Object : Node_Id;
4212 Last_Object : Node_Id;
4213 Related_Node : Node_Id);
4214 -- First_Object and Last_Object define a list which contains potential
4215 -- controlled transient objects. Finalization flags are inserted before
4216 -- First_Object and finalization calls are inserted after Last_Object.
4217 -- Related_Node is the node for which transient objects have been
4220 -------------------------------
4221 -- Process_Transient_Objects --
4222 -------------------------------
4224 procedure Process_Transient_Objects
4225 (First_Object : Node_Id;
4226 Last_Object : Node_Id;
4227 Related_Node : Node_Id)
4229 Requires_Hooking : constant Boolean :=
4230 Nkind_In (N, N_Function_Call,
4231 N_Procedure_Call_Statement);
4233 Built : Boolean := False;
4234 Desig_Typ : Entity_Id;
4235 Fin_Block : Node_Id;
4236 Fin_Data : Finalization_Exception_Data;
4237 Fin_Decls : List_Id;
4238 Last_Fin : Node_Id := Empty;
4242 Obj_Typ : Entity_Id;
4245 Temp_Id : Entity_Id;
4248 -- Examine all objects in the list First_Object .. Last_Object
4250 Stmt := First_Object;
4251 while Present (Stmt) loop
4252 if Nkind (Stmt) = N_Object_Declaration
4253 and then Analyzed (Stmt)
4254 and then Is_Finalizable_Transient (Stmt, N)
4256 -- Do not process the node to be wrapped since it will be
4257 -- handled by the enclosing finalizer.
4259 and then Stmt /= Related_Node
4262 Obj_Id := Defining_Identifier (Stmt);
4263 Obj_Typ := Base_Type (Etype (Obj_Id));
4264 Desig_Typ := Obj_Typ;
4266 Set_Is_Processed_Transient (Obj_Id);
4268 -- Handle access types
4270 if Is_Access_Type (Desig_Typ) then
4271 Desig_Typ := Available_View (Designated_Type (Desig_Typ));
4274 -- Create the necessary entities and declarations the first
4278 Fin_Decls := New_List;
4280 Build_Object_Declarations (Fin_Data, Fin_Decls, Loc);
4281 Insert_List_Before_And_Analyze (First_Object, Fin_Decls);
4286 -- Transient variables associated with subprogram calls need
4287 -- extra processing. These variables are usually created right
4288 -- before the call and finalized immediately after the call.
4289 -- If an exception occurs during the call, the clean up code
4290 -- is skipped due to the sudden change in control and the
4291 -- transient is never finalized.
4293 -- To handle this case, such variables are "exported" to the
4294 -- enclosing sequence of statements where their corresponding
4295 -- "hooks" are picked up by the finalization machinery.
4297 if Requires_Hooking then
4303 -- Step 1: Create an access type which provides a
4304 -- reference to the transient object. Generate:
4306 -- Ann : access [all] <Desig_Typ>;
4308 Ptr_Id := Make_Temporary (Loc, 'A');
4310 Insert_Action (Stmt,
4311 Make_Full_Type_Declaration (Loc,
4312 Defining_Identifier => Ptr_Id,
4314 Make_Access_To_Object_Definition (Loc,
4316 Ekind (Obj_Typ) = E_General_Access_Type,
4317 Subtype_Indication =>
4318 New_Reference_To (Desig_Typ, Loc))));
4320 -- Step 2: Create a temporary which acts as a hook to
4321 -- the transient object. Generate:
4323 -- Temp : Ptr_Id := null;
4325 Temp_Id := Make_Temporary (Loc, 'T');
4327 Insert_Action (Stmt,
4328 Make_Object_Declaration (Loc,
4329 Defining_Identifier => Temp_Id,
4330 Object_Definition =>
4331 New_Reference_To (Ptr_Id, Loc)));
4333 -- Mark the temporary as a transient hook. This signals
4334 -- the machinery in Build_Finalizer to recognize this
4337 Set_Return_Flag_Or_Transient_Decl (Temp_Id, Stmt);
4339 -- Step 3: Hook the transient object to the temporary
4341 if Is_Access_Type (Obj_Typ) then
4343 Convert_To (Ptr_Id, New_Reference_To (Obj_Id, Loc));
4346 Make_Attribute_Reference (Loc,
4347 Prefix => New_Reference_To (Obj_Id, Loc),
4348 Attribute_Name => Name_Unrestricted_Access);
4352 -- Temp := Ptr_Id (Obj_Id);
4354 -- Temp := Obj_Id'Unrestricted_Access;
4356 Insert_After_And_Analyze (Stmt,
4357 Make_Assignment_Statement (Loc,
4358 Name => New_Reference_To (Temp_Id, Loc),
4359 Expression => Expr));
4365 -- The transient object is about to be finalized by the clean
4366 -- up code following the subprogram call. In order to avoid
4367 -- double finalization, clear the hook.
4372 if Requires_Hooking then
4374 Make_Assignment_Statement (Loc,
4375 Name => New_Reference_To (Temp_Id, Loc),
4376 Expression => Make_Null (Loc)));
4380 -- [Deep_]Finalize (Obj_Ref);
4382 Obj_Ref := New_Reference_To (Obj_Id, Loc);
4384 if Is_Access_Type (Obj_Typ) then
4385 Obj_Ref := Make_Explicit_Dereference (Loc, Obj_Ref);
4390 (Obj_Ref => Obj_Ref,
4396 -- [Deep_]Finalize (Obj_Ref);
4400 -- if not Raised then
4403 -- (Enn, Get_Current_Excep.all.all);
4408 Make_Block_Statement (Loc,
4409 Handled_Statement_Sequence =>
4410 Make_Handled_Sequence_Of_Statements (Loc,
4411 Statements => Stmts,
4412 Exception_Handlers => New_List (
4413 Build_Exception_Handler (Fin_Data))));
4415 Insert_After_And_Analyze (Last_Object, Fin_Block);
4417 -- The raise statement must be inserted after all the
4418 -- finalization blocks.
4420 if No (Last_Fin) then
4421 Last_Fin := Fin_Block;
4424 -- When the associated node is an array object, the expander may
4425 -- sometimes generate a loop and create transient objects inside
4428 elsif Nkind (Related_Node) = N_Object_Declaration
4429 and then Is_Array_Type (Base_Type
4430 (Etype (Defining_Identifier (Related_Node))))
4431 and then Nkind (Stmt) = N_Loop_Statement
4434 Block_HSS : Node_Id := First (Statements (Stmt));
4437 -- The loop statements may have been wrapped in a block by
4438 -- Process_Statements_For_Controlled_Objects, inspect the
4439 -- handled sequence of statements.
4441 if Nkind (Block_HSS) = N_Block_Statement
4442 and then No (Next (Block_HSS))
4444 Block_HSS := Handled_Statement_Sequence (Block_HSS);
4446 Process_Transient_Objects
4447 (First_Object => First (Statements (Block_HSS)),
4448 Last_Object => Last (Statements (Block_HSS)),
4449 Related_Node => Related_Node);
4451 -- Inspect the statements of the loop
4454 Process_Transient_Objects
4455 (First_Object => First (Statements (Stmt)),
4456 Last_Object => Last (Statements (Stmt)),
4457 Related_Node => Related_Node);
4461 -- Terminate the scan after the last object has been processed
4463 elsif Stmt = Last_Object then
4471 -- if Raised and then not Abort then
4472 -- Raise_From_Controlled_Operation (E);
4476 and then Present (Last_Fin)
4478 Insert_After_And_Analyze (Last_Fin,
4479 Build_Raise_Statement (Fin_Data));
4481 end Process_Transient_Objects;
4483 -- Start of processing for Insert_Actions_In_Scope_Around
4486 if No (Before) and then No (After) then
4491 Node_To_Wrap : constant Node_Id := Node_To_Be_Wrapped;
4492 First_Obj : Node_Id;
4497 -- If the node to be wrapped is the trigger of an asynchronous
4498 -- select, it is not part of a statement list. The actions must be
4499 -- inserted before the select itself, which is part of some list of
4500 -- statements. Note that the triggering alternative includes the
4501 -- triggering statement and an optional statement list. If the node
4502 -- to be wrapped is part of that list, the normal insertion applies.
4504 if Nkind (Parent (Node_To_Wrap)) = N_Triggering_Alternative
4505 and then not Is_List_Member (Node_To_Wrap)
4507 Target := Parent (Parent (Node_To_Wrap));
4512 First_Obj := Target;
4515 -- Add all actions associated with a transient scope into the main
4516 -- tree. There are several scenarios here:
4518 -- +--- Before ----+ +----- After ---+
4519 -- 1) First_Obj ....... Target ........ Last_Obj
4521 -- 2) First_Obj ....... Target
4523 -- 3) Target ........ Last_Obj
4525 if Present (Before) then
4527 -- Flag declarations are inserted before the first object
4529 First_Obj := First (Before);
4531 Insert_List_Before (Target, Before);
4534 if Present (After) then
4536 -- Finalization calls are inserted after the last object
4538 Last_Obj := Last (After);
4540 Insert_List_After (Target, After);
4543 -- Check for transient controlled objects associated with Target and
4544 -- generate the appropriate finalization actions for them.
4546 Process_Transient_Objects
4547 (First_Object => First_Obj,
4548 Last_Object => Last_Obj,
4549 Related_Node => Target);
4551 -- Reset the action lists
4553 if Present (Before) then
4557 if Present (After) then
4561 end Insert_Actions_In_Scope_Around;
4563 ------------------------------
4564 -- Is_Simple_Protected_Type --
4565 ------------------------------
4567 function Is_Simple_Protected_Type (T : Entity_Id) return Boolean is
4570 Is_Protected_Type (T)
4571 and then not Has_Entries (T)
4572 and then Is_RTE (Find_Protection_Type (T), RE_Protection);
4573 end Is_Simple_Protected_Type;
4575 -----------------------
4576 -- Make_Adjust_Call --
4577 -----------------------
4579 function Make_Adjust_Call
4582 For_Parent : Boolean := False) return Node_Id
4584 Loc : constant Source_Ptr := Sloc (Obj_Ref);
4585 Adj_Id : Entity_Id := Empty;
4586 Ref : Node_Id := Obj_Ref;
4590 -- Recover the proper type which contains Deep_Adjust
4592 if Is_Class_Wide_Type (Typ) then
4593 Utyp := Root_Type (Typ);
4598 Utyp := Underlying_Type (Base_Type (Utyp));
4599 Set_Assignment_OK (Ref);
4601 -- Deal with non-tagged derivation of private views
4603 if Is_Untagged_Derivation (Typ) then
4604 Utyp := Underlying_Type (Root_Type (Base_Type (Typ)));
4605 Ref := Unchecked_Convert_To (Utyp, Ref);
4606 Set_Assignment_OK (Ref);
4609 -- When dealing with the completion of a private type, use the base
4612 if Utyp /= Base_Type (Utyp) then
4613 pragma Assert (Is_Private_Type (Typ));
4615 Utyp := Base_Type (Utyp);
4616 Ref := Unchecked_Convert_To (Utyp, Ref);
4619 -- Select the appropriate version of adjust
4622 if Has_Controlled_Component (Utyp) then
4623 Adj_Id := Find_Prim_Op (Utyp, TSS_Deep_Adjust);
4626 -- Class-wide types, interfaces and types with controlled components
4628 elsif Is_Class_Wide_Type (Typ)
4629 or else Is_Interface (Typ)
4630 or else Has_Controlled_Component (Utyp)
4632 if Is_Tagged_Type (Utyp) then
4633 Adj_Id := Find_Prim_Op (Utyp, TSS_Deep_Adjust);
4635 Adj_Id := TSS (Utyp, TSS_Deep_Adjust);
4638 -- Derivations from [Limited_]Controlled
4640 elsif Is_Controlled (Utyp) then
4641 if Has_Controlled_Component (Utyp) then
4642 Adj_Id := Find_Prim_Op (Utyp, TSS_Deep_Adjust);
4644 Adj_Id := Find_Prim_Op (Utyp, Name_Of (Adjust_Case));
4649 elsif Is_Tagged_Type (Utyp) then
4650 Adj_Id := Find_Prim_Op (Utyp, TSS_Deep_Adjust);
4653 raise Program_Error;
4656 if Present (Adj_Id) then
4658 -- If the object is unanalyzed, set its expected type for use in
4659 -- Convert_View in case an additional conversion is needed.
4662 and then Nkind (Ref) /= N_Unchecked_Type_Conversion
4664 Set_Etype (Ref, Typ);
4667 -- The object reference may need another conversion depending on the
4668 -- type of the formal and that of the actual.
4670 if not Is_Class_Wide_Type (Typ) then
4671 Ref := Convert_View (Adj_Id, Ref);
4674 return Make_Call (Loc, Adj_Id, New_Copy_Tree (Ref), For_Parent);
4678 end Make_Adjust_Call;
4680 ----------------------
4681 -- Make_Attach_Call --
4682 ----------------------
4684 function Make_Attach_Call
4686 Ptr_Typ : Entity_Id) return Node_Id
4688 pragma Assert (VM_Target /= No_VM);
4690 Loc : constant Source_Ptr := Sloc (Obj_Ref);
4693 Make_Procedure_Call_Statement (Loc,
4695 New_Reference_To (RTE (RE_Attach), Loc),
4696 Parameter_Associations => New_List (
4697 New_Reference_To (Finalization_Master (Ptr_Typ), Loc),
4698 Unchecked_Convert_To (RTE (RE_Root_Controlled_Ptr), Obj_Ref)));
4699 end Make_Attach_Call;
4701 ----------------------
4702 -- Make_Detach_Call --
4703 ----------------------
4705 function Make_Detach_Call (Obj_Ref : Node_Id) return Node_Id is
4706 Loc : constant Source_Ptr := Sloc (Obj_Ref);
4710 Make_Procedure_Call_Statement (Loc,
4712 New_Reference_To (RTE (RE_Detach), Loc),
4713 Parameter_Associations => New_List (
4714 Unchecked_Convert_To (RTE (RE_Root_Controlled_Ptr), Obj_Ref)));
4715 end Make_Detach_Call;
4723 Proc_Id : Entity_Id;
4725 For_Parent : Boolean := False) return Node_Id
4727 Params : constant List_Id := New_List (Param);
4730 -- When creating a call to Deep_Finalize for a _parent field of a
4731 -- derived type, disable the invocation of the nested Finalize by giving
4732 -- the corresponding flag a False value.
4735 Append_To (Params, New_Reference_To (Standard_False, Loc));
4739 Make_Procedure_Call_Statement (Loc,
4740 Name => New_Reference_To (Proc_Id, Loc),
4741 Parameter_Associations => Params);
4744 --------------------------
4745 -- Make_Deep_Array_Body --
4746 --------------------------
4748 function Make_Deep_Array_Body
4749 (Prim : Final_Primitives;
4750 Typ : Entity_Id) return List_Id
4752 function Build_Adjust_Or_Finalize_Statements
4753 (Typ : Entity_Id) return List_Id;
4754 -- Create the statements necessary to adjust or finalize an array of
4755 -- controlled elements. Generate:
4758 -- Abort : constant Boolean := Triggered_By_Abort;
4760 -- Abort : constant Boolean := False; -- no abort
4762 -- E : Exception_Occurrence;
4763 -- Raised : Boolean := False;
4766 -- for J1 in [reverse] Typ'First (1) .. Typ'Last (1) loop
4767 -- ^-- in the finalization case
4769 -- for Jn in [reverse] Typ'First (n) .. Typ'Last (n) loop
4771 -- [Deep_]Adjust / Finalize (V (J1, ..., Jn));
4775 -- if not Raised then
4777 -- Save_Occurrence (E, Get_Current_Excep.all.all);
4784 -- if Raised and then not Abort then
4785 -- Raise_From_Controlled_Operation (E);
4789 function Build_Initialize_Statements (Typ : Entity_Id) return List_Id;
4790 -- Create the statements necessary to initialize an array of controlled
4791 -- elements. Include a mechanism to carry out partial finalization if an
4792 -- exception occurs. Generate:
4795 -- Counter : Integer := 0;
4798 -- for J1 in V'Range (1) loop
4800 -- for JN in V'Range (N) loop
4802 -- [Deep_]Initialize (V (J1, ..., JN));
4804 -- Counter := Counter + 1;
4809 -- Abort : constant Boolean := Triggered_By_Abort;
4811 -- Abort : constant Boolean := False; -- no abort
4812 -- E : Exception_Occurence;
4813 -- Raised : Boolean := False;
4820 -- V'Length (N) - Counter;
4822 -- for F1 in reverse V'Range (1) loop
4824 -- for FN in reverse V'Range (N) loop
4825 -- if Counter > 0 then
4826 -- Counter := Counter - 1;
4829 -- [Deep_]Finalize (V (F1, ..., FN));
4833 -- if not Raised then
4835 -- Save_Occurrence (E,
4836 -- Get_Current_Excep.all.all);
4845 -- if Raised and then not Abort then
4846 -- Raise_From_Controlled_Operation (E);
4855 function New_References_To
4857 Loc : Source_Ptr) return List_Id;
4858 -- Given a list of defining identifiers, return a list of references to
4859 -- the original identifiers, in the same order as they appear.
4861 -----------------------------------------
4862 -- Build_Adjust_Or_Finalize_Statements --
4863 -----------------------------------------
4865 function Build_Adjust_Or_Finalize_Statements
4866 (Typ : Entity_Id) return List_Id
4868 Comp_Typ : constant Entity_Id := Component_Type (Typ);
4869 Index_List : constant List_Id := New_List;
4870 Loc : constant Source_Ptr := Sloc (Typ);
4871 Num_Dims : constant Int := Number_Dimensions (Typ);
4872 Finalizer_Decls : List_Id := No_List;
4873 Finalizer_Data : Finalization_Exception_Data;
4876 Core_Loop : Node_Id;
4879 Loop_Id : Entity_Id;
4882 Exceptions_OK : constant Boolean :=
4883 not Restriction_Active (No_Exception_Propagation);
4885 procedure Build_Indices;
4886 -- Generate the indices used in the dimension loops
4892 procedure Build_Indices is
4894 -- Generate the following identifiers:
4895 -- Jnn - for initialization
4897 for Dim in 1 .. Num_Dims loop
4898 Append_To (Index_List,
4899 Make_Defining_Identifier (Loc, New_External_Name ('J', Dim)));
4903 -- Start of processing for Build_Adjust_Or_Finalize_Statements
4908 if Exceptions_OK then
4909 Finalizer_Decls := New_List;
4910 Build_Object_Declarations (Finalizer_Data, Finalizer_Decls, Loc);
4914 Make_Indexed_Component (Loc,
4915 Prefix => Make_Identifier (Loc, Name_V),
4916 Expressions => New_References_To (Index_List, Loc));
4917 Set_Etype (Comp_Ref, Comp_Typ);
4920 -- [Deep_]Adjust (V (J1, ..., JN))
4922 if Prim = Adjust_Case then
4923 Call := Make_Adjust_Call (Obj_Ref => Comp_Ref, Typ => Comp_Typ);
4926 -- [Deep_]Finalize (V (J1, ..., JN))
4928 else pragma Assert (Prim = Finalize_Case);
4929 Call := Make_Final_Call (Obj_Ref => Comp_Ref, Typ => Comp_Typ);
4932 -- Generate the block which houses the adjust or finalize call:
4934 -- <adjust or finalize call>; -- No_Exception_Propagation
4936 -- begin -- Exception handlers allowed
4937 -- <adjust or finalize call>
4941 -- if not Raised then
4943 -- Save_Occurrence (E, Get_Current_Excep.all.all);
4947 if Exceptions_OK then
4949 Make_Block_Statement (Loc,
4950 Handled_Statement_Sequence =>
4951 Make_Handled_Sequence_Of_Statements (Loc,
4952 Statements => New_List (Call),
4953 Exception_Handlers => New_List (
4954 Build_Exception_Handler (Finalizer_Data))));
4959 -- Generate the dimension loops starting from the innermost one
4961 -- for Jnn in [reverse] V'Range (Dim) loop
4965 J := Last (Index_List);
4967 while Present (J) and then Dim > 0 loop
4973 Make_Loop_Statement (Loc,
4975 Make_Iteration_Scheme (Loc,
4976 Loop_Parameter_Specification =>
4977 Make_Loop_Parameter_Specification (Loc,
4978 Defining_Identifier => Loop_Id,
4979 Discrete_Subtype_Definition =>
4980 Make_Attribute_Reference (Loc,
4981 Prefix => Make_Identifier (Loc, Name_V),
4982 Attribute_Name => Name_Range,
4983 Expressions => New_List (
4984 Make_Integer_Literal (Loc, Dim))),
4986 Reverse_Present => Prim = Finalize_Case)),
4988 Statements => New_List (Core_Loop),
4989 End_Label => Empty);
4994 -- Generate the block which contains the core loop, the declarations
4995 -- of the abort flag, the exception occurrence, the raised flag and
4996 -- the conditional raise:
4999 -- Abort : constant Boolean := Triggered_By_Abort;
5001 -- Abort : constant Boolean := False; -- no abort
5003 -- E : Exception_Occurrence;
5004 -- Raised : Boolean := False;
5009 -- if Raised and then not Abort then -- Expection handlers OK
5010 -- Raise_From_Controlled_Operation (E);
5014 Stmts := New_List (Core_Loop);
5016 if Exceptions_OK then
5018 Build_Raise_Statement (Finalizer_Data));
5023 Make_Block_Statement (Loc,
5026 Handled_Statement_Sequence =>
5027 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
5028 end Build_Adjust_Or_Finalize_Statements;
5030 ---------------------------------
5031 -- Build_Initialize_Statements --
5032 ---------------------------------
5034 function Build_Initialize_Statements (Typ : Entity_Id) return List_Id is
5035 Comp_Typ : constant Entity_Id := Component_Type (Typ);
5036 Final_List : constant List_Id := New_List;
5037 Index_List : constant List_Id := New_List;
5038 Loc : constant Source_Ptr := Sloc (Typ);
5039 Num_Dims : constant Int := Number_Dimensions (Typ);
5040 Counter_Id : Entity_Id;
5044 Final_Block : Node_Id;
5045 Final_Loop : Node_Id;
5046 Finalizer_Data : Finalization_Exception_Data;
5047 Finalizer_Decls : List_Id := No_List;
5048 Init_Loop : Node_Id;
5053 Exceptions_OK : constant Boolean :=
5054 not Restriction_Active (No_Exception_Propagation);
5056 function Build_Counter_Assignment return Node_Id;
5057 -- Generate the following assignment:
5058 -- Counter := V'Length (1) *
5060 -- V'Length (N) - Counter;
5062 function Build_Finalization_Call return Node_Id;
5063 -- Generate a deep finalization call for an array element
5065 procedure Build_Indices;
5066 -- Generate the initialization and finalization indices used in the
5069 function Build_Initialization_Call return Node_Id;
5070 -- Generate a deep initialization call for an array element
5072 ------------------------------
5073 -- Build_Counter_Assignment --
5074 ------------------------------
5076 function Build_Counter_Assignment return Node_Id is
5081 -- Start from the first dimension and generate:
5086 Make_Attribute_Reference (Loc,
5087 Prefix => Make_Identifier (Loc, Name_V),
5088 Attribute_Name => Name_Length,
5089 Expressions => New_List (Make_Integer_Literal (Loc, Dim)));
5091 -- Process the rest of the dimensions, generate:
5092 -- Expr * V'Length (N)
5095 while Dim <= Num_Dims loop
5097 Make_Op_Multiply (Loc,
5100 Make_Attribute_Reference (Loc,
5101 Prefix => Make_Identifier (Loc, Name_V),
5102 Attribute_Name => Name_Length,
5103 Expressions => New_List (
5104 Make_Integer_Literal (Loc, Dim))));
5110 -- Counter := Expr - Counter;
5113 Make_Assignment_Statement (Loc,
5114 Name => New_Reference_To (Counter_Id, Loc),
5116 Make_Op_Subtract (Loc,
5118 Right_Opnd => New_Reference_To (Counter_Id, Loc)));
5119 end Build_Counter_Assignment;
5121 -----------------------------
5122 -- Build_Finalization_Call --
5123 -----------------------------
5125 function Build_Finalization_Call return Node_Id is
5126 Comp_Ref : constant Node_Id :=
5127 Make_Indexed_Component (Loc,
5128 Prefix => Make_Identifier (Loc, Name_V),
5129 Expressions => New_References_To (Final_List, Loc));
5132 Set_Etype (Comp_Ref, Comp_Typ);
5135 -- [Deep_]Finalize (V);
5137 return Make_Final_Call (Obj_Ref => Comp_Ref, Typ => Comp_Typ);
5138 end Build_Finalization_Call;
5144 procedure Build_Indices is
5146 -- Generate the following identifiers:
5147 -- Jnn - for initialization
5148 -- Fnn - for finalization
5150 for Dim in 1 .. Num_Dims loop
5151 Append_To (Index_List,
5152 Make_Defining_Identifier (Loc, New_External_Name ('J', Dim)));
5154 Append_To (Final_List,
5155 Make_Defining_Identifier (Loc, New_External_Name ('F', Dim)));
5159 -------------------------------
5160 -- Build_Initialization_Call --
5161 -------------------------------
5163 function Build_Initialization_Call return Node_Id is
5164 Comp_Ref : constant Node_Id :=
5165 Make_Indexed_Component (Loc,
5166 Prefix => Make_Identifier (Loc, Name_V),
5167 Expressions => New_References_To (Index_List, Loc));
5170 Set_Etype (Comp_Ref, Comp_Typ);
5173 -- [Deep_]Initialize (V (J1, ..., JN));
5175 return Make_Init_Call (Obj_Ref => Comp_Ref, Typ => Comp_Typ);
5176 end Build_Initialization_Call;
5178 -- Start of processing for Build_Initialize_Statements
5183 Counter_Id := Make_Temporary (Loc, 'C');
5185 if Exceptions_OK then
5186 Finalizer_Decls := New_List;
5187 Build_Object_Declarations (Finalizer_Data, Finalizer_Decls, Loc);
5190 -- Generate the block which houses the finalization call, the index
5191 -- guard and the handler which triggers Program_Error later on.
5193 -- if Counter > 0 then
5194 -- Counter := Counter - 1;
5196 -- [Deep_]Finalize (V (F1, ..., FN)); -- No_Except_Propagation
5198 -- begin -- Exceptions allowed
5199 -- [Deep_]Finalize (V (F1, ..., FN));
5202 -- if not Raised then
5204 -- Save_Occurrence (E, Get_Current_Excep.all.all);
5209 if Exceptions_OK then
5211 Make_Block_Statement (Loc,
5212 Handled_Statement_Sequence =>
5213 Make_Handled_Sequence_Of_Statements (Loc,
5214 Statements => New_List (Build_Finalization_Call),
5215 Exception_Handlers => New_List (
5216 Build_Exception_Handler (Finalizer_Data))));
5218 Fin_Stmt := Build_Finalization_Call;
5221 -- This is the core of the loop, the dimension iterators are added
5222 -- one by one in reverse.
5225 Make_If_Statement (Loc,
5228 Left_Opnd => New_Reference_To (Counter_Id, Loc),
5229 Right_Opnd => Make_Integer_Literal (Loc, 0)),
5231 Then_Statements => New_List (
5232 Make_Assignment_Statement (Loc,
5233 Name => New_Reference_To (Counter_Id, Loc),
5235 Make_Op_Subtract (Loc,
5236 Left_Opnd => New_Reference_To (Counter_Id, Loc),
5237 Right_Opnd => Make_Integer_Literal (Loc, 1)))),
5239 Else_Statements => New_List (Fin_Stmt));
5241 -- Generate all finalization loops starting from the innermost
5244 -- for Fnn in reverse V'Range (Dim) loop
5248 F := Last (Final_List);
5250 while Present (F) and then Dim > 0 loop
5256 Make_Loop_Statement (Loc,
5258 Make_Iteration_Scheme (Loc,
5259 Loop_Parameter_Specification =>
5260 Make_Loop_Parameter_Specification (Loc,
5261 Defining_Identifier => Loop_Id,
5262 Discrete_Subtype_Definition =>
5263 Make_Attribute_Reference (Loc,
5264 Prefix => Make_Identifier (Loc, Name_V),
5265 Attribute_Name => Name_Range,
5266 Expressions => New_List (
5267 Make_Integer_Literal (Loc, Dim))),
5269 Reverse_Present => True)),
5271 Statements => New_List (Final_Loop),
5272 End_Label => Empty);
5277 -- Generate the block which contains the finalization loops, the
5278 -- declarations of the abort flag, the exception occurrence, the
5279 -- raised flag and the conditional raise.
5282 -- Abort : constant Boolean := Triggered_By_Abort;
5284 -- Abort : constant Boolean := False; -- no abort
5286 -- E : Exception_Occurrence;
5287 -- Raised : Boolean := False;
5293 -- V'Length (N) - Counter;
5297 -- if Raised and then not Abort then -- Exception handlers OK
5298 -- Raise_From_Controlled_Operation (E);
5301 -- raise; -- Exception handlers OK
5304 Stmts := New_List (Build_Counter_Assignment, Final_Loop);
5306 if Exceptions_OK then
5308 Build_Raise_Statement (Finalizer_Data));
5309 Append_To (Stmts, Make_Raise_Statement (Loc));
5313 Make_Block_Statement (Loc,
5316 Handled_Statement_Sequence =>
5317 Make_Handled_Sequence_Of_Statements (Loc, Statements => Stmts));
5319 -- Generate the block which contains the initialization call and
5320 -- the partial finalization code.
5323 -- [Deep_]Initialize (V (J1, ..., JN));
5325 -- Counter := Counter + 1;
5329 -- <finalization code>
5333 Make_Block_Statement (Loc,
5334 Handled_Statement_Sequence =>
5335 Make_Handled_Sequence_Of_Statements (Loc,
5336 Statements => New_List (Build_Initialization_Call),
5337 Exception_Handlers => New_List (
5338 Make_Exception_Handler (Loc,
5339 Exception_Choices => New_List (Make_Others_Choice (Loc)),
5340 Statements => New_List (Final_Block)))));
5342 Append_To (Statements (Handled_Statement_Sequence (Init_Loop)),
5343 Make_Assignment_Statement (Loc,
5344 Name => New_Reference_To (Counter_Id, Loc),
5347 Left_Opnd => New_Reference_To (Counter_Id, Loc),
5348 Right_Opnd => Make_Integer_Literal (Loc, 1))));
5350 -- Generate all initialization loops starting from the innermost
5353 -- for Jnn in V'Range (Dim) loop
5357 J := Last (Index_List);
5359 while Present (J) and then Dim > 0 loop
5365 Make_Loop_Statement (Loc,
5367 Make_Iteration_Scheme (Loc,
5368 Loop_Parameter_Specification =>
5369 Make_Loop_Parameter_Specification (Loc,
5370 Defining_Identifier => Loop_Id,
5371 Discrete_Subtype_Definition =>
5372 Make_Attribute_Reference (Loc,
5373 Prefix => Make_Identifier (Loc, Name_V),
5374 Attribute_Name => Name_Range,
5375 Expressions => New_List (
5376 Make_Integer_Literal (Loc, Dim))))),
5378 Statements => New_List (Init_Loop),
5379 End_Label => Empty);
5384 -- Generate the block which contains the counter variable and the
5385 -- initialization loops.
5388 -- Counter : Integer := 0;
5395 Make_Block_Statement (Loc,
5396 Declarations => New_List (
5397 Make_Object_Declaration (Loc,
5398 Defining_Identifier => Counter_Id,
5399 Object_Definition =>
5400 New_Reference_To (Standard_Integer, Loc),
5401 Expression => Make_Integer_Literal (Loc, 0))),
5403 Handled_Statement_Sequence =>
5404 Make_Handled_Sequence_Of_Statements (Loc,
5405 Statements => New_List (Init_Loop))));
5406 end Build_Initialize_Statements;
5408 -----------------------
5409 -- New_References_To --
5410 -----------------------
5412 function New_References_To
5414 Loc : Source_Ptr) return List_Id
5416 Refs : constant List_Id := New_List;
5421 while Present (Id) loop
5422 Append_To (Refs, New_Reference_To (Id, Loc));
5427 end New_References_To;
5429 -- Start of processing for Make_Deep_Array_Body
5433 when Address_Case =>
5434 return Make_Finalize_Address_Stmts (Typ);
5438 return Build_Adjust_Or_Finalize_Statements (Typ);
5440 when Initialize_Case =>
5441 return Build_Initialize_Statements (Typ);
5443 end Make_Deep_Array_Body;
5445 --------------------
5446 -- Make_Deep_Proc --
5447 --------------------
5449 function Make_Deep_Proc
5450 (Prim : Final_Primitives;
5452 Stmts : List_Id) return Entity_Id
5454 Loc : constant Source_Ptr := Sloc (Typ);
5456 Proc_Id : Entity_Id;
5459 -- Create the object formal, generate:
5460 -- V : System.Address
5462 if Prim = Address_Case then
5463 Formals := New_List (
5464 Make_Parameter_Specification (Loc,
5465 Defining_Identifier => Make_Defining_Identifier (Loc, Name_V),
5466 Parameter_Type => New_Reference_To (RTE (RE_Address), Loc)));
5473 Formals := New_List (
5474 Make_Parameter_Specification (Loc,
5475 Defining_Identifier => Make_Defining_Identifier (Loc, Name_V),
5477 Out_Present => True,
5478 Parameter_Type => New_Reference_To (Typ, Loc)));
5480 -- F : Boolean := True
5482 if Prim = Adjust_Case
5483 or else Prim = Finalize_Case
5486 Make_Parameter_Specification (Loc,
5487 Defining_Identifier => Make_Defining_Identifier (Loc, Name_F),
5489 New_Reference_To (Standard_Boolean, Loc),
5491 New_Reference_To (Standard_True, Loc)));
5496 Make_Defining_Identifier (Loc,
5497 Chars => Make_TSS_Name (Typ, Deep_Name_Of (Prim)));
5500 -- procedure Deep_Initialize / Adjust / Finalize (V : in out <typ>) is
5503 -- exception -- Finalize and Adjust cases only
5504 -- raise Program_Error;
5505 -- end Deep_Initialize / Adjust / Finalize;
5509 -- procedure Finalize_Address (V : System.Address) is
5512 -- end Finalize_Address;
5515 Make_Subprogram_Body (Loc,
5517 Make_Procedure_Specification (Loc,
5518 Defining_Unit_Name => Proc_Id,
5519 Parameter_Specifications => Formals),
5521 Declarations => Empty_List,
5523 Handled_Statement_Sequence =>
5524 Make_Handled_Sequence_Of_Statements (Loc, Statements => Stmts)));
5529 ---------------------------
5530 -- Make_Deep_Record_Body --
5531 ---------------------------
5533 function Make_Deep_Record_Body
5534 (Prim : Final_Primitives;
5536 Is_Local : Boolean := False) return List_Id
5538 function Build_Adjust_Statements (Typ : Entity_Id) return List_Id;
5539 -- Build the statements necessary to adjust a record type. The type may
5540 -- have discriminants and contain variant parts. Generate:
5544 -- [Deep_]Adjust (V.Comp_1);
5546 -- when Id : others =>
5547 -- if not Raised then
5549 -- Save_Occurrence (E, Get_Current_Excep.all.all);
5554 -- [Deep_]Adjust (V.Comp_N);
5556 -- when Id : others =>
5557 -- if not Raised then
5559 -- Save_Occurrence (E, Get_Current_Excep.all.all);
5564 -- Deep_Adjust (V._parent, False); -- If applicable
5566 -- when Id : others =>
5567 -- if not Raised then
5569 -- Save_Occurrence (E, Get_Current_Excep.all.all);
5575 -- Adjust (V); -- If applicable
5578 -- if not Raised then
5580 -- Save_Occurence (E, Get_Current_Excep.all.all);
5585 -- if Raised and then not Abort then
5586 -- Raise_From_Controlled_Operation (E);
5590 function Build_Finalize_Statements (Typ : Entity_Id) return List_Id;
5591 -- Build the statements necessary to finalize a record type. The type
5592 -- may have discriminants and contain variant parts. Generate:
5595 -- Abort : constant Boolean := Triggered_By_Abort;
5597 -- Abort : constant Boolean := False; -- no abort
5598 -- E : Exception_Occurence;
5599 -- Raised : Boolean := False;
5604 -- Finalize (V); -- If applicable
5607 -- if not Raised then
5609 -- Save_Occurence (E, Get_Current_Excep.all.all);
5614 -- case Variant_1 is
5616 -- case State_Counter_N => -- If Is_Local is enabled
5626 -- <<LN>> -- If Is_Local is enabled
5628 -- [Deep_]Finalize (V.Comp_N);
5631 -- if not Raised then
5633 -- Save_Occurence (E, Get_Current_Excep.all.all);
5639 -- [Deep_]Finalize (V.Comp_1);
5642 -- if not Raised then
5644 -- Save_Occurence (E, Get_Current_Excep.all.all);
5650 -- case State_Counter_1 => -- If Is_Local is enabled
5656 -- Deep_Finalize (V._parent, False); -- If applicable
5658 -- when Id : others =>
5659 -- if not Raised then
5661 -- Save_Occurrence (E, Get_Current_Excep.all.all);
5665 -- if Raised and then not Abort then
5666 -- Raise_From_Controlled_Operation (E);
5670 function Parent_Field_Type (Typ : Entity_Id) return Entity_Id;
5671 -- Given a derived tagged type Typ, traverse all components, find field
5672 -- _parent and return its type.
5674 procedure Preprocess_Components
5676 Num_Comps : out Int;
5677 Has_POC : out Boolean);
5678 -- Examine all components in component list Comps, count all controlled
5679 -- components and determine whether at least one of them is per-object
5680 -- constrained. Component _parent is always skipped.
5682 -----------------------------
5683 -- Build_Adjust_Statements --
5684 -----------------------------
5686 function Build_Adjust_Statements (Typ : Entity_Id) return List_Id is
5687 Loc : constant Source_Ptr := Sloc (Typ);
5688 Typ_Def : constant Node_Id := Type_Definition (Parent (Typ));
5689 Bod_Stmts : List_Id;
5690 Finalizer_Data : Finalization_Exception_Data;
5691 Finalizer_Decls : List_Id := No_List;
5695 Exceptions_OK : constant Boolean :=
5696 not Restriction_Active (No_Exception_Propagation);
5698 function Process_Component_List_For_Adjust
5699 (Comps : Node_Id) return List_Id;
5700 -- Build all necessary adjust statements for a single component list
5702 ---------------------------------------
5703 -- Process_Component_List_For_Adjust --
5704 ---------------------------------------
5706 function Process_Component_List_For_Adjust
5707 (Comps : Node_Id) return List_Id
5709 Stmts : constant List_Id := New_List;
5711 Decl_Id : Entity_Id;
5712 Decl_Typ : Entity_Id;
5716 procedure Process_Component_For_Adjust (Decl : Node_Id);
5717 -- Process the declaration of a single controlled component
5719 ----------------------------------
5720 -- Process_Component_For_Adjust --
5721 ----------------------------------
5723 procedure Process_Component_For_Adjust (Decl : Node_Id) is
5724 Id : constant Entity_Id := Defining_Identifier (Decl);
5725 Typ : constant Entity_Id := Etype (Id);
5730 -- [Deep_]Adjust (V.Id); -- No_Exception_Propagation
5732 -- begin -- Exception handlers allowed
5733 -- [Deep_]Adjust (V.Id);
5736 -- if not Raised then
5738 -- Save_Occurrence (E, Get_Current_Excep.all.all);
5745 Make_Selected_Component (Loc,
5746 Prefix => Make_Identifier (Loc, Name_V),
5747 Selector_Name => Make_Identifier (Loc, Chars (Id))),
5750 if Exceptions_OK then
5752 Make_Block_Statement (Loc,
5753 Handled_Statement_Sequence =>
5754 Make_Handled_Sequence_Of_Statements (Loc,
5755 Statements => New_List (Adj_Stmt),
5756 Exception_Handlers => New_List (
5757 Build_Exception_Handler (Finalizer_Data))));
5760 Append_To (Stmts, Adj_Stmt);
5761 end Process_Component_For_Adjust;
5763 -- Start of processing for Process_Component_List_For_Adjust
5766 -- Perform an initial check, determine the number of controlled
5767 -- components in the current list and whether at least one of them
5768 -- is per-object constrained.
5770 Preprocess_Components (Comps, Num_Comps, Has_POC);
5772 -- The processing in this routine is done in the following order:
5773 -- 1) Regular components
5774 -- 2) Per-object constrained components
5777 if Num_Comps > 0 then
5779 -- Process all regular components in order of declarations
5781 Decl := First_Non_Pragma (Component_Items (Comps));
5782 while Present (Decl) loop
5783 Decl_Id := Defining_Identifier (Decl);
5784 Decl_Typ := Etype (Decl_Id);
5786 -- Skip _parent as well as per-object constrained components
5788 if Chars (Decl_Id) /= Name_uParent
5789 and then Needs_Finalization (Decl_Typ)
5791 if Has_Access_Constraint (Decl_Id)
5792 and then No (Expression (Decl))
5796 Process_Component_For_Adjust (Decl);
5800 Next_Non_Pragma (Decl);
5803 -- Process all per-object constrained components in order of
5807 Decl := First_Non_Pragma (Component_Items (Comps));
5808 while Present (Decl) loop
5809 Decl_Id := Defining_Identifier (Decl);
5810 Decl_Typ := Etype (Decl_Id);
5814 if Chars (Decl_Id) /= Name_uParent
5815 and then Needs_Finalization (Decl_Typ)
5816 and then Has_Access_Constraint (Decl_Id)
5817 and then No (Expression (Decl))
5819 Process_Component_For_Adjust (Decl);
5822 Next_Non_Pragma (Decl);
5827 -- Process all variants, if any
5830 if Present (Variant_Part (Comps)) then
5832 Var_Alts : constant List_Id := New_List;
5836 Var := First_Non_Pragma (Variants (Variant_Part (Comps)));
5837 while Present (Var) loop
5840 -- when <discrete choices> =>
5841 -- <adjust statements>
5843 Append_To (Var_Alts,
5844 Make_Case_Statement_Alternative (Loc,
5846 New_Copy_List (Discrete_Choices (Var)),
5848 Process_Component_List_For_Adjust (
5849 Component_List (Var))));
5851 Next_Non_Pragma (Var);
5855 -- case V.<discriminant> is
5856 -- when <discrete choices 1> =>
5857 -- <adjust statements 1>
5859 -- when <discrete choices N> =>
5860 -- <adjust statements N>
5864 Make_Case_Statement (Loc,
5866 Make_Selected_Component (Loc,
5867 Prefix => Make_Identifier (Loc, Name_V),
5869 Make_Identifier (Loc,
5870 Chars => Chars (Name (Variant_Part (Comps))))),
5871 Alternatives => Var_Alts);
5875 -- Add the variant case statement to the list of statements
5877 if Present (Var_Case) then
5878 Append_To (Stmts, Var_Case);
5881 -- If the component list did not have any controlled components
5882 -- nor variants, return null.
5884 if Is_Empty_List (Stmts) then
5885 Append_To (Stmts, Make_Null_Statement (Loc));
5889 end Process_Component_List_For_Adjust;
5891 -- Start of processing for Build_Adjust_Statements
5894 if Exceptions_OK then
5895 Finalizer_Decls := New_List;
5896 Build_Object_Declarations (Finalizer_Data, Finalizer_Decls, Loc);
5899 if Nkind (Typ_Def) = N_Derived_Type_Definition then
5900 Rec_Def := Record_Extension_Part (Typ_Def);
5905 -- Create an adjust sequence for all record components
5907 if Present (Component_List (Rec_Def)) then
5909 Process_Component_List_For_Adjust (Component_List (Rec_Def));
5912 -- A derived record type must adjust all inherited components. This
5913 -- action poses the following problem:
5915 -- procedure Deep_Adjust (Obj : in out Parent_Typ) is
5920 -- procedure Deep_Adjust (Obj : in out Derived_Typ) is
5922 -- Deep_Adjust (Obj._parent);
5927 -- Adjusting the derived type will invoke Adjust of the parent and
5928 -- then that of the derived type. This is undesirable because both
5929 -- routines may modify shared components. Only the Adjust of the
5930 -- derived type should be invoked.
5932 -- To prevent this double adjustment of shared components,
5933 -- Deep_Adjust uses a flag to control the invocation of Adjust:
5935 -- procedure Deep_Adjust
5936 -- (Obj : in out Some_Type;
5937 -- Flag : Boolean := True)
5945 -- When Deep_Adjust is invokes for field _parent, a value of False is
5946 -- provided for the flag:
5948 -- Deep_Adjust (Obj._parent, False);
5950 if Is_Tagged_Type (Typ) and then Is_Derived_Type (Typ) then
5952 Par_Typ : constant Entity_Id := Parent_Field_Type (Typ);
5957 if Needs_Finalization (Par_Typ) then
5961 Make_Selected_Component (Loc,
5962 Prefix => Make_Identifier (Loc, Name_V),
5964 Make_Identifier (Loc, Name_uParent)),
5966 For_Parent => True);
5969 -- Deep_Adjust (V._parent, False); -- No_Except_Propagat
5971 -- begin -- Exceptions OK
5972 -- Deep_Adjust (V._parent, False);
5974 -- when Id : others =>
5975 -- if not Raised then
5977 -- Save_Occurrence (E,
5978 -- Get_Current_Excep.all.all);
5982 if Present (Call) then
5985 if Exceptions_OK then
5987 Make_Block_Statement (Loc,
5988 Handled_Statement_Sequence =>
5989 Make_Handled_Sequence_Of_Statements (Loc,
5990 Statements => New_List (Adj_Stmt),
5991 Exception_Handlers => New_List (
5992 Build_Exception_Handler
5993 (Finalizer_Data))));
5996 Prepend_To (Bod_Stmts, Adj_Stmt);
6002 -- Adjust the object. This action must be performed last after all
6003 -- components have been adjusted.
6005 if Is_Controlled (Typ) then
6011 Proc := Find_Prim_Op (Typ, Name_Adjust);
6015 -- Adjust (V); -- No_Exception_Propagation
6017 -- begin -- Exception handlers allowed
6021 -- if not Raised then
6023 -- Save_Occurrence (E,
6024 -- Get_Current_Excep.all.all);
6029 if Present (Proc) then
6031 Make_Procedure_Call_Statement (Loc,
6032 Name => New_Reference_To (Proc, Loc),
6033 Parameter_Associations => New_List (
6034 Make_Identifier (Loc, Name_V)));
6036 if Exceptions_OK then
6038 Make_Block_Statement (Loc,
6039 Handled_Statement_Sequence =>
6040 Make_Handled_Sequence_Of_Statements (Loc,
6041 Statements => New_List (Adj_Stmt),
6042 Exception_Handlers => New_List (
6043 Build_Exception_Handler
6044 (Finalizer_Data))));
6047 Append_To (Bod_Stmts,
6048 Make_If_Statement (Loc,
6049 Condition => Make_Identifier (Loc, Name_F),
6050 Then_Statements => New_List (Adj_Stmt)));
6055 -- At this point either all adjustment statements have been generated
6056 -- or the type is not controlled.
6058 if Is_Empty_List (Bod_Stmts) then
6059 Append_To (Bod_Stmts, Make_Null_Statement (Loc));
6065 -- Abort : constant Boolean := Triggered_By_Abort;
6067 -- Abort : constant Boolean := False; -- no abort
6069 -- E : Exception_Occurence;
6070 -- Raised : Boolean := False;
6073 -- <adjust statements>
6075 -- if Raised and then not Abort then
6076 -- Raise_From_Controlled_Operation (E);
6081 if Exceptions_OK then
6082 Append_To (Bod_Stmts,
6083 Build_Raise_Statement (Finalizer_Data));
6088 Make_Block_Statement (Loc,
6091 Handled_Statement_Sequence =>
6092 Make_Handled_Sequence_Of_Statements (Loc, Bod_Stmts)));
6094 end Build_Adjust_Statements;
6096 -------------------------------
6097 -- Build_Finalize_Statements --
6098 -------------------------------
6100 function Build_Finalize_Statements (Typ : Entity_Id) return List_Id is
6101 Loc : constant Source_Ptr := Sloc (Typ);
6102 Typ_Def : constant Node_Id := Type_Definition (Parent (Typ));
6103 Bod_Stmts : List_Id;
6105 Finalizer_Data : Finalization_Exception_Data;
6106 Finalizer_Decls : List_Id := No_List;
6110 Exceptions_OK : constant Boolean :=
6111 not Restriction_Active (No_Exception_Propagation);
6113 function Process_Component_List_For_Finalize
6114 (Comps : Node_Id) return List_Id;
6115 -- Build all necessary finalization statements for a single component
6116 -- list. The statements may include a jump circuitry if flag Is_Local
6119 -----------------------------------------
6120 -- Process_Component_List_For_Finalize --
6121 -----------------------------------------
6123 function Process_Component_List_For_Finalize
6124 (Comps : Node_Id) return List_Id
6127 Counter_Id : Entity_Id;
6129 Decl_Id : Entity_Id;
6130 Decl_Typ : Entity_Id;
6133 Jump_Block : Node_Id;
6135 Label_Id : Entity_Id;
6139 procedure Process_Component_For_Finalize
6144 -- Process the declaration of a single controlled component. If
6145 -- flag Is_Local is enabled, create the corresponding label and
6146 -- jump circuitry. Alts is the list of case alternatives, Decls
6147 -- is the top level declaration list where labels are declared
6148 -- and Stmts is the list of finalization actions.
6150 ------------------------------------
6151 -- Process_Component_For_Finalize --
6152 ------------------------------------
6154 procedure Process_Component_For_Finalize
6160 Id : constant Entity_Id := Defining_Identifier (Decl);
6161 Typ : constant Entity_Id := Etype (Id);
6168 Label_Id : Entity_Id;
6175 Make_Identifier (Loc,
6176 Chars => New_External_Name ('L', Num_Comps));
6177 Set_Entity (Label_Id,
6178 Make_Defining_Identifier (Loc, Chars (Label_Id)));
6179 Label := Make_Label (Loc, Label_Id);
6182 Make_Implicit_Label_Declaration (Loc,
6183 Defining_Identifier => Entity (Label_Id),
6184 Label_Construct => Label));
6191 Make_Case_Statement_Alternative (Loc,
6192 Discrete_Choices => New_List (
6193 Make_Integer_Literal (Loc, Num_Comps)),
6195 Statements => New_List (
6196 Make_Goto_Statement (Loc,
6198 New_Reference_To (Entity (Label_Id), Loc)))));
6203 Append_To (Stmts, Label);
6205 -- Decrease the number of components to be processed.
6206 -- This action yields a new Label_Id in future calls.
6208 Num_Comps := Num_Comps - 1;
6213 -- [Deep_]Finalize (V.Id); -- No_Exception_Propagation
6215 -- begin -- Exception handlers allowed
6216 -- [Deep_]Finalize (V.Id);
6219 -- if not Raised then
6221 -- Save_Occurrence (E,
6222 -- Get_Current_Excep.all.all);
6229 Make_Selected_Component (Loc,
6230 Prefix => Make_Identifier (Loc, Name_V),
6231 Selector_Name => Make_Identifier (Loc, Chars (Id))),
6234 if not Restriction_Active (No_Exception_Propagation) then
6236 Make_Block_Statement (Loc,
6237 Handled_Statement_Sequence =>
6238 Make_Handled_Sequence_Of_Statements (Loc,
6239 Statements => New_List (Fin_Stmt),
6240 Exception_Handlers => New_List (
6241 Build_Exception_Handler (Finalizer_Data))));
6244 Append_To (Stmts, Fin_Stmt);
6245 end Process_Component_For_Finalize;
6247 -- Start of processing for Process_Component_List_For_Finalize
6250 -- Perform an initial check, look for controlled and per-object
6251 -- constrained components.
6253 Preprocess_Components (Comps, Num_Comps, Has_POC);
6255 -- Create a state counter to service the current component list.
6256 -- This step is performed before the variants are inspected in
6257 -- order to generate the same state counter names as those from
6258 -- Build_Initialize_Statements.
6263 Counter := Counter + 1;
6266 Make_Defining_Identifier (Loc,
6267 Chars => New_External_Name ('C', Counter));
6270 -- Process the component in the following order:
6272 -- 2) Per-object constrained components
6273 -- 3) Regular components
6275 -- Start with the variant parts
6278 if Present (Variant_Part (Comps)) then
6280 Var_Alts : constant List_Id := New_List;
6284 Var := First_Non_Pragma (Variants (Variant_Part (Comps)));
6285 while Present (Var) loop
6288 -- when <discrete choices> =>
6289 -- <finalize statements>
6291 Append_To (Var_Alts,
6292 Make_Case_Statement_Alternative (Loc,
6294 New_Copy_List (Discrete_Choices (Var)),
6296 Process_Component_List_For_Finalize (
6297 Component_List (Var))));
6299 Next_Non_Pragma (Var);
6303 -- case V.<discriminant> is
6304 -- when <discrete choices 1> =>
6305 -- <finalize statements 1>
6307 -- when <discrete choices N> =>
6308 -- <finalize statements N>
6312 Make_Case_Statement (Loc,
6314 Make_Selected_Component (Loc,
6315 Prefix => Make_Identifier (Loc, Name_V),
6317 Make_Identifier (Loc,
6318 Chars => Chars (Name (Variant_Part (Comps))))),
6319 Alternatives => Var_Alts);
6323 -- The current component list does not have a single controlled
6324 -- component, however it may contain variants. Return the case
6325 -- statement for the variants or nothing.
6327 if Num_Comps = 0 then
6328 if Present (Var_Case) then
6329 return New_List (Var_Case);
6331 return New_List (Make_Null_Statement (Loc));
6335 -- Prepare all lists
6341 -- Process all per-object constrained components in reverse order
6344 Decl := Last_Non_Pragma (Component_Items (Comps));
6345 while Present (Decl) loop
6346 Decl_Id := Defining_Identifier (Decl);
6347 Decl_Typ := Etype (Decl_Id);
6351 if Chars (Decl_Id) /= Name_uParent
6352 and then Needs_Finalization (Decl_Typ)
6353 and then Has_Access_Constraint (Decl_Id)
6354 and then No (Expression (Decl))
6356 Process_Component_For_Finalize (Decl, Alts, Decls, Stmts);
6359 Prev_Non_Pragma (Decl);
6363 -- Process the rest of the components in reverse order
6365 Decl := Last_Non_Pragma (Component_Items (Comps));
6366 while Present (Decl) loop
6367 Decl_Id := Defining_Identifier (Decl);
6368 Decl_Typ := Etype (Decl_Id);
6372 if Chars (Decl_Id) /= Name_uParent
6373 and then Needs_Finalization (Decl_Typ)
6375 -- Skip per-object constrained components since they were
6376 -- handled in the above step.
6378 if Has_Access_Constraint (Decl_Id)
6379 and then No (Expression (Decl))
6383 Process_Component_For_Finalize (Decl, Alts, Decls, Stmts);
6387 Prev_Non_Pragma (Decl);
6392 -- LN : label; -- If Is_Local is enabled
6397 -- case CounterX is .
6407 -- <<LN>> -- If Is_Local is enabled
6409 -- [Deep_]Finalize (V.CompY);
6411 -- when Id : others =>
6412 -- if not Raised then
6414 -- Save_Occurrence (E,
6415 -- Get_Current_Excep.all.all);
6419 -- <<L0>> -- If Is_Local is enabled
6424 -- Add the declaration of default jump location L0, its
6425 -- corresponding alternative and its place in the statements.
6427 Label_Id := Make_Identifier (Loc, New_External_Name ('L', 0));
6428 Set_Entity (Label_Id,
6429 Make_Defining_Identifier (Loc, Chars (Label_Id)));
6430 Label := Make_Label (Loc, Label_Id);
6432 Append_To (Decls, -- declaration
6433 Make_Implicit_Label_Declaration (Loc,
6434 Defining_Identifier => Entity (Label_Id),
6435 Label_Construct => Label));
6437 Append_To (Alts, -- alternative
6438 Make_Case_Statement_Alternative (Loc,
6439 Discrete_Choices => New_List (
6440 Make_Others_Choice (Loc)),
6442 Statements => New_List (
6443 Make_Goto_Statement (Loc,
6444 Name => New_Reference_To (Entity (Label_Id), Loc)))));
6446 Append_To (Stmts, Label); -- statement
6448 -- Create the jump block
6451 Make_Case_Statement (Loc,
6452 Expression => Make_Identifier (Loc, Chars (Counter_Id)),
6453 Alternatives => Alts));
6457 Make_Block_Statement (Loc,
6458 Declarations => Decls,
6459 Handled_Statement_Sequence =>
6460 Make_Handled_Sequence_Of_Statements (Loc, Stmts));
6462 if Present (Var_Case) then
6463 return New_List (Var_Case, Jump_Block);
6465 return New_List (Jump_Block);
6467 end Process_Component_List_For_Finalize;
6469 -- Start of processing for Build_Finalize_Statements
6472 if Exceptions_OK then
6473 Finalizer_Decls := New_List;
6474 Build_Object_Declarations (Finalizer_Data, Finalizer_Decls, Loc);
6477 if Nkind (Typ_Def) = N_Derived_Type_Definition then
6478 Rec_Def := Record_Extension_Part (Typ_Def);
6483 -- Create a finalization sequence for all record components
6485 if Present (Component_List (Rec_Def)) then
6487 Process_Component_List_For_Finalize (Component_List (Rec_Def));
6490 -- A derived record type must finalize all inherited components. This
6491 -- action poses the following problem:
6493 -- procedure Deep_Finalize (Obj : in out Parent_Typ) is
6498 -- procedure Deep_Finalize (Obj : in out Derived_Typ) is
6500 -- Deep_Finalize (Obj._parent);
6505 -- Finalizing the derived type will invoke Finalize of the parent and
6506 -- then that of the derived type. This is undesirable because both
6507 -- routines may modify shared components. Only the Finalize of the
6508 -- derived type should be invoked.
6510 -- To prevent this double adjustment of shared components,
6511 -- Deep_Finalize uses a flag to control the invocation of Finalize:
6513 -- procedure Deep_Finalize
6514 -- (Obj : in out Some_Type;
6515 -- Flag : Boolean := True)
6523 -- When Deep_Finalize is invokes for field _parent, a value of False
6524 -- is provided for the flag:
6526 -- Deep_Finalize (Obj._parent, False);
6528 if Is_Tagged_Type (Typ)
6529 and then Is_Derived_Type (Typ)
6532 Par_Typ : constant Entity_Id := Parent_Field_Type (Typ);
6537 if Needs_Finalization (Par_Typ) then
6541 Make_Selected_Component (Loc,
6542 Prefix => Make_Identifier (Loc, Name_V),
6544 Make_Identifier (Loc, Name_uParent)),
6546 For_Parent => True);
6549 -- Deep_Finalize (V._parent, False); -- No_Except_Propag
6551 -- begin -- Exceptions OK
6552 -- Deep_Finalize (V._parent, False);
6554 -- when Id : others =>
6555 -- if not Raised then
6557 -- Save_Occurrence (E,
6558 -- Get_Current_Excep.all.all);
6562 if Present (Call) then
6565 if Exceptions_OK then
6567 Make_Block_Statement (Loc,
6568 Handled_Statement_Sequence =>
6569 Make_Handled_Sequence_Of_Statements (Loc,
6570 Statements => New_List (Fin_Stmt),
6571 Exception_Handlers => New_List (
6572 Build_Exception_Handler
6573 (Finalizer_Data))));
6576 Append_To (Bod_Stmts, Fin_Stmt);
6582 -- Finalize the object. This action must be performed first before
6583 -- all components have been finalized.
6585 if Is_Controlled (Typ)
6586 and then not Is_Local
6593 Proc := Find_Prim_Op (Typ, Name_Finalize);
6597 -- Finalize (V); -- No_Exception_Propagation
6603 -- if not Raised then
6605 -- Save_Occurrence (E,
6606 -- Get_Current_Excep.all.all);
6611 if Present (Proc) then
6613 Make_Procedure_Call_Statement (Loc,
6614 Name => New_Reference_To (Proc, Loc),
6615 Parameter_Associations => New_List (
6616 Make_Identifier (Loc, Name_V)));
6618 if Exceptions_OK then
6620 Make_Block_Statement (Loc,
6621 Handled_Statement_Sequence =>
6622 Make_Handled_Sequence_Of_Statements (Loc,
6623 Statements => New_List (Fin_Stmt),
6624 Exception_Handlers => New_List (
6625 Build_Exception_Handler
6626 (Finalizer_Data))));
6629 Prepend_To (Bod_Stmts,
6630 Make_If_Statement (Loc,
6631 Condition => Make_Identifier (Loc, Name_F),
6632 Then_Statements => New_List (Fin_Stmt)));
6637 -- At this point either all finalization statements have been
6638 -- generated or the type is not controlled.
6640 if No (Bod_Stmts) then
6641 return New_List (Make_Null_Statement (Loc));
6645 -- Abort : constant Boolean := Triggered_By_Abort;
6647 -- Abort : constant Boolean := False; -- no abort
6649 -- E : Exception_Occurence;
6650 -- Raised : Boolean := False;
6653 -- <finalize statements>
6655 -- if Raised and then not Abort then
6656 -- Raise_From_Controlled_Operation (E);
6661 if Exceptions_OK then
6662 Append_To (Bod_Stmts,
6663 Build_Raise_Statement (Finalizer_Data));
6668 Make_Block_Statement (Loc,
6671 Handled_Statement_Sequence =>
6672 Make_Handled_Sequence_Of_Statements (Loc, Bod_Stmts)));
6674 end Build_Finalize_Statements;
6676 -----------------------
6677 -- Parent_Field_Type --
6678 -----------------------
6680 function Parent_Field_Type (Typ : Entity_Id) return Entity_Id is
6684 Field := First_Entity (Typ);
6685 while Present (Field) loop
6686 if Chars (Field) = Name_uParent then
6687 return Etype (Field);
6690 Next_Entity (Field);
6693 -- A derived tagged type should always have a parent field
6695 raise Program_Error;
6696 end Parent_Field_Type;
6698 ---------------------------
6699 -- Preprocess_Components --
6700 ---------------------------
6702 procedure Preprocess_Components
6704 Num_Comps : out Int;
6705 Has_POC : out Boolean)
6715 Decl := First_Non_Pragma (Component_Items (Comps));
6716 while Present (Decl) loop
6717 Id := Defining_Identifier (Decl);
6720 -- Skip field _parent
6722 if Chars (Id) /= Name_uParent
6723 and then Needs_Finalization (Typ)
6725 Num_Comps := Num_Comps + 1;
6727 if Has_Access_Constraint (Id)
6728 and then No (Expression (Decl))
6734 Next_Non_Pragma (Decl);
6736 end Preprocess_Components;
6738 -- Start of processing for Make_Deep_Record_Body
6742 when Address_Case =>
6743 return Make_Finalize_Address_Stmts (Typ);
6746 return Build_Adjust_Statements (Typ);
6748 when Finalize_Case =>
6749 return Build_Finalize_Statements (Typ);
6751 when Initialize_Case =>
6753 Loc : constant Source_Ptr := Sloc (Typ);
6756 if Is_Controlled (Typ) then
6758 Make_Procedure_Call_Statement (Loc,
6761 (Find_Prim_Op (Typ, Name_Of (Prim)), Loc),
6762 Parameter_Associations => New_List (
6763 Make_Identifier (Loc, Name_V))));
6769 end Make_Deep_Record_Body;
6771 ----------------------
6772 -- Make_Final_Call --
6773 ----------------------
6775 function Make_Final_Call
6778 For_Parent : Boolean := False) return Node_Id
6780 Loc : constant Source_Ptr := Sloc (Obj_Ref);
6782 Fin_Id : Entity_Id := Empty;
6787 -- Recover the proper type which contains [Deep_]Finalize
6789 if Is_Class_Wide_Type (Typ) then
6790 Utyp := Root_Type (Typ);
6794 elsif Is_Concurrent_Type (Typ) then
6795 Utyp := Corresponding_Record_Type (Typ);
6797 Ref := Convert_Concurrent (Obj_Ref, Typ);
6799 elsif Is_Private_Type (Typ)
6800 and then Present (Full_View (Typ))
6801 and then Is_Concurrent_Type (Full_View (Typ))
6803 Utyp := Corresponding_Record_Type (Full_View (Typ));
6805 Ref := Convert_Concurrent (Obj_Ref, Full_View (Typ));
6813 Utyp := Underlying_Type (Base_Type (Utyp));
6814 Set_Assignment_OK (Ref);
6816 -- Deal with non-tagged derivation of private views. If the parent type
6817 -- is a protected type, Deep_Finalize is found on the corresponding
6818 -- record of the ancestor.
6820 if Is_Untagged_Derivation (Typ) then
6821 if Is_Protected_Type (Typ) then
6822 Utyp := Corresponding_Record_Type (Root_Type (Base_Type (Typ)));
6824 Utyp := Underlying_Type (Root_Type (Base_Type (Typ)));
6826 if Is_Protected_Type (Utyp) then
6827 Utyp := Corresponding_Record_Type (Utyp);
6831 Ref := Unchecked_Convert_To (Utyp, Ref);
6832 Set_Assignment_OK (Ref);
6835 -- Deal with derived private types which do not inherit primitives from
6836 -- their parents. In this case, [Deep_]Finalize can be found in the full
6837 -- view of the parent type.
6839 if Is_Tagged_Type (Utyp)
6840 and then Is_Derived_Type (Utyp)
6841 and then Is_Empty_Elmt_List (Primitive_Operations (Utyp))
6842 and then Is_Private_Type (Etype (Utyp))
6843 and then Present (Full_View (Etype (Utyp)))
6845 Utyp := Full_View (Etype (Utyp));
6846 Ref := Unchecked_Convert_To (Utyp, Ref);
6847 Set_Assignment_OK (Ref);
6850 -- When dealing with the completion of a private type, use the base type
6853 if Utyp /= Base_Type (Utyp) then
6854 pragma Assert (Present (Atyp) and then Is_Private_Type (Atyp));
6856 Utyp := Base_Type (Utyp);
6857 Ref := Unchecked_Convert_To (Utyp, Ref);
6858 Set_Assignment_OK (Ref);
6861 -- Select the appropriate version of finalize
6864 if Has_Controlled_Component (Utyp) then
6865 Fin_Id := Find_Prim_Op (Utyp, TSS_Deep_Finalize);
6868 -- Class-wide types, interfaces and types with controlled components
6870 elsif Is_Class_Wide_Type (Typ)
6871 or else Is_Interface (Typ)
6872 or else Has_Controlled_Component (Utyp)
6874 if Is_Tagged_Type (Utyp) then
6875 Fin_Id := Find_Prim_Op (Utyp, TSS_Deep_Finalize);
6877 Fin_Id := TSS (Utyp, TSS_Deep_Finalize);
6880 -- Derivations from [Limited_]Controlled
6882 elsif Is_Controlled (Utyp) then
6883 if Has_Controlled_Component (Utyp) then
6884 Fin_Id := Find_Prim_Op (Utyp, TSS_Deep_Finalize);
6886 Fin_Id := Find_Prim_Op (Utyp, Name_Of (Finalize_Case));
6891 elsif Is_Tagged_Type (Utyp) then
6892 Fin_Id := Find_Prim_Op (Utyp, TSS_Deep_Finalize);
6895 raise Program_Error;
6898 if Present (Fin_Id) then
6900 -- When finalizing a class-wide object, do not convert to the root
6901 -- type in order to produce a dispatching call.
6903 if Is_Class_Wide_Type (Typ) then
6906 -- Ensure that a finalization routine is at least decorated in order
6907 -- to inspect the object parameter.
6909 elsif Analyzed (Fin_Id)
6910 or else Ekind (Fin_Id) = E_Procedure
6912 -- In certain cases, such as the creation of Stream_Read, the
6913 -- visible entity of the type is its full view. Since Stream_Read
6914 -- will have to create an object of type Typ, the local object
6915 -- will be finalzed by the scope finalizer generated later on. The
6916 -- object parameter of Deep_Finalize will always use the private
6917 -- view of the type. To avoid such a clash between a private and a
6918 -- full view, perform an unchecked conversion of the object
6919 -- reference to the private view.
6922 Formal_Typ : constant Entity_Id :=
6923 Etype (First_Formal (Fin_Id));
6925 if Is_Private_Type (Formal_Typ)
6926 and then Present (Full_View (Formal_Typ))
6927 and then Full_View (Formal_Typ) = Utyp
6929 Ref := Unchecked_Convert_To (Formal_Typ, Ref);
6933 Ref := Convert_View (Fin_Id, Ref);
6936 return Make_Call (Loc, Fin_Id, New_Copy_Tree (Ref), For_Parent);
6940 end Make_Final_Call;
6942 --------------------------------
6943 -- Make_Finalize_Address_Body --
6944 --------------------------------
6946 procedure Make_Finalize_Address_Body (Typ : Entity_Id) is
6947 Is_Task : constant Boolean :=
6948 Ekind (Typ) = E_Record_Type
6949 and then Is_Concurrent_Record_Type (Typ)
6950 and then Ekind (Corresponding_Concurrent_Type (Typ)) =
6952 Loc : constant Source_Ptr := Sloc (Typ);
6953 Proc_Id : Entity_Id;
6957 -- The corresponding records of task types are not controlled by design.
6958 -- For the sake of completeness, create an empty Finalize_Address to be
6959 -- used in task class-wide allocations.
6964 -- Nothing to do if the type is not controlled or it already has a
6965 -- TSS entry for Finalize_Address. Skip class-wide subtypes which do not
6966 -- come from source. These are usually generated for completeness and
6967 -- do not need the Finalize_Address primitive.
6969 elsif not Needs_Finalization (Typ)
6970 or else Is_Abstract_Type (Typ)
6971 or else Present (TSS (Typ, TSS_Finalize_Address))
6973 (Is_Class_Wide_Type (Typ)
6974 and then Ekind (Root_Type (Typ)) = E_Record_Subtype
6975 and then not Comes_From_Source (Root_Type (Typ)))
6981 Make_Defining_Identifier (Loc,
6982 Make_TSS_Name (Typ, TSS_Finalize_Address));
6985 -- procedure <Typ>FD (V : System.Address) is
6987 -- null; -- for tasks
6989 -- declare -- for all other types
6990 -- type Pnn is access all Typ;
6991 -- for Pnn'Storage_Size use 0;
6993 -- [Deep_]Finalize (Pnn (V).all);
6998 Stmts := New_List (Make_Null_Statement (Loc));
7000 Stmts := Make_Finalize_Address_Stmts (Typ);
7004 Make_Subprogram_Body (Loc,
7006 Make_Procedure_Specification (Loc,
7007 Defining_Unit_Name => Proc_Id,
7009 Parameter_Specifications => New_List (
7010 Make_Parameter_Specification (Loc,
7011 Defining_Identifier =>
7012 Make_Defining_Identifier (Loc, Name_V),
7014 New_Reference_To (RTE (RE_Address), Loc)))),
7016 Declarations => No_List,
7018 Handled_Statement_Sequence =>
7019 Make_Handled_Sequence_Of_Statements (Loc,
7020 Statements => Stmts)));
7022 Set_TSS (Typ, Proc_Id);
7023 end Make_Finalize_Address_Body;
7025 ---------------------------------
7026 -- Make_Finalize_Address_Stmts --
7027 ---------------------------------
7029 function Make_Finalize_Address_Stmts (Typ : Entity_Id) return List_Id is
7030 Loc : constant Source_Ptr := Sloc (Typ);
7031 Ptr_Typ : constant Entity_Id := Make_Temporary (Loc, 'P');
7033 Desg_Typ : Entity_Id;
7036 function Alignment_Of (Some_Typ : Entity_Id) return Node_Id;
7037 -- Subsidiary routine, generate the following attribute reference:
7039 -- Some_Typ'Alignment
7041 function Double_Alignment_Of (Some_Typ : Entity_Id) return Node_Id;
7042 -- Subsidiary routine, generate the following expression:
7044 -- 2 * Some_Typ'Alignment
7050 function Alignment_Of (Some_Typ : Entity_Id) return Node_Id is
7053 Make_Attribute_Reference (Loc,
7054 Prefix => New_Reference_To (Some_Typ, Loc),
7055 Attribute_Name => Name_Alignment);
7058 -------------------------
7059 -- Double_Alignment_Of --
7060 -------------------------
7062 function Double_Alignment_Of (Some_Typ : Entity_Id) return Node_Id is
7065 Make_Op_Multiply (Loc,
7066 Left_Opnd => Make_Integer_Literal (Loc, 2),
7067 Right_Opnd => Alignment_Of (Some_Typ));
7068 end Double_Alignment_Of;
7070 -- Start of processing for Make_Finalize_Address_Stmts
7073 if Is_Array_Type (Typ) then
7074 if Is_Constrained (First_Subtype (Typ)) then
7075 Desg_Typ := First_Subtype (Typ);
7077 Desg_Typ := Base_Type (Typ);
7080 -- Class-wide types of constrained root types
7082 elsif Is_Class_Wide_Type (Typ)
7083 and then Has_Discriminants (Root_Type (Typ))
7085 Is_Empty_Elmt_List (Discriminant_Constraint (Root_Type (Typ)))
7088 Parent_Typ : Entity_Id := Root_Type (Typ);
7091 -- Climb the parent type chain looking for a non-constrained type
7093 while Parent_Typ /= Etype (Parent_Typ)
7094 and then Has_Discriminants (Parent_Typ)
7096 Is_Empty_Elmt_List (Discriminant_Constraint (Parent_Typ))
7098 Parent_Typ := Etype (Parent_Typ);
7101 -- Handle views created for tagged types with unknown
7104 if Is_Underlying_Record_View (Parent_Typ) then
7105 Parent_Typ := Underlying_Record_View (Parent_Typ);
7108 Desg_Typ := Class_Wide_Type (Underlying_Type (Parent_Typ));
7118 -- type Ptr_Typ is access all Typ;
7119 -- for Ptr_Typ'Storage_Size use 0;
7122 Make_Full_Type_Declaration (Loc,
7123 Defining_Identifier => Ptr_Typ,
7125 Make_Access_To_Object_Definition (Loc,
7126 All_Present => True,
7127 Subtype_Indication => New_Reference_To (Desg_Typ, Loc))),
7129 Make_Attribute_Definition_Clause (Loc,
7130 Name => New_Reference_To (Ptr_Typ, Loc),
7131 Chars => Name_Storage_Size,
7132 Expression => Make_Integer_Literal (Loc, 0)));
7134 Obj_Expr := Make_Identifier (Loc, Name_V);
7136 -- Unconstrained arrays require special processing in order to retrieve
7137 -- the elements. To achieve this, we have to skip the dope vector which
7138 -- lays in front of the elements and then use a thin pointer to perform
7139 -- the address-to-access conversion.
7141 if Is_Array_Type (Typ)
7142 and then not Is_Constrained (First_Subtype (Typ))
7145 Dope_Expr : Node_Id;
7146 Dope_Id : Entity_Id;
7147 For_First : Boolean := True;
7149 Index_Typ : Entity_Id;
7152 -- Ensure that Ptr_Typ a thin pointer, generate:
7154 -- for Ptr_Typ'Size use System.Address'Size;
7157 Make_Attribute_Definition_Clause (Loc,
7158 Name => New_Reference_To (Ptr_Typ, Loc),
7161 Make_Integer_Literal (Loc, System_Address_Size)));
7163 -- For unconstrained arrays, create the expression which computes
7164 -- the size of the dope vector.
7166 Index := First_Index (Typ);
7167 while Present (Index) loop
7168 Index_Typ := Etype (Index);
7170 -- Each bound has two values and a potential hole added to
7171 -- compensate for alignment differences.
7177 -- 2 * Index_Typ'Alignment
7179 Dope_Expr := Double_Alignment_Of (Index_Typ);
7183 -- Dope_Expr + 2 * Index_Typ'Alignment
7187 Left_Opnd => Dope_Expr,
7188 Right_Opnd => Double_Alignment_Of (Index_Typ));
7194 -- Round the cumulative alignment to the next higher multiple of
7195 -- the array alignment. Generate:
7197 -- ((Dope_Expr + Typ'Alignment - 1) / Typ'Alignment)
7201 Make_Op_Multiply (Loc,
7203 Make_Op_Divide (Loc,
7206 Left_Opnd => Dope_Expr,
7208 Make_Op_Subtract (Loc,
7209 Left_Opnd => Alignment_Of (Typ),
7210 Right_Opnd => Make_Integer_Literal (Loc, 1))),
7211 Right_Opnd => Alignment_Of (Typ)),
7212 Right_Opnd => Alignment_Of (Typ));
7215 -- Dnn : Storage_Offset := Dope_Expr;
7217 Dope_Id := Make_Temporary (Loc, 'D');
7220 Make_Object_Declaration (Loc,
7221 Defining_Identifier => Dope_Id,
7222 Constant_Present => True,
7223 Object_Definition =>
7224 New_Reference_To (RTE (RE_Storage_Offset), Loc),
7225 Expression => Dope_Expr));
7227 -- Shift the address from the start of the dope vector to the
7228 -- start of the elements:
7232 -- Note that this is done through a wrapper routine since RTSfind
7233 -- cannot retrieve operations with string names of the form "+".
7236 Make_Function_Call (Loc,
7238 New_Reference_To (RTE (RE_Add_Offset_To_Address), Loc),
7239 Parameter_Associations => New_List (
7241 New_Reference_To (Dope_Id, Loc)));
7245 -- Create the block and the finalization call
7248 Make_Block_Statement (Loc,
7249 Declarations => Decls,
7251 Handled_Statement_Sequence =>
7252 Make_Handled_Sequence_Of_Statements (Loc,
7253 Statements => New_List (
7256 Make_Explicit_Dereference (Loc,
7257 Prefix => Unchecked_Convert_To (Ptr_Typ, Obj_Expr)),
7258 Typ => Desg_Typ)))));
7259 end Make_Finalize_Address_Stmts;
7261 -------------------------------------
7262 -- Make_Handler_For_Ctrl_Operation --
7263 -------------------------------------
7267 -- when E : others =>
7268 -- Raise_From_Controlled_Operation (E);
7273 -- raise Program_Error [finalize raised exception];
7275 -- depending on whether Raise_From_Controlled_Operation is available
7277 function Make_Handler_For_Ctrl_Operation
7278 (Loc : Source_Ptr) return Node_Id
7281 -- Choice parameter (for the first case above)
7283 Raise_Node : Node_Id;
7284 -- Procedure call or raise statement
7287 -- Standard run-time, .NET/JVM targets: add choice parameter E and pass
7288 -- it to Raise_From_Controlled_Operation so that the original exception
7289 -- name and message can be recorded in the exception message for
7292 if RTE_Available (RE_Raise_From_Controlled_Operation) then
7293 E_Occ := Make_Defining_Identifier (Loc, Name_E);
7295 Make_Procedure_Call_Statement (Loc,
7298 (RTE (RE_Raise_From_Controlled_Operation), Loc),
7299 Parameter_Associations => New_List (
7300 New_Reference_To (E_Occ, Loc)));
7302 -- Restricted run-time: exception messages are not supported
7307 Make_Raise_Program_Error (Loc,
7308 Reason => PE_Finalize_Raised_Exception);
7312 Make_Implicit_Exception_Handler (Loc,
7313 Exception_Choices => New_List (Make_Others_Choice (Loc)),
7314 Choice_Parameter => E_Occ,
7315 Statements => New_List (Raise_Node));
7316 end Make_Handler_For_Ctrl_Operation;
7318 --------------------
7319 -- Make_Init_Call --
7320 --------------------
7322 function Make_Init_Call
7324 Typ : Entity_Id) return Node_Id
7326 Loc : constant Source_Ptr := Sloc (Obj_Ref);
7333 -- Deal with the type and object reference. Depending on the context, an
7334 -- object reference may need several conversions.
7336 if Is_Concurrent_Type (Typ) then
7338 Utyp := Corresponding_Record_Type (Typ);
7339 Ref := Convert_Concurrent (Obj_Ref, Typ);
7341 elsif Is_Private_Type (Typ)
7342 and then Present (Full_View (Typ))
7343 and then Is_Concurrent_Type (Underlying_Type (Typ))
7346 Utyp := Corresponding_Record_Type (Underlying_Type (Typ));
7347 Ref := Convert_Concurrent (Obj_Ref, Underlying_Type (Typ));
7355 Set_Assignment_OK (Ref);
7357 Utyp := Underlying_Type (Base_Type (Utyp));
7359 -- Deal with non-tagged derivation of private views
7361 if Is_Untagged_Derivation (Typ)
7362 and then not Is_Conc
7364 Utyp := Underlying_Type (Root_Type (Base_Type (Typ)));
7365 Ref := Unchecked_Convert_To (Utyp, Ref);
7367 -- The following is to prevent problems with UC see 1.156 RH ???
7369 Set_Assignment_OK (Ref);
7372 -- If the underlying_type is a subtype, then we are dealing with the
7373 -- completion of a private type. We need to access the base type and
7374 -- generate a conversion to it.
7376 if Utyp /= Base_Type (Utyp) then
7377 pragma Assert (Is_Private_Type (Typ));
7378 Utyp := Base_Type (Utyp);
7379 Ref := Unchecked_Convert_To (Utyp, Ref);
7382 -- Select the appropriate version of initialize
7384 if Has_Controlled_Component (Utyp) then
7385 Proc := TSS (Utyp, Deep_Name_Of (Initialize_Case));
7387 Proc := Find_Prim_Op (Utyp, Name_Of (Initialize_Case));
7388 Check_Visibly_Controlled (Initialize_Case, Typ, Proc, Ref);
7391 -- The object reference may need another conversion depending on the
7392 -- type of the formal and that of the actual.
7394 Ref := Convert_View (Proc, Ref);
7397 -- [Deep_]Initialize (Ref);
7400 Make_Procedure_Call_Statement (Loc,
7402 New_Reference_To (Proc, Loc),
7403 Parameter_Associations => New_List (Ref));
7406 ------------------------------
7407 -- Make_Local_Deep_Finalize --
7408 ------------------------------
7410 function Make_Local_Deep_Finalize
7412 Nam : Entity_Id) return Node_Id
7414 Loc : constant Source_Ptr := Sloc (Typ);
7418 Formals := New_List (
7422 Make_Parameter_Specification (Loc,
7423 Defining_Identifier => Make_Defining_Identifier (Loc, Name_V),
7425 Out_Present => True,
7426 Parameter_Type => New_Reference_To (Typ, Loc)),
7428 -- F : Boolean := True
7430 Make_Parameter_Specification (Loc,
7431 Defining_Identifier => Make_Defining_Identifier (Loc, Name_F),
7432 Parameter_Type => New_Reference_To (Standard_Boolean, Loc),
7433 Expression => New_Reference_To (Standard_True, Loc)));
7435 -- Add the necessary number of counters to represent the initialization
7436 -- state of an object.
7439 Make_Subprogram_Body (Loc,
7441 Make_Procedure_Specification (Loc,
7442 Defining_Unit_Name => Nam,
7443 Parameter_Specifications => Formals),
7445 Declarations => No_List,
7447 Handled_Statement_Sequence =>
7448 Make_Handled_Sequence_Of_Statements (Loc,
7449 Statements => Make_Deep_Record_Body (Finalize_Case, Typ, True)));
7450 end Make_Local_Deep_Finalize;
7452 ------------------------------------
7453 -- Make_Set_Finalize_Address_Call --
7454 ------------------------------------
7456 function Make_Set_Finalize_Address_Call
7459 Ptr_Typ : Entity_Id) return Node_Id
7461 Desig_Typ : constant Entity_Id :=
7462 Available_View (Designated_Type (Ptr_Typ));
7463 Fin_Mas_Id : constant Entity_Id := Finalization_Master (Ptr_Typ);
7465 Fin_Mas_Ref : Node_Id;
7469 -- If the context is a class-wide allocator, we use the class-wide type
7470 -- to obtain the proper Finalize_Address routine.
7472 if Is_Class_Wide_Type (Desig_Typ) then
7478 if Is_Private_Type (Utyp) and then Present (Full_View (Utyp)) then
7479 Utyp := Full_View (Utyp);
7482 if Is_Concurrent_Type (Utyp) then
7483 Utyp := Corresponding_Record_Type (Utyp);
7487 Utyp := Underlying_Type (Base_Type (Utyp));
7489 -- Deal with non-tagged derivation of private views. If the parent is
7490 -- now known to be protected, the finalization routine is the one
7491 -- defined on the corresponding record of the ancestor (corresponding
7492 -- records do not automatically inherit operations, but maybe they
7495 if Is_Untagged_Derivation (Typ) then
7496 if Is_Protected_Type (Typ) then
7497 Utyp := Corresponding_Record_Type (Root_Type (Base_Type (Typ)));
7499 Utyp := Underlying_Type (Root_Type (Base_Type (Typ)));
7501 if Is_Protected_Type (Utyp) then
7502 Utyp := Corresponding_Record_Type (Utyp);
7507 -- If the underlying_type is a subtype, we are dealing with the
7508 -- completion of a private type. We need to access the base type and
7509 -- generate a conversion to it.
7511 if Utyp /= Base_Type (Utyp) then
7512 pragma Assert (Is_Private_Type (Typ));
7514 Utyp := Base_Type (Utyp);
7517 Fin_Mas_Ref := New_Occurrence_Of (Fin_Mas_Id, Loc);
7519 -- If the call is from a build-in-place function, the Master parameter
7520 -- is actually a pointer. Dereference it for the call.
7522 if Is_Access_Type (Etype (Fin_Mas_Id)) then
7523 Fin_Mas_Ref := Make_Explicit_Dereference (Loc, Fin_Mas_Ref);
7527 -- Set_Finalize_Address (<Ptr_Typ>FM, <Utyp>FD'Unrestricted_Access);
7530 Make_Procedure_Call_Statement (Loc,
7532 New_Reference_To (RTE (RE_Set_Finalize_Address), Loc),
7533 Parameter_Associations => New_List (
7535 Make_Attribute_Reference (Loc,
7537 New_Reference_To (TSS (Utyp, TSS_Finalize_Address), Loc),
7538 Attribute_Name => Name_Unrestricted_Access)));
7540 -- In the case of build-in-place functions, protect the call to ensure
7541 -- we have a master at run time. Generate:
7543 -- if <Ptr_Typ>FM /= null then
7547 if Is_Access_Type (Etype (Fin_Mas_Id)) then
7549 Make_If_Statement (Loc,
7552 Left_Opnd => New_Reference_To (Fin_Mas_Id, Loc),
7553 Right_Opnd => Make_Null (Loc)),
7554 Then_Statements => New_List (Call));
7558 end Make_Set_Finalize_Address_Call;
7560 --------------------------
7561 -- Make_Transient_Block --
7562 --------------------------
7564 function Make_Transient_Block
7567 Par : Node_Id) return Node_Id
7569 Decls : constant List_Id := New_List;
7570 Instrs : constant List_Id := New_List (Action);
7575 -- Case where only secondary stack use is involved
7577 if VM_Target = No_VM
7578 and then Uses_Sec_Stack (Current_Scope)
7579 and then Nkind (Action) /= N_Simple_Return_Statement
7580 and then Nkind (Par) /= N_Exception_Handler
7586 S := Scope (Current_Scope);
7588 -- At the outer level, no need to release the sec stack
7590 if S = Standard_Standard then
7591 Set_Uses_Sec_Stack (Current_Scope, False);
7594 -- In a function, only release the sec stack if the
7595 -- function does not return on the sec stack otherwise
7596 -- the result may be lost. The caller is responsible for
7599 elsif Ekind (S) = E_Function then
7600 Set_Uses_Sec_Stack (Current_Scope, False);
7602 if not Requires_Transient_Scope (Etype (S)) then
7603 Set_Uses_Sec_Stack (S, True);
7604 Check_Restriction (No_Secondary_Stack, Action);
7609 -- In a loop or entry we should install a block encompassing
7610 -- all the construct. For now just release right away.
7612 elsif Ekind_In (S, E_Entry, E_Loop) then
7615 -- In a procedure or a block, we release on exit of the
7616 -- procedure or block. ??? memory leak can be created by
7619 elsif Ekind_In (S, E_Block, E_Procedure) then
7620 Set_Uses_Sec_Stack (S, True);
7621 Check_Restriction (No_Secondary_Stack, Action);
7622 Set_Uses_Sec_Stack (Current_Scope, False);
7632 -- Create the transient block. Set the parent now since the block itself
7633 -- is not part of the tree.
7636 Make_Block_Statement (Loc,
7637 Identifier => New_Reference_To (Current_Scope, Loc),
7638 Declarations => Decls,
7639 Handled_Statement_Sequence =>
7640 Make_Handled_Sequence_Of_Statements (Loc, Statements => Instrs),
7641 Has_Created_Identifier => True);
7642 Set_Parent (Block, Par);
7644 -- Insert actions stuck in the transient scopes as well as all freezing
7645 -- nodes needed by those actions.
7647 Insert_Actions_In_Scope_Around (Action);
7649 Insert := Prev (Action);
7650 if Present (Insert) then
7651 Freeze_All (First_Entity (Current_Scope), Insert);
7654 -- When the transient scope was established, we pushed the entry for
7655 -- the transient scope onto the scope stack, so that the scope was
7656 -- active for the installation of finalizable entities etc. Now we
7657 -- must remove this entry, since we have constructed a proper block.
7662 end Make_Transient_Block;
7664 ------------------------
7665 -- Node_To_Be_Wrapped --
7666 ------------------------
7668 function Node_To_Be_Wrapped return Node_Id is
7670 return Scope_Stack.Table (Scope_Stack.Last).Node_To_Be_Wrapped;
7671 end Node_To_Be_Wrapped;
7673 ----------------------------
7674 -- Set_Node_To_Be_Wrapped --
7675 ----------------------------
7677 procedure Set_Node_To_Be_Wrapped (N : Node_Id) is
7679 Scope_Stack.Table (Scope_Stack.Last).Node_To_Be_Wrapped := N;
7680 end Set_Node_To_Be_Wrapped;
7682 ----------------------------------
7683 -- Store_After_Actions_In_Scope --
7684 ----------------------------------
7686 procedure Store_After_Actions_In_Scope (L : List_Id) is
7687 SE : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last);
7690 if Present (SE.Actions_To_Be_Wrapped_After) then
7691 Insert_List_Before_And_Analyze (
7692 First (SE.Actions_To_Be_Wrapped_After), L);
7695 SE.Actions_To_Be_Wrapped_After := L;
7697 if Is_List_Member (SE.Node_To_Be_Wrapped) then
7698 Set_Parent (L, Parent (SE.Node_To_Be_Wrapped));
7700 Set_Parent (L, SE.Node_To_Be_Wrapped);
7705 end Store_After_Actions_In_Scope;
7707 -----------------------------------
7708 -- Store_Before_Actions_In_Scope --
7709 -----------------------------------
7711 procedure Store_Before_Actions_In_Scope (L : List_Id) is
7712 SE : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last);
7715 if Present (SE.Actions_To_Be_Wrapped_Before) then
7716 Insert_List_After_And_Analyze (
7717 Last (SE.Actions_To_Be_Wrapped_Before), L);
7720 SE.Actions_To_Be_Wrapped_Before := L;
7722 if Is_List_Member (SE.Node_To_Be_Wrapped) then
7723 Set_Parent (L, Parent (SE.Node_To_Be_Wrapped));
7725 Set_Parent (L, SE.Node_To_Be_Wrapped);
7730 end Store_Before_Actions_In_Scope;
7732 --------------------------------
7733 -- Wrap_Transient_Declaration --
7734 --------------------------------
7736 -- If a transient scope has been established during the processing of the
7737 -- Expression of an Object_Declaration, it is not possible to wrap the
7738 -- declaration into a transient block as usual case, otherwise the object
7739 -- would be itself declared in the wrong scope. Therefore, all entities (if
7740 -- any) defined in the transient block are moved to the proper enclosing
7741 -- scope, furthermore, if they are controlled variables they are finalized
7742 -- right after the declaration. The finalization list of the transient
7743 -- scope is defined as a renaming of the enclosing one so during their
7744 -- initialization they will be attached to the proper finalization list.
7745 -- For instance, the following declaration :
7747 -- X : Typ := F (G (A), G (B));
7749 -- (where G(A) and G(B) return controlled values, expanded as _v1 and _v2)
7750 -- is expanded into :
7752 -- X : Typ := [ complex Expression-Action ];
7753 -- [Deep_]Finalize (_v1);
7754 -- [Deep_]Finalize (_v2);
7756 procedure Wrap_Transient_Declaration (N : Node_Id) is
7763 Encl_S := Scope (S);
7765 -- Insert Actions kept in the Scope stack
7767 Insert_Actions_In_Scope_Around (N);
7769 -- If the declaration is consuming some secondary stack, mark the
7770 -- enclosing scope appropriately.
7772 Uses_SS := Uses_Sec_Stack (S);
7775 -- Put the local entities back in the enclosing scope, and set the
7776 -- Is_Public flag appropriately.
7778 Transfer_Entities (S, Encl_S);
7780 -- Mark the enclosing dynamic scope so that the sec stack will be
7781 -- released upon its exit unless this is a function that returns on
7782 -- the sec stack in which case this will be done by the caller.
7784 if VM_Target = No_VM and then Uses_SS then
7785 S := Enclosing_Dynamic_Scope (S);
7787 if Ekind (S) = E_Function
7788 and then Requires_Transient_Scope (Etype (S))
7792 Set_Uses_Sec_Stack (S);
7793 Check_Restriction (No_Secondary_Stack, N);
7796 end Wrap_Transient_Declaration;
7798 -------------------------------
7799 -- Wrap_Transient_Expression --
7800 -------------------------------
7802 procedure Wrap_Transient_Expression (N : Node_Id) is
7803 Expr : constant Node_Id := Relocate_Node (N);
7804 Loc : constant Source_Ptr := Sloc (N);
7805 Temp : constant Entity_Id := Make_Temporary (Loc, 'E', N);
7806 Typ : constant Entity_Id := Etype (N);
7813 -- M : constant Mark_Id := SS_Mark;
7814 -- procedure Finalizer is ... (See Build_Finalizer)
7823 Insert_Actions (N, New_List (
7824 Make_Object_Declaration (Loc,
7825 Defining_Identifier => Temp,
7826 Object_Definition => New_Reference_To (Typ, Loc)),
7828 Make_Transient_Block (Loc,
7830 Make_Assignment_Statement (Loc,
7831 Name => New_Reference_To (Temp, Loc),
7832 Expression => Expr),
7833 Par => Parent (N))));
7835 Rewrite (N, New_Reference_To (Temp, Loc));
7836 Analyze_And_Resolve (N, Typ);
7837 end Wrap_Transient_Expression;
7839 ------------------------------
7840 -- Wrap_Transient_Statement --
7841 ------------------------------
7843 procedure Wrap_Transient_Statement (N : Node_Id) is
7844 Loc : constant Source_Ptr := Sloc (N);
7845 New_Stmt : constant Node_Id := Relocate_Node (N);
7850 -- M : constant Mark_Id := SS_Mark;
7851 -- procedure Finalizer is ... (See Build_Finalizer)
7861 Make_Transient_Block (Loc,
7863 Par => Parent (N)));
7865 -- With the scope stack back to normal, we can call analyze on the
7866 -- resulting block. At this point, the transient scope is being
7867 -- treated like a perfectly normal scope, so there is nothing
7868 -- special about it.
7870 -- Note: Wrap_Transient_Statement is called with the node already
7871 -- analyzed (i.e. Analyzed (N) is True). This is important, since
7872 -- otherwise we would get a recursive processing of the node when
7873 -- we do this Analyze call.
7876 end Wrap_Transient_Statement;