1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
10 -- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
12 -- GNAT is free software; you can redistribute it and/or modify it under --
13 -- terms of the GNU General Public License as published by the Free Soft- --
14 -- ware Foundation; either version 2, or (at your option) any later ver- --
15 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
16 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
17 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
18 -- for more details. You should have received a copy of the GNU General --
19 -- Public License distributed with GNAT; see file COPYING. If not, write --
20 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
21 -- MA 02111-1307, USA. --
23 -- GNAT was originally developed by the GNAT team at New York University. --
24 -- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
26 ------------------------------------------------------------------------------
28 with Atree; use Atree;
29 with Debug; use Debug;
30 with Debug_A; use Debug_A;
31 with Einfo; use Einfo;
32 with Errout; use Errout;
33 with Expander; use Expander;
34 with Fname; use Fname;
37 with Lib.Load; use Lib.Load;
38 with Nlists; use Nlists;
40 with Sem_Attr; use Sem_Attr;
41 with Sem_Ch2; use Sem_Ch2;
42 with Sem_Ch3; use Sem_Ch3;
43 with Sem_Ch4; use Sem_Ch4;
44 with Sem_Ch5; use Sem_Ch5;
45 with Sem_Ch6; use Sem_Ch6;
46 with Sem_Ch7; use Sem_Ch7;
47 with Sem_Ch8; use Sem_Ch8;
48 with Sem_Ch9; use Sem_Ch9;
49 with Sem_Ch10; use Sem_Ch10;
50 with Sem_Ch11; use Sem_Ch11;
51 with Sem_Ch12; use Sem_Ch12;
52 with Sem_Ch13; use Sem_Ch13;
53 with Sem_Prag; use Sem_Prag;
54 with Sem_Util; use Sem_Util;
55 with Sinfo; use Sinfo;
56 with Stand; use Stand;
57 with Uintp; use Uintp;
59 pragma Warnings (Off, Sem_Util);
60 -- Suppress warnings of unused with for Sem_Util (used only in asserts)
64 Outer_Generic_Scope : Entity_Id := Empty;
65 -- Global reference to the outer scope that is generic. In a non
66 -- generic context, it is empty. At the moment, it is only used
67 -- for avoiding freezing of external references in generics.
73 procedure Analyze (N : Node_Id) is
75 Debug_A_Entry ("analyzing ", N);
77 -- Immediate return if already analyzed
80 Debug_A_Exit ("analyzing ", N, " (done, analyzed already)");
84 Current_Error_Node := N;
86 -- Otherwise processing depends on the node kind
90 when N_Abort_Statement =>
91 Analyze_Abort_Statement (N);
93 when N_Abstract_Subprogram_Declaration =>
94 Analyze_Abstract_Subprogram_Declaration (N);
96 when N_Accept_Alternative =>
97 Analyze_Accept_Alternative (N);
99 when N_Accept_Statement =>
100 Analyze_Accept_Statement (N);
103 Analyze_Aggregate (N);
106 Analyze_Allocator (N);
109 Analyze_Short_Circuit (N);
111 when N_Assignment_Statement =>
112 Analyze_Assignment (N);
114 when N_Asynchronous_Select =>
115 Analyze_Asynchronous_Select (N);
118 Analyze_At_Clause (N);
120 when N_Attribute_Reference =>
121 Analyze_Attribute (N);
123 when N_Attribute_Definition_Clause =>
124 Analyze_Attribute_Definition_Clause (N);
126 when N_Block_Statement =>
127 Analyze_Block_Statement (N);
129 when N_Case_Statement =>
130 Analyze_Case_Statement (N);
132 when N_Character_Literal =>
133 Analyze_Character_Literal (N);
135 when N_Code_Statement =>
136 Analyze_Code_Statement (N);
138 when N_Compilation_Unit =>
139 Analyze_Compilation_Unit (N);
141 when N_Component_Declaration =>
142 Analyze_Component_Declaration (N);
144 when N_Conditional_Expression =>
145 Analyze_Conditional_Expression (N);
147 when N_Conditional_Entry_Call =>
148 Analyze_Conditional_Entry_Call (N);
150 when N_Delay_Alternative =>
151 Analyze_Delay_Alternative (N);
153 when N_Delay_Relative_Statement =>
154 Analyze_Delay_Relative (N);
156 when N_Delay_Until_Statement =>
157 Analyze_Delay_Until (N);
160 Analyze_Entry_Body (N);
162 when N_Entry_Body_Formal_Part =>
163 Analyze_Entry_Body_Formal_Part (N);
165 when N_Entry_Call_Alternative =>
166 Analyze_Entry_Call_Alternative (N);
168 when N_Entry_Declaration =>
169 Analyze_Entry_Declaration (N);
171 when N_Entry_Index_Specification =>
172 Analyze_Entry_Index_Specification (N);
174 when N_Enumeration_Representation_Clause =>
175 Analyze_Enumeration_Representation_Clause (N);
177 when N_Exception_Declaration =>
178 Analyze_Exception_Declaration (N);
180 when N_Exception_Renaming_Declaration =>
181 Analyze_Exception_Renaming (N);
183 when N_Exit_Statement =>
184 Analyze_Exit_Statement (N);
186 when N_Expanded_Name =>
187 Analyze_Expanded_Name (N);
189 when N_Explicit_Dereference =>
190 Analyze_Explicit_Dereference (N);
192 when N_Extension_Aggregate =>
193 Analyze_Aggregate (N);
195 when N_Formal_Object_Declaration =>
196 Analyze_Formal_Object_Declaration (N);
198 when N_Formal_Package_Declaration =>
199 Analyze_Formal_Package (N);
201 when N_Formal_Subprogram_Declaration =>
202 Analyze_Formal_Subprogram (N);
204 when N_Formal_Type_Declaration =>
205 Analyze_Formal_Type_Declaration (N);
207 when N_Free_Statement =>
208 Analyze_Free_Statement (N);
210 when N_Freeze_Entity =>
211 null; -- no semantic processing required
213 when N_Full_Type_Declaration =>
214 Analyze_Type_Declaration (N);
216 when N_Function_Call =>
217 Analyze_Function_Call (N);
219 when N_Function_Instantiation =>
220 Analyze_Function_Instantiation (N);
222 when N_Generic_Function_Renaming_Declaration =>
223 Analyze_Generic_Function_Renaming (N);
225 when N_Generic_Package_Declaration =>
226 Analyze_Generic_Package_Declaration (N);
228 when N_Generic_Package_Renaming_Declaration =>
229 Analyze_Generic_Package_Renaming (N);
231 when N_Generic_Procedure_Renaming_Declaration =>
232 Analyze_Generic_Procedure_Renaming (N);
234 when N_Generic_Subprogram_Declaration =>
235 Analyze_Generic_Subprogram_Declaration (N);
237 when N_Goto_Statement =>
238 Analyze_Goto_Statement (N);
240 when N_Handled_Sequence_Of_Statements =>
241 Analyze_Handled_Statements (N);
244 Analyze_Identifier (N);
246 when N_If_Statement =>
247 Analyze_If_Statement (N);
249 when N_Implicit_Label_Declaration =>
250 Analyze_Implicit_Label_Declaration (N);
253 Analyze_Membership_Op (N);
255 when N_Incomplete_Type_Declaration =>
256 Analyze_Incomplete_Type_Decl (N);
258 when N_Indexed_Component =>
259 Analyze_Indexed_Component_Form (N);
261 when N_Integer_Literal =>
262 Analyze_Integer_Literal (N);
264 when N_Itype_Reference =>
265 Analyze_Itype_Reference (N);
270 when N_Loop_Statement =>
271 Analyze_Loop_Statement (N);
274 Analyze_Membership_Op (N);
279 when N_Null_Statement =>
280 Analyze_Null_Statement (N);
282 when N_Number_Declaration =>
283 Analyze_Number_Declaration (N);
285 when N_Object_Declaration =>
286 Analyze_Object_Declaration (N);
288 when N_Object_Renaming_Declaration =>
289 Analyze_Object_Renaming (N);
291 when N_Operator_Symbol =>
292 Analyze_Operator_Symbol (N);
295 Analyze_Unary_Op (N);
298 Analyze_Arithmetic_Op (N);
301 Analyze_Logical_Op (N);
304 Analyze_Concatenation (N);
307 Analyze_Arithmetic_Op (N);
310 Analyze_Equality_Op (N);
313 Analyze_Arithmetic_Op (N);
316 Analyze_Comparison_Op (N);
319 Analyze_Comparison_Op (N);
322 Analyze_Comparison_Op (N);
325 Analyze_Comparison_Op (N);
328 Analyze_Unary_Op (N);
331 Analyze_Arithmetic_Op (N);
333 when N_Op_Multiply =>
334 Analyze_Arithmetic_Op (N);
337 Analyze_Equality_Op (N);
340 Analyze_Negation (N);
343 Analyze_Logical_Op (N);
346 Analyze_Unary_Op (N);
349 Analyze_Arithmetic_Op (N);
351 when N_Op_Rotate_Left =>
352 Analyze_Arithmetic_Op (N);
354 when N_Op_Rotate_Right =>
355 Analyze_Arithmetic_Op (N);
357 when N_Op_Shift_Left =>
358 Analyze_Arithmetic_Op (N);
360 when N_Op_Shift_Right =>
361 Analyze_Arithmetic_Op (N);
363 when N_Op_Shift_Right_Arithmetic =>
364 Analyze_Arithmetic_Op (N);
366 when N_Op_Subtract =>
367 Analyze_Arithmetic_Op (N);
370 Analyze_Logical_Op (N);
373 Analyze_Short_Circuit (N);
375 when N_Others_Choice =>
376 Analyze_Others_Choice (N);
378 when N_Package_Body =>
379 Analyze_Package_Body (N);
381 when N_Package_Body_Stub =>
382 Analyze_Package_Body_Stub (N);
384 when N_Package_Declaration =>
385 Analyze_Package_Declaration (N);
387 when N_Package_Instantiation =>
388 Analyze_Package_Instantiation (N);
390 when N_Package_Renaming_Declaration =>
391 Analyze_Package_Renaming (N);
393 when N_Package_Specification =>
394 Analyze_Package_Specification (N);
396 when N_Parameter_Association =>
397 Analyze_Parameter_Association (N);
402 when N_Private_Extension_Declaration =>
403 Analyze_Private_Extension_Declaration (N);
405 when N_Private_Type_Declaration =>
406 Analyze_Private_Type_Declaration (N);
408 when N_Procedure_Call_Statement =>
409 Analyze_Procedure_Call (N);
411 when N_Procedure_Instantiation =>
412 Analyze_Procedure_Instantiation (N);
414 when N_Protected_Body =>
415 Analyze_Protected_Body (N);
417 when N_Protected_Body_Stub =>
418 Analyze_Protected_Body_Stub (N);
420 when N_Protected_Definition =>
421 Analyze_Protected_Definition (N);
423 when N_Protected_Type_Declaration =>
424 Analyze_Protected_Type (N);
426 when N_Qualified_Expression =>
427 Analyze_Qualified_Expression (N);
429 when N_Raise_Statement =>
430 Analyze_Raise_Statement (N);
432 when N_Raise_xxx_Error =>
433 Analyze_Raise_xxx_Error (N);
438 when N_Range_Constraint =>
439 Analyze_Range (Range_Expression (N));
441 when N_Real_Literal =>
442 Analyze_Real_Literal (N);
444 when N_Record_Representation_Clause =>
445 Analyze_Record_Representation_Clause (N);
448 Analyze_Reference (N);
450 when N_Requeue_Statement =>
453 when N_Return_Statement =>
454 Analyze_Return_Statement (N);
456 when N_Selected_Component =>
457 Find_Selected_Component (N);
458 -- ??? why not Analyze_Selected_Component, needs comments
460 when N_Selective_Accept =>
461 Analyze_Selective_Accept (N);
463 when N_Single_Protected_Declaration =>
464 Analyze_Single_Protected (N);
466 when N_Single_Task_Declaration =>
467 Analyze_Single_Task (N);
472 when N_String_Literal =>
473 Analyze_String_Literal (N);
475 when N_Subprogram_Body =>
476 Analyze_Subprogram_Body (N);
478 when N_Subprogram_Body_Stub =>
479 Analyze_Subprogram_Body_Stub (N);
481 when N_Subprogram_Declaration =>
482 Analyze_Subprogram_Declaration (N);
484 when N_Subprogram_Info =>
485 Analyze_Subprogram_Info (N);
487 when N_Subprogram_Renaming_Declaration =>
488 Analyze_Subprogram_Renaming (N);
490 when N_Subtype_Declaration =>
491 Analyze_Subtype_Declaration (N);
493 when N_Subtype_Indication =>
494 Analyze_Subtype_Indication (N);
500 Analyze_Task_Body (N);
502 when N_Task_Body_Stub =>
503 Analyze_Task_Body_Stub (N);
505 when N_Task_Definition =>
506 Analyze_Task_Definition (N);
508 when N_Task_Type_Declaration =>
509 Analyze_Task_Type (N);
511 when N_Terminate_Alternative =>
512 Analyze_Terminate_Alternative (N);
514 when N_Timed_Entry_Call =>
515 Analyze_Timed_Entry_Call (N);
517 when N_Triggering_Alternative =>
518 Analyze_Triggering_Alternative (N);
520 when N_Type_Conversion =>
521 Analyze_Type_Conversion (N);
523 when N_Unchecked_Expression =>
524 Analyze_Unchecked_Expression (N);
526 when N_Unchecked_Type_Conversion =>
527 Analyze_Unchecked_Type_Conversion (N);
529 when N_Use_Package_Clause =>
530 Analyze_Use_Package (N);
532 when N_Use_Type_Clause =>
533 Analyze_Use_Type (N);
535 when N_Validate_Unchecked_Conversion =>
538 when N_Variant_Part =>
539 Analyze_Variant_Part (N);
541 when N_With_Clause =>
542 Analyze_With_Clause (N);
544 when N_With_Type_Clause =>
545 Analyze_With_Type_Clause (N);
547 -- A call to analyze the Empty node is an error, but most likely
548 -- it is an error caused by an attempt to analyze a malformed
549 -- piece of tree caused by some other error, so if there have
550 -- been any other errors, we just ignore it, otherwise it is
551 -- a real internal error which we complain about.
554 pragma Assert (Serious_Errors_Detected /= 0);
557 -- A call to analyze the error node is simply ignored, to avoid
558 -- causing cascaded errors (happens of course only in error cases)
563 -- For the remaining node types, we generate compiler abort, because
564 -- these nodes are always analyzed within the Sem_Chn routines and
565 -- there should never be a case of making a call to the main Analyze
566 -- routine for these node kinds. For example, an N_Access_Definition
567 -- node appears only in the context of a type declaration, and is
568 -- processed by the analyze routine for type declarations.
572 N_Access_Definition |
573 N_Access_Function_Definition |
574 N_Access_Procedure_Definition |
575 N_Access_To_Object_Definition |
576 N_Case_Statement_Alternative |
577 N_Compilation_Unit_Aux |
578 N_Component_Association |
581 N_Constrained_Array_Definition |
582 N_Decimal_Fixed_Point_Definition |
583 N_Defining_Character_Literal |
584 N_Defining_Identifier |
585 N_Defining_Operator_Symbol |
586 N_Defining_Program_Unit_Name |
588 N_Derived_Type_Definition |
590 N_Digits_Constraint |
591 N_Discriminant_Association |
592 N_Discriminant_Specification |
594 N_Entry_Call_Statement |
595 N_Enumeration_Type_Definition |
596 N_Exception_Handler |
597 N_Floating_Point_Definition |
598 N_Formal_Decimal_Fixed_Point_Definition |
599 N_Formal_Derived_Type_Definition |
600 N_Formal_Discrete_Type_Definition |
601 N_Formal_Floating_Point_Definition |
602 N_Formal_Modular_Type_Definition |
603 N_Formal_Ordinary_Fixed_Point_Definition |
604 N_Formal_Private_Type_Definition |
605 N_Formal_Signed_Integer_Type_Definition |
606 N_Function_Specification |
607 N_Generic_Association |
608 N_Index_Or_Discriminant_Constraint |
610 N_Loop_Parameter_Specification |
612 N_Modular_Type_Definition |
613 N_Ordinary_Fixed_Point_Definition |
614 N_Parameter_Specification |
615 N_Pragma_Argument_Association |
616 N_Procedure_Specification |
617 N_Real_Range_Specification |
618 N_Record_Definition |
619 N_Signed_Integer_Type_Definition |
620 N_Unconstrained_Array_Definition |
628 Debug_A_Exit ("analyzing ", N, " (done)");
630 -- Now that we have analyzed the node, we call the expander to
631 -- perform possible expansion. This is done only for nodes that
632 -- are not subexpressions, because in the case of subexpressions,
633 -- we don't have the type yet, and the expander will need to know
634 -- the type before it can do its job. For subexpression nodes, the
635 -- call to the expander happens in the Sem_Res.Resolve.
637 -- The Analyzed flag is also set at this point for non-subexpression
638 -- nodes (in the case of subexpression nodes, we can't set the flag
639 -- yet, since resolution and expansion have not yet been completed)
641 if Nkind (N) not in N_Subexpr then
647 -- Version with check(s) suppressed
649 procedure Analyze (N : Node_Id; Suppress : Check_Id) is
651 if Suppress = All_Checks then
653 Svg : constant Suppress_Record := Scope_Suppress;
656 Scope_Suppress := (others => True);
658 Scope_Suppress := Svg;
663 Svg : constant Boolean := Get_Scope_Suppress (Suppress);
666 Set_Scope_Suppress (Suppress, True);
668 Set_Scope_Suppress (Suppress, Svg);
677 procedure Analyze_List (L : List_Id) is
682 while Present (Node) loop
688 -- Version with check(s) suppressed
690 procedure Analyze_List (L : List_Id; Suppress : Check_Id) is
692 if Suppress = All_Checks then
694 Svg : constant Suppress_Record := Scope_Suppress;
697 Scope_Suppress := (others => True);
699 Scope_Suppress := Svg;
704 Svg : constant Boolean := Get_Scope_Suppress (Suppress);
707 Set_Scope_Suppress (Suppress, True);
709 Set_Scope_Suppress (Suppress, Svg);
714 -------------------------
715 -- Enter_Generic_Scope --
716 -------------------------
718 procedure Enter_Generic_Scope (S : Entity_Id) is
720 if No (Outer_Generic_Scope) then
721 Outer_Generic_Scope := S;
723 end Enter_Generic_Scope;
725 ------------------------
726 -- Exit_Generic_Scope --
727 ------------------------
729 procedure Exit_Generic_Scope (S : Entity_Id) is
731 if S = Outer_Generic_Scope then
732 Outer_Generic_Scope := Empty;
734 end Exit_Generic_Scope;
736 -----------------------------
737 -- External_Ref_In_Generic --
738 -----------------------------
740 function External_Ref_In_Generic (E : Entity_Id) return Boolean is
743 -- Entity is global if defined outside of current outer_generic_scope:
744 -- Either the entity has a smaller depth that the outer generic, or it
745 -- is in a different compilation unit.
747 return Present (Outer_Generic_Scope)
748 and then (Scope_Depth (Scope (E)) < Scope_Depth (Outer_Generic_Scope)
749 or else not In_Same_Source_Unit (E, Outer_Generic_Scope));
750 end External_Ref_In_Generic;
752 ------------------------
753 -- Get_Scope_Suppress --
754 ------------------------
756 function Get_Scope_Suppress (C : Check_Id) return Boolean is
757 S : Suppress_Record renames Scope_Suppress;
761 when Access_Check => return S.Access_Checks;
762 when Accessibility_Check => return S.Accessibility_Checks;
763 when Discriminant_Check => return S.Discriminant_Checks;
764 when Division_Check => return S.Division_Checks;
765 when Elaboration_Check => return S.Discriminant_Checks;
766 when Index_Check => return S.Elaboration_Checks;
767 when Length_Check => return S.Discriminant_Checks;
768 when Overflow_Check => return S.Overflow_Checks;
769 when Range_Check => return S.Range_Checks;
770 when Storage_Check => return S.Storage_Checks;
771 when Tag_Check => return S.Tag_Checks;
775 end Get_Scope_Suppress;
781 procedure Initialize is
783 Entity_Suppress.Init;
785 Unloaded_Subunits := False;
788 ------------------------------
789 -- Insert_After_And_Analyze --
790 ------------------------------
792 procedure Insert_After_And_Analyze (N : Node_Id; M : Node_Id) is
798 -- If we are not at the end of the list, then the easiest
799 -- coding is simply to insert before our successor
801 if Present (Next (N)) then
802 Insert_Before_And_Analyze (Next (N), M);
804 -- Case of inserting at the end of the list
807 -- Capture the Node_Id of the node to be inserted. This Node_Id
808 -- will still be the same after the insert operation.
813 -- Now just analyze from the inserted node to the end of
814 -- the new list (note that this properly handles the case
815 -- where any of the analyze calls result in the insertion of
816 -- nodes after the analyzed node, expecting analysis).
818 while Present (Node) loop
820 Mark_Rewrite_Insertion (Node);
826 end Insert_After_And_Analyze;
828 -- Version with check(s) suppressed
830 procedure Insert_After_And_Analyze
831 (N : Node_Id; M : Node_Id; Suppress : Check_Id)
834 if Suppress = All_Checks then
836 Svg : constant Suppress_Record := Scope_Suppress;
839 Scope_Suppress := (others => True);
840 Insert_After_And_Analyze (N, M);
841 Scope_Suppress := Svg;
846 Svg : constant Boolean := Get_Scope_Suppress (Suppress);
849 Set_Scope_Suppress (Suppress, True);
850 Insert_After_And_Analyze (N, M);
851 Set_Scope_Suppress (Suppress, Svg);
854 end Insert_After_And_Analyze;
856 -------------------------------
857 -- Insert_Before_And_Analyze --
858 -------------------------------
860 procedure Insert_Before_And_Analyze (N : Node_Id; M : Node_Id) is
866 -- Capture the Node_Id of the first list node to be inserted.
867 -- This will still be the first node after the insert operation,
868 -- since Insert_List_After does not modify the Node_Id values.
871 Insert_Before (N, M);
873 -- The insertion does not change the Id's of any of the nodes in
874 -- the list, and they are still linked, so we can simply loop from
875 -- the original first node until we meet the node before which the
876 -- insertion is occurring. Note that this properly handles the case
877 -- where any of the analyzed nodes insert nodes after themselves,
878 -- expecting them to get analyzed.
882 Mark_Rewrite_Insertion (Node);
887 end Insert_Before_And_Analyze;
889 -- Version with check(s) suppressed
891 procedure Insert_Before_And_Analyze
892 (N : Node_Id; M : Node_Id; Suppress : Check_Id)
895 if Suppress = All_Checks then
897 Svg : constant Suppress_Record := Scope_Suppress;
900 Scope_Suppress := (others => True);
901 Insert_Before_And_Analyze (N, M);
902 Scope_Suppress := Svg;
907 Svg : constant Boolean := Get_Scope_Suppress (Suppress);
910 Set_Scope_Suppress (Suppress, True);
911 Insert_Before_And_Analyze (N, M);
912 Set_Scope_Suppress (Suppress, Svg);
915 end Insert_Before_And_Analyze;
917 -----------------------------------
918 -- Insert_List_After_And_Analyze --
919 -----------------------------------
921 procedure Insert_List_After_And_Analyze (N : Node_Id; L : List_Id) is
922 After : constant Node_Id := Next (N);
926 if Is_Non_Empty_List (L) then
928 -- Capture the Node_Id of the first list node to be inserted.
929 -- This will still be the first node after the insert operation,
930 -- since Insert_List_After does not modify the Node_Id values.
933 Insert_List_After (N, L);
935 -- Now just analyze from the original first node until we get to
936 -- the successor of the original insertion point (which may be
937 -- Empty if the insertion point was at the end of the list). Note
938 -- that this properly handles the case where any of the analyze
939 -- calls result in the insertion of nodes after the analyzed
940 -- node (possibly calling this routine recursively).
942 while Node /= After loop
944 Mark_Rewrite_Insertion (Node);
949 end Insert_List_After_And_Analyze;
951 -- Version with check(s) suppressed
953 procedure Insert_List_After_And_Analyze
954 (N : Node_Id; L : List_Id; Suppress : Check_Id)
957 if Suppress = All_Checks then
959 Svg : constant Suppress_Record := Scope_Suppress;
962 Scope_Suppress := (others => True);
963 Insert_List_After_And_Analyze (N, L);
964 Scope_Suppress := Svg;
969 Svg : constant Boolean := Get_Scope_Suppress (Suppress);
972 Set_Scope_Suppress (Suppress, True);
973 Insert_List_After_And_Analyze (N, L);
974 Set_Scope_Suppress (Suppress, Svg);
977 end Insert_List_After_And_Analyze;
979 ------------------------------------
980 -- Insert_List_Before_And_Analyze --
981 ------------------------------------
983 procedure Insert_List_Before_And_Analyze (N : Node_Id; L : List_Id) is
987 if Is_Non_Empty_List (L) then
989 -- Capture the Node_Id of the first list node to be inserted.
990 -- This will still be the first node after the insert operation,
991 -- since Insert_List_After does not modify the Node_Id values.
994 Insert_List_Before (N, L);
996 -- The insertion does not change the Id's of any of the nodes in
997 -- the list, and they are still linked, so we can simply loop from
998 -- the original first node until we meet the node before which the
999 -- insertion is occurring. Note that this properly handles the case
1000 -- where any of the analyzed nodes insert nodes after themselves,
1001 -- expecting them to get analyzed.
1003 while Node /= N loop
1005 Mark_Rewrite_Insertion (Node);
1010 end Insert_List_Before_And_Analyze;
1012 -- Version with check(s) suppressed
1014 procedure Insert_List_Before_And_Analyze
1015 (N : Node_Id; L : List_Id; Suppress : Check_Id)
1018 if Suppress = All_Checks then
1020 Svg : constant Suppress_Record := Scope_Suppress;
1023 Scope_Suppress := (others => True);
1024 Insert_List_Before_And_Analyze (N, L);
1025 Scope_Suppress := Svg;
1030 Svg : constant Boolean := Get_Scope_Suppress (Suppress);
1033 Set_Scope_Suppress (Suppress, True);
1034 Insert_List_Before_And_Analyze (N, L);
1035 Set_Scope_Suppress (Suppress, Svg);
1038 end Insert_List_Before_And_Analyze;
1046 Entity_Suppress.Locked := True;
1047 Scope_Stack.Locked := True;
1048 Entity_Suppress.Release;
1049 Scope_Stack.Release;
1056 procedure Semantics (Comp_Unit : Node_Id) is
1058 -- The following locations save the corresponding global flags and
1059 -- variables so that they can be restored on completion. This is
1060 -- needed so that calls to Rtsfind start with the proper default
1061 -- values for these variables, and also that such calls do not
1062 -- disturb the settings for units being analyzed at a higher level.
1064 S_Full_Analysis : constant Boolean := Full_Analysis;
1065 S_In_Default_Expr : constant Boolean := In_Default_Expression;
1066 S_Inside_A_Generic : constant Boolean := Inside_A_Generic;
1067 S_New_Nodes_OK : constant Int := New_Nodes_OK;
1068 S_Outer_Gen_Scope : constant Entity_Id := Outer_Generic_Scope;
1069 S_Sem_Unit : constant Unit_Number_Type := Current_Sem_Unit;
1071 Save_Config_Switches : Config_Switches_Type;
1072 -- Variable used to save values of config switches while we analyze
1073 -- the new unit, to be restored on exit for proper recursive behavior.
1075 procedure Do_Analyze;
1076 -- Procedure to analyze the compilation unit. This is called more
1077 -- than once when the high level optimizer is activated.
1079 procedure Do_Analyze is
1082 New_Scope (Standard_Standard);
1083 Scope_Suppress := Suppress_Options;
1085 (Scope_Stack.Last).Component_Alignment_Default := Calign_Default;
1087 (Scope_Stack.Last).Is_Active_Stack_Base := True;
1088 Outer_Generic_Scope := Empty;
1090 -- Now analyze the top level compilation unit node
1092 Analyze (Comp_Unit);
1094 -- Check for scope mismatch on exit from compilation
1096 pragma Assert (Current_Scope = Standard_Standard
1097 or else Comp_Unit = Cunit (Main_Unit));
1099 -- Then pop entry for Standard, and pop implicit types
1102 Restore_Scope_Stack;
1105 -- Start of processing for Sem
1108 Compiler_State := Analyzing;
1109 Current_Sem_Unit := Get_Cunit_Unit_Number (Comp_Unit);
1111 Expander_Mode_Save_And_Set
1112 (Operating_Mode = Generate_Code or Debug_Flag_X);
1114 Full_Analysis := True;
1115 Inside_A_Generic := False;
1116 In_Default_Expression := False;
1118 Set_Comes_From_Source_Default (False);
1119 Save_Opt_Config_Switches (Save_Config_Switches);
1120 Set_Opt_Config_Switches
1121 (Is_Internal_File_Name (Unit_File_Name (Current_Sem_Unit)));
1123 -- Only do analysis of unit that has not already been analyzed
1125 if not Analyzed (Comp_Unit) then
1126 Initialize_Version (Current_Sem_Unit);
1128 Expander_Mode_Save_And_Set (False);
1131 Reset_Analyzed_Flags (Comp_Unit);
1132 Expander_Mode_Restore;
1133 High_Level_Optimize (Comp_Unit);
1140 -- Save indication of dynamic elaboration checks for ALI file
1142 Set_Dynamic_Elab (Current_Sem_Unit, Dynamic_Elaboration_Checks);
1144 -- Restore settings of saved switches to entry values
1146 Current_Sem_Unit := S_Sem_Unit;
1147 Full_Analysis := S_Full_Analysis;
1148 In_Default_Expression := S_In_Default_Expr;
1149 Inside_A_Generic := S_Inside_A_Generic;
1150 New_Nodes_OK := S_New_Nodes_OK;
1151 Outer_Generic_Scope := S_Outer_Gen_Scope;
1153 Restore_Opt_Config_Switches (Save_Config_Switches);
1154 Expander_Mode_Restore;
1158 ------------------------
1159 -- Set_Scope_Suppress --
1160 ------------------------
1162 procedure Set_Scope_Suppress (C : Check_Id; B : Boolean) is
1163 S : Suppress_Record renames Scope_Suppress;
1167 when Access_Check => S.Access_Checks := B;
1168 when Accessibility_Check => S.Accessibility_Checks := B;
1169 when Discriminant_Check => S.Discriminant_Checks := B;
1170 when Division_Check => S.Division_Checks := B;
1171 when Elaboration_Check => S.Discriminant_Checks := B;
1172 when Index_Check => S.Elaboration_Checks := B;
1173 when Length_Check => S.Discriminant_Checks := B;
1174 when Overflow_Check => S.Overflow_Checks := B;
1175 when Range_Check => S.Range_Checks := B;
1176 when Storage_Check => S.Storage_Checks := B;
1177 when Tag_Check => S.Tag_Checks := B;
1179 raise Program_Error;
1181 end Set_Scope_Suppress;