1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2014, 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 Expander
; use Expander
;
31 with Fname
; use Fname
;
33 with Lib
.Load
; use Lib
.Load
;
34 with Nlists
; use Nlists
;
35 with Output
; use Output
;
36 with Restrict
; use Restrict
;
37 with Sem_Attr
; use Sem_Attr
;
38 with Sem_Aux
; use Sem_Aux
;
39 with Sem_Ch2
; use Sem_Ch2
;
40 with Sem_Ch3
; use Sem_Ch3
;
41 with Sem_Ch4
; use Sem_Ch4
;
42 with Sem_Ch5
; use Sem_Ch5
;
43 with Sem_Ch6
; use Sem_Ch6
;
44 with Sem_Ch7
; use Sem_Ch7
;
45 with Sem_Ch8
; use Sem_Ch8
;
46 with Sem_Ch9
; use Sem_Ch9
;
47 with Sem_Ch10
; use Sem_Ch10
;
48 with Sem_Ch11
; use Sem_Ch11
;
49 with Sem_Ch12
; use Sem_Ch12
;
50 with Sem_Ch13
; use Sem_Ch13
;
51 with Sem_Prag
; use Sem_Prag
;
52 with Sem_Util
; use Sem_Util
;
53 with Sinfo
; use Sinfo
;
54 with Stand
; use Stand
;
55 with Uintp
; use Uintp
;
56 with Uname
; use Uname
;
58 with Unchecked_Deallocation
;
60 pragma Warnings
(Off
, Sem_Util
);
61 -- Suppress warnings of unused with for Sem_Util (used only in asserts)
65 Debug_Unit_Walk
: Boolean renames Debug_Flag_Dot_WW
;
66 -- Controls debugging printouts for Walk_Library_Items
68 Outer_Generic_Scope
: Entity_Id
:= Empty
;
69 -- Global reference to the outer scope that is generic. In a non-generic
70 -- context, it is empty. At the moment, it is only used for avoiding
71 -- freezing of external references in generics.
73 Comp_Unit_List
: Elist_Id
:= No_Elist
;
74 -- Used by Walk_Library_Items. This is a list of N_Compilation_Unit nodes
75 -- processed by Semantics, in an appropriate order. Initialized to
76 -- No_Elist, because it's too early to call New_Elmt_List; we will set it
77 -- to New_Elmt_List on first use.
80 with procedure Action
(Withed_Unit
: Node_Id
);
81 procedure Walk_Withs_Immediate
(CU
: Node_Id
; Include_Limited
: Boolean);
82 -- Walk all the with clauses of CU, and call Action for the with'ed unit.
83 -- Ignore limited withs, unless Include_Limited is True. CU must be an
84 -- N_Compilation_Unit.
87 with procedure Action
(Withed_Unit
: Node_Id
);
88 procedure Walk_Withs
(CU
: Node_Id
; Include_Limited
: Boolean);
89 -- Same as Walk_Withs_Immediate, but also include with clauses on subunits
90 -- of this unit, since they count as dependences on their parent library
91 -- item. CU must be an N_Compilation_Unit whose Unit is not an N_Subunit.
97 procedure Analyze
(N
: Node_Id
) is
99 Debug_A_Entry
("analyzing ", N
);
101 -- Immediate return if already analyzed
104 Debug_A_Exit
("analyzing ", N
, " (done, analyzed already)");
108 -- Otherwise processing depends on the node kind
112 when N_Abort_Statement
=>
113 Analyze_Abort_Statement
(N
);
115 when N_Abstract_Subprogram_Declaration
=>
116 Analyze_Abstract_Subprogram_Declaration
(N
);
118 when N_Accept_Alternative
=>
119 Analyze_Accept_Alternative
(N
);
121 when N_Accept_Statement
=>
122 Analyze_Accept_Statement
(N
);
125 Analyze_Aggregate
(N
);
128 Analyze_Allocator
(N
);
131 Analyze_Short_Circuit
(N
);
133 when N_Assignment_Statement
=>
134 Analyze_Assignment
(N
);
136 when N_Asynchronous_Select
=>
137 Analyze_Asynchronous_Select
(N
);
140 Analyze_At_Clause
(N
);
142 when N_Attribute_Reference
=>
143 Analyze_Attribute
(N
);
145 when N_Attribute_Definition_Clause
=>
146 Analyze_Attribute_Definition_Clause
(N
);
148 when N_Block_Statement
=>
149 Analyze_Block_Statement
(N
);
151 when N_Case_Expression
=>
152 Analyze_Case_Expression
(N
);
154 when N_Case_Statement
=>
155 Analyze_Case_Statement
(N
);
157 when N_Character_Literal
=>
158 Analyze_Character_Literal
(N
);
160 when N_Code_Statement
=>
161 Analyze_Code_Statement
(N
);
163 when N_Compilation_Unit
=>
164 Analyze_Compilation_Unit
(N
);
166 when N_Component_Declaration
=>
167 Analyze_Component_Declaration
(N
);
169 when N_Compound_Statement
=>
170 Analyze_Compound_Statement
(N
);
172 when N_Conditional_Entry_Call
=>
173 Analyze_Conditional_Entry_Call
(N
);
175 when N_Delay_Alternative
=>
176 Analyze_Delay_Alternative
(N
);
178 when N_Delay_Relative_Statement
=>
179 Analyze_Delay_Relative
(N
);
181 when N_Delay_Until_Statement
=>
182 Analyze_Delay_Until
(N
);
185 Analyze_Entry_Body
(N
);
187 when N_Entry_Body_Formal_Part
=>
188 Analyze_Entry_Body_Formal_Part
(N
);
190 when N_Entry_Call_Alternative
=>
191 Analyze_Entry_Call_Alternative
(N
);
193 when N_Entry_Declaration
=>
194 Analyze_Entry_Declaration
(N
);
196 when N_Entry_Index_Specification
=>
197 Analyze_Entry_Index_Specification
(N
);
199 when N_Enumeration_Representation_Clause
=>
200 Analyze_Enumeration_Representation_Clause
(N
);
202 when N_Exception_Declaration
=>
203 Analyze_Exception_Declaration
(N
);
205 when N_Exception_Renaming_Declaration
=>
206 Analyze_Exception_Renaming
(N
);
208 when N_Exit_Statement
=>
209 Analyze_Exit_Statement
(N
);
211 when N_Expanded_Name
=>
212 Analyze_Expanded_Name
(N
);
214 when N_Explicit_Dereference
=>
215 Analyze_Explicit_Dereference
(N
);
217 when N_Expression_Function
=>
218 Analyze_Expression_Function
(N
);
220 when N_Expression_With_Actions
=>
221 Analyze_Expression_With_Actions
(N
);
223 when N_Extended_Return_Statement
=>
224 Analyze_Extended_Return_Statement
(N
);
226 when N_Extension_Aggregate
=>
227 Analyze_Aggregate
(N
);
229 when N_Formal_Object_Declaration
=>
230 Analyze_Formal_Object_Declaration
(N
);
232 when N_Formal_Package_Declaration
=>
233 Analyze_Formal_Package_Declaration
(N
);
235 when N_Formal_Subprogram_Declaration
=>
236 Analyze_Formal_Subprogram_Declaration
(N
);
238 when N_Formal_Type_Declaration
=>
239 Analyze_Formal_Type_Declaration
(N
);
241 when N_Free_Statement
=>
242 Analyze_Free_Statement
(N
);
244 when N_Freeze_Entity
=>
245 Analyze_Freeze_Entity
(N
);
247 when N_Freeze_Generic_Entity
=>
248 Analyze_Freeze_Generic_Entity
(N
);
250 when N_Full_Type_Declaration
=>
251 Analyze_Full_Type_Declaration
(N
);
253 when N_Function_Call
=>
254 Analyze_Function_Call
(N
);
256 when N_Function_Instantiation
=>
257 Analyze_Function_Instantiation
(N
);
259 when N_Generic_Function_Renaming_Declaration
=>
260 Analyze_Generic_Function_Renaming
(N
);
262 when N_Generic_Package_Declaration
=>
263 Analyze_Generic_Package_Declaration
(N
);
265 when N_Generic_Package_Renaming_Declaration
=>
266 Analyze_Generic_Package_Renaming
(N
);
268 when N_Generic_Procedure_Renaming_Declaration
=>
269 Analyze_Generic_Procedure_Renaming
(N
);
271 when N_Generic_Subprogram_Declaration
=>
272 Analyze_Generic_Subprogram_Declaration
(N
);
274 when N_Goto_Statement
=>
275 Analyze_Goto_Statement
(N
);
277 when N_Handled_Sequence_Of_Statements
=>
278 Analyze_Handled_Statements
(N
);
281 Analyze_Identifier
(N
);
283 when N_If_Expression
=>
284 Analyze_If_Expression
(N
);
286 when N_If_Statement
=>
287 Analyze_If_Statement
(N
);
289 when N_Implicit_Label_Declaration
=>
290 Analyze_Implicit_Label_Declaration
(N
);
293 Analyze_Membership_Op
(N
);
295 when N_Incomplete_Type_Declaration
=>
296 Analyze_Incomplete_Type_Decl
(N
);
298 when N_Indexed_Component
=>
299 Analyze_Indexed_Component_Form
(N
);
301 when N_Integer_Literal
=>
302 Analyze_Integer_Literal
(N
);
304 when N_Iterator_Specification
=>
305 Analyze_Iterator_Specification
(N
);
307 when N_Itype_Reference
=>
308 Analyze_Itype_Reference
(N
);
313 when N_Loop_Parameter_Specification
=>
314 Analyze_Loop_Parameter_Specification
(N
);
316 when N_Loop_Statement
=>
317 Analyze_Loop_Statement
(N
);
320 Analyze_Membership_Op
(N
);
325 when N_Null_Statement
=>
326 Analyze_Null_Statement
(N
);
328 when N_Number_Declaration
=>
329 Analyze_Number_Declaration
(N
);
331 when N_Object_Declaration
=>
332 Analyze_Object_Declaration
(N
);
334 when N_Object_Renaming_Declaration
=>
335 Analyze_Object_Renaming
(N
);
337 when N_Operator_Symbol
=>
338 Analyze_Operator_Symbol
(N
);
341 Analyze_Unary_Op
(N
);
344 Analyze_Arithmetic_Op
(N
);
347 Analyze_Logical_Op
(N
);
350 Analyze_Concatenation
(N
);
353 Analyze_Arithmetic_Op
(N
);
356 Analyze_Equality_Op
(N
);
359 Analyze_Arithmetic_Op
(N
);
362 Analyze_Comparison_Op
(N
);
365 Analyze_Comparison_Op
(N
);
368 Analyze_Comparison_Op
(N
);
371 Analyze_Comparison_Op
(N
);
374 Analyze_Unary_Op
(N
);
379 when N_Op_Multiply
=>
380 Analyze_Arithmetic_Op
(N
);
383 Analyze_Equality_Op
(N
);
386 Analyze_Negation
(N
);
389 Analyze_Logical_Op
(N
);
392 Analyze_Unary_Op
(N
);
395 Analyze_Arithmetic_Op
(N
);
397 when N_Op_Rotate_Left
=>
398 Analyze_Arithmetic_Op
(N
);
400 when N_Op_Rotate_Right
=>
401 Analyze_Arithmetic_Op
(N
);
403 when N_Op_Shift_Left
=>
404 Analyze_Arithmetic_Op
(N
);
406 when N_Op_Shift_Right
=>
407 Analyze_Arithmetic_Op
(N
);
409 when N_Op_Shift_Right_Arithmetic
=>
410 Analyze_Arithmetic_Op
(N
);
412 when N_Op_Subtract
=>
413 Analyze_Arithmetic_Op
(N
);
416 Analyze_Logical_Op
(N
);
419 Analyze_Short_Circuit
(N
);
421 when N_Others_Choice
=>
422 Analyze_Others_Choice
(N
);
424 when N_Package_Body
=>
425 Analyze_Package_Body
(N
);
427 when N_Package_Body_Stub
=>
428 Analyze_Package_Body_Stub
(N
);
430 when N_Package_Declaration
=>
431 Analyze_Package_Declaration
(N
);
433 when N_Package_Instantiation
=>
434 Analyze_Package_Instantiation
(N
);
436 when N_Package_Renaming_Declaration
=>
437 Analyze_Package_Renaming
(N
);
439 when N_Package_Specification
=>
440 Analyze_Package_Specification
(N
);
442 when N_Parameter_Association
=>
443 Analyze_Parameter_Association
(N
);
448 when N_Private_Extension_Declaration
=>
449 Analyze_Private_Extension_Declaration
(N
);
451 when N_Private_Type_Declaration
=>
452 Analyze_Private_Type_Declaration
(N
);
454 when N_Procedure_Call_Statement
=>
455 Analyze_Procedure_Call
(N
);
457 when N_Procedure_Instantiation
=>
458 Analyze_Procedure_Instantiation
(N
);
460 when N_Protected_Body
=>
461 Analyze_Protected_Body
(N
);
463 when N_Protected_Body_Stub
=>
464 Analyze_Protected_Body_Stub
(N
);
466 when N_Protected_Definition
=>
467 Analyze_Protected_Definition
(N
);
469 when N_Protected_Type_Declaration
=>
470 Analyze_Protected_Type_Declaration
(N
);
472 when N_Qualified_Expression
=>
473 Analyze_Qualified_Expression
(N
);
475 when N_Quantified_Expression
=>
476 Analyze_Quantified_Expression
(N
);
478 when N_Raise_Expression
=>
479 Analyze_Raise_Expression
(N
);
481 when N_Raise_Statement
=>
482 Analyze_Raise_Statement
(N
);
484 when N_Raise_xxx_Error
=>
485 Analyze_Raise_xxx_Error
(N
);
490 when N_Range_Constraint
=>
491 Analyze_Range
(Range_Expression
(N
));
493 when N_Real_Literal
=>
494 Analyze_Real_Literal
(N
);
496 when N_Record_Representation_Clause
=>
497 Analyze_Record_Representation_Clause
(N
);
500 Analyze_Reference
(N
);
502 when N_Requeue_Statement
=>
505 when N_Simple_Return_Statement
=>
506 Analyze_Simple_Return_Statement
(N
);
508 when N_Selected_Component
=>
509 Find_Selected_Component
(N
);
510 -- ??? why not Analyze_Selected_Component, needs comments
512 when N_Selective_Accept
=>
513 Analyze_Selective_Accept
(N
);
515 when N_Single_Protected_Declaration
=>
516 Analyze_Single_Protected_Declaration
(N
);
518 when N_Single_Task_Declaration
=>
519 Analyze_Single_Task_Declaration
(N
);
524 when N_String_Literal
=>
525 Analyze_String_Literal
(N
);
527 when N_Subprogram_Body
=>
528 Analyze_Subprogram_Body
(N
);
530 when N_Subprogram_Body_Stub
=>
531 Analyze_Subprogram_Body_Stub
(N
);
533 when N_Subprogram_Declaration
=>
534 Analyze_Subprogram_Declaration
(N
);
536 when N_Subprogram_Renaming_Declaration
=>
537 Analyze_Subprogram_Renaming
(N
);
539 when N_Subtype_Declaration
=>
540 Analyze_Subtype_Declaration
(N
);
542 when N_Subtype_Indication
=>
543 Analyze_Subtype_Indication
(N
);
549 Analyze_Task_Body
(N
);
551 when N_Task_Body_Stub
=>
552 Analyze_Task_Body_Stub
(N
);
554 when N_Task_Definition
=>
555 Analyze_Task_Definition
(N
);
557 when N_Task_Type_Declaration
=>
558 Analyze_Task_Type_Declaration
(N
);
560 when N_Terminate_Alternative
=>
561 Analyze_Terminate_Alternative
(N
);
563 when N_Timed_Entry_Call
=>
564 Analyze_Timed_Entry_Call
(N
);
566 when N_Triggering_Alternative
=>
567 Analyze_Triggering_Alternative
(N
);
569 when N_Type_Conversion
=>
570 Analyze_Type_Conversion
(N
);
572 when N_Unchecked_Expression
=>
573 Analyze_Unchecked_Expression
(N
);
575 when N_Unchecked_Type_Conversion
=>
576 Analyze_Unchecked_Type_Conversion
(N
);
578 when N_Use_Package_Clause
=>
579 Analyze_Use_Package
(N
);
581 when N_Use_Type_Clause
=>
582 Analyze_Use_Type
(N
);
584 when N_Validate_Unchecked_Conversion
=>
587 when N_Variant_Part
=>
588 Analyze_Variant_Part
(N
);
590 when N_With_Clause
=>
591 Analyze_With_Clause
(N
);
593 -- A call to analyze the Empty node is an error, but most likely it
594 -- is an error caused by an attempt to analyze a malformed piece of
595 -- tree caused by some other error, so if there have been any other
596 -- errors, we just ignore it, otherwise it is a real internal error
597 -- which we complain about.
599 -- We must also consider the case of call to a runtime function that
600 -- is not available in the configurable runtime.
603 pragma Assert
(Serious_Errors_Detected
/= 0
604 or else Configurable_Run_Time_Violations
/= 0);
607 -- A call to analyze the error node is simply ignored, to avoid
608 -- causing cascaded errors (happens of course only in error cases)
613 -- Push/Pop nodes normally don't come through an analyze call. An
614 -- exception is the dummy ones bracketing a subprogram body. In any
615 -- case there is nothing to be done to analyze such nodes.
617 when N_Push_Pop_xxx_Label
=>
620 -- SCIL nodes don't need analysis because they are decorated when
621 -- they are built. They are added to the tree by Insert_Actions and
622 -- the call to analyze them is generated when the full list is
626 N_SCIL_Dispatch_Table_Tag_Init |
627 N_SCIL_Dispatching_Call |
628 N_SCIL_Membership_Test
=>
631 -- For the remaining node types, we generate compiler abort, because
632 -- these nodes are always analyzed within the Sem_Chn routines and
633 -- there should never be a case of making a call to the main Analyze
634 -- routine for these node kinds. For example, an N_Access_Definition
635 -- node appears only in the context of a type declaration, and is
636 -- processed by the analyze routine for type declarations.
640 N_Access_Definition |
641 N_Access_Function_Definition |
642 N_Access_Procedure_Definition |
643 N_Access_To_Object_Definition |
644 N_Aspect_Specification |
645 N_Case_Expression_Alternative |
646 N_Case_Statement_Alternative |
647 N_Compilation_Unit_Aux |
648 N_Component_Association |
650 N_Component_Definition |
652 N_Constrained_Array_Definition |
654 N_Decimal_Fixed_Point_Definition |
655 N_Defining_Character_Literal |
656 N_Defining_Identifier |
657 N_Defining_Operator_Symbol |
658 N_Defining_Program_Unit_Name |
660 N_Derived_Type_Definition |
662 N_Digits_Constraint |
663 N_Discriminant_Association |
664 N_Discriminant_Specification |
666 N_Entry_Call_Statement |
667 N_Enumeration_Type_Definition |
668 N_Exception_Handler |
669 N_Floating_Point_Definition |
670 N_Formal_Decimal_Fixed_Point_Definition |
671 N_Formal_Derived_Type_Definition |
672 N_Formal_Discrete_Type_Definition |
673 N_Formal_Floating_Point_Definition |
674 N_Formal_Modular_Type_Definition |
675 N_Formal_Ordinary_Fixed_Point_Definition |
676 N_Formal_Private_Type_Definition |
677 N_Formal_Incomplete_Type_Definition |
678 N_Formal_Signed_Integer_Type_Definition |
679 N_Function_Specification |
680 N_Generic_Association |
681 N_Index_Or_Discriminant_Constraint |
684 N_Modular_Type_Definition |
685 N_Ordinary_Fixed_Point_Definition |
686 N_Parameter_Specification |
687 N_Pragma_Argument_Association |
688 N_Procedure_Specification |
689 N_Real_Range_Specification |
690 N_Record_Definition |
691 N_Signed_Integer_Type_Definition |
692 N_Unconstrained_Array_Definition |
700 Debug_A_Exit
("analyzing ", N
, " (done)");
702 -- Now that we have analyzed the node, we call the expander to perform
703 -- possible expansion. We skip this for subexpressions, because we don't
704 -- have the type yet, and the expander will need to know the type before
705 -- it can do its job. For subexpression nodes, the call to the expander
706 -- happens in Sem_Res.Resolve. A special exception is Raise_xxx_Error,
707 -- which can appear in a statement context, and needs expanding now in
708 -- the case (distinguished by Etype, as documented in Sinfo).
710 -- The Analyzed flag is also set at this point for non-subexpression
711 -- nodes (in the case of subexpression nodes, we can't set the flag yet,
712 -- since resolution and expansion have not yet been completed). Note
713 -- that for N_Raise_xxx_Error we have to distinguish the expression
714 -- case from the statement case.
716 if Nkind
(N
) not in N_Subexpr
717 or else (Nkind
(N
) in N_Raise_xxx_Error
718 and then Etype
(N
) = Standard_Void_Type
)
724 -- Version with check(s) suppressed
726 procedure Analyze
(N
: Node_Id
; Suppress
: Check_Id
) is
728 if Suppress
= All_Checks
then
730 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
732 Scope_Suppress
.Suppress
:= (others => True);
734 Scope_Suppress
.Suppress
:= Svs
;
737 elsif Suppress
= Overflow_Check
then
739 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
741 Scope_Suppress
.Suppress
(Suppress
) := True;
743 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
752 procedure Analyze_List
(L
: List_Id
) is
757 while Present
(Node
) loop
763 -- Version with check(s) suppressed
765 procedure Analyze_List
(L
: List_Id
; Suppress
: Check_Id
) is
767 if Suppress
= All_Checks
then
769 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
771 Scope_Suppress
.Suppress
:= (others => True);
773 Scope_Suppress
.Suppress
:= Svs
;
778 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
780 Scope_Suppress
.Suppress
(Suppress
) := True;
782 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
787 --------------------------
788 -- Copy_Suppress_Status --
789 --------------------------
791 procedure Copy_Suppress_Status
797 pragma Warnings
(Off
, Found
);
799 procedure Search_Stack
800 (Top
: Suppress_Stack_Entry_Ptr
;
801 Found
: out Boolean);
802 -- Search given suppress stack for matching entry for entity. If found
803 -- then set Checks_May_Be_Suppressed on To, and push an appropriate
804 -- entry for To onto the local suppress stack.
810 procedure Search_Stack
811 (Top
: Suppress_Stack_Entry_Ptr
;
814 Ptr
: Suppress_Stack_Entry_Ptr
;
818 while Ptr
/= null loop
820 and then (Ptr
.Check
= All_Checks
or else Ptr
.Check
= C
)
823 Set_Checks_May_Be_Suppressed
(To
, True);
824 Push_Local_Suppress_Stack_Entry
840 -- Start of processing for Copy_Suppress_Status
843 if not Checks_May_Be_Suppressed
(From
) then
847 -- First search the global entity suppress table for a matching entry.
848 -- We also search this in reverse order so that if there are multiple
849 -- pragmas for the same entity, the last one applies.
851 Search_Stack
(Global_Suppress_Stack_Top
, Found
);
857 -- Now search the local entity suppress stack, we search this in
858 -- reverse order so that we get the innermost entry that applies to
859 -- this case if there are nested entries. Note that for the purpose
860 -- of this procedure we are ONLY looking for entries corresponding
861 -- to a two-argument Suppress, where the second argument matches From.
863 Search_Stack
(Local_Suppress_Stack_Top
, Found
);
864 end Copy_Suppress_Status
;
866 -------------------------
867 -- Enter_Generic_Scope --
868 -------------------------
870 procedure Enter_Generic_Scope
(S
: Entity_Id
) is
872 if No
(Outer_Generic_Scope
) then
873 Outer_Generic_Scope
:= S
;
875 end Enter_Generic_Scope
;
877 ------------------------
878 -- Exit_Generic_Scope --
879 ------------------------
881 procedure Exit_Generic_Scope
(S
: Entity_Id
) is
883 if S
= Outer_Generic_Scope
then
884 Outer_Generic_Scope
:= Empty
;
886 end Exit_Generic_Scope
;
888 -----------------------
889 -- Explicit_Suppress --
890 -----------------------
892 function Explicit_Suppress
(E
: Entity_Id
; C
: Check_Id
) return Boolean is
893 Ptr
: Suppress_Stack_Entry_Ptr
;
896 if not Checks_May_Be_Suppressed
(E
) then
900 Ptr
:= Global_Suppress_Stack_Top
;
901 while Ptr
/= null loop
903 and then (Ptr
.Check
= All_Checks
or else Ptr
.Check
= C
)
913 end Explicit_Suppress
;
915 -----------------------------
916 -- External_Ref_In_Generic --
917 -----------------------------
919 function External_Ref_In_Generic
(E
: Entity_Id
) return Boolean is
923 -- Entity is global if defined outside of current outer_generic_scope:
924 -- Either the entity has a smaller depth that the outer generic, or it
925 -- is in a different compilation unit, or it is defined within a unit
926 -- in the same compilation, that is not within the outer_generic.
928 if No
(Outer_Generic_Scope
) then
931 elsif Scope_Depth
(Scope
(E
)) < Scope_Depth
(Outer_Generic_Scope
)
932 or else not In_Same_Source_Unit
(E
, Outer_Generic_Scope
)
938 while Present
(Scop
) loop
939 if Scop
= Outer_Generic_Scope
then
941 elsif Scope_Depth
(Scop
) < Scope_Depth
(Outer_Generic_Scope
) then
944 Scop
:= Scope
(Scop
);
950 end External_Ref_In_Generic
;
956 procedure Initialize
is
957 Next
: Suppress_Stack_Entry_Ptr
;
959 procedure Free
is new Unchecked_Deallocation
960 (Suppress_Stack_Entry
, Suppress_Stack_Entry_Ptr
);
963 -- Free any global suppress stack entries from a previous invocation
964 -- of the compiler (in the normal case this loop does nothing).
966 while Suppress_Stack_Entries
/= null loop
967 Next
:= Suppress_Stack_Entries
.Next
;
968 Free
(Suppress_Stack_Entries
);
969 Suppress_Stack_Entries
:= Next
;
972 Local_Suppress_Stack_Top
:= null;
973 Global_Suppress_Stack_Top
:= null;
975 -- Clear scope stack, and reset global variables
978 Unloaded_Subunits
:= False;
981 ------------------------------
982 -- Insert_After_And_Analyze --
983 ------------------------------
985 procedure Insert_After_And_Analyze
(N
: Node_Id
; M
: Node_Id
) is
991 -- If we are not at the end of the list, then the easiest
992 -- coding is simply to insert before our successor
994 if Present
(Next
(N
)) then
995 Insert_Before_And_Analyze
(Next
(N
), M
);
997 -- Case of inserting at the end of the list
1000 -- Capture the Node_Id of the node to be inserted. This Node_Id
1001 -- will still be the same after the insert operation.
1004 Insert_After
(N
, M
);
1006 -- Now just analyze from the inserted node to the end of
1007 -- the new list (note that this properly handles the case
1008 -- where any of the analyze calls result in the insertion of
1009 -- nodes after the analyzed node, expecting analysis).
1011 while Present
(Node
) loop
1013 Mark_Rewrite_Insertion
(Node
);
1018 end Insert_After_And_Analyze
;
1020 -- Version with check(s) suppressed
1022 procedure Insert_After_And_Analyze
1025 Suppress
: Check_Id
)
1028 if Suppress
= All_Checks
then
1030 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
1032 Scope_Suppress
.Suppress
:= (others => True);
1033 Insert_After_And_Analyze
(N
, M
);
1034 Scope_Suppress
.Suppress
:= Svs
;
1039 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
1041 Scope_Suppress
.Suppress
(Suppress
) := True;
1042 Insert_After_And_Analyze
(N
, M
);
1043 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
1046 end Insert_After_And_Analyze
;
1048 -------------------------------
1049 -- Insert_Before_And_Analyze --
1050 -------------------------------
1052 procedure Insert_Before_And_Analyze
(N
: Node_Id
; M
: Node_Id
) is
1058 -- Capture the Node_Id of the first list node to be inserted.
1059 -- This will still be the first node after the insert operation,
1060 -- since Insert_List_After does not modify the Node_Id values.
1063 Insert_Before
(N
, M
);
1065 -- The insertion does not change the Id's of any of the nodes in
1066 -- the list, and they are still linked, so we can simply loop from
1067 -- the original first node until we meet the node before which the
1068 -- insertion is occurring. Note that this properly handles the case
1069 -- where any of the analyzed nodes insert nodes after themselves,
1070 -- expecting them to get analyzed.
1072 while Node
/= N
loop
1074 Mark_Rewrite_Insertion
(Node
);
1078 end Insert_Before_And_Analyze
;
1080 -- Version with check(s) suppressed
1082 procedure Insert_Before_And_Analyze
1085 Suppress
: Check_Id
)
1088 if Suppress
= All_Checks
then
1090 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
1092 Scope_Suppress
.Suppress
:= (others => True);
1093 Insert_Before_And_Analyze
(N
, M
);
1094 Scope_Suppress
.Suppress
:= Svs
;
1099 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
1101 Scope_Suppress
.Suppress
(Suppress
) := True;
1102 Insert_Before_And_Analyze
(N
, M
);
1103 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
1106 end Insert_Before_And_Analyze
;
1108 -----------------------------------
1109 -- Insert_List_After_And_Analyze --
1110 -----------------------------------
1112 procedure Insert_List_After_And_Analyze
(N
: Node_Id
; L
: List_Id
) is
1113 After
: constant Node_Id
:= Next
(N
);
1117 if Is_Non_Empty_List
(L
) then
1119 -- Capture the Node_Id of the first list node to be inserted.
1120 -- This will still be the first node after the insert operation,
1121 -- since Insert_List_After does not modify the Node_Id values.
1124 Insert_List_After
(N
, L
);
1126 -- Now just analyze from the original first node until we get to the
1127 -- successor of the original insertion point (which may be Empty if
1128 -- the insertion point was at the end of the list). Note that this
1129 -- properly handles the case where any of the analyze calls result in
1130 -- the insertion of nodes after the analyzed node (possibly calling
1131 -- this routine recursively).
1133 while Node
/= After
loop
1135 Mark_Rewrite_Insertion
(Node
);
1139 end Insert_List_After_And_Analyze
;
1141 -- Version with check(s) suppressed
1143 procedure Insert_List_After_And_Analyze
1144 (N
: Node_Id
; L
: List_Id
; Suppress
: Check_Id
)
1147 if Suppress
= All_Checks
then
1149 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
1151 Scope_Suppress
.Suppress
:= (others => True);
1152 Insert_List_After_And_Analyze
(N
, L
);
1153 Scope_Suppress
.Suppress
:= Svs
;
1158 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
1160 Scope_Suppress
.Suppress
(Suppress
) := True;
1161 Insert_List_After_And_Analyze
(N
, L
);
1162 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
1165 end Insert_List_After_And_Analyze
;
1167 ------------------------------------
1168 -- Insert_List_Before_And_Analyze --
1169 ------------------------------------
1171 procedure Insert_List_Before_And_Analyze
(N
: Node_Id
; L
: List_Id
) is
1175 if Is_Non_Empty_List
(L
) then
1177 -- Capture the Node_Id of the first list node to be inserted. This
1178 -- will still be the first node after the insert operation, since
1179 -- Insert_List_After does not modify the Node_Id values.
1182 Insert_List_Before
(N
, L
);
1184 -- The insertion does not change the Id's of any of the nodes in
1185 -- the list, and they are still linked, so we can simply loop from
1186 -- the original first node until we meet the node before which the
1187 -- insertion is occurring. Note that this properly handles the case
1188 -- where any of the analyzed nodes insert nodes after themselves,
1189 -- expecting them to get analyzed.
1191 while Node
/= N
loop
1193 Mark_Rewrite_Insertion
(Node
);
1197 end Insert_List_Before_And_Analyze
;
1199 -- Version with check(s) suppressed
1201 procedure Insert_List_Before_And_Analyze
1202 (N
: Node_Id
; L
: List_Id
; Suppress
: Check_Id
)
1205 if Suppress
= All_Checks
then
1207 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
1209 Scope_Suppress
.Suppress
:= (others => True);
1210 Insert_List_Before_And_Analyze
(N
, L
);
1211 Scope_Suppress
.Suppress
:= Svs
;
1216 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
1218 Scope_Suppress
.Suppress
(Suppress
) := True;
1219 Insert_List_Before_And_Analyze
(N
, L
);
1220 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
1223 end Insert_List_Before_And_Analyze
;
1231 Scope_Stack
.Locked
:= True;
1232 Scope_Stack
.Release
;
1239 procedure Preanalyze
(N
: Node_Id
) is
1240 Save_Full_Analysis
: constant Boolean := Full_Analysis
;
1243 Full_Analysis
:= False;
1244 Expander_Mode_Save_And_Set
(False);
1248 Expander_Mode_Restore
;
1249 Full_Analysis
:= Save_Full_Analysis
;
1252 --------------------------------------
1253 -- Push_Global_Suppress_Stack_Entry --
1254 --------------------------------------
1256 procedure Push_Global_Suppress_Stack_Entry
1257 (Entity
: Entity_Id
;
1262 Global_Suppress_Stack_Top
:=
1263 new Suppress_Stack_Entry
'
1266 Suppress => Suppress,
1267 Prev => Global_Suppress_Stack_Top,
1268 Next => Suppress_Stack_Entries);
1269 Suppress_Stack_Entries := Global_Suppress_Stack_Top;
1271 end Push_Global_Suppress_Stack_Entry;
1273 -------------------------------------
1274 -- Push_Local_Suppress_Stack_Entry --
1275 -------------------------------------
1277 procedure Push_Local_Suppress_Stack_Entry
1278 (Entity : Entity_Id;
1283 Local_Suppress_Stack_Top :=
1284 new Suppress_Stack_Entry'
1287 Suppress
=> Suppress
,
1288 Prev
=> Local_Suppress_Stack_Top
,
1289 Next
=> Suppress_Stack_Entries
);
1290 Suppress_Stack_Entries
:= Local_Suppress_Stack_Top
;
1293 end Push_Local_Suppress_Stack_Entry
;
1299 procedure Semantics
(Comp_Unit
: Node_Id
) is
1301 -- The following locations save the corresponding global flags and
1302 -- variables so that they can be restored on completion. This is needed
1303 -- so that calls to Rtsfind start with the proper default values for
1304 -- these variables, and also that such calls do not disturb the settings
1305 -- for units being analyzed at a higher level.
1307 S_Current_Sem_Unit
: constant Unit_Number_Type
:= Current_Sem_Unit
;
1308 S_Full_Analysis
: constant Boolean := Full_Analysis
;
1309 S_GNAT_Mode
: constant Boolean := GNAT_Mode
;
1310 S_Global_Dis_Names
: constant Boolean := Global_Discard_Names
;
1311 S_In_Assertion_Expr
: constant Nat
:= In_Assertion_Expr
;
1312 S_In_Default_Expr
: constant Boolean := In_Default_Expr
;
1313 S_In_Spec_Expr
: constant Boolean := In_Spec_Expression
;
1314 S_Inside_A_Generic
: constant Boolean := Inside_A_Generic
;
1315 S_Outer_Gen_Scope
: constant Entity_Id
:= Outer_Generic_Scope
;
1316 S_Style_Check
: constant Boolean := Style_Check
;
1318 Curunit
: constant Unit_Number_Type
:= Get_Cunit_Unit_Number
(Comp_Unit
);
1319 -- New value of Current_Sem_Unit
1321 Generic_Main
: constant Boolean :=
1322 Nkind
(Unit
(Cunit
(Main_Unit
))) in N_Generic_Declaration
;
1323 -- If the main unit is generic, every compiled unit, including its
1324 -- context, is compiled with expansion disabled.
1326 Is_Main_Unit_Or_Main_Unit_Spec
: constant Boolean :=
1329 (Nkind
(Unit
(Cunit
(Main_Unit
))) = N_Package_Body
1330 and then Library_Unit
(Cunit
(Main_Unit
)) = Cunit
(Curunit
));
1331 -- Configuration flags have special settings when compiling a predefined
1332 -- file as a main unit. This applies to its spec as well.
1334 Ext_Main_Source_Unit
: constant Boolean :=
1335 In_Extended_Main_Source_Unit
(Comp_Unit
);
1336 -- Determine if unit is in extended main source unit
1338 Save_Config_Switches
: Config_Switches_Type
;
1339 -- Variable used to save values of config switches while we analyze the
1340 -- new unit, to be restored on exit for proper recursive behavior.
1342 Save_Cunit_Restrictions
: Save_Cunit_Boolean_Restrictions
;
1343 -- Used to save non-partition wide restrictions before processing new
1344 -- unit. All with'ed units are analyzed with config restrictions reset
1345 -- and we need to restore these saved values at the end.
1347 procedure Do_Analyze
;
1348 -- Procedure to analyze the compilation unit
1354 procedure Do_Analyze
is
1358 List
:= Save_Scope_Stack
;
1359 Push_Scope
(Standard_Standard
);
1360 Scope_Suppress
:= Suppress_Options
;
1362 (Scope_Stack
.Last
).Component_Alignment_Default
:= Calign_Default
;
1364 (Scope_Stack
.Last
).Is_Active_Stack_Base
:= True;
1365 Outer_Generic_Scope
:= Empty
;
1367 -- Now analyze the top level compilation unit node
1369 Analyze
(Comp_Unit
);
1371 -- Check for scope mismatch on exit from compilation
1373 pragma Assert
(Current_Scope
= Standard_Standard
1374 or else Comp_Unit
= Cunit
(Main_Unit
));
1376 -- Then pop entry for Standard, and pop implicit types
1379 Restore_Scope_Stack
(List
);
1382 Already_Analyzed
: constant Boolean := Analyzed
(Comp_Unit
);
1384 -- Start of processing for Semantics
1387 if Debug_Unit_Walk
then
1388 if Already_Analyzed
then
1389 Write_Str
("(done)");
1393 (Get_Cunit_Unit_Number
(Comp_Unit
),
1399 Compiler_State
:= Analyzing
;
1400 Current_Sem_Unit
:= Curunit
;
1402 -- Compile predefined units with GNAT_Mode set to True, to properly
1403 -- process the categorization stuff. However, do not set GNAT_Mode
1404 -- to True for the renamings units (Text_IO, IO_Exceptions, Direct_IO,
1405 -- Sequential_IO) as this would prevent pragma Extend_System from being
1406 -- taken into account, for example when Text_IO is renaming DEC.Text_IO.
1408 if Is_Predefined_File_Name
1409 (Unit_File_Name
(Current_Sem_Unit
), Renamings_Included
=> False)
1414 -- For generic main, never do expansion
1416 if Generic_Main
then
1417 Expander_Mode_Save_And_Set
(False);
1422 Expander_Mode_Save_And_Set
1424 -- Turn on expansion if generating code
1426 (Operating_Mode
= Generate_Code
1428 -- or if special debug flag -gnatdx is set
1430 or else Debug_Flag_X
1432 -- Or if in configuration run-time mode. We do this so we get
1433 -- error messages about missing entities in the run-time even
1434 -- if we are compiling in -gnatc (no code generation) mode.
1435 -- Similar processing applies to No_Run_Time_Mode. However,
1436 -- don't do this if debug flag -gnatd.Z is set (this is to handle
1437 -- a situation where this new processing causes trouble).
1439 or else ((Configurable_Run_Time_Mode
or No_Run_Time_Mode
)
1440 and not Debug_Flag_Dot_ZZ
));
1443 Full_Analysis
:= True;
1444 Inside_A_Generic
:= False;
1445 In_Assertion_Expr
:= 0;
1446 In_Default_Expr
:= False;
1447 In_Spec_Expression
:= False;
1448 Set_Comes_From_Source_Default
(False);
1450 -- Save current config switches and reset then appropriately
1452 Save_Opt_Config_Switches
(Save_Config_Switches
);
1453 Set_Opt_Config_Switches
1454 (Is_Internal_File_Name
(Unit_File_Name
(Current_Sem_Unit
)),
1455 Is_Main_Unit_Or_Main_Unit_Spec
);
1457 -- Save current non-partition-wide restrictions
1459 Save_Cunit_Restrictions
:= Cunit_Boolean_Restrictions_Save
;
1461 -- For unit in main extended unit, we reset the configuration values
1462 -- for the non-partition-wide restrictions. For other units reset them.
1464 if Ext_Main_Source_Unit
then
1465 Restore_Config_Cunit_Boolean_Restrictions
;
1467 Reset_Cunit_Boolean_Restrictions
;
1470 -- Turn off style checks for unit that is not in the extended main
1471 -- source unit. This improves processing efficiency for such units
1472 -- (for which we don't want style checks anyway, and where they will
1473 -- get suppressed), and is definitely needed to stop some style checks
1474 -- from invading the run-time units (e.g. overriding checks).
1476 if not Ext_Main_Source_Unit
then
1477 Style_Check
:= False;
1479 -- If this is part of the extended main source unit, set style check
1480 -- mode to match the style check mode of the main source unit itself.
1483 Style_Check
:= Style_Check_Main
;
1486 -- Only do analysis of unit that has not already been analyzed
1488 if not Analyzed
(Comp_Unit
) then
1489 Initialize_Version
(Current_Sem_Unit
);
1491 -- Do analysis, and then append the compilation unit onto the
1492 -- Comp_Unit_List, if appropriate. This is done after analysis,
1493 -- so if this unit depends on some others, they have already been
1494 -- appended. We ignore bodies, except for the main unit itself, and
1495 -- for subprogram bodies that act as specs. We have also to guard
1496 -- against ill-formed subunits that have an improper context.
1500 if Present
(Comp_Unit
)
1501 and then Nkind
(Unit
(Comp_Unit
)) in N_Proper_Body
1502 and then (Nkind
(Unit
(Comp_Unit
)) /= N_Subprogram_Body
1503 or else not Acts_As_Spec
(Comp_Unit
))
1504 and then not In_Extended_Main_Source_Unit
(Comp_Unit
)
1509 Append_New_Elmt
(Comp_Unit
, To
=> Comp_Unit_List
);
1511 if Debug_Unit_Walk
then
1512 Write_Str
("Appending ");
1514 (Get_Cunit_Unit_Number
(Comp_Unit
), Unit
(Comp_Unit
));
1519 -- Save indication of dynamic elaboration checks for ALI file
1521 Set_Dynamic_Elab
(Current_Sem_Unit
, Dynamic_Elaboration_Checks
);
1523 -- Restore settings of saved switches to entry values
1525 Current_Sem_Unit
:= S_Current_Sem_Unit
;
1526 Full_Analysis
:= S_Full_Analysis
;
1527 Global_Discard_Names
:= S_Global_Dis_Names
;
1528 GNAT_Mode
:= S_GNAT_Mode
;
1529 In_Assertion_Expr
:= S_In_Assertion_Expr
;
1530 In_Default_Expr
:= S_In_Default_Expr
;
1531 In_Spec_Expression
:= S_In_Spec_Expr
;
1532 Inside_A_Generic
:= S_Inside_A_Generic
;
1533 Outer_Generic_Scope
:= S_Outer_Gen_Scope
;
1534 Style_Check
:= S_Style_Check
;
1536 Restore_Opt_Config_Switches
(Save_Config_Switches
);
1538 -- Deal with restore of restrictions
1540 Cunit_Boolean_Restrictions_Restore
(Save_Cunit_Restrictions
);
1542 Expander_Mode_Restore
;
1544 if Debug_Unit_Walk
then
1547 if Already_Analyzed
then
1548 Write_Str
("(done)");
1552 (Get_Cunit_Unit_Number
(Comp_Unit
),
1562 function ss
(Index
: Int
) return Scope_Stack_Entry
is
1564 return Scope_Stack
.Table
(Index
);
1571 function sst
return Scope_Stack_Entry
is
1573 return ss
(Scope_Stack
.Last
);
1576 ------------------------
1577 -- Walk_Library_Items --
1578 ------------------------
1580 procedure Walk_Library_Items
is
1581 type Unit_Number_Set
is array (Main_Unit
.. Last_Unit
) of Boolean;
1582 pragma Pack
(Unit_Number_Set
);
1584 Main_CU
: constant Node_Id
:= Cunit
(Main_Unit
);
1586 Seen
, Done
: Unit_Number_Set
:= (others => False);
1587 -- Seen (X) is True after we have seen unit X in the walk. This is used
1588 -- to prevent processing the same unit more than once. Done (X) is True
1589 -- after we have fully processed X, and is used only for debugging
1590 -- printouts and assertions.
1592 Do_Main
: Boolean := False;
1593 -- Flag to delay processing the main body until after all other units.
1594 -- This is needed because the spec of the main unit may appear in the
1595 -- context of some other unit. We do not want this to force processing
1596 -- of the main body before all other units have been processed.
1598 -- Another circularity pattern occurs when the main unit is a child unit
1599 -- and the body of an ancestor has a with-clause of the main unit or on
1600 -- one of its children. In both cases the body in question has a with-
1601 -- clause on the main unit, and must be excluded from the traversal. In
1602 -- some convoluted cases this may lead to a CodePeer error because the
1603 -- spec of a subprogram declared in an instance within the parent will
1604 -- not be seen in the main unit.
1606 function Depends_On_Main
(CU
: Node_Id
) return Boolean;
1607 -- The body of a unit that is withed by the spec of the main unit may in
1608 -- turn have a with_clause on that spec. In that case do not traverse
1609 -- the body, to prevent loops. It can also happen that the main body has
1610 -- a with_clause on a child, which of course has an implicit with on its
1611 -- parent. It's OK to traverse the child body if the main spec has been
1612 -- processed, otherwise we also have a circularity to avoid.
1614 procedure Do_Action
(CU
: Node_Id
; Item
: Node_Id
);
1615 -- Calls Action, with some validity checks
1617 procedure Do_Unit_And_Dependents
(CU
: Node_Id
; Item
: Node_Id
);
1618 -- Calls Do_Action, first on the units with'ed by this one, then on
1619 -- this unit. If it's an instance body, do the spec first. If it is
1620 -- an instance spec, do the body last.
1622 procedure Do_Withed_Unit
(Withed_Unit
: Node_Id
);
1623 -- Apply Do_Unit_And_Dependents to a unit in a context clause
1625 procedure Process_Bodies_In_Context
(Comp
: Node_Id
);
1626 -- The main unit and its spec may depend on bodies that contain generics
1627 -- that are instantiated in them. Iterate through the corresponding
1628 -- contexts before processing main (spec/body) itself, to process bodies
1629 -- that may be present, together with their context. The spec of main
1630 -- is processed wherever it appears in the list of units, while the body
1631 -- is processed as the last unit in the list.
1633 ---------------------
1634 -- Depends_On_Main --
1635 ---------------------
1637 function Depends_On_Main
(CU
: Node_Id
) return Boolean is
1639 MCU
: constant Node_Id
:= Unit
(Main_CU
);
1642 CL
:= First
(Context_Items
(CU
));
1644 -- Problem does not arise with main subprograms
1647 not Nkind_In
(MCU
, N_Package_Body
, N_Package_Declaration
)
1652 while Present
(CL
) loop
1653 if Nkind
(CL
) = N_With_Clause
1654 and then Library_Unit
(CL
) = Main_CU
1655 and then not Done
(Get_Cunit_Unit_Number
(Library_Unit
(CL
)))
1664 end Depends_On_Main
;
1670 procedure Do_Action
(CU
: Node_Id
; Item
: Node_Id
) is
1672 -- This calls Action at the end. All the preceding code is just
1673 -- assertions and debugging output.
1675 pragma Assert
(No
(CU
) or else Nkind
(CU
) = N_Compilation_Unit
);
1677 case Nkind
(Item
) is
1678 when N_Generic_Subprogram_Declaration |
1679 N_Generic_Package_Declaration |
1680 N_Package_Declaration |
1681 N_Subprogram_Declaration |
1682 N_Subprogram_Renaming_Declaration |
1683 N_Package_Renaming_Declaration |
1684 N_Generic_Function_Renaming_Declaration |
1685 N_Generic_Package_Renaming_Declaration |
1686 N_Generic_Procedure_Renaming_Declaration
=>
1692 when N_Package_Body
=>
1694 -- Package bodies are processed separately if the main unit
1699 when N_Subprogram_Body
=>
1701 -- A subprogram body must be the main unit
1703 pragma Assert
(Acts_As_Spec
(CU
)
1704 or else CU
= Cunit
(Main_Unit
));
1707 when N_Function_Instantiation |
1708 N_Procedure_Instantiation |
1709 N_Package_Instantiation
=>
1711 -- Can only happen if some generic body (needed for gnat2scil
1712 -- traversal, but not by GNAT) is not available, ignore.
1716 -- All other cases cannot happen
1719 pragma Assert
(False, "subunit");
1723 pragma Assert
(False);
1727 if Present
(CU
) then
1728 pragma Assert
(Item
/= Stand
.Standard_Package_Node
);
1729 pragma Assert
(Item
= Unit
(CU
));
1732 Unit_Num
: constant Unit_Number_Type
:=
1733 Get_Cunit_Unit_Number
(CU
);
1735 procedure Assert_Done
(Withed_Unit
: Node_Id
);
1736 -- Assert Withed_Unit is already Done, unless it's a body. It
1737 -- might seem strange for a with_clause to refer to a body, but
1738 -- this happens in the case of a generic instantiation, which
1739 -- gets transformed into the instance body (and the instance
1740 -- spec is also created). With clauses pointing to the
1741 -- instantiation end up pointing to the instance body.
1747 procedure Assert_Done
(Withed_Unit
: Node_Id
) is
1749 if not Done
(Get_Cunit_Unit_Number
(Withed_Unit
)) then
1751 (Unit
(Withed_Unit
),
1752 N_Generic_Package_Declaration
,
1754 N_Package_Renaming_Declaration
,
1758 (Unit_Name
(Get_Cunit_Unit_Number
(Withed_Unit
)));
1759 Write_Str
(" not yet walked!");
1761 if Get_Cunit_Unit_Number
(Withed_Unit
) = Unit_Num
then
1762 Write_Str
(" (self-ref)");
1767 pragma Assert
(False);
1772 procedure Assert_Withed_Units_Done
is
1773 new Walk_Withs
(Assert_Done
);
1776 if Debug_Unit_Walk
then
1777 Write_Unit_Info
(Unit_Num
, Item
, Withs
=> True);
1780 -- Main unit should come last, except in the case where we
1781 -- skipped System_Aux_Id, in which case we missed the things it
1782 -- depends on, and in the case of parent bodies if present.
1785 (not Done
(Main_Unit
)
1786 or else Present
(System_Aux_Id
)
1787 or else Nkind
(Item
) = N_Package_Body
);
1789 -- We shouldn't do the same thing twice
1791 pragma Assert
(not Done
(Unit_Num
));
1793 -- Everything we depend upon should already be done
1796 (Assert_Withed_Units_Done
(CU
, Include_Limited
=> False));
1800 -- Must be Standard, which has no entry in the units table
1802 pragma Assert
(Item
= Stand
.Standard_Package_Node
);
1804 if Debug_Unit_Walk
then
1805 Write_Line
("Standard");
1812 --------------------
1813 -- Do_Withed_Unit --
1814 --------------------
1816 procedure Do_Withed_Unit
(Withed_Unit
: Node_Id
) is
1818 Do_Unit_And_Dependents
(Withed_Unit
, Unit
(Withed_Unit
));
1820 -- If the unit in the with_clause is a generic instance, the clause
1821 -- now denotes the instance body. Traverse the corresponding spec
1822 -- because there may be no other dependence that will force the
1823 -- traversal of its own context.
1825 if Nkind
(Unit
(Withed_Unit
)) = N_Package_Body
1826 and then Is_Generic_Instance
1827 (Defining_Entity
(Unit
(Library_Unit
(Withed_Unit
))))
1829 Do_Withed_Unit
(Library_Unit
(Withed_Unit
));
1833 ----------------------------
1834 -- Do_Unit_And_Dependents --
1835 ----------------------------
1837 procedure Do_Unit_And_Dependents
(CU
: Node_Id
; Item
: Node_Id
) is
1838 Unit_Num
: constant Unit_Number_Type
:= Get_Cunit_Unit_Number
(CU
);
1840 Body_U
: Unit_Number_Type
;
1841 Parent_CU
: Node_Id
;
1843 procedure Do_Withed_Units
is new Walk_Withs
(Do_Withed_Unit
);
1846 if not Seen
(Unit_Num
) then
1848 -- Process the with clauses
1850 Do_Withed_Units
(CU
, Include_Limited
=> False);
1852 -- Process the unit if it is a spec or the main unit, if it
1853 -- has no previous spec or we have done all other units.
1855 if not Nkind_In
(Item
, N_Package_Body
, N_Subprogram_Body
)
1856 or else Acts_As_Spec
(CU
)
1858 if CU
= Cunit
(Main_Unit
)
1859 and then not Do_Main
1861 Seen
(Unit_Num
) := False;
1864 Seen
(Unit_Num
) := True;
1866 if CU
= Library_Unit
(Main_CU
) then
1867 Process_Bodies_In_Context
(CU
);
1869 -- If main is a child unit, examine parent unit contexts
1870 -- to see if they include instantiated units. Also, if
1871 -- the parent itself is an instance, process its body
1872 -- because it may contain subprograms that are called
1873 -- in the main unit.
1875 if Is_Child_Unit
(Cunit_Entity
(Main_Unit
)) then
1876 Child
:= Cunit_Entity
(Main_Unit
);
1877 while Is_Child_Unit
(Child
) loop
1880 (Get_Cunit_Entity_Unit_Number
(Scope
(Child
)));
1881 Process_Bodies_In_Context
(Parent_CU
);
1883 if Nkind
(Unit
(Parent_CU
)) = N_Package_Body
1885 Nkind
(Original_Node
(Unit
(Parent_CU
)))
1886 = N_Package_Instantiation
1888 not Seen
(Get_Cunit_Unit_Number
(Parent_CU
))
1890 Body_U
:= Get_Cunit_Unit_Number
(Parent_CU
);
1891 Seen
(Body_U
) := True;
1892 Do_Action
(Parent_CU
, Unit
(Parent_CU
));
1893 Done
(Body_U
) := True;
1896 Child
:= Scope
(Child
);
1901 Do_Action
(CU
, Item
);
1902 Done
(Unit_Num
) := True;
1906 end Do_Unit_And_Dependents
;
1908 -------------------------------
1909 -- Process_Bodies_In_Context --
1910 -------------------------------
1912 procedure Process_Bodies_In_Context
(Comp
: Node_Id
) is
1914 Body_U
: Unit_Number_Type
;
1918 procedure Do_Withed_Units
is new Walk_Withs
(Do_Withed_Unit
);
1920 -- Start of processing for Process_Bodies_In_Context
1923 Clause
:= First
(Context_Items
(Comp
));
1924 while Present
(Clause
) loop
1925 if Nkind
(Clause
) = N_With_Clause
then
1926 Spec
:= Library_Unit
(Clause
);
1927 Body_CU
:= Library_Unit
(Spec
);
1929 -- If we are processing the spec of the main unit, load bodies
1930 -- only if the with_clause indicates that it forced the loading
1931 -- of the body for a generic instantiation. Note that bodies of
1932 -- parents that are instances have been loaded already.
1934 if Present
(Body_CU
)
1935 and then Body_CU
/= Cunit
(Main_Unit
)
1936 and then Nkind
(Unit
(Body_CU
)) /= N_Subprogram_Body
1937 and then (Nkind
(Unit
(Comp
)) /= N_Package_Declaration
1938 or else Present
(Withed_Body
(Clause
)))
1940 Body_U
:= Get_Cunit_Unit_Number
(Body_CU
);
1942 if not Seen
(Body_U
)
1943 and then not Depends_On_Main
(Body_CU
)
1945 Seen
(Body_U
) := True;
1946 Do_Withed_Units
(Body_CU
, Include_Limited
=> False);
1947 Do_Action
(Body_CU
, Unit
(Body_CU
));
1948 Done
(Body_U
) := True;
1955 end Process_Bodies_In_Context
;
1957 -- Local Declarations
1961 -- Start of processing for Walk_Library_Items
1964 if Debug_Unit_Walk
then
1965 Write_Line
("Walk_Library_Items:");
1969 -- Do Standard first, then walk the Comp_Unit_List
1971 Do_Action
(Empty
, Standard_Package_Node
);
1973 -- First place the context of all instance bodies on the corresponding
1974 -- spec, because it may be needed to analyze the code at the place of
1975 -- the instantiation.
1977 Cur
:= First_Elmt
(Comp_Unit_List
);
1978 while Present
(Cur
) loop
1980 CU
: constant Node_Id
:= Node
(Cur
);
1981 N
: constant Node_Id
:= Unit
(CU
);
1984 if Nkind
(N
) = N_Package_Body
1985 and then Is_Generic_Instance
(Defining_Entity
(N
))
1988 (Context_Items
(CU
), Context_Items
(Library_Unit
(CU
)));
1995 -- Now traverse compilation units (specs) in order
1997 Cur
:= First_Elmt
(Comp_Unit_List
);
1998 while Present
(Cur
) loop
2000 CU
: constant Node_Id
:= Node
(Cur
);
2001 N
: constant Node_Id
:= Unit
(CU
);
2005 pragma Assert
(Nkind
(CU
) = N_Compilation_Unit
);
2009 -- If it is a subprogram body, process it if it has no
2012 -- If it's a package body, ignore it, unless it is a body
2013 -- created for an instance that is the main unit. In the case
2014 -- of subprograms, the body is the wrapper package. In case of
2015 -- a package, the original file carries the body, and the spec
2016 -- appears as a later entry in the units list.
2018 -- Otherwise bodies appear in the list only because of inlining
2019 -- or instantiations, and they are processed only if relevant.
2020 -- The flag Withed_Body on a context clause indicates that a
2021 -- unit contains an instantiation that may be needed later,
2022 -- and therefore the body that contains the generic body (and
2023 -- its context) must be traversed immediately after the
2024 -- corresponding spec (see Do_Unit_And_Dependents).
2026 -- The main unit itself is processed separately after all other
2027 -- specs, and relevant bodies are examined in Process_Main.
2029 when N_Subprogram_Body
=>
2030 if Acts_As_Spec
(N
) then
2031 Do_Unit_And_Dependents
(CU
, N
);
2034 when N_Package_Body
=>
2036 and then Nkind
(Original_Node
(Unit
(Main_CU
))) in
2037 N_Generic_Instantiation
2038 and then Present
(Library_Unit
(Main_CU
))
2040 Do_Unit_And_Dependents
2041 (Library_Unit
(Main_CU
),
2042 Unit
(Library_Unit
(Main_CU
)));
2045 -- It's a spec, process it, and the units it depends on,
2046 -- unless it is a descendent of the main unit. This can
2047 -- happen when the body of a parent depends on some other
2051 Par
:= Scope
(Defining_Entity
(Unit
(CU
)));
2053 if Is_Child_Unit
(Defining_Entity
(Unit
(CU
))) then
2055 and then Par
/= Standard_Standard
2056 and then Par
/= Cunit_Entity
(Main_Unit
)
2062 if Par
/= Cunit_Entity
(Main_Unit
) then
2063 Do_Unit_And_Dependents
(CU
, N
);
2071 -- Now process package bodies on which main depends, followed by bodies
2072 -- of parents, if present, and finally main itself.
2074 if not Done
(Main_Unit
) then
2077 Process_Main
: declare
2078 Parent_CU
: Node_Id
;
2080 Body_U
: Unit_Number_Type
;
2083 function Is_Subunit_Of_Main
(U
: Node_Id
) return Boolean;
2084 -- If the main unit has subunits, their context may include
2085 -- bodies that are needed in the body of main. We must examine
2086 -- the context of the subunits, which are otherwise not made
2087 -- explicit in the main unit.
2089 ------------------------
2090 -- Is_Subunit_Of_Main --
2091 ------------------------
2093 function Is_Subunit_Of_Main
(U
: Node_Id
) return Boolean is
2099 Lib
:= Library_Unit
(U
);
2100 return Nkind
(Unit
(U
)) = N_Subunit
2102 (Lib
= Cunit
(Main_Unit
)
2103 or else Is_Subunit_Of_Main
(Lib
));
2105 end Is_Subunit_Of_Main
;
2107 -- Start of processing for Process_Main
2110 Process_Bodies_In_Context
(Main_CU
);
2112 for Unit_Num
in Done
'Range loop
2113 if Is_Subunit_Of_Main
(Cunit
(Unit_Num
)) then
2114 Process_Bodies_In_Context
(Cunit
(Unit_Num
));
2118 -- If the main unit is a child unit, parent bodies may be present
2119 -- because they export instances or inlined subprograms. Check for
2120 -- presence of these, which are not present in context clauses.
2121 -- Note that if the parents are instances, their bodies have been
2122 -- processed before the main spec, because they may be needed
2123 -- therein, so the following loop only affects non-instances.
2125 if Is_Child_Unit
(Cunit_Entity
(Main_Unit
)) then
2126 Child
:= Cunit_Entity
(Main_Unit
);
2127 while Is_Child_Unit
(Child
) loop
2129 Cunit
(Get_Cunit_Entity_Unit_Number
(Scope
(Child
)));
2130 Body_CU
:= Library_Unit
(Parent_CU
);
2132 if Present
(Body_CU
)
2133 and then not Seen
(Get_Cunit_Unit_Number
(Body_CU
))
2134 and then not Depends_On_Main
(Body_CU
)
2136 Body_U
:= Get_Cunit_Unit_Number
(Body_CU
);
2137 Seen
(Body_U
) := True;
2138 Do_Action
(Body_CU
, Unit
(Body_CU
));
2139 Done
(Body_U
) := True;
2142 Child
:= Scope
(Child
);
2146 Do_Action
(Main_CU
, Unit
(Main_CU
));
2147 Done
(Main_Unit
) := True;
2151 if Debug_Unit_Walk
then
2152 if Done
/= (Done
'Range => True) then
2154 Write_Line
("Ignored units:");
2158 for Unit_Num
in Done
'Range loop
2159 if not Done
(Unit_Num
) then
2161 (Unit_Num
, Unit
(Cunit
(Unit_Num
)), Withs
=> True);
2169 pragma Assert
(Done
(Main_Unit
));
2171 if Debug_Unit_Walk
then
2173 Write_Line
("end Walk_Library_Items.");
2175 end Walk_Library_Items
;
2181 procedure Walk_Withs
(CU
: Node_Id
; Include_Limited
: Boolean) is
2182 pragma Assert
(Nkind
(CU
) = N_Compilation_Unit
);
2183 pragma Assert
(Nkind
(Unit
(CU
)) /= N_Subunit
);
2185 procedure Walk_Immediate
is new Walk_Withs_Immediate
(Action
);
2188 -- First walk the withs immediately on the library item
2190 Walk_Immediate
(CU
, Include_Limited
);
2192 -- For a body, we must also check for any subunits which belong to it
2193 -- and which have context clauses of their own, since these with'ed
2194 -- units are part of its own dependencies.
2196 if Nkind
(Unit
(CU
)) in N_Unit_Body
then
2197 for S
in Main_Unit
.. Last_Unit
loop
2199 -- We are only interested in subunits. For preproc. data and def.
2200 -- files, Cunit is Empty, so we need to test that first.
2202 if Cunit
(S
) /= Empty
2203 and then Nkind
(Unit
(Cunit
(S
))) = N_Subunit
2209 Pnode
:= Library_Unit
(Cunit
(S
));
2211 -- In -gnatc mode, the errors in the subunits will not have
2212 -- been recorded, but the analysis of the subunit may have
2213 -- failed, so just quit.
2219 -- Find ultimate parent of the subunit
2221 while Nkind
(Unit
(Pnode
)) = N_Subunit
loop
2222 Pnode
:= Library_Unit
(Pnode
);
2225 -- See if it belongs to current unit, and if so, include its
2226 -- with_clauses. Do not process main unit prematurely.
2228 if Pnode
= CU
and then CU
/= Cunit
(Main_Unit
) then
2229 Walk_Immediate
(Cunit
(S
), Include_Limited
);
2237 --------------------------
2238 -- Walk_Withs_Immediate --
2239 --------------------------
2241 procedure Walk_Withs_Immediate
(CU
: Node_Id
; Include_Limited
: Boolean) is
2242 pragma Assert
(Nkind
(CU
) = N_Compilation_Unit
);
2244 Context_Item
: Node_Id
;
2249 Context_Item
:= First
(Context_Items
(CU
));
2250 while Present
(Context_Item
) loop
2251 if Nkind
(Context_Item
) = N_With_Clause
2252 and then (Include_Limited
2253 or else not Limited_Present
(Context_Item
))
2255 Lib_Unit
:= Library_Unit
(Context_Item
);
2258 -- If the context item indicates that a package body is needed
2259 -- because of an instantiation in CU, traverse the body now, even
2260 -- if CU is not related to the main unit. If the generic itself
2261 -- appears in a package body, the context item is this body, and
2262 -- it already appears in the traversal order, so we only need to
2263 -- examine the case of a context item being a package declaration.
2265 if Present
(Withed_Body
(Context_Item
))
2266 and then Nkind
(Unit
(Lib_Unit
)) = N_Package_Declaration
2267 and then Present
(Corresponding_Body
(Unit
(Lib_Unit
)))
2271 (Unit_Declaration_Node
2272 (Corresponding_Body
(Unit
(Lib_Unit
))));
2274 -- A body may have an implicit with on its own spec, in which
2275 -- case we must ignore this context item to prevent looping.
2277 if Unit
(CU
) /= Unit
(Body_CU
) then
2283 Context_Item
:= Next
(Context_Item
);
2285 end Walk_Withs_Immediate
;