1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2010, 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. --
18 -- You should have received a copy of the GNU General Public License along --
19 -- with this program; see file COPYING3. If not see --
20 -- <http://www.gnu.org/licenses/>. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 with Atree
; use Atree
;
28 with Debug
; use Debug
;
29 with Debug_A
; use Debug_A
;
30 with Elists
; use Elists
;
31 with Errout
; use Errout
;
32 with Expander
; use Expander
;
33 with Fname
; use Fname
;
36 with Lib
.Load
; use Lib
.Load
;
37 with Nlists
; use Nlists
;
38 with Output
; use Output
;
39 with Sem_Attr
; use Sem_Attr
;
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 Uintp
; use Uintp
;
57 with Uname
; use Uname
;
59 with Unchecked_Deallocation
;
61 pragma Warnings
(Off
, Sem_Util
);
62 -- Suppress warnings of unused with for Sem_Util (used only in asserts)
66 Debug_Unit_Walk
: Boolean renames Debug_Flag_Dot_WW
;
67 -- Controls debugging printouts for Walk_Library_Items
69 Outer_Generic_Scope
: Entity_Id
:= Empty
;
70 -- Global reference to the outer scope that is generic. In a non- generic
71 -- context, it is empty. At the moment, it is only used for avoiding
72 -- freezing of external references in generics.
74 Comp_Unit_List
: Elist_Id
:= No_Elist
;
75 -- Used by Walk_Library_Items. This is a list of N_Compilation_Unit nodes
76 -- processed by Semantics, in an appropriate order. Initialized to
77 -- No_Elist, because it's too early to call New_Elmt_List; we will set it
78 -- to New_Elmt_List on first use.
81 with procedure Action
(Withed_Unit
: Node_Id
);
82 procedure Walk_Withs_Immediate
(CU
: Node_Id
; Include_Limited
: Boolean);
83 -- Walk all the with clauses of CU, and call Action for the with'ed unit.
84 -- Ignore limited withs, unless Include_Limited is True. CU must be an
85 -- N_Compilation_Unit.
88 with procedure Action
(Withed_Unit
: Node_Id
);
89 procedure Walk_Withs
(CU
: Node_Id
; Include_Limited
: Boolean);
90 -- Same as Walk_Withs_Immediate, but also include with clauses on subunits
91 -- of this unit, since they count as dependences on their parent library
92 -- item. CU must be an N_Compilation_Unit whose Unit is not an N_Subunit.
94 procedure Write_Unit_Info
95 (Unit_Num
: Unit_Number_Type
;
97 Prefix
: String := "";
98 Withs
: Boolean := False);
99 -- Print out debugging information about the unit. Prefix precedes the rest
100 -- of the printout. If Withs is True, we print out units with'ed by this
101 -- unit (not counting limited withs).
107 procedure Analyze
(N
: Node_Id
) is
109 Debug_A_Entry
("analyzing ", N
);
111 -- Immediate return if already analyzed
114 Debug_A_Exit
("analyzing ", N
, " (done, analyzed already)");
118 -- Otherwise processing depends on the node kind
122 when N_Abort_Statement
=>
123 Analyze_Abort_Statement
(N
);
125 when N_Abstract_Subprogram_Declaration
=>
126 Analyze_Abstract_Subprogram_Declaration
(N
);
128 when N_Accept_Alternative
=>
129 Analyze_Accept_Alternative
(N
);
131 when N_Accept_Statement
=>
132 Analyze_Accept_Statement
(N
);
135 Analyze_Aggregate
(N
);
138 Analyze_Allocator
(N
);
141 Analyze_Short_Circuit
(N
);
143 when N_Assignment_Statement
=>
144 Analyze_Assignment
(N
);
146 when N_Asynchronous_Select
=>
147 Analyze_Asynchronous_Select
(N
);
150 Analyze_At_Clause
(N
);
152 when N_Attribute_Reference
=>
153 Analyze_Attribute
(N
);
155 when N_Attribute_Definition_Clause
=>
156 Analyze_Attribute_Definition_Clause
(N
);
158 when N_Block_Statement
=>
159 Analyze_Block_Statement
(N
);
161 when N_Case_Expression
=>
162 Analyze_Case_Expression
(N
);
164 when N_Case_Statement
=>
165 Analyze_Case_Statement
(N
);
167 when N_Character_Literal
=>
168 Analyze_Character_Literal
(N
);
170 when N_Code_Statement
=>
171 Analyze_Code_Statement
(N
);
173 when N_Compilation_Unit
=>
174 Analyze_Compilation_Unit
(N
);
176 when N_Component_Declaration
=>
177 Analyze_Component_Declaration
(N
);
179 when N_Conditional_Expression
=>
180 Analyze_Conditional_Expression
(N
);
182 when N_Conditional_Entry_Call
=>
183 Analyze_Conditional_Entry_Call
(N
);
185 when N_Delay_Alternative
=>
186 Analyze_Delay_Alternative
(N
);
188 when N_Delay_Relative_Statement
=>
189 Analyze_Delay_Relative
(N
);
191 when N_Delay_Until_Statement
=>
192 Analyze_Delay_Until
(N
);
195 Analyze_Entry_Body
(N
);
197 when N_Entry_Body_Formal_Part
=>
198 Analyze_Entry_Body_Formal_Part
(N
);
200 when N_Entry_Call_Alternative
=>
201 Analyze_Entry_Call_Alternative
(N
);
203 when N_Entry_Declaration
=>
204 Analyze_Entry_Declaration
(N
);
206 when N_Entry_Index_Specification
=>
207 Analyze_Entry_Index_Specification
(N
);
209 when N_Enumeration_Representation_Clause
=>
210 Analyze_Enumeration_Representation_Clause
(N
);
212 when N_Exception_Declaration
=>
213 Analyze_Exception_Declaration
(N
);
215 when N_Exception_Renaming_Declaration
=>
216 Analyze_Exception_Renaming
(N
);
218 when N_Exit_Statement
=>
219 Analyze_Exit_Statement
(N
);
221 when N_Expanded_Name
=>
222 Analyze_Expanded_Name
(N
);
224 when N_Explicit_Dereference
=>
225 Analyze_Explicit_Dereference
(N
);
227 when N_Expression_With_Actions
=>
228 Analyze_Expression_With_Actions
(N
);
230 when N_Extended_Return_Statement
=>
231 Analyze_Extended_Return_Statement
(N
);
233 when N_Extension_Aggregate
=>
234 Analyze_Aggregate
(N
);
236 when N_Formal_Object_Declaration
=>
237 Analyze_Formal_Object_Declaration
(N
);
239 when N_Formal_Package_Declaration
=>
240 Analyze_Formal_Package
(N
);
242 when N_Formal_Subprogram_Declaration
=>
243 Analyze_Formal_Subprogram
(N
);
245 when N_Formal_Type_Declaration
=>
246 Analyze_Formal_Type_Declaration
(N
);
248 when N_Free_Statement
=>
249 Analyze_Free_Statement
(N
);
251 when N_Freeze_Entity
=>
252 Analyze_Freeze_Entity
(N
);
254 when N_Full_Type_Declaration
=>
255 Analyze_Type_Declaration
(N
);
257 when N_Function_Call
=>
258 Analyze_Function_Call
(N
);
260 when N_Function_Instantiation
=>
261 Analyze_Function_Instantiation
(N
);
263 when N_Generic_Function_Renaming_Declaration
=>
264 Analyze_Generic_Function_Renaming
(N
);
266 when N_Generic_Package_Declaration
=>
267 Analyze_Generic_Package_Declaration
(N
);
269 when N_Generic_Package_Renaming_Declaration
=>
270 Analyze_Generic_Package_Renaming
(N
);
272 when N_Generic_Procedure_Renaming_Declaration
=>
273 Analyze_Generic_Procedure_Renaming
(N
);
275 when N_Generic_Subprogram_Declaration
=>
276 Analyze_Generic_Subprogram_Declaration
(N
);
278 when N_Goto_Statement
=>
279 Analyze_Goto_Statement
(N
);
281 when N_Handled_Sequence_Of_Statements
=>
282 Analyze_Handled_Statements
(N
);
285 Analyze_Identifier
(N
);
287 when N_If_Statement
=>
288 Analyze_If_Statement
(N
);
290 when N_Implicit_Label_Declaration
=>
291 Analyze_Implicit_Label_Declaration
(N
);
294 Analyze_Membership_Op
(N
);
296 when N_Incomplete_Type_Declaration
=>
297 Analyze_Incomplete_Type_Decl
(N
);
299 when N_Indexed_Component
=>
300 Analyze_Indexed_Component_Form
(N
);
302 when N_Integer_Literal
=>
303 Analyze_Integer_Literal
(N
);
305 when N_Itype_Reference
=>
306 Analyze_Itype_Reference
(N
);
311 when N_Loop_Statement
=>
312 Analyze_Loop_Statement
(N
);
315 Analyze_Membership_Op
(N
);
320 when N_Null_Statement
=>
321 Analyze_Null_Statement
(N
);
323 when N_Number_Declaration
=>
324 Analyze_Number_Declaration
(N
);
326 when N_Object_Declaration
=>
327 Analyze_Object_Declaration
(N
);
329 when N_Object_Renaming_Declaration
=>
330 Analyze_Object_Renaming
(N
);
332 when N_Operator_Symbol
=>
333 Analyze_Operator_Symbol
(N
);
336 Analyze_Unary_Op
(N
);
339 Analyze_Arithmetic_Op
(N
);
342 Analyze_Logical_Op
(N
);
345 Analyze_Concatenation
(N
);
348 Analyze_Arithmetic_Op
(N
);
351 Analyze_Equality_Op
(N
);
354 Analyze_Arithmetic_Op
(N
);
357 Analyze_Comparison_Op
(N
);
360 Analyze_Comparison_Op
(N
);
363 Analyze_Comparison_Op
(N
);
366 Analyze_Comparison_Op
(N
);
369 Analyze_Unary_Op
(N
);
372 Analyze_Arithmetic_Op
(N
);
374 when N_Op_Multiply
=>
375 Analyze_Arithmetic_Op
(N
);
378 Analyze_Equality_Op
(N
);
381 Analyze_Negation
(N
);
384 Analyze_Logical_Op
(N
);
387 Analyze_Unary_Op
(N
);
390 Analyze_Arithmetic_Op
(N
);
392 when N_Op_Rotate_Left
=>
393 Analyze_Arithmetic_Op
(N
);
395 when N_Op_Rotate_Right
=>
396 Analyze_Arithmetic_Op
(N
);
398 when N_Op_Shift_Left
=>
399 Analyze_Arithmetic_Op
(N
);
401 when N_Op_Shift_Right
=>
402 Analyze_Arithmetic_Op
(N
);
404 when N_Op_Shift_Right_Arithmetic
=>
405 Analyze_Arithmetic_Op
(N
);
407 when N_Op_Subtract
=>
408 Analyze_Arithmetic_Op
(N
);
411 Analyze_Logical_Op
(N
);
414 Analyze_Short_Circuit
(N
);
416 when N_Others_Choice
=>
417 Analyze_Others_Choice
(N
);
419 when N_Package_Body
=>
420 Analyze_Package_Body
(N
);
422 when N_Package_Body_Stub
=>
423 Analyze_Package_Body_Stub
(N
);
425 when N_Package_Declaration
=>
426 Analyze_Package_Declaration
(N
);
428 when N_Package_Instantiation
=>
429 Analyze_Package_Instantiation
(N
);
431 when N_Package_Renaming_Declaration
=>
432 Analyze_Package_Renaming
(N
);
434 when N_Package_Specification
=>
435 Analyze_Package_Specification
(N
);
437 when N_Parameter_Association
=>
438 Analyze_Parameter_Association
(N
);
443 when N_Private_Extension_Declaration
=>
444 Analyze_Private_Extension_Declaration
(N
);
446 when N_Private_Type_Declaration
=>
447 Analyze_Private_Type_Declaration
(N
);
449 when N_Procedure_Call_Statement
=>
450 Analyze_Procedure_Call
(N
);
452 when N_Procedure_Instantiation
=>
453 Analyze_Procedure_Instantiation
(N
);
455 when N_Protected_Body
=>
456 Analyze_Protected_Body
(N
);
458 when N_Protected_Body_Stub
=>
459 Analyze_Protected_Body_Stub
(N
);
461 when N_Protected_Definition
=>
462 Analyze_Protected_Definition
(N
);
464 when N_Protected_Type_Declaration
=>
465 Analyze_Protected_Type
(N
);
467 when N_Qualified_Expression
=>
468 Analyze_Qualified_Expression
(N
);
470 when N_Raise_Statement
=>
471 Analyze_Raise_Statement
(N
);
473 when N_Raise_xxx_Error
=>
474 Analyze_Raise_xxx_Error
(N
);
479 when N_Range_Constraint
=>
480 Analyze_Range
(Range_Expression
(N
));
482 when N_Real_Literal
=>
483 Analyze_Real_Literal
(N
);
485 when N_Record_Representation_Clause
=>
486 Analyze_Record_Representation_Clause
(N
);
489 Analyze_Reference
(N
);
491 when N_Requeue_Statement
=>
494 when N_Simple_Return_Statement
=>
495 Analyze_Simple_Return_Statement
(N
);
497 when N_Selected_Component
=>
498 Find_Selected_Component
(N
);
499 -- ??? why not Analyze_Selected_Component, needs comments
501 when N_Selective_Accept
=>
502 Analyze_Selective_Accept
(N
);
504 when N_Single_Protected_Declaration
=>
505 Analyze_Single_Protected
(N
);
507 when N_Single_Task_Declaration
=>
508 Analyze_Single_Task
(N
);
513 when N_String_Literal
=>
514 Analyze_String_Literal
(N
);
516 when N_Subprogram_Body
=>
517 Analyze_Subprogram_Body
(N
);
519 when N_Subprogram_Body_Stub
=>
520 Analyze_Subprogram_Body_Stub
(N
);
522 when N_Subprogram_Declaration
=>
523 Analyze_Subprogram_Declaration
(N
);
525 when N_Subprogram_Info
=>
526 Analyze_Subprogram_Info
(N
);
528 when N_Subprogram_Renaming_Declaration
=>
529 Analyze_Subprogram_Renaming
(N
);
531 when N_Subtype_Declaration
=>
532 Analyze_Subtype_Declaration
(N
);
534 when N_Subtype_Indication
=>
535 Analyze_Subtype_Indication
(N
);
541 Analyze_Task_Body
(N
);
543 when N_Task_Body_Stub
=>
544 Analyze_Task_Body_Stub
(N
);
546 when N_Task_Definition
=>
547 Analyze_Task_Definition
(N
);
549 when N_Task_Type_Declaration
=>
550 Analyze_Task_Type
(N
);
552 when N_Terminate_Alternative
=>
553 Analyze_Terminate_Alternative
(N
);
555 when N_Timed_Entry_Call
=>
556 Analyze_Timed_Entry_Call
(N
);
558 when N_Triggering_Alternative
=>
559 Analyze_Triggering_Alternative
(N
);
561 when N_Type_Conversion
=>
562 Analyze_Type_Conversion
(N
);
564 when N_Unchecked_Expression
=>
565 Analyze_Unchecked_Expression
(N
);
567 when N_Unchecked_Type_Conversion
=>
568 Analyze_Unchecked_Type_Conversion
(N
);
570 when N_Use_Package_Clause
=>
571 Analyze_Use_Package
(N
);
573 when N_Use_Type_Clause
=>
574 Analyze_Use_Type
(N
);
576 when N_Validate_Unchecked_Conversion
=>
579 when N_Variant_Part
=>
580 Analyze_Variant_Part
(N
);
582 when N_With_Clause
=>
583 Analyze_With_Clause
(N
);
585 -- A call to analyze the Empty node is an error, but most likely it
586 -- is an error caused by an attempt to analyze a malformed piece of
587 -- tree caused by some other error, so if there have been any other
588 -- errors, we just ignore it, otherwise it is a real internal error
589 -- which we complain about.
591 -- We must also consider the case of call to a runtime function that
592 -- is not available in the configurable runtime.
595 pragma Assert
(Serious_Errors_Detected
/= 0
596 or else Configurable_Run_Time_Violations
/= 0);
599 -- A call to analyze the error node is simply ignored, to avoid
600 -- causing cascaded errors (happens of course only in error cases)
605 -- Push/Pop nodes normally don't come through an analyze call. An
606 -- exception is the dummy ones bracketing a subprogram body. In any
607 -- case there is nothing to be done to analyze such nodes.
609 when N_Push_Pop_xxx_Label
=>
612 -- SCIL nodes don't need analysis because they are decorated when
613 -- they are built. They are added to the tree by Insert_Actions and
614 -- the call to analyze them is generated when the full list is
618 N_SCIL_Dispatch_Table_Tag_Init |
619 N_SCIL_Dispatching_Call |
620 N_SCIL_Membership_Test
=>
623 -- For the remaining node types, we generate compiler abort, because
624 -- these nodes are always analyzed within the Sem_Chn routines and
625 -- there should never be a case of making a call to the main Analyze
626 -- routine for these node kinds. For example, an N_Access_Definition
627 -- node appears only in the context of a type declaration, and is
628 -- processed by the analyze routine for type declarations.
632 N_Access_Definition |
633 N_Access_Function_Definition |
634 N_Access_Procedure_Definition |
635 N_Access_To_Object_Definition |
636 N_Case_Expression_Alternative |
637 N_Case_Statement_Alternative |
638 N_Compilation_Unit_Aux |
639 N_Component_Association |
641 N_Component_Definition |
643 N_Constrained_Array_Definition |
644 N_Decimal_Fixed_Point_Definition |
645 N_Defining_Character_Literal |
646 N_Defining_Identifier |
647 N_Defining_Operator_Symbol |
648 N_Defining_Program_Unit_Name |
650 N_Derived_Type_Definition |
652 N_Digits_Constraint |
653 N_Discriminant_Association |
654 N_Discriminant_Specification |
656 N_Entry_Call_Statement |
657 N_Enumeration_Type_Definition |
658 N_Exception_Handler |
659 N_Floating_Point_Definition |
660 N_Formal_Decimal_Fixed_Point_Definition |
661 N_Formal_Derived_Type_Definition |
662 N_Formal_Discrete_Type_Definition |
663 N_Formal_Floating_Point_Definition |
664 N_Formal_Modular_Type_Definition |
665 N_Formal_Ordinary_Fixed_Point_Definition |
666 N_Formal_Private_Type_Definition |
667 N_Formal_Signed_Integer_Type_Definition |
668 N_Function_Specification |
669 N_Generic_Association |
670 N_Index_Or_Discriminant_Constraint |
672 N_Loop_Parameter_Specification |
674 N_Modular_Type_Definition |
675 N_Ordinary_Fixed_Point_Definition |
676 N_Parameter_Specification |
677 N_Pragma_Argument_Association |
678 N_Procedure_Specification |
679 N_Real_Range_Specification |
680 N_Record_Definition |
681 N_Signed_Integer_Type_Definition |
682 N_Unconstrained_Array_Definition |
690 Debug_A_Exit
("analyzing ", N
, " (done)");
692 -- Now that we have analyzed the node, we call the expander to perform
693 -- possible expansion. We skip this for subexpressions, because we don't
694 -- have the type yet, and the expander will need to know the type before
695 -- it can do its job. For subexpression nodes, the call to the expander
696 -- happens in Sem_Res.Resolve. A special exception is Raise_xxx_Error,
697 -- which can appear in a statement context, and needs expanding now in
698 -- the case (distinguished by Etype, as documented in Sinfo).
700 -- The Analyzed flag is also set at this point for non-subexpression
701 -- nodes (in the case of subexpression nodes, we can't set the flag yet,
702 -- since resolution and expansion have not yet been completed). Note
703 -- that for N_Raise_xxx_Error we have to distinguish the expression
704 -- case from the statement case.
706 if Nkind
(N
) not in N_Subexpr
707 or else (Nkind
(N
) in N_Raise_xxx_Error
708 and then Etype
(N
) = Standard_Void_Type
)
714 -- Version with check(s) suppressed
716 procedure Analyze
(N
: Node_Id
; Suppress
: Check_Id
) is
718 if Suppress
= All_Checks
then
720 Svg
: constant Suppress_Array
:= Scope_Suppress
;
722 Scope_Suppress
:= (others => True);
724 Scope_Suppress
:= Svg
;
729 Svg
: constant Boolean := Scope_Suppress
(Suppress
);
731 Scope_Suppress
(Suppress
) := True;
733 Scope_Suppress
(Suppress
) := Svg
;
742 procedure Analyze_List
(L
: List_Id
) is
747 while Present
(Node
) loop
753 -- Version with check(s) suppressed
755 procedure Analyze_List
(L
: List_Id
; Suppress
: Check_Id
) is
757 if Suppress
= All_Checks
then
759 Svg
: constant Suppress_Array
:= Scope_Suppress
;
761 Scope_Suppress
:= (others => True);
763 Scope_Suppress
:= Svg
;
768 Svg
: constant Boolean := Scope_Suppress
(Suppress
);
770 Scope_Suppress
(Suppress
) := True;
772 Scope_Suppress
(Suppress
) := Svg
;
777 --------------------------
778 -- Copy_Suppress_Status --
779 --------------------------
781 procedure Copy_Suppress_Status
787 pragma Warnings
(Off
, Found
);
789 procedure Search_Stack
790 (Top
: Suppress_Stack_Entry_Ptr
;
791 Found
: out Boolean);
792 -- Search given suppress stack for matching entry for entity. If found
793 -- then set Checks_May_Be_Suppressed on To, and push an appropriate
794 -- entry for To onto the local suppress stack.
800 procedure Search_Stack
801 (Top
: Suppress_Stack_Entry_Ptr
;
804 Ptr
: Suppress_Stack_Entry_Ptr
;
808 while Ptr
/= null loop
810 and then (Ptr
.Check
= All_Checks
or else Ptr
.Check
= C
)
813 Set_Checks_May_Be_Suppressed
(To
, True);
814 Push_Local_Suppress_Stack_Entry
830 -- Start of processing for Copy_Suppress_Status
833 if not Checks_May_Be_Suppressed
(From
) then
837 -- First search the local entity suppress stack, we search this in
838 -- reverse order so that we get the innermost entry that applies to
839 -- this case if there are nested entries. Note that for the purpose
840 -- of this procedure we are ONLY looking for entries corresponding
841 -- to a two-argument Suppress, where the second argument matches From.
843 Search_Stack
(Global_Suppress_Stack_Top
, Found
);
849 -- Now search the global entity suppress table for a matching entry.
850 -- We also search this in reverse order so that if there are multiple
851 -- pragmas for the same entity, the last one applies.
853 Search_Stack
(Local_Suppress_Stack_Top
, Found
);
854 end Copy_Suppress_Status
;
856 -------------------------
857 -- Enter_Generic_Scope --
858 -------------------------
860 procedure Enter_Generic_Scope
(S
: Entity_Id
) is
862 if No
(Outer_Generic_Scope
) then
863 Outer_Generic_Scope
:= S
;
865 end Enter_Generic_Scope
;
867 ------------------------
868 -- Exit_Generic_Scope --
869 ------------------------
871 procedure Exit_Generic_Scope
(S
: Entity_Id
) is
873 if S
= Outer_Generic_Scope
then
874 Outer_Generic_Scope
:= Empty
;
876 end Exit_Generic_Scope
;
878 -----------------------
879 -- Explicit_Suppress --
880 -----------------------
882 function Explicit_Suppress
(E
: Entity_Id
; C
: Check_Id
) return Boolean is
883 Ptr
: Suppress_Stack_Entry_Ptr
;
886 if not Checks_May_Be_Suppressed
(E
) then
890 Ptr
:= Global_Suppress_Stack_Top
;
891 while Ptr
/= null loop
893 and then (Ptr
.Check
= All_Checks
or else Ptr
.Check
= C
)
903 end Explicit_Suppress
;
905 -----------------------------
906 -- External_Ref_In_Generic --
907 -----------------------------
909 function External_Ref_In_Generic
(E
: Entity_Id
) return Boolean is
913 -- Entity is global if defined outside of current outer_generic_scope:
914 -- Either the entity has a smaller depth that the outer generic, or it
915 -- is in a different compilation unit, or it is defined within a unit
916 -- in the same compilation, that is not within the outer_generic.
918 if No
(Outer_Generic_Scope
) then
921 elsif Scope_Depth
(Scope
(E
)) < Scope_Depth
(Outer_Generic_Scope
)
922 or else not In_Same_Source_Unit
(E
, Outer_Generic_Scope
)
929 while Present
(Scop
) loop
930 if Scop
= Outer_Generic_Scope
then
932 elsif Scope_Depth
(Scop
) < Scope_Depth
(Outer_Generic_Scope
) then
935 Scop
:= Scope
(Scop
);
941 end External_Ref_In_Generic
;
947 procedure Initialize
is
948 Next
: Suppress_Stack_Entry_Ptr
;
950 procedure Free
is new Unchecked_Deallocation
951 (Suppress_Stack_Entry
, Suppress_Stack_Entry_Ptr
);
954 -- Free any global suppress stack entries from a previous invocation
955 -- of the compiler (in the normal case this loop does nothing).
957 while Suppress_Stack_Entries
/= null loop
958 Next
:= Global_Suppress_Stack_Top
.Next
;
959 Free
(Suppress_Stack_Entries
);
960 Suppress_Stack_Entries
:= Next
;
963 Local_Suppress_Stack_Top
:= null;
964 Global_Suppress_Stack_Top
:= null;
966 -- Clear scope stack, and reset global variables
969 Unloaded_Subunits
:= False;
972 ------------------------------
973 -- Insert_After_And_Analyze --
974 ------------------------------
976 procedure Insert_After_And_Analyze
(N
: Node_Id
; M
: Node_Id
) is
982 -- If we are not at the end of the list, then the easiest
983 -- coding is simply to insert before our successor
985 if Present
(Next
(N
)) then
986 Insert_Before_And_Analyze
(Next
(N
), M
);
988 -- Case of inserting at the end of the list
991 -- Capture the Node_Id of the node to be inserted. This Node_Id
992 -- will still be the same after the insert operation.
997 -- Now just analyze from the inserted node to the end of
998 -- the new list (note that this properly handles the case
999 -- where any of the analyze calls result in the insertion of
1000 -- nodes after the analyzed node, expecting analysis).
1002 while Present
(Node
) loop
1004 Mark_Rewrite_Insertion
(Node
);
1009 end Insert_After_And_Analyze
;
1011 -- Version with check(s) suppressed
1013 procedure Insert_After_And_Analyze
1016 Suppress
: Check_Id
)
1019 if Suppress
= All_Checks
then
1021 Svg
: constant Suppress_Array
:= Scope_Suppress
;
1023 Scope_Suppress
:= (others => True);
1024 Insert_After_And_Analyze
(N
, M
);
1025 Scope_Suppress
:= Svg
;
1030 Svg
: constant Boolean := Scope_Suppress
(Suppress
);
1032 Scope_Suppress
(Suppress
) := True;
1033 Insert_After_And_Analyze
(N
, M
);
1034 Scope_Suppress
(Suppress
) := Svg
;
1037 end Insert_After_And_Analyze
;
1039 -------------------------------
1040 -- Insert_Before_And_Analyze --
1041 -------------------------------
1043 procedure Insert_Before_And_Analyze
(N
: Node_Id
; M
: Node_Id
) is
1049 -- Capture the Node_Id of the first list node to be inserted.
1050 -- This will still be the first node after the insert operation,
1051 -- since Insert_List_After does not modify the Node_Id values.
1054 Insert_Before
(N
, M
);
1056 -- The insertion does not change the Id's of any of the nodes in
1057 -- the list, and they are still linked, so we can simply loop from
1058 -- the original first node until we meet the node before which the
1059 -- insertion is occurring. Note that this properly handles the case
1060 -- where any of the analyzed nodes insert nodes after themselves,
1061 -- expecting them to get analyzed.
1063 while Node
/= N
loop
1065 Mark_Rewrite_Insertion
(Node
);
1069 end Insert_Before_And_Analyze
;
1071 -- Version with check(s) suppressed
1073 procedure Insert_Before_And_Analyze
1076 Suppress
: Check_Id
)
1079 if Suppress
= All_Checks
then
1081 Svg
: constant Suppress_Array
:= Scope_Suppress
;
1083 Scope_Suppress
:= (others => True);
1084 Insert_Before_And_Analyze
(N
, M
);
1085 Scope_Suppress
:= Svg
;
1090 Svg
: constant Boolean := Scope_Suppress
(Suppress
);
1092 Scope_Suppress
(Suppress
) := True;
1093 Insert_Before_And_Analyze
(N
, M
);
1094 Scope_Suppress
(Suppress
) := Svg
;
1097 end Insert_Before_And_Analyze
;
1099 -----------------------------------
1100 -- Insert_List_After_And_Analyze --
1101 -----------------------------------
1103 procedure Insert_List_After_And_Analyze
(N
: Node_Id
; L
: List_Id
) is
1104 After
: constant Node_Id
:= Next
(N
);
1108 if Is_Non_Empty_List
(L
) then
1110 -- Capture the Node_Id of the first list node to be inserted.
1111 -- This will still be the first node after the insert operation,
1112 -- since Insert_List_After does not modify the Node_Id values.
1115 Insert_List_After
(N
, L
);
1117 -- Now just analyze from the original first node until we get to the
1118 -- successor of the original insertion point (which may be Empty if
1119 -- the insertion point was at the end of the list). Note that this
1120 -- properly handles the case where any of the analyze calls result in
1121 -- the insertion of nodes after the analyzed node (possibly calling
1122 -- this routine recursively).
1124 while Node
/= After
loop
1126 Mark_Rewrite_Insertion
(Node
);
1130 end Insert_List_After_And_Analyze
;
1132 -- Version with check(s) suppressed
1134 procedure Insert_List_After_And_Analyze
1135 (N
: Node_Id
; L
: List_Id
; Suppress
: Check_Id
)
1138 if Suppress
= All_Checks
then
1140 Svg
: constant Suppress_Array
:= Scope_Suppress
;
1142 Scope_Suppress
:= (others => True);
1143 Insert_List_After_And_Analyze
(N
, L
);
1144 Scope_Suppress
:= Svg
;
1149 Svg
: constant Boolean := Scope_Suppress
(Suppress
);
1151 Scope_Suppress
(Suppress
) := True;
1152 Insert_List_After_And_Analyze
(N
, L
);
1153 Scope_Suppress
(Suppress
) := Svg
;
1156 end Insert_List_After_And_Analyze
;
1158 ------------------------------------
1159 -- Insert_List_Before_And_Analyze --
1160 ------------------------------------
1162 procedure Insert_List_Before_And_Analyze
(N
: Node_Id
; L
: List_Id
) is
1166 if Is_Non_Empty_List
(L
) then
1168 -- Capture the Node_Id of the first list node to be inserted. This
1169 -- will still be the first node after the insert operation, since
1170 -- Insert_List_After does not modify the Node_Id values.
1173 Insert_List_Before
(N
, L
);
1175 -- The insertion does not change the Id's of any of the nodes in
1176 -- the list, and they are still linked, so we can simply loop from
1177 -- the original first node until we meet the node before which the
1178 -- insertion is occurring. Note that this properly handles the case
1179 -- where any of the analyzed nodes insert nodes after themselves,
1180 -- expecting them to get analyzed.
1182 while Node
/= N
loop
1184 Mark_Rewrite_Insertion
(Node
);
1188 end Insert_List_Before_And_Analyze
;
1190 -- Version with check(s) suppressed
1192 procedure Insert_List_Before_And_Analyze
1193 (N
: Node_Id
; L
: List_Id
; Suppress
: Check_Id
)
1196 if Suppress
= All_Checks
then
1198 Svg
: constant Suppress_Array
:= Scope_Suppress
;
1200 Scope_Suppress
:= (others => True);
1201 Insert_List_Before_And_Analyze
(N
, L
);
1202 Scope_Suppress
:= Svg
;
1207 Svg
: constant Boolean := Scope_Suppress
(Suppress
);
1209 Scope_Suppress
(Suppress
) := True;
1210 Insert_List_Before_And_Analyze
(N
, L
);
1211 Scope_Suppress
(Suppress
) := Svg
;
1214 end Insert_List_Before_And_Analyze
;
1216 -------------------------
1217 -- Is_Check_Suppressed --
1218 -------------------------
1220 function Is_Check_Suppressed
(E
: Entity_Id
; C
: Check_Id
) return Boolean is
1222 Ptr
: Suppress_Stack_Entry_Ptr
;
1225 -- First search the local entity suppress stack. We search this from the
1226 -- top of the stack down so that we get the innermost entry that applies
1227 -- to this case if there are nested entries.
1229 Ptr
:= Local_Suppress_Stack_Top
;
1230 while Ptr
/= null loop
1231 if (Ptr
.Entity
= Empty
or else Ptr
.Entity
= E
)
1232 and then (Ptr
.Check
= All_Checks
or else Ptr
.Check
= C
)
1234 return Ptr
.Suppress
;
1240 -- Now search the global entity suppress table for a matching entry.
1241 -- We also search this from the top down so that if there are multiple
1242 -- pragmas for the same entity, the last one applies (not clear what
1243 -- or whether the RM specifies this handling, but it seems reasonable).
1245 Ptr
:= Global_Suppress_Stack_Top
;
1246 while Ptr
/= null loop
1247 if (Ptr
.Entity
= Empty
or else Ptr
.Entity
= E
)
1248 and then (Ptr
.Check
= All_Checks
or else Ptr
.Check
= C
)
1250 return Ptr
.Suppress
;
1256 -- If we did not find a matching entry, then use the normal scope
1257 -- suppress value after all (actually this will be the global setting
1258 -- since it clearly was not overridden at any point). For a predefined
1259 -- check, we test the specific flag. For a user defined check, we check
1260 -- the All_Checks flag.
1262 if C
in Predefined_Check_Id
then
1263 return Scope_Suppress
(C
);
1265 return Scope_Suppress
(All_Checks
);
1267 end Is_Check_Suppressed
;
1275 Scope_Stack
.Locked
:= True;
1276 Scope_Stack
.Release
;
1279 --------------------------------------
1280 -- Push_Global_Suppress_Stack_Entry --
1281 --------------------------------------
1283 procedure Push_Global_Suppress_Stack_Entry
1284 (Entity
: Entity_Id
;
1289 Global_Suppress_Stack_Top
:=
1290 new Suppress_Stack_Entry
'
1293 Suppress => Suppress,
1294 Prev => Global_Suppress_Stack_Top,
1295 Next => Suppress_Stack_Entries);
1296 Suppress_Stack_Entries := Global_Suppress_Stack_Top;
1299 end Push_Global_Suppress_Stack_Entry;
1301 -------------------------------------
1302 -- Push_Local_Suppress_Stack_Entry --
1303 -------------------------------------
1305 procedure Push_Local_Suppress_Stack_Entry
1306 (Entity : Entity_Id;
1311 Local_Suppress_Stack_Top :=
1312 new Suppress_Stack_Entry'
1315 Suppress
=> Suppress
,
1316 Prev
=> Local_Suppress_Stack_Top
,
1317 Next
=> Suppress_Stack_Entries
);
1318 Suppress_Stack_Entries
:= Local_Suppress_Stack_Top
;
1321 end Push_Local_Suppress_Stack_Entry
;
1327 procedure Semantics
(Comp_Unit
: Node_Id
) is
1329 -- The following locations save the corresponding global flags and
1330 -- variables so that they can be restored on completion. This is needed
1331 -- so that calls to Rtsfind start with the proper default values for
1332 -- these variables, and also that such calls do not disturb the settings
1333 -- for units being analyzed at a higher level.
1335 S_Current_Sem_Unit
: constant Unit_Number_Type
:= Current_Sem_Unit
;
1336 S_Full_Analysis
: constant Boolean := Full_Analysis
;
1337 S_GNAT_Mode
: constant Boolean := GNAT_Mode
;
1338 S_Global_Dis_Names
: constant Boolean := Global_Discard_Names
;
1339 S_In_Spec_Expr
: constant Boolean := In_Spec_Expression
;
1340 S_Inside_A_Generic
: constant Boolean := Inside_A_Generic
;
1341 S_New_Nodes_OK
: constant Int
:= New_Nodes_OK
;
1342 S_Outer_Gen_Scope
: constant Entity_Id
:= Outer_Generic_Scope
;
1344 Generic_Main
: constant Boolean :=
1345 Nkind
(Unit
(Cunit
(Main_Unit
)))
1346 in N_Generic_Declaration
;
1347 -- If the main unit is generic, every compiled unit, including its
1348 -- context, is compiled with expansion disabled.
1350 Save_Config_Switches
: Config_Switches_Type
;
1351 -- Variable used to save values of config switches while we analyze the
1352 -- new unit, to be restored on exit for proper recursive behavior.
1354 procedure Do_Analyze
;
1355 -- Procedure to analyze the compilation unit. This is called more than
1356 -- once when the high level optimizer is activated.
1362 procedure Do_Analyze
is
1365 Push_Scope
(Standard_Standard
);
1366 Scope_Suppress
:= Suppress_Options
;
1368 (Scope_Stack
.Last
).Component_Alignment_Default
:= Calign_Default
;
1370 (Scope_Stack
.Last
).Is_Active_Stack_Base
:= True;
1371 Outer_Generic_Scope
:= Empty
;
1373 -- Now analyze the top level compilation unit node
1375 Analyze
(Comp_Unit
);
1377 -- Check for scope mismatch on exit from compilation
1379 pragma Assert
(Current_Scope
= Standard_Standard
1380 or else Comp_Unit
= Cunit
(Main_Unit
));
1382 -- Then pop entry for Standard, and pop implicit types
1385 Restore_Scope_Stack
;
1388 Already_Analyzed
: constant Boolean := Analyzed
(Comp_Unit
);
1390 -- Start of processing for Semantics
1393 if Debug_Unit_Walk
then
1394 if Already_Analyzed
then
1395 Write_Str
("(done)");
1399 (Get_Cunit_Unit_Number
(Comp_Unit
),
1405 Compiler_State
:= Analyzing
;
1406 Current_Sem_Unit
:= Get_Cunit_Unit_Number
(Comp_Unit
);
1408 -- Compile predefined units with GNAT_Mode set to True, to properly
1409 -- process the categorization stuff. However, do not set GNAT_Mode
1410 -- to True for the renamings units (Text_IO, IO_Exceptions, Direct_IO,
1411 -- Sequential_IO) as this would prevent pragma Extend_System from being
1412 -- taken into account, for example when Text_IO is renaming DEC.Text_IO.
1414 -- Cleaner might be to do the kludge at the point of excluding the
1415 -- pragma (do not exclude for renamings ???)
1417 if Is_Predefined_File_Name
1418 (Unit_File_Name
(Current_Sem_Unit
), Renamings_Included
=> False)
1423 if Generic_Main
then
1424 Expander_Mode_Save_And_Set
(False);
1426 Expander_Mode_Save_And_Set
1427 (Operating_Mode
= Generate_Code
or Debug_Flag_X
);
1430 Full_Analysis
:= True;
1431 Inside_A_Generic
:= False;
1432 In_Spec_Expression
:= False;
1434 Set_Comes_From_Source_Default
(False);
1435 Save_Opt_Config_Switches
(Save_Config_Switches
);
1436 Set_Opt_Config_Switches
1437 (Is_Internal_File_Name
(Unit_File_Name
(Current_Sem_Unit
)),
1438 Current_Sem_Unit
= Main_Unit
);
1440 -- Only do analysis of unit that has not already been analyzed
1442 if not Analyzed
(Comp_Unit
) then
1443 Initialize_Version
(Current_Sem_Unit
);
1445 Expander_Mode_Save_And_Set
(False);
1448 Reset_Analyzed_Flags
(Comp_Unit
);
1449 Expander_Mode_Restore
;
1450 High_Level_Optimize
(Comp_Unit
);
1454 -- Do analysis, and then append the compilation unit onto the
1455 -- Comp_Unit_List, if appropriate. This is done after analysis, so
1456 -- if this unit depends on some others, they have already been
1457 -- appended. We ignore bodies, except for the main unit itself. We
1458 -- have also to guard against ill-formed subunits that have an
1459 -- improper context.
1463 if Present
(Comp_Unit
)
1464 and then Nkind
(Unit
(Comp_Unit
)) in N_Proper_Body
1465 and then not In_Extended_Main_Source_Unit
(Comp_Unit
)
1470 -- Initialize if first time
1472 if No
(Comp_Unit_List
) then
1473 Comp_Unit_List
:= New_Elmt_List
;
1476 Append_Elmt
(Comp_Unit
, Comp_Unit_List
);
1478 if Debug_Unit_Walk
then
1479 Write_Str
("Appending ");
1481 (Get_Cunit_Unit_Number
(Comp_Unit
), Unit
(Comp_Unit
));
1486 -- Save indication of dynamic elaboration checks for ALI file
1488 Set_Dynamic_Elab
(Current_Sem_Unit
, Dynamic_Elaboration_Checks
);
1490 -- Restore settings of saved switches to entry values
1492 Current_Sem_Unit
:= S_Current_Sem_Unit
;
1493 Full_Analysis
:= S_Full_Analysis
;
1494 Global_Discard_Names
:= S_Global_Dis_Names
;
1495 GNAT_Mode
:= S_GNAT_Mode
;
1496 In_Spec_Expression
:= S_In_Spec_Expr
;
1497 Inside_A_Generic
:= S_Inside_A_Generic
;
1498 New_Nodes_OK
:= S_New_Nodes_OK
;
1499 Outer_Generic_Scope
:= S_Outer_Gen_Scope
;
1501 Restore_Opt_Config_Switches
(Save_Config_Switches
);
1502 Expander_Mode_Restore
;
1504 if Debug_Unit_Walk
then
1507 if Already_Analyzed
then
1508 Write_Str
("(done)");
1512 (Get_Cunit_Unit_Number
(Comp_Unit
),
1518 ------------------------
1519 -- Walk_Library_Items --
1520 ------------------------
1522 procedure Walk_Library_Items
is
1523 type Unit_Number_Set
is array (Main_Unit
.. Last_Unit
) of Boolean;
1524 pragma Pack
(Unit_Number_Set
);
1526 Main_CU
: constant Node_Id
:= Cunit
(Main_Unit
);
1528 Seen
, Done
: Unit_Number_Set
:= (others => False);
1529 -- Seen (X) is True after we have seen unit X in the walk. This is used
1530 -- to prevent processing the same unit more than once. Done (X) is True
1531 -- after we have fully processed X, and is used only for debugging
1532 -- printouts and assertions.
1534 Do_Main
: Boolean := False;
1535 -- Flag to delay processing the main body until after all other units.
1536 -- This is needed because the spec of the main unit may appear in the
1537 -- context of some other unit. We do not want this to force processing
1538 -- of the main body before all other units have been processed.
1540 procedure Do_Action
(CU
: Node_Id
; Item
: Node_Id
);
1541 -- Calls Action, with some validity checks
1543 procedure Do_Unit_And_Dependents
(CU
: Node_Id
; Item
: Node_Id
);
1544 -- Calls Do_Action, first on the units with'ed by this one, then on
1545 -- this unit. If it's an instance body, do the spec first. If it is
1546 -- an instance spec, do the body last.
1548 procedure Do_Withed_Unit
(Withed_Unit
: Node_Id
);
1549 -- Apply Do_Unit_And_Dependents to a unit in a context clause.
1551 procedure Process_Bodies_In_Context
(Comp
: Node_Id
);
1552 -- The main unit and its spec may depend on bodies that contain generics
1553 -- that are instantiated in them. Iterate through the corresponding
1554 -- contexts before processing main (spec/body) itself, to process bodies
1555 -- that may be present, together with their context. The spec of main
1556 -- is processed wherever it appears in the list of units, while the body
1557 -- is processed as the last unit in the list.
1563 procedure Do_Action
(CU
: Node_Id
; Item
: Node_Id
) is
1565 -- This calls Action at the end. All the preceding code is just
1566 -- assertions and debugging output.
1568 pragma Assert
(No
(CU
) or else Nkind
(CU
) = N_Compilation_Unit
);
1570 case Nkind
(Item
) is
1571 when N_Generic_Subprogram_Declaration |
1572 N_Generic_Package_Declaration |
1573 N_Package_Declaration |
1574 N_Subprogram_Declaration |
1575 N_Subprogram_Renaming_Declaration |
1576 N_Package_Renaming_Declaration |
1577 N_Generic_Function_Renaming_Declaration |
1578 N_Generic_Package_Renaming_Declaration |
1579 N_Generic_Procedure_Renaming_Declaration
=>
1585 when N_Package_Body
=>
1587 -- Package bodies are processed separately if the main unit
1592 when N_Subprogram_Body
=>
1594 -- A subprogram body must be the main unit
1596 pragma Assert
(Acts_As_Spec
(CU
)
1597 or else CU
= Cunit
(Main_Unit
));
1600 when N_Function_Instantiation |
1601 N_Procedure_Instantiation |
1602 N_Package_Instantiation
=>
1604 -- Can only happen if some generic body (needed for gnat2scil
1605 -- traversal, but not by GNAT) is not available, ignore.
1609 -- All other cases cannot happen
1612 pragma Assert
(False, "subunit");
1616 pragma Assert
(False);
1620 if Present
(CU
) then
1621 pragma Assert
(Item
/= Stand
.Standard_Package_Node
);
1622 pragma Assert
(Item
= Unit
(CU
));
1625 Unit_Num
: constant Unit_Number_Type
:=
1626 Get_Cunit_Unit_Number
(CU
);
1628 procedure Assert_Done
(Withed_Unit
: Node_Id
);
1629 -- Assert Withed_Unit is already Done, unless it's a body. It
1630 -- might seem strange for a with_clause to refer to a body, but
1631 -- this happens in the case of a generic instantiation, which
1632 -- gets transformed into the instance body (and the instance
1633 -- spec is also created). With clauses pointing to the
1634 -- instantiation end up pointing to the instance body.
1640 procedure Assert_Done
(Withed_Unit
: Node_Id
) is
1642 if not Done
(Get_Cunit_Unit_Number
(Withed_Unit
)) then
1644 (Unit
(Withed_Unit
),
1645 N_Generic_Package_Declaration
,
1647 N_Package_Renaming_Declaration
,
1651 (Unit_Name
(Get_Cunit_Unit_Number
(Withed_Unit
)));
1652 Write_Str
(" not yet walked!");
1654 if Get_Cunit_Unit_Number
(Withed_Unit
) = Unit_Num
then
1655 Write_Str
(" (self-ref)");
1660 pragma Assert
(False);
1665 procedure Assert_Withed_Units_Done
is
1666 new Walk_Withs
(Assert_Done
);
1669 if Debug_Unit_Walk
then
1670 Write_Unit_Info
(Unit_Num
, Item
, Withs
=> True);
1673 -- Main unit should come last, except in the case where we
1674 -- skipped System_Aux_Id, in which case we missed the things it
1675 -- depends on, and in the case of parent bodies if present.
1678 (not Done
(Main_Unit
)
1679 or else Present
(System_Aux_Id
)
1680 or else Nkind
(Item
) = N_Package_Body
);
1682 -- We shouldn't do the same thing twice
1684 pragma Assert
(not Done
(Unit_Num
));
1686 -- Everything we depend upon should already be done
1689 (Assert_Withed_Units_Done
(CU
, Include_Limited
=> False));
1693 -- Must be Standard, which has no entry in the units table
1695 pragma Assert
(Item
= Stand
.Standard_Package_Node
);
1697 if Debug_Unit_Walk
then
1698 Write_Line
("Standard");
1705 --------------------
1706 -- Do_Withed_Unit --
1707 --------------------
1709 procedure Do_Withed_Unit
(Withed_Unit
: Node_Id
) is
1711 Do_Unit_And_Dependents
(Withed_Unit
, Unit
(Withed_Unit
));
1713 -- If the unit in the with_clause is a generic instance, the clause
1714 -- now denotes the instance body. Traverse the corresponding spec
1715 -- because there may be no other dependence that will force the
1716 -- traversal of its own context.
1718 if Nkind
(Unit
(Withed_Unit
)) = N_Package_Body
1719 and then Is_Generic_Instance
1720 (Defining_Entity
(Unit
(Library_Unit
(Withed_Unit
))))
1722 Do_Withed_Unit
(Library_Unit
(Withed_Unit
));
1726 ----------------------------
1727 -- Do_Unit_And_Dependents --
1728 ----------------------------
1730 procedure Do_Unit_And_Dependents
(CU
: Node_Id
; Item
: Node_Id
) is
1731 Unit_Num
: constant Unit_Number_Type
:= Get_Cunit_Unit_Number
(CU
);
1733 Body_U
: Unit_Number_Type
;
1734 Parent_CU
: Node_Id
;
1736 procedure Do_Withed_Units
is new Walk_Withs
(Do_Withed_Unit
);
1739 if not Seen
(Unit_Num
) then
1741 -- Process the with clauses
1743 Do_Withed_Units
(CU
, Include_Limited
=> False);
1745 -- Process the unit if it is a spec or the the main unit, if it
1746 -- has no previous spec or we have done all other units.
1748 if not Nkind_In
(Item
, N_Package_Body
, N_Subprogram_Body
)
1749 or else Acts_As_Spec
(CU
)
1751 if CU
= Cunit
(Main_Unit
)
1752 and then not Do_Main
1754 Seen
(Unit_Num
) := False;
1757 Seen
(Unit_Num
) := True;
1759 if CU
= Library_Unit
(Main_CU
) then
1760 Process_Bodies_In_Context
(CU
);
1762 -- If main is a child unit, examine parent unit contexts
1763 -- to see if they include instantiated units. Also, if
1764 -- the parent itself is an instance, process its body
1765 -- because it may contain subprograms that are called
1766 -- in the main unit.
1768 if Is_Child_Unit
(Cunit_Entity
(Main_Unit
)) then
1769 Child
:= Cunit_Entity
(Main_Unit
);
1770 while Is_Child_Unit
(Child
) loop
1773 (Get_Cunit_Entity_Unit_Number
(Scope
(Child
)));
1774 Process_Bodies_In_Context
(Parent_CU
);
1776 if Nkind
(Unit
(Parent_CU
)) = N_Package_Body
1778 Nkind
(Original_Node
(Unit
(Parent_CU
)))
1779 = N_Package_Instantiation
1781 not Seen
(Get_Cunit_Unit_Number
(Parent_CU
))
1783 Body_U
:= Get_Cunit_Unit_Number
(Parent_CU
);
1784 Seen
(Body_U
) := True;
1785 Do_Action
(Parent_CU
, Unit
(Parent_CU
));
1786 Done
(Body_U
) := True;
1789 Child
:= Scope
(Child
);
1794 Do_Action
(CU
, Item
);
1795 Done
(Unit_Num
) := True;
1799 end Do_Unit_And_Dependents
;
1801 -------------------------------
1802 -- Process_Bodies_In_Context --
1803 -------------------------------
1805 procedure Process_Bodies_In_Context
(Comp
: Node_Id
) is
1807 Body_U
: Unit_Number_Type
;
1811 procedure Do_Withed_Units
is new Walk_Withs
(Do_Withed_Unit
);
1813 function Depends_On_Main
(CU
: Node_Id
) return Boolean;
1814 -- The body of a unit that is withed by the spec of the main unit
1815 -- may in turn have a with_clause on that spec. In that case do not
1816 -- traverse the body, to prevent loops. It can also happen that the
1817 -- main body has a with_clause on a child, which of course has an
1818 -- implicit with on its parent. It's OK to traverse the child body
1819 -- if the main spec has been processed, otherwise we also have a
1820 -- circularity to avoid.
1822 ---------------------
1823 -- Depends_On_Main --
1824 ---------------------
1826 function Depends_On_Main
(CU
: Node_Id
) return Boolean is
1830 CL
:= First
(Context_Items
(CU
));
1832 -- Problem does not arise with main subprograms
1834 if Nkind
(Unit
(Main_CU
)) /= N_Package_Body
then
1838 while Present
(CL
) loop
1839 if Nkind
(CL
) = N_With_Clause
1840 and then Library_Unit
(CL
) = Library_Unit
(Main_CU
)
1841 and then not Done
(Get_Cunit_Unit_Number
(Library_Unit
(CL
)))
1850 end Depends_On_Main
;
1852 -- Start of processing for Process_Bodies_In_Context
1855 Clause
:= First
(Context_Items
(Comp
));
1856 while Present
(Clause
) loop
1857 if Nkind
(Clause
) = N_With_Clause
then
1858 Spec
:= Library_Unit
(Clause
);
1859 Body_CU
:= Library_Unit
(Spec
);
1861 -- If we are processing the spec of the main unit, load bodies
1862 -- only if the with_clause indicates that it forced the loading
1863 -- of the body for a generic instantiation. Note that bodies of
1864 -- parents that are instances have been loaded already.
1866 if Present
(Body_CU
)
1867 and then Body_CU
/= Cunit
(Main_Unit
)
1868 and then Nkind
(Unit
(Body_CU
)) /= N_Subprogram_Body
1869 and then (Nkind
(Unit
(Comp
)) /= N_Package_Declaration
1870 or else Present
(Withed_Body
(Clause
)))
1872 Body_U
:= Get_Cunit_Unit_Number
(Body_CU
);
1874 if not Seen
(Body_U
)
1875 and then not Depends_On_Main
(Body_CU
)
1877 Seen
(Body_U
) := True;
1878 Do_Withed_Units
(Body_CU
, Include_Limited
=> False);
1879 Do_Action
(Body_CU
, Unit
(Body_CU
));
1880 Done
(Body_U
) := True;
1887 end Process_Bodies_In_Context
;
1889 -- Local Declarations
1893 -- Start of processing for Walk_Library_Items
1896 if Debug_Unit_Walk
then
1897 Write_Line
("Walk_Library_Items:");
1901 -- Do Standard first, then walk the Comp_Unit_List
1903 Do_Action
(Empty
, Standard_Package_Node
);
1905 -- First place the context of all instance bodies on the corresponding
1906 -- spec, because it may be needed to analyze the code at the place of
1907 -- the instantiation.
1909 Cur
:= First_Elmt
(Comp_Unit_List
);
1910 while Present
(Cur
) loop
1912 CU
: constant Node_Id
:= Node
(Cur
);
1913 N
: constant Node_Id
:= Unit
(CU
);
1916 if Nkind
(N
) = N_Package_Body
1917 and then Is_Generic_Instance
(Defining_Entity
(N
))
1920 (Context_Items
(CU
), Context_Items
(Library_Unit
(CU
)));
1927 -- Now traverse compilation units (specs) in order
1929 Cur
:= First_Elmt
(Comp_Unit_List
);
1930 while Present
(Cur
) loop
1932 CU
: constant Node_Id
:= Node
(Cur
);
1933 N
: constant Node_Id
:= Unit
(CU
);
1936 pragma Assert
(Nkind
(CU
) = N_Compilation_Unit
);
1940 -- If it is a subprogram body, process it if it has no
1943 -- If it's a package body, ignore it, unless it is a body
1944 -- created for an instance that is the main unit. In the case
1945 -- of subprograms, the body is the wrapper package. In case of
1946 -- a package, the original file carries the body, and the spec
1947 -- appears as a later entry in the units list.
1949 -- Otherwise Bodies appear in the list only because of inlining
1950 -- or instantiations, and they are processed only if relevant
1951 -- to the main unit. The main unit itself is processed
1952 -- separately after all other specs.
1954 when N_Subprogram_Body
=>
1955 if Acts_As_Spec
(N
) then
1956 Do_Unit_And_Dependents
(CU
, N
);
1959 when N_Package_Body
=>
1961 and then Nkind
(Original_Node
(Unit
(Main_CU
))) in
1962 N_Generic_Instantiation
1963 and then Present
(Library_Unit
(Main_CU
))
1965 Do_Unit_And_Dependents
1966 (Library_Unit
(Main_CU
),
1967 Unit
(Library_Unit
(Main_CU
)));
1970 -- It's a spec, process it, and the units it depends on
1973 Do_Unit_And_Dependents
(CU
, N
);
1980 -- Now process package bodies on which main depends, followed by bodies
1981 -- of parents, if present, and finally main itself.
1983 if not Done
(Main_Unit
) then
1987 Parent_CU
: Node_Id
;
1989 Body_U
: Unit_Number_Type
;
1993 Process_Bodies_In_Context
(Main_CU
);
1995 -- If the main unit is a child unit, parent bodies may be present
1996 -- because they export instances or inlined subprograms. Check for
1997 -- presence of these, which are not present in context clauses.
1998 -- Note that if the parents are instances, their bodies have been
1999 -- processed before the main spec, because they may be needed
2000 -- therein, so the following loop only affects non-instances.
2002 if Is_Child_Unit
(Cunit_Entity
(Main_Unit
)) then
2003 Child
:= Cunit_Entity
(Main_Unit
);
2004 while Is_Child_Unit
(Child
) loop
2006 Cunit
(Get_Cunit_Entity_Unit_Number
(Scope
(Child
)));
2007 Body_CU
:= Library_Unit
(Parent_CU
);
2009 if Present
(Body_CU
)
2010 and then not Seen
(Get_Cunit_Unit_Number
(Body_CU
))
2012 Body_U
:= Get_Cunit_Unit_Number
(Body_CU
);
2013 Seen
(Body_U
) := True;
2014 Do_Action
(Body_CU
, Unit
(Body_CU
));
2015 Done
(Body_U
) := True;
2018 Child
:= Scope
(Child
);
2022 Do_Action
(Main_CU
, Unit
(Main_CU
));
2023 Done
(Main_Unit
) := True;
2027 if Debug_Unit_Walk
then
2028 if Done
/= (Done
'Range => True) then
2030 Write_Line
("Ignored units:");
2034 for Unit_Num
in Done
'Range loop
2035 if not Done
(Unit_Num
) then
2037 (Unit_Num
, Unit
(Cunit
(Unit_Num
)), Withs
=> True);
2045 pragma Assert
(Done
(Main_Unit
));
2047 if Debug_Unit_Walk
then
2049 Write_Line
("end Walk_Library_Items.");
2051 end Walk_Library_Items
;
2057 procedure Walk_Withs
(CU
: Node_Id
; Include_Limited
: Boolean) is
2058 pragma Assert
(Nkind
(CU
) = N_Compilation_Unit
);
2059 pragma Assert
(Nkind
(Unit
(CU
)) /= N_Subunit
);
2061 procedure Walk_Immediate
is new Walk_Withs_Immediate
(Action
);
2064 -- First walk the withs immediately on the library item
2066 Walk_Immediate
(CU
, Include_Limited
);
2068 -- For a body, we must also check for any subunits which belong to it
2069 -- and which have context clauses of their own, since these with'ed
2070 -- units are part of its own dependencies.
2072 if Nkind
(Unit
(CU
)) in N_Unit_Body
then
2073 for S
in Main_Unit
.. Last_Unit
loop
2075 -- We are only interested in subunits. For preproc. data and def.
2076 -- files, Cunit is Empty, so we need to test that first.
2078 if Cunit
(S
) /= Empty
2079 and then Nkind
(Unit
(Cunit
(S
))) = N_Subunit
2085 Pnode
:= Library_Unit
(Cunit
(S
));
2087 -- In -gnatc mode, the errors in the subunits will not have
2088 -- been recorded, but the analysis of the subunit may have
2089 -- failed, so just quit.
2095 -- Find ultimate parent of the subunit
2097 while Nkind
(Unit
(Pnode
)) = N_Subunit
loop
2098 Pnode
:= Library_Unit
(Pnode
);
2101 -- See if it belongs to current unit, and if so, include its
2102 -- with_clauses. Do not process main unit prematurely.
2104 if Pnode
= CU
and then CU
/= Cunit
(Main_Unit
) then
2105 Walk_Immediate
(Cunit
(S
), Include_Limited
);
2113 --------------------------
2114 -- Walk_Withs_Immediate --
2115 --------------------------
2117 procedure Walk_Withs_Immediate
(CU
: Node_Id
; Include_Limited
: Boolean) is
2118 pragma Assert
(Nkind
(CU
) = N_Compilation_Unit
);
2120 Context_Item
: Node_Id
;
2123 Context_Item
:= First
(Context_Items
(CU
));
2124 while Present
(Context_Item
) loop
2125 if Nkind
(Context_Item
) = N_With_Clause
2126 and then (Include_Limited
2127 or else not Limited_Present
(Context_Item
))
2129 Action
(Library_Unit
(Context_Item
));
2132 Context_Item
:= Next
(Context_Item
);
2134 end Walk_Withs_Immediate
;
2136 ---------------------
2137 -- Write_Unit_Info --
2138 ---------------------
2140 procedure Write_Unit_Info
2141 (Unit_Num
: Unit_Number_Type
;
2143 Prefix
: String := "";
2144 Withs
: Boolean := False)
2148 Write_Unit_Name
(Unit_Name
(Unit_Num
));
2149 Write_Str
(", unit ");
2150 Write_Int
(Int
(Unit_Num
));
2152 Write_Int
(Int
(Item
));
2154 Write_Str
(Node_Kind
'Image (Nkind
(Item
)));
2156 if Item
/= Original_Node
(Item
) then
2157 Write_Str
(", orig = ");
2158 Write_Int
(Int
(Original_Node
(Item
)));
2160 Write_Str
(Node_Kind
'Image (Nkind
(Original_Node
(Item
))));
2165 -- Skip the rest if we're not supposed to print the withs
2172 Context_Item
: Node_Id
;
2175 Context_Item
:= First
(Context_Items
(Cunit
(Unit_Num
)));
2176 while Present
(Context_Item
)
2177 and then (Nkind
(Context_Item
) /= N_With_Clause
2178 or else Limited_Present
(Context_Item
))
2180 Context_Item
:= Next
(Context_Item
);
2183 if Present
(Context_Item
) then
2185 Write_Line
("withs:");
2188 while Present
(Context_Item
) loop
2189 if Nkind
(Context_Item
) = N_With_Clause
2190 and then not Limited_Present
(Context_Item
)
2192 pragma Assert
(Present
(Library_Unit
(Context_Item
)));
2195 (Get_Cunit_Unit_Number
(Library_Unit
(Context_Item
))));
2197 if Implicit_With
(Context_Item
) then
2198 Write_Str
(" -- implicit");
2204 Context_Item
:= Next
(Context_Item
);
2208 Write_Line
("end withs");
2212 end Write_Unit_Info
;