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 -- Defining_Entity --
2377 ---------------------
2379 function Defining_Entity (N : Node_Id) return Entity_Id is
2380 K : constant Node_Kind := Nkind (N);
2381 Err : Entity_Id := Empty;
2386 N_Subprogram_Declaration |
2387 N_Abstract_Subprogram_Declaration |
2389 N_Package_Declaration |
2390 N_Subprogram_Renaming_Declaration |
2391 N_Subprogram_Body_Stub |
2392 N_Generic_Subprogram_Declaration |
2393 N_Generic_Package_Declaration |
2394 N_Formal_Subprogram_Declaration
2396 return Defining_Entity (Specification (N));
2399 N_Component_Declaration |
2400 N_Defining_Program_Unit_Name |
2401 N_Discriminant_Specification |
2403 N_Entry_Declaration |
2404 N_Entry_Index_Specification |
2405 N_Exception_Declaration |
2406 N_Exception_Renaming_Declaration |
2407 N_Formal_Object_Declaration |
2408 N_Formal_Package_Declaration |
2409 N_Formal_Type_Declaration |
2410 N_Full_Type_Declaration |
2411 N_Implicit_Label_Declaration |
2412 N_Incomplete_Type_Declaration |
2413 N_Loop_Parameter_Specification |
2414 N_Number_Declaration |
2415 N_Object_Declaration |
2416 N_Object_Renaming_Declaration |
2417 N_Package_Body_Stub |
2418 N_Parameter_Specification |
2419 N_Private_Extension_Declaration |
2420 N_Private_Type_Declaration |
2422 N_Protected_Body_Stub |
2423 N_Protected_Type_Declaration |
2424 N_Single_Protected_Declaration |
2425 N_Single_Task_Declaration |
2426 N_Subtype_Declaration |
2429 N_Task_Type_Declaration
2431 return Defining_Identifier (N);
2434 return Defining_Entity (Proper_Body (N));
2437 N_Function_Instantiation |
2438 N_Function_Specification |
2439 N_Generic_Function_Renaming_Declaration |
2440 N_Generic_Package_Renaming_Declaration |
2441 N_Generic_Procedure_Renaming_Declaration |
2443 N_Package_Instantiation |
2444 N_Package_Renaming_Declaration |
2445 N_Package_Specification |
2446 N_Procedure_Instantiation |
2447 N_Procedure_Specification
2450 Nam : constant Node_Id := Defining_Unit_Name (N);
2453 if Nkind (Nam) in N_Entity then
2456 -- For Error, make up a name and attach to declaration
2457 -- so we can continue semantic analysis
2459 elsif Nam = Error then
2460 Err := Make_Temporary (Sloc (N), 'T');
2461 Set_Defining_Unit_Name (N, Err);
2464 -- If not an entity, get defining identifier
2467 return Defining_Identifier (Nam);
2471 when N_Block_Statement =>
2472 return Entity (Identifier (N));
2475 raise Program_Error;
2478 end Defining_Entity;
2480 --------------------------
2481 -- Denotes_Discriminant --
2482 --------------------------
2484 function Denotes_Discriminant
2486 Check_Concurrent : Boolean := False) return Boolean
2490 if not Is_Entity_Name (N)
2491 or else No (Entity (N))
2498 -- If we are checking for a protected type, the discriminant may have
2499 -- been rewritten as the corresponding discriminal of the original type
2500 -- or of the corresponding concurrent record, depending on whether we
2501 -- are in the spec or body of the protected type.
2503 return Ekind (E) = E_Discriminant
2506 and then Ekind (E) = E_In_Parameter
2507 and then Present (Discriminal_Link (E))
2509 (Is_Concurrent_Type (Scope (Discriminal_Link (E)))
2511 Is_Concurrent_Record_Type (Scope (Discriminal_Link (E)))));
2513 end Denotes_Discriminant;
2515 -------------------------
2516 -- Denotes_Same_Object --
2517 -------------------------
2519 function Denotes_Same_Object (A1, A2 : Node_Id) return Boolean is
2520 Obj1 : Node_Id := A1;
2521 Obj2 : Node_Id := A2;
2523 procedure Check_Renaming (Obj : in out Node_Id);
2524 -- If an object is a renaming, examine renamed object. If it is a
2525 -- dereference of a variable, or an indexed expression with non-constant
2526 -- indexes, no overlap check can be reported.
2528 --------------------
2529 -- Check_Renaming --
2530 --------------------
2532 procedure Check_Renaming (Obj : in out Node_Id) is
2534 if Is_Entity_Name (Obj)
2535 and then Present (Renamed_Entity (Entity (Obj)))
2537 Obj := Renamed_Entity (Entity (Obj));
2538 if Nkind (Obj) = N_Explicit_Dereference
2539 and then Is_Variable (Prefix (Obj))
2543 elsif Nkind (Obj) = N_Indexed_Component then
2548 Indx := First (Expressions (Obj));
2549 while Present (Indx) loop
2550 if not Is_OK_Static_Expression (Indx) then
2562 -- Start of processing for Denotes_Same_Object
2565 Check_Renaming (Obj1);
2566 Check_Renaming (Obj2);
2574 -- If we have entity names, then must be same entity
2576 if Is_Entity_Name (Obj1) then
2577 if Is_Entity_Name (Obj2) then
2578 return Entity (Obj1) = Entity (Obj2);
2583 -- No match if not same node kind
2585 elsif Nkind (Obj1) /= Nkind (Obj2) then
2588 -- For selected components, must have same prefix and selector
2590 elsif Nkind (Obj1) = N_Selected_Component then
2591 return Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2))
2593 Entity (Selector_Name (Obj1)) = Entity (Selector_Name (Obj2));
2595 -- For explicit dereferences, prefixes must be same
2597 elsif Nkind (Obj1) = N_Explicit_Dereference then
2598 return Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2));
2600 -- For indexed components, prefixes and all subscripts must be the same
2602 elsif Nkind (Obj1) = N_Indexed_Component then
2603 if Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2)) then
2609 Indx1 := First (Expressions (Obj1));
2610 Indx2 := First (Expressions (Obj2));
2611 while Present (Indx1) loop
2613 -- Indexes must denote the same static value or same object
2615 if Is_OK_Static_Expression (Indx1) then
2616 if not Is_OK_Static_Expression (Indx2) then
2619 elsif Expr_Value (Indx1) /= Expr_Value (Indx2) then
2623 elsif not Denotes_Same_Object (Indx1, Indx2) then
2637 -- For slices, prefixes must match and bounds must match
2639 elsif Nkind (Obj1) = N_Slice
2640 and then Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2))
2643 Lo1, Lo2, Hi1, Hi2 : Node_Id;
2646 Get_Index_Bounds (Etype (Obj1), Lo1, Hi1);
2647 Get_Index_Bounds (Etype (Obj2), Lo2, Hi2);
2649 -- Check whether bounds are statically identical. There is no
2650 -- attempt to detect partial overlap of slices.
2652 return Denotes_Same_Object (Lo1, Lo2)
2653 and then Denotes_Same_Object (Hi1, Hi2);
2656 -- Literals will appear as indexes. Isn't this where we should check
2657 -- Known_At_Compile_Time at least if we are generating warnings ???
2659 elsif Nkind (Obj1) = N_Integer_Literal then
2660 return Intval (Obj1) = Intval (Obj2);
2665 end Denotes_Same_Object;
2667 -------------------------
2668 -- Denotes_Same_Prefix --
2669 -------------------------
2671 function Denotes_Same_Prefix (A1, A2 : Node_Id) return Boolean is
2674 if Is_Entity_Name (A1) then
2675 if Nkind_In (A2, N_Selected_Component, N_Indexed_Component)
2676 and then not Is_Access_Type (Etype (A1))
2678 return Denotes_Same_Object (A1, Prefix (A2))
2679 or else Denotes_Same_Prefix (A1, Prefix (A2));
2684 elsif Is_Entity_Name (A2) then
2685 return Denotes_Same_Prefix (A2, A1);
2687 elsif Nkind_In (A1, N_Selected_Component, N_Indexed_Component, N_Slice)
2689 Nkind_In (A2, N_Selected_Component, N_Indexed_Component, N_Slice)
2692 Root1, Root2 : Node_Id;
2693 Depth1, Depth2 : Int := 0;
2696 Root1 := Prefix (A1);
2697 while not Is_Entity_Name (Root1) loop
2699 (Root1, N_Selected_Component, N_Indexed_Component)
2703 Root1 := Prefix (Root1);
2706 Depth1 := Depth1 + 1;
2709 Root2 := Prefix (A2);
2710 while not Is_Entity_Name (Root2) loop
2712 (Root2, N_Selected_Component, N_Indexed_Component)
2716 Root2 := Prefix (Root2);
2719 Depth2 := Depth2 + 1;
2722 -- If both have the same depth and they do not denote the same
2723 -- object, they are disjoint and not warning is needed.
2725 if Depth1 = Depth2 then
2728 elsif Depth1 > Depth2 then
2729 Root1 := Prefix (A1);
2730 for I in 1 .. Depth1 - Depth2 - 1 loop
2731 Root1 := Prefix (Root1);
2734 return Denotes_Same_Object (Root1, A2);
2737 Root2 := Prefix (A2);
2738 for I in 1 .. Depth2 - Depth1 - 1 loop
2739 Root2 := Prefix (Root2);
2742 return Denotes_Same_Object (A1, Root2);
2749 end Denotes_Same_Prefix;
2751 ----------------------
2752 -- Denotes_Variable --
2753 ----------------------
2755 function Denotes_Variable (N : Node_Id) return Boolean is
2757 return Is_Variable (N) and then Paren_Count (N) = 0;
2758 end Denotes_Variable;
2760 -----------------------------
2761 -- Depends_On_Discriminant --
2762 -----------------------------
2764 function Depends_On_Discriminant (N : Node_Id) return Boolean is
2769 Get_Index_Bounds (N, L, H);
2770 return Denotes_Discriminant (L) or else Denotes_Discriminant (H);
2771 end Depends_On_Discriminant;
2773 -------------------------
2774 -- Designate_Same_Unit --
2775 -------------------------
2777 function Designate_Same_Unit
2779 Name2 : Node_Id) return Boolean
2781 K1 : constant Node_Kind := Nkind (Name1);
2782 K2 : constant Node_Kind := Nkind (Name2);
2784 function Prefix_Node (N : Node_Id) return Node_Id;
2785 -- Returns the parent unit name node of a defining program unit name
2786 -- or the prefix if N is a selected component or an expanded name.
2788 function Select_Node (N : Node_Id) return Node_Id;
2789 -- Returns the defining identifier node of a defining program unit
2790 -- name or the selector node if N is a selected component or an
2797 function Prefix_Node (N : Node_Id) return Node_Id is
2799 if Nkind (N) = N_Defining_Program_Unit_Name then
2811 function Select_Node (N : Node_Id) return Node_Id is
2813 if Nkind (N) = N_Defining_Program_Unit_Name then
2814 return Defining_Identifier (N);
2817 return Selector_Name (N);
2821 -- Start of processing for Designate_Next_Unit
2824 if (K1 = N_Identifier or else
2825 K1 = N_Defining_Identifier)
2827 (K2 = N_Identifier or else
2828 K2 = N_Defining_Identifier)
2830 return Chars (Name1) = Chars (Name2);
2833 (K1 = N_Expanded_Name or else
2834 K1 = N_Selected_Component or else
2835 K1 = N_Defining_Program_Unit_Name)
2837 (K2 = N_Expanded_Name or else
2838 K2 = N_Selected_Component or else
2839 K2 = N_Defining_Program_Unit_Name)
2842 (Chars (Select_Node (Name1)) = Chars (Select_Node (Name2)))
2844 Designate_Same_Unit (Prefix_Node (Name1), Prefix_Node (Name2));
2849 end Designate_Same_Unit;
2851 --------------------------
2852 -- Enclosing_CPP_Parent --
2853 --------------------------
2855 function Enclosing_CPP_Parent (Typ : Entity_Id) return Entity_Id is
2856 Parent_Typ : Entity_Id := Typ;
2859 while not Is_CPP_Class (Parent_Typ)
2860 and then Etype (Parent_Typ) /= Parent_Typ
2862 Parent_Typ := Etype (Parent_Typ);
2864 if Is_Private_Type (Parent_Typ) then
2865 Parent_Typ := Full_View (Base_Type (Parent_Typ));
2869 pragma Assert (Is_CPP_Class (Parent_Typ));
2871 end Enclosing_CPP_Parent;
2873 ----------------------------
2874 -- Enclosing_Generic_Body --
2875 ----------------------------
2877 function Enclosing_Generic_Body
2878 (N : Node_Id) return Node_Id
2886 while Present (P) loop
2887 if Nkind (P) = N_Package_Body
2888 or else Nkind (P) = N_Subprogram_Body
2890 Spec := Corresponding_Spec (P);
2892 if Present (Spec) then
2893 Decl := Unit_Declaration_Node (Spec);
2895 if Nkind (Decl) = N_Generic_Package_Declaration
2896 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2907 end Enclosing_Generic_Body;
2909 ----------------------------
2910 -- Enclosing_Generic_Unit --
2911 ----------------------------
2913 function Enclosing_Generic_Unit
2914 (N : Node_Id) return Node_Id
2922 while Present (P) loop
2923 if Nkind (P) = N_Generic_Package_Declaration
2924 or else Nkind (P) = N_Generic_Subprogram_Declaration
2928 elsif Nkind (P) = N_Package_Body
2929 or else Nkind (P) = N_Subprogram_Body
2931 Spec := Corresponding_Spec (P);
2933 if Present (Spec) then
2934 Decl := Unit_Declaration_Node (Spec);
2936 if Nkind (Decl) = N_Generic_Package_Declaration
2937 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2948 end Enclosing_Generic_Unit;
2950 -------------------------------
2951 -- Enclosing_Lib_Unit_Entity --
2952 -------------------------------
2954 function Enclosing_Lib_Unit_Entity return Entity_Id is
2955 Unit_Entity : Entity_Id;
2958 -- Look for enclosing library unit entity by following scope links.
2959 -- Equivalent to, but faster than indexing through the scope stack.
2961 Unit_Entity := Current_Scope;
2962 while (Present (Scope (Unit_Entity))
2963 and then Scope (Unit_Entity) /= Standard_Standard)
2964 and not Is_Child_Unit (Unit_Entity)
2966 Unit_Entity := Scope (Unit_Entity);
2970 end Enclosing_Lib_Unit_Entity;
2972 -----------------------------
2973 -- Enclosing_Lib_Unit_Node --
2974 -----------------------------
2976 function Enclosing_Lib_Unit_Node (N : Node_Id) return Node_Id is
2977 Current_Node : Node_Id;
2981 while Present (Current_Node)
2982 and then Nkind (Current_Node) /= N_Compilation_Unit
2984 Current_Node := Parent (Current_Node);
2987 if Nkind (Current_Node) /= N_Compilation_Unit then
2991 return Current_Node;
2992 end Enclosing_Lib_Unit_Node;
2994 -----------------------
2995 -- Enclosing_Package --
2996 -----------------------
2998 function Enclosing_Package (E : Entity_Id) return Entity_Id is
2999 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
3002 if Dynamic_Scope = Standard_Standard then
3003 return Standard_Standard;
3005 elsif Dynamic_Scope = Empty then
3008 elsif Ekind_In (Dynamic_Scope, E_Package, E_Package_Body,
3011 return Dynamic_Scope;
3014 return Enclosing_Package (Dynamic_Scope);
3016 end Enclosing_Package;
3018 --------------------------
3019 -- Enclosing_Subprogram --
3020 --------------------------
3022 function Enclosing_Subprogram (E : Entity_Id) return Entity_Id is
3023 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
3026 if Dynamic_Scope = Standard_Standard then
3029 elsif Dynamic_Scope = Empty then
3032 elsif Ekind (Dynamic_Scope) = E_Subprogram_Body then
3033 return Corresponding_Spec (Parent (Parent (Dynamic_Scope)));
3035 elsif Ekind (Dynamic_Scope) = E_Block
3036 or else Ekind (Dynamic_Scope) = E_Return_Statement
3038 return Enclosing_Subprogram (Dynamic_Scope);
3040 elsif Ekind (Dynamic_Scope) = E_Task_Type then
3041 return Get_Task_Body_Procedure (Dynamic_Scope);
3043 elsif Ekind (Dynamic_Scope) = E_Limited_Private_Type
3044 and then Present (Full_View (Dynamic_Scope))
3045 and then Ekind (Full_View (Dynamic_Scope)) = E_Task_Type
3047 return Get_Task_Body_Procedure (Full_View (Dynamic_Scope));
3049 -- No body is generated if the protected operation is eliminated
3051 elsif Convention (Dynamic_Scope) = Convention_Protected
3052 and then not Is_Eliminated (Dynamic_Scope)
3053 and then Present (Protected_Body_Subprogram (Dynamic_Scope))
3055 return Protected_Body_Subprogram (Dynamic_Scope);
3058 return Dynamic_Scope;
3060 end Enclosing_Subprogram;
3062 ------------------------
3063 -- Ensure_Freeze_Node --
3064 ------------------------
3066 procedure Ensure_Freeze_Node (E : Entity_Id) is
3070 if No (Freeze_Node (E)) then
3071 FN := Make_Freeze_Entity (Sloc (E));
3072 Set_Has_Delayed_Freeze (E);
3073 Set_Freeze_Node (E, FN);
3074 Set_Access_Types_To_Process (FN, No_Elist);
3075 Set_TSS_Elist (FN, No_Elist);
3078 end Ensure_Freeze_Node;
3084 procedure Enter_Name (Def_Id : Entity_Id) is
3085 C : constant Entity_Id := Current_Entity (Def_Id);
3086 E : constant Entity_Id := Current_Entity_In_Scope (Def_Id);
3087 S : constant Entity_Id := Current_Scope;
3090 Generate_Definition (Def_Id);
3092 -- Add new name to current scope declarations. Check for duplicate
3093 -- declaration, which may or may not be a genuine error.
3097 -- Case of previous entity entered because of a missing declaration
3098 -- or else a bad subtype indication. Best is to use the new entity,
3099 -- and make the previous one invisible.
3101 if Etype (E) = Any_Type then
3102 Set_Is_Immediately_Visible (E, False);
3104 -- Case of renaming declaration constructed for package instances.
3105 -- if there is an explicit declaration with the same identifier,
3106 -- the renaming is not immediately visible any longer, but remains
3107 -- visible through selected component notation.
3109 elsif Nkind (Parent (E)) = N_Package_Renaming_Declaration
3110 and then not Comes_From_Source (E)
3112 Set_Is_Immediately_Visible (E, False);
3114 -- The new entity may be the package renaming, which has the same
3115 -- same name as a generic formal which has been seen already.
3117 elsif Nkind (Parent (Def_Id)) = N_Package_Renaming_Declaration
3118 and then not Comes_From_Source (Def_Id)
3120 Set_Is_Immediately_Visible (E, False);
3122 -- For a fat pointer corresponding to a remote access to subprogram,
3123 -- we use the same identifier as the RAS type, so that the proper
3124 -- name appears in the stub. This type is only retrieved through
3125 -- the RAS type and never by visibility, and is not added to the
3126 -- visibility list (see below).
3128 elsif Nkind (Parent (Def_Id)) = N_Full_Type_Declaration
3129 and then Present (Corresponding_Remote_Type (Def_Id))
3133 -- Case of an implicit operation or derived literal. The new entity
3134 -- hides the implicit one, which is removed from all visibility,
3135 -- i.e. the entity list of its scope, and homonym chain of its name.
3137 elsif (Is_Overloadable (E) and then Is_Inherited_Operation (E))
3138 or else Is_Internal (E)
3142 Prev_Vis : Entity_Id;
3143 Decl : constant Node_Id := Parent (E);
3146 -- If E is an implicit declaration, it cannot be the first
3147 -- entity in the scope.
3149 Prev := First_Entity (Current_Scope);
3150 while Present (Prev)
3151 and then Next_Entity (Prev) /= E
3158 -- If E is not on the entity chain of the current scope,
3159 -- it is an implicit declaration in the generic formal
3160 -- part of a generic subprogram. When analyzing the body,
3161 -- the generic formals are visible but not on the entity
3162 -- chain of the subprogram. The new entity will become
3163 -- the visible one in the body.
3166 (Nkind (Parent (Decl)) = N_Generic_Subprogram_Declaration);
3170 Set_Next_Entity (Prev, Next_Entity (E));
3172 if No (Next_Entity (Prev)) then
3173 Set_Last_Entity (Current_Scope, Prev);
3176 if E = Current_Entity (E) then
3180 Prev_Vis := Current_Entity (E);
3181 while Homonym (Prev_Vis) /= E loop
3182 Prev_Vis := Homonym (Prev_Vis);
3186 if Present (Prev_Vis) then
3188 -- Skip E in the visibility chain
3190 Set_Homonym (Prev_Vis, Homonym (E));
3193 Set_Name_Entity_Id (Chars (E), Homonym (E));
3198 -- This section of code could use a comment ???
3200 elsif Present (Etype (E))
3201 and then Is_Concurrent_Type (Etype (E))
3206 -- If the homograph is a protected component renaming, it should not
3207 -- be hiding the current entity. Such renamings are treated as weak
3210 elsif Is_Prival (E) then
3211 Set_Is_Immediately_Visible (E, False);
3213 -- In this case the current entity is a protected component renaming.
3214 -- Perform minimal decoration by setting the scope and return since
3215 -- the prival should not be hiding other visible entities.
3217 elsif Is_Prival (Def_Id) then
3218 Set_Scope (Def_Id, Current_Scope);
3221 -- Analogous to privals, the discriminal generated for an entry index
3222 -- parameter acts as a weak declaration. Perform minimal decoration
3223 -- to avoid bogus errors.
3225 elsif Is_Discriminal (Def_Id)
3226 and then Ekind (Discriminal_Link (Def_Id)) = E_Entry_Index_Parameter
3228 Set_Scope (Def_Id, Current_Scope);
3231 -- In the body or private part of an instance, a type extension may
3232 -- introduce a component with the same name as that of an actual. The
3233 -- legality rule is not enforced, but the semantics of the full type
3234 -- with two components of same name are not clear at this point???
3236 elsif In_Instance_Not_Visible then
3239 -- When compiling a package body, some child units may have become
3240 -- visible. They cannot conflict with local entities that hide them.
3242 elsif Is_Child_Unit (E)
3243 and then In_Open_Scopes (Scope (E))
3244 and then not Is_Immediately_Visible (E)
3248 -- Conversely, with front-end inlining we may compile the parent body
3249 -- first, and a child unit subsequently. The context is now the
3250 -- parent spec, and body entities are not visible.
3252 elsif Is_Child_Unit (Def_Id)
3253 and then Is_Package_Body_Entity (E)
3254 and then not In_Package_Body (Current_Scope)
3258 -- Case of genuine duplicate declaration
3261 Error_Msg_Sloc := Sloc (E);
3263 -- If the previous declaration is an incomplete type declaration
3264 -- this may be an attempt to complete it with a private type. The
3265 -- following avoids confusing cascaded errors.
3267 if Nkind (Parent (E)) = N_Incomplete_Type_Declaration
3268 and then Nkind (Parent (Def_Id)) = N_Private_Type_Declaration
3271 ("incomplete type cannot be completed with a private " &
3272 "declaration", Parent (Def_Id));
3273 Set_Is_Immediately_Visible (E, False);
3274 Set_Full_View (E, Def_Id);
3276 -- An inherited component of a record conflicts with a new
3277 -- discriminant. The discriminant is inserted first in the scope,
3278 -- but the error should be posted on it, not on the component.
3280 elsif Ekind (E) = E_Discriminant
3281 and then Present (Scope (Def_Id))
3282 and then Scope (Def_Id) /= Current_Scope
3284 Error_Msg_Sloc := Sloc (Def_Id);
3285 Error_Msg_N ("& conflicts with declaration#", E);
3288 -- If the name of the unit appears in its own context clause, a
3289 -- dummy package with the name has already been created, and the
3290 -- error emitted. Try to continue quietly.
3292 elsif Error_Posted (E)
3293 and then Sloc (E) = No_Location
3294 and then Nkind (Parent (E)) = N_Package_Specification
3295 and then Current_Scope = Standard_Standard
3297 Set_Scope (Def_Id, Current_Scope);
3301 Error_Msg_N ("& conflicts with declaration#", Def_Id);
3303 -- Avoid cascaded messages with duplicate components in
3306 if Ekind_In (E, E_Component, E_Discriminant) then
3311 if Nkind (Parent (Parent (Def_Id))) =
3312 N_Generic_Subprogram_Declaration
3314 Defining_Entity (Specification (Parent (Parent (Def_Id))))
3316 Error_Msg_N ("\generic units cannot be overloaded", Def_Id);
3319 -- If entity is in standard, then we are in trouble, because it
3320 -- means that we have a library package with a duplicated name.
3321 -- That's hard to recover from, so abort!
3323 if S = Standard_Standard then
3324 raise Unrecoverable_Error;
3326 -- Otherwise we continue with the declaration. Having two
3327 -- identical declarations should not cause us too much trouble!
3335 -- If we fall through, declaration is OK, at least OK enough to continue
3337 -- If Def_Id is a discriminant or a record component we are in the midst
3338 -- of inheriting components in a derived record definition. Preserve
3339 -- their Ekind and Etype.
3341 if Ekind_In (Def_Id, E_Discriminant, E_Component) then
3344 -- If a type is already set, leave it alone (happens when a type
3345 -- declaration is reanalyzed following a call to the optimizer).
3347 elsif Present (Etype (Def_Id)) then
3350 -- Otherwise, the kind E_Void insures that premature uses of the entity
3351 -- will be detected. Any_Type insures that no cascaded errors will occur
3354 Set_Ekind (Def_Id, E_Void);
3355 Set_Etype (Def_Id, Any_Type);
3358 -- Inherited discriminants and components in derived record types are
3359 -- immediately visible. Itypes are not.
3361 if Ekind_In (Def_Id, E_Discriminant, E_Component)
3362 or else (No (Corresponding_Remote_Type (Def_Id))
3363 and then not Is_Itype (Def_Id))
3365 Set_Is_Immediately_Visible (Def_Id);
3366 Set_Current_Entity (Def_Id);
3369 Set_Homonym (Def_Id, C);
3370 Append_Entity (Def_Id, S);
3371 Set_Public_Status (Def_Id);
3373 -- Declaring a homonym is not allowed in SPARK ...
3376 and then Restriction_Check_Required (SPARK)
3380 Enclosing_Subp : constant Node_Id := Enclosing_Subprogram (Def_Id);
3381 Enclosing_Pack : constant Node_Id := Enclosing_Package (Def_Id);
3382 Other_Scope : constant Node_Id := Enclosing_Dynamic_Scope (C);
3385 -- ... unless the new declaration is in a subprogram, and the
3386 -- visible declaration is a variable declaration or a parameter
3387 -- specification outside that subprogram.
3389 if Present (Enclosing_Subp)
3390 and then Nkind_In (Parent (C), N_Object_Declaration,
3391 N_Parameter_Specification)
3392 and then not Scope_Within_Or_Same (Other_Scope, Enclosing_Subp)
3396 -- ... or the new declaration is in a package, and the visible
3397 -- declaration occurs outside that package.
3399 elsif Present (Enclosing_Pack)
3400 and then not Scope_Within_Or_Same (Other_Scope, Enclosing_Pack)
3404 -- ... or the new declaration is a component declaration in a
3405 -- record type definition.
3407 elsif Nkind (Parent (Def_Id)) = N_Component_Declaration then
3410 -- Don't issue error for non-source entities
3412 elsif Comes_From_Source (Def_Id)
3413 and then Comes_From_Source (C)
3415 Error_Msg_Sloc := Sloc (C);
3416 Check_SPARK_Restriction
3417 ("redeclaration of identifier &#", Def_Id);
3422 -- Warn if new entity hides an old one
3424 if Warn_On_Hiding and then Present (C)
3426 -- Don't warn for record components since they always have a well
3427 -- defined scope which does not confuse other uses. Note that in
3428 -- some cases, Ekind has not been set yet.
3430 and then Ekind (C) /= E_Component
3431 and then Ekind (C) /= E_Discriminant
3432 and then Nkind (Parent (C)) /= N_Component_Declaration
3433 and then Ekind (Def_Id) /= E_Component
3434 and then Ekind (Def_Id) /= E_Discriminant
3435 and then Nkind (Parent (Def_Id)) /= N_Component_Declaration
3437 -- Don't warn for one character variables. It is too common to use
3438 -- such variables as locals and will just cause too many false hits.
3440 and then Length_Of_Name (Chars (C)) /= 1
3442 -- Don't warn for non-source entities
3444 and then Comes_From_Source (C)
3445 and then Comes_From_Source (Def_Id)
3447 -- Don't warn unless entity in question is in extended main source
3449 and then In_Extended_Main_Source_Unit (Def_Id)
3451 -- Finally, the hidden entity must be either immediately visible or
3452 -- use visible (i.e. from a used package).
3455 (Is_Immediately_Visible (C)
3457 Is_Potentially_Use_Visible (C))
3459 Error_Msg_Sloc := Sloc (C);
3460 Error_Msg_N ("declaration hides &#?", Def_Id);
3464 --------------------------
3465 -- Explain_Limited_Type --
3466 --------------------------
3468 procedure Explain_Limited_Type (T : Entity_Id; N : Node_Id) is
3472 -- For array, component type must be limited
3474 if Is_Array_Type (T) then
3475 Error_Msg_Node_2 := T;
3477 ("\component type& of type& is limited", N, Component_Type (T));
3478 Explain_Limited_Type (Component_Type (T), N);
3480 elsif Is_Record_Type (T) then
3482 -- No need for extra messages if explicit limited record
3484 if Is_Limited_Record (Base_Type (T)) then
3488 -- Otherwise find a limited component. Check only components that
3489 -- come from source, or inherited components that appear in the
3490 -- source of the ancestor.
3492 C := First_Component (T);
3493 while Present (C) loop
3494 if Is_Limited_Type (Etype (C))
3496 (Comes_From_Source (C)
3498 (Present (Original_Record_Component (C))
3500 Comes_From_Source (Original_Record_Component (C))))
3502 Error_Msg_Node_2 := T;
3503 Error_Msg_NE ("\component& of type& has limited type", N, C);
3504 Explain_Limited_Type (Etype (C), N);
3511 -- The type may be declared explicitly limited, even if no component
3512 -- of it is limited, in which case we fall out of the loop.
3515 end Explain_Limited_Type;
3521 procedure Find_Actual
3523 Formal : out Entity_Id;
3526 Parnt : constant Node_Id := Parent (N);
3530 if (Nkind (Parnt) = N_Indexed_Component
3532 Nkind (Parnt) = N_Selected_Component)
3533 and then N = Prefix (Parnt)
3535 Find_Actual (Parnt, Formal, Call);
3538 elsif Nkind (Parnt) = N_Parameter_Association
3539 and then N = Explicit_Actual_Parameter (Parnt)
3541 Call := Parent (Parnt);
3543 elsif Nkind_In (Parnt, N_Procedure_Call_Statement, N_Function_Call) then
3552 -- If we have a call to a subprogram look for the parameter. Note that
3553 -- we exclude overloaded calls, since we don't know enough to be sure
3554 -- of giving the right answer in this case.
3556 if Is_Entity_Name (Name (Call))
3557 and then Present (Entity (Name (Call)))
3558 and then Is_Overloadable (Entity (Name (Call)))
3559 and then not Is_Overloaded (Name (Call))
3561 -- Fall here if we are definitely a parameter
3563 Actual := First_Actual (Call);
3564 Formal := First_Formal (Entity (Name (Call)));
3565 while Present (Formal) and then Present (Actual) loop
3569 Actual := Next_Actual (Actual);
3570 Formal := Next_Formal (Formal);
3575 -- Fall through here if we did not find matching actual
3581 ---------------------------
3582 -- Find_Body_Discriminal --
3583 ---------------------------
3585 function Find_Body_Discriminal
3586 (Spec_Discriminant : Entity_Id) return Entity_Id
3588 pragma Assert (Is_Concurrent_Record_Type (Scope (Spec_Discriminant)));
3590 Tsk : constant Entity_Id :=
3591 Corresponding_Concurrent_Type (Scope (Spec_Discriminant));
3595 -- Find discriminant of original concurrent type, and use its current
3596 -- discriminal, which is the renaming within the task/protected body.
3598 Disc := First_Discriminant (Tsk);
3599 while Present (Disc) loop
3600 if Chars (Disc) = Chars (Spec_Discriminant) then
3601 return Discriminal (Disc);
3604 Next_Discriminant (Disc);
3607 -- That loop should always succeed in finding a matching entry and
3608 -- returning. Fatal error if not.
3610 raise Program_Error;
3611 end Find_Body_Discriminal;
3613 -------------------------------------
3614 -- Find_Corresponding_Discriminant --
3615 -------------------------------------
3617 function Find_Corresponding_Discriminant
3619 Typ : Entity_Id) return Entity_Id
3621 Par_Disc : Entity_Id;
3622 Old_Disc : Entity_Id;
3623 New_Disc : Entity_Id;
3626 Par_Disc := Original_Record_Component (Original_Discriminant (Id));
3628 -- The original type may currently be private, and the discriminant
3629 -- only appear on its full view.
3631 if Is_Private_Type (Scope (Par_Disc))
3632 and then not Has_Discriminants (Scope (Par_Disc))
3633 and then Present (Full_View (Scope (Par_Disc)))
3635 Old_Disc := First_Discriminant (Full_View (Scope (Par_Disc)));
3637 Old_Disc := First_Discriminant (Scope (Par_Disc));
3640 if Is_Class_Wide_Type (Typ) then
3641 New_Disc := First_Discriminant (Root_Type (Typ));
3643 New_Disc := First_Discriminant (Typ);
3646 while Present (Old_Disc) and then Present (New_Disc) loop
3647 if Old_Disc = Par_Disc then
3650 Next_Discriminant (Old_Disc);
3651 Next_Discriminant (New_Disc);
3655 -- Should always find it
3657 raise Program_Error;
3658 end Find_Corresponding_Discriminant;
3660 --------------------------
3661 -- Find_Overlaid_Entity --
3662 --------------------------
3664 procedure Find_Overlaid_Entity
3666 Ent : out Entity_Id;
3672 -- We are looking for one of the two following forms:
3674 -- for X'Address use Y'Address
3678 -- Const : constant Address := expr;
3680 -- for X'Address use Const;
3682 -- In the second case, the expr is either Y'Address, or recursively a
3683 -- constant that eventually references Y'Address.
3688 if Nkind (N) = N_Attribute_Definition_Clause
3689 and then Chars (N) = Name_Address
3691 Expr := Expression (N);
3693 -- This loop checks the form of the expression for Y'Address,
3694 -- using recursion to deal with intermediate constants.
3697 -- Check for Y'Address
3699 if Nkind (Expr) = N_Attribute_Reference
3700 and then Attribute_Name (Expr) = Name_Address
3702 Expr := Prefix (Expr);
3705 -- Check for Const where Const is a constant entity
3707 elsif Is_Entity_Name (Expr)
3708 and then Ekind (Entity (Expr)) = E_Constant
3710 Expr := Constant_Value (Entity (Expr));
3712 -- Anything else does not need checking
3719 -- This loop checks the form of the prefix for an entity,
3720 -- using recursion to deal with intermediate components.
3723 -- Check for Y where Y is an entity
3725 if Is_Entity_Name (Expr) then
3726 Ent := Entity (Expr);
3729 -- Check for components
3732 Nkind_In (Expr, N_Selected_Component, N_Indexed_Component) then
3734 Expr := Prefix (Expr);
3737 -- Anything else does not need checking
3744 end Find_Overlaid_Entity;
3746 -------------------------
3747 -- Find_Parameter_Type --
3748 -------------------------
3750 function Find_Parameter_Type (Param : Node_Id) return Entity_Id is
3752 if Nkind (Param) /= N_Parameter_Specification then
3755 -- For an access parameter, obtain the type from the formal entity
3756 -- itself, because access to subprogram nodes do not carry a type.
3757 -- Shouldn't we always use the formal entity ???
3759 elsif Nkind (Parameter_Type (Param)) = N_Access_Definition then
3760 return Etype (Defining_Identifier (Param));
3763 return Etype (Parameter_Type (Param));
3765 end Find_Parameter_Type;
3767 -----------------------------
3768 -- Find_Static_Alternative --
3769 -----------------------------
3771 function Find_Static_Alternative (N : Node_Id) return Node_Id is
3772 Expr : constant Node_Id := Expression (N);
3773 Val : constant Uint := Expr_Value (Expr);
3778 Alt := First (Alternatives (N));
3781 if Nkind (Alt) /= N_Pragma then
3782 Choice := First (Discrete_Choices (Alt));
3783 while Present (Choice) loop
3785 -- Others choice, always matches
3787 if Nkind (Choice) = N_Others_Choice then
3790 -- Range, check if value is in the range
3792 elsif Nkind (Choice) = N_Range then
3794 Val >= Expr_Value (Low_Bound (Choice))
3796 Val <= Expr_Value (High_Bound (Choice));
3798 -- Choice is a subtype name. Note that we know it must
3799 -- be a static subtype, since otherwise it would have
3800 -- been diagnosed as illegal.
3802 elsif Is_Entity_Name (Choice)
3803 and then Is_Type (Entity (Choice))
3805 exit Search when Is_In_Range (Expr, Etype (Choice),
3806 Assume_Valid => False);
3808 -- Choice is a subtype indication
3810 elsif Nkind (Choice) = N_Subtype_Indication then
3812 C : constant Node_Id := Constraint (Choice);
3813 R : constant Node_Id := Range_Expression (C);
3817 Val >= Expr_Value (Low_Bound (R))
3819 Val <= Expr_Value (High_Bound (R));
3822 -- Choice is a simple expression
3825 exit Search when Val = Expr_Value (Choice);
3833 pragma Assert (Present (Alt));
3836 -- The above loop *must* terminate by finding a match, since
3837 -- we know the case statement is valid, and the value of the
3838 -- expression is known at compile time. When we fall out of
3839 -- the loop, Alt points to the alternative that we know will
3840 -- be selected at run time.
3843 end Find_Static_Alternative;
3849 function First_Actual (Node : Node_Id) return Node_Id is
3853 if No (Parameter_Associations (Node)) then
3857 N := First (Parameter_Associations (Node));
3859 if Nkind (N) = N_Parameter_Association then
3860 return First_Named_Actual (Node);
3866 -----------------------
3867 -- Gather_Components --
3868 -----------------------
3870 procedure Gather_Components
3872 Comp_List : Node_Id;
3873 Governed_By : List_Id;
3875 Report_Errors : out Boolean)
3879 Discrete_Choice : Node_Id;
3880 Comp_Item : Node_Id;
3882 Discrim : Entity_Id;
3883 Discrim_Name : Node_Id;
3884 Discrim_Value : Node_Id;
3887 Report_Errors := False;
3889 if No (Comp_List) or else Null_Present (Comp_List) then
3892 elsif Present (Component_Items (Comp_List)) then
3893 Comp_Item := First (Component_Items (Comp_List));
3899 while Present (Comp_Item) loop
3901 -- Skip the tag of a tagged record, the interface tags, as well
3902 -- as all items that are not user components (anonymous types,
3903 -- rep clauses, Parent field, controller field).
3905 if Nkind (Comp_Item) = N_Component_Declaration then
3907 Comp : constant Entity_Id := Defining_Identifier (Comp_Item);
3909 if not Is_Tag (Comp)
3910 and then Chars (Comp) /= Name_uParent
3912 Append_Elmt (Comp, Into);
3920 if No (Variant_Part (Comp_List)) then
3923 Discrim_Name := Name (Variant_Part (Comp_List));
3924 Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
3927 -- Look for the discriminant that governs this variant part.
3928 -- The discriminant *must* be in the Governed_By List
3930 Assoc := First (Governed_By);
3931 Find_Constraint : loop
3932 Discrim := First (Choices (Assoc));
3933 exit Find_Constraint when Chars (Discrim_Name) = Chars (Discrim)
3934 or else (Present (Corresponding_Discriminant (Entity (Discrim)))
3936 Chars (Corresponding_Discriminant (Entity (Discrim)))
3937 = Chars (Discrim_Name))
3938 or else Chars (Original_Record_Component (Entity (Discrim)))
3939 = Chars (Discrim_Name);
3941 if No (Next (Assoc)) then
3942 if not Is_Constrained (Typ)
3943 and then Is_Derived_Type (Typ)
3944 and then Present (Stored_Constraint (Typ))
3946 -- If the type is a tagged type with inherited discriminants,
3947 -- use the stored constraint on the parent in order to find
3948 -- the values of discriminants that are otherwise hidden by an
3949 -- explicit constraint. Renamed discriminants are handled in
3952 -- If several parent discriminants are renamed by a single
3953 -- discriminant of the derived type, the call to obtain the
3954 -- Corresponding_Discriminant field only retrieves the last
3955 -- of them. We recover the constraint on the others from the
3956 -- Stored_Constraint as well.
3963 D := First_Discriminant (Etype (Typ));
3964 C := First_Elmt (Stored_Constraint (Typ));
3965 while Present (D) and then Present (C) loop
3966 if Chars (Discrim_Name) = Chars (D) then
3967 if Is_Entity_Name (Node (C))
3968 and then Entity (Node (C)) = Entity (Discrim)
3970 -- D is renamed by Discrim, whose value is given in
3977 Make_Component_Association (Sloc (Typ),
3979 (New_Occurrence_Of (D, Sloc (Typ))),
3980 Duplicate_Subexpr_No_Checks (Node (C)));
3982 exit Find_Constraint;
3985 Next_Discriminant (D);
3992 if No (Next (Assoc)) then
3993 Error_Msg_NE (" missing value for discriminant&",
3994 First (Governed_By), Discrim_Name);
3995 Report_Errors := True;
4000 end loop Find_Constraint;
4002 Discrim_Value := Expression (Assoc);
4004 if not Is_OK_Static_Expression (Discrim_Value) then
4006 ("value for discriminant & must be static!",
4007 Discrim_Value, Discrim);
4008 Why_Not_Static (Discrim_Value);
4009 Report_Errors := True;
4013 Search_For_Discriminant_Value : declare
4019 UI_Discrim_Value : constant Uint := Expr_Value (Discrim_Value);
4022 Find_Discrete_Value : while Present (Variant) loop
4023 Discrete_Choice := First (Discrete_Choices (Variant));
4024 while Present (Discrete_Choice) loop
4026 exit Find_Discrete_Value when
4027 Nkind (Discrete_Choice) = N_Others_Choice;
4029 Get_Index_Bounds (Discrete_Choice, Low, High);
4031 UI_Low := Expr_Value (Low);
4032 UI_High := Expr_Value (High);
4034 exit Find_Discrete_Value when
4035 UI_Low <= UI_Discrim_Value
4037 UI_High >= UI_Discrim_Value;
4039 Next (Discrete_Choice);
4042 Next_Non_Pragma (Variant);
4043 end loop Find_Discrete_Value;
4044 end Search_For_Discriminant_Value;
4046 if No (Variant) then
4048 ("value of discriminant & is out of range", Discrim_Value, Discrim);
4049 Report_Errors := True;
4053 -- If we have found the corresponding choice, recursively add its
4054 -- components to the Into list.
4056 Gather_Components (Empty,
4057 Component_List (Variant), Governed_By, Into, Report_Errors);
4058 end Gather_Components;
4060 ------------------------
4061 -- Get_Actual_Subtype --
4062 ------------------------
4064 function Get_Actual_Subtype (N : Node_Id) return Entity_Id is
4065 Typ : constant Entity_Id := Etype (N);
4066 Utyp : Entity_Id := Underlying_Type (Typ);
4075 -- If what we have is an identifier that references a subprogram
4076 -- formal, or a variable or constant object, then we get the actual
4077 -- subtype from the referenced entity if one has been built.
4079 if Nkind (N) = N_Identifier
4081 (Is_Formal (Entity (N))
4082 or else Ekind (Entity (N)) = E_Constant
4083 or else Ekind (Entity (N)) = E_Variable)
4084 and then Present (Actual_Subtype (Entity (N)))
4086 return Actual_Subtype (Entity (N));
4088 -- Actual subtype of unchecked union is always itself. We never need
4089 -- the "real" actual subtype. If we did, we couldn't get it anyway
4090 -- because the discriminant is not available. The restrictions on
4091 -- Unchecked_Union are designed to make sure that this is OK.
4093 elsif Is_Unchecked_Union (Base_Type (Utyp)) then
4096 -- Here for the unconstrained case, we must find actual subtype
4097 -- No actual subtype is available, so we must build it on the fly.
4099 -- Checking the type, not the underlying type, for constrainedness
4100 -- seems to be necessary. Maybe all the tests should be on the type???
4102 elsif (not Is_Constrained (Typ))
4103 and then (Is_Array_Type (Utyp)
4104 or else (Is_Record_Type (Utyp)
4105 and then Has_Discriminants (Utyp)))
4106 and then not Has_Unknown_Discriminants (Utyp)
4107 and then not (Ekind (Utyp) = E_String_Literal_Subtype)
4109 -- Nothing to do if in spec expression (why not???)
4111 if In_Spec_Expression then
4114 elsif Is_Private_Type (Typ)
4115 and then not Has_Discriminants (Typ)
4117 -- If the type has no discriminants, there is no subtype to
4118 -- build, even if the underlying type is discriminated.
4122 -- Else build the actual subtype
4125 Decl := Build_Actual_Subtype (Typ, N);
4126 Atyp := Defining_Identifier (Decl);
4128 -- If Build_Actual_Subtype generated a new declaration then use it
4132 -- The actual subtype is an Itype, so analyze the declaration,
4133 -- but do not attach it to the tree, to get the type defined.
4135 Set_Parent (Decl, N);
4136 Set_Is_Itype (Atyp);
4137 Analyze (Decl, Suppress => All_Checks);
4138 Set_Associated_Node_For_Itype (Atyp, N);
4139 Set_Has_Delayed_Freeze (Atyp, False);
4141 -- We need to freeze the actual subtype immediately. This is
4142 -- needed, because otherwise this Itype will not get frozen
4143 -- at all, and it is always safe to freeze on creation because
4144 -- any associated types must be frozen at this point.
4146 Freeze_Itype (Atyp, N);
4149 -- Otherwise we did not build a declaration, so return original
4156 -- For all remaining cases, the actual subtype is the same as
4157 -- the nominal type.
4162 end Get_Actual_Subtype;
4164 -------------------------------------
4165 -- Get_Actual_Subtype_If_Available --
4166 -------------------------------------
4168 function Get_Actual_Subtype_If_Available (N : Node_Id) return Entity_Id is
4169 Typ : constant Entity_Id := Etype (N);
4172 -- If what we have is an identifier that references a subprogram
4173 -- formal, or a variable or constant object, then we get the actual
4174 -- subtype from the referenced entity if one has been built.
4176 if Nkind (N) = N_Identifier
4178 (Is_Formal (Entity (N))
4179 or else Ekind (Entity (N)) = E_Constant
4180 or else Ekind (Entity (N)) = E_Variable)
4181 and then Present (Actual_Subtype (Entity (N)))
4183 return Actual_Subtype (Entity (N));
4185 -- Otherwise the Etype of N is returned unchanged
4190 end Get_Actual_Subtype_If_Available;
4192 ------------------------
4193 -- Get_Body_From_Stub --
4194 ------------------------
4196 function Get_Body_From_Stub (N : Node_Id) return Node_Id is
4198 return Proper_Body (Unit (Library_Unit (N)));
4199 end Get_Body_From_Stub;
4201 -------------------------------
4202 -- Get_Default_External_Name --
4203 -------------------------------
4205 function Get_Default_External_Name (E : Node_Or_Entity_Id) return Node_Id is
4207 Get_Decoded_Name_String (Chars (E));
4209 if Opt.External_Name_Imp_Casing = Uppercase then
4210 Set_Casing (All_Upper_Case);
4212 Set_Casing (All_Lower_Case);
4216 Make_String_Literal (Sloc (E),
4217 Strval => String_From_Name_Buffer);
4218 end Get_Default_External_Name;
4220 --------------------------
4221 -- Get_Enclosing_Object --
4222 --------------------------
4224 function Get_Enclosing_Object (N : Node_Id) return Entity_Id is
4226 if Is_Entity_Name (N) then
4230 when N_Indexed_Component |
4232 N_Selected_Component =>
4234 -- If not generating code, a dereference may be left implicit.
4235 -- In thoses cases, return Empty.
4237 if Is_Access_Type (Etype (Prefix (N))) then
4240 return Get_Enclosing_Object (Prefix (N));
4243 when N_Type_Conversion =>
4244 return Get_Enclosing_Object (Expression (N));
4250 end Get_Enclosing_Object;
4252 ---------------------------
4253 -- Get_Enum_Lit_From_Pos --
4254 ---------------------------
4256 function Get_Enum_Lit_From_Pos
4259 Loc : Source_Ptr) return Node_Id
4264 -- In the case where the literal is of type Character, Wide_Character
4265 -- or Wide_Wide_Character or of a type derived from them, there needs
4266 -- to be some special handling since there is no explicit chain of
4267 -- literals to search. Instead, an N_Character_Literal node is created
4268 -- with the appropriate Char_Code and Chars fields.
4270 if Is_Standard_Character_Type (T) then
4271 Set_Character_Literal_Name (UI_To_CC (Pos));
4273 Make_Character_Literal (Loc,
4275 Char_Literal_Value => Pos);
4277 -- For all other cases, we have a complete table of literals, and
4278 -- we simply iterate through the chain of literal until the one
4279 -- with the desired position value is found.
4283 Lit := First_Literal (Base_Type (T));
4284 for J in 1 .. UI_To_Int (Pos) loop
4288 return New_Occurrence_Of (Lit, Loc);
4290 end Get_Enum_Lit_From_Pos;
4292 ---------------------------------------
4293 -- Get_Ensures_From_Test_Case_Pragma --
4294 ---------------------------------------
4296 function Get_Ensures_From_Test_Case_Pragma (N : Node_Id) return Node_Id is
4297 Args : constant List_Id := Pragma_Argument_Associations (N);
4301 if List_Length (Args) = 4 then
4302 Res := Pick (Args, 4);
4304 elsif List_Length (Args) = 3 then
4305 Res := Pick (Args, 3);
4307 if Chars (Res) /= Name_Ensures then
4316 end Get_Ensures_From_Test_Case_Pragma;
4318 ------------------------
4319 -- Get_Generic_Entity --
4320 ------------------------
4322 function Get_Generic_Entity (N : Node_Id) return Entity_Id is
4323 Ent : constant Entity_Id := Entity (Name (N));
4325 if Present (Renamed_Object (Ent)) then
4326 return Renamed_Object (Ent);
4330 end Get_Generic_Entity;
4332 ----------------------
4333 -- Get_Index_Bounds --
4334 ----------------------
4336 procedure Get_Index_Bounds (N : Node_Id; L, H : out Node_Id) is
4337 Kind : constant Node_Kind := Nkind (N);
4341 if Kind = N_Range then
4343 H := High_Bound (N);
4345 elsif Kind = N_Subtype_Indication then
4346 R := Range_Expression (Constraint (N));
4354 L := Low_Bound (Range_Expression (Constraint (N)));
4355 H := High_Bound (Range_Expression (Constraint (N)));
4358 elsif Is_Entity_Name (N) and then Is_Type (Entity (N)) then
4359 if Error_Posted (Scalar_Range (Entity (N))) then
4363 elsif Nkind (Scalar_Range (Entity (N))) = N_Subtype_Indication then
4364 Get_Index_Bounds (Scalar_Range (Entity (N)), L, H);
4367 L := Low_Bound (Scalar_Range (Entity (N)));
4368 H := High_Bound (Scalar_Range (Entity (N)));
4372 -- N is an expression, indicating a range with one value
4377 end Get_Index_Bounds;
4379 ----------------------------------
4380 -- Get_Library_Unit_Name_string --
4381 ----------------------------------
4383 procedure Get_Library_Unit_Name_String (Decl_Node : Node_Id) is
4384 Unit_Name_Id : constant Unit_Name_Type := Get_Unit_Name (Decl_Node);
4387 Get_Unit_Name_String (Unit_Name_Id);
4389 -- Remove seven last character (" (spec)" or " (body)")
4391 Name_Len := Name_Len - 7;
4392 pragma Assert (Name_Buffer (Name_Len + 1) = ' ');
4393 end Get_Library_Unit_Name_String;
4395 ------------------------
4396 -- Get_Name_Entity_Id --
4397 ------------------------
4399 function Get_Name_Entity_Id (Id : Name_Id) return Entity_Id is
4401 return Entity_Id (Get_Name_Table_Info (Id));
4402 end Get_Name_Entity_Id;
4404 ------------------------------------
4405 -- Get_Name_From_Test_Case_Pragma --
4406 ------------------------------------
4408 function Get_Name_From_Test_Case_Pragma (N : Node_Id) return String_Id is
4409 Arg : constant Node_Id :=
4410 Get_Pragma_Arg (First (Pragma_Argument_Associations (N)));
4412 return Strval (Expr_Value_S (Arg));
4413 end Get_Name_From_Test_Case_Pragma;
4419 function Get_Pragma_Id (N : Node_Id) return Pragma_Id is
4421 return Get_Pragma_Id (Pragma_Name (N));
4424 ---------------------------
4425 -- Get_Referenced_Object --
4426 ---------------------------
4428 function Get_Referenced_Object (N : Node_Id) return Node_Id is
4433 while Is_Entity_Name (R)
4434 and then Present (Renamed_Object (Entity (R)))
4436 R := Renamed_Object (Entity (R));
4440 end Get_Referenced_Object;
4442 ------------------------
4443 -- Get_Renamed_Entity --
4444 ------------------------
4446 function Get_Renamed_Entity (E : Entity_Id) return Entity_Id is
4451 while Present (Renamed_Entity (R)) loop
4452 R := Renamed_Entity (R);
4456 end Get_Renamed_Entity;
4458 ----------------------------------------
4459 -- Get_Requires_From_Test_Case_Pragma --
4460 ----------------------------------------
4462 function Get_Requires_From_Test_Case_Pragma (N : Node_Id) return Node_Id is
4463 Args : constant List_Id := Pragma_Argument_Associations (N);
4467 if List_Length (Args) >= 3 then
4468 Res := Pick (Args, 3);
4470 if Chars (Res) /= Name_Requires then
4479 end Get_Requires_From_Test_Case_Pragma;
4481 -------------------------
4482 -- Get_Subprogram_Body --
4483 -------------------------
4485 function Get_Subprogram_Body (E : Entity_Id) return Node_Id is
4489 Decl := Unit_Declaration_Node (E);
4491 if Nkind (Decl) = N_Subprogram_Body then
4494 -- The below comment is bad, because it is possible for
4495 -- Nkind (Decl) to be an N_Subprogram_Body_Stub ???
4497 else -- Nkind (Decl) = N_Subprogram_Declaration
4499 if Present (Corresponding_Body (Decl)) then
4500 return Unit_Declaration_Node (Corresponding_Body (Decl));
4502 -- Imported subprogram case
4508 end Get_Subprogram_Body;
4510 ---------------------------
4511 -- Get_Subprogram_Entity --
4512 ---------------------------
4514 function Get_Subprogram_Entity (Nod : Node_Id) return Entity_Id is
4519 if Nkind (Nod) = N_Accept_Statement then
4520 Nam := Entry_Direct_Name (Nod);
4522 -- For an entry call, the prefix of the call is a selected component.
4523 -- Need additional code for internal calls ???
4525 elsif Nkind (Nod) = N_Entry_Call_Statement then
4526 if Nkind (Name (Nod)) = N_Selected_Component then
4527 Nam := Entity (Selector_Name (Name (Nod)));
4536 if Nkind (Nam) = N_Explicit_Dereference then
4537 Proc := Etype (Prefix (Nam));
4538 elsif Is_Entity_Name (Nam) then
4539 Proc := Entity (Nam);
4544 if Is_Object (Proc) then
4545 Proc := Etype (Proc);
4548 if Ekind (Proc) = E_Access_Subprogram_Type then
4549 Proc := Directly_Designated_Type (Proc);
4552 if not Is_Subprogram (Proc)
4553 and then Ekind (Proc) /= E_Subprogram_Type
4559 end Get_Subprogram_Entity;
4561 -----------------------------
4562 -- Get_Task_Body_Procedure --
4563 -----------------------------
4565 function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
4567 -- Note: A task type may be the completion of a private type with
4568 -- discriminants. When performing elaboration checks on a task
4569 -- declaration, the current view of the type may be the private one,
4570 -- and the procedure that holds the body of the task is held in its
4573 -- This is an odd function, why not have Task_Body_Procedure do
4574 -- the following digging???
4576 return Task_Body_Procedure (Underlying_Type (Root_Type (E)));
4577 end Get_Task_Body_Procedure;
4579 -----------------------
4580 -- Has_Access_Values --
4581 -----------------------
4583 function Has_Access_Values (T : Entity_Id) return Boolean is
4584 Typ : constant Entity_Id := Underlying_Type (T);
4587 -- Case of a private type which is not completed yet. This can only
4588 -- happen in the case of a generic format type appearing directly, or
4589 -- as a component of the type to which this function is being applied
4590 -- at the top level. Return False in this case, since we certainly do
4591 -- not know that the type contains access types.
4596 elsif Is_Access_Type (Typ) then
4599 elsif Is_Array_Type (Typ) then
4600 return Has_Access_Values (Component_Type (Typ));
4602 elsif Is_Record_Type (Typ) then
4607 -- Loop to Check components
4609 Comp := First_Component_Or_Discriminant (Typ);
4610 while Present (Comp) loop
4612 -- Check for access component, tag field does not count, even
4613 -- though it is implemented internally using an access type.
4615 if Has_Access_Values (Etype (Comp))
4616 and then Chars (Comp) /= Name_uTag
4621 Next_Component_Or_Discriminant (Comp);
4630 end Has_Access_Values;
4632 ------------------------------
4633 -- Has_Compatible_Alignment --
4634 ------------------------------
4636 function Has_Compatible_Alignment
4638 Expr : Node_Id) return Alignment_Result
4640 function Has_Compatible_Alignment_Internal
4643 Default : Alignment_Result) return Alignment_Result;
4644 -- This is the internal recursive function that actually does the work.
4645 -- There is one additional parameter, which says what the result should
4646 -- be if no alignment information is found, and there is no definite
4647 -- indication of compatible alignments. At the outer level, this is set
4648 -- to Unknown, but for internal recursive calls in the case where types
4649 -- are known to be correct, it is set to Known_Compatible.
4651 ---------------------------------------
4652 -- Has_Compatible_Alignment_Internal --
4653 ---------------------------------------
4655 function Has_Compatible_Alignment_Internal
4658 Default : Alignment_Result) return Alignment_Result
4660 Result : Alignment_Result := Known_Compatible;
4661 -- Holds the current status of the result. Note that once a value of
4662 -- Known_Incompatible is set, it is sticky and does not get changed
4663 -- to Unknown (the value in Result only gets worse as we go along,
4666 Offs : Uint := No_Uint;
4667 -- Set to a factor of the offset from the base object when Expr is a
4668 -- selected or indexed component, based on Component_Bit_Offset and
4669 -- Component_Size respectively. A negative value is used to represent
4670 -- a value which is not known at compile time.
4672 procedure Check_Prefix;
4673 -- Checks the prefix recursively in the case where the expression
4674 -- is an indexed or selected component.
4676 procedure Set_Result (R : Alignment_Result);
4677 -- If R represents a worse outcome (unknown instead of known
4678 -- compatible, or known incompatible), then set Result to R.
4684 procedure Check_Prefix is
4686 -- The subtlety here is that in doing a recursive call to check
4687 -- the prefix, we have to decide what to do in the case where we
4688 -- don't find any specific indication of an alignment problem.
4690 -- At the outer level, we normally set Unknown as the result in
4691 -- this case, since we can only set Known_Compatible if we really
4692 -- know that the alignment value is OK, but for the recursive
4693 -- call, in the case where the types match, and we have not
4694 -- specified a peculiar alignment for the object, we are only
4695 -- concerned about suspicious rep clauses, the default case does
4696 -- not affect us, since the compiler will, in the absence of such
4697 -- rep clauses, ensure that the alignment is correct.
4699 if Default = Known_Compatible
4701 (Etype (Obj) = Etype (Expr)
4702 and then (Unknown_Alignment (Obj)
4704 Alignment (Obj) = Alignment (Etype (Obj))))
4707 (Has_Compatible_Alignment_Internal
4708 (Obj, Prefix (Expr), Known_Compatible));
4710 -- In all other cases, we need a full check on the prefix
4714 (Has_Compatible_Alignment_Internal
4715 (Obj, Prefix (Expr), Unknown));
4723 procedure Set_Result (R : Alignment_Result) is
4730 -- Start of processing for Has_Compatible_Alignment_Internal
4733 -- If Expr is a selected component, we must make sure there is no
4734 -- potentially troublesome component clause, and that the record is
4737 if Nkind (Expr) = N_Selected_Component then
4739 -- Packed record always generate unknown alignment
4741 if Is_Packed (Etype (Prefix (Expr))) then
4742 Set_Result (Unknown);
4745 -- Check prefix and component offset
4748 Offs := Component_Bit_Offset (Entity (Selector_Name (Expr)));
4750 -- If Expr is an indexed component, we must make sure there is no
4751 -- potentially troublesome Component_Size clause and that the array
4752 -- is not bit-packed.
4754 elsif Nkind (Expr) = N_Indexed_Component then
4756 Typ : constant Entity_Id := Etype (Prefix (Expr));
4757 Ind : constant Node_Id := First_Index (Typ);
4760 -- Bit packed array always generates unknown alignment
4762 if Is_Bit_Packed_Array (Typ) then
4763 Set_Result (Unknown);
4766 -- Check prefix and component offset
4769 Offs := Component_Size (Typ);
4771 -- Small optimization: compute the full offset when possible
4774 and then Offs > Uint_0
4775 and then Present (Ind)
4776 and then Nkind (Ind) = N_Range
4777 and then Compile_Time_Known_Value (Low_Bound (Ind))
4778 and then Compile_Time_Known_Value (First (Expressions (Expr)))
4780 Offs := Offs * (Expr_Value (First (Expressions (Expr)))
4781 - Expr_Value (Low_Bound ((Ind))));
4786 -- If we have a null offset, the result is entirely determined by
4787 -- the base object and has already been computed recursively.
4789 if Offs = Uint_0 then
4792 -- Case where we know the alignment of the object
4794 elsif Known_Alignment (Obj) then
4796 ObjA : constant Uint := Alignment (Obj);
4797 ExpA : Uint := No_Uint;
4798 SizA : Uint := No_Uint;
4801 -- If alignment of Obj is 1, then we are always OK
4804 Set_Result (Known_Compatible);
4806 -- Alignment of Obj is greater than 1, so we need to check
4809 -- If we have an offset, see if it is compatible
4811 if Offs /= No_Uint and Offs > Uint_0 then
4812 if Offs mod (System_Storage_Unit * ObjA) /= 0 then
4813 Set_Result (Known_Incompatible);
4816 -- See if Expr is an object with known alignment
4818 elsif Is_Entity_Name (Expr)
4819 and then Known_Alignment (Entity (Expr))
4821 ExpA := Alignment (Entity (Expr));
4823 -- Otherwise, we can use the alignment of the type of
4824 -- Expr given that we already checked for
4825 -- discombobulating rep clauses for the cases of indexed
4826 -- and selected components above.
4828 elsif Known_Alignment (Etype (Expr)) then
4829 ExpA := Alignment (Etype (Expr));
4831 -- Otherwise the alignment is unknown
4834 Set_Result (Default);
4837 -- If we got an alignment, see if it is acceptable
4839 if ExpA /= No_Uint and then ExpA < ObjA then
4840 Set_Result (Known_Incompatible);
4843 -- If Expr is not a piece of a larger object, see if size
4844 -- is given. If so, check that it is not too small for the
4845 -- required alignment.
4847 if Offs /= No_Uint then
4850 -- See if Expr is an object with known size
4852 elsif Is_Entity_Name (Expr)
4853 and then Known_Static_Esize (Entity (Expr))
4855 SizA := Esize (Entity (Expr));
4857 -- Otherwise, we check the object size of the Expr type
4859 elsif Known_Static_Esize (Etype (Expr)) then
4860 SizA := Esize (Etype (Expr));
4863 -- If we got a size, see if it is a multiple of the Obj
4864 -- alignment, if not, then the alignment cannot be
4865 -- acceptable, since the size is always a multiple of the
4868 if SizA /= No_Uint then
4869 if SizA mod (ObjA * Ttypes.System_Storage_Unit) /= 0 then
4870 Set_Result (Known_Incompatible);
4876 -- If we do not know required alignment, any non-zero offset is a
4877 -- potential problem (but certainly may be OK, so result is unknown).
4879 elsif Offs /= No_Uint then
4880 Set_Result (Unknown);
4882 -- If we can't find the result by direct comparison of alignment
4883 -- values, then there is still one case that we can determine known
4884 -- result, and that is when we can determine that the types are the
4885 -- same, and no alignments are specified. Then we known that the
4886 -- alignments are compatible, even if we don't know the alignment
4887 -- value in the front end.
4889 elsif Etype (Obj) = Etype (Expr) then
4891 -- Types are the same, but we have to check for possible size
4892 -- and alignments on the Expr object that may make the alignment
4893 -- different, even though the types are the same.
4895 if Is_Entity_Name (Expr) then
4897 -- First check alignment of the Expr object. Any alignment less
4898 -- than Maximum_Alignment is worrisome since this is the case
4899 -- where we do not know the alignment of Obj.
4901 if Known_Alignment (Entity (Expr))
4903 UI_To_Int (Alignment (Entity (Expr))) <
4904 Ttypes.Maximum_Alignment
4906 Set_Result (Unknown);
4908 -- Now check size of Expr object. Any size that is not an
4909 -- even multiple of Maximum_Alignment is also worrisome
4910 -- since it may cause the alignment of the object to be less
4911 -- than the alignment of the type.
4913 elsif Known_Static_Esize (Entity (Expr))
4915 (UI_To_Int (Esize (Entity (Expr))) mod
4916 (Ttypes.Maximum_Alignment * Ttypes.System_Storage_Unit))
4919 Set_Result (Unknown);
4921 -- Otherwise same type is decisive
4924 Set_Result (Known_Compatible);
4928 -- Another case to deal with is when there is an explicit size or
4929 -- alignment clause when the types are not the same. If so, then the
4930 -- result is Unknown. We don't need to do this test if the Default is
4931 -- Unknown, since that result will be set in any case.
4933 elsif Default /= Unknown
4934 and then (Has_Size_Clause (Etype (Expr))
4936 Has_Alignment_Clause (Etype (Expr)))
4938 Set_Result (Unknown);
4940 -- If no indication found, set default
4943 Set_Result (Default);
4946 -- Return worst result found
4949 end Has_Compatible_Alignment_Internal;
4951 -- Start of processing for Has_Compatible_Alignment
4954 -- If Obj has no specified alignment, then set alignment from the type
4955 -- alignment. Perhaps we should always do this, but for sure we should
4956 -- do it when there is an address clause since we can do more if the
4957 -- alignment is known.
4959 if Unknown_Alignment (Obj) then
4960 Set_Alignment (Obj, Alignment (Etype (Obj)));
4963 -- Now do the internal call that does all the work
4965 return Has_Compatible_Alignment_Internal (Obj, Expr, Unknown);
4966 end Has_Compatible_Alignment;
4968 ----------------------
4969 -- Has_Declarations --
4970 ----------------------
4972 function Has_Declarations (N : Node_Id) return Boolean is
4974 return Nkind_In (Nkind (N), N_Accept_Statement,
4976 N_Compilation_Unit_Aux,
4982 N_Package_Specification);
4983 end Has_Declarations;
4985 -------------------------------------------
4986 -- Has_Discriminant_Dependent_Constraint --
4987 -------------------------------------------
4989 function Has_Discriminant_Dependent_Constraint
4990 (Comp : Entity_Id) return Boolean
4992 Comp_Decl : constant Node_Id := Parent (Comp);
4993 Subt_Indic : constant Node_Id :=
4994 Subtype_Indication (Component_Definition (Comp_Decl));
4999 if Nkind (Subt_Indic) = N_Subtype_Indication then
5000 Constr := Constraint (Subt_Indic);
5002 if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
5003 Assn := First (Constraints (Constr));
5004 while Present (Assn) loop
5005 case Nkind (Assn) is
5006 when N_Subtype_Indication |
5010 if Depends_On_Discriminant (Assn) then
5014 when N_Discriminant_Association =>
5015 if Depends_On_Discriminant (Expression (Assn)) then
5030 end Has_Discriminant_Dependent_Constraint;
5032 --------------------
5033 -- Has_Infinities --
5034 --------------------
5036 function Has_Infinities (E : Entity_Id) return Boolean is
5039 Is_Floating_Point_Type (E)
5040 and then Nkind (Scalar_Range (E)) = N_Range
5041 and then Includes_Infinities (Scalar_Range (E));
5044 --------------------
5045 -- Has_Interfaces --
5046 --------------------
5048 function Has_Interfaces
5050 Use_Full_View : Boolean := True) return Boolean
5052 Typ : Entity_Id := Base_Type (T);
5055 -- Handle concurrent types
5057 if Is_Concurrent_Type (Typ) then
5058 Typ := Corresponding_Record_Type (Typ);
5061 if not Present (Typ)
5062 or else not Is_Record_Type (Typ)
5063 or else not Is_Tagged_Type (Typ)
5068 -- Handle private types
5071 and then Present (Full_View (Typ))
5073 Typ := Full_View (Typ);
5076 -- Handle concurrent record types
5078 if Is_Concurrent_Record_Type (Typ)
5079 and then Is_Non_Empty_List (Abstract_Interface_List (Typ))
5085 if Is_Interface (Typ)
5087 (Is_Record_Type (Typ)
5088 and then Present (Interfaces (Typ))
5089 and then not Is_Empty_Elmt_List (Interfaces (Typ)))
5094 exit when Etype (Typ) = Typ
5096 -- Handle private types
5098 or else (Present (Full_View (Etype (Typ)))
5099 and then Full_View (Etype (Typ)) = Typ)
5101 -- Protect the frontend against wrong source with cyclic
5104 or else Etype (Typ) = T;
5106 -- Climb to the ancestor type handling private types
5108 if Present (Full_View (Etype (Typ))) then
5109 Typ := Full_View (Etype (Typ));
5118 ------------------------
5119 -- Has_Null_Exclusion --
5120 ------------------------
5122 function Has_Null_Exclusion (N : Node_Id) return Boolean is
5125 when N_Access_Definition |
5126 N_Access_Function_Definition |
5127 N_Access_Procedure_Definition |
5128 N_Access_To_Object_Definition |
5130 N_Derived_Type_Definition |
5131 N_Function_Specification |
5132 N_Subtype_Declaration =>
5133 return Null_Exclusion_Present (N);
5135 when N_Component_Definition |
5136 N_Formal_Object_Declaration |
5137 N_Object_Renaming_Declaration =>
5138 if Present (Subtype_Mark (N)) then
5139 return Null_Exclusion_Present (N);
5140 else pragma Assert (Present (Access_Definition (N)));
5141 return Null_Exclusion_Present (Access_Definition (N));
5144 when N_Discriminant_Specification =>
5145 if Nkind (Discriminant_Type (N)) = N_Access_Definition then
5146 return Null_Exclusion_Present (Discriminant_Type (N));
5148 return Null_Exclusion_Present (N);
5151 when N_Object_Declaration =>
5152 if Nkind (Object_Definition (N)) = N_Access_Definition then
5153 return Null_Exclusion_Present (Object_Definition (N));
5155 return Null_Exclusion_Present (N);
5158 when N_Parameter_Specification =>
5159 if Nkind (Parameter_Type (N)) = N_Access_Definition then
5160 return Null_Exclusion_Present (Parameter_Type (N));
5162 return Null_Exclusion_Present (N);
5169 end Has_Null_Exclusion;
5171 ------------------------
5172 -- Has_Null_Extension --
5173 ------------------------
5175 function Has_Null_Extension (T : Entity_Id) return Boolean is
5176 B : constant Entity_Id := Base_Type (T);
5181 if Nkind (Parent (B)) = N_Full_Type_Declaration
5182 and then Present (Record_Extension_Part (Type_Definition (Parent (B))))
5184 Ext := Record_Extension_Part (Type_Definition (Parent (B)));
5186 if Present (Ext) then
5187 if Null_Present (Ext) then
5190 Comps := Component_List (Ext);
5192 -- The null component list is rewritten during analysis to
5193 -- include the parent component. Any other component indicates
5194 -- that the extension was not originally null.
5196 return Null_Present (Comps)
5197 or else No (Next (First (Component_Items (Comps))));
5206 end Has_Null_Extension;
5208 -------------------------------
5209 -- Has_Overriding_Initialize --
5210 -------------------------------
5212 function Has_Overriding_Initialize (T : Entity_Id) return Boolean is
5213 BT : constant Entity_Id := Base_Type (T);
5217 if Is_Controlled (BT) then
5218 if Is_RTU (Scope (BT), Ada_Finalization) then
5221 elsif Present (Primitive_Operations (BT)) then
5222 P := First_Elmt (Primitive_Operations (BT));
5223 while Present (P) loop
5225 Init : constant Entity_Id := Node (P);
5226 Formal : constant Entity_Id := First_Formal (Init);
5228 if Ekind (Init) = E_Procedure
5229 and then Chars (Init) = Name_Initialize
5230 and then Comes_From_Source (Init)
5231 and then Present (Formal)
5232 and then Etype (Formal) = BT
5233 and then No (Next_Formal (Formal))
5234 and then (Ada_Version < Ada_2012
5235 or else not Null_Present (Parent (Init)))
5245 -- Here if type itself does not have a non-null Initialize operation:
5246 -- check immediate ancestor.
5248 if Is_Derived_Type (BT)
5249 and then Has_Overriding_Initialize (Etype (BT))
5256 end Has_Overriding_Initialize;
5258 --------------------------------------
5259 -- Has_Preelaborable_Initialization --
5260 --------------------------------------
5262 function Has_Preelaborable_Initialization (E : Entity_Id) return Boolean is
5265 procedure Check_Components (E : Entity_Id);
5266 -- Check component/discriminant chain, sets Has_PE False if a component
5267 -- or discriminant does not meet the preelaborable initialization rules.
5269 ----------------------
5270 -- Check_Components --
5271 ----------------------
5273 procedure Check_Components (E : Entity_Id) is
5277 function Is_Preelaborable_Expression (N : Node_Id) return Boolean;
5278 -- Returns True if and only if the expression denoted by N does not
5279 -- violate restrictions on preelaborable constructs (RM-10.2.1(5-9)).
5281 ---------------------------------
5282 -- Is_Preelaborable_Expression --
5283 ---------------------------------
5285 function Is_Preelaborable_Expression (N : Node_Id) return Boolean is
5289 Comp_Type : Entity_Id;
5290 Is_Array_Aggr : Boolean;
5293 if Is_Static_Expression (N) then
5296 elsif Nkind (N) = N_Null then
5299 -- Attributes are allowed in general, even if their prefix is a
5300 -- formal type. (It seems that certain attributes known not to be
5301 -- static might not be allowed, but there are no rules to prevent
5304 elsif Nkind (N) = N_Attribute_Reference then
5307 -- The name of a discriminant evaluated within its parent type is
5308 -- defined to be preelaborable (10.2.1(8)). Note that we test for
5309 -- names that denote discriminals as well as discriminants to
5310 -- catch references occurring within init procs.
5312 elsif Is_Entity_Name (N)
5314 (Ekind (Entity (N)) = E_Discriminant
5316 ((Ekind (Entity (N)) = E_Constant
5317 or else Ekind (Entity (N)) = E_In_Parameter)
5318 and then Present (Discriminal_Link (Entity (N)))))
5322 elsif Nkind (N) = N_Qualified_Expression then
5323 return Is_Preelaborable_Expression (Expression (N));
5325 -- For aggregates we have to check that each of the associations
5326 -- is preelaborable.
5328 elsif Nkind (N) = N_Aggregate
5329 or else Nkind (N) = N_Extension_Aggregate
5331 Is_Array_Aggr := Is_Array_Type (Etype (N));
5333 if Is_Array_Aggr then
5334 Comp_Type := Component_Type (Etype (N));
5337 -- Check the ancestor part of extension aggregates, which must
5338 -- be either the name of a type that has preelaborable init or
5339 -- an expression that is preelaborable.
5341 if Nkind (N) = N_Extension_Aggregate then
5343 Anc_Part : constant Node_Id := Ancestor_Part (N);
5346 if Is_Entity_Name (Anc_Part)
5347 and then Is_Type (Entity (Anc_Part))
5349 if not Has_Preelaborable_Initialization
5355 elsif not Is_Preelaborable_Expression (Anc_Part) then
5361 -- Check positional associations
5363 Exp := First (Expressions (N));
5364 while Present (Exp) loop
5365 if not Is_Preelaborable_Expression (Exp) then
5372 -- Check named associations
5374 Assn := First (Component_Associations (N));
5375 while Present (Assn) loop
5376 Choice := First (Choices (Assn));
5377 while Present (Choice) loop
5378 if Is_Array_Aggr then
5379 if Nkind (Choice) = N_Others_Choice then
5382 elsif Nkind (Choice) = N_Range then
5383 if not Is_Static_Range (Choice) then
5387 elsif not Is_Static_Expression (Choice) then
5392 Comp_Type := Etype (Choice);
5398 -- If the association has a <> at this point, then we have
5399 -- to check whether the component's type has preelaborable
5400 -- initialization. Note that this only occurs when the
5401 -- association's corresponding component does not have a
5402 -- default expression, the latter case having already been
5403 -- expanded as an expression for the association.
5405 if Box_Present (Assn) then
5406 if not Has_Preelaborable_Initialization (Comp_Type) then
5410 -- In the expression case we check whether the expression
5411 -- is preelaborable.
5414 not Is_Preelaborable_Expression (Expression (Assn))
5422 -- If we get here then aggregate as a whole is preelaborable
5426 -- All other cases are not preelaborable
5431 end Is_Preelaborable_Expression;
5433 -- Start of processing for Check_Components
5436 -- Loop through entities of record or protected type
5439 while Present (Ent) loop
5441 -- We are interested only in components and discriminants
5448 -- Get default expression if any. If there is no declaration
5449 -- node, it means we have an internal entity. The parent and
5450 -- tag fields are examples of such entities. For such cases,
5451 -- we just test the type of the entity.
5453 if Present (Declaration_Node (Ent)) then
5454 Exp := Expression (Declaration_Node (Ent));
5457 when E_Discriminant =>
5459 -- Note: for a renamed discriminant, the Declaration_Node
5460 -- may point to the one from the ancestor, and have a
5461 -- different expression, so use the proper attribute to
5462 -- retrieve the expression from the derived constraint.
5464 Exp := Discriminant_Default_Value (Ent);
5467 goto Check_Next_Entity;
5470 -- A component has PI if it has no default expression and the
5471 -- component type has PI.
5474 if not Has_Preelaborable_Initialization (Etype (Ent)) then
5479 -- Require the default expression to be preelaborable
5481 elsif not Is_Preelaborable_Expression (Exp) then
5486 <<Check_Next_Entity>>
5489 end Check_Components;
5491 -- Start of processing for Has_Preelaborable_Initialization
5494 -- Immediate return if already marked as known preelaborable init. This
5495 -- covers types for which this function has already been called once
5496 -- and returned True (in which case the result is cached), and also
5497 -- types to which a pragma Preelaborable_Initialization applies.
5499 if Known_To_Have_Preelab_Init (E) then
5503 -- If the type is a subtype representing a generic actual type, then
5504 -- test whether its base type has preelaborable initialization since
5505 -- the subtype representing the actual does not inherit this attribute
5506 -- from the actual or formal. (but maybe it should???)
5508 if Is_Generic_Actual_Type (E) then
5509 return Has_Preelaborable_Initialization (Base_Type (E));
5512 -- All elementary types have preelaborable initialization
5514 if Is_Elementary_Type (E) then
5517 -- Array types have PI if the component type has PI
5519 elsif Is_Array_Type (E) then
5520 Has_PE := Has_Preelaborable_Initialization (Component_Type (E));
5522 -- A derived type has preelaborable initialization if its parent type
5523 -- has preelaborable initialization and (in the case of a derived record
5524 -- extension) if the non-inherited components all have preelaborable
5525 -- initialization. However, a user-defined controlled type with an
5526 -- overriding Initialize procedure does not have preelaborable
5529 elsif Is_Derived_Type (E) then
5531 -- If the derived type is a private extension then it doesn't have
5532 -- preelaborable initialization.
5534 if Ekind (Base_Type (E)) = E_Record_Type_With_Private then
5538 -- First check whether ancestor type has preelaborable initialization
5540 Has_PE := Has_Preelaborable_Initialization (Etype (Base_Type (E)));
5542 -- If OK, check extension components (if any)
5544 if Has_PE and then Is_Record_Type (E) then
5545 Check_Components (First_Entity (E));
5548 -- Check specifically for 10.2.1(11.4/2) exception: a controlled type
5549 -- with a user defined Initialize procedure does not have PI.
5552 and then Is_Controlled (E)
5553 and then Has_Overriding_Initialize (E)
5558 -- Private types not derived from a type having preelaborable init and
5559 -- that are not marked with pragma Preelaborable_Initialization do not
5560 -- have preelaborable initialization.
5562 elsif Is_Private_Type (E) then
5565 -- Record type has PI if it is non private and all components have PI
5567 elsif Is_Record_Type (E) then
5569 Check_Components (First_Entity (E));
5571 -- Protected types must not have entries, and components must meet
5572 -- same set of rules as for record components.
5574 elsif Is_Protected_Type (E) then
5575 if Has_Entries (E) then
5579 Check_Components (First_Entity (E));
5580 Check_Components (First_Private_Entity (E));
5583 -- Type System.Address always has preelaborable initialization
5585 elsif Is_RTE (E, RE_Address) then
5588 -- In all other cases, type does not have preelaborable initialization
5594 -- If type has preelaborable initialization, cache result
5597 Set_Known_To_Have_Preelab_Init (E);
5601 end Has_Preelaborable_Initialization;
5603 ---------------------------
5604 -- Has_Private_Component --
5605 ---------------------------
5607 function Has_Private_Component (Type_Id : Entity_Id) return Boolean is
5608 Btype : Entity_Id := Base_Type (Type_Id);
5609 Component : Entity_Id;
5612 if Error_Posted (Type_Id)
5613 or else Error_Posted (Btype)
5618 if Is_Class_Wide_Type (Btype) then
5619 Btype := Root_Type (Btype);
5622 if Is_Private_Type (Btype) then
5624 UT : constant Entity_Id := Underlying_Type (Btype);
5627 if No (Full_View (Btype)) then
5628 return not Is_Generic_Type (Btype)
5629 and then not Is_Generic_Type (Root_Type (Btype));
5631 return not Is_Generic_Type (Root_Type (Full_View (Btype)));
5634 return not Is_Frozen (UT) and then Has_Private_Component (UT);
5638 elsif Is_Array_Type (Btype) then
5639 return Has_Private_Component (Component_Type (Btype));
5641 elsif Is_Record_Type (Btype) then
5642 Component := First_Component (Btype);
5643 while Present (Component) loop
5644 if Has_Private_Component (Etype (Component)) then
5648 Next_Component (Component);
5653 elsif Is_Protected_Type (Btype)
5654 and then Present (Corresponding_Record_Type (Btype))
5656 return Has_Private_Component (Corresponding_Record_Type (Btype));
5661 end Has_Private_Component;
5663 -----------------------------
5664 -- Has_Static_Array_Bounds --
5665 -----------------------------
5667 function Has_Static_Array_Bounds (Typ : Node_Id) return Boolean is
5668 Ndims : constant Nat := Number_Dimensions (Typ);
5675 -- Unconstrained types do not have static bounds
5677 if not Is_Constrained (Typ) then
5681 -- First treat string literals specially, as the lower bound and length
5682 -- of string literals are not stored like those of arrays.
5684 -- A string literal always has static bounds
5686 if Ekind (Typ) = E_String_Literal_Subtype then
5690 -- Treat all dimensions in turn
5692 Index := First_Index (Typ);
5693 for Indx in 1 .. Ndims loop
5695 -- In case of an erroneous index which is not a discrete type, return
5696 -- that the type is not static.
5698 if not Is_Discrete_Type (Etype (Index))
5699 or else Etype (Index) = Any_Type
5704 Get_Index_Bounds (Index, Low, High);
5706 if Error_Posted (Low) or else Error_Posted (High) then
5710 if Is_OK_Static_Expression (Low)
5712 Is_OK_Static_Expression (High)
5722 -- If we fall through the loop, all indexes matched
5725 end Has_Static_Array_Bounds;
5731 function Has_Stream (T : Entity_Id) return Boolean is
5738 elsif Is_RTE (Root_Type (T), RE_Root_Stream_Type) then
5741 elsif Is_Array_Type (T) then
5742 return Has_Stream (Component_Type (T));
5744 elsif Is_Record_Type (T) then
5745 E := First_Component (T);
5746 while Present (E) loop
5747 if Has_Stream (Etype (E)) then
5756 elsif Is_Private_Type (T) then
5757 return Has_Stream (Underlying_Type (T));
5768 function Has_Suffix (E : Entity_Id; Suffix : Character) return Boolean is
5770 Get_Name_String (Chars (E));
5771 return Name_Buffer (Name_Len) = Suffix;
5774 --------------------------
5775 -- Has_Tagged_Component --
5776 --------------------------
5778 function Has_Tagged_Component (Typ : Entity_Id) return Boolean is
5782 if Is_Private_Type (Typ)
5783 and then Present (Underlying_Type (Typ))
5785 return Has_Tagged_Component (Underlying_Type (Typ));
5787 elsif Is_Array_Type (Typ) then
5788 return Has_Tagged_Component (Component_Type (Typ));
5790 elsif Is_Tagged_Type (Typ) then
5793 elsif Is_Record_Type (Typ) then
5794 Comp := First_Component (Typ);
5795 while Present (Comp) loop
5796 if Has_Tagged_Component (Etype (Comp)) then
5800 Next_Component (Comp);
5808 end Has_Tagged_Component;
5810 -------------------------
5811 -- Implementation_Kind --
5812 -------------------------
5814 function Implementation_Kind (Subp : Entity_Id) return Name_Id is
5815 Impl_Prag : constant Node_Id := Get_Rep_Pragma (Subp, Name_Implemented);
5817 pragma Assert (Present (Impl_Prag));
5819 Chars (Expression (Last (Pragma_Argument_Associations (Impl_Prag))));
5820 end Implementation_Kind;
5822 --------------------------
5823 -- Implements_Interface --
5824 --------------------------
5826 function Implements_Interface
5827 (Typ_Ent : Entity_Id;
5828 Iface_Ent : Entity_Id;
5829 Exclude_Parents : Boolean := False) return Boolean
5831 Ifaces_List : Elist_Id;
5833 Iface : Entity_Id := Base_Type (Iface_Ent);
5834 Typ : Entity_Id := Base_Type (Typ_Ent);
5837 if Is_Class_Wide_Type (Typ) then
5838 Typ := Root_Type (Typ);
5841 if not Has_Interfaces (Typ) then
5845 if Is_Class_Wide_Type (Iface) then
5846 Iface := Root_Type (Iface);
5849 Collect_Interfaces (Typ, Ifaces_List);
5851 Elmt := First_Elmt (Ifaces_List);
5852 while Present (Elmt) loop
5853 if Is_Ancestor (Node (Elmt), Typ, Use_Full_View => True)
5854 and then Exclude_Parents
5858 elsif Node (Elmt) = Iface then
5866 end Implements_Interface;
5872 function In_Instance return Boolean is
5873 Curr_Unit : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
5879 and then S /= Standard_Standard
5881 if (Ekind (S) = E_Function
5882 or else Ekind (S) = E_Package
5883 or else Ekind (S) = E_Procedure)
5884 and then Is_Generic_Instance (S)
5886 -- A child instance is always compiled in the context of a parent
5887 -- instance. Nevertheless, the actuals are not analyzed in an
5888 -- instance context. We detect this case by examining the current
5889 -- compilation unit, which must be a child instance, and checking
5890 -- that it is not currently on the scope stack.
5892 if Is_Child_Unit (Curr_Unit)
5894 Nkind (Unit (Cunit (Current_Sem_Unit)))
5895 = N_Package_Instantiation
5896 and then not In_Open_Scopes (Curr_Unit)
5910 ----------------------
5911 -- In_Instance_Body --
5912 ----------------------
5914 function In_Instance_Body return Boolean is
5920 and then S /= Standard_Standard
5922 if (Ekind (S) = E_Function
5923 or else Ekind (S) = E_Procedure)
5924 and then Is_Generic_Instance (S)
5928 elsif Ekind (S) = E_Package
5929 and then In_Package_Body (S)
5930 and then Is_Generic_Instance (S)
5939 end In_Instance_Body;
5941 -----------------------------
5942 -- In_Instance_Not_Visible --
5943 -----------------------------
5945 function In_Instance_Not_Visible return Boolean is
5951 and then S /= Standard_Standard
5953 if (Ekind (S) = E_Function
5954 or else Ekind (S) = E_Procedure)
5955 and then Is_Generic_Instance (S)
5959 elsif Ekind (S) = E_Package
5960 and then (In_Package_Body (S) or else In_Private_Part (S))
5961 and then Is_Generic_Instance (S)
5970 end In_Instance_Not_Visible;
5972 ------------------------------
5973 -- In_Instance_Visible_Part --
5974 ------------------------------
5976 function In_Instance_Visible_Part return Boolean is
5982 and then S /= Standard_Standard
5984 if Ekind (S) = E_Package
5985 and then Is_Generic_Instance (S)
5986 and then not In_Package_Body (S)
5987 and then not In_Private_Part (S)
5996 end In_Instance_Visible_Part;
5998 ---------------------
5999 -- In_Package_Body --
6000 ---------------------
6002 function In_Package_Body return Boolean is
6008 and then S /= Standard_Standard
6010 if Ekind (S) = E_Package
6011 and then In_Package_Body (S)
6020 end In_Package_Body;
6022 --------------------------------
6023 -- In_Parameter_Specification --
6024 --------------------------------
6026 function In_Parameter_Specification (N : Node_Id) return Boolean is
6031 while Present (PN) loop
6032 if Nkind (PN) = N_Parameter_Specification then
6040 end In_Parameter_Specification;
6042 --------------------------------------
6043 -- In_Subprogram_Or_Concurrent_Unit --
6044 --------------------------------------
6046 function In_Subprogram_Or_Concurrent_Unit return Boolean is
6051 -- Use scope chain to check successively outer scopes
6057 if K in Subprogram_Kind
6058 or else K in Concurrent_Kind
6059 or else K in Generic_Subprogram_Kind
6063 elsif E = Standard_Standard then
6069 end In_Subprogram_Or_Concurrent_Unit;
6071 ---------------------
6072 -- In_Visible_Part --
6073 ---------------------
6075 function In_Visible_Part (Scope_Id : Entity_Id) return Boolean is
6078 Is_Package_Or_Generic_Package (Scope_Id)
6079 and then In_Open_Scopes (Scope_Id)
6080 and then not In_Package_Body (Scope_Id)
6081 and then not In_Private_Part (Scope_Id);
6082 end In_Visible_Part;
6084 --------------------------------
6085 -- Incomplete_Or_Private_View --
6086 --------------------------------
6088 function Incomplete_Or_Private_View (Typ : Entity_Id) return Entity_Id is
6089 function Inspect_Decls
6091 Taft : Boolean := False) return Entity_Id;
6092 -- Check whether a declarative region contains the incomplete or private
6099 function Inspect_Decls
6101 Taft : Boolean := False) return Entity_Id
6107 Decl := First (Decls);
6108 while Present (Decl) loop
6112 if Nkind (Decl) = N_Incomplete_Type_Declaration then
6113 Match := Defining_Identifier (Decl);
6117 if Nkind_In (Decl, N_Private_Extension_Declaration,
6118 N_Private_Type_Declaration)
6120 Match := Defining_Identifier (Decl);
6125 and then Present (Full_View (Match))
6126 and then Full_View (Match) = Typ
6141 -- Start of processing for Incomplete_Or_Partial_View
6144 -- Incomplete type case
6146 Prev := Current_Entity_In_Scope (Typ);
6149 and then Is_Incomplete_Type (Prev)
6150 and then Present (Full_View (Prev))
6151 and then Full_View (Prev) = Typ
6156 -- Private or Taft amendment type case
6159 Pkg : constant Entity_Id := Scope (Typ);
6160 Pkg_Decl : Node_Id := Pkg;
6163 if Ekind (Pkg) = E_Package then
6164 while Nkind (Pkg_Decl) /= N_Package_Specification loop
6165 Pkg_Decl := Parent (Pkg_Decl);
6168 -- It is knows that Typ has a private view, look for it in the
6169 -- visible declarations of the enclosing scope. A special case
6170 -- of this is when the two views have been exchanged - the full
6171 -- appears earlier than the private.
6173 if Has_Private_Declaration (Typ) then
6174 Prev := Inspect_Decls (Visible_Declarations (Pkg_Decl));
6176 -- Exchanged view case, look in the private declarations
6179 Prev := Inspect_Decls (Private_Declarations (Pkg_Decl));
6184 -- Otherwise if this is the package body, then Typ is a potential
6185 -- Taft amendment type. The incomplete view should be located in
6186 -- the private declarations of the enclosing scope.
6188 elsif In_Package_Body (Pkg) then
6189 return Inspect_Decls (Private_Declarations (Pkg_Decl), True);
6194 -- The type has no incomplete or private view
6197 end Incomplete_Or_Private_View;
6199 ---------------------------------
6200 -- Insert_Explicit_Dereference --
6201 ---------------------------------
6203 procedure Insert_Explicit_Dereference (N : Node_Id) is
6204 New_Prefix : constant Node_Id := Relocate_Node (N);
6205 Ent : Entity_Id := Empty;
6212 Save_Interps (N, New_Prefix);
6215 Make_Explicit_Dereference (Sloc (Parent (N)),
6216 Prefix => New_Prefix));
6218 Set_Etype (N, Designated_Type (Etype (New_Prefix)));
6220 if Is_Overloaded (New_Prefix) then
6222 -- The dereference is also overloaded, and its interpretations are
6223 -- the designated types of the interpretations of the original node.
6225 Set_Etype (N, Any_Type);
6227 Get_First_Interp (New_Prefix, I, It);
6228 while Present (It.Nam) loop
6231 if Is_Access_Type (T) then
6232 Add_One_Interp (N, Designated_Type (T), Designated_Type (T));
6235 Get_Next_Interp (I, It);
6241 -- Prefix is unambiguous: mark the original prefix (which might
6242 -- Come_From_Source) as a reference, since the new (relocated) one
6243 -- won't be taken into account.
6245 if Is_Entity_Name (New_Prefix) then
6246 Ent := Entity (New_Prefix);
6249 -- For a retrieval of a subcomponent of some composite object,
6250 -- retrieve the ultimate entity if there is one.
6252 elsif Nkind (New_Prefix) = N_Selected_Component
6253 or else Nkind (New_Prefix) = N_Indexed_Component
6255 Pref := Prefix (New_Prefix);
6256 while Present (Pref)
6258 (Nkind (Pref) = N_Selected_Component
6259 or else Nkind (Pref) = N_Indexed_Component)
6261 Pref := Prefix (Pref);
6264 if Present (Pref) and then Is_Entity_Name (Pref) then
6265 Ent := Entity (Pref);
6269 -- Place the reference on the entity node
6271 if Present (Ent) then
6272 Generate_Reference (Ent, Pref);
6275 end Insert_Explicit_Dereference;
6277 ------------------------------------------
6278 -- Inspect_Deferred_Constant_Completion --
6279 ------------------------------------------
6281 procedure Inspect_Deferred_Constant_Completion (Decls : List_Id) is
6285 Decl := First (Decls);
6286 while Present (Decl) loop
6288 -- Deferred constant signature
6290 if Nkind (Decl) = N_Object_Declaration
6291 and then Constant_Present (Decl)
6292 and then No (Expression (Decl))
6294 -- No need to check internally generated constants
6296 and then Comes_From_Source (Decl)
6298 -- The constant is not completed. A full object declaration or a
6299 -- pragma Import complete a deferred constant.
6301 and then not Has_Completion (Defining_Identifier (Decl))
6304 ("constant declaration requires initialization expression",
6305 Defining_Identifier (Decl));
6308 Decl := Next (Decl);
6310 end Inspect_Deferred_Constant_Completion;
6312 -----------------------------
6313 -- Is_Actual_Out_Parameter --
6314 -----------------------------
6316 function Is_Actual_Out_Parameter (N : Node_Id) return Boolean is
6320 Find_Actual (N, Formal, Call);
6321 return Present (Formal) and then Ekind (Formal) = E_Out_Parameter;
6322 end Is_Actual_Out_Parameter;
6324 -------------------------
6325 -- Is_Actual_Parameter --
6326 -------------------------
6328 function Is_Actual_Parameter (N : Node_Id) return Boolean is
6329 PK : constant Node_Kind := Nkind (Parent (N));
6333 when N_Parameter_Association =>
6334 return N = Explicit_Actual_Parameter (Parent (N));
6336 when N_Function_Call | N_Procedure_Call_Statement =>
6337 return Is_List_Member (N)
6339 List_Containing (N) = Parameter_Associations (Parent (N));
6344 end Is_Actual_Parameter;
6346 --------------------------------
6347 -- Is_Actual_Tagged_Parameter --
6348 --------------------------------
6350 function Is_Actual_Tagged_Parameter (N : Node_Id) return Boolean is
6354 Find_Actual (N, Formal, Call);
6355 return Present (Formal) and then Is_Tagged_Type (Etype (Formal));
6356 end Is_Actual_Tagged_Parameter;
6358 ---------------------
6359 -- Is_Aliased_View --
6360 ---------------------
6362 function Is_Aliased_View (Obj : Node_Id) return Boolean is
6366 if Is_Entity_Name (Obj) then
6374 or else (Present (Renamed_Object (E))
6375 and then Is_Aliased_View (Renamed_Object (E)))))
6377 or else ((Is_Formal (E)
6378 or else Ekind (E) = E_Generic_In_Out_Parameter
6379 or else Ekind (E) = E_Generic_In_Parameter)
6380 and then Is_Tagged_Type (Etype (E)))
6382 or else (Is_Concurrent_Type (E)
6383 and then In_Open_Scopes (E))
6385 -- Current instance of type, either directly or as rewritten
6386 -- reference to the current object.
6388 or else (Is_Entity_Name (Original_Node (Obj))
6389 and then Present (Entity (Original_Node (Obj)))
6390 and then Is_Type (Entity (Original_Node (Obj))))
6392 or else (Is_Type (E) and then E = Current_Scope)
6394 or else (Is_Incomplete_Or_Private_Type (E)
6395 and then Full_View (E) = Current_Scope);
6397 elsif Nkind (Obj) = N_Selected_Component then
6398 return Is_Aliased (Entity (Selector_Name (Obj)));
6400 elsif Nkind (Obj) = N_Indexed_Component then
6401 return Has_Aliased_Components (Etype (Prefix (Obj)))
6403 (Is_Access_Type (Etype (Prefix (Obj)))
6405 Has_Aliased_Components
6406 (Designated_Type (Etype (Prefix (Obj)))));
6408 elsif Nkind (Obj) = N_Unchecked_Type_Conversion
6409 or else Nkind (Obj) = N_Type_Conversion
6411 return Is_Tagged_Type (Etype (Obj))
6412 and then Is_Aliased_View (Expression (Obj));
6414 elsif Nkind (Obj) = N_Explicit_Dereference then
6415 return Nkind (Original_Node (Obj)) /= N_Function_Call;
6420 end Is_Aliased_View;
6422 -------------------------
6423 -- Is_Ancestor_Package --
6424 -------------------------
6426 function Is_Ancestor_Package
6428 E2 : Entity_Id) return Boolean
6435 and then Par /= Standard_Standard
6445 end Is_Ancestor_Package;
6447 ----------------------
6448 -- Is_Atomic_Object --
6449 ----------------------
6451 function Is_Atomic_Object (N : Node_Id) return Boolean is
6453 function Object_Has_Atomic_Components (N : Node_Id) return Boolean;
6454 -- Determines if given object has atomic components
6456 function Is_Atomic_Prefix (N : Node_Id) return Boolean;
6457 -- If prefix is an implicit dereference, examine designated type
6459 ----------------------
6460 -- Is_Atomic_Prefix --
6461 ----------------------
6463 function Is_Atomic_Prefix (N : Node_Id) return Boolean is
6465 if Is_Access_Type (Etype (N)) then
6467 Has_Atomic_Components (Designated_Type (Etype (N)));
6469 return Object_Has_Atomic_Components (N);
6471 end Is_Atomic_Prefix;
6473 ----------------------------------
6474 -- Object_Has_Atomic_Components --
6475 ----------------------------------
6477 function Object_Has_Atomic_Components (N : Node_Id) return Boolean is
6479 if Has_Atomic_Components (Etype (N))
6480 or else Is_Atomic (Etype (N))
6484 elsif Is_Entity_Name (N)
6485 and then (Has_Atomic_Components (Entity (N))
6486 or else Is_Atomic (Entity (N)))
6490 elsif Nkind (N) = N_Indexed_Component
6491 or else Nkind (N) = N_Selected_Component
6493 return Is_Atomic_Prefix (Prefix (N));
6498 end Object_Has_Atomic_Components;
6500 -- Start of processing for Is_Atomic_Object
6503 -- Predicate is not relevant to subprograms
6505 if Is_Entity_Name (N) and then Is_Overloadable (Entity (N)) then
6508 elsif Is_Atomic (Etype (N))
6509 or else (Is_Entity_Name (N) and then Is_Atomic (Entity (N)))
6513 elsif Nkind (N) = N_Indexed_Component
6514 or else Nkind (N) = N_Selected_Component
6516 return Is_Atomic_Prefix (Prefix (N));
6521 end Is_Atomic_Object;
6523 -----------------------------
6524 -- Is_Concurrent_Interface --
6525 -----------------------------
6527 function Is_Concurrent_Interface (T : Entity_Id) return Boolean is
6532 (Is_Protected_Interface (T)
6533 or else Is_Synchronized_Interface (T)
6534 or else Is_Task_Interface (T));
6535 end Is_Concurrent_Interface;
6537 --------------------------------------
6538 -- Is_Controlling_Limited_Procedure --
6539 --------------------------------------
6541 function Is_Controlling_Limited_Procedure
6542 (Proc_Nam : Entity_Id) return Boolean
6544 Param_Typ : Entity_Id := Empty;
6547 if Ekind (Proc_Nam) = E_Procedure
6548 and then Present (Parameter_Specifications (Parent (Proc_Nam)))
6550 Param_Typ := Etype (Parameter_Type (First (
6551 Parameter_Specifications (Parent (Proc_Nam)))));
6553 -- In this case where an Itype was created, the procedure call has been
6556 elsif Present (Associated_Node_For_Itype (Proc_Nam))
6557 and then Present (Original_Node (Associated_Node_For_Itype (Proc_Nam)))
6559 Present (Parameter_Associations
6560 (Associated_Node_For_Itype (Proc_Nam)))
6563 Etype (First (Parameter_Associations
6564 (Associated_Node_For_Itype (Proc_Nam))));
6567 if Present (Param_Typ) then
6569 Is_Interface (Param_Typ)
6570 and then Is_Limited_Record (Param_Typ);
6574 end Is_Controlling_Limited_Procedure;
6576 -----------------------------
6577 -- Is_CPP_Constructor_Call --
6578 -----------------------------
6580 function Is_CPP_Constructor_Call (N : Node_Id) return Boolean is
6582 return Nkind (N) = N_Function_Call
6583 and then Is_CPP_Class (Etype (Etype (N)))
6584 and then Is_Constructor (Entity (Name (N)))
6585 and then Is_Imported (Entity (Name (N)));
6586 end Is_CPP_Constructor_Call;
6592 function Is_Delegate (T : Entity_Id) return Boolean is
6593 Desig_Type : Entity_Id;
6596 if VM_Target /= CLI_Target then
6600 -- Access-to-subprograms are delegates in CIL
6602 if Ekind (T) = E_Access_Subprogram_Type then
6606 if Ekind (T) not in Access_Kind then
6608 -- A delegate is a managed pointer. If no designated type is defined
6609 -- it means that it's not a delegate.
6614 Desig_Type := Etype (Directly_Designated_Type (T));
6616 if not Is_Tagged_Type (Desig_Type) then
6620 -- Test if the type is inherited from [mscorlib]System.Delegate
6622 while Etype (Desig_Type) /= Desig_Type loop
6623 if Chars (Scope (Desig_Type)) /= No_Name
6624 and then Is_Imported (Scope (Desig_Type))
6625 and then Get_Name_String (Chars (Scope (Desig_Type))) = "delegate"
6630 Desig_Type := Etype (Desig_Type);
6636 ----------------------------------------------
6637 -- Is_Dependent_Component_Of_Mutable_Object --
6638 ----------------------------------------------
6640 function Is_Dependent_Component_Of_Mutable_Object
6641 (Object : Node_Id) return Boolean
6644 Prefix_Type : Entity_Id;
6645 P_Aliased : Boolean := False;
6648 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean;
6649 -- Returns True if and only if Comp is declared within a variant part
6651 --------------------------------
6652 -- Is_Declared_Within_Variant --
6653 --------------------------------
6655 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean is
6656 Comp_Decl : constant Node_Id := Parent (Comp);
6657 Comp_List : constant Node_Id := Parent (Comp_Decl);
6659 return Nkind (Parent (Comp_List)) = N_Variant;
6660 end Is_Declared_Within_Variant;
6662 -- Start of processing for Is_Dependent_Component_Of_Mutable_Object
6665 if Is_Variable (Object) then
6667 if Nkind (Object) = N_Selected_Component then
6668 P := Prefix (Object);
6669 Prefix_Type := Etype (P);
6671 if Is_Entity_Name (P) then
6673 if Ekind (Entity (P)) = E_Generic_In_Out_Parameter then
6674 Prefix_Type := Base_Type (Prefix_Type);
6677 if Is_Aliased (Entity (P)) then
6681 -- A discriminant check on a selected component may be expanded
6682 -- into a dereference when removing side-effects. Recover the
6683 -- original node and its type, which may be unconstrained.
6685 elsif Nkind (P) = N_Explicit_Dereference
6686 and then not (Comes_From_Source (P))
6688 P := Original_Node (P);
6689 Prefix_Type := Etype (P);
6692 -- Check for prefix being an aliased component???
6698 -- A heap object is constrained by its initial value
6700 -- Ada 2005 (AI-363): Always assume the object could be mutable in
6701 -- the dereferenced case, since the access value might denote an
6702 -- unconstrained aliased object, whereas in Ada 95 the designated
6703 -- object is guaranteed to be constrained. A worst-case assumption
6704 -- has to apply in Ada 2005 because we can't tell at compile time
6705 -- whether the object is "constrained by its initial value"
6706 -- (despite the fact that 3.10.2(26/2) and 8.5.1(5/2) are
6707 -- semantic rules -- these rules are acknowledged to need fixing).
6709 if Ada_Version < Ada_2005 then
6710 if Is_Access_Type (Prefix_Type)
6711 or else Nkind (P) = N_Explicit_Dereference
6716 elsif Ada_Version >= Ada_2005 then
6717 if Is_Access_Type (Prefix_Type) then
6719 -- If the access type is pool-specific, and there is no
6720 -- constrained partial view of the designated type, then the
6721 -- designated object is known to be constrained.
6723 if Ekind (Prefix_Type) = E_Access_Type
6724 and then not Has_Constrained_Partial_View
6725 (Designated_Type (Prefix_Type))
6729 -- Otherwise (general access type, or there is a constrained
6730 -- partial view of the designated type), we need to check
6731 -- based on the designated type.
6734 Prefix_Type := Designated_Type (Prefix_Type);
6740 Original_Record_Component (Entity (Selector_Name (Object)));
6742 -- As per AI-0017, the renaming is illegal in a generic body, even
6743 -- if the subtype is indefinite.
6745 -- Ada 2005 (AI-363): In Ada 2005 an aliased object can be mutable
6747 if not Is_Constrained (Prefix_Type)
6748 and then (not Is_Indefinite_Subtype (Prefix_Type)
6750 (Is_Generic_Type (Prefix_Type)
6751 and then Ekind (Current_Scope) = E_Generic_Package
6752 and then In_Package_Body (Current_Scope)))
6754 and then (Is_Declared_Within_Variant (Comp)
6755 or else Has_Discriminant_Dependent_Constraint (Comp))
6756 and then (not P_Aliased or else Ada_Version >= Ada_2005)
6762 Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
6766 elsif Nkind (Object) = N_Indexed_Component
6767 or else Nkind (Object) = N_Slice
6769 return Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
6771 -- A type conversion that Is_Variable is a view conversion:
6772 -- go back to the denoted object.
6774 elsif Nkind (Object) = N_Type_Conversion then
6776 Is_Dependent_Component_Of_Mutable_Object (Expression (Object));
6781 end Is_Dependent_Component_Of_Mutable_Object;
6783 ---------------------
6784 -- Is_Dereferenced --
6785 ---------------------
6787 function Is_Dereferenced (N : Node_Id) return Boolean is
6788 P : constant Node_Id := Parent (N);
6791 (Nkind (P) = N_Selected_Component
6793 Nkind (P) = N_Explicit_Dereference
6795 Nkind (P) = N_Indexed_Component
6797 Nkind (P) = N_Slice)
6798 and then Prefix (P) = N;
6799 end Is_Dereferenced;
6801 ----------------------
6802 -- Is_Descendent_Of --
6803 ----------------------
6805 function Is_Descendent_Of (T1 : Entity_Id; T2 : Entity_Id) return Boolean is
6810 pragma Assert (Nkind (T1) in N_Entity);
6811 pragma Assert (Nkind (T2) in N_Entity);
6813 T := Base_Type (T1);
6815 -- Immediate return if the types match
6820 -- Comment needed here ???
6822 elsif Ekind (T) = E_Class_Wide_Type then
6823 return Etype (T) = T2;
6831 -- Done if we found the type we are looking for
6836 -- Done if no more derivations to check
6843 -- Following test catches error cases resulting from prev errors
6845 elsif No (Etyp) then
6848 elsif Is_Private_Type (T) and then Etyp = Full_View (T) then
6851 elsif Is_Private_Type (Etyp) and then Full_View (Etyp) = T then
6855 T := Base_Type (Etyp);
6858 end Is_Descendent_Of;
6860 ----------------------------
6861 -- Is_Expression_Function --
6862 ----------------------------
6864 function Is_Expression_Function (Subp : Entity_Id) return Boolean is
6865 Decl : constant Node_Id := Unit_Declaration_Node (Subp);
6868 return Ekind (Subp) = E_Function
6869 and then Nkind (Decl) = N_Subprogram_Declaration
6871 (Nkind (Original_Node (Decl)) = N_Expression_Function
6873 (Present (Corresponding_Body (Decl))
6875 Nkind (Original_Node
6876 (Unit_Declaration_Node (Corresponding_Body (Decl))))
6877 = N_Expression_Function));
6878 end Is_Expression_Function;
6884 function Is_False (U : Uint) return Boolean is
6889 ---------------------------
6890 -- Is_Fixed_Model_Number --
6891 ---------------------------
6893 function Is_Fixed_Model_Number (U : Ureal; T : Entity_Id) return Boolean is
6894 S : constant Ureal := Small_Value (T);
6895 M : Urealp.Save_Mark;
6899 R := (U = UR_Trunc (U / S) * S);
6902 end Is_Fixed_Model_Number;
6904 -------------------------------
6905 -- Is_Fully_Initialized_Type --
6906 -------------------------------
6908 function Is_Fully_Initialized_Type (Typ : Entity_Id) return Boolean is
6910 if Is_Scalar_Type (Typ) then
6913 elsif Is_Access_Type (Typ) then
6916 elsif Is_Array_Type (Typ) then
6917 if Is_Fully_Initialized_Type (Component_Type (Typ)) then
6921 -- An interesting case, if we have a constrained type one of whose
6922 -- bounds is known to be null, then there are no elements to be
6923 -- initialized, so all the elements are initialized!
6925 if Is_Constrained (Typ) then
6928 Indx_Typ : Entity_Id;
6932 Indx := First_Index (Typ);
6933 while Present (Indx) loop
6934 if Etype (Indx) = Any_Type then
6937 -- If index is a range, use directly
6939 elsif Nkind (Indx) = N_Range then
6940 Lbd := Low_Bound (Indx);
6941 Hbd := High_Bound (Indx);
6944 Indx_Typ := Etype (Indx);
6946 if Is_Private_Type (Indx_Typ) then
6947 Indx_Typ := Full_View (Indx_Typ);
6950 if No (Indx_Typ) or else Etype (Indx_Typ) = Any_Type then
6953 Lbd := Type_Low_Bound (Indx_Typ);
6954 Hbd := Type_High_Bound (Indx_Typ);
6958 if Compile_Time_Known_Value (Lbd)
6959 and then Compile_Time_Known_Value (Hbd)
6961 if Expr_Value (Hbd) < Expr_Value (Lbd) then
6971 -- If no null indexes, then type is not fully initialized
6977 elsif Is_Record_Type (Typ) then
6978 if Has_Discriminants (Typ)
6980 Present (Discriminant_Default_Value (First_Discriminant (Typ)))
6981 and then Is_Fully_Initialized_Variant (Typ)
6986 -- Controlled records are considered to be fully initialized if
6987 -- there is a user defined Initialize routine. This may not be
6988 -- entirely correct, but as the spec notes, we are guessing here
6989 -- what is best from the point of view of issuing warnings.
6991 if Is_Controlled (Typ) then
6993 Utyp : constant Entity_Id := Underlying_Type (Typ);
6996 if Present (Utyp) then
6998 Init : constant Entity_Id :=
7000 (Underlying_Type (Typ), Name_Initialize));
7004 and then Comes_From_Source (Init)
7006 Is_Predefined_File_Name
7007 (File_Name (Get_Source_File_Index (Sloc (Init))))
7011 elsif Has_Null_Extension (Typ)
7013 Is_Fully_Initialized_Type
7014 (Etype (Base_Type (Typ)))
7023 -- Otherwise see if all record components are initialized
7029 Ent := First_Entity (Typ);
7030 while Present (Ent) loop
7031 if Ekind (Ent) = E_Component
7032 and then (No (Parent (Ent))
7033 or else No (Expression (Parent (Ent))))
7034 and then not Is_Fully_Initialized_Type (Etype (Ent))
7036 -- Special VM case for tag components, which need to be
7037 -- defined in this case, but are never initialized as VMs
7038 -- are using other dispatching mechanisms. Ignore this
7039 -- uninitialized case. Note that this applies both to the
7040 -- uTag entry and the main vtable pointer (CPP_Class case).
7042 and then (Tagged_Type_Expansion or else not Is_Tag (Ent))
7051 -- No uninitialized components, so type is fully initialized.
7052 -- Note that this catches the case of no components as well.
7056 elsif Is_Concurrent_Type (Typ) then
7059 elsif Is_Private_Type (Typ) then
7061 U : constant Entity_Id := Underlying_Type (Typ);
7067 return Is_Fully_Initialized_Type (U);
7074 end Is_Fully_Initialized_Type;
7076 ----------------------------------
7077 -- Is_Fully_Initialized_Variant --
7078 ----------------------------------
7080 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean is
7081 Loc : constant Source_Ptr := Sloc (Typ);
7082 Constraints : constant List_Id := New_List;
7083 Components : constant Elist_Id := New_Elmt_List;
7084 Comp_Elmt : Elmt_Id;
7086 Comp_List : Node_Id;
7088 Discr_Val : Node_Id;
7090 Report_Errors : Boolean;
7091 pragma Warnings (Off, Report_Errors);
7094 if Serious_Errors_Detected > 0 then
7098 if Is_Record_Type (Typ)
7099 and then Nkind (Parent (Typ)) = N_Full_Type_Declaration
7100 and then Nkind (Type_Definition (Parent (Typ))) = N_Record_Definition
7102 Comp_List := Component_List (Type_Definition (Parent (Typ)));
7104 Discr := First_Discriminant (Typ);
7105 while Present (Discr) loop
7106 if Nkind (Parent (Discr)) = N_Discriminant_Specification then
7107 Discr_Val := Expression (Parent (Discr));
7109 if Present (Discr_Val)
7110 and then Is_OK_Static_Expression (Discr_Val)
7112 Append_To (Constraints,
7113 Make_Component_Association (Loc,
7114 Choices => New_List (New_Occurrence_Of (Discr, Loc)),
7115 Expression => New_Copy (Discr_Val)));
7123 Next_Discriminant (Discr);
7128 Comp_List => Comp_List,
7129 Governed_By => Constraints,
7131 Report_Errors => Report_Errors);
7133 -- Check that each component present is fully initialized
7135 Comp_Elmt := First_Elmt (Components);
7136 while Present (Comp_Elmt) loop
7137 Comp_Id := Node (Comp_Elmt);
7139 if Ekind (Comp_Id) = E_Component
7140 and then (No (Parent (Comp_Id))
7141 or else No (Expression (Parent (Comp_Id))))
7142 and then not Is_Fully_Initialized_Type (Etype (Comp_Id))
7147 Next_Elmt (Comp_Elmt);
7152 elsif Is_Private_Type (Typ) then
7154 U : constant Entity_Id := Underlying_Type (Typ);
7160 return Is_Fully_Initialized_Variant (U);
7166 end Is_Fully_Initialized_Variant;
7172 function Is_Iterator (Typ : Entity_Id) return Boolean is
7173 Ifaces_List : Elist_Id;
7174 Iface_Elmt : Elmt_Id;
7178 if Is_Class_Wide_Type (Typ)
7180 (Chars (Etype (Typ)) = Name_Forward_Iterator
7182 Chars (Etype (Typ)) = Name_Reversible_Iterator)
7184 Is_Predefined_File_Name
7185 (Unit_File_Name (Get_Source_Unit (Etype (Typ))))
7189 elsif not Is_Tagged_Type (Typ) or else not Is_Derived_Type (Typ) then
7193 Collect_Interfaces (Typ, Ifaces_List);
7195 Iface_Elmt := First_Elmt (Ifaces_List);
7196 while Present (Iface_Elmt) loop
7197 Iface := Node (Iface_Elmt);
7198 if Chars (Iface) = Name_Forward_Iterator
7200 Is_Predefined_File_Name
7201 (Unit_File_Name (Get_Source_Unit (Iface)))
7206 Next_Elmt (Iface_Elmt);
7217 -- We seem to have a lot of overlapping functions that do similar things
7218 -- (testing for left hand sides or lvalues???). Anyway, since this one is
7219 -- purely syntactic, it should be in Sem_Aux I would think???
7221 function Is_LHS (N : Node_Id) return Boolean is
7222 P : constant Node_Id := Parent (N);
7225 if Nkind (P) = N_Assignment_Statement then
7226 return Name (P) = N;
7229 Nkind_In (P, N_Indexed_Component, N_Selected_Component, N_Slice)
7231 return N = Prefix (P) and then Is_LHS (P);
7238 ----------------------------
7239 -- Is_Inherited_Operation --
7240 ----------------------------
7242 function Is_Inherited_Operation (E : Entity_Id) return Boolean is
7243 Kind : constant Node_Kind := Nkind (Parent (E));
7245 pragma Assert (Is_Overloadable (E));
7246 return Kind = N_Full_Type_Declaration
7247 or else Kind = N_Private_Extension_Declaration
7248 or else Kind = N_Subtype_Declaration
7249 or else (Ekind (E) = E_Enumeration_Literal
7250 and then Is_Derived_Type (Etype (E)));
7251 end Is_Inherited_Operation;
7253 -------------------------------------
7254 -- Is_Inherited_Operation_For_Type --
7255 -------------------------------------
7257 function Is_Inherited_Operation_For_Type
7258 (E : Entity_Id; Typ : Entity_Id) return Boolean
7261 return Is_Inherited_Operation (E)
7262 and then Etype (Parent (E)) = Typ;
7263 end Is_Inherited_Operation_For_Type;
7265 -----------------------------
7266 -- Is_Library_Level_Entity --
7267 -----------------------------
7269 function Is_Library_Level_Entity (E : Entity_Id) return Boolean is
7271 -- The following is a small optimization, and it also properly handles
7272 -- discriminals, which in task bodies might appear in expressions before
7273 -- the corresponding procedure has been created, and which therefore do
7274 -- not have an assigned scope.
7276 if Is_Formal (E) then
7280 -- Normal test is simply that the enclosing dynamic scope is Standard
7282 return Enclosing_Dynamic_Scope (E) = Standard_Standard;
7283 end Is_Library_Level_Entity;
7285 ---------------------------------
7286 -- Is_Local_Variable_Reference --
7287 ---------------------------------
7289 function Is_Local_Variable_Reference (Expr : Node_Id) return Boolean is
7291 if not Is_Entity_Name (Expr) then
7296 Ent : constant Entity_Id := Entity (Expr);
7297 Sub : constant Entity_Id := Enclosing_Subprogram (Ent);
7299 if not Ekind_In (Ent, E_Variable, E_In_Out_Parameter) then
7302 return Present (Sub) and then Sub = Current_Subprogram;
7306 end Is_Local_Variable_Reference;
7308 -------------------------
7309 -- Is_Object_Reference --
7310 -------------------------
7312 function Is_Object_Reference (N : Node_Id) return Boolean is
7314 if Is_Entity_Name (N) then
7315 return Present (Entity (N)) and then Is_Object (Entity (N));
7319 when N_Indexed_Component | N_Slice =>
7321 Is_Object_Reference (Prefix (N))
7322 or else Is_Access_Type (Etype (Prefix (N)));
7324 -- In Ada95, a function call is a constant object; a procedure
7327 when N_Function_Call =>
7328 return Etype (N) /= Standard_Void_Type;
7330 -- A reference to the stream attribute Input is a function call
7332 when N_Attribute_Reference =>
7333 return Attribute_Name (N) = Name_Input;
7335 when N_Selected_Component =>
7337 Is_Object_Reference (Selector_Name (N))
7339 (Is_Object_Reference (Prefix (N))
7340 or else Is_Access_Type (Etype (Prefix (N))));
7342 when N_Explicit_Dereference =>
7345 -- A view conversion of a tagged object is an object reference
7347 when N_Type_Conversion =>
7348 return Is_Tagged_Type (Etype (Subtype_Mark (N)))
7349 and then Is_Tagged_Type (Etype (Expression (N)))
7350 and then Is_Object_Reference (Expression (N));
7352 -- An unchecked type conversion is considered to be an object if
7353 -- the operand is an object (this construction arises only as a
7354 -- result of expansion activities).
7356 when N_Unchecked_Type_Conversion =>
7363 end Is_Object_Reference;
7365 -----------------------------------
7366 -- Is_OK_Variable_For_Out_Formal --
7367 -----------------------------------
7369 function Is_OK_Variable_For_Out_Formal (AV : Node_Id) return Boolean is
7371 Note_Possible_Modification (AV, Sure => True);
7373 -- We must reject parenthesized variable names. The check for
7374 -- Comes_From_Source is present because there are currently
7375 -- cases where the compiler violates this rule (e.g. passing
7376 -- a task object to its controlled Initialize routine).
7378 if Paren_Count (AV) > 0 and then Comes_From_Source (AV) then
7381 -- A variable is always allowed
7383 elsif Is_Variable (AV) then
7386 -- Unchecked conversions are allowed only if they come from the
7387 -- generated code, which sometimes uses unchecked conversions for out
7388 -- parameters in cases where code generation is unaffected. We tell
7389 -- source unchecked conversions by seeing if they are rewrites of an
7390 -- original Unchecked_Conversion function call, or of an explicit
7391 -- conversion of a function call.
7393 elsif Nkind (AV) = N_Unchecked_Type_Conversion then
7394 if Nkind (Original_Node (AV)) = N_Function_Call then
7397 elsif Comes_From_Source (AV)
7398 and then Nkind (Original_Node (Expression (AV))) = N_Function_Call
7402 elsif Nkind (Original_Node (AV)) = N_Type_Conversion then
7403 return Is_OK_Variable_For_Out_Formal (Expression (AV));
7409 -- Normal type conversions are allowed if argument is a variable
7411 elsif Nkind (AV) = N_Type_Conversion then
7412 if Is_Variable (Expression (AV))
7413 and then Paren_Count (Expression (AV)) = 0
7415 Note_Possible_Modification (Expression (AV), Sure => True);
7418 -- We also allow a non-parenthesized expression that raises
7419 -- constraint error if it rewrites what used to be a variable
7421 elsif Raises_Constraint_Error (Expression (AV))
7422 and then Paren_Count (Expression (AV)) = 0
7423 and then Is_Variable (Original_Node (Expression (AV)))
7427 -- Type conversion of something other than a variable
7433 -- If this node is rewritten, then test the original form, if that is
7434 -- OK, then we consider the rewritten node OK (for example, if the
7435 -- original node is a conversion, then Is_Variable will not be true
7436 -- but we still want to allow the conversion if it converts a variable).
7438 elsif Original_Node (AV) /= AV then
7440 -- In Ada2012, the explicit dereference may be a rewritten call to a
7441 -- Reference function.
7443 if Ada_Version >= Ada_2012
7444 and then Nkind (Original_Node (AV)) = N_Function_Call
7446 Has_Implicit_Dereference (Etype (Name (Original_Node (AV))))
7451 return Is_OK_Variable_For_Out_Formal (Original_Node (AV));
7454 -- All other non-variables are rejected
7459 end Is_OK_Variable_For_Out_Formal;
7461 -----------------------------------
7462 -- Is_Partially_Initialized_Type --
7463 -----------------------------------
7465 function Is_Partially_Initialized_Type
7467 Include_Implicit : Boolean := True) return Boolean
7470 if Is_Scalar_Type (Typ) then
7473 elsif Is_Access_Type (Typ) then
7474 return Include_Implicit;
7476 elsif Is_Array_Type (Typ) then
7478 -- If component type is partially initialized, so is array type
7480 if Is_Partially_Initialized_Type
7481 (Component_Type (Typ), Include_Implicit)
7485 -- Otherwise we are only partially initialized if we are fully
7486 -- initialized (this is the empty array case, no point in us
7487 -- duplicating that code here).
7490 return Is_Fully_Initialized_Type (Typ);
7493 elsif Is_Record_Type (Typ) then
7495 -- A discriminated type is always partially initialized if in
7498 if Has_Discriminants (Typ) and then Include_Implicit then
7501 -- A tagged type is always partially initialized
7503 elsif Is_Tagged_Type (Typ) then
7506 -- Case of non-discriminated record
7512 Component_Present : Boolean := False;
7513 -- Set True if at least one component is present. If no
7514 -- components are present, then record type is fully
7515 -- initialized (another odd case, like the null array).
7518 -- Loop through components
7520 Ent := First_Entity (Typ);
7521 while Present (Ent) loop
7522 if Ekind (Ent) = E_Component then
7523 Component_Present := True;
7525 -- If a component has an initialization expression then
7526 -- the enclosing record type is partially initialized
7528 if Present (Parent (Ent))
7529 and then Present (Expression (Parent (Ent)))
7533 -- If a component is of a type which is itself partially
7534 -- initialized, then the enclosing record type is also.
7536 elsif Is_Partially_Initialized_Type
7537 (Etype (Ent), Include_Implicit)
7546 -- No initialized components found. If we found any components
7547 -- they were all uninitialized so the result is false.
7549 if Component_Present then
7552 -- But if we found no components, then all the components are
7553 -- initialized so we consider the type to be initialized.
7561 -- Concurrent types are always fully initialized
7563 elsif Is_Concurrent_Type (Typ) then
7566 -- For a private type, go to underlying type. If there is no underlying
7567 -- type then just assume this partially initialized. Not clear if this
7568 -- can happen in a non-error case, but no harm in testing for this.
7570 elsif Is_Private_Type (Typ) then
7572 U : constant Entity_Id := Underlying_Type (Typ);
7577 return Is_Partially_Initialized_Type (U, Include_Implicit);
7581 -- For any other type (are there any?) assume partially initialized
7586 end Is_Partially_Initialized_Type;
7588 ------------------------------------
7589 -- Is_Potentially_Persistent_Type --
7590 ------------------------------------
7592 function Is_Potentially_Persistent_Type (T : Entity_Id) return Boolean is
7597 -- For private type, test corresponding full type
7599 if Is_Private_Type (T) then
7600 return Is_Potentially_Persistent_Type (Full_View (T));
7602 -- Scalar types are potentially persistent
7604 elsif Is_Scalar_Type (T) then
7607 -- Record type is potentially persistent if not tagged and the types of
7608 -- all it components are potentially persistent, and no component has
7609 -- an initialization expression.
7611 elsif Is_Record_Type (T)
7612 and then not Is_Tagged_Type (T)
7613 and then not Is_Partially_Initialized_Type (T)
7615 Comp := First_Component (T);
7616 while Present (Comp) loop
7617 if not Is_Potentially_Persistent_Type (Etype (Comp)) then
7626 -- Array type is potentially persistent if its component type is
7627 -- potentially persistent and if all its constraints are static.
7629 elsif Is_Array_Type (T) then
7630 if not Is_Potentially_Persistent_Type (Component_Type (T)) then
7634 Indx := First_Index (T);
7635 while Present (Indx) loop
7636 if not Is_OK_Static_Subtype (Etype (Indx)) then
7645 -- All other types are not potentially persistent
7650 end Is_Potentially_Persistent_Type;
7652 ---------------------------------
7653 -- Is_Protected_Self_Reference --
7654 ---------------------------------
7656 function Is_Protected_Self_Reference (N : Node_Id) return Boolean is
7658 function In_Access_Definition (N : Node_Id) return Boolean;
7659 -- Returns true if N belongs to an access definition
7661 --------------------------
7662 -- In_Access_Definition --
7663 --------------------------
7665 function In_Access_Definition (N : Node_Id) return Boolean is
7670 while Present (P) loop
7671 if Nkind (P) = N_Access_Definition then
7679 end In_Access_Definition;
7681 -- Start of processing for Is_Protected_Self_Reference
7684 -- Verify that prefix is analyzed and has the proper form. Note that
7685 -- the attributes Elab_Spec, Elab_Body, Elab_Subp_Body and UET_Address,
7686 -- which also produce the address of an entity, do not analyze their
7687 -- prefix because they denote entities that are not necessarily visible.
7688 -- Neither of them can apply to a protected type.
7690 return Ada_Version >= Ada_2005
7691 and then Is_Entity_Name (N)
7692 and then Present (Entity (N))
7693 and then Is_Protected_Type (Entity (N))
7694 and then In_Open_Scopes (Entity (N))
7695 and then not In_Access_Definition (N);
7696 end Is_Protected_Self_Reference;
7698 -----------------------------
7699 -- Is_RCI_Pkg_Spec_Or_Body --
7700 -----------------------------
7702 function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
7704 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
7705 -- Return True if the unit of Cunit is an RCI package declaration
7707 ---------------------------
7708 -- Is_RCI_Pkg_Decl_Cunit --
7709 ---------------------------
7711 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean is
7712 The_Unit : constant Node_Id := Unit (Cunit);
7715 if Nkind (The_Unit) /= N_Package_Declaration then
7719 return Is_Remote_Call_Interface (Defining_Entity (The_Unit));
7720 end Is_RCI_Pkg_Decl_Cunit;
7722 -- Start of processing for Is_RCI_Pkg_Spec_Or_Body
7725 return Is_RCI_Pkg_Decl_Cunit (Cunit)
7727 (Nkind (Unit (Cunit)) = N_Package_Body
7728 and then Is_RCI_Pkg_Decl_Cunit (Library_Unit (Cunit)));
7729 end Is_RCI_Pkg_Spec_Or_Body;
7731 -----------------------------------------
7732 -- Is_Remote_Access_To_Class_Wide_Type --
7733 -----------------------------------------
7735 function Is_Remote_Access_To_Class_Wide_Type
7736 (E : Entity_Id) return Boolean
7739 -- A remote access to class-wide type is a general access to object type
7740 -- declared in the visible part of a Remote_Types or Remote_Call_
7743 return Ekind (E) = E_General_Access_Type
7744 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
7745 end Is_Remote_Access_To_Class_Wide_Type;
7747 -----------------------------------------
7748 -- Is_Remote_Access_To_Subprogram_Type --
7749 -----------------------------------------
7751 function Is_Remote_Access_To_Subprogram_Type
7752 (E : Entity_Id) return Boolean
7755 return (Ekind (E) = E_Access_Subprogram_Type
7756 or else (Ekind (E) = E_Record_Type
7757 and then Present (Corresponding_Remote_Type (E))))
7758 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
7759 end Is_Remote_Access_To_Subprogram_Type;
7761 --------------------
7762 -- Is_Remote_Call --
7763 --------------------
7765 function Is_Remote_Call (N : Node_Id) return Boolean is
7767 if Nkind (N) /= N_Procedure_Call_Statement
7768 and then Nkind (N) /= N_Function_Call
7770 -- An entry call cannot be remote
7774 elsif Nkind (Name (N)) in N_Has_Entity
7775 and then Is_Remote_Call_Interface (Entity (Name (N)))
7777 -- A subprogram declared in the spec of a RCI package is remote
7781 elsif Nkind (Name (N)) = N_Explicit_Dereference
7782 and then Is_Remote_Access_To_Subprogram_Type
7783 (Etype (Prefix (Name (N))))
7785 -- The dereference of a RAS is a remote call
7789 elsif Present (Controlling_Argument (N))
7790 and then Is_Remote_Access_To_Class_Wide_Type
7791 (Etype (Controlling_Argument (N)))
7793 -- Any primitive operation call with a controlling argument of
7794 -- a RACW type is a remote call.
7799 -- All other calls are local calls
7804 ----------------------
7805 -- Is_Renamed_Entry --
7806 ----------------------
7808 function Is_Renamed_Entry (Proc_Nam : Entity_Id) return Boolean is
7809 Orig_Node : Node_Id := Empty;
7810 Subp_Decl : Node_Id := Parent (Parent (Proc_Nam));
7812 function Is_Entry (Nam : Node_Id) return Boolean;
7813 -- Determine whether Nam is an entry. Traverse selectors if there are
7814 -- nested selected components.
7820 function Is_Entry (Nam : Node_Id) return Boolean is
7822 if Nkind (Nam) = N_Selected_Component then
7823 return Is_Entry (Selector_Name (Nam));
7826 return Ekind (Entity (Nam)) = E_Entry;
7829 -- Start of processing for Is_Renamed_Entry
7832 if Present (Alias (Proc_Nam)) then
7833 Subp_Decl := Parent (Parent (Alias (Proc_Nam)));
7836 -- Look for a rewritten subprogram renaming declaration
7838 if Nkind (Subp_Decl) = N_Subprogram_Declaration
7839 and then Present (Original_Node (Subp_Decl))
7841 Orig_Node := Original_Node (Subp_Decl);
7844 -- The rewritten subprogram is actually an entry
7846 if Present (Orig_Node)
7847 and then Nkind (Orig_Node) = N_Subprogram_Renaming_Declaration
7848 and then Is_Entry (Name (Orig_Node))
7854 end Is_Renamed_Entry;
7856 ----------------------------
7857 -- Is_Reversible_Iterator --
7858 ----------------------------
7860 function Is_Reversible_Iterator (Typ : Entity_Id) return Boolean is
7861 Ifaces_List : Elist_Id;
7862 Iface_Elmt : Elmt_Id;
7866 if Is_Class_Wide_Type (Typ)
7867 and then Chars (Etype (Typ)) = Name_Reversible_Iterator
7869 Is_Predefined_File_Name
7870 (Unit_File_Name (Get_Source_Unit (Etype (Typ))))
7874 elsif not Is_Tagged_Type (Typ)
7875 or else not Is_Derived_Type (Typ)
7880 Collect_Interfaces (Typ, Ifaces_List);
7882 Iface_Elmt := First_Elmt (Ifaces_List);
7883 while Present (Iface_Elmt) loop
7884 Iface := Node (Iface_Elmt);
7885 if Chars (Iface) = Name_Reversible_Iterator
7887 Is_Predefined_File_Name
7888 (Unit_File_Name (Get_Source_Unit (Iface)))
7893 Next_Elmt (Iface_Elmt);
7898 end Is_Reversible_Iterator;
7900 ----------------------
7901 -- Is_Selector_Name --
7902 ----------------------
7904 function Is_Selector_Name (N : Node_Id) return Boolean is
7906 if not Is_List_Member (N) then
7908 P : constant Node_Id := Parent (N);
7909 K : constant Node_Kind := Nkind (P);
7912 (K = N_Expanded_Name or else
7913 K = N_Generic_Association or else
7914 K = N_Parameter_Association or else
7915 K = N_Selected_Component)
7916 and then Selector_Name (P) = N;
7921 L : constant List_Id := List_Containing (N);
7922 P : constant Node_Id := Parent (L);
7924 return (Nkind (P) = N_Discriminant_Association
7925 and then Selector_Names (P) = L)
7927 (Nkind (P) = N_Component_Association
7928 and then Choices (P) = L);
7931 end Is_Selector_Name;
7933 ----------------------------------
7934 -- Is_SPARK_Initialization_Expr --
7935 ----------------------------------
7937 function Is_SPARK_Initialization_Expr (N : Node_Id) return Boolean is
7940 Comp_Assn : Node_Id;
7941 Orig_N : constant Node_Id := Original_Node (N);
7946 if not Comes_From_Source (Orig_N) then
7950 pragma Assert (Nkind (Orig_N) in N_Subexpr);
7952 case Nkind (Orig_N) is
7953 when N_Character_Literal |
7961 if Is_Entity_Name (Orig_N)
7962 and then Present (Entity (Orig_N)) -- needed in some cases
7964 case Ekind (Entity (Orig_N)) is
7966 E_Enumeration_Literal |
7971 if Is_Type (Entity (Orig_N)) then
7979 when N_Qualified_Expression |
7980 N_Type_Conversion =>
7981 Is_Ok := Is_SPARK_Initialization_Expr (Expression (Orig_N));
7984 Is_Ok := Is_SPARK_Initialization_Expr (Right_Opnd (Orig_N));
7988 N_Membership_Test =>
7989 Is_Ok := Is_SPARK_Initialization_Expr (Left_Opnd (Orig_N))
7990 and then Is_SPARK_Initialization_Expr (Right_Opnd (Orig_N));
7993 N_Extension_Aggregate =>
7994 if Nkind (Orig_N) = N_Extension_Aggregate then
7995 Is_Ok := Is_SPARK_Initialization_Expr (Ancestor_Part (Orig_N));
7998 Expr := First (Expressions (Orig_N));
7999 while Present (Expr) loop
8000 if not Is_SPARK_Initialization_Expr (Expr) then
8008 Comp_Assn := First (Component_Associations (Orig_N));
8009 while Present (Comp_Assn) loop
8010 Expr := Expression (Comp_Assn);
8011 if Present (Expr) -- needed for box association
8012 and then not Is_SPARK_Initialization_Expr (Expr)
8021 when N_Attribute_Reference =>
8022 if Nkind (Prefix (Orig_N)) in N_Subexpr then
8023 Is_Ok := Is_SPARK_Initialization_Expr (Prefix (Orig_N));
8026 Expr := First (Expressions (Orig_N));
8027 while Present (Expr) loop
8028 if not Is_SPARK_Initialization_Expr (Expr) then
8036 -- Selected components might be expanded named not yet resolved, so
8037 -- default on the safe side. (Eg on sparklex.ads)
8039 when N_Selected_Component =>
8048 end Is_SPARK_Initialization_Expr;
8050 -------------------------------
8051 -- Is_SPARK_Object_Reference --
8052 -------------------------------
8054 function Is_SPARK_Object_Reference (N : Node_Id) return Boolean is
8056 if Is_Entity_Name (N) then
8057 return Present (Entity (N))
8059 (Ekind_In (Entity (N), E_Constant, E_Variable)
8060 or else Ekind (Entity (N)) in Formal_Kind);
8064 when N_Selected_Component =>
8065 return Is_SPARK_Object_Reference (Prefix (N));
8071 end Is_SPARK_Object_Reference;
8077 function Is_Statement (N : Node_Id) return Boolean is
8080 Nkind (N) in N_Statement_Other_Than_Procedure_Call
8081 or else Nkind (N) = N_Procedure_Call_Statement;
8084 --------------------------------------------------
8085 -- Is_Subprogram_Stub_Without_Prior_Declaration --
8086 --------------------------------------------------
8088 function Is_Subprogram_Stub_Without_Prior_Declaration
8089 (N : Node_Id) return Boolean
8092 -- A subprogram stub without prior declaration serves as declaration for
8093 -- the actual subprogram body. As such, it has an attached defining
8094 -- entity of E_[Generic_]Function or E_[Generic_]Procedure.
8096 return Nkind (N) = N_Subprogram_Body_Stub
8097 and then Ekind (Defining_Entity (N)) /= E_Subprogram_Body;
8098 end Is_Subprogram_Stub_Without_Prior_Declaration;
8100 ---------------------------------
8101 -- Is_Synchronized_Tagged_Type --
8102 ---------------------------------
8104 function Is_Synchronized_Tagged_Type (E : Entity_Id) return Boolean is
8105 Kind : constant Entity_Kind := Ekind (Base_Type (E));
8108 -- A task or protected type derived from an interface is a tagged type.
8109 -- Such a tagged type is called a synchronized tagged type, as are
8110 -- synchronized interfaces and private extensions whose declaration
8111 -- includes the reserved word synchronized.
8113 return (Is_Tagged_Type (E)
8114 and then (Kind = E_Task_Type
8115 or else Kind = E_Protected_Type))
8118 and then Is_Synchronized_Interface (E))
8120 (Ekind (E) = E_Record_Type_With_Private
8121 and then Nkind (Parent (E)) = N_Private_Extension_Declaration
8122 and then (Synchronized_Present (Parent (E))
8123 or else Is_Synchronized_Interface (Etype (E))));
8124 end Is_Synchronized_Tagged_Type;
8130 function Is_Transfer (N : Node_Id) return Boolean is
8131 Kind : constant Node_Kind := Nkind (N);
8134 if Kind = N_Simple_Return_Statement
8136 Kind = N_Extended_Return_Statement
8138 Kind = N_Goto_Statement
8140 Kind = N_Raise_Statement
8142 Kind = N_Requeue_Statement
8146 elsif (Kind = N_Exit_Statement or else Kind in N_Raise_xxx_Error)
8147 and then No (Condition (N))
8151 elsif Kind = N_Procedure_Call_Statement
8152 and then Is_Entity_Name (Name (N))
8153 and then Present (Entity (Name (N)))
8154 and then No_Return (Entity (Name (N)))
8158 elsif Nkind (Original_Node (N)) = N_Raise_Statement then
8170 function Is_True (U : Uint) return Boolean is
8175 -------------------------------
8176 -- Is_Universal_Numeric_Type --
8177 -------------------------------
8179 function Is_Universal_Numeric_Type (T : Entity_Id) return Boolean is
8181 return T = Universal_Integer or else T = Universal_Real;
8182 end Is_Universal_Numeric_Type;
8188 function Is_Value_Type (T : Entity_Id) return Boolean is
8190 return VM_Target = CLI_Target
8191 and then Nkind (T) in N_Has_Chars
8192 and then Chars (T) /= No_Name
8193 and then Get_Name_String (Chars (T)) = "valuetype";
8196 ---------------------
8197 -- Is_VMS_Operator --
8198 ---------------------
8200 function Is_VMS_Operator (Op : Entity_Id) return Boolean is
8202 -- The VMS operators are declared in a child of System that is loaded
8203 -- through pragma Extend_System. In some rare cases a program is run
8204 -- with this extension but without indicating that the target is VMS.
8206 return Ekind (Op) = E_Function
8207 and then Is_Intrinsic_Subprogram (Op)
8209 ((Present_System_Aux
8210 and then Scope (Op) = System_Aux_Id)
8213 and then Scope (Scope (Op)) = RTU_Entity (System)));
8214 end Is_VMS_Operator;
8220 function Is_Variable
8222 Use_Original_Node : Boolean := True) return Boolean
8224 Orig_Node : Node_Id;
8226 function In_Protected_Function (E : Entity_Id) return Boolean;
8227 -- Within a protected function, the private components of the enclosing
8228 -- protected type are constants. A function nested within a (protected)
8229 -- procedure is not itself protected.
8231 function Is_Variable_Prefix (P : Node_Id) return Boolean;
8232 -- Prefixes can involve implicit dereferences, in which case we must
8233 -- test for the case of a reference of a constant access type, which can
8234 -- can never be a variable.
8236 ---------------------------
8237 -- In_Protected_Function --
8238 ---------------------------
8240 function In_Protected_Function (E : Entity_Id) return Boolean is
8241 Prot : constant Entity_Id := Scope (E);
8245 if not Is_Protected_Type (Prot) then
8249 while Present (S) and then S /= Prot loop
8250 if Ekind (S) = E_Function and then Scope (S) = Prot then
8259 end In_Protected_Function;
8261 ------------------------
8262 -- Is_Variable_Prefix --
8263 ------------------------
8265 function Is_Variable_Prefix (P : Node_Id) return Boolean is
8267 if Is_Access_Type (Etype (P)) then
8268 return not Is_Access_Constant (Root_Type (Etype (P)));
8270 -- For the case of an indexed component whose prefix has a packed
8271 -- array type, the prefix has been rewritten into a type conversion.
8272 -- Determine variable-ness from the converted expression.
8274 elsif Nkind (P) = N_Type_Conversion
8275 and then not Comes_From_Source (P)
8276 and then Is_Array_Type (Etype (P))
8277 and then Is_Packed (Etype (P))
8279 return Is_Variable (Expression (P));
8282 return Is_Variable (P);
8284 end Is_Variable_Prefix;
8286 -- Start of processing for Is_Variable
8289 -- Check if we perform the test on the original node since this may be a
8290 -- test of syntactic categories which must not be disturbed by whatever
8291 -- rewriting might have occurred. For example, an aggregate, which is
8292 -- certainly NOT a variable, could be turned into a variable by
8295 if Use_Original_Node then
8296 Orig_Node := Original_Node (N);
8301 -- Definitely OK if Assignment_OK is set. Since this is something that
8302 -- only gets set for expanded nodes, the test is on N, not Orig_Node.
8304 if Nkind (N) in N_Subexpr and then Assignment_OK (N) then
8307 -- Normally we go to the original node, but there is one exception where
8308 -- we use the rewritten node, namely when it is an explicit dereference.
8309 -- The generated code may rewrite a prefix which is an access type with
8310 -- an explicit dereference. The dereference is a variable, even though
8311 -- the original node may not be (since it could be a constant of the
8314 -- In Ada 2005 we have a further case to consider: the prefix may be a
8315 -- function call given in prefix notation. The original node appears to
8316 -- be a selected component, but we need to examine the call.
8318 elsif Nkind (N) = N_Explicit_Dereference
8319 and then Nkind (Orig_Node) /= N_Explicit_Dereference
8320 and then Present (Etype (Orig_Node))
8321 and then Is_Access_Type (Etype (Orig_Node))
8323 -- Note that if the prefix is an explicit dereference that does not
8324 -- come from source, we must check for a rewritten function call in
8325 -- prefixed notation before other forms of rewriting, to prevent a
8329 (Nkind (Orig_Node) = N_Function_Call
8330 and then not Is_Access_Constant (Etype (Prefix (N))))
8332 Is_Variable_Prefix (Original_Node (Prefix (N)));
8334 -- A function call is never a variable
8336 elsif Nkind (N) = N_Function_Call then
8339 -- All remaining checks use the original node
8341 elsif Is_Entity_Name (Orig_Node)
8342 and then Present (Entity (Orig_Node))
8345 E : constant Entity_Id := Entity (Orig_Node);
8346 K : constant Entity_Kind := Ekind (E);
8349 return (K = E_Variable
8350 and then Nkind (Parent (E)) /= N_Exception_Handler)
8351 or else (K = E_Component
8352 and then not In_Protected_Function (E))
8353 or else K = E_Out_Parameter
8354 or else K = E_In_Out_Parameter
8355 or else K = E_Generic_In_Out_Parameter
8357 -- Current instance of type:
8359 or else (Is_Type (E) and then In_Open_Scopes (E))
8360 or else (Is_Incomplete_Or_Private_Type (E)
8361 and then In_Open_Scopes (Full_View (E)));
8365 case Nkind (Orig_Node) is
8366 when N_Indexed_Component | N_Slice =>
8367 return Is_Variable_Prefix (Prefix (Orig_Node));
8369 when N_Selected_Component =>
8370 return Is_Variable_Prefix (Prefix (Orig_Node))
8371 and then Is_Variable (Selector_Name (Orig_Node));
8373 -- For an explicit dereference, the type of the prefix cannot
8374 -- be an access to constant or an access to subprogram.
8376 when N_Explicit_Dereference =>
8378 Typ : constant Entity_Id := Etype (Prefix (Orig_Node));
8380 return Is_Access_Type (Typ)
8381 and then not Is_Access_Constant (Root_Type (Typ))
8382 and then Ekind (Typ) /= E_Access_Subprogram_Type;
8385 -- The type conversion is the case where we do not deal with the
8386 -- context dependent special case of an actual parameter. Thus
8387 -- the type conversion is only considered a variable for the
8388 -- purposes of this routine if the target type is tagged. However,
8389 -- a type conversion is considered to be a variable if it does not
8390 -- come from source (this deals for example with the conversions
8391 -- of expressions to their actual subtypes).
8393 when N_Type_Conversion =>
8394 return Is_Variable (Expression (Orig_Node))
8396 (not Comes_From_Source (Orig_Node)
8398 (Is_Tagged_Type (Etype (Subtype_Mark (Orig_Node)))
8400 Is_Tagged_Type (Etype (Expression (Orig_Node)))));
8402 -- GNAT allows an unchecked type conversion as a variable. This
8403 -- only affects the generation of internal expanded code, since
8404 -- calls to instantiations of Unchecked_Conversion are never
8405 -- considered variables (since they are function calls).
8406 -- This is also true for expression actions.
8408 when N_Unchecked_Type_Conversion =>
8409 return Is_Variable (Expression (Orig_Node));
8417 ---------------------------
8418 -- Is_Visibly_Controlled --
8419 ---------------------------
8421 function Is_Visibly_Controlled (T : Entity_Id) return Boolean is
8422 Root : constant Entity_Id := Root_Type (T);
8424 return Chars (Scope (Root)) = Name_Finalization
8425 and then Chars (Scope (Scope (Root))) = Name_Ada
8426 and then Scope (Scope (Scope (Root))) = Standard_Standard;
8427 end Is_Visibly_Controlled;
8429 ------------------------
8430 -- Is_Volatile_Object --
8431 ------------------------
8433 function Is_Volatile_Object (N : Node_Id) return Boolean is
8435 function Object_Has_Volatile_Components (N : Node_Id) return Boolean;
8436 -- Determines if given object has volatile components
8438 function Is_Volatile_Prefix (N : Node_Id) return Boolean;
8439 -- If prefix is an implicit dereference, examine designated type
8441 ------------------------
8442 -- Is_Volatile_Prefix --
8443 ------------------------
8445 function Is_Volatile_Prefix (N : Node_Id) return Boolean is
8446 Typ : constant Entity_Id := Etype (N);
8449 if Is_Access_Type (Typ) then
8451 Dtyp : constant Entity_Id := Designated_Type (Typ);
8454 return Is_Volatile (Dtyp)
8455 or else Has_Volatile_Components (Dtyp);
8459 return Object_Has_Volatile_Components (N);
8461 end Is_Volatile_Prefix;
8463 ------------------------------------
8464 -- Object_Has_Volatile_Components --
8465 ------------------------------------
8467 function Object_Has_Volatile_Components (N : Node_Id) return Boolean is
8468 Typ : constant Entity_Id := Etype (N);
8471 if Is_Volatile (Typ)
8472 or else Has_Volatile_Components (Typ)
8476 elsif Is_Entity_Name (N)
8477 and then (Has_Volatile_Components (Entity (N))
8478 or else Is_Volatile (Entity (N)))
8482 elsif Nkind (N) = N_Indexed_Component
8483 or else Nkind (N) = N_Selected_Component
8485 return Is_Volatile_Prefix (Prefix (N));
8490 end Object_Has_Volatile_Components;
8492 -- Start of processing for Is_Volatile_Object
8495 if Is_Volatile (Etype (N))
8496 or else (Is_Entity_Name (N) and then Is_Volatile (Entity (N)))
8500 elsif Nkind (N) = N_Indexed_Component
8501 or else Nkind (N) = N_Selected_Component
8503 return Is_Volatile_Prefix (Prefix (N));
8508 end Is_Volatile_Object;
8510 ---------------------------
8511 -- Itype_Has_Declaration --
8512 ---------------------------
8514 function Itype_Has_Declaration (Id : Entity_Id) return Boolean is
8516 pragma Assert (Is_Itype (Id));
8517 return Present (Parent (Id))
8518 and then Nkind_In (Parent (Id), N_Full_Type_Declaration,
8519 N_Subtype_Declaration)
8520 and then Defining_Entity (Parent (Id)) = Id;
8521 end Itype_Has_Declaration;
8523 -------------------------
8524 -- Kill_Current_Values --
8525 -------------------------
8527 procedure Kill_Current_Values
8529 Last_Assignment_Only : Boolean := False)
8532 -- ??? do we have to worry about clearing cached checks?
8534 if Is_Assignable (Ent) then
8535 Set_Last_Assignment (Ent, Empty);
8538 if Is_Object (Ent) then
8539 if not Last_Assignment_Only then
8541 Set_Current_Value (Ent, Empty);
8543 if not Can_Never_Be_Null (Ent) then
8544 Set_Is_Known_Non_Null (Ent, False);
8547 Set_Is_Known_Null (Ent, False);
8549 -- Reset Is_Known_Valid unless type is always valid, or if we have
8550 -- a loop parameter (loop parameters are always valid, since their
8551 -- bounds are defined by the bounds given in the loop header).
8553 if not Is_Known_Valid (Etype (Ent))
8554 and then Ekind (Ent) /= E_Loop_Parameter
8556 Set_Is_Known_Valid (Ent, False);
8560 end Kill_Current_Values;
8562 procedure Kill_Current_Values (Last_Assignment_Only : Boolean := False) is
8565 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id);
8566 -- Clear current value for entity E and all entities chained to E
8568 ------------------------------------------
8569 -- Kill_Current_Values_For_Entity_Chain --
8570 ------------------------------------------
8572 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id) is
8576 while Present (Ent) loop
8577 Kill_Current_Values (Ent, Last_Assignment_Only);
8580 end Kill_Current_Values_For_Entity_Chain;
8582 -- Start of processing for Kill_Current_Values
8585 -- Kill all saved checks, a special case of killing saved values
8587 if not Last_Assignment_Only then
8591 -- Loop through relevant scopes, which includes the current scope and
8592 -- any parent scopes if the current scope is a block or a package.
8597 -- Clear current values of all entities in current scope
8599 Kill_Current_Values_For_Entity_Chain (First_Entity (S));
8601 -- If scope is a package, also clear current values of all
8602 -- private entities in the scope.
8604 if Is_Package_Or_Generic_Package (S)
8605 or else Is_Concurrent_Type (S)
8607 Kill_Current_Values_For_Entity_Chain (First_Private_Entity (S));
8610 -- If this is a not a subprogram, deal with parents
8612 if not Is_Subprogram (S) then
8614 exit Scope_Loop when S = Standard_Standard;
8618 end loop Scope_Loop;
8619 end Kill_Current_Values;
8621 --------------------------
8622 -- Kill_Size_Check_Code --
8623 --------------------------
8625 procedure Kill_Size_Check_Code (E : Entity_Id) is
8627 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
8628 and then Present (Size_Check_Code (E))
8630 Remove (Size_Check_Code (E));
8631 Set_Size_Check_Code (E, Empty);
8633 end Kill_Size_Check_Code;
8635 --------------------------
8636 -- Known_To_Be_Assigned --
8637 --------------------------
8639 function Known_To_Be_Assigned (N : Node_Id) return Boolean is
8640 P : constant Node_Id := Parent (N);
8645 -- Test left side of assignment
8647 when N_Assignment_Statement =>
8648 return N = Name (P);
8650 -- Function call arguments are never lvalues
8652 when N_Function_Call =>
8655 -- Positional parameter for procedure or accept call
8657 when N_Procedure_Call_Statement |
8666 Proc := Get_Subprogram_Entity (P);
8672 -- If we are not a list member, something is strange, so
8673 -- be conservative and return False.
8675 if not Is_List_Member (N) then
8679 -- We are going to find the right formal by stepping forward
8680 -- through the formals, as we step backwards in the actuals.
8682 Form := First_Formal (Proc);
8685 -- If no formal, something is weird, so be conservative
8686 -- and return False.
8697 return Ekind (Form) /= E_In_Parameter;
8700 -- Named parameter for procedure or accept call
8702 when N_Parameter_Association =>
8708 Proc := Get_Subprogram_Entity (Parent (P));
8714 -- Loop through formals to find the one that matches
8716 Form := First_Formal (Proc);
8718 -- If no matching formal, that's peculiar, some kind of
8719 -- previous error, so return False to be conservative.
8725 -- Else test for match
8727 if Chars (Form) = Chars (Selector_Name (P)) then
8728 return Ekind (Form) /= E_In_Parameter;
8735 -- Test for appearing in a conversion that itself appears
8736 -- in an lvalue context, since this should be an lvalue.
8738 when N_Type_Conversion =>
8739 return Known_To_Be_Assigned (P);
8741 -- All other references are definitely not known to be modifications
8747 end Known_To_Be_Assigned;
8749 ---------------------------
8750 -- Last_Source_Statement --
8751 ---------------------------
8753 function Last_Source_Statement (HSS : Node_Id) return Node_Id is
8757 N := Last (Statements (HSS));
8758 while Present (N) loop
8759 exit when Comes_From_Source (N);
8764 end Last_Source_Statement;
8766 ----------------------------------
8767 -- Matching_Static_Array_Bounds --
8768 ----------------------------------
8770 function Matching_Static_Array_Bounds
8772 R_Typ : Node_Id) return Boolean
8774 L_Ndims : constant Nat := Number_Dimensions (L_Typ);
8775 R_Ndims : constant Nat := Number_Dimensions (R_Typ);
8787 if L_Ndims /= R_Ndims then
8791 -- Unconstrained types do not have static bounds
8793 if not Is_Constrained (L_Typ) or else not Is_Constrained (R_Typ) then
8797 -- First treat specially the first dimension, as the lower bound and
8798 -- length of string literals are not stored like those of arrays.
8800 if Ekind (L_Typ) = E_String_Literal_Subtype then
8801 L_Low := String_Literal_Low_Bound (L_Typ);
8802 L_Len := String_Literal_Length (L_Typ);
8804 L_Index := First_Index (L_Typ);
8805 Get_Index_Bounds (L_Index, L_Low, L_High);
8807 if Is_OK_Static_Expression (L_Low)
8808 and then Is_OK_Static_Expression (L_High)
8810 if Expr_Value (L_High) < Expr_Value (L_Low) then
8813 L_Len := (Expr_Value (L_High) - Expr_Value (L_Low)) + 1;
8820 if Ekind (R_Typ) = E_String_Literal_Subtype then
8821 R_Low := String_Literal_Low_Bound (R_Typ);
8822 R_Len := String_Literal_Length (R_Typ);
8824 R_Index := First_Index (R_Typ);
8825 Get_Index_Bounds (R_Index, R_Low, R_High);
8827 if Is_OK_Static_Expression (R_Low)
8828 and then Is_OK_Static_Expression (R_High)
8830 if Expr_Value (R_High) < Expr_Value (R_Low) then
8833 R_Len := (Expr_Value (R_High) - Expr_Value (R_Low)) + 1;
8840 if Is_OK_Static_Expression (L_Low)
8841 and then Is_OK_Static_Expression (R_Low)
8842 and then Expr_Value (L_Low) = Expr_Value (R_Low)
8843 and then L_Len = R_Len
8850 -- Then treat all other dimensions
8852 for Indx in 2 .. L_Ndims loop
8856 Get_Index_Bounds (L_Index, L_Low, L_High);
8857 Get_Index_Bounds (R_Index, R_Low, R_High);
8859 if Is_OK_Static_Expression (L_Low)
8860 and then Is_OK_Static_Expression (L_High)
8861 and then Is_OK_Static_Expression (R_Low)
8862 and then Is_OK_Static_Expression (R_High)
8863 and then Expr_Value (L_Low) = Expr_Value (R_Low)
8864 and then Expr_Value (L_High) = Expr_Value (R_High)
8872 -- If we fall through the loop, all indexes matched
8875 end Matching_Static_Array_Bounds;
8881 function May_Be_Lvalue (N : Node_Id) return Boolean is
8882 P : constant Node_Id := Parent (N);
8887 -- Test left side of assignment
8889 when N_Assignment_Statement =>
8890 return N = Name (P);
8892 -- Test prefix of component or attribute. Note that the prefix of an
8893 -- explicit or implicit dereference cannot be an l-value.
8895 when N_Attribute_Reference =>
8896 return N = Prefix (P)
8897 and then Name_Implies_Lvalue_Prefix (Attribute_Name (P));
8899 -- For an expanded name, the name is an lvalue if the expanded name
8900 -- is an lvalue, but the prefix is never an lvalue, since it is just
8901 -- the scope where the name is found.
8903 when N_Expanded_Name =>
8904 if N = Prefix (P) then
8905 return May_Be_Lvalue (P);
8910 -- For a selected component A.B, A is certainly an lvalue if A.B is.
8911 -- B is a little interesting, if we have A.B := 3, there is some
8912 -- discussion as to whether B is an lvalue or not, we choose to say
8913 -- it is. Note however that A is not an lvalue if it is of an access
8914 -- type since this is an implicit dereference.
8916 when N_Selected_Component =>
8918 and then Present (Etype (N))
8919 and then Is_Access_Type (Etype (N))
8923 return May_Be_Lvalue (P);
8926 -- For an indexed component or slice, the index or slice bounds is
8927 -- never an lvalue. The prefix is an lvalue if the indexed component
8928 -- or slice is an lvalue, except if it is an access type, where we
8929 -- have an implicit dereference.
8931 when N_Indexed_Component =>
8933 or else (Present (Etype (N)) and then Is_Access_Type (Etype (N)))
8937 return May_Be_Lvalue (P);
8940 -- Prefix of a reference is an lvalue if the reference is an lvalue
8943 return May_Be_Lvalue (P);
8945 -- Prefix of explicit dereference is never an lvalue
8947 when N_Explicit_Dereference =>
8950 -- Positional parameter for subprogram, entry, or accept call.
8951 -- In older versions of Ada function call arguments are never
8952 -- lvalues. In Ada 2012 functions can have in-out parameters.
8954 when N_Function_Call |
8955 N_Procedure_Call_Statement |
8956 N_Entry_Call_Statement |
8959 if Nkind (P) = N_Function_Call
8960 and then Ada_Version < Ada_2012
8965 -- The following mechanism is clumsy and fragile. A single
8966 -- flag set in Resolve_Actuals would be preferable ???
8974 Proc := Get_Subprogram_Entity (P);
8980 -- If we are not a list member, something is strange, so
8981 -- be conservative and return True.
8983 if not Is_List_Member (N) then
8987 -- We are going to find the right formal by stepping forward
8988 -- through the formals, as we step backwards in the actuals.
8990 Form := First_Formal (Proc);
8993 -- If no formal, something is weird, so be conservative
9005 return Ekind (Form) /= E_In_Parameter;
9008 -- Named parameter for procedure or accept call
9010 when N_Parameter_Association =>
9016 Proc := Get_Subprogram_Entity (Parent (P));
9022 -- Loop through formals to find the one that matches
9024 Form := First_Formal (Proc);
9026 -- If no matching formal, that's peculiar, some kind of
9027 -- previous error, so return True to be conservative.
9033 -- Else test for match
9035 if Chars (Form) = Chars (Selector_Name (P)) then
9036 return Ekind (Form) /= E_In_Parameter;
9043 -- Test for appearing in a conversion that itself appears in an
9044 -- lvalue context, since this should be an lvalue.
9046 when N_Type_Conversion =>
9047 return May_Be_Lvalue (P);
9049 -- Test for appearance in object renaming declaration
9051 when N_Object_Renaming_Declaration =>
9054 -- All other references are definitely not lvalues
9062 -----------------------
9063 -- Mark_Coextensions --
9064 -----------------------
9066 procedure Mark_Coextensions (Context_Nod : Node_Id; Root_Nod : Node_Id) is
9067 Is_Dynamic : Boolean;
9068 -- Indicates whether the context causes nested coextensions to be
9069 -- dynamic or static
9071 function Mark_Allocator (N : Node_Id) return Traverse_Result;
9072 -- Recognize an allocator node and label it as a dynamic coextension
9074 --------------------
9075 -- Mark_Allocator --
9076 --------------------
9078 function Mark_Allocator (N : Node_Id) return Traverse_Result is
9080 if Nkind (N) = N_Allocator then
9082 Set_Is_Dynamic_Coextension (N);
9084 -- If the allocator expression is potentially dynamic, it may
9085 -- be expanded out of order and require dynamic allocation
9086 -- anyway, so we treat the coextension itself as dynamic.
9087 -- Potential optimization ???
9089 elsif Nkind (Expression (N)) = N_Qualified_Expression
9090 and then Nkind (Expression (Expression (N))) = N_Op_Concat
9092 Set_Is_Dynamic_Coextension (N);
9095 Set_Is_Static_Coextension (N);
9102 procedure Mark_Allocators is new Traverse_Proc (Mark_Allocator);
9104 -- Start of processing Mark_Coextensions
9107 case Nkind (Context_Nod) is
9108 when N_Assignment_Statement |
9109 N_Simple_Return_Statement =>
9110 Is_Dynamic := Nkind (Expression (Context_Nod)) = N_Allocator;
9112 when N_Object_Declaration =>
9113 Is_Dynamic := Nkind (Root_Nod) = N_Allocator;
9115 -- This routine should not be called for constructs which may not
9116 -- contain coextensions.
9119 raise Program_Error;
9122 Mark_Allocators (Root_Nod);
9123 end Mark_Coextensions;
9125 ----------------------
9126 -- Needs_One_Actual --
9127 ----------------------
9129 function Needs_One_Actual (E : Entity_Id) return Boolean is
9133 if Ada_Version >= Ada_2005
9134 and then Present (First_Formal (E))
9136 Formal := Next_Formal (First_Formal (E));
9137 while Present (Formal) loop
9138 if No (Default_Value (Formal)) then
9142 Next_Formal (Formal);
9150 end Needs_One_Actual;
9152 ------------------------
9153 -- New_Copy_List_Tree --
9154 ------------------------
9156 function New_Copy_List_Tree (List : List_Id) return List_Id is
9161 if List = No_List then
9168 while Present (E) loop
9169 Append (New_Copy_Tree (E), NL);
9175 end New_Copy_List_Tree;
9181 use Atree.Unchecked_Access;
9182 use Atree_Private_Part;
9184 -- Our approach here requires a two pass traversal of the tree. The
9185 -- first pass visits all nodes that eventually will be copied looking
9186 -- for defining Itypes. If any defining Itypes are found, then they are
9187 -- copied, and an entry is added to the replacement map. In the second
9188 -- phase, the tree is copied, using the replacement map to replace any
9189 -- Itype references within the copied tree.
9191 -- The following hash tables are used if the Map supplied has more
9192 -- than hash threshold entries to speed up access to the map. If
9193 -- there are fewer entries, then the map is searched sequentially
9194 -- (because setting up a hash table for only a few entries takes
9195 -- more time than it saves.
9197 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
9198 -- Hash function used for hash operations
9204 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
9206 return Nat (E) mod (NCT_Header_Num'Last + 1);
9213 -- The hash table NCT_Assoc associates old entities in the table
9214 -- with their corresponding new entities (i.e. the pairs of entries
9215 -- presented in the original Map argument are Key-Element pairs).
9217 package NCT_Assoc is new Simple_HTable (
9218 Header_Num => NCT_Header_Num,
9219 Element => Entity_Id,
9220 No_Element => Empty,
9222 Hash => New_Copy_Hash,
9223 Equal => Types."=");
9225 ---------------------
9226 -- NCT_Itype_Assoc --
9227 ---------------------
9229 -- The hash table NCT_Itype_Assoc contains entries only for those
9230 -- old nodes which have a non-empty Associated_Node_For_Itype set.
9231 -- The key is the associated node, and the element is the new node
9232 -- itself (NOT the associated node for the new node).
9234 package NCT_Itype_Assoc is new Simple_HTable (
9235 Header_Num => NCT_Header_Num,
9236 Element => Entity_Id,
9237 No_Element => Empty,
9239 Hash => New_Copy_Hash,
9240 Equal => Types."=");
9242 -- Start of processing for New_Copy_Tree function
9244 function New_Copy_Tree
9246 Map : Elist_Id := No_Elist;
9247 New_Sloc : Source_Ptr := No_Location;
9248 New_Scope : Entity_Id := Empty) return Node_Id
9250 Actual_Map : Elist_Id := Map;
9251 -- This is the actual map for the copy. It is initialized with the
9252 -- given elements, and then enlarged as required for Itypes that are
9253 -- copied during the first phase of the copy operation. The visit
9254 -- procedures add elements to this map as Itypes are encountered.
9255 -- The reason we cannot use Map directly, is that it may well be
9256 -- (and normally is) initialized to No_Elist, and if we have mapped
9257 -- entities, we have to reset it to point to a real Elist.
9259 function Assoc (N : Node_Or_Entity_Id) return Node_Id;
9260 -- Called during second phase to map entities into their corresponding
9261 -- copies using Actual_Map. If the argument is not an entity, or is not
9262 -- in Actual_Map, then it is returned unchanged.
9264 procedure Build_NCT_Hash_Tables;
9265 -- Builds hash tables (number of elements >= threshold value)
9267 function Copy_Elist_With_Replacement
9268 (Old_Elist : Elist_Id) return Elist_Id;
9269 -- Called during second phase to copy element list doing replacements
9271 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
9272 -- Called during the second phase to process a copied Itype. The actual
9273 -- copy happened during the first phase (so that we could make the entry
9274 -- in the mapping), but we still have to deal with the descendents of
9275 -- the copied Itype and copy them where necessary.
9277 function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
9278 -- Called during second phase to copy list doing replacements
9280 function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
9281 -- Called during second phase to copy node doing replacements
9283 procedure Visit_Elist (E : Elist_Id);
9284 -- Called during first phase to visit all elements of an Elist
9286 procedure Visit_Field (F : Union_Id; N : Node_Id);
9287 -- Visit a single field, recursing to call Visit_Node or Visit_List
9288 -- if the field is a syntactic descendent of the current node (i.e.
9289 -- its parent is Node N).
9291 procedure Visit_Itype (Old_Itype : Entity_Id);
9292 -- Called during first phase to visit subsidiary fields of a defining
9293 -- Itype, and also create a copy and make an entry in the replacement
9294 -- map for the new copy.
9296 procedure Visit_List (L : List_Id);
9297 -- Called during first phase to visit all elements of a List
9299 procedure Visit_Node (N : Node_Or_Entity_Id);
9300 -- Called during first phase to visit a node and all its subtrees
9306 function Assoc (N : Node_Or_Entity_Id) return Node_Id is
9311 if not Has_Extension (N) or else No (Actual_Map) then
9314 elsif NCT_Hash_Tables_Used then
9315 Ent := NCT_Assoc.Get (Entity_Id (N));
9317 if Present (Ent) then
9323 -- No hash table used, do serial search
9326 E := First_Elmt (Actual_Map);
9327 while Present (E) loop
9328 if Node (E) = N then
9329 return Node (Next_Elmt (E));
9331 E := Next_Elmt (Next_Elmt (E));
9339 ---------------------------
9340 -- Build_NCT_Hash_Tables --
9341 ---------------------------
9343 procedure Build_NCT_Hash_Tables is
9347 if NCT_Hash_Table_Setup then
9349 NCT_Itype_Assoc.Reset;
9352 Elmt := First_Elmt (Actual_Map);
9353 while Present (Elmt) loop
9356 -- Get new entity, and associate old and new
9359 NCT_Assoc.Set (Ent, Node (Elmt));
9361 if Is_Type (Ent) then
9363 Anode : constant Entity_Id :=
9364 Associated_Node_For_Itype (Ent);
9367 if Present (Anode) then
9369 -- Enter a link between the associated node of the
9370 -- old Itype and the new Itype, for updating later
9371 -- when node is copied.
9373 NCT_Itype_Assoc.Set (Anode, Node (Elmt));
9381 NCT_Hash_Tables_Used := True;
9382 NCT_Hash_Table_Setup := True;
9383 end Build_NCT_Hash_Tables;
9385 ---------------------------------
9386 -- Copy_Elist_With_Replacement --
9387 ---------------------------------
9389 function Copy_Elist_With_Replacement
9390 (Old_Elist : Elist_Id) return Elist_Id
9393 New_Elist : Elist_Id;
9396 if No (Old_Elist) then
9400 New_Elist := New_Elmt_List;
9402 M := First_Elmt (Old_Elist);
9403 while Present (M) loop
9404 Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
9410 end Copy_Elist_With_Replacement;
9412 ---------------------------------
9413 -- Copy_Itype_With_Replacement --
9414 ---------------------------------
9416 -- This routine exactly parallels its phase one analog Visit_Itype,
9418 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
9420 -- Translate Next_Entity, Scope and Etype fields, in case they
9421 -- reference entities that have been mapped into copies.
9423 Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
9424 Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
9426 if Present (New_Scope) then
9427 Set_Scope (New_Itype, New_Scope);
9429 Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
9432 -- Copy referenced fields
9434 if Is_Discrete_Type (New_Itype) then
9435 Set_Scalar_Range (New_Itype,
9436 Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
9438 elsif Has_Discriminants (Base_Type (New_Itype)) then
9439 Set_Discriminant_Constraint (New_Itype,
9440 Copy_Elist_With_Replacement
9441 (Discriminant_Constraint (New_Itype)));
9443 elsif Is_Array_Type (New_Itype) then
9444 if Present (First_Index (New_Itype)) then
9445 Set_First_Index (New_Itype,
9446 First (Copy_List_With_Replacement
9447 (List_Containing (First_Index (New_Itype)))));
9450 if Is_Packed (New_Itype) then
9451 Set_Packed_Array_Type (New_Itype,
9452 Copy_Node_With_Replacement
9453 (Packed_Array_Type (New_Itype)));
9456 end Copy_Itype_With_Replacement;
9458 --------------------------------
9459 -- Copy_List_With_Replacement --
9460 --------------------------------
9462 function Copy_List_With_Replacement
9463 (Old_List : List_Id) return List_Id
9469 if Old_List = No_List then
9473 New_List := Empty_List;
9475 E := First (Old_List);
9476 while Present (E) loop
9477 Append (Copy_Node_With_Replacement (E), New_List);
9483 end Copy_List_With_Replacement;
9485 --------------------------------
9486 -- Copy_Node_With_Replacement --
9487 --------------------------------
9489 function Copy_Node_With_Replacement
9490 (Old_Node : Node_Id) return Node_Id
9494 procedure Adjust_Named_Associations
9495 (Old_Node : Node_Id;
9496 New_Node : Node_Id);
9497 -- If a call node has named associations, these are chained through
9498 -- the First_Named_Actual, Next_Named_Actual links. These must be
9499 -- propagated separately to the new parameter list, because these
9500 -- are not syntactic fields.
9502 function Copy_Field_With_Replacement
9503 (Field : Union_Id) return Union_Id;
9504 -- Given Field, which is a field of Old_Node, return a copy of it
9505 -- if it is a syntactic field (i.e. its parent is Node), setting
9506 -- the parent of the copy to poit to New_Node. Otherwise returns
9507 -- the field (possibly mapped if it is an entity).
9509 -------------------------------
9510 -- Adjust_Named_Associations --
9511 -------------------------------
9513 procedure Adjust_Named_Associations
9514 (Old_Node : Node_Id;
9524 Old_E := First (Parameter_Associations (Old_Node));
9525 New_E := First (Parameter_Associations (New_Node));
9526 while Present (Old_E) loop
9527 if Nkind (Old_E) = N_Parameter_Association
9528 and then Present (Next_Named_Actual (Old_E))
9530 if First_Named_Actual (Old_Node)
9531 = Explicit_Actual_Parameter (Old_E)
9533 Set_First_Named_Actual
9534 (New_Node, Explicit_Actual_Parameter (New_E));
9537 -- Now scan parameter list from the beginning,to locate
9538 -- next named actual, which can be out of order.
9540 Old_Next := First (Parameter_Associations (Old_Node));
9541 New_Next := First (Parameter_Associations (New_Node));
9543 while Nkind (Old_Next) /= N_Parameter_Association
9544 or else Explicit_Actual_Parameter (Old_Next)
9545 /= Next_Named_Actual (Old_E)
9551 Set_Next_Named_Actual
9552 (New_E, Explicit_Actual_Parameter (New_Next));
9558 end Adjust_Named_Associations;
9560 ---------------------------------
9561 -- Copy_Field_With_Replacement --
9562 ---------------------------------
9564 function Copy_Field_With_Replacement
9565 (Field : Union_Id) return Union_Id
9568 if Field = Union_Id (Empty) then
9571 elsif Field in Node_Range then
9573 Old_N : constant Node_Id := Node_Id (Field);
9577 -- If syntactic field, as indicated by the parent pointer
9578 -- being set, then copy the referenced node recursively.
9580 if Parent (Old_N) = Old_Node then
9581 New_N := Copy_Node_With_Replacement (Old_N);
9583 if New_N /= Old_N then
9584 Set_Parent (New_N, New_Node);
9587 -- For semantic fields, update possible entity reference
9588 -- from the replacement map.
9591 New_N := Assoc (Old_N);
9594 return Union_Id (New_N);
9597 elsif Field in List_Range then
9599 Old_L : constant List_Id := List_Id (Field);
9603 -- If syntactic field, as indicated by the parent pointer,
9604 -- then recursively copy the entire referenced list.
9606 if Parent (Old_L) = Old_Node then
9607 New_L := Copy_List_With_Replacement (Old_L);
9608 Set_Parent (New_L, New_Node);
9610 -- For semantic list, just returned unchanged
9616 return Union_Id (New_L);
9619 -- Anything other than a list or a node is returned unchanged
9624 end Copy_Field_With_Replacement;
9626 -- Start of processing for Copy_Node_With_Replacement
9629 if Old_Node <= Empty_Or_Error then
9632 elsif Has_Extension (Old_Node) then
9633 return Assoc (Old_Node);
9636 New_Node := New_Copy (Old_Node);
9638 -- If the node we are copying is the associated node of a
9639 -- previously copied Itype, then adjust the associated node
9640 -- of the copy of that Itype accordingly.
9642 if Present (Actual_Map) then
9648 -- Case of hash table used
9650 if NCT_Hash_Tables_Used then
9651 Ent := NCT_Itype_Assoc.Get (Old_Node);
9653 if Present (Ent) then
9654 Set_Associated_Node_For_Itype (Ent, New_Node);
9657 -- Case of no hash table used
9660 E := First_Elmt (Actual_Map);
9661 while Present (E) loop
9662 if Is_Itype (Node (E))
9664 Old_Node = Associated_Node_For_Itype (Node (E))
9666 Set_Associated_Node_For_Itype
9667 (Node (Next_Elmt (E)), New_Node);
9670 E := Next_Elmt (Next_Elmt (E));
9676 -- Recursively copy descendents
9679 (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
9681 (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
9683 (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
9685 (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
9687 (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
9689 -- Adjust Sloc of new node if necessary
9691 if New_Sloc /= No_Location then
9692 Set_Sloc (New_Node, New_Sloc);
9694 -- If we adjust the Sloc, then we are essentially making
9695 -- a completely new node, so the Comes_From_Source flag
9696 -- should be reset to the proper default value.
9698 Nodes.Table (New_Node).Comes_From_Source :=
9699 Default_Node.Comes_From_Source;
9702 -- If the node is call and has named associations,
9703 -- set the corresponding links in the copy.
9705 if (Nkind (Old_Node) = N_Function_Call
9706 or else Nkind (Old_Node) = N_Entry_Call_Statement
9708 Nkind (Old_Node) = N_Procedure_Call_Statement)
9709 and then Present (First_Named_Actual (Old_Node))
9711 Adjust_Named_Associations (Old_Node, New_Node);
9714 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
9715 -- The replacement mechanism applies to entities, and is not used
9716 -- here. Eventually we may need a more general graph-copying
9717 -- routine. For now, do a sequential search to find desired node.
9719 if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
9720 and then Present (First_Real_Statement (Old_Node))
9723 Old_F : constant Node_Id := First_Real_Statement (Old_Node);
9727 N1 := First (Statements (Old_Node));
9728 N2 := First (Statements (New_Node));
9730 while N1 /= Old_F loop
9735 Set_First_Real_Statement (New_Node, N2);
9740 -- All done, return copied node
9743 end Copy_Node_With_Replacement;
9749 procedure Visit_Elist (E : Elist_Id) is
9753 Elmt := First_Elmt (E);
9755 while Elmt /= No_Elmt loop
9756 Visit_Node (Node (Elmt));
9766 procedure Visit_Field (F : Union_Id; N : Node_Id) is
9768 if F = Union_Id (Empty) then
9771 elsif F in Node_Range then
9773 -- Copy node if it is syntactic, i.e. its parent pointer is
9774 -- set to point to the field that referenced it (certain
9775 -- Itypes will also meet this criterion, which is fine, since
9776 -- these are clearly Itypes that do need to be copied, since
9777 -- we are copying their parent.)
9779 if Parent (Node_Id (F)) = N then
9780 Visit_Node (Node_Id (F));
9783 -- Another case, if we are pointing to an Itype, then we want
9784 -- to copy it if its associated node is somewhere in the tree
9787 -- Note: the exclusion of self-referential copies is just an
9788 -- optimization, since the search of the already copied list
9789 -- would catch it, but it is a common case (Etype pointing
9790 -- to itself for an Itype that is a base type).
9792 elsif Has_Extension (Node_Id (F))
9793 and then Is_Itype (Entity_Id (F))
9794 and then Node_Id (F) /= N
9800 P := Associated_Node_For_Itype (Node_Id (F));
9801 while Present (P) loop
9803 Visit_Node (Node_Id (F));
9810 -- An Itype whose parent is not being copied definitely
9811 -- should NOT be copied, since it does not belong in any
9812 -- sense to the copied subtree.
9818 elsif F in List_Range
9819 and then Parent (List_Id (F)) = N
9821 Visit_List (List_Id (F));
9830 procedure Visit_Itype (Old_Itype : Entity_Id) is
9831 New_Itype : Entity_Id;
9836 -- Itypes that describe the designated type of access to subprograms
9837 -- have the structure of subprogram declarations, with signatures,
9838 -- etc. Either we duplicate the signatures completely, or choose to
9839 -- share such itypes, which is fine because their elaboration will
9840 -- have no side effects.
9842 if Ekind (Old_Itype) = E_Subprogram_Type then
9846 New_Itype := New_Copy (Old_Itype);
9848 -- The new Itype has all the attributes of the old one, and
9849 -- we just copy the contents of the entity. However, the back-end
9850 -- needs different names for debugging purposes, so we create a
9851 -- new internal name for it in all cases.
9853 Set_Chars (New_Itype, New_Internal_Name ('T'));
9855 -- If our associated node is an entity that has already been copied,
9856 -- then set the associated node of the copy to point to the right
9857 -- copy. If we have copied an Itype that is itself the associated
9858 -- node of some previously copied Itype, then we set the right
9859 -- pointer in the other direction.
9861 if Present (Actual_Map) then
9863 -- Case of hash tables used
9865 if NCT_Hash_Tables_Used then
9867 Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
9869 if Present (Ent) then
9870 Set_Associated_Node_For_Itype (New_Itype, Ent);
9873 Ent := NCT_Itype_Assoc.Get (Old_Itype);
9874 if Present (Ent) then
9875 Set_Associated_Node_For_Itype (Ent, New_Itype);
9877 -- If the hash table has no association for this Itype and
9878 -- its associated node, enter one now.
9882 (Associated_Node_For_Itype (Old_Itype), New_Itype);
9885 -- Case of hash tables not used
9888 E := First_Elmt (Actual_Map);
9889 while Present (E) loop
9890 if Associated_Node_For_Itype (Old_Itype) = Node (E) then
9891 Set_Associated_Node_For_Itype
9892 (New_Itype, Node (Next_Elmt (E)));
9895 if Is_Type (Node (E))
9897 Old_Itype = Associated_Node_For_Itype (Node (E))
9899 Set_Associated_Node_For_Itype
9900 (Node (Next_Elmt (E)), New_Itype);
9903 E := Next_Elmt (Next_Elmt (E));
9908 if Present (Freeze_Node (New_Itype)) then
9909 Set_Is_Frozen (New_Itype, False);
9910 Set_Freeze_Node (New_Itype, Empty);
9913 -- Add new association to map
9915 if No (Actual_Map) then
9916 Actual_Map := New_Elmt_List;
9919 Append_Elmt (Old_Itype, Actual_Map);
9920 Append_Elmt (New_Itype, Actual_Map);
9922 if NCT_Hash_Tables_Used then
9923 NCT_Assoc.Set (Old_Itype, New_Itype);
9926 NCT_Table_Entries := NCT_Table_Entries + 1;
9928 if NCT_Table_Entries > NCT_Hash_Threshold then
9929 Build_NCT_Hash_Tables;
9933 -- If a record subtype is simply copied, the entity list will be
9934 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
9936 if Ekind_In (Old_Itype, E_Record_Subtype, E_Class_Wide_Subtype) then
9937 Set_Cloned_Subtype (New_Itype, Old_Itype);
9940 -- Visit descendents that eventually get copied
9942 Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
9944 if Is_Discrete_Type (Old_Itype) then
9945 Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
9947 elsif Has_Discriminants (Base_Type (Old_Itype)) then
9948 -- ??? This should involve call to Visit_Field
9949 Visit_Elist (Discriminant_Constraint (Old_Itype));
9951 elsif Is_Array_Type (Old_Itype) then
9952 if Present (First_Index (Old_Itype)) then
9953 Visit_Field (Union_Id (List_Containing
9954 (First_Index (Old_Itype))),
9958 if Is_Packed (Old_Itype) then
9959 Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)),
9969 procedure Visit_List (L : List_Id) is
9972 if L /= No_List then
9975 while Present (N) loop
9986 procedure Visit_Node (N : Node_Or_Entity_Id) is
9988 -- Start of processing for Visit_Node
9991 -- Handle case of an Itype, which must be copied
9993 if Has_Extension (N)
9994 and then Is_Itype (N)
9996 -- Nothing to do if already in the list. This can happen with an
9997 -- Itype entity that appears more than once in the tree.
9998 -- Note that we do not want to visit descendents in this case.
10000 -- Test for already in list when hash table is used
10002 if NCT_Hash_Tables_Used then
10003 if Present (NCT_Assoc.Get (Entity_Id (N))) then
10007 -- Test for already in list when hash table not used
10013 if Present (Actual_Map) then
10014 E := First_Elmt (Actual_Map);
10015 while Present (E) loop
10016 if Node (E) = N then
10019 E := Next_Elmt (Next_Elmt (E));
10029 -- Visit descendents
10031 Visit_Field (Field1 (N), N);
10032 Visit_Field (Field2 (N), N);
10033 Visit_Field (Field3 (N), N);
10034 Visit_Field (Field4 (N), N);
10035 Visit_Field (Field5 (N), N);
10038 -- Start of processing for New_Copy_Tree
10043 -- See if we should use hash table
10045 if No (Actual_Map) then
10046 NCT_Hash_Tables_Used := False;
10053 NCT_Table_Entries := 0;
10055 Elmt := First_Elmt (Actual_Map);
10056 while Present (Elmt) loop
10057 NCT_Table_Entries := NCT_Table_Entries + 1;
10062 if NCT_Table_Entries > NCT_Hash_Threshold then
10063 Build_NCT_Hash_Tables;
10065 NCT_Hash_Tables_Used := False;
10070 -- Hash table set up if required, now start phase one by visiting
10071 -- top node (we will recursively visit the descendents).
10073 Visit_Node (Source);
10075 -- Now the second phase of the copy can start. First we process
10076 -- all the mapped entities, copying their descendents.
10078 if Present (Actual_Map) then
10081 New_Itype : Entity_Id;
10083 Elmt := First_Elmt (Actual_Map);
10084 while Present (Elmt) loop
10086 New_Itype := Node (Elmt);
10087 Copy_Itype_With_Replacement (New_Itype);
10093 -- Now we can copy the actual tree
10095 return Copy_Node_With_Replacement (Source);
10098 -------------------------
10099 -- New_External_Entity --
10100 -------------------------
10102 function New_External_Entity
10103 (Kind : Entity_Kind;
10104 Scope_Id : Entity_Id;
10105 Sloc_Value : Source_Ptr;
10106 Related_Id : Entity_Id;
10107 Suffix : Character;
10108 Suffix_Index : Nat := 0;
10109 Prefix : Character := ' ') return Entity_Id
10111 N : constant Entity_Id :=
10112 Make_Defining_Identifier (Sloc_Value,
10114 (Chars (Related_Id), Suffix, Suffix_Index, Prefix));
10117 Set_Ekind (N, Kind);
10118 Set_Is_Internal (N, True);
10119 Append_Entity (N, Scope_Id);
10120 Set_Public_Status (N);
10122 if Kind in Type_Kind then
10123 Init_Size_Align (N);
10127 end New_External_Entity;
10129 -------------------------
10130 -- New_Internal_Entity --
10131 -------------------------
10133 function New_Internal_Entity
10134 (Kind : Entity_Kind;
10135 Scope_Id : Entity_Id;
10136 Sloc_Value : Source_Ptr;
10137 Id_Char : Character) return Entity_Id
10139 N : constant Entity_Id := Make_Temporary (Sloc_Value, Id_Char);
10142 Set_Ekind (N, Kind);
10143 Set_Is_Internal (N, True);
10144 Append_Entity (N, Scope_Id);
10146 if Kind in Type_Kind then
10147 Init_Size_Align (N);
10151 end New_Internal_Entity;
10157 function Next_Actual (Actual_Id : Node_Id) return Node_Id is
10161 -- If we are pointing at a positional parameter, it is a member of a
10162 -- node list (the list of parameters), and the next parameter is the
10163 -- next node on the list, unless we hit a parameter association, then
10164 -- we shift to using the chain whose head is the First_Named_Actual in
10165 -- the parent, and then is threaded using the Next_Named_Actual of the
10166 -- Parameter_Association. All this fiddling is because the original node
10167 -- list is in the textual call order, and what we need is the
10168 -- declaration order.
10170 if Is_List_Member (Actual_Id) then
10171 N := Next (Actual_Id);
10173 if Nkind (N) = N_Parameter_Association then
10174 return First_Named_Actual (Parent (Actual_Id));
10180 return Next_Named_Actual (Parent (Actual_Id));
10184 procedure Next_Actual (Actual_Id : in out Node_Id) is
10186 Actual_Id := Next_Actual (Actual_Id);
10189 -----------------------
10190 -- Normalize_Actuals --
10191 -----------------------
10193 -- Chain actuals according to formals of subprogram. If there are no named
10194 -- associations, the chain is simply the list of Parameter Associations,
10195 -- since the order is the same as the declaration order. If there are named
10196 -- associations, then the First_Named_Actual field in the N_Function_Call
10197 -- or N_Procedure_Call_Statement node points to the Parameter_Association
10198 -- node for the parameter that comes first in declaration order. The
10199 -- remaining named parameters are then chained in declaration order using
10200 -- Next_Named_Actual.
10202 -- This routine also verifies that the number of actuals is compatible with
10203 -- the number and default values of formals, but performs no type checking
10204 -- (type checking is done by the caller).
10206 -- If the matching succeeds, Success is set to True and the caller proceeds
10207 -- with type-checking. If the match is unsuccessful, then Success is set to
10208 -- False, and the caller attempts a different interpretation, if there is
10211 -- If the flag Report is on, the call is not overloaded, and a failure to
10212 -- match can be reported here, rather than in the caller.
10214 procedure Normalize_Actuals
10218 Success : out Boolean)
10220 Actuals : constant List_Id := Parameter_Associations (N);
10221 Actual : Node_Id := Empty;
10222 Formal : Entity_Id;
10223 Last : Node_Id := Empty;
10224 First_Named : Node_Id := Empty;
10227 Formals_To_Match : Integer := 0;
10228 Actuals_To_Match : Integer := 0;
10230 procedure Chain (A : Node_Id);
10231 -- Add named actual at the proper place in the list, using the
10232 -- Next_Named_Actual link.
10234 function Reporting return Boolean;
10235 -- Determines if an error is to be reported. To report an error, we
10236 -- need Report to be True, and also we do not report errors caused
10237 -- by calls to init procs that occur within other init procs. Such
10238 -- errors must always be cascaded errors, since if all the types are
10239 -- declared correctly, the compiler will certainly build decent calls!
10245 procedure Chain (A : Node_Id) is
10249 -- Call node points to first actual in list
10251 Set_First_Named_Actual (N, Explicit_Actual_Parameter (A));
10254 Set_Next_Named_Actual (Last, Explicit_Actual_Parameter (A));
10258 Set_Next_Named_Actual (Last, Empty);
10265 function Reporting return Boolean is
10270 elsif not Within_Init_Proc then
10273 elsif Is_Init_Proc (Entity (Name (N))) then
10281 -- Start of processing for Normalize_Actuals
10284 if Is_Access_Type (S) then
10286 -- The name in the call is a function call that returns an access
10287 -- to subprogram. The designated type has the list of formals.
10289 Formal := First_Formal (Designated_Type (S));
10291 Formal := First_Formal (S);
10294 while Present (Formal) loop
10295 Formals_To_Match := Formals_To_Match + 1;
10296 Next_Formal (Formal);
10299 -- Find if there is a named association, and verify that no positional
10300 -- associations appear after named ones.
10302 if Present (Actuals) then
10303 Actual := First (Actuals);
10306 while Present (Actual)
10307 and then Nkind (Actual) /= N_Parameter_Association
10309 Actuals_To_Match := Actuals_To_Match + 1;
10313 if No (Actual) and Actuals_To_Match = Formals_To_Match then
10315 -- Most common case: positional notation, no defaults
10320 elsif Actuals_To_Match > Formals_To_Match then
10322 -- Too many actuals: will not work
10325 if Is_Entity_Name (Name (N)) then
10326 Error_Msg_N ("too many arguments in call to&", Name (N));
10328 Error_Msg_N ("too many arguments in call", N);
10336 First_Named := Actual;
10338 while Present (Actual) loop
10339 if Nkind (Actual) /= N_Parameter_Association then
10341 ("positional parameters not allowed after named ones", Actual);
10346 Actuals_To_Match := Actuals_To_Match + 1;
10352 if Present (Actuals) then
10353 Actual := First (Actuals);
10356 Formal := First_Formal (S);
10357 while Present (Formal) loop
10359 -- Match the formals in order. If the corresponding actual is
10360 -- positional, nothing to do. Else scan the list of named actuals
10361 -- to find the one with the right name.
10363 if Present (Actual)
10364 and then Nkind (Actual) /= N_Parameter_Association
10367 Actuals_To_Match := Actuals_To_Match - 1;
10368 Formals_To_Match := Formals_To_Match - 1;
10371 -- For named parameters, search the list of actuals to find
10372 -- one that matches the next formal name.
10374 Actual := First_Named;
10376 while Present (Actual) loop
10377 if Chars (Selector_Name (Actual)) = Chars (Formal) then
10380 Actuals_To_Match := Actuals_To_Match - 1;
10381 Formals_To_Match := Formals_To_Match - 1;
10389 if Ekind (Formal) /= E_In_Parameter
10390 or else No (Default_Value (Formal))
10393 if (Comes_From_Source (S)
10394 or else Sloc (S) = Standard_Location)
10395 and then Is_Overloadable (S)
10399 (Nkind (Parent (N)) = N_Procedure_Call_Statement
10401 (Nkind (Parent (N)) = N_Function_Call
10403 Nkind (Parent (N)) = N_Parameter_Association))
10404 and then Ekind (S) /= E_Function
10406 Set_Etype (N, Etype (S));
10408 Error_Msg_Name_1 := Chars (S);
10409 Error_Msg_Sloc := Sloc (S);
10411 ("missing argument for parameter & " &
10412 "in call to % declared #", N, Formal);
10415 elsif Is_Overloadable (S) then
10416 Error_Msg_Name_1 := Chars (S);
10418 -- Point to type derivation that generated the
10421 Error_Msg_Sloc := Sloc (Parent (S));
10424 ("missing argument for parameter & " &
10425 "in call to % (inherited) #", N, Formal);
10429 ("missing argument for parameter &", N, Formal);
10437 Formals_To_Match := Formals_To_Match - 1;
10442 Next_Formal (Formal);
10445 if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
10452 -- Find some superfluous named actual that did not get
10453 -- attached to the list of associations.
10455 Actual := First (Actuals);
10456 while Present (Actual) loop
10457 if Nkind (Actual) = N_Parameter_Association
10458 and then Actual /= Last
10459 and then No (Next_Named_Actual (Actual))
10461 Error_Msg_N ("unmatched actual & in call",
10462 Selector_Name (Actual));
10473 end Normalize_Actuals;
10475 --------------------------------
10476 -- Note_Possible_Modification --
10477 --------------------------------
10479 procedure Note_Possible_Modification (N : Node_Id; Sure : Boolean) is
10480 Modification_Comes_From_Source : constant Boolean :=
10481 Comes_From_Source (Parent (N));
10487 -- Loop to find referenced entity, if there is one
10494 if Is_Entity_Name (Exp) then
10495 Ent := Entity (Exp);
10497 -- If the entity is missing, it is an undeclared identifier,
10498 -- and there is nothing to annotate.
10504 elsif Nkind (Exp) = N_Explicit_Dereference then
10506 P : constant Node_Id := Prefix (Exp);
10509 if Nkind (P) = N_Selected_Component
10511 Entry_Formal (Entity (Selector_Name (P))))
10513 -- Case of a reference to an entry formal
10515 Ent := Entry_Formal (Entity (Selector_Name (P)));
10517 elsif Nkind (P) = N_Identifier
10518 and then Nkind (Parent (Entity (P))) = N_Object_Declaration
10519 and then Present (Expression (Parent (Entity (P))))
10520 and then Nkind (Expression (Parent (Entity (P))))
10523 -- Case of a reference to a value on which side effects have
10526 Exp := Prefix (Expression (Parent (Entity (P))));
10535 elsif Nkind (Exp) = N_Type_Conversion
10536 or else Nkind (Exp) = N_Unchecked_Type_Conversion
10538 Exp := Expression (Exp);
10541 elsif Nkind (Exp) = N_Slice
10542 or else Nkind (Exp) = N_Indexed_Component
10543 or else Nkind (Exp) = N_Selected_Component
10545 Exp := Prefix (Exp);
10552 -- Now look for entity being referenced
10554 if Present (Ent) then
10555 if Is_Object (Ent) then
10556 if Comes_From_Source (Exp)
10557 or else Modification_Comes_From_Source
10559 -- Give warning if pragma unmodified given and we are
10560 -- sure this is a modification.
10562 if Has_Pragma_Unmodified (Ent) and then Sure then
10563 Error_Msg_NE ("?pragma Unmodified given for &!", N, Ent);
10566 Set_Never_Set_In_Source (Ent, False);
10569 Set_Is_True_Constant (Ent, False);
10570 Set_Current_Value (Ent, Empty);
10571 Set_Is_Known_Null (Ent, False);
10573 if not Can_Never_Be_Null (Ent) then
10574 Set_Is_Known_Non_Null (Ent, False);
10577 -- Follow renaming chain
10579 if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
10580 and then Present (Renamed_Object (Ent))
10582 Exp := Renamed_Object (Ent);
10586 -- Generate a reference only if the assignment comes from
10587 -- source. This excludes, for example, calls to a dispatching
10588 -- assignment operation when the left-hand side is tagged.
10590 if Modification_Comes_From_Source then
10591 Generate_Reference (Ent, Exp, 'm');
10593 -- If the target of the assignment is the bound variable
10594 -- in an iterator, indicate that the corresponding array
10595 -- or container is also modified.
10597 if Ada_Version >= Ada_2012
10599 Nkind (Parent (Ent)) = N_Iterator_Specification
10602 Domain : constant Node_Id := Name (Parent (Ent));
10605 -- TBD : in the full version of the construct, the
10606 -- domain of iteration can be given by an expression.
10608 if Is_Entity_Name (Domain) then
10609 Generate_Reference (Entity (Domain), Exp, 'm');
10610 Set_Is_True_Constant (Entity (Domain), False);
10611 Set_Never_Set_In_Source (Entity (Domain), False);
10617 Check_Nested_Access (Ent);
10622 -- If we are sure this is a modification from source, and we know
10623 -- this modifies a constant, then give an appropriate warning.
10625 if Overlays_Constant (Ent)
10626 and then Modification_Comes_From_Source
10630 A : constant Node_Id := Address_Clause (Ent);
10632 if Present (A) then
10634 Exp : constant Node_Id := Expression (A);
10636 if Nkind (Exp) = N_Attribute_Reference
10637 and then Attribute_Name (Exp) = Name_Address
10638 and then Is_Entity_Name (Prefix (Exp))
10640 Error_Msg_Sloc := Sloc (A);
10642 ("constant& may be modified via address clause#?",
10643 N, Entity (Prefix (Exp)));
10653 end Note_Possible_Modification;
10655 -------------------------
10656 -- Object_Access_Level --
10657 -------------------------
10659 function Object_Access_Level (Obj : Node_Id) return Uint is
10662 -- Returns the static accessibility level of the view denoted by Obj. Note
10663 -- that the value returned is the result of a call to Scope_Depth. Only
10664 -- scope depths associated with dynamic scopes can actually be returned.
10665 -- Since only relative levels matter for accessibility checking, the fact
10666 -- that the distance between successive levels of accessibility is not
10667 -- always one is immaterial (invariant: if level(E2) is deeper than
10668 -- level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
10670 function Reference_To (Obj : Node_Id) return Node_Id;
10671 -- An explicit dereference is created when removing side-effects from
10672 -- expressions for constraint checking purposes. In this case a local
10673 -- access type is created for it. The correct access level is that of
10674 -- the original source node. We detect this case by noting that the
10675 -- prefix of the dereference is created by an object declaration whose
10676 -- initial expression is a reference.
10682 function Reference_To (Obj : Node_Id) return Node_Id is
10683 Pref : constant Node_Id := Prefix (Obj);
10685 if Is_Entity_Name (Pref)
10686 and then Nkind (Parent (Entity (Pref))) = N_Object_Declaration
10687 and then Present (Expression (Parent (Entity (Pref))))
10688 and then Nkind (Expression (Parent (Entity (Pref)))) = N_Reference
10690 return (Prefix (Expression (Parent (Entity (Pref)))));
10696 -- Start of processing for Object_Access_Level
10699 if Is_Entity_Name (Obj) then
10702 if Is_Prival (E) then
10703 E := Prival_Link (E);
10706 -- If E is a type then it denotes a current instance. For this case
10707 -- we add one to the normal accessibility level of the type to ensure
10708 -- that current instances are treated as always being deeper than
10709 -- than the level of any visible named access type (see 3.10.2(21)).
10711 if Is_Type (E) then
10712 return Type_Access_Level (E) + 1;
10714 elsif Present (Renamed_Object (E)) then
10715 return Object_Access_Level (Renamed_Object (E));
10717 -- Similarly, if E is a component of the current instance of a
10718 -- protected type, any instance of it is assumed to be at a deeper
10719 -- level than the type. For a protected object (whose type is an
10720 -- anonymous protected type) its components are at the same level
10721 -- as the type itself.
10723 elsif not Is_Overloadable (E)
10724 and then Ekind (Scope (E)) = E_Protected_Type
10725 and then Comes_From_Source (Scope (E))
10727 return Type_Access_Level (Scope (E)) + 1;
10730 return Scope_Depth (Enclosing_Dynamic_Scope (E));
10733 elsif Nkind (Obj) = N_Selected_Component then
10734 if Is_Access_Type (Etype (Prefix (Obj))) then
10735 return Type_Access_Level (Etype (Prefix (Obj)));
10737 return Object_Access_Level (Prefix (Obj));
10740 elsif Nkind (Obj) = N_Indexed_Component then
10741 if Is_Access_Type (Etype (Prefix (Obj))) then
10742 return Type_Access_Level (Etype (Prefix (Obj)));
10744 return Object_Access_Level (Prefix (Obj));
10747 elsif Nkind (Obj) = N_Explicit_Dereference then
10749 -- If the prefix is a selected access discriminant then we make a
10750 -- recursive call on the prefix, which will in turn check the level
10751 -- of the prefix object of the selected discriminant.
10753 if Nkind (Prefix (Obj)) = N_Selected_Component
10754 and then Ekind (Etype (Prefix (Obj))) = E_Anonymous_Access_Type
10756 Ekind (Entity (Selector_Name (Prefix (Obj)))) = E_Discriminant
10758 return Object_Access_Level (Prefix (Obj));
10760 elsif not (Comes_From_Source (Obj)) then
10762 Ref : constant Node_Id := Reference_To (Obj);
10764 if Present (Ref) then
10765 return Object_Access_Level (Ref);
10767 return Type_Access_Level (Etype (Prefix (Obj)));
10772 return Type_Access_Level (Etype (Prefix (Obj)));
10775 elsif Nkind (Obj) = N_Type_Conversion
10776 or else Nkind (Obj) = N_Unchecked_Type_Conversion
10778 return Object_Access_Level (Expression (Obj));
10780 elsif Nkind (Obj) = N_Function_Call then
10782 -- Function results are objects, so we get either the access level of
10783 -- the function or, in the case of an indirect call, the level of the
10784 -- access-to-subprogram type. (This code is used for Ada 95, but it
10785 -- looks wrong, because it seems that we should be checking the level
10786 -- of the call itself, even for Ada 95. However, using the Ada 2005
10787 -- version of the code causes regressions in several tests that are
10788 -- compiled with -gnat95. ???)
10790 if Ada_Version < Ada_2005 then
10791 if Is_Entity_Name (Name (Obj)) then
10792 return Subprogram_Access_Level (Entity (Name (Obj)));
10794 return Type_Access_Level (Etype (Prefix (Name (Obj))));
10797 -- For Ada 2005, the level of the result object of a function call is
10798 -- defined to be the level of the call's innermost enclosing master.
10799 -- We determine that by querying the depth of the innermost enclosing
10803 Return_Master_Scope_Depth_Of_Call : declare
10805 function Innermost_Master_Scope_Depth
10806 (N : Node_Id) return Uint;
10807 -- Returns the scope depth of the given node's innermost
10808 -- enclosing dynamic scope (effectively the accessibility
10809 -- level of the innermost enclosing master).
10811 ----------------------------------
10812 -- Innermost_Master_Scope_Depth --
10813 ----------------------------------
10815 function Innermost_Master_Scope_Depth
10816 (N : Node_Id) return Uint
10818 Node_Par : Node_Id := Parent (N);
10821 -- Locate the nearest enclosing node (by traversing Parents)
10822 -- that Defining_Entity can be applied to, and return the
10823 -- depth of that entity's nearest enclosing dynamic scope.
10825 while Present (Node_Par) loop
10826 case Nkind (Node_Par) is
10827 when N_Component_Declaration |
10828 N_Entry_Declaration |
10829 N_Formal_Object_Declaration |
10830 N_Formal_Type_Declaration |
10831 N_Full_Type_Declaration |
10832 N_Incomplete_Type_Declaration |
10833 N_Loop_Parameter_Specification |
10834 N_Object_Declaration |
10835 N_Protected_Type_Declaration |
10836 N_Private_Extension_Declaration |
10837 N_Private_Type_Declaration |
10838 N_Subtype_Declaration |
10839 N_Function_Specification |
10840 N_Procedure_Specification |
10841 N_Task_Type_Declaration |
10843 N_Generic_Instantiation |
10845 N_Implicit_Label_Declaration |
10846 N_Package_Declaration |
10847 N_Single_Task_Declaration |
10848 N_Subprogram_Declaration |
10849 N_Generic_Declaration |
10850 N_Renaming_Declaration |
10851 N_Block_Statement |
10852 N_Formal_Subprogram_Declaration |
10853 N_Abstract_Subprogram_Declaration |
10855 N_Exception_Declaration |
10856 N_Formal_Package_Declaration |
10857 N_Number_Declaration |
10858 N_Package_Specification |
10859 N_Parameter_Specification |
10860 N_Single_Protected_Declaration |
10864 (Nearest_Dynamic_Scope
10865 (Defining_Entity (Node_Par)));
10871 Node_Par := Parent (Node_Par);
10874 pragma Assert (False);
10876 -- Should never reach the following return
10878 return Scope_Depth (Current_Scope) + 1;
10879 end Innermost_Master_Scope_Depth;
10881 -- Start of processing for Return_Master_Scope_Depth_Of_Call
10884 return Innermost_Master_Scope_Depth (Obj);
10885 end Return_Master_Scope_Depth_Of_Call;
10888 -- For convenience we handle qualified expressions, even though
10889 -- they aren't technically object names.
10891 elsif Nkind (Obj) = N_Qualified_Expression then
10892 return Object_Access_Level (Expression (Obj));
10894 -- Otherwise return the scope level of Standard.
10895 -- (If there are cases that fall through
10896 -- to this point they will be treated as
10897 -- having global accessibility for now. ???)
10900 return Scope_Depth (Standard_Standard);
10902 end Object_Access_Level;
10904 --------------------------------------
10905 -- Original_Corresponding_Operation --
10906 --------------------------------------
10908 function Original_Corresponding_Operation (S : Entity_Id) return Entity_Id
10910 Typ : constant Entity_Id := Find_Dispatching_Type (S);
10913 -- If S is an inherited primitive S2 the original corresponding
10914 -- operation of S is the original corresponding operation of S2
10916 if Present (Alias (S))
10917 and then Find_Dispatching_Type (Alias (S)) /= Typ
10919 return Original_Corresponding_Operation (Alias (S));
10921 -- If S overrides an inherited subprogram S2 the original corresponding
10922 -- operation of S is the original corresponding operation of S2
10924 elsif Present (Overridden_Operation (S)) then
10925 return Original_Corresponding_Operation (Overridden_Operation (S));
10927 -- otherwise it is S itself
10932 end Original_Corresponding_Operation;
10934 -----------------------
10935 -- Private_Component --
10936 -----------------------
10938 function Private_Component (Type_Id : Entity_Id) return Entity_Id is
10939 Ancestor : constant Entity_Id := Base_Type (Type_Id);
10941 function Trace_Components
10943 Check : Boolean) return Entity_Id;
10944 -- Recursive function that does the work, and checks against circular
10945 -- definition for each subcomponent type.
10947 ----------------------
10948 -- Trace_Components --
10949 ----------------------
10951 function Trace_Components
10953 Check : Boolean) return Entity_Id
10955 Btype : constant Entity_Id := Base_Type (T);
10956 Component : Entity_Id;
10958 Candidate : Entity_Id := Empty;
10961 if Check and then Btype = Ancestor then
10962 Error_Msg_N ("circular type definition", Type_Id);
10966 if Is_Private_Type (Btype)
10967 and then not Is_Generic_Type (Btype)
10969 if Present (Full_View (Btype))
10970 and then Is_Record_Type (Full_View (Btype))
10971 and then not Is_Frozen (Btype)
10973 -- To indicate that the ancestor depends on a private type, the
10974 -- current Btype is sufficient. However, to check for circular
10975 -- definition we must recurse on the full view.
10977 Candidate := Trace_Components (Full_View (Btype), True);
10979 if Candidate = Any_Type then
10989 elsif Is_Array_Type (Btype) then
10990 return Trace_Components (Component_Type (Btype), True);
10992 elsif Is_Record_Type (Btype) then
10993 Component := First_Entity (Btype);
10994 while Present (Component)
10995 and then Comes_From_Source (Component)
10997 -- Skip anonymous types generated by constrained components
10999 if not Is_Type (Component) then
11000 P := Trace_Components (Etype (Component), True);
11002 if Present (P) then
11003 if P = Any_Type then
11011 Next_Entity (Component);
11019 end Trace_Components;
11021 -- Start of processing for Private_Component
11024 return Trace_Components (Type_Id, False);
11025 end Private_Component;
11027 ---------------------------
11028 -- Primitive_Names_Match --
11029 ---------------------------
11031 function Primitive_Names_Match (E1, E2 : Entity_Id) return Boolean is
11033 function Non_Internal_Name (E : Entity_Id) return Name_Id;
11034 -- Given an internal name, returns the corresponding non-internal name
11036 ------------------------
11037 -- Non_Internal_Name --
11038 ------------------------
11040 function Non_Internal_Name (E : Entity_Id) return Name_Id is
11042 Get_Name_String (Chars (E));
11043 Name_Len := Name_Len - 1;
11045 end Non_Internal_Name;
11047 -- Start of processing for Primitive_Names_Match
11050 pragma Assert (Present (E1) and then Present (E2));
11052 return Chars (E1) = Chars (E2)
11054 (not Is_Internal_Name (Chars (E1))
11055 and then Is_Internal_Name (Chars (E2))
11056 and then Non_Internal_Name (E2) = Chars (E1))
11058 (not Is_Internal_Name (Chars (E2))
11059 and then Is_Internal_Name (Chars (E1))
11060 and then Non_Internal_Name (E1) = Chars (E2))
11062 (Is_Predefined_Dispatching_Operation (E1)
11063 and then Is_Predefined_Dispatching_Operation (E2)
11064 and then Same_TSS (E1, E2))
11066 (Is_Init_Proc (E1) and then Is_Init_Proc (E2));
11067 end Primitive_Names_Match;
11069 -----------------------
11070 -- Process_End_Label --
11071 -----------------------
11073 procedure Process_End_Label
11082 Label_Ref : Boolean;
11083 -- Set True if reference to end label itself is required
11086 -- Gets set to the operator symbol or identifier that references the
11087 -- entity Ent. For the child unit case, this is the identifier from the
11088 -- designator. For other cases, this is simply Endl.
11090 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id);
11091 -- N is an identifier node that appears as a parent unit reference in
11092 -- the case where Ent is a child unit. This procedure generates an
11093 -- appropriate cross-reference entry. E is the corresponding entity.
11095 -------------------------
11096 -- Generate_Parent_Ref --
11097 -------------------------
11099 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id) is
11101 -- If names do not match, something weird, skip reference
11103 if Chars (E) = Chars (N) then
11105 -- Generate the reference. We do NOT consider this as a reference
11106 -- for unreferenced symbol purposes.
11108 Generate_Reference (E, N, 'r', Set_Ref => False, Force => True);
11110 if Style_Check then
11111 Style.Check_Identifier (N, E);
11114 end Generate_Parent_Ref;
11116 -- Start of processing for Process_End_Label
11119 -- If no node, ignore. This happens in some error situations, and
11120 -- also for some internally generated structures where no end label
11121 -- references are required in any case.
11127 -- Nothing to do if no End_Label, happens for internally generated
11128 -- constructs where we don't want an end label reference anyway. Also
11129 -- nothing to do if Endl is a string literal, which means there was
11130 -- some prior error (bad operator symbol)
11132 Endl := End_Label (N);
11134 if No (Endl) or else Nkind (Endl) = N_String_Literal then
11138 -- Reference node is not in extended main source unit
11140 if not In_Extended_Main_Source_Unit (N) then
11142 -- Generally we do not collect references except for the extended
11143 -- main source unit. The one exception is the 'e' entry for a
11144 -- package spec, where it is useful for a client to have the
11145 -- ending information to define scopes.
11151 Label_Ref := False;
11153 -- For this case, we can ignore any parent references, but we
11154 -- need the package name itself for the 'e' entry.
11156 if Nkind (Endl) = N_Designator then
11157 Endl := Identifier (Endl);
11161 -- Reference is in extended main source unit
11166 -- For designator, generate references for the parent entries
11168 if Nkind (Endl) = N_Designator then
11170 -- Generate references for the prefix if the END line comes from
11171 -- source (otherwise we do not need these references) We climb the
11172 -- scope stack to find the expected entities.
11174 if Comes_From_Source (Endl) then
11175 Nam := Name (Endl);
11176 Scop := Current_Scope;
11177 while Nkind (Nam) = N_Selected_Component loop
11178 Scop := Scope (Scop);
11179 exit when No (Scop);
11180 Generate_Parent_Ref (Selector_Name (Nam), Scop);
11181 Nam := Prefix (Nam);
11184 if Present (Scop) then
11185 Generate_Parent_Ref (Nam, Scope (Scop));
11189 Endl := Identifier (Endl);
11193 -- If the end label is not for the given entity, then either we have
11194 -- some previous error, or this is a generic instantiation for which
11195 -- we do not need to make a cross-reference in this case anyway. In
11196 -- either case we simply ignore the call.
11198 if Chars (Ent) /= Chars (Endl) then
11202 -- If label was really there, then generate a normal reference and then
11203 -- adjust the location in the end label to point past the name (which
11204 -- should almost always be the semicolon).
11206 Loc := Sloc (Endl);
11208 if Comes_From_Source (Endl) then
11210 -- If a label reference is required, then do the style check and
11211 -- generate an l-type cross-reference entry for the label
11214 if Style_Check then
11215 Style.Check_Identifier (Endl, Ent);
11218 Generate_Reference (Ent, Endl, 'l', Set_Ref => False);
11221 -- Set the location to point past the label (normally this will
11222 -- mean the semicolon immediately following the label). This is
11223 -- done for the sake of the 'e' or 't' entry generated below.
11225 Get_Decoded_Name_String (Chars (Endl));
11226 Set_Sloc (Endl, Sloc (Endl) + Source_Ptr (Name_Len));
11229 -- In SPARK mode, no missing label is allowed for packages and
11230 -- subprogram bodies. Detect those cases by testing whether
11231 -- Process_End_Label was called for a body (Typ = 't') or a package.
11233 if Restriction_Check_Required (SPARK)
11234 and then (Typ = 't' or else Ekind (Ent) = E_Package)
11236 Error_Msg_Node_1 := Endl;
11237 Check_SPARK_Restriction ("`END &` required", Endl, Force => True);
11241 -- Now generate the e/t reference
11243 Generate_Reference (Ent, Endl, Typ, Set_Ref => False, Force => True);
11245 -- Restore Sloc, in case modified above, since we have an identifier
11246 -- and the normal Sloc should be left set in the tree.
11248 Set_Sloc (Endl, Loc);
11249 end Process_End_Label;
11251 ------------------------------------
11252 -- References_Generic_Formal_Type --
11253 ------------------------------------
11255 function References_Generic_Formal_Type (N : Node_Id) return Boolean is
11257 function Process (N : Node_Id) return Traverse_Result;
11258 -- Process one node in search for generic formal type
11264 function Process (N : Node_Id) return Traverse_Result is
11266 if Nkind (N) in N_Has_Entity then
11268 E : constant Entity_Id := Entity (N);
11270 if Present (E) then
11271 if Is_Generic_Type (E) then
11273 elsif Present (Etype (E))
11274 and then Is_Generic_Type (Etype (E))
11285 function Traverse is new Traverse_Func (Process);
11286 -- Traverse tree to look for generic type
11289 if Inside_A_Generic then
11290 return Traverse (N) = Abandon;
11294 end References_Generic_Formal_Type;
11296 --------------------
11297 -- Remove_Homonym --
11298 --------------------
11300 procedure Remove_Homonym (E : Entity_Id) is
11301 Prev : Entity_Id := Empty;
11305 if E = Current_Entity (E) then
11306 if Present (Homonym (E)) then
11307 Set_Current_Entity (Homonym (E));
11309 Set_Name_Entity_Id (Chars (E), Empty);
11312 H := Current_Entity (E);
11313 while Present (H) and then H /= E loop
11318 Set_Homonym (Prev, Homonym (E));
11320 end Remove_Homonym;
11322 ---------------------
11323 -- Rep_To_Pos_Flag --
11324 ---------------------
11326 function Rep_To_Pos_Flag (E : Entity_Id; Loc : Source_Ptr) return Node_Id is
11328 return New_Occurrence_Of
11329 (Boolean_Literals (not Range_Checks_Suppressed (E)), Loc);
11330 end Rep_To_Pos_Flag;
11332 --------------------
11333 -- Require_Entity --
11334 --------------------
11336 procedure Require_Entity (N : Node_Id) is
11338 if Is_Entity_Name (N) and then No (Entity (N)) then
11339 if Total_Errors_Detected /= 0 then
11340 Set_Entity (N, Any_Id);
11342 raise Program_Error;
11345 end Require_Entity;
11347 ------------------------------
11348 -- Requires_Transient_Scope --
11349 ------------------------------
11351 -- A transient scope is required when variable-sized temporaries are
11352 -- allocated in the primary or secondary stack, or when finalization
11353 -- actions must be generated before the next instruction.
11355 function Requires_Transient_Scope (Id : Entity_Id) return Boolean is
11356 Typ : constant Entity_Id := Underlying_Type (Id);
11358 -- Start of processing for Requires_Transient_Scope
11361 -- This is a private type which is not completed yet. This can only
11362 -- happen in a default expression (of a formal parameter or of a
11363 -- record component). Do not expand transient scope in this case
11368 -- Do not expand transient scope for non-existent procedure return
11370 elsif Typ = Standard_Void_Type then
11373 -- Elementary types do not require a transient scope
11375 elsif Is_Elementary_Type (Typ) then
11378 -- Generally, indefinite subtypes require a transient scope, since the
11379 -- back end cannot generate temporaries, since this is not a valid type
11380 -- for declaring an object. It might be possible to relax this in the
11381 -- future, e.g. by declaring the maximum possible space for the type.
11383 elsif Is_Indefinite_Subtype (Typ) then
11386 -- Functions returning tagged types may dispatch on result so their
11387 -- returned value is allocated on the secondary stack. Controlled
11388 -- type temporaries need finalization.
11390 elsif Is_Tagged_Type (Typ)
11391 or else Has_Controlled_Component (Typ)
11393 return not Is_Value_Type (Typ);
11397 elsif Is_Record_Type (Typ) then
11401 Comp := First_Entity (Typ);
11402 while Present (Comp) loop
11403 if Ekind (Comp) = E_Component
11404 and then Requires_Transient_Scope (Etype (Comp))
11408 Next_Entity (Comp);
11415 -- String literal types never require transient scope
11417 elsif Ekind (Typ) = E_String_Literal_Subtype then
11420 -- Array type. Note that we already know that this is a constrained
11421 -- array, since unconstrained arrays will fail the indefinite test.
11423 elsif Is_Array_Type (Typ) then
11425 -- If component type requires a transient scope, the array does too
11427 if Requires_Transient_Scope (Component_Type (Typ)) then
11430 -- Otherwise, we only need a transient scope if the size depends on
11431 -- the value of one or more discriminants.
11434 return Size_Depends_On_Discriminant (Typ);
11437 -- All other cases do not require a transient scope
11442 end Requires_Transient_Scope;
11444 --------------------------
11445 -- Reset_Analyzed_Flags --
11446 --------------------------
11448 procedure Reset_Analyzed_Flags (N : Node_Id) is
11450 function Clear_Analyzed (N : Node_Id) return Traverse_Result;
11451 -- Function used to reset Analyzed flags in tree. Note that we do
11452 -- not reset Analyzed flags in entities, since there is no need to
11453 -- reanalyze entities, and indeed, it is wrong to do so, since it
11454 -- can result in generating auxiliary stuff more than once.
11456 --------------------
11457 -- Clear_Analyzed --
11458 --------------------
11460 function Clear_Analyzed (N : Node_Id) return Traverse_Result is
11462 if not Has_Extension (N) then
11463 Set_Analyzed (N, False);
11467 end Clear_Analyzed;
11469 procedure Reset_Analyzed is new Traverse_Proc (Clear_Analyzed);
11471 -- Start of processing for Reset_Analyzed_Flags
11474 Reset_Analyzed (N);
11475 end Reset_Analyzed_Flags;
11477 ---------------------------
11478 -- Safe_To_Capture_Value --
11479 ---------------------------
11481 function Safe_To_Capture_Value
11484 Cond : Boolean := False) return Boolean
11487 -- The only entities for which we track constant values are variables
11488 -- which are not renamings, constants, out parameters, and in out
11489 -- parameters, so check if we have this case.
11491 -- Note: it may seem odd to track constant values for constants, but in
11492 -- fact this routine is used for other purposes than simply capturing
11493 -- the value. In particular, the setting of Known[_Non]_Null.
11495 if (Ekind (Ent) = E_Variable and then No (Renamed_Object (Ent)))
11497 Ekind (Ent) = E_Constant
11499 Ekind (Ent) = E_Out_Parameter
11501 Ekind (Ent) = E_In_Out_Parameter
11505 -- For conditionals, we also allow loop parameters and all formals,
11506 -- including in parameters.
11510 (Ekind (Ent) = E_Loop_Parameter
11512 Ekind (Ent) = E_In_Parameter)
11516 -- For all other cases, not just unsafe, but impossible to capture
11517 -- Current_Value, since the above are the only entities which have
11518 -- Current_Value fields.
11524 -- Skip if volatile or aliased, since funny things might be going on in
11525 -- these cases which we cannot necessarily track. Also skip any variable
11526 -- for which an address clause is given, or whose address is taken. Also
11527 -- never capture value of library level variables (an attempt to do so
11528 -- can occur in the case of package elaboration code).
11530 if Treat_As_Volatile (Ent)
11531 or else Is_Aliased (Ent)
11532 or else Present (Address_Clause (Ent))
11533 or else Address_Taken (Ent)
11534 or else (Is_Library_Level_Entity (Ent)
11535 and then Ekind (Ent) = E_Variable)
11540 -- OK, all above conditions are met. We also require that the scope of
11541 -- the reference be the same as the scope of the entity, not counting
11542 -- packages and blocks and loops.
11545 E_Scope : constant Entity_Id := Scope (Ent);
11546 R_Scope : Entity_Id;
11549 R_Scope := Current_Scope;
11550 while R_Scope /= Standard_Standard loop
11551 exit when R_Scope = E_Scope;
11553 if not Ekind_In (R_Scope, E_Package, E_Block, E_Loop) then
11556 R_Scope := Scope (R_Scope);
11561 -- We also require that the reference does not appear in a context
11562 -- where it is not sure to be executed (i.e. a conditional context
11563 -- or an exception handler). We skip this if Cond is True, since the
11564 -- capturing of values from conditional tests handles this ok.
11578 while Present (P) loop
11579 if Nkind (P) = N_If_Statement
11580 or else Nkind (P) = N_Case_Statement
11581 or else (Nkind (P) in N_Short_Circuit
11582 and then Desc = Right_Opnd (P))
11583 or else (Nkind (P) = N_Conditional_Expression
11584 and then Desc /= First (Expressions (P)))
11585 or else Nkind (P) = N_Exception_Handler
11586 or else Nkind (P) = N_Selective_Accept
11587 or else Nkind (P) = N_Conditional_Entry_Call
11588 or else Nkind (P) = N_Timed_Entry_Call
11589 or else Nkind (P) = N_Asynchronous_Select
11599 -- OK, looks safe to set value
11602 end Safe_To_Capture_Value;
11608 function Same_Name (N1, N2 : Node_Id) return Boolean is
11609 K1 : constant Node_Kind := Nkind (N1);
11610 K2 : constant Node_Kind := Nkind (N2);
11613 if (K1 = N_Identifier or else K1 = N_Defining_Identifier)
11614 and then (K2 = N_Identifier or else K2 = N_Defining_Identifier)
11616 return Chars (N1) = Chars (N2);
11618 elsif (K1 = N_Selected_Component or else K1 = N_Expanded_Name)
11619 and then (K2 = N_Selected_Component or else K2 = N_Expanded_Name)
11621 return Same_Name (Selector_Name (N1), Selector_Name (N2))
11622 and then Same_Name (Prefix (N1), Prefix (N2));
11633 function Same_Object (Node1, Node2 : Node_Id) return Boolean is
11634 N1 : constant Node_Id := Original_Node (Node1);
11635 N2 : constant Node_Id := Original_Node (Node2);
11636 -- We do the tests on original nodes, since we are most interested
11637 -- in the original source, not any expansion that got in the way.
11639 K1 : constant Node_Kind := Nkind (N1);
11640 K2 : constant Node_Kind := Nkind (N2);
11643 -- First case, both are entities with same entity
11645 if K1 in N_Has_Entity and then K2 in N_Has_Entity then
11647 EN1 : constant Entity_Id := Entity (N1);
11648 EN2 : constant Entity_Id := Entity (N2);
11650 if Present (EN1) and then Present (EN2)
11651 and then (Ekind_In (EN1, E_Variable, E_Constant)
11652 or else Is_Formal (EN1))
11660 -- Second case, selected component with same selector, same record
11662 if K1 = N_Selected_Component
11663 and then K2 = N_Selected_Component
11664 and then Chars (Selector_Name (N1)) = Chars (Selector_Name (N2))
11666 return Same_Object (Prefix (N1), Prefix (N2));
11668 -- Third case, indexed component with same subscripts, same array
11670 elsif K1 = N_Indexed_Component
11671 and then K2 = N_Indexed_Component
11672 and then Same_Object (Prefix (N1), Prefix (N2))
11677 E1 := First (Expressions (N1));
11678 E2 := First (Expressions (N2));
11679 while Present (E1) loop
11680 if not Same_Value (E1, E2) then
11691 -- Fourth case, slice of same array with same bounds
11694 and then K2 = N_Slice
11695 and then Nkind (Discrete_Range (N1)) = N_Range
11696 and then Nkind (Discrete_Range (N2)) = N_Range
11697 and then Same_Value (Low_Bound (Discrete_Range (N1)),
11698 Low_Bound (Discrete_Range (N2)))
11699 and then Same_Value (High_Bound (Discrete_Range (N1)),
11700 High_Bound (Discrete_Range (N2)))
11702 return Same_Name (Prefix (N1), Prefix (N2));
11704 -- All other cases, not clearly the same object
11715 function Same_Type (T1, T2 : Entity_Id) return Boolean is
11720 elsif not Is_Constrained (T1)
11721 and then not Is_Constrained (T2)
11722 and then Base_Type (T1) = Base_Type (T2)
11726 -- For now don't bother with case of identical constraints, to be
11727 -- fiddled with later on perhaps (this is only used for optimization
11728 -- purposes, so it is not critical to do a best possible job)
11739 function Same_Value (Node1, Node2 : Node_Id) return Boolean is
11741 if Compile_Time_Known_Value (Node1)
11742 and then Compile_Time_Known_Value (Node2)
11743 and then Expr_Value (Node1) = Expr_Value (Node2)
11746 elsif Same_Object (Node1, Node2) then
11757 procedure Save_Actual (N : Node_Id; Writable : Boolean := False) is
11759 if Ada_Version < Ada_2012 then
11762 elsif Is_Entity_Name (N)
11764 Nkind_In (N, N_Indexed_Component, N_Selected_Component, N_Slice)
11766 (Nkind (N) = N_Attribute_Reference
11767 and then Attribute_Name (N) = Name_Access)
11770 -- We are only interested in IN OUT parameters of inner calls
11773 or else Nkind (Parent (N)) = N_Function_Call
11774 or else Nkind (Parent (N)) in N_Op
11776 Actuals_In_Call.Increment_Last;
11777 Actuals_In_Call.Table (Actuals_In_Call.Last) := (N, Writable);
11782 ------------------------
11783 -- Scope_Is_Transient --
11784 ------------------------
11786 function Scope_Is_Transient return Boolean is
11788 return Scope_Stack.Table (Scope_Stack.Last).Is_Transient;
11789 end Scope_Is_Transient;
11795 function Scope_Within (Scope1, Scope2 : Entity_Id) return Boolean is
11800 while Scop /= Standard_Standard loop
11801 Scop := Scope (Scop);
11803 if Scop = Scope2 then
11811 --------------------------
11812 -- Scope_Within_Or_Same --
11813 --------------------------
11815 function Scope_Within_Or_Same (Scope1, Scope2 : Entity_Id) return Boolean is
11820 while Scop /= Standard_Standard loop
11821 if Scop = Scope2 then
11824 Scop := Scope (Scop);
11829 end Scope_Within_Or_Same;
11831 --------------------
11832 -- Set_Convention --
11833 --------------------
11835 procedure Set_Convention (E : Entity_Id; Val : Snames.Convention_Id) is
11837 Basic_Set_Convention (E, Val);
11840 and then Is_Access_Subprogram_Type (Base_Type (E))
11841 and then Has_Foreign_Convention (E)
11843 Set_Can_Use_Internal_Rep (E, False);
11845 end Set_Convention;
11847 ------------------------
11848 -- Set_Current_Entity --
11849 ------------------------
11851 -- The given entity is to be set as the currently visible definition of its
11852 -- associated name (i.e. the Node_Id associated with its name). All we have
11853 -- to do is to get the name from the identifier, and then set the
11854 -- associated Node_Id to point to the given entity.
11856 procedure Set_Current_Entity (E : Entity_Id) is
11858 Set_Name_Entity_Id (Chars (E), E);
11859 end Set_Current_Entity;
11861 ---------------------------
11862 -- Set_Debug_Info_Needed --
11863 ---------------------------
11865 procedure Set_Debug_Info_Needed (T : Entity_Id) is
11867 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id);
11868 pragma Inline (Set_Debug_Info_Needed_If_Not_Set);
11869 -- Used to set debug info in a related node if not set already
11871 --------------------------------------
11872 -- Set_Debug_Info_Needed_If_Not_Set --
11873 --------------------------------------
11875 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id) is
11878 and then not Needs_Debug_Info (E)
11880 Set_Debug_Info_Needed (E);
11882 -- For a private type, indicate that the full view also needs
11883 -- debug information.
11886 and then Is_Private_Type (E)
11887 and then Present (Full_View (E))
11889 Set_Debug_Info_Needed (Full_View (E));
11892 end Set_Debug_Info_Needed_If_Not_Set;
11894 -- Start of processing for Set_Debug_Info_Needed
11897 -- Nothing to do if argument is Empty or has Debug_Info_Off set, which
11898 -- indicates that Debug_Info_Needed is never required for the entity.
11901 or else Debug_Info_Off (T)
11906 -- Set flag in entity itself. Note that we will go through the following
11907 -- circuitry even if the flag is already set on T. That's intentional,
11908 -- it makes sure that the flag will be set in subsidiary entities.
11910 Set_Needs_Debug_Info (T);
11912 -- Set flag on subsidiary entities if not set already
11914 if Is_Object (T) then
11915 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
11917 elsif Is_Type (T) then
11918 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
11920 if Is_Record_Type (T) then
11922 Ent : Entity_Id := First_Entity (T);
11924 while Present (Ent) loop
11925 Set_Debug_Info_Needed_If_Not_Set (Ent);
11930 -- For a class wide subtype, we also need debug information
11931 -- for the equivalent type.
11933 if Ekind (T) = E_Class_Wide_Subtype then
11934 Set_Debug_Info_Needed_If_Not_Set (Equivalent_Type (T));
11937 elsif Is_Array_Type (T) then
11938 Set_Debug_Info_Needed_If_Not_Set (Component_Type (T));
11941 Indx : Node_Id := First_Index (T);
11943 while Present (Indx) loop
11944 Set_Debug_Info_Needed_If_Not_Set (Etype (Indx));
11945 Indx := Next_Index (Indx);
11949 if Is_Packed (T) then
11950 Set_Debug_Info_Needed_If_Not_Set (Packed_Array_Type (T));
11953 elsif Is_Access_Type (T) then
11954 Set_Debug_Info_Needed_If_Not_Set (Directly_Designated_Type (T));
11956 elsif Is_Private_Type (T) then
11957 Set_Debug_Info_Needed_If_Not_Set (Full_View (T));
11959 elsif Is_Protected_Type (T) then
11960 Set_Debug_Info_Needed_If_Not_Set (Corresponding_Record_Type (T));
11963 end Set_Debug_Info_Needed;
11965 ---------------------------------
11966 -- Set_Entity_With_Style_Check --
11967 ---------------------------------
11969 procedure Set_Entity_With_Style_Check (N : Node_Id; Val : Entity_Id) is
11970 Val_Actual : Entity_Id;
11974 Set_Entity (N, Val);
11977 and then not Suppress_Style_Checks (Val)
11978 and then not In_Instance
11980 if Nkind (N) = N_Identifier then
11982 elsif Nkind (N) = N_Expanded_Name then
11983 Nod := Selector_Name (N);
11988 -- A special situation arises for derived operations, where we want
11989 -- to do the check against the parent (since the Sloc of the derived
11990 -- operation points to the derived type declaration itself).
11993 while not Comes_From_Source (Val_Actual)
11994 and then Nkind (Val_Actual) in N_Entity
11995 and then (Ekind (Val_Actual) = E_Enumeration_Literal
11996 or else Is_Subprogram (Val_Actual)
11997 or else Is_Generic_Subprogram (Val_Actual))
11998 and then Present (Alias (Val_Actual))
12000 Val_Actual := Alias (Val_Actual);
12003 -- Renaming declarations for generic actuals do not come from source,
12004 -- and have a different name from that of the entity they rename, so
12005 -- there is no style check to perform here.
12007 if Chars (Nod) = Chars (Val_Actual) then
12008 Style.Check_Identifier (Nod, Val_Actual);
12012 Set_Entity (N, Val);
12013 end Set_Entity_With_Style_Check;
12015 ------------------------
12016 -- Set_Name_Entity_Id --
12017 ------------------------
12019 procedure Set_Name_Entity_Id (Id : Name_Id; Val : Entity_Id) is
12021 Set_Name_Table_Info (Id, Int (Val));
12022 end Set_Name_Entity_Id;
12024 ---------------------
12025 -- Set_Next_Actual --
12026 ---------------------
12028 procedure Set_Next_Actual (Ass1_Id : Node_Id; Ass2_Id : Node_Id) is
12030 if Nkind (Parent (Ass1_Id)) = N_Parameter_Association then
12031 Set_First_Named_Actual (Parent (Ass1_Id), Ass2_Id);
12033 end Set_Next_Actual;
12035 ----------------------------------
12036 -- Set_Optimize_Alignment_Flags --
12037 ----------------------------------
12039 procedure Set_Optimize_Alignment_Flags (E : Entity_Id) is
12041 if Optimize_Alignment = 'S' then
12042 Set_Optimize_Alignment_Space (E);
12043 elsif Optimize_Alignment = 'T' then
12044 Set_Optimize_Alignment_Time (E);
12046 end Set_Optimize_Alignment_Flags;
12048 -----------------------
12049 -- Set_Public_Status --
12050 -----------------------
12052 procedure Set_Public_Status (Id : Entity_Id) is
12053 S : constant Entity_Id := Current_Scope;
12055 function Within_HSS_Or_If (E : Entity_Id) return Boolean;
12056 -- Determines if E is defined within handled statement sequence or
12057 -- an if statement, returns True if so, False otherwise.
12059 ----------------------
12060 -- Within_HSS_Or_If --
12061 ----------------------
12063 function Within_HSS_Or_If (E : Entity_Id) return Boolean is
12066 N := Declaration_Node (E);
12073 elsif Nkind_In (N, N_Handled_Sequence_Of_Statements,
12079 end Within_HSS_Or_If;
12081 -- Start of processing for Set_Public_Status
12084 -- Everything in the scope of Standard is public
12086 if S = Standard_Standard then
12087 Set_Is_Public (Id);
12089 -- Entity is definitely not public if enclosing scope is not public
12091 elsif not Is_Public (S) then
12094 -- An object or function declaration that occurs in a handled sequence
12095 -- of statements or within an if statement is the declaration for a
12096 -- temporary object or local subprogram generated by the expander. It
12097 -- never needs to be made public and furthermore, making it public can
12098 -- cause back end problems.
12100 elsif Nkind_In (Parent (Id), N_Object_Declaration,
12101 N_Function_Specification)
12102 and then Within_HSS_Or_If (Id)
12106 -- Entities in public packages or records are public
12108 elsif Ekind (S) = E_Package or Is_Record_Type (S) then
12109 Set_Is_Public (Id);
12111 -- The bounds of an entry family declaration can generate object
12112 -- declarations that are visible to the back-end, e.g. in the
12113 -- the declaration of a composite type that contains tasks.
12115 elsif Is_Concurrent_Type (S)
12116 and then not Has_Completion (S)
12117 and then Nkind (Parent (Id)) = N_Object_Declaration
12119 Set_Is_Public (Id);
12121 end Set_Public_Status;
12123 -----------------------------
12124 -- Set_Referenced_Modified --
12125 -----------------------------
12127 procedure Set_Referenced_Modified (N : Node_Id; Out_Param : Boolean) is
12131 -- Deal with indexed or selected component where prefix is modified
12133 if Nkind_In (N, N_Indexed_Component, N_Selected_Component) then
12134 Pref := Prefix (N);
12136 -- If prefix is access type, then it is the designated object that is
12137 -- being modified, which means we have no entity to set the flag on.
12139 if No (Etype (Pref)) or else Is_Access_Type (Etype (Pref)) then
12142 -- Otherwise chase the prefix
12145 Set_Referenced_Modified (Pref, Out_Param);
12148 -- Otherwise see if we have an entity name (only other case to process)
12150 elsif Is_Entity_Name (N) and then Present (Entity (N)) then
12151 Set_Referenced_As_LHS (Entity (N), not Out_Param);
12152 Set_Referenced_As_Out_Parameter (Entity (N), Out_Param);
12154 end Set_Referenced_Modified;
12156 ----------------------------
12157 -- Set_Scope_Is_Transient --
12158 ----------------------------
12160 procedure Set_Scope_Is_Transient (V : Boolean := True) is
12162 Scope_Stack.Table (Scope_Stack.Last).Is_Transient := V;
12163 end Set_Scope_Is_Transient;
12165 -------------------
12166 -- Set_Size_Info --
12167 -------------------
12169 procedure Set_Size_Info (T1, T2 : Entity_Id) is
12171 -- We copy Esize, but not RM_Size, since in general RM_Size is
12172 -- subtype specific and does not get inherited by all subtypes.
12174 Set_Esize (T1, Esize (T2));
12175 Set_Has_Biased_Representation (T1, Has_Biased_Representation (T2));
12177 if Is_Discrete_Or_Fixed_Point_Type (T1)
12179 Is_Discrete_Or_Fixed_Point_Type (T2)
12181 Set_Is_Unsigned_Type (T1, Is_Unsigned_Type (T2));
12184 Set_Alignment (T1, Alignment (T2));
12187 --------------------
12188 -- Static_Boolean --
12189 --------------------
12191 function Static_Boolean (N : Node_Id) return Uint is
12193 Analyze_And_Resolve (N, Standard_Boolean);
12196 or else Error_Posted (N)
12197 or else Etype (N) = Any_Type
12202 if Is_Static_Expression (N) then
12203 if not Raises_Constraint_Error (N) then
12204 return Expr_Value (N);
12209 elsif Etype (N) = Any_Type then
12213 Flag_Non_Static_Expr
12214 ("static boolean expression required here", N);
12217 end Static_Boolean;
12219 --------------------
12220 -- Static_Integer --
12221 --------------------
12223 function Static_Integer (N : Node_Id) return Uint is
12225 Analyze_And_Resolve (N, Any_Integer);
12228 or else Error_Posted (N)
12229 or else Etype (N) = Any_Type
12234 if Is_Static_Expression (N) then
12235 if not Raises_Constraint_Error (N) then
12236 return Expr_Value (N);
12241 elsif Etype (N) = Any_Type then
12245 Flag_Non_Static_Expr
12246 ("static integer expression required here", N);
12249 end Static_Integer;
12251 --------------------------
12252 -- Statically_Different --
12253 --------------------------
12255 function Statically_Different (E1, E2 : Node_Id) return Boolean is
12256 R1 : constant Node_Id := Get_Referenced_Object (E1);
12257 R2 : constant Node_Id := Get_Referenced_Object (E2);
12259 return Is_Entity_Name (R1)
12260 and then Is_Entity_Name (R2)
12261 and then Entity (R1) /= Entity (R2)
12262 and then not Is_Formal (Entity (R1))
12263 and then not Is_Formal (Entity (R2));
12264 end Statically_Different;
12266 -----------------------------
12267 -- Subprogram_Access_Level --
12268 -----------------------------
12270 function Subprogram_Access_Level (Subp : Entity_Id) return Uint is
12272 if Present (Alias (Subp)) then
12273 return Subprogram_Access_Level (Alias (Subp));
12275 return Scope_Depth (Enclosing_Dynamic_Scope (Subp));
12277 end Subprogram_Access_Level;
12283 procedure Trace_Scope (N : Node_Id; E : Entity_Id; Msg : String) is
12285 if Debug_Flag_W then
12286 for J in 0 .. Scope_Stack.Last loop
12291 Write_Name (Chars (E));
12292 Write_Str (" from ");
12293 Write_Location (Sloc (N));
12298 -----------------------
12299 -- Transfer_Entities --
12300 -----------------------
12302 procedure Transfer_Entities (From : Entity_Id; To : Entity_Id) is
12303 Ent : Entity_Id := First_Entity (From);
12310 if (Last_Entity (To)) = Empty then
12311 Set_First_Entity (To, Ent);
12313 Set_Next_Entity (Last_Entity (To), Ent);
12316 Set_Last_Entity (To, Last_Entity (From));
12318 while Present (Ent) loop
12319 Set_Scope (Ent, To);
12321 if not Is_Public (Ent) then
12322 Set_Public_Status (Ent);
12325 and then Ekind (Ent) = E_Record_Subtype
12328 -- The components of the propagated Itype must be public
12334 Comp := First_Entity (Ent);
12335 while Present (Comp) loop
12336 Set_Is_Public (Comp);
12337 Next_Entity (Comp);
12346 Set_First_Entity (From, Empty);
12347 Set_Last_Entity (From, Empty);
12348 end Transfer_Entities;
12350 -----------------------
12351 -- Type_Access_Level --
12352 -----------------------
12354 function Type_Access_Level (Typ : Entity_Id) return Uint is
12358 Btyp := Base_Type (Typ);
12360 -- Ada 2005 (AI-230): For most cases of anonymous access types, we
12361 -- simply use the level where the type is declared. This is true for
12362 -- stand-alone object declarations, and for anonymous access types
12363 -- associated with components the level is the same as that of the
12364 -- enclosing composite type. However, special treatment is needed for
12365 -- the cases of access parameters, return objects of an anonymous access
12366 -- type, and, in Ada 95, access discriminants of limited types.
12368 if Ekind (Btyp) in Access_Kind then
12369 if Ekind (Btyp) = E_Anonymous_Access_Type then
12371 -- If the type is a nonlocal anonymous access type (such as for
12372 -- an access parameter) we treat it as being declared at the
12373 -- library level to ensure that names such as X.all'access don't
12374 -- fail static accessibility checks.
12376 if not Is_Local_Anonymous_Access (Typ) then
12377 return Scope_Depth (Standard_Standard);
12379 -- If this is a return object, the accessibility level is that of
12380 -- the result subtype of the enclosing function. The test here is
12381 -- little complicated, because we have to account for extended
12382 -- return statements that have been rewritten as blocks, in which
12383 -- case we have to find and the Is_Return_Object attribute of the
12384 -- itype's associated object. It would be nice to find a way to
12385 -- simplify this test, but it doesn't seem worthwhile to add a new
12386 -- flag just for purposes of this test. ???
12388 elsif Ekind (Scope (Btyp)) = E_Return_Statement
12391 and then Nkind (Associated_Node_For_Itype (Btyp)) =
12392 N_Object_Declaration
12393 and then Is_Return_Object
12394 (Defining_Identifier
12395 (Associated_Node_For_Itype (Btyp))))
12401 Scop := Scope (Scope (Btyp));
12402 while Present (Scop) loop
12403 exit when Ekind (Scop) = E_Function;
12404 Scop := Scope (Scop);
12407 -- Treat the return object's type as having the level of the
12408 -- function's result subtype (as per RM05-6.5(5.3/2)).
12410 return Type_Access_Level (Etype (Scop));
12415 Btyp := Root_Type (Btyp);
12417 -- The accessibility level of anonymous access types associated with
12418 -- discriminants is that of the current instance of the type, and
12419 -- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
12421 -- AI-402: access discriminants have accessibility based on the
12422 -- object rather than the type in Ada 2005, so the above paragraph
12425 -- ??? Needs completion with rules from AI-416
12427 if Ada_Version <= Ada_95
12428 and then Ekind (Typ) = E_Anonymous_Access_Type
12429 and then Present (Associated_Node_For_Itype (Typ))
12430 and then Nkind (Associated_Node_For_Itype (Typ)) =
12431 N_Discriminant_Specification
12433 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp)) + 1;
12437 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
12438 end Type_Access_Level;
12440 ------------------------------------
12441 -- Type_Without_Stream_Operation --
12442 ------------------------------------
12444 function Type_Without_Stream_Operation
12446 Op : TSS_Name_Type := TSS_Null) return Entity_Id
12448 BT : constant Entity_Id := Base_Type (T);
12449 Op_Missing : Boolean;
12452 if not Restriction_Active (No_Default_Stream_Attributes) then
12456 if Is_Elementary_Type (T) then
12457 if Op = TSS_Null then
12459 No (TSS (BT, TSS_Stream_Read))
12460 or else No (TSS (BT, TSS_Stream_Write));
12463 Op_Missing := No (TSS (BT, Op));
12472 elsif Is_Array_Type (T) then
12473 return Type_Without_Stream_Operation (Component_Type (T), Op);
12475 elsif Is_Record_Type (T) then
12481 Comp := First_Component (T);
12482 while Present (Comp) loop
12483 C_Typ := Type_Without_Stream_Operation (Etype (Comp), Op);
12485 if Present (C_Typ) then
12489 Next_Component (Comp);
12495 elsif Is_Private_Type (T)
12496 and then Present (Full_View (T))
12498 return Type_Without_Stream_Operation (Full_View (T), Op);
12502 end Type_Without_Stream_Operation;
12504 ----------------------------
12505 -- Unique_Defining_Entity --
12506 ----------------------------
12508 function Unique_Defining_Entity (N : Node_Id) return Entity_Id is
12510 return Unique_Entity (Defining_Entity (N));
12511 end Unique_Defining_Entity;
12513 -------------------
12514 -- Unique_Entity --
12515 -------------------
12517 function Unique_Entity (E : Entity_Id) return Entity_Id is
12518 U : Entity_Id := E;
12524 if Present (Full_View (E)) then
12525 U := Full_View (E);
12528 when E_Package_Body =>
12531 if Nkind (P) = N_Defining_Program_Unit_Name then
12535 U := Corresponding_Spec (P);
12537 when E_Subprogram_Body =>
12540 if Nkind (P) = N_Defining_Program_Unit_Name then
12546 if Nkind (P) = N_Subprogram_Body_Stub then
12547 if Present (Library_Unit (P)) then
12548 U := Get_Body_From_Stub (P);
12551 U := Corresponding_Spec (P);
12565 function Unique_Name (E : Entity_Id) return String is
12567 function Get_Scoped_Name (E : Entity_Id) return String;
12568 -- Return the name of E prefixed by all the names of the scopes to which
12569 -- E belongs, except for Standard.
12571 ---------------------
12572 -- Get_Scoped_Name --
12573 ---------------------
12575 function Get_Scoped_Name (E : Entity_Id) return String is
12576 Name : constant String := Get_Name_String (Chars (E));
12578 if Has_Fully_Qualified_Name (E)
12579 or else Scope (E) = Standard_Standard
12583 return Get_Scoped_Name (Scope (E)) & "__" & Name;
12585 end Get_Scoped_Name;
12587 -- Start of processing for Unique_Name
12590 if E = Standard_Standard then
12591 return Get_Name_String (Name_Standard);
12593 elsif Scope (E) = Standard_Standard
12594 and then not (Ekind (E) = E_Package or else Is_Subprogram (E))
12596 return Get_Name_String (Name_Standard) & "__" &
12597 Get_Name_String (Chars (E));
12600 return Get_Scoped_Name (E);
12604 --------------------------
12605 -- Unit_Declaration_Node --
12606 --------------------------
12608 function Unit_Declaration_Node (Unit_Id : Entity_Id) return Node_Id is
12609 N : Node_Id := Parent (Unit_Id);
12612 -- Predefined operators do not have a full function declaration
12614 if Ekind (Unit_Id) = E_Operator then
12618 -- Isn't there some better way to express the following ???
12620 while Nkind (N) /= N_Abstract_Subprogram_Declaration
12621 and then Nkind (N) /= N_Formal_Package_Declaration
12622 and then Nkind (N) /= N_Function_Instantiation
12623 and then Nkind (N) /= N_Generic_Package_Declaration
12624 and then Nkind (N) /= N_Generic_Subprogram_Declaration
12625 and then Nkind (N) /= N_Package_Declaration
12626 and then Nkind (N) /= N_Package_Body
12627 and then Nkind (N) /= N_Package_Instantiation
12628 and then Nkind (N) /= N_Package_Renaming_Declaration
12629 and then Nkind (N) /= N_Procedure_Instantiation
12630 and then Nkind (N) /= N_Protected_Body
12631 and then Nkind (N) /= N_Subprogram_Declaration
12632 and then Nkind (N) /= N_Subprogram_Body
12633 and then Nkind (N) /= N_Subprogram_Body_Stub
12634 and then Nkind (N) /= N_Subprogram_Renaming_Declaration
12635 and then Nkind (N) /= N_Task_Body
12636 and then Nkind (N) /= N_Task_Type_Declaration
12637 and then Nkind (N) not in N_Formal_Subprogram_Declaration
12638 and then Nkind (N) not in N_Generic_Renaming_Declaration
12641 pragma Assert (Present (N));
12645 end Unit_Declaration_Node;
12647 ---------------------
12648 -- Unit_Is_Visible --
12649 ---------------------
12651 function Unit_Is_Visible (U : Entity_Id) return Boolean is
12652 Curr : constant Node_Id := Cunit (Current_Sem_Unit);
12653 Curr_Entity : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
12655 function Unit_In_Parent_Context (Par_Unit : Node_Id) return Boolean;
12656 -- For a child unit, check whether unit appears in a with_clause
12659 function Unit_In_Context (Comp_Unit : Node_Id) return Boolean;
12660 -- Scan the context clause of one compilation unit looking for a
12661 -- with_clause for the unit in question.
12663 ----------------------------
12664 -- Unit_In_Parent_Context --
12665 ----------------------------
12667 function Unit_In_Parent_Context (Par_Unit : Node_Id) return Boolean is
12669 if Unit_In_Context (Par_Unit) then
12672 elsif Is_Child_Unit (Defining_Entity (Unit (Par_Unit))) then
12673 return Unit_In_Parent_Context (Parent_Spec (Unit (Par_Unit)));
12678 end Unit_In_Parent_Context;
12680 ---------------------
12681 -- Unit_In_Context --
12682 ---------------------
12684 function Unit_In_Context (Comp_Unit : Node_Id) return Boolean is
12688 Clause := First (Context_Items (Comp_Unit));
12689 while Present (Clause) loop
12690 if Nkind (Clause) = N_With_Clause then
12691 if Library_Unit (Clause) = U then
12694 -- The with_clause may denote a renaming of the unit we are
12695 -- looking for, eg. Text_IO which renames Ada.Text_IO.
12698 Renamed_Entity (Entity (Name (Clause))) =
12699 Defining_Entity (Unit (U))
12709 end Unit_In_Context;
12711 -- Start of processing for Unit_Is_Visible
12714 -- The currrent unit is directly visible
12719 elsif Unit_In_Context (Curr) then
12722 -- If the current unit is a body, check the context of the spec
12724 elsif Nkind (Unit (Curr)) = N_Package_Body
12726 (Nkind (Unit (Curr)) = N_Subprogram_Body
12727 and then not Acts_As_Spec (Unit (Curr)))
12729 if Unit_In_Context (Library_Unit (Curr)) then
12734 -- If the spec is a child unit, examine the parents
12736 if Is_Child_Unit (Curr_Entity) then
12737 if Nkind (Unit (Curr)) in N_Unit_Body then
12739 Unit_In_Parent_Context
12740 (Parent_Spec (Unit (Library_Unit (Curr))));
12742 return Unit_In_Parent_Context (Parent_Spec (Unit (Curr)));
12748 end Unit_Is_Visible;
12750 ------------------------------
12751 -- Universal_Interpretation --
12752 ------------------------------
12754 function Universal_Interpretation (Opnd : Node_Id) return Entity_Id is
12755 Index : Interp_Index;
12759 -- The argument may be a formal parameter of an operator or subprogram
12760 -- with multiple interpretations, or else an expression for an actual.
12762 if Nkind (Opnd) = N_Defining_Identifier
12763 or else not Is_Overloaded (Opnd)
12765 if Etype (Opnd) = Universal_Integer
12766 or else Etype (Opnd) = Universal_Real
12768 return Etype (Opnd);
12774 Get_First_Interp (Opnd, Index, It);
12775 while Present (It.Typ) loop
12776 if It.Typ = Universal_Integer
12777 or else It.Typ = Universal_Real
12782 Get_Next_Interp (Index, It);
12787 end Universal_Interpretation;
12793 function Unqualify (Expr : Node_Id) return Node_Id is
12795 -- Recurse to handle unlikely case of multiple levels of qualification
12797 if Nkind (Expr) = N_Qualified_Expression then
12798 return Unqualify (Expression (Expr));
12800 -- Normal case, not a qualified expression
12807 -----------------------
12808 -- Visible_Ancestors --
12809 -----------------------
12811 function Visible_Ancestors (Typ : Entity_Id) return Elist_Id is
12817 pragma Assert (Is_Record_Type (Typ)
12818 and then Is_Tagged_Type (Typ));
12820 -- Collect all the parents and progenitors of Typ. If the full-view of
12821 -- private parents and progenitors is available then it is used to
12822 -- generate the list of visible ancestors; otherwise their partial
12823 -- view is added to the resulting list.
12828 Use_Full_View => True);
12832 Ifaces_List => List_2,
12833 Exclude_Parents => True,
12834 Use_Full_View => True);
12836 -- Join the two lists. Avoid duplications because an interface may
12837 -- simultaneously be parent and progenitor of a type.
12839 Elmt := First_Elmt (List_2);
12840 while Present (Elmt) loop
12841 Append_Unique_Elmt (Node (Elmt), List_1);
12846 end Visible_Ancestors;
12848 ----------------------
12849 -- Within_Init_Proc --
12850 ----------------------
12852 function Within_Init_Proc return Boolean is
12856 S := Current_Scope;
12857 while not Is_Overloadable (S) loop
12858 if S = Standard_Standard then
12865 return Is_Init_Proc (S);
12866 end Within_Init_Proc;
12872 procedure Wrong_Type (Expr : Node_Id; Expected_Type : Entity_Id) is
12873 Found_Type : constant Entity_Id := First_Subtype (Etype (Expr));
12874 Expec_Type : constant Entity_Id := First_Subtype (Expected_Type);
12876 Matching_Field : Entity_Id;
12877 -- Entity to give a more precise suggestion on how to write a one-
12878 -- element positional aggregate.
12880 function Has_One_Matching_Field return Boolean;
12881 -- Determines if Expec_Type is a record type with a single component or
12882 -- discriminant whose type matches the found type or is one dimensional
12883 -- array whose component type matches the found type.
12885 ----------------------------
12886 -- Has_One_Matching_Field --
12887 ----------------------------
12889 function Has_One_Matching_Field return Boolean is
12893 Matching_Field := Empty;
12895 if Is_Array_Type (Expec_Type)
12896 and then Number_Dimensions (Expec_Type) = 1
12898 Covers (Etype (Component_Type (Expec_Type)), Found_Type)
12900 -- Use type name if available. This excludes multidimensional
12901 -- arrays and anonymous arrays.
12903 if Comes_From_Source (Expec_Type) then
12904 Matching_Field := Expec_Type;
12906 -- For an assignment, use name of target
12908 elsif Nkind (Parent (Expr)) = N_Assignment_Statement
12909 and then Is_Entity_Name (Name (Parent (Expr)))
12911 Matching_Field := Entity (Name (Parent (Expr)));
12916 elsif not Is_Record_Type (Expec_Type) then
12920 E := First_Entity (Expec_Type);
12925 elsif (Ekind (E) /= E_Discriminant
12926 and then Ekind (E) /= E_Component)
12927 or else (Chars (E) = Name_uTag
12928 or else Chars (E) = Name_uParent)
12937 if not Covers (Etype (E), Found_Type) then
12940 elsif Present (Next_Entity (E)) then
12944 Matching_Field := E;
12948 end Has_One_Matching_Field;
12950 -- Start of processing for Wrong_Type
12953 -- Don't output message if either type is Any_Type, or if a message
12954 -- has already been posted for this node. We need to do the latter
12955 -- check explicitly (it is ordinarily done in Errout), because we
12956 -- are using ! to force the output of the error messages.
12958 if Expec_Type = Any_Type
12959 or else Found_Type = Any_Type
12960 or else Error_Posted (Expr)
12964 -- In an instance, there is an ongoing problem with completion of
12965 -- type derived from private types. Their structure is what Gigi
12966 -- expects, but the Etype is the parent type rather than the
12967 -- derived private type itself. Do not flag error in this case. The
12968 -- private completion is an entity without a parent, like an Itype.
12969 -- Similarly, full and partial views may be incorrect in the instance.
12970 -- There is no simple way to insure that it is consistent ???
12972 elsif In_Instance then
12973 if Etype (Etype (Expr)) = Etype (Expected_Type)
12975 (Has_Private_Declaration (Expected_Type)
12976 or else Has_Private_Declaration (Etype (Expr)))
12977 and then No (Parent (Expected_Type))
12983 -- An interesting special check. If the expression is parenthesized
12984 -- and its type corresponds to the type of the sole component of the
12985 -- expected record type, or to the component type of the expected one
12986 -- dimensional array type, then assume we have a bad aggregate attempt.
12988 if Nkind (Expr) in N_Subexpr
12989 and then Paren_Count (Expr) /= 0
12990 and then Has_One_Matching_Field
12992 Error_Msg_N ("positional aggregate cannot have one component", Expr);
12993 if Present (Matching_Field) then
12994 if Is_Array_Type (Expec_Type) then
12996 ("\write instead `&''First ='> ...`", Expr, Matching_Field);
13000 ("\write instead `& ='> ...`", Expr, Matching_Field);
13004 -- Another special check, if we are looking for a pool-specific access
13005 -- type and we found an E_Access_Attribute_Type, then we have the case
13006 -- of an Access attribute being used in a context which needs a pool-
13007 -- specific type, which is never allowed. The one extra check we make
13008 -- is that the expected designated type covers the Found_Type.
13010 elsif Is_Access_Type (Expec_Type)
13011 and then Ekind (Found_Type) = E_Access_Attribute_Type
13012 and then Ekind (Base_Type (Expec_Type)) /= E_General_Access_Type
13013 and then Ekind (Base_Type (Expec_Type)) /= E_Anonymous_Access_Type
13015 (Designated_Type (Expec_Type), Designated_Type (Found_Type))
13017 Error_Msg_N -- CODEFIX
13018 ("result must be general access type!", Expr);
13019 Error_Msg_NE -- CODEFIX
13020 ("add ALL to }!", Expr, Expec_Type);
13022 -- Another special check, if the expected type is an integer type,
13023 -- but the expression is of type System.Address, and the parent is
13024 -- an addition or subtraction operation whose left operand is the
13025 -- expression in question and whose right operand is of an integral
13026 -- type, then this is an attempt at address arithmetic, so give
13027 -- appropriate message.
13029 elsif Is_Integer_Type (Expec_Type)
13030 and then Is_RTE (Found_Type, RE_Address)
13031 and then (Nkind (Parent (Expr)) = N_Op_Add
13033 Nkind (Parent (Expr)) = N_Op_Subtract)
13034 and then Expr = Left_Opnd (Parent (Expr))
13035 and then Is_Integer_Type (Etype (Right_Opnd (Parent (Expr))))
13038 ("address arithmetic not predefined in package System",
13041 ("\possible missing with/use of System.Storage_Elements",
13045 -- If the expected type is an anonymous access type, as for access
13046 -- parameters and discriminants, the error is on the designated types.
13048 elsif Ekind (Expec_Type) = E_Anonymous_Access_Type then
13049 if Comes_From_Source (Expec_Type) then
13050 Error_Msg_NE ("expected}!", Expr, Expec_Type);
13053 ("expected an access type with designated}",
13054 Expr, Designated_Type (Expec_Type));
13057 if Is_Access_Type (Found_Type)
13058 and then not Comes_From_Source (Found_Type)
13061 ("\\found an access type with designated}!",
13062 Expr, Designated_Type (Found_Type));
13064 if From_With_Type (Found_Type) then
13065 Error_Msg_NE ("\\found incomplete}!", Expr, Found_Type);
13066 Error_Msg_Qual_Level := 99;
13067 Error_Msg_NE -- CODEFIX
13068 ("\\missing `WITH &;", Expr, Scope (Found_Type));
13069 Error_Msg_Qual_Level := 0;
13071 Error_Msg_NE ("found}!", Expr, Found_Type);
13075 -- Normal case of one type found, some other type expected
13078 -- If the names of the two types are the same, see if some number
13079 -- of levels of qualification will help. Don't try more than three
13080 -- levels, and if we get to standard, it's no use (and probably
13081 -- represents an error in the compiler) Also do not bother with
13082 -- internal scope names.
13085 Expec_Scope : Entity_Id;
13086 Found_Scope : Entity_Id;
13089 Expec_Scope := Expec_Type;
13090 Found_Scope := Found_Type;
13092 for Levels in Int range 0 .. 3 loop
13093 if Chars (Expec_Scope) /= Chars (Found_Scope) then
13094 Error_Msg_Qual_Level := Levels;
13098 Expec_Scope := Scope (Expec_Scope);
13099 Found_Scope := Scope (Found_Scope);
13101 exit when Expec_Scope = Standard_Standard
13102 or else Found_Scope = Standard_Standard
13103 or else not Comes_From_Source (Expec_Scope)
13104 or else not Comes_From_Source (Found_Scope);
13108 if Is_Record_Type (Expec_Type)
13109 and then Present (Corresponding_Remote_Type (Expec_Type))
13111 Error_Msg_NE ("expected}!", Expr,
13112 Corresponding_Remote_Type (Expec_Type));
13114 Error_Msg_NE ("expected}!", Expr, Expec_Type);
13117 if Is_Entity_Name (Expr)
13118 and then Is_Package_Or_Generic_Package (Entity (Expr))
13120 Error_Msg_N ("\\found package name!", Expr);
13122 elsif Is_Entity_Name (Expr)
13124 (Ekind (Entity (Expr)) = E_Procedure
13126 Ekind (Entity (Expr)) = E_Generic_Procedure)
13128 if Ekind (Expec_Type) = E_Access_Subprogram_Type then
13130 ("found procedure name, possibly missing Access attribute!",
13134 ("\\found procedure name instead of function!", Expr);
13137 elsif Nkind (Expr) = N_Function_Call
13138 and then Ekind (Expec_Type) = E_Access_Subprogram_Type
13139 and then Etype (Designated_Type (Expec_Type)) = Etype (Expr)
13140 and then No (Parameter_Associations (Expr))
13143 ("found function name, possibly missing Access attribute!",
13146 -- Catch common error: a prefix or infix operator which is not
13147 -- directly visible because the type isn't.
13149 elsif Nkind (Expr) in N_Op
13150 and then Is_Overloaded (Expr)
13151 and then not Is_Immediately_Visible (Expec_Type)
13152 and then not Is_Potentially_Use_Visible (Expec_Type)
13153 and then not In_Use (Expec_Type)
13154 and then Has_Compatible_Type (Right_Opnd (Expr), Expec_Type)
13157 ("operator of the type is not directly visible!", Expr);
13159 elsif Ekind (Found_Type) = E_Void
13160 and then Present (Parent (Found_Type))
13161 and then Nkind (Parent (Found_Type)) = N_Full_Type_Declaration
13163 Error_Msg_NE ("\\found premature usage of}!", Expr, Found_Type);
13166 Error_Msg_NE ("\\found}!", Expr, Found_Type);
13169 -- A special check for cases like M1 and M2 = 0 where M1 and M2 are
13170 -- of the same modular type, and (M1 and M2) = 0 was intended.
13172 if Expec_Type = Standard_Boolean
13173 and then Is_Modular_Integer_Type (Found_Type)
13174 and then Nkind_In (Parent (Expr), N_Op_And, N_Op_Or, N_Op_Xor)
13175 and then Nkind (Right_Opnd (Parent (Expr))) in N_Op_Compare
13178 Op : constant Node_Id := Right_Opnd (Parent (Expr));
13179 L : constant Node_Id := Left_Opnd (Op);
13180 R : constant Node_Id := Right_Opnd (Op);
13182 -- The case for the message is when the left operand of the
13183 -- comparison is the same modular type, or when it is an
13184 -- integer literal (or other universal integer expression),
13185 -- which would have been typed as the modular type if the
13186 -- parens had been there.
13188 if (Etype (L) = Found_Type
13190 Etype (L) = Universal_Integer)
13191 and then Is_Integer_Type (Etype (R))
13194 ("\\possible missing parens for modular operation", Expr);
13199 -- Reset error message qualification indication
13201 Error_Msg_Qual_Level := 0;