1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2009, 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. --
18 -- You should have received a copy of the GNU General Public License along --
19 -- with this program; see file COPYING3. If not see --
20 -- <http://www.gnu.org/licenses/>. --
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 Debug; use Debug;
29 with Debug_A; use Debug_A;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Expander; use Expander;
33 with Fname; use Fname;
36 with Lib.Load; use Lib.Load;
37 with Nlists; use Nlists;
38 with Output; use Output;
39 with Sem_Attr; use Sem_Attr;
40 with Sem_Ch2; use Sem_Ch2;
41 with Sem_Ch3; use Sem_Ch3;
42 with Sem_Ch4; use Sem_Ch4;
43 with Sem_Ch5; use Sem_Ch5;
44 with Sem_Ch6; use Sem_Ch6;
45 with Sem_Ch7; use Sem_Ch7;
46 with Sem_Ch8; use Sem_Ch8;
47 with Sem_Ch9; use Sem_Ch9;
48 with Sem_Ch10; use Sem_Ch10;
49 with Sem_Ch11; use Sem_Ch11;
50 with Sem_Ch12; use Sem_Ch12;
51 with Sem_Ch13; use Sem_Ch13;
52 with Sem_Prag; use Sem_Prag;
53 with Sem_Util; use Sem_Util;
54 with Sinfo; use Sinfo;
55 with Stand; use Stand;
56 with Uintp; use Uintp;
57 with Uname; use Uname;
59 with Unchecked_Deallocation;
61 pragma Warnings (Off, Sem_Util);
62 -- Suppress warnings of unused with for Sem_Util (used only in asserts)
66 Debug_Unit_Walk : Boolean renames Debug_Flag_Dot_WW;
67 -- Controls debugging printouts for Walk_Library_Items
69 Outer_Generic_Scope : Entity_Id := Empty;
70 -- Global reference to the outer scope that is generic. In a non
71 -- generic context, it is empty. At the moment, it is only used
72 -- for avoiding freezing of external references in generics.
74 Comp_Unit_List : Elist_Id := No_Elist;
75 -- Used by Walk_Library_Items. This is a list of N_Compilation_Unit nodes
76 -- processed by Semantics, in an appropriate order. Initialized to
77 -- No_Elist, because it's too early to call New_Elmt_List; we will set it
78 -- to New_Elmt_List on first use.
81 with procedure Action (Withed_Unit : Node_Id);
82 procedure Walk_Withs_Immediate (CU : Node_Id; Include_Limited : Boolean);
83 -- Walk all the with clauses of CU, and call Action for the with'ed
84 -- unit. Ignore limited withs, unless Include_Limited is True.
85 -- CU must be an N_Compilation_Unit.
88 with procedure Action (Withed_Unit : Node_Id);
89 procedure Walk_Withs (CU : Node_Id; Include_Limited : Boolean);
90 -- Same as Walk_Withs_Immediate, but also include with clauses on subunits
91 -- of this unit, since they count as dependences on their parent library
92 -- item. CU must be an N_Compilation_Unit whose Unit is not an N_Subunit.
94 procedure Write_Unit_Info
95 (Unit_Num : Unit_Number_Type;
97 Prefix : String := "";
98 Withs : Boolean := False);
99 -- Print out debugging information about the unit. Prefix precedes the rest
100 -- of the printout. If Withs is True, we print out units with'ed by this
101 -- unit (not counting limited withs).
107 procedure Analyze (N : Node_Id) is
109 Debug_A_Entry ("analyzing ", N);
111 -- Immediate return if already analyzed
114 Debug_A_Exit ("analyzing ", N, " (done, analyzed already)");
118 -- Otherwise processing depends on the node kind
122 when N_Abort_Statement =>
123 Analyze_Abort_Statement (N);
125 when N_Abstract_Subprogram_Declaration =>
126 Analyze_Abstract_Subprogram_Declaration (N);
128 when N_Accept_Alternative =>
129 Analyze_Accept_Alternative (N);
131 when N_Accept_Statement =>
132 Analyze_Accept_Statement (N);
135 Analyze_Aggregate (N);
138 Analyze_Allocator (N);
141 Analyze_Short_Circuit (N);
143 when N_Assignment_Statement =>
144 Analyze_Assignment (N);
146 when N_Asynchronous_Select =>
147 Analyze_Asynchronous_Select (N);
150 Analyze_At_Clause (N);
152 when N_Attribute_Reference =>
153 Analyze_Attribute (N);
155 when N_Attribute_Definition_Clause =>
156 Analyze_Attribute_Definition_Clause (N);
158 when N_Block_Statement =>
159 Analyze_Block_Statement (N);
161 when N_Case_Statement =>
162 Analyze_Case_Statement (N);
164 when N_Character_Literal =>
165 Analyze_Character_Literal (N);
167 when N_Code_Statement =>
168 Analyze_Code_Statement (N);
170 when N_Compilation_Unit =>
171 Analyze_Compilation_Unit (N);
173 when N_Component_Declaration =>
174 Analyze_Component_Declaration (N);
176 when N_Conditional_Expression =>
177 Analyze_Conditional_Expression (N);
179 when N_Conditional_Entry_Call =>
180 Analyze_Conditional_Entry_Call (N);
182 when N_Delay_Alternative =>
183 Analyze_Delay_Alternative (N);
185 when N_Delay_Relative_Statement =>
186 Analyze_Delay_Relative (N);
188 when N_Delay_Until_Statement =>
189 Analyze_Delay_Until (N);
192 Analyze_Entry_Body (N);
194 when N_Entry_Body_Formal_Part =>
195 Analyze_Entry_Body_Formal_Part (N);
197 when N_Entry_Call_Alternative =>
198 Analyze_Entry_Call_Alternative (N);
200 when N_Entry_Declaration =>
201 Analyze_Entry_Declaration (N);
203 when N_Entry_Index_Specification =>
204 Analyze_Entry_Index_Specification (N);
206 when N_Enumeration_Representation_Clause =>
207 Analyze_Enumeration_Representation_Clause (N);
209 when N_Exception_Declaration =>
210 Analyze_Exception_Declaration (N);
212 when N_Exception_Renaming_Declaration =>
213 Analyze_Exception_Renaming (N);
215 when N_Exit_Statement =>
216 Analyze_Exit_Statement (N);
218 when N_Expanded_Name =>
219 Analyze_Expanded_Name (N);
221 when N_Explicit_Dereference =>
222 Analyze_Explicit_Dereference (N);
224 when N_Extended_Return_Statement =>
225 Analyze_Extended_Return_Statement (N);
227 when N_Extension_Aggregate =>
228 Analyze_Aggregate (N);
230 when N_Formal_Object_Declaration =>
231 Analyze_Formal_Object_Declaration (N);
233 when N_Formal_Package_Declaration =>
234 Analyze_Formal_Package (N);
236 when N_Formal_Subprogram_Declaration =>
237 Analyze_Formal_Subprogram (N);
239 when N_Formal_Type_Declaration =>
240 Analyze_Formal_Type_Declaration (N);
242 when N_Free_Statement =>
243 Analyze_Free_Statement (N);
245 when N_Freeze_Entity =>
246 null; -- no semantic processing required
248 when N_Full_Type_Declaration =>
249 Analyze_Type_Declaration (N);
251 when N_Function_Call =>
252 Analyze_Function_Call (N);
254 when N_Function_Instantiation =>
255 Analyze_Function_Instantiation (N);
257 when N_Generic_Function_Renaming_Declaration =>
258 Analyze_Generic_Function_Renaming (N);
260 when N_Generic_Package_Declaration =>
261 Analyze_Generic_Package_Declaration (N);
263 when N_Generic_Package_Renaming_Declaration =>
264 Analyze_Generic_Package_Renaming (N);
266 when N_Generic_Procedure_Renaming_Declaration =>
267 Analyze_Generic_Procedure_Renaming (N);
269 when N_Generic_Subprogram_Declaration =>
270 Analyze_Generic_Subprogram_Declaration (N);
272 when N_Goto_Statement =>
273 Analyze_Goto_Statement (N);
275 when N_Handled_Sequence_Of_Statements =>
276 Analyze_Handled_Statements (N);
279 Analyze_Identifier (N);
281 when N_If_Statement =>
282 Analyze_If_Statement (N);
284 when N_Implicit_Label_Declaration =>
285 Analyze_Implicit_Label_Declaration (N);
288 Analyze_Membership_Op (N);
290 when N_Incomplete_Type_Declaration =>
291 Analyze_Incomplete_Type_Decl (N);
293 when N_Indexed_Component =>
294 Analyze_Indexed_Component_Form (N);
296 when N_Integer_Literal =>
297 Analyze_Integer_Literal (N);
299 when N_Itype_Reference =>
300 Analyze_Itype_Reference (N);
305 when N_Loop_Statement =>
306 Analyze_Loop_Statement (N);
309 Analyze_Membership_Op (N);
314 when N_Null_Statement =>
315 Analyze_Null_Statement (N);
317 when N_Number_Declaration =>
318 Analyze_Number_Declaration (N);
320 when N_Object_Declaration =>
321 Analyze_Object_Declaration (N);
323 when N_Object_Renaming_Declaration =>
324 Analyze_Object_Renaming (N);
326 when N_Operator_Symbol =>
327 Analyze_Operator_Symbol (N);
330 Analyze_Unary_Op (N);
333 Analyze_Arithmetic_Op (N);
336 Analyze_Logical_Op (N);
339 Analyze_Concatenation (N);
342 Analyze_Arithmetic_Op (N);
345 Analyze_Equality_Op (N);
348 Analyze_Arithmetic_Op (N);
351 Analyze_Comparison_Op (N);
354 Analyze_Comparison_Op (N);
357 Analyze_Comparison_Op (N);
360 Analyze_Comparison_Op (N);
363 Analyze_Unary_Op (N);
366 Analyze_Arithmetic_Op (N);
368 when N_Op_Multiply =>
369 Analyze_Arithmetic_Op (N);
372 Analyze_Equality_Op (N);
375 Analyze_Negation (N);
378 Analyze_Logical_Op (N);
381 Analyze_Unary_Op (N);
384 Analyze_Arithmetic_Op (N);
386 when N_Op_Rotate_Left =>
387 Analyze_Arithmetic_Op (N);
389 when N_Op_Rotate_Right =>
390 Analyze_Arithmetic_Op (N);
392 when N_Op_Shift_Left =>
393 Analyze_Arithmetic_Op (N);
395 when N_Op_Shift_Right =>
396 Analyze_Arithmetic_Op (N);
398 when N_Op_Shift_Right_Arithmetic =>
399 Analyze_Arithmetic_Op (N);
401 when N_Op_Subtract =>
402 Analyze_Arithmetic_Op (N);
405 Analyze_Logical_Op (N);
408 Analyze_Short_Circuit (N);
410 when N_Others_Choice =>
411 Analyze_Others_Choice (N);
413 when N_Package_Body =>
414 Analyze_Package_Body (N);
416 when N_Package_Body_Stub =>
417 Analyze_Package_Body_Stub (N);
419 when N_Package_Declaration =>
420 Analyze_Package_Declaration (N);
422 when N_Package_Instantiation =>
423 Analyze_Package_Instantiation (N);
425 when N_Package_Renaming_Declaration =>
426 Analyze_Package_Renaming (N);
428 when N_Package_Specification =>
429 Analyze_Package_Specification (N);
431 when N_Parameter_Association =>
432 Analyze_Parameter_Association (N);
437 when N_Private_Extension_Declaration =>
438 Analyze_Private_Extension_Declaration (N);
440 when N_Private_Type_Declaration =>
441 Analyze_Private_Type_Declaration (N);
443 when N_Procedure_Call_Statement =>
444 Analyze_Procedure_Call (N);
446 when N_Procedure_Instantiation =>
447 Analyze_Procedure_Instantiation (N);
449 when N_Protected_Body =>
450 Analyze_Protected_Body (N);
452 when N_Protected_Body_Stub =>
453 Analyze_Protected_Body_Stub (N);
455 when N_Protected_Definition =>
456 Analyze_Protected_Definition (N);
458 when N_Protected_Type_Declaration =>
459 Analyze_Protected_Type (N);
461 when N_Qualified_Expression =>
462 Analyze_Qualified_Expression (N);
464 when N_Raise_Statement =>
465 Analyze_Raise_Statement (N);
467 when N_Raise_xxx_Error =>
468 Analyze_Raise_xxx_Error (N);
473 when N_Range_Constraint =>
474 Analyze_Range (Range_Expression (N));
476 when N_Real_Literal =>
477 Analyze_Real_Literal (N);
479 when N_Record_Representation_Clause =>
480 Analyze_Record_Representation_Clause (N);
483 Analyze_Reference (N);
485 when N_Requeue_Statement =>
488 when N_Simple_Return_Statement =>
489 Analyze_Simple_Return_Statement (N);
491 when N_Selected_Component =>
492 Find_Selected_Component (N);
493 -- ??? why not Analyze_Selected_Component, needs comments
495 when N_Selective_Accept =>
496 Analyze_Selective_Accept (N);
498 when N_Single_Protected_Declaration =>
499 Analyze_Single_Protected (N);
501 when N_Single_Task_Declaration =>
502 Analyze_Single_Task (N);
507 when N_String_Literal =>
508 Analyze_String_Literal (N);
510 when N_Subprogram_Body =>
511 Analyze_Subprogram_Body (N);
513 when N_Subprogram_Body_Stub =>
514 Analyze_Subprogram_Body_Stub (N);
516 when N_Subprogram_Declaration =>
517 Analyze_Subprogram_Declaration (N);
519 when N_Subprogram_Info =>
520 Analyze_Subprogram_Info (N);
522 when N_Subprogram_Renaming_Declaration =>
523 Analyze_Subprogram_Renaming (N);
525 when N_Subtype_Declaration =>
526 Analyze_Subtype_Declaration (N);
528 when N_Subtype_Indication =>
529 Analyze_Subtype_Indication (N);
535 Analyze_Task_Body (N);
537 when N_Task_Body_Stub =>
538 Analyze_Task_Body_Stub (N);
540 when N_Task_Definition =>
541 Analyze_Task_Definition (N);
543 when N_Task_Type_Declaration =>
544 Analyze_Task_Type (N);
546 when N_Terminate_Alternative =>
547 Analyze_Terminate_Alternative (N);
549 when N_Timed_Entry_Call =>
550 Analyze_Timed_Entry_Call (N);
552 when N_Triggering_Alternative =>
553 Analyze_Triggering_Alternative (N);
555 when N_Type_Conversion =>
556 Analyze_Type_Conversion (N);
558 when N_Unchecked_Expression =>
559 Analyze_Unchecked_Expression (N);
561 when N_Unchecked_Type_Conversion =>
562 Analyze_Unchecked_Type_Conversion (N);
564 when N_Use_Package_Clause =>
565 Analyze_Use_Package (N);
567 when N_Use_Type_Clause =>
568 Analyze_Use_Type (N);
570 when N_Validate_Unchecked_Conversion =>
573 when N_Variant_Part =>
574 Analyze_Variant_Part (N);
576 when N_With_Clause =>
577 Analyze_With_Clause (N);
579 -- A call to analyze the Empty node is an error, but most likely
580 -- it is an error caused by an attempt to analyze a malformed
581 -- piece of tree caused by some other error, so if there have
582 -- been any other errors, we just ignore it, otherwise it is
583 -- a real internal error which we complain about.
585 -- We must also consider the case of call to a runtime function
586 -- that is not available in the configurable runtime.
589 pragma Assert (Serious_Errors_Detected /= 0
590 or else Configurable_Run_Time_Violations /= 0);
593 -- A call to analyze the error node is simply ignored, to avoid
594 -- causing cascaded errors (happens of course only in error cases)
599 -- Push/Pop nodes normally don't come through an analyze call. An
600 -- exception is the dummy ones bracketing a subprogram body. In any
601 -- case there is nothing to be done to analyze such nodes.
603 when N_Push_Pop_xxx_Label =>
606 -- SCIL nodes don't need analysis because they are decorated when
607 -- they are built. They are added to the tree by Insert_Actions and
608 -- the call to analyze them is generated when the full list is
612 N_SCIL_Dispatch_Table_Object_Init |
613 N_SCIL_Dispatch_Table_Tag_Init |
614 N_SCIL_Dispatching_Call |
618 -- For the remaining node types, we generate compiler abort, because
619 -- these nodes are always analyzed within the Sem_Chn routines and
620 -- there should never be a case of making a call to the main Analyze
621 -- routine for these node kinds. For example, an N_Access_Definition
622 -- node appears only in the context of a type declaration, and is
623 -- processed by the analyze routine for type declarations.
627 N_Access_Definition |
628 N_Access_Function_Definition |
629 N_Access_Procedure_Definition |
630 N_Access_To_Object_Definition |
631 N_Case_Statement_Alternative |
632 N_Compilation_Unit_Aux |
633 N_Component_Association |
635 N_Component_Definition |
637 N_Constrained_Array_Definition |
638 N_Decimal_Fixed_Point_Definition |
639 N_Defining_Character_Literal |
640 N_Defining_Identifier |
641 N_Defining_Operator_Symbol |
642 N_Defining_Program_Unit_Name |
644 N_Derived_Type_Definition |
646 N_Digits_Constraint |
647 N_Discriminant_Association |
648 N_Discriminant_Specification |
650 N_Entry_Call_Statement |
651 N_Enumeration_Type_Definition |
652 N_Exception_Handler |
653 N_Floating_Point_Definition |
654 N_Formal_Decimal_Fixed_Point_Definition |
655 N_Formal_Derived_Type_Definition |
656 N_Formal_Discrete_Type_Definition |
657 N_Formal_Floating_Point_Definition |
658 N_Formal_Modular_Type_Definition |
659 N_Formal_Ordinary_Fixed_Point_Definition |
660 N_Formal_Private_Type_Definition |
661 N_Formal_Signed_Integer_Type_Definition |
662 N_Function_Specification |
663 N_Generic_Association |
664 N_Index_Or_Discriminant_Constraint |
666 N_Loop_Parameter_Specification |
668 N_Modular_Type_Definition |
669 N_Ordinary_Fixed_Point_Definition |
670 N_Parameter_Specification |
671 N_Pragma_Argument_Association |
672 N_Procedure_Specification |
673 N_Real_Range_Specification |
674 N_Record_Definition |
675 N_Signed_Integer_Type_Definition |
676 N_Unconstrained_Array_Definition |
684 Debug_A_Exit ("analyzing ", N, " (done)");
686 -- Now that we have analyzed the node, we call the expander to perform
687 -- possible expansion. We skip this for subexpressions, because we don't
688 -- have the type yet, and the expander will need to know the type before
689 -- it can do its job. For subexpression nodes, the call to the expander
690 -- happens in Sem_Res.Resolve. A special exception is Raise_xxx_Error,
691 -- which can appear in a statement context, and needs expanding now in
692 -- the case (distinguished by Etype, as documented in Sinfo).
694 -- The Analyzed flag is also set at this point for non-subexpression
695 -- nodes (in the case of subexpression nodes, we can't set the flag yet,
696 -- since resolution and expansion have not yet been completed). Note
697 -- that for N_Raise_xxx_Error we have to distinguish the expression
698 -- case from the statement case.
700 if Nkind (N) not in N_Subexpr
701 or else (Nkind (N) in N_Raise_xxx_Error
702 and then Etype (N) = Standard_Void_Type)
708 -- Version with check(s) suppressed
710 procedure Analyze (N : Node_Id; Suppress : Check_Id) is
712 if Suppress = All_Checks then
714 Svg : constant Suppress_Array := Scope_Suppress;
716 Scope_Suppress := (others => True);
718 Scope_Suppress := Svg;
723 Svg : constant Boolean := Scope_Suppress (Suppress);
725 Scope_Suppress (Suppress) := True;
727 Scope_Suppress (Suppress) := Svg;
736 procedure Analyze_List (L : List_Id) is
741 while Present (Node) loop
747 -- Version with check(s) suppressed
749 procedure Analyze_List (L : List_Id; Suppress : Check_Id) is
751 if Suppress = All_Checks then
753 Svg : constant Suppress_Array := Scope_Suppress;
755 Scope_Suppress := (others => True);
757 Scope_Suppress := Svg;
762 Svg : constant Boolean := Scope_Suppress (Suppress);
764 Scope_Suppress (Suppress) := True;
766 Scope_Suppress (Suppress) := Svg;
771 --------------------------
772 -- Copy_Suppress_Status --
773 --------------------------
775 procedure Copy_Suppress_Status
781 pragma Warnings (Off, Found);
783 procedure Search_Stack
784 (Top : Suppress_Stack_Entry_Ptr;
785 Found : out Boolean);
786 -- Search given suppress stack for matching entry for entity. If found
787 -- then set Checks_May_Be_Suppressed on To, and push an appropriate
788 -- entry for To onto the local suppress stack.
794 procedure Search_Stack
795 (Top : Suppress_Stack_Entry_Ptr;
798 Ptr : Suppress_Stack_Entry_Ptr;
802 while Ptr /= null loop
804 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
807 Set_Checks_May_Be_Suppressed (To, True);
808 Push_Local_Suppress_Stack_Entry
824 -- Start of processing for Copy_Suppress_Status
827 if not Checks_May_Be_Suppressed (From) then
831 -- First search the local entity suppress stack, we search this in
832 -- reverse order so that we get the innermost entry that applies to
833 -- this case if there are nested entries. Note that for the purpose
834 -- of this procedure we are ONLY looking for entries corresponding
835 -- to a two-argument Suppress, where the second argument matches From.
837 Search_Stack (Global_Suppress_Stack_Top, Found);
843 -- Now search the global entity suppress table for a matching entry
844 -- We also search this in reverse order so that if there are multiple
845 -- pragmas for the same entity, the last one applies.
847 Search_Stack (Local_Suppress_Stack_Top, Found);
848 end Copy_Suppress_Status;
850 -------------------------
851 -- Enter_Generic_Scope --
852 -------------------------
854 procedure Enter_Generic_Scope (S : Entity_Id) is
856 if No (Outer_Generic_Scope) then
857 Outer_Generic_Scope := S;
859 end Enter_Generic_Scope;
861 ------------------------
862 -- Exit_Generic_Scope --
863 ------------------------
865 procedure Exit_Generic_Scope (S : Entity_Id) is
867 if S = Outer_Generic_Scope then
868 Outer_Generic_Scope := Empty;
870 end Exit_Generic_Scope;
872 -----------------------
873 -- Explicit_Suppress --
874 -----------------------
876 function Explicit_Suppress (E : Entity_Id; C : Check_Id) return Boolean is
877 Ptr : Suppress_Stack_Entry_Ptr;
880 if not Checks_May_Be_Suppressed (E) then
884 Ptr := Global_Suppress_Stack_Top;
885 while Ptr /= null loop
887 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
897 end Explicit_Suppress;
899 -----------------------------
900 -- External_Ref_In_Generic --
901 -----------------------------
903 function External_Ref_In_Generic (E : Entity_Id) return Boolean is
907 -- Entity is global if defined outside of current outer_generic_scope:
908 -- Either the entity has a smaller depth that the outer generic, or it
909 -- is in a different compilation unit, or it is defined within a unit
910 -- in the same compilation, that is not within the outer_generic.
912 if No (Outer_Generic_Scope) then
915 elsif Scope_Depth (Scope (E)) < Scope_Depth (Outer_Generic_Scope)
916 or else not In_Same_Source_Unit (E, Outer_Generic_Scope)
923 while Present (Scop) loop
924 if Scop = Outer_Generic_Scope then
926 elsif Scope_Depth (Scop) < Scope_Depth (Outer_Generic_Scope) then
929 Scop := Scope (Scop);
935 end External_Ref_In_Generic;
941 procedure Initialize is
942 Next : Suppress_Stack_Entry_Ptr;
944 procedure Free is new Unchecked_Deallocation
945 (Suppress_Stack_Entry, Suppress_Stack_Entry_Ptr);
948 -- Free any global suppress stack entries from a previous invocation
949 -- of the compiler (in the normal case this loop does nothing).
951 while Suppress_Stack_Entries /= null loop
952 Next := Global_Suppress_Stack_Top.Next;
953 Free (Suppress_Stack_Entries);
954 Suppress_Stack_Entries := Next;
957 Local_Suppress_Stack_Top := null;
958 Global_Suppress_Stack_Top := null;
960 -- Clear scope stack, and reset global variables
963 Unloaded_Subunits := False;
966 ------------------------------
967 -- Insert_After_And_Analyze --
968 ------------------------------
970 procedure Insert_After_And_Analyze (N : Node_Id; M : Node_Id) is
976 -- If we are not at the end of the list, then the easiest
977 -- coding is simply to insert before our successor
979 if Present (Next (N)) then
980 Insert_Before_And_Analyze (Next (N), M);
982 -- Case of inserting at the end of the list
985 -- Capture the Node_Id of the node to be inserted. This Node_Id
986 -- will still be the same after the insert operation.
991 -- Now just analyze from the inserted node to the end of
992 -- the new list (note that this properly handles the case
993 -- where any of the analyze calls result in the insertion of
994 -- nodes after the analyzed node, expecting analysis).
996 while Present (Node) loop
998 Mark_Rewrite_Insertion (Node);
1003 end Insert_After_And_Analyze;
1005 -- Version with check(s) suppressed
1007 procedure Insert_After_And_Analyze
1010 Suppress : Check_Id)
1013 if Suppress = All_Checks then
1015 Svg : constant Suppress_Array := Scope_Suppress;
1017 Scope_Suppress := (others => True);
1018 Insert_After_And_Analyze (N, M);
1019 Scope_Suppress := Svg;
1024 Svg : constant Boolean := Scope_Suppress (Suppress);
1026 Scope_Suppress (Suppress) := True;
1027 Insert_After_And_Analyze (N, M);
1028 Scope_Suppress (Suppress) := Svg;
1031 end Insert_After_And_Analyze;
1033 -------------------------------
1034 -- Insert_Before_And_Analyze --
1035 -------------------------------
1037 procedure Insert_Before_And_Analyze (N : Node_Id; M : Node_Id) is
1043 -- Capture the Node_Id of the first list node to be inserted.
1044 -- This will still be the first node after the insert operation,
1045 -- since Insert_List_After does not modify the Node_Id values.
1048 Insert_Before (N, M);
1050 -- The insertion does not change the Id's of any of the nodes in
1051 -- the list, and they are still linked, so we can simply loop from
1052 -- the original first node until we meet the node before which the
1053 -- insertion is occurring. Note that this properly handles the case
1054 -- where any of the analyzed nodes insert nodes after themselves,
1055 -- expecting them to get analyzed.
1057 while Node /= N loop
1059 Mark_Rewrite_Insertion (Node);
1063 end Insert_Before_And_Analyze;
1065 -- Version with check(s) suppressed
1067 procedure Insert_Before_And_Analyze
1070 Suppress : Check_Id)
1073 if Suppress = All_Checks then
1075 Svg : constant Suppress_Array := Scope_Suppress;
1077 Scope_Suppress := (others => True);
1078 Insert_Before_And_Analyze (N, M);
1079 Scope_Suppress := Svg;
1084 Svg : constant Boolean := Scope_Suppress (Suppress);
1086 Scope_Suppress (Suppress) := True;
1087 Insert_Before_And_Analyze (N, M);
1088 Scope_Suppress (Suppress) := Svg;
1091 end Insert_Before_And_Analyze;
1093 -----------------------------------
1094 -- Insert_List_After_And_Analyze --
1095 -----------------------------------
1097 procedure Insert_List_After_And_Analyze (N : Node_Id; L : List_Id) is
1098 After : constant Node_Id := Next (N);
1102 if Is_Non_Empty_List (L) then
1104 -- Capture the Node_Id of the first list node to be inserted.
1105 -- This will still be the first node after the insert operation,
1106 -- since Insert_List_After does not modify the Node_Id values.
1109 Insert_List_After (N, L);
1111 -- Now just analyze from the original first node until we get to
1112 -- the successor of the original insertion point (which may be
1113 -- Empty if the insertion point was at the end of the list). Note
1114 -- that this properly handles the case where any of the analyze
1115 -- calls result in the insertion of nodes after the analyzed
1116 -- node (possibly calling this routine recursively).
1118 while Node /= After loop
1120 Mark_Rewrite_Insertion (Node);
1124 end Insert_List_After_And_Analyze;
1126 -- Version with check(s) suppressed
1128 procedure Insert_List_After_And_Analyze
1129 (N : Node_Id; L : List_Id; Suppress : Check_Id)
1132 if Suppress = All_Checks then
1134 Svg : constant Suppress_Array := Scope_Suppress;
1136 Scope_Suppress := (others => True);
1137 Insert_List_After_And_Analyze (N, L);
1138 Scope_Suppress := Svg;
1143 Svg : constant Boolean := Scope_Suppress (Suppress);
1145 Scope_Suppress (Suppress) := True;
1146 Insert_List_After_And_Analyze (N, L);
1147 Scope_Suppress (Suppress) := Svg;
1150 end Insert_List_After_And_Analyze;
1152 ------------------------------------
1153 -- Insert_List_Before_And_Analyze --
1154 ------------------------------------
1156 procedure Insert_List_Before_And_Analyze (N : Node_Id; L : List_Id) is
1160 if Is_Non_Empty_List (L) then
1162 -- Capture the Node_Id of the first list node to be inserted.
1163 -- This will still be the first node after the insert operation,
1164 -- since Insert_List_After does not modify the Node_Id values.
1167 Insert_List_Before (N, L);
1169 -- The insertion does not change the Id's of any of the nodes in
1170 -- the list, and they are still linked, so we can simply loop from
1171 -- the original first node until we meet the node before which the
1172 -- insertion is occurring. Note that this properly handles the case
1173 -- where any of the analyzed nodes insert nodes after themselves,
1174 -- expecting them to get analyzed.
1176 while Node /= N loop
1178 Mark_Rewrite_Insertion (Node);
1182 end Insert_List_Before_And_Analyze;
1184 -- Version with check(s) suppressed
1186 procedure Insert_List_Before_And_Analyze
1187 (N : Node_Id; L : List_Id; Suppress : Check_Id)
1190 if Suppress = All_Checks then
1192 Svg : constant Suppress_Array := Scope_Suppress;
1194 Scope_Suppress := (others => True);
1195 Insert_List_Before_And_Analyze (N, L);
1196 Scope_Suppress := Svg;
1201 Svg : constant Boolean := Scope_Suppress (Suppress);
1203 Scope_Suppress (Suppress) := True;
1204 Insert_List_Before_And_Analyze (N, L);
1205 Scope_Suppress (Suppress) := Svg;
1208 end Insert_List_Before_And_Analyze;
1210 -------------------------
1211 -- Is_Check_Suppressed --
1212 -------------------------
1214 function Is_Check_Suppressed (E : Entity_Id; C : Check_Id) return Boolean is
1216 Ptr : Suppress_Stack_Entry_Ptr;
1219 -- First search the local entity suppress stack, we search this from the
1220 -- top of the stack down, so that we get the innermost entry that
1221 -- applies to this case if there are nested entries.
1223 Ptr := Local_Suppress_Stack_Top;
1224 while Ptr /= null loop
1225 if (Ptr.Entity = Empty or else Ptr.Entity = E)
1226 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
1228 return Ptr.Suppress;
1234 -- Now search the global entity suppress table for a matching entry
1235 -- We also search this from the top down so that if there are multiple
1236 -- pragmas for the same entity, the last one applies (not clear what
1237 -- or whether the RM specifies this handling, but it seems reasonable).
1239 Ptr := Global_Suppress_Stack_Top;
1240 while Ptr /= null loop
1241 if (Ptr.Entity = Empty or else Ptr.Entity = E)
1242 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
1244 return Ptr.Suppress;
1250 -- If we did not find a matching entry, then use the normal scope
1251 -- suppress value after all (actually this will be the global setting
1252 -- since it clearly was not overridden at any point). For a predefined
1253 -- check, we test the specific flag. For a user defined check, we check
1254 -- the All_Checks flag.
1256 if C in Predefined_Check_Id then
1257 return Scope_Suppress (C);
1259 return Scope_Suppress (All_Checks);
1261 end Is_Check_Suppressed;
1269 Scope_Stack.Locked := True;
1270 Scope_Stack.Release;
1273 --------------------------------------
1274 -- Push_Global_Suppress_Stack_Entry --
1275 --------------------------------------
1277 procedure Push_Global_Suppress_Stack_Entry
1278 (Entity : Entity_Id;
1283 Global_Suppress_Stack_Top :=
1284 new Suppress_Stack_Entry'
1287 Suppress => Suppress,
1288 Prev => Global_Suppress_Stack_Top,
1289 Next => Suppress_Stack_Entries);
1290 Suppress_Stack_Entries := Global_Suppress_Stack_Top;
1293 end Push_Global_Suppress_Stack_Entry;
1295 -------------------------------------
1296 -- Push_Local_Suppress_Stack_Entry --
1297 -------------------------------------
1299 procedure Push_Local_Suppress_Stack_Entry
1300 (Entity : Entity_Id;
1305 Local_Suppress_Stack_Top :=
1306 new Suppress_Stack_Entry'
1309 Suppress => Suppress,
1310 Prev => Local_Suppress_Stack_Top,
1311 Next => Suppress_Stack_Entries);
1312 Suppress_Stack_Entries := Local_Suppress_Stack_Top;
1315 end Push_Local_Suppress_Stack_Entry;
1321 procedure Semantics (Comp_Unit : Node_Id) is
1323 -- The following locations save the corresponding global flags and
1324 -- variables so that they can be restored on completion. This is
1325 -- needed so that calls to Rtsfind start with the proper default
1326 -- values for these variables, and also that such calls do not
1327 -- disturb the settings for units being analyzed at a higher level.
1329 S_Current_Sem_Unit : constant Unit_Number_Type := Current_Sem_Unit;
1330 S_Full_Analysis : constant Boolean := Full_Analysis;
1331 S_GNAT_Mode : constant Boolean := GNAT_Mode;
1332 S_Global_Dis_Names : constant Boolean := Global_Discard_Names;
1333 S_In_Spec_Expr : constant Boolean := In_Spec_Expression;
1334 S_Inside_A_Generic : constant Boolean := Inside_A_Generic;
1335 S_New_Nodes_OK : constant Int := New_Nodes_OK;
1336 S_Outer_Gen_Scope : constant Entity_Id := Outer_Generic_Scope;
1338 Generic_Main : constant Boolean :=
1339 Nkind (Unit (Cunit (Main_Unit)))
1340 in N_Generic_Declaration;
1341 -- If the main unit is generic, every compiled unit, including its
1342 -- context, is compiled with expansion disabled.
1344 Save_Config_Switches : Config_Switches_Type;
1345 -- Variable used to save values of config switches while we analyze
1346 -- the new unit, to be restored on exit for proper recursive behavior.
1348 procedure Do_Analyze;
1349 -- Procedure to analyze the compilation unit. This is called more
1350 -- than once when the high level optimizer is activated.
1356 procedure Do_Analyze is
1359 Push_Scope (Standard_Standard);
1360 Scope_Suppress := Suppress_Options;
1362 (Scope_Stack.Last).Component_Alignment_Default := Calign_Default;
1364 (Scope_Stack.Last).Is_Active_Stack_Base := True;
1365 Outer_Generic_Scope := Empty;
1367 -- Now analyze the top level compilation unit node
1369 Analyze (Comp_Unit);
1371 -- Check for scope mismatch on exit from compilation
1373 pragma Assert (Current_Scope = Standard_Standard
1374 or else Comp_Unit = Cunit (Main_Unit));
1376 -- Then pop entry for Standard, and pop implicit types
1379 Restore_Scope_Stack;
1382 Already_Analyzed : constant Boolean := Analyzed (Comp_Unit);
1384 -- Start of processing for Semantics
1387 if Debug_Unit_Walk then
1388 if Already_Analyzed then
1389 Write_Str ("(done)");
1393 (Get_Cunit_Unit_Number (Comp_Unit),
1399 Compiler_State := Analyzing;
1400 Current_Sem_Unit := Get_Cunit_Unit_Number (Comp_Unit);
1402 -- Compile predefined units with GNAT_Mode set to True, to properly
1403 -- process the categorization stuff. However, do not set GNAT_Mode
1404 -- to True for the renamings units (Text_IO, IO_Exceptions, Direct_IO,
1405 -- Sequential_IO) as this would prevent pragma Extend_System from being
1406 -- taken into account, for example when Text_IO is renaming DEC.Text_IO.
1408 -- Cleaner might be to do the kludge at the point of excluding the
1409 -- pragma (do not exclude for renamings ???)
1411 if Is_Predefined_File_Name
1412 (Unit_File_Name (Current_Sem_Unit), Renamings_Included => False)
1417 if Generic_Main then
1418 Expander_Mode_Save_And_Set (False);
1420 Expander_Mode_Save_And_Set
1421 (Operating_Mode = Generate_Code or Debug_Flag_X);
1424 Full_Analysis := True;
1425 Inside_A_Generic := False;
1426 In_Spec_Expression := False;
1428 Set_Comes_From_Source_Default (False);
1429 Save_Opt_Config_Switches (Save_Config_Switches);
1430 Set_Opt_Config_Switches
1431 (Is_Internal_File_Name (Unit_File_Name (Current_Sem_Unit)),
1432 Current_Sem_Unit = Main_Unit);
1434 -- Only do analysis of unit that has not already been analyzed
1436 if not Analyzed (Comp_Unit) then
1437 Initialize_Version (Current_Sem_Unit);
1439 Expander_Mode_Save_And_Set (False);
1442 Reset_Analyzed_Flags (Comp_Unit);
1443 Expander_Mode_Restore;
1444 High_Level_Optimize (Comp_Unit);
1448 -- Do analysis, and then append the compilation unit onto the
1449 -- Comp_Unit_List, if appropriate. This is done after analysis, so
1450 -- if this unit depends on some others, they have already been
1451 -- appended. We ignore bodies, except for the main unit itself. We
1452 -- have also to guard against ill-formed subunits that have an
1453 -- improper context.
1457 if Present (Comp_Unit)
1458 and then Nkind (Unit (Comp_Unit)) in N_Proper_Body
1459 and then not In_Extended_Main_Source_Unit (Comp_Unit)
1464 -- Initialize if first time
1466 if No (Comp_Unit_List) then
1467 Comp_Unit_List := New_Elmt_List;
1470 Append_Elmt (Comp_Unit, Comp_Unit_List);
1472 if Debug_Unit_Walk then
1473 Write_Str ("Appending ");
1475 (Get_Cunit_Unit_Number (Comp_Unit), Unit (Comp_Unit));
1480 -- Save indication of dynamic elaboration checks for ALI file
1482 Set_Dynamic_Elab (Current_Sem_Unit, Dynamic_Elaboration_Checks);
1484 -- Restore settings of saved switches to entry values
1486 Current_Sem_Unit := S_Current_Sem_Unit;
1487 Full_Analysis := S_Full_Analysis;
1488 Global_Discard_Names := S_Global_Dis_Names;
1489 GNAT_Mode := S_GNAT_Mode;
1490 In_Spec_Expression := S_In_Spec_Expr;
1491 Inside_A_Generic := S_Inside_A_Generic;
1492 New_Nodes_OK := S_New_Nodes_OK;
1493 Outer_Generic_Scope := S_Outer_Gen_Scope;
1495 Restore_Opt_Config_Switches (Save_Config_Switches);
1496 Expander_Mode_Restore;
1498 if Debug_Unit_Walk then
1501 if Already_Analyzed then
1502 Write_Str ("(done)");
1506 (Get_Cunit_Unit_Number (Comp_Unit),
1512 ------------------------
1513 -- Walk_Library_Items --
1514 ------------------------
1516 procedure Walk_Library_Items is
1517 type Unit_Number_Set is array (Main_Unit .. Last_Unit) of Boolean;
1518 pragma Pack (Unit_Number_Set);
1519 Seen, Done : Unit_Number_Set := (others => False);
1520 -- Seen (X) is True after we have seen unit X in the walk. This is used
1521 -- to prevent processing the same unit more than once. Done (X) is True
1522 -- after we have fully processed X, and is used only for debugging
1523 -- printouts and assertions.
1525 Do_Main : Boolean := False;
1526 -- Flag to delay processing the main body until after all other units.
1527 -- This is needed because the spec of the main unit may appear in the
1528 -- context of some other unit. We do not want this to force processing
1529 -- of the main body before all other units have been processed.
1531 procedure Do_Action (CU : Node_Id; Item : Node_Id);
1532 -- Calls Action, with some validity checks
1534 procedure Do_Unit_And_Dependents (CU : Node_Id; Item : Node_Id);
1535 -- Calls Do_Action, first on the units with'ed by this one, then on
1536 -- this unit. If it's an instance body, do the spec first. If it is
1537 -- an instance spec, do the body last.
1543 procedure Do_Action (CU : Node_Id; Item : Node_Id) is
1545 -- This calls Action at the end. All the preceding code is just
1546 -- assertions and debugging output.
1548 pragma Assert (No (CU) or else Nkind (CU) = N_Compilation_Unit);
1550 case Nkind (Item) is
1551 when N_Generic_Subprogram_Declaration |
1552 N_Generic_Package_Declaration |
1553 N_Package_Declaration |
1554 N_Subprogram_Declaration |
1555 N_Subprogram_Renaming_Declaration |
1556 N_Package_Renaming_Declaration |
1557 N_Generic_Function_Renaming_Declaration |
1558 N_Generic_Package_Renaming_Declaration |
1559 N_Generic_Procedure_Renaming_Declaration =>
1565 when N_Package_Body =>
1567 -- Package bodies are processed immediately after the
1568 -- corresponding spec.
1572 when N_Subprogram_Body =>
1574 -- A subprogram body must be the main unit
1576 pragma Assert (Acts_As_Spec (CU)
1577 or else CU = Cunit (Main_Unit));
1580 -- All other cases cannot happen
1582 when N_Function_Instantiation |
1583 N_Procedure_Instantiation |
1584 N_Package_Instantiation =>
1585 pragma Assert (False, "instantiation");
1589 pragma Assert (False, "subunit");
1593 pragma Assert (False);
1597 if Present (CU) then
1598 pragma Assert (Item /= Stand.Standard_Package_Node);
1599 pragma Assert (Item = Unit (CU));
1602 Unit_Num : constant Unit_Number_Type :=
1603 Get_Cunit_Unit_Number (CU);
1605 procedure Assert_Done (Withed_Unit : Node_Id);
1606 -- Assert Withed_Unit is already Done, unless it's a body. It
1607 -- might seem strange for a with_clause to refer to a body, but
1608 -- this happens in the case of a generic instantiation, which
1609 -- gets transformed into the instance body (and the instance
1610 -- spec is also created). With clauses pointing to the
1611 -- instantiation end up pointing to the instance body.
1617 procedure Assert_Done (Withed_Unit : Node_Id) is
1619 if not Done (Get_Cunit_Unit_Number (Withed_Unit)) then
1621 (Unit (Withed_Unit),
1622 N_Generic_Package_Declaration,
1627 (Unit_Name (Get_Cunit_Unit_Number (Withed_Unit)));
1628 Write_Str (" not yet walked!");
1630 if Get_Cunit_Unit_Number (Withed_Unit) = Unit_Num then
1631 Write_Str (" (self-ref)");
1636 pragma Assert (False);
1641 procedure Assert_Withed_Units_Done is
1642 new Walk_Withs (Assert_Done);
1645 if Debug_Unit_Walk then
1646 Write_Unit_Info (Unit_Num, Item, Withs => True);
1649 -- Main unit should come last (except in the case where we
1650 -- skipped System_Aux_Id, in which case we missed the things it
1654 (not Done (Main_Unit) or else Present (System_Aux_Id));
1656 -- We shouldn't do the same thing twice
1658 pragma Assert (not Done (Unit_Num));
1660 -- Everything we depend upon should already be done
1663 (Assert_Withed_Units_Done (CU, Include_Limited => False));
1667 -- Must be Standard, which has no entry in the units table
1669 pragma Assert (Item = Stand.Standard_Package_Node);
1671 if Debug_Unit_Walk then
1672 Write_Line ("Standard");
1679 ----------------------------
1680 -- Do_Unit_And_Dependents --
1681 ----------------------------
1683 procedure Do_Unit_And_Dependents (CU : Node_Id; Item : Node_Id) is
1684 Unit_Num : constant Unit_Number_Type :=
1685 Get_Cunit_Unit_Number (CU);
1687 procedure Do_Withed_Unit (Withed_Unit : Node_Id);
1688 -- Pass the buck to Do_Unit_And_Dependents
1690 --------------------
1691 -- Do_Withed_Unit --
1692 --------------------
1694 procedure Do_Withed_Unit (Withed_Unit : Node_Id) is
1695 Save_Do_Main : constant Boolean := Do_Main;
1698 -- Do not process the main unit if coming from a with_clause,
1699 -- as would happen with a parent body that has a child spec
1703 Do_Unit_And_Dependents (Withed_Unit, Unit (Withed_Unit));
1704 Do_Main := Save_Do_Main;
1707 procedure Do_Withed_Units is new Walk_Withs (Do_Withed_Unit);
1709 -- Start of processing for Do_Unit_And_Dependents
1712 if not Seen (Unit_Num) then
1714 -- Process the with clauses
1716 Do_Withed_Units (CU, Include_Limited => False);
1718 -- Process the unit if it is a spec. If it is the main unit,
1719 -- process it only if we have done all other units.
1721 if not Nkind_In (Item, N_Package_Body, N_Subprogram_Body)
1722 or else Acts_As_Spec (CU)
1724 if CU = Cunit (Main_Unit) and then not Do_Main then
1725 Seen (Unit_Num) := False;
1728 Seen (Unit_Num) := True;
1729 Do_Action (CU, Item);
1730 Done (Unit_Num) := True;
1735 -- Process bodies. The spec, if present, has been processed already.
1736 -- A body appears if it is the main, or the body of a spec that is
1737 -- in the context of the main unit, and that is instantiated, or else
1738 -- contains a generic that is instantiated, or a subprogram that is
1739 -- or a subprogram that is inlined in the main unit.
1741 -- We exclude bodies that may appear in a circular dependency list,
1742 -- where spec A depends on spec B and body of B depends on spec A.
1743 -- This is not an elaboration issue, but body B must be excluded
1744 -- from the processing.
1747 Body_Unit : Node_Id := Empty;
1748 Body_Num : Unit_Number_Type;
1750 function Circular_Dependence (B : Node_Id) return Boolean;
1751 -- Check whether this body depends on a spec that is pending,
1752 -- that is to say has been seen but not processed yet.
1754 -------------------------
1755 -- Circular_Dependence --
1756 -------------------------
1758 function Circular_Dependence (B : Node_Id) return Boolean is
1760 UN : Unit_Number_Type;
1763 Item := First (Context_Items (B));
1764 while Present (Item) loop
1765 if Nkind (Item) = N_With_Clause then
1766 UN := Get_Cunit_Unit_Number (Library_Unit (Item));
1769 and then not Done (UN)
1779 end Circular_Dependence;
1782 if Nkind (Item) = N_Package_Declaration then
1783 Body_Unit := Library_Unit (CU);
1785 elsif Nkind_In (Item, N_Package_Body, N_Subprogram_Body) then
1789 if Present (Body_Unit)
1791 -- Since specs and bodies are not done at the same time,
1792 -- guard against listing a body more than once. Bodies are
1793 -- only processed when the main unit is being processed,
1794 -- after all other units in the list. The DEC extension
1795 -- to System is excluded because of circularities.
1797 and then not Seen (Get_Cunit_Unit_Number (Body_Unit))
1800 or else Unit_Num /= Get_Source_Unit (System_Aux_Id))
1801 and then not Circular_Dependence (Body_Unit)
1804 Body_Num := Get_Cunit_Unit_Number (Body_Unit);
1805 Seen (Body_Num) := True;
1806 Do_Action (Body_Unit, Unit (Body_Unit));
1807 Done (Body_Num) := True;
1810 end Do_Unit_And_Dependents;
1812 -- Local Declarations
1816 -- Start of processing for Walk_Library_Items
1819 if Debug_Unit_Walk then
1820 Write_Line ("Walk_Library_Items:");
1824 -- Do Standard first, then walk the Comp_Unit_List
1826 Do_Action (Empty, Standard_Package_Node);
1828 -- First place the context of all instance bodies on the corresponding
1829 -- spec, because it may be needed to analyze the code at the place of
1830 -- the instantiation.
1832 Cur := First_Elmt (Comp_Unit_List);
1833 while Present (Cur) loop
1835 CU : constant Node_Id := Node (Cur);
1836 N : constant Node_Id := Unit (CU);
1839 if Nkind (N) = N_Package_Body
1840 and then Is_Generic_Instance (Defining_Entity (N))
1843 (Context_Items (CU), Context_Items (Library_Unit (CU)));
1850 -- Now traverse compilation units in order
1852 Cur := First_Elmt (Comp_Unit_List);
1853 while Present (Cur) loop
1855 CU : constant Node_Id := Node (Cur);
1856 N : constant Node_Id := Unit (CU);
1859 pragma Assert (Nkind (CU) = N_Compilation_Unit);
1863 -- If it's a body, ignore it. Bodies appear in the list only
1864 -- because of inlining/instantiations, and they are processed
1865 -- immediately after the corresponding specs. The main unit is
1866 -- processed separately after all other units.
1868 when N_Package_Body | N_Subprogram_Body =>
1871 -- It's a spec, so just do it
1874 Do_Unit_And_Dependents (CU, N);
1881 if not Done (Main_Unit) then
1885 Main_CU : constant Node_Id := Cunit (Main_Unit);
1888 -- If the main unit is an instantiation, the body appears before
1889 -- the instance spec, which is added later to the unit list. Do
1890 -- the spec if present, body will follow.
1892 if Nkind (Original_Node (Unit (Main_CU)))
1893 in N_Generic_Instantiation
1894 and then Present (Library_Unit (Main_CU))
1896 Do_Unit_And_Dependents
1897 (Library_Unit (Main_CU), Unit (Library_Unit (Main_CU)));
1899 Do_Unit_And_Dependents (Main_CU, Unit (Main_CU));
1904 if Debug_Unit_Walk then
1905 if Done /= (Done'Range => True) then
1907 Write_Line ("Ignored units:");
1911 for Unit_Num in Done'Range loop
1912 if not Done (Unit_Num) then
1914 (Unit_Num, Unit (Cunit (Unit_Num)), Withs => True);
1922 pragma Assert (Done (Main_Unit));
1924 if Debug_Unit_Walk then
1926 Write_Line ("end Walk_Library_Items.");
1928 end Walk_Library_Items;
1934 procedure Walk_Withs (CU : Node_Id; Include_Limited : Boolean) is
1935 pragma Assert (Nkind (CU) = N_Compilation_Unit);
1936 pragma Assert (Nkind (Unit (CU)) /= N_Subunit);
1938 procedure Walk_Immediate is new Walk_Withs_Immediate (Action);
1941 -- First walk the withs immediately on the library item
1943 Walk_Immediate (CU, Include_Limited);
1945 -- For a body, we must also check for any subunits which belong to it
1946 -- and which have context clauses of their own, since these with'ed
1947 -- units are part of its own dependencies.
1949 if Nkind (Unit (CU)) in N_Unit_Body then
1950 for S in Main_Unit .. Last_Unit loop
1952 -- We are only interested in subunits. For preproc. data and def.
1953 -- files, Cunit is Empty, so we need to test that first.
1955 if Cunit (S) /= Empty
1956 and then Nkind (Unit (Cunit (S))) = N_Subunit
1962 Pnode := Library_Unit (Cunit (S));
1964 -- In -gnatc mode, the errors in the subunits will not have
1965 -- been recorded, but the analysis of the subunit may have
1966 -- failed, so just quit.
1972 -- Find ultimate parent of the subunit
1974 while Nkind (Unit (Pnode)) = N_Subunit loop
1975 Pnode := Library_Unit (Pnode);
1978 -- See if it belongs to current unit, and if so, include its
1979 -- with_clauses. Do not process main unit prematurely.
1982 and then CU /= Cunit (Main_Unit)
1984 Walk_Immediate (Cunit (S), Include_Limited);
1992 --------------------------
1993 -- Walk_Withs_Immediate --
1994 --------------------------
1996 procedure Walk_Withs_Immediate (CU : Node_Id; Include_Limited : Boolean) is
1997 pragma Assert (Nkind (CU) = N_Compilation_Unit);
1999 Context_Item : Node_Id;
2002 Context_Item := First (Context_Items (CU));
2003 while Present (Context_Item) loop
2004 if Nkind (Context_Item) = N_With_Clause
2005 and then (Include_Limited
2006 or else not Limited_Present (Context_Item))
2008 Action (Library_Unit (Context_Item));
2011 Context_Item := Next (Context_Item);
2013 end Walk_Withs_Immediate;
2015 ---------------------
2016 -- Write_Unit_Info --
2017 ---------------------
2019 procedure Write_Unit_Info
2020 (Unit_Num : Unit_Number_Type;
2022 Prefix : String := "";
2023 Withs : Boolean := False)
2027 Write_Unit_Name (Unit_Name (Unit_Num));
2028 Write_Str (", unit ");
2029 Write_Int (Int (Unit_Num));
2031 Write_Int (Int (Item));
2033 Write_Str (Node_Kind'Image (Nkind (Item)));
2035 if Item /= Original_Node (Item) then
2036 Write_Str (", orig = ");
2037 Write_Int (Int (Original_Node (Item)));
2039 Write_Str (Node_Kind'Image (Nkind (Original_Node (Item))));
2044 -- Skip the rest if we're not supposed to print the withs
2051 Context_Item : Node_Id;
2054 Context_Item := First (Context_Items (Cunit (Unit_Num)));
2055 while Present (Context_Item)
2056 and then (Nkind (Context_Item) /= N_With_Clause
2057 or else Limited_Present (Context_Item))
2059 Context_Item := Next (Context_Item);
2062 if Present (Context_Item) then
2064 Write_Line ("withs:");
2067 while Present (Context_Item) loop
2068 if Nkind (Context_Item) = N_With_Clause
2069 and then not Limited_Present (Context_Item)
2071 pragma Assert (Present (Library_Unit (Context_Item)));
2074 (Get_Cunit_Unit_Number (Library_Unit (Context_Item))));
2076 if Implicit_With (Context_Item) then
2077 Write_Str (" -- implicit");
2083 Context_Item := Next (Context_Item);
2087 Write_Line ("end withs");
2091 end Write_Unit_Info;