PR rtl-optimization/82913
[official-gcc.git] / gcc / ada / sem.adb
blob02c8fa244edf8a7609c1b392f4c5d45bd25a7598
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 a marker is ignored because the node does not
616 -- have any static and run-time semantics.
618 when N_Call_Marker
619 | N_Variable_Reference_Marker
621 null;
623 -- A call to analyze the Empty node is an error, but most likely it
624 -- is an error caused by an attempt to analyze a malformed piece of
625 -- tree caused by some other error, so if there have been any other
626 -- errors, we just ignore it, otherwise it is a real internal error
627 -- which we complain about.
629 -- We must also consider the case of call to a runtime function that
630 -- is not available in the configurable runtime.
632 when N_Empty =>
633 pragma Assert (Serious_Errors_Detected /= 0
634 or else Configurable_Run_Time_Violations /= 0);
635 null;
637 -- A call to analyze the error node is simply ignored, to avoid
638 -- causing cascaded errors (happens of course only in error cases)
639 -- Disable expansion in case it is still enabled, to prevent other
640 -- subsequent compiler glitches.
642 when N_Error =>
643 Expander_Mode_Save_And_Set (False);
644 null;
646 -- Push/Pop nodes normally don't come through an analyze call. An
647 -- exception is the dummy ones bracketing a subprogram body. In any
648 -- case there is nothing to be done to analyze such nodes.
650 when N_Push_Pop_xxx_Label =>
651 null;
653 -- SCIL nodes don't need analysis because they are decorated when
654 -- they are built. They are added to the tree by Insert_Actions and
655 -- the call to analyze them is generated when the full list is
656 -- analyzed.
658 when N_SCIL_Dispatch_Table_Tag_Init
659 | N_SCIL_Dispatching_Call
660 | N_SCIL_Membership_Test
662 null;
664 -- A quantified expression with a missing "all" or "some" qualifier
665 -- looks identical to an iterated component association. By language
666 -- definition, the latter must be present within array aggregates. If
667 -- this is not the case, then the iterated component association is
668 -- really an illegal quantified expression. Diagnose this scenario.
670 when N_Iterated_Component_Association =>
671 Diagnose_Iterated_Component_Association (N);
673 -- For the remaining node types, we generate compiler abort, because
674 -- these nodes are always analyzed within the Sem_Chn routines and
675 -- there should never be a case of making a call to the main Analyze
676 -- routine for these node kinds. For example, an N_Access_Definition
677 -- node appears only in the context of a type declaration, and is
678 -- processed by the analyze routine for type declarations.
680 when N_Abortable_Part
681 | N_Access_Definition
682 | N_Access_Function_Definition
683 | N_Access_Procedure_Definition
684 | N_Access_To_Object_Definition
685 | N_Aspect_Specification
686 | N_Case_Expression_Alternative
687 | N_Case_Statement_Alternative
688 | N_Compilation_Unit_Aux
689 | N_Component_Association
690 | N_Component_Clause
691 | N_Component_Definition
692 | N_Component_List
693 | N_Constrained_Array_Definition
694 | N_Contract
695 | N_Decimal_Fixed_Point_Definition
696 | N_Defining_Character_Literal
697 | N_Defining_Identifier
698 | N_Defining_Operator_Symbol
699 | N_Defining_Program_Unit_Name
700 | N_Delta_Constraint
701 | N_Derived_Type_Definition
702 | N_Designator
703 | N_Digits_Constraint
704 | N_Discriminant_Association
705 | N_Discriminant_Specification
706 | N_Elsif_Part
707 | N_Entry_Call_Statement
708 | N_Enumeration_Type_Definition
709 | N_Exception_Handler
710 | N_Floating_Point_Definition
711 | N_Formal_Decimal_Fixed_Point_Definition
712 | N_Formal_Derived_Type_Definition
713 | N_Formal_Discrete_Type_Definition
714 | N_Formal_Floating_Point_Definition
715 | N_Formal_Modular_Type_Definition
716 | N_Formal_Ordinary_Fixed_Point_Definition
717 | N_Formal_Private_Type_Definition
718 | N_Formal_Incomplete_Type_Definition
719 | N_Formal_Signed_Integer_Type_Definition
720 | N_Function_Specification
721 | N_Generic_Association
722 | N_Index_Or_Discriminant_Constraint
723 | N_Iteration_Scheme
724 | N_Mod_Clause
725 | N_Modular_Type_Definition
726 | N_Ordinary_Fixed_Point_Definition
727 | N_Parameter_Specification
728 | N_Pragma_Argument_Association
729 | N_Procedure_Specification
730 | N_Real_Range_Specification
731 | N_Record_Definition
732 | N_Signed_Integer_Type_Definition
733 | N_Unconstrained_Array_Definition
734 | N_Unused_At_End
735 | N_Unused_At_Start
736 | N_Variant
738 raise Program_Error;
739 end case;
741 Debug_A_Exit ("analyzing ", N, " (done)");
743 -- Mark relevant use-type and use-package clauses as effective using the
744 -- original node, because constant folding may have occurred and removed
745 -- references that need to be examined. If the node in question is
746 -- overloaded then this is deferred until resolution.
748 if Nkind (Original_Node (N)) in N_Op
749 and then Present (Entity (Original_Node (N)))
750 and then not Is_Overloaded (Original_Node (N))
751 then
752 Mark_Use_Clauses (Original_Node (N));
753 end if;
755 -- Now that we have analyzed the node, we call the expander to perform
756 -- possible expansion. We skip this for subexpressions, because we don't
757 -- have the type yet, and the expander will need to know the type before
758 -- it can do its job. For subexpression nodes, the call to the expander
759 -- happens in Sem_Res.Resolve. A special exception is Raise_xxx_Error,
760 -- which can appear in a statement context, and needs expanding now in
761 -- the case (distinguished by Etype, as documented in Sinfo).
763 -- The Analyzed flag is also set at this point for non-subexpression
764 -- nodes (in the case of subexpression nodes, we can't set the flag yet,
765 -- since resolution and expansion have not yet been completed). Note
766 -- that for N_Raise_xxx_Error we have to distinguish the expression
767 -- case from the statement case.
769 if Nkind (N) not in N_Subexpr
770 or else (Nkind (N) in N_Raise_xxx_Error
771 and then Etype (N) = Standard_Void_Type)
772 then
773 Expand (N);
775 -- Replace a reference to a renaming with the renamed object for SPARK.
776 -- In general this modification is performed by Expand_SPARK, however
777 -- certain constructs may not reach the resolution or expansion phase
778 -- and thus remain unchanged. The replacement is not performed when the
779 -- construct is overloaded as resolution must first take place. This is
780 -- also not done when analyzing a generic to preserve the original tree
781 -- and because the reference may become overloaded in the instance.
783 elsif GNATprove_Mode
784 and then Nkind_In (N, N_Expanded_Name, N_Identifier)
785 and then not Is_Overloaded (N)
786 and then not Inside_A_Generic
787 then
788 Expand_SPARK_Potential_Renaming (N);
789 end if;
791 Restore_Ghost_Mode (Saved_GM);
792 end Analyze;
794 -- Version with check(s) suppressed
796 procedure Analyze (N : Node_Id; Suppress : Check_Id) is
797 begin
798 if Suppress = All_Checks then
799 declare
800 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
801 begin
802 Scope_Suppress.Suppress := (others => True);
803 Analyze (N);
804 Scope_Suppress.Suppress := Svs;
805 end;
807 elsif Suppress = Overflow_Check then
808 declare
809 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
810 begin
811 Scope_Suppress.Suppress (Suppress) := True;
812 Analyze (N);
813 Scope_Suppress.Suppress (Suppress) := Svg;
814 end;
815 end if;
816 end Analyze;
818 ------------------
819 -- Analyze_List --
820 ------------------
822 procedure Analyze_List (L : List_Id) is
823 Node : Node_Id;
825 begin
826 Node := First (L);
827 while Present (Node) loop
828 Analyze (Node);
829 Next (Node);
830 end loop;
831 end Analyze_List;
833 -- Version with check(s) suppressed
835 procedure Analyze_List (L : List_Id; Suppress : Check_Id) is
836 begin
837 if Suppress = All_Checks then
838 declare
839 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
840 begin
841 Scope_Suppress.Suppress := (others => True);
842 Analyze_List (L);
843 Scope_Suppress.Suppress := Svs;
844 end;
846 else
847 declare
848 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
849 begin
850 Scope_Suppress.Suppress (Suppress) := True;
851 Analyze_List (L);
852 Scope_Suppress.Suppress (Suppress) := Svg;
853 end;
854 end if;
855 end Analyze_List;
857 --------------------------
858 -- Copy_Suppress_Status --
859 --------------------------
861 procedure Copy_Suppress_Status
862 (C : Check_Id;
863 From : Entity_Id;
864 To : Entity_Id)
866 Found : Boolean;
867 pragma Warnings (Off, Found);
869 procedure Search_Stack
870 (Top : Suppress_Stack_Entry_Ptr;
871 Found : out Boolean);
872 -- Search given suppress stack for matching entry for entity. If found
873 -- then set Checks_May_Be_Suppressed on To, and push an appropriate
874 -- entry for To onto the local suppress stack.
876 ------------------
877 -- Search_Stack --
878 ------------------
880 procedure Search_Stack
881 (Top : Suppress_Stack_Entry_Ptr;
882 Found : out Boolean)
884 Ptr : Suppress_Stack_Entry_Ptr;
886 begin
887 Ptr := Top;
888 while Ptr /= null loop
889 if Ptr.Entity = From
890 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
891 then
892 if Ptr.Suppress then
893 Set_Checks_May_Be_Suppressed (To, True);
894 Push_Local_Suppress_Stack_Entry
895 (Entity => To,
896 Check => C,
897 Suppress => True);
898 Found := True;
899 return;
900 end if;
901 end if;
903 Ptr := Ptr.Prev;
904 end loop;
906 Found := False;
907 return;
908 end Search_Stack;
910 -- Start of processing for Copy_Suppress_Status
912 begin
913 if not Checks_May_Be_Suppressed (From) then
914 return;
915 end if;
917 -- First search the global entity suppress table for a matching entry.
918 -- We also search this in reverse order so that if there are multiple
919 -- pragmas for the same entity, the last one applies.
921 Search_Stack (Global_Suppress_Stack_Top, Found);
923 if Found then
924 return;
925 end if;
927 -- Now search the local entity suppress stack, we search this in
928 -- reverse order so that we get the innermost entry that applies to
929 -- this case if there are nested entries. Note that for the purpose
930 -- of this procedure we are ONLY looking for entries corresponding
931 -- to a two-argument Suppress, where the second argument matches From.
933 Search_Stack (Local_Suppress_Stack_Top, Found);
934 end Copy_Suppress_Status;
936 -------------------------
937 -- Enter_Generic_Scope --
938 -------------------------
940 procedure Enter_Generic_Scope (S : Entity_Id) is
941 begin
942 if No (Outer_Generic_Scope) then
943 Outer_Generic_Scope := S;
944 end if;
945 end Enter_Generic_Scope;
947 ------------------------
948 -- Exit_Generic_Scope --
949 ------------------------
951 procedure Exit_Generic_Scope (S : Entity_Id) is
952 begin
953 if S = Outer_Generic_Scope then
954 Outer_Generic_Scope := Empty;
955 end if;
956 end Exit_Generic_Scope;
958 -----------------------
959 -- Explicit_Suppress --
960 -----------------------
962 function Explicit_Suppress (E : Entity_Id; C : Check_Id) return Boolean is
963 Ptr : Suppress_Stack_Entry_Ptr;
965 begin
966 if not Checks_May_Be_Suppressed (E) then
967 return False;
969 else
970 Ptr := Global_Suppress_Stack_Top;
971 while Ptr /= null loop
972 if Ptr.Entity = E
973 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
974 then
975 return Ptr.Suppress;
976 end if;
978 Ptr := Ptr.Prev;
979 end loop;
980 end if;
982 return False;
983 end Explicit_Suppress;
985 -----------------------------
986 -- External_Ref_In_Generic --
987 -----------------------------
989 function External_Ref_In_Generic (E : Entity_Id) return Boolean is
990 Scop : Entity_Id;
992 begin
993 -- Entity is global if defined outside of current outer_generic_scope:
994 -- Either the entity has a smaller depth that the outer generic, or it
995 -- is in a different compilation unit, or it is defined within a unit
996 -- in the same compilation, that is not within the outer_generic.
998 if No (Outer_Generic_Scope) then
999 return False;
1001 elsif Scope_Depth (Scope (E)) < Scope_Depth (Outer_Generic_Scope)
1002 or else not In_Same_Source_Unit (E, Outer_Generic_Scope)
1003 then
1004 return True;
1006 else
1007 Scop := Scope (E);
1008 while Present (Scop) loop
1009 if Scop = Outer_Generic_Scope then
1010 return False;
1011 elsif Scope_Depth (Scop) < Scope_Depth (Outer_Generic_Scope) then
1012 return True;
1013 else
1014 Scop := Scope (Scop);
1015 end if;
1016 end loop;
1018 return True;
1019 end if;
1020 end External_Ref_In_Generic;
1022 ----------------
1023 -- Initialize --
1024 ----------------
1026 procedure Initialize is
1027 Next : Suppress_Stack_Entry_Ptr;
1029 procedure Free is new Unchecked_Deallocation
1030 (Suppress_Stack_Entry, Suppress_Stack_Entry_Ptr);
1032 begin
1033 -- Free any global suppress stack entries from a previous invocation
1034 -- of the compiler (in the normal case this loop does nothing).
1036 while Suppress_Stack_Entries /= null loop
1037 Next := Suppress_Stack_Entries.Next;
1038 Free (Suppress_Stack_Entries);
1039 Suppress_Stack_Entries := Next;
1040 end loop;
1042 Local_Suppress_Stack_Top := null;
1043 Global_Suppress_Stack_Top := null;
1045 -- Clear scope stack, and reset global variables
1047 Scope_Stack.Init;
1048 Unloaded_Subunits := False;
1049 end Initialize;
1051 ------------------------------
1052 -- Insert_After_And_Analyze --
1053 ------------------------------
1055 procedure Insert_After_And_Analyze (N : Node_Id; M : Node_Id) is
1056 Node : Node_Id;
1058 begin
1059 if Present (M) then
1061 -- If we are not at the end of the list, then the easiest
1062 -- coding is simply to insert before our successor.
1064 if Present (Next (N)) then
1065 Insert_Before_And_Analyze (Next (N), M);
1067 -- Case of inserting at the end of the list
1069 else
1070 -- Capture the Node_Id of the node to be inserted. This Node_Id
1071 -- will still be the same after the insert operation.
1073 Node := M;
1074 Insert_After (N, M);
1076 -- Now just analyze from the inserted node to the end of
1077 -- the new list (note that this properly handles the case
1078 -- where any of the analyze calls result in the insertion of
1079 -- nodes after the analyzed node, expecting analysis).
1081 while Present (Node) loop
1082 Analyze (Node);
1083 Mark_Rewrite_Insertion (Node);
1084 Next (Node);
1085 end loop;
1086 end if;
1087 end if;
1088 end Insert_After_And_Analyze;
1090 -- Version with check(s) suppressed
1092 procedure Insert_After_And_Analyze
1093 (N : Node_Id;
1094 M : Node_Id;
1095 Suppress : Check_Id)
1097 begin
1098 if Suppress = All_Checks then
1099 declare
1100 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
1101 begin
1102 Scope_Suppress.Suppress := (others => True);
1103 Insert_After_And_Analyze (N, M);
1104 Scope_Suppress.Suppress := Svs;
1105 end;
1107 else
1108 declare
1109 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
1110 begin
1111 Scope_Suppress.Suppress (Suppress) := True;
1112 Insert_After_And_Analyze (N, M);
1113 Scope_Suppress.Suppress (Suppress) := Svg;
1114 end;
1115 end if;
1116 end Insert_After_And_Analyze;
1118 -------------------------------
1119 -- Insert_Before_And_Analyze --
1120 -------------------------------
1122 procedure Insert_Before_And_Analyze (N : Node_Id; M : Node_Id) is
1123 Node : Node_Id;
1125 begin
1126 if Present (M) then
1128 -- Capture the Node_Id of the first list node to be inserted.
1129 -- This will still be the first node after the insert operation,
1130 -- since Insert_List_After does not modify the Node_Id values.
1132 Node := M;
1133 Insert_Before (N, M);
1135 -- The insertion does not change the Id's of any of the nodes in
1136 -- the list, and they are still linked, so we can simply loop from
1137 -- the original first node until we meet the node before which the
1138 -- insertion is occurring. Note that this properly handles the case
1139 -- where any of the analyzed nodes insert nodes after themselves,
1140 -- expecting them to get analyzed.
1142 while Node /= N loop
1143 Analyze (Node);
1144 Mark_Rewrite_Insertion (Node);
1145 Next (Node);
1146 end loop;
1147 end if;
1148 end Insert_Before_And_Analyze;
1150 -- Version with check(s) suppressed
1152 procedure Insert_Before_And_Analyze
1153 (N : Node_Id;
1154 M : Node_Id;
1155 Suppress : Check_Id)
1157 begin
1158 if Suppress = All_Checks then
1159 declare
1160 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
1161 begin
1162 Scope_Suppress.Suppress := (others => True);
1163 Insert_Before_And_Analyze (N, M);
1164 Scope_Suppress.Suppress := Svs;
1165 end;
1167 else
1168 declare
1169 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
1170 begin
1171 Scope_Suppress.Suppress (Suppress) := True;
1172 Insert_Before_And_Analyze (N, M);
1173 Scope_Suppress.Suppress (Suppress) := Svg;
1174 end;
1175 end if;
1176 end Insert_Before_And_Analyze;
1178 -----------------------------------
1179 -- Insert_List_After_And_Analyze --
1180 -----------------------------------
1182 procedure Insert_List_After_And_Analyze (N : Node_Id; L : List_Id) is
1183 After : constant Node_Id := Next (N);
1184 Node : Node_Id;
1186 begin
1187 if Is_Non_Empty_List (L) then
1189 -- Capture the Node_Id of the first list node to be inserted.
1190 -- This will still be the first node after the insert operation,
1191 -- since Insert_List_After does not modify the Node_Id values.
1193 Node := First (L);
1194 Insert_List_After (N, L);
1196 -- Now just analyze from the original first node until we get to the
1197 -- successor of the original insertion point (which may be Empty if
1198 -- the insertion point was at the end of the list). Note that this
1199 -- properly handles the case where any of the analyze calls result in
1200 -- the insertion of nodes after the analyzed node (possibly calling
1201 -- this routine recursively).
1203 while Node /= After loop
1204 Analyze (Node);
1205 Mark_Rewrite_Insertion (Node);
1206 Next (Node);
1207 end loop;
1208 end if;
1209 end Insert_List_After_And_Analyze;
1211 ------------------------------------
1212 -- Insert_List_Before_And_Analyze --
1213 ------------------------------------
1215 procedure Insert_List_Before_And_Analyze (N : Node_Id; L : List_Id) is
1216 Node : Node_Id;
1218 begin
1219 if Is_Non_Empty_List (L) then
1221 -- Capture the Node_Id of the first list node to be inserted. This
1222 -- will still be the first node after the insert operation, since
1223 -- Insert_List_After does not modify the Node_Id values.
1225 Node := First (L);
1226 Insert_List_Before (N, L);
1228 -- The insertion does not change the Id's of any of the nodes in
1229 -- the list, and they are still linked, so we can simply loop from
1230 -- the original first node until we meet the node before which the
1231 -- insertion is occurring. Note that this properly handles the case
1232 -- where any of the analyzed nodes insert nodes after themselves,
1233 -- expecting them to get analyzed.
1235 while Node /= N loop
1236 Analyze (Node);
1237 Mark_Rewrite_Insertion (Node);
1238 Next (Node);
1239 end loop;
1240 end if;
1241 end Insert_List_Before_And_Analyze;
1243 ----------
1244 -- Lock --
1245 ----------
1247 procedure Lock is
1248 begin
1249 Scope_Stack.Release;
1250 Scope_Stack.Locked := True;
1251 end Lock;
1253 ------------------------
1254 -- Preanalysis_Active --
1255 ------------------------
1257 function Preanalysis_Active return Boolean is
1258 begin
1259 return not Full_Analysis and not Expander_Active;
1260 end Preanalysis_Active;
1262 ----------------
1263 -- Preanalyze --
1264 ----------------
1266 procedure Preanalyze (N : Node_Id) is
1267 Save_Full_Analysis : constant Boolean := Full_Analysis;
1269 begin
1270 Full_Analysis := False;
1271 Expander_Mode_Save_And_Set (False);
1273 Analyze (N);
1275 Expander_Mode_Restore;
1276 Full_Analysis := Save_Full_Analysis;
1277 end Preanalyze;
1279 --------------------------------------
1280 -- Push_Global_Suppress_Stack_Entry --
1281 --------------------------------------
1283 procedure Push_Global_Suppress_Stack_Entry
1284 (Entity : Entity_Id;
1285 Check : Check_Id;
1286 Suppress : Boolean)
1288 begin
1289 Global_Suppress_Stack_Top :=
1290 new Suppress_Stack_Entry'
1291 (Entity => Entity,
1292 Check => Check,
1293 Suppress => Suppress,
1294 Prev => Global_Suppress_Stack_Top,
1295 Next => Suppress_Stack_Entries);
1296 Suppress_Stack_Entries := Global_Suppress_Stack_Top;
1297 return;
1298 end Push_Global_Suppress_Stack_Entry;
1300 -------------------------------------
1301 -- Push_Local_Suppress_Stack_Entry --
1302 -------------------------------------
1304 procedure Push_Local_Suppress_Stack_Entry
1305 (Entity : Entity_Id;
1306 Check : Check_Id;
1307 Suppress : Boolean)
1309 begin
1310 Local_Suppress_Stack_Top :=
1311 new Suppress_Stack_Entry'
1312 (Entity => Entity,
1313 Check => Check,
1314 Suppress => Suppress,
1315 Prev => Local_Suppress_Stack_Top,
1316 Next => Suppress_Stack_Entries);
1317 Suppress_Stack_Entries := Local_Suppress_Stack_Top;
1319 return;
1320 end Push_Local_Suppress_Stack_Entry;
1322 ---------------
1323 -- Semantics --
1324 ---------------
1326 procedure Semantics (Comp_Unit : Node_Id) is
1327 procedure Do_Analyze;
1328 -- Perform the analysis of the compilation unit
1330 ----------------
1331 -- Do_Analyze --
1332 ----------------
1334 -- WARNING: This routine manages Ghost regions. Return statements must
1335 -- be replaced by gotos which jump to the end of the routine and restore
1336 -- the Ghost mode.
1338 procedure Do_Analyze is
1339 Save_Ghost_Mode : constant Ghost_Mode_Type := Ghost_Mode;
1341 -- Generally style checks are preserved across compilations, with
1342 -- one exception: s-oscons.ads, which allows arbitrary long lines
1343 -- unconditionally, and has no restore mechanism, because it is
1344 -- intended as a lowest-level Pure package.
1346 Save_Max_Line : constant Int := Style_Max_Line_Length;
1348 List : Elist_Id;
1350 begin
1351 List := Save_Scope_Stack;
1352 Push_Scope (Standard_Standard);
1354 -- Set up a clean environment before analyzing
1356 Install_Ghost_Mode (None);
1357 Outer_Generic_Scope := Empty;
1358 Scope_Suppress := Suppress_Options;
1359 Scope_Stack.Table
1360 (Scope_Stack.Last).Component_Alignment_Default :=
1361 Configuration_Component_Alignment;
1362 Scope_Stack.Table
1363 (Scope_Stack.Last).Is_Active_Stack_Base := True;
1365 -- Now analyze the top level compilation unit node
1367 Analyze (Comp_Unit);
1369 -- Check for scope mismatch on exit from compilation
1371 pragma Assert (Current_Scope = Standard_Standard
1372 or else Comp_Unit = Cunit (Main_Unit));
1374 -- Then pop entry for Standard, and pop implicit types
1376 Pop_Scope;
1377 Restore_Scope_Stack (List);
1378 Restore_Ghost_Mode (Save_Ghost_Mode);
1379 Style_Max_Line_Length := Save_Max_Line;
1380 end Do_Analyze;
1382 -- Local variables
1384 -- The following locations save the corresponding global flags and
1385 -- variables so that they can be restored on completion. This is needed
1386 -- so that calls to Rtsfind start with the proper default values for
1387 -- these variables, and also that such calls do not disturb the settings
1388 -- for units being analyzed at a higher level.
1390 S_Current_Sem_Unit : constant Unit_Number_Type := Current_Sem_Unit;
1391 S_Full_Analysis : constant Boolean := Full_Analysis;
1392 S_GNAT_Mode : constant Boolean := GNAT_Mode;
1393 S_Global_Dis_Names : constant Boolean := Global_Discard_Names;
1394 S_In_Assertion_Expr : constant Nat := In_Assertion_Expr;
1395 S_In_Default_Expr : constant Boolean := In_Default_Expr;
1396 S_In_Spec_Expr : constant Boolean := In_Spec_Expression;
1397 S_Inside_A_Generic : constant Boolean := Inside_A_Generic;
1398 S_Outer_Gen_Scope : constant Entity_Id := Outer_Generic_Scope;
1399 S_Style_Check : constant Boolean := Style_Check;
1401 Already_Analyzed : constant Boolean := Analyzed (Comp_Unit);
1403 Curunit : constant Unit_Number_Type := Get_Cunit_Unit_Number (Comp_Unit);
1404 -- New value of Current_Sem_Unit
1406 Generic_Main : constant Boolean :=
1407 Nkind (Unit (Cunit (Main_Unit))) in N_Generic_Declaration;
1408 -- If the main unit is generic, every compiled unit, including its
1409 -- context, is compiled with expansion disabled.
1411 Is_Main_Unit_Or_Main_Unit_Spec : constant Boolean :=
1412 Curunit = Main_Unit
1413 or else
1414 (Nkind (Unit (Cunit (Main_Unit))) = N_Package_Body
1415 and then Library_Unit (Cunit (Main_Unit)) = Cunit (Curunit));
1416 -- Configuration flags have special settings when compiling a predefined
1417 -- file as a main unit. This applies to its spec as well.
1419 Ext_Main_Source_Unit : constant Boolean :=
1420 In_Extended_Main_Source_Unit (Comp_Unit);
1421 -- Determine if unit is in extended main source unit
1423 Save_Config_Switches : Config_Switches_Type;
1424 -- Variable used to save values of config switches while we analyze the
1425 -- new unit, to be restored on exit for proper recursive behavior.
1427 Save_Cunit_Restrictions : Save_Cunit_Boolean_Restrictions;
1428 -- Used to save non-partition wide restrictions before processing new
1429 -- unit. All with'ed units are analyzed with config restrictions reset
1430 -- and we need to restore these saved values at the end.
1432 -- Start of processing for Semantics
1434 begin
1435 if Debug_Unit_Walk then
1436 if Already_Analyzed then
1437 Write_Str ("(done)");
1438 end if;
1440 Write_Unit_Info
1441 (Get_Cunit_Unit_Number (Comp_Unit),
1442 Unit (Comp_Unit),
1443 Prefix => "--> ");
1444 Indent;
1445 end if;
1447 Compiler_State := Analyzing;
1448 Current_Sem_Unit := Curunit;
1450 -- Compile predefined units with GNAT_Mode set to True, to properly
1451 -- process the categorization stuff. However, do not set GNAT_Mode
1452 -- to True for the renamings units (Text_IO, IO_Exceptions, Direct_IO,
1453 -- Sequential_IO) as this would prevent pragma Extend_System from being
1454 -- taken into account, for example when Text_IO is renaming DEC.Text_IO.
1456 if Is_Predefined_Unit (Current_Sem_Unit)
1457 and then not Is_Predefined_Renaming (Current_Sem_Unit)
1458 then
1459 GNAT_Mode := True;
1460 end if;
1462 -- For generic main, never do expansion
1464 if Generic_Main then
1465 Expander_Mode_Save_And_Set (False);
1467 -- Non generic case
1469 else
1470 Expander_Mode_Save_And_Set
1472 -- Turn on expansion if generating code
1474 (Operating_Mode = Generate_Code
1476 -- Or if special debug flag -gnatdx is set
1478 or else Debug_Flag_X
1480 -- Or if in configuration run-time mode. We do this so we get
1481 -- error messages about missing entities in the run-time even
1482 -- if we are compiling in -gnatc (no code generation) mode.
1483 -- Similar processing applies to No_Run_Time_Mode. However,
1484 -- don't do this if debug flag -gnatd.Z is set or when we are
1485 -- compiling a separate unit (this is to handle a situation
1486 -- where this new processing causes trouble).
1488 or else
1489 ((Configurable_Run_Time_Mode or No_Run_Time_Mode)
1490 and then not Debug_Flag_Dot_ZZ
1491 and then Nkind (Unit (Cunit (Main_Unit))) /= N_Subunit));
1492 end if;
1494 Full_Analysis := True;
1495 Inside_A_Generic := False;
1496 In_Assertion_Expr := 0;
1497 In_Default_Expr := False;
1498 In_Spec_Expression := False;
1499 Set_Comes_From_Source_Default (False);
1501 -- Save current config switches and reset then appropriately
1503 Save_Opt_Config_Switches (Save_Config_Switches);
1504 Set_Opt_Config_Switches
1505 (Is_Internal_Unit (Current_Sem_Unit),
1506 Is_Main_Unit_Or_Main_Unit_Spec);
1508 -- Save current non-partition-wide restrictions
1510 Save_Cunit_Restrictions := Cunit_Boolean_Restrictions_Save;
1512 -- For unit in main extended unit, we reset the configuration values
1513 -- for the non-partition-wide restrictions. For other units reset them.
1515 if Ext_Main_Source_Unit then
1516 Restore_Config_Cunit_Boolean_Restrictions;
1517 else
1518 Reset_Cunit_Boolean_Restrictions;
1519 end if;
1521 -- Turn off style checks for unit that is not in the extended main
1522 -- source unit. This improves processing efficiency for such units
1523 -- (for which we don't want style checks anyway, and where they will
1524 -- get suppressed), and is definitely needed to stop some style checks
1525 -- from invading the run-time units (e.g. overriding checks).
1527 if not Ext_Main_Source_Unit then
1528 Style_Check := False;
1530 -- If this is part of the extended main source unit, set style check
1531 -- mode to match the style check mode of the main source unit itself.
1533 else
1534 Style_Check := Style_Check_Main;
1535 end if;
1537 -- Only do analysis of unit that has not already been analyzed
1539 if not Analyzed (Comp_Unit) then
1540 Initialize_Version (Current_Sem_Unit);
1542 -- Do analysis, and then append the compilation unit onto the
1543 -- Comp_Unit_List, if appropriate. This is done after analysis,
1544 -- so if this unit depends on some others, they have already been
1545 -- appended. We ignore bodies, except for the main unit itself, and
1546 -- for subprogram bodies that act as specs. We have also to guard
1547 -- against ill-formed subunits that have an improper context.
1549 Do_Analyze;
1551 if Present (Comp_Unit)
1552 and then Nkind (Unit (Comp_Unit)) in N_Proper_Body
1553 and then (Nkind (Unit (Comp_Unit)) /= N_Subprogram_Body
1554 or else not Acts_As_Spec (Comp_Unit))
1555 and then not In_Extended_Main_Source_Unit (Comp_Unit)
1556 then
1557 null;
1559 else
1560 Append_New_Elmt (Comp_Unit, To => Comp_Unit_List);
1562 if Debug_Unit_Walk then
1563 Write_Str ("Appending ");
1564 Write_Unit_Info
1565 (Get_Cunit_Unit_Number (Comp_Unit), Unit (Comp_Unit));
1566 end if;
1567 end if;
1568 end if;
1570 -- Save indication of dynamic elaboration checks for ALI file
1572 Set_Dynamic_Elab (Current_Sem_Unit, Dynamic_Elaboration_Checks);
1574 -- Restore settings of saved switches to entry values
1576 Current_Sem_Unit := S_Current_Sem_Unit;
1577 Full_Analysis := S_Full_Analysis;
1578 Global_Discard_Names := S_Global_Dis_Names;
1579 GNAT_Mode := S_GNAT_Mode;
1580 In_Assertion_Expr := S_In_Assertion_Expr;
1581 In_Default_Expr := S_In_Default_Expr;
1582 In_Spec_Expression := S_In_Spec_Expr;
1583 Inside_A_Generic := S_Inside_A_Generic;
1584 Outer_Generic_Scope := S_Outer_Gen_Scope;
1585 Style_Check := S_Style_Check;
1587 Restore_Opt_Config_Switches (Save_Config_Switches);
1589 -- Deal with restore of restrictions
1591 Cunit_Boolean_Restrictions_Restore (Save_Cunit_Restrictions);
1593 Expander_Mode_Restore;
1595 if Debug_Unit_Walk then
1596 Outdent;
1598 if Already_Analyzed then
1599 Write_Str ("(done)");
1600 end if;
1602 Write_Unit_Info
1603 (Get_Cunit_Unit_Number (Comp_Unit),
1604 Unit (Comp_Unit),
1605 Prefix => "<-- ");
1606 end if;
1607 end Semantics;
1609 --------
1610 -- ss --
1611 --------
1613 function ss (Index : Int) return Scope_Stack_Entry is
1614 begin
1615 return Scope_Stack.Table (Index);
1616 end ss;
1618 ---------
1619 -- sst --
1620 ---------
1622 function sst return Scope_Stack_Entry is
1623 begin
1624 return ss (Scope_Stack.Last);
1625 end sst;
1627 ------------
1628 -- Unlock --
1629 ------------
1631 procedure Unlock is
1632 begin
1633 Scope_Stack.Locked := False;
1634 end Unlock;
1636 ------------------------
1637 -- Walk_Library_Items --
1638 ------------------------
1640 procedure Walk_Library_Items is
1641 type Unit_Number_Set is array (Main_Unit .. Last_Unit) of Boolean;
1642 pragma Pack (Unit_Number_Set);
1644 Main_CU : constant Node_Id := Cunit (Main_Unit);
1646 Seen, Done : Unit_Number_Set := (others => False);
1647 -- Seen (X) is True after we have seen unit X in the walk. This is used
1648 -- to prevent processing the same unit more than once. Done (X) is True
1649 -- after we have fully processed X, and is used only for debugging
1650 -- printouts and assertions.
1652 Do_Main : Boolean := False;
1653 -- Flag to delay processing the main body until after all other units.
1654 -- This is needed because the spec of the main unit may appear in the
1655 -- context of some other unit. We do not want this to force processing
1656 -- of the main body before all other units have been processed.
1658 -- Another circularity pattern occurs when the main unit is a child unit
1659 -- and the body of an ancestor has a with-clause of the main unit or on
1660 -- one of its children. In both cases the body in question has a with-
1661 -- clause on the main unit, and must be excluded from the traversal. In
1662 -- some convoluted cases this may lead to a CodePeer error because the
1663 -- spec of a subprogram declared in an instance within the parent will
1664 -- not be seen in the main unit.
1666 function Depends_On_Main (CU : Node_Id) return Boolean;
1667 -- The body of a unit that is withed by the spec of the main unit may in
1668 -- turn have a with_clause on that spec. In that case do not traverse
1669 -- the body, to prevent loops. It can also happen that the main body has
1670 -- a with_clause on a child, which of course has an implicit with on its
1671 -- parent. It's OK to traverse the child body if the main spec has been
1672 -- processed, otherwise we also have a circularity to avoid.
1674 procedure Do_Action (CU : Node_Id; Item : Node_Id);
1675 -- Calls Action, with some validity checks
1677 procedure Do_Unit_And_Dependents (CU : Node_Id; Item : Node_Id);
1678 -- Calls Do_Action, first on the units with'ed by this one, then on
1679 -- this unit. If it's an instance body, do the spec first. If it is
1680 -- an instance spec, do the body last.
1682 procedure Do_Withed_Unit (Withed_Unit : Node_Id);
1683 -- Apply Do_Unit_And_Dependents to a unit in a context clause
1685 procedure Process_Bodies_In_Context (Comp : Node_Id);
1686 -- The main unit and its spec may depend on bodies that contain generics
1687 -- that are instantiated in them. Iterate through the corresponding
1688 -- contexts before processing main (spec/body) itself, to process bodies
1689 -- that may be present, together with their context. The spec of main
1690 -- is processed wherever it appears in the list of units, while the body
1691 -- is processed as the last unit in the list.
1693 ---------------------
1694 -- Depends_On_Main --
1695 ---------------------
1697 function Depends_On_Main (CU : Node_Id) return Boolean is
1698 CL : Node_Id;
1699 MCU : constant Node_Id := Unit (Main_CU);
1701 begin
1702 CL := First (Context_Items (CU));
1704 -- Problem does not arise with main subprograms
1707 not Nkind_In (MCU, N_Package_Body, N_Package_Declaration)
1708 then
1709 return False;
1710 end if;
1712 while Present (CL) loop
1713 if Nkind (CL) = N_With_Clause
1714 and then Library_Unit (CL) = Main_CU
1715 and then not Done (Get_Cunit_Unit_Number (Library_Unit (CL)))
1716 then
1717 return True;
1718 end if;
1720 Next (CL);
1721 end loop;
1723 return False;
1724 end Depends_On_Main;
1726 ---------------
1727 -- Do_Action --
1728 ---------------
1730 procedure Do_Action (CU : Node_Id; Item : Node_Id) is
1731 begin
1732 -- This calls Action at the end. All the preceding code is just
1733 -- assertions and debugging output.
1735 pragma Assert (No (CU) or else Nkind (CU) = N_Compilation_Unit);
1737 case Nkind (Item) is
1738 when N_Generic_Function_Renaming_Declaration
1739 | N_Generic_Package_Declaration
1740 | N_Generic_Package_Renaming_Declaration
1741 | N_Generic_Procedure_Renaming_Declaration
1742 | N_Generic_Subprogram_Declaration
1743 | N_Package_Declaration
1744 | N_Package_Renaming_Declaration
1745 | N_Subprogram_Declaration
1746 | N_Subprogram_Renaming_Declaration
1748 -- Specs are OK
1750 null;
1752 when N_Package_Body =>
1754 -- Package bodies are processed separately if the main unit
1755 -- depends on them.
1757 null;
1759 when N_Subprogram_Body =>
1761 -- A subprogram body must be the main unit
1763 pragma Assert (Acts_As_Spec (CU)
1764 or else CU = Cunit (Main_Unit));
1765 null;
1767 when N_Function_Instantiation
1768 | N_Package_Instantiation
1769 | N_Procedure_Instantiation
1771 -- Can only happen if some generic body (needed for gnat2scil
1772 -- traversal, but not by GNAT) is not available, ignore.
1774 null;
1776 -- All other cases cannot happen
1778 when N_Subunit =>
1779 pragma Assert (False, "subunit");
1780 null;
1782 when N_Null_Statement =>
1784 -- Do not call Action for an ignored ghost unit
1786 pragma Assert (Is_Ignored_Ghost_Node (Original_Node (Item)));
1787 return;
1789 when others =>
1790 pragma Assert (False);
1791 null;
1792 end case;
1794 if Present (CU) then
1795 pragma Assert (Item /= Stand.Standard_Package_Node);
1796 pragma Assert (Item = Unit (CU));
1798 declare
1799 Unit_Num : constant Unit_Number_Type :=
1800 Get_Cunit_Unit_Number (CU);
1802 procedure Assert_Done (Withed_Unit : Node_Id);
1803 -- Assert Withed_Unit is already Done, unless it's a body. It
1804 -- might seem strange for a with_clause to refer to a body, but
1805 -- this happens in the case of a generic instantiation, which
1806 -- gets transformed into the instance body (and the instance
1807 -- spec is also created). With clauses pointing to the
1808 -- instantiation end up pointing to the instance body.
1810 -----------------
1811 -- Assert_Done --
1812 -----------------
1814 procedure Assert_Done (Withed_Unit : Node_Id) is
1815 begin
1816 if not Done (Get_Cunit_Unit_Number (Withed_Unit)) then
1817 if not Nkind_In
1818 (Unit (Withed_Unit),
1819 N_Generic_Package_Declaration,
1820 N_Package_Body,
1821 N_Package_Renaming_Declaration,
1822 N_Subprogram_Body)
1823 then
1824 Write_Unit_Name
1825 (Unit_Name (Get_Cunit_Unit_Number (Withed_Unit)));
1826 Write_Str (" not yet walked!");
1828 if Get_Cunit_Unit_Number (Withed_Unit) = Unit_Num then
1829 Write_Str (" (self-ref)");
1830 end if;
1832 Write_Eol;
1834 pragma Assert (False);
1835 end if;
1836 end if;
1837 end Assert_Done;
1839 procedure Assert_Withed_Units_Done is
1840 new Walk_Withs (Assert_Done);
1842 begin
1843 if Debug_Unit_Walk then
1844 Write_Unit_Info (Unit_Num, Item, Withs => True);
1845 end if;
1847 -- Main unit should come last, except in the case where we
1848 -- skipped System_Aux_Id, in which case we missed the things it
1849 -- depends on, and in the case of parent bodies if present.
1851 pragma Assert
1852 (not Done (Main_Unit)
1853 or else Present (System_Aux_Id)
1854 or else Nkind (Item) = N_Package_Body);
1856 -- We shouldn't do the same thing twice
1858 pragma Assert (not Done (Unit_Num));
1860 -- Everything we depend upon should already be done
1862 pragma Debug
1863 (Assert_Withed_Units_Done (CU, Include_Limited => False));
1864 end;
1866 else
1867 -- Must be Standard, which has no entry in the units table
1869 pragma Assert (Item = Stand.Standard_Package_Node);
1871 if Debug_Unit_Walk then
1872 Write_Line ("Standard");
1873 end if;
1874 end if;
1876 Action (Item);
1877 end Do_Action;
1879 --------------------
1880 -- Do_Withed_Unit --
1881 --------------------
1883 procedure Do_Withed_Unit (Withed_Unit : Node_Id) is
1884 begin
1885 Do_Unit_And_Dependents (Withed_Unit, Unit (Withed_Unit));
1887 -- If the unit in the with_clause is a generic instance, the clause
1888 -- now denotes the instance body. Traverse the corresponding spec
1889 -- because there may be no other dependence that will force the
1890 -- traversal of its own context.
1892 if Nkind (Unit (Withed_Unit)) = N_Package_Body
1893 and then Is_Generic_Instance
1894 (Defining_Entity (Unit (Library_Unit (Withed_Unit))))
1895 then
1896 Do_Withed_Unit (Library_Unit (Withed_Unit));
1897 end if;
1898 end Do_Withed_Unit;
1900 ----------------------------
1901 -- Do_Unit_And_Dependents --
1902 ----------------------------
1904 procedure Do_Unit_And_Dependents (CU : Node_Id; Item : Node_Id) is
1905 Unit_Num : constant Unit_Number_Type := Get_Cunit_Unit_Number (CU);
1906 Child : Node_Id;
1907 Body_U : Unit_Number_Type;
1908 Parent_CU : Node_Id;
1910 procedure Do_Withed_Units is new Walk_Withs (Do_Withed_Unit);
1912 begin
1913 if not Seen (Unit_Num) then
1915 -- Process the with clauses
1917 Do_Withed_Units (CU, Include_Limited => False);
1919 -- Process the unit if it is a spec or the main unit, if it
1920 -- has no previous spec or we have done all other units.
1922 if not Nkind_In (Item, N_Package_Body, N_Subprogram_Body)
1923 or else Acts_As_Spec (CU)
1924 then
1925 if CU = Cunit (Main_Unit)
1926 and then not Do_Main
1927 then
1928 Seen (Unit_Num) := False;
1930 else
1931 Seen (Unit_Num) := True;
1933 if CU = Library_Unit (Main_CU) then
1934 Process_Bodies_In_Context (CU);
1936 -- If main is a child unit, examine parent unit contexts
1937 -- to see if they include instantiated units. Also, if
1938 -- the parent itself is an instance, process its body
1939 -- because it may contain subprograms that are called
1940 -- in the main unit.
1942 if Is_Child_Unit (Cunit_Entity (Main_Unit)) then
1943 Child := Cunit_Entity (Main_Unit);
1944 while Is_Child_Unit (Child) loop
1945 Parent_CU :=
1946 Cunit
1947 (Get_Cunit_Entity_Unit_Number (Scope (Child)));
1948 Process_Bodies_In_Context (Parent_CU);
1950 if Nkind (Unit (Parent_CU)) = N_Package_Body
1951 and then
1952 Nkind (Original_Node (Unit (Parent_CU)))
1953 = N_Package_Instantiation
1954 and then
1955 not Seen (Get_Cunit_Unit_Number (Parent_CU))
1956 then
1957 Body_U := Get_Cunit_Unit_Number (Parent_CU);
1958 Seen (Body_U) := True;
1959 Do_Action (Parent_CU, Unit (Parent_CU));
1960 Done (Body_U) := True;
1961 end if;
1963 Child := Scope (Child);
1964 end loop;
1965 end if;
1966 end if;
1968 Do_Action (CU, Item);
1969 Done (Unit_Num) := True;
1970 end if;
1971 end if;
1972 end if;
1973 end Do_Unit_And_Dependents;
1975 -------------------------------
1976 -- Process_Bodies_In_Context --
1977 -------------------------------
1979 procedure Process_Bodies_In_Context (Comp : Node_Id) is
1980 Body_CU : Node_Id;
1981 Body_U : Unit_Number_Type;
1982 Clause : Node_Id;
1983 Spec : Node_Id;
1985 procedure Do_Withed_Units is new Walk_Withs (Do_Withed_Unit);
1987 -- Start of processing for Process_Bodies_In_Context
1989 begin
1990 Clause := First (Context_Items (Comp));
1991 while Present (Clause) loop
1992 if Nkind (Clause) = N_With_Clause then
1993 Spec := Library_Unit (Clause);
1994 Body_CU := Library_Unit (Spec);
1996 -- If we are processing the spec of the main unit, load bodies
1997 -- only if the with_clause indicates that it forced the loading
1998 -- of the body for a generic instantiation. Note that bodies of
1999 -- parents that are instances have been loaded already.
2001 if Present (Body_CU)
2002 and then Body_CU /= Cunit (Main_Unit)
2003 and then Nkind (Unit (Body_CU)) /= N_Subprogram_Body
2004 and then (Nkind (Unit (Comp)) /= N_Package_Declaration
2005 or else Present (Withed_Body (Clause)))
2006 then
2007 Body_U := Get_Cunit_Unit_Number (Body_CU);
2009 if not Seen (Body_U)
2010 and then not Depends_On_Main (Body_CU)
2011 then
2012 Seen (Body_U) := True;
2013 Do_Withed_Units (Body_CU, Include_Limited => False);
2014 Do_Action (Body_CU, Unit (Body_CU));
2015 Done (Body_U) := True;
2016 end if;
2017 end if;
2018 end if;
2020 Next (Clause);
2021 end loop;
2022 end Process_Bodies_In_Context;
2024 -- Local Declarations
2026 Cur : Elmt_Id;
2028 -- Start of processing for Walk_Library_Items
2030 begin
2031 if Debug_Unit_Walk then
2032 Write_Line ("Walk_Library_Items:");
2033 Indent;
2034 end if;
2036 -- Do Standard first, then walk the Comp_Unit_List
2038 Do_Action (Empty, Standard_Package_Node);
2040 -- First place the context of all instance bodies on the corresponding
2041 -- spec, because it may be needed to analyze the code at the place of
2042 -- the instantiation.
2044 Cur := First_Elmt (Comp_Unit_List);
2045 while Present (Cur) loop
2046 declare
2047 CU : constant Node_Id := Node (Cur);
2048 N : constant Node_Id := Unit (CU);
2050 begin
2051 if Nkind (N) = N_Package_Body
2052 and then Is_Generic_Instance (Defining_Entity (N))
2053 then
2054 Append_List
2055 (Context_Items (CU), Context_Items (Library_Unit (CU)));
2056 end if;
2058 Next_Elmt (Cur);
2059 end;
2060 end loop;
2062 -- Now traverse compilation units (specs) in order
2064 Cur := First_Elmt (Comp_Unit_List);
2065 while Present (Cur) loop
2066 declare
2067 CU : constant Node_Id := Node (Cur);
2068 N : constant Node_Id := Unit (CU);
2069 Par : Entity_Id;
2071 begin
2072 pragma Assert (Nkind (CU) = N_Compilation_Unit);
2074 case Nkind (N) is
2076 -- If it is a subprogram body, process it if it has no
2077 -- separate spec.
2079 -- If it's a package body, ignore it, unless it is a body
2080 -- created for an instance that is the main unit. In the case
2081 -- of subprograms, the body is the wrapper package. In case of
2082 -- a package, the original file carries the body, and the spec
2083 -- appears as a later entry in the units list.
2085 -- Otherwise bodies appear in the list only because of inlining
2086 -- or instantiations, and they are processed only if relevant.
2087 -- The flag Withed_Body on a context clause indicates that a
2088 -- unit contains an instantiation that may be needed later,
2089 -- and therefore the body that contains the generic body (and
2090 -- its context) must be traversed immediately after the
2091 -- corresponding spec (see Do_Unit_And_Dependents).
2093 -- The main unit itself is processed separately after all other
2094 -- specs, and relevant bodies are examined in Process_Main.
2096 when N_Subprogram_Body =>
2097 if Acts_As_Spec (N) then
2098 Do_Unit_And_Dependents (CU, N);
2099 end if;
2101 when N_Package_Body =>
2102 if CU = Main_CU
2103 and then Nkind (Original_Node (Unit (Main_CU))) in
2104 N_Generic_Instantiation
2105 and then Present (Library_Unit (Main_CU))
2106 then
2107 Do_Unit_And_Dependents
2108 (Library_Unit (Main_CU),
2109 Unit (Library_Unit (Main_CU)));
2110 end if;
2112 -- It is a spec, process it, and the units it depends on,
2113 -- unless it is a descendant of the main unit. This can happen
2114 -- when the body of a parent depends on some other descendant.
2116 when N_Null_Statement =>
2118 -- Ignore an ignored ghost unit
2120 pragma Assert (Is_Ignored_Ghost_Node (Original_Node (N)));
2121 null;
2123 when others =>
2124 Par := Scope (Defining_Entity (Unit (CU)));
2126 if Is_Child_Unit (Defining_Entity (Unit (CU))) then
2127 while Present (Par)
2128 and then Par /= Standard_Standard
2129 and then Par /= Cunit_Entity (Main_Unit)
2130 loop
2131 Par := Scope (Par);
2132 end loop;
2133 end if;
2135 if Par /= Cunit_Entity (Main_Unit) then
2136 Do_Unit_And_Dependents (CU, N);
2137 end if;
2138 end case;
2139 end;
2141 Next_Elmt (Cur);
2142 end loop;
2144 -- Now process package bodies on which main depends, followed by bodies
2145 -- of parents, if present, and finally main itself.
2147 if not Done (Main_Unit) then
2148 Do_Main := True;
2150 Process_Main : declare
2151 Parent_CU : Node_Id;
2152 Body_CU : Node_Id;
2153 Body_U : Unit_Number_Type;
2154 Child : Entity_Id;
2156 function Is_Subunit_Of_Main (U : Node_Id) return Boolean;
2157 -- If the main unit has subunits, their context may include
2158 -- bodies that are needed in the body of main. We must examine
2159 -- the context of the subunits, which are otherwise not made
2160 -- explicit in the main unit.
2162 ------------------------
2163 -- Is_Subunit_Of_Main --
2164 ------------------------
2166 function Is_Subunit_Of_Main (U : Node_Id) return Boolean is
2167 Lib : Node_Id;
2168 begin
2169 if No (U) then
2170 return False;
2171 else
2172 Lib := Library_Unit (U);
2173 return Nkind (Unit (U)) = N_Subunit
2174 and then
2175 (Lib = Cunit (Main_Unit)
2176 or else Is_Subunit_Of_Main (Lib));
2177 end if;
2178 end Is_Subunit_Of_Main;
2180 -- Start of processing for Process_Main
2182 begin
2183 Process_Bodies_In_Context (Main_CU);
2185 for Unit_Num in Done'Range loop
2186 if Is_Subunit_Of_Main (Cunit (Unit_Num)) then
2187 Process_Bodies_In_Context (Cunit (Unit_Num));
2188 end if;
2189 end loop;
2191 -- If the main unit is a child unit, parent bodies may be present
2192 -- because they export instances or inlined subprograms. Check for
2193 -- presence of these, which are not present in context clauses.
2194 -- Note that if the parents are instances, their bodies have been
2195 -- processed before the main spec, because they may be needed
2196 -- therein, so the following loop only affects non-instances.
2198 if Is_Child_Unit (Cunit_Entity (Main_Unit)) then
2199 Child := Cunit_Entity (Main_Unit);
2200 while Is_Child_Unit (Child) loop
2201 Parent_CU :=
2202 Cunit (Get_Cunit_Entity_Unit_Number (Scope (Child)));
2203 Body_CU := Library_Unit (Parent_CU);
2205 if Present (Body_CU)
2206 and then not Seen (Get_Cunit_Unit_Number (Body_CU))
2207 and then not Depends_On_Main (Body_CU)
2208 then
2209 Body_U := Get_Cunit_Unit_Number (Body_CU);
2210 Seen (Body_U) := True;
2211 Do_Action (Body_CU, Unit (Body_CU));
2212 Done (Body_U) := True;
2213 end if;
2215 Child := Scope (Child);
2216 end loop;
2217 end if;
2219 Do_Action (Main_CU, Unit (Main_CU));
2220 Done (Main_Unit) := True;
2221 end Process_Main;
2222 end if;
2224 if Debug_Unit_Walk then
2225 if Done /= (Done'Range => True) then
2226 Write_Eol;
2227 Write_Line ("Ignored units:");
2229 Indent;
2231 for Unit_Num in Done'Range loop
2232 if not Done (Unit_Num) then
2233 Write_Unit_Info
2234 (Unit_Num, Unit (Cunit (Unit_Num)), Withs => True);
2235 end if;
2236 end loop;
2238 Outdent;
2239 end if;
2240 end if;
2242 pragma Assert (Done (Main_Unit));
2244 if Debug_Unit_Walk then
2245 Outdent;
2246 Write_Line ("end Walk_Library_Items.");
2247 end if;
2248 end Walk_Library_Items;
2250 ----------------
2251 -- Walk_Withs --
2252 ----------------
2254 procedure Walk_Withs (CU : Node_Id; Include_Limited : Boolean) is
2255 pragma Assert (Nkind (CU) = N_Compilation_Unit);
2256 pragma Assert (Nkind (Unit (CU)) /= N_Subunit);
2258 procedure Walk_Immediate is new Walk_Withs_Immediate (Action);
2260 begin
2261 -- First walk the withs immediately on the library item
2263 Walk_Immediate (CU, Include_Limited);
2265 -- For a body, we must also check for any subunits which belong to it
2266 -- and which have context clauses of their own, since these with'ed
2267 -- units are part of its own dependencies.
2269 if Nkind (Unit (CU)) in N_Unit_Body then
2270 for S in Main_Unit .. Last_Unit loop
2272 -- We are only interested in subunits. For preproc. data and def.
2273 -- files, Cunit is Empty, so we need to test that first.
2275 if Cunit (S) /= Empty
2276 and then Nkind (Unit (Cunit (S))) = N_Subunit
2277 then
2278 declare
2279 Pnode : Node_Id;
2281 begin
2282 Pnode := Library_Unit (Cunit (S));
2284 -- In -gnatc mode, the errors in the subunits will not have
2285 -- been recorded, but the analysis of the subunit may have
2286 -- failed, so just quit.
2288 if No (Pnode) then
2289 exit;
2290 end if;
2292 -- Find ultimate parent of the subunit
2294 while Nkind (Unit (Pnode)) = N_Subunit loop
2295 Pnode := Library_Unit (Pnode);
2296 end loop;
2298 -- See if it belongs to current unit, and if so, include its
2299 -- with_clauses. Do not process main unit prematurely.
2301 if Pnode = CU and then CU /= Cunit (Main_Unit) then
2302 Walk_Immediate (Cunit (S), Include_Limited);
2303 end if;
2304 end;
2305 end if;
2306 end loop;
2307 end if;
2308 end Walk_Withs;
2310 --------------------------
2311 -- Walk_Withs_Immediate --
2312 --------------------------
2314 procedure Walk_Withs_Immediate (CU : Node_Id; Include_Limited : Boolean) is
2315 pragma Assert (Nkind (CU) = N_Compilation_Unit);
2317 Context_Item : Node_Id;
2318 Lib_Unit : Node_Id;
2319 Body_CU : Node_Id;
2321 begin
2322 Context_Item := First (Context_Items (CU));
2323 while Present (Context_Item) loop
2324 if Nkind (Context_Item) = N_With_Clause
2325 and then (Include_Limited
2326 or else not Limited_Present (Context_Item))
2327 then
2328 Lib_Unit := Library_Unit (Context_Item);
2329 Action (Lib_Unit);
2331 -- If the context item indicates that a package body is needed
2332 -- because of an instantiation in CU, traverse the body now, even
2333 -- if CU is not related to the main unit. If the generic itself
2334 -- appears in a package body, the context item is this body, and
2335 -- it already appears in the traversal order, so we only need to
2336 -- examine the case of a context item being a package declaration.
2338 if Present (Withed_Body (Context_Item))
2339 and then Nkind (Unit (Lib_Unit)) = N_Package_Declaration
2340 and then Present (Corresponding_Body (Unit (Lib_Unit)))
2341 then
2342 Body_CU :=
2343 Parent
2344 (Unit_Declaration_Node
2345 (Corresponding_Body (Unit (Lib_Unit))));
2347 -- A body may have an implicit with on its own spec, in which
2348 -- case we must ignore this context item to prevent looping.
2350 if Unit (CU) /= Unit (Body_CU) then
2351 Action (Body_CU);
2352 end if;
2353 end if;
2354 end if;
2356 Context_Item := Next (Context_Item);
2357 end loop;
2358 end Walk_Withs_Immediate;
2360 end Sem;