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 -- Cannot_Raise_Constraint_Error --
986 -----------------------------------
988 function Cannot_Raise_Constraint_Error (Expr : Node_Id) return Boolean is
990 if Compile_Time_Known_Value (Expr) then
993 elsif Do_Range_Check (Expr) then
996 elsif Raises_Constraint_Error (Expr) then
1000 case Nkind (Expr) is
1001 when N_Identifier =>
1004 when N_Expanded_Name =>
1007 when N_Selected_Component =>
1008 return not Do_Discriminant_Check (Expr);
1010 when N_Attribute_Reference =>
1011 if Do_Overflow_Check (Expr) then
1014 elsif No (Expressions (Expr)) then
1022 N := First (Expressions (Expr));
1023 while Present (N) loop
1024 if Cannot_Raise_Constraint_Error (N) then
1035 when N_Type_Conversion =>
1036 if Do_Overflow_Check (Expr)
1037 or else Do_Length_Check (Expr)
1038 or else Do_Tag_Check (Expr)
1043 Cannot_Raise_Constraint_Error (Expression (Expr));
1046 when N_Unchecked_Type_Conversion =>
1047 return Cannot_Raise_Constraint_Error (Expression (Expr));
1050 if Do_Overflow_Check (Expr) then
1054 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1061 if Do_Division_Check (Expr)
1062 or else Do_Overflow_Check (Expr)
1067 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
1069 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1088 N_Op_Shift_Right_Arithmetic |
1092 if Do_Overflow_Check (Expr) then
1096 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
1098 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1105 end Cannot_Raise_Constraint_Error;
1107 --------------------------------
1108 -- Check_Implicit_Dereference --
1109 --------------------------------
1111 procedure Check_Implicit_Dereference (Nam : Node_Id; Typ : Entity_Id)
1117 if Ada_Version < Ada_2012
1118 or else not Has_Implicit_Dereference (Base_Type (Typ))
1122 elsif not Comes_From_Source (Nam) then
1125 elsif Is_Entity_Name (Nam)
1126 and then Is_Type (Entity (Nam))
1131 Disc := First_Discriminant (Typ);
1132 while Present (Disc) loop
1133 if Has_Implicit_Dereference (Disc) then
1134 Desig := Designated_Type (Etype (Disc));
1135 Add_One_Interp (Nam, Disc, Desig);
1139 Next_Discriminant (Disc);
1142 end Check_Implicit_Dereference;
1144 ---------------------------------------
1145 -- Check_Later_Vs_Basic_Declarations --
1146 ---------------------------------------
1148 procedure Check_Later_Vs_Basic_Declarations
1150 During_Parsing : Boolean)
1152 Body_Sloc : Source_Ptr;
1155 function Is_Later_Declarative_Item (Decl : Node_Id) return Boolean;
1156 -- Return whether Decl is considered as a declarative item.
1157 -- When During_Parsing is True, the semantics of Ada 83 is followed.
1158 -- When During_Parsing is False, the semantics of SPARK is followed.
1160 -------------------------------
1161 -- Is_Later_Declarative_Item --
1162 -------------------------------
1164 function Is_Later_Declarative_Item (Decl : Node_Id) return Boolean is
1166 if Nkind (Decl) in N_Later_Decl_Item then
1169 elsif Nkind (Decl) = N_Pragma then
1172 elsif During_Parsing then
1175 -- In SPARK, a package declaration is not considered as a later
1176 -- declarative item.
1178 elsif Nkind (Decl) = N_Package_Declaration then
1181 -- In SPARK, a renaming is considered as a later declarative item
1183 elsif Nkind (Decl) in N_Renaming_Declaration then
1189 end Is_Later_Declarative_Item;
1191 -- Start of Check_Later_Vs_Basic_Declarations
1194 Decl := First (Decls);
1196 -- Loop through sequence of basic declarative items
1198 Outer : while Present (Decl) loop
1199 if Nkind (Decl) /= N_Subprogram_Body
1200 and then Nkind (Decl) /= N_Package_Body
1201 and then Nkind (Decl) /= N_Task_Body
1202 and then Nkind (Decl) not in N_Body_Stub
1206 -- Once a body is encountered, we only allow later declarative
1207 -- items. The inner loop checks the rest of the list.
1210 Body_Sloc := Sloc (Decl);
1212 Inner : while Present (Decl) loop
1213 if not Is_Later_Declarative_Item (Decl) then
1214 if During_Parsing then
1215 if Ada_Version = Ada_83 then
1216 Error_Msg_Sloc := Body_Sloc;
1218 ("(Ada 83) decl cannot appear after body#", Decl);
1221 Error_Msg_Sloc := Body_Sloc;
1222 Check_SPARK_Restriction
1223 ("decl cannot appear after body#", Decl);
1231 end Check_Later_Vs_Basic_Declarations;
1233 -----------------------------------------
1234 -- Check_Dynamically_Tagged_Expression --
1235 -----------------------------------------
1237 procedure Check_Dynamically_Tagged_Expression
1240 Related_Nod : Node_Id)
1243 pragma Assert (Is_Tagged_Type (Typ));
1245 -- In order to avoid spurious errors when analyzing the expanded code,
1246 -- this check is done only for nodes that come from source and for
1247 -- actuals of generic instantiations.
1249 if (Comes_From_Source (Related_Nod)
1250 or else In_Generic_Actual (Expr))
1251 and then (Is_Class_Wide_Type (Etype (Expr))
1252 or else Is_Dynamically_Tagged (Expr))
1253 and then Is_Tagged_Type (Typ)
1254 and then not Is_Class_Wide_Type (Typ)
1256 Error_Msg_N ("dynamically tagged expression not allowed!", Expr);
1258 end Check_Dynamically_Tagged_Expression;
1260 --------------------------
1261 -- Check_Fully_Declared --
1262 --------------------------
1264 procedure Check_Fully_Declared (T : Entity_Id; N : Node_Id) is
1266 if Ekind (T) = E_Incomplete_Type then
1268 -- Ada 2005 (AI-50217): If the type is available through a limited
1269 -- with_clause, verify that its full view has been analyzed.
1271 if From_With_Type (T)
1272 and then Present (Non_Limited_View (T))
1273 and then Ekind (Non_Limited_View (T)) /= E_Incomplete_Type
1275 -- The non-limited view is fully declared
1280 ("premature usage of incomplete}", N, First_Subtype (T));
1283 -- Need comments for these tests ???
1285 elsif Has_Private_Component (T)
1286 and then not Is_Generic_Type (Root_Type (T))
1287 and then not In_Spec_Expression
1289 -- Special case: if T is the anonymous type created for a single
1290 -- task or protected object, use the name of the source object.
1292 if Is_Concurrent_Type (T)
1293 and then not Comes_From_Source (T)
1294 and then Nkind (N) = N_Object_Declaration
1296 Error_Msg_NE ("type of& has incomplete component", N,
1297 Defining_Identifier (N));
1301 ("premature usage of incomplete}", N, First_Subtype (T));
1304 end Check_Fully_Declared;
1306 -------------------------
1307 -- Check_Nested_Access --
1308 -------------------------
1310 procedure Check_Nested_Access (Ent : Entity_Id) is
1311 Scop : constant Entity_Id := Current_Scope;
1312 Current_Subp : Entity_Id;
1313 Enclosing : Entity_Id;
1316 -- Currently only enabled for VM back-ends for efficiency, should we
1317 -- enable it more systematically ???
1319 -- Check for Is_Imported needs commenting below ???
1321 if VM_Target /= No_VM
1322 and then (Ekind (Ent) = E_Variable
1324 Ekind (Ent) = E_Constant
1326 Ekind (Ent) = E_Loop_Parameter)
1327 and then Scope (Ent) /= Empty
1328 and then not Is_Library_Level_Entity (Ent)
1329 and then not Is_Imported (Ent)
1331 if Is_Subprogram (Scop)
1332 or else Is_Generic_Subprogram (Scop)
1333 or else Is_Entry (Scop)
1335 Current_Subp := Scop;
1337 Current_Subp := Current_Subprogram;
1340 Enclosing := Enclosing_Subprogram (Ent);
1342 if Enclosing /= Empty
1343 and then Enclosing /= Current_Subp
1345 Set_Has_Up_Level_Access (Ent, True);
1348 end Check_Nested_Access;
1350 ----------------------------
1351 -- Check_Order_Dependence --
1352 ----------------------------
1354 procedure Check_Order_Dependence is
1359 if Ada_Version < Ada_2012 then
1363 -- Ada 2012 AI05-0144-2: Dangerous order dependence. Actuals in nested
1364 -- calls within a construct have been collected. If one of them is
1365 -- writable and overlaps with another one, evaluation of the enclosing
1366 -- construct is nondeterministic. This is illegal in Ada 2012, but is
1367 -- treated as a warning for now.
1369 for J in 1 .. Actuals_In_Call.Last loop
1370 if Actuals_In_Call.Table (J).Is_Writable then
1371 Act1 := Actuals_In_Call.Table (J).Act;
1373 if Nkind (Act1) = N_Attribute_Reference then
1374 Act1 := Prefix (Act1);
1377 for K in 1 .. Actuals_In_Call.Last loop
1379 Act2 := Actuals_In_Call.Table (K).Act;
1381 if Nkind (Act2) = N_Attribute_Reference then
1382 Act2 := Prefix (Act2);
1385 if Actuals_In_Call.Table (K).Is_Writable
1392 elsif Denotes_Same_Object (Act1, Act2)
1393 and then Parent (Act1) /= Parent (Act2)
1396 ("result may differ if evaluated "
1397 & "after other actual in expression?", Act1);
1404 -- Remove checked actuals from table
1406 Actuals_In_Call.Set_Last (0);
1407 end Check_Order_Dependence;
1409 ------------------------------------------
1410 -- Check_Potentially_Blocking_Operation --
1411 ------------------------------------------
1413 procedure Check_Potentially_Blocking_Operation (N : Node_Id) is
1417 -- N is one of the potentially blocking operations listed in 9.5.1(8).
1418 -- When pragma Detect_Blocking is active, the run time will raise
1419 -- Program_Error. Here we only issue a warning, since we generally
1420 -- support the use of potentially blocking operations in the absence
1423 -- Indirect blocking through a subprogram call cannot be diagnosed
1424 -- statically without interprocedural analysis, so we do not attempt
1427 S := Scope (Current_Scope);
1428 while Present (S) and then S /= Standard_Standard loop
1429 if Is_Protected_Type (S) then
1431 ("potentially blocking operation in protected operation?", N);
1437 end Check_Potentially_Blocking_Operation;
1439 ------------------------------
1440 -- Check_Unprotected_Access --
1441 ------------------------------
1443 procedure Check_Unprotected_Access
1447 Cont_Encl_Typ : Entity_Id;
1448 Pref_Encl_Typ : Entity_Id;
1450 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id;
1451 -- Check whether Obj is a private component of a protected object.
1452 -- Return the protected type where the component resides, Empty
1455 function Is_Public_Operation return Boolean;
1456 -- Verify that the enclosing operation is callable from outside the
1457 -- protected object, to minimize false positives.
1459 ------------------------------
1460 -- Enclosing_Protected_Type --
1461 ------------------------------
1463 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id is
1465 if Is_Entity_Name (Obj) then
1467 Ent : Entity_Id := Entity (Obj);
1470 -- The object can be a renaming of a private component, use
1471 -- the original record component.
1473 if Is_Prival (Ent) then
1474 Ent := Prival_Link (Ent);
1477 if Is_Protected_Type (Scope (Ent)) then
1483 -- For indexed and selected components, recursively check the prefix
1485 if Nkind_In (Obj, N_Indexed_Component, N_Selected_Component) then
1486 return Enclosing_Protected_Type (Prefix (Obj));
1488 -- The object does not denote a protected component
1493 end Enclosing_Protected_Type;
1495 -------------------------
1496 -- Is_Public_Operation --
1497 -------------------------
1499 function Is_Public_Operation return Boolean is
1506 and then S /= Pref_Encl_Typ
1508 if Scope (S) = Pref_Encl_Typ then
1509 E := First_Entity (Pref_Encl_Typ);
1511 and then E /= First_Private_Entity (Pref_Encl_Typ)
1524 end Is_Public_Operation;
1526 -- Start of processing for Check_Unprotected_Access
1529 if Nkind (Expr) = N_Attribute_Reference
1530 and then Attribute_Name (Expr) = Name_Unchecked_Access
1532 Cont_Encl_Typ := Enclosing_Protected_Type (Context);
1533 Pref_Encl_Typ := Enclosing_Protected_Type (Prefix (Expr));
1535 -- Check whether we are trying to export a protected component to a
1536 -- context with an equal or lower access level.
1538 if Present (Pref_Encl_Typ)
1539 and then No (Cont_Encl_Typ)
1540 and then Is_Public_Operation
1541 and then Scope_Depth (Pref_Encl_Typ) >=
1542 Object_Access_Level (Context)
1545 ("?possible unprotected access to protected data", Expr);
1548 end Check_Unprotected_Access;
1554 procedure Check_VMS (Construct : Node_Id) is
1556 if not OpenVMS_On_Target then
1558 ("this construct is allowed only in Open'V'M'S", Construct);
1562 ------------------------
1563 -- Collect_Interfaces --
1564 ------------------------
1566 procedure Collect_Interfaces
1568 Ifaces_List : out Elist_Id;
1569 Exclude_Parents : Boolean := False;
1570 Use_Full_View : Boolean := True)
1572 procedure Collect (Typ : Entity_Id);
1573 -- Subsidiary subprogram used to traverse the whole list
1574 -- of directly and indirectly implemented interfaces
1580 procedure Collect (Typ : Entity_Id) is
1581 Ancestor : Entity_Id;
1589 -- Handle private types
1592 and then Is_Private_Type (Typ)
1593 and then Present (Full_View (Typ))
1595 Full_T := Full_View (Typ);
1598 -- Include the ancestor if we are generating the whole list of
1599 -- abstract interfaces.
1601 if Etype (Full_T) /= Typ
1603 -- Protect the frontend against wrong sources. For example:
1606 -- type A is tagged null record;
1607 -- type B is new A with private;
1608 -- type C is new A with private;
1610 -- type B is new C with null record;
1611 -- type C is new B with null record;
1614 and then Etype (Full_T) /= T
1616 Ancestor := Etype (Full_T);
1619 if Is_Interface (Ancestor)
1620 and then not Exclude_Parents
1622 Append_Unique_Elmt (Ancestor, Ifaces_List);
1626 -- Traverse the graph of ancestor interfaces
1628 if Is_Non_Empty_List (Abstract_Interface_List (Full_T)) then
1629 Id := First (Abstract_Interface_List (Full_T));
1630 while Present (Id) loop
1631 Iface := Etype (Id);
1633 -- Protect against wrong uses. For example:
1634 -- type I is interface;
1635 -- type O is tagged null record;
1636 -- type Wrong is new I and O with null record; -- ERROR
1638 if Is_Interface (Iface) then
1640 and then Etype (T) /= T
1641 and then Interface_Present_In_Ancestor (Etype (T), Iface)
1646 Append_Unique_Elmt (Iface, Ifaces_List);
1655 -- Start of processing for Collect_Interfaces
1658 pragma Assert (Is_Tagged_Type (T) or else Is_Concurrent_Type (T));
1659 Ifaces_List := New_Elmt_List;
1661 end Collect_Interfaces;
1663 ----------------------------------
1664 -- Collect_Interface_Components --
1665 ----------------------------------
1667 procedure Collect_Interface_Components
1668 (Tagged_Type : Entity_Id;
1669 Components_List : out Elist_Id)
1671 procedure Collect (Typ : Entity_Id);
1672 -- Subsidiary subprogram used to climb to the parents
1678 procedure Collect (Typ : Entity_Id) is
1679 Tag_Comp : Entity_Id;
1680 Parent_Typ : Entity_Id;
1683 -- Handle private types
1685 if Present (Full_View (Etype (Typ))) then
1686 Parent_Typ := Full_View (Etype (Typ));
1688 Parent_Typ := Etype (Typ);
1691 if Parent_Typ /= Typ
1693 -- Protect the frontend against wrong sources. For example:
1696 -- type A is tagged null record;
1697 -- type B is new A with private;
1698 -- type C is new A with private;
1700 -- type B is new C with null record;
1701 -- type C is new B with null record;
1704 and then Parent_Typ /= Tagged_Type
1706 Collect (Parent_Typ);
1709 -- Collect the components containing tags of secondary dispatch
1712 Tag_Comp := Next_Tag_Component (First_Tag_Component (Typ));
1713 while Present (Tag_Comp) loop
1714 pragma Assert (Present (Related_Type (Tag_Comp)));
1715 Append_Elmt (Tag_Comp, Components_List);
1717 Tag_Comp := Next_Tag_Component (Tag_Comp);
1721 -- Start of processing for Collect_Interface_Components
1724 pragma Assert (Ekind (Tagged_Type) = E_Record_Type
1725 and then Is_Tagged_Type (Tagged_Type));
1727 Components_List := New_Elmt_List;
1728 Collect (Tagged_Type);
1729 end Collect_Interface_Components;
1731 -----------------------------
1732 -- Collect_Interfaces_Info --
1733 -----------------------------
1735 procedure Collect_Interfaces_Info
1737 Ifaces_List : out Elist_Id;
1738 Components_List : out Elist_Id;
1739 Tags_List : out Elist_Id)
1741 Comps_List : Elist_Id;
1742 Comp_Elmt : Elmt_Id;
1743 Comp_Iface : Entity_Id;
1744 Iface_Elmt : Elmt_Id;
1747 function Search_Tag (Iface : Entity_Id) return Entity_Id;
1748 -- Search for the secondary tag associated with the interface type
1749 -- Iface that is implemented by T.
1755 function Search_Tag (Iface : Entity_Id) return Entity_Id is
1758 if not Is_CPP_Class (T) then
1759 ADT := Next_Elmt (Next_Elmt (First_Elmt (Access_Disp_Table (T))));
1761 ADT := Next_Elmt (First_Elmt (Access_Disp_Table (T)));
1765 and then Is_Tag (Node (ADT))
1766 and then Related_Type (Node (ADT)) /= Iface
1768 -- Skip secondary dispatch table referencing thunks to user
1769 -- defined primitives covered by this interface.
1771 pragma Assert (Has_Suffix (Node (ADT), 'P'));
1774 -- Skip secondary dispatch tables of Ada types
1776 if not Is_CPP_Class (T) then
1778 -- Skip secondary dispatch table referencing thunks to
1779 -- predefined primitives.
1781 pragma Assert (Has_Suffix (Node (ADT), 'Y'));
1784 -- Skip secondary dispatch table referencing user-defined
1785 -- primitives covered by this interface.
1787 pragma Assert (Has_Suffix (Node (ADT), 'D'));
1790 -- Skip secondary dispatch table referencing predefined
1793 pragma Assert (Has_Suffix (Node (ADT), 'Z'));
1798 pragma Assert (Is_Tag (Node (ADT)));
1802 -- Start of processing for Collect_Interfaces_Info
1805 Collect_Interfaces (T, Ifaces_List);
1806 Collect_Interface_Components (T, Comps_List);
1808 -- Search for the record component and tag associated with each
1809 -- interface type of T.
1811 Components_List := New_Elmt_List;
1812 Tags_List := New_Elmt_List;
1814 Iface_Elmt := First_Elmt (Ifaces_List);
1815 while Present (Iface_Elmt) loop
1816 Iface := Node (Iface_Elmt);
1818 -- Associate the primary tag component and the primary dispatch table
1819 -- with all the interfaces that are parents of T
1821 if Is_Ancestor (Iface, T, Use_Full_View => True) then
1822 Append_Elmt (First_Tag_Component (T), Components_List);
1823 Append_Elmt (Node (First_Elmt (Access_Disp_Table (T))), Tags_List);
1825 -- Otherwise search for the tag component and secondary dispatch
1829 Comp_Elmt := First_Elmt (Comps_List);
1830 while Present (Comp_Elmt) loop
1831 Comp_Iface := Related_Type (Node (Comp_Elmt));
1833 if Comp_Iface = Iface
1834 or else Is_Ancestor (Iface, Comp_Iface, Use_Full_View => True)
1836 Append_Elmt (Node (Comp_Elmt), Components_List);
1837 Append_Elmt (Search_Tag (Comp_Iface), Tags_List);
1841 Next_Elmt (Comp_Elmt);
1843 pragma Assert (Present (Comp_Elmt));
1846 Next_Elmt (Iface_Elmt);
1848 end Collect_Interfaces_Info;
1850 ---------------------
1851 -- Collect_Parents --
1852 ---------------------
1854 procedure Collect_Parents
1856 List : out Elist_Id;
1857 Use_Full_View : Boolean := True)
1859 Current_Typ : Entity_Id := T;
1860 Parent_Typ : Entity_Id;
1863 List := New_Elmt_List;
1865 -- No action if the if the type has no parents
1867 if T = Etype (T) then
1872 Parent_Typ := Etype (Current_Typ);
1874 if Is_Private_Type (Parent_Typ)
1875 and then Present (Full_View (Parent_Typ))
1876 and then Use_Full_View
1878 Parent_Typ := Full_View (Base_Type (Parent_Typ));
1881 Append_Elmt (Parent_Typ, List);
1883 exit when Parent_Typ = Current_Typ;
1884 Current_Typ := Parent_Typ;
1886 end Collect_Parents;
1888 ----------------------------------
1889 -- Collect_Primitive_Operations --
1890 ----------------------------------
1892 function Collect_Primitive_Operations (T : Entity_Id) return Elist_Id is
1893 B_Type : constant Entity_Id := Base_Type (T);
1894 B_Decl : constant Node_Id := Original_Node (Parent (B_Type));
1895 B_Scope : Entity_Id := Scope (B_Type);
1899 Formal_Derived : Boolean := False;
1902 function Match (E : Entity_Id) return Boolean;
1903 -- True if E's base type is B_Type, or E is of an anonymous access type
1904 -- and the base type of its designated type is B_Type.
1910 function Match (E : Entity_Id) return Boolean is
1911 Etyp : Entity_Id := Etype (E);
1914 if Ekind (Etyp) = E_Anonymous_Access_Type then
1915 Etyp := Designated_Type (Etyp);
1918 return Base_Type (Etyp) = B_Type;
1921 -- Start of processing for Collect_Primitive_Operations
1924 -- For tagged types, the primitive operations are collected as they
1925 -- are declared, and held in an explicit list which is simply returned.
1927 if Is_Tagged_Type (B_Type) then
1928 return Primitive_Operations (B_Type);
1930 -- An untagged generic type that is a derived type inherits the
1931 -- primitive operations of its parent type. Other formal types only
1932 -- have predefined operators, which are not explicitly represented.
1934 elsif Is_Generic_Type (B_Type) then
1935 if Nkind (B_Decl) = N_Formal_Type_Declaration
1936 and then Nkind (Formal_Type_Definition (B_Decl))
1937 = N_Formal_Derived_Type_Definition
1939 Formal_Derived := True;
1941 return New_Elmt_List;
1945 Op_List := New_Elmt_List;
1947 if B_Scope = Standard_Standard then
1948 if B_Type = Standard_String then
1949 Append_Elmt (Standard_Op_Concat, Op_List);
1951 elsif B_Type = Standard_Wide_String then
1952 Append_Elmt (Standard_Op_Concatw, Op_List);
1958 elsif (Is_Package_Or_Generic_Package (B_Scope)
1960 Nkind (Parent (Declaration_Node (First_Subtype (T)))) /=
1962 or else Is_Derived_Type (B_Type)
1964 -- The primitive operations appear after the base type, except
1965 -- if the derivation happens within the private part of B_Scope
1966 -- and the type is a private type, in which case both the type
1967 -- and some primitive operations may appear before the base
1968 -- type, and the list of candidates starts after the type.
1970 if In_Open_Scopes (B_Scope)
1971 and then Scope (T) = B_Scope
1972 and then In_Private_Part (B_Scope)
1974 Id := Next_Entity (T);
1976 Id := Next_Entity (B_Type);
1979 while Present (Id) loop
1981 -- Note that generic formal subprograms are not
1982 -- considered to be primitive operations and thus
1983 -- are never inherited.
1985 if Is_Overloadable (Id)
1986 and then Nkind (Parent (Parent (Id)))
1987 not in N_Formal_Subprogram_Declaration
1995 Formal := First_Formal (Id);
1996 while Present (Formal) loop
1997 if Match (Formal) then
2002 Next_Formal (Formal);
2006 -- For a formal derived type, the only primitives are the
2007 -- ones inherited from the parent type. Operations appearing
2008 -- in the package declaration are not primitive for it.
2011 and then (not Formal_Derived
2012 or else Present (Alias (Id)))
2014 -- In the special case of an equality operator aliased to
2015 -- an overriding dispatching equality belonging to the same
2016 -- type, we don't include it in the list of primitives.
2017 -- This avoids inheriting multiple equality operators when
2018 -- deriving from untagged private types whose full type is
2019 -- tagged, which can otherwise cause ambiguities. Note that
2020 -- this should only happen for this kind of untagged parent
2021 -- type, since normally dispatching operations are inherited
2022 -- using the type's Primitive_Operations list.
2024 if Chars (Id) = Name_Op_Eq
2025 and then Is_Dispatching_Operation (Id)
2026 and then Present (Alias (Id))
2027 and then Present (Overridden_Operation (Alias (Id)))
2028 and then Base_Type (Etype (First_Entity (Id))) =
2029 Base_Type (Etype (First_Entity (Alias (Id))))
2033 -- Include the subprogram in the list of primitives
2036 Append_Elmt (Id, Op_List);
2043 -- For a type declared in System, some of its operations may
2044 -- appear in the target-specific extension to System.
2047 and then B_Scope = RTU_Entity (System)
2048 and then Present_System_Aux
2050 B_Scope := System_Aux_Id;
2051 Id := First_Entity (System_Aux_Id);
2057 end Collect_Primitive_Operations;
2059 -----------------------------------
2060 -- Compile_Time_Constraint_Error --
2061 -----------------------------------
2063 function Compile_Time_Constraint_Error
2066 Ent : Entity_Id := Empty;
2067 Loc : Source_Ptr := No_Location;
2068 Warn : Boolean := False) return Node_Id
2070 Msgc : String (1 .. Msg'Length + 2);
2071 -- Copy of message, with room for possible ? and ! at end
2081 -- A static constraint error in an instance body is not a fatal error.
2082 -- we choose to inhibit the message altogether, because there is no
2083 -- obvious node (for now) on which to post it. On the other hand the
2084 -- offending node must be replaced with a constraint_error in any case.
2086 -- No messages are generated if we already posted an error on this node
2088 if not Error_Posted (N) then
2089 if Loc /= No_Location then
2095 Msgc (1 .. Msg'Length) := Msg;
2098 -- Message is a warning, even in Ada 95 case
2100 if Msg (Msg'Last) = '?' then
2103 -- In Ada 83, all messages are warnings. In the private part and
2104 -- the body of an instance, constraint_checks are only warnings.
2105 -- We also make this a warning if the Warn parameter is set.
2108 or else (Ada_Version = Ada_83 and then Comes_From_Source (N))
2114 elsif In_Instance_Not_Visible then
2119 -- Otherwise we have a real error message (Ada 95 static case)
2120 -- and we make this an unconditional message. Note that in the
2121 -- warning case we do not make the message unconditional, it seems
2122 -- quite reasonable to delete messages like this (about exceptions
2123 -- that will be raised) in dead code.
2131 -- Should we generate a warning? The answer is not quite yes. The
2132 -- very annoying exception occurs in the case of a short circuit
2133 -- operator where the left operand is static and decisive. Climb
2134 -- parents to see if that is the case we have here. Conditional
2135 -- expressions with decisive conditions are a similar situation.
2143 -- And then with False as left operand
2145 if Nkind (P) = N_And_Then
2146 and then Compile_Time_Known_Value (Left_Opnd (P))
2147 and then Is_False (Expr_Value (Left_Opnd (P)))
2152 -- OR ELSE with True as left operand
2154 elsif Nkind (P) = N_Or_Else
2155 and then Compile_Time_Known_Value (Left_Opnd (P))
2156 and then Is_True (Expr_Value (Left_Opnd (P)))
2161 -- Conditional expression
2163 elsif Nkind (P) = N_Conditional_Expression then
2165 Cond : constant Node_Id := First (Expressions (P));
2166 Texp : constant Node_Id := Next (Cond);
2167 Fexp : constant Node_Id := Next (Texp);
2170 if Compile_Time_Known_Value (Cond) then
2172 -- Condition is True and we are in the right operand
2174 if Is_True (Expr_Value (Cond))
2175 and then OldP = Fexp
2180 -- Condition is False and we are in the left operand
2182 elsif Is_False (Expr_Value (Cond))
2183 and then OldP = Texp
2191 -- Special case for component association in aggregates, where
2192 -- we want to keep climbing up to the parent aggregate.
2194 elsif Nkind (P) = N_Component_Association
2195 and then Nkind (Parent (P)) = N_Aggregate
2199 -- Keep going if within subexpression
2202 exit when Nkind (P) not in N_Subexpr;
2207 if Present (Ent) then
2208 Error_Msg_NEL (Msgc (1 .. Msgl), N, Ent, Eloc);
2210 Error_Msg_NEL (Msgc (1 .. Msgl), N, Etype (N), Eloc);
2214 if Inside_Init_Proc then
2216 ("\?& will be raised for objects of this type",
2217 N, Standard_Constraint_Error, Eloc);
2220 ("\?& will be raised at run time",
2221 N, Standard_Constraint_Error, Eloc);
2226 ("\static expression fails Constraint_Check", Eloc);
2227 Set_Error_Posted (N);
2233 end Compile_Time_Constraint_Error;
2235 -----------------------
2236 -- Conditional_Delay --
2237 -----------------------
2239 procedure Conditional_Delay (New_Ent, Old_Ent : Entity_Id) is
2241 if Has_Delayed_Freeze (Old_Ent) and then not Is_Frozen (Old_Ent) then
2242 Set_Has_Delayed_Freeze (New_Ent);
2244 end Conditional_Delay;
2246 -------------------------
2247 -- Copy_Parameter_List --
2248 -------------------------
2250 function Copy_Parameter_List (Subp_Id : Entity_Id) return List_Id is
2251 Loc : constant Source_Ptr := Sloc (Subp_Id);
2256 if No (First_Formal (Subp_Id)) then
2260 Formal := First_Formal (Subp_Id);
2261 while Present (Formal) loop
2263 (Make_Parameter_Specification (Loc,
2264 Defining_Identifier =>
2265 Make_Defining_Identifier (Sloc (Formal),
2266 Chars => Chars (Formal)),
2267 In_Present => In_Present (Parent (Formal)),
2268 Out_Present => Out_Present (Parent (Formal)),
2270 New_Reference_To (Etype (Formal), Loc),
2272 New_Copy_Tree (Expression (Parent (Formal)))),
2275 Next_Formal (Formal);
2280 end Copy_Parameter_List;
2282 --------------------
2283 -- Current_Entity --
2284 --------------------
2286 -- The currently visible definition for a given identifier is the
2287 -- one most chained at the start of the visibility chain, i.e. the
2288 -- one that is referenced by the Node_Id value of the name of the
2289 -- given identifier.
2291 function Current_Entity (N : Node_Id) return Entity_Id is
2293 return Get_Name_Entity_Id (Chars (N));
2296 -----------------------------
2297 -- Current_Entity_In_Scope --
2298 -----------------------------
2300 function Current_Entity_In_Scope (N : Node_Id) return Entity_Id is
2302 CS : constant Entity_Id := Current_Scope;
2304 Transient_Case : constant Boolean := Scope_Is_Transient;
2307 E := Get_Name_Entity_Id (Chars (N));
2309 and then Scope (E) /= CS
2310 and then (not Transient_Case or else Scope (E) /= Scope (CS))
2316 end Current_Entity_In_Scope;
2322 function Current_Scope return Entity_Id is
2324 if Scope_Stack.Last = -1 then
2325 return Standard_Standard;
2328 C : constant Entity_Id :=
2329 Scope_Stack.Table (Scope_Stack.Last).Entity;
2334 return Standard_Standard;
2340 ------------------------
2341 -- Current_Subprogram --
2342 ------------------------
2344 function Current_Subprogram return Entity_Id is
2345 Scop : constant Entity_Id := Current_Scope;
2347 if Is_Subprogram (Scop) or else Is_Generic_Subprogram (Scop) then
2350 return Enclosing_Subprogram (Scop);
2352 end Current_Subprogram;
2354 ---------------------
2355 -- Defining_Entity --
2356 ---------------------
2358 function Defining_Entity (N : Node_Id) return Entity_Id is
2359 K : constant Node_Kind := Nkind (N);
2360 Err : Entity_Id := Empty;
2365 N_Subprogram_Declaration |
2366 N_Abstract_Subprogram_Declaration |
2368 N_Package_Declaration |
2369 N_Subprogram_Renaming_Declaration |
2370 N_Subprogram_Body_Stub |
2371 N_Generic_Subprogram_Declaration |
2372 N_Generic_Package_Declaration |
2373 N_Formal_Subprogram_Declaration
2375 return Defining_Entity (Specification (N));
2378 N_Component_Declaration |
2379 N_Defining_Program_Unit_Name |
2380 N_Discriminant_Specification |
2382 N_Entry_Declaration |
2383 N_Entry_Index_Specification |
2384 N_Exception_Declaration |
2385 N_Exception_Renaming_Declaration |
2386 N_Formal_Object_Declaration |
2387 N_Formal_Package_Declaration |
2388 N_Formal_Type_Declaration |
2389 N_Full_Type_Declaration |
2390 N_Implicit_Label_Declaration |
2391 N_Incomplete_Type_Declaration |
2392 N_Loop_Parameter_Specification |
2393 N_Number_Declaration |
2394 N_Object_Declaration |
2395 N_Object_Renaming_Declaration |
2396 N_Package_Body_Stub |
2397 N_Parameter_Specification |
2398 N_Private_Extension_Declaration |
2399 N_Private_Type_Declaration |
2401 N_Protected_Body_Stub |
2402 N_Protected_Type_Declaration |
2403 N_Single_Protected_Declaration |
2404 N_Single_Task_Declaration |
2405 N_Subtype_Declaration |
2408 N_Task_Type_Declaration
2410 return Defining_Identifier (N);
2413 return Defining_Entity (Proper_Body (N));
2416 N_Function_Instantiation |
2417 N_Function_Specification |
2418 N_Generic_Function_Renaming_Declaration |
2419 N_Generic_Package_Renaming_Declaration |
2420 N_Generic_Procedure_Renaming_Declaration |
2422 N_Package_Instantiation |
2423 N_Package_Renaming_Declaration |
2424 N_Package_Specification |
2425 N_Procedure_Instantiation |
2426 N_Procedure_Specification
2429 Nam : constant Node_Id := Defining_Unit_Name (N);
2432 if Nkind (Nam) in N_Entity then
2435 -- For Error, make up a name and attach to declaration
2436 -- so we can continue semantic analysis
2438 elsif Nam = Error then
2439 Err := Make_Temporary (Sloc (N), 'T');
2440 Set_Defining_Unit_Name (N, Err);
2443 -- If not an entity, get defining identifier
2446 return Defining_Identifier (Nam);
2450 when N_Block_Statement =>
2451 return Entity (Identifier (N));
2454 raise Program_Error;
2457 end Defining_Entity;
2459 --------------------------
2460 -- Denotes_Discriminant --
2461 --------------------------
2463 function Denotes_Discriminant
2465 Check_Concurrent : Boolean := False) return Boolean
2469 if not Is_Entity_Name (N)
2470 or else No (Entity (N))
2477 -- If we are checking for a protected type, the discriminant may have
2478 -- been rewritten as the corresponding discriminal of the original type
2479 -- or of the corresponding concurrent record, depending on whether we
2480 -- are in the spec or body of the protected type.
2482 return Ekind (E) = E_Discriminant
2485 and then Ekind (E) = E_In_Parameter
2486 and then Present (Discriminal_Link (E))
2488 (Is_Concurrent_Type (Scope (Discriminal_Link (E)))
2490 Is_Concurrent_Record_Type (Scope (Discriminal_Link (E)))));
2492 end Denotes_Discriminant;
2494 -------------------------
2495 -- Denotes_Same_Object --
2496 -------------------------
2498 function Denotes_Same_Object (A1, A2 : Node_Id) return Boolean is
2499 Obj1 : Node_Id := A1;
2500 Obj2 : Node_Id := A2;
2502 procedure Check_Renaming (Obj : in out Node_Id);
2503 -- If an object is a renaming, examine renamed object. If it is a
2504 -- dereference of a variable, or an indexed expression with non-constant
2505 -- indexes, no overlap check can be reported.
2507 --------------------
2508 -- Check_Renaming --
2509 --------------------
2511 procedure Check_Renaming (Obj : in out Node_Id) is
2513 if Is_Entity_Name (Obj)
2514 and then Present (Renamed_Entity (Entity (Obj)))
2516 Obj := Renamed_Entity (Entity (Obj));
2517 if Nkind (Obj) = N_Explicit_Dereference
2518 and then Is_Variable (Prefix (Obj))
2522 elsif Nkind (Obj) = N_Indexed_Component then
2527 Indx := First (Expressions (Obj));
2528 while Present (Indx) loop
2529 if not Is_OK_Static_Expression (Indx) then
2541 -- Start of processing for Denotes_Same_Object
2544 Check_Renaming (Obj1);
2545 Check_Renaming (Obj2);
2553 -- If we have entity names, then must be same entity
2555 if Is_Entity_Name (Obj1) then
2556 if Is_Entity_Name (Obj2) then
2557 return Entity (Obj1) = Entity (Obj2);
2562 -- No match if not same node kind
2564 elsif Nkind (Obj1) /= Nkind (Obj2) then
2567 -- For selected components, must have same prefix and selector
2569 elsif Nkind (Obj1) = N_Selected_Component then
2570 return Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2))
2572 Entity (Selector_Name (Obj1)) = Entity (Selector_Name (Obj2));
2574 -- For explicit dereferences, prefixes must be same
2576 elsif Nkind (Obj1) = N_Explicit_Dereference then
2577 return Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2));
2579 -- For indexed components, prefixes and all subscripts must be the same
2581 elsif Nkind (Obj1) = N_Indexed_Component then
2582 if Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2)) then
2588 Indx1 := First (Expressions (Obj1));
2589 Indx2 := First (Expressions (Obj2));
2590 while Present (Indx1) loop
2592 -- Indexes must denote the same static value or same object
2594 if Is_OK_Static_Expression (Indx1) then
2595 if not Is_OK_Static_Expression (Indx2) then
2598 elsif Expr_Value (Indx1) /= Expr_Value (Indx2) then
2602 elsif not Denotes_Same_Object (Indx1, Indx2) then
2616 -- For slices, prefixes must match and bounds must match
2618 elsif Nkind (Obj1) = N_Slice
2619 and then Denotes_Same_Object (Prefix (Obj1), Prefix (Obj2))
2622 Lo1, Lo2, Hi1, Hi2 : Node_Id;
2625 Get_Index_Bounds (Etype (Obj1), Lo1, Hi1);
2626 Get_Index_Bounds (Etype (Obj2), Lo2, Hi2);
2628 -- Check whether bounds are statically identical. There is no
2629 -- attempt to detect partial overlap of slices.
2631 return Denotes_Same_Object (Lo1, Lo2)
2632 and then Denotes_Same_Object (Hi1, Hi2);
2635 -- Literals will appear as indexes. Isn't this where we should check
2636 -- Known_At_Compile_Time at least if we are generating warnings ???
2638 elsif Nkind (Obj1) = N_Integer_Literal then
2639 return Intval (Obj1) = Intval (Obj2);
2644 end Denotes_Same_Object;
2646 -------------------------
2647 -- Denotes_Same_Prefix --
2648 -------------------------
2650 function Denotes_Same_Prefix (A1, A2 : Node_Id) return Boolean is
2653 if Is_Entity_Name (A1) then
2654 if Nkind_In (A2, N_Selected_Component, N_Indexed_Component)
2655 and then not Is_Access_Type (Etype (A1))
2657 return Denotes_Same_Object (A1, Prefix (A2))
2658 or else Denotes_Same_Prefix (A1, Prefix (A2));
2663 elsif Is_Entity_Name (A2) then
2664 return Denotes_Same_Prefix (A2, A1);
2666 elsif Nkind_In (A1, N_Selected_Component, N_Indexed_Component, N_Slice)
2668 Nkind_In (A2, N_Selected_Component, N_Indexed_Component, N_Slice)
2671 Root1, Root2 : Node_Id;
2672 Depth1, Depth2 : Int := 0;
2675 Root1 := Prefix (A1);
2676 while not Is_Entity_Name (Root1) loop
2678 (Root1, N_Selected_Component, N_Indexed_Component)
2682 Root1 := Prefix (Root1);
2685 Depth1 := Depth1 + 1;
2688 Root2 := Prefix (A2);
2689 while not Is_Entity_Name (Root2) loop
2691 (Root2, N_Selected_Component, N_Indexed_Component)
2695 Root2 := Prefix (Root2);
2698 Depth2 := Depth2 + 1;
2701 -- If both have the same depth and they do not denote the same
2702 -- object, they are disjoint and not warning is needed.
2704 if Depth1 = Depth2 then
2707 elsif Depth1 > Depth2 then
2708 Root1 := Prefix (A1);
2709 for I in 1 .. Depth1 - Depth2 - 1 loop
2710 Root1 := Prefix (Root1);
2713 return Denotes_Same_Object (Root1, A2);
2716 Root2 := Prefix (A2);
2717 for I in 1 .. Depth2 - Depth1 - 1 loop
2718 Root2 := Prefix (Root2);
2721 return Denotes_Same_Object (A1, Root2);
2728 end Denotes_Same_Prefix;
2730 ----------------------
2731 -- Denotes_Variable --
2732 ----------------------
2734 function Denotes_Variable (N : Node_Id) return Boolean is
2736 return Is_Variable (N) and then Paren_Count (N) = 0;
2737 end Denotes_Variable;
2739 -----------------------------
2740 -- Depends_On_Discriminant --
2741 -----------------------------
2743 function Depends_On_Discriminant (N : Node_Id) return Boolean is
2748 Get_Index_Bounds (N, L, H);
2749 return Denotes_Discriminant (L) or else Denotes_Discriminant (H);
2750 end Depends_On_Discriminant;
2752 -------------------------
2753 -- Designate_Same_Unit --
2754 -------------------------
2756 function Designate_Same_Unit
2758 Name2 : Node_Id) return Boolean
2760 K1 : constant Node_Kind := Nkind (Name1);
2761 K2 : constant Node_Kind := Nkind (Name2);
2763 function Prefix_Node (N : Node_Id) return Node_Id;
2764 -- Returns the parent unit name node of a defining program unit name
2765 -- or the prefix if N is a selected component or an expanded name.
2767 function Select_Node (N : Node_Id) return Node_Id;
2768 -- Returns the defining identifier node of a defining program unit
2769 -- name or the selector node if N is a selected component or an
2776 function Prefix_Node (N : Node_Id) return Node_Id is
2778 if Nkind (N) = N_Defining_Program_Unit_Name then
2790 function Select_Node (N : Node_Id) return Node_Id is
2792 if Nkind (N) = N_Defining_Program_Unit_Name then
2793 return Defining_Identifier (N);
2796 return Selector_Name (N);
2800 -- Start of processing for Designate_Next_Unit
2803 if (K1 = N_Identifier or else
2804 K1 = N_Defining_Identifier)
2806 (K2 = N_Identifier or else
2807 K2 = N_Defining_Identifier)
2809 return Chars (Name1) = Chars (Name2);
2812 (K1 = N_Expanded_Name or else
2813 K1 = N_Selected_Component or else
2814 K1 = N_Defining_Program_Unit_Name)
2816 (K2 = N_Expanded_Name or else
2817 K2 = N_Selected_Component or else
2818 K2 = N_Defining_Program_Unit_Name)
2821 (Chars (Select_Node (Name1)) = Chars (Select_Node (Name2)))
2823 Designate_Same_Unit (Prefix_Node (Name1), Prefix_Node (Name2));
2828 end Designate_Same_Unit;
2830 --------------------------
2831 -- Enclosing_CPP_Parent --
2832 --------------------------
2834 function Enclosing_CPP_Parent (Typ : Entity_Id) return Entity_Id is
2835 Parent_Typ : Entity_Id := Typ;
2838 while not Is_CPP_Class (Parent_Typ)
2839 and then Etype (Parent_Typ) /= Parent_Typ
2841 Parent_Typ := Etype (Parent_Typ);
2843 if Is_Private_Type (Parent_Typ) then
2844 Parent_Typ := Full_View (Base_Type (Parent_Typ));
2848 pragma Assert (Is_CPP_Class (Parent_Typ));
2850 end Enclosing_CPP_Parent;
2852 ----------------------------
2853 -- Enclosing_Generic_Body --
2854 ----------------------------
2856 function Enclosing_Generic_Body
2857 (N : Node_Id) return Node_Id
2865 while Present (P) loop
2866 if Nkind (P) = N_Package_Body
2867 or else Nkind (P) = N_Subprogram_Body
2869 Spec := Corresponding_Spec (P);
2871 if Present (Spec) then
2872 Decl := Unit_Declaration_Node (Spec);
2874 if Nkind (Decl) = N_Generic_Package_Declaration
2875 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2886 end Enclosing_Generic_Body;
2888 ----------------------------
2889 -- Enclosing_Generic_Unit --
2890 ----------------------------
2892 function Enclosing_Generic_Unit
2893 (N : Node_Id) return Node_Id
2901 while Present (P) loop
2902 if Nkind (P) = N_Generic_Package_Declaration
2903 or else Nkind (P) = N_Generic_Subprogram_Declaration
2907 elsif Nkind (P) = N_Package_Body
2908 or else Nkind (P) = N_Subprogram_Body
2910 Spec := Corresponding_Spec (P);
2912 if Present (Spec) then
2913 Decl := Unit_Declaration_Node (Spec);
2915 if Nkind (Decl) = N_Generic_Package_Declaration
2916 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2927 end Enclosing_Generic_Unit;
2929 -------------------------------
2930 -- Enclosing_Lib_Unit_Entity --
2931 -------------------------------
2933 function Enclosing_Lib_Unit_Entity return Entity_Id is
2934 Unit_Entity : Entity_Id;
2937 -- Look for enclosing library unit entity by following scope links.
2938 -- Equivalent to, but faster than indexing through the scope stack.
2940 Unit_Entity := Current_Scope;
2941 while (Present (Scope (Unit_Entity))
2942 and then Scope (Unit_Entity) /= Standard_Standard)
2943 and not Is_Child_Unit (Unit_Entity)
2945 Unit_Entity := Scope (Unit_Entity);
2949 end Enclosing_Lib_Unit_Entity;
2951 -----------------------------
2952 -- Enclosing_Lib_Unit_Node --
2953 -----------------------------
2955 function Enclosing_Lib_Unit_Node (N : Node_Id) return Node_Id is
2956 Current_Node : Node_Id;
2960 while Present (Current_Node)
2961 and then Nkind (Current_Node) /= N_Compilation_Unit
2963 Current_Node := Parent (Current_Node);
2966 if Nkind (Current_Node) /= N_Compilation_Unit then
2970 return Current_Node;
2971 end Enclosing_Lib_Unit_Node;
2973 -----------------------
2974 -- Enclosing_Package --
2975 -----------------------
2977 function Enclosing_Package (E : Entity_Id) return Entity_Id is
2978 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
2981 if Dynamic_Scope = Standard_Standard then
2982 return Standard_Standard;
2984 elsif Dynamic_Scope = Empty then
2987 elsif Ekind_In (Dynamic_Scope, E_Package, E_Package_Body,
2990 return Dynamic_Scope;
2993 return Enclosing_Package (Dynamic_Scope);
2995 end Enclosing_Package;
2997 --------------------------
2998 -- Enclosing_Subprogram --
2999 --------------------------
3001 function Enclosing_Subprogram (E : Entity_Id) return Entity_Id is
3002 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
3005 if Dynamic_Scope = Standard_Standard then
3008 elsif Dynamic_Scope = Empty then
3011 elsif Ekind (Dynamic_Scope) = E_Subprogram_Body then
3012 return Corresponding_Spec (Parent (Parent (Dynamic_Scope)));
3014 elsif Ekind (Dynamic_Scope) = E_Block
3015 or else Ekind (Dynamic_Scope) = E_Return_Statement
3017 return Enclosing_Subprogram (Dynamic_Scope);
3019 elsif Ekind (Dynamic_Scope) = E_Task_Type then
3020 return Get_Task_Body_Procedure (Dynamic_Scope);
3022 elsif Ekind (Dynamic_Scope) = E_Limited_Private_Type
3023 and then Present (Full_View (Dynamic_Scope))
3024 and then Ekind (Full_View (Dynamic_Scope)) = E_Task_Type
3026 return Get_Task_Body_Procedure (Full_View (Dynamic_Scope));
3028 -- No body is generated if the protected operation is eliminated
3030 elsif Convention (Dynamic_Scope) = Convention_Protected
3031 and then not Is_Eliminated (Dynamic_Scope)
3032 and then Present (Protected_Body_Subprogram (Dynamic_Scope))
3034 return Protected_Body_Subprogram (Dynamic_Scope);
3037 return Dynamic_Scope;
3039 end Enclosing_Subprogram;
3041 ------------------------
3042 -- Ensure_Freeze_Node --
3043 ------------------------
3045 procedure Ensure_Freeze_Node (E : Entity_Id) is
3049 if No (Freeze_Node (E)) then
3050 FN := Make_Freeze_Entity (Sloc (E));
3051 Set_Has_Delayed_Freeze (E);
3052 Set_Freeze_Node (E, FN);
3053 Set_Access_Types_To_Process (FN, No_Elist);
3054 Set_TSS_Elist (FN, No_Elist);
3057 end Ensure_Freeze_Node;
3063 procedure Enter_Name (Def_Id : Entity_Id) is
3064 C : constant Entity_Id := Current_Entity (Def_Id);
3065 E : constant Entity_Id := Current_Entity_In_Scope (Def_Id);
3066 S : constant Entity_Id := Current_Scope;
3069 Generate_Definition (Def_Id);
3071 -- Add new name to current scope declarations. Check for duplicate
3072 -- declaration, which may or may not be a genuine error.
3076 -- Case of previous entity entered because of a missing declaration
3077 -- or else a bad subtype indication. Best is to use the new entity,
3078 -- and make the previous one invisible.
3080 if Etype (E) = Any_Type then
3081 Set_Is_Immediately_Visible (E, False);
3083 -- Case of renaming declaration constructed for package instances.
3084 -- if there is an explicit declaration with the same identifier,
3085 -- the renaming is not immediately visible any longer, but remains
3086 -- visible through selected component notation.
3088 elsif Nkind (Parent (E)) = N_Package_Renaming_Declaration
3089 and then not Comes_From_Source (E)
3091 Set_Is_Immediately_Visible (E, False);
3093 -- The new entity may be the package renaming, which has the same
3094 -- same name as a generic formal which has been seen already.
3096 elsif Nkind (Parent (Def_Id)) = N_Package_Renaming_Declaration
3097 and then not Comes_From_Source (Def_Id)
3099 Set_Is_Immediately_Visible (E, False);
3101 -- For a fat pointer corresponding to a remote access to subprogram,
3102 -- we use the same identifier as the RAS type, so that the proper
3103 -- name appears in the stub. This type is only retrieved through
3104 -- the RAS type and never by visibility, and is not added to the
3105 -- visibility list (see below).
3107 elsif Nkind (Parent (Def_Id)) = N_Full_Type_Declaration
3108 and then Present (Corresponding_Remote_Type (Def_Id))
3112 -- Case of an implicit operation or derived literal. The new entity
3113 -- hides the implicit one, which is removed from all visibility,
3114 -- i.e. the entity list of its scope, and homonym chain of its name.
3116 elsif (Is_Overloadable (E) and then Is_Inherited_Operation (E))
3117 or else Is_Internal (E)
3121 Prev_Vis : Entity_Id;
3122 Decl : constant Node_Id := Parent (E);
3125 -- If E is an implicit declaration, it cannot be the first
3126 -- entity in the scope.
3128 Prev := First_Entity (Current_Scope);
3129 while Present (Prev)
3130 and then Next_Entity (Prev) /= E
3137 -- If E is not on the entity chain of the current scope,
3138 -- it is an implicit declaration in the generic formal
3139 -- part of a generic subprogram. When analyzing the body,
3140 -- the generic formals are visible but not on the entity
3141 -- chain of the subprogram. The new entity will become
3142 -- the visible one in the body.
3145 (Nkind (Parent (Decl)) = N_Generic_Subprogram_Declaration);
3149 Set_Next_Entity (Prev, Next_Entity (E));
3151 if No (Next_Entity (Prev)) then
3152 Set_Last_Entity (Current_Scope, Prev);
3155 if E = Current_Entity (E) then
3159 Prev_Vis := Current_Entity (E);
3160 while Homonym (Prev_Vis) /= E loop
3161 Prev_Vis := Homonym (Prev_Vis);
3165 if Present (Prev_Vis) then
3167 -- Skip E in the visibility chain
3169 Set_Homonym (Prev_Vis, Homonym (E));
3172 Set_Name_Entity_Id (Chars (E), Homonym (E));
3177 -- This section of code could use a comment ???
3179 elsif Present (Etype (E))
3180 and then Is_Concurrent_Type (Etype (E))
3185 -- If the homograph is a protected component renaming, it should not
3186 -- be hiding the current entity. Such renamings are treated as weak
3189 elsif Is_Prival (E) then
3190 Set_Is_Immediately_Visible (E, False);
3192 -- In this case the current entity is a protected component renaming.
3193 -- Perform minimal decoration by setting the scope and return since
3194 -- the prival should not be hiding other visible entities.
3196 elsif Is_Prival (Def_Id) then
3197 Set_Scope (Def_Id, Current_Scope);
3200 -- Analogous to privals, the discriminal generated for an entry index
3201 -- parameter acts as a weak declaration. Perform minimal decoration
3202 -- to avoid bogus errors.
3204 elsif Is_Discriminal (Def_Id)
3205 and then Ekind (Discriminal_Link (Def_Id)) = E_Entry_Index_Parameter
3207 Set_Scope (Def_Id, Current_Scope);
3210 -- In the body or private part of an instance, a type extension may
3211 -- introduce a component with the same name as that of an actual. The
3212 -- legality rule is not enforced, but the semantics of the full type
3213 -- with two components of same name are not clear at this point???
3215 elsif In_Instance_Not_Visible then
3218 -- When compiling a package body, some child units may have become
3219 -- visible. They cannot conflict with local entities that hide them.
3221 elsif Is_Child_Unit (E)
3222 and then In_Open_Scopes (Scope (E))
3223 and then not Is_Immediately_Visible (E)
3227 -- Conversely, with front-end inlining we may compile the parent body
3228 -- first, and a child unit subsequently. The context is now the
3229 -- parent spec, and body entities are not visible.
3231 elsif Is_Child_Unit (Def_Id)
3232 and then Is_Package_Body_Entity (E)
3233 and then not In_Package_Body (Current_Scope)
3237 -- Case of genuine duplicate declaration
3240 Error_Msg_Sloc := Sloc (E);
3242 -- If the previous declaration is an incomplete type declaration
3243 -- this may be an attempt to complete it with a private type. The
3244 -- following avoids confusing cascaded errors.
3246 if Nkind (Parent (E)) = N_Incomplete_Type_Declaration
3247 and then Nkind (Parent (Def_Id)) = N_Private_Type_Declaration
3250 ("incomplete type cannot be completed with a private " &
3251 "declaration", Parent (Def_Id));
3252 Set_Is_Immediately_Visible (E, False);
3253 Set_Full_View (E, Def_Id);
3255 -- An inherited component of a record conflicts with a new
3256 -- discriminant. The discriminant is inserted first in the scope,
3257 -- but the error should be posted on it, not on the component.
3259 elsif Ekind (E) = E_Discriminant
3260 and then Present (Scope (Def_Id))
3261 and then Scope (Def_Id) /= Current_Scope
3263 Error_Msg_Sloc := Sloc (Def_Id);
3264 Error_Msg_N ("& conflicts with declaration#", E);
3267 -- If the name of the unit appears in its own context clause, a
3268 -- dummy package with the name has already been created, and the
3269 -- error emitted. Try to continue quietly.
3271 elsif Error_Posted (E)
3272 and then Sloc (E) = No_Location
3273 and then Nkind (Parent (E)) = N_Package_Specification
3274 and then Current_Scope = Standard_Standard
3276 Set_Scope (Def_Id, Current_Scope);
3280 Error_Msg_N ("& conflicts with declaration#", Def_Id);
3282 -- Avoid cascaded messages with duplicate components in
3285 if Ekind_In (E, E_Component, E_Discriminant) then
3290 if Nkind (Parent (Parent (Def_Id))) =
3291 N_Generic_Subprogram_Declaration
3293 Defining_Entity (Specification (Parent (Parent (Def_Id))))
3295 Error_Msg_N ("\generic units cannot be overloaded", Def_Id);
3298 -- If entity is in standard, then we are in trouble, because it
3299 -- means that we have a library package with a duplicated name.
3300 -- That's hard to recover from, so abort!
3302 if S = Standard_Standard then
3303 raise Unrecoverable_Error;
3305 -- Otherwise we continue with the declaration. Having two
3306 -- identical declarations should not cause us too much trouble!
3314 -- If we fall through, declaration is OK, at least OK enough to continue
3316 -- If Def_Id is a discriminant or a record component we are in the midst
3317 -- of inheriting components in a derived record definition. Preserve
3318 -- their Ekind and Etype.
3320 if Ekind_In (Def_Id, E_Discriminant, E_Component) then
3323 -- If a type is already set, leave it alone (happens when a type
3324 -- declaration is reanalyzed following a call to the optimizer).
3326 elsif Present (Etype (Def_Id)) then
3329 -- Otherwise, the kind E_Void insures that premature uses of the entity
3330 -- will be detected. Any_Type insures that no cascaded errors will occur
3333 Set_Ekind (Def_Id, E_Void);
3334 Set_Etype (Def_Id, Any_Type);
3337 -- Inherited discriminants and components in derived record types are
3338 -- immediately visible. Itypes are not.
3340 if Ekind_In (Def_Id, E_Discriminant, E_Component)
3341 or else (No (Corresponding_Remote_Type (Def_Id))
3342 and then not Is_Itype (Def_Id))
3344 Set_Is_Immediately_Visible (Def_Id);
3345 Set_Current_Entity (Def_Id);
3348 Set_Homonym (Def_Id, C);
3349 Append_Entity (Def_Id, S);
3350 Set_Public_Status (Def_Id);
3352 -- Declaring a homonym is not allowed in SPARK ...
3355 and then Restriction_Check_Required (SPARK)
3359 Enclosing_Subp : constant Node_Id := Enclosing_Subprogram (Def_Id);
3360 Enclosing_Pack : constant Node_Id := Enclosing_Package (Def_Id);
3361 Other_Scope : constant Node_Id := Enclosing_Dynamic_Scope (C);
3364 -- ... unless the new declaration is in a subprogram, and the
3365 -- visible declaration is a variable declaration or a parameter
3366 -- specification outside that subprogram.
3368 if Present (Enclosing_Subp)
3369 and then Nkind_In (Parent (C), N_Object_Declaration,
3370 N_Parameter_Specification)
3371 and then not Scope_Within_Or_Same (Other_Scope, Enclosing_Subp)
3375 -- ... or the new declaration is in a package, and the visible
3376 -- declaration occurs outside that package.
3378 elsif Present (Enclosing_Pack)
3379 and then not Scope_Within_Or_Same (Other_Scope, Enclosing_Pack)
3383 -- ... or the new declaration is a component declaration in a
3384 -- record type definition.
3386 elsif Nkind (Parent (Def_Id)) = N_Component_Declaration then
3389 -- Don't issue error for non-source entities
3391 elsif Comes_From_Source (Def_Id)
3392 and then Comes_From_Source (C)
3394 Error_Msg_Sloc := Sloc (C);
3395 Check_SPARK_Restriction
3396 ("redeclaration of identifier &#", Def_Id);
3401 -- Warn if new entity hides an old one
3403 if Warn_On_Hiding and then Present (C)
3405 -- Don't warn for record components since they always have a well
3406 -- defined scope which does not confuse other uses. Note that in
3407 -- some cases, Ekind has not been set yet.
3409 and then Ekind (C) /= E_Component
3410 and then Ekind (C) /= E_Discriminant
3411 and then Nkind (Parent (C)) /= N_Component_Declaration
3412 and then Ekind (Def_Id) /= E_Component
3413 and then Ekind (Def_Id) /= E_Discriminant
3414 and then Nkind (Parent (Def_Id)) /= N_Component_Declaration
3416 -- Don't warn for one character variables. It is too common to use
3417 -- such variables as locals and will just cause too many false hits.
3419 and then Length_Of_Name (Chars (C)) /= 1
3421 -- Don't warn for non-source entities
3423 and then Comes_From_Source (C)
3424 and then Comes_From_Source (Def_Id)
3426 -- Don't warn unless entity in question is in extended main source
3428 and then In_Extended_Main_Source_Unit (Def_Id)
3430 -- Finally, the hidden entity must be either immediately visible or
3431 -- use visible (i.e. from a used package).
3434 (Is_Immediately_Visible (C)
3436 Is_Potentially_Use_Visible (C))
3438 Error_Msg_Sloc := Sloc (C);
3439 Error_Msg_N ("declaration hides &#?", Def_Id);
3443 --------------------------
3444 -- Explain_Limited_Type --
3445 --------------------------
3447 procedure Explain_Limited_Type (T : Entity_Id; N : Node_Id) is
3451 -- For array, component type must be limited
3453 if Is_Array_Type (T) then
3454 Error_Msg_Node_2 := T;
3456 ("\component type& of type& is limited", N, Component_Type (T));
3457 Explain_Limited_Type (Component_Type (T), N);
3459 elsif Is_Record_Type (T) then
3461 -- No need for extra messages if explicit limited record
3463 if Is_Limited_Record (Base_Type (T)) then
3467 -- Otherwise find a limited component. Check only components that
3468 -- come from source, or inherited components that appear in the
3469 -- source of the ancestor.
3471 C := First_Component (T);
3472 while Present (C) loop
3473 if Is_Limited_Type (Etype (C))
3475 (Comes_From_Source (C)
3477 (Present (Original_Record_Component (C))
3479 Comes_From_Source (Original_Record_Component (C))))
3481 Error_Msg_Node_2 := T;
3482 Error_Msg_NE ("\component& of type& has limited type", N, C);
3483 Explain_Limited_Type (Etype (C), N);
3490 -- The type may be declared explicitly limited, even if no component
3491 -- of it is limited, in which case we fall out of the loop.
3494 end Explain_Limited_Type;
3500 procedure Find_Actual
3502 Formal : out Entity_Id;
3505 Parnt : constant Node_Id := Parent (N);
3509 if (Nkind (Parnt) = N_Indexed_Component
3511 Nkind (Parnt) = N_Selected_Component)
3512 and then N = Prefix (Parnt)
3514 Find_Actual (Parnt, Formal, Call);
3517 elsif Nkind (Parnt) = N_Parameter_Association
3518 and then N = Explicit_Actual_Parameter (Parnt)
3520 Call := Parent (Parnt);
3522 elsif Nkind_In (Parnt, N_Procedure_Call_Statement, N_Function_Call) then
3531 -- If we have a call to a subprogram look for the parameter. Note that
3532 -- we exclude overloaded calls, since we don't know enough to be sure
3533 -- of giving the right answer in this case.
3535 if Is_Entity_Name (Name (Call))
3536 and then Present (Entity (Name (Call)))
3537 and then Is_Overloadable (Entity (Name (Call)))
3538 and then not Is_Overloaded (Name (Call))
3540 -- Fall here if we are definitely a parameter
3542 Actual := First_Actual (Call);
3543 Formal := First_Formal (Entity (Name (Call)));
3544 while Present (Formal) and then Present (Actual) loop
3548 Actual := Next_Actual (Actual);
3549 Formal := Next_Formal (Formal);
3554 -- Fall through here if we did not find matching actual
3560 ---------------------------
3561 -- Find_Body_Discriminal --
3562 ---------------------------
3564 function Find_Body_Discriminal
3565 (Spec_Discriminant : Entity_Id) return Entity_Id
3567 pragma Assert (Is_Concurrent_Record_Type (Scope (Spec_Discriminant)));
3569 Tsk : constant Entity_Id :=
3570 Corresponding_Concurrent_Type (Scope (Spec_Discriminant));
3574 -- Find discriminant of original concurrent type, and use its current
3575 -- discriminal, which is the renaming within the task/protected body.
3577 Disc := First_Discriminant (Tsk);
3578 while Present (Disc) loop
3579 if Chars (Disc) = Chars (Spec_Discriminant) then
3580 return Discriminal (Disc);
3583 Next_Discriminant (Disc);
3586 -- That loop should always succeed in finding a matching entry and
3587 -- returning. Fatal error if not.
3589 raise Program_Error;
3590 end Find_Body_Discriminal;
3592 -------------------------------------
3593 -- Find_Corresponding_Discriminant --
3594 -------------------------------------
3596 function Find_Corresponding_Discriminant
3598 Typ : Entity_Id) return Entity_Id
3600 Par_Disc : Entity_Id;
3601 Old_Disc : Entity_Id;
3602 New_Disc : Entity_Id;
3605 Par_Disc := Original_Record_Component (Original_Discriminant (Id));
3607 -- The original type may currently be private, and the discriminant
3608 -- only appear on its full view.
3610 if Is_Private_Type (Scope (Par_Disc))
3611 and then not Has_Discriminants (Scope (Par_Disc))
3612 and then Present (Full_View (Scope (Par_Disc)))
3614 Old_Disc := First_Discriminant (Full_View (Scope (Par_Disc)));
3616 Old_Disc := First_Discriminant (Scope (Par_Disc));
3619 if Is_Class_Wide_Type (Typ) then
3620 New_Disc := First_Discriminant (Root_Type (Typ));
3622 New_Disc := First_Discriminant (Typ);
3625 while Present (Old_Disc) and then Present (New_Disc) loop
3626 if Old_Disc = Par_Disc then
3629 Next_Discriminant (Old_Disc);
3630 Next_Discriminant (New_Disc);
3634 -- Should always find it
3636 raise Program_Error;
3637 end Find_Corresponding_Discriminant;
3639 --------------------------
3640 -- Find_Overlaid_Entity --
3641 --------------------------
3643 procedure Find_Overlaid_Entity
3645 Ent : out Entity_Id;
3651 -- We are looking for one of the two following forms:
3653 -- for X'Address use Y'Address
3657 -- Const : constant Address := expr;
3659 -- for X'Address use Const;
3661 -- In the second case, the expr is either Y'Address, or recursively a
3662 -- constant that eventually references Y'Address.
3667 if Nkind (N) = N_Attribute_Definition_Clause
3668 and then Chars (N) = Name_Address
3670 Expr := Expression (N);
3672 -- This loop checks the form of the expression for Y'Address,
3673 -- using recursion to deal with intermediate constants.
3676 -- Check for Y'Address
3678 if Nkind (Expr) = N_Attribute_Reference
3679 and then Attribute_Name (Expr) = Name_Address
3681 Expr := Prefix (Expr);
3684 -- Check for Const where Const is a constant entity
3686 elsif Is_Entity_Name (Expr)
3687 and then Ekind (Entity (Expr)) = E_Constant
3689 Expr := Constant_Value (Entity (Expr));
3691 -- Anything else does not need checking
3698 -- This loop checks the form of the prefix for an entity,
3699 -- using recursion to deal with intermediate components.
3702 -- Check for Y where Y is an entity
3704 if Is_Entity_Name (Expr) then
3705 Ent := Entity (Expr);
3708 -- Check for components
3711 Nkind_In (Expr, N_Selected_Component, N_Indexed_Component) then
3713 Expr := Prefix (Expr);
3716 -- Anything else does not need checking
3723 end Find_Overlaid_Entity;
3725 -------------------------
3726 -- Find_Parameter_Type --
3727 -------------------------
3729 function Find_Parameter_Type (Param : Node_Id) return Entity_Id is
3731 if Nkind (Param) /= N_Parameter_Specification then
3734 -- For an access parameter, obtain the type from the formal entity
3735 -- itself, because access to subprogram nodes do not carry a type.
3736 -- Shouldn't we always use the formal entity ???
3738 elsif Nkind (Parameter_Type (Param)) = N_Access_Definition then
3739 return Etype (Defining_Identifier (Param));
3742 return Etype (Parameter_Type (Param));
3744 end Find_Parameter_Type;
3746 -----------------------------
3747 -- Find_Static_Alternative --
3748 -----------------------------
3750 function Find_Static_Alternative (N : Node_Id) return Node_Id is
3751 Expr : constant Node_Id := Expression (N);
3752 Val : constant Uint := Expr_Value (Expr);
3757 Alt := First (Alternatives (N));
3760 if Nkind (Alt) /= N_Pragma then
3761 Choice := First (Discrete_Choices (Alt));
3762 while Present (Choice) loop
3764 -- Others choice, always matches
3766 if Nkind (Choice) = N_Others_Choice then
3769 -- Range, check if value is in the range
3771 elsif Nkind (Choice) = N_Range then
3773 Val >= Expr_Value (Low_Bound (Choice))
3775 Val <= Expr_Value (High_Bound (Choice));
3777 -- Choice is a subtype name. Note that we know it must
3778 -- be a static subtype, since otherwise it would have
3779 -- been diagnosed as illegal.
3781 elsif Is_Entity_Name (Choice)
3782 and then Is_Type (Entity (Choice))
3784 exit Search when Is_In_Range (Expr, Etype (Choice),
3785 Assume_Valid => False);
3787 -- Choice is a subtype indication
3789 elsif Nkind (Choice) = N_Subtype_Indication then
3791 C : constant Node_Id := Constraint (Choice);
3792 R : constant Node_Id := Range_Expression (C);
3796 Val >= Expr_Value (Low_Bound (R))
3798 Val <= Expr_Value (High_Bound (R));
3801 -- Choice is a simple expression
3804 exit Search when Val = Expr_Value (Choice);
3812 pragma Assert (Present (Alt));
3815 -- The above loop *must* terminate by finding a match, since
3816 -- we know the case statement is valid, and the value of the
3817 -- expression is known at compile time. When we fall out of
3818 -- the loop, Alt points to the alternative that we know will
3819 -- be selected at run time.
3822 end Find_Static_Alternative;
3828 function First_Actual (Node : Node_Id) return Node_Id is
3832 if No (Parameter_Associations (Node)) then
3836 N := First (Parameter_Associations (Node));
3838 if Nkind (N) = N_Parameter_Association then
3839 return First_Named_Actual (Node);
3845 -----------------------
3846 -- Gather_Components --
3847 -----------------------
3849 procedure Gather_Components
3851 Comp_List : Node_Id;
3852 Governed_By : List_Id;
3854 Report_Errors : out Boolean)
3858 Discrete_Choice : Node_Id;
3859 Comp_Item : Node_Id;
3861 Discrim : Entity_Id;
3862 Discrim_Name : Node_Id;
3863 Discrim_Value : Node_Id;
3866 Report_Errors := False;
3868 if No (Comp_List) or else Null_Present (Comp_List) then
3871 elsif Present (Component_Items (Comp_List)) then
3872 Comp_Item := First (Component_Items (Comp_List));
3878 while Present (Comp_Item) loop
3880 -- Skip the tag of a tagged record, the interface tags, as well
3881 -- as all items that are not user components (anonymous types,
3882 -- rep clauses, Parent field, controller field).
3884 if Nkind (Comp_Item) = N_Component_Declaration then
3886 Comp : constant Entity_Id := Defining_Identifier (Comp_Item);
3888 if not Is_Tag (Comp)
3889 and then Chars (Comp) /= Name_uParent
3891 Append_Elmt (Comp, Into);
3899 if No (Variant_Part (Comp_List)) then
3902 Discrim_Name := Name (Variant_Part (Comp_List));
3903 Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
3906 -- Look for the discriminant that governs this variant part.
3907 -- The discriminant *must* be in the Governed_By List
3909 Assoc := First (Governed_By);
3910 Find_Constraint : loop
3911 Discrim := First (Choices (Assoc));
3912 exit Find_Constraint when Chars (Discrim_Name) = Chars (Discrim)
3913 or else (Present (Corresponding_Discriminant (Entity (Discrim)))
3915 Chars (Corresponding_Discriminant (Entity (Discrim)))
3916 = Chars (Discrim_Name))
3917 or else Chars (Original_Record_Component (Entity (Discrim)))
3918 = Chars (Discrim_Name);
3920 if No (Next (Assoc)) then
3921 if not Is_Constrained (Typ)
3922 and then Is_Derived_Type (Typ)
3923 and then Present (Stored_Constraint (Typ))
3925 -- If the type is a tagged type with inherited discriminants,
3926 -- use the stored constraint on the parent in order to find
3927 -- the values of discriminants that are otherwise hidden by an
3928 -- explicit constraint. Renamed discriminants are handled in
3931 -- If several parent discriminants are renamed by a single
3932 -- discriminant of the derived type, the call to obtain the
3933 -- Corresponding_Discriminant field only retrieves the last
3934 -- of them. We recover the constraint on the others from the
3935 -- Stored_Constraint as well.
3942 D := First_Discriminant (Etype (Typ));
3943 C := First_Elmt (Stored_Constraint (Typ));
3944 while Present (D) and then Present (C) loop
3945 if Chars (Discrim_Name) = Chars (D) then
3946 if Is_Entity_Name (Node (C))
3947 and then Entity (Node (C)) = Entity (Discrim)
3949 -- D is renamed by Discrim, whose value is given in
3956 Make_Component_Association (Sloc (Typ),
3958 (New_Occurrence_Of (D, Sloc (Typ))),
3959 Duplicate_Subexpr_No_Checks (Node (C)));
3961 exit Find_Constraint;
3964 Next_Discriminant (D);
3971 if No (Next (Assoc)) then
3972 Error_Msg_NE (" missing value for discriminant&",
3973 First (Governed_By), Discrim_Name);
3974 Report_Errors := True;
3979 end loop Find_Constraint;
3981 Discrim_Value := Expression (Assoc);
3983 if not Is_OK_Static_Expression (Discrim_Value) then
3985 ("value for discriminant & must be static!",
3986 Discrim_Value, Discrim);
3987 Why_Not_Static (Discrim_Value);
3988 Report_Errors := True;
3992 Search_For_Discriminant_Value : declare
3998 UI_Discrim_Value : constant Uint := Expr_Value (Discrim_Value);
4001 Find_Discrete_Value : while Present (Variant) loop
4002 Discrete_Choice := First (Discrete_Choices (Variant));
4003 while Present (Discrete_Choice) loop
4005 exit Find_Discrete_Value when
4006 Nkind (Discrete_Choice) = N_Others_Choice;
4008 Get_Index_Bounds (Discrete_Choice, Low, High);
4010 UI_Low := Expr_Value (Low);
4011 UI_High := Expr_Value (High);
4013 exit Find_Discrete_Value when
4014 UI_Low <= UI_Discrim_Value
4016 UI_High >= UI_Discrim_Value;
4018 Next (Discrete_Choice);
4021 Next_Non_Pragma (Variant);
4022 end loop Find_Discrete_Value;
4023 end Search_For_Discriminant_Value;
4025 if No (Variant) then
4027 ("value of discriminant & is out of range", Discrim_Value, Discrim);
4028 Report_Errors := True;
4032 -- If we have found the corresponding choice, recursively add its
4033 -- components to the Into list.
4035 Gather_Components (Empty,
4036 Component_List (Variant), Governed_By, Into, Report_Errors);
4037 end Gather_Components;
4039 ------------------------
4040 -- Get_Actual_Subtype --
4041 ------------------------
4043 function Get_Actual_Subtype (N : Node_Id) return Entity_Id is
4044 Typ : constant Entity_Id := Etype (N);
4045 Utyp : Entity_Id := Underlying_Type (Typ);
4054 -- If what we have is an identifier that references a subprogram
4055 -- formal, or a variable or constant object, then we get the actual
4056 -- subtype from the referenced entity if one has been built.
4058 if Nkind (N) = N_Identifier
4060 (Is_Formal (Entity (N))
4061 or else Ekind (Entity (N)) = E_Constant
4062 or else Ekind (Entity (N)) = E_Variable)
4063 and then Present (Actual_Subtype (Entity (N)))
4065 return Actual_Subtype (Entity (N));
4067 -- Actual subtype of unchecked union is always itself. We never need
4068 -- the "real" actual subtype. If we did, we couldn't get it anyway
4069 -- because the discriminant is not available. The restrictions on
4070 -- Unchecked_Union are designed to make sure that this is OK.
4072 elsif Is_Unchecked_Union (Base_Type (Utyp)) then
4075 -- Here for the unconstrained case, we must find actual subtype
4076 -- No actual subtype is available, so we must build it on the fly.
4078 -- Checking the type, not the underlying type, for constrainedness
4079 -- seems to be necessary. Maybe all the tests should be on the type???
4081 elsif (not Is_Constrained (Typ))
4082 and then (Is_Array_Type (Utyp)
4083 or else (Is_Record_Type (Utyp)
4084 and then Has_Discriminants (Utyp)))
4085 and then not Has_Unknown_Discriminants (Utyp)
4086 and then not (Ekind (Utyp) = E_String_Literal_Subtype)
4088 -- Nothing to do if in spec expression (why not???)
4090 if In_Spec_Expression then
4093 elsif Is_Private_Type (Typ)
4094 and then not Has_Discriminants (Typ)
4096 -- If the type has no discriminants, there is no subtype to
4097 -- build, even if the underlying type is discriminated.
4101 -- Else build the actual subtype
4104 Decl := Build_Actual_Subtype (Typ, N);
4105 Atyp := Defining_Identifier (Decl);
4107 -- If Build_Actual_Subtype generated a new declaration then use it
4111 -- The actual subtype is an Itype, so analyze the declaration,
4112 -- but do not attach it to the tree, to get the type defined.
4114 Set_Parent (Decl, N);
4115 Set_Is_Itype (Atyp);
4116 Analyze (Decl, Suppress => All_Checks);
4117 Set_Associated_Node_For_Itype (Atyp, N);
4118 Set_Has_Delayed_Freeze (Atyp, False);
4120 -- We need to freeze the actual subtype immediately. This is
4121 -- needed, because otherwise this Itype will not get frozen
4122 -- at all, and it is always safe to freeze on creation because
4123 -- any associated types must be frozen at this point.
4125 Freeze_Itype (Atyp, N);
4128 -- Otherwise we did not build a declaration, so return original
4135 -- For all remaining cases, the actual subtype is the same as
4136 -- the nominal type.
4141 end Get_Actual_Subtype;
4143 -------------------------------------
4144 -- Get_Actual_Subtype_If_Available --
4145 -------------------------------------
4147 function Get_Actual_Subtype_If_Available (N : Node_Id) return Entity_Id is
4148 Typ : constant Entity_Id := Etype (N);
4151 -- If what we have is an identifier that references a subprogram
4152 -- formal, or a variable or constant object, then we get the actual
4153 -- subtype from the referenced entity if one has been built.
4155 if Nkind (N) = N_Identifier
4157 (Is_Formal (Entity (N))
4158 or else Ekind (Entity (N)) = E_Constant
4159 or else Ekind (Entity (N)) = E_Variable)
4160 and then Present (Actual_Subtype (Entity (N)))
4162 return Actual_Subtype (Entity (N));
4164 -- Otherwise the Etype of N is returned unchanged
4169 end Get_Actual_Subtype_If_Available;
4171 -------------------------------
4172 -- Get_Default_External_Name --
4173 -------------------------------
4175 function Get_Default_External_Name (E : Node_Or_Entity_Id) return Node_Id is
4177 Get_Decoded_Name_String (Chars (E));
4179 if Opt.External_Name_Imp_Casing = Uppercase then
4180 Set_Casing (All_Upper_Case);
4182 Set_Casing (All_Lower_Case);
4186 Make_String_Literal (Sloc (E),
4187 Strval => String_From_Name_Buffer);
4188 end Get_Default_External_Name;
4190 --------------------------
4191 -- Get_Enclosing_Object --
4192 --------------------------
4194 function Get_Enclosing_Object (N : Node_Id) return Entity_Id is
4196 if Is_Entity_Name (N) then
4200 when N_Indexed_Component |
4202 N_Selected_Component =>
4204 -- If not generating code, a dereference may be left implicit.
4205 -- In thoses cases, return Empty.
4207 if Is_Access_Type (Etype (Prefix (N))) then
4210 return Get_Enclosing_Object (Prefix (N));
4213 when N_Type_Conversion =>
4214 return Get_Enclosing_Object (Expression (N));
4220 end Get_Enclosing_Object;
4222 ---------------------------
4223 -- Get_Enum_Lit_From_Pos --
4224 ---------------------------
4226 function Get_Enum_Lit_From_Pos
4229 Loc : Source_Ptr) return Node_Id
4234 -- In the case where the literal is of type Character, Wide_Character
4235 -- or Wide_Wide_Character or of a type derived from them, there needs
4236 -- to be some special handling since there is no explicit chain of
4237 -- literals to search. Instead, an N_Character_Literal node is created
4238 -- with the appropriate Char_Code and Chars fields.
4240 if Is_Standard_Character_Type (T) then
4241 Set_Character_Literal_Name (UI_To_CC (Pos));
4243 Make_Character_Literal (Loc,
4245 Char_Literal_Value => Pos);
4247 -- For all other cases, we have a complete table of literals, and
4248 -- we simply iterate through the chain of literal until the one
4249 -- with the desired position value is found.
4253 Lit := First_Literal (Base_Type (T));
4254 for J in 1 .. UI_To_Int (Pos) loop
4258 return New_Occurrence_Of (Lit, Loc);
4260 end Get_Enum_Lit_From_Pos;
4262 ---------------------------------------
4263 -- Get_Ensures_From_Test_Case_Pragma --
4264 ---------------------------------------
4266 function Get_Ensures_From_Test_Case_Pragma (N : Node_Id) return Node_Id is
4267 Args : constant List_Id := Pragma_Argument_Associations (N);
4271 if List_Length (Args) = 4 then
4272 Res := Pick (Args, 4);
4275 Res := Pick (Args, 3);
4276 if Chars (Res) /= Name_Ensures then
4282 end Get_Ensures_From_Test_Case_Pragma;
4284 ------------------------
4285 -- Get_Generic_Entity --
4286 ------------------------
4288 function Get_Generic_Entity (N : Node_Id) return Entity_Id is
4289 Ent : constant Entity_Id := Entity (Name (N));
4291 if Present (Renamed_Object (Ent)) then
4292 return Renamed_Object (Ent);
4296 end Get_Generic_Entity;
4298 ----------------------
4299 -- Get_Index_Bounds --
4300 ----------------------
4302 procedure Get_Index_Bounds (N : Node_Id; L, H : out Node_Id) is
4303 Kind : constant Node_Kind := Nkind (N);
4307 if Kind = N_Range then
4309 H := High_Bound (N);
4311 elsif Kind = N_Subtype_Indication then
4312 R := Range_Expression (Constraint (N));
4320 L := Low_Bound (Range_Expression (Constraint (N)));
4321 H := High_Bound (Range_Expression (Constraint (N)));
4324 elsif Is_Entity_Name (N) and then Is_Type (Entity (N)) then
4325 if Error_Posted (Scalar_Range (Entity (N))) then
4329 elsif Nkind (Scalar_Range (Entity (N))) = N_Subtype_Indication then
4330 Get_Index_Bounds (Scalar_Range (Entity (N)), L, H);
4333 L := Low_Bound (Scalar_Range (Entity (N)));
4334 H := High_Bound (Scalar_Range (Entity (N)));
4338 -- N is an expression, indicating a range with one value
4343 end Get_Index_Bounds;
4345 ----------------------------------
4346 -- Get_Library_Unit_Name_string --
4347 ----------------------------------
4349 procedure Get_Library_Unit_Name_String (Decl_Node : Node_Id) is
4350 Unit_Name_Id : constant Unit_Name_Type := Get_Unit_Name (Decl_Node);
4353 Get_Unit_Name_String (Unit_Name_Id);
4355 -- Remove seven last character (" (spec)" or " (body)")
4357 Name_Len := Name_Len - 7;
4358 pragma Assert (Name_Buffer (Name_Len + 1) = ' ');
4359 end Get_Library_Unit_Name_String;
4361 ------------------------
4362 -- Get_Name_Entity_Id --
4363 ------------------------
4365 function Get_Name_Entity_Id (Id : Name_Id) return Entity_Id is
4367 return Entity_Id (Get_Name_Table_Info (Id));
4368 end Get_Name_Entity_Id;
4370 ------------------------------------
4371 -- Get_Name_From_Test_Case_Pragma --
4372 ------------------------------------
4374 function Get_Name_From_Test_Case_Pragma (N : Node_Id) return String_Id is
4375 Arg : constant Node_Id :=
4376 Get_Pragma_Arg (First (Pragma_Argument_Associations (N)));
4378 return Strval (Expr_Value_S (Arg));
4379 end Get_Name_From_Test_Case_Pragma;
4385 function Get_Pragma_Id (N : Node_Id) return Pragma_Id is
4387 return Get_Pragma_Id (Pragma_Name (N));
4390 ---------------------------
4391 -- Get_Referenced_Object --
4392 ---------------------------
4394 function Get_Referenced_Object (N : Node_Id) return Node_Id is
4399 while Is_Entity_Name (R)
4400 and then Present (Renamed_Object (Entity (R)))
4402 R := Renamed_Object (Entity (R));
4406 end Get_Referenced_Object;
4408 ------------------------
4409 -- Get_Renamed_Entity --
4410 ------------------------
4412 function Get_Renamed_Entity (E : Entity_Id) return Entity_Id is
4417 while Present (Renamed_Entity (R)) loop
4418 R := Renamed_Entity (R);
4422 end Get_Renamed_Entity;
4424 ----------------------------------------
4425 -- Get_Requires_From_Test_Case_Pragma --
4426 ----------------------------------------
4428 function Get_Requires_From_Test_Case_Pragma (N : Node_Id) return Node_Id is
4429 Args : constant List_Id := Pragma_Argument_Associations (N);
4433 Res := Pick (Args, 3);
4434 if Chars (Res) /= Name_Requires then
4439 end Get_Requires_From_Test_Case_Pragma;
4441 -------------------------
4442 -- Get_Subprogram_Body --
4443 -------------------------
4445 function Get_Subprogram_Body (E : Entity_Id) return Node_Id is
4449 Decl := Unit_Declaration_Node (E);
4451 if Nkind (Decl) = N_Subprogram_Body then
4454 -- The below comment is bad, because it is possible for
4455 -- Nkind (Decl) to be an N_Subprogram_Body_Stub ???
4457 else -- Nkind (Decl) = N_Subprogram_Declaration
4459 if Present (Corresponding_Body (Decl)) then
4460 return Unit_Declaration_Node (Corresponding_Body (Decl));
4462 -- Imported subprogram case
4468 end Get_Subprogram_Body;
4470 ---------------------------
4471 -- Get_Subprogram_Entity --
4472 ---------------------------
4474 function Get_Subprogram_Entity (Nod : Node_Id) return Entity_Id is
4479 if Nkind (Nod) = N_Accept_Statement then
4480 Nam := Entry_Direct_Name (Nod);
4482 -- For an entry call, the prefix of the call is a selected component.
4483 -- Need additional code for internal calls ???
4485 elsif Nkind (Nod) = N_Entry_Call_Statement then
4486 if Nkind (Name (Nod)) = N_Selected_Component then
4487 Nam := Entity (Selector_Name (Name (Nod)));
4496 if Nkind (Nam) = N_Explicit_Dereference then
4497 Proc := Etype (Prefix (Nam));
4498 elsif Is_Entity_Name (Nam) then
4499 Proc := Entity (Nam);
4504 if Is_Object (Proc) then
4505 Proc := Etype (Proc);
4508 if Ekind (Proc) = E_Access_Subprogram_Type then
4509 Proc := Directly_Designated_Type (Proc);
4512 if not Is_Subprogram (Proc)
4513 and then Ekind (Proc) /= E_Subprogram_Type
4519 end Get_Subprogram_Entity;
4521 -----------------------------
4522 -- Get_Task_Body_Procedure --
4523 -----------------------------
4525 function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
4527 -- Note: A task type may be the completion of a private type with
4528 -- discriminants. When performing elaboration checks on a task
4529 -- declaration, the current view of the type may be the private one,
4530 -- and the procedure that holds the body of the task is held in its
4533 -- This is an odd function, why not have Task_Body_Procedure do
4534 -- the following digging???
4536 return Task_Body_Procedure (Underlying_Type (Root_Type (E)));
4537 end Get_Task_Body_Procedure;
4539 -----------------------
4540 -- Has_Access_Values --
4541 -----------------------
4543 function Has_Access_Values (T : Entity_Id) return Boolean is
4544 Typ : constant Entity_Id := Underlying_Type (T);
4547 -- Case of a private type which is not completed yet. This can only
4548 -- happen in the case of a generic format type appearing directly, or
4549 -- as a component of the type to which this function is being applied
4550 -- at the top level. Return False in this case, since we certainly do
4551 -- not know that the type contains access types.
4556 elsif Is_Access_Type (Typ) then
4559 elsif Is_Array_Type (Typ) then
4560 return Has_Access_Values (Component_Type (Typ));
4562 elsif Is_Record_Type (Typ) then
4567 -- Loop to Check components
4569 Comp := First_Component_Or_Discriminant (Typ);
4570 while Present (Comp) loop
4572 -- Check for access component, tag field does not count, even
4573 -- though it is implemented internally using an access type.
4575 if Has_Access_Values (Etype (Comp))
4576 and then Chars (Comp) /= Name_uTag
4581 Next_Component_Or_Discriminant (Comp);
4590 end Has_Access_Values;
4592 ------------------------------
4593 -- Has_Compatible_Alignment --
4594 ------------------------------
4596 function Has_Compatible_Alignment
4598 Expr : Node_Id) return Alignment_Result
4600 function Has_Compatible_Alignment_Internal
4603 Default : Alignment_Result) return Alignment_Result;
4604 -- This is the internal recursive function that actually does the work.
4605 -- There is one additional parameter, which says what the result should
4606 -- be if no alignment information is found, and there is no definite
4607 -- indication of compatible alignments. At the outer level, this is set
4608 -- to Unknown, but for internal recursive calls in the case where types
4609 -- are known to be correct, it is set to Known_Compatible.
4611 ---------------------------------------
4612 -- Has_Compatible_Alignment_Internal --
4613 ---------------------------------------
4615 function Has_Compatible_Alignment_Internal
4618 Default : Alignment_Result) return Alignment_Result
4620 Result : Alignment_Result := Known_Compatible;
4621 -- Holds the current status of the result. Note that once a value of
4622 -- Known_Incompatible is set, it is sticky and does not get changed
4623 -- to Unknown (the value in Result only gets worse as we go along,
4626 Offs : Uint := No_Uint;
4627 -- Set to a factor of the offset from the base object when Expr is a
4628 -- selected or indexed component, based on Component_Bit_Offset and
4629 -- Component_Size respectively. A negative value is used to represent
4630 -- a value which is not known at compile time.
4632 procedure Check_Prefix;
4633 -- Checks the prefix recursively in the case where the expression
4634 -- is an indexed or selected component.
4636 procedure Set_Result (R : Alignment_Result);
4637 -- If R represents a worse outcome (unknown instead of known
4638 -- compatible, or known incompatible), then set Result to R.
4644 procedure Check_Prefix is
4646 -- The subtlety here is that in doing a recursive call to check
4647 -- the prefix, we have to decide what to do in the case where we
4648 -- don't find any specific indication of an alignment problem.
4650 -- At the outer level, we normally set Unknown as the result in
4651 -- this case, since we can only set Known_Compatible if we really
4652 -- know that the alignment value is OK, but for the recursive
4653 -- call, in the case where the types match, and we have not
4654 -- specified a peculiar alignment for the object, we are only
4655 -- concerned about suspicious rep clauses, the default case does
4656 -- not affect us, since the compiler will, in the absence of such
4657 -- rep clauses, ensure that the alignment is correct.
4659 if Default = Known_Compatible
4661 (Etype (Obj) = Etype (Expr)
4662 and then (Unknown_Alignment (Obj)
4664 Alignment (Obj) = Alignment (Etype (Obj))))
4667 (Has_Compatible_Alignment_Internal
4668 (Obj, Prefix (Expr), Known_Compatible));
4670 -- In all other cases, we need a full check on the prefix
4674 (Has_Compatible_Alignment_Internal
4675 (Obj, Prefix (Expr), Unknown));
4683 procedure Set_Result (R : Alignment_Result) is
4690 -- Start of processing for Has_Compatible_Alignment_Internal
4693 -- If Expr is a selected component, we must make sure there is no
4694 -- potentially troublesome component clause, and that the record is
4697 if Nkind (Expr) = N_Selected_Component then
4699 -- Packed record always generate unknown alignment
4701 if Is_Packed (Etype (Prefix (Expr))) then
4702 Set_Result (Unknown);
4705 -- Check prefix and component offset
4708 Offs := Component_Bit_Offset (Entity (Selector_Name (Expr)));
4710 -- If Expr is an indexed component, we must make sure there is no
4711 -- potentially troublesome Component_Size clause and that the array
4712 -- is not bit-packed.
4714 elsif Nkind (Expr) = N_Indexed_Component then
4716 Typ : constant Entity_Id := Etype (Prefix (Expr));
4717 Ind : constant Node_Id := First_Index (Typ);
4720 -- Bit packed array always generates unknown alignment
4722 if Is_Bit_Packed_Array (Typ) then
4723 Set_Result (Unknown);
4726 -- Check prefix and component offset
4729 Offs := Component_Size (Typ);
4731 -- Small optimization: compute the full offset when possible
4734 and then Offs > Uint_0
4735 and then Present (Ind)
4736 and then Nkind (Ind) = N_Range
4737 and then Compile_Time_Known_Value (Low_Bound (Ind))
4738 and then Compile_Time_Known_Value (First (Expressions (Expr)))
4740 Offs := Offs * (Expr_Value (First (Expressions (Expr)))
4741 - Expr_Value (Low_Bound ((Ind))));
4746 -- If we have a null offset, the result is entirely determined by
4747 -- the base object and has already been computed recursively.
4749 if Offs = Uint_0 then
4752 -- Case where we know the alignment of the object
4754 elsif Known_Alignment (Obj) then
4756 ObjA : constant Uint := Alignment (Obj);
4757 ExpA : Uint := No_Uint;
4758 SizA : Uint := No_Uint;
4761 -- If alignment of Obj is 1, then we are always OK
4764 Set_Result (Known_Compatible);
4766 -- Alignment of Obj is greater than 1, so we need to check
4769 -- If we have an offset, see if it is compatible
4771 if Offs /= No_Uint and Offs > Uint_0 then
4772 if Offs mod (System_Storage_Unit * ObjA) /= 0 then
4773 Set_Result (Known_Incompatible);
4776 -- See if Expr is an object with known alignment
4778 elsif Is_Entity_Name (Expr)
4779 and then Known_Alignment (Entity (Expr))
4781 ExpA := Alignment (Entity (Expr));
4783 -- Otherwise, we can use the alignment of the type of
4784 -- Expr given that we already checked for
4785 -- discombobulating rep clauses for the cases of indexed
4786 -- and selected components above.
4788 elsif Known_Alignment (Etype (Expr)) then
4789 ExpA := Alignment (Etype (Expr));
4791 -- Otherwise the alignment is unknown
4794 Set_Result (Default);
4797 -- If we got an alignment, see if it is acceptable
4799 if ExpA /= No_Uint and then ExpA < ObjA then
4800 Set_Result (Known_Incompatible);
4803 -- If Expr is not a piece of a larger object, see if size
4804 -- is given. If so, check that it is not too small for the
4805 -- required alignment.
4807 if Offs /= No_Uint then
4810 -- See if Expr is an object with known size
4812 elsif Is_Entity_Name (Expr)
4813 and then Known_Static_Esize (Entity (Expr))
4815 SizA := Esize (Entity (Expr));
4817 -- Otherwise, we check the object size of the Expr type
4819 elsif Known_Static_Esize (Etype (Expr)) then
4820 SizA := Esize (Etype (Expr));
4823 -- If we got a size, see if it is a multiple of the Obj
4824 -- alignment, if not, then the alignment cannot be
4825 -- acceptable, since the size is always a multiple of the
4828 if SizA /= No_Uint then
4829 if SizA mod (ObjA * Ttypes.System_Storage_Unit) /= 0 then
4830 Set_Result (Known_Incompatible);
4836 -- If we do not know required alignment, any non-zero offset is a
4837 -- potential problem (but certainly may be OK, so result is unknown).
4839 elsif Offs /= No_Uint then
4840 Set_Result (Unknown);
4842 -- If we can't find the result by direct comparison of alignment
4843 -- values, then there is still one case that we can determine known
4844 -- result, and that is when we can determine that the types are the
4845 -- same, and no alignments are specified. Then we known that the
4846 -- alignments are compatible, even if we don't know the alignment
4847 -- value in the front end.
4849 elsif Etype (Obj) = Etype (Expr) then
4851 -- Types are the same, but we have to check for possible size
4852 -- and alignments on the Expr object that may make the alignment
4853 -- different, even though the types are the same.
4855 if Is_Entity_Name (Expr) then
4857 -- First check alignment of the Expr object. Any alignment less
4858 -- than Maximum_Alignment is worrisome since this is the case
4859 -- where we do not know the alignment of Obj.
4861 if Known_Alignment (Entity (Expr))
4863 UI_To_Int (Alignment (Entity (Expr))) <
4864 Ttypes.Maximum_Alignment
4866 Set_Result (Unknown);
4868 -- Now check size of Expr object. Any size that is not an
4869 -- even multiple of Maximum_Alignment is also worrisome
4870 -- since it may cause the alignment of the object to be less
4871 -- than the alignment of the type.
4873 elsif Known_Static_Esize (Entity (Expr))
4875 (UI_To_Int (Esize (Entity (Expr))) mod
4876 (Ttypes.Maximum_Alignment * Ttypes.System_Storage_Unit))
4879 Set_Result (Unknown);
4881 -- Otherwise same type is decisive
4884 Set_Result (Known_Compatible);
4888 -- Another case to deal with is when there is an explicit size or
4889 -- alignment clause when the types are not the same. If so, then the
4890 -- result is Unknown. We don't need to do this test if the Default is
4891 -- Unknown, since that result will be set in any case.
4893 elsif Default /= Unknown
4894 and then (Has_Size_Clause (Etype (Expr))
4896 Has_Alignment_Clause (Etype (Expr)))
4898 Set_Result (Unknown);
4900 -- If no indication found, set default
4903 Set_Result (Default);
4906 -- Return worst result found
4909 end Has_Compatible_Alignment_Internal;
4911 -- Start of processing for Has_Compatible_Alignment
4914 -- If Obj has no specified alignment, then set alignment from the type
4915 -- alignment. Perhaps we should always do this, but for sure we should
4916 -- do it when there is an address clause since we can do more if the
4917 -- alignment is known.
4919 if Unknown_Alignment (Obj) then
4920 Set_Alignment (Obj, Alignment (Etype (Obj)));
4923 -- Now do the internal call that does all the work
4925 return Has_Compatible_Alignment_Internal (Obj, Expr, Unknown);
4926 end Has_Compatible_Alignment;
4928 ----------------------
4929 -- Has_Declarations --
4930 ----------------------
4932 function Has_Declarations (N : Node_Id) return Boolean is
4934 return Nkind_In (Nkind (N), N_Accept_Statement,
4936 N_Compilation_Unit_Aux,
4942 N_Package_Specification);
4943 end Has_Declarations;
4945 -------------------------------------------
4946 -- Has_Discriminant_Dependent_Constraint --
4947 -------------------------------------------
4949 function Has_Discriminant_Dependent_Constraint
4950 (Comp : Entity_Id) return Boolean
4952 Comp_Decl : constant Node_Id := Parent (Comp);
4953 Subt_Indic : constant Node_Id :=
4954 Subtype_Indication (Component_Definition (Comp_Decl));
4959 if Nkind (Subt_Indic) = N_Subtype_Indication then
4960 Constr := Constraint (Subt_Indic);
4962 if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
4963 Assn := First (Constraints (Constr));
4964 while Present (Assn) loop
4965 case Nkind (Assn) is
4966 when N_Subtype_Indication |
4970 if Depends_On_Discriminant (Assn) then
4974 when N_Discriminant_Association =>
4975 if Depends_On_Discriminant (Expression (Assn)) then
4990 end Has_Discriminant_Dependent_Constraint;
4992 --------------------
4993 -- Has_Infinities --
4994 --------------------
4996 function Has_Infinities (E : Entity_Id) return Boolean is
4999 Is_Floating_Point_Type (E)
5000 and then Nkind (Scalar_Range (E)) = N_Range
5001 and then Includes_Infinities (Scalar_Range (E));
5004 --------------------
5005 -- Has_Interfaces --
5006 --------------------
5008 function Has_Interfaces
5010 Use_Full_View : Boolean := True) return Boolean
5012 Typ : Entity_Id := Base_Type (T);
5015 -- Handle concurrent types
5017 if Is_Concurrent_Type (Typ) then
5018 Typ := Corresponding_Record_Type (Typ);
5021 if not Present (Typ)
5022 or else not Is_Record_Type (Typ)
5023 or else not Is_Tagged_Type (Typ)
5028 -- Handle private types
5031 and then Present (Full_View (Typ))
5033 Typ := Full_View (Typ);
5036 -- Handle concurrent record types
5038 if Is_Concurrent_Record_Type (Typ)
5039 and then Is_Non_Empty_List (Abstract_Interface_List (Typ))
5045 if Is_Interface (Typ)
5047 (Is_Record_Type (Typ)
5048 and then Present (Interfaces (Typ))
5049 and then not Is_Empty_Elmt_List (Interfaces (Typ)))
5054 exit when Etype (Typ) = Typ
5056 -- Handle private types
5058 or else (Present (Full_View (Etype (Typ)))
5059 and then Full_View (Etype (Typ)) = Typ)
5061 -- Protect the frontend against wrong source with cyclic
5064 or else Etype (Typ) = T;
5066 -- Climb to the ancestor type handling private types
5068 if Present (Full_View (Etype (Typ))) then
5069 Typ := Full_View (Etype (Typ));
5078 ------------------------
5079 -- Has_Null_Exclusion --
5080 ------------------------
5082 function Has_Null_Exclusion (N : Node_Id) return Boolean is
5085 when N_Access_Definition |
5086 N_Access_Function_Definition |
5087 N_Access_Procedure_Definition |
5088 N_Access_To_Object_Definition |
5090 N_Derived_Type_Definition |
5091 N_Function_Specification |
5092 N_Subtype_Declaration =>
5093 return Null_Exclusion_Present (N);
5095 when N_Component_Definition |
5096 N_Formal_Object_Declaration |
5097 N_Object_Renaming_Declaration =>
5098 if Present (Subtype_Mark (N)) then
5099 return Null_Exclusion_Present (N);
5100 else pragma Assert (Present (Access_Definition (N)));
5101 return Null_Exclusion_Present (Access_Definition (N));
5104 when N_Discriminant_Specification =>
5105 if Nkind (Discriminant_Type (N)) = N_Access_Definition then
5106 return Null_Exclusion_Present (Discriminant_Type (N));
5108 return Null_Exclusion_Present (N);
5111 when N_Object_Declaration =>
5112 if Nkind (Object_Definition (N)) = N_Access_Definition then
5113 return Null_Exclusion_Present (Object_Definition (N));
5115 return Null_Exclusion_Present (N);
5118 when N_Parameter_Specification =>
5119 if Nkind (Parameter_Type (N)) = N_Access_Definition then
5120 return Null_Exclusion_Present (Parameter_Type (N));
5122 return Null_Exclusion_Present (N);
5129 end Has_Null_Exclusion;
5131 ------------------------
5132 -- Has_Null_Extension --
5133 ------------------------
5135 function Has_Null_Extension (T : Entity_Id) return Boolean is
5136 B : constant Entity_Id := Base_Type (T);
5141 if Nkind (Parent (B)) = N_Full_Type_Declaration
5142 and then Present (Record_Extension_Part (Type_Definition (Parent (B))))
5144 Ext := Record_Extension_Part (Type_Definition (Parent (B)));
5146 if Present (Ext) then
5147 if Null_Present (Ext) then
5150 Comps := Component_List (Ext);
5152 -- The null component list is rewritten during analysis to
5153 -- include the parent component. Any other component indicates
5154 -- that the extension was not originally null.
5156 return Null_Present (Comps)
5157 or else No (Next (First (Component_Items (Comps))));
5166 end Has_Null_Extension;
5168 -------------------------------
5169 -- Has_Overriding_Initialize --
5170 -------------------------------
5172 function Has_Overriding_Initialize (T : Entity_Id) return Boolean is
5173 BT : constant Entity_Id := Base_Type (T);
5177 if Is_Controlled (BT) then
5178 if Is_RTU (Scope (BT), Ada_Finalization) then
5181 elsif Present (Primitive_Operations (BT)) then
5182 P := First_Elmt (Primitive_Operations (BT));
5183 while Present (P) loop
5185 Init : constant Entity_Id := Node (P);
5186 Formal : constant Entity_Id := First_Formal (Init);
5188 if Ekind (Init) = E_Procedure
5189 and then Chars (Init) = Name_Initialize
5190 and then Comes_From_Source (Init)
5191 and then Present (Formal)
5192 and then Etype (Formal) = BT
5193 and then No (Next_Formal (Formal))
5194 and then (Ada_Version < Ada_2012
5195 or else not Null_Present (Parent (Init)))
5205 -- Here if type itself does not have a non-null Initialize operation:
5206 -- check immediate ancestor.
5208 if Is_Derived_Type (BT)
5209 and then Has_Overriding_Initialize (Etype (BT))
5216 end Has_Overriding_Initialize;
5218 --------------------------------------
5219 -- Has_Preelaborable_Initialization --
5220 --------------------------------------
5222 function Has_Preelaborable_Initialization (E : Entity_Id) return Boolean is
5225 procedure Check_Components (E : Entity_Id);
5226 -- Check component/discriminant chain, sets Has_PE False if a component
5227 -- or discriminant does not meet the preelaborable initialization rules.
5229 ----------------------
5230 -- Check_Components --
5231 ----------------------
5233 procedure Check_Components (E : Entity_Id) is
5237 function Is_Preelaborable_Expression (N : Node_Id) return Boolean;
5238 -- Returns True if and only if the expression denoted by N does not
5239 -- violate restrictions on preelaborable constructs (RM-10.2.1(5-9)).
5241 ---------------------------------
5242 -- Is_Preelaborable_Expression --
5243 ---------------------------------
5245 function Is_Preelaborable_Expression (N : Node_Id) return Boolean is
5249 Comp_Type : Entity_Id;
5250 Is_Array_Aggr : Boolean;
5253 if Is_Static_Expression (N) then
5256 elsif Nkind (N) = N_Null then
5259 -- Attributes are allowed in general, even if their prefix is a
5260 -- formal type. (It seems that certain attributes known not to be
5261 -- static might not be allowed, but there are no rules to prevent
5264 elsif Nkind (N) = N_Attribute_Reference then
5267 -- The name of a discriminant evaluated within its parent type is
5268 -- defined to be preelaborable (10.2.1(8)). Note that we test for
5269 -- names that denote discriminals as well as discriminants to
5270 -- catch references occurring within init procs.
5272 elsif Is_Entity_Name (N)
5274 (Ekind (Entity (N)) = E_Discriminant
5276 ((Ekind (Entity (N)) = E_Constant
5277 or else Ekind (Entity (N)) = E_In_Parameter)
5278 and then Present (Discriminal_Link (Entity (N)))))
5282 elsif Nkind (N) = N_Qualified_Expression then
5283 return Is_Preelaborable_Expression (Expression (N));
5285 -- For aggregates we have to check that each of the associations
5286 -- is preelaborable.
5288 elsif Nkind (N) = N_Aggregate
5289 or else Nkind (N) = N_Extension_Aggregate
5291 Is_Array_Aggr := Is_Array_Type (Etype (N));
5293 if Is_Array_Aggr then
5294 Comp_Type := Component_Type (Etype (N));
5297 -- Check the ancestor part of extension aggregates, which must
5298 -- be either the name of a type that has preelaborable init or
5299 -- an expression that is preelaborable.
5301 if Nkind (N) = N_Extension_Aggregate then
5303 Anc_Part : constant Node_Id := Ancestor_Part (N);
5306 if Is_Entity_Name (Anc_Part)
5307 and then Is_Type (Entity (Anc_Part))
5309 if not Has_Preelaborable_Initialization
5315 elsif not Is_Preelaborable_Expression (Anc_Part) then
5321 -- Check positional associations
5323 Exp := First (Expressions (N));
5324 while Present (Exp) loop
5325 if not Is_Preelaborable_Expression (Exp) then
5332 -- Check named associations
5334 Assn := First (Component_Associations (N));
5335 while Present (Assn) loop
5336 Choice := First (Choices (Assn));
5337 while Present (Choice) loop
5338 if Is_Array_Aggr then
5339 if Nkind (Choice) = N_Others_Choice then
5342 elsif Nkind (Choice) = N_Range then
5343 if not Is_Static_Range (Choice) then
5347 elsif not Is_Static_Expression (Choice) then
5352 Comp_Type := Etype (Choice);
5358 -- If the association has a <> at this point, then we have
5359 -- to check whether the component's type has preelaborable
5360 -- initialization. Note that this only occurs when the
5361 -- association's corresponding component does not have a
5362 -- default expression, the latter case having already been
5363 -- expanded as an expression for the association.
5365 if Box_Present (Assn) then
5366 if not Has_Preelaborable_Initialization (Comp_Type) then
5370 -- In the expression case we check whether the expression
5371 -- is preelaborable.
5374 not Is_Preelaborable_Expression (Expression (Assn))
5382 -- If we get here then aggregate as a whole is preelaborable
5386 -- All other cases are not preelaborable
5391 end Is_Preelaborable_Expression;
5393 -- Start of processing for Check_Components
5396 -- Loop through entities of record or protected type
5399 while Present (Ent) loop
5401 -- We are interested only in components and discriminants
5408 -- Get default expression if any. If there is no declaration
5409 -- node, it means we have an internal entity. The parent and
5410 -- tag fields are examples of such entities. For such cases,
5411 -- we just test the type of the entity.
5413 if Present (Declaration_Node (Ent)) then
5414 Exp := Expression (Declaration_Node (Ent));
5417 when E_Discriminant =>
5419 -- Note: for a renamed discriminant, the Declaration_Node
5420 -- may point to the one from the ancestor, and have a
5421 -- different expression, so use the proper attribute to
5422 -- retrieve the expression from the derived constraint.
5424 Exp := Discriminant_Default_Value (Ent);
5427 goto Check_Next_Entity;
5430 -- A component has PI if it has no default expression and the
5431 -- component type has PI.
5434 if not Has_Preelaborable_Initialization (Etype (Ent)) then
5439 -- Require the default expression to be preelaborable
5441 elsif not Is_Preelaborable_Expression (Exp) then
5446 <<Check_Next_Entity>>
5449 end Check_Components;
5451 -- Start of processing for Has_Preelaborable_Initialization
5454 -- Immediate return if already marked as known preelaborable init. This
5455 -- covers types for which this function has already been called once
5456 -- and returned True (in which case the result is cached), and also
5457 -- types to which a pragma Preelaborable_Initialization applies.
5459 if Known_To_Have_Preelab_Init (E) then
5463 -- If the type is a subtype representing a generic actual type, then
5464 -- test whether its base type has preelaborable initialization since
5465 -- the subtype representing the actual does not inherit this attribute
5466 -- from the actual or formal. (but maybe it should???)
5468 if Is_Generic_Actual_Type (E) then
5469 return Has_Preelaborable_Initialization (Base_Type (E));
5472 -- All elementary types have preelaborable initialization
5474 if Is_Elementary_Type (E) then
5477 -- Array types have PI if the component type has PI
5479 elsif Is_Array_Type (E) then
5480 Has_PE := Has_Preelaborable_Initialization (Component_Type (E));
5482 -- A derived type has preelaborable initialization if its parent type
5483 -- has preelaborable initialization and (in the case of a derived record
5484 -- extension) if the non-inherited components all have preelaborable
5485 -- initialization. However, a user-defined controlled type with an
5486 -- overriding Initialize procedure does not have preelaborable
5489 elsif Is_Derived_Type (E) then
5491 -- If the derived type is a private extension then it doesn't have
5492 -- preelaborable initialization.
5494 if Ekind (Base_Type (E)) = E_Record_Type_With_Private then
5498 -- First check whether ancestor type has preelaborable initialization
5500 Has_PE := Has_Preelaborable_Initialization (Etype (Base_Type (E)));
5502 -- If OK, check extension components (if any)
5504 if Has_PE and then Is_Record_Type (E) then
5505 Check_Components (First_Entity (E));
5508 -- Check specifically for 10.2.1(11.4/2) exception: a controlled type
5509 -- with a user defined Initialize procedure does not have PI.
5512 and then Is_Controlled (E)
5513 and then Has_Overriding_Initialize (E)
5518 -- Private types not derived from a type having preelaborable init and
5519 -- that are not marked with pragma Preelaborable_Initialization do not
5520 -- have preelaborable initialization.
5522 elsif Is_Private_Type (E) then
5525 -- Record type has PI if it is non private and all components have PI
5527 elsif Is_Record_Type (E) then
5529 Check_Components (First_Entity (E));
5531 -- Protected types must not have entries, and components must meet
5532 -- same set of rules as for record components.
5534 elsif Is_Protected_Type (E) then
5535 if Has_Entries (E) then
5539 Check_Components (First_Entity (E));
5540 Check_Components (First_Private_Entity (E));
5543 -- Type System.Address always has preelaborable initialization
5545 elsif Is_RTE (E, RE_Address) then
5548 -- In all other cases, type does not have preelaborable initialization
5554 -- If type has preelaborable initialization, cache result
5557 Set_Known_To_Have_Preelab_Init (E);
5561 end Has_Preelaborable_Initialization;
5563 ---------------------------
5564 -- Has_Private_Component --
5565 ---------------------------
5567 function Has_Private_Component (Type_Id : Entity_Id) return Boolean is
5568 Btype : Entity_Id := Base_Type (Type_Id);
5569 Component : Entity_Id;
5572 if Error_Posted (Type_Id)
5573 or else Error_Posted (Btype)
5578 if Is_Class_Wide_Type (Btype) then
5579 Btype := Root_Type (Btype);
5582 if Is_Private_Type (Btype) then
5584 UT : constant Entity_Id := Underlying_Type (Btype);
5587 if No (Full_View (Btype)) then
5588 return not Is_Generic_Type (Btype)
5589 and then not Is_Generic_Type (Root_Type (Btype));
5591 return not Is_Generic_Type (Root_Type (Full_View (Btype)));
5594 return not Is_Frozen (UT) and then Has_Private_Component (UT);
5598 elsif Is_Array_Type (Btype) then
5599 return Has_Private_Component (Component_Type (Btype));
5601 elsif Is_Record_Type (Btype) then
5602 Component := First_Component (Btype);
5603 while Present (Component) loop
5604 if Has_Private_Component (Etype (Component)) then
5608 Next_Component (Component);
5613 elsif Is_Protected_Type (Btype)
5614 and then Present (Corresponding_Record_Type (Btype))
5616 return Has_Private_Component (Corresponding_Record_Type (Btype));
5621 end Has_Private_Component;
5623 -----------------------------
5624 -- Has_Static_Array_Bounds --
5625 -----------------------------
5627 function Has_Static_Array_Bounds (Typ : Node_Id) return Boolean is
5628 Ndims : constant Nat := Number_Dimensions (Typ);
5635 -- Unconstrained types do not have static bounds
5637 if not Is_Constrained (Typ) then
5641 -- First treat string literals specially, as the lower bound and length
5642 -- of string literals are not stored like those of arrays.
5644 -- A string literal always has static bounds
5646 if Ekind (Typ) = E_String_Literal_Subtype then
5650 -- Treat all dimensions in turn
5652 Index := First_Index (Typ);
5653 for Indx in 1 .. Ndims loop
5655 -- In case of an erroneous index which is not a discrete type, return
5656 -- that the type is not static.
5658 if not Is_Discrete_Type (Etype (Index))
5659 or else Etype (Index) = Any_Type
5664 Get_Index_Bounds (Index, Low, High);
5666 if Error_Posted (Low) or else Error_Posted (High) then
5670 if Is_OK_Static_Expression (Low)
5672 Is_OK_Static_Expression (High)
5682 -- If we fall through the loop, all indexes matched
5685 end Has_Static_Array_Bounds;
5691 function Has_Stream (T : Entity_Id) return Boolean is
5698 elsif Is_RTE (Root_Type (T), RE_Root_Stream_Type) then
5701 elsif Is_Array_Type (T) then
5702 return Has_Stream (Component_Type (T));
5704 elsif Is_Record_Type (T) then
5705 E := First_Component (T);
5706 while Present (E) loop
5707 if Has_Stream (Etype (E)) then
5716 elsif Is_Private_Type (T) then
5717 return Has_Stream (Underlying_Type (T));
5728 function Has_Suffix (E : Entity_Id; Suffix : Character) return Boolean is
5730 Get_Name_String (Chars (E));
5731 return Name_Buffer (Name_Len) = Suffix;
5734 --------------------------
5735 -- Has_Tagged_Component --
5736 --------------------------
5738 function Has_Tagged_Component (Typ : Entity_Id) return Boolean is
5742 if Is_Private_Type (Typ)
5743 and then Present (Underlying_Type (Typ))
5745 return Has_Tagged_Component (Underlying_Type (Typ));
5747 elsif Is_Array_Type (Typ) then
5748 return Has_Tagged_Component (Component_Type (Typ));
5750 elsif Is_Tagged_Type (Typ) then
5753 elsif Is_Record_Type (Typ) then
5754 Comp := First_Component (Typ);
5755 while Present (Comp) loop
5756 if Has_Tagged_Component (Etype (Comp)) then
5760 Next_Component (Comp);
5768 end Has_Tagged_Component;
5770 -------------------------
5771 -- Implementation_Kind --
5772 -------------------------
5774 function Implementation_Kind (Subp : Entity_Id) return Name_Id is
5775 Impl_Prag : constant Node_Id := Get_Rep_Pragma (Subp, Name_Implemented);
5777 pragma Assert (Present (Impl_Prag));
5779 Chars (Expression (Last (Pragma_Argument_Associations (Impl_Prag))));
5780 end Implementation_Kind;
5782 --------------------------
5783 -- Implements_Interface --
5784 --------------------------
5786 function Implements_Interface
5787 (Typ_Ent : Entity_Id;
5788 Iface_Ent : Entity_Id;
5789 Exclude_Parents : Boolean := False) return Boolean
5791 Ifaces_List : Elist_Id;
5793 Iface : Entity_Id := Base_Type (Iface_Ent);
5794 Typ : Entity_Id := Base_Type (Typ_Ent);
5797 if Is_Class_Wide_Type (Typ) then
5798 Typ := Root_Type (Typ);
5801 if not Has_Interfaces (Typ) then
5805 if Is_Class_Wide_Type (Iface) then
5806 Iface := Root_Type (Iface);
5809 Collect_Interfaces (Typ, Ifaces_List);
5811 Elmt := First_Elmt (Ifaces_List);
5812 while Present (Elmt) loop
5813 if Is_Ancestor (Node (Elmt), Typ, Use_Full_View => True)
5814 and then Exclude_Parents
5818 elsif Node (Elmt) = Iface then
5826 end Implements_Interface;
5832 function In_Instance return Boolean is
5833 Curr_Unit : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
5839 and then S /= Standard_Standard
5841 if (Ekind (S) = E_Function
5842 or else Ekind (S) = E_Package
5843 or else Ekind (S) = E_Procedure)
5844 and then Is_Generic_Instance (S)
5846 -- A child instance is always compiled in the context of a parent
5847 -- instance. Nevertheless, the actuals are not analyzed in an
5848 -- instance context. We detect this case by examining the current
5849 -- compilation unit, which must be a child instance, and checking
5850 -- that it is not currently on the scope stack.
5852 if Is_Child_Unit (Curr_Unit)
5854 Nkind (Unit (Cunit (Current_Sem_Unit)))
5855 = N_Package_Instantiation
5856 and then not In_Open_Scopes (Curr_Unit)
5870 ----------------------
5871 -- In_Instance_Body --
5872 ----------------------
5874 function In_Instance_Body return Boolean is
5880 and then S /= Standard_Standard
5882 if (Ekind (S) = E_Function
5883 or else Ekind (S) = E_Procedure)
5884 and then Is_Generic_Instance (S)
5888 elsif Ekind (S) = E_Package
5889 and then In_Package_Body (S)
5890 and then Is_Generic_Instance (S)
5899 end In_Instance_Body;
5901 -----------------------------
5902 -- In_Instance_Not_Visible --
5903 -----------------------------
5905 function In_Instance_Not_Visible return Boolean is
5911 and then S /= Standard_Standard
5913 if (Ekind (S) = E_Function
5914 or else Ekind (S) = E_Procedure)
5915 and then Is_Generic_Instance (S)
5919 elsif Ekind (S) = E_Package
5920 and then (In_Package_Body (S) or else In_Private_Part (S))
5921 and then Is_Generic_Instance (S)
5930 end In_Instance_Not_Visible;
5932 ------------------------------
5933 -- In_Instance_Visible_Part --
5934 ------------------------------
5936 function In_Instance_Visible_Part return Boolean is
5942 and then S /= Standard_Standard
5944 if Ekind (S) = E_Package
5945 and then Is_Generic_Instance (S)
5946 and then not In_Package_Body (S)
5947 and then not In_Private_Part (S)
5956 end In_Instance_Visible_Part;
5958 ---------------------
5959 -- In_Package_Body --
5960 ---------------------
5962 function In_Package_Body return Boolean is
5968 and then S /= Standard_Standard
5970 if Ekind (S) = E_Package
5971 and then In_Package_Body (S)
5980 end In_Package_Body;
5982 --------------------------------
5983 -- In_Parameter_Specification --
5984 --------------------------------
5986 function In_Parameter_Specification (N : Node_Id) return Boolean is
5991 while Present (PN) loop
5992 if Nkind (PN) = N_Parameter_Specification then
6000 end In_Parameter_Specification;
6002 --------------------------------------
6003 -- In_Subprogram_Or_Concurrent_Unit --
6004 --------------------------------------
6006 function In_Subprogram_Or_Concurrent_Unit return Boolean is
6011 -- Use scope chain to check successively outer scopes
6017 if K in Subprogram_Kind
6018 or else K in Concurrent_Kind
6019 or else K in Generic_Subprogram_Kind
6023 elsif E = Standard_Standard then
6029 end In_Subprogram_Or_Concurrent_Unit;
6031 ---------------------
6032 -- In_Visible_Part --
6033 ---------------------
6035 function In_Visible_Part (Scope_Id : Entity_Id) return Boolean is
6038 Is_Package_Or_Generic_Package (Scope_Id)
6039 and then In_Open_Scopes (Scope_Id)
6040 and then not In_Package_Body (Scope_Id)
6041 and then not In_Private_Part (Scope_Id);
6042 end In_Visible_Part;
6044 --------------------------------
6045 -- Incomplete_Or_Private_View --
6046 --------------------------------
6048 function Incomplete_Or_Private_View (Typ : Entity_Id) return Entity_Id is
6049 function Inspect_Decls
6051 Taft : Boolean := False) return Entity_Id;
6052 -- Check whether a declarative region contains the incomplete or private
6059 function Inspect_Decls
6061 Taft : Boolean := False) return Entity_Id
6067 Decl := First (Decls);
6068 while Present (Decl) loop
6072 if Nkind (Decl) = N_Incomplete_Type_Declaration then
6073 Match := Defining_Identifier (Decl);
6077 if Nkind_In (Decl, N_Private_Extension_Declaration,
6078 N_Private_Type_Declaration)
6080 Match := Defining_Identifier (Decl);
6085 and then Present (Full_View (Match))
6086 and then Full_View (Match) = Typ
6101 -- Start of processing for Incomplete_Or_Partial_View
6104 -- Incomplete type case
6106 Prev := Current_Entity_In_Scope (Typ);
6109 and then Is_Incomplete_Type (Prev)
6110 and then Present (Full_View (Prev))
6111 and then Full_View (Prev) = Typ
6116 -- Private or Taft amendment type case
6119 Pkg : constant Entity_Id := Scope (Typ);
6120 Pkg_Decl : Node_Id := Pkg;
6123 if Ekind (Pkg) = E_Package then
6124 while Nkind (Pkg_Decl) /= N_Package_Specification loop
6125 Pkg_Decl := Parent (Pkg_Decl);
6128 -- It is knows that Typ has a private view, look for it in the
6129 -- visible declarations of the enclosing scope. A special case
6130 -- of this is when the two views have been exchanged - the full
6131 -- appears earlier than the private.
6133 if Has_Private_Declaration (Typ) then
6134 Prev := Inspect_Decls (Visible_Declarations (Pkg_Decl));
6136 -- Exchanged view case, look in the private declarations
6139 Prev := Inspect_Decls (Private_Declarations (Pkg_Decl));
6144 -- Otherwise if this is the package body, then Typ is a potential
6145 -- Taft amendment type. The incomplete view should be located in
6146 -- the private declarations of the enclosing scope.
6148 elsif In_Package_Body (Pkg) then
6149 return Inspect_Decls (Private_Declarations (Pkg_Decl), True);
6154 -- The type has no incomplete or private view
6157 end Incomplete_Or_Private_View;
6159 ---------------------------------
6160 -- Insert_Explicit_Dereference --
6161 ---------------------------------
6163 procedure Insert_Explicit_Dereference (N : Node_Id) is
6164 New_Prefix : constant Node_Id := Relocate_Node (N);
6165 Ent : Entity_Id := Empty;
6172 Save_Interps (N, New_Prefix);
6175 Make_Explicit_Dereference (Sloc (Parent (N)),
6176 Prefix => New_Prefix));
6178 Set_Etype (N, Designated_Type (Etype (New_Prefix)));
6180 if Is_Overloaded (New_Prefix) then
6182 -- The dereference is also overloaded, and its interpretations are
6183 -- the designated types of the interpretations of the original node.
6185 Set_Etype (N, Any_Type);
6187 Get_First_Interp (New_Prefix, I, It);
6188 while Present (It.Nam) loop
6191 if Is_Access_Type (T) then
6192 Add_One_Interp (N, Designated_Type (T), Designated_Type (T));
6195 Get_Next_Interp (I, It);
6201 -- Prefix is unambiguous: mark the original prefix (which might
6202 -- Come_From_Source) as a reference, since the new (relocated) one
6203 -- won't be taken into account.
6205 if Is_Entity_Name (New_Prefix) then
6206 Ent := Entity (New_Prefix);
6209 -- For a retrieval of a subcomponent of some composite object,
6210 -- retrieve the ultimate entity if there is one.
6212 elsif Nkind (New_Prefix) = N_Selected_Component
6213 or else Nkind (New_Prefix) = N_Indexed_Component
6215 Pref := Prefix (New_Prefix);
6216 while Present (Pref)
6218 (Nkind (Pref) = N_Selected_Component
6219 or else Nkind (Pref) = N_Indexed_Component)
6221 Pref := Prefix (Pref);
6224 if Present (Pref) and then Is_Entity_Name (Pref) then
6225 Ent := Entity (Pref);
6229 -- Place the reference on the entity node
6231 if Present (Ent) then
6232 Generate_Reference (Ent, Pref);
6235 end Insert_Explicit_Dereference;
6237 ------------------------------------------
6238 -- Inspect_Deferred_Constant_Completion --
6239 ------------------------------------------
6241 procedure Inspect_Deferred_Constant_Completion (Decls : List_Id) is
6245 Decl := First (Decls);
6246 while Present (Decl) loop
6248 -- Deferred constant signature
6250 if Nkind (Decl) = N_Object_Declaration
6251 and then Constant_Present (Decl)
6252 and then No (Expression (Decl))
6254 -- No need to check internally generated constants
6256 and then Comes_From_Source (Decl)
6258 -- The constant is not completed. A full object declaration or a
6259 -- pragma Import complete a deferred constant.
6261 and then not Has_Completion (Defining_Identifier (Decl))
6264 ("constant declaration requires initialization expression",
6265 Defining_Identifier (Decl));
6268 Decl := Next (Decl);
6270 end Inspect_Deferred_Constant_Completion;
6272 -----------------------------
6273 -- Is_Actual_Out_Parameter --
6274 -----------------------------
6276 function Is_Actual_Out_Parameter (N : Node_Id) return Boolean is
6280 Find_Actual (N, Formal, Call);
6281 return Present (Formal) and then Ekind (Formal) = E_Out_Parameter;
6282 end Is_Actual_Out_Parameter;
6284 -------------------------
6285 -- Is_Actual_Parameter --
6286 -------------------------
6288 function Is_Actual_Parameter (N : Node_Id) return Boolean is
6289 PK : constant Node_Kind := Nkind (Parent (N));
6293 when N_Parameter_Association =>
6294 return N = Explicit_Actual_Parameter (Parent (N));
6296 when N_Function_Call | N_Procedure_Call_Statement =>
6297 return Is_List_Member (N)
6299 List_Containing (N) = Parameter_Associations (Parent (N));
6304 end Is_Actual_Parameter;
6306 --------------------------------
6307 -- Is_Actual_Tagged_Parameter --
6308 --------------------------------
6310 function Is_Actual_Tagged_Parameter (N : Node_Id) return Boolean is
6314 Find_Actual (N, Formal, Call);
6315 return Present (Formal) and then Is_Tagged_Type (Etype (Formal));
6316 end Is_Actual_Tagged_Parameter;
6318 ---------------------
6319 -- Is_Aliased_View --
6320 ---------------------
6322 function Is_Aliased_View (Obj : Node_Id) return Boolean is
6326 if Is_Entity_Name (Obj) then
6334 or else (Present (Renamed_Object (E))
6335 and then Is_Aliased_View (Renamed_Object (E)))))
6337 or else ((Is_Formal (E)
6338 or else Ekind (E) = E_Generic_In_Out_Parameter
6339 or else Ekind (E) = E_Generic_In_Parameter)
6340 and then Is_Tagged_Type (Etype (E)))
6342 or else (Is_Concurrent_Type (E)
6343 and then In_Open_Scopes (E))
6345 -- Current instance of type, either directly or as rewritten
6346 -- reference to the current object.
6348 or else (Is_Entity_Name (Original_Node (Obj))
6349 and then Present (Entity (Original_Node (Obj)))
6350 and then Is_Type (Entity (Original_Node (Obj))))
6352 or else (Is_Type (E) and then E = Current_Scope)
6354 or else (Is_Incomplete_Or_Private_Type (E)
6355 and then Full_View (E) = Current_Scope);
6357 elsif Nkind (Obj) = N_Selected_Component then
6358 return Is_Aliased (Entity (Selector_Name (Obj)));
6360 elsif Nkind (Obj) = N_Indexed_Component then
6361 return Has_Aliased_Components (Etype (Prefix (Obj)))
6363 (Is_Access_Type (Etype (Prefix (Obj)))
6365 Has_Aliased_Components
6366 (Designated_Type (Etype (Prefix (Obj)))));
6368 elsif Nkind (Obj) = N_Unchecked_Type_Conversion
6369 or else Nkind (Obj) = N_Type_Conversion
6371 return Is_Tagged_Type (Etype (Obj))
6372 and then Is_Aliased_View (Expression (Obj));
6374 elsif Nkind (Obj) = N_Explicit_Dereference then
6375 return Nkind (Original_Node (Obj)) /= N_Function_Call;
6380 end Is_Aliased_View;
6382 -------------------------
6383 -- Is_Ancestor_Package --
6384 -------------------------
6386 function Is_Ancestor_Package
6388 E2 : Entity_Id) return Boolean
6395 and then Par /= Standard_Standard
6405 end Is_Ancestor_Package;
6407 ----------------------
6408 -- Is_Atomic_Object --
6409 ----------------------
6411 function Is_Atomic_Object (N : Node_Id) return Boolean is
6413 function Object_Has_Atomic_Components (N : Node_Id) return Boolean;
6414 -- Determines if given object has atomic components
6416 function Is_Atomic_Prefix (N : Node_Id) return Boolean;
6417 -- If prefix is an implicit dereference, examine designated type
6419 ----------------------
6420 -- Is_Atomic_Prefix --
6421 ----------------------
6423 function Is_Atomic_Prefix (N : Node_Id) return Boolean is
6425 if Is_Access_Type (Etype (N)) then
6427 Has_Atomic_Components (Designated_Type (Etype (N)));
6429 return Object_Has_Atomic_Components (N);
6431 end Is_Atomic_Prefix;
6433 ----------------------------------
6434 -- Object_Has_Atomic_Components --
6435 ----------------------------------
6437 function Object_Has_Atomic_Components (N : Node_Id) return Boolean is
6439 if Has_Atomic_Components (Etype (N))
6440 or else Is_Atomic (Etype (N))
6444 elsif Is_Entity_Name (N)
6445 and then (Has_Atomic_Components (Entity (N))
6446 or else Is_Atomic (Entity (N)))
6450 elsif Nkind (N) = N_Indexed_Component
6451 or else Nkind (N) = N_Selected_Component
6453 return Is_Atomic_Prefix (Prefix (N));
6458 end Object_Has_Atomic_Components;
6460 -- Start of processing for Is_Atomic_Object
6463 -- Predicate is not relevant to subprograms
6465 if Is_Entity_Name (N) and then Is_Overloadable (Entity (N)) then
6468 elsif Is_Atomic (Etype (N))
6469 or else (Is_Entity_Name (N) and then Is_Atomic (Entity (N)))
6473 elsif Nkind (N) = N_Indexed_Component
6474 or else Nkind (N) = N_Selected_Component
6476 return Is_Atomic_Prefix (Prefix (N));
6481 end Is_Atomic_Object;
6483 -----------------------------
6484 -- Is_Concurrent_Interface --
6485 -----------------------------
6487 function Is_Concurrent_Interface (T : Entity_Id) return Boolean is
6492 (Is_Protected_Interface (T)
6493 or else Is_Synchronized_Interface (T)
6494 or else Is_Task_Interface (T));
6495 end Is_Concurrent_Interface;
6497 --------------------------------------
6498 -- Is_Controlling_Limited_Procedure --
6499 --------------------------------------
6501 function Is_Controlling_Limited_Procedure
6502 (Proc_Nam : Entity_Id) return Boolean
6504 Param_Typ : Entity_Id := Empty;
6507 if Ekind (Proc_Nam) = E_Procedure
6508 and then Present (Parameter_Specifications (Parent (Proc_Nam)))
6510 Param_Typ := Etype (Parameter_Type (First (
6511 Parameter_Specifications (Parent (Proc_Nam)))));
6513 -- In this case where an Itype was created, the procedure call has been
6516 elsif Present (Associated_Node_For_Itype (Proc_Nam))
6517 and then Present (Original_Node (Associated_Node_For_Itype (Proc_Nam)))
6519 Present (Parameter_Associations
6520 (Associated_Node_For_Itype (Proc_Nam)))
6523 Etype (First (Parameter_Associations
6524 (Associated_Node_For_Itype (Proc_Nam))));
6527 if Present (Param_Typ) then
6529 Is_Interface (Param_Typ)
6530 and then Is_Limited_Record (Param_Typ);
6534 end Is_Controlling_Limited_Procedure;
6536 -----------------------------
6537 -- Is_CPP_Constructor_Call --
6538 -----------------------------
6540 function Is_CPP_Constructor_Call (N : Node_Id) return Boolean is
6542 return Nkind (N) = N_Function_Call
6543 and then Is_CPP_Class (Etype (Etype (N)))
6544 and then Is_Constructor (Entity (Name (N)))
6545 and then Is_Imported (Entity (Name (N)));
6546 end Is_CPP_Constructor_Call;
6552 function Is_Delegate (T : Entity_Id) return Boolean is
6553 Desig_Type : Entity_Id;
6556 if VM_Target /= CLI_Target then
6560 -- Access-to-subprograms are delegates in CIL
6562 if Ekind (T) = E_Access_Subprogram_Type then
6566 if Ekind (T) not in Access_Kind then
6568 -- A delegate is a managed pointer. If no designated type is defined
6569 -- it means that it's not a delegate.
6574 Desig_Type := Etype (Directly_Designated_Type (T));
6576 if not Is_Tagged_Type (Desig_Type) then
6580 -- Test if the type is inherited from [mscorlib]System.Delegate
6582 while Etype (Desig_Type) /= Desig_Type loop
6583 if Chars (Scope (Desig_Type)) /= No_Name
6584 and then Is_Imported (Scope (Desig_Type))
6585 and then Get_Name_String (Chars (Scope (Desig_Type))) = "delegate"
6590 Desig_Type := Etype (Desig_Type);
6596 ----------------------------------------------
6597 -- Is_Dependent_Component_Of_Mutable_Object --
6598 ----------------------------------------------
6600 function Is_Dependent_Component_Of_Mutable_Object
6601 (Object : Node_Id) return Boolean
6604 Prefix_Type : Entity_Id;
6605 P_Aliased : Boolean := False;
6608 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean;
6609 -- Returns True if and only if Comp is declared within a variant part
6611 --------------------------------
6612 -- Is_Declared_Within_Variant --
6613 --------------------------------
6615 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean is
6616 Comp_Decl : constant Node_Id := Parent (Comp);
6617 Comp_List : constant Node_Id := Parent (Comp_Decl);
6619 return Nkind (Parent (Comp_List)) = N_Variant;
6620 end Is_Declared_Within_Variant;
6622 -- Start of processing for Is_Dependent_Component_Of_Mutable_Object
6625 if Is_Variable (Object) then
6627 if Nkind (Object) = N_Selected_Component then
6628 P := Prefix (Object);
6629 Prefix_Type := Etype (P);
6631 if Is_Entity_Name (P) then
6633 if Ekind (Entity (P)) = E_Generic_In_Out_Parameter then
6634 Prefix_Type := Base_Type (Prefix_Type);
6637 if Is_Aliased (Entity (P)) then
6641 -- A discriminant check on a selected component may be expanded
6642 -- into a dereference when removing side-effects. Recover the
6643 -- original node and its type, which may be unconstrained.
6645 elsif Nkind (P) = N_Explicit_Dereference
6646 and then not (Comes_From_Source (P))
6648 P := Original_Node (P);
6649 Prefix_Type := Etype (P);
6652 -- Check for prefix being an aliased component???
6658 -- A heap object is constrained by its initial value
6660 -- Ada 2005 (AI-363): Always assume the object could be mutable in
6661 -- the dereferenced case, since the access value might denote an
6662 -- unconstrained aliased object, whereas in Ada 95 the designated
6663 -- object is guaranteed to be constrained. A worst-case assumption
6664 -- has to apply in Ada 2005 because we can't tell at compile time
6665 -- whether the object is "constrained by its initial value"
6666 -- (despite the fact that 3.10.2(26/2) and 8.5.1(5/2) are
6667 -- semantic rules -- these rules are acknowledged to need fixing).
6669 if Ada_Version < Ada_2005 then
6670 if Is_Access_Type (Prefix_Type)
6671 or else Nkind (P) = N_Explicit_Dereference
6676 elsif Ada_Version >= Ada_2005 then
6677 if Is_Access_Type (Prefix_Type) then
6679 -- If the access type is pool-specific, and there is no
6680 -- constrained partial view of the designated type, then the
6681 -- designated object is known to be constrained.
6683 if Ekind (Prefix_Type) = E_Access_Type
6684 and then not Has_Constrained_Partial_View
6685 (Designated_Type (Prefix_Type))
6689 -- Otherwise (general access type, or there is a constrained
6690 -- partial view of the designated type), we need to check
6691 -- based on the designated type.
6694 Prefix_Type := Designated_Type (Prefix_Type);
6700 Original_Record_Component (Entity (Selector_Name (Object)));
6702 -- As per AI-0017, the renaming is illegal in a generic body, even
6703 -- if the subtype is indefinite.
6705 -- Ada 2005 (AI-363): In Ada 2005 an aliased object can be mutable
6707 if not Is_Constrained (Prefix_Type)
6708 and then (not Is_Indefinite_Subtype (Prefix_Type)
6710 (Is_Generic_Type (Prefix_Type)
6711 and then Ekind (Current_Scope) = E_Generic_Package
6712 and then In_Package_Body (Current_Scope)))
6714 and then (Is_Declared_Within_Variant (Comp)
6715 or else Has_Discriminant_Dependent_Constraint (Comp))
6716 and then (not P_Aliased or else Ada_Version >= Ada_2005)
6722 Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
6726 elsif Nkind (Object) = N_Indexed_Component
6727 or else Nkind (Object) = N_Slice
6729 return Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
6731 -- A type conversion that Is_Variable is a view conversion:
6732 -- go back to the denoted object.
6734 elsif Nkind (Object) = N_Type_Conversion then
6736 Is_Dependent_Component_Of_Mutable_Object (Expression (Object));
6741 end Is_Dependent_Component_Of_Mutable_Object;
6743 ---------------------
6744 -- Is_Dereferenced --
6745 ---------------------
6747 function Is_Dereferenced (N : Node_Id) return Boolean is
6748 P : constant Node_Id := Parent (N);
6751 (Nkind (P) = N_Selected_Component
6753 Nkind (P) = N_Explicit_Dereference
6755 Nkind (P) = N_Indexed_Component
6757 Nkind (P) = N_Slice)
6758 and then Prefix (P) = N;
6759 end Is_Dereferenced;
6761 ----------------------
6762 -- Is_Descendent_Of --
6763 ----------------------
6765 function Is_Descendent_Of (T1 : Entity_Id; T2 : Entity_Id) return Boolean is
6770 pragma Assert (Nkind (T1) in N_Entity);
6771 pragma Assert (Nkind (T2) in N_Entity);
6773 T := Base_Type (T1);
6775 -- Immediate return if the types match
6780 -- Comment needed here ???
6782 elsif Ekind (T) = E_Class_Wide_Type then
6783 return Etype (T) = T2;
6791 -- Done if we found the type we are looking for
6796 -- Done if no more derivations to check
6803 -- Following test catches error cases resulting from prev errors
6805 elsif No (Etyp) then
6808 elsif Is_Private_Type (T) and then Etyp = Full_View (T) then
6811 elsif Is_Private_Type (Etyp) and then Full_View (Etyp) = T then
6815 T := Base_Type (Etyp);
6818 end Is_Descendent_Of;
6820 ----------------------------
6821 -- Is_Expression_Function --
6822 ----------------------------
6824 function Is_Expression_Function (Subp : Entity_Id) return Boolean is
6825 Decl : constant Node_Id := Unit_Declaration_Node (Subp);
6828 return Ekind (Subp) = E_Function
6829 and then Nkind (Decl) = N_Subprogram_Declaration
6831 (Nkind (Original_Node (Decl)) = N_Expression_Function
6833 (Present (Corresponding_Body (Decl))
6835 Nkind (Original_Node
6836 (Unit_Declaration_Node (Corresponding_Body (Decl))))
6837 = N_Expression_Function));
6838 end Is_Expression_Function;
6844 function Is_False (U : Uint) return Boolean is
6849 ---------------------------
6850 -- Is_Fixed_Model_Number --
6851 ---------------------------
6853 function Is_Fixed_Model_Number (U : Ureal; T : Entity_Id) return Boolean is
6854 S : constant Ureal := Small_Value (T);
6855 M : Urealp.Save_Mark;
6859 R := (U = UR_Trunc (U / S) * S);
6862 end Is_Fixed_Model_Number;
6864 -------------------------------
6865 -- Is_Fully_Initialized_Type --
6866 -------------------------------
6868 function Is_Fully_Initialized_Type (Typ : Entity_Id) return Boolean is
6870 if Is_Scalar_Type (Typ) then
6873 elsif Is_Access_Type (Typ) then
6876 elsif Is_Array_Type (Typ) then
6877 if Is_Fully_Initialized_Type (Component_Type (Typ)) then
6881 -- An interesting case, if we have a constrained type one of whose
6882 -- bounds is known to be null, then there are no elements to be
6883 -- initialized, so all the elements are initialized!
6885 if Is_Constrained (Typ) then
6888 Indx_Typ : Entity_Id;
6892 Indx := First_Index (Typ);
6893 while Present (Indx) loop
6894 if Etype (Indx) = Any_Type then
6897 -- If index is a range, use directly
6899 elsif Nkind (Indx) = N_Range then
6900 Lbd := Low_Bound (Indx);
6901 Hbd := High_Bound (Indx);
6904 Indx_Typ := Etype (Indx);
6906 if Is_Private_Type (Indx_Typ) then
6907 Indx_Typ := Full_View (Indx_Typ);
6910 if No (Indx_Typ) or else Etype (Indx_Typ) = Any_Type then
6913 Lbd := Type_Low_Bound (Indx_Typ);
6914 Hbd := Type_High_Bound (Indx_Typ);
6918 if Compile_Time_Known_Value (Lbd)
6919 and then Compile_Time_Known_Value (Hbd)
6921 if Expr_Value (Hbd) < Expr_Value (Lbd) then
6931 -- If no null indexes, then type is not fully initialized
6937 elsif Is_Record_Type (Typ) then
6938 if Has_Discriminants (Typ)
6940 Present (Discriminant_Default_Value (First_Discriminant (Typ)))
6941 and then Is_Fully_Initialized_Variant (Typ)
6946 -- Controlled records are considered to be fully initialized if
6947 -- there is a user defined Initialize routine. This may not be
6948 -- entirely correct, but as the spec notes, we are guessing here
6949 -- what is best from the point of view of issuing warnings.
6951 if Is_Controlled (Typ) then
6953 Utyp : constant Entity_Id := Underlying_Type (Typ);
6956 if Present (Utyp) then
6958 Init : constant Entity_Id :=
6960 (Underlying_Type (Typ), Name_Initialize));
6964 and then Comes_From_Source (Init)
6966 Is_Predefined_File_Name
6967 (File_Name (Get_Source_File_Index (Sloc (Init))))
6971 elsif Has_Null_Extension (Typ)
6973 Is_Fully_Initialized_Type
6974 (Etype (Base_Type (Typ)))
6983 -- Otherwise see if all record components are initialized
6989 Ent := First_Entity (Typ);
6990 while Present (Ent) loop
6991 if Ekind (Ent) = E_Component
6992 and then (No (Parent (Ent))
6993 or else No (Expression (Parent (Ent))))
6994 and then not Is_Fully_Initialized_Type (Etype (Ent))
6996 -- Special VM case for tag components, which need to be
6997 -- defined in this case, but are never initialized as VMs
6998 -- are using other dispatching mechanisms. Ignore this
6999 -- uninitialized case. Note that this applies both to the
7000 -- uTag entry and the main vtable pointer (CPP_Class case).
7002 and then (Tagged_Type_Expansion or else not Is_Tag (Ent))
7011 -- No uninitialized components, so type is fully initialized.
7012 -- Note that this catches the case of no components as well.
7016 elsif Is_Concurrent_Type (Typ) then
7019 elsif Is_Private_Type (Typ) then
7021 U : constant Entity_Id := Underlying_Type (Typ);
7027 return Is_Fully_Initialized_Type (U);
7034 end Is_Fully_Initialized_Type;
7036 ----------------------------------
7037 -- Is_Fully_Initialized_Variant --
7038 ----------------------------------
7040 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean is
7041 Loc : constant Source_Ptr := Sloc (Typ);
7042 Constraints : constant List_Id := New_List;
7043 Components : constant Elist_Id := New_Elmt_List;
7044 Comp_Elmt : Elmt_Id;
7046 Comp_List : Node_Id;
7048 Discr_Val : Node_Id;
7050 Report_Errors : Boolean;
7051 pragma Warnings (Off, Report_Errors);
7054 if Serious_Errors_Detected > 0 then
7058 if Is_Record_Type (Typ)
7059 and then Nkind (Parent (Typ)) = N_Full_Type_Declaration
7060 and then Nkind (Type_Definition (Parent (Typ))) = N_Record_Definition
7062 Comp_List := Component_List (Type_Definition (Parent (Typ)));
7064 Discr := First_Discriminant (Typ);
7065 while Present (Discr) loop
7066 if Nkind (Parent (Discr)) = N_Discriminant_Specification then
7067 Discr_Val := Expression (Parent (Discr));
7069 if Present (Discr_Val)
7070 and then Is_OK_Static_Expression (Discr_Val)
7072 Append_To (Constraints,
7073 Make_Component_Association (Loc,
7074 Choices => New_List (New_Occurrence_Of (Discr, Loc)),
7075 Expression => New_Copy (Discr_Val)));
7083 Next_Discriminant (Discr);
7088 Comp_List => Comp_List,
7089 Governed_By => Constraints,
7091 Report_Errors => Report_Errors);
7093 -- Check that each component present is fully initialized
7095 Comp_Elmt := First_Elmt (Components);
7096 while Present (Comp_Elmt) loop
7097 Comp_Id := Node (Comp_Elmt);
7099 if Ekind (Comp_Id) = E_Component
7100 and then (No (Parent (Comp_Id))
7101 or else No (Expression (Parent (Comp_Id))))
7102 and then not Is_Fully_Initialized_Type (Etype (Comp_Id))
7107 Next_Elmt (Comp_Elmt);
7112 elsif Is_Private_Type (Typ) then
7114 U : constant Entity_Id := Underlying_Type (Typ);
7120 return Is_Fully_Initialized_Variant (U);
7126 end Is_Fully_Initialized_Variant;
7132 -- We seem to have a lot of overlapping functions that do similar things
7133 -- (testing for left hand sides or lvalues???). Anyway, since this one is
7134 -- purely syntactic, it should be in Sem_Aux I would think???
7136 function Is_LHS (N : Node_Id) return Boolean is
7137 P : constant Node_Id := Parent (N);
7140 if Nkind (P) = N_Assignment_Statement then
7141 return Name (P) = N;
7144 Nkind_In (P, N_Indexed_Component, N_Selected_Component, N_Slice)
7146 return N = Prefix (P) and then Is_LHS (P);
7153 ----------------------------
7154 -- Is_Inherited_Operation --
7155 ----------------------------
7157 function Is_Inherited_Operation (E : Entity_Id) return Boolean is
7158 Kind : constant Node_Kind := Nkind (Parent (E));
7160 pragma Assert (Is_Overloadable (E));
7161 return Kind = N_Full_Type_Declaration
7162 or else Kind = N_Private_Extension_Declaration
7163 or else Kind = N_Subtype_Declaration
7164 or else (Ekind (E) = E_Enumeration_Literal
7165 and then Is_Derived_Type (Etype (E)));
7166 end Is_Inherited_Operation;
7168 -------------------------------------
7169 -- Is_Inherited_Operation_For_Type --
7170 -------------------------------------
7172 function Is_Inherited_Operation_For_Type
7173 (E : Entity_Id; Typ : Entity_Id) return Boolean
7176 return Is_Inherited_Operation (E)
7177 and then Etype (Parent (E)) = Typ;
7178 end Is_Inherited_Operation_For_Type;
7180 -----------------------------
7181 -- Is_Library_Level_Entity --
7182 -----------------------------
7184 function Is_Library_Level_Entity (E : Entity_Id) return Boolean is
7186 -- The following is a small optimization, and it also properly handles
7187 -- discriminals, which in task bodies might appear in expressions before
7188 -- the corresponding procedure has been created, and which therefore do
7189 -- not have an assigned scope.
7191 if Is_Formal (E) then
7195 -- Normal test is simply that the enclosing dynamic scope is Standard
7197 return Enclosing_Dynamic_Scope (E) = Standard_Standard;
7198 end Is_Library_Level_Entity;
7200 ---------------------------------
7201 -- Is_Local_Variable_Reference --
7202 ---------------------------------
7204 function Is_Local_Variable_Reference (Expr : Node_Id) return Boolean is
7206 if not Is_Entity_Name (Expr) then
7211 Ent : constant Entity_Id := Entity (Expr);
7212 Sub : constant Entity_Id := Enclosing_Subprogram (Ent);
7214 if not Ekind_In (Ent, E_Variable, E_In_Out_Parameter) then
7217 return Present (Sub) and then Sub = Current_Subprogram;
7221 end Is_Local_Variable_Reference;
7223 -------------------------
7224 -- Is_Object_Reference --
7225 -------------------------
7227 function Is_Object_Reference (N : Node_Id) return Boolean is
7229 if Is_Entity_Name (N) then
7230 return Present (Entity (N)) and then Is_Object (Entity (N));
7234 when N_Indexed_Component | N_Slice =>
7236 Is_Object_Reference (Prefix (N))
7237 or else Is_Access_Type (Etype (Prefix (N)));
7239 -- In Ada95, a function call is a constant object; a procedure
7242 when N_Function_Call =>
7243 return Etype (N) /= Standard_Void_Type;
7245 -- A reference to the stream attribute Input is a function call
7247 when N_Attribute_Reference =>
7248 return Attribute_Name (N) = Name_Input;
7250 when N_Selected_Component =>
7252 Is_Object_Reference (Selector_Name (N))
7254 (Is_Object_Reference (Prefix (N))
7255 or else Is_Access_Type (Etype (Prefix (N))));
7257 when N_Explicit_Dereference =>
7260 -- A view conversion of a tagged object is an object reference
7262 when N_Type_Conversion =>
7263 return Is_Tagged_Type (Etype (Subtype_Mark (N)))
7264 and then Is_Tagged_Type (Etype (Expression (N)))
7265 and then Is_Object_Reference (Expression (N));
7267 -- An unchecked type conversion is considered to be an object if
7268 -- the operand is an object (this construction arises only as a
7269 -- result of expansion activities).
7271 when N_Unchecked_Type_Conversion =>
7278 end Is_Object_Reference;
7280 -----------------------------------
7281 -- Is_OK_Variable_For_Out_Formal --
7282 -----------------------------------
7284 function Is_OK_Variable_For_Out_Formal (AV : Node_Id) return Boolean is
7286 Note_Possible_Modification (AV, Sure => True);
7288 -- We must reject parenthesized variable names. The check for
7289 -- Comes_From_Source is present because there are currently
7290 -- cases where the compiler violates this rule (e.g. passing
7291 -- a task object to its controlled Initialize routine).
7293 if Paren_Count (AV) > 0 and then Comes_From_Source (AV) then
7296 -- A variable is always allowed
7298 elsif Is_Variable (AV) then
7301 -- Unchecked conversions are allowed only if they come from the
7302 -- generated code, which sometimes uses unchecked conversions for out
7303 -- parameters in cases where code generation is unaffected. We tell
7304 -- source unchecked conversions by seeing if they are rewrites of an
7305 -- original Unchecked_Conversion function call, or of an explicit
7306 -- conversion of a function call.
7308 elsif Nkind (AV) = N_Unchecked_Type_Conversion then
7309 if Nkind (Original_Node (AV)) = N_Function_Call then
7312 elsif Comes_From_Source (AV)
7313 and then Nkind (Original_Node (Expression (AV))) = N_Function_Call
7317 elsif Nkind (Original_Node (AV)) = N_Type_Conversion then
7318 return Is_OK_Variable_For_Out_Formal (Expression (AV));
7324 -- Normal type conversions are allowed if argument is a variable
7326 elsif Nkind (AV) = N_Type_Conversion then
7327 if Is_Variable (Expression (AV))
7328 and then Paren_Count (Expression (AV)) = 0
7330 Note_Possible_Modification (Expression (AV), Sure => True);
7333 -- We also allow a non-parenthesized expression that raises
7334 -- constraint error if it rewrites what used to be a variable
7336 elsif Raises_Constraint_Error (Expression (AV))
7337 and then Paren_Count (Expression (AV)) = 0
7338 and then Is_Variable (Original_Node (Expression (AV)))
7342 -- Type conversion of something other than a variable
7348 -- If this node is rewritten, then test the original form, if that is
7349 -- OK, then we consider the rewritten node OK (for example, if the
7350 -- original node is a conversion, then Is_Variable will not be true
7351 -- but we still want to allow the conversion if it converts a variable).
7353 elsif Original_Node (AV) /= AV then
7354 return Is_OK_Variable_For_Out_Formal (Original_Node (AV));
7356 -- All other non-variables are rejected
7361 end Is_OK_Variable_For_Out_Formal;
7363 -----------------------------------
7364 -- Is_Partially_Initialized_Type --
7365 -----------------------------------
7367 function Is_Partially_Initialized_Type
7369 Include_Implicit : Boolean := True) return Boolean
7372 if Is_Scalar_Type (Typ) then
7375 elsif Is_Access_Type (Typ) then
7376 return Include_Implicit;
7378 elsif Is_Array_Type (Typ) then
7380 -- If component type is partially initialized, so is array type
7382 if Is_Partially_Initialized_Type
7383 (Component_Type (Typ), Include_Implicit)
7387 -- Otherwise we are only partially initialized if we are fully
7388 -- initialized (this is the empty array case, no point in us
7389 -- duplicating that code here).
7392 return Is_Fully_Initialized_Type (Typ);
7395 elsif Is_Record_Type (Typ) then
7397 -- A discriminated type is always partially initialized if in
7400 if Has_Discriminants (Typ) and then Include_Implicit then
7403 -- A tagged type is always partially initialized
7405 elsif Is_Tagged_Type (Typ) then
7408 -- Case of non-discriminated record
7414 Component_Present : Boolean := False;
7415 -- Set True if at least one component is present. If no
7416 -- components are present, then record type is fully
7417 -- initialized (another odd case, like the null array).
7420 -- Loop through components
7422 Ent := First_Entity (Typ);
7423 while Present (Ent) loop
7424 if Ekind (Ent) = E_Component then
7425 Component_Present := True;
7427 -- If a component has an initialization expression then
7428 -- the enclosing record type is partially initialized
7430 if Present (Parent (Ent))
7431 and then Present (Expression (Parent (Ent)))
7435 -- If a component is of a type which is itself partially
7436 -- initialized, then the enclosing record type is also.
7438 elsif Is_Partially_Initialized_Type
7439 (Etype (Ent), Include_Implicit)
7448 -- No initialized components found. If we found any components
7449 -- they were all uninitialized so the result is false.
7451 if Component_Present then
7454 -- But if we found no components, then all the components are
7455 -- initialized so we consider the type to be initialized.
7463 -- Concurrent types are always fully initialized
7465 elsif Is_Concurrent_Type (Typ) then
7468 -- For a private type, go to underlying type. If there is no underlying
7469 -- type then just assume this partially initialized. Not clear if this
7470 -- can happen in a non-error case, but no harm in testing for this.
7472 elsif Is_Private_Type (Typ) then
7474 U : constant Entity_Id := Underlying_Type (Typ);
7479 return Is_Partially_Initialized_Type (U, Include_Implicit);
7483 -- For any other type (are there any?) assume partially initialized
7488 end Is_Partially_Initialized_Type;
7490 ------------------------------------
7491 -- Is_Potentially_Persistent_Type --
7492 ------------------------------------
7494 function Is_Potentially_Persistent_Type (T : Entity_Id) return Boolean is
7499 -- For private type, test corresponding full type
7501 if Is_Private_Type (T) then
7502 return Is_Potentially_Persistent_Type (Full_View (T));
7504 -- Scalar types are potentially persistent
7506 elsif Is_Scalar_Type (T) then
7509 -- Record type is potentially persistent if not tagged and the types of
7510 -- all it components are potentially persistent, and no component has
7511 -- an initialization expression.
7513 elsif Is_Record_Type (T)
7514 and then not Is_Tagged_Type (T)
7515 and then not Is_Partially_Initialized_Type (T)
7517 Comp := First_Component (T);
7518 while Present (Comp) loop
7519 if not Is_Potentially_Persistent_Type (Etype (Comp)) then
7528 -- Array type is potentially persistent if its component type is
7529 -- potentially persistent and if all its constraints are static.
7531 elsif Is_Array_Type (T) then
7532 if not Is_Potentially_Persistent_Type (Component_Type (T)) then
7536 Indx := First_Index (T);
7537 while Present (Indx) loop
7538 if not Is_OK_Static_Subtype (Etype (Indx)) then
7547 -- All other types are not potentially persistent
7552 end Is_Potentially_Persistent_Type;
7554 ---------------------------------
7555 -- Is_Protected_Self_Reference --
7556 ---------------------------------
7558 function Is_Protected_Self_Reference (N : Node_Id) return Boolean is
7560 function In_Access_Definition (N : Node_Id) return Boolean;
7561 -- Returns true if N belongs to an access definition
7563 --------------------------
7564 -- In_Access_Definition --
7565 --------------------------
7567 function In_Access_Definition (N : Node_Id) return Boolean is
7572 while Present (P) loop
7573 if Nkind (P) = N_Access_Definition then
7581 end In_Access_Definition;
7583 -- Start of processing for Is_Protected_Self_Reference
7586 -- Verify that prefix is analyzed and has the proper form. Note that
7587 -- the attributes Elab_Spec, Elab_Body, and UET_Address, which also
7588 -- produce the address of an entity, do not analyze their prefix
7589 -- because they denote entities that are not necessarily visible.
7590 -- Neither of them can apply to a protected type.
7592 return Ada_Version >= Ada_2005
7593 and then Is_Entity_Name (N)
7594 and then Present (Entity (N))
7595 and then Is_Protected_Type (Entity (N))
7596 and then In_Open_Scopes (Entity (N))
7597 and then not In_Access_Definition (N);
7598 end Is_Protected_Self_Reference;
7600 -----------------------------
7601 -- Is_RCI_Pkg_Spec_Or_Body --
7602 -----------------------------
7604 function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
7606 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
7607 -- Return True if the unit of Cunit is an RCI package declaration
7609 ---------------------------
7610 -- Is_RCI_Pkg_Decl_Cunit --
7611 ---------------------------
7613 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean is
7614 The_Unit : constant Node_Id := Unit (Cunit);
7617 if Nkind (The_Unit) /= N_Package_Declaration then
7621 return Is_Remote_Call_Interface (Defining_Entity (The_Unit));
7622 end Is_RCI_Pkg_Decl_Cunit;
7624 -- Start of processing for Is_RCI_Pkg_Spec_Or_Body
7627 return Is_RCI_Pkg_Decl_Cunit (Cunit)
7629 (Nkind (Unit (Cunit)) = N_Package_Body
7630 and then Is_RCI_Pkg_Decl_Cunit (Library_Unit (Cunit)));
7631 end Is_RCI_Pkg_Spec_Or_Body;
7633 -----------------------------------------
7634 -- Is_Remote_Access_To_Class_Wide_Type --
7635 -----------------------------------------
7637 function Is_Remote_Access_To_Class_Wide_Type
7638 (E : Entity_Id) return Boolean
7641 -- A remote access to class-wide type is a general access to object type
7642 -- declared in the visible part of a Remote_Types or Remote_Call_
7645 return Ekind (E) = E_General_Access_Type
7646 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
7647 end Is_Remote_Access_To_Class_Wide_Type;
7649 -----------------------------------------
7650 -- Is_Remote_Access_To_Subprogram_Type --
7651 -----------------------------------------
7653 function Is_Remote_Access_To_Subprogram_Type
7654 (E : Entity_Id) return Boolean
7657 return (Ekind (E) = E_Access_Subprogram_Type
7658 or else (Ekind (E) = E_Record_Type
7659 and then Present (Corresponding_Remote_Type (E))))
7660 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
7661 end Is_Remote_Access_To_Subprogram_Type;
7663 --------------------
7664 -- Is_Remote_Call --
7665 --------------------
7667 function Is_Remote_Call (N : Node_Id) return Boolean is
7669 if Nkind (N) /= N_Procedure_Call_Statement
7670 and then Nkind (N) /= N_Function_Call
7672 -- An entry call cannot be remote
7676 elsif Nkind (Name (N)) in N_Has_Entity
7677 and then Is_Remote_Call_Interface (Entity (Name (N)))
7679 -- A subprogram declared in the spec of a RCI package is remote
7683 elsif Nkind (Name (N)) = N_Explicit_Dereference
7684 and then Is_Remote_Access_To_Subprogram_Type
7685 (Etype (Prefix (Name (N))))
7687 -- The dereference of a RAS is a remote call
7691 elsif Present (Controlling_Argument (N))
7692 and then Is_Remote_Access_To_Class_Wide_Type
7693 (Etype (Controlling_Argument (N)))
7695 -- Any primitive operation call with a controlling argument of
7696 -- a RACW type is a remote call.
7701 -- All other calls are local calls
7706 ----------------------
7707 -- Is_Renamed_Entry --
7708 ----------------------
7710 function Is_Renamed_Entry (Proc_Nam : Entity_Id) return Boolean is
7711 Orig_Node : Node_Id := Empty;
7712 Subp_Decl : Node_Id := Parent (Parent (Proc_Nam));
7714 function Is_Entry (Nam : Node_Id) return Boolean;
7715 -- Determine whether Nam is an entry. Traverse selectors if there are
7716 -- nested selected components.
7722 function Is_Entry (Nam : Node_Id) return Boolean is
7724 if Nkind (Nam) = N_Selected_Component then
7725 return Is_Entry (Selector_Name (Nam));
7728 return Ekind (Entity (Nam)) = E_Entry;
7731 -- Start of processing for Is_Renamed_Entry
7734 if Present (Alias (Proc_Nam)) then
7735 Subp_Decl := Parent (Parent (Alias (Proc_Nam)));
7738 -- Look for a rewritten subprogram renaming declaration
7740 if Nkind (Subp_Decl) = N_Subprogram_Declaration
7741 and then Present (Original_Node (Subp_Decl))
7743 Orig_Node := Original_Node (Subp_Decl);
7746 -- The rewritten subprogram is actually an entry
7748 if Present (Orig_Node)
7749 and then Nkind (Orig_Node) = N_Subprogram_Renaming_Declaration
7750 and then Is_Entry (Name (Orig_Node))
7756 end Is_Renamed_Entry;
7758 ----------------------
7759 -- Is_Selector_Name --
7760 ----------------------
7762 function Is_Selector_Name (N : Node_Id) return Boolean is
7764 if not Is_List_Member (N) then
7766 P : constant Node_Id := Parent (N);
7767 K : constant Node_Kind := Nkind (P);
7770 (K = N_Expanded_Name or else
7771 K = N_Generic_Association or else
7772 K = N_Parameter_Association or else
7773 K = N_Selected_Component)
7774 and then Selector_Name (P) = N;
7779 L : constant List_Id := List_Containing (N);
7780 P : constant Node_Id := Parent (L);
7782 return (Nkind (P) = N_Discriminant_Association
7783 and then Selector_Names (P) = L)
7785 (Nkind (P) = N_Component_Association
7786 and then Choices (P) = L);
7789 end Is_Selector_Name;
7791 ----------------------------------
7792 -- Is_SPARK_Initialization_Expr --
7793 ----------------------------------
7795 function Is_SPARK_Initialization_Expr (N : Node_Id) return Boolean is
7798 Comp_Assn : Node_Id;
7799 Orig_N : constant Node_Id := Original_Node (N);
7804 if not Comes_From_Source (Orig_N) then
7808 pragma Assert (Nkind (Orig_N) in N_Subexpr);
7810 case Nkind (Orig_N) is
7811 when N_Character_Literal |
7819 if Is_Entity_Name (Orig_N)
7820 and then Present (Entity (Orig_N)) -- needed in some cases
7822 case Ekind (Entity (Orig_N)) is
7824 E_Enumeration_Literal |
7829 if Is_Type (Entity (Orig_N)) then
7837 when N_Qualified_Expression |
7838 N_Type_Conversion =>
7839 Is_Ok := Is_SPARK_Initialization_Expr (Expression (Orig_N));
7842 Is_Ok := Is_SPARK_Initialization_Expr (Right_Opnd (Orig_N));
7846 N_Membership_Test =>
7847 Is_Ok := Is_SPARK_Initialization_Expr (Left_Opnd (Orig_N))
7848 and then Is_SPARK_Initialization_Expr (Right_Opnd (Orig_N));
7851 N_Extension_Aggregate =>
7852 if Nkind (Orig_N) = N_Extension_Aggregate then
7853 Is_Ok := Is_SPARK_Initialization_Expr (Ancestor_Part (Orig_N));
7856 Expr := First (Expressions (Orig_N));
7857 while Present (Expr) loop
7858 if not Is_SPARK_Initialization_Expr (Expr) then
7866 Comp_Assn := First (Component_Associations (Orig_N));
7867 while Present (Comp_Assn) loop
7868 Expr := Expression (Comp_Assn);
7869 if Present (Expr) -- needed for box association
7870 and then not Is_SPARK_Initialization_Expr (Expr)
7879 when N_Attribute_Reference =>
7880 if Nkind (Prefix (Orig_N)) in N_Subexpr then
7881 Is_Ok := Is_SPARK_Initialization_Expr (Prefix (Orig_N));
7884 Expr := First (Expressions (Orig_N));
7885 while Present (Expr) loop
7886 if not Is_SPARK_Initialization_Expr (Expr) then
7894 -- Selected components might be expanded named not yet resolved, so
7895 -- default on the safe side. (Eg on sparklex.ads)
7897 when N_Selected_Component =>
7906 end Is_SPARK_Initialization_Expr;
7908 -------------------------------
7909 -- Is_SPARK_Object_Reference --
7910 -------------------------------
7912 function Is_SPARK_Object_Reference (N : Node_Id) return Boolean is
7914 if Is_Entity_Name (N) then
7915 return Present (Entity (N))
7917 (Ekind_In (Entity (N), E_Constant, E_Variable)
7918 or else Ekind (Entity (N)) in Formal_Kind);
7922 when N_Selected_Component =>
7923 return Is_SPARK_Object_Reference (Prefix (N));
7929 end Is_SPARK_Object_Reference;
7935 function Is_Statement (N : Node_Id) return Boolean is
7938 Nkind (N) in N_Statement_Other_Than_Procedure_Call
7939 or else Nkind (N) = N_Procedure_Call_Statement;
7942 ---------------------------------
7943 -- Is_Synchronized_Tagged_Type --
7944 ---------------------------------
7946 function Is_Synchronized_Tagged_Type (E : Entity_Id) return Boolean is
7947 Kind : constant Entity_Kind := Ekind (Base_Type (E));
7950 -- A task or protected type derived from an interface is a tagged type.
7951 -- Such a tagged type is called a synchronized tagged type, as are
7952 -- synchronized interfaces and private extensions whose declaration
7953 -- includes the reserved word synchronized.
7955 return (Is_Tagged_Type (E)
7956 and then (Kind = E_Task_Type
7957 or else Kind = E_Protected_Type))
7960 and then Is_Synchronized_Interface (E))
7962 (Ekind (E) = E_Record_Type_With_Private
7963 and then Nkind (Parent (E)) = N_Private_Extension_Declaration
7964 and then (Synchronized_Present (Parent (E))
7965 or else Is_Synchronized_Interface (Etype (E))));
7966 end Is_Synchronized_Tagged_Type;
7972 function Is_Transfer (N : Node_Id) return Boolean is
7973 Kind : constant Node_Kind := Nkind (N);
7976 if Kind = N_Simple_Return_Statement
7978 Kind = N_Extended_Return_Statement
7980 Kind = N_Goto_Statement
7982 Kind = N_Raise_Statement
7984 Kind = N_Requeue_Statement
7988 elsif (Kind = N_Exit_Statement or else Kind in N_Raise_xxx_Error)
7989 and then No (Condition (N))
7993 elsif Kind = N_Procedure_Call_Statement
7994 and then Is_Entity_Name (Name (N))
7995 and then Present (Entity (Name (N)))
7996 and then No_Return (Entity (Name (N)))
8000 elsif Nkind (Original_Node (N)) = N_Raise_Statement then
8012 function Is_True (U : Uint) return Boolean is
8017 -------------------------------
8018 -- Is_Universal_Numeric_Type --
8019 -------------------------------
8021 function Is_Universal_Numeric_Type (T : Entity_Id) return Boolean is
8023 return T = Universal_Integer or else T = Universal_Real;
8024 end Is_Universal_Numeric_Type;
8030 function Is_Value_Type (T : Entity_Id) return Boolean is
8032 return VM_Target = CLI_Target
8033 and then Nkind (T) in N_Has_Chars
8034 and then Chars (T) /= No_Name
8035 and then Get_Name_String (Chars (T)) = "valuetype";
8038 ---------------------
8039 -- Is_VMS_Operator --
8040 ---------------------
8042 function Is_VMS_Operator (Op : Entity_Id) return Boolean is
8044 -- The VMS operators are declared in a child of System that is loaded
8045 -- through pragma Extend_System. In some rare cases a program is run
8046 -- with this extension but without indicating that the target is VMS.
8048 return Ekind (Op) = E_Function
8049 and then Is_Intrinsic_Subprogram (Op)
8051 ((Present_System_Aux
8052 and then Scope (Op) = System_Aux_Id)
8055 and then Scope (Scope (Op)) = RTU_Entity (System)));
8056 end Is_VMS_Operator;
8062 function Is_Variable
8064 Use_Original_Node : Boolean := True) return Boolean
8066 Orig_Node : Node_Id;
8068 function In_Protected_Function (E : Entity_Id) return Boolean;
8069 -- Within a protected function, the private components of the enclosing
8070 -- protected type are constants. A function nested within a (protected)
8071 -- procedure is not itself protected.
8073 function Is_Variable_Prefix (P : Node_Id) return Boolean;
8074 -- Prefixes can involve implicit dereferences, in which case we must
8075 -- test for the case of a reference of a constant access type, which can
8076 -- can never be a variable.
8078 ---------------------------
8079 -- In_Protected_Function --
8080 ---------------------------
8082 function In_Protected_Function (E : Entity_Id) return Boolean is
8083 Prot : constant Entity_Id := Scope (E);
8087 if not Is_Protected_Type (Prot) then
8091 while Present (S) and then S /= Prot loop
8092 if Ekind (S) = E_Function and then Scope (S) = Prot then
8101 end In_Protected_Function;
8103 ------------------------
8104 -- Is_Variable_Prefix --
8105 ------------------------
8107 function Is_Variable_Prefix (P : Node_Id) return Boolean is
8109 if Is_Access_Type (Etype (P)) then
8110 return not Is_Access_Constant (Root_Type (Etype (P)));
8112 -- For the case of an indexed component whose prefix has a packed
8113 -- array type, the prefix has been rewritten into a type conversion.
8114 -- Determine variable-ness from the converted expression.
8116 elsif Nkind (P) = N_Type_Conversion
8117 and then not Comes_From_Source (P)
8118 and then Is_Array_Type (Etype (P))
8119 and then Is_Packed (Etype (P))
8121 return Is_Variable (Expression (P));
8124 return Is_Variable (P);
8126 end Is_Variable_Prefix;
8128 -- Start of processing for Is_Variable
8131 -- Check if we perform the test on the original node since this may be a
8132 -- test of syntactic categories which must not be disturbed by whatever
8133 -- rewriting might have occurred. For example, an aggregate, which is
8134 -- certainly NOT a variable, could be turned into a variable by
8137 if Use_Original_Node then
8138 Orig_Node := Original_Node (N);
8143 -- Definitely OK if Assignment_OK is set. Since this is something that
8144 -- only gets set for expanded nodes, the test is on N, not Orig_Node.
8146 if Nkind (N) in N_Subexpr and then Assignment_OK (N) then
8149 -- Normally we go to the original node, but there is one exception where
8150 -- we use the rewritten node, namely when it is an explicit dereference.
8151 -- The generated code may rewrite a prefix which is an access type with
8152 -- an explicit dereference. The dereference is a variable, even though
8153 -- the original node may not be (since it could be a constant of the
8156 -- In Ada 2005 we have a further case to consider: the prefix may be a
8157 -- function call given in prefix notation. The original node appears to
8158 -- be a selected component, but we need to examine the call.
8160 elsif Nkind (N) = N_Explicit_Dereference
8161 and then Nkind (Orig_Node) /= N_Explicit_Dereference
8162 and then Present (Etype (Orig_Node))
8163 and then Is_Access_Type (Etype (Orig_Node))
8165 -- Note that if the prefix is an explicit dereference that does not
8166 -- come from source, we must check for a rewritten function call in
8167 -- prefixed notation before other forms of rewriting, to prevent a
8171 (Nkind (Orig_Node) = N_Function_Call
8172 and then not Is_Access_Constant (Etype (Prefix (N))))
8174 Is_Variable_Prefix (Original_Node (Prefix (N)));
8176 -- A function call is never a variable
8178 elsif Nkind (N) = N_Function_Call then
8181 -- All remaining checks use the original node
8183 elsif Is_Entity_Name (Orig_Node)
8184 and then Present (Entity (Orig_Node))
8187 E : constant Entity_Id := Entity (Orig_Node);
8188 K : constant Entity_Kind := Ekind (E);
8191 return (K = E_Variable
8192 and then Nkind (Parent (E)) /= N_Exception_Handler)
8193 or else (K = E_Component
8194 and then not In_Protected_Function (E))
8195 or else K = E_Out_Parameter
8196 or else K = E_In_Out_Parameter
8197 or else K = E_Generic_In_Out_Parameter
8199 -- Current instance of type:
8201 or else (Is_Type (E) and then In_Open_Scopes (E))
8202 or else (Is_Incomplete_Or_Private_Type (E)
8203 and then In_Open_Scopes (Full_View (E)));
8207 case Nkind (Orig_Node) is
8208 when N_Indexed_Component | N_Slice =>
8209 return Is_Variable_Prefix (Prefix (Orig_Node));
8211 when N_Selected_Component =>
8212 return Is_Variable_Prefix (Prefix (Orig_Node))
8213 and then Is_Variable (Selector_Name (Orig_Node));
8215 -- For an explicit dereference, the type of the prefix cannot
8216 -- be an access to constant or an access to subprogram.
8218 when N_Explicit_Dereference =>
8220 Typ : constant Entity_Id := Etype (Prefix (Orig_Node));
8222 return Is_Access_Type (Typ)
8223 and then not Is_Access_Constant (Root_Type (Typ))
8224 and then Ekind (Typ) /= E_Access_Subprogram_Type;
8227 -- The type conversion is the case where we do not deal with the
8228 -- context dependent special case of an actual parameter. Thus
8229 -- the type conversion is only considered a variable for the
8230 -- purposes of this routine if the target type is tagged. However,
8231 -- a type conversion is considered to be a variable if it does not
8232 -- come from source (this deals for example with the conversions
8233 -- of expressions to their actual subtypes).
8235 when N_Type_Conversion =>
8236 return Is_Variable (Expression (Orig_Node))
8238 (not Comes_From_Source (Orig_Node)
8240 (Is_Tagged_Type (Etype (Subtype_Mark (Orig_Node)))
8242 Is_Tagged_Type (Etype (Expression (Orig_Node)))));
8244 -- GNAT allows an unchecked type conversion as a variable. This
8245 -- only affects the generation of internal expanded code, since
8246 -- calls to instantiations of Unchecked_Conversion are never
8247 -- considered variables (since they are function calls).
8248 -- This is also true for expression actions.
8250 when N_Unchecked_Type_Conversion =>
8251 return Is_Variable (Expression (Orig_Node));
8259 ---------------------------
8260 -- Is_Visibly_Controlled --
8261 ---------------------------
8263 function Is_Visibly_Controlled (T : Entity_Id) return Boolean is
8264 Root : constant Entity_Id := Root_Type (T);
8266 return Chars (Scope (Root)) = Name_Finalization
8267 and then Chars (Scope (Scope (Root))) = Name_Ada
8268 and then Scope (Scope (Scope (Root))) = Standard_Standard;
8269 end Is_Visibly_Controlled;
8271 ------------------------
8272 -- Is_Volatile_Object --
8273 ------------------------
8275 function Is_Volatile_Object (N : Node_Id) return Boolean is
8277 function Object_Has_Volatile_Components (N : Node_Id) return Boolean;
8278 -- Determines if given object has volatile components
8280 function Is_Volatile_Prefix (N : Node_Id) return Boolean;
8281 -- If prefix is an implicit dereference, examine designated type
8283 ------------------------
8284 -- Is_Volatile_Prefix --
8285 ------------------------
8287 function Is_Volatile_Prefix (N : Node_Id) return Boolean is
8288 Typ : constant Entity_Id := Etype (N);
8291 if Is_Access_Type (Typ) then
8293 Dtyp : constant Entity_Id := Designated_Type (Typ);
8296 return Is_Volatile (Dtyp)
8297 or else Has_Volatile_Components (Dtyp);
8301 return Object_Has_Volatile_Components (N);
8303 end Is_Volatile_Prefix;
8305 ------------------------------------
8306 -- Object_Has_Volatile_Components --
8307 ------------------------------------
8309 function Object_Has_Volatile_Components (N : Node_Id) return Boolean is
8310 Typ : constant Entity_Id := Etype (N);
8313 if Is_Volatile (Typ)
8314 or else Has_Volatile_Components (Typ)
8318 elsif Is_Entity_Name (N)
8319 and then (Has_Volatile_Components (Entity (N))
8320 or else Is_Volatile (Entity (N)))
8324 elsif Nkind (N) = N_Indexed_Component
8325 or else Nkind (N) = N_Selected_Component
8327 return Is_Volatile_Prefix (Prefix (N));
8332 end Object_Has_Volatile_Components;
8334 -- Start of processing for Is_Volatile_Object
8337 if Is_Volatile (Etype (N))
8338 or else (Is_Entity_Name (N) and then Is_Volatile (Entity (N)))
8342 elsif Nkind (N) = N_Indexed_Component
8343 or else Nkind (N) = N_Selected_Component
8345 return Is_Volatile_Prefix (Prefix (N));
8350 end Is_Volatile_Object;
8352 -------------------------
8353 -- Kill_Current_Values --
8354 -------------------------
8356 procedure Kill_Current_Values
8358 Last_Assignment_Only : Boolean := False)
8361 -- ??? do we have to worry about clearing cached checks?
8363 if Is_Assignable (Ent) then
8364 Set_Last_Assignment (Ent, Empty);
8367 if Is_Object (Ent) then
8368 if not Last_Assignment_Only then
8370 Set_Current_Value (Ent, Empty);
8372 if not Can_Never_Be_Null (Ent) then
8373 Set_Is_Known_Non_Null (Ent, False);
8376 Set_Is_Known_Null (Ent, False);
8378 -- Reset Is_Known_Valid unless type is always valid, or if we have
8379 -- a loop parameter (loop parameters are always valid, since their
8380 -- bounds are defined by the bounds given in the loop header).
8382 if not Is_Known_Valid (Etype (Ent))
8383 and then Ekind (Ent) /= E_Loop_Parameter
8385 Set_Is_Known_Valid (Ent, False);
8389 end Kill_Current_Values;
8391 procedure Kill_Current_Values (Last_Assignment_Only : Boolean := False) is
8394 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id);
8395 -- Clear current value for entity E and all entities chained to E
8397 ------------------------------------------
8398 -- Kill_Current_Values_For_Entity_Chain --
8399 ------------------------------------------
8401 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id) is
8405 while Present (Ent) loop
8406 Kill_Current_Values (Ent, Last_Assignment_Only);
8409 end Kill_Current_Values_For_Entity_Chain;
8411 -- Start of processing for Kill_Current_Values
8414 -- Kill all saved checks, a special case of killing saved values
8416 if not Last_Assignment_Only then
8420 -- Loop through relevant scopes, which includes the current scope and
8421 -- any parent scopes if the current scope is a block or a package.
8426 -- Clear current values of all entities in current scope
8428 Kill_Current_Values_For_Entity_Chain (First_Entity (S));
8430 -- If scope is a package, also clear current values of all
8431 -- private entities in the scope.
8433 if Is_Package_Or_Generic_Package (S)
8434 or else Is_Concurrent_Type (S)
8436 Kill_Current_Values_For_Entity_Chain (First_Private_Entity (S));
8439 -- If this is a not a subprogram, deal with parents
8441 if not Is_Subprogram (S) then
8443 exit Scope_Loop when S = Standard_Standard;
8447 end loop Scope_Loop;
8448 end Kill_Current_Values;
8450 --------------------------
8451 -- Kill_Size_Check_Code --
8452 --------------------------
8454 procedure Kill_Size_Check_Code (E : Entity_Id) is
8456 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
8457 and then Present (Size_Check_Code (E))
8459 Remove (Size_Check_Code (E));
8460 Set_Size_Check_Code (E, Empty);
8462 end Kill_Size_Check_Code;
8464 --------------------------
8465 -- Known_To_Be_Assigned --
8466 --------------------------
8468 function Known_To_Be_Assigned (N : Node_Id) return Boolean is
8469 P : constant Node_Id := Parent (N);
8474 -- Test left side of assignment
8476 when N_Assignment_Statement =>
8477 return N = Name (P);
8479 -- Function call arguments are never lvalues
8481 when N_Function_Call =>
8484 -- Positional parameter for procedure or accept call
8486 when N_Procedure_Call_Statement |
8495 Proc := Get_Subprogram_Entity (P);
8501 -- If we are not a list member, something is strange, so
8502 -- be conservative and return False.
8504 if not Is_List_Member (N) then
8508 -- We are going to find the right formal by stepping forward
8509 -- through the formals, as we step backwards in the actuals.
8511 Form := First_Formal (Proc);
8514 -- If no formal, something is weird, so be conservative
8515 -- and return False.
8526 return Ekind (Form) /= E_In_Parameter;
8529 -- Named parameter for procedure or accept call
8531 when N_Parameter_Association =>
8537 Proc := Get_Subprogram_Entity (Parent (P));
8543 -- Loop through formals to find the one that matches
8545 Form := First_Formal (Proc);
8547 -- If no matching formal, that's peculiar, some kind of
8548 -- previous error, so return False to be conservative.
8554 -- Else test for match
8556 if Chars (Form) = Chars (Selector_Name (P)) then
8557 return Ekind (Form) /= E_In_Parameter;
8564 -- Test for appearing in a conversion that itself appears
8565 -- in an lvalue context, since this should be an lvalue.
8567 when N_Type_Conversion =>
8568 return Known_To_Be_Assigned (P);
8570 -- All other references are definitely not known to be modifications
8576 end Known_To_Be_Assigned;
8578 ---------------------------
8579 -- Last_Source_Statement --
8580 ---------------------------
8582 function Last_Source_Statement (HSS : Node_Id) return Node_Id is
8586 N := Last (Statements (HSS));
8587 while Present (N) loop
8588 exit when Comes_From_Source (N);
8593 end Last_Source_Statement;
8595 ----------------------------------
8596 -- Matching_Static_Array_Bounds --
8597 ----------------------------------
8599 function Matching_Static_Array_Bounds
8601 R_Typ : Node_Id) return Boolean
8603 L_Ndims : constant Nat := Number_Dimensions (L_Typ);
8604 R_Ndims : constant Nat := Number_Dimensions (R_Typ);
8616 if L_Ndims /= R_Ndims then
8620 -- Unconstrained types do not have static bounds
8622 if not Is_Constrained (L_Typ) or else not Is_Constrained (R_Typ) then
8626 -- First treat specially the first dimension, as the lower bound and
8627 -- length of string literals are not stored like those of arrays.
8629 if Ekind (L_Typ) = E_String_Literal_Subtype then
8630 L_Low := String_Literal_Low_Bound (L_Typ);
8631 L_Len := String_Literal_Length (L_Typ);
8633 L_Index := First_Index (L_Typ);
8634 Get_Index_Bounds (L_Index, L_Low, L_High);
8636 if Is_OK_Static_Expression (L_Low)
8637 and then Is_OK_Static_Expression (L_High)
8639 if Expr_Value (L_High) < Expr_Value (L_Low) then
8642 L_Len := (Expr_Value (L_High) - Expr_Value (L_Low)) + 1;
8649 if Ekind (R_Typ) = E_String_Literal_Subtype then
8650 R_Low := String_Literal_Low_Bound (R_Typ);
8651 R_Len := String_Literal_Length (R_Typ);
8653 R_Index := First_Index (R_Typ);
8654 Get_Index_Bounds (R_Index, R_Low, R_High);
8656 if Is_OK_Static_Expression (R_Low)
8657 and then Is_OK_Static_Expression (R_High)
8659 if Expr_Value (R_High) < Expr_Value (R_Low) then
8662 R_Len := (Expr_Value (R_High) - Expr_Value (R_Low)) + 1;
8669 if Is_OK_Static_Expression (L_Low)
8670 and then Is_OK_Static_Expression (R_Low)
8671 and then Expr_Value (L_Low) = Expr_Value (R_Low)
8672 and then L_Len = R_Len
8679 -- Then treat all other dimensions
8681 for Indx in 2 .. L_Ndims loop
8685 Get_Index_Bounds (L_Index, L_Low, L_High);
8686 Get_Index_Bounds (R_Index, R_Low, R_High);
8688 if Is_OK_Static_Expression (L_Low)
8689 and then Is_OK_Static_Expression (L_High)
8690 and then Is_OK_Static_Expression (R_Low)
8691 and then Is_OK_Static_Expression (R_High)
8692 and then Expr_Value (L_Low) = Expr_Value (R_Low)
8693 and then Expr_Value (L_High) = Expr_Value (R_High)
8701 -- If we fall through the loop, all indexes matched
8704 end Matching_Static_Array_Bounds;
8710 function May_Be_Lvalue (N : Node_Id) return Boolean is
8711 P : constant Node_Id := Parent (N);
8716 -- Test left side of assignment
8718 when N_Assignment_Statement =>
8719 return N = Name (P);
8721 -- Test prefix of component or attribute. Note that the prefix of an
8722 -- explicit or implicit dereference cannot be an l-value.
8724 when N_Attribute_Reference =>
8725 return N = Prefix (P)
8726 and then Name_Implies_Lvalue_Prefix (Attribute_Name (P));
8728 -- For an expanded name, the name is an lvalue if the expanded name
8729 -- is an lvalue, but the prefix is never an lvalue, since it is just
8730 -- the scope where the name is found.
8732 when N_Expanded_Name =>
8733 if N = Prefix (P) then
8734 return May_Be_Lvalue (P);
8739 -- For a selected component A.B, A is certainly an lvalue if A.B is.
8740 -- B is a little interesting, if we have A.B := 3, there is some
8741 -- discussion as to whether B is an lvalue or not, we choose to say
8742 -- it is. Note however that A is not an lvalue if it is of an access
8743 -- type since this is an implicit dereference.
8745 when N_Selected_Component =>
8747 and then Present (Etype (N))
8748 and then Is_Access_Type (Etype (N))
8752 return May_Be_Lvalue (P);
8755 -- For an indexed component or slice, the index or slice bounds is
8756 -- never an lvalue. The prefix is an lvalue if the indexed component
8757 -- or slice is an lvalue, except if it is an access type, where we
8758 -- have an implicit dereference.
8760 when N_Indexed_Component =>
8762 or else (Present (Etype (N)) and then Is_Access_Type (Etype (N)))
8766 return May_Be_Lvalue (P);
8769 -- Prefix of a reference is an lvalue if the reference is an lvalue
8772 return May_Be_Lvalue (P);
8774 -- Prefix of explicit dereference is never an lvalue
8776 when N_Explicit_Dereference =>
8779 -- Positional parameter for subprogram, entry, or accept call.
8780 -- In older versions of Ada function call arguments are never
8781 -- lvalues. In Ada 2012 functions can have in-out parameters.
8783 when N_Function_Call |
8784 N_Procedure_Call_Statement |
8785 N_Entry_Call_Statement |
8788 if Nkind (P) = N_Function_Call
8789 and then Ada_Version < Ada_2012
8794 -- The following mechanism is clumsy and fragile. A single
8795 -- flag set in Resolve_Actuals would be preferable ???
8803 Proc := Get_Subprogram_Entity (P);
8809 -- If we are not a list member, something is strange, so
8810 -- be conservative and return True.
8812 if not Is_List_Member (N) then
8816 -- We are going to find the right formal by stepping forward
8817 -- through the formals, as we step backwards in the actuals.
8819 Form := First_Formal (Proc);
8822 -- If no formal, something is weird, so be conservative
8834 return Ekind (Form) /= E_In_Parameter;
8837 -- Named parameter for procedure or accept call
8839 when N_Parameter_Association =>
8845 Proc := Get_Subprogram_Entity (Parent (P));
8851 -- Loop through formals to find the one that matches
8853 Form := First_Formal (Proc);
8855 -- If no matching formal, that's peculiar, some kind of
8856 -- previous error, so return True to be conservative.
8862 -- Else test for match
8864 if Chars (Form) = Chars (Selector_Name (P)) then
8865 return Ekind (Form) /= E_In_Parameter;
8872 -- Test for appearing in a conversion that itself appears in an
8873 -- lvalue context, since this should be an lvalue.
8875 when N_Type_Conversion =>
8876 return May_Be_Lvalue (P);
8878 -- Test for appearance in object renaming declaration
8880 when N_Object_Renaming_Declaration =>
8883 -- All other references are definitely not lvalues
8891 -----------------------
8892 -- Mark_Coextensions --
8893 -----------------------
8895 procedure Mark_Coextensions (Context_Nod : Node_Id; Root_Nod : Node_Id) is
8896 Is_Dynamic : Boolean;
8897 -- Indicates whether the context causes nested coextensions to be
8898 -- dynamic or static
8900 function Mark_Allocator (N : Node_Id) return Traverse_Result;
8901 -- Recognize an allocator node and label it as a dynamic coextension
8903 --------------------
8904 -- Mark_Allocator --
8905 --------------------
8907 function Mark_Allocator (N : Node_Id) return Traverse_Result is
8909 if Nkind (N) = N_Allocator then
8911 Set_Is_Dynamic_Coextension (N);
8913 -- If the allocator expression is potentially dynamic, it may
8914 -- be expanded out of order and require dynamic allocation
8915 -- anyway, so we treat the coextension itself as dynamic.
8916 -- Potential optimization ???
8918 elsif Nkind (Expression (N)) = N_Qualified_Expression
8919 and then Nkind (Expression (Expression (N))) = N_Op_Concat
8921 Set_Is_Dynamic_Coextension (N);
8924 Set_Is_Static_Coextension (N);
8931 procedure Mark_Allocators is new Traverse_Proc (Mark_Allocator);
8933 -- Start of processing Mark_Coextensions
8936 case Nkind (Context_Nod) is
8937 when N_Assignment_Statement |
8938 N_Simple_Return_Statement =>
8939 Is_Dynamic := Nkind (Expression (Context_Nod)) = N_Allocator;
8941 when N_Object_Declaration =>
8942 Is_Dynamic := Nkind (Root_Nod) = N_Allocator;
8944 -- This routine should not be called for constructs which may not
8945 -- contain coextensions.
8948 raise Program_Error;
8951 Mark_Allocators (Root_Nod);
8952 end Mark_Coextensions;
8954 ----------------------
8955 -- Needs_One_Actual --
8956 ----------------------
8958 function Needs_One_Actual (E : Entity_Id) return Boolean is
8962 if Ada_Version >= Ada_2005
8963 and then Present (First_Formal (E))
8965 Formal := Next_Formal (First_Formal (E));
8966 while Present (Formal) loop
8967 if No (Default_Value (Formal)) then
8971 Next_Formal (Formal);
8979 end Needs_One_Actual;
8981 ------------------------
8982 -- New_Copy_List_Tree --
8983 ------------------------
8985 function New_Copy_List_Tree (List : List_Id) return List_Id is
8990 if List = No_List then
8997 while Present (E) loop
8998 Append (New_Copy_Tree (E), NL);
9004 end New_Copy_List_Tree;
9010 use Atree.Unchecked_Access;
9011 use Atree_Private_Part;
9013 -- Our approach here requires a two pass traversal of the tree. The
9014 -- first pass visits all nodes that eventually will be copied looking
9015 -- for defining Itypes. If any defining Itypes are found, then they are
9016 -- copied, and an entry is added to the replacement map. In the second
9017 -- phase, the tree is copied, using the replacement map to replace any
9018 -- Itype references within the copied tree.
9020 -- The following hash tables are used if the Map supplied has more
9021 -- than hash threshold entries to speed up access to the map. If
9022 -- there are fewer entries, then the map is searched sequentially
9023 -- (because setting up a hash table for only a few entries takes
9024 -- more time than it saves.
9026 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
9027 -- Hash function used for hash operations
9033 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
9035 return Nat (E) mod (NCT_Header_Num'Last + 1);
9042 -- The hash table NCT_Assoc associates old entities in the table
9043 -- with their corresponding new entities (i.e. the pairs of entries
9044 -- presented in the original Map argument are Key-Element pairs).
9046 package NCT_Assoc is new Simple_HTable (
9047 Header_Num => NCT_Header_Num,
9048 Element => Entity_Id,
9049 No_Element => Empty,
9051 Hash => New_Copy_Hash,
9052 Equal => Types."=");
9054 ---------------------
9055 -- NCT_Itype_Assoc --
9056 ---------------------
9058 -- The hash table NCT_Itype_Assoc contains entries only for those
9059 -- old nodes which have a non-empty Associated_Node_For_Itype set.
9060 -- The key is the associated node, and the element is the new node
9061 -- itself (NOT the associated node for the new node).
9063 package NCT_Itype_Assoc is new Simple_HTable (
9064 Header_Num => NCT_Header_Num,
9065 Element => Entity_Id,
9066 No_Element => Empty,
9068 Hash => New_Copy_Hash,
9069 Equal => Types."=");
9071 -- Start of processing for New_Copy_Tree function
9073 function New_Copy_Tree
9075 Map : Elist_Id := No_Elist;
9076 New_Sloc : Source_Ptr := No_Location;
9077 New_Scope : Entity_Id := Empty) return Node_Id
9079 Actual_Map : Elist_Id := Map;
9080 -- This is the actual map for the copy. It is initialized with the
9081 -- given elements, and then enlarged as required for Itypes that are
9082 -- copied during the first phase of the copy operation. The visit
9083 -- procedures add elements to this map as Itypes are encountered.
9084 -- The reason we cannot use Map directly, is that it may well be
9085 -- (and normally is) initialized to No_Elist, and if we have mapped
9086 -- entities, we have to reset it to point to a real Elist.
9088 function Assoc (N : Node_Or_Entity_Id) return Node_Id;
9089 -- Called during second phase to map entities into their corresponding
9090 -- copies using Actual_Map. If the argument is not an entity, or is not
9091 -- in Actual_Map, then it is returned unchanged.
9093 procedure Build_NCT_Hash_Tables;
9094 -- Builds hash tables (number of elements >= threshold value)
9096 function Copy_Elist_With_Replacement
9097 (Old_Elist : Elist_Id) return Elist_Id;
9098 -- Called during second phase to copy element list doing replacements
9100 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
9101 -- Called during the second phase to process a copied Itype. The actual
9102 -- copy happened during the first phase (so that we could make the entry
9103 -- in the mapping), but we still have to deal with the descendents of
9104 -- the copied Itype and copy them where necessary.
9106 function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
9107 -- Called during second phase to copy list doing replacements
9109 function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
9110 -- Called during second phase to copy node doing replacements
9112 procedure Visit_Elist (E : Elist_Id);
9113 -- Called during first phase to visit all elements of an Elist
9115 procedure Visit_Field (F : Union_Id; N : Node_Id);
9116 -- Visit a single field, recursing to call Visit_Node or Visit_List
9117 -- if the field is a syntactic descendent of the current node (i.e.
9118 -- its parent is Node N).
9120 procedure Visit_Itype (Old_Itype : Entity_Id);
9121 -- Called during first phase to visit subsidiary fields of a defining
9122 -- Itype, and also create a copy and make an entry in the replacement
9123 -- map for the new copy.
9125 procedure Visit_List (L : List_Id);
9126 -- Called during first phase to visit all elements of a List
9128 procedure Visit_Node (N : Node_Or_Entity_Id);
9129 -- Called during first phase to visit a node and all its subtrees
9135 function Assoc (N : Node_Or_Entity_Id) return Node_Id is
9140 if not Has_Extension (N) or else No (Actual_Map) then
9143 elsif NCT_Hash_Tables_Used then
9144 Ent := NCT_Assoc.Get (Entity_Id (N));
9146 if Present (Ent) then
9152 -- No hash table used, do serial search
9155 E := First_Elmt (Actual_Map);
9156 while Present (E) loop
9157 if Node (E) = N then
9158 return Node (Next_Elmt (E));
9160 E := Next_Elmt (Next_Elmt (E));
9168 ---------------------------
9169 -- Build_NCT_Hash_Tables --
9170 ---------------------------
9172 procedure Build_NCT_Hash_Tables is
9176 if NCT_Hash_Table_Setup then
9178 NCT_Itype_Assoc.Reset;
9181 Elmt := First_Elmt (Actual_Map);
9182 while Present (Elmt) loop
9185 -- Get new entity, and associate old and new
9188 NCT_Assoc.Set (Ent, Node (Elmt));
9190 if Is_Type (Ent) then
9192 Anode : constant Entity_Id :=
9193 Associated_Node_For_Itype (Ent);
9196 if Present (Anode) then
9198 -- Enter a link between the associated node of the
9199 -- old Itype and the new Itype, for updating later
9200 -- when node is copied.
9202 NCT_Itype_Assoc.Set (Anode, Node (Elmt));
9210 NCT_Hash_Tables_Used := True;
9211 NCT_Hash_Table_Setup := True;
9212 end Build_NCT_Hash_Tables;
9214 ---------------------------------
9215 -- Copy_Elist_With_Replacement --
9216 ---------------------------------
9218 function Copy_Elist_With_Replacement
9219 (Old_Elist : Elist_Id) return Elist_Id
9222 New_Elist : Elist_Id;
9225 if No (Old_Elist) then
9229 New_Elist := New_Elmt_List;
9231 M := First_Elmt (Old_Elist);
9232 while Present (M) loop
9233 Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
9239 end Copy_Elist_With_Replacement;
9241 ---------------------------------
9242 -- Copy_Itype_With_Replacement --
9243 ---------------------------------
9245 -- This routine exactly parallels its phase one analog Visit_Itype,
9247 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
9249 -- Translate Next_Entity, Scope and Etype fields, in case they
9250 -- reference entities that have been mapped into copies.
9252 Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
9253 Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
9255 if Present (New_Scope) then
9256 Set_Scope (New_Itype, New_Scope);
9258 Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
9261 -- Copy referenced fields
9263 if Is_Discrete_Type (New_Itype) then
9264 Set_Scalar_Range (New_Itype,
9265 Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
9267 elsif Has_Discriminants (Base_Type (New_Itype)) then
9268 Set_Discriminant_Constraint (New_Itype,
9269 Copy_Elist_With_Replacement
9270 (Discriminant_Constraint (New_Itype)));
9272 elsif Is_Array_Type (New_Itype) then
9273 if Present (First_Index (New_Itype)) then
9274 Set_First_Index (New_Itype,
9275 First (Copy_List_With_Replacement
9276 (List_Containing (First_Index (New_Itype)))));
9279 if Is_Packed (New_Itype) then
9280 Set_Packed_Array_Type (New_Itype,
9281 Copy_Node_With_Replacement
9282 (Packed_Array_Type (New_Itype)));
9285 end Copy_Itype_With_Replacement;
9287 --------------------------------
9288 -- Copy_List_With_Replacement --
9289 --------------------------------
9291 function Copy_List_With_Replacement
9292 (Old_List : List_Id) return List_Id
9298 if Old_List = No_List then
9302 New_List := Empty_List;
9304 E := First (Old_List);
9305 while Present (E) loop
9306 Append (Copy_Node_With_Replacement (E), New_List);
9312 end Copy_List_With_Replacement;
9314 --------------------------------
9315 -- Copy_Node_With_Replacement --
9316 --------------------------------
9318 function Copy_Node_With_Replacement
9319 (Old_Node : Node_Id) return Node_Id
9323 procedure Adjust_Named_Associations
9324 (Old_Node : Node_Id;
9325 New_Node : Node_Id);
9326 -- If a call node has named associations, these are chained through
9327 -- the First_Named_Actual, Next_Named_Actual links. These must be
9328 -- propagated separately to the new parameter list, because these
9329 -- are not syntactic fields.
9331 function Copy_Field_With_Replacement
9332 (Field : Union_Id) return Union_Id;
9333 -- Given Field, which is a field of Old_Node, return a copy of it
9334 -- if it is a syntactic field (i.e. its parent is Node), setting
9335 -- the parent of the copy to poit to New_Node. Otherwise returns
9336 -- the field (possibly mapped if it is an entity).
9338 -------------------------------
9339 -- Adjust_Named_Associations --
9340 -------------------------------
9342 procedure Adjust_Named_Associations
9343 (Old_Node : Node_Id;
9353 Old_E := First (Parameter_Associations (Old_Node));
9354 New_E := First (Parameter_Associations (New_Node));
9355 while Present (Old_E) loop
9356 if Nkind (Old_E) = N_Parameter_Association
9357 and then Present (Next_Named_Actual (Old_E))
9359 if First_Named_Actual (Old_Node)
9360 = Explicit_Actual_Parameter (Old_E)
9362 Set_First_Named_Actual
9363 (New_Node, Explicit_Actual_Parameter (New_E));
9366 -- Now scan parameter list from the beginning,to locate
9367 -- next named actual, which can be out of order.
9369 Old_Next := First (Parameter_Associations (Old_Node));
9370 New_Next := First (Parameter_Associations (New_Node));
9372 while Nkind (Old_Next) /= N_Parameter_Association
9373 or else Explicit_Actual_Parameter (Old_Next)
9374 /= Next_Named_Actual (Old_E)
9380 Set_Next_Named_Actual
9381 (New_E, Explicit_Actual_Parameter (New_Next));
9387 end Adjust_Named_Associations;
9389 ---------------------------------
9390 -- Copy_Field_With_Replacement --
9391 ---------------------------------
9393 function Copy_Field_With_Replacement
9394 (Field : Union_Id) return Union_Id
9397 if Field = Union_Id (Empty) then
9400 elsif Field in Node_Range then
9402 Old_N : constant Node_Id := Node_Id (Field);
9406 -- If syntactic field, as indicated by the parent pointer
9407 -- being set, then copy the referenced node recursively.
9409 if Parent (Old_N) = Old_Node then
9410 New_N := Copy_Node_With_Replacement (Old_N);
9412 if New_N /= Old_N then
9413 Set_Parent (New_N, New_Node);
9416 -- For semantic fields, update possible entity reference
9417 -- from the replacement map.
9420 New_N := Assoc (Old_N);
9423 return Union_Id (New_N);
9426 elsif Field in List_Range then
9428 Old_L : constant List_Id := List_Id (Field);
9432 -- If syntactic field, as indicated by the parent pointer,
9433 -- then recursively copy the entire referenced list.
9435 if Parent (Old_L) = Old_Node then
9436 New_L := Copy_List_With_Replacement (Old_L);
9437 Set_Parent (New_L, New_Node);
9439 -- For semantic list, just returned unchanged
9445 return Union_Id (New_L);
9448 -- Anything other than a list or a node is returned unchanged
9453 end Copy_Field_With_Replacement;
9455 -- Start of processing for Copy_Node_With_Replacement
9458 if Old_Node <= Empty_Or_Error then
9461 elsif Has_Extension (Old_Node) then
9462 return Assoc (Old_Node);
9465 New_Node := New_Copy (Old_Node);
9467 -- If the node we are copying is the associated node of a
9468 -- previously copied Itype, then adjust the associated node
9469 -- of the copy of that Itype accordingly.
9471 if Present (Actual_Map) then
9477 -- Case of hash table used
9479 if NCT_Hash_Tables_Used then
9480 Ent := NCT_Itype_Assoc.Get (Old_Node);
9482 if Present (Ent) then
9483 Set_Associated_Node_For_Itype (Ent, New_Node);
9486 -- Case of no hash table used
9489 E := First_Elmt (Actual_Map);
9490 while Present (E) loop
9491 if Is_Itype (Node (E))
9493 Old_Node = Associated_Node_For_Itype (Node (E))
9495 Set_Associated_Node_For_Itype
9496 (Node (Next_Elmt (E)), New_Node);
9499 E := Next_Elmt (Next_Elmt (E));
9505 -- Recursively copy descendents
9508 (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
9510 (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
9512 (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
9514 (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
9516 (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
9518 -- Adjust Sloc of new node if necessary
9520 if New_Sloc /= No_Location then
9521 Set_Sloc (New_Node, New_Sloc);
9523 -- If we adjust the Sloc, then we are essentially making
9524 -- a completely new node, so the Comes_From_Source flag
9525 -- should be reset to the proper default value.
9527 Nodes.Table (New_Node).Comes_From_Source :=
9528 Default_Node.Comes_From_Source;
9531 -- If the node is call and has named associations,
9532 -- set the corresponding links in the copy.
9534 if (Nkind (Old_Node) = N_Function_Call
9535 or else Nkind (Old_Node) = N_Entry_Call_Statement
9537 Nkind (Old_Node) = N_Procedure_Call_Statement)
9538 and then Present (First_Named_Actual (Old_Node))
9540 Adjust_Named_Associations (Old_Node, New_Node);
9543 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
9544 -- The replacement mechanism applies to entities, and is not used
9545 -- here. Eventually we may need a more general graph-copying
9546 -- routine. For now, do a sequential search to find desired node.
9548 if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
9549 and then Present (First_Real_Statement (Old_Node))
9552 Old_F : constant Node_Id := First_Real_Statement (Old_Node);
9556 N1 := First (Statements (Old_Node));
9557 N2 := First (Statements (New_Node));
9559 while N1 /= Old_F loop
9564 Set_First_Real_Statement (New_Node, N2);
9569 -- All done, return copied node
9572 end Copy_Node_With_Replacement;
9578 procedure Visit_Elist (E : Elist_Id) is
9582 Elmt := First_Elmt (E);
9584 while Elmt /= No_Elmt loop
9585 Visit_Node (Node (Elmt));
9595 procedure Visit_Field (F : Union_Id; N : Node_Id) is
9597 if F = Union_Id (Empty) then
9600 elsif F in Node_Range then
9602 -- Copy node if it is syntactic, i.e. its parent pointer is
9603 -- set to point to the field that referenced it (certain
9604 -- Itypes will also meet this criterion, which is fine, since
9605 -- these are clearly Itypes that do need to be copied, since
9606 -- we are copying their parent.)
9608 if Parent (Node_Id (F)) = N then
9609 Visit_Node (Node_Id (F));
9612 -- Another case, if we are pointing to an Itype, then we want
9613 -- to copy it if its associated node is somewhere in the tree
9616 -- Note: the exclusion of self-referential copies is just an
9617 -- optimization, since the search of the already copied list
9618 -- would catch it, but it is a common case (Etype pointing
9619 -- to itself for an Itype that is a base type).
9621 elsif Has_Extension (Node_Id (F))
9622 and then Is_Itype (Entity_Id (F))
9623 and then Node_Id (F) /= N
9629 P := Associated_Node_For_Itype (Node_Id (F));
9630 while Present (P) loop
9632 Visit_Node (Node_Id (F));
9639 -- An Itype whose parent is not being copied definitely
9640 -- should NOT be copied, since it does not belong in any
9641 -- sense to the copied subtree.
9647 elsif F in List_Range
9648 and then Parent (List_Id (F)) = N
9650 Visit_List (List_Id (F));
9659 procedure Visit_Itype (Old_Itype : Entity_Id) is
9660 New_Itype : Entity_Id;
9665 -- Itypes that describe the designated type of access to subprograms
9666 -- have the structure of subprogram declarations, with signatures,
9667 -- etc. Either we duplicate the signatures completely, or choose to
9668 -- share such itypes, which is fine because their elaboration will
9669 -- have no side effects.
9671 if Ekind (Old_Itype) = E_Subprogram_Type then
9675 New_Itype := New_Copy (Old_Itype);
9677 -- The new Itype has all the attributes of the old one, and
9678 -- we just copy the contents of the entity. However, the back-end
9679 -- needs different names for debugging purposes, so we create a
9680 -- new internal name for it in all cases.
9682 Set_Chars (New_Itype, New_Internal_Name ('T'));
9684 -- If our associated node is an entity that has already been copied,
9685 -- then set the associated node of the copy to point to the right
9686 -- copy. If we have copied an Itype that is itself the associated
9687 -- node of some previously copied Itype, then we set the right
9688 -- pointer in the other direction.
9690 if Present (Actual_Map) then
9692 -- Case of hash tables used
9694 if NCT_Hash_Tables_Used then
9696 Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
9698 if Present (Ent) then
9699 Set_Associated_Node_For_Itype (New_Itype, Ent);
9702 Ent := NCT_Itype_Assoc.Get (Old_Itype);
9703 if Present (Ent) then
9704 Set_Associated_Node_For_Itype (Ent, New_Itype);
9706 -- If the hash table has no association for this Itype and
9707 -- its associated node, enter one now.
9711 (Associated_Node_For_Itype (Old_Itype), New_Itype);
9714 -- Case of hash tables not used
9717 E := First_Elmt (Actual_Map);
9718 while Present (E) loop
9719 if Associated_Node_For_Itype (Old_Itype) = Node (E) then
9720 Set_Associated_Node_For_Itype
9721 (New_Itype, Node (Next_Elmt (E)));
9724 if Is_Type (Node (E))
9726 Old_Itype = Associated_Node_For_Itype (Node (E))
9728 Set_Associated_Node_For_Itype
9729 (Node (Next_Elmt (E)), New_Itype);
9732 E := Next_Elmt (Next_Elmt (E));
9737 if Present (Freeze_Node (New_Itype)) then
9738 Set_Is_Frozen (New_Itype, False);
9739 Set_Freeze_Node (New_Itype, Empty);
9742 -- Add new association to map
9744 if No (Actual_Map) then
9745 Actual_Map := New_Elmt_List;
9748 Append_Elmt (Old_Itype, Actual_Map);
9749 Append_Elmt (New_Itype, Actual_Map);
9751 if NCT_Hash_Tables_Used then
9752 NCT_Assoc.Set (Old_Itype, New_Itype);
9755 NCT_Table_Entries := NCT_Table_Entries + 1;
9757 if NCT_Table_Entries > NCT_Hash_Threshold then
9758 Build_NCT_Hash_Tables;
9762 -- If a record subtype is simply copied, the entity list will be
9763 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
9765 if Ekind_In (Old_Itype, E_Record_Subtype, E_Class_Wide_Subtype) then
9766 Set_Cloned_Subtype (New_Itype, Old_Itype);
9769 -- Visit descendents that eventually get copied
9771 Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
9773 if Is_Discrete_Type (Old_Itype) then
9774 Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
9776 elsif Has_Discriminants (Base_Type (Old_Itype)) then
9777 -- ??? This should involve call to Visit_Field
9778 Visit_Elist (Discriminant_Constraint (Old_Itype));
9780 elsif Is_Array_Type (Old_Itype) then
9781 if Present (First_Index (Old_Itype)) then
9782 Visit_Field (Union_Id (List_Containing
9783 (First_Index (Old_Itype))),
9787 if Is_Packed (Old_Itype) then
9788 Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)),
9798 procedure Visit_List (L : List_Id) is
9801 if L /= No_List then
9804 while Present (N) loop
9815 procedure Visit_Node (N : Node_Or_Entity_Id) is
9817 -- Start of processing for Visit_Node
9820 -- Handle case of an Itype, which must be copied
9822 if Has_Extension (N)
9823 and then Is_Itype (N)
9825 -- Nothing to do if already in the list. This can happen with an
9826 -- Itype entity that appears more than once in the tree.
9827 -- Note that we do not want to visit descendents in this case.
9829 -- Test for already in list when hash table is used
9831 if NCT_Hash_Tables_Used then
9832 if Present (NCT_Assoc.Get (Entity_Id (N))) then
9836 -- Test for already in list when hash table not used
9842 if Present (Actual_Map) then
9843 E := First_Elmt (Actual_Map);
9844 while Present (E) loop
9845 if Node (E) = N then
9848 E := Next_Elmt (Next_Elmt (E));
9858 -- Visit descendents
9860 Visit_Field (Field1 (N), N);
9861 Visit_Field (Field2 (N), N);
9862 Visit_Field (Field3 (N), N);
9863 Visit_Field (Field4 (N), N);
9864 Visit_Field (Field5 (N), N);
9867 -- Start of processing for New_Copy_Tree
9872 -- See if we should use hash table
9874 if No (Actual_Map) then
9875 NCT_Hash_Tables_Used := False;
9882 NCT_Table_Entries := 0;
9884 Elmt := First_Elmt (Actual_Map);
9885 while Present (Elmt) loop
9886 NCT_Table_Entries := NCT_Table_Entries + 1;
9891 if NCT_Table_Entries > NCT_Hash_Threshold then
9892 Build_NCT_Hash_Tables;
9894 NCT_Hash_Tables_Used := False;
9899 -- Hash table set up if required, now start phase one by visiting
9900 -- top node (we will recursively visit the descendents).
9902 Visit_Node (Source);
9904 -- Now the second phase of the copy can start. First we process
9905 -- all the mapped entities, copying their descendents.
9907 if Present (Actual_Map) then
9910 New_Itype : Entity_Id;
9912 Elmt := First_Elmt (Actual_Map);
9913 while Present (Elmt) loop
9915 New_Itype := Node (Elmt);
9916 Copy_Itype_With_Replacement (New_Itype);
9922 -- Now we can copy the actual tree
9924 return Copy_Node_With_Replacement (Source);
9927 -------------------------
9928 -- New_External_Entity --
9929 -------------------------
9931 function New_External_Entity
9932 (Kind : Entity_Kind;
9933 Scope_Id : Entity_Id;
9934 Sloc_Value : Source_Ptr;
9935 Related_Id : Entity_Id;
9937 Suffix_Index : Nat := 0;
9938 Prefix : Character := ' ') return Entity_Id
9940 N : constant Entity_Id :=
9941 Make_Defining_Identifier (Sloc_Value,
9943 (Chars (Related_Id), Suffix, Suffix_Index, Prefix));
9946 Set_Ekind (N, Kind);
9947 Set_Is_Internal (N, True);
9948 Append_Entity (N, Scope_Id);
9949 Set_Public_Status (N);
9951 if Kind in Type_Kind then
9952 Init_Size_Align (N);
9956 end New_External_Entity;
9958 -------------------------
9959 -- New_Internal_Entity --
9960 -------------------------
9962 function New_Internal_Entity
9963 (Kind : Entity_Kind;
9964 Scope_Id : Entity_Id;
9965 Sloc_Value : Source_Ptr;
9966 Id_Char : Character) return Entity_Id
9968 N : constant Entity_Id := Make_Temporary (Sloc_Value, Id_Char);
9971 Set_Ekind (N, Kind);
9972 Set_Is_Internal (N, True);
9973 Append_Entity (N, Scope_Id);
9975 if Kind in Type_Kind then
9976 Init_Size_Align (N);
9980 end New_Internal_Entity;
9986 function Next_Actual (Actual_Id : Node_Id) return Node_Id is
9990 -- If we are pointing at a positional parameter, it is a member of a
9991 -- node list (the list of parameters), and the next parameter is the
9992 -- next node on the list, unless we hit a parameter association, then
9993 -- we shift to using the chain whose head is the First_Named_Actual in
9994 -- the parent, and then is threaded using the Next_Named_Actual of the
9995 -- Parameter_Association. All this fiddling is because the original node
9996 -- list is in the textual call order, and what we need is the
9997 -- declaration order.
9999 if Is_List_Member (Actual_Id) then
10000 N := Next (Actual_Id);
10002 if Nkind (N) = N_Parameter_Association then
10003 return First_Named_Actual (Parent (Actual_Id));
10009 return Next_Named_Actual (Parent (Actual_Id));
10013 procedure Next_Actual (Actual_Id : in out Node_Id) is
10015 Actual_Id := Next_Actual (Actual_Id);
10018 -----------------------
10019 -- Normalize_Actuals --
10020 -----------------------
10022 -- Chain actuals according to formals of subprogram. If there are no named
10023 -- associations, the chain is simply the list of Parameter Associations,
10024 -- since the order is the same as the declaration order. If there are named
10025 -- associations, then the First_Named_Actual field in the N_Function_Call
10026 -- or N_Procedure_Call_Statement node points to the Parameter_Association
10027 -- node for the parameter that comes first in declaration order. The
10028 -- remaining named parameters are then chained in declaration order using
10029 -- Next_Named_Actual.
10031 -- This routine also verifies that the number of actuals is compatible with
10032 -- the number and default values of formals, but performs no type checking
10033 -- (type checking is done by the caller).
10035 -- If the matching succeeds, Success is set to True and the caller proceeds
10036 -- with type-checking. If the match is unsuccessful, then Success is set to
10037 -- False, and the caller attempts a different interpretation, if there is
10040 -- If the flag Report is on, the call is not overloaded, and a failure to
10041 -- match can be reported here, rather than in the caller.
10043 procedure Normalize_Actuals
10047 Success : out Boolean)
10049 Actuals : constant List_Id := Parameter_Associations (N);
10050 Actual : Node_Id := Empty;
10051 Formal : Entity_Id;
10052 Last : Node_Id := Empty;
10053 First_Named : Node_Id := Empty;
10056 Formals_To_Match : Integer := 0;
10057 Actuals_To_Match : Integer := 0;
10059 procedure Chain (A : Node_Id);
10060 -- Add named actual at the proper place in the list, using the
10061 -- Next_Named_Actual link.
10063 function Reporting return Boolean;
10064 -- Determines if an error is to be reported. To report an error, we
10065 -- need Report to be True, and also we do not report errors caused
10066 -- by calls to init procs that occur within other init procs. Such
10067 -- errors must always be cascaded errors, since if all the types are
10068 -- declared correctly, the compiler will certainly build decent calls!
10074 procedure Chain (A : Node_Id) is
10078 -- Call node points to first actual in list
10080 Set_First_Named_Actual (N, Explicit_Actual_Parameter (A));
10083 Set_Next_Named_Actual (Last, Explicit_Actual_Parameter (A));
10087 Set_Next_Named_Actual (Last, Empty);
10094 function Reporting return Boolean is
10099 elsif not Within_Init_Proc then
10102 elsif Is_Init_Proc (Entity (Name (N))) then
10110 -- Start of processing for Normalize_Actuals
10113 if Is_Access_Type (S) then
10115 -- The name in the call is a function call that returns an access
10116 -- to subprogram. The designated type has the list of formals.
10118 Formal := First_Formal (Designated_Type (S));
10120 Formal := First_Formal (S);
10123 while Present (Formal) loop
10124 Formals_To_Match := Formals_To_Match + 1;
10125 Next_Formal (Formal);
10128 -- Find if there is a named association, and verify that no positional
10129 -- associations appear after named ones.
10131 if Present (Actuals) then
10132 Actual := First (Actuals);
10135 while Present (Actual)
10136 and then Nkind (Actual) /= N_Parameter_Association
10138 Actuals_To_Match := Actuals_To_Match + 1;
10142 if No (Actual) and Actuals_To_Match = Formals_To_Match then
10144 -- Most common case: positional notation, no defaults
10149 elsif Actuals_To_Match > Formals_To_Match then
10151 -- Too many actuals: will not work
10154 if Is_Entity_Name (Name (N)) then
10155 Error_Msg_N ("too many arguments in call to&", Name (N));
10157 Error_Msg_N ("too many arguments in call", N);
10165 First_Named := Actual;
10167 while Present (Actual) loop
10168 if Nkind (Actual) /= N_Parameter_Association then
10170 ("positional parameters not allowed after named ones", Actual);
10175 Actuals_To_Match := Actuals_To_Match + 1;
10181 if Present (Actuals) then
10182 Actual := First (Actuals);
10185 Formal := First_Formal (S);
10186 while Present (Formal) loop
10188 -- Match the formals in order. If the corresponding actual is
10189 -- positional, nothing to do. Else scan the list of named actuals
10190 -- to find the one with the right name.
10192 if Present (Actual)
10193 and then Nkind (Actual) /= N_Parameter_Association
10196 Actuals_To_Match := Actuals_To_Match - 1;
10197 Formals_To_Match := Formals_To_Match - 1;
10200 -- For named parameters, search the list of actuals to find
10201 -- one that matches the next formal name.
10203 Actual := First_Named;
10205 while Present (Actual) loop
10206 if Chars (Selector_Name (Actual)) = Chars (Formal) then
10209 Actuals_To_Match := Actuals_To_Match - 1;
10210 Formals_To_Match := Formals_To_Match - 1;
10218 if Ekind (Formal) /= E_In_Parameter
10219 or else No (Default_Value (Formal))
10222 if (Comes_From_Source (S)
10223 or else Sloc (S) = Standard_Location)
10224 and then Is_Overloadable (S)
10228 (Nkind (Parent (N)) = N_Procedure_Call_Statement
10230 (Nkind (Parent (N)) = N_Function_Call
10232 Nkind (Parent (N)) = N_Parameter_Association))
10233 and then Ekind (S) /= E_Function
10235 Set_Etype (N, Etype (S));
10237 Error_Msg_Name_1 := Chars (S);
10238 Error_Msg_Sloc := Sloc (S);
10240 ("missing argument for parameter & " &
10241 "in call to % declared #", N, Formal);
10244 elsif Is_Overloadable (S) then
10245 Error_Msg_Name_1 := Chars (S);
10247 -- Point to type derivation that generated the
10250 Error_Msg_Sloc := Sloc (Parent (S));
10253 ("missing argument for parameter & " &
10254 "in call to % (inherited) #", N, Formal);
10258 ("missing argument for parameter &", N, Formal);
10266 Formals_To_Match := Formals_To_Match - 1;
10271 Next_Formal (Formal);
10274 if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
10281 -- Find some superfluous named actual that did not get
10282 -- attached to the list of associations.
10284 Actual := First (Actuals);
10285 while Present (Actual) loop
10286 if Nkind (Actual) = N_Parameter_Association
10287 and then Actual /= Last
10288 and then No (Next_Named_Actual (Actual))
10290 Error_Msg_N ("unmatched actual & in call",
10291 Selector_Name (Actual));
10302 end Normalize_Actuals;
10304 --------------------------------
10305 -- Note_Possible_Modification --
10306 --------------------------------
10308 procedure Note_Possible_Modification (N : Node_Id; Sure : Boolean) is
10309 Modification_Comes_From_Source : constant Boolean :=
10310 Comes_From_Source (Parent (N));
10316 -- Loop to find referenced entity, if there is one
10323 if Is_Entity_Name (Exp) then
10324 Ent := Entity (Exp);
10326 -- If the entity is missing, it is an undeclared identifier,
10327 -- and there is nothing to annotate.
10333 elsif Nkind (Exp) = N_Explicit_Dereference then
10335 P : constant Node_Id := Prefix (Exp);
10338 if Nkind (P) = N_Selected_Component
10340 Entry_Formal (Entity (Selector_Name (P))))
10342 -- Case of a reference to an entry formal
10344 Ent := Entry_Formal (Entity (Selector_Name (P)));
10346 elsif Nkind (P) = N_Identifier
10347 and then Nkind (Parent (Entity (P))) = N_Object_Declaration
10348 and then Present (Expression (Parent (Entity (P))))
10349 and then Nkind (Expression (Parent (Entity (P))))
10352 -- Case of a reference to a value on which side effects have
10355 Exp := Prefix (Expression (Parent (Entity (P))));
10364 elsif Nkind (Exp) = N_Type_Conversion
10365 or else Nkind (Exp) = N_Unchecked_Type_Conversion
10367 Exp := Expression (Exp);
10370 elsif Nkind (Exp) = N_Slice
10371 or else Nkind (Exp) = N_Indexed_Component
10372 or else Nkind (Exp) = N_Selected_Component
10374 Exp := Prefix (Exp);
10381 -- Now look for entity being referenced
10383 if Present (Ent) then
10384 if Is_Object (Ent) then
10385 if Comes_From_Source (Exp)
10386 or else Modification_Comes_From_Source
10388 -- Give warning if pragma unmodified given and we are
10389 -- sure this is a modification.
10391 if Has_Pragma_Unmodified (Ent) and then Sure then
10392 Error_Msg_NE ("?pragma Unmodified given for &!", N, Ent);
10395 Set_Never_Set_In_Source (Ent, False);
10398 Set_Is_True_Constant (Ent, False);
10399 Set_Current_Value (Ent, Empty);
10400 Set_Is_Known_Null (Ent, False);
10402 if not Can_Never_Be_Null (Ent) then
10403 Set_Is_Known_Non_Null (Ent, False);
10406 -- Follow renaming chain
10408 if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
10409 and then Present (Renamed_Object (Ent))
10411 Exp := Renamed_Object (Ent);
10415 -- Generate a reference only if the assignment comes from
10416 -- source. This excludes, for example, calls to a dispatching
10417 -- assignment operation when the left-hand side is tagged.
10419 if Modification_Comes_From_Source then
10420 Generate_Reference (Ent, Exp, 'm');
10422 -- If the target of the assignment is the bound variable
10423 -- in an iterator, indicate that the corresponding array
10424 -- or container is also modified.
10426 if Ada_Version >= Ada_2012
10428 Nkind (Parent (Ent)) = N_Iterator_Specification
10431 Domain : constant Node_Id := Name (Parent (Ent));
10434 -- TBD : in the full version of the construct, the
10435 -- domain of iteration can be given by an expression.
10437 if Is_Entity_Name (Domain) then
10438 Generate_Reference (Entity (Domain), Exp, 'm');
10439 Set_Is_True_Constant (Entity (Domain), False);
10440 Set_Never_Set_In_Source (Entity (Domain), False);
10446 Check_Nested_Access (Ent);
10451 -- If we are sure this is a modification from source, and we know
10452 -- this modifies a constant, then give an appropriate warning.
10454 if Overlays_Constant (Ent)
10455 and then Modification_Comes_From_Source
10459 A : constant Node_Id := Address_Clause (Ent);
10461 if Present (A) then
10463 Exp : constant Node_Id := Expression (A);
10465 if Nkind (Exp) = N_Attribute_Reference
10466 and then Attribute_Name (Exp) = Name_Address
10467 and then Is_Entity_Name (Prefix (Exp))
10469 Error_Msg_Sloc := Sloc (A);
10471 ("constant& may be modified via address clause#?",
10472 N, Entity (Prefix (Exp)));
10482 end Note_Possible_Modification;
10484 -------------------------
10485 -- Object_Access_Level --
10486 -------------------------
10488 function Object_Access_Level (Obj : Node_Id) return Uint is
10491 -- Returns the static accessibility level of the view denoted by Obj. Note
10492 -- that the value returned is the result of a call to Scope_Depth. Only
10493 -- scope depths associated with dynamic scopes can actually be returned.
10494 -- Since only relative levels matter for accessibility checking, the fact
10495 -- that the distance between successive levels of accessibility is not
10496 -- always one is immaterial (invariant: if level(E2) is deeper than
10497 -- level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
10499 function Reference_To (Obj : Node_Id) return Node_Id;
10500 -- An explicit dereference is created when removing side-effects from
10501 -- expressions for constraint checking purposes. In this case a local
10502 -- access type is created for it. The correct access level is that of
10503 -- the original source node. We detect this case by noting that the
10504 -- prefix of the dereference is created by an object declaration whose
10505 -- initial expression is a reference.
10511 function Reference_To (Obj : Node_Id) return Node_Id is
10512 Pref : constant Node_Id := Prefix (Obj);
10514 if Is_Entity_Name (Pref)
10515 and then Nkind (Parent (Entity (Pref))) = N_Object_Declaration
10516 and then Present (Expression (Parent (Entity (Pref))))
10517 and then Nkind (Expression (Parent (Entity (Pref)))) = N_Reference
10519 return (Prefix (Expression (Parent (Entity (Pref)))));
10525 -- Start of processing for Object_Access_Level
10528 if Is_Entity_Name (Obj) then
10531 if Is_Prival (E) then
10532 E := Prival_Link (E);
10535 -- If E is a type then it denotes a current instance. For this case
10536 -- we add one to the normal accessibility level of the type to ensure
10537 -- that current instances are treated as always being deeper than
10538 -- than the level of any visible named access type (see 3.10.2(21)).
10540 if Is_Type (E) then
10541 return Type_Access_Level (E) + 1;
10543 elsif Present (Renamed_Object (E)) then
10544 return Object_Access_Level (Renamed_Object (E));
10546 -- Similarly, if E is a component of the current instance of a
10547 -- protected type, any instance of it is assumed to be at a deeper
10548 -- level than the type. For a protected object (whose type is an
10549 -- anonymous protected type) its components are at the same level
10550 -- as the type itself.
10552 elsif not Is_Overloadable (E)
10553 and then Ekind (Scope (E)) = E_Protected_Type
10554 and then Comes_From_Source (Scope (E))
10556 return Type_Access_Level (Scope (E)) + 1;
10559 return Scope_Depth (Enclosing_Dynamic_Scope (E));
10562 elsif Nkind (Obj) = N_Selected_Component then
10563 if Is_Access_Type (Etype (Prefix (Obj))) then
10564 return Type_Access_Level (Etype (Prefix (Obj)));
10566 return Object_Access_Level (Prefix (Obj));
10569 elsif Nkind (Obj) = N_Indexed_Component then
10570 if Is_Access_Type (Etype (Prefix (Obj))) then
10571 return Type_Access_Level (Etype (Prefix (Obj)));
10573 return Object_Access_Level (Prefix (Obj));
10576 elsif Nkind (Obj) = N_Explicit_Dereference then
10578 -- If the prefix is a selected access discriminant then we make a
10579 -- recursive call on the prefix, which will in turn check the level
10580 -- of the prefix object of the selected discriminant.
10582 if Nkind (Prefix (Obj)) = N_Selected_Component
10583 and then Ekind (Etype (Prefix (Obj))) = E_Anonymous_Access_Type
10585 Ekind (Entity (Selector_Name (Prefix (Obj)))) = E_Discriminant
10587 return Object_Access_Level (Prefix (Obj));
10589 elsif not (Comes_From_Source (Obj)) then
10591 Ref : constant Node_Id := Reference_To (Obj);
10593 if Present (Ref) then
10594 return Object_Access_Level (Ref);
10596 return Type_Access_Level (Etype (Prefix (Obj)));
10601 return Type_Access_Level (Etype (Prefix (Obj)));
10604 elsif Nkind (Obj) = N_Type_Conversion
10605 or else Nkind (Obj) = N_Unchecked_Type_Conversion
10607 return Object_Access_Level (Expression (Obj));
10609 elsif Nkind (Obj) = N_Function_Call then
10611 -- Function results are objects, so we get either the access level of
10612 -- the function or, in the case of an indirect call, the level of the
10613 -- access-to-subprogram type. (This code is used for Ada 95, but it
10614 -- looks wrong, because it seems that we should be checking the level
10615 -- of the call itself, even for Ada 95. However, using the Ada 2005
10616 -- version of the code causes regressions in several tests that are
10617 -- compiled with -gnat95. ???)
10619 if Ada_Version < Ada_2005 then
10620 if Is_Entity_Name (Name (Obj)) then
10621 return Subprogram_Access_Level (Entity (Name (Obj)));
10623 return Type_Access_Level (Etype (Prefix (Name (Obj))));
10626 -- For Ada 2005, the level of the result object of a function call is
10627 -- defined to be the level of the call's innermost enclosing master.
10628 -- We determine that by querying the depth of the innermost enclosing
10632 Return_Master_Scope_Depth_Of_Call : declare
10634 function Innermost_Master_Scope_Depth
10635 (N : Node_Id) return Uint;
10636 -- Returns the scope depth of the given node's innermost
10637 -- enclosing dynamic scope (effectively the accessibility
10638 -- level of the innermost enclosing master).
10640 ----------------------------------
10641 -- Innermost_Master_Scope_Depth --
10642 ----------------------------------
10644 function Innermost_Master_Scope_Depth
10645 (N : Node_Id) return Uint
10647 Node_Par : Node_Id := Parent (N);
10650 -- Locate the nearest enclosing node (by traversing Parents)
10651 -- that Defining_Entity can be applied to, and return the
10652 -- depth of that entity's nearest enclosing dynamic scope.
10654 while Present (Node_Par) loop
10655 case Nkind (Node_Par) is
10656 when N_Component_Declaration |
10657 N_Entry_Declaration |
10658 N_Formal_Object_Declaration |
10659 N_Formal_Type_Declaration |
10660 N_Full_Type_Declaration |
10661 N_Incomplete_Type_Declaration |
10662 N_Loop_Parameter_Specification |
10663 N_Object_Declaration |
10664 N_Protected_Type_Declaration |
10665 N_Private_Extension_Declaration |
10666 N_Private_Type_Declaration |
10667 N_Subtype_Declaration |
10668 N_Function_Specification |
10669 N_Procedure_Specification |
10670 N_Task_Type_Declaration |
10672 N_Generic_Instantiation |
10674 N_Implicit_Label_Declaration |
10675 N_Package_Declaration |
10676 N_Single_Task_Declaration |
10677 N_Subprogram_Declaration |
10678 N_Generic_Declaration |
10679 N_Renaming_Declaration |
10680 N_Block_Statement |
10681 N_Formal_Subprogram_Declaration |
10682 N_Abstract_Subprogram_Declaration |
10684 N_Exception_Declaration |
10685 N_Formal_Package_Declaration |
10686 N_Number_Declaration |
10687 N_Package_Specification |
10688 N_Parameter_Specification |
10689 N_Single_Protected_Declaration |
10693 (Nearest_Dynamic_Scope
10694 (Defining_Entity (Node_Par)));
10700 Node_Par := Parent (Node_Par);
10703 pragma Assert (False);
10705 -- Should never reach the following return
10707 return Scope_Depth (Current_Scope) + 1;
10708 end Innermost_Master_Scope_Depth;
10710 -- Start of processing for Return_Master_Scope_Depth_Of_Call
10713 return Innermost_Master_Scope_Depth (Obj);
10714 end Return_Master_Scope_Depth_Of_Call;
10717 -- For convenience we handle qualified expressions, even though
10718 -- they aren't technically object names.
10720 elsif Nkind (Obj) = N_Qualified_Expression then
10721 return Object_Access_Level (Expression (Obj));
10723 -- Otherwise return the scope level of Standard.
10724 -- (If there are cases that fall through
10725 -- to this point they will be treated as
10726 -- having global accessibility for now. ???)
10729 return Scope_Depth (Standard_Standard);
10731 end Object_Access_Level;
10733 --------------------------------------
10734 -- Original_Corresponding_Operation --
10735 --------------------------------------
10737 function Original_Corresponding_Operation (S : Entity_Id) return Entity_Id
10739 Typ : constant Entity_Id := Find_Dispatching_Type (S);
10742 -- If S is an inherited primitive S2 the original corresponding
10743 -- operation of S is the original corresponding operation of S2
10745 if Present (Alias (S))
10746 and then Find_Dispatching_Type (Alias (S)) /= Typ
10748 return Original_Corresponding_Operation (Alias (S));
10750 -- If S overrides an inherited subprogram S2 the original corresponding
10751 -- operation of S is the original corresponding operation of S2
10753 elsif Present (Overridden_Operation (S)) then
10754 return Original_Corresponding_Operation (Overridden_Operation (S));
10756 -- otherwise it is S itself
10761 end Original_Corresponding_Operation;
10763 -----------------------
10764 -- Private_Component --
10765 -----------------------
10767 function Private_Component (Type_Id : Entity_Id) return Entity_Id is
10768 Ancestor : constant Entity_Id := Base_Type (Type_Id);
10770 function Trace_Components
10772 Check : Boolean) return Entity_Id;
10773 -- Recursive function that does the work, and checks against circular
10774 -- definition for each subcomponent type.
10776 ----------------------
10777 -- Trace_Components --
10778 ----------------------
10780 function Trace_Components
10782 Check : Boolean) return Entity_Id
10784 Btype : constant Entity_Id := Base_Type (T);
10785 Component : Entity_Id;
10787 Candidate : Entity_Id := Empty;
10790 if Check and then Btype = Ancestor then
10791 Error_Msg_N ("circular type definition", Type_Id);
10795 if Is_Private_Type (Btype)
10796 and then not Is_Generic_Type (Btype)
10798 if Present (Full_View (Btype))
10799 and then Is_Record_Type (Full_View (Btype))
10800 and then not Is_Frozen (Btype)
10802 -- To indicate that the ancestor depends on a private type, the
10803 -- current Btype is sufficient. However, to check for circular
10804 -- definition we must recurse on the full view.
10806 Candidate := Trace_Components (Full_View (Btype), True);
10808 if Candidate = Any_Type then
10818 elsif Is_Array_Type (Btype) then
10819 return Trace_Components (Component_Type (Btype), True);
10821 elsif Is_Record_Type (Btype) then
10822 Component := First_Entity (Btype);
10823 while Present (Component)
10824 and then Comes_From_Source (Component)
10826 -- Skip anonymous types generated by constrained components
10828 if not Is_Type (Component) then
10829 P := Trace_Components (Etype (Component), True);
10831 if Present (P) then
10832 if P = Any_Type then
10840 Next_Entity (Component);
10848 end Trace_Components;
10850 -- Start of processing for Private_Component
10853 return Trace_Components (Type_Id, False);
10854 end Private_Component;
10856 ---------------------------
10857 -- Primitive_Names_Match --
10858 ---------------------------
10860 function Primitive_Names_Match (E1, E2 : Entity_Id) return Boolean is
10862 function Non_Internal_Name (E : Entity_Id) return Name_Id;
10863 -- Given an internal name, returns the corresponding non-internal name
10865 ------------------------
10866 -- Non_Internal_Name --
10867 ------------------------
10869 function Non_Internal_Name (E : Entity_Id) return Name_Id is
10871 Get_Name_String (Chars (E));
10872 Name_Len := Name_Len - 1;
10874 end Non_Internal_Name;
10876 -- Start of processing for Primitive_Names_Match
10879 pragma Assert (Present (E1) and then Present (E2));
10881 return Chars (E1) = Chars (E2)
10883 (not Is_Internal_Name (Chars (E1))
10884 and then Is_Internal_Name (Chars (E2))
10885 and then Non_Internal_Name (E2) = Chars (E1))
10887 (not Is_Internal_Name (Chars (E2))
10888 and then Is_Internal_Name (Chars (E1))
10889 and then Non_Internal_Name (E1) = Chars (E2))
10891 (Is_Predefined_Dispatching_Operation (E1)
10892 and then Is_Predefined_Dispatching_Operation (E2)
10893 and then Same_TSS (E1, E2))
10895 (Is_Init_Proc (E1) and then Is_Init_Proc (E2));
10896 end Primitive_Names_Match;
10898 -----------------------
10899 -- Process_End_Label --
10900 -----------------------
10902 procedure Process_End_Label
10911 Label_Ref : Boolean;
10912 -- Set True if reference to end label itself is required
10915 -- Gets set to the operator symbol or identifier that references the
10916 -- entity Ent. For the child unit case, this is the identifier from the
10917 -- designator. For other cases, this is simply Endl.
10919 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id);
10920 -- N is an identifier node that appears as a parent unit reference in
10921 -- the case where Ent is a child unit. This procedure generates an
10922 -- appropriate cross-reference entry. E is the corresponding entity.
10924 -------------------------
10925 -- Generate_Parent_Ref --
10926 -------------------------
10928 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id) is
10930 -- If names do not match, something weird, skip reference
10932 if Chars (E) = Chars (N) then
10934 -- Generate the reference. We do NOT consider this as a reference
10935 -- for unreferenced symbol purposes.
10937 Generate_Reference (E, N, 'r', Set_Ref => False, Force => True);
10939 if Style_Check then
10940 Style.Check_Identifier (N, E);
10943 end Generate_Parent_Ref;
10945 -- Start of processing for Process_End_Label
10948 -- If no node, ignore. This happens in some error situations, and
10949 -- also for some internally generated structures where no end label
10950 -- references are required in any case.
10956 -- Nothing to do if no End_Label, happens for internally generated
10957 -- constructs where we don't want an end label reference anyway. Also
10958 -- nothing to do if Endl is a string literal, which means there was
10959 -- some prior error (bad operator symbol)
10961 Endl := End_Label (N);
10963 if No (Endl) or else Nkind (Endl) = N_String_Literal then
10967 -- Reference node is not in extended main source unit
10969 if not In_Extended_Main_Source_Unit (N) then
10971 -- Generally we do not collect references except for the extended
10972 -- main source unit. The one exception is the 'e' entry for a
10973 -- package spec, where it is useful for a client to have the
10974 -- ending information to define scopes.
10980 Label_Ref := False;
10982 -- For this case, we can ignore any parent references, but we
10983 -- need the package name itself for the 'e' entry.
10985 if Nkind (Endl) = N_Designator then
10986 Endl := Identifier (Endl);
10990 -- Reference is in extended main source unit
10995 -- For designator, generate references for the parent entries
10997 if Nkind (Endl) = N_Designator then
10999 -- Generate references for the prefix if the END line comes from
11000 -- source (otherwise we do not need these references) We climb the
11001 -- scope stack to find the expected entities.
11003 if Comes_From_Source (Endl) then
11004 Nam := Name (Endl);
11005 Scop := Current_Scope;
11006 while Nkind (Nam) = N_Selected_Component loop
11007 Scop := Scope (Scop);
11008 exit when No (Scop);
11009 Generate_Parent_Ref (Selector_Name (Nam), Scop);
11010 Nam := Prefix (Nam);
11013 if Present (Scop) then
11014 Generate_Parent_Ref (Nam, Scope (Scop));
11018 Endl := Identifier (Endl);
11022 -- If the end label is not for the given entity, then either we have
11023 -- some previous error, or this is a generic instantiation for which
11024 -- we do not need to make a cross-reference in this case anyway. In
11025 -- either case we simply ignore the call.
11027 if Chars (Ent) /= Chars (Endl) then
11031 -- If label was really there, then generate a normal reference and then
11032 -- adjust the location in the end label to point past the name (which
11033 -- should almost always be the semicolon).
11035 Loc := Sloc (Endl);
11037 if Comes_From_Source (Endl) then
11039 -- If a label reference is required, then do the style check and
11040 -- generate an l-type cross-reference entry for the label
11043 if Style_Check then
11044 Style.Check_Identifier (Endl, Ent);
11047 Generate_Reference (Ent, Endl, 'l', Set_Ref => False);
11050 -- Set the location to point past the label (normally this will
11051 -- mean the semicolon immediately following the label). This is
11052 -- done for the sake of the 'e' or 't' entry generated below.
11054 Get_Decoded_Name_String (Chars (Endl));
11055 Set_Sloc (Endl, Sloc (Endl) + Source_Ptr (Name_Len));
11058 -- In SPARK mode, no missing label is allowed for packages and
11059 -- subprogram bodies. Detect those cases by testing whether
11060 -- Process_End_Label was called for a body (Typ = 't') or a package.
11062 if Restriction_Check_Required (SPARK)
11063 and then (Typ = 't' or else Ekind (Ent) = E_Package)
11065 Error_Msg_Node_1 := Endl;
11066 Check_SPARK_Restriction ("`END &` required", Endl, Force => True);
11070 -- Now generate the e/t reference
11072 Generate_Reference (Ent, Endl, Typ, Set_Ref => False, Force => True);
11074 -- Restore Sloc, in case modified above, since we have an identifier
11075 -- and the normal Sloc should be left set in the tree.
11077 Set_Sloc (Endl, Loc);
11078 end Process_End_Label;
11080 ------------------------------------
11081 -- References_Generic_Formal_Type --
11082 ------------------------------------
11084 function References_Generic_Formal_Type (N : Node_Id) return Boolean is
11086 function Process (N : Node_Id) return Traverse_Result;
11087 -- Process one node in search for generic formal type
11093 function Process (N : Node_Id) return Traverse_Result is
11095 if Nkind (N) in N_Has_Entity then
11097 E : constant Entity_Id := Entity (N);
11099 if Present (E) then
11100 if Is_Generic_Type (E) then
11102 elsif Present (Etype (E))
11103 and then Is_Generic_Type (Etype (E))
11114 function Traverse is new Traverse_Func (Process);
11115 -- Traverse tree to look for generic type
11118 if Inside_A_Generic then
11119 return Traverse (N) = Abandon;
11123 end References_Generic_Formal_Type;
11125 --------------------
11126 -- Remove_Homonym --
11127 --------------------
11129 procedure Remove_Homonym (E : Entity_Id) is
11130 Prev : Entity_Id := Empty;
11134 if E = Current_Entity (E) then
11135 if Present (Homonym (E)) then
11136 Set_Current_Entity (Homonym (E));
11138 Set_Name_Entity_Id (Chars (E), Empty);
11141 H := Current_Entity (E);
11142 while Present (H) and then H /= E loop
11147 Set_Homonym (Prev, Homonym (E));
11149 end Remove_Homonym;
11151 ---------------------
11152 -- Rep_To_Pos_Flag --
11153 ---------------------
11155 function Rep_To_Pos_Flag (E : Entity_Id; Loc : Source_Ptr) return Node_Id is
11157 return New_Occurrence_Of
11158 (Boolean_Literals (not Range_Checks_Suppressed (E)), Loc);
11159 end Rep_To_Pos_Flag;
11161 --------------------
11162 -- Require_Entity --
11163 --------------------
11165 procedure Require_Entity (N : Node_Id) is
11167 if Is_Entity_Name (N) and then No (Entity (N)) then
11168 if Total_Errors_Detected /= 0 then
11169 Set_Entity (N, Any_Id);
11171 raise Program_Error;
11174 end Require_Entity;
11176 ------------------------------
11177 -- Requires_Transient_Scope --
11178 ------------------------------
11180 -- A transient scope is required when variable-sized temporaries are
11181 -- allocated in the primary or secondary stack, or when finalization
11182 -- actions must be generated before the next instruction.
11184 function Requires_Transient_Scope (Id : Entity_Id) return Boolean is
11185 Typ : constant Entity_Id := Underlying_Type (Id);
11187 -- Start of processing for Requires_Transient_Scope
11190 -- This is a private type which is not completed yet. This can only
11191 -- happen in a default expression (of a formal parameter or of a
11192 -- record component). Do not expand transient scope in this case
11197 -- Do not expand transient scope for non-existent procedure return
11199 elsif Typ = Standard_Void_Type then
11202 -- Elementary types do not require a transient scope
11204 elsif Is_Elementary_Type (Typ) then
11207 -- Generally, indefinite subtypes require a transient scope, since the
11208 -- back end cannot generate temporaries, since this is not a valid type
11209 -- for declaring an object. It might be possible to relax this in the
11210 -- future, e.g. by declaring the maximum possible space for the type.
11212 elsif Is_Indefinite_Subtype (Typ) then
11215 -- Functions returning tagged types may dispatch on result so their
11216 -- returned value is allocated on the secondary stack. Controlled
11217 -- type temporaries need finalization.
11219 elsif Is_Tagged_Type (Typ)
11220 or else Has_Controlled_Component (Typ)
11222 return not Is_Value_Type (Typ);
11226 elsif Is_Record_Type (Typ) then
11230 Comp := First_Entity (Typ);
11231 while Present (Comp) loop
11232 if Ekind (Comp) = E_Component
11233 and then Requires_Transient_Scope (Etype (Comp))
11237 Next_Entity (Comp);
11244 -- String literal types never require transient scope
11246 elsif Ekind (Typ) = E_String_Literal_Subtype then
11249 -- Array type. Note that we already know that this is a constrained
11250 -- array, since unconstrained arrays will fail the indefinite test.
11252 elsif Is_Array_Type (Typ) then
11254 -- If component type requires a transient scope, the array does too
11256 if Requires_Transient_Scope (Component_Type (Typ)) then
11259 -- Otherwise, we only need a transient scope if the size depends on
11260 -- the value of one or more discriminants.
11263 return Size_Depends_On_Discriminant (Typ);
11266 -- All other cases do not require a transient scope
11271 end Requires_Transient_Scope;
11273 --------------------------
11274 -- Reset_Analyzed_Flags --
11275 --------------------------
11277 procedure Reset_Analyzed_Flags (N : Node_Id) is
11279 function Clear_Analyzed (N : Node_Id) return Traverse_Result;
11280 -- Function used to reset Analyzed flags in tree. Note that we do
11281 -- not reset Analyzed flags in entities, since there is no need to
11282 -- reanalyze entities, and indeed, it is wrong to do so, since it
11283 -- can result in generating auxiliary stuff more than once.
11285 --------------------
11286 -- Clear_Analyzed --
11287 --------------------
11289 function Clear_Analyzed (N : Node_Id) return Traverse_Result is
11291 if not Has_Extension (N) then
11292 Set_Analyzed (N, False);
11296 end Clear_Analyzed;
11298 procedure Reset_Analyzed is new Traverse_Proc (Clear_Analyzed);
11300 -- Start of processing for Reset_Analyzed_Flags
11303 Reset_Analyzed (N);
11304 end Reset_Analyzed_Flags;
11306 ---------------------------
11307 -- Safe_To_Capture_Value --
11308 ---------------------------
11310 function Safe_To_Capture_Value
11313 Cond : Boolean := False) return Boolean
11316 -- The only entities for which we track constant values are variables
11317 -- which are not renamings, constants, out parameters, and in out
11318 -- parameters, so check if we have this case.
11320 -- Note: it may seem odd to track constant values for constants, but in
11321 -- fact this routine is used for other purposes than simply capturing
11322 -- the value. In particular, the setting of Known[_Non]_Null.
11324 if (Ekind (Ent) = E_Variable and then No (Renamed_Object (Ent)))
11326 Ekind (Ent) = E_Constant
11328 Ekind (Ent) = E_Out_Parameter
11330 Ekind (Ent) = E_In_Out_Parameter
11334 -- For conditionals, we also allow loop parameters and all formals,
11335 -- including in parameters.
11339 (Ekind (Ent) = E_Loop_Parameter
11341 Ekind (Ent) = E_In_Parameter)
11345 -- For all other cases, not just unsafe, but impossible to capture
11346 -- Current_Value, since the above are the only entities which have
11347 -- Current_Value fields.
11353 -- Skip if volatile or aliased, since funny things might be going on in
11354 -- these cases which we cannot necessarily track. Also skip any variable
11355 -- for which an address clause is given, or whose address is taken. Also
11356 -- never capture value of library level variables (an attempt to do so
11357 -- can occur in the case of package elaboration code).
11359 if Treat_As_Volatile (Ent)
11360 or else Is_Aliased (Ent)
11361 or else Present (Address_Clause (Ent))
11362 or else Address_Taken (Ent)
11363 or else (Is_Library_Level_Entity (Ent)
11364 and then Ekind (Ent) = E_Variable)
11369 -- OK, all above conditions are met. We also require that the scope of
11370 -- the reference be the same as the scope of the entity, not counting
11371 -- packages and blocks and loops.
11374 E_Scope : constant Entity_Id := Scope (Ent);
11375 R_Scope : Entity_Id;
11378 R_Scope := Current_Scope;
11379 while R_Scope /= Standard_Standard loop
11380 exit when R_Scope = E_Scope;
11382 if not Ekind_In (R_Scope, E_Package, E_Block, E_Loop) then
11385 R_Scope := Scope (R_Scope);
11390 -- We also require that the reference does not appear in a context
11391 -- where it is not sure to be executed (i.e. a conditional context
11392 -- or an exception handler). We skip this if Cond is True, since the
11393 -- capturing of values from conditional tests handles this ok.
11407 while Present (P) loop
11408 if Nkind (P) = N_If_Statement
11409 or else Nkind (P) = N_Case_Statement
11410 or else (Nkind (P) in N_Short_Circuit
11411 and then Desc = Right_Opnd (P))
11412 or else (Nkind (P) = N_Conditional_Expression
11413 and then Desc /= First (Expressions (P)))
11414 or else Nkind (P) = N_Exception_Handler
11415 or else Nkind (P) = N_Selective_Accept
11416 or else Nkind (P) = N_Conditional_Entry_Call
11417 or else Nkind (P) = N_Timed_Entry_Call
11418 or else Nkind (P) = N_Asynchronous_Select
11428 -- OK, looks safe to set value
11431 end Safe_To_Capture_Value;
11437 function Same_Name (N1, N2 : Node_Id) return Boolean is
11438 K1 : constant Node_Kind := Nkind (N1);
11439 K2 : constant Node_Kind := Nkind (N2);
11442 if (K1 = N_Identifier or else K1 = N_Defining_Identifier)
11443 and then (K2 = N_Identifier or else K2 = N_Defining_Identifier)
11445 return Chars (N1) = Chars (N2);
11447 elsif (K1 = N_Selected_Component or else K1 = N_Expanded_Name)
11448 and then (K2 = N_Selected_Component or else K2 = N_Expanded_Name)
11450 return Same_Name (Selector_Name (N1), Selector_Name (N2))
11451 and then Same_Name (Prefix (N1), Prefix (N2));
11462 function Same_Object (Node1, Node2 : Node_Id) return Boolean is
11463 N1 : constant Node_Id := Original_Node (Node1);
11464 N2 : constant Node_Id := Original_Node (Node2);
11465 -- We do the tests on original nodes, since we are most interested
11466 -- in the original source, not any expansion that got in the way.
11468 K1 : constant Node_Kind := Nkind (N1);
11469 K2 : constant Node_Kind := Nkind (N2);
11472 -- First case, both are entities with same entity
11474 if K1 in N_Has_Entity and then K2 in N_Has_Entity then
11476 EN1 : constant Entity_Id := Entity (N1);
11477 EN2 : constant Entity_Id := Entity (N2);
11479 if Present (EN1) and then Present (EN2)
11480 and then (Ekind_In (EN1, E_Variable, E_Constant)
11481 or else Is_Formal (EN1))
11489 -- Second case, selected component with same selector, same record
11491 if K1 = N_Selected_Component
11492 and then K2 = N_Selected_Component
11493 and then Chars (Selector_Name (N1)) = Chars (Selector_Name (N2))
11495 return Same_Object (Prefix (N1), Prefix (N2));
11497 -- Third case, indexed component with same subscripts, same array
11499 elsif K1 = N_Indexed_Component
11500 and then K2 = N_Indexed_Component
11501 and then Same_Object (Prefix (N1), Prefix (N2))
11506 E1 := First (Expressions (N1));
11507 E2 := First (Expressions (N2));
11508 while Present (E1) loop
11509 if not Same_Value (E1, E2) then
11520 -- Fourth case, slice of same array with same bounds
11523 and then K2 = N_Slice
11524 and then Nkind (Discrete_Range (N1)) = N_Range
11525 and then Nkind (Discrete_Range (N2)) = N_Range
11526 and then Same_Value (Low_Bound (Discrete_Range (N1)),
11527 Low_Bound (Discrete_Range (N2)))
11528 and then Same_Value (High_Bound (Discrete_Range (N1)),
11529 High_Bound (Discrete_Range (N2)))
11531 return Same_Name (Prefix (N1), Prefix (N2));
11533 -- All other cases, not clearly the same object
11544 function Same_Type (T1, T2 : Entity_Id) return Boolean is
11549 elsif not Is_Constrained (T1)
11550 and then not Is_Constrained (T2)
11551 and then Base_Type (T1) = Base_Type (T2)
11555 -- For now don't bother with case of identical constraints, to be
11556 -- fiddled with later on perhaps (this is only used for optimization
11557 -- purposes, so it is not critical to do a best possible job)
11568 function Same_Value (Node1, Node2 : Node_Id) return Boolean is
11570 if Compile_Time_Known_Value (Node1)
11571 and then Compile_Time_Known_Value (Node2)
11572 and then Expr_Value (Node1) = Expr_Value (Node2)
11575 elsif Same_Object (Node1, Node2) then
11586 procedure Save_Actual (N : Node_Id; Writable : Boolean := False) is
11588 if Ada_Version < Ada_2012 then
11591 elsif Is_Entity_Name (N)
11593 Nkind_In (N, N_Indexed_Component, N_Selected_Component, N_Slice)
11595 (Nkind (N) = N_Attribute_Reference
11596 and then Attribute_Name (N) = Name_Access)
11599 -- We are only interested in IN OUT parameters of inner calls
11602 or else Nkind (Parent (N)) = N_Function_Call
11603 or else Nkind (Parent (N)) in N_Op
11605 Actuals_In_Call.Increment_Last;
11606 Actuals_In_Call.Table (Actuals_In_Call.Last) := (N, Writable);
11611 ------------------------
11612 -- Scope_Is_Transient --
11613 ------------------------
11615 function Scope_Is_Transient return Boolean is
11617 return Scope_Stack.Table (Scope_Stack.Last).Is_Transient;
11618 end Scope_Is_Transient;
11624 function Scope_Within (Scope1, Scope2 : Entity_Id) return Boolean is
11629 while Scop /= Standard_Standard loop
11630 Scop := Scope (Scop);
11632 if Scop = Scope2 then
11640 --------------------------
11641 -- Scope_Within_Or_Same --
11642 --------------------------
11644 function Scope_Within_Or_Same (Scope1, Scope2 : Entity_Id) return Boolean is
11649 while Scop /= Standard_Standard loop
11650 if Scop = Scope2 then
11653 Scop := Scope (Scop);
11658 end Scope_Within_Or_Same;
11660 --------------------
11661 -- Set_Convention --
11662 --------------------
11664 procedure Set_Convention (E : Entity_Id; Val : Snames.Convention_Id) is
11666 Basic_Set_Convention (E, Val);
11669 and then Is_Access_Subprogram_Type (Base_Type (E))
11670 and then Has_Foreign_Convention (E)
11672 Set_Can_Use_Internal_Rep (E, False);
11674 end Set_Convention;
11676 ------------------------
11677 -- Set_Current_Entity --
11678 ------------------------
11680 -- The given entity is to be set as the currently visible definition of its
11681 -- associated name (i.e. the Node_Id associated with its name). All we have
11682 -- to do is to get the name from the identifier, and then set the
11683 -- associated Node_Id to point to the given entity.
11685 procedure Set_Current_Entity (E : Entity_Id) is
11687 Set_Name_Entity_Id (Chars (E), E);
11688 end Set_Current_Entity;
11690 ---------------------------
11691 -- Set_Debug_Info_Needed --
11692 ---------------------------
11694 procedure Set_Debug_Info_Needed (T : Entity_Id) is
11696 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id);
11697 pragma Inline (Set_Debug_Info_Needed_If_Not_Set);
11698 -- Used to set debug info in a related node if not set already
11700 --------------------------------------
11701 -- Set_Debug_Info_Needed_If_Not_Set --
11702 --------------------------------------
11704 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id) is
11707 and then not Needs_Debug_Info (E)
11709 Set_Debug_Info_Needed (E);
11711 -- For a private type, indicate that the full view also needs
11712 -- debug information.
11715 and then Is_Private_Type (E)
11716 and then Present (Full_View (E))
11718 Set_Debug_Info_Needed (Full_View (E));
11721 end Set_Debug_Info_Needed_If_Not_Set;
11723 -- Start of processing for Set_Debug_Info_Needed
11726 -- Nothing to do if argument is Empty or has Debug_Info_Off set, which
11727 -- indicates that Debug_Info_Needed is never required for the entity.
11730 or else Debug_Info_Off (T)
11735 -- Set flag in entity itself. Note that we will go through the following
11736 -- circuitry even if the flag is already set on T. That's intentional,
11737 -- it makes sure that the flag will be set in subsidiary entities.
11739 Set_Needs_Debug_Info (T);
11741 -- Set flag on subsidiary entities if not set already
11743 if Is_Object (T) then
11744 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
11746 elsif Is_Type (T) then
11747 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
11749 if Is_Record_Type (T) then
11751 Ent : Entity_Id := First_Entity (T);
11753 while Present (Ent) loop
11754 Set_Debug_Info_Needed_If_Not_Set (Ent);
11759 -- For a class wide subtype, we also need debug information
11760 -- for the equivalent type.
11762 if Ekind (T) = E_Class_Wide_Subtype then
11763 Set_Debug_Info_Needed_If_Not_Set (Equivalent_Type (T));
11766 elsif Is_Array_Type (T) then
11767 Set_Debug_Info_Needed_If_Not_Set (Component_Type (T));
11770 Indx : Node_Id := First_Index (T);
11772 while Present (Indx) loop
11773 Set_Debug_Info_Needed_If_Not_Set (Etype (Indx));
11774 Indx := Next_Index (Indx);
11778 if Is_Packed (T) then
11779 Set_Debug_Info_Needed_If_Not_Set (Packed_Array_Type (T));
11782 elsif Is_Access_Type (T) then
11783 Set_Debug_Info_Needed_If_Not_Set (Directly_Designated_Type (T));
11785 elsif Is_Private_Type (T) then
11786 Set_Debug_Info_Needed_If_Not_Set (Full_View (T));
11788 elsif Is_Protected_Type (T) then
11789 Set_Debug_Info_Needed_If_Not_Set (Corresponding_Record_Type (T));
11792 end Set_Debug_Info_Needed;
11794 ---------------------------------
11795 -- Set_Entity_With_Style_Check --
11796 ---------------------------------
11798 procedure Set_Entity_With_Style_Check (N : Node_Id; Val : Entity_Id) is
11799 Val_Actual : Entity_Id;
11803 Set_Entity (N, Val);
11806 and then not Suppress_Style_Checks (Val)
11807 and then not In_Instance
11809 if Nkind (N) = N_Identifier then
11811 elsif Nkind (N) = N_Expanded_Name then
11812 Nod := Selector_Name (N);
11817 -- A special situation arises for derived operations, where we want
11818 -- to do the check against the parent (since the Sloc of the derived
11819 -- operation points to the derived type declaration itself).
11822 while not Comes_From_Source (Val_Actual)
11823 and then Nkind (Val_Actual) in N_Entity
11824 and then (Ekind (Val_Actual) = E_Enumeration_Literal
11825 or else Is_Subprogram (Val_Actual)
11826 or else Is_Generic_Subprogram (Val_Actual))
11827 and then Present (Alias (Val_Actual))
11829 Val_Actual := Alias (Val_Actual);
11832 -- Renaming declarations for generic actuals do not come from source,
11833 -- and have a different name from that of the entity they rename, so
11834 -- there is no style check to perform here.
11836 if Chars (Nod) = Chars (Val_Actual) then
11837 Style.Check_Identifier (Nod, Val_Actual);
11841 Set_Entity (N, Val);
11842 end Set_Entity_With_Style_Check;
11844 ------------------------
11845 -- Set_Name_Entity_Id --
11846 ------------------------
11848 procedure Set_Name_Entity_Id (Id : Name_Id; Val : Entity_Id) is
11850 Set_Name_Table_Info (Id, Int (Val));
11851 end Set_Name_Entity_Id;
11853 ---------------------
11854 -- Set_Next_Actual --
11855 ---------------------
11857 procedure Set_Next_Actual (Ass1_Id : Node_Id; Ass2_Id : Node_Id) is
11859 if Nkind (Parent (Ass1_Id)) = N_Parameter_Association then
11860 Set_First_Named_Actual (Parent (Ass1_Id), Ass2_Id);
11862 end Set_Next_Actual;
11864 ----------------------------------
11865 -- Set_Optimize_Alignment_Flags --
11866 ----------------------------------
11868 procedure Set_Optimize_Alignment_Flags (E : Entity_Id) is
11870 if Optimize_Alignment = 'S' then
11871 Set_Optimize_Alignment_Space (E);
11872 elsif Optimize_Alignment = 'T' then
11873 Set_Optimize_Alignment_Time (E);
11875 end Set_Optimize_Alignment_Flags;
11877 -----------------------
11878 -- Set_Public_Status --
11879 -----------------------
11881 procedure Set_Public_Status (Id : Entity_Id) is
11882 S : constant Entity_Id := Current_Scope;
11884 function Within_HSS_Or_If (E : Entity_Id) return Boolean;
11885 -- Determines if E is defined within handled statement sequence or
11886 -- an if statement, returns True if so, False otherwise.
11888 ----------------------
11889 -- Within_HSS_Or_If --
11890 ----------------------
11892 function Within_HSS_Or_If (E : Entity_Id) return Boolean is
11895 N := Declaration_Node (E);
11902 elsif Nkind_In (N, N_Handled_Sequence_Of_Statements,
11908 end Within_HSS_Or_If;
11910 -- Start of processing for Set_Public_Status
11913 -- Everything in the scope of Standard is public
11915 if S = Standard_Standard then
11916 Set_Is_Public (Id);
11918 -- Entity is definitely not public if enclosing scope is not public
11920 elsif not Is_Public (S) then
11923 -- An object or function declaration that occurs in a handled sequence
11924 -- of statements or within an if statement is the declaration for a
11925 -- temporary object or local subprogram generated by the expander. It
11926 -- never needs to be made public and furthermore, making it public can
11927 -- cause back end problems.
11929 elsif Nkind_In (Parent (Id), N_Object_Declaration,
11930 N_Function_Specification)
11931 and then Within_HSS_Or_If (Id)
11935 -- Entities in public packages or records are public
11937 elsif Ekind (S) = E_Package or Is_Record_Type (S) then
11938 Set_Is_Public (Id);
11940 -- The bounds of an entry family declaration can generate object
11941 -- declarations that are visible to the back-end, e.g. in the
11942 -- the declaration of a composite type that contains tasks.
11944 elsif Is_Concurrent_Type (S)
11945 and then not Has_Completion (S)
11946 and then Nkind (Parent (Id)) = N_Object_Declaration
11948 Set_Is_Public (Id);
11950 end Set_Public_Status;
11952 -----------------------------
11953 -- Set_Referenced_Modified --
11954 -----------------------------
11956 procedure Set_Referenced_Modified (N : Node_Id; Out_Param : Boolean) is
11960 -- Deal with indexed or selected component where prefix is modified
11962 if Nkind_In (N, N_Indexed_Component, N_Selected_Component) then
11963 Pref := Prefix (N);
11965 -- If prefix is access type, then it is the designated object that is
11966 -- being modified, which means we have no entity to set the flag on.
11968 if No (Etype (Pref)) or else Is_Access_Type (Etype (Pref)) then
11971 -- Otherwise chase the prefix
11974 Set_Referenced_Modified (Pref, Out_Param);
11977 -- Otherwise see if we have an entity name (only other case to process)
11979 elsif Is_Entity_Name (N) and then Present (Entity (N)) then
11980 Set_Referenced_As_LHS (Entity (N), not Out_Param);
11981 Set_Referenced_As_Out_Parameter (Entity (N), Out_Param);
11983 end Set_Referenced_Modified;
11985 ----------------------------
11986 -- Set_Scope_Is_Transient --
11987 ----------------------------
11989 procedure Set_Scope_Is_Transient (V : Boolean := True) is
11991 Scope_Stack.Table (Scope_Stack.Last).Is_Transient := V;
11992 end Set_Scope_Is_Transient;
11994 -------------------
11995 -- Set_Size_Info --
11996 -------------------
11998 procedure Set_Size_Info (T1, T2 : Entity_Id) is
12000 -- We copy Esize, but not RM_Size, since in general RM_Size is
12001 -- subtype specific and does not get inherited by all subtypes.
12003 Set_Esize (T1, Esize (T2));
12004 Set_Has_Biased_Representation (T1, Has_Biased_Representation (T2));
12006 if Is_Discrete_Or_Fixed_Point_Type (T1)
12008 Is_Discrete_Or_Fixed_Point_Type (T2)
12010 Set_Is_Unsigned_Type (T1, Is_Unsigned_Type (T2));
12013 Set_Alignment (T1, Alignment (T2));
12016 --------------------
12017 -- Static_Boolean --
12018 --------------------
12020 function Static_Boolean (N : Node_Id) return Uint is
12022 Analyze_And_Resolve (N, Standard_Boolean);
12025 or else Error_Posted (N)
12026 or else Etype (N) = Any_Type
12031 if Is_Static_Expression (N) then
12032 if not Raises_Constraint_Error (N) then
12033 return Expr_Value (N);
12038 elsif Etype (N) = Any_Type then
12042 Flag_Non_Static_Expr
12043 ("static boolean expression required here", N);
12046 end Static_Boolean;
12048 --------------------
12049 -- Static_Integer --
12050 --------------------
12052 function Static_Integer (N : Node_Id) return Uint is
12054 Analyze_And_Resolve (N, Any_Integer);
12057 or else Error_Posted (N)
12058 or else Etype (N) = Any_Type
12063 if Is_Static_Expression (N) then
12064 if not Raises_Constraint_Error (N) then
12065 return Expr_Value (N);
12070 elsif Etype (N) = Any_Type then
12074 Flag_Non_Static_Expr
12075 ("static integer expression required here", N);
12078 end Static_Integer;
12080 --------------------------
12081 -- Statically_Different --
12082 --------------------------
12084 function Statically_Different (E1, E2 : Node_Id) return Boolean is
12085 R1 : constant Node_Id := Get_Referenced_Object (E1);
12086 R2 : constant Node_Id := Get_Referenced_Object (E2);
12088 return Is_Entity_Name (R1)
12089 and then Is_Entity_Name (R2)
12090 and then Entity (R1) /= Entity (R2)
12091 and then not Is_Formal (Entity (R1))
12092 and then not Is_Formal (Entity (R2));
12093 end Statically_Different;
12095 -----------------------------
12096 -- Subprogram_Access_Level --
12097 -----------------------------
12099 function Subprogram_Access_Level (Subp : Entity_Id) return Uint is
12101 if Present (Alias (Subp)) then
12102 return Subprogram_Access_Level (Alias (Subp));
12104 return Scope_Depth (Enclosing_Dynamic_Scope (Subp));
12106 end Subprogram_Access_Level;
12112 procedure Trace_Scope (N : Node_Id; E : Entity_Id; Msg : String) is
12114 if Debug_Flag_W then
12115 for J in 0 .. Scope_Stack.Last loop
12120 Write_Name (Chars (E));
12121 Write_Str (" from ");
12122 Write_Location (Sloc (N));
12127 -----------------------
12128 -- Transfer_Entities --
12129 -----------------------
12131 procedure Transfer_Entities (From : Entity_Id; To : Entity_Id) is
12132 Ent : Entity_Id := First_Entity (From);
12139 if (Last_Entity (To)) = Empty then
12140 Set_First_Entity (To, Ent);
12142 Set_Next_Entity (Last_Entity (To), Ent);
12145 Set_Last_Entity (To, Last_Entity (From));
12147 while Present (Ent) loop
12148 Set_Scope (Ent, To);
12150 if not Is_Public (Ent) then
12151 Set_Public_Status (Ent);
12154 and then Ekind (Ent) = E_Record_Subtype
12157 -- The components of the propagated Itype must be public
12163 Comp := First_Entity (Ent);
12164 while Present (Comp) loop
12165 Set_Is_Public (Comp);
12166 Next_Entity (Comp);
12175 Set_First_Entity (From, Empty);
12176 Set_Last_Entity (From, Empty);
12177 end Transfer_Entities;
12179 -----------------------
12180 -- Type_Access_Level --
12181 -----------------------
12183 function Type_Access_Level (Typ : Entity_Id) return Uint is
12187 Btyp := Base_Type (Typ);
12189 -- Ada 2005 (AI-230): For most cases of anonymous access types, we
12190 -- simply use the level where the type is declared. This is true for
12191 -- stand-alone object declarations, and for anonymous access types
12192 -- associated with components the level is the same as that of the
12193 -- enclosing composite type. However, special treatment is needed for
12194 -- the cases of access parameters, return objects of an anonymous access
12195 -- type, and, in Ada 95, access discriminants of limited types.
12197 if Ekind (Btyp) in Access_Kind then
12198 if Ekind (Btyp) = E_Anonymous_Access_Type then
12200 -- If the type is a nonlocal anonymous access type (such as for
12201 -- an access parameter) we treat it as being declared at the
12202 -- library level to ensure that names such as X.all'access don't
12203 -- fail static accessibility checks.
12205 if not Is_Local_Anonymous_Access (Typ) then
12206 return Scope_Depth (Standard_Standard);
12208 -- If this is a return object, the accessibility level is that of
12209 -- the result subtype of the enclosing function. The test here is
12210 -- little complicated, because we have to account for extended
12211 -- return statements that have been rewritten as blocks, in which
12212 -- case we have to find and the Is_Return_Object attribute of the
12213 -- itype's associated object. It would be nice to find a way to
12214 -- simplify this test, but it doesn't seem worthwhile to add a new
12215 -- flag just for purposes of this test. ???
12217 elsif Ekind (Scope (Btyp)) = E_Return_Statement
12220 and then Nkind (Associated_Node_For_Itype (Btyp)) =
12221 N_Object_Declaration
12222 and then Is_Return_Object
12223 (Defining_Identifier
12224 (Associated_Node_For_Itype (Btyp))))
12230 Scop := Scope (Scope (Btyp));
12231 while Present (Scop) loop
12232 exit when Ekind (Scop) = E_Function;
12233 Scop := Scope (Scop);
12236 -- Treat the return object's type as having the level of the
12237 -- function's result subtype (as per RM05-6.5(5.3/2)).
12239 return Type_Access_Level (Etype (Scop));
12244 Btyp := Root_Type (Btyp);
12246 -- The accessibility level of anonymous access types associated with
12247 -- discriminants is that of the current instance of the type, and
12248 -- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
12250 -- AI-402: access discriminants have accessibility based on the
12251 -- object rather than the type in Ada 2005, so the above paragraph
12254 -- ??? Needs completion with rules from AI-416
12256 if Ada_Version <= Ada_95
12257 and then Ekind (Typ) = E_Anonymous_Access_Type
12258 and then Present (Associated_Node_For_Itype (Typ))
12259 and then Nkind (Associated_Node_For_Itype (Typ)) =
12260 N_Discriminant_Specification
12262 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp)) + 1;
12266 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
12267 end Type_Access_Level;
12269 ------------------------------------
12270 -- Type_Without_Stream_Operation --
12271 ------------------------------------
12273 function Type_Without_Stream_Operation
12275 Op : TSS_Name_Type := TSS_Null) return Entity_Id
12277 BT : constant Entity_Id := Base_Type (T);
12278 Op_Missing : Boolean;
12281 if not Restriction_Active (No_Default_Stream_Attributes) then
12285 if Is_Elementary_Type (T) then
12286 if Op = TSS_Null then
12288 No (TSS (BT, TSS_Stream_Read))
12289 or else No (TSS (BT, TSS_Stream_Write));
12292 Op_Missing := No (TSS (BT, Op));
12301 elsif Is_Array_Type (T) then
12302 return Type_Without_Stream_Operation (Component_Type (T), Op);
12304 elsif Is_Record_Type (T) then
12310 Comp := First_Component (T);
12311 while Present (Comp) loop
12312 C_Typ := Type_Without_Stream_Operation (Etype (Comp), Op);
12314 if Present (C_Typ) then
12318 Next_Component (Comp);
12324 elsif Is_Private_Type (T)
12325 and then Present (Full_View (T))
12327 return Type_Without_Stream_Operation (Full_View (T), Op);
12331 end Type_Without_Stream_Operation;
12333 ----------------------------
12334 -- Unique_Defining_Entity --
12335 ----------------------------
12337 function Unique_Defining_Entity (N : Node_Id) return Entity_Id is
12340 when N_Package_Body =>
12341 return Corresponding_Spec (N);
12343 when N_Subprogram_Body =>
12344 if Acts_As_Spec (N) then
12345 return Defining_Entity (N);
12347 return Corresponding_Spec (N);
12351 return Defining_Entity (N);
12353 end Unique_Defining_Entity;
12359 function Unique_Name (E : Entity_Id) return String is
12361 function Get_Scoped_Name (E : Entity_Id) return String;
12362 -- Return the name of E prefixed by all the names of the scopes to which
12363 -- E belongs, except for Standard.
12365 ---------------------
12366 -- Get_Scoped_Name --
12367 ---------------------
12369 function Get_Scoped_Name (E : Entity_Id) return String is
12370 Name : constant String := Get_Name_String (Chars (E));
12372 if Has_Fully_Qualified_Name (E)
12373 or else Scope (E) = Standard_Standard
12377 return Get_Scoped_Name (Scope (E)) & "__" & Name;
12379 end Get_Scoped_Name;
12381 -- Start of processing for Unique_Name
12384 if E = Standard_Standard then
12385 return Get_Name_String (Name_Standard);
12387 elsif Scope (E) = Standard_Standard then
12388 return Get_Name_String (Name_Standard) & "__" &
12389 Get_Name_String (Chars (E));
12392 return Get_Scoped_Name (E);
12396 --------------------------
12397 -- Unit_Declaration_Node --
12398 --------------------------
12400 function Unit_Declaration_Node (Unit_Id : Entity_Id) return Node_Id is
12401 N : Node_Id := Parent (Unit_Id);
12404 -- Predefined operators do not have a full function declaration
12406 if Ekind (Unit_Id) = E_Operator then
12410 -- Isn't there some better way to express the following ???
12412 while Nkind (N) /= N_Abstract_Subprogram_Declaration
12413 and then Nkind (N) /= N_Formal_Package_Declaration
12414 and then Nkind (N) /= N_Function_Instantiation
12415 and then Nkind (N) /= N_Generic_Package_Declaration
12416 and then Nkind (N) /= N_Generic_Subprogram_Declaration
12417 and then Nkind (N) /= N_Package_Declaration
12418 and then Nkind (N) /= N_Package_Body
12419 and then Nkind (N) /= N_Package_Instantiation
12420 and then Nkind (N) /= N_Package_Renaming_Declaration
12421 and then Nkind (N) /= N_Procedure_Instantiation
12422 and then Nkind (N) /= N_Protected_Body
12423 and then Nkind (N) /= N_Subprogram_Declaration
12424 and then Nkind (N) /= N_Subprogram_Body
12425 and then Nkind (N) /= N_Subprogram_Body_Stub
12426 and then Nkind (N) /= N_Subprogram_Renaming_Declaration
12427 and then Nkind (N) /= N_Task_Body
12428 and then Nkind (N) /= N_Task_Type_Declaration
12429 and then Nkind (N) not in N_Formal_Subprogram_Declaration
12430 and then Nkind (N) not in N_Generic_Renaming_Declaration
12433 pragma Assert (Present (N));
12437 end Unit_Declaration_Node;
12439 ---------------------
12440 -- Unit_Is_Visible --
12441 ---------------------
12443 function Unit_Is_Visible (U : Entity_Id) return Boolean is
12444 Curr : constant Node_Id := Cunit (Current_Sem_Unit);
12445 Curr_Entity : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
12447 function Unit_In_Parent_Context (Par_Unit : Node_Id) return Boolean;
12448 -- For a child unit, check whether unit appears in a with_clause
12451 function Unit_In_Context (Comp_Unit : Node_Id) return Boolean;
12452 -- Scan the context clause of one compilation unit looking for a
12453 -- with_clause for the unit in question.
12455 ----------------------------
12456 -- Unit_In_Parent_Context --
12457 ----------------------------
12459 function Unit_In_Parent_Context (Par_Unit : Node_Id) return Boolean is
12461 if Unit_In_Context (Par_Unit) then
12464 elsif Is_Child_Unit (Defining_Entity (Unit (Par_Unit))) then
12465 return Unit_In_Parent_Context (Parent_Spec (Unit (Par_Unit)));
12470 end Unit_In_Parent_Context;
12472 ---------------------
12473 -- Unit_In_Context --
12474 ---------------------
12476 function Unit_In_Context (Comp_Unit : Node_Id) return Boolean is
12480 Clause := First (Context_Items (Comp_Unit));
12481 while Present (Clause) loop
12482 if Nkind (Clause) = N_With_Clause then
12483 if Library_Unit (Clause) = U then
12486 -- The with_clause may denote a renaming of the unit we are
12487 -- looking for, eg. Text_IO which renames Ada.Text_IO.
12490 Renamed_Entity (Entity (Name (Clause))) =
12491 Defining_Entity (Unit (U))
12501 end Unit_In_Context;
12503 -- Start of processing for Unit_Is_Visible
12506 -- The currrent unit is directly visible
12511 elsif Unit_In_Context (Curr) then
12514 -- If the current unit is a body, check the context of the spec
12516 elsif Nkind (Unit (Curr)) = N_Package_Body
12518 (Nkind (Unit (Curr)) = N_Subprogram_Body
12519 and then not Acts_As_Spec (Unit (Curr)))
12521 if Unit_In_Context (Library_Unit (Curr)) then
12526 -- If the spec is a child unit, examine the parents
12528 if Is_Child_Unit (Curr_Entity) then
12529 if Nkind (Unit (Curr)) in N_Unit_Body then
12531 Unit_In_Parent_Context
12532 (Parent_Spec (Unit (Library_Unit (Curr))));
12534 return Unit_In_Parent_Context (Parent_Spec (Unit (Curr)));
12540 end Unit_Is_Visible;
12542 ------------------------------
12543 -- Universal_Interpretation --
12544 ------------------------------
12546 function Universal_Interpretation (Opnd : Node_Id) return Entity_Id is
12547 Index : Interp_Index;
12551 -- The argument may be a formal parameter of an operator or subprogram
12552 -- with multiple interpretations, or else an expression for an actual.
12554 if Nkind (Opnd) = N_Defining_Identifier
12555 or else not Is_Overloaded (Opnd)
12557 if Etype (Opnd) = Universal_Integer
12558 or else Etype (Opnd) = Universal_Real
12560 return Etype (Opnd);
12566 Get_First_Interp (Opnd, Index, It);
12567 while Present (It.Typ) loop
12568 if It.Typ = Universal_Integer
12569 or else It.Typ = Universal_Real
12574 Get_Next_Interp (Index, It);
12579 end Universal_Interpretation;
12585 function Unqualify (Expr : Node_Id) return Node_Id is
12587 -- Recurse to handle unlikely case of multiple levels of qualification
12589 if Nkind (Expr) = N_Qualified_Expression then
12590 return Unqualify (Expression (Expr));
12592 -- Normal case, not a qualified expression
12599 -----------------------
12600 -- Visible_Ancestors --
12601 -----------------------
12603 function Visible_Ancestors (Typ : Entity_Id) return Elist_Id is
12609 pragma Assert (Is_Record_Type (Typ)
12610 and then Is_Tagged_Type (Typ));
12612 -- Collect all the parents and progenitors of Typ. If the full-view of
12613 -- private parents and progenitors is available then it is used to
12614 -- generate the list of visible ancestors; otherwise their partial
12615 -- view is added to the resulting list.
12620 Use_Full_View => True);
12624 Ifaces_List => List_2,
12625 Exclude_Parents => True,
12626 Use_Full_View => True);
12628 -- Join the two lists. Avoid duplications because an interface may
12629 -- simultaneously be parent and progenitor of a type.
12631 Elmt := First_Elmt (List_2);
12632 while Present (Elmt) loop
12633 Append_Unique_Elmt (Node (Elmt), List_1);
12638 end Visible_Ancestors;
12640 ----------------------
12641 -- Within_Init_Proc --
12642 ----------------------
12644 function Within_Init_Proc return Boolean is
12648 S := Current_Scope;
12649 while not Is_Overloadable (S) loop
12650 if S = Standard_Standard then
12657 return Is_Init_Proc (S);
12658 end Within_Init_Proc;
12664 procedure Wrong_Type (Expr : Node_Id; Expected_Type : Entity_Id) is
12665 Found_Type : constant Entity_Id := First_Subtype (Etype (Expr));
12666 Expec_Type : constant Entity_Id := First_Subtype (Expected_Type);
12668 Matching_Field : Entity_Id;
12669 -- Entity to give a more precise suggestion on how to write a one-
12670 -- element positional aggregate.
12672 function Has_One_Matching_Field return Boolean;
12673 -- Determines if Expec_Type is a record type with a single component or
12674 -- discriminant whose type matches the found type or is one dimensional
12675 -- array whose component type matches the found type.
12677 ----------------------------
12678 -- Has_One_Matching_Field --
12679 ----------------------------
12681 function Has_One_Matching_Field return Boolean is
12685 Matching_Field := Empty;
12687 if Is_Array_Type (Expec_Type)
12688 and then Number_Dimensions (Expec_Type) = 1
12690 Covers (Etype (Component_Type (Expec_Type)), Found_Type)
12692 -- Use type name if available. This excludes multidimensional
12693 -- arrays and anonymous arrays.
12695 if Comes_From_Source (Expec_Type) then
12696 Matching_Field := Expec_Type;
12698 -- For an assignment, use name of target
12700 elsif Nkind (Parent (Expr)) = N_Assignment_Statement
12701 and then Is_Entity_Name (Name (Parent (Expr)))
12703 Matching_Field := Entity (Name (Parent (Expr)));
12708 elsif not Is_Record_Type (Expec_Type) then
12712 E := First_Entity (Expec_Type);
12717 elsif (Ekind (E) /= E_Discriminant
12718 and then Ekind (E) /= E_Component)
12719 or else (Chars (E) = Name_uTag
12720 or else Chars (E) = Name_uParent)
12729 if not Covers (Etype (E), Found_Type) then
12732 elsif Present (Next_Entity (E)) then
12736 Matching_Field := E;
12740 end Has_One_Matching_Field;
12742 -- Start of processing for Wrong_Type
12745 -- Don't output message if either type is Any_Type, or if a message
12746 -- has already been posted for this node. We need to do the latter
12747 -- check explicitly (it is ordinarily done in Errout), because we
12748 -- are using ! to force the output of the error messages.
12750 if Expec_Type = Any_Type
12751 or else Found_Type = Any_Type
12752 or else Error_Posted (Expr)
12756 -- In an instance, there is an ongoing problem with completion of
12757 -- type derived from private types. Their structure is what Gigi
12758 -- expects, but the Etype is the parent type rather than the
12759 -- derived private type itself. Do not flag error in this case. The
12760 -- private completion is an entity without a parent, like an Itype.
12761 -- Similarly, full and partial views may be incorrect in the instance.
12762 -- There is no simple way to insure that it is consistent ???
12764 elsif In_Instance then
12765 if Etype (Etype (Expr)) = Etype (Expected_Type)
12767 (Has_Private_Declaration (Expected_Type)
12768 or else Has_Private_Declaration (Etype (Expr)))
12769 and then No (Parent (Expected_Type))
12775 -- An interesting special check. If the expression is parenthesized
12776 -- and its type corresponds to the type of the sole component of the
12777 -- expected record type, or to the component type of the expected one
12778 -- dimensional array type, then assume we have a bad aggregate attempt.
12780 if Nkind (Expr) in N_Subexpr
12781 and then Paren_Count (Expr) /= 0
12782 and then Has_One_Matching_Field
12784 Error_Msg_N ("positional aggregate cannot have one component", Expr);
12785 if Present (Matching_Field) then
12786 if Is_Array_Type (Expec_Type) then
12788 ("\write instead `&''First ='> ...`", Expr, Matching_Field);
12792 ("\write instead `& ='> ...`", Expr, Matching_Field);
12796 -- Another special check, if we are looking for a pool-specific access
12797 -- type and we found an E_Access_Attribute_Type, then we have the case
12798 -- of an Access attribute being used in a context which needs a pool-
12799 -- specific type, which is never allowed. The one extra check we make
12800 -- is that the expected designated type covers the Found_Type.
12802 elsif Is_Access_Type (Expec_Type)
12803 and then Ekind (Found_Type) = E_Access_Attribute_Type
12804 and then Ekind (Base_Type (Expec_Type)) /= E_General_Access_Type
12805 and then Ekind (Base_Type (Expec_Type)) /= E_Anonymous_Access_Type
12807 (Designated_Type (Expec_Type), Designated_Type (Found_Type))
12809 Error_Msg_N -- CODEFIX
12810 ("result must be general access type!", Expr);
12811 Error_Msg_NE -- CODEFIX
12812 ("add ALL to }!", Expr, Expec_Type);
12814 -- Another special check, if the expected type is an integer type,
12815 -- but the expression is of type System.Address, and the parent is
12816 -- an addition or subtraction operation whose left operand is the
12817 -- expression in question and whose right operand is of an integral
12818 -- type, then this is an attempt at address arithmetic, so give
12819 -- appropriate message.
12821 elsif Is_Integer_Type (Expec_Type)
12822 and then Is_RTE (Found_Type, RE_Address)
12823 and then (Nkind (Parent (Expr)) = N_Op_Add
12825 Nkind (Parent (Expr)) = N_Op_Subtract)
12826 and then Expr = Left_Opnd (Parent (Expr))
12827 and then Is_Integer_Type (Etype (Right_Opnd (Parent (Expr))))
12830 ("address arithmetic not predefined in package System",
12833 ("\possible missing with/use of System.Storage_Elements",
12837 -- If the expected type is an anonymous access type, as for access
12838 -- parameters and discriminants, the error is on the designated types.
12840 elsif Ekind (Expec_Type) = E_Anonymous_Access_Type then
12841 if Comes_From_Source (Expec_Type) then
12842 Error_Msg_NE ("expected}!", Expr, Expec_Type);
12845 ("expected an access type with designated}",
12846 Expr, Designated_Type (Expec_Type));
12849 if Is_Access_Type (Found_Type)
12850 and then not Comes_From_Source (Found_Type)
12853 ("\\found an access type with designated}!",
12854 Expr, Designated_Type (Found_Type));
12856 if From_With_Type (Found_Type) then
12857 Error_Msg_NE ("\\found incomplete}!", Expr, Found_Type);
12858 Error_Msg_Qual_Level := 99;
12859 Error_Msg_NE -- CODEFIX
12860 ("\\missing `WITH &;", Expr, Scope (Found_Type));
12861 Error_Msg_Qual_Level := 0;
12863 Error_Msg_NE ("found}!", Expr, Found_Type);
12867 -- Normal case of one type found, some other type expected
12870 -- If the names of the two types are the same, see if some number
12871 -- of levels of qualification will help. Don't try more than three
12872 -- levels, and if we get to standard, it's no use (and probably
12873 -- represents an error in the compiler) Also do not bother with
12874 -- internal scope names.
12877 Expec_Scope : Entity_Id;
12878 Found_Scope : Entity_Id;
12881 Expec_Scope := Expec_Type;
12882 Found_Scope := Found_Type;
12884 for Levels in Int range 0 .. 3 loop
12885 if Chars (Expec_Scope) /= Chars (Found_Scope) then
12886 Error_Msg_Qual_Level := Levels;
12890 Expec_Scope := Scope (Expec_Scope);
12891 Found_Scope := Scope (Found_Scope);
12893 exit when Expec_Scope = Standard_Standard
12894 or else Found_Scope = Standard_Standard
12895 or else not Comes_From_Source (Expec_Scope)
12896 or else not Comes_From_Source (Found_Scope);
12900 if Is_Record_Type (Expec_Type)
12901 and then Present (Corresponding_Remote_Type (Expec_Type))
12903 Error_Msg_NE ("expected}!", Expr,
12904 Corresponding_Remote_Type (Expec_Type));
12906 Error_Msg_NE ("expected}!", Expr, Expec_Type);
12909 if Is_Entity_Name (Expr)
12910 and then Is_Package_Or_Generic_Package (Entity (Expr))
12912 Error_Msg_N ("\\found package name!", Expr);
12914 elsif Is_Entity_Name (Expr)
12916 (Ekind (Entity (Expr)) = E_Procedure
12918 Ekind (Entity (Expr)) = E_Generic_Procedure)
12920 if Ekind (Expec_Type) = E_Access_Subprogram_Type then
12922 ("found procedure name, possibly missing Access attribute!",
12926 ("\\found procedure name instead of function!", Expr);
12929 elsif Nkind (Expr) = N_Function_Call
12930 and then Ekind (Expec_Type) = E_Access_Subprogram_Type
12931 and then Etype (Designated_Type (Expec_Type)) = Etype (Expr)
12932 and then No (Parameter_Associations (Expr))
12935 ("found function name, possibly missing Access attribute!",
12938 -- Catch common error: a prefix or infix operator which is not
12939 -- directly visible because the type isn't.
12941 elsif Nkind (Expr) in N_Op
12942 and then Is_Overloaded (Expr)
12943 and then not Is_Immediately_Visible (Expec_Type)
12944 and then not Is_Potentially_Use_Visible (Expec_Type)
12945 and then not In_Use (Expec_Type)
12946 and then Has_Compatible_Type (Right_Opnd (Expr), Expec_Type)
12949 ("operator of the type is not directly visible!", Expr);
12951 elsif Ekind (Found_Type) = E_Void
12952 and then Present (Parent (Found_Type))
12953 and then Nkind (Parent (Found_Type)) = N_Full_Type_Declaration
12955 Error_Msg_NE ("\\found premature usage of}!", Expr, Found_Type);
12958 Error_Msg_NE ("\\found}!", Expr, Found_Type);
12961 -- A special check for cases like M1 and M2 = 0 where M1 and M2 are
12962 -- of the same modular type, and (M1 and M2) = 0 was intended.
12964 if Expec_Type = Standard_Boolean
12965 and then Is_Modular_Integer_Type (Found_Type)
12966 and then Nkind_In (Parent (Expr), N_Op_And, N_Op_Or, N_Op_Xor)
12967 and then Nkind (Right_Opnd (Parent (Expr))) in N_Op_Compare
12970 Op : constant Node_Id := Right_Opnd (Parent (Expr));
12971 L : constant Node_Id := Left_Opnd (Op);
12972 R : constant Node_Id := Right_Opnd (Op);
12974 -- The case for the message is when the left operand of the
12975 -- comparison is the same modular type, or when it is an
12976 -- integer literal (or other universal integer expression),
12977 -- which would have been typed as the modular type if the
12978 -- parens had been there.
12980 if (Etype (L) = Found_Type
12982 Etype (L) = Universal_Integer)
12983 and then Is_Integer_Type (Etype (R))
12986 ("\\possible missing parens for modular operation", Expr);
12991 -- Reset error message qualification indication
12993 Error_Msg_Qual_Level := 0;