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 -- For the remaining node types, we generate compiler abort, because
607 -- these nodes are always analyzed within the Sem_Chn routines and
608 -- there should never be a case of making a call to the main Analyze
609 -- routine for these node kinds. For example, an N_Access_Definition
610 -- node appears only in the context of a type declaration, and is
611 -- processed by the analyze routine for type declarations.
615 N_Access_Definition |
616 N_Access_Function_Definition |
617 N_Access_Procedure_Definition |
618 N_Access_To_Object_Definition |
619 N_Case_Statement_Alternative |
620 N_Compilation_Unit_Aux |
621 N_Component_Association |
623 N_Component_Definition |
625 N_Constrained_Array_Definition |
626 N_Decimal_Fixed_Point_Definition |
627 N_Defining_Character_Literal |
628 N_Defining_Identifier |
629 N_Defining_Operator_Symbol |
630 N_Defining_Program_Unit_Name |
632 N_Derived_Type_Definition |
634 N_Digits_Constraint |
635 N_Discriminant_Association |
636 N_Discriminant_Specification |
638 N_Entry_Call_Statement |
639 N_Enumeration_Type_Definition |
640 N_Exception_Handler |
641 N_Floating_Point_Definition |
642 N_Formal_Decimal_Fixed_Point_Definition |
643 N_Formal_Derived_Type_Definition |
644 N_Formal_Discrete_Type_Definition |
645 N_Formal_Floating_Point_Definition |
646 N_Formal_Modular_Type_Definition |
647 N_Formal_Ordinary_Fixed_Point_Definition |
648 N_Formal_Private_Type_Definition |
649 N_Formal_Signed_Integer_Type_Definition |
650 N_Function_Specification |
651 N_Generic_Association |
652 N_Index_Or_Discriminant_Constraint |
654 N_Loop_Parameter_Specification |
656 N_Modular_Type_Definition |
657 N_Ordinary_Fixed_Point_Definition |
658 N_Parameter_Specification |
659 N_Pragma_Argument_Association |
660 N_Procedure_Specification |
661 N_Real_Range_Specification |
662 N_Record_Definition |
663 N_Signed_Integer_Type_Definition |
664 N_Unconstrained_Array_Definition |
672 Debug_A_Exit ("analyzing ", N, " (done)");
674 -- Now that we have analyzed the node, we call the expander to perform
675 -- possible expansion. We skip this for subexpressions, because we don't
676 -- have the type yet, and the expander will need to know the type before
677 -- it can do its job. For subexpression nodes, the call to the expander
678 -- happens in Sem_Res.Resolve. A special exception is Raise_xxx_Error,
679 -- which can appear in a statement context, and needs expanding now in
680 -- the case (distinguished by Etype, as documented in Sinfo).
682 -- The Analyzed flag is also set at this point for non-subexpression
683 -- nodes (in the case of subexpression nodes, we can't set the flag yet,
684 -- since resolution and expansion have not yet been completed). Note
685 -- that for N_Raise_xxx_Error we have to distinguish the expression
686 -- case from the statement case.
688 if Nkind (N) not in N_Subexpr
689 or else (Nkind (N) in N_Raise_xxx_Error
690 and then Etype (N) = Standard_Void_Type)
696 -- Version with check(s) suppressed
698 procedure Analyze (N : Node_Id; Suppress : Check_Id) is
700 if Suppress = All_Checks then
702 Svg : constant Suppress_Array := Scope_Suppress;
704 Scope_Suppress := (others => True);
706 Scope_Suppress := Svg;
711 Svg : constant Boolean := Scope_Suppress (Suppress);
713 Scope_Suppress (Suppress) := True;
715 Scope_Suppress (Suppress) := Svg;
724 procedure Analyze_List (L : List_Id) is
729 while Present (Node) loop
735 -- Version with check(s) suppressed
737 procedure Analyze_List (L : List_Id; Suppress : Check_Id) is
739 if Suppress = All_Checks then
741 Svg : constant Suppress_Array := Scope_Suppress;
743 Scope_Suppress := (others => True);
745 Scope_Suppress := Svg;
750 Svg : constant Boolean := Scope_Suppress (Suppress);
752 Scope_Suppress (Suppress) := True;
754 Scope_Suppress (Suppress) := Svg;
759 --------------------------
760 -- Copy_Suppress_Status --
761 --------------------------
763 procedure Copy_Suppress_Status
769 pragma Warnings (Off, Found);
771 procedure Search_Stack
772 (Top : Suppress_Stack_Entry_Ptr;
773 Found : out Boolean);
774 -- Search given suppress stack for matching entry for entity. If found
775 -- then set Checks_May_Be_Suppressed on To, and push an appropriate
776 -- entry for To onto the local suppress stack.
782 procedure Search_Stack
783 (Top : Suppress_Stack_Entry_Ptr;
786 Ptr : Suppress_Stack_Entry_Ptr;
790 while Ptr /= null loop
792 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
795 Set_Checks_May_Be_Suppressed (To, True);
796 Push_Local_Suppress_Stack_Entry
812 -- Start of processing for Copy_Suppress_Status
815 if not Checks_May_Be_Suppressed (From) then
819 -- First search the local entity suppress stack, we search this in
820 -- reverse order so that we get the innermost entry that applies to
821 -- this case if there are nested entries. Note that for the purpose
822 -- of this procedure we are ONLY looking for entries corresponding
823 -- to a two-argument Suppress, where the second argument matches From.
825 Search_Stack (Global_Suppress_Stack_Top, Found);
831 -- Now search the global entity suppress table for a matching entry
832 -- We also search this in reverse order so that if there are multiple
833 -- pragmas for the same entity, the last one applies.
835 Search_Stack (Local_Suppress_Stack_Top, Found);
836 end Copy_Suppress_Status;
838 -------------------------
839 -- Enter_Generic_Scope --
840 -------------------------
842 procedure Enter_Generic_Scope (S : Entity_Id) is
844 if No (Outer_Generic_Scope) then
845 Outer_Generic_Scope := S;
847 end Enter_Generic_Scope;
849 ------------------------
850 -- Exit_Generic_Scope --
851 ------------------------
853 procedure Exit_Generic_Scope (S : Entity_Id) is
855 if S = Outer_Generic_Scope then
856 Outer_Generic_Scope := Empty;
858 end Exit_Generic_Scope;
860 -----------------------
861 -- Explicit_Suppress --
862 -----------------------
864 function Explicit_Suppress (E : Entity_Id; C : Check_Id) return Boolean is
865 Ptr : Suppress_Stack_Entry_Ptr;
868 if not Checks_May_Be_Suppressed (E) then
872 Ptr := Global_Suppress_Stack_Top;
873 while Ptr /= null loop
875 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
885 end Explicit_Suppress;
887 -----------------------------
888 -- External_Ref_In_Generic --
889 -----------------------------
891 function External_Ref_In_Generic (E : Entity_Id) return Boolean is
895 -- Entity is global if defined outside of current outer_generic_scope:
896 -- Either the entity has a smaller depth that the outer generic, or it
897 -- is in a different compilation unit, or it is defined within a unit
898 -- in the same compilation, that is not within the outer_generic.
900 if No (Outer_Generic_Scope) then
903 elsif Scope_Depth (Scope (E)) < Scope_Depth (Outer_Generic_Scope)
904 or else not In_Same_Source_Unit (E, Outer_Generic_Scope)
911 while Present (Scop) loop
912 if Scop = Outer_Generic_Scope then
914 elsif Scope_Depth (Scop) < Scope_Depth (Outer_Generic_Scope) then
917 Scop := Scope (Scop);
923 end External_Ref_In_Generic;
929 procedure Initialize is
930 Next : Suppress_Stack_Entry_Ptr;
932 procedure Free is new Unchecked_Deallocation
933 (Suppress_Stack_Entry, Suppress_Stack_Entry_Ptr);
936 -- Free any global suppress stack entries from a previous invocation
937 -- of the compiler (in the normal case this loop does nothing).
939 while Suppress_Stack_Entries /= null loop
940 Next := Global_Suppress_Stack_Top.Next;
941 Free (Suppress_Stack_Entries);
942 Suppress_Stack_Entries := Next;
945 Local_Suppress_Stack_Top := null;
946 Global_Suppress_Stack_Top := null;
948 -- Clear scope stack, and reset global variables
951 Unloaded_Subunits := False;
954 ------------------------------
955 -- Insert_After_And_Analyze --
956 ------------------------------
958 procedure Insert_After_And_Analyze (N : Node_Id; M : Node_Id) is
964 -- If we are not at the end of the list, then the easiest
965 -- coding is simply to insert before our successor
967 if Present (Next (N)) then
968 Insert_Before_And_Analyze (Next (N), M);
970 -- Case of inserting at the end of the list
973 -- Capture the Node_Id of the node to be inserted. This Node_Id
974 -- will still be the same after the insert operation.
979 -- Now just analyze from the inserted node to the end of
980 -- the new list (note that this properly handles the case
981 -- where any of the analyze calls result in the insertion of
982 -- nodes after the analyzed node, expecting analysis).
984 while Present (Node) loop
986 Mark_Rewrite_Insertion (Node);
991 end Insert_After_And_Analyze;
993 -- Version with check(s) suppressed
995 procedure Insert_After_And_Analyze
1001 if Suppress = All_Checks then
1003 Svg : constant Suppress_Array := Scope_Suppress;
1005 Scope_Suppress := (others => True);
1006 Insert_After_And_Analyze (N, M);
1007 Scope_Suppress := Svg;
1012 Svg : constant Boolean := Scope_Suppress (Suppress);
1014 Scope_Suppress (Suppress) := True;
1015 Insert_After_And_Analyze (N, M);
1016 Scope_Suppress (Suppress) := Svg;
1019 end Insert_After_And_Analyze;
1021 -------------------------------
1022 -- Insert_Before_And_Analyze --
1023 -------------------------------
1025 procedure Insert_Before_And_Analyze (N : Node_Id; M : Node_Id) is
1031 -- Capture the Node_Id of the first list node to be inserted.
1032 -- This will still be the first node after the insert operation,
1033 -- since Insert_List_After does not modify the Node_Id values.
1036 Insert_Before (N, M);
1038 -- The insertion does not change the Id's of any of the nodes in
1039 -- the list, and they are still linked, so we can simply loop from
1040 -- the original first node until we meet the node before which the
1041 -- insertion is occurring. Note that this properly handles the case
1042 -- where any of the analyzed nodes insert nodes after themselves,
1043 -- expecting them to get analyzed.
1045 while Node /= N loop
1047 Mark_Rewrite_Insertion (Node);
1051 end Insert_Before_And_Analyze;
1053 -- Version with check(s) suppressed
1055 procedure Insert_Before_And_Analyze
1058 Suppress : Check_Id)
1061 if Suppress = All_Checks then
1063 Svg : constant Suppress_Array := Scope_Suppress;
1065 Scope_Suppress := (others => True);
1066 Insert_Before_And_Analyze (N, M);
1067 Scope_Suppress := Svg;
1072 Svg : constant Boolean := Scope_Suppress (Suppress);
1074 Scope_Suppress (Suppress) := True;
1075 Insert_Before_And_Analyze (N, M);
1076 Scope_Suppress (Suppress) := Svg;
1079 end Insert_Before_And_Analyze;
1081 -----------------------------------
1082 -- Insert_List_After_And_Analyze --
1083 -----------------------------------
1085 procedure Insert_List_After_And_Analyze (N : Node_Id; L : List_Id) is
1086 After : constant Node_Id := Next (N);
1090 if Is_Non_Empty_List (L) then
1092 -- Capture the Node_Id of the first list node to be inserted.
1093 -- This will still be the first node after the insert operation,
1094 -- since Insert_List_After does not modify the Node_Id values.
1097 Insert_List_After (N, L);
1099 -- Now just analyze from the original first node until we get to
1100 -- the successor of the original insertion point (which may be
1101 -- Empty if the insertion point was at the end of the list). Note
1102 -- that this properly handles the case where any of the analyze
1103 -- calls result in the insertion of nodes after the analyzed
1104 -- node (possibly calling this routine recursively).
1106 while Node /= After loop
1108 Mark_Rewrite_Insertion (Node);
1112 end Insert_List_After_And_Analyze;
1114 -- Version with check(s) suppressed
1116 procedure Insert_List_After_And_Analyze
1117 (N : Node_Id; L : List_Id; Suppress : Check_Id)
1120 if Suppress = All_Checks then
1122 Svg : constant Suppress_Array := Scope_Suppress;
1124 Scope_Suppress := (others => True);
1125 Insert_List_After_And_Analyze (N, L);
1126 Scope_Suppress := Svg;
1131 Svg : constant Boolean := Scope_Suppress (Suppress);
1133 Scope_Suppress (Suppress) := True;
1134 Insert_List_After_And_Analyze (N, L);
1135 Scope_Suppress (Suppress) := Svg;
1138 end Insert_List_After_And_Analyze;
1140 ------------------------------------
1141 -- Insert_List_Before_And_Analyze --
1142 ------------------------------------
1144 procedure Insert_List_Before_And_Analyze (N : Node_Id; L : List_Id) is
1148 if Is_Non_Empty_List (L) then
1150 -- Capture the Node_Id of the first list node to be inserted.
1151 -- This will still be the first node after the insert operation,
1152 -- since Insert_List_After does not modify the Node_Id values.
1155 Insert_List_Before (N, L);
1157 -- The insertion does not change the Id's of any of the nodes in
1158 -- the list, and they are still linked, so we can simply loop from
1159 -- the original first node until we meet the node before which the
1160 -- insertion is occurring. Note that this properly handles the case
1161 -- where any of the analyzed nodes insert nodes after themselves,
1162 -- expecting them to get analyzed.
1164 while Node /= N loop
1166 Mark_Rewrite_Insertion (Node);
1170 end Insert_List_Before_And_Analyze;
1172 -- Version with check(s) suppressed
1174 procedure Insert_List_Before_And_Analyze
1175 (N : Node_Id; L : List_Id; Suppress : Check_Id)
1178 if Suppress = All_Checks then
1180 Svg : constant Suppress_Array := Scope_Suppress;
1182 Scope_Suppress := (others => True);
1183 Insert_List_Before_And_Analyze (N, L);
1184 Scope_Suppress := Svg;
1189 Svg : constant Boolean := Scope_Suppress (Suppress);
1191 Scope_Suppress (Suppress) := True;
1192 Insert_List_Before_And_Analyze (N, L);
1193 Scope_Suppress (Suppress) := Svg;
1196 end Insert_List_Before_And_Analyze;
1198 -------------------------
1199 -- Is_Check_Suppressed --
1200 -------------------------
1202 function Is_Check_Suppressed (E : Entity_Id; C : Check_Id) return Boolean is
1204 Ptr : Suppress_Stack_Entry_Ptr;
1207 -- First search the local entity suppress stack, we search this from the
1208 -- top of the stack down, so that we get the innermost entry that
1209 -- applies to this case if there are nested entries.
1211 Ptr := Local_Suppress_Stack_Top;
1212 while Ptr /= null loop
1213 if (Ptr.Entity = Empty or else Ptr.Entity = E)
1214 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
1216 return Ptr.Suppress;
1222 -- Now search the global entity suppress table for a matching entry
1223 -- We also search this from the top down so that if there are multiple
1224 -- pragmas for the same entity, the last one applies (not clear what
1225 -- or whether the RM specifies this handling, but it seems reasonable).
1227 Ptr := Global_Suppress_Stack_Top;
1228 while Ptr /= null loop
1229 if (Ptr.Entity = Empty or else Ptr.Entity = E)
1230 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
1232 return Ptr.Suppress;
1238 -- If we did not find a matching entry, then use the normal scope
1239 -- suppress value after all (actually this will be the global setting
1240 -- since it clearly was not overridden at any point). For a predefined
1241 -- check, we test the specific flag. For a user defined check, we check
1242 -- the All_Checks flag.
1244 if C in Predefined_Check_Id then
1245 return Scope_Suppress (C);
1247 return Scope_Suppress (All_Checks);
1249 end Is_Check_Suppressed;
1257 Scope_Stack.Locked := True;
1258 Scope_Stack.Release;
1261 --------------------------------------
1262 -- Push_Global_Suppress_Stack_Entry --
1263 --------------------------------------
1265 procedure Push_Global_Suppress_Stack_Entry
1266 (Entity : Entity_Id;
1271 Global_Suppress_Stack_Top :=
1272 new Suppress_Stack_Entry'
1275 Suppress => Suppress,
1276 Prev => Global_Suppress_Stack_Top,
1277 Next => Suppress_Stack_Entries);
1278 Suppress_Stack_Entries := Global_Suppress_Stack_Top;
1281 end Push_Global_Suppress_Stack_Entry;
1283 -------------------------------------
1284 -- Push_Local_Suppress_Stack_Entry --
1285 -------------------------------------
1287 procedure Push_Local_Suppress_Stack_Entry
1288 (Entity : Entity_Id;
1293 Local_Suppress_Stack_Top :=
1294 new Suppress_Stack_Entry'
1297 Suppress => Suppress,
1298 Prev => Local_Suppress_Stack_Top,
1299 Next => Suppress_Stack_Entries);
1300 Suppress_Stack_Entries := Local_Suppress_Stack_Top;
1303 end Push_Local_Suppress_Stack_Entry;
1309 procedure Semantics (Comp_Unit : Node_Id) is
1311 -- The following locations save the corresponding global flags and
1312 -- variables so that they can be restored on completion. This is
1313 -- needed so that calls to Rtsfind start with the proper default
1314 -- values for these variables, and also that such calls do not
1315 -- disturb the settings for units being analyzed at a higher level.
1317 S_Current_Sem_Unit : constant Unit_Number_Type := Current_Sem_Unit;
1318 S_Full_Analysis : constant Boolean := Full_Analysis;
1319 S_GNAT_Mode : constant Boolean := GNAT_Mode;
1320 S_Global_Dis_Names : constant Boolean := Global_Discard_Names;
1321 S_In_Spec_Expr : constant Boolean := In_Spec_Expression;
1322 S_Inside_A_Generic : constant Boolean := Inside_A_Generic;
1323 S_New_Nodes_OK : constant Int := New_Nodes_OK;
1324 S_Outer_Gen_Scope : constant Entity_Id := Outer_Generic_Scope;
1326 Generic_Main : constant Boolean :=
1327 Nkind (Unit (Cunit (Main_Unit)))
1328 in N_Generic_Declaration;
1329 -- If the main unit is generic, every compiled unit, including its
1330 -- context, is compiled with expansion disabled.
1332 Save_Config_Switches : Config_Switches_Type;
1333 -- Variable used to save values of config switches while we analyze
1334 -- the new unit, to be restored on exit for proper recursive behavior.
1336 procedure Do_Analyze;
1337 -- Procedure to analyze the compilation unit. This is called more
1338 -- than once when the high level optimizer is activated.
1344 procedure Do_Analyze is
1347 Push_Scope (Standard_Standard);
1348 Scope_Suppress := Suppress_Options;
1350 (Scope_Stack.Last).Component_Alignment_Default := Calign_Default;
1352 (Scope_Stack.Last).Is_Active_Stack_Base := True;
1353 Outer_Generic_Scope := Empty;
1355 -- Now analyze the top level compilation unit node
1357 Analyze (Comp_Unit);
1359 -- Check for scope mismatch on exit from compilation
1361 pragma Assert (Current_Scope = Standard_Standard
1362 or else Comp_Unit = Cunit (Main_Unit));
1364 -- Then pop entry for Standard, and pop implicit types
1367 Restore_Scope_Stack;
1370 Already_Analyzed : constant Boolean := Analyzed (Comp_Unit);
1372 -- Start of processing for Semantics
1375 if Debug_Unit_Walk then
1376 if Already_Analyzed then
1377 Write_Str ("(done)");
1381 (Get_Cunit_Unit_Number (Comp_Unit),
1387 Compiler_State := Analyzing;
1388 Current_Sem_Unit := Get_Cunit_Unit_Number (Comp_Unit);
1390 -- Compile predefined units with GNAT_Mode set to True, to properly
1391 -- process the categorization stuff. However, do not set GNAT_Mode
1392 -- to True for the renamings units (Text_IO, IO_Exceptions, Direct_IO,
1393 -- Sequential_IO) as this would prevent pragma Extend_System from being
1394 -- taken into account, for example when Text_IO is renaming DEC.Text_IO.
1396 -- Cleaner might be to do the kludge at the point of excluding the
1397 -- pragma (do not exclude for renamings ???)
1399 if Is_Predefined_File_Name
1400 (Unit_File_Name (Current_Sem_Unit), Renamings_Included => False)
1405 if Generic_Main then
1406 Expander_Mode_Save_And_Set (False);
1408 Expander_Mode_Save_And_Set
1409 (Operating_Mode = Generate_Code or Debug_Flag_X);
1412 Full_Analysis := True;
1413 Inside_A_Generic := False;
1414 In_Spec_Expression := False;
1416 Set_Comes_From_Source_Default (False);
1417 Save_Opt_Config_Switches (Save_Config_Switches);
1418 Set_Opt_Config_Switches
1419 (Is_Internal_File_Name (Unit_File_Name (Current_Sem_Unit)),
1420 Current_Sem_Unit = Main_Unit);
1422 -- Only do analysis of unit that has not already been analyzed
1424 if not Analyzed (Comp_Unit) then
1425 Initialize_Version (Current_Sem_Unit);
1427 Expander_Mode_Save_And_Set (False);
1430 Reset_Analyzed_Flags (Comp_Unit);
1431 Expander_Mode_Restore;
1432 High_Level_Optimize (Comp_Unit);
1436 -- Do analysis, and then append the compilation unit onto the
1437 -- Comp_Unit_List, if appropriate. This is done after analysis, so
1438 -- if this unit depends on some others, they have already been
1439 -- appended. We ignore bodies, except for the main unit itself. We
1440 -- have also to guard against ill-formed subunits that have an
1441 -- improper context.
1445 if Present (Comp_Unit)
1446 and then Nkind (Unit (Comp_Unit)) in N_Proper_Body
1447 and then not In_Extended_Main_Source_Unit (Comp_Unit)
1452 -- Initialize if first time
1454 if No (Comp_Unit_List) then
1455 Comp_Unit_List := New_Elmt_List;
1458 Append_Elmt (Comp_Unit, Comp_Unit_List);
1460 if Debug_Unit_Walk then
1461 Write_Str ("Appending ");
1463 (Get_Cunit_Unit_Number (Comp_Unit), Unit (Comp_Unit));
1468 -- Save indication of dynamic elaboration checks for ALI file
1470 Set_Dynamic_Elab (Current_Sem_Unit, Dynamic_Elaboration_Checks);
1472 -- Restore settings of saved switches to entry values
1474 Current_Sem_Unit := S_Current_Sem_Unit;
1475 Full_Analysis := S_Full_Analysis;
1476 Global_Discard_Names := S_Global_Dis_Names;
1477 GNAT_Mode := S_GNAT_Mode;
1478 In_Spec_Expression := S_In_Spec_Expr;
1479 Inside_A_Generic := S_Inside_A_Generic;
1480 New_Nodes_OK := S_New_Nodes_OK;
1481 Outer_Generic_Scope := S_Outer_Gen_Scope;
1483 Restore_Opt_Config_Switches (Save_Config_Switches);
1484 Expander_Mode_Restore;
1486 if Debug_Unit_Walk then
1489 if Already_Analyzed then
1490 Write_Str ("(done)");
1494 (Get_Cunit_Unit_Number (Comp_Unit),
1500 ------------------------
1501 -- Walk_Library_Items --
1502 ------------------------
1504 procedure Walk_Library_Items is
1505 type Unit_Number_Set is array (Main_Unit .. Last_Unit) of Boolean;
1506 pragma Pack (Unit_Number_Set);
1507 Seen, Done : Unit_Number_Set := (others => False);
1508 -- Seen (X) is True after we have seen unit X in the walk. This is used
1509 -- to prevent processing the same unit more than once. Done (X) is True
1510 -- after we have fully processed X, and is used only for debugging
1511 -- printouts and assertions.
1513 procedure Do_Action (CU : Node_Id; Item : Node_Id);
1514 -- Calls Action, with some validity checks
1516 procedure Do_Unit_And_Dependents (CU : Node_Id; Item : Node_Id);
1517 -- Calls Do_Action, first on the units with'ed by this one, then on this
1518 -- unit. If it's an instance body, do the spec first. If it's an
1519 -- instance spec, do the body last.
1525 procedure Do_Action (CU : Node_Id; Item : Node_Id) is
1527 -- This calls Action at the end. All the preceding code is just
1528 -- assertions and debugging output.
1530 pragma Assert (No (CU) or else Nkind (CU) = N_Compilation_Unit);
1532 case Nkind (Item) is
1533 when N_Generic_Subprogram_Declaration |
1534 N_Generic_Package_Declaration |
1535 N_Package_Declaration |
1536 N_Subprogram_Declaration |
1537 N_Subprogram_Renaming_Declaration |
1538 N_Package_Renaming_Declaration |
1539 N_Generic_Function_Renaming_Declaration |
1540 N_Generic_Package_Renaming_Declaration |
1541 N_Generic_Procedure_Renaming_Declaration =>
1542 null; -- Specs are OK
1544 when N_Package_Body | N_Subprogram_Body =>
1546 -- A body must be the main unit
1548 pragma Assert (Acts_As_Spec (CU)
1549 or else CU = Cunit (Main_Unit));
1552 -- All other cases cannot happen
1554 when N_Function_Instantiation |
1555 N_Procedure_Instantiation |
1556 N_Package_Instantiation =>
1557 pragma Assert (False, "instantiation");
1561 pragma Assert (False, "subunit");
1565 pragma Assert (False);
1569 if Present (CU) then
1570 pragma Assert (Item /= Stand.Standard_Package_Node);
1571 pragma Assert (Item = Unit (CU));
1574 Unit_Num : constant Unit_Number_Type :=
1575 Get_Cunit_Unit_Number (CU);
1577 procedure Assert_Done (Withed_Unit : Node_Id);
1578 -- Assert Withed_Unit is already Done, unless it's a body. It
1579 -- might seem strange for a with_clause to refer to a body, but
1580 -- this happens in the case of a generic instantiation, which
1581 -- gets transformed into the instance body (and the instance
1582 -- spec is also created). With clauses pointing to the
1583 -- instantiation end up pointing to the instance body.
1589 procedure Assert_Done (Withed_Unit : Node_Id) is
1591 if not Done (Get_Cunit_Unit_Number (Withed_Unit)) then
1593 (Unit (Withed_Unit), N_Package_Body,
1598 (Get_Cunit_Unit_Number
1600 Write_Str (" not yet walked!");
1602 if Get_Cunit_Unit_Number (Withed_Unit) = Unit_Num then
1603 Write_Str (" (self-ref)");
1608 pragma Assert (False);
1613 procedure Assert_Withed_Units_Done is
1614 new Walk_Withs (Assert_Done);
1617 if Debug_Unit_Walk then
1618 Write_Unit_Info (Unit_Num, Item, Withs => True);
1621 -- Main unit should come last (except in the case where we
1622 -- skipped System_Aux_Id, in which case we missed the things it
1626 (not Done (Main_Unit) or else Present (System_Aux_Id));
1628 -- We shouldn't do the same thing twice
1630 pragma Assert (not Done (Unit_Num));
1632 -- Everything we depend upon should already be done
1635 (Assert_Withed_Units_Done (CU, Include_Limited => False));
1639 -- Must be Standard, which has no entry in the units table
1641 pragma Assert (Item = Stand.Standard_Package_Node);
1643 if Debug_Unit_Walk then
1644 Write_Line ("Standard");
1651 ----------------------------
1652 -- Do_Unit_And_Dependents --
1653 ----------------------------
1655 procedure Do_Unit_And_Dependents (CU : Node_Id; Item : Node_Id) is
1656 Unit_Num : constant Unit_Number_Type :=
1657 Get_Cunit_Unit_Number (CU);
1659 procedure Do_Withed_Unit (Withed_Unit : Node_Id);
1660 -- Pass the buck to Do_Unit_And_Dependents
1662 --------------------
1663 -- Do_Withed_Unit --
1664 --------------------
1666 procedure Do_Withed_Unit (Withed_Unit : Node_Id) is
1668 Do_Unit_And_Dependents (Withed_Unit, Unit (Withed_Unit));
1671 procedure Do_Withed_Units is new Walk_Withs (Do_Withed_Unit);
1673 -- Start of processing for Do_Unit_And_Dependents
1676 if Seen (Unit_Num) then
1680 Seen (Unit_Num) := True;
1682 -- Process corresponding spec of body first
1684 if Nkind_In (Item, N_Package_Body, N_Subprogram_Body) then
1686 Spec_Unit : constant Node_Id := Library_Unit (CU);
1688 if Spec_Unit = CU then -- ???Why needed?
1689 pragma Assert (Acts_As_Spec (CU));
1692 Do_Unit_And_Dependents (Spec_Unit, Unit (Spec_Unit));
1697 -- Process the with clauses
1699 Do_Withed_Units (CU, Include_Limited => False);
1701 -- Process the unit itself
1703 if not Nkind_In (Item, N_Package_Body, N_Subprogram_Body)
1704 or else Acts_As_Spec (CU)
1705 or else CU = Cunit (Main_Unit)
1708 Do_Action (CU, Item);
1710 Done (Unit_Num) := True;
1713 -- Process corresponding body of spec last. However, if this body is
1714 -- the main unit (because some dependent of the main unit depends on
1715 -- the main unit's spec), we don't process it now. We also skip
1716 -- processing of the body of a unit named by pragma Extend_System,
1717 -- because it has cyclic dependences in some cases.
1719 if not Nkind_In (Item, N_Package_Body, N_Subprogram_Body) then
1721 Body_Unit : constant Node_Id := Library_Unit (CU);
1723 if Present (Body_Unit)
1724 and then Body_Unit /= Cunit (Main_Unit)
1725 and then Unit_Num /= Get_Source_Unit (System_Aux_Id)
1727 Do_Unit_And_Dependents (Body_Unit, Unit (Body_Unit));
1731 end Do_Unit_And_Dependents;
1733 -- Local Declarations
1737 -- Start of processing for Walk_Library_Items
1740 if Debug_Unit_Walk then
1741 Write_Line ("Walk_Library_Items:");
1745 -- Do Standard first, then walk the Comp_Unit_List
1747 Do_Action (Empty, Standard_Package_Node);
1749 Cur := First_Elmt (Comp_Unit_List);
1750 while Present (Cur) loop
1752 CU : constant Node_Id := Node (Cur);
1753 N : constant Node_Id := Unit (CU);
1756 pragma Assert (Nkind (CU) = N_Compilation_Unit);
1760 -- If it's a body, then ignore it, unless it's an instance (in
1761 -- which case we do the spec), or it's the main unit (in which
1762 -- case we do it). Note that it could be both, in which case we
1763 -- do the with_clauses of spec and body first,
1765 when N_Package_Body | N_Subprogram_Body =>
1767 Entity : Node_Id := N;
1770 if Nkind (Entity) = N_Subprogram_Body then
1771 Entity := Specification (Entity);
1774 Entity := Defining_Unit_Name (Entity);
1776 if Nkind (Entity) not in N_Entity then
1778 -- Must be N_Defining_Program_Unit_Name
1780 Entity := Defining_Identifier (Entity);
1783 if Is_Generic_Instance (Entity) then
1785 Spec_Unit : constant Node_Id := Library_Unit (CU);
1788 -- Move context of body to that of spec, so it
1789 -- appears before the spec itself, in case it
1790 -- contains nested instances that generate late
1791 -- with_clauses that got attached to the body.
1794 (Context_Items (CU), Context_Items (Spec_Unit));
1795 Do_Unit_And_Dependents
1796 (Spec_Unit, Unit (Spec_Unit));
1801 if CU = Cunit (Main_Unit) then
1802 Do_Unit_And_Dependents (CU, N);
1805 -- It's a spec, so just do it
1808 Do_Unit_And_Dependents (CU, N);
1815 if Debug_Unit_Walk then
1816 if Done /= (Done'Range => True) then
1818 Write_Line ("Ignored units:");
1822 for Unit_Num in Done'Range loop
1823 if not Done (Unit_Num) then
1825 (Unit_Num, Unit (Cunit (Unit_Num)), Withs => True);
1833 pragma Assert (Done (Main_Unit));
1835 if Debug_Unit_Walk then
1837 Write_Line ("end Walk_Library_Items.");
1839 end Walk_Library_Items;
1845 procedure Walk_Withs (CU : Node_Id; Include_Limited : Boolean) is
1846 pragma Assert (Nkind (CU) = N_Compilation_Unit);
1847 pragma Assert (Nkind (Unit (CU)) /= N_Subunit);
1849 procedure Walk_Immediate is new Walk_Withs_Immediate (Action);
1852 -- First walk the withs immediately on the library item
1854 Walk_Immediate (CU, Include_Limited);
1856 -- For a body, we must also check for any subunits which belong to it
1857 -- and which have context clauses of their own, since these with'ed
1858 -- units are part of its own dependencies.
1860 if Nkind (Unit (CU)) in N_Unit_Body then
1861 for S in Main_Unit .. Last_Unit loop
1863 -- We are only interested in subunits. For preproc. data and def.
1864 -- files, Cunit is Empty, so we need to test that first.
1866 if Cunit (S) /= Empty
1867 and then Nkind (Unit (Cunit (S))) = N_Subunit
1873 Pnode := Library_Unit (Cunit (S));
1875 -- In -gnatc mode, the errors in the subunits will not have
1876 -- been recorded, but the analysis of the subunit may have
1877 -- failed, so just quit.
1883 -- Find ultimate parent of the subunit
1885 while Nkind (Unit (Pnode)) = N_Subunit loop
1886 Pnode := Library_Unit (Pnode);
1889 -- See if it belongs to current unit, and if so, include its
1893 Walk_Immediate (Cunit (S), Include_Limited);
1901 --------------------------
1902 -- Walk_Withs_Immediate --
1903 --------------------------
1905 procedure Walk_Withs_Immediate (CU : Node_Id; Include_Limited : Boolean) is
1906 pragma Assert (Nkind (CU) = N_Compilation_Unit);
1908 Context_Item : Node_Id;
1911 Context_Item := First (Context_Items (CU));
1912 while Present (Context_Item) loop
1913 if Nkind (Context_Item) = N_With_Clause
1914 and then (Include_Limited
1915 or else not Limited_Present (Context_Item))
1917 Action (Library_Unit (Context_Item));
1920 Context_Item := Next (Context_Item);
1922 end Walk_Withs_Immediate;
1924 ---------------------
1925 -- Write_Unit_Info --
1926 ---------------------
1928 procedure Write_Unit_Info
1929 (Unit_Num : Unit_Number_Type;
1931 Prefix : String := "";
1932 Withs : Boolean := False)
1936 Write_Unit_Name (Unit_Name (Unit_Num));
1937 Write_Str (", unit ");
1938 Write_Int (Int (Unit_Num));
1940 Write_Int (Int (Item));
1942 Write_Str (Node_Kind'Image (Nkind (Item)));
1944 if Item /= Original_Node (Item) then
1945 Write_Str (", orig = ");
1946 Write_Int (Int (Original_Node (Item)));
1948 Write_Str (Node_Kind'Image (Nkind (Original_Node (Item))));
1953 -- Skip the rest if we're not supposed to print the withs
1960 Context_Item : Node_Id;
1963 Context_Item := First (Context_Items (Cunit (Unit_Num)));
1964 while Present (Context_Item)
1965 and then (Nkind (Context_Item) /= N_With_Clause
1966 or else Limited_Present (Context_Item))
1968 Context_Item := Next (Context_Item);
1971 if Present (Context_Item) then
1973 Write_Line ("withs:");
1976 while Present (Context_Item) loop
1977 if Nkind (Context_Item) = N_With_Clause
1978 and then not Limited_Present (Context_Item)
1980 pragma Assert (Present (Library_Unit (Context_Item)));
1983 (Get_Cunit_Unit_Number (Library_Unit (Context_Item))));
1985 if Implicit_With (Context_Item) then
1986 Write_Str (" -- implicit");
1992 Context_Item := Next (Context_Item);
1996 Write_Line ("end withs");
2000 end Write_Unit_Info;