1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2003 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 2, 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 COPYING. If not, write --
19 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
20 -- MA 02111-1307, USA. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 with Atree; use Atree;
28 with Einfo; use Einfo;
29 with Elists; use Elists;
30 with Errout; use Errout;
31 with Exp_Ch7; use Exp_Ch7;
32 with Exp_Ch11; use Exp_Ch11;
33 with Exp_Tss; use Exp_Tss;
34 with Fname; use Fname;
35 with Fname.UF; use Fname.UF;
37 with Nlists; use Nlists;
39 with Sem_Ch8; use Sem_Ch8;
40 with Sem_Ch10; use Sem_Ch10;
41 with Sem_Ch12; use Sem_Ch12;
42 with Sem_Util; use Sem_Util;
43 with Sinfo; use Sinfo;
44 with Snames; use Snames;
45 with Stand; use Stand;
46 with Uname; use Uname;
48 package body Inline is
54 -- Inlined functions are actually placed in line by the backend if the
55 -- corresponding bodies are available (i.e. compiled). Whenever we find
56 -- a call to an inlined subprogram, we add the name of the enclosing
57 -- compilation unit to a worklist. After all compilation, and after
58 -- expansion of generic bodies, we traverse the list of pending bodies
59 -- and compile them as well.
61 package Inlined_Bodies is new Table.Table (
62 Table_Component_Type => Entity_Id,
63 Table_Index_Type => Int,
65 Table_Initial => Alloc.Inlined_Bodies_Initial,
66 Table_Increment => Alloc.Inlined_Bodies_Increment,
67 Table_Name => "Inlined_Bodies");
69 -----------------------
70 -- Inline Processing --
71 -----------------------
73 -- For each call to an inlined subprogram, we make entries in a table
74 -- that stores caller and callee, and indicates a prerequisite from
75 -- one to the other. We also record the compilation unit that contains
76 -- the callee. After analyzing the bodies of all such compilation units,
77 -- we produce a list of subprograms in topological order, for use by the
78 -- back-end. If P2 is a prerequisite of P1, then P1 calls P2, and for
79 -- proper inlining the back-end must analyze the body of P2 before that of
80 -- P1. The code below guarantees that the transitive closure of inlined
81 -- subprograms called from the main compilation unit is made available to
82 -- the code generator.
84 Last_Inlined : Entity_Id := Empty;
86 -- For each entry in the table we keep a list of successors in topological
87 -- order, i.e. callers of the current subprogram.
89 type Subp_Index is new Nat;
90 No_Subp : constant Subp_Index := 0;
92 -- The subprogram entities are hashed into the Inlined table.
94 Num_Hash_Headers : constant := 512;
96 Hash_Headers : array (Subp_Index range 0 .. Num_Hash_Headers - 1)
99 type Succ_Index is new Nat;
100 No_Succ : constant Succ_Index := 0;
102 type Succ_Info is record
107 -- The following table stores list elements for the successor lists.
108 -- These lists cannot be chained directly through entries in the Inlined
109 -- table, because a given subprogram can appear in several such lists.
111 package Successors is new Table.Table (
112 Table_Component_Type => Succ_Info,
113 Table_Index_Type => Succ_Index,
114 Table_Low_Bound => 1,
115 Table_Initial => Alloc.Successors_Initial,
116 Table_Increment => Alloc.Successors_Increment,
117 Table_Name => "Successors");
119 type Subp_Info is record
120 Name : Entity_Id := Empty;
121 First_Succ : Succ_Index := No_Succ;
122 Count : Integer := 0;
123 Listed : Boolean := False;
124 Main_Call : Boolean := False;
125 Next : Subp_Index := No_Subp;
126 Next_Nopred : Subp_Index := No_Subp;
129 package Inlined is new Table.Table (
130 Table_Component_Type => Subp_Info,
131 Table_Index_Type => Subp_Index,
132 Table_Low_Bound => 1,
133 Table_Initial => Alloc.Inlined_Initial,
134 Table_Increment => Alloc.Inlined_Increment,
135 Table_Name => "Inlined");
137 -----------------------
138 -- Local Subprograms --
139 -----------------------
141 function Scope_In_Main_Unit (Scop : Entity_Id) return Boolean;
142 -- Return True if Scop is in the main unit or its spec, or in a
143 -- parent of the main unit if it is a child unit.
145 procedure Add_Call (Called : Entity_Id; Caller : Entity_Id := Empty);
146 -- Make two entries in Inlined table, for an inlined subprogram being
147 -- called, and for the inlined subprogram that contains the call. If
148 -- the call is in the main compilation unit, Caller is Empty.
150 function Add_Subp (E : Entity_Id) return Subp_Index;
151 -- Make entry in Inlined table for subprogram E, or return table index
152 -- that already holds E.
154 function Has_Initialized_Type (E : Entity_Id) return Boolean;
155 -- If a candidate for inlining contains type declarations for types with
156 -- non-trivial initialization procedures, they are not worth inlining.
158 function Is_Nested (E : Entity_Id) return Boolean;
159 -- If the function is nested inside some other function, it will
160 -- always be compiled if that function is, so don't add it to the
161 -- inline list. We cannot compile a nested function outside the
162 -- scope of the containing function anyway. This is also the case if
163 -- the function is defined in a task body or within an entry (for
164 -- example, an initialization procedure).
166 procedure Add_Inlined_Subprogram (Index : Subp_Index);
167 -- Add subprogram to Inlined List once all of its predecessors have been
168 -- placed on the list. Decrement the count of all its successors, and
169 -- add them to list (recursively) if count drops to zero.
171 ------------------------------
172 -- Deferred Cleanup Actions --
173 ------------------------------
175 -- The cleanup actions for scopes that contain instantiations is delayed
176 -- until after expansion of those instantiations, because they may
177 -- contain finalizable objects or tasks that affect the cleanup code.
178 -- A scope that contains instantiations only needs to be finalized once,
179 -- even if it contains more than one instance. We keep a list of scopes
180 -- that must still be finalized, and call cleanup_actions after all the
181 -- instantiations have been completed.
185 procedure Add_Scope_To_Clean (Inst : Entity_Id);
186 -- Build set of scopes on which cleanup actions must be performed.
188 procedure Cleanup_Scopes;
189 -- Complete cleanup actions on scopes that need it.
195 procedure Add_Call (Called : Entity_Id; Caller : Entity_Id := Empty) is
196 P1 : constant Subp_Index := Add_Subp (Called);
201 if Present (Caller) then
202 P2 := Add_Subp (Caller);
204 -- Add P2 to the list of successors of P1, if not already there.
205 -- Note that P2 may contain more than one call to P1, and only
206 -- one needs to be recorded.
208 J := Inlined.Table (P1).First_Succ;
210 while J /= No_Succ loop
212 if Successors.Table (J).Subp = P2 then
216 J := Successors.Table (J).Next;
219 -- On exit, make a successor entry for P2.
221 Successors.Increment_Last;
222 Successors.Table (Successors.Last).Subp := P2;
223 Successors.Table (Successors.Last).Next :=
224 Inlined.Table (P1).First_Succ;
225 Inlined.Table (P1).First_Succ := Successors.Last;
227 Inlined.Table (P2).Count := Inlined.Table (P2).Count + 1;
230 Inlined.Table (P1).Main_Call := True;
234 ----------------------
235 -- Add_Inlined_Body --
236 ----------------------
238 procedure Add_Inlined_Body (E : Entity_Id) is
241 function Must_Inline return Boolean;
242 -- Inlining is only done if the call statement N is in the main unit,
243 -- or within the body of another inlined subprogram.
249 function Must_Inline return Boolean is
250 Scop : Entity_Id := Current_Scope;
254 -- Check if call is in main unit
256 while Scope (Scop) /= Standard_Standard
257 and then not Is_Child_Unit (Scop)
259 Scop := Scope (Scop);
262 Comp := Parent (Scop);
264 while Nkind (Comp) /= N_Compilation_Unit loop
265 Comp := Parent (Comp);
268 if Comp = Cunit (Main_Unit)
269 or else Comp = Library_Unit (Cunit (Main_Unit))
275 -- Call is not in main unit. See if it's in some inlined
278 Scop := Current_Scope;
279 while Scope (Scop) /= Standard_Standard
280 and then not Is_Child_Unit (Scop)
282 if Is_Overloadable (Scop)
283 and then Is_Inlined (Scop)
289 Scop := Scope (Scop);
296 -- Start of processing for Add_Inlined_Body
299 -- Find unit containing E, and add to list of inlined bodies if needed.
300 -- If the body is already present, no need to load any other unit. This
301 -- is the case for an initialization procedure, which appears in the
302 -- package declaration that contains the type. It is also the case if
303 -- the body has already been analyzed. Finally, if the unit enclosing
304 -- E is an instance, the instance body will be analyzed in any case,
305 -- and there is no need to add the enclosing unit (whose body might not
308 -- Library-level functions must be handled specially, because there is
309 -- no enclosing package to retrieve. In this case, it is the body of
310 -- the function that will have to be loaded.
312 if not Is_Abstract (E) and then not Is_Nested (E)
313 and then Convention (E) /= Convention_Protected
318 and then Ekind (Pack) = E_Package
322 if Pack = Standard_Standard then
324 -- Library-level inlined function. Add function iself to
325 -- list of needed units.
327 Inlined_Bodies.Increment_Last;
328 Inlined_Bodies.Table (Inlined_Bodies.Last) := E;
330 elsif Is_Generic_Instance (Pack) then
333 elsif not Is_Inlined (Pack)
334 and then not Has_Completion (E)
335 and then not Scope_In_Main_Unit (Pack)
337 Set_Is_Inlined (Pack);
338 Inlined_Bodies.Increment_Last;
339 Inlined_Bodies.Table (Inlined_Bodies.Last) := Pack;
343 end Add_Inlined_Body;
345 ----------------------------
346 -- Add_Inlined_Subprogram --
347 ----------------------------
349 procedure Add_Inlined_Subprogram (Index : Subp_Index) is
350 E : constant Entity_Id := Inlined.Table (Index).Name;
354 function Back_End_Cannot_Inline (Subp : Entity_Id) return Boolean;
355 -- There are various conditions under which back-end inlining cannot
358 -- a) If a body has handlers, it must not be inlined, because this
359 -- may violate program semantics, and because in zero-cost exception
360 -- mode it will lead to undefined symbols at link time.
362 -- b) If a body contains inlined function instances, it cannot be
363 -- inlined under ZCX because the numerix suffix generated by gigi
364 -- will be different in the body and the place of the inlined call.
366 -- This procedure must be carefully coordinated with the back end
368 ----------------------------
369 -- Back_End_Cannot_Inline --
370 ----------------------------
372 function Back_End_Cannot_Inline (Subp : Entity_Id) return Boolean is
373 Decl : Node_Id := Unit_Declaration_Node (Subp);
374 Body_Ent : Entity_Id;
378 if Nkind (Decl) = N_Subprogram_Declaration
379 and then Present (Corresponding_Body (Decl))
381 Body_Ent := Corresponding_Body (Decl);
386 -- If subprogram is marked Inline_Always, inlining is mandatory
388 if Is_Always_Inlined (Subp) then
394 (Handled_Statement_Sequence
395 (Unit_Declaration_Node (Corresponding_Body (Decl)))))
400 Ent := First_Entity (Body_Ent);
402 while Present (Ent) loop
403 if Is_Subprogram (Ent)
404 and then Is_Generic_Instance (Ent)
412 end Back_End_Cannot_Inline;
414 -- Start of processing for Add_Inlined_Subprogram
417 -- Insert the current subprogram in the list of inlined subprograms,
418 -- if it can actually be inlined by the back-end.
420 if not Scope_In_Main_Unit (E)
421 and then Is_Inlined (E)
422 and then not Is_Nested (E)
423 and then not Has_Initialized_Type (E)
425 if Back_End_Cannot_Inline (E) then
426 Set_Is_Inlined (E, False);
429 if No (Last_Inlined) then
430 Set_First_Inlined_Subprogram (Cunit (Main_Unit), E);
432 Set_Next_Inlined_Subprogram (Last_Inlined, E);
439 Inlined.Table (Index).Listed := True;
440 Succ := Inlined.Table (Index).First_Succ;
442 while Succ /= No_Succ loop
443 Subp := Successors.Table (Succ).Subp;
444 Inlined.Table (Subp).Count := Inlined.Table (Subp).Count - 1;
446 if Inlined.Table (Subp).Count = 0 then
447 Add_Inlined_Subprogram (Subp);
450 Succ := Successors.Table (Succ).Next;
452 end Add_Inlined_Subprogram;
454 ------------------------
455 -- Add_Scope_To_Clean --
456 ------------------------
458 procedure Add_Scope_To_Clean (Inst : Entity_Id) is
459 Scop : constant Entity_Id := Enclosing_Dynamic_Scope (Inst);
463 -- If the instance appears in a library-level package declaration,
464 -- all finalization is global, and nothing needs doing here.
466 if Scop = Standard_Standard then
470 Elmt := First_Elmt (To_Clean);
472 while Present (Elmt) loop
474 if Node (Elmt) = Scop then
478 Elmt := Next_Elmt (Elmt);
481 Append_Elmt (Scop, To_Clean);
482 end Add_Scope_To_Clean;
488 function Add_Subp (E : Entity_Id) return Subp_Index is
489 Index : Subp_Index := Subp_Index (E) mod Num_Hash_Headers;
493 -- Initialize entry in Inlined table.
495 procedure New_Entry is
497 Inlined.Increment_Last;
498 Inlined.Table (Inlined.Last).Name := E;
499 Inlined.Table (Inlined.Last).First_Succ := No_Succ;
500 Inlined.Table (Inlined.Last).Count := 0;
501 Inlined.Table (Inlined.Last).Listed := False;
502 Inlined.Table (Inlined.Last).Main_Call := False;
503 Inlined.Table (Inlined.Last).Next := No_Subp;
504 Inlined.Table (Inlined.Last).Next_Nopred := No_Subp;
507 -- Start of processing for Add_Subp
510 if Hash_Headers (Index) = No_Subp then
512 Hash_Headers (Index) := Inlined.Last;
516 J := Hash_Headers (Index);
518 while J /= No_Subp loop
520 if Inlined.Table (J).Name = E then
524 J := Inlined.Table (J).Next;
528 -- On exit, subprogram was not found. Enter in table. Index is
529 -- the current last entry on the hash chain.
532 Inlined.Table (Index).Next := Inlined.Last;
537 ----------------------------
538 -- Analyze_Inlined_Bodies --
539 ----------------------------
541 procedure Analyze_Inlined_Bodies is
548 Analyzing_Inlined_Bodies := False;
550 if Serious_Errors_Detected = 0 then
551 New_Scope (Standard_Standard);
554 while J <= Inlined_Bodies.Last
555 and then Serious_Errors_Detected = 0
557 Pack := Inlined_Bodies.Table (J);
560 and then Scope (Pack) /= Standard_Standard
561 and then not Is_Child_Unit (Pack)
563 Pack := Scope (Pack);
566 Comp_Unit := Parent (Pack);
568 while Present (Comp_Unit)
569 and then Nkind (Comp_Unit) /= N_Compilation_Unit
571 Comp_Unit := Parent (Comp_Unit);
574 -- Load the body, unless it the main unit, or is an instance
575 -- whose body has already been analyzed.
577 if Present (Comp_Unit)
578 and then Comp_Unit /= Cunit (Main_Unit)
579 and then Body_Required (Comp_Unit)
580 and then (Nkind (Unit (Comp_Unit)) /= N_Package_Declaration
581 or else No (Corresponding_Body (Unit (Comp_Unit))))
584 Bname : constant Unit_Name_Type :=
585 Get_Body_Name (Get_Unit_Name (Unit (Comp_Unit)));
590 if not Is_Loaded (Bname) then
591 Load_Needed_Body (Comp_Unit, OK);
594 Error_Msg_Unit_1 := Bname;
596 ("one or more inlined subprograms accessed in $!",
599 Get_File_Name (Bname, Subunit => False);
600 Error_Msg_N ("\but file{ was not found!", Comp_Unit);
601 raise Unrecoverable_Error;
610 -- The analysis of required bodies may have produced additional
611 -- generic instantiations. To obtain further inlining, we perform
612 -- another round of generic body instantiations. Establishing a
613 -- fully recursive loop between inlining and generic instantiations
614 -- is unlikely to yield more than this one additional pass.
618 -- The list of inlined subprograms is an overestimate, because
619 -- it includes inlined functions called from functions that are
620 -- compiled as part of an inlined package, but are not themselves
621 -- called. An accurate computation of just those subprograms that
622 -- are needed requires that we perform a transitive closure over
623 -- the call graph, starting from calls in the main program. Here
624 -- we do one step of the inverse transitive closure, and reset
625 -- the Is_Called flag on subprograms all of whose callers are not.
627 for Index in Inlined.First .. Inlined.Last loop
628 S := Inlined.Table (Index).First_Succ;
631 and then not Inlined.Table (Index).Main_Call
633 Set_Is_Called (Inlined.Table (Index).Name, False);
635 while S /= No_Succ loop
638 (Inlined.Table (Successors.Table (S).Subp).Name)
639 or else Inlined.Table (Successors.Table (S).Subp).Main_Call
641 Set_Is_Called (Inlined.Table (Index).Name);
645 S := Successors.Table (S).Next;
650 -- Now that the units are compiled, chain the subprograms within
651 -- that are called and inlined. Produce list of inlined subprograms
652 -- sorted in topological order. Start with all subprograms that
653 -- have no prerequisites, i.e. inlined subprograms that do not call
654 -- other inlined subprograms.
656 for Index in Inlined.First .. Inlined.Last loop
658 if Is_Called (Inlined.Table (Index).Name)
659 and then Inlined.Table (Index).Count = 0
660 and then not Inlined.Table (Index).Listed
662 Add_Inlined_Subprogram (Index);
666 -- Because Add_Inlined_Subprogram treats recursively nodes that have
667 -- no prerequisites left, at the end of the loop all subprograms
668 -- must have been listed. If there are any unlisted subprograms
669 -- left, there must be some recursive chains that cannot be inlined.
671 for Index in Inlined.First .. Inlined.Last loop
672 if Is_Called (Inlined.Table (Index).Name)
673 and then Inlined.Table (Index).Count /= 0
674 and then not Is_Predefined_File_Name
676 (Get_Source_Unit (Inlined.Table (Index).Name)))
679 ("& cannot be inlined?", Inlined.Table (Index).Name);
680 -- A warning on the first one might be sufficient.
686 end Analyze_Inlined_Bodies;
688 --------------------------------
689 -- Check_Body_For_Inlining --
690 --------------------------------
692 procedure Check_Body_For_Inlining (N : Node_Id; P : Entity_Id) is
693 Bname : Unit_Name_Type;
698 if Is_Compilation_Unit (P)
699 and then not Is_Generic_Instance (P)
701 Bname := Get_Body_Name (Get_Unit_Name (Unit (N)));
702 E := First_Entity (P);
704 while Present (E) loop
705 if Is_Always_Inlined (E)
706 or else (Front_End_Inlining and then Has_Pragma_Inline (E))
708 if not Is_Loaded (Bname) then
709 Load_Needed_Body (N, OK);
713 -- Check that we are not trying to inline a parent
714 -- whose body depends on a child, when we are compiling
715 -- the body of the child. Otherwise we have a potential
716 -- elaboration circularity with inlined subprograms and
717 -- with Taft-Amendment types.
720 Comp : Node_Id; -- Body just compiled
721 Child_Spec : Entity_Id; -- Spec of main unit
722 Ent : Entity_Id; -- For iteration
723 With_Clause : Node_Id; -- Context of body.
726 if Nkind (Unit (Cunit (Main_Unit))) = N_Package_Body
727 and then Present (Body_Entity (P))
731 (Unit (Library_Unit (Cunit (Main_Unit)))));
734 Parent (Unit_Declaration_Node (Body_Entity (P)));
736 With_Clause := First (Context_Items (Comp));
738 -- Check whether the context of the body just
739 -- compiled includes a child of itself, and that
740 -- child is the spec of the main compilation.
742 while Present (With_Clause) loop
743 if Nkind (With_Clause) = N_With_Clause
745 Scope (Entity (Name (With_Clause))) = P
747 Entity (Name (With_Clause)) = Child_Spec
749 Error_Msg_Node_2 := Child_Spec;
751 ("body of & depends on child unit&?",
754 ("\subprograms in body cannot be inlined?",
757 -- Disable further inlining from this unit,
758 -- and keep Taft-amendment types incomplete.
760 Ent := First_Entity (P);
762 while Present (Ent) loop
764 and then Has_Completion_In_Body (Ent)
766 Set_Full_View (Ent, Empty);
768 elsif Is_Subprogram (Ent) then
769 Set_Is_Inlined (Ent, False);
783 elsif Ineffective_Inline_Warnings then
784 Error_Msg_Unit_1 := Bname;
786 ("unable to inline subprograms defined in $?", P);
787 Error_Msg_N ("\body not found?", P);
798 end Check_Body_For_Inlining;
804 procedure Cleanup_Scopes is
810 Elmt := First_Elmt (To_Clean);
812 while Present (Elmt) loop
815 if Ekind (Scop) = E_Entry then
816 Scop := Protected_Body_Subprogram (Scop);
818 elsif Is_Subprogram (Scop)
819 and then Is_Protected_Type (Scope (Scop))
820 and then Present (Protected_Body_Subprogram (Scop))
822 -- If a protected operation contains an instance, its
823 -- cleanup operations have been delayed, and the subprogram
824 -- has been rewritten in the expansion of the enclosing
825 -- protected body. It is the corresponding subprogram that
826 -- may require the cleanup operations.
829 (Protected_Body_Subprogram (Scop),
830 Uses_Sec_Stack (Scop));
831 Scop := Protected_Body_Subprogram (Scop);
834 if Ekind (Scop) = E_Block then
835 Decl := Parent (Block_Node (Scop));
838 Decl := Unit_Declaration_Node (Scop);
840 if Nkind (Decl) = N_Subprogram_Declaration
841 or else Nkind (Decl) = N_Task_Type_Declaration
842 or else Nkind (Decl) = N_Subprogram_Body_Stub
844 Decl := Unit_Declaration_Node (Corresponding_Body (Decl));
849 Expand_Cleanup_Actions (Decl);
852 Elmt := Next_Elmt (Elmt);
856 --------------------------
857 -- Has_Initialized_Type --
858 --------------------------
860 function Has_Initialized_Type (E : Entity_Id) return Boolean is
861 E_Body : constant Node_Id := Get_Subprogram_Body (E);
865 if No (E_Body) then -- imported subprogram
869 Decl := First (Declarations (E_Body));
871 while Present (Decl) loop
873 if Nkind (Decl) = N_Full_Type_Declaration
874 and then Present (Init_Proc (Defining_Identifier (Decl)))
884 end Has_Initialized_Type;
890 procedure Initialize is
892 Analyzing_Inlined_Bodies := False;
893 Pending_Descriptor.Init;
894 Pending_Instantiations.Init;
899 for J in Hash_Headers'Range loop
900 Hash_Headers (J) := No_Subp;
904 ------------------------
905 -- Instantiate_Bodies --
906 ------------------------
908 -- Generic bodies contain all the non-local references, so an
909 -- instantiation does not need any more context than Standard
910 -- itself, even if the instantiation appears in an inner scope.
911 -- Generic associations have verified that the contract model is
912 -- satisfied, so that any error that may occur in the analysis of
913 -- the body is an internal error.
915 procedure Instantiate_Bodies is
917 Info : Pending_Body_Info;
920 if Serious_Errors_Detected = 0 then
922 Expander_Active := (Operating_Mode = Opt.Generate_Code);
923 New_Scope (Standard_Standard);
924 To_Clean := New_Elmt_List;
926 if Is_Generic_Unit (Cunit_Entity (Main_Unit)) then
930 -- A body instantiation may generate additional instantiations, so
931 -- the following loop must scan to the end of a possibly expanding
932 -- set (that's why we can't simply use a FOR loop here).
936 while J <= Pending_Instantiations.Last
937 and then Serious_Errors_Detected = 0
939 Info := Pending_Instantiations.Table (J);
941 -- If the instantiation node is absent, it has been removed
942 -- as part of unreachable code.
944 if No (Info.Inst_Node) then
947 elsif Nkind (Info.Act_Decl) = N_Package_Declaration then
948 Instantiate_Package_Body (Info);
949 Add_Scope_To_Clean (Defining_Entity (Info.Act_Decl));
952 Instantiate_Subprogram_Body (Info);
958 -- Reset the table of instantiations. Additional instantiations
959 -- may be added through inlining, when additional bodies are
962 Pending_Instantiations.Init;
964 -- We can now complete the cleanup actions of scopes that contain
965 -- pending instantiations (skipped for generic units, since we
966 -- never need any cleanups in generic units).
967 -- pending instantiations.
970 and then not Is_Generic_Unit (Main_Unit_Entity)
974 -- Also generate subprogram descriptors that were delayed
976 for J in Pending_Descriptor.First .. Pending_Descriptor.Last loop
978 Ent : constant Entity_Id := Pending_Descriptor.Table (J);
981 if Is_Subprogram (Ent) then
982 Generate_Subprogram_Descriptor_For_Subprogram
983 (Get_Subprogram_Body (Ent), Ent);
985 elsif Ekind (Ent) = E_Package then
986 Generate_Subprogram_Descriptor_For_Package
987 (Parent (Declaration_Node (Ent)), Ent);
989 elsif Ekind (Ent) = E_Package_Body then
990 Generate_Subprogram_Descriptor_For_Package
991 (Declaration_Node (Ent), Ent);
996 elsif Is_Generic_Unit (Cunit_Entity (Main_Unit)) then
1002 end Instantiate_Bodies;
1008 function Is_Nested (E : Entity_Id) return Boolean is
1009 Scop : Entity_Id := Scope (E);
1012 while Scop /= Standard_Standard loop
1013 if Ekind (Scop) in Subprogram_Kind then
1016 elsif Ekind (Scop) = E_Task_Type
1017 or else Ekind (Scop) = E_Entry
1018 or else Ekind (Scop) = E_Entry_Family then
1022 Scop := Scope (Scop);
1034 Pending_Instantiations.Locked := True;
1035 Inlined_Bodies.Locked := True;
1036 Successors.Locked := True;
1037 Inlined.Locked := True;
1038 Pending_Instantiations.Release;
1039 Inlined_Bodies.Release;
1044 --------------------------
1045 -- Remove_Dead_Instance --
1046 --------------------------
1048 procedure Remove_Dead_Instance (N : Node_Id) is
1054 while J <= Pending_Instantiations.Last loop
1056 if Pending_Instantiations.Table (J).Inst_Node = N then
1057 Pending_Instantiations.Table (J).Inst_Node := Empty;
1063 end Remove_Dead_Instance;
1065 ------------------------
1066 -- Scope_In_Main_Unit --
1067 ------------------------
1069 function Scope_In_Main_Unit (Scop : Entity_Id) return Boolean is
1071 S : Entity_Id := Scop;
1072 Ent : Entity_Id := Cunit_Entity (Main_Unit);
1075 -- The scope may be within the main unit, or it may be an ancestor
1076 -- of the main unit, if the main unit is a child unit. In both cases
1077 -- it makes no sense to process the body before the main unit. In
1078 -- the second case, this may lead to circularities if a parent body
1079 -- depends on a child spec, and we are analyzing the child.
1081 while Scope (S) /= Standard_Standard
1082 and then not Is_Child_Unit (S)
1089 while Present (Comp)
1090 and then Nkind (Comp) /= N_Compilation_Unit
1092 Comp := Parent (Comp);
1095 if Is_Child_Unit (Ent) then
1098 and then Is_Child_Unit (Ent)
1100 if Scope (Ent) = S then
1109 Comp = Cunit (Main_Unit)
1110 or else Comp = Library_Unit (Cunit (Main_Unit));
1111 end Scope_In_Main_Unit;