Fix typo in t-dimode
[official-gcc.git] / gcc / ada / sem.adb
blobee5c7cfe3f95883896bc146559393e81514324b1
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT COMPILER COMPONENTS --
4 -- --
5 -- S E M --
6 -- --
7 -- B o d y --
8 -- --
9 -- Copyright (C) 1992-2021, 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 Einfo; use Einfo;
30 with Einfo.Entities; use Einfo.Entities;
31 with Einfo.Utils; use Einfo.Utils;
32 with Elists; use Elists;
33 with Exp_SPARK; use Exp_SPARK;
34 with Expander; use Expander;
35 with Ghost; use Ghost;
36 with Lib; use Lib;
37 with Lib.Load; use Lib.Load;
38 with Nlists; use Nlists;
39 with Output; use Output;
40 with Restrict; use Restrict;
41 with Sem_Attr; use Sem_Attr;
42 with Sem_Ch2; use Sem_Ch2;
43 with Sem_Ch3; use Sem_Ch3;
44 with Sem_Ch4; use Sem_Ch4;
45 with Sem_Ch5; use Sem_Ch5;
46 with Sem_Ch6; use Sem_Ch6;
47 with Sem_Ch7; use Sem_Ch7;
48 with Sem_Ch8; use Sem_Ch8;
49 with Sem_Ch9; use Sem_Ch9;
50 with Sem_Ch10; use Sem_Ch10;
51 with Sem_Ch11; use Sem_Ch11;
52 with Sem_Ch12; use Sem_Ch12;
53 with Sem_Ch13; use Sem_Ch13;
54 with Sem_Prag; use Sem_Prag;
55 with Sem_Util; use Sem_Util;
56 with Sinfo; use Sinfo;
57 with Sinfo.Nodes; use Sinfo.Nodes;
58 with Sinfo.Utils; use Sinfo.Utils;
59 with Stand; use Stand;
60 with Stylesw; use Stylesw;
61 with Uintp; use Uintp;
62 with Uname; use Uname;
64 with Unchecked_Deallocation;
66 pragma Warnings (Off, Sem_Util);
67 -- Suppress warnings of unused with for Sem_Util (used only in asserts)
69 package body Sem is
71 Debug_Unit_Walk : Boolean renames Debug_Flag_Dot_WW;
72 -- Controls debugging printouts for Walk_Library_Items
74 Outer_Generic_Scope : Entity_Id := Empty;
75 -- Global reference to the outer scope that is generic. In a non-generic
76 -- context, it is empty. At the moment, it is only used for avoiding
77 -- freezing of external references in generics.
79 Comp_Unit_List : Elist_Id := No_Elist;
80 -- Used by Walk_Library_Items. This is a list of N_Compilation_Unit nodes
81 -- processed by Semantics, in an appropriate order. Initialized to
82 -- No_Elist, because it's too early to call New_Elmt_List; we will set it
83 -- to New_Elmt_List on first use.
85 generic
86 with procedure Action (Withed_Unit : Node_Id);
87 procedure Walk_Withs_Immediate (CU : Node_Id; Include_Limited : Boolean);
88 -- Walk all the with clauses of CU, and call Action for the with'ed unit.
89 -- Ignore limited withs, unless Include_Limited is True. CU must be an
90 -- N_Compilation_Unit.
92 generic
93 with procedure Action (Withed_Unit : Node_Id);
94 procedure Walk_Withs (CU : Node_Id; Include_Limited : Boolean);
95 -- Same as Walk_Withs_Immediate, but also include with clauses on subunits
96 -- of this unit, since they count as dependences on their parent library
97 -- item. CU must be an N_Compilation_Unit whose Unit is not an N_Subunit.
99 -------------
100 -- Analyze --
101 -------------
103 -- WARNING: This routine manages Ghost regions. Return statements must be
104 -- replaced by gotos which jump to the end of the routine and restore the
105 -- Ghost mode.
107 procedure Analyze (N : Node_Id) is
108 Saved_GM : constant Ghost_Mode_Type := Ghost_Mode;
109 Saved_IGR : constant Node_Id := Ignored_Ghost_Region;
110 -- Save the Ghost-related attributes to restore on exit
112 begin
113 Debug_A_Entry ("analyzing ", N);
115 -- Immediate return if already analyzed
117 if Analyzed (N) then
118 Debug_A_Exit ("analyzing ", N, " (done, analyzed already)");
119 return;
120 end if;
122 -- A declaration may be subject to pragma Ghost. Set the mode now to
123 -- ensure that any nodes generated during analysis and expansion are
124 -- marked as Ghost.
126 if Is_Declaration (N) then
127 Mark_And_Set_Ghost_Declaration (N);
128 end if;
130 -- Otherwise processing depends on the node kind
132 case Nkind (N) is
133 when N_Abort_Statement =>
134 Analyze_Abort_Statement (N);
136 when N_Abstract_Subprogram_Declaration =>
137 Analyze_Abstract_Subprogram_Declaration (N);
139 when N_Accept_Alternative =>
140 Analyze_Accept_Alternative (N);
142 when N_Accept_Statement =>
143 Analyze_Accept_Statement (N);
145 when N_Aggregate =>
146 Analyze_Aggregate (N);
148 when N_Allocator =>
149 Analyze_Allocator (N);
151 when N_And_Then =>
152 Analyze_Short_Circuit (N);
154 when N_Assignment_Statement =>
155 Analyze_Assignment (N);
157 when N_Asynchronous_Select =>
158 Analyze_Asynchronous_Select (N);
160 when N_At_Clause =>
161 Analyze_At_Clause (N);
163 when N_Attribute_Reference =>
164 Analyze_Attribute (N);
166 when N_Attribute_Definition_Clause =>
167 Analyze_Attribute_Definition_Clause (N);
169 when N_Block_Statement =>
170 Analyze_Block_Statement (N);
172 when N_Case_Expression =>
173 Analyze_Case_Expression (N);
175 when N_Case_Statement =>
176 Analyze_Case_Statement (N);
178 when N_Character_Literal =>
179 Analyze_Character_Literal (N);
181 when N_Code_Statement =>
182 Analyze_Code_Statement (N);
184 when N_Compilation_Unit =>
185 Analyze_Compilation_Unit (N);
187 when N_Component_Declaration =>
188 Analyze_Component_Declaration (N);
190 when N_Compound_Statement =>
191 Analyze_Compound_Statement (N);
193 when N_Conditional_Entry_Call =>
194 Analyze_Conditional_Entry_Call (N);
196 when N_Delay_Alternative =>
197 Analyze_Delay_Alternative (N);
199 when N_Delay_Relative_Statement =>
200 Analyze_Delay_Relative (N);
202 when N_Delay_Until_Statement =>
203 Analyze_Delay_Until (N);
205 when N_Delta_Aggregate =>
206 Analyze_Aggregate (N);
208 when N_Entry_Body =>
209 Analyze_Entry_Body (N);
211 when N_Entry_Body_Formal_Part =>
212 Analyze_Entry_Body_Formal_Part (N);
214 when N_Entry_Call_Alternative =>
215 Analyze_Entry_Call_Alternative (N);
217 when N_Entry_Declaration =>
218 Analyze_Entry_Declaration (N);
220 when N_Entry_Index_Specification =>
221 Analyze_Entry_Index_Specification (N);
223 when N_Enumeration_Representation_Clause =>
224 Analyze_Enumeration_Representation_Clause (N);
226 when N_Exception_Declaration =>
227 Analyze_Exception_Declaration (N);
229 when N_Exception_Renaming_Declaration =>
230 Analyze_Exception_Renaming (N);
232 when N_Exit_Statement =>
233 Analyze_Exit_Statement (N);
235 when N_Expanded_Name =>
236 Analyze_Expanded_Name (N);
238 when N_Explicit_Dereference =>
239 Analyze_Explicit_Dereference (N);
241 when N_Expression_Function =>
242 Analyze_Expression_Function (N);
244 when N_Expression_With_Actions =>
245 Analyze_Expression_With_Actions (N);
247 when N_Extended_Return_Statement =>
248 Analyze_Extended_Return_Statement (N);
250 when N_Extension_Aggregate =>
251 Analyze_Aggregate (N);
253 when N_Formal_Object_Declaration =>
254 Analyze_Formal_Object_Declaration (N);
256 when N_Formal_Package_Declaration =>
257 Analyze_Formal_Package_Declaration (N);
259 when N_Formal_Subprogram_Declaration =>
260 Analyze_Formal_Subprogram_Declaration (N);
262 when N_Formal_Type_Declaration =>
263 Analyze_Formal_Type_Declaration (N);
265 when N_Free_Statement =>
266 Analyze_Free_Statement (N);
268 when N_Freeze_Entity =>
269 Analyze_Freeze_Entity (N);
271 when N_Freeze_Generic_Entity =>
272 Analyze_Freeze_Generic_Entity (N);
274 when N_Full_Type_Declaration =>
275 Analyze_Full_Type_Declaration (N);
277 when N_Function_Call =>
278 Analyze_Function_Call (N);
280 when N_Function_Instantiation =>
281 Analyze_Function_Instantiation (N);
283 when N_Generic_Function_Renaming_Declaration =>
284 Analyze_Generic_Function_Renaming (N);
286 when N_Generic_Package_Declaration =>
287 Analyze_Generic_Package_Declaration (N);
289 when N_Generic_Package_Renaming_Declaration =>
290 Analyze_Generic_Package_Renaming (N);
292 when N_Generic_Procedure_Renaming_Declaration =>
293 Analyze_Generic_Procedure_Renaming (N);
295 when N_Generic_Subprogram_Declaration =>
296 Analyze_Generic_Subprogram_Declaration (N);
298 when N_Goto_Statement =>
299 Analyze_Goto_Statement (N);
301 when N_Goto_When_Statement =>
302 Analyze_Goto_When_Statement (N);
304 when N_Handled_Sequence_Of_Statements =>
305 Analyze_Handled_Statements (N);
307 when N_Identifier =>
308 Analyze_Identifier (N);
310 when N_If_Expression =>
311 Analyze_If_Expression (N);
313 when N_If_Statement =>
314 Analyze_If_Statement (N);
316 when N_Implicit_Label_Declaration =>
317 Analyze_Implicit_Label_Declaration (N);
319 when N_In =>
320 Analyze_Membership_Op (N);
322 when N_Incomplete_Type_Declaration =>
323 Analyze_Incomplete_Type_Decl (N);
325 when N_Indexed_Component =>
326 Analyze_Indexed_Component_Form (N);
328 when N_Integer_Literal =>
329 Analyze_Integer_Literal (N);
331 when N_Iterator_Specification =>
332 Analyze_Iterator_Specification (N);
334 when N_Itype_Reference =>
335 Analyze_Itype_Reference (N);
337 when N_Label =>
338 Analyze_Label (N);
340 when N_Loop_Parameter_Specification =>
341 Analyze_Loop_Parameter_Specification (N);
343 when N_Loop_Statement =>
344 Analyze_Loop_Statement (N);
346 when N_Not_In =>
347 Analyze_Membership_Op (N);
349 when N_Null =>
350 Analyze_Null (N);
352 when N_Null_Statement =>
353 Analyze_Null_Statement (N);
355 when N_Number_Declaration =>
356 Analyze_Number_Declaration (N);
358 when N_Object_Declaration =>
359 Analyze_Object_Declaration (N);
361 when N_Object_Renaming_Declaration =>
362 Analyze_Object_Renaming (N);
364 when N_Operator_Symbol =>
365 Analyze_Operator_Symbol (N);
367 when N_Op_Abs =>
368 Analyze_Unary_Op (N);
370 when N_Op_Add =>
371 Analyze_Arithmetic_Op (N);
373 when N_Op_And =>
374 Analyze_Logical_Op (N);
376 when N_Op_Concat =>
377 Analyze_Concatenation (N);
379 when N_Op_Divide =>
380 Analyze_Arithmetic_Op (N);
382 when N_Op_Eq =>
383 Analyze_Equality_Op (N);
385 when N_Op_Expon =>
386 Analyze_Arithmetic_Op (N);
388 when N_Op_Ge =>
389 Analyze_Comparison_Op (N);
391 when N_Op_Gt =>
392 Analyze_Comparison_Op (N);
394 when N_Op_Le =>
395 Analyze_Comparison_Op (N);
397 when N_Op_Lt =>
398 Analyze_Comparison_Op (N);
400 when N_Op_Minus =>
401 Analyze_Unary_Op (N);
403 when N_Op_Mod =>
404 Analyze_Mod (N);
406 when N_Op_Multiply =>
407 Analyze_Arithmetic_Op (N);
409 when N_Op_Ne =>
410 Analyze_Equality_Op (N);
412 when N_Op_Not =>
413 Analyze_Negation (N);
415 when N_Op_Or =>
416 Analyze_Logical_Op (N);
418 when N_Op_Plus =>
419 Analyze_Unary_Op (N);
421 when N_Op_Rem =>
422 Analyze_Arithmetic_Op (N);
424 when N_Op_Rotate_Left =>
425 Analyze_Arithmetic_Op (N);
427 when N_Op_Rotate_Right =>
428 Analyze_Arithmetic_Op (N);
430 when N_Op_Shift_Left =>
431 Analyze_Arithmetic_Op (N);
433 when N_Op_Shift_Right =>
434 Analyze_Arithmetic_Op (N);
436 when N_Op_Shift_Right_Arithmetic =>
437 Analyze_Arithmetic_Op (N);
439 when N_Op_Subtract =>
440 Analyze_Arithmetic_Op (N);
442 when N_Op_Xor =>
443 Analyze_Logical_Op (N);
445 when N_Or_Else =>
446 Analyze_Short_Circuit (N);
448 when N_Others_Choice =>
449 Analyze_Others_Choice (N);
451 when N_Package_Body =>
452 Analyze_Package_Body (N);
454 when N_Package_Body_Stub =>
455 Analyze_Package_Body_Stub (N);
457 when N_Package_Declaration =>
458 Analyze_Package_Declaration (N);
460 when N_Package_Instantiation =>
461 Analyze_Package_Instantiation (N);
463 when N_Package_Renaming_Declaration =>
464 Analyze_Package_Renaming (N);
466 when N_Package_Specification =>
467 Analyze_Package_Specification (N);
469 when N_Parameter_Association =>
470 Analyze_Parameter_Association (N);
472 when N_Pragma =>
473 Analyze_Pragma (N);
475 when N_Private_Extension_Declaration =>
476 Analyze_Private_Extension_Declaration (N);
478 when N_Private_Type_Declaration =>
479 Analyze_Private_Type_Declaration (N);
481 when N_Procedure_Call_Statement =>
482 Analyze_Procedure_Call (N);
484 when N_Procedure_Instantiation =>
485 Analyze_Procedure_Instantiation (N);
487 when N_Protected_Body =>
488 Analyze_Protected_Body (N);
490 when N_Protected_Body_Stub =>
491 Analyze_Protected_Body_Stub (N);
493 when N_Protected_Definition =>
494 Analyze_Protected_Definition (N);
496 when N_Protected_Type_Declaration =>
497 Analyze_Protected_Type_Declaration (N);
499 when N_Qualified_Expression =>
500 Analyze_Qualified_Expression (N);
502 when N_Quantified_Expression =>
503 Analyze_Quantified_Expression (N);
505 when N_Raise_Expression =>
506 Analyze_Raise_Expression (N);
508 when N_Raise_Statement =>
509 Analyze_Raise_Statement (N);
511 when N_Raise_When_Statement =>
512 Analyze_Raise_When_Statement (N);
514 when N_Raise_xxx_Error =>
515 Analyze_Raise_xxx_Error (N);
517 when N_Range =>
518 Analyze_Range (N);
520 when N_Range_Constraint =>
521 Analyze_Range (Range_Expression (N));
523 when N_Real_Literal =>
524 Analyze_Real_Literal (N);
526 when N_Record_Representation_Clause =>
527 Analyze_Record_Representation_Clause (N);
529 when N_Reference =>
530 Analyze_Reference (N);
532 when N_Requeue_Statement =>
533 Analyze_Requeue (N);
535 when N_Return_When_Statement =>
536 Analyze_Return_When_Statement (N);
538 when N_Simple_Return_Statement =>
539 Analyze_Simple_Return_Statement (N);
541 when N_Selected_Component =>
542 Find_Selected_Component (N);
543 -- ??? why not Analyze_Selected_Component, needs comments
545 when N_Selective_Accept =>
546 Analyze_Selective_Accept (N);
548 when N_Single_Protected_Declaration =>
549 Analyze_Single_Protected_Declaration (N);
551 when N_Single_Task_Declaration =>
552 Analyze_Single_Task_Declaration (N);
554 when N_Slice =>
555 Analyze_Slice (N);
557 when N_String_Literal =>
558 Analyze_String_Literal (N);
560 when N_Subprogram_Body =>
561 Analyze_Subprogram_Body (N);
563 when N_Subprogram_Body_Stub =>
564 Analyze_Subprogram_Body_Stub (N);
566 when N_Subprogram_Declaration =>
567 Analyze_Subprogram_Declaration (N);
569 when N_Subprogram_Renaming_Declaration =>
570 Analyze_Subprogram_Renaming (N);
572 when N_Subtype_Declaration =>
573 Analyze_Subtype_Declaration (N);
575 when N_Subtype_Indication =>
576 Analyze_Subtype_Indication (N);
578 when N_Subunit =>
579 Analyze_Subunit (N);
581 when N_Target_Name =>
582 Analyze_Target_Name (N);
584 when N_Task_Body =>
585 Analyze_Task_Body (N);
587 when N_Task_Body_Stub =>
588 Analyze_Task_Body_Stub (N);
590 when N_Task_Definition =>
591 Analyze_Task_Definition (N);
593 when N_Task_Type_Declaration =>
594 Analyze_Task_Type_Declaration (N);
596 when N_Terminate_Alternative =>
597 Analyze_Terminate_Alternative (N);
599 when N_Timed_Entry_Call =>
600 Analyze_Timed_Entry_Call (N);
602 when N_Triggering_Alternative =>
603 Analyze_Triggering_Alternative (N);
605 when N_Type_Conversion =>
606 Analyze_Type_Conversion (N);
608 when N_Unchecked_Expression =>
609 Analyze_Unchecked_Expression (N);
611 when N_Unchecked_Type_Conversion =>
612 Analyze_Unchecked_Type_Conversion (N);
614 when N_Use_Package_Clause =>
615 Analyze_Use_Package (N);
617 when N_Use_Type_Clause =>
618 Analyze_Use_Type (N);
620 when N_Validate_Unchecked_Conversion =>
621 null;
623 when N_Variant_Part =>
624 Analyze_Variant_Part (N);
626 when N_With_Clause =>
627 Analyze_With_Clause (N);
629 -- A call to analyze a marker is ignored because the node does not
630 -- have any static and run-time semantics.
632 when N_Call_Marker
633 | N_Variable_Reference_Marker
635 null;
637 -- A call to analyze the Empty node is an error, but most likely it
638 -- is an error caused by an attempt to analyze a malformed piece of
639 -- tree caused by some other error, so if there have been any other
640 -- errors, we just ignore it, otherwise it is a real internal error
641 -- which we complain about.
643 -- We must also consider the case of call to a runtime function that
644 -- is not available in the configurable runtime.
646 when N_Empty =>
647 pragma Assert (Serious_Errors_Detected /= 0
648 or else Configurable_Run_Time_Violations /= 0);
649 null;
651 -- A call to analyze the error node is simply ignored, to avoid
652 -- causing cascaded errors (happens of course only in error cases)
653 -- Disable expansion in case it is still enabled, to prevent other
654 -- subsequent compiler glitches.
656 when N_Error =>
657 Expander_Mode_Save_And_Set (False);
658 null;
660 -- Push/Pop nodes normally don't come through an analyze call. An
661 -- exception is the dummy ones bracketing a subprogram body. In any
662 -- case there is nothing to be done to analyze such nodes.
664 when N_Push_Pop_xxx_Label =>
665 null;
667 -- SCIL nodes don't need analysis because they are decorated when
668 -- they are built. They are added to the tree by Insert_Actions and
669 -- the call to analyze them is generated when the full list is
670 -- analyzed.
672 when N_SCIL_Dispatch_Table_Tag_Init
673 | N_SCIL_Dispatching_Call
674 | N_SCIL_Membership_Test
676 null;
678 -- A quantified expression with a missing "all" or "some" qualifier
679 -- looks identical to an iterated component association. By language
680 -- definition, the latter must be present within array aggregates. If
681 -- this is not the case, then the iterated component association is
682 -- really an illegal quantified expression. Diagnose this scenario.
684 when N_Iterated_Component_Association =>
685 Diagnose_Iterated_Component_Association (N);
687 when N_Iterated_Element_Association =>
688 null; -- May require a more precise error if misplaced.
690 -- For the remaining node types, we generate compiler abort, because
691 -- these nodes are always analyzed within the Sem_Chn routines and
692 -- there should never be a case of making a call to the main Analyze
693 -- routine for these node kinds. For example, an N_Access_Definition
694 -- node appears only in the context of a type declaration, and is
695 -- processed by the analyze routine for type declarations.
697 when N_Abortable_Part
698 | N_Access_Definition
699 | N_Access_Function_Definition
700 | N_Access_Procedure_Definition
701 | N_Access_To_Object_Definition
702 | N_Aspect_Specification
703 | N_Case_Expression_Alternative
704 | N_Case_Statement_Alternative
705 | N_Compilation_Unit_Aux
706 | N_Component_Association
707 | N_Component_Clause
708 | N_Component_Definition
709 | N_Component_List
710 | N_Constrained_Array_Definition
711 | N_Contract
712 | N_Decimal_Fixed_Point_Definition
713 | N_Defining_Character_Literal
714 | N_Defining_Identifier
715 | N_Defining_Operator_Symbol
716 | N_Defining_Program_Unit_Name
717 | N_Delta_Constraint
718 | N_Derived_Type_Definition
719 | N_Designator
720 | N_Digits_Constraint
721 | N_Discriminant_Association
722 | N_Discriminant_Specification
723 | N_Elsif_Part
724 | N_Entry_Call_Statement
725 | N_Enumeration_Type_Definition
726 | N_Exception_Handler
727 | N_Floating_Point_Definition
728 | N_Formal_Decimal_Fixed_Point_Definition
729 | N_Formal_Derived_Type_Definition
730 | N_Formal_Discrete_Type_Definition
731 | N_Formal_Floating_Point_Definition
732 | N_Formal_Modular_Type_Definition
733 | N_Formal_Ordinary_Fixed_Point_Definition
734 | N_Formal_Private_Type_Definition
735 | N_Formal_Incomplete_Type_Definition
736 | N_Formal_Signed_Integer_Type_Definition
737 | N_Function_Specification
738 | N_Generic_Association
739 | N_Index_Or_Discriminant_Constraint
740 | N_Iteration_Scheme
741 | N_Mod_Clause
742 | N_Modular_Type_Definition
743 | N_Ordinary_Fixed_Point_Definition
744 | N_Parameter_Specification
745 | N_Pragma_Argument_Association
746 | N_Procedure_Specification
747 | N_Real_Range_Specification
748 | N_Record_Definition
749 | N_Signed_Integer_Type_Definition
750 | N_Unconstrained_Array_Definition
751 | N_Unused_At_End
752 | N_Unused_At_Start
753 | N_Variant
755 raise Program_Error;
756 end case;
758 Debug_A_Exit ("analyzing ", N, " (done)");
760 -- Mark relevant use-type and use-package clauses as effective
761 -- preferring the original node over the analyzed one in the case that
762 -- constant folding has occurred and removed references that need to be
763 -- examined. Also, if the node in question is overloaded then this is
764 -- deferred until resolution.
766 declare
767 Operat : Node_Id := Empty;
768 begin
769 -- Attempt to obtain a checkable operator node
771 if Nkind (Original_Node (N)) in N_Op then
772 Operat := Original_Node (N);
773 elsif Nkind (N) in N_Op then
774 Operat := N;
775 end if;
777 -- Mark the operator
779 if Present (Operat)
780 and then Present (Entity (Operat))
781 and then not Is_Overloaded (Operat)
782 then
783 Mark_Use_Clauses (Operat);
784 end if;
785 end;
787 -- Now that we have analyzed the node, we call the expander to perform
788 -- possible expansion. We skip this for subexpressions, because we don't
789 -- have the type yet, and the expander will need to know the type before
790 -- it can do its job. For subexpression nodes, the call to the expander
791 -- happens in Sem_Res.Resolve. A special exception is Raise_xxx_Error,
792 -- which can appear in a statement context, and needs expanding now in
793 -- the case (distinguished by Etype, as documented in Sinfo).
795 -- The Analyzed flag is also set at this point for non-subexpression
796 -- nodes (in the case of subexpression nodes, we can't set the flag yet,
797 -- since resolution and expansion have not yet been completed). Note
798 -- that for N_Raise_xxx_Error we have to distinguish the expression
799 -- case from the statement case.
801 if Nkind (N) not in N_Subexpr
802 or else (Nkind (N) in N_Raise_xxx_Error
803 and then Etype (N) = Standard_Void_Type)
804 then
805 Expand (N);
807 -- Replace a reference to a renaming with the renamed object for SPARK.
808 -- In general this modification is performed by Expand_SPARK, however
809 -- certain constructs may not reach the resolution or expansion phase
810 -- and thus remain unchanged. The replacement is not performed when the
811 -- construct is overloaded as resolution must first take place. This is
812 -- also not done when analyzing a generic to preserve the original tree
813 -- and because the reference may become overloaded in the instance.
815 elsif GNATprove_Mode
816 and then Nkind (N) in N_Expanded_Name | N_Identifier
817 and then not Is_Overloaded (N)
818 and then not Inside_A_Generic
819 then
820 Expand_SPARK_Potential_Renaming (N);
821 end if;
823 Restore_Ghost_Region (Saved_GM, Saved_IGR);
824 end Analyze;
826 -- Version with check(s) suppressed
828 procedure Analyze (N : Node_Id; Suppress : Check_Id) is
829 begin
830 if Suppress = All_Checks then
831 declare
832 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
833 begin
834 Scope_Suppress.Suppress := (others => True);
835 Analyze (N);
836 Scope_Suppress.Suppress := Svs;
837 end;
839 else
840 declare
841 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
842 begin
843 Scope_Suppress.Suppress (Suppress) := True;
844 Analyze (N);
845 Scope_Suppress.Suppress (Suppress) := Svg;
846 end;
847 end if;
848 end Analyze;
850 ------------------
851 -- Analyze_List --
852 ------------------
854 procedure Analyze_List (L : List_Id) is
855 Node : Node_Id;
857 begin
858 Node := First (L);
859 while Present (Node) loop
860 Analyze (Node);
861 Next (Node);
862 end loop;
863 end Analyze_List;
865 -- Version with check(s) suppressed
867 procedure Analyze_List (L : List_Id; Suppress : Check_Id) is
868 begin
869 if Suppress = All_Checks then
870 declare
871 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
872 begin
873 Scope_Suppress.Suppress := (others => True);
874 Analyze_List (L);
875 Scope_Suppress.Suppress := Svs;
876 end;
878 else
879 declare
880 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
881 begin
882 Scope_Suppress.Suppress (Suppress) := True;
883 Analyze_List (L);
884 Scope_Suppress.Suppress (Suppress) := Svg;
885 end;
886 end if;
887 end Analyze_List;
889 --------------------------
890 -- Copy_Suppress_Status --
891 --------------------------
893 procedure Copy_Suppress_Status
894 (C : Check_Id;
895 From : Entity_Id;
896 To : Entity_Id)
898 Found : Boolean;
899 pragma Warnings (Off, Found);
901 procedure Search_Stack
902 (Top : Suppress_Stack_Entry_Ptr;
903 Found : out Boolean);
904 -- Search given suppress stack for matching entry for entity. If found
905 -- then set Checks_May_Be_Suppressed on To, and push an appropriate
906 -- entry for To onto the local suppress stack.
908 ------------------
909 -- Search_Stack --
910 ------------------
912 procedure Search_Stack
913 (Top : Suppress_Stack_Entry_Ptr;
914 Found : out Boolean)
916 Ptr : Suppress_Stack_Entry_Ptr;
918 begin
919 Ptr := Top;
920 while Ptr /= null loop
921 if Ptr.Entity = From
922 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
923 then
924 if Ptr.Suppress then
925 Set_Checks_May_Be_Suppressed (To, True);
926 Push_Local_Suppress_Stack_Entry
927 (Entity => To,
928 Check => C,
929 Suppress => True);
930 Found := True;
931 return;
932 end if;
933 end if;
935 Ptr := Ptr.Prev;
936 end loop;
938 Found := False;
939 return;
940 end Search_Stack;
942 -- Start of processing for Copy_Suppress_Status
944 begin
945 if not Checks_May_Be_Suppressed (From) then
946 return;
947 end if;
949 -- First search the global entity suppress table for a matching entry.
950 -- We also search this in reverse order so that if there are multiple
951 -- pragmas for the same entity, the last one applies.
953 Search_Stack (Global_Suppress_Stack_Top, Found);
955 if Found then
956 return;
957 end if;
959 -- Now search the local entity suppress stack, we search this in
960 -- reverse order so that we get the innermost entry that applies to
961 -- this case if there are nested entries. Note that for the purpose
962 -- of this procedure we are ONLY looking for entries corresponding
963 -- to a two-argument Suppress, where the second argument matches From.
965 Search_Stack (Local_Suppress_Stack_Top, Found);
966 end Copy_Suppress_Status;
968 -------------------------
969 -- Enter_Generic_Scope --
970 -------------------------
972 procedure Enter_Generic_Scope (S : Entity_Id) is
973 begin
974 if No (Outer_Generic_Scope) then
975 Outer_Generic_Scope := S;
976 end if;
977 end Enter_Generic_Scope;
979 ------------------------
980 -- Exit_Generic_Scope --
981 ------------------------
983 procedure Exit_Generic_Scope (S : Entity_Id) is
984 begin
985 if S = Outer_Generic_Scope then
986 Outer_Generic_Scope := Empty;
987 end if;
988 end Exit_Generic_Scope;
990 -----------------------
991 -- Explicit_Suppress --
992 -----------------------
994 function Explicit_Suppress (E : Entity_Id; C : Check_Id) return Boolean is
995 Ptr : Suppress_Stack_Entry_Ptr;
997 begin
998 if not Checks_May_Be_Suppressed (E) then
999 return False;
1001 else
1002 Ptr := Global_Suppress_Stack_Top;
1003 while Ptr /= null loop
1004 if Ptr.Entity = E
1005 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
1006 then
1007 return Ptr.Suppress;
1008 end if;
1010 Ptr := Ptr.Prev;
1011 end loop;
1012 end if;
1014 return False;
1015 end Explicit_Suppress;
1017 -----------------------------
1018 -- External_Ref_In_Generic --
1019 -----------------------------
1021 function External_Ref_In_Generic (E : Entity_Id) return Boolean is
1022 Scop : Entity_Id;
1024 begin
1025 -- Entity is global if defined outside of current Outer_Generic_Scope:
1026 -- Either the entity has a smaller depth than the outer generic, or it
1027 -- is in a different compilation unit, or it is defined within a unit
1028 -- in the same compilation, that is not within the outer generic.
1030 if No (Outer_Generic_Scope) then
1031 return False;
1033 -- It makes no sense to compare depths if not in same unit. Scope_Depth
1034 -- is not set for inherited operations.
1036 elsif not In_Same_Source_Unit (E, Outer_Generic_Scope)
1037 or else not Scope_Depth_Set (Scope (E))
1038 or else Scope_Depth (Scope (E)) < Scope_Depth (Outer_Generic_Scope)
1039 then
1040 return True;
1042 else
1043 Scop := Scope (E);
1044 while Present (Scop) loop
1045 if Scop = Outer_Generic_Scope then
1046 return False;
1047 elsif Scope_Depth (Scop) < Scope_Depth (Outer_Generic_Scope) then
1048 return True;
1049 else
1050 Scop := Scope (Scop);
1051 end if;
1052 end loop;
1054 return True;
1055 end if;
1056 end External_Ref_In_Generic;
1058 ----------------
1059 -- Initialize --
1060 ----------------
1062 procedure Initialize is
1063 Next : Suppress_Stack_Entry_Ptr;
1065 procedure Free is new Unchecked_Deallocation
1066 (Suppress_Stack_Entry, Suppress_Stack_Entry_Ptr);
1068 begin
1069 -- Free any global suppress stack entries from a previous invocation
1070 -- of the compiler (in the normal case this loop does nothing).
1072 while Suppress_Stack_Entries /= null loop
1073 Next := Suppress_Stack_Entries.Next;
1074 Free (Suppress_Stack_Entries);
1075 Suppress_Stack_Entries := Next;
1076 end loop;
1078 Local_Suppress_Stack_Top := null;
1079 Global_Suppress_Stack_Top := null;
1081 -- Clear scope stack, and reset global variables
1083 Scope_Stack.Init;
1084 Unloaded_Subunits := False;
1085 end Initialize;
1087 ------------------------------
1088 -- Insert_After_And_Analyze --
1089 ------------------------------
1091 procedure Insert_After_And_Analyze (N : Node_Id; M : Node_Id) is
1092 Node : Node_Id;
1094 begin
1095 if Present (M) then
1097 -- If we are not at the end of the list, then the easiest
1098 -- coding is simply to insert before our successor.
1100 if Present (Next (N)) then
1101 Insert_Before_And_Analyze (Next (N), M);
1103 -- Case of inserting at the end of the list
1105 else
1106 -- Capture the Node_Id of the node to be inserted. This Node_Id
1107 -- will still be the same after the insert operation.
1109 Node := M;
1110 Insert_After (N, M);
1112 -- Now just analyze from the inserted node to the end of
1113 -- the new list (note that this properly handles the case
1114 -- where any of the analyze calls result in the insertion of
1115 -- nodes after the analyzed node, expecting analysis).
1117 while Present (Node) loop
1118 Analyze (Node);
1119 Mark_Rewrite_Insertion (Node);
1120 Next (Node);
1121 end loop;
1122 end if;
1123 end if;
1124 end Insert_After_And_Analyze;
1126 -- Version with check(s) suppressed
1128 procedure Insert_After_And_Analyze
1129 (N : Node_Id;
1130 M : Node_Id;
1131 Suppress : Check_Id)
1133 begin
1134 if Suppress = All_Checks then
1135 declare
1136 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
1137 begin
1138 Scope_Suppress.Suppress := (others => True);
1139 Insert_After_And_Analyze (N, M);
1140 Scope_Suppress.Suppress := Svs;
1141 end;
1143 else
1144 declare
1145 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
1146 begin
1147 Scope_Suppress.Suppress (Suppress) := True;
1148 Insert_After_And_Analyze (N, M);
1149 Scope_Suppress.Suppress (Suppress) := Svg;
1150 end;
1151 end if;
1152 end Insert_After_And_Analyze;
1154 -------------------------------
1155 -- Insert_Before_And_Analyze --
1156 -------------------------------
1158 procedure Insert_Before_And_Analyze (N : Node_Id; M : Node_Id) is
1159 Node : Node_Id;
1161 begin
1162 if Present (M) then
1164 -- Capture the Node_Id of the first list node to be inserted.
1165 -- This will still be the first node after the insert operation,
1166 -- since Insert_List_After does not modify the Node_Id values.
1168 Node := M;
1169 Insert_Before (N, M);
1171 -- The insertion does not change the Id's of any of the nodes in
1172 -- the list, and they are still linked, so we can simply loop from
1173 -- the original first node until we meet the node before which the
1174 -- insertion is occurring. Note that this properly handles the case
1175 -- where any of the analyzed nodes insert nodes after themselves,
1176 -- expecting them to get analyzed.
1178 while Node /= N loop
1179 Analyze (Node);
1180 Mark_Rewrite_Insertion (Node);
1181 Next (Node);
1182 end loop;
1183 end if;
1184 end Insert_Before_And_Analyze;
1186 -- Version with check(s) suppressed
1188 procedure Insert_Before_And_Analyze
1189 (N : Node_Id;
1190 M : Node_Id;
1191 Suppress : Check_Id)
1193 begin
1194 if Suppress = All_Checks then
1195 declare
1196 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
1197 begin
1198 Scope_Suppress.Suppress := (others => True);
1199 Insert_Before_And_Analyze (N, M);
1200 Scope_Suppress.Suppress := Svs;
1201 end;
1203 else
1204 declare
1205 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
1206 begin
1207 Scope_Suppress.Suppress (Suppress) := True;
1208 Insert_Before_And_Analyze (N, M);
1209 Scope_Suppress.Suppress (Suppress) := Svg;
1210 end;
1211 end if;
1212 end Insert_Before_And_Analyze;
1214 --------------------------------------------
1215 -- Insert_Before_First_Source_Declaration --
1216 --------------------------------------------
1218 procedure Insert_Before_First_Source_Declaration
1219 (Stmt : Node_Id;
1220 Decls : List_Id)
1222 Decl : Node_Id;
1223 begin
1224 -- Inspect the declarations of the related subprogram body looking for
1225 -- the first source declaration.
1227 pragma Assert (Present (Decls));
1229 Decl := First (Decls);
1230 while Present (Decl) loop
1231 if Comes_From_Source (Decl) then
1232 Insert_Before (Decl, Stmt);
1233 return;
1234 end if;
1236 Next (Decl);
1237 end loop;
1239 -- If we get there, then the subprogram body lacks any source
1240 -- declarations. The body of _Postconditions now acts as the
1241 -- last declaration.
1243 Append (Stmt, Decls);
1244 end Insert_Before_First_Source_Declaration;
1246 -----------------------------------
1247 -- Insert_List_After_And_Analyze --
1248 -----------------------------------
1250 procedure Insert_List_After_And_Analyze (N : Node_Id; L : List_Id) is
1251 After : constant Node_Id := Next (N);
1252 Node : Node_Id;
1254 begin
1255 if Is_Non_Empty_List (L) then
1257 -- Capture the Node_Id of the first list node to be inserted.
1258 -- This will still be the first node after the insert operation,
1259 -- since Insert_List_After does not modify the Node_Id values.
1261 Node := First (L);
1262 Insert_List_After (N, L);
1264 -- Now just analyze from the original first node until we get to the
1265 -- successor of the original insertion point (which may be Empty if
1266 -- the insertion point was at the end of the list). Note that this
1267 -- properly handles the case where any of the analyze calls result in
1268 -- the insertion of nodes after the analyzed node (possibly calling
1269 -- this routine recursively).
1271 while Node /= After loop
1272 Analyze (Node);
1273 Mark_Rewrite_Insertion (Node);
1274 Next (Node);
1275 end loop;
1276 end if;
1277 end Insert_List_After_And_Analyze;
1279 ------------------------------------
1280 -- Insert_List_Before_And_Analyze --
1281 ------------------------------------
1283 procedure Insert_List_Before_And_Analyze (N : Node_Id; L : List_Id) is
1284 Node : Node_Id;
1286 begin
1287 if Is_Non_Empty_List (L) then
1289 -- Capture the Node_Id of the first list node to be inserted. This
1290 -- will still be the first node after the insert operation, since
1291 -- Insert_List_After does not modify the Node_Id values.
1293 Node := First (L);
1294 Insert_List_Before (N, L);
1296 -- The insertion does not change the Id's of any of the nodes in
1297 -- the list, and they are still linked, so we can simply loop from
1298 -- the original first node until we meet the node before which the
1299 -- insertion is occurring. Note that this properly handles the case
1300 -- where any of the analyzed nodes insert nodes after themselves,
1301 -- expecting them to get analyzed.
1303 while Node /= N loop
1304 Analyze (Node);
1305 Mark_Rewrite_Insertion (Node);
1306 Next (Node);
1307 end loop;
1308 end if;
1309 end Insert_List_Before_And_Analyze;
1311 ----------
1312 -- Lock --
1313 ----------
1315 procedure Lock is
1316 begin
1317 Scope_Stack.Release;
1318 Scope_Stack.Locked := True;
1319 end Lock;
1321 ------------------------
1322 -- Preanalysis_Active --
1323 ------------------------
1325 function Preanalysis_Active return Boolean is
1326 begin
1327 return not Full_Analysis and not Expander_Active;
1328 end Preanalysis_Active;
1330 ----------------
1331 -- Preanalyze --
1332 ----------------
1334 procedure Preanalyze (N : Node_Id) is
1335 Save_Full_Analysis : constant Boolean := Full_Analysis;
1337 begin
1338 Full_Analysis := False;
1339 Expander_Mode_Save_And_Set (False);
1341 Analyze (N);
1343 Expander_Mode_Restore;
1344 Full_Analysis := Save_Full_Analysis;
1345 end Preanalyze;
1347 --------------------------------------
1348 -- Push_Global_Suppress_Stack_Entry --
1349 --------------------------------------
1351 procedure Push_Global_Suppress_Stack_Entry
1352 (Entity : Entity_Id;
1353 Check : Check_Id;
1354 Suppress : Boolean)
1356 begin
1357 Global_Suppress_Stack_Top :=
1358 new Suppress_Stack_Entry'
1359 (Entity => Entity,
1360 Check => Check,
1361 Suppress => Suppress,
1362 Prev => Global_Suppress_Stack_Top,
1363 Next => Suppress_Stack_Entries);
1364 Suppress_Stack_Entries := Global_Suppress_Stack_Top;
1365 return;
1366 end Push_Global_Suppress_Stack_Entry;
1368 -------------------------------------
1369 -- Push_Local_Suppress_Stack_Entry --
1370 -------------------------------------
1372 procedure Push_Local_Suppress_Stack_Entry
1373 (Entity : Entity_Id;
1374 Check : Check_Id;
1375 Suppress : Boolean)
1377 begin
1378 Local_Suppress_Stack_Top :=
1379 new Suppress_Stack_Entry'
1380 (Entity => Entity,
1381 Check => Check,
1382 Suppress => Suppress,
1383 Prev => Local_Suppress_Stack_Top,
1384 Next => Suppress_Stack_Entries);
1385 Suppress_Stack_Entries := Local_Suppress_Stack_Top;
1387 return;
1388 end Push_Local_Suppress_Stack_Entry;
1390 ---------------
1391 -- Semantics --
1392 ---------------
1394 procedure Semantics (Comp_Unit : Node_Id) is
1395 procedure Do_Analyze;
1396 -- Perform the analysis of the compilation unit
1398 ----------------
1399 -- Do_Analyze --
1400 ----------------
1402 -- WARNING: This routine manages Ghost regions. Return statements must
1403 -- be replaced by gotos which jump to the end of the routine and restore
1404 -- the Ghost mode.
1406 procedure Do_Analyze is
1407 Saved_GM : constant Ghost_Mode_Type := Ghost_Mode;
1408 Saved_IGR : constant Node_Id := Ignored_Ghost_Region;
1409 Saved_ISMP : constant Boolean :=
1410 Ignore_SPARK_Mode_Pragmas_In_Instance;
1411 -- Save Ghost and SPARK mode-related data to restore on exit
1413 -- Generally style checks are preserved across compilations, with
1414 -- one exception: s-oscons.ads, which allows arbitrary long lines
1415 -- unconditionally, and has no restore mechanism, because it is
1416 -- intended as a lowest-level Pure package.
1418 Saved_ML : constant Int := Style_Max_Line_Length;
1419 Saved_CML : constant Boolean := Style_Check_Max_Line_Length;
1421 List : Elist_Id;
1423 begin
1424 List := Save_Scope_Stack;
1425 Push_Scope (Standard_Standard);
1427 -- Set up a clean environment before analyzing
1429 Install_Ghost_Region (None, Empty);
1430 Ignore_SPARK_Mode_Pragmas_In_Instance := False;
1432 Outer_Generic_Scope := Empty;
1433 Scope_Suppress := Suppress_Options;
1434 Scope_Stack.Table
1435 (Scope_Stack.Last).Component_Alignment_Default :=
1436 Configuration_Component_Alignment;
1437 Scope_Stack.Table
1438 (Scope_Stack.Last).Is_Active_Stack_Base := True;
1440 -- Now analyze the top level compilation unit node
1442 Analyze (Comp_Unit);
1444 -- Check for scope mismatch on exit from compilation
1446 pragma Assert (Current_Scope = Standard_Standard
1447 or else Comp_Unit = Cunit (Main_Unit));
1449 -- Then pop entry for Standard, and pop implicit types
1451 Pop_Scope;
1452 Restore_Scope_Stack (List);
1453 Style_Max_Line_Length := Saved_ML;
1454 Style_Check_Max_Line_Length := Saved_CML;
1456 Restore_Ghost_Region (Saved_GM, Saved_IGR);
1457 Ignore_SPARK_Mode_Pragmas_In_Instance := Saved_ISMP;
1458 end Do_Analyze;
1460 -- Local variables
1462 -- The following locations save the corresponding global flags and
1463 -- variables so that they can be restored on completion. This is needed
1464 -- so that calls to Rtsfind start with the proper default values for
1465 -- these variables, and also that such calls do not disturb the settings
1466 -- for units being analyzed at a higher level.
1468 S_Current_Sem_Unit : constant Unit_Number_Type := Current_Sem_Unit;
1469 S_Full_Analysis : constant Boolean := Full_Analysis;
1470 S_GNAT_Mode : constant Boolean := GNAT_Mode;
1471 S_Global_Dis_Names : constant Boolean := Global_Discard_Names;
1472 S_In_Assertion_Expr : constant Nat := In_Assertion_Expr;
1473 S_In_Declare_Expr : constant Nat := In_Declare_Expr;
1474 S_In_Default_Expr : constant Boolean := In_Default_Expr;
1475 S_In_Spec_Expr : constant Boolean := In_Spec_Expression;
1476 S_Inside_A_Generic : constant Boolean := Inside_A_Generic;
1477 S_Outer_Gen_Scope : constant Entity_Id := Outer_Generic_Scope;
1478 S_Style_Check : constant Boolean := Style_Check;
1480 Already_Analyzed : constant Boolean := Analyzed (Comp_Unit);
1482 Curunit : constant Unit_Number_Type := Get_Cunit_Unit_Number (Comp_Unit);
1483 -- New value of Current_Sem_Unit
1485 Generic_Main : constant Boolean :=
1486 Nkind (Unit (Cunit (Main_Unit))) in N_Generic_Declaration;
1487 -- If the main unit is generic, every compiled unit, including its
1488 -- context, is compiled with expansion disabled.
1490 Is_Main_Unit_Or_Main_Unit_Spec : constant Boolean :=
1491 Curunit = Main_Unit
1492 or else
1493 (Nkind (Unit (Cunit (Main_Unit))) = N_Package_Body
1494 and then Library_Unit (Cunit (Main_Unit)) = Cunit (Curunit));
1495 -- Configuration flags have special settings when compiling a predefined
1496 -- file as a main unit. This applies to its spec as well.
1498 Ext_Main_Source_Unit : constant Boolean :=
1499 In_Extended_Main_Source_Unit (Comp_Unit);
1500 -- Determine if unit is in extended main source unit
1502 Save_Config_Attrs : Config_Switches_Type;
1503 -- Variable used to save values of config switches while we analyze the
1504 -- new unit, to be restored on exit for proper recursive behavior.
1506 Save_Cunit_Restrictions : Save_Cunit_Boolean_Restrictions;
1507 -- Used to save non-partition wide restrictions before processing new
1508 -- unit. All with'ed units are analyzed with config restrictions reset
1509 -- and we need to restore these saved values at the end.
1511 Save_Preanalysis_Counter : constant Nat :=
1512 Inside_Preanalysis_Without_Freezing;
1513 -- Saves the preanalysis nesting-level counter; required since we may
1514 -- need to analyze a unit as a consequence of the preanalysis of an
1515 -- expression without freezing (and the loaded unit must be fully
1516 -- analyzed).
1518 -- Start of processing for Semantics
1520 begin
1521 Inside_Preanalysis_Without_Freezing := 0;
1523 if Debug_Unit_Walk then
1524 if Already_Analyzed then
1525 Write_Str ("(done)");
1526 end if;
1528 Write_Unit_Info
1529 (Get_Cunit_Unit_Number (Comp_Unit),
1530 Unit (Comp_Unit),
1531 Prefix => "--> ");
1532 Indent;
1533 end if;
1535 Compiler_State := Analyzing;
1536 Current_Sem_Unit := Curunit;
1538 -- Compile predefined units with GNAT_Mode set to True, to properly
1539 -- process the categorization stuff. However, do not set GNAT_Mode
1540 -- to True for the renamings units (Text_IO, IO_Exceptions, Direct_IO,
1541 -- Sequential_IO) as this would prevent pragma Extend_System from being
1542 -- taken into account, for example when Text_IO is renaming DEC.Text_IO.
1544 if Is_Predefined_Unit (Current_Sem_Unit)
1545 and then not Is_Predefined_Renaming (Current_Sem_Unit)
1546 then
1547 GNAT_Mode := True;
1548 end if;
1550 -- For generic main, never do expansion
1552 if Generic_Main then
1553 Expander_Mode_Save_And_Set (False);
1555 -- Non generic case
1557 else
1558 Expander_Mode_Save_And_Set
1560 -- Turn on expansion if generating code
1562 (Operating_Mode = Generate_Code
1564 -- Or if special debug flag -gnatdx is set
1566 or else Debug_Flag_X
1568 -- Or if in configuration run-time mode. We do this so we get
1569 -- error messages about missing entities in the run-time even
1570 -- if we are compiling in -gnatc (no code generation) mode.
1571 -- Similar processing applies to No_Run_Time_Mode. However,
1572 -- don't do this if debug flag -gnatd.Z is set or when we are
1573 -- compiling a separate unit (this is to handle a situation
1574 -- where this new processing causes trouble).
1576 or else
1577 ((Configurable_Run_Time_Mode or No_Run_Time_Mode)
1578 and then not Debug_Flag_Dot_ZZ
1579 and then Nkind (Unit (Cunit (Main_Unit))) /= N_Subunit));
1580 end if;
1582 Full_Analysis := True;
1583 Inside_A_Generic := False;
1584 In_Assertion_Expr := 0;
1585 In_Declare_Expr := 0;
1586 In_Default_Expr := False;
1587 In_Spec_Expression := False;
1588 Set_Comes_From_Source_Default (False);
1590 -- Save current config switches and reset then appropriately
1592 Save_Config_Attrs := Save_Config_Switches;
1593 Set_Config_Switches
1594 (Is_Internal_Unit (Current_Sem_Unit),
1595 Is_Main_Unit_Or_Main_Unit_Spec);
1597 -- Save current non-partition-wide restrictions
1599 Save_Cunit_Restrictions := Cunit_Boolean_Restrictions_Save;
1601 -- For unit in main extended unit, we reset the configuration values
1602 -- for the non-partition-wide restrictions. For other units reset them.
1604 if Ext_Main_Source_Unit then
1605 Restore_Config_Cunit_Boolean_Restrictions;
1606 else
1607 Reset_Cunit_Boolean_Restrictions;
1608 end if;
1610 -- Turn off style checks for unit that is not in the extended main
1611 -- source unit. This improves processing efficiency for such units
1612 -- (for which we don't want style checks anyway, and where they will
1613 -- get suppressed), and is definitely needed to stop some style checks
1614 -- from invading the run-time units (e.g. overriding checks).
1616 if not Ext_Main_Source_Unit then
1617 Style_Check := False;
1619 -- If this is part of the extended main source unit, set style check
1620 -- mode to match the style check mode of the main source unit itself.
1622 else
1623 Style_Check := Style_Check_Main;
1624 end if;
1626 -- Only do analysis of unit that has not already been analyzed
1628 if not Analyzed (Comp_Unit) then
1629 Initialize_Version (Current_Sem_Unit);
1631 -- Do analysis, and then append the compilation unit onto the
1632 -- Comp_Unit_List, if appropriate. This is done after analysis,
1633 -- so if this unit depends on some others, they have already been
1634 -- appended. We ignore bodies, except for the main unit itself, and
1635 -- for subprogram bodies that act as specs. We have also to guard
1636 -- against ill-formed subunits that have an improper context.
1638 Do_Analyze;
1640 if Present (Comp_Unit)
1641 and then Nkind (Unit (Comp_Unit)) in N_Proper_Body
1642 and then (Nkind (Unit (Comp_Unit)) /= N_Subprogram_Body
1643 or else not Acts_As_Spec (Comp_Unit))
1644 and then not Ext_Main_Source_Unit
1645 then
1646 null;
1648 else
1649 Append_New_Elmt (Comp_Unit, To => Comp_Unit_List);
1651 if Debug_Unit_Walk then
1652 Write_Str ("Appending ");
1653 Write_Unit_Info
1654 (Get_Cunit_Unit_Number (Comp_Unit), Unit (Comp_Unit));
1655 end if;
1656 end if;
1657 end if;
1659 -- Save indication of dynamic elaboration checks for ALI file
1661 Set_Dynamic_Elab (Current_Sem_Unit, Dynamic_Elaboration_Checks);
1663 -- Restore settings of saved switches to entry values
1665 Current_Sem_Unit := S_Current_Sem_Unit;
1666 Full_Analysis := S_Full_Analysis;
1667 Global_Discard_Names := S_Global_Dis_Names;
1668 GNAT_Mode := S_GNAT_Mode;
1669 In_Assertion_Expr := S_In_Assertion_Expr;
1670 In_Declare_Expr := S_In_Declare_Expr;
1671 In_Default_Expr := S_In_Default_Expr;
1672 In_Spec_Expression := S_In_Spec_Expr;
1673 Inside_A_Generic := S_Inside_A_Generic;
1674 Outer_Generic_Scope := S_Outer_Gen_Scope;
1675 Style_Check := S_Style_Check;
1677 Restore_Config_Switches (Save_Config_Attrs);
1679 -- Deal with restore of restrictions
1681 Cunit_Boolean_Restrictions_Restore (Save_Cunit_Restrictions);
1683 Expander_Mode_Restore;
1685 if Debug_Unit_Walk then
1686 Outdent;
1688 if Already_Analyzed then
1689 Write_Str ("(done)");
1690 end if;
1692 Write_Unit_Info
1693 (Get_Cunit_Unit_Number (Comp_Unit),
1694 Unit (Comp_Unit),
1695 Prefix => "<-- ");
1696 end if;
1698 Inside_Preanalysis_Without_Freezing := Save_Preanalysis_Counter;
1699 end Semantics;
1701 --------
1702 -- ss --
1703 --------
1705 function ss (Index : Int) return Scope_Stack_Entry is
1706 begin
1707 return Scope_Stack.Table (Index);
1708 end ss;
1710 ---------
1711 -- sst --
1712 ---------
1714 function sst return Scope_Stack_Entry is
1715 begin
1716 return ss (Scope_Stack.Last);
1717 end sst;
1719 ------------
1720 -- Unlock --
1721 ------------
1723 procedure Unlock is
1724 begin
1725 Scope_Stack.Locked := False;
1726 end Unlock;
1728 ------------------------
1729 -- Walk_Library_Items --
1730 ------------------------
1732 procedure Walk_Library_Items is
1733 type Unit_Number_Set is array (Main_Unit .. Last_Unit) of Boolean;
1734 pragma Pack (Unit_Number_Set);
1736 Main_CU : constant Node_Id := Cunit (Main_Unit);
1737 Spec_CU : Node_Id := Empty;
1739 Seen, Done : Unit_Number_Set := (others => False);
1740 -- Seen (X) is True after we have seen unit X in the walk. This is used
1741 -- to prevent processing the same unit more than once. Done (X) is True
1742 -- after we have fully processed X, and is used only for debugging
1743 -- printouts and assertions.
1745 Do_Main : Boolean := False;
1746 -- Flag to delay processing the main body until after all other units.
1747 -- This is needed because the spec of the main unit may appear in the
1748 -- context of some other unit. We do not want this to force processing
1749 -- of the main body before all other units have been processed.
1751 -- Another circularity pattern occurs when the main unit is a child unit
1752 -- and the body of an ancestor has a with-clause of the main unit or on
1753 -- one of its children. In both cases the body in question has a with-
1754 -- clause on the main unit, and must be excluded from the traversal. In
1755 -- some convoluted cases this may lead to a CodePeer error because the
1756 -- spec of a subprogram declared in an instance within the parent will
1757 -- not be seen in the main unit.
1759 function Depends_On_Main (CU : Node_Id) return Boolean;
1760 -- The body of a unit that is withed by the spec of the main unit may in
1761 -- turn have a with_clause on that spec. In that case do not traverse
1762 -- the body, to prevent loops. It can also happen that the main body has
1763 -- a with_clause on a child, which of course has an implicit with on its
1764 -- parent. It's OK to traverse the child body if the main spec has been
1765 -- processed, otherwise we also have a circularity to avoid.
1767 procedure Do_Action (CU : Node_Id; Item : Node_Id);
1768 -- Calls Action, with some validity checks
1770 procedure Do_Unit_And_Dependents (CU : Node_Id; Item : Node_Id);
1771 -- Calls Do_Action, first on the units with'ed by this one, then on
1772 -- this unit. If it's an instance body, do the spec first. If it is
1773 -- an instance spec, do the body last.
1775 procedure Do_Withed_Unit (Withed_Unit : Node_Id);
1776 -- Apply Do_Unit_And_Dependents to a unit in a context clause
1778 procedure Process_Bodies_In_Context (Comp : Node_Id);
1779 -- The main unit and its spec may depend on bodies that contain generics
1780 -- that are instantiated in them. Iterate through the corresponding
1781 -- contexts before processing main (spec/body) itself, to process bodies
1782 -- that may be present, together with their context. The spec of main
1783 -- is processed wherever it appears in the list of units, while the body
1784 -- is processed as the last unit in the list.
1786 ---------------------
1787 -- Depends_On_Main --
1788 ---------------------
1790 function Depends_On_Main (CU : Node_Id) return Boolean is
1791 CL : Node_Id;
1792 MCU : constant Node_Id := Unit (Main_CU);
1794 begin
1795 -- Problem does not arise with main subprograms
1797 if Nkind (MCU) not in N_Package_Body | N_Package_Declaration then
1798 return False;
1799 end if;
1801 CL := First (Context_Items (CU));
1803 while Present (CL) loop
1804 if Nkind (CL) = N_With_Clause
1805 and then Library_Unit (CL) = Main_CU
1806 and then not Done (Get_Cunit_Unit_Number (Library_Unit (CL)))
1807 then
1808 return True;
1809 end if;
1811 Next (CL);
1812 end loop;
1814 return False;
1815 end Depends_On_Main;
1817 ---------------
1818 -- Do_Action --
1819 ---------------
1821 procedure Do_Action (CU : Node_Id; Item : Node_Id) is
1822 begin
1823 -- This calls Action at the end. All the preceding code is just
1824 -- assertions and debugging output.
1826 pragma Assert (No (CU) or else Nkind (CU) = N_Compilation_Unit);
1828 case Nkind (Item) is
1829 when N_Generic_Function_Renaming_Declaration
1830 | N_Generic_Package_Declaration
1831 | N_Generic_Package_Renaming_Declaration
1832 | N_Generic_Procedure_Renaming_Declaration
1833 | N_Generic_Subprogram_Declaration
1834 | N_Package_Declaration
1835 | N_Package_Renaming_Declaration
1836 | N_Subprogram_Declaration
1837 | N_Subprogram_Renaming_Declaration
1839 -- Specs are OK
1841 null;
1843 when N_Package_Body =>
1845 -- Package bodies are processed separately if the main unit
1846 -- depends on them.
1848 null;
1850 when N_Subprogram_Body =>
1852 -- A subprogram body must be the main unit
1854 pragma Assert (Acts_As_Spec (CU) or else CU = Main_CU);
1855 null;
1857 when N_Function_Instantiation
1858 | N_Package_Instantiation
1859 | N_Procedure_Instantiation
1861 -- Can only happen if some generic body (needed for gnat2scil
1862 -- traversal, but not by GNAT) is not available, ignore.
1864 null;
1866 -- All other cases cannot happen
1868 when N_Subunit =>
1869 pragma Assert (False, "subunit");
1870 null;
1872 when N_Null_Statement =>
1874 -- Do not call Action for an ignored ghost unit
1876 pragma Assert (Is_Ignored_Ghost_Node (Original_Node (Item)));
1877 return;
1879 when others =>
1880 pragma Assert (False);
1881 null;
1882 end case;
1884 if Present (CU) then
1885 pragma Assert (Item /= Stand.Standard_Package_Node);
1886 pragma Assert (Item = Unit (CU));
1888 declare
1889 Unit_Num : constant Unit_Number_Type :=
1890 Get_Cunit_Unit_Number (CU);
1892 procedure Assert_Done (Withed_Unit : Node_Id);
1893 -- Assert Withed_Unit is already Done, unless it's a body. It
1894 -- might seem strange for a with_clause to refer to a body, but
1895 -- this happens in the case of a generic instantiation, which
1896 -- gets transformed into the instance body (and the instance
1897 -- spec is also created). With clauses pointing to the
1898 -- instantiation end up pointing to the instance body.
1900 -----------------
1901 -- Assert_Done --
1902 -----------------
1904 procedure Assert_Done (Withed_Unit : Node_Id) is
1905 begin
1906 if Withed_Unit /= Main_CU
1907 and then not Done (Get_Cunit_Unit_Number (Withed_Unit))
1908 then
1909 -- N_Null_Statement will happen in case of a ghost unit
1910 -- which gets rewritten.
1912 if Nkind (Unit (Withed_Unit)) not in
1913 N_Generic_Package_Declaration |
1914 N_Package_Body |
1915 N_Package_Renaming_Declaration |
1916 N_Subprogram_Body |
1917 N_Null_Statement
1918 then
1919 Write_Unit_Name
1920 (Unit_Name (Get_Cunit_Unit_Number (Withed_Unit)));
1921 Write_Str (" not yet walked!");
1923 if Get_Cunit_Unit_Number (Withed_Unit) = Unit_Num then
1924 Write_Str (" (self-ref)");
1925 end if;
1927 Write_Eol;
1929 pragma Assert (False);
1930 end if;
1931 end if;
1932 end Assert_Done;
1934 procedure Assert_Withed_Units_Done is
1935 new Walk_Withs (Assert_Done);
1937 begin
1938 if Debug_Unit_Walk then
1939 Write_Unit_Info (Unit_Num, Item, Withs => True);
1940 end if;
1942 -- Main unit should come last, except in the case where we
1943 -- skipped System_Aux_Id, in which case we missed the things it
1944 -- depends on, and in the case of parent bodies if present.
1946 pragma Assert
1947 (not Done (Main_Unit)
1948 or else Present (System_Aux_Id)
1949 or else Nkind (Item) = N_Package_Body);
1951 -- We shouldn't do the same thing twice
1953 pragma Assert (not Done (Unit_Num));
1955 -- Everything we depend upon should already be done
1957 pragma Debug
1958 (Assert_Withed_Units_Done (CU, Include_Limited => False));
1959 end;
1961 else
1962 -- Must be Standard, which has no entry in the units table
1964 pragma Assert (Item = Stand.Standard_Package_Node);
1966 if Debug_Unit_Walk then
1967 Write_Line ("Standard");
1968 end if;
1969 end if;
1971 Action (Item);
1972 end Do_Action;
1974 --------------------
1975 -- Do_Withed_Unit --
1976 --------------------
1978 procedure Do_Withed_Unit (Withed_Unit : Node_Id) is
1979 begin
1980 Do_Unit_And_Dependents (Withed_Unit, Unit (Withed_Unit));
1982 -- If the unit in the with_clause is a generic instance, the clause
1983 -- now denotes the instance body. Traverse the corresponding spec
1984 -- because there may be no other dependence that will force the
1985 -- traversal of its own context.
1987 if Nkind (Unit (Withed_Unit)) = N_Package_Body
1988 and then Is_Generic_Instance
1989 (Defining_Entity (Unit (Library_Unit (Withed_Unit))))
1990 then
1991 Do_Withed_Unit (Library_Unit (Withed_Unit));
1992 end if;
1993 end Do_Withed_Unit;
1995 ----------------------------
1996 -- Do_Unit_And_Dependents --
1997 ----------------------------
1999 procedure Do_Unit_And_Dependents (CU : Node_Id; Item : Node_Id) is
2000 Unit_Num : constant Unit_Number_Type := Get_Cunit_Unit_Number (CU);
2001 Child : Node_Id;
2002 Body_U : Unit_Number_Type;
2003 Parent_CU : Node_Id;
2005 procedure Do_Withed_Units is new Walk_Withs (Do_Withed_Unit);
2007 begin
2008 if not Seen (Unit_Num) then
2010 -- Process the with clauses
2012 Do_Withed_Units (CU, Include_Limited => False);
2014 -- Process the unit if it is a spec or the main unit, if it
2015 -- has no previous spec or we have done all other units.
2017 if Nkind (Item) not in N_Package_Body | N_Subprogram_Body
2018 or else Acts_As_Spec (CU)
2019 then
2020 if CU = Main_CU and then not Do_Main then
2021 Seen (Unit_Num) := False;
2023 else
2024 Seen (Unit_Num) := True;
2026 if CU = Library_Unit (Main_CU) then
2027 Process_Bodies_In_Context (CU);
2029 -- If main is a child unit, examine parent unit contexts
2030 -- to see if they include instantiated units. Also, if
2031 -- the parent itself is an instance, process its body
2032 -- because it may contain subprograms that are called
2033 -- in the main unit.
2035 if Is_Child_Unit (Cunit_Entity (Main_Unit)) then
2036 Child := Cunit_Entity (Main_Unit);
2037 while Is_Child_Unit (Child) loop
2038 Parent_CU :=
2039 Cunit
2040 (Get_Cunit_Entity_Unit_Number (Scope (Child)));
2041 Process_Bodies_In_Context (Parent_CU);
2043 if Nkind (Unit (Parent_CU)) = N_Package_Body
2044 and then
2045 Nkind (Original_Node (Unit (Parent_CU)))
2046 = N_Package_Instantiation
2047 and then
2048 not Seen (Get_Cunit_Unit_Number (Parent_CU))
2049 then
2050 Body_U := Get_Cunit_Unit_Number (Parent_CU);
2051 Seen (Body_U) := True;
2052 Do_Action (Parent_CU, Unit (Parent_CU));
2053 Done (Body_U) := True;
2054 end if;
2056 Child := Scope (Child);
2057 end loop;
2058 end if;
2059 end if;
2061 Do_Action (CU, Item);
2062 Done (Unit_Num) := True;
2063 end if;
2064 end if;
2065 end if;
2066 end Do_Unit_And_Dependents;
2068 -------------------------------
2069 -- Process_Bodies_In_Context --
2070 -------------------------------
2072 procedure Process_Bodies_In_Context (Comp : Node_Id) is
2073 Body_CU : Node_Id;
2074 Body_U : Unit_Number_Type;
2075 Clause : Node_Id;
2076 Spec : Node_Id;
2078 procedure Do_Withed_Units is new Walk_Withs (Do_Withed_Unit);
2080 -- Start of processing for Process_Bodies_In_Context
2082 begin
2083 Clause := First (Context_Items (Comp));
2084 while Present (Clause) loop
2085 if Nkind (Clause) = N_With_Clause then
2086 Spec := Library_Unit (Clause);
2087 Body_CU := Library_Unit (Spec);
2089 -- If we are processing the spec of the main unit, load bodies
2090 -- only if the with_clause indicates that it forced the loading
2091 -- of the body for a generic instantiation. Note that bodies of
2092 -- parents that are instances have been loaded already.
2094 if Present (Body_CU)
2095 and then Body_CU /= Main_CU
2096 and then Nkind (Unit (Body_CU)) /= N_Subprogram_Body
2097 and then Nkind (Unit (Comp)) /= N_Package_Declaration
2098 then
2099 Body_U := Get_Cunit_Unit_Number (Body_CU);
2101 if not Seen (Body_U)
2102 and then not Depends_On_Main (Body_CU)
2103 then
2104 Seen (Body_U) := True;
2105 Do_Withed_Units (Body_CU, Include_Limited => False);
2106 Do_Action (Body_CU, Unit (Body_CU));
2107 Done (Body_U) := True;
2108 end if;
2109 end if;
2110 end if;
2112 Next (Clause);
2113 end loop;
2114 end Process_Bodies_In_Context;
2116 -- Local Declarations
2118 Cur : Elmt_Id;
2120 -- Start of processing for Walk_Library_Items
2122 begin
2123 if Debug_Unit_Walk then
2124 Write_Line ("Walk_Library_Items:");
2125 Indent;
2126 end if;
2128 -- Do Standard first, then walk the Comp_Unit_List
2130 Do_Action (Empty, Standard_Package_Node);
2132 -- First place the context of all instance bodies on the corresponding
2133 -- spec, because it may be needed to analyze the code at the place of
2134 -- the instantiation.
2136 Cur := First_Elmt (Comp_Unit_List);
2137 while Present (Cur) loop
2138 declare
2139 CU : constant Node_Id := Node (Cur);
2140 N : constant Node_Id := Unit (CU);
2142 begin
2143 if Nkind (N) = N_Package_Body
2144 and then Is_Generic_Instance (Defining_Entity (N))
2145 then
2146 Append_List
2147 (Context_Items (CU), Context_Items (Library_Unit (CU)));
2148 end if;
2150 Next_Elmt (Cur);
2151 end;
2152 end loop;
2154 -- Now traverse compilation units (specs) in order
2156 Cur := First_Elmt (Comp_Unit_List);
2157 while Present (Cur) loop
2158 declare
2159 CU : constant Node_Id := Node (Cur);
2160 N : constant Node_Id := Unit (CU);
2161 Par : Entity_Id;
2163 begin
2164 pragma Assert (Nkind (CU) = N_Compilation_Unit);
2166 case Nkind (N) is
2168 -- If it is a subprogram body, process it if it has no
2169 -- separate spec.
2171 -- If it's a package body, ignore it, unless it is a body
2172 -- created for an instance that is the main unit. In the case
2173 -- of subprograms, the body is the wrapper package. In case of
2174 -- a package, the original file carries the body, and the spec
2175 -- appears as a later entry in the units list.
2177 -- Otherwise bodies appear in the list only because of inlining
2178 -- or instantiations, and they are processed only if relevant.
2179 -- The flag Withed_Body on a context clause indicates that a
2180 -- unit contains an instantiation that may be needed later,
2181 -- and therefore the body that contains the generic body (and
2182 -- its context) must be traversed immediately after the
2183 -- corresponding spec (see Do_Unit_And_Dependents).
2185 -- The main unit itself is processed separately after all other
2186 -- specs, and relevant bodies are examined in Process_Main.
2188 when N_Subprogram_Body =>
2189 if Acts_As_Spec (N) then
2190 Do_Unit_And_Dependents (CU, N);
2191 end if;
2193 when N_Package_Body =>
2194 if CU = Main_CU
2195 and then Nkind (Original_Node (Unit (Main_CU))) in
2196 N_Generic_Instantiation
2197 and then Present (Library_Unit (Main_CU))
2198 then
2199 Do_Unit_And_Dependents
2200 (Library_Unit (Main_CU),
2201 Unit (Library_Unit (Main_CU)));
2202 end if;
2204 -- It is a spec, process it, and the units it depends on,
2205 -- unless it is a descendant of the main unit. This can happen
2206 -- when the body of a parent depends on some other descendant.
2208 when N_Null_Statement =>
2210 -- Ignore an ignored ghost unit
2212 pragma Assert (Is_Ignored_Ghost_Node (Original_Node (N)));
2213 null;
2215 when others =>
2217 -- Skip spec of main unit for now, we want to process it
2218 -- after all other specs.
2220 if Nkind (Unit (CU)) = N_Package_Declaration
2221 and then Library_Unit (CU) = Main_CU
2222 and then CU /= Main_CU
2223 then
2224 Spec_CU := CU;
2225 else
2226 Par := Scope (Defining_Entity (Unit (CU)));
2228 if Is_Child_Unit (Defining_Entity (Unit (CU))) then
2229 while Present (Par)
2230 and then Par /= Standard_Standard
2231 and then Par /= Cunit_Entity (Main_Unit)
2232 loop
2233 Par := Scope (Par);
2234 end loop;
2235 end if;
2237 if Par /= Cunit_Entity (Main_Unit) then
2238 Do_Unit_And_Dependents (CU, N);
2239 end if;
2240 end if;
2241 end case;
2242 end;
2244 Next_Elmt (Cur);
2245 end loop;
2247 -- Now process main package spec if skipped
2249 if Present (Spec_CU) then
2250 Do_Unit_And_Dependents (Spec_CU, Unit (Spec_CU));
2251 end if;
2253 -- Now process package bodies on which main depends, followed by bodies
2254 -- of parents, if present, and finally main itself.
2256 if not Done (Main_Unit) then
2257 Do_Main := True;
2259 Process_Main : declare
2260 Parent_CU : Node_Id;
2261 Body_CU : Node_Id;
2262 Body_U : Unit_Number_Type;
2263 Child : Entity_Id;
2265 function Is_Subunit_Of_Main (U : Node_Id) return Boolean;
2266 -- If the main unit has subunits, their context may include
2267 -- bodies that are needed in the body of main. We must examine
2268 -- the context of the subunits, which are otherwise not made
2269 -- explicit in the main unit.
2271 ------------------------
2272 -- Is_Subunit_Of_Main --
2273 ------------------------
2275 function Is_Subunit_Of_Main (U : Node_Id) return Boolean is
2276 Lib : Node_Id;
2278 begin
2279 if Present (U) and then Nkind (Unit (U)) = N_Subunit then
2280 Lib := Library_Unit (U);
2281 return Lib = Main_CU or else Is_Subunit_Of_Main (Lib);
2282 else
2283 return False;
2284 end if;
2285 end Is_Subunit_Of_Main;
2287 -- Start of processing for Process_Main
2289 begin
2290 Process_Bodies_In_Context (Main_CU);
2292 for Unit_Num in Done'Range loop
2293 if Is_Subunit_Of_Main (Cunit (Unit_Num)) then
2294 Process_Bodies_In_Context (Cunit (Unit_Num));
2295 end if;
2296 end loop;
2298 -- If the main unit is a child unit, parent bodies may be present
2299 -- because they export instances or inlined subprograms. Check for
2300 -- presence of these, which are not present in context clauses.
2301 -- Note that if the parents are instances, their bodies have been
2302 -- processed before the main spec, because they may be needed
2303 -- therein, so the following loop only affects non-instances.
2305 if Is_Child_Unit (Cunit_Entity (Main_Unit)) then
2306 Child := Cunit_Entity (Main_Unit);
2307 while Is_Child_Unit (Child) loop
2308 Parent_CU :=
2309 Cunit (Get_Cunit_Entity_Unit_Number (Scope (Child)));
2310 Body_CU := Library_Unit (Parent_CU);
2312 if Present (Body_CU)
2313 and then not Seen (Get_Cunit_Unit_Number (Body_CU))
2314 and then not Depends_On_Main (Body_CU)
2315 then
2316 Body_U := Get_Cunit_Unit_Number (Body_CU);
2317 Seen (Body_U) := True;
2318 Do_Action (Body_CU, Unit (Body_CU));
2319 Done (Body_U) := True;
2320 end if;
2322 Child := Scope (Child);
2323 end loop;
2324 end if;
2326 Do_Action (Main_CU, Unit (Main_CU));
2327 Done (Main_Unit) := True;
2328 end Process_Main;
2329 end if;
2331 if Debug_Unit_Walk then
2332 if Done /= (Done'Range => True) then
2333 Write_Eol;
2334 Write_Line ("Ignored units:");
2336 Indent;
2338 for Unit_Num in Done'Range loop
2339 if not Done (Unit_Num) then
2341 -- Units with configuration pragmas (.ads files) have empty
2342 -- compilation-unit nodes; skip printing info about them.
2344 if Present (Cunit (Unit_Num)) then
2345 Write_Unit_Info
2346 (Unit_Num, Unit (Cunit (Unit_Num)), Withs => True);
2347 end if;
2348 end if;
2349 end loop;
2351 Outdent;
2352 end if;
2353 end if;
2355 pragma Assert (Done (Main_Unit));
2357 if Debug_Unit_Walk then
2358 Outdent;
2359 Write_Line ("end Walk_Library_Items.");
2360 end if;
2361 end Walk_Library_Items;
2363 ----------------
2364 -- Walk_Withs --
2365 ----------------
2367 procedure Walk_Withs (CU : Node_Id; Include_Limited : Boolean) is
2368 pragma Assert (Nkind (CU) = N_Compilation_Unit);
2369 pragma Assert (Nkind (Unit (CU)) /= N_Subunit);
2371 procedure Walk_Immediate is new Walk_Withs_Immediate (Action);
2373 begin
2374 -- First walk the withs immediately on the library item
2376 Walk_Immediate (CU, Include_Limited);
2378 -- For a body, we must also check for any subunits which belong to it
2379 -- and which have context clauses of their own, since these with'ed
2380 -- units are part of its own dependencies.
2382 if Nkind (Unit (CU)) in N_Unit_Body then
2383 for S in Main_Unit .. Last_Unit loop
2385 -- We are only interested in subunits. For preproc. data and def.
2386 -- files, Cunit is Empty, so we need to test that first.
2388 if Cunit (S) /= Empty
2389 and then Nkind (Unit (Cunit (S))) = N_Subunit
2390 then
2391 declare
2392 Pnode : Node_Id;
2394 begin
2395 Pnode := Library_Unit (Cunit (S));
2397 -- In -gnatc mode, the errors in the subunits will not have
2398 -- been recorded, but the analysis of the subunit may have
2399 -- failed, so just quit.
2401 if No (Pnode) then
2402 exit;
2403 end if;
2405 -- Find ultimate parent of the subunit
2407 while Nkind (Unit (Pnode)) = N_Subunit loop
2408 Pnode := Library_Unit (Pnode);
2409 end loop;
2411 -- See if it belongs to current unit, and if so, include its
2412 -- with_clauses. Do not process main unit prematurely.
2414 if Pnode = CU and then CU /= Cunit (Main_Unit) then
2415 Walk_Immediate (Cunit (S), Include_Limited);
2416 end if;
2417 end;
2418 end if;
2419 end loop;
2420 end if;
2421 end Walk_Withs;
2423 --------------------------
2424 -- Walk_Withs_Immediate --
2425 --------------------------
2427 procedure Walk_Withs_Immediate (CU : Node_Id; Include_Limited : Boolean) is
2428 pragma Assert (Nkind (CU) = N_Compilation_Unit);
2430 Context_Item : Node_Id;
2431 Lib_Unit : Node_Id;
2433 begin
2434 Context_Item := First (Context_Items (CU));
2435 while Present (Context_Item) loop
2436 if Nkind (Context_Item) = N_With_Clause
2437 and then (Include_Limited
2438 or else not Limited_Present (Context_Item))
2439 then
2440 Lib_Unit := Library_Unit (Context_Item);
2441 Action (Lib_Unit);
2442 end if;
2444 Next (Context_Item);
2445 end loop;
2446 end Walk_Withs_Immediate;
2448 end Sem;