1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2011, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Casing; use Casing;
28 with Checks; use Checks;
29 with Debug; use Debug;
30 with Errout; use Errout;
31 with Elists; use Elists;
32 with Exp_Ch11; use Exp_Ch11;
33 with Exp_Disp; use Exp_Disp;
34 with Exp_Util; use Exp_Util;
35 with Fname; use Fname;
36 with Freeze; use Freeze;
38 with Lib.Xref; use Lib.Xref;
39 with Nlists; use Nlists;
40 with Output; use Output;
42 with Restrict; use Restrict;
43 with Rident; use Rident;
44 with Rtsfind; use Rtsfind;
46 with Sem_Aux; use Sem_Aux;
47 with Sem_Attr; use Sem_Attr;
48 with Sem_Ch8; use Sem_Ch8;
49 with Sem_Disp; use Sem_Disp;
50 with Sem_Eval; use Sem_Eval;
51 with Sem_Res; use Sem_Res;
52 with Sem_Type; use Sem_Type;
53 with Sinfo; use Sinfo;
54 with Sinput; use Sinput;
55 with Stand; use Stand;
57 with Stringt; use Stringt;
59 with Targparm; use Targparm;
60 with Tbuild; use Tbuild;
61 with Ttypes; use Ttypes;
62 with Uname; use Uname;
64 with GNAT.HTable; use GNAT.HTable;
66 package body Sem_Util is
68 ----------------------------------------
69 -- Global_Variables for New_Copy_Tree --
70 ----------------------------------------
72 -- These global variables are used by New_Copy_Tree. See description
73 -- of the body of this subprogram for details. Global variables can be
74 -- safely used by New_Copy_Tree, since there is no case of a recursive
75 -- call from the processing inside New_Copy_Tree.
77 NCT_Hash_Threshold : constant := 20;
78 -- If there are more than this number of pairs of entries in the
79 -- map, then Hash_Tables_Used will be set, and the hash tables will
80 -- be initialized and used for the searches.
82 NCT_Hash_Tables_Used : Boolean := False;
83 -- Set to True if hash tables are in use
85 NCT_Table_Entries : Nat;
86 -- Count entries in table to see if threshold is reached
88 NCT_Hash_Table_Setup : Boolean := False;
89 -- Set to True if hash table contains data. We set this True if we
90 -- setup the hash table with data, and leave it set permanently
91 -- from then on, this is a signal that second and subsequent users
92 -- of the hash table must clear the old entries before reuse.
94 subtype NCT_Header_Num is Int range 0 .. 511;
95 -- Defines range of headers in hash tables (512 headers)
97 ----------------------------------
98 -- Order Dependence (AI05-0144) --
99 ----------------------------------
101 -- Each actual in a call is entered into the table below. A flag indicates
102 -- whether the corresponding formal is OUT or IN OUT. Each top-level call
103 -- (procedure call, condition, assignment) examines all the actuals for a
104 -- possible order dependence. The table is reset after each such check.
105 -- The actuals to be checked in a call to Check_Order_Dependence are at
106 -- positions 1 .. Last.
108 type Actual_Name is record
110 Is_Writable : Boolean;
113 package Actuals_In_Call is new Table.Table (
114 Table_Component_Type => Actual_Name,
115 Table_Index_Type => Int,
116 Table_Low_Bound => 0,
118 Table_Increment => 100,
119 Table_Name => "Actuals");
121 -----------------------
122 -- Local Subprograms --
123 -----------------------
125 function Build_Component_Subtype
128 T : Entity_Id) return Node_Id;
129 -- This function builds the subtype for Build_Actual_Subtype_Of_Component
130 -- and Build_Discriminal_Subtype_Of_Component. C is a list of constraints,
131 -- Loc is the source location, T is the original subtype.
133 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean;
134 -- Subsidiary to Is_Fully_Initialized_Type. For an unconstrained type
135 -- with discriminants whose default values are static, examine only the
136 -- components in the selected variant to determine whether all of them
139 function Has_Null_Extension (T : Entity_Id) return Boolean;
140 -- T is a derived tagged type. Check whether the type extension is null.
141 -- If the parent type is fully initialized, T can be treated as such.
143 ------------------------------
144 -- Abstract_Interface_List --
145 ------------------------------
147 function Abstract_Interface_List (Typ : Entity_Id) return List_Id is
151 if Is_Concurrent_Type (Typ) then
153 -- If we are dealing with a synchronized subtype, go to the base
154 -- type, whose declaration has the interface list.
156 -- Shouldn't this be Declaration_Node???
158 Nod := Parent (Base_Type (Typ));
160 if Nkind (Nod) = N_Full_Type_Declaration then
164 elsif Ekind (Typ) = E_Record_Type_With_Private then
165 if Nkind (Parent (Typ)) = N_Full_Type_Declaration then
166 Nod := Type_Definition (Parent (Typ));
168 elsif Nkind (Parent (Typ)) = N_Private_Type_Declaration then
169 if Present (Full_View (Typ))
170 and then Nkind (Parent (Full_View (Typ)))
171 = N_Full_Type_Declaration
173 Nod := Type_Definition (Parent (Full_View (Typ)));
175 -- If the full-view is not available we cannot do anything else
176 -- here (the source has errors).
182 -- Support for generic formals with interfaces is still missing ???
184 elsif Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
189 (Nkind (Parent (Typ)) = N_Private_Extension_Declaration);
193 elsif Ekind (Typ) = E_Record_Subtype then
194 Nod := Type_Definition (Parent (Etype (Typ)));
196 elsif Ekind (Typ) = E_Record_Subtype_With_Private then
198 -- Recurse, because parent may still be a private extension. Also
199 -- note that the full view of the subtype or the full view of its
200 -- base type may (both) be unavailable.
202 return Abstract_Interface_List (Etype (Typ));
204 else pragma Assert ((Ekind (Typ)) = E_Record_Type);
205 if Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
206 Nod := Formal_Type_Definition (Parent (Typ));
208 Nod := Type_Definition (Parent (Typ));
212 return Interface_List (Nod);
213 end Abstract_Interface_List;
215 --------------------------------
216 -- Add_Access_Type_To_Process --
217 --------------------------------
219 procedure Add_Access_Type_To_Process (E : Entity_Id; A : Entity_Id) is
223 Ensure_Freeze_Node (E);
224 L := Access_Types_To_Process (Freeze_Node (E));
228 Set_Access_Types_To_Process (Freeze_Node (E), L);
232 end Add_Access_Type_To_Process;
234 ----------------------------
235 -- Add_Global_Declaration --
236 ----------------------------
238 procedure Add_Global_Declaration (N : Node_Id) is
239 Aux_Node : constant Node_Id := Aux_Decls_Node (Cunit (Current_Sem_Unit));
242 if No (Declarations (Aux_Node)) then
243 Set_Declarations (Aux_Node, New_List);
246 Append_To (Declarations (Aux_Node), N);
248 end Add_Global_Declaration;
254 -- For now, just 8/16/32/64. but analyze later if AAMP is special???
256 function Addressable (V : Uint) return Boolean is
258 return V = Uint_8 or else
264 function Addressable (V : Int) return Boolean is
272 -----------------------
273 -- Alignment_In_Bits --
274 -----------------------
276 function Alignment_In_Bits (E : Entity_Id) return Uint is
278 return Alignment (E) * System_Storage_Unit;
279 end Alignment_In_Bits;
281 -----------------------------------------
282 -- Apply_Compile_Time_Constraint_Error --
283 -----------------------------------------
285 procedure Apply_Compile_Time_Constraint_Error
288 Reason : RT_Exception_Code;
289 Ent : Entity_Id := Empty;
290 Typ : Entity_Id := Empty;
291 Loc : Source_Ptr := No_Location;
292 Rep : Boolean := True;
293 Warn : Boolean := False)
295 Stat : constant Boolean := Is_Static_Expression (N);
296 R_Stat : constant Node_Id :=
297 Make_Raise_Constraint_Error (Sloc (N), Reason => Reason);
308 (Compile_Time_Constraint_Error (N, Msg, Ent, Loc, Warn => Warn));
314 -- Now we replace the node by an N_Raise_Constraint_Error node
315 -- This does not need reanalyzing, so set it as analyzed now.
318 Set_Analyzed (N, True);
321 Set_Raises_Constraint_Error (N);
323 -- Now deal with possible local raise handling
325 Possible_Local_Raise (N, Standard_Constraint_Error);
327 -- If the original expression was marked as static, the result is
328 -- still marked as static, but the Raises_Constraint_Error flag is
329 -- always set so that further static evaluation is not attempted.
332 Set_Is_Static_Expression (N);
334 end Apply_Compile_Time_Constraint_Error;
336 --------------------------------
337 -- Bad_Predicated_Subtype_Use --
338 --------------------------------
340 procedure Bad_Predicated_Subtype_Use
346 if Has_Predicates (Typ) then
347 if Is_Generic_Actual_Type (Typ) then
348 Error_Msg_FE (Msg & '?', N, Typ);
349 Error_Msg_F ("\Program_Error will be raised at run time?", N);
351 Make_Raise_Program_Error (Sloc (N),
352 Reason => PE_Bad_Predicated_Generic_Type));
355 Error_Msg_FE (Msg, N, Typ);
358 end Bad_Predicated_Subtype_Use;
360 --------------------------
361 -- Build_Actual_Subtype --
362 --------------------------
364 function Build_Actual_Subtype
366 N : Node_Or_Entity_Id) return Node_Id
369 -- Normally Sloc (N), but may point to corresponding body in some cases
371 Constraints : List_Id;
377 Disc_Type : Entity_Id;
383 if Nkind (N) = N_Defining_Identifier then
384 Obj := New_Reference_To (N, Loc);
386 -- If this is a formal parameter of a subprogram declaration, and
387 -- we are compiling the body, we want the declaration for the
388 -- actual subtype to carry the source position of the body, to
389 -- prevent anomalies in gdb when stepping through the code.
391 if Is_Formal (N) then
393 Decl : constant Node_Id := Unit_Declaration_Node (Scope (N));
395 if Nkind (Decl) = N_Subprogram_Declaration
396 and then Present (Corresponding_Body (Decl))
398 Loc := Sloc (Corresponding_Body (Decl));
407 if Is_Array_Type (T) then
408 Constraints := New_List;
409 for J in 1 .. Number_Dimensions (T) loop
411 -- Build an array subtype declaration with the nominal subtype and
412 -- the bounds of the actual. Add the declaration in front of the
413 -- local declarations for the subprogram, for analysis before any
414 -- reference to the formal in the body.
417 Make_Attribute_Reference (Loc,
419 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
420 Attribute_Name => Name_First,
421 Expressions => New_List (
422 Make_Integer_Literal (Loc, J)));
425 Make_Attribute_Reference (Loc,
427 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
428 Attribute_Name => Name_Last,
429 Expressions => New_List (
430 Make_Integer_Literal (Loc, J)));
432 Append (Make_Range (Loc, Lo, Hi), Constraints);
435 -- If the type has unknown discriminants there is no constrained
436 -- subtype to build. This is never called for a formal or for a
437 -- lhs, so returning the type is ok ???
439 elsif Has_Unknown_Discriminants (T) then
443 Constraints := New_List;
445 -- Type T is a generic derived type, inherit the discriminants from
448 if Is_Private_Type (T)
449 and then No (Full_View (T))
451 -- T was flagged as an error if it was declared as a formal
452 -- derived type with known discriminants. In this case there
453 -- is no need to look at the parent type since T already carries
454 -- its own discriminants.
456 and then not Error_Posted (T)
458 Disc_Type := Etype (Base_Type (T));
463 Discr := First_Discriminant (Disc_Type);
464 while Present (Discr) loop
465 Append_To (Constraints,
466 Make_Selected_Component (Loc,
468 Duplicate_Subexpr_No_Checks (Obj),
469 Selector_Name => New_Occurrence_Of (Discr, Loc)));
470 Next_Discriminant (Discr);
474 Subt := Make_Temporary (Loc, 'S', Related_Node => N);
475 Set_Is_Internal (Subt);
478 Make_Subtype_Declaration (Loc,
479 Defining_Identifier => Subt,
480 Subtype_Indication =>
481 Make_Subtype_Indication (Loc,
482 Subtype_Mark => New_Reference_To (T, Loc),
484 Make_Index_Or_Discriminant_Constraint (Loc,
485 Constraints => Constraints)));
487 Mark_Rewrite_Insertion (Decl);
489 end Build_Actual_Subtype;
491 ---------------------------------------
492 -- Build_Actual_Subtype_Of_Component --
493 ---------------------------------------
495 function Build_Actual_Subtype_Of_Component
497 N : Node_Id) return Node_Id
499 Loc : constant Source_Ptr := Sloc (N);
500 P : constant Node_Id := Prefix (N);
503 Index_Typ : Entity_Id;
505 Desig_Typ : Entity_Id;
506 -- This is either a copy of T, or if T is an access type, then it is
507 -- the directly designated type of this access type.
509 function Build_Actual_Array_Constraint return List_Id;
510 -- If one or more of the bounds of the component depends on
511 -- discriminants, build actual constraint using the discriminants
514 function Build_Actual_Record_Constraint return List_Id;
515 -- Similar to previous one, for discriminated components constrained
516 -- by the discriminant of the enclosing object.
518 -----------------------------------
519 -- Build_Actual_Array_Constraint --
520 -----------------------------------
522 function Build_Actual_Array_Constraint return List_Id is
523 Constraints : constant List_Id := New_List;
531 Indx := First_Index (Desig_Typ);
532 while Present (Indx) loop
533 Old_Lo := Type_Low_Bound (Etype (Indx));
534 Old_Hi := Type_High_Bound (Etype (Indx));
536 if Denotes_Discriminant (Old_Lo) then
538 Make_Selected_Component (Loc,
539 Prefix => New_Copy_Tree (P),
540 Selector_Name => New_Occurrence_Of (Entity (Old_Lo), Loc));
543 Lo := New_Copy_Tree (Old_Lo);
545 -- The new bound will be reanalyzed in the enclosing
546 -- declaration. For literal bounds that come from a type
547 -- declaration, the type of the context must be imposed, so
548 -- insure that analysis will take place. For non-universal
549 -- types this is not strictly necessary.
551 Set_Analyzed (Lo, False);
554 if Denotes_Discriminant (Old_Hi) then
556 Make_Selected_Component (Loc,
557 Prefix => New_Copy_Tree (P),
558 Selector_Name => New_Occurrence_Of (Entity (Old_Hi), Loc));
561 Hi := New_Copy_Tree (Old_Hi);
562 Set_Analyzed (Hi, False);
565 Append (Make_Range (Loc, Lo, Hi), Constraints);
570 end Build_Actual_Array_Constraint;
572 ------------------------------------
573 -- Build_Actual_Record_Constraint --
574 ------------------------------------
576 function Build_Actual_Record_Constraint return List_Id is
577 Constraints : constant List_Id := New_List;
582 D := First_Elmt (Discriminant_Constraint (Desig_Typ));
583 while Present (D) loop
584 if Denotes_Discriminant (Node (D)) then
585 D_Val := Make_Selected_Component (Loc,
586 Prefix => New_Copy_Tree (P),
587 Selector_Name => New_Occurrence_Of (Entity (Node (D)), Loc));
590 D_Val := New_Copy_Tree (Node (D));
593 Append (D_Val, Constraints);
598 end Build_Actual_Record_Constraint;
600 -- Start of processing for Build_Actual_Subtype_Of_Component
603 -- Why the test for Spec_Expression mode here???
605 if In_Spec_Expression then
608 -- More comments for the rest of this body would be good ???
610 elsif Nkind (N) = N_Explicit_Dereference then
611 if Is_Composite_Type (T)
612 and then not Is_Constrained (T)
613 and then not (Is_Class_Wide_Type (T)
614 and then Is_Constrained (Root_Type (T)))
615 and then not Has_Unknown_Discriminants (T)
617 -- If the type of the dereference is already constrained, it is an
620 if Is_Array_Type (Etype (N))
621 and then Is_Constrained (Etype (N))
625 Remove_Side_Effects (P);
626 return Build_Actual_Subtype (T, N);
633 if Ekind (T) = E_Access_Subtype then
634 Desig_Typ := Designated_Type (T);
639 if Ekind (Desig_Typ) = E_Array_Subtype then
640 Id := First_Index (Desig_Typ);
641 while Present (Id) loop
642 Index_Typ := Underlying_Type (Etype (Id));
644 if Denotes_Discriminant (Type_Low_Bound (Index_Typ))
646 Denotes_Discriminant (Type_High_Bound (Index_Typ))
648 Remove_Side_Effects (P);
650 Build_Component_Subtype
651 (Build_Actual_Array_Constraint, Loc, Base_Type (T));
657 elsif Is_Composite_Type (Desig_Typ)
658 and then Has_Discriminants (Desig_Typ)
659 and then not Has_Unknown_Discriminants (Desig_Typ)
661 if Is_Private_Type (Desig_Typ)
662 and then No (Discriminant_Constraint (Desig_Typ))
664 Desig_Typ := Full_View (Desig_Typ);
667 D := First_Elmt (Discriminant_Constraint (Desig_Typ));
668 while Present (D) loop
669 if Denotes_Discriminant (Node (D)) then
670 Remove_Side_Effects (P);
672 Build_Component_Subtype (
673 Build_Actual_Record_Constraint, Loc, Base_Type (T));
680 -- If none of the above, the actual and nominal subtypes are the same
683 end Build_Actual_Subtype_Of_Component;
685 -----------------------------
686 -- Build_Component_Subtype --
687 -----------------------------
689 function Build_Component_Subtype
692 T : Entity_Id) return Node_Id
698 -- Unchecked_Union components do not require component subtypes
700 if Is_Unchecked_Union (T) then
704 Subt := Make_Temporary (Loc, 'S');
705 Set_Is_Internal (Subt);
708 Make_Subtype_Declaration (Loc,
709 Defining_Identifier => Subt,
710 Subtype_Indication =>
711 Make_Subtype_Indication (Loc,
712 Subtype_Mark => New_Reference_To (Base_Type (T), Loc),
714 Make_Index_Or_Discriminant_Constraint (Loc,
717 Mark_Rewrite_Insertion (Decl);
719 end Build_Component_Subtype;
721 ---------------------------
722 -- Build_Default_Subtype --
723 ---------------------------
725 function Build_Default_Subtype
727 N : Node_Id) return Entity_Id
729 Loc : constant Source_Ptr := Sloc (N);
733 if not Has_Discriminants (T) or else Is_Constrained (T) then
737 Disc := First_Discriminant (T);
739 if No (Discriminant_Default_Value (Disc)) then
744 Act : constant Entity_Id := Make_Temporary (Loc, 'S');
745 Constraints : constant List_Id := New_List;
749 while Present (Disc) loop
750 Append_To (Constraints,
751 New_Copy_Tree (Discriminant_Default_Value (Disc)));
752 Next_Discriminant (Disc);
756 Make_Subtype_Declaration (Loc,
757 Defining_Identifier => Act,
758 Subtype_Indication =>
759 Make_Subtype_Indication (Loc,
760 Subtype_Mark => New_Occurrence_Of (T, Loc),
762 Make_Index_Or_Discriminant_Constraint (Loc,
763 Constraints => Constraints)));
765 Insert_Action (N, Decl);
769 end Build_Default_Subtype;
771 --------------------------------------------
772 -- Build_Discriminal_Subtype_Of_Component --
773 --------------------------------------------
775 function Build_Discriminal_Subtype_Of_Component
776 (T : Entity_Id) return Node_Id
778 Loc : constant Source_Ptr := Sloc (T);
782 function Build_Discriminal_Array_Constraint return List_Id;
783 -- If one or more of the bounds of the component depends on
784 -- discriminants, build actual constraint using the discriminants
787 function Build_Discriminal_Record_Constraint return List_Id;
788 -- Similar to previous one, for discriminated components constrained
789 -- by the discriminant of the enclosing object.
791 ----------------------------------------
792 -- Build_Discriminal_Array_Constraint --
793 ----------------------------------------
795 function Build_Discriminal_Array_Constraint return List_Id is
796 Constraints : constant List_Id := New_List;
804 Indx := First_Index (T);
805 while Present (Indx) loop
806 Old_Lo := Type_Low_Bound (Etype (Indx));
807 Old_Hi := Type_High_Bound (Etype (Indx));
809 if Denotes_Discriminant (Old_Lo) then
810 Lo := New_Occurrence_Of (Discriminal (Entity (Old_Lo)), Loc);
813 Lo := New_Copy_Tree (Old_Lo);
816 if Denotes_Discriminant (Old_Hi) then
817 Hi := New_Occurrence_Of (Discriminal (Entity (Old_Hi)), Loc);
820 Hi := New_Copy_Tree (Old_Hi);
823 Append (Make_Range (Loc, Lo, Hi), Constraints);
828 end Build_Discriminal_Array_Constraint;
830 -----------------------------------------
831 -- Build_Discriminal_Record_Constraint --
832 -----------------------------------------
834 function Build_Discriminal_Record_Constraint return List_Id is
835 Constraints : constant List_Id := New_List;
840 D := First_Elmt (Discriminant_Constraint (T));
841 while Present (D) loop
842 if Denotes_Discriminant (Node (D)) then
844 New_Occurrence_Of (Discriminal (Entity (Node (D))), Loc);
847 D_Val := New_Copy_Tree (Node (D));
850 Append (D_Val, Constraints);
855 end Build_Discriminal_Record_Constraint;
857 -- Start of processing for Build_Discriminal_Subtype_Of_Component
860 if Ekind (T) = E_Array_Subtype then
861 Id := First_Index (T);
862 while Present (Id) loop
863 if Denotes_Discriminant (Type_Low_Bound (Etype (Id))) or else
864 Denotes_Discriminant (Type_High_Bound (Etype (Id)))
866 return Build_Component_Subtype
867 (Build_Discriminal_Array_Constraint, Loc, T);
873 elsif Ekind (T) = E_Record_Subtype
874 and then Has_Discriminants (T)
875 and then not Has_Unknown_Discriminants (T)
877 D := First_Elmt (Discriminant_Constraint (T));
878 while Present (D) loop
879 if Denotes_Discriminant (Node (D)) then
880 return Build_Component_Subtype
881 (Build_Discriminal_Record_Constraint, Loc, T);
888 -- If none of the above, the actual and nominal subtypes are the same
891 end Build_Discriminal_Subtype_Of_Component;
893 ------------------------------
894 -- Build_Elaboration_Entity --
895 ------------------------------
897 procedure Build_Elaboration_Entity (N : Node_Id; Spec_Id : Entity_Id) is
898 Loc : constant Source_Ptr := Sloc (N);
900 Elab_Ent : Entity_Id;
902 procedure Set_Package_Name (Ent : Entity_Id);
903 -- Given an entity, sets the fully qualified name of the entity in
904 -- Name_Buffer, with components separated by double underscores. This
905 -- is a recursive routine that climbs the scope chain to Standard.
907 ----------------------
908 -- Set_Package_Name --
909 ----------------------
911 procedure Set_Package_Name (Ent : Entity_Id) is
913 if Scope (Ent) /= Standard_Standard then
914 Set_Package_Name (Scope (Ent));
917 Nam : constant String := Get_Name_String (Chars (Ent));
919 Name_Buffer (Name_Len + 1) := '_';
920 Name_Buffer (Name_Len + 2) := '_';
921 Name_Buffer (Name_Len + 3 .. Name_Len + Nam'Length + 2) := Nam;
922 Name_Len := Name_Len + Nam'Length + 2;
926 Get_Name_String (Chars (Ent));
928 end Set_Package_Name;
930 -- Start of processing for Build_Elaboration_Entity
933 -- Ignore if already constructed
935 if Present (Elaboration_Entity (Spec_Id)) then
939 -- Construct name of elaboration entity as xxx_E, where xxx is the unit
940 -- name with dots replaced by double underscore. We have to manually
941 -- construct this name, since it will be elaborated in the outer scope,
942 -- and thus will not have the unit name automatically prepended.
944 Set_Package_Name (Spec_Id);
948 Name_Buffer (Name_Len + 1) := '_';
949 Name_Buffer (Name_Len + 2) := 'E';
950 Name_Len := Name_Len + 2;
952 -- Create elaboration counter
954 Elab_Ent := Make_Defining_Identifier (Loc, Chars => Name_Find);
955 Set_Elaboration_Entity (Spec_Id, Elab_Ent);
958 Make_Object_Declaration (Loc,
959 Defining_Identifier => Elab_Ent,
961 New_Occurrence_Of (Standard_Short_Integer, Loc),
962 Expression => Make_Integer_Literal (Loc, Uint_0));
964 Push_Scope (Standard_Standard);
965 Add_Global_Declaration (Decl);
968 -- Reset True_Constant indication, since we will indeed assign a value
969 -- to the variable in the binder main. We also kill the Current_Value
970 -- and Last_Assignment fields for the same reason.
972 Set_Is_True_Constant (Elab_Ent, False);
973 Set_Current_Value (Elab_Ent, Empty);
974 Set_Last_Assignment (Elab_Ent, Empty);
976 -- We do not want any further qualification of the name (if we did
977 -- not do this, we would pick up the name of the generic package
978 -- in the case of a library level generic instantiation).
980 Set_Has_Qualified_Name (Elab_Ent);
981 Set_Has_Fully_Qualified_Name (Elab_Ent);
982 end Build_Elaboration_Entity;
984 --------------------------------
985 -- Build_Explicit_Dereference --
986 --------------------------------
988 procedure Build_Explicit_Dereference
992 Loc : constant Source_Ptr := Sloc (Expr);
994 Set_Is_Overloaded (Expr, False);
996 Make_Explicit_Dereference (Loc,
998 Make_Selected_Component (Loc,
999 Prefix => Relocate_Node (Expr),
1000 Selector_Name => New_Occurrence_Of (Disc, Loc))));
1001 Set_Etype (Prefix (Expr), Etype (Disc));
1002 Set_Etype (Expr, Designated_Type (Etype (Disc)));
1003 end Build_Explicit_Dereference;
1005 -----------------------------------
1006 -- Cannot_Raise_Constraint_Error --
1007 -----------------------------------
1009 function Cannot_Raise_Constraint_Error (Expr : Node_Id) return Boolean is
1011 if Compile_Time_Known_Value (Expr) then
1014 elsif Do_Range_Check (Expr) then
1017 elsif Raises_Constraint_Error (Expr) then
1021 case Nkind (Expr) is
1022 when N_Identifier =>
1025 when N_Expanded_Name =>
1028 when N_Selected_Component =>
1029 return not Do_Discriminant_Check (Expr);
1031 when N_Attribute_Reference =>
1032 if Do_Overflow_Check (Expr) then
1035 elsif No (Expressions (Expr)) then
1043 N := First (Expressions (Expr));
1044 while Present (N) loop
1045 if Cannot_Raise_Constraint_Error (N) then
1056 when N_Type_Conversion =>
1057 if Do_Overflow_Check (Expr)
1058 or else Do_Length_Check (Expr)
1059 or else Do_Tag_Check (Expr)
1064 Cannot_Raise_Constraint_Error (Expression (Expr));
1067 when N_Unchecked_Type_Conversion =>
1068 return Cannot_Raise_Constraint_Error (Expression (Expr));
1071 if Do_Overflow_Check (Expr) then
1075 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1082 if Do_Division_Check (Expr)
1083 or else Do_Overflow_Check (Expr)
1088 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
1090 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1109 N_Op_Shift_Right_Arithmetic |
1113 if Do_Overflow_Check (Expr) then
1117 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
1119 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1126 end Cannot_Raise_Constraint_Error;
1128 --------------------------------
1129 -- Check_Implicit_Dereference --
1130 --------------------------------
1132 procedure Check_Implicit_Dereference (Nam : Node_Id; Typ : Entity_Id)
1138 if Ada_Version < Ada_2012
1139 or else not Has_Implicit_Dereference (Base_Type (Typ))
1143 elsif not Comes_From_Source (Nam) then
1146 elsif Is_Entity_Name (Nam)
1147 and then Is_Type (Entity (Nam))
1152 Disc := First_Discriminant (Typ);
1153 while Present (Disc) loop
1154 if Has_Implicit_Dereference (Disc) then
1155 Desig := Designated_Type (Etype (Disc));
1156 Add_One_Interp (Nam, Disc, Desig);
1160 Next_Discriminant (Disc);
1163 end Check_Implicit_Dereference;
1165 ---------------------------------------
1166 -- Check_Later_Vs_Basic_Declarations --
1167 ---------------------------------------
1169 procedure Check_Later_Vs_Basic_Declarations
1171 During_Parsing : Boolean)
1173 Body_Sloc : Source_Ptr;
1176 function Is_Later_Declarative_Item (Decl : Node_Id) return Boolean;
1177 -- Return whether Decl is considered as a declarative item.
1178 -- When During_Parsing is True, the semantics of Ada 83 is followed.
1179 -- When During_Parsing is False, the semantics of SPARK is followed.
1181 -------------------------------
1182 -- Is_Later_Declarative_Item --
1183 -------------------------------
1185 function Is_Later_Declarative_Item (Decl : Node_Id) return Boolean is
1187 if Nkind (Decl) in N_Later_Decl_Item then
1190 elsif Nkind (Decl) = N_Pragma then
1193 elsif During_Parsing then
1196 -- In SPARK, a package declaration is not considered as a later
1197 -- declarative item.
1199 elsif Nkind (Decl) = N_Package_Declaration then
1202 -- In SPARK, a renaming is considered as a later declarative item
1204 elsif Nkind (Decl) in N_Renaming_Declaration then
1210 end Is_Later_Declarative_Item;
1212 -- Start of Check_Later_Vs_Basic_Declarations
1215 Decl := First (Decls);
1217 -- Loop through sequence of basic declarative items
1219 Outer : while Present (Decl) loop
1220 if Nkind (Decl) /= N_Subprogram_Body
1221 and then Nkind (Decl) /= N_Package_Body
1222 and then Nkind (Decl) /= N_Task_Body
1223 and then Nkind (Decl) not in N_Body_Stub
1227 -- Once a body is encountered, we only allow later declarative
1228 -- items. The inner loop checks the rest of the list.
1231 Body_Sloc := Sloc (Decl);
1233 Inner : while Present (Decl) loop
1234 if not Is_Later_Declarative_Item (Decl) then
1235 if During_Parsing then
1236 if Ada_Version = Ada_83 then
1237 Error_Msg_Sloc := Body_Sloc;
1239 ("(Ada 83) decl cannot appear after body#", Decl);
1242 Error_Msg_Sloc := Body_Sloc;
1243 Check_SPARK_Restriction
1244 ("decl cannot appear after body#", Decl);
1252 end Check_Later_Vs_Basic_Declarations;
1254 -----------------------------------------
1255 -- Check_Dynamically_Tagged_Expression --
1256 -----------------------------------------
1258 procedure Check_Dynamically_Tagged_Expression
1261 Related_Nod : Node_Id)
1264 pragma Assert (Is_Tagged_Type (Typ));
1266 -- In order to avoid spurious errors when analyzing the expanded code,
1267 -- this check is done only for nodes that come from source and for
1268 -- actuals of generic instantiations.
1270 if (Comes_From_Source (Related_Nod)
1271 or else In_Generic_Actual (Expr))
1272 and then (Is_Class_Wide_Type (Etype (Expr))
1273 or else Is_Dynamically_Tagged (Expr))
1274 and then Is_Tagged_Type (Typ)
1275 and then not Is_Class_Wide_Type (Typ)
1277 Error_Msg_N ("dynamically tagged expression not allowed!", Expr);
1279 end Check_Dynamically_Tagged_Expression;
1281 --------------------------
1282 -- Check_Fully_Declared --
1283 --------------------------
1285 procedure Check_Fully_Declared (T : Entity_Id; N : Node_Id) is
1287 if Ekind (T) = E_Incomplete_Type then
1289 -- Ada 2005 (AI-50217): If the type is available through a limited
1290 -- with_clause, verify that its full view has been analyzed.
1292 if From_With_Type (T)
1293 and then Present (Non_Limited_View (T))
1294 and then Ekind (Non_Limited_View (T)) /= E_Incomplete_Type
1296 -- The non-limited view is fully declared
1301 ("premature usage of incomplete}", N, First_Subtype (T));
1304 -- Need comments for these tests ???
1306 elsif Has_Private_Component (T)
1307 and then not Is_Generic_Type (Root_Type (T))
1308 and then not In_Spec_Expression
1310 -- Special case: if T is the anonymous type created for a single
1311 -- task or protected object, use the name of the source object.
1313 if Is_Concurrent_Type (T)
1314 and then not Comes_From_Source (T)
1315 and then Nkind (N) = N_Object_Declaration
1317 Error_Msg_NE ("type of& has incomplete component", N,
1318 Defining_Identifier (N));
1322 ("premature usage of incomplete}", N, First_Subtype (T));
1325 end Check_Fully_Declared;
1327 -------------------------
1328 -- Check_Nested_Access --
1329 -------------------------
1331 procedure Check_Nested_Access (Ent : Entity_Id) is
1332 Scop : constant Entity_Id := Current_Scope;
1333 Current_Subp : Entity_Id;
1334 Enclosing : Entity_Id;
1337 -- Currently only enabled for VM back-ends for efficiency, should we
1338 -- enable it more systematically ???
1340 -- Check for Is_Imported needs commenting below ???
1342 if VM_Target /= No_VM
1343 and then (Ekind (Ent) = E_Variable
1345 Ekind (Ent) = E_Constant
1347 Ekind (Ent) = E_Loop_Parameter)
1348 and then Scope (Ent) /= Empty
1349 and then not Is_Library_Level_Entity (Ent)
1350 and then not Is_Imported (Ent)
1352 if Is_Subprogram (Scop)
1353 or else Is_Generic_Subprogram (Scop)
1354 or else Is_Entry (Scop)
1356 Current_Subp := Scop;
1358 Current_Subp := Current_Subprogram;
1361 Enclosing := Enclosing_Subprogram (Ent);
1363 if Enclosing /= Empty
1364 and then Enclosing /= Current_Subp
1366 Set_Has_Up_Level_Access (Ent, True);
1369 end Check_Nested_Access;
1371 ----------------------------
1372 -- Check_Order_Dependence --
1373 ----------------------------
1375 procedure Check_Order_Dependence is
1380 if Ada_Version < Ada_2012 then
1384 -- Ada 2012 AI05-0144-2: Dangerous order dependence. Actuals in nested
1385 -- calls within a construct have been collected. If one of them is
1386 -- writable and overlaps with another one, evaluation of the enclosing
1387 -- construct is nondeterministic. This is illegal in Ada 2012, but is
1388 -- treated as a warning for now.
1390 for J in 1 .. Actuals_In_Call.Last loop
1391 if Actuals_In_Call.Table (J).Is_Writable then
1392 Act1 := Actuals_In_Call.Table (J).Act;
1394 if Nkind (Act1) = N_Attribute_Reference then
1395 Act1 := Prefix (Act1);
1398 for K in 1 .. Actuals_In_Call.Last loop
1400 Act2 := Actuals_In_Call.Table (K).Act;
1402 if Nkind (Act2) = N_Attribute_Reference then
1403 Act2 := Prefix (Act2);
1406 if Actuals_In_Call.Table (K).Is_Writable
1413 elsif Denotes_Same_Object (Act1, Act2)
1414 and then Parent (Act1) /= Parent (Act2)
1417 ("result may differ if evaluated "
1418 & "after other actual in expression?", Act1);
1425 -- Remove checked actuals from table
1427 Actuals_In_Call.Set_Last (0);
1428 end Check_Order_Dependence;
1430 ------------------------------------------
1431 -- Check_Potentially_Blocking_Operation --
1432 ------------------------------------------
1434 procedure Check_Potentially_Blocking_Operation (N : Node_Id) is
1438 -- N is one of the potentially blocking operations listed in 9.5.1(8).
1439 -- When pragma Detect_Blocking is active, the run time will raise
1440 -- Program_Error. Here we only issue a warning, since we generally
1441 -- support the use of potentially blocking operations in the absence
1444 -- Indirect blocking through a subprogram call cannot be diagnosed
1445 -- statically without interprocedural analysis, so we do not attempt
1448 S := Scope (Current_Scope);
1449 while Present (S) and then S /= Standard_Standard loop
1450 if Is_Protected_Type (S) then
1452 ("potentially blocking operation in protected operation?", N);
1458 end Check_Potentially_Blocking_Operation;
1460 ------------------------------
1461 -- Check_Unprotected_Access --
1462 ------------------------------
1464 procedure Check_Unprotected_Access
1468 Cont_Encl_Typ : Entity_Id;
1469 Pref_Encl_Typ : Entity_Id;
1471 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id;
1472 -- Check whether Obj is a private component of a protected object.
1473 -- Return the protected type where the component resides, Empty
1476 function Is_Public_Operation return Boolean;
1477 -- Verify that the enclosing operation is callable from outside the
1478 -- protected object, to minimize false positives.
1480 ------------------------------
1481 -- Enclosing_Protected_Type --
1482 ------------------------------
1484 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id is
1486 if Is_Entity_Name (Obj) then
1488 Ent : Entity_Id := Entity (Obj);
1491 -- The object can be a renaming of a private component, use
1492 -- the original record component.
1494 if Is_Prival (Ent) then
1495 Ent := Prival_Link (Ent);
1498 if Is_Protected_Type (Scope (Ent)) then
1504 -- For indexed and selected components, recursively check the prefix
1506 if Nkind_In (Obj, N_Indexed_Component, N_Selected_Component) then
1507 return Enclosing_Protected_Type (Prefix (Obj));
1509 -- The object does not denote a protected component
1514 end Enclosing_Protected_Type;
1516 -------------------------
1517 -- Is_Public_Operation --
1518 -------------------------
1520 function Is_Public_Operation return Boolean is
1527 and then S /= Pref_Encl_Typ
1529 if Scope (S) = Pref_Encl_Typ then
1530 E := First_Entity (Pref_Encl_Typ);
1532 and then E /= First_Private_Entity (Pref_Encl_Typ)
1545 end Is_Public_Operation;
1547 -- Start of processing for Check_Unprotected_Access
1550 if Nkind (Expr) = N_Attribute_Reference
1551 and then Attribute_Name (Expr) = Name_Unchecked_Access
1553 Cont_Encl_Typ := Enclosing_Protected_Type (Context);
1554 Pref_Encl_Typ := Enclosing_Protected_Type (Prefix (Expr));
1556 -- Check whether we are trying to export a protected component to a
1557 -- context with an equal or lower access level.
1559 if Present (Pref_Encl_Typ)
1560 and then No (Cont_Encl_Typ)
1561 and then Is_Public_Operation
1562 and then Scope_Depth (Pref_Encl_Typ) >=
1563 Object_Access_Level (Context)
1566 ("?possible unprotected access to protected data", Expr);
1569 end Check_Unprotected_Access;
1575 procedure Check_VMS (Construct : Node_Id) is
1577 if not OpenVMS_On_Target then
1579 ("this construct is allowed only in Open'V'M'S", Construct);
1583 ------------------------
1584 -- Collect_Interfaces --
1585 ------------------------
1587 procedure Collect_Interfaces
1589 Ifaces_List : out Elist_Id;
1590 Exclude_Parents : Boolean := False;
1591 Use_Full_View : Boolean := True)
1593 procedure Collect (Typ : Entity_Id);
1594 -- Subsidiary subprogram used to traverse the whole list
1595 -- of directly and indirectly implemented interfaces
1601 procedure Collect (Typ : Entity_Id) is
1602 Ancestor : Entity_Id;
1610 -- Handle private types
1613 and then Is_Private_Type (Typ)
1614 and then Present (Full_View (Typ))
1616 Full_T := Full_View (Typ);
1619 -- Include the ancestor if we are generating the whole list of
1620 -- abstract interfaces.
1622 if Etype (Full_T) /= Typ
1624 -- Protect the frontend against wrong sources. For example:
1627 -- type A is tagged null record;
1628 -- type B is new A with private;
1629 -- type C is new A with private;
1631 -- type B is new C with null record;
1632 -- type C is new B with null record;
1635 and then Etype (Full_T) /= T
1637 Ancestor := Etype (Full_T);
1640 if Is_Interface (Ancestor)
1641 and then not Exclude_Parents
1643 Append_Unique_Elmt (Ancestor, Ifaces_List);
1647 -- Traverse the graph of ancestor interfaces
1649 if Is_Non_Empty_List (Abstract_Interface_List (Full_T)) then
1650 Id := First (Abstract_Interface_List (Full_T));
1651 while Present (Id) loop
1652 Iface := Etype (Id);
1654 -- Protect against wrong uses. For example:
1655 -- type I is interface;
1656 -- type O is tagged null record;
1657 -- type Wrong is new I and O with null record; -- ERROR
1659 if Is_Interface (Iface) then
1661 and then Etype (T) /= T
1662 and then Interface_Present_In_Ancestor (Etype (T), Iface)
1667 Append_Unique_Elmt (Iface, Ifaces_List);
1676 -- Start of processing for Collect_Interfaces
1679 pragma Assert (Is_Tagged_Type (T) or else Is_Concurrent_Type (T));
1680 Ifaces_List := New_Elmt_List;
1682 end Collect_Interfaces;
1684 ----------------------------------
1685 -- Collect_Interface_Components --
1686 ----------------------------------
1688 procedure Collect_Interface_Components
1689 (Tagged_Type : Entity_Id;
1690 Components_List : out Elist_Id)
1692 procedure Collect (Typ : Entity_Id);
1693 -- Subsidiary subprogram used to climb to the parents
1699 procedure Collect (Typ : Entity_Id) is
1700 Tag_Comp : Entity_Id;
1701 Parent_Typ : Entity_Id;
1704 -- Handle private types
1706 if Present (Full_View (Etype (Typ))) then
1707 Parent_Typ := Full_View (Etype (Typ));
1709 Parent_Typ := Etype (Typ);
1712 if Parent_Typ /= Typ
1714 -- Protect the frontend against wrong sources. For example:
1717 -- type A is tagged null record;
1718 -- type B is new A with private;
1719 -- type C is new A with private;
1721 -- type B is new C with null record;
1722 -- type C is new B with null record;
1725 and then Parent_Typ /= Tagged_Type
1727 Collect (Parent_Typ);
1730 -- Collect the components containing tags of secondary dispatch
1733 Tag_Comp := Next_Tag_Component (First_Tag_Component (Typ));
1734 while Present (Tag_Comp) loop
1735 pragma Assert (Present (Related_Type (Tag_Comp)));
1736 Append_Elmt (Tag_Comp, Components_List);
1738 Tag_Comp := Next_Tag_Component (Tag_Comp);
1742 -- Start of processing for Collect_Interface_Components
1745 pragma Assert (Ekind (Tagged_Type) = E_Record_Type
1746 and then Is_Tagged_Type (Tagged_Type));
1748 Components_List := New_Elmt_List;
1749 Collect (Tagged_Type);
1750 end Collect_Interface_Components;
1752 -----------------------------
1753 -- Collect_Interfaces_Info --
1754 -----------------------------
1756 procedure Collect_Interfaces_Info
1758 Ifaces_List : out Elist_Id;
1759 Components_List : out Elist_Id;
1760 Tags_List : out Elist_Id)
1762 Comps_List : Elist_Id;
1763 Comp_Elmt : Elmt_Id;
1764 Comp_Iface : Entity_Id;
1765 Iface_Elmt : Elmt_Id;
1768 function Search_Tag (Iface : Entity_Id) return Entity_Id;
1769 -- Search for the secondary tag associated with the interface type
1770 -- Iface that is implemented by T.
1776 function Search_Tag (Iface : Entity_Id) return Entity_Id is
1779 if not Is_CPP_Class (T) then
1780 ADT := Next_Elmt (Next_Elmt (First_Elmt (Access_Disp_Table (T))));
1782 ADT := Next_Elmt (First_Elmt (Access_Disp_Table (T)));
1786 and then Is_Tag (Node (ADT))
1787 and then Related_Type (Node (ADT)) /= Iface
1789 -- Skip secondary dispatch table referencing thunks to user
1790 -- defined primitives covered by this interface.
1792 pragma Assert (Has_Suffix (Node (ADT), 'P'));
1795 -- Skip secondary dispatch tables of Ada types
1797 if not Is_CPP_Class (T) then
1799 -- Skip secondary dispatch table referencing thunks to
1800 -- predefined primitives.
1802 pragma Assert (Has_Suffix (Node (ADT), 'Y'));
1805 -- Skip secondary dispatch table referencing user-defined
1806 -- primitives covered by this interface.
1808 pragma Assert (Has_Suffix (Node (ADT), 'D'));
1811 -- Skip secondary dispatch table referencing predefined
1814 pragma Assert (Has_Suffix (Node (ADT), 'Z'));
1819 pragma Assert (Is_Tag (Node (ADT)));
1823 -- Start of processing for Collect_Interfaces_Info
1826 Collect_Interfaces (T, Ifaces_List);
1827 Collect_Interface_Components (T, Comps_List);
1829 -- Search for the record component and tag associated with each
1830 -- interface type of T.
1832 Components_List := New_Elmt_List;
1833 Tags_List := New_Elmt_List;
1835 Iface_Elmt := First_Elmt (Ifaces_List);
1836 while Present (Iface_Elmt) loop
1837 Iface := Node (Iface_Elmt);
1839 -- Associate the primary tag component and the primary dispatch table
1840 -- with all the interfaces that are parents of T
1842 if Is_Ancestor (Iface, T, Use_Full_View => True) then
1843 Append_Elmt (First_Tag_Component (T), Components_List);
1844 Append_Elmt (Node (First_Elmt (Access_Disp_Table (T))), Tags_List);
1846 -- Otherwise search for the tag component and secondary dispatch
1850 Comp_Elmt := First_Elmt (Comps_List);
1851 while Present (Comp_Elmt) loop
1852 Comp_Iface := Related_Type (Node (Comp_Elmt));
1854 if Comp_Iface = Iface
1855 or else Is_Ancestor (Iface, Comp_Iface, Use_Full_View => True)
1857 Append_Elmt (Node (Comp_Elmt), Components_List);
1858 Append_Elmt (Search_Tag (Comp_Iface), Tags_List);
1862 Next_Elmt (Comp_Elmt);
1864 pragma Assert (Present (Comp_Elmt));
1867 Next_Elmt (Iface_Elmt);
1869 end Collect_Interfaces_Info;
1871 ---------------------
1872 -- Collect_Parents --
1873 ---------------------
1875 procedure Collect_Parents
1877 List : out Elist_Id;
1878 Use_Full_View : Boolean := True)
1880 Current_Typ : Entity_Id := T;
1881 Parent_Typ : Entity_Id;
1884 List := New_Elmt_List;
1886 -- No action if the if the type has no parents
1888 if T = Etype (T) then
1893 Parent_Typ := Etype (Current_Typ);
1895 if Is_Private_Type (Parent_Typ)
1896 and then Present (Full_View (Parent_Typ))
1897 and then Use_Full_View
1899 Parent_Typ := Full_View (Base_Type (Parent_Typ));
1902 Append_Elmt (Parent_Typ, List);
1904 exit when Parent_Typ = Current_Typ;
1905 Current_Typ := Parent_Typ;
1907 end Collect_Parents;
1909 ----------------------------------
1910 -- Collect_Primitive_Operations --
1911 ----------------------------------
1913 function Collect_Primitive_Operations (T : Entity_Id) return Elist_Id is
1914 B_Type : constant Entity_Id := Base_Type (T);
1915 B_Decl : constant Node_Id := Original_Node (Parent (B_Type));
1916 B_Scope : Entity_Id := Scope (B_Type);
1920 Formal_Derived : Boolean := False;
1923 function Match (E : Entity_Id) return Boolean;
1924 -- True if E's base type is B_Type, or E is of an anonymous access type
1925 -- and the base type of its designated type is B_Type.
1931 function Match (E : Entity_Id) return Boolean is
1932 Etyp : Entity_Id := Etype (E);
1935 if Ekind (Etyp) = E_Anonymous_Access_Type then
1936 Etyp := Designated_Type (Etyp);
1939 return Base_Type (Etyp) = B_Type;
1942 -- Start of processing for Collect_Primitive_Operations
1945 -- For tagged types, the primitive operations are collected as they
1946 -- are declared, and held in an explicit list which is simply returned.
1948 if Is_Tagged_Type (B_Type) then
1949 return Primitive_Operations (B_Type);
1951 -- An untagged generic type that is a derived type inherits the
1952 -- primitive operations of its parent type. Other formal types only
1953 -- have predefined operators, which are not explicitly represented.
1955 elsif Is_Generic_Type (B_Type) then
1956 if Nkind (B_Decl) = N_Formal_Type_Declaration
1957 and then Nkind (Formal_Type_Definition (B_Decl))
1958 = N_Formal_Derived_Type_Definition
1960 Formal_Derived := True;
1962 return New_Elmt_List;
1966 Op_List := New_Elmt_List;
1968 if B_Scope = Standard_Standard then
1969 if B_Type = Standard_String then
1970 Append_Elmt (Standard_Op_Concat, Op_List);
1972 elsif B_Type = Standard_Wide_String then
1973 Append_Elmt (Standard_Op_Concatw, Op_List);
1979 elsif (Is_Package_Or_Generic_Package (B_Scope)
1981 Nkind (Parent (Declaration_Node (First_Subtype (T)))) /=
1983 or else Is_Derived_Type (B_Type)
1985 -- The primitive operations appear after the base type, except
1986 -- if the derivation happens within the private part of B_Scope
1987 -- and the type is a private type, in which case both the type
1988 -- and some primitive operations may appear before the base
1989 -- type, and the list of candidates starts after the type.
1991 if In_Open_Scopes (B_Scope)
1992 and then Scope (T) = B_Scope
1993 and then In_Private_Part (B_Scope)
1995 Id := Next_Entity (T);
1997 Id := Next_Entity (B_Type);
2000 while Present (Id) loop
2002 -- Note that generic formal subprograms are not
2003 -- considered to be primitive operations and thus
2004 -- are never inherited.
2006 if Is_Overloadable (Id)
2007 and then Nkind (Parent (Parent (Id)))
2008 not in N_Formal_Subprogram_Declaration
2016 Formal := First_Formal (Id);
2017 while Present (Formal) loop
2018 if Match (Formal) then
2023 Next_Formal (Formal);
2027 -- For a formal derived type, the only primitives are the
2028 -- ones inherited from the parent type. Operations appearing
2029 -- in the package declaration are not primitive for it.
2032 and then (not Formal_Derived
2033 or else Present (Alias (Id)))
2035 -- In the special case of an equality operator aliased to
2036 -- an overriding dispatching equality belonging to the same
2037 -- type, we don't include it in the list of primitives.
2038 -- This avoids inheriting multiple equality operators when
2039 -- deriving from untagged private types whose full type is
2040 -- tagged, which can otherwise cause ambiguities. Note that
2041 -- this should only happen for this kind of untagged parent
2042 -- type, since normally dispatching operations are inherited
2043 -- using the type's Primitive_Operations list.
2045 if Chars (Id) = Name_Op_Eq
2046 and then Is_Dispatching_Operation (Id)
2047 and then Present (Alias (Id))
2048 and then Present (Overridden_Operation (Alias (Id)))
2049 and then Base_Type (Etype (First_Entity (Id))) =
2050 Base_Type (Etype (First_Entity (Alias (Id))))
2054 -- Include the subprogram in the list of primitives
2057 Append_Elmt (Id, Op_List);
2064 -- For a type declared in System, some of its operations may
2065 -- appear in the target-specific extension to System.
2068 and then B_Scope = RTU_Entity (System)
2069 and then Present_System_Aux
2071 B_Scope := System_Aux_Id;
2072 Id := First_Entity (System_Aux_Id);
2078 end Collect_Primitive_Operations;
2080 -----------------------------------
2081 -- Compile_Time_Constraint_Error --
2082 -----------------------------------
2084 function Compile_Time_Constraint_Error
2087 Ent : Entity_Id := Empty;
2088 Loc : Source_Ptr := No_Location;
2089 Warn : Boolean := False) return Node_Id
2091 Msgc : String (1 .. Msg'Length + 2);
2092 -- Copy of message, with room for possible ? and ! at end
2102 -- A static constraint error in an instance body is not a fatal error.
2103 -- we choose to inhibit the message altogether, because there is no
2104 -- obvious node (for now) on which to post it. On the other hand the
2105 -- offending node must be replaced with a constraint_error in any case.
2107 -- No messages are generated if we already posted an error on this node
2109 if not Error_Posted (N) then
2110 if Loc /= No_Location then
2116 Msgc (1 .. Msg'Length) := Msg;
2119 -- Message is a warning, even in Ada 95 case
2121 if Msg (Msg'Last) = '?' then
2124 -- In Ada 83, all messages are warnings. In the private part and
2125 -- the body of an instance, constraint_checks are only warnings.
2126 -- We also make this a warning if the Warn parameter is set.
2129 or else (Ada_Version = Ada_83 and then Comes_From_Source (N))
2135 elsif In_Instance_Not_Visible then
2140 -- Otherwise we have a real error message (Ada 95 static case)
2141 -- and we make this an unconditional message. Note that in the
2142 -- warning case we do not make the message unconditional, it seems
2143 -- quite reasonable to delete messages like this (about exceptions
2144 -- that will be raised) in dead code.
2152 -- Should we generate a warning? The answer is not quite yes. The
2153 -- very annoying exception occurs in the case of a short circuit
2154 -- operator where the left operand is static and decisive. Climb
2155 -- parents to see if that is the case we have here. Conditional
2156 -- expressions with decisive conditions are a similar situation.
2164 -- And then with False as left operand
2166 if Nkind (P) = N_And_Then
2167 and then Compile_Time_Known_Value (Left_Opnd (P))
2168 and then Is_False (Expr_Value (Left_Opnd (P)))
2173 -- OR ELSE with True as left operand
2175 elsif Nkind (P) = N_Or_Else
2176 and then Compile_Time_Known_Value (Left_Opnd (P))
2177 and then Is_True (Expr_Value (Left_Opnd (P)))
2182 -- Conditional expression
2184 elsif Nkind (P) = N_Conditional_Expression then
2186 Cond : constant Node_Id := First (Expressions (P));
2187 Texp : constant Node_Id := Next (Cond);
2188 Fexp : constant Node_Id := Next (Texp);
2191 if Compile_Time_Known_Value (Cond) then
2193 -- Condition is True and we are in the right operand
2195 if Is_True (Expr_Value (Cond))
2196 and then OldP = Fexp
2201 -- Condition is False and we are in the left operand
2203 elsif Is_False (Expr_Value (Cond))
2204 and then OldP = Texp
2212 -- Special case for component association in aggregates, where
2213 -- we want to keep climbing up to the parent aggregate.
2215 elsif Nkind (P) = N_Component_Association
2216 and then Nkind (Parent (P)) = N_Aggregate
2220 -- Keep going if within subexpression
2223 exit when Nkind (P) not in N_Subexpr;
2228 if Present (Ent) then
2229 Error_Msg_NEL (Msgc (1 .. Msgl), N, Ent, Eloc);
2231 Error_Msg_NEL (Msgc (1 .. Msgl), N, Etype (N), Eloc);
2235 if Inside_Init_Proc then
2237 ("\?& will be raised for objects of this type",
2238 N, Standard_Constraint_Error, Eloc);
2241 ("\?& will be raised at run time",
2242 N, Standard_Constraint_Error, Eloc);
2247 ("\static expression fails Constraint_Check", Eloc);
2248 Set_Error_Posted (N);
2254 end Compile_Time_Constraint_Error;
2256 -----------------------
2257 -- Conditional_Delay --
2258 -----------------------
2260 procedure Conditional_Delay (New_Ent, Old_Ent : Entity_Id) is
2262 if Has_Delayed_Freeze (Old_Ent) and then not Is_Frozen (Old_Ent) then
2263 Set_Has_Delayed_Freeze (New_Ent);
2265 end Conditional_Delay;
2267 -------------------------
2268 -- Copy_Parameter_List --
2269 -------------------------
2271 function Copy_Parameter_List (Subp_Id : Entity_Id) return List_Id is
2272 Loc : constant Source_Ptr := Sloc (Subp_Id);
2277 if No (First_Formal (Subp_Id)) then
2281 Formal := First_Formal (Subp_Id);
2282 while Present (Formal) loop
2284 (Make_Parameter_Specification (Loc,
2285 Defining_Identifier =>
2286 Make_Defining_Identifier (Sloc (Formal),
2287 Chars => Chars (Formal)),
2288 In_Present => In_Present (Parent (Formal)),
2289 Out_Present => Out_Present (Parent (Formal)),
2291 New_Reference_To (Etype (Formal), Loc),
2293 New_Copy_Tree (Expression (Parent (Formal)))),
2296 Next_Formal (Formal);
2301 end Copy_Parameter_List;
2303 --------------------
2304 -- Current_Entity --
2305 --------------------
2307 -- The currently visible definition for a given identifier is the
2308 -- one most chained at the start of the visibility chain, i.e. the
2309 -- one that is referenced by the Node_Id value of the name of the
2310 -- given identifier.
2312 function Current_Entity (N : Node_Id) return Entity_Id is
2314 return Get_Name_Entity_Id (Chars (N));
2317 -----------------------------
2318 -- Current_Entity_In_Scope --
2319 -----------------------------
2321 function Current_Entity_In_Scope (N : Node_Id) return Entity_Id is
2323 CS : constant Entity_Id := Current_Scope;
2325 Transient_Case : constant Boolean := Scope_Is_Transient;
2328 E := Get_Name_Entity_Id (Chars (N));
2330 and then Scope (E) /= CS
2331 and then (not Transient_Case or else Scope (E) /= Scope (CS))
2337 end Current_Entity_In_Scope;
2343 function Current_Scope return Entity_Id is
2345 if Scope_Stack.Last = -1 then
2346 return Standard_Standard;
2349 C : constant Entity_Id :=
2350 Scope_Stack.Table (Scope_Stack.Last).Entity;
2355 return Standard_Standard;
2361 ------------------------
2362 -- Current_Subprogram --
2363 ------------------------
2365 function Current_Subprogram return Entity_Id is
2366 Scop : constant Entity_Id := Current_Scope;
2368 if Is_Subprogram (Scop) or else Is_Generic_Subprogram (Scop) then
2371 return Enclosing_Subprogram (Scop);
2373 end Current_Subprogram;
2375 ----------------------------------
2376 -- Deepest_Type_Access_Level --
2377 ----------------------------------
2379 function Deepest_Type_Access_Level (Typ : Entity_Id) return Uint is
2381 if Ekind (Typ) = E_Anonymous_Access_Type
2382 and then not Is_Local_Anonymous_Access (Typ)
2383 and then Nkind (Associated_Node_For_Itype (Typ)) = N_Object_Declaration
2385 -- Typ is the type of an Ada 2012 stand-alone object of an anonymous
2389 Scope_Depth (Enclosing_Dynamic_Scope
2390 (Defining_Identifier
2391 (Associated_Node_For_Itype (Typ))));
2394 return Type_Access_Level (Typ);
2396 end Deepest_Type_Access_Level;
2398 ---------------------
2399 -- Defining_Entity --
2400 ---------------------
2402 function Defining_Entity (N : Node_Id) return Entity_Id is
2403 K : constant Node_Kind := Nkind (N);
2404 Err : Entity_Id := Empty;
2409 N_Subprogram_Declaration |
2410 N_Abstract_Subprogram_Declaration |
2412 N_Package_Declaration |
2413 N_Subprogram_Renaming_Declaration |
2414 N_Subprogram_Body_Stub |
2415 N_Generic_Subprogram_Declaration |
2416 N_Generic_Package_Declaration |
2417 N_Formal_Subprogram_Declaration
2419 return Defining_Entity (Specification (N));
2422 N_Component_Declaration |
2423 N_Defining_Program_Unit_Name |
2424 N_Discriminant_Specification |
2426 N_Entry_Declaration |
2427 N_Entry_Index_Specification |
2428 N_Exception_Declaration |
2429 N_Exception_Renaming_Declaration |
2430 N_Formal_Object_Declaration |
2431 N_Formal_Package_Declaration |
2432 N_Formal_Type_Declaration |
2433 N_Full_Type_Declaration |
2434 N_Implicit_Label_Declaration |
2435 N_Incomplete_Type_Declaration |
2436 N_Loop_Parameter_Specification |
2437 N_Number_Declaration |
2438 N_Object_Declaration |
2439 N_Object_Renaming_Declaration |
2440 N_Package_Body_Stub |
2441 N_Parameter_Specification |
2442 N_Private_Extension_Declaration |
2443 N_Private_Type_Declaration |
2445 N_Protected_Body_Stub |
2446 N_Protected_Type_Declaration |
2447 N_Single_Protected_Declaration |
2448 N_Single_Task_Declaration |
2449 N_Subtype_Declaration |
2452 N_Task_Type_Declaration
2454 return Defining_Identifier (N);
2457 return Defining_Entity (Proper_Body (N));
2460 N_Function_Instantiation |
2461 N_Function_Specification |
2462 N_Generic_Function_Renaming_Declaration |
2463 N_Generic_Package_Renaming_Declaration |
2464 N_Generic_Procedure_Renaming_Declaration |
2466 N_Package_Instantiation |
2467 N_Package_Renaming_Declaration |
2468 N_Package_Specification |
2469 N_Procedure_Instantiation |
2470 N_Procedure_Specification
2473 Nam : constant Node_Id := Defining_Unit_Name (N);
2476 if Nkind (Nam) in N_Entity then
2479 -- For Error, make up a name and attach to declaration
2480 -- so we can continue semantic analysis
2482 elsif Nam = Error then
2483 Err := Make_Temporary (Sloc (N), 'T');
2484 Set_Defining_Unit_Name (N, Err);
2487 -- If not an entity, get defining identifier
2490 return Defining_Identifier (Nam);
2494 when N_Block_Statement =>
2495 return Entity (Identifier (N));
2498 raise Program_Error;
2501 end Defining_Entity;
2503 --------------------------
2504 -- Denotes_Discriminant --
2505 --------------------------
2507 function Denotes_Discriminant
2509 Check_Concurrent : Boolean := False) return Boolean
2513 if not Is_Entity_Name (N)
2514 or else No (Entity (N))
2521 -- If we are checking for a protected type, the discriminant may have
2522 -- been rewritten as the corresponding discriminal of the original type
2523 -- or of the corresponding concurrent record, depending on whether we
2524 -- are in the spec or body of the protected type.
2526 return Ekind (E) = E_Discriminant
2529 and then Ekind (E) = E_In_Parameter
2530 and then Present (Discriminal_Link (E))
2532 (Is_Concurrent_Type (Scope (Discriminal_Link (E)))
2534 Is_Concurrent_Record_Type (Scope (Discriminal_Link (E)))));
2536 end Denotes_Discriminant;
2538 -------------------------
2539 -- Denotes_Same_Object --
2540 -------------------------
2542 function Denotes_Same_Object (A1, A2 : Node_Id) return Boolean is
2543 Obj1 : Node_Id := A1;
2544 Obj2 : Node_Id := A2;
2546 procedure Check_Renaming (Obj : in out Node_Id);
2547 -- If an object is a renaming, examine renamed object. If it is a
2548 -- dereference of a variable, or an indexed expression with non-constant
2549 -- indexes, no overlap check can be reported.
2551 --------------------
2552 -- Check_Renaming --
2553 --------------------
2555 procedure Check_Renaming (Obj : in out Node_Id) is
2557 if Is_Entity_Name (Obj)
2558 and then Present (Renamed_Entity (Entity (Obj)))
2560 Obj := Renamed_Entity (Entity (Obj));
2561 if Nkind (Obj) = N_Explicit_Dereference
2562 and then Is_Variable (Prefix (Obj))
2566 elsif Nkind (Obj) = N_Indexed_Component then
2571 Indx := First (Expressions (Obj));
2572 while Present (Indx) loop
2573 if not Is_OK_Static_Expression (Indx) then
2585 -- Start of processing for Denotes_Same_Object
2588 Check_Renaming (Obj1);
2589 Check_Renaming (Obj2);
2597 -- If we have entity names, then must be same entity
2599 if Is_Entity_Name (Obj1) then
2600 if Is_Entity_Name (Obj2) then
2601 return Entity (Obj1) = Entity (Obj2);
2606 -- No match if not same node kind
2608 elsif Nkind (Obj1) /= Nkind (Obj2) then
2611 -- For selected components, must have same prefix and selector
2613 elsif Nkind (Obj1) = N_Selected_Component then
2614 return Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2))
2616 Entity (Selector_Name (Obj1)) = Entity (Selector_Name (Obj2));
2618 -- For explicit dereferences, prefixes must be same
2620 elsif Nkind (Obj1) = N_Explicit_Dereference then
2621 return Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2));
2623 -- For indexed components, prefixes and all subscripts must be the same
2625 elsif Nkind (Obj1) = N_Indexed_Component then
2626 if Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2)) then
2632 Indx1 := First (Expressions (Obj1));
2633 Indx2 := First (Expressions (Obj2));
2634 while Present (Indx1) loop
2636 -- Indexes must denote the same static value or same object
2638 if Is_OK_Static_Expression (Indx1) then
2639 if not Is_OK_Static_Expression (Indx2) then
2642 elsif Expr_Value (Indx1) /= Expr_Value (Indx2) then
2646 elsif not Denotes_Same_Object (Indx1, Indx2) then
2660 -- For slices, prefixes must match and bounds must match
2662 elsif Nkind (Obj1) = N_Slice
2663 and then Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2))
2666 Lo1, Lo2, Hi1, Hi2 : Node_Id;
2669 Get_Index_Bounds (Etype (Obj1), Lo1, Hi1);
2670 Get_Index_Bounds (Etype (Obj2), Lo2, Hi2);
2672 -- Check whether bounds are statically identical. There is no
2673 -- attempt to detect partial overlap of slices.
2675 return Denotes_Same_Object (Lo1, Lo2)
2676 and then Denotes_Same_Object (Hi1, Hi2);
2679 -- Literals will appear as indexes. Isn't this where we should check
2680 -- Known_At_Compile_Time at least if we are generating warnings ???
2682 elsif Nkind (Obj1) = N_Integer_Literal then
2683 return Intval (Obj1) = Intval (Obj2);
2688 end Denotes_Same_Object;
2690 -------------------------
2691 -- Denotes_Same_Prefix --
2692 -------------------------
2694 function Denotes_Same_Prefix (A1, A2 : Node_Id) return Boolean is
2697 if Is_Entity_Name (A1) then
2698 if Nkind_In (A2, N_Selected_Component, N_Indexed_Component)
2699 and then not Is_Access_Type (Etype (A1))
2701 return Denotes_Same_Object (A1, Prefix (A2))
2702 or else Denotes_Same_Prefix (A1, Prefix (A2));
2707 elsif Is_Entity_Name (A2) then
2708 return Denotes_Same_Prefix (A2, A1);
2710 elsif Nkind_In (A1, N_Selected_Component, N_Indexed_Component, N_Slice)
2712 Nkind_In (A2, N_Selected_Component, N_Indexed_Component, N_Slice)
2715 Root1, Root2 : Node_Id;
2716 Depth1, Depth2 : Int := 0;
2719 Root1 := Prefix (A1);
2720 while not Is_Entity_Name (Root1) loop
2722 (Root1, N_Selected_Component, N_Indexed_Component)
2726 Root1 := Prefix (Root1);
2729 Depth1 := Depth1 + 1;
2732 Root2 := Prefix (A2);
2733 while not Is_Entity_Name (Root2) loop
2735 (Root2, N_Selected_Component, N_Indexed_Component)
2739 Root2 := Prefix (Root2);
2742 Depth2 := Depth2 + 1;
2745 -- If both have the same depth and they do not denote the same
2746 -- object, they are disjoint and not warning is needed.
2748 if Depth1 = Depth2 then
2751 elsif Depth1 > Depth2 then
2752 Root1 := Prefix (A1);
2753 for I in 1 .. Depth1 - Depth2 - 1 loop
2754 Root1 := Prefix (Root1);
2757 return Denotes_Same_Object (Root1, A2);
2760 Root2 := Prefix (A2);
2761 for I in 1 .. Depth2 - Depth1 - 1 loop
2762 Root2 := Prefix (Root2);
2765 return Denotes_Same_Object (A1, Root2);
2772 end Denotes_Same_Prefix;
2774 ----------------------
2775 -- Denotes_Variable --
2776 ----------------------
2778 function Denotes_Variable (N : Node_Id) return Boolean is
2780 return Is_Variable (N) and then Paren_Count (N) = 0;
2781 end Denotes_Variable;
2783 -----------------------------
2784 -- Depends_On_Discriminant --
2785 -----------------------------
2787 function Depends_On_Discriminant (N : Node_Id) return Boolean is
2792 Get_Index_Bounds (N, L, H);
2793 return Denotes_Discriminant (L) or else Denotes_Discriminant (H);
2794 end Depends_On_Discriminant;
2796 -------------------------
2797 -- Designate_Same_Unit --
2798 -------------------------
2800 function Designate_Same_Unit
2802 Name2 : Node_Id) return Boolean
2804 K1 : constant Node_Kind := Nkind (Name1);
2805 K2 : constant Node_Kind := Nkind (Name2);
2807 function Prefix_Node (N : Node_Id) return Node_Id;
2808 -- Returns the parent unit name node of a defining program unit name
2809 -- or the prefix if N is a selected component or an expanded name.
2811 function Select_Node (N : Node_Id) return Node_Id;
2812 -- Returns the defining identifier node of a defining program unit
2813 -- name or the selector node if N is a selected component or an
2820 function Prefix_Node (N : Node_Id) return Node_Id is
2822 if Nkind (N) = N_Defining_Program_Unit_Name then
2834 function Select_Node (N : Node_Id) return Node_Id is
2836 if Nkind (N) = N_Defining_Program_Unit_Name then
2837 return Defining_Identifier (N);
2840 return Selector_Name (N);
2844 -- Start of processing for Designate_Next_Unit
2847 if (K1 = N_Identifier or else
2848 K1 = N_Defining_Identifier)
2850 (K2 = N_Identifier or else
2851 K2 = N_Defining_Identifier)
2853 return Chars (Name1) = Chars (Name2);
2856 (K1 = N_Expanded_Name or else
2857 K1 = N_Selected_Component or else
2858 K1 = N_Defining_Program_Unit_Name)
2860 (K2 = N_Expanded_Name or else
2861 K2 = N_Selected_Component or else
2862 K2 = N_Defining_Program_Unit_Name)
2865 (Chars (Select_Node (Name1)) = Chars (Select_Node (Name2)))
2867 Designate_Same_Unit (Prefix_Node (Name1), Prefix_Node (Name2));
2872 end Designate_Same_Unit;
2874 ------------------------------------------
2875 -- function Dynamic_Accessibility_Level --
2876 ------------------------------------------
2878 function Dynamic_Accessibility_Level (Expr : Node_Id) return Node_Id is
2880 Loc : constant Source_Ptr := Sloc (Expr);
2882 function Make_Level_Literal (Level : Uint) return Node_Id;
2883 -- Construct an integer literal representing an accessibility level
2884 -- with its type set to Natural.
2886 ------------------------
2887 -- Make_Level_Literal --
2888 ------------------------
2890 function Make_Level_Literal (Level : Uint) return Node_Id is
2891 Result : constant Node_Id := Make_Integer_Literal (Loc, Level);
2893 Set_Etype (Result, Standard_Natural);
2895 end Make_Level_Literal;
2897 -- Start of processing for Dynamic_Accessibility_Level
2900 if Is_Entity_Name (Expr) then
2903 if Present (Renamed_Object (E)) then
2904 return Dynamic_Accessibility_Level (Renamed_Object (E));
2907 if Is_Formal (E) or else Ekind_In (E, E_Variable, E_Constant) then
2908 if Present (Extra_Accessibility (E)) then
2909 return New_Occurrence_Of (Extra_Accessibility (E), Loc);
2914 -- Unimplemented: Ptr.all'Access, where Ptr has Extra_Accessibility ???
2916 case Nkind (Expr) is
2918 -- For access discriminant, the level of the enclosing object
2920 when N_Selected_Component =>
2921 if Ekind (Entity (Selector_Name (Expr))) = E_Discriminant
2922 and then Ekind (Etype (Entity (Selector_Name (Expr)))) =
2923 E_Anonymous_Access_Type
2925 return Make_Level_Literal (Object_Access_Level (Expr));
2928 when N_Attribute_Reference =>
2929 case Get_Attribute_Id (Attribute_Name (Expr)) is
2931 -- For X'Access, the level of the prefix X
2933 when Attribute_Access =>
2934 return Make_Level_Literal
2935 (Object_Access_Level (Prefix (Expr)));
2937 -- Treat the unchecked attributes as library-level
2939 when Attribute_Unchecked_Access |
2940 Attribute_Unrestricted_Access =>
2941 return Make_Level_Literal (Scope_Depth (Standard_Standard));
2943 -- No other access-valued attributes
2946 raise Program_Error;
2951 -- Unimplemented: depends on context. As an actual parameter where
2952 -- formal type is anonymous, use
2953 -- Scope_Depth (Current_Scope) + 1.
2954 -- For other cases, see 3.10.2(14/3) and following. ???
2958 when N_Type_Conversion =>
2959 if not Is_Local_Anonymous_Access (Etype (Expr)) then
2961 -- Handle type conversions introduced for a rename of an
2962 -- Ada2012 stand-alone object of an anonymous access type.
2964 return Dynamic_Accessibility_Level (Expression (Expr));
2971 return Make_Level_Literal (Type_Access_Level (Etype (Expr)));
2972 end Dynamic_Accessibility_Level;
2974 -----------------------------------
2975 -- Effective_Extra_Accessibility --
2976 -----------------------------------
2978 function Effective_Extra_Accessibility (Id : Entity_Id) return Entity_Id is
2980 if Present (Renamed_Object (Id))
2981 and then Is_Entity_Name (Renamed_Object (Id)) then
2982 return Effective_Extra_Accessibility (Entity (Renamed_Object (Id)));
2985 return Extra_Accessibility (Id);
2986 end Effective_Extra_Accessibility;
2988 --------------------------
2989 -- Enclosing_CPP_Parent --
2990 --------------------------
2992 function Enclosing_CPP_Parent (Typ : Entity_Id) return Entity_Id is
2993 Parent_Typ : Entity_Id := Typ;
2996 while not Is_CPP_Class (Parent_Typ)
2997 and then Etype (Parent_Typ) /= Parent_Typ
2999 Parent_Typ := Etype (Parent_Typ);
3001 if Is_Private_Type (Parent_Typ) then
3002 Parent_Typ := Full_View (Base_Type (Parent_Typ));
3006 pragma Assert (Is_CPP_Class (Parent_Typ));
3008 end Enclosing_CPP_Parent;
3010 ----------------------------
3011 -- Enclosing_Generic_Body --
3012 ----------------------------
3014 function Enclosing_Generic_Body
3015 (N : Node_Id) return Node_Id
3023 while Present (P) loop
3024 if Nkind (P) = N_Package_Body
3025 or else Nkind (P) = N_Subprogram_Body
3027 Spec := Corresponding_Spec (P);
3029 if Present (Spec) then
3030 Decl := Unit_Declaration_Node (Spec);
3032 if Nkind (Decl) = N_Generic_Package_Declaration
3033 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
3044 end Enclosing_Generic_Body;
3046 ----------------------------
3047 -- Enclosing_Generic_Unit --
3048 ----------------------------
3050 function Enclosing_Generic_Unit
3051 (N : Node_Id) return Node_Id
3059 while Present (P) loop
3060 if Nkind (P) = N_Generic_Package_Declaration
3061 or else Nkind (P) = N_Generic_Subprogram_Declaration
3065 elsif Nkind (P) = N_Package_Body
3066 or else Nkind (P) = N_Subprogram_Body
3068 Spec := Corresponding_Spec (P);
3070 if Present (Spec) then
3071 Decl := Unit_Declaration_Node (Spec);
3073 if Nkind (Decl) = N_Generic_Package_Declaration
3074 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
3085 end Enclosing_Generic_Unit;
3087 -------------------------------
3088 -- Enclosing_Lib_Unit_Entity --
3089 -------------------------------
3091 function Enclosing_Lib_Unit_Entity return Entity_Id is
3092 Unit_Entity : Entity_Id;
3095 -- Look for enclosing library unit entity by following scope links.
3096 -- Equivalent to, but faster than indexing through the scope stack.
3098 Unit_Entity := Current_Scope;
3099 while (Present (Scope (Unit_Entity))
3100 and then Scope (Unit_Entity) /= Standard_Standard)
3101 and not Is_Child_Unit (Unit_Entity)
3103 Unit_Entity := Scope (Unit_Entity);
3107 end Enclosing_Lib_Unit_Entity;
3109 -----------------------------
3110 -- Enclosing_Lib_Unit_Node --
3111 -----------------------------
3113 function Enclosing_Lib_Unit_Node (N : Node_Id) return Node_Id is
3114 Current_Node : Node_Id;
3118 while Present (Current_Node)
3119 and then Nkind (Current_Node) /= N_Compilation_Unit
3121 Current_Node := Parent (Current_Node);
3124 if Nkind (Current_Node) /= N_Compilation_Unit then
3128 return Current_Node;
3129 end Enclosing_Lib_Unit_Node;
3131 -----------------------
3132 -- Enclosing_Package --
3133 -----------------------
3135 function Enclosing_Package (E : Entity_Id) return Entity_Id is
3136 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
3139 if Dynamic_Scope = Standard_Standard then
3140 return Standard_Standard;
3142 elsif Dynamic_Scope = Empty then
3145 elsif Ekind_In (Dynamic_Scope, E_Package, E_Package_Body,
3148 return Dynamic_Scope;
3151 return Enclosing_Package (Dynamic_Scope);
3153 end Enclosing_Package;
3155 --------------------------
3156 -- Enclosing_Subprogram --
3157 --------------------------
3159 function Enclosing_Subprogram (E : Entity_Id) return Entity_Id is
3160 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
3163 if Dynamic_Scope = Standard_Standard then
3166 elsif Dynamic_Scope = Empty then
3169 elsif Ekind (Dynamic_Scope) = E_Subprogram_Body then
3170 return Corresponding_Spec (Parent (Parent (Dynamic_Scope)));
3172 elsif Ekind (Dynamic_Scope) = E_Block
3173 or else Ekind (Dynamic_Scope) = E_Return_Statement
3175 return Enclosing_Subprogram (Dynamic_Scope);
3177 elsif Ekind (Dynamic_Scope) = E_Task_Type then
3178 return Get_Task_Body_Procedure (Dynamic_Scope);
3180 elsif Ekind (Dynamic_Scope) = E_Limited_Private_Type
3181 and then Present (Full_View (Dynamic_Scope))
3182 and then Ekind (Full_View (Dynamic_Scope)) = E_Task_Type
3184 return Get_Task_Body_Procedure (Full_View (Dynamic_Scope));
3186 -- No body is generated if the protected operation is eliminated
3188 elsif Convention (Dynamic_Scope) = Convention_Protected
3189 and then not Is_Eliminated (Dynamic_Scope)
3190 and then Present (Protected_Body_Subprogram (Dynamic_Scope))
3192 return Protected_Body_Subprogram (Dynamic_Scope);
3195 return Dynamic_Scope;
3197 end Enclosing_Subprogram;
3199 ------------------------
3200 -- Ensure_Freeze_Node --
3201 ------------------------
3203 procedure Ensure_Freeze_Node (E : Entity_Id) is
3207 if No (Freeze_Node (E)) then
3208 FN := Make_Freeze_Entity (Sloc (E));
3209 Set_Has_Delayed_Freeze (E);
3210 Set_Freeze_Node (E, FN);
3211 Set_Access_Types_To_Process (FN, No_Elist);
3212 Set_TSS_Elist (FN, No_Elist);
3215 end Ensure_Freeze_Node;
3221 procedure Enter_Name (Def_Id : Entity_Id) is
3222 C : constant Entity_Id := Current_Entity (Def_Id);
3223 E : constant Entity_Id := Current_Entity_In_Scope (Def_Id);
3224 S : constant Entity_Id := Current_Scope;
3227 Generate_Definition (Def_Id);
3229 -- Add new name to current scope declarations. Check for duplicate
3230 -- declaration, which may or may not be a genuine error.
3234 -- Case of previous entity entered because of a missing declaration
3235 -- or else a bad subtype indication. Best is to use the new entity,
3236 -- and make the previous one invisible.
3238 if Etype (E) = Any_Type then
3239 Set_Is_Immediately_Visible (E, False);
3241 -- Case of renaming declaration constructed for package instances.
3242 -- if there is an explicit declaration with the same identifier,
3243 -- the renaming is not immediately visible any longer, but remains
3244 -- visible through selected component notation.
3246 elsif Nkind (Parent (E)) = N_Package_Renaming_Declaration
3247 and then not Comes_From_Source (E)
3249 Set_Is_Immediately_Visible (E, False);
3251 -- The new entity may be the package renaming, which has the same
3252 -- same name as a generic formal which has been seen already.
3254 elsif Nkind (Parent (Def_Id)) = N_Package_Renaming_Declaration
3255 and then not Comes_From_Source (Def_Id)
3257 Set_Is_Immediately_Visible (E, False);
3259 -- For a fat pointer corresponding to a remote access to subprogram,
3260 -- we use the same identifier as the RAS type, so that the proper
3261 -- name appears in the stub. This type is only retrieved through
3262 -- the RAS type and never by visibility, and is not added to the
3263 -- visibility list (see below).
3265 elsif Nkind (Parent (Def_Id)) = N_Full_Type_Declaration
3266 and then Present (Corresponding_Remote_Type (Def_Id))
3270 -- Case of an implicit operation or derived literal. The new entity
3271 -- hides the implicit one, which is removed from all visibility,
3272 -- i.e. the entity list of its scope, and homonym chain of its name.
3274 elsif (Is_Overloadable (E) and then Is_Inherited_Operation (E))
3275 or else Is_Internal (E)
3279 Prev_Vis : Entity_Id;
3280 Decl : constant Node_Id := Parent (E);
3283 -- If E is an implicit declaration, it cannot be the first
3284 -- entity in the scope.
3286 Prev := First_Entity (Current_Scope);
3287 while Present (Prev)
3288 and then Next_Entity (Prev) /= E
3295 -- If E is not on the entity chain of the current scope,
3296 -- it is an implicit declaration in the generic formal
3297 -- part of a generic subprogram. When analyzing the body,
3298 -- the generic formals are visible but not on the entity
3299 -- chain of the subprogram. The new entity will become
3300 -- the visible one in the body.
3303 (Nkind (Parent (Decl)) = N_Generic_Subprogram_Declaration);
3307 Set_Next_Entity (Prev, Next_Entity (E));
3309 if No (Next_Entity (Prev)) then
3310 Set_Last_Entity (Current_Scope, Prev);
3313 if E = Current_Entity (E) then
3317 Prev_Vis := Current_Entity (E);
3318 while Homonym (Prev_Vis) /= E loop
3319 Prev_Vis := Homonym (Prev_Vis);
3323 if Present (Prev_Vis) then
3325 -- Skip E in the visibility chain
3327 Set_Homonym (Prev_Vis, Homonym (E));
3330 Set_Name_Entity_Id (Chars (E), Homonym (E));
3335 -- This section of code could use a comment ???
3337 elsif Present (Etype (E))
3338 and then Is_Concurrent_Type (Etype (E))
3343 -- If the homograph is a protected component renaming, it should not
3344 -- be hiding the current entity. Such renamings are treated as weak
3347 elsif Is_Prival (E) then
3348 Set_Is_Immediately_Visible (E, False);
3350 -- In this case the current entity is a protected component renaming.
3351 -- Perform minimal decoration by setting the scope and return since
3352 -- the prival should not be hiding other visible entities.
3354 elsif Is_Prival (Def_Id) then
3355 Set_Scope (Def_Id, Current_Scope);
3358 -- Analogous to privals, the discriminal generated for an entry index
3359 -- parameter acts as a weak declaration. Perform minimal decoration
3360 -- to avoid bogus errors.
3362 elsif Is_Discriminal (Def_Id)
3363 and then Ekind (Discriminal_Link (Def_Id)) = E_Entry_Index_Parameter
3365 Set_Scope (Def_Id, Current_Scope);
3368 -- In the body or private part of an instance, a type extension may
3369 -- introduce a component with the same name as that of an actual. The
3370 -- legality rule is not enforced, but the semantics of the full type
3371 -- with two components of same name are not clear at this point???
3373 elsif In_Instance_Not_Visible then
3376 -- When compiling a package body, some child units may have become
3377 -- visible. They cannot conflict with local entities that hide them.
3379 elsif Is_Child_Unit (E)
3380 and then In_Open_Scopes (Scope (E))
3381 and then not Is_Immediately_Visible (E)
3385 -- Conversely, with front-end inlining we may compile the parent body
3386 -- first, and a child unit subsequently. The context is now the
3387 -- parent spec, and body entities are not visible.
3389 elsif Is_Child_Unit (Def_Id)
3390 and then Is_Package_Body_Entity (E)
3391 and then not In_Package_Body (Current_Scope)
3395 -- Case of genuine duplicate declaration
3398 Error_Msg_Sloc := Sloc (E);
3400 -- If the previous declaration is an incomplete type declaration
3401 -- this may be an attempt to complete it with a private type. The
3402 -- following avoids confusing cascaded errors.
3404 if Nkind (Parent (E)) = N_Incomplete_Type_Declaration
3405 and then Nkind (Parent (Def_Id)) = N_Private_Type_Declaration
3408 ("incomplete type cannot be completed with a private " &
3409 "declaration", Parent (Def_Id));
3410 Set_Is_Immediately_Visible (E, False);
3411 Set_Full_View (E, Def_Id);
3413 -- An inherited component of a record conflicts with a new
3414 -- discriminant. The discriminant is inserted first in the scope,
3415 -- but the error should be posted on it, not on the component.
3417 elsif Ekind (E) = E_Discriminant
3418 and then Present (Scope (Def_Id))
3419 and then Scope (Def_Id) /= Current_Scope
3421 Error_Msg_Sloc := Sloc (Def_Id);
3422 Error_Msg_N ("& conflicts with declaration#", E);
3425 -- If the name of the unit appears in its own context clause, a
3426 -- dummy package with the name has already been created, and the
3427 -- error emitted. Try to continue quietly.
3429 elsif Error_Posted (E)
3430 and then Sloc (E) = No_Location
3431 and then Nkind (Parent (E)) = N_Package_Specification
3432 and then Current_Scope = Standard_Standard
3434 Set_Scope (Def_Id, Current_Scope);
3438 Error_Msg_N ("& conflicts with declaration#", Def_Id);
3440 -- Avoid cascaded messages with duplicate components in
3443 if Ekind_In (E, E_Component, E_Discriminant) then
3448 if Nkind (Parent (Parent (Def_Id))) =
3449 N_Generic_Subprogram_Declaration
3451 Defining_Entity (Specification (Parent (Parent (Def_Id))))
3453 Error_Msg_N ("\generic units cannot be overloaded", Def_Id);
3456 -- If entity is in standard, then we are in trouble, because it
3457 -- means that we have a library package with a duplicated name.
3458 -- That's hard to recover from, so abort!
3460 if S = Standard_Standard then
3461 raise Unrecoverable_Error;
3463 -- Otherwise we continue with the declaration. Having two
3464 -- identical declarations should not cause us too much trouble!
3472 -- If we fall through, declaration is OK, at least OK enough to continue
3474 -- If Def_Id is a discriminant or a record component we are in the midst
3475 -- of inheriting components in a derived record definition. Preserve
3476 -- their Ekind and Etype.
3478 if Ekind_In (Def_Id, E_Discriminant, E_Component) then
3481 -- If a type is already set, leave it alone (happens when a type
3482 -- declaration is reanalyzed following a call to the optimizer).
3484 elsif Present (Etype (Def_Id)) then
3487 -- Otherwise, the kind E_Void insures that premature uses of the entity
3488 -- will be detected. Any_Type insures that no cascaded errors will occur
3491 Set_Ekind (Def_Id, E_Void);
3492 Set_Etype (Def_Id, Any_Type);
3495 -- Inherited discriminants and components in derived record types are
3496 -- immediately visible. Itypes are not.
3498 if Ekind_In (Def_Id, E_Discriminant, E_Component)
3499 or else (No (Corresponding_Remote_Type (Def_Id))
3500 and then not Is_Itype (Def_Id))
3502 Set_Is_Immediately_Visible (Def_Id);
3503 Set_Current_Entity (Def_Id);
3506 Set_Homonym (Def_Id, C);
3507 Append_Entity (Def_Id, S);
3508 Set_Public_Status (Def_Id);
3510 -- Declaring a homonym is not allowed in SPARK ...
3513 and then Restriction_Check_Required (SPARK)
3517 Enclosing_Subp : constant Node_Id := Enclosing_Subprogram (Def_Id);
3518 Enclosing_Pack : constant Node_Id := Enclosing_Package (Def_Id);
3519 Other_Scope : constant Node_Id := Enclosing_Dynamic_Scope (C);
3522 -- ... unless the new declaration is in a subprogram, and the
3523 -- visible declaration is a variable declaration or a parameter
3524 -- specification outside that subprogram.
3526 if Present (Enclosing_Subp)
3527 and then Nkind_In (Parent (C), N_Object_Declaration,
3528 N_Parameter_Specification)
3529 and then not Scope_Within_Or_Same (Other_Scope, Enclosing_Subp)
3533 -- ... or the new declaration is in a package, and the visible
3534 -- declaration occurs outside that package.
3536 elsif Present (Enclosing_Pack)
3537 and then not Scope_Within_Or_Same (Other_Scope, Enclosing_Pack)
3541 -- ... or the new declaration is a component declaration in a
3542 -- record type definition.
3544 elsif Nkind (Parent (Def_Id)) = N_Component_Declaration then
3547 -- Don't issue error for non-source entities
3549 elsif Comes_From_Source (Def_Id)
3550 and then Comes_From_Source (C)
3552 Error_Msg_Sloc := Sloc (C);
3553 Check_SPARK_Restriction
3554 ("redeclaration of identifier &#", Def_Id);
3559 -- Warn if new entity hides an old one
3561 if Warn_On_Hiding and then Present (C)
3563 -- Don't warn for record components since they always have a well
3564 -- defined scope which does not confuse other uses. Note that in
3565 -- some cases, Ekind has not been set yet.
3567 and then Ekind (C) /= E_Component
3568 and then Ekind (C) /= E_Discriminant
3569 and then Nkind (Parent (C)) /= N_Component_Declaration
3570 and then Ekind (Def_Id) /= E_Component
3571 and then Ekind (Def_Id) /= E_Discriminant
3572 and then Nkind (Parent (Def_Id)) /= N_Component_Declaration
3574 -- Don't warn for one character variables. It is too common to use
3575 -- such variables as locals and will just cause too many false hits.
3577 and then Length_Of_Name (Chars (C)) /= 1
3579 -- Don't warn for non-source entities
3581 and then Comes_From_Source (C)
3582 and then Comes_From_Source (Def_Id)
3584 -- Don't warn unless entity in question is in extended main source
3586 and then In_Extended_Main_Source_Unit (Def_Id)
3588 -- Finally, the hidden entity must be either immediately visible or
3589 -- use visible (i.e. from a used package).
3592 (Is_Immediately_Visible (C)
3594 Is_Potentially_Use_Visible (C))
3596 Error_Msg_Sloc := Sloc (C);
3597 Error_Msg_N ("declaration hides &#?", Def_Id);
3601 --------------------------
3602 -- Explain_Limited_Type --
3603 --------------------------
3605 procedure Explain_Limited_Type (T : Entity_Id; N : Node_Id) is
3609 -- For array, component type must be limited
3611 if Is_Array_Type (T) then
3612 Error_Msg_Node_2 := T;
3614 ("\component type& of type& is limited", N, Component_Type (T));
3615 Explain_Limited_Type (Component_Type (T), N);
3617 elsif Is_Record_Type (T) then
3619 -- No need for extra messages if explicit limited record
3621 if Is_Limited_Record (Base_Type (T)) then
3625 -- Otherwise find a limited component. Check only components that
3626 -- come from source, or inherited components that appear in the
3627 -- source of the ancestor.
3629 C := First_Component (T);
3630 while Present (C) loop
3631 if Is_Limited_Type (Etype (C))
3633 (Comes_From_Source (C)
3635 (Present (Original_Record_Component (C))
3637 Comes_From_Source (Original_Record_Component (C))))
3639 Error_Msg_Node_2 := T;
3640 Error_Msg_NE ("\component& of type& has limited type", N, C);
3641 Explain_Limited_Type (Etype (C), N);
3648 -- The type may be declared explicitly limited, even if no component
3649 -- of it is limited, in which case we fall out of the loop.
3652 end Explain_Limited_Type;
3658 procedure Find_Actual
3660 Formal : out Entity_Id;
3663 Parnt : constant Node_Id := Parent (N);
3667 if (Nkind (Parnt) = N_Indexed_Component
3669 Nkind (Parnt) = N_Selected_Component)
3670 and then N = Prefix (Parnt)
3672 Find_Actual (Parnt, Formal, Call);
3675 elsif Nkind (Parnt) = N_Parameter_Association
3676 and then N = Explicit_Actual_Parameter (Parnt)
3678 Call := Parent (Parnt);
3680 elsif Nkind_In (Parnt, N_Procedure_Call_Statement, N_Function_Call) then
3689 -- If we have a call to a subprogram look for the parameter. Note that
3690 -- we exclude overloaded calls, since we don't know enough to be sure
3691 -- of giving the right answer in this case.
3693 if Is_Entity_Name (Name (Call))
3694 and then Present (Entity (Name (Call)))
3695 and then Is_Overloadable (Entity (Name (Call)))
3696 and then not Is_Overloaded (Name (Call))
3698 -- Fall here if we are definitely a parameter
3700 Actual := First_Actual (Call);
3701 Formal := First_Formal (Entity (Name (Call)));
3702 while Present (Formal) and then Present (Actual) loop
3706 Actual := Next_Actual (Actual);
3707 Formal := Next_Formal (Formal);
3712 -- Fall through here if we did not find matching actual
3718 ---------------------------
3719 -- Find_Body_Discriminal --
3720 ---------------------------
3722 function Find_Body_Discriminal
3723 (Spec_Discriminant : Entity_Id) return Entity_Id
3729 -- If expansion is suppressed, then the scope can be the concurrent type
3730 -- itself rather than a corresponding concurrent record type.
3732 if Is_Concurrent_Type (Scope (Spec_Discriminant)) then
3733 Tsk := Scope (Spec_Discriminant);
3736 pragma Assert (Is_Concurrent_Record_Type (Scope (Spec_Discriminant)));
3738 Tsk := Corresponding_Concurrent_Type (Scope (Spec_Discriminant));
3741 -- Find discriminant of original concurrent type, and use its current
3742 -- discriminal, which is the renaming within the task/protected body.
3744 Disc := First_Discriminant (Tsk);
3745 while Present (Disc) loop
3746 if Chars (Disc) = Chars (Spec_Discriminant) then
3747 return Discriminal (Disc);
3750 Next_Discriminant (Disc);
3753 -- That loop should always succeed in finding a matching entry and
3754 -- returning. Fatal error if not.
3756 raise Program_Error;
3757 end Find_Body_Discriminal;
3759 -------------------------------------
3760 -- Find_Corresponding_Discriminant --
3761 -------------------------------------
3763 function Find_Corresponding_Discriminant
3765 Typ : Entity_Id) return Entity_Id
3767 Par_Disc : Entity_Id;
3768 Old_Disc : Entity_Id;
3769 New_Disc : Entity_Id;
3772 Par_Disc := Original_Record_Component (Original_Discriminant (Id));
3774 -- The original type may currently be private, and the discriminant
3775 -- only appear on its full view.
3777 if Is_Private_Type (Scope (Par_Disc))
3778 and then not Has_Discriminants (Scope (Par_Disc))
3779 and then Present (Full_View (Scope (Par_Disc)))
3781 Old_Disc := First_Discriminant (Full_View (Scope (Par_Disc)));
3783 Old_Disc := First_Discriminant (Scope (Par_Disc));
3786 if Is_Class_Wide_Type (Typ) then
3787 New_Disc := First_Discriminant (Root_Type (Typ));
3789 New_Disc := First_Discriminant (Typ);
3792 while Present (Old_Disc) and then Present (New_Disc) loop
3793 if Old_Disc = Par_Disc then
3796 Next_Discriminant (Old_Disc);
3797 Next_Discriminant (New_Disc);
3801 -- Should always find it
3803 raise Program_Error;
3804 end Find_Corresponding_Discriminant;
3806 --------------------------
3807 -- Find_Overlaid_Entity --
3808 --------------------------
3810 procedure Find_Overlaid_Entity
3812 Ent : out Entity_Id;
3818 -- We are looking for one of the two following forms:
3820 -- for X'Address use Y'Address
3824 -- Const : constant Address := expr;
3826 -- for X'Address use Const;
3828 -- In the second case, the expr is either Y'Address, or recursively a
3829 -- constant that eventually references Y'Address.
3834 if Nkind (N) = N_Attribute_Definition_Clause
3835 and then Chars (N) = Name_Address
3837 Expr := Expression (N);
3839 -- This loop checks the form of the expression for Y'Address,
3840 -- using recursion to deal with intermediate constants.
3843 -- Check for Y'Address
3845 if Nkind (Expr) = N_Attribute_Reference
3846 and then Attribute_Name (Expr) = Name_Address
3848 Expr := Prefix (Expr);
3851 -- Check for Const where Const is a constant entity
3853 elsif Is_Entity_Name (Expr)
3854 and then Ekind (Entity (Expr)) = E_Constant
3856 Expr := Constant_Value (Entity (Expr));
3858 -- Anything else does not need checking
3865 -- This loop checks the form of the prefix for an entity,
3866 -- using recursion to deal with intermediate components.
3869 -- Check for Y where Y is an entity
3871 if Is_Entity_Name (Expr) then
3872 Ent := Entity (Expr);
3875 -- Check for components
3878 Nkind_In (Expr, N_Selected_Component, N_Indexed_Component) then
3880 Expr := Prefix (Expr);
3883 -- Anything else does not need checking
3890 end Find_Overlaid_Entity;
3892 -------------------------
3893 -- Find_Parameter_Type --
3894 -------------------------
3896 function Find_Parameter_Type (Param : Node_Id) return Entity_Id is
3898 if Nkind (Param) /= N_Parameter_Specification then
3901 -- For an access parameter, obtain the type from the formal entity
3902 -- itself, because access to subprogram nodes do not carry a type.
3903 -- Shouldn't we always use the formal entity ???
3905 elsif Nkind (Parameter_Type (Param)) = N_Access_Definition then
3906 return Etype (Defining_Identifier (Param));
3909 return Etype (Parameter_Type (Param));
3911 end Find_Parameter_Type;
3913 -----------------------------
3914 -- Find_Static_Alternative --
3915 -----------------------------
3917 function Find_Static_Alternative (N : Node_Id) return Node_Id is
3918 Expr : constant Node_Id := Expression (N);
3919 Val : constant Uint := Expr_Value (Expr);
3924 Alt := First (Alternatives (N));
3927 if Nkind (Alt) /= N_Pragma then
3928 Choice := First (Discrete_Choices (Alt));
3929 while Present (Choice) loop
3931 -- Others choice, always matches
3933 if Nkind (Choice) = N_Others_Choice then
3936 -- Range, check if value is in the range
3938 elsif Nkind (Choice) = N_Range then
3940 Val >= Expr_Value (Low_Bound (Choice))
3942 Val <= Expr_Value (High_Bound (Choice));
3944 -- Choice is a subtype name. Note that we know it must
3945 -- be a static subtype, since otherwise it would have
3946 -- been diagnosed as illegal.
3948 elsif Is_Entity_Name (Choice)
3949 and then Is_Type (Entity (Choice))
3951 exit Search when Is_In_Range (Expr, Etype (Choice),
3952 Assume_Valid => False);
3954 -- Choice is a subtype indication
3956 elsif Nkind (Choice) = N_Subtype_Indication then
3958 C : constant Node_Id := Constraint (Choice);
3959 R : constant Node_Id := Range_Expression (C);
3963 Val >= Expr_Value (Low_Bound (R))
3965 Val <= Expr_Value (High_Bound (R));
3968 -- Choice is a simple expression
3971 exit Search when Val = Expr_Value (Choice);
3979 pragma Assert (Present (Alt));
3982 -- The above loop *must* terminate by finding a match, since
3983 -- we know the case statement is valid, and the value of the
3984 -- expression is known at compile time. When we fall out of
3985 -- the loop, Alt points to the alternative that we know will
3986 -- be selected at run time.
3989 end Find_Static_Alternative;
3995 function First_Actual (Node : Node_Id) return Node_Id is
3999 if No (Parameter_Associations (Node)) then
4003 N := First (Parameter_Associations (Node));
4005 if Nkind (N) = N_Parameter_Association then
4006 return First_Named_Actual (Node);
4012 -----------------------
4013 -- Gather_Components --
4014 -----------------------
4016 procedure Gather_Components
4018 Comp_List : Node_Id;
4019 Governed_By : List_Id;
4021 Report_Errors : out Boolean)
4025 Discrete_Choice : Node_Id;
4026 Comp_Item : Node_Id;
4028 Discrim : Entity_Id;
4029 Discrim_Name : Node_Id;
4030 Discrim_Value : Node_Id;
4033 Report_Errors := False;
4035 if No (Comp_List) or else Null_Present (Comp_List) then
4038 elsif Present (Component_Items (Comp_List)) then
4039 Comp_Item := First (Component_Items (Comp_List));
4045 while Present (Comp_Item) loop
4047 -- Skip the tag of a tagged record, the interface tags, as well
4048 -- as all items that are not user components (anonymous types,
4049 -- rep clauses, Parent field, controller field).
4051 if Nkind (Comp_Item) = N_Component_Declaration then
4053 Comp : constant Entity_Id := Defining_Identifier (Comp_Item);
4055 if not Is_Tag (Comp)
4056 and then Chars (Comp) /= Name_uParent
4058 Append_Elmt (Comp, Into);
4066 if No (Variant_Part (Comp_List)) then
4069 Discrim_Name := Name (Variant_Part (Comp_List));
4070 Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
4073 -- Look for the discriminant that governs this variant part.
4074 -- The discriminant *must* be in the Governed_By List
4076 Assoc := First (Governed_By);
4077 Find_Constraint : loop
4078 Discrim := First (Choices (Assoc));
4079 exit Find_Constraint when Chars (Discrim_Name) = Chars (Discrim)
4080 or else (Present (Corresponding_Discriminant (Entity (Discrim)))
4082 Chars (Corresponding_Discriminant (Entity (Discrim)))
4083 = Chars (Discrim_Name))
4084 or else Chars (Original_Record_Component (Entity (Discrim)))
4085 = Chars (Discrim_Name);
4087 if No (Next (Assoc)) then
4088 if not Is_Constrained (Typ)
4089 and then Is_Derived_Type (Typ)
4090 and then Present (Stored_Constraint (Typ))
4092 -- If the type is a tagged type with inherited discriminants,
4093 -- use the stored constraint on the parent in order to find
4094 -- the values of discriminants that are otherwise hidden by an
4095 -- explicit constraint. Renamed discriminants are handled in
4098 -- If several parent discriminants are renamed by a single
4099 -- discriminant of the derived type, the call to obtain the
4100 -- Corresponding_Discriminant field only retrieves the last
4101 -- of them. We recover the constraint on the others from the
4102 -- Stored_Constraint as well.
4109 D := First_Discriminant (Etype (Typ));
4110 C := First_Elmt (Stored_Constraint (Typ));
4111 while Present (D) and then Present (C) loop
4112 if Chars (Discrim_Name) = Chars (D) then
4113 if Is_Entity_Name (Node (C))
4114 and then Entity (Node (C)) = Entity (Discrim)
4116 -- D is renamed by Discrim, whose value is given in
4123 Make_Component_Association (Sloc (Typ),
4125 (New_Occurrence_Of (D, Sloc (Typ))),
4126 Duplicate_Subexpr_No_Checks (Node (C)));
4128 exit Find_Constraint;
4131 Next_Discriminant (D);
4138 if No (Next (Assoc)) then
4139 Error_Msg_NE (" missing value for discriminant&",
4140 First (Governed_By), Discrim_Name);
4141 Report_Errors := True;
4146 end loop Find_Constraint;
4148 Discrim_Value := Expression (Assoc);
4150 if not Is_OK_Static_Expression (Discrim_Value) then
4152 ("value for discriminant & must be static!",
4153 Discrim_Value, Discrim);
4154 Why_Not_Static (Discrim_Value);
4155 Report_Errors := True;
4159 Search_For_Discriminant_Value : declare
4165 UI_Discrim_Value : constant Uint := Expr_Value (Discrim_Value);
4168 Find_Discrete_Value : while Present (Variant) loop
4169 Discrete_Choice := First (Discrete_Choices (Variant));
4170 while Present (Discrete_Choice) loop
4172 exit Find_Discrete_Value when
4173 Nkind (Discrete_Choice) = N_Others_Choice;
4175 Get_Index_Bounds (Discrete_Choice, Low, High);
4177 UI_Low := Expr_Value (Low);
4178 UI_High := Expr_Value (High);
4180 exit Find_Discrete_Value when
4181 UI_Low <= UI_Discrim_Value
4183 UI_High >= UI_Discrim_Value;
4185 Next (Discrete_Choice);
4188 Next_Non_Pragma (Variant);
4189 end loop Find_Discrete_Value;
4190 end Search_For_Discriminant_Value;
4192 if No (Variant) then
4194 ("value of discriminant & is out of range", Discrim_Value, Discrim);
4195 Report_Errors := True;
4199 -- If we have found the corresponding choice, recursively add its
4200 -- components to the Into list.
4202 Gather_Components (Empty,
4203 Component_List (Variant), Governed_By, Into, Report_Errors);
4204 end Gather_Components;
4206 ------------------------
4207 -- Get_Actual_Subtype --
4208 ------------------------
4210 function Get_Actual_Subtype (N : Node_Id) return Entity_Id is
4211 Typ : constant Entity_Id := Etype (N);
4212 Utyp : Entity_Id := Underlying_Type (Typ);
4221 -- If what we have is an identifier that references a subprogram
4222 -- formal, or a variable or constant object, then we get the actual
4223 -- subtype from the referenced entity if one has been built.
4225 if Nkind (N) = N_Identifier
4227 (Is_Formal (Entity (N))
4228 or else Ekind (Entity (N)) = E_Constant
4229 or else Ekind (Entity (N)) = E_Variable)
4230 and then Present (Actual_Subtype (Entity (N)))
4232 return Actual_Subtype (Entity (N));
4234 -- Actual subtype of unchecked union is always itself. We never need
4235 -- the "real" actual subtype. If we did, we couldn't get it anyway
4236 -- because the discriminant is not available. The restrictions on
4237 -- Unchecked_Union are designed to make sure that this is OK.
4239 elsif Is_Unchecked_Union (Base_Type (Utyp)) then
4242 -- Here for the unconstrained case, we must find actual subtype
4243 -- No actual subtype is available, so we must build it on the fly.
4245 -- Checking the type, not the underlying type, for constrainedness
4246 -- seems to be necessary. Maybe all the tests should be on the type???
4248 elsif (not Is_Constrained (Typ))
4249 and then (Is_Array_Type (Utyp)
4250 or else (Is_Record_Type (Utyp)
4251 and then Has_Discriminants (Utyp)))
4252 and then not Has_Unknown_Discriminants (Utyp)
4253 and then not (Ekind (Utyp) = E_String_Literal_Subtype)
4255 -- Nothing to do if in spec expression (why not???)
4257 if In_Spec_Expression then
4260 elsif Is_Private_Type (Typ)
4261 and then not Has_Discriminants (Typ)
4263 -- If the type has no discriminants, there is no subtype to
4264 -- build, even if the underlying type is discriminated.
4268 -- Else build the actual subtype
4271 Decl := Build_Actual_Subtype (Typ, N);
4272 Atyp := Defining_Identifier (Decl);
4274 -- If Build_Actual_Subtype generated a new declaration then use it
4278 -- The actual subtype is an Itype, so analyze the declaration,
4279 -- but do not attach it to the tree, to get the type defined.
4281 Set_Parent (Decl, N);
4282 Set_Is_Itype (Atyp);
4283 Analyze (Decl, Suppress => All_Checks);
4284 Set_Associated_Node_For_Itype (Atyp, N);
4285 Set_Has_Delayed_Freeze (Atyp, False);
4287 -- We need to freeze the actual subtype immediately. This is
4288 -- needed, because otherwise this Itype will not get frozen
4289 -- at all, and it is always safe to freeze on creation because
4290 -- any associated types must be frozen at this point.
4292 Freeze_Itype (Atyp, N);
4295 -- Otherwise we did not build a declaration, so return original
4302 -- For all remaining cases, the actual subtype is the same as
4303 -- the nominal type.
4308 end Get_Actual_Subtype;
4310 -------------------------------------
4311 -- Get_Actual_Subtype_If_Available --
4312 -------------------------------------
4314 function Get_Actual_Subtype_If_Available (N : Node_Id) return Entity_Id is
4315 Typ : constant Entity_Id := Etype (N);
4318 -- If what we have is an identifier that references a subprogram
4319 -- formal, or a variable or constant object, then we get the actual
4320 -- subtype from the referenced entity if one has been built.
4322 if Nkind (N) = N_Identifier
4324 (Is_Formal (Entity (N))
4325 or else Ekind (Entity (N)) = E_Constant
4326 or else Ekind (Entity (N)) = E_Variable)
4327 and then Present (Actual_Subtype (Entity (N)))
4329 return Actual_Subtype (Entity (N));
4331 -- Otherwise the Etype of N is returned unchanged
4336 end Get_Actual_Subtype_If_Available;
4338 ------------------------
4339 -- Get_Body_From_Stub --
4340 ------------------------
4342 function Get_Body_From_Stub (N : Node_Id) return Node_Id is
4344 return Proper_Body (Unit (Library_Unit (N)));
4345 end Get_Body_From_Stub;
4347 -------------------------------
4348 -- Get_Default_External_Name --
4349 -------------------------------
4351 function Get_Default_External_Name (E : Node_Or_Entity_Id) return Node_Id is
4353 Get_Decoded_Name_String (Chars (E));
4355 if Opt.External_Name_Imp_Casing = Uppercase then
4356 Set_Casing (All_Upper_Case);
4358 Set_Casing (All_Lower_Case);
4362 Make_String_Literal (Sloc (E),
4363 Strval => String_From_Name_Buffer);
4364 end Get_Default_External_Name;
4366 --------------------------
4367 -- Get_Enclosing_Object --
4368 --------------------------
4370 function Get_Enclosing_Object (N : Node_Id) return Entity_Id is
4372 if Is_Entity_Name (N) then
4376 when N_Indexed_Component |
4378 N_Selected_Component =>
4380 -- If not generating code, a dereference may be left implicit.
4381 -- In thoses cases, return Empty.
4383 if Is_Access_Type (Etype (Prefix (N))) then
4386 return Get_Enclosing_Object (Prefix (N));
4389 when N_Type_Conversion =>
4390 return Get_Enclosing_Object (Expression (N));
4396 end Get_Enclosing_Object;
4398 ---------------------------
4399 -- Get_Enum_Lit_From_Pos --
4400 ---------------------------
4402 function Get_Enum_Lit_From_Pos
4405 Loc : Source_Ptr) return Node_Id
4410 -- In the case where the literal is of type Character, Wide_Character
4411 -- or Wide_Wide_Character or of a type derived from them, there needs
4412 -- to be some special handling since there is no explicit chain of
4413 -- literals to search. Instead, an N_Character_Literal node is created
4414 -- with the appropriate Char_Code and Chars fields.
4416 if Is_Standard_Character_Type (T) then
4417 Set_Character_Literal_Name (UI_To_CC (Pos));
4419 Make_Character_Literal (Loc,
4421 Char_Literal_Value => Pos);
4423 -- For all other cases, we have a complete table of literals, and
4424 -- we simply iterate through the chain of literal until the one
4425 -- with the desired position value is found.
4429 Lit := First_Literal (Base_Type (T));
4430 for J in 1 .. UI_To_Int (Pos) loop
4434 return New_Occurrence_Of (Lit, Loc);
4436 end Get_Enum_Lit_From_Pos;
4438 ---------------------------------------
4439 -- Get_Ensures_From_Test_Case_Pragma --
4440 ---------------------------------------
4442 function Get_Ensures_From_Test_Case_Pragma (N : Node_Id) return Node_Id is
4443 Args : constant List_Id := Pragma_Argument_Associations (N);
4447 if List_Length (Args) = 4 then
4448 Res := Pick (Args, 4);
4450 elsif List_Length (Args) = 3 then
4451 Res := Pick (Args, 3);
4453 if Chars (Res) /= Name_Ensures then
4462 end Get_Ensures_From_Test_Case_Pragma;
4464 ------------------------
4465 -- Get_Generic_Entity --
4466 ------------------------
4468 function Get_Generic_Entity (N : Node_Id) return Entity_Id is
4469 Ent : constant Entity_Id := Entity (Name (N));
4471 if Present (Renamed_Object (Ent)) then
4472 return Renamed_Object (Ent);
4476 end Get_Generic_Entity;
4478 ----------------------
4479 -- Get_Index_Bounds --
4480 ----------------------
4482 procedure Get_Index_Bounds (N : Node_Id; L, H : out Node_Id) is
4483 Kind : constant Node_Kind := Nkind (N);
4487 if Kind = N_Range then
4489 H := High_Bound (N);
4491 elsif Kind = N_Subtype_Indication then
4492 R := Range_Expression (Constraint (N));
4500 L := Low_Bound (Range_Expression (Constraint (N)));
4501 H := High_Bound (Range_Expression (Constraint (N)));
4504 elsif Is_Entity_Name (N) and then Is_Type (Entity (N)) then
4505 if Error_Posted (Scalar_Range (Entity (N))) then
4509 elsif Nkind (Scalar_Range (Entity (N))) = N_Subtype_Indication then
4510 Get_Index_Bounds (Scalar_Range (Entity (N)), L, H);
4513 L := Low_Bound (Scalar_Range (Entity (N)));
4514 H := High_Bound (Scalar_Range (Entity (N)));
4518 -- N is an expression, indicating a range with one value
4523 end Get_Index_Bounds;
4525 ----------------------------------
4526 -- Get_Library_Unit_Name_string --
4527 ----------------------------------
4529 procedure Get_Library_Unit_Name_String (Decl_Node : Node_Id) is
4530 Unit_Name_Id : constant Unit_Name_Type := Get_Unit_Name (Decl_Node);
4533 Get_Unit_Name_String (Unit_Name_Id);
4535 -- Remove seven last character (" (spec)" or " (body)")
4537 Name_Len := Name_Len - 7;
4538 pragma Assert (Name_Buffer (Name_Len + 1) = ' ');
4539 end Get_Library_Unit_Name_String;
4541 ------------------------
4542 -- Get_Name_Entity_Id --
4543 ------------------------
4545 function Get_Name_Entity_Id (Id : Name_Id) return Entity_Id is
4547 return Entity_Id (Get_Name_Table_Info (Id));
4548 end Get_Name_Entity_Id;
4550 ------------------------------------
4551 -- Get_Name_From_Test_Case_Pragma --
4552 ------------------------------------
4554 function Get_Name_From_Test_Case_Pragma (N : Node_Id) return String_Id is
4555 Arg : constant Node_Id :=
4556 Get_Pragma_Arg (First (Pragma_Argument_Associations (N)));
4558 return Strval (Expr_Value_S (Arg));
4559 end Get_Name_From_Test_Case_Pragma;
4565 function Get_Pragma_Id (N : Node_Id) return Pragma_Id is
4567 return Get_Pragma_Id (Pragma_Name (N));
4570 ---------------------------
4571 -- Get_Referenced_Object --
4572 ---------------------------
4574 function Get_Referenced_Object (N : Node_Id) return Node_Id is
4579 while Is_Entity_Name (R)
4580 and then Present (Renamed_Object (Entity (R)))
4582 R := Renamed_Object (Entity (R));
4586 end Get_Referenced_Object;
4588 ------------------------
4589 -- Get_Renamed_Entity --
4590 ------------------------
4592 function Get_Renamed_Entity (E : Entity_Id) return Entity_Id is
4597 while Present (Renamed_Entity (R)) loop
4598 R := Renamed_Entity (R);
4602 end Get_Renamed_Entity;
4604 ----------------------------------------
4605 -- Get_Requires_From_Test_Case_Pragma --
4606 ----------------------------------------
4608 function Get_Requires_From_Test_Case_Pragma (N : Node_Id) return Node_Id is
4609 Args : constant List_Id := Pragma_Argument_Associations (N);
4613 if List_Length (Args) >= 3 then
4614 Res := Pick (Args, 3);
4616 if Chars (Res) /= Name_Requires then
4625 end Get_Requires_From_Test_Case_Pragma;
4627 -------------------------
4628 -- Get_Subprogram_Body --
4629 -------------------------
4631 function Get_Subprogram_Body (E : Entity_Id) return Node_Id is
4635 Decl := Unit_Declaration_Node (E);
4637 if Nkind (Decl) = N_Subprogram_Body then
4640 -- The below comment is bad, because it is possible for
4641 -- Nkind (Decl) to be an N_Subprogram_Body_Stub ???
4643 else -- Nkind (Decl) = N_Subprogram_Declaration
4645 if Present (Corresponding_Body (Decl)) then
4646 return Unit_Declaration_Node (Corresponding_Body (Decl));
4648 -- Imported subprogram case
4654 end Get_Subprogram_Body;
4656 ---------------------------
4657 -- Get_Subprogram_Entity --
4658 ---------------------------
4660 function Get_Subprogram_Entity (Nod : Node_Id) return Entity_Id is
4665 if Nkind (Nod) = N_Accept_Statement then
4666 Nam := Entry_Direct_Name (Nod);
4668 -- For an entry call, the prefix of the call is a selected component.
4669 -- Need additional code for internal calls ???
4671 elsif Nkind (Nod) = N_Entry_Call_Statement then
4672 if Nkind (Name (Nod)) = N_Selected_Component then
4673 Nam := Entity (Selector_Name (Name (Nod)));
4682 if Nkind (Nam) = N_Explicit_Dereference then
4683 Proc := Etype (Prefix (Nam));
4684 elsif Is_Entity_Name (Nam) then
4685 Proc := Entity (Nam);
4690 if Is_Object (Proc) then
4691 Proc := Etype (Proc);
4694 if Ekind (Proc) = E_Access_Subprogram_Type then
4695 Proc := Directly_Designated_Type (Proc);
4698 if not Is_Subprogram (Proc)
4699 and then Ekind (Proc) /= E_Subprogram_Type
4705 end Get_Subprogram_Entity;
4707 -----------------------------
4708 -- Get_Task_Body_Procedure --
4709 -----------------------------
4711 function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
4713 -- Note: A task type may be the completion of a private type with
4714 -- discriminants. When performing elaboration checks on a task
4715 -- declaration, the current view of the type may be the private one,
4716 -- and the procedure that holds the body of the task is held in its
4719 -- This is an odd function, why not have Task_Body_Procedure do
4720 -- the following digging???
4722 return Task_Body_Procedure (Underlying_Type (Root_Type (E)));
4723 end Get_Task_Body_Procedure;
4725 -----------------------
4726 -- Has_Access_Values --
4727 -----------------------
4729 function Has_Access_Values (T : Entity_Id) return Boolean is
4730 Typ : constant Entity_Id := Underlying_Type (T);
4733 -- Case of a private type which is not completed yet. This can only
4734 -- happen in the case of a generic format type appearing directly, or
4735 -- as a component of the type to which this function is being applied
4736 -- at the top level. Return False in this case, since we certainly do
4737 -- not know that the type contains access types.
4742 elsif Is_Access_Type (Typ) then
4745 elsif Is_Array_Type (Typ) then
4746 return Has_Access_Values (Component_Type (Typ));
4748 elsif Is_Record_Type (Typ) then
4753 -- Loop to Check components
4755 Comp := First_Component_Or_Discriminant (Typ);
4756 while Present (Comp) loop
4758 -- Check for access component, tag field does not count, even
4759 -- though it is implemented internally using an access type.
4761 if Has_Access_Values (Etype (Comp))
4762 and then Chars (Comp) /= Name_uTag
4767 Next_Component_Or_Discriminant (Comp);
4776 end Has_Access_Values;
4778 ------------------------------
4779 -- Has_Compatible_Alignment --
4780 ------------------------------
4782 function Has_Compatible_Alignment
4784 Expr : Node_Id) return Alignment_Result
4786 function Has_Compatible_Alignment_Internal
4789 Default : Alignment_Result) return Alignment_Result;
4790 -- This is the internal recursive function that actually does the work.
4791 -- There is one additional parameter, which says what the result should
4792 -- be if no alignment information is found, and there is no definite
4793 -- indication of compatible alignments. At the outer level, this is set
4794 -- to Unknown, but for internal recursive calls in the case where types
4795 -- are known to be correct, it is set to Known_Compatible.
4797 ---------------------------------------
4798 -- Has_Compatible_Alignment_Internal --
4799 ---------------------------------------
4801 function Has_Compatible_Alignment_Internal
4804 Default : Alignment_Result) return Alignment_Result
4806 Result : Alignment_Result := Known_Compatible;
4807 -- Holds the current status of the result. Note that once a value of
4808 -- Known_Incompatible is set, it is sticky and does not get changed
4809 -- to Unknown (the value in Result only gets worse as we go along,
4812 Offs : Uint := No_Uint;
4813 -- Set to a factor of the offset from the base object when Expr is a
4814 -- selected or indexed component, based on Component_Bit_Offset and
4815 -- Component_Size respectively. A negative value is used to represent
4816 -- a value which is not known at compile time.
4818 procedure Check_Prefix;
4819 -- Checks the prefix recursively in the case where the expression
4820 -- is an indexed or selected component.
4822 procedure Set_Result (R : Alignment_Result);
4823 -- If R represents a worse outcome (unknown instead of known
4824 -- compatible, or known incompatible), then set Result to R.
4830 procedure Check_Prefix is
4832 -- The subtlety here is that in doing a recursive call to check
4833 -- the prefix, we have to decide what to do in the case where we
4834 -- don't find any specific indication of an alignment problem.
4836 -- At the outer level, we normally set Unknown as the result in
4837 -- this case, since we can only set Known_Compatible if we really
4838 -- know that the alignment value is OK, but for the recursive
4839 -- call, in the case where the types match, and we have not
4840 -- specified a peculiar alignment for the object, we are only
4841 -- concerned about suspicious rep clauses, the default case does
4842 -- not affect us, since the compiler will, in the absence of such
4843 -- rep clauses, ensure that the alignment is correct.
4845 if Default = Known_Compatible
4847 (Etype (Obj) = Etype (Expr)
4848 and then (Unknown_Alignment (Obj)
4850 Alignment (Obj) = Alignment (Etype (Obj))))
4853 (Has_Compatible_Alignment_Internal
4854 (Obj, Prefix (Expr), Known_Compatible));
4856 -- In all other cases, we need a full check on the prefix
4860 (Has_Compatible_Alignment_Internal
4861 (Obj, Prefix (Expr), Unknown));
4869 procedure Set_Result (R : Alignment_Result) is
4876 -- Start of processing for Has_Compatible_Alignment_Internal
4879 -- If Expr is a selected component, we must make sure there is no
4880 -- potentially troublesome component clause, and that the record is
4883 if Nkind (Expr) = N_Selected_Component then
4885 -- Packed record always generate unknown alignment
4887 if Is_Packed (Etype (Prefix (Expr))) then
4888 Set_Result (Unknown);
4891 -- Check prefix and component offset
4894 Offs := Component_Bit_Offset (Entity (Selector_Name (Expr)));
4896 -- If Expr is an indexed component, we must make sure there is no
4897 -- potentially troublesome Component_Size clause and that the array
4898 -- is not bit-packed.
4900 elsif Nkind (Expr) = N_Indexed_Component then
4902 Typ : constant Entity_Id := Etype (Prefix (Expr));
4903 Ind : constant Node_Id := First_Index (Typ);
4906 -- Bit packed array always generates unknown alignment
4908 if Is_Bit_Packed_Array (Typ) then
4909 Set_Result (Unknown);
4912 -- Check prefix and component offset
4915 Offs := Component_Size (Typ);
4917 -- Small optimization: compute the full offset when possible
4920 and then Offs > Uint_0
4921 and then Present (Ind)
4922 and then Nkind (Ind) = N_Range
4923 and then Compile_Time_Known_Value (Low_Bound (Ind))
4924 and then Compile_Time_Known_Value (First (Expressions (Expr)))
4926 Offs := Offs * (Expr_Value (First (Expressions (Expr)))
4927 - Expr_Value (Low_Bound ((Ind))));
4932 -- If we have a null offset, the result is entirely determined by
4933 -- the base object and has already been computed recursively.
4935 if Offs = Uint_0 then
4938 -- Case where we know the alignment of the object
4940 elsif Known_Alignment (Obj) then
4942 ObjA : constant Uint := Alignment (Obj);
4943 ExpA : Uint := No_Uint;
4944 SizA : Uint := No_Uint;
4947 -- If alignment of Obj is 1, then we are always OK
4950 Set_Result (Known_Compatible);
4952 -- Alignment of Obj is greater than 1, so we need to check
4955 -- If we have an offset, see if it is compatible
4957 if Offs /= No_Uint and Offs > Uint_0 then
4958 if Offs mod (System_Storage_Unit * ObjA) /= 0 then
4959 Set_Result (Known_Incompatible);
4962 -- See if Expr is an object with known alignment
4964 elsif Is_Entity_Name (Expr)
4965 and then Known_Alignment (Entity (Expr))
4967 ExpA := Alignment (Entity (Expr));
4969 -- Otherwise, we can use the alignment of the type of
4970 -- Expr given that we already checked for
4971 -- discombobulating rep clauses for the cases of indexed
4972 -- and selected components above.
4974 elsif Known_Alignment (Etype (Expr)) then
4975 ExpA := Alignment (Etype (Expr));
4977 -- Otherwise the alignment is unknown
4980 Set_Result (Default);
4983 -- If we got an alignment, see if it is acceptable
4985 if ExpA /= No_Uint and then ExpA < ObjA then
4986 Set_Result (Known_Incompatible);
4989 -- If Expr is not a piece of a larger object, see if size
4990 -- is given. If so, check that it is not too small for the
4991 -- required alignment.
4993 if Offs /= No_Uint then
4996 -- See if Expr is an object with known size
4998 elsif Is_Entity_Name (Expr)
4999 and then Known_Static_Esize (Entity (Expr))
5001 SizA := Esize (Entity (Expr));
5003 -- Otherwise, we check the object size of the Expr type
5005 elsif Known_Static_Esize (Etype (Expr)) then
5006 SizA := Esize (Etype (Expr));
5009 -- If we got a size, see if it is a multiple of the Obj
5010 -- alignment, if not, then the alignment cannot be
5011 -- acceptable, since the size is always a multiple of the
5014 if SizA /= No_Uint then
5015 if SizA mod (ObjA * Ttypes.System_Storage_Unit) /= 0 then
5016 Set_Result (Known_Incompatible);
5022 -- If we do not know required alignment, any non-zero offset is a
5023 -- potential problem (but certainly may be OK, so result is unknown).
5025 elsif Offs /= No_Uint then
5026 Set_Result (Unknown);
5028 -- If we can't find the result by direct comparison of alignment
5029 -- values, then there is still one case that we can determine known
5030 -- result, and that is when we can determine that the types are the
5031 -- same, and no alignments are specified. Then we known that the
5032 -- alignments are compatible, even if we don't know the alignment
5033 -- value in the front end.
5035 elsif Etype (Obj) = Etype (Expr) then
5037 -- Types are the same, but we have to check for possible size
5038 -- and alignments on the Expr object that may make the alignment
5039 -- different, even though the types are the same.
5041 if Is_Entity_Name (Expr) then
5043 -- First check alignment of the Expr object. Any alignment less
5044 -- than Maximum_Alignment is worrisome since this is the case
5045 -- where we do not know the alignment of Obj.
5047 if Known_Alignment (Entity (Expr))
5049 UI_To_Int (Alignment (Entity (Expr))) <
5050 Ttypes.Maximum_Alignment
5052 Set_Result (Unknown);
5054 -- Now check size of Expr object. Any size that is not an
5055 -- even multiple of Maximum_Alignment is also worrisome
5056 -- since it may cause the alignment of the object to be less
5057 -- than the alignment of the type.
5059 elsif Known_Static_Esize (Entity (Expr))
5061 (UI_To_Int (Esize (Entity (Expr))) mod
5062 (Ttypes.Maximum_Alignment * Ttypes.System_Storage_Unit))
5065 Set_Result (Unknown);
5067 -- Otherwise same type is decisive
5070 Set_Result (Known_Compatible);
5074 -- Another case to deal with is when there is an explicit size or
5075 -- alignment clause when the types are not the same. If so, then the
5076 -- result is Unknown. We don't need to do this test if the Default is
5077 -- Unknown, since that result will be set in any case.
5079 elsif Default /= Unknown
5080 and then (Has_Size_Clause (Etype (Expr))
5082 Has_Alignment_Clause (Etype (Expr)))
5084 Set_Result (Unknown);
5086 -- If no indication found, set default
5089 Set_Result (Default);
5092 -- Return worst result found
5095 end Has_Compatible_Alignment_Internal;
5097 -- Start of processing for Has_Compatible_Alignment
5100 -- If Obj has no specified alignment, then set alignment from the type
5101 -- alignment. Perhaps we should always do this, but for sure we should
5102 -- do it when there is an address clause since we can do more if the
5103 -- alignment is known.
5105 if Unknown_Alignment (Obj) then
5106 Set_Alignment (Obj, Alignment (Etype (Obj)));
5109 -- Now do the internal call that does all the work
5111 return Has_Compatible_Alignment_Internal (Obj, Expr, Unknown);
5112 end Has_Compatible_Alignment;
5114 ----------------------
5115 -- Has_Declarations --
5116 ----------------------
5118 function Has_Declarations (N : Node_Id) return Boolean is
5120 return Nkind_In (Nkind (N), N_Accept_Statement,
5122 N_Compilation_Unit_Aux,
5128 N_Package_Specification);
5129 end Has_Declarations;
5131 -------------------------------------------
5132 -- Has_Discriminant_Dependent_Constraint --
5133 -------------------------------------------
5135 function Has_Discriminant_Dependent_Constraint
5136 (Comp : Entity_Id) return Boolean
5138 Comp_Decl : constant Node_Id := Parent (Comp);
5139 Subt_Indic : constant Node_Id :=
5140 Subtype_Indication (Component_Definition (Comp_Decl));
5145 if Nkind (Subt_Indic) = N_Subtype_Indication then
5146 Constr := Constraint (Subt_Indic);
5148 if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
5149 Assn := First (Constraints (Constr));
5150 while Present (Assn) loop
5151 case Nkind (Assn) is
5152 when N_Subtype_Indication |
5156 if Depends_On_Discriminant (Assn) then
5160 when N_Discriminant_Association =>
5161 if Depends_On_Discriminant (Expression (Assn)) then
5176 end Has_Discriminant_Dependent_Constraint;
5178 --------------------
5179 -- Has_Infinities --
5180 --------------------
5182 function Has_Infinities (E : Entity_Id) return Boolean is
5185 Is_Floating_Point_Type (E)
5186 and then Nkind (Scalar_Range (E)) = N_Range
5187 and then Includes_Infinities (Scalar_Range (E));
5190 --------------------
5191 -- Has_Interfaces --
5192 --------------------
5194 function Has_Interfaces
5196 Use_Full_View : Boolean := True) return Boolean
5198 Typ : Entity_Id := Base_Type (T);
5201 -- Handle concurrent types
5203 if Is_Concurrent_Type (Typ) then
5204 Typ := Corresponding_Record_Type (Typ);
5207 if not Present (Typ)
5208 or else not Is_Record_Type (Typ)
5209 or else not Is_Tagged_Type (Typ)
5214 -- Handle private types
5217 and then Present (Full_View (Typ))
5219 Typ := Full_View (Typ);
5222 -- Handle concurrent record types
5224 if Is_Concurrent_Record_Type (Typ)
5225 and then Is_Non_Empty_List (Abstract_Interface_List (Typ))
5231 if Is_Interface (Typ)
5233 (Is_Record_Type (Typ)
5234 and then Present (Interfaces (Typ))
5235 and then not Is_Empty_Elmt_List (Interfaces (Typ)))
5240 exit when Etype (Typ) = Typ
5242 -- Handle private types
5244 or else (Present (Full_View (Etype (Typ)))
5245 and then Full_View (Etype (Typ)) = Typ)
5247 -- Protect the frontend against wrong source with cyclic
5250 or else Etype (Typ) = T;
5252 -- Climb to the ancestor type handling private types
5254 if Present (Full_View (Etype (Typ))) then
5255 Typ := Full_View (Etype (Typ));
5264 ------------------------
5265 -- Has_Null_Exclusion --
5266 ------------------------
5268 function Has_Null_Exclusion (N : Node_Id) return Boolean is
5271 when N_Access_Definition |
5272 N_Access_Function_Definition |
5273 N_Access_Procedure_Definition |
5274 N_Access_To_Object_Definition |
5276 N_Derived_Type_Definition |
5277 N_Function_Specification |
5278 N_Subtype_Declaration =>
5279 return Null_Exclusion_Present (N);
5281 when N_Component_Definition |
5282 N_Formal_Object_Declaration |
5283 N_Object_Renaming_Declaration =>
5284 if Present (Subtype_Mark (N)) then
5285 return Null_Exclusion_Present (N);
5286 else pragma Assert (Present (Access_Definition (N)));
5287 return Null_Exclusion_Present (Access_Definition (N));
5290 when N_Discriminant_Specification =>
5291 if Nkind (Discriminant_Type (N)) = N_Access_Definition then
5292 return Null_Exclusion_Present (Discriminant_Type (N));
5294 return Null_Exclusion_Present (N);
5297 when N_Object_Declaration =>
5298 if Nkind (Object_Definition (N)) = N_Access_Definition then
5299 return Null_Exclusion_Present (Object_Definition (N));
5301 return Null_Exclusion_Present (N);
5304 when N_Parameter_Specification =>
5305 if Nkind (Parameter_Type (N)) = N_Access_Definition then
5306 return Null_Exclusion_Present (Parameter_Type (N));
5308 return Null_Exclusion_Present (N);
5315 end Has_Null_Exclusion;
5317 ------------------------
5318 -- Has_Null_Extension --
5319 ------------------------
5321 function Has_Null_Extension (T : Entity_Id) return Boolean is
5322 B : constant Entity_Id := Base_Type (T);
5327 if Nkind (Parent (B)) = N_Full_Type_Declaration
5328 and then Present (Record_Extension_Part (Type_Definition (Parent (B))))
5330 Ext := Record_Extension_Part (Type_Definition (Parent (B)));
5332 if Present (Ext) then
5333 if Null_Present (Ext) then
5336 Comps := Component_List (Ext);
5338 -- The null component list is rewritten during analysis to
5339 -- include the parent component. Any other component indicates
5340 -- that the extension was not originally null.
5342 return Null_Present (Comps)
5343 or else No (Next (First (Component_Items (Comps))));
5352 end Has_Null_Extension;
5354 -------------------------------
5355 -- Has_Overriding_Initialize --
5356 -------------------------------
5358 function Has_Overriding_Initialize (T : Entity_Id) return Boolean is
5359 BT : constant Entity_Id := Base_Type (T);
5363 if Is_Controlled (BT) then
5364 if Is_RTU (Scope (BT), Ada_Finalization) then
5367 elsif Present (Primitive_Operations (BT)) then
5368 P := First_Elmt (Primitive_Operations (BT));
5369 while Present (P) loop
5371 Init : constant Entity_Id := Node (P);
5372 Formal : constant Entity_Id := First_Formal (Init);
5374 if Ekind (Init) = E_Procedure
5375 and then Chars (Init) = Name_Initialize
5376 and then Comes_From_Source (Init)
5377 and then Present (Formal)
5378 and then Etype (Formal) = BT
5379 and then No (Next_Formal (Formal))
5380 and then (Ada_Version < Ada_2012
5381 or else not Null_Present (Parent (Init)))
5391 -- Here if type itself does not have a non-null Initialize operation:
5392 -- check immediate ancestor.
5394 if Is_Derived_Type (BT)
5395 and then Has_Overriding_Initialize (Etype (BT))
5402 end Has_Overriding_Initialize;
5404 --------------------------------------
5405 -- Has_Preelaborable_Initialization --
5406 --------------------------------------
5408 function Has_Preelaborable_Initialization (E : Entity_Id) return Boolean is
5411 procedure Check_Components (E : Entity_Id);
5412 -- Check component/discriminant chain, sets Has_PE False if a component
5413 -- or discriminant does not meet the preelaborable initialization rules.
5415 ----------------------
5416 -- Check_Components --
5417 ----------------------
5419 procedure Check_Components (E : Entity_Id) is
5423 function Is_Preelaborable_Expression (N : Node_Id) return Boolean;
5424 -- Returns True if and only if the expression denoted by N does not
5425 -- violate restrictions on preelaborable constructs (RM-10.2.1(5-9)).
5427 ---------------------------------
5428 -- Is_Preelaborable_Expression --
5429 ---------------------------------
5431 function Is_Preelaborable_Expression (N : Node_Id) return Boolean is
5435 Comp_Type : Entity_Id;
5436 Is_Array_Aggr : Boolean;
5439 if Is_Static_Expression (N) then
5442 elsif Nkind (N) = N_Null then
5445 -- Attributes are allowed in general, even if their prefix is a
5446 -- formal type. (It seems that certain attributes known not to be
5447 -- static might not be allowed, but there are no rules to prevent
5450 elsif Nkind (N) = N_Attribute_Reference then
5453 -- The name of a discriminant evaluated within its parent type is
5454 -- defined to be preelaborable (10.2.1(8)). Note that we test for
5455 -- names that denote discriminals as well as discriminants to
5456 -- catch references occurring within init procs.
5458 elsif Is_Entity_Name (N)
5460 (Ekind (Entity (N)) = E_Discriminant
5462 ((Ekind (Entity (N)) = E_Constant
5463 or else Ekind (Entity (N)) = E_In_Parameter)
5464 and then Present (Discriminal_Link (Entity (N)))))
5468 elsif Nkind (N) = N_Qualified_Expression then
5469 return Is_Preelaborable_Expression (Expression (N));
5471 -- For aggregates we have to check that each of the associations
5472 -- is preelaborable.
5474 elsif Nkind (N) = N_Aggregate
5475 or else Nkind (N) = N_Extension_Aggregate
5477 Is_Array_Aggr := Is_Array_Type (Etype (N));
5479 if Is_Array_Aggr then
5480 Comp_Type := Component_Type (Etype (N));
5483 -- Check the ancestor part of extension aggregates, which must
5484 -- be either the name of a type that has preelaborable init or
5485 -- an expression that is preelaborable.
5487 if Nkind (N) = N_Extension_Aggregate then
5489 Anc_Part : constant Node_Id := Ancestor_Part (N);
5492 if Is_Entity_Name (Anc_Part)
5493 and then Is_Type (Entity (Anc_Part))
5495 if not Has_Preelaborable_Initialization
5501 elsif not Is_Preelaborable_Expression (Anc_Part) then
5507 -- Check positional associations
5509 Exp := First (Expressions (N));
5510 while Present (Exp) loop
5511 if not Is_Preelaborable_Expression (Exp) then
5518 -- Check named associations
5520 Assn := First (Component_Associations (N));
5521 while Present (Assn) loop
5522 Choice := First (Choices (Assn));
5523 while Present (Choice) loop
5524 if Is_Array_Aggr then
5525 if Nkind (Choice) = N_Others_Choice then
5528 elsif Nkind (Choice) = N_Range then
5529 if not Is_Static_Range (Choice) then
5533 elsif not Is_Static_Expression (Choice) then
5538 Comp_Type := Etype (Choice);
5544 -- If the association has a <> at this point, then we have
5545 -- to check whether the component's type has preelaborable
5546 -- initialization. Note that this only occurs when the
5547 -- association's corresponding component does not have a
5548 -- default expression, the latter case having already been
5549 -- expanded as an expression for the association.
5551 if Box_Present (Assn) then
5552 if not Has_Preelaborable_Initialization (Comp_Type) then
5556 -- In the expression case we check whether the expression
5557 -- is preelaborable.
5560 not Is_Preelaborable_Expression (Expression (Assn))
5568 -- If we get here then aggregate as a whole is preelaborable
5572 -- All other cases are not preelaborable
5577 end Is_Preelaborable_Expression;
5579 -- Start of processing for Check_Components
5582 -- Loop through entities of record or protected type
5585 while Present (Ent) loop
5587 -- We are interested only in components and discriminants
5594 -- Get default expression if any. If there is no declaration
5595 -- node, it means we have an internal entity. The parent and
5596 -- tag fields are examples of such entities. For such cases,
5597 -- we just test the type of the entity.
5599 if Present (Declaration_Node (Ent)) then
5600 Exp := Expression (Declaration_Node (Ent));
5603 when E_Discriminant =>
5605 -- Note: for a renamed discriminant, the Declaration_Node
5606 -- may point to the one from the ancestor, and have a
5607 -- different expression, so use the proper attribute to
5608 -- retrieve the expression from the derived constraint.
5610 Exp := Discriminant_Default_Value (Ent);
5613 goto Check_Next_Entity;
5616 -- A component has PI if it has no default expression and the
5617 -- component type has PI.
5620 if not Has_Preelaborable_Initialization (Etype (Ent)) then
5625 -- Require the default expression to be preelaborable
5627 elsif not Is_Preelaborable_Expression (Exp) then
5632 <<Check_Next_Entity>>
5635 end Check_Components;
5637 -- Start of processing for Has_Preelaborable_Initialization
5640 -- Immediate return if already marked as known preelaborable init. This
5641 -- covers types for which this function has already been called once
5642 -- and returned True (in which case the result is cached), and also
5643 -- types to which a pragma Preelaborable_Initialization applies.
5645 if Known_To_Have_Preelab_Init (E) then
5649 -- If the type is a subtype representing a generic actual type, then
5650 -- test whether its base type has preelaborable initialization since
5651 -- the subtype representing the actual does not inherit this attribute
5652 -- from the actual or formal. (but maybe it should???)
5654 if Is_Generic_Actual_Type (E) then
5655 return Has_Preelaborable_Initialization (Base_Type (E));
5658 -- All elementary types have preelaborable initialization
5660 if Is_Elementary_Type (E) then
5663 -- Array types have PI if the component type has PI
5665 elsif Is_Array_Type (E) then
5666 Has_PE := Has_Preelaborable_Initialization (Component_Type (E));
5668 -- A derived type has preelaborable initialization if its parent type
5669 -- has preelaborable initialization and (in the case of a derived record
5670 -- extension) if the non-inherited components all have preelaborable
5671 -- initialization. However, a user-defined controlled type with an
5672 -- overriding Initialize procedure does not have preelaborable
5675 elsif Is_Derived_Type (E) then
5677 -- If the derived type is a private extension then it doesn't have
5678 -- preelaborable initialization.
5680 if Ekind (Base_Type (E)) = E_Record_Type_With_Private then
5684 -- First check whether ancestor type has preelaborable initialization
5686 Has_PE := Has_Preelaborable_Initialization (Etype (Base_Type (E)));
5688 -- If OK, check extension components (if any)
5690 if Has_PE and then Is_Record_Type (E) then
5691 Check_Components (First_Entity (E));
5694 -- Check specifically for 10.2.1(11.4/2) exception: a controlled type
5695 -- with a user defined Initialize procedure does not have PI.
5698 and then Is_Controlled (E)
5699 and then Has_Overriding_Initialize (E)
5704 -- Private types not derived from a type having preelaborable init and
5705 -- that are not marked with pragma Preelaborable_Initialization do not
5706 -- have preelaborable initialization.
5708 elsif Is_Private_Type (E) then
5711 -- Record type has PI if it is non private and all components have PI
5713 elsif Is_Record_Type (E) then
5715 Check_Components (First_Entity (E));
5717 -- Protected types must not have entries, and components must meet
5718 -- same set of rules as for record components.
5720 elsif Is_Protected_Type (E) then
5721 if Has_Entries (E) then
5725 Check_Components (First_Entity (E));
5726 Check_Components (First_Private_Entity (E));
5729 -- Type System.Address always has preelaborable initialization
5731 elsif Is_RTE (E, RE_Address) then
5734 -- In all other cases, type does not have preelaborable initialization
5740 -- If type has preelaborable initialization, cache result
5743 Set_Known_To_Have_Preelab_Init (E);
5747 end Has_Preelaborable_Initialization;
5749 ---------------------------
5750 -- Has_Private_Component --
5751 ---------------------------
5753 function Has_Private_Component (Type_Id : Entity_Id) return Boolean is
5754 Btype : Entity_Id := Base_Type (Type_Id);
5755 Component : Entity_Id;
5758 if Error_Posted (Type_Id)
5759 or else Error_Posted (Btype)
5764 if Is_Class_Wide_Type (Btype) then
5765 Btype := Root_Type (Btype);
5768 if Is_Private_Type (Btype) then
5770 UT : constant Entity_Id := Underlying_Type (Btype);
5773 if No (Full_View (Btype)) then
5774 return not Is_Generic_Type (Btype)
5775 and then not Is_Generic_Type (Root_Type (Btype));
5777 return not Is_Generic_Type (Root_Type (Full_View (Btype)));
5780 return not Is_Frozen (UT) and then Has_Private_Component (UT);
5784 elsif Is_Array_Type (Btype) then
5785 return Has_Private_Component (Component_Type (Btype));
5787 elsif Is_Record_Type (Btype) then
5788 Component := First_Component (Btype);
5789 while Present (Component) loop
5790 if Has_Private_Component (Etype (Component)) then
5794 Next_Component (Component);
5799 elsif Is_Protected_Type (Btype)
5800 and then Present (Corresponding_Record_Type (Btype))
5802 return Has_Private_Component (Corresponding_Record_Type (Btype));
5807 end Has_Private_Component;
5809 -----------------------------
5810 -- Has_Static_Array_Bounds --
5811 -----------------------------
5813 function Has_Static_Array_Bounds (Typ : Node_Id) return Boolean is
5814 Ndims : constant Nat := Number_Dimensions (Typ);
5821 -- Unconstrained types do not have static bounds
5823 if not Is_Constrained (Typ) then
5827 -- First treat string literals specially, as the lower bound and length
5828 -- of string literals are not stored like those of arrays.
5830 -- A string literal always has static bounds
5832 if Ekind (Typ) = E_String_Literal_Subtype then
5836 -- Treat all dimensions in turn
5838 Index := First_Index (Typ);
5839 for Indx in 1 .. Ndims loop
5841 -- In case of an erroneous index which is not a discrete type, return
5842 -- that the type is not static.
5844 if not Is_Discrete_Type (Etype (Index))
5845 or else Etype (Index) = Any_Type
5850 Get_Index_Bounds (Index, Low, High);
5852 if Error_Posted (Low) or else Error_Posted (High) then
5856 if Is_OK_Static_Expression (Low)
5858 Is_OK_Static_Expression (High)
5868 -- If we fall through the loop, all indexes matched
5871 end Has_Static_Array_Bounds;
5877 function Has_Stream (T : Entity_Id) return Boolean is
5884 elsif Is_RTE (Root_Type (T), RE_Root_Stream_Type) then
5887 elsif Is_Array_Type (T) then
5888 return Has_Stream (Component_Type (T));
5890 elsif Is_Record_Type (T) then
5891 E := First_Component (T);
5892 while Present (E) loop
5893 if Has_Stream (Etype (E)) then
5902 elsif Is_Private_Type (T) then
5903 return Has_Stream (Underlying_Type (T));
5914 function Has_Suffix (E : Entity_Id; Suffix : Character) return Boolean is
5916 Get_Name_String (Chars (E));
5917 return Name_Buffer (Name_Len) = Suffix;
5920 --------------------------
5921 -- Has_Tagged_Component --
5922 --------------------------
5924 function Has_Tagged_Component (Typ : Entity_Id) return Boolean is
5928 if Is_Private_Type (Typ)
5929 and then Present (Underlying_Type (Typ))
5931 return Has_Tagged_Component (Underlying_Type (Typ));
5933 elsif Is_Array_Type (Typ) then
5934 return Has_Tagged_Component (Component_Type (Typ));
5936 elsif Is_Tagged_Type (Typ) then
5939 elsif Is_Record_Type (Typ) then
5940 Comp := First_Component (Typ);
5941 while Present (Comp) loop
5942 if Has_Tagged_Component (Etype (Comp)) then
5946 Next_Component (Comp);
5954 end Has_Tagged_Component;
5956 -------------------------
5957 -- Implementation_Kind --
5958 -------------------------
5960 function Implementation_Kind (Subp : Entity_Id) return Name_Id is
5961 Impl_Prag : constant Node_Id := Get_Rep_Pragma (Subp, Name_Implemented);
5963 pragma Assert (Present (Impl_Prag));
5965 Chars (Expression (Last (Pragma_Argument_Associations (Impl_Prag))));
5966 end Implementation_Kind;
5968 --------------------------
5969 -- Implements_Interface --
5970 --------------------------
5972 function Implements_Interface
5973 (Typ_Ent : Entity_Id;
5974 Iface_Ent : Entity_Id;
5975 Exclude_Parents : Boolean := False) return Boolean
5977 Ifaces_List : Elist_Id;
5979 Iface : Entity_Id := Base_Type (Iface_Ent);
5980 Typ : Entity_Id := Base_Type (Typ_Ent);
5983 if Is_Class_Wide_Type (Typ) then
5984 Typ := Root_Type (Typ);
5987 if not Has_Interfaces (Typ) then
5991 if Is_Class_Wide_Type (Iface) then
5992 Iface := Root_Type (Iface);
5995 Collect_Interfaces (Typ, Ifaces_List);
5997 Elmt := First_Elmt (Ifaces_List);
5998 while Present (Elmt) loop
5999 if Is_Ancestor (Node (Elmt), Typ, Use_Full_View => True)
6000 and then Exclude_Parents
6004 elsif Node (Elmt) = Iface then
6012 end Implements_Interface;
6018 function In_Instance return Boolean is
6019 Curr_Unit : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
6025 and then S /= Standard_Standard
6027 if (Ekind (S) = E_Function
6028 or else Ekind (S) = E_Package
6029 or else Ekind (S) = E_Procedure)
6030 and then Is_Generic_Instance (S)
6032 -- A child instance is always compiled in the context of a parent
6033 -- instance. Nevertheless, the actuals are not analyzed in an
6034 -- instance context. We detect this case by examining the current
6035 -- compilation unit, which must be a child instance, and checking
6036 -- that it is not currently on the scope stack.
6038 if Is_Child_Unit (Curr_Unit)
6040 Nkind (Unit (Cunit (Current_Sem_Unit)))
6041 = N_Package_Instantiation
6042 and then not In_Open_Scopes (Curr_Unit)
6056 ----------------------
6057 -- In_Instance_Body --
6058 ----------------------
6060 function In_Instance_Body return Boolean is
6066 and then S /= Standard_Standard
6068 if (Ekind (S) = E_Function
6069 or else Ekind (S) = E_Procedure)
6070 and then Is_Generic_Instance (S)
6074 elsif Ekind (S) = E_Package
6075 and then In_Package_Body (S)
6076 and then Is_Generic_Instance (S)
6085 end In_Instance_Body;
6087 -----------------------------
6088 -- In_Instance_Not_Visible --
6089 -----------------------------
6091 function In_Instance_Not_Visible return Boolean is
6097 and then S /= Standard_Standard
6099 if (Ekind (S) = E_Function
6100 or else Ekind (S) = E_Procedure)
6101 and then Is_Generic_Instance (S)
6105 elsif Ekind (S) = E_Package
6106 and then (In_Package_Body (S) or else In_Private_Part (S))
6107 and then Is_Generic_Instance (S)
6116 end In_Instance_Not_Visible;
6118 ------------------------------
6119 -- In_Instance_Visible_Part --
6120 ------------------------------
6122 function In_Instance_Visible_Part return Boolean is
6128 and then S /= Standard_Standard
6130 if Ekind (S) = E_Package
6131 and then Is_Generic_Instance (S)
6132 and then not In_Package_Body (S)
6133 and then not In_Private_Part (S)
6142 end In_Instance_Visible_Part;
6144 ---------------------
6145 -- In_Package_Body --
6146 ---------------------
6148 function In_Package_Body return Boolean is
6154 and then S /= Standard_Standard
6156 if Ekind (S) = E_Package
6157 and then In_Package_Body (S)
6166 end In_Package_Body;
6168 --------------------------------
6169 -- In_Parameter_Specification --
6170 --------------------------------
6172 function In_Parameter_Specification (N : Node_Id) return Boolean is
6177 while Present (PN) loop
6178 if Nkind (PN) = N_Parameter_Specification then
6186 end In_Parameter_Specification;
6188 --------------------------------------
6189 -- In_Subprogram_Or_Concurrent_Unit --
6190 --------------------------------------
6192 function In_Subprogram_Or_Concurrent_Unit return Boolean is
6197 -- Use scope chain to check successively outer scopes
6203 if K in Subprogram_Kind
6204 or else K in Concurrent_Kind
6205 or else K in Generic_Subprogram_Kind
6209 elsif E = Standard_Standard then
6215 end In_Subprogram_Or_Concurrent_Unit;
6217 ---------------------
6218 -- In_Visible_Part --
6219 ---------------------
6221 function In_Visible_Part (Scope_Id : Entity_Id) return Boolean is
6224 Is_Package_Or_Generic_Package (Scope_Id)
6225 and then In_Open_Scopes (Scope_Id)
6226 and then not In_Package_Body (Scope_Id)
6227 and then not In_Private_Part (Scope_Id);
6228 end In_Visible_Part;
6230 --------------------------------
6231 -- Incomplete_Or_Private_View --
6232 --------------------------------
6234 function Incomplete_Or_Private_View (Typ : Entity_Id) return Entity_Id is
6235 function Inspect_Decls
6237 Taft : Boolean := False) return Entity_Id;
6238 -- Check whether a declarative region contains the incomplete or private
6245 function Inspect_Decls
6247 Taft : Boolean := False) return Entity_Id
6253 Decl := First (Decls);
6254 while Present (Decl) loop
6258 if Nkind (Decl) = N_Incomplete_Type_Declaration then
6259 Match := Defining_Identifier (Decl);
6263 if Nkind_In (Decl, N_Private_Extension_Declaration,
6264 N_Private_Type_Declaration)
6266 Match := Defining_Identifier (Decl);
6271 and then Present (Full_View (Match))
6272 and then Full_View (Match) = Typ
6287 -- Start of processing for Incomplete_Or_Partial_View
6290 -- Incomplete type case
6292 Prev := Current_Entity_In_Scope (Typ);
6295 and then Is_Incomplete_Type (Prev)
6296 and then Present (Full_View (Prev))
6297 and then Full_View (Prev) = Typ
6302 -- Private or Taft amendment type case
6305 Pkg : constant Entity_Id := Scope (Typ);
6306 Pkg_Decl : Node_Id := Pkg;
6309 if Ekind (Pkg) = E_Package then
6310 while Nkind (Pkg_Decl) /= N_Package_Specification loop
6311 Pkg_Decl := Parent (Pkg_Decl);
6314 -- It is knows that Typ has a private view, look for it in the
6315 -- visible declarations of the enclosing scope. A special case
6316 -- of this is when the two views have been exchanged - the full
6317 -- appears earlier than the private.
6319 if Has_Private_Declaration (Typ) then
6320 Prev := Inspect_Decls (Visible_Declarations (Pkg_Decl));
6322 -- Exchanged view case, look in the private declarations
6325 Prev := Inspect_Decls (Private_Declarations (Pkg_Decl));
6330 -- Otherwise if this is the package body, then Typ is a potential
6331 -- Taft amendment type. The incomplete view should be located in
6332 -- the private declarations of the enclosing scope.
6334 elsif In_Package_Body (Pkg) then
6335 return Inspect_Decls (Private_Declarations (Pkg_Decl), True);
6340 -- The type has no incomplete or private view
6343 end Incomplete_Or_Private_View;
6345 ---------------------------------
6346 -- Insert_Explicit_Dereference --
6347 ---------------------------------
6349 procedure Insert_Explicit_Dereference (N : Node_Id) is
6350 New_Prefix : constant Node_Id := Relocate_Node (N);
6351 Ent : Entity_Id := Empty;
6358 Save_Interps (N, New_Prefix);
6361 Make_Explicit_Dereference (Sloc (Parent (N)),
6362 Prefix => New_Prefix));
6364 Set_Etype (N, Designated_Type (Etype (New_Prefix)));
6366 if Is_Overloaded (New_Prefix) then
6368 -- The dereference is also overloaded, and its interpretations are
6369 -- the designated types of the interpretations of the original node.
6371 Set_Etype (N, Any_Type);
6373 Get_First_Interp (New_Prefix, I, It);
6374 while Present (It.Nam) loop
6377 if Is_Access_Type (T) then
6378 Add_One_Interp (N, Designated_Type (T), Designated_Type (T));
6381 Get_Next_Interp (I, It);
6387 -- Prefix is unambiguous: mark the original prefix (which might
6388 -- Come_From_Source) as a reference, since the new (relocated) one
6389 -- won't be taken into account.
6391 if Is_Entity_Name (New_Prefix) then
6392 Ent := Entity (New_Prefix);
6395 -- For a retrieval of a subcomponent of some composite object,
6396 -- retrieve the ultimate entity if there is one.
6398 elsif Nkind (New_Prefix) = N_Selected_Component
6399 or else Nkind (New_Prefix) = N_Indexed_Component
6401 Pref := Prefix (New_Prefix);
6402 while Present (Pref)
6404 (Nkind (Pref) = N_Selected_Component
6405 or else Nkind (Pref) = N_Indexed_Component)
6407 Pref := Prefix (Pref);
6410 if Present (Pref) and then Is_Entity_Name (Pref) then
6411 Ent := Entity (Pref);
6415 -- Place the reference on the entity node
6417 if Present (Ent) then
6418 Generate_Reference (Ent, Pref);
6421 end Insert_Explicit_Dereference;
6423 ------------------------------------------
6424 -- Inspect_Deferred_Constant_Completion --
6425 ------------------------------------------
6427 procedure Inspect_Deferred_Constant_Completion (Decls : List_Id) is
6431 Decl := First (Decls);
6432 while Present (Decl) loop
6434 -- Deferred constant signature
6436 if Nkind (Decl) = N_Object_Declaration
6437 and then Constant_Present (Decl)
6438 and then No (Expression (Decl))
6440 -- No need to check internally generated constants
6442 and then Comes_From_Source (Decl)
6444 -- The constant is not completed. A full object declaration or a
6445 -- pragma Import complete a deferred constant.
6447 and then not Has_Completion (Defining_Identifier (Decl))
6450 ("constant declaration requires initialization expression",
6451 Defining_Identifier (Decl));
6454 Decl := Next (Decl);
6456 end Inspect_Deferred_Constant_Completion;
6458 -----------------------------
6459 -- Is_Actual_Out_Parameter --
6460 -----------------------------
6462 function Is_Actual_Out_Parameter (N : Node_Id) return Boolean is
6466 Find_Actual (N, Formal, Call);
6467 return Present (Formal) and then Ekind (Formal) = E_Out_Parameter;
6468 end Is_Actual_Out_Parameter;
6470 -------------------------
6471 -- Is_Actual_Parameter --
6472 -------------------------
6474 function Is_Actual_Parameter (N : Node_Id) return Boolean is
6475 PK : constant Node_Kind := Nkind (Parent (N));
6479 when N_Parameter_Association =>
6480 return N = Explicit_Actual_Parameter (Parent (N));
6482 when N_Function_Call | N_Procedure_Call_Statement =>
6483 return Is_List_Member (N)
6485 List_Containing (N) = Parameter_Associations (Parent (N));
6490 end Is_Actual_Parameter;
6492 --------------------------------
6493 -- Is_Actual_Tagged_Parameter --
6494 --------------------------------
6496 function Is_Actual_Tagged_Parameter (N : Node_Id) return Boolean is
6500 Find_Actual (N, Formal, Call);
6501 return Present (Formal) and then Is_Tagged_Type (Etype (Formal));
6502 end Is_Actual_Tagged_Parameter;
6504 ---------------------
6505 -- Is_Aliased_View --
6506 ---------------------
6508 function Is_Aliased_View (Obj : Node_Id) return Boolean is
6512 if Is_Entity_Name (Obj) then
6515 if Is_Object (E) and then not Is_Aliased (E) then
6516 Check_Restriction (No_Implicit_Aliasing, Obj);
6523 or else (Present (Renamed_Object (E))
6524 and then Is_Aliased_View (Renamed_Object (E)))))
6526 or else ((Is_Formal (E)
6527 or else Ekind (E) = E_Generic_In_Out_Parameter
6528 or else Ekind (E) = E_Generic_In_Parameter)
6529 and then Is_Tagged_Type (Etype (E)))
6531 or else (Is_Concurrent_Type (E)
6532 and then In_Open_Scopes (E))
6534 -- Current instance of type, either directly or as rewritten
6535 -- reference to the current object.
6537 or else (Is_Entity_Name (Original_Node (Obj))
6538 and then Present (Entity (Original_Node (Obj)))
6539 and then Is_Type (Entity (Original_Node (Obj))))
6541 or else (Is_Type (E) and then E = Current_Scope)
6543 or else (Is_Incomplete_Or_Private_Type (E)
6544 and then Full_View (E) = Current_Scope);
6546 elsif Nkind (Obj) = N_Selected_Component then
6547 return Is_Aliased (Entity (Selector_Name (Obj)));
6549 elsif Nkind (Obj) = N_Indexed_Component then
6550 return Has_Aliased_Components (Etype (Prefix (Obj)))
6552 (Is_Access_Type (Etype (Prefix (Obj)))
6553 and then Has_Aliased_Components
6554 (Designated_Type (Etype (Prefix (Obj)))));
6556 elsif Nkind_In (Obj, N_Unchecked_Type_Conversion, N_Type_Conversion) then
6557 return Is_Tagged_Type (Etype (Obj))
6558 and then Is_Aliased_View (Expression (Obj));
6560 elsif Nkind (Obj) = N_Explicit_Dereference then
6561 return Nkind (Original_Node (Obj)) /= N_Function_Call;
6566 end Is_Aliased_View;
6568 -------------------------
6569 -- Is_Ancestor_Package --
6570 -------------------------
6572 function Is_Ancestor_Package
6574 E2 : Entity_Id) return Boolean
6581 and then Par /= Standard_Standard
6591 end Is_Ancestor_Package;
6593 ----------------------
6594 -- Is_Atomic_Object --
6595 ----------------------
6597 function Is_Atomic_Object (N : Node_Id) return Boolean is
6599 function Object_Has_Atomic_Components (N : Node_Id) return Boolean;
6600 -- Determines if given object has atomic components
6602 function Is_Atomic_Prefix (N : Node_Id) return Boolean;
6603 -- If prefix is an implicit dereference, examine designated type
6605 ----------------------
6606 -- Is_Atomic_Prefix --
6607 ----------------------
6609 function Is_Atomic_Prefix (N : Node_Id) return Boolean is
6611 if Is_Access_Type (Etype (N)) then
6613 Has_Atomic_Components (Designated_Type (Etype (N)));
6615 return Object_Has_Atomic_Components (N);
6617 end Is_Atomic_Prefix;
6619 ----------------------------------
6620 -- Object_Has_Atomic_Components --
6621 ----------------------------------
6623 function Object_Has_Atomic_Components (N : Node_Id) return Boolean is
6625 if Has_Atomic_Components (Etype (N))
6626 or else Is_Atomic (Etype (N))
6630 elsif Is_Entity_Name (N)
6631 and then (Has_Atomic_Components (Entity (N))
6632 or else Is_Atomic (Entity (N)))
6636 elsif Nkind (N) = N_Indexed_Component
6637 or else Nkind (N) = N_Selected_Component
6639 return Is_Atomic_Prefix (Prefix (N));
6644 end Object_Has_Atomic_Components;
6646 -- Start of processing for Is_Atomic_Object
6649 -- Predicate is not relevant to subprograms
6651 if Is_Entity_Name (N) and then Is_Overloadable (Entity (N)) then
6654 elsif Is_Atomic (Etype (N))
6655 or else (Is_Entity_Name (N) and then Is_Atomic (Entity (N)))
6659 elsif Nkind (N) = N_Indexed_Component
6660 or else Nkind (N) = N_Selected_Component
6662 return Is_Atomic_Prefix (Prefix (N));
6667 end Is_Atomic_Object;
6669 -----------------------------
6670 -- Is_Concurrent_Interface --
6671 -----------------------------
6673 function Is_Concurrent_Interface (T : Entity_Id) return Boolean is
6678 (Is_Protected_Interface (T)
6679 or else Is_Synchronized_Interface (T)
6680 or else Is_Task_Interface (T));
6681 end Is_Concurrent_Interface;
6683 --------------------------------------
6684 -- Is_Controlling_Limited_Procedure --
6685 --------------------------------------
6687 function Is_Controlling_Limited_Procedure
6688 (Proc_Nam : Entity_Id) return Boolean
6690 Param_Typ : Entity_Id := Empty;
6693 if Ekind (Proc_Nam) = E_Procedure
6694 and then Present (Parameter_Specifications (Parent (Proc_Nam)))
6696 Param_Typ := Etype (Parameter_Type (First (
6697 Parameter_Specifications (Parent (Proc_Nam)))));
6699 -- In this case where an Itype was created, the procedure call has been
6702 elsif Present (Associated_Node_For_Itype (Proc_Nam))
6703 and then Present (Original_Node (Associated_Node_For_Itype (Proc_Nam)))
6705 Present (Parameter_Associations
6706 (Associated_Node_For_Itype (Proc_Nam)))
6709 Etype (First (Parameter_Associations
6710 (Associated_Node_For_Itype (Proc_Nam))));
6713 if Present (Param_Typ) then
6715 Is_Interface (Param_Typ)
6716 and then Is_Limited_Record (Param_Typ);
6720 end Is_Controlling_Limited_Procedure;
6722 -----------------------------
6723 -- Is_CPP_Constructor_Call --
6724 -----------------------------
6726 function Is_CPP_Constructor_Call (N : Node_Id) return Boolean is
6728 return Nkind (N) = N_Function_Call
6729 and then Is_CPP_Class (Etype (Etype (N)))
6730 and then Is_Constructor (Entity (Name (N)))
6731 and then Is_Imported (Entity (Name (N)));
6732 end Is_CPP_Constructor_Call;
6738 function Is_Delegate (T : Entity_Id) return Boolean is
6739 Desig_Type : Entity_Id;
6742 if VM_Target /= CLI_Target then
6746 -- Access-to-subprograms are delegates in CIL
6748 if Ekind (T) = E_Access_Subprogram_Type then
6752 if Ekind (T) not in Access_Kind then
6754 -- A delegate is a managed pointer. If no designated type is defined
6755 -- it means that it's not a delegate.
6760 Desig_Type := Etype (Directly_Designated_Type (T));
6762 if not Is_Tagged_Type (Desig_Type) then
6766 -- Test if the type is inherited from [mscorlib]System.Delegate
6768 while Etype (Desig_Type) /= Desig_Type loop
6769 if Chars (Scope (Desig_Type)) /= No_Name
6770 and then Is_Imported (Scope (Desig_Type))
6771 and then Get_Name_String (Chars (Scope (Desig_Type))) = "delegate"
6776 Desig_Type := Etype (Desig_Type);
6782 ----------------------------------------------
6783 -- Is_Dependent_Component_Of_Mutable_Object --
6784 ----------------------------------------------
6786 function Is_Dependent_Component_Of_Mutable_Object
6787 (Object : Node_Id) return Boolean
6790 Prefix_Type : Entity_Id;
6791 P_Aliased : Boolean := False;
6794 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean;
6795 -- Returns True if and only if Comp is declared within a variant part
6797 --------------------------------
6798 -- Is_Declared_Within_Variant --
6799 --------------------------------
6801 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean is
6802 Comp_Decl : constant Node_Id := Parent (Comp);
6803 Comp_List : constant Node_Id := Parent (Comp_Decl);
6805 return Nkind (Parent (Comp_List)) = N_Variant;
6806 end Is_Declared_Within_Variant;
6808 -- Start of processing for Is_Dependent_Component_Of_Mutable_Object
6811 if Is_Variable (Object) then
6813 if Nkind (Object) = N_Selected_Component then
6814 P := Prefix (Object);
6815 Prefix_Type := Etype (P);
6817 if Is_Entity_Name (P) then
6819 if Ekind (Entity (P)) = E_Generic_In_Out_Parameter then
6820 Prefix_Type := Base_Type (Prefix_Type);
6823 if Is_Aliased (Entity (P)) then
6827 -- A discriminant check on a selected component may be expanded
6828 -- into a dereference when removing side-effects. Recover the
6829 -- original node and its type, which may be unconstrained.
6831 elsif Nkind (P) = N_Explicit_Dereference
6832 and then not (Comes_From_Source (P))
6834 P := Original_Node (P);
6835 Prefix_Type := Etype (P);
6838 -- Check for prefix being an aliased component???
6844 -- A heap object is constrained by its initial value
6846 -- Ada 2005 (AI-363): Always assume the object could be mutable in
6847 -- the dereferenced case, since the access value might denote an
6848 -- unconstrained aliased object, whereas in Ada 95 the designated
6849 -- object is guaranteed to be constrained. A worst-case assumption
6850 -- has to apply in Ada 2005 because we can't tell at compile time
6851 -- whether the object is "constrained by its initial value"
6852 -- (despite the fact that 3.10.2(26/2) and 8.5.1(5/2) are
6853 -- semantic rules -- these rules are acknowledged to need fixing).
6855 if Ada_Version < Ada_2005 then
6856 if Is_Access_Type (Prefix_Type)
6857 or else Nkind (P) = N_Explicit_Dereference
6862 elsif Ada_Version >= Ada_2005 then
6863 if Is_Access_Type (Prefix_Type) then
6865 -- If the access type is pool-specific, and there is no
6866 -- constrained partial view of the designated type, then the
6867 -- designated object is known to be constrained.
6869 if Ekind (Prefix_Type) = E_Access_Type
6870 and then not Has_Constrained_Partial_View
6871 (Designated_Type (Prefix_Type))
6875 -- Otherwise (general access type, or there is a constrained
6876 -- partial view of the designated type), we need to check
6877 -- based on the designated type.
6880 Prefix_Type := Designated_Type (Prefix_Type);
6886 Original_Record_Component (Entity (Selector_Name (Object)));
6888 -- As per AI-0017, the renaming is illegal in a generic body, even
6889 -- if the subtype is indefinite.
6891 -- Ada 2005 (AI-363): In Ada 2005 an aliased object can be mutable
6893 if not Is_Constrained (Prefix_Type)
6894 and then (not Is_Indefinite_Subtype (Prefix_Type)
6896 (Is_Generic_Type (Prefix_Type)
6897 and then Ekind (Current_Scope) = E_Generic_Package
6898 and then In_Package_Body (Current_Scope)))
6900 and then (Is_Declared_Within_Variant (Comp)
6901 or else Has_Discriminant_Dependent_Constraint (Comp))
6902 and then (not P_Aliased or else Ada_Version >= Ada_2005)
6908 Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
6912 elsif Nkind (Object) = N_Indexed_Component
6913 or else Nkind (Object) = N_Slice
6915 return Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
6917 -- A type conversion that Is_Variable is a view conversion:
6918 -- go back to the denoted object.
6920 elsif Nkind (Object) = N_Type_Conversion then
6922 Is_Dependent_Component_Of_Mutable_Object (Expression (Object));
6927 end Is_Dependent_Component_Of_Mutable_Object;
6929 ---------------------
6930 -- Is_Dereferenced --
6931 ---------------------
6933 function Is_Dereferenced (N : Node_Id) return Boolean is
6934 P : constant Node_Id := Parent (N);
6937 (Nkind (P) = N_Selected_Component
6939 Nkind (P) = N_Explicit_Dereference
6941 Nkind (P) = N_Indexed_Component
6943 Nkind (P) = N_Slice)
6944 and then Prefix (P) = N;
6945 end Is_Dereferenced;
6947 ----------------------
6948 -- Is_Descendent_Of --
6949 ----------------------
6951 function Is_Descendent_Of (T1 : Entity_Id; T2 : Entity_Id) return Boolean is
6956 pragma Assert (Nkind (T1) in N_Entity);
6957 pragma Assert (Nkind (T2) in N_Entity);
6959 T := Base_Type (T1);
6961 -- Immediate return if the types match
6966 -- Comment needed here ???
6968 elsif Ekind (T) = E_Class_Wide_Type then
6969 return Etype (T) = T2;
6977 -- Done if we found the type we are looking for
6982 -- Done if no more derivations to check
6989 -- Following test catches error cases resulting from prev errors
6991 elsif No (Etyp) then
6994 elsif Is_Private_Type (T) and then Etyp = Full_View (T) then
6997 elsif Is_Private_Type (Etyp) and then Full_View (Etyp) = T then
7001 T := Base_Type (Etyp);
7004 end Is_Descendent_Of;
7006 ----------------------------
7007 -- Is_Expression_Function --
7008 ----------------------------
7010 function Is_Expression_Function (Subp : Entity_Id) return Boolean is
7011 Decl : constant Node_Id := Unit_Declaration_Node (Subp);
7014 return Ekind (Subp) = E_Function
7015 and then Nkind (Decl) = N_Subprogram_Declaration
7017 (Nkind (Original_Node (Decl)) = N_Expression_Function
7019 (Present (Corresponding_Body (Decl))
7021 Nkind (Original_Node
7022 (Unit_Declaration_Node (Corresponding_Body (Decl))))
7023 = N_Expression_Function));
7024 end Is_Expression_Function;
7030 function Is_False (U : Uint) return Boolean is
7035 ---------------------------
7036 -- Is_Fixed_Model_Number --
7037 ---------------------------
7039 function Is_Fixed_Model_Number (U : Ureal; T : Entity_Id) return Boolean is
7040 S : constant Ureal := Small_Value (T);
7041 M : Urealp.Save_Mark;
7045 R := (U = UR_Trunc (U / S) * S);
7048 end Is_Fixed_Model_Number;
7050 -------------------------------
7051 -- Is_Fully_Initialized_Type --
7052 -------------------------------
7054 function Is_Fully_Initialized_Type (Typ : Entity_Id) return Boolean is
7056 if Is_Scalar_Type (Typ) then
7059 elsif Is_Access_Type (Typ) then
7062 elsif Is_Array_Type (Typ) then
7063 if Is_Fully_Initialized_Type (Component_Type (Typ)) then
7067 -- An interesting case, if we have a constrained type one of whose
7068 -- bounds is known to be null, then there are no elements to be
7069 -- initialized, so all the elements are initialized!
7071 if Is_Constrained (Typ) then
7074 Indx_Typ : Entity_Id;
7078 Indx := First_Index (Typ);
7079 while Present (Indx) loop
7080 if Etype (Indx) = Any_Type then
7083 -- If index is a range, use directly
7085 elsif Nkind (Indx) = N_Range then
7086 Lbd := Low_Bound (Indx);
7087 Hbd := High_Bound (Indx);
7090 Indx_Typ := Etype (Indx);
7092 if Is_Private_Type (Indx_Typ) then
7093 Indx_Typ := Full_View (Indx_Typ);
7096 if No (Indx_Typ) or else Etype (Indx_Typ) = Any_Type then
7099 Lbd := Type_Low_Bound (Indx_Typ);
7100 Hbd := Type_High_Bound (Indx_Typ);
7104 if Compile_Time_Known_Value (Lbd)
7105 and then Compile_Time_Known_Value (Hbd)
7107 if Expr_Value (Hbd) < Expr_Value (Lbd) then
7117 -- If no null indexes, then type is not fully initialized
7123 elsif Is_Record_Type (Typ) then
7124 if Has_Discriminants (Typ)
7126 Present (Discriminant_Default_Value (First_Discriminant (Typ)))
7127 and then Is_Fully_Initialized_Variant (Typ)
7132 -- Controlled records are considered to be fully initialized if
7133 -- there is a user defined Initialize routine. This may not be
7134 -- entirely correct, but as the spec notes, we are guessing here
7135 -- what is best from the point of view of issuing warnings.
7137 if Is_Controlled (Typ) then
7139 Utyp : constant Entity_Id := Underlying_Type (Typ);
7142 if Present (Utyp) then
7144 Init : constant Entity_Id :=
7146 (Underlying_Type (Typ), Name_Initialize));
7150 and then Comes_From_Source (Init)
7152 Is_Predefined_File_Name
7153 (File_Name (Get_Source_File_Index (Sloc (Init))))
7157 elsif Has_Null_Extension (Typ)
7159 Is_Fully_Initialized_Type
7160 (Etype (Base_Type (Typ)))
7169 -- Otherwise see if all record components are initialized
7175 Ent := First_Entity (Typ);
7176 while Present (Ent) loop
7177 if Ekind (Ent) = E_Component
7178 and then (No (Parent (Ent))
7179 or else No (Expression (Parent (Ent))))
7180 and then not Is_Fully_Initialized_Type (Etype (Ent))
7182 -- Special VM case for tag components, which need to be
7183 -- defined in this case, but are never initialized as VMs
7184 -- are using other dispatching mechanisms. Ignore this
7185 -- uninitialized case. Note that this applies both to the
7186 -- uTag entry and the main vtable pointer (CPP_Class case).
7188 and then (Tagged_Type_Expansion or else not Is_Tag (Ent))
7197 -- No uninitialized components, so type is fully initialized.
7198 -- Note that this catches the case of no components as well.
7202 elsif Is_Concurrent_Type (Typ) then
7205 elsif Is_Private_Type (Typ) then
7207 U : constant Entity_Id := Underlying_Type (Typ);
7213 return Is_Fully_Initialized_Type (U);
7220 end Is_Fully_Initialized_Type;
7222 ----------------------------------
7223 -- Is_Fully_Initialized_Variant --
7224 ----------------------------------
7226 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean is
7227 Loc : constant Source_Ptr := Sloc (Typ);
7228 Constraints : constant List_Id := New_List;
7229 Components : constant Elist_Id := New_Elmt_List;
7230 Comp_Elmt : Elmt_Id;
7232 Comp_List : Node_Id;
7234 Discr_Val : Node_Id;
7236 Report_Errors : Boolean;
7237 pragma Warnings (Off, Report_Errors);
7240 if Serious_Errors_Detected > 0 then
7244 if Is_Record_Type (Typ)
7245 and then Nkind (Parent (Typ)) = N_Full_Type_Declaration
7246 and then Nkind (Type_Definition (Parent (Typ))) = N_Record_Definition
7248 Comp_List := Component_List (Type_Definition (Parent (Typ)));
7250 Discr := First_Discriminant (Typ);
7251 while Present (Discr) loop
7252 if Nkind (Parent (Discr)) = N_Discriminant_Specification then
7253 Discr_Val := Expression (Parent (Discr));
7255 if Present (Discr_Val)
7256 and then Is_OK_Static_Expression (Discr_Val)
7258 Append_To (Constraints,
7259 Make_Component_Association (Loc,
7260 Choices => New_List (New_Occurrence_Of (Discr, Loc)),
7261 Expression => New_Copy (Discr_Val)));
7269 Next_Discriminant (Discr);
7274 Comp_List => Comp_List,
7275 Governed_By => Constraints,
7277 Report_Errors => Report_Errors);
7279 -- Check that each component present is fully initialized
7281 Comp_Elmt := First_Elmt (Components);
7282 while Present (Comp_Elmt) loop
7283 Comp_Id := Node (Comp_Elmt);
7285 if Ekind (Comp_Id) = E_Component
7286 and then (No (Parent (Comp_Id))
7287 or else No (Expression (Parent (Comp_Id))))
7288 and then not Is_Fully_Initialized_Type (Etype (Comp_Id))
7293 Next_Elmt (Comp_Elmt);
7298 elsif Is_Private_Type (Typ) then
7300 U : constant Entity_Id := Underlying_Type (Typ);
7306 return Is_Fully_Initialized_Variant (U);
7312 end Is_Fully_Initialized_Variant;
7318 function Is_Iterator (Typ : Entity_Id) return Boolean is
7319 Ifaces_List : Elist_Id;
7320 Iface_Elmt : Elmt_Id;
7324 if Is_Class_Wide_Type (Typ)
7326 (Chars (Etype (Typ)) = Name_Forward_Iterator
7328 Chars (Etype (Typ)) = Name_Reversible_Iterator)
7330 Is_Predefined_File_Name
7331 (Unit_File_Name (Get_Source_Unit (Etype (Typ))))
7335 elsif not Is_Tagged_Type (Typ) or else not Is_Derived_Type (Typ) then
7339 Collect_Interfaces (Typ, Ifaces_List);
7341 Iface_Elmt := First_Elmt (Ifaces_List);
7342 while Present (Iface_Elmt) loop
7343 Iface := Node (Iface_Elmt);
7344 if Chars (Iface) = Name_Forward_Iterator
7346 Is_Predefined_File_Name
7347 (Unit_File_Name (Get_Source_Unit (Iface)))
7352 Next_Elmt (Iface_Elmt);
7363 -- We seem to have a lot of overlapping functions that do similar things
7364 -- (testing for left hand sides or lvalues???). Anyway, since this one is
7365 -- purely syntactic, it should be in Sem_Aux I would think???
7367 function Is_LHS (N : Node_Id) return Boolean is
7368 P : constant Node_Id := Parent (N);
7371 if Nkind (P) = N_Assignment_Statement then
7372 return Name (P) = N;
7375 Nkind_In (P, N_Indexed_Component, N_Selected_Component, N_Slice)
7377 return N = Prefix (P) and then Is_LHS (P);
7384 ----------------------------
7385 -- Is_Inherited_Operation --
7386 ----------------------------
7388 function Is_Inherited_Operation (E : Entity_Id) return Boolean is
7389 Kind : constant Node_Kind := Nkind (Parent (E));
7391 pragma Assert (Is_Overloadable (E));
7392 return Kind = N_Full_Type_Declaration
7393 or else Kind = N_Private_Extension_Declaration
7394 or else Kind = N_Subtype_Declaration
7395 or else (Ekind (E) = E_Enumeration_Literal
7396 and then Is_Derived_Type (Etype (E)));
7397 end Is_Inherited_Operation;
7399 -------------------------------------
7400 -- Is_Inherited_Operation_For_Type --
7401 -------------------------------------
7403 function Is_Inherited_Operation_For_Type
7404 (E : Entity_Id; Typ : Entity_Id) return Boolean
7407 return Is_Inherited_Operation (E)
7408 and then Etype (Parent (E)) = Typ;
7409 end Is_Inherited_Operation_For_Type;
7411 -----------------------------
7412 -- Is_Library_Level_Entity --
7413 -----------------------------
7415 function Is_Library_Level_Entity (E : Entity_Id) return Boolean is
7417 -- The following is a small optimization, and it also properly handles
7418 -- discriminals, which in task bodies might appear in expressions before
7419 -- the corresponding procedure has been created, and which therefore do
7420 -- not have an assigned scope.
7422 if Is_Formal (E) then
7426 -- Normal test is simply that the enclosing dynamic scope is Standard
7428 return Enclosing_Dynamic_Scope (E) = Standard_Standard;
7429 end Is_Library_Level_Entity;
7431 ---------------------------------
7432 -- Is_Local_Variable_Reference --
7433 ---------------------------------
7435 function Is_Local_Variable_Reference (Expr : Node_Id) return Boolean is
7437 if not Is_Entity_Name (Expr) then
7442 Ent : constant Entity_Id := Entity (Expr);
7443 Sub : constant Entity_Id := Enclosing_Subprogram (Ent);
7445 if not Ekind_In (Ent, E_Variable, E_In_Out_Parameter) then
7448 return Present (Sub) and then Sub = Current_Subprogram;
7452 end Is_Local_Variable_Reference;
7454 -------------------------
7455 -- Is_Object_Reference --
7456 -------------------------
7458 function Is_Object_Reference (N : Node_Id) return Boolean is
7460 if Is_Entity_Name (N) then
7461 return Present (Entity (N)) and then Is_Object (Entity (N));
7465 when N_Indexed_Component | N_Slice =>
7467 Is_Object_Reference (Prefix (N))
7468 or else Is_Access_Type (Etype (Prefix (N)));
7470 -- In Ada95, a function call is a constant object; a procedure
7473 when N_Function_Call =>
7474 return Etype (N) /= Standard_Void_Type;
7476 -- A reference to the stream attribute Input is a function call
7478 when N_Attribute_Reference =>
7479 return Attribute_Name (N) = Name_Input;
7481 when N_Selected_Component =>
7483 Is_Object_Reference (Selector_Name (N))
7485 (Is_Object_Reference (Prefix (N))
7486 or else Is_Access_Type (Etype (Prefix (N))));
7488 when N_Explicit_Dereference =>
7491 -- A view conversion of a tagged object is an object reference
7493 when N_Type_Conversion =>
7494 return Is_Tagged_Type (Etype (Subtype_Mark (N)))
7495 and then Is_Tagged_Type (Etype (Expression (N)))
7496 and then Is_Object_Reference (Expression (N));
7498 -- An unchecked type conversion is considered to be an object if
7499 -- the operand is an object (this construction arises only as a
7500 -- result of expansion activities).
7502 when N_Unchecked_Type_Conversion =>
7509 end Is_Object_Reference;
7511 -----------------------------------
7512 -- Is_OK_Variable_For_Out_Formal --
7513 -----------------------------------
7515 function Is_OK_Variable_For_Out_Formal (AV : Node_Id) return Boolean is
7517 Note_Possible_Modification (AV, Sure => True);
7519 -- We must reject parenthesized variable names. The check for
7520 -- Comes_From_Source is present because there are currently
7521 -- cases where the compiler violates this rule (e.g. passing
7522 -- a task object to its controlled Initialize routine).
7524 if Paren_Count (AV) > 0 and then Comes_From_Source (AV) then
7527 -- A variable is always allowed
7529 elsif Is_Variable (AV) then
7532 -- Unchecked conversions are allowed only if they come from the
7533 -- generated code, which sometimes uses unchecked conversions for out
7534 -- parameters in cases where code generation is unaffected. We tell
7535 -- source unchecked conversions by seeing if they are rewrites of an
7536 -- original Unchecked_Conversion function call, or of an explicit
7537 -- conversion of a function call.
7539 elsif Nkind (AV) = N_Unchecked_Type_Conversion then
7540 if Nkind (Original_Node (AV)) = N_Function_Call then
7543 elsif Comes_From_Source (AV)
7544 and then Nkind (Original_Node (Expression (AV))) = N_Function_Call
7548 elsif Nkind (Original_Node (AV)) = N_Type_Conversion then
7549 return Is_OK_Variable_For_Out_Formal (Expression (AV));
7555 -- Normal type conversions are allowed if argument is a variable
7557 elsif Nkind (AV) = N_Type_Conversion then
7558 if Is_Variable (Expression (AV))
7559 and then Paren_Count (Expression (AV)) = 0
7561 Note_Possible_Modification (Expression (AV), Sure => True);
7564 -- We also allow a non-parenthesized expression that raises
7565 -- constraint error if it rewrites what used to be a variable
7567 elsif Raises_Constraint_Error (Expression (AV))
7568 and then Paren_Count (Expression (AV)) = 0
7569 and then Is_Variable (Original_Node (Expression (AV)))
7573 -- Type conversion of something other than a variable
7579 -- If this node is rewritten, then test the original form, if that is
7580 -- OK, then we consider the rewritten node OK (for example, if the
7581 -- original node is a conversion, then Is_Variable will not be true
7582 -- but we still want to allow the conversion if it converts a variable).
7584 elsif Original_Node (AV) /= AV then
7586 -- In Ada2012, the explicit dereference may be a rewritten call to a
7587 -- Reference function.
7589 if Ada_Version >= Ada_2012
7590 and then Nkind (Original_Node (AV)) = N_Function_Call
7592 Has_Implicit_Dereference (Etype (Name (Original_Node (AV))))
7597 return Is_OK_Variable_For_Out_Formal (Original_Node (AV));
7600 -- All other non-variables are rejected
7605 end Is_OK_Variable_For_Out_Formal;
7607 -----------------------------------
7608 -- Is_Partially_Initialized_Type --
7609 -----------------------------------
7611 function Is_Partially_Initialized_Type
7613 Include_Implicit : Boolean := True) return Boolean
7616 if Is_Scalar_Type (Typ) then
7619 elsif Is_Access_Type (Typ) then
7620 return Include_Implicit;
7622 elsif Is_Array_Type (Typ) then
7624 -- If component type is partially initialized, so is array type
7626 if Is_Partially_Initialized_Type
7627 (Component_Type (Typ), Include_Implicit)
7631 -- Otherwise we are only partially initialized if we are fully
7632 -- initialized (this is the empty array case, no point in us
7633 -- duplicating that code here).
7636 return Is_Fully_Initialized_Type (Typ);
7639 elsif Is_Record_Type (Typ) then
7641 -- A discriminated type is always partially initialized if in
7644 if Has_Discriminants (Typ) and then Include_Implicit then
7647 -- A tagged type is always partially initialized
7649 elsif Is_Tagged_Type (Typ) then
7652 -- Case of non-discriminated record
7658 Component_Present : Boolean := False;
7659 -- Set True if at least one component is present. If no
7660 -- components are present, then record type is fully
7661 -- initialized (another odd case, like the null array).
7664 -- Loop through components
7666 Ent := First_Entity (Typ);
7667 while Present (Ent) loop
7668 if Ekind (Ent) = E_Component then
7669 Component_Present := True;
7671 -- If a component has an initialization expression then
7672 -- the enclosing record type is partially initialized
7674 if Present (Parent (Ent))
7675 and then Present (Expression (Parent (Ent)))
7679 -- If a component is of a type which is itself partially
7680 -- initialized, then the enclosing record type is also.
7682 elsif Is_Partially_Initialized_Type
7683 (Etype (Ent), Include_Implicit)
7692 -- No initialized components found. If we found any components
7693 -- they were all uninitialized so the result is false.
7695 if Component_Present then
7698 -- But if we found no components, then all the components are
7699 -- initialized so we consider the type to be initialized.
7707 -- Concurrent types are always fully initialized
7709 elsif Is_Concurrent_Type (Typ) then
7712 -- For a private type, go to underlying type. If there is no underlying
7713 -- type then just assume this partially initialized. Not clear if this
7714 -- can happen in a non-error case, but no harm in testing for this.
7716 elsif Is_Private_Type (Typ) then
7718 U : constant Entity_Id := Underlying_Type (Typ);
7723 return Is_Partially_Initialized_Type (U, Include_Implicit);
7727 -- For any other type (are there any?) assume partially initialized
7732 end Is_Partially_Initialized_Type;
7734 ------------------------------------
7735 -- Is_Potentially_Persistent_Type --
7736 ------------------------------------
7738 function Is_Potentially_Persistent_Type (T : Entity_Id) return Boolean is
7743 -- For private type, test corresponding full type
7745 if Is_Private_Type (T) then
7746 return Is_Potentially_Persistent_Type (Full_View (T));
7748 -- Scalar types are potentially persistent
7750 elsif Is_Scalar_Type (T) then
7753 -- Record type is potentially persistent if not tagged and the types of
7754 -- all it components are potentially persistent, and no component has
7755 -- an initialization expression.
7757 elsif Is_Record_Type (T)
7758 and then not Is_Tagged_Type (T)
7759 and then not Is_Partially_Initialized_Type (T)
7761 Comp := First_Component (T);
7762 while Present (Comp) loop
7763 if not Is_Potentially_Persistent_Type (Etype (Comp)) then
7772 -- Array type is potentially persistent if its component type is
7773 -- potentially persistent and if all its constraints are static.
7775 elsif Is_Array_Type (T) then
7776 if not Is_Potentially_Persistent_Type (Component_Type (T)) then
7780 Indx := First_Index (T);
7781 while Present (Indx) loop
7782 if not Is_OK_Static_Subtype (Etype (Indx)) then
7791 -- All other types are not potentially persistent
7796 end Is_Potentially_Persistent_Type;
7798 ---------------------------------
7799 -- Is_Protected_Self_Reference --
7800 ---------------------------------
7802 function Is_Protected_Self_Reference (N : Node_Id) return Boolean is
7804 function In_Access_Definition (N : Node_Id) return Boolean;
7805 -- Returns true if N belongs to an access definition
7807 --------------------------
7808 -- In_Access_Definition --
7809 --------------------------
7811 function In_Access_Definition (N : Node_Id) return Boolean is
7816 while Present (P) loop
7817 if Nkind (P) = N_Access_Definition then
7825 end In_Access_Definition;
7827 -- Start of processing for Is_Protected_Self_Reference
7830 -- Verify that prefix is analyzed and has the proper form. Note that
7831 -- the attributes Elab_Spec, Elab_Body, Elab_Subp_Body and UET_Address,
7832 -- which also produce the address of an entity, do not analyze their
7833 -- prefix because they denote entities that are not necessarily visible.
7834 -- Neither of them can apply to a protected type.
7836 return Ada_Version >= Ada_2005
7837 and then Is_Entity_Name (N)
7838 and then Present (Entity (N))
7839 and then Is_Protected_Type (Entity (N))
7840 and then In_Open_Scopes (Entity (N))
7841 and then not In_Access_Definition (N);
7842 end Is_Protected_Self_Reference;
7844 -----------------------------
7845 -- Is_RCI_Pkg_Spec_Or_Body --
7846 -----------------------------
7848 function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
7850 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
7851 -- Return True if the unit of Cunit is an RCI package declaration
7853 ---------------------------
7854 -- Is_RCI_Pkg_Decl_Cunit --
7855 ---------------------------
7857 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean is
7858 The_Unit : constant Node_Id := Unit (Cunit);
7861 if Nkind (The_Unit) /= N_Package_Declaration then
7865 return Is_Remote_Call_Interface (Defining_Entity (The_Unit));
7866 end Is_RCI_Pkg_Decl_Cunit;
7868 -- Start of processing for Is_RCI_Pkg_Spec_Or_Body
7871 return Is_RCI_Pkg_Decl_Cunit (Cunit)
7873 (Nkind (Unit (Cunit)) = N_Package_Body
7874 and then Is_RCI_Pkg_Decl_Cunit (Library_Unit (Cunit)));
7875 end Is_RCI_Pkg_Spec_Or_Body;
7877 -----------------------------------------
7878 -- Is_Remote_Access_To_Class_Wide_Type --
7879 -----------------------------------------
7881 function Is_Remote_Access_To_Class_Wide_Type
7882 (E : Entity_Id) return Boolean
7885 -- A remote access to class-wide type is a general access to object type
7886 -- declared in the visible part of a Remote_Types or Remote_Call_
7889 return Ekind (E) = E_General_Access_Type
7890 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
7891 end Is_Remote_Access_To_Class_Wide_Type;
7893 -----------------------------------------
7894 -- Is_Remote_Access_To_Subprogram_Type --
7895 -----------------------------------------
7897 function Is_Remote_Access_To_Subprogram_Type
7898 (E : Entity_Id) return Boolean
7901 return (Ekind (E) = E_Access_Subprogram_Type
7902 or else (Ekind (E) = E_Record_Type
7903 and then Present (Corresponding_Remote_Type (E))))
7904 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
7905 end Is_Remote_Access_To_Subprogram_Type;
7907 --------------------
7908 -- Is_Remote_Call --
7909 --------------------
7911 function Is_Remote_Call (N : Node_Id) return Boolean is
7913 if Nkind (N) /= N_Procedure_Call_Statement
7914 and then Nkind (N) /= N_Function_Call
7916 -- An entry call cannot be remote
7920 elsif Nkind (Name (N)) in N_Has_Entity
7921 and then Is_Remote_Call_Interface (Entity (Name (N)))
7923 -- A subprogram declared in the spec of a RCI package is remote
7927 elsif Nkind (Name (N)) = N_Explicit_Dereference
7928 and then Is_Remote_Access_To_Subprogram_Type
7929 (Etype (Prefix (Name (N))))
7931 -- The dereference of a RAS is a remote call
7935 elsif Present (Controlling_Argument (N))
7936 and then Is_Remote_Access_To_Class_Wide_Type
7937 (Etype (Controlling_Argument (N)))
7939 -- Any primitive operation call with a controlling argument of
7940 -- a RACW type is a remote call.
7945 -- All other calls are local calls
7950 ----------------------
7951 -- Is_Renamed_Entry --
7952 ----------------------
7954 function Is_Renamed_Entry (Proc_Nam : Entity_Id) return Boolean is
7955 Orig_Node : Node_Id := Empty;
7956 Subp_Decl : Node_Id := Parent (Parent (Proc_Nam));
7958 function Is_Entry (Nam : Node_Id) return Boolean;
7959 -- Determine whether Nam is an entry. Traverse selectors if there are
7960 -- nested selected components.
7966 function Is_Entry (Nam : Node_Id) return Boolean is
7968 if Nkind (Nam) = N_Selected_Component then
7969 return Is_Entry (Selector_Name (Nam));
7972 return Ekind (Entity (Nam)) = E_Entry;
7975 -- Start of processing for Is_Renamed_Entry
7978 if Present (Alias (Proc_Nam)) then
7979 Subp_Decl := Parent (Parent (Alias (Proc_Nam)));
7982 -- Look for a rewritten subprogram renaming declaration
7984 if Nkind (Subp_Decl) = N_Subprogram_Declaration
7985 and then Present (Original_Node (Subp_Decl))
7987 Orig_Node := Original_Node (Subp_Decl);
7990 -- The rewritten subprogram is actually an entry
7992 if Present (Orig_Node)
7993 and then Nkind (Orig_Node) = N_Subprogram_Renaming_Declaration
7994 and then Is_Entry (Name (Orig_Node))
8000 end Is_Renamed_Entry;
8002 ----------------------------
8003 -- Is_Reversible_Iterator --
8004 ----------------------------
8006 function Is_Reversible_Iterator (Typ : Entity_Id) return Boolean is
8007 Ifaces_List : Elist_Id;
8008 Iface_Elmt : Elmt_Id;
8012 if Is_Class_Wide_Type (Typ)
8013 and then Chars (Etype (Typ)) = Name_Reversible_Iterator
8015 Is_Predefined_File_Name
8016 (Unit_File_Name (Get_Source_Unit (Etype (Typ))))
8020 elsif not Is_Tagged_Type (Typ)
8021 or else not Is_Derived_Type (Typ)
8026 Collect_Interfaces (Typ, Ifaces_List);
8028 Iface_Elmt := First_Elmt (Ifaces_List);
8029 while Present (Iface_Elmt) loop
8030 Iface := Node (Iface_Elmt);
8031 if Chars (Iface) = Name_Reversible_Iterator
8033 Is_Predefined_File_Name
8034 (Unit_File_Name (Get_Source_Unit (Iface)))
8039 Next_Elmt (Iface_Elmt);
8044 end Is_Reversible_Iterator;
8046 ----------------------
8047 -- Is_Selector_Name --
8048 ----------------------
8050 function Is_Selector_Name (N : Node_Id) return Boolean is
8052 if not Is_List_Member (N) then
8054 P : constant Node_Id := Parent (N);
8055 K : constant Node_Kind := Nkind (P);
8058 (K = N_Expanded_Name or else
8059 K = N_Generic_Association or else
8060 K = N_Parameter_Association or else
8061 K = N_Selected_Component)
8062 and then Selector_Name (P) = N;
8067 L : constant List_Id := List_Containing (N);
8068 P : constant Node_Id := Parent (L);
8070 return (Nkind (P) = N_Discriminant_Association
8071 and then Selector_Names (P) = L)
8073 (Nkind (P) = N_Component_Association
8074 and then Choices (P) = L);
8077 end Is_Selector_Name;
8079 ----------------------------------
8080 -- Is_SPARK_Initialization_Expr --
8081 ----------------------------------
8083 function Is_SPARK_Initialization_Expr (N : Node_Id) return Boolean is
8086 Comp_Assn : Node_Id;
8087 Orig_N : constant Node_Id := Original_Node (N);
8092 if not Comes_From_Source (Orig_N) then
8096 pragma Assert (Nkind (Orig_N) in N_Subexpr);
8098 case Nkind (Orig_N) is
8099 when N_Character_Literal |
8107 if Is_Entity_Name (Orig_N)
8108 and then Present (Entity (Orig_N)) -- needed in some cases
8110 case Ekind (Entity (Orig_N)) is
8112 E_Enumeration_Literal |
8117 if Is_Type (Entity (Orig_N)) then
8125 when N_Qualified_Expression |
8126 N_Type_Conversion =>
8127 Is_Ok := Is_SPARK_Initialization_Expr (Expression (Orig_N));
8130 Is_Ok := Is_SPARK_Initialization_Expr (Right_Opnd (Orig_N));
8134 N_Membership_Test =>
8135 Is_Ok := Is_SPARK_Initialization_Expr (Left_Opnd (Orig_N))
8136 and then Is_SPARK_Initialization_Expr (Right_Opnd (Orig_N));
8139 N_Extension_Aggregate =>
8140 if Nkind (Orig_N) = N_Extension_Aggregate then
8141 Is_Ok := Is_SPARK_Initialization_Expr (Ancestor_Part (Orig_N));
8144 Expr := First (Expressions (Orig_N));
8145 while Present (Expr) loop
8146 if not Is_SPARK_Initialization_Expr (Expr) then
8154 Comp_Assn := First (Component_Associations (Orig_N));
8155 while Present (Comp_Assn) loop
8156 Expr := Expression (Comp_Assn);
8157 if Present (Expr) -- needed for box association
8158 and then not Is_SPARK_Initialization_Expr (Expr)
8167 when N_Attribute_Reference =>
8168 if Nkind (Prefix (Orig_N)) in N_Subexpr then
8169 Is_Ok := Is_SPARK_Initialization_Expr (Prefix (Orig_N));
8172 Expr := First (Expressions (Orig_N));
8173 while Present (Expr) loop
8174 if not Is_SPARK_Initialization_Expr (Expr) then
8182 -- Selected components might be expanded named not yet resolved, so
8183 -- default on the safe side. (Eg on sparklex.ads)
8185 when N_Selected_Component =>
8194 end Is_SPARK_Initialization_Expr;
8196 -------------------------------
8197 -- Is_SPARK_Object_Reference --
8198 -------------------------------
8200 function Is_SPARK_Object_Reference (N : Node_Id) return Boolean is
8202 if Is_Entity_Name (N) then
8203 return Present (Entity (N))
8205 (Ekind_In (Entity (N), E_Constant, E_Variable)
8206 or else Ekind (Entity (N)) in Formal_Kind);
8210 when N_Selected_Component =>
8211 return Is_SPARK_Object_Reference (Prefix (N));
8217 end Is_SPARK_Object_Reference;
8223 function Is_Statement (N : Node_Id) return Boolean is
8226 Nkind (N) in N_Statement_Other_Than_Procedure_Call
8227 or else Nkind (N) = N_Procedure_Call_Statement;
8230 --------------------------------------------------
8231 -- Is_Subprogram_Stub_Without_Prior_Declaration --
8232 --------------------------------------------------
8234 function Is_Subprogram_Stub_Without_Prior_Declaration
8235 (N : Node_Id) return Boolean
8238 -- A subprogram stub without prior declaration serves as declaration for
8239 -- the actual subprogram body. As such, it has an attached defining
8240 -- entity of E_[Generic_]Function or E_[Generic_]Procedure.
8242 return Nkind (N) = N_Subprogram_Body_Stub
8243 and then Ekind (Defining_Entity (N)) /= E_Subprogram_Body;
8244 end Is_Subprogram_Stub_Without_Prior_Declaration;
8246 ---------------------------------
8247 -- Is_Synchronized_Tagged_Type --
8248 ---------------------------------
8250 function Is_Synchronized_Tagged_Type (E : Entity_Id) return Boolean is
8251 Kind : constant Entity_Kind := Ekind (Base_Type (E));
8254 -- A task or protected type derived from an interface is a tagged type.
8255 -- Such a tagged type is called a synchronized tagged type, as are
8256 -- synchronized interfaces and private extensions whose declaration
8257 -- includes the reserved word synchronized.
8259 return (Is_Tagged_Type (E)
8260 and then (Kind = E_Task_Type
8261 or else Kind = E_Protected_Type))
8264 and then Is_Synchronized_Interface (E))
8266 (Ekind (E) = E_Record_Type_With_Private
8267 and then Nkind (Parent (E)) = N_Private_Extension_Declaration
8268 and then (Synchronized_Present (Parent (E))
8269 or else Is_Synchronized_Interface (Etype (E))));
8270 end Is_Synchronized_Tagged_Type;
8276 function Is_Transfer (N : Node_Id) return Boolean is
8277 Kind : constant Node_Kind := Nkind (N);
8280 if Kind = N_Simple_Return_Statement
8282 Kind = N_Extended_Return_Statement
8284 Kind = N_Goto_Statement
8286 Kind = N_Raise_Statement
8288 Kind = N_Requeue_Statement
8292 elsif (Kind = N_Exit_Statement or else Kind in N_Raise_xxx_Error)
8293 and then No (Condition (N))
8297 elsif Kind = N_Procedure_Call_Statement
8298 and then Is_Entity_Name (Name (N))
8299 and then Present (Entity (Name (N)))
8300 and then No_Return (Entity (Name (N)))
8304 elsif Nkind (Original_Node (N)) = N_Raise_Statement then
8316 function Is_True (U : Uint) return Boolean is
8321 -------------------------------
8322 -- Is_Universal_Numeric_Type --
8323 -------------------------------
8325 function Is_Universal_Numeric_Type (T : Entity_Id) return Boolean is
8327 return T = Universal_Integer or else T = Universal_Real;
8328 end Is_Universal_Numeric_Type;
8334 function Is_Value_Type (T : Entity_Id) return Boolean is
8336 return VM_Target = CLI_Target
8337 and then Nkind (T) in N_Has_Chars
8338 and then Chars (T) /= No_Name
8339 and then Get_Name_String (Chars (T)) = "valuetype";
8342 ---------------------
8343 -- Is_VMS_Operator --
8344 ---------------------
8346 function Is_VMS_Operator (Op : Entity_Id) return Boolean is
8348 -- The VMS operators are declared in a child of System that is loaded
8349 -- through pragma Extend_System. In some rare cases a program is run
8350 -- with this extension but without indicating that the target is VMS.
8352 return Ekind (Op) = E_Function
8353 and then Is_Intrinsic_Subprogram (Op)
8355 ((Present_System_Aux
8356 and then Scope (Op) = System_Aux_Id)
8359 and then Scope (Scope (Op)) = RTU_Entity (System)));
8360 end Is_VMS_Operator;
8366 function Is_Variable
8368 Use_Original_Node : Boolean := True) return Boolean
8370 Orig_Node : Node_Id;
8372 function In_Protected_Function (E : Entity_Id) return Boolean;
8373 -- Within a protected function, the private components of the enclosing
8374 -- protected type are constants. A function nested within a (protected)
8375 -- procedure is not itself protected.
8377 function Is_Variable_Prefix (P : Node_Id) return Boolean;
8378 -- Prefixes can involve implicit dereferences, in which case we must
8379 -- test for the case of a reference of a constant access type, which can
8380 -- can never be a variable.
8382 ---------------------------
8383 -- In_Protected_Function --
8384 ---------------------------
8386 function In_Protected_Function (E : Entity_Id) return Boolean is
8387 Prot : constant Entity_Id := Scope (E);
8391 if not Is_Protected_Type (Prot) then
8395 while Present (S) and then S /= Prot loop
8396 if Ekind (S) = E_Function and then Scope (S) = Prot then
8405 end In_Protected_Function;
8407 ------------------------
8408 -- Is_Variable_Prefix --
8409 ------------------------
8411 function Is_Variable_Prefix (P : Node_Id) return Boolean is
8413 if Is_Access_Type (Etype (P)) then
8414 return not Is_Access_Constant (Root_Type (Etype (P)));
8416 -- For the case of an indexed component whose prefix has a packed
8417 -- array type, the prefix has been rewritten into a type conversion.
8418 -- Determine variable-ness from the converted expression.
8420 elsif Nkind (P) = N_Type_Conversion
8421 and then not Comes_From_Source (P)
8422 and then Is_Array_Type (Etype (P))
8423 and then Is_Packed (Etype (P))
8425 return Is_Variable (Expression (P));
8428 return Is_Variable (P);
8430 end Is_Variable_Prefix;
8432 -- Start of processing for Is_Variable
8435 -- Check if we perform the test on the original node since this may be a
8436 -- test of syntactic categories which must not be disturbed by whatever
8437 -- rewriting might have occurred. For example, an aggregate, which is
8438 -- certainly NOT a variable, could be turned into a variable by
8441 if Use_Original_Node then
8442 Orig_Node := Original_Node (N);
8447 -- Definitely OK if Assignment_OK is set. Since this is something that
8448 -- only gets set for expanded nodes, the test is on N, not Orig_Node.
8450 if Nkind (N) in N_Subexpr and then Assignment_OK (N) then
8453 -- Normally we go to the original node, but there is one exception where
8454 -- we use the rewritten node, namely when it is an explicit dereference.
8455 -- The generated code may rewrite a prefix which is an access type with
8456 -- an explicit dereference. The dereference is a variable, even though
8457 -- the original node may not be (since it could be a constant of the
8460 -- In Ada 2005 we have a further case to consider: the prefix may be a
8461 -- function call given in prefix notation. The original node appears to
8462 -- be a selected component, but we need to examine the call.
8464 elsif Nkind (N) = N_Explicit_Dereference
8465 and then Nkind (Orig_Node) /= N_Explicit_Dereference
8466 and then Present (Etype (Orig_Node))
8467 and then Is_Access_Type (Etype (Orig_Node))
8469 -- Note that if the prefix is an explicit dereference that does not
8470 -- come from source, we must check for a rewritten function call in
8471 -- prefixed notation before other forms of rewriting, to prevent a
8475 (Nkind (Orig_Node) = N_Function_Call
8476 and then not Is_Access_Constant (Etype (Prefix (N))))
8478 Is_Variable_Prefix (Original_Node (Prefix (N)));
8480 -- A function call is never a variable
8482 elsif Nkind (N) = N_Function_Call then
8485 -- All remaining checks use the original node
8487 elsif Is_Entity_Name (Orig_Node)
8488 and then Present (Entity (Orig_Node))
8491 E : constant Entity_Id := Entity (Orig_Node);
8492 K : constant Entity_Kind := Ekind (E);
8495 return (K = E_Variable
8496 and then Nkind (Parent (E)) /= N_Exception_Handler)
8497 or else (K = E_Component
8498 and then not In_Protected_Function (E))
8499 or else K = E_Out_Parameter
8500 or else K = E_In_Out_Parameter
8501 or else K = E_Generic_In_Out_Parameter
8503 -- Current instance of type
8505 or else (Is_Type (E) and then In_Open_Scopes (E))
8506 or else (Is_Incomplete_Or_Private_Type (E)
8507 and then In_Open_Scopes (Full_View (E)));
8511 case Nkind (Orig_Node) is
8512 when N_Indexed_Component | N_Slice =>
8513 return Is_Variable_Prefix (Prefix (Orig_Node));
8515 when N_Selected_Component =>
8516 return Is_Variable_Prefix (Prefix (Orig_Node))
8517 and then Is_Variable (Selector_Name (Orig_Node));
8519 -- For an explicit dereference, the type of the prefix cannot
8520 -- be an access to constant or an access to subprogram.
8522 when N_Explicit_Dereference =>
8524 Typ : constant Entity_Id := Etype (Prefix (Orig_Node));
8526 return Is_Access_Type (Typ)
8527 and then not Is_Access_Constant (Root_Type (Typ))
8528 and then Ekind (Typ) /= E_Access_Subprogram_Type;
8531 -- The type conversion is the case where we do not deal with the
8532 -- context dependent special case of an actual parameter. Thus
8533 -- the type conversion is only considered a variable for the
8534 -- purposes of this routine if the target type is tagged. However,
8535 -- a type conversion is considered to be a variable if it does not
8536 -- come from source (this deals for example with the conversions
8537 -- of expressions to their actual subtypes).
8539 when N_Type_Conversion =>
8540 return Is_Variable (Expression (Orig_Node))
8542 (not Comes_From_Source (Orig_Node)
8544 (Is_Tagged_Type (Etype (Subtype_Mark (Orig_Node)))
8546 Is_Tagged_Type (Etype (Expression (Orig_Node)))));
8548 -- GNAT allows an unchecked type conversion as a variable. This
8549 -- only affects the generation of internal expanded code, since
8550 -- calls to instantiations of Unchecked_Conversion are never
8551 -- considered variables (since they are function calls).
8552 -- This is also true for expression actions.
8554 when N_Unchecked_Type_Conversion =>
8555 return Is_Variable (Expression (Orig_Node));
8563 ---------------------------
8564 -- Is_Visibly_Controlled --
8565 ---------------------------
8567 function Is_Visibly_Controlled (T : Entity_Id) return Boolean is
8568 Root : constant Entity_Id := Root_Type (T);
8570 return Chars (Scope (Root)) = Name_Finalization
8571 and then Chars (Scope (Scope (Root))) = Name_Ada
8572 and then Scope (Scope (Scope (Root))) = Standard_Standard;
8573 end Is_Visibly_Controlled;
8575 ------------------------
8576 -- Is_Volatile_Object --
8577 ------------------------
8579 function Is_Volatile_Object (N : Node_Id) return Boolean is
8581 function Object_Has_Volatile_Components (N : Node_Id) return Boolean;
8582 -- Determines if given object has volatile components
8584 function Is_Volatile_Prefix (N : Node_Id) return Boolean;
8585 -- If prefix is an implicit dereference, examine designated type
8587 ------------------------
8588 -- Is_Volatile_Prefix --
8589 ------------------------
8591 function Is_Volatile_Prefix (N : Node_Id) return Boolean is
8592 Typ : constant Entity_Id := Etype (N);
8595 if Is_Access_Type (Typ) then
8597 Dtyp : constant Entity_Id := Designated_Type (Typ);
8600 return Is_Volatile (Dtyp)
8601 or else Has_Volatile_Components (Dtyp);
8605 return Object_Has_Volatile_Components (N);
8607 end Is_Volatile_Prefix;
8609 ------------------------------------
8610 -- Object_Has_Volatile_Components --
8611 ------------------------------------
8613 function Object_Has_Volatile_Components (N : Node_Id) return Boolean is
8614 Typ : constant Entity_Id := Etype (N);
8617 if Is_Volatile (Typ)
8618 or else Has_Volatile_Components (Typ)
8622 elsif Is_Entity_Name (N)
8623 and then (Has_Volatile_Components (Entity (N))
8624 or else Is_Volatile (Entity (N)))
8628 elsif Nkind (N) = N_Indexed_Component
8629 or else Nkind (N) = N_Selected_Component
8631 return Is_Volatile_Prefix (Prefix (N));
8636 end Object_Has_Volatile_Components;
8638 -- Start of processing for Is_Volatile_Object
8641 if Is_Volatile (Etype (N))
8642 or else (Is_Entity_Name (N) and then Is_Volatile (Entity (N)))
8646 elsif Nkind (N) = N_Indexed_Component
8647 or else Nkind (N) = N_Selected_Component
8649 return Is_Volatile_Prefix (Prefix (N));
8654 end Is_Volatile_Object;
8656 ---------------------------
8657 -- Itype_Has_Declaration --
8658 ---------------------------
8660 function Itype_Has_Declaration (Id : Entity_Id) return Boolean is
8662 pragma Assert (Is_Itype (Id));
8663 return Present (Parent (Id))
8664 and then Nkind_In (Parent (Id), N_Full_Type_Declaration,
8665 N_Subtype_Declaration)
8666 and then Defining_Entity (Parent (Id)) = Id;
8667 end Itype_Has_Declaration;
8669 -------------------------
8670 -- Kill_Current_Values --
8671 -------------------------
8673 procedure Kill_Current_Values
8675 Last_Assignment_Only : Boolean := False)
8678 -- ??? do we have to worry about clearing cached checks?
8680 if Is_Assignable (Ent) then
8681 Set_Last_Assignment (Ent, Empty);
8684 if Is_Object (Ent) then
8685 if not Last_Assignment_Only then
8687 Set_Current_Value (Ent, Empty);
8689 if not Can_Never_Be_Null (Ent) then
8690 Set_Is_Known_Non_Null (Ent, False);
8693 Set_Is_Known_Null (Ent, False);
8695 -- Reset Is_Known_Valid unless type is always valid, or if we have
8696 -- a loop parameter (loop parameters are always valid, since their
8697 -- bounds are defined by the bounds given in the loop header).
8699 if not Is_Known_Valid (Etype (Ent))
8700 and then Ekind (Ent) /= E_Loop_Parameter
8702 Set_Is_Known_Valid (Ent, False);
8706 end Kill_Current_Values;
8708 procedure Kill_Current_Values (Last_Assignment_Only : Boolean := False) is
8711 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id);
8712 -- Clear current value for entity E and all entities chained to E
8714 ------------------------------------------
8715 -- Kill_Current_Values_For_Entity_Chain --
8716 ------------------------------------------
8718 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id) is
8722 while Present (Ent) loop
8723 Kill_Current_Values (Ent, Last_Assignment_Only);
8726 end Kill_Current_Values_For_Entity_Chain;
8728 -- Start of processing for Kill_Current_Values
8731 -- Kill all saved checks, a special case of killing saved values
8733 if not Last_Assignment_Only then
8737 -- Loop through relevant scopes, which includes the current scope and
8738 -- any parent scopes if the current scope is a block or a package.
8743 -- Clear current values of all entities in current scope
8745 Kill_Current_Values_For_Entity_Chain (First_Entity (S));
8747 -- If scope is a package, also clear current values of all private
8748 -- entities in the scope.
8750 if Is_Package_Or_Generic_Package (S)
8751 or else Is_Concurrent_Type (S)
8753 Kill_Current_Values_For_Entity_Chain (First_Private_Entity (S));
8756 -- If this is a not a subprogram, deal with parents
8758 if not Is_Subprogram (S) then
8760 exit Scope_Loop when S = Standard_Standard;
8764 end loop Scope_Loop;
8765 end Kill_Current_Values;
8767 --------------------------
8768 -- Kill_Size_Check_Code --
8769 --------------------------
8771 procedure Kill_Size_Check_Code (E : Entity_Id) is
8773 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
8774 and then Present (Size_Check_Code (E))
8776 Remove (Size_Check_Code (E));
8777 Set_Size_Check_Code (E, Empty);
8779 end Kill_Size_Check_Code;
8781 --------------------------
8782 -- Known_To_Be_Assigned --
8783 --------------------------
8785 function Known_To_Be_Assigned (N : Node_Id) return Boolean is
8786 P : constant Node_Id := Parent (N);
8791 -- Test left side of assignment
8793 when N_Assignment_Statement =>
8794 return N = Name (P);
8796 -- Function call arguments are never lvalues
8798 when N_Function_Call =>
8801 -- Positional parameter for procedure or accept call
8803 when N_Procedure_Call_Statement |
8812 Proc := Get_Subprogram_Entity (P);
8818 -- If we are not a list member, something is strange, so
8819 -- be conservative and return False.
8821 if not Is_List_Member (N) then
8825 -- We are going to find the right formal by stepping forward
8826 -- through the formals, as we step backwards in the actuals.
8828 Form := First_Formal (Proc);
8831 -- If no formal, something is weird, so be conservative
8832 -- and return False.
8843 return Ekind (Form) /= E_In_Parameter;
8846 -- Named parameter for procedure or accept call
8848 when N_Parameter_Association =>
8854 Proc := Get_Subprogram_Entity (Parent (P));
8860 -- Loop through formals to find the one that matches
8862 Form := First_Formal (Proc);
8864 -- If no matching formal, that's peculiar, some kind of
8865 -- previous error, so return False to be conservative.
8871 -- Else test for match
8873 if Chars (Form) = Chars (Selector_Name (P)) then
8874 return Ekind (Form) /= E_In_Parameter;
8881 -- Test for appearing in a conversion that itself appears
8882 -- in an lvalue context, since this should be an lvalue.
8884 when N_Type_Conversion =>
8885 return Known_To_Be_Assigned (P);
8887 -- All other references are definitely not known to be modifications
8893 end Known_To_Be_Assigned;
8895 ---------------------------
8896 -- Last_Source_Statement --
8897 ---------------------------
8899 function Last_Source_Statement (HSS : Node_Id) return Node_Id is
8903 N := Last (Statements (HSS));
8904 while Present (N) loop
8905 exit when Comes_From_Source (N);
8910 end Last_Source_Statement;
8912 ----------------------------------
8913 -- Matching_Static_Array_Bounds --
8914 ----------------------------------
8916 function Matching_Static_Array_Bounds
8918 R_Typ : Node_Id) return Boolean
8920 L_Ndims : constant Nat := Number_Dimensions (L_Typ);
8921 R_Ndims : constant Nat := Number_Dimensions (R_Typ);
8933 if L_Ndims /= R_Ndims then
8937 -- Unconstrained types do not have static bounds
8939 if not Is_Constrained (L_Typ) or else not Is_Constrained (R_Typ) then
8943 -- First treat specially the first dimension, as the lower bound and
8944 -- length of string literals are not stored like those of arrays.
8946 if Ekind (L_Typ) = E_String_Literal_Subtype then
8947 L_Low := String_Literal_Low_Bound (L_Typ);
8948 L_Len := String_Literal_Length (L_Typ);
8950 L_Index := First_Index (L_Typ);
8951 Get_Index_Bounds (L_Index, L_Low, L_High);
8953 if Is_OK_Static_Expression (L_Low)
8954 and then Is_OK_Static_Expression (L_High)
8956 if Expr_Value (L_High) < Expr_Value (L_Low) then
8959 L_Len := (Expr_Value (L_High) - Expr_Value (L_Low)) + 1;
8966 if Ekind (R_Typ) = E_String_Literal_Subtype then
8967 R_Low := String_Literal_Low_Bound (R_Typ);
8968 R_Len := String_Literal_Length (R_Typ);
8970 R_Index := First_Index (R_Typ);
8971 Get_Index_Bounds (R_Index, R_Low, R_High);
8973 if Is_OK_Static_Expression (R_Low)
8974 and then Is_OK_Static_Expression (R_High)
8976 if Expr_Value (R_High) < Expr_Value (R_Low) then
8979 R_Len := (Expr_Value (R_High) - Expr_Value (R_Low)) + 1;
8986 if Is_OK_Static_Expression (L_Low)
8987 and then Is_OK_Static_Expression (R_Low)
8988 and then Expr_Value (L_Low) = Expr_Value (R_Low)
8989 and then L_Len = R_Len
8996 -- Then treat all other dimensions
8998 for Indx in 2 .. L_Ndims loop
9002 Get_Index_Bounds (L_Index, L_Low, L_High);
9003 Get_Index_Bounds (R_Index, R_Low, R_High);
9005 if Is_OK_Static_Expression (L_Low)
9006 and then Is_OK_Static_Expression (L_High)
9007 and then Is_OK_Static_Expression (R_Low)
9008 and then Is_OK_Static_Expression (R_High)
9009 and then Expr_Value (L_Low) = Expr_Value (R_Low)
9010 and then Expr_Value (L_High) = Expr_Value (R_High)
9018 -- If we fall through the loop, all indexes matched
9021 end Matching_Static_Array_Bounds;
9027 function May_Be_Lvalue (N : Node_Id) return Boolean is
9028 P : constant Node_Id := Parent (N);
9033 -- Test left side of assignment
9035 when N_Assignment_Statement =>
9036 return N = Name (P);
9038 -- Test prefix of component or attribute. Note that the prefix of an
9039 -- explicit or implicit dereference cannot be an l-value.
9041 when N_Attribute_Reference =>
9042 return N = Prefix (P)
9043 and then Name_Implies_Lvalue_Prefix (Attribute_Name (P));
9045 -- For an expanded name, the name is an lvalue if the expanded name
9046 -- is an lvalue, but the prefix is never an lvalue, since it is just
9047 -- the scope where the name is found.
9049 when N_Expanded_Name =>
9050 if N = Prefix (P) then
9051 return May_Be_Lvalue (P);
9056 -- For a selected component A.B, A is certainly an lvalue if A.B is.
9057 -- B is a little interesting, if we have A.B := 3, there is some
9058 -- discussion as to whether B is an lvalue or not, we choose to say
9059 -- it is. Note however that A is not an lvalue if it is of an access
9060 -- type since this is an implicit dereference.
9062 when N_Selected_Component =>
9064 and then Present (Etype (N))
9065 and then Is_Access_Type (Etype (N))
9069 return May_Be_Lvalue (P);
9072 -- For an indexed component or slice, the index or slice bounds is
9073 -- never an lvalue. The prefix is an lvalue if the indexed component
9074 -- or slice is an lvalue, except if it is an access type, where we
9075 -- have an implicit dereference.
9077 when N_Indexed_Component | N_Slice =>
9079 or else (Present (Etype (N)) and then Is_Access_Type (Etype (N)))
9083 return May_Be_Lvalue (P);
9086 -- Prefix of a reference is an lvalue if the reference is an lvalue
9089 return May_Be_Lvalue (P);
9091 -- Prefix of explicit dereference is never an lvalue
9093 when N_Explicit_Dereference =>
9096 -- Positional parameter for subprogram, entry, or accept call.
9097 -- In older versions of Ada function call arguments are never
9098 -- lvalues. In Ada 2012 functions can have in-out parameters.
9100 when N_Function_Call |
9101 N_Procedure_Call_Statement |
9102 N_Entry_Call_Statement |
9105 if Nkind (P) = N_Function_Call and then Ada_Version < Ada_2012 then
9109 -- The following mechanism is clumsy and fragile. A single flag
9110 -- set in Resolve_Actuals would be preferable ???
9118 Proc := Get_Subprogram_Entity (P);
9124 -- If we are not a list member, something is strange, so be
9125 -- conservative and return True.
9127 if not Is_List_Member (N) then
9131 -- We are going to find the right formal by stepping forward
9132 -- through the formals, as we step backwards in the actuals.
9134 Form := First_Formal (Proc);
9137 -- If no formal, something is weird, so be conservative and
9149 return Ekind (Form) /= E_In_Parameter;
9152 -- Named parameter for procedure or accept call
9154 when N_Parameter_Association =>
9160 Proc := Get_Subprogram_Entity (Parent (P));
9166 -- Loop through formals to find the one that matches
9168 Form := First_Formal (Proc);
9170 -- If no matching formal, that's peculiar, some kind of
9171 -- previous error, so return True to be conservative.
9177 -- Else test for match
9179 if Chars (Form) = Chars (Selector_Name (P)) then
9180 return Ekind (Form) /= E_In_Parameter;
9187 -- Test for appearing in a conversion that itself appears in an
9188 -- lvalue context, since this should be an lvalue.
9190 when N_Type_Conversion =>
9191 return May_Be_Lvalue (P);
9193 -- Test for appearance in object renaming declaration
9195 when N_Object_Renaming_Declaration =>
9198 -- All other references are definitely not lvalues
9206 -----------------------
9207 -- Mark_Coextensions --
9208 -----------------------
9210 procedure Mark_Coextensions (Context_Nod : Node_Id; Root_Nod : Node_Id) is
9211 Is_Dynamic : Boolean;
9212 -- Indicates whether the context causes nested coextensions to be
9213 -- dynamic or static
9215 function Mark_Allocator (N : Node_Id) return Traverse_Result;
9216 -- Recognize an allocator node and label it as a dynamic coextension
9218 --------------------
9219 -- Mark_Allocator --
9220 --------------------
9222 function Mark_Allocator (N : Node_Id) return Traverse_Result is
9224 if Nkind (N) = N_Allocator then
9226 Set_Is_Dynamic_Coextension (N);
9228 -- If the allocator expression is potentially dynamic, it may
9229 -- be expanded out of order and require dynamic allocation
9230 -- anyway, so we treat the coextension itself as dynamic.
9231 -- Potential optimization ???
9233 elsif Nkind (Expression (N)) = N_Qualified_Expression
9234 and then Nkind (Expression (Expression (N))) = N_Op_Concat
9236 Set_Is_Dynamic_Coextension (N);
9239 Set_Is_Static_Coextension (N);
9246 procedure Mark_Allocators is new Traverse_Proc (Mark_Allocator);
9248 -- Start of processing Mark_Coextensions
9251 case Nkind (Context_Nod) is
9252 when N_Assignment_Statement |
9253 N_Simple_Return_Statement =>
9254 Is_Dynamic := Nkind (Expression (Context_Nod)) = N_Allocator;
9256 when N_Object_Declaration =>
9257 Is_Dynamic := Nkind (Root_Nod) = N_Allocator;
9259 -- This routine should not be called for constructs which may not
9260 -- contain coextensions.
9263 raise Program_Error;
9266 Mark_Allocators (Root_Nod);
9267 end Mark_Coextensions;
9269 ----------------------
9270 -- Needs_One_Actual --
9271 ----------------------
9273 function Needs_One_Actual (E : Entity_Id) return Boolean is
9277 if Ada_Version >= Ada_2005
9278 and then Present (First_Formal (E))
9280 Formal := Next_Formal (First_Formal (E));
9281 while Present (Formal) loop
9282 if No (Default_Value (Formal)) then
9286 Next_Formal (Formal);
9294 end Needs_One_Actual;
9296 ------------------------
9297 -- New_Copy_List_Tree --
9298 ------------------------
9300 function New_Copy_List_Tree (List : List_Id) return List_Id is
9305 if List = No_List then
9312 while Present (E) loop
9313 Append (New_Copy_Tree (E), NL);
9319 end New_Copy_List_Tree;
9325 use Atree.Unchecked_Access;
9326 use Atree_Private_Part;
9328 -- Our approach here requires a two pass traversal of the tree. The
9329 -- first pass visits all nodes that eventually will be copied looking
9330 -- for defining Itypes. If any defining Itypes are found, then they are
9331 -- copied, and an entry is added to the replacement map. In the second
9332 -- phase, the tree is copied, using the replacement map to replace any
9333 -- Itype references within the copied tree.
9335 -- The following hash tables are used if the Map supplied has more
9336 -- than hash threshold entries to speed up access to the map. If
9337 -- there are fewer entries, then the map is searched sequentially
9338 -- (because setting up a hash table for only a few entries takes
9339 -- more time than it saves.
9341 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
9342 -- Hash function used for hash operations
9348 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
9350 return Nat (E) mod (NCT_Header_Num'Last + 1);
9357 -- The hash table NCT_Assoc associates old entities in the table
9358 -- with their corresponding new entities (i.e. the pairs of entries
9359 -- presented in the original Map argument are Key-Element pairs).
9361 package NCT_Assoc is new Simple_HTable (
9362 Header_Num => NCT_Header_Num,
9363 Element => Entity_Id,
9364 No_Element => Empty,
9366 Hash => New_Copy_Hash,
9367 Equal => Types."=");
9369 ---------------------
9370 -- NCT_Itype_Assoc --
9371 ---------------------
9373 -- The hash table NCT_Itype_Assoc contains entries only for those
9374 -- old nodes which have a non-empty Associated_Node_For_Itype set.
9375 -- The key is the associated node, and the element is the new node
9376 -- itself (NOT the associated node for the new node).
9378 package NCT_Itype_Assoc is new Simple_HTable (
9379 Header_Num => NCT_Header_Num,
9380 Element => Entity_Id,
9381 No_Element => Empty,
9383 Hash => New_Copy_Hash,
9384 Equal => Types."=");
9386 -- Start of processing for New_Copy_Tree function
9388 function New_Copy_Tree
9390 Map : Elist_Id := No_Elist;
9391 New_Sloc : Source_Ptr := No_Location;
9392 New_Scope : Entity_Id := Empty) return Node_Id
9394 Actual_Map : Elist_Id := Map;
9395 -- This is the actual map for the copy. It is initialized with the
9396 -- given elements, and then enlarged as required for Itypes that are
9397 -- copied during the first phase of the copy operation. The visit
9398 -- procedures add elements to this map as Itypes are encountered.
9399 -- The reason we cannot use Map directly, is that it may well be
9400 -- (and normally is) initialized to No_Elist, and if we have mapped
9401 -- entities, we have to reset it to point to a real Elist.
9403 function Assoc (N : Node_Or_Entity_Id) return Node_Id;
9404 -- Called during second phase to map entities into their corresponding
9405 -- copies using Actual_Map. If the argument is not an entity, or is not
9406 -- in Actual_Map, then it is returned unchanged.
9408 procedure Build_NCT_Hash_Tables;
9409 -- Builds hash tables (number of elements >= threshold value)
9411 function Copy_Elist_With_Replacement
9412 (Old_Elist : Elist_Id) return Elist_Id;
9413 -- Called during second phase to copy element list doing replacements
9415 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
9416 -- Called during the second phase to process a copied Itype. The actual
9417 -- copy happened during the first phase (so that we could make the entry
9418 -- in the mapping), but we still have to deal with the descendents of
9419 -- the copied Itype and copy them where necessary.
9421 function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
9422 -- Called during second phase to copy list doing replacements
9424 function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
9425 -- Called during second phase to copy node doing replacements
9427 procedure Visit_Elist (E : Elist_Id);
9428 -- Called during first phase to visit all elements of an Elist
9430 procedure Visit_Field (F : Union_Id; N : Node_Id);
9431 -- Visit a single field, recursing to call Visit_Node or Visit_List
9432 -- if the field is a syntactic descendent of the current node (i.e.
9433 -- its parent is Node N).
9435 procedure Visit_Itype (Old_Itype : Entity_Id);
9436 -- Called during first phase to visit subsidiary fields of a defining
9437 -- Itype, and also create a copy and make an entry in the replacement
9438 -- map for the new copy.
9440 procedure Visit_List (L : List_Id);
9441 -- Called during first phase to visit all elements of a List
9443 procedure Visit_Node (N : Node_Or_Entity_Id);
9444 -- Called during first phase to visit a node and all its subtrees
9450 function Assoc (N : Node_Or_Entity_Id) return Node_Id is
9455 if not Has_Extension (N) or else No (Actual_Map) then
9458 elsif NCT_Hash_Tables_Used then
9459 Ent := NCT_Assoc.Get (Entity_Id (N));
9461 if Present (Ent) then
9467 -- No hash table used, do serial search
9470 E := First_Elmt (Actual_Map);
9471 while Present (E) loop
9472 if Node (E) = N then
9473 return Node (Next_Elmt (E));
9475 E := Next_Elmt (Next_Elmt (E));
9483 ---------------------------
9484 -- Build_NCT_Hash_Tables --
9485 ---------------------------
9487 procedure Build_NCT_Hash_Tables is
9491 if NCT_Hash_Table_Setup then
9493 NCT_Itype_Assoc.Reset;
9496 Elmt := First_Elmt (Actual_Map);
9497 while Present (Elmt) loop
9500 -- Get new entity, and associate old and new
9503 NCT_Assoc.Set (Ent, Node (Elmt));
9505 if Is_Type (Ent) then
9507 Anode : constant Entity_Id :=
9508 Associated_Node_For_Itype (Ent);
9511 if Present (Anode) then
9513 -- Enter a link between the associated node of the
9514 -- old Itype and the new Itype, for updating later
9515 -- when node is copied.
9517 NCT_Itype_Assoc.Set (Anode, Node (Elmt));
9525 NCT_Hash_Tables_Used := True;
9526 NCT_Hash_Table_Setup := True;
9527 end Build_NCT_Hash_Tables;
9529 ---------------------------------
9530 -- Copy_Elist_With_Replacement --
9531 ---------------------------------
9533 function Copy_Elist_With_Replacement
9534 (Old_Elist : Elist_Id) return Elist_Id
9537 New_Elist : Elist_Id;
9540 if No (Old_Elist) then
9544 New_Elist := New_Elmt_List;
9546 M := First_Elmt (Old_Elist);
9547 while Present (M) loop
9548 Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
9554 end Copy_Elist_With_Replacement;
9556 ---------------------------------
9557 -- Copy_Itype_With_Replacement --
9558 ---------------------------------
9560 -- This routine exactly parallels its phase one analog Visit_Itype,
9562 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
9564 -- Translate Next_Entity, Scope and Etype fields, in case they
9565 -- reference entities that have been mapped into copies.
9567 Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
9568 Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
9570 if Present (New_Scope) then
9571 Set_Scope (New_Itype, New_Scope);
9573 Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
9576 -- Copy referenced fields
9578 if Is_Discrete_Type (New_Itype) then
9579 Set_Scalar_Range (New_Itype,
9580 Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
9582 elsif Has_Discriminants (Base_Type (New_Itype)) then
9583 Set_Discriminant_Constraint (New_Itype,
9584 Copy_Elist_With_Replacement
9585 (Discriminant_Constraint (New_Itype)));
9587 elsif Is_Array_Type (New_Itype) then
9588 if Present (First_Index (New_Itype)) then
9589 Set_First_Index (New_Itype,
9590 First (Copy_List_With_Replacement
9591 (List_Containing (First_Index (New_Itype)))));
9594 if Is_Packed (New_Itype) then
9595 Set_Packed_Array_Type (New_Itype,
9596 Copy_Node_With_Replacement
9597 (Packed_Array_Type (New_Itype)));
9600 end Copy_Itype_With_Replacement;
9602 --------------------------------
9603 -- Copy_List_With_Replacement --
9604 --------------------------------
9606 function Copy_List_With_Replacement
9607 (Old_List : List_Id) return List_Id
9613 if Old_List = No_List then
9617 New_List := Empty_List;
9619 E := First (Old_List);
9620 while Present (E) loop
9621 Append (Copy_Node_With_Replacement (E), New_List);
9627 end Copy_List_With_Replacement;
9629 --------------------------------
9630 -- Copy_Node_With_Replacement --
9631 --------------------------------
9633 function Copy_Node_With_Replacement
9634 (Old_Node : Node_Id) return Node_Id
9638 procedure Adjust_Named_Associations
9639 (Old_Node : Node_Id;
9640 New_Node : Node_Id);
9641 -- If a call node has named associations, these are chained through
9642 -- the First_Named_Actual, Next_Named_Actual links. These must be
9643 -- propagated separately to the new parameter list, because these
9644 -- are not syntactic fields.
9646 function Copy_Field_With_Replacement
9647 (Field : Union_Id) return Union_Id;
9648 -- Given Field, which is a field of Old_Node, return a copy of it
9649 -- if it is a syntactic field (i.e. its parent is Node), setting
9650 -- the parent of the copy to poit to New_Node. Otherwise returns
9651 -- the field (possibly mapped if it is an entity).
9653 -------------------------------
9654 -- Adjust_Named_Associations --
9655 -------------------------------
9657 procedure Adjust_Named_Associations
9658 (Old_Node : Node_Id;
9668 Old_E := First (Parameter_Associations (Old_Node));
9669 New_E := First (Parameter_Associations (New_Node));
9670 while Present (Old_E) loop
9671 if Nkind (Old_E) = N_Parameter_Association
9672 and then Present (Next_Named_Actual (Old_E))
9674 if First_Named_Actual (Old_Node)
9675 = Explicit_Actual_Parameter (Old_E)
9677 Set_First_Named_Actual
9678 (New_Node, Explicit_Actual_Parameter (New_E));
9681 -- Now scan parameter list from the beginning,to locate
9682 -- next named actual, which can be out of order.
9684 Old_Next := First (Parameter_Associations (Old_Node));
9685 New_Next := First (Parameter_Associations (New_Node));
9687 while Nkind (Old_Next) /= N_Parameter_Association
9688 or else Explicit_Actual_Parameter (Old_Next)
9689 /= Next_Named_Actual (Old_E)
9695 Set_Next_Named_Actual
9696 (New_E, Explicit_Actual_Parameter (New_Next));
9702 end Adjust_Named_Associations;
9704 ---------------------------------
9705 -- Copy_Field_With_Replacement --
9706 ---------------------------------
9708 function Copy_Field_With_Replacement
9709 (Field : Union_Id) return Union_Id
9712 if Field = Union_Id (Empty) then
9715 elsif Field in Node_Range then
9717 Old_N : constant Node_Id := Node_Id (Field);
9721 -- If syntactic field, as indicated by the parent pointer
9722 -- being set, then copy the referenced node recursively.
9724 if Parent (Old_N) = Old_Node then
9725 New_N := Copy_Node_With_Replacement (Old_N);
9727 if New_N /= Old_N then
9728 Set_Parent (New_N, New_Node);
9731 -- For semantic fields, update possible entity reference
9732 -- from the replacement map.
9735 New_N := Assoc (Old_N);
9738 return Union_Id (New_N);
9741 elsif Field in List_Range then
9743 Old_L : constant List_Id := List_Id (Field);
9747 -- If syntactic field, as indicated by the parent pointer,
9748 -- then recursively copy the entire referenced list.
9750 if Parent (Old_L) = Old_Node then
9751 New_L := Copy_List_With_Replacement (Old_L);
9752 Set_Parent (New_L, New_Node);
9754 -- For semantic list, just returned unchanged
9760 return Union_Id (New_L);
9763 -- Anything other than a list or a node is returned unchanged
9768 end Copy_Field_With_Replacement;
9770 -- Start of processing for Copy_Node_With_Replacement
9773 if Old_Node <= Empty_Or_Error then
9776 elsif Has_Extension (Old_Node) then
9777 return Assoc (Old_Node);
9780 New_Node := New_Copy (Old_Node);
9782 -- If the node we are copying is the associated node of a
9783 -- previously copied Itype, then adjust the associated node
9784 -- of the copy of that Itype accordingly.
9786 if Present (Actual_Map) then
9792 -- Case of hash table used
9794 if NCT_Hash_Tables_Used then
9795 Ent := NCT_Itype_Assoc.Get (Old_Node);
9797 if Present (Ent) then
9798 Set_Associated_Node_For_Itype (Ent, New_Node);
9801 -- Case of no hash table used
9804 E := First_Elmt (Actual_Map);
9805 while Present (E) loop
9806 if Is_Itype (Node (E))
9808 Old_Node = Associated_Node_For_Itype (Node (E))
9810 Set_Associated_Node_For_Itype
9811 (Node (Next_Elmt (E)), New_Node);
9814 E := Next_Elmt (Next_Elmt (E));
9820 -- Recursively copy descendents
9823 (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
9825 (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
9827 (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
9829 (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
9831 (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
9833 -- Adjust Sloc of new node if necessary
9835 if New_Sloc /= No_Location then
9836 Set_Sloc (New_Node, New_Sloc);
9838 -- If we adjust the Sloc, then we are essentially making
9839 -- a completely new node, so the Comes_From_Source flag
9840 -- should be reset to the proper default value.
9842 Nodes.Table (New_Node).Comes_From_Source :=
9843 Default_Node.Comes_From_Source;
9846 -- If the node is call and has named associations,
9847 -- set the corresponding links in the copy.
9849 if (Nkind (Old_Node) = N_Function_Call
9850 or else Nkind (Old_Node) = N_Entry_Call_Statement
9852 Nkind (Old_Node) = N_Procedure_Call_Statement)
9853 and then Present (First_Named_Actual (Old_Node))
9855 Adjust_Named_Associations (Old_Node, New_Node);
9858 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
9859 -- The replacement mechanism applies to entities, and is not used
9860 -- here. Eventually we may need a more general graph-copying
9861 -- routine. For now, do a sequential search to find desired node.
9863 if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
9864 and then Present (First_Real_Statement (Old_Node))
9867 Old_F : constant Node_Id := First_Real_Statement (Old_Node);
9871 N1 := First (Statements (Old_Node));
9872 N2 := First (Statements (New_Node));
9874 while N1 /= Old_F loop
9879 Set_First_Real_Statement (New_Node, N2);
9884 -- All done, return copied node
9887 end Copy_Node_With_Replacement;
9893 procedure Visit_Elist (E : Elist_Id) is
9897 Elmt := First_Elmt (E);
9899 while Elmt /= No_Elmt loop
9900 Visit_Node (Node (Elmt));
9910 procedure Visit_Field (F : Union_Id; N : Node_Id) is
9912 if F = Union_Id (Empty) then
9915 elsif F in Node_Range then
9917 -- Copy node if it is syntactic, i.e. its parent pointer is
9918 -- set to point to the field that referenced it (certain
9919 -- Itypes will also meet this criterion, which is fine, since
9920 -- these are clearly Itypes that do need to be copied, since
9921 -- we are copying their parent.)
9923 if Parent (Node_Id (F)) = N then
9924 Visit_Node (Node_Id (F));
9927 -- Another case, if we are pointing to an Itype, then we want
9928 -- to copy it if its associated node is somewhere in the tree
9931 -- Note: the exclusion of self-referential copies is just an
9932 -- optimization, since the search of the already copied list
9933 -- would catch it, but it is a common case (Etype pointing
9934 -- to itself for an Itype that is a base type).
9936 elsif Has_Extension (Node_Id (F))
9937 and then Is_Itype (Entity_Id (F))
9938 and then Node_Id (F) /= N
9944 P := Associated_Node_For_Itype (Node_Id (F));
9945 while Present (P) loop
9947 Visit_Node (Node_Id (F));
9954 -- An Itype whose parent is not being copied definitely
9955 -- should NOT be copied, since it does not belong in any
9956 -- sense to the copied subtree.
9962 elsif F in List_Range
9963 and then Parent (List_Id (F)) = N
9965 Visit_List (List_Id (F));
9974 procedure Visit_Itype (Old_Itype : Entity_Id) is
9975 New_Itype : Entity_Id;
9980 -- Itypes that describe the designated type of access to subprograms
9981 -- have the structure of subprogram declarations, with signatures,
9982 -- etc. Either we duplicate the signatures completely, or choose to
9983 -- share such itypes, which is fine because their elaboration will
9984 -- have no side effects.
9986 if Ekind (Old_Itype) = E_Subprogram_Type then
9990 New_Itype := New_Copy (Old_Itype);
9992 -- The new Itype has all the attributes of the old one, and
9993 -- we just copy the contents of the entity. However, the back-end
9994 -- needs different names for debugging purposes, so we create a
9995 -- new internal name for it in all cases.
9997 Set_Chars (New_Itype, New_Internal_Name ('T'));
9999 -- If our associated node is an entity that has already been copied,
10000 -- then set the associated node of the copy to point to the right
10001 -- copy. If we have copied an Itype that is itself the associated
10002 -- node of some previously copied Itype, then we set the right
10003 -- pointer in the other direction.
10005 if Present (Actual_Map) then
10007 -- Case of hash tables used
10009 if NCT_Hash_Tables_Used then
10011 Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
10013 if Present (Ent) then
10014 Set_Associated_Node_For_Itype (New_Itype, Ent);
10017 Ent := NCT_Itype_Assoc.Get (Old_Itype);
10018 if Present (Ent) then
10019 Set_Associated_Node_For_Itype (Ent, New_Itype);
10021 -- If the hash table has no association for this Itype and
10022 -- its associated node, enter one now.
10025 NCT_Itype_Assoc.Set
10026 (Associated_Node_For_Itype (Old_Itype), New_Itype);
10029 -- Case of hash tables not used
10032 E := First_Elmt (Actual_Map);
10033 while Present (E) loop
10034 if Associated_Node_For_Itype (Old_Itype) = Node (E) then
10035 Set_Associated_Node_For_Itype
10036 (New_Itype, Node (Next_Elmt (E)));
10039 if Is_Type (Node (E))
10041 Old_Itype = Associated_Node_For_Itype (Node (E))
10043 Set_Associated_Node_For_Itype
10044 (Node (Next_Elmt (E)), New_Itype);
10047 E := Next_Elmt (Next_Elmt (E));
10052 if Present (Freeze_Node (New_Itype)) then
10053 Set_Is_Frozen (New_Itype, False);
10054 Set_Freeze_Node (New_Itype, Empty);
10057 -- Add new association to map
10059 if No (Actual_Map) then
10060 Actual_Map := New_Elmt_List;
10063 Append_Elmt (Old_Itype, Actual_Map);
10064 Append_Elmt (New_Itype, Actual_Map);
10066 if NCT_Hash_Tables_Used then
10067 NCT_Assoc.Set (Old_Itype, New_Itype);
10070 NCT_Table_Entries := NCT_Table_Entries + 1;
10072 if NCT_Table_Entries > NCT_Hash_Threshold then
10073 Build_NCT_Hash_Tables;
10077 -- If a record subtype is simply copied, the entity list will be
10078 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
10080 if Ekind_In (Old_Itype, E_Record_Subtype, E_Class_Wide_Subtype) then
10081 Set_Cloned_Subtype (New_Itype, Old_Itype);
10084 -- Visit descendents that eventually get copied
10086 Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
10088 if Is_Discrete_Type (Old_Itype) then
10089 Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
10091 elsif Has_Discriminants (Base_Type (Old_Itype)) then
10092 -- ??? This should involve call to Visit_Field
10093 Visit_Elist (Discriminant_Constraint (Old_Itype));
10095 elsif Is_Array_Type (Old_Itype) then
10096 if Present (First_Index (Old_Itype)) then
10097 Visit_Field (Union_Id (List_Containing
10098 (First_Index (Old_Itype))),
10102 if Is_Packed (Old_Itype) then
10103 Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)),
10113 procedure Visit_List (L : List_Id) is
10116 if L /= No_List then
10119 while Present (N) loop
10130 procedure Visit_Node (N : Node_Or_Entity_Id) is
10132 -- Start of processing for Visit_Node
10135 -- Handle case of an Itype, which must be copied
10137 if Has_Extension (N)
10138 and then Is_Itype (N)
10140 -- Nothing to do if already in the list. This can happen with an
10141 -- Itype entity that appears more than once in the tree.
10142 -- Note that we do not want to visit descendents in this case.
10144 -- Test for already in list when hash table is used
10146 if NCT_Hash_Tables_Used then
10147 if Present (NCT_Assoc.Get (Entity_Id (N))) then
10151 -- Test for already in list when hash table not used
10157 if Present (Actual_Map) then
10158 E := First_Elmt (Actual_Map);
10159 while Present (E) loop
10160 if Node (E) = N then
10163 E := Next_Elmt (Next_Elmt (E));
10173 -- Visit descendents
10175 Visit_Field (Field1 (N), N);
10176 Visit_Field (Field2 (N), N);
10177 Visit_Field (Field3 (N), N);
10178 Visit_Field (Field4 (N), N);
10179 Visit_Field (Field5 (N), N);
10182 -- Start of processing for New_Copy_Tree
10187 -- See if we should use hash table
10189 if No (Actual_Map) then
10190 NCT_Hash_Tables_Used := False;
10197 NCT_Table_Entries := 0;
10199 Elmt := First_Elmt (Actual_Map);
10200 while Present (Elmt) loop
10201 NCT_Table_Entries := NCT_Table_Entries + 1;
10206 if NCT_Table_Entries > NCT_Hash_Threshold then
10207 Build_NCT_Hash_Tables;
10209 NCT_Hash_Tables_Used := False;
10214 -- Hash table set up if required, now start phase one by visiting
10215 -- top node (we will recursively visit the descendents).
10217 Visit_Node (Source);
10219 -- Now the second phase of the copy can start. First we process
10220 -- all the mapped entities, copying their descendents.
10222 if Present (Actual_Map) then
10225 New_Itype : Entity_Id;
10227 Elmt := First_Elmt (Actual_Map);
10228 while Present (Elmt) loop
10230 New_Itype := Node (Elmt);
10231 Copy_Itype_With_Replacement (New_Itype);
10237 -- Now we can copy the actual tree
10239 return Copy_Node_With_Replacement (Source);
10242 -------------------------
10243 -- New_External_Entity --
10244 -------------------------
10246 function New_External_Entity
10247 (Kind : Entity_Kind;
10248 Scope_Id : Entity_Id;
10249 Sloc_Value : Source_Ptr;
10250 Related_Id : Entity_Id;
10251 Suffix : Character;
10252 Suffix_Index : Nat := 0;
10253 Prefix : Character := ' ') return Entity_Id
10255 N : constant Entity_Id :=
10256 Make_Defining_Identifier (Sloc_Value,
10258 (Chars (Related_Id), Suffix, Suffix_Index, Prefix));
10261 Set_Ekind (N, Kind);
10262 Set_Is_Internal (N, True);
10263 Append_Entity (N, Scope_Id);
10264 Set_Public_Status (N);
10266 if Kind in Type_Kind then
10267 Init_Size_Align (N);
10271 end New_External_Entity;
10273 -------------------------
10274 -- New_Internal_Entity --
10275 -------------------------
10277 function New_Internal_Entity
10278 (Kind : Entity_Kind;
10279 Scope_Id : Entity_Id;
10280 Sloc_Value : Source_Ptr;
10281 Id_Char : Character) return Entity_Id
10283 N : constant Entity_Id := Make_Temporary (Sloc_Value, Id_Char);
10286 Set_Ekind (N, Kind);
10287 Set_Is_Internal (N, True);
10288 Append_Entity (N, Scope_Id);
10290 if Kind in Type_Kind then
10291 Init_Size_Align (N);
10295 end New_Internal_Entity;
10301 function Next_Actual (Actual_Id : Node_Id) return Node_Id is
10305 -- If we are pointing at a positional parameter, it is a member of a
10306 -- node list (the list of parameters), and the next parameter is the
10307 -- next node on the list, unless we hit a parameter association, then
10308 -- we shift to using the chain whose head is the First_Named_Actual in
10309 -- the parent, and then is threaded using the Next_Named_Actual of the
10310 -- Parameter_Association. All this fiddling is because the original node
10311 -- list is in the textual call order, and what we need is the
10312 -- declaration order.
10314 if Is_List_Member (Actual_Id) then
10315 N := Next (Actual_Id);
10317 if Nkind (N) = N_Parameter_Association then
10318 return First_Named_Actual (Parent (Actual_Id));
10324 return Next_Named_Actual (Parent (Actual_Id));
10328 procedure Next_Actual (Actual_Id : in out Node_Id) is
10330 Actual_Id := Next_Actual (Actual_Id);
10333 -----------------------
10334 -- Normalize_Actuals --
10335 -----------------------
10337 -- Chain actuals according to formals of subprogram. If there are no named
10338 -- associations, the chain is simply the list of Parameter Associations,
10339 -- since the order is the same as the declaration order. If there are named
10340 -- associations, then the First_Named_Actual field in the N_Function_Call
10341 -- or N_Procedure_Call_Statement node points to the Parameter_Association
10342 -- node for the parameter that comes first in declaration order. The
10343 -- remaining named parameters are then chained in declaration order using
10344 -- Next_Named_Actual.
10346 -- This routine also verifies that the number of actuals is compatible with
10347 -- the number and default values of formals, but performs no type checking
10348 -- (type checking is done by the caller).
10350 -- If the matching succeeds, Success is set to True and the caller proceeds
10351 -- with type-checking. If the match is unsuccessful, then Success is set to
10352 -- False, and the caller attempts a different interpretation, if there is
10355 -- If the flag Report is on, the call is not overloaded, and a failure to
10356 -- match can be reported here, rather than in the caller.
10358 procedure Normalize_Actuals
10362 Success : out Boolean)
10364 Actuals : constant List_Id := Parameter_Associations (N);
10365 Actual : Node_Id := Empty;
10366 Formal : Entity_Id;
10367 Last : Node_Id := Empty;
10368 First_Named : Node_Id := Empty;
10371 Formals_To_Match : Integer := 0;
10372 Actuals_To_Match : Integer := 0;
10374 procedure Chain (A : Node_Id);
10375 -- Add named actual at the proper place in the list, using the
10376 -- Next_Named_Actual link.
10378 function Reporting return Boolean;
10379 -- Determines if an error is to be reported. To report an error, we
10380 -- need Report to be True, and also we do not report errors caused
10381 -- by calls to init procs that occur within other init procs. Such
10382 -- errors must always be cascaded errors, since if all the types are
10383 -- declared correctly, the compiler will certainly build decent calls!
10389 procedure Chain (A : Node_Id) is
10393 -- Call node points to first actual in list
10395 Set_First_Named_Actual (N, Explicit_Actual_Parameter (A));
10398 Set_Next_Named_Actual (Last, Explicit_Actual_Parameter (A));
10402 Set_Next_Named_Actual (Last, Empty);
10409 function Reporting return Boolean is
10414 elsif not Within_Init_Proc then
10417 elsif Is_Init_Proc (Entity (Name (N))) then
10425 -- Start of processing for Normalize_Actuals
10428 if Is_Access_Type (S) then
10430 -- The name in the call is a function call that returns an access
10431 -- to subprogram. The designated type has the list of formals.
10433 Formal := First_Formal (Designated_Type (S));
10435 Formal := First_Formal (S);
10438 while Present (Formal) loop
10439 Formals_To_Match := Formals_To_Match + 1;
10440 Next_Formal (Formal);
10443 -- Find if there is a named association, and verify that no positional
10444 -- associations appear after named ones.
10446 if Present (Actuals) then
10447 Actual := First (Actuals);
10450 while Present (Actual)
10451 and then Nkind (Actual) /= N_Parameter_Association
10453 Actuals_To_Match := Actuals_To_Match + 1;
10457 if No (Actual) and Actuals_To_Match = Formals_To_Match then
10459 -- Most common case: positional notation, no defaults
10464 elsif Actuals_To_Match > Formals_To_Match then
10466 -- Too many actuals: will not work
10469 if Is_Entity_Name (Name (N)) then
10470 Error_Msg_N ("too many arguments in call to&", Name (N));
10472 Error_Msg_N ("too many arguments in call", N);
10480 First_Named := Actual;
10482 while Present (Actual) loop
10483 if Nkind (Actual) /= N_Parameter_Association then
10485 ("positional parameters not allowed after named ones", Actual);
10490 Actuals_To_Match := Actuals_To_Match + 1;
10496 if Present (Actuals) then
10497 Actual := First (Actuals);
10500 Formal := First_Formal (S);
10501 while Present (Formal) loop
10503 -- Match the formals in order. If the corresponding actual is
10504 -- positional, nothing to do. Else scan the list of named actuals
10505 -- to find the one with the right name.
10507 if Present (Actual)
10508 and then Nkind (Actual) /= N_Parameter_Association
10511 Actuals_To_Match := Actuals_To_Match - 1;
10512 Formals_To_Match := Formals_To_Match - 1;
10515 -- For named parameters, search the list of actuals to find
10516 -- one that matches the next formal name.
10518 Actual := First_Named;
10520 while Present (Actual) loop
10521 if Chars (Selector_Name (Actual)) = Chars (Formal) then
10524 Actuals_To_Match := Actuals_To_Match - 1;
10525 Formals_To_Match := Formals_To_Match - 1;
10533 if Ekind (Formal) /= E_In_Parameter
10534 or else No (Default_Value (Formal))
10537 if (Comes_From_Source (S)
10538 or else Sloc (S) = Standard_Location)
10539 and then Is_Overloadable (S)
10543 (Nkind (Parent (N)) = N_Procedure_Call_Statement
10545 (Nkind (Parent (N)) = N_Function_Call
10547 Nkind (Parent (N)) = N_Parameter_Association))
10548 and then Ekind (S) /= E_Function
10550 Set_Etype (N, Etype (S));
10552 Error_Msg_Name_1 := Chars (S);
10553 Error_Msg_Sloc := Sloc (S);
10555 ("missing argument for parameter & " &
10556 "in call to % declared #", N, Formal);
10559 elsif Is_Overloadable (S) then
10560 Error_Msg_Name_1 := Chars (S);
10562 -- Point to type derivation that generated the
10565 Error_Msg_Sloc := Sloc (Parent (S));
10568 ("missing argument for parameter & " &
10569 "in call to % (inherited) #", N, Formal);
10573 ("missing argument for parameter &", N, Formal);
10581 Formals_To_Match := Formals_To_Match - 1;
10586 Next_Formal (Formal);
10589 if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
10596 -- Find some superfluous named actual that did not get
10597 -- attached to the list of associations.
10599 Actual := First (Actuals);
10600 while Present (Actual) loop
10601 if Nkind (Actual) = N_Parameter_Association
10602 and then Actual /= Last
10603 and then No (Next_Named_Actual (Actual))
10605 Error_Msg_N ("unmatched actual & in call",
10606 Selector_Name (Actual));
10617 end Normalize_Actuals;
10619 --------------------------------
10620 -- Note_Possible_Modification --
10621 --------------------------------
10623 procedure Note_Possible_Modification (N : Node_Id; Sure : Boolean) is
10624 Modification_Comes_From_Source : constant Boolean :=
10625 Comes_From_Source (Parent (N));
10631 -- Loop to find referenced entity, if there is one
10638 if Is_Entity_Name (Exp) then
10639 Ent := Entity (Exp);
10641 -- If the entity is missing, it is an undeclared identifier,
10642 -- and there is nothing to annotate.
10648 elsif Nkind (Exp) = N_Explicit_Dereference then
10650 P : constant Node_Id := Prefix (Exp);
10653 -- In formal verification mode, keep track of all reads and
10654 -- writes through explicit dereferences.
10657 Alfa.Generate_Dereference (N, 'm');
10660 if Nkind (P) = N_Selected_Component
10662 Entry_Formal (Entity (Selector_Name (P))))
10664 -- Case of a reference to an entry formal
10666 Ent := Entry_Formal (Entity (Selector_Name (P)));
10668 elsif Nkind (P) = N_Identifier
10669 and then Nkind (Parent (Entity (P))) = N_Object_Declaration
10670 and then Present (Expression (Parent (Entity (P))))
10671 and then Nkind (Expression (Parent (Entity (P))))
10674 -- Case of a reference to a value on which side effects have
10677 Exp := Prefix (Expression (Parent (Entity (P))));
10686 elsif Nkind (Exp) = N_Type_Conversion
10687 or else Nkind (Exp) = N_Unchecked_Type_Conversion
10689 Exp := Expression (Exp);
10692 elsif Nkind (Exp) = N_Slice
10693 or else Nkind (Exp) = N_Indexed_Component
10694 or else Nkind (Exp) = N_Selected_Component
10696 Exp := Prefix (Exp);
10703 -- Now look for entity being referenced
10705 if Present (Ent) then
10706 if Is_Object (Ent) then
10707 if Comes_From_Source (Exp)
10708 or else Modification_Comes_From_Source
10710 -- Give warning if pragma unmodified given and we are
10711 -- sure this is a modification.
10713 if Has_Pragma_Unmodified (Ent) and then Sure then
10714 Error_Msg_NE ("?pragma Unmodified given for &!", N, Ent);
10717 Set_Never_Set_In_Source (Ent, False);
10720 Set_Is_True_Constant (Ent, False);
10721 Set_Current_Value (Ent, Empty);
10722 Set_Is_Known_Null (Ent, False);
10724 if not Can_Never_Be_Null (Ent) then
10725 Set_Is_Known_Non_Null (Ent, False);
10728 -- Follow renaming chain
10730 if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
10731 and then Present (Renamed_Object (Ent))
10733 Exp := Renamed_Object (Ent);
10736 -- The expression may be the renaming of a subcomponent of an
10737 -- array or container. The assignment to the subcomponent is
10738 -- a modification of the container.
10740 elsif Comes_From_Source (Original_Node (Exp))
10741 and then Nkind_In (Original_Node (Exp), N_Selected_Component,
10742 N_Indexed_Component)
10744 Exp := Prefix (Original_Node (Exp));
10748 -- Generate a reference only if the assignment comes from
10749 -- source. This excludes, for example, calls to a dispatching
10750 -- assignment operation when the left-hand side is tagged.
10752 if Modification_Comes_From_Source then
10753 Generate_Reference (Ent, Exp, 'm');
10755 -- If the target of the assignment is the bound variable
10756 -- in an iterator, indicate that the corresponding array
10757 -- or container is also modified.
10759 if Ada_Version >= Ada_2012
10761 Nkind (Parent (Ent)) = N_Iterator_Specification
10764 Domain : constant Node_Id := Name (Parent (Ent));
10767 -- TBD : in the full version of the construct, the
10768 -- domain of iteration can be given by an expression.
10770 if Is_Entity_Name (Domain) then
10771 Generate_Reference (Entity (Domain), Exp, 'm');
10772 Set_Is_True_Constant (Entity (Domain), False);
10773 Set_Never_Set_In_Source (Entity (Domain), False);
10779 Check_Nested_Access (Ent);
10784 -- If we are sure this is a modification from source, and we know
10785 -- this modifies a constant, then give an appropriate warning.
10787 if Overlays_Constant (Ent)
10788 and then Modification_Comes_From_Source
10792 A : constant Node_Id := Address_Clause (Ent);
10794 if Present (A) then
10796 Exp : constant Node_Id := Expression (A);
10798 if Nkind (Exp) = N_Attribute_Reference
10799 and then Attribute_Name (Exp) = Name_Address
10800 and then Is_Entity_Name (Prefix (Exp))
10802 Error_Msg_Sloc := Sloc (A);
10804 ("constant& may be modified via address clause#?",
10805 N, Entity (Prefix (Exp)));
10815 end Note_Possible_Modification;
10817 -------------------------
10818 -- Object_Access_Level --
10819 -------------------------
10821 function Object_Access_Level (Obj : Node_Id) return Uint is
10824 -- Returns the static accessibility level of the view denoted by Obj. Note
10825 -- that the value returned is the result of a call to Scope_Depth. Only
10826 -- scope depths associated with dynamic scopes can actually be returned.
10827 -- Since only relative levels matter for accessibility checking, the fact
10828 -- that the distance between successive levels of accessibility is not
10829 -- always one is immaterial (invariant: if level(E2) is deeper than
10830 -- level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
10832 function Reference_To (Obj : Node_Id) return Node_Id;
10833 -- An explicit dereference is created when removing side-effects from
10834 -- expressions for constraint checking purposes. In this case a local
10835 -- access type is created for it. The correct access level is that of
10836 -- the original source node. We detect this case by noting that the
10837 -- prefix of the dereference is created by an object declaration whose
10838 -- initial expression is a reference.
10844 function Reference_To (Obj : Node_Id) return Node_Id is
10845 Pref : constant Node_Id := Prefix (Obj);
10847 if Is_Entity_Name (Pref)
10848 and then Nkind (Parent (Entity (Pref))) = N_Object_Declaration
10849 and then Present (Expression (Parent (Entity (Pref))))
10850 and then Nkind (Expression (Parent (Entity (Pref)))) = N_Reference
10852 return (Prefix (Expression (Parent (Entity (Pref)))));
10858 -- Start of processing for Object_Access_Level
10861 if Nkind (Obj) = N_Defining_Identifier
10862 or else Is_Entity_Name (Obj)
10864 if Nkind (Obj) = N_Defining_Identifier then
10870 if Is_Prival (E) then
10871 E := Prival_Link (E);
10874 -- If E is a type then it denotes a current instance. For this case
10875 -- we add one to the normal accessibility level of the type to ensure
10876 -- that current instances are treated as always being deeper than
10877 -- than the level of any visible named access type (see 3.10.2(21)).
10879 if Is_Type (E) then
10880 return Type_Access_Level (E) + 1;
10882 elsif Present (Renamed_Object (E)) then
10883 return Object_Access_Level (Renamed_Object (E));
10885 -- Similarly, if E is a component of the current instance of a
10886 -- protected type, any instance of it is assumed to be at a deeper
10887 -- level than the type. For a protected object (whose type is an
10888 -- anonymous protected type) its components are at the same level
10889 -- as the type itself.
10891 elsif not Is_Overloadable (E)
10892 and then Ekind (Scope (E)) = E_Protected_Type
10893 and then Comes_From_Source (Scope (E))
10895 return Type_Access_Level (Scope (E)) + 1;
10898 return Scope_Depth (Enclosing_Dynamic_Scope (E));
10901 elsif Nkind (Obj) = N_Selected_Component then
10902 if Is_Access_Type (Etype (Prefix (Obj))) then
10903 return Type_Access_Level (Etype (Prefix (Obj)));
10905 return Object_Access_Level (Prefix (Obj));
10908 elsif Nkind (Obj) = N_Indexed_Component then
10909 if Is_Access_Type (Etype (Prefix (Obj))) then
10910 return Type_Access_Level (Etype (Prefix (Obj)));
10912 return Object_Access_Level (Prefix (Obj));
10915 elsif Nkind (Obj) = N_Explicit_Dereference then
10917 -- If the prefix is a selected access discriminant then we make a
10918 -- recursive call on the prefix, which will in turn check the level
10919 -- of the prefix object of the selected discriminant.
10921 if Nkind (Prefix (Obj)) = N_Selected_Component
10922 and then Ekind (Etype (Prefix (Obj))) = E_Anonymous_Access_Type
10924 Ekind (Entity (Selector_Name (Prefix (Obj)))) = E_Discriminant
10926 return Object_Access_Level (Prefix (Obj));
10928 elsif not (Comes_From_Source (Obj)) then
10930 Ref : constant Node_Id := Reference_To (Obj);
10932 if Present (Ref) then
10933 return Object_Access_Level (Ref);
10935 return Type_Access_Level (Etype (Prefix (Obj)));
10940 return Type_Access_Level (Etype (Prefix (Obj)));
10943 elsif Nkind (Obj) = N_Type_Conversion
10944 or else Nkind (Obj) = N_Unchecked_Type_Conversion
10946 return Object_Access_Level (Expression (Obj));
10948 elsif Nkind (Obj) = N_Function_Call then
10950 -- Function results are objects, so we get either the access level of
10951 -- the function or, in the case of an indirect call, the level of the
10952 -- access-to-subprogram type. (This code is used for Ada 95, but it
10953 -- looks wrong, because it seems that we should be checking the level
10954 -- of the call itself, even for Ada 95. However, using the Ada 2005
10955 -- version of the code causes regressions in several tests that are
10956 -- compiled with -gnat95. ???)
10958 if Ada_Version < Ada_2005 then
10959 if Is_Entity_Name (Name (Obj)) then
10960 return Subprogram_Access_Level (Entity (Name (Obj)));
10962 return Type_Access_Level (Etype (Prefix (Name (Obj))));
10965 -- For Ada 2005, the level of the result object of a function call is
10966 -- defined to be the level of the call's innermost enclosing master.
10967 -- We determine that by querying the depth of the innermost enclosing
10971 Return_Master_Scope_Depth_Of_Call : declare
10973 function Innermost_Master_Scope_Depth
10974 (N : Node_Id) return Uint;
10975 -- Returns the scope depth of the given node's innermost
10976 -- enclosing dynamic scope (effectively the accessibility
10977 -- level of the innermost enclosing master).
10979 ----------------------------------
10980 -- Innermost_Master_Scope_Depth --
10981 ----------------------------------
10983 function Innermost_Master_Scope_Depth
10984 (N : Node_Id) return Uint
10986 Node_Par : Node_Id := Parent (N);
10989 -- Locate the nearest enclosing node (by traversing Parents)
10990 -- that Defining_Entity can be applied to, and return the
10991 -- depth of that entity's nearest enclosing dynamic scope.
10993 while Present (Node_Par) loop
10994 case Nkind (Node_Par) is
10995 when N_Component_Declaration |
10996 N_Entry_Declaration |
10997 N_Formal_Object_Declaration |
10998 N_Formal_Type_Declaration |
10999 N_Full_Type_Declaration |
11000 N_Incomplete_Type_Declaration |
11001 N_Loop_Parameter_Specification |
11002 N_Object_Declaration |
11003 N_Protected_Type_Declaration |
11004 N_Private_Extension_Declaration |
11005 N_Private_Type_Declaration |
11006 N_Subtype_Declaration |
11007 N_Function_Specification |
11008 N_Procedure_Specification |
11009 N_Task_Type_Declaration |
11011 N_Generic_Instantiation |
11013 N_Implicit_Label_Declaration |
11014 N_Package_Declaration |
11015 N_Single_Task_Declaration |
11016 N_Subprogram_Declaration |
11017 N_Generic_Declaration |
11018 N_Renaming_Declaration |
11019 N_Block_Statement |
11020 N_Formal_Subprogram_Declaration |
11021 N_Abstract_Subprogram_Declaration |
11023 N_Exception_Declaration |
11024 N_Formal_Package_Declaration |
11025 N_Number_Declaration |
11026 N_Package_Specification |
11027 N_Parameter_Specification |
11028 N_Single_Protected_Declaration |
11032 (Nearest_Dynamic_Scope
11033 (Defining_Entity (Node_Par)));
11039 Node_Par := Parent (Node_Par);
11042 pragma Assert (False);
11044 -- Should never reach the following return
11046 return Scope_Depth (Current_Scope) + 1;
11047 end Innermost_Master_Scope_Depth;
11049 -- Start of processing for Return_Master_Scope_Depth_Of_Call
11052 return Innermost_Master_Scope_Depth (Obj);
11053 end Return_Master_Scope_Depth_Of_Call;
11056 -- For convenience we handle qualified expressions, even though
11057 -- they aren't technically object names.
11059 elsif Nkind (Obj) = N_Qualified_Expression then
11060 return Object_Access_Level (Expression (Obj));
11062 -- Otherwise return the scope level of Standard.
11063 -- (If there are cases that fall through
11064 -- to this point they will be treated as
11065 -- having global accessibility for now. ???)
11068 return Scope_Depth (Standard_Standard);
11070 end Object_Access_Level;
11072 --------------------------------------
11073 -- Original_Corresponding_Operation --
11074 --------------------------------------
11076 function Original_Corresponding_Operation (S : Entity_Id) return Entity_Id
11078 Typ : constant Entity_Id := Find_Dispatching_Type (S);
11081 -- If S is an inherited primitive S2 the original corresponding
11082 -- operation of S is the original corresponding operation of S2
11084 if Present (Alias (S))
11085 and then Find_Dispatching_Type (Alias (S)) /= Typ
11087 return Original_Corresponding_Operation (Alias (S));
11089 -- If S overrides an inherited subprogram S2 the original corresponding
11090 -- operation of S is the original corresponding operation of S2
11092 elsif Present (Overridden_Operation (S)) then
11093 return Original_Corresponding_Operation (Overridden_Operation (S));
11095 -- otherwise it is S itself
11100 end Original_Corresponding_Operation;
11102 -----------------------
11103 -- Private_Component --
11104 -----------------------
11106 function Private_Component (Type_Id : Entity_Id) return Entity_Id is
11107 Ancestor : constant Entity_Id := Base_Type (Type_Id);
11109 function Trace_Components
11111 Check : Boolean) return Entity_Id;
11112 -- Recursive function that does the work, and checks against circular
11113 -- definition for each subcomponent type.
11115 ----------------------
11116 -- Trace_Components --
11117 ----------------------
11119 function Trace_Components
11121 Check : Boolean) return Entity_Id
11123 Btype : constant Entity_Id := Base_Type (T);
11124 Component : Entity_Id;
11126 Candidate : Entity_Id := Empty;
11129 if Check and then Btype = Ancestor then
11130 Error_Msg_N ("circular type definition", Type_Id);
11134 if Is_Private_Type (Btype)
11135 and then not Is_Generic_Type (Btype)
11137 if Present (Full_View (Btype))
11138 and then Is_Record_Type (Full_View (Btype))
11139 and then not Is_Frozen (Btype)
11141 -- To indicate that the ancestor depends on a private type, the
11142 -- current Btype is sufficient. However, to check for circular
11143 -- definition we must recurse on the full view.
11145 Candidate := Trace_Components (Full_View (Btype), True);
11147 if Candidate = Any_Type then
11157 elsif Is_Array_Type (Btype) then
11158 return Trace_Components (Component_Type (Btype), True);
11160 elsif Is_Record_Type (Btype) then
11161 Component := First_Entity (Btype);
11162 while Present (Component)
11163 and then Comes_From_Source (Component)
11165 -- Skip anonymous types generated by constrained components
11167 if not Is_Type (Component) then
11168 P := Trace_Components (Etype (Component), True);
11170 if Present (P) then
11171 if P = Any_Type then
11179 Next_Entity (Component);
11187 end Trace_Components;
11189 -- Start of processing for Private_Component
11192 return Trace_Components (Type_Id, False);
11193 end Private_Component;
11195 ---------------------------
11196 -- Primitive_Names_Match --
11197 ---------------------------
11199 function Primitive_Names_Match (E1, E2 : Entity_Id) return Boolean is
11201 function Non_Internal_Name (E : Entity_Id) return Name_Id;
11202 -- Given an internal name, returns the corresponding non-internal name
11204 ------------------------
11205 -- Non_Internal_Name --
11206 ------------------------
11208 function Non_Internal_Name (E : Entity_Id) return Name_Id is
11210 Get_Name_String (Chars (E));
11211 Name_Len := Name_Len - 1;
11213 end Non_Internal_Name;
11215 -- Start of processing for Primitive_Names_Match
11218 pragma Assert (Present (E1) and then Present (E2));
11220 return Chars (E1) = Chars (E2)
11222 (not Is_Internal_Name (Chars (E1))
11223 and then Is_Internal_Name (Chars (E2))
11224 and then Non_Internal_Name (E2) = Chars (E1))
11226 (not Is_Internal_Name (Chars (E2))
11227 and then Is_Internal_Name (Chars (E1))
11228 and then Non_Internal_Name (E1) = Chars (E2))
11230 (Is_Predefined_Dispatching_Operation (E1)
11231 and then Is_Predefined_Dispatching_Operation (E2)
11232 and then Same_TSS (E1, E2))
11234 (Is_Init_Proc (E1) and then Is_Init_Proc (E2));
11235 end Primitive_Names_Match;
11237 -----------------------
11238 -- Process_End_Label --
11239 -----------------------
11241 procedure Process_End_Label
11250 Label_Ref : Boolean;
11251 -- Set True if reference to end label itself is required
11254 -- Gets set to the operator symbol or identifier that references the
11255 -- entity Ent. For the child unit case, this is the identifier from the
11256 -- designator. For other cases, this is simply Endl.
11258 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id);
11259 -- N is an identifier node that appears as a parent unit reference in
11260 -- the case where Ent is a child unit. This procedure generates an
11261 -- appropriate cross-reference entry. E is the corresponding entity.
11263 -------------------------
11264 -- Generate_Parent_Ref --
11265 -------------------------
11267 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id) is
11269 -- If names do not match, something weird, skip reference
11271 if Chars (E) = Chars (N) then
11273 -- Generate the reference. We do NOT consider this as a reference
11274 -- for unreferenced symbol purposes.
11276 Generate_Reference (E, N, 'r', Set_Ref => False, Force => True);
11278 if Style_Check then
11279 Style.Check_Identifier (N, E);
11282 end Generate_Parent_Ref;
11284 -- Start of processing for Process_End_Label
11287 -- If no node, ignore. This happens in some error situations, and
11288 -- also for some internally generated structures where no end label
11289 -- references are required in any case.
11295 -- Nothing to do if no End_Label, happens for internally generated
11296 -- constructs where we don't want an end label reference anyway. Also
11297 -- nothing to do if Endl is a string literal, which means there was
11298 -- some prior error (bad operator symbol)
11300 Endl := End_Label (N);
11302 if No (Endl) or else Nkind (Endl) = N_String_Literal then
11306 -- Reference node is not in extended main source unit
11308 if not In_Extended_Main_Source_Unit (N) then
11310 -- Generally we do not collect references except for the extended
11311 -- main source unit. The one exception is the 'e' entry for a
11312 -- package spec, where it is useful for a client to have the
11313 -- ending information to define scopes.
11319 Label_Ref := False;
11321 -- For this case, we can ignore any parent references, but we
11322 -- need the package name itself for the 'e' entry.
11324 if Nkind (Endl) = N_Designator then
11325 Endl := Identifier (Endl);
11329 -- Reference is in extended main source unit
11334 -- For designator, generate references for the parent entries
11336 if Nkind (Endl) = N_Designator then
11338 -- Generate references for the prefix if the END line comes from
11339 -- source (otherwise we do not need these references) We climb the
11340 -- scope stack to find the expected entities.
11342 if Comes_From_Source (Endl) then
11343 Nam := Name (Endl);
11344 Scop := Current_Scope;
11345 while Nkind (Nam) = N_Selected_Component loop
11346 Scop := Scope (Scop);
11347 exit when No (Scop);
11348 Generate_Parent_Ref (Selector_Name (Nam), Scop);
11349 Nam := Prefix (Nam);
11352 if Present (Scop) then
11353 Generate_Parent_Ref (Nam, Scope (Scop));
11357 Endl := Identifier (Endl);
11361 -- If the end label is not for the given entity, then either we have
11362 -- some previous error, or this is a generic instantiation for which
11363 -- we do not need to make a cross-reference in this case anyway. In
11364 -- either case we simply ignore the call.
11366 if Chars (Ent) /= Chars (Endl) then
11370 -- If label was really there, then generate a normal reference and then
11371 -- adjust the location in the end label to point past the name (which
11372 -- should almost always be the semicolon).
11374 Loc := Sloc (Endl);
11376 if Comes_From_Source (Endl) then
11378 -- If a label reference is required, then do the style check and
11379 -- generate an l-type cross-reference entry for the label
11382 if Style_Check then
11383 Style.Check_Identifier (Endl, Ent);
11386 Generate_Reference (Ent, Endl, 'l', Set_Ref => False);
11389 -- Set the location to point past the label (normally this will
11390 -- mean the semicolon immediately following the label). This is
11391 -- done for the sake of the 'e' or 't' entry generated below.
11393 Get_Decoded_Name_String (Chars (Endl));
11394 Set_Sloc (Endl, Sloc (Endl) + Source_Ptr (Name_Len));
11397 -- In SPARK mode, no missing label is allowed for packages and
11398 -- subprogram bodies. Detect those cases by testing whether
11399 -- Process_End_Label was called for a body (Typ = 't') or a package.
11401 if Restriction_Check_Required (SPARK)
11402 and then (Typ = 't' or else Ekind (Ent) = E_Package)
11404 Error_Msg_Node_1 := Endl;
11405 Check_SPARK_Restriction ("`END &` required", Endl, Force => True);
11409 -- Now generate the e/t reference
11411 Generate_Reference (Ent, Endl, Typ, Set_Ref => False, Force => True);
11413 -- Restore Sloc, in case modified above, since we have an identifier
11414 -- and the normal Sloc should be left set in the tree.
11416 Set_Sloc (Endl, Loc);
11417 end Process_End_Label;
11419 ------------------------------------
11420 -- References_Generic_Formal_Type --
11421 ------------------------------------
11423 function References_Generic_Formal_Type (N : Node_Id) return Boolean is
11425 function Process (N : Node_Id) return Traverse_Result;
11426 -- Process one node in search for generic formal type
11432 function Process (N : Node_Id) return Traverse_Result is
11434 if Nkind (N) in N_Has_Entity then
11436 E : constant Entity_Id := Entity (N);
11438 if Present (E) then
11439 if Is_Generic_Type (E) then
11441 elsif Present (Etype (E))
11442 and then Is_Generic_Type (Etype (E))
11453 function Traverse is new Traverse_Func (Process);
11454 -- Traverse tree to look for generic type
11457 if Inside_A_Generic then
11458 return Traverse (N) = Abandon;
11462 end References_Generic_Formal_Type;
11464 --------------------
11465 -- Remove_Homonym --
11466 --------------------
11468 procedure Remove_Homonym (E : Entity_Id) is
11469 Prev : Entity_Id := Empty;
11473 if E = Current_Entity (E) then
11474 if Present (Homonym (E)) then
11475 Set_Current_Entity (Homonym (E));
11477 Set_Name_Entity_Id (Chars (E), Empty);
11480 H := Current_Entity (E);
11481 while Present (H) and then H /= E loop
11486 Set_Homonym (Prev, Homonym (E));
11488 end Remove_Homonym;
11490 ---------------------
11491 -- Rep_To_Pos_Flag --
11492 ---------------------
11494 function Rep_To_Pos_Flag (E : Entity_Id; Loc : Source_Ptr) return Node_Id is
11496 return New_Occurrence_Of
11497 (Boolean_Literals (not Range_Checks_Suppressed (E)), Loc);
11498 end Rep_To_Pos_Flag;
11500 --------------------
11501 -- Require_Entity --
11502 --------------------
11504 procedure Require_Entity (N : Node_Id) is
11506 if Is_Entity_Name (N) and then No (Entity (N)) then
11507 if Total_Errors_Detected /= 0 then
11508 Set_Entity (N, Any_Id);
11510 raise Program_Error;
11513 end Require_Entity;
11515 ------------------------------
11516 -- Requires_Transient_Scope --
11517 ------------------------------
11519 -- A transient scope is required when variable-sized temporaries are
11520 -- allocated in the primary or secondary stack, or when finalization
11521 -- actions must be generated before the next instruction.
11523 function Requires_Transient_Scope (Id : Entity_Id) return Boolean is
11524 Typ : constant Entity_Id := Underlying_Type (Id);
11526 -- Start of processing for Requires_Transient_Scope
11529 -- This is a private type which is not completed yet. This can only
11530 -- happen in a default expression (of a formal parameter or of a
11531 -- record component). Do not expand transient scope in this case
11536 -- Do not expand transient scope for non-existent procedure return
11538 elsif Typ = Standard_Void_Type then
11541 -- Elementary types do not require a transient scope
11543 elsif Is_Elementary_Type (Typ) then
11546 -- Generally, indefinite subtypes require a transient scope, since the
11547 -- back end cannot generate temporaries, since this is not a valid type
11548 -- for declaring an object. It might be possible to relax this in the
11549 -- future, e.g. by declaring the maximum possible space for the type.
11551 elsif Is_Indefinite_Subtype (Typ) then
11554 -- Functions returning tagged types may dispatch on result so their
11555 -- returned value is allocated on the secondary stack. Controlled
11556 -- type temporaries need finalization.
11558 elsif Is_Tagged_Type (Typ)
11559 or else Has_Controlled_Component (Typ)
11561 return not Is_Value_Type (Typ);
11565 elsif Is_Record_Type (Typ) then
11569 Comp := First_Entity (Typ);
11570 while Present (Comp) loop
11571 if Ekind (Comp) = E_Component
11572 and then Requires_Transient_Scope (Etype (Comp))
11576 Next_Entity (Comp);
11583 -- String literal types never require transient scope
11585 elsif Ekind (Typ) = E_String_Literal_Subtype then
11588 -- Array type. Note that we already know that this is a constrained
11589 -- array, since unconstrained arrays will fail the indefinite test.
11591 elsif Is_Array_Type (Typ) then
11593 -- If component type requires a transient scope, the array does too
11595 if Requires_Transient_Scope (Component_Type (Typ)) then
11598 -- Otherwise, we only need a transient scope if the size depends on
11599 -- the value of one or more discriminants.
11602 return Size_Depends_On_Discriminant (Typ);
11605 -- All other cases do not require a transient scope
11610 end Requires_Transient_Scope;
11612 --------------------------
11613 -- Reset_Analyzed_Flags --
11614 --------------------------
11616 procedure Reset_Analyzed_Flags (N : Node_Id) is
11618 function Clear_Analyzed (N : Node_Id) return Traverse_Result;
11619 -- Function used to reset Analyzed flags in tree. Note that we do
11620 -- not reset Analyzed flags in entities, since there is no need to
11621 -- reanalyze entities, and indeed, it is wrong to do so, since it
11622 -- can result in generating auxiliary stuff more than once.
11624 --------------------
11625 -- Clear_Analyzed --
11626 --------------------
11628 function Clear_Analyzed (N : Node_Id) return Traverse_Result is
11630 if not Has_Extension (N) then
11631 Set_Analyzed (N, False);
11635 end Clear_Analyzed;
11637 procedure Reset_Analyzed is new Traverse_Proc (Clear_Analyzed);
11639 -- Start of processing for Reset_Analyzed_Flags
11642 Reset_Analyzed (N);
11643 end Reset_Analyzed_Flags;
11645 ---------------------------
11646 -- Safe_To_Capture_Value --
11647 ---------------------------
11649 function Safe_To_Capture_Value
11652 Cond : Boolean := False) return Boolean
11655 -- The only entities for which we track constant values are variables
11656 -- which are not renamings, constants, out parameters, and in out
11657 -- parameters, so check if we have this case.
11659 -- Note: it may seem odd to track constant values for constants, but in
11660 -- fact this routine is used for other purposes than simply capturing
11661 -- the value. In particular, the setting of Known[_Non]_Null.
11663 if (Ekind (Ent) = E_Variable and then No (Renamed_Object (Ent)))
11665 Ekind (Ent) = E_Constant
11667 Ekind (Ent) = E_Out_Parameter
11669 Ekind (Ent) = E_In_Out_Parameter
11673 -- For conditionals, we also allow loop parameters and all formals,
11674 -- including in parameters.
11678 (Ekind (Ent) = E_Loop_Parameter
11680 Ekind (Ent) = E_In_Parameter)
11684 -- For all other cases, not just unsafe, but impossible to capture
11685 -- Current_Value, since the above are the only entities which have
11686 -- Current_Value fields.
11692 -- Skip if volatile or aliased, since funny things might be going on in
11693 -- these cases which we cannot necessarily track. Also skip any variable
11694 -- for which an address clause is given, or whose address is taken. Also
11695 -- never capture value of library level variables (an attempt to do so
11696 -- can occur in the case of package elaboration code).
11698 if Treat_As_Volatile (Ent)
11699 or else Is_Aliased (Ent)
11700 or else Present (Address_Clause (Ent))
11701 or else Address_Taken (Ent)
11702 or else (Is_Library_Level_Entity (Ent)
11703 and then Ekind (Ent) = E_Variable)
11708 -- OK, all above conditions are met. We also require that the scope of
11709 -- the reference be the same as the scope of the entity, not counting
11710 -- packages and blocks and loops.
11713 E_Scope : constant Entity_Id := Scope (Ent);
11714 R_Scope : Entity_Id;
11717 R_Scope := Current_Scope;
11718 while R_Scope /= Standard_Standard loop
11719 exit when R_Scope = E_Scope;
11721 if not Ekind_In (R_Scope, E_Package, E_Block, E_Loop) then
11724 R_Scope := Scope (R_Scope);
11729 -- We also require that the reference does not appear in a context
11730 -- where it is not sure to be executed (i.e. a conditional context
11731 -- or an exception handler). We skip this if Cond is True, since the
11732 -- capturing of values from conditional tests handles this ok.
11746 while Present (P) loop
11747 if Nkind (P) = N_If_Statement
11748 or else Nkind (P) = N_Case_Statement
11749 or else (Nkind (P) in N_Short_Circuit
11750 and then Desc = Right_Opnd (P))
11751 or else (Nkind (P) = N_Conditional_Expression
11752 and then Desc /= First (Expressions (P)))
11753 or else Nkind (P) = N_Exception_Handler
11754 or else Nkind (P) = N_Selective_Accept
11755 or else Nkind (P) = N_Conditional_Entry_Call
11756 or else Nkind (P) = N_Timed_Entry_Call
11757 or else Nkind (P) = N_Asynchronous_Select
11767 -- OK, looks safe to set value
11770 end Safe_To_Capture_Value;
11776 function Same_Name (N1, N2 : Node_Id) return Boolean is
11777 K1 : constant Node_Kind := Nkind (N1);
11778 K2 : constant Node_Kind := Nkind (N2);
11781 if (K1 = N_Identifier or else K1 = N_Defining_Identifier)
11782 and then (K2 = N_Identifier or else K2 = N_Defining_Identifier)
11784 return Chars (N1) = Chars (N2);
11786 elsif (K1 = N_Selected_Component or else K1 = N_Expanded_Name)
11787 and then (K2 = N_Selected_Component or else K2 = N_Expanded_Name)
11789 return Same_Name (Selector_Name (N1), Selector_Name (N2))
11790 and then Same_Name (Prefix (N1), Prefix (N2));
11801 function Same_Object (Node1, Node2 : Node_Id) return Boolean is
11802 N1 : constant Node_Id := Original_Node (Node1);
11803 N2 : constant Node_Id := Original_Node (Node2);
11804 -- We do the tests on original nodes, since we are most interested
11805 -- in the original source, not any expansion that got in the way.
11807 K1 : constant Node_Kind := Nkind (N1);
11808 K2 : constant Node_Kind := Nkind (N2);
11811 -- First case, both are entities with same entity
11813 if K1 in N_Has_Entity and then K2 in N_Has_Entity then
11815 EN1 : constant Entity_Id := Entity (N1);
11816 EN2 : constant Entity_Id := Entity (N2);
11818 if Present (EN1) and then Present (EN2)
11819 and then (Ekind_In (EN1, E_Variable, E_Constant)
11820 or else Is_Formal (EN1))
11828 -- Second case, selected component with same selector, same record
11830 if K1 = N_Selected_Component
11831 and then K2 = N_Selected_Component
11832 and then Chars (Selector_Name (N1)) = Chars (Selector_Name (N2))
11834 return Same_Object (Prefix (N1), Prefix (N2));
11836 -- Third case, indexed component with same subscripts, same array
11838 elsif K1 = N_Indexed_Component
11839 and then K2 = N_Indexed_Component
11840 and then Same_Object (Prefix (N1), Prefix (N2))
11845 E1 := First (Expressions (N1));
11846 E2 := First (Expressions (N2));
11847 while Present (E1) loop
11848 if not Same_Value (E1, E2) then
11859 -- Fourth case, slice of same array with same bounds
11862 and then K2 = N_Slice
11863 and then Nkind (Discrete_Range (N1)) = N_Range
11864 and then Nkind (Discrete_Range (N2)) = N_Range
11865 and then Same_Value (Low_Bound (Discrete_Range (N1)),
11866 Low_Bound (Discrete_Range (N2)))
11867 and then Same_Value (High_Bound (Discrete_Range (N1)),
11868 High_Bound (Discrete_Range (N2)))
11870 return Same_Name (Prefix (N1), Prefix (N2));
11872 -- All other cases, not clearly the same object
11883 function Same_Type (T1, T2 : Entity_Id) return Boolean is
11888 elsif not Is_Constrained (T1)
11889 and then not Is_Constrained (T2)
11890 and then Base_Type (T1) = Base_Type (T2)
11894 -- For now don't bother with case of identical constraints, to be
11895 -- fiddled with later on perhaps (this is only used for optimization
11896 -- purposes, so it is not critical to do a best possible job)
11907 function Same_Value (Node1, Node2 : Node_Id) return Boolean is
11909 if Compile_Time_Known_Value (Node1)
11910 and then Compile_Time_Known_Value (Node2)
11911 and then Expr_Value (Node1) = Expr_Value (Node2)
11914 elsif Same_Object (Node1, Node2) then
11925 procedure Save_Actual (N : Node_Id; Writable : Boolean := False) is
11927 if Ada_Version < Ada_2012 then
11930 elsif Is_Entity_Name (N)
11932 Nkind_In (N, N_Indexed_Component, N_Selected_Component, N_Slice)
11934 (Nkind (N) = N_Attribute_Reference
11935 and then Attribute_Name (N) = Name_Access)
11938 -- We are only interested in IN OUT parameters of inner calls
11941 or else Nkind (Parent (N)) = N_Function_Call
11942 or else Nkind (Parent (N)) in N_Op
11944 Actuals_In_Call.Increment_Last;
11945 Actuals_In_Call.Table (Actuals_In_Call.Last) := (N, Writable);
11950 ------------------------
11951 -- Scope_Is_Transient --
11952 ------------------------
11954 function Scope_Is_Transient return Boolean is
11956 return Scope_Stack.Table (Scope_Stack.Last).Is_Transient;
11957 end Scope_Is_Transient;
11963 function Scope_Within (Scope1, Scope2 : Entity_Id) return Boolean is
11968 while Scop /= Standard_Standard loop
11969 Scop := Scope (Scop);
11971 if Scop = Scope2 then
11979 --------------------------
11980 -- Scope_Within_Or_Same --
11981 --------------------------
11983 function Scope_Within_Or_Same (Scope1, Scope2 : Entity_Id) return Boolean is
11988 while Scop /= Standard_Standard loop
11989 if Scop = Scope2 then
11992 Scop := Scope (Scop);
11997 end Scope_Within_Or_Same;
11999 --------------------
12000 -- Set_Convention --
12001 --------------------
12003 procedure Set_Convention (E : Entity_Id; Val : Snames.Convention_Id) is
12005 Basic_Set_Convention (E, Val);
12008 and then Is_Access_Subprogram_Type (Base_Type (E))
12009 and then Has_Foreign_Convention (E)
12011 Set_Can_Use_Internal_Rep (E, False);
12013 end Set_Convention;
12015 ------------------------
12016 -- Set_Current_Entity --
12017 ------------------------
12019 -- The given entity is to be set as the currently visible definition of its
12020 -- associated name (i.e. the Node_Id associated with its name). All we have
12021 -- to do is to get the name from the identifier, and then set the
12022 -- associated Node_Id to point to the given entity.
12024 procedure Set_Current_Entity (E : Entity_Id) is
12026 Set_Name_Entity_Id (Chars (E), E);
12027 end Set_Current_Entity;
12029 ---------------------------
12030 -- Set_Debug_Info_Needed --
12031 ---------------------------
12033 procedure Set_Debug_Info_Needed (T : Entity_Id) is
12035 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id);
12036 pragma Inline (Set_Debug_Info_Needed_If_Not_Set);
12037 -- Used to set debug info in a related node if not set already
12039 --------------------------------------
12040 -- Set_Debug_Info_Needed_If_Not_Set --
12041 --------------------------------------
12043 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id) is
12046 and then not Needs_Debug_Info (E)
12048 Set_Debug_Info_Needed (E);
12050 -- For a private type, indicate that the full view also needs
12051 -- debug information.
12054 and then Is_Private_Type (E)
12055 and then Present (Full_View (E))
12057 Set_Debug_Info_Needed (Full_View (E));
12060 end Set_Debug_Info_Needed_If_Not_Set;
12062 -- Start of processing for Set_Debug_Info_Needed
12065 -- Nothing to do if argument is Empty or has Debug_Info_Off set, which
12066 -- indicates that Debug_Info_Needed is never required for the entity.
12069 or else Debug_Info_Off (T)
12074 -- Set flag in entity itself. Note that we will go through the following
12075 -- circuitry even if the flag is already set on T. That's intentional,
12076 -- it makes sure that the flag will be set in subsidiary entities.
12078 Set_Needs_Debug_Info (T);
12080 -- Set flag on subsidiary entities if not set already
12082 if Is_Object (T) then
12083 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
12085 elsif Is_Type (T) then
12086 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
12088 if Is_Record_Type (T) then
12090 Ent : Entity_Id := First_Entity (T);
12092 while Present (Ent) loop
12093 Set_Debug_Info_Needed_If_Not_Set (Ent);
12098 -- For a class wide subtype, we also need debug information
12099 -- for the equivalent type.
12101 if Ekind (T) = E_Class_Wide_Subtype then
12102 Set_Debug_Info_Needed_If_Not_Set (Equivalent_Type (T));
12105 elsif Is_Array_Type (T) then
12106 Set_Debug_Info_Needed_If_Not_Set (Component_Type (T));
12109 Indx : Node_Id := First_Index (T);
12111 while Present (Indx) loop
12112 Set_Debug_Info_Needed_If_Not_Set (Etype (Indx));
12113 Indx := Next_Index (Indx);
12117 if Is_Packed (T) then
12118 Set_Debug_Info_Needed_If_Not_Set (Packed_Array_Type (T));
12121 elsif Is_Access_Type (T) then
12122 Set_Debug_Info_Needed_If_Not_Set (Directly_Designated_Type (T));
12124 elsif Is_Private_Type (T) then
12125 Set_Debug_Info_Needed_If_Not_Set (Full_View (T));
12127 elsif Is_Protected_Type (T) then
12128 Set_Debug_Info_Needed_If_Not_Set (Corresponding_Record_Type (T));
12131 end Set_Debug_Info_Needed;
12133 ---------------------------------
12134 -- Set_Entity_With_Style_Check --
12135 ---------------------------------
12137 procedure Set_Entity_With_Style_Check (N : Node_Id; Val : Entity_Id) is
12138 Val_Actual : Entity_Id;
12142 Set_Entity (N, Val);
12145 and then not Suppress_Style_Checks (Val)
12146 and then not In_Instance
12148 if Nkind (N) = N_Identifier then
12150 elsif Nkind (N) = N_Expanded_Name then
12151 Nod := Selector_Name (N);
12156 -- A special situation arises for derived operations, where we want
12157 -- to do the check against the parent (since the Sloc of the derived
12158 -- operation points to the derived type declaration itself).
12161 while not Comes_From_Source (Val_Actual)
12162 and then Nkind (Val_Actual) in N_Entity
12163 and then (Ekind (Val_Actual) = E_Enumeration_Literal
12164 or else Is_Subprogram (Val_Actual)
12165 or else Is_Generic_Subprogram (Val_Actual))
12166 and then Present (Alias (Val_Actual))
12168 Val_Actual := Alias (Val_Actual);
12171 -- Renaming declarations for generic actuals do not come from source,
12172 -- and have a different name from that of the entity they rename, so
12173 -- there is no style check to perform here.
12175 if Chars (Nod) = Chars (Val_Actual) then
12176 Style.Check_Identifier (Nod, Val_Actual);
12180 Set_Entity (N, Val);
12181 end Set_Entity_With_Style_Check;
12183 ------------------------
12184 -- Set_Name_Entity_Id --
12185 ------------------------
12187 procedure Set_Name_Entity_Id (Id : Name_Id; Val : Entity_Id) is
12189 Set_Name_Table_Info (Id, Int (Val));
12190 end Set_Name_Entity_Id;
12192 ---------------------
12193 -- Set_Next_Actual --
12194 ---------------------
12196 procedure Set_Next_Actual (Ass1_Id : Node_Id; Ass2_Id : Node_Id) is
12198 if Nkind (Parent (Ass1_Id)) = N_Parameter_Association then
12199 Set_First_Named_Actual (Parent (Ass1_Id), Ass2_Id);
12201 end Set_Next_Actual;
12203 ----------------------------------
12204 -- Set_Optimize_Alignment_Flags --
12205 ----------------------------------
12207 procedure Set_Optimize_Alignment_Flags (E : Entity_Id) is
12209 if Optimize_Alignment = 'S' then
12210 Set_Optimize_Alignment_Space (E);
12211 elsif Optimize_Alignment = 'T' then
12212 Set_Optimize_Alignment_Time (E);
12214 end Set_Optimize_Alignment_Flags;
12216 -----------------------
12217 -- Set_Public_Status --
12218 -----------------------
12220 procedure Set_Public_Status (Id : Entity_Id) is
12221 S : constant Entity_Id := Current_Scope;
12223 function Within_HSS_Or_If (E : Entity_Id) return Boolean;
12224 -- Determines if E is defined within handled statement sequence or
12225 -- an if statement, returns True if so, False otherwise.
12227 ----------------------
12228 -- Within_HSS_Or_If --
12229 ----------------------
12231 function Within_HSS_Or_If (E : Entity_Id) return Boolean is
12234 N := Declaration_Node (E);
12241 elsif Nkind_In (N, N_Handled_Sequence_Of_Statements,
12247 end Within_HSS_Or_If;
12249 -- Start of processing for Set_Public_Status
12252 -- Everything in the scope of Standard is public
12254 if S = Standard_Standard then
12255 Set_Is_Public (Id);
12257 -- Entity is definitely not public if enclosing scope is not public
12259 elsif not Is_Public (S) then
12262 -- An object or function declaration that occurs in a handled sequence
12263 -- of statements or within an if statement is the declaration for a
12264 -- temporary object or local subprogram generated by the expander. It
12265 -- never needs to be made public and furthermore, making it public can
12266 -- cause back end problems.
12268 elsif Nkind_In (Parent (Id), N_Object_Declaration,
12269 N_Function_Specification)
12270 and then Within_HSS_Or_If (Id)
12274 -- Entities in public packages or records are public
12276 elsif Ekind (S) = E_Package or Is_Record_Type (S) then
12277 Set_Is_Public (Id);
12279 -- The bounds of an entry family declaration can generate object
12280 -- declarations that are visible to the back-end, e.g. in the
12281 -- the declaration of a composite type that contains tasks.
12283 elsif Is_Concurrent_Type (S)
12284 and then not Has_Completion (S)
12285 and then Nkind (Parent (Id)) = N_Object_Declaration
12287 Set_Is_Public (Id);
12289 end Set_Public_Status;
12291 -----------------------------
12292 -- Set_Referenced_Modified --
12293 -----------------------------
12295 procedure Set_Referenced_Modified (N : Node_Id; Out_Param : Boolean) is
12299 -- Deal with indexed or selected component where prefix is modified
12301 if Nkind_In (N, N_Indexed_Component, N_Selected_Component) then
12302 Pref := Prefix (N);
12304 -- If prefix is access type, then it is the designated object that is
12305 -- being modified, which means we have no entity to set the flag on.
12307 if No (Etype (Pref)) or else Is_Access_Type (Etype (Pref)) then
12310 -- Otherwise chase the prefix
12313 Set_Referenced_Modified (Pref, Out_Param);
12316 -- Otherwise see if we have an entity name (only other case to process)
12318 elsif Is_Entity_Name (N) and then Present (Entity (N)) then
12319 Set_Referenced_As_LHS (Entity (N), not Out_Param);
12320 Set_Referenced_As_Out_Parameter (Entity (N), Out_Param);
12322 end Set_Referenced_Modified;
12324 ----------------------------
12325 -- Set_Scope_Is_Transient --
12326 ----------------------------
12328 procedure Set_Scope_Is_Transient (V : Boolean := True) is
12330 Scope_Stack.Table (Scope_Stack.Last).Is_Transient := V;
12331 end Set_Scope_Is_Transient;
12333 -------------------
12334 -- Set_Size_Info --
12335 -------------------
12337 procedure Set_Size_Info (T1, T2 : Entity_Id) is
12339 -- We copy Esize, but not RM_Size, since in general RM_Size is
12340 -- subtype specific and does not get inherited by all subtypes.
12342 Set_Esize (T1, Esize (T2));
12343 Set_Has_Biased_Representation (T1, Has_Biased_Representation (T2));
12345 if Is_Discrete_Or_Fixed_Point_Type (T1)
12347 Is_Discrete_Or_Fixed_Point_Type (T2)
12349 Set_Is_Unsigned_Type (T1, Is_Unsigned_Type (T2));
12352 Set_Alignment (T1, Alignment (T2));
12355 --------------------
12356 -- Static_Boolean --
12357 --------------------
12359 function Static_Boolean (N : Node_Id) return Uint is
12361 Analyze_And_Resolve (N, Standard_Boolean);
12364 or else Error_Posted (N)
12365 or else Etype (N) = Any_Type
12370 if Is_Static_Expression (N) then
12371 if not Raises_Constraint_Error (N) then
12372 return Expr_Value (N);
12377 elsif Etype (N) = Any_Type then
12381 Flag_Non_Static_Expr
12382 ("static boolean expression required here", N);
12385 end Static_Boolean;
12387 --------------------
12388 -- Static_Integer --
12389 --------------------
12391 function Static_Integer (N : Node_Id) return Uint is
12393 Analyze_And_Resolve (N, Any_Integer);
12396 or else Error_Posted (N)
12397 or else Etype (N) = Any_Type
12402 if Is_Static_Expression (N) then
12403 if not Raises_Constraint_Error (N) then
12404 return Expr_Value (N);
12409 elsif Etype (N) = Any_Type then
12413 Flag_Non_Static_Expr
12414 ("static integer expression required here", N);
12417 end Static_Integer;
12419 --------------------------
12420 -- Statically_Different --
12421 --------------------------
12423 function Statically_Different (E1, E2 : Node_Id) return Boolean is
12424 R1 : constant Node_Id := Get_Referenced_Object (E1);
12425 R2 : constant Node_Id := Get_Referenced_Object (E2);
12427 return Is_Entity_Name (R1)
12428 and then Is_Entity_Name (R2)
12429 and then Entity (R1) /= Entity (R2)
12430 and then not Is_Formal (Entity (R1))
12431 and then not Is_Formal (Entity (R2));
12432 end Statically_Different;
12434 -----------------------------
12435 -- Subprogram_Access_Level --
12436 -----------------------------
12438 function Subprogram_Access_Level (Subp : Entity_Id) return Uint is
12440 if Present (Alias (Subp)) then
12441 return Subprogram_Access_Level (Alias (Subp));
12443 return Scope_Depth (Enclosing_Dynamic_Scope (Subp));
12445 end Subprogram_Access_Level;
12451 procedure Trace_Scope (N : Node_Id; E : Entity_Id; Msg : String) is
12453 if Debug_Flag_W then
12454 for J in 0 .. Scope_Stack.Last loop
12459 Write_Name (Chars (E));
12460 Write_Str (" from ");
12461 Write_Location (Sloc (N));
12466 -----------------------
12467 -- Transfer_Entities --
12468 -----------------------
12470 procedure Transfer_Entities (From : Entity_Id; To : Entity_Id) is
12471 Ent : Entity_Id := First_Entity (From);
12478 if (Last_Entity (To)) = Empty then
12479 Set_First_Entity (To, Ent);
12481 Set_Next_Entity (Last_Entity (To), Ent);
12484 Set_Last_Entity (To, Last_Entity (From));
12486 while Present (Ent) loop
12487 Set_Scope (Ent, To);
12489 if not Is_Public (Ent) then
12490 Set_Public_Status (Ent);
12493 and then Ekind (Ent) = E_Record_Subtype
12496 -- The components of the propagated Itype must be public
12502 Comp := First_Entity (Ent);
12503 while Present (Comp) loop
12504 Set_Is_Public (Comp);
12505 Next_Entity (Comp);
12514 Set_First_Entity (From, Empty);
12515 Set_Last_Entity (From, Empty);
12516 end Transfer_Entities;
12518 -----------------------
12519 -- Type_Access_Level --
12520 -----------------------
12522 function Type_Access_Level (Typ : Entity_Id) return Uint is
12526 Btyp := Base_Type (Typ);
12528 -- Ada 2005 (AI-230): For most cases of anonymous access types, we
12529 -- simply use the level where the type is declared. This is true for
12530 -- stand-alone object declarations, and for anonymous access types
12531 -- associated with components the level is the same as that of the
12532 -- enclosing composite type. However, special treatment is needed for
12533 -- the cases of access parameters, return objects of an anonymous access
12534 -- type, and, in Ada 95, access discriminants of limited types.
12536 if Ekind (Btyp) in Access_Kind then
12537 if Ekind (Btyp) = E_Anonymous_Access_Type then
12539 -- If the type is a nonlocal anonymous access type (such as for
12540 -- an access parameter) we treat it as being declared at the
12541 -- library level to ensure that names such as X.all'access don't
12542 -- fail static accessibility checks.
12544 if not Is_Local_Anonymous_Access (Typ) then
12545 return Scope_Depth (Standard_Standard);
12547 -- If this is a return object, the accessibility level is that of
12548 -- the result subtype of the enclosing function. The test here is
12549 -- little complicated, because we have to account for extended
12550 -- return statements that have been rewritten as blocks, in which
12551 -- case we have to find and the Is_Return_Object attribute of the
12552 -- itype's associated object. It would be nice to find a way to
12553 -- simplify this test, but it doesn't seem worthwhile to add a new
12554 -- flag just for purposes of this test. ???
12556 elsif Ekind (Scope (Btyp)) = E_Return_Statement
12559 and then Nkind (Associated_Node_For_Itype (Btyp)) =
12560 N_Object_Declaration
12561 and then Is_Return_Object
12562 (Defining_Identifier
12563 (Associated_Node_For_Itype (Btyp))))
12569 Scop := Scope (Scope (Btyp));
12570 while Present (Scop) loop
12571 exit when Ekind (Scop) = E_Function;
12572 Scop := Scope (Scop);
12575 -- Treat the return object's type as having the level of the
12576 -- function's result subtype (as per RM05-6.5(5.3/2)).
12578 return Type_Access_Level (Etype (Scop));
12583 Btyp := Root_Type (Btyp);
12585 -- The accessibility level of anonymous access types associated with
12586 -- discriminants is that of the current instance of the type, and
12587 -- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
12589 -- AI-402: access discriminants have accessibility based on the
12590 -- object rather than the type in Ada 2005, so the above paragraph
12593 -- ??? Needs completion with rules from AI-416
12595 if Ada_Version <= Ada_95
12596 and then Ekind (Typ) = E_Anonymous_Access_Type
12597 and then Present (Associated_Node_For_Itype (Typ))
12598 and then Nkind (Associated_Node_For_Itype (Typ)) =
12599 N_Discriminant_Specification
12601 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp)) + 1;
12605 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
12606 end Type_Access_Level;
12608 ------------------------------------
12609 -- Type_Without_Stream_Operation --
12610 ------------------------------------
12612 function Type_Without_Stream_Operation
12614 Op : TSS_Name_Type := TSS_Null) return Entity_Id
12616 BT : constant Entity_Id := Base_Type (T);
12617 Op_Missing : Boolean;
12620 if not Restriction_Active (No_Default_Stream_Attributes) then
12624 if Is_Elementary_Type (T) then
12625 if Op = TSS_Null then
12627 No (TSS (BT, TSS_Stream_Read))
12628 or else No (TSS (BT, TSS_Stream_Write));
12631 Op_Missing := No (TSS (BT, Op));
12640 elsif Is_Array_Type (T) then
12641 return Type_Without_Stream_Operation (Component_Type (T), Op);
12643 elsif Is_Record_Type (T) then
12649 Comp := First_Component (T);
12650 while Present (Comp) loop
12651 C_Typ := Type_Without_Stream_Operation (Etype (Comp), Op);
12653 if Present (C_Typ) then
12657 Next_Component (Comp);
12663 elsif Is_Private_Type (T)
12664 and then Present (Full_View (T))
12666 return Type_Without_Stream_Operation (Full_View (T), Op);
12670 end Type_Without_Stream_Operation;
12672 ----------------------------
12673 -- Unique_Defining_Entity --
12674 ----------------------------
12676 function Unique_Defining_Entity (N : Node_Id) return Entity_Id is
12678 return Unique_Entity (Defining_Entity (N));
12679 end Unique_Defining_Entity;
12681 -------------------
12682 -- Unique_Entity --
12683 -------------------
12685 function Unique_Entity (E : Entity_Id) return Entity_Id is
12686 U : Entity_Id := E;
12692 if Present (Full_View (E)) then
12693 U := Full_View (E);
12697 if Present (Full_View (E)) then
12698 U := Full_View (E);
12701 when E_Package_Body =>
12704 if Nkind (P) = N_Defining_Program_Unit_Name then
12708 U := Corresponding_Spec (P);
12710 when E_Subprogram_Body =>
12713 if Nkind (P) = N_Defining_Program_Unit_Name then
12719 if Nkind (P) = N_Subprogram_Body_Stub then
12720 if Present (Library_Unit (P)) then
12721 U := Get_Body_From_Stub (P);
12724 U := Corresponding_Spec (P);
12738 function Unique_Name (E : Entity_Id) return String is
12740 function Get_Scoped_Name (E : Entity_Id) return String;
12741 -- Return the name of E prefixed by all the names of the scopes to which
12742 -- E belongs, except for Standard.
12744 ---------------------
12745 -- Get_Scoped_Name --
12746 ---------------------
12748 function Get_Scoped_Name (E : Entity_Id) return String is
12749 Name : constant String := Get_Name_String (Chars (E));
12751 if Has_Fully_Qualified_Name (E)
12752 or else Scope (E) = Standard_Standard
12756 return Get_Scoped_Name (Scope (E)) & "__" & Name;
12758 end Get_Scoped_Name;
12760 -- Start of processing for Unique_Name
12763 if E = Standard_Standard then
12764 return Get_Name_String (Name_Standard);
12766 elsif Scope (E) = Standard_Standard
12767 and then not (Ekind (E) = E_Package or else Is_Subprogram (E))
12769 return Get_Name_String (Name_Standard) & "__" &
12770 Get_Name_String (Chars (E));
12772 elsif Ekind (E) = E_Enumeration_Literal then
12773 return Unique_Name (Etype (E)) & "__" & Get_Name_String (Chars (E));
12776 return Get_Scoped_Name (E);
12780 --------------------------
12781 -- Unit_Declaration_Node --
12782 --------------------------
12784 function Unit_Declaration_Node (Unit_Id : Entity_Id) return Node_Id is
12785 N : Node_Id := Parent (Unit_Id);
12788 -- Predefined operators do not have a full function declaration
12790 if Ekind (Unit_Id) = E_Operator then
12794 -- Isn't there some better way to express the following ???
12796 while Nkind (N) /= N_Abstract_Subprogram_Declaration
12797 and then Nkind (N) /= N_Formal_Package_Declaration
12798 and then Nkind (N) /= N_Function_Instantiation
12799 and then Nkind (N) /= N_Generic_Package_Declaration
12800 and then Nkind (N) /= N_Generic_Subprogram_Declaration
12801 and then Nkind (N) /= N_Package_Declaration
12802 and then Nkind (N) /= N_Package_Body
12803 and then Nkind (N) /= N_Package_Instantiation
12804 and then Nkind (N) /= N_Package_Renaming_Declaration
12805 and then Nkind (N) /= N_Procedure_Instantiation
12806 and then Nkind (N) /= N_Protected_Body
12807 and then Nkind (N) /= N_Subprogram_Declaration
12808 and then Nkind (N) /= N_Subprogram_Body
12809 and then Nkind (N) /= N_Subprogram_Body_Stub
12810 and then Nkind (N) /= N_Subprogram_Renaming_Declaration
12811 and then Nkind (N) /= N_Task_Body
12812 and then Nkind (N) /= N_Task_Type_Declaration
12813 and then Nkind (N) not in N_Formal_Subprogram_Declaration
12814 and then Nkind (N) not in N_Generic_Renaming_Declaration
12818 -- We don't use Assert here, because that causes an infinite loop
12819 -- when assertions are turned off. Better to crash.
12822 raise Program_Error;
12827 end Unit_Declaration_Node;
12829 ---------------------
12830 -- Unit_Is_Visible --
12831 ---------------------
12833 function Unit_Is_Visible (U : Entity_Id) return Boolean is
12834 Curr : constant Node_Id := Cunit (Current_Sem_Unit);
12835 Curr_Entity : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
12837 function Unit_In_Parent_Context (Par_Unit : Node_Id) return Boolean;
12838 -- For a child unit, check whether unit appears in a with_clause
12841 function Unit_In_Context (Comp_Unit : Node_Id) return Boolean;
12842 -- Scan the context clause of one compilation unit looking for a
12843 -- with_clause for the unit in question.
12845 ----------------------------
12846 -- Unit_In_Parent_Context --
12847 ----------------------------
12849 function Unit_In_Parent_Context (Par_Unit : Node_Id) return Boolean is
12851 if Unit_In_Context (Par_Unit) then
12854 elsif Is_Child_Unit (Defining_Entity (Unit (Par_Unit))) then
12855 return Unit_In_Parent_Context (Parent_Spec (Unit (Par_Unit)));
12860 end Unit_In_Parent_Context;
12862 ---------------------
12863 -- Unit_In_Context --
12864 ---------------------
12866 function Unit_In_Context (Comp_Unit : Node_Id) return Boolean is
12870 Clause := First (Context_Items (Comp_Unit));
12871 while Present (Clause) loop
12872 if Nkind (Clause) = N_With_Clause then
12873 if Library_Unit (Clause) = U then
12876 -- The with_clause may denote a renaming of the unit we are
12877 -- looking for, eg. Text_IO which renames Ada.Text_IO.
12880 Renamed_Entity (Entity (Name (Clause))) =
12881 Defining_Entity (Unit (U))
12891 end Unit_In_Context;
12893 -- Start of processing for Unit_Is_Visible
12896 -- The currrent unit is directly visible
12901 elsif Unit_In_Context (Curr) then
12904 -- If the current unit is a body, check the context of the spec
12906 elsif Nkind (Unit (Curr)) = N_Package_Body
12908 (Nkind (Unit (Curr)) = N_Subprogram_Body
12909 and then not Acts_As_Spec (Unit (Curr)))
12911 if Unit_In_Context (Library_Unit (Curr)) then
12916 -- If the spec is a child unit, examine the parents
12918 if Is_Child_Unit (Curr_Entity) then
12919 if Nkind (Unit (Curr)) in N_Unit_Body then
12921 Unit_In_Parent_Context
12922 (Parent_Spec (Unit (Library_Unit (Curr))));
12924 return Unit_In_Parent_Context (Parent_Spec (Unit (Curr)));
12930 end Unit_Is_Visible;
12932 ------------------------------
12933 -- Universal_Interpretation --
12934 ------------------------------
12936 function Universal_Interpretation (Opnd : Node_Id) return Entity_Id is
12937 Index : Interp_Index;
12941 -- The argument may be a formal parameter of an operator or subprogram
12942 -- with multiple interpretations, or else an expression for an actual.
12944 if Nkind (Opnd) = N_Defining_Identifier
12945 or else not Is_Overloaded (Opnd)
12947 if Etype (Opnd) = Universal_Integer
12948 or else Etype (Opnd) = Universal_Real
12950 return Etype (Opnd);
12956 Get_First_Interp (Opnd, Index, It);
12957 while Present (It.Typ) loop
12958 if It.Typ = Universal_Integer
12959 or else It.Typ = Universal_Real
12964 Get_Next_Interp (Index, It);
12969 end Universal_Interpretation;
12975 function Unqualify (Expr : Node_Id) return Node_Id is
12977 -- Recurse to handle unlikely case of multiple levels of qualification
12979 if Nkind (Expr) = N_Qualified_Expression then
12980 return Unqualify (Expression (Expr));
12982 -- Normal case, not a qualified expression
12989 -----------------------
12990 -- Visible_Ancestors --
12991 -----------------------
12993 function Visible_Ancestors (Typ : Entity_Id) return Elist_Id is
12999 pragma Assert (Is_Record_Type (Typ)
13000 and then Is_Tagged_Type (Typ));
13002 -- Collect all the parents and progenitors of Typ. If the full-view of
13003 -- private parents and progenitors is available then it is used to
13004 -- generate the list of visible ancestors; otherwise their partial
13005 -- view is added to the resulting list.
13010 Use_Full_View => True);
13014 Ifaces_List => List_2,
13015 Exclude_Parents => True,
13016 Use_Full_View => True);
13018 -- Join the two lists. Avoid duplications because an interface may
13019 -- simultaneously be parent and progenitor of a type.
13021 Elmt := First_Elmt (List_2);
13022 while Present (Elmt) loop
13023 Append_Unique_Elmt (Node (Elmt), List_1);
13028 end Visible_Ancestors;
13030 ----------------------
13031 -- Within_Init_Proc --
13032 ----------------------
13034 function Within_Init_Proc return Boolean is
13038 S := Current_Scope;
13039 while not Is_Overloadable (S) loop
13040 if S = Standard_Standard then
13047 return Is_Init_Proc (S);
13048 end Within_Init_Proc;
13054 procedure Wrong_Type (Expr : Node_Id; Expected_Type : Entity_Id) is
13055 Found_Type : constant Entity_Id := First_Subtype (Etype (Expr));
13056 Expec_Type : constant Entity_Id := First_Subtype (Expected_Type);
13058 Matching_Field : Entity_Id;
13059 -- Entity to give a more precise suggestion on how to write a one-
13060 -- element positional aggregate.
13062 function Has_One_Matching_Field return Boolean;
13063 -- Determines if Expec_Type is a record type with a single component or
13064 -- discriminant whose type matches the found type or is one dimensional
13065 -- array whose component type matches the found type.
13067 ----------------------------
13068 -- Has_One_Matching_Field --
13069 ----------------------------
13071 function Has_One_Matching_Field return Boolean is
13075 Matching_Field := Empty;
13077 if Is_Array_Type (Expec_Type)
13078 and then Number_Dimensions (Expec_Type) = 1
13080 Covers (Etype (Component_Type (Expec_Type)), Found_Type)
13082 -- Use type name if available. This excludes multidimensional
13083 -- arrays and anonymous arrays.
13085 if Comes_From_Source (Expec_Type) then
13086 Matching_Field := Expec_Type;
13088 -- For an assignment, use name of target
13090 elsif Nkind (Parent (Expr)) = N_Assignment_Statement
13091 and then Is_Entity_Name (Name (Parent (Expr)))
13093 Matching_Field := Entity (Name (Parent (Expr)));
13098 elsif not Is_Record_Type (Expec_Type) then
13102 E := First_Entity (Expec_Type);
13107 elsif (Ekind (E) /= E_Discriminant
13108 and then Ekind (E) /= E_Component)
13109 or else (Chars (E) = Name_uTag
13110 or else Chars (E) = Name_uParent)
13119 if not Covers (Etype (E), Found_Type) then
13122 elsif Present (Next_Entity (E)) then
13126 Matching_Field := E;
13130 end Has_One_Matching_Field;
13132 -- Start of processing for Wrong_Type
13135 -- Don't output message if either type is Any_Type, or if a message
13136 -- has already been posted for this node. We need to do the latter
13137 -- check explicitly (it is ordinarily done in Errout), because we
13138 -- are using ! to force the output of the error messages.
13140 if Expec_Type = Any_Type
13141 or else Found_Type = Any_Type
13142 or else Error_Posted (Expr)
13146 -- If one of the types is a Taft-Amendment type and the other it its
13147 -- completion, it must be an illegal use of a TAT in the spec, for
13148 -- which an error was already emitted. Avoid cascaded errors.
13150 elsif Is_Incomplete_Type (Expec_Type)
13151 and then Has_Completion_In_Body (Expec_Type)
13152 and then Full_View (Expec_Type) = Etype (Expr)
13156 elsif Is_Incomplete_Type (Etype (Expr))
13157 and then Has_Completion_In_Body (Etype (Expr))
13158 and then Full_View (Etype (Expr)) = Expec_Type
13162 -- In an instance, there is an ongoing problem with completion of
13163 -- type derived from private types. Their structure is what Gigi
13164 -- expects, but the Etype is the parent type rather than the
13165 -- derived private type itself. Do not flag error in this case. The
13166 -- private completion is an entity without a parent, like an Itype.
13167 -- Similarly, full and partial views may be incorrect in the instance.
13168 -- There is no simple way to insure that it is consistent ???
13170 elsif In_Instance then
13171 if Etype (Etype (Expr)) = Etype (Expected_Type)
13173 (Has_Private_Declaration (Expected_Type)
13174 or else Has_Private_Declaration (Etype (Expr)))
13175 and then No (Parent (Expected_Type))
13181 -- An interesting special check. If the expression is parenthesized
13182 -- and its type corresponds to the type of the sole component of the
13183 -- expected record type, or to the component type of the expected one
13184 -- dimensional array type, then assume we have a bad aggregate attempt.
13186 if Nkind (Expr) in N_Subexpr
13187 and then Paren_Count (Expr) /= 0
13188 and then Has_One_Matching_Field
13190 Error_Msg_N ("positional aggregate cannot have one component", Expr);
13191 if Present (Matching_Field) then
13192 if Is_Array_Type (Expec_Type) then
13194 ("\write instead `&''First ='> ...`", Expr, Matching_Field);
13198 ("\write instead `& ='> ...`", Expr, Matching_Field);
13202 -- Another special check, if we are looking for a pool-specific access
13203 -- type and we found an E_Access_Attribute_Type, then we have the case
13204 -- of an Access attribute being used in a context which needs a pool-
13205 -- specific type, which is never allowed. The one extra check we make
13206 -- is that the expected designated type covers the Found_Type.
13208 elsif Is_Access_Type (Expec_Type)
13209 and then Ekind (Found_Type) = E_Access_Attribute_Type
13210 and then Ekind (Base_Type (Expec_Type)) /= E_General_Access_Type
13211 and then Ekind (Base_Type (Expec_Type)) /= E_Anonymous_Access_Type
13213 (Designated_Type (Expec_Type), Designated_Type (Found_Type))
13215 Error_Msg_N -- CODEFIX
13216 ("result must be general access type!", Expr);
13217 Error_Msg_NE -- CODEFIX
13218 ("add ALL to }!", Expr, Expec_Type);
13220 -- Another special check, if the expected type is an integer type,
13221 -- but the expression is of type System.Address, and the parent is
13222 -- an addition or subtraction operation whose left operand is the
13223 -- expression in question and whose right operand is of an integral
13224 -- type, then this is an attempt at address arithmetic, so give
13225 -- appropriate message.
13227 elsif Is_Integer_Type (Expec_Type)
13228 and then Is_RTE (Found_Type, RE_Address)
13229 and then (Nkind (Parent (Expr)) = N_Op_Add
13231 Nkind (Parent (Expr)) = N_Op_Subtract)
13232 and then Expr = Left_Opnd (Parent (Expr))
13233 and then Is_Integer_Type (Etype (Right_Opnd (Parent (Expr))))
13236 ("address arithmetic not predefined in package System",
13239 ("\possible missing with/use of System.Storage_Elements",
13243 -- If the expected type is an anonymous access type, as for access
13244 -- parameters and discriminants, the error is on the designated types.
13246 elsif Ekind (Expec_Type) = E_Anonymous_Access_Type then
13247 if Comes_From_Source (Expec_Type) then
13248 Error_Msg_NE ("expected}!", Expr, Expec_Type);
13251 ("expected an access type with designated}",
13252 Expr, Designated_Type (Expec_Type));
13255 if Is_Access_Type (Found_Type)
13256 and then not Comes_From_Source (Found_Type)
13259 ("\\found an access type with designated}!",
13260 Expr, Designated_Type (Found_Type));
13262 if From_With_Type (Found_Type) then
13263 Error_Msg_NE ("\\found incomplete}!", Expr, Found_Type);
13264 Error_Msg_Qual_Level := 99;
13265 Error_Msg_NE -- CODEFIX
13266 ("\\missing `WITH &;", Expr, Scope (Found_Type));
13267 Error_Msg_Qual_Level := 0;
13269 Error_Msg_NE ("found}!", Expr, Found_Type);
13273 -- Normal case of one type found, some other type expected
13276 -- If the names of the two types are the same, see if some number
13277 -- of levels of qualification will help. Don't try more than three
13278 -- levels, and if we get to standard, it's no use (and probably
13279 -- represents an error in the compiler) Also do not bother with
13280 -- internal scope names.
13283 Expec_Scope : Entity_Id;
13284 Found_Scope : Entity_Id;
13287 Expec_Scope := Expec_Type;
13288 Found_Scope := Found_Type;
13290 for Levels in Int range 0 .. 3 loop
13291 if Chars (Expec_Scope) /= Chars (Found_Scope) then
13292 Error_Msg_Qual_Level := Levels;
13296 Expec_Scope := Scope (Expec_Scope);
13297 Found_Scope := Scope (Found_Scope);
13299 exit when Expec_Scope = Standard_Standard
13300 or else Found_Scope = Standard_Standard
13301 or else not Comes_From_Source (Expec_Scope)
13302 or else not Comes_From_Source (Found_Scope);
13306 if Is_Record_Type (Expec_Type)
13307 and then Present (Corresponding_Remote_Type (Expec_Type))
13309 Error_Msg_NE ("expected}!", Expr,
13310 Corresponding_Remote_Type (Expec_Type));
13312 Error_Msg_NE ("expected}!", Expr, Expec_Type);
13315 if Is_Entity_Name (Expr)
13316 and then Is_Package_Or_Generic_Package (Entity (Expr))
13318 Error_Msg_N ("\\found package name!", Expr);
13320 elsif Is_Entity_Name (Expr)
13322 (Ekind (Entity (Expr)) = E_Procedure
13324 Ekind (Entity (Expr)) = E_Generic_Procedure)
13326 if Ekind (Expec_Type) = E_Access_Subprogram_Type then
13328 ("found procedure name, possibly missing Access attribute!",
13332 ("\\found procedure name instead of function!", Expr);
13335 elsif Nkind (Expr) = N_Function_Call
13336 and then Ekind (Expec_Type) = E_Access_Subprogram_Type
13337 and then Etype (Designated_Type (Expec_Type)) = Etype (Expr)
13338 and then No (Parameter_Associations (Expr))
13341 ("found function name, possibly missing Access attribute!",
13344 -- Catch common error: a prefix or infix operator which is not
13345 -- directly visible because the type isn't.
13347 elsif Nkind (Expr) in N_Op
13348 and then Is_Overloaded (Expr)
13349 and then not Is_Immediately_Visible (Expec_Type)
13350 and then not Is_Potentially_Use_Visible (Expec_Type)
13351 and then not In_Use (Expec_Type)
13352 and then Has_Compatible_Type (Right_Opnd (Expr), Expec_Type)
13355 ("operator of the type is not directly visible!", Expr);
13357 elsif Ekind (Found_Type) = E_Void
13358 and then Present (Parent (Found_Type))
13359 and then Nkind (Parent (Found_Type)) = N_Full_Type_Declaration
13361 Error_Msg_NE ("\\found premature usage of}!", Expr, Found_Type);
13364 Error_Msg_NE ("\\found}!", Expr, Found_Type);
13367 -- A special check for cases like M1 and M2 = 0 where M1 and M2 are
13368 -- of the same modular type, and (M1 and M2) = 0 was intended.
13370 if Expec_Type = Standard_Boolean
13371 and then Is_Modular_Integer_Type (Found_Type)
13372 and then Nkind_In (Parent (Expr), N_Op_And, N_Op_Or, N_Op_Xor)
13373 and then Nkind (Right_Opnd (Parent (Expr))) in N_Op_Compare
13376 Op : constant Node_Id := Right_Opnd (Parent (Expr));
13377 L : constant Node_Id := Left_Opnd (Op);
13378 R : constant Node_Id := Right_Opnd (Op);
13380 -- The case for the message is when the left operand of the
13381 -- comparison is the same modular type, or when it is an
13382 -- integer literal (or other universal integer expression),
13383 -- which would have been typed as the modular type if the
13384 -- parens had been there.
13386 if (Etype (L) = Found_Type
13388 Etype (L) = Universal_Integer)
13389 and then Is_Integer_Type (Etype (R))
13392 ("\\possible missing parens for modular operation", Expr);
13397 -- Reset error message qualification indication
13399 Error_Msg_Qual_Level := 0;