1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2018, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. 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. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
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
;
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)
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.
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.
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.
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
103 procedure Analyze
(N
: Node_Id
) is
104 Saved_GM
: constant Ghost_Mode_Type
:= Ghost_Mode
;
105 Saved_IGR
: constant Node_Id
:= Ignored_Ghost_Region
;
106 -- Save the Ghost-related attributes to restore on exit
109 Debug_A_Entry
("analyzing ", N
);
111 -- Immediate return if already analyzed
114 Debug_A_Exit
("analyzing ", N
, " (done, analyzed already)");
118 -- A declaration may be subject to pragma Ghost. Set the mode now to
119 -- ensure that any nodes generated during analysis and expansion are
122 if Is_Declaration
(N
) then
123 Mark_And_Set_Ghost_Declaration
(N
);
126 -- Otherwise processing depends on the node kind
129 when N_Abort_Statement
=>
130 Analyze_Abort_Statement
(N
);
132 when N_Abstract_Subprogram_Declaration
=>
133 Analyze_Abstract_Subprogram_Declaration
(N
);
135 when N_Accept_Alternative
=>
136 Analyze_Accept_Alternative
(N
);
138 when N_Accept_Statement
=>
139 Analyze_Accept_Statement
(N
);
142 Analyze_Aggregate
(N
);
145 Analyze_Allocator
(N
);
148 Analyze_Short_Circuit
(N
);
150 when N_Assignment_Statement
=>
151 Analyze_Assignment
(N
);
153 when N_Asynchronous_Select
=>
154 Analyze_Asynchronous_Select
(N
);
157 Analyze_At_Clause
(N
);
159 when N_Attribute_Reference
=>
160 Analyze_Attribute
(N
);
162 when N_Attribute_Definition_Clause
=>
163 Analyze_Attribute_Definition_Clause
(N
);
165 when N_Block_Statement
=>
166 Analyze_Block_Statement
(N
);
168 when N_Case_Expression
=>
169 Analyze_Case_Expression
(N
);
171 when N_Case_Statement
=>
172 Analyze_Case_Statement
(N
);
174 when N_Character_Literal
=>
175 Analyze_Character_Literal
(N
);
177 when N_Code_Statement
=>
178 Analyze_Code_Statement
(N
);
180 when N_Compilation_Unit
=>
181 Analyze_Compilation_Unit
(N
);
183 when N_Component_Declaration
=>
184 Analyze_Component_Declaration
(N
);
186 when N_Compound_Statement
=>
187 Analyze_Compound_Statement
(N
);
189 when N_Conditional_Entry_Call
=>
190 Analyze_Conditional_Entry_Call
(N
);
192 when N_Delay_Alternative
=>
193 Analyze_Delay_Alternative
(N
);
195 when N_Delay_Relative_Statement
=>
196 Analyze_Delay_Relative
(N
);
198 when N_Delay_Until_Statement
=>
199 Analyze_Delay_Until
(N
);
201 when N_Delta_Aggregate
=>
202 Analyze_Aggregate
(N
);
205 Analyze_Entry_Body
(N
);
207 when N_Entry_Body_Formal_Part
=>
208 Analyze_Entry_Body_Formal_Part
(N
);
210 when N_Entry_Call_Alternative
=>
211 Analyze_Entry_Call_Alternative
(N
);
213 when N_Entry_Declaration
=>
214 Analyze_Entry_Declaration
(N
);
216 when N_Entry_Index_Specification
=>
217 Analyze_Entry_Index_Specification
(N
);
219 when N_Enumeration_Representation_Clause
=>
220 Analyze_Enumeration_Representation_Clause
(N
);
222 when N_Exception_Declaration
=>
223 Analyze_Exception_Declaration
(N
);
225 when N_Exception_Renaming_Declaration
=>
226 Analyze_Exception_Renaming
(N
);
228 when N_Exit_Statement
=>
229 Analyze_Exit_Statement
(N
);
231 when N_Expanded_Name
=>
232 Analyze_Expanded_Name
(N
);
234 when N_Explicit_Dereference
=>
235 Analyze_Explicit_Dereference
(N
);
237 when N_Expression_Function
=>
238 Analyze_Expression_Function
(N
);
240 when N_Expression_With_Actions
=>
241 Analyze_Expression_With_Actions
(N
);
243 when N_Extended_Return_Statement
=>
244 Analyze_Extended_Return_Statement
(N
);
246 when N_Extension_Aggregate
=>
247 Analyze_Aggregate
(N
);
249 when N_Formal_Object_Declaration
=>
250 Analyze_Formal_Object_Declaration
(N
);
252 when N_Formal_Package_Declaration
=>
253 Analyze_Formal_Package_Declaration
(N
);
255 when N_Formal_Subprogram_Declaration
=>
256 Analyze_Formal_Subprogram_Declaration
(N
);
258 when N_Formal_Type_Declaration
=>
259 Analyze_Formal_Type_Declaration
(N
);
261 when N_Free_Statement
=>
262 Analyze_Free_Statement
(N
);
264 when N_Freeze_Entity
=>
265 Analyze_Freeze_Entity
(N
);
267 when N_Freeze_Generic_Entity
=>
268 Analyze_Freeze_Generic_Entity
(N
);
270 when N_Full_Type_Declaration
=>
271 Analyze_Full_Type_Declaration
(N
);
273 when N_Function_Call
=>
274 Analyze_Function_Call
(N
);
276 when N_Function_Instantiation
=>
277 Analyze_Function_Instantiation
(N
);
279 when N_Generic_Function_Renaming_Declaration
=>
280 Analyze_Generic_Function_Renaming
(N
);
282 when N_Generic_Package_Declaration
=>
283 Analyze_Generic_Package_Declaration
(N
);
285 when N_Generic_Package_Renaming_Declaration
=>
286 Analyze_Generic_Package_Renaming
(N
);
288 when N_Generic_Procedure_Renaming_Declaration
=>
289 Analyze_Generic_Procedure_Renaming
(N
);
291 when N_Generic_Subprogram_Declaration
=>
292 Analyze_Generic_Subprogram_Declaration
(N
);
294 when N_Goto_Statement
=>
295 Analyze_Goto_Statement
(N
);
297 when N_Handled_Sequence_Of_Statements
=>
298 Analyze_Handled_Statements
(N
);
301 Analyze_Identifier
(N
);
303 when N_If_Expression
=>
304 Analyze_If_Expression
(N
);
306 when N_If_Statement
=>
307 Analyze_If_Statement
(N
);
309 when N_Implicit_Label_Declaration
=>
310 Analyze_Implicit_Label_Declaration
(N
);
313 Analyze_Membership_Op
(N
);
315 when N_Incomplete_Type_Declaration
=>
316 Analyze_Incomplete_Type_Decl
(N
);
318 when N_Indexed_Component
=>
319 Analyze_Indexed_Component_Form
(N
);
321 when N_Integer_Literal
=>
322 Analyze_Integer_Literal
(N
);
324 when N_Iterator_Specification
=>
325 Analyze_Iterator_Specification
(N
);
327 when N_Itype_Reference
=>
328 Analyze_Itype_Reference
(N
);
333 when N_Loop_Parameter_Specification
=>
334 Analyze_Loop_Parameter_Specification
(N
);
336 when N_Loop_Statement
=>
337 Analyze_Loop_Statement
(N
);
340 Analyze_Membership_Op
(N
);
345 when N_Null_Statement
=>
346 Analyze_Null_Statement
(N
);
348 when N_Number_Declaration
=>
349 Analyze_Number_Declaration
(N
);
351 when N_Object_Declaration
=>
352 Analyze_Object_Declaration
(N
);
354 when N_Object_Renaming_Declaration
=>
355 Analyze_Object_Renaming
(N
);
357 when N_Operator_Symbol
=>
358 Analyze_Operator_Symbol
(N
);
361 Analyze_Unary_Op
(N
);
364 Analyze_Arithmetic_Op
(N
);
367 Analyze_Logical_Op
(N
);
370 Analyze_Concatenation
(N
);
373 Analyze_Arithmetic_Op
(N
);
376 Analyze_Equality_Op
(N
);
379 Analyze_Arithmetic_Op
(N
);
382 Analyze_Comparison_Op
(N
);
385 Analyze_Comparison_Op
(N
);
388 Analyze_Comparison_Op
(N
);
391 Analyze_Comparison_Op
(N
);
394 Analyze_Unary_Op
(N
);
399 when N_Op_Multiply
=>
400 Analyze_Arithmetic_Op
(N
);
403 Analyze_Equality_Op
(N
);
406 Analyze_Negation
(N
);
409 Analyze_Logical_Op
(N
);
412 Analyze_Unary_Op
(N
);
415 Analyze_Arithmetic_Op
(N
);
417 when N_Op_Rotate_Left
=>
418 Analyze_Arithmetic_Op
(N
);
420 when N_Op_Rotate_Right
=>
421 Analyze_Arithmetic_Op
(N
);
423 when N_Op_Shift_Left
=>
424 Analyze_Arithmetic_Op
(N
);
426 when N_Op_Shift_Right
=>
427 Analyze_Arithmetic_Op
(N
);
429 when N_Op_Shift_Right_Arithmetic
=>
430 Analyze_Arithmetic_Op
(N
);
432 when N_Op_Subtract
=>
433 Analyze_Arithmetic_Op
(N
);
436 Analyze_Logical_Op
(N
);
439 Analyze_Short_Circuit
(N
);
441 when N_Others_Choice
=>
442 Analyze_Others_Choice
(N
);
444 when N_Package_Body
=>
445 Analyze_Package_Body
(N
);
447 when N_Package_Body_Stub
=>
448 Analyze_Package_Body_Stub
(N
);
450 when N_Package_Declaration
=>
451 Analyze_Package_Declaration
(N
);
453 when N_Package_Instantiation
=>
454 Analyze_Package_Instantiation
(N
);
456 when N_Package_Renaming_Declaration
=>
457 Analyze_Package_Renaming
(N
);
459 when N_Package_Specification
=>
460 Analyze_Package_Specification
(N
);
462 when N_Parameter_Association
=>
463 Analyze_Parameter_Association
(N
);
468 when N_Private_Extension_Declaration
=>
469 Analyze_Private_Extension_Declaration
(N
);
471 when N_Private_Type_Declaration
=>
472 Analyze_Private_Type_Declaration
(N
);
474 when N_Procedure_Call_Statement
=>
475 Analyze_Procedure_Call
(N
);
477 when N_Procedure_Instantiation
=>
478 Analyze_Procedure_Instantiation
(N
);
480 when N_Protected_Body
=>
481 Analyze_Protected_Body
(N
);
483 when N_Protected_Body_Stub
=>
484 Analyze_Protected_Body_Stub
(N
);
486 when N_Protected_Definition
=>
487 Analyze_Protected_Definition
(N
);
489 when N_Protected_Type_Declaration
=>
490 Analyze_Protected_Type_Declaration
(N
);
492 when N_Qualified_Expression
=>
493 Analyze_Qualified_Expression
(N
);
495 when N_Quantified_Expression
=>
496 Analyze_Quantified_Expression
(N
);
498 when N_Raise_Expression
=>
499 Analyze_Raise_Expression
(N
);
501 when N_Raise_Statement
=>
502 Analyze_Raise_Statement
(N
);
504 when N_Raise_xxx_Error
=>
505 Analyze_Raise_xxx_Error
(N
);
510 when N_Range_Constraint
=>
511 Analyze_Range
(Range_Expression
(N
));
513 when N_Real_Literal
=>
514 Analyze_Real_Literal
(N
);
516 when N_Record_Representation_Clause
=>
517 Analyze_Record_Representation_Clause
(N
);
520 Analyze_Reference
(N
);
522 when N_Requeue_Statement
=>
525 when N_Simple_Return_Statement
=>
526 Analyze_Simple_Return_Statement
(N
);
528 when N_Selected_Component
=>
529 Find_Selected_Component
(N
);
530 -- ??? why not Analyze_Selected_Component, needs comments
532 when N_Selective_Accept
=>
533 Analyze_Selective_Accept
(N
);
535 when N_Single_Protected_Declaration
=>
536 Analyze_Single_Protected_Declaration
(N
);
538 when N_Single_Task_Declaration
=>
539 Analyze_Single_Task_Declaration
(N
);
544 when N_String_Literal
=>
545 Analyze_String_Literal
(N
);
547 when N_Subprogram_Body
=>
548 Analyze_Subprogram_Body
(N
);
550 when N_Subprogram_Body_Stub
=>
551 Analyze_Subprogram_Body_Stub
(N
);
553 when N_Subprogram_Declaration
=>
554 Analyze_Subprogram_Declaration
(N
);
556 when N_Subprogram_Renaming_Declaration
=>
557 Analyze_Subprogram_Renaming
(N
);
559 when N_Subtype_Declaration
=>
560 Analyze_Subtype_Declaration
(N
);
562 when N_Subtype_Indication
=>
563 Analyze_Subtype_Indication
(N
);
568 when N_Target_Name
=>
569 Analyze_Target_Name
(N
);
572 Analyze_Task_Body
(N
);
574 when N_Task_Body_Stub
=>
575 Analyze_Task_Body_Stub
(N
);
577 when N_Task_Definition
=>
578 Analyze_Task_Definition
(N
);
580 when N_Task_Type_Declaration
=>
581 Analyze_Task_Type_Declaration
(N
);
583 when N_Terminate_Alternative
=>
584 Analyze_Terminate_Alternative
(N
);
586 when N_Timed_Entry_Call
=>
587 Analyze_Timed_Entry_Call
(N
);
589 when N_Triggering_Alternative
=>
590 Analyze_Triggering_Alternative
(N
);
592 when N_Type_Conversion
=>
593 Analyze_Type_Conversion
(N
);
595 when N_Unchecked_Expression
=>
596 Analyze_Unchecked_Expression
(N
);
598 when N_Unchecked_Type_Conversion
=>
599 Analyze_Unchecked_Type_Conversion
(N
);
601 when N_Use_Package_Clause
=>
602 Analyze_Use_Package
(N
);
604 when N_Use_Type_Clause
=>
605 Analyze_Use_Type
(N
);
607 when N_Validate_Unchecked_Conversion
=>
610 when N_Variant_Part
=>
611 Analyze_Variant_Part
(N
);
613 when N_With_Clause
=>
614 Analyze_With_Clause
(N
);
616 -- A call to analyze a marker is ignored because the node does not
617 -- have any static and run-time semantics.
620 | N_Variable_Reference_Marker
624 -- A call to analyze the Empty node is an error, but most likely it
625 -- is an error caused by an attempt to analyze a malformed piece of
626 -- tree caused by some other error, so if there have been any other
627 -- errors, we just ignore it, otherwise it is a real internal error
628 -- which we complain about.
630 -- We must also consider the case of call to a runtime function that
631 -- is not available in the configurable runtime.
634 pragma Assert
(Serious_Errors_Detected
/= 0
635 or else Configurable_Run_Time_Violations
/= 0);
638 -- A call to analyze the error node is simply ignored, to avoid
639 -- causing cascaded errors (happens of course only in error cases)
640 -- Disable expansion in case it is still enabled, to prevent other
641 -- subsequent compiler glitches.
644 Expander_Mode_Save_And_Set
(False);
647 -- Push/Pop nodes normally don't come through an analyze call. An
648 -- exception is the dummy ones bracketing a subprogram body. In any
649 -- case there is nothing to be done to analyze such nodes.
651 when N_Push_Pop_xxx_Label
=>
654 -- SCIL nodes don't need analysis because they are decorated when
655 -- they are built. They are added to the tree by Insert_Actions and
656 -- the call to analyze them is generated when the full list is
659 when N_SCIL_Dispatch_Table_Tag_Init
660 | N_SCIL_Dispatching_Call
661 | N_SCIL_Membership_Test
665 -- A quantified expression with a missing "all" or "some" qualifier
666 -- looks identical to an iterated component association. By language
667 -- definition, the latter must be present within array aggregates. If
668 -- this is not the case, then the iterated component association is
669 -- really an illegal quantified expression. Diagnose this scenario.
671 when N_Iterated_Component_Association
=>
672 Diagnose_Iterated_Component_Association
(N
);
674 -- For the remaining node types, we generate compiler abort, because
675 -- these nodes are always analyzed within the Sem_Chn routines and
676 -- there should never be a case of making a call to the main Analyze
677 -- routine for these node kinds. For example, an N_Access_Definition
678 -- node appears only in the context of a type declaration, and is
679 -- processed by the analyze routine for type declarations.
681 when N_Abortable_Part
682 | N_Access_Definition
683 | N_Access_Function_Definition
684 | N_Access_Procedure_Definition
685 | N_Access_To_Object_Definition
686 | N_Aspect_Specification
687 | N_Case_Expression_Alternative
688 | N_Case_Statement_Alternative
689 | N_Compilation_Unit_Aux
690 | N_Component_Association
692 | N_Component_Definition
694 | N_Constrained_Array_Definition
696 | N_Decimal_Fixed_Point_Definition
697 | N_Defining_Character_Literal
698 | N_Defining_Identifier
699 | N_Defining_Operator_Symbol
700 | N_Defining_Program_Unit_Name
702 | N_Derived_Type_Definition
704 | N_Digits_Constraint
705 | N_Discriminant_Association
706 | N_Discriminant_Specification
708 | N_Entry_Call_Statement
709 | N_Enumeration_Type_Definition
710 | N_Exception_Handler
711 | N_Floating_Point_Definition
712 | N_Formal_Decimal_Fixed_Point_Definition
713 | N_Formal_Derived_Type_Definition
714 | N_Formal_Discrete_Type_Definition
715 | N_Formal_Floating_Point_Definition
716 | N_Formal_Modular_Type_Definition
717 | N_Formal_Ordinary_Fixed_Point_Definition
718 | N_Formal_Private_Type_Definition
719 | N_Formal_Incomplete_Type_Definition
720 | N_Formal_Signed_Integer_Type_Definition
721 | N_Function_Specification
722 | N_Generic_Association
723 | N_Index_Or_Discriminant_Constraint
726 | N_Modular_Type_Definition
727 | N_Ordinary_Fixed_Point_Definition
728 | N_Parameter_Specification
729 | N_Pragma_Argument_Association
730 | N_Procedure_Specification
731 | N_Real_Range_Specification
732 | N_Record_Definition
733 | N_Signed_Integer_Type_Definition
734 | N_Unconstrained_Array_Definition
742 Debug_A_Exit
("analyzing ", N
, " (done)");
744 -- Mark relevant use-type and use-package clauses as effective
745 -- preferring the original node over the analyzed one in the case that
746 -- constant folding has occurred and removed references that need to be
747 -- examined. Also, if the node in question is overloaded then this is
748 -- deferred until resolution.
751 Operat
: Node_Id
:= Empty
;
753 -- Attempt to obtain a checkable operator node
755 if Nkind
(Original_Node
(N
)) in N_Op
then
756 Operat
:= Original_Node
(N
);
757 elsif Nkind
(N
) in N_Op
then
764 and then Present
(Entity
(Operat
))
765 and then not Is_Overloaded
(Operat
)
767 Mark_Use_Clauses
(Operat
);
771 -- Now that we have analyzed the node, we call the expander to perform
772 -- possible expansion. We skip this for subexpressions, because we don't
773 -- have the type yet, and the expander will need to know the type before
774 -- it can do its job. For subexpression nodes, the call to the expander
775 -- happens in Sem_Res.Resolve. A special exception is Raise_xxx_Error,
776 -- which can appear in a statement context, and needs expanding now in
777 -- the case (distinguished by Etype, as documented in Sinfo).
779 -- The Analyzed flag is also set at this point for non-subexpression
780 -- nodes (in the case of subexpression nodes, we can't set the flag yet,
781 -- since resolution and expansion have not yet been completed). Note
782 -- that for N_Raise_xxx_Error we have to distinguish the expression
783 -- case from the statement case.
785 if Nkind
(N
) not in N_Subexpr
786 or else (Nkind
(N
) in N_Raise_xxx_Error
787 and then Etype
(N
) = Standard_Void_Type
)
791 -- Replace a reference to a renaming with the renamed object for SPARK.
792 -- In general this modification is performed by Expand_SPARK, however
793 -- certain constructs may not reach the resolution or expansion phase
794 -- and thus remain unchanged. The replacement is not performed when the
795 -- construct is overloaded as resolution must first take place. This is
796 -- also not done when analyzing a generic to preserve the original tree
797 -- and because the reference may become overloaded in the instance.
800 and then Nkind_In
(N
, N_Expanded_Name
, N_Identifier
)
801 and then not Is_Overloaded
(N
)
802 and then not Inside_A_Generic
804 Expand_SPARK_Potential_Renaming
(N
);
807 Restore_Ghost_Region
(Saved_GM
, Saved_IGR
);
810 -- Version with check(s) suppressed
812 procedure Analyze
(N
: Node_Id
; Suppress
: Check_Id
) is
814 if Suppress
= All_Checks
then
816 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
818 Scope_Suppress
.Suppress
:= (others => True);
820 Scope_Suppress
.Suppress
:= Svs
;
823 elsif Suppress
= Overflow_Check
then
825 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
827 Scope_Suppress
.Suppress
(Suppress
) := True;
829 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
838 procedure Analyze_List
(L
: List_Id
) is
843 while Present
(Node
) loop
849 -- Version with check(s) suppressed
851 procedure Analyze_List
(L
: List_Id
; Suppress
: Check_Id
) is
853 if Suppress
= All_Checks
then
855 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
857 Scope_Suppress
.Suppress
:= (others => True);
859 Scope_Suppress
.Suppress
:= Svs
;
864 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
866 Scope_Suppress
.Suppress
(Suppress
) := True;
868 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
873 --------------------------
874 -- Copy_Suppress_Status --
875 --------------------------
877 procedure Copy_Suppress_Status
883 pragma Warnings
(Off
, Found
);
885 procedure Search_Stack
886 (Top
: Suppress_Stack_Entry_Ptr
;
887 Found
: out Boolean);
888 -- Search given suppress stack for matching entry for entity. If found
889 -- then set Checks_May_Be_Suppressed on To, and push an appropriate
890 -- entry for To onto the local suppress stack.
896 procedure Search_Stack
897 (Top
: Suppress_Stack_Entry_Ptr
;
900 Ptr
: Suppress_Stack_Entry_Ptr
;
904 while Ptr
/= null loop
906 and then (Ptr
.Check
= All_Checks
or else Ptr
.Check
= C
)
909 Set_Checks_May_Be_Suppressed
(To
, True);
910 Push_Local_Suppress_Stack_Entry
926 -- Start of processing for Copy_Suppress_Status
929 if not Checks_May_Be_Suppressed
(From
) then
933 -- First search the global entity suppress table for a matching entry.
934 -- We also search this in reverse order so that if there are multiple
935 -- pragmas for the same entity, the last one applies.
937 Search_Stack
(Global_Suppress_Stack_Top
, Found
);
943 -- Now search the local entity suppress stack, we search this in
944 -- reverse order so that we get the innermost entry that applies to
945 -- this case if there are nested entries. Note that for the purpose
946 -- of this procedure we are ONLY looking for entries corresponding
947 -- to a two-argument Suppress, where the second argument matches From.
949 Search_Stack
(Local_Suppress_Stack_Top
, Found
);
950 end Copy_Suppress_Status
;
952 -------------------------
953 -- Enter_Generic_Scope --
954 -------------------------
956 procedure Enter_Generic_Scope
(S
: Entity_Id
) is
958 if No
(Outer_Generic_Scope
) then
959 Outer_Generic_Scope
:= S
;
961 end Enter_Generic_Scope
;
963 ------------------------
964 -- Exit_Generic_Scope --
965 ------------------------
967 procedure Exit_Generic_Scope
(S
: Entity_Id
) is
969 if S
= Outer_Generic_Scope
then
970 Outer_Generic_Scope
:= Empty
;
972 end Exit_Generic_Scope
;
974 -----------------------
975 -- Explicit_Suppress --
976 -----------------------
978 function Explicit_Suppress
(E
: Entity_Id
; C
: Check_Id
) return Boolean is
979 Ptr
: Suppress_Stack_Entry_Ptr
;
982 if not Checks_May_Be_Suppressed
(E
) then
986 Ptr
:= Global_Suppress_Stack_Top
;
987 while Ptr
/= null loop
989 and then (Ptr
.Check
= All_Checks
or else Ptr
.Check
= C
)
999 end Explicit_Suppress
;
1001 -----------------------------
1002 -- External_Ref_In_Generic --
1003 -----------------------------
1005 function External_Ref_In_Generic
(E
: Entity_Id
) return Boolean is
1009 -- Entity is global if defined outside of current outer_generic_scope:
1010 -- Either the entity has a smaller depth that the outer generic, or it
1011 -- is in a different compilation unit, or it is defined within a unit
1012 -- in the same compilation, that is not within the outer_generic.
1014 if No
(Outer_Generic_Scope
) then
1017 elsif Scope_Depth
(Scope
(E
)) < Scope_Depth
(Outer_Generic_Scope
)
1018 or else not In_Same_Source_Unit
(E
, Outer_Generic_Scope
)
1024 while Present
(Scop
) loop
1025 if Scop
= Outer_Generic_Scope
then
1027 elsif Scope_Depth
(Scop
) < Scope_Depth
(Outer_Generic_Scope
) then
1030 Scop
:= Scope
(Scop
);
1036 end External_Ref_In_Generic
;
1042 procedure Initialize
is
1043 Next
: Suppress_Stack_Entry_Ptr
;
1045 procedure Free
is new Unchecked_Deallocation
1046 (Suppress_Stack_Entry
, Suppress_Stack_Entry_Ptr
);
1049 -- Free any global suppress stack entries from a previous invocation
1050 -- of the compiler (in the normal case this loop does nothing).
1052 while Suppress_Stack_Entries
/= null loop
1053 Next
:= Suppress_Stack_Entries
.Next
;
1054 Free
(Suppress_Stack_Entries
);
1055 Suppress_Stack_Entries
:= Next
;
1058 Local_Suppress_Stack_Top
:= null;
1059 Global_Suppress_Stack_Top
:= null;
1061 -- Clear scope stack, and reset global variables
1064 Unloaded_Subunits
:= False;
1067 ------------------------------
1068 -- Insert_After_And_Analyze --
1069 ------------------------------
1071 procedure Insert_After_And_Analyze
(N
: Node_Id
; M
: Node_Id
) is
1077 -- If we are not at the end of the list, then the easiest
1078 -- coding is simply to insert before our successor.
1080 if Present
(Next
(N
)) then
1081 Insert_Before_And_Analyze
(Next
(N
), M
);
1083 -- Case of inserting at the end of the list
1086 -- Capture the Node_Id of the node to be inserted. This Node_Id
1087 -- will still be the same after the insert operation.
1090 Insert_After
(N
, M
);
1092 -- Now just analyze from the inserted node to the end of
1093 -- the new list (note that this properly handles the case
1094 -- where any of the analyze calls result in the insertion of
1095 -- nodes after the analyzed node, expecting analysis).
1097 while Present
(Node
) loop
1099 Mark_Rewrite_Insertion
(Node
);
1104 end Insert_After_And_Analyze
;
1106 -- Version with check(s) suppressed
1108 procedure Insert_After_And_Analyze
1111 Suppress
: Check_Id
)
1114 if Suppress
= All_Checks
then
1116 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
1118 Scope_Suppress
.Suppress
:= (others => True);
1119 Insert_After_And_Analyze
(N
, M
);
1120 Scope_Suppress
.Suppress
:= Svs
;
1125 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
1127 Scope_Suppress
.Suppress
(Suppress
) := True;
1128 Insert_After_And_Analyze
(N
, M
);
1129 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
1132 end Insert_After_And_Analyze
;
1134 -------------------------------
1135 -- Insert_Before_And_Analyze --
1136 -------------------------------
1138 procedure Insert_Before_And_Analyze
(N
: Node_Id
; M
: Node_Id
) is
1144 -- Capture the Node_Id of the first list node to be inserted.
1145 -- This will still be the first node after the insert operation,
1146 -- since Insert_List_After does not modify the Node_Id values.
1149 Insert_Before
(N
, M
);
1151 -- The insertion does not change the Id's of any of the nodes in
1152 -- the list, and they are still linked, so we can simply loop from
1153 -- the original first node until we meet the node before which the
1154 -- insertion is occurring. Note that this properly handles the case
1155 -- where any of the analyzed nodes insert nodes after themselves,
1156 -- expecting them to get analyzed.
1158 while Node
/= N
loop
1160 Mark_Rewrite_Insertion
(Node
);
1164 end Insert_Before_And_Analyze
;
1166 -- Version with check(s) suppressed
1168 procedure Insert_Before_And_Analyze
1171 Suppress
: Check_Id
)
1174 if Suppress
= All_Checks
then
1176 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
1178 Scope_Suppress
.Suppress
:= (others => True);
1179 Insert_Before_And_Analyze
(N
, M
);
1180 Scope_Suppress
.Suppress
:= Svs
;
1185 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
1187 Scope_Suppress
.Suppress
(Suppress
) := True;
1188 Insert_Before_And_Analyze
(N
, M
);
1189 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
1192 end Insert_Before_And_Analyze
;
1194 -----------------------------------
1195 -- Insert_List_After_And_Analyze --
1196 -----------------------------------
1198 procedure Insert_List_After_And_Analyze
(N
: Node_Id
; L
: List_Id
) is
1199 After
: constant Node_Id
:= Next
(N
);
1203 if Is_Non_Empty_List
(L
) then
1205 -- Capture the Node_Id of the first list node to be inserted.
1206 -- This will still be the first node after the insert operation,
1207 -- since Insert_List_After does not modify the Node_Id values.
1210 Insert_List_After
(N
, L
);
1212 -- Now just analyze from the original first node until we get to the
1213 -- successor of the original insertion point (which may be Empty if
1214 -- the insertion point was at the end of the list). Note that this
1215 -- properly handles the case where any of the analyze calls result in
1216 -- the insertion of nodes after the analyzed node (possibly calling
1217 -- this routine recursively).
1219 while Node
/= After
loop
1221 Mark_Rewrite_Insertion
(Node
);
1225 end Insert_List_After_And_Analyze
;
1227 ------------------------------------
1228 -- Insert_List_Before_And_Analyze --
1229 ------------------------------------
1231 procedure Insert_List_Before_And_Analyze
(N
: Node_Id
; L
: List_Id
) is
1235 if Is_Non_Empty_List
(L
) then
1237 -- Capture the Node_Id of the first list node to be inserted. This
1238 -- will still be the first node after the insert operation, since
1239 -- Insert_List_After does not modify the Node_Id values.
1242 Insert_List_Before
(N
, L
);
1244 -- The insertion does not change the Id's of any of the nodes in
1245 -- the list, and they are still linked, so we can simply loop from
1246 -- the original first node until we meet the node before which the
1247 -- insertion is occurring. Note that this properly handles the case
1248 -- where any of the analyzed nodes insert nodes after themselves,
1249 -- expecting them to get analyzed.
1251 while Node
/= N
loop
1253 Mark_Rewrite_Insertion
(Node
);
1257 end Insert_List_Before_And_Analyze
;
1265 Scope_Stack
.Release
;
1266 Scope_Stack
.Locked
:= True;
1269 ------------------------
1270 -- Preanalysis_Active --
1271 ------------------------
1273 function Preanalysis_Active
return Boolean is
1275 return not Full_Analysis
and not Expander_Active
;
1276 end Preanalysis_Active
;
1282 procedure Preanalyze
(N
: Node_Id
) is
1283 Save_Full_Analysis
: constant Boolean := Full_Analysis
;
1286 Full_Analysis
:= False;
1287 Expander_Mode_Save_And_Set
(False);
1291 Expander_Mode_Restore
;
1292 Full_Analysis
:= Save_Full_Analysis
;
1295 --------------------------------------
1296 -- Push_Global_Suppress_Stack_Entry --
1297 --------------------------------------
1299 procedure Push_Global_Suppress_Stack_Entry
1300 (Entity
: Entity_Id
;
1305 Global_Suppress_Stack_Top
:=
1306 new Suppress_Stack_Entry
'
1309 Suppress => Suppress,
1310 Prev => Global_Suppress_Stack_Top,
1311 Next => Suppress_Stack_Entries);
1312 Suppress_Stack_Entries := Global_Suppress_Stack_Top;
1314 end Push_Global_Suppress_Stack_Entry;
1316 -------------------------------------
1317 -- Push_Local_Suppress_Stack_Entry --
1318 -------------------------------------
1320 procedure Push_Local_Suppress_Stack_Entry
1321 (Entity : Entity_Id;
1326 Local_Suppress_Stack_Top :=
1327 new Suppress_Stack_Entry'
1330 Suppress
=> Suppress
,
1331 Prev
=> Local_Suppress_Stack_Top
,
1332 Next
=> Suppress_Stack_Entries
);
1333 Suppress_Stack_Entries
:= Local_Suppress_Stack_Top
;
1336 end Push_Local_Suppress_Stack_Entry
;
1342 procedure Semantics
(Comp_Unit
: Node_Id
) is
1343 procedure Do_Analyze
;
1344 -- Perform the analysis of the compilation unit
1350 -- WARNING: This routine manages Ghost regions. Return statements must
1351 -- be replaced by gotos which jump to the end of the routine and restore
1354 procedure Do_Analyze
is
1355 Saved_GM
: constant Ghost_Mode_Type
:= Ghost_Mode
;
1356 Saved_IGR
: constant Node_Id
:= Ignored_Ghost_Region
;
1357 -- Save the Ghost-related attributes to restore on exit
1359 -- Generally style checks are preserved across compilations, with
1360 -- one exception: s-oscons.ads, which allows arbitrary long lines
1361 -- unconditionally, and has no restore mechanism, because it is
1362 -- intended as a lowest-level Pure package.
1364 Saved_ML
: constant Int
:= Style_Max_Line_Length
;
1369 List
:= Save_Scope_Stack
;
1370 Push_Scope
(Standard_Standard
);
1372 -- Set up a clean environment before analyzing
1374 Install_Ghost_Region
(None
, Empty
);
1376 Outer_Generic_Scope
:= Empty
;
1377 Scope_Suppress
:= Suppress_Options
;
1379 (Scope_Stack
.Last
).Component_Alignment_Default
:=
1380 Configuration_Component_Alignment
;
1382 (Scope_Stack
.Last
).Is_Active_Stack_Base
:= True;
1384 -- Now analyze the top level compilation unit node
1386 Analyze
(Comp_Unit
);
1388 -- Check for scope mismatch on exit from compilation
1390 pragma Assert
(Current_Scope
= Standard_Standard
1391 or else Comp_Unit
= Cunit
(Main_Unit
));
1393 -- Then pop entry for Standard, and pop implicit types
1396 Restore_Scope_Stack
(List
);
1397 Restore_Ghost_Region
(Saved_GM
, Saved_IGR
);
1398 Style_Max_Line_Length
:= Saved_ML
;
1403 -- The following locations save the corresponding global flags and
1404 -- variables so that they can be restored on completion. This is needed
1405 -- so that calls to Rtsfind start with the proper default values for
1406 -- these variables, and also that such calls do not disturb the settings
1407 -- for units being analyzed at a higher level.
1409 S_Current_Sem_Unit
: constant Unit_Number_Type
:= Current_Sem_Unit
;
1410 S_Full_Analysis
: constant Boolean := Full_Analysis
;
1411 S_GNAT_Mode
: constant Boolean := GNAT_Mode
;
1412 S_Global_Dis_Names
: constant Boolean := Global_Discard_Names
;
1413 S_In_Assertion_Expr
: constant Nat
:= In_Assertion_Expr
;
1414 S_In_Default_Expr
: constant Boolean := In_Default_Expr
;
1415 S_In_Spec_Expr
: constant Boolean := In_Spec_Expression
;
1416 S_Inside_A_Generic
: constant Boolean := Inside_A_Generic
;
1417 S_Outer_Gen_Scope
: constant Entity_Id
:= Outer_Generic_Scope
;
1418 S_Style_Check
: constant Boolean := Style_Check
;
1420 Already_Analyzed
: constant Boolean := Analyzed
(Comp_Unit
);
1422 Curunit
: constant Unit_Number_Type
:= Get_Cunit_Unit_Number
(Comp_Unit
);
1423 -- New value of Current_Sem_Unit
1425 Generic_Main
: constant Boolean :=
1426 Nkind
(Unit
(Cunit
(Main_Unit
))) in N_Generic_Declaration
;
1427 -- If the main unit is generic, every compiled unit, including its
1428 -- context, is compiled with expansion disabled.
1430 Is_Main_Unit_Or_Main_Unit_Spec
: constant Boolean :=
1433 (Nkind
(Unit
(Cunit
(Main_Unit
))) = N_Package_Body
1434 and then Library_Unit
(Cunit
(Main_Unit
)) = Cunit
(Curunit
));
1435 -- Configuration flags have special settings when compiling a predefined
1436 -- file as a main unit. This applies to its spec as well.
1438 Ext_Main_Source_Unit
: constant Boolean :=
1439 In_Extended_Main_Source_Unit
(Comp_Unit
);
1440 -- Determine if unit is in extended main source unit
1442 Save_Config_Switches
: Config_Switches_Type
;
1443 -- Variable used to save values of config switches while we analyze the
1444 -- new unit, to be restored on exit for proper recursive behavior.
1446 Save_Cunit_Restrictions
: Save_Cunit_Boolean_Restrictions
;
1447 -- Used to save non-partition wide restrictions before processing new
1448 -- unit. All with'ed units are analyzed with config restrictions reset
1449 -- and we need to restore these saved values at the end.
1451 -- Start of processing for Semantics
1454 if Debug_Unit_Walk
then
1455 if Already_Analyzed
then
1456 Write_Str
("(done)");
1460 (Get_Cunit_Unit_Number
(Comp_Unit
),
1466 Compiler_State
:= Analyzing
;
1467 Current_Sem_Unit
:= Curunit
;
1469 -- Compile predefined units with GNAT_Mode set to True, to properly
1470 -- process the categorization stuff. However, do not set GNAT_Mode
1471 -- to True for the renamings units (Text_IO, IO_Exceptions, Direct_IO,
1472 -- Sequential_IO) as this would prevent pragma Extend_System from being
1473 -- taken into account, for example when Text_IO is renaming DEC.Text_IO.
1475 if Is_Predefined_Unit
(Current_Sem_Unit
)
1476 and then not Is_Predefined_Renaming
(Current_Sem_Unit
)
1481 -- For generic main, never do expansion
1483 if Generic_Main
then
1484 Expander_Mode_Save_And_Set
(False);
1489 Expander_Mode_Save_And_Set
1491 -- Turn on expansion if generating code
1493 (Operating_Mode
= Generate_Code
1495 -- Or if special debug flag -gnatdx is set
1497 or else Debug_Flag_X
1499 -- Or if in configuration run-time mode. We do this so we get
1500 -- error messages about missing entities in the run-time even
1501 -- if we are compiling in -gnatc (no code generation) mode.
1502 -- Similar processing applies to No_Run_Time_Mode. However,
1503 -- don't do this if debug flag -gnatd.Z is set or when we are
1504 -- compiling a separate unit (this is to handle a situation
1505 -- where this new processing causes trouble).
1508 ((Configurable_Run_Time_Mode
or No_Run_Time_Mode
)
1509 and then not Debug_Flag_Dot_ZZ
1510 and then Nkind
(Unit
(Cunit
(Main_Unit
))) /= N_Subunit
));
1513 Full_Analysis
:= True;
1514 Inside_A_Generic
:= False;
1515 In_Assertion_Expr
:= 0;
1516 In_Default_Expr
:= False;
1517 In_Spec_Expression
:= False;
1518 Set_Comes_From_Source_Default
(False);
1520 -- Save current config switches and reset then appropriately
1522 Save_Opt_Config_Switches
(Save_Config_Switches
);
1523 Set_Opt_Config_Switches
1524 (Is_Internal_Unit
(Current_Sem_Unit
),
1525 Is_Main_Unit_Or_Main_Unit_Spec
);
1527 -- Save current non-partition-wide restrictions
1529 Save_Cunit_Restrictions
:= Cunit_Boolean_Restrictions_Save
;
1531 -- For unit in main extended unit, we reset the configuration values
1532 -- for the non-partition-wide restrictions. For other units reset them.
1534 if Ext_Main_Source_Unit
then
1535 Restore_Config_Cunit_Boolean_Restrictions
;
1537 Reset_Cunit_Boolean_Restrictions
;
1540 -- Turn off style checks for unit that is not in the extended main
1541 -- source unit. This improves processing efficiency for such units
1542 -- (for which we don't want style checks anyway, and where they will
1543 -- get suppressed), and is definitely needed to stop some style checks
1544 -- from invading the run-time units (e.g. overriding checks).
1546 if not Ext_Main_Source_Unit
then
1547 Style_Check
:= False;
1549 -- If this is part of the extended main source unit, set style check
1550 -- mode to match the style check mode of the main source unit itself.
1553 Style_Check
:= Style_Check_Main
;
1556 -- Only do analysis of unit that has not already been analyzed
1558 if not Analyzed
(Comp_Unit
) then
1559 Initialize_Version
(Current_Sem_Unit
);
1561 -- Do analysis, and then append the compilation unit onto the
1562 -- Comp_Unit_List, if appropriate. This is done after analysis,
1563 -- so if this unit depends on some others, they have already been
1564 -- appended. We ignore bodies, except for the main unit itself, and
1565 -- for subprogram bodies that act as specs. We have also to guard
1566 -- against ill-formed subunits that have an improper context.
1570 if Present
(Comp_Unit
)
1571 and then Nkind
(Unit
(Comp_Unit
)) in N_Proper_Body
1572 and then (Nkind
(Unit
(Comp_Unit
)) /= N_Subprogram_Body
1573 or else not Acts_As_Spec
(Comp_Unit
))
1574 and then not In_Extended_Main_Source_Unit
(Comp_Unit
)
1579 Append_New_Elmt
(Comp_Unit
, To
=> Comp_Unit_List
);
1581 if Debug_Unit_Walk
then
1582 Write_Str
("Appending ");
1584 (Get_Cunit_Unit_Number
(Comp_Unit
), Unit
(Comp_Unit
));
1589 -- Save indication of dynamic elaboration checks for ALI file
1591 Set_Dynamic_Elab
(Current_Sem_Unit
, Dynamic_Elaboration_Checks
);
1593 -- Restore settings of saved switches to entry values
1595 Current_Sem_Unit
:= S_Current_Sem_Unit
;
1596 Full_Analysis
:= S_Full_Analysis
;
1597 Global_Discard_Names
:= S_Global_Dis_Names
;
1598 GNAT_Mode
:= S_GNAT_Mode
;
1599 In_Assertion_Expr
:= S_In_Assertion_Expr
;
1600 In_Default_Expr
:= S_In_Default_Expr
;
1601 In_Spec_Expression
:= S_In_Spec_Expr
;
1602 Inside_A_Generic
:= S_Inside_A_Generic
;
1603 Outer_Generic_Scope
:= S_Outer_Gen_Scope
;
1604 Style_Check
:= S_Style_Check
;
1606 Restore_Opt_Config_Switches
(Save_Config_Switches
);
1608 -- Deal with restore of restrictions
1610 Cunit_Boolean_Restrictions_Restore
(Save_Cunit_Restrictions
);
1612 Expander_Mode_Restore
;
1614 if Debug_Unit_Walk
then
1617 if Already_Analyzed
then
1618 Write_Str
("(done)");
1622 (Get_Cunit_Unit_Number
(Comp_Unit
),
1632 function ss
(Index
: Int
) return Scope_Stack_Entry
is
1634 return Scope_Stack
.Table
(Index
);
1641 function sst
return Scope_Stack_Entry
is
1643 return ss
(Scope_Stack
.Last
);
1652 Scope_Stack
.Locked
:= False;
1655 ------------------------
1656 -- Walk_Library_Items --
1657 ------------------------
1659 procedure Walk_Library_Items
is
1660 type Unit_Number_Set
is array (Main_Unit
.. Last_Unit
) of Boolean;
1661 pragma Pack
(Unit_Number_Set
);
1663 Main_CU
: constant Node_Id
:= Cunit
(Main_Unit
);
1665 Seen
, Done
: Unit_Number_Set
:= (others => False);
1666 -- Seen (X) is True after we have seen unit X in the walk. This is used
1667 -- to prevent processing the same unit more than once. Done (X) is True
1668 -- after we have fully processed X, and is used only for debugging
1669 -- printouts and assertions.
1671 Do_Main
: Boolean := False;
1672 -- Flag to delay processing the main body until after all other units.
1673 -- This is needed because the spec of the main unit may appear in the
1674 -- context of some other unit. We do not want this to force processing
1675 -- of the main body before all other units have been processed.
1677 -- Another circularity pattern occurs when the main unit is a child unit
1678 -- and the body of an ancestor has a with-clause of the main unit or on
1679 -- one of its children. In both cases the body in question has a with-
1680 -- clause on the main unit, and must be excluded from the traversal. In
1681 -- some convoluted cases this may lead to a CodePeer error because the
1682 -- spec of a subprogram declared in an instance within the parent will
1683 -- not be seen in the main unit.
1685 function Depends_On_Main
(CU
: Node_Id
) return Boolean;
1686 -- The body of a unit that is withed by the spec of the main unit may in
1687 -- turn have a with_clause on that spec. In that case do not traverse
1688 -- the body, to prevent loops. It can also happen that the main body has
1689 -- a with_clause on a child, which of course has an implicit with on its
1690 -- parent. It's OK to traverse the child body if the main spec has been
1691 -- processed, otherwise we also have a circularity to avoid.
1693 procedure Do_Action
(CU
: Node_Id
; Item
: Node_Id
);
1694 -- Calls Action, with some validity checks
1696 procedure Do_Unit_And_Dependents
(CU
: Node_Id
; Item
: Node_Id
);
1697 -- Calls Do_Action, first on the units with'ed by this one, then on
1698 -- this unit. If it's an instance body, do the spec first. If it is
1699 -- an instance spec, do the body last.
1701 procedure Do_Withed_Unit
(Withed_Unit
: Node_Id
);
1702 -- Apply Do_Unit_And_Dependents to a unit in a context clause
1704 procedure Process_Bodies_In_Context
(Comp
: Node_Id
);
1705 -- The main unit and its spec may depend on bodies that contain generics
1706 -- that are instantiated in them. Iterate through the corresponding
1707 -- contexts before processing main (spec/body) itself, to process bodies
1708 -- that may be present, together with their context. The spec of main
1709 -- is processed wherever it appears in the list of units, while the body
1710 -- is processed as the last unit in the list.
1712 ---------------------
1713 -- Depends_On_Main --
1714 ---------------------
1716 function Depends_On_Main
(CU
: Node_Id
) return Boolean is
1718 MCU
: constant Node_Id
:= Unit
(Main_CU
);
1721 CL
:= First
(Context_Items
(CU
));
1723 -- Problem does not arise with main subprograms
1726 not Nkind_In
(MCU
, N_Package_Body
, N_Package_Declaration
)
1731 while Present
(CL
) loop
1732 if Nkind
(CL
) = N_With_Clause
1733 and then Library_Unit
(CL
) = Main_CU
1734 and then not Done
(Get_Cunit_Unit_Number
(Library_Unit
(CL
)))
1743 end Depends_On_Main
;
1749 procedure Do_Action
(CU
: Node_Id
; Item
: Node_Id
) is
1751 -- This calls Action at the end. All the preceding code is just
1752 -- assertions and debugging output.
1754 pragma Assert
(No
(CU
) or else Nkind
(CU
) = N_Compilation_Unit
);
1756 case Nkind
(Item
) is
1757 when N_Generic_Function_Renaming_Declaration
1758 | N_Generic_Package_Declaration
1759 | N_Generic_Package_Renaming_Declaration
1760 | N_Generic_Procedure_Renaming_Declaration
1761 | N_Generic_Subprogram_Declaration
1762 | N_Package_Declaration
1763 | N_Package_Renaming_Declaration
1764 | N_Subprogram_Declaration
1765 | N_Subprogram_Renaming_Declaration
1771 when N_Package_Body
=>
1773 -- Package bodies are processed separately if the main unit
1778 when N_Subprogram_Body
=>
1780 -- A subprogram body must be the main unit
1782 pragma Assert
(Acts_As_Spec
(CU
)
1783 or else CU
= Cunit
(Main_Unit
));
1786 when N_Function_Instantiation
1787 | N_Package_Instantiation
1788 | N_Procedure_Instantiation
1790 -- Can only happen if some generic body (needed for gnat2scil
1791 -- traversal, but not by GNAT) is not available, ignore.
1795 -- All other cases cannot happen
1798 pragma Assert
(False, "subunit");
1801 when N_Null_Statement
=>
1803 -- Do not call Action for an ignored ghost unit
1805 pragma Assert
(Is_Ignored_Ghost_Node
(Original_Node
(Item
)));
1809 pragma Assert
(False);
1813 if Present
(CU
) then
1814 pragma Assert
(Item
/= Stand
.Standard_Package_Node
);
1815 pragma Assert
(Item
= Unit
(CU
));
1818 Unit_Num
: constant Unit_Number_Type
:=
1819 Get_Cunit_Unit_Number
(CU
);
1821 procedure Assert_Done
(Withed_Unit
: Node_Id
);
1822 -- Assert Withed_Unit is already Done, unless it's a body. It
1823 -- might seem strange for a with_clause to refer to a body, but
1824 -- this happens in the case of a generic instantiation, which
1825 -- gets transformed into the instance body (and the instance
1826 -- spec is also created). With clauses pointing to the
1827 -- instantiation end up pointing to the instance body.
1833 procedure Assert_Done
(Withed_Unit
: Node_Id
) is
1835 if not Done
(Get_Cunit_Unit_Number
(Withed_Unit
)) then
1837 (Unit
(Withed_Unit
),
1838 N_Generic_Package_Declaration
,
1840 N_Package_Renaming_Declaration
,
1844 (Unit_Name
(Get_Cunit_Unit_Number
(Withed_Unit
)));
1845 Write_Str
(" not yet walked!");
1847 if Get_Cunit_Unit_Number
(Withed_Unit
) = Unit_Num
then
1848 Write_Str
(" (self-ref)");
1853 pragma Assert
(False);
1858 procedure Assert_Withed_Units_Done
is
1859 new Walk_Withs
(Assert_Done
);
1862 if Debug_Unit_Walk
then
1863 Write_Unit_Info
(Unit_Num
, Item
, Withs
=> True);
1866 -- Main unit should come last, except in the case where we
1867 -- skipped System_Aux_Id, in which case we missed the things it
1868 -- depends on, and in the case of parent bodies if present.
1871 (not Done
(Main_Unit
)
1872 or else Present
(System_Aux_Id
)
1873 or else Nkind
(Item
) = N_Package_Body
);
1875 -- We shouldn't do the same thing twice
1877 pragma Assert
(not Done
(Unit_Num
));
1879 -- Everything we depend upon should already be done
1882 (Assert_Withed_Units_Done
(CU
, Include_Limited
=> False));
1886 -- Must be Standard, which has no entry in the units table
1888 pragma Assert
(Item
= Stand
.Standard_Package_Node
);
1890 if Debug_Unit_Walk
then
1891 Write_Line
("Standard");
1898 --------------------
1899 -- Do_Withed_Unit --
1900 --------------------
1902 procedure Do_Withed_Unit
(Withed_Unit
: Node_Id
) is
1904 Do_Unit_And_Dependents
(Withed_Unit
, Unit
(Withed_Unit
));
1906 -- If the unit in the with_clause is a generic instance, the clause
1907 -- now denotes the instance body. Traverse the corresponding spec
1908 -- because there may be no other dependence that will force the
1909 -- traversal of its own context.
1911 if Nkind
(Unit
(Withed_Unit
)) = N_Package_Body
1912 and then Is_Generic_Instance
1913 (Defining_Entity
(Unit
(Library_Unit
(Withed_Unit
))))
1915 Do_Withed_Unit
(Library_Unit
(Withed_Unit
));
1919 ----------------------------
1920 -- Do_Unit_And_Dependents --
1921 ----------------------------
1923 procedure Do_Unit_And_Dependents
(CU
: Node_Id
; Item
: Node_Id
) is
1924 Unit_Num
: constant Unit_Number_Type
:= Get_Cunit_Unit_Number
(CU
);
1926 Body_U
: Unit_Number_Type
;
1927 Parent_CU
: Node_Id
;
1929 procedure Do_Withed_Units
is new Walk_Withs
(Do_Withed_Unit
);
1932 if not Seen
(Unit_Num
) then
1934 -- Process the with clauses
1936 Do_Withed_Units
(CU
, Include_Limited
=> False);
1938 -- Process the unit if it is a spec or the main unit, if it
1939 -- has no previous spec or we have done all other units.
1941 if not Nkind_In
(Item
, N_Package_Body
, N_Subprogram_Body
)
1942 or else Acts_As_Spec
(CU
)
1944 if CU
= Cunit
(Main_Unit
)
1945 and then not Do_Main
1947 Seen
(Unit_Num
) := False;
1950 Seen
(Unit_Num
) := True;
1952 if CU
= Library_Unit
(Main_CU
) then
1953 Process_Bodies_In_Context
(CU
);
1955 -- If main is a child unit, examine parent unit contexts
1956 -- to see if they include instantiated units. Also, if
1957 -- the parent itself is an instance, process its body
1958 -- because it may contain subprograms that are called
1959 -- in the main unit.
1961 if Is_Child_Unit
(Cunit_Entity
(Main_Unit
)) then
1962 Child
:= Cunit_Entity
(Main_Unit
);
1963 while Is_Child_Unit
(Child
) loop
1966 (Get_Cunit_Entity_Unit_Number
(Scope
(Child
)));
1967 Process_Bodies_In_Context
(Parent_CU
);
1969 if Nkind
(Unit
(Parent_CU
)) = N_Package_Body
1971 Nkind
(Original_Node
(Unit
(Parent_CU
)))
1972 = N_Package_Instantiation
1974 not Seen
(Get_Cunit_Unit_Number
(Parent_CU
))
1976 Body_U
:= Get_Cunit_Unit_Number
(Parent_CU
);
1977 Seen
(Body_U
) := True;
1978 Do_Action
(Parent_CU
, Unit
(Parent_CU
));
1979 Done
(Body_U
) := True;
1982 Child
:= Scope
(Child
);
1987 Do_Action
(CU
, Item
);
1988 Done
(Unit_Num
) := True;
1992 end Do_Unit_And_Dependents
;
1994 -------------------------------
1995 -- Process_Bodies_In_Context --
1996 -------------------------------
1998 procedure Process_Bodies_In_Context
(Comp
: Node_Id
) is
2000 Body_U
: Unit_Number_Type
;
2004 procedure Do_Withed_Units
is new Walk_Withs
(Do_Withed_Unit
);
2006 -- Start of processing for Process_Bodies_In_Context
2009 Clause
:= First
(Context_Items
(Comp
));
2010 while Present
(Clause
) loop
2011 if Nkind
(Clause
) = N_With_Clause
then
2012 Spec
:= Library_Unit
(Clause
);
2013 Body_CU
:= Library_Unit
(Spec
);
2015 -- If we are processing the spec of the main unit, load bodies
2016 -- only if the with_clause indicates that it forced the loading
2017 -- of the body for a generic instantiation. Note that bodies of
2018 -- parents that are instances have been loaded already.
2020 if Present
(Body_CU
)
2021 and then Body_CU
/= Cunit
(Main_Unit
)
2022 and then Nkind
(Unit
(Body_CU
)) /= N_Subprogram_Body
2023 and then (Nkind
(Unit
(Comp
)) /= N_Package_Declaration
2024 or else Present
(Withed_Body
(Clause
)))
2026 Body_U
:= Get_Cunit_Unit_Number
(Body_CU
);
2028 if not Seen
(Body_U
)
2029 and then not Depends_On_Main
(Body_CU
)
2031 Seen
(Body_U
) := True;
2032 Do_Withed_Units
(Body_CU
, Include_Limited
=> False);
2033 Do_Action
(Body_CU
, Unit
(Body_CU
));
2034 Done
(Body_U
) := True;
2041 end Process_Bodies_In_Context
;
2043 -- Local Declarations
2047 -- Start of processing for Walk_Library_Items
2050 if Debug_Unit_Walk
then
2051 Write_Line
("Walk_Library_Items:");
2055 -- Do Standard first, then walk the Comp_Unit_List
2057 Do_Action
(Empty
, Standard_Package_Node
);
2059 -- First place the context of all instance bodies on the corresponding
2060 -- spec, because it may be needed to analyze the code at the place of
2061 -- the instantiation.
2063 Cur
:= First_Elmt
(Comp_Unit_List
);
2064 while Present
(Cur
) loop
2066 CU
: constant Node_Id
:= Node
(Cur
);
2067 N
: constant Node_Id
:= Unit
(CU
);
2070 if Nkind
(N
) = N_Package_Body
2071 and then Is_Generic_Instance
(Defining_Entity
(N
))
2074 (Context_Items
(CU
), Context_Items
(Library_Unit
(CU
)));
2081 -- Now traverse compilation units (specs) in order
2083 Cur
:= First_Elmt
(Comp_Unit_List
);
2084 while Present
(Cur
) loop
2086 CU
: constant Node_Id
:= Node
(Cur
);
2087 N
: constant Node_Id
:= Unit
(CU
);
2091 pragma Assert
(Nkind
(CU
) = N_Compilation_Unit
);
2095 -- If it is a subprogram body, process it if it has no
2098 -- If it's a package body, ignore it, unless it is a body
2099 -- created for an instance that is the main unit. In the case
2100 -- of subprograms, the body is the wrapper package. In case of
2101 -- a package, the original file carries the body, and the spec
2102 -- appears as a later entry in the units list.
2104 -- Otherwise bodies appear in the list only because of inlining
2105 -- or instantiations, and they are processed only if relevant.
2106 -- The flag Withed_Body on a context clause indicates that a
2107 -- unit contains an instantiation that may be needed later,
2108 -- and therefore the body that contains the generic body (and
2109 -- its context) must be traversed immediately after the
2110 -- corresponding spec (see Do_Unit_And_Dependents).
2112 -- The main unit itself is processed separately after all other
2113 -- specs, and relevant bodies are examined in Process_Main.
2115 when N_Subprogram_Body
=>
2116 if Acts_As_Spec
(N
) then
2117 Do_Unit_And_Dependents
(CU
, N
);
2120 when N_Package_Body
=>
2122 and then Nkind
(Original_Node
(Unit
(Main_CU
))) in
2123 N_Generic_Instantiation
2124 and then Present
(Library_Unit
(Main_CU
))
2126 Do_Unit_And_Dependents
2127 (Library_Unit
(Main_CU
),
2128 Unit
(Library_Unit
(Main_CU
)));
2131 -- It is a spec, process it, and the units it depends on,
2132 -- unless it is a descendant of the main unit. This can happen
2133 -- when the body of a parent depends on some other descendant.
2135 when N_Null_Statement
=>
2137 -- Ignore an ignored ghost unit
2139 pragma Assert
(Is_Ignored_Ghost_Node
(Original_Node
(N
)));
2143 Par
:= Scope
(Defining_Entity
(Unit
(CU
)));
2145 if Is_Child_Unit
(Defining_Entity
(Unit
(CU
))) then
2147 and then Par
/= Standard_Standard
2148 and then Par
/= Cunit_Entity
(Main_Unit
)
2154 if Par
/= Cunit_Entity
(Main_Unit
) then
2155 Do_Unit_And_Dependents
(CU
, N
);
2163 -- Now process package bodies on which main depends, followed by bodies
2164 -- of parents, if present, and finally main itself.
2166 if not Done
(Main_Unit
) then
2169 Process_Main
: declare
2170 Parent_CU
: Node_Id
;
2172 Body_U
: Unit_Number_Type
;
2175 function Is_Subunit_Of_Main
(U
: Node_Id
) return Boolean;
2176 -- If the main unit has subunits, their context may include
2177 -- bodies that are needed in the body of main. We must examine
2178 -- the context of the subunits, which are otherwise not made
2179 -- explicit in the main unit.
2181 ------------------------
2182 -- Is_Subunit_Of_Main --
2183 ------------------------
2185 function Is_Subunit_Of_Main
(U
: Node_Id
) return Boolean is
2191 Lib
:= Library_Unit
(U
);
2192 return Nkind
(Unit
(U
)) = N_Subunit
2194 (Lib
= Cunit
(Main_Unit
)
2195 or else Is_Subunit_Of_Main
(Lib
));
2197 end Is_Subunit_Of_Main
;
2199 -- Start of processing for Process_Main
2202 Process_Bodies_In_Context
(Main_CU
);
2204 for Unit_Num
in Done
'Range loop
2205 if Is_Subunit_Of_Main
(Cunit
(Unit_Num
)) then
2206 Process_Bodies_In_Context
(Cunit
(Unit_Num
));
2210 -- If the main unit is a child unit, parent bodies may be present
2211 -- because they export instances or inlined subprograms. Check for
2212 -- presence of these, which are not present in context clauses.
2213 -- Note that if the parents are instances, their bodies have been
2214 -- processed before the main spec, because they may be needed
2215 -- therein, so the following loop only affects non-instances.
2217 if Is_Child_Unit
(Cunit_Entity
(Main_Unit
)) then
2218 Child
:= Cunit_Entity
(Main_Unit
);
2219 while Is_Child_Unit
(Child
) loop
2221 Cunit
(Get_Cunit_Entity_Unit_Number
(Scope
(Child
)));
2222 Body_CU
:= Library_Unit
(Parent_CU
);
2224 if Present
(Body_CU
)
2225 and then not Seen
(Get_Cunit_Unit_Number
(Body_CU
))
2226 and then not Depends_On_Main
(Body_CU
)
2228 Body_U
:= Get_Cunit_Unit_Number
(Body_CU
);
2229 Seen
(Body_U
) := True;
2230 Do_Action
(Body_CU
, Unit
(Body_CU
));
2231 Done
(Body_U
) := True;
2234 Child
:= Scope
(Child
);
2238 Do_Action
(Main_CU
, Unit
(Main_CU
));
2239 Done
(Main_Unit
) := True;
2243 if Debug_Unit_Walk
then
2244 if Done
/= (Done
'Range => True) then
2246 Write_Line
("Ignored units:");
2250 for Unit_Num
in Done
'Range loop
2251 if not Done
(Unit_Num
) then
2253 (Unit_Num
, Unit
(Cunit
(Unit_Num
)), Withs
=> True);
2261 pragma Assert
(Done
(Main_Unit
));
2263 if Debug_Unit_Walk
then
2265 Write_Line
("end Walk_Library_Items.");
2267 end Walk_Library_Items
;
2273 procedure Walk_Withs
(CU
: Node_Id
; Include_Limited
: Boolean) is
2274 pragma Assert
(Nkind
(CU
) = N_Compilation_Unit
);
2275 pragma Assert
(Nkind
(Unit
(CU
)) /= N_Subunit
);
2277 procedure Walk_Immediate
is new Walk_Withs_Immediate
(Action
);
2280 -- First walk the withs immediately on the library item
2282 Walk_Immediate
(CU
, Include_Limited
);
2284 -- For a body, we must also check for any subunits which belong to it
2285 -- and which have context clauses of their own, since these with'ed
2286 -- units are part of its own dependencies.
2288 if Nkind
(Unit
(CU
)) in N_Unit_Body
then
2289 for S
in Main_Unit
.. Last_Unit
loop
2291 -- We are only interested in subunits. For preproc. data and def.
2292 -- files, Cunit is Empty, so we need to test that first.
2294 if Cunit
(S
) /= Empty
2295 and then Nkind
(Unit
(Cunit
(S
))) = N_Subunit
2301 Pnode
:= Library_Unit
(Cunit
(S
));
2303 -- In -gnatc mode, the errors in the subunits will not have
2304 -- been recorded, but the analysis of the subunit may have
2305 -- failed, so just quit.
2311 -- Find ultimate parent of the subunit
2313 while Nkind
(Unit
(Pnode
)) = N_Subunit
loop
2314 Pnode
:= Library_Unit
(Pnode
);
2317 -- See if it belongs to current unit, and if so, include its
2318 -- with_clauses. Do not process main unit prematurely.
2320 if Pnode
= CU
and then CU
/= Cunit
(Main_Unit
) then
2321 Walk_Immediate
(Cunit
(S
), Include_Limited
);
2329 --------------------------
2330 -- Walk_Withs_Immediate --
2331 --------------------------
2333 procedure Walk_Withs_Immediate
(CU
: Node_Id
; Include_Limited
: Boolean) is
2334 pragma Assert
(Nkind
(CU
) = N_Compilation_Unit
);
2336 Context_Item
: Node_Id
;
2341 Context_Item
:= First
(Context_Items
(CU
));
2342 while Present
(Context_Item
) loop
2343 if Nkind
(Context_Item
) = N_With_Clause
2344 and then (Include_Limited
2345 or else not Limited_Present
(Context_Item
))
2347 Lib_Unit
:= Library_Unit
(Context_Item
);
2350 -- If the context item indicates that a package body is needed
2351 -- because of an instantiation in CU, traverse the body now, even
2352 -- if CU is not related to the main unit. If the generic itself
2353 -- appears in a package body, the context item is this body, and
2354 -- it already appears in the traversal order, so we only need to
2355 -- examine the case of a context item being a package declaration.
2357 if Present
(Withed_Body
(Context_Item
))
2358 and then Nkind
(Unit
(Lib_Unit
)) = N_Package_Declaration
2359 and then Present
(Corresponding_Body
(Unit
(Lib_Unit
)))
2363 (Unit_Declaration_Node
2364 (Corresponding_Body
(Unit
(Lib_Unit
))));
2366 -- A body may have an implicit with on its own spec, in which
2367 -- case we must ignore this context item to prevent looping.
2369 if Unit
(CU
) /= Unit
(Body_CU
) then
2375 Context_Item
:= Next
(Context_Item
);
2377 end Walk_Withs_Immediate
;