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. 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 Checks; use Checks;
28 with Einfo; use Einfo;
29 with Errout; use Errout;
30 with Expander; use Expander;
31 with Exp_Util; use Exp_Util;
32 with Freeze; use Freeze;
34 with Lib.Xref; use Lib.Xref;
35 with Namet; use Namet;
36 with Nlists; use Nlists;
37 with Nmake; use Nmake;
39 with Rtsfind; use Rtsfind;
41 with Sem_Aux; use Sem_Aux;
42 with Sem_Case; use Sem_Case;
43 with Sem_Ch3; use Sem_Ch3;
44 with Sem_Ch8; use Sem_Ch8;
45 with Sem_Disp; use Sem_Disp;
46 with Sem_Elab; use Sem_Elab;
47 with Sem_Eval; use Sem_Eval;
48 with Sem_Res; use Sem_Res;
49 with Sem_Type; use Sem_Type;
50 with Sem_Util; use Sem_Util;
51 with Sem_Warn; use Sem_Warn;
52 with Snames; use Snames;
53 with Stand; use Stand;
54 with Sinfo; use Sinfo;
55 with Targparm; use Targparm;
56 with Tbuild; use Tbuild;
57 with Uintp; use Uintp;
59 package body Sem_Ch5 is
61 Unblocked_Exit_Count : Nat := 0;
62 -- This variable is used when processing if statements, case statements,
63 -- and block statements. It counts the number of exit points that are not
64 -- blocked by unconditional transfer instructions: for IF and CASE, these
65 -- are the branches of the conditional; for a block, they are the statement
66 -- sequence of the block, and the statement sequences of any exception
67 -- handlers that are part of the block. When processing is complete, if
68 -- this count is zero, it means that control cannot fall through the IF,
69 -- CASE or block statement. This is used for the generation of warning
70 -- messages. This variable is recursively saved on entry to processing the
71 -- construct, and restored on exit.
73 ------------------------
74 -- Analyze_Assignment --
75 ------------------------
77 procedure Analyze_Assignment (N : Node_Id) is
78 Lhs : constant Node_Id := Name (N);
79 Rhs : constant Node_Id := Expression (N);
84 procedure Diagnose_Non_Variable_Lhs (N : Node_Id);
85 -- N is the node for the left hand side of an assignment, and it is not
86 -- a variable. This routine issues an appropriate diagnostic.
89 -- This is called to kill current value settings of a simple variable
90 -- on the left hand side. We call it if we find any error in analyzing
91 -- the assignment, and at the end of processing before setting any new
92 -- current values in place.
94 procedure Set_Assignment_Type
96 Opnd_Type : in out Entity_Id);
97 -- Opnd is either the Lhs or Rhs of the assignment, and Opnd_Type
98 -- is the nominal subtype. This procedure is used to deal with cases
99 -- where the nominal subtype must be replaced by the actual subtype.
101 -------------------------------
102 -- Diagnose_Non_Variable_Lhs --
103 -------------------------------
105 procedure Diagnose_Non_Variable_Lhs (N : Node_Id) is
107 -- Not worth posting another error if left hand side already
108 -- flagged as being illegal in some respect.
110 if Error_Posted (N) then
113 -- Some special bad cases of entity names
115 elsif Is_Entity_Name (N) then
117 Ent : constant Entity_Id := Entity (N);
120 if Ekind (Ent) = E_In_Parameter then
122 ("assignment to IN mode parameter not allowed", N);
124 -- Renamings of protected private components are turned into
125 -- constants when compiling a protected function. In the case
126 -- of single protected types, the private component appears
129 elsif (Is_Prival (Ent)
131 (Ekind (Current_Scope) = E_Function
132 or else Ekind (Enclosing_Dynamic_Scope (
133 Current_Scope)) = E_Function))
135 (Ekind (Ent) = E_Component
136 and then Is_Protected_Type (Scope (Ent)))
139 ("protected function cannot modify protected object", N);
141 elsif Ekind (Ent) = E_Loop_Parameter then
143 ("assignment to loop parameter not allowed", N);
147 ("left hand side of assignment must be a variable", N);
151 -- For indexed components or selected components, test prefix
153 elsif Nkind (N) = N_Indexed_Component then
154 Diagnose_Non_Variable_Lhs (Prefix (N));
156 -- Another special case for assignment to discriminant
158 elsif Nkind (N) = N_Selected_Component then
159 if Present (Entity (Selector_Name (N)))
160 and then Ekind (Entity (Selector_Name (N))) = E_Discriminant
163 ("assignment to discriminant not allowed", N);
165 Diagnose_Non_Variable_Lhs (Prefix (N));
169 -- If we fall through, we have no special message to issue!
171 Error_Msg_N ("left hand side of assignment must be a variable", N);
173 end Diagnose_Non_Variable_Lhs;
179 procedure Kill_Lhs is
181 if Is_Entity_Name (Lhs) then
183 Ent : constant Entity_Id := Entity (Lhs);
185 if Present (Ent) then
186 Kill_Current_Values (Ent);
192 -------------------------
193 -- Set_Assignment_Type --
194 -------------------------
196 procedure Set_Assignment_Type
198 Opnd_Type : in out Entity_Id)
201 Require_Entity (Opnd);
203 -- If the assignment operand is an in-out or out parameter, then we
204 -- get the actual subtype (needed for the unconstrained case).
205 -- If the operand is the actual in an entry declaration, then within
206 -- the accept statement it is replaced with a local renaming, which
207 -- may also have an actual subtype.
209 if Is_Entity_Name (Opnd)
210 and then (Ekind (Entity (Opnd)) = E_Out_Parameter
211 or else Ekind (Entity (Opnd)) =
213 or else Ekind (Entity (Opnd)) =
214 E_Generic_In_Out_Parameter
216 (Ekind (Entity (Opnd)) = E_Variable
217 and then Nkind (Parent (Entity (Opnd))) =
218 N_Object_Renaming_Declaration
219 and then Nkind (Parent (Parent (Entity (Opnd)))) =
222 Opnd_Type := Get_Actual_Subtype (Opnd);
224 -- If assignment operand is a component reference, then we get the
225 -- actual subtype of the component for the unconstrained case.
227 elsif Nkind_In (Opnd, N_Selected_Component, N_Explicit_Dereference)
228 and then not Is_Unchecked_Union (Opnd_Type)
230 Decl := Build_Actual_Subtype_Of_Component (Opnd_Type, Opnd);
232 if Present (Decl) then
233 Insert_Action (N, Decl);
234 Mark_Rewrite_Insertion (Decl);
236 Opnd_Type := Defining_Identifier (Decl);
237 Set_Etype (Opnd, Opnd_Type);
238 Freeze_Itype (Opnd_Type, N);
240 elsif Is_Constrained (Etype (Opnd)) then
241 Opnd_Type := Etype (Opnd);
244 -- For slice, use the constrained subtype created for the slice
246 elsif Nkind (Opnd) = N_Slice then
247 Opnd_Type := Etype (Opnd);
249 end Set_Assignment_Type;
251 -- Start of processing for Analyze_Assignment
254 Mark_Coextensions (N, Rhs);
259 -- Start type analysis for assignment
263 -- In the most general case, both Lhs and Rhs can be overloaded, and we
264 -- must compute the intersection of the possible types on each side.
266 if Is_Overloaded (Lhs) then
273 Get_First_Interp (Lhs, I, It);
275 while Present (It.Typ) loop
276 if Has_Compatible_Type (Rhs, It.Typ) then
277 if T1 /= Any_Type then
279 -- An explicit dereference is overloaded if the prefix
280 -- is. Try to remove the ambiguity on the prefix, the
281 -- error will be posted there if the ambiguity is real.
283 if Nkind (Lhs) = N_Explicit_Dereference then
286 PI1 : Interp_Index := 0;
292 Get_First_Interp (Prefix (Lhs), PI, PIt);
294 while Present (PIt.Typ) loop
295 if Is_Access_Type (PIt.Typ)
296 and then Has_Compatible_Type
297 (Rhs, Designated_Type (PIt.Typ))
301 Disambiguate (Prefix (Lhs),
304 if PIt = No_Interp then
306 ("ambiguous left-hand side"
307 & " in assignment", Lhs);
310 Resolve (Prefix (Lhs), PIt.Typ);
320 Get_Next_Interp (PI, PIt);
326 ("ambiguous left-hand side in assignment", Lhs);
334 Get_Next_Interp (I, It);
338 if T1 = Any_Type then
340 ("no valid types for left-hand side for assignment", Lhs);
346 -- The resulting assignment type is T1, so now we will resolve the
347 -- left hand side of the assignment using this determined type.
351 -- Cases where Lhs is not a variable
353 if not Is_Variable (Lhs) then
355 -- Ada 2005 (AI-327): Check assignment to the attribute Priority of
356 -- a protected object.
363 if Ada_Version >= Ada_2005 then
365 -- Handle chains of renamings
368 while Nkind (Ent) in N_Has_Entity
369 and then Present (Entity (Ent))
370 and then Present (Renamed_Object (Entity (Ent)))
372 Ent := Renamed_Object (Entity (Ent));
375 if (Nkind (Ent) = N_Attribute_Reference
376 and then Attribute_Name (Ent) = Name_Priority)
378 -- Renamings of the attribute Priority applied to protected
379 -- objects have been previously expanded into calls to the
380 -- Get_Ceiling run-time subprogram.
383 (Nkind (Ent) = N_Function_Call
384 and then (Entity (Name (Ent)) = RTE (RE_Get_Ceiling)
386 Entity (Name (Ent)) = RTE (RO_PE_Get_Ceiling)))
388 -- The enclosing subprogram cannot be a protected function
391 while not (Is_Subprogram (S)
392 and then Convention (S) = Convention_Protected)
393 and then S /= Standard_Standard
398 if Ekind (S) = E_Function
399 and then Convention (S) = Convention_Protected
402 ("protected function cannot modify protected object",
406 -- Changes of the ceiling priority of the protected object
407 -- are only effective if the Ceiling_Locking policy is in
408 -- effect (AARM D.5.2 (5/2)).
410 if Locking_Policy /= 'C' then
411 Error_Msg_N ("assignment to the attribute PRIORITY has " &
413 Error_Msg_N ("\since no Locking_Policy has been " &
422 Diagnose_Non_Variable_Lhs (Lhs);
425 -- Error of assigning to limited type. We do however allow this in
426 -- certain cases where the front end generates the assignments.
428 elsif Is_Limited_Type (T1)
429 and then not Assignment_OK (Lhs)
430 and then not Assignment_OK (Original_Node (Lhs))
431 and then not Is_Value_Type (T1)
433 -- CPP constructors can only be called in declarations
435 if Is_CPP_Constructor_Call (Rhs) then
436 Error_Msg_N ("invalid use of 'C'P'P constructor", Rhs);
439 ("left hand of assignment must not be limited type", Lhs);
440 Explain_Limited_Type (T1, Lhs);
444 -- Enforce RM 3.9.3 (8): the target of an assignment operation cannot be
445 -- abstract. This is only checked when the assignment Comes_From_Source,
446 -- because in some cases the expander generates such assignments (such
447 -- in the _assign operation for an abstract type).
449 elsif Is_Abstract_Type (T1) and then Comes_From_Source (N) then
451 ("target of assignment operation must not be abstract", Lhs);
454 -- Resolution may have updated the subtype, in case the left-hand
455 -- side is a private protected component. Use the correct subtype
456 -- to avoid scoping issues in the back-end.
460 -- Ada 2005 (AI-50217, AI-326): Check wrong dereference of incomplete
461 -- type. For example:
465 -- type Acc is access P.T;
468 -- with Pkg; use Acc;
469 -- procedure Example is
472 -- A.all := B.all; -- ERROR
475 if Nkind (Lhs) = N_Explicit_Dereference
476 and then Ekind (T1) = E_Incomplete_Type
478 Error_Msg_N ("invalid use of incomplete type", Lhs);
483 -- Now we can complete the resolution of the right hand side
485 Set_Assignment_Type (Lhs, T1);
488 -- This is the point at which we check for an unset reference
490 Check_Unset_Reference (Rhs);
491 Check_Unprotected_Access (Lhs, Rhs);
493 -- Remaining steps are skipped if Rhs was syntactically in error
502 if not Covers (T1, T2) then
503 Wrong_Type (Rhs, Etype (Lhs));
508 -- Ada 2005 (AI-326): In case of explicit dereference of incomplete
509 -- types, use the non-limited view if available
511 if Nkind (Rhs) = N_Explicit_Dereference
512 and then Ekind (T2) = E_Incomplete_Type
513 and then Is_Tagged_Type (T2)
514 and then Present (Non_Limited_View (T2))
516 T2 := Non_Limited_View (T2);
519 Set_Assignment_Type (Rhs, T2);
521 if Total_Errors_Detected /= 0 then
531 if T1 = Any_Type or else T2 = Any_Type then
536 -- If the rhs is class-wide or dynamically tagged, then require the lhs
537 -- to be class-wide. The case where the rhs is a dynamically tagged call
538 -- to a dispatching operation with a controlling access result is
539 -- excluded from this check, since the target has an access type (and
540 -- no tag propagation occurs in that case).
542 if (Is_Class_Wide_Type (T2)
543 or else (Is_Dynamically_Tagged (Rhs)
544 and then not Is_Access_Type (T1)))
545 and then not Is_Class_Wide_Type (T1)
547 Error_Msg_N ("dynamically tagged expression not allowed!", Rhs);
549 elsif Is_Class_Wide_Type (T1)
550 and then not Is_Class_Wide_Type (T2)
551 and then not Is_Tag_Indeterminate (Rhs)
552 and then not Is_Dynamically_Tagged (Rhs)
554 Error_Msg_N ("dynamically tagged expression required!", Rhs);
557 -- Propagate the tag from a class-wide target to the rhs when the rhs
558 -- is a tag-indeterminate call.
560 if Is_Tag_Indeterminate (Rhs) then
561 if Is_Class_Wide_Type (T1) then
562 Propagate_Tag (Lhs, Rhs);
564 elsif Nkind (Rhs) = N_Function_Call
565 and then Is_Entity_Name (Name (Rhs))
566 and then Is_Abstract_Subprogram (Entity (Name (Rhs)))
569 ("call to abstract function must be dispatching", Name (Rhs));
571 elsif Nkind (Rhs) = N_Qualified_Expression
572 and then Nkind (Expression (Rhs)) = N_Function_Call
573 and then Is_Entity_Name (Name (Expression (Rhs)))
575 Is_Abstract_Subprogram (Entity (Name (Expression (Rhs))))
578 ("call to abstract function must be dispatching",
579 Name (Expression (Rhs)));
583 -- Ada 2005 (AI-385): When the lhs type is an anonymous access type,
584 -- apply an implicit conversion of the rhs to that type to force
585 -- appropriate static and run-time accessibility checks. This applies
586 -- as well to anonymous access-to-subprogram types that are component
587 -- subtypes or formal parameters.
589 if Ada_Version >= Ada_2005
590 and then Is_Access_Type (T1)
592 if Is_Local_Anonymous_Access (T1)
593 or else Ekind (T2) = E_Anonymous_Access_Subprogram_Type
595 Rewrite (Rhs, Convert_To (T1, Relocate_Node (Rhs)));
596 Analyze_And_Resolve (Rhs, T1);
600 -- Ada 2005 (AI-231): Assignment to not null variable
602 if Ada_Version >= Ada_2005
603 and then Can_Never_Be_Null (T1)
604 and then not Assignment_OK (Lhs)
606 -- Case where we know the right hand side is null
608 if Known_Null (Rhs) then
609 Apply_Compile_Time_Constraint_Error
611 Msg => "(Ada 2005) null not allowed in null-excluding objects?",
612 Reason => CE_Null_Not_Allowed);
614 -- We still mark this as a possible modification, that's necessary
615 -- to reset Is_True_Constant, and desirable for xref purposes.
617 Note_Possible_Modification (Lhs, Sure => True);
620 -- If we know the right hand side is non-null, then we convert to the
621 -- target type, since we don't need a run time check in that case.
623 elsif not Can_Never_Be_Null (T2) then
624 Rewrite (Rhs, Convert_To (T1, Relocate_Node (Rhs)));
625 Analyze_And_Resolve (Rhs, T1);
629 if Is_Scalar_Type (T1) then
630 Apply_Scalar_Range_Check (Rhs, Etype (Lhs));
632 -- For array types, verify that lengths match. If the right hand side
633 -- if a function call that has been inlined, the assignment has been
634 -- rewritten as a block, and the constraint check will be applied to the
635 -- assignment within the block.
637 elsif Is_Array_Type (T1)
639 (Nkind (Rhs) /= N_Type_Conversion
640 or else Is_Constrained (Etype (Rhs)))
642 (Nkind (Rhs) /= N_Function_Call
643 or else Nkind (N) /= N_Block_Statement)
645 -- Assignment verifies that the length of the Lsh and Rhs are equal,
646 -- but of course the indexes do not have to match. If the right-hand
647 -- side is a type conversion to an unconstrained type, a length check
648 -- is performed on the expression itself during expansion. In rare
649 -- cases, the redundant length check is computed on an index type
650 -- with a different representation, triggering incorrect code in
653 Apply_Length_Check (Rhs, Etype (Lhs));
656 -- Discriminant checks are applied in the course of expansion
661 -- Note: modifications of the Lhs may only be recorded after
662 -- checks have been applied.
664 Note_Possible_Modification (Lhs, Sure => True);
665 Check_Order_Dependence;
667 -- ??? a real accessibility check is needed when ???
669 -- Post warning for redundant assignment or variable to itself
671 if Warn_On_Redundant_Constructs
673 -- We only warn for source constructs
675 and then Comes_From_Source (N)
677 -- Where the object is the same on both sides
679 and then Same_Object (Lhs, Original_Node (Rhs))
681 -- But exclude the case where the right side was an operation
682 -- that got rewritten (e.g. JUNK + K, where K was known to be
683 -- zero). We don't want to warn in such a case, since it is
684 -- reasonable to write such expressions especially when K is
685 -- defined symbolically in some other package.
687 and then Nkind (Original_Node (Rhs)) not in N_Op
689 if Nkind (Lhs) in N_Has_Entity then
690 Error_Msg_NE -- CODEFIX
691 ("?useless assignment of & to itself!", N, Entity (Lhs));
693 Error_Msg_N -- CODEFIX
694 ("?useless assignment of object to itself!", N);
698 -- Check for non-allowed composite assignment
700 if not Support_Composite_Assign_On_Target
701 and then (Is_Array_Type (T1) or else Is_Record_Type (T1))
702 and then (not Has_Size_Clause (T1) or else Esize (T1) > 64)
704 Error_Msg_CRT ("composite assignment", N);
707 -- Check elaboration warning for left side if not in elab code
709 if not In_Subprogram_Or_Concurrent_Unit then
710 Check_Elab_Assign (Lhs);
713 -- Set Referenced_As_LHS if appropriate. We only set this flag if the
714 -- assignment is a source assignment in the extended main source unit.
715 -- We are not interested in any reference information outside this
716 -- context, or in compiler generated assignment statements.
718 if Comes_From_Source (N)
719 and then In_Extended_Main_Source_Unit (Lhs)
721 Set_Referenced_Modified (Lhs, Out_Param => False);
724 -- Final step. If left side is an entity, then we may be able to
725 -- reset the current tracked values to new safe values. We only have
726 -- something to do if the left side is an entity name, and expansion
727 -- has not modified the node into something other than an assignment,
728 -- and of course we only capture values if it is safe to do so.
730 if Is_Entity_Name (Lhs)
731 and then Nkind (N) = N_Assignment_Statement
734 Ent : constant Entity_Id := Entity (Lhs);
737 if Safe_To_Capture_Value (N, Ent) then
739 -- If simple variable on left side, warn if this assignment
740 -- blots out another one (rendering it useless) and note
741 -- location of assignment in case no one references value.
742 -- We only do this for source assignments, otherwise we can
743 -- generate bogus warnings when an assignment is rewritten as
744 -- another assignment, and gets tied up with itself.
746 -- Note: we don't use Record_Last_Assignment here, because we
747 -- have lots of other stuff to do under control of this test.
749 if Warn_On_Modified_Unread
750 and then Is_Assignable (Ent)
751 and then Comes_From_Source (N)
752 and then In_Extended_Main_Source_Unit (Ent)
754 Warn_On_Useless_Assignment (Ent, N);
755 Set_Last_Assignment (Ent, Lhs);
758 -- If we are assigning an access type and the left side is an
759 -- entity, then make sure that the Is_Known_[Non_]Null flags
760 -- properly reflect the state of the entity after assignment.
762 if Is_Access_Type (T1) then
763 if Known_Non_Null (Rhs) then
764 Set_Is_Known_Non_Null (Ent, True);
766 elsif Known_Null (Rhs)
767 and then not Can_Never_Be_Null (Ent)
769 Set_Is_Known_Null (Ent, True);
772 Set_Is_Known_Null (Ent, False);
774 if not Can_Never_Be_Null (Ent) then
775 Set_Is_Known_Non_Null (Ent, False);
779 -- For discrete types, we may be able to set the current value
780 -- if the value is known at compile time.
782 elsif Is_Discrete_Type (T1)
783 and then Compile_Time_Known_Value (Rhs)
785 Set_Current_Value (Ent, Rhs);
787 Set_Current_Value (Ent, Empty);
790 -- If not safe to capture values, kill them
797 end Analyze_Assignment;
799 -----------------------------
800 -- Analyze_Block_Statement --
801 -----------------------------
803 procedure Analyze_Block_Statement (N : Node_Id) is
804 Decls : constant List_Id := Declarations (N);
805 Id : constant Node_Id := Identifier (N);
806 HSS : constant Node_Id := Handled_Statement_Sequence (N);
809 -- Block statement is not allowed in SPARK or ALFA
811 if Formal_Verification_Mode
812 and then Comes_From_Source (N)
814 Error_Msg_F ("|~~block statement is not allowed", N);
817 -- If no handled statement sequence is present, things are really
818 -- messed up, and we just return immediately (this is a defence
819 -- against previous errors).
825 -- Normal processing with HSS present
828 EH : constant List_Id := Exception_Handlers (HSS);
829 Ent : Entity_Id := Empty;
832 Save_Unblocked_Exit_Count : constant Nat := Unblocked_Exit_Count;
833 -- Recursively save value of this global, will be restored on exit
836 -- Initialize unblocked exit count for statements of begin block
837 -- plus one for each exception handler that is present.
839 Unblocked_Exit_Count := 1;
842 Unblocked_Exit_Count := Unblocked_Exit_Count + List_Length (EH);
845 -- If a label is present analyze it and mark it as referenced
851 -- An error defense. If we have an identifier, but no entity,
852 -- then something is wrong. If we have previous errors, then
853 -- just remove the identifier and continue, otherwise raise
857 if Total_Errors_Detected /= 0 then
858 Set_Identifier (N, Empty);
864 Set_Ekind (Ent, E_Block);
865 Generate_Reference (Ent, N, ' ');
866 Generate_Definition (Ent);
868 if Nkind (Parent (Ent)) = N_Implicit_Label_Declaration then
869 Set_Label_Construct (Parent (Ent), N);
874 -- If no entity set, create a label entity
877 Ent := New_Internal_Entity (E_Block, Current_Scope, Sloc (N), 'B');
878 Set_Identifier (N, New_Occurrence_Of (Ent, Sloc (N)));
882 Set_Etype (Ent, Standard_Void_Type);
883 Set_Block_Node (Ent, Identifier (N));
886 if Present (Decls) then
887 Analyze_Declarations (Decls);
889 Inspect_Deferred_Constant_Completion (Decls);
893 Process_End_Label (HSS, 'e', Ent);
895 -- If exception handlers are present, then we indicate that
896 -- enclosing scopes contain a block with handlers. We only
897 -- need to mark non-generic scopes.
902 Set_Has_Nested_Block_With_Handler (S);
903 exit when Is_Overloadable (S)
904 or else Ekind (S) = E_Package
905 or else Is_Generic_Unit (S);
910 Check_References (Ent);
911 Warn_On_Useless_Assignments (Ent);
914 if Unblocked_Exit_Count = 0 then
915 Unblocked_Exit_Count := Save_Unblocked_Exit_Count;
916 Check_Unreachable_Code (N);
918 Unblocked_Exit_Count := Save_Unblocked_Exit_Count;
921 end Analyze_Block_Statement;
923 ----------------------------
924 -- Analyze_Case_Statement --
925 ----------------------------
927 procedure Analyze_Case_Statement (N : Node_Id) is
929 Exp_Type : Entity_Id;
930 Exp_Btype : Entity_Id;
933 Others_Present : Boolean;
935 pragma Warnings (Off, Last_Choice);
936 pragma Warnings (Off, Dont_Care);
937 -- Don't care about assigned values
939 Statements_Analyzed : Boolean := False;
940 -- Set True if at least some statement sequences get analyzed.
941 -- If False on exit, means we had a serious error that prevented
942 -- full analysis of the case statement, and as a result it is not
943 -- a good idea to output warning messages about unreachable code.
945 Save_Unblocked_Exit_Count : constant Nat := Unblocked_Exit_Count;
946 -- Recursively save value of this global, will be restored on exit
948 procedure Non_Static_Choice_Error (Choice : Node_Id);
949 -- Error routine invoked by the generic instantiation below when
950 -- the case statement has a non static choice.
952 procedure Process_Statements (Alternative : Node_Id);
953 -- Analyzes all the statements associated with a case alternative.
954 -- Needed by the generic instantiation below.
956 package Case_Choices_Processing is new
957 Generic_Choices_Processing
958 (Get_Alternatives => Alternatives,
959 Get_Choices => Discrete_Choices,
960 Process_Empty_Choice => No_OP,
961 Process_Non_Static_Choice => Non_Static_Choice_Error,
962 Process_Associated_Node => Process_Statements);
963 use Case_Choices_Processing;
964 -- Instantiation of the generic choice processing package
966 -----------------------------
967 -- Non_Static_Choice_Error --
968 -----------------------------
970 procedure Non_Static_Choice_Error (Choice : Node_Id) is
973 ("choice given in case statement is not static!", Choice);
974 end Non_Static_Choice_Error;
976 ------------------------
977 -- Process_Statements --
978 ------------------------
980 procedure Process_Statements (Alternative : Node_Id) is
981 Choices : constant List_Id := Discrete_Choices (Alternative);
985 Unblocked_Exit_Count := Unblocked_Exit_Count + 1;
986 Statements_Analyzed := True;
988 -- An interesting optimization. If the case statement expression
989 -- is a simple entity, then we can set the current value within
990 -- an alternative if the alternative has one possible value.
994 -- when 2 | 3 => beta
995 -- when others => gamma
997 -- Here we know that N is initially 1 within alpha, but for beta
998 -- and gamma, we do not know anything more about the initial value.
1000 if Is_Entity_Name (Exp) then
1001 Ent := Entity (Exp);
1003 if Ekind_In (Ent, E_Variable,
1007 if List_Length (Choices) = 1
1008 and then Nkind (First (Choices)) in N_Subexpr
1009 and then Compile_Time_Known_Value (First (Choices))
1011 Set_Current_Value (Entity (Exp), First (Choices));
1014 Analyze_Statements (Statements (Alternative));
1016 -- After analyzing the case, set the current value to empty
1017 -- since we won't know what it is for the next alternative
1018 -- (unless reset by this same circuit), or after the case.
1020 Set_Current_Value (Entity (Exp), Empty);
1025 -- Case where expression is not an entity name of a variable
1027 Analyze_Statements (Statements (Alternative));
1028 end Process_Statements;
1030 -- Start of processing for Analyze_Case_Statement
1033 Unblocked_Exit_Count := 0;
1034 Exp := Expression (N);
1037 -- The expression must be of any discrete type. In rare cases, the
1038 -- expander constructs a case statement whose expression has a private
1039 -- type whose full view is discrete. This can happen when generating
1040 -- a stream operation for a variant type after the type is frozen,
1041 -- when the partial of view of the type of the discriminant is private.
1042 -- In that case, use the full view to analyze case alternatives.
1044 if not Is_Overloaded (Exp)
1045 and then not Comes_From_Source (N)
1046 and then Is_Private_Type (Etype (Exp))
1047 and then Present (Full_View (Etype (Exp)))
1048 and then Is_Discrete_Type (Full_View (Etype (Exp)))
1050 Resolve (Exp, Etype (Exp));
1051 Exp_Type := Full_View (Etype (Exp));
1054 Analyze_And_Resolve (Exp, Any_Discrete);
1055 Exp_Type := Etype (Exp);
1058 Check_Unset_Reference (Exp);
1059 Exp_Btype := Base_Type (Exp_Type);
1061 -- The expression must be of a discrete type which must be determinable
1062 -- independently of the context in which the expression occurs, but
1063 -- using the fact that the expression must be of a discrete type.
1064 -- Moreover, the type this expression must not be a character literal
1065 -- (which is always ambiguous) or, for Ada-83, a generic formal type.
1067 -- If error already reported by Resolve, nothing more to do
1069 if Exp_Btype = Any_Discrete
1070 or else Exp_Btype = Any_Type
1074 elsif Exp_Btype = Any_Character then
1076 ("character literal as case expression is ambiguous", Exp);
1079 elsif Ada_Version = Ada_83
1080 and then (Is_Generic_Type (Exp_Btype)
1081 or else Is_Generic_Type (Root_Type (Exp_Btype)))
1084 ("(Ada 83) case expression cannot be of a generic type", Exp);
1088 -- If the case expression is a formal object of mode in out, then
1089 -- treat it as having a nonstatic subtype by forcing use of the base
1090 -- type (which has to get passed to Check_Case_Choices below). Also
1091 -- use base type when the case expression is parenthesized.
1093 if Paren_Count (Exp) > 0
1094 or else (Is_Entity_Name (Exp)
1095 and then Ekind (Entity (Exp)) = E_Generic_In_Out_Parameter)
1097 Exp_Type := Exp_Btype;
1100 -- Call instantiated Analyze_Choices which does the rest of the work
1102 Analyze_Choices (N, Exp_Type, Dont_Care, Others_Present);
1104 -- A case statement with a single "others" alternative is not allowed
1105 -- in SPARK or ALFA.
1107 if Formal_Verification_Mode
1108 and then Others_Present
1109 and then List_Length (Alternatives (N)) = 1
1112 ("|~~OTHERS as unique case alternative is not allowed", N);
1115 if Exp_Type = Universal_Integer and then not Others_Present then
1116 Error_Msg_N ("case on universal integer requires OTHERS choice", Exp);
1119 -- If all our exits were blocked by unconditional transfers of control,
1120 -- then the entire CASE statement acts as an unconditional transfer of
1121 -- control, so treat it like one, and check unreachable code. Skip this
1122 -- test if we had serious errors preventing any statement analysis.
1124 if Unblocked_Exit_Count = 0 and then Statements_Analyzed then
1125 Unblocked_Exit_Count := Save_Unblocked_Exit_Count;
1126 Check_Unreachable_Code (N);
1128 Unblocked_Exit_Count := Save_Unblocked_Exit_Count;
1131 if not Expander_Active
1132 and then Compile_Time_Known_Value (Expression (N))
1133 and then Serious_Errors_Detected = 0
1136 Chosen : constant Node_Id := Find_Static_Alternative (N);
1140 Alt := First (Alternatives (N));
1141 while Present (Alt) loop
1142 if Alt /= Chosen then
1143 Remove_Warning_Messages (Statements (Alt));
1150 end Analyze_Case_Statement;
1152 ----------------------------
1153 -- Analyze_Exit_Statement --
1154 ----------------------------
1156 -- If the exit includes a name, it must be the name of a currently open
1157 -- loop. Otherwise there must be an innermost open loop on the stack,
1158 -- to which the statement implicitly refers.
1160 -- Additionally, in formal mode:
1161 -- * the exit can only name the closest enclosing loop;
1162 -- * an exit with a when clause must be directly contained in a loop;
1163 -- * an exit without a when clause must be directly contained in an
1164 -- if-statement with no elsif or else, which is itself directly contained
1165 -- in a loop. The exit must be the last statement in the if-statement.
1167 procedure Analyze_Exit_Statement (N : Node_Id) is
1168 Target : constant Node_Id := Name (N);
1169 Cond : constant Node_Id := Condition (N);
1170 Scope_Id : Entity_Id;
1176 Check_Unreachable_Code (N);
1179 if Present (Target) then
1181 U_Name := Entity (Target);
1183 if not In_Open_Scopes (U_Name) or else Ekind (U_Name) /= E_Loop then
1184 Error_Msg_N ("invalid loop name in exit statement", N);
1186 elsif Formal_Verification_Mode
1187 and then Has_Loop_In_Inner_Open_Scopes (U_Name)
1190 ("|~~exit label must name the closest enclosing loop", N);
1193 Set_Has_Exit (U_Name);
1200 for J in reverse 0 .. Scope_Stack.Last loop
1201 Scope_Id := Scope_Stack.Table (J).Entity;
1202 Kind := Ekind (Scope_Id);
1205 and then (No (Target) or else Scope_Id = U_Name) then
1206 Set_Has_Exit (Scope_Id);
1209 elsif Kind = E_Block
1210 or else Kind = E_Loop
1211 or else Kind = E_Return_Statement
1217 ("cannot exit from program unit or accept statement", N);
1222 -- Verify that if present the condition is a Boolean expression
1224 if Present (Cond) then
1225 Analyze_And_Resolve (Cond, Any_Boolean);
1226 Check_Unset_Reference (Cond);
1229 -- In formal mode, verify that the exit statement respects the SPARK
1232 if Formal_Verification_Mode then
1233 if Present (Cond) then
1234 if Nkind (Parent (N)) /= N_Loop_Statement then
1236 ("|~~exit with when clause must be directly in loop", N);
1240 if Nkind (Parent (N)) /= N_If_Statement then
1241 if Nkind (Parent (N)) = N_Elsif_Part then
1242 Error_Msg_F ("|~~exit must be in IF without ELSIF", N);
1244 Error_Msg_F ("|~~exit must be directly in IF", N);
1247 elsif Nkind (Parent (Parent (N))) /= N_Loop_Statement then
1248 Error_Msg_F ("|~~exit must be in IF directly in loop", N);
1250 -- First test the presence of ELSE, so that an exit in an ELSE
1251 -- leads to an error mentioning the ELSE.
1253 elsif Present (Else_Statements (Parent (N))) then
1254 Error_Msg_F ("|~~exit must be in IF without ELSE", N);
1256 -- An exit in an ELSIF does not reach here, as it would have been
1257 -- detected in the case (Nkind (Parent (N)) /= N_If_Statement).
1259 elsif Present (Elsif_Parts (Parent (N))) then
1260 Error_Msg_F ("|~~exit must be in IF without ELSIF", N);
1265 -- Chain exit statement to associated loop entity
1267 Set_Next_Exit_Statement (N, First_Exit_Statement (Scope_Id));
1268 Set_First_Exit_Statement (Scope_Id, N);
1270 -- Since the exit may take us out of a loop, any previous assignment
1271 -- statement is not useless, so clear last assignment indications. It
1272 -- is OK to keep other current values, since if the exit statement
1273 -- does not exit, then the current values are still valid.
1275 Kill_Current_Values (Last_Assignment_Only => True);
1276 end Analyze_Exit_Statement;
1278 ----------------------------
1279 -- Analyze_Goto_Statement --
1280 ----------------------------
1282 procedure Analyze_Goto_Statement (N : Node_Id) is
1283 Label : constant Node_Id := Name (N);
1284 Scope_Id : Entity_Id;
1285 Label_Scope : Entity_Id;
1286 Label_Ent : Entity_Id;
1289 -- Goto statement is not allowed in SPARK or ALFA
1291 if Formal_Verification_Mode then
1292 Error_Msg_F ("|~~goto statement is not allowed", N);
1295 -- Actual semantic checks
1297 Check_Unreachable_Code (N);
1298 Kill_Current_Values (Last_Assignment_Only => True);
1301 Label_Ent := Entity (Label);
1303 -- Ignore previous error
1305 if Label_Ent = Any_Id then
1308 -- We just have a label as the target of a goto
1310 elsif Ekind (Label_Ent) /= E_Label then
1311 Error_Msg_N ("target of goto statement must be a label", Label);
1314 -- Check that the target of the goto is reachable according to Ada
1315 -- scoping rules. Note: the special gotos we generate for optimizing
1316 -- local handling of exceptions would violate these rules, but we mark
1317 -- such gotos as analyzed when built, so this code is never entered.
1319 elsif not Reachable (Label_Ent) then
1320 Error_Msg_N ("target of goto statement is not reachable", Label);
1324 -- Here if goto passes initial validity checks
1326 Label_Scope := Enclosing_Scope (Label_Ent);
1328 for J in reverse 0 .. Scope_Stack.Last loop
1329 Scope_Id := Scope_Stack.Table (J).Entity;
1331 if Label_Scope = Scope_Id
1332 or else (Ekind (Scope_Id) /= E_Block
1333 and then Ekind (Scope_Id) /= E_Loop
1334 and then Ekind (Scope_Id) /= E_Return_Statement)
1336 if Scope_Id /= Label_Scope then
1338 ("cannot exit from program unit or accept statement", N);
1345 raise Program_Error;
1346 end Analyze_Goto_Statement;
1348 --------------------------
1349 -- Analyze_If_Statement --
1350 --------------------------
1352 -- A special complication arises in the analysis of if statements
1354 -- The expander has circuitry to completely delete code that it
1355 -- can tell will not be executed (as a result of compile time known
1356 -- conditions). In the analyzer, we ensure that code that will be
1357 -- deleted in this manner is analyzed but not expanded. This is
1358 -- obviously more efficient, but more significantly, difficulties
1359 -- arise if code is expanded and then eliminated (e.g. exception
1360 -- table entries disappear). Similarly, itypes generated in deleted
1361 -- code must be frozen from start, because the nodes on which they
1362 -- depend will not be available at the freeze point.
1364 procedure Analyze_If_Statement (N : Node_Id) is
1367 Save_Unblocked_Exit_Count : constant Nat := Unblocked_Exit_Count;
1368 -- Recursively save value of this global, will be restored on exit
1370 Save_In_Deleted_Code : Boolean;
1372 Del : Boolean := False;
1373 -- This flag gets set True if a True condition has been found,
1374 -- which means that remaining ELSE/ELSIF parts are deleted.
1376 procedure Analyze_Cond_Then (Cnode : Node_Id);
1377 -- This is applied to either the N_If_Statement node itself or
1378 -- to an N_Elsif_Part node. It deals with analyzing the condition
1379 -- and the THEN statements associated with it.
1381 -----------------------
1382 -- Analyze_Cond_Then --
1383 -----------------------
1385 procedure Analyze_Cond_Then (Cnode : Node_Id) is
1386 Cond : constant Node_Id := Condition (Cnode);
1387 Tstm : constant List_Id := Then_Statements (Cnode);
1390 Unblocked_Exit_Count := Unblocked_Exit_Count + 1;
1391 Analyze_And_Resolve (Cond, Any_Boolean);
1392 Check_Unset_Reference (Cond);
1393 Set_Current_Value_Condition (Cnode);
1395 -- If already deleting, then just analyze then statements
1398 Analyze_Statements (Tstm);
1400 -- Compile time known value, not deleting yet
1402 elsif Compile_Time_Known_Value (Cond) then
1403 Save_In_Deleted_Code := In_Deleted_Code;
1405 -- If condition is True, then analyze the THEN statements
1406 -- and set no expansion for ELSE and ELSIF parts.
1408 if Is_True (Expr_Value (Cond)) then
1409 Analyze_Statements (Tstm);
1411 Expander_Mode_Save_And_Set (False);
1412 In_Deleted_Code := True;
1414 -- If condition is False, analyze THEN with expansion off
1416 else -- Is_False (Expr_Value (Cond))
1417 Expander_Mode_Save_And_Set (False);
1418 In_Deleted_Code := True;
1419 Analyze_Statements (Tstm);
1420 Expander_Mode_Restore;
1421 In_Deleted_Code := Save_In_Deleted_Code;
1424 -- Not known at compile time, not deleting, normal analysis
1427 Analyze_Statements (Tstm);
1429 end Analyze_Cond_Then;
1431 -- Start of Analyze_If_Statement
1434 -- Initialize exit count for else statements. If there is no else
1435 -- part, this count will stay non-zero reflecting the fact that the
1436 -- uncovered else case is an unblocked exit.
1438 Unblocked_Exit_Count := 1;
1439 Analyze_Cond_Then (N);
1441 -- Now to analyze the elsif parts if any are present
1443 if Present (Elsif_Parts (N)) then
1444 E := First (Elsif_Parts (N));
1445 while Present (E) loop
1446 Analyze_Cond_Then (E);
1451 if Present (Else_Statements (N)) then
1452 Analyze_Statements (Else_Statements (N));
1455 -- If all our exits were blocked by unconditional transfers of control,
1456 -- then the entire IF statement acts as an unconditional transfer of
1457 -- control, so treat it like one, and check unreachable code.
1459 if Unblocked_Exit_Count = 0 then
1460 Unblocked_Exit_Count := Save_Unblocked_Exit_Count;
1461 Check_Unreachable_Code (N);
1463 Unblocked_Exit_Count := Save_Unblocked_Exit_Count;
1467 Expander_Mode_Restore;
1468 In_Deleted_Code := Save_In_Deleted_Code;
1471 if not Expander_Active
1472 and then Compile_Time_Known_Value (Condition (N))
1473 and then Serious_Errors_Detected = 0
1475 if Is_True (Expr_Value (Condition (N))) then
1476 Remove_Warning_Messages (Else_Statements (N));
1478 if Present (Elsif_Parts (N)) then
1479 E := First (Elsif_Parts (N));
1480 while Present (E) loop
1481 Remove_Warning_Messages (Then_Statements (E));
1487 Remove_Warning_Messages (Then_Statements (N));
1490 end Analyze_If_Statement;
1492 ----------------------------------------
1493 -- Analyze_Implicit_Label_Declaration --
1494 ----------------------------------------
1496 -- An implicit label declaration is generated in the innermost
1497 -- enclosing declarative part. This is done for labels as well as
1498 -- block and loop names.
1500 -- Note: any changes in this routine may need to be reflected in
1501 -- Analyze_Label_Entity.
1503 procedure Analyze_Implicit_Label_Declaration (N : Node_Id) is
1504 Id : constant Node_Id := Defining_Identifier (N);
1507 Set_Ekind (Id, E_Label);
1508 Set_Etype (Id, Standard_Void_Type);
1509 Set_Enclosing_Scope (Id, Current_Scope);
1510 end Analyze_Implicit_Label_Declaration;
1512 ------------------------------
1513 -- Analyze_Iteration_Scheme --
1514 ------------------------------
1516 procedure Analyze_Iteration_Scheme (N : Node_Id) is
1518 procedure Process_Bounds (R : Node_Id);
1519 -- If the iteration is given by a range, create temporaries and
1520 -- assignment statements block to capture the bounds and perform
1521 -- required finalization actions in case a bound includes a function
1522 -- call that uses the temporary stack. We first pre-analyze a copy of
1523 -- the range in order to determine the expected type, and analyze and
1524 -- resolve the original bounds.
1526 procedure Check_Controlled_Array_Attribute (DS : Node_Id);
1527 -- If the bounds are given by a 'Range reference on a function call
1528 -- that returns a controlled array, introduce an explicit declaration
1529 -- to capture the bounds, so that the function result can be finalized
1530 -- in timely fashion.
1532 --------------------
1533 -- Process_Bounds --
1534 --------------------
1536 procedure Process_Bounds (R : Node_Id) is
1537 Loc : constant Source_Ptr := Sloc (N);
1538 R_Copy : constant Node_Id := New_Copy_Tree (R);
1539 Lo : constant Node_Id := Low_Bound (R);
1540 Hi : constant Node_Id := High_Bound (R);
1541 New_Lo_Bound : Node_Id;
1542 New_Hi_Bound : Node_Id;
1544 Save_Analysis : Boolean;
1547 (Original_Bound : Node_Id;
1548 Analyzed_Bound : Node_Id) return Node_Id;
1549 -- Capture value of bound and return captured value
1556 (Original_Bound : Node_Id;
1557 Analyzed_Bound : Node_Id) return Node_Id
1564 -- If the bound is a constant or an object, no need for a separate
1565 -- declaration. If the bound is the result of previous expansion
1566 -- it is already analyzed and should not be modified. Note that
1567 -- the Bound will be resolved later, if needed, as part of the
1568 -- call to Make_Index (literal bounds may need to be resolved to
1571 if Analyzed (Original_Bound) then
1572 return Original_Bound;
1574 elsif Nkind_In (Analyzed_Bound, N_Integer_Literal,
1575 N_Character_Literal)
1576 or else Is_Entity_Name (Analyzed_Bound)
1578 Analyze_And_Resolve (Original_Bound, Typ);
1579 return Original_Bound;
1582 -- Here we need to capture the value
1584 Analyze_And_Resolve (Original_Bound, Typ);
1586 Id := Make_Temporary (Loc, 'S', Original_Bound);
1588 -- Normally, the best approach is simply to generate a constant
1589 -- declaration that captures the bound. However, there is a nasty
1590 -- case where this is wrong. If the bound is complex, and has a
1591 -- possible use of the secondary stack, we need to generate a
1592 -- separate assignment statement to ensure the creation of a block
1593 -- which will release the secondary stack.
1595 -- We prefer the constant declaration, since it leaves us with a
1596 -- proper trace of the value, useful in optimizations that get rid
1597 -- of junk range checks.
1599 -- Probably we want something like the Side_Effect_Free routine
1600 -- in Exp_Util, but for now, we just optimize the cases of 'Last
1601 -- and 'First applied to an entity, since these are the important
1602 -- cases for range check optimizations.
1604 if Nkind (Original_Bound) = N_Attribute_Reference
1605 and then (Attribute_Name (Original_Bound) = Name_First
1607 Attribute_Name (Original_Bound) = Name_Last)
1608 and then Is_Entity_Name (Prefix (Original_Bound))
1611 Make_Object_Declaration (Loc,
1612 Defining_Identifier => Id,
1613 Constant_Present => True,
1614 Object_Definition => New_Occurrence_Of (Typ, Loc),
1615 Expression => Relocate_Node (Original_Bound));
1617 -- Insert declaration at proper place. If loop comes from an
1618 -- enclosing quantified expression, the insertion point is
1619 -- arbitrarily far up in the tree.
1621 Insert_Action (Parent (N), Decl);
1622 Rewrite (Original_Bound, New_Occurrence_Of (Id, Loc));
1623 return Expression (Decl);
1626 -- Here we make a declaration with a separate assignment
1627 -- statement, and insert before loop header.
1630 Make_Object_Declaration (Loc,
1631 Defining_Identifier => Id,
1632 Object_Definition => New_Occurrence_Of (Typ, Loc));
1635 Make_Assignment_Statement (Loc,
1636 Name => New_Occurrence_Of (Id, Loc),
1637 Expression => Relocate_Node (Original_Bound));
1639 Insert_Actions (Parent (N), New_List (Decl, Assign));
1641 Rewrite (Original_Bound, New_Occurrence_Of (Id, Loc));
1643 if Nkind (Assign) = N_Assignment_Statement then
1644 return Expression (Assign);
1646 return Original_Bound;
1650 -- Start of processing for Process_Bounds
1653 -- Determine expected type of range by analyzing separate copy
1654 -- Do the analysis and resolution of the copy of the bounds with
1655 -- expansion disabled, to prevent the generation of finalization
1656 -- actions on each bound. This prevents memory leaks when the
1657 -- bounds contain calls to functions returning controlled arrays.
1659 Set_Parent (R_Copy, Parent (R));
1660 Save_Analysis := Full_Analysis;
1661 Full_Analysis := False;
1662 Expander_Mode_Save_And_Set (False);
1666 if Is_Overloaded (R_Copy) then
1668 -- Apply preference rules for range of predefined integer types,
1669 -- or diagnose true ambiguity.
1674 Found : Entity_Id := Empty;
1677 Get_First_Interp (R_Copy, I, It);
1678 while Present (It.Typ) loop
1679 if Is_Discrete_Type (It.Typ) then
1683 if Scope (Found) = Standard_Standard then
1686 elsif Scope (It.Typ) = Standard_Standard then
1690 -- Both of them are user-defined
1693 ("ambiguous bounds in range of iteration",
1695 Error_Msg_N ("\possible interpretations:", R_Copy);
1696 Error_Msg_NE ("\\} ", R_Copy, Found);
1697 Error_Msg_NE ("\\} ", R_Copy, It.Typ);
1703 Get_Next_Interp (I, It);
1709 Expander_Mode_Restore;
1710 Full_Analysis := Save_Analysis;
1712 Typ := Etype (R_Copy);
1714 -- If the type of the discrete range is Universal_Integer, then
1715 -- the bound's type must be resolved to Integer, and any object
1716 -- used to hold the bound must also have type Integer, unless the
1717 -- literal bounds are constant-folded expressions that carry a user-
1720 if Typ = Universal_Integer then
1721 if Nkind (Lo) = N_Integer_Literal
1722 and then Present (Etype (Lo))
1723 and then Scope (Etype (Lo)) /= Standard_Standard
1727 elsif Nkind (Hi) = N_Integer_Literal
1728 and then Present (Etype (Hi))
1729 and then Scope (Etype (Hi)) /= Standard_Standard
1734 Typ := Standard_Integer;
1740 New_Lo_Bound := One_Bound (Lo, Low_Bound (R_Copy));
1741 New_Hi_Bound := One_Bound (Hi, High_Bound (R_Copy));
1743 -- Propagate staticness to loop range itself, in case the
1744 -- corresponding subtype is static.
1746 if New_Lo_Bound /= Lo
1747 and then Is_Static_Expression (New_Lo_Bound)
1749 Rewrite (Low_Bound (R), New_Copy (New_Lo_Bound));
1752 if New_Hi_Bound /= Hi
1753 and then Is_Static_Expression (New_Hi_Bound)
1755 Rewrite (High_Bound (R), New_Copy (New_Hi_Bound));
1759 --------------------------------------
1760 -- Check_Controlled_Array_Attribute --
1761 --------------------------------------
1763 procedure Check_Controlled_Array_Attribute (DS : Node_Id) is
1765 if Nkind (DS) = N_Attribute_Reference
1766 and then Is_Entity_Name (Prefix (DS))
1767 and then Ekind (Entity (Prefix (DS))) = E_Function
1768 and then Is_Array_Type (Etype (Entity (Prefix (DS))))
1771 Component_Type (Etype (Entity (Prefix (DS)))))
1772 and then Expander_Active
1775 Loc : constant Source_Ptr := Sloc (N);
1776 Arr : constant Entity_Id := Etype (Entity (Prefix (DS)));
1777 Indx : constant Entity_Id :=
1778 Base_Type (Etype (First_Index (Arr)));
1779 Subt : constant Entity_Id := Make_Temporary (Loc, 'S');
1784 Make_Subtype_Declaration (Loc,
1785 Defining_Identifier => Subt,
1786 Subtype_Indication =>
1787 Make_Subtype_Indication (Loc,
1788 Subtype_Mark => New_Reference_To (Indx, Loc),
1790 Make_Range_Constraint (Loc,
1791 Relocate_Node (DS))));
1792 Insert_Before (Parent (N), Decl);
1796 Make_Attribute_Reference (Loc,
1797 Prefix => New_Reference_To (Subt, Loc),
1798 Attribute_Name => Attribute_Name (DS)));
1802 end Check_Controlled_Array_Attribute;
1804 -- Start of processing for Analyze_Iteration_Scheme
1807 -- If this is a rewritten quantified expression, the iteration
1808 -- scheme has been analyzed already. Do no repeat analysis because
1809 -- the loop variable is already declared.
1811 if Analyzed (N) then
1815 -- For an infinite loop, there is no iteration scheme
1821 -- Iteration scheme is present
1824 Cond : constant Node_Id := Condition (N);
1827 -- For WHILE loop, verify that the condition is a Boolean
1828 -- expression and resolve and check it.
1830 if Present (Cond) then
1831 Analyze_And_Resolve (Cond, Any_Boolean);
1832 Check_Unset_Reference (Cond);
1833 Set_Current_Value_Condition (N);
1836 elsif Present (Iterator_Specification (N)) then
1837 Analyze_Iterator_Specification (Iterator_Specification (N));
1839 -- Else we have a FOR loop
1843 LP : constant Node_Id := Loop_Parameter_Specification (N);
1844 Id : constant Entity_Id := Defining_Identifier (LP);
1845 DS : constant Node_Id := Discrete_Subtype_Definition (LP);
1850 -- We always consider the loop variable to be referenced,
1851 -- since the loop may be used just for counting purposes.
1853 Generate_Reference (Id, N, ' ');
1855 -- Check for the case of loop variable hiding a local variable
1856 -- (used later on to give a nice warning if the hidden variable
1857 -- is never assigned).
1860 H : constant Entity_Id := Homonym (Id);
1863 and then Enclosing_Dynamic_Scope (H) =
1864 Enclosing_Dynamic_Scope (Id)
1865 and then Ekind (H) = E_Variable
1866 and then Is_Discrete_Type (Etype (H))
1868 Set_Hiding_Loop_Variable (H, Id);
1872 -- Loop parameter specification must include subtype mark in
1875 if Formal_Verification_Mode
1876 and then Nkind (DS) = N_Range
1878 Error_Msg_F ("|~~loop parameter specification must "
1879 & "include subtype mark", N);
1882 -- Now analyze the subtype definition. If it is a range, create
1883 -- temporaries for bounds.
1885 if Nkind (DS) = N_Range
1886 and then Expander_Active
1888 Process_Bounds (DS);
1890 -- Not a range or expander not active (is that right???)
1895 if Nkind (DS) = N_Function_Call
1897 (Is_Entity_Name (DS)
1898 and then not Is_Type (Entity (DS)))
1900 -- This is an iterator specification. Rewrite as such
1904 I_Spec : constant Node_Id :=
1905 Make_Iterator_Specification (Sloc (LP),
1906 Defining_Identifier =>
1910 Subtype_Indication =>
1913 Reverse_Present (LP));
1915 Set_Iterator_Specification (N, I_Spec);
1916 Set_Loop_Parameter_Specification (N, Empty);
1917 Analyze_Iterator_Specification (I_Spec);
1927 -- Some additional checks if we are iterating through a type
1929 if Is_Entity_Name (DS)
1930 and then Present (Entity (DS))
1931 and then Is_Type (Entity (DS))
1933 -- The subtype indication may denote the completion of an
1934 -- incomplete type declaration.
1936 if Ekind (Entity (DS)) = E_Incomplete_Type then
1937 Set_Entity (DS, Get_Full_View (Entity (DS)));
1938 Set_Etype (DS, Entity (DS));
1941 -- Attempt to iterate through non-static predicate
1943 if Is_Discrete_Type (Entity (DS))
1944 and then Present (Predicate_Function (Entity (DS)))
1945 and then No (Static_Predicate (Entity (DS)))
1947 Bad_Predicated_Subtype_Use
1948 ("cannot use subtype& with non-static "
1949 & "predicate for loop iteration", DS, Entity (DS));
1953 -- Error if not discrete type
1955 if not Is_Discrete_Type (Etype (DS)) then
1956 Wrong_Type (DS, Any_Discrete);
1957 Set_Etype (DS, Any_Type);
1960 Check_Controlled_Array_Attribute (DS);
1962 Make_Index (DS, LP);
1964 Set_Ekind (Id, E_Loop_Parameter);
1966 -- If the loop is part of a predicate or precondition, it may
1967 -- be analyzed twice, once in the source and once on the copy
1968 -- used to check conformance. Preserve the original itype
1969 -- because the second one may be created in a different scope,
1970 -- e.g. a precondition procedure, leading to a crash in GIGI.
1972 if No (Etype (Id)) or else Etype (Id) = Any_Type then
1973 Set_Etype (Id, Etype (DS));
1976 -- Treat a range as an implicit reference to the type, to
1977 -- inhibit spurious warnings.
1979 Generate_Reference (Base_Type (Etype (DS)), N, ' ');
1980 Set_Is_Known_Valid (Id, True);
1982 -- The loop is not a declarative part, so the only entity
1983 -- declared "within" must be frozen explicitly.
1986 Flist : constant List_Id := Freeze_Entity (Id, N);
1988 if Is_Non_Empty_List (Flist) then
1989 Insert_Actions (N, Flist);
1993 -- Check for null or possibly null range and issue warning. We
1994 -- suppress such messages in generic templates and instances,
1995 -- because in practice they tend to be dubious in these cases.
1997 if Nkind (DS) = N_Range and then Comes_From_Source (N) then
1999 L : constant Node_Id := Low_Bound (DS);
2000 H : constant Node_Id := High_Bound (DS);
2003 -- If range of loop is null, issue warning
2005 if Compile_Time_Compare
2006 (L, H, Assume_Valid => True) = GT
2008 -- Suppress the warning if inside a generic template
2009 -- or instance, since in practice they tend to be
2010 -- dubious in these cases since they can result from
2011 -- intended parametrization.
2013 if not Inside_A_Generic
2014 and then not In_Instance
2016 -- Specialize msg if invalid values could make
2017 -- the loop non-null after all.
2019 if Compile_Time_Compare
2020 (L, H, Assume_Valid => False) = GT
2023 ("?loop range is null, loop will not execute",
2026 -- Since we know the range of the loop is
2027 -- null, set the appropriate flag to remove
2028 -- the loop entirely during expansion.
2030 Set_Is_Null_Loop (Parent (N));
2032 -- Here is where the loop could execute because
2033 -- of invalid values, so issue appropriate
2034 -- message and in this case we do not set the
2035 -- Is_Null_Loop flag since the loop may execute.
2039 ("?loop range may be null, "
2040 & "loop may not execute",
2043 ("?can only execute if invalid values "
2049 -- In either case, suppress warnings in the body of
2050 -- the loop, since it is likely that these warnings
2051 -- will be inappropriate if the loop never actually
2052 -- executes, which is likely.
2054 Set_Suppress_Loop_Warnings (Parent (N));
2056 -- The other case for a warning is a reverse loop
2057 -- where the upper bound is the integer literal zero
2058 -- or one, and the lower bound can be positive.
2060 -- For example, we have
2062 -- for J in reverse N .. 1 loop
2064 -- In practice, this is very likely to be a case of
2065 -- reversing the bounds incorrectly in the range.
2067 elsif Reverse_Present (LP)
2068 and then Nkind (Original_Node (H)) =
2070 and then (Intval (Original_Node (H)) = Uint_0
2072 Intval (Original_Node (H)) = Uint_1)
2074 Error_Msg_N ("?loop range may be null", DS);
2075 Error_Msg_N ("\?bounds may be wrong way round", DS);
2082 end Analyze_Iteration_Scheme;
2084 -------------------------------------
2085 -- Analyze_Iterator_Specification --
2086 -------------------------------------
2088 procedure Analyze_Iterator_Specification (N : Node_Id) is
2089 Def_Id : constant Node_Id := Defining_Identifier (N);
2090 Subt : constant Node_Id := Subtype_Indication (N);
2091 Container : constant Node_Id := Name (N);
2097 Enter_Name (Def_Id);
2098 Set_Ekind (Def_Id, E_Variable);
2100 if Present (Subt) then
2104 Analyze_And_Resolve (Container);
2105 Typ := Etype (Container);
2107 if Is_Array_Type (Typ) then
2108 if Of_Present (N) then
2109 Set_Etype (Def_Id, Component_Type (Typ));
2112 ("to iterate over the elements of an array, use OF", N);
2113 Set_Etype (Def_Id, Etype (First_Index (Typ)));
2116 -- Iteration over a container
2119 Set_Ekind (Def_Id, E_Loop_Parameter);
2121 if Of_Present (N) then
2123 -- Find the Element_Type in the package instance that defines the
2126 Ent := First_Entity (Scope (Typ));
2127 while Present (Ent) loop
2128 if Chars (Ent) = Name_Element_Type then
2129 Set_Etype (Def_Id, Ent);
2137 -- Find the Cursor type in similar fashion
2139 Ent := First_Entity (Scope (Typ));
2140 while Present (Ent) loop
2141 if Chars (Ent) = Name_Cursor then
2142 Set_Etype (Def_Id, Ent);
2150 end Analyze_Iterator_Specification;
2156 -- Note: the semantic work required for analyzing labels (setting them as
2157 -- reachable) was done in a prepass through the statements in the block,
2158 -- so that forward gotos would be properly handled. See Analyze_Statements
2159 -- for further details. The only processing required here is to deal with
2160 -- optimizations that depend on an assumption of sequential control flow,
2161 -- since of course the occurrence of a label breaks this assumption.
2163 procedure Analyze_Label (N : Node_Id) is
2164 pragma Warnings (Off, N);
2166 Kill_Current_Values;
2169 --------------------------
2170 -- Analyze_Label_Entity --
2171 --------------------------
2173 procedure Analyze_Label_Entity (E : Entity_Id) is
2175 Set_Ekind (E, E_Label);
2176 Set_Etype (E, Standard_Void_Type);
2177 Set_Enclosing_Scope (E, Current_Scope);
2178 Set_Reachable (E, True);
2179 end Analyze_Label_Entity;
2181 ----------------------------
2182 -- Analyze_Loop_Statement --
2183 ----------------------------
2185 procedure Analyze_Loop_Statement (N : Node_Id) is
2186 Loop_Statement : constant Node_Id := N;
2188 Id : constant Node_Id := Identifier (Loop_Statement);
2189 Iter : constant Node_Id := Iteration_Scheme (Loop_Statement);
2193 if Present (Id) then
2195 -- Make name visible, e.g. for use in exit statements. Loop
2196 -- labels are always considered to be referenced.
2201 -- Guard against serious error (typically, a scope mismatch when
2202 -- semantic analysis is requested) by creating loop entity to
2203 -- continue analysis.
2206 if Total_Errors_Detected /= 0 then
2209 (E_Loop, Current_Scope, Sloc (Loop_Statement), 'L');
2211 raise Program_Error;
2215 Generate_Reference (Ent, Loop_Statement, ' ');
2216 Generate_Definition (Ent);
2218 -- If we found a label, mark its type. If not, ignore it, since it
2219 -- means we have a conflicting declaration, which would already
2220 -- have been diagnosed at declaration time. Set Label_Construct
2221 -- of the implicit label declaration, which is not created by the
2222 -- parser for generic units.
2224 if Ekind (Ent) = E_Label then
2225 Set_Ekind (Ent, E_Loop);
2227 if Nkind (Parent (Ent)) = N_Implicit_Label_Declaration then
2228 Set_Label_Construct (Parent (Ent), Loop_Statement);
2233 -- Case of no identifier present
2238 (E_Loop, Current_Scope, Sloc (Loop_Statement), 'L');
2239 Set_Etype (Ent, Standard_Void_Type);
2240 Set_Parent (Ent, Loop_Statement);
2243 -- Kill current values on entry to loop, since statements in body of
2244 -- loop may have been executed before the loop is entered. Similarly we
2245 -- kill values after the loop, since we do not know that the body of the
2246 -- loop was executed.
2248 Kill_Current_Values;
2250 Analyze_Iteration_Scheme (Iter);
2251 Analyze_Statements (Statements (Loop_Statement));
2252 Process_End_Label (Loop_Statement, 'e', Ent);
2254 Kill_Current_Values;
2256 -- Check for infinite loop. Skip check for generated code, since it
2257 -- justs waste time and makes debugging the routine called harder.
2259 -- Note that we have to wait till the body of the loop is fully analyzed
2260 -- before making this call, since Check_Infinite_Loop_Warning relies on
2261 -- being able to use semantic visibility information to find references.
2263 if Comes_From_Source (N) then
2264 Check_Infinite_Loop_Warning (N);
2267 -- Code after loop is unreachable if the loop has no WHILE or FOR
2268 -- and contains no EXIT statements within the body of the loop.
2270 if No (Iter) and then not Has_Exit (Ent) then
2271 Check_Unreachable_Code (N);
2273 end Analyze_Loop_Statement;
2275 ----------------------------
2276 -- Analyze_Null_Statement --
2277 ----------------------------
2279 -- Note: the semantics of the null statement is implemented by a single
2280 -- null statement, too bad everything isn't as simple as this!
2282 procedure Analyze_Null_Statement (N : Node_Id) is
2283 pragma Warnings (Off, N);
2286 end Analyze_Null_Statement;
2288 ------------------------
2289 -- Analyze_Statements --
2290 ------------------------
2292 procedure Analyze_Statements (L : List_Id) is
2297 -- The labels declared in the statement list are reachable from
2298 -- statements in the list. We do this as a prepass so that any
2299 -- goto statement will be properly flagged if its target is not
2300 -- reachable. This is not required, but is nice behavior!
2303 while Present (S) loop
2304 if Nkind (S) = N_Label then
2305 Analyze (Identifier (S));
2306 Lab := Entity (Identifier (S));
2308 -- If we found a label mark it as reachable
2310 if Ekind (Lab) = E_Label then
2311 Generate_Definition (Lab);
2312 Set_Reachable (Lab);
2314 if Nkind (Parent (Lab)) = N_Implicit_Label_Declaration then
2315 Set_Label_Construct (Parent (Lab), S);
2318 -- If we failed to find a label, it means the implicit declaration
2319 -- of the label was hidden. A for-loop parameter can do this to
2320 -- a label with the same name inside the loop, since the implicit
2321 -- label declaration is in the innermost enclosing body or block
2325 Error_Msg_Sloc := Sloc (Lab);
2327 ("implicit label declaration for & is hidden#",
2335 -- Perform semantic analysis on all statements
2337 Conditional_Statements_Begin;
2340 while Present (S) loop
2345 Conditional_Statements_End;
2347 -- Make labels unreachable. Visibility is not sufficient, because
2348 -- labels in one if-branch for example are not reachable from the
2349 -- other branch, even though their declarations are in the enclosing
2350 -- declarative part.
2353 while Present (S) loop
2354 if Nkind (S) = N_Label then
2355 Set_Reachable (Entity (Identifier (S)), False);
2360 end Analyze_Statements;
2362 ----------------------------
2363 -- Check_Unreachable_Code --
2364 ----------------------------
2366 procedure Check_Unreachable_Code (N : Node_Id) is
2367 Error_Loc : Source_Ptr;
2371 if Is_List_Member (N)
2372 and then Comes_From_Source (N)
2378 Nxt := Original_Node (Next (N));
2380 -- If a label follows us, then we never have dead code, since
2381 -- someone could branch to the label, so we just ignore it,
2382 -- unless we are in formal mode where goto statements are not
2385 if Nkind (Nxt) = N_Label and then not Formal_Verification_Mode then
2388 -- Otherwise see if we have a real statement following us
2391 and then Comes_From_Source (Nxt)
2392 and then Is_Statement (Nxt)
2394 -- Special very annoying exception. If we have a return that
2395 -- follows a raise, then we allow it without a warning, since
2396 -- the Ada RM annoyingly requires a useless return here!
2398 if Nkind (Original_Node (N)) /= N_Raise_Statement
2399 or else Nkind (Nxt) /= N_Simple_Return_Statement
2401 -- The rather strange shenanigans with the warning message
2402 -- here reflects the fact that Kill_Dead_Code is very good
2403 -- at removing warnings in deleted code, and this is one
2404 -- warning we would prefer NOT to have removed.
2406 Error_Loc := Sloc (Nxt);
2408 -- If we have unreachable code, analyze and remove the
2409 -- unreachable code, since it is useless and we don't
2410 -- want to generate junk warnings.
2412 -- We skip this step if we are not in code generation mode.
2413 -- This is the one case where we remove dead code in the
2414 -- semantics as opposed to the expander, and we do not want
2415 -- to remove code if we are not in code generation mode,
2416 -- since this messes up the ASIS trees.
2418 -- Note that one might react by moving the whole circuit to
2419 -- exp_ch5, but then we lose the warning in -gnatc mode.
2421 if Operating_Mode = Generate_Code then
2425 -- Quit deleting when we have nothing more to delete
2426 -- or if we hit a label (since someone could transfer
2427 -- control to a label, so we should not delete it).
2429 exit when No (Nxt) or else Nkind (Nxt) = N_Label;
2431 -- Statement/declaration is to be deleted
2435 Kill_Dead_Code (Nxt);
2439 -- Now issue the warning (or error in formal mode)
2441 if Formal_Verification_Mode then
2443 ("|~~unreachable code is not allowed", Error_Loc);
2445 Error_Msg ("?unreachable code!", Error_Loc);
2449 -- If the unconditional transfer of control instruction is
2450 -- the last statement of a sequence, then see if our parent
2451 -- is one of the constructs for which we count unblocked exits,
2452 -- and if so, adjust the count.
2457 -- Statements in THEN part or ELSE part of IF statement
2459 if Nkind (P) = N_If_Statement then
2462 -- Statements in ELSIF part of an IF statement
2464 elsif Nkind (P) = N_Elsif_Part then
2466 pragma Assert (Nkind (P) = N_If_Statement);
2468 -- Statements in CASE statement alternative
2470 elsif Nkind (P) = N_Case_Statement_Alternative then
2472 pragma Assert (Nkind (P) = N_Case_Statement);
2474 -- Statements in body of block
2476 elsif Nkind (P) = N_Handled_Sequence_Of_Statements
2477 and then Nkind (Parent (P)) = N_Block_Statement
2481 -- Statements in exception handler in a block
2483 elsif Nkind (P) = N_Exception_Handler
2484 and then Nkind (Parent (P)) = N_Handled_Sequence_Of_Statements
2485 and then Nkind (Parent (Parent (P))) = N_Block_Statement
2489 -- None of these cases, so return
2495 -- This was one of the cases we are looking for (i.e. the
2496 -- parent construct was IF, CASE or block) so decrement count.
2498 Unblocked_Exit_Count := Unblocked_Exit_Count - 1;
2502 end Check_Unreachable_Code;