1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2013, 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
;
36 with Output
; use Output
;
37 with Restrict
; use Restrict
;
38 with Sem_Attr
; use Sem_Attr
;
39 with Sem_Aux
; use Sem_Aux
;
40 with Sem_Ch2
; use Sem_Ch2
;
41 with Sem_Ch3
; use Sem_Ch3
;
42 with Sem_Ch4
; use Sem_Ch4
;
43 with Sem_Ch5
; use Sem_Ch5
;
44 with Sem_Ch6
; use Sem_Ch6
;
45 with Sem_Ch7
; use Sem_Ch7
;
46 with Sem_Ch8
; use Sem_Ch8
;
47 with Sem_Ch9
; use Sem_Ch9
;
48 with Sem_Ch10
; use Sem_Ch10
;
49 with Sem_Ch11
; use Sem_Ch11
;
50 with Sem_Ch12
; use Sem_Ch12
;
51 with Sem_Ch13
; use Sem_Ch13
;
52 with Sem_Prag
; use Sem_Prag
;
53 with Sem_Util
; use Sem_Util
;
54 with Sinfo
; use Sinfo
;
55 with Stand
; use Stand
;
56 with 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.
98 procedure Analyze
(N
: Node_Id
) is
100 Debug_A_Entry
("analyzing ", N
);
102 -- Immediate return if already analyzed
105 Debug_A_Exit
("analyzing ", N
, " (done, analyzed already)");
109 -- Otherwise processing depends on the node kind
113 when N_Abort_Statement
=>
114 Analyze_Abort_Statement
(N
);
116 when N_Abstract_Subprogram_Declaration
=>
117 Analyze_Abstract_Subprogram_Declaration
(N
);
119 when N_Accept_Alternative
=>
120 Analyze_Accept_Alternative
(N
);
122 when N_Accept_Statement
=>
123 Analyze_Accept_Statement
(N
);
126 Analyze_Aggregate
(N
);
129 Analyze_Allocator
(N
);
132 Analyze_Short_Circuit
(N
);
134 when N_Assignment_Statement
=>
135 Analyze_Assignment
(N
);
137 when N_Asynchronous_Select
=>
138 Analyze_Asynchronous_Select
(N
);
141 Analyze_At_Clause
(N
);
143 when N_Attribute_Reference
=>
144 Analyze_Attribute
(N
);
146 when N_Attribute_Definition_Clause
=>
147 Analyze_Attribute_Definition_Clause
(N
);
149 when N_Block_Statement
=>
150 Analyze_Block_Statement
(N
);
152 when N_Case_Expression
=>
153 Analyze_Case_Expression
(N
);
155 when N_Case_Statement
=>
156 Analyze_Case_Statement
(N
);
158 when N_Character_Literal
=>
159 Analyze_Character_Literal
(N
);
161 when N_Code_Statement
=>
162 Analyze_Code_Statement
(N
);
164 when N_Compilation_Unit
=>
165 Analyze_Compilation_Unit
(N
);
167 when N_Component_Declaration
=>
168 Analyze_Component_Declaration
(N
);
170 when N_Conditional_Entry_Call
=>
171 Analyze_Conditional_Entry_Call
(N
);
173 when N_Delay_Alternative
=>
174 Analyze_Delay_Alternative
(N
);
176 when N_Delay_Relative_Statement
=>
177 Analyze_Delay_Relative
(N
);
179 when N_Delay_Until_Statement
=>
180 Analyze_Delay_Until
(N
);
183 Analyze_Entry_Body
(N
);
185 when N_Entry_Body_Formal_Part
=>
186 Analyze_Entry_Body_Formal_Part
(N
);
188 when N_Entry_Call_Alternative
=>
189 Analyze_Entry_Call_Alternative
(N
);
191 when N_Entry_Declaration
=>
192 Analyze_Entry_Declaration
(N
);
194 when N_Entry_Index_Specification
=>
195 Analyze_Entry_Index_Specification
(N
);
197 when N_Enumeration_Representation_Clause
=>
198 Analyze_Enumeration_Representation_Clause
(N
);
200 when N_Exception_Declaration
=>
201 Analyze_Exception_Declaration
(N
);
203 when N_Exception_Renaming_Declaration
=>
204 Analyze_Exception_Renaming
(N
);
206 when N_Exit_Statement
=>
207 Analyze_Exit_Statement
(N
);
209 when N_Expanded_Name
=>
210 Analyze_Expanded_Name
(N
);
212 when N_Explicit_Dereference
=>
213 Analyze_Explicit_Dereference
(N
);
215 when N_Expression_Function
=>
216 Analyze_Expression_Function
(N
);
218 when N_Expression_With_Actions
=>
219 Analyze_Expression_With_Actions
(N
);
221 when N_Extended_Return_Statement
=>
222 Analyze_Extended_Return_Statement
(N
);
224 when N_Extension_Aggregate
=>
225 Analyze_Aggregate
(N
);
227 when N_Formal_Object_Declaration
=>
228 Analyze_Formal_Object_Declaration
(N
);
230 when N_Formal_Package_Declaration
=>
231 Analyze_Formal_Package_Declaration
(N
);
233 when N_Formal_Subprogram_Declaration
=>
234 Analyze_Formal_Subprogram_Declaration
(N
);
236 when N_Formal_Type_Declaration
=>
237 Analyze_Formal_Type_Declaration
(N
);
239 when N_Free_Statement
=>
240 Analyze_Free_Statement
(N
);
242 when N_Freeze_Entity
=>
243 Analyze_Freeze_Entity
(N
);
245 when N_Full_Type_Declaration
=>
246 Analyze_Full_Type_Declaration
(N
);
248 when N_Function_Call
=>
249 Analyze_Function_Call
(N
);
251 when N_Function_Instantiation
=>
252 Analyze_Function_Instantiation
(N
);
254 when N_Generic_Function_Renaming_Declaration
=>
255 Analyze_Generic_Function_Renaming
(N
);
257 when N_Generic_Package_Declaration
=>
258 Analyze_Generic_Package_Declaration
(N
);
260 when N_Generic_Package_Renaming_Declaration
=>
261 Analyze_Generic_Package_Renaming
(N
);
263 when N_Generic_Procedure_Renaming_Declaration
=>
264 Analyze_Generic_Procedure_Renaming
(N
);
266 when N_Generic_Subprogram_Declaration
=>
267 Analyze_Generic_Subprogram_Declaration
(N
);
269 when N_Goto_Statement
=>
270 Analyze_Goto_Statement
(N
);
272 when N_Handled_Sequence_Of_Statements
=>
273 Analyze_Handled_Statements
(N
);
276 Analyze_Identifier
(N
);
278 when N_If_Expression
=>
279 Analyze_If_Expression
(N
);
281 when N_If_Statement
=>
282 Analyze_If_Statement
(N
);
284 when N_Implicit_Label_Declaration
=>
285 Analyze_Implicit_Label_Declaration
(N
);
288 Analyze_Membership_Op
(N
);
290 when N_Incomplete_Type_Declaration
=>
291 Analyze_Incomplete_Type_Decl
(N
);
293 when N_Indexed_Component
=>
294 Analyze_Indexed_Component_Form
(N
);
296 when N_Integer_Literal
=>
297 Analyze_Integer_Literal
(N
);
299 when N_Iterator_Specification
=>
300 Analyze_Iterator_Specification
(N
);
302 when N_Itype_Reference
=>
303 Analyze_Itype_Reference
(N
);
308 when N_Loop_Parameter_Specification
=>
309 Analyze_Loop_Parameter_Specification
(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
);
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_Declaration
(N
);
467 when N_Qualified_Expression
=>
468 Analyze_Qualified_Expression
(N
);
470 when N_Quantified_Expression
=>
471 Analyze_Quantified_Expression
(N
);
473 when N_Raise_Expression
=>
474 Analyze_Raise_Expression
(N
);
476 when N_Raise_Statement
=>
477 Analyze_Raise_Statement
(N
);
479 when N_Raise_xxx_Error
=>
480 Analyze_Raise_xxx_Error
(N
);
485 when N_Range_Constraint
=>
486 Analyze_Range
(Range_Expression
(N
));
488 when N_Real_Literal
=>
489 Analyze_Real_Literal
(N
);
491 when N_Record_Representation_Clause
=>
492 Analyze_Record_Representation_Clause
(N
);
495 Analyze_Reference
(N
);
497 when N_Requeue_Statement
=>
500 when N_Simple_Return_Statement
=>
501 Analyze_Simple_Return_Statement
(N
);
503 when N_Selected_Component
=>
504 Find_Selected_Component
(N
);
505 -- ??? why not Analyze_Selected_Component, needs comments
507 when N_Selective_Accept
=>
508 Analyze_Selective_Accept
(N
);
510 when N_Single_Protected_Declaration
=>
511 Analyze_Single_Protected_Declaration
(N
);
513 when N_Single_Task_Declaration
=>
514 Analyze_Single_Task_Declaration
(N
);
519 when N_String_Literal
=>
520 Analyze_String_Literal
(N
);
522 when N_Subprogram_Body
=>
523 Analyze_Subprogram_Body
(N
);
525 when N_Subprogram_Body_Stub
=>
526 Analyze_Subprogram_Body_Stub
(N
);
528 when N_Subprogram_Declaration
=>
529 Analyze_Subprogram_Declaration
(N
);
531 when N_Subprogram_Info
=>
532 Analyze_Subprogram_Info
(N
);
534 when N_Subprogram_Renaming_Declaration
=>
535 Analyze_Subprogram_Renaming
(N
);
537 when N_Subtype_Declaration
=>
538 Analyze_Subtype_Declaration
(N
);
540 when N_Subtype_Indication
=>
541 Analyze_Subtype_Indication
(N
);
547 Analyze_Task_Body
(N
);
549 when N_Task_Body_Stub
=>
550 Analyze_Task_Body_Stub
(N
);
552 when N_Task_Definition
=>
553 Analyze_Task_Definition
(N
);
555 when N_Task_Type_Declaration
=>
556 Analyze_Task_Type_Declaration
(N
);
558 when N_Terminate_Alternative
=>
559 Analyze_Terminate_Alternative
(N
);
561 when N_Timed_Entry_Call
=>
562 Analyze_Timed_Entry_Call
(N
);
564 when N_Triggering_Alternative
=>
565 Analyze_Triggering_Alternative
(N
);
567 when N_Type_Conversion
=>
568 Analyze_Type_Conversion
(N
);
570 when N_Unchecked_Expression
=>
571 Analyze_Unchecked_Expression
(N
);
573 when N_Unchecked_Type_Conversion
=>
574 Analyze_Unchecked_Type_Conversion
(N
);
576 when N_Use_Package_Clause
=>
577 Analyze_Use_Package
(N
);
579 when N_Use_Type_Clause
=>
580 Analyze_Use_Type
(N
);
582 when N_Validate_Unchecked_Conversion
=>
585 when N_Variant_Part
=>
586 Analyze_Variant_Part
(N
);
588 when N_With_Clause
=>
589 Analyze_With_Clause
(N
);
591 -- A call to analyze the Empty node is an error, but most likely it
592 -- is an error caused by an attempt to analyze a malformed piece of
593 -- tree caused by some other error, so if there have been any other
594 -- errors, we just ignore it, otherwise it is a real internal error
595 -- which we complain about.
597 -- We must also consider the case of call to a runtime function that
598 -- is not available in the configurable runtime.
601 pragma Assert
(Serious_Errors_Detected
/= 0
602 or else Configurable_Run_Time_Violations
/= 0);
605 -- A call to analyze the error node is simply ignored, to avoid
606 -- causing cascaded errors (happens of course only in error cases)
611 -- Push/Pop nodes normally don't come through an analyze call. An
612 -- exception is the dummy ones bracketing a subprogram body. In any
613 -- case there is nothing to be done to analyze such nodes.
615 when N_Push_Pop_xxx_Label
=>
618 -- SCIL nodes don't need analysis because they are decorated when
619 -- they are built. They are added to the tree by Insert_Actions and
620 -- the call to analyze them is generated when the full list is
624 N_SCIL_Dispatch_Table_Tag_Init |
625 N_SCIL_Dispatching_Call |
626 N_SCIL_Membership_Test
=>
629 -- For the remaining node types, we generate compiler abort, because
630 -- these nodes are always analyzed within the Sem_Chn routines and
631 -- there should never be a case of making a call to the main Analyze
632 -- routine for these node kinds. For example, an N_Access_Definition
633 -- node appears only in the context of a type declaration, and is
634 -- processed by the analyze routine for type declarations.
638 N_Access_Definition |
639 N_Access_Function_Definition |
640 N_Access_Procedure_Definition |
641 N_Access_To_Object_Definition |
642 N_Aspect_Specification |
643 N_Case_Expression_Alternative |
644 N_Case_Statement_Alternative |
645 N_Compilation_Unit_Aux |
646 N_Component_Association |
648 N_Component_Definition |
650 N_Constrained_Array_Definition |
652 N_Decimal_Fixed_Point_Definition |
653 N_Defining_Character_Literal |
654 N_Defining_Identifier |
655 N_Defining_Operator_Symbol |
656 N_Defining_Program_Unit_Name |
658 N_Derived_Type_Definition |
660 N_Digits_Constraint |
661 N_Discriminant_Association |
662 N_Discriminant_Specification |
664 N_Entry_Call_Statement |
665 N_Enumeration_Type_Definition |
666 N_Exception_Handler |
667 N_Floating_Point_Definition |
668 N_Formal_Decimal_Fixed_Point_Definition |
669 N_Formal_Derived_Type_Definition |
670 N_Formal_Discrete_Type_Definition |
671 N_Formal_Floating_Point_Definition |
672 N_Formal_Modular_Type_Definition |
673 N_Formal_Ordinary_Fixed_Point_Definition |
674 N_Formal_Private_Type_Definition |
675 N_Formal_Incomplete_Type_Definition |
676 N_Formal_Signed_Integer_Type_Definition |
677 N_Function_Specification |
678 N_Generic_Association |
679 N_Index_Or_Discriminant_Constraint |
682 N_Modular_Type_Definition |
683 N_Ordinary_Fixed_Point_Definition |
684 N_Parameter_Specification |
685 N_Pragma_Argument_Association |
686 N_Procedure_Specification |
687 N_Real_Range_Specification |
688 N_Record_Definition |
689 N_Signed_Integer_Type_Definition |
690 N_Unconstrained_Array_Definition |
698 Debug_A_Exit
("analyzing ", N
, " (done)");
700 -- Now that we have analyzed the node, we call the expander to perform
701 -- possible expansion. We skip this for subexpressions, because we don't
702 -- have the type yet, and the expander will need to know the type before
703 -- it can do its job. For subexpression nodes, the call to the expander
704 -- happens in Sem_Res.Resolve. A special exception is Raise_xxx_Error,
705 -- which can appear in a statement context, and needs expanding now in
706 -- the case (distinguished by Etype, as documented in Sinfo).
708 -- The Analyzed flag is also set at this point for non-subexpression
709 -- nodes (in the case of subexpression nodes, we can't set the flag yet,
710 -- since resolution and expansion have not yet been completed). Note
711 -- that for N_Raise_xxx_Error we have to distinguish the expression
712 -- case from the statement case.
714 if Nkind
(N
) not in N_Subexpr
715 or else (Nkind
(N
) in N_Raise_xxx_Error
716 and then Etype
(N
) = Standard_Void_Type
)
722 -- Version with check(s) suppressed
724 procedure Analyze
(N
: Node_Id
; Suppress
: Check_Id
) is
726 if Suppress
= All_Checks
then
728 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
730 Scope_Suppress
.Suppress
:= (others => True);
732 Scope_Suppress
.Suppress
:= Svs
;
735 elsif Suppress
= Overflow_Check
then
737 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
739 Scope_Suppress
.Suppress
(Suppress
) := True;
741 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
750 procedure Analyze_List
(L
: List_Id
) is
755 while Present
(Node
) loop
761 -- Version with check(s) suppressed
763 procedure Analyze_List
(L
: List_Id
; Suppress
: Check_Id
) is
765 if Suppress
= All_Checks
then
767 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
769 Scope_Suppress
.Suppress
:= (others => True);
771 Scope_Suppress
.Suppress
:= Svs
;
776 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
778 Scope_Suppress
.Suppress
(Suppress
) := True;
780 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
785 --------------------------
786 -- Copy_Suppress_Status --
787 --------------------------
789 procedure Copy_Suppress_Status
795 pragma Warnings
(Off
, Found
);
797 procedure Search_Stack
798 (Top
: Suppress_Stack_Entry_Ptr
;
799 Found
: out Boolean);
800 -- Search given suppress stack for matching entry for entity. If found
801 -- then set Checks_May_Be_Suppressed on To, and push an appropriate
802 -- entry for To onto the local suppress stack.
808 procedure Search_Stack
809 (Top
: Suppress_Stack_Entry_Ptr
;
812 Ptr
: Suppress_Stack_Entry_Ptr
;
816 while Ptr
/= null loop
818 and then (Ptr
.Check
= All_Checks
or else Ptr
.Check
= C
)
821 Set_Checks_May_Be_Suppressed
(To
, True);
822 Push_Local_Suppress_Stack_Entry
838 -- Start of processing for Copy_Suppress_Status
841 if not Checks_May_Be_Suppressed
(From
) then
845 -- First search the global entity suppress table for a matching entry.
846 -- We also search this in reverse order so that if there are multiple
847 -- pragmas for the same entity, the last one applies.
849 Search_Stack
(Global_Suppress_Stack_Top
, Found
);
855 -- Now search the local entity suppress stack, we search this in
856 -- reverse order so that we get the innermost entry that applies to
857 -- this case if there are nested entries. Note that for the purpose
858 -- of this procedure we are ONLY looking for entries corresponding
859 -- to a two-argument Suppress, where the second argument matches From.
861 Search_Stack
(Local_Suppress_Stack_Top
, Found
);
862 end Copy_Suppress_Status
;
864 -------------------------
865 -- Enter_Generic_Scope --
866 -------------------------
868 procedure Enter_Generic_Scope
(S
: Entity_Id
) is
870 if No
(Outer_Generic_Scope
) then
871 Outer_Generic_Scope
:= S
;
873 end Enter_Generic_Scope
;
875 ------------------------
876 -- Exit_Generic_Scope --
877 ------------------------
879 procedure Exit_Generic_Scope
(S
: Entity_Id
) is
881 if S
= Outer_Generic_Scope
then
882 Outer_Generic_Scope
:= Empty
;
884 end Exit_Generic_Scope
;
886 -----------------------
887 -- Explicit_Suppress --
888 -----------------------
890 function Explicit_Suppress
(E
: Entity_Id
; C
: Check_Id
) return Boolean is
891 Ptr
: Suppress_Stack_Entry_Ptr
;
894 if not Checks_May_Be_Suppressed
(E
) then
898 Ptr
:= Global_Suppress_Stack_Top
;
899 while Ptr
/= null loop
901 and then (Ptr
.Check
= All_Checks
or else Ptr
.Check
= C
)
911 end Explicit_Suppress
;
913 -----------------------------
914 -- External_Ref_In_Generic --
915 -----------------------------
917 function External_Ref_In_Generic
(E
: Entity_Id
) return Boolean is
921 -- Entity is global if defined outside of current outer_generic_scope:
922 -- Either the entity has a smaller depth that the outer generic, or it
923 -- is in a different compilation unit, or it is defined within a unit
924 -- in the same compilation, that is not within the outer_generic.
926 if No
(Outer_Generic_Scope
) then
929 elsif Scope_Depth
(Scope
(E
)) < Scope_Depth
(Outer_Generic_Scope
)
930 or else not In_Same_Source_Unit
(E
, Outer_Generic_Scope
)
936 while Present
(Scop
) loop
937 if Scop
= Outer_Generic_Scope
then
939 elsif Scope_Depth
(Scop
) < Scope_Depth
(Outer_Generic_Scope
) then
942 Scop
:= Scope
(Scop
);
948 end External_Ref_In_Generic
;
954 procedure Initialize
is
955 Next
: Suppress_Stack_Entry_Ptr
;
957 procedure Free
is new Unchecked_Deallocation
958 (Suppress_Stack_Entry
, Suppress_Stack_Entry_Ptr
);
961 -- Free any global suppress stack entries from a previous invocation
962 -- of the compiler (in the normal case this loop does nothing).
964 while Suppress_Stack_Entries
/= null loop
965 Next
:= Suppress_Stack_Entries
.Next
;
966 Free
(Suppress_Stack_Entries
);
967 Suppress_Stack_Entries
:= Next
;
970 Local_Suppress_Stack_Top
:= null;
971 Global_Suppress_Stack_Top
:= null;
973 -- Clear scope stack, and reset global variables
976 Unloaded_Subunits
:= False;
979 ------------------------------
980 -- Insert_After_And_Analyze --
981 ------------------------------
983 procedure Insert_After_And_Analyze
(N
: Node_Id
; M
: Node_Id
) is
989 -- If we are not at the end of the list, then the easiest
990 -- coding is simply to insert before our successor
992 if Present
(Next
(N
)) then
993 Insert_Before_And_Analyze
(Next
(N
), M
);
995 -- Case of inserting at the end of the list
998 -- Capture the Node_Id of the node to be inserted. This Node_Id
999 -- will still be the same after the insert operation.
1002 Insert_After
(N
, M
);
1004 -- Now just analyze from the inserted node to the end of
1005 -- the new list (note that this properly handles the case
1006 -- where any of the analyze calls result in the insertion of
1007 -- nodes after the analyzed node, expecting analysis).
1009 while Present
(Node
) loop
1011 Mark_Rewrite_Insertion
(Node
);
1016 end Insert_After_And_Analyze
;
1018 -- Version with check(s) suppressed
1020 procedure Insert_After_And_Analyze
1023 Suppress
: Check_Id
)
1026 if Suppress
= All_Checks
then
1028 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
1030 Scope_Suppress
.Suppress
:= (others => True);
1031 Insert_After_And_Analyze
(N
, M
);
1032 Scope_Suppress
.Suppress
:= Svs
;
1037 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
1039 Scope_Suppress
.Suppress
(Suppress
) := True;
1040 Insert_After_And_Analyze
(N
, M
);
1041 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
1044 end Insert_After_And_Analyze
;
1046 -------------------------------
1047 -- Insert_Before_And_Analyze --
1048 -------------------------------
1050 procedure Insert_Before_And_Analyze
(N
: Node_Id
; M
: Node_Id
) is
1056 -- Capture the Node_Id of the first list node to be inserted.
1057 -- This will still be the first node after the insert operation,
1058 -- since Insert_List_After does not modify the Node_Id values.
1061 Insert_Before
(N
, M
);
1063 -- The insertion does not change the Id's of any of the nodes in
1064 -- the list, and they are still linked, so we can simply loop from
1065 -- the original first node until we meet the node before which the
1066 -- insertion is occurring. Note that this properly handles the case
1067 -- where any of the analyzed nodes insert nodes after themselves,
1068 -- expecting them to get analyzed.
1070 while Node
/= N
loop
1072 Mark_Rewrite_Insertion
(Node
);
1076 end Insert_Before_And_Analyze
;
1078 -- Version with check(s) suppressed
1080 procedure Insert_Before_And_Analyze
1083 Suppress
: Check_Id
)
1086 if Suppress
= All_Checks
then
1088 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
1090 Scope_Suppress
.Suppress
:= (others => True);
1091 Insert_Before_And_Analyze
(N
, M
);
1092 Scope_Suppress
.Suppress
:= Svs
;
1097 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
1099 Scope_Suppress
.Suppress
(Suppress
) := True;
1100 Insert_Before_And_Analyze
(N
, M
);
1101 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
1104 end Insert_Before_And_Analyze
;
1106 -----------------------------------
1107 -- Insert_List_After_And_Analyze --
1108 -----------------------------------
1110 procedure Insert_List_After_And_Analyze
(N
: Node_Id
; L
: List_Id
) is
1111 After
: constant Node_Id
:= Next
(N
);
1115 if Is_Non_Empty_List
(L
) then
1117 -- Capture the Node_Id of the first list node to be inserted.
1118 -- This will still be the first node after the insert operation,
1119 -- since Insert_List_After does not modify the Node_Id values.
1122 Insert_List_After
(N
, L
);
1124 -- Now just analyze from the original first node until we get to the
1125 -- successor of the original insertion point (which may be Empty if
1126 -- the insertion point was at the end of the list). Note that this
1127 -- properly handles the case where any of the analyze calls result in
1128 -- the insertion of nodes after the analyzed node (possibly calling
1129 -- this routine recursively).
1131 while Node
/= After
loop
1133 Mark_Rewrite_Insertion
(Node
);
1137 end Insert_List_After_And_Analyze
;
1139 -- Version with check(s) suppressed
1141 procedure Insert_List_After_And_Analyze
1142 (N
: Node_Id
; L
: List_Id
; Suppress
: Check_Id
)
1145 if Suppress
= All_Checks
then
1147 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
1149 Scope_Suppress
.Suppress
:= (others => True);
1150 Insert_List_After_And_Analyze
(N
, L
);
1151 Scope_Suppress
.Suppress
:= Svs
;
1156 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
1158 Scope_Suppress
.Suppress
(Suppress
) := True;
1159 Insert_List_After_And_Analyze
(N
, L
);
1160 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
1163 end Insert_List_After_And_Analyze
;
1165 ------------------------------------
1166 -- Insert_List_Before_And_Analyze --
1167 ------------------------------------
1169 procedure Insert_List_Before_And_Analyze
(N
: Node_Id
; L
: List_Id
) is
1173 if Is_Non_Empty_List
(L
) then
1175 -- Capture the Node_Id of the first list node to be inserted. This
1176 -- will still be the first node after the insert operation, since
1177 -- Insert_List_After does not modify the Node_Id values.
1180 Insert_List_Before
(N
, L
);
1182 -- The insertion does not change the Id's of any of the nodes in
1183 -- the list, and they are still linked, so we can simply loop from
1184 -- the original first node until we meet the node before which the
1185 -- insertion is occurring. Note that this properly handles the case
1186 -- where any of the analyzed nodes insert nodes after themselves,
1187 -- expecting them to get analyzed.
1189 while Node
/= N
loop
1191 Mark_Rewrite_Insertion
(Node
);
1195 end Insert_List_Before_And_Analyze
;
1197 -- Version with check(s) suppressed
1199 procedure Insert_List_Before_And_Analyze
1200 (N
: Node_Id
; L
: List_Id
; Suppress
: Check_Id
)
1203 if Suppress
= All_Checks
then
1205 Svs
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
1207 Scope_Suppress
.Suppress
:= (others => True);
1208 Insert_List_Before_And_Analyze
(N
, L
);
1209 Scope_Suppress
.Suppress
:= Svs
;
1214 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
1216 Scope_Suppress
.Suppress
(Suppress
) := True;
1217 Insert_List_Before_And_Analyze
(N
, L
);
1218 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
1221 end Insert_List_Before_And_Analyze
;
1229 Scope_Stack
.Locked
:= True;
1230 Scope_Stack
.Release
;
1237 procedure Preanalyze
(N
: Node_Id
) is
1238 Save_Full_Analysis
: constant Boolean := Full_Analysis
;
1241 Full_Analysis
:= False;
1242 Expander_Mode_Save_And_Set
(False);
1246 Expander_Mode_Restore
;
1247 Full_Analysis
:= Save_Full_Analysis
;
1250 --------------------------------------
1251 -- Push_Global_Suppress_Stack_Entry --
1252 --------------------------------------
1254 procedure Push_Global_Suppress_Stack_Entry
1255 (Entity
: Entity_Id
;
1260 Global_Suppress_Stack_Top
:=
1261 new Suppress_Stack_Entry
'
1264 Suppress => Suppress,
1265 Prev => Global_Suppress_Stack_Top,
1266 Next => Suppress_Stack_Entries);
1267 Suppress_Stack_Entries := Global_Suppress_Stack_Top;
1270 end Push_Global_Suppress_Stack_Entry;
1272 -------------------------------------
1273 -- Push_Local_Suppress_Stack_Entry --
1274 -------------------------------------
1276 procedure Push_Local_Suppress_Stack_Entry
1277 (Entity : Entity_Id;
1282 Local_Suppress_Stack_Top :=
1283 new Suppress_Stack_Entry'
1286 Suppress
=> Suppress
,
1287 Prev
=> Local_Suppress_Stack_Top
,
1288 Next
=> Suppress_Stack_Entries
);
1289 Suppress_Stack_Entries
:= Local_Suppress_Stack_Top
;
1292 end Push_Local_Suppress_Stack_Entry
;
1298 procedure Semantics
(Comp_Unit
: Node_Id
) is
1300 -- The following locations save the corresponding global flags and
1301 -- variables so that they can be restored on completion. This is needed
1302 -- so that calls to Rtsfind start with the proper default values for
1303 -- these variables, and also that such calls do not disturb the settings
1304 -- for units being analyzed at a higher level.
1306 S_Current_Sem_Unit
: constant Unit_Number_Type
:= Current_Sem_Unit
;
1307 S_Full_Analysis
: constant Boolean := Full_Analysis
;
1308 S_GNAT_Mode
: constant Boolean := GNAT_Mode
;
1309 S_Global_Dis_Names
: constant Boolean := Global_Discard_Names
;
1310 S_In_Assertion_Expr
: constant Nat
:= In_Assertion_Expr
;
1311 S_In_Spec_Expr
: constant Boolean := In_Spec_Expression
;
1312 S_Inside_A_Generic
: constant Boolean := Inside_A_Generic
;
1313 S_Outer_Gen_Scope
: constant Entity_Id
:= Outer_Generic_Scope
;
1314 S_Style_Check
: constant Boolean := Style_Check
;
1316 Generic_Main
: constant Boolean :=
1317 Nkind
(Unit
(Cunit
(Main_Unit
)))
1318 in N_Generic_Declaration
;
1319 -- If the main unit is generic, every compiled unit, including its
1320 -- context, is compiled with expansion disabled.
1322 Ext_Main_Source_Unit
: constant Boolean :=
1323 In_Extended_Main_Source_Unit
(Comp_Unit
);
1324 -- Determine if unit is in extended main source unit
1326 Save_Config_Switches
: Config_Switches_Type
;
1327 -- Variable used to save values of config switches while we analyze the
1328 -- new unit, to be restored on exit for proper recursive behavior.
1330 Save_Cunit_Restrictions
: Save_Cunit_Boolean_Restrictions
;
1331 -- Used to save non-partition wide restrictions before processing new
1332 -- unit. All with'ed units are analyzed with config restrictions reset
1333 -- and we need to restore these saved values at the end.
1335 procedure Do_Analyze
;
1336 -- Procedure to analyze the compilation unit
1342 procedure Do_Analyze
is
1346 List
:= Save_Scope_Stack
;
1347 Push_Scope
(Standard_Standard
);
1348 Scope_Suppress
:= Suppress_Options
;
1350 (Scope_Stack
.Last
).Component_Alignment_Default
:= Calign_Default
;
1352 (Scope_Stack
.Last
).Is_Active_Stack_Base
:= True;
1353 Outer_Generic_Scope
:= Empty
;
1355 -- Now analyze the top level compilation unit node
1357 Analyze
(Comp_Unit
);
1359 -- Check for scope mismatch on exit from compilation
1361 pragma Assert
(Current_Scope
= Standard_Standard
1362 or else Comp_Unit
= Cunit
(Main_Unit
));
1364 -- Then pop entry for Standard, and pop implicit types
1367 Restore_Scope_Stack
(List
);
1370 Already_Analyzed
: constant Boolean := Analyzed
(Comp_Unit
);
1372 -- Start of processing for Semantics
1375 if Debug_Unit_Walk
then
1376 if Already_Analyzed
then
1377 Write_Str
("(done)");
1381 (Get_Cunit_Unit_Number
(Comp_Unit
),
1387 Compiler_State
:= Analyzing
;
1388 Current_Sem_Unit
:= Get_Cunit_Unit_Number
(Comp_Unit
);
1390 -- Compile predefined units with GNAT_Mode set to True, to properly
1391 -- process the categorization stuff. However, do not set GNAT_Mode
1392 -- to True for the renamings units (Text_IO, IO_Exceptions, Direct_IO,
1393 -- Sequential_IO) as this would prevent pragma Extend_System from being
1394 -- taken into account, for example when Text_IO is renaming DEC.Text_IO.
1396 if Is_Predefined_File_Name
1397 (Unit_File_Name
(Current_Sem_Unit
), Renamings_Included
=> False)
1402 if Generic_Main
then
1403 Expander_Mode_Save_And_Set
(False);
1405 Expander_Mode_Save_And_Set
1406 (Operating_Mode
= Generate_Code
or Debug_Flag_X
);
1409 Full_Analysis
:= True;
1410 Inside_A_Generic
:= False;
1411 In_Assertion_Expr
:= 0;
1412 In_Spec_Expression
:= False;
1414 Set_Comes_From_Source_Default
(False);
1416 -- Save current config switches and reset then appropriately
1418 Save_Opt_Config_Switches
(Save_Config_Switches
);
1419 Set_Opt_Config_Switches
1420 (Is_Internal_File_Name
(Unit_File_Name
(Current_Sem_Unit
)),
1421 Current_Sem_Unit
= Main_Unit
);
1423 -- Save current non-partition-wide restrictions
1425 Save_Cunit_Restrictions
:= Cunit_Boolean_Restrictions_Save
;
1427 -- For unit in main extended unit, we reset the configuration values
1428 -- for the non-partition-wide restrictions. For other units reset them.
1430 if Ext_Main_Source_Unit
then
1431 Restore_Config_Cunit_Boolean_Restrictions
;
1433 Reset_Cunit_Boolean_Restrictions
;
1436 -- Turn off style checks for unit that is not in the extended main
1437 -- source unit. This improves processing efficiency for such units
1438 -- (for which we don't want style checks anyway, and where they will
1439 -- get suppressed), and is definitely needed to stop some style checks
1440 -- from invading the run-time units (e.g. overriding checks).
1442 if not Ext_Main_Source_Unit
then
1443 Style_Check
:= False;
1445 -- If this is part of the extended main source unit, set style check
1446 -- mode to match the style check mode of the main source unit itself.
1449 Style_Check
:= Style_Check_Main
;
1452 -- Only do analysis of unit that has not already been analyzed
1454 if not Analyzed
(Comp_Unit
) then
1455 Initialize_Version
(Current_Sem_Unit
);
1457 -- Do analysis, and then append the compilation unit onto the
1458 -- Comp_Unit_List, if appropriate. This is done after analysis,
1459 -- so if this unit depends on some others, they have already been
1460 -- appended. We ignore bodies, except for the main unit itself, and
1461 -- for subprogram bodies that act as specs. We have also to guard
1462 -- against ill-formed subunits that have an improper context.
1466 if Present
(Comp_Unit
)
1467 and then Nkind
(Unit
(Comp_Unit
)) in N_Proper_Body
1468 and then (Nkind
(Unit
(Comp_Unit
)) /= N_Subprogram_Body
1469 or else not Acts_As_Spec
(Comp_Unit
))
1470 and then not In_Extended_Main_Source_Unit
(Comp_Unit
)
1475 -- Initialize if first time
1477 if No
(Comp_Unit_List
) then
1478 Comp_Unit_List
:= New_Elmt_List
;
1481 Append_Elmt
(Comp_Unit
, Comp_Unit_List
);
1483 if Debug_Unit_Walk
then
1484 Write_Str
("Appending ");
1486 (Get_Cunit_Unit_Number
(Comp_Unit
), Unit
(Comp_Unit
));
1491 -- Save indication of dynamic elaboration checks for ALI file
1493 Set_Dynamic_Elab
(Current_Sem_Unit
, Dynamic_Elaboration_Checks
);
1495 -- Restore settings of saved switches to entry values
1497 Current_Sem_Unit
:= S_Current_Sem_Unit
;
1498 Full_Analysis
:= S_Full_Analysis
;
1499 Global_Discard_Names
:= S_Global_Dis_Names
;
1500 GNAT_Mode
:= S_GNAT_Mode
;
1501 In_Assertion_Expr
:= S_In_Assertion_Expr
;
1502 In_Spec_Expression
:= S_In_Spec_Expr
;
1503 Inside_A_Generic
:= S_Inside_A_Generic
;
1504 Outer_Generic_Scope
:= S_Outer_Gen_Scope
;
1505 Style_Check
:= S_Style_Check
;
1507 Restore_Opt_Config_Switches
(Save_Config_Switches
);
1509 -- Deal with restore of restrictions
1511 Cunit_Boolean_Restrictions_Restore
(Save_Cunit_Restrictions
);
1513 Expander_Mode_Restore
;
1515 if Debug_Unit_Walk
then
1518 if Already_Analyzed
then
1519 Write_Str
("(done)");
1523 (Get_Cunit_Unit_Number
(Comp_Unit
),
1533 function ss
(Index
: Int
) return Scope_Stack_Entry
is
1535 return Scope_Stack
.Table
(Index
);
1542 function sst
return Scope_Stack_Entry
is
1544 return ss
(Scope_Stack
.Last
);
1547 ------------------------
1548 -- Walk_Library_Items --
1549 ------------------------
1551 procedure Walk_Library_Items
is
1552 type Unit_Number_Set
is array (Main_Unit
.. Last_Unit
) of Boolean;
1553 pragma Pack
(Unit_Number_Set
);
1555 Main_CU
: constant Node_Id
:= Cunit
(Main_Unit
);
1557 Seen
, Done
: Unit_Number_Set
:= (others => False);
1558 -- Seen (X) is True after we have seen unit X in the walk. This is used
1559 -- to prevent processing the same unit more than once. Done (X) is True
1560 -- after we have fully processed X, and is used only for debugging
1561 -- printouts and assertions.
1563 Do_Main
: Boolean := False;
1564 -- Flag to delay processing the main body until after all other units.
1565 -- This is needed because the spec of the main unit may appear in the
1566 -- context of some other unit. We do not want this to force processing
1567 -- of the main body before all other units have been processed.
1569 -- Another circularity pattern occurs when the main unit is a child unit
1570 -- and the body of an ancestor has a with-clause of the main unit or on
1571 -- one of its children. In both cases the body in question has a with-
1572 -- clause on the main unit, and must be excluded from the traversal. In
1573 -- some convoluted cases this may lead to a CodePeer error because the
1574 -- spec of a subprogram declared in an instance within the parent will
1575 -- not be seen in the main unit.
1577 function Depends_On_Main
(CU
: Node_Id
) return Boolean;
1578 -- The body of a unit that is withed by the spec of the main unit may in
1579 -- turn have a with_clause on that spec. In that case do not traverse
1580 -- the body, to prevent loops. It can also happen that the main body has
1581 -- a with_clause on a child, which of course has an implicit with on its
1582 -- parent. It's OK to traverse the child body if the main spec has been
1583 -- processed, otherwise we also have a circularity to avoid.
1585 procedure Do_Action
(CU
: Node_Id
; Item
: Node_Id
);
1586 -- Calls Action, with some validity checks
1588 procedure Do_Unit_And_Dependents
(CU
: Node_Id
; Item
: Node_Id
);
1589 -- Calls Do_Action, first on the units with'ed by this one, then on
1590 -- this unit. If it's an instance body, do the spec first. If it is
1591 -- an instance spec, do the body last.
1593 procedure Do_Withed_Unit
(Withed_Unit
: Node_Id
);
1594 -- Apply Do_Unit_And_Dependents to a unit in a context clause
1596 procedure Process_Bodies_In_Context
(Comp
: Node_Id
);
1597 -- The main unit and its spec may depend on bodies that contain generics
1598 -- that are instantiated in them. Iterate through the corresponding
1599 -- contexts before processing main (spec/body) itself, to process bodies
1600 -- that may be present, together with their context. The spec of main
1601 -- is processed wherever it appears in the list of units, while the body
1602 -- is processed as the last unit in the list.
1604 ---------------------
1605 -- Depends_On_Main --
1606 ---------------------
1608 function Depends_On_Main
(CU
: Node_Id
) return Boolean is
1610 MCU
: constant Node_Id
:= Unit
(Main_CU
);
1613 CL
:= First
(Context_Items
(CU
));
1615 -- Problem does not arise with main subprograms
1618 not Nkind_In
(MCU
, N_Package_Body
, N_Package_Declaration
)
1623 while Present
(CL
) loop
1624 if Nkind
(CL
) = N_With_Clause
1625 and then Library_Unit
(CL
) = Main_CU
1626 and then not Done
(Get_Cunit_Unit_Number
(Library_Unit
(CL
)))
1635 end Depends_On_Main
;
1641 procedure Do_Action
(CU
: Node_Id
; Item
: Node_Id
) is
1643 -- This calls Action at the end. All the preceding code is just
1644 -- assertions and debugging output.
1646 pragma Assert
(No
(CU
) or else Nkind
(CU
) = N_Compilation_Unit
);
1648 case Nkind
(Item
) is
1649 when N_Generic_Subprogram_Declaration |
1650 N_Generic_Package_Declaration |
1651 N_Package_Declaration |
1652 N_Subprogram_Declaration |
1653 N_Subprogram_Renaming_Declaration |
1654 N_Package_Renaming_Declaration |
1655 N_Generic_Function_Renaming_Declaration |
1656 N_Generic_Package_Renaming_Declaration |
1657 N_Generic_Procedure_Renaming_Declaration
=>
1663 when N_Package_Body
=>
1665 -- Package bodies are processed separately if the main unit
1670 when N_Subprogram_Body
=>
1672 -- A subprogram body must be the main unit
1674 pragma Assert
(Acts_As_Spec
(CU
)
1675 or else CU
= Cunit
(Main_Unit
));
1678 when N_Function_Instantiation |
1679 N_Procedure_Instantiation |
1680 N_Package_Instantiation
=>
1682 -- Can only happen if some generic body (needed for gnat2scil
1683 -- traversal, but not by GNAT) is not available, ignore.
1687 -- All other cases cannot happen
1690 pragma Assert
(False, "subunit");
1694 pragma Assert
(False);
1698 if Present
(CU
) then
1699 pragma Assert
(Item
/= Stand
.Standard_Package_Node
);
1700 pragma Assert
(Item
= Unit
(CU
));
1703 Unit_Num
: constant Unit_Number_Type
:=
1704 Get_Cunit_Unit_Number
(CU
);
1706 procedure Assert_Done
(Withed_Unit
: Node_Id
);
1707 -- Assert Withed_Unit is already Done, unless it's a body. It
1708 -- might seem strange for a with_clause to refer to a body, but
1709 -- this happens in the case of a generic instantiation, which
1710 -- gets transformed into the instance body (and the instance
1711 -- spec is also created). With clauses pointing to the
1712 -- instantiation end up pointing to the instance body.
1718 procedure Assert_Done
(Withed_Unit
: Node_Id
) is
1720 if not Done
(Get_Cunit_Unit_Number
(Withed_Unit
)) then
1722 (Unit
(Withed_Unit
),
1723 N_Generic_Package_Declaration
,
1725 N_Package_Renaming_Declaration
,
1729 (Unit_Name
(Get_Cunit_Unit_Number
(Withed_Unit
)));
1730 Write_Str
(" not yet walked!");
1732 if Get_Cunit_Unit_Number
(Withed_Unit
) = Unit_Num
then
1733 Write_Str
(" (self-ref)");
1738 pragma Assert
(False);
1743 procedure Assert_Withed_Units_Done
is
1744 new Walk_Withs
(Assert_Done
);
1747 if Debug_Unit_Walk
then
1748 Write_Unit_Info
(Unit_Num
, Item
, Withs
=> True);
1751 -- Main unit should come last, except in the case where we
1752 -- skipped System_Aux_Id, in which case we missed the things it
1753 -- depends on, and in the case of parent bodies if present.
1756 (not Done
(Main_Unit
)
1757 or else Present
(System_Aux_Id
)
1758 or else Nkind
(Item
) = N_Package_Body
);
1760 -- We shouldn't do the same thing twice
1762 pragma Assert
(not Done
(Unit_Num
));
1764 -- Everything we depend upon should already be done
1767 (Assert_Withed_Units_Done
(CU
, Include_Limited
=> False));
1771 -- Must be Standard, which has no entry in the units table
1773 pragma Assert
(Item
= Stand
.Standard_Package_Node
);
1775 if Debug_Unit_Walk
then
1776 Write_Line
("Standard");
1783 --------------------
1784 -- Do_Withed_Unit --
1785 --------------------
1787 procedure Do_Withed_Unit
(Withed_Unit
: Node_Id
) is
1789 Do_Unit_And_Dependents
(Withed_Unit
, Unit
(Withed_Unit
));
1791 -- If the unit in the with_clause is a generic instance, the clause
1792 -- now denotes the instance body. Traverse the corresponding spec
1793 -- because there may be no other dependence that will force the
1794 -- traversal of its own context.
1796 if Nkind
(Unit
(Withed_Unit
)) = N_Package_Body
1797 and then Is_Generic_Instance
1798 (Defining_Entity
(Unit
(Library_Unit
(Withed_Unit
))))
1800 Do_Withed_Unit
(Library_Unit
(Withed_Unit
));
1804 ----------------------------
1805 -- Do_Unit_And_Dependents --
1806 ----------------------------
1808 procedure Do_Unit_And_Dependents
(CU
: Node_Id
; Item
: Node_Id
) is
1809 Unit_Num
: constant Unit_Number_Type
:= Get_Cunit_Unit_Number
(CU
);
1811 Body_U
: Unit_Number_Type
;
1812 Parent_CU
: Node_Id
;
1814 procedure Do_Withed_Units
is new Walk_Withs
(Do_Withed_Unit
);
1817 if not Seen
(Unit_Num
) then
1819 -- Process the with clauses
1821 Do_Withed_Units
(CU
, Include_Limited
=> False);
1823 -- Process the unit if it is a spec or the main unit, if it
1824 -- has no previous spec or we have done all other units.
1826 if not Nkind_In
(Item
, N_Package_Body
, N_Subprogram_Body
)
1827 or else Acts_As_Spec
(CU
)
1829 if CU
= Cunit
(Main_Unit
)
1830 and then not Do_Main
1832 Seen
(Unit_Num
) := False;
1835 Seen
(Unit_Num
) := True;
1837 if CU
= Library_Unit
(Main_CU
) then
1838 Process_Bodies_In_Context
(CU
);
1840 -- If main is a child unit, examine parent unit contexts
1841 -- to see if they include instantiated units. Also, if
1842 -- the parent itself is an instance, process its body
1843 -- because it may contain subprograms that are called
1844 -- in the main unit.
1846 if Is_Child_Unit
(Cunit_Entity
(Main_Unit
)) then
1847 Child
:= Cunit_Entity
(Main_Unit
);
1848 while Is_Child_Unit
(Child
) loop
1851 (Get_Cunit_Entity_Unit_Number
(Scope
(Child
)));
1852 Process_Bodies_In_Context
(Parent_CU
);
1854 if Nkind
(Unit
(Parent_CU
)) = N_Package_Body
1856 Nkind
(Original_Node
(Unit
(Parent_CU
)))
1857 = N_Package_Instantiation
1859 not Seen
(Get_Cunit_Unit_Number
(Parent_CU
))
1861 Body_U
:= Get_Cunit_Unit_Number
(Parent_CU
);
1862 Seen
(Body_U
) := True;
1863 Do_Action
(Parent_CU
, Unit
(Parent_CU
));
1864 Done
(Body_U
) := True;
1867 Child
:= Scope
(Child
);
1872 Do_Action
(CU
, Item
);
1873 Done
(Unit_Num
) := True;
1877 end Do_Unit_And_Dependents
;
1879 -------------------------------
1880 -- Process_Bodies_In_Context --
1881 -------------------------------
1883 procedure Process_Bodies_In_Context
(Comp
: Node_Id
) is
1885 Body_U
: Unit_Number_Type
;
1889 procedure Do_Withed_Units
is new Walk_Withs
(Do_Withed_Unit
);
1891 -- Start of processing for Process_Bodies_In_Context
1894 Clause
:= First
(Context_Items
(Comp
));
1895 while Present
(Clause
) loop
1896 if Nkind
(Clause
) = N_With_Clause
then
1897 Spec
:= Library_Unit
(Clause
);
1898 Body_CU
:= Library_Unit
(Spec
);
1900 -- If we are processing the spec of the main unit, load bodies
1901 -- only if the with_clause indicates that it forced the loading
1902 -- of the body for a generic instantiation. Note that bodies of
1903 -- parents that are instances have been loaded already.
1905 if Present
(Body_CU
)
1906 and then Body_CU
/= Cunit
(Main_Unit
)
1907 and then Nkind
(Unit
(Body_CU
)) /= N_Subprogram_Body
1908 and then (Nkind
(Unit
(Comp
)) /= N_Package_Declaration
1909 or else Present
(Withed_Body
(Clause
)))
1911 Body_U
:= Get_Cunit_Unit_Number
(Body_CU
);
1913 if not Seen
(Body_U
)
1914 and then not Depends_On_Main
(Body_CU
)
1916 Seen
(Body_U
) := True;
1917 Do_Withed_Units
(Body_CU
, Include_Limited
=> False);
1918 Do_Action
(Body_CU
, Unit
(Body_CU
));
1919 Done
(Body_U
) := True;
1926 end Process_Bodies_In_Context
;
1928 -- Local Declarations
1932 -- Start of processing for Walk_Library_Items
1935 if Debug_Unit_Walk
then
1936 Write_Line
("Walk_Library_Items:");
1940 -- Do Standard first, then walk the Comp_Unit_List
1942 Do_Action
(Empty
, Standard_Package_Node
);
1944 -- First place the context of all instance bodies on the corresponding
1945 -- spec, because it may be needed to analyze the code at the place of
1946 -- the instantiation.
1948 Cur
:= First_Elmt
(Comp_Unit_List
);
1949 while Present
(Cur
) loop
1951 CU
: constant Node_Id
:= Node
(Cur
);
1952 N
: constant Node_Id
:= Unit
(CU
);
1955 if Nkind
(N
) = N_Package_Body
1956 and then Is_Generic_Instance
(Defining_Entity
(N
))
1959 (Context_Items
(CU
), Context_Items
(Library_Unit
(CU
)));
1966 -- Now traverse compilation units (specs) in order
1968 Cur
:= First_Elmt
(Comp_Unit_List
);
1969 while Present
(Cur
) loop
1971 CU
: constant Node_Id
:= Node
(Cur
);
1972 N
: constant Node_Id
:= Unit
(CU
);
1976 pragma Assert
(Nkind
(CU
) = N_Compilation_Unit
);
1980 -- If it is a subprogram body, process it if it has no
1983 -- If it's a package body, ignore it, unless it is a body
1984 -- created for an instance that is the main unit. In the case
1985 -- of subprograms, the body is the wrapper package. In case of
1986 -- a package, the original file carries the body, and the spec
1987 -- appears as a later entry in the units list.
1989 -- Otherwise bodies appear in the list only because of inlining
1990 -- or instantiations, and they are processed only if relevant.
1991 -- The flag Withed_Body on a context clause indicates that a
1992 -- unit contains an instantiation that may be needed later,
1993 -- and therefore the body that contains the generic body (and
1994 -- its context) must be traversed immediately after the
1995 -- corresponding spec (see Do_Unit_And_Dependents).
1997 -- The main unit itself is processed separately after all other
1998 -- specs, and relevant bodies are examined in Process_Main.
2000 when N_Subprogram_Body
=>
2001 if Acts_As_Spec
(N
) then
2002 Do_Unit_And_Dependents
(CU
, N
);
2005 when N_Package_Body
=>
2007 and then Nkind
(Original_Node
(Unit
(Main_CU
))) in
2008 N_Generic_Instantiation
2009 and then Present
(Library_Unit
(Main_CU
))
2011 Do_Unit_And_Dependents
2012 (Library_Unit
(Main_CU
),
2013 Unit
(Library_Unit
(Main_CU
)));
2016 -- It's a spec, process it, and the units it depends on,
2017 -- unless it is a descendent of the main unit. This can
2018 -- happen when the body of a parent depends on some other
2022 Par
:= Scope
(Defining_Entity
(Unit
(CU
)));
2024 if Is_Child_Unit
(Defining_Entity
(Unit
(CU
))) then
2026 and then Par
/= Standard_Standard
2027 and then Par
/= Cunit_Entity
(Main_Unit
)
2033 if Par
/= Cunit_Entity
(Main_Unit
) then
2034 Do_Unit_And_Dependents
(CU
, N
);
2042 -- Now process package bodies on which main depends, followed by bodies
2043 -- of parents, if present, and finally main itself.
2045 if not Done
(Main_Unit
) then
2048 Process_Main
: declare
2049 Parent_CU
: Node_Id
;
2051 Body_U
: Unit_Number_Type
;
2054 function Is_Subunit_Of_Main
(U
: Node_Id
) return Boolean;
2055 -- If the main unit has subunits, their context may include
2056 -- bodies that are needed in the body of main. We must examine
2057 -- the context of the subunits, which are otherwise not made
2058 -- explicit in the main unit.
2060 ------------------------
2061 -- Is_Subunit_Of_Main --
2062 ------------------------
2064 function Is_Subunit_Of_Main
(U
: Node_Id
) return Boolean is
2070 Lib
:= Library_Unit
(U
);
2071 return Nkind
(Unit
(U
)) = N_Subunit
2073 (Lib
= Cunit
(Main_Unit
)
2074 or else Is_Subunit_Of_Main
(Lib
));
2076 end Is_Subunit_Of_Main
;
2078 -- Start of processing for Process_Main
2081 Process_Bodies_In_Context
(Main_CU
);
2083 for Unit_Num
in Done
'Range loop
2084 if Is_Subunit_Of_Main
(Cunit
(Unit_Num
)) then
2085 Process_Bodies_In_Context
(Cunit
(Unit_Num
));
2089 -- If the main unit is a child unit, parent bodies may be present
2090 -- because they export instances or inlined subprograms. Check for
2091 -- presence of these, which are not present in context clauses.
2092 -- Note that if the parents are instances, their bodies have been
2093 -- processed before the main spec, because they may be needed
2094 -- therein, so the following loop only affects non-instances.
2096 if Is_Child_Unit
(Cunit_Entity
(Main_Unit
)) then
2097 Child
:= Cunit_Entity
(Main_Unit
);
2098 while Is_Child_Unit
(Child
) loop
2100 Cunit
(Get_Cunit_Entity_Unit_Number
(Scope
(Child
)));
2101 Body_CU
:= Library_Unit
(Parent_CU
);
2103 if Present
(Body_CU
)
2104 and then not Seen
(Get_Cunit_Unit_Number
(Body_CU
))
2105 and then not Depends_On_Main
(Body_CU
)
2107 Body_U
:= Get_Cunit_Unit_Number
(Body_CU
);
2108 Seen
(Body_U
) := True;
2109 Do_Action
(Body_CU
, Unit
(Body_CU
));
2110 Done
(Body_U
) := True;
2113 Child
:= Scope
(Child
);
2117 Do_Action
(Main_CU
, Unit
(Main_CU
));
2118 Done
(Main_Unit
) := True;
2122 if Debug_Unit_Walk
then
2123 if Done
/= (Done
'Range => True) then
2125 Write_Line
("Ignored units:");
2129 for Unit_Num
in Done
'Range loop
2130 if not Done
(Unit_Num
) then
2132 (Unit_Num
, Unit
(Cunit
(Unit_Num
)), Withs
=> True);
2140 pragma Assert
(Done
(Main_Unit
));
2142 if Debug_Unit_Walk
then
2144 Write_Line
("end Walk_Library_Items.");
2146 end Walk_Library_Items
;
2152 procedure Walk_Withs
(CU
: Node_Id
; Include_Limited
: Boolean) is
2153 pragma Assert
(Nkind
(CU
) = N_Compilation_Unit
);
2154 pragma Assert
(Nkind
(Unit
(CU
)) /= N_Subunit
);
2156 procedure Walk_Immediate
is new Walk_Withs_Immediate
(Action
);
2159 -- First walk the withs immediately on the library item
2161 Walk_Immediate
(CU
, Include_Limited
);
2163 -- For a body, we must also check for any subunits which belong to it
2164 -- and which have context clauses of their own, since these with'ed
2165 -- units are part of its own dependencies.
2167 if Nkind
(Unit
(CU
)) in N_Unit_Body
then
2168 for S
in Main_Unit
.. Last_Unit
loop
2170 -- We are only interested in subunits. For preproc. data and def.
2171 -- files, Cunit is Empty, so we need to test that first.
2173 if Cunit
(S
) /= Empty
2174 and then Nkind
(Unit
(Cunit
(S
))) = N_Subunit
2180 Pnode
:= Library_Unit
(Cunit
(S
));
2182 -- In -gnatc mode, the errors in the subunits will not have
2183 -- been recorded, but the analysis of the subunit may have
2184 -- failed, so just quit.
2190 -- Find ultimate parent of the subunit
2192 while Nkind
(Unit
(Pnode
)) = N_Subunit
loop
2193 Pnode
:= Library_Unit
(Pnode
);
2196 -- See if it belongs to current unit, and if so, include its
2197 -- with_clauses. Do not process main unit prematurely.
2199 if Pnode
= CU
and then CU
/= Cunit
(Main_Unit
) then
2200 Walk_Immediate
(Cunit
(S
), Include_Limited
);
2208 --------------------------
2209 -- Walk_Withs_Immediate --
2210 --------------------------
2212 procedure Walk_Withs_Immediate
(CU
: Node_Id
; Include_Limited
: Boolean) is
2213 pragma Assert
(Nkind
(CU
) = N_Compilation_Unit
);
2215 Context_Item
: Node_Id
;
2220 Context_Item
:= First
(Context_Items
(CU
));
2221 while Present
(Context_Item
) loop
2222 if Nkind
(Context_Item
) = N_With_Clause
2223 and then (Include_Limited
2224 or else not Limited_Present
(Context_Item
))
2226 Lib_Unit
:= Library_Unit
(Context_Item
);
2229 -- If the context item indicates that a package body is needed
2230 -- because of an instantiation in CU, traverse the body now, even
2231 -- if CU is not related to the main unit. If the generic itself
2232 -- appears in a package body, the context item is this body, and
2233 -- it already appears in the traversal order, so we only need to
2234 -- examine the case of a context item being a package declaration.
2236 if Present
(Withed_Body
(Context_Item
))
2237 and then Nkind
(Unit
(Lib_Unit
)) = N_Package_Declaration
2238 and then Present
(Corresponding_Body
(Unit
(Lib_Unit
)))
2242 (Unit_Declaration_Node
2243 (Corresponding_Body
(Unit
(Lib_Unit
))));
2245 -- A body may have an implicit with on its own spec, in which
2246 -- case we must ignore this context item to prevent looping.
2248 if Unit
(CU
) /= Unit
(Body_CU
) then
2254 Context_Item
:= Next
(Context_Item
);
2256 end Walk_Withs_Immediate
;