[gcc/testsuite]
[official-gcc.git] / gcc / ada / sem.adb
blob35d0d482bbe886abe8aa7c5c7121840a90eb53e2
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT COMPILER COMPONENTS --
4 -- --
5 -- S E M --
6 -- --
7 -- B o d y --
8 -- --
9 -- Copyright (C) 1992-2017, Free Software Foundation, Inc. --
10 -- --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
20 -- --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
23 -- --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Debug; use Debug;
28 with Debug_A; use Debug_A;
29 with Elists; use Elists;
30 with Exp_SPARK; use Exp_SPARK;
31 with Expander; use Expander;
32 with Ghost; use Ghost;
33 with Lib; use Lib;
34 with Lib.Load; use Lib.Load;
35 with Nlists; use Nlists;
36 with Output; use Output;
37 with Restrict; use Restrict;
38 with Sem_Attr; use Sem_Attr;
39 with Sem_Aux; use Sem_Aux;
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 Stylesw; use Stylesw;
57 with Uintp; use Uintp;
58 with Uname; use Uname;
60 with Unchecked_Deallocation;
62 pragma Warnings (Off, Sem_Util);
63 -- Suppress warnings of unused with for Sem_Util (used only in asserts)
65 package body Sem is
67 Debug_Unit_Walk : Boolean renames Debug_Flag_Dot_WW;
68 -- Controls debugging printouts for Walk_Library_Items
70 Outer_Generic_Scope : Entity_Id := Empty;
71 -- Global reference to the outer scope that is generic. In a non-generic
72 -- context, it is empty. At the moment, it is only used for avoiding
73 -- freezing of external references in generics.
75 Comp_Unit_List : Elist_Id := No_Elist;
76 -- Used by Walk_Library_Items. This is a list of N_Compilation_Unit nodes
77 -- processed by Semantics, in an appropriate order. Initialized to
78 -- No_Elist, because it's too early to call New_Elmt_List; we will set it
79 -- to New_Elmt_List on first use.
81 generic
82 with procedure Action (Withed_Unit : Node_Id);
83 procedure Walk_Withs_Immediate (CU : Node_Id; Include_Limited : Boolean);
84 -- Walk all the with clauses of CU, and call Action for the with'ed unit.
85 -- Ignore limited withs, unless Include_Limited is True. CU must be an
86 -- N_Compilation_Unit.
88 generic
89 with procedure Action (Withed_Unit : Node_Id);
90 procedure Walk_Withs (CU : Node_Id; Include_Limited : Boolean);
91 -- Same as Walk_Withs_Immediate, but also include with clauses on subunits
92 -- of this unit, since they count as dependences on their parent library
93 -- item. CU must be an N_Compilation_Unit whose Unit is not an N_Subunit.
95 -------------
96 -- Analyze --
97 -------------
99 -- WARNING: This routine manages Ghost regions. Return statements must be
100 -- replaced by gotos which jump to the end of the routine and restore the
101 -- Ghost mode.
103 procedure Analyze (N : Node_Id) is
104 Saved_GM : constant Ghost_Mode_Type := Ghost_Mode;
105 -- Save the Ghost mode to restore on exit
107 begin
108 Debug_A_Entry ("analyzing ", N);
110 -- Immediate return if already analyzed
112 if Analyzed (N) then
113 Debug_A_Exit ("analyzing ", N, " (done, analyzed already)");
114 return;
115 end if;
117 -- A declaration may be subject to pragma Ghost. Set the mode now to
118 -- ensure that any nodes generated during analysis and expansion are
119 -- marked as Ghost.
121 if Is_Declaration (N) then
122 Mark_And_Set_Ghost_Declaration (N);
123 end if;
125 -- Otherwise processing depends on the node kind
127 case Nkind (N) is
128 when N_Abort_Statement =>
129 Analyze_Abort_Statement (N);
131 when N_Abstract_Subprogram_Declaration =>
132 Analyze_Abstract_Subprogram_Declaration (N);
134 when N_Accept_Alternative =>
135 Analyze_Accept_Alternative (N);
137 when N_Accept_Statement =>
138 Analyze_Accept_Statement (N);
140 when N_Aggregate =>
141 Analyze_Aggregate (N);
143 when N_Allocator =>
144 Analyze_Allocator (N);
146 when N_And_Then =>
147 Analyze_Short_Circuit (N);
149 when N_Assignment_Statement =>
150 Analyze_Assignment (N);
152 when N_Asynchronous_Select =>
153 Analyze_Asynchronous_Select (N);
155 when N_At_Clause =>
156 Analyze_At_Clause (N);
158 when N_Attribute_Reference =>
159 Analyze_Attribute (N);
161 when N_Attribute_Definition_Clause =>
162 Analyze_Attribute_Definition_Clause (N);
164 when N_Block_Statement =>
165 Analyze_Block_Statement (N);
167 when N_Case_Expression =>
168 Analyze_Case_Expression (N);
170 when N_Case_Statement =>
171 Analyze_Case_Statement (N);
173 when N_Character_Literal =>
174 Analyze_Character_Literal (N);
176 when N_Code_Statement =>
177 Analyze_Code_Statement (N);
179 when N_Compilation_Unit =>
180 Analyze_Compilation_Unit (N);
182 when N_Component_Declaration =>
183 Analyze_Component_Declaration (N);
185 when N_Compound_Statement =>
186 Analyze_Compound_Statement (N);
188 when N_Conditional_Entry_Call =>
189 Analyze_Conditional_Entry_Call (N);
191 when N_Delay_Alternative =>
192 Analyze_Delay_Alternative (N);
194 when N_Delay_Relative_Statement =>
195 Analyze_Delay_Relative (N);
197 when N_Delay_Until_Statement =>
198 Analyze_Delay_Until (N);
200 when N_Delta_Aggregate =>
201 Analyze_Aggregate (N);
203 when N_Entry_Body =>
204 Analyze_Entry_Body (N);
206 when N_Entry_Body_Formal_Part =>
207 Analyze_Entry_Body_Formal_Part (N);
209 when N_Entry_Call_Alternative =>
210 Analyze_Entry_Call_Alternative (N);
212 when N_Entry_Declaration =>
213 Analyze_Entry_Declaration (N);
215 when N_Entry_Index_Specification =>
216 Analyze_Entry_Index_Specification (N);
218 when N_Enumeration_Representation_Clause =>
219 Analyze_Enumeration_Representation_Clause (N);
221 when N_Exception_Declaration =>
222 Analyze_Exception_Declaration (N);
224 when N_Exception_Renaming_Declaration =>
225 Analyze_Exception_Renaming (N);
227 when N_Exit_Statement =>
228 Analyze_Exit_Statement (N);
230 when N_Expanded_Name =>
231 Analyze_Expanded_Name (N);
233 when N_Explicit_Dereference =>
234 Analyze_Explicit_Dereference (N);
236 when N_Expression_Function =>
237 Analyze_Expression_Function (N);
239 when N_Expression_With_Actions =>
240 Analyze_Expression_With_Actions (N);
242 when N_Extended_Return_Statement =>
243 Analyze_Extended_Return_Statement (N);
245 when N_Extension_Aggregate =>
246 Analyze_Aggregate (N);
248 when N_Formal_Object_Declaration =>
249 Analyze_Formal_Object_Declaration (N);
251 when N_Formal_Package_Declaration =>
252 Analyze_Formal_Package_Declaration (N);
254 when N_Formal_Subprogram_Declaration =>
255 Analyze_Formal_Subprogram_Declaration (N);
257 when N_Formal_Type_Declaration =>
258 Analyze_Formal_Type_Declaration (N);
260 when N_Free_Statement =>
261 Analyze_Free_Statement (N);
263 when N_Freeze_Entity =>
264 Analyze_Freeze_Entity (N);
266 when N_Freeze_Generic_Entity =>
267 Analyze_Freeze_Generic_Entity (N);
269 when N_Full_Type_Declaration =>
270 Analyze_Full_Type_Declaration (N);
272 when N_Function_Call =>
273 Analyze_Function_Call (N);
275 when N_Function_Instantiation =>
276 Analyze_Function_Instantiation (N);
278 when N_Generic_Function_Renaming_Declaration =>
279 Analyze_Generic_Function_Renaming (N);
281 when N_Generic_Package_Declaration =>
282 Analyze_Generic_Package_Declaration (N);
284 when N_Generic_Package_Renaming_Declaration =>
285 Analyze_Generic_Package_Renaming (N);
287 when N_Generic_Procedure_Renaming_Declaration =>
288 Analyze_Generic_Procedure_Renaming (N);
290 when N_Generic_Subprogram_Declaration =>
291 Analyze_Generic_Subprogram_Declaration (N);
293 when N_Goto_Statement =>
294 Analyze_Goto_Statement (N);
296 when N_Handled_Sequence_Of_Statements =>
297 Analyze_Handled_Statements (N);
299 when N_Identifier =>
300 Analyze_Identifier (N);
302 when N_If_Expression =>
303 Analyze_If_Expression (N);
305 when N_If_Statement =>
306 Analyze_If_Statement (N);
308 when N_Implicit_Label_Declaration =>
309 Analyze_Implicit_Label_Declaration (N);
311 when N_In =>
312 Analyze_Membership_Op (N);
314 when N_Incomplete_Type_Declaration =>
315 Analyze_Incomplete_Type_Decl (N);
317 when N_Indexed_Component =>
318 Analyze_Indexed_Component_Form (N);
320 when N_Integer_Literal =>
321 Analyze_Integer_Literal (N);
323 when N_Iterator_Specification =>
324 Analyze_Iterator_Specification (N);
326 when N_Itype_Reference =>
327 Analyze_Itype_Reference (N);
329 when N_Label =>
330 Analyze_Label (N);
332 when N_Loop_Parameter_Specification =>
333 Analyze_Loop_Parameter_Specification (N);
335 when N_Loop_Statement =>
336 Analyze_Loop_Statement (N);
338 when N_Not_In =>
339 Analyze_Membership_Op (N);
341 when N_Null =>
342 Analyze_Null (N);
344 when N_Null_Statement =>
345 Analyze_Null_Statement (N);
347 when N_Number_Declaration =>
348 Analyze_Number_Declaration (N);
350 when N_Object_Declaration =>
351 Analyze_Object_Declaration (N);
353 when N_Object_Renaming_Declaration =>
354 Analyze_Object_Renaming (N);
356 when N_Operator_Symbol =>
357 Analyze_Operator_Symbol (N);
359 when N_Op_Abs =>
360 Analyze_Unary_Op (N);
362 when N_Op_Add =>
363 Analyze_Arithmetic_Op (N);
365 when N_Op_And =>
366 Analyze_Logical_Op (N);
368 when N_Op_Concat =>
369 Analyze_Concatenation (N);
371 when N_Op_Divide =>
372 Analyze_Arithmetic_Op (N);
374 when N_Op_Eq =>
375 Analyze_Equality_Op (N);
377 when N_Op_Expon =>
378 Analyze_Arithmetic_Op (N);
380 when N_Op_Ge =>
381 Analyze_Comparison_Op (N);
383 when N_Op_Gt =>
384 Analyze_Comparison_Op (N);
386 when N_Op_Le =>
387 Analyze_Comparison_Op (N);
389 when N_Op_Lt =>
390 Analyze_Comparison_Op (N);
392 when N_Op_Minus =>
393 Analyze_Unary_Op (N);
395 when N_Op_Mod =>
396 Analyze_Mod (N);
398 when N_Op_Multiply =>
399 Analyze_Arithmetic_Op (N);
401 when N_Op_Ne =>
402 Analyze_Equality_Op (N);
404 when N_Op_Not =>
405 Analyze_Negation (N);
407 when N_Op_Or =>
408 Analyze_Logical_Op (N);
410 when N_Op_Plus =>
411 Analyze_Unary_Op (N);
413 when N_Op_Rem =>
414 Analyze_Arithmetic_Op (N);
416 when N_Op_Rotate_Left =>
417 Analyze_Arithmetic_Op (N);
419 when N_Op_Rotate_Right =>
420 Analyze_Arithmetic_Op (N);
422 when N_Op_Shift_Left =>
423 Analyze_Arithmetic_Op (N);
425 when N_Op_Shift_Right =>
426 Analyze_Arithmetic_Op (N);
428 when N_Op_Shift_Right_Arithmetic =>
429 Analyze_Arithmetic_Op (N);
431 when N_Op_Subtract =>
432 Analyze_Arithmetic_Op (N);
434 when N_Op_Xor =>
435 Analyze_Logical_Op (N);
437 when N_Or_Else =>
438 Analyze_Short_Circuit (N);
440 when N_Others_Choice =>
441 Analyze_Others_Choice (N);
443 when N_Package_Body =>
444 Analyze_Package_Body (N);
446 when N_Package_Body_Stub =>
447 Analyze_Package_Body_Stub (N);
449 when N_Package_Declaration =>
450 Analyze_Package_Declaration (N);
452 when N_Package_Instantiation =>
453 Analyze_Package_Instantiation (N);
455 when N_Package_Renaming_Declaration =>
456 Analyze_Package_Renaming (N);
458 when N_Package_Specification =>
459 Analyze_Package_Specification (N);
461 when N_Parameter_Association =>
462 Analyze_Parameter_Association (N);
464 when N_Pragma =>
465 Analyze_Pragma (N);
467 when N_Private_Extension_Declaration =>
468 Analyze_Private_Extension_Declaration (N);
470 when N_Private_Type_Declaration =>
471 Analyze_Private_Type_Declaration (N);
473 when N_Procedure_Call_Statement =>
474 Analyze_Procedure_Call (N);
476 when N_Procedure_Instantiation =>
477 Analyze_Procedure_Instantiation (N);
479 when N_Protected_Body =>
480 Analyze_Protected_Body (N);
482 when N_Protected_Body_Stub =>
483 Analyze_Protected_Body_Stub (N);
485 when N_Protected_Definition =>
486 Analyze_Protected_Definition (N);
488 when N_Protected_Type_Declaration =>
489 Analyze_Protected_Type_Declaration (N);
491 when N_Qualified_Expression =>
492 Analyze_Qualified_Expression (N);
494 when N_Quantified_Expression =>
495 Analyze_Quantified_Expression (N);
497 when N_Raise_Expression =>
498 Analyze_Raise_Expression (N);
500 when N_Raise_Statement =>
501 Analyze_Raise_Statement (N);
503 when N_Raise_xxx_Error =>
504 Analyze_Raise_xxx_Error (N);
506 when N_Range =>
507 Analyze_Range (N);
509 when N_Range_Constraint =>
510 Analyze_Range (Range_Expression (N));
512 when N_Real_Literal =>
513 Analyze_Real_Literal (N);
515 when N_Record_Representation_Clause =>
516 Analyze_Record_Representation_Clause (N);
518 when N_Reference =>
519 Analyze_Reference (N);
521 when N_Requeue_Statement =>
522 Analyze_Requeue (N);
524 when N_Simple_Return_Statement =>
525 Analyze_Simple_Return_Statement (N);
527 when N_Selected_Component =>
528 Find_Selected_Component (N);
529 -- ??? why not Analyze_Selected_Component, needs comments
531 when N_Selective_Accept =>
532 Analyze_Selective_Accept (N);
534 when N_Single_Protected_Declaration =>
535 Analyze_Single_Protected_Declaration (N);
537 when N_Single_Task_Declaration =>
538 Analyze_Single_Task_Declaration (N);
540 when N_Slice =>
541 Analyze_Slice (N);
543 when N_String_Literal =>
544 Analyze_String_Literal (N);
546 when N_Subprogram_Body =>
547 Analyze_Subprogram_Body (N);
549 when N_Subprogram_Body_Stub =>
550 Analyze_Subprogram_Body_Stub (N);
552 when N_Subprogram_Declaration =>
553 Analyze_Subprogram_Declaration (N);
555 when N_Subprogram_Renaming_Declaration =>
556 Analyze_Subprogram_Renaming (N);
558 when N_Subtype_Declaration =>
559 Analyze_Subtype_Declaration (N);
561 when N_Subtype_Indication =>
562 Analyze_Subtype_Indication (N);
564 when N_Subunit =>
565 Analyze_Subunit (N);
567 when N_Target_Name =>
568 Analyze_Target_Name (N);
570 when N_Task_Body =>
571 Analyze_Task_Body (N);
573 when N_Task_Body_Stub =>
574 Analyze_Task_Body_Stub (N);
576 when N_Task_Definition =>
577 Analyze_Task_Definition (N);
579 when N_Task_Type_Declaration =>
580 Analyze_Task_Type_Declaration (N);
582 when N_Terminate_Alternative =>
583 Analyze_Terminate_Alternative (N);
585 when N_Timed_Entry_Call =>
586 Analyze_Timed_Entry_Call (N);
588 when N_Triggering_Alternative =>
589 Analyze_Triggering_Alternative (N);
591 when N_Type_Conversion =>
592 Analyze_Type_Conversion (N);
594 when N_Unchecked_Expression =>
595 Analyze_Unchecked_Expression (N);
597 when N_Unchecked_Type_Conversion =>
598 Analyze_Unchecked_Type_Conversion (N);
600 when N_Use_Package_Clause =>
601 Analyze_Use_Package (N);
603 when N_Use_Type_Clause =>
604 Analyze_Use_Type (N);
606 when N_Validate_Unchecked_Conversion =>
607 null;
609 when N_Variant_Part =>
610 Analyze_Variant_Part (N);
612 when N_With_Clause =>
613 Analyze_With_Clause (N);
615 -- A call to analyze the Empty node is an error, but most likely it
616 -- is an error caused by an attempt to analyze a malformed piece of
617 -- tree caused by some other error, so if there have been any other
618 -- errors, we just ignore it, otherwise it is a real internal error
619 -- which we complain about.
621 -- We must also consider the case of call to a runtime function that
622 -- is not available in the configurable runtime.
624 when N_Empty =>
625 pragma Assert (Serious_Errors_Detected /= 0
626 or else Configurable_Run_Time_Violations /= 0);
627 null;
629 -- A call to analyze the error node is simply ignored, to avoid
630 -- causing cascaded errors (happens of course only in error cases)
631 -- Disable expansion in case it is still enabled, to prevent other
632 -- subsequent compiler glitches.
634 when N_Error =>
635 Expander_Mode_Save_And_Set (False);
636 null;
638 -- Push/Pop nodes normally don't come through an analyze call. An
639 -- exception is the dummy ones bracketing a subprogram body. In any
640 -- case there is nothing to be done to analyze such nodes.
642 when N_Push_Pop_xxx_Label =>
643 null;
645 -- SCIL nodes don't need analysis because they are decorated when
646 -- they are built. They are added to the tree by Insert_Actions and
647 -- the call to analyze them is generated when the full list is
648 -- analyzed.
650 when N_SCIL_Dispatch_Table_Tag_Init
651 | N_SCIL_Dispatching_Call
652 | N_SCIL_Membership_Test
654 null;
656 -- A quantified expression with a missing "all" or "some" qualifier
657 -- looks identical to an iterated component association. By language
658 -- definition, the latter must be present within array aggregates. If
659 -- this is not the case, then the iterated component association is
660 -- really an illegal quantified expression. Diagnose this scenario.
662 when N_Iterated_Component_Association =>
663 Diagnose_Iterated_Component_Association (N);
665 -- For the remaining node types, we generate compiler abort, because
666 -- these nodes are always analyzed within the Sem_Chn routines and
667 -- there should never be a case of making a call to the main Analyze
668 -- routine for these node kinds. For example, an N_Access_Definition
669 -- node appears only in the context of a type declaration, and is
670 -- processed by the analyze routine for type declarations.
672 when N_Abortable_Part
673 | N_Access_Definition
674 | N_Access_Function_Definition
675 | N_Access_Procedure_Definition
676 | N_Access_To_Object_Definition
677 | N_Aspect_Specification
678 | N_Case_Expression_Alternative
679 | N_Case_Statement_Alternative
680 | N_Compilation_Unit_Aux
681 | N_Component_Association
682 | N_Component_Clause
683 | N_Component_Definition
684 | N_Component_List
685 | N_Constrained_Array_Definition
686 | N_Contract
687 | N_Decimal_Fixed_Point_Definition
688 | N_Defining_Character_Literal
689 | N_Defining_Identifier
690 | N_Defining_Operator_Symbol
691 | N_Defining_Program_Unit_Name
692 | N_Delta_Constraint
693 | N_Derived_Type_Definition
694 | N_Designator
695 | N_Digits_Constraint
696 | N_Discriminant_Association
697 | N_Discriminant_Specification
698 | N_Elsif_Part
699 | N_Entry_Call_Statement
700 | N_Enumeration_Type_Definition
701 | N_Exception_Handler
702 | N_Floating_Point_Definition
703 | N_Formal_Decimal_Fixed_Point_Definition
704 | N_Formal_Derived_Type_Definition
705 | N_Formal_Discrete_Type_Definition
706 | N_Formal_Floating_Point_Definition
707 | N_Formal_Modular_Type_Definition
708 | N_Formal_Ordinary_Fixed_Point_Definition
709 | N_Formal_Private_Type_Definition
710 | N_Formal_Incomplete_Type_Definition
711 | N_Formal_Signed_Integer_Type_Definition
712 | N_Function_Specification
713 | N_Generic_Association
714 | N_Index_Or_Discriminant_Constraint
715 | N_Iteration_Scheme
716 | N_Mod_Clause
717 | N_Modular_Type_Definition
718 | N_Ordinary_Fixed_Point_Definition
719 | N_Parameter_Specification
720 | N_Pragma_Argument_Association
721 | N_Procedure_Specification
722 | N_Real_Range_Specification
723 | N_Record_Definition
724 | N_Signed_Integer_Type_Definition
725 | N_Unconstrained_Array_Definition
726 | N_Unused_At_End
727 | N_Unused_At_Start
728 | N_Variant
730 raise Program_Error;
731 end case;
733 Debug_A_Exit ("analyzing ", N, " (done)");
735 -- Now that we have analyzed the node, we call the expander to perform
736 -- possible expansion. We skip this for subexpressions, because we don't
737 -- have the type yet, and the expander will need to know the type before
738 -- it can do its job. For subexpression nodes, the call to the expander
739 -- happens in Sem_Res.Resolve. A special exception is Raise_xxx_Error,
740 -- which can appear in a statement context, and needs expanding now in
741 -- the case (distinguished by Etype, as documented in Sinfo).
743 -- The Analyzed flag is also set at this point for non-subexpression
744 -- nodes (in the case of subexpression nodes, we can't set the flag yet,
745 -- since resolution and expansion have not yet been completed). Note
746 -- that for N_Raise_xxx_Error we have to distinguish the expression
747 -- case from the statement case.
749 if Nkind (N) not in N_Subexpr
750 or else (Nkind (N) in N_Raise_xxx_Error
751 and then Etype (N) = Standard_Void_Type)
752 then
753 Expand (N);
755 -- Replace a reference to a renaming with the renamed object for SPARK.
756 -- In general this modification is performed by Expand_SPARK, however
757 -- certain constructs may not reach the resolution or expansion phase
758 -- and thus remain unchanged. The replacement is not performed when the
759 -- construct is overloaded as resolution must first take place. This is
760 -- also not done when analyzing a generic to preserve the original tree
761 -- and because the reference may become overloaded in the instance.
763 elsif GNATprove_Mode
764 and then Nkind_In (N, N_Expanded_Name, N_Identifier)
765 and then not Is_Overloaded (N)
766 and then not Inside_A_Generic
767 then
768 Expand_SPARK_Potential_Renaming (N);
769 end if;
771 Restore_Ghost_Mode (Saved_GM);
772 end Analyze;
774 -- Version with check(s) suppressed
776 procedure Analyze (N : Node_Id; Suppress : Check_Id) is
777 begin
778 if Suppress = All_Checks then
779 declare
780 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
781 begin
782 Scope_Suppress.Suppress := (others => True);
783 Analyze (N);
784 Scope_Suppress.Suppress := Svs;
785 end;
787 elsif Suppress = Overflow_Check then
788 declare
789 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
790 begin
791 Scope_Suppress.Suppress (Suppress) := True;
792 Analyze (N);
793 Scope_Suppress.Suppress (Suppress) := Svg;
794 end;
795 end if;
796 end Analyze;
798 ------------------
799 -- Analyze_List --
800 ------------------
802 procedure Analyze_List (L : List_Id) is
803 Node : Node_Id;
805 begin
806 Node := First (L);
807 while Present (Node) loop
808 Analyze (Node);
809 Next (Node);
810 end loop;
811 end Analyze_List;
813 -- Version with check(s) suppressed
815 procedure Analyze_List (L : List_Id; Suppress : Check_Id) is
816 begin
817 if Suppress = All_Checks then
818 declare
819 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
820 begin
821 Scope_Suppress.Suppress := (others => True);
822 Analyze_List (L);
823 Scope_Suppress.Suppress := Svs;
824 end;
826 else
827 declare
828 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
829 begin
830 Scope_Suppress.Suppress (Suppress) := True;
831 Analyze_List (L);
832 Scope_Suppress.Suppress (Suppress) := Svg;
833 end;
834 end if;
835 end Analyze_List;
837 --------------------------
838 -- Copy_Suppress_Status --
839 --------------------------
841 procedure Copy_Suppress_Status
842 (C : Check_Id;
843 From : Entity_Id;
844 To : Entity_Id)
846 Found : Boolean;
847 pragma Warnings (Off, Found);
849 procedure Search_Stack
850 (Top : Suppress_Stack_Entry_Ptr;
851 Found : out Boolean);
852 -- Search given suppress stack for matching entry for entity. If found
853 -- then set Checks_May_Be_Suppressed on To, and push an appropriate
854 -- entry for To onto the local suppress stack.
856 ------------------
857 -- Search_Stack --
858 ------------------
860 procedure Search_Stack
861 (Top : Suppress_Stack_Entry_Ptr;
862 Found : out Boolean)
864 Ptr : Suppress_Stack_Entry_Ptr;
866 begin
867 Ptr := Top;
868 while Ptr /= null loop
869 if Ptr.Entity = From
870 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
871 then
872 if Ptr.Suppress then
873 Set_Checks_May_Be_Suppressed (To, True);
874 Push_Local_Suppress_Stack_Entry
875 (Entity => To,
876 Check => C,
877 Suppress => True);
878 Found := True;
879 return;
880 end if;
881 end if;
883 Ptr := Ptr.Prev;
884 end loop;
886 Found := False;
887 return;
888 end Search_Stack;
890 -- Start of processing for Copy_Suppress_Status
892 begin
893 if not Checks_May_Be_Suppressed (From) then
894 return;
895 end if;
897 -- First search the global entity suppress table for a matching entry.
898 -- We also search this in reverse order so that if there are multiple
899 -- pragmas for the same entity, the last one applies.
901 Search_Stack (Global_Suppress_Stack_Top, Found);
903 if Found then
904 return;
905 end if;
907 -- Now search the local entity suppress stack, we search this in
908 -- reverse order so that we get the innermost entry that applies to
909 -- this case if there are nested entries. Note that for the purpose
910 -- of this procedure we are ONLY looking for entries corresponding
911 -- to a two-argument Suppress, where the second argument matches From.
913 Search_Stack (Local_Suppress_Stack_Top, Found);
914 end Copy_Suppress_Status;
916 -------------------------
917 -- Enter_Generic_Scope --
918 -------------------------
920 procedure Enter_Generic_Scope (S : Entity_Id) is
921 begin
922 if No (Outer_Generic_Scope) then
923 Outer_Generic_Scope := S;
924 end if;
925 end Enter_Generic_Scope;
927 ------------------------
928 -- Exit_Generic_Scope --
929 ------------------------
931 procedure Exit_Generic_Scope (S : Entity_Id) is
932 begin
933 if S = Outer_Generic_Scope then
934 Outer_Generic_Scope := Empty;
935 end if;
936 end Exit_Generic_Scope;
938 -----------------------
939 -- Explicit_Suppress --
940 -----------------------
942 function Explicit_Suppress (E : Entity_Id; C : Check_Id) return Boolean is
943 Ptr : Suppress_Stack_Entry_Ptr;
945 begin
946 if not Checks_May_Be_Suppressed (E) then
947 return False;
949 else
950 Ptr := Global_Suppress_Stack_Top;
951 while Ptr /= null loop
952 if Ptr.Entity = E
953 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
954 then
955 return Ptr.Suppress;
956 end if;
958 Ptr := Ptr.Prev;
959 end loop;
960 end if;
962 return False;
963 end Explicit_Suppress;
965 -----------------------------
966 -- External_Ref_In_Generic --
967 -----------------------------
969 function External_Ref_In_Generic (E : Entity_Id) return Boolean is
970 Scop : Entity_Id;
972 begin
973 -- Entity is global if defined outside of current outer_generic_scope:
974 -- Either the entity has a smaller depth that the outer generic, or it
975 -- is in a different compilation unit, or it is defined within a unit
976 -- in the same compilation, that is not within the outer_generic.
978 if No (Outer_Generic_Scope) then
979 return False;
981 elsif Scope_Depth (Scope (E)) < Scope_Depth (Outer_Generic_Scope)
982 or else not In_Same_Source_Unit (E, Outer_Generic_Scope)
983 then
984 return True;
986 else
987 Scop := Scope (E);
988 while Present (Scop) loop
989 if Scop = Outer_Generic_Scope then
990 return False;
991 elsif Scope_Depth (Scop) < Scope_Depth (Outer_Generic_Scope) then
992 return True;
993 else
994 Scop := Scope (Scop);
995 end if;
996 end loop;
998 return True;
999 end if;
1000 end External_Ref_In_Generic;
1002 ----------------
1003 -- Initialize --
1004 ----------------
1006 procedure Initialize is
1007 Next : Suppress_Stack_Entry_Ptr;
1009 procedure Free is new Unchecked_Deallocation
1010 (Suppress_Stack_Entry, Suppress_Stack_Entry_Ptr);
1012 begin
1013 -- Free any global suppress stack entries from a previous invocation
1014 -- of the compiler (in the normal case this loop does nothing).
1016 while Suppress_Stack_Entries /= null loop
1017 Next := Suppress_Stack_Entries.Next;
1018 Free (Suppress_Stack_Entries);
1019 Suppress_Stack_Entries := Next;
1020 end loop;
1022 Local_Suppress_Stack_Top := null;
1023 Global_Suppress_Stack_Top := null;
1025 -- Clear scope stack, and reset global variables
1027 Scope_Stack.Init;
1028 Unloaded_Subunits := False;
1029 end Initialize;
1031 ------------------------------
1032 -- Insert_After_And_Analyze --
1033 ------------------------------
1035 procedure Insert_After_And_Analyze (N : Node_Id; M : Node_Id) is
1036 Node : Node_Id;
1038 begin
1039 if Present (M) then
1041 -- If we are not at the end of the list, then the easiest
1042 -- coding is simply to insert before our successor.
1044 if Present (Next (N)) then
1045 Insert_Before_And_Analyze (Next (N), M);
1047 -- Case of inserting at the end of the list
1049 else
1050 -- Capture the Node_Id of the node to be inserted. This Node_Id
1051 -- will still be the same after the insert operation.
1053 Node := M;
1054 Insert_After (N, M);
1056 -- Now just analyze from the inserted node to the end of
1057 -- the new list (note that this properly handles the case
1058 -- where any of the analyze calls result in the insertion of
1059 -- nodes after the analyzed node, expecting analysis).
1061 while Present (Node) loop
1062 Analyze (Node);
1063 Mark_Rewrite_Insertion (Node);
1064 Next (Node);
1065 end loop;
1066 end if;
1067 end if;
1068 end Insert_After_And_Analyze;
1070 -- Version with check(s) suppressed
1072 procedure Insert_After_And_Analyze
1073 (N : Node_Id;
1074 M : Node_Id;
1075 Suppress : Check_Id)
1077 begin
1078 if Suppress = All_Checks then
1079 declare
1080 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
1081 begin
1082 Scope_Suppress.Suppress := (others => True);
1083 Insert_After_And_Analyze (N, M);
1084 Scope_Suppress.Suppress := Svs;
1085 end;
1087 else
1088 declare
1089 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
1090 begin
1091 Scope_Suppress.Suppress (Suppress) := True;
1092 Insert_After_And_Analyze (N, M);
1093 Scope_Suppress.Suppress (Suppress) := Svg;
1094 end;
1095 end if;
1096 end Insert_After_And_Analyze;
1098 -------------------------------
1099 -- Insert_Before_And_Analyze --
1100 -------------------------------
1102 procedure Insert_Before_And_Analyze (N : Node_Id; M : Node_Id) is
1103 Node : Node_Id;
1105 begin
1106 if Present (M) then
1108 -- Capture the Node_Id of the first list node to be inserted.
1109 -- This will still be the first node after the insert operation,
1110 -- since Insert_List_After does not modify the Node_Id values.
1112 Node := M;
1113 Insert_Before (N, M);
1115 -- The insertion does not change the Id's of any of the nodes in
1116 -- the list, and they are still linked, so we can simply loop from
1117 -- the original first node until we meet the node before which the
1118 -- insertion is occurring. Note that this properly handles the case
1119 -- where any of the analyzed nodes insert nodes after themselves,
1120 -- expecting them to get analyzed.
1122 while Node /= N loop
1123 Analyze (Node);
1124 Mark_Rewrite_Insertion (Node);
1125 Next (Node);
1126 end loop;
1127 end if;
1128 end Insert_Before_And_Analyze;
1130 -- Version with check(s) suppressed
1132 procedure Insert_Before_And_Analyze
1133 (N : Node_Id;
1134 M : Node_Id;
1135 Suppress : Check_Id)
1137 begin
1138 if Suppress = All_Checks then
1139 declare
1140 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
1141 begin
1142 Scope_Suppress.Suppress := (others => True);
1143 Insert_Before_And_Analyze (N, M);
1144 Scope_Suppress.Suppress := Svs;
1145 end;
1147 else
1148 declare
1149 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
1150 begin
1151 Scope_Suppress.Suppress (Suppress) := True;
1152 Insert_Before_And_Analyze (N, M);
1153 Scope_Suppress.Suppress (Suppress) := Svg;
1154 end;
1155 end if;
1156 end Insert_Before_And_Analyze;
1158 -----------------------------------
1159 -- Insert_List_After_And_Analyze --
1160 -----------------------------------
1162 procedure Insert_List_After_And_Analyze (N : Node_Id; L : List_Id) is
1163 After : constant Node_Id := Next (N);
1164 Node : Node_Id;
1166 begin
1167 if Is_Non_Empty_List (L) then
1169 -- Capture the Node_Id of the first list node to be inserted.
1170 -- This will still be the first node after the insert operation,
1171 -- since Insert_List_After does not modify the Node_Id values.
1173 Node := First (L);
1174 Insert_List_After (N, L);
1176 -- Now just analyze from the original first node until we get to the
1177 -- successor of the original insertion point (which may be Empty if
1178 -- the insertion point was at the end of the list). Note that this
1179 -- properly handles the case where any of the analyze calls result in
1180 -- the insertion of nodes after the analyzed node (possibly calling
1181 -- this routine recursively).
1183 while Node /= After loop
1184 Analyze (Node);
1185 Mark_Rewrite_Insertion (Node);
1186 Next (Node);
1187 end loop;
1188 end if;
1189 end Insert_List_After_And_Analyze;
1191 ------------------------------------
1192 -- Insert_List_Before_And_Analyze --
1193 ------------------------------------
1195 procedure Insert_List_Before_And_Analyze (N : Node_Id; L : List_Id) is
1196 Node : Node_Id;
1198 begin
1199 if Is_Non_Empty_List (L) then
1201 -- Capture the Node_Id of the first list node to be inserted. This
1202 -- will still be the first node after the insert operation, since
1203 -- Insert_List_After does not modify the Node_Id values.
1205 Node := First (L);
1206 Insert_List_Before (N, L);
1208 -- The insertion does not change the Id's of any of the nodes in
1209 -- the list, and they are still linked, so we can simply loop from
1210 -- the original first node until we meet the node before which the
1211 -- insertion is occurring. Note that this properly handles the case
1212 -- where any of the analyzed nodes insert nodes after themselves,
1213 -- expecting them to get analyzed.
1215 while Node /= N loop
1216 Analyze (Node);
1217 Mark_Rewrite_Insertion (Node);
1218 Next (Node);
1219 end loop;
1220 end if;
1221 end Insert_List_Before_And_Analyze;
1223 ----------
1224 -- Lock --
1225 ----------
1227 procedure Lock is
1228 begin
1229 Scope_Stack.Release;
1230 Scope_Stack.Locked := True;
1231 end Lock;
1233 ----------------
1234 -- Preanalyze --
1235 ----------------
1237 procedure Preanalyze (N : Node_Id) is
1238 Save_Full_Analysis : constant Boolean := Full_Analysis;
1240 begin
1241 Full_Analysis := False;
1242 Expander_Mode_Save_And_Set (False);
1244 Analyze (N);
1246 Expander_Mode_Restore;
1247 Full_Analysis := Save_Full_Analysis;
1248 end Preanalyze;
1250 --------------------------------------
1251 -- Push_Global_Suppress_Stack_Entry --
1252 --------------------------------------
1254 procedure Push_Global_Suppress_Stack_Entry
1255 (Entity : Entity_Id;
1256 Check : Check_Id;
1257 Suppress : Boolean)
1259 begin
1260 Global_Suppress_Stack_Top :=
1261 new Suppress_Stack_Entry'
1262 (Entity => Entity,
1263 Check => Check,
1264 Suppress => Suppress,
1265 Prev => Global_Suppress_Stack_Top,
1266 Next => Suppress_Stack_Entries);
1267 Suppress_Stack_Entries := Global_Suppress_Stack_Top;
1268 return;
1269 end Push_Global_Suppress_Stack_Entry;
1271 -------------------------------------
1272 -- Push_Local_Suppress_Stack_Entry --
1273 -------------------------------------
1275 procedure Push_Local_Suppress_Stack_Entry
1276 (Entity : Entity_Id;
1277 Check : Check_Id;
1278 Suppress : Boolean)
1280 begin
1281 Local_Suppress_Stack_Top :=
1282 new Suppress_Stack_Entry'
1283 (Entity => Entity,
1284 Check => Check,
1285 Suppress => Suppress,
1286 Prev => Local_Suppress_Stack_Top,
1287 Next => Suppress_Stack_Entries);
1288 Suppress_Stack_Entries := Local_Suppress_Stack_Top;
1290 return;
1291 end Push_Local_Suppress_Stack_Entry;
1293 ---------------
1294 -- Semantics --
1295 ---------------
1297 procedure Semantics (Comp_Unit : Node_Id) is
1298 procedure Do_Analyze;
1299 -- Perform the analysis of the compilation unit
1301 ----------------
1302 -- Do_Analyze --
1303 ----------------
1305 -- WARNING: This routine manages Ghost regions. Return statements must
1306 -- be replaced by gotos which jump to the end of the routine and restore
1307 -- the Ghost mode.
1309 procedure Do_Analyze is
1310 Save_Ghost_Mode : constant Ghost_Mode_Type := Ghost_Mode;
1312 -- Generally style checks are preserved across compilations, with
1313 -- one exception: s-oscons.ads, which allows arbitrary long lines
1314 -- unconditionally, and has no restore mechanism, because it is
1315 -- intended as a lowest-level Pure package.
1317 Save_Max_Line : constant Int := Style_Max_Line_Length;
1319 List : Elist_Id;
1321 begin
1322 List := Save_Scope_Stack;
1323 Push_Scope (Standard_Standard);
1325 -- Set up a clean environment before analyzing
1327 Install_Ghost_Mode (None);
1328 Outer_Generic_Scope := Empty;
1329 Scope_Suppress := Suppress_Options;
1330 Scope_Stack.Table
1331 (Scope_Stack.Last).Component_Alignment_Default :=
1332 Configuration_Component_Alignment;
1333 Scope_Stack.Table
1334 (Scope_Stack.Last).Is_Active_Stack_Base := True;
1336 -- Now analyze the top level compilation unit node
1338 Analyze (Comp_Unit);
1340 -- Check for scope mismatch on exit from compilation
1342 pragma Assert (Current_Scope = Standard_Standard
1343 or else Comp_Unit = Cunit (Main_Unit));
1345 -- Then pop entry for Standard, and pop implicit types
1347 Pop_Scope;
1348 Restore_Scope_Stack (List);
1349 Restore_Ghost_Mode (Save_Ghost_Mode);
1350 Style_Max_Line_Length := Save_Max_Line;
1351 end Do_Analyze;
1353 -- Local variables
1355 -- The following locations save the corresponding global flags and
1356 -- variables so that they can be restored on completion. This is needed
1357 -- so that calls to Rtsfind start with the proper default values for
1358 -- these variables, and also that such calls do not disturb the settings
1359 -- for units being analyzed at a higher level.
1361 S_Current_Sem_Unit : constant Unit_Number_Type := Current_Sem_Unit;
1362 S_Full_Analysis : constant Boolean := Full_Analysis;
1363 S_GNAT_Mode : constant Boolean := GNAT_Mode;
1364 S_Global_Dis_Names : constant Boolean := Global_Discard_Names;
1365 S_In_Assertion_Expr : constant Nat := In_Assertion_Expr;
1366 S_In_Default_Expr : constant Boolean := In_Default_Expr;
1367 S_In_Spec_Expr : constant Boolean := In_Spec_Expression;
1368 S_Inside_A_Generic : constant Boolean := Inside_A_Generic;
1369 S_Outer_Gen_Scope : constant Entity_Id := Outer_Generic_Scope;
1370 S_Style_Check : constant Boolean := Style_Check;
1372 Already_Analyzed : constant Boolean := Analyzed (Comp_Unit);
1374 Curunit : constant Unit_Number_Type := Get_Cunit_Unit_Number (Comp_Unit);
1375 -- New value of Current_Sem_Unit
1377 Generic_Main : constant Boolean :=
1378 Nkind (Unit (Cunit (Main_Unit))) in N_Generic_Declaration;
1379 -- If the main unit is generic, every compiled unit, including its
1380 -- context, is compiled with expansion disabled.
1382 Is_Main_Unit_Or_Main_Unit_Spec : constant Boolean :=
1383 Curunit = Main_Unit
1384 or else
1385 (Nkind (Unit (Cunit (Main_Unit))) = N_Package_Body
1386 and then Library_Unit (Cunit (Main_Unit)) = Cunit (Curunit));
1387 -- Configuration flags have special settings when compiling a predefined
1388 -- file as a main unit. This applies to its spec as well.
1390 Ext_Main_Source_Unit : constant Boolean :=
1391 In_Extended_Main_Source_Unit (Comp_Unit);
1392 -- Determine if unit is in extended main source unit
1394 Save_Config_Switches : Config_Switches_Type;
1395 -- Variable used to save values of config switches while we analyze the
1396 -- new unit, to be restored on exit for proper recursive behavior.
1398 Save_Cunit_Restrictions : Save_Cunit_Boolean_Restrictions;
1399 -- Used to save non-partition wide restrictions before processing new
1400 -- unit. All with'ed units are analyzed with config restrictions reset
1401 -- and we need to restore these saved values at the end.
1403 -- Start of processing for Semantics
1405 begin
1406 if Debug_Unit_Walk then
1407 if Already_Analyzed then
1408 Write_Str ("(done)");
1409 end if;
1411 Write_Unit_Info
1412 (Get_Cunit_Unit_Number (Comp_Unit),
1413 Unit (Comp_Unit),
1414 Prefix => "--> ");
1415 Indent;
1416 end if;
1418 Compiler_State := Analyzing;
1419 Current_Sem_Unit := Curunit;
1421 -- Compile predefined units with GNAT_Mode set to True, to properly
1422 -- process the categorization stuff. However, do not set GNAT_Mode
1423 -- to True for the renamings units (Text_IO, IO_Exceptions, Direct_IO,
1424 -- Sequential_IO) as this would prevent pragma Extend_System from being
1425 -- taken into account, for example when Text_IO is renaming DEC.Text_IO.
1427 if Is_Predefined_Unit (Current_Sem_Unit)
1428 and then not Is_Predefined_Renaming (Current_Sem_Unit)
1429 then
1430 GNAT_Mode := True;
1431 end if;
1433 -- For generic main, never do expansion
1435 if Generic_Main then
1436 Expander_Mode_Save_And_Set (False);
1438 -- Non generic case
1440 else
1441 Expander_Mode_Save_And_Set
1443 -- Turn on expansion if generating code
1445 (Operating_Mode = Generate_Code
1447 -- Or if special debug flag -gnatdx is set
1449 or else Debug_Flag_X
1451 -- Or if in configuration run-time mode. We do this so we get
1452 -- error messages about missing entities in the run-time even
1453 -- if we are compiling in -gnatc (no code generation) mode.
1454 -- Similar processing applies to No_Run_Time_Mode. However,
1455 -- don't do this if debug flag -gnatd.Z is set or when we are
1456 -- compiling a separate unit (this is to handle a situation
1457 -- where this new processing causes trouble).
1459 or else
1460 ((Configurable_Run_Time_Mode or No_Run_Time_Mode)
1461 and then not Debug_Flag_Dot_ZZ
1462 and then Nkind (Unit (Cunit (Main_Unit))) /= N_Subunit));
1463 end if;
1465 Full_Analysis := True;
1466 Inside_A_Generic := False;
1467 In_Assertion_Expr := 0;
1468 In_Default_Expr := False;
1469 In_Spec_Expression := False;
1470 Set_Comes_From_Source_Default (False);
1472 -- Save current config switches and reset then appropriately
1474 Save_Opt_Config_Switches (Save_Config_Switches);
1475 Set_Opt_Config_Switches
1476 (Is_Internal_Unit (Current_Sem_Unit),
1477 Is_Main_Unit_Or_Main_Unit_Spec);
1479 -- Save current non-partition-wide restrictions
1481 Save_Cunit_Restrictions := Cunit_Boolean_Restrictions_Save;
1483 -- For unit in main extended unit, we reset the configuration values
1484 -- for the non-partition-wide restrictions. For other units reset them.
1486 if Ext_Main_Source_Unit then
1487 Restore_Config_Cunit_Boolean_Restrictions;
1488 else
1489 Reset_Cunit_Boolean_Restrictions;
1490 end if;
1492 -- Turn off style checks for unit that is not in the extended main
1493 -- source unit. This improves processing efficiency for such units
1494 -- (for which we don't want style checks anyway, and where they will
1495 -- get suppressed), and is definitely needed to stop some style checks
1496 -- from invading the run-time units (e.g. overriding checks).
1498 if not Ext_Main_Source_Unit then
1499 Style_Check := False;
1501 -- If this is part of the extended main source unit, set style check
1502 -- mode to match the style check mode of the main source unit itself.
1504 else
1505 Style_Check := Style_Check_Main;
1506 end if;
1508 -- Only do analysis of unit that has not already been analyzed
1510 if not Analyzed (Comp_Unit) then
1511 Initialize_Version (Current_Sem_Unit);
1513 -- Do analysis, and then append the compilation unit onto the
1514 -- Comp_Unit_List, if appropriate. This is done after analysis,
1515 -- so if this unit depends on some others, they have already been
1516 -- appended. We ignore bodies, except for the main unit itself, and
1517 -- for subprogram bodies that act as specs. We have also to guard
1518 -- against ill-formed subunits that have an improper context.
1520 Do_Analyze;
1522 if Present (Comp_Unit)
1523 and then Nkind (Unit (Comp_Unit)) in N_Proper_Body
1524 and then (Nkind (Unit (Comp_Unit)) /= N_Subprogram_Body
1525 or else not Acts_As_Spec (Comp_Unit))
1526 and then not In_Extended_Main_Source_Unit (Comp_Unit)
1527 then
1528 null;
1530 else
1531 Append_New_Elmt (Comp_Unit, To => Comp_Unit_List);
1533 if Debug_Unit_Walk then
1534 Write_Str ("Appending ");
1535 Write_Unit_Info
1536 (Get_Cunit_Unit_Number (Comp_Unit), Unit (Comp_Unit));
1537 end if;
1538 end if;
1539 end if;
1541 -- Save indication of dynamic elaboration checks for ALI file
1543 Set_Dynamic_Elab (Current_Sem_Unit, Dynamic_Elaboration_Checks);
1545 -- Restore settings of saved switches to entry values
1547 Current_Sem_Unit := S_Current_Sem_Unit;
1548 Full_Analysis := S_Full_Analysis;
1549 Global_Discard_Names := S_Global_Dis_Names;
1550 GNAT_Mode := S_GNAT_Mode;
1551 In_Assertion_Expr := S_In_Assertion_Expr;
1552 In_Default_Expr := S_In_Default_Expr;
1553 In_Spec_Expression := S_In_Spec_Expr;
1554 Inside_A_Generic := S_Inside_A_Generic;
1555 Outer_Generic_Scope := S_Outer_Gen_Scope;
1556 Style_Check := S_Style_Check;
1558 Restore_Opt_Config_Switches (Save_Config_Switches);
1560 -- Deal with restore of restrictions
1562 Cunit_Boolean_Restrictions_Restore (Save_Cunit_Restrictions);
1564 Expander_Mode_Restore;
1566 if Debug_Unit_Walk then
1567 Outdent;
1569 if Already_Analyzed then
1570 Write_Str ("(done)");
1571 end if;
1573 Write_Unit_Info
1574 (Get_Cunit_Unit_Number (Comp_Unit),
1575 Unit (Comp_Unit),
1576 Prefix => "<-- ");
1577 end if;
1578 end Semantics;
1580 --------
1581 -- ss --
1582 --------
1584 function ss (Index : Int) return Scope_Stack_Entry is
1585 begin
1586 return Scope_Stack.Table (Index);
1587 end ss;
1589 ---------
1590 -- sst --
1591 ---------
1593 function sst return Scope_Stack_Entry is
1594 begin
1595 return ss (Scope_Stack.Last);
1596 end sst;
1598 ------------
1599 -- Unlock --
1600 ------------
1602 procedure Unlock is
1603 begin
1604 Scope_Stack.Locked := False;
1605 end Unlock;
1607 ------------------------
1608 -- Walk_Library_Items --
1609 ------------------------
1611 procedure Walk_Library_Items is
1612 type Unit_Number_Set is array (Main_Unit .. Last_Unit) of Boolean;
1613 pragma Pack (Unit_Number_Set);
1615 Main_CU : constant Node_Id := Cunit (Main_Unit);
1617 Seen, Done : Unit_Number_Set := (others => False);
1618 -- Seen (X) is True after we have seen unit X in the walk. This is used
1619 -- to prevent processing the same unit more than once. Done (X) is True
1620 -- after we have fully processed X, and is used only for debugging
1621 -- printouts and assertions.
1623 Do_Main : Boolean := False;
1624 -- Flag to delay processing the main body until after all other units.
1625 -- This is needed because the spec of the main unit may appear in the
1626 -- context of some other unit. We do not want this to force processing
1627 -- of the main body before all other units have been processed.
1629 -- Another circularity pattern occurs when the main unit is a child unit
1630 -- and the body of an ancestor has a with-clause of the main unit or on
1631 -- one of its children. In both cases the body in question has a with-
1632 -- clause on the main unit, and must be excluded from the traversal. In
1633 -- some convoluted cases this may lead to a CodePeer error because the
1634 -- spec of a subprogram declared in an instance within the parent will
1635 -- not be seen in the main unit.
1637 function Depends_On_Main (CU : Node_Id) return Boolean;
1638 -- The body of a unit that is withed by the spec of the main unit may in
1639 -- turn have a with_clause on that spec. In that case do not traverse
1640 -- the body, to prevent loops. It can also happen that the main body has
1641 -- a with_clause on a child, which of course has an implicit with on its
1642 -- parent. It's OK to traverse the child body if the main spec has been
1643 -- processed, otherwise we also have a circularity to avoid.
1645 procedure Do_Action (CU : Node_Id; Item : Node_Id);
1646 -- Calls Action, with some validity checks
1648 procedure Do_Unit_And_Dependents (CU : Node_Id; Item : Node_Id);
1649 -- Calls Do_Action, first on the units with'ed by this one, then on
1650 -- this unit. If it's an instance body, do the spec first. If it is
1651 -- an instance spec, do the body last.
1653 procedure Do_Withed_Unit (Withed_Unit : Node_Id);
1654 -- Apply Do_Unit_And_Dependents to a unit in a context clause
1656 procedure Process_Bodies_In_Context (Comp : Node_Id);
1657 -- The main unit and its spec may depend on bodies that contain generics
1658 -- that are instantiated in them. Iterate through the corresponding
1659 -- contexts before processing main (spec/body) itself, to process bodies
1660 -- that may be present, together with their context. The spec of main
1661 -- is processed wherever it appears in the list of units, while the body
1662 -- is processed as the last unit in the list.
1664 ---------------------
1665 -- Depends_On_Main --
1666 ---------------------
1668 function Depends_On_Main (CU : Node_Id) return Boolean is
1669 CL : Node_Id;
1670 MCU : constant Node_Id := Unit (Main_CU);
1672 begin
1673 CL := First (Context_Items (CU));
1675 -- Problem does not arise with main subprograms
1678 not Nkind_In (MCU, N_Package_Body, N_Package_Declaration)
1679 then
1680 return False;
1681 end if;
1683 while Present (CL) loop
1684 if Nkind (CL) = N_With_Clause
1685 and then Library_Unit (CL) = Main_CU
1686 and then not Done (Get_Cunit_Unit_Number (Library_Unit (CL)))
1687 then
1688 return True;
1689 end if;
1691 Next (CL);
1692 end loop;
1694 return False;
1695 end Depends_On_Main;
1697 ---------------
1698 -- Do_Action --
1699 ---------------
1701 procedure Do_Action (CU : Node_Id; Item : Node_Id) is
1702 begin
1703 -- This calls Action at the end. All the preceding code is just
1704 -- assertions and debugging output.
1706 pragma Assert (No (CU) or else Nkind (CU) = N_Compilation_Unit);
1708 case Nkind (Item) is
1709 when N_Generic_Function_Renaming_Declaration
1710 | N_Generic_Package_Declaration
1711 | N_Generic_Package_Renaming_Declaration
1712 | N_Generic_Procedure_Renaming_Declaration
1713 | N_Generic_Subprogram_Declaration
1714 | N_Package_Declaration
1715 | N_Package_Renaming_Declaration
1716 | N_Subprogram_Declaration
1717 | N_Subprogram_Renaming_Declaration
1719 -- Specs are OK
1721 null;
1723 when N_Package_Body =>
1725 -- Package bodies are processed separately if the main unit
1726 -- depends on them.
1728 null;
1730 when N_Subprogram_Body =>
1732 -- A subprogram body must be the main unit
1734 pragma Assert (Acts_As_Spec (CU)
1735 or else CU = Cunit (Main_Unit));
1736 null;
1738 when N_Function_Instantiation
1739 | N_Package_Instantiation
1740 | N_Procedure_Instantiation
1742 -- Can only happen if some generic body (needed for gnat2scil
1743 -- traversal, but not by GNAT) is not available, ignore.
1745 null;
1747 -- All other cases cannot happen
1749 when N_Subunit =>
1750 pragma Assert (False, "subunit");
1751 null;
1753 when N_Null_Statement =>
1755 -- Do not call Action for an ignored ghost unit
1757 pragma Assert (Is_Ignored_Ghost_Node (Original_Node (Item)));
1758 return;
1760 when others =>
1761 pragma Assert (False);
1762 null;
1763 end case;
1765 if Present (CU) then
1766 pragma Assert (Item /= Stand.Standard_Package_Node);
1767 pragma Assert (Item = Unit (CU));
1769 declare
1770 Unit_Num : constant Unit_Number_Type :=
1771 Get_Cunit_Unit_Number (CU);
1773 procedure Assert_Done (Withed_Unit : Node_Id);
1774 -- Assert Withed_Unit is already Done, unless it's a body. It
1775 -- might seem strange for a with_clause to refer to a body, but
1776 -- this happens in the case of a generic instantiation, which
1777 -- gets transformed into the instance body (and the instance
1778 -- spec is also created). With clauses pointing to the
1779 -- instantiation end up pointing to the instance body.
1781 -----------------
1782 -- Assert_Done --
1783 -----------------
1785 procedure Assert_Done (Withed_Unit : Node_Id) is
1786 begin
1787 if not Done (Get_Cunit_Unit_Number (Withed_Unit)) then
1788 if not Nkind_In
1789 (Unit (Withed_Unit),
1790 N_Generic_Package_Declaration,
1791 N_Package_Body,
1792 N_Package_Renaming_Declaration,
1793 N_Subprogram_Body)
1794 then
1795 Write_Unit_Name
1796 (Unit_Name (Get_Cunit_Unit_Number (Withed_Unit)));
1797 Write_Str (" not yet walked!");
1799 if Get_Cunit_Unit_Number (Withed_Unit) = Unit_Num then
1800 Write_Str (" (self-ref)");
1801 end if;
1803 Write_Eol;
1805 pragma Assert (False);
1806 end if;
1807 end if;
1808 end Assert_Done;
1810 procedure Assert_Withed_Units_Done is
1811 new Walk_Withs (Assert_Done);
1813 begin
1814 if Debug_Unit_Walk then
1815 Write_Unit_Info (Unit_Num, Item, Withs => True);
1816 end if;
1818 -- Main unit should come last, except in the case where we
1819 -- skipped System_Aux_Id, in which case we missed the things it
1820 -- depends on, and in the case of parent bodies if present.
1822 pragma Assert
1823 (not Done (Main_Unit)
1824 or else Present (System_Aux_Id)
1825 or else Nkind (Item) = N_Package_Body);
1827 -- We shouldn't do the same thing twice
1829 pragma Assert (not Done (Unit_Num));
1831 -- Everything we depend upon should already be done
1833 pragma Debug
1834 (Assert_Withed_Units_Done (CU, Include_Limited => False));
1835 end;
1837 else
1838 -- Must be Standard, which has no entry in the units table
1840 pragma Assert (Item = Stand.Standard_Package_Node);
1842 if Debug_Unit_Walk then
1843 Write_Line ("Standard");
1844 end if;
1845 end if;
1847 Action (Item);
1848 end Do_Action;
1850 --------------------
1851 -- Do_Withed_Unit --
1852 --------------------
1854 procedure Do_Withed_Unit (Withed_Unit : Node_Id) is
1855 begin
1856 Do_Unit_And_Dependents (Withed_Unit, Unit (Withed_Unit));
1858 -- If the unit in the with_clause is a generic instance, the clause
1859 -- now denotes the instance body. Traverse the corresponding spec
1860 -- because there may be no other dependence that will force the
1861 -- traversal of its own context.
1863 if Nkind (Unit (Withed_Unit)) = N_Package_Body
1864 and then Is_Generic_Instance
1865 (Defining_Entity (Unit (Library_Unit (Withed_Unit))))
1866 then
1867 Do_Withed_Unit (Library_Unit (Withed_Unit));
1868 end if;
1869 end Do_Withed_Unit;
1871 ----------------------------
1872 -- Do_Unit_And_Dependents --
1873 ----------------------------
1875 procedure Do_Unit_And_Dependents (CU : Node_Id; Item : Node_Id) is
1876 Unit_Num : constant Unit_Number_Type := Get_Cunit_Unit_Number (CU);
1877 Child : Node_Id;
1878 Body_U : Unit_Number_Type;
1879 Parent_CU : Node_Id;
1881 procedure Do_Withed_Units is new Walk_Withs (Do_Withed_Unit);
1883 begin
1884 if not Seen (Unit_Num) then
1886 -- Process the with clauses
1888 Do_Withed_Units (CU, Include_Limited => False);
1890 -- Process the unit if it is a spec or the main unit, if it
1891 -- has no previous spec or we have done all other units.
1893 if not Nkind_In (Item, N_Package_Body, N_Subprogram_Body)
1894 or else Acts_As_Spec (CU)
1895 then
1896 if CU = Cunit (Main_Unit)
1897 and then not Do_Main
1898 then
1899 Seen (Unit_Num) := False;
1901 else
1902 Seen (Unit_Num) := True;
1904 if CU = Library_Unit (Main_CU) then
1905 Process_Bodies_In_Context (CU);
1907 -- If main is a child unit, examine parent unit contexts
1908 -- to see if they include instantiated units. Also, if
1909 -- the parent itself is an instance, process its body
1910 -- because it may contain subprograms that are called
1911 -- in the main unit.
1913 if Is_Child_Unit (Cunit_Entity (Main_Unit)) then
1914 Child := Cunit_Entity (Main_Unit);
1915 while Is_Child_Unit (Child) loop
1916 Parent_CU :=
1917 Cunit
1918 (Get_Cunit_Entity_Unit_Number (Scope (Child)));
1919 Process_Bodies_In_Context (Parent_CU);
1921 if Nkind (Unit (Parent_CU)) = N_Package_Body
1922 and then
1923 Nkind (Original_Node (Unit (Parent_CU)))
1924 = N_Package_Instantiation
1925 and then
1926 not Seen (Get_Cunit_Unit_Number (Parent_CU))
1927 then
1928 Body_U := Get_Cunit_Unit_Number (Parent_CU);
1929 Seen (Body_U) := True;
1930 Do_Action (Parent_CU, Unit (Parent_CU));
1931 Done (Body_U) := True;
1932 end if;
1934 Child := Scope (Child);
1935 end loop;
1936 end if;
1937 end if;
1939 Do_Action (CU, Item);
1940 Done (Unit_Num) := True;
1941 end if;
1942 end if;
1943 end if;
1944 end Do_Unit_And_Dependents;
1946 -------------------------------
1947 -- Process_Bodies_In_Context --
1948 -------------------------------
1950 procedure Process_Bodies_In_Context (Comp : Node_Id) is
1951 Body_CU : Node_Id;
1952 Body_U : Unit_Number_Type;
1953 Clause : Node_Id;
1954 Spec : Node_Id;
1956 procedure Do_Withed_Units is new Walk_Withs (Do_Withed_Unit);
1958 -- Start of processing for Process_Bodies_In_Context
1960 begin
1961 Clause := First (Context_Items (Comp));
1962 while Present (Clause) loop
1963 if Nkind (Clause) = N_With_Clause then
1964 Spec := Library_Unit (Clause);
1965 Body_CU := Library_Unit (Spec);
1967 -- If we are processing the spec of the main unit, load bodies
1968 -- only if the with_clause indicates that it forced the loading
1969 -- of the body for a generic instantiation. Note that bodies of
1970 -- parents that are instances have been loaded already.
1972 if Present (Body_CU)
1973 and then Body_CU /= Cunit (Main_Unit)
1974 and then Nkind (Unit (Body_CU)) /= N_Subprogram_Body
1975 and then (Nkind (Unit (Comp)) /= N_Package_Declaration
1976 or else Present (Withed_Body (Clause)))
1977 then
1978 Body_U := Get_Cunit_Unit_Number (Body_CU);
1980 if not Seen (Body_U)
1981 and then not Depends_On_Main (Body_CU)
1982 then
1983 Seen (Body_U) := True;
1984 Do_Withed_Units (Body_CU, Include_Limited => False);
1985 Do_Action (Body_CU, Unit (Body_CU));
1986 Done (Body_U) := True;
1987 end if;
1988 end if;
1989 end if;
1991 Next (Clause);
1992 end loop;
1993 end Process_Bodies_In_Context;
1995 -- Local Declarations
1997 Cur : Elmt_Id;
1999 -- Start of processing for Walk_Library_Items
2001 begin
2002 if Debug_Unit_Walk then
2003 Write_Line ("Walk_Library_Items:");
2004 Indent;
2005 end if;
2007 -- Do Standard first, then walk the Comp_Unit_List
2009 Do_Action (Empty, Standard_Package_Node);
2011 -- First place the context of all instance bodies on the corresponding
2012 -- spec, because it may be needed to analyze the code at the place of
2013 -- the instantiation.
2015 Cur := First_Elmt (Comp_Unit_List);
2016 while Present (Cur) loop
2017 declare
2018 CU : constant Node_Id := Node (Cur);
2019 N : constant Node_Id := Unit (CU);
2021 begin
2022 if Nkind (N) = N_Package_Body
2023 and then Is_Generic_Instance (Defining_Entity (N))
2024 then
2025 Append_List
2026 (Context_Items (CU), Context_Items (Library_Unit (CU)));
2027 end if;
2029 Next_Elmt (Cur);
2030 end;
2031 end loop;
2033 -- Now traverse compilation units (specs) in order
2035 Cur := First_Elmt (Comp_Unit_List);
2036 while Present (Cur) loop
2037 declare
2038 CU : constant Node_Id := Node (Cur);
2039 N : constant Node_Id := Unit (CU);
2040 Par : Entity_Id;
2042 begin
2043 pragma Assert (Nkind (CU) = N_Compilation_Unit);
2045 case Nkind (N) is
2047 -- If it is a subprogram body, process it if it has no
2048 -- separate spec.
2050 -- If it's a package body, ignore it, unless it is a body
2051 -- created for an instance that is the main unit. In the case
2052 -- of subprograms, the body is the wrapper package. In case of
2053 -- a package, the original file carries the body, and the spec
2054 -- appears as a later entry in the units list.
2056 -- Otherwise bodies appear in the list only because of inlining
2057 -- or instantiations, and they are processed only if relevant.
2058 -- The flag Withed_Body on a context clause indicates that a
2059 -- unit contains an instantiation that may be needed later,
2060 -- and therefore the body that contains the generic body (and
2061 -- its context) must be traversed immediately after the
2062 -- corresponding spec (see Do_Unit_And_Dependents).
2064 -- The main unit itself is processed separately after all other
2065 -- specs, and relevant bodies are examined in Process_Main.
2067 when N_Subprogram_Body =>
2068 if Acts_As_Spec (N) then
2069 Do_Unit_And_Dependents (CU, N);
2070 end if;
2072 when N_Package_Body =>
2073 if CU = Main_CU
2074 and then Nkind (Original_Node (Unit (Main_CU))) in
2075 N_Generic_Instantiation
2076 and then Present (Library_Unit (Main_CU))
2077 then
2078 Do_Unit_And_Dependents
2079 (Library_Unit (Main_CU),
2080 Unit (Library_Unit (Main_CU)));
2081 end if;
2083 -- It is a spec, process it, and the units it depends on,
2084 -- unless it is a descendant of the main unit. This can happen
2085 -- when the body of a parent depends on some other descendant.
2087 when N_Null_Statement =>
2089 -- Ignore an ignored ghost unit
2091 pragma Assert (Is_Ignored_Ghost_Node (Original_Node (N)));
2092 null;
2094 when others =>
2095 Par := Scope (Defining_Entity (Unit (CU)));
2097 if Is_Child_Unit (Defining_Entity (Unit (CU))) then
2098 while Present (Par)
2099 and then Par /= Standard_Standard
2100 and then Par /= Cunit_Entity (Main_Unit)
2101 loop
2102 Par := Scope (Par);
2103 end loop;
2104 end if;
2106 if Par /= Cunit_Entity (Main_Unit) then
2107 Do_Unit_And_Dependents (CU, N);
2108 end if;
2109 end case;
2110 end;
2112 Next_Elmt (Cur);
2113 end loop;
2115 -- Now process package bodies on which main depends, followed by bodies
2116 -- of parents, if present, and finally main itself.
2118 if not Done (Main_Unit) then
2119 Do_Main := True;
2121 Process_Main : declare
2122 Parent_CU : Node_Id;
2123 Body_CU : Node_Id;
2124 Body_U : Unit_Number_Type;
2125 Child : Entity_Id;
2127 function Is_Subunit_Of_Main (U : Node_Id) return Boolean;
2128 -- If the main unit has subunits, their context may include
2129 -- bodies that are needed in the body of main. We must examine
2130 -- the context of the subunits, which are otherwise not made
2131 -- explicit in the main unit.
2133 ------------------------
2134 -- Is_Subunit_Of_Main --
2135 ------------------------
2137 function Is_Subunit_Of_Main (U : Node_Id) return Boolean is
2138 Lib : Node_Id;
2139 begin
2140 if No (U) then
2141 return False;
2142 else
2143 Lib := Library_Unit (U);
2144 return Nkind (Unit (U)) = N_Subunit
2145 and then
2146 (Lib = Cunit (Main_Unit)
2147 or else Is_Subunit_Of_Main (Lib));
2148 end if;
2149 end Is_Subunit_Of_Main;
2151 -- Start of processing for Process_Main
2153 begin
2154 Process_Bodies_In_Context (Main_CU);
2156 for Unit_Num in Done'Range loop
2157 if Is_Subunit_Of_Main (Cunit (Unit_Num)) then
2158 Process_Bodies_In_Context (Cunit (Unit_Num));
2159 end if;
2160 end loop;
2162 -- If the main unit is a child unit, parent bodies may be present
2163 -- because they export instances or inlined subprograms. Check for
2164 -- presence of these, which are not present in context clauses.
2165 -- Note that if the parents are instances, their bodies have been
2166 -- processed before the main spec, because they may be needed
2167 -- therein, so the following loop only affects non-instances.
2169 if Is_Child_Unit (Cunit_Entity (Main_Unit)) then
2170 Child := Cunit_Entity (Main_Unit);
2171 while Is_Child_Unit (Child) loop
2172 Parent_CU :=
2173 Cunit (Get_Cunit_Entity_Unit_Number (Scope (Child)));
2174 Body_CU := Library_Unit (Parent_CU);
2176 if Present (Body_CU)
2177 and then not Seen (Get_Cunit_Unit_Number (Body_CU))
2178 and then not Depends_On_Main (Body_CU)
2179 then
2180 Body_U := Get_Cunit_Unit_Number (Body_CU);
2181 Seen (Body_U) := True;
2182 Do_Action (Body_CU, Unit (Body_CU));
2183 Done (Body_U) := True;
2184 end if;
2186 Child := Scope (Child);
2187 end loop;
2188 end if;
2190 Do_Action (Main_CU, Unit (Main_CU));
2191 Done (Main_Unit) := True;
2192 end Process_Main;
2193 end if;
2195 if Debug_Unit_Walk then
2196 if Done /= (Done'Range => True) then
2197 Write_Eol;
2198 Write_Line ("Ignored units:");
2200 Indent;
2202 for Unit_Num in Done'Range loop
2203 if not Done (Unit_Num) then
2204 Write_Unit_Info
2205 (Unit_Num, Unit (Cunit (Unit_Num)), Withs => True);
2206 end if;
2207 end loop;
2209 Outdent;
2210 end if;
2211 end if;
2213 pragma Assert (Done (Main_Unit));
2215 if Debug_Unit_Walk then
2216 Outdent;
2217 Write_Line ("end Walk_Library_Items.");
2218 end if;
2219 end Walk_Library_Items;
2221 ----------------
2222 -- Walk_Withs --
2223 ----------------
2225 procedure Walk_Withs (CU : Node_Id; Include_Limited : Boolean) is
2226 pragma Assert (Nkind (CU) = N_Compilation_Unit);
2227 pragma Assert (Nkind (Unit (CU)) /= N_Subunit);
2229 procedure Walk_Immediate is new Walk_Withs_Immediate (Action);
2231 begin
2232 -- First walk the withs immediately on the library item
2234 Walk_Immediate (CU, Include_Limited);
2236 -- For a body, we must also check for any subunits which belong to it
2237 -- and which have context clauses of their own, since these with'ed
2238 -- units are part of its own dependencies.
2240 if Nkind (Unit (CU)) in N_Unit_Body then
2241 for S in Main_Unit .. Last_Unit loop
2243 -- We are only interested in subunits. For preproc. data and def.
2244 -- files, Cunit is Empty, so we need to test that first.
2246 if Cunit (S) /= Empty
2247 and then Nkind (Unit (Cunit (S))) = N_Subunit
2248 then
2249 declare
2250 Pnode : Node_Id;
2252 begin
2253 Pnode := Library_Unit (Cunit (S));
2255 -- In -gnatc mode, the errors in the subunits will not have
2256 -- been recorded, but the analysis of the subunit may have
2257 -- failed, so just quit.
2259 if No (Pnode) then
2260 exit;
2261 end if;
2263 -- Find ultimate parent of the subunit
2265 while Nkind (Unit (Pnode)) = N_Subunit loop
2266 Pnode := Library_Unit (Pnode);
2267 end loop;
2269 -- See if it belongs to current unit, and if so, include its
2270 -- with_clauses. Do not process main unit prematurely.
2272 if Pnode = CU and then CU /= Cunit (Main_Unit) then
2273 Walk_Immediate (Cunit (S), Include_Limited);
2274 end if;
2275 end;
2276 end if;
2277 end loop;
2278 end if;
2279 end Walk_Withs;
2281 --------------------------
2282 -- Walk_Withs_Immediate --
2283 --------------------------
2285 procedure Walk_Withs_Immediate (CU : Node_Id; Include_Limited : Boolean) is
2286 pragma Assert (Nkind (CU) = N_Compilation_Unit);
2288 Context_Item : Node_Id;
2289 Lib_Unit : Node_Id;
2290 Body_CU : Node_Id;
2292 begin
2293 Context_Item := First (Context_Items (CU));
2294 while Present (Context_Item) loop
2295 if Nkind (Context_Item) = N_With_Clause
2296 and then (Include_Limited
2297 or else not Limited_Present (Context_Item))
2298 then
2299 Lib_Unit := Library_Unit (Context_Item);
2300 Action (Lib_Unit);
2302 -- If the context item indicates that a package body is needed
2303 -- because of an instantiation in CU, traverse the body now, even
2304 -- if CU is not related to the main unit. If the generic itself
2305 -- appears in a package body, the context item is this body, and
2306 -- it already appears in the traversal order, so we only need to
2307 -- examine the case of a context item being a package declaration.
2309 if Present (Withed_Body (Context_Item))
2310 and then Nkind (Unit (Lib_Unit)) = N_Package_Declaration
2311 and then Present (Corresponding_Body (Unit (Lib_Unit)))
2312 then
2313 Body_CU :=
2314 Parent
2315 (Unit_Declaration_Node
2316 (Corresponding_Body (Unit (Lib_Unit))));
2318 -- A body may have an implicit with on its own spec, in which
2319 -- case we must ignore this context item to prevent looping.
2321 if Unit (CU) /= Unit (Body_CU) then
2322 Action (Body_CU);
2323 end if;
2324 end if;
2325 end if;
2327 Context_Item := Next (Context_Item);
2328 end loop;
2329 end Walk_Withs_Immediate;
2331 end Sem;