1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2009, 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_Tss; use Exp_Tss;
35 with Exp_Util; use Exp_Util;
36 with Fname; use Fname;
37 with Freeze; use Freeze;
39 with Lib.Xref; use Lib.Xref;
40 with Nlists; use Nlists;
41 with Output; use Output;
43 with Rtsfind; use Rtsfind;
44 with Scans; use Scans;
47 with Sem_Aux; use Sem_Aux;
48 with Sem_Attr; use Sem_Attr;
49 with Sem_Ch8; use Sem_Ch8;
50 with Sem_Disp; use Sem_Disp;
51 with Sem_Eval; use Sem_Eval;
52 with Sem_Res; use Sem_Res;
53 with Sem_SCIL; use Sem_SCIL;
54 with Sem_Type; use Sem_Type;
55 with Sinfo; use Sinfo;
56 with Sinput; use Sinput;
57 with Stand; use Stand;
59 with Stringt; use Stringt;
60 with Targparm; use Targparm;
61 with Tbuild; use Tbuild;
62 with Ttypes; use Ttypes;
63 with Uname; use Uname;
65 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_Threshhold : 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 threshhold 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 -- Local Subprograms --
99 -----------------------
101 function Build_Component_Subtype
104 T : Entity_Id) return Node_Id;
105 -- This function builds the subtype for Build_Actual_Subtype_Of_Component
106 -- and Build_Discriminal_Subtype_Of_Component. C is a list of constraints,
107 -- Loc is the source location, T is the original subtype.
109 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean;
110 -- Subsidiary to Is_Fully_Initialized_Type. For an unconstrained type
111 -- with discriminants whose default values are static, examine only the
112 -- components in the selected variant to determine whether all of them
115 function Has_Null_Extension (T : Entity_Id) return Boolean;
116 -- T is a derived tagged type. Check whether the type extension is null.
117 -- If the parent type is fully initialized, T can be treated as such.
119 ------------------------------
120 -- Abstract_Interface_List --
121 ------------------------------
123 function Abstract_Interface_List (Typ : Entity_Id) return List_Id is
127 if Is_Concurrent_Type (Typ) then
129 -- If we are dealing with a synchronized subtype, go to the base
130 -- type, whose declaration has the interface list.
132 -- Shouldn't this be Declaration_Node???
134 Nod := Parent (Base_Type (Typ));
136 if Nkind (Nod) = N_Full_Type_Declaration then
140 elsif Ekind (Typ) = E_Record_Type_With_Private then
141 if Nkind (Parent (Typ)) = N_Full_Type_Declaration then
142 Nod := Type_Definition (Parent (Typ));
144 elsif Nkind (Parent (Typ)) = N_Private_Type_Declaration then
145 if Present (Full_View (Typ)) then
146 Nod := Type_Definition (Parent (Full_View (Typ)));
148 -- If the full-view is not available we cannot do anything else
149 -- here (the source has errors).
155 -- Support for generic formals with interfaces is still missing ???
157 elsif Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
162 (Nkind (Parent (Typ)) = N_Private_Extension_Declaration);
166 elsif Ekind (Typ) = E_Record_Subtype then
167 Nod := Type_Definition (Parent (Etype (Typ)));
169 elsif Ekind (Typ) = E_Record_Subtype_With_Private then
171 -- Recurse, because parent may still be a private extension. Also
172 -- note that the full view of the subtype or the full view of its
173 -- base type may (both) be unavailable.
175 return Abstract_Interface_List (Etype (Typ));
177 else pragma Assert ((Ekind (Typ)) = E_Record_Type);
178 if Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
179 Nod := Formal_Type_Definition (Parent (Typ));
181 Nod := Type_Definition (Parent (Typ));
185 return Interface_List (Nod);
186 end Abstract_Interface_List;
188 --------------------------------
189 -- Add_Access_Type_To_Process --
190 --------------------------------
192 procedure Add_Access_Type_To_Process (E : Entity_Id; A : Entity_Id) is
196 Ensure_Freeze_Node (E);
197 L := Access_Types_To_Process (Freeze_Node (E));
201 Set_Access_Types_To_Process (Freeze_Node (E), L);
205 end Add_Access_Type_To_Process;
207 ----------------------------
208 -- Add_Global_Declaration --
209 ----------------------------
211 procedure Add_Global_Declaration (N : Node_Id) is
212 Aux_Node : constant Node_Id := Aux_Decls_Node (Cunit (Current_Sem_Unit));
215 if No (Declarations (Aux_Node)) then
216 Set_Declarations (Aux_Node, New_List);
219 Append_To (Declarations (Aux_Node), N);
221 end Add_Global_Declaration;
223 -----------------------
224 -- Alignment_In_Bits --
225 -----------------------
227 function Alignment_In_Bits (E : Entity_Id) return Uint is
229 return Alignment (E) * System_Storage_Unit;
230 end Alignment_In_Bits;
232 -----------------------------------------
233 -- Apply_Compile_Time_Constraint_Error --
234 -----------------------------------------
236 procedure Apply_Compile_Time_Constraint_Error
239 Reason : RT_Exception_Code;
240 Ent : Entity_Id := Empty;
241 Typ : Entity_Id := Empty;
242 Loc : Source_Ptr := No_Location;
243 Rep : Boolean := True;
244 Warn : Boolean := False)
246 Stat : constant Boolean := Is_Static_Expression (N);
247 R_Stat : constant Node_Id :=
248 Make_Raise_Constraint_Error (Sloc (N), Reason => Reason);
259 (Compile_Time_Constraint_Error (N, Msg, Ent, Loc, Warn => Warn));
265 -- Now we replace the node by an N_Raise_Constraint_Error node
266 -- This does not need reanalyzing, so set it as analyzed now.
269 Set_Analyzed (N, True);
272 Set_Raises_Constraint_Error (N);
274 -- Now deal with possible local raise handling
276 Possible_Local_Raise (N, Standard_Constraint_Error);
278 -- If the original expression was marked as static, the result is
279 -- still marked as static, but the Raises_Constraint_Error flag is
280 -- always set so that further static evaluation is not attempted.
283 Set_Is_Static_Expression (N);
285 end Apply_Compile_Time_Constraint_Error;
287 --------------------------
288 -- Build_Actual_Subtype --
289 --------------------------
291 function Build_Actual_Subtype
293 N : Node_Or_Entity_Id) return Node_Id
296 -- Normally Sloc (N), but may point to corresponding body in some cases
298 Constraints : List_Id;
304 Disc_Type : Entity_Id;
310 if Nkind (N) = N_Defining_Identifier then
311 Obj := New_Reference_To (N, Loc);
313 -- If this is a formal parameter of a subprogram declaration, and
314 -- we are compiling the body, we want the declaration for the
315 -- actual subtype to carry the source position of the body, to
316 -- prevent anomalies in gdb when stepping through the code.
318 if Is_Formal (N) then
320 Decl : constant Node_Id := Unit_Declaration_Node (Scope (N));
322 if Nkind (Decl) = N_Subprogram_Declaration
323 and then Present (Corresponding_Body (Decl))
325 Loc := Sloc (Corresponding_Body (Decl));
334 if Is_Array_Type (T) then
335 Constraints := New_List;
336 for J in 1 .. Number_Dimensions (T) loop
338 -- Build an array subtype declaration with the nominal subtype and
339 -- the bounds of the actual. Add the declaration in front of the
340 -- local declarations for the subprogram, for analysis before any
341 -- reference to the formal in the body.
344 Make_Attribute_Reference (Loc,
346 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
347 Attribute_Name => Name_First,
348 Expressions => New_List (
349 Make_Integer_Literal (Loc, J)));
352 Make_Attribute_Reference (Loc,
354 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
355 Attribute_Name => Name_Last,
356 Expressions => New_List (
357 Make_Integer_Literal (Loc, J)));
359 Append (Make_Range (Loc, Lo, Hi), Constraints);
362 -- If the type has unknown discriminants there is no constrained
363 -- subtype to build. This is never called for a formal or for a
364 -- lhs, so returning the type is ok ???
366 elsif Has_Unknown_Discriminants (T) then
370 Constraints := New_List;
372 -- Type T is a generic derived type, inherit the discriminants from
375 if Is_Private_Type (T)
376 and then No (Full_View (T))
378 -- T was flagged as an error if it was declared as a formal
379 -- derived type with known discriminants. In this case there
380 -- is no need to look at the parent type since T already carries
381 -- its own discriminants.
383 and then not Error_Posted (T)
385 Disc_Type := Etype (Base_Type (T));
390 Discr := First_Discriminant (Disc_Type);
391 while Present (Discr) loop
392 Append_To (Constraints,
393 Make_Selected_Component (Loc,
395 Duplicate_Subexpr_No_Checks (Obj),
396 Selector_Name => New_Occurrence_Of (Discr, Loc)));
397 Next_Discriminant (Discr);
402 Make_Defining_Identifier (Loc,
403 Chars => New_Internal_Name ('S'));
404 Set_Is_Internal (Subt);
407 Make_Subtype_Declaration (Loc,
408 Defining_Identifier => Subt,
409 Subtype_Indication =>
410 Make_Subtype_Indication (Loc,
411 Subtype_Mark => New_Reference_To (T, Loc),
413 Make_Index_Or_Discriminant_Constraint (Loc,
414 Constraints => Constraints)));
416 Mark_Rewrite_Insertion (Decl);
418 end Build_Actual_Subtype;
420 ---------------------------------------
421 -- Build_Actual_Subtype_Of_Component --
422 ---------------------------------------
424 function Build_Actual_Subtype_Of_Component
426 N : Node_Id) return Node_Id
428 Loc : constant Source_Ptr := Sloc (N);
429 P : constant Node_Id := Prefix (N);
432 Indx_Type : Entity_Id;
434 Deaccessed_T : Entity_Id;
435 -- This is either a copy of T, or if T is an access type, then it is
436 -- the directly designated type of this access type.
438 function Build_Actual_Array_Constraint return List_Id;
439 -- If one or more of the bounds of the component depends on
440 -- discriminants, build actual constraint using the discriminants
443 function Build_Actual_Record_Constraint return List_Id;
444 -- Similar to previous one, for discriminated components constrained
445 -- by the discriminant of the enclosing object.
447 -----------------------------------
448 -- Build_Actual_Array_Constraint --
449 -----------------------------------
451 function Build_Actual_Array_Constraint return List_Id is
452 Constraints : constant List_Id := New_List;
460 Indx := First_Index (Deaccessed_T);
461 while Present (Indx) loop
462 Old_Lo := Type_Low_Bound (Etype (Indx));
463 Old_Hi := Type_High_Bound (Etype (Indx));
465 if Denotes_Discriminant (Old_Lo) then
467 Make_Selected_Component (Loc,
468 Prefix => New_Copy_Tree (P),
469 Selector_Name => New_Occurrence_Of (Entity (Old_Lo), Loc));
472 Lo := New_Copy_Tree (Old_Lo);
474 -- The new bound will be reanalyzed in the enclosing
475 -- declaration. For literal bounds that come from a type
476 -- declaration, the type of the context must be imposed, so
477 -- insure that analysis will take place. For non-universal
478 -- types this is not strictly necessary.
480 Set_Analyzed (Lo, False);
483 if Denotes_Discriminant (Old_Hi) then
485 Make_Selected_Component (Loc,
486 Prefix => New_Copy_Tree (P),
487 Selector_Name => New_Occurrence_Of (Entity (Old_Hi), Loc));
490 Hi := New_Copy_Tree (Old_Hi);
491 Set_Analyzed (Hi, False);
494 Append (Make_Range (Loc, Lo, Hi), Constraints);
499 end Build_Actual_Array_Constraint;
501 ------------------------------------
502 -- Build_Actual_Record_Constraint --
503 ------------------------------------
505 function Build_Actual_Record_Constraint return List_Id is
506 Constraints : constant List_Id := New_List;
511 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
512 while Present (D) loop
513 if Denotes_Discriminant (Node (D)) then
514 D_Val := Make_Selected_Component (Loc,
515 Prefix => New_Copy_Tree (P),
516 Selector_Name => New_Occurrence_Of (Entity (Node (D)), Loc));
519 D_Val := New_Copy_Tree (Node (D));
522 Append (D_Val, Constraints);
527 end Build_Actual_Record_Constraint;
529 -- Start of processing for Build_Actual_Subtype_Of_Component
532 -- Why the test for Spec_Expression mode here???
534 if In_Spec_Expression then
537 -- More comments for the rest of this body would be good ???
539 elsif Nkind (N) = N_Explicit_Dereference then
540 if Is_Composite_Type (T)
541 and then not Is_Constrained (T)
542 and then not (Is_Class_Wide_Type (T)
543 and then Is_Constrained (Root_Type (T)))
544 and then not Has_Unknown_Discriminants (T)
546 -- If the type of the dereference is already constrained, it is an
549 if Is_Array_Type (Etype (N))
550 and then Is_Constrained (Etype (N))
554 Remove_Side_Effects (P);
555 return Build_Actual_Subtype (T, N);
562 if Ekind (T) = E_Access_Subtype then
563 Deaccessed_T := Designated_Type (T);
568 if Ekind (Deaccessed_T) = E_Array_Subtype then
569 Id := First_Index (Deaccessed_T);
570 while Present (Id) loop
571 Indx_Type := Underlying_Type (Etype (Id));
573 if Denotes_Discriminant (Type_Low_Bound (Indx_Type))
575 Denotes_Discriminant (Type_High_Bound (Indx_Type))
577 Remove_Side_Effects (P);
579 Build_Component_Subtype
580 (Build_Actual_Array_Constraint, Loc, Base_Type (T));
586 elsif Is_Composite_Type (Deaccessed_T)
587 and then Has_Discriminants (Deaccessed_T)
588 and then not Has_Unknown_Discriminants (Deaccessed_T)
590 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
591 while Present (D) loop
592 if Denotes_Discriminant (Node (D)) then
593 Remove_Side_Effects (P);
595 Build_Component_Subtype (
596 Build_Actual_Record_Constraint, Loc, Base_Type (T));
603 -- If none of the above, the actual and nominal subtypes are the same
606 end Build_Actual_Subtype_Of_Component;
608 -----------------------------
609 -- Build_Component_Subtype --
610 -----------------------------
612 function Build_Component_Subtype
615 T : Entity_Id) return Node_Id
621 -- Unchecked_Union components do not require component subtypes
623 if Is_Unchecked_Union (T) then
628 Make_Defining_Identifier (Loc,
629 Chars => New_Internal_Name ('S'));
630 Set_Is_Internal (Subt);
633 Make_Subtype_Declaration (Loc,
634 Defining_Identifier => Subt,
635 Subtype_Indication =>
636 Make_Subtype_Indication (Loc,
637 Subtype_Mark => New_Reference_To (Base_Type (T), Loc),
639 Make_Index_Or_Discriminant_Constraint (Loc,
642 Mark_Rewrite_Insertion (Decl);
644 end Build_Component_Subtype;
646 ---------------------------
647 -- Build_Default_Subtype --
648 ---------------------------
650 function Build_Default_Subtype
652 N : Node_Id) return Entity_Id
654 Loc : constant Source_Ptr := Sloc (N);
658 if not Has_Discriminants (T) or else Is_Constrained (T) then
662 Disc := First_Discriminant (T);
664 if No (Discriminant_Default_Value (Disc)) then
669 Act : constant Entity_Id :=
670 Make_Defining_Identifier (Loc,
671 Chars => New_Internal_Name ('S'));
673 Constraints : constant List_Id := New_List;
677 while Present (Disc) loop
678 Append_To (Constraints,
679 New_Copy_Tree (Discriminant_Default_Value (Disc)));
680 Next_Discriminant (Disc);
684 Make_Subtype_Declaration (Loc,
685 Defining_Identifier => Act,
686 Subtype_Indication =>
687 Make_Subtype_Indication (Loc,
688 Subtype_Mark => New_Occurrence_Of (T, Loc),
690 Make_Index_Or_Discriminant_Constraint (Loc,
691 Constraints => Constraints)));
693 Insert_Action (N, Decl);
697 end Build_Default_Subtype;
699 --------------------------------------------
700 -- Build_Discriminal_Subtype_Of_Component --
701 --------------------------------------------
703 function Build_Discriminal_Subtype_Of_Component
704 (T : Entity_Id) return Node_Id
706 Loc : constant Source_Ptr := Sloc (T);
710 function Build_Discriminal_Array_Constraint return List_Id;
711 -- If one or more of the bounds of the component depends on
712 -- discriminants, build actual constraint using the discriminants
715 function Build_Discriminal_Record_Constraint return List_Id;
716 -- Similar to previous one, for discriminated components constrained
717 -- by the discriminant of the enclosing object.
719 ----------------------------------------
720 -- Build_Discriminal_Array_Constraint --
721 ----------------------------------------
723 function Build_Discriminal_Array_Constraint return List_Id is
724 Constraints : constant List_Id := New_List;
732 Indx := First_Index (T);
733 while Present (Indx) loop
734 Old_Lo := Type_Low_Bound (Etype (Indx));
735 Old_Hi := Type_High_Bound (Etype (Indx));
737 if Denotes_Discriminant (Old_Lo) then
738 Lo := New_Occurrence_Of (Discriminal (Entity (Old_Lo)), Loc);
741 Lo := New_Copy_Tree (Old_Lo);
744 if Denotes_Discriminant (Old_Hi) then
745 Hi := New_Occurrence_Of (Discriminal (Entity (Old_Hi)), Loc);
748 Hi := New_Copy_Tree (Old_Hi);
751 Append (Make_Range (Loc, Lo, Hi), Constraints);
756 end Build_Discriminal_Array_Constraint;
758 -----------------------------------------
759 -- Build_Discriminal_Record_Constraint --
760 -----------------------------------------
762 function Build_Discriminal_Record_Constraint return List_Id is
763 Constraints : constant List_Id := New_List;
768 D := First_Elmt (Discriminant_Constraint (T));
769 while Present (D) loop
770 if Denotes_Discriminant (Node (D)) then
772 New_Occurrence_Of (Discriminal (Entity (Node (D))), Loc);
775 D_Val := New_Copy_Tree (Node (D));
778 Append (D_Val, Constraints);
783 end Build_Discriminal_Record_Constraint;
785 -- Start of processing for Build_Discriminal_Subtype_Of_Component
788 if Ekind (T) = E_Array_Subtype then
789 Id := First_Index (T);
790 while Present (Id) loop
791 if Denotes_Discriminant (Type_Low_Bound (Etype (Id))) or else
792 Denotes_Discriminant (Type_High_Bound (Etype (Id)))
794 return Build_Component_Subtype
795 (Build_Discriminal_Array_Constraint, Loc, T);
801 elsif Ekind (T) = E_Record_Subtype
802 and then Has_Discriminants (T)
803 and then not Has_Unknown_Discriminants (T)
805 D := First_Elmt (Discriminant_Constraint (T));
806 while Present (D) loop
807 if Denotes_Discriminant (Node (D)) then
808 return Build_Component_Subtype
809 (Build_Discriminal_Record_Constraint, Loc, T);
816 -- If none of the above, the actual and nominal subtypes are the same
819 end Build_Discriminal_Subtype_Of_Component;
821 ------------------------------
822 -- Build_Elaboration_Entity --
823 ------------------------------
825 procedure Build_Elaboration_Entity (N : Node_Id; Spec_Id : Entity_Id) is
826 Loc : constant Source_Ptr := Sloc (N);
828 Elab_Ent : Entity_Id;
830 procedure Set_Package_Name (Ent : Entity_Id);
831 -- Given an entity, sets the fully qualified name of the entity in
832 -- Name_Buffer, with components separated by double underscores. This
833 -- is a recursive routine that climbs the scope chain to Standard.
835 ----------------------
836 -- Set_Package_Name --
837 ----------------------
839 procedure Set_Package_Name (Ent : Entity_Id) is
841 if Scope (Ent) /= Standard_Standard then
842 Set_Package_Name (Scope (Ent));
845 Nam : constant String := Get_Name_String (Chars (Ent));
847 Name_Buffer (Name_Len + 1) := '_';
848 Name_Buffer (Name_Len + 2) := '_';
849 Name_Buffer (Name_Len + 3 .. Name_Len + Nam'Length + 2) := Nam;
850 Name_Len := Name_Len + Nam'Length + 2;
854 Get_Name_String (Chars (Ent));
856 end Set_Package_Name;
858 -- Start of processing for Build_Elaboration_Entity
861 -- Ignore if already constructed
863 if Present (Elaboration_Entity (Spec_Id)) then
867 -- Construct name of elaboration entity as xxx_E, where xxx is the unit
868 -- name with dots replaced by double underscore. We have to manually
869 -- construct this name, since it will be elaborated in the outer scope,
870 -- and thus will not have the unit name automatically prepended.
872 Set_Package_Name (Spec_Id);
876 Name_Buffer (Name_Len + 1) := '_';
877 Name_Buffer (Name_Len + 2) := 'E';
878 Name_Len := Name_Len + 2;
880 -- Create elaboration flag
883 Make_Defining_Identifier (Loc, Chars => Name_Find);
884 Set_Elaboration_Entity (Spec_Id, Elab_Ent);
887 Make_Object_Declaration (Loc,
888 Defining_Identifier => Elab_Ent,
890 New_Occurrence_Of (Standard_Boolean, Loc),
892 New_Occurrence_Of (Standard_False, Loc));
894 Push_Scope (Standard_Standard);
895 Add_Global_Declaration (Decl);
898 -- Reset True_Constant indication, since we will indeed assign a value
899 -- to the variable in the binder main. We also kill the Current_Value
900 -- and Last_Assignment fields for the same reason.
902 Set_Is_True_Constant (Elab_Ent, False);
903 Set_Current_Value (Elab_Ent, Empty);
904 Set_Last_Assignment (Elab_Ent, Empty);
906 -- We do not want any further qualification of the name (if we did
907 -- not do this, we would pick up the name of the generic package
908 -- in the case of a library level generic instantiation).
910 Set_Has_Qualified_Name (Elab_Ent);
911 Set_Has_Fully_Qualified_Name (Elab_Ent);
912 end Build_Elaboration_Entity;
914 -----------------------------------
915 -- Cannot_Raise_Constraint_Error --
916 -----------------------------------
918 function Cannot_Raise_Constraint_Error (Expr : Node_Id) return Boolean is
920 if Compile_Time_Known_Value (Expr) then
923 elsif Do_Range_Check (Expr) then
926 elsif Raises_Constraint_Error (Expr) then
934 when N_Expanded_Name =>
937 when N_Selected_Component =>
938 return not Do_Discriminant_Check (Expr);
940 when N_Attribute_Reference =>
941 if Do_Overflow_Check (Expr) then
944 elsif No (Expressions (Expr)) then
952 N := First (Expressions (Expr));
953 while Present (N) loop
954 if Cannot_Raise_Constraint_Error (N) then
965 when N_Type_Conversion =>
966 if Do_Overflow_Check (Expr)
967 or else Do_Length_Check (Expr)
968 or else Do_Tag_Check (Expr)
973 Cannot_Raise_Constraint_Error (Expression (Expr));
976 when N_Unchecked_Type_Conversion =>
977 return Cannot_Raise_Constraint_Error (Expression (Expr));
980 if Do_Overflow_Check (Expr) then
984 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
991 if Do_Division_Check (Expr)
992 or else Do_Overflow_Check (Expr)
997 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
999 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1018 N_Op_Shift_Right_Arithmetic |
1022 if Do_Overflow_Check (Expr) then
1026 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
1028 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1035 end Cannot_Raise_Constraint_Error;
1037 -----------------------------------------
1038 -- Check_Dynamically_Tagged_Expression --
1039 -----------------------------------------
1041 procedure Check_Dynamically_Tagged_Expression
1044 Related_Nod : Node_Id)
1047 pragma Assert (Is_Tagged_Type (Typ));
1049 -- In order to avoid spurious errors when analyzing the expanded code,
1050 -- this check is done only for nodes that come from source and for
1051 -- actuals of generic instantiations.
1053 if (Comes_From_Source (Related_Nod)
1054 or else In_Generic_Actual (Expr))
1055 and then (Is_Class_Wide_Type (Etype (Expr))
1056 or else Is_Dynamically_Tagged (Expr))
1057 and then Is_Tagged_Type (Typ)
1058 and then not Is_Class_Wide_Type (Typ)
1060 Error_Msg_N ("dynamically tagged expression not allowed!", Expr);
1062 end Check_Dynamically_Tagged_Expression;
1064 --------------------------
1065 -- Check_Fully_Declared --
1066 --------------------------
1068 procedure Check_Fully_Declared (T : Entity_Id; N : Node_Id) is
1070 if Ekind (T) = E_Incomplete_Type then
1072 -- Ada 2005 (AI-50217): If the type is available through a limited
1073 -- with_clause, verify that its full view has been analyzed.
1075 if From_With_Type (T)
1076 and then Present (Non_Limited_View (T))
1077 and then Ekind (Non_Limited_View (T)) /= E_Incomplete_Type
1079 -- The non-limited view is fully declared
1084 ("premature usage of incomplete}", N, First_Subtype (T));
1087 -- Need comments for these tests ???
1089 elsif Has_Private_Component (T)
1090 and then not Is_Generic_Type (Root_Type (T))
1091 and then not In_Spec_Expression
1093 -- Special case: if T is the anonymous type created for a single
1094 -- task or protected object, use the name of the source object.
1096 if Is_Concurrent_Type (T)
1097 and then not Comes_From_Source (T)
1098 and then Nkind (N) = N_Object_Declaration
1100 Error_Msg_NE ("type of& has incomplete component", N,
1101 Defining_Identifier (N));
1105 ("premature usage of incomplete}", N, First_Subtype (T));
1108 end Check_Fully_Declared;
1110 -------------------------
1111 -- Check_Nested_Access --
1112 -------------------------
1114 procedure Check_Nested_Access (Ent : Entity_Id) is
1115 Scop : constant Entity_Id := Current_Scope;
1116 Current_Subp : Entity_Id;
1117 Enclosing : Entity_Id;
1120 -- Currently only enabled for VM back-ends for efficiency, should we
1121 -- enable it more systematically ???
1123 -- Check for Is_Imported needs commenting below ???
1125 if VM_Target /= No_VM
1126 and then (Ekind (Ent) = E_Variable
1128 Ekind (Ent) = E_Constant
1130 Ekind (Ent) = E_Loop_Parameter)
1131 and then Scope (Ent) /= Empty
1132 and then not Is_Library_Level_Entity (Ent)
1133 and then not Is_Imported (Ent)
1135 if Is_Subprogram (Scop)
1136 or else Is_Generic_Subprogram (Scop)
1137 or else Is_Entry (Scop)
1139 Current_Subp := Scop;
1141 Current_Subp := Current_Subprogram;
1144 Enclosing := Enclosing_Subprogram (Ent);
1146 if Enclosing /= Empty
1147 and then Enclosing /= Current_Subp
1149 Set_Has_Up_Level_Access (Ent, True);
1152 end Check_Nested_Access;
1154 ------------------------------------------
1155 -- Check_Potentially_Blocking_Operation --
1156 ------------------------------------------
1158 procedure Check_Potentially_Blocking_Operation (N : Node_Id) is
1161 -- N is one of the potentially blocking operations listed in 9.5.1(8).
1162 -- When pragma Detect_Blocking is active, the run time will raise
1163 -- Program_Error. Here we only issue a warning, since we generally
1164 -- support the use of potentially blocking operations in the absence
1167 -- Indirect blocking through a subprogram call cannot be diagnosed
1168 -- statically without interprocedural analysis, so we do not attempt
1171 S := Scope (Current_Scope);
1172 while Present (S) and then S /= Standard_Standard loop
1173 if Is_Protected_Type (S) then
1175 ("potentially blocking operation in protected operation?", N);
1182 end Check_Potentially_Blocking_Operation;
1184 ------------------------------
1185 -- Check_Unprotected_Access --
1186 ------------------------------
1188 procedure Check_Unprotected_Access
1192 Cont_Encl_Typ : Entity_Id;
1193 Pref_Encl_Typ : Entity_Id;
1195 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id;
1196 -- Check whether Obj is a private component of a protected object.
1197 -- Return the protected type where the component resides, Empty
1200 function Is_Public_Operation return Boolean;
1201 -- Verify that the enclosing operation is callable from outside the
1202 -- protected object, to minimize false positives.
1204 ------------------------------
1205 -- Enclosing_Protected_Type --
1206 ------------------------------
1208 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id is
1210 if Is_Entity_Name (Obj) then
1212 Ent : Entity_Id := Entity (Obj);
1215 -- The object can be a renaming of a private component, use
1216 -- the original record component.
1218 if Is_Prival (Ent) then
1219 Ent := Prival_Link (Ent);
1222 if Is_Protected_Type (Scope (Ent)) then
1228 -- For indexed and selected components, recursively check the prefix
1230 if Nkind_In (Obj, N_Indexed_Component, N_Selected_Component) then
1231 return Enclosing_Protected_Type (Prefix (Obj));
1233 -- The object does not denote a protected component
1238 end Enclosing_Protected_Type;
1240 -------------------------
1241 -- Is_Public_Operation --
1242 -------------------------
1244 function Is_Public_Operation return Boolean is
1251 and then S /= Pref_Encl_Typ
1253 if Scope (S) = Pref_Encl_Typ then
1254 E := First_Entity (Pref_Encl_Typ);
1256 and then E /= First_Private_Entity (Pref_Encl_Typ)
1269 end Is_Public_Operation;
1271 -- Start of processing for Check_Unprotected_Access
1274 if Nkind (Expr) = N_Attribute_Reference
1275 and then Attribute_Name (Expr) = Name_Unchecked_Access
1277 Cont_Encl_Typ := Enclosing_Protected_Type (Context);
1278 Pref_Encl_Typ := Enclosing_Protected_Type (Prefix (Expr));
1280 -- Check whether we are trying to export a protected component to a
1281 -- context with an equal or lower access level.
1283 if Present (Pref_Encl_Typ)
1284 and then No (Cont_Encl_Typ)
1285 and then Is_Public_Operation
1286 and then Scope_Depth (Pref_Encl_Typ) >=
1287 Object_Access_Level (Context)
1290 ("?possible unprotected access to protected data", Expr);
1293 end Check_Unprotected_Access;
1299 procedure Check_VMS (Construct : Node_Id) is
1301 if not OpenVMS_On_Target then
1303 ("this construct is allowed only in Open'V'M'S", Construct);
1307 ------------------------
1308 -- Collect_Interfaces --
1309 ------------------------
1311 procedure Collect_Interfaces
1313 Ifaces_List : out Elist_Id;
1314 Exclude_Parents : Boolean := False;
1315 Use_Full_View : Boolean := True)
1317 procedure Collect (Typ : Entity_Id);
1318 -- Subsidiary subprogram used to traverse the whole list
1319 -- of directly and indirectly implemented interfaces
1325 procedure Collect (Typ : Entity_Id) is
1326 Ancestor : Entity_Id;
1334 -- Handle private types
1337 and then Is_Private_Type (Typ)
1338 and then Present (Full_View (Typ))
1340 Full_T := Full_View (Typ);
1343 -- Include the ancestor if we are generating the whole list of
1344 -- abstract interfaces.
1346 if Etype (Full_T) /= Typ
1348 -- Protect the frontend against wrong sources. For example:
1351 -- type A is tagged null record;
1352 -- type B is new A with private;
1353 -- type C is new A with private;
1355 -- type B is new C with null record;
1356 -- type C is new B with null record;
1359 and then Etype (Full_T) /= T
1361 Ancestor := Etype (Full_T);
1364 if Is_Interface (Ancestor)
1365 and then not Exclude_Parents
1367 Append_Unique_Elmt (Ancestor, Ifaces_List);
1371 -- Traverse the graph of ancestor interfaces
1373 if Is_Non_Empty_List (Abstract_Interface_List (Full_T)) then
1374 Id := First (Abstract_Interface_List (Full_T));
1375 while Present (Id) loop
1376 Iface := Etype (Id);
1378 -- Protect against wrong uses. For example:
1379 -- type I is interface;
1380 -- type O is tagged null record;
1381 -- type Wrong is new I and O with null record; -- ERROR
1383 if Is_Interface (Iface) then
1385 and then Etype (T) /= T
1386 and then Interface_Present_In_Ancestor (Etype (T), Iface)
1391 Append_Unique_Elmt (Iface, Ifaces_List);
1400 -- Start of processing for Collect_Interfaces
1403 pragma Assert (Is_Tagged_Type (T) or else Is_Concurrent_Type (T));
1404 Ifaces_List := New_Elmt_List;
1406 end Collect_Interfaces;
1408 ----------------------------------
1409 -- Collect_Interface_Components --
1410 ----------------------------------
1412 procedure Collect_Interface_Components
1413 (Tagged_Type : Entity_Id;
1414 Components_List : out Elist_Id)
1416 procedure Collect (Typ : Entity_Id);
1417 -- Subsidiary subprogram used to climb to the parents
1423 procedure Collect (Typ : Entity_Id) is
1424 Tag_Comp : Entity_Id;
1425 Parent_Typ : Entity_Id;
1428 -- Handle private types
1430 if Present (Full_View (Etype (Typ))) then
1431 Parent_Typ := Full_View (Etype (Typ));
1433 Parent_Typ := Etype (Typ);
1436 if Parent_Typ /= Typ
1438 -- Protect the frontend against wrong sources. For example:
1441 -- type A is tagged null record;
1442 -- type B is new A with private;
1443 -- type C is new A with private;
1445 -- type B is new C with null record;
1446 -- type C is new B with null record;
1449 and then Parent_Typ /= Tagged_Type
1451 Collect (Parent_Typ);
1454 -- Collect the components containing tags of secondary dispatch
1457 Tag_Comp := Next_Tag_Component (First_Tag_Component (Typ));
1458 while Present (Tag_Comp) loop
1459 pragma Assert (Present (Related_Type (Tag_Comp)));
1460 Append_Elmt (Tag_Comp, Components_List);
1462 Tag_Comp := Next_Tag_Component (Tag_Comp);
1466 -- Start of processing for Collect_Interface_Components
1469 pragma Assert (Ekind (Tagged_Type) = E_Record_Type
1470 and then Is_Tagged_Type (Tagged_Type));
1472 Components_List := New_Elmt_List;
1473 Collect (Tagged_Type);
1474 end Collect_Interface_Components;
1476 -----------------------------
1477 -- Collect_Interfaces_Info --
1478 -----------------------------
1480 procedure Collect_Interfaces_Info
1482 Ifaces_List : out Elist_Id;
1483 Components_List : out Elist_Id;
1484 Tags_List : out Elist_Id)
1486 Comps_List : Elist_Id;
1487 Comp_Elmt : Elmt_Id;
1488 Comp_Iface : Entity_Id;
1489 Iface_Elmt : Elmt_Id;
1492 function Search_Tag (Iface : Entity_Id) return Entity_Id;
1493 -- Search for the secondary tag associated with the interface type
1494 -- Iface that is implemented by T.
1500 function Search_Tag (Iface : Entity_Id) return Entity_Id is
1504 ADT := Next_Elmt (Next_Elmt (First_Elmt (Access_Disp_Table (T))));
1506 and then Ekind (Node (ADT)) = E_Constant
1507 and then Related_Type (Node (ADT)) /= Iface
1509 -- Skip the secondary dispatch tables of Iface
1517 pragma Assert (Ekind (Node (ADT)) = E_Constant);
1521 -- Start of processing for Collect_Interfaces_Info
1524 Collect_Interfaces (T, Ifaces_List);
1525 Collect_Interface_Components (T, Comps_List);
1527 -- Search for the record component and tag associated with each
1528 -- interface type of T.
1530 Components_List := New_Elmt_List;
1531 Tags_List := New_Elmt_List;
1533 Iface_Elmt := First_Elmt (Ifaces_List);
1534 while Present (Iface_Elmt) loop
1535 Iface := Node (Iface_Elmt);
1537 -- Associate the primary tag component and the primary dispatch table
1538 -- with all the interfaces that are parents of T
1540 if Is_Ancestor (Iface, T) then
1541 Append_Elmt (First_Tag_Component (T), Components_List);
1542 Append_Elmt (Node (First_Elmt (Access_Disp_Table (T))), Tags_List);
1544 -- Otherwise search for the tag component and secondary dispatch
1548 Comp_Elmt := First_Elmt (Comps_List);
1549 while Present (Comp_Elmt) loop
1550 Comp_Iface := Related_Type (Node (Comp_Elmt));
1552 if Comp_Iface = Iface
1553 or else Is_Ancestor (Iface, Comp_Iface)
1555 Append_Elmt (Node (Comp_Elmt), Components_List);
1556 Append_Elmt (Search_Tag (Comp_Iface), Tags_List);
1560 Next_Elmt (Comp_Elmt);
1562 pragma Assert (Present (Comp_Elmt));
1565 Next_Elmt (Iface_Elmt);
1567 end Collect_Interfaces_Info;
1569 ----------------------------------
1570 -- Collect_Primitive_Operations --
1571 ----------------------------------
1573 function Collect_Primitive_Operations (T : Entity_Id) return Elist_Id is
1574 B_Type : constant Entity_Id := Base_Type (T);
1575 B_Decl : constant Node_Id := Original_Node (Parent (B_Type));
1576 B_Scope : Entity_Id := Scope (B_Type);
1580 Formal_Derived : Boolean := False;
1584 -- For tagged types, the primitive operations are collected as they
1585 -- are declared, and held in an explicit list which is simply returned.
1587 if Is_Tagged_Type (B_Type) then
1588 return Primitive_Operations (B_Type);
1590 -- An untagged generic type that is a derived type inherits the
1591 -- primitive operations of its parent type. Other formal types only
1592 -- have predefined operators, which are not explicitly represented.
1594 elsif Is_Generic_Type (B_Type) then
1595 if Nkind (B_Decl) = N_Formal_Type_Declaration
1596 and then Nkind (Formal_Type_Definition (B_Decl))
1597 = N_Formal_Derived_Type_Definition
1599 Formal_Derived := True;
1601 return New_Elmt_List;
1605 Op_List := New_Elmt_List;
1607 if B_Scope = Standard_Standard then
1608 if B_Type = Standard_String then
1609 Append_Elmt (Standard_Op_Concat, Op_List);
1611 elsif B_Type = Standard_Wide_String then
1612 Append_Elmt (Standard_Op_Concatw, Op_List);
1618 elsif (Is_Package_Or_Generic_Package (B_Scope)
1620 Nkind (Parent (Declaration_Node (First_Subtype (T)))) /=
1622 or else Is_Derived_Type (B_Type)
1624 -- The primitive operations appear after the base type, except
1625 -- if the derivation happens within the private part of B_Scope
1626 -- and the type is a private type, in which case both the type
1627 -- and some primitive operations may appear before the base
1628 -- type, and the list of candidates starts after the type.
1630 if In_Open_Scopes (B_Scope)
1631 and then Scope (T) = B_Scope
1632 and then In_Private_Part (B_Scope)
1634 Id := Next_Entity (T);
1636 Id := Next_Entity (B_Type);
1639 while Present (Id) loop
1641 -- Note that generic formal subprograms are not
1642 -- considered to be primitive operations and thus
1643 -- are never inherited.
1645 if Is_Overloadable (Id)
1646 and then Nkind (Parent (Parent (Id)))
1647 not in N_Formal_Subprogram_Declaration
1651 if Base_Type (Etype (Id)) = B_Type then
1654 Formal := First_Formal (Id);
1655 while Present (Formal) loop
1656 if Base_Type (Etype (Formal)) = B_Type then
1660 elsif Ekind (Etype (Formal)) = E_Anonymous_Access_Type
1662 (Designated_Type (Etype (Formal))) = B_Type
1668 Next_Formal (Formal);
1672 -- For a formal derived type, the only primitives are the
1673 -- ones inherited from the parent type. Operations appearing
1674 -- in the package declaration are not primitive for it.
1677 and then (not Formal_Derived
1678 or else Present (Alias (Id)))
1680 Append_Elmt (Id, Op_List);
1686 -- For a type declared in System, some of its operations
1687 -- may appear in the target-specific extension to System.
1690 and then Chars (B_Scope) = Name_System
1691 and then Scope (B_Scope) = Standard_Standard
1692 and then Present_System_Aux
1694 B_Scope := System_Aux_Id;
1695 Id := First_Entity (System_Aux_Id);
1701 end Collect_Primitive_Operations;
1703 -----------------------------------
1704 -- Compile_Time_Constraint_Error --
1705 -----------------------------------
1707 function Compile_Time_Constraint_Error
1710 Ent : Entity_Id := Empty;
1711 Loc : Source_Ptr := No_Location;
1712 Warn : Boolean := False) return Node_Id
1714 Msgc : String (1 .. Msg'Length + 2);
1715 -- Copy of message, with room for possible ? and ! at end
1725 -- A static constraint error in an instance body is not a fatal error.
1726 -- we choose to inhibit the message altogether, because there is no
1727 -- obvious node (for now) on which to post it. On the other hand the
1728 -- offending node must be replaced with a constraint_error in any case.
1730 -- No messages are generated if we already posted an error on this node
1732 if not Error_Posted (N) then
1733 if Loc /= No_Location then
1739 Msgc (1 .. Msg'Length) := Msg;
1742 -- Message is a warning, even in Ada 95 case
1744 if Msg (Msg'Last) = '?' then
1747 -- In Ada 83, all messages are warnings. In the private part and
1748 -- the body of an instance, constraint_checks are only warnings.
1749 -- We also make this a warning if the Warn parameter is set.
1752 or else (Ada_Version = Ada_83 and then Comes_From_Source (N))
1758 elsif In_Instance_Not_Visible then
1763 -- Otherwise we have a real error message (Ada 95 static case)
1764 -- and we make this an unconditional message. Note that in the
1765 -- warning case we do not make the message unconditional, it seems
1766 -- quite reasonable to delete messages like this (about exceptions
1767 -- that will be raised) in dead code.
1775 -- Should we generate a warning? The answer is not quite yes. The
1776 -- very annoying exception occurs in the case of a short circuit
1777 -- operator where the left operand is static and decisive. Climb
1778 -- parents to see if that is the case we have here. Conditional
1779 -- expressions with decisive conditions are a similar situation.
1787 -- And then with False as left operand
1789 if Nkind (P) = N_And_Then
1790 and then Compile_Time_Known_Value (Left_Opnd (P))
1791 and then Is_False (Expr_Value (Left_Opnd (P)))
1796 -- OR ELSE with True as left operand
1798 elsif Nkind (P) = N_Or_Else
1799 and then Compile_Time_Known_Value (Left_Opnd (P))
1800 and then Is_True (Expr_Value (Left_Opnd (P)))
1805 -- Conditional expression
1807 elsif Nkind (P) = N_Conditional_Expression then
1809 Cond : constant Node_Id := First (Expressions (P));
1810 Texp : constant Node_Id := Next (Cond);
1811 Fexp : constant Node_Id := Next (Texp);
1814 if Compile_Time_Known_Value (Cond) then
1816 -- Condition is True and we are in the right operand
1818 if Is_True (Expr_Value (Cond))
1819 and then OldP = Fexp
1824 -- Condition is False and we are in the left operand
1826 elsif Is_False (Expr_Value (Cond))
1827 and then OldP = Texp
1835 -- Special case for component association in aggregates, where
1836 -- we want to keep climbing up to the parent aggregate.
1838 elsif Nkind (P) = N_Component_Association
1839 and then Nkind (Parent (P)) = N_Aggregate
1843 -- Keep going if within subexpression
1846 exit when Nkind (P) not in N_Subexpr;
1851 if Present (Ent) then
1852 Error_Msg_NEL (Msgc (1 .. Msgl), N, Ent, Eloc);
1854 Error_Msg_NEL (Msgc (1 .. Msgl), N, Etype (N), Eloc);
1858 if Inside_Init_Proc then
1860 ("\?& will be raised for objects of this type",
1861 N, Standard_Constraint_Error, Eloc);
1864 ("\?& will be raised at run time",
1865 N, Standard_Constraint_Error, Eloc);
1870 ("\static expression fails Constraint_Check", Eloc);
1871 Set_Error_Posted (N);
1877 end Compile_Time_Constraint_Error;
1879 -----------------------
1880 -- Conditional_Delay --
1881 -----------------------
1883 procedure Conditional_Delay (New_Ent, Old_Ent : Entity_Id) is
1885 if Has_Delayed_Freeze (Old_Ent) and then not Is_Frozen (Old_Ent) then
1886 Set_Has_Delayed_Freeze (New_Ent);
1888 end Conditional_Delay;
1890 -------------------------
1891 -- Copy_Parameter_List --
1892 -------------------------
1894 function Copy_Parameter_List (Subp_Id : Entity_Id) return List_Id is
1895 Loc : constant Source_Ptr := Sloc (Subp_Id);
1900 if No (First_Formal (Subp_Id)) then
1904 Formal := First_Formal (Subp_Id);
1905 while Present (Formal) loop
1907 (Make_Parameter_Specification (Loc,
1908 Defining_Identifier =>
1909 Make_Defining_Identifier (Sloc (Formal),
1910 Chars => Chars (Formal)),
1911 In_Present => In_Present (Parent (Formal)),
1912 Out_Present => Out_Present (Parent (Formal)),
1914 New_Reference_To (Etype (Formal), Loc),
1916 New_Copy_Tree (Expression (Parent (Formal)))),
1919 Next_Formal (Formal);
1924 end Copy_Parameter_List;
1926 --------------------
1927 -- Current_Entity --
1928 --------------------
1930 -- The currently visible definition for a given identifier is the
1931 -- one most chained at the start of the visibility chain, i.e. the
1932 -- one that is referenced by the Node_Id value of the name of the
1933 -- given identifier.
1935 function Current_Entity (N : Node_Id) return Entity_Id is
1937 return Get_Name_Entity_Id (Chars (N));
1940 -----------------------------
1941 -- Current_Entity_In_Scope --
1942 -----------------------------
1944 function Current_Entity_In_Scope (N : Node_Id) return Entity_Id is
1946 CS : constant Entity_Id := Current_Scope;
1948 Transient_Case : constant Boolean := Scope_Is_Transient;
1951 E := Get_Name_Entity_Id (Chars (N));
1953 and then Scope (E) /= CS
1954 and then (not Transient_Case or else Scope (E) /= Scope (CS))
1960 end Current_Entity_In_Scope;
1966 function Current_Scope return Entity_Id is
1968 if Scope_Stack.Last = -1 then
1969 return Standard_Standard;
1972 C : constant Entity_Id :=
1973 Scope_Stack.Table (Scope_Stack.Last).Entity;
1978 return Standard_Standard;
1984 ------------------------
1985 -- Current_Subprogram --
1986 ------------------------
1988 function Current_Subprogram return Entity_Id is
1989 Scop : constant Entity_Id := Current_Scope;
1991 if Is_Subprogram (Scop) or else Is_Generic_Subprogram (Scop) then
1994 return Enclosing_Subprogram (Scop);
1996 end Current_Subprogram;
1998 ---------------------
1999 -- Defining_Entity --
2000 ---------------------
2002 function Defining_Entity (N : Node_Id) return Entity_Id is
2003 K : constant Node_Kind := Nkind (N);
2004 Err : Entity_Id := Empty;
2009 N_Subprogram_Declaration |
2010 N_Abstract_Subprogram_Declaration |
2012 N_Package_Declaration |
2013 N_Subprogram_Renaming_Declaration |
2014 N_Subprogram_Body_Stub |
2015 N_Generic_Subprogram_Declaration |
2016 N_Generic_Package_Declaration |
2017 N_Formal_Subprogram_Declaration
2019 return Defining_Entity (Specification (N));
2022 N_Component_Declaration |
2023 N_Defining_Program_Unit_Name |
2024 N_Discriminant_Specification |
2026 N_Entry_Declaration |
2027 N_Entry_Index_Specification |
2028 N_Exception_Declaration |
2029 N_Exception_Renaming_Declaration |
2030 N_Formal_Object_Declaration |
2031 N_Formal_Package_Declaration |
2032 N_Formal_Type_Declaration |
2033 N_Full_Type_Declaration |
2034 N_Implicit_Label_Declaration |
2035 N_Incomplete_Type_Declaration |
2036 N_Loop_Parameter_Specification |
2037 N_Number_Declaration |
2038 N_Object_Declaration |
2039 N_Object_Renaming_Declaration |
2040 N_Package_Body_Stub |
2041 N_Parameter_Specification |
2042 N_Private_Extension_Declaration |
2043 N_Private_Type_Declaration |
2045 N_Protected_Body_Stub |
2046 N_Protected_Type_Declaration |
2047 N_Single_Protected_Declaration |
2048 N_Single_Task_Declaration |
2049 N_Subtype_Declaration |
2052 N_Task_Type_Declaration
2054 return Defining_Identifier (N);
2057 return Defining_Entity (Proper_Body (N));
2060 N_Function_Instantiation |
2061 N_Function_Specification |
2062 N_Generic_Function_Renaming_Declaration |
2063 N_Generic_Package_Renaming_Declaration |
2064 N_Generic_Procedure_Renaming_Declaration |
2066 N_Package_Instantiation |
2067 N_Package_Renaming_Declaration |
2068 N_Package_Specification |
2069 N_Procedure_Instantiation |
2070 N_Procedure_Specification
2073 Nam : constant Node_Id := Defining_Unit_Name (N);
2076 if Nkind (Nam) in N_Entity then
2079 -- For Error, make up a name and attach to declaration
2080 -- so we can continue semantic analysis
2082 elsif Nam = Error then
2084 Make_Defining_Identifier (Sloc (N),
2085 Chars => New_Internal_Name ('T'));
2086 Set_Defining_Unit_Name (N, Err);
2089 -- If not an entity, get defining identifier
2092 return Defining_Identifier (Nam);
2096 when N_Block_Statement =>
2097 return Entity (Identifier (N));
2100 raise Program_Error;
2103 end Defining_Entity;
2105 --------------------------
2106 -- Denotes_Discriminant --
2107 --------------------------
2109 function Denotes_Discriminant
2111 Check_Concurrent : Boolean := False) return Boolean
2115 if not Is_Entity_Name (N)
2116 or else No (Entity (N))
2123 -- If we are checking for a protected type, the discriminant may have
2124 -- been rewritten as the corresponding discriminal of the original type
2125 -- or of the corresponding concurrent record, depending on whether we
2126 -- are in the spec or body of the protected type.
2128 return Ekind (E) = E_Discriminant
2131 and then Ekind (E) = E_In_Parameter
2132 and then Present (Discriminal_Link (E))
2134 (Is_Concurrent_Type (Scope (Discriminal_Link (E)))
2136 Is_Concurrent_Record_Type (Scope (Discriminal_Link (E)))));
2138 end Denotes_Discriminant;
2140 -------------------------
2141 -- Denotes_Same_Object --
2142 -------------------------
2144 function Denotes_Same_Object (A1, A2 : Node_Id) return Boolean is
2146 -- If we have entity names, then must be same entity
2148 if Is_Entity_Name (A1) then
2149 if Is_Entity_Name (A2) then
2150 return Entity (A1) = Entity (A2);
2155 -- No match if not same node kind
2157 elsif Nkind (A1) /= Nkind (A2) then
2160 -- For selected components, must have same prefix and selector
2162 elsif Nkind (A1) = N_Selected_Component then
2163 return Denotes_Same_Object (Prefix (A1), Prefix (A2))
2165 Entity (Selector_Name (A1)) = Entity (Selector_Name (A2));
2167 -- For explicit dereferences, prefixes must be same
2169 elsif Nkind (A1) = N_Explicit_Dereference then
2170 return Denotes_Same_Object (Prefix (A1), Prefix (A2));
2172 -- For indexed components, prefixes and all subscripts must be the same
2174 elsif Nkind (A1) = N_Indexed_Component then
2175 if Denotes_Same_Object (Prefix (A1), Prefix (A2)) then
2181 Indx1 := First (Expressions (A1));
2182 Indx2 := First (Expressions (A2));
2183 while Present (Indx1) loop
2185 -- Shouldn't we be checking that values are the same???
2187 if not Denotes_Same_Object (Indx1, Indx2) then
2201 -- For slices, prefixes must match and bounds must match
2203 elsif Nkind (A1) = N_Slice
2204 and then Denotes_Same_Object (Prefix (A1), Prefix (A2))
2207 Lo1, Lo2, Hi1, Hi2 : Node_Id;
2210 Get_Index_Bounds (Etype (A1), Lo1, Hi1);
2211 Get_Index_Bounds (Etype (A2), Lo2, Hi2);
2213 -- Check whether bounds are statically identical. There is no
2214 -- attempt to detect partial overlap of slices.
2216 -- What about an array and a slice of an array???
2218 return Denotes_Same_Object (Lo1, Lo2)
2219 and then Denotes_Same_Object (Hi1, Hi2);
2222 -- Literals will appear as indices. Isn't this where we should check
2223 -- Known_At_Compile_Time at least if we are generating warnings ???
2225 elsif Nkind (A1) = N_Integer_Literal then
2226 return Intval (A1) = Intval (A2);
2231 end Denotes_Same_Object;
2233 -------------------------
2234 -- Denotes_Same_Prefix --
2235 -------------------------
2237 function Denotes_Same_Prefix (A1, A2 : Node_Id) return Boolean is
2240 if Is_Entity_Name (A1) then
2241 if Nkind_In (A2, N_Selected_Component, N_Indexed_Component) then
2242 return Denotes_Same_Object (A1, Prefix (A2))
2243 or else Denotes_Same_Prefix (A1, Prefix (A2));
2248 elsif Is_Entity_Name (A2) then
2249 return Denotes_Same_Prefix (A2, A1);
2251 elsif Nkind_In (A1, N_Selected_Component, N_Indexed_Component, N_Slice)
2253 Nkind_In (A2, N_Selected_Component, N_Indexed_Component, N_Slice)
2256 Root1, Root2 : Node_Id;
2257 Depth1, Depth2 : Int := 0;
2260 Root1 := Prefix (A1);
2261 while not Is_Entity_Name (Root1) loop
2263 (Root1, N_Selected_Component, N_Indexed_Component)
2267 Root1 := Prefix (Root1);
2270 Depth1 := Depth1 + 1;
2273 Root2 := Prefix (A2);
2274 while not Is_Entity_Name (Root2) loop
2276 (Root2, N_Selected_Component, N_Indexed_Component)
2280 Root2 := Prefix (Root2);
2283 Depth2 := Depth2 + 1;
2286 -- If both have the same depth and they do not denote the same
2287 -- object, they are disjoint and not warning is needed.
2289 if Depth1 = Depth2 then
2292 elsif Depth1 > Depth2 then
2293 Root1 := Prefix (A1);
2294 for I in 1 .. Depth1 - Depth2 - 1 loop
2295 Root1 := Prefix (Root1);
2298 return Denotes_Same_Object (Root1, A2);
2301 Root2 := Prefix (A2);
2302 for I in 1 .. Depth2 - Depth1 - 1 loop
2303 Root2 := Prefix (Root2);
2306 return Denotes_Same_Object (A1, Root2);
2313 end Denotes_Same_Prefix;
2315 ----------------------
2316 -- Denotes_Variable --
2317 ----------------------
2319 function Denotes_Variable (N : Node_Id) return Boolean is
2321 return Is_Variable (N) and then Paren_Count (N) = 0;
2322 end Denotes_Variable;
2324 -----------------------------
2325 -- Depends_On_Discriminant --
2326 -----------------------------
2328 function Depends_On_Discriminant (N : Node_Id) return Boolean is
2333 Get_Index_Bounds (N, L, H);
2334 return Denotes_Discriminant (L) or else Denotes_Discriminant (H);
2335 end Depends_On_Discriminant;
2337 -------------------------
2338 -- Designate_Same_Unit --
2339 -------------------------
2341 function Designate_Same_Unit
2343 Name2 : Node_Id) return Boolean
2345 K1 : constant Node_Kind := Nkind (Name1);
2346 K2 : constant Node_Kind := Nkind (Name2);
2348 function Prefix_Node (N : Node_Id) return Node_Id;
2349 -- Returns the parent unit name node of a defining program unit name
2350 -- or the prefix if N is a selected component or an expanded name.
2352 function Select_Node (N : Node_Id) return Node_Id;
2353 -- Returns the defining identifier node of a defining program unit
2354 -- name or the selector node if N is a selected component or an
2361 function Prefix_Node (N : Node_Id) return Node_Id is
2363 if Nkind (N) = N_Defining_Program_Unit_Name then
2375 function Select_Node (N : Node_Id) return Node_Id is
2377 if Nkind (N) = N_Defining_Program_Unit_Name then
2378 return Defining_Identifier (N);
2381 return Selector_Name (N);
2385 -- Start of processing for Designate_Next_Unit
2388 if (K1 = N_Identifier or else
2389 K1 = N_Defining_Identifier)
2391 (K2 = N_Identifier or else
2392 K2 = N_Defining_Identifier)
2394 return Chars (Name1) = Chars (Name2);
2397 (K1 = N_Expanded_Name or else
2398 K1 = N_Selected_Component or else
2399 K1 = N_Defining_Program_Unit_Name)
2401 (K2 = N_Expanded_Name or else
2402 K2 = N_Selected_Component or else
2403 K2 = N_Defining_Program_Unit_Name)
2406 (Chars (Select_Node (Name1)) = Chars (Select_Node (Name2)))
2408 Designate_Same_Unit (Prefix_Node (Name1), Prefix_Node (Name2));
2413 end Designate_Same_Unit;
2415 ----------------------------
2416 -- Enclosing_Generic_Body --
2417 ----------------------------
2419 function Enclosing_Generic_Body
2420 (N : Node_Id) return Node_Id
2428 while Present (P) loop
2429 if Nkind (P) = N_Package_Body
2430 or else Nkind (P) = N_Subprogram_Body
2432 Spec := Corresponding_Spec (P);
2434 if Present (Spec) then
2435 Decl := Unit_Declaration_Node (Spec);
2437 if Nkind (Decl) = N_Generic_Package_Declaration
2438 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2449 end Enclosing_Generic_Body;
2451 ----------------------------
2452 -- Enclosing_Generic_Unit --
2453 ----------------------------
2455 function Enclosing_Generic_Unit
2456 (N : Node_Id) return Node_Id
2464 while Present (P) loop
2465 if Nkind (P) = N_Generic_Package_Declaration
2466 or else Nkind (P) = N_Generic_Subprogram_Declaration
2470 elsif Nkind (P) = N_Package_Body
2471 or else Nkind (P) = N_Subprogram_Body
2473 Spec := Corresponding_Spec (P);
2475 if Present (Spec) then
2476 Decl := Unit_Declaration_Node (Spec);
2478 if Nkind (Decl) = N_Generic_Package_Declaration
2479 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2490 end Enclosing_Generic_Unit;
2492 -------------------------------
2493 -- Enclosing_Lib_Unit_Entity --
2494 -------------------------------
2496 function Enclosing_Lib_Unit_Entity return Entity_Id is
2497 Unit_Entity : Entity_Id;
2500 -- Look for enclosing library unit entity by following scope links.
2501 -- Equivalent to, but faster than indexing through the scope stack.
2503 Unit_Entity := Current_Scope;
2504 while (Present (Scope (Unit_Entity))
2505 and then Scope (Unit_Entity) /= Standard_Standard)
2506 and not Is_Child_Unit (Unit_Entity)
2508 Unit_Entity := Scope (Unit_Entity);
2512 end Enclosing_Lib_Unit_Entity;
2514 -----------------------------
2515 -- Enclosing_Lib_Unit_Node --
2516 -----------------------------
2518 function Enclosing_Lib_Unit_Node (N : Node_Id) return Node_Id is
2519 Current_Node : Node_Id;
2523 while Present (Current_Node)
2524 and then Nkind (Current_Node) /= N_Compilation_Unit
2526 Current_Node := Parent (Current_Node);
2529 if Nkind (Current_Node) /= N_Compilation_Unit then
2533 return Current_Node;
2534 end Enclosing_Lib_Unit_Node;
2536 --------------------------
2537 -- Enclosing_Subprogram --
2538 --------------------------
2540 function Enclosing_Subprogram (E : Entity_Id) return Entity_Id is
2541 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
2544 if Dynamic_Scope = Standard_Standard then
2547 elsif Dynamic_Scope = Empty then
2550 elsif Ekind (Dynamic_Scope) = E_Subprogram_Body then
2551 return Corresponding_Spec (Parent (Parent (Dynamic_Scope)));
2553 elsif Ekind (Dynamic_Scope) = E_Block
2554 or else Ekind (Dynamic_Scope) = E_Return_Statement
2556 return Enclosing_Subprogram (Dynamic_Scope);
2558 elsif Ekind (Dynamic_Scope) = E_Task_Type then
2559 return Get_Task_Body_Procedure (Dynamic_Scope);
2561 elsif Convention (Dynamic_Scope) = Convention_Protected then
2562 return Protected_Body_Subprogram (Dynamic_Scope);
2565 return Dynamic_Scope;
2567 end Enclosing_Subprogram;
2569 ------------------------
2570 -- Ensure_Freeze_Node --
2571 ------------------------
2573 procedure Ensure_Freeze_Node (E : Entity_Id) is
2577 if No (Freeze_Node (E)) then
2578 FN := Make_Freeze_Entity (Sloc (E));
2579 Set_Has_Delayed_Freeze (E);
2580 Set_Freeze_Node (E, FN);
2581 Set_Access_Types_To_Process (FN, No_Elist);
2582 Set_TSS_Elist (FN, No_Elist);
2585 end Ensure_Freeze_Node;
2591 procedure Enter_Name (Def_Id : Entity_Id) is
2592 C : constant Entity_Id := Current_Entity (Def_Id);
2593 E : constant Entity_Id := Current_Entity_In_Scope (Def_Id);
2594 S : constant Entity_Id := Current_Scope;
2597 Generate_Definition (Def_Id);
2599 -- Add new name to current scope declarations. Check for duplicate
2600 -- declaration, which may or may not be a genuine error.
2604 -- Case of previous entity entered because of a missing declaration
2605 -- or else a bad subtype indication. Best is to use the new entity,
2606 -- and make the previous one invisible.
2608 if Etype (E) = Any_Type then
2609 Set_Is_Immediately_Visible (E, False);
2611 -- Case of renaming declaration constructed for package instances.
2612 -- if there is an explicit declaration with the same identifier,
2613 -- the renaming is not immediately visible any longer, but remains
2614 -- visible through selected component notation.
2616 elsif Nkind (Parent (E)) = N_Package_Renaming_Declaration
2617 and then not Comes_From_Source (E)
2619 Set_Is_Immediately_Visible (E, False);
2621 -- The new entity may be the package renaming, which has the same
2622 -- same name as a generic formal which has been seen already.
2624 elsif Nkind (Parent (Def_Id)) = N_Package_Renaming_Declaration
2625 and then not Comes_From_Source (Def_Id)
2627 Set_Is_Immediately_Visible (E, False);
2629 -- For a fat pointer corresponding to a remote access to subprogram,
2630 -- we use the same identifier as the RAS type, so that the proper
2631 -- name appears in the stub. This type is only retrieved through
2632 -- the RAS type and never by visibility, and is not added to the
2633 -- visibility list (see below).
2635 elsif Nkind (Parent (Def_Id)) = N_Full_Type_Declaration
2636 and then Present (Corresponding_Remote_Type (Def_Id))
2640 -- A controller component for a type extension overrides the
2641 -- inherited component.
2643 elsif Chars (E) = Name_uController then
2646 -- Case of an implicit operation or derived literal. The new entity
2647 -- hides the implicit one, which is removed from all visibility,
2648 -- i.e. the entity list of its scope, and homonym chain of its name.
2650 elsif (Is_Overloadable (E) and then Is_Inherited_Operation (E))
2651 or else Is_Internal (E)
2655 Prev_Vis : Entity_Id;
2656 Decl : constant Node_Id := Parent (E);
2659 -- If E is an implicit declaration, it cannot be the first
2660 -- entity in the scope.
2662 Prev := First_Entity (Current_Scope);
2663 while Present (Prev)
2664 and then Next_Entity (Prev) /= E
2671 -- If E is not on the entity chain of the current scope,
2672 -- it is an implicit declaration in the generic formal
2673 -- part of a generic subprogram. When analyzing the body,
2674 -- the generic formals are visible but not on the entity
2675 -- chain of the subprogram. The new entity will become
2676 -- the visible one in the body.
2679 (Nkind (Parent (Decl)) = N_Generic_Subprogram_Declaration);
2683 Set_Next_Entity (Prev, Next_Entity (E));
2685 if No (Next_Entity (Prev)) then
2686 Set_Last_Entity (Current_Scope, Prev);
2689 if E = Current_Entity (E) then
2693 Prev_Vis := Current_Entity (E);
2694 while Homonym (Prev_Vis) /= E loop
2695 Prev_Vis := Homonym (Prev_Vis);
2699 if Present (Prev_Vis) then
2701 -- Skip E in the visibility chain
2703 Set_Homonym (Prev_Vis, Homonym (E));
2706 Set_Name_Entity_Id (Chars (E), Homonym (E));
2711 -- This section of code could use a comment ???
2713 elsif Present (Etype (E))
2714 and then Is_Concurrent_Type (Etype (E))
2719 -- If the homograph is a protected component renaming, it should not
2720 -- be hiding the current entity. Such renamings are treated as weak
2723 elsif Is_Prival (E) then
2724 Set_Is_Immediately_Visible (E, False);
2726 -- In this case the current entity is a protected component renaming.
2727 -- Perform minimal decoration by setting the scope and return since
2728 -- the prival should not be hiding other visible entities.
2730 elsif Is_Prival (Def_Id) then
2731 Set_Scope (Def_Id, Current_Scope);
2734 -- Analogous to privals, the discriminal generated for an entry
2735 -- index parameter acts as a weak declaration. Perform minimal
2736 -- decoration to avoid bogus errors.
2738 elsif Is_Discriminal (Def_Id)
2739 and then Ekind (Discriminal_Link (Def_Id)) = E_Entry_Index_Parameter
2741 Set_Scope (Def_Id, Current_Scope);
2744 -- In the body or private part of an instance, a type extension
2745 -- may introduce a component with the same name as that of an
2746 -- actual. The legality rule is not enforced, but the semantics
2747 -- of the full type with two components of the same name are not
2748 -- clear at this point ???
2750 elsif In_Instance_Not_Visible then
2753 -- When compiling a package body, some child units may have become
2754 -- visible. They cannot conflict with local entities that hide them.
2756 elsif Is_Child_Unit (E)
2757 and then In_Open_Scopes (Scope (E))
2758 and then not Is_Immediately_Visible (E)
2762 -- Conversely, with front-end inlining we may compile the parent
2763 -- body first, and a child unit subsequently. The context is now
2764 -- the parent spec, and body entities are not visible.
2766 elsif Is_Child_Unit (Def_Id)
2767 and then Is_Package_Body_Entity (E)
2768 and then not In_Package_Body (Current_Scope)
2772 -- Case of genuine duplicate declaration
2775 Error_Msg_Sloc := Sloc (E);
2777 -- If the previous declaration is an incomplete type declaration
2778 -- this may be an attempt to complete it with a private type.
2779 -- The following avoids confusing cascaded errors.
2781 if Nkind (Parent (E)) = N_Incomplete_Type_Declaration
2782 and then Nkind (Parent (Def_Id)) = N_Private_Type_Declaration
2785 ("incomplete type cannot be completed with a private " &
2786 "declaration", Parent (Def_Id));
2787 Set_Is_Immediately_Visible (E, False);
2788 Set_Full_View (E, Def_Id);
2790 -- An inherited component of a record conflicts with a new
2791 -- discriminant. The discriminant is inserted first in the scope,
2792 -- but the error should be posted on it, not on the component.
2794 elsif Ekind (E) = E_Discriminant
2795 and then Present (Scope (Def_Id))
2796 and then Scope (Def_Id) /= Current_Scope
2798 Error_Msg_Sloc := Sloc (Def_Id);
2799 Error_Msg_N ("& conflicts with declaration#", E);
2802 -- If the name of the unit appears in its own context clause,
2803 -- a dummy package with the name has already been created, and
2804 -- the error emitted. Try to continue quietly.
2806 elsif Error_Posted (E)
2807 and then Sloc (E) = No_Location
2808 and then Nkind (Parent (E)) = N_Package_Specification
2809 and then Current_Scope = Standard_Standard
2811 Set_Scope (Def_Id, Current_Scope);
2815 Error_Msg_N ("& conflicts with declaration#", Def_Id);
2817 -- Avoid cascaded messages with duplicate components in
2820 if Ekind_In (E, E_Component, E_Discriminant) then
2825 if Nkind (Parent (Parent (Def_Id))) =
2826 N_Generic_Subprogram_Declaration
2828 Defining_Entity (Specification (Parent (Parent (Def_Id))))
2830 Error_Msg_N ("\generic units cannot be overloaded", Def_Id);
2833 -- If entity is in standard, then we are in trouble, because
2834 -- it means that we have a library package with a duplicated
2835 -- name. That's hard to recover from, so abort!
2837 if S = Standard_Standard then
2838 raise Unrecoverable_Error;
2840 -- Otherwise we continue with the declaration. Having two
2841 -- identical declarations should not cause us too much trouble!
2849 -- If we fall through, declaration is OK , or OK enough to continue
2851 -- If Def_Id is a discriminant or a record component we are in the
2852 -- midst of inheriting components in a derived record definition.
2853 -- Preserve their Ekind and Etype.
2855 if Ekind_In (Def_Id, E_Discriminant, E_Component) then
2858 -- If a type is already set, leave it alone (happens whey a type
2859 -- declaration is reanalyzed following a call to the optimizer)
2861 elsif Present (Etype (Def_Id)) then
2864 -- Otherwise, the kind E_Void insures that premature uses of the entity
2865 -- will be detected. Any_Type insures that no cascaded errors will occur
2868 Set_Ekind (Def_Id, E_Void);
2869 Set_Etype (Def_Id, Any_Type);
2872 -- Inherited discriminants and components in derived record types are
2873 -- immediately visible. Itypes are not.
2875 if Ekind_In (Def_Id, E_Discriminant, E_Component)
2876 or else (No (Corresponding_Remote_Type (Def_Id))
2877 and then not Is_Itype (Def_Id))
2879 Set_Is_Immediately_Visible (Def_Id);
2880 Set_Current_Entity (Def_Id);
2883 Set_Homonym (Def_Id, C);
2884 Append_Entity (Def_Id, S);
2885 Set_Public_Status (Def_Id);
2887 -- Warn if new entity hides an old one
2889 if Warn_On_Hiding and then Present (C)
2891 -- Don't warn for record components since they always have a well
2892 -- defined scope which does not confuse other uses. Note that in
2893 -- some cases, Ekind has not been set yet.
2895 and then Ekind (C) /= E_Component
2896 and then Ekind (C) /= E_Discriminant
2897 and then Nkind (Parent (C)) /= N_Component_Declaration
2898 and then Ekind (Def_Id) /= E_Component
2899 and then Ekind (Def_Id) /= E_Discriminant
2900 and then Nkind (Parent (Def_Id)) /= N_Component_Declaration
2902 -- Don't warn for one character variables. It is too common to use
2903 -- such variables as locals and will just cause too many false hits.
2905 and then Length_Of_Name (Chars (C)) /= 1
2907 -- Don't warn for non-source entities
2909 and then Comes_From_Source (C)
2910 and then Comes_From_Source (Def_Id)
2912 -- Don't warn unless entity in question is in extended main source
2914 and then In_Extended_Main_Source_Unit (Def_Id)
2916 -- Finally, the hidden entity must be either immediately visible
2917 -- or use visible (from a used package)
2920 (Is_Immediately_Visible (C)
2922 Is_Potentially_Use_Visible (C))
2924 Error_Msg_Sloc := Sloc (C);
2925 Error_Msg_N ("declaration hides &#?", Def_Id);
2929 --------------------------
2930 -- Explain_Limited_Type --
2931 --------------------------
2933 procedure Explain_Limited_Type (T : Entity_Id; N : Node_Id) is
2937 -- For array, component type must be limited
2939 if Is_Array_Type (T) then
2940 Error_Msg_Node_2 := T;
2942 ("\component type& of type& is limited", N, Component_Type (T));
2943 Explain_Limited_Type (Component_Type (T), N);
2945 elsif Is_Record_Type (T) then
2947 -- No need for extra messages if explicit limited record
2949 if Is_Limited_Record (Base_Type (T)) then
2953 -- Otherwise find a limited component. Check only components that
2954 -- come from source, or inherited components that appear in the
2955 -- source of the ancestor.
2957 C := First_Component (T);
2958 while Present (C) loop
2959 if Is_Limited_Type (Etype (C))
2961 (Comes_From_Source (C)
2963 (Present (Original_Record_Component (C))
2965 Comes_From_Source (Original_Record_Component (C))))
2967 Error_Msg_Node_2 := T;
2968 Error_Msg_NE ("\component& of type& has limited type", N, C);
2969 Explain_Limited_Type (Etype (C), N);
2976 -- The type may be declared explicitly limited, even if no component
2977 -- of it is limited, in which case we fall out of the loop.
2980 end Explain_Limited_Type;
2986 procedure Find_Actual
2988 Formal : out Entity_Id;
2991 Parnt : constant Node_Id := Parent (N);
2995 if (Nkind (Parnt) = N_Indexed_Component
2997 Nkind (Parnt) = N_Selected_Component)
2998 and then N = Prefix (Parnt)
3000 Find_Actual (Parnt, Formal, Call);
3003 elsif Nkind (Parnt) = N_Parameter_Association
3004 and then N = Explicit_Actual_Parameter (Parnt)
3006 Call := Parent (Parnt);
3008 elsif Nkind (Parnt) = N_Procedure_Call_Statement then
3017 -- If we have a call to a subprogram look for the parameter. Note that
3018 -- we exclude overloaded calls, since we don't know enough to be sure
3019 -- of giving the right answer in this case.
3021 if Is_Entity_Name (Name (Call))
3022 and then Present (Entity (Name (Call)))
3023 and then Is_Overloadable (Entity (Name (Call)))
3024 and then not Is_Overloaded (Name (Call))
3026 -- Fall here if we are definitely a parameter
3028 Actual := First_Actual (Call);
3029 Formal := First_Formal (Entity (Name (Call)));
3030 while Present (Formal) and then Present (Actual) loop
3034 Actual := Next_Actual (Actual);
3035 Formal := Next_Formal (Formal);
3040 -- Fall through here if we did not find matching actual
3046 -------------------------------------
3047 -- Find_Corresponding_Discriminant --
3048 -------------------------------------
3050 function Find_Corresponding_Discriminant
3052 Typ : Entity_Id) return Entity_Id
3054 Par_Disc : Entity_Id;
3055 Old_Disc : Entity_Id;
3056 New_Disc : Entity_Id;
3059 Par_Disc := Original_Record_Component (Original_Discriminant (Id));
3061 -- The original type may currently be private, and the discriminant
3062 -- only appear on its full view.
3064 if Is_Private_Type (Scope (Par_Disc))
3065 and then not Has_Discriminants (Scope (Par_Disc))
3066 and then Present (Full_View (Scope (Par_Disc)))
3068 Old_Disc := First_Discriminant (Full_View (Scope (Par_Disc)));
3070 Old_Disc := First_Discriminant (Scope (Par_Disc));
3073 if Is_Class_Wide_Type (Typ) then
3074 New_Disc := First_Discriminant (Root_Type (Typ));
3076 New_Disc := First_Discriminant (Typ);
3079 while Present (Old_Disc) and then Present (New_Disc) loop
3080 if Old_Disc = Par_Disc then
3083 Next_Discriminant (Old_Disc);
3084 Next_Discriminant (New_Disc);
3088 -- Should always find it
3090 raise Program_Error;
3091 end Find_Corresponding_Discriminant;
3093 --------------------------
3094 -- Find_Overlaid_Entity --
3095 --------------------------
3097 procedure Find_Overlaid_Entity
3099 Ent : out Entity_Id;
3105 -- We are looking for one of the two following forms:
3107 -- for X'Address use Y'Address
3111 -- Const : constant Address := expr;
3113 -- for X'Address use Const;
3115 -- In the second case, the expr is either Y'Address, or recursively a
3116 -- constant that eventually references Y'Address.
3121 if Nkind (N) = N_Attribute_Definition_Clause
3122 and then Chars (N) = Name_Address
3124 Expr := Expression (N);
3126 -- This loop checks the form of the expression for Y'Address,
3127 -- using recursion to deal with intermediate constants.
3130 -- Check for Y'Address
3132 if Nkind (Expr) = N_Attribute_Reference
3133 and then Attribute_Name (Expr) = Name_Address
3135 Expr := Prefix (Expr);
3138 -- Check for Const where Const is a constant entity
3140 elsif Is_Entity_Name (Expr)
3141 and then Ekind (Entity (Expr)) = E_Constant
3143 Expr := Constant_Value (Entity (Expr));
3145 -- Anything else does not need checking
3152 -- This loop checks the form of the prefix for an entity,
3153 -- using recursion to deal with intermediate components.
3156 -- Check for Y where Y is an entity
3158 if Is_Entity_Name (Expr) then
3159 Ent := Entity (Expr);
3162 -- Check for components
3165 Nkind_In (Expr, N_Selected_Component, N_Indexed_Component) then
3167 Expr := Prefix (Expr);
3170 -- Anything else does not need checking
3177 end Find_Overlaid_Entity;
3179 -------------------------
3180 -- Find_Parameter_Type --
3181 -------------------------
3183 function Find_Parameter_Type (Param : Node_Id) return Entity_Id is
3185 if Nkind (Param) /= N_Parameter_Specification then
3188 -- For an access parameter, obtain the type from the formal entity
3189 -- itself, because access to subprogram nodes do not carry a type.
3190 -- Shouldn't we always use the formal entity ???
3192 elsif Nkind (Parameter_Type (Param)) = N_Access_Definition then
3193 return Etype (Defining_Identifier (Param));
3196 return Etype (Parameter_Type (Param));
3198 end Find_Parameter_Type;
3200 -----------------------------
3201 -- Find_Static_Alternative --
3202 -----------------------------
3204 function Find_Static_Alternative (N : Node_Id) return Node_Id is
3205 Expr : constant Node_Id := Expression (N);
3206 Val : constant Uint := Expr_Value (Expr);
3211 Alt := First (Alternatives (N));
3214 if Nkind (Alt) /= N_Pragma then
3215 Choice := First (Discrete_Choices (Alt));
3216 while Present (Choice) loop
3218 -- Others choice, always matches
3220 if Nkind (Choice) = N_Others_Choice then
3223 -- Range, check if value is in the range
3225 elsif Nkind (Choice) = N_Range then
3227 Val >= Expr_Value (Low_Bound (Choice))
3229 Val <= Expr_Value (High_Bound (Choice));
3231 -- Choice is a subtype name. Note that we know it must
3232 -- be a static subtype, since otherwise it would have
3233 -- been diagnosed as illegal.
3235 elsif Is_Entity_Name (Choice)
3236 and then Is_Type (Entity (Choice))
3238 exit Search when Is_In_Range (Expr, Etype (Choice),
3239 Assume_Valid => False);
3241 -- Choice is a subtype indication
3243 elsif Nkind (Choice) = N_Subtype_Indication then
3245 C : constant Node_Id := Constraint (Choice);
3246 R : constant Node_Id := Range_Expression (C);
3250 Val >= Expr_Value (Low_Bound (R))
3252 Val <= Expr_Value (High_Bound (R));
3255 -- Choice is a simple expression
3258 exit Search when Val = Expr_Value (Choice);
3266 pragma Assert (Present (Alt));
3269 -- The above loop *must* terminate by finding a match, since
3270 -- we know the case statement is valid, and the value of the
3271 -- expression is known at compile time. When we fall out of
3272 -- the loop, Alt points to the alternative that we know will
3273 -- be selected at run time.
3276 end Find_Static_Alternative;
3282 function First_Actual (Node : Node_Id) return Node_Id is
3286 if No (Parameter_Associations (Node)) then
3290 N := First (Parameter_Associations (Node));
3292 if Nkind (N) = N_Parameter_Association then
3293 return First_Named_Actual (Node);
3299 -------------------------
3300 -- Full_Qualified_Name --
3301 -------------------------
3303 function Full_Qualified_Name (E : Entity_Id) return String_Id is
3305 pragma Warnings (Off, Res);
3307 function Internal_Full_Qualified_Name (E : Entity_Id) return String_Id;
3308 -- Compute recursively the qualified name without NUL at the end
3310 ----------------------------------
3311 -- Internal_Full_Qualified_Name --
3312 ----------------------------------
3314 function Internal_Full_Qualified_Name (E : Entity_Id) return String_Id is
3315 Ent : Entity_Id := E;
3316 Parent_Name : String_Id := No_String;
3319 -- Deals properly with child units
3321 if Nkind (Ent) = N_Defining_Program_Unit_Name then
3322 Ent := Defining_Identifier (Ent);
3325 -- Compute qualification recursively (only "Standard" has no scope)
3327 if Present (Scope (Scope (Ent))) then
3328 Parent_Name := Internal_Full_Qualified_Name (Scope (Ent));
3331 -- Every entity should have a name except some expanded blocks
3332 -- don't bother about those.
3334 if Chars (Ent) = No_Name then
3338 -- Add a period between Name and qualification
3340 if Parent_Name /= No_String then
3341 Start_String (Parent_Name);
3342 Store_String_Char (Get_Char_Code ('.'));
3348 -- Generates the entity name in upper case
3350 Get_Decoded_Name_String (Chars (Ent));
3352 Store_String_Chars (Name_Buffer (1 .. Name_Len));
3354 end Internal_Full_Qualified_Name;
3356 -- Start of processing for Full_Qualified_Name
3359 Res := Internal_Full_Qualified_Name (E);
3360 Store_String_Char (Get_Char_Code (ASCII.NUL));
3362 end Full_Qualified_Name;
3364 -----------------------
3365 -- Gather_Components --
3366 -----------------------
3368 procedure Gather_Components
3370 Comp_List : Node_Id;
3371 Governed_By : List_Id;
3373 Report_Errors : out Boolean)
3377 Discrete_Choice : Node_Id;
3378 Comp_Item : Node_Id;
3380 Discrim : Entity_Id;
3381 Discrim_Name : Node_Id;
3382 Discrim_Value : Node_Id;
3385 Report_Errors := False;
3387 if No (Comp_List) or else Null_Present (Comp_List) then
3390 elsif Present (Component_Items (Comp_List)) then
3391 Comp_Item := First (Component_Items (Comp_List));
3397 while Present (Comp_Item) loop
3399 -- Skip the tag of a tagged record, the interface tags, as well
3400 -- as all items that are not user components (anonymous types,
3401 -- rep clauses, Parent field, controller field).
3403 if Nkind (Comp_Item) = N_Component_Declaration then
3405 Comp : constant Entity_Id := Defining_Identifier (Comp_Item);
3407 if not Is_Tag (Comp)
3408 and then Chars (Comp) /= Name_uParent
3409 and then Chars (Comp) /= Name_uController
3411 Append_Elmt (Comp, Into);
3419 if No (Variant_Part (Comp_List)) then
3422 Discrim_Name := Name (Variant_Part (Comp_List));
3423 Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
3426 -- Look for the discriminant that governs this variant part.
3427 -- The discriminant *must* be in the Governed_By List
3429 Assoc := First (Governed_By);
3430 Find_Constraint : loop
3431 Discrim := First (Choices (Assoc));
3432 exit Find_Constraint when Chars (Discrim_Name) = Chars (Discrim)
3433 or else (Present (Corresponding_Discriminant (Entity (Discrim)))
3435 Chars (Corresponding_Discriminant (Entity (Discrim)))
3436 = Chars (Discrim_Name))
3437 or else Chars (Original_Record_Component (Entity (Discrim)))
3438 = Chars (Discrim_Name);
3440 if No (Next (Assoc)) then
3441 if not Is_Constrained (Typ)
3442 and then Is_Derived_Type (Typ)
3443 and then Present (Stored_Constraint (Typ))
3445 -- If the type is a tagged type with inherited discriminants,
3446 -- use the stored constraint on the parent in order to find
3447 -- the values of discriminants that are otherwise hidden by an
3448 -- explicit constraint. Renamed discriminants are handled in
3451 -- If several parent discriminants are renamed by a single
3452 -- discriminant of the derived type, the call to obtain the
3453 -- Corresponding_Discriminant field only retrieves the last
3454 -- of them. We recover the constraint on the others from the
3455 -- Stored_Constraint as well.
3462 D := First_Discriminant (Etype (Typ));
3463 C := First_Elmt (Stored_Constraint (Typ));
3464 while Present (D) and then Present (C) loop
3465 if Chars (Discrim_Name) = Chars (D) then
3466 if Is_Entity_Name (Node (C))
3467 and then Entity (Node (C)) = Entity (Discrim)
3469 -- D is renamed by Discrim, whose value is given in
3476 Make_Component_Association (Sloc (Typ),
3478 (New_Occurrence_Of (D, Sloc (Typ))),
3479 Duplicate_Subexpr_No_Checks (Node (C)));
3481 exit Find_Constraint;
3484 Next_Discriminant (D);
3491 if No (Next (Assoc)) then
3492 Error_Msg_NE (" missing value for discriminant&",
3493 First (Governed_By), Discrim_Name);
3494 Report_Errors := True;
3499 end loop Find_Constraint;
3501 Discrim_Value := Expression (Assoc);
3503 if not Is_OK_Static_Expression (Discrim_Value) then
3505 ("value for discriminant & must be static!",
3506 Discrim_Value, Discrim);
3507 Why_Not_Static (Discrim_Value);
3508 Report_Errors := True;
3512 Search_For_Discriminant_Value : declare
3518 UI_Discrim_Value : constant Uint := Expr_Value (Discrim_Value);
3521 Find_Discrete_Value : while Present (Variant) loop
3522 Discrete_Choice := First (Discrete_Choices (Variant));
3523 while Present (Discrete_Choice) loop
3525 exit Find_Discrete_Value when
3526 Nkind (Discrete_Choice) = N_Others_Choice;
3528 Get_Index_Bounds (Discrete_Choice, Low, High);
3530 UI_Low := Expr_Value (Low);
3531 UI_High := Expr_Value (High);
3533 exit Find_Discrete_Value when
3534 UI_Low <= UI_Discrim_Value
3536 UI_High >= UI_Discrim_Value;
3538 Next (Discrete_Choice);
3541 Next_Non_Pragma (Variant);
3542 end loop Find_Discrete_Value;
3543 end Search_For_Discriminant_Value;
3545 if No (Variant) then
3547 ("value of discriminant & is out of range", Discrim_Value, Discrim);
3548 Report_Errors := True;
3552 -- If we have found the corresponding choice, recursively add its
3553 -- components to the Into list.
3555 Gather_Components (Empty,
3556 Component_List (Variant), Governed_By, Into, Report_Errors);
3557 end Gather_Components;
3559 ------------------------
3560 -- Get_Actual_Subtype --
3561 ------------------------
3563 function Get_Actual_Subtype (N : Node_Id) return Entity_Id is
3564 Typ : constant Entity_Id := Etype (N);
3565 Utyp : Entity_Id := Underlying_Type (Typ);
3574 -- If what we have is an identifier that references a subprogram
3575 -- formal, or a variable or constant object, then we get the actual
3576 -- subtype from the referenced entity if one has been built.
3578 if Nkind (N) = N_Identifier
3580 (Is_Formal (Entity (N))
3581 or else Ekind (Entity (N)) = E_Constant
3582 or else Ekind (Entity (N)) = E_Variable)
3583 and then Present (Actual_Subtype (Entity (N)))
3585 return Actual_Subtype (Entity (N));
3587 -- Actual subtype of unchecked union is always itself. We never need
3588 -- the "real" actual subtype. If we did, we couldn't get it anyway
3589 -- because the discriminant is not available. The restrictions on
3590 -- Unchecked_Union are designed to make sure that this is OK.
3592 elsif Is_Unchecked_Union (Base_Type (Utyp)) then
3595 -- Here for the unconstrained case, we must find actual subtype
3596 -- No actual subtype is available, so we must build it on the fly.
3598 -- Checking the type, not the underlying type, for constrainedness
3599 -- seems to be necessary. Maybe all the tests should be on the type???
3601 elsif (not Is_Constrained (Typ))
3602 and then (Is_Array_Type (Utyp)
3603 or else (Is_Record_Type (Utyp)
3604 and then Has_Discriminants (Utyp)))
3605 and then not Has_Unknown_Discriminants (Utyp)
3606 and then not (Ekind (Utyp) = E_String_Literal_Subtype)
3608 -- Nothing to do if in spec expression (why not???)
3610 if In_Spec_Expression then
3613 elsif Is_Private_Type (Typ)
3614 and then not Has_Discriminants (Typ)
3616 -- If the type has no discriminants, there is no subtype to
3617 -- build, even if the underlying type is discriminated.
3621 -- Else build the actual subtype
3624 Decl := Build_Actual_Subtype (Typ, N);
3625 Atyp := Defining_Identifier (Decl);
3627 -- If Build_Actual_Subtype generated a new declaration then use it
3631 -- The actual subtype is an Itype, so analyze the declaration,
3632 -- but do not attach it to the tree, to get the type defined.
3634 Set_Parent (Decl, N);
3635 Set_Is_Itype (Atyp);
3636 Analyze (Decl, Suppress => All_Checks);
3637 Set_Associated_Node_For_Itype (Atyp, N);
3638 Set_Has_Delayed_Freeze (Atyp, False);
3640 -- We need to freeze the actual subtype immediately. This is
3641 -- needed, because otherwise this Itype will not get frozen
3642 -- at all, and it is always safe to freeze on creation because
3643 -- any associated types must be frozen at this point.
3645 Freeze_Itype (Atyp, N);
3648 -- Otherwise we did not build a declaration, so return original
3655 -- For all remaining cases, the actual subtype is the same as
3656 -- the nominal type.
3661 end Get_Actual_Subtype;
3663 -------------------------------------
3664 -- Get_Actual_Subtype_If_Available --
3665 -------------------------------------
3667 function Get_Actual_Subtype_If_Available (N : Node_Id) return Entity_Id is
3668 Typ : constant Entity_Id := Etype (N);
3671 -- If what we have is an identifier that references a subprogram
3672 -- formal, or a variable or constant object, then we get the actual
3673 -- subtype from the referenced entity if one has been built.
3675 if Nkind (N) = N_Identifier
3677 (Is_Formal (Entity (N))
3678 or else Ekind (Entity (N)) = E_Constant
3679 or else Ekind (Entity (N)) = E_Variable)
3680 and then Present (Actual_Subtype (Entity (N)))
3682 return Actual_Subtype (Entity (N));
3684 -- Otherwise the Etype of N is returned unchanged
3689 end Get_Actual_Subtype_If_Available;
3691 -------------------------------
3692 -- Get_Default_External_Name --
3693 -------------------------------
3695 function Get_Default_External_Name (E : Node_Or_Entity_Id) return Node_Id is
3697 Get_Decoded_Name_String (Chars (E));
3699 if Opt.External_Name_Imp_Casing = Uppercase then
3700 Set_Casing (All_Upper_Case);
3702 Set_Casing (All_Lower_Case);
3706 Make_String_Literal (Sloc (E),
3707 Strval => String_From_Name_Buffer);
3708 end Get_Default_External_Name;
3710 ---------------------------
3711 -- Get_Enum_Lit_From_Pos --
3712 ---------------------------
3714 function Get_Enum_Lit_From_Pos
3717 Loc : Source_Ptr) return Node_Id
3722 -- In the case where the literal is of type Character, Wide_Character
3723 -- or Wide_Wide_Character or of a type derived from them, there needs
3724 -- to be some special handling since there is no explicit chain of
3725 -- literals to search. Instead, an N_Character_Literal node is created
3726 -- with the appropriate Char_Code and Chars fields.
3728 if Is_Standard_Character_Type (T) then
3729 Set_Character_Literal_Name (UI_To_CC (Pos));
3731 Make_Character_Literal (Loc,
3733 Char_Literal_Value => Pos);
3735 -- For all other cases, we have a complete table of literals, and
3736 -- we simply iterate through the chain of literal until the one
3737 -- with the desired position value is found.
3741 Lit := First_Literal (Base_Type (T));
3742 for J in 1 .. UI_To_Int (Pos) loop
3746 return New_Occurrence_Of (Lit, Loc);
3748 end Get_Enum_Lit_From_Pos;
3750 ------------------------
3751 -- Get_Generic_Entity --
3752 ------------------------
3754 function Get_Generic_Entity (N : Node_Id) return Entity_Id is
3755 Ent : constant Entity_Id := Entity (Name (N));
3757 if Present (Renamed_Object (Ent)) then
3758 return Renamed_Object (Ent);
3762 end Get_Generic_Entity;
3764 ----------------------
3765 -- Get_Index_Bounds --
3766 ----------------------
3768 procedure Get_Index_Bounds (N : Node_Id; L, H : out Node_Id) is
3769 Kind : constant Node_Kind := Nkind (N);
3773 if Kind = N_Range then
3775 H := High_Bound (N);
3777 elsif Kind = N_Subtype_Indication then
3778 R := Range_Expression (Constraint (N));
3786 L := Low_Bound (Range_Expression (Constraint (N)));
3787 H := High_Bound (Range_Expression (Constraint (N)));
3790 elsif Is_Entity_Name (N) and then Is_Type (Entity (N)) then
3791 if Error_Posted (Scalar_Range (Entity (N))) then
3795 elsif Nkind (Scalar_Range (Entity (N))) = N_Subtype_Indication then
3796 Get_Index_Bounds (Scalar_Range (Entity (N)), L, H);
3799 L := Low_Bound (Scalar_Range (Entity (N)));
3800 H := High_Bound (Scalar_Range (Entity (N)));
3804 -- N is an expression, indicating a range with one value
3809 end Get_Index_Bounds;
3811 ----------------------------------
3812 -- Get_Library_Unit_Name_string --
3813 ----------------------------------
3815 procedure Get_Library_Unit_Name_String (Decl_Node : Node_Id) is
3816 Unit_Name_Id : constant Unit_Name_Type := Get_Unit_Name (Decl_Node);
3819 Get_Unit_Name_String (Unit_Name_Id);
3821 -- Remove seven last character (" (spec)" or " (body)")
3823 Name_Len := Name_Len - 7;
3824 pragma Assert (Name_Buffer (Name_Len + 1) = ' ');
3825 end Get_Library_Unit_Name_String;
3827 ------------------------
3828 -- Get_Name_Entity_Id --
3829 ------------------------
3831 function Get_Name_Entity_Id (Id : Name_Id) return Entity_Id is
3833 return Entity_Id (Get_Name_Table_Info (Id));
3834 end Get_Name_Entity_Id;
3840 function Get_Pragma_Id (N : Node_Id) return Pragma_Id is
3842 return Get_Pragma_Id (Pragma_Name (N));
3845 ---------------------------
3846 -- Get_Referenced_Object --
3847 ---------------------------
3849 function Get_Referenced_Object (N : Node_Id) return Node_Id is
3854 while Is_Entity_Name (R)
3855 and then Present (Renamed_Object (Entity (R)))
3857 R := Renamed_Object (Entity (R));
3861 end Get_Referenced_Object;
3863 ------------------------
3864 -- Get_Renamed_Entity --
3865 ------------------------
3867 function Get_Renamed_Entity (E : Entity_Id) return Entity_Id is
3872 while Present (Renamed_Entity (R)) loop
3873 R := Renamed_Entity (R);
3877 end Get_Renamed_Entity;
3879 -------------------------
3880 -- Get_Subprogram_Body --
3881 -------------------------
3883 function Get_Subprogram_Body (E : Entity_Id) return Node_Id is
3887 Decl := Unit_Declaration_Node (E);
3889 if Nkind (Decl) = N_Subprogram_Body then
3892 -- The below comment is bad, because it is possible for
3893 -- Nkind (Decl) to be an N_Subprogram_Body_Stub ???
3895 else -- Nkind (Decl) = N_Subprogram_Declaration
3897 if Present (Corresponding_Body (Decl)) then
3898 return Unit_Declaration_Node (Corresponding_Body (Decl));
3900 -- Imported subprogram case
3906 end Get_Subprogram_Body;
3908 ---------------------------
3909 -- Get_Subprogram_Entity --
3910 ---------------------------
3912 function Get_Subprogram_Entity (Nod : Node_Id) return Entity_Id is
3917 if Nkind (Nod) = N_Accept_Statement then
3918 Nam := Entry_Direct_Name (Nod);
3920 -- For an entry call, the prefix of the call is a selected component.
3921 -- Need additional code for internal calls ???
3923 elsif Nkind (Nod) = N_Entry_Call_Statement then
3924 if Nkind (Name (Nod)) = N_Selected_Component then
3925 Nam := Entity (Selector_Name (Name (Nod)));
3934 if Nkind (Nam) = N_Explicit_Dereference then
3935 Proc := Etype (Prefix (Nam));
3936 elsif Is_Entity_Name (Nam) then
3937 Proc := Entity (Nam);
3942 if Is_Object (Proc) then
3943 Proc := Etype (Proc);
3946 if Ekind (Proc) = E_Access_Subprogram_Type then
3947 Proc := Directly_Designated_Type (Proc);
3950 if not Is_Subprogram (Proc)
3951 and then Ekind (Proc) /= E_Subprogram_Type
3957 end Get_Subprogram_Entity;
3959 -----------------------------
3960 -- Get_Task_Body_Procedure --
3961 -----------------------------
3963 function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
3965 -- Note: A task type may be the completion of a private type with
3966 -- discriminants. When performing elaboration checks on a task
3967 -- declaration, the current view of the type may be the private one,
3968 -- and the procedure that holds the body of the task is held in its
3971 -- This is an odd function, why not have Task_Body_Procedure do
3972 -- the following digging???
3974 return Task_Body_Procedure (Underlying_Type (Root_Type (E)));
3975 end Get_Task_Body_Procedure;
3977 -----------------------
3978 -- Has_Access_Values --
3979 -----------------------
3981 function Has_Access_Values (T : Entity_Id) return Boolean is
3982 Typ : constant Entity_Id := Underlying_Type (T);
3985 -- Case of a private type which is not completed yet. This can only
3986 -- happen in the case of a generic format type appearing directly, or
3987 -- as a component of the type to which this function is being applied
3988 -- at the top level. Return False in this case, since we certainly do
3989 -- not know that the type contains access types.
3994 elsif Is_Access_Type (Typ) then
3997 elsif Is_Array_Type (Typ) then
3998 return Has_Access_Values (Component_Type (Typ));
4000 elsif Is_Record_Type (Typ) then
4005 -- Loop to Check components
4007 Comp := First_Component_Or_Discriminant (Typ);
4008 while Present (Comp) loop
4010 -- Check for access component, tag field does not count, even
4011 -- though it is implemented internally using an access type.
4013 if Has_Access_Values (Etype (Comp))
4014 and then Chars (Comp) /= Name_uTag
4019 Next_Component_Or_Discriminant (Comp);
4028 end Has_Access_Values;
4030 ------------------------------
4031 -- Has_Compatible_Alignment --
4032 ------------------------------
4034 function Has_Compatible_Alignment
4036 Expr : Node_Id) return Alignment_Result
4038 function Has_Compatible_Alignment_Internal
4041 Default : Alignment_Result) return Alignment_Result;
4042 -- This is the internal recursive function that actually does the work.
4043 -- There is one additional parameter, which says what the result should
4044 -- be if no alignment information is found, and there is no definite
4045 -- indication of compatible alignments. At the outer level, this is set
4046 -- to Unknown, but for internal recursive calls in the case where types
4047 -- are known to be correct, it is set to Known_Compatible.
4049 ---------------------------------------
4050 -- Has_Compatible_Alignment_Internal --
4051 ---------------------------------------
4053 function Has_Compatible_Alignment_Internal
4056 Default : Alignment_Result) return Alignment_Result
4058 Result : Alignment_Result := Known_Compatible;
4059 -- Holds the current status of the result. Note that once a value of
4060 -- Known_Incompatible is set, it is sticky and does not get changed
4061 -- to Unknown (the value in Result only gets worse as we go along,
4064 Offs : Uint := No_Uint;
4065 -- Set to a factor of the offset from the base object when Expr is a
4066 -- selected or indexed component, based on Component_Bit_Offset and
4067 -- Component_Size respectively. A negative value is used to represent
4068 -- a value which is not known at compile time.
4070 procedure Check_Prefix;
4071 -- Checks the prefix recursively in the case where the expression
4072 -- is an indexed or selected component.
4074 procedure Set_Result (R : Alignment_Result);
4075 -- If R represents a worse outcome (unknown instead of known
4076 -- compatible, or known incompatible), then set Result to R.
4082 procedure Check_Prefix is
4084 -- The subtlety here is that in doing a recursive call to check
4085 -- the prefix, we have to decide what to do in the case where we
4086 -- don't find any specific indication of an alignment problem.
4088 -- At the outer level, we normally set Unknown as the result in
4089 -- this case, since we can only set Known_Compatible if we really
4090 -- know that the alignment value is OK, but for the recursive
4091 -- call, in the case where the types match, and we have not
4092 -- specified a peculiar alignment for the object, we are only
4093 -- concerned about suspicious rep clauses, the default case does
4094 -- not affect us, since the compiler will, in the absence of such
4095 -- rep clauses, ensure that the alignment is correct.
4097 if Default = Known_Compatible
4099 (Etype (Obj) = Etype (Expr)
4100 and then (Unknown_Alignment (Obj)
4102 Alignment (Obj) = Alignment (Etype (Obj))))
4105 (Has_Compatible_Alignment_Internal
4106 (Obj, Prefix (Expr), Known_Compatible));
4108 -- In all other cases, we need a full check on the prefix
4112 (Has_Compatible_Alignment_Internal
4113 (Obj, Prefix (Expr), Unknown));
4121 procedure Set_Result (R : Alignment_Result) is
4128 -- Start of processing for Has_Compatible_Alignment_Internal
4131 -- If Expr is a selected component, we must make sure there is no
4132 -- potentially troublesome component clause, and that the record is
4135 if Nkind (Expr) = N_Selected_Component then
4137 -- Packed record always generate unknown alignment
4139 if Is_Packed (Etype (Prefix (Expr))) then
4140 Set_Result (Unknown);
4143 -- Check prefix and component offset
4146 Offs := Component_Bit_Offset (Entity (Selector_Name (Expr)));
4148 -- If Expr is an indexed component, we must make sure there is no
4149 -- potentially troublesome Component_Size clause and that the array
4150 -- is not bit-packed.
4152 elsif Nkind (Expr) = N_Indexed_Component then
4154 Typ : constant Entity_Id := Etype (Prefix (Expr));
4155 Ind : constant Node_Id := First_Index (Typ);
4158 -- Bit packed array always generates unknown alignment
4160 if Is_Bit_Packed_Array (Typ) then
4161 Set_Result (Unknown);
4164 -- Check prefix and component offset
4167 Offs := Component_Size (Typ);
4169 -- Small optimization: compute the full offset when possible
4172 and then Offs > Uint_0
4173 and then Present (Ind)
4174 and then Nkind (Ind) = N_Range
4175 and then Compile_Time_Known_Value (Low_Bound (Ind))
4176 and then Compile_Time_Known_Value (First (Expressions (Expr)))
4178 Offs := Offs * (Expr_Value (First (Expressions (Expr)))
4179 - Expr_Value (Low_Bound ((Ind))));
4184 -- If we have a null offset, the result is entirely determined by
4185 -- the base object and has already been computed recursively.
4187 if Offs = Uint_0 then
4190 -- Case where we know the alignment of the object
4192 elsif Known_Alignment (Obj) then
4194 ObjA : constant Uint := Alignment (Obj);
4195 ExpA : Uint := No_Uint;
4196 SizA : Uint := No_Uint;
4199 -- If alignment of Obj is 1, then we are always OK
4202 Set_Result (Known_Compatible);
4204 -- Alignment of Obj is greater than 1, so we need to check
4207 -- If we have an offset, see if it is compatible
4209 if Offs /= No_Uint and Offs > Uint_0 then
4210 if Offs mod (System_Storage_Unit * ObjA) /= 0 then
4211 Set_Result (Known_Incompatible);
4214 -- See if Expr is an object with known alignment
4216 elsif Is_Entity_Name (Expr)
4217 and then Known_Alignment (Entity (Expr))
4219 ExpA := Alignment (Entity (Expr));
4221 -- Otherwise, we can use the alignment of the type of
4222 -- Expr given that we already checked for
4223 -- discombobulating rep clauses for the cases of indexed
4224 -- and selected components above.
4226 elsif Known_Alignment (Etype (Expr)) then
4227 ExpA := Alignment (Etype (Expr));
4229 -- Otherwise the alignment is unknown
4232 Set_Result (Default);
4235 -- If we got an alignment, see if it is acceptable
4237 if ExpA /= No_Uint and then ExpA < ObjA then
4238 Set_Result (Known_Incompatible);
4241 -- If Expr is not a piece of a larger object, see if size
4242 -- is given. If so, check that it is not too small for the
4243 -- required alignment.
4245 if Offs /= No_Uint then
4248 -- See if Expr is an object with known size
4250 elsif Is_Entity_Name (Expr)
4251 and then Known_Static_Esize (Entity (Expr))
4253 SizA := Esize (Entity (Expr));
4255 -- Otherwise, we check the object size of the Expr type
4257 elsif Known_Static_Esize (Etype (Expr)) then
4258 SizA := Esize (Etype (Expr));
4261 -- If we got a size, see if it is a multiple of the Obj
4262 -- alignment, if not, then the alignment cannot be
4263 -- acceptable, since the size is always a multiple of the
4266 if SizA /= No_Uint then
4267 if SizA mod (ObjA * Ttypes.System_Storage_Unit) /= 0 then
4268 Set_Result (Known_Incompatible);
4274 -- If we do not know required alignment, any non-zero offset is a
4275 -- potential problem (but certainly may be OK, so result is unknown).
4277 elsif Offs /= No_Uint then
4278 Set_Result (Unknown);
4280 -- If we can't find the result by direct comparison of alignment
4281 -- values, then there is still one case that we can determine known
4282 -- result, and that is when we can determine that the types are the
4283 -- same, and no alignments are specified. Then we known that the
4284 -- alignments are compatible, even if we don't know the alignment
4285 -- value in the front end.
4287 elsif Etype (Obj) = Etype (Expr) then
4289 -- Types are the same, but we have to check for possible size
4290 -- and alignments on the Expr object that may make the alignment
4291 -- different, even though the types are the same.
4293 if Is_Entity_Name (Expr) then
4295 -- First check alignment of the Expr object. Any alignment less
4296 -- than Maximum_Alignment is worrisome since this is the case
4297 -- where we do not know the alignment of Obj.
4299 if Known_Alignment (Entity (Expr))
4301 UI_To_Int (Alignment (Entity (Expr))) <
4302 Ttypes.Maximum_Alignment
4304 Set_Result (Unknown);
4306 -- Now check size of Expr object. Any size that is not an
4307 -- even multiple of Maximum_Alignment is also worrisome
4308 -- since it may cause the alignment of the object to be less
4309 -- than the alignment of the type.
4311 elsif Known_Static_Esize (Entity (Expr))
4313 (UI_To_Int (Esize (Entity (Expr))) mod
4314 (Ttypes.Maximum_Alignment * Ttypes.System_Storage_Unit))
4317 Set_Result (Unknown);
4319 -- Otherwise same type is decisive
4322 Set_Result (Known_Compatible);
4326 -- Another case to deal with is when there is an explicit size or
4327 -- alignment clause when the types are not the same. If so, then the
4328 -- result is Unknown. We don't need to do this test if the Default is
4329 -- Unknown, since that result will be set in any case.
4331 elsif Default /= Unknown
4332 and then (Has_Size_Clause (Etype (Expr))
4334 Has_Alignment_Clause (Etype (Expr)))
4336 Set_Result (Unknown);
4338 -- If no indication found, set default
4341 Set_Result (Default);
4344 -- Return worst result found
4347 end Has_Compatible_Alignment_Internal;
4349 -- Start of processing for Has_Compatible_Alignment
4352 -- If Obj has no specified alignment, then set alignment from the type
4353 -- alignment. Perhaps we should always do this, but for sure we should
4354 -- do it when there is an address clause since we can do more if the
4355 -- alignment is known.
4357 if Unknown_Alignment (Obj) then
4358 Set_Alignment (Obj, Alignment (Etype (Obj)));
4361 -- Now do the internal call that does all the work
4363 return Has_Compatible_Alignment_Internal (Obj, Expr, Unknown);
4364 end Has_Compatible_Alignment;
4366 ----------------------
4367 -- Has_Declarations --
4368 ----------------------
4370 function Has_Declarations (N : Node_Id) return Boolean is
4372 return Nkind_In (Nkind (N), N_Accept_Statement,
4374 N_Compilation_Unit_Aux,
4380 N_Package_Specification);
4381 end Has_Declarations;
4383 -------------------------------------------
4384 -- Has_Discriminant_Dependent_Constraint --
4385 -------------------------------------------
4387 function Has_Discriminant_Dependent_Constraint
4388 (Comp : Entity_Id) return Boolean
4390 Comp_Decl : constant Node_Id := Parent (Comp);
4391 Subt_Indic : constant Node_Id :=
4392 Subtype_Indication (Component_Definition (Comp_Decl));
4397 if Nkind (Subt_Indic) = N_Subtype_Indication then
4398 Constr := Constraint (Subt_Indic);
4400 if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
4401 Assn := First (Constraints (Constr));
4402 while Present (Assn) loop
4403 case Nkind (Assn) is
4404 when N_Subtype_Indication |
4408 if Depends_On_Discriminant (Assn) then
4412 when N_Discriminant_Association =>
4413 if Depends_On_Discriminant (Expression (Assn)) then
4428 end Has_Discriminant_Dependent_Constraint;
4430 --------------------
4431 -- Has_Infinities --
4432 --------------------
4434 function Has_Infinities (E : Entity_Id) return Boolean is
4437 Is_Floating_Point_Type (E)
4438 and then Nkind (Scalar_Range (E)) = N_Range
4439 and then Includes_Infinities (Scalar_Range (E));
4442 --------------------
4443 -- Has_Interfaces --
4444 --------------------
4446 function Has_Interfaces
4448 Use_Full_View : Boolean := True) return Boolean
4453 -- Handle concurrent types
4455 if Is_Concurrent_Type (T) then
4456 Typ := Corresponding_Record_Type (T);
4461 if not Present (Typ)
4462 or else not Is_Record_Type (Typ)
4463 or else not Is_Tagged_Type (Typ)
4468 -- Handle private types
4471 and then Present (Full_View (Typ))
4473 Typ := Full_View (Typ);
4476 -- Handle concurrent record types
4478 if Is_Concurrent_Record_Type (Typ)
4479 and then Is_Non_Empty_List (Abstract_Interface_List (Typ))
4485 if Is_Interface (Typ)
4487 (Is_Record_Type (Typ)
4488 and then Present (Interfaces (Typ))
4489 and then not Is_Empty_Elmt_List (Interfaces (Typ)))
4494 exit when Etype (Typ) = Typ
4496 -- Handle private types
4498 or else (Present (Full_View (Etype (Typ)))
4499 and then Full_View (Etype (Typ)) = Typ)
4501 -- Protect the frontend against wrong source with cyclic
4504 or else Etype (Typ) = T;
4506 -- Climb to the ancestor type handling private types
4508 if Present (Full_View (Etype (Typ))) then
4509 Typ := Full_View (Etype (Typ));
4518 ------------------------
4519 -- Has_Null_Exclusion --
4520 ------------------------
4522 function Has_Null_Exclusion (N : Node_Id) return Boolean is
4525 when N_Access_Definition |
4526 N_Access_Function_Definition |
4527 N_Access_Procedure_Definition |
4528 N_Access_To_Object_Definition |
4530 N_Derived_Type_Definition |
4531 N_Function_Specification |
4532 N_Subtype_Declaration =>
4533 return Null_Exclusion_Present (N);
4535 when N_Component_Definition |
4536 N_Formal_Object_Declaration |
4537 N_Object_Renaming_Declaration =>
4538 if Present (Subtype_Mark (N)) then
4539 return Null_Exclusion_Present (N);
4540 else pragma Assert (Present (Access_Definition (N)));
4541 return Null_Exclusion_Present (Access_Definition (N));
4544 when N_Discriminant_Specification =>
4545 if Nkind (Discriminant_Type (N)) = N_Access_Definition then
4546 return Null_Exclusion_Present (Discriminant_Type (N));
4548 return Null_Exclusion_Present (N);
4551 when N_Object_Declaration =>
4552 if Nkind (Object_Definition (N)) = N_Access_Definition then
4553 return Null_Exclusion_Present (Object_Definition (N));
4555 return Null_Exclusion_Present (N);
4558 when N_Parameter_Specification =>
4559 if Nkind (Parameter_Type (N)) = N_Access_Definition then
4560 return Null_Exclusion_Present (Parameter_Type (N));
4562 return Null_Exclusion_Present (N);
4569 end Has_Null_Exclusion;
4571 ------------------------
4572 -- Has_Null_Extension --
4573 ------------------------
4575 function Has_Null_Extension (T : Entity_Id) return Boolean is
4576 B : constant Entity_Id := Base_Type (T);
4581 if Nkind (Parent (B)) = N_Full_Type_Declaration
4582 and then Present (Record_Extension_Part (Type_Definition (Parent (B))))
4584 Ext := Record_Extension_Part (Type_Definition (Parent (B)));
4586 if Present (Ext) then
4587 if Null_Present (Ext) then
4590 Comps := Component_List (Ext);
4592 -- The null component list is rewritten during analysis to
4593 -- include the parent component. Any other component indicates
4594 -- that the extension was not originally null.
4596 return Null_Present (Comps)
4597 or else No (Next (First (Component_Items (Comps))));
4606 end Has_Null_Extension;
4608 -------------------------------
4609 -- Has_Overriding_Initialize --
4610 -------------------------------
4612 function Has_Overriding_Initialize (T : Entity_Id) return Boolean is
4613 BT : constant Entity_Id := Base_Type (T);
4618 if Is_Controlled (BT) then
4620 -- For derived types, check immediate ancestor, excluding
4621 -- Controlled itself.
4623 if Is_Derived_Type (BT)
4624 and then not In_Predefined_Unit (Etype (BT))
4625 and then Has_Overriding_Initialize (Etype (BT))
4629 elsif Present (Primitive_Operations (BT)) then
4630 P := First_Elmt (Primitive_Operations (BT));
4631 while Present (P) loop
4632 if Chars (Node (P)) = Name_Initialize
4633 and then Comes_From_Source (Node (P))
4644 elsif Has_Controlled_Component (BT) then
4645 Comp := First_Component (BT);
4646 while Present (Comp) loop
4647 if Has_Overriding_Initialize (Etype (Comp)) then
4651 Next_Component (Comp);
4659 end Has_Overriding_Initialize;
4661 --------------------------------------
4662 -- Has_Preelaborable_Initialization --
4663 --------------------------------------
4665 function Has_Preelaborable_Initialization (E : Entity_Id) return Boolean is
4668 procedure Check_Components (E : Entity_Id);
4669 -- Check component/discriminant chain, sets Has_PE False if a component
4670 -- or discriminant does not meet the preelaborable initialization rules.
4672 ----------------------
4673 -- Check_Components --
4674 ----------------------
4676 procedure Check_Components (E : Entity_Id) is
4680 function Is_Preelaborable_Expression (N : Node_Id) return Boolean;
4681 -- Returns True if and only if the expression denoted by N does not
4682 -- violate restrictions on preelaborable constructs (RM-10.2.1(5-9)).
4684 ---------------------------------
4685 -- Is_Preelaborable_Expression --
4686 ---------------------------------
4688 function Is_Preelaborable_Expression (N : Node_Id) return Boolean is
4692 Comp_Type : Entity_Id;
4693 Is_Array_Aggr : Boolean;
4696 if Is_Static_Expression (N) then
4699 elsif Nkind (N) = N_Null then
4702 -- Attributes are allowed in general, even if their prefix is a
4703 -- formal type. (It seems that certain attributes known not to be
4704 -- static might not be allowed, but there are no rules to prevent
4707 elsif Nkind (N) = N_Attribute_Reference then
4710 -- The name of a discriminant evaluated within its parent type is
4711 -- defined to be preelaborable (10.2.1(8)). Note that we test for
4712 -- names that denote discriminals as well as discriminants to
4713 -- catch references occurring within init procs.
4715 elsif Is_Entity_Name (N)
4717 (Ekind (Entity (N)) = E_Discriminant
4719 ((Ekind (Entity (N)) = E_Constant
4720 or else Ekind (Entity (N)) = E_In_Parameter)
4721 and then Present (Discriminal_Link (Entity (N)))))
4725 elsif Nkind (N) = N_Qualified_Expression then
4726 return Is_Preelaborable_Expression (Expression (N));
4728 -- For aggregates we have to check that each of the associations
4729 -- is preelaborable.
4731 elsif Nkind (N) = N_Aggregate
4732 or else Nkind (N) = N_Extension_Aggregate
4734 Is_Array_Aggr := Is_Array_Type (Etype (N));
4736 if Is_Array_Aggr then
4737 Comp_Type := Component_Type (Etype (N));
4740 -- Check the ancestor part of extension aggregates, which must
4741 -- be either the name of a type that has preelaborable init or
4742 -- an expression that is preelaborable.
4744 if Nkind (N) = N_Extension_Aggregate then
4746 Anc_Part : constant Node_Id := Ancestor_Part (N);
4749 if Is_Entity_Name (Anc_Part)
4750 and then Is_Type (Entity (Anc_Part))
4752 if not Has_Preelaborable_Initialization
4758 elsif not Is_Preelaborable_Expression (Anc_Part) then
4764 -- Check positional associations
4766 Exp := First (Expressions (N));
4767 while Present (Exp) loop
4768 if not Is_Preelaborable_Expression (Exp) then
4775 -- Check named associations
4777 Assn := First (Component_Associations (N));
4778 while Present (Assn) loop
4779 Choice := First (Choices (Assn));
4780 while Present (Choice) loop
4781 if Is_Array_Aggr then
4782 if Nkind (Choice) = N_Others_Choice then
4785 elsif Nkind (Choice) = N_Range then
4786 if not Is_Static_Range (Choice) then
4790 elsif not Is_Static_Expression (Choice) then
4795 Comp_Type := Etype (Choice);
4801 -- If the association has a <> at this point, then we have
4802 -- to check whether the component's type has preelaborable
4803 -- initialization. Note that this only occurs when the
4804 -- association's corresponding component does not have a
4805 -- default expression, the latter case having already been
4806 -- expanded as an expression for the association.
4808 if Box_Present (Assn) then
4809 if not Has_Preelaborable_Initialization (Comp_Type) then
4813 -- In the expression case we check whether the expression
4814 -- is preelaborable.
4817 not Is_Preelaborable_Expression (Expression (Assn))
4825 -- If we get here then aggregate as a whole is preelaborable
4829 -- All other cases are not preelaborable
4834 end Is_Preelaborable_Expression;
4836 -- Start of processing for Check_Components
4839 -- Loop through entities of record or protected type
4842 while Present (Ent) loop
4844 -- We are interested only in components and discriminants
4846 if Ekind_In (Ent, E_Component, E_Discriminant) then
4848 -- Get default expression if any. If there is no declaration
4849 -- node, it means we have an internal entity. The parent and
4850 -- tag fields are examples of such entities. For these cases,
4851 -- we just test the type of the entity.
4853 if Present (Declaration_Node (Ent)) then
4854 Exp := Expression (Declaration_Node (Ent));
4859 -- A component has PI if it has no default expression and the
4860 -- component type has PI.
4863 if not Has_Preelaborable_Initialization (Etype (Ent)) then
4868 -- Require the default expression to be preelaborable
4870 elsif not Is_Preelaborable_Expression (Exp) then
4878 end Check_Components;
4880 -- Start of processing for Has_Preelaborable_Initialization
4883 -- Immediate return if already marked as known preelaborable init. This
4884 -- covers types for which this function has already been called once
4885 -- and returned True (in which case the result is cached), and also
4886 -- types to which a pragma Preelaborable_Initialization applies.
4888 if Known_To_Have_Preelab_Init (E) then
4892 -- If the type is a subtype representing a generic actual type, then
4893 -- test whether its base type has preelaborable initialization since
4894 -- the subtype representing the actual does not inherit this attribute
4895 -- from the actual or formal. (but maybe it should???)
4897 if Is_Generic_Actual_Type (E) then
4898 return Has_Preelaborable_Initialization (Base_Type (E));
4901 -- All elementary types have preelaborable initialization
4903 if Is_Elementary_Type (E) then
4906 -- Array types have PI if the component type has PI
4908 elsif Is_Array_Type (E) then
4909 Has_PE := Has_Preelaborable_Initialization (Component_Type (E));
4911 -- A derived type has preelaborable initialization if its parent type
4912 -- has preelaborable initialization and (in the case of a derived record
4913 -- extension) if the non-inherited components all have preelaborable
4914 -- initialization. However, a user-defined controlled type with an
4915 -- overriding Initialize procedure does not have preelaborable
4918 elsif Is_Derived_Type (E) then
4920 -- If the derived type is a private extension then it doesn't have
4921 -- preelaborable initialization.
4923 if Ekind (Base_Type (E)) = E_Record_Type_With_Private then
4927 -- First check whether ancestor type has preelaborable initialization
4929 Has_PE := Has_Preelaborable_Initialization (Etype (Base_Type (E)));
4931 -- If OK, check extension components (if any)
4933 if Has_PE and then Is_Record_Type (E) then
4934 Check_Components (First_Entity (E));
4937 -- Check specifically for 10.2.1(11.4/2) exception: a controlled type
4938 -- with a user defined Initialize procedure does not have PI.
4941 and then Is_Controlled (E)
4942 and then Has_Overriding_Initialize (E)
4947 -- Private types not derived from a type having preelaborable init and
4948 -- that are not marked with pragma Preelaborable_Initialization do not
4949 -- have preelaborable initialization.
4951 elsif Is_Private_Type (E) then
4954 -- Record type has PI if it is non private and all components have PI
4956 elsif Is_Record_Type (E) then
4958 Check_Components (First_Entity (E));
4960 -- Protected types must not have entries, and components must meet
4961 -- same set of rules as for record components.
4963 elsif Is_Protected_Type (E) then
4964 if Has_Entries (E) then
4968 Check_Components (First_Entity (E));
4969 Check_Components (First_Private_Entity (E));
4972 -- Type System.Address always has preelaborable initialization
4974 elsif Is_RTE (E, RE_Address) then
4977 -- In all other cases, type does not have preelaborable initialization
4983 -- If type has preelaborable initialization, cache result
4986 Set_Known_To_Have_Preelab_Init (E);
4990 end Has_Preelaborable_Initialization;
4992 ---------------------------
4993 -- Has_Private_Component --
4994 ---------------------------
4996 function Has_Private_Component (Type_Id : Entity_Id) return Boolean is
4997 Btype : Entity_Id := Base_Type (Type_Id);
4998 Component : Entity_Id;
5001 if Error_Posted (Type_Id)
5002 or else Error_Posted (Btype)
5007 if Is_Class_Wide_Type (Btype) then
5008 Btype := Root_Type (Btype);
5011 if Is_Private_Type (Btype) then
5013 UT : constant Entity_Id := Underlying_Type (Btype);
5016 if No (Full_View (Btype)) then
5017 return not Is_Generic_Type (Btype)
5018 and then not Is_Generic_Type (Root_Type (Btype));
5020 return not Is_Generic_Type (Root_Type (Full_View (Btype)));
5023 return not Is_Frozen (UT) and then Has_Private_Component (UT);
5027 elsif Is_Array_Type (Btype) then
5028 return Has_Private_Component (Component_Type (Btype));
5030 elsif Is_Record_Type (Btype) then
5031 Component := First_Component (Btype);
5032 while Present (Component) loop
5033 if Has_Private_Component (Etype (Component)) then
5037 Next_Component (Component);
5042 elsif Is_Protected_Type (Btype)
5043 and then Present (Corresponding_Record_Type (Btype))
5045 return Has_Private_Component (Corresponding_Record_Type (Btype));
5050 end Has_Private_Component;
5056 function Has_Stream (T : Entity_Id) return Boolean is
5063 elsif Is_RTE (Root_Type (T), RE_Root_Stream_Type) then
5066 elsif Is_Array_Type (T) then
5067 return Has_Stream (Component_Type (T));
5069 elsif Is_Record_Type (T) then
5070 E := First_Component (T);
5071 while Present (E) loop
5072 if Has_Stream (Etype (E)) then
5081 elsif Is_Private_Type (T) then
5082 return Has_Stream (Underlying_Type (T));
5089 --------------------------
5090 -- Has_Tagged_Component --
5091 --------------------------
5093 function Has_Tagged_Component (Typ : Entity_Id) return Boolean is
5097 if Is_Private_Type (Typ)
5098 and then Present (Underlying_Type (Typ))
5100 return Has_Tagged_Component (Underlying_Type (Typ));
5102 elsif Is_Array_Type (Typ) then
5103 return Has_Tagged_Component (Component_Type (Typ));
5105 elsif Is_Tagged_Type (Typ) then
5108 elsif Is_Record_Type (Typ) then
5109 Comp := First_Component (Typ);
5110 while Present (Comp) loop
5111 if Has_Tagged_Component (Etype (Comp)) then
5115 Next_Component (Comp);
5123 end Has_Tagged_Component;
5125 --------------------------
5126 -- Implements_Interface --
5127 --------------------------
5129 function Implements_Interface
5130 (Typ_Ent : Entity_Id;
5131 Iface_Ent : Entity_Id;
5132 Exclude_Parents : Boolean := False) return Boolean
5134 Ifaces_List : Elist_Id;
5136 Iface : Entity_Id := Base_Type (Iface_Ent);
5137 Typ : Entity_Id := Base_Type (Typ_Ent);
5140 if Is_Class_Wide_Type (Typ) then
5141 Typ := Root_Type (Typ);
5144 if not Has_Interfaces (Typ) then
5148 if Is_Class_Wide_Type (Iface) then
5149 Iface := Root_Type (Iface);
5152 Collect_Interfaces (Typ, Ifaces_List);
5154 Elmt := First_Elmt (Ifaces_List);
5155 while Present (Elmt) loop
5156 if Is_Ancestor (Node (Elmt), Typ)
5157 and then Exclude_Parents
5161 elsif Node (Elmt) = Iface then
5169 end Implements_Interface;
5175 function In_Instance return Boolean is
5176 Curr_Unit : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
5182 and then S /= Standard_Standard
5184 if (Ekind (S) = E_Function
5185 or else Ekind (S) = E_Package
5186 or else Ekind (S) = E_Procedure)
5187 and then Is_Generic_Instance (S)
5189 -- A child instance is always compiled in the context of a parent
5190 -- instance. Nevertheless, the actuals are not analyzed in an
5191 -- instance context. We detect this case by examining the current
5192 -- compilation unit, which must be a child instance, and checking
5193 -- that it is not currently on the scope stack.
5195 if Is_Child_Unit (Curr_Unit)
5197 Nkind (Unit (Cunit (Current_Sem_Unit)))
5198 = N_Package_Instantiation
5199 and then not In_Open_Scopes (Curr_Unit)
5213 ----------------------
5214 -- In_Instance_Body --
5215 ----------------------
5217 function In_Instance_Body return Boolean is
5223 and then S /= Standard_Standard
5225 if (Ekind (S) = E_Function
5226 or else Ekind (S) = E_Procedure)
5227 and then Is_Generic_Instance (S)
5231 elsif Ekind (S) = E_Package
5232 and then In_Package_Body (S)
5233 and then Is_Generic_Instance (S)
5242 end In_Instance_Body;
5244 -----------------------------
5245 -- In_Instance_Not_Visible --
5246 -----------------------------
5248 function In_Instance_Not_Visible return Boolean is
5254 and then S /= Standard_Standard
5256 if (Ekind (S) = E_Function
5257 or else Ekind (S) = E_Procedure)
5258 and then Is_Generic_Instance (S)
5262 elsif Ekind (S) = E_Package
5263 and then (In_Package_Body (S) or else In_Private_Part (S))
5264 and then Is_Generic_Instance (S)
5273 end In_Instance_Not_Visible;
5275 ------------------------------
5276 -- In_Instance_Visible_Part --
5277 ------------------------------
5279 function In_Instance_Visible_Part return Boolean is
5285 and then S /= Standard_Standard
5287 if Ekind (S) = E_Package
5288 and then Is_Generic_Instance (S)
5289 and then not In_Package_Body (S)
5290 and then not In_Private_Part (S)
5299 end In_Instance_Visible_Part;
5301 ---------------------
5302 -- In_Package_Body --
5303 ---------------------
5305 function In_Package_Body return Boolean is
5311 and then S /= Standard_Standard
5313 if Ekind (S) = E_Package
5314 and then In_Package_Body (S)
5323 end In_Package_Body;
5325 --------------------------------
5326 -- In_Parameter_Specification --
5327 --------------------------------
5329 function In_Parameter_Specification (N : Node_Id) return Boolean is
5334 while Present (PN) loop
5335 if Nkind (PN) = N_Parameter_Specification then
5343 end In_Parameter_Specification;
5345 --------------------------------------
5346 -- In_Subprogram_Or_Concurrent_Unit --
5347 --------------------------------------
5349 function In_Subprogram_Or_Concurrent_Unit return Boolean is
5354 -- Use scope chain to check successively outer scopes
5360 if K in Subprogram_Kind
5361 or else K in Concurrent_Kind
5362 or else K in Generic_Subprogram_Kind
5366 elsif E = Standard_Standard then
5372 end In_Subprogram_Or_Concurrent_Unit;
5374 ---------------------
5375 -- In_Visible_Part --
5376 ---------------------
5378 function In_Visible_Part (Scope_Id : Entity_Id) return Boolean is
5381 Is_Package_Or_Generic_Package (Scope_Id)
5382 and then In_Open_Scopes (Scope_Id)
5383 and then not In_Package_Body (Scope_Id)
5384 and then not In_Private_Part (Scope_Id);
5385 end In_Visible_Part;
5387 ---------------------------------
5388 -- Insert_Explicit_Dereference --
5389 ---------------------------------
5391 procedure Insert_Explicit_Dereference (N : Node_Id) is
5392 New_Prefix : constant Node_Id := Relocate_Node (N);
5393 Ent : Entity_Id := Empty;
5400 Save_Interps (N, New_Prefix);
5402 -- Check if the node relocation requires readjustment of some SCIL
5403 -- dispatching node.
5406 and then Nkind (N) = N_Function_Call
5408 Adjust_SCIL_Node (N, New_Prefix);
5411 Rewrite (N, Make_Explicit_Dereference (Sloc (N), Prefix => New_Prefix));
5413 Set_Etype (N, Designated_Type (Etype (New_Prefix)));
5415 if Is_Overloaded (New_Prefix) then
5417 -- The dereference is also overloaded, and its interpretations are
5418 -- the designated types of the interpretations of the original node.
5420 Set_Etype (N, Any_Type);
5422 Get_First_Interp (New_Prefix, I, It);
5423 while Present (It.Nam) loop
5426 if Is_Access_Type (T) then
5427 Add_One_Interp (N, Designated_Type (T), Designated_Type (T));
5430 Get_Next_Interp (I, It);
5436 -- Prefix is unambiguous: mark the original prefix (which might
5437 -- Come_From_Source) as a reference, since the new (relocated) one
5438 -- won't be taken into account.
5440 if Is_Entity_Name (New_Prefix) then
5441 Ent := Entity (New_Prefix);
5443 -- For a retrieval of a subcomponent of some composite object,
5444 -- retrieve the ultimate entity if there is one.
5446 elsif Nkind (New_Prefix) = N_Selected_Component
5447 or else Nkind (New_Prefix) = N_Indexed_Component
5449 Pref := Prefix (New_Prefix);
5450 while Present (Pref)
5452 (Nkind (Pref) = N_Selected_Component
5453 or else Nkind (Pref) = N_Indexed_Component)
5455 Pref := Prefix (Pref);
5458 if Present (Pref) and then Is_Entity_Name (Pref) then
5459 Ent := Entity (Pref);
5463 if Present (Ent) then
5464 Generate_Reference (Ent, New_Prefix);
5467 end Insert_Explicit_Dereference;
5469 ------------------------------------------
5470 -- Inspect_Deferred_Constant_Completion --
5471 ------------------------------------------
5473 procedure Inspect_Deferred_Constant_Completion (Decls : List_Id) is
5477 Decl := First (Decls);
5478 while Present (Decl) loop
5480 -- Deferred constant signature
5482 if Nkind (Decl) = N_Object_Declaration
5483 and then Constant_Present (Decl)
5484 and then No (Expression (Decl))
5486 -- No need to check internally generated constants
5488 and then Comes_From_Source (Decl)
5490 -- The constant is not completed. A full object declaration
5491 -- or a pragma Import complete a deferred constant.
5493 and then not Has_Completion (Defining_Identifier (Decl))
5496 ("constant declaration requires initialization expression",
5497 Defining_Identifier (Decl));
5500 Decl := Next (Decl);
5502 end Inspect_Deferred_Constant_Completion;
5508 function Is_AAMP_Float (E : Entity_Id) return Boolean is
5509 pragma Assert (Is_Type (E));
5511 return AAMP_On_Target
5512 and then Is_Floating_Point_Type (E)
5513 and then E = Base_Type (E);
5516 -----------------------------
5517 -- Is_Actual_Out_Parameter --
5518 -----------------------------
5520 function Is_Actual_Out_Parameter (N : Node_Id) return Boolean is
5524 Find_Actual (N, Formal, Call);
5525 return Present (Formal)
5526 and then Ekind (Formal) = E_Out_Parameter;
5527 end Is_Actual_Out_Parameter;
5529 -------------------------
5530 -- Is_Actual_Parameter --
5531 -------------------------
5533 function Is_Actual_Parameter (N : Node_Id) return Boolean is
5534 PK : constant Node_Kind := Nkind (Parent (N));
5538 when N_Parameter_Association =>
5539 return N = Explicit_Actual_Parameter (Parent (N));
5541 when N_Function_Call | N_Procedure_Call_Statement =>
5542 return Is_List_Member (N)
5544 List_Containing (N) = Parameter_Associations (Parent (N));
5549 end Is_Actual_Parameter;
5551 ---------------------
5552 -- Is_Aliased_View --
5553 ---------------------
5555 function Is_Aliased_View (Obj : Node_Id) return Boolean is
5559 if Is_Entity_Name (Obj) then
5567 or else (Present (Renamed_Object (E))
5568 and then Is_Aliased_View (Renamed_Object (E)))))
5570 or else ((Is_Formal (E)
5571 or else Ekind (E) = E_Generic_In_Out_Parameter
5572 or else Ekind (E) = E_Generic_In_Parameter)
5573 and then Is_Tagged_Type (Etype (E)))
5575 or else (Is_Concurrent_Type (E)
5576 and then In_Open_Scopes (E))
5578 -- Current instance of type, either directly or as rewritten
5579 -- reference to the current object.
5581 or else (Is_Entity_Name (Original_Node (Obj))
5582 and then Present (Entity (Original_Node (Obj)))
5583 and then Is_Type (Entity (Original_Node (Obj))))
5585 or else (Is_Type (E) and then E = Current_Scope)
5587 or else (Is_Incomplete_Or_Private_Type (E)
5588 and then Full_View (E) = Current_Scope);
5590 elsif Nkind (Obj) = N_Selected_Component then
5591 return Is_Aliased (Entity (Selector_Name (Obj)));
5593 elsif Nkind (Obj) = N_Indexed_Component then
5594 return Has_Aliased_Components (Etype (Prefix (Obj)))
5596 (Is_Access_Type (Etype (Prefix (Obj)))
5598 Has_Aliased_Components
5599 (Designated_Type (Etype (Prefix (Obj)))));
5601 elsif Nkind (Obj) = N_Unchecked_Type_Conversion
5602 or else Nkind (Obj) = N_Type_Conversion
5604 return Is_Tagged_Type (Etype (Obj))
5605 and then Is_Aliased_View (Expression (Obj));
5607 elsif Nkind (Obj) = N_Explicit_Dereference then
5608 return Nkind (Original_Node (Obj)) /= N_Function_Call;
5613 end Is_Aliased_View;
5615 -------------------------
5616 -- Is_Ancestor_Package --
5617 -------------------------
5619 function Is_Ancestor_Package
5621 E2 : Entity_Id) return Boolean
5628 and then Par /= Standard_Standard
5638 end Is_Ancestor_Package;
5640 ----------------------
5641 -- Is_Atomic_Object --
5642 ----------------------
5644 function Is_Atomic_Object (N : Node_Id) return Boolean is
5646 function Object_Has_Atomic_Components (N : Node_Id) return Boolean;
5647 -- Determines if given object has atomic components
5649 function Is_Atomic_Prefix (N : Node_Id) return Boolean;
5650 -- If prefix is an implicit dereference, examine designated type
5652 ----------------------
5653 -- Is_Atomic_Prefix --
5654 ----------------------
5656 function Is_Atomic_Prefix (N : Node_Id) return Boolean is
5658 if Is_Access_Type (Etype (N)) then
5660 Has_Atomic_Components (Designated_Type (Etype (N)));
5662 return Object_Has_Atomic_Components (N);
5664 end Is_Atomic_Prefix;
5666 ----------------------------------
5667 -- Object_Has_Atomic_Components --
5668 ----------------------------------
5670 function Object_Has_Atomic_Components (N : Node_Id) return Boolean is
5672 if Has_Atomic_Components (Etype (N))
5673 or else Is_Atomic (Etype (N))
5677 elsif Is_Entity_Name (N)
5678 and then (Has_Atomic_Components (Entity (N))
5679 or else Is_Atomic (Entity (N)))
5683 elsif Nkind (N) = N_Indexed_Component
5684 or else Nkind (N) = N_Selected_Component
5686 return Is_Atomic_Prefix (Prefix (N));
5691 end Object_Has_Atomic_Components;
5693 -- Start of processing for Is_Atomic_Object
5696 if Is_Atomic (Etype (N))
5697 or else (Is_Entity_Name (N) and then Is_Atomic (Entity (N)))
5701 elsif Nkind (N) = N_Indexed_Component
5702 or else Nkind (N) = N_Selected_Component
5704 return Is_Atomic_Prefix (Prefix (N));
5709 end Is_Atomic_Object;
5711 -------------------------
5712 -- Is_Coextension_Root --
5713 -------------------------
5715 function Is_Coextension_Root (N : Node_Id) return Boolean is
5718 Nkind (N) = N_Allocator
5719 and then Present (Coextensions (N))
5721 -- Anonymous access discriminants carry a list of all nested
5722 -- controlled coextensions.
5724 and then not Is_Dynamic_Coextension (N)
5725 and then not Is_Static_Coextension (N);
5726 end Is_Coextension_Root;
5728 -----------------------------
5729 -- Is_Concurrent_Interface --
5730 -----------------------------
5732 function Is_Concurrent_Interface (T : Entity_Id) return Boolean is
5737 (Is_Protected_Interface (T)
5738 or else Is_Synchronized_Interface (T)
5739 or else Is_Task_Interface (T));
5740 end Is_Concurrent_Interface;
5742 --------------------------------------
5743 -- Is_Controlling_Limited_Procedure --
5744 --------------------------------------
5746 function Is_Controlling_Limited_Procedure
5747 (Proc_Nam : Entity_Id) return Boolean
5749 Param_Typ : Entity_Id := Empty;
5752 if Ekind (Proc_Nam) = E_Procedure
5753 and then Present (Parameter_Specifications (Parent (Proc_Nam)))
5755 Param_Typ := Etype (Parameter_Type (First (
5756 Parameter_Specifications (Parent (Proc_Nam)))));
5758 -- In this case where an Itype was created, the procedure call has been
5761 elsif Present (Associated_Node_For_Itype (Proc_Nam))
5762 and then Present (Original_Node (Associated_Node_For_Itype (Proc_Nam)))
5764 Present (Parameter_Associations
5765 (Associated_Node_For_Itype (Proc_Nam)))
5768 Etype (First (Parameter_Associations
5769 (Associated_Node_For_Itype (Proc_Nam))));
5772 if Present (Param_Typ) then
5774 Is_Interface (Param_Typ)
5775 and then Is_Limited_Record (Param_Typ);
5779 end Is_Controlling_Limited_Procedure;
5781 -----------------------------
5782 -- Is_CPP_Constructor_Call --
5783 -----------------------------
5785 function Is_CPP_Constructor_Call (N : Node_Id) return Boolean is
5787 return Nkind (N) = N_Function_Call
5788 and then Is_CPP_Class (Etype (Etype (N)))
5789 and then Is_Constructor (Entity (Name (N)))
5790 and then Is_Imported (Entity (Name (N)));
5791 end Is_CPP_Constructor_Call;
5793 ----------------------------------------------
5794 -- Is_Dependent_Component_Of_Mutable_Object --
5795 ----------------------------------------------
5797 function Is_Dependent_Component_Of_Mutable_Object
5798 (Object : Node_Id) return Boolean
5801 Prefix_Type : Entity_Id;
5802 P_Aliased : Boolean := False;
5805 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean;
5806 -- Returns True if and only if Comp is declared within a variant part
5808 --------------------------------
5809 -- Is_Declared_Within_Variant --
5810 --------------------------------
5812 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean is
5813 Comp_Decl : constant Node_Id := Parent (Comp);
5814 Comp_List : constant Node_Id := Parent (Comp_Decl);
5816 return Nkind (Parent (Comp_List)) = N_Variant;
5817 end Is_Declared_Within_Variant;
5819 -- Start of processing for Is_Dependent_Component_Of_Mutable_Object
5822 if Is_Variable (Object) then
5824 if Nkind (Object) = N_Selected_Component then
5825 P := Prefix (Object);
5826 Prefix_Type := Etype (P);
5828 if Is_Entity_Name (P) then
5830 if Ekind (Entity (P)) = E_Generic_In_Out_Parameter then
5831 Prefix_Type := Base_Type (Prefix_Type);
5834 if Is_Aliased (Entity (P)) then
5838 -- A discriminant check on a selected component may be
5839 -- expanded into a dereference when removing side-effects.
5840 -- Recover the original node and its type, which may be
5843 elsif Nkind (P) = N_Explicit_Dereference
5844 and then not (Comes_From_Source (P))
5846 P := Original_Node (P);
5847 Prefix_Type := Etype (P);
5850 -- Check for prefix being an aliased component ???
5855 -- A heap object is constrained by its initial value
5857 -- Ada 2005 (AI-363): Always assume the object could be mutable in
5858 -- the dereferenced case, since the access value might denote an
5859 -- unconstrained aliased object, whereas in Ada 95 the designated
5860 -- object is guaranteed to be constrained. A worst-case assumption
5861 -- has to apply in Ada 2005 because we can't tell at compile time
5862 -- whether the object is "constrained by its initial value"
5863 -- (despite the fact that 3.10.2(26/2) and 8.5.1(5/2) are
5864 -- semantic rules -- these rules are acknowledged to need fixing).
5866 if Ada_Version < Ada_05 then
5867 if Is_Access_Type (Prefix_Type)
5868 or else Nkind (P) = N_Explicit_Dereference
5873 elsif Ada_Version >= Ada_05 then
5874 if Is_Access_Type (Prefix_Type) then
5876 -- If the access type is pool-specific, and there is no
5877 -- constrained partial view of the designated type, then the
5878 -- designated object is known to be constrained.
5880 if Ekind (Prefix_Type) = E_Access_Type
5881 and then not Has_Constrained_Partial_View
5882 (Designated_Type (Prefix_Type))
5886 -- Otherwise (general access type, or there is a constrained
5887 -- partial view of the designated type), we need to check
5888 -- based on the designated type.
5891 Prefix_Type := Designated_Type (Prefix_Type);
5897 Original_Record_Component (Entity (Selector_Name (Object)));
5899 -- As per AI-0017, the renaming is illegal in a generic body,
5900 -- even if the subtype is indefinite.
5902 -- Ada 2005 (AI-363): In Ada 2005 an aliased object can be mutable
5904 if not Is_Constrained (Prefix_Type)
5905 and then (not Is_Indefinite_Subtype (Prefix_Type)
5907 (Is_Generic_Type (Prefix_Type)
5908 and then Ekind (Current_Scope) = E_Generic_Package
5909 and then In_Package_Body (Current_Scope)))
5911 and then (Is_Declared_Within_Variant (Comp)
5912 or else Has_Discriminant_Dependent_Constraint (Comp))
5913 and then (not P_Aliased or else Ada_Version >= Ada_05)
5919 Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
5923 elsif Nkind (Object) = N_Indexed_Component
5924 or else Nkind (Object) = N_Slice
5926 return Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
5928 -- A type conversion that Is_Variable is a view conversion:
5929 -- go back to the denoted object.
5931 elsif Nkind (Object) = N_Type_Conversion then
5933 Is_Dependent_Component_Of_Mutable_Object (Expression (Object));
5938 end Is_Dependent_Component_Of_Mutable_Object;
5940 ---------------------
5941 -- Is_Dereferenced --
5942 ---------------------
5944 function Is_Dereferenced (N : Node_Id) return Boolean is
5945 P : constant Node_Id := Parent (N);
5948 (Nkind (P) = N_Selected_Component
5950 Nkind (P) = N_Explicit_Dereference
5952 Nkind (P) = N_Indexed_Component
5954 Nkind (P) = N_Slice)
5955 and then Prefix (P) = N;
5956 end Is_Dereferenced;
5958 ----------------------
5959 -- Is_Descendent_Of --
5960 ----------------------
5962 function Is_Descendent_Of (T1 : Entity_Id; T2 : Entity_Id) return Boolean is
5967 pragma Assert (Nkind (T1) in N_Entity);
5968 pragma Assert (Nkind (T2) in N_Entity);
5970 T := Base_Type (T1);
5972 -- Immediate return if the types match
5977 -- Comment needed here ???
5979 elsif Ekind (T) = E_Class_Wide_Type then
5980 return Etype (T) = T2;
5988 -- Done if we found the type we are looking for
5993 -- Done if no more derivations to check
6000 -- Following test catches error cases resulting from prev errors
6002 elsif No (Etyp) then
6005 elsif Is_Private_Type (T) and then Etyp = Full_View (T) then
6008 elsif Is_Private_Type (Etyp) and then Full_View (Etyp) = T then
6012 T := Base_Type (Etyp);
6015 end Is_Descendent_Of;
6021 function Is_False (U : Uint) return Boolean is
6026 ---------------------------
6027 -- Is_Fixed_Model_Number --
6028 ---------------------------
6030 function Is_Fixed_Model_Number (U : Ureal; T : Entity_Id) return Boolean is
6031 S : constant Ureal := Small_Value (T);
6032 M : Urealp.Save_Mark;
6036 R := (U = UR_Trunc (U / S) * S);
6039 end Is_Fixed_Model_Number;
6041 -------------------------------
6042 -- Is_Fully_Initialized_Type --
6043 -------------------------------
6045 function Is_Fully_Initialized_Type (Typ : Entity_Id) return Boolean is
6047 if Is_Scalar_Type (Typ) then
6050 elsif Is_Access_Type (Typ) then
6053 elsif Is_Array_Type (Typ) then
6054 if Is_Fully_Initialized_Type (Component_Type (Typ)) then
6058 -- An interesting case, if we have a constrained type one of whose
6059 -- bounds is known to be null, then there are no elements to be
6060 -- initialized, so all the elements are initialized!
6062 if Is_Constrained (Typ) then
6065 Indx_Typ : Entity_Id;
6069 Indx := First_Index (Typ);
6070 while Present (Indx) loop
6071 if Etype (Indx) = Any_Type then
6074 -- If index is a range, use directly
6076 elsif Nkind (Indx) = N_Range then
6077 Lbd := Low_Bound (Indx);
6078 Hbd := High_Bound (Indx);
6081 Indx_Typ := Etype (Indx);
6083 if Is_Private_Type (Indx_Typ) then
6084 Indx_Typ := Full_View (Indx_Typ);
6087 if No (Indx_Typ) or else Etype (Indx_Typ) = Any_Type then
6090 Lbd := Type_Low_Bound (Indx_Typ);
6091 Hbd := Type_High_Bound (Indx_Typ);
6095 if Compile_Time_Known_Value (Lbd)
6096 and then Compile_Time_Known_Value (Hbd)
6098 if Expr_Value (Hbd) < Expr_Value (Lbd) then
6108 -- If no null indexes, then type is not fully initialized
6114 elsif Is_Record_Type (Typ) then
6115 if Has_Discriminants (Typ)
6117 Present (Discriminant_Default_Value (First_Discriminant (Typ)))
6118 and then Is_Fully_Initialized_Variant (Typ)
6123 -- Controlled records are considered to be fully initialized if
6124 -- there is a user defined Initialize routine. This may not be
6125 -- entirely correct, but as the spec notes, we are guessing here
6126 -- what is best from the point of view of issuing warnings.
6128 if Is_Controlled (Typ) then
6130 Utyp : constant Entity_Id := Underlying_Type (Typ);
6133 if Present (Utyp) then
6135 Init : constant Entity_Id :=
6137 (Underlying_Type (Typ), Name_Initialize));
6141 and then Comes_From_Source (Init)
6143 Is_Predefined_File_Name
6144 (File_Name (Get_Source_File_Index (Sloc (Init))))
6148 elsif Has_Null_Extension (Typ)
6150 Is_Fully_Initialized_Type
6151 (Etype (Base_Type (Typ)))
6160 -- Otherwise see if all record components are initialized
6166 Ent := First_Entity (Typ);
6167 while Present (Ent) loop
6168 if Chars (Ent) = Name_uController then
6171 elsif Ekind (Ent) = E_Component
6172 and then (No (Parent (Ent))
6173 or else No (Expression (Parent (Ent))))
6174 and then not Is_Fully_Initialized_Type (Etype (Ent))
6176 -- Special VM case for tag components, which need to be
6177 -- defined in this case, but are never initialized as VMs
6178 -- are using other dispatching mechanisms. Ignore this
6179 -- uninitialized case. Note that this applies both to the
6180 -- uTag entry and the main vtable pointer (CPP_Class case).
6182 and then (Tagged_Type_Expansion or else not Is_Tag (Ent))
6191 -- No uninitialized components, so type is fully initialized.
6192 -- Note that this catches the case of no components as well.
6196 elsif Is_Concurrent_Type (Typ) then
6199 elsif Is_Private_Type (Typ) then
6201 U : constant Entity_Id := Underlying_Type (Typ);
6207 return Is_Fully_Initialized_Type (U);
6214 end Is_Fully_Initialized_Type;
6216 ----------------------------------
6217 -- Is_Fully_Initialized_Variant --
6218 ----------------------------------
6220 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean is
6221 Loc : constant Source_Ptr := Sloc (Typ);
6222 Constraints : constant List_Id := New_List;
6223 Components : constant Elist_Id := New_Elmt_List;
6224 Comp_Elmt : Elmt_Id;
6226 Comp_List : Node_Id;
6228 Discr_Val : Node_Id;
6230 Report_Errors : Boolean;
6231 pragma Warnings (Off, Report_Errors);
6234 if Serious_Errors_Detected > 0 then
6238 if Is_Record_Type (Typ)
6239 and then Nkind (Parent (Typ)) = N_Full_Type_Declaration
6240 and then Nkind (Type_Definition (Parent (Typ))) = N_Record_Definition
6242 Comp_List := Component_List (Type_Definition (Parent (Typ)));
6244 Discr := First_Discriminant (Typ);
6245 while Present (Discr) loop
6246 if Nkind (Parent (Discr)) = N_Discriminant_Specification then
6247 Discr_Val := Expression (Parent (Discr));
6249 if Present (Discr_Val)
6250 and then Is_OK_Static_Expression (Discr_Val)
6252 Append_To (Constraints,
6253 Make_Component_Association (Loc,
6254 Choices => New_List (New_Occurrence_Of (Discr, Loc)),
6255 Expression => New_Copy (Discr_Val)));
6263 Next_Discriminant (Discr);
6268 Comp_List => Comp_List,
6269 Governed_By => Constraints,
6271 Report_Errors => Report_Errors);
6273 -- Check that each component present is fully initialized
6275 Comp_Elmt := First_Elmt (Components);
6276 while Present (Comp_Elmt) loop
6277 Comp_Id := Node (Comp_Elmt);
6279 if Ekind (Comp_Id) = E_Component
6280 and then (No (Parent (Comp_Id))
6281 or else No (Expression (Parent (Comp_Id))))
6282 and then not Is_Fully_Initialized_Type (Etype (Comp_Id))
6287 Next_Elmt (Comp_Elmt);
6292 elsif Is_Private_Type (Typ) then
6294 U : constant Entity_Id := Underlying_Type (Typ);
6300 return Is_Fully_Initialized_Variant (U);
6306 end Is_Fully_Initialized_Variant;
6312 -- We seem to have a lot of overlapping functions that do similar things
6313 -- (testing for left hand sides or lvalues???). Anyway, since this one is
6314 -- purely syntactic, it should be in Sem_Aux I would think???
6316 function Is_LHS (N : Node_Id) return Boolean is
6317 P : constant Node_Id := Parent (N);
6319 return Nkind (P) = N_Assignment_Statement
6320 and then Name (P) = N;
6323 ----------------------------
6324 -- Is_Inherited_Operation --
6325 ----------------------------
6327 function Is_Inherited_Operation (E : Entity_Id) return Boolean is
6328 Kind : constant Node_Kind := Nkind (Parent (E));
6330 pragma Assert (Is_Overloadable (E));
6331 return Kind = N_Full_Type_Declaration
6332 or else Kind = N_Private_Extension_Declaration
6333 or else Kind = N_Subtype_Declaration
6334 or else (Ekind (E) = E_Enumeration_Literal
6335 and then Is_Derived_Type (Etype (E)));
6336 end Is_Inherited_Operation;
6338 -----------------------------
6339 -- Is_Library_Level_Entity --
6340 -----------------------------
6342 function Is_Library_Level_Entity (E : Entity_Id) return Boolean is
6344 -- The following is a small optimization, and it also properly handles
6345 -- discriminals, which in task bodies might appear in expressions before
6346 -- the corresponding procedure has been created, and which therefore do
6347 -- not have an assigned scope.
6349 if Ekind (E) in Formal_Kind then
6353 -- Normal test is simply that the enclosing dynamic scope is Standard
6355 return Enclosing_Dynamic_Scope (E) = Standard_Standard;
6356 end Is_Library_Level_Entity;
6358 ---------------------------------
6359 -- Is_Local_Variable_Reference --
6360 ---------------------------------
6362 function Is_Local_Variable_Reference (Expr : Node_Id) return Boolean is
6364 if not Is_Entity_Name (Expr) then
6369 Ent : constant Entity_Id := Entity (Expr);
6370 Sub : constant Entity_Id := Enclosing_Subprogram (Ent);
6372 if not Ekind_In (Ent, E_Variable, E_In_Out_Parameter) then
6375 return Present (Sub) and then Sub = Current_Subprogram;
6379 end Is_Local_Variable_Reference;
6381 -------------------------
6382 -- Is_Object_Reference --
6383 -------------------------
6385 function Is_Object_Reference (N : Node_Id) return Boolean is
6387 if Is_Entity_Name (N) then
6388 return Present (Entity (N)) and then Is_Object (Entity (N));
6392 when N_Indexed_Component | N_Slice =>
6394 Is_Object_Reference (Prefix (N))
6395 or else Is_Access_Type (Etype (Prefix (N)));
6397 -- In Ada95, a function call is a constant object; a procedure
6400 when N_Function_Call =>
6401 return Etype (N) /= Standard_Void_Type;
6403 -- A reference to the stream attribute Input is a function call
6405 when N_Attribute_Reference =>
6406 return Attribute_Name (N) = Name_Input;
6408 when N_Selected_Component =>
6410 Is_Object_Reference (Selector_Name (N))
6412 (Is_Object_Reference (Prefix (N))
6413 or else Is_Access_Type (Etype (Prefix (N))));
6415 when N_Explicit_Dereference =>
6418 -- A view conversion of a tagged object is an object reference
6420 when N_Type_Conversion =>
6421 return Is_Tagged_Type (Etype (Subtype_Mark (N)))
6422 and then Is_Tagged_Type (Etype (Expression (N)))
6423 and then Is_Object_Reference (Expression (N));
6425 -- An unchecked type conversion is considered to be an object if
6426 -- the operand is an object (this construction arises only as a
6427 -- result of expansion activities).
6429 when N_Unchecked_Type_Conversion =>
6436 end Is_Object_Reference;
6438 -----------------------------------
6439 -- Is_OK_Variable_For_Out_Formal --
6440 -----------------------------------
6442 function Is_OK_Variable_For_Out_Formal (AV : Node_Id) return Boolean is
6444 Note_Possible_Modification (AV, Sure => True);
6446 -- We must reject parenthesized variable names. The check for
6447 -- Comes_From_Source is present because there are currently
6448 -- cases where the compiler violates this rule (e.g. passing
6449 -- a task object to its controlled Initialize routine).
6451 if Paren_Count (AV) > 0 and then Comes_From_Source (AV) then
6454 -- A variable is always allowed
6456 elsif Is_Variable (AV) then
6459 -- Unchecked conversions are allowed only if they come from the
6460 -- generated code, which sometimes uses unchecked conversions for out
6461 -- parameters in cases where code generation is unaffected. We tell
6462 -- source unchecked conversions by seeing if they are rewrites of an
6463 -- original Unchecked_Conversion function call, or of an explicit
6464 -- conversion of a function call.
6466 elsif Nkind (AV) = N_Unchecked_Type_Conversion then
6467 if Nkind (Original_Node (AV)) = N_Function_Call then
6470 elsif Comes_From_Source (AV)
6471 and then Nkind (Original_Node (Expression (AV))) = N_Function_Call
6475 elsif Nkind (Original_Node (AV)) = N_Type_Conversion then
6476 return Is_OK_Variable_For_Out_Formal (Expression (AV));
6482 -- Normal type conversions are allowed if argument is a variable
6484 elsif Nkind (AV) = N_Type_Conversion then
6485 if Is_Variable (Expression (AV))
6486 and then Paren_Count (Expression (AV)) = 0
6488 Note_Possible_Modification (Expression (AV), Sure => True);
6491 -- We also allow a non-parenthesized expression that raises
6492 -- constraint error if it rewrites what used to be a variable
6494 elsif Raises_Constraint_Error (Expression (AV))
6495 and then Paren_Count (Expression (AV)) = 0
6496 and then Is_Variable (Original_Node (Expression (AV)))
6500 -- Type conversion of something other than a variable
6506 -- If this node is rewritten, then test the original form, if that is
6507 -- OK, then we consider the rewritten node OK (for example, if the
6508 -- original node is a conversion, then Is_Variable will not be true
6509 -- but we still want to allow the conversion if it converts a variable).
6511 elsif Original_Node (AV) /= AV then
6512 return Is_OK_Variable_For_Out_Formal (Original_Node (AV));
6514 -- All other non-variables are rejected
6519 end Is_OK_Variable_For_Out_Formal;
6521 -----------------------------------
6522 -- Is_Partially_Initialized_Type --
6523 -----------------------------------
6525 function Is_Partially_Initialized_Type (Typ : Entity_Id) return Boolean is
6527 if Is_Scalar_Type (Typ) then
6530 elsif Is_Access_Type (Typ) then
6533 elsif Is_Array_Type (Typ) then
6535 -- If component type is partially initialized, so is array type
6537 if Is_Partially_Initialized_Type (Component_Type (Typ)) then
6540 -- Otherwise we are only partially initialized if we are fully
6541 -- initialized (this is the empty array case, no point in us
6542 -- duplicating that code here).
6545 return Is_Fully_Initialized_Type (Typ);
6548 elsif Is_Record_Type (Typ) then
6550 -- A discriminated type is always partially initialized
6552 if Has_Discriminants (Typ) then
6555 -- A tagged type is always partially initialized
6557 elsif Is_Tagged_Type (Typ) then
6560 -- Case of non-discriminated record
6566 Component_Present : Boolean := False;
6567 -- Set True if at least one component is present. If no
6568 -- components are present, then record type is fully
6569 -- initialized (another odd case, like the null array).
6572 -- Loop through components
6574 Ent := First_Entity (Typ);
6575 while Present (Ent) loop
6576 if Ekind (Ent) = E_Component then
6577 Component_Present := True;
6579 -- If a component has an initialization expression then
6580 -- the enclosing record type is partially initialized
6582 if Present (Parent (Ent))
6583 and then Present (Expression (Parent (Ent)))
6587 -- If a component is of a type which is itself partially
6588 -- initialized, then the enclosing record type is also.
6590 elsif Is_Partially_Initialized_Type (Etype (Ent)) then
6598 -- No initialized components found. If we found any components
6599 -- they were all uninitialized so the result is false.
6601 if Component_Present then
6604 -- But if we found no components, then all the components are
6605 -- initialized so we consider the type to be initialized.
6613 -- Concurrent types are always fully initialized
6615 elsif Is_Concurrent_Type (Typ) then
6618 -- For a private type, go to underlying type. If there is no underlying
6619 -- type then just assume this partially initialized. Not clear if this
6620 -- can happen in a non-error case, but no harm in testing for this.
6622 elsif Is_Private_Type (Typ) then
6624 U : constant Entity_Id := Underlying_Type (Typ);
6629 return Is_Partially_Initialized_Type (U);
6633 -- For any other type (are there any?) assume partially initialized
6638 end Is_Partially_Initialized_Type;
6640 ------------------------------------
6641 -- Is_Potentially_Persistent_Type --
6642 ------------------------------------
6644 function Is_Potentially_Persistent_Type (T : Entity_Id) return Boolean is
6649 -- For private type, test corresponding full type
6651 if Is_Private_Type (T) then
6652 return Is_Potentially_Persistent_Type (Full_View (T));
6654 -- Scalar types are potentially persistent
6656 elsif Is_Scalar_Type (T) then
6659 -- Record type is potentially persistent if not tagged and the types of
6660 -- all it components are potentially persistent, and no component has
6661 -- an initialization expression.
6663 elsif Is_Record_Type (T)
6664 and then not Is_Tagged_Type (T)
6665 and then not Is_Partially_Initialized_Type (T)
6667 Comp := First_Component (T);
6668 while Present (Comp) loop
6669 if not Is_Potentially_Persistent_Type (Etype (Comp)) then
6678 -- Array type is potentially persistent if its component type is
6679 -- potentially persistent and if all its constraints are static.
6681 elsif Is_Array_Type (T) then
6682 if not Is_Potentially_Persistent_Type (Component_Type (T)) then
6686 Indx := First_Index (T);
6687 while Present (Indx) loop
6688 if not Is_OK_Static_Subtype (Etype (Indx)) then
6697 -- All other types are not potentially persistent
6702 end Is_Potentially_Persistent_Type;
6704 ---------------------------------
6705 -- Is_Protected_Self_Reference --
6706 ---------------------------------
6708 function Is_Protected_Self_Reference (N : Node_Id) return Boolean is
6710 function In_Access_Definition (N : Node_Id) return Boolean;
6711 -- Returns true if N belongs to an access definition
6713 --------------------------
6714 -- In_Access_Definition --
6715 --------------------------
6717 function In_Access_Definition (N : Node_Id) return Boolean is
6722 while Present (P) loop
6723 if Nkind (P) = N_Access_Definition then
6731 end In_Access_Definition;
6733 -- Start of processing for Is_Protected_Self_Reference
6736 -- Verify that prefix is analyzed and has the proper form. Note that
6737 -- the attributes Elab_Spec, Elab_Body, and UET_Address, which also
6738 -- produce the address of an entity, do not analyze their prefix
6739 -- because they denote entities that are not necessarily visible.
6740 -- Neither of them can apply to a protected type.
6742 return Ada_Version >= Ada_05
6743 and then Is_Entity_Name (N)
6744 and then Present (Entity (N))
6745 and then Is_Protected_Type (Entity (N))
6746 and then In_Open_Scopes (Entity (N))
6747 and then not In_Access_Definition (N);
6748 end Is_Protected_Self_Reference;
6750 -----------------------------
6751 -- Is_RCI_Pkg_Spec_Or_Body --
6752 -----------------------------
6754 function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
6756 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
6757 -- Return True if the unit of Cunit is an RCI package declaration
6759 ---------------------------
6760 -- Is_RCI_Pkg_Decl_Cunit --
6761 ---------------------------
6763 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean is
6764 The_Unit : constant Node_Id := Unit (Cunit);
6767 if Nkind (The_Unit) /= N_Package_Declaration then
6771 return Is_Remote_Call_Interface (Defining_Entity (The_Unit));
6772 end Is_RCI_Pkg_Decl_Cunit;
6774 -- Start of processing for Is_RCI_Pkg_Spec_Or_Body
6777 return Is_RCI_Pkg_Decl_Cunit (Cunit)
6779 (Nkind (Unit (Cunit)) = N_Package_Body
6780 and then Is_RCI_Pkg_Decl_Cunit (Library_Unit (Cunit)));
6781 end Is_RCI_Pkg_Spec_Or_Body;
6783 -----------------------------------------
6784 -- Is_Remote_Access_To_Class_Wide_Type --
6785 -----------------------------------------
6787 function Is_Remote_Access_To_Class_Wide_Type
6788 (E : Entity_Id) return Boolean
6791 -- A remote access to class-wide type is a general access to object type
6792 -- declared in the visible part of a Remote_Types or Remote_Call_
6795 return Ekind (E) = E_General_Access_Type
6796 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
6797 end Is_Remote_Access_To_Class_Wide_Type;
6799 -----------------------------------------
6800 -- Is_Remote_Access_To_Subprogram_Type --
6801 -----------------------------------------
6803 function Is_Remote_Access_To_Subprogram_Type
6804 (E : Entity_Id) return Boolean
6807 return (Ekind (E) = E_Access_Subprogram_Type
6808 or else (Ekind (E) = E_Record_Type
6809 and then Present (Corresponding_Remote_Type (E))))
6810 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
6811 end Is_Remote_Access_To_Subprogram_Type;
6813 --------------------
6814 -- Is_Remote_Call --
6815 --------------------
6817 function Is_Remote_Call (N : Node_Id) return Boolean is
6819 if Nkind (N) /= N_Procedure_Call_Statement
6820 and then Nkind (N) /= N_Function_Call
6822 -- An entry call cannot be remote
6826 elsif Nkind (Name (N)) in N_Has_Entity
6827 and then Is_Remote_Call_Interface (Entity (Name (N)))
6829 -- A subprogram declared in the spec of a RCI package is remote
6833 elsif Nkind (Name (N)) = N_Explicit_Dereference
6834 and then Is_Remote_Access_To_Subprogram_Type
6835 (Etype (Prefix (Name (N))))
6837 -- The dereference of a RAS is a remote call
6841 elsif Present (Controlling_Argument (N))
6842 and then Is_Remote_Access_To_Class_Wide_Type
6843 (Etype (Controlling_Argument (N)))
6845 -- Any primitive operation call with a controlling argument of
6846 -- a RACW type is a remote call.
6851 -- All other calls are local calls
6856 ----------------------
6857 -- Is_Renamed_Entry --
6858 ----------------------
6860 function Is_Renamed_Entry (Proc_Nam : Entity_Id) return Boolean is
6861 Orig_Node : Node_Id := Empty;
6862 Subp_Decl : Node_Id := Parent (Parent (Proc_Nam));
6864 function Is_Entry (Nam : Node_Id) return Boolean;
6865 -- Determine whether Nam is an entry. Traverse selectors if there are
6866 -- nested selected components.
6872 function Is_Entry (Nam : Node_Id) return Boolean is
6874 if Nkind (Nam) = N_Selected_Component then
6875 return Is_Entry (Selector_Name (Nam));
6878 return Ekind (Entity (Nam)) = E_Entry;
6881 -- Start of processing for Is_Renamed_Entry
6884 if Present (Alias (Proc_Nam)) then
6885 Subp_Decl := Parent (Parent (Alias (Proc_Nam)));
6888 -- Look for a rewritten subprogram renaming declaration
6890 if Nkind (Subp_Decl) = N_Subprogram_Declaration
6891 and then Present (Original_Node (Subp_Decl))
6893 Orig_Node := Original_Node (Subp_Decl);
6896 -- The rewritten subprogram is actually an entry
6898 if Present (Orig_Node)
6899 and then Nkind (Orig_Node) = N_Subprogram_Renaming_Declaration
6900 and then Is_Entry (Name (Orig_Node))
6906 end Is_Renamed_Entry;
6908 ----------------------
6909 -- Is_Selector_Name --
6910 ----------------------
6912 function Is_Selector_Name (N : Node_Id) return Boolean is
6914 if not Is_List_Member (N) then
6916 P : constant Node_Id := Parent (N);
6917 K : constant Node_Kind := Nkind (P);
6920 (K = N_Expanded_Name or else
6921 K = N_Generic_Association or else
6922 K = N_Parameter_Association or else
6923 K = N_Selected_Component)
6924 and then Selector_Name (P) = N;
6929 L : constant List_Id := List_Containing (N);
6930 P : constant Node_Id := Parent (L);
6932 return (Nkind (P) = N_Discriminant_Association
6933 and then Selector_Names (P) = L)
6935 (Nkind (P) = N_Component_Association
6936 and then Choices (P) = L);
6939 end Is_Selector_Name;
6945 function Is_Statement (N : Node_Id) return Boolean is
6948 Nkind (N) in N_Statement_Other_Than_Procedure_Call
6949 or else Nkind (N) = N_Procedure_Call_Statement;
6952 ---------------------------------
6953 -- Is_Synchronized_Tagged_Type --
6954 ---------------------------------
6956 function Is_Synchronized_Tagged_Type (E : Entity_Id) return Boolean is
6957 Kind : constant Entity_Kind := Ekind (Base_Type (E));
6960 -- A task or protected type derived from an interface is a tagged type.
6961 -- Such a tagged type is called a synchronized tagged type, as are
6962 -- synchronized interfaces and private extensions whose declaration
6963 -- includes the reserved word synchronized.
6965 return (Is_Tagged_Type (E)
6966 and then (Kind = E_Task_Type
6967 or else Kind = E_Protected_Type))
6970 and then Is_Synchronized_Interface (E))
6972 (Ekind (E) = E_Record_Type_With_Private
6973 and then (Synchronized_Present (Parent (E))
6974 or else Is_Synchronized_Interface (Etype (E))));
6975 end Is_Synchronized_Tagged_Type;
6981 function Is_Transfer (N : Node_Id) return Boolean is
6982 Kind : constant Node_Kind := Nkind (N);
6985 if Kind = N_Simple_Return_Statement
6987 Kind = N_Extended_Return_Statement
6989 Kind = N_Goto_Statement
6991 Kind = N_Raise_Statement
6993 Kind = N_Requeue_Statement
6997 elsif (Kind = N_Exit_Statement or else Kind in N_Raise_xxx_Error)
6998 and then No (Condition (N))
7002 elsif Kind = N_Procedure_Call_Statement
7003 and then Is_Entity_Name (Name (N))
7004 and then Present (Entity (Name (N)))
7005 and then No_Return (Entity (Name (N)))
7009 elsif Nkind (Original_Node (N)) = N_Raise_Statement then
7021 function Is_True (U : Uint) return Boolean is
7030 function Is_Value_Type (T : Entity_Id) return Boolean is
7032 return VM_Target = CLI_Target
7033 and then Nkind (T) in N_Has_Chars
7034 and then Chars (T) /= No_Name
7035 and then Get_Name_String (Chars (T)) = "valuetype";
7038 ---------------------
7039 -- Is_VMS_Operator --
7040 ---------------------
7042 function Is_VMS_Operator (Op : Entity_Id) return Boolean is
7044 return Ekind (Op) = E_Function
7045 and then Is_Intrinsic_Subprogram (Op)
7046 and then Scope (Op) = System_Aux_Id;
7047 end Is_VMS_Operator;
7053 function Is_Delegate (T : Entity_Id) return Boolean is
7054 Desig_Type : Entity_Id;
7057 if VM_Target /= CLI_Target then
7061 -- Access-to-subprograms are delegates in CIL
7063 if Ekind (T) = E_Access_Subprogram_Type then
7067 if Ekind (T) not in Access_Kind then
7069 -- A delegate is a managed pointer. If no designated type is defined
7070 -- it means that it's not a delegate.
7075 Desig_Type := Etype (Directly_Designated_Type (T));
7077 if not Is_Tagged_Type (Desig_Type) then
7081 -- Test if the type is inherited from [mscorlib]System.Delegate
7083 while Etype (Desig_Type) /= Desig_Type loop
7084 if Chars (Scope (Desig_Type)) /= No_Name
7085 and then Is_Imported (Scope (Desig_Type))
7086 and then Get_Name_String (Chars (Scope (Desig_Type))) = "delegate"
7091 Desig_Type := Etype (Desig_Type);
7101 function Is_Variable (N : Node_Id) return Boolean is
7103 Orig_Node : constant Node_Id := Original_Node (N);
7104 -- We do the test on the original node, since this is basically a test
7105 -- of syntactic categories, so it must not be disturbed by whatever
7106 -- rewriting might have occurred. For example, an aggregate, which is
7107 -- certainly NOT a variable, could be turned into a variable by
7110 function In_Protected_Function (E : Entity_Id) return Boolean;
7111 -- Within a protected function, the private components of the
7112 -- enclosing protected type are constants. A function nested within
7113 -- a (protected) procedure is not itself protected.
7115 function Is_Variable_Prefix (P : Node_Id) return Boolean;
7116 -- Prefixes can involve implicit dereferences, in which case we
7117 -- must test for the case of a reference of a constant access
7118 -- type, which can never be a variable.
7120 ---------------------------
7121 -- In_Protected_Function --
7122 ---------------------------
7124 function In_Protected_Function (E : Entity_Id) return Boolean is
7125 Prot : constant Entity_Id := Scope (E);
7129 if not Is_Protected_Type (Prot) then
7133 while Present (S) and then S /= Prot loop
7134 if Ekind (S) = E_Function
7135 and then Scope (S) = Prot
7145 end In_Protected_Function;
7147 ------------------------
7148 -- Is_Variable_Prefix --
7149 ------------------------
7151 function Is_Variable_Prefix (P : Node_Id) return Boolean is
7153 if Is_Access_Type (Etype (P)) then
7154 return not Is_Access_Constant (Root_Type (Etype (P)));
7156 -- For the case of an indexed component whose prefix has a packed
7157 -- array type, the prefix has been rewritten into a type conversion.
7158 -- Determine variable-ness from the converted expression.
7160 elsif Nkind (P) = N_Type_Conversion
7161 and then not Comes_From_Source (P)
7162 and then Is_Array_Type (Etype (P))
7163 and then Is_Packed (Etype (P))
7165 return Is_Variable (Expression (P));
7168 return Is_Variable (P);
7170 end Is_Variable_Prefix;
7172 -- Start of processing for Is_Variable
7175 -- Definitely OK if Assignment_OK is set. Since this is something that
7176 -- only gets set for expanded nodes, the test is on N, not Orig_Node.
7178 if Nkind (N) in N_Subexpr and then Assignment_OK (N) then
7181 -- Normally we go to the original node, but there is one exception
7182 -- where we use the rewritten node, namely when it is an explicit
7183 -- dereference. The generated code may rewrite a prefix which is an
7184 -- access type with an explicit dereference. The dereference is a
7185 -- variable, even though the original node may not be (since it could
7186 -- be a constant of the access type).
7188 -- In Ada 2005 we have a further case to consider: the prefix may be
7189 -- a function call given in prefix notation. The original node appears
7190 -- to be a selected component, but we need to examine the call.
7192 elsif Nkind (N) = N_Explicit_Dereference
7193 and then Nkind (Orig_Node) /= N_Explicit_Dereference
7194 and then Present (Etype (Orig_Node))
7195 and then Is_Access_Type (Etype (Orig_Node))
7197 -- Note that if the prefix is an explicit dereference that does not
7198 -- come from source, we must check for a rewritten function call in
7199 -- prefixed notation before other forms of rewriting, to prevent a
7203 (Nkind (Orig_Node) = N_Function_Call
7204 and then not Is_Access_Constant (Etype (Prefix (N))))
7206 Is_Variable_Prefix (Original_Node (Prefix (N)));
7208 -- A function call is never a variable
7210 elsif Nkind (N) = N_Function_Call then
7213 -- All remaining checks use the original node
7215 elsif Is_Entity_Name (Orig_Node)
7216 and then Present (Entity (Orig_Node))
7219 E : constant Entity_Id := Entity (Orig_Node);
7220 K : constant Entity_Kind := Ekind (E);
7223 return (K = E_Variable
7224 and then Nkind (Parent (E)) /= N_Exception_Handler)
7225 or else (K = E_Component
7226 and then not In_Protected_Function (E))
7227 or else K = E_Out_Parameter
7228 or else K = E_In_Out_Parameter
7229 or else K = E_Generic_In_Out_Parameter
7231 -- Current instance of type:
7233 or else (Is_Type (E) and then In_Open_Scopes (E))
7234 or else (Is_Incomplete_Or_Private_Type (E)
7235 and then In_Open_Scopes (Full_View (E)));
7239 case Nkind (Orig_Node) is
7240 when N_Indexed_Component | N_Slice =>
7241 return Is_Variable_Prefix (Prefix (Orig_Node));
7243 when N_Selected_Component =>
7244 return Is_Variable_Prefix (Prefix (Orig_Node))
7245 and then Is_Variable (Selector_Name (Orig_Node));
7247 -- For an explicit dereference, the type of the prefix cannot
7248 -- be an access to constant or an access to subprogram.
7250 when N_Explicit_Dereference =>
7252 Typ : constant Entity_Id := Etype (Prefix (Orig_Node));
7254 return Is_Access_Type (Typ)
7255 and then not Is_Access_Constant (Root_Type (Typ))
7256 and then Ekind (Typ) /= E_Access_Subprogram_Type;
7259 -- The type conversion is the case where we do not deal with the
7260 -- context dependent special case of an actual parameter. Thus
7261 -- the type conversion is only considered a variable for the
7262 -- purposes of this routine if the target type is tagged. However,
7263 -- a type conversion is considered to be a variable if it does not
7264 -- come from source (this deals for example with the conversions
7265 -- of expressions to their actual subtypes).
7267 when N_Type_Conversion =>
7268 return Is_Variable (Expression (Orig_Node))
7270 (not Comes_From_Source (Orig_Node)
7272 (Is_Tagged_Type (Etype (Subtype_Mark (Orig_Node)))
7274 Is_Tagged_Type (Etype (Expression (Orig_Node)))));
7276 -- GNAT allows an unchecked type conversion as a variable. This
7277 -- only affects the generation of internal expanded code, since
7278 -- calls to instantiations of Unchecked_Conversion are never
7279 -- considered variables (since they are function calls).
7280 -- This is also true for expression actions.
7282 when N_Unchecked_Type_Conversion =>
7283 return Is_Variable (Expression (Orig_Node));
7291 ---------------------------
7292 -- Is_Visibly_Controlled --
7293 ---------------------------
7295 function Is_Visibly_Controlled (T : Entity_Id) return Boolean is
7296 Root : constant Entity_Id := Root_Type (T);
7298 return Chars (Scope (Root)) = Name_Finalization
7299 and then Chars (Scope (Scope (Root))) = Name_Ada
7300 and then Scope (Scope (Scope (Root))) = Standard_Standard;
7301 end Is_Visibly_Controlled;
7303 ------------------------
7304 -- Is_Volatile_Object --
7305 ------------------------
7307 function Is_Volatile_Object (N : Node_Id) return Boolean is
7309 function Object_Has_Volatile_Components (N : Node_Id) return Boolean;
7310 -- Determines if given object has volatile components
7312 function Is_Volatile_Prefix (N : Node_Id) return Boolean;
7313 -- If prefix is an implicit dereference, examine designated type
7315 ------------------------
7316 -- Is_Volatile_Prefix --
7317 ------------------------
7319 function Is_Volatile_Prefix (N : Node_Id) return Boolean is
7320 Typ : constant Entity_Id := Etype (N);
7323 if Is_Access_Type (Typ) then
7325 Dtyp : constant Entity_Id := Designated_Type (Typ);
7328 return Is_Volatile (Dtyp)
7329 or else Has_Volatile_Components (Dtyp);
7333 return Object_Has_Volatile_Components (N);
7335 end Is_Volatile_Prefix;
7337 ------------------------------------
7338 -- Object_Has_Volatile_Components --
7339 ------------------------------------
7341 function Object_Has_Volatile_Components (N : Node_Id) return Boolean is
7342 Typ : constant Entity_Id := Etype (N);
7345 if Is_Volatile (Typ)
7346 or else Has_Volatile_Components (Typ)
7350 elsif Is_Entity_Name (N)
7351 and then (Has_Volatile_Components (Entity (N))
7352 or else Is_Volatile (Entity (N)))
7356 elsif Nkind (N) = N_Indexed_Component
7357 or else Nkind (N) = N_Selected_Component
7359 return Is_Volatile_Prefix (Prefix (N));
7364 end Object_Has_Volatile_Components;
7366 -- Start of processing for Is_Volatile_Object
7369 if Is_Volatile (Etype (N))
7370 or else (Is_Entity_Name (N) and then Is_Volatile (Entity (N)))
7374 elsif Nkind (N) = N_Indexed_Component
7375 or else Nkind (N) = N_Selected_Component
7377 return Is_Volatile_Prefix (Prefix (N));
7382 end Is_Volatile_Object;
7384 -------------------------
7385 -- Kill_Current_Values --
7386 -------------------------
7388 procedure Kill_Current_Values
7390 Last_Assignment_Only : Boolean := False)
7393 -- ??? do we have to worry about clearing cached checks?
7395 if Is_Assignable (Ent) then
7396 Set_Last_Assignment (Ent, Empty);
7399 if Is_Object (Ent) then
7400 if not Last_Assignment_Only then
7402 Set_Current_Value (Ent, Empty);
7404 if not Can_Never_Be_Null (Ent) then
7405 Set_Is_Known_Non_Null (Ent, False);
7408 Set_Is_Known_Null (Ent, False);
7410 -- Reset Is_Known_Valid unless type is always valid, or if we have
7411 -- a loop parameter (loop parameters are always valid, since their
7412 -- bounds are defined by the bounds given in the loop header).
7414 if not Is_Known_Valid (Etype (Ent))
7415 and then Ekind (Ent) /= E_Loop_Parameter
7417 Set_Is_Known_Valid (Ent, False);
7421 end Kill_Current_Values;
7423 procedure Kill_Current_Values (Last_Assignment_Only : Boolean := False) is
7426 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id);
7427 -- Clear current value for entity E and all entities chained to E
7429 ------------------------------------------
7430 -- Kill_Current_Values_For_Entity_Chain --
7431 ------------------------------------------
7433 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id) is
7437 while Present (Ent) loop
7438 Kill_Current_Values (Ent, Last_Assignment_Only);
7441 end Kill_Current_Values_For_Entity_Chain;
7443 -- Start of processing for Kill_Current_Values
7446 -- Kill all saved checks, a special case of killing saved values
7448 if not Last_Assignment_Only then
7452 -- Loop through relevant scopes, which includes the current scope and
7453 -- any parent scopes if the current scope is a block or a package.
7458 -- Clear current values of all entities in current scope
7460 Kill_Current_Values_For_Entity_Chain (First_Entity (S));
7462 -- If scope is a package, also clear current values of all
7463 -- private entities in the scope.
7465 if Is_Package_Or_Generic_Package (S)
7466 or else Is_Concurrent_Type (S)
7468 Kill_Current_Values_For_Entity_Chain (First_Private_Entity (S));
7471 -- If this is a not a subprogram, deal with parents
7473 if not Is_Subprogram (S) then
7475 exit Scope_Loop when S = Standard_Standard;
7479 end loop Scope_Loop;
7480 end Kill_Current_Values;
7482 --------------------------
7483 -- Kill_Size_Check_Code --
7484 --------------------------
7486 procedure Kill_Size_Check_Code (E : Entity_Id) is
7488 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
7489 and then Present (Size_Check_Code (E))
7491 Remove (Size_Check_Code (E));
7492 Set_Size_Check_Code (E, Empty);
7494 end Kill_Size_Check_Code;
7496 --------------------------
7497 -- Known_To_Be_Assigned --
7498 --------------------------
7500 function Known_To_Be_Assigned (N : Node_Id) return Boolean is
7501 P : constant Node_Id := Parent (N);
7506 -- Test left side of assignment
7508 when N_Assignment_Statement =>
7509 return N = Name (P);
7511 -- Function call arguments are never lvalues
7513 when N_Function_Call =>
7516 -- Positional parameter for procedure or accept call
7518 when N_Procedure_Call_Statement |
7527 Proc := Get_Subprogram_Entity (P);
7533 -- If we are not a list member, something is strange, so
7534 -- be conservative and return False.
7536 if not Is_List_Member (N) then
7540 -- We are going to find the right formal by stepping forward
7541 -- through the formals, as we step backwards in the actuals.
7543 Form := First_Formal (Proc);
7546 -- If no formal, something is weird, so be conservative
7547 -- and return False.
7558 return Ekind (Form) /= E_In_Parameter;
7561 -- Named parameter for procedure or accept call
7563 when N_Parameter_Association =>
7569 Proc := Get_Subprogram_Entity (Parent (P));
7575 -- Loop through formals to find the one that matches
7577 Form := First_Formal (Proc);
7579 -- If no matching formal, that's peculiar, some kind of
7580 -- previous error, so return False to be conservative.
7586 -- Else test for match
7588 if Chars (Form) = Chars (Selector_Name (P)) then
7589 return Ekind (Form) /= E_In_Parameter;
7596 -- Test for appearing in a conversion that itself appears
7597 -- in an lvalue context, since this should be an lvalue.
7599 when N_Type_Conversion =>
7600 return Known_To_Be_Assigned (P);
7602 -- All other references are definitely not known to be modifications
7608 end Known_To_Be_Assigned;
7614 function May_Be_Lvalue (N : Node_Id) return Boolean is
7615 P : constant Node_Id := Parent (N);
7620 -- Test left side of assignment
7622 when N_Assignment_Statement =>
7623 return N = Name (P);
7625 -- Test prefix of component or attribute. Note that the prefix of an
7626 -- explicit or implicit dereference cannot be an l-value.
7628 when N_Attribute_Reference =>
7629 return N = Prefix (P)
7630 and then Name_Implies_Lvalue_Prefix (Attribute_Name (P));
7632 -- For an expanded name, the name is an lvalue if the expanded name
7633 -- is an lvalue, but the prefix is never an lvalue, since it is just
7634 -- the scope where the name is found.
7636 when N_Expanded_Name =>
7637 if N = Prefix (P) then
7638 return May_Be_Lvalue (P);
7643 -- For a selected component A.B, A is certainly an lvalue if A.B is.
7644 -- B is a little interesting, if we have A.B := 3, there is some
7645 -- discussion as to whether B is an lvalue or not, we choose to say
7646 -- it is. Note however that A is not an lvalue if it is of an access
7647 -- type since this is an implicit dereference.
7649 when N_Selected_Component =>
7651 and then Present (Etype (N))
7652 and then Is_Access_Type (Etype (N))
7656 return May_Be_Lvalue (P);
7659 -- For an indexed component or slice, the index or slice bounds is
7660 -- never an lvalue. The prefix is an lvalue if the indexed component
7661 -- or slice is an lvalue, except if it is an access type, where we
7662 -- have an implicit dereference.
7664 when N_Indexed_Component =>
7666 or else (Present (Etype (N)) and then Is_Access_Type (Etype (N)))
7670 return May_Be_Lvalue (P);
7673 -- Prefix of a reference is an lvalue if the reference is an lvalue
7676 return May_Be_Lvalue (P);
7678 -- Prefix of explicit dereference is never an lvalue
7680 when N_Explicit_Dereference =>
7683 -- Function call arguments are never lvalues
7685 when N_Function_Call =>
7688 -- Positional parameter for procedure, entry, or accept call
7690 when N_Procedure_Call_Statement |
7691 N_Entry_Call_Statement |
7700 Proc := Get_Subprogram_Entity (P);
7706 -- If we are not a list member, something is strange, so
7707 -- be conservative and return True.
7709 if not Is_List_Member (N) then
7713 -- We are going to find the right formal by stepping forward
7714 -- through the formals, as we step backwards in the actuals.
7716 Form := First_Formal (Proc);
7719 -- If no formal, something is weird, so be conservative
7731 return Ekind (Form) /= E_In_Parameter;
7734 -- Named parameter for procedure or accept call
7736 when N_Parameter_Association =>
7742 Proc := Get_Subprogram_Entity (Parent (P));
7748 -- Loop through formals to find the one that matches
7750 Form := First_Formal (Proc);
7752 -- If no matching formal, that's peculiar, some kind of
7753 -- previous error, so return True to be conservative.
7759 -- Else test for match
7761 if Chars (Form) = Chars (Selector_Name (P)) then
7762 return Ekind (Form) /= E_In_Parameter;
7769 -- Test for appearing in a conversion that itself appears in an
7770 -- lvalue context, since this should be an lvalue.
7772 when N_Type_Conversion =>
7773 return May_Be_Lvalue (P);
7775 -- Test for appearance in object renaming declaration
7777 when N_Object_Renaming_Declaration =>
7780 -- All other references are definitely not lvalues
7788 -----------------------
7789 -- Mark_Coextensions --
7790 -----------------------
7792 procedure Mark_Coextensions (Context_Nod : Node_Id; Root_Nod : Node_Id) is
7793 Is_Dynamic : Boolean;
7794 -- Indicates whether the context causes nested coextensions to be
7795 -- dynamic or static
7797 function Mark_Allocator (N : Node_Id) return Traverse_Result;
7798 -- Recognize an allocator node and label it as a dynamic coextension
7800 --------------------
7801 -- Mark_Allocator --
7802 --------------------
7804 function Mark_Allocator (N : Node_Id) return Traverse_Result is
7806 if Nkind (N) = N_Allocator then
7808 Set_Is_Dynamic_Coextension (N);
7810 Set_Is_Static_Coextension (N);
7817 procedure Mark_Allocators is new Traverse_Proc (Mark_Allocator);
7819 -- Start of processing Mark_Coextensions
7822 case Nkind (Context_Nod) is
7823 when N_Assignment_Statement |
7824 N_Simple_Return_Statement =>
7825 Is_Dynamic := Nkind (Expression (Context_Nod)) = N_Allocator;
7827 when N_Object_Declaration =>
7828 Is_Dynamic := Nkind (Root_Nod) = N_Allocator;
7830 -- This routine should not be called for constructs which may not
7831 -- contain coextensions.
7834 raise Program_Error;
7837 Mark_Allocators (Root_Nod);
7838 end Mark_Coextensions;
7840 ----------------------
7841 -- Needs_One_Actual --
7842 ----------------------
7844 function Needs_One_Actual (E : Entity_Id) return Boolean is
7848 if Ada_Version >= Ada_05
7849 and then Present (First_Formal (E))
7851 Formal := Next_Formal (First_Formal (E));
7852 while Present (Formal) loop
7853 if No (Default_Value (Formal)) then
7857 Next_Formal (Formal);
7865 end Needs_One_Actual;
7867 ------------------------
7868 -- New_Copy_List_Tree --
7869 ------------------------
7871 function New_Copy_List_Tree (List : List_Id) return List_Id is
7876 if List = No_List then
7883 while Present (E) loop
7884 Append (New_Copy_Tree (E), NL);
7890 end New_Copy_List_Tree;
7896 use Atree.Unchecked_Access;
7897 use Atree_Private_Part;
7899 -- Our approach here requires a two pass traversal of the tree. The
7900 -- first pass visits all nodes that eventually will be copied looking
7901 -- for defining Itypes. If any defining Itypes are found, then they are
7902 -- copied, and an entry is added to the replacement map. In the second
7903 -- phase, the tree is copied, using the replacement map to replace any
7904 -- Itype references within the copied tree.
7906 -- The following hash tables are used if the Map supplied has more
7907 -- than hash threshhold entries to speed up access to the map. If
7908 -- there are fewer entries, then the map is searched sequentially
7909 -- (because setting up a hash table for only a few entries takes
7910 -- more time than it saves.
7912 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
7913 -- Hash function used for hash operations
7919 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
7921 return Nat (E) mod (NCT_Header_Num'Last + 1);
7928 -- The hash table NCT_Assoc associates old entities in the table
7929 -- with their corresponding new entities (i.e. the pairs of entries
7930 -- presented in the original Map argument are Key-Element pairs).
7932 package NCT_Assoc is new Simple_HTable (
7933 Header_Num => NCT_Header_Num,
7934 Element => Entity_Id,
7935 No_Element => Empty,
7937 Hash => New_Copy_Hash,
7938 Equal => Types."=");
7940 ---------------------
7941 -- NCT_Itype_Assoc --
7942 ---------------------
7944 -- The hash table NCT_Itype_Assoc contains entries only for those
7945 -- old nodes which have a non-empty Associated_Node_For_Itype set.
7946 -- The key is the associated node, and the element is the new node
7947 -- itself (NOT the associated node for the new node).
7949 package NCT_Itype_Assoc is new Simple_HTable (
7950 Header_Num => NCT_Header_Num,
7951 Element => Entity_Id,
7952 No_Element => Empty,
7954 Hash => New_Copy_Hash,
7955 Equal => Types."=");
7957 -- Start of processing for New_Copy_Tree function
7959 function New_Copy_Tree
7961 Map : Elist_Id := No_Elist;
7962 New_Sloc : Source_Ptr := No_Location;
7963 New_Scope : Entity_Id := Empty) return Node_Id
7965 Actual_Map : Elist_Id := Map;
7966 -- This is the actual map for the copy. It is initialized with the
7967 -- given elements, and then enlarged as required for Itypes that are
7968 -- copied during the first phase of the copy operation. The visit
7969 -- procedures add elements to this map as Itypes are encountered.
7970 -- The reason we cannot use Map directly, is that it may well be
7971 -- (and normally is) initialized to No_Elist, and if we have mapped
7972 -- entities, we have to reset it to point to a real Elist.
7974 function Assoc (N : Node_Or_Entity_Id) return Node_Id;
7975 -- Called during second phase to map entities into their corresponding
7976 -- copies using Actual_Map. If the argument is not an entity, or is not
7977 -- in Actual_Map, then it is returned unchanged.
7979 procedure Build_NCT_Hash_Tables;
7980 -- Builds hash tables (number of elements >= threshold value)
7982 function Copy_Elist_With_Replacement
7983 (Old_Elist : Elist_Id) return Elist_Id;
7984 -- Called during second phase to copy element list doing replacements
7986 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
7987 -- Called during the second phase to process a copied Itype. The actual
7988 -- copy happened during the first phase (so that we could make the entry
7989 -- in the mapping), but we still have to deal with the descendents of
7990 -- the copied Itype and copy them where necessary.
7992 function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
7993 -- Called during second phase to copy list doing replacements
7995 function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
7996 -- Called during second phase to copy node doing replacements
7998 procedure Visit_Elist (E : Elist_Id);
7999 -- Called during first phase to visit all elements of an Elist
8001 procedure Visit_Field (F : Union_Id; N : Node_Id);
8002 -- Visit a single field, recursing to call Visit_Node or Visit_List
8003 -- if the field is a syntactic descendent of the current node (i.e.
8004 -- its parent is Node N).
8006 procedure Visit_Itype (Old_Itype : Entity_Id);
8007 -- Called during first phase to visit subsidiary fields of a defining
8008 -- Itype, and also create a copy and make an entry in the replacement
8009 -- map for the new copy.
8011 procedure Visit_List (L : List_Id);
8012 -- Called during first phase to visit all elements of a List
8014 procedure Visit_Node (N : Node_Or_Entity_Id);
8015 -- Called during first phase to visit a node and all its subtrees
8021 function Assoc (N : Node_Or_Entity_Id) return Node_Id is
8026 if not Has_Extension (N) or else No (Actual_Map) then
8029 elsif NCT_Hash_Tables_Used then
8030 Ent := NCT_Assoc.Get (Entity_Id (N));
8032 if Present (Ent) then
8038 -- No hash table used, do serial search
8041 E := First_Elmt (Actual_Map);
8042 while Present (E) loop
8043 if Node (E) = N then
8044 return Node (Next_Elmt (E));
8046 E := Next_Elmt (Next_Elmt (E));
8054 ---------------------------
8055 -- Build_NCT_Hash_Tables --
8056 ---------------------------
8058 procedure Build_NCT_Hash_Tables is
8062 if NCT_Hash_Table_Setup then
8064 NCT_Itype_Assoc.Reset;
8067 Elmt := First_Elmt (Actual_Map);
8068 while Present (Elmt) loop
8071 -- Get new entity, and associate old and new
8074 NCT_Assoc.Set (Ent, Node (Elmt));
8076 if Is_Type (Ent) then
8078 Anode : constant Entity_Id :=
8079 Associated_Node_For_Itype (Ent);
8082 if Present (Anode) then
8084 -- Enter a link between the associated node of the
8085 -- old Itype and the new Itype, for updating later
8086 -- when node is copied.
8088 NCT_Itype_Assoc.Set (Anode, Node (Elmt));
8096 NCT_Hash_Tables_Used := True;
8097 NCT_Hash_Table_Setup := True;
8098 end Build_NCT_Hash_Tables;
8100 ---------------------------------
8101 -- Copy_Elist_With_Replacement --
8102 ---------------------------------
8104 function Copy_Elist_With_Replacement
8105 (Old_Elist : Elist_Id) return Elist_Id
8108 New_Elist : Elist_Id;
8111 if No (Old_Elist) then
8115 New_Elist := New_Elmt_List;
8117 M := First_Elmt (Old_Elist);
8118 while Present (M) loop
8119 Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
8125 end Copy_Elist_With_Replacement;
8127 ---------------------------------
8128 -- Copy_Itype_With_Replacement --
8129 ---------------------------------
8131 -- This routine exactly parallels its phase one analog Visit_Itype,
8133 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
8135 -- Translate Next_Entity, Scope and Etype fields, in case they
8136 -- reference entities that have been mapped into copies.
8138 Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
8139 Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
8141 if Present (New_Scope) then
8142 Set_Scope (New_Itype, New_Scope);
8144 Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
8147 -- Copy referenced fields
8149 if Is_Discrete_Type (New_Itype) then
8150 Set_Scalar_Range (New_Itype,
8151 Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
8153 elsif Has_Discriminants (Base_Type (New_Itype)) then
8154 Set_Discriminant_Constraint (New_Itype,
8155 Copy_Elist_With_Replacement
8156 (Discriminant_Constraint (New_Itype)));
8158 elsif Is_Array_Type (New_Itype) then
8159 if Present (First_Index (New_Itype)) then
8160 Set_First_Index (New_Itype,
8161 First (Copy_List_With_Replacement
8162 (List_Containing (First_Index (New_Itype)))));
8165 if Is_Packed (New_Itype) then
8166 Set_Packed_Array_Type (New_Itype,
8167 Copy_Node_With_Replacement
8168 (Packed_Array_Type (New_Itype)));
8171 end Copy_Itype_With_Replacement;
8173 --------------------------------
8174 -- Copy_List_With_Replacement --
8175 --------------------------------
8177 function Copy_List_With_Replacement
8178 (Old_List : List_Id) return List_Id
8184 if Old_List = No_List then
8188 New_List := Empty_List;
8190 E := First (Old_List);
8191 while Present (E) loop
8192 Append (Copy_Node_With_Replacement (E), New_List);
8198 end Copy_List_With_Replacement;
8200 --------------------------------
8201 -- Copy_Node_With_Replacement --
8202 --------------------------------
8204 function Copy_Node_With_Replacement
8205 (Old_Node : Node_Id) return Node_Id
8209 procedure Adjust_Named_Associations
8210 (Old_Node : Node_Id;
8211 New_Node : Node_Id);
8212 -- If a call node has named associations, these are chained through
8213 -- the First_Named_Actual, Next_Named_Actual links. These must be
8214 -- propagated separately to the new parameter list, because these
8215 -- are not syntactic fields.
8217 function Copy_Field_With_Replacement
8218 (Field : Union_Id) return Union_Id;
8219 -- Given Field, which is a field of Old_Node, return a copy of it
8220 -- if it is a syntactic field (i.e. its parent is Node), setting
8221 -- the parent of the copy to poit to New_Node. Otherwise returns
8222 -- the field (possibly mapped if it is an entity).
8224 -------------------------------
8225 -- Adjust_Named_Associations --
8226 -------------------------------
8228 procedure Adjust_Named_Associations
8229 (Old_Node : Node_Id;
8239 Old_E := First (Parameter_Associations (Old_Node));
8240 New_E := First (Parameter_Associations (New_Node));
8241 while Present (Old_E) loop
8242 if Nkind (Old_E) = N_Parameter_Association
8243 and then Present (Next_Named_Actual (Old_E))
8245 if First_Named_Actual (Old_Node)
8246 = Explicit_Actual_Parameter (Old_E)
8248 Set_First_Named_Actual
8249 (New_Node, Explicit_Actual_Parameter (New_E));
8252 -- Now scan parameter list from the beginning,to locate
8253 -- next named actual, which can be out of order.
8255 Old_Next := First (Parameter_Associations (Old_Node));
8256 New_Next := First (Parameter_Associations (New_Node));
8258 while Nkind (Old_Next) /= N_Parameter_Association
8259 or else Explicit_Actual_Parameter (Old_Next)
8260 /= Next_Named_Actual (Old_E)
8266 Set_Next_Named_Actual
8267 (New_E, Explicit_Actual_Parameter (New_Next));
8273 end Adjust_Named_Associations;
8275 ---------------------------------
8276 -- Copy_Field_With_Replacement --
8277 ---------------------------------
8279 function Copy_Field_With_Replacement
8280 (Field : Union_Id) return Union_Id
8283 if Field = Union_Id (Empty) then
8286 elsif Field in Node_Range then
8288 Old_N : constant Node_Id := Node_Id (Field);
8292 -- If syntactic field, as indicated by the parent pointer
8293 -- being set, then copy the referenced node recursively.
8295 if Parent (Old_N) = Old_Node then
8296 New_N := Copy_Node_With_Replacement (Old_N);
8298 if New_N /= Old_N then
8299 Set_Parent (New_N, New_Node);
8302 -- For semantic fields, update possible entity reference
8303 -- from the replacement map.
8306 New_N := Assoc (Old_N);
8309 return Union_Id (New_N);
8312 elsif Field in List_Range then
8314 Old_L : constant List_Id := List_Id (Field);
8318 -- If syntactic field, as indicated by the parent pointer,
8319 -- then recursively copy the entire referenced list.
8321 if Parent (Old_L) = Old_Node then
8322 New_L := Copy_List_With_Replacement (Old_L);
8323 Set_Parent (New_L, New_Node);
8325 -- For semantic list, just returned unchanged
8331 return Union_Id (New_L);
8334 -- Anything other than a list or a node is returned unchanged
8339 end Copy_Field_With_Replacement;
8341 -- Start of processing for Copy_Node_With_Replacement
8344 if Old_Node <= Empty_Or_Error then
8347 elsif Has_Extension (Old_Node) then
8348 return Assoc (Old_Node);
8351 New_Node := New_Copy (Old_Node);
8353 -- If the node we are copying is the associated node of a
8354 -- previously copied Itype, then adjust the associated node
8355 -- of the copy of that Itype accordingly.
8357 if Present (Actual_Map) then
8363 -- Case of hash table used
8365 if NCT_Hash_Tables_Used then
8366 Ent := NCT_Itype_Assoc.Get (Old_Node);
8368 if Present (Ent) then
8369 Set_Associated_Node_For_Itype (Ent, New_Node);
8372 -- Case of no hash table used
8375 E := First_Elmt (Actual_Map);
8376 while Present (E) loop
8377 if Is_Itype (Node (E))
8379 Old_Node = Associated_Node_For_Itype (Node (E))
8381 Set_Associated_Node_For_Itype
8382 (Node (Next_Elmt (E)), New_Node);
8385 E := Next_Elmt (Next_Elmt (E));
8391 -- Recursively copy descendents
8394 (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
8396 (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
8398 (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
8400 (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
8402 (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
8404 -- Adjust Sloc of new node if necessary
8406 if New_Sloc /= No_Location then
8407 Set_Sloc (New_Node, New_Sloc);
8409 -- If we adjust the Sloc, then we are essentially making
8410 -- a completely new node, so the Comes_From_Source flag
8411 -- should be reset to the proper default value.
8413 Nodes.Table (New_Node).Comes_From_Source :=
8414 Default_Node.Comes_From_Source;
8417 -- If the node is call and has named associations,
8418 -- set the corresponding links in the copy.
8420 if (Nkind (Old_Node) = N_Function_Call
8421 or else Nkind (Old_Node) = N_Entry_Call_Statement
8423 Nkind (Old_Node) = N_Procedure_Call_Statement)
8424 and then Present (First_Named_Actual (Old_Node))
8426 Adjust_Named_Associations (Old_Node, New_Node);
8429 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
8430 -- The replacement mechanism applies to entities, and is not used
8431 -- here. Eventually we may need a more general graph-copying
8432 -- routine. For now, do a sequential search to find desired node.
8434 if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
8435 and then Present (First_Real_Statement (Old_Node))
8438 Old_F : constant Node_Id := First_Real_Statement (Old_Node);
8442 N1 := First (Statements (Old_Node));
8443 N2 := First (Statements (New_Node));
8445 while N1 /= Old_F loop
8450 Set_First_Real_Statement (New_Node, N2);
8455 -- All done, return copied node
8458 end Copy_Node_With_Replacement;
8464 procedure Visit_Elist (E : Elist_Id) is
8468 Elmt := First_Elmt (E);
8470 while Elmt /= No_Elmt loop
8471 Visit_Node (Node (Elmt));
8481 procedure Visit_Field (F : Union_Id; N : Node_Id) is
8483 if F = Union_Id (Empty) then
8486 elsif F in Node_Range then
8488 -- Copy node if it is syntactic, i.e. its parent pointer is
8489 -- set to point to the field that referenced it (certain
8490 -- Itypes will also meet this criterion, which is fine, since
8491 -- these are clearly Itypes that do need to be copied, since
8492 -- we are copying their parent.)
8494 if Parent (Node_Id (F)) = N then
8495 Visit_Node (Node_Id (F));
8498 -- Another case, if we are pointing to an Itype, then we want
8499 -- to copy it if its associated node is somewhere in the tree
8502 -- Note: the exclusion of self-referential copies is just an
8503 -- optimization, since the search of the already copied list
8504 -- would catch it, but it is a common case (Etype pointing
8505 -- to itself for an Itype that is a base type).
8507 elsif Has_Extension (Node_Id (F))
8508 and then Is_Itype (Entity_Id (F))
8509 and then Node_Id (F) /= N
8515 P := Associated_Node_For_Itype (Node_Id (F));
8516 while Present (P) loop
8518 Visit_Node (Node_Id (F));
8525 -- An Itype whose parent is not being copied definitely
8526 -- should NOT be copied, since it does not belong in any
8527 -- sense to the copied subtree.
8533 elsif F in List_Range
8534 and then Parent (List_Id (F)) = N
8536 Visit_List (List_Id (F));
8545 procedure Visit_Itype (Old_Itype : Entity_Id) is
8546 New_Itype : Entity_Id;
8551 -- Itypes that describe the designated type of access to subprograms
8552 -- have the structure of subprogram declarations, with signatures,
8553 -- etc. Either we duplicate the signatures completely, or choose to
8554 -- share such itypes, which is fine because their elaboration will
8555 -- have no side effects.
8557 if Ekind (Old_Itype) = E_Subprogram_Type then
8561 New_Itype := New_Copy (Old_Itype);
8563 -- The new Itype has all the attributes of the old one, and
8564 -- we just copy the contents of the entity. However, the back-end
8565 -- needs different names for debugging purposes, so we create a
8566 -- new internal name for it in all cases.
8568 Set_Chars (New_Itype, New_Internal_Name ('T'));
8570 -- If our associated node is an entity that has already been copied,
8571 -- then set the associated node of the copy to point to the right
8572 -- copy. If we have copied an Itype that is itself the associated
8573 -- node of some previously copied Itype, then we set the right
8574 -- pointer in the other direction.
8576 if Present (Actual_Map) then
8578 -- Case of hash tables used
8580 if NCT_Hash_Tables_Used then
8582 Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
8584 if Present (Ent) then
8585 Set_Associated_Node_For_Itype (New_Itype, Ent);
8588 Ent := NCT_Itype_Assoc.Get (Old_Itype);
8589 if Present (Ent) then
8590 Set_Associated_Node_For_Itype (Ent, New_Itype);
8592 -- If the hash table has no association for this Itype and
8593 -- its associated node, enter one now.
8597 (Associated_Node_For_Itype (Old_Itype), New_Itype);
8600 -- Case of hash tables not used
8603 E := First_Elmt (Actual_Map);
8604 while Present (E) loop
8605 if Associated_Node_For_Itype (Old_Itype) = Node (E) then
8606 Set_Associated_Node_For_Itype
8607 (New_Itype, Node (Next_Elmt (E)));
8610 if Is_Type (Node (E))
8612 Old_Itype = Associated_Node_For_Itype (Node (E))
8614 Set_Associated_Node_For_Itype
8615 (Node (Next_Elmt (E)), New_Itype);
8618 E := Next_Elmt (Next_Elmt (E));
8623 if Present (Freeze_Node (New_Itype)) then
8624 Set_Is_Frozen (New_Itype, False);
8625 Set_Freeze_Node (New_Itype, Empty);
8628 -- Add new association to map
8630 if No (Actual_Map) then
8631 Actual_Map := New_Elmt_List;
8634 Append_Elmt (Old_Itype, Actual_Map);
8635 Append_Elmt (New_Itype, Actual_Map);
8637 if NCT_Hash_Tables_Used then
8638 NCT_Assoc.Set (Old_Itype, New_Itype);
8641 NCT_Table_Entries := NCT_Table_Entries + 1;
8643 if NCT_Table_Entries > NCT_Hash_Threshhold then
8644 Build_NCT_Hash_Tables;
8648 -- If a record subtype is simply copied, the entity list will be
8649 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
8651 if Ekind_In (Old_Itype, E_Record_Subtype, E_Class_Wide_Subtype) then
8652 Set_Cloned_Subtype (New_Itype, Old_Itype);
8655 -- Visit descendents that eventually get copied
8657 Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
8659 if Is_Discrete_Type (Old_Itype) then
8660 Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
8662 elsif Has_Discriminants (Base_Type (Old_Itype)) then
8663 -- ??? This should involve call to Visit_Field
8664 Visit_Elist (Discriminant_Constraint (Old_Itype));
8666 elsif Is_Array_Type (Old_Itype) then
8667 if Present (First_Index (Old_Itype)) then
8668 Visit_Field (Union_Id (List_Containing
8669 (First_Index (Old_Itype))),
8673 if Is_Packed (Old_Itype) then
8674 Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)),
8684 procedure Visit_List (L : List_Id) is
8687 if L /= No_List then
8690 while Present (N) loop
8701 procedure Visit_Node (N : Node_Or_Entity_Id) is
8703 -- Start of processing for Visit_Node
8706 -- Handle case of an Itype, which must be copied
8708 if Has_Extension (N)
8709 and then Is_Itype (N)
8711 -- Nothing to do if already in the list. This can happen with an
8712 -- Itype entity that appears more than once in the tree.
8713 -- Note that we do not want to visit descendents in this case.
8715 -- Test for already in list when hash table is used
8717 if NCT_Hash_Tables_Used then
8718 if Present (NCT_Assoc.Get (Entity_Id (N))) then
8722 -- Test for already in list when hash table not used
8728 if Present (Actual_Map) then
8729 E := First_Elmt (Actual_Map);
8730 while Present (E) loop
8731 if Node (E) = N then
8734 E := Next_Elmt (Next_Elmt (E));
8744 -- Visit descendents
8746 Visit_Field (Field1 (N), N);
8747 Visit_Field (Field2 (N), N);
8748 Visit_Field (Field3 (N), N);
8749 Visit_Field (Field4 (N), N);
8750 Visit_Field (Field5 (N), N);
8753 -- Start of processing for New_Copy_Tree
8758 -- See if we should use hash table
8760 if No (Actual_Map) then
8761 NCT_Hash_Tables_Used := False;
8768 NCT_Table_Entries := 0;
8770 Elmt := First_Elmt (Actual_Map);
8771 while Present (Elmt) loop
8772 NCT_Table_Entries := NCT_Table_Entries + 1;
8777 if NCT_Table_Entries > NCT_Hash_Threshhold then
8778 Build_NCT_Hash_Tables;
8780 NCT_Hash_Tables_Used := False;
8785 -- Hash table set up if required, now start phase one by visiting
8786 -- top node (we will recursively visit the descendents).
8788 Visit_Node (Source);
8790 -- Now the second phase of the copy can start. First we process
8791 -- all the mapped entities, copying their descendents.
8793 if Present (Actual_Map) then
8796 New_Itype : Entity_Id;
8798 Elmt := First_Elmt (Actual_Map);
8799 while Present (Elmt) loop
8801 New_Itype := Node (Elmt);
8802 Copy_Itype_With_Replacement (New_Itype);
8808 -- Now we can copy the actual tree
8810 return Copy_Node_With_Replacement (Source);
8813 -------------------------
8814 -- New_External_Entity --
8815 -------------------------
8817 function New_External_Entity
8818 (Kind : Entity_Kind;
8819 Scope_Id : Entity_Id;
8820 Sloc_Value : Source_Ptr;
8821 Related_Id : Entity_Id;
8823 Suffix_Index : Nat := 0;
8824 Prefix : Character := ' ') return Entity_Id
8826 N : constant Entity_Id :=
8827 Make_Defining_Identifier (Sloc_Value,
8829 (Chars (Related_Id), Suffix, Suffix_Index, Prefix));
8832 Set_Ekind (N, Kind);
8833 Set_Is_Internal (N, True);
8834 Append_Entity (N, Scope_Id);
8835 Set_Public_Status (N);
8837 if Kind in Type_Kind then
8838 Init_Size_Align (N);
8842 end New_External_Entity;
8844 -------------------------
8845 -- New_Internal_Entity --
8846 -------------------------
8848 function New_Internal_Entity
8849 (Kind : Entity_Kind;
8850 Scope_Id : Entity_Id;
8851 Sloc_Value : Source_Ptr;
8852 Id_Char : Character) return Entity_Id
8854 N : constant Entity_Id :=
8855 Make_Defining_Identifier (Sloc_Value, New_Internal_Name (Id_Char));
8858 Set_Ekind (N, Kind);
8859 Set_Is_Internal (N, True);
8860 Append_Entity (N, Scope_Id);
8862 if Kind in Type_Kind then
8863 Init_Size_Align (N);
8867 end New_Internal_Entity;
8873 function Next_Actual (Actual_Id : Node_Id) return Node_Id is
8877 -- If we are pointing at a positional parameter, it is a member of a
8878 -- node list (the list of parameters), and the next parameter is the
8879 -- next node on the list, unless we hit a parameter association, then
8880 -- we shift to using the chain whose head is the First_Named_Actual in
8881 -- the parent, and then is threaded using the Next_Named_Actual of the
8882 -- Parameter_Association. All this fiddling is because the original node
8883 -- list is in the textual call order, and what we need is the
8884 -- declaration order.
8886 if Is_List_Member (Actual_Id) then
8887 N := Next (Actual_Id);
8889 if Nkind (N) = N_Parameter_Association then
8890 return First_Named_Actual (Parent (Actual_Id));
8896 return Next_Named_Actual (Parent (Actual_Id));
8900 procedure Next_Actual (Actual_Id : in out Node_Id) is
8902 Actual_Id := Next_Actual (Actual_Id);
8905 -----------------------
8906 -- Normalize_Actuals --
8907 -----------------------
8909 -- Chain actuals according to formals of subprogram. If there are no named
8910 -- associations, the chain is simply the list of Parameter Associations,
8911 -- since the order is the same as the declaration order. If there are named
8912 -- associations, then the First_Named_Actual field in the N_Function_Call
8913 -- or N_Procedure_Call_Statement node points to the Parameter_Association
8914 -- node for the parameter that comes first in declaration order. The
8915 -- remaining named parameters are then chained in declaration order using
8916 -- Next_Named_Actual.
8918 -- This routine also verifies that the number of actuals is compatible with
8919 -- the number and default values of formals, but performs no type checking
8920 -- (type checking is done by the caller).
8922 -- If the matching succeeds, Success is set to True and the caller proceeds
8923 -- with type-checking. If the match is unsuccessful, then Success is set to
8924 -- False, and the caller attempts a different interpretation, if there is
8927 -- If the flag Report is on, the call is not overloaded, and a failure to
8928 -- match can be reported here, rather than in the caller.
8930 procedure Normalize_Actuals
8934 Success : out Boolean)
8936 Actuals : constant List_Id := Parameter_Associations (N);
8937 Actual : Node_Id := Empty;
8939 Last : Node_Id := Empty;
8940 First_Named : Node_Id := Empty;
8943 Formals_To_Match : Integer := 0;
8944 Actuals_To_Match : Integer := 0;
8946 procedure Chain (A : Node_Id);
8947 -- Add named actual at the proper place in the list, using the
8948 -- Next_Named_Actual link.
8950 function Reporting return Boolean;
8951 -- Determines if an error is to be reported. To report an error, we
8952 -- need Report to be True, and also we do not report errors caused
8953 -- by calls to init procs that occur within other init procs. Such
8954 -- errors must always be cascaded errors, since if all the types are
8955 -- declared correctly, the compiler will certainly build decent calls!
8961 procedure Chain (A : Node_Id) is
8965 -- Call node points to first actual in list
8967 Set_First_Named_Actual (N, Explicit_Actual_Parameter (A));
8970 Set_Next_Named_Actual (Last, Explicit_Actual_Parameter (A));
8974 Set_Next_Named_Actual (Last, Empty);
8981 function Reporting return Boolean is
8986 elsif not Within_Init_Proc then
8989 elsif Is_Init_Proc (Entity (Name (N))) then
8997 -- Start of processing for Normalize_Actuals
9000 if Is_Access_Type (S) then
9002 -- The name in the call is a function call that returns an access
9003 -- to subprogram. The designated type has the list of formals.
9005 Formal := First_Formal (Designated_Type (S));
9007 Formal := First_Formal (S);
9010 while Present (Formal) loop
9011 Formals_To_Match := Formals_To_Match + 1;
9012 Next_Formal (Formal);
9015 -- Find if there is a named association, and verify that no positional
9016 -- associations appear after named ones.
9018 if Present (Actuals) then
9019 Actual := First (Actuals);
9022 while Present (Actual)
9023 and then Nkind (Actual) /= N_Parameter_Association
9025 Actuals_To_Match := Actuals_To_Match + 1;
9029 if No (Actual) and Actuals_To_Match = Formals_To_Match then
9031 -- Most common case: positional notation, no defaults
9036 elsif Actuals_To_Match > Formals_To_Match then
9038 -- Too many actuals: will not work
9041 if Is_Entity_Name (Name (N)) then
9042 Error_Msg_N ("too many arguments in call to&", Name (N));
9044 Error_Msg_N ("too many arguments in call", N);
9052 First_Named := Actual;
9054 while Present (Actual) loop
9055 if Nkind (Actual) /= N_Parameter_Association then
9057 ("positional parameters not allowed after named ones", Actual);
9062 Actuals_To_Match := Actuals_To_Match + 1;
9068 if Present (Actuals) then
9069 Actual := First (Actuals);
9072 Formal := First_Formal (S);
9073 while Present (Formal) loop
9075 -- Match the formals in order. If the corresponding actual is
9076 -- positional, nothing to do. Else scan the list of named actuals
9077 -- to find the one with the right name.
9080 and then Nkind (Actual) /= N_Parameter_Association
9083 Actuals_To_Match := Actuals_To_Match - 1;
9084 Formals_To_Match := Formals_To_Match - 1;
9087 -- For named parameters, search the list of actuals to find
9088 -- one that matches the next formal name.
9090 Actual := First_Named;
9092 while Present (Actual) loop
9093 if Chars (Selector_Name (Actual)) = Chars (Formal) then
9096 Actuals_To_Match := Actuals_To_Match - 1;
9097 Formals_To_Match := Formals_To_Match - 1;
9105 if Ekind (Formal) /= E_In_Parameter
9106 or else No (Default_Value (Formal))
9109 if (Comes_From_Source (S)
9110 or else Sloc (S) = Standard_Location)
9111 and then Is_Overloadable (S)
9115 (Nkind (Parent (N)) = N_Procedure_Call_Statement
9117 (Nkind (Parent (N)) = N_Function_Call
9119 Nkind (Parent (N)) = N_Parameter_Association))
9120 and then Ekind (S) /= E_Function
9122 Set_Etype (N, Etype (S));
9124 Error_Msg_Name_1 := Chars (S);
9125 Error_Msg_Sloc := Sloc (S);
9127 ("missing argument for parameter & " &
9128 "in call to % declared #", N, Formal);
9131 elsif Is_Overloadable (S) then
9132 Error_Msg_Name_1 := Chars (S);
9134 -- Point to type derivation that generated the
9137 Error_Msg_Sloc := Sloc (Parent (S));
9140 ("missing argument for parameter & " &
9141 "in call to % (inherited) #", N, Formal);
9145 ("missing argument for parameter &", N, Formal);
9153 Formals_To_Match := Formals_To_Match - 1;
9158 Next_Formal (Formal);
9161 if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
9168 -- Find some superfluous named actual that did not get
9169 -- attached to the list of associations.
9171 Actual := First (Actuals);
9172 while Present (Actual) loop
9173 if Nkind (Actual) = N_Parameter_Association
9174 and then Actual /= Last
9175 and then No (Next_Named_Actual (Actual))
9177 Error_Msg_N ("unmatched actual & in call",
9178 Selector_Name (Actual));
9189 end Normalize_Actuals;
9191 --------------------------------
9192 -- Note_Possible_Modification --
9193 --------------------------------
9195 procedure Note_Possible_Modification (N : Node_Id; Sure : Boolean) is
9196 Modification_Comes_From_Source : constant Boolean :=
9197 Comes_From_Source (Parent (N));
9203 -- Loop to find referenced entity, if there is one
9210 if Is_Entity_Name (Exp) then
9211 Ent := Entity (Exp);
9213 -- If the entity is missing, it is an undeclared identifier,
9214 -- and there is nothing to annotate.
9220 elsif Nkind (Exp) = N_Explicit_Dereference then
9222 P : constant Node_Id := Prefix (Exp);
9225 if Nkind (P) = N_Selected_Component
9227 Entry_Formal (Entity (Selector_Name (P))))
9229 -- Case of a reference to an entry formal
9231 Ent := Entry_Formal (Entity (Selector_Name (P)));
9233 elsif Nkind (P) = N_Identifier
9234 and then Nkind (Parent (Entity (P))) = N_Object_Declaration
9235 and then Present (Expression (Parent (Entity (P))))
9236 and then Nkind (Expression (Parent (Entity (P))))
9239 -- Case of a reference to a value on which side effects have
9242 Exp := Prefix (Expression (Parent (Entity (P))));
9251 elsif Nkind (Exp) = N_Type_Conversion
9252 or else Nkind (Exp) = N_Unchecked_Type_Conversion
9254 Exp := Expression (Exp);
9257 elsif Nkind (Exp) = N_Slice
9258 or else Nkind (Exp) = N_Indexed_Component
9259 or else Nkind (Exp) = N_Selected_Component
9261 Exp := Prefix (Exp);
9268 -- Now look for entity being referenced
9270 if Present (Ent) then
9271 if Is_Object (Ent) then
9272 if Comes_From_Source (Exp)
9273 or else Modification_Comes_From_Source
9275 if Has_Pragma_Unmodified (Ent) then
9276 Error_Msg_NE ("?pragma Unmodified given for &!", N, Ent);
9279 Set_Never_Set_In_Source (Ent, False);
9282 Set_Is_True_Constant (Ent, False);
9283 Set_Current_Value (Ent, Empty);
9284 Set_Is_Known_Null (Ent, False);
9286 if not Can_Never_Be_Null (Ent) then
9287 Set_Is_Known_Non_Null (Ent, False);
9290 -- Follow renaming chain
9292 if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
9293 and then Present (Renamed_Object (Ent))
9295 Exp := Renamed_Object (Ent);
9299 -- Generate a reference only if the assignment comes from
9300 -- source. This excludes, for example, calls to a dispatching
9301 -- assignment operation when the left-hand side is tagged.
9303 if Modification_Comes_From_Source then
9304 Generate_Reference (Ent, Exp, 'm');
9307 Check_Nested_Access (Ent);
9312 -- If we are sure this is a modification from source, and we know
9313 -- this modifies a constant, then give an appropriate warning.
9315 if Overlays_Constant (Ent)
9316 and then Modification_Comes_From_Source
9320 A : constant Node_Id := Address_Clause (Ent);
9324 Exp : constant Node_Id := Expression (A);
9326 if Nkind (Exp) = N_Attribute_Reference
9327 and then Attribute_Name (Exp) = Name_Address
9328 and then Is_Entity_Name (Prefix (Exp))
9330 Error_Msg_Sloc := Sloc (A);
9332 ("constant& may be modified via address clause#?",
9333 N, Entity (Prefix (Exp)));
9343 end Note_Possible_Modification;
9345 -------------------------
9346 -- Object_Access_Level --
9347 -------------------------
9349 function Object_Access_Level (Obj : Node_Id) return Uint is
9352 -- Returns the static accessibility level of the view denoted by Obj. Note
9353 -- that the value returned is the result of a call to Scope_Depth. Only
9354 -- scope depths associated with dynamic scopes can actually be returned.
9355 -- Since only relative levels matter for accessibility checking, the fact
9356 -- that the distance between successive levels of accessibility is not
9357 -- always one is immaterial (invariant: if level(E2) is deeper than
9358 -- level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
9360 function Reference_To (Obj : Node_Id) return Node_Id;
9361 -- An explicit dereference is created when removing side-effects from
9362 -- expressions for constraint checking purposes. In this case a local
9363 -- access type is created for it. The correct access level is that of
9364 -- the original source node. We detect this case by noting that the
9365 -- prefix of the dereference is created by an object declaration whose
9366 -- initial expression is a reference.
9372 function Reference_To (Obj : Node_Id) return Node_Id is
9373 Pref : constant Node_Id := Prefix (Obj);
9375 if Is_Entity_Name (Pref)
9376 and then Nkind (Parent (Entity (Pref))) = N_Object_Declaration
9377 and then Present (Expression (Parent (Entity (Pref))))
9378 and then Nkind (Expression (Parent (Entity (Pref)))) = N_Reference
9380 return (Prefix (Expression (Parent (Entity (Pref)))));
9386 -- Start of processing for Object_Access_Level
9389 if Is_Entity_Name (Obj) then
9392 if Is_Prival (E) then
9393 E := Prival_Link (E);
9396 -- If E is a type then it denotes a current instance. For this case
9397 -- we add one to the normal accessibility level of the type to ensure
9398 -- that current instances are treated as always being deeper than
9399 -- than the level of any visible named access type (see 3.10.2(21)).
9402 return Type_Access_Level (E) + 1;
9404 elsif Present (Renamed_Object (E)) then
9405 return Object_Access_Level (Renamed_Object (E));
9407 -- Similarly, if E is a component of the current instance of a
9408 -- protected type, any instance of it is assumed to be at a deeper
9409 -- level than the type. For a protected object (whose type is an
9410 -- anonymous protected type) its components are at the same level
9411 -- as the type itself.
9413 elsif not Is_Overloadable (E)
9414 and then Ekind (Scope (E)) = E_Protected_Type
9415 and then Comes_From_Source (Scope (E))
9417 return Type_Access_Level (Scope (E)) + 1;
9420 return Scope_Depth (Enclosing_Dynamic_Scope (E));
9423 elsif Nkind (Obj) = N_Selected_Component then
9424 if Is_Access_Type (Etype (Prefix (Obj))) then
9425 return Type_Access_Level (Etype (Prefix (Obj)));
9427 return Object_Access_Level (Prefix (Obj));
9430 elsif Nkind (Obj) = N_Indexed_Component then
9431 if Is_Access_Type (Etype (Prefix (Obj))) then
9432 return Type_Access_Level (Etype (Prefix (Obj)));
9434 return Object_Access_Level (Prefix (Obj));
9437 elsif Nkind (Obj) = N_Explicit_Dereference then
9439 -- If the prefix is a selected access discriminant then we make a
9440 -- recursive call on the prefix, which will in turn check the level
9441 -- of the prefix object of the selected discriminant.
9443 if Nkind (Prefix (Obj)) = N_Selected_Component
9444 and then Ekind (Etype (Prefix (Obj))) = E_Anonymous_Access_Type
9446 Ekind (Entity (Selector_Name (Prefix (Obj)))) = E_Discriminant
9448 return Object_Access_Level (Prefix (Obj));
9450 elsif not (Comes_From_Source (Obj)) then
9452 Ref : constant Node_Id := Reference_To (Obj);
9454 if Present (Ref) then
9455 return Object_Access_Level (Ref);
9457 return Type_Access_Level (Etype (Prefix (Obj)));
9462 return Type_Access_Level (Etype (Prefix (Obj)));
9465 elsif Nkind (Obj) = N_Type_Conversion
9466 or else Nkind (Obj) = N_Unchecked_Type_Conversion
9468 return Object_Access_Level (Expression (Obj));
9470 -- Function results are objects, so we get either the access level of
9471 -- the function or, in the case of an indirect call, the level of the
9472 -- access-to-subprogram type.
9474 elsif Nkind (Obj) = N_Function_Call then
9475 if Is_Entity_Name (Name (Obj)) then
9476 return Subprogram_Access_Level (Entity (Name (Obj)));
9478 return Type_Access_Level (Etype (Prefix (Name (Obj))));
9481 -- For convenience we handle qualified expressions, even though
9482 -- they aren't technically object names.
9484 elsif Nkind (Obj) = N_Qualified_Expression then
9485 return Object_Access_Level (Expression (Obj));
9487 -- Otherwise return the scope level of Standard.
9488 -- (If there are cases that fall through
9489 -- to this point they will be treated as
9490 -- having global accessibility for now. ???)
9493 return Scope_Depth (Standard_Standard);
9495 end Object_Access_Level;
9497 -----------------------
9498 -- Private_Component --
9499 -----------------------
9501 function Private_Component (Type_Id : Entity_Id) return Entity_Id is
9502 Ancestor : constant Entity_Id := Base_Type (Type_Id);
9504 function Trace_Components
9506 Check : Boolean) return Entity_Id;
9507 -- Recursive function that does the work, and checks against circular
9508 -- definition for each subcomponent type.
9510 ----------------------
9511 -- Trace_Components --
9512 ----------------------
9514 function Trace_Components
9516 Check : Boolean) return Entity_Id
9518 Btype : constant Entity_Id := Base_Type (T);
9519 Component : Entity_Id;
9521 Candidate : Entity_Id := Empty;
9524 if Check and then Btype = Ancestor then
9525 Error_Msg_N ("circular type definition", Type_Id);
9529 if Is_Private_Type (Btype)
9530 and then not Is_Generic_Type (Btype)
9532 if Present (Full_View (Btype))
9533 and then Is_Record_Type (Full_View (Btype))
9534 and then not Is_Frozen (Btype)
9536 -- To indicate that the ancestor depends on a private type, the
9537 -- current Btype is sufficient. However, to check for circular
9538 -- definition we must recurse on the full view.
9540 Candidate := Trace_Components (Full_View (Btype), True);
9542 if Candidate = Any_Type then
9552 elsif Is_Array_Type (Btype) then
9553 return Trace_Components (Component_Type (Btype), True);
9555 elsif Is_Record_Type (Btype) then
9556 Component := First_Entity (Btype);
9557 while Present (Component) loop
9559 -- Skip anonymous types generated by constrained components
9561 if not Is_Type (Component) then
9562 P := Trace_Components (Etype (Component), True);
9565 if P = Any_Type then
9573 Next_Entity (Component);
9581 end Trace_Components;
9583 -- Start of processing for Private_Component
9586 return Trace_Components (Type_Id, False);
9587 end Private_Component;
9589 ---------------------------
9590 -- Primitive_Names_Match --
9591 ---------------------------
9593 function Primitive_Names_Match (E1, E2 : Entity_Id) return Boolean is
9595 function Non_Internal_Name (E : Entity_Id) return Name_Id;
9596 -- Given an internal name, returns the corresponding non-internal name
9598 ------------------------
9599 -- Non_Internal_Name --
9600 ------------------------
9602 function Non_Internal_Name (E : Entity_Id) return Name_Id is
9604 Get_Name_String (Chars (E));
9605 Name_Len := Name_Len - 1;
9607 end Non_Internal_Name;
9609 -- Start of processing for Primitive_Names_Match
9612 pragma Assert (Present (E1) and then Present (E2));
9614 return Chars (E1) = Chars (E2)
9616 (not Is_Internal_Name (Chars (E1))
9617 and then Is_Internal_Name (Chars (E2))
9618 and then Non_Internal_Name (E2) = Chars (E1))
9620 (not Is_Internal_Name (Chars (E2))
9621 and then Is_Internal_Name (Chars (E1))
9622 and then Non_Internal_Name (E1) = Chars (E2))
9624 (Is_Predefined_Dispatching_Operation (E1)
9625 and then Is_Predefined_Dispatching_Operation (E2)
9626 and then Same_TSS (E1, E2))
9628 (Is_Init_Proc (E1) and then Is_Init_Proc (E2));
9629 end Primitive_Names_Match;
9631 -----------------------
9632 -- Process_End_Label --
9633 -----------------------
9635 procedure Process_End_Label
9644 Label_Ref : Boolean;
9645 -- Set True if reference to end label itself is required
9648 -- Gets set to the operator symbol or identifier that references the
9649 -- entity Ent. For the child unit case, this is the identifier from the
9650 -- designator. For other cases, this is simply Endl.
9652 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id);
9653 -- N is an identifier node that appears as a parent unit reference in
9654 -- the case where Ent is a child unit. This procedure generates an
9655 -- appropriate cross-reference entry. E is the corresponding entity.
9657 -------------------------
9658 -- Generate_Parent_Ref --
9659 -------------------------
9661 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id) is
9663 -- If names do not match, something weird, skip reference
9665 if Chars (E) = Chars (N) then
9667 -- Generate the reference. We do NOT consider this as a reference
9668 -- for unreferenced symbol purposes.
9670 Generate_Reference (E, N, 'r', Set_Ref => False, Force => True);
9673 Style.Check_Identifier (N, E);
9676 end Generate_Parent_Ref;
9678 -- Start of processing for Process_End_Label
9681 -- If no node, ignore. This happens in some error situations, and
9682 -- also for some internally generated structures where no end label
9683 -- references are required in any case.
9689 -- Nothing to do if no End_Label, happens for internally generated
9690 -- constructs where we don't want an end label reference anyway. Also
9691 -- nothing to do if Endl is a string literal, which means there was
9692 -- some prior error (bad operator symbol)
9694 Endl := End_Label (N);
9696 if No (Endl) or else Nkind (Endl) = N_String_Literal then
9700 -- Reference node is not in extended main source unit
9702 if not In_Extended_Main_Source_Unit (N) then
9704 -- Generally we do not collect references except for the extended
9705 -- main source unit. The one exception is the 'e' entry for a
9706 -- package spec, where it is useful for a client to have the
9707 -- ending information to define scopes.
9715 -- For this case, we can ignore any parent references, but we
9716 -- need the package name itself for the 'e' entry.
9718 if Nkind (Endl) = N_Designator then
9719 Endl := Identifier (Endl);
9723 -- Reference is in extended main source unit
9728 -- For designator, generate references for the parent entries
9730 if Nkind (Endl) = N_Designator then
9732 -- Generate references for the prefix if the END line comes from
9733 -- source (otherwise we do not need these references) We climb the
9734 -- scope stack to find the expected entities.
9736 if Comes_From_Source (Endl) then
9738 Scop := Current_Scope;
9739 while Nkind (Nam) = N_Selected_Component loop
9740 Scop := Scope (Scop);
9741 exit when No (Scop);
9742 Generate_Parent_Ref (Selector_Name (Nam), Scop);
9743 Nam := Prefix (Nam);
9746 if Present (Scop) then
9747 Generate_Parent_Ref (Nam, Scope (Scop));
9751 Endl := Identifier (Endl);
9755 -- If the end label is not for the given entity, then either we have
9756 -- some previous error, or this is a generic instantiation for which
9757 -- we do not need to make a cross-reference in this case anyway. In
9758 -- either case we simply ignore the call.
9760 if Chars (Ent) /= Chars (Endl) then
9764 -- If label was really there, then generate a normal reference and then
9765 -- adjust the location in the end label to point past the name (which
9766 -- should almost always be the semicolon).
9770 if Comes_From_Source (Endl) then
9772 -- If a label reference is required, then do the style check and
9773 -- generate an l-type cross-reference entry for the label
9777 Style.Check_Identifier (Endl, Ent);
9780 Generate_Reference (Ent, Endl, 'l', Set_Ref => False);
9783 -- Set the location to point past the label (normally this will
9784 -- mean the semicolon immediately following the label). This is
9785 -- done for the sake of the 'e' or 't' entry generated below.
9787 Get_Decoded_Name_String (Chars (Endl));
9788 Set_Sloc (Endl, Sloc (Endl) + Source_Ptr (Name_Len));
9791 -- Now generate the e/t reference
9793 Generate_Reference (Ent, Endl, Typ, Set_Ref => False, Force => True);
9795 -- Restore Sloc, in case modified above, since we have an identifier
9796 -- and the normal Sloc should be left set in the tree.
9798 Set_Sloc (Endl, Loc);
9799 end Process_End_Label;
9805 -- We do the conversion to get the value of the real string by using
9806 -- the scanner, see Sinput for details on use of the internal source
9807 -- buffer for scanning internal strings.
9809 function Real_Convert (S : String) return Node_Id is
9810 Save_Src : constant Source_Buffer_Ptr := Source;
9814 Source := Internal_Source_Ptr;
9817 for J in S'Range loop
9818 Source (Source_Ptr (J)) := S (J);
9821 Source (S'Length + 1) := EOF;
9823 if Source (Scan_Ptr) = '-' then
9825 Scan_Ptr := Scan_Ptr + 1;
9833 Set_Realval (Token_Node, UR_Negate (Realval (Token_Node)));
9840 ------------------------------------
9841 -- References_Generic_Formal_Type --
9842 ------------------------------------
9844 function References_Generic_Formal_Type (N : Node_Id) return Boolean is
9846 function Process (N : Node_Id) return Traverse_Result;
9847 -- Process one node in search for generic formal type
9853 function Process (N : Node_Id) return Traverse_Result is
9855 if Nkind (N) in N_Has_Entity then
9857 E : constant Entity_Id := Entity (N);
9860 if Is_Generic_Type (E) then
9862 elsif Present (Etype (E))
9863 and then Is_Generic_Type (Etype (E))
9874 function Traverse is new Traverse_Func (Process);
9875 -- Traverse tree to look for generic type
9878 if Inside_A_Generic then
9879 return Traverse (N) = Abandon;
9883 end References_Generic_Formal_Type;
9885 --------------------
9886 -- Remove_Homonym --
9887 --------------------
9889 procedure Remove_Homonym (E : Entity_Id) is
9890 Prev : Entity_Id := Empty;
9894 if E = Current_Entity (E) then
9895 if Present (Homonym (E)) then
9896 Set_Current_Entity (Homonym (E));
9898 Set_Name_Entity_Id (Chars (E), Empty);
9901 H := Current_Entity (E);
9902 while Present (H) and then H /= E loop
9907 Set_Homonym (Prev, Homonym (E));
9911 ---------------------
9912 -- Rep_To_Pos_Flag --
9913 ---------------------
9915 function Rep_To_Pos_Flag (E : Entity_Id; Loc : Source_Ptr) return Node_Id is
9917 return New_Occurrence_Of
9918 (Boolean_Literals (not Range_Checks_Suppressed (E)), Loc);
9919 end Rep_To_Pos_Flag;
9921 --------------------
9922 -- Require_Entity --
9923 --------------------
9925 procedure Require_Entity (N : Node_Id) is
9927 if Is_Entity_Name (N) and then No (Entity (N)) then
9928 if Total_Errors_Detected /= 0 then
9929 Set_Entity (N, Any_Id);
9931 raise Program_Error;
9936 ------------------------------
9937 -- Requires_Transient_Scope --
9938 ------------------------------
9940 -- A transient scope is required when variable-sized temporaries are
9941 -- allocated in the primary or secondary stack, or when finalization
9942 -- actions must be generated before the next instruction.
9944 function Requires_Transient_Scope (Id : Entity_Id) return Boolean is
9945 Typ : constant Entity_Id := Underlying_Type (Id);
9947 -- Start of processing for Requires_Transient_Scope
9950 -- This is a private type which is not completed yet. This can only
9951 -- happen in a default expression (of a formal parameter or of a
9952 -- record component). Do not expand transient scope in this case
9957 -- Do not expand transient scope for non-existent procedure return
9959 elsif Typ = Standard_Void_Type then
9962 -- Elementary types do not require a transient scope
9964 elsif Is_Elementary_Type (Typ) then
9967 -- Generally, indefinite subtypes require a transient scope, since the
9968 -- back end cannot generate temporaries, since this is not a valid type
9969 -- for declaring an object. It might be possible to relax this in the
9970 -- future, e.g. by declaring the maximum possible space for the type.
9972 elsif Is_Indefinite_Subtype (Typ) then
9975 -- Functions returning tagged types may dispatch on result so their
9976 -- returned value is allocated on the secondary stack. Controlled
9977 -- type temporaries need finalization.
9979 elsif Is_Tagged_Type (Typ)
9980 or else Has_Controlled_Component (Typ)
9982 return not Is_Value_Type (Typ);
9986 elsif Is_Record_Type (Typ) then
9990 Comp := First_Entity (Typ);
9991 while Present (Comp) loop
9992 if Ekind (Comp) = E_Component
9993 and then Requires_Transient_Scope (Etype (Comp))
10004 -- String literal types never require transient scope
10006 elsif Ekind (Typ) = E_String_Literal_Subtype then
10009 -- Array type. Note that we already know that this is a constrained
10010 -- array, since unconstrained arrays will fail the indefinite test.
10012 elsif Is_Array_Type (Typ) then
10014 -- If component type requires a transient scope, the array does too
10016 if Requires_Transient_Scope (Component_Type (Typ)) then
10019 -- Otherwise, we only need a transient scope if the size is not
10020 -- known at compile time.
10023 return not Size_Known_At_Compile_Time (Typ);
10026 -- All other cases do not require a transient scope
10031 end Requires_Transient_Scope;
10033 --------------------------
10034 -- Reset_Analyzed_Flags --
10035 --------------------------
10037 procedure Reset_Analyzed_Flags (N : Node_Id) is
10039 function Clear_Analyzed (N : Node_Id) return Traverse_Result;
10040 -- Function used to reset Analyzed flags in tree. Note that we do
10041 -- not reset Analyzed flags in entities, since there is no need to
10042 -- reanalyze entities, and indeed, it is wrong to do so, since it
10043 -- can result in generating auxiliary stuff more than once.
10045 --------------------
10046 -- Clear_Analyzed --
10047 --------------------
10049 function Clear_Analyzed (N : Node_Id) return Traverse_Result is
10051 if not Has_Extension (N) then
10052 Set_Analyzed (N, False);
10056 end Clear_Analyzed;
10058 procedure Reset_Analyzed is new Traverse_Proc (Clear_Analyzed);
10060 -- Start of processing for Reset_Analyzed_Flags
10063 Reset_Analyzed (N);
10064 end Reset_Analyzed_Flags;
10066 ---------------------------
10067 -- Safe_To_Capture_Value --
10068 ---------------------------
10070 function Safe_To_Capture_Value
10073 Cond : Boolean := False) return Boolean
10076 -- The only entities for which we track constant values are variables
10077 -- which are not renamings, constants, out parameters, and in out
10078 -- parameters, so check if we have this case.
10080 -- Note: it may seem odd to track constant values for constants, but in
10081 -- fact this routine is used for other purposes than simply capturing
10082 -- the value. In particular, the setting of Known[_Non]_Null.
10084 if (Ekind (Ent) = E_Variable and then No (Renamed_Object (Ent)))
10086 Ekind (Ent) = E_Constant
10088 Ekind (Ent) = E_Out_Parameter
10090 Ekind (Ent) = E_In_Out_Parameter
10094 -- For conditionals, we also allow loop parameters and all formals,
10095 -- including in parameters.
10099 (Ekind (Ent) = E_Loop_Parameter
10101 Ekind (Ent) = E_In_Parameter)
10105 -- For all other cases, not just unsafe, but impossible to capture
10106 -- Current_Value, since the above are the only entities which have
10107 -- Current_Value fields.
10113 -- Skip if volatile or aliased, since funny things might be going on in
10114 -- these cases which we cannot necessarily track. Also skip any variable
10115 -- for which an address clause is given, or whose address is taken. Also
10116 -- never capture value of library level variables (an attempt to do so
10117 -- can occur in the case of package elaboration code).
10119 if Treat_As_Volatile (Ent)
10120 or else Is_Aliased (Ent)
10121 or else Present (Address_Clause (Ent))
10122 or else Address_Taken (Ent)
10123 or else (Is_Library_Level_Entity (Ent)
10124 and then Ekind (Ent) = E_Variable)
10129 -- OK, all above conditions are met. We also require that the scope of
10130 -- the reference be the same as the scope of the entity, not counting
10131 -- packages and blocks and loops.
10134 E_Scope : constant Entity_Id := Scope (Ent);
10135 R_Scope : Entity_Id;
10138 R_Scope := Current_Scope;
10139 while R_Scope /= Standard_Standard loop
10140 exit when R_Scope = E_Scope;
10142 if not Ekind_In (R_Scope, E_Package, E_Block, E_Loop) then
10145 R_Scope := Scope (R_Scope);
10150 -- We also require that the reference does not appear in a context
10151 -- where it is not sure to be executed (i.e. a conditional context
10152 -- or an exception handler). We skip this if Cond is True, since the
10153 -- capturing of values from conditional tests handles this ok.
10167 while Present (P) loop
10168 if Nkind (P) = N_If_Statement
10169 or else Nkind (P) = N_Case_Statement
10170 or else (Nkind (P) in N_Short_Circuit
10171 and then Desc = Right_Opnd (P))
10172 or else (Nkind (P) = N_Conditional_Expression
10173 and then Desc /= First (Expressions (P)))
10174 or else Nkind (P) = N_Exception_Handler
10175 or else Nkind (P) = N_Selective_Accept
10176 or else Nkind (P) = N_Conditional_Entry_Call
10177 or else Nkind (P) = N_Timed_Entry_Call
10178 or else Nkind (P) = N_Asynchronous_Select
10188 -- OK, looks safe to set value
10191 end Safe_To_Capture_Value;
10197 function Same_Name (N1, N2 : Node_Id) return Boolean is
10198 K1 : constant Node_Kind := Nkind (N1);
10199 K2 : constant Node_Kind := Nkind (N2);
10202 if (K1 = N_Identifier or else K1 = N_Defining_Identifier)
10203 and then (K2 = N_Identifier or else K2 = N_Defining_Identifier)
10205 return Chars (N1) = Chars (N2);
10207 elsif (K1 = N_Selected_Component or else K1 = N_Expanded_Name)
10208 and then (K2 = N_Selected_Component or else K2 = N_Expanded_Name)
10210 return Same_Name (Selector_Name (N1), Selector_Name (N2))
10211 and then Same_Name (Prefix (N1), Prefix (N2));
10222 function Same_Object (Node1, Node2 : Node_Id) return Boolean is
10223 N1 : constant Node_Id := Original_Node (Node1);
10224 N2 : constant Node_Id := Original_Node (Node2);
10225 -- We do the tests on original nodes, since we are most interested
10226 -- in the original source, not any expansion that got in the way.
10228 K1 : constant Node_Kind := Nkind (N1);
10229 K2 : constant Node_Kind := Nkind (N2);
10232 -- First case, both are entities with same entity
10234 if K1 in N_Has_Entity
10235 and then K2 in N_Has_Entity
10236 and then Present (Entity (N1))
10237 and then Present (Entity (N2))
10238 and then (Ekind (Entity (N1)) = E_Variable
10240 Ekind (Entity (N1)) = E_Constant)
10241 and then Entity (N1) = Entity (N2)
10245 -- Second case, selected component with same selector, same record
10247 elsif K1 = N_Selected_Component
10248 and then K2 = N_Selected_Component
10249 and then Chars (Selector_Name (N1)) = Chars (Selector_Name (N2))
10251 return Same_Object (Prefix (N1), Prefix (N2));
10253 -- Third case, indexed component with same subscripts, same array
10255 elsif K1 = N_Indexed_Component
10256 and then K2 = N_Indexed_Component
10257 and then Same_Object (Prefix (N1), Prefix (N2))
10262 E1 := First (Expressions (N1));
10263 E2 := First (Expressions (N2));
10264 while Present (E1) loop
10265 if not Same_Value (E1, E2) then
10276 -- Fourth case, slice of same array with same bounds
10279 and then K2 = N_Slice
10280 and then Nkind (Discrete_Range (N1)) = N_Range
10281 and then Nkind (Discrete_Range (N2)) = N_Range
10282 and then Same_Value (Low_Bound (Discrete_Range (N1)),
10283 Low_Bound (Discrete_Range (N2)))
10284 and then Same_Value (High_Bound (Discrete_Range (N1)),
10285 High_Bound (Discrete_Range (N2)))
10287 return Same_Name (Prefix (N1), Prefix (N2));
10289 -- All other cases, not clearly the same object
10300 function Same_Type (T1, T2 : Entity_Id) return Boolean is
10305 elsif not Is_Constrained (T1)
10306 and then not Is_Constrained (T2)
10307 and then Base_Type (T1) = Base_Type (T2)
10311 -- For now don't bother with case of identical constraints, to be
10312 -- fiddled with later on perhaps (this is only used for optimization
10313 -- purposes, so it is not critical to do a best possible job)
10324 function Same_Value (Node1, Node2 : Node_Id) return Boolean is
10326 if Compile_Time_Known_Value (Node1)
10327 and then Compile_Time_Known_Value (Node2)
10328 and then Expr_Value (Node1) = Expr_Value (Node2)
10331 elsif Same_Object (Node1, Node2) then
10338 ------------------------
10339 -- Scope_Is_Transient --
10340 ------------------------
10342 function Scope_Is_Transient return Boolean is
10344 return Scope_Stack.Table (Scope_Stack.Last).Is_Transient;
10345 end Scope_Is_Transient;
10351 function Scope_Within (Scope1, Scope2 : Entity_Id) return Boolean is
10356 while Scop /= Standard_Standard loop
10357 Scop := Scope (Scop);
10359 if Scop = Scope2 then
10367 --------------------------
10368 -- Scope_Within_Or_Same --
10369 --------------------------
10371 function Scope_Within_Or_Same (Scope1, Scope2 : Entity_Id) return Boolean is
10376 while Scop /= Standard_Standard loop
10377 if Scop = Scope2 then
10380 Scop := Scope (Scop);
10385 end Scope_Within_Or_Same;
10387 --------------------
10388 -- Set_Convention --
10389 --------------------
10391 procedure Set_Convention (E : Entity_Id; Val : Snames.Convention_Id) is
10393 Basic_Set_Convention (E, Val);
10396 and then Is_Access_Subprogram_Type (Base_Type (E))
10397 and then Has_Foreign_Convention (E)
10399 Set_Can_Use_Internal_Rep (E, False);
10401 end Set_Convention;
10403 ------------------------
10404 -- Set_Current_Entity --
10405 ------------------------
10407 -- The given entity is to be set as the currently visible definition
10408 -- of its associated name (i.e. the Node_Id associated with its name).
10409 -- All we have to do is to get the name from the identifier, and
10410 -- then set the associated Node_Id to point to the given entity.
10412 procedure Set_Current_Entity (E : Entity_Id) is
10414 Set_Name_Entity_Id (Chars (E), E);
10415 end Set_Current_Entity;
10417 ---------------------------
10418 -- Set_Debug_Info_Needed --
10419 ---------------------------
10421 procedure Set_Debug_Info_Needed (T : Entity_Id) is
10423 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id);
10424 pragma Inline (Set_Debug_Info_Needed_If_Not_Set);
10425 -- Used to set debug info in a related node if not set already
10427 --------------------------------------
10428 -- Set_Debug_Info_Needed_If_Not_Set --
10429 --------------------------------------
10431 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id) is
10434 and then not Needs_Debug_Info (E)
10436 Set_Debug_Info_Needed (E);
10438 -- For a private type, indicate that the full view also needs
10439 -- debug information.
10442 and then Is_Private_Type (E)
10443 and then Present (Full_View (E))
10445 Set_Debug_Info_Needed (Full_View (E));
10448 end Set_Debug_Info_Needed_If_Not_Set;
10450 -- Start of processing for Set_Debug_Info_Needed
10453 -- Nothing to do if argument is Empty or has Debug_Info_Off set, which
10454 -- indicates that Debug_Info_Needed is never required for the entity.
10457 or else Debug_Info_Off (T)
10462 -- Set flag in entity itself. Note that we will go through the following
10463 -- circuitry even if the flag is already set on T. That's intentional,
10464 -- it makes sure that the flag will be set in subsidiary entities.
10466 Set_Needs_Debug_Info (T);
10468 -- Set flag on subsidiary entities if not set already
10470 if Is_Object (T) then
10471 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
10473 elsif Is_Type (T) then
10474 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
10476 if Is_Record_Type (T) then
10478 Ent : Entity_Id := First_Entity (T);
10480 while Present (Ent) loop
10481 Set_Debug_Info_Needed_If_Not_Set (Ent);
10486 -- For a class wide subtype, we also need debug information
10487 -- for the equivalent type.
10489 if Ekind (T) = E_Class_Wide_Subtype then
10490 Set_Debug_Info_Needed_If_Not_Set (Equivalent_Type (T));
10493 elsif Is_Array_Type (T) then
10494 Set_Debug_Info_Needed_If_Not_Set (Component_Type (T));
10497 Indx : Node_Id := First_Index (T);
10499 while Present (Indx) loop
10500 Set_Debug_Info_Needed_If_Not_Set (Etype (Indx));
10501 Indx := Next_Index (Indx);
10505 if Is_Packed (T) then
10506 Set_Debug_Info_Needed_If_Not_Set (Packed_Array_Type (T));
10509 elsif Is_Access_Type (T) then
10510 Set_Debug_Info_Needed_If_Not_Set (Directly_Designated_Type (T));
10512 elsif Is_Private_Type (T) then
10513 Set_Debug_Info_Needed_If_Not_Set (Full_View (T));
10515 elsif Is_Protected_Type (T) then
10516 Set_Debug_Info_Needed_If_Not_Set (Corresponding_Record_Type (T));
10519 end Set_Debug_Info_Needed;
10521 ---------------------------------
10522 -- Set_Entity_With_Style_Check --
10523 ---------------------------------
10525 procedure Set_Entity_With_Style_Check (N : Node_Id; Val : Entity_Id) is
10526 Val_Actual : Entity_Id;
10530 Set_Entity (N, Val);
10533 and then not Suppress_Style_Checks (Val)
10534 and then not In_Instance
10536 if Nkind (N) = N_Identifier then
10538 elsif Nkind (N) = N_Expanded_Name then
10539 Nod := Selector_Name (N);
10544 -- A special situation arises for derived operations, where we want
10545 -- to do the check against the parent (since the Sloc of the derived
10546 -- operation points to the derived type declaration itself).
10549 while not Comes_From_Source (Val_Actual)
10550 and then Nkind (Val_Actual) in N_Entity
10551 and then (Ekind (Val_Actual) = E_Enumeration_Literal
10552 or else Is_Subprogram (Val_Actual)
10553 or else Is_Generic_Subprogram (Val_Actual))
10554 and then Present (Alias (Val_Actual))
10556 Val_Actual := Alias (Val_Actual);
10559 -- Renaming declarations for generic actuals do not come from source,
10560 -- and have a different name from that of the entity they rename, so
10561 -- there is no style check to perform here.
10563 if Chars (Nod) = Chars (Val_Actual) then
10564 Style.Check_Identifier (Nod, Val_Actual);
10568 Set_Entity (N, Val);
10569 end Set_Entity_With_Style_Check;
10571 ------------------------
10572 -- Set_Name_Entity_Id --
10573 ------------------------
10575 procedure Set_Name_Entity_Id (Id : Name_Id; Val : Entity_Id) is
10577 Set_Name_Table_Info (Id, Int (Val));
10578 end Set_Name_Entity_Id;
10580 ---------------------
10581 -- Set_Next_Actual --
10582 ---------------------
10584 procedure Set_Next_Actual (Ass1_Id : Node_Id; Ass2_Id : Node_Id) is
10586 if Nkind (Parent (Ass1_Id)) = N_Parameter_Association then
10587 Set_First_Named_Actual (Parent (Ass1_Id), Ass2_Id);
10589 end Set_Next_Actual;
10591 ----------------------------------
10592 -- Set_Optimize_Alignment_Flags --
10593 ----------------------------------
10595 procedure Set_Optimize_Alignment_Flags (E : Entity_Id) is
10597 if Optimize_Alignment = 'S' then
10598 Set_Optimize_Alignment_Space (E);
10599 elsif Optimize_Alignment = 'T' then
10600 Set_Optimize_Alignment_Time (E);
10602 end Set_Optimize_Alignment_Flags;
10604 -----------------------
10605 -- Set_Public_Status --
10606 -----------------------
10608 procedure Set_Public_Status (Id : Entity_Id) is
10609 S : constant Entity_Id := Current_Scope;
10611 function Within_HSS_Or_If (E : Entity_Id) return Boolean;
10612 -- Determines if E is defined within handled statement sequence or
10613 -- an if statement, returns True if so, False otherwise.
10615 ----------------------
10616 -- Within_HSS_Or_If --
10617 ----------------------
10619 function Within_HSS_Or_If (E : Entity_Id) return Boolean is
10622 N := Declaration_Node (E);
10629 elsif Nkind_In (N, N_Handled_Sequence_Of_Statements,
10635 end Within_HSS_Or_If;
10637 -- Start of processing for Set_Public_Status
10640 -- Everything in the scope of Standard is public
10642 if S = Standard_Standard then
10643 Set_Is_Public (Id);
10645 -- Entity is definitely not public if enclosing scope is not public
10647 elsif not Is_Public (S) then
10650 -- An object or function declaration that occurs in a handled sequence
10651 -- of statements or within an if statement is the declaration for a
10652 -- temporary object or local subprogram generated by the expander. It
10653 -- never needs to be made public and furthermore, making it public can
10654 -- cause back end problems.
10656 elsif Nkind_In (Parent (Id), N_Object_Declaration,
10657 N_Function_Specification)
10658 and then Within_HSS_Or_If (Id)
10662 -- Entities in public packages or records are public
10664 elsif Ekind (S) = E_Package or Is_Record_Type (S) then
10665 Set_Is_Public (Id);
10667 -- The bounds of an entry family declaration can generate object
10668 -- declarations that are visible to the back-end, e.g. in the
10669 -- the declaration of a composite type that contains tasks.
10671 elsif Is_Concurrent_Type (S)
10672 and then not Has_Completion (S)
10673 and then Nkind (Parent (Id)) = N_Object_Declaration
10675 Set_Is_Public (Id);
10677 end Set_Public_Status;
10679 -----------------------------
10680 -- Set_Referenced_Modified --
10681 -----------------------------
10683 procedure Set_Referenced_Modified (N : Node_Id; Out_Param : Boolean) is
10687 -- Deal with indexed or selected component where prefix is modified
10689 if Nkind_In (N, N_Indexed_Component, N_Selected_Component) then
10690 Pref := Prefix (N);
10692 -- If prefix is access type, then it is the designated object that is
10693 -- being modified, which means we have no entity to set the flag on.
10695 if No (Etype (Pref)) or else Is_Access_Type (Etype (Pref)) then
10698 -- Otherwise chase the prefix
10701 Set_Referenced_Modified (Pref, Out_Param);
10704 -- Otherwise see if we have an entity name (only other case to process)
10706 elsif Is_Entity_Name (N) and then Present (Entity (N)) then
10707 Set_Referenced_As_LHS (Entity (N), not Out_Param);
10708 Set_Referenced_As_Out_Parameter (Entity (N), Out_Param);
10710 end Set_Referenced_Modified;
10712 ----------------------------
10713 -- Set_Scope_Is_Transient --
10714 ----------------------------
10716 procedure Set_Scope_Is_Transient (V : Boolean := True) is
10718 Scope_Stack.Table (Scope_Stack.Last).Is_Transient := V;
10719 end Set_Scope_Is_Transient;
10721 -------------------
10722 -- Set_Size_Info --
10723 -------------------
10725 procedure Set_Size_Info (T1, T2 : Entity_Id) is
10727 -- We copy Esize, but not RM_Size, since in general RM_Size is
10728 -- subtype specific and does not get inherited by all subtypes.
10730 Set_Esize (T1, Esize (T2));
10731 Set_Has_Biased_Representation (T1, Has_Biased_Representation (T2));
10733 if Is_Discrete_Or_Fixed_Point_Type (T1)
10735 Is_Discrete_Or_Fixed_Point_Type (T2)
10737 Set_Is_Unsigned_Type (T1, Is_Unsigned_Type (T2));
10740 Set_Alignment (T1, Alignment (T2));
10743 --------------------
10744 -- Static_Integer --
10745 --------------------
10747 function Static_Integer (N : Node_Id) return Uint is
10749 Analyze_And_Resolve (N, Any_Integer);
10752 or else Error_Posted (N)
10753 or else Etype (N) = Any_Type
10758 if Is_Static_Expression (N) then
10759 if not Raises_Constraint_Error (N) then
10760 return Expr_Value (N);
10765 elsif Etype (N) = Any_Type then
10769 Flag_Non_Static_Expr
10770 ("static integer expression required here", N);
10773 end Static_Integer;
10775 --------------------------
10776 -- Statically_Different --
10777 --------------------------
10779 function Statically_Different (E1, E2 : Node_Id) return Boolean is
10780 R1 : constant Node_Id := Get_Referenced_Object (E1);
10781 R2 : constant Node_Id := Get_Referenced_Object (E2);
10783 return Is_Entity_Name (R1)
10784 and then Is_Entity_Name (R2)
10785 and then Entity (R1) /= Entity (R2)
10786 and then not Is_Formal (Entity (R1))
10787 and then not Is_Formal (Entity (R2));
10788 end Statically_Different;
10790 -----------------------------
10791 -- Subprogram_Access_Level --
10792 -----------------------------
10794 function Subprogram_Access_Level (Subp : Entity_Id) return Uint is
10796 if Present (Alias (Subp)) then
10797 return Subprogram_Access_Level (Alias (Subp));
10799 return Scope_Depth (Enclosing_Dynamic_Scope (Subp));
10801 end Subprogram_Access_Level;
10807 procedure Trace_Scope (N : Node_Id; E : Entity_Id; Msg : String) is
10809 if Debug_Flag_W then
10810 for J in 0 .. Scope_Stack.Last loop
10815 Write_Name (Chars (E));
10816 Write_Str (" from ");
10817 Write_Location (Sloc (N));
10822 -----------------------
10823 -- Transfer_Entities --
10824 -----------------------
10826 procedure Transfer_Entities (From : Entity_Id; To : Entity_Id) is
10827 Ent : Entity_Id := First_Entity (From);
10834 if (Last_Entity (To)) = Empty then
10835 Set_First_Entity (To, Ent);
10837 Set_Next_Entity (Last_Entity (To), Ent);
10840 Set_Last_Entity (To, Last_Entity (From));
10842 while Present (Ent) loop
10843 Set_Scope (Ent, To);
10845 if not Is_Public (Ent) then
10846 Set_Public_Status (Ent);
10849 and then Ekind (Ent) = E_Record_Subtype
10852 -- The components of the propagated Itype must be public
10858 Comp := First_Entity (Ent);
10859 while Present (Comp) loop
10860 Set_Is_Public (Comp);
10861 Next_Entity (Comp);
10870 Set_First_Entity (From, Empty);
10871 Set_Last_Entity (From, Empty);
10872 end Transfer_Entities;
10874 -----------------------
10875 -- Type_Access_Level --
10876 -----------------------
10878 function Type_Access_Level (Typ : Entity_Id) return Uint is
10882 Btyp := Base_Type (Typ);
10884 -- Ada 2005 (AI-230): For most cases of anonymous access types, we
10885 -- simply use the level where the type is declared. This is true for
10886 -- stand-alone object declarations, and for anonymous access types
10887 -- associated with components the level is the same as that of the
10888 -- enclosing composite type. However, special treatment is needed for
10889 -- the cases of access parameters, return objects of an anonymous access
10890 -- type, and, in Ada 95, access discriminants of limited types.
10892 if Ekind (Btyp) in Access_Kind then
10893 if Ekind (Btyp) = E_Anonymous_Access_Type then
10895 -- If the type is a nonlocal anonymous access type (such as for
10896 -- an access parameter) we treat it as being declared at the
10897 -- library level to ensure that names such as X.all'access don't
10898 -- fail static accessibility checks.
10900 if not Is_Local_Anonymous_Access (Typ) then
10901 return Scope_Depth (Standard_Standard);
10903 -- If this is a return object, the accessibility level is that of
10904 -- the result subtype of the enclosing function. The test here is
10905 -- little complicated, because we have to account for extended
10906 -- return statements that have been rewritten as blocks, in which
10907 -- case we have to find and the Is_Return_Object attribute of the
10908 -- itype's associated object. It would be nice to find a way to
10909 -- simplify this test, but it doesn't seem worthwhile to add a new
10910 -- flag just for purposes of this test. ???
10912 elsif Ekind (Scope (Btyp)) = E_Return_Statement
10915 and then Nkind (Associated_Node_For_Itype (Btyp)) =
10916 N_Object_Declaration
10917 and then Is_Return_Object
10918 (Defining_Identifier
10919 (Associated_Node_For_Itype (Btyp))))
10925 Scop := Scope (Scope (Btyp));
10926 while Present (Scop) loop
10927 exit when Ekind (Scop) = E_Function;
10928 Scop := Scope (Scop);
10931 -- Treat the return object's type as having the level of the
10932 -- function's result subtype (as per RM05-6.5(5.3/2)).
10934 return Type_Access_Level (Etype (Scop));
10939 Btyp := Root_Type (Btyp);
10941 -- The accessibility level of anonymous access types associated with
10942 -- discriminants is that of the current instance of the type, and
10943 -- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
10945 -- AI-402: access discriminants have accessibility based on the
10946 -- object rather than the type in Ada 2005, so the above paragraph
10949 -- ??? Needs completion with rules from AI-416
10951 if Ada_Version <= Ada_95
10952 and then Ekind (Typ) = E_Anonymous_Access_Type
10953 and then Present (Associated_Node_For_Itype (Typ))
10954 and then Nkind (Associated_Node_For_Itype (Typ)) =
10955 N_Discriminant_Specification
10957 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp)) + 1;
10961 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
10962 end Type_Access_Level;
10964 --------------------
10965 -- Ultimate_Alias --
10966 --------------------
10967 -- To do: add occurrences calling this new subprogram
10969 function Ultimate_Alias (Prim : Entity_Id) return Entity_Id is
10970 E : Entity_Id := Prim;
10973 while Present (Alias (E)) loop
10978 end Ultimate_Alias;
10980 --------------------------
10981 -- Unit_Declaration_Node --
10982 --------------------------
10984 function Unit_Declaration_Node (Unit_Id : Entity_Id) return Node_Id is
10985 N : Node_Id := Parent (Unit_Id);
10988 -- Predefined operators do not have a full function declaration
10990 if Ekind (Unit_Id) = E_Operator then
10994 -- Isn't there some better way to express the following ???
10996 while Nkind (N) /= N_Abstract_Subprogram_Declaration
10997 and then Nkind (N) /= N_Formal_Package_Declaration
10998 and then Nkind (N) /= N_Function_Instantiation
10999 and then Nkind (N) /= N_Generic_Package_Declaration
11000 and then Nkind (N) /= N_Generic_Subprogram_Declaration
11001 and then Nkind (N) /= N_Package_Declaration
11002 and then Nkind (N) /= N_Package_Body
11003 and then Nkind (N) /= N_Package_Instantiation
11004 and then Nkind (N) /= N_Package_Renaming_Declaration
11005 and then Nkind (N) /= N_Procedure_Instantiation
11006 and then Nkind (N) /= N_Protected_Body
11007 and then Nkind (N) /= N_Subprogram_Declaration
11008 and then Nkind (N) /= N_Subprogram_Body
11009 and then Nkind (N) /= N_Subprogram_Body_Stub
11010 and then Nkind (N) /= N_Subprogram_Renaming_Declaration
11011 and then Nkind (N) /= N_Task_Body
11012 and then Nkind (N) /= N_Task_Type_Declaration
11013 and then Nkind (N) not in N_Formal_Subprogram_Declaration
11014 and then Nkind (N) not in N_Generic_Renaming_Declaration
11017 pragma Assert (Present (N));
11021 end Unit_Declaration_Node;
11023 ------------------------------
11024 -- Universal_Interpretation --
11025 ------------------------------
11027 function Universal_Interpretation (Opnd : Node_Id) return Entity_Id is
11028 Index : Interp_Index;
11032 -- The argument may be a formal parameter of an operator or subprogram
11033 -- with multiple interpretations, or else an expression for an actual.
11035 if Nkind (Opnd) = N_Defining_Identifier
11036 or else not Is_Overloaded (Opnd)
11038 if Etype (Opnd) = Universal_Integer
11039 or else Etype (Opnd) = Universal_Real
11041 return Etype (Opnd);
11047 Get_First_Interp (Opnd, Index, It);
11048 while Present (It.Typ) loop
11049 if It.Typ = Universal_Integer
11050 or else It.Typ = Universal_Real
11055 Get_Next_Interp (Index, It);
11060 end Universal_Interpretation;
11066 function Unqualify (Expr : Node_Id) return Node_Id is
11068 -- Recurse to handle unlikely case of multiple levels of qualification
11070 if Nkind (Expr) = N_Qualified_Expression then
11071 return Unqualify (Expression (Expr));
11073 -- Normal case, not a qualified expression
11080 ----------------------
11081 -- Within_Init_Proc --
11082 ----------------------
11084 function Within_Init_Proc return Boolean is
11088 S := Current_Scope;
11089 while not Is_Overloadable (S) loop
11090 if S = Standard_Standard then
11097 return Is_Init_Proc (S);
11098 end Within_Init_Proc;
11104 procedure Wrong_Type (Expr : Node_Id; Expected_Type : Entity_Id) is
11105 Found_Type : constant Entity_Id := First_Subtype (Etype (Expr));
11106 Expec_Type : constant Entity_Id := First_Subtype (Expected_Type);
11108 function Has_One_Matching_Field return Boolean;
11109 -- Determines if Expec_Type is a record type with a single component or
11110 -- discriminant whose type matches the found type or is one dimensional
11111 -- array whose component type matches the found type.
11113 ----------------------------
11114 -- Has_One_Matching_Field --
11115 ----------------------------
11117 function Has_One_Matching_Field return Boolean is
11121 if Is_Array_Type (Expec_Type)
11122 and then Number_Dimensions (Expec_Type) = 1
11124 Covers (Etype (Component_Type (Expec_Type)), Found_Type)
11128 elsif not Is_Record_Type (Expec_Type) then
11132 E := First_Entity (Expec_Type);
11137 elsif (Ekind (E) /= E_Discriminant
11138 and then Ekind (E) /= E_Component)
11139 or else (Chars (E) = Name_uTag
11140 or else Chars (E) = Name_uParent)
11149 if not Covers (Etype (E), Found_Type) then
11152 elsif Present (Next_Entity (E)) then
11159 end Has_One_Matching_Field;
11161 -- Start of processing for Wrong_Type
11164 -- Don't output message if either type is Any_Type, or if a message
11165 -- has already been posted for this node. We need to do the latter
11166 -- check explicitly (it is ordinarily done in Errout), because we
11167 -- are using ! to force the output of the error messages.
11169 if Expec_Type = Any_Type
11170 or else Found_Type = Any_Type
11171 or else Error_Posted (Expr)
11175 -- In an instance, there is an ongoing problem with completion of
11176 -- type derived from private types. Their structure is what Gigi
11177 -- expects, but the Etype is the parent type rather than the
11178 -- derived private type itself. Do not flag error in this case. The
11179 -- private completion is an entity without a parent, like an Itype.
11180 -- Similarly, full and partial views may be incorrect in the instance.
11181 -- There is no simple way to insure that it is consistent ???
11183 elsif In_Instance then
11184 if Etype (Etype (Expr)) = Etype (Expected_Type)
11186 (Has_Private_Declaration (Expected_Type)
11187 or else Has_Private_Declaration (Etype (Expr)))
11188 and then No (Parent (Expected_Type))
11194 -- An interesting special check. If the expression is parenthesized
11195 -- and its type corresponds to the type of the sole component of the
11196 -- expected record type, or to the component type of the expected one
11197 -- dimensional array type, then assume we have a bad aggregate attempt.
11199 if Nkind (Expr) in N_Subexpr
11200 and then Paren_Count (Expr) /= 0
11201 and then Has_One_Matching_Field
11203 Error_Msg_N ("positional aggregate cannot have one component", Expr);
11205 -- Another special check, if we are looking for a pool-specific access
11206 -- type and we found an E_Access_Attribute_Type, then we have the case
11207 -- of an Access attribute being used in a context which needs a pool-
11208 -- specific type, which is never allowed. The one extra check we make
11209 -- is that the expected designated type covers the Found_Type.
11211 elsif Is_Access_Type (Expec_Type)
11212 and then Ekind (Found_Type) = E_Access_Attribute_Type
11213 and then Ekind (Base_Type (Expec_Type)) /= E_General_Access_Type
11214 and then Ekind (Base_Type (Expec_Type)) /= E_Anonymous_Access_Type
11216 (Designated_Type (Expec_Type), Designated_Type (Found_Type))
11218 Error_Msg_N ("result must be general access type!", Expr);
11219 Error_Msg_NE ("add ALL to }!", Expr, Expec_Type);
11221 -- Another special check, if the expected type is an integer type,
11222 -- but the expression is of type System.Address, and the parent is
11223 -- an addition or subtraction operation whose left operand is the
11224 -- expression in question and whose right operand is of an integral
11225 -- type, then this is an attempt at address arithmetic, so give
11226 -- appropriate message.
11228 elsif Is_Integer_Type (Expec_Type)
11229 and then Is_RTE (Found_Type, RE_Address)
11230 and then (Nkind (Parent (Expr)) = N_Op_Add
11232 Nkind (Parent (Expr)) = N_Op_Subtract)
11233 and then Expr = Left_Opnd (Parent (Expr))
11234 and then Is_Integer_Type (Etype (Right_Opnd (Parent (Expr))))
11237 ("address arithmetic not predefined in package System",
11240 ("\possible missing with/use of System.Storage_Elements",
11244 -- If the expected type is an anonymous access type, as for access
11245 -- parameters and discriminants, the error is on the designated types.
11247 elsif Ekind (Expec_Type) = E_Anonymous_Access_Type then
11248 if Comes_From_Source (Expec_Type) then
11249 Error_Msg_NE ("expected}!", Expr, Expec_Type);
11252 ("expected an access type with designated}",
11253 Expr, Designated_Type (Expec_Type));
11256 if Is_Access_Type (Found_Type)
11257 and then not Comes_From_Source (Found_Type)
11260 ("\\found an access type with designated}!",
11261 Expr, Designated_Type (Found_Type));
11263 if From_With_Type (Found_Type) then
11264 Error_Msg_NE ("\\found incomplete}!", Expr, Found_Type);
11265 Error_Msg_Qual_Level := 99;
11266 Error_Msg_NE ("\\missing `WITH &;", Expr, Scope (Found_Type));
11267 Error_Msg_Qual_Level := 0;
11269 Error_Msg_NE ("found}!", Expr, Found_Type);
11273 -- Normal case of one type found, some other type expected
11276 -- If the names of the two types are the same, see if some number
11277 -- of levels of qualification will help. Don't try more than three
11278 -- levels, and if we get to standard, it's no use (and probably
11279 -- represents an error in the compiler) Also do not bother with
11280 -- internal scope names.
11283 Expec_Scope : Entity_Id;
11284 Found_Scope : Entity_Id;
11287 Expec_Scope := Expec_Type;
11288 Found_Scope := Found_Type;
11290 for Levels in Int range 0 .. 3 loop
11291 if Chars (Expec_Scope) /= Chars (Found_Scope) then
11292 Error_Msg_Qual_Level := Levels;
11296 Expec_Scope := Scope (Expec_Scope);
11297 Found_Scope := Scope (Found_Scope);
11299 exit when Expec_Scope = Standard_Standard
11300 or else Found_Scope = Standard_Standard
11301 or else not Comes_From_Source (Expec_Scope)
11302 or else not Comes_From_Source (Found_Scope);
11306 if Is_Record_Type (Expec_Type)
11307 and then Present (Corresponding_Remote_Type (Expec_Type))
11309 Error_Msg_NE ("expected}!", Expr,
11310 Corresponding_Remote_Type (Expec_Type));
11312 Error_Msg_NE ("expected}!", Expr, Expec_Type);
11315 if Is_Entity_Name (Expr)
11316 and then Is_Package_Or_Generic_Package (Entity (Expr))
11318 Error_Msg_N ("\\found package name!", Expr);
11320 elsif Is_Entity_Name (Expr)
11322 (Ekind (Entity (Expr)) = E_Procedure
11324 Ekind (Entity (Expr)) = E_Generic_Procedure)
11326 if Ekind (Expec_Type) = E_Access_Subprogram_Type then
11328 ("found procedure name, possibly missing Access attribute!",
11332 ("\\found procedure name instead of function!", Expr);
11335 elsif Nkind (Expr) = N_Function_Call
11336 and then Ekind (Expec_Type) = E_Access_Subprogram_Type
11337 and then Etype (Designated_Type (Expec_Type)) = Etype (Expr)
11338 and then No (Parameter_Associations (Expr))
11341 ("found function name, possibly missing Access attribute!",
11344 -- Catch common error: a prefix or infix operator which is not
11345 -- directly visible because the type isn't.
11347 elsif Nkind (Expr) in N_Op
11348 and then Is_Overloaded (Expr)
11349 and then not Is_Immediately_Visible (Expec_Type)
11350 and then not Is_Potentially_Use_Visible (Expec_Type)
11351 and then not In_Use (Expec_Type)
11352 and then Has_Compatible_Type (Right_Opnd (Expr), Expec_Type)
11355 ("operator of the type is not directly visible!", Expr);
11357 elsif Ekind (Found_Type) = E_Void
11358 and then Present (Parent (Found_Type))
11359 and then Nkind (Parent (Found_Type)) = N_Full_Type_Declaration
11361 Error_Msg_NE ("\\found premature usage of}!", Expr, Found_Type);
11364 Error_Msg_NE ("\\found}!", Expr, Found_Type);
11367 -- A special check for cases like M1 and M2 = 0 where M1 and M2 are
11368 -- of the same modular type, and (M1 and M2) = 0 was intended.
11370 if Expec_Type = Standard_Boolean
11371 and then Is_Modular_Integer_Type (Found_Type)
11372 and then Nkind_In (Parent (Expr), N_Op_And, N_Op_Or, N_Op_Xor)
11373 and then Nkind (Right_Opnd (Parent (Expr))) in N_Op_Compare
11376 Op : constant Node_Id := Right_Opnd (Parent (Expr));
11377 L : constant Node_Id := Left_Opnd (Op);
11378 R : constant Node_Id := Right_Opnd (Op);
11380 -- The case for the message is when the left operand of the
11381 -- comparison is the same modular type, or when it is an
11382 -- integer literal (or other universal integer expression),
11383 -- which would have been typed as the modular type if the
11384 -- parens had been there.
11386 if (Etype (L) = Found_Type
11388 Etype (L) = Universal_Integer)
11389 and then Is_Integer_Type (Etype (R))
11392 ("\\possible missing parens for modular operation", Expr);
11397 -- Reset error message qualification indication
11399 Error_Msg_Qual_Level := 0;