1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Aspects; use Aspects;
27 with Atree; use Atree;
28 with Casing; use Casing;
29 with Checks; use Checks;
30 with Debug; use Debug;
31 with Elists; use Elists;
32 with Errout; use Errout;
33 with Exp_Ch11; use Exp_Ch11;
34 with Exp_Disp; use Exp_Disp;
35 with Exp_Util; use Exp_Util;
36 with Fname; use Fname;
37 with Freeze; use Freeze;
39 with Lib.Xref; use Lib.Xref;
40 with Namet.Sp; use Namet.Sp;
41 with Nlists; use Nlists;
42 with Nmake; use Nmake;
43 with Output; use Output;
44 with Restrict; use Restrict;
45 with Rident; use Rident;
46 with Rtsfind; use Rtsfind;
48 with Sem_Aux; use Sem_Aux;
49 with Sem_Attr; use Sem_Attr;
50 with Sem_Ch8; use Sem_Ch8;
51 with Sem_Ch13; use Sem_Ch13;
52 with Sem_Disp; use Sem_Disp;
53 with Sem_Eval; use Sem_Eval;
54 with Sem_Prag; use Sem_Prag;
55 with Sem_Res; use Sem_Res;
56 with Sem_Warn; use Sem_Warn;
57 with Sem_Type; use Sem_Type;
58 with Sinfo; use Sinfo;
59 with Sinput; use Sinput;
60 with Stand; use Stand;
62 with Stringt; use Stringt;
63 with Targparm; use Targparm;
64 with Tbuild; use Tbuild;
65 with Ttypes; use Ttypes;
66 with Uname; use Uname;
68 with GNAT.HTable; use GNAT.HTable;
70 package body Sem_Util is
72 ----------------------------------------
73 -- Global_Variables for New_Copy_Tree --
74 ----------------------------------------
76 -- These global variables are used by New_Copy_Tree. See description of the
77 -- body of this subprogram for details. Global variables can be safely used
78 -- by New_Copy_Tree, since there is no case of a recursive call from the
79 -- processing inside New_Copy_Tree.
81 NCT_Hash_Threshold : constant := 20;
82 -- If there are more than this number of pairs of entries in the map, then
83 -- Hash_Tables_Used will be set, and the hash tables will be initialized
84 -- and used for the searches.
86 NCT_Hash_Tables_Used : Boolean := False;
87 -- Set to True if hash tables are in use
89 NCT_Table_Entries : Nat := 0;
90 -- Count entries in table to see if threshold is reached
92 NCT_Hash_Table_Setup : Boolean := False;
93 -- Set to True if hash table contains data. We set this True if we setup
94 -- the hash table with data, and leave it set permanently from then on,
95 -- this is a signal that second and subsequent users of the hash table
96 -- must clear the old entries before reuse.
98 subtype NCT_Header_Num is Int range 0 .. 511;
99 -- Defines range of headers in hash tables (512 headers)
101 -----------------------
102 -- Local Subprograms --
103 -----------------------
105 function Build_Component_Subtype
108 T : Entity_Id) return Node_Id;
109 -- This function builds the subtype for Build_Actual_Subtype_Of_Component
110 -- and Build_Discriminal_Subtype_Of_Component. C is a list of constraints,
111 -- Loc is the source location, T is the original subtype.
113 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean;
114 -- Subsidiary to Is_Fully_Initialized_Type. For an unconstrained type
115 -- with discriminants whose default values are static, examine only the
116 -- components in the selected variant to determine whether all of them
119 function Has_Enabled_Property
120 (Item_Id : Entity_Id;
121 Property : Name_Id) return Boolean;
122 -- Subsidiary to routines Async_xxx_Enabled and Effective_xxx_Enabled.
123 -- Determine whether an abstract state or a variable denoted by entity
124 -- Item_Id has enabled property Property.
126 function Has_Null_Extension (T : Entity_Id) return Boolean;
127 -- T is a derived tagged type. Check whether the type extension is null.
128 -- If the parent type is fully initialized, T can be treated as such.
130 ------------------------------
131 -- Abstract_Interface_List --
132 ------------------------------
134 function Abstract_Interface_List (Typ : Entity_Id) return List_Id is
138 if Is_Concurrent_Type (Typ) then
140 -- If we are dealing with a synchronized subtype, go to the base
141 -- type, whose declaration has the interface list.
143 -- Shouldn't this be Declaration_Node???
145 Nod := Parent (Base_Type (Typ));
147 if Nkind (Nod) = N_Full_Type_Declaration then
151 elsif Ekind (Typ) = E_Record_Type_With_Private then
152 if Nkind (Parent (Typ)) = N_Full_Type_Declaration then
153 Nod := Type_Definition (Parent (Typ));
155 elsif Nkind (Parent (Typ)) = N_Private_Type_Declaration then
156 if Present (Full_View (Typ))
158 Nkind (Parent (Full_View (Typ))) = N_Full_Type_Declaration
160 Nod := Type_Definition (Parent (Full_View (Typ)));
162 -- If the full-view is not available we cannot do anything else
163 -- here (the source has errors).
169 -- Support for generic formals with interfaces is still missing ???
171 elsif Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
176 (Nkind (Parent (Typ)) = N_Private_Extension_Declaration);
180 elsif Ekind (Typ) = E_Record_Subtype then
181 Nod := Type_Definition (Parent (Etype (Typ)));
183 elsif Ekind (Typ) = E_Record_Subtype_With_Private then
185 -- Recurse, because parent may still be a private extension. Also
186 -- note that the full view of the subtype or the full view of its
187 -- base type may (both) be unavailable.
189 return Abstract_Interface_List (Etype (Typ));
191 else pragma Assert ((Ekind (Typ)) = E_Record_Type);
192 if Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
193 Nod := Formal_Type_Definition (Parent (Typ));
195 Nod := Type_Definition (Parent (Typ));
199 return Interface_List (Nod);
200 end Abstract_Interface_List;
202 --------------------------------
203 -- Add_Access_Type_To_Process --
204 --------------------------------
206 procedure Add_Access_Type_To_Process (E : Entity_Id; A : Entity_Id) is
210 Ensure_Freeze_Node (E);
211 L := Access_Types_To_Process (Freeze_Node (E));
215 Set_Access_Types_To_Process (Freeze_Node (E), L);
219 end Add_Access_Type_To_Process;
221 --------------------------
222 -- Add_Block_Identifier --
223 --------------------------
225 procedure Add_Block_Identifier (N : Node_Id; Id : out Entity_Id) is
226 Loc : constant Source_Ptr := Sloc (N);
229 pragma Assert (Nkind (N) = N_Block_Statement);
231 -- The block already has a label, return its entity
233 if Present (Identifier (N)) then
234 Id := Entity (Identifier (N));
236 -- Create a new block label and set its attributes
239 Id := New_Internal_Entity (E_Block, Current_Scope, Loc, 'B');
240 Set_Etype (Id, Standard_Void_Type);
243 Set_Identifier (N, New_Occurrence_Of (Id, Loc));
244 Set_Block_Node (Id, Identifier (N));
246 end Add_Block_Identifier;
248 -----------------------
249 -- Add_Contract_Item --
250 -----------------------
252 procedure Add_Contract_Item (Prag : Node_Id; Id : Entity_Id) is
253 Items : constant Node_Id := Contract (Id);
255 procedure Add_Classification;
256 -- Prepend Prag to the list of classifications
258 procedure Add_Contract_Test_Case;
259 -- Prepend Prag to the list of contract and test cases
261 procedure Add_Pre_Post_Condition;
262 -- Prepend Prag to the list of pre- and postconditions
264 ------------------------
265 -- Add_Classification --
266 ------------------------
268 procedure Add_Classification is
270 Set_Next_Pragma (Prag, Classifications (Items));
271 Set_Classifications (Items, Prag);
272 end Add_Classification;
274 ----------------------------
275 -- Add_Contract_Test_Case --
276 ----------------------------
278 procedure Add_Contract_Test_Case is
280 Set_Next_Pragma (Prag, Contract_Test_Cases (Items));
281 Set_Contract_Test_Cases (Items, Prag);
282 end Add_Contract_Test_Case;
284 ----------------------------
285 -- Add_Pre_Post_Condition --
286 ----------------------------
288 procedure Add_Pre_Post_Condition is
290 Set_Next_Pragma (Prag, Pre_Post_Conditions (Items));
291 Set_Pre_Post_Conditions (Items, Prag);
292 end Add_Pre_Post_Condition;
299 -- Start of processing for Add_Contract_Item
302 -- The related context must have a contract and the item to be added
305 pragma Assert (Present (Items));
306 pragma Assert (Nkind (Prag) = N_Pragma);
308 Nam := Original_Aspect_Name (Prag);
310 -- Contract items related to [generic] packages or instantiations. The
311 -- applicable pragmas are:
315 -- Part_Of (instantiation only)
317 if Ekind_In (Id, E_Generic_Package, E_Package) then
318 if Nam_In (Nam, Name_Abstract_State,
319 Name_Initial_Condition,
324 -- Indicator Part_Of must be associated with a package instantiation
326 elsif Nam = Name_Part_Of and then Is_Generic_Instance (Id) then
329 -- The pragma is not a proper contract item
335 -- Contract items related to package bodies. The applicable pragmas are:
338 elsif Ekind (Id) = E_Package_Body then
339 if Nam = Name_Refined_State then
342 -- The pragma is not a proper contract item
348 -- Contract items related to subprogram or entry declarations. The
349 -- applicable pragmas are:
352 -- Extensions_Visible
360 elsif Ekind_In (Id, E_Entry, E_Entry_Family)
361 or else Is_Generic_Subprogram (Id)
362 or else Is_Subprogram (Id)
364 if Nam_In (Nam, Name_Pre,
371 -- Before we add a precondition or postcondition to the list, make
372 -- sure we do not have a disallowed duplicate, which can happen if
373 -- we use a pragma for Pre[_Class] or Post[_Class] instead of the
374 -- corresponding aspect.
376 if not From_Aspect_Specification (Prag)
377 and then Nam_In (Nam, Name_Pre,
382 PPC := Pre_Post_Conditions (Items);
383 while Present (PPC) loop
384 if not Split_PPC (PPC)
385 and then Original_Aspect_Name (PPC) = Nam
387 Error_Msg_Sloc := Sloc (PPC);
389 ("duplication of aspect for & given#", Prag, Id);
393 PPC := Next_Pragma (PPC);
397 Add_Pre_Post_Condition;
399 elsif Nam_In (Nam, Name_Contract_Cases, Name_Test_Case) then
400 Add_Contract_Test_Case;
402 elsif Nam_In (Nam, Name_Depends,
403 Name_Extensions_Visible,
408 -- The pragma is not a proper contract item
414 -- Contract items related to subprogram bodies. Applicable pragmas are:
419 elsif Ekind (Id) = E_Subprogram_Body then
420 if Nam_In (Nam, Name_Refined_Depends, Name_Refined_Global) then
423 elsif Nam = Name_Refined_Post then
424 Add_Pre_Post_Condition;
426 -- The pragma is not a proper contract item
432 -- Contract items related to variables. Applicable pragmas are:
439 elsif Ekind (Id) = E_Variable then
440 if Nam_In (Nam, Name_Async_Readers,
442 Name_Effective_Reads,
443 Name_Effective_Writes,
448 -- The pragma is not a proper contract item
454 end Add_Contract_Item;
456 ----------------------------
457 -- Add_Global_Declaration --
458 ----------------------------
460 procedure Add_Global_Declaration (N : Node_Id) is
461 Aux_Node : constant Node_Id := Aux_Decls_Node (Cunit (Current_Sem_Unit));
464 if No (Declarations (Aux_Node)) then
465 Set_Declarations (Aux_Node, New_List);
468 Append_To (Declarations (Aux_Node), N);
470 end Add_Global_Declaration;
472 --------------------------------
473 -- Address_Integer_Convert_OK --
474 --------------------------------
476 function Address_Integer_Convert_OK (T1, T2 : Entity_Id) return Boolean is
478 if Allow_Integer_Address
479 and then ((Is_Descendent_Of_Address (T1)
480 and then Is_Private_Type (T1)
481 and then Is_Integer_Type (T2))
483 (Is_Descendent_Of_Address (T2)
484 and then Is_Private_Type (T2)
485 and then Is_Integer_Type (T1)))
491 end Address_Integer_Convert_OK;
497 -- For now, just 8/16/32/64. but analyze later if AAMP is special???
499 function Addressable (V : Uint) return Boolean is
501 return V = Uint_8 or else
507 function Addressable (V : Int) return Boolean is
515 ---------------------------------
516 -- Aggregate_Constraint_Checks --
517 ---------------------------------
519 procedure Aggregate_Constraint_Checks
521 Check_Typ : Entity_Id)
523 Exp_Typ : constant Entity_Id := Etype (Exp);
526 if Raises_Constraint_Error (Exp) then
530 -- Ada 2005 (AI-230): Generate a conversion to an anonymous access
531 -- component's type to force the appropriate accessibility checks.
533 -- Ada 2005 (AI-231): Generate conversion to the null-excluding
534 -- type to force the corresponding run-time check
536 if Is_Access_Type (Check_Typ)
537 and then ((Is_Local_Anonymous_Access (Check_Typ))
538 or else (Can_Never_Be_Null (Check_Typ)
539 and then not Can_Never_Be_Null (Exp_Typ)))
541 Rewrite (Exp, Convert_To (Check_Typ, Relocate_Node (Exp)));
542 Analyze_And_Resolve (Exp, Check_Typ);
543 Check_Unset_Reference (Exp);
546 -- This is really expansion activity, so make sure that expansion is
547 -- on and is allowed. In GNATprove mode, we also want check flags to
548 -- be added in the tree, so that the formal verification can rely on
549 -- those to be present. In GNATprove mode for formal verification, some
550 -- treatment typically only done during expansion needs to be performed
551 -- on the tree, but it should not be applied inside generics. Otherwise,
552 -- this breaks the name resolution mechanism for generic instances.
554 if not Expander_Active
555 and (Inside_A_Generic or not Full_Analysis or not GNATprove_Mode)
560 -- First check if we have to insert discriminant checks
562 if Has_Discriminants (Exp_Typ) then
563 Apply_Discriminant_Check (Exp, Check_Typ);
565 -- Next emit length checks for array aggregates
567 elsif Is_Array_Type (Exp_Typ) then
568 Apply_Length_Check (Exp, Check_Typ);
570 -- Finally emit scalar and string checks. If we are dealing with a
571 -- scalar literal we need to check by hand because the Etype of
572 -- literals is not necessarily correct.
574 elsif Is_Scalar_Type (Exp_Typ)
575 and then Compile_Time_Known_Value (Exp)
577 if Is_Out_Of_Range (Exp, Base_Type (Check_Typ)) then
578 Apply_Compile_Time_Constraint_Error
579 (Exp, "value not in range of}??", CE_Range_Check_Failed,
580 Ent => Base_Type (Check_Typ),
581 Typ => Base_Type (Check_Typ));
583 elsif Is_Out_Of_Range (Exp, Check_Typ) then
584 Apply_Compile_Time_Constraint_Error
585 (Exp, "value not in range of}??", CE_Range_Check_Failed,
589 elsif not Range_Checks_Suppressed (Check_Typ) then
590 Apply_Scalar_Range_Check (Exp, Check_Typ);
593 -- Verify that target type is also scalar, to prevent view anomalies
594 -- in instantiations.
596 elsif (Is_Scalar_Type (Exp_Typ)
597 or else Nkind (Exp) = N_String_Literal)
598 and then Is_Scalar_Type (Check_Typ)
599 and then Exp_Typ /= Check_Typ
601 if Is_Entity_Name (Exp)
602 and then Ekind (Entity (Exp)) = E_Constant
604 -- If expression is a constant, it is worthwhile checking whether
605 -- it is a bound of the type.
607 if (Is_Entity_Name (Type_Low_Bound (Check_Typ))
608 and then Entity (Exp) = Entity (Type_Low_Bound (Check_Typ)))
610 (Is_Entity_Name (Type_High_Bound (Check_Typ))
611 and then Entity (Exp) = Entity (Type_High_Bound (Check_Typ)))
616 Rewrite (Exp, Convert_To (Check_Typ, Relocate_Node (Exp)));
617 Analyze_And_Resolve (Exp, Check_Typ);
618 Check_Unset_Reference (Exp);
621 -- Could use a comment on this case ???
624 Rewrite (Exp, Convert_To (Check_Typ, Relocate_Node (Exp)));
625 Analyze_And_Resolve (Exp, Check_Typ);
626 Check_Unset_Reference (Exp);
630 end Aggregate_Constraint_Checks;
632 -----------------------
633 -- Alignment_In_Bits --
634 -----------------------
636 function Alignment_In_Bits (E : Entity_Id) return Uint is
638 return Alignment (E) * System_Storage_Unit;
639 end Alignment_In_Bits;
641 ---------------------------------
642 -- Append_Inherited_Subprogram --
643 ---------------------------------
645 procedure Append_Inherited_Subprogram (S : Entity_Id) is
646 Par : constant Entity_Id := Alias (S);
647 -- The parent subprogram
649 Scop : constant Entity_Id := Scope (Par);
650 -- The scope of definition of the parent subprogram
652 Typ : constant Entity_Id := Defining_Entity (Parent (S));
653 -- The derived type of which S is a primitive operation
659 if Ekind (Current_Scope) = E_Package
660 and then In_Private_Part (Current_Scope)
661 and then Has_Private_Declaration (Typ)
662 and then Is_Tagged_Type (Typ)
663 and then Scop = Current_Scope
665 -- The inherited operation is available at the earliest place after
666 -- the derived type declaration ( RM 7.3.1 (6/1)). This is only
667 -- relevant for type extensions. If the parent operation appears
668 -- after the type extension, the operation is not visible.
671 (Visible_Declarations
672 (Package_Specification (Current_Scope)));
673 while Present (Decl) loop
674 if Nkind (Decl) = N_Private_Extension_Declaration
675 and then Defining_Entity (Decl) = Typ
677 if Sloc (Decl) > Sloc (Par) then
678 Next_E := Next_Entity (Par);
679 Set_Next_Entity (Par, S);
680 Set_Next_Entity (S, Next_E);
692 -- If partial view is not a type extension, or it appears before the
693 -- subprogram declaration, insert normally at end of entity list.
695 Append_Entity (S, Current_Scope);
696 end Append_Inherited_Subprogram;
698 -----------------------------------------
699 -- Apply_Compile_Time_Constraint_Error --
700 -----------------------------------------
702 procedure Apply_Compile_Time_Constraint_Error
705 Reason : RT_Exception_Code;
706 Ent : Entity_Id := Empty;
707 Typ : Entity_Id := Empty;
708 Loc : Source_Ptr := No_Location;
709 Rep : Boolean := True;
710 Warn : Boolean := False)
712 Stat : constant Boolean := Is_Static_Expression (N);
713 R_Stat : constant Node_Id :=
714 Make_Raise_Constraint_Error (Sloc (N), Reason => Reason);
725 (Compile_Time_Constraint_Error (N, Msg, Ent, Loc, Warn => Warn));
731 -- Now we replace the node by an N_Raise_Constraint_Error node
732 -- This does not need reanalyzing, so set it as analyzed now.
735 Set_Analyzed (N, True);
738 Set_Raises_Constraint_Error (N);
740 -- Now deal with possible local raise handling
742 Possible_Local_Raise (N, Standard_Constraint_Error);
744 -- If the original expression was marked as static, the result is
745 -- still marked as static, but the Raises_Constraint_Error flag is
746 -- always set so that further static evaluation is not attempted.
749 Set_Is_Static_Expression (N);
751 end Apply_Compile_Time_Constraint_Error;
753 ---------------------------
754 -- Async_Readers_Enabled --
755 ---------------------------
757 function Async_Readers_Enabled (Id : Entity_Id) return Boolean is
759 return Has_Enabled_Property (Id, Name_Async_Readers);
760 end Async_Readers_Enabled;
762 ---------------------------
763 -- Async_Writers_Enabled --
764 ---------------------------
766 function Async_Writers_Enabled (Id : Entity_Id) return Boolean is
768 return Has_Enabled_Property (Id, Name_Async_Writers);
769 end Async_Writers_Enabled;
771 --------------------------------------
772 -- Available_Full_View_Of_Component --
773 --------------------------------------
775 function Available_Full_View_Of_Component (T : Entity_Id) return Boolean is
776 ST : constant Entity_Id := Scope (T);
777 SCT : constant Entity_Id := Scope (Component_Type (T));
779 return In_Open_Scopes (ST)
780 and then In_Open_Scopes (SCT)
781 and then Scope_Depth (ST) >= Scope_Depth (SCT);
782 end Available_Full_View_Of_Component;
788 procedure Bad_Attribute
791 Warn : Boolean := False)
794 Error_Msg_Warn := Warn;
795 Error_Msg_N ("unrecognized attribute&<<", N);
797 -- Check for possible misspelling
799 Error_Msg_Name_1 := First_Attribute_Name;
800 while Error_Msg_Name_1 <= Last_Attribute_Name loop
801 if Is_Bad_Spelling_Of (Nam, Error_Msg_Name_1) then
802 Error_Msg_N -- CODEFIX
803 ("\possible misspelling of %<<", N);
807 Error_Msg_Name_1 := Error_Msg_Name_1 + 1;
811 --------------------------------
812 -- Bad_Predicated_Subtype_Use --
813 --------------------------------
815 procedure Bad_Predicated_Subtype_Use
819 Suggest_Static : Boolean := False)
824 -- Avoid cascaded errors
826 if Error_Posted (N) then
830 if Inside_A_Generic then
831 Gen := Current_Scope;
832 while Present (Gen) and then Ekind (Gen) /= E_Generic_Package loop
840 if Is_Generic_Formal (Typ) and then Is_Discrete_Type (Typ) then
841 Set_No_Predicate_On_Actual (Typ);
844 elsif Has_Predicates (Typ) then
845 if Is_Generic_Actual_Type (Typ) then
847 -- The restriction on loop parameters is only that the type
848 -- should have no dynamic predicates.
850 if Nkind (Parent (N)) = N_Loop_Parameter_Specification
851 and then not Has_Dynamic_Predicate_Aspect (Typ)
852 and then Is_OK_Static_Subtype (Typ)
857 Gen := Current_Scope;
858 while not Is_Generic_Instance (Gen) loop
862 pragma Assert (Present (Gen));
864 if Ekind (Gen) = E_Package and then In_Package_Body (Gen) then
865 Error_Msg_Warn := SPARK_Mode /= On;
866 Error_Msg_FE (Msg & "<<", N, Typ);
867 Error_Msg_F ("\Program_Error [<<", N);
870 Make_Raise_Program_Error (Sloc (N),
871 Reason => PE_Bad_Predicated_Generic_Type));
874 Error_Msg_FE (Msg & "<<", N, Typ);
878 Error_Msg_FE (Msg, N, Typ);
881 -- Emit an optional suggestion on how to remedy the error if the
882 -- context warrants it.
884 if Suggest_Static and then Has_Static_Predicate (Typ) then
885 Error_Msg_FE ("\predicate of & should be marked static", N, Typ);
888 end Bad_Predicated_Subtype_Use;
890 -----------------------------------------
891 -- Bad_Unordered_Enumeration_Reference --
892 -----------------------------------------
894 function Bad_Unordered_Enumeration_Reference
896 T : Entity_Id) return Boolean
899 return Is_Enumeration_Type (T)
900 and then Warn_On_Unordered_Enumeration_Type
901 and then not Is_Generic_Type (T)
902 and then Comes_From_Source (N)
903 and then not Has_Pragma_Ordered (T)
904 and then not In_Same_Extended_Unit (N, T);
905 end Bad_Unordered_Enumeration_Reference;
907 --------------------------
908 -- Build_Actual_Subtype --
909 --------------------------
911 function Build_Actual_Subtype
913 N : Node_Or_Entity_Id) return Node_Id
916 -- Normally Sloc (N), but may point to corresponding body in some cases
918 Constraints : List_Id;
924 Disc_Type : Entity_Id;
930 if Nkind (N) = N_Defining_Identifier then
931 Obj := New_Occurrence_Of (N, Loc);
933 -- If this is a formal parameter of a subprogram declaration, and
934 -- we are compiling the body, we want the declaration for the
935 -- actual subtype to carry the source position of the body, to
936 -- prevent anomalies in gdb when stepping through the code.
938 if Is_Formal (N) then
940 Decl : constant Node_Id := Unit_Declaration_Node (Scope (N));
942 if Nkind (Decl) = N_Subprogram_Declaration
943 and then Present (Corresponding_Body (Decl))
945 Loc := Sloc (Corresponding_Body (Decl));
954 if Is_Array_Type (T) then
955 Constraints := New_List;
956 for J in 1 .. Number_Dimensions (T) loop
958 -- Build an array subtype declaration with the nominal subtype and
959 -- the bounds of the actual. Add the declaration in front of the
960 -- local declarations for the subprogram, for analysis before any
961 -- reference to the formal in the body.
964 Make_Attribute_Reference (Loc,
966 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
967 Attribute_Name => Name_First,
968 Expressions => New_List (
969 Make_Integer_Literal (Loc, J)));
972 Make_Attribute_Reference (Loc,
974 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
975 Attribute_Name => Name_Last,
976 Expressions => New_List (
977 Make_Integer_Literal (Loc, J)));
979 Append (Make_Range (Loc, Lo, Hi), Constraints);
982 -- If the type has unknown discriminants there is no constrained
983 -- subtype to build. This is never called for a formal or for a
984 -- lhs, so returning the type is ok ???
986 elsif Has_Unknown_Discriminants (T) then
990 Constraints := New_List;
992 -- Type T is a generic derived type, inherit the discriminants from
995 if Is_Private_Type (T)
996 and then No (Full_View (T))
998 -- T was flagged as an error if it was declared as a formal
999 -- derived type with known discriminants. In this case there
1000 -- is no need to look at the parent type since T already carries
1001 -- its own discriminants.
1003 and then not Error_Posted (T)
1005 Disc_Type := Etype (Base_Type (T));
1010 Discr := First_Discriminant (Disc_Type);
1011 while Present (Discr) loop
1012 Append_To (Constraints,
1013 Make_Selected_Component (Loc,
1015 Duplicate_Subexpr_No_Checks (Obj),
1016 Selector_Name => New_Occurrence_Of (Discr, Loc)));
1017 Next_Discriminant (Discr);
1021 Subt := Make_Temporary (Loc, 'S', Related_Node => N);
1022 Set_Is_Internal (Subt);
1025 Make_Subtype_Declaration (Loc,
1026 Defining_Identifier => Subt,
1027 Subtype_Indication =>
1028 Make_Subtype_Indication (Loc,
1029 Subtype_Mark => New_Occurrence_Of (T, Loc),
1031 Make_Index_Or_Discriminant_Constraint (Loc,
1032 Constraints => Constraints)));
1034 Mark_Rewrite_Insertion (Decl);
1036 end Build_Actual_Subtype;
1038 ---------------------------------------
1039 -- Build_Actual_Subtype_Of_Component --
1040 ---------------------------------------
1042 function Build_Actual_Subtype_Of_Component
1044 N : Node_Id) return Node_Id
1046 Loc : constant Source_Ptr := Sloc (N);
1047 P : constant Node_Id := Prefix (N);
1050 Index_Typ : Entity_Id;
1052 Desig_Typ : Entity_Id;
1053 -- This is either a copy of T, or if T is an access type, then it is
1054 -- the directly designated type of this access type.
1056 function Build_Actual_Array_Constraint return List_Id;
1057 -- If one or more of the bounds of the component depends on
1058 -- discriminants, build actual constraint using the discriminants
1061 function Build_Actual_Record_Constraint return List_Id;
1062 -- Similar to previous one, for discriminated components constrained
1063 -- by the discriminant of the enclosing object.
1065 -----------------------------------
1066 -- Build_Actual_Array_Constraint --
1067 -----------------------------------
1069 function Build_Actual_Array_Constraint return List_Id is
1070 Constraints : constant List_Id := New_List;
1078 Indx := First_Index (Desig_Typ);
1079 while Present (Indx) loop
1080 Old_Lo := Type_Low_Bound (Etype (Indx));
1081 Old_Hi := Type_High_Bound (Etype (Indx));
1083 if Denotes_Discriminant (Old_Lo) then
1085 Make_Selected_Component (Loc,
1086 Prefix => New_Copy_Tree (P),
1087 Selector_Name => New_Occurrence_Of (Entity (Old_Lo), Loc));
1090 Lo := New_Copy_Tree (Old_Lo);
1092 -- The new bound will be reanalyzed in the enclosing
1093 -- declaration. For literal bounds that come from a type
1094 -- declaration, the type of the context must be imposed, so
1095 -- insure that analysis will take place. For non-universal
1096 -- types this is not strictly necessary.
1098 Set_Analyzed (Lo, False);
1101 if Denotes_Discriminant (Old_Hi) then
1103 Make_Selected_Component (Loc,
1104 Prefix => New_Copy_Tree (P),
1105 Selector_Name => New_Occurrence_Of (Entity (Old_Hi), Loc));
1108 Hi := New_Copy_Tree (Old_Hi);
1109 Set_Analyzed (Hi, False);
1112 Append (Make_Range (Loc, Lo, Hi), Constraints);
1117 end Build_Actual_Array_Constraint;
1119 ------------------------------------
1120 -- Build_Actual_Record_Constraint --
1121 ------------------------------------
1123 function Build_Actual_Record_Constraint return List_Id is
1124 Constraints : constant List_Id := New_List;
1129 D := First_Elmt (Discriminant_Constraint (Desig_Typ));
1130 while Present (D) loop
1131 if Denotes_Discriminant (Node (D)) then
1132 D_Val := Make_Selected_Component (Loc,
1133 Prefix => New_Copy_Tree (P),
1134 Selector_Name => New_Occurrence_Of (Entity (Node (D)), Loc));
1137 D_Val := New_Copy_Tree (Node (D));
1140 Append (D_Val, Constraints);
1145 end Build_Actual_Record_Constraint;
1147 -- Start of processing for Build_Actual_Subtype_Of_Component
1150 -- Why the test for Spec_Expression mode here???
1152 if In_Spec_Expression then
1155 -- More comments for the rest of this body would be good ???
1157 elsif Nkind (N) = N_Explicit_Dereference then
1158 if Is_Composite_Type (T)
1159 and then not Is_Constrained (T)
1160 and then not (Is_Class_Wide_Type (T)
1161 and then Is_Constrained (Root_Type (T)))
1162 and then not Has_Unknown_Discriminants (T)
1164 -- If the type of the dereference is already constrained, it is an
1167 if Is_Array_Type (Etype (N))
1168 and then Is_Constrained (Etype (N))
1172 Remove_Side_Effects (P);
1173 return Build_Actual_Subtype (T, N);
1180 if Ekind (T) = E_Access_Subtype then
1181 Desig_Typ := Designated_Type (T);
1186 if Ekind (Desig_Typ) = E_Array_Subtype then
1187 Id := First_Index (Desig_Typ);
1188 while Present (Id) loop
1189 Index_Typ := Underlying_Type (Etype (Id));
1191 if Denotes_Discriminant (Type_Low_Bound (Index_Typ))
1193 Denotes_Discriminant (Type_High_Bound (Index_Typ))
1195 Remove_Side_Effects (P);
1197 Build_Component_Subtype
1198 (Build_Actual_Array_Constraint, Loc, Base_Type (T));
1204 elsif Is_Composite_Type (Desig_Typ)
1205 and then Has_Discriminants (Desig_Typ)
1206 and then not Has_Unknown_Discriminants (Desig_Typ)
1208 if Is_Private_Type (Desig_Typ)
1209 and then No (Discriminant_Constraint (Desig_Typ))
1211 Desig_Typ := Full_View (Desig_Typ);
1214 D := First_Elmt (Discriminant_Constraint (Desig_Typ));
1215 while Present (D) loop
1216 if Denotes_Discriminant (Node (D)) then
1217 Remove_Side_Effects (P);
1219 Build_Component_Subtype (
1220 Build_Actual_Record_Constraint, Loc, Base_Type (T));
1227 -- If none of the above, the actual and nominal subtypes are the same
1230 end Build_Actual_Subtype_Of_Component;
1232 -----------------------------
1233 -- Build_Component_Subtype --
1234 -----------------------------
1236 function Build_Component_Subtype
1239 T : Entity_Id) return Node_Id
1245 -- Unchecked_Union components do not require component subtypes
1247 if Is_Unchecked_Union (T) then
1251 Subt := Make_Temporary (Loc, 'S');
1252 Set_Is_Internal (Subt);
1255 Make_Subtype_Declaration (Loc,
1256 Defining_Identifier => Subt,
1257 Subtype_Indication =>
1258 Make_Subtype_Indication (Loc,
1259 Subtype_Mark => New_Occurrence_Of (Base_Type (T), Loc),
1261 Make_Index_Or_Discriminant_Constraint (Loc,
1262 Constraints => C)));
1264 Mark_Rewrite_Insertion (Decl);
1266 end Build_Component_Subtype;
1268 ----------------------------------
1269 -- Build_Default_Init_Cond_Call --
1270 ----------------------------------
1272 function Build_Default_Init_Cond_Call
1275 Typ : Entity_Id) return Node_Id
1277 Proc_Id : constant Entity_Id := Default_Init_Cond_Procedure (Typ);
1278 Formal_Typ : constant Entity_Id := Etype (First_Formal (Proc_Id));
1282 Make_Procedure_Call_Statement (Loc,
1283 Name => New_Occurrence_Of (Proc_Id, Loc),
1284 Parameter_Associations => New_List (
1285 Make_Unchecked_Type_Conversion (Loc,
1286 Subtype_Mark => New_Occurrence_Of (Formal_Typ, Loc),
1287 Expression => New_Occurrence_Of (Obj_Id, Loc))));
1288 end Build_Default_Init_Cond_Call;
1290 ----------------------------------------------
1291 -- Build_Default_Init_Cond_Procedure_Bodies --
1292 ----------------------------------------------
1294 procedure Build_Default_Init_Cond_Procedure_Bodies (Priv_Decls : List_Id) is
1295 procedure Build_Default_Init_Cond_Procedure_Body (Typ : Entity_Id);
1296 -- If type Typ is subject to pragma Default_Initial_Condition, build the
1297 -- body of the procedure which verifies the assumption of the pragma at
1298 -- run time. The generated body is added after the type declaration.
1300 --------------------------------------------
1301 -- Build_Default_Init_Cond_Procedure_Body --
1302 --------------------------------------------
1304 procedure Build_Default_Init_Cond_Procedure_Body (Typ : Entity_Id) is
1305 Param_Id : Entity_Id;
1306 -- The entity of the sole formal parameter of the default initial
1307 -- condition procedure.
1309 procedure Replace_Type_Reference (N : Node_Id);
1310 -- Replace a single reference to type Typ with a reference to formal
1311 -- parameter Param_Id.
1313 ----------------------------
1314 -- Replace_Type_Reference --
1315 ----------------------------
1317 procedure Replace_Type_Reference (N : Node_Id) is
1319 Rewrite (N, New_Occurrence_Of (Param_Id, Sloc (N)));
1320 end Replace_Type_Reference;
1322 procedure Replace_Type_References is
1323 new Replace_Type_References_Generic (Replace_Type_Reference);
1327 Loc : constant Source_Ptr := Sloc (Typ);
1328 Prag : constant Node_Id :=
1329 Get_Pragma (Typ, Pragma_Default_Initial_Condition);
1330 Proc_Id : constant Entity_Id := Default_Init_Cond_Procedure (Typ);
1331 Spec_Decl : constant Node_Id := Unit_Declaration_Node (Proc_Id);
1332 Body_Decl : Node_Id;
1336 -- Start of processing for Build_Default_Init_Cond_Procedure_Body
1339 -- The procedure should be generated only for [sub]types subject to
1340 -- pragma Default_Initial_Condition. Types that inherit the pragma do
1341 -- not get this specialized procedure.
1343 pragma Assert (Has_Default_Init_Cond (Typ));
1344 pragma Assert (Present (Prag));
1345 pragma Assert (Present (Proc_Id));
1347 -- Nothing to do if the body was already built
1349 if Present (Corresponding_Body (Spec_Decl)) then
1353 Param_Id := First_Formal (Proc_Id);
1355 -- The pragma has an argument. Note that the argument is analyzed
1356 -- after all references to the current instance of the type are
1359 if Present (Pragma_Argument_Associations (Prag)) then
1361 Get_Pragma_Arg (First (Pragma_Argument_Associations (Prag)));
1363 if Nkind (Expr) = N_Null then
1364 Stmt := Make_Null_Statement (Loc);
1366 -- Preserve the original argument of the pragma by replicating it.
1367 -- Replace all references to the current instance of the type with
1368 -- references to the formal parameter.
1371 Expr := New_Copy_Tree (Expr);
1372 Replace_Type_References (Expr, Typ);
1375 -- pragma Check (Default_Initial_Condition, <Expr>);
1379 Pragma_Identifier =>
1380 Make_Identifier (Loc, Name_Check),
1382 Pragma_Argument_Associations => New_List (
1383 Make_Pragma_Argument_Association (Loc,
1385 Make_Identifier (Loc,
1386 Chars => Name_Default_Initial_Condition)),
1387 Make_Pragma_Argument_Association (Loc,
1388 Expression => Expr)));
1391 -- Otherwise the pragma appears without an argument
1394 Stmt := Make_Null_Statement (Loc);
1398 -- procedure <Typ>Default_Init_Cond (I : <Typ>) is
1401 -- end <Typ>Default_Init_Cond;
1404 Make_Subprogram_Body (Loc,
1406 Copy_Separate_Tree (Specification (Spec_Decl)),
1407 Declarations => Empty_List,
1408 Handled_Statement_Sequence =>
1409 Make_Handled_Sequence_Of_Statements (Loc,
1410 Statements => New_List (Stmt)));
1412 -- Link the spec and body of the default initial condition procedure
1413 -- to prevent the generation of a duplicate body.
1415 Set_Corresponding_Body (Spec_Decl, Defining_Entity (Body_Decl));
1416 Set_Corresponding_Spec (Body_Decl, Proc_Id);
1418 Insert_After_And_Analyze (Declaration_Node (Typ), Body_Decl);
1419 end Build_Default_Init_Cond_Procedure_Body;
1426 -- Start of processing for Build_Default_Init_Cond_Procedure_Bodies
1429 -- Inspect the private declarations looking for [sub]type declarations
1431 Decl := First (Priv_Decls);
1432 while Present (Decl) loop
1433 if Nkind_In (Decl, N_Full_Type_Declaration,
1434 N_Subtype_Declaration)
1436 Typ := Defining_Entity (Decl);
1438 -- Guard against partially decorate types due to previous errors
1440 if Is_Type (Typ) then
1442 -- If the type is subject to pragma Default_Initial_Condition,
1443 -- generate the body of the internal procedure which verifies
1444 -- the assertion of the pragma at run time.
1446 if Has_Default_Init_Cond (Typ) then
1447 Build_Default_Init_Cond_Procedure_Body (Typ);
1449 -- A derived type inherits the default initial condition
1450 -- procedure from its parent type.
1452 elsif Has_Inherited_Default_Init_Cond (Typ) then
1453 Inherit_Default_Init_Cond_Procedure (Typ);
1460 end Build_Default_Init_Cond_Procedure_Bodies;
1462 ---------------------------------------------------
1463 -- Build_Default_Init_Cond_Procedure_Declaration --
1464 ---------------------------------------------------
1466 procedure Build_Default_Init_Cond_Procedure_Declaration (Typ : Entity_Id) is
1467 Loc : constant Source_Ptr := Sloc (Typ);
1468 Prag : constant Node_Id :=
1469 Get_Pragma (Typ, Pragma_Default_Initial_Condition);
1470 Proc_Id : Entity_Id;
1473 -- The procedure should be generated only for types subject to pragma
1474 -- Default_Initial_Condition. Types that inherit the pragma do not get
1475 -- this specialized procedure.
1477 pragma Assert (Has_Default_Init_Cond (Typ));
1478 pragma Assert (Present (Prag));
1480 -- Nothing to do if default initial condition procedure already built
1482 if Present (Default_Init_Cond_Procedure (Typ)) then
1487 Make_Defining_Identifier (Loc,
1488 Chars => New_External_Name (Chars (Typ), "Default_Init_Cond"));
1490 -- Associate default initial condition procedure with the private type
1492 Set_Ekind (Proc_Id, E_Procedure);
1493 Set_Is_Default_Init_Cond_Procedure (Proc_Id);
1494 Set_Default_Init_Cond_Procedure (Typ, Proc_Id);
1497 -- procedure <Typ>Default_Init_Cond (Inn : <Typ>);
1499 Insert_After_And_Analyze (Prag,
1500 Make_Subprogram_Declaration (Loc,
1502 Make_Procedure_Specification (Loc,
1503 Defining_Unit_Name => Proc_Id,
1504 Parameter_Specifications => New_List (
1505 Make_Parameter_Specification (Loc,
1506 Defining_Identifier => Make_Temporary (Loc, 'I'),
1507 Parameter_Type => New_Occurrence_Of (Typ, Loc))))));
1508 end Build_Default_Init_Cond_Procedure_Declaration;
1510 ---------------------------
1511 -- Build_Default_Subtype --
1512 ---------------------------
1514 function Build_Default_Subtype
1516 N : Node_Id) return Entity_Id
1518 Loc : constant Source_Ptr := Sloc (N);
1522 -- The base type that is to be constrained by the defaults
1525 if not Has_Discriminants (T) or else Is_Constrained (T) then
1529 Bas := Base_Type (T);
1531 -- If T is non-private but its base type is private, this is the
1532 -- completion of a subtype declaration whose parent type is private
1533 -- (see Complete_Private_Subtype in Sem_Ch3). The proper discriminants
1534 -- are to be found in the full view of the base. Check that the private
1535 -- status of T and its base differ.
1537 if Is_Private_Type (Bas)
1538 and then not Is_Private_Type (T)
1539 and then Present (Full_View (Bas))
1541 Bas := Full_View (Bas);
1544 Disc := First_Discriminant (T);
1546 if No (Discriminant_Default_Value (Disc)) then
1551 Act : constant Entity_Id := Make_Temporary (Loc, 'S');
1552 Constraints : constant List_Id := New_List;
1556 while Present (Disc) loop
1557 Append_To (Constraints,
1558 New_Copy_Tree (Discriminant_Default_Value (Disc)));
1559 Next_Discriminant (Disc);
1563 Make_Subtype_Declaration (Loc,
1564 Defining_Identifier => Act,
1565 Subtype_Indication =>
1566 Make_Subtype_Indication (Loc,
1567 Subtype_Mark => New_Occurrence_Of (Bas, Loc),
1569 Make_Index_Or_Discriminant_Constraint (Loc,
1570 Constraints => Constraints)));
1572 Insert_Action (N, Decl);
1576 end Build_Default_Subtype;
1578 --------------------------------------------
1579 -- Build_Discriminal_Subtype_Of_Component --
1580 --------------------------------------------
1582 function Build_Discriminal_Subtype_Of_Component
1583 (T : Entity_Id) return Node_Id
1585 Loc : constant Source_Ptr := Sloc (T);
1589 function Build_Discriminal_Array_Constraint return List_Id;
1590 -- If one or more of the bounds of the component depends on
1591 -- discriminants, build actual constraint using the discriminants
1594 function Build_Discriminal_Record_Constraint return List_Id;
1595 -- Similar to previous one, for discriminated components constrained by
1596 -- the discriminant of the enclosing object.
1598 ----------------------------------------
1599 -- Build_Discriminal_Array_Constraint --
1600 ----------------------------------------
1602 function Build_Discriminal_Array_Constraint return List_Id is
1603 Constraints : constant List_Id := New_List;
1611 Indx := First_Index (T);
1612 while Present (Indx) loop
1613 Old_Lo := Type_Low_Bound (Etype (Indx));
1614 Old_Hi := Type_High_Bound (Etype (Indx));
1616 if Denotes_Discriminant (Old_Lo) then
1617 Lo := New_Occurrence_Of (Discriminal (Entity (Old_Lo)), Loc);
1620 Lo := New_Copy_Tree (Old_Lo);
1623 if Denotes_Discriminant (Old_Hi) then
1624 Hi := New_Occurrence_Of (Discriminal (Entity (Old_Hi)), Loc);
1627 Hi := New_Copy_Tree (Old_Hi);
1630 Append (Make_Range (Loc, Lo, Hi), Constraints);
1635 end Build_Discriminal_Array_Constraint;
1637 -----------------------------------------
1638 -- Build_Discriminal_Record_Constraint --
1639 -----------------------------------------
1641 function Build_Discriminal_Record_Constraint return List_Id is
1642 Constraints : constant List_Id := New_List;
1647 D := First_Elmt (Discriminant_Constraint (T));
1648 while Present (D) loop
1649 if Denotes_Discriminant (Node (D)) then
1651 New_Occurrence_Of (Discriminal (Entity (Node (D))), Loc);
1653 D_Val := New_Copy_Tree (Node (D));
1656 Append (D_Val, Constraints);
1661 end Build_Discriminal_Record_Constraint;
1663 -- Start of processing for Build_Discriminal_Subtype_Of_Component
1666 if Ekind (T) = E_Array_Subtype then
1667 Id := First_Index (T);
1668 while Present (Id) loop
1669 if Denotes_Discriminant (Type_Low_Bound (Etype (Id)))
1671 Denotes_Discriminant (Type_High_Bound (Etype (Id)))
1673 return Build_Component_Subtype
1674 (Build_Discriminal_Array_Constraint, Loc, T);
1680 elsif Ekind (T) = E_Record_Subtype
1681 and then Has_Discriminants (T)
1682 and then not Has_Unknown_Discriminants (T)
1684 D := First_Elmt (Discriminant_Constraint (T));
1685 while Present (D) loop
1686 if Denotes_Discriminant (Node (D)) then
1687 return Build_Component_Subtype
1688 (Build_Discriminal_Record_Constraint, Loc, T);
1695 -- If none of the above, the actual and nominal subtypes are the same
1698 end Build_Discriminal_Subtype_Of_Component;
1700 ------------------------------
1701 -- Build_Elaboration_Entity --
1702 ------------------------------
1704 procedure Build_Elaboration_Entity (N : Node_Id; Spec_Id : Entity_Id) is
1705 Loc : constant Source_Ptr := Sloc (N);
1707 Elab_Ent : Entity_Id;
1709 procedure Set_Package_Name (Ent : Entity_Id);
1710 -- Given an entity, sets the fully qualified name of the entity in
1711 -- Name_Buffer, with components separated by double underscores. This
1712 -- is a recursive routine that climbs the scope chain to Standard.
1714 ----------------------
1715 -- Set_Package_Name --
1716 ----------------------
1718 procedure Set_Package_Name (Ent : Entity_Id) is
1720 if Scope (Ent) /= Standard_Standard then
1721 Set_Package_Name (Scope (Ent));
1724 Nam : constant String := Get_Name_String (Chars (Ent));
1726 Name_Buffer (Name_Len + 1) := '_';
1727 Name_Buffer (Name_Len + 2) := '_';
1728 Name_Buffer (Name_Len + 3 .. Name_Len + Nam'Length + 2) := Nam;
1729 Name_Len := Name_Len + Nam'Length + 2;
1733 Get_Name_String (Chars (Ent));
1735 end Set_Package_Name;
1737 -- Start of processing for Build_Elaboration_Entity
1740 -- Ignore call if already constructed
1742 if Present (Elaboration_Entity (Spec_Id)) then
1745 -- Ignore in ASIS mode, elaboration entity is not in source and plays
1746 -- no role in analysis.
1748 elsif ASIS_Mode then
1751 -- See if we need elaboration entity. We always need it for the dynamic
1752 -- elaboration model, since it is needed to properly generate the PE
1753 -- exception for access before elaboration.
1755 elsif Dynamic_Elaboration_Checks then
1758 -- For the static model, we don't need the elaboration counter if this
1759 -- unit is sure to have no elaboration code, since that means there
1760 -- is no elaboration unit to be called. Note that we can't just decide
1761 -- after the fact by looking to see whether there was elaboration code,
1762 -- because that's too late to make this decision.
1764 elsif Restriction_Active (No_Elaboration_Code) then
1767 -- Similarly, for the static model, we can skip the elaboration counter
1768 -- if we have the No_Multiple_Elaboration restriction, since for the
1769 -- static model, that's the only purpose of the counter (to avoid
1770 -- multiple elaboration).
1772 elsif Restriction_Active (No_Multiple_Elaboration) then
1776 -- Here we need the elaboration entity
1778 -- Construct name of elaboration entity as xxx_E, where xxx is the unit
1779 -- name with dots replaced by double underscore. We have to manually
1780 -- construct this name, since it will be elaborated in the outer scope,
1781 -- and thus will not have the unit name automatically prepended.
1783 Set_Package_Name (Spec_Id);
1784 Add_Str_To_Name_Buffer ("_E");
1786 -- Create elaboration counter
1788 Elab_Ent := Make_Defining_Identifier (Loc, Chars => Name_Find);
1789 Set_Elaboration_Entity (Spec_Id, Elab_Ent);
1792 Make_Object_Declaration (Loc,
1793 Defining_Identifier => Elab_Ent,
1794 Object_Definition =>
1795 New_Occurrence_Of (Standard_Short_Integer, Loc),
1796 Expression => Make_Integer_Literal (Loc, Uint_0));
1798 Push_Scope (Standard_Standard);
1799 Add_Global_Declaration (Decl);
1802 -- Reset True_Constant indication, since we will indeed assign a value
1803 -- to the variable in the binder main. We also kill the Current_Value
1804 -- and Last_Assignment fields for the same reason.
1806 Set_Is_True_Constant (Elab_Ent, False);
1807 Set_Current_Value (Elab_Ent, Empty);
1808 Set_Last_Assignment (Elab_Ent, Empty);
1810 -- We do not want any further qualification of the name (if we did not
1811 -- do this, we would pick up the name of the generic package in the case
1812 -- of a library level generic instantiation).
1814 Set_Has_Qualified_Name (Elab_Ent);
1815 Set_Has_Fully_Qualified_Name (Elab_Ent);
1816 end Build_Elaboration_Entity;
1818 --------------------------------
1819 -- Build_Explicit_Dereference --
1820 --------------------------------
1822 procedure Build_Explicit_Dereference
1826 Loc : constant Source_Ptr := Sloc (Expr);
1829 -- An entity of a type with a reference aspect is overloaded with
1830 -- both interpretations: with and without the dereference. Now that
1831 -- the dereference is made explicit, set the type of the node properly,
1832 -- to prevent anomalies in the backend. Same if the expression is an
1833 -- overloaded function call whose return type has a reference aspect.
1835 if Is_Entity_Name (Expr) then
1836 Set_Etype (Expr, Etype (Entity (Expr)));
1838 elsif Nkind (Expr) = N_Function_Call then
1839 Set_Etype (Expr, Etype (Name (Expr)));
1842 Set_Is_Overloaded (Expr, False);
1844 -- The expression will often be a generalized indexing that yields a
1845 -- container element that is then dereferenced, in which case the
1846 -- generalized indexing call is also non-overloaded.
1848 if Nkind (Expr) = N_Indexed_Component
1849 and then Present (Generalized_Indexing (Expr))
1851 Set_Is_Overloaded (Generalized_Indexing (Expr), False);
1855 Make_Explicit_Dereference (Loc,
1857 Make_Selected_Component (Loc,
1858 Prefix => Relocate_Node (Expr),
1859 Selector_Name => New_Occurrence_Of (Disc, Loc))));
1860 Set_Etype (Prefix (Expr), Etype (Disc));
1861 Set_Etype (Expr, Designated_Type (Etype (Disc)));
1862 end Build_Explicit_Dereference;
1864 -----------------------------------
1865 -- Cannot_Raise_Constraint_Error --
1866 -----------------------------------
1868 function Cannot_Raise_Constraint_Error (Expr : Node_Id) return Boolean is
1870 if Compile_Time_Known_Value (Expr) then
1873 elsif Do_Range_Check (Expr) then
1876 elsif Raises_Constraint_Error (Expr) then
1880 case Nkind (Expr) is
1881 when N_Identifier =>
1884 when N_Expanded_Name =>
1887 when N_Selected_Component =>
1888 return not Do_Discriminant_Check (Expr);
1890 when N_Attribute_Reference =>
1891 if Do_Overflow_Check (Expr) then
1894 elsif No (Expressions (Expr)) then
1902 N := First (Expressions (Expr));
1903 while Present (N) loop
1904 if Cannot_Raise_Constraint_Error (N) then
1915 when N_Type_Conversion =>
1916 if Do_Overflow_Check (Expr)
1917 or else Do_Length_Check (Expr)
1918 or else Do_Tag_Check (Expr)
1922 return Cannot_Raise_Constraint_Error (Expression (Expr));
1925 when N_Unchecked_Type_Conversion =>
1926 return Cannot_Raise_Constraint_Error (Expression (Expr));
1929 if Do_Overflow_Check (Expr) then
1932 return Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1939 if Do_Division_Check (Expr)
1941 Do_Overflow_Check (Expr)
1946 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
1948 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1967 N_Op_Shift_Right_Arithmetic |
1971 if Do_Overflow_Check (Expr) then
1975 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
1977 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1984 end Cannot_Raise_Constraint_Error;
1986 -----------------------------------------
1987 -- Check_Dynamically_Tagged_Expression --
1988 -----------------------------------------
1990 procedure Check_Dynamically_Tagged_Expression
1993 Related_Nod : Node_Id)
1996 pragma Assert (Is_Tagged_Type (Typ));
1998 -- In order to avoid spurious errors when analyzing the expanded code,
1999 -- this check is done only for nodes that come from source and for
2000 -- actuals of generic instantiations.
2002 if (Comes_From_Source (Related_Nod)
2003 or else In_Generic_Actual (Expr))
2004 and then (Is_Class_Wide_Type (Etype (Expr))
2005 or else Is_Dynamically_Tagged (Expr))
2006 and then Is_Tagged_Type (Typ)
2007 and then not Is_Class_Wide_Type (Typ)
2009 Error_Msg_N ("dynamically tagged expression not allowed!", Expr);
2011 end Check_Dynamically_Tagged_Expression;
2013 --------------------------
2014 -- Check_Fully_Declared --
2015 --------------------------
2017 procedure Check_Fully_Declared (T : Entity_Id; N : Node_Id) is
2019 if Ekind (T) = E_Incomplete_Type then
2021 -- Ada 2005 (AI-50217): If the type is available through a limited
2022 -- with_clause, verify that its full view has been analyzed.
2024 if From_Limited_With (T)
2025 and then Present (Non_Limited_View (T))
2026 and then Ekind (Non_Limited_View (T)) /= E_Incomplete_Type
2028 -- The non-limited view is fully declared
2034 ("premature usage of incomplete}", N, First_Subtype (T));
2037 -- Need comments for these tests ???
2039 elsif Has_Private_Component (T)
2040 and then not Is_Generic_Type (Root_Type (T))
2041 and then not In_Spec_Expression
2043 -- Special case: if T is the anonymous type created for a single
2044 -- task or protected object, use the name of the source object.
2046 if Is_Concurrent_Type (T)
2047 and then not Comes_From_Source (T)
2048 and then Nkind (N) = N_Object_Declaration
2051 ("type of& has incomplete component",
2052 N, Defining_Identifier (N));
2055 ("premature usage of incomplete}",
2056 N, First_Subtype (T));
2059 end Check_Fully_Declared;
2061 -------------------------------------
2062 -- Check_Function_Writable_Actuals --
2063 -------------------------------------
2065 procedure Check_Function_Writable_Actuals (N : Node_Id) is
2066 Writable_Actuals_List : Elist_Id := No_Elist;
2067 Identifiers_List : Elist_Id := No_Elist;
2068 Error_Node : Node_Id := Empty;
2070 procedure Collect_Identifiers (N : Node_Id);
2071 -- In a single traversal of subtree N collect in Writable_Actuals_List
2072 -- all the actuals of functions with writable actuals, and in the list
2073 -- Identifiers_List collect all the identifiers that are not actuals of
2074 -- functions with writable actuals. If a writable actual is referenced
2075 -- twice as writable actual then Error_Node is set to reference its
2076 -- second occurrence, the error is reported, and the tree traversal
2079 function Get_Function_Id (Call : Node_Id) return Entity_Id;
2080 -- Return the entity associated with the function call
2082 procedure Preanalyze_Without_Errors (N : Node_Id);
2083 -- Preanalyze N without reporting errors. Very dubious, you can't just
2084 -- go analyzing things more than once???
2086 -------------------------
2087 -- Collect_Identifiers --
2088 -------------------------
2090 procedure Collect_Identifiers (N : Node_Id) is
2092 function Check_Node (N : Node_Id) return Traverse_Result;
2093 -- Process a single node during the tree traversal to collect the
2094 -- writable actuals of functions and all the identifiers which are
2095 -- not writable actuals of functions.
2097 function Contains (List : Elist_Id; N : Node_Id) return Boolean;
2098 -- Returns True if List has a node whose Entity is Entity (N)
2100 -------------------------
2101 -- Check_Function_Call --
2102 -------------------------
2104 function Check_Node (N : Node_Id) return Traverse_Result is
2105 Is_Writable_Actual : Boolean := False;
2109 if Nkind (N) = N_Identifier then
2111 -- No analysis possible if the entity is not decorated
2113 if No (Entity (N)) then
2116 -- Don't collect identifiers of packages, called functions, etc
2118 elsif Ekind_In (Entity (N), E_Package,
2125 -- Analyze if N is a writable actual of a function
2127 elsif Nkind (Parent (N)) = N_Function_Call then
2129 Call : constant Node_Id := Parent (N);
2134 Id := Get_Function_Id (Call);
2136 -- In case of previous error, no check is possible
2142 Formal := First_Formal (Id);
2143 Actual := First_Actual (Call);
2144 while Present (Actual) and then Present (Formal) loop
2146 if Ekind_In (Formal, E_Out_Parameter,
2149 Is_Writable_Actual := True;
2155 Next_Formal (Formal);
2156 Next_Actual (Actual);
2161 if Is_Writable_Actual then
2162 if Contains (Writable_Actuals_List, N) then
2164 ("value may be affected by call to& "
2165 & "because order of evaluation is arbitrary", N, Id);
2170 Append_New_Elmt (N, To => Writable_Actuals_List);
2173 if Identifiers_List = No_Elist then
2174 Identifiers_List := New_Elmt_List;
2177 Append_Unique_Elmt (N, Identifiers_List);
2190 N : Node_Id) return Boolean
2192 pragma Assert (Nkind (N) in N_Has_Entity);
2197 if List = No_Elist then
2201 Elmt := First_Elmt (List);
2202 while Present (Elmt) loop
2203 if Entity (Node (Elmt)) = Entity (N) then
2217 procedure Do_Traversal is new Traverse_Proc (Check_Node);
2218 -- The traversal procedure
2220 -- Start of processing for Collect_Identifiers
2223 if Present (Error_Node) then
2227 if Nkind (N) in N_Subexpr and then Is_OK_Static_Expression (N) then
2232 end Collect_Identifiers;
2234 ---------------------
2235 -- Get_Function_Id --
2236 ---------------------
2238 function Get_Function_Id (Call : Node_Id) return Entity_Id is
2239 Nam : constant Node_Id := Name (Call);
2243 if Nkind (Nam) = N_Explicit_Dereference then
2245 pragma Assert (Ekind (Id) = E_Subprogram_Type);
2247 elsif Nkind (Nam) = N_Selected_Component then
2248 Id := Entity (Selector_Name (Nam));
2250 elsif Nkind (Nam) = N_Indexed_Component then
2251 Id := Entity (Selector_Name (Prefix (Nam)));
2258 end Get_Function_Id;
2260 ---------------------------
2261 -- Preanalyze_Expression --
2262 ---------------------------
2264 procedure Preanalyze_Without_Errors (N : Node_Id) is
2265 Status : constant Boolean := Get_Ignore_Errors;
2267 Set_Ignore_Errors (True);
2269 Set_Ignore_Errors (Status);
2270 end Preanalyze_Without_Errors;
2272 -- Start of processing for Check_Function_Writable_Actuals
2275 -- The check only applies to Ada 2012 code, and only to constructs that
2276 -- have multiple constituents whose order of evaluation is not specified
2279 if Ada_Version < Ada_2012
2280 or else (not (Nkind (N) in N_Op)
2281 and then not (Nkind (N) in N_Membership_Test)
2282 and then not Nkind_In (N, N_Range,
2284 N_Extension_Aggregate,
2285 N_Full_Type_Declaration,
2287 N_Procedure_Call_Statement,
2288 N_Entry_Call_Statement))
2289 or else (Nkind (N) = N_Full_Type_Declaration
2290 and then not Is_Record_Type (Defining_Identifier (N)))
2292 -- In addition, this check only applies to source code, not to code
2293 -- generated by constraint checks.
2295 or else not Comes_From_Source (N)
2300 -- If a construct C has two or more direct constituents that are names
2301 -- or expressions whose evaluation may occur in an arbitrary order, at
2302 -- least one of which contains a function call with an in out or out
2303 -- parameter, then the construct is legal only if: for each name N that
2304 -- is passed as a parameter of mode in out or out to some inner function
2305 -- call C2 (not including the construct C itself), there is no other
2306 -- name anywhere within a direct constituent of the construct C other
2307 -- than the one containing C2, that is known to refer to the same
2308 -- object (RM 6.4.1(6.17/3)).
2312 Collect_Identifiers (Low_Bound (N));
2313 Collect_Identifiers (High_Bound (N));
2315 when N_Op | N_Membership_Test =>
2320 Collect_Identifiers (Left_Opnd (N));
2322 if Present (Right_Opnd (N)) then
2323 Collect_Identifiers (Right_Opnd (N));
2326 if Nkind_In (N, N_In, N_Not_In)
2327 and then Present (Alternatives (N))
2329 Expr := First (Alternatives (N));
2330 while Present (Expr) loop
2331 Collect_Identifiers (Expr);
2338 when N_Full_Type_Declaration =>
2340 function Get_Record_Part (N : Node_Id) return Node_Id;
2341 -- Return the record part of this record type definition
2343 function Get_Record_Part (N : Node_Id) return Node_Id is
2344 Type_Def : constant Node_Id := Type_Definition (N);
2346 if Nkind (Type_Def) = N_Derived_Type_Definition then
2347 return Record_Extension_Part (Type_Def);
2351 end Get_Record_Part;
2354 Def_Id : Entity_Id := Defining_Identifier (N);
2355 Rec : Node_Id := Get_Record_Part (N);
2358 -- No need to perform any analysis if the record has no
2361 if No (Rec) or else No (Component_List (Rec)) then
2365 -- Collect the identifiers starting from the deepest
2366 -- derivation. Done to report the error in the deepest
2370 if Present (Component_List (Rec)) then
2371 Comp := First (Component_Items (Component_List (Rec)));
2372 while Present (Comp) loop
2373 if Nkind (Comp) = N_Component_Declaration
2374 and then Present (Expression (Comp))
2376 Collect_Identifiers (Expression (Comp));
2383 exit when No (Underlying_Type (Etype (Def_Id)))
2384 or else Base_Type (Underlying_Type (Etype (Def_Id)))
2387 Def_Id := Base_Type (Underlying_Type (Etype (Def_Id)));
2388 Rec := Get_Record_Part (Parent (Def_Id));
2392 when N_Subprogram_Call |
2393 N_Entry_Call_Statement =>
2395 Id : constant Entity_Id := Get_Function_Id (N);
2400 Formal := First_Formal (Id);
2401 Actual := First_Actual (N);
2402 while Present (Actual) and then Present (Formal) loop
2403 if Ekind_In (Formal, E_Out_Parameter,
2406 Collect_Identifiers (Actual);
2409 Next_Formal (Formal);
2410 Next_Actual (Actual);
2415 N_Extension_Aggregate =>
2419 Comp_Expr : Node_Id;
2422 -- Handle the N_Others_Choice of array aggregates with static
2423 -- bounds. There is no need to perform this analysis in
2424 -- aggregates without static bounds since we cannot evaluate
2425 -- if the N_Others_Choice covers several elements. There is
2426 -- no need to handle the N_Others choice of record aggregates
2427 -- since at this stage it has been already expanded by
2428 -- Resolve_Record_Aggregate.
2430 if Is_Array_Type (Etype (N))
2431 and then Nkind (N) = N_Aggregate
2432 and then Present (Aggregate_Bounds (N))
2433 and then Compile_Time_Known_Bounds (Etype (N))
2434 and then Expr_Value (High_Bound (Aggregate_Bounds (N)))
2436 Expr_Value (Low_Bound (Aggregate_Bounds (N)))
2439 Count_Components : Uint := Uint_0;
2440 Num_Components : Uint;
2441 Others_Assoc : Node_Id;
2442 Others_Choice : Node_Id := Empty;
2443 Others_Box_Present : Boolean := False;
2446 -- Count positional associations
2448 if Present (Expressions (N)) then
2449 Comp_Expr := First (Expressions (N));
2450 while Present (Comp_Expr) loop
2451 Count_Components := Count_Components + 1;
2456 -- Count the rest of elements and locate the N_Others
2459 Assoc := First (Component_Associations (N));
2460 while Present (Assoc) loop
2461 Choice := First (Choices (Assoc));
2462 while Present (Choice) loop
2463 if Nkind (Choice) = N_Others_Choice then
2464 Others_Assoc := Assoc;
2465 Others_Choice := Choice;
2466 Others_Box_Present := Box_Present (Assoc);
2468 -- Count several components
2470 elsif Nkind_In (Choice, N_Range,
2471 N_Subtype_Indication)
2472 or else (Is_Entity_Name (Choice)
2473 and then Is_Type (Entity (Choice)))
2478 Get_Index_Bounds (Choice, L, H);
2480 (Compile_Time_Known_Value (L)
2481 and then Compile_Time_Known_Value (H));
2484 + Expr_Value (H) - Expr_Value (L) + 1;
2487 -- Count single component. No other case available
2488 -- since we are handling an aggregate with static
2492 pragma Assert (Is_OK_Static_Expression (Choice)
2493 or else Nkind (Choice) = N_Identifier
2494 or else Nkind (Choice) = N_Integer_Literal);
2496 Count_Components := Count_Components + 1;
2506 Expr_Value (High_Bound (Aggregate_Bounds (N))) -
2507 Expr_Value (Low_Bound (Aggregate_Bounds (N))) + 1;
2509 pragma Assert (Count_Components <= Num_Components);
2511 -- Handle the N_Others choice if it covers several
2514 if Present (Others_Choice)
2515 and then (Num_Components - Count_Components) > 1
2517 if not Others_Box_Present then
2519 -- At this stage, if expansion is active, the
2520 -- expression of the others choice has not been
2521 -- analyzed. Hence we generate a duplicate and
2522 -- we analyze it silently to have available the
2523 -- minimum decoration required to collect the
2526 if not Expander_Active then
2527 Comp_Expr := Expression (Others_Assoc);
2530 New_Copy_Tree (Expression (Others_Assoc));
2531 Preanalyze_Without_Errors (Comp_Expr);
2534 Collect_Identifiers (Comp_Expr);
2536 if Writable_Actuals_List /= No_Elist then
2538 -- As suggested by Robert, at current stage we
2539 -- report occurrences of this case as warnings.
2542 ("writable function parameter may affect "
2543 & "value in other component because order "
2544 & "of evaluation is unspecified??",
2545 Node (First_Elmt (Writable_Actuals_List)));
2552 -- Handle ancestor part of extension aggregates
2554 if Nkind (N) = N_Extension_Aggregate then
2555 Collect_Identifiers (Ancestor_Part (N));
2558 -- Handle positional associations
2560 if Present (Expressions (N)) then
2561 Comp_Expr := First (Expressions (N));
2562 while Present (Comp_Expr) loop
2563 if not Is_OK_Static_Expression (Comp_Expr) then
2564 Collect_Identifiers (Comp_Expr);
2571 -- Handle discrete associations
2573 if Present (Component_Associations (N)) then
2574 Assoc := First (Component_Associations (N));
2575 while Present (Assoc) loop
2577 if not Box_Present (Assoc) then
2578 Choice := First (Choices (Assoc));
2579 while Present (Choice) loop
2581 -- For now we skip discriminants since it requires
2582 -- performing the analysis in two phases: first one
2583 -- analyzing discriminants and second one analyzing
2584 -- the rest of components since discriminants are
2585 -- evaluated prior to components: too much extra
2586 -- work to detect a corner case???
2588 if Nkind (Choice) in N_Has_Entity
2589 and then Present (Entity (Choice))
2590 and then Ekind (Entity (Choice)) = E_Discriminant
2594 elsif Box_Present (Assoc) then
2598 if not Analyzed (Expression (Assoc)) then
2600 New_Copy_Tree (Expression (Assoc));
2601 Set_Parent (Comp_Expr, Parent (N));
2602 Preanalyze_Without_Errors (Comp_Expr);
2604 Comp_Expr := Expression (Assoc);
2607 Collect_Identifiers (Comp_Expr);
2623 -- No further action needed if we already reported an error
2625 if Present (Error_Node) then
2629 -- Check if some writable argument of a function is referenced
2631 if Writable_Actuals_List /= No_Elist
2632 and then Identifiers_List /= No_Elist
2639 Elmt_1 := First_Elmt (Writable_Actuals_List);
2640 while Present (Elmt_1) loop
2641 Elmt_2 := First_Elmt (Identifiers_List);
2642 while Present (Elmt_2) loop
2643 if Entity (Node (Elmt_1)) = Entity (Node (Elmt_2)) then
2644 case Nkind (Parent (Node (Elmt_2))) is
2646 N_Component_Association |
2647 N_Component_Declaration =>
2649 ("value may be affected by call in other "
2650 & "component because they are evaluated "
2651 & "in unspecified order",
2654 when N_In | N_Not_In =>
2656 ("value may be affected by call in other "
2657 & "alternative because they are evaluated "
2658 & "in unspecified order",
2663 ("value of actual may be affected by call in "
2664 & "other actual because they are evaluated "
2665 & "in unspecified order",
2677 end Check_Function_Writable_Actuals;
2679 ----------------------------
2680 -- Check_Ghost_Completion --
2681 ----------------------------
2683 procedure Check_Ghost_Completion
2684 (Partial_View : Entity_Id;
2685 Full_View : Entity_Id)
2687 Policy : constant Name_Id := Policy_In_Effect (Name_Ghost);
2690 -- The Ghost policy in effect at the point of declaration and at the
2691 -- point of completion must match (SPARK RM 6.9(15)).
2693 if Is_Checked_Ghost_Entity (Partial_View)
2694 and then Policy = Name_Ignore
2696 Error_Msg_Sloc := Sloc (Full_View);
2698 Error_Msg_N ("incompatible ghost policies in effect", Partial_View);
2699 Error_Msg_N ("\& declared with ghost policy Check", Partial_View);
2700 Error_Msg_N ("\& completed # with ghost policy Ignore", Partial_View);
2702 elsif Is_Ignored_Ghost_Entity (Partial_View)
2703 and then Policy = Name_Check
2705 Error_Msg_Sloc := Sloc (Full_View);
2707 Error_Msg_N ("incompatible ghost policies in effect", Partial_View);
2708 Error_Msg_N ("\& declared with ghost policy Ignore", Partial_View);
2709 Error_Msg_N ("\& completed # with ghost policy Check", Partial_View);
2711 end Check_Ghost_Completion;
2713 ----------------------------
2714 -- Check_Ghost_Derivation --
2715 ----------------------------
2717 procedure Check_Ghost_Derivation (Typ : Entity_Id) is
2718 Parent_Typ : constant Entity_Id := Etype (Typ);
2720 Iface_Elmt : Elmt_Id;
2723 -- Allow untagged derivations from predefined types such as Integer as
2724 -- those are not Ghost by definition.
2726 if Is_Scalar_Type (Typ) and then Parent_Typ = Base_Type (Typ) then
2729 -- The parent type of a Ghost type extension must be Ghost
2731 elsif not Is_Ghost_Entity (Parent_Typ) then
2732 Error_Msg_N ("type extension & cannot be ghost", Typ);
2733 Error_Msg_NE ("\parent type & is not ghost", Typ, Parent_Typ);
2737 -- All progenitors (if any) must be Ghost as well
2739 if Is_Tagged_Type (Typ) and then Present (Interfaces (Typ)) then
2740 Iface_Elmt := First_Elmt (Interfaces (Typ));
2741 while Present (Iface_Elmt) loop
2742 Iface := Node (Iface_Elmt);
2744 if not Is_Ghost_Entity (Iface) then
2745 Error_Msg_N ("type extension & cannot be ghost", Typ);
2746 Error_Msg_NE ("\interface type & is not ghost", Typ, Iface);
2750 Next_Elmt (Iface_Elmt);
2753 end Check_Ghost_Derivation;
2755 --------------------------------
2756 -- Check_Implicit_Dereference --
2757 --------------------------------
2759 procedure Check_Implicit_Dereference (N : Node_Id; Typ : Entity_Id) is
2765 if Nkind (N) = N_Indexed_Component
2766 and then Present (Generalized_Indexing (N))
2768 Nam := Generalized_Indexing (N);
2773 if Ada_Version < Ada_2012
2774 or else not Has_Implicit_Dereference (Base_Type (Typ))
2778 elsif not Comes_From_Source (N)
2779 and then Nkind (N) /= N_Indexed_Component
2783 elsif Is_Entity_Name (Nam) and then Is_Type (Entity (Nam)) then
2787 Disc := First_Discriminant (Typ);
2788 while Present (Disc) loop
2789 if Has_Implicit_Dereference (Disc) then
2790 Desig := Designated_Type (Etype (Disc));
2791 Add_One_Interp (Nam, Disc, Desig);
2793 -- If the node is a generalized indexing, add interpretation
2794 -- to that node as well, for subsequent resolution.
2796 if Nkind (N) = N_Indexed_Component then
2797 Add_One_Interp (N, Disc, Desig);
2800 -- If the operation comes from a generic unit and the context
2801 -- is a selected component, the selector name may be global
2802 -- and set in the instance already. Remove the entity to
2803 -- force resolution of the selected component, and the
2804 -- generation of an explicit dereference if needed.
2807 and then Nkind (Parent (Nam)) = N_Selected_Component
2809 Set_Entity (Selector_Name (Parent (Nam)), Empty);
2815 Next_Discriminant (Disc);
2818 end Check_Implicit_Dereference;
2820 ----------------------------------
2821 -- Check_Internal_Protected_Use --
2822 ----------------------------------
2824 procedure Check_Internal_Protected_Use (N : Node_Id; Nam : Entity_Id) is
2830 while Present (S) loop
2831 if S = Standard_Standard then
2834 elsif Ekind (S) = E_Function
2835 and then Ekind (Scope (S)) = E_Protected_Type
2844 if Scope (Nam) = Prot and then Ekind (Nam) /= E_Function then
2846 -- An indirect function call (e.g. a callback within a protected
2847 -- function body) is not statically illegal. If the access type is
2848 -- anonymous and is the type of an access parameter, the scope of Nam
2849 -- will be the protected type, but it is not a protected operation.
2851 if Ekind (Nam) = E_Subprogram_Type
2853 Nkind (Associated_Node_For_Itype (Nam)) = N_Function_Specification
2857 elsif Nkind (N) = N_Subprogram_Renaming_Declaration then
2859 ("within protected function cannot use protected "
2860 & "procedure in renaming or as generic actual", N);
2862 elsif Nkind (N) = N_Attribute_Reference then
2864 ("within protected function cannot take access of "
2865 & " protected procedure", N);
2869 ("within protected function, protected object is constant", N);
2871 ("\cannot call operation that may modify it", N);
2874 end Check_Internal_Protected_Use;
2876 ---------------------------------------
2877 -- Check_Later_Vs_Basic_Declarations --
2878 ---------------------------------------
2880 procedure Check_Later_Vs_Basic_Declarations
2882 During_Parsing : Boolean)
2884 Body_Sloc : Source_Ptr;
2887 function Is_Later_Declarative_Item (Decl : Node_Id) return Boolean;
2888 -- Return whether Decl is considered as a declarative item.
2889 -- When During_Parsing is True, the semantics of Ada 83 is followed.
2890 -- When During_Parsing is False, the semantics of SPARK is followed.
2892 -------------------------------
2893 -- Is_Later_Declarative_Item --
2894 -------------------------------
2896 function Is_Later_Declarative_Item (Decl : Node_Id) return Boolean is
2898 if Nkind (Decl) in N_Later_Decl_Item then
2901 elsif Nkind (Decl) = N_Pragma then
2904 elsif During_Parsing then
2907 -- In SPARK, a package declaration is not considered as a later
2908 -- declarative item.
2910 elsif Nkind (Decl) = N_Package_Declaration then
2913 -- In SPARK, a renaming is considered as a later declarative item
2915 elsif Nkind (Decl) in N_Renaming_Declaration then
2921 end Is_Later_Declarative_Item;
2923 -- Start of Check_Later_Vs_Basic_Declarations
2926 Decl := First (Decls);
2928 -- Loop through sequence of basic declarative items
2930 Outer : while Present (Decl) loop
2931 if not Nkind_In (Decl, N_Subprogram_Body, N_Package_Body, N_Task_Body)
2932 and then Nkind (Decl) not in N_Body_Stub
2936 -- Once a body is encountered, we only allow later declarative
2937 -- items. The inner loop checks the rest of the list.
2940 Body_Sloc := Sloc (Decl);
2942 Inner : while Present (Decl) loop
2943 if not Is_Later_Declarative_Item (Decl) then
2944 if During_Parsing then
2945 if Ada_Version = Ada_83 then
2946 Error_Msg_Sloc := Body_Sloc;
2948 ("(Ada 83) decl cannot appear after body#", Decl);
2951 Error_Msg_Sloc := Body_Sloc;
2952 Check_SPARK_05_Restriction
2953 ("decl cannot appear after body#", Decl);
2961 end Check_Later_Vs_Basic_Declarations;
2963 -------------------------
2964 -- Check_Nested_Access --
2965 -------------------------
2967 procedure Check_Nested_Access (Ent : Entity_Id) is
2968 Scop : constant Entity_Id := Current_Scope;
2969 Current_Subp : Entity_Id;
2970 Enclosing : Entity_Id;
2973 -- Currently only enabled for VM back-ends for efficiency, should we
2974 -- enable it more systematically ???
2976 -- Check for Is_Imported needs commenting below ???
2978 if VM_Target /= No_VM
2979 and then Ekind_In (Ent, E_Variable, E_Constant, E_Loop_Parameter)
2980 and then Scope (Ent) /= Empty
2981 and then not Is_Library_Level_Entity (Ent)
2982 and then not Is_Imported (Ent)
2984 if Is_Subprogram (Scop)
2985 or else Is_Generic_Subprogram (Scop)
2986 or else Is_Entry (Scop)
2988 Current_Subp := Scop;
2990 Current_Subp := Current_Subprogram;
2993 Enclosing := Enclosing_Subprogram (Ent);
2995 if Enclosing /= Empty and then Enclosing /= Current_Subp then
2996 Set_Has_Up_Level_Access (Ent, True);
2999 end Check_Nested_Access;
3001 ---------------------------
3002 -- Check_No_Hidden_State --
3003 ---------------------------
3005 procedure Check_No_Hidden_State (Id : Entity_Id) is
3006 function Has_Null_Abstract_State (Pkg : Entity_Id) return Boolean;
3007 -- Determine whether the entity of a package denoted by Pkg has a null
3010 -----------------------------
3011 -- Has_Null_Abstract_State --
3012 -----------------------------
3014 function Has_Null_Abstract_State (Pkg : Entity_Id) return Boolean is
3015 States : constant Elist_Id := Abstract_States (Pkg);
3018 -- Check first available state of related package. A null abstract
3019 -- state always appears as the sole element of the state list.
3023 and then Is_Null_State (Node (First_Elmt (States)));
3024 end Has_Null_Abstract_State;
3028 Context : Entity_Id := Empty;
3029 Not_Visible : Boolean := False;
3032 -- Start of processing for Check_No_Hidden_State
3035 pragma Assert (Ekind_In (Id, E_Abstract_State, E_Variable));
3037 -- Find the proper context where the object or state appears
3040 while Present (Scop) loop
3043 -- Keep track of the context's visibility
3045 Not_Visible := Not_Visible or else In_Private_Part (Context);
3047 -- Prevent the search from going too far
3049 if Context = Standard_Standard then
3052 -- Objects and states that appear immediately within a subprogram or
3053 -- inside a construct nested within a subprogram do not introduce a
3054 -- hidden state. They behave as local variable declarations.
3056 elsif Is_Subprogram (Context) then
3059 -- When examining a package body, use the entity of the spec as it
3060 -- carries the abstract state declarations.
3062 elsif Ekind (Context) = E_Package_Body then
3063 Context := Spec_Entity (Context);
3066 -- Stop the traversal when a package subject to a null abstract state
3069 if Ekind_In (Context, E_Generic_Package, E_Package)
3070 and then Has_Null_Abstract_State (Context)
3075 Scop := Scope (Scop);
3078 -- At this point we know that there is at least one package with a null
3079 -- abstract state in visibility. Emit an error message unconditionally
3080 -- if the entity being processed is a state because the placement of the
3081 -- related package is irrelevant. This is not the case for objects as
3082 -- the intermediate context matters.
3084 if Present (Context)
3085 and then (Ekind (Id) = E_Abstract_State or else Not_Visible)
3087 Error_Msg_N ("cannot introduce hidden state &", Id);
3088 Error_Msg_NE ("\package & has null abstract state", Id, Context);
3090 end Check_No_Hidden_State;
3092 ------------------------------------------
3093 -- Check_Potentially_Blocking_Operation --
3094 ------------------------------------------
3096 procedure Check_Potentially_Blocking_Operation (N : Node_Id) is
3100 -- N is one of the potentially blocking operations listed in 9.5.1(8).
3101 -- When pragma Detect_Blocking is active, the run time will raise
3102 -- Program_Error. Here we only issue a warning, since we generally
3103 -- support the use of potentially blocking operations in the absence
3106 -- Indirect blocking through a subprogram call cannot be diagnosed
3107 -- statically without interprocedural analysis, so we do not attempt
3110 S := Scope (Current_Scope);
3111 while Present (S) and then S /= Standard_Standard loop
3112 if Is_Protected_Type (S) then
3114 ("potentially blocking operation in protected operation??", N);
3120 end Check_Potentially_Blocking_Operation;
3122 ---------------------------------
3123 -- Check_Result_And_Post_State --
3124 ---------------------------------
3126 procedure Check_Result_And_Post_State
3128 Result_Seen : in out Boolean)
3130 procedure Check_Expression (Expr : Node_Id);
3131 -- Perform the 'Result and post-state checks on a given expression
3133 function Is_Function_Result (N : Node_Id) return Traverse_Result;
3134 -- Attempt to find attribute 'Result in a subtree denoted by N
3136 function Is_Trivial_Boolean (N : Node_Id) return Boolean;
3137 -- Determine whether source node N denotes "True" or "False"
3139 function Mentions_Post_State (N : Node_Id) return Boolean;
3140 -- Determine whether a subtree denoted by N mentions any construct that
3141 -- denotes a post-state.
3143 procedure Check_Function_Result is
3144 new Traverse_Proc (Is_Function_Result);
3146 ----------------------
3147 -- Check_Expression --
3148 ----------------------
3150 procedure Check_Expression (Expr : Node_Id) is
3152 if not Is_Trivial_Boolean (Expr) then
3153 Check_Function_Result (Expr);
3155 if not Mentions_Post_State (Expr) then
3156 if Pragma_Name (Prag) = Name_Contract_Cases then
3158 ("contract case refers only to pre-state?T?", Expr);
3160 elsif Pragma_Name (Prag) = Name_Refined_Post then
3162 ("refined postcondition refers only to pre-state?T?",
3167 ("postcondition refers only to pre-state?T?", Prag);
3171 end Check_Expression;
3173 ------------------------
3174 -- Is_Function_Result --
3175 ------------------------
3177 function Is_Function_Result (N : Node_Id) return Traverse_Result is
3179 if Is_Attribute_Result (N) then
3180 Result_Seen := True;
3183 -- Continue the traversal
3188 end Is_Function_Result;
3190 ------------------------
3191 -- Is_Trivial_Boolean --
3192 ------------------------
3194 function Is_Trivial_Boolean (N : Node_Id) return Boolean is
3197 Comes_From_Source (N)
3198 and then Is_Entity_Name (N)
3199 and then (Entity (N) = Standard_True
3201 Entity (N) = Standard_False);
3202 end Is_Trivial_Boolean;
3204 -------------------------
3205 -- Mentions_Post_State --
3206 -------------------------
3208 function Mentions_Post_State (N : Node_Id) return Boolean is
3209 Post_State_Seen : Boolean := False;
3211 function Is_Post_State (N : Node_Id) return Traverse_Result;
3212 -- Attempt to find a construct that denotes a post-state. If this is
3213 -- the case, set flag Post_State_Seen.
3219 function Is_Post_State (N : Node_Id) return Traverse_Result is
3223 if Nkind_In (N, N_Explicit_Dereference, N_Function_Call) then
3224 Post_State_Seen := True;
3227 elsif Nkind_In (N, N_Expanded_Name, N_Identifier) then
3230 -- The entity may be modifiable through an implicit dereference
3233 or else Ekind (Ent) in Assignable_Kind
3234 or else (Is_Access_Type (Etype (Ent))
3235 and then Nkind (Parent (N)) = N_Selected_Component)
3237 Post_State_Seen := True;
3241 elsif Nkind (N) = N_Attribute_Reference then
3242 if Attribute_Name (N) = Name_Old then
3245 elsif Attribute_Name (N) = Name_Result then
3246 Post_State_Seen := True;
3254 procedure Find_Post_State is new Traverse_Proc (Is_Post_State);
3256 -- Start of processing for Mentions_Post_State
3259 Find_Post_State (N);
3261 return Post_State_Seen;
3262 end Mentions_Post_State;
3266 Expr : constant Node_Id :=
3267 Get_Pragma_Arg (First (Pragma_Argument_Associations (Prag)));
3268 Nam : constant Name_Id := Pragma_Name (Prag);
3271 -- Start of processing for Check_Result_And_Post_State
3274 -- Examine all consequences
3276 if Nam = Name_Contract_Cases then
3277 CCase := First (Component_Associations (Expr));
3278 while Present (CCase) loop
3279 Check_Expression (Expression (CCase));
3284 -- Examine the expression of a postcondition
3286 else pragma Assert (Nam_In (Nam, Name_Postcondition, Name_Refined_Post));
3287 Check_Expression (Expr);
3289 end Check_Result_And_Post_State;
3291 ------------------------------
3292 -- Check_Unprotected_Access --
3293 ------------------------------
3295 procedure Check_Unprotected_Access
3299 Cont_Encl_Typ : Entity_Id;
3300 Pref_Encl_Typ : Entity_Id;
3302 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id;
3303 -- Check whether Obj is a private component of a protected object.
3304 -- Return the protected type where the component resides, Empty
3307 function Is_Public_Operation return Boolean;
3308 -- Verify that the enclosing operation is callable from outside the
3309 -- protected object, to minimize false positives.
3311 ------------------------------
3312 -- Enclosing_Protected_Type --
3313 ------------------------------
3315 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id is
3317 if Is_Entity_Name (Obj) then
3319 Ent : Entity_Id := Entity (Obj);
3322 -- The object can be a renaming of a private component, use
3323 -- the original record component.
3325 if Is_Prival (Ent) then
3326 Ent := Prival_Link (Ent);
3329 if Is_Protected_Type (Scope (Ent)) then
3335 -- For indexed and selected components, recursively check the prefix
3337 if Nkind_In (Obj, N_Indexed_Component, N_Selected_Component) then
3338 return Enclosing_Protected_Type (Prefix (Obj));
3340 -- The object does not denote a protected component
3345 end Enclosing_Protected_Type;
3347 -------------------------
3348 -- Is_Public_Operation --
3349 -------------------------
3351 function Is_Public_Operation return Boolean is
3357 while Present (S) and then S /= Pref_Encl_Typ loop
3358 if Scope (S) = Pref_Encl_Typ then
3359 E := First_Entity (Pref_Encl_Typ);
3361 and then E /= First_Private_Entity (Pref_Encl_Typ)
3375 end Is_Public_Operation;
3377 -- Start of processing for Check_Unprotected_Access
3380 if Nkind (Expr) = N_Attribute_Reference
3381 and then Attribute_Name (Expr) = Name_Unchecked_Access
3383 Cont_Encl_Typ := Enclosing_Protected_Type (Context);
3384 Pref_Encl_Typ := Enclosing_Protected_Type (Prefix (Expr));
3386 -- Check whether we are trying to export a protected component to a
3387 -- context with an equal or lower access level.
3389 if Present (Pref_Encl_Typ)
3390 and then No (Cont_Encl_Typ)
3391 and then Is_Public_Operation
3392 and then Scope_Depth (Pref_Encl_Typ) >=
3393 Object_Access_Level (Context)
3396 ("??possible unprotected access to protected data", Expr);
3399 end Check_Unprotected_Access;
3401 ------------------------
3402 -- Collect_Interfaces --
3403 ------------------------
3405 procedure Collect_Interfaces
3407 Ifaces_List : out Elist_Id;
3408 Exclude_Parents : Boolean := False;
3409 Use_Full_View : Boolean := True)
3411 procedure Collect (Typ : Entity_Id);
3412 -- Subsidiary subprogram used to traverse the whole list
3413 -- of directly and indirectly implemented interfaces
3419 procedure Collect (Typ : Entity_Id) is
3420 Ancestor : Entity_Id;
3428 -- Handle private types
3431 and then Is_Private_Type (Typ)
3432 and then Present (Full_View (Typ))
3434 Full_T := Full_View (Typ);
3437 -- Include the ancestor if we are generating the whole list of
3438 -- abstract interfaces.
3440 if Etype (Full_T) /= Typ
3442 -- Protect the frontend against wrong sources. For example:
3445 -- type A is tagged null record;
3446 -- type B is new A with private;
3447 -- type C is new A with private;
3449 -- type B is new C with null record;
3450 -- type C is new B with null record;
3453 and then Etype (Full_T) /= T
3455 Ancestor := Etype (Full_T);
3458 if Is_Interface (Ancestor) and then not Exclude_Parents then
3459 Append_Unique_Elmt (Ancestor, Ifaces_List);
3463 -- Traverse the graph of ancestor interfaces
3465 if Is_Non_Empty_List (Abstract_Interface_List (Full_T)) then
3466 Id := First (Abstract_Interface_List (Full_T));
3467 while Present (Id) loop
3468 Iface := Etype (Id);
3470 -- Protect against wrong uses. For example:
3471 -- type I is interface;
3472 -- type O is tagged null record;
3473 -- type Wrong is new I and O with null record; -- ERROR
3475 if Is_Interface (Iface) then
3477 and then Etype (T) /= T
3478 and then Interface_Present_In_Ancestor (Etype (T), Iface)
3483 Append_Unique_Elmt (Iface, Ifaces_List);
3492 -- Start of processing for Collect_Interfaces
3495 pragma Assert (Is_Tagged_Type (T) or else Is_Concurrent_Type (T));
3496 Ifaces_List := New_Elmt_List;
3498 end Collect_Interfaces;
3500 ----------------------------------
3501 -- Collect_Interface_Components --
3502 ----------------------------------
3504 procedure Collect_Interface_Components
3505 (Tagged_Type : Entity_Id;
3506 Components_List : out Elist_Id)
3508 procedure Collect (Typ : Entity_Id);
3509 -- Subsidiary subprogram used to climb to the parents
3515 procedure Collect (Typ : Entity_Id) is
3516 Tag_Comp : Entity_Id;
3517 Parent_Typ : Entity_Id;
3520 -- Handle private types
3522 if Present (Full_View (Etype (Typ))) then
3523 Parent_Typ := Full_View (Etype (Typ));
3525 Parent_Typ := Etype (Typ);
3528 if Parent_Typ /= Typ
3530 -- Protect the frontend against wrong sources. For example:
3533 -- type A is tagged null record;
3534 -- type B is new A with private;
3535 -- type C is new A with private;
3537 -- type B is new C with null record;
3538 -- type C is new B with null record;
3541 and then Parent_Typ /= Tagged_Type
3543 Collect (Parent_Typ);
3546 -- Collect the components containing tags of secondary dispatch
3549 Tag_Comp := Next_Tag_Component (First_Tag_Component (Typ));
3550 while Present (Tag_Comp) loop
3551 pragma Assert (Present (Related_Type (Tag_Comp)));
3552 Append_Elmt (Tag_Comp, Components_List);
3554 Tag_Comp := Next_Tag_Component (Tag_Comp);
3558 -- Start of processing for Collect_Interface_Components
3561 pragma Assert (Ekind (Tagged_Type) = E_Record_Type
3562 and then Is_Tagged_Type (Tagged_Type));
3564 Components_List := New_Elmt_List;
3565 Collect (Tagged_Type);
3566 end Collect_Interface_Components;
3568 -----------------------------
3569 -- Collect_Interfaces_Info --
3570 -----------------------------
3572 procedure Collect_Interfaces_Info
3574 Ifaces_List : out Elist_Id;
3575 Components_List : out Elist_Id;
3576 Tags_List : out Elist_Id)
3578 Comps_List : Elist_Id;
3579 Comp_Elmt : Elmt_Id;
3580 Comp_Iface : Entity_Id;
3581 Iface_Elmt : Elmt_Id;
3584 function Search_Tag (Iface : Entity_Id) return Entity_Id;
3585 -- Search for the secondary tag associated with the interface type
3586 -- Iface that is implemented by T.
3592 function Search_Tag (Iface : Entity_Id) return Entity_Id is
3595 if not Is_CPP_Class (T) then
3596 ADT := Next_Elmt (Next_Elmt (First_Elmt (Access_Disp_Table (T))));
3598 ADT := Next_Elmt (First_Elmt (Access_Disp_Table (T)));
3602 and then Is_Tag (Node (ADT))
3603 and then Related_Type (Node (ADT)) /= Iface
3605 -- Skip secondary dispatch table referencing thunks to user
3606 -- defined primitives covered by this interface.
3608 pragma Assert (Has_Suffix (Node (ADT), 'P'));
3611 -- Skip secondary dispatch tables of Ada types
3613 if not Is_CPP_Class (T) then
3615 -- Skip secondary dispatch table referencing thunks to
3616 -- predefined primitives.
3618 pragma Assert (Has_Suffix (Node (ADT), 'Y'));
3621 -- Skip secondary dispatch table referencing user-defined
3622 -- primitives covered by this interface.
3624 pragma Assert (Has_Suffix (Node (ADT), 'D'));
3627 -- Skip secondary dispatch table referencing predefined
3630 pragma Assert (Has_Suffix (Node (ADT), 'Z'));
3635 pragma Assert (Is_Tag (Node (ADT)));
3639 -- Start of processing for Collect_Interfaces_Info
3642 Collect_Interfaces (T, Ifaces_List);
3643 Collect_Interface_Components (T, Comps_List);
3645 -- Search for the record component and tag associated with each
3646 -- interface type of T.
3648 Components_List := New_Elmt_List;
3649 Tags_List := New_Elmt_List;
3651 Iface_Elmt := First_Elmt (Ifaces_List);
3652 while Present (Iface_Elmt) loop
3653 Iface := Node (Iface_Elmt);
3655 -- Associate the primary tag component and the primary dispatch table
3656 -- with all the interfaces that are parents of T
3658 if Is_Ancestor (Iface, T, Use_Full_View => True) then
3659 Append_Elmt (First_Tag_Component (T), Components_List);
3660 Append_Elmt (Node (First_Elmt (Access_Disp_Table (T))), Tags_List);
3662 -- Otherwise search for the tag component and secondary dispatch
3666 Comp_Elmt := First_Elmt (Comps_List);
3667 while Present (Comp_Elmt) loop
3668 Comp_Iface := Related_Type (Node (Comp_Elmt));
3670 if Comp_Iface = Iface
3671 or else Is_Ancestor (Iface, Comp_Iface, Use_Full_View => True)
3673 Append_Elmt (Node (Comp_Elmt), Components_List);
3674 Append_Elmt (Search_Tag (Comp_Iface), Tags_List);
3678 Next_Elmt (Comp_Elmt);
3680 pragma Assert (Present (Comp_Elmt));
3683 Next_Elmt (Iface_Elmt);
3685 end Collect_Interfaces_Info;
3687 ---------------------
3688 -- Collect_Parents --
3689 ---------------------
3691 procedure Collect_Parents
3693 List : out Elist_Id;
3694 Use_Full_View : Boolean := True)
3696 Current_Typ : Entity_Id := T;
3697 Parent_Typ : Entity_Id;
3700 List := New_Elmt_List;
3702 -- No action if the if the type has no parents
3704 if T = Etype (T) then
3709 Parent_Typ := Etype (Current_Typ);
3711 if Is_Private_Type (Parent_Typ)
3712 and then Present (Full_View (Parent_Typ))
3713 and then Use_Full_View
3715 Parent_Typ := Full_View (Base_Type (Parent_Typ));
3718 Append_Elmt (Parent_Typ, List);
3720 exit when Parent_Typ = Current_Typ;
3721 Current_Typ := Parent_Typ;
3723 end Collect_Parents;
3725 ----------------------------------
3726 -- Collect_Primitive_Operations --
3727 ----------------------------------
3729 function Collect_Primitive_Operations (T : Entity_Id) return Elist_Id is
3730 B_Type : constant Entity_Id := Base_Type (T);
3731 B_Decl : constant Node_Id := Original_Node (Parent (B_Type));
3732 B_Scope : Entity_Id := Scope (B_Type);
3736 Is_Type_In_Pkg : Boolean;
3737 Formal_Derived : Boolean := False;
3740 function Match (E : Entity_Id) return Boolean;
3741 -- True if E's base type is B_Type, or E is of an anonymous access type
3742 -- and the base type of its designated type is B_Type.
3748 function Match (E : Entity_Id) return Boolean is
3749 Etyp : Entity_Id := Etype (E);
3752 if Ekind (Etyp) = E_Anonymous_Access_Type then
3753 Etyp := Designated_Type (Etyp);
3756 -- In Ada 2012 a primitive operation may have a formal of an
3757 -- incomplete view of the parent type.
3759 return Base_Type (Etyp) = B_Type
3761 (Ada_Version >= Ada_2012
3762 and then Ekind (Etyp) = E_Incomplete_Type
3763 and then Full_View (Etyp) = B_Type);
3766 -- Start of processing for Collect_Primitive_Operations
3769 -- For tagged types, the primitive operations are collected as they
3770 -- are declared, and held in an explicit list which is simply returned.
3772 if Is_Tagged_Type (B_Type) then
3773 return Primitive_Operations (B_Type);
3775 -- An untagged generic type that is a derived type inherits the
3776 -- primitive operations of its parent type. Other formal types only
3777 -- have predefined operators, which are not explicitly represented.
3779 elsif Is_Generic_Type (B_Type) then
3780 if Nkind (B_Decl) = N_Formal_Type_Declaration
3781 and then Nkind (Formal_Type_Definition (B_Decl)) =
3782 N_Formal_Derived_Type_Definition
3784 Formal_Derived := True;
3786 return New_Elmt_List;
3790 Op_List := New_Elmt_List;
3792 if B_Scope = Standard_Standard then
3793 if B_Type = Standard_String then
3794 Append_Elmt (Standard_Op_Concat, Op_List);
3796 elsif B_Type = Standard_Wide_String then
3797 Append_Elmt (Standard_Op_Concatw, Op_List);
3803 -- Locate the primitive subprograms of the type
3806 -- The primitive operations appear after the base type, except
3807 -- if the derivation happens within the private part of B_Scope
3808 -- and the type is a private type, in which case both the type
3809 -- and some primitive operations may appear before the base
3810 -- type, and the list of candidates starts after the type.
3812 if In_Open_Scopes (B_Scope)
3813 and then Scope (T) = B_Scope
3814 and then In_Private_Part (B_Scope)
3816 Id := Next_Entity (T);
3818 -- In Ada 2012, If the type has an incomplete partial view, there
3819 -- may be primitive operations declared before the full view, so
3820 -- we need to start scanning from the incomplete view, which is
3821 -- earlier on the entity chain.
3823 elsif Nkind (Parent (B_Type)) = N_Full_Type_Declaration
3824 and then Present (Incomplete_View (Parent (B_Type)))
3826 Id := Defining_Entity (Incomplete_View (Parent (B_Type)));
3829 Id := Next_Entity (B_Type);
3832 -- Set flag if this is a type in a package spec
3835 Is_Package_Or_Generic_Package (B_Scope)
3837 Nkind (Parent (Declaration_Node (First_Subtype (T)))) /=
3840 while Present (Id) loop
3842 -- Test whether the result type or any of the parameter types of
3843 -- each subprogram following the type match that type when the
3844 -- type is declared in a package spec, is a derived type, or the
3845 -- subprogram is marked as primitive. (The Is_Primitive test is
3846 -- needed to find primitives of nonderived types in declarative
3847 -- parts that happen to override the predefined "=" operator.)
3849 -- Note that generic formal subprograms are not considered to be
3850 -- primitive operations and thus are never inherited.
3852 if Is_Overloadable (Id)
3853 and then (Is_Type_In_Pkg
3854 or else Is_Derived_Type (B_Type)
3855 or else Is_Primitive (Id))
3856 and then Nkind (Parent (Parent (Id)))
3857 not in N_Formal_Subprogram_Declaration
3865 Formal := First_Formal (Id);
3866 while Present (Formal) loop
3867 if Match (Formal) then
3872 Next_Formal (Formal);
3876 -- For a formal derived type, the only primitives are the ones
3877 -- inherited from the parent type. Operations appearing in the
3878 -- package declaration are not primitive for it.
3881 and then (not Formal_Derived or else Present (Alias (Id)))
3883 -- In the special case of an equality operator aliased to
3884 -- an overriding dispatching equality belonging to the same
3885 -- type, we don't include it in the list of primitives.
3886 -- This avoids inheriting multiple equality operators when
3887 -- deriving from untagged private types whose full type is
3888 -- tagged, which can otherwise cause ambiguities. Note that
3889 -- this should only happen for this kind of untagged parent
3890 -- type, since normally dispatching operations are inherited
3891 -- using the type's Primitive_Operations list.
3893 if Chars (Id) = Name_Op_Eq
3894 and then Is_Dispatching_Operation (Id)
3895 and then Present (Alias (Id))
3896 and then Present (Overridden_Operation (Alias (Id)))
3897 and then Base_Type (Etype (First_Entity (Id))) =
3898 Base_Type (Etype (First_Entity (Alias (Id))))
3902 -- Include the subprogram in the list of primitives
3905 Append_Elmt (Id, Op_List);
3912 -- For a type declared in System, some of its operations may
3913 -- appear in the target-specific extension to System.
3916 and then B_Scope = RTU_Entity (System)
3917 and then Present_System_Aux
3919 B_Scope := System_Aux_Id;
3920 Id := First_Entity (System_Aux_Id);
3926 end Collect_Primitive_Operations;
3928 -----------------------------------
3929 -- Compile_Time_Constraint_Error --
3930 -----------------------------------
3932 function Compile_Time_Constraint_Error
3935 Ent : Entity_Id := Empty;
3936 Loc : Source_Ptr := No_Location;
3937 Warn : Boolean := False) return Node_Id
3939 Msgc : String (1 .. Msg'Length + 3);
3940 -- Copy of message, with room for possible ?? or << and ! at end
3946 -- Start of processing for Compile_Time_Constraint_Error
3949 -- If this is a warning, convert it into an error if we are in code
3950 -- subject to SPARK_Mode being set ON.
3952 Error_Msg_Warn := SPARK_Mode /= On;
3954 -- A static constraint error in an instance body is not a fatal error.
3955 -- we choose to inhibit the message altogether, because there is no
3956 -- obvious node (for now) on which to post it. On the other hand the
3957 -- offending node must be replaced with a constraint_error in any case.
3959 -- No messages are generated if we already posted an error on this node
3961 if not Error_Posted (N) then
3962 if Loc /= No_Location then
3968 -- Copy message to Msgc, converting any ? in the message into
3969 -- < instead, so that we have an error in GNATprove mode.
3973 for J in 1 .. Msgl loop
3974 if Msg (J) = '?' and then (J = 1 or else Msg (J) /= ''') then
3977 Msgc (J) := Msg (J);
3981 -- Message is a warning, even in Ada 95 case
3983 if Msg (Msg'Last) = '?' or else Msg (Msg'Last) = '<' then
3986 -- In Ada 83, all messages are warnings. In the private part and
3987 -- the body of an instance, constraint_checks are only warnings.
3988 -- We also make this a warning if the Warn parameter is set.
3991 or else (Ada_Version = Ada_83 and then Comes_From_Source (N))
3999 elsif In_Instance_Not_Visible then
4006 -- Otherwise we have a real error message (Ada 95 static case)
4007 -- and we make this an unconditional message. Note that in the
4008 -- warning case we do not make the message unconditional, it seems
4009 -- quite reasonable to delete messages like this (about exceptions
4010 -- that will be raised) in dead code.
4018 -- One more test, skip the warning if the related expression is
4019 -- statically unevaluated, since we don't want to warn about what
4020 -- will happen when something is evaluated if it never will be
4023 if not Is_Statically_Unevaluated (N) then
4024 Error_Msg_Warn := SPARK_Mode /= On;
4026 if Present (Ent) then
4027 Error_Msg_NEL (Msgc (1 .. Msgl), N, Ent, Eloc);
4029 Error_Msg_NEL (Msgc (1 .. Msgl), N, Etype (N), Eloc);
4034 -- Check whether the context is an Init_Proc
4036 if Inside_Init_Proc then
4038 Conc_Typ : constant Entity_Id :=
4039 Corresponding_Concurrent_Type
4040 (Entity (Parameter_Type (First
4041 (Parameter_Specifications
4042 (Parent (Current_Scope))))));
4045 -- Don't complain if the corresponding concurrent type
4046 -- doesn't come from source (i.e. a single task/protected
4049 if Present (Conc_Typ)
4050 and then not Comes_From_Source (Conc_Typ)
4053 ("\& [<<", N, Standard_Constraint_Error, Eloc);
4056 if GNATprove_Mode then
4058 ("\& would have been raised for objects of this "
4059 & "type", N, Standard_Constraint_Error, Eloc);
4062 ("\& will be raised for objects of this type??",
4063 N, Standard_Constraint_Error, Eloc);
4069 Error_Msg_NEL ("\& [<<", N, Standard_Constraint_Error, Eloc);
4073 Error_Msg ("\static expression fails Constraint_Check", Eloc);
4074 Set_Error_Posted (N);
4080 end Compile_Time_Constraint_Error;
4082 -----------------------
4083 -- Conditional_Delay --
4084 -----------------------
4086 procedure Conditional_Delay (New_Ent, Old_Ent : Entity_Id) is
4088 if Has_Delayed_Freeze (Old_Ent) and then not Is_Frozen (Old_Ent) then
4089 Set_Has_Delayed_Freeze (New_Ent);
4091 end Conditional_Delay;
4093 ----------------------------
4094 -- Contains_Refined_State --
4095 ----------------------------
4097 function Contains_Refined_State (Prag : Node_Id) return Boolean is
4098 function Has_State_In_Dependency (List : Node_Id) return Boolean;
4099 -- Determine whether a dependency list mentions a state with a visible
4102 function Has_State_In_Global (List : Node_Id) return Boolean;
4103 -- Determine whether a global list mentions a state with a visible
4106 function Is_Refined_State (Item : Node_Id) return Boolean;
4107 -- Determine whether Item is a reference to an abstract state with a
4108 -- visible refinement.
4110 -----------------------------
4111 -- Has_State_In_Dependency --
4112 -----------------------------
4114 function Has_State_In_Dependency (List : Node_Id) return Boolean is
4119 -- A null dependency list does not mention any states
4121 if Nkind (List) = N_Null then
4124 -- Dependency clauses appear as component associations of an
4127 elsif Nkind (List) = N_Aggregate
4128 and then Present (Component_Associations (List))
4130 Clause := First (Component_Associations (List));
4131 while Present (Clause) loop
4133 -- Inspect the outputs of a dependency clause
4135 Output := First (Choices (Clause));
4136 while Present (Output) loop
4137 if Is_Refined_State (Output) then
4144 -- Inspect the outputs of a dependency clause
4146 if Is_Refined_State (Expression (Clause)) then
4153 -- If we get here, then none of the dependency clauses mention a
4154 -- state with visible refinement.
4158 -- An illegal pragma managed to sneak in
4161 raise Program_Error;
4163 end Has_State_In_Dependency;
4165 -------------------------
4166 -- Has_State_In_Global --
4167 -------------------------
4169 function Has_State_In_Global (List : Node_Id) return Boolean is
4173 -- A null global list does not mention any states
4175 if Nkind (List) = N_Null then
4178 -- Simple global list or moded global list declaration
4180 elsif Nkind (List) = N_Aggregate then
4182 -- The declaration of a simple global list appear as a collection
4185 if Present (Expressions (List)) then
4186 Item := First (Expressions (List));
4187 while Present (Item) loop
4188 if Is_Refined_State (Item) then
4195 -- The declaration of a moded global list appears as a collection
4196 -- of component associations where individual choices denote
4200 Item := First (Component_Associations (List));
4201 while Present (Item) loop
4202 if Has_State_In_Global (Expression (Item)) then
4210 -- If we get here, then the simple/moded global list did not
4211 -- mention any states with a visible refinement.
4215 -- Single global item declaration
4217 elsif Is_Entity_Name (List) then
4218 return Is_Refined_State (List);
4220 -- An illegal pragma managed to sneak in
4223 raise Program_Error;
4225 end Has_State_In_Global;
4227 ----------------------
4228 -- Is_Refined_State --
4229 ----------------------
4231 function Is_Refined_State (Item : Node_Id) return Boolean is
4233 Item_Id : Entity_Id;
4236 if Nkind (Item) = N_Null then
4239 -- States cannot be subject to attribute 'Result. This case arises
4240 -- in dependency relations.
4242 elsif Nkind (Item) = N_Attribute_Reference
4243 and then Attribute_Name (Item) = Name_Result
4247 -- Multiple items appear as an aggregate. This case arises in
4248 -- dependency relations.
4250 elsif Nkind (Item) = N_Aggregate
4251 and then Present (Expressions (Item))
4253 Elmt := First (Expressions (Item));
4254 while Present (Elmt) loop
4255 if Is_Refined_State (Elmt) then
4262 -- If we get here, then none of the inputs or outputs reference a
4263 -- state with visible refinement.
4270 Item_Id := Entity_Of (Item);
4274 and then Ekind (Item_Id) = E_Abstract_State
4275 and then Has_Visible_Refinement (Item_Id);
4277 end Is_Refined_State;
4281 Arg : constant Node_Id :=
4282 Get_Pragma_Arg (First (Pragma_Argument_Associations (Prag)));
4283 Nam : constant Name_Id := Pragma_Name (Prag);
4285 -- Start of processing for Contains_Refined_State
4288 if Nam = Name_Depends then
4289 return Has_State_In_Dependency (Arg);
4291 else pragma Assert (Nam = Name_Global);
4292 return Has_State_In_Global (Arg);
4294 end Contains_Refined_State;
4296 -------------------------
4297 -- Copy_Component_List --
4298 -------------------------
4300 function Copy_Component_List
4302 Loc : Source_Ptr) return List_Id
4305 Comps : constant List_Id := New_List;
4308 Comp := First_Component (Underlying_Type (R_Typ));
4309 while Present (Comp) loop
4310 if Comes_From_Source (Comp) then
4312 Comp_Decl : constant Node_Id := Declaration_Node (Comp);
4315 Make_Component_Declaration (Loc,
4316 Defining_Identifier =>
4317 Make_Defining_Identifier (Loc, Chars (Comp)),
4318 Component_Definition =>
4320 (Component_Definition (Comp_Decl), New_Sloc => Loc)));
4324 Next_Component (Comp);
4328 end Copy_Component_List;
4330 -------------------------
4331 -- Copy_Parameter_List --
4332 -------------------------
4334 function Copy_Parameter_List (Subp_Id : Entity_Id) return List_Id is
4335 Loc : constant Source_Ptr := Sloc (Subp_Id);
4340 if No (First_Formal (Subp_Id)) then
4344 Formal := First_Formal (Subp_Id);
4345 while Present (Formal) loop
4347 (Make_Parameter_Specification (Loc,
4348 Defining_Identifier =>
4349 Make_Defining_Identifier (Sloc (Formal),
4350 Chars => Chars (Formal)),
4351 In_Present => In_Present (Parent (Formal)),
4352 Out_Present => Out_Present (Parent (Formal)),
4354 New_Occurrence_Of (Etype (Formal), Loc),
4356 New_Copy_Tree (Expression (Parent (Formal)))),
4359 Next_Formal (Formal);
4364 end Copy_Parameter_List;
4366 --------------------------------
4367 -- Corresponding_Generic_Type --
4368 --------------------------------
4370 function Corresponding_Generic_Type (T : Entity_Id) return Entity_Id is
4376 if not Is_Generic_Actual_Type (T) then
4379 -- If the actual is the actual of an enclosing instance, resolution
4380 -- was correct in the generic.
4382 elsif Nkind (Parent (T)) = N_Subtype_Declaration
4383 and then Is_Entity_Name (Subtype_Indication (Parent (T)))
4385 Is_Generic_Actual_Type (Entity (Subtype_Indication (Parent (T))))
4392 if Is_Wrapper_Package (Inst) then
4393 Inst := Related_Instance (Inst);
4398 (Specification (Unit_Declaration_Node (Inst)));
4400 -- Generic actual has the same name as the corresponding formal
4402 Typ := First_Entity (Gen);
4403 while Present (Typ) loop
4404 if Chars (Typ) = Chars (T) then
4413 end Corresponding_Generic_Type;
4415 --------------------
4416 -- Current_Entity --
4417 --------------------
4419 -- The currently visible definition for a given identifier is the
4420 -- one most chained at the start of the visibility chain, i.e. the
4421 -- one that is referenced by the Node_Id value of the name of the
4422 -- given identifier.
4424 function Current_Entity (N : Node_Id) return Entity_Id is
4426 return Get_Name_Entity_Id (Chars (N));
4429 -----------------------------
4430 -- Current_Entity_In_Scope --
4431 -----------------------------
4433 function Current_Entity_In_Scope (N : Node_Id) return Entity_Id is
4435 CS : constant Entity_Id := Current_Scope;
4437 Transient_Case : constant Boolean := Scope_Is_Transient;
4440 E := Get_Name_Entity_Id (Chars (N));
4442 and then Scope (E) /= CS
4443 and then (not Transient_Case or else Scope (E) /= Scope (CS))
4449 end Current_Entity_In_Scope;
4455 function Current_Scope return Entity_Id is
4457 if Scope_Stack.Last = -1 then
4458 return Standard_Standard;
4461 C : constant Entity_Id :=
4462 Scope_Stack.Table (Scope_Stack.Last).Entity;
4467 return Standard_Standard;
4473 ------------------------
4474 -- Current_Subprogram --
4475 ------------------------
4477 function Current_Subprogram return Entity_Id is
4478 Scop : constant Entity_Id := Current_Scope;
4480 if Is_Subprogram_Or_Generic_Subprogram (Scop) then
4483 return Enclosing_Subprogram (Scop);
4485 end Current_Subprogram;
4487 ----------------------------------
4488 -- Deepest_Type_Access_Level --
4489 ----------------------------------
4491 function Deepest_Type_Access_Level (Typ : Entity_Id) return Uint is
4493 if Ekind (Typ) = E_Anonymous_Access_Type
4494 and then not Is_Local_Anonymous_Access (Typ)
4495 and then Nkind (Associated_Node_For_Itype (Typ)) = N_Object_Declaration
4497 -- Typ is the type of an Ada 2012 stand-alone object of an anonymous
4501 Scope_Depth (Enclosing_Dynamic_Scope
4502 (Defining_Identifier
4503 (Associated_Node_For_Itype (Typ))));
4505 -- For generic formal type, return Int'Last (infinite).
4506 -- See comment preceding Is_Generic_Type call in Type_Access_Level.
4508 elsif Is_Generic_Type (Root_Type (Typ)) then
4509 return UI_From_Int (Int'Last);
4512 return Type_Access_Level (Typ);
4514 end Deepest_Type_Access_Level;
4516 ---------------------
4517 -- Defining_Entity --
4518 ---------------------
4520 function Defining_Entity (N : Node_Id) return Entity_Id is
4521 K : constant Node_Kind := Nkind (N);
4522 Err : Entity_Id := Empty;
4527 N_Subprogram_Declaration |
4528 N_Abstract_Subprogram_Declaration |
4530 N_Package_Declaration |
4531 N_Subprogram_Renaming_Declaration |
4532 N_Subprogram_Body_Stub |
4533 N_Generic_Subprogram_Declaration |
4534 N_Generic_Package_Declaration |
4535 N_Formal_Subprogram_Declaration |
4536 N_Expression_Function
4538 return Defining_Entity (Specification (N));
4541 N_Component_Declaration |
4542 N_Defining_Program_Unit_Name |
4543 N_Discriminant_Specification |
4545 N_Entry_Declaration |
4546 N_Entry_Index_Specification |
4547 N_Exception_Declaration |
4548 N_Exception_Renaming_Declaration |
4549 N_Formal_Object_Declaration |
4550 N_Formal_Package_Declaration |
4551 N_Formal_Type_Declaration |
4552 N_Full_Type_Declaration |
4553 N_Implicit_Label_Declaration |
4554 N_Incomplete_Type_Declaration |
4555 N_Loop_Parameter_Specification |
4556 N_Number_Declaration |
4557 N_Object_Declaration |
4558 N_Object_Renaming_Declaration |
4559 N_Package_Body_Stub |
4560 N_Parameter_Specification |
4561 N_Private_Extension_Declaration |
4562 N_Private_Type_Declaration |
4564 N_Protected_Body_Stub |
4565 N_Protected_Type_Declaration |
4566 N_Single_Protected_Declaration |
4567 N_Single_Task_Declaration |
4568 N_Subtype_Declaration |
4571 N_Task_Type_Declaration
4573 return Defining_Identifier (N);
4576 return Defining_Entity (Proper_Body (N));
4579 N_Function_Instantiation |
4580 N_Function_Specification |
4581 N_Generic_Function_Renaming_Declaration |
4582 N_Generic_Package_Renaming_Declaration |
4583 N_Generic_Procedure_Renaming_Declaration |
4585 N_Package_Instantiation |
4586 N_Package_Renaming_Declaration |
4587 N_Package_Specification |
4588 N_Procedure_Instantiation |
4589 N_Procedure_Specification
4592 Nam : constant Node_Id := Defining_Unit_Name (N);
4595 if Nkind (Nam) in N_Entity then
4598 -- For Error, make up a name and attach to declaration
4599 -- so we can continue semantic analysis
4601 elsif Nam = Error then
4602 Err := Make_Temporary (Sloc (N), 'T');
4603 Set_Defining_Unit_Name (N, Err);
4607 -- If not an entity, get defining identifier
4610 return Defining_Identifier (Nam);
4618 return Entity (Identifier (N));
4621 raise Program_Error;
4624 end Defining_Entity;
4626 --------------------------
4627 -- Denotes_Discriminant --
4628 --------------------------
4630 function Denotes_Discriminant
4632 Check_Concurrent : Boolean := False) return Boolean
4637 if not Is_Entity_Name (N) or else No (Entity (N)) then
4643 -- If we are checking for a protected type, the discriminant may have
4644 -- been rewritten as the corresponding discriminal of the original type
4645 -- or of the corresponding concurrent record, depending on whether we
4646 -- are in the spec or body of the protected type.
4648 return Ekind (E) = E_Discriminant
4651 and then Ekind (E) = E_In_Parameter
4652 and then Present (Discriminal_Link (E))
4654 (Is_Concurrent_Type (Scope (Discriminal_Link (E)))
4656 Is_Concurrent_Record_Type (Scope (Discriminal_Link (E)))));
4658 end Denotes_Discriminant;
4660 -------------------------
4661 -- Denotes_Same_Object --
4662 -------------------------
4664 function Denotes_Same_Object (A1, A2 : Node_Id) return Boolean is
4665 Obj1 : Node_Id := A1;
4666 Obj2 : Node_Id := A2;
4668 function Has_Prefix (N : Node_Id) return Boolean;
4669 -- Return True if N has attribute Prefix
4671 function Is_Renaming (N : Node_Id) return Boolean;
4672 -- Return true if N names a renaming entity
4674 function Is_Valid_Renaming (N : Node_Id) return Boolean;
4675 -- For renamings, return False if the prefix of any dereference within
4676 -- the renamed object_name is a variable, or any expression within the
4677 -- renamed object_name contains references to variables or calls on
4678 -- nonstatic functions; otherwise return True (RM 6.4.1(6.10/3))
4684 function Has_Prefix (N : Node_Id) return Boolean is
4688 N_Attribute_Reference,
4690 N_Explicit_Dereference,
4691 N_Indexed_Component,
4693 N_Selected_Component,
4701 function Is_Renaming (N : Node_Id) return Boolean is
4703 return Is_Entity_Name (N)
4704 and then Present (Renamed_Entity (Entity (N)));
4707 -----------------------
4708 -- Is_Valid_Renaming --
4709 -----------------------
4711 function Is_Valid_Renaming (N : Node_Id) return Boolean is
4713 function Check_Renaming (N : Node_Id) return Boolean;
4714 -- Recursive function used to traverse all the prefixes of N
4716 function Check_Renaming (N : Node_Id) return Boolean is
4719 and then not Check_Renaming (Renamed_Entity (Entity (N)))
4724 if Nkind (N) = N_Indexed_Component then
4729 Indx := First (Expressions (N));
4730 while Present (Indx) loop
4731 if not Is_OK_Static_Expression (Indx) then
4740 if Has_Prefix (N) then
4742 P : constant Node_Id := Prefix (N);
4745 if Nkind (N) = N_Explicit_Dereference
4746 and then Is_Variable (P)
4750 elsif Is_Entity_Name (P)
4751 and then Ekind (Entity (P)) = E_Function
4755 elsif Nkind (P) = N_Function_Call then
4759 -- Recursion to continue traversing the prefix of the
4760 -- renaming expression
4762 return Check_Renaming (P);
4769 -- Start of processing for Is_Valid_Renaming
4772 return Check_Renaming (N);
4773 end Is_Valid_Renaming;
4775 -- Start of processing for Denotes_Same_Object
4778 -- Both names statically denote the same stand-alone object or parameter
4779 -- (RM 6.4.1(6.5/3))
4781 if Is_Entity_Name (Obj1)
4782 and then Is_Entity_Name (Obj2)
4783 and then Entity (Obj1) = Entity (Obj2)
4788 -- For renamings, the prefix of any dereference within the renamed
4789 -- object_name is not a variable, and any expression within the
4790 -- renamed object_name contains no references to variables nor
4791 -- calls on nonstatic functions (RM 6.4.1(6.10/3)).
4793 if Is_Renaming (Obj1) then
4794 if Is_Valid_Renaming (Obj1) then
4795 Obj1 := Renamed_Entity (Entity (Obj1));
4801 if Is_Renaming (Obj2) then
4802 if Is_Valid_Renaming (Obj2) then
4803 Obj2 := Renamed_Entity (Entity (Obj2));
4809 -- No match if not same node kind (such cases are handled by
4810 -- Denotes_Same_Prefix)
4812 if Nkind (Obj1) /= Nkind (Obj2) then
4815 -- After handling valid renamings, one of the two names statically
4816 -- denoted a renaming declaration whose renamed object_name is known
4817 -- to denote the same object as the other (RM 6.4.1(6.10/3))
4819 elsif Is_Entity_Name (Obj1) then
4820 if Is_Entity_Name (Obj2) then
4821 return Entity (Obj1) = Entity (Obj2);
4826 -- Both names are selected_components, their prefixes are known to
4827 -- denote the same object, and their selector_names denote the same
4828 -- component (RM 6.4.1(6.6/3)
4830 elsif Nkind (Obj1) = N_Selected_Component then
4831 return Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2))
4833 Entity (Selector_Name (Obj1)) = Entity (Selector_Name (Obj2));
4835 -- Both names are dereferences and the dereferenced names are known to
4836 -- denote the same object (RM 6.4.1(6.7/3))
4838 elsif Nkind (Obj1) = N_Explicit_Dereference then
4839 return Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2));
4841 -- Both names are indexed_components, their prefixes are known to denote
4842 -- the same object, and each of the pairs of corresponding index values
4843 -- are either both static expressions with the same static value or both
4844 -- names that are known to denote the same object (RM 6.4.1(6.8/3))
4846 elsif Nkind (Obj1) = N_Indexed_Component then
4847 if not Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2)) then
4855 Indx1 := First (Expressions (Obj1));
4856 Indx2 := First (Expressions (Obj2));
4857 while Present (Indx1) loop
4859 -- Indexes must denote the same static value or same object
4861 if Is_OK_Static_Expression (Indx1) then
4862 if not Is_OK_Static_Expression (Indx2) then
4865 elsif Expr_Value (Indx1) /= Expr_Value (Indx2) then
4869 elsif not Denotes_Same_Object (Indx1, Indx2) then
4881 -- Both names are slices, their prefixes are known to denote the same
4882 -- object, and the two slices have statically matching index constraints
4883 -- (RM 6.4.1(6.9/3))
4885 elsif Nkind (Obj1) = N_Slice
4886 and then Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2))
4889 Lo1, Lo2, Hi1, Hi2 : Node_Id;
4892 Get_Index_Bounds (Etype (Obj1), Lo1, Hi1);
4893 Get_Index_Bounds (Etype (Obj2), Lo2, Hi2);
4895 -- Check whether bounds are statically identical. There is no
4896 -- attempt to detect partial overlap of slices.
4898 return Denotes_Same_Object (Lo1, Lo2)
4900 Denotes_Same_Object (Hi1, Hi2);
4903 -- In the recursion, literals appear as indexes
4905 elsif Nkind (Obj1) = N_Integer_Literal
4907 Nkind (Obj2) = N_Integer_Literal
4909 return Intval (Obj1) = Intval (Obj2);
4914 end Denotes_Same_Object;
4916 -------------------------
4917 -- Denotes_Same_Prefix --
4918 -------------------------
4920 function Denotes_Same_Prefix (A1, A2 : Node_Id) return Boolean is
4923 if Is_Entity_Name (A1) then
4924 if Nkind_In (A2, N_Selected_Component, N_Indexed_Component)
4925 and then not Is_Access_Type (Etype (A1))
4927 return Denotes_Same_Object (A1, Prefix (A2))
4928 or else Denotes_Same_Prefix (A1, Prefix (A2));
4933 elsif Is_Entity_Name (A2) then
4934 return Denotes_Same_Prefix (A1 => A2, A2 => A1);
4936 elsif Nkind_In (A1, N_Selected_Component, N_Indexed_Component, N_Slice)
4938 Nkind_In (A2, N_Selected_Component, N_Indexed_Component, N_Slice)
4941 Root1, Root2 : Node_Id;
4942 Depth1, Depth2 : Int := 0;
4945 Root1 := Prefix (A1);
4946 while not Is_Entity_Name (Root1) loop
4948 (Root1, N_Selected_Component, N_Indexed_Component)
4952 Root1 := Prefix (Root1);
4955 Depth1 := Depth1 + 1;
4958 Root2 := Prefix (A2);
4959 while not Is_Entity_Name (Root2) loop
4960 if not Nkind_In (Root2, N_Selected_Component,
4961 N_Indexed_Component)
4965 Root2 := Prefix (Root2);
4968 Depth2 := Depth2 + 1;
4971 -- If both have the same depth and they do not denote the same
4972 -- object, they are disjoint and no warning is needed.
4974 if Depth1 = Depth2 then
4977 elsif Depth1 > Depth2 then
4978 Root1 := Prefix (A1);
4979 for J in 1 .. Depth1 - Depth2 - 1 loop
4980 Root1 := Prefix (Root1);
4983 return Denotes_Same_Object (Root1, A2);
4986 Root2 := Prefix (A2);
4987 for J in 1 .. Depth2 - Depth1 - 1 loop
4988 Root2 := Prefix (Root2);
4991 return Denotes_Same_Object (A1, Root2);
4998 end Denotes_Same_Prefix;
5000 ----------------------
5001 -- Denotes_Variable --
5002 ----------------------
5004 function Denotes_Variable (N : Node_Id) return Boolean is
5006 return Is_Variable (N) and then Paren_Count (N) = 0;
5007 end Denotes_Variable;
5009 -----------------------------
5010 -- Depends_On_Discriminant --
5011 -----------------------------
5013 function Depends_On_Discriminant (N : Node_Id) return Boolean is
5018 Get_Index_Bounds (N, L, H);
5019 return Denotes_Discriminant (L) or else Denotes_Discriminant (H);
5020 end Depends_On_Discriminant;
5022 -------------------------
5023 -- Designate_Same_Unit --
5024 -------------------------
5026 function Designate_Same_Unit
5028 Name2 : Node_Id) return Boolean
5030 K1 : constant Node_Kind := Nkind (Name1);
5031 K2 : constant Node_Kind := Nkind (Name2);
5033 function Prefix_Node (N : Node_Id) return Node_Id;
5034 -- Returns the parent unit name node of a defining program unit name
5035 -- or the prefix if N is a selected component or an expanded name.
5037 function Select_Node (N : Node_Id) return Node_Id;
5038 -- Returns the defining identifier node of a defining program unit
5039 -- name or the selector node if N is a selected component or an
5046 function Prefix_Node (N : Node_Id) return Node_Id is
5048 if Nkind (N) = N_Defining_Program_Unit_Name then
5059 function Select_Node (N : Node_Id) return Node_Id is
5061 if Nkind (N) = N_Defining_Program_Unit_Name then
5062 return Defining_Identifier (N);
5064 return Selector_Name (N);
5068 -- Start of processing for Designate_Same_Unit
5071 if Nkind_In (K1, N_Identifier, N_Defining_Identifier)
5073 Nkind_In (K2, N_Identifier, N_Defining_Identifier)
5075 return Chars (Name1) = Chars (Name2);
5077 elsif Nkind_In (K1, N_Expanded_Name,
5078 N_Selected_Component,
5079 N_Defining_Program_Unit_Name)
5081 Nkind_In (K2, N_Expanded_Name,
5082 N_Selected_Component,
5083 N_Defining_Program_Unit_Name)
5086 (Chars (Select_Node (Name1)) = Chars (Select_Node (Name2)))
5088 Designate_Same_Unit (Prefix_Node (Name1), Prefix_Node (Name2));
5093 end Designate_Same_Unit;
5095 ------------------------------------------
5096 -- function Dynamic_Accessibility_Level --
5097 ------------------------------------------
5099 function Dynamic_Accessibility_Level (Expr : Node_Id) return Node_Id is
5101 Loc : constant Source_Ptr := Sloc (Expr);
5103 function Make_Level_Literal (Level : Uint) return Node_Id;
5104 -- Construct an integer literal representing an accessibility level
5105 -- with its type set to Natural.
5107 ------------------------
5108 -- Make_Level_Literal --
5109 ------------------------
5111 function Make_Level_Literal (Level : Uint) return Node_Id is
5112 Result : constant Node_Id := Make_Integer_Literal (Loc, Level);
5114 Set_Etype (Result, Standard_Natural);
5116 end Make_Level_Literal;
5118 -- Start of processing for Dynamic_Accessibility_Level
5121 if Is_Entity_Name (Expr) then
5124 if Present (Renamed_Object (E)) then
5125 return Dynamic_Accessibility_Level (Renamed_Object (E));
5128 if Is_Formal (E) or else Ekind_In (E, E_Variable, E_Constant) then
5129 if Present (Extra_Accessibility (E)) then
5130 return New_Occurrence_Of (Extra_Accessibility (E), Loc);
5135 -- Unimplemented: Ptr.all'Access, where Ptr has Extra_Accessibility ???
5137 case Nkind (Expr) is
5139 -- For access discriminant, the level of the enclosing object
5141 when N_Selected_Component =>
5142 if Ekind (Entity (Selector_Name (Expr))) = E_Discriminant
5143 and then Ekind (Etype (Entity (Selector_Name (Expr)))) =
5144 E_Anonymous_Access_Type
5146 return Make_Level_Literal (Object_Access_Level (Expr));
5149 when N_Attribute_Reference =>
5150 case Get_Attribute_Id (Attribute_Name (Expr)) is
5152 -- For X'Access, the level of the prefix X
5154 when Attribute_Access =>
5155 return Make_Level_Literal
5156 (Object_Access_Level (Prefix (Expr)));
5158 -- Treat the unchecked attributes as library-level
5160 when Attribute_Unchecked_Access |
5161 Attribute_Unrestricted_Access =>
5162 return Make_Level_Literal (Scope_Depth (Standard_Standard));
5164 -- No other access-valued attributes
5167 raise Program_Error;
5172 -- Unimplemented: depends on context. As an actual parameter where
5173 -- formal type is anonymous, use
5174 -- Scope_Depth (Current_Scope) + 1.
5175 -- For other cases, see 3.10.2(14/3) and following. ???
5179 when N_Type_Conversion =>
5180 if not Is_Local_Anonymous_Access (Etype (Expr)) then
5182 -- Handle type conversions introduced for a rename of an
5183 -- Ada 2012 stand-alone object of an anonymous access type.
5185 return Dynamic_Accessibility_Level (Expression (Expr));
5192 return Make_Level_Literal (Type_Access_Level (Etype (Expr)));
5193 end Dynamic_Accessibility_Level;
5195 -----------------------------------
5196 -- Effective_Extra_Accessibility --
5197 -----------------------------------
5199 function Effective_Extra_Accessibility (Id : Entity_Id) return Entity_Id is
5201 if Present (Renamed_Object (Id))
5202 and then Is_Entity_Name (Renamed_Object (Id))
5204 return Effective_Extra_Accessibility (Entity (Renamed_Object (Id)));
5206 return Extra_Accessibility (Id);
5208 end Effective_Extra_Accessibility;
5210 -----------------------------
5211 -- Effective_Reads_Enabled --
5212 -----------------------------
5214 function Effective_Reads_Enabled (Id : Entity_Id) return Boolean is
5216 return Has_Enabled_Property (Id, Name_Effective_Reads);
5217 end Effective_Reads_Enabled;
5219 ------------------------------
5220 -- Effective_Writes_Enabled --
5221 ------------------------------
5223 function Effective_Writes_Enabled (Id : Entity_Id) return Boolean is
5225 return Has_Enabled_Property (Id, Name_Effective_Writes);
5226 end Effective_Writes_Enabled;
5228 ------------------------------
5229 -- Enclosing_Comp_Unit_Node --
5230 ------------------------------
5232 function Enclosing_Comp_Unit_Node (N : Node_Id) return Node_Id is
5233 Current_Node : Node_Id;
5237 while Present (Current_Node)
5238 and then Nkind (Current_Node) /= N_Compilation_Unit
5240 Current_Node := Parent (Current_Node);
5243 if Nkind (Current_Node) /= N_Compilation_Unit then
5246 return Current_Node;
5248 end Enclosing_Comp_Unit_Node;
5250 --------------------------
5251 -- Enclosing_CPP_Parent --
5252 --------------------------
5254 function Enclosing_CPP_Parent (Typ : Entity_Id) return Entity_Id is
5255 Parent_Typ : Entity_Id := Typ;
5258 while not Is_CPP_Class (Parent_Typ)
5259 and then Etype (Parent_Typ) /= Parent_Typ
5261 Parent_Typ := Etype (Parent_Typ);
5263 if Is_Private_Type (Parent_Typ) then
5264 Parent_Typ := Full_View (Base_Type (Parent_Typ));
5268 pragma Assert (Is_CPP_Class (Parent_Typ));
5270 end Enclosing_CPP_Parent;
5272 ----------------------------
5273 -- Enclosing_Generic_Body --
5274 ----------------------------
5276 function Enclosing_Generic_Body
5277 (N : Node_Id) return Node_Id
5285 while Present (P) loop
5286 if Nkind (P) = N_Package_Body
5287 or else Nkind (P) = N_Subprogram_Body
5289 Spec := Corresponding_Spec (P);
5291 if Present (Spec) then
5292 Decl := Unit_Declaration_Node (Spec);
5294 if Nkind (Decl) = N_Generic_Package_Declaration
5295 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
5306 end Enclosing_Generic_Body;
5308 ----------------------------
5309 -- Enclosing_Generic_Unit --
5310 ----------------------------
5312 function Enclosing_Generic_Unit
5313 (N : Node_Id) return Node_Id
5321 while Present (P) loop
5322 if Nkind (P) = N_Generic_Package_Declaration
5323 or else Nkind (P) = N_Generic_Subprogram_Declaration
5327 elsif Nkind (P) = N_Package_Body
5328 or else Nkind (P) = N_Subprogram_Body
5330 Spec := Corresponding_Spec (P);
5332 if Present (Spec) then
5333 Decl := Unit_Declaration_Node (Spec);
5335 if Nkind (Decl) = N_Generic_Package_Declaration
5336 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
5347 end Enclosing_Generic_Unit;
5349 -------------------------------
5350 -- Enclosing_Lib_Unit_Entity --
5351 -------------------------------
5353 function Enclosing_Lib_Unit_Entity
5354 (E : Entity_Id := Current_Scope) return Entity_Id
5356 Unit_Entity : Entity_Id;
5359 -- Look for enclosing library unit entity by following scope links.
5360 -- Equivalent to, but faster than indexing through the scope stack.
5363 while (Present (Scope (Unit_Entity))
5364 and then Scope (Unit_Entity) /= Standard_Standard)
5365 and not Is_Child_Unit (Unit_Entity)
5367 Unit_Entity := Scope (Unit_Entity);
5371 end Enclosing_Lib_Unit_Entity;
5373 -----------------------
5374 -- Enclosing_Package --
5375 -----------------------
5377 function Enclosing_Package (E : Entity_Id) return Entity_Id is
5378 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
5381 if Dynamic_Scope = Standard_Standard then
5382 return Standard_Standard;
5384 elsif Dynamic_Scope = Empty then
5387 elsif Ekind_In (Dynamic_Scope, E_Package, E_Package_Body,
5390 return Dynamic_Scope;
5393 return Enclosing_Package (Dynamic_Scope);
5395 end Enclosing_Package;
5397 --------------------------
5398 -- Enclosing_Subprogram --
5399 --------------------------
5401 function Enclosing_Subprogram (E : Entity_Id) return Entity_Id is
5402 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
5405 if Dynamic_Scope = Standard_Standard then
5408 elsif Dynamic_Scope = Empty then
5411 elsif Ekind (Dynamic_Scope) = E_Subprogram_Body then
5412 return Corresponding_Spec (Parent (Parent (Dynamic_Scope)));
5414 elsif Ekind (Dynamic_Scope) = E_Block
5415 or else Ekind (Dynamic_Scope) = E_Return_Statement
5417 return Enclosing_Subprogram (Dynamic_Scope);
5419 elsif Ekind (Dynamic_Scope) = E_Task_Type then
5420 return Get_Task_Body_Procedure (Dynamic_Scope);
5422 elsif Ekind (Dynamic_Scope) = E_Limited_Private_Type
5423 and then Present (Full_View (Dynamic_Scope))
5424 and then Ekind (Full_View (Dynamic_Scope)) = E_Task_Type
5426 return Get_Task_Body_Procedure (Full_View (Dynamic_Scope));
5428 -- No body is generated if the protected operation is eliminated
5430 elsif Convention (Dynamic_Scope) = Convention_Protected
5431 and then not Is_Eliminated (Dynamic_Scope)
5432 and then Present (Protected_Body_Subprogram (Dynamic_Scope))
5434 return Protected_Body_Subprogram (Dynamic_Scope);
5437 return Dynamic_Scope;
5439 end Enclosing_Subprogram;
5441 ------------------------
5442 -- Ensure_Freeze_Node --
5443 ------------------------
5445 procedure Ensure_Freeze_Node (E : Entity_Id) is
5448 if No (Freeze_Node (E)) then
5449 FN := Make_Freeze_Entity (Sloc (E));
5450 Set_Has_Delayed_Freeze (E);
5451 Set_Freeze_Node (E, FN);
5452 Set_Access_Types_To_Process (FN, No_Elist);
5453 Set_TSS_Elist (FN, No_Elist);
5456 end Ensure_Freeze_Node;
5462 procedure Enter_Name (Def_Id : Entity_Id) is
5463 C : constant Entity_Id := Current_Entity (Def_Id);
5464 E : constant Entity_Id := Current_Entity_In_Scope (Def_Id);
5465 S : constant Entity_Id := Current_Scope;
5468 Generate_Definition (Def_Id);
5470 -- Add new name to current scope declarations. Check for duplicate
5471 -- declaration, which may or may not be a genuine error.
5475 -- Case of previous entity entered because of a missing declaration
5476 -- or else a bad subtype indication. Best is to use the new entity,
5477 -- and make the previous one invisible.
5479 if Etype (E) = Any_Type then
5480 Set_Is_Immediately_Visible (E, False);
5482 -- Case of renaming declaration constructed for package instances.
5483 -- if there is an explicit declaration with the same identifier,
5484 -- the renaming is not immediately visible any longer, but remains
5485 -- visible through selected component notation.
5487 elsif Nkind (Parent (E)) = N_Package_Renaming_Declaration
5488 and then not Comes_From_Source (E)
5490 Set_Is_Immediately_Visible (E, False);
5492 -- The new entity may be the package renaming, which has the same
5493 -- same name as a generic formal which has been seen already.
5495 elsif Nkind (Parent (Def_Id)) = N_Package_Renaming_Declaration
5496 and then not Comes_From_Source (Def_Id)
5498 Set_Is_Immediately_Visible (E, False);
5500 -- For a fat pointer corresponding to a remote access to subprogram,
5501 -- we use the same identifier as the RAS type, so that the proper
5502 -- name appears in the stub. This type is only retrieved through
5503 -- the RAS type and never by visibility, and is not added to the
5504 -- visibility list (see below).
5506 elsif Nkind (Parent (Def_Id)) = N_Full_Type_Declaration
5507 and then Ekind (Def_Id) = E_Record_Type
5508 and then Present (Corresponding_Remote_Type (Def_Id))
5512 -- Case of an implicit operation or derived literal. The new entity
5513 -- hides the implicit one, which is removed from all visibility,
5514 -- i.e. the entity list of its scope, and homonym chain of its name.
5516 elsif (Is_Overloadable (E) and then Is_Inherited_Operation (E))
5517 or else Is_Internal (E)
5521 Prev_Vis : Entity_Id;
5522 Decl : constant Node_Id := Parent (E);
5525 -- If E is an implicit declaration, it cannot be the first
5526 -- entity in the scope.
5528 Prev := First_Entity (Current_Scope);
5529 while Present (Prev) and then Next_Entity (Prev) /= E loop
5535 -- If E is not on the entity chain of the current scope,
5536 -- it is an implicit declaration in the generic formal
5537 -- part of a generic subprogram. When analyzing the body,
5538 -- the generic formals are visible but not on the entity
5539 -- chain of the subprogram. The new entity will become
5540 -- the visible one in the body.
5543 (Nkind (Parent (Decl)) = N_Generic_Subprogram_Declaration);
5547 Set_Next_Entity (Prev, Next_Entity (E));
5549 if No (Next_Entity (Prev)) then
5550 Set_Last_Entity (Current_Scope, Prev);
5553 if E = Current_Entity (E) then
5557 Prev_Vis := Current_Entity (E);
5558 while Homonym (Prev_Vis) /= E loop
5559 Prev_Vis := Homonym (Prev_Vis);
5563 if Present (Prev_Vis) then
5565 -- Skip E in the visibility chain
5567 Set_Homonym (Prev_Vis, Homonym (E));
5570 Set_Name_Entity_Id (Chars (E), Homonym (E));
5575 -- This section of code could use a comment ???
5577 elsif Present (Etype (E))
5578 and then Is_Concurrent_Type (Etype (E))
5583 -- If the homograph is a protected component renaming, it should not
5584 -- be hiding the current entity. Such renamings are treated as weak
5587 elsif Is_Prival (E) then
5588 Set_Is_Immediately_Visible (E, False);
5590 -- In this case the current entity is a protected component renaming.
5591 -- Perform minimal decoration by setting the scope and return since
5592 -- the prival should not be hiding other visible entities.
5594 elsif Is_Prival (Def_Id) then
5595 Set_Scope (Def_Id, Current_Scope);
5598 -- Analogous to privals, the discriminal generated for an entry index
5599 -- parameter acts as a weak declaration. Perform minimal decoration
5600 -- to avoid bogus errors.
5602 elsif Is_Discriminal (Def_Id)
5603 and then Ekind (Discriminal_Link (Def_Id)) = E_Entry_Index_Parameter
5605 Set_Scope (Def_Id, Current_Scope);
5608 -- In the body or private part of an instance, a type extension may
5609 -- introduce a component with the same name as that of an actual. The
5610 -- legality rule is not enforced, but the semantics of the full type
5611 -- with two components of same name are not clear at this point???
5613 elsif In_Instance_Not_Visible then
5616 -- When compiling a package body, some child units may have become
5617 -- visible. They cannot conflict with local entities that hide them.
5619 elsif Is_Child_Unit (E)
5620 and then In_Open_Scopes (Scope (E))
5621 and then not Is_Immediately_Visible (E)
5625 -- Conversely, with front-end inlining we may compile the parent body
5626 -- first, and a child unit subsequently. The context is now the
5627 -- parent spec, and body entities are not visible.
5629 elsif Is_Child_Unit (Def_Id)
5630 and then Is_Package_Body_Entity (E)
5631 and then not In_Package_Body (Current_Scope)
5635 -- Case of genuine duplicate declaration
5638 Error_Msg_Sloc := Sloc (E);
5640 -- If the previous declaration is an incomplete type declaration
5641 -- this may be an attempt to complete it with a private type. The
5642 -- following avoids confusing cascaded errors.
5644 if Nkind (Parent (E)) = N_Incomplete_Type_Declaration
5645 and then Nkind (Parent (Def_Id)) = N_Private_Type_Declaration
5648 ("incomplete type cannot be completed with a private " &
5649 "declaration", Parent (Def_Id));
5650 Set_Is_Immediately_Visible (E, False);
5651 Set_Full_View (E, Def_Id);
5653 -- An inherited component of a record conflicts with a new
5654 -- discriminant. The discriminant is inserted first in the scope,
5655 -- but the error should be posted on it, not on the component.
5657 elsif Ekind (E) = E_Discriminant
5658 and then Present (Scope (Def_Id))
5659 and then Scope (Def_Id) /= Current_Scope
5661 Error_Msg_Sloc := Sloc (Def_Id);
5662 Error_Msg_N ("& conflicts with declaration#", E);
5665 -- If the name of the unit appears in its own context clause, a
5666 -- dummy package with the name has already been created, and the
5667 -- error emitted. Try to continue quietly.
5669 elsif Error_Posted (E)
5670 and then Sloc (E) = No_Location
5671 and then Nkind (Parent (E)) = N_Package_Specification
5672 and then Current_Scope = Standard_Standard
5674 Set_Scope (Def_Id, Current_Scope);
5678 Error_Msg_N ("& conflicts with declaration#", Def_Id);
5680 -- Avoid cascaded messages with duplicate components in
5683 if Ekind_In (E, E_Component, E_Discriminant) then
5688 if Nkind (Parent (Parent (Def_Id))) =
5689 N_Generic_Subprogram_Declaration
5691 Defining_Entity (Specification (Parent (Parent (Def_Id))))
5693 Error_Msg_N ("\generic units cannot be overloaded", Def_Id);
5696 -- If entity is in standard, then we are in trouble, because it
5697 -- means that we have a library package with a duplicated name.
5698 -- That's hard to recover from, so abort.
5700 if S = Standard_Standard then
5701 raise Unrecoverable_Error;
5703 -- Otherwise we continue with the declaration. Having two
5704 -- identical declarations should not cause us too much trouble.
5712 -- If we fall through, declaration is OK, at least OK enough to continue
5714 -- If Def_Id is a discriminant or a record component we are in the midst
5715 -- of inheriting components in a derived record definition. Preserve
5716 -- their Ekind and Etype.
5718 if Ekind_In (Def_Id, E_Discriminant, E_Component) then
5721 -- If a type is already set, leave it alone (happens when a type
5722 -- declaration is reanalyzed following a call to the optimizer).
5724 elsif Present (Etype (Def_Id)) then
5727 -- Otherwise, the kind E_Void insures that premature uses of the entity
5728 -- will be detected. Any_Type insures that no cascaded errors will occur
5731 Set_Ekind (Def_Id, E_Void);
5732 Set_Etype (Def_Id, Any_Type);
5735 -- Inherited discriminants and components in derived record types are
5736 -- immediately visible. Itypes are not.
5738 -- Unless the Itype is for a record type with a corresponding remote
5739 -- type (what is that about, it was not commented ???)
5741 if Ekind_In (Def_Id, E_Discriminant, E_Component)
5743 ((not Is_Record_Type (Def_Id)
5744 or else No (Corresponding_Remote_Type (Def_Id)))
5745 and then not Is_Itype (Def_Id))
5747 Set_Is_Immediately_Visible (Def_Id);
5748 Set_Current_Entity (Def_Id);
5751 Set_Homonym (Def_Id, C);
5752 Append_Entity (Def_Id, S);
5753 Set_Public_Status (Def_Id);
5755 -- Declaring a homonym is not allowed in SPARK ...
5757 if Present (C) and then Restriction_Check_Required (SPARK_05) then
5759 Enclosing_Subp : constant Node_Id := Enclosing_Subprogram (Def_Id);
5760 Enclosing_Pack : constant Node_Id := Enclosing_Package (Def_Id);
5761 Other_Scope : constant Node_Id := Enclosing_Dynamic_Scope (C);
5764 -- ... unless the new declaration is in a subprogram, and the
5765 -- visible declaration is a variable declaration or a parameter
5766 -- specification outside that subprogram.
5768 if Present (Enclosing_Subp)
5769 and then Nkind_In (Parent (C), N_Object_Declaration,
5770 N_Parameter_Specification)
5771 and then not Scope_Within_Or_Same (Other_Scope, Enclosing_Subp)
5775 -- ... or the new declaration is in a package, and the visible
5776 -- declaration occurs outside that package.
5778 elsif Present (Enclosing_Pack)
5779 and then not Scope_Within_Or_Same (Other_Scope, Enclosing_Pack)
5783 -- ... or the new declaration is a component declaration in a
5784 -- record type definition.
5786 elsif Nkind (Parent (Def_Id)) = N_Component_Declaration then
5789 -- Don't issue error for non-source entities
5791 elsif Comes_From_Source (Def_Id)
5792 and then Comes_From_Source (C)
5794 Error_Msg_Sloc := Sloc (C);
5795 Check_SPARK_05_Restriction
5796 ("redeclaration of identifier &#", Def_Id);
5801 -- Warn if new entity hides an old one
5803 if Warn_On_Hiding and then Present (C)
5805 -- Don't warn for record components since they always have a well
5806 -- defined scope which does not confuse other uses. Note that in
5807 -- some cases, Ekind has not been set yet.
5809 and then Ekind (C) /= E_Component
5810 and then Ekind (C) /= E_Discriminant
5811 and then Nkind (Parent (C)) /= N_Component_Declaration
5812 and then Ekind (Def_Id) /= E_Component
5813 and then Ekind (Def_Id) /= E_Discriminant
5814 and then Nkind (Parent (Def_Id)) /= N_Component_Declaration
5816 -- Don't warn for one character variables. It is too common to use
5817 -- such variables as locals and will just cause too many false hits.
5819 and then Length_Of_Name (Chars (C)) /= 1
5821 -- Don't warn for non-source entities
5823 and then Comes_From_Source (C)
5824 and then Comes_From_Source (Def_Id)
5826 -- Don't warn unless entity in question is in extended main source
5828 and then In_Extended_Main_Source_Unit (Def_Id)
5830 -- Finally, the hidden entity must be either immediately visible or
5831 -- use visible (i.e. from a used package).
5834 (Is_Immediately_Visible (C)
5836 Is_Potentially_Use_Visible (C))
5838 Error_Msg_Sloc := Sloc (C);
5839 Error_Msg_N ("declaration hides &#?h?", Def_Id);
5847 function Entity_Of (N : Node_Id) return Entity_Id is
5853 if Is_Entity_Name (N) then
5856 -- Follow a possible chain of renamings to reach the root renamed
5859 while Present (Id) and then Present (Renamed_Object (Id)) loop
5860 if Is_Entity_Name (Renamed_Object (Id)) then
5861 Id := Entity (Renamed_Object (Id));
5872 --------------------------
5873 -- Explain_Limited_Type --
5874 --------------------------
5876 procedure Explain_Limited_Type (T : Entity_Id; N : Node_Id) is
5880 -- For array, component type must be limited
5882 if Is_Array_Type (T) then
5883 Error_Msg_Node_2 := T;
5885 ("\component type& of type& is limited", N, Component_Type (T));
5886 Explain_Limited_Type (Component_Type (T), N);
5888 elsif Is_Record_Type (T) then
5890 -- No need for extra messages if explicit limited record
5892 if Is_Limited_Record (Base_Type (T)) then
5896 -- Otherwise find a limited component. Check only components that
5897 -- come from source, or inherited components that appear in the
5898 -- source of the ancestor.
5900 C := First_Component (T);
5901 while Present (C) loop
5902 if Is_Limited_Type (Etype (C))
5904 (Comes_From_Source (C)
5906 (Present (Original_Record_Component (C))
5908 Comes_From_Source (Original_Record_Component (C))))
5910 Error_Msg_Node_2 := T;
5911 Error_Msg_NE ("\component& of type& has limited type", N, C);
5912 Explain_Limited_Type (Etype (C), N);
5919 -- The type may be declared explicitly limited, even if no component
5920 -- of it is limited, in which case we fall out of the loop.
5923 end Explain_Limited_Type;
5925 -------------------------------
5926 -- Extensions_Visible_Status --
5927 -------------------------------
5929 function Extensions_Visible_Status
5930 (Id : Entity_Id) return Extensions_Visible_Mode
5939 -- When a formal parameter is subject to Extensions_Visible, the pragma
5940 -- is stored in the contract of related subprogram.
5942 if Is_Formal (Id) then
5945 elsif Is_Subprogram_Or_Generic_Subprogram (Id) then
5948 -- No other construct carries this pragma
5951 return Extensions_Visible_None;
5954 Prag := Get_Pragma (Subp, Pragma_Extensions_Visible);
5956 -- In certain cases analysis may request the Extensions_Visible status
5957 -- of an expression function before the pragma has been analyzed yet.
5958 -- Inspect the declarative items after the expression function looking
5959 -- for the pragma (if any).
5961 if No (Prag) and then Is_Expression_Function (Subp) then
5962 Decl := Next (Unit_Declaration_Node (Subp));
5963 while Present (Decl) loop
5964 if Nkind (Decl) = N_Pragma
5965 and then Pragma_Name (Decl) = Name_Extensions_Visible
5970 -- A source construct ends the region where Extensions_Visible may
5971 -- appear, stop the traversal. An expanded expression function is
5972 -- no longer a source construct, but it must still be recognized.
5974 elsif Comes_From_Source (Decl)
5976 (Nkind_In (Decl, N_Subprogram_Body,
5977 N_Subprogram_Declaration)
5978 and then Is_Expression_Function (Defining_Entity (Decl)))
5987 -- Extract the value from the Boolean expression (if any)
5989 if Present (Prag) then
5990 Arg := First (Pragma_Argument_Associations (Prag));
5992 if Present (Arg) then
5993 Expr := Get_Pragma_Arg (Arg);
5995 -- When the associated subprogram is an expression function, the
5996 -- argument of the pragma may not have been analyzed.
5998 if not Analyzed (Expr) then
5999 Preanalyze_And_Resolve (Expr, Standard_Boolean);
6002 -- Guard against cascading errors when the argument of pragma
6003 -- Extensions_Visible is not a valid static Boolean expression.
6005 if Error_Posted (Expr) then
6006 return Extensions_Visible_None;
6008 elsif Is_True (Expr_Value (Expr)) then
6009 return Extensions_Visible_True;
6012 return Extensions_Visible_False;
6015 -- Otherwise the aspect or pragma defaults to True
6018 return Extensions_Visible_True;
6021 -- Otherwise aspect or pragma Extensions_Visible is not inherited or
6022 -- directly specified. In SPARK code, its value defaults to "False".
6024 elsif SPARK_Mode = On then
6025 return Extensions_Visible_False;
6027 -- In non-SPARK code, aspect or pragma Extensions_Visible defaults to
6031 return Extensions_Visible_True;
6033 end Extensions_Visible_Status;
6039 procedure Find_Actual
6041 Formal : out Entity_Id;
6044 Parnt : constant Node_Id := Parent (N);
6048 if Nkind_In (Parnt, N_Indexed_Component, N_Selected_Component)
6049 and then N = Prefix (Parnt)
6051 Find_Actual (Parnt, Formal, Call);
6054 elsif Nkind (Parnt) = N_Parameter_Association
6055 and then N = Explicit_Actual_Parameter (Parnt)
6057 Call := Parent (Parnt);
6059 elsif Nkind (Parnt) in N_Subprogram_Call then
6068 -- If we have a call to a subprogram look for the parameter. Note that
6069 -- we exclude overloaded calls, since we don't know enough to be sure
6070 -- of giving the right answer in this case.
6072 if Nkind_In (Call, N_Function_Call, N_Procedure_Call_Statement)
6073 and then Is_Entity_Name (Name (Call))
6074 and then Present (Entity (Name (Call)))
6075 and then Is_Overloadable (Entity (Name (Call)))
6076 and then not Is_Overloaded (Name (Call))
6078 -- Fall here if we are definitely a parameter
6080 Actual := First_Actual (Call);
6081 Formal := First_Formal (Entity (Name (Call)));
6082 while Present (Formal) and then Present (Actual) loop
6086 -- An actual that is the prefix in a prefixed call may have
6087 -- been rewritten in the call, after the deferred reference
6088 -- was collected. Check if sloc and kinds and names match.
6090 elsif Sloc (Actual) = Sloc (N)
6091 and then Nkind (Actual) = N_Identifier
6092 and then Nkind (Actual) = Nkind (N)
6093 and then Chars (Actual) = Chars (N)
6098 Actual := Next_Actual (Actual);
6099 Formal := Next_Formal (Formal);
6104 -- Fall through here if we did not find matching actual
6110 ---------------------------
6111 -- Find_Body_Discriminal --
6112 ---------------------------
6114 function Find_Body_Discriminal
6115 (Spec_Discriminant : Entity_Id) return Entity_Id
6121 -- If expansion is suppressed, then the scope can be the concurrent type
6122 -- itself rather than a corresponding concurrent record type.
6124 if Is_Concurrent_Type (Scope (Spec_Discriminant)) then
6125 Tsk := Scope (Spec_Discriminant);
6128 pragma Assert (Is_Concurrent_Record_Type (Scope (Spec_Discriminant)));
6130 Tsk := Corresponding_Concurrent_Type (Scope (Spec_Discriminant));
6133 -- Find discriminant of original concurrent type, and use its current
6134 -- discriminal, which is the renaming within the task/protected body.
6136 Disc := First_Discriminant (Tsk);
6137 while Present (Disc) loop
6138 if Chars (Disc) = Chars (Spec_Discriminant) then
6139 return Discriminal (Disc);
6142 Next_Discriminant (Disc);
6145 -- That loop should always succeed in finding a matching entry and
6146 -- returning. Fatal error if not.
6148 raise Program_Error;
6149 end Find_Body_Discriminal;
6151 -------------------------------------
6152 -- Find_Corresponding_Discriminant --
6153 -------------------------------------
6155 function Find_Corresponding_Discriminant
6157 Typ : Entity_Id) return Entity_Id
6159 Par_Disc : Entity_Id;
6160 Old_Disc : Entity_Id;
6161 New_Disc : Entity_Id;
6164 Par_Disc := Original_Record_Component (Original_Discriminant (Id));
6166 -- The original type may currently be private, and the discriminant
6167 -- only appear on its full view.
6169 if Is_Private_Type (Scope (Par_Disc))
6170 and then not Has_Discriminants (Scope (Par_Disc))
6171 and then Present (Full_View (Scope (Par_Disc)))
6173 Old_Disc := First_Discriminant (Full_View (Scope (Par_Disc)));
6175 Old_Disc := First_Discriminant (Scope (Par_Disc));
6178 if Is_Class_Wide_Type (Typ) then
6179 New_Disc := First_Discriminant (Root_Type (Typ));
6181 New_Disc := First_Discriminant (Typ);
6184 while Present (Old_Disc) and then Present (New_Disc) loop
6185 if Old_Disc = Par_Disc then
6189 Next_Discriminant (Old_Disc);
6190 Next_Discriminant (New_Disc);
6193 -- Should always find it
6195 raise Program_Error;
6196 end Find_Corresponding_Discriminant;
6198 ----------------------------------
6199 -- Find_Enclosing_Iterator_Loop --
6200 ----------------------------------
6202 function Find_Enclosing_Iterator_Loop (Id : Entity_Id) return Entity_Id is
6207 -- Traverse the scope chain looking for an iterator loop. Such loops are
6208 -- usually transformed into blocks, hence the use of Original_Node.
6211 while Present (S) and then S /= Standard_Standard loop
6212 if Ekind (S) = E_Loop
6213 and then Nkind (Parent (S)) = N_Implicit_Label_Declaration
6215 Constr := Original_Node (Label_Construct (Parent (S)));
6217 if Nkind (Constr) = N_Loop_Statement
6218 and then Present (Iteration_Scheme (Constr))
6219 and then Nkind (Iterator_Specification
6220 (Iteration_Scheme (Constr))) =
6221 N_Iterator_Specification
6231 end Find_Enclosing_Iterator_Loop;
6233 ------------------------------------
6234 -- Find_Loop_In_Conditional_Block --
6235 ------------------------------------
6237 function Find_Loop_In_Conditional_Block (N : Node_Id) return Node_Id is
6243 if Nkind (Stmt) = N_If_Statement then
6244 Stmt := First (Then_Statements (Stmt));
6247 pragma Assert (Nkind (Stmt) = N_Block_Statement);
6249 -- Inspect the statements of the conditional block. In general the loop
6250 -- should be the first statement in the statement sequence of the block,
6251 -- but the finalization machinery may have introduced extra object
6254 Stmt := First (Statements (Handled_Statement_Sequence (Stmt)));
6255 while Present (Stmt) loop
6256 if Nkind (Stmt) = N_Loop_Statement then
6263 -- The expansion of attribute 'Loop_Entry produced a malformed block
6265 raise Program_Error;
6266 end Find_Loop_In_Conditional_Block;
6268 --------------------------
6269 -- Find_Overlaid_Entity --
6270 --------------------------
6272 procedure Find_Overlaid_Entity
6274 Ent : out Entity_Id;
6280 -- We are looking for one of the two following forms:
6282 -- for X'Address use Y'Address
6286 -- Const : constant Address := expr;
6288 -- for X'Address use Const;
6290 -- In the second case, the expr is either Y'Address, or recursively a
6291 -- constant that eventually references Y'Address.
6296 if Nkind (N) = N_Attribute_Definition_Clause
6297 and then Chars (N) = Name_Address
6299 Expr := Expression (N);
6301 -- This loop checks the form of the expression for Y'Address,
6302 -- using recursion to deal with intermediate constants.
6305 -- Check for Y'Address
6307 if Nkind (Expr) = N_Attribute_Reference
6308 and then Attribute_Name (Expr) = Name_Address
6310 Expr := Prefix (Expr);
6313 -- Check for Const where Const is a constant entity
6315 elsif Is_Entity_Name (Expr)
6316 and then Ekind (Entity (Expr)) = E_Constant
6318 Expr := Constant_Value (Entity (Expr));
6320 -- Anything else does not need checking
6327 -- This loop checks the form of the prefix for an entity, using
6328 -- recursion to deal with intermediate components.
6331 -- Check for Y where Y is an entity
6333 if Is_Entity_Name (Expr) then
6334 Ent := Entity (Expr);
6337 -- Check for components
6340 Nkind_In (Expr, N_Selected_Component, N_Indexed_Component)
6342 Expr := Prefix (Expr);
6345 -- Anything else does not need checking
6352 end Find_Overlaid_Entity;
6354 -------------------------
6355 -- Find_Parameter_Type --
6356 -------------------------
6358 function Find_Parameter_Type (Param : Node_Id) return Entity_Id is
6360 if Nkind (Param) /= N_Parameter_Specification then
6363 -- For an access parameter, obtain the type from the formal entity
6364 -- itself, because access to subprogram nodes do not carry a type.
6365 -- Shouldn't we always use the formal entity ???
6367 elsif Nkind (Parameter_Type (Param)) = N_Access_Definition then
6368 return Etype (Defining_Identifier (Param));
6371 return Etype (Parameter_Type (Param));
6373 end Find_Parameter_Type;
6375 -----------------------------------
6376 -- Find_Placement_In_State_Space --
6377 -----------------------------------
6379 procedure Find_Placement_In_State_Space
6380 (Item_Id : Entity_Id;
6381 Placement : out State_Space_Kind;
6382 Pack_Id : out Entity_Id)
6384 Context : Entity_Id;
6387 -- Assume that the item does not appear in the state space of a package
6389 Placement := Not_In_Package;
6392 -- Climb the scope stack and examine the enclosing context
6394 Context := Scope (Item_Id);
6395 while Present (Context) and then Context /= Standard_Standard loop
6396 if Ekind (Context) = E_Package then
6399 -- A package body is a cut off point for the traversal as the item
6400 -- cannot be visible to the outside from this point on. Note that
6401 -- this test must be done first as a body is also classified as a
6404 if In_Package_Body (Context) then
6405 Placement := Body_State_Space;
6408 -- The private part of a package is a cut off point for the
6409 -- traversal as the item cannot be visible to the outside from
6412 elsif In_Private_Part (Context) then
6413 Placement := Private_State_Space;
6416 -- When the item appears in the visible state space of a package,
6417 -- continue to climb the scope stack as this may not be the final
6421 Placement := Visible_State_Space;
6423 -- The visible state space of a child unit acts as the proper
6424 -- placement of an item.
6426 if Is_Child_Unit (Context) then
6431 -- The item or its enclosing package appear in a construct that has
6435 Placement := Not_In_Package;
6439 Context := Scope (Context);
6441 end Find_Placement_In_State_Space;
6443 ------------------------
6444 -- Find_Specific_Type --
6445 ------------------------
6447 function Find_Specific_Type (CW : Entity_Id) return Entity_Id is
6448 Typ : Entity_Id := Root_Type (CW);
6451 if Ekind (Typ) = E_Incomplete_Type then
6452 if From_Limited_With (Typ) then
6453 Typ := Non_Limited_View (Typ);
6455 Typ := Full_View (Typ);
6459 if Is_Private_Type (Typ)
6460 and then not Is_Tagged_Type (Typ)
6461 and then Present (Full_View (Typ))
6463 return Full_View (Typ);
6467 end Find_Specific_Type;
6469 -----------------------------
6470 -- Find_Static_Alternative --
6471 -----------------------------
6473 function Find_Static_Alternative (N : Node_Id) return Node_Id is
6474 Expr : constant Node_Id := Expression (N);
6475 Val : constant Uint := Expr_Value (Expr);
6480 Alt := First (Alternatives (N));
6483 if Nkind (Alt) /= N_Pragma then
6484 Choice := First (Discrete_Choices (Alt));
6485 while Present (Choice) loop
6487 -- Others choice, always matches
6489 if Nkind (Choice) = N_Others_Choice then
6492 -- Range, check if value is in the range
6494 elsif Nkind (Choice) = N_Range then
6496 Val >= Expr_Value (Low_Bound (Choice))
6498 Val <= Expr_Value (High_Bound (Choice));
6500 -- Choice is a subtype name. Note that we know it must
6501 -- be a static subtype, since otherwise it would have
6502 -- been diagnosed as illegal.
6504 elsif Is_Entity_Name (Choice)
6505 and then Is_Type (Entity (Choice))
6507 exit Search when Is_In_Range (Expr, Etype (Choice),
6508 Assume_Valid => False);
6510 -- Choice is a subtype indication
6512 elsif Nkind (Choice) = N_Subtype_Indication then
6514 C : constant Node_Id := Constraint (Choice);
6515 R : constant Node_Id := Range_Expression (C);
6519 Val >= Expr_Value (Low_Bound (R))
6521 Val <= Expr_Value (High_Bound (R));
6524 -- Choice is a simple expression
6527 exit Search when Val = Expr_Value (Choice);
6535 pragma Assert (Present (Alt));
6538 -- The above loop *must* terminate by finding a match, since
6539 -- we know the case statement is valid, and the value of the
6540 -- expression is known at compile time. When we fall out of
6541 -- the loop, Alt points to the alternative that we know will
6542 -- be selected at run time.
6545 end Find_Static_Alternative;
6551 function First_Actual (Node : Node_Id) return Node_Id is
6555 if No (Parameter_Associations (Node)) then
6559 N := First (Parameter_Associations (Node));
6561 if Nkind (N) = N_Parameter_Association then
6562 return First_Named_Actual (Node);
6568 -----------------------
6569 -- Gather_Components --
6570 -----------------------
6572 procedure Gather_Components
6574 Comp_List : Node_Id;
6575 Governed_By : List_Id;
6577 Report_Errors : out Boolean)
6581 Discrete_Choice : Node_Id;
6582 Comp_Item : Node_Id;
6584 Discrim : Entity_Id;
6585 Discrim_Name : Node_Id;
6586 Discrim_Value : Node_Id;
6589 Report_Errors := False;
6591 if No (Comp_List) or else Null_Present (Comp_List) then
6594 elsif Present (Component_Items (Comp_List)) then
6595 Comp_Item := First (Component_Items (Comp_List));
6601 while Present (Comp_Item) loop
6603 -- Skip the tag of a tagged record, the interface tags, as well
6604 -- as all items that are not user components (anonymous types,
6605 -- rep clauses, Parent field, controller field).
6607 if Nkind (Comp_Item) = N_Component_Declaration then
6609 Comp : constant Entity_Id := Defining_Identifier (Comp_Item);
6611 if not Is_Tag (Comp) and then Chars (Comp) /= Name_uParent then
6612 Append_Elmt (Comp, Into);
6620 if No (Variant_Part (Comp_List)) then
6623 Discrim_Name := Name (Variant_Part (Comp_List));
6624 Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
6627 -- Look for the discriminant that governs this variant part.
6628 -- The discriminant *must* be in the Governed_By List
6630 Assoc := First (Governed_By);
6631 Find_Constraint : loop
6632 Discrim := First (Choices (Assoc));
6633 exit Find_Constraint when Chars (Discrim_Name) = Chars (Discrim)
6634 or else (Present (Corresponding_Discriminant (Entity (Discrim)))
6636 Chars (Corresponding_Discriminant (Entity (Discrim))) =
6637 Chars (Discrim_Name))
6638 or else Chars (Original_Record_Component (Entity (Discrim)))
6639 = Chars (Discrim_Name);
6641 if No (Next (Assoc)) then
6642 if not Is_Constrained (Typ)
6643 and then Is_Derived_Type (Typ)
6644 and then Present (Stored_Constraint (Typ))
6646 -- If the type is a tagged type with inherited discriminants,
6647 -- use the stored constraint on the parent in order to find
6648 -- the values of discriminants that are otherwise hidden by an
6649 -- explicit constraint. Renamed discriminants are handled in
6652 -- If several parent discriminants are renamed by a single
6653 -- discriminant of the derived type, the call to obtain the
6654 -- Corresponding_Discriminant field only retrieves the last
6655 -- of them. We recover the constraint on the others from the
6656 -- Stored_Constraint as well.
6663 D := First_Discriminant (Etype (Typ));
6664 C := First_Elmt (Stored_Constraint (Typ));
6665 while Present (D) and then Present (C) loop
6666 if Chars (Discrim_Name) = Chars (D) then
6667 if Is_Entity_Name (Node (C))
6668 and then Entity (Node (C)) = Entity (Discrim)
6670 -- D is renamed by Discrim, whose value is given in
6677 Make_Component_Association (Sloc (Typ),
6679 (New_Occurrence_Of (D, Sloc (Typ))),
6680 Duplicate_Subexpr_No_Checks (Node (C)));
6682 exit Find_Constraint;
6685 Next_Discriminant (D);
6692 if No (Next (Assoc)) then
6693 Error_Msg_NE (" missing value for discriminant&",
6694 First (Governed_By), Discrim_Name);
6695 Report_Errors := True;
6700 end loop Find_Constraint;
6702 Discrim_Value := Expression (Assoc);
6704 if not Is_OK_Static_Expression (Discrim_Value) then
6706 ("value for discriminant & must be static!",
6707 Discrim_Value, Discrim);
6708 Why_Not_Static (Discrim_Value);
6709 Report_Errors := True;
6713 Search_For_Discriminant_Value : declare
6719 UI_Discrim_Value : constant Uint := Expr_Value (Discrim_Value);
6722 Find_Discrete_Value : while Present (Variant) loop
6723 Discrete_Choice := First (Discrete_Choices (Variant));
6724 while Present (Discrete_Choice) loop
6725 exit Find_Discrete_Value when
6726 Nkind (Discrete_Choice) = N_Others_Choice;
6728 Get_Index_Bounds (Discrete_Choice, Low, High);
6730 UI_Low := Expr_Value (Low);
6731 UI_High := Expr_Value (High);
6733 exit Find_Discrete_Value when
6734 UI_Low <= UI_Discrim_Value
6736 UI_High >= UI_Discrim_Value;
6738 Next (Discrete_Choice);
6741 Next_Non_Pragma (Variant);
6742 end loop Find_Discrete_Value;
6743 end Search_For_Discriminant_Value;
6745 if No (Variant) then
6747 ("value of discriminant & is out of range", Discrim_Value, Discrim);
6748 Report_Errors := True;
6752 -- If we have found the corresponding choice, recursively add its
6753 -- components to the Into list.
6756 (Empty, Component_List (Variant), Governed_By, Into, Report_Errors);
6757 end Gather_Components;
6759 ------------------------
6760 -- Get_Actual_Subtype --
6761 ------------------------
6763 function Get_Actual_Subtype (N : Node_Id) return Entity_Id is
6764 Typ : constant Entity_Id := Etype (N);
6765 Utyp : Entity_Id := Underlying_Type (Typ);
6774 -- If what we have is an identifier that references a subprogram
6775 -- formal, or a variable or constant object, then we get the actual
6776 -- subtype from the referenced entity if one has been built.
6778 if Nkind (N) = N_Identifier
6780 (Is_Formal (Entity (N))
6781 or else Ekind (Entity (N)) = E_Constant
6782 or else Ekind (Entity (N)) = E_Variable)
6783 and then Present (Actual_Subtype (Entity (N)))
6785 return Actual_Subtype (Entity (N));
6787 -- Actual subtype of unchecked union is always itself. We never need
6788 -- the "real" actual subtype. If we did, we couldn't get it anyway
6789 -- because the discriminant is not available. The restrictions on
6790 -- Unchecked_Union are designed to make sure that this is OK.
6792 elsif Is_Unchecked_Union (Base_Type (Utyp)) then
6795 -- Here for the unconstrained case, we must find actual subtype
6796 -- No actual subtype is available, so we must build it on the fly.
6798 -- Checking the type, not the underlying type, for constrainedness
6799 -- seems to be necessary. Maybe all the tests should be on the type???
6801 elsif (not Is_Constrained (Typ))
6802 and then (Is_Array_Type (Utyp)
6803 or else (Is_Record_Type (Utyp)
6804 and then Has_Discriminants (Utyp)))
6805 and then not Has_Unknown_Discriminants (Utyp)
6806 and then not (Ekind (Utyp) = E_String_Literal_Subtype)
6808 -- Nothing to do if in spec expression (why not???)
6810 if In_Spec_Expression then
6813 elsif Is_Private_Type (Typ) and then not Has_Discriminants (Typ) then
6815 -- If the type has no discriminants, there is no subtype to
6816 -- build, even if the underlying type is discriminated.
6820 -- Else build the actual subtype
6823 Decl := Build_Actual_Subtype (Typ, N);
6824 Atyp := Defining_Identifier (Decl);
6826 -- If Build_Actual_Subtype generated a new declaration then use it
6830 -- The actual subtype is an Itype, so analyze the declaration,
6831 -- but do not attach it to the tree, to get the type defined.
6833 Set_Parent (Decl, N);
6834 Set_Is_Itype (Atyp);
6835 Analyze (Decl, Suppress => All_Checks);
6836 Set_Associated_Node_For_Itype (Atyp, N);
6837 Set_Has_Delayed_Freeze (Atyp, False);
6839 -- We need to freeze the actual subtype immediately. This is
6840 -- needed, because otherwise this Itype will not get frozen
6841 -- at all, and it is always safe to freeze on creation because
6842 -- any associated types must be frozen at this point.
6844 Freeze_Itype (Atyp, N);
6847 -- Otherwise we did not build a declaration, so return original
6854 -- For all remaining cases, the actual subtype is the same as
6855 -- the nominal type.
6860 end Get_Actual_Subtype;
6862 -------------------------------------
6863 -- Get_Actual_Subtype_If_Available --
6864 -------------------------------------
6866 function Get_Actual_Subtype_If_Available (N : Node_Id) return Entity_Id is
6867 Typ : constant Entity_Id := Etype (N);
6870 -- If what we have is an identifier that references a subprogram
6871 -- formal, or a variable or constant object, then we get the actual
6872 -- subtype from the referenced entity if one has been built.
6874 if Nkind (N) = N_Identifier
6876 (Is_Formal (Entity (N))
6877 or else Ekind (Entity (N)) = E_Constant
6878 or else Ekind (Entity (N)) = E_Variable)
6879 and then Present (Actual_Subtype (Entity (N)))
6881 return Actual_Subtype (Entity (N));
6883 -- Otherwise the Etype of N is returned unchanged
6888 end Get_Actual_Subtype_If_Available;
6890 ------------------------
6891 -- Get_Body_From_Stub --
6892 ------------------------
6894 function Get_Body_From_Stub (N : Node_Id) return Node_Id is
6896 return Proper_Body (Unit (Library_Unit (N)));
6897 end Get_Body_From_Stub;
6899 ---------------------
6900 -- Get_Cursor_Type --
6901 ---------------------
6903 function Get_Cursor_Type
6905 Typ : Entity_Id) return Entity_Id
6909 First_Op : Entity_Id;
6913 -- If error already detected, return
6915 if Error_Posted (Aspect) then
6919 -- The cursor type for an Iterable aspect is the return type of a
6920 -- non-overloaded First primitive operation. Locate association for
6923 Assoc := First (Component_Associations (Expression (Aspect)));
6925 while Present (Assoc) loop
6926 if Chars (First (Choices (Assoc))) = Name_First then
6927 First_Op := Expression (Assoc);
6934 if First_Op = Any_Id then
6935 Error_Msg_N ("aspect Iterable must specify First operation", Aspect);
6941 -- Locate function with desired name and profile in scope of type
6943 Func := First_Entity (Scope (Typ));
6944 while Present (Func) loop
6945 if Chars (Func) = Chars (First_Op)
6946 and then Ekind (Func) = E_Function
6947 and then Present (First_Formal (Func))
6948 and then Etype (First_Formal (Func)) = Typ
6949 and then No (Next_Formal (First_Formal (Func)))
6951 if Cursor /= Any_Type then
6953 ("Operation First for iterable type must be unique", Aspect);
6956 Cursor := Etype (Func);
6963 -- If not found, no way to resolve remaining primitives.
6965 if Cursor = Any_Type then
6967 ("No legal primitive operation First for Iterable type", Aspect);
6971 end Get_Cursor_Type;
6973 -------------------------------
6974 -- Get_Default_External_Name --
6975 -------------------------------
6977 function Get_Default_External_Name (E : Node_Or_Entity_Id) return Node_Id is
6979 Get_Decoded_Name_String (Chars (E));
6981 if Opt.External_Name_Imp_Casing = Uppercase then
6982 Set_Casing (All_Upper_Case);
6984 Set_Casing (All_Lower_Case);
6988 Make_String_Literal (Sloc (E),
6989 Strval => String_From_Name_Buffer);
6990 end Get_Default_External_Name;
6992 --------------------------
6993 -- Get_Enclosing_Object --
6994 --------------------------
6996 function Get_Enclosing_Object (N : Node_Id) return Entity_Id is
6998 if Is_Entity_Name (N) then
7002 when N_Indexed_Component |
7004 N_Selected_Component =>
7006 -- If not generating code, a dereference may be left implicit.
7007 -- In thoses cases, return Empty.
7009 if Is_Access_Type (Etype (Prefix (N))) then
7012 return Get_Enclosing_Object (Prefix (N));
7015 when N_Type_Conversion =>
7016 return Get_Enclosing_Object (Expression (N));
7022 end Get_Enclosing_Object;
7024 ---------------------------
7025 -- Get_Enum_Lit_From_Pos --
7026 ---------------------------
7028 function Get_Enum_Lit_From_Pos
7031 Loc : Source_Ptr) return Node_Id
7033 Btyp : Entity_Id := Base_Type (T);
7037 -- In the case where the literal is of type Character, Wide_Character
7038 -- or Wide_Wide_Character or of a type derived from them, there needs
7039 -- to be some special handling since there is no explicit chain of
7040 -- literals to search. Instead, an N_Character_Literal node is created
7041 -- with the appropriate Char_Code and Chars fields.
7043 if Is_Standard_Character_Type (T) then
7044 Set_Character_Literal_Name (UI_To_CC (Pos));
7046 Make_Character_Literal (Loc,
7048 Char_Literal_Value => Pos);
7050 -- For all other cases, we have a complete table of literals, and
7051 -- we simply iterate through the chain of literal until the one
7052 -- with the desired position value is found.
7055 if Is_Private_Type (Btyp) and then Present (Full_View (Btyp)) then
7056 Btyp := Full_View (Btyp);
7059 Lit := First_Literal (Btyp);
7060 for J in 1 .. UI_To_Int (Pos) loop
7064 return New_Occurrence_Of (Lit, Loc);
7066 end Get_Enum_Lit_From_Pos;
7068 ---------------------------------
7069 -- Get_Ensures_From_CTC_Pragma --
7070 ---------------------------------
7072 function Get_Ensures_From_CTC_Pragma (N : Node_Id) return Node_Id is
7073 Args : constant List_Id := Pragma_Argument_Associations (N);
7077 if List_Length (Args) = 4 then
7078 Res := Pick (Args, 4);
7080 elsif List_Length (Args) = 3 then
7081 Res := Pick (Args, 3);
7083 if Chars (Res) /= Name_Ensures then
7092 end Get_Ensures_From_CTC_Pragma;
7094 ------------------------
7095 -- Get_Generic_Entity --
7096 ------------------------
7098 function Get_Generic_Entity (N : Node_Id) return Entity_Id is
7099 Ent : constant Entity_Id := Entity (Name (N));
7101 if Present (Renamed_Object (Ent)) then
7102 return Renamed_Object (Ent);
7106 end Get_Generic_Entity;
7108 -------------------------------------
7109 -- Get_Incomplete_View_Of_Ancestor --
7110 -------------------------------------
7112 function Get_Incomplete_View_Of_Ancestor (E : Entity_Id) return Entity_Id is
7113 Cur_Unit : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
7114 Par_Scope : Entity_Id;
7115 Par_Type : Entity_Id;
7118 -- The incomplete view of an ancestor is only relevant for private
7119 -- derived types in child units.
7121 if not Is_Derived_Type (E)
7122 or else not Is_Child_Unit (Cur_Unit)
7127 Par_Scope := Scope (Cur_Unit);
7128 if No (Par_Scope) then
7132 Par_Type := Etype (Base_Type (E));
7134 -- Traverse list of ancestor types until we find one declared in
7135 -- a parent or grandparent unit (two levels seem sufficient).
7137 while Present (Par_Type) loop
7138 if Scope (Par_Type) = Par_Scope
7139 or else Scope (Par_Type) = Scope (Par_Scope)
7143 elsif not Is_Derived_Type (Par_Type) then
7147 Par_Type := Etype (Base_Type (Par_Type));
7151 -- If none found, there is no relevant ancestor type.
7155 end Get_Incomplete_View_Of_Ancestor;
7157 ----------------------
7158 -- Get_Index_Bounds --
7159 ----------------------
7161 procedure Get_Index_Bounds (N : Node_Id; L, H : out Node_Id) is
7162 Kind : constant Node_Kind := Nkind (N);
7166 if Kind = N_Range then
7168 H := High_Bound (N);
7170 elsif Kind = N_Subtype_Indication then
7171 R := Range_Expression (Constraint (N));
7179 L := Low_Bound (Range_Expression (Constraint (N)));
7180 H := High_Bound (Range_Expression (Constraint (N)));
7183 elsif Is_Entity_Name (N) and then Is_Type (Entity (N)) then
7184 if Error_Posted (Scalar_Range (Entity (N))) then
7188 elsif Nkind (Scalar_Range (Entity (N))) = N_Subtype_Indication then
7189 Get_Index_Bounds (Scalar_Range (Entity (N)), L, H);
7192 L := Low_Bound (Scalar_Range (Entity (N)));
7193 H := High_Bound (Scalar_Range (Entity (N)));
7197 -- N is an expression, indicating a range with one value
7202 end Get_Index_Bounds;
7204 ---------------------------------
7205 -- Get_Iterable_Type_Primitive --
7206 ---------------------------------
7208 function Get_Iterable_Type_Primitive
7210 Nam : Name_Id) return Entity_Id
7212 Funcs : constant Node_Id := Find_Value_Of_Aspect (Typ, Aspect_Iterable);
7220 Assoc := First (Component_Associations (Funcs));
7221 while Present (Assoc) loop
7222 if Chars (First (Choices (Assoc))) = Nam then
7223 return Entity (Expression (Assoc));
7226 Assoc := Next (Assoc);
7231 end Get_Iterable_Type_Primitive;
7233 ----------------------------------
7234 -- Get_Library_Unit_Name_string --
7235 ----------------------------------
7237 procedure Get_Library_Unit_Name_String (Decl_Node : Node_Id) is
7238 Unit_Name_Id : constant Unit_Name_Type := Get_Unit_Name (Decl_Node);
7241 Get_Unit_Name_String (Unit_Name_Id);
7243 -- Remove seven last character (" (spec)" or " (body)")
7245 Name_Len := Name_Len - 7;
7246 pragma Assert (Name_Buffer (Name_Len + 1) = ' ');
7247 end Get_Library_Unit_Name_String;
7249 ------------------------
7250 -- Get_Name_Entity_Id --
7251 ------------------------
7253 function Get_Name_Entity_Id (Id : Name_Id) return Entity_Id is
7255 return Entity_Id (Get_Name_Table_Int (Id));
7256 end Get_Name_Entity_Id;
7258 ------------------------------
7259 -- Get_Name_From_CTC_Pragma --
7260 ------------------------------
7262 function Get_Name_From_CTC_Pragma (N : Node_Id) return String_Id is
7263 Arg : constant Node_Id :=
7264 Get_Pragma_Arg (First (Pragma_Argument_Associations (N)));
7266 return Strval (Expr_Value_S (Arg));
7267 end Get_Name_From_CTC_Pragma;
7269 -----------------------
7270 -- Get_Parent_Entity --
7271 -----------------------
7273 function Get_Parent_Entity (Unit : Node_Id) return Entity_Id is
7275 if Nkind (Unit) = N_Package_Body
7276 and then Nkind (Original_Node (Unit)) = N_Package_Instantiation
7278 return Defining_Entity
7279 (Specification (Instance_Spec (Original_Node (Unit))));
7280 elsif Nkind (Unit) = N_Package_Instantiation then
7281 return Defining_Entity (Specification (Instance_Spec (Unit)));
7283 return Defining_Entity (Unit);
7285 end Get_Parent_Entity;
7290 function Get_Pragma_Id (N : Node_Id) return Pragma_Id is
7292 return Get_Pragma_Id (Pragma_Name (N));
7295 -----------------------
7296 -- Get_Reason_String --
7297 -----------------------
7299 procedure Get_Reason_String (N : Node_Id) is
7301 if Nkind (N) = N_String_Literal then
7302 Store_String_Chars (Strval (N));
7304 elsif Nkind (N) = N_Op_Concat then
7305 Get_Reason_String (Left_Opnd (N));
7306 Get_Reason_String (Right_Opnd (N));
7308 -- If not of required form, error
7312 ("Reason for pragma Warnings has wrong form", N);
7314 ("\must be string literal or concatenation of string literals", N);
7317 end Get_Reason_String;
7319 ---------------------------
7320 -- Get_Referenced_Object --
7321 ---------------------------
7323 function Get_Referenced_Object (N : Node_Id) return Node_Id is
7328 while Is_Entity_Name (R)
7329 and then Present (Renamed_Object (Entity (R)))
7331 R := Renamed_Object (Entity (R));
7335 end Get_Referenced_Object;
7337 ------------------------
7338 -- Get_Renamed_Entity --
7339 ------------------------
7341 function Get_Renamed_Entity (E : Entity_Id) return Entity_Id is
7346 while Present (Renamed_Entity (R)) loop
7347 R := Renamed_Entity (R);
7351 end Get_Renamed_Entity;
7353 ----------------------------------
7354 -- Get_Requires_From_CTC_Pragma --
7355 ----------------------------------
7357 function Get_Requires_From_CTC_Pragma (N : Node_Id) return Node_Id is
7358 Args : constant List_Id := Pragma_Argument_Associations (N);
7362 if List_Length (Args) >= 3 then
7363 Res := Pick (Args, 3);
7365 if Chars (Res) /= Name_Requires then
7374 end Get_Requires_From_CTC_Pragma;
7376 -------------------------
7377 -- Get_Subprogram_Body --
7378 -------------------------
7380 function Get_Subprogram_Body (E : Entity_Id) return Node_Id is
7384 Decl := Unit_Declaration_Node (E);
7386 if Nkind (Decl) = N_Subprogram_Body then
7389 -- The below comment is bad, because it is possible for
7390 -- Nkind (Decl) to be an N_Subprogram_Body_Stub ???
7392 else -- Nkind (Decl) = N_Subprogram_Declaration
7394 if Present (Corresponding_Body (Decl)) then
7395 return Unit_Declaration_Node (Corresponding_Body (Decl));
7397 -- Imported subprogram case
7403 end Get_Subprogram_Body;
7405 ---------------------------
7406 -- Get_Subprogram_Entity --
7407 ---------------------------
7409 function Get_Subprogram_Entity (Nod : Node_Id) return Entity_Id is
7411 Subp_Id : Entity_Id;
7414 if Nkind (Nod) = N_Accept_Statement then
7415 Subp := Entry_Direct_Name (Nod);
7417 elsif Nkind (Nod) = N_Slice then
7418 Subp := Prefix (Nod);
7424 -- Strip the subprogram call
7427 if Nkind_In (Subp, N_Explicit_Dereference,
7428 N_Indexed_Component,
7429 N_Selected_Component)
7431 Subp := Prefix (Subp);
7433 elsif Nkind_In (Subp, N_Type_Conversion,
7434 N_Unchecked_Type_Conversion)
7436 Subp := Expression (Subp);
7443 -- Extract the entity of the subprogram call
7445 if Is_Entity_Name (Subp) then
7446 Subp_Id := Entity (Subp);
7448 if Ekind (Subp_Id) = E_Access_Subprogram_Type then
7449 Subp_Id := Directly_Designated_Type (Subp_Id);
7452 if Is_Subprogram (Subp_Id) then
7458 -- The search did not find a construct that denotes a subprogram
7463 end Get_Subprogram_Entity;
7465 -----------------------------
7466 -- Get_Task_Body_Procedure --
7467 -----------------------------
7469 function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
7471 -- Note: A task type may be the completion of a private type with
7472 -- discriminants. When performing elaboration checks on a task
7473 -- declaration, the current view of the type may be the private one,
7474 -- and the procedure that holds the body of the task is held in its
7477 -- This is an odd function, why not have Task_Body_Procedure do
7478 -- the following digging???
7480 return Task_Body_Procedure (Underlying_Type (Root_Type (E)));
7481 end Get_Task_Body_Procedure;
7483 -----------------------
7484 -- Has_Access_Values --
7485 -----------------------
7487 function Has_Access_Values (T : Entity_Id) return Boolean is
7488 Typ : constant Entity_Id := Underlying_Type (T);
7491 -- Case of a private type which is not completed yet. This can only
7492 -- happen in the case of a generic format type appearing directly, or
7493 -- as a component of the type to which this function is being applied
7494 -- at the top level. Return False in this case, since we certainly do
7495 -- not know that the type contains access types.
7500 elsif Is_Access_Type (Typ) then
7503 elsif Is_Array_Type (Typ) then
7504 return Has_Access_Values (Component_Type (Typ));
7506 elsif Is_Record_Type (Typ) then
7511 -- Loop to Check components
7513 Comp := First_Component_Or_Discriminant (Typ);
7514 while Present (Comp) loop
7516 -- Check for access component, tag field does not count, even
7517 -- though it is implemented internally using an access type.
7519 if Has_Access_Values (Etype (Comp))
7520 and then Chars (Comp) /= Name_uTag
7525 Next_Component_Or_Discriminant (Comp);
7534 end Has_Access_Values;
7536 ------------------------------
7537 -- Has_Compatible_Alignment --
7538 ------------------------------
7540 function Has_Compatible_Alignment
7542 Expr : Node_Id) return Alignment_Result
7544 function Has_Compatible_Alignment_Internal
7547 Default : Alignment_Result) return Alignment_Result;
7548 -- This is the internal recursive function that actually does the work.
7549 -- There is one additional parameter, which says what the result should
7550 -- be if no alignment information is found, and there is no definite
7551 -- indication of compatible alignments. At the outer level, this is set
7552 -- to Unknown, but for internal recursive calls in the case where types
7553 -- are known to be correct, it is set to Known_Compatible.
7555 ---------------------------------------
7556 -- Has_Compatible_Alignment_Internal --
7557 ---------------------------------------
7559 function Has_Compatible_Alignment_Internal
7562 Default : Alignment_Result) return Alignment_Result
7564 Result : Alignment_Result := Known_Compatible;
7565 -- Holds the current status of the result. Note that once a value of
7566 -- Known_Incompatible is set, it is sticky and does not get changed
7567 -- to Unknown (the value in Result only gets worse as we go along,
7570 Offs : Uint := No_Uint;
7571 -- Set to a factor of the offset from the base object when Expr is a
7572 -- selected or indexed component, based on Component_Bit_Offset and
7573 -- Component_Size respectively. A negative value is used to represent
7574 -- a value which is not known at compile time.
7576 procedure Check_Prefix;
7577 -- Checks the prefix recursively in the case where the expression
7578 -- is an indexed or selected component.
7580 procedure Set_Result (R : Alignment_Result);
7581 -- If R represents a worse outcome (unknown instead of known
7582 -- compatible, or known incompatible), then set Result to R.
7588 procedure Check_Prefix is
7590 -- The subtlety here is that in doing a recursive call to check
7591 -- the prefix, we have to decide what to do in the case where we
7592 -- don't find any specific indication of an alignment problem.
7594 -- At the outer level, we normally set Unknown as the result in
7595 -- this case, since we can only set Known_Compatible if we really
7596 -- know that the alignment value is OK, but for the recursive
7597 -- call, in the case where the types match, and we have not
7598 -- specified a peculiar alignment for the object, we are only
7599 -- concerned about suspicious rep clauses, the default case does
7600 -- not affect us, since the compiler will, in the absence of such
7601 -- rep clauses, ensure that the alignment is correct.
7603 if Default = Known_Compatible
7605 (Etype (Obj) = Etype (Expr)
7606 and then (Unknown_Alignment (Obj)
7608 Alignment (Obj) = Alignment (Etype (Obj))))
7611 (Has_Compatible_Alignment_Internal
7612 (Obj, Prefix (Expr), Known_Compatible));
7614 -- In all other cases, we need a full check on the prefix
7618 (Has_Compatible_Alignment_Internal
7619 (Obj, Prefix (Expr), Unknown));
7627 procedure Set_Result (R : Alignment_Result) is
7634 -- Start of processing for Has_Compatible_Alignment_Internal
7637 -- If Expr is a selected component, we must make sure there is no
7638 -- potentially troublesome component clause, and that the record is
7641 if Nkind (Expr) = N_Selected_Component then
7643 -- Packed record always generate unknown alignment
7645 if Is_Packed (Etype (Prefix (Expr))) then
7646 Set_Result (Unknown);
7649 -- Check prefix and component offset
7652 Offs := Component_Bit_Offset (Entity (Selector_Name (Expr)));
7654 -- If Expr is an indexed component, we must make sure there is no
7655 -- potentially troublesome Component_Size clause and that the array
7656 -- is not bit-packed.
7658 elsif Nkind (Expr) = N_Indexed_Component then
7660 Typ : constant Entity_Id := Etype (Prefix (Expr));
7661 Ind : constant Node_Id := First_Index (Typ);
7664 -- Bit packed array always generates unknown alignment
7666 if Is_Bit_Packed_Array (Typ) then
7667 Set_Result (Unknown);
7670 -- Check prefix and component offset
7673 Offs := Component_Size (Typ);
7675 -- Small optimization: compute the full offset when possible
7678 and then Offs > Uint_0
7679 and then Present (Ind)
7680 and then Nkind (Ind) = N_Range
7681 and then Compile_Time_Known_Value (Low_Bound (Ind))
7682 and then Compile_Time_Known_Value (First (Expressions (Expr)))
7684 Offs := Offs * (Expr_Value (First (Expressions (Expr)))
7685 - Expr_Value (Low_Bound ((Ind))));
7690 -- If we have a null offset, the result is entirely determined by
7691 -- the base object and has already been computed recursively.
7693 if Offs = Uint_0 then
7696 -- Case where we know the alignment of the object
7698 elsif Known_Alignment (Obj) then
7700 ObjA : constant Uint := Alignment (Obj);
7701 ExpA : Uint := No_Uint;
7702 SizA : Uint := No_Uint;
7705 -- If alignment of Obj is 1, then we are always OK
7708 Set_Result (Known_Compatible);
7710 -- Alignment of Obj is greater than 1, so we need to check
7713 -- If we have an offset, see if it is compatible
7715 if Offs /= No_Uint and Offs > Uint_0 then
7716 if Offs mod (System_Storage_Unit * ObjA) /= 0 then
7717 Set_Result (Known_Incompatible);
7720 -- See if Expr is an object with known alignment
7722 elsif Is_Entity_Name (Expr)
7723 and then Known_Alignment (Entity (Expr))
7725 ExpA := Alignment (Entity (Expr));
7727 -- Otherwise, we can use the alignment of the type of
7728 -- Expr given that we already checked for
7729 -- discombobulating rep clauses for the cases of indexed
7730 -- and selected components above.
7732 elsif Known_Alignment (Etype (Expr)) then
7733 ExpA := Alignment (Etype (Expr));
7735 -- Otherwise the alignment is unknown
7738 Set_Result (Default);
7741 -- If we got an alignment, see if it is acceptable
7743 if ExpA /= No_Uint and then ExpA < ObjA then
7744 Set_Result (Known_Incompatible);
7747 -- If Expr is not a piece of a larger object, see if size
7748 -- is given. If so, check that it is not too small for the
7749 -- required alignment.
7751 if Offs /= No_Uint then
7754 -- See if Expr is an object with known size
7756 elsif Is_Entity_Name (Expr)
7757 and then Known_Static_Esize (Entity (Expr))
7759 SizA := Esize (Entity (Expr));
7761 -- Otherwise, we check the object size of the Expr type
7763 elsif Known_Static_Esize (Etype (Expr)) then
7764 SizA := Esize (Etype (Expr));
7767 -- If we got a size, see if it is a multiple of the Obj
7768 -- alignment, if not, then the alignment cannot be
7769 -- acceptable, since the size is always a multiple of the
7772 if SizA /= No_Uint then
7773 if SizA mod (ObjA * Ttypes.System_Storage_Unit) /= 0 then
7774 Set_Result (Known_Incompatible);
7780 -- If we do not know required alignment, any non-zero offset is a
7781 -- potential problem (but certainly may be OK, so result is unknown).
7783 elsif Offs /= No_Uint then
7784 Set_Result (Unknown);
7786 -- If we can't find the result by direct comparison of alignment
7787 -- values, then there is still one case that we can determine known
7788 -- result, and that is when we can determine that the types are the
7789 -- same, and no alignments are specified. Then we known that the
7790 -- alignments are compatible, even if we don't know the alignment
7791 -- value in the front end.
7793 elsif Etype (Obj) = Etype (Expr) then
7795 -- Types are the same, but we have to check for possible size
7796 -- and alignments on the Expr object that may make the alignment
7797 -- different, even though the types are the same.
7799 if Is_Entity_Name (Expr) then
7801 -- First check alignment of the Expr object. Any alignment less
7802 -- than Maximum_Alignment is worrisome since this is the case
7803 -- where we do not know the alignment of Obj.
7805 if Known_Alignment (Entity (Expr))
7806 and then UI_To_Int (Alignment (Entity (Expr))) <
7807 Ttypes.Maximum_Alignment
7809 Set_Result (Unknown);
7811 -- Now check size of Expr object. Any size that is not an
7812 -- even multiple of Maximum_Alignment is also worrisome
7813 -- since it may cause the alignment of the object to be less
7814 -- than the alignment of the type.
7816 elsif Known_Static_Esize (Entity (Expr))
7818 (UI_To_Int (Esize (Entity (Expr))) mod
7819 (Ttypes.Maximum_Alignment * Ttypes.System_Storage_Unit))
7822 Set_Result (Unknown);
7824 -- Otherwise same type is decisive
7827 Set_Result (Known_Compatible);
7831 -- Another case to deal with is when there is an explicit size or
7832 -- alignment clause when the types are not the same. If so, then the
7833 -- result is Unknown. We don't need to do this test if the Default is
7834 -- Unknown, since that result will be set in any case.
7836 elsif Default /= Unknown
7837 and then (Has_Size_Clause (Etype (Expr))
7839 Has_Alignment_Clause (Etype (Expr)))
7841 Set_Result (Unknown);
7843 -- If no indication found, set default
7846 Set_Result (Default);
7849 -- Return worst result found
7852 end Has_Compatible_Alignment_Internal;
7854 -- Start of processing for Has_Compatible_Alignment
7857 -- If Obj has no specified alignment, then set alignment from the type
7858 -- alignment. Perhaps we should always do this, but for sure we should
7859 -- do it when there is an address clause since we can do more if the
7860 -- alignment is known.
7862 if Unknown_Alignment (Obj) then
7863 Set_Alignment (Obj, Alignment (Etype (Obj)));
7866 -- Now do the internal call that does all the work
7868 return Has_Compatible_Alignment_Internal (Obj, Expr, Unknown);
7869 end Has_Compatible_Alignment;
7871 ----------------------
7872 -- Has_Declarations --
7873 ----------------------
7875 function Has_Declarations (N : Node_Id) return Boolean is
7877 return Nkind_In (Nkind (N), N_Accept_Statement,
7879 N_Compilation_Unit_Aux,
7885 N_Package_Specification);
7886 end Has_Declarations;
7888 ---------------------------------
7889 -- Has_Defaulted_Discriminants --
7890 ---------------------------------
7892 function Has_Defaulted_Discriminants (Typ : Entity_Id) return Boolean is
7894 return Has_Discriminants (Typ)
7895 and then Present (First_Discriminant (Typ))
7896 and then Present (Discriminant_Default_Value
7897 (First_Discriminant (Typ)));
7898 end Has_Defaulted_Discriminants;
7904 function Has_Denormals (E : Entity_Id) return Boolean is
7906 return Is_Floating_Point_Type (E) and then Denorm_On_Target;
7909 -------------------------------------------
7910 -- Has_Discriminant_Dependent_Constraint --
7911 -------------------------------------------
7913 function Has_Discriminant_Dependent_Constraint
7914 (Comp : Entity_Id) return Boolean
7916 Comp_Decl : constant Node_Id := Parent (Comp);
7917 Subt_Indic : Node_Id;
7922 -- Discriminants can't depend on discriminants
7924 if Ekind (Comp) = E_Discriminant then
7928 Subt_Indic := Subtype_Indication (Component_Definition (Comp_Decl));
7930 if Nkind (Subt_Indic) = N_Subtype_Indication then
7931 Constr := Constraint (Subt_Indic);
7933 if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
7934 Assn := First (Constraints (Constr));
7935 while Present (Assn) loop
7936 case Nkind (Assn) is
7937 when N_Subtype_Indication |
7941 if Depends_On_Discriminant (Assn) then
7945 when N_Discriminant_Association =>
7946 if Depends_On_Discriminant (Expression (Assn)) then
7961 end Has_Discriminant_Dependent_Constraint;
7963 --------------------------
7964 -- Has_Enabled_Property --
7965 --------------------------
7967 function Has_Enabled_Property
7968 (Item_Id : Entity_Id;
7969 Property : Name_Id) return Boolean
7971 function State_Has_Enabled_Property return Boolean;
7972 -- Determine whether a state denoted by Item_Id has the property enabled
7974 function Variable_Has_Enabled_Property return Boolean;
7975 -- Determine whether a variable denoted by Item_Id has the property
7978 --------------------------------
7979 -- State_Has_Enabled_Property --
7980 --------------------------------
7982 function State_Has_Enabled_Property return Boolean is
7983 Decl : constant Node_Id := Parent (Item_Id);
7991 -- The declaration of an external abstract state appears as an
7992 -- extension aggregate. If this is not the case, properties can never
7995 if Nkind (Decl) /= N_Extension_Aggregate then
7999 -- When External appears as a simple option, it automatically enables
8002 Opt := First (Expressions (Decl));
8003 while Present (Opt) loop
8004 if Nkind (Opt) = N_Identifier
8005 and then Chars (Opt) = Name_External
8013 -- When External specifies particular properties, inspect those and
8014 -- find the desired one (if any).
8016 Opt := First (Component_Associations (Decl));
8017 while Present (Opt) loop
8018 Opt_Nam := First (Choices (Opt));
8020 if Nkind (Opt_Nam) = N_Identifier
8021 and then Chars (Opt_Nam) = Name_External
8023 Props := Expression (Opt);
8025 -- Multiple properties appear as an aggregate
8027 if Nkind (Props) = N_Aggregate then
8029 -- Simple property form
8031 Prop := First (Expressions (Props));
8032 while Present (Prop) loop
8033 if Chars (Prop) = Property then
8040 -- Property with expression form
8042 Prop := First (Component_Associations (Props));
8043 while Present (Prop) loop
8044 Prop_Nam := First (Choices (Prop));
8046 -- The property can be represented in two ways:
8047 -- others => <value>
8048 -- <property> => <value>
8050 if Nkind (Prop_Nam) = N_Others_Choice
8051 or else (Nkind (Prop_Nam) = N_Identifier
8052 and then Chars (Prop_Nam) = Property)
8054 return Is_True (Expr_Value (Expression (Prop)));
8063 return Chars (Props) = Property;
8071 end State_Has_Enabled_Property;
8073 -----------------------------------
8074 -- Variable_Has_Enabled_Property --
8075 -----------------------------------
8077 function Variable_Has_Enabled_Property return Boolean is
8078 function Is_Enabled (Prag : Node_Id) return Boolean;
8079 -- Determine whether property pragma Prag (if present) denotes an
8080 -- enabled property.
8086 function Is_Enabled (Prag : Node_Id) return Boolean is
8090 if Present (Prag) then
8091 Arg2 := Next (First (Pragma_Argument_Associations (Prag)));
8093 -- The pragma has an optional Boolean expression, the related
8094 -- property is enabled only when the expression evaluates to
8097 if Present (Arg2) then
8098 return Is_True (Expr_Value (Get_Pragma_Arg (Arg2)));
8100 -- Otherwise the lack of expression enables the property by
8107 -- The property was never set in the first place
8116 AR : constant Node_Id :=
8117 Get_Pragma (Item_Id, Pragma_Async_Readers);
8118 AW : constant Node_Id :=
8119 Get_Pragma (Item_Id, Pragma_Async_Writers);
8120 ER : constant Node_Id :=
8121 Get_Pragma (Item_Id, Pragma_Effective_Reads);
8122 EW : constant Node_Id :=
8123 Get_Pragma (Item_Id, Pragma_Effective_Writes);
8125 -- Start of processing for Variable_Has_Enabled_Property
8128 -- A non-effectively volatile object can never possess external
8131 if not Is_Effectively_Volatile (Item_Id) then
8134 -- External properties related to variables come in two flavors -
8135 -- explicit and implicit. The explicit case is characterized by the
8136 -- presence of a property pragma with an optional Boolean flag. The
8137 -- property is enabled when the flag evaluates to True or the flag is
8138 -- missing altogether.
8140 elsif Property = Name_Async_Readers and then Is_Enabled (AR) then
8143 elsif Property = Name_Async_Writers and then Is_Enabled (AW) then
8146 elsif Property = Name_Effective_Reads and then Is_Enabled (ER) then
8149 elsif Property = Name_Effective_Writes and then Is_Enabled (EW) then
8152 -- The implicit case lacks all property pragmas
8154 elsif No (AR) and then No (AW) and then No (ER) and then No (EW) then
8160 end Variable_Has_Enabled_Property;
8162 -- Start of processing for Has_Enabled_Property
8165 -- Abstract states and variables have a flexible scheme of specifying
8166 -- external properties.
8168 if Ekind (Item_Id) = E_Abstract_State then
8169 return State_Has_Enabled_Property;
8171 elsif Ekind (Item_Id) = E_Variable then
8172 return Variable_Has_Enabled_Property;
8174 -- Otherwise a property is enabled when the related item is effectively
8178 return Is_Effectively_Volatile (Item_Id);
8180 end Has_Enabled_Property;
8182 --------------------
8183 -- Has_Infinities --
8184 --------------------
8186 function Has_Infinities (E : Entity_Id) return Boolean is
8189 Is_Floating_Point_Type (E)
8190 and then Nkind (Scalar_Range (E)) = N_Range
8191 and then Includes_Infinities (Scalar_Range (E));
8194 --------------------
8195 -- Has_Interfaces --
8196 --------------------
8198 function Has_Interfaces
8200 Use_Full_View : Boolean := True) return Boolean
8202 Typ : Entity_Id := Base_Type (T);
8205 -- Handle concurrent types
8207 if Is_Concurrent_Type (Typ) then
8208 Typ := Corresponding_Record_Type (Typ);
8211 if not Present (Typ)
8212 or else not Is_Record_Type (Typ)
8213 or else not Is_Tagged_Type (Typ)
8218 -- Handle private types
8220 if Use_Full_View and then Present (Full_View (Typ)) then
8221 Typ := Full_View (Typ);
8224 -- Handle concurrent record types
8226 if Is_Concurrent_Record_Type (Typ)
8227 and then Is_Non_Empty_List (Abstract_Interface_List (Typ))
8233 if Is_Interface (Typ)
8235 (Is_Record_Type (Typ)
8236 and then Present (Interfaces (Typ))
8237 and then not Is_Empty_Elmt_List (Interfaces (Typ)))
8242 exit when Etype (Typ) = Typ
8244 -- Handle private types
8246 or else (Present (Full_View (Etype (Typ)))
8247 and then Full_View (Etype (Typ)) = Typ)
8249 -- Protect frontend against wrong sources with cyclic derivations
8251 or else Etype (Typ) = T;
8253 -- Climb to the ancestor type handling private types
8255 if Present (Full_View (Etype (Typ))) then
8256 Typ := Full_View (Etype (Typ));
8265 ---------------------------------
8266 -- Has_No_Obvious_Side_Effects --
8267 ---------------------------------
8269 function Has_No_Obvious_Side_Effects (N : Node_Id) return Boolean is
8271 -- For now, just handle literals, constants, and non-volatile
8272 -- variables and expressions combining these with operators or
8273 -- short circuit forms.
8275 if Nkind (N) in N_Numeric_Or_String_Literal then
8278 elsif Nkind (N) = N_Character_Literal then
8281 elsif Nkind (N) in N_Unary_Op then
8282 return Has_No_Obvious_Side_Effects (Right_Opnd (N));
8284 elsif Nkind (N) in N_Binary_Op or else Nkind (N) in N_Short_Circuit then
8285 return Has_No_Obvious_Side_Effects (Left_Opnd (N))
8287 Has_No_Obvious_Side_Effects (Right_Opnd (N));
8289 elsif Nkind (N) = N_Expression_With_Actions
8290 and then Is_Empty_List (Actions (N))
8292 return Has_No_Obvious_Side_Effects (Expression (N));
8294 elsif Nkind (N) in N_Has_Entity then
8295 return Present (Entity (N))
8296 and then Ekind_In (Entity (N), E_Variable,
8298 E_Enumeration_Literal,
8302 and then not Is_Volatile (Entity (N));
8307 end Has_No_Obvious_Side_Effects;
8309 ------------------------
8310 -- Has_Null_Exclusion --
8311 ------------------------
8313 function Has_Null_Exclusion (N : Node_Id) return Boolean is
8316 when N_Access_Definition |
8317 N_Access_Function_Definition |
8318 N_Access_Procedure_Definition |
8319 N_Access_To_Object_Definition |
8321 N_Derived_Type_Definition |
8322 N_Function_Specification |
8323 N_Subtype_Declaration =>
8324 return Null_Exclusion_Present (N);
8326 when N_Component_Definition |
8327 N_Formal_Object_Declaration |
8328 N_Object_Renaming_Declaration =>
8329 if Present (Subtype_Mark (N)) then
8330 return Null_Exclusion_Present (N);
8331 else pragma Assert (Present (Access_Definition (N)));
8332 return Null_Exclusion_Present (Access_Definition (N));
8335 when N_Discriminant_Specification =>
8336 if Nkind (Discriminant_Type (N)) = N_Access_Definition then
8337 return Null_Exclusion_Present (Discriminant_Type (N));
8339 return Null_Exclusion_Present (N);
8342 when N_Object_Declaration =>
8343 if Nkind (Object_Definition (N)) = N_Access_Definition then
8344 return Null_Exclusion_Present (Object_Definition (N));
8346 return Null_Exclusion_Present (N);
8349 when N_Parameter_Specification =>
8350 if Nkind (Parameter_Type (N)) = N_Access_Definition then
8351 return Null_Exclusion_Present (Parameter_Type (N));
8353 return Null_Exclusion_Present (N);
8360 end Has_Null_Exclusion;
8362 ------------------------
8363 -- Has_Null_Extension --
8364 ------------------------
8366 function Has_Null_Extension (T : Entity_Id) return Boolean is
8367 B : constant Entity_Id := Base_Type (T);
8372 if Nkind (Parent (B)) = N_Full_Type_Declaration
8373 and then Present (Record_Extension_Part (Type_Definition (Parent (B))))
8375 Ext := Record_Extension_Part (Type_Definition (Parent (B)));
8377 if Present (Ext) then
8378 if Null_Present (Ext) then
8381 Comps := Component_List (Ext);
8383 -- The null component list is rewritten during analysis to
8384 -- include the parent component. Any other component indicates
8385 -- that the extension was not originally null.
8387 return Null_Present (Comps)
8388 or else No (Next (First (Component_Items (Comps))));
8397 end Has_Null_Extension;
8399 -------------------------------
8400 -- Has_Overriding_Initialize --
8401 -------------------------------
8403 function Has_Overriding_Initialize (T : Entity_Id) return Boolean is
8404 BT : constant Entity_Id := Base_Type (T);
8408 if Is_Controlled (BT) then
8409 if Is_RTU (Scope (BT), Ada_Finalization) then
8412 elsif Present (Primitive_Operations (BT)) then
8413 P := First_Elmt (Primitive_Operations (BT));
8414 while Present (P) loop
8416 Init : constant Entity_Id := Node (P);
8417 Formal : constant Entity_Id := First_Formal (Init);
8419 if Ekind (Init) = E_Procedure
8420 and then Chars (Init) = Name_Initialize
8421 and then Comes_From_Source (Init)
8422 and then Present (Formal)
8423 and then Etype (Formal) = BT
8424 and then No (Next_Formal (Formal))
8425 and then (Ada_Version < Ada_2012
8426 or else not Null_Present (Parent (Init)))
8436 -- Here if type itself does not have a non-null Initialize operation:
8437 -- check immediate ancestor.
8439 if Is_Derived_Type (BT)
8440 and then Has_Overriding_Initialize (Etype (BT))
8447 end Has_Overriding_Initialize;
8449 --------------------------------------
8450 -- Has_Preelaborable_Initialization --
8451 --------------------------------------
8453 function Has_Preelaborable_Initialization (E : Entity_Id) return Boolean is
8456 procedure Check_Components (E : Entity_Id);
8457 -- Check component/discriminant chain, sets Has_PE False if a component
8458 -- or discriminant does not meet the preelaborable initialization rules.
8460 ----------------------
8461 -- Check_Components --
8462 ----------------------
8464 procedure Check_Components (E : Entity_Id) is
8468 function Is_Preelaborable_Expression (N : Node_Id) return Boolean;
8469 -- Returns True if and only if the expression denoted by N does not
8470 -- violate restrictions on preelaborable constructs (RM-10.2.1(5-9)).
8472 ---------------------------------
8473 -- Is_Preelaborable_Expression --
8474 ---------------------------------
8476 function Is_Preelaborable_Expression (N : Node_Id) return Boolean is
8480 Comp_Type : Entity_Id;
8481 Is_Array_Aggr : Boolean;
8484 if Is_OK_Static_Expression (N) then
8487 elsif Nkind (N) = N_Null then
8490 -- Attributes are allowed in general, even if their prefix is a
8491 -- formal type. (It seems that certain attributes known not to be
8492 -- static might not be allowed, but there are no rules to prevent
8495 elsif Nkind (N) = N_Attribute_Reference then
8498 -- The name of a discriminant evaluated within its parent type is
8499 -- defined to be preelaborable (10.2.1(8)). Note that we test for
8500 -- names that denote discriminals as well as discriminants to
8501 -- catch references occurring within init procs.
8503 elsif Is_Entity_Name (N)
8505 (Ekind (Entity (N)) = E_Discriminant
8506 or else (Ekind_In (Entity (N), E_Constant, E_In_Parameter)
8507 and then Present (Discriminal_Link (Entity (N)))))
8511 elsif Nkind (N) = N_Qualified_Expression then
8512 return Is_Preelaborable_Expression (Expression (N));
8514 -- For aggregates we have to check that each of the associations
8515 -- is preelaborable.
8517 elsif Nkind_In (N, N_Aggregate, N_Extension_Aggregate) then
8518 Is_Array_Aggr := Is_Array_Type (Etype (N));
8520 if Is_Array_Aggr then
8521 Comp_Type := Component_Type (Etype (N));
8524 -- Check the ancestor part of extension aggregates, which must
8525 -- be either the name of a type that has preelaborable init or
8526 -- an expression that is preelaborable.
8528 if Nkind (N) = N_Extension_Aggregate then
8530 Anc_Part : constant Node_Id := Ancestor_Part (N);
8533 if Is_Entity_Name (Anc_Part)
8534 and then Is_Type (Entity (Anc_Part))
8536 if not Has_Preelaborable_Initialization
8542 elsif not Is_Preelaborable_Expression (Anc_Part) then
8548 -- Check positional associations
8550 Exp := First (Expressions (N));
8551 while Present (Exp) loop
8552 if not Is_Preelaborable_Expression (Exp) then
8559 -- Check named associations
8561 Assn := First (Component_Associations (N));
8562 while Present (Assn) loop
8563 Choice := First (Choices (Assn));
8564 while Present (Choice) loop
8565 if Is_Array_Aggr then
8566 if Nkind (Choice) = N_Others_Choice then
8569 elsif Nkind (Choice) = N_Range then
8570 if not Is_OK_Static_Range (Choice) then
8574 elsif not Is_OK_Static_Expression (Choice) then
8579 Comp_Type := Etype (Choice);
8585 -- If the association has a <> at this point, then we have
8586 -- to check whether the component's type has preelaborable
8587 -- initialization. Note that this only occurs when the
8588 -- association's corresponding component does not have a
8589 -- default expression, the latter case having already been
8590 -- expanded as an expression for the association.
8592 if Box_Present (Assn) then
8593 if not Has_Preelaborable_Initialization (Comp_Type) then
8597 -- In the expression case we check whether the expression
8598 -- is preelaborable.
8601 not Is_Preelaborable_Expression (Expression (Assn))
8609 -- If we get here then aggregate as a whole is preelaborable
8613 -- All other cases are not preelaborable
8618 end Is_Preelaborable_Expression;
8620 -- Start of processing for Check_Components
8623 -- Loop through entities of record or protected type
8626 while Present (Ent) loop
8628 -- We are interested only in components and discriminants
8635 -- Get default expression if any. If there is no declaration
8636 -- node, it means we have an internal entity. The parent and
8637 -- tag fields are examples of such entities. For such cases,
8638 -- we just test the type of the entity.
8640 if Present (Declaration_Node (Ent)) then
8641 Exp := Expression (Declaration_Node (Ent));
8644 when E_Discriminant =>
8646 -- Note: for a renamed discriminant, the Declaration_Node
8647 -- may point to the one from the ancestor, and have a
8648 -- different expression, so use the proper attribute to
8649 -- retrieve the expression from the derived constraint.
8651 Exp := Discriminant_Default_Value (Ent);
8654 goto Check_Next_Entity;
8657 -- A component has PI if it has no default expression and the
8658 -- component type has PI.
8661 if not Has_Preelaborable_Initialization (Etype (Ent)) then
8666 -- Require the default expression to be preelaborable
8668 elsif not Is_Preelaborable_Expression (Exp) then
8673 <<Check_Next_Entity>>
8676 end Check_Components;
8678 -- Start of processing for Has_Preelaborable_Initialization
8681 -- Immediate return if already marked as known preelaborable init. This
8682 -- covers types for which this function has already been called once
8683 -- and returned True (in which case the result is cached), and also
8684 -- types to which a pragma Preelaborable_Initialization applies.
8686 if Known_To_Have_Preelab_Init (E) then
8690 -- If the type is a subtype representing a generic actual type, then
8691 -- test whether its base type has preelaborable initialization since
8692 -- the subtype representing the actual does not inherit this attribute
8693 -- from the actual or formal. (but maybe it should???)
8695 if Is_Generic_Actual_Type (E) then
8696 return Has_Preelaborable_Initialization (Base_Type (E));
8699 -- All elementary types have preelaborable initialization
8701 if Is_Elementary_Type (E) then
8704 -- Array types have PI if the component type has PI
8706 elsif Is_Array_Type (E) then
8707 Has_PE := Has_Preelaborable_Initialization (Component_Type (E));
8709 -- A derived type has preelaborable initialization if its parent type
8710 -- has preelaborable initialization and (in the case of a derived record
8711 -- extension) if the non-inherited components all have preelaborable
8712 -- initialization. However, a user-defined controlled type with an
8713 -- overriding Initialize procedure does not have preelaborable
8716 elsif Is_Derived_Type (E) then
8718 -- If the derived type is a private extension then it doesn't have
8719 -- preelaborable initialization.
8721 if Ekind (Base_Type (E)) = E_Record_Type_With_Private then
8725 -- First check whether ancestor type has preelaborable initialization
8727 Has_PE := Has_Preelaborable_Initialization (Etype (Base_Type (E)));
8729 -- If OK, check extension components (if any)
8731 if Has_PE and then Is_Record_Type (E) then
8732 Check_Components (First_Entity (E));
8735 -- Check specifically for 10.2.1(11.4/2) exception: a controlled type
8736 -- with a user defined Initialize procedure does not have PI. If
8737 -- the type is untagged, the control primitives come from a component
8738 -- that has already been checked.
8741 and then Is_Controlled (E)
8742 and then Is_Tagged_Type (E)
8743 and then Has_Overriding_Initialize (E)
8748 -- Private types not derived from a type having preelaborable init and
8749 -- that are not marked with pragma Preelaborable_Initialization do not
8750 -- have preelaborable initialization.
8752 elsif Is_Private_Type (E) then
8755 -- Record type has PI if it is non private and all components have PI
8757 elsif Is_Record_Type (E) then
8759 Check_Components (First_Entity (E));
8761 -- Protected types must not have entries, and components must meet
8762 -- same set of rules as for record components.
8764 elsif Is_Protected_Type (E) then
8765 if Has_Entries (E) then
8769 Check_Components (First_Entity (E));
8770 Check_Components (First_Private_Entity (E));
8773 -- Type System.Address always has preelaborable initialization
8775 elsif Is_RTE (E, RE_Address) then
8778 -- In all other cases, type does not have preelaborable initialization
8784 -- If type has preelaborable initialization, cache result
8787 Set_Known_To_Have_Preelab_Init (E);
8791 end Has_Preelaborable_Initialization;
8793 ---------------------------
8794 -- Has_Private_Component --
8795 ---------------------------
8797 function Has_Private_Component (Type_Id : Entity_Id) return Boolean is
8798 Btype : Entity_Id := Base_Type (Type_Id);
8799 Component : Entity_Id;
8802 if Error_Posted (Type_Id)
8803 or else Error_Posted (Btype)
8808 if Is_Class_Wide_Type (Btype) then
8809 Btype := Root_Type (Btype);
8812 if Is_Private_Type (Btype) then
8814 UT : constant Entity_Id := Underlying_Type (Btype);
8817 if No (Full_View (Btype)) then
8818 return not Is_Generic_Type (Btype)
8820 not Is_Generic_Type (Root_Type (Btype));
8822 return not Is_Generic_Type (Root_Type (Full_View (Btype)));
8825 return not Is_Frozen (UT) and then Has_Private_Component (UT);
8829 elsif Is_Array_Type (Btype) then
8830 return Has_Private_Component (Component_Type (Btype));
8832 elsif Is_Record_Type (Btype) then
8833 Component := First_Component (Btype);
8834 while Present (Component) loop
8835 if Has_Private_Component (Etype (Component)) then
8839 Next_Component (Component);
8844 elsif Is_Protected_Type (Btype)
8845 and then Present (Corresponding_Record_Type (Btype))
8847 return Has_Private_Component (Corresponding_Record_Type (Btype));
8852 end Has_Private_Component;
8854 ----------------------
8855 -- Has_Signed_Zeros --
8856 ----------------------
8858 function Has_Signed_Zeros (E : Entity_Id) return Boolean is
8860 return Is_Floating_Point_Type (E) and then Signed_Zeros_On_Target;
8861 end Has_Signed_Zeros;
8863 -----------------------------
8864 -- Has_Static_Array_Bounds --
8865 -----------------------------
8867 function Has_Static_Array_Bounds (Typ : Node_Id) return Boolean is
8868 Ndims : constant Nat := Number_Dimensions (Typ);
8875 -- Unconstrained types do not have static bounds
8877 if not Is_Constrained (Typ) then
8881 -- First treat string literals specially, as the lower bound and length
8882 -- of string literals are not stored like those of arrays.
8884 -- A string literal always has static bounds
8886 if Ekind (Typ) = E_String_Literal_Subtype then
8890 -- Treat all dimensions in turn
8892 Index := First_Index (Typ);
8893 for Indx in 1 .. Ndims loop
8895 -- In case of an illegal index which is not a discrete type, return
8896 -- that the type is not static.
8898 if not Is_Discrete_Type (Etype (Index))
8899 or else Etype (Index) = Any_Type
8904 Get_Index_Bounds (Index, Low, High);
8906 if Error_Posted (Low) or else Error_Posted (High) then
8910 if Is_OK_Static_Expression (Low)
8912 Is_OK_Static_Expression (High)
8922 -- If we fall through the loop, all indexes matched
8925 end Has_Static_Array_Bounds;
8931 function Has_Stream (T : Entity_Id) return Boolean is
8938 elsif Is_RTE (Root_Type (T), RE_Root_Stream_Type) then
8941 elsif Is_Array_Type (T) then
8942 return Has_Stream (Component_Type (T));
8944 elsif Is_Record_Type (T) then
8945 E := First_Component (T);
8946 while Present (E) loop
8947 if Has_Stream (Etype (E)) then
8956 elsif Is_Private_Type (T) then
8957 return Has_Stream (Underlying_Type (T));
8968 function Has_Suffix (E : Entity_Id; Suffix : Character) return Boolean is
8970 Get_Name_String (Chars (E));
8971 return Name_Buffer (Name_Len) = Suffix;
8978 function Add_Suffix (E : Entity_Id; Suffix : Character) return Name_Id is
8980 Get_Name_String (Chars (E));
8981 Add_Char_To_Name_Buffer (Suffix);
8989 function Remove_Suffix (E : Entity_Id; Suffix : Character) return Name_Id is
8991 pragma Assert (Has_Suffix (E, Suffix));
8992 Get_Name_String (Chars (E));
8993 Name_Len := Name_Len - 1;
8997 --------------------------
8998 -- Has_Tagged_Component --
8999 --------------------------
9001 function Has_Tagged_Component (Typ : Entity_Id) return Boolean is
9005 if Is_Private_Type (Typ) and then Present (Underlying_Type (Typ)) then
9006 return Has_Tagged_Component (Underlying_Type (Typ));
9008 elsif Is_Array_Type (Typ) then
9009 return Has_Tagged_Component (Component_Type (Typ));
9011 elsif Is_Tagged_Type (Typ) then
9014 elsif Is_Record_Type (Typ) then
9015 Comp := First_Component (Typ);
9016 while Present (Comp) loop
9017 if Has_Tagged_Component (Etype (Comp)) then
9021 Next_Component (Comp);
9029 end Has_Tagged_Component;
9031 ----------------------------
9032 -- Has_Volatile_Component --
9033 ----------------------------
9035 function Has_Volatile_Component (Typ : Entity_Id) return Boolean is
9039 if Has_Volatile_Components (Typ) then
9042 elsif Is_Array_Type (Typ) then
9043 return Is_Volatile (Component_Type (Typ));
9045 elsif Is_Record_Type (Typ) then
9046 Comp := First_Component (Typ);
9047 while Present (Comp) loop
9048 if Is_Volatile_Object (Comp) then
9052 Comp := Next_Component (Comp);
9057 end Has_Volatile_Component;
9059 -------------------------
9060 -- Implementation_Kind --
9061 -------------------------
9063 function Implementation_Kind (Subp : Entity_Id) return Name_Id is
9064 Impl_Prag : constant Node_Id := Get_Rep_Pragma (Subp, Name_Implemented);
9067 pragma Assert (Present (Impl_Prag));
9068 Arg := Last (Pragma_Argument_Associations (Impl_Prag));
9069 return Chars (Get_Pragma_Arg (Arg));
9070 end Implementation_Kind;
9072 --------------------------
9073 -- Implements_Interface --
9074 --------------------------
9076 function Implements_Interface
9077 (Typ_Ent : Entity_Id;
9078 Iface_Ent : Entity_Id;
9079 Exclude_Parents : Boolean := False) return Boolean
9081 Ifaces_List : Elist_Id;
9083 Iface : Entity_Id := Base_Type (Iface_Ent);
9084 Typ : Entity_Id := Base_Type (Typ_Ent);
9087 if Is_Class_Wide_Type (Typ) then
9088 Typ := Root_Type (Typ);
9091 if not Has_Interfaces (Typ) then
9095 if Is_Class_Wide_Type (Iface) then
9096 Iface := Root_Type (Iface);
9099 Collect_Interfaces (Typ, Ifaces_List);
9101 Elmt := First_Elmt (Ifaces_List);
9102 while Present (Elmt) loop
9103 if Is_Ancestor (Node (Elmt), Typ, Use_Full_View => True)
9104 and then Exclude_Parents
9108 elsif Node (Elmt) = Iface then
9116 end Implements_Interface;
9118 ------------------------------------
9119 -- In_Assertion_Expression_Pragma --
9120 ------------------------------------
9122 function In_Assertion_Expression_Pragma (N : Node_Id) return Boolean is
9124 Prag : Node_Id := Empty;
9127 -- Climb the parent chain looking for an enclosing pragma
9130 while Present (Par) loop
9131 if Nkind (Par) = N_Pragma then
9135 -- Precondition-like pragmas are expanded into if statements, check
9136 -- the original node instead.
9138 elsif Nkind (Original_Node (Par)) = N_Pragma then
9139 Prag := Original_Node (Par);
9142 -- The expansion of attribute 'Old generates a constant to capture
9143 -- the result of the prefix. If the parent traversal reaches
9144 -- one of these constants, then the node technically came from a
9145 -- postcondition-like pragma. Note that the Ekind is not tested here
9146 -- because N may be the expression of an object declaration which is
9147 -- currently being analyzed. Such objects carry Ekind of E_Void.
9149 elsif Nkind (Par) = N_Object_Declaration
9150 and then Constant_Present (Par)
9151 and then Stores_Attribute_Old_Prefix (Defining_Entity (Par))
9155 -- Prevent the search from going too far
9157 elsif Is_Body_Or_Package_Declaration (Par) then
9161 Par := Parent (Par);
9166 and then Assertion_Expression_Pragma (Get_Pragma_Id (Prag));
9167 end In_Assertion_Expression_Pragma;
9173 function In_Instance return Boolean is
9174 Curr_Unit : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
9179 while Present (S) and then S /= Standard_Standard loop
9180 if Ekind_In (S, E_Function, E_Package, E_Procedure)
9181 and then Is_Generic_Instance (S)
9183 -- A child instance is always compiled in the context of a parent
9184 -- instance. Nevertheless, the actuals are not analyzed in an
9185 -- instance context. We detect this case by examining the current
9186 -- compilation unit, which must be a child instance, and checking
9187 -- that it is not currently on the scope stack.
9189 if Is_Child_Unit (Curr_Unit)
9190 and then Nkind (Unit (Cunit (Current_Sem_Unit))) =
9191 N_Package_Instantiation
9192 and then not In_Open_Scopes (Curr_Unit)
9206 ----------------------
9207 -- In_Instance_Body --
9208 ----------------------
9210 function In_Instance_Body return Boolean is
9215 while Present (S) and then S /= Standard_Standard loop
9216 if Ekind_In (S, E_Function, E_Procedure)
9217 and then Is_Generic_Instance (S)
9221 elsif Ekind (S) = E_Package
9222 and then In_Package_Body (S)
9223 and then Is_Generic_Instance (S)
9232 end In_Instance_Body;
9234 -----------------------------
9235 -- In_Instance_Not_Visible --
9236 -----------------------------
9238 function In_Instance_Not_Visible return Boolean is
9243 while Present (S) and then S /= Standard_Standard loop
9244 if Ekind_In (S, E_Function, E_Procedure)
9245 and then Is_Generic_Instance (S)
9249 elsif Ekind (S) = E_Package
9250 and then (In_Package_Body (S) or else In_Private_Part (S))
9251 and then Is_Generic_Instance (S)
9260 end In_Instance_Not_Visible;
9262 ------------------------------
9263 -- In_Instance_Visible_Part --
9264 ------------------------------
9266 function In_Instance_Visible_Part return Boolean is
9271 while Present (S) and then S /= Standard_Standard loop
9272 if Ekind (S) = E_Package
9273 and then Is_Generic_Instance (S)
9274 and then not In_Package_Body (S)
9275 and then not In_Private_Part (S)
9284 end In_Instance_Visible_Part;
9286 ---------------------
9287 -- In_Package_Body --
9288 ---------------------
9290 function In_Package_Body return Boolean is
9295 while Present (S) and then S /= Standard_Standard loop
9296 if Ekind (S) = E_Package and then In_Package_Body (S) then
9304 end In_Package_Body;
9306 --------------------------------
9307 -- In_Parameter_Specification --
9308 --------------------------------
9310 function In_Parameter_Specification (N : Node_Id) return Boolean is
9315 while Present (PN) loop
9316 if Nkind (PN) = N_Parameter_Specification then
9324 end In_Parameter_Specification;
9326 --------------------------
9327 -- In_Pragma_Expression --
9328 --------------------------
9330 function In_Pragma_Expression (N : Node_Id; Nam : Name_Id) return Boolean is
9337 elsif Nkind (P) = N_Pragma and then Pragma_Name (P) = Nam then
9343 end In_Pragma_Expression;
9345 -------------------------------------
9346 -- In_Reverse_Storage_Order_Object --
9347 -------------------------------------
9349 function In_Reverse_Storage_Order_Object (N : Node_Id) return Boolean is
9351 Btyp : Entity_Id := Empty;
9354 -- Climb up indexed components
9358 case Nkind (Pref) is
9359 when N_Selected_Component =>
9360 Pref := Prefix (Pref);
9363 when N_Indexed_Component =>
9364 Pref := Prefix (Pref);
9372 if Present (Pref) then
9373 Btyp := Base_Type (Etype (Pref));
9376 return Present (Btyp)
9377 and then (Is_Record_Type (Btyp) or else Is_Array_Type (Btyp))
9378 and then Reverse_Storage_Order (Btyp);
9379 end In_Reverse_Storage_Order_Object;
9381 --------------------------------------
9382 -- In_Subprogram_Or_Concurrent_Unit --
9383 --------------------------------------
9385 function In_Subprogram_Or_Concurrent_Unit return Boolean is
9390 -- Use scope chain to check successively outer scopes
9396 if K in Subprogram_Kind
9397 or else K in Concurrent_Kind
9398 or else K in Generic_Subprogram_Kind
9402 elsif E = Standard_Standard then
9408 end In_Subprogram_Or_Concurrent_Unit;
9410 ---------------------
9411 -- In_Visible_Part --
9412 ---------------------
9414 function In_Visible_Part (Scope_Id : Entity_Id) return Boolean is
9416 return Is_Package_Or_Generic_Package (Scope_Id)
9417 and then In_Open_Scopes (Scope_Id)
9418 and then not In_Package_Body (Scope_Id)
9419 and then not In_Private_Part (Scope_Id);
9420 end In_Visible_Part;
9422 --------------------------------
9423 -- Incomplete_Or_Partial_View --
9424 --------------------------------
9426 function Incomplete_Or_Partial_View (Id : Entity_Id) return Entity_Id is
9427 function Inspect_Decls
9429 Taft : Boolean := False) return Entity_Id;
9430 -- Check whether a declarative region contains the incomplete or partial
9437 function Inspect_Decls
9439 Taft : Boolean := False) return Entity_Id
9445 Decl := First (Decls);
9446 while Present (Decl) loop
9450 if Nkind (Decl) = N_Incomplete_Type_Declaration then
9451 Match := Defining_Identifier (Decl);
9455 if Nkind_In (Decl, N_Private_Extension_Declaration,
9456 N_Private_Type_Declaration)
9458 Match := Defining_Identifier (Decl);
9463 and then Present (Full_View (Match))
9464 and then Full_View (Match) = Id
9479 -- Start of processing for Incomplete_Or_Partial_View
9482 -- Deferred constant or incomplete type case
9484 Prev := Current_Entity_In_Scope (Id);
9487 and then (Is_Incomplete_Type (Prev) or else Ekind (Prev) = E_Constant)
9488 and then Present (Full_View (Prev))
9489 and then Full_View (Prev) = Id
9494 -- Private or Taft amendment type case
9497 Pkg : constant Entity_Id := Scope (Id);
9498 Pkg_Decl : Node_Id := Pkg;
9501 if Ekind (Pkg) = E_Package then
9502 while Nkind (Pkg_Decl) /= N_Package_Specification loop
9503 Pkg_Decl := Parent (Pkg_Decl);
9506 -- It is knows that Typ has a private view, look for it in the
9507 -- visible declarations of the enclosing scope. A special case
9508 -- of this is when the two views have been exchanged - the full
9509 -- appears earlier than the private.
9511 if Has_Private_Declaration (Id) then
9512 Prev := Inspect_Decls (Visible_Declarations (Pkg_Decl));
9514 -- Exchanged view case, look in the private declarations
9517 Prev := Inspect_Decls (Private_Declarations (Pkg_Decl));
9522 -- Otherwise if this is the package body, then Typ is a potential
9523 -- Taft amendment type. The incomplete view should be located in
9524 -- the private declarations of the enclosing scope.
9526 elsif In_Package_Body (Pkg) then
9527 return Inspect_Decls (Private_Declarations (Pkg_Decl), True);
9532 -- The type has no incomplete or private view
9535 end Incomplete_Or_Partial_View;
9537 -----------------------------------------
9538 -- Inherit_Default_Init_Cond_Procedure --
9539 -----------------------------------------
9541 procedure Inherit_Default_Init_Cond_Procedure (Typ : Entity_Id) is
9542 Par_Typ : constant Entity_Id := Etype (Typ);
9545 -- A derived type inherits the default initial condition procedure of
9548 if No (Default_Init_Cond_Procedure (Typ)) then
9549 Set_Default_Init_Cond_Procedure
9550 (Typ, Default_Init_Cond_Procedure (Par_Typ));
9552 end Inherit_Default_Init_Cond_Procedure;
9554 ----------------------------
9555 -- Inherit_Rep_Item_Chain --
9556 ----------------------------
9558 procedure Inherit_Rep_Item_Chain (Typ : Entity_Id; From_Typ : Entity_Id) is
9559 From_Item : constant Node_Id := First_Rep_Item (From_Typ);
9560 Item : Node_Id := Empty;
9561 Last_Item : Node_Id := Empty;
9564 -- Reach the end of the destination type's chain (if any) and capture
9567 Item := First_Rep_Item (Typ);
9568 while Present (Item) loop
9570 -- Do not inherit a chain that has been inherited already
9572 if Item = From_Item then
9577 Item := Next_Rep_Item (Item);
9580 -- When the destination type has a rep item chain, the chain of the
9581 -- source type is appended to it.
9583 if Present (Last_Item) then
9584 Set_Next_Rep_Item (Last_Item, From_Item);
9586 -- Otherwise the destination type directly inherits the rep item chain
9587 -- of the source type (if any).
9590 Set_First_Rep_Item (Typ, From_Item);
9592 end Inherit_Rep_Item_Chain;
9594 ---------------------------------
9595 -- Inherit_Subprogram_Contract --
9596 ---------------------------------
9598 procedure Inherit_Subprogram_Contract
9600 From_Subp : Entity_Id)
9602 procedure Inherit_Pragma (Prag_Id : Pragma_Id);
9603 -- Propagate a pragma denoted by Prag_Id from From_Subp's contract to
9606 --------------------
9607 -- Inherit_Pragma --
9608 --------------------
9610 procedure Inherit_Pragma (Prag_Id : Pragma_Id) is
9611 Prag : constant Node_Id := Get_Pragma (From_Subp, Prag_Id);
9615 -- A pragma cannot be part of more than one First_Pragma/Next_Pragma
9616 -- chains, therefore the node must be replicated. The new pragma is
9617 -- flagged is inherited for distrinction purposes.
9619 if Present (Prag) then
9620 New_Prag := New_Copy_Tree (Prag);
9621 Set_Is_Inherited (New_Prag);
9623 Add_Contract_Item (New_Prag, Subp);
9627 -- Start of processing for Inherit_Subprogram_Contract
9630 -- Inheritance is carried out only when both entities are subprograms
9633 if Is_Subprogram_Or_Generic_Subprogram (Subp)
9634 and then Is_Subprogram_Or_Generic_Subprogram (From_Subp)
9635 and then Present (Contract (Subp))
9636 and then Present (Contract (From_Subp))
9638 Inherit_Pragma (Pragma_Extensions_Visible);
9640 end Inherit_Subprogram_Contract;
9642 ---------------------------------
9643 -- Insert_Explicit_Dereference --
9644 ---------------------------------
9646 procedure Insert_Explicit_Dereference (N : Node_Id) is
9647 New_Prefix : constant Node_Id := Relocate_Node (N);
9648 Ent : Entity_Id := Empty;
9655 Save_Interps (N, New_Prefix);
9658 Make_Explicit_Dereference (Sloc (Parent (N)),
9659 Prefix => New_Prefix));
9661 Set_Etype (N, Designated_Type (Etype (New_Prefix)));
9663 if Is_Overloaded (New_Prefix) then
9665 -- The dereference is also overloaded, and its interpretations are
9666 -- the designated types of the interpretations of the original node.
9668 Set_Etype (N, Any_Type);
9670 Get_First_Interp (New_Prefix, I, It);
9671 while Present (It.Nam) loop
9674 if Is_Access_Type (T) then
9675 Add_One_Interp (N, Designated_Type (T), Designated_Type (T));
9678 Get_Next_Interp (I, It);
9684 -- Prefix is unambiguous: mark the original prefix (which might
9685 -- Come_From_Source) as a reference, since the new (relocated) one
9686 -- won't be taken into account.
9688 if Is_Entity_Name (New_Prefix) then
9689 Ent := Entity (New_Prefix);
9692 -- For a retrieval of a subcomponent of some composite object,
9693 -- retrieve the ultimate entity if there is one.
9695 elsif Nkind_In (New_Prefix, N_Selected_Component,
9696 N_Indexed_Component)
9698 Pref := Prefix (New_Prefix);
9699 while Present (Pref)
9700 and then Nkind_In (Pref, N_Selected_Component,
9701 N_Indexed_Component)
9703 Pref := Prefix (Pref);
9706 if Present (Pref) and then Is_Entity_Name (Pref) then
9707 Ent := Entity (Pref);
9711 -- Place the reference on the entity node
9713 if Present (Ent) then
9714 Generate_Reference (Ent, Pref);
9717 end Insert_Explicit_Dereference;
9719 ------------------------------------------
9720 -- Inspect_Deferred_Constant_Completion --
9721 ------------------------------------------
9723 procedure Inspect_Deferred_Constant_Completion (Decls : List_Id) is
9727 Decl := First (Decls);
9728 while Present (Decl) loop
9730 -- Deferred constant signature
9732 if Nkind (Decl) = N_Object_Declaration
9733 and then Constant_Present (Decl)
9734 and then No (Expression (Decl))
9736 -- No need to check internally generated constants
9738 and then Comes_From_Source (Decl)
9740 -- The constant is not completed. A full object declaration or a
9741 -- pragma Import complete a deferred constant.
9743 and then not Has_Completion (Defining_Identifier (Decl))
9746 ("constant declaration requires initialization expression",
9747 Defining_Identifier (Decl));
9750 Decl := Next (Decl);
9752 end Inspect_Deferred_Constant_Completion;
9754 -----------------------------
9755 -- Is_Actual_Out_Parameter --
9756 -----------------------------
9758 function Is_Actual_Out_Parameter (N : Node_Id) return Boolean is
9762 Find_Actual (N, Formal, Call);
9763 return Present (Formal) and then Ekind (Formal) = E_Out_Parameter;
9764 end Is_Actual_Out_Parameter;
9766 -------------------------
9767 -- Is_Actual_Parameter --
9768 -------------------------
9770 function Is_Actual_Parameter (N : Node_Id) return Boolean is
9771 PK : constant Node_Kind := Nkind (Parent (N));
9775 when N_Parameter_Association =>
9776 return N = Explicit_Actual_Parameter (Parent (N));
9778 when N_Subprogram_Call =>
9779 return Is_List_Member (N)
9781 List_Containing (N) = Parameter_Associations (Parent (N));
9786 end Is_Actual_Parameter;
9788 --------------------------------
9789 -- Is_Actual_Tagged_Parameter --
9790 --------------------------------
9792 function Is_Actual_Tagged_Parameter (N : Node_Id) return Boolean is
9796 Find_Actual (N, Formal, Call);
9797 return Present (Formal) and then Is_Tagged_Type (Etype (Formal));
9798 end Is_Actual_Tagged_Parameter;
9800 ---------------------
9801 -- Is_Aliased_View --
9802 ---------------------
9804 function Is_Aliased_View (Obj : Node_Id) return Boolean is
9808 if Is_Entity_Name (Obj) then
9815 or else (Present (Renamed_Object (E))
9816 and then Is_Aliased_View (Renamed_Object (E)))))
9818 or else ((Is_Formal (E)
9819 or else Ekind_In (E, E_Generic_In_Out_Parameter,
9820 E_Generic_In_Parameter))
9821 and then Is_Tagged_Type (Etype (E)))
9823 or else (Is_Concurrent_Type (E) and then In_Open_Scopes (E))
9825 -- Current instance of type, either directly or as rewritten
9826 -- reference to the current object.
9828 or else (Is_Entity_Name (Original_Node (Obj))
9829 and then Present (Entity (Original_Node (Obj)))
9830 and then Is_Type (Entity (Original_Node (Obj))))
9832 or else (Is_Type (E) and then E = Current_Scope)
9834 or else (Is_Incomplete_Or_Private_Type (E)
9835 and then Full_View (E) = Current_Scope)
9837 -- Ada 2012 AI05-0053: the return object of an extended return
9838 -- statement is aliased if its type is immutably limited.
9840 or else (Is_Return_Object (E)
9841 and then Is_Limited_View (Etype (E)));
9843 elsif Nkind (Obj) = N_Selected_Component then
9844 return Is_Aliased (Entity (Selector_Name (Obj)));
9846 elsif Nkind (Obj) = N_Indexed_Component then
9847 return Has_Aliased_Components (Etype (Prefix (Obj)))
9849 (Is_Access_Type (Etype (Prefix (Obj)))
9850 and then Has_Aliased_Components
9851 (Designated_Type (Etype (Prefix (Obj)))));
9853 elsif Nkind_In (Obj, N_Unchecked_Type_Conversion, N_Type_Conversion) then
9854 return Is_Tagged_Type (Etype (Obj))
9855 and then Is_Aliased_View (Expression (Obj));
9857 elsif Nkind (Obj) = N_Explicit_Dereference then
9858 return Nkind (Original_Node (Obj)) /= N_Function_Call;
9863 end Is_Aliased_View;
9865 -------------------------
9866 -- Is_Ancestor_Package --
9867 -------------------------
9869 function Is_Ancestor_Package
9871 E2 : Entity_Id) return Boolean
9877 while Present (Par) and then Par /= Standard_Standard loop
9886 end Is_Ancestor_Package;
9888 ----------------------
9889 -- Is_Atomic_Object --
9890 ----------------------
9892 function Is_Atomic_Object (N : Node_Id) return Boolean is
9894 function Object_Has_Atomic_Components (N : Node_Id) return Boolean;
9895 -- Determines if given object has atomic components
9897 function Is_Atomic_Prefix (N : Node_Id) return Boolean;
9898 -- If prefix is an implicit dereference, examine designated type
9900 ----------------------
9901 -- Is_Atomic_Prefix --
9902 ----------------------
9904 function Is_Atomic_Prefix (N : Node_Id) return Boolean is
9906 if Is_Access_Type (Etype (N)) then
9908 Has_Atomic_Components (Designated_Type (Etype (N)));
9910 return Object_Has_Atomic_Components (N);
9912 end Is_Atomic_Prefix;
9914 ----------------------------------
9915 -- Object_Has_Atomic_Components --
9916 ----------------------------------
9918 function Object_Has_Atomic_Components (N : Node_Id) return Boolean is
9920 if Has_Atomic_Components (Etype (N))
9921 or else Is_Atomic (Etype (N))
9925 elsif Is_Entity_Name (N)
9926 and then (Has_Atomic_Components (Entity (N))
9927 or else Is_Atomic (Entity (N)))
9931 elsif Nkind (N) = N_Selected_Component
9932 and then Is_Atomic (Entity (Selector_Name (N)))
9936 elsif Nkind (N) = N_Indexed_Component
9937 or else Nkind (N) = N_Selected_Component
9939 return Is_Atomic_Prefix (Prefix (N));
9944 end Object_Has_Atomic_Components;
9946 -- Start of processing for Is_Atomic_Object
9949 -- Predicate is not relevant to subprograms
9951 if Is_Entity_Name (N) and then Is_Overloadable (Entity (N)) then
9954 elsif Is_Atomic (Etype (N))
9955 or else (Is_Entity_Name (N) and then Is_Atomic (Entity (N)))
9959 elsif Nkind (N) = N_Selected_Component
9960 and then Is_Atomic (Entity (Selector_Name (N)))
9964 elsif Nkind (N) = N_Indexed_Component
9965 or else Nkind (N) = N_Selected_Component
9967 return Is_Atomic_Prefix (Prefix (N));
9972 end Is_Atomic_Object;
9974 -------------------------
9975 -- Is_Attribute_Result --
9976 -------------------------
9978 function Is_Attribute_Result (N : Node_Id) return Boolean is
9980 return Nkind (N) = N_Attribute_Reference
9981 and then Attribute_Name (N) = Name_Result;
9982 end Is_Attribute_Result;
9984 ------------------------------------
9985 -- Is_Body_Or_Package_Declaration --
9986 ------------------------------------
9988 function Is_Body_Or_Package_Declaration (N : Node_Id) return Boolean is
9990 return Nkind_In (N, N_Entry_Body,
9992 N_Package_Declaration,
9996 end Is_Body_Or_Package_Declaration;
9998 -----------------------
9999 -- Is_Bounded_String --
10000 -----------------------
10002 function Is_Bounded_String (T : Entity_Id) return Boolean is
10003 Under : constant Entity_Id := Underlying_Type (Root_Type (T));
10006 -- Check whether T is ultimately derived from Ada.Strings.Superbounded.
10007 -- Super_String, or one of the [Wide_]Wide_ versions. This will
10008 -- be True for all the Bounded_String types in instances of the
10009 -- Generic_Bounded_Length generics, and for types derived from those.
10011 return Present (Under)
10012 and then (Is_RTE (Root_Type (Under), RO_SU_Super_String) or else
10013 Is_RTE (Root_Type (Under), RO_WI_Super_String) or else
10014 Is_RTE (Root_Type (Under), RO_WW_Super_String));
10015 end Is_Bounded_String;
10017 -------------------------
10018 -- Is_Child_Or_Sibling --
10019 -------------------------
10021 function Is_Child_Or_Sibling
10022 (Pack_1 : Entity_Id;
10023 Pack_2 : Entity_Id) return Boolean
10025 function Distance_From_Standard (Pack : Entity_Id) return Nat;
10026 -- Given an arbitrary package, return the number of "climbs" necessary
10027 -- to reach scope Standard_Standard.
10029 procedure Equalize_Depths
10030 (Pack : in out Entity_Id;
10031 Depth : in out Nat;
10032 Depth_To_Reach : Nat);
10033 -- Given an arbitrary package, its depth and a target depth to reach,
10034 -- climb the scope chain until the said depth is reached. The pointer
10035 -- to the package and its depth a modified during the climb.
10037 ----------------------------
10038 -- Distance_From_Standard --
10039 ----------------------------
10041 function Distance_From_Standard (Pack : Entity_Id) return Nat is
10048 while Present (Scop) and then Scop /= Standard_Standard loop
10050 Scop := Scope (Scop);
10054 end Distance_From_Standard;
10056 ---------------------
10057 -- Equalize_Depths --
10058 ---------------------
10060 procedure Equalize_Depths
10061 (Pack : in out Entity_Id;
10062 Depth : in out Nat;
10063 Depth_To_Reach : Nat)
10066 -- The package must be at a greater or equal depth
10068 if Depth < Depth_To_Reach then
10069 raise Program_Error;
10072 -- Climb the scope chain until the desired depth is reached
10074 while Present (Pack) and then Depth /= Depth_To_Reach loop
10075 Pack := Scope (Pack);
10076 Depth := Depth - 1;
10078 end Equalize_Depths;
10082 P_1 : Entity_Id := Pack_1;
10083 P_1_Child : Boolean := False;
10084 P_1_Depth : Nat := Distance_From_Standard (P_1);
10085 P_2 : Entity_Id := Pack_2;
10086 P_2_Child : Boolean := False;
10087 P_2_Depth : Nat := Distance_From_Standard (P_2);
10089 -- Start of processing for Is_Child_Or_Sibling
10093 (Ekind (Pack_1) = E_Package and then Ekind (Pack_2) = E_Package);
10095 -- Both packages denote the same entity, therefore they cannot be
10096 -- children or siblings.
10101 -- One of the packages is at a deeper level than the other. Note that
10102 -- both may still come from differen hierarchies.
10110 elsif P_1_Depth > P_2_Depth then
10113 Depth => P_1_Depth,
10114 Depth_To_Reach => P_2_Depth);
10123 elsif P_2_Depth > P_1_Depth then
10126 Depth => P_2_Depth,
10127 Depth_To_Reach => P_1_Depth);
10131 -- At this stage the package pointers have been elevated to the same
10132 -- depth. If the related entities are the same, then one package is a
10133 -- potential child of the other:
10137 -- X became P_1 P_2 or vica versa
10143 return Is_Child_Unit (Pack_1);
10145 else pragma Assert (P_2_Child);
10146 return Is_Child_Unit (Pack_2);
10149 -- The packages may come from the same package chain or from entirely
10150 -- different hierarcies. To determine this, climb the scope stack until
10151 -- a common root is found.
10153 -- (root) (root 1) (root 2)
10158 while Present (P_1) and then Present (P_2) loop
10160 -- The two packages may be siblings
10163 return Is_Child_Unit (Pack_1) and then Is_Child_Unit (Pack_2);
10166 P_1 := Scope (P_1);
10167 P_2 := Scope (P_2);
10172 end Is_Child_Or_Sibling;
10174 -----------------------------
10175 -- Is_Concurrent_Interface --
10176 -----------------------------
10178 function Is_Concurrent_Interface (T : Entity_Id) return Boolean is
10180 return Is_Interface (T)
10182 (Is_Protected_Interface (T)
10183 or else Is_Synchronized_Interface (T)
10184 or else Is_Task_Interface (T));
10185 end Is_Concurrent_Interface;
10187 ---------------------------
10188 -- Is_Container_Element --
10189 ---------------------------
10191 function Is_Container_Element (Exp : Node_Id) return Boolean is
10192 Loc : constant Source_Ptr := Sloc (Exp);
10193 Pref : constant Node_Id := Prefix (Exp);
10196 -- Call to an indexing aspect
10198 Cont_Typ : Entity_Id;
10199 -- The type of the container being accessed
10201 Elem_Typ : Entity_Id;
10202 -- Its element type
10204 Indexing : Entity_Id;
10205 Is_Const : Boolean;
10206 -- Indicates that constant indexing is used, and the element is thus
10209 Ref_Typ : Entity_Id;
10210 -- The reference type returned by the indexing operation
10213 -- If C is a container, in a context that imposes the element type of
10214 -- that container, the indexing notation C (X) is rewritten as:
10216 -- Indexing (C, X).Discr.all
10218 -- where Indexing is one of the indexing aspects of the container.
10219 -- If the context does not require a reference, the construct can be
10224 -- First, verify that the construct has the proper form
10226 if not Expander_Active then
10229 elsif Nkind (Pref) /= N_Selected_Component then
10232 elsif Nkind (Prefix (Pref)) /= N_Function_Call then
10236 Call := Prefix (Pref);
10237 Ref_Typ := Etype (Call);
10240 if not Has_Implicit_Dereference (Ref_Typ)
10241 or else No (First (Parameter_Associations (Call)))
10242 or else not Is_Entity_Name (Name (Call))
10247 -- Retrieve type of container object, and its iterator aspects
10249 Cont_Typ := Etype (First (Parameter_Associations (Call)));
10250 Indexing := Find_Value_Of_Aspect (Cont_Typ, Aspect_Constant_Indexing);
10253 if No (Indexing) then
10255 -- Container should have at least one indexing operation
10259 elsif Entity (Name (Call)) /= Entity (Indexing) then
10261 -- This may be a variable indexing operation
10263 Indexing := Find_Value_Of_Aspect (Cont_Typ, Aspect_Variable_Indexing);
10266 or else Entity (Name (Call)) /= Entity (Indexing)
10275 Elem_Typ := Find_Value_Of_Aspect (Cont_Typ, Aspect_Iterator_Element);
10277 if No (Elem_Typ) or else Entity (Elem_Typ) /= Etype (Exp) then
10281 -- Check that the expression is not the target of an assignment, in
10282 -- which case the rewriting is not possible.
10284 if not Is_Const then
10290 while Present (Par)
10292 if Nkind (Parent (Par)) = N_Assignment_Statement
10293 and then Par = Name (Parent (Par))
10297 -- A renaming produces a reference, and the transformation
10300 elsif Nkind (Parent (Par)) = N_Object_Renaming_Declaration then
10304 (Nkind (Parent (Par)), N_Function_Call,
10305 N_Procedure_Call_Statement,
10306 N_Entry_Call_Statement)
10308 -- Check that the element is not part of an actual for an
10309 -- in-out parameter.
10316 F := First_Formal (Entity (Name (Parent (Par))));
10317 A := First (Parameter_Associations (Parent (Par)));
10318 while Present (F) loop
10319 if A = Par and then Ekind (F) /= E_In_Parameter then
10328 -- E_In_Parameter in a call: element is not modified.
10333 Par := Parent (Par);
10338 -- The expression has the proper form and the context requires the
10339 -- element type. Retrieve the Element function of the container and
10340 -- rewrite the construct as a call to it.
10346 Op := First_Elmt (Primitive_Operations (Cont_Typ));
10347 while Present (Op) loop
10348 exit when Chars (Node (Op)) = Name_Element;
10357 Make_Function_Call (Loc,
10358 Name => New_Occurrence_Of (Node (Op), Loc),
10359 Parameter_Associations => Parameter_Associations (Call)));
10360 Analyze_And_Resolve (Exp, Entity (Elem_Typ));
10364 end Is_Container_Element;
10366 -----------------------
10367 -- Is_Constant_Bound --
10368 -----------------------
10370 function Is_Constant_Bound (Exp : Node_Id) return Boolean is
10372 if Compile_Time_Known_Value (Exp) then
10375 elsif Is_Entity_Name (Exp) and then Present (Entity (Exp)) then
10376 return Is_Constant_Object (Entity (Exp))
10377 or else Ekind (Entity (Exp)) = E_Enumeration_Literal;
10379 elsif Nkind (Exp) in N_Binary_Op then
10380 return Is_Constant_Bound (Left_Opnd (Exp))
10381 and then Is_Constant_Bound (Right_Opnd (Exp))
10382 and then Scope (Entity (Exp)) = Standard_Standard;
10387 end Is_Constant_Bound;
10389 --------------------------------------
10390 -- Is_Controlling_Limited_Procedure --
10391 --------------------------------------
10393 function Is_Controlling_Limited_Procedure
10394 (Proc_Nam : Entity_Id) return Boolean
10396 Param_Typ : Entity_Id := Empty;
10399 if Ekind (Proc_Nam) = E_Procedure
10400 and then Present (Parameter_Specifications (Parent (Proc_Nam)))
10402 Param_Typ := Etype (Parameter_Type (First (
10403 Parameter_Specifications (Parent (Proc_Nam)))));
10405 -- In this case where an Itype was created, the procedure call has been
10408 elsif Present (Associated_Node_For_Itype (Proc_Nam))
10409 and then Present (Original_Node (Associated_Node_For_Itype (Proc_Nam)))
10411 Present (Parameter_Associations
10412 (Associated_Node_For_Itype (Proc_Nam)))
10415 Etype (First (Parameter_Associations
10416 (Associated_Node_For_Itype (Proc_Nam))));
10419 if Present (Param_Typ) then
10421 Is_Interface (Param_Typ)
10422 and then Is_Limited_Record (Param_Typ);
10426 end Is_Controlling_Limited_Procedure;
10428 -----------------------------
10429 -- Is_CPP_Constructor_Call --
10430 -----------------------------
10432 function Is_CPP_Constructor_Call (N : Node_Id) return Boolean is
10434 return Nkind (N) = N_Function_Call
10435 and then Is_CPP_Class (Etype (Etype (N)))
10436 and then Is_Constructor (Entity (Name (N)))
10437 and then Is_Imported (Entity (Name (N)));
10438 end Is_CPP_Constructor_Call;
10444 function Is_Delegate (T : Entity_Id) return Boolean is
10445 Desig_Type : Entity_Id;
10448 if VM_Target /= CLI_Target then
10452 -- Access-to-subprograms are delegates in CIL
10454 if Ekind (T) = E_Access_Subprogram_Type then
10458 if not Is_Access_Type (T) then
10460 -- A delegate is a managed pointer. If no designated type is defined
10461 -- it means that it's not a delegate.
10466 Desig_Type := Etype (Directly_Designated_Type (T));
10468 if not Is_Tagged_Type (Desig_Type) then
10472 -- Test if the type is inherited from [mscorlib]System.Delegate
10474 while Etype (Desig_Type) /= Desig_Type loop
10475 if Chars (Scope (Desig_Type)) /= No_Name
10476 and then Is_Imported (Scope (Desig_Type))
10477 and then Get_Name_String (Chars (Scope (Desig_Type))) = "delegate"
10482 Desig_Type := Etype (Desig_Type);
10488 ----------------------------------------------
10489 -- Is_Dependent_Component_Of_Mutable_Object --
10490 ----------------------------------------------
10492 function Is_Dependent_Component_Of_Mutable_Object
10493 (Object : Node_Id) return Boolean
10495 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean;
10496 -- Returns True if and only if Comp is declared within a variant part
10498 --------------------------------
10499 -- Is_Declared_Within_Variant --
10500 --------------------------------
10502 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean is
10503 Comp_Decl : constant Node_Id := Parent (Comp);
10504 Comp_List : constant Node_Id := Parent (Comp_Decl);
10506 return Nkind (Parent (Comp_List)) = N_Variant;
10507 end Is_Declared_Within_Variant;
10510 Prefix_Type : Entity_Id;
10511 P_Aliased : Boolean := False;
10514 Deref : Node_Id := Object;
10515 -- Dereference node, in something like X.all.Y(2)
10517 -- Start of processing for Is_Dependent_Component_Of_Mutable_Object
10520 -- Find the dereference node if any
10522 while Nkind_In (Deref, N_Indexed_Component,
10523 N_Selected_Component,
10526 Deref := Prefix (Deref);
10529 -- Ada 2005: If we have a component or slice of a dereference,
10530 -- something like X.all.Y (2), and the type of X is access-to-constant,
10531 -- Is_Variable will return False, because it is indeed a constant
10532 -- view. But it might be a view of a variable object, so we want the
10533 -- following condition to be True in that case.
10535 if Is_Variable (Object)
10536 or else (Ada_Version >= Ada_2005
10537 and then Nkind (Deref) = N_Explicit_Dereference)
10539 if Nkind (Object) = N_Selected_Component then
10540 P := Prefix (Object);
10541 Prefix_Type := Etype (P);
10543 if Is_Entity_Name (P) then
10544 if Ekind (Entity (P)) = E_Generic_In_Out_Parameter then
10545 Prefix_Type := Base_Type (Prefix_Type);
10548 if Is_Aliased (Entity (P)) then
10552 -- A discriminant check on a selected component may be expanded
10553 -- into a dereference when removing side-effects. Recover the
10554 -- original node and its type, which may be unconstrained.
10556 elsif Nkind (P) = N_Explicit_Dereference
10557 and then not (Comes_From_Source (P))
10559 P := Original_Node (P);
10560 Prefix_Type := Etype (P);
10563 -- Check for prefix being an aliased component???
10569 -- A heap object is constrained by its initial value
10571 -- Ada 2005 (AI-363): Always assume the object could be mutable in
10572 -- the dereferenced case, since the access value might denote an
10573 -- unconstrained aliased object, whereas in Ada 95 the designated
10574 -- object is guaranteed to be constrained. A worst-case assumption
10575 -- has to apply in Ada 2005 because we can't tell at compile
10576 -- time whether the object is "constrained by its initial value"
10577 -- (despite the fact that 3.10.2(26/2) and 8.5.1(5/2) are semantic
10578 -- rules (these rules are acknowledged to need fixing).
10580 if Ada_Version < Ada_2005 then
10581 if Is_Access_Type (Prefix_Type)
10582 or else Nkind (P) = N_Explicit_Dereference
10587 else pragma Assert (Ada_Version >= Ada_2005);
10588 if Is_Access_Type (Prefix_Type) then
10590 -- If the access type is pool-specific, and there is no
10591 -- constrained partial view of the designated type, then the
10592 -- designated object is known to be constrained.
10594 if Ekind (Prefix_Type) = E_Access_Type
10595 and then not Object_Type_Has_Constrained_Partial_View
10596 (Typ => Designated_Type (Prefix_Type),
10597 Scop => Current_Scope)
10601 -- Otherwise (general access type, or there is a constrained
10602 -- partial view of the designated type), we need to check
10603 -- based on the designated type.
10606 Prefix_Type := Designated_Type (Prefix_Type);
10612 Original_Record_Component (Entity (Selector_Name (Object)));
10614 -- As per AI-0017, the renaming is illegal in a generic body, even
10615 -- if the subtype is indefinite.
10617 -- Ada 2005 (AI-363): In Ada 2005 an aliased object can be mutable
10619 if not Is_Constrained (Prefix_Type)
10620 and then (not Is_Indefinite_Subtype (Prefix_Type)
10622 (Is_Generic_Type (Prefix_Type)
10623 and then Ekind (Current_Scope) = E_Generic_Package
10624 and then In_Package_Body (Current_Scope)))
10626 and then (Is_Declared_Within_Variant (Comp)
10627 or else Has_Discriminant_Dependent_Constraint (Comp))
10628 and then (not P_Aliased or else Ada_Version >= Ada_2005)
10632 -- If the prefix is of an access type at this point, then we want
10633 -- to return False, rather than calling this function recursively
10634 -- on the access object (which itself might be a discriminant-
10635 -- dependent component of some other object, but that isn't
10636 -- relevant to checking the object passed to us). This avoids
10637 -- issuing wrong errors when compiling with -gnatc, where there
10638 -- can be implicit dereferences that have not been expanded.
10640 elsif Is_Access_Type (Etype (Prefix (Object))) then
10645 Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
10648 elsif Nkind (Object) = N_Indexed_Component
10649 or else Nkind (Object) = N_Slice
10651 return Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
10653 -- A type conversion that Is_Variable is a view conversion:
10654 -- go back to the denoted object.
10656 elsif Nkind (Object) = N_Type_Conversion then
10658 Is_Dependent_Component_Of_Mutable_Object (Expression (Object));
10663 end Is_Dependent_Component_Of_Mutable_Object;
10665 ---------------------
10666 -- Is_Dereferenced --
10667 ---------------------
10669 function Is_Dereferenced (N : Node_Id) return Boolean is
10670 P : constant Node_Id := Parent (N);
10672 return Nkind_In (P, N_Selected_Component,
10673 N_Explicit_Dereference,
10674 N_Indexed_Component,
10676 and then Prefix (P) = N;
10677 end Is_Dereferenced;
10679 ----------------------
10680 -- Is_Descendent_Of --
10681 ----------------------
10683 function Is_Descendent_Of (T1 : Entity_Id; T2 : Entity_Id) return Boolean is
10688 pragma Assert (Nkind (T1) in N_Entity);
10689 pragma Assert (Nkind (T2) in N_Entity);
10691 T := Base_Type (T1);
10693 -- Immediate return if the types match
10698 -- Comment needed here ???
10700 elsif Ekind (T) = E_Class_Wide_Type then
10701 return Etype (T) = T2;
10709 -- Done if we found the type we are looking for
10714 -- Done if no more derivations to check
10721 -- Following test catches error cases resulting from prev errors
10723 elsif No (Etyp) then
10726 elsif Is_Private_Type (T) and then Etyp = Full_View (T) then
10729 elsif Is_Private_Type (Etyp) and then Full_View (Etyp) = T then
10733 T := Base_Type (Etyp);
10736 end Is_Descendent_Of;
10738 -----------------------------
10739 -- Is_Effectively_Volatile --
10740 -----------------------------
10742 function Is_Effectively_Volatile (Id : Entity_Id) return Boolean is
10744 if Is_Type (Id) then
10746 -- An arbitrary type is effectively volatile when it is subject to
10747 -- pragma Atomic or Volatile.
10749 if Is_Volatile (Id) then
10752 -- An array type is effectively volatile when it is subject to pragma
10753 -- Atomic_Components or Volatile_Components or its compolent type is
10754 -- effectively volatile.
10756 elsif Is_Array_Type (Id) then
10758 Has_Volatile_Components (Id)
10760 Is_Effectively_Volatile (Component_Type (Base_Type (Id)));
10766 -- Otherwise Id denotes an object
10771 or else Has_Volatile_Components (Id)
10772 or else Is_Effectively_Volatile (Etype (Id));
10774 end Is_Effectively_Volatile;
10776 ------------------------------------
10777 -- Is_Effectively_Volatile_Object --
10778 ------------------------------------
10780 function Is_Effectively_Volatile_Object (N : Node_Id) return Boolean is
10782 if Is_Entity_Name (N) then
10783 return Is_Effectively_Volatile (Entity (N));
10785 elsif Nkind (N) = N_Expanded_Name then
10786 return Is_Effectively_Volatile (Entity (N));
10788 elsif Nkind (N) = N_Indexed_Component then
10789 return Is_Effectively_Volatile_Object (Prefix (N));
10791 elsif Nkind (N) = N_Selected_Component then
10793 Is_Effectively_Volatile_Object (Prefix (N))
10795 Is_Effectively_Volatile_Object (Selector_Name (N));
10800 end Is_Effectively_Volatile_Object;
10802 ----------------------------
10803 -- Is_Expression_Function --
10804 ----------------------------
10806 function Is_Expression_Function (Subp : Entity_Id) return Boolean is
10810 if Ekind (Subp) /= E_Function then
10814 Decl := Unit_Declaration_Node (Subp);
10815 return Nkind (Decl) = N_Subprogram_Declaration
10817 (Nkind (Original_Node (Decl)) = N_Expression_Function
10819 (Present (Corresponding_Body (Decl))
10821 Nkind (Original_Node
10822 (Unit_Declaration_Node
10823 (Corresponding_Body (Decl)))) =
10824 N_Expression_Function));
10826 end Is_Expression_Function;
10828 -----------------------
10829 -- Is_EVF_Expression --
10830 -----------------------
10832 function Is_EVF_Expression (N : Node_Id) return Boolean is
10833 Orig_N : constant Node_Id := Original_Node (N);
10839 -- Detect a reference to a formal parameter of a specific tagged type
10840 -- whose related subprogram is subject to pragma Expresions_Visible with
10843 if Is_Entity_Name (N) and then Present (Entity (N)) then
10848 and then Is_Specific_Tagged_Type (Etype (Id))
10849 and then Extensions_Visible_Status (Id) =
10850 Extensions_Visible_False;
10852 -- A case expression is an EVF expression when it contains at least one
10853 -- EVF dependent_expression. Note that a case expression may have been
10854 -- expanded, hence the use of Original_Node.
10856 elsif Nkind (Orig_N) = N_Case_Expression then
10857 Alt := First (Alternatives (Orig_N));
10858 while Present (Alt) loop
10859 if Is_EVF_Expression (Expression (Alt)) then
10866 -- An if expression is an EVF expression when it contains at least one
10867 -- EVF dependent_expression. Note that an if expression may have been
10868 -- expanded, hence the use of Original_Node.
10870 elsif Nkind (Orig_N) = N_If_Expression then
10871 Expr := Next (First (Expressions (Orig_N)));
10872 while Present (Expr) loop
10873 if Is_EVF_Expression (Expr) then
10880 -- A qualified expression or a type conversion is an EVF expression when
10881 -- its operand is an EVF expression.
10883 elsif Nkind_In (N, N_Qualified_Expression,
10884 N_Unchecked_Type_Conversion,
10887 return Is_EVF_Expression (Expression (N));
10889 -- Attributes 'Loop_Entry, 'Old and 'Update are an EVF expression when
10890 -- their prefix denotes an EVF expression.
10892 elsif Nkind (N) = N_Attribute_Reference
10893 and then Nam_In (Attribute_Name (N), Name_Loop_Entry,
10897 return Is_EVF_Expression (Prefix (N));
10901 end Is_EVF_Expression;
10907 function Is_False (U : Uint) return Boolean is
10912 ---------------------------
10913 -- Is_Fixed_Model_Number --
10914 ---------------------------
10916 function Is_Fixed_Model_Number (U : Ureal; T : Entity_Id) return Boolean is
10917 S : constant Ureal := Small_Value (T);
10918 M : Urealp.Save_Mark;
10922 R := (U = UR_Trunc (U / S) * S);
10923 Urealp.Release (M);
10925 end Is_Fixed_Model_Number;
10927 -------------------------------
10928 -- Is_Fully_Initialized_Type --
10929 -------------------------------
10931 function Is_Fully_Initialized_Type (Typ : Entity_Id) return Boolean is
10935 if Is_Scalar_Type (Typ) then
10937 -- A scalar type with an aspect Default_Value is fully initialized
10939 -- Note: Iniitalize/Normalize_Scalars also ensure full initialization
10940 -- of a scalar type, but we don't take that into account here, since
10941 -- we don't want these to affect warnings.
10943 return Has_Default_Aspect (Typ);
10945 elsif Is_Access_Type (Typ) then
10948 elsif Is_Array_Type (Typ) then
10949 if Is_Fully_Initialized_Type (Component_Type (Typ))
10950 or else (Ada_Version >= Ada_2012 and then Has_Default_Aspect (Typ))
10955 -- An interesting case, if we have a constrained type one of whose
10956 -- bounds is known to be null, then there are no elements to be
10957 -- initialized, so all the elements are initialized.
10959 if Is_Constrained (Typ) then
10962 Indx_Typ : Entity_Id;
10963 Lbd, Hbd : Node_Id;
10966 Indx := First_Index (Typ);
10967 while Present (Indx) loop
10968 if Etype (Indx) = Any_Type then
10971 -- If index is a range, use directly
10973 elsif Nkind (Indx) = N_Range then
10974 Lbd := Low_Bound (Indx);
10975 Hbd := High_Bound (Indx);
10978 Indx_Typ := Etype (Indx);
10980 if Is_Private_Type (Indx_Typ) then
10981 Indx_Typ := Full_View (Indx_Typ);
10984 if No (Indx_Typ) or else Etype (Indx_Typ) = Any_Type then
10987 Lbd := Type_Low_Bound (Indx_Typ);
10988 Hbd := Type_High_Bound (Indx_Typ);
10992 if Compile_Time_Known_Value (Lbd)
10994 Compile_Time_Known_Value (Hbd)
10996 if Expr_Value (Hbd) < Expr_Value (Lbd) then
11006 -- If no null indexes, then type is not fully initialized
11012 elsif Is_Record_Type (Typ) then
11013 if Has_Discriminants (Typ)
11015 Present (Discriminant_Default_Value (First_Discriminant (Typ)))
11016 and then Is_Fully_Initialized_Variant (Typ)
11021 -- We consider bounded string types to be fully initialized, because
11022 -- otherwise we get false alarms when the Data component is not
11023 -- default-initialized.
11025 if Is_Bounded_String (Typ) then
11029 -- Controlled records are considered to be fully initialized if
11030 -- there is a user defined Initialize routine. This may not be
11031 -- entirely correct, but as the spec notes, we are guessing here
11032 -- what is best from the point of view of issuing warnings.
11034 if Is_Controlled (Typ) then
11036 Utyp : constant Entity_Id := Underlying_Type (Typ);
11039 if Present (Utyp) then
11041 Init : constant Entity_Id :=
11043 (Underlying_Type (Typ), Name_Initialize));
11047 and then Comes_From_Source (Init)
11049 Is_Predefined_File_Name
11050 (File_Name (Get_Source_File_Index (Sloc (Init))))
11054 elsif Has_Null_Extension (Typ)
11056 Is_Fully_Initialized_Type
11057 (Etype (Base_Type (Typ)))
11066 -- Otherwise see if all record components are initialized
11072 Ent := First_Entity (Typ);
11073 while Present (Ent) loop
11074 if Ekind (Ent) = E_Component
11075 and then (No (Parent (Ent))
11076 or else No (Expression (Parent (Ent))))
11077 and then not Is_Fully_Initialized_Type (Etype (Ent))
11079 -- Special VM case for tag components, which need to be
11080 -- defined in this case, but are never initialized as VMs
11081 -- are using other dispatching mechanisms. Ignore this
11082 -- uninitialized case. Note that this applies both to the
11083 -- uTag entry and the main vtable pointer (CPP_Class case).
11085 and then (Tagged_Type_Expansion or else not Is_Tag (Ent))
11094 -- No uninitialized components, so type is fully initialized.
11095 -- Note that this catches the case of no components as well.
11099 elsif Is_Concurrent_Type (Typ) then
11102 elsif Is_Private_Type (Typ) then
11104 U : constant Entity_Id := Underlying_Type (Typ);
11110 return Is_Fully_Initialized_Type (U);
11117 end Is_Fully_Initialized_Type;
11119 ----------------------------------
11120 -- Is_Fully_Initialized_Variant --
11121 ----------------------------------
11123 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean is
11124 Loc : constant Source_Ptr := Sloc (Typ);
11125 Constraints : constant List_Id := New_List;
11126 Components : constant Elist_Id := New_Elmt_List;
11127 Comp_Elmt : Elmt_Id;
11129 Comp_List : Node_Id;
11131 Discr_Val : Node_Id;
11133 Report_Errors : Boolean;
11134 pragma Warnings (Off, Report_Errors);
11137 if Serious_Errors_Detected > 0 then
11141 if Is_Record_Type (Typ)
11142 and then Nkind (Parent (Typ)) = N_Full_Type_Declaration
11143 and then Nkind (Type_Definition (Parent (Typ))) = N_Record_Definition
11145 Comp_List := Component_List (Type_Definition (Parent (Typ)));
11147 Discr := First_Discriminant (Typ);
11148 while Present (Discr) loop
11149 if Nkind (Parent (Discr)) = N_Discriminant_Specification then
11150 Discr_Val := Expression (Parent (Discr));
11152 if Present (Discr_Val)
11153 and then Is_OK_Static_Expression (Discr_Val)
11155 Append_To (Constraints,
11156 Make_Component_Association (Loc,
11157 Choices => New_List (New_Occurrence_Of (Discr, Loc)),
11158 Expression => New_Copy (Discr_Val)));
11166 Next_Discriminant (Discr);
11171 Comp_List => Comp_List,
11172 Governed_By => Constraints,
11173 Into => Components,
11174 Report_Errors => Report_Errors);
11176 -- Check that each component present is fully initialized
11178 Comp_Elmt := First_Elmt (Components);
11179 while Present (Comp_Elmt) loop
11180 Comp_Id := Node (Comp_Elmt);
11182 if Ekind (Comp_Id) = E_Component
11183 and then (No (Parent (Comp_Id))
11184 or else No (Expression (Parent (Comp_Id))))
11185 and then not Is_Fully_Initialized_Type (Etype (Comp_Id))
11190 Next_Elmt (Comp_Elmt);
11195 elsif Is_Private_Type (Typ) then
11197 U : constant Entity_Id := Underlying_Type (Typ);
11203 return Is_Fully_Initialized_Variant (U);
11210 end Is_Fully_Initialized_Variant;
11212 ---------------------
11213 -- Is_Ghost_Entity --
11214 ---------------------
11216 function Is_Ghost_Entity (Id : Entity_Id) return Boolean is
11218 return Is_Checked_Ghost_Entity (Id) or else Is_Ignored_Ghost_Entity (Id);
11219 end Is_Ghost_Entity;
11221 ----------------------------------
11222 -- Is_Ghost_Statement_Or_Pragma --
11223 ----------------------------------
11225 function Is_Ghost_Statement_Or_Pragma (N : Node_Id) return Boolean is
11226 function Is_Ghost_Entity_Reference (N : Node_Id) return Boolean;
11227 -- Determine whether an arbitrary node denotes a reference to a Ghost
11230 -------------------------------
11231 -- Is_Ghost_Entity_Reference --
11232 -------------------------------
11234 function Is_Ghost_Entity_Reference (N : Node_Id) return Boolean is
11240 -- When the reference extracts a subcomponent, recover the related
11241 -- object (SPARK RM 6.9(1)).
11243 while Nkind_In (Ref, N_Explicit_Dereference,
11244 N_Indexed_Component,
11245 N_Selected_Component,
11248 Ref := Prefix (Ref);
11252 Is_Entity_Name (Ref)
11253 and then Present (Entity (Ref))
11254 and then Is_Ghost_Entity (Entity (Ref));
11255 end Is_Ghost_Entity_Reference;
11262 -- Start of processing for Is_Ghost_Statement_Or_Pragma
11265 if Nkind (N) = N_Pragma then
11267 -- A pragma is Ghost when it appears within a Ghost package or
11270 if Within_Ghost_Scope then
11274 -- A pragma is Ghost when it mentions a Ghost entity
11276 Arg := First (Pragma_Argument_Associations (N));
11277 while Present (Arg) loop
11278 if Is_Ghost_Entity_Reference (Get_Pragma_Arg (Arg)) then
11287 while Present (Stmt) loop
11289 -- A statement is Ghost when it appears within a Ghost package or
11292 if Is_Statement (Stmt) and then Within_Ghost_Scope then
11295 -- An assignment statement is Ghost when the target is a Ghost
11296 -- variable. A procedure call is Ghost when the invoked procedure
11299 elsif Nkind_In (Stmt, N_Assignment_Statement,
11300 N_Procedure_Call_Statement)
11302 return Is_Ghost_Entity_Reference (Name (Stmt));
11304 -- Prevent the search from going too far
11306 elsif Is_Body_Or_Package_Declaration (Stmt) then
11310 Stmt := Parent (Stmt);
11314 end Is_Ghost_Statement_Or_Pragma;
11316 ----------------------------
11317 -- Is_Inherited_Operation --
11318 ----------------------------
11320 function Is_Inherited_Operation (E : Entity_Id) return Boolean is
11321 pragma Assert (Is_Overloadable (E));
11322 Kind : constant Node_Kind := Nkind (Parent (E));
11324 return Kind = N_Full_Type_Declaration
11325 or else Kind = N_Private_Extension_Declaration
11326 or else Kind = N_Subtype_Declaration
11327 or else (Ekind (E) = E_Enumeration_Literal
11328 and then Is_Derived_Type (Etype (E)));
11329 end Is_Inherited_Operation;
11331 -------------------------------------
11332 -- Is_Inherited_Operation_For_Type --
11333 -------------------------------------
11335 function Is_Inherited_Operation_For_Type
11337 Typ : Entity_Id) return Boolean
11340 -- Check that the operation has been created by the type declaration
11342 return Is_Inherited_Operation (E)
11343 and then Defining_Identifier (Parent (E)) = Typ;
11344 end Is_Inherited_Operation_For_Type;
11350 function Is_Iterator (Typ : Entity_Id) return Boolean is
11351 Ifaces_List : Elist_Id;
11352 Iface_Elmt : Elmt_Id;
11356 if Is_Class_Wide_Type (Typ)
11357 and then Nam_In (Chars (Etype (Typ)), Name_Forward_Iterator,
11358 Name_Reversible_Iterator)
11360 Is_Predefined_File_Name
11361 (Unit_File_Name (Get_Source_Unit (Etype (Typ))))
11365 elsif not Is_Tagged_Type (Typ) or else not Is_Derived_Type (Typ) then
11368 elsif Present (Find_Value_Of_Aspect (Typ, Aspect_Iterable)) then
11372 Collect_Interfaces (Typ, Ifaces_List);
11374 Iface_Elmt := First_Elmt (Ifaces_List);
11375 while Present (Iface_Elmt) loop
11376 Iface := Node (Iface_Elmt);
11377 if Chars (Iface) = Name_Forward_Iterator
11379 Is_Predefined_File_Name
11380 (Unit_File_Name (Get_Source_Unit (Iface)))
11385 Next_Elmt (Iface_Elmt);
11396 -- We seem to have a lot of overlapping functions that do similar things
11397 -- (testing for left hand sides or lvalues???).
11399 function Is_LHS (N : Node_Id) return Is_LHS_Result is
11400 P : constant Node_Id := Parent (N);
11403 -- Return True if we are the left hand side of an assignment statement
11405 if Nkind (P) = N_Assignment_Statement then
11406 if Name (P) = N then
11412 -- Case of prefix of indexed or selected component or slice
11414 elsif Nkind_In (P, N_Indexed_Component, N_Selected_Component, N_Slice)
11415 and then N = Prefix (P)
11417 -- Here we have the case where the parent P is N.Q or N(Q .. R).
11418 -- If P is an LHS, then N is also effectively an LHS, but there
11419 -- is an important exception. If N is of an access type, then
11420 -- what we really have is N.all.Q (or N.all(Q .. R)). In either
11421 -- case this makes N.all a left hand side but not N itself.
11423 -- If we don't know the type yet, this is the case where we return
11424 -- Unknown, since the answer depends on the type which is unknown.
11426 if No (Etype (N)) then
11429 -- We have an Etype set, so we can check it
11431 elsif Is_Access_Type (Etype (N)) then
11434 -- OK, not access type case, so just test whole expression
11440 -- All other cases are not left hand sides
11447 -----------------------------
11448 -- Is_Library_Level_Entity --
11449 -----------------------------
11451 function Is_Library_Level_Entity (E : Entity_Id) return Boolean is
11453 -- The following is a small optimization, and it also properly handles
11454 -- discriminals, which in task bodies might appear in expressions before
11455 -- the corresponding procedure has been created, and which therefore do
11456 -- not have an assigned scope.
11458 if Is_Formal (E) then
11462 -- Normal test is simply that the enclosing dynamic scope is Standard
11464 return Enclosing_Dynamic_Scope (E) = Standard_Standard;
11465 end Is_Library_Level_Entity;
11467 --------------------------------
11468 -- Is_Limited_Class_Wide_Type --
11469 --------------------------------
11471 function Is_Limited_Class_Wide_Type (Typ : Entity_Id) return Boolean is
11474 Is_Class_Wide_Type (Typ)
11475 and then (Is_Limited_Type (Typ) or else From_Limited_With (Typ));
11476 end Is_Limited_Class_Wide_Type;
11478 ---------------------------------
11479 -- Is_Local_Variable_Reference --
11480 ---------------------------------
11482 function Is_Local_Variable_Reference (Expr : Node_Id) return Boolean is
11484 if not Is_Entity_Name (Expr) then
11489 Ent : constant Entity_Id := Entity (Expr);
11490 Sub : constant Entity_Id := Enclosing_Subprogram (Ent);
11492 if not Ekind_In (Ent, E_Variable, E_In_Out_Parameter) then
11495 return Present (Sub) and then Sub = Current_Subprogram;
11499 end Is_Local_Variable_Reference;
11501 -------------------------
11502 -- Is_Object_Reference --
11503 -------------------------
11505 function Is_Object_Reference (N : Node_Id) return Boolean is
11507 function Is_Internally_Generated_Renaming (N : Node_Id) return Boolean;
11508 -- Determine whether N is the name of an internally-generated renaming
11510 --------------------------------------
11511 -- Is_Internally_Generated_Renaming --
11512 --------------------------------------
11514 function Is_Internally_Generated_Renaming (N : Node_Id) return Boolean is
11519 while Present (P) loop
11520 if Nkind (P) = N_Object_Renaming_Declaration then
11521 return not Comes_From_Source (P);
11522 elsif Is_List_Member (P) then
11530 end Is_Internally_Generated_Renaming;
11532 -- Start of processing for Is_Object_Reference
11535 if Is_Entity_Name (N) then
11536 return Present (Entity (N)) and then Is_Object (Entity (N));
11540 when N_Indexed_Component | N_Slice =>
11542 Is_Object_Reference (Prefix (N))
11543 or else Is_Access_Type (Etype (Prefix (N)));
11545 -- In Ada 95, a function call is a constant object; a procedure
11548 when N_Function_Call =>
11549 return Etype (N) /= Standard_Void_Type;
11551 -- Attributes 'Input, 'Old and 'Result produce objects
11553 when N_Attribute_Reference =>
11556 (Attribute_Name (N), Name_Input, Name_Old, Name_Result);
11558 when N_Selected_Component =>
11560 Is_Object_Reference (Selector_Name (N))
11562 (Is_Object_Reference (Prefix (N))
11563 or else Is_Access_Type (Etype (Prefix (N))));
11565 when N_Explicit_Dereference =>
11568 -- A view conversion of a tagged object is an object reference
11570 when N_Type_Conversion =>
11571 return Is_Tagged_Type (Etype (Subtype_Mark (N)))
11572 and then Is_Tagged_Type (Etype (Expression (N)))
11573 and then Is_Object_Reference (Expression (N));
11575 -- An unchecked type conversion is considered to be an object if
11576 -- the operand is an object (this construction arises only as a
11577 -- result of expansion activities).
11579 when N_Unchecked_Type_Conversion =>
11582 -- Allow string literals to act as objects as long as they appear
11583 -- in internally-generated renamings. The expansion of iterators
11584 -- may generate such renamings when the range involves a string
11587 when N_String_Literal =>
11588 return Is_Internally_Generated_Renaming (Parent (N));
11590 -- AI05-0003: In Ada 2012 a qualified expression is a name.
11591 -- This allows disambiguation of function calls and the use
11592 -- of aggregates in more contexts.
11594 when N_Qualified_Expression =>
11595 if Ada_Version < Ada_2012 then
11598 return Is_Object_Reference (Expression (N))
11599 or else Nkind (Expression (N)) = N_Aggregate;
11606 end Is_Object_Reference;
11608 -----------------------------------
11609 -- Is_OK_Variable_For_Out_Formal --
11610 -----------------------------------
11612 function Is_OK_Variable_For_Out_Formal (AV : Node_Id) return Boolean is
11614 Note_Possible_Modification (AV, Sure => True);
11616 -- We must reject parenthesized variable names. Comes_From_Source is
11617 -- checked because there are currently cases where the compiler violates
11618 -- this rule (e.g. passing a task object to its controlled Initialize
11619 -- routine). This should be properly documented in sinfo???
11621 if Paren_Count (AV) > 0 and then Comes_From_Source (AV) then
11624 -- A variable is always allowed
11626 elsif Is_Variable (AV) then
11629 -- Generalized indexing operations are rewritten as explicit
11630 -- dereferences, and it is only during resolution that we can
11631 -- check whether the context requires an access_to_variable type.
11633 elsif Nkind (AV) = N_Explicit_Dereference
11634 and then Ada_Version >= Ada_2012
11635 and then Nkind (Original_Node (AV)) = N_Indexed_Component
11636 and then Present (Etype (Original_Node (AV)))
11637 and then Has_Implicit_Dereference (Etype (Original_Node (AV)))
11639 return not Is_Access_Constant (Etype (Prefix (AV)));
11641 -- Unchecked conversions are allowed only if they come from the
11642 -- generated code, which sometimes uses unchecked conversions for out
11643 -- parameters in cases where code generation is unaffected. We tell
11644 -- source unchecked conversions by seeing if they are rewrites of
11645 -- an original Unchecked_Conversion function call, or of an explicit
11646 -- conversion of a function call or an aggregate (as may happen in the
11647 -- expansion of a packed array aggregate).
11649 elsif Nkind (AV) = N_Unchecked_Type_Conversion then
11650 if Nkind_In (Original_Node (AV), N_Function_Call, N_Aggregate) then
11653 elsif Comes_From_Source (AV)
11654 and then Nkind (Original_Node (Expression (AV))) = N_Function_Call
11658 elsif Nkind (Original_Node (AV)) = N_Type_Conversion then
11659 return Is_OK_Variable_For_Out_Formal (Expression (AV));
11665 -- Normal type conversions are allowed if argument is a variable
11667 elsif Nkind (AV) = N_Type_Conversion then
11668 if Is_Variable (Expression (AV))
11669 and then Paren_Count (Expression (AV)) = 0
11671 Note_Possible_Modification (Expression (AV), Sure => True);
11674 -- We also allow a non-parenthesized expression that raises
11675 -- constraint error if it rewrites what used to be a variable
11677 elsif Raises_Constraint_Error (Expression (AV))
11678 and then Paren_Count (Expression (AV)) = 0
11679 and then Is_Variable (Original_Node (Expression (AV)))
11683 -- Type conversion of something other than a variable
11689 -- If this node is rewritten, then test the original form, if that is
11690 -- OK, then we consider the rewritten node OK (for example, if the
11691 -- original node is a conversion, then Is_Variable will not be true
11692 -- but we still want to allow the conversion if it converts a variable).
11694 elsif Original_Node (AV) /= AV then
11696 -- In Ada 2012, the explicit dereference may be a rewritten call to a
11697 -- Reference function.
11699 if Ada_Version >= Ada_2012
11700 and then Nkind (Original_Node (AV)) = N_Function_Call
11702 Has_Implicit_Dereference (Etype (Name (Original_Node (AV))))
11707 return Is_OK_Variable_For_Out_Formal (Original_Node (AV));
11710 -- All other non-variables are rejected
11715 end Is_OK_Variable_For_Out_Formal;
11717 -----------------------------------
11718 -- Is_Partially_Initialized_Type --
11719 -----------------------------------
11721 function Is_Partially_Initialized_Type
11723 Include_Implicit : Boolean := True) return Boolean
11726 if Is_Scalar_Type (Typ) then
11729 elsif Is_Access_Type (Typ) then
11730 return Include_Implicit;
11732 elsif Is_Array_Type (Typ) then
11734 -- If component type is partially initialized, so is array type
11736 if Is_Partially_Initialized_Type
11737 (Component_Type (Typ), Include_Implicit)
11741 -- Otherwise we are only partially initialized if we are fully
11742 -- initialized (this is the empty array case, no point in us
11743 -- duplicating that code here).
11746 return Is_Fully_Initialized_Type (Typ);
11749 elsif Is_Record_Type (Typ) then
11751 -- A discriminated type is always partially initialized if in
11754 if Has_Discriminants (Typ) and then Include_Implicit then
11757 -- A tagged type is always partially initialized
11759 elsif Is_Tagged_Type (Typ) then
11762 -- Case of non-discriminated record
11768 Component_Present : Boolean := False;
11769 -- Set True if at least one component is present. If no
11770 -- components are present, then record type is fully
11771 -- initialized (another odd case, like the null array).
11774 -- Loop through components
11776 Ent := First_Entity (Typ);
11777 while Present (Ent) loop
11778 if Ekind (Ent) = E_Component then
11779 Component_Present := True;
11781 -- If a component has an initialization expression then
11782 -- the enclosing record type is partially initialized
11784 if Present (Parent (Ent))
11785 and then Present (Expression (Parent (Ent)))
11789 -- If a component is of a type which is itself partially
11790 -- initialized, then the enclosing record type is also.
11792 elsif Is_Partially_Initialized_Type
11793 (Etype (Ent), Include_Implicit)
11802 -- No initialized components found. If we found any components
11803 -- they were all uninitialized so the result is false.
11805 if Component_Present then
11808 -- But if we found no components, then all the components are
11809 -- initialized so we consider the type to be initialized.
11817 -- Concurrent types are always fully initialized
11819 elsif Is_Concurrent_Type (Typ) then
11822 -- For a private type, go to underlying type. If there is no underlying
11823 -- type then just assume this partially initialized. Not clear if this
11824 -- can happen in a non-error case, but no harm in testing for this.
11826 elsif Is_Private_Type (Typ) then
11828 U : constant Entity_Id := Underlying_Type (Typ);
11833 return Is_Partially_Initialized_Type (U, Include_Implicit);
11837 -- For any other type (are there any?) assume partially initialized
11842 end Is_Partially_Initialized_Type;
11844 ------------------------------------
11845 -- Is_Potentially_Persistent_Type --
11846 ------------------------------------
11848 function Is_Potentially_Persistent_Type (T : Entity_Id) return Boolean is
11853 -- For private type, test corresponding full type
11855 if Is_Private_Type (T) then
11856 return Is_Potentially_Persistent_Type (Full_View (T));
11858 -- Scalar types are potentially persistent
11860 elsif Is_Scalar_Type (T) then
11863 -- Record type is potentially persistent if not tagged and the types of
11864 -- all it components are potentially persistent, and no component has
11865 -- an initialization expression.
11867 elsif Is_Record_Type (T)
11868 and then not Is_Tagged_Type (T)
11869 and then not Is_Partially_Initialized_Type (T)
11871 Comp := First_Component (T);
11872 while Present (Comp) loop
11873 if not Is_Potentially_Persistent_Type (Etype (Comp)) then
11876 Next_Entity (Comp);
11882 -- Array type is potentially persistent if its component type is
11883 -- potentially persistent and if all its constraints are static.
11885 elsif Is_Array_Type (T) then
11886 if not Is_Potentially_Persistent_Type (Component_Type (T)) then
11890 Indx := First_Index (T);
11891 while Present (Indx) loop
11892 if not Is_OK_Static_Subtype (Etype (Indx)) then
11901 -- All other types are not potentially persistent
11906 end Is_Potentially_Persistent_Type;
11908 --------------------------------
11909 -- Is_Potentially_Unevaluated --
11910 --------------------------------
11912 function Is_Potentially_Unevaluated (N : Node_Id) return Boolean is
11920 -- A postcondition whose expression is a short-circuit is broken down
11921 -- into individual aspects for better exception reporting. The original
11922 -- short-circuit expression is rewritten as the second operand, and an
11923 -- occurrence of 'Old in that operand is potentially unevaluated.
11924 -- See Sem_ch13.adb for details of this transformation.
11926 if Nkind (Original_Node (Par)) = N_And_Then then
11930 while not Nkind_In (Par, N_If_Expression,
11938 Par := Parent (Par);
11940 -- If the context is not an expression, or if is the result of
11941 -- expansion of an enclosing construct (such as another attribute)
11942 -- the predicate does not apply.
11944 if Nkind (Par) not in N_Subexpr
11945 or else not Comes_From_Source (Par)
11951 if Nkind (Par) = N_If_Expression then
11952 return Is_Elsif (Par) or else Expr /= First (Expressions (Par));
11954 elsif Nkind (Par) = N_Case_Expression then
11955 return Expr /= Expression (Par);
11957 elsif Nkind_In (Par, N_And_Then, N_Or_Else) then
11958 return Expr = Right_Opnd (Par);
11960 elsif Nkind_In (Par, N_In, N_Not_In) then
11961 return Expr /= Left_Opnd (Par);
11966 end Is_Potentially_Unevaluated;
11968 ---------------------------------
11969 -- Is_Protected_Self_Reference --
11970 ---------------------------------
11972 function Is_Protected_Self_Reference (N : Node_Id) return Boolean is
11974 function In_Access_Definition (N : Node_Id) return Boolean;
11975 -- Returns true if N belongs to an access definition
11977 --------------------------
11978 -- In_Access_Definition --
11979 --------------------------
11981 function In_Access_Definition (N : Node_Id) return Boolean is
11986 while Present (P) loop
11987 if Nkind (P) = N_Access_Definition then
11995 end In_Access_Definition;
11997 -- Start of processing for Is_Protected_Self_Reference
12000 -- Verify that prefix is analyzed and has the proper form. Note that
12001 -- the attributes Elab_Spec, Elab_Body, Elab_Subp_Body and UET_Address,
12002 -- which also produce the address of an entity, do not analyze their
12003 -- prefix because they denote entities that are not necessarily visible.
12004 -- Neither of them can apply to a protected type.
12006 return Ada_Version >= Ada_2005
12007 and then Is_Entity_Name (N)
12008 and then Present (Entity (N))
12009 and then Is_Protected_Type (Entity (N))
12010 and then In_Open_Scopes (Entity (N))
12011 and then not In_Access_Definition (N);
12012 end Is_Protected_Self_Reference;
12014 -----------------------------
12015 -- Is_RCI_Pkg_Spec_Or_Body --
12016 -----------------------------
12018 function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
12020 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
12021 -- Return True if the unit of Cunit is an RCI package declaration
12023 ---------------------------
12024 -- Is_RCI_Pkg_Decl_Cunit --
12025 ---------------------------
12027 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean is
12028 The_Unit : constant Node_Id := Unit (Cunit);
12031 if Nkind (The_Unit) /= N_Package_Declaration then
12035 return Is_Remote_Call_Interface (Defining_Entity (The_Unit));
12036 end Is_RCI_Pkg_Decl_Cunit;
12038 -- Start of processing for Is_RCI_Pkg_Spec_Or_Body
12041 return Is_RCI_Pkg_Decl_Cunit (Cunit)
12043 (Nkind (Unit (Cunit)) = N_Package_Body
12044 and then Is_RCI_Pkg_Decl_Cunit (Library_Unit (Cunit)));
12045 end Is_RCI_Pkg_Spec_Or_Body;
12047 -----------------------------------------
12048 -- Is_Remote_Access_To_Class_Wide_Type --
12049 -----------------------------------------
12051 function Is_Remote_Access_To_Class_Wide_Type
12052 (E : Entity_Id) return Boolean
12055 -- A remote access to class-wide type is a general access to object type
12056 -- declared in the visible part of a Remote_Types or Remote_Call_
12059 return Ekind (E) = E_General_Access_Type
12060 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
12061 end Is_Remote_Access_To_Class_Wide_Type;
12063 -----------------------------------------
12064 -- Is_Remote_Access_To_Subprogram_Type --
12065 -----------------------------------------
12067 function Is_Remote_Access_To_Subprogram_Type
12068 (E : Entity_Id) return Boolean
12071 return (Ekind (E) = E_Access_Subprogram_Type
12072 or else (Ekind (E) = E_Record_Type
12073 and then Present (Corresponding_Remote_Type (E))))
12074 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
12075 end Is_Remote_Access_To_Subprogram_Type;
12077 --------------------
12078 -- Is_Remote_Call --
12079 --------------------
12081 function Is_Remote_Call (N : Node_Id) return Boolean is
12083 if Nkind (N) not in N_Subprogram_Call then
12085 -- An entry call cannot be remote
12089 elsif Nkind (Name (N)) in N_Has_Entity
12090 and then Is_Remote_Call_Interface (Entity (Name (N)))
12092 -- A subprogram declared in the spec of a RCI package is remote
12096 elsif Nkind (Name (N)) = N_Explicit_Dereference
12097 and then Is_Remote_Access_To_Subprogram_Type
12098 (Etype (Prefix (Name (N))))
12100 -- The dereference of a RAS is a remote call
12104 elsif Present (Controlling_Argument (N))
12105 and then Is_Remote_Access_To_Class_Wide_Type
12106 (Etype (Controlling_Argument (N)))
12108 -- Any primitive operation call with a controlling argument of
12109 -- a RACW type is a remote call.
12114 -- All other calls are local calls
12117 end Is_Remote_Call;
12119 ----------------------
12120 -- Is_Renamed_Entry --
12121 ----------------------
12123 function Is_Renamed_Entry (Proc_Nam : Entity_Id) return Boolean is
12124 Orig_Node : Node_Id := Empty;
12125 Subp_Decl : Node_Id := Parent (Parent (Proc_Nam));
12127 function Is_Entry (Nam : Node_Id) return Boolean;
12128 -- Determine whether Nam is an entry. Traverse selectors if there are
12129 -- nested selected components.
12135 function Is_Entry (Nam : Node_Id) return Boolean is
12137 if Nkind (Nam) = N_Selected_Component then
12138 return Is_Entry (Selector_Name (Nam));
12141 return Ekind (Entity (Nam)) = E_Entry;
12144 -- Start of processing for Is_Renamed_Entry
12147 if Present (Alias (Proc_Nam)) then
12148 Subp_Decl := Parent (Parent (Alias (Proc_Nam)));
12151 -- Look for a rewritten subprogram renaming declaration
12153 if Nkind (Subp_Decl) = N_Subprogram_Declaration
12154 and then Present (Original_Node (Subp_Decl))
12156 Orig_Node := Original_Node (Subp_Decl);
12159 -- The rewritten subprogram is actually an entry
12161 if Present (Orig_Node)
12162 and then Nkind (Orig_Node) = N_Subprogram_Renaming_Declaration
12163 and then Is_Entry (Name (Orig_Node))
12169 end Is_Renamed_Entry;
12171 ----------------------------
12172 -- Is_Reversible_Iterator --
12173 ----------------------------
12175 function Is_Reversible_Iterator (Typ : Entity_Id) return Boolean is
12176 Ifaces_List : Elist_Id;
12177 Iface_Elmt : Elmt_Id;
12181 if Is_Class_Wide_Type (Typ)
12182 and then Chars (Etype (Typ)) = Name_Reversible_Iterator
12183 and then Is_Predefined_File_Name
12184 (Unit_File_Name (Get_Source_Unit (Etype (Typ))))
12188 elsif not Is_Tagged_Type (Typ) or else not Is_Derived_Type (Typ) then
12192 Collect_Interfaces (Typ, Ifaces_List);
12194 Iface_Elmt := First_Elmt (Ifaces_List);
12195 while Present (Iface_Elmt) loop
12196 Iface := Node (Iface_Elmt);
12197 if Chars (Iface) = Name_Reversible_Iterator
12199 Is_Predefined_File_Name
12200 (Unit_File_Name (Get_Source_Unit (Iface)))
12205 Next_Elmt (Iface_Elmt);
12210 end Is_Reversible_Iterator;
12212 ----------------------
12213 -- Is_Selector_Name --
12214 ----------------------
12216 function Is_Selector_Name (N : Node_Id) return Boolean is
12218 if not Is_List_Member (N) then
12220 P : constant Node_Id := Parent (N);
12222 return Nkind_In (P, N_Expanded_Name,
12223 N_Generic_Association,
12224 N_Parameter_Association,
12225 N_Selected_Component)
12226 and then Selector_Name (P) = N;
12231 L : constant List_Id := List_Containing (N);
12232 P : constant Node_Id := Parent (L);
12234 return (Nkind (P) = N_Discriminant_Association
12235 and then Selector_Names (P) = L)
12237 (Nkind (P) = N_Component_Association
12238 and then Choices (P) = L);
12241 end Is_Selector_Name;
12243 -------------------------------------
12244 -- Is_SPARK_05_Initialization_Expr --
12245 -------------------------------------
12247 function Is_SPARK_05_Initialization_Expr (N : Node_Id) return Boolean is
12250 Comp_Assn : Node_Id;
12251 Orig_N : constant Node_Id := Original_Node (N);
12256 if not Comes_From_Source (Orig_N) then
12260 pragma Assert (Nkind (Orig_N) in N_Subexpr);
12262 case Nkind (Orig_N) is
12263 when N_Character_Literal |
12264 N_Integer_Literal |
12266 N_String_Literal =>
12269 when N_Identifier |
12271 if Is_Entity_Name (Orig_N)
12272 and then Present (Entity (Orig_N)) -- needed in some cases
12274 case Ekind (Entity (Orig_N)) is
12276 E_Enumeration_Literal |
12281 if Is_Type (Entity (Orig_N)) then
12289 when N_Qualified_Expression |
12290 N_Type_Conversion =>
12291 Is_Ok := Is_SPARK_05_Initialization_Expr (Expression (Orig_N));
12294 Is_Ok := Is_SPARK_05_Initialization_Expr (Right_Opnd (Orig_N));
12298 N_Membership_Test =>
12299 Is_Ok := Is_SPARK_05_Initialization_Expr (Left_Opnd (Orig_N))
12301 Is_SPARK_05_Initialization_Expr (Right_Opnd (Orig_N));
12304 N_Extension_Aggregate =>
12305 if Nkind (Orig_N) = N_Extension_Aggregate then
12307 Is_SPARK_05_Initialization_Expr (Ancestor_Part (Orig_N));
12310 Expr := First (Expressions (Orig_N));
12311 while Present (Expr) loop
12312 if not Is_SPARK_05_Initialization_Expr (Expr) then
12320 Comp_Assn := First (Component_Associations (Orig_N));
12321 while Present (Comp_Assn) loop
12322 Expr := Expression (Comp_Assn);
12324 -- Note: test for Present here needed for box assocation
12327 and then not Is_SPARK_05_Initialization_Expr (Expr)
12336 when N_Attribute_Reference =>
12337 if Nkind (Prefix (Orig_N)) in N_Subexpr then
12338 Is_Ok := Is_SPARK_05_Initialization_Expr (Prefix (Orig_N));
12341 Expr := First (Expressions (Orig_N));
12342 while Present (Expr) loop
12343 if not Is_SPARK_05_Initialization_Expr (Expr) then
12351 -- Selected components might be expanded named not yet resolved, so
12352 -- default on the safe side. (Eg on sparklex.ads)
12354 when N_Selected_Component =>
12363 end Is_SPARK_05_Initialization_Expr;
12365 ----------------------------------
12366 -- Is_SPARK_05_Object_Reference --
12367 ----------------------------------
12369 function Is_SPARK_05_Object_Reference (N : Node_Id) return Boolean is
12371 if Is_Entity_Name (N) then
12372 return Present (Entity (N))
12374 (Ekind_In (Entity (N), E_Constant, E_Variable)
12375 or else Ekind (Entity (N)) in Formal_Kind);
12379 when N_Selected_Component =>
12380 return Is_SPARK_05_Object_Reference (Prefix (N));
12386 end Is_SPARK_05_Object_Reference;
12388 -----------------------------
12389 -- Is_Specific_Tagged_Type --
12390 -----------------------------
12392 function Is_Specific_Tagged_Type (Typ : Entity_Id) return Boolean is
12393 Full_Typ : Entity_Id;
12396 -- Handle private types
12398 if Is_Private_Type (Typ) and then Present (Full_View (Typ)) then
12399 Full_Typ := Full_View (Typ);
12404 -- A specific tagged type is a non-class-wide tagged type
12406 return Is_Tagged_Type (Full_Typ) and not Is_Class_Wide_Type (Full_Typ);
12407 end Is_Specific_Tagged_Type;
12413 function Is_Statement (N : Node_Id) return Boolean is
12416 Nkind (N) in N_Statement_Other_Than_Procedure_Call
12417 or else Nkind (N) = N_Procedure_Call_Statement;
12420 -------------------------
12421 -- Is_Subject_To_Ghost --
12422 -------------------------
12424 function Is_Subject_To_Ghost (N : Node_Id) return Boolean is
12425 function Enables_Ghostness (Arg : Node_Id) return Boolean;
12426 -- Determine whether aspect or pragma argument Arg enables "ghostness"
12428 -----------------------
12429 -- Enables_Ghostness --
12430 -----------------------
12432 function Enables_Ghostness (Arg : Node_Id) return Boolean is
12438 if Nkind (Expr) = N_Pragma_Argument_Association then
12439 Expr := Get_Pragma_Arg (Expr);
12442 -- Determine whether the expression of the aspect is static and
12445 if Present (Expr) then
12446 Preanalyze_And_Resolve (Expr);
12449 Is_OK_Static_Expression (Expr)
12450 and then Is_True (Expr_Value (Expr));
12452 -- Otherwise Ghost defaults to True
12457 end Enables_Ghostness;
12461 Id : constant Entity_Id := Defining_Entity (N);
12464 Prev_Id : Entity_Id;
12466 -- Start of processing for Is_Subject_To_Ghost
12469 if Is_Ghost_Entity (Id) then
12472 -- The completion of a type or a constant is not fully analyzed when the
12473 -- reference to the Ghost entity is resolved. Because the completion is
12474 -- not marked as Ghost yet, inspect the partial view.
12476 elsif Is_Record_Type (Id)
12477 or else Ekind (Id) = E_Constant
12478 or else (Nkind (N) = N_Object_Declaration
12479 and then Constant_Present (N))
12481 Prev_Id := Incomplete_Or_Partial_View (Id);
12483 if Present (Prev_Id) and then Is_Ghost_Entity (Prev_Id) then
12488 -- Examine the aspect specifications (if any) looking for aspect Ghost
12490 if Permits_Aspect_Specifications (N) then
12491 Asp := First (Aspect_Specifications (N));
12492 while Present (Asp) loop
12493 if Chars (Identifier (Asp)) = Name_Ghost then
12494 return Enables_Ghostness (Expression (Asp));
12503 -- When the context is a [generic] package declaration, pragma Ghost
12504 -- resides in the visible declarations.
12506 if Nkind_In (N, N_Generic_Package_Declaration,
12507 N_Package_Declaration)
12509 Decl := First (Visible_Declarations (Specification (N)));
12511 -- Otherwise pragma Ghost appears in the declarations following N
12513 elsif Is_List_Member (N) then
12517 while Present (Decl) loop
12518 if Nkind (Decl) = N_Pragma
12519 and then Pragma_Name (Decl) = Name_Ghost
12522 Enables_Ghostness (First (Pragma_Argument_Associations (Decl)));
12524 -- A source construct ends the region where pragma Ghost may appear,
12525 -- stop the traversal.
12527 elsif Comes_From_Source (Decl) then
12535 end Is_Subject_To_Ghost;
12537 --------------------------------------------------
12538 -- Is_Subprogram_Stub_Without_Prior_Declaration --
12539 --------------------------------------------------
12541 function Is_Subprogram_Stub_Without_Prior_Declaration
12542 (N : Node_Id) return Boolean
12545 -- A subprogram stub without prior declaration serves as declaration for
12546 -- the actual subprogram body. As such, it has an attached defining
12547 -- entity of E_[Generic_]Function or E_[Generic_]Procedure.
12549 return Nkind (N) = N_Subprogram_Body_Stub
12550 and then Ekind (Defining_Entity (N)) /= E_Subprogram_Body;
12551 end Is_Subprogram_Stub_Without_Prior_Declaration;
12553 ---------------------------------
12554 -- Is_Synchronized_Tagged_Type --
12555 ---------------------------------
12557 function Is_Synchronized_Tagged_Type (E : Entity_Id) return Boolean is
12558 Kind : constant Entity_Kind := Ekind (Base_Type (E));
12561 -- A task or protected type derived from an interface is a tagged type.
12562 -- Such a tagged type is called a synchronized tagged type, as are
12563 -- synchronized interfaces and private extensions whose declaration
12564 -- includes the reserved word synchronized.
12566 return (Is_Tagged_Type (E)
12567 and then (Kind = E_Task_Type
12569 Kind = E_Protected_Type))
12572 and then Is_Synchronized_Interface (E))
12574 (Ekind (E) = E_Record_Type_With_Private
12575 and then Nkind (Parent (E)) = N_Private_Extension_Declaration
12576 and then (Synchronized_Present (Parent (E))
12577 or else Is_Synchronized_Interface (Etype (E))));
12578 end Is_Synchronized_Tagged_Type;
12584 function Is_Transfer (N : Node_Id) return Boolean is
12585 Kind : constant Node_Kind := Nkind (N);
12588 if Kind = N_Simple_Return_Statement
12590 Kind = N_Extended_Return_Statement
12592 Kind = N_Goto_Statement
12594 Kind = N_Raise_Statement
12596 Kind = N_Requeue_Statement
12600 elsif (Kind = N_Exit_Statement or else Kind in N_Raise_xxx_Error)
12601 and then No (Condition (N))
12605 elsif Kind = N_Procedure_Call_Statement
12606 and then Is_Entity_Name (Name (N))
12607 and then Present (Entity (Name (N)))
12608 and then No_Return (Entity (Name (N)))
12612 elsif Nkind (Original_Node (N)) = N_Raise_Statement then
12624 function Is_True (U : Uint) return Boolean is
12629 --------------------------------------
12630 -- Is_Unchecked_Conversion_Instance --
12631 --------------------------------------
12633 function Is_Unchecked_Conversion_Instance (Id : Entity_Id) return Boolean is
12634 Gen_Par : Entity_Id;
12637 -- Look for a function whose generic parent is the predefined intrinsic
12638 -- function Unchecked_Conversion.
12640 if Ekind (Id) = E_Function then
12641 Gen_Par := Generic_Parent (Parent (Id));
12645 and then Chars (Gen_Par) = Name_Unchecked_Conversion
12646 and then Is_Intrinsic_Subprogram (Gen_Par)
12647 and then Is_Predefined_File_Name
12648 (Unit_File_Name (Get_Source_Unit (Gen_Par)));
12652 end Is_Unchecked_Conversion_Instance;
12654 -------------------------------
12655 -- Is_Universal_Numeric_Type --
12656 -------------------------------
12658 function Is_Universal_Numeric_Type (T : Entity_Id) return Boolean is
12660 return T = Universal_Integer or else T = Universal_Real;
12661 end Is_Universal_Numeric_Type;
12663 -------------------
12664 -- Is_Value_Type --
12665 -------------------
12667 function Is_Value_Type (T : Entity_Id) return Boolean is
12669 return VM_Target = CLI_Target
12670 and then Nkind (T) in N_Has_Chars
12671 and then Chars (T) /= No_Name
12672 and then Get_Name_String (Chars (T)) = "valuetype";
12675 ----------------------------
12676 -- Is_Variable_Size_Array --
12677 ----------------------------
12679 function Is_Variable_Size_Array (E : Entity_Id) return Boolean is
12683 pragma Assert (Is_Array_Type (E));
12685 -- Check if some index is initialized with a non-constant value
12687 Idx := First_Index (E);
12688 while Present (Idx) loop
12689 if Nkind (Idx) = N_Range then
12690 if not Is_Constant_Bound (Low_Bound (Idx))
12691 or else not Is_Constant_Bound (High_Bound (Idx))
12697 Idx := Next_Index (Idx);
12701 end Is_Variable_Size_Array;
12703 -----------------------------
12704 -- Is_Variable_Size_Record --
12705 -----------------------------
12707 function Is_Variable_Size_Record (E : Entity_Id) return Boolean is
12709 Comp_Typ : Entity_Id;
12712 pragma Assert (Is_Record_Type (E));
12714 Comp := First_Entity (E);
12715 while Present (Comp) loop
12716 Comp_Typ := Etype (Comp);
12718 -- Recursive call if the record type has discriminants
12720 if Is_Record_Type (Comp_Typ)
12721 and then Has_Discriminants (Comp_Typ)
12722 and then Is_Variable_Size_Record (Comp_Typ)
12726 elsif Is_Array_Type (Comp_Typ)
12727 and then Is_Variable_Size_Array (Comp_Typ)
12732 Next_Entity (Comp);
12736 end Is_Variable_Size_Record;
12742 function Is_Variable
12744 Use_Original_Node : Boolean := True) return Boolean
12746 Orig_Node : Node_Id;
12748 function In_Protected_Function (E : Entity_Id) return Boolean;
12749 -- Within a protected function, the private components of the enclosing
12750 -- protected type are constants. A function nested within a (protected)
12751 -- procedure is not itself protected. Within the body of a protected
12752 -- function the current instance of the protected type is a constant.
12754 function Is_Variable_Prefix (P : Node_Id) return Boolean;
12755 -- Prefixes can involve implicit dereferences, in which case we must
12756 -- test for the case of a reference of a constant access type, which can
12757 -- can never be a variable.
12759 ---------------------------
12760 -- In_Protected_Function --
12761 ---------------------------
12763 function In_Protected_Function (E : Entity_Id) return Boolean is
12768 -- E is the current instance of a type
12770 if Is_Type (E) then
12779 if not Is_Protected_Type (Prot) then
12783 S := Current_Scope;
12784 while Present (S) and then S /= Prot loop
12785 if Ekind (S) = E_Function and then Scope (S) = Prot then
12794 end In_Protected_Function;
12796 ------------------------
12797 -- Is_Variable_Prefix --
12798 ------------------------
12800 function Is_Variable_Prefix (P : Node_Id) return Boolean is
12802 if Is_Access_Type (Etype (P)) then
12803 return not Is_Access_Constant (Root_Type (Etype (P)));
12805 -- For the case of an indexed component whose prefix has a packed
12806 -- array type, the prefix has been rewritten into a type conversion.
12807 -- Determine variable-ness from the converted expression.
12809 elsif Nkind (P) = N_Type_Conversion
12810 and then not Comes_From_Source (P)
12811 and then Is_Array_Type (Etype (P))
12812 and then Is_Packed (Etype (P))
12814 return Is_Variable (Expression (P));
12817 return Is_Variable (P);
12819 end Is_Variable_Prefix;
12821 -- Start of processing for Is_Variable
12824 -- Check if we perform the test on the original node since this may be a
12825 -- test of syntactic categories which must not be disturbed by whatever
12826 -- rewriting might have occurred. For example, an aggregate, which is
12827 -- certainly NOT a variable, could be turned into a variable by
12830 if Use_Original_Node then
12831 Orig_Node := Original_Node (N);
12836 -- Definitely OK if Assignment_OK is set. Since this is something that
12837 -- only gets set for expanded nodes, the test is on N, not Orig_Node.
12839 if Nkind (N) in N_Subexpr and then Assignment_OK (N) then
12842 -- Normally we go to the original node, but there is one exception where
12843 -- we use the rewritten node, namely when it is an explicit dereference.
12844 -- The generated code may rewrite a prefix which is an access type with
12845 -- an explicit dereference. The dereference is a variable, even though
12846 -- the original node may not be (since it could be a constant of the
12849 -- In Ada 2005 we have a further case to consider: the prefix may be a
12850 -- function call given in prefix notation. The original node appears to
12851 -- be a selected component, but we need to examine the call.
12853 elsif Nkind (N) = N_Explicit_Dereference
12854 and then Nkind (Orig_Node) /= N_Explicit_Dereference
12855 and then Present (Etype (Orig_Node))
12856 and then Is_Access_Type (Etype (Orig_Node))
12858 -- Note that if the prefix is an explicit dereference that does not
12859 -- come from source, we must check for a rewritten function call in
12860 -- prefixed notation before other forms of rewriting, to prevent a
12864 (Nkind (Orig_Node) = N_Function_Call
12865 and then not Is_Access_Constant (Etype (Prefix (N))))
12867 Is_Variable_Prefix (Original_Node (Prefix (N)));
12869 -- in Ada 2012, the dereference may have been added for a type with
12870 -- a declared implicit dereference aspect. Check that it is not an
12871 -- access to constant.
12873 elsif Nkind (N) = N_Explicit_Dereference
12874 and then Present (Etype (Orig_Node))
12875 and then Ada_Version >= Ada_2012
12876 and then Has_Implicit_Dereference (Etype (Orig_Node))
12878 return not Is_Access_Constant (Etype (Prefix (N)));
12880 -- A function call is never a variable
12882 elsif Nkind (N) = N_Function_Call then
12885 -- All remaining checks use the original node
12887 elsif Is_Entity_Name (Orig_Node)
12888 and then Present (Entity (Orig_Node))
12891 E : constant Entity_Id := Entity (Orig_Node);
12892 K : constant Entity_Kind := Ekind (E);
12895 return (K = E_Variable
12896 and then Nkind (Parent (E)) /= N_Exception_Handler)
12897 or else (K = E_Component
12898 and then not In_Protected_Function (E))
12899 or else K = E_Out_Parameter
12900 or else K = E_In_Out_Parameter
12901 or else K = E_Generic_In_Out_Parameter
12903 -- Current instance of type. If this is a protected type, check
12904 -- we are not within the body of one of its protected functions.
12906 or else (Is_Type (E)
12907 and then In_Open_Scopes (E)
12908 and then not In_Protected_Function (E))
12910 or else (Is_Incomplete_Or_Private_Type (E)
12911 and then In_Open_Scopes (Full_View (E)));
12915 case Nkind (Orig_Node) is
12916 when N_Indexed_Component | N_Slice =>
12917 return Is_Variable_Prefix (Prefix (Orig_Node));
12919 when N_Selected_Component =>
12920 return (Is_Variable (Selector_Name (Orig_Node))
12921 and then Is_Variable_Prefix (Prefix (Orig_Node)))
12923 (Nkind (N) = N_Expanded_Name
12924 and then Scope (Entity (N)) = Entity (Prefix (N)));
12926 -- For an explicit dereference, the type of the prefix cannot
12927 -- be an access to constant or an access to subprogram.
12929 when N_Explicit_Dereference =>
12931 Typ : constant Entity_Id := Etype (Prefix (Orig_Node));
12933 return Is_Access_Type (Typ)
12934 and then not Is_Access_Constant (Root_Type (Typ))
12935 and then Ekind (Typ) /= E_Access_Subprogram_Type;
12938 -- The type conversion is the case where we do not deal with the
12939 -- context dependent special case of an actual parameter. Thus
12940 -- the type conversion is only considered a variable for the
12941 -- purposes of this routine if the target type is tagged. However,
12942 -- a type conversion is considered to be a variable if it does not
12943 -- come from source (this deals for example with the conversions
12944 -- of expressions to their actual subtypes).
12946 when N_Type_Conversion =>
12947 return Is_Variable (Expression (Orig_Node))
12949 (not Comes_From_Source (Orig_Node)
12951 (Is_Tagged_Type (Etype (Subtype_Mark (Orig_Node)))
12953 Is_Tagged_Type (Etype (Expression (Orig_Node)))));
12955 -- GNAT allows an unchecked type conversion as a variable. This
12956 -- only affects the generation of internal expanded code, since
12957 -- calls to instantiations of Unchecked_Conversion are never
12958 -- considered variables (since they are function calls).
12960 when N_Unchecked_Type_Conversion =>
12961 return Is_Variable (Expression (Orig_Node));
12969 ---------------------------
12970 -- Is_Visibly_Controlled --
12971 ---------------------------
12973 function Is_Visibly_Controlled (T : Entity_Id) return Boolean is
12974 Root : constant Entity_Id := Root_Type (T);
12976 return Chars (Scope (Root)) = Name_Finalization
12977 and then Chars (Scope (Scope (Root))) = Name_Ada
12978 and then Scope (Scope (Scope (Root))) = Standard_Standard;
12979 end Is_Visibly_Controlled;
12981 ------------------------
12982 -- Is_Volatile_Object --
12983 ------------------------
12985 function Is_Volatile_Object (N : Node_Id) return Boolean is
12987 function Is_Volatile_Prefix (N : Node_Id) return Boolean;
12988 -- If prefix is an implicit dereference, examine designated type
12990 function Object_Has_Volatile_Components (N : Node_Id) return Boolean;
12991 -- Determines if given object has volatile components
12993 ------------------------
12994 -- Is_Volatile_Prefix --
12995 ------------------------
12997 function Is_Volatile_Prefix (N : Node_Id) return Boolean is
12998 Typ : constant Entity_Id := Etype (N);
13001 if Is_Access_Type (Typ) then
13003 Dtyp : constant Entity_Id := Designated_Type (Typ);
13006 return Is_Volatile (Dtyp)
13007 or else Has_Volatile_Components (Dtyp);
13011 return Object_Has_Volatile_Components (N);
13013 end Is_Volatile_Prefix;
13015 ------------------------------------
13016 -- Object_Has_Volatile_Components --
13017 ------------------------------------
13019 function Object_Has_Volatile_Components (N : Node_Id) return Boolean is
13020 Typ : constant Entity_Id := Etype (N);
13023 if Is_Volatile (Typ)
13024 or else Has_Volatile_Components (Typ)
13028 elsif Is_Entity_Name (N)
13029 and then (Has_Volatile_Components (Entity (N))
13030 or else Is_Volatile (Entity (N)))
13034 elsif Nkind (N) = N_Indexed_Component
13035 or else Nkind (N) = N_Selected_Component
13037 return Is_Volatile_Prefix (Prefix (N));
13042 end Object_Has_Volatile_Components;
13044 -- Start of processing for Is_Volatile_Object
13047 if Nkind (N) = N_Defining_Identifier then
13048 return Is_Volatile (N) or else Is_Volatile (Etype (N));
13050 elsif Nkind (N) = N_Expanded_Name then
13051 return Is_Volatile_Object (Entity (N));
13053 elsif Is_Volatile (Etype (N))
13054 or else (Is_Entity_Name (N) and then Is_Volatile (Entity (N)))
13058 elsif Nkind_In (N, N_Indexed_Component, N_Selected_Component)
13059 and then Is_Volatile_Prefix (Prefix (N))
13063 elsif Nkind (N) = N_Selected_Component
13064 and then Is_Volatile (Entity (Selector_Name (N)))
13071 end Is_Volatile_Object;
13073 ---------------------------
13074 -- Itype_Has_Declaration --
13075 ---------------------------
13077 function Itype_Has_Declaration (Id : Entity_Id) return Boolean is
13079 pragma Assert (Is_Itype (Id));
13080 return Present (Parent (Id))
13081 and then Nkind_In (Parent (Id), N_Full_Type_Declaration,
13082 N_Subtype_Declaration)
13083 and then Defining_Entity (Parent (Id)) = Id;
13084 end Itype_Has_Declaration;
13086 -------------------------
13087 -- Kill_Current_Values --
13088 -------------------------
13090 procedure Kill_Current_Values
13092 Last_Assignment_Only : Boolean := False)
13095 if Is_Assignable (Ent) then
13096 Set_Last_Assignment (Ent, Empty);
13099 if Is_Object (Ent) then
13100 if not Last_Assignment_Only then
13102 Set_Current_Value (Ent, Empty);
13104 if not Can_Never_Be_Null (Ent) then
13105 Set_Is_Known_Non_Null (Ent, False);
13108 Set_Is_Known_Null (Ent, False);
13110 -- Reset Is_Known_Valid unless type is always valid, or if we have
13111 -- a loop parameter (loop parameters are always valid, since their
13112 -- bounds are defined by the bounds given in the loop header).
13114 if not Is_Known_Valid (Etype (Ent))
13115 and then Ekind (Ent) /= E_Loop_Parameter
13117 Set_Is_Known_Valid (Ent, False);
13121 end Kill_Current_Values;
13123 procedure Kill_Current_Values (Last_Assignment_Only : Boolean := False) is
13126 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id);
13127 -- Clear current value for entity E and all entities chained to E
13129 ------------------------------------------
13130 -- Kill_Current_Values_For_Entity_Chain --
13131 ------------------------------------------
13133 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id) is
13137 while Present (Ent) loop
13138 Kill_Current_Values (Ent, Last_Assignment_Only);
13141 end Kill_Current_Values_For_Entity_Chain;
13143 -- Start of processing for Kill_Current_Values
13146 -- Kill all saved checks, a special case of killing saved values
13148 if not Last_Assignment_Only then
13152 -- Loop through relevant scopes, which includes the current scope and
13153 -- any parent scopes if the current scope is a block or a package.
13155 S := Current_Scope;
13158 -- Clear current values of all entities in current scope
13160 Kill_Current_Values_For_Entity_Chain (First_Entity (S));
13162 -- If scope is a package, also clear current values of all private
13163 -- entities in the scope.
13165 if Is_Package_Or_Generic_Package (S)
13166 or else Is_Concurrent_Type (S)
13168 Kill_Current_Values_For_Entity_Chain (First_Private_Entity (S));
13171 -- If this is a not a subprogram, deal with parents
13173 if not Is_Subprogram (S) then
13175 exit Scope_Loop when S = Standard_Standard;
13179 end loop Scope_Loop;
13180 end Kill_Current_Values;
13182 --------------------------
13183 -- Kill_Size_Check_Code --
13184 --------------------------
13186 procedure Kill_Size_Check_Code (E : Entity_Id) is
13188 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
13189 and then Present (Size_Check_Code (E))
13191 Remove (Size_Check_Code (E));
13192 Set_Size_Check_Code (E, Empty);
13194 end Kill_Size_Check_Code;
13196 --------------------------
13197 -- Known_To_Be_Assigned --
13198 --------------------------
13200 function Known_To_Be_Assigned (N : Node_Id) return Boolean is
13201 P : constant Node_Id := Parent (N);
13206 -- Test left side of assignment
13208 when N_Assignment_Statement =>
13209 return N = Name (P);
13211 -- Function call arguments are never lvalues
13213 when N_Function_Call =>
13216 -- Positional parameter for procedure or accept call
13218 when N_Procedure_Call_Statement |
13227 Proc := Get_Subprogram_Entity (P);
13233 -- If we are not a list member, something is strange, so
13234 -- be conservative and return False.
13236 if not Is_List_Member (N) then
13240 -- We are going to find the right formal by stepping forward
13241 -- through the formals, as we step backwards in the actuals.
13243 Form := First_Formal (Proc);
13246 -- If no formal, something is weird, so be conservative
13247 -- and return False.
13254 exit when No (Act);
13255 Next_Formal (Form);
13258 return Ekind (Form) /= E_In_Parameter;
13261 -- Named parameter for procedure or accept call
13263 when N_Parameter_Association =>
13269 Proc := Get_Subprogram_Entity (Parent (P));
13275 -- Loop through formals to find the one that matches
13277 Form := First_Formal (Proc);
13279 -- If no matching formal, that's peculiar, some kind of
13280 -- previous error, so return False to be conservative.
13281 -- Actually this also happens in legal code in the case
13282 -- where P is a parameter association for an Extra_Formal???
13288 -- Else test for match
13290 if Chars (Form) = Chars (Selector_Name (P)) then
13291 return Ekind (Form) /= E_In_Parameter;
13294 Next_Formal (Form);
13298 -- Test for appearing in a conversion that itself appears
13299 -- in an lvalue context, since this should be an lvalue.
13301 when N_Type_Conversion =>
13302 return Known_To_Be_Assigned (P);
13304 -- All other references are definitely not known to be modifications
13310 end Known_To_Be_Assigned;
13312 ---------------------------
13313 -- Last_Source_Statement --
13314 ---------------------------
13316 function Last_Source_Statement (HSS : Node_Id) return Node_Id is
13320 N := Last (Statements (HSS));
13321 while Present (N) loop
13322 exit when Comes_From_Source (N);
13327 end Last_Source_Statement;
13329 ----------------------------------
13330 -- Matching_Static_Array_Bounds --
13331 ----------------------------------
13333 function Matching_Static_Array_Bounds
13335 R_Typ : Node_Id) return Boolean
13337 L_Ndims : constant Nat := Number_Dimensions (L_Typ);
13338 R_Ndims : constant Nat := Number_Dimensions (R_Typ);
13350 if L_Ndims /= R_Ndims then
13354 -- Unconstrained types do not have static bounds
13356 if not Is_Constrained (L_Typ) or else not Is_Constrained (R_Typ) then
13360 -- First treat specially the first dimension, as the lower bound and
13361 -- length of string literals are not stored like those of arrays.
13363 if Ekind (L_Typ) = E_String_Literal_Subtype then
13364 L_Low := String_Literal_Low_Bound (L_Typ);
13365 L_Len := String_Literal_Length (L_Typ);
13367 L_Index := First_Index (L_Typ);
13368 Get_Index_Bounds (L_Index, L_Low, L_High);
13370 if Is_OK_Static_Expression (L_Low)
13372 Is_OK_Static_Expression (L_High)
13374 if Expr_Value (L_High) < Expr_Value (L_Low) then
13377 L_Len := (Expr_Value (L_High) - Expr_Value (L_Low)) + 1;
13384 if Ekind (R_Typ) = E_String_Literal_Subtype then
13385 R_Low := String_Literal_Low_Bound (R_Typ);
13386 R_Len := String_Literal_Length (R_Typ);
13388 R_Index := First_Index (R_Typ);
13389 Get_Index_Bounds (R_Index, R_Low, R_High);
13391 if Is_OK_Static_Expression (R_Low)
13393 Is_OK_Static_Expression (R_High)
13395 if Expr_Value (R_High) < Expr_Value (R_Low) then
13398 R_Len := (Expr_Value (R_High) - Expr_Value (R_Low)) + 1;
13405 if (Is_OK_Static_Expression (L_Low)
13407 Is_OK_Static_Expression (R_Low))
13408 and then Expr_Value (L_Low) = Expr_Value (R_Low)
13409 and then L_Len = R_Len
13416 -- Then treat all other dimensions
13418 for Indx in 2 .. L_Ndims loop
13422 Get_Index_Bounds (L_Index, L_Low, L_High);
13423 Get_Index_Bounds (R_Index, R_Low, R_High);
13425 if (Is_OK_Static_Expression (L_Low) and then
13426 Is_OK_Static_Expression (L_High) and then
13427 Is_OK_Static_Expression (R_Low) and then
13428 Is_OK_Static_Expression (R_High))
13429 and then (Expr_Value (L_Low) = Expr_Value (R_Low)
13431 Expr_Value (L_High) = Expr_Value (R_High))
13439 -- If we fall through the loop, all indexes matched
13442 end Matching_Static_Array_Bounds;
13444 -------------------
13445 -- May_Be_Lvalue --
13446 -------------------
13448 function May_Be_Lvalue (N : Node_Id) return Boolean is
13449 P : constant Node_Id := Parent (N);
13454 -- Test left side of assignment
13456 when N_Assignment_Statement =>
13457 return N = Name (P);
13459 -- Test prefix of component or attribute. Note that the prefix of an
13460 -- explicit or implicit dereference cannot be an l-value.
13462 when N_Attribute_Reference =>
13463 return N = Prefix (P)
13464 and then Name_Implies_Lvalue_Prefix (Attribute_Name (P));
13466 -- For an expanded name, the name is an lvalue if the expanded name
13467 -- is an lvalue, but the prefix is never an lvalue, since it is just
13468 -- the scope where the name is found.
13470 when N_Expanded_Name =>
13471 if N = Prefix (P) then
13472 return May_Be_Lvalue (P);
13477 -- For a selected component A.B, A is certainly an lvalue if A.B is.
13478 -- B is a little interesting, if we have A.B := 3, there is some
13479 -- discussion as to whether B is an lvalue or not, we choose to say
13480 -- it is. Note however that A is not an lvalue if it is of an access
13481 -- type since this is an implicit dereference.
13483 when N_Selected_Component =>
13485 and then Present (Etype (N))
13486 and then Is_Access_Type (Etype (N))
13490 return May_Be_Lvalue (P);
13493 -- For an indexed component or slice, the index or slice bounds is
13494 -- never an lvalue. The prefix is an lvalue if the indexed component
13495 -- or slice is an lvalue, except if it is an access type, where we
13496 -- have an implicit dereference.
13498 when N_Indexed_Component | N_Slice =>
13500 or else (Present (Etype (N)) and then Is_Access_Type (Etype (N)))
13504 return May_Be_Lvalue (P);
13507 -- Prefix of a reference is an lvalue if the reference is an lvalue
13509 when N_Reference =>
13510 return May_Be_Lvalue (P);
13512 -- Prefix of explicit dereference is never an lvalue
13514 when N_Explicit_Dereference =>
13517 -- Positional parameter for subprogram, entry, or accept call.
13518 -- In older versions of Ada function call arguments are never
13519 -- lvalues. In Ada 2012 functions can have in-out parameters.
13521 when N_Subprogram_Call |
13522 N_Entry_Call_Statement |
13525 if Nkind (P) = N_Function_Call and then Ada_Version < Ada_2012 then
13529 -- The following mechanism is clumsy and fragile. A single flag
13530 -- set in Resolve_Actuals would be preferable ???
13538 Proc := Get_Subprogram_Entity (P);
13544 -- If we are not a list member, something is strange, so be
13545 -- conservative and return True.
13547 if not Is_List_Member (N) then
13551 -- We are going to find the right formal by stepping forward
13552 -- through the formals, as we step backwards in the actuals.
13554 Form := First_Formal (Proc);
13557 -- If no formal, something is weird, so be conservative and
13565 exit when No (Act);
13566 Next_Formal (Form);
13569 return Ekind (Form) /= E_In_Parameter;
13572 -- Named parameter for procedure or accept call
13574 when N_Parameter_Association =>
13580 Proc := Get_Subprogram_Entity (Parent (P));
13586 -- Loop through formals to find the one that matches
13588 Form := First_Formal (Proc);
13590 -- If no matching formal, that's peculiar, some kind of
13591 -- previous error, so return True to be conservative.
13592 -- Actually happens with legal code for an unresolved call
13593 -- where we may get the wrong homonym???
13599 -- Else test for match
13601 if Chars (Form) = Chars (Selector_Name (P)) then
13602 return Ekind (Form) /= E_In_Parameter;
13605 Next_Formal (Form);
13609 -- Test for appearing in a conversion that itself appears in an
13610 -- lvalue context, since this should be an lvalue.
13612 when N_Type_Conversion =>
13613 return May_Be_Lvalue (P);
13615 -- Test for appearance in object renaming declaration
13617 when N_Object_Renaming_Declaration =>
13620 -- All other references are definitely not lvalues
13628 -----------------------
13629 -- Mark_Coextensions --
13630 -----------------------
13632 procedure Mark_Coextensions (Context_Nod : Node_Id; Root_Nod : Node_Id) is
13633 Is_Dynamic : Boolean;
13634 -- Indicates whether the context causes nested coextensions to be
13635 -- dynamic or static
13637 function Mark_Allocator (N : Node_Id) return Traverse_Result;
13638 -- Recognize an allocator node and label it as a dynamic coextension
13640 --------------------
13641 -- Mark_Allocator --
13642 --------------------
13644 function Mark_Allocator (N : Node_Id) return Traverse_Result is
13646 if Nkind (N) = N_Allocator then
13648 Set_Is_Dynamic_Coextension (N);
13650 -- If the allocator expression is potentially dynamic, it may
13651 -- be expanded out of order and require dynamic allocation
13652 -- anyway, so we treat the coextension itself as dynamic.
13653 -- Potential optimization ???
13655 elsif Nkind (Expression (N)) = N_Qualified_Expression
13656 and then Nkind (Expression (Expression (N))) = N_Op_Concat
13658 Set_Is_Dynamic_Coextension (N);
13660 Set_Is_Static_Coextension (N);
13665 end Mark_Allocator;
13667 procedure Mark_Allocators is new Traverse_Proc (Mark_Allocator);
13669 -- Start of processing Mark_Coextensions
13672 case Nkind (Context_Nod) is
13674 -- Comment here ???
13676 when N_Assignment_Statement =>
13677 Is_Dynamic := Nkind (Expression (Context_Nod)) = N_Allocator;
13679 -- An allocator that is a component of a returned aggregate
13680 -- must be dynamic.
13682 when N_Simple_Return_Statement =>
13684 Expr : constant Node_Id := Expression (Context_Nod);
13687 Nkind (Expr) = N_Allocator
13689 (Nkind (Expr) = N_Qualified_Expression
13690 and then Nkind (Expression (Expr)) = N_Aggregate);
13693 -- An alloctor within an object declaration in an extended return
13694 -- statement is of necessity dynamic.
13696 when N_Object_Declaration =>
13697 Is_Dynamic := Nkind (Root_Nod) = N_Allocator
13699 Nkind (Parent (Context_Nod)) = N_Extended_Return_Statement;
13701 -- This routine should not be called for constructs which may not
13702 -- contain coextensions.
13705 raise Program_Error;
13708 Mark_Allocators (Root_Nod);
13709 end Mark_Coextensions;
13711 ----------------------
13712 -- Needs_One_Actual --
13713 ----------------------
13715 function Needs_One_Actual (E : Entity_Id) return Boolean is
13716 Formal : Entity_Id;
13719 -- Ada 2005 or later, and formals present
13721 if Ada_Version >= Ada_2005 and then Present (First_Formal (E)) then
13722 Formal := Next_Formal (First_Formal (E));
13723 while Present (Formal) loop
13724 if No (Default_Value (Formal)) then
13728 Next_Formal (Formal);
13733 -- Ada 83/95 or no formals
13738 end Needs_One_Actual;
13740 ------------------------
13741 -- New_Copy_List_Tree --
13742 ------------------------
13744 function New_Copy_List_Tree (List : List_Id) return List_Id is
13749 if List = No_List then
13756 while Present (E) loop
13757 Append (New_Copy_Tree (E), NL);
13763 end New_Copy_List_Tree;
13765 --------------------------------------------------
13766 -- New_Copy_Tree Auxiliary Data and Subprograms --
13767 --------------------------------------------------
13769 use Atree.Unchecked_Access;
13770 use Atree_Private_Part;
13772 -- Our approach here requires a two pass traversal of the tree. The
13773 -- first pass visits all nodes that eventually will be copied looking
13774 -- for defining Itypes. If any defining Itypes are found, then they are
13775 -- copied, and an entry is added to the replacement map. In the second
13776 -- phase, the tree is copied, using the replacement map to replace any
13777 -- Itype references within the copied tree.
13779 -- The following hash tables are used if the Map supplied has more
13780 -- than hash threshold entries to speed up access to the map. If
13781 -- there are fewer entries, then the map is searched sequentially
13782 -- (because setting up a hash table for only a few entries takes
13783 -- more time than it saves.
13785 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
13786 -- Hash function used for hash operations
13788 -------------------
13789 -- New_Copy_Hash --
13790 -------------------
13792 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
13794 return Nat (E) mod (NCT_Header_Num'Last + 1);
13801 -- The hash table NCT_Assoc associates old entities in the table
13802 -- with their corresponding new entities (i.e. the pairs of entries
13803 -- presented in the original Map argument are Key-Element pairs).
13805 package NCT_Assoc is new Simple_HTable (
13806 Header_Num => NCT_Header_Num,
13807 Element => Entity_Id,
13808 No_Element => Empty,
13810 Hash => New_Copy_Hash,
13811 Equal => Types."=");
13813 ---------------------
13814 -- NCT_Itype_Assoc --
13815 ---------------------
13817 -- The hash table NCT_Itype_Assoc contains entries only for those
13818 -- old nodes which have a non-empty Associated_Node_For_Itype set.
13819 -- The key is the associated node, and the element is the new node
13820 -- itself (NOT the associated node for the new node).
13822 package NCT_Itype_Assoc is new Simple_HTable (
13823 Header_Num => NCT_Header_Num,
13824 Element => Entity_Id,
13825 No_Element => Empty,
13827 Hash => New_Copy_Hash,
13828 Equal => Types."=");
13830 -------------------
13831 -- New_Copy_Tree --
13832 -------------------
13834 function New_Copy_Tree
13836 Map : Elist_Id := No_Elist;
13837 New_Sloc : Source_Ptr := No_Location;
13838 New_Scope : Entity_Id := Empty) return Node_Id
13840 Actual_Map : Elist_Id := Map;
13841 -- This is the actual map for the copy. It is initialized with the
13842 -- given elements, and then enlarged as required for Itypes that are
13843 -- copied during the first phase of the copy operation. The visit
13844 -- procedures add elements to this map as Itypes are encountered.
13845 -- The reason we cannot use Map directly, is that it may well be
13846 -- (and normally is) initialized to No_Elist, and if we have mapped
13847 -- entities, we have to reset it to point to a real Elist.
13849 function Assoc (N : Node_Or_Entity_Id) return Node_Id;
13850 -- Called during second phase to map entities into their corresponding
13851 -- copies using Actual_Map. If the argument is not an entity, or is not
13852 -- in Actual_Map, then it is returned unchanged.
13854 procedure Build_NCT_Hash_Tables;
13855 -- Builds hash tables (number of elements >= threshold value)
13857 function Copy_Elist_With_Replacement
13858 (Old_Elist : Elist_Id) return Elist_Id;
13859 -- Called during second phase to copy element list doing replacements
13861 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
13862 -- Called during the second phase to process a copied Itype. The actual
13863 -- copy happened during the first phase (so that we could make the entry
13864 -- in the mapping), but we still have to deal with the descendents of
13865 -- the copied Itype and copy them where necessary.
13867 function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
13868 -- Called during second phase to copy list doing replacements
13870 function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
13871 -- Called during second phase to copy node doing replacements
13873 procedure Visit_Elist (E : Elist_Id);
13874 -- Called during first phase to visit all elements of an Elist
13876 procedure Visit_Field (F : Union_Id; N : Node_Id);
13877 -- Visit a single field, recursing to call Visit_Node or Visit_List
13878 -- if the field is a syntactic descendent of the current node (i.e.
13879 -- its parent is Node N).
13881 procedure Visit_Itype (Old_Itype : Entity_Id);
13882 -- Called during first phase to visit subsidiary fields of a defining
13883 -- Itype, and also create a copy and make an entry in the replacement
13884 -- map for the new copy.
13886 procedure Visit_List (L : List_Id);
13887 -- Called during first phase to visit all elements of a List
13889 procedure Visit_Node (N : Node_Or_Entity_Id);
13890 -- Called during first phase to visit a node and all its subtrees
13896 function Assoc (N : Node_Or_Entity_Id) return Node_Id is
13901 if not Has_Extension (N) or else No (Actual_Map) then
13904 elsif NCT_Hash_Tables_Used then
13905 Ent := NCT_Assoc.Get (Entity_Id (N));
13907 if Present (Ent) then
13913 -- No hash table used, do serial search
13916 E := First_Elmt (Actual_Map);
13917 while Present (E) loop
13918 if Node (E) = N then
13919 return Node (Next_Elmt (E));
13921 E := Next_Elmt (Next_Elmt (E));
13929 ---------------------------
13930 -- Build_NCT_Hash_Tables --
13931 ---------------------------
13933 procedure Build_NCT_Hash_Tables is
13937 if NCT_Hash_Table_Setup then
13939 NCT_Itype_Assoc.Reset;
13942 Elmt := First_Elmt (Actual_Map);
13943 while Present (Elmt) loop
13944 Ent := Node (Elmt);
13946 -- Get new entity, and associate old and new
13949 NCT_Assoc.Set (Ent, Node (Elmt));
13951 if Is_Type (Ent) then
13953 Anode : constant Entity_Id :=
13954 Associated_Node_For_Itype (Ent);
13957 if Present (Anode) then
13959 -- Enter a link between the associated node of the
13960 -- old Itype and the new Itype, for updating later
13961 -- when node is copied.
13963 NCT_Itype_Assoc.Set (Anode, Node (Elmt));
13971 NCT_Hash_Tables_Used := True;
13972 NCT_Hash_Table_Setup := True;
13973 end Build_NCT_Hash_Tables;
13975 ---------------------------------
13976 -- Copy_Elist_With_Replacement --
13977 ---------------------------------
13979 function Copy_Elist_With_Replacement
13980 (Old_Elist : Elist_Id) return Elist_Id
13983 New_Elist : Elist_Id;
13986 if No (Old_Elist) then
13990 New_Elist := New_Elmt_List;
13992 M := First_Elmt (Old_Elist);
13993 while Present (M) loop
13994 Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
14000 end Copy_Elist_With_Replacement;
14002 ---------------------------------
14003 -- Copy_Itype_With_Replacement --
14004 ---------------------------------
14006 -- This routine exactly parallels its phase one analog Visit_Itype,
14008 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
14010 -- Translate Next_Entity, Scope and Etype fields, in case they
14011 -- reference entities that have been mapped into copies.
14013 Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
14014 Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
14016 if Present (New_Scope) then
14017 Set_Scope (New_Itype, New_Scope);
14019 Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
14022 -- Copy referenced fields
14024 if Is_Discrete_Type (New_Itype) then
14025 Set_Scalar_Range (New_Itype,
14026 Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
14028 elsif Has_Discriminants (Base_Type (New_Itype)) then
14029 Set_Discriminant_Constraint (New_Itype,
14030 Copy_Elist_With_Replacement
14031 (Discriminant_Constraint (New_Itype)));
14033 elsif Is_Array_Type (New_Itype) then
14034 if Present (First_Index (New_Itype)) then
14035 Set_First_Index (New_Itype,
14036 First (Copy_List_With_Replacement
14037 (List_Containing (First_Index (New_Itype)))));
14040 if Is_Packed (New_Itype) then
14041 Set_Packed_Array_Impl_Type (New_Itype,
14042 Copy_Node_With_Replacement
14043 (Packed_Array_Impl_Type (New_Itype)));
14046 end Copy_Itype_With_Replacement;
14048 --------------------------------
14049 -- Copy_List_With_Replacement --
14050 --------------------------------
14052 function Copy_List_With_Replacement
14053 (Old_List : List_Id) return List_Id
14055 New_List : List_Id;
14059 if Old_List = No_List then
14063 New_List := Empty_List;
14065 E := First (Old_List);
14066 while Present (E) loop
14067 Append (Copy_Node_With_Replacement (E), New_List);
14073 end Copy_List_With_Replacement;
14075 --------------------------------
14076 -- Copy_Node_With_Replacement --
14077 --------------------------------
14079 function Copy_Node_With_Replacement
14080 (Old_Node : Node_Id) return Node_Id
14082 New_Node : Node_Id;
14084 procedure Adjust_Named_Associations
14085 (Old_Node : Node_Id;
14086 New_Node : Node_Id);
14087 -- If a call node has named associations, these are chained through
14088 -- the First_Named_Actual, Next_Named_Actual links. These must be
14089 -- propagated separately to the new parameter list, because these
14090 -- are not syntactic fields.
14092 function Copy_Field_With_Replacement
14093 (Field : Union_Id) return Union_Id;
14094 -- Given Field, which is a field of Old_Node, return a copy of it
14095 -- if it is a syntactic field (i.e. its parent is Node), setting
14096 -- the parent of the copy to poit to New_Node. Otherwise returns
14097 -- the field (possibly mapped if it is an entity).
14099 -------------------------------
14100 -- Adjust_Named_Associations --
14101 -------------------------------
14103 procedure Adjust_Named_Associations
14104 (Old_Node : Node_Id;
14105 New_Node : Node_Id)
14110 Old_Next : Node_Id;
14111 New_Next : Node_Id;
14114 Old_E := First (Parameter_Associations (Old_Node));
14115 New_E := First (Parameter_Associations (New_Node));
14116 while Present (Old_E) loop
14117 if Nkind (Old_E) = N_Parameter_Association
14118 and then Present (Next_Named_Actual (Old_E))
14120 if First_Named_Actual (Old_Node)
14121 = Explicit_Actual_Parameter (Old_E)
14123 Set_First_Named_Actual
14124 (New_Node, Explicit_Actual_Parameter (New_E));
14127 -- Now scan parameter list from the beginning,to locate
14128 -- next named actual, which can be out of order.
14130 Old_Next := First (Parameter_Associations (Old_Node));
14131 New_Next := First (Parameter_Associations (New_Node));
14133 while Nkind (Old_Next) /= N_Parameter_Association
14134 or else Explicit_Actual_Parameter (Old_Next)
14135 /= Next_Named_Actual (Old_E)
14141 Set_Next_Named_Actual
14142 (New_E, Explicit_Actual_Parameter (New_Next));
14148 end Adjust_Named_Associations;
14150 ---------------------------------
14151 -- Copy_Field_With_Replacement --
14152 ---------------------------------
14154 function Copy_Field_With_Replacement
14155 (Field : Union_Id) return Union_Id
14158 if Field = Union_Id (Empty) then
14161 elsif Field in Node_Range then
14163 Old_N : constant Node_Id := Node_Id (Field);
14167 -- If syntactic field, as indicated by the parent pointer
14168 -- being set, then copy the referenced node recursively.
14170 if Parent (Old_N) = Old_Node then
14171 New_N := Copy_Node_With_Replacement (Old_N);
14173 if New_N /= Old_N then
14174 Set_Parent (New_N, New_Node);
14177 -- For semantic fields, update possible entity reference
14178 -- from the replacement map.
14181 New_N := Assoc (Old_N);
14184 return Union_Id (New_N);
14187 elsif Field in List_Range then
14189 Old_L : constant List_Id := List_Id (Field);
14193 -- If syntactic field, as indicated by the parent pointer,
14194 -- then recursively copy the entire referenced list.
14196 if Parent (Old_L) = Old_Node then
14197 New_L := Copy_List_With_Replacement (Old_L);
14198 Set_Parent (New_L, New_Node);
14200 -- For semantic list, just returned unchanged
14206 return Union_Id (New_L);
14209 -- Anything other than a list or a node is returned unchanged
14214 end Copy_Field_With_Replacement;
14216 -- Start of processing for Copy_Node_With_Replacement
14219 if Old_Node <= Empty_Or_Error then
14222 elsif Has_Extension (Old_Node) then
14223 return Assoc (Old_Node);
14226 New_Node := New_Copy (Old_Node);
14228 -- If the node we are copying is the associated node of a
14229 -- previously copied Itype, then adjust the associated node
14230 -- of the copy of that Itype accordingly.
14232 if Present (Actual_Map) then
14238 -- Case of hash table used
14240 if NCT_Hash_Tables_Used then
14241 Ent := NCT_Itype_Assoc.Get (Old_Node);
14243 if Present (Ent) then
14244 Set_Associated_Node_For_Itype (Ent, New_Node);
14247 -- Case of no hash table used
14250 E := First_Elmt (Actual_Map);
14251 while Present (E) loop
14252 if Is_Itype (Node (E))
14254 Old_Node = Associated_Node_For_Itype (Node (E))
14256 Set_Associated_Node_For_Itype
14257 (Node (Next_Elmt (E)), New_Node);
14260 E := Next_Elmt (Next_Elmt (E));
14266 -- Recursively copy descendents
14269 (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
14271 (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
14273 (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
14275 (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
14277 (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
14279 -- Adjust Sloc of new node if necessary
14281 if New_Sloc /= No_Location then
14282 Set_Sloc (New_Node, New_Sloc);
14284 -- If we adjust the Sloc, then we are essentially making
14285 -- a completely new node, so the Comes_From_Source flag
14286 -- should be reset to the proper default value.
14288 Nodes.Table (New_Node).Comes_From_Source :=
14289 Default_Node.Comes_From_Source;
14292 -- If the node is call and has named associations,
14293 -- set the corresponding links in the copy.
14295 if (Nkind (Old_Node) = N_Function_Call
14296 or else Nkind (Old_Node) = N_Entry_Call_Statement
14298 Nkind (Old_Node) = N_Procedure_Call_Statement)
14299 and then Present (First_Named_Actual (Old_Node))
14301 Adjust_Named_Associations (Old_Node, New_Node);
14304 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
14305 -- The replacement mechanism applies to entities, and is not used
14306 -- here. Eventually we may need a more general graph-copying
14307 -- routine. For now, do a sequential search to find desired node.
14309 if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
14310 and then Present (First_Real_Statement (Old_Node))
14313 Old_F : constant Node_Id := First_Real_Statement (Old_Node);
14317 N1 := First (Statements (Old_Node));
14318 N2 := First (Statements (New_Node));
14320 while N1 /= Old_F loop
14325 Set_First_Real_Statement (New_Node, N2);
14330 -- All done, return copied node
14333 end Copy_Node_With_Replacement;
14339 procedure Visit_Elist (E : Elist_Id) is
14342 if Present (E) then
14343 Elmt := First_Elmt (E);
14345 while Elmt /= No_Elmt loop
14346 Visit_Node (Node (Elmt));
14356 procedure Visit_Field (F : Union_Id; N : Node_Id) is
14358 if F = Union_Id (Empty) then
14361 elsif F in Node_Range then
14363 -- Copy node if it is syntactic, i.e. its parent pointer is
14364 -- set to point to the field that referenced it (certain
14365 -- Itypes will also meet this criterion, which is fine, since
14366 -- these are clearly Itypes that do need to be copied, since
14367 -- we are copying their parent.)
14369 if Parent (Node_Id (F)) = N then
14370 Visit_Node (Node_Id (F));
14373 -- Another case, if we are pointing to an Itype, then we want
14374 -- to copy it if its associated node is somewhere in the tree
14377 -- Note: the exclusion of self-referential copies is just an
14378 -- optimization, since the search of the already copied list
14379 -- would catch it, but it is a common case (Etype pointing
14380 -- to itself for an Itype that is a base type).
14382 elsif Has_Extension (Node_Id (F))
14383 and then Is_Itype (Entity_Id (F))
14384 and then Node_Id (F) /= N
14390 P := Associated_Node_For_Itype (Node_Id (F));
14391 while Present (P) loop
14393 Visit_Node (Node_Id (F));
14400 -- An Itype whose parent is not being copied definitely
14401 -- should NOT be copied, since it does not belong in any
14402 -- sense to the copied subtree.
14408 elsif F in List_Range and then Parent (List_Id (F)) = N then
14409 Visit_List (List_Id (F));
14418 procedure Visit_Itype (Old_Itype : Entity_Id) is
14419 New_Itype : Entity_Id;
14424 -- Itypes that describe the designated type of access to subprograms
14425 -- have the structure of subprogram declarations, with signatures,
14426 -- etc. Either we duplicate the signatures completely, or choose to
14427 -- share such itypes, which is fine because their elaboration will
14428 -- have no side effects.
14430 if Ekind (Old_Itype) = E_Subprogram_Type then
14434 New_Itype := New_Copy (Old_Itype);
14436 -- The new Itype has all the attributes of the old one, and
14437 -- we just copy the contents of the entity. However, the back-end
14438 -- needs different names for debugging purposes, so we create a
14439 -- new internal name for it in all cases.
14441 Set_Chars (New_Itype, New_Internal_Name ('T'));
14443 -- If our associated node is an entity that has already been copied,
14444 -- then set the associated node of the copy to point to the right
14445 -- copy. If we have copied an Itype that is itself the associated
14446 -- node of some previously copied Itype, then we set the right
14447 -- pointer in the other direction.
14449 if Present (Actual_Map) then
14451 -- Case of hash tables used
14453 if NCT_Hash_Tables_Used then
14455 Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
14457 if Present (Ent) then
14458 Set_Associated_Node_For_Itype (New_Itype, Ent);
14461 Ent := NCT_Itype_Assoc.Get (Old_Itype);
14462 if Present (Ent) then
14463 Set_Associated_Node_For_Itype (Ent, New_Itype);
14465 -- If the hash table has no association for this Itype and
14466 -- its associated node, enter one now.
14469 NCT_Itype_Assoc.Set
14470 (Associated_Node_For_Itype (Old_Itype), New_Itype);
14473 -- Case of hash tables not used
14476 E := First_Elmt (Actual_Map);
14477 while Present (E) loop
14478 if Associated_Node_For_Itype (Old_Itype) = Node (E) then
14479 Set_Associated_Node_For_Itype
14480 (New_Itype, Node (Next_Elmt (E)));
14483 if Is_Type (Node (E))
14484 and then Old_Itype = Associated_Node_For_Itype (Node (E))
14486 Set_Associated_Node_For_Itype
14487 (Node (Next_Elmt (E)), New_Itype);
14490 E := Next_Elmt (Next_Elmt (E));
14495 if Present (Freeze_Node (New_Itype)) then
14496 Set_Is_Frozen (New_Itype, False);
14497 Set_Freeze_Node (New_Itype, Empty);
14500 -- Add new association to map
14502 if No (Actual_Map) then
14503 Actual_Map := New_Elmt_List;
14506 Append_Elmt (Old_Itype, Actual_Map);
14507 Append_Elmt (New_Itype, Actual_Map);
14509 if NCT_Hash_Tables_Used then
14510 NCT_Assoc.Set (Old_Itype, New_Itype);
14513 NCT_Table_Entries := NCT_Table_Entries + 1;
14515 if NCT_Table_Entries > NCT_Hash_Threshold then
14516 Build_NCT_Hash_Tables;
14520 -- If a record subtype is simply copied, the entity list will be
14521 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
14523 if Ekind_In (Old_Itype, E_Record_Subtype, E_Class_Wide_Subtype) then
14524 Set_Cloned_Subtype (New_Itype, Old_Itype);
14527 -- Visit descendents that eventually get copied
14529 Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
14531 if Is_Discrete_Type (Old_Itype) then
14532 Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
14534 elsif Has_Discriminants (Base_Type (Old_Itype)) then
14535 -- ??? This should involve call to Visit_Field
14536 Visit_Elist (Discriminant_Constraint (Old_Itype));
14538 elsif Is_Array_Type (Old_Itype) then
14539 if Present (First_Index (Old_Itype)) then
14540 Visit_Field (Union_Id (List_Containing
14541 (First_Index (Old_Itype))),
14545 if Is_Packed (Old_Itype) then
14546 Visit_Field (Union_Id (Packed_Array_Impl_Type (Old_Itype)),
14556 procedure Visit_List (L : List_Id) is
14559 if L /= No_List then
14562 while Present (N) loop
14573 procedure Visit_Node (N : Node_Or_Entity_Id) is
14575 -- Start of processing for Visit_Node
14578 -- Handle case of an Itype, which must be copied
14580 if Has_Extension (N) and then Is_Itype (N) then
14582 -- Nothing to do if already in the list. This can happen with an
14583 -- Itype entity that appears more than once in the tree.
14584 -- Note that we do not want to visit descendents in this case.
14586 -- Test for already in list when hash table is used
14588 if NCT_Hash_Tables_Used then
14589 if Present (NCT_Assoc.Get (Entity_Id (N))) then
14593 -- Test for already in list when hash table not used
14599 if Present (Actual_Map) then
14600 E := First_Elmt (Actual_Map);
14601 while Present (E) loop
14602 if Node (E) = N then
14605 E := Next_Elmt (Next_Elmt (E));
14615 -- Visit descendents
14617 Visit_Field (Field1 (N), N);
14618 Visit_Field (Field2 (N), N);
14619 Visit_Field (Field3 (N), N);
14620 Visit_Field (Field4 (N), N);
14621 Visit_Field (Field5 (N), N);
14624 -- Start of processing for New_Copy_Tree
14629 -- See if we should use hash table
14631 if No (Actual_Map) then
14632 NCT_Hash_Tables_Used := False;
14639 NCT_Table_Entries := 0;
14641 Elmt := First_Elmt (Actual_Map);
14642 while Present (Elmt) loop
14643 NCT_Table_Entries := NCT_Table_Entries + 1;
14648 if NCT_Table_Entries > NCT_Hash_Threshold then
14649 Build_NCT_Hash_Tables;
14651 NCT_Hash_Tables_Used := False;
14656 -- Hash table set up if required, now start phase one by visiting
14657 -- top node (we will recursively visit the descendents).
14659 Visit_Node (Source);
14661 -- Now the second phase of the copy can start. First we process
14662 -- all the mapped entities, copying their descendents.
14664 if Present (Actual_Map) then
14667 New_Itype : Entity_Id;
14669 Elmt := First_Elmt (Actual_Map);
14670 while Present (Elmt) loop
14672 New_Itype := Node (Elmt);
14673 Copy_Itype_With_Replacement (New_Itype);
14679 -- Now we can copy the actual tree
14681 return Copy_Node_With_Replacement (Source);
14684 -------------------------
14685 -- New_External_Entity --
14686 -------------------------
14688 function New_External_Entity
14689 (Kind : Entity_Kind;
14690 Scope_Id : Entity_Id;
14691 Sloc_Value : Source_Ptr;
14692 Related_Id : Entity_Id;
14693 Suffix : Character;
14694 Suffix_Index : Nat := 0;
14695 Prefix : Character := ' ') return Entity_Id
14697 N : constant Entity_Id :=
14698 Make_Defining_Identifier (Sloc_Value,
14700 (Chars (Related_Id), Suffix, Suffix_Index, Prefix));
14703 Set_Ekind (N, Kind);
14704 Set_Is_Internal (N, True);
14705 Append_Entity (N, Scope_Id);
14706 Set_Public_Status (N);
14708 if Kind in Type_Kind then
14709 Init_Size_Align (N);
14713 end New_External_Entity;
14715 -------------------------
14716 -- New_Internal_Entity --
14717 -------------------------
14719 function New_Internal_Entity
14720 (Kind : Entity_Kind;
14721 Scope_Id : Entity_Id;
14722 Sloc_Value : Source_Ptr;
14723 Id_Char : Character) return Entity_Id
14725 N : constant Entity_Id := Make_Temporary (Sloc_Value, Id_Char);
14728 Set_Ekind (N, Kind);
14729 Set_Is_Internal (N, True);
14730 Append_Entity (N, Scope_Id);
14732 if Kind in Type_Kind then
14733 Init_Size_Align (N);
14737 end New_Internal_Entity;
14743 function Next_Actual (Actual_Id : Node_Id) return Node_Id is
14747 -- If we are pointing at a positional parameter, it is a member of a
14748 -- node list (the list of parameters), and the next parameter is the
14749 -- next node on the list, unless we hit a parameter association, then
14750 -- we shift to using the chain whose head is the First_Named_Actual in
14751 -- the parent, and then is threaded using the Next_Named_Actual of the
14752 -- Parameter_Association. All this fiddling is because the original node
14753 -- list is in the textual call order, and what we need is the
14754 -- declaration order.
14756 if Is_List_Member (Actual_Id) then
14757 N := Next (Actual_Id);
14759 if Nkind (N) = N_Parameter_Association then
14760 return First_Named_Actual (Parent (Actual_Id));
14766 return Next_Named_Actual (Parent (Actual_Id));
14770 procedure Next_Actual (Actual_Id : in out Node_Id) is
14772 Actual_Id := Next_Actual (Actual_Id);
14775 -----------------------
14776 -- Normalize_Actuals --
14777 -----------------------
14779 -- Chain actuals according to formals of subprogram. If there are no named
14780 -- associations, the chain is simply the list of Parameter Associations,
14781 -- since the order is the same as the declaration order. If there are named
14782 -- associations, then the First_Named_Actual field in the N_Function_Call
14783 -- or N_Procedure_Call_Statement node points to the Parameter_Association
14784 -- node for the parameter that comes first in declaration order. The
14785 -- remaining named parameters are then chained in declaration order using
14786 -- Next_Named_Actual.
14788 -- This routine also verifies that the number of actuals is compatible with
14789 -- the number and default values of formals, but performs no type checking
14790 -- (type checking is done by the caller).
14792 -- If the matching succeeds, Success is set to True and the caller proceeds
14793 -- with type-checking. If the match is unsuccessful, then Success is set to
14794 -- False, and the caller attempts a different interpretation, if there is
14797 -- If the flag Report is on, the call is not overloaded, and a failure to
14798 -- match can be reported here, rather than in the caller.
14800 procedure Normalize_Actuals
14804 Success : out Boolean)
14806 Actuals : constant List_Id := Parameter_Associations (N);
14807 Actual : Node_Id := Empty;
14808 Formal : Entity_Id;
14809 Last : Node_Id := Empty;
14810 First_Named : Node_Id := Empty;
14813 Formals_To_Match : Integer := 0;
14814 Actuals_To_Match : Integer := 0;
14816 procedure Chain (A : Node_Id);
14817 -- Add named actual at the proper place in the list, using the
14818 -- Next_Named_Actual link.
14820 function Reporting return Boolean;
14821 -- Determines if an error is to be reported. To report an error, we
14822 -- need Report to be True, and also we do not report errors caused
14823 -- by calls to init procs that occur within other init procs. Such
14824 -- errors must always be cascaded errors, since if all the types are
14825 -- declared correctly, the compiler will certainly build decent calls.
14831 procedure Chain (A : Node_Id) is
14835 -- Call node points to first actual in list
14837 Set_First_Named_Actual (N, Explicit_Actual_Parameter (A));
14840 Set_Next_Named_Actual (Last, Explicit_Actual_Parameter (A));
14844 Set_Next_Named_Actual (Last, Empty);
14851 function Reporting return Boolean is
14856 elsif not Within_Init_Proc then
14859 elsif Is_Init_Proc (Entity (Name (N))) then
14867 -- Start of processing for Normalize_Actuals
14870 if Is_Access_Type (S) then
14872 -- The name in the call is a function call that returns an access
14873 -- to subprogram. The designated type has the list of formals.
14875 Formal := First_Formal (Designated_Type (S));
14877 Formal := First_Formal (S);
14880 while Present (Formal) loop
14881 Formals_To_Match := Formals_To_Match + 1;
14882 Next_Formal (Formal);
14885 -- Find if there is a named association, and verify that no positional
14886 -- associations appear after named ones.
14888 if Present (Actuals) then
14889 Actual := First (Actuals);
14892 while Present (Actual)
14893 and then Nkind (Actual) /= N_Parameter_Association
14895 Actuals_To_Match := Actuals_To_Match + 1;
14899 if No (Actual) and Actuals_To_Match = Formals_To_Match then
14901 -- Most common case: positional notation, no defaults
14906 elsif Actuals_To_Match > Formals_To_Match then
14908 -- Too many actuals: will not work
14911 if Is_Entity_Name (Name (N)) then
14912 Error_Msg_N ("too many arguments in call to&", Name (N));
14914 Error_Msg_N ("too many arguments in call", N);
14922 First_Named := Actual;
14924 while Present (Actual) loop
14925 if Nkind (Actual) /= N_Parameter_Association then
14927 ("positional parameters not allowed after named ones", Actual);
14932 Actuals_To_Match := Actuals_To_Match + 1;
14938 if Present (Actuals) then
14939 Actual := First (Actuals);
14942 Formal := First_Formal (S);
14943 while Present (Formal) loop
14945 -- Match the formals in order. If the corresponding actual is
14946 -- positional, nothing to do. Else scan the list of named actuals
14947 -- to find the one with the right name.
14949 if Present (Actual)
14950 and then Nkind (Actual) /= N_Parameter_Association
14953 Actuals_To_Match := Actuals_To_Match - 1;
14954 Formals_To_Match := Formals_To_Match - 1;
14957 -- For named parameters, search the list of actuals to find
14958 -- one that matches the next formal name.
14960 Actual := First_Named;
14962 while Present (Actual) loop
14963 if Chars (Selector_Name (Actual)) = Chars (Formal) then
14966 Actuals_To_Match := Actuals_To_Match - 1;
14967 Formals_To_Match := Formals_To_Match - 1;
14975 if Ekind (Formal) /= E_In_Parameter
14976 or else No (Default_Value (Formal))
14979 if (Comes_From_Source (S)
14980 or else Sloc (S) = Standard_Location)
14981 and then Is_Overloadable (S)
14985 Nkind_In (Parent (N), N_Procedure_Call_Statement,
14987 N_Parameter_Association)
14988 and then Ekind (S) /= E_Function
14990 Set_Etype (N, Etype (S));
14993 Error_Msg_Name_1 := Chars (S);
14994 Error_Msg_Sloc := Sloc (S);
14996 ("missing argument for parameter & "
14997 & "in call to % declared #", N, Formal);
15000 elsif Is_Overloadable (S) then
15001 Error_Msg_Name_1 := Chars (S);
15003 -- Point to type derivation that generated the
15006 Error_Msg_Sloc := Sloc (Parent (S));
15009 ("missing argument for parameter & "
15010 & "in call to % (inherited) #", N, Formal);
15014 ("missing argument for parameter &", N, Formal);
15022 Formals_To_Match := Formals_To_Match - 1;
15027 Next_Formal (Formal);
15030 if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
15037 -- Find some superfluous named actual that did not get
15038 -- attached to the list of associations.
15040 Actual := First (Actuals);
15041 while Present (Actual) loop
15042 if Nkind (Actual) = N_Parameter_Association
15043 and then Actual /= Last
15044 and then No (Next_Named_Actual (Actual))
15046 Error_Msg_N ("unmatched actual & in call",
15047 Selector_Name (Actual));
15058 end Normalize_Actuals;
15060 --------------------------------
15061 -- Note_Possible_Modification --
15062 --------------------------------
15064 procedure Note_Possible_Modification (N : Node_Id; Sure : Boolean) is
15065 Modification_Comes_From_Source : constant Boolean :=
15066 Comes_From_Source (Parent (N));
15072 -- Loop to find referenced entity, if there is one
15078 if Is_Entity_Name (Exp) then
15079 Ent := Entity (Exp);
15081 -- If the entity is missing, it is an undeclared identifier,
15082 -- and there is nothing to annotate.
15088 elsif Nkind (Exp) = N_Explicit_Dereference then
15090 P : constant Node_Id := Prefix (Exp);
15093 -- In formal verification mode, keep track of all reads and
15094 -- writes through explicit dereferences.
15096 if GNATprove_Mode then
15097 SPARK_Specific.Generate_Dereference (N, 'm');
15100 if Nkind (P) = N_Selected_Component
15101 and then Present (Entry_Formal (Entity (Selector_Name (P))))
15103 -- Case of a reference to an entry formal
15105 Ent := Entry_Formal (Entity (Selector_Name (P)));
15107 elsif Nkind (P) = N_Identifier
15108 and then Nkind (Parent (Entity (P))) = N_Object_Declaration
15109 and then Present (Expression (Parent (Entity (P))))
15110 and then Nkind (Expression (Parent (Entity (P)))) =
15113 -- Case of a reference to a value on which side effects have
15116 Exp := Prefix (Expression (Parent (Entity (P))));
15124 elsif Nkind_In (Exp, N_Type_Conversion,
15125 N_Unchecked_Type_Conversion)
15127 Exp := Expression (Exp);
15130 elsif Nkind_In (Exp, N_Slice,
15131 N_Indexed_Component,
15132 N_Selected_Component)
15134 -- Special check, if the prefix is an access type, then return
15135 -- since we are modifying the thing pointed to, not the prefix.
15136 -- When we are expanding, most usually the prefix is replaced
15137 -- by an explicit dereference, and this test is not needed, but
15138 -- in some cases (notably -gnatc mode and generics) when we do
15139 -- not do full expansion, we need this special test.
15141 if Is_Access_Type (Etype (Prefix (Exp))) then
15144 -- Otherwise go to prefix and keep going
15147 Exp := Prefix (Exp);
15151 -- All other cases, not a modification
15157 -- Now look for entity being referenced
15159 if Present (Ent) then
15160 if Is_Object (Ent) then
15161 if Comes_From_Source (Exp)
15162 or else Modification_Comes_From_Source
15164 -- Give warning if pragma unmodified given and we are
15165 -- sure this is a modification.
15167 if Has_Pragma_Unmodified (Ent) and then Sure then
15168 Error_Msg_NE ("??pragma Unmodified given for &!", N, Ent);
15171 Set_Never_Set_In_Source (Ent, False);
15174 Set_Is_True_Constant (Ent, False);
15175 Set_Current_Value (Ent, Empty);
15176 Set_Is_Known_Null (Ent, False);
15178 if not Can_Never_Be_Null (Ent) then
15179 Set_Is_Known_Non_Null (Ent, False);
15182 -- Follow renaming chain
15184 if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
15185 and then Present (Renamed_Object (Ent))
15187 Exp := Renamed_Object (Ent);
15189 -- If the entity is the loop variable in an iteration over
15190 -- a container, retrieve container expression to indicate
15191 -- possible modificastion.
15193 if Present (Related_Expression (Ent))
15194 and then Nkind (Parent (Related_Expression (Ent))) =
15195 N_Iterator_Specification
15197 Exp := Original_Node (Related_Expression (Ent));
15202 -- The expression may be the renaming of a subcomponent of an
15203 -- array or container. The assignment to the subcomponent is
15204 -- a modification of the container.
15206 elsif Comes_From_Source (Original_Node (Exp))
15207 and then Nkind_In (Original_Node (Exp), N_Selected_Component,
15208 N_Indexed_Component)
15210 Exp := Prefix (Original_Node (Exp));
15214 -- Generate a reference only if the assignment comes from
15215 -- source. This excludes, for example, calls to a dispatching
15216 -- assignment operation when the left-hand side is tagged. In
15217 -- GNATprove mode, we need those references also on generated
15218 -- code, as these are used to compute the local effects of
15221 if Modification_Comes_From_Source or GNATprove_Mode then
15222 Generate_Reference (Ent, Exp, 'm');
15224 -- If the target of the assignment is the bound variable
15225 -- in an iterator, indicate that the corresponding array
15226 -- or container is also modified.
15228 if Ada_Version >= Ada_2012
15229 and then Nkind (Parent (Ent)) = N_Iterator_Specification
15232 Domain : constant Node_Id := Name (Parent (Ent));
15235 -- TBD : in the full version of the construct, the
15236 -- domain of iteration can be given by an expression.
15238 if Is_Entity_Name (Domain) then
15239 Generate_Reference (Entity (Domain), Exp, 'm');
15240 Set_Is_True_Constant (Entity (Domain), False);
15241 Set_Never_Set_In_Source (Entity (Domain), False);
15247 Check_Nested_Access (Ent);
15252 -- If we are sure this is a modification from source, and we know
15253 -- this modifies a constant, then give an appropriate warning.
15255 if Overlays_Constant (Ent)
15256 and then (Modification_Comes_From_Source and Sure)
15259 A : constant Node_Id := Address_Clause (Ent);
15261 if Present (A) then
15263 Exp : constant Node_Id := Expression (A);
15265 if Nkind (Exp) = N_Attribute_Reference
15266 and then Attribute_Name (Exp) = Name_Address
15267 and then Is_Entity_Name (Prefix (Exp))
15269 Error_Msg_Sloc := Sloc (A);
15271 ("constant& may be modified via address "
15272 & "clause#??", N, Entity (Prefix (Exp)));
15285 end Note_Possible_Modification;
15287 -------------------------
15288 -- Object_Access_Level --
15289 -------------------------
15291 -- Returns the static accessibility level of the view denoted by Obj. Note
15292 -- that the value returned is the result of a call to Scope_Depth. Only
15293 -- scope depths associated with dynamic scopes can actually be returned.
15294 -- Since only relative levels matter for accessibility checking, the fact
15295 -- that the distance between successive levels of accessibility is not
15296 -- always one is immaterial (invariant: if level(E2) is deeper than
15297 -- level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
15299 function Object_Access_Level (Obj : Node_Id) return Uint is
15300 function Is_Interface_Conversion (N : Node_Id) return Boolean;
15301 -- Determine whether N is a construct of the form
15302 -- Some_Type (Operand._tag'Address)
15303 -- This construct appears in the context of dispatching calls.
15305 function Reference_To (Obj : Node_Id) return Node_Id;
15306 -- An explicit dereference is created when removing side-effects from
15307 -- expressions for constraint checking purposes. In this case a local
15308 -- access type is created for it. The correct access level is that of
15309 -- the original source node. We detect this case by noting that the
15310 -- prefix of the dereference is created by an object declaration whose
15311 -- initial expression is a reference.
15313 -----------------------------
15314 -- Is_Interface_Conversion --
15315 -----------------------------
15317 function Is_Interface_Conversion (N : Node_Id) return Boolean is
15319 return Nkind (N) = N_Unchecked_Type_Conversion
15320 and then Nkind (Expression (N)) = N_Attribute_Reference
15321 and then Attribute_Name (Expression (N)) = Name_Address;
15322 end Is_Interface_Conversion;
15328 function Reference_To (Obj : Node_Id) return Node_Id is
15329 Pref : constant Node_Id := Prefix (Obj);
15331 if Is_Entity_Name (Pref)
15332 and then Nkind (Parent (Entity (Pref))) = N_Object_Declaration
15333 and then Present (Expression (Parent (Entity (Pref))))
15334 and then Nkind (Expression (Parent (Entity (Pref)))) = N_Reference
15336 return (Prefix (Expression (Parent (Entity (Pref)))));
15346 -- Start of processing for Object_Access_Level
15349 if Nkind (Obj) = N_Defining_Identifier
15350 or else Is_Entity_Name (Obj)
15352 if Nkind (Obj) = N_Defining_Identifier then
15358 if Is_Prival (E) then
15359 E := Prival_Link (E);
15362 -- If E is a type then it denotes a current instance. For this case
15363 -- we add one to the normal accessibility level of the type to ensure
15364 -- that current instances are treated as always being deeper than
15365 -- than the level of any visible named access type (see 3.10.2(21)).
15367 if Is_Type (E) then
15368 return Type_Access_Level (E) + 1;
15370 elsif Present (Renamed_Object (E)) then
15371 return Object_Access_Level (Renamed_Object (E));
15373 -- Similarly, if E is a component of the current instance of a
15374 -- protected type, any instance of it is assumed to be at a deeper
15375 -- level than the type. For a protected object (whose type is an
15376 -- anonymous protected type) its components are at the same level
15377 -- as the type itself.
15379 elsif not Is_Overloadable (E)
15380 and then Ekind (Scope (E)) = E_Protected_Type
15381 and then Comes_From_Source (Scope (E))
15383 return Type_Access_Level (Scope (E)) + 1;
15386 -- Aliased formals take their access level from the point of call.
15387 -- This is smaller than the level of the subprogram itself.
15389 if Is_Formal (E) and then Is_Aliased (E) then
15390 return Type_Access_Level (Etype (E));
15393 return Scope_Depth (Enclosing_Dynamic_Scope (E));
15397 elsif Nkind (Obj) = N_Selected_Component then
15398 if Is_Access_Type (Etype (Prefix (Obj))) then
15399 return Type_Access_Level (Etype (Prefix (Obj)));
15401 return Object_Access_Level (Prefix (Obj));
15404 elsif Nkind (Obj) = N_Indexed_Component then
15405 if Is_Access_Type (Etype (Prefix (Obj))) then
15406 return Type_Access_Level (Etype (Prefix (Obj)));
15408 return Object_Access_Level (Prefix (Obj));
15411 elsif Nkind (Obj) = N_Explicit_Dereference then
15413 -- If the prefix is a selected access discriminant then we make a
15414 -- recursive call on the prefix, which will in turn check the level
15415 -- of the prefix object of the selected discriminant.
15417 -- In Ada 2012, if the discriminant has implicit dereference and
15418 -- the context is a selected component, treat this as an object of
15419 -- unknown scope (see below). This is necessary in compile-only mode;
15420 -- otherwise expansion will already have transformed the prefix into
15423 if Nkind (Prefix (Obj)) = N_Selected_Component
15424 and then Ekind (Etype (Prefix (Obj))) = E_Anonymous_Access_Type
15426 Ekind (Entity (Selector_Name (Prefix (Obj)))) = E_Discriminant
15428 (not Has_Implicit_Dereference
15429 (Entity (Selector_Name (Prefix (Obj))))
15430 or else Nkind (Parent (Obj)) /= N_Selected_Component)
15432 return Object_Access_Level (Prefix (Obj));
15434 -- Detect an interface conversion in the context of a dispatching
15435 -- call. Use the original form of the conversion to find the access
15436 -- level of the operand.
15438 elsif Is_Interface (Etype (Obj))
15439 and then Is_Interface_Conversion (Prefix (Obj))
15440 and then Nkind (Original_Node (Obj)) = N_Type_Conversion
15442 return Object_Access_Level (Original_Node (Obj));
15444 elsif not Comes_From_Source (Obj) then
15446 Ref : constant Node_Id := Reference_To (Obj);
15448 if Present (Ref) then
15449 return Object_Access_Level (Ref);
15451 return Type_Access_Level (Etype (Prefix (Obj)));
15456 return Type_Access_Level (Etype (Prefix (Obj)));
15459 elsif Nkind_In (Obj, N_Type_Conversion, N_Unchecked_Type_Conversion) then
15460 return Object_Access_Level (Expression (Obj));
15462 elsif Nkind (Obj) = N_Function_Call then
15464 -- Function results are objects, so we get either the access level of
15465 -- the function or, in the case of an indirect call, the level of the
15466 -- access-to-subprogram type. (This code is used for Ada 95, but it
15467 -- looks wrong, because it seems that we should be checking the level
15468 -- of the call itself, even for Ada 95. However, using the Ada 2005
15469 -- version of the code causes regressions in several tests that are
15470 -- compiled with -gnat95. ???)
15472 if Ada_Version < Ada_2005 then
15473 if Is_Entity_Name (Name (Obj)) then
15474 return Subprogram_Access_Level (Entity (Name (Obj)));
15476 return Type_Access_Level (Etype (Prefix (Name (Obj))));
15479 -- For Ada 2005, the level of the result object of a function call is
15480 -- defined to be the level of the call's innermost enclosing master.
15481 -- We determine that by querying the depth of the innermost enclosing
15485 Return_Master_Scope_Depth_Of_Call : declare
15487 function Innermost_Master_Scope_Depth
15488 (N : Node_Id) return Uint;
15489 -- Returns the scope depth of the given node's innermost
15490 -- enclosing dynamic scope (effectively the accessibility
15491 -- level of the innermost enclosing master).
15493 ----------------------------------
15494 -- Innermost_Master_Scope_Depth --
15495 ----------------------------------
15497 function Innermost_Master_Scope_Depth
15498 (N : Node_Id) return Uint
15500 Node_Par : Node_Id := Parent (N);
15503 -- Locate the nearest enclosing node (by traversing Parents)
15504 -- that Defining_Entity can be applied to, and return the
15505 -- depth of that entity's nearest enclosing dynamic scope.
15507 while Present (Node_Par) loop
15508 case Nkind (Node_Par) is
15509 when N_Component_Declaration |
15510 N_Entry_Declaration |
15511 N_Formal_Object_Declaration |
15512 N_Formal_Type_Declaration |
15513 N_Full_Type_Declaration |
15514 N_Incomplete_Type_Declaration |
15515 N_Loop_Parameter_Specification |
15516 N_Object_Declaration |
15517 N_Protected_Type_Declaration |
15518 N_Private_Extension_Declaration |
15519 N_Private_Type_Declaration |
15520 N_Subtype_Declaration |
15521 N_Function_Specification |
15522 N_Procedure_Specification |
15523 N_Task_Type_Declaration |
15525 N_Generic_Instantiation |
15527 N_Implicit_Label_Declaration |
15528 N_Package_Declaration |
15529 N_Single_Task_Declaration |
15530 N_Subprogram_Declaration |
15531 N_Generic_Declaration |
15532 N_Renaming_Declaration |
15533 N_Block_Statement |
15534 N_Formal_Subprogram_Declaration |
15535 N_Abstract_Subprogram_Declaration |
15537 N_Exception_Declaration |
15538 N_Formal_Package_Declaration |
15539 N_Number_Declaration |
15540 N_Package_Specification |
15541 N_Parameter_Specification |
15542 N_Single_Protected_Declaration |
15546 (Nearest_Dynamic_Scope
15547 (Defining_Entity (Node_Par)));
15553 Node_Par := Parent (Node_Par);
15556 pragma Assert (False);
15558 -- Should never reach the following return
15560 return Scope_Depth (Current_Scope) + 1;
15561 end Innermost_Master_Scope_Depth;
15563 -- Start of processing for Return_Master_Scope_Depth_Of_Call
15566 return Innermost_Master_Scope_Depth (Obj);
15567 end Return_Master_Scope_Depth_Of_Call;
15570 -- For convenience we handle qualified expressions, even though they
15571 -- aren't technically object names.
15573 elsif Nkind (Obj) = N_Qualified_Expression then
15574 return Object_Access_Level (Expression (Obj));
15576 -- Ditto for aggregates. They have the level of the temporary that
15577 -- will hold their value.
15579 elsif Nkind (Obj) = N_Aggregate then
15580 return Object_Access_Level (Current_Scope);
15582 -- Otherwise return the scope level of Standard. (If there are cases
15583 -- that fall through to this point they will be treated as having
15584 -- global accessibility for now. ???)
15587 return Scope_Depth (Standard_Standard);
15589 end Object_Access_Level;
15591 --------------------------
15592 -- Original_Aspect_Name --
15593 --------------------------
15595 function Original_Aspect_Name (N : Node_Id) return Name_Id is
15600 pragma Assert (Nkind_In (N, N_Aspect_Specification, N_Pragma));
15603 if Is_Rewrite_Substitution (Pras)
15604 and then Nkind (Original_Node (Pras)) = N_Pragma
15606 Pras := Original_Node (Pras);
15609 -- Case where we came from aspect specication
15611 if Nkind (Pras) = N_Pragma and then From_Aspect_Specification (Pras) then
15612 Pras := Corresponding_Aspect (Pras);
15615 -- Get name from aspect or pragma
15617 if Nkind (Pras) = N_Pragma then
15618 Name := Pragma_Name (Pras);
15620 Name := Chars (Identifier (Pras));
15623 -- Deal with 'Class
15625 if Class_Present (Pras) then
15628 -- Names that need converting to special _xxx form
15636 Name := Name_uPost;
15638 when Name_Invariant =>
15639 Name := Name_uInvariant;
15641 when Name_Type_Invariant |
15642 Name_Type_Invariant_Class =>
15643 Name := Name_uType_Invariant;
15645 -- Nothing to do for other cases (e.g. a Check that derived
15646 -- from Pre_Class and has the flag set). Also we do nothing
15647 -- if the name is already in special _xxx form.
15655 end Original_Aspect_Name;
15657 --------------------------------------
15658 -- Original_Corresponding_Operation --
15659 --------------------------------------
15661 function Original_Corresponding_Operation (S : Entity_Id) return Entity_Id
15663 Typ : constant Entity_Id := Find_Dispatching_Type (S);
15666 -- If S is an inherited primitive S2 the original corresponding
15667 -- operation of S is the original corresponding operation of S2
15669 if Present (Alias (S))
15670 and then Find_Dispatching_Type (Alias (S)) /= Typ
15672 return Original_Corresponding_Operation (Alias (S));
15674 -- If S overrides an inherited subprogram S2 the original corresponding
15675 -- operation of S is the original corresponding operation of S2
15677 elsif Present (Overridden_Operation (S)) then
15678 return Original_Corresponding_Operation (Overridden_Operation (S));
15680 -- otherwise it is S itself
15685 end Original_Corresponding_Operation;
15687 ----------------------
15688 -- Policy_In_Effect --
15689 ----------------------
15691 function Policy_In_Effect (Policy : Name_Id) return Name_Id is
15692 function Policy_In_List (List : Node_Id) return Name_Id;
15693 -- Determine the the mode of a policy in a N_Pragma list
15695 --------------------
15696 -- Policy_In_List --
15697 --------------------
15699 function Policy_In_List (List : Node_Id) return Name_Id is
15706 while Present (Prag) loop
15707 Arg := First (Pragma_Argument_Associations (Prag));
15708 Expr := Get_Pragma_Arg (Arg);
15710 -- The current Check_Policy pragma matches the requested policy,
15711 -- return the second argument which denotes the policy identifier.
15713 if Chars (Expr) = Policy then
15714 return Chars (Get_Pragma_Arg (Next (Arg)));
15717 Prag := Next_Pragma (Prag);
15721 end Policy_In_List;
15727 -- Start of processing for Policy_In_Effect
15730 if not Is_Valid_Assertion_Kind (Policy) then
15731 raise Program_Error;
15734 -- Inspect all policy pragmas that appear within scopes (if any)
15736 Kind := Policy_In_List (Check_Policy_List);
15738 -- Inspect all configuration policy pragmas (if any)
15740 if Kind = No_Name then
15741 Kind := Policy_In_List (Check_Policy_List_Config);
15744 -- The context lacks policy pragmas, determine the mode based on whether
15745 -- assertions are enabled at the configuration level. This ensures that
15746 -- the policy is preserved when analyzing generics.
15748 if Kind = No_Name then
15749 if Assertions_Enabled_Config then
15750 Kind := Name_Check;
15752 Kind := Name_Ignore;
15757 end Policy_In_Effect;
15759 ----------------------------------
15760 -- Predicate_Tests_On_Arguments --
15761 ----------------------------------
15763 function Predicate_Tests_On_Arguments (Subp : Entity_Id) return Boolean is
15765 -- Always test predicates on indirect call
15767 if Ekind (Subp) = E_Subprogram_Type then
15770 -- Do not test predicates on call to generated default Finalize, since
15771 -- we are not interested in whether something we are finalizing (and
15772 -- typically destroying) satisfies its predicates.
15774 elsif Chars (Subp) = Name_Finalize
15775 and then not Comes_From_Source (Subp)
15779 -- Do not test predicates on any internally generated routines
15781 elsif Is_Internal_Name (Chars (Subp)) then
15784 -- Do not test predicates on call to Init_Proc, since if needed the
15785 -- predicate test will occur at some other point.
15787 elsif Is_Init_Proc (Subp) then
15790 -- Do not test predicates on call to predicate function, since this
15791 -- would cause infinite recursion.
15793 elsif Ekind (Subp) = E_Function
15794 and then (Is_Predicate_Function (Subp)
15796 Is_Predicate_Function_M (Subp))
15800 -- For now, no other exceptions
15805 end Predicate_Tests_On_Arguments;
15807 -----------------------
15808 -- Private_Component --
15809 -----------------------
15811 function Private_Component (Type_Id : Entity_Id) return Entity_Id is
15812 Ancestor : constant Entity_Id := Base_Type (Type_Id);
15814 function Trace_Components
15816 Check : Boolean) return Entity_Id;
15817 -- Recursive function that does the work, and checks against circular
15818 -- definition for each subcomponent type.
15820 ----------------------
15821 -- Trace_Components --
15822 ----------------------
15824 function Trace_Components
15826 Check : Boolean) return Entity_Id
15828 Btype : constant Entity_Id := Base_Type (T);
15829 Component : Entity_Id;
15831 Candidate : Entity_Id := Empty;
15834 if Check and then Btype = Ancestor then
15835 Error_Msg_N ("circular type definition", Type_Id);
15839 if Is_Private_Type (Btype) and then not Is_Generic_Type (Btype) then
15840 if Present (Full_View (Btype))
15841 and then Is_Record_Type (Full_View (Btype))
15842 and then not Is_Frozen (Btype)
15844 -- To indicate that the ancestor depends on a private type, the
15845 -- current Btype is sufficient. However, to check for circular
15846 -- definition we must recurse on the full view.
15848 Candidate := Trace_Components (Full_View (Btype), True);
15850 if Candidate = Any_Type then
15860 elsif Is_Array_Type (Btype) then
15861 return Trace_Components (Component_Type (Btype), True);
15863 elsif Is_Record_Type (Btype) then
15864 Component := First_Entity (Btype);
15865 while Present (Component)
15866 and then Comes_From_Source (Component)
15868 -- Skip anonymous types generated by constrained components
15870 if not Is_Type (Component) then
15871 P := Trace_Components (Etype (Component), True);
15873 if Present (P) then
15874 if P = Any_Type then
15882 Next_Entity (Component);
15890 end Trace_Components;
15892 -- Start of processing for Private_Component
15895 return Trace_Components (Type_Id, False);
15896 end Private_Component;
15898 ---------------------------
15899 -- Primitive_Names_Match --
15900 ---------------------------
15902 function Primitive_Names_Match (E1, E2 : Entity_Id) return Boolean is
15904 function Non_Internal_Name (E : Entity_Id) return Name_Id;
15905 -- Given an internal name, returns the corresponding non-internal name
15907 ------------------------
15908 -- Non_Internal_Name --
15909 ------------------------
15911 function Non_Internal_Name (E : Entity_Id) return Name_Id is
15913 Get_Name_String (Chars (E));
15914 Name_Len := Name_Len - 1;
15916 end Non_Internal_Name;
15918 -- Start of processing for Primitive_Names_Match
15921 pragma Assert (Present (E1) and then Present (E2));
15923 return Chars (E1) = Chars (E2)
15925 (not Is_Internal_Name (Chars (E1))
15926 and then Is_Internal_Name (Chars (E2))
15927 and then Non_Internal_Name (E2) = Chars (E1))
15929 (not Is_Internal_Name (Chars (E2))
15930 and then Is_Internal_Name (Chars (E1))
15931 and then Non_Internal_Name (E1) = Chars (E2))
15933 (Is_Predefined_Dispatching_Operation (E1)
15934 and then Is_Predefined_Dispatching_Operation (E2)
15935 and then Same_TSS (E1, E2))
15937 (Is_Init_Proc (E1) and then Is_Init_Proc (E2));
15938 end Primitive_Names_Match;
15940 -----------------------
15941 -- Process_End_Label --
15942 -----------------------
15944 procedure Process_End_Label
15953 Label_Ref : Boolean;
15954 -- Set True if reference to end label itself is required
15957 -- Gets set to the operator symbol or identifier that references the
15958 -- entity Ent. For the child unit case, this is the identifier from the
15959 -- designator. For other cases, this is simply Endl.
15961 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id);
15962 -- N is an identifier node that appears as a parent unit reference in
15963 -- the case where Ent is a child unit. This procedure generates an
15964 -- appropriate cross-reference entry. E is the corresponding entity.
15966 -------------------------
15967 -- Generate_Parent_Ref --
15968 -------------------------
15970 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id) is
15972 -- If names do not match, something weird, skip reference
15974 if Chars (E) = Chars (N) then
15976 -- Generate the reference. We do NOT consider this as a reference
15977 -- for unreferenced symbol purposes.
15979 Generate_Reference (E, N, 'r', Set_Ref => False, Force => True);
15981 if Style_Check then
15982 Style.Check_Identifier (N, E);
15985 end Generate_Parent_Ref;
15987 -- Start of processing for Process_End_Label
15990 -- If no node, ignore. This happens in some error situations, and
15991 -- also for some internally generated structures where no end label
15992 -- references are required in any case.
15998 -- Nothing to do if no End_Label, happens for internally generated
15999 -- constructs where we don't want an end label reference anyway. Also
16000 -- nothing to do if Endl is a string literal, which means there was
16001 -- some prior error (bad operator symbol)
16003 Endl := End_Label (N);
16005 if No (Endl) or else Nkind (Endl) = N_String_Literal then
16009 -- Reference node is not in extended main source unit
16011 if not In_Extended_Main_Source_Unit (N) then
16013 -- Generally we do not collect references except for the extended
16014 -- main source unit. The one exception is the 'e' entry for a
16015 -- package spec, where it is useful for a client to have the
16016 -- ending information to define scopes.
16022 Label_Ref := False;
16024 -- For this case, we can ignore any parent references, but we
16025 -- need the package name itself for the 'e' entry.
16027 if Nkind (Endl) = N_Designator then
16028 Endl := Identifier (Endl);
16032 -- Reference is in extended main source unit
16037 -- For designator, generate references for the parent entries
16039 if Nkind (Endl) = N_Designator then
16041 -- Generate references for the prefix if the END line comes from
16042 -- source (otherwise we do not need these references) We climb the
16043 -- scope stack to find the expected entities.
16045 if Comes_From_Source (Endl) then
16046 Nam := Name (Endl);
16047 Scop := Current_Scope;
16048 while Nkind (Nam) = N_Selected_Component loop
16049 Scop := Scope (Scop);
16050 exit when No (Scop);
16051 Generate_Parent_Ref (Selector_Name (Nam), Scop);
16052 Nam := Prefix (Nam);
16055 if Present (Scop) then
16056 Generate_Parent_Ref (Nam, Scope (Scop));
16060 Endl := Identifier (Endl);
16064 -- If the end label is not for the given entity, then either we have
16065 -- some previous error, or this is a generic instantiation for which
16066 -- we do not need to make a cross-reference in this case anyway. In
16067 -- either case we simply ignore the call.
16069 if Chars (Ent) /= Chars (Endl) then
16073 -- If label was really there, then generate a normal reference and then
16074 -- adjust the location in the end label to point past the name (which
16075 -- should almost always be the semicolon).
16077 Loc := Sloc (Endl);
16079 if Comes_From_Source (Endl) then
16081 -- If a label reference is required, then do the style check and
16082 -- generate an l-type cross-reference entry for the label
16085 if Style_Check then
16086 Style.Check_Identifier (Endl, Ent);
16089 Generate_Reference (Ent, Endl, 'l', Set_Ref => False);
16092 -- Set the location to point past the label (normally this will
16093 -- mean the semicolon immediately following the label). This is
16094 -- done for the sake of the 'e' or 't' entry generated below.
16096 Get_Decoded_Name_String (Chars (Endl));
16097 Set_Sloc (Endl, Sloc (Endl) + Source_Ptr (Name_Len));
16100 -- In SPARK mode, no missing label is allowed for packages and
16101 -- subprogram bodies. Detect those cases by testing whether
16102 -- Process_End_Label was called for a body (Typ = 't') or a package.
16104 if Restriction_Check_Required (SPARK_05)
16105 and then (Typ = 't' or else Ekind (Ent) = E_Package)
16107 Error_Msg_Node_1 := Endl;
16108 Check_SPARK_05_Restriction
16109 ("`END &` required", Endl, Force => True);
16113 -- Now generate the e/t reference
16115 Generate_Reference (Ent, Endl, Typ, Set_Ref => False, Force => True);
16117 -- Restore Sloc, in case modified above, since we have an identifier
16118 -- and the normal Sloc should be left set in the tree.
16120 Set_Sloc (Endl, Loc);
16121 end Process_End_Label;
16127 function Referenced (Id : Entity_Id; Expr : Node_Id) return Boolean is
16128 Seen : Boolean := False;
16130 function Is_Reference (N : Node_Id) return Traverse_Result;
16131 -- Determine whether node N denotes a reference to Id. If this is the
16132 -- case, set global flag Seen to True and stop the traversal.
16138 function Is_Reference (N : Node_Id) return Traverse_Result is
16140 if Is_Entity_Name (N)
16141 and then Present (Entity (N))
16142 and then Entity (N) = Id
16151 procedure Inspect_Expression is new Traverse_Proc (Is_Reference);
16153 -- Start of processing for Referenced
16156 Inspect_Expression (Expr);
16160 ------------------------------------
16161 -- References_Generic_Formal_Type --
16162 ------------------------------------
16164 function References_Generic_Formal_Type (N : Node_Id) return Boolean is
16166 function Process (N : Node_Id) return Traverse_Result;
16167 -- Process one node in search for generic formal type
16173 function Process (N : Node_Id) return Traverse_Result is
16175 if Nkind (N) in N_Has_Entity then
16177 E : constant Entity_Id := Entity (N);
16179 if Present (E) then
16180 if Is_Generic_Type (E) then
16182 elsif Present (Etype (E))
16183 and then Is_Generic_Type (Etype (E))
16194 function Traverse is new Traverse_Func (Process);
16195 -- Traverse tree to look for generic type
16198 if Inside_A_Generic then
16199 return Traverse (N) = Abandon;
16203 end References_Generic_Formal_Type;
16205 --------------------
16206 -- Remove_Homonym --
16207 --------------------
16209 procedure Remove_Homonym (E : Entity_Id) is
16210 Prev : Entity_Id := Empty;
16214 if E = Current_Entity (E) then
16215 if Present (Homonym (E)) then
16216 Set_Current_Entity (Homonym (E));
16218 Set_Name_Entity_Id (Chars (E), Empty);
16222 H := Current_Entity (E);
16223 while Present (H) and then H /= E loop
16228 -- If E is not on the homonym chain, nothing to do
16230 if Present (H) then
16231 Set_Homonym (Prev, Homonym (E));
16234 end Remove_Homonym;
16236 ---------------------
16237 -- Rep_To_Pos_Flag --
16238 ---------------------
16240 function Rep_To_Pos_Flag (E : Entity_Id; Loc : Source_Ptr) return Node_Id is
16242 return New_Occurrence_Of
16243 (Boolean_Literals (not Range_Checks_Suppressed (E)), Loc);
16244 end Rep_To_Pos_Flag;
16246 --------------------
16247 -- Require_Entity --
16248 --------------------
16250 procedure Require_Entity (N : Node_Id) is
16252 if Is_Entity_Name (N) and then No (Entity (N)) then
16253 if Total_Errors_Detected /= 0 then
16254 Set_Entity (N, Any_Id);
16256 raise Program_Error;
16259 end Require_Entity;
16261 -------------------------------
16262 -- Requires_State_Refinement --
16263 -------------------------------
16265 function Requires_State_Refinement
16266 (Spec_Id : Entity_Id;
16267 Body_Id : Entity_Id) return Boolean
16269 function Mode_Is_Off (Prag : Node_Id) return Boolean;
16270 -- Given pragma SPARK_Mode, determine whether the mode is Off
16276 function Mode_Is_Off (Prag : Node_Id) return Boolean is
16280 -- The default SPARK mode is On
16286 Mode := Get_Pragma_Arg (First (Pragma_Argument_Associations (Prag)));
16288 -- Then the pragma lacks an argument, the default mode is On
16293 return Chars (Mode) = Name_Off;
16297 -- Start of processing for Requires_State_Refinement
16300 -- A package that does not define at least one abstract state cannot
16301 -- possibly require refinement.
16303 if No (Abstract_States (Spec_Id)) then
16306 -- The package instroduces a single null state which does not merit
16309 elsif Has_Null_Abstract_State (Spec_Id) then
16312 -- Check whether the package body is subject to pragma SPARK_Mode. If
16313 -- it is and the mode is Off, the package body is considered to be in
16314 -- regular Ada and does not require refinement.
16316 elsif Mode_Is_Off (SPARK_Pragma (Body_Id)) then
16319 -- The body's SPARK_Mode may be inherited from a similar pragma that
16320 -- appears in the private declarations of the spec. The pragma we are
16321 -- interested appears as the second entry in SPARK_Pragma.
16323 elsif Present (SPARK_Pragma (Spec_Id))
16324 and then Mode_Is_Off (Next_Pragma (SPARK_Pragma (Spec_Id)))
16328 -- The spec defines at least one abstract state and the body has no way
16329 -- of circumventing the refinement.
16334 end Requires_State_Refinement;
16336 ------------------------------
16337 -- Requires_Transient_Scope --
16338 ------------------------------
16340 -- A transient scope is required when variable-sized temporaries are
16341 -- allocated in the primary or secondary stack, or when finalization
16342 -- actions must be generated before the next instruction.
16344 function Requires_Transient_Scope (Id : Entity_Id) return Boolean is
16345 Typ : constant Entity_Id := Underlying_Type (Id);
16347 -- Start of processing for Requires_Transient_Scope
16350 -- This is a private type which is not completed yet. This can only
16351 -- happen in a default expression (of a formal parameter or of a
16352 -- record component). Do not expand transient scope in this case
16357 -- Do not expand transient scope for non-existent procedure return
16359 elsif Typ = Standard_Void_Type then
16362 -- Elementary types do not require a transient scope
16364 elsif Is_Elementary_Type (Typ) then
16367 -- Generally, indefinite subtypes require a transient scope, since the
16368 -- back end cannot generate temporaries, since this is not a valid type
16369 -- for declaring an object. It might be possible to relax this in the
16370 -- future, e.g. by declaring the maximum possible space for the type.
16372 elsif Is_Indefinite_Subtype (Typ) then
16375 -- Functions returning tagged types may dispatch on result so their
16376 -- returned value is allocated on the secondary stack. Controlled
16377 -- type temporaries need finalization.
16379 elsif Is_Tagged_Type (Typ)
16380 or else Has_Controlled_Component (Typ)
16382 return not Is_Value_Type (Typ);
16386 elsif Is_Record_Type (Typ) then
16390 Comp := First_Entity (Typ);
16391 while Present (Comp) loop
16392 if Ekind (Comp) = E_Component
16393 and then Requires_Transient_Scope (Etype (Comp))
16397 Next_Entity (Comp);
16404 -- String literal types never require transient scope
16406 elsif Ekind (Typ) = E_String_Literal_Subtype then
16409 -- Array type. Note that we already know that this is a constrained
16410 -- array, since unconstrained arrays will fail the indefinite test.
16412 elsif Is_Array_Type (Typ) then
16414 -- If component type requires a transient scope, the array does too
16416 if Requires_Transient_Scope (Component_Type (Typ)) then
16419 -- Otherwise, we only need a transient scope if the size depends on
16420 -- the value of one or more discriminants.
16423 return Size_Depends_On_Discriminant (Typ);
16426 -- All other cases do not require a transient scope
16431 end Requires_Transient_Scope;
16433 --------------------------
16434 -- Reset_Analyzed_Flags --
16435 --------------------------
16437 procedure Reset_Analyzed_Flags (N : Node_Id) is
16439 function Clear_Analyzed (N : Node_Id) return Traverse_Result;
16440 -- Function used to reset Analyzed flags in tree. Note that we do
16441 -- not reset Analyzed flags in entities, since there is no need to
16442 -- reanalyze entities, and indeed, it is wrong to do so, since it
16443 -- can result in generating auxiliary stuff more than once.
16445 --------------------
16446 -- Clear_Analyzed --
16447 --------------------
16449 function Clear_Analyzed (N : Node_Id) return Traverse_Result is
16451 if not Has_Extension (N) then
16452 Set_Analyzed (N, False);
16456 end Clear_Analyzed;
16458 procedure Reset_Analyzed is new Traverse_Proc (Clear_Analyzed);
16460 -- Start of processing for Reset_Analyzed_Flags
16463 Reset_Analyzed (N);
16464 end Reset_Analyzed_Flags;
16466 ------------------------
16467 -- Restore_SPARK_Mode --
16468 ------------------------
16470 procedure Restore_SPARK_Mode (Mode : SPARK_Mode_Type) is
16472 SPARK_Mode := Mode;
16473 end Restore_SPARK_Mode;
16475 --------------------------------
16476 -- Returns_Unconstrained_Type --
16477 --------------------------------
16479 function Returns_Unconstrained_Type (Subp : Entity_Id) return Boolean is
16481 return Ekind (Subp) = E_Function
16482 and then not Is_Scalar_Type (Etype (Subp))
16483 and then not Is_Access_Type (Etype (Subp))
16484 and then not Is_Constrained (Etype (Subp));
16485 end Returns_Unconstrained_Type;
16487 ----------------------------
16488 -- Root_Type_Of_Full_View --
16489 ----------------------------
16491 function Root_Type_Of_Full_View (T : Entity_Id) return Entity_Id is
16492 Rtyp : constant Entity_Id := Root_Type (T);
16495 -- The root type of the full view may itself be a private type. Keep
16496 -- looking for the ultimate derivation parent.
16498 if Is_Private_Type (Rtyp) and then Present (Full_View (Rtyp)) then
16499 return Root_Type_Of_Full_View (Full_View (Rtyp));
16503 end Root_Type_Of_Full_View;
16505 ---------------------------
16506 -- Safe_To_Capture_Value --
16507 ---------------------------
16509 function Safe_To_Capture_Value
16512 Cond : Boolean := False) return Boolean
16515 -- The only entities for which we track constant values are variables
16516 -- which are not renamings, constants, out parameters, and in out
16517 -- parameters, so check if we have this case.
16519 -- Note: it may seem odd to track constant values for constants, but in
16520 -- fact this routine is used for other purposes than simply capturing
16521 -- the value. In particular, the setting of Known[_Non]_Null.
16523 if (Ekind (Ent) = E_Variable and then No (Renamed_Object (Ent)))
16525 Ekind_In (Ent, E_Constant, E_Out_Parameter, E_In_Out_Parameter)
16529 -- For conditionals, we also allow loop parameters and all formals,
16530 -- including in parameters.
16532 elsif Cond and then Ekind_In (Ent, E_Loop_Parameter, E_In_Parameter) then
16535 -- For all other cases, not just unsafe, but impossible to capture
16536 -- Current_Value, since the above are the only entities which have
16537 -- Current_Value fields.
16543 -- Skip if volatile or aliased, since funny things might be going on in
16544 -- these cases which we cannot necessarily track. Also skip any variable
16545 -- for which an address clause is given, or whose address is taken. Also
16546 -- never capture value of library level variables (an attempt to do so
16547 -- can occur in the case of package elaboration code).
16549 if Treat_As_Volatile (Ent)
16550 or else Is_Aliased (Ent)
16551 or else Present (Address_Clause (Ent))
16552 or else Address_Taken (Ent)
16553 or else (Is_Library_Level_Entity (Ent)
16554 and then Ekind (Ent) = E_Variable)
16559 -- OK, all above conditions are met. We also require that the scope of
16560 -- the reference be the same as the scope of the entity, not counting
16561 -- packages and blocks and loops.
16564 E_Scope : constant Entity_Id := Scope (Ent);
16565 R_Scope : Entity_Id;
16568 R_Scope := Current_Scope;
16569 while R_Scope /= Standard_Standard loop
16570 exit when R_Scope = E_Scope;
16572 if not Ekind_In (R_Scope, E_Package, E_Block, E_Loop) then
16575 R_Scope := Scope (R_Scope);
16580 -- We also require that the reference does not appear in a context
16581 -- where it is not sure to be executed (i.e. a conditional context
16582 -- or an exception handler). We skip this if Cond is True, since the
16583 -- capturing of values from conditional tests handles this ok.
16596 -- Seems dubious that case expressions are not handled here ???
16599 while Present (P) loop
16600 if Nkind (P) = N_If_Statement
16601 or else Nkind (P) = N_Case_Statement
16602 or else (Nkind (P) in N_Short_Circuit
16603 and then Desc = Right_Opnd (P))
16604 or else (Nkind (P) = N_If_Expression
16605 and then Desc /= First (Expressions (P)))
16606 or else Nkind (P) = N_Exception_Handler
16607 or else Nkind (P) = N_Selective_Accept
16608 or else Nkind (P) = N_Conditional_Entry_Call
16609 or else Nkind (P) = N_Timed_Entry_Call
16610 or else Nkind (P) = N_Asynchronous_Select
16618 -- A special Ada 2012 case: the original node may be part
16619 -- of the else_actions of a conditional expression, in which
16620 -- case it might not have been expanded yet, and appears in
16621 -- a non-syntactic list of actions. In that case it is clearly
16622 -- not safe to save a value.
16625 and then Is_List_Member (Desc)
16626 and then No (Parent (List_Containing (Desc)))
16634 -- OK, looks safe to set value
16637 end Safe_To_Capture_Value;
16643 function Same_Name (N1, N2 : Node_Id) return Boolean is
16644 K1 : constant Node_Kind := Nkind (N1);
16645 K2 : constant Node_Kind := Nkind (N2);
16648 if (K1 = N_Identifier or else K1 = N_Defining_Identifier)
16649 and then (K2 = N_Identifier or else K2 = N_Defining_Identifier)
16651 return Chars (N1) = Chars (N2);
16653 elsif (K1 = N_Selected_Component or else K1 = N_Expanded_Name)
16654 and then (K2 = N_Selected_Component or else K2 = N_Expanded_Name)
16656 return Same_Name (Selector_Name (N1), Selector_Name (N2))
16657 and then Same_Name (Prefix (N1), Prefix (N2));
16668 function Same_Object (Node1, Node2 : Node_Id) return Boolean is
16669 N1 : constant Node_Id := Original_Node (Node1);
16670 N2 : constant Node_Id := Original_Node (Node2);
16671 -- We do the tests on original nodes, since we are most interested
16672 -- in the original source, not any expansion that got in the way.
16674 K1 : constant Node_Kind := Nkind (N1);
16675 K2 : constant Node_Kind := Nkind (N2);
16678 -- First case, both are entities with same entity
16680 if K1 in N_Has_Entity and then K2 in N_Has_Entity then
16682 EN1 : constant Entity_Id := Entity (N1);
16683 EN2 : constant Entity_Id := Entity (N2);
16685 if Present (EN1) and then Present (EN2)
16686 and then (Ekind_In (EN1, E_Variable, E_Constant)
16687 or else Is_Formal (EN1))
16695 -- Second case, selected component with same selector, same record
16697 if K1 = N_Selected_Component
16698 and then K2 = N_Selected_Component
16699 and then Chars (Selector_Name (N1)) = Chars (Selector_Name (N2))
16701 return Same_Object (Prefix (N1), Prefix (N2));
16703 -- Third case, indexed component with same subscripts, same array
16705 elsif K1 = N_Indexed_Component
16706 and then K2 = N_Indexed_Component
16707 and then Same_Object (Prefix (N1), Prefix (N2))
16712 E1 := First (Expressions (N1));
16713 E2 := First (Expressions (N2));
16714 while Present (E1) loop
16715 if not Same_Value (E1, E2) then
16726 -- Fourth case, slice of same array with same bounds
16729 and then K2 = N_Slice
16730 and then Nkind (Discrete_Range (N1)) = N_Range
16731 and then Nkind (Discrete_Range (N2)) = N_Range
16732 and then Same_Value (Low_Bound (Discrete_Range (N1)),
16733 Low_Bound (Discrete_Range (N2)))
16734 and then Same_Value (High_Bound (Discrete_Range (N1)),
16735 High_Bound (Discrete_Range (N2)))
16737 return Same_Name (Prefix (N1), Prefix (N2));
16739 -- All other cases, not clearly the same object
16750 function Same_Type (T1, T2 : Entity_Id) return Boolean is
16755 elsif not Is_Constrained (T1)
16756 and then not Is_Constrained (T2)
16757 and then Base_Type (T1) = Base_Type (T2)
16761 -- For now don't bother with case of identical constraints, to be
16762 -- fiddled with later on perhaps (this is only used for optimization
16763 -- purposes, so it is not critical to do a best possible job)
16774 function Same_Value (Node1, Node2 : Node_Id) return Boolean is
16776 if Compile_Time_Known_Value (Node1)
16777 and then Compile_Time_Known_Value (Node2)
16778 and then Expr_Value (Node1) = Expr_Value (Node2)
16781 elsif Same_Object (Node1, Node2) then
16788 -----------------------------
16789 -- Save_SPARK_Mode_And_Set --
16790 -----------------------------
16792 procedure Save_SPARK_Mode_And_Set
16793 (Context : Entity_Id;
16794 Mode : out SPARK_Mode_Type)
16797 -- Save the current mode in effect
16799 Mode := SPARK_Mode;
16801 -- Do not consider illegal or partially decorated constructs
16803 if Ekind (Context) = E_Void or else Error_Posted (Context) then
16806 elsif Present (SPARK_Pragma (Context)) then
16807 SPARK_Mode := Get_SPARK_Mode_From_Pragma (SPARK_Pragma (Context));
16809 end Save_SPARK_Mode_And_Set;
16811 -------------------------
16812 -- Scalar_Part_Present --
16813 -------------------------
16815 function Scalar_Part_Present (T : Entity_Id) return Boolean is
16819 if Is_Scalar_Type (T) then
16822 elsif Is_Array_Type (T) then
16823 return Scalar_Part_Present (Component_Type (T));
16825 elsif Is_Record_Type (T) or else Has_Discriminants (T) then
16826 C := First_Component_Or_Discriminant (T);
16827 while Present (C) loop
16828 if Scalar_Part_Present (Etype (C)) then
16831 Next_Component_Or_Discriminant (C);
16837 end Scalar_Part_Present;
16839 ------------------------
16840 -- Scope_Is_Transient --
16841 ------------------------
16843 function Scope_Is_Transient return Boolean is
16845 return Scope_Stack.Table (Scope_Stack.Last).Is_Transient;
16846 end Scope_Is_Transient;
16852 function Scope_Within (Scope1, Scope2 : Entity_Id) return Boolean is
16857 while Scop /= Standard_Standard loop
16858 Scop := Scope (Scop);
16860 if Scop = Scope2 then
16868 --------------------------
16869 -- Scope_Within_Or_Same --
16870 --------------------------
16872 function Scope_Within_Or_Same (Scope1, Scope2 : Entity_Id) return Boolean is
16877 while Scop /= Standard_Standard loop
16878 if Scop = Scope2 then
16881 Scop := Scope (Scop);
16886 end Scope_Within_Or_Same;
16888 --------------------
16889 -- Set_Convention --
16890 --------------------
16892 procedure Set_Convention (E : Entity_Id; Val : Snames.Convention_Id) is
16894 Basic_Set_Convention (E, Val);
16897 and then Is_Access_Subprogram_Type (Base_Type (E))
16898 and then Has_Foreign_Convention (E)
16900 Set_Can_Use_Internal_Rep (E, False);
16903 -- If E is an object or component, and the type of E is an anonymous
16904 -- access type with no convention set, then also set the convention of
16905 -- the anonymous access type. We do not do this for anonymous protected
16906 -- types, since protected types always have the default convention.
16908 if Present (Etype (E))
16909 and then (Is_Object (E)
16910 or else Ekind (E) = E_Component
16912 -- Allow E_Void (happens for pragma Convention appearing
16913 -- in the middle of a record applying to a component)
16915 or else Ekind (E) = E_Void)
16918 Typ : constant Entity_Id := Etype (E);
16921 if Ekind_In (Typ, E_Anonymous_Access_Type,
16922 E_Anonymous_Access_Subprogram_Type)
16923 and then not Has_Convention_Pragma (Typ)
16925 Basic_Set_Convention (Typ, Val);
16926 Set_Has_Convention_Pragma (Typ);
16928 -- And for the access subprogram type, deal similarly with the
16929 -- designated E_Subprogram_Type if it is also internal (which
16932 if Ekind (Typ) = E_Anonymous_Access_Subprogram_Type then
16934 Dtype : constant Entity_Id := Designated_Type (Typ);
16936 if Ekind (Dtype) = E_Subprogram_Type
16937 and then Is_Itype (Dtype)
16938 and then not Has_Convention_Pragma (Dtype)
16940 Basic_Set_Convention (Dtype, Val);
16941 Set_Has_Convention_Pragma (Dtype);
16948 end Set_Convention;
16950 ------------------------
16951 -- Set_Current_Entity --
16952 ------------------------
16954 -- The given entity is to be set as the currently visible definition of its
16955 -- associated name (i.e. the Node_Id associated with its name). All we have
16956 -- to do is to get the name from the identifier, and then set the
16957 -- associated Node_Id to point to the given entity.
16959 procedure Set_Current_Entity (E : Entity_Id) is
16961 Set_Name_Entity_Id (Chars (E), E);
16962 end Set_Current_Entity;
16964 ---------------------------
16965 -- Set_Debug_Info_Needed --
16966 ---------------------------
16968 procedure Set_Debug_Info_Needed (T : Entity_Id) is
16970 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id);
16971 pragma Inline (Set_Debug_Info_Needed_If_Not_Set);
16972 -- Used to set debug info in a related node if not set already
16974 --------------------------------------
16975 -- Set_Debug_Info_Needed_If_Not_Set --
16976 --------------------------------------
16978 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id) is
16980 if Present (E) and then not Needs_Debug_Info (E) then
16981 Set_Debug_Info_Needed (E);
16983 -- For a private type, indicate that the full view also needs
16984 -- debug information.
16987 and then Is_Private_Type (E)
16988 and then Present (Full_View (E))
16990 Set_Debug_Info_Needed (Full_View (E));
16993 end Set_Debug_Info_Needed_If_Not_Set;
16995 -- Start of processing for Set_Debug_Info_Needed
16998 -- Nothing to do if argument is Empty or has Debug_Info_Off set, which
16999 -- indicates that Debug_Info_Needed is never required for the entity.
17000 -- Nothing to do if entity comes from a predefined file. Library files
17001 -- are compiled without debug information, but inlined bodies of these
17002 -- routines may appear in user code, and debug information on them ends
17003 -- up complicating debugging the user code.
17006 or else Debug_Info_Off (T)
17010 elsif In_Inlined_Body
17011 and then Is_Predefined_File_Name
17012 (Unit_File_Name (Get_Source_Unit (Sloc (T))))
17014 Set_Needs_Debug_Info (T, False);
17017 -- Set flag in entity itself. Note that we will go through the following
17018 -- circuitry even if the flag is already set on T. That's intentional,
17019 -- it makes sure that the flag will be set in subsidiary entities.
17021 Set_Needs_Debug_Info (T);
17023 -- Set flag on subsidiary entities if not set already
17025 if Is_Object (T) then
17026 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
17028 elsif Is_Type (T) then
17029 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
17031 if Is_Record_Type (T) then
17033 Ent : Entity_Id := First_Entity (T);
17035 while Present (Ent) loop
17036 Set_Debug_Info_Needed_If_Not_Set (Ent);
17041 -- For a class wide subtype, we also need debug information
17042 -- for the equivalent type.
17044 if Ekind (T) = E_Class_Wide_Subtype then
17045 Set_Debug_Info_Needed_If_Not_Set (Equivalent_Type (T));
17048 elsif Is_Array_Type (T) then
17049 Set_Debug_Info_Needed_If_Not_Set (Component_Type (T));
17052 Indx : Node_Id := First_Index (T);
17054 while Present (Indx) loop
17055 Set_Debug_Info_Needed_If_Not_Set (Etype (Indx));
17056 Indx := Next_Index (Indx);
17060 -- For a packed array type, we also need debug information for
17061 -- the type used to represent the packed array. Conversely, we
17062 -- also need it for the former if we need it for the latter.
17064 if Is_Packed (T) then
17065 Set_Debug_Info_Needed_If_Not_Set (Packed_Array_Impl_Type (T));
17068 if Is_Packed_Array_Impl_Type (T) then
17069 Set_Debug_Info_Needed_If_Not_Set (Original_Array_Type (T));
17072 elsif Is_Access_Type (T) then
17073 Set_Debug_Info_Needed_If_Not_Set (Directly_Designated_Type (T));
17075 elsif Is_Private_Type (T) then
17076 Set_Debug_Info_Needed_If_Not_Set (Full_View (T));
17078 elsif Is_Protected_Type (T) then
17079 Set_Debug_Info_Needed_If_Not_Set (Corresponding_Record_Type (T));
17081 elsif Is_Scalar_Type (T) then
17083 -- If the subrange bounds are materialized by dedicated constant
17084 -- objects, also include them in the debug info to make sure the
17085 -- debugger can properly use them.
17087 if Present (Scalar_Range (T))
17088 and then Nkind (Scalar_Range (T)) = N_Range
17091 Low_Bnd : constant Node_Id := Type_Low_Bound (T);
17092 High_Bnd : constant Node_Id := Type_High_Bound (T);
17095 if Is_Entity_Name (Low_Bnd) then
17096 Set_Debug_Info_Needed_If_Not_Set (Entity (Low_Bnd));
17099 if Is_Entity_Name (High_Bnd) then
17100 Set_Debug_Info_Needed_If_Not_Set (Entity (High_Bnd));
17106 end Set_Debug_Info_Needed;
17108 ----------------------------
17109 -- Set_Entity_With_Checks --
17110 ----------------------------
17112 procedure Set_Entity_With_Checks (N : Node_Id; Val : Entity_Id) is
17113 Val_Actual : Entity_Id;
17115 Post_Node : Node_Id;
17118 -- Unconditionally set the entity
17120 Set_Entity (N, Val);
17122 -- The node to post on is the selector in the case of an expanded name,
17123 -- and otherwise the node itself.
17125 if Nkind (N) = N_Expanded_Name then
17126 Post_Node := Selector_Name (N);
17131 -- Check for violation of No_Fixed_IO
17133 if Restriction_Check_Required (No_Fixed_IO)
17135 ((RTU_Loaded (Ada_Text_IO)
17136 and then (Is_RTE (Val, RE_Decimal_IO)
17138 Is_RTE (Val, RE_Fixed_IO)))
17141 (RTU_Loaded (Ada_Wide_Text_IO)
17142 and then (Is_RTE (Val, RO_WT_Decimal_IO)
17144 Is_RTE (Val, RO_WT_Fixed_IO)))
17147 (RTU_Loaded (Ada_Wide_Wide_Text_IO)
17148 and then (Is_RTE (Val, RO_WW_Decimal_IO)
17150 Is_RTE (Val, RO_WW_Fixed_IO))))
17152 -- A special extra check, don't complain about a reference from within
17153 -- the Ada.Interrupts package itself!
17155 and then not In_Same_Extended_Unit (N, Val)
17157 Check_Restriction (No_Fixed_IO, Post_Node);
17160 -- Remaining checks are only done on source nodes. Note that we test
17161 -- for violation of No_Fixed_IO even on non-source nodes, because the
17162 -- cases for checking violations of this restriction are instantiations
17163 -- where the reference in the instance has Comes_From_Source False.
17165 if not Comes_From_Source (N) then
17169 -- Check for violation of No_Abort_Statements, which is triggered by
17170 -- call to Ada.Task_Identification.Abort_Task.
17172 if Restriction_Check_Required (No_Abort_Statements)
17173 and then (Is_RTE (Val, RE_Abort_Task))
17175 -- A special extra check, don't complain about a reference from within
17176 -- the Ada.Task_Identification package itself!
17178 and then not In_Same_Extended_Unit (N, Val)
17180 Check_Restriction (No_Abort_Statements, Post_Node);
17183 if Val = Standard_Long_Long_Integer then
17184 Check_Restriction (No_Long_Long_Integers, Post_Node);
17187 -- Check for violation of No_Dynamic_Attachment
17189 if Restriction_Check_Required (No_Dynamic_Attachment)
17190 and then RTU_Loaded (Ada_Interrupts)
17191 and then (Is_RTE (Val, RE_Is_Reserved) or else
17192 Is_RTE (Val, RE_Is_Attached) or else
17193 Is_RTE (Val, RE_Current_Handler) or else
17194 Is_RTE (Val, RE_Attach_Handler) or else
17195 Is_RTE (Val, RE_Exchange_Handler) or else
17196 Is_RTE (Val, RE_Detach_Handler) or else
17197 Is_RTE (Val, RE_Reference))
17199 -- A special extra check, don't complain about a reference from within
17200 -- the Ada.Interrupts package itself!
17202 and then not In_Same_Extended_Unit (N, Val)
17204 Check_Restriction (No_Dynamic_Attachment, Post_Node);
17207 -- Check for No_Implementation_Identifiers
17209 if Restriction_Check_Required (No_Implementation_Identifiers) then
17211 -- We have an implementation defined entity if it is marked as
17212 -- implementation defined, or is defined in a package marked as
17213 -- implementation defined. However, library packages themselves
17214 -- are excluded (we don't want to flag Interfaces itself, just
17215 -- the entities within it).
17217 if (Is_Implementation_Defined (Val)
17219 (Present (Scope (Val))
17220 and then Is_Implementation_Defined (Scope (Val))))
17221 and then not (Ekind_In (Val, E_Package, E_Generic_Package)
17222 and then Is_Library_Level_Entity (Val))
17224 Check_Restriction (No_Implementation_Identifiers, Post_Node);
17228 -- Do the style check
17231 and then not Suppress_Style_Checks (Val)
17232 and then not In_Instance
17234 if Nkind (N) = N_Identifier then
17236 elsif Nkind (N) = N_Expanded_Name then
17237 Nod := Selector_Name (N);
17242 -- A special situation arises for derived operations, where we want
17243 -- to do the check against the parent (since the Sloc of the derived
17244 -- operation points to the derived type declaration itself).
17247 while not Comes_From_Source (Val_Actual)
17248 and then Nkind (Val_Actual) in N_Entity
17249 and then (Ekind (Val_Actual) = E_Enumeration_Literal
17250 or else Is_Subprogram_Or_Generic_Subprogram (Val_Actual))
17251 and then Present (Alias (Val_Actual))
17253 Val_Actual := Alias (Val_Actual);
17256 -- Renaming declarations for generic actuals do not come from source,
17257 -- and have a different name from that of the entity they rename, so
17258 -- there is no style check to perform here.
17260 if Chars (Nod) = Chars (Val_Actual) then
17261 Style.Check_Identifier (Nod, Val_Actual);
17265 Set_Entity (N, Val);
17266 end Set_Entity_With_Checks;
17268 -------------------------
17269 -- Set_Is_Ghost_Entity --
17270 -------------------------
17272 procedure Set_Is_Ghost_Entity (Id : Entity_Id) is
17273 Policy : constant Name_Id := Policy_In_Effect (Name_Ghost);
17276 if Policy = Name_Check then
17277 Set_Is_Checked_Ghost_Entity (Id);
17279 elsif Policy = Name_Ignore then
17280 Set_Is_Ignored_Ghost_Entity (Id);
17282 end Set_Is_Ghost_Entity;
17284 ------------------------
17285 -- Set_Name_Entity_Id --
17286 ------------------------
17288 procedure Set_Name_Entity_Id (Id : Name_Id; Val : Entity_Id) is
17290 Set_Name_Table_Int (Id, Int (Val));
17291 end Set_Name_Entity_Id;
17293 ---------------------
17294 -- Set_Next_Actual --
17295 ---------------------
17297 procedure Set_Next_Actual (Ass1_Id : Node_Id; Ass2_Id : Node_Id) is
17299 if Nkind (Parent (Ass1_Id)) = N_Parameter_Association then
17300 Set_First_Named_Actual (Parent (Ass1_Id), Ass2_Id);
17302 end Set_Next_Actual;
17304 ----------------------------------
17305 -- Set_Optimize_Alignment_Flags --
17306 ----------------------------------
17308 procedure Set_Optimize_Alignment_Flags (E : Entity_Id) is
17310 if Optimize_Alignment = 'S' then
17311 Set_Optimize_Alignment_Space (E);
17312 elsif Optimize_Alignment = 'T' then
17313 Set_Optimize_Alignment_Time (E);
17315 end Set_Optimize_Alignment_Flags;
17317 -----------------------
17318 -- Set_Public_Status --
17319 -----------------------
17321 procedure Set_Public_Status (Id : Entity_Id) is
17322 S : constant Entity_Id := Current_Scope;
17324 function Within_HSS_Or_If (E : Entity_Id) return Boolean;
17325 -- Determines if E is defined within handled statement sequence or
17326 -- an if statement, returns True if so, False otherwise.
17328 ----------------------
17329 -- Within_HSS_Or_If --
17330 ----------------------
17332 function Within_HSS_Or_If (E : Entity_Id) return Boolean is
17335 N := Declaration_Node (E);
17342 elsif Nkind_In (N, N_Handled_Sequence_Of_Statements,
17348 end Within_HSS_Or_If;
17350 -- Start of processing for Set_Public_Status
17353 -- Everything in the scope of Standard is public
17355 if S = Standard_Standard then
17356 Set_Is_Public (Id);
17358 -- Entity is definitely not public if enclosing scope is not public
17360 elsif not Is_Public (S) then
17363 -- An object or function declaration that occurs in a handled sequence
17364 -- of statements or within an if statement is the declaration for a
17365 -- temporary object or local subprogram generated by the expander. It
17366 -- never needs to be made public and furthermore, making it public can
17367 -- cause back end problems.
17369 elsif Nkind_In (Parent (Id), N_Object_Declaration,
17370 N_Function_Specification)
17371 and then Within_HSS_Or_If (Id)
17375 -- Entities in public packages or records are public
17377 elsif Ekind (S) = E_Package or Is_Record_Type (S) then
17378 Set_Is_Public (Id);
17380 -- The bounds of an entry family declaration can generate object
17381 -- declarations that are visible to the back-end, e.g. in the
17382 -- the declaration of a composite type that contains tasks.
17384 elsif Is_Concurrent_Type (S)
17385 and then not Has_Completion (S)
17386 and then Nkind (Parent (Id)) = N_Object_Declaration
17388 Set_Is_Public (Id);
17390 end Set_Public_Status;
17392 -----------------------------
17393 -- Set_Referenced_Modified --
17394 -----------------------------
17396 procedure Set_Referenced_Modified (N : Node_Id; Out_Param : Boolean) is
17400 -- Deal with indexed or selected component where prefix is modified
17402 if Nkind_In (N, N_Indexed_Component, N_Selected_Component) then
17403 Pref := Prefix (N);
17405 -- If prefix is access type, then it is the designated object that is
17406 -- being modified, which means we have no entity to set the flag on.
17408 if No (Etype (Pref)) or else Is_Access_Type (Etype (Pref)) then
17411 -- Otherwise chase the prefix
17414 Set_Referenced_Modified (Pref, Out_Param);
17417 -- Otherwise see if we have an entity name (only other case to process)
17419 elsif Is_Entity_Name (N) and then Present (Entity (N)) then
17420 Set_Referenced_As_LHS (Entity (N), not Out_Param);
17421 Set_Referenced_As_Out_Parameter (Entity (N), Out_Param);
17423 end Set_Referenced_Modified;
17425 ----------------------------
17426 -- Set_Scope_Is_Transient --
17427 ----------------------------
17429 procedure Set_Scope_Is_Transient (V : Boolean := True) is
17431 Scope_Stack.Table (Scope_Stack.Last).Is_Transient := V;
17432 end Set_Scope_Is_Transient;
17434 -------------------
17435 -- Set_Size_Info --
17436 -------------------
17438 procedure Set_Size_Info (T1, T2 : Entity_Id) is
17440 -- We copy Esize, but not RM_Size, since in general RM_Size is
17441 -- subtype specific and does not get inherited by all subtypes.
17443 Set_Esize (T1, Esize (T2));
17444 Set_Has_Biased_Representation (T1, Has_Biased_Representation (T2));
17446 if Is_Discrete_Or_Fixed_Point_Type (T1)
17448 Is_Discrete_Or_Fixed_Point_Type (T2)
17450 Set_Is_Unsigned_Type (T1, Is_Unsigned_Type (T2));
17453 Set_Alignment (T1, Alignment (T2));
17456 --------------------
17457 -- Static_Boolean --
17458 --------------------
17460 function Static_Boolean (N : Node_Id) return Uint is
17462 Analyze_And_Resolve (N, Standard_Boolean);
17465 or else Error_Posted (N)
17466 or else Etype (N) = Any_Type
17471 if Is_OK_Static_Expression (N) then
17472 if not Raises_Constraint_Error (N) then
17473 return Expr_Value (N);
17478 elsif Etype (N) = Any_Type then
17482 Flag_Non_Static_Expr
17483 ("static boolean expression required here", N);
17486 end Static_Boolean;
17488 --------------------
17489 -- Static_Integer --
17490 --------------------
17492 function Static_Integer (N : Node_Id) return Uint is
17494 Analyze_And_Resolve (N, Any_Integer);
17497 or else Error_Posted (N)
17498 or else Etype (N) = Any_Type
17503 if Is_OK_Static_Expression (N) then
17504 if not Raises_Constraint_Error (N) then
17505 return Expr_Value (N);
17510 elsif Etype (N) = Any_Type then
17514 Flag_Non_Static_Expr
17515 ("static integer expression required here", N);
17518 end Static_Integer;
17520 --------------------------
17521 -- Statically_Different --
17522 --------------------------
17524 function Statically_Different (E1, E2 : Node_Id) return Boolean is
17525 R1 : constant Node_Id := Get_Referenced_Object (E1);
17526 R2 : constant Node_Id := Get_Referenced_Object (E2);
17528 return Is_Entity_Name (R1)
17529 and then Is_Entity_Name (R2)
17530 and then Entity (R1) /= Entity (R2)
17531 and then not Is_Formal (Entity (R1))
17532 and then not Is_Formal (Entity (R2));
17533 end Statically_Different;
17535 --------------------------------------
17536 -- Subject_To_Loop_Entry_Attributes --
17537 --------------------------------------
17539 function Subject_To_Loop_Entry_Attributes (N : Node_Id) return Boolean is
17545 -- The expansion mechanism transform a loop subject to at least one
17546 -- 'Loop_Entry attribute into a conditional block. Infinite loops lack
17547 -- the conditional part.
17549 if Nkind_In (Stmt, N_Block_Statement, N_If_Statement)
17550 and then Nkind (Original_Node (N)) = N_Loop_Statement
17552 Stmt := Original_Node (N);
17556 Nkind (Stmt) = N_Loop_Statement
17557 and then Present (Identifier (Stmt))
17558 and then Present (Entity (Identifier (Stmt)))
17559 and then Has_Loop_Entry_Attributes (Entity (Identifier (Stmt)));
17560 end Subject_To_Loop_Entry_Attributes;
17562 -----------------------------
17563 -- Subprogram_Access_Level --
17564 -----------------------------
17566 function Subprogram_Access_Level (Subp : Entity_Id) return Uint is
17568 if Present (Alias (Subp)) then
17569 return Subprogram_Access_Level (Alias (Subp));
17571 return Scope_Depth (Enclosing_Dynamic_Scope (Subp));
17573 end Subprogram_Access_Level;
17575 -------------------------------
17576 -- Support_Atomic_Primitives --
17577 -------------------------------
17579 function Support_Atomic_Primitives (Typ : Entity_Id) return Boolean is
17583 -- Verify the alignment of Typ is known
17585 if not Known_Alignment (Typ) then
17589 if Known_Static_Esize (Typ) then
17590 Size := UI_To_Int (Esize (Typ));
17592 -- If the Esize (Object_Size) is unknown at compile time, look at the
17593 -- RM_Size (Value_Size) which may have been set by an explicit rep item.
17595 elsif Known_Static_RM_Size (Typ) then
17596 Size := UI_To_Int (RM_Size (Typ));
17598 -- Otherwise, the size is considered to be unknown.
17604 -- Check that the size of the component is 8, 16, 32 or 64 bits and that
17605 -- Typ is properly aligned.
17608 when 8 | 16 | 32 | 64 =>
17609 return Size = UI_To_Int (Alignment (Typ)) * 8;
17613 end Support_Atomic_Primitives;
17619 procedure Trace_Scope (N : Node_Id; E : Entity_Id; Msg : String) is
17621 if Debug_Flag_W then
17622 for J in 0 .. Scope_Stack.Last loop
17627 Write_Name (Chars (E));
17628 Write_Str (" from ");
17629 Write_Location (Sloc (N));
17634 -----------------------
17635 -- Transfer_Entities --
17636 -----------------------
17638 procedure Transfer_Entities (From : Entity_Id; To : Entity_Id) is
17639 procedure Set_Public_Status_Of (Id : Entity_Id);
17640 -- Set the Is_Public attribute of arbitrary entity Id by calling routine
17641 -- Set_Public_Status. If successfull and Id denotes a record type, set
17642 -- the Is_Public attribute of its fields.
17644 --------------------------
17645 -- Set_Public_Status_Of --
17646 --------------------------
17648 procedure Set_Public_Status_Of (Id : Entity_Id) is
17652 if not Is_Public (Id) then
17653 Set_Public_Status (Id);
17655 -- When the input entity is a public record type, ensure that all
17656 -- its internal fields are also exposed to the linker. The fields
17657 -- of a class-wide type are never made public.
17660 and then Is_Record_Type (Id)
17661 and then not Is_Class_Wide_Type (Id)
17663 Field := First_Entity (Id);
17664 while Present (Field) loop
17665 Set_Is_Public (Field);
17666 Next_Entity (Field);
17670 end Set_Public_Status_Of;
17674 Full_Id : Entity_Id;
17677 -- Start of processing for Transfer_Entities
17680 Id := First_Entity (From);
17682 if Present (Id) then
17684 -- Merge the entity chain of the source scope with that of the
17685 -- destination scope.
17687 if Present (Last_Entity (To)) then
17688 Set_Next_Entity (Last_Entity (To), Id);
17690 Set_First_Entity (To, Id);
17693 Set_Last_Entity (To, Last_Entity (From));
17695 -- Inspect the entities of the source scope and update their Scope
17698 while Present (Id) loop
17699 Set_Scope (Id, To);
17700 Set_Public_Status_Of (Id);
17702 -- Handle an internally generated full view for a private type
17704 if Is_Private_Type (Id)
17705 and then Present (Full_View (Id))
17706 and then Is_Itype (Full_View (Id))
17708 Full_Id := Full_View (Id);
17710 Set_Scope (Full_Id, To);
17711 Set_Public_Status_Of (Full_Id);
17717 Set_First_Entity (From, Empty);
17718 Set_Last_Entity (From, Empty);
17720 end Transfer_Entities;
17722 -----------------------
17723 -- Type_Access_Level --
17724 -----------------------
17726 function Type_Access_Level (Typ : Entity_Id) return Uint is
17730 Btyp := Base_Type (Typ);
17732 -- Ada 2005 (AI-230): For most cases of anonymous access types, we
17733 -- simply use the level where the type is declared. This is true for
17734 -- stand-alone object declarations, and for anonymous access types
17735 -- associated with components the level is the same as that of the
17736 -- enclosing composite type. However, special treatment is needed for
17737 -- the cases of access parameters, return objects of an anonymous access
17738 -- type, and, in Ada 95, access discriminants of limited types.
17740 if Is_Access_Type (Btyp) then
17741 if Ekind (Btyp) = E_Anonymous_Access_Type then
17743 -- If the type is a nonlocal anonymous access type (such as for
17744 -- an access parameter) we treat it as being declared at the
17745 -- library level to ensure that names such as X.all'access don't
17746 -- fail static accessibility checks.
17748 if not Is_Local_Anonymous_Access (Typ) then
17749 return Scope_Depth (Standard_Standard);
17751 -- If this is a return object, the accessibility level is that of
17752 -- the result subtype of the enclosing function. The test here is
17753 -- little complicated, because we have to account for extended
17754 -- return statements that have been rewritten as blocks, in which
17755 -- case we have to find and the Is_Return_Object attribute of the
17756 -- itype's associated object. It would be nice to find a way to
17757 -- simplify this test, but it doesn't seem worthwhile to add a new
17758 -- flag just for purposes of this test. ???
17760 elsif Ekind (Scope (Btyp)) = E_Return_Statement
17763 and then Nkind (Associated_Node_For_Itype (Btyp)) =
17764 N_Object_Declaration
17765 and then Is_Return_Object
17766 (Defining_Identifier
17767 (Associated_Node_For_Itype (Btyp))))
17773 Scop := Scope (Scope (Btyp));
17774 while Present (Scop) loop
17775 exit when Ekind (Scop) = E_Function;
17776 Scop := Scope (Scop);
17779 -- Treat the return object's type as having the level of the
17780 -- function's result subtype (as per RM05-6.5(5.3/2)).
17782 return Type_Access_Level (Etype (Scop));
17787 Btyp := Root_Type (Btyp);
17789 -- The accessibility level of anonymous access types associated with
17790 -- discriminants is that of the current instance of the type, and
17791 -- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
17793 -- AI-402: access discriminants have accessibility based on the
17794 -- object rather than the type in Ada 2005, so the above paragraph
17797 -- ??? Needs completion with rules from AI-416
17799 if Ada_Version <= Ada_95
17800 and then Ekind (Typ) = E_Anonymous_Access_Type
17801 and then Present (Associated_Node_For_Itype (Typ))
17802 and then Nkind (Associated_Node_For_Itype (Typ)) =
17803 N_Discriminant_Specification
17805 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp)) + 1;
17809 -- Return library level for a generic formal type. This is done because
17810 -- RM(10.3.2) says that "The statically deeper relationship does not
17811 -- apply to ... a descendant of a generic formal type". Rather than
17812 -- checking at each point where a static accessibility check is
17813 -- performed to see if we are dealing with a formal type, this rule is
17814 -- implemented by having Type_Access_Level and Deepest_Type_Access_Level
17815 -- return extreme values for a formal type; Deepest_Type_Access_Level
17816 -- returns Int'Last. By calling the appropriate function from among the
17817 -- two, we ensure that the static accessibility check will pass if we
17818 -- happen to run into a formal type. More specifically, we should call
17819 -- Deepest_Type_Access_Level instead of Type_Access_Level whenever the
17820 -- call occurs as part of a static accessibility check and the error
17821 -- case is the case where the type's level is too shallow (as opposed
17824 if Is_Generic_Type (Root_Type (Btyp)) then
17825 return Scope_Depth (Standard_Standard);
17828 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
17829 end Type_Access_Level;
17831 ------------------------------------
17832 -- Type_Without_Stream_Operation --
17833 ------------------------------------
17835 function Type_Without_Stream_Operation
17837 Op : TSS_Name_Type := TSS_Null) return Entity_Id
17839 BT : constant Entity_Id := Base_Type (T);
17840 Op_Missing : Boolean;
17843 if not Restriction_Active (No_Default_Stream_Attributes) then
17847 if Is_Elementary_Type (T) then
17848 if Op = TSS_Null then
17850 No (TSS (BT, TSS_Stream_Read))
17851 or else No (TSS (BT, TSS_Stream_Write));
17854 Op_Missing := No (TSS (BT, Op));
17863 elsif Is_Array_Type (T) then
17864 return Type_Without_Stream_Operation (Component_Type (T), Op);
17866 elsif Is_Record_Type (T) then
17872 Comp := First_Component (T);
17873 while Present (Comp) loop
17874 C_Typ := Type_Without_Stream_Operation (Etype (Comp), Op);
17876 if Present (C_Typ) then
17880 Next_Component (Comp);
17886 elsif Is_Private_Type (T) and then Present (Full_View (T)) then
17887 return Type_Without_Stream_Operation (Full_View (T), Op);
17891 end Type_Without_Stream_Operation;
17893 ----------------------------
17894 -- Unique_Defining_Entity --
17895 ----------------------------
17897 function Unique_Defining_Entity (N : Node_Id) return Entity_Id is
17899 return Unique_Entity (Defining_Entity (N));
17900 end Unique_Defining_Entity;
17902 -------------------
17903 -- Unique_Entity --
17904 -------------------
17906 function Unique_Entity (E : Entity_Id) return Entity_Id is
17907 U : Entity_Id := E;
17913 if Present (Full_View (E)) then
17914 U := Full_View (E);
17918 if Present (Full_View (E)) then
17919 U := Full_View (E);
17922 when E_Package_Body =>
17925 if Nkind (P) = N_Defining_Program_Unit_Name then
17929 U := Corresponding_Spec (P);
17931 when E_Subprogram_Body =>
17934 if Nkind (P) = N_Defining_Program_Unit_Name then
17940 if Nkind (P) = N_Subprogram_Body_Stub then
17941 if Present (Library_Unit (P)) then
17943 -- Get to the function or procedure (generic) entity through
17944 -- the body entity.
17947 Unique_Entity (Defining_Entity (Get_Body_From_Stub (P)));
17950 U := Corresponding_Spec (P);
17953 when Formal_Kind =>
17954 if Present (Spec_Entity (E)) then
17955 U := Spec_Entity (E);
17969 function Unique_Name (E : Entity_Id) return String is
17971 -- Names of E_Subprogram_Body or E_Package_Body entities are not
17972 -- reliable, as they may not include the overloading suffix. Instead,
17973 -- when looking for the name of E or one of its enclosing scope, we get
17974 -- the name of the corresponding Unique_Entity.
17976 function Get_Scoped_Name (E : Entity_Id) return String;
17977 -- Return the name of E prefixed by all the names of the scopes to which
17978 -- E belongs, except for Standard.
17980 ---------------------
17981 -- Get_Scoped_Name --
17982 ---------------------
17984 function Get_Scoped_Name (E : Entity_Id) return String is
17985 Name : constant String := Get_Name_String (Chars (E));
17987 if Has_Fully_Qualified_Name (E)
17988 or else Scope (E) = Standard_Standard
17992 return Get_Scoped_Name (Unique_Entity (Scope (E))) & "__" & Name;
17994 end Get_Scoped_Name;
17996 -- Start of processing for Unique_Name
17999 if E = Standard_Standard then
18000 return Get_Name_String (Name_Standard);
18002 elsif Scope (E) = Standard_Standard
18003 and then not (Ekind (E) = E_Package or else Is_Subprogram (E))
18005 return Get_Name_String (Name_Standard) & "__" &
18006 Get_Name_String (Chars (E));
18008 elsif Ekind (E) = E_Enumeration_Literal then
18009 return Unique_Name (Etype (E)) & "__" & Get_Name_String (Chars (E));
18012 return Get_Scoped_Name (Unique_Entity (E));
18016 ---------------------
18017 -- Unit_Is_Visible --
18018 ---------------------
18020 function Unit_Is_Visible (U : Entity_Id) return Boolean is
18021 Curr : constant Node_Id := Cunit (Current_Sem_Unit);
18022 Curr_Entity : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
18024 function Unit_In_Parent_Context (Par_Unit : Node_Id) return Boolean;
18025 -- For a child unit, check whether unit appears in a with_clause
18028 function Unit_In_Context (Comp_Unit : Node_Id) return Boolean;
18029 -- Scan the context clause of one compilation unit looking for a
18030 -- with_clause for the unit in question.
18032 ----------------------------
18033 -- Unit_In_Parent_Context --
18034 ----------------------------
18036 function Unit_In_Parent_Context (Par_Unit : Node_Id) return Boolean is
18038 if Unit_In_Context (Par_Unit) then
18041 elsif Is_Child_Unit (Defining_Entity (Unit (Par_Unit))) then
18042 return Unit_In_Parent_Context (Parent_Spec (Unit (Par_Unit)));
18047 end Unit_In_Parent_Context;
18049 ---------------------
18050 -- Unit_In_Context --
18051 ---------------------
18053 function Unit_In_Context (Comp_Unit : Node_Id) return Boolean is
18057 Clause := First (Context_Items (Comp_Unit));
18058 while Present (Clause) loop
18059 if Nkind (Clause) = N_With_Clause then
18060 if Library_Unit (Clause) = U then
18063 -- The with_clause may denote a renaming of the unit we are
18064 -- looking for, eg. Text_IO which renames Ada.Text_IO.
18067 Renamed_Entity (Entity (Name (Clause))) =
18068 Defining_Entity (Unit (U))
18078 end Unit_In_Context;
18080 -- Start of processing for Unit_Is_Visible
18083 -- The currrent unit is directly visible
18088 elsif Unit_In_Context (Curr) then
18091 -- If the current unit is a body, check the context of the spec
18093 elsif Nkind (Unit (Curr)) = N_Package_Body
18095 (Nkind (Unit (Curr)) = N_Subprogram_Body
18096 and then not Acts_As_Spec (Unit (Curr)))
18098 if Unit_In_Context (Library_Unit (Curr)) then
18103 -- If the spec is a child unit, examine the parents
18105 if Is_Child_Unit (Curr_Entity) then
18106 if Nkind (Unit (Curr)) in N_Unit_Body then
18108 Unit_In_Parent_Context
18109 (Parent_Spec (Unit (Library_Unit (Curr))));
18111 return Unit_In_Parent_Context (Parent_Spec (Unit (Curr)));
18117 end Unit_Is_Visible;
18119 ------------------------------
18120 -- Universal_Interpretation --
18121 ------------------------------
18123 function Universal_Interpretation (Opnd : Node_Id) return Entity_Id is
18124 Index : Interp_Index;
18128 -- The argument may be a formal parameter of an operator or subprogram
18129 -- with multiple interpretations, or else an expression for an actual.
18131 if Nkind (Opnd) = N_Defining_Identifier
18132 or else not Is_Overloaded (Opnd)
18134 if Etype (Opnd) = Universal_Integer
18135 or else Etype (Opnd) = Universal_Real
18137 return Etype (Opnd);
18143 Get_First_Interp (Opnd, Index, It);
18144 while Present (It.Typ) loop
18145 if It.Typ = Universal_Integer
18146 or else It.Typ = Universal_Real
18151 Get_Next_Interp (Index, It);
18156 end Universal_Interpretation;
18162 function Unqualify (Expr : Node_Id) return Node_Id is
18164 -- Recurse to handle unlikely case of multiple levels of qualification
18166 if Nkind (Expr) = N_Qualified_Expression then
18167 return Unqualify (Expression (Expr));
18169 -- Normal case, not a qualified expression
18176 -----------------------
18177 -- Visible_Ancestors --
18178 -----------------------
18180 function Visible_Ancestors (Typ : Entity_Id) return Elist_Id is
18186 pragma Assert (Is_Record_Type (Typ) and then Is_Tagged_Type (Typ));
18188 -- Collect all the parents and progenitors of Typ. If the full-view of
18189 -- private parents and progenitors is available then it is used to
18190 -- generate the list of visible ancestors; otherwise their partial
18191 -- view is added to the resulting list.
18196 Use_Full_View => True);
18200 Ifaces_List => List_2,
18201 Exclude_Parents => True,
18202 Use_Full_View => True);
18204 -- Join the two lists. Avoid duplications because an interface may
18205 -- simultaneously be parent and progenitor of a type.
18207 Elmt := First_Elmt (List_2);
18208 while Present (Elmt) loop
18209 Append_Unique_Elmt (Node (Elmt), List_1);
18214 end Visible_Ancestors;
18216 ------------------------
18217 -- Within_Ghost_Scope --
18218 ------------------------
18220 function Within_Ghost_Scope
18221 (Id : Entity_Id := Current_Scope) return Boolean
18226 -- Climb the scope stack looking for a Ghost scope
18229 while Present (S) and then S /= Standard_Standard loop
18230 if Is_Ghost_Entity (S) then
18238 end Within_Ghost_Scope;
18240 ----------------------
18241 -- Within_Init_Proc --
18242 ----------------------
18244 function Within_Init_Proc return Boolean is
18248 S := Current_Scope;
18249 while not Is_Overloadable (S) loop
18250 if S = Standard_Standard then
18257 return Is_Init_Proc (S);
18258 end Within_Init_Proc;
18264 function Within_Scope (E : Entity_Id; S : Entity_Id) return Boolean is
18271 elsif SE = Standard_Standard then
18283 procedure Wrong_Type (Expr : Node_Id; Expected_Type : Entity_Id) is
18284 Found_Type : constant Entity_Id := First_Subtype (Etype (Expr));
18285 Expec_Type : constant Entity_Id := First_Subtype (Expected_Type);
18287 Matching_Field : Entity_Id;
18288 -- Entity to give a more precise suggestion on how to write a one-
18289 -- element positional aggregate.
18291 function Has_One_Matching_Field return Boolean;
18292 -- Determines if Expec_Type is a record type with a single component or
18293 -- discriminant whose type matches the found type or is one dimensional
18294 -- array whose component type matches the found type. In the case of
18295 -- one discriminant, we ignore the variant parts. That's not accurate,
18296 -- but good enough for the warning.
18298 ----------------------------
18299 -- Has_One_Matching_Field --
18300 ----------------------------
18302 function Has_One_Matching_Field return Boolean is
18306 Matching_Field := Empty;
18308 if Is_Array_Type (Expec_Type)
18309 and then Number_Dimensions (Expec_Type) = 1
18310 and then Covers (Etype (Component_Type (Expec_Type)), Found_Type)
18312 -- Use type name if available. This excludes multidimensional
18313 -- arrays and anonymous arrays.
18315 if Comes_From_Source (Expec_Type) then
18316 Matching_Field := Expec_Type;
18318 -- For an assignment, use name of target
18320 elsif Nkind (Parent (Expr)) = N_Assignment_Statement
18321 and then Is_Entity_Name (Name (Parent (Expr)))
18323 Matching_Field := Entity (Name (Parent (Expr)));
18328 elsif not Is_Record_Type (Expec_Type) then
18332 E := First_Entity (Expec_Type);
18337 elsif not Ekind_In (E, E_Discriminant, E_Component)
18338 or else Nam_In (Chars (E), Name_uTag, Name_uParent)
18347 if not Covers (Etype (E), Found_Type) then
18350 elsif Present (Next_Entity (E))
18351 and then (Ekind (E) = E_Component
18352 or else Ekind (Next_Entity (E)) = E_Discriminant)
18357 Matching_Field := E;
18361 end Has_One_Matching_Field;
18363 -- Start of processing for Wrong_Type
18366 -- Don't output message if either type is Any_Type, or if a message
18367 -- has already been posted for this node. We need to do the latter
18368 -- check explicitly (it is ordinarily done in Errout), because we
18369 -- are using ! to force the output of the error messages.
18371 if Expec_Type = Any_Type
18372 or else Found_Type = Any_Type
18373 or else Error_Posted (Expr)
18377 -- If one of the types is a Taft-Amendment type and the other it its
18378 -- completion, it must be an illegal use of a TAT in the spec, for
18379 -- which an error was already emitted. Avoid cascaded errors.
18381 elsif Is_Incomplete_Type (Expec_Type)
18382 and then Has_Completion_In_Body (Expec_Type)
18383 and then Full_View (Expec_Type) = Etype (Expr)
18387 elsif Is_Incomplete_Type (Etype (Expr))
18388 and then Has_Completion_In_Body (Etype (Expr))
18389 and then Full_View (Etype (Expr)) = Expec_Type
18393 -- In an instance, there is an ongoing problem with completion of
18394 -- type derived from private types. Their structure is what Gigi
18395 -- expects, but the Etype is the parent type rather than the
18396 -- derived private type itself. Do not flag error in this case. The
18397 -- private completion is an entity without a parent, like an Itype.
18398 -- Similarly, full and partial views may be incorrect in the instance.
18399 -- There is no simple way to insure that it is consistent ???
18401 -- A similar view discrepancy can happen in an inlined body, for the
18402 -- same reason: inserted body may be outside of the original package
18403 -- and only partial views are visible at the point of insertion.
18405 elsif In_Instance or else In_Inlined_Body then
18406 if Etype (Etype (Expr)) = Etype (Expected_Type)
18408 (Has_Private_Declaration (Expected_Type)
18409 or else Has_Private_Declaration (Etype (Expr)))
18410 and then No (Parent (Expected_Type))
18414 elsif Nkind (Parent (Expr)) = N_Qualified_Expression
18415 and then Entity (Subtype_Mark (Parent (Expr))) = Expected_Type
18419 elsif Is_Private_Type (Expected_Type)
18420 and then Present (Full_View (Expected_Type))
18421 and then Covers (Full_View (Expected_Type), Etype (Expr))
18427 -- An interesting special check. If the expression is parenthesized
18428 -- and its type corresponds to the type of the sole component of the
18429 -- expected record type, or to the component type of the expected one
18430 -- dimensional array type, then assume we have a bad aggregate attempt.
18432 if Nkind (Expr) in N_Subexpr
18433 and then Paren_Count (Expr) /= 0
18434 and then Has_One_Matching_Field
18436 Error_Msg_N ("positional aggregate cannot have one component", Expr);
18437 if Present (Matching_Field) then
18438 if Is_Array_Type (Expec_Type) then
18440 ("\write instead `&''First ='> ...`", Expr, Matching_Field);
18444 ("\write instead `& ='> ...`", Expr, Matching_Field);
18448 -- Another special check, if we are looking for a pool-specific access
18449 -- type and we found an E_Access_Attribute_Type, then we have the case
18450 -- of an Access attribute being used in a context which needs a pool-
18451 -- specific type, which is never allowed. The one extra check we make
18452 -- is that the expected designated type covers the Found_Type.
18454 elsif Is_Access_Type (Expec_Type)
18455 and then Ekind (Found_Type) = E_Access_Attribute_Type
18456 and then Ekind (Base_Type (Expec_Type)) /= E_General_Access_Type
18457 and then Ekind (Base_Type (Expec_Type)) /= E_Anonymous_Access_Type
18459 (Designated_Type (Expec_Type), Designated_Type (Found_Type))
18461 Error_Msg_N -- CODEFIX
18462 ("result must be general access type!", Expr);
18463 Error_Msg_NE -- CODEFIX
18464 ("add ALL to }!", Expr, Expec_Type);
18466 -- Another special check, if the expected type is an integer type,
18467 -- but the expression is of type System.Address, and the parent is
18468 -- an addition or subtraction operation whose left operand is the
18469 -- expression in question and whose right operand is of an integral
18470 -- type, then this is an attempt at address arithmetic, so give
18471 -- appropriate message.
18473 elsif Is_Integer_Type (Expec_Type)
18474 and then Is_RTE (Found_Type, RE_Address)
18475 and then Nkind_In (Parent (Expr), N_Op_Add, N_Op_Subtract)
18476 and then Expr = Left_Opnd (Parent (Expr))
18477 and then Is_Integer_Type (Etype (Right_Opnd (Parent (Expr))))
18480 ("address arithmetic not predefined in package System",
18483 ("\possible missing with/use of System.Storage_Elements",
18487 -- If the expected type is an anonymous access type, as for access
18488 -- parameters and discriminants, the error is on the designated types.
18490 elsif Ekind (Expec_Type) = E_Anonymous_Access_Type then
18491 if Comes_From_Source (Expec_Type) then
18492 Error_Msg_NE ("expected}!", Expr, Expec_Type);
18495 ("expected an access type with designated}",
18496 Expr, Designated_Type (Expec_Type));
18499 if Is_Access_Type (Found_Type)
18500 and then not Comes_From_Source (Found_Type)
18503 ("\\found an access type with designated}!",
18504 Expr, Designated_Type (Found_Type));
18506 if From_Limited_With (Found_Type) then
18507 Error_Msg_NE ("\\found incomplete}!", Expr, Found_Type);
18508 Error_Msg_Qual_Level := 99;
18509 Error_Msg_NE -- CODEFIX
18510 ("\\missing `WITH &;", Expr, Scope (Found_Type));
18511 Error_Msg_Qual_Level := 0;
18513 Error_Msg_NE ("found}!", Expr, Found_Type);
18517 -- Normal case of one type found, some other type expected
18520 -- If the names of the two types are the same, see if some number
18521 -- of levels of qualification will help. Don't try more than three
18522 -- levels, and if we get to standard, it's no use (and probably
18523 -- represents an error in the compiler) Also do not bother with
18524 -- internal scope names.
18527 Expec_Scope : Entity_Id;
18528 Found_Scope : Entity_Id;
18531 Expec_Scope := Expec_Type;
18532 Found_Scope := Found_Type;
18534 for Levels in Int range 0 .. 3 loop
18535 if Chars (Expec_Scope) /= Chars (Found_Scope) then
18536 Error_Msg_Qual_Level := Levels;
18540 Expec_Scope := Scope (Expec_Scope);
18541 Found_Scope := Scope (Found_Scope);
18543 exit when Expec_Scope = Standard_Standard
18544 or else Found_Scope = Standard_Standard
18545 or else not Comes_From_Source (Expec_Scope)
18546 or else not Comes_From_Source (Found_Scope);
18550 if Is_Record_Type (Expec_Type)
18551 and then Present (Corresponding_Remote_Type (Expec_Type))
18553 Error_Msg_NE ("expected}!", Expr,
18554 Corresponding_Remote_Type (Expec_Type));
18556 Error_Msg_NE ("expected}!", Expr, Expec_Type);
18559 if Is_Entity_Name (Expr)
18560 and then Is_Package_Or_Generic_Package (Entity (Expr))
18562 Error_Msg_N ("\\found package name!", Expr);
18564 elsif Is_Entity_Name (Expr)
18565 and then Ekind_In (Entity (Expr), E_Procedure, E_Generic_Procedure)
18567 if Ekind (Expec_Type) = E_Access_Subprogram_Type then
18569 ("found procedure name, possibly missing Access attribute!",
18573 ("\\found procedure name instead of function!", Expr);
18576 elsif Nkind (Expr) = N_Function_Call
18577 and then Ekind (Expec_Type) = E_Access_Subprogram_Type
18578 and then Etype (Designated_Type (Expec_Type)) = Etype (Expr)
18579 and then No (Parameter_Associations (Expr))
18582 ("found function name, possibly missing Access attribute!",
18585 -- Catch common error: a prefix or infix operator which is not
18586 -- directly visible because the type isn't.
18588 elsif Nkind (Expr) in N_Op
18589 and then Is_Overloaded (Expr)
18590 and then not Is_Immediately_Visible (Expec_Type)
18591 and then not Is_Potentially_Use_Visible (Expec_Type)
18592 and then not In_Use (Expec_Type)
18593 and then Has_Compatible_Type (Right_Opnd (Expr), Expec_Type)
18596 ("operator of the type is not directly visible!", Expr);
18598 elsif Ekind (Found_Type) = E_Void
18599 and then Present (Parent (Found_Type))
18600 and then Nkind (Parent (Found_Type)) = N_Full_Type_Declaration
18602 Error_Msg_NE ("\\found premature usage of}!", Expr, Found_Type);
18605 Error_Msg_NE ("\\found}!", Expr, Found_Type);
18608 -- A special check for cases like M1 and M2 = 0 where M1 and M2 are
18609 -- of the same modular type, and (M1 and M2) = 0 was intended.
18611 if Expec_Type = Standard_Boolean
18612 and then Is_Modular_Integer_Type (Found_Type)
18613 and then Nkind_In (Parent (Expr), N_Op_And, N_Op_Or, N_Op_Xor)
18614 and then Nkind (Right_Opnd (Parent (Expr))) in N_Op_Compare
18617 Op : constant Node_Id := Right_Opnd (Parent (Expr));
18618 L : constant Node_Id := Left_Opnd (Op);
18619 R : constant Node_Id := Right_Opnd (Op);
18622 -- The case for the message is when the left operand of the
18623 -- comparison is the same modular type, or when it is an
18624 -- integer literal (or other universal integer expression),
18625 -- which would have been typed as the modular type if the
18626 -- parens had been there.
18628 if (Etype (L) = Found_Type
18630 Etype (L) = Universal_Integer)
18631 and then Is_Integer_Type (Etype (R))
18634 ("\\possible missing parens for modular operation", Expr);
18639 -- Reset error message qualification indication
18641 Error_Msg_Qual_Level := 0;