1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2010, 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);
401 Subt := Make_Temporary (Loc, 'S');
402 Set_Is_Internal (Subt);
405 Make_Subtype_Declaration (Loc,
406 Defining_Identifier => Subt,
407 Subtype_Indication =>
408 Make_Subtype_Indication (Loc,
409 Subtype_Mark => New_Reference_To (T, Loc),
411 Make_Index_Or_Discriminant_Constraint (Loc,
412 Constraints => Constraints)));
414 Mark_Rewrite_Insertion (Decl);
416 end Build_Actual_Subtype;
418 ---------------------------------------
419 -- Build_Actual_Subtype_Of_Component --
420 ---------------------------------------
422 function Build_Actual_Subtype_Of_Component
424 N : Node_Id) return Node_Id
426 Loc : constant Source_Ptr := Sloc (N);
427 P : constant Node_Id := Prefix (N);
430 Indx_Type : Entity_Id;
432 Deaccessed_T : Entity_Id;
433 -- This is either a copy of T, or if T is an access type, then it is
434 -- the directly designated type of this access type.
436 function Build_Actual_Array_Constraint return List_Id;
437 -- If one or more of the bounds of the component depends on
438 -- discriminants, build actual constraint using the discriminants
441 function Build_Actual_Record_Constraint return List_Id;
442 -- Similar to previous one, for discriminated components constrained
443 -- by the discriminant of the enclosing object.
445 -----------------------------------
446 -- Build_Actual_Array_Constraint --
447 -----------------------------------
449 function Build_Actual_Array_Constraint return List_Id is
450 Constraints : constant List_Id := New_List;
458 Indx := First_Index (Deaccessed_T);
459 while Present (Indx) loop
460 Old_Lo := Type_Low_Bound (Etype (Indx));
461 Old_Hi := Type_High_Bound (Etype (Indx));
463 if Denotes_Discriminant (Old_Lo) then
465 Make_Selected_Component (Loc,
466 Prefix => New_Copy_Tree (P),
467 Selector_Name => New_Occurrence_Of (Entity (Old_Lo), Loc));
470 Lo := New_Copy_Tree (Old_Lo);
472 -- The new bound will be reanalyzed in the enclosing
473 -- declaration. For literal bounds that come from a type
474 -- declaration, the type of the context must be imposed, so
475 -- insure that analysis will take place. For non-universal
476 -- types this is not strictly necessary.
478 Set_Analyzed (Lo, False);
481 if Denotes_Discriminant (Old_Hi) then
483 Make_Selected_Component (Loc,
484 Prefix => New_Copy_Tree (P),
485 Selector_Name => New_Occurrence_Of (Entity (Old_Hi), Loc));
488 Hi := New_Copy_Tree (Old_Hi);
489 Set_Analyzed (Hi, False);
492 Append (Make_Range (Loc, Lo, Hi), Constraints);
497 end Build_Actual_Array_Constraint;
499 ------------------------------------
500 -- Build_Actual_Record_Constraint --
501 ------------------------------------
503 function Build_Actual_Record_Constraint return List_Id is
504 Constraints : constant List_Id := New_List;
509 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
510 while Present (D) loop
511 if Denotes_Discriminant (Node (D)) then
512 D_Val := Make_Selected_Component (Loc,
513 Prefix => New_Copy_Tree (P),
514 Selector_Name => New_Occurrence_Of (Entity (Node (D)), Loc));
517 D_Val := New_Copy_Tree (Node (D));
520 Append (D_Val, Constraints);
525 end Build_Actual_Record_Constraint;
527 -- Start of processing for Build_Actual_Subtype_Of_Component
530 -- Why the test for Spec_Expression mode here???
532 if In_Spec_Expression then
535 -- More comments for the rest of this body would be good ???
537 elsif Nkind (N) = N_Explicit_Dereference then
538 if Is_Composite_Type (T)
539 and then not Is_Constrained (T)
540 and then not (Is_Class_Wide_Type (T)
541 and then Is_Constrained (Root_Type (T)))
542 and then not Has_Unknown_Discriminants (T)
544 -- If the type of the dereference is already constrained, it is an
547 if Is_Array_Type (Etype (N))
548 and then Is_Constrained (Etype (N))
552 Remove_Side_Effects (P);
553 return Build_Actual_Subtype (T, N);
560 if Ekind (T) = E_Access_Subtype then
561 Deaccessed_T := Designated_Type (T);
566 if Ekind (Deaccessed_T) = E_Array_Subtype then
567 Id := First_Index (Deaccessed_T);
568 while Present (Id) loop
569 Indx_Type := Underlying_Type (Etype (Id));
571 if Denotes_Discriminant (Type_Low_Bound (Indx_Type))
573 Denotes_Discriminant (Type_High_Bound (Indx_Type))
575 Remove_Side_Effects (P);
577 Build_Component_Subtype
578 (Build_Actual_Array_Constraint, Loc, Base_Type (T));
584 elsif Is_Composite_Type (Deaccessed_T)
585 and then Has_Discriminants (Deaccessed_T)
586 and then not Has_Unknown_Discriminants (Deaccessed_T)
588 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
589 while Present (D) loop
590 if Denotes_Discriminant (Node (D)) then
591 Remove_Side_Effects (P);
593 Build_Component_Subtype (
594 Build_Actual_Record_Constraint, Loc, Base_Type (T));
601 -- If none of the above, the actual and nominal subtypes are the same
604 end Build_Actual_Subtype_Of_Component;
606 -----------------------------
607 -- Build_Component_Subtype --
608 -----------------------------
610 function Build_Component_Subtype
613 T : Entity_Id) return Node_Id
619 -- Unchecked_Union components do not require component subtypes
621 if Is_Unchecked_Union (T) then
625 Subt := Make_Temporary (Loc, 'S');
626 Set_Is_Internal (Subt);
629 Make_Subtype_Declaration (Loc,
630 Defining_Identifier => Subt,
631 Subtype_Indication =>
632 Make_Subtype_Indication (Loc,
633 Subtype_Mark => New_Reference_To (Base_Type (T), Loc),
635 Make_Index_Or_Discriminant_Constraint (Loc,
638 Mark_Rewrite_Insertion (Decl);
640 end Build_Component_Subtype;
642 ---------------------------
643 -- Build_Default_Subtype --
644 ---------------------------
646 function Build_Default_Subtype
648 N : Node_Id) return Entity_Id
650 Loc : constant Source_Ptr := Sloc (N);
654 if not Has_Discriminants (T) or else Is_Constrained (T) then
658 Disc := First_Discriminant (T);
660 if No (Discriminant_Default_Value (Disc)) then
665 Act : constant Entity_Id := Make_Temporary (Loc, 'S');
666 Constraints : constant List_Id := New_List;
670 while Present (Disc) loop
671 Append_To (Constraints,
672 New_Copy_Tree (Discriminant_Default_Value (Disc)));
673 Next_Discriminant (Disc);
677 Make_Subtype_Declaration (Loc,
678 Defining_Identifier => Act,
679 Subtype_Indication =>
680 Make_Subtype_Indication (Loc,
681 Subtype_Mark => New_Occurrence_Of (T, Loc),
683 Make_Index_Or_Discriminant_Constraint (Loc,
684 Constraints => Constraints)));
686 Insert_Action (N, Decl);
690 end Build_Default_Subtype;
692 --------------------------------------------
693 -- Build_Discriminal_Subtype_Of_Component --
694 --------------------------------------------
696 function Build_Discriminal_Subtype_Of_Component
697 (T : Entity_Id) return Node_Id
699 Loc : constant Source_Ptr := Sloc (T);
703 function Build_Discriminal_Array_Constraint return List_Id;
704 -- If one or more of the bounds of the component depends on
705 -- discriminants, build actual constraint using the discriminants
708 function Build_Discriminal_Record_Constraint return List_Id;
709 -- Similar to previous one, for discriminated components constrained
710 -- by the discriminant of the enclosing object.
712 ----------------------------------------
713 -- Build_Discriminal_Array_Constraint --
714 ----------------------------------------
716 function Build_Discriminal_Array_Constraint return List_Id is
717 Constraints : constant List_Id := New_List;
725 Indx := First_Index (T);
726 while Present (Indx) loop
727 Old_Lo := Type_Low_Bound (Etype (Indx));
728 Old_Hi := Type_High_Bound (Etype (Indx));
730 if Denotes_Discriminant (Old_Lo) then
731 Lo := New_Occurrence_Of (Discriminal (Entity (Old_Lo)), Loc);
734 Lo := New_Copy_Tree (Old_Lo);
737 if Denotes_Discriminant (Old_Hi) then
738 Hi := New_Occurrence_Of (Discriminal (Entity (Old_Hi)), Loc);
741 Hi := New_Copy_Tree (Old_Hi);
744 Append (Make_Range (Loc, Lo, Hi), Constraints);
749 end Build_Discriminal_Array_Constraint;
751 -----------------------------------------
752 -- Build_Discriminal_Record_Constraint --
753 -----------------------------------------
755 function Build_Discriminal_Record_Constraint return List_Id is
756 Constraints : constant List_Id := New_List;
761 D := First_Elmt (Discriminant_Constraint (T));
762 while Present (D) loop
763 if Denotes_Discriminant (Node (D)) then
765 New_Occurrence_Of (Discriminal (Entity (Node (D))), Loc);
768 D_Val := New_Copy_Tree (Node (D));
771 Append (D_Val, Constraints);
776 end Build_Discriminal_Record_Constraint;
778 -- Start of processing for Build_Discriminal_Subtype_Of_Component
781 if Ekind (T) = E_Array_Subtype then
782 Id := First_Index (T);
783 while Present (Id) loop
784 if Denotes_Discriminant (Type_Low_Bound (Etype (Id))) or else
785 Denotes_Discriminant (Type_High_Bound (Etype (Id)))
787 return Build_Component_Subtype
788 (Build_Discriminal_Array_Constraint, Loc, T);
794 elsif Ekind (T) = E_Record_Subtype
795 and then Has_Discriminants (T)
796 and then not Has_Unknown_Discriminants (T)
798 D := First_Elmt (Discriminant_Constraint (T));
799 while Present (D) loop
800 if Denotes_Discriminant (Node (D)) then
801 return Build_Component_Subtype
802 (Build_Discriminal_Record_Constraint, Loc, T);
809 -- If none of the above, the actual and nominal subtypes are the same
812 end Build_Discriminal_Subtype_Of_Component;
814 ------------------------------
815 -- Build_Elaboration_Entity --
816 ------------------------------
818 procedure Build_Elaboration_Entity (N : Node_Id; Spec_Id : Entity_Id) is
819 Loc : constant Source_Ptr := Sloc (N);
821 Elab_Ent : Entity_Id;
823 procedure Set_Package_Name (Ent : Entity_Id);
824 -- Given an entity, sets the fully qualified name of the entity in
825 -- Name_Buffer, with components separated by double underscores. This
826 -- is a recursive routine that climbs the scope chain to Standard.
828 ----------------------
829 -- Set_Package_Name --
830 ----------------------
832 procedure Set_Package_Name (Ent : Entity_Id) is
834 if Scope (Ent) /= Standard_Standard then
835 Set_Package_Name (Scope (Ent));
838 Nam : constant String := Get_Name_String (Chars (Ent));
840 Name_Buffer (Name_Len + 1) := '_';
841 Name_Buffer (Name_Len + 2) := '_';
842 Name_Buffer (Name_Len + 3 .. Name_Len + Nam'Length + 2) := Nam;
843 Name_Len := Name_Len + Nam'Length + 2;
847 Get_Name_String (Chars (Ent));
849 end Set_Package_Name;
851 -- Start of processing for Build_Elaboration_Entity
854 -- Ignore if already constructed
856 if Present (Elaboration_Entity (Spec_Id)) then
860 -- Construct name of elaboration entity as xxx_E, where xxx is the unit
861 -- name with dots replaced by double underscore. We have to manually
862 -- construct this name, since it will be elaborated in the outer scope,
863 -- and thus will not have the unit name automatically prepended.
865 Set_Package_Name (Spec_Id);
869 Name_Buffer (Name_Len + 1) := '_';
870 Name_Buffer (Name_Len + 2) := 'E';
871 Name_Len := Name_Len + 2;
873 -- Create elaboration flag
876 Make_Defining_Identifier (Loc, Chars => Name_Find);
877 Set_Elaboration_Entity (Spec_Id, Elab_Ent);
880 Make_Object_Declaration (Loc,
881 Defining_Identifier => Elab_Ent,
883 New_Occurrence_Of (Standard_Boolean, Loc),
885 New_Occurrence_Of (Standard_False, Loc));
887 Push_Scope (Standard_Standard);
888 Add_Global_Declaration (Decl);
891 -- Reset True_Constant indication, since we will indeed assign a value
892 -- to the variable in the binder main. We also kill the Current_Value
893 -- and Last_Assignment fields for the same reason.
895 Set_Is_True_Constant (Elab_Ent, False);
896 Set_Current_Value (Elab_Ent, Empty);
897 Set_Last_Assignment (Elab_Ent, Empty);
899 -- We do not want any further qualification of the name (if we did
900 -- not do this, we would pick up the name of the generic package
901 -- in the case of a library level generic instantiation).
903 Set_Has_Qualified_Name (Elab_Ent);
904 Set_Has_Fully_Qualified_Name (Elab_Ent);
905 end Build_Elaboration_Entity;
907 -----------------------------------
908 -- Cannot_Raise_Constraint_Error --
909 -----------------------------------
911 function Cannot_Raise_Constraint_Error (Expr : Node_Id) return Boolean is
913 if Compile_Time_Known_Value (Expr) then
916 elsif Do_Range_Check (Expr) then
919 elsif Raises_Constraint_Error (Expr) then
927 when N_Expanded_Name =>
930 when N_Selected_Component =>
931 return not Do_Discriminant_Check (Expr);
933 when N_Attribute_Reference =>
934 if Do_Overflow_Check (Expr) then
937 elsif No (Expressions (Expr)) then
945 N := First (Expressions (Expr));
946 while Present (N) loop
947 if Cannot_Raise_Constraint_Error (N) then
958 when N_Type_Conversion =>
959 if Do_Overflow_Check (Expr)
960 or else Do_Length_Check (Expr)
961 or else Do_Tag_Check (Expr)
966 Cannot_Raise_Constraint_Error (Expression (Expr));
969 when N_Unchecked_Type_Conversion =>
970 return Cannot_Raise_Constraint_Error (Expression (Expr));
973 if Do_Overflow_Check (Expr) then
977 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
984 if Do_Division_Check (Expr)
985 or else Do_Overflow_Check (Expr)
990 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
992 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1011 N_Op_Shift_Right_Arithmetic |
1015 if Do_Overflow_Check (Expr) then
1019 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
1021 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1028 end Cannot_Raise_Constraint_Error;
1030 -----------------------------------------
1031 -- Check_Dynamically_Tagged_Expression --
1032 -----------------------------------------
1034 procedure Check_Dynamically_Tagged_Expression
1037 Related_Nod : Node_Id)
1040 pragma Assert (Is_Tagged_Type (Typ));
1042 -- In order to avoid spurious errors when analyzing the expanded code,
1043 -- this check is done only for nodes that come from source and for
1044 -- actuals of generic instantiations.
1046 if (Comes_From_Source (Related_Nod)
1047 or else In_Generic_Actual (Expr))
1048 and then (Is_Class_Wide_Type (Etype (Expr))
1049 or else Is_Dynamically_Tagged (Expr))
1050 and then Is_Tagged_Type (Typ)
1051 and then not Is_Class_Wide_Type (Typ)
1053 Error_Msg_N ("dynamically tagged expression not allowed!", Expr);
1055 end Check_Dynamically_Tagged_Expression;
1057 --------------------------
1058 -- Check_Fully_Declared --
1059 --------------------------
1061 procedure Check_Fully_Declared (T : Entity_Id; N : Node_Id) is
1063 if Ekind (T) = E_Incomplete_Type then
1065 -- Ada 2005 (AI-50217): If the type is available through a limited
1066 -- with_clause, verify that its full view has been analyzed.
1068 if From_With_Type (T)
1069 and then Present (Non_Limited_View (T))
1070 and then Ekind (Non_Limited_View (T)) /= E_Incomplete_Type
1072 -- The non-limited view is fully declared
1077 ("premature usage of incomplete}", N, First_Subtype (T));
1080 -- Need comments for these tests ???
1082 elsif Has_Private_Component (T)
1083 and then not Is_Generic_Type (Root_Type (T))
1084 and then not In_Spec_Expression
1086 -- Special case: if T is the anonymous type created for a single
1087 -- task or protected object, use the name of the source object.
1089 if Is_Concurrent_Type (T)
1090 and then not Comes_From_Source (T)
1091 and then Nkind (N) = N_Object_Declaration
1093 Error_Msg_NE ("type of& has incomplete component", N,
1094 Defining_Identifier (N));
1098 ("premature usage of incomplete}", N, First_Subtype (T));
1101 end Check_Fully_Declared;
1103 -------------------------
1104 -- Check_Nested_Access --
1105 -------------------------
1107 procedure Check_Nested_Access (Ent : Entity_Id) is
1108 Scop : constant Entity_Id := Current_Scope;
1109 Current_Subp : Entity_Id;
1110 Enclosing : Entity_Id;
1113 -- Currently only enabled for VM back-ends for efficiency, should we
1114 -- enable it more systematically ???
1116 -- Check for Is_Imported needs commenting below ???
1118 if VM_Target /= No_VM
1119 and then (Ekind (Ent) = E_Variable
1121 Ekind (Ent) = E_Constant
1123 Ekind (Ent) = E_Loop_Parameter)
1124 and then Scope (Ent) /= Empty
1125 and then not Is_Library_Level_Entity (Ent)
1126 and then not Is_Imported (Ent)
1128 if Is_Subprogram (Scop)
1129 or else Is_Generic_Subprogram (Scop)
1130 or else Is_Entry (Scop)
1132 Current_Subp := Scop;
1134 Current_Subp := Current_Subprogram;
1137 Enclosing := Enclosing_Subprogram (Ent);
1139 if Enclosing /= Empty
1140 and then Enclosing /= Current_Subp
1142 Set_Has_Up_Level_Access (Ent, True);
1145 end Check_Nested_Access;
1147 ------------------------------------------
1148 -- Check_Potentially_Blocking_Operation --
1149 ------------------------------------------
1151 procedure Check_Potentially_Blocking_Operation (N : Node_Id) is
1154 -- N is one of the potentially blocking operations listed in 9.5.1(8).
1155 -- When pragma Detect_Blocking is active, the run time will raise
1156 -- Program_Error. Here we only issue a warning, since we generally
1157 -- support the use of potentially blocking operations in the absence
1160 -- Indirect blocking through a subprogram call cannot be diagnosed
1161 -- statically without interprocedural analysis, so we do not attempt
1164 S := Scope (Current_Scope);
1165 while Present (S) and then S /= Standard_Standard loop
1166 if Is_Protected_Type (S) then
1168 ("potentially blocking operation in protected operation?", N);
1175 end Check_Potentially_Blocking_Operation;
1177 ------------------------------
1178 -- Check_Unprotected_Access --
1179 ------------------------------
1181 procedure Check_Unprotected_Access
1185 Cont_Encl_Typ : Entity_Id;
1186 Pref_Encl_Typ : Entity_Id;
1188 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id;
1189 -- Check whether Obj is a private component of a protected object.
1190 -- Return the protected type where the component resides, Empty
1193 function Is_Public_Operation return Boolean;
1194 -- Verify that the enclosing operation is callable from outside the
1195 -- protected object, to minimize false positives.
1197 ------------------------------
1198 -- Enclosing_Protected_Type --
1199 ------------------------------
1201 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id is
1203 if Is_Entity_Name (Obj) then
1205 Ent : Entity_Id := Entity (Obj);
1208 -- The object can be a renaming of a private component, use
1209 -- the original record component.
1211 if Is_Prival (Ent) then
1212 Ent := Prival_Link (Ent);
1215 if Is_Protected_Type (Scope (Ent)) then
1221 -- For indexed and selected components, recursively check the prefix
1223 if Nkind_In (Obj, N_Indexed_Component, N_Selected_Component) then
1224 return Enclosing_Protected_Type (Prefix (Obj));
1226 -- The object does not denote a protected component
1231 end Enclosing_Protected_Type;
1233 -------------------------
1234 -- Is_Public_Operation --
1235 -------------------------
1237 function Is_Public_Operation return Boolean is
1244 and then S /= Pref_Encl_Typ
1246 if Scope (S) = Pref_Encl_Typ then
1247 E := First_Entity (Pref_Encl_Typ);
1249 and then E /= First_Private_Entity (Pref_Encl_Typ)
1262 end Is_Public_Operation;
1264 -- Start of processing for Check_Unprotected_Access
1267 if Nkind (Expr) = N_Attribute_Reference
1268 and then Attribute_Name (Expr) = Name_Unchecked_Access
1270 Cont_Encl_Typ := Enclosing_Protected_Type (Context);
1271 Pref_Encl_Typ := Enclosing_Protected_Type (Prefix (Expr));
1273 -- Check whether we are trying to export a protected component to a
1274 -- context with an equal or lower access level.
1276 if Present (Pref_Encl_Typ)
1277 and then No (Cont_Encl_Typ)
1278 and then Is_Public_Operation
1279 and then Scope_Depth (Pref_Encl_Typ) >=
1280 Object_Access_Level (Context)
1283 ("?possible unprotected access to protected data", Expr);
1286 end Check_Unprotected_Access;
1292 procedure Check_VMS (Construct : Node_Id) is
1294 if not OpenVMS_On_Target then
1296 ("this construct is allowed only in Open'V'M'S", Construct);
1300 ------------------------
1301 -- Collect_Interfaces --
1302 ------------------------
1304 procedure Collect_Interfaces
1306 Ifaces_List : out Elist_Id;
1307 Exclude_Parents : Boolean := False;
1308 Use_Full_View : Boolean := True)
1310 procedure Collect (Typ : Entity_Id);
1311 -- Subsidiary subprogram used to traverse the whole list
1312 -- of directly and indirectly implemented interfaces
1318 procedure Collect (Typ : Entity_Id) is
1319 Ancestor : Entity_Id;
1327 -- Handle private types
1330 and then Is_Private_Type (Typ)
1331 and then Present (Full_View (Typ))
1333 Full_T := Full_View (Typ);
1336 -- Include the ancestor if we are generating the whole list of
1337 -- abstract interfaces.
1339 if Etype (Full_T) /= Typ
1341 -- Protect the frontend against wrong sources. For example:
1344 -- type A is tagged null record;
1345 -- type B is new A with private;
1346 -- type C is new A with private;
1348 -- type B is new C with null record;
1349 -- type C is new B with null record;
1352 and then Etype (Full_T) /= T
1354 Ancestor := Etype (Full_T);
1357 if Is_Interface (Ancestor)
1358 and then not Exclude_Parents
1360 Append_Unique_Elmt (Ancestor, Ifaces_List);
1364 -- Traverse the graph of ancestor interfaces
1366 if Is_Non_Empty_List (Abstract_Interface_List (Full_T)) then
1367 Id := First (Abstract_Interface_List (Full_T));
1368 while Present (Id) loop
1369 Iface := Etype (Id);
1371 -- Protect against wrong uses. For example:
1372 -- type I is interface;
1373 -- type O is tagged null record;
1374 -- type Wrong is new I and O with null record; -- ERROR
1376 if Is_Interface (Iface) then
1378 and then Etype (T) /= T
1379 and then Interface_Present_In_Ancestor (Etype (T), Iface)
1384 Append_Unique_Elmt (Iface, Ifaces_List);
1393 -- Start of processing for Collect_Interfaces
1396 pragma Assert (Is_Tagged_Type (T) or else Is_Concurrent_Type (T));
1397 Ifaces_List := New_Elmt_List;
1399 end Collect_Interfaces;
1401 ----------------------------------
1402 -- Collect_Interface_Components --
1403 ----------------------------------
1405 procedure Collect_Interface_Components
1406 (Tagged_Type : Entity_Id;
1407 Components_List : out Elist_Id)
1409 procedure Collect (Typ : Entity_Id);
1410 -- Subsidiary subprogram used to climb to the parents
1416 procedure Collect (Typ : Entity_Id) is
1417 Tag_Comp : Entity_Id;
1418 Parent_Typ : Entity_Id;
1421 -- Handle private types
1423 if Present (Full_View (Etype (Typ))) then
1424 Parent_Typ := Full_View (Etype (Typ));
1426 Parent_Typ := Etype (Typ);
1429 if Parent_Typ /= Typ
1431 -- Protect the frontend against wrong sources. For example:
1434 -- type A is tagged null record;
1435 -- type B is new A with private;
1436 -- type C is new A with private;
1438 -- type B is new C with null record;
1439 -- type C is new B with null record;
1442 and then Parent_Typ /= Tagged_Type
1444 Collect (Parent_Typ);
1447 -- Collect the components containing tags of secondary dispatch
1450 Tag_Comp := Next_Tag_Component (First_Tag_Component (Typ));
1451 while Present (Tag_Comp) loop
1452 pragma Assert (Present (Related_Type (Tag_Comp)));
1453 Append_Elmt (Tag_Comp, Components_List);
1455 Tag_Comp := Next_Tag_Component (Tag_Comp);
1459 -- Start of processing for Collect_Interface_Components
1462 pragma Assert (Ekind (Tagged_Type) = E_Record_Type
1463 and then Is_Tagged_Type (Tagged_Type));
1465 Components_List := New_Elmt_List;
1466 Collect (Tagged_Type);
1467 end Collect_Interface_Components;
1469 -----------------------------
1470 -- Collect_Interfaces_Info --
1471 -----------------------------
1473 procedure Collect_Interfaces_Info
1475 Ifaces_List : out Elist_Id;
1476 Components_List : out Elist_Id;
1477 Tags_List : out Elist_Id)
1479 Comps_List : Elist_Id;
1480 Comp_Elmt : Elmt_Id;
1481 Comp_Iface : Entity_Id;
1482 Iface_Elmt : Elmt_Id;
1485 function Search_Tag (Iface : Entity_Id) return Entity_Id;
1486 -- Search for the secondary tag associated with the interface type
1487 -- Iface that is implemented by T.
1493 function Search_Tag (Iface : Entity_Id) return Entity_Id is
1497 ADT := Next_Elmt (Next_Elmt (First_Elmt (Access_Disp_Table (T))));
1499 and then Ekind (Node (ADT)) = E_Constant
1500 and then Related_Type (Node (ADT)) /= Iface
1502 -- Skip the secondary dispatch tables of Iface
1510 pragma Assert (Ekind (Node (ADT)) = E_Constant);
1514 -- Start of processing for Collect_Interfaces_Info
1517 Collect_Interfaces (T, Ifaces_List);
1518 Collect_Interface_Components (T, Comps_List);
1520 -- Search for the record component and tag associated with each
1521 -- interface type of T.
1523 Components_List := New_Elmt_List;
1524 Tags_List := New_Elmt_List;
1526 Iface_Elmt := First_Elmt (Ifaces_List);
1527 while Present (Iface_Elmt) loop
1528 Iface := Node (Iface_Elmt);
1530 -- Associate the primary tag component and the primary dispatch table
1531 -- with all the interfaces that are parents of T
1533 if Is_Ancestor (Iface, T) then
1534 Append_Elmt (First_Tag_Component (T), Components_List);
1535 Append_Elmt (Node (First_Elmt (Access_Disp_Table (T))), Tags_List);
1537 -- Otherwise search for the tag component and secondary dispatch
1541 Comp_Elmt := First_Elmt (Comps_List);
1542 while Present (Comp_Elmt) loop
1543 Comp_Iface := Related_Type (Node (Comp_Elmt));
1545 if Comp_Iface = Iface
1546 or else Is_Ancestor (Iface, Comp_Iface)
1548 Append_Elmt (Node (Comp_Elmt), Components_List);
1549 Append_Elmt (Search_Tag (Comp_Iface), Tags_List);
1553 Next_Elmt (Comp_Elmt);
1555 pragma Assert (Present (Comp_Elmt));
1558 Next_Elmt (Iface_Elmt);
1560 end Collect_Interfaces_Info;
1562 ----------------------------------
1563 -- Collect_Primitive_Operations --
1564 ----------------------------------
1566 function Collect_Primitive_Operations (T : Entity_Id) return Elist_Id is
1567 B_Type : constant Entity_Id := Base_Type (T);
1568 B_Decl : constant Node_Id := Original_Node (Parent (B_Type));
1569 B_Scope : Entity_Id := Scope (B_Type);
1573 Formal_Derived : Boolean := False;
1577 -- For tagged types, the primitive operations are collected as they
1578 -- are declared, and held in an explicit list which is simply returned.
1580 if Is_Tagged_Type (B_Type) then
1581 return Primitive_Operations (B_Type);
1583 -- An untagged generic type that is a derived type inherits the
1584 -- primitive operations of its parent type. Other formal types only
1585 -- have predefined operators, which are not explicitly represented.
1587 elsif Is_Generic_Type (B_Type) then
1588 if Nkind (B_Decl) = N_Formal_Type_Declaration
1589 and then Nkind (Formal_Type_Definition (B_Decl))
1590 = N_Formal_Derived_Type_Definition
1592 Formal_Derived := True;
1594 return New_Elmt_List;
1598 Op_List := New_Elmt_List;
1600 if B_Scope = Standard_Standard then
1601 if B_Type = Standard_String then
1602 Append_Elmt (Standard_Op_Concat, Op_List);
1604 elsif B_Type = Standard_Wide_String then
1605 Append_Elmt (Standard_Op_Concatw, Op_List);
1611 elsif (Is_Package_Or_Generic_Package (B_Scope)
1613 Nkind (Parent (Declaration_Node (First_Subtype (T)))) /=
1615 or else Is_Derived_Type (B_Type)
1617 -- The primitive operations appear after the base type, except
1618 -- if the derivation happens within the private part of B_Scope
1619 -- and the type is a private type, in which case both the type
1620 -- and some primitive operations may appear before the base
1621 -- type, and the list of candidates starts after the type.
1623 if In_Open_Scopes (B_Scope)
1624 and then Scope (T) = B_Scope
1625 and then In_Private_Part (B_Scope)
1627 Id := Next_Entity (T);
1629 Id := Next_Entity (B_Type);
1632 while Present (Id) loop
1634 -- Note that generic formal subprograms are not
1635 -- considered to be primitive operations and thus
1636 -- are never inherited.
1638 if Is_Overloadable (Id)
1639 and then Nkind (Parent (Parent (Id)))
1640 not in N_Formal_Subprogram_Declaration
1644 if Base_Type (Etype (Id)) = B_Type then
1647 Formal := First_Formal (Id);
1648 while Present (Formal) loop
1649 if Base_Type (Etype (Formal)) = B_Type then
1653 elsif Ekind (Etype (Formal)) = E_Anonymous_Access_Type
1655 (Designated_Type (Etype (Formal))) = B_Type
1661 Next_Formal (Formal);
1665 -- For a formal derived type, the only primitives are the
1666 -- ones inherited from the parent type. Operations appearing
1667 -- in the package declaration are not primitive for it.
1670 and then (not Formal_Derived
1671 or else Present (Alias (Id)))
1673 -- In the special case of an equality operator aliased to
1674 -- an overriding dispatching equality belonging to the same
1675 -- type, we don't include it in the list of primitives.
1676 -- This avoids inheriting multiple equality operators when
1677 -- deriving from untagged private types whose full type is
1678 -- tagged, which can otherwise cause ambiguities. Note that
1679 -- this should only happen for this kind of untagged parent
1680 -- type, since normally dispatching operations are inherited
1681 -- using the type's Primitive_Operations list.
1683 if Chars (Id) = Name_Op_Eq
1684 and then Is_Dispatching_Operation (Id)
1685 and then Present (Alias (Id))
1686 and then Is_Overriding_Operation (Alias (Id))
1687 and then Base_Type (Etype (First_Entity (Id))) =
1688 Base_Type (Etype (First_Entity (Alias (Id))))
1692 -- Include the subprogram in the list of primitives
1695 Append_Elmt (Id, Op_List);
1702 -- For a type declared in System, some of its operations may
1703 -- appear in the target-specific extension to System.
1706 and then Chars (B_Scope) = Name_System
1707 and then Scope (B_Scope) = Standard_Standard
1708 and then Present_System_Aux
1710 B_Scope := System_Aux_Id;
1711 Id := First_Entity (System_Aux_Id);
1717 end Collect_Primitive_Operations;
1719 -----------------------------------
1720 -- Compile_Time_Constraint_Error --
1721 -----------------------------------
1723 function Compile_Time_Constraint_Error
1726 Ent : Entity_Id := Empty;
1727 Loc : Source_Ptr := No_Location;
1728 Warn : Boolean := False) return Node_Id
1730 Msgc : String (1 .. Msg'Length + 2);
1731 -- Copy of message, with room for possible ? and ! at end
1741 -- A static constraint error in an instance body is not a fatal error.
1742 -- we choose to inhibit the message altogether, because there is no
1743 -- obvious node (for now) on which to post it. On the other hand the
1744 -- offending node must be replaced with a constraint_error in any case.
1746 -- No messages are generated if we already posted an error on this node
1748 if not Error_Posted (N) then
1749 if Loc /= No_Location then
1755 Msgc (1 .. Msg'Length) := Msg;
1758 -- Message is a warning, even in Ada 95 case
1760 if Msg (Msg'Last) = '?' then
1763 -- In Ada 83, all messages are warnings. In the private part and
1764 -- the body of an instance, constraint_checks are only warnings.
1765 -- We also make this a warning if the Warn parameter is set.
1768 or else (Ada_Version = Ada_83 and then Comes_From_Source (N))
1774 elsif In_Instance_Not_Visible then
1779 -- Otherwise we have a real error message (Ada 95 static case)
1780 -- and we make this an unconditional message. Note that in the
1781 -- warning case we do not make the message unconditional, it seems
1782 -- quite reasonable to delete messages like this (about exceptions
1783 -- that will be raised) in dead code.
1791 -- Should we generate a warning? The answer is not quite yes. The
1792 -- very annoying exception occurs in the case of a short circuit
1793 -- operator where the left operand is static and decisive. Climb
1794 -- parents to see if that is the case we have here. Conditional
1795 -- expressions with decisive conditions are a similar situation.
1803 -- And then with False as left operand
1805 if Nkind (P) = N_And_Then
1806 and then Compile_Time_Known_Value (Left_Opnd (P))
1807 and then Is_False (Expr_Value (Left_Opnd (P)))
1812 -- OR ELSE with True as left operand
1814 elsif Nkind (P) = N_Or_Else
1815 and then Compile_Time_Known_Value (Left_Opnd (P))
1816 and then Is_True (Expr_Value (Left_Opnd (P)))
1821 -- Conditional expression
1823 elsif Nkind (P) = N_Conditional_Expression then
1825 Cond : constant Node_Id := First (Expressions (P));
1826 Texp : constant Node_Id := Next (Cond);
1827 Fexp : constant Node_Id := Next (Texp);
1830 if Compile_Time_Known_Value (Cond) then
1832 -- Condition is True and we are in the right operand
1834 if Is_True (Expr_Value (Cond))
1835 and then OldP = Fexp
1840 -- Condition is False and we are in the left operand
1842 elsif Is_False (Expr_Value (Cond))
1843 and then OldP = Texp
1851 -- Special case for component association in aggregates, where
1852 -- we want to keep climbing up to the parent aggregate.
1854 elsif Nkind (P) = N_Component_Association
1855 and then Nkind (Parent (P)) = N_Aggregate
1859 -- Keep going if within subexpression
1862 exit when Nkind (P) not in N_Subexpr;
1867 if Present (Ent) then
1868 Error_Msg_NEL (Msgc (1 .. Msgl), N, Ent, Eloc);
1870 Error_Msg_NEL (Msgc (1 .. Msgl), N, Etype (N), Eloc);
1874 if Inside_Init_Proc then
1876 ("\?& will be raised for objects of this type",
1877 N, Standard_Constraint_Error, Eloc);
1880 ("\?& will be raised at run time",
1881 N, Standard_Constraint_Error, Eloc);
1886 ("\static expression fails Constraint_Check", Eloc);
1887 Set_Error_Posted (N);
1893 end Compile_Time_Constraint_Error;
1895 -----------------------
1896 -- Conditional_Delay --
1897 -----------------------
1899 procedure Conditional_Delay (New_Ent, Old_Ent : Entity_Id) is
1901 if Has_Delayed_Freeze (Old_Ent) and then not Is_Frozen (Old_Ent) then
1902 Set_Has_Delayed_Freeze (New_Ent);
1904 end Conditional_Delay;
1906 -------------------------
1907 -- Copy_Parameter_List --
1908 -------------------------
1910 function Copy_Parameter_List (Subp_Id : Entity_Id) return List_Id is
1911 Loc : constant Source_Ptr := Sloc (Subp_Id);
1916 if No (First_Formal (Subp_Id)) then
1920 Formal := First_Formal (Subp_Id);
1921 while Present (Formal) loop
1923 (Make_Parameter_Specification (Loc,
1924 Defining_Identifier =>
1925 Make_Defining_Identifier (Sloc (Formal),
1926 Chars => Chars (Formal)),
1927 In_Present => In_Present (Parent (Formal)),
1928 Out_Present => Out_Present (Parent (Formal)),
1930 New_Reference_To (Etype (Formal), Loc),
1932 New_Copy_Tree (Expression (Parent (Formal)))),
1935 Next_Formal (Formal);
1940 end Copy_Parameter_List;
1942 --------------------
1943 -- Current_Entity --
1944 --------------------
1946 -- The currently visible definition for a given identifier is the
1947 -- one most chained at the start of the visibility chain, i.e. the
1948 -- one that is referenced by the Node_Id value of the name of the
1949 -- given identifier.
1951 function Current_Entity (N : Node_Id) return Entity_Id is
1953 return Get_Name_Entity_Id (Chars (N));
1956 -----------------------------
1957 -- Current_Entity_In_Scope --
1958 -----------------------------
1960 function Current_Entity_In_Scope (N : Node_Id) return Entity_Id is
1962 CS : constant Entity_Id := Current_Scope;
1964 Transient_Case : constant Boolean := Scope_Is_Transient;
1967 E := Get_Name_Entity_Id (Chars (N));
1969 and then Scope (E) /= CS
1970 and then (not Transient_Case or else Scope (E) /= Scope (CS))
1976 end Current_Entity_In_Scope;
1982 function Current_Scope return Entity_Id is
1984 if Scope_Stack.Last = -1 then
1985 return Standard_Standard;
1988 C : constant Entity_Id :=
1989 Scope_Stack.Table (Scope_Stack.Last).Entity;
1994 return Standard_Standard;
2000 ------------------------
2001 -- Current_Subprogram --
2002 ------------------------
2004 function Current_Subprogram return Entity_Id is
2005 Scop : constant Entity_Id := Current_Scope;
2007 if Is_Subprogram (Scop) or else Is_Generic_Subprogram (Scop) then
2010 return Enclosing_Subprogram (Scop);
2012 end Current_Subprogram;
2014 ---------------------
2015 -- Defining_Entity --
2016 ---------------------
2018 function Defining_Entity (N : Node_Id) return Entity_Id is
2019 K : constant Node_Kind := Nkind (N);
2020 Err : Entity_Id := Empty;
2025 N_Subprogram_Declaration |
2026 N_Abstract_Subprogram_Declaration |
2028 N_Package_Declaration |
2029 N_Subprogram_Renaming_Declaration |
2030 N_Subprogram_Body_Stub |
2031 N_Generic_Subprogram_Declaration |
2032 N_Generic_Package_Declaration |
2033 N_Formal_Subprogram_Declaration
2035 return Defining_Entity (Specification (N));
2038 N_Component_Declaration |
2039 N_Defining_Program_Unit_Name |
2040 N_Discriminant_Specification |
2042 N_Entry_Declaration |
2043 N_Entry_Index_Specification |
2044 N_Exception_Declaration |
2045 N_Exception_Renaming_Declaration |
2046 N_Formal_Object_Declaration |
2047 N_Formal_Package_Declaration |
2048 N_Formal_Type_Declaration |
2049 N_Full_Type_Declaration |
2050 N_Implicit_Label_Declaration |
2051 N_Incomplete_Type_Declaration |
2052 N_Loop_Parameter_Specification |
2053 N_Number_Declaration |
2054 N_Object_Declaration |
2055 N_Object_Renaming_Declaration |
2056 N_Package_Body_Stub |
2057 N_Parameter_Specification |
2058 N_Private_Extension_Declaration |
2059 N_Private_Type_Declaration |
2061 N_Protected_Body_Stub |
2062 N_Protected_Type_Declaration |
2063 N_Single_Protected_Declaration |
2064 N_Single_Task_Declaration |
2065 N_Subtype_Declaration |
2068 N_Task_Type_Declaration
2070 return Defining_Identifier (N);
2073 return Defining_Entity (Proper_Body (N));
2076 N_Function_Instantiation |
2077 N_Function_Specification |
2078 N_Generic_Function_Renaming_Declaration |
2079 N_Generic_Package_Renaming_Declaration |
2080 N_Generic_Procedure_Renaming_Declaration |
2082 N_Package_Instantiation |
2083 N_Package_Renaming_Declaration |
2084 N_Package_Specification |
2085 N_Procedure_Instantiation |
2086 N_Procedure_Specification
2089 Nam : constant Node_Id := Defining_Unit_Name (N);
2092 if Nkind (Nam) in N_Entity then
2095 -- For Error, make up a name and attach to declaration
2096 -- so we can continue semantic analysis
2098 elsif Nam = Error then
2099 Err := Make_Temporary (Sloc (N), 'T');
2100 Set_Defining_Unit_Name (N, Err);
2103 -- If not an entity, get defining identifier
2106 return Defining_Identifier (Nam);
2110 when N_Block_Statement =>
2111 return Entity (Identifier (N));
2114 raise Program_Error;
2117 end Defining_Entity;
2119 --------------------------
2120 -- Denotes_Discriminant --
2121 --------------------------
2123 function Denotes_Discriminant
2125 Check_Concurrent : Boolean := False) return Boolean
2129 if not Is_Entity_Name (N)
2130 or else No (Entity (N))
2137 -- If we are checking for a protected type, the discriminant may have
2138 -- been rewritten as the corresponding discriminal of the original type
2139 -- or of the corresponding concurrent record, depending on whether we
2140 -- are in the spec or body of the protected type.
2142 return Ekind (E) = E_Discriminant
2145 and then Ekind (E) = E_In_Parameter
2146 and then Present (Discriminal_Link (E))
2148 (Is_Concurrent_Type (Scope (Discriminal_Link (E)))
2150 Is_Concurrent_Record_Type (Scope (Discriminal_Link (E)))));
2152 end Denotes_Discriminant;
2154 -------------------------
2155 -- Denotes_Same_Object --
2156 -------------------------
2158 function Denotes_Same_Object (A1, A2 : Node_Id) return Boolean is
2160 -- If we have entity names, then must be same entity
2162 if Is_Entity_Name (A1) then
2163 if Is_Entity_Name (A2) then
2164 return Entity (A1) = Entity (A2);
2169 -- No match if not same node kind
2171 elsif Nkind (A1) /= Nkind (A2) then
2174 -- For selected components, must have same prefix and selector
2176 elsif Nkind (A1) = N_Selected_Component then
2177 return Denotes_Same_Object (Prefix (A1), Prefix (A2))
2179 Entity (Selector_Name (A1)) = Entity (Selector_Name (A2));
2181 -- For explicit dereferences, prefixes must be same
2183 elsif Nkind (A1) = N_Explicit_Dereference then
2184 return Denotes_Same_Object (Prefix (A1), Prefix (A2));
2186 -- For indexed components, prefixes and all subscripts must be the same
2188 elsif Nkind (A1) = N_Indexed_Component then
2189 if Denotes_Same_Object (Prefix (A1), Prefix (A2)) then
2195 Indx1 := First (Expressions (A1));
2196 Indx2 := First (Expressions (A2));
2197 while Present (Indx1) loop
2199 -- Shouldn't we be checking that values are the same???
2201 if not Denotes_Same_Object (Indx1, Indx2) then
2215 -- For slices, prefixes must match and bounds must match
2217 elsif Nkind (A1) = N_Slice
2218 and then Denotes_Same_Object (Prefix (A1), Prefix (A2))
2221 Lo1, Lo2, Hi1, Hi2 : Node_Id;
2224 Get_Index_Bounds (Etype (A1), Lo1, Hi1);
2225 Get_Index_Bounds (Etype (A2), Lo2, Hi2);
2227 -- Check whether bounds are statically identical. There is no
2228 -- attempt to detect partial overlap of slices.
2230 -- What about an array and a slice of an array???
2232 return Denotes_Same_Object (Lo1, Lo2)
2233 and then Denotes_Same_Object (Hi1, Hi2);
2236 -- Literals will appear as indices. Isn't this where we should check
2237 -- Known_At_Compile_Time at least if we are generating warnings ???
2239 elsif Nkind (A1) = N_Integer_Literal then
2240 return Intval (A1) = Intval (A2);
2245 end Denotes_Same_Object;
2247 -------------------------
2248 -- Denotes_Same_Prefix --
2249 -------------------------
2251 function Denotes_Same_Prefix (A1, A2 : Node_Id) return Boolean is
2254 if Is_Entity_Name (A1) then
2255 if Nkind_In (A2, N_Selected_Component, N_Indexed_Component) then
2256 return Denotes_Same_Object (A1, Prefix (A2))
2257 or else Denotes_Same_Prefix (A1, Prefix (A2));
2262 elsif Is_Entity_Name (A2) then
2263 return Denotes_Same_Prefix (A2, A1);
2265 elsif Nkind_In (A1, N_Selected_Component, N_Indexed_Component, N_Slice)
2267 Nkind_In (A2, N_Selected_Component, N_Indexed_Component, N_Slice)
2270 Root1, Root2 : Node_Id;
2271 Depth1, Depth2 : Int := 0;
2274 Root1 := Prefix (A1);
2275 while not Is_Entity_Name (Root1) loop
2277 (Root1, N_Selected_Component, N_Indexed_Component)
2281 Root1 := Prefix (Root1);
2284 Depth1 := Depth1 + 1;
2287 Root2 := Prefix (A2);
2288 while not Is_Entity_Name (Root2) loop
2290 (Root2, N_Selected_Component, N_Indexed_Component)
2294 Root2 := Prefix (Root2);
2297 Depth2 := Depth2 + 1;
2300 -- If both have the same depth and they do not denote the same
2301 -- object, they are disjoint and not warning is needed.
2303 if Depth1 = Depth2 then
2306 elsif Depth1 > Depth2 then
2307 Root1 := Prefix (A1);
2308 for I in 1 .. Depth1 - Depth2 - 1 loop
2309 Root1 := Prefix (Root1);
2312 return Denotes_Same_Object (Root1, A2);
2315 Root2 := Prefix (A2);
2316 for I in 1 .. Depth2 - Depth1 - 1 loop
2317 Root2 := Prefix (Root2);
2320 return Denotes_Same_Object (A1, Root2);
2327 end Denotes_Same_Prefix;
2329 ----------------------
2330 -- Denotes_Variable --
2331 ----------------------
2333 function Denotes_Variable (N : Node_Id) return Boolean is
2335 return Is_Variable (N) and then Paren_Count (N) = 0;
2336 end Denotes_Variable;
2338 -----------------------------
2339 -- Depends_On_Discriminant --
2340 -----------------------------
2342 function Depends_On_Discriminant (N : Node_Id) return Boolean is
2347 Get_Index_Bounds (N, L, H);
2348 return Denotes_Discriminant (L) or else Denotes_Discriminant (H);
2349 end Depends_On_Discriminant;
2351 -------------------------
2352 -- Designate_Same_Unit --
2353 -------------------------
2355 function Designate_Same_Unit
2357 Name2 : Node_Id) return Boolean
2359 K1 : constant Node_Kind := Nkind (Name1);
2360 K2 : constant Node_Kind := Nkind (Name2);
2362 function Prefix_Node (N : Node_Id) return Node_Id;
2363 -- Returns the parent unit name node of a defining program unit name
2364 -- or the prefix if N is a selected component or an expanded name.
2366 function Select_Node (N : Node_Id) return Node_Id;
2367 -- Returns the defining identifier node of a defining program unit
2368 -- name or the selector node if N is a selected component or an
2375 function Prefix_Node (N : Node_Id) return Node_Id is
2377 if Nkind (N) = N_Defining_Program_Unit_Name then
2389 function Select_Node (N : Node_Id) return Node_Id is
2391 if Nkind (N) = N_Defining_Program_Unit_Name then
2392 return Defining_Identifier (N);
2395 return Selector_Name (N);
2399 -- Start of processing for Designate_Next_Unit
2402 if (K1 = N_Identifier or else
2403 K1 = N_Defining_Identifier)
2405 (K2 = N_Identifier or else
2406 K2 = N_Defining_Identifier)
2408 return Chars (Name1) = Chars (Name2);
2411 (K1 = N_Expanded_Name or else
2412 K1 = N_Selected_Component or else
2413 K1 = N_Defining_Program_Unit_Name)
2415 (K2 = N_Expanded_Name or else
2416 K2 = N_Selected_Component or else
2417 K2 = N_Defining_Program_Unit_Name)
2420 (Chars (Select_Node (Name1)) = Chars (Select_Node (Name2)))
2422 Designate_Same_Unit (Prefix_Node (Name1), Prefix_Node (Name2));
2427 end Designate_Same_Unit;
2429 ----------------------------
2430 -- Enclosing_Generic_Body --
2431 ----------------------------
2433 function Enclosing_Generic_Body
2434 (N : Node_Id) return Node_Id
2442 while Present (P) loop
2443 if Nkind (P) = N_Package_Body
2444 or else Nkind (P) = N_Subprogram_Body
2446 Spec := Corresponding_Spec (P);
2448 if Present (Spec) then
2449 Decl := Unit_Declaration_Node (Spec);
2451 if Nkind (Decl) = N_Generic_Package_Declaration
2452 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2463 end Enclosing_Generic_Body;
2465 ----------------------------
2466 -- Enclosing_Generic_Unit --
2467 ----------------------------
2469 function Enclosing_Generic_Unit
2470 (N : Node_Id) return Node_Id
2478 while Present (P) loop
2479 if Nkind (P) = N_Generic_Package_Declaration
2480 or else Nkind (P) = N_Generic_Subprogram_Declaration
2484 elsif Nkind (P) = N_Package_Body
2485 or else Nkind (P) = N_Subprogram_Body
2487 Spec := Corresponding_Spec (P);
2489 if Present (Spec) then
2490 Decl := Unit_Declaration_Node (Spec);
2492 if Nkind (Decl) = N_Generic_Package_Declaration
2493 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2504 end Enclosing_Generic_Unit;
2506 -------------------------------
2507 -- Enclosing_Lib_Unit_Entity --
2508 -------------------------------
2510 function Enclosing_Lib_Unit_Entity return Entity_Id is
2511 Unit_Entity : Entity_Id;
2514 -- Look for enclosing library unit entity by following scope links.
2515 -- Equivalent to, but faster than indexing through the scope stack.
2517 Unit_Entity := Current_Scope;
2518 while (Present (Scope (Unit_Entity))
2519 and then Scope (Unit_Entity) /= Standard_Standard)
2520 and not Is_Child_Unit (Unit_Entity)
2522 Unit_Entity := Scope (Unit_Entity);
2526 end Enclosing_Lib_Unit_Entity;
2528 -----------------------------
2529 -- Enclosing_Lib_Unit_Node --
2530 -----------------------------
2532 function Enclosing_Lib_Unit_Node (N : Node_Id) return Node_Id is
2533 Current_Node : Node_Id;
2537 while Present (Current_Node)
2538 and then Nkind (Current_Node) /= N_Compilation_Unit
2540 Current_Node := Parent (Current_Node);
2543 if Nkind (Current_Node) /= N_Compilation_Unit then
2547 return Current_Node;
2548 end Enclosing_Lib_Unit_Node;
2550 --------------------------
2551 -- Enclosing_Subprogram --
2552 --------------------------
2554 function Enclosing_Subprogram (E : Entity_Id) return Entity_Id is
2555 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
2558 if Dynamic_Scope = Standard_Standard then
2561 elsif Dynamic_Scope = Empty then
2564 elsif Ekind (Dynamic_Scope) = E_Subprogram_Body then
2565 return Corresponding_Spec (Parent (Parent (Dynamic_Scope)));
2567 elsif Ekind (Dynamic_Scope) = E_Block
2568 or else Ekind (Dynamic_Scope) = E_Return_Statement
2570 return Enclosing_Subprogram (Dynamic_Scope);
2572 elsif Ekind (Dynamic_Scope) = E_Task_Type then
2573 return Get_Task_Body_Procedure (Dynamic_Scope);
2575 -- No body is generated if the protected operation is eliminated
2577 elsif Convention (Dynamic_Scope) = Convention_Protected
2578 and then not Is_Eliminated (Dynamic_Scope)
2579 and then Present (Protected_Body_Subprogram (Dynamic_Scope))
2581 return Protected_Body_Subprogram (Dynamic_Scope);
2584 return Dynamic_Scope;
2586 end Enclosing_Subprogram;
2588 ------------------------
2589 -- Ensure_Freeze_Node --
2590 ------------------------
2592 procedure Ensure_Freeze_Node (E : Entity_Id) is
2596 if No (Freeze_Node (E)) then
2597 FN := Make_Freeze_Entity (Sloc (E));
2598 Set_Has_Delayed_Freeze (E);
2599 Set_Freeze_Node (E, FN);
2600 Set_Access_Types_To_Process (FN, No_Elist);
2601 Set_TSS_Elist (FN, No_Elist);
2604 end Ensure_Freeze_Node;
2610 procedure Enter_Name (Def_Id : Entity_Id) is
2611 C : constant Entity_Id := Current_Entity (Def_Id);
2612 E : constant Entity_Id := Current_Entity_In_Scope (Def_Id);
2613 S : constant Entity_Id := Current_Scope;
2616 Generate_Definition (Def_Id);
2618 -- Add new name to current scope declarations. Check for duplicate
2619 -- declaration, which may or may not be a genuine error.
2623 -- Case of previous entity entered because of a missing declaration
2624 -- or else a bad subtype indication. Best is to use the new entity,
2625 -- and make the previous one invisible.
2627 if Etype (E) = Any_Type then
2628 Set_Is_Immediately_Visible (E, False);
2630 -- Case of renaming declaration constructed for package instances.
2631 -- if there is an explicit declaration with the same identifier,
2632 -- the renaming is not immediately visible any longer, but remains
2633 -- visible through selected component notation.
2635 elsif Nkind (Parent (E)) = N_Package_Renaming_Declaration
2636 and then not Comes_From_Source (E)
2638 Set_Is_Immediately_Visible (E, False);
2640 -- The new entity may be the package renaming, which has the same
2641 -- same name as a generic formal which has been seen already.
2643 elsif Nkind (Parent (Def_Id)) = N_Package_Renaming_Declaration
2644 and then not Comes_From_Source (Def_Id)
2646 Set_Is_Immediately_Visible (E, False);
2648 -- For a fat pointer corresponding to a remote access to subprogram,
2649 -- we use the same identifier as the RAS type, so that the proper
2650 -- name appears in the stub. This type is only retrieved through
2651 -- the RAS type and never by visibility, and is not added to the
2652 -- visibility list (see below).
2654 elsif Nkind (Parent (Def_Id)) = N_Full_Type_Declaration
2655 and then Present (Corresponding_Remote_Type (Def_Id))
2659 -- A controller component for a type extension overrides the
2660 -- inherited component.
2662 elsif Chars (E) = Name_uController then
2665 -- Case of an implicit operation or derived literal. The new entity
2666 -- hides the implicit one, which is removed from all visibility,
2667 -- i.e. the entity list of its scope, and homonym chain of its name.
2669 elsif (Is_Overloadable (E) and then Is_Inherited_Operation (E))
2670 or else Is_Internal (E)
2674 Prev_Vis : Entity_Id;
2675 Decl : constant Node_Id := Parent (E);
2678 -- If E is an implicit declaration, it cannot be the first
2679 -- entity in the scope.
2681 Prev := First_Entity (Current_Scope);
2682 while Present (Prev)
2683 and then Next_Entity (Prev) /= E
2690 -- If E is not on the entity chain of the current scope,
2691 -- it is an implicit declaration in the generic formal
2692 -- part of a generic subprogram. When analyzing the body,
2693 -- the generic formals are visible but not on the entity
2694 -- chain of the subprogram. The new entity will become
2695 -- the visible one in the body.
2698 (Nkind (Parent (Decl)) = N_Generic_Subprogram_Declaration);
2702 Set_Next_Entity (Prev, Next_Entity (E));
2704 if No (Next_Entity (Prev)) then
2705 Set_Last_Entity (Current_Scope, Prev);
2708 if E = Current_Entity (E) then
2712 Prev_Vis := Current_Entity (E);
2713 while Homonym (Prev_Vis) /= E loop
2714 Prev_Vis := Homonym (Prev_Vis);
2718 if Present (Prev_Vis) then
2720 -- Skip E in the visibility chain
2722 Set_Homonym (Prev_Vis, Homonym (E));
2725 Set_Name_Entity_Id (Chars (E), Homonym (E));
2730 -- This section of code could use a comment ???
2732 elsif Present (Etype (E))
2733 and then Is_Concurrent_Type (Etype (E))
2738 -- If the homograph is a protected component renaming, it should not
2739 -- be hiding the current entity. Such renamings are treated as weak
2742 elsif Is_Prival (E) then
2743 Set_Is_Immediately_Visible (E, False);
2745 -- In this case the current entity is a protected component renaming.
2746 -- Perform minimal decoration by setting the scope and return since
2747 -- the prival should not be hiding other visible entities.
2749 elsif Is_Prival (Def_Id) then
2750 Set_Scope (Def_Id, Current_Scope);
2753 -- Analogous to privals, the discriminal generated for an entry
2754 -- index parameter acts as a weak declaration. Perform minimal
2755 -- decoration to avoid bogus errors.
2757 elsif Is_Discriminal (Def_Id)
2758 and then Ekind (Discriminal_Link (Def_Id)) = E_Entry_Index_Parameter
2760 Set_Scope (Def_Id, Current_Scope);
2763 -- In the body or private part of an instance, a type extension
2764 -- may introduce a component with the same name as that of an
2765 -- actual. The legality rule is not enforced, but the semantics
2766 -- of the full type with two components of the same name are not
2767 -- clear at this point ???
2769 elsif In_Instance_Not_Visible then
2772 -- When compiling a package body, some child units may have become
2773 -- visible. They cannot conflict with local entities that hide them.
2775 elsif Is_Child_Unit (E)
2776 and then In_Open_Scopes (Scope (E))
2777 and then not Is_Immediately_Visible (E)
2781 -- Conversely, with front-end inlining we may compile the parent
2782 -- body first, and a child unit subsequently. The context is now
2783 -- the parent spec, and body entities are not visible.
2785 elsif Is_Child_Unit (Def_Id)
2786 and then Is_Package_Body_Entity (E)
2787 and then not In_Package_Body (Current_Scope)
2791 -- Case of genuine duplicate declaration
2794 Error_Msg_Sloc := Sloc (E);
2796 -- If the previous declaration is an incomplete type declaration
2797 -- this may be an attempt to complete it with a private type.
2798 -- The following avoids confusing cascaded errors.
2800 if Nkind (Parent (E)) = N_Incomplete_Type_Declaration
2801 and then Nkind (Parent (Def_Id)) = N_Private_Type_Declaration
2804 ("incomplete type cannot be completed with a private " &
2805 "declaration", Parent (Def_Id));
2806 Set_Is_Immediately_Visible (E, False);
2807 Set_Full_View (E, Def_Id);
2809 -- An inherited component of a record conflicts with a new
2810 -- discriminant. The discriminant is inserted first in the scope,
2811 -- but the error should be posted on it, not on the component.
2813 elsif Ekind (E) = E_Discriminant
2814 and then Present (Scope (Def_Id))
2815 and then Scope (Def_Id) /= Current_Scope
2817 Error_Msg_Sloc := Sloc (Def_Id);
2818 Error_Msg_N ("& conflicts with declaration#", E);
2821 -- If the name of the unit appears in its own context clause,
2822 -- a dummy package with the name has already been created, and
2823 -- the error emitted. Try to continue quietly.
2825 elsif Error_Posted (E)
2826 and then Sloc (E) = No_Location
2827 and then Nkind (Parent (E)) = N_Package_Specification
2828 and then Current_Scope = Standard_Standard
2830 Set_Scope (Def_Id, Current_Scope);
2834 Error_Msg_N ("& conflicts with declaration#", Def_Id);
2836 -- Avoid cascaded messages with duplicate components in
2839 if Ekind_In (E, E_Component, E_Discriminant) then
2844 if Nkind (Parent (Parent (Def_Id))) =
2845 N_Generic_Subprogram_Declaration
2847 Defining_Entity (Specification (Parent (Parent (Def_Id))))
2849 Error_Msg_N ("\generic units cannot be overloaded", Def_Id);
2852 -- If entity is in standard, then we are in trouble, because
2853 -- it means that we have a library package with a duplicated
2854 -- name. That's hard to recover from, so abort!
2856 if S = Standard_Standard then
2857 raise Unrecoverable_Error;
2859 -- Otherwise we continue with the declaration. Having two
2860 -- identical declarations should not cause us too much trouble!
2868 -- If we fall through, declaration is OK , or OK enough to continue
2870 -- If Def_Id is a discriminant or a record component we are in the
2871 -- midst of inheriting components in a derived record definition.
2872 -- Preserve their Ekind and Etype.
2874 if Ekind_In (Def_Id, E_Discriminant, E_Component) then
2877 -- If a type is already set, leave it alone (happens whey a type
2878 -- declaration is reanalyzed following a call to the optimizer)
2880 elsif Present (Etype (Def_Id)) then
2883 -- Otherwise, the kind E_Void insures that premature uses of the entity
2884 -- will be detected. Any_Type insures that no cascaded errors will occur
2887 Set_Ekind (Def_Id, E_Void);
2888 Set_Etype (Def_Id, Any_Type);
2891 -- Inherited discriminants and components in derived record types are
2892 -- immediately visible. Itypes are not.
2894 if Ekind_In (Def_Id, E_Discriminant, E_Component)
2895 or else (No (Corresponding_Remote_Type (Def_Id))
2896 and then not Is_Itype (Def_Id))
2898 Set_Is_Immediately_Visible (Def_Id);
2899 Set_Current_Entity (Def_Id);
2902 Set_Homonym (Def_Id, C);
2903 Append_Entity (Def_Id, S);
2904 Set_Public_Status (Def_Id);
2906 -- Warn if new entity hides an old one
2908 if Warn_On_Hiding and then Present (C)
2910 -- Don't warn for record components since they always have a well
2911 -- defined scope which does not confuse other uses. Note that in
2912 -- some cases, Ekind has not been set yet.
2914 and then Ekind (C) /= E_Component
2915 and then Ekind (C) /= E_Discriminant
2916 and then Nkind (Parent (C)) /= N_Component_Declaration
2917 and then Ekind (Def_Id) /= E_Component
2918 and then Ekind (Def_Id) /= E_Discriminant
2919 and then Nkind (Parent (Def_Id)) /= N_Component_Declaration
2921 -- Don't warn for one character variables. It is too common to use
2922 -- such variables as locals and will just cause too many false hits.
2924 and then Length_Of_Name (Chars (C)) /= 1
2926 -- Don't warn for non-source entities
2928 and then Comes_From_Source (C)
2929 and then Comes_From_Source (Def_Id)
2931 -- Don't warn unless entity in question is in extended main source
2933 and then In_Extended_Main_Source_Unit (Def_Id)
2935 -- Finally, the hidden entity must be either immediately visible
2936 -- or use visible (from a used package)
2939 (Is_Immediately_Visible (C)
2941 Is_Potentially_Use_Visible (C))
2943 Error_Msg_Sloc := Sloc (C);
2944 Error_Msg_N ("declaration hides &#?", Def_Id);
2948 --------------------------
2949 -- Explain_Limited_Type --
2950 --------------------------
2952 procedure Explain_Limited_Type (T : Entity_Id; N : Node_Id) is
2956 -- For array, component type must be limited
2958 if Is_Array_Type (T) then
2959 Error_Msg_Node_2 := T;
2961 ("\component type& of type& is limited", N, Component_Type (T));
2962 Explain_Limited_Type (Component_Type (T), N);
2964 elsif Is_Record_Type (T) then
2966 -- No need for extra messages if explicit limited record
2968 if Is_Limited_Record (Base_Type (T)) then
2972 -- Otherwise find a limited component. Check only components that
2973 -- come from source, or inherited components that appear in the
2974 -- source of the ancestor.
2976 C := First_Component (T);
2977 while Present (C) loop
2978 if Is_Limited_Type (Etype (C))
2980 (Comes_From_Source (C)
2982 (Present (Original_Record_Component (C))
2984 Comes_From_Source (Original_Record_Component (C))))
2986 Error_Msg_Node_2 := T;
2987 Error_Msg_NE ("\component& of type& has limited type", N, C);
2988 Explain_Limited_Type (Etype (C), N);
2995 -- The type may be declared explicitly limited, even if no component
2996 -- of it is limited, in which case we fall out of the loop.
2999 end Explain_Limited_Type;
3005 procedure Find_Actual
3007 Formal : out Entity_Id;
3010 Parnt : constant Node_Id := Parent (N);
3014 if (Nkind (Parnt) = N_Indexed_Component
3016 Nkind (Parnt) = N_Selected_Component)
3017 and then N = Prefix (Parnt)
3019 Find_Actual (Parnt, Formal, Call);
3022 elsif Nkind (Parnt) = N_Parameter_Association
3023 and then N = Explicit_Actual_Parameter (Parnt)
3025 Call := Parent (Parnt);
3027 elsif Nkind (Parnt) = N_Procedure_Call_Statement then
3036 -- If we have a call to a subprogram look for the parameter. Note that
3037 -- we exclude overloaded calls, since we don't know enough to be sure
3038 -- of giving the right answer in this case.
3040 if Is_Entity_Name (Name (Call))
3041 and then Present (Entity (Name (Call)))
3042 and then Is_Overloadable (Entity (Name (Call)))
3043 and then not Is_Overloaded (Name (Call))
3045 -- Fall here if we are definitely a parameter
3047 Actual := First_Actual (Call);
3048 Formal := First_Formal (Entity (Name (Call)));
3049 while Present (Formal) and then Present (Actual) loop
3053 Actual := Next_Actual (Actual);
3054 Formal := Next_Formal (Formal);
3059 -- Fall through here if we did not find matching actual
3065 ---------------------------
3066 -- Find_Body_Discriminal --
3067 ---------------------------
3069 function Find_Body_Discriminal
3070 (Spec_Discriminant : Entity_Id) return Entity_Id
3072 pragma Assert (Is_Concurrent_Record_Type (Scope (Spec_Discriminant)));
3073 Tsk : constant Entity_Id :=
3074 Corresponding_Concurrent_Type (Scope (Spec_Discriminant));
3077 -- Find discriminant of original concurrent type, and use its current
3078 -- discriminal, which is the renaming within the task/protected body.
3080 Disc := First_Discriminant (Tsk);
3081 while Present (Disc) loop
3082 if Chars (Disc) = Chars (Spec_Discriminant) then
3083 Set_Scope (Discriminal (Disc), Tsk);
3084 return Discriminal (Disc);
3087 Next_Discriminant (Disc);
3090 -- That loop should always succeed in finding a matching entry and
3091 -- returning. Fatal error if not.
3093 raise Program_Error;
3094 end Find_Body_Discriminal;
3096 -------------------------------------
3097 -- Find_Corresponding_Discriminant --
3098 -------------------------------------
3100 function Find_Corresponding_Discriminant
3102 Typ : Entity_Id) return Entity_Id
3104 Par_Disc : Entity_Id;
3105 Old_Disc : Entity_Id;
3106 New_Disc : Entity_Id;
3109 Par_Disc := Original_Record_Component (Original_Discriminant (Id));
3111 -- The original type may currently be private, and the discriminant
3112 -- only appear on its full view.
3114 if Is_Private_Type (Scope (Par_Disc))
3115 and then not Has_Discriminants (Scope (Par_Disc))
3116 and then Present (Full_View (Scope (Par_Disc)))
3118 Old_Disc := First_Discriminant (Full_View (Scope (Par_Disc)));
3120 Old_Disc := First_Discriminant (Scope (Par_Disc));
3123 if Is_Class_Wide_Type (Typ) then
3124 New_Disc := First_Discriminant (Root_Type (Typ));
3126 New_Disc := First_Discriminant (Typ);
3129 while Present (Old_Disc) and then Present (New_Disc) loop
3130 if Old_Disc = Par_Disc then
3133 Next_Discriminant (Old_Disc);
3134 Next_Discriminant (New_Disc);
3138 -- Should always find it
3140 raise Program_Error;
3141 end Find_Corresponding_Discriminant;
3143 --------------------------
3144 -- Find_Overlaid_Entity --
3145 --------------------------
3147 procedure Find_Overlaid_Entity
3149 Ent : out Entity_Id;
3155 -- We are looking for one of the two following forms:
3157 -- for X'Address use Y'Address
3161 -- Const : constant Address := expr;
3163 -- for X'Address use Const;
3165 -- In the second case, the expr is either Y'Address, or recursively a
3166 -- constant that eventually references Y'Address.
3171 if Nkind (N) = N_Attribute_Definition_Clause
3172 and then Chars (N) = Name_Address
3174 Expr := Expression (N);
3176 -- This loop checks the form of the expression for Y'Address,
3177 -- using recursion to deal with intermediate constants.
3180 -- Check for Y'Address
3182 if Nkind (Expr) = N_Attribute_Reference
3183 and then Attribute_Name (Expr) = Name_Address
3185 Expr := Prefix (Expr);
3188 -- Check for Const where Const is a constant entity
3190 elsif Is_Entity_Name (Expr)
3191 and then Ekind (Entity (Expr)) = E_Constant
3193 Expr := Constant_Value (Entity (Expr));
3195 -- Anything else does not need checking
3202 -- This loop checks the form of the prefix for an entity,
3203 -- using recursion to deal with intermediate components.
3206 -- Check for Y where Y is an entity
3208 if Is_Entity_Name (Expr) then
3209 Ent := Entity (Expr);
3212 -- Check for components
3215 Nkind_In (Expr, N_Selected_Component, N_Indexed_Component) then
3217 Expr := Prefix (Expr);
3220 -- Anything else does not need checking
3227 end Find_Overlaid_Entity;
3229 -------------------------
3230 -- Find_Parameter_Type --
3231 -------------------------
3233 function Find_Parameter_Type (Param : Node_Id) return Entity_Id is
3235 if Nkind (Param) /= N_Parameter_Specification then
3238 -- For an access parameter, obtain the type from the formal entity
3239 -- itself, because access to subprogram nodes do not carry a type.
3240 -- Shouldn't we always use the formal entity ???
3242 elsif Nkind (Parameter_Type (Param)) = N_Access_Definition then
3243 return Etype (Defining_Identifier (Param));
3246 return Etype (Parameter_Type (Param));
3248 end Find_Parameter_Type;
3250 -----------------------------
3251 -- Find_Static_Alternative --
3252 -----------------------------
3254 function Find_Static_Alternative (N : Node_Id) return Node_Id is
3255 Expr : constant Node_Id := Expression (N);
3256 Val : constant Uint := Expr_Value (Expr);
3261 Alt := First (Alternatives (N));
3264 if Nkind (Alt) /= N_Pragma then
3265 Choice := First (Discrete_Choices (Alt));
3266 while Present (Choice) loop
3268 -- Others choice, always matches
3270 if Nkind (Choice) = N_Others_Choice then
3273 -- Range, check if value is in the range
3275 elsif Nkind (Choice) = N_Range then
3277 Val >= Expr_Value (Low_Bound (Choice))
3279 Val <= Expr_Value (High_Bound (Choice));
3281 -- Choice is a subtype name. Note that we know it must
3282 -- be a static subtype, since otherwise it would have
3283 -- been diagnosed as illegal.
3285 elsif Is_Entity_Name (Choice)
3286 and then Is_Type (Entity (Choice))
3288 exit Search when Is_In_Range (Expr, Etype (Choice),
3289 Assume_Valid => False);
3291 -- Choice is a subtype indication
3293 elsif Nkind (Choice) = N_Subtype_Indication then
3295 C : constant Node_Id := Constraint (Choice);
3296 R : constant Node_Id := Range_Expression (C);
3300 Val >= Expr_Value (Low_Bound (R))
3302 Val <= Expr_Value (High_Bound (R));
3305 -- Choice is a simple expression
3308 exit Search when Val = Expr_Value (Choice);
3316 pragma Assert (Present (Alt));
3319 -- The above loop *must* terminate by finding a match, since
3320 -- we know the case statement is valid, and the value of the
3321 -- expression is known at compile time. When we fall out of
3322 -- the loop, Alt points to the alternative that we know will
3323 -- be selected at run time.
3326 end Find_Static_Alternative;
3332 function First_Actual (Node : Node_Id) return Node_Id is
3336 if No (Parameter_Associations (Node)) then
3340 N := First (Parameter_Associations (Node));
3342 if Nkind (N) = N_Parameter_Association then
3343 return First_Named_Actual (Node);
3349 -------------------------
3350 -- Full_Qualified_Name --
3351 -------------------------
3353 function Full_Qualified_Name (E : Entity_Id) return String_Id is
3355 pragma Warnings (Off, Res);
3357 function Internal_Full_Qualified_Name (E : Entity_Id) return String_Id;
3358 -- Compute recursively the qualified name without NUL at the end
3360 ----------------------------------
3361 -- Internal_Full_Qualified_Name --
3362 ----------------------------------
3364 function Internal_Full_Qualified_Name (E : Entity_Id) return String_Id is
3365 Ent : Entity_Id := E;
3366 Parent_Name : String_Id := No_String;
3369 -- Deals properly with child units
3371 if Nkind (Ent) = N_Defining_Program_Unit_Name then
3372 Ent := Defining_Identifier (Ent);
3375 -- Compute qualification recursively (only "Standard" has no scope)
3377 if Present (Scope (Scope (Ent))) then
3378 Parent_Name := Internal_Full_Qualified_Name (Scope (Ent));
3381 -- Every entity should have a name except some expanded blocks
3382 -- don't bother about those.
3384 if Chars (Ent) = No_Name then
3388 -- Add a period between Name and qualification
3390 if Parent_Name /= No_String then
3391 Start_String (Parent_Name);
3392 Store_String_Char (Get_Char_Code ('.'));
3398 -- Generates the entity name in upper case
3400 Get_Decoded_Name_String (Chars (Ent));
3402 Store_String_Chars (Name_Buffer (1 .. Name_Len));
3404 end Internal_Full_Qualified_Name;
3406 -- Start of processing for Full_Qualified_Name
3409 Res := Internal_Full_Qualified_Name (E);
3410 Store_String_Char (Get_Char_Code (ASCII.NUL));
3412 end Full_Qualified_Name;
3414 -----------------------
3415 -- Gather_Components --
3416 -----------------------
3418 procedure Gather_Components
3420 Comp_List : Node_Id;
3421 Governed_By : List_Id;
3423 Report_Errors : out Boolean)
3427 Discrete_Choice : Node_Id;
3428 Comp_Item : Node_Id;
3430 Discrim : Entity_Id;
3431 Discrim_Name : Node_Id;
3432 Discrim_Value : Node_Id;
3435 Report_Errors := False;
3437 if No (Comp_List) or else Null_Present (Comp_List) then
3440 elsif Present (Component_Items (Comp_List)) then
3441 Comp_Item := First (Component_Items (Comp_List));
3447 while Present (Comp_Item) loop
3449 -- Skip the tag of a tagged record, the interface tags, as well
3450 -- as all items that are not user components (anonymous types,
3451 -- rep clauses, Parent field, controller field).
3453 if Nkind (Comp_Item) = N_Component_Declaration then
3455 Comp : constant Entity_Id := Defining_Identifier (Comp_Item);
3457 if not Is_Tag (Comp)
3458 and then Chars (Comp) /= Name_uParent
3459 and then Chars (Comp) /= Name_uController
3461 Append_Elmt (Comp, Into);
3469 if No (Variant_Part (Comp_List)) then
3472 Discrim_Name := Name (Variant_Part (Comp_List));
3473 Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
3476 -- Look for the discriminant that governs this variant part.
3477 -- The discriminant *must* be in the Governed_By List
3479 Assoc := First (Governed_By);
3480 Find_Constraint : loop
3481 Discrim := First (Choices (Assoc));
3482 exit Find_Constraint when Chars (Discrim_Name) = Chars (Discrim)
3483 or else (Present (Corresponding_Discriminant (Entity (Discrim)))
3485 Chars (Corresponding_Discriminant (Entity (Discrim)))
3486 = Chars (Discrim_Name))
3487 or else Chars (Original_Record_Component (Entity (Discrim)))
3488 = Chars (Discrim_Name);
3490 if No (Next (Assoc)) then
3491 if not Is_Constrained (Typ)
3492 and then Is_Derived_Type (Typ)
3493 and then Present (Stored_Constraint (Typ))
3495 -- If the type is a tagged type with inherited discriminants,
3496 -- use the stored constraint on the parent in order to find
3497 -- the values of discriminants that are otherwise hidden by an
3498 -- explicit constraint. Renamed discriminants are handled in
3501 -- If several parent discriminants are renamed by a single
3502 -- discriminant of the derived type, the call to obtain the
3503 -- Corresponding_Discriminant field only retrieves the last
3504 -- of them. We recover the constraint on the others from the
3505 -- Stored_Constraint as well.
3512 D := First_Discriminant (Etype (Typ));
3513 C := First_Elmt (Stored_Constraint (Typ));
3514 while Present (D) and then Present (C) loop
3515 if Chars (Discrim_Name) = Chars (D) then
3516 if Is_Entity_Name (Node (C))
3517 and then Entity (Node (C)) = Entity (Discrim)
3519 -- D is renamed by Discrim, whose value is given in
3526 Make_Component_Association (Sloc (Typ),
3528 (New_Occurrence_Of (D, Sloc (Typ))),
3529 Duplicate_Subexpr_No_Checks (Node (C)));
3531 exit Find_Constraint;
3534 Next_Discriminant (D);
3541 if No (Next (Assoc)) then
3542 Error_Msg_NE (" missing value for discriminant&",
3543 First (Governed_By), Discrim_Name);
3544 Report_Errors := True;
3549 end loop Find_Constraint;
3551 Discrim_Value := Expression (Assoc);
3553 if not Is_OK_Static_Expression (Discrim_Value) then
3555 ("value for discriminant & must be static!",
3556 Discrim_Value, Discrim);
3557 Why_Not_Static (Discrim_Value);
3558 Report_Errors := True;
3562 Search_For_Discriminant_Value : declare
3568 UI_Discrim_Value : constant Uint := Expr_Value (Discrim_Value);
3571 Find_Discrete_Value : while Present (Variant) loop
3572 Discrete_Choice := First (Discrete_Choices (Variant));
3573 while Present (Discrete_Choice) loop
3575 exit Find_Discrete_Value when
3576 Nkind (Discrete_Choice) = N_Others_Choice;
3578 Get_Index_Bounds (Discrete_Choice, Low, High);
3580 UI_Low := Expr_Value (Low);
3581 UI_High := Expr_Value (High);
3583 exit Find_Discrete_Value when
3584 UI_Low <= UI_Discrim_Value
3586 UI_High >= UI_Discrim_Value;
3588 Next (Discrete_Choice);
3591 Next_Non_Pragma (Variant);
3592 end loop Find_Discrete_Value;
3593 end Search_For_Discriminant_Value;
3595 if No (Variant) then
3597 ("value of discriminant & is out of range", Discrim_Value, Discrim);
3598 Report_Errors := True;
3602 -- If we have found the corresponding choice, recursively add its
3603 -- components to the Into list.
3605 Gather_Components (Empty,
3606 Component_List (Variant), Governed_By, Into, Report_Errors);
3607 end Gather_Components;
3609 ------------------------
3610 -- Get_Actual_Subtype --
3611 ------------------------
3613 function Get_Actual_Subtype (N : Node_Id) return Entity_Id is
3614 Typ : constant Entity_Id := Etype (N);
3615 Utyp : Entity_Id := Underlying_Type (Typ);
3624 -- If what we have is an identifier that references a subprogram
3625 -- formal, or a variable or constant object, then we get the actual
3626 -- subtype from the referenced entity if one has been built.
3628 if Nkind (N) = N_Identifier
3630 (Is_Formal (Entity (N))
3631 or else Ekind (Entity (N)) = E_Constant
3632 or else Ekind (Entity (N)) = E_Variable)
3633 and then Present (Actual_Subtype (Entity (N)))
3635 return Actual_Subtype (Entity (N));
3637 -- Actual subtype of unchecked union is always itself. We never need
3638 -- the "real" actual subtype. If we did, we couldn't get it anyway
3639 -- because the discriminant is not available. The restrictions on
3640 -- Unchecked_Union are designed to make sure that this is OK.
3642 elsif Is_Unchecked_Union (Base_Type (Utyp)) then
3645 -- Here for the unconstrained case, we must find actual subtype
3646 -- No actual subtype is available, so we must build it on the fly.
3648 -- Checking the type, not the underlying type, for constrainedness
3649 -- seems to be necessary. Maybe all the tests should be on the type???
3651 elsif (not Is_Constrained (Typ))
3652 and then (Is_Array_Type (Utyp)
3653 or else (Is_Record_Type (Utyp)
3654 and then Has_Discriminants (Utyp)))
3655 and then not Has_Unknown_Discriminants (Utyp)
3656 and then not (Ekind (Utyp) = E_String_Literal_Subtype)
3658 -- Nothing to do if in spec expression (why not???)
3660 if In_Spec_Expression then
3663 elsif Is_Private_Type (Typ)
3664 and then not Has_Discriminants (Typ)
3666 -- If the type has no discriminants, there is no subtype to
3667 -- build, even if the underlying type is discriminated.
3671 -- Else build the actual subtype
3674 Decl := Build_Actual_Subtype (Typ, N);
3675 Atyp := Defining_Identifier (Decl);
3677 -- If Build_Actual_Subtype generated a new declaration then use it
3681 -- The actual subtype is an Itype, so analyze the declaration,
3682 -- but do not attach it to the tree, to get the type defined.
3684 Set_Parent (Decl, N);
3685 Set_Is_Itype (Atyp);
3686 Analyze (Decl, Suppress => All_Checks);
3687 Set_Associated_Node_For_Itype (Atyp, N);
3688 Set_Has_Delayed_Freeze (Atyp, False);
3690 -- We need to freeze the actual subtype immediately. This is
3691 -- needed, because otherwise this Itype will not get frozen
3692 -- at all, and it is always safe to freeze on creation because
3693 -- any associated types must be frozen at this point.
3695 Freeze_Itype (Atyp, N);
3698 -- Otherwise we did not build a declaration, so return original
3705 -- For all remaining cases, the actual subtype is the same as
3706 -- the nominal type.
3711 end Get_Actual_Subtype;
3713 -------------------------------------
3714 -- Get_Actual_Subtype_If_Available --
3715 -------------------------------------
3717 function Get_Actual_Subtype_If_Available (N : Node_Id) return Entity_Id is
3718 Typ : constant Entity_Id := Etype (N);
3721 -- If what we have is an identifier that references a subprogram
3722 -- formal, or a variable or constant object, then we get the actual
3723 -- subtype from the referenced entity if one has been built.
3725 if Nkind (N) = N_Identifier
3727 (Is_Formal (Entity (N))
3728 or else Ekind (Entity (N)) = E_Constant
3729 or else Ekind (Entity (N)) = E_Variable)
3730 and then Present (Actual_Subtype (Entity (N)))
3732 return Actual_Subtype (Entity (N));
3734 -- Otherwise the Etype of N is returned unchanged
3739 end Get_Actual_Subtype_If_Available;
3741 -------------------------------
3742 -- Get_Default_External_Name --
3743 -------------------------------
3745 function Get_Default_External_Name (E : Node_Or_Entity_Id) return Node_Id is
3747 Get_Decoded_Name_String (Chars (E));
3749 if Opt.External_Name_Imp_Casing = Uppercase then
3750 Set_Casing (All_Upper_Case);
3752 Set_Casing (All_Lower_Case);
3756 Make_String_Literal (Sloc (E),
3757 Strval => String_From_Name_Buffer);
3758 end Get_Default_External_Name;
3760 ---------------------------
3761 -- Get_Enum_Lit_From_Pos --
3762 ---------------------------
3764 function Get_Enum_Lit_From_Pos
3767 Loc : Source_Ptr) return Node_Id
3772 -- In the case where the literal is of type Character, Wide_Character
3773 -- or Wide_Wide_Character or of a type derived from them, there needs
3774 -- to be some special handling since there is no explicit chain of
3775 -- literals to search. Instead, an N_Character_Literal node is created
3776 -- with the appropriate Char_Code and Chars fields.
3778 if Is_Standard_Character_Type (T) then
3779 Set_Character_Literal_Name (UI_To_CC (Pos));
3781 Make_Character_Literal (Loc,
3783 Char_Literal_Value => Pos);
3785 -- For all other cases, we have a complete table of literals, and
3786 -- we simply iterate through the chain of literal until the one
3787 -- with the desired position value is found.
3791 Lit := First_Literal (Base_Type (T));
3792 for J in 1 .. UI_To_Int (Pos) loop
3796 return New_Occurrence_Of (Lit, Loc);
3798 end Get_Enum_Lit_From_Pos;
3800 ------------------------
3801 -- Get_Generic_Entity --
3802 ------------------------
3804 function Get_Generic_Entity (N : Node_Id) return Entity_Id is
3805 Ent : constant Entity_Id := Entity (Name (N));
3807 if Present (Renamed_Object (Ent)) then
3808 return Renamed_Object (Ent);
3812 end Get_Generic_Entity;
3814 ----------------------
3815 -- Get_Index_Bounds --
3816 ----------------------
3818 procedure Get_Index_Bounds (N : Node_Id; L, H : out Node_Id) is
3819 Kind : constant Node_Kind := Nkind (N);
3823 if Kind = N_Range then
3825 H := High_Bound (N);
3827 elsif Kind = N_Subtype_Indication then
3828 R := Range_Expression (Constraint (N));
3836 L := Low_Bound (Range_Expression (Constraint (N)));
3837 H := High_Bound (Range_Expression (Constraint (N)));
3840 elsif Is_Entity_Name (N) and then Is_Type (Entity (N)) then
3841 if Error_Posted (Scalar_Range (Entity (N))) then
3845 elsif Nkind (Scalar_Range (Entity (N))) = N_Subtype_Indication then
3846 Get_Index_Bounds (Scalar_Range (Entity (N)), L, H);
3849 L := Low_Bound (Scalar_Range (Entity (N)));
3850 H := High_Bound (Scalar_Range (Entity (N)));
3854 -- N is an expression, indicating a range with one value
3859 end Get_Index_Bounds;
3861 ----------------------------------
3862 -- Get_Library_Unit_Name_string --
3863 ----------------------------------
3865 procedure Get_Library_Unit_Name_String (Decl_Node : Node_Id) is
3866 Unit_Name_Id : constant Unit_Name_Type := Get_Unit_Name (Decl_Node);
3869 Get_Unit_Name_String (Unit_Name_Id);
3871 -- Remove seven last character (" (spec)" or " (body)")
3873 Name_Len := Name_Len - 7;
3874 pragma Assert (Name_Buffer (Name_Len + 1) = ' ');
3875 end Get_Library_Unit_Name_String;
3877 ------------------------
3878 -- Get_Name_Entity_Id --
3879 ------------------------
3881 function Get_Name_Entity_Id (Id : Name_Id) return Entity_Id is
3883 return Entity_Id (Get_Name_Table_Info (Id));
3884 end Get_Name_Entity_Id;
3890 function Get_Pragma_Id (N : Node_Id) return Pragma_Id is
3892 return Get_Pragma_Id (Pragma_Name (N));
3895 ---------------------------
3896 -- Get_Referenced_Object --
3897 ---------------------------
3899 function Get_Referenced_Object (N : Node_Id) return Node_Id is
3904 while Is_Entity_Name (R)
3905 and then Present (Renamed_Object (Entity (R)))
3907 R := Renamed_Object (Entity (R));
3911 end Get_Referenced_Object;
3913 ------------------------
3914 -- Get_Renamed_Entity --
3915 ------------------------
3917 function Get_Renamed_Entity (E : Entity_Id) return Entity_Id is
3922 while Present (Renamed_Entity (R)) loop
3923 R := Renamed_Entity (R);
3927 end Get_Renamed_Entity;
3929 -------------------------
3930 -- Get_Subprogram_Body --
3931 -------------------------
3933 function Get_Subprogram_Body (E : Entity_Id) return Node_Id is
3937 Decl := Unit_Declaration_Node (E);
3939 if Nkind (Decl) = N_Subprogram_Body then
3942 -- The below comment is bad, because it is possible for
3943 -- Nkind (Decl) to be an N_Subprogram_Body_Stub ???
3945 else -- Nkind (Decl) = N_Subprogram_Declaration
3947 if Present (Corresponding_Body (Decl)) then
3948 return Unit_Declaration_Node (Corresponding_Body (Decl));
3950 -- Imported subprogram case
3956 end Get_Subprogram_Body;
3958 ---------------------------
3959 -- Get_Subprogram_Entity --
3960 ---------------------------
3962 function Get_Subprogram_Entity (Nod : Node_Id) return Entity_Id is
3967 if Nkind (Nod) = N_Accept_Statement then
3968 Nam := Entry_Direct_Name (Nod);
3970 -- For an entry call, the prefix of the call is a selected component.
3971 -- Need additional code for internal calls ???
3973 elsif Nkind (Nod) = N_Entry_Call_Statement then
3974 if Nkind (Name (Nod)) = N_Selected_Component then
3975 Nam := Entity (Selector_Name (Name (Nod)));
3984 if Nkind (Nam) = N_Explicit_Dereference then
3985 Proc := Etype (Prefix (Nam));
3986 elsif Is_Entity_Name (Nam) then
3987 Proc := Entity (Nam);
3992 if Is_Object (Proc) then
3993 Proc := Etype (Proc);
3996 if Ekind (Proc) = E_Access_Subprogram_Type then
3997 Proc := Directly_Designated_Type (Proc);
4000 if not Is_Subprogram (Proc)
4001 and then Ekind (Proc) /= E_Subprogram_Type
4007 end Get_Subprogram_Entity;
4009 -----------------------------
4010 -- Get_Task_Body_Procedure --
4011 -----------------------------
4013 function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
4015 -- Note: A task type may be the completion of a private type with
4016 -- discriminants. When performing elaboration checks on a task
4017 -- declaration, the current view of the type may be the private one,
4018 -- and the procedure that holds the body of the task is held in its
4021 -- This is an odd function, why not have Task_Body_Procedure do
4022 -- the following digging???
4024 return Task_Body_Procedure (Underlying_Type (Root_Type (E)));
4025 end Get_Task_Body_Procedure;
4027 -----------------------
4028 -- Has_Access_Values --
4029 -----------------------
4031 function Has_Access_Values (T : Entity_Id) return Boolean is
4032 Typ : constant Entity_Id := Underlying_Type (T);
4035 -- Case of a private type which is not completed yet. This can only
4036 -- happen in the case of a generic format type appearing directly, or
4037 -- as a component of the type to which this function is being applied
4038 -- at the top level. Return False in this case, since we certainly do
4039 -- not know that the type contains access types.
4044 elsif Is_Access_Type (Typ) then
4047 elsif Is_Array_Type (Typ) then
4048 return Has_Access_Values (Component_Type (Typ));
4050 elsif Is_Record_Type (Typ) then
4055 -- Loop to Check components
4057 Comp := First_Component_Or_Discriminant (Typ);
4058 while Present (Comp) loop
4060 -- Check for access component, tag field does not count, even
4061 -- though it is implemented internally using an access type.
4063 if Has_Access_Values (Etype (Comp))
4064 and then Chars (Comp) /= Name_uTag
4069 Next_Component_Or_Discriminant (Comp);
4078 end Has_Access_Values;
4080 ------------------------------
4081 -- Has_Compatible_Alignment --
4082 ------------------------------
4084 function Has_Compatible_Alignment
4086 Expr : Node_Id) return Alignment_Result
4088 function Has_Compatible_Alignment_Internal
4091 Default : Alignment_Result) return Alignment_Result;
4092 -- This is the internal recursive function that actually does the work.
4093 -- There is one additional parameter, which says what the result should
4094 -- be if no alignment information is found, and there is no definite
4095 -- indication of compatible alignments. At the outer level, this is set
4096 -- to Unknown, but for internal recursive calls in the case where types
4097 -- are known to be correct, it is set to Known_Compatible.
4099 ---------------------------------------
4100 -- Has_Compatible_Alignment_Internal --
4101 ---------------------------------------
4103 function Has_Compatible_Alignment_Internal
4106 Default : Alignment_Result) return Alignment_Result
4108 Result : Alignment_Result := Known_Compatible;
4109 -- Holds the current status of the result. Note that once a value of
4110 -- Known_Incompatible is set, it is sticky and does not get changed
4111 -- to Unknown (the value in Result only gets worse as we go along,
4114 Offs : Uint := No_Uint;
4115 -- Set to a factor of the offset from the base object when Expr is a
4116 -- selected or indexed component, based on Component_Bit_Offset and
4117 -- Component_Size respectively. A negative value is used to represent
4118 -- a value which is not known at compile time.
4120 procedure Check_Prefix;
4121 -- Checks the prefix recursively in the case where the expression
4122 -- is an indexed or selected component.
4124 procedure Set_Result (R : Alignment_Result);
4125 -- If R represents a worse outcome (unknown instead of known
4126 -- compatible, or known incompatible), then set Result to R.
4132 procedure Check_Prefix is
4134 -- The subtlety here is that in doing a recursive call to check
4135 -- the prefix, we have to decide what to do in the case where we
4136 -- don't find any specific indication of an alignment problem.
4138 -- At the outer level, we normally set Unknown as the result in
4139 -- this case, since we can only set Known_Compatible if we really
4140 -- know that the alignment value is OK, but for the recursive
4141 -- call, in the case where the types match, and we have not
4142 -- specified a peculiar alignment for the object, we are only
4143 -- concerned about suspicious rep clauses, the default case does
4144 -- not affect us, since the compiler will, in the absence of such
4145 -- rep clauses, ensure that the alignment is correct.
4147 if Default = Known_Compatible
4149 (Etype (Obj) = Etype (Expr)
4150 and then (Unknown_Alignment (Obj)
4152 Alignment (Obj) = Alignment (Etype (Obj))))
4155 (Has_Compatible_Alignment_Internal
4156 (Obj, Prefix (Expr), Known_Compatible));
4158 -- In all other cases, we need a full check on the prefix
4162 (Has_Compatible_Alignment_Internal
4163 (Obj, Prefix (Expr), Unknown));
4171 procedure Set_Result (R : Alignment_Result) is
4178 -- Start of processing for Has_Compatible_Alignment_Internal
4181 -- If Expr is a selected component, we must make sure there is no
4182 -- potentially troublesome component clause, and that the record is
4185 if Nkind (Expr) = N_Selected_Component then
4187 -- Packed record always generate unknown alignment
4189 if Is_Packed (Etype (Prefix (Expr))) then
4190 Set_Result (Unknown);
4193 -- Check prefix and component offset
4196 Offs := Component_Bit_Offset (Entity (Selector_Name (Expr)));
4198 -- If Expr is an indexed component, we must make sure there is no
4199 -- potentially troublesome Component_Size clause and that the array
4200 -- is not bit-packed.
4202 elsif Nkind (Expr) = N_Indexed_Component then
4204 Typ : constant Entity_Id := Etype (Prefix (Expr));
4205 Ind : constant Node_Id := First_Index (Typ);
4208 -- Bit packed array always generates unknown alignment
4210 if Is_Bit_Packed_Array (Typ) then
4211 Set_Result (Unknown);
4214 -- Check prefix and component offset
4217 Offs := Component_Size (Typ);
4219 -- Small optimization: compute the full offset when possible
4222 and then Offs > Uint_0
4223 and then Present (Ind)
4224 and then Nkind (Ind) = N_Range
4225 and then Compile_Time_Known_Value (Low_Bound (Ind))
4226 and then Compile_Time_Known_Value (First (Expressions (Expr)))
4228 Offs := Offs * (Expr_Value (First (Expressions (Expr)))
4229 - Expr_Value (Low_Bound ((Ind))));
4234 -- If we have a null offset, the result is entirely determined by
4235 -- the base object and has already been computed recursively.
4237 if Offs = Uint_0 then
4240 -- Case where we know the alignment of the object
4242 elsif Known_Alignment (Obj) then
4244 ObjA : constant Uint := Alignment (Obj);
4245 ExpA : Uint := No_Uint;
4246 SizA : Uint := No_Uint;
4249 -- If alignment of Obj is 1, then we are always OK
4252 Set_Result (Known_Compatible);
4254 -- Alignment of Obj is greater than 1, so we need to check
4257 -- If we have an offset, see if it is compatible
4259 if Offs /= No_Uint and Offs > Uint_0 then
4260 if Offs mod (System_Storage_Unit * ObjA) /= 0 then
4261 Set_Result (Known_Incompatible);
4264 -- See if Expr is an object with known alignment
4266 elsif Is_Entity_Name (Expr)
4267 and then Known_Alignment (Entity (Expr))
4269 ExpA := Alignment (Entity (Expr));
4271 -- Otherwise, we can use the alignment of the type of
4272 -- Expr given that we already checked for
4273 -- discombobulating rep clauses for the cases of indexed
4274 -- and selected components above.
4276 elsif Known_Alignment (Etype (Expr)) then
4277 ExpA := Alignment (Etype (Expr));
4279 -- Otherwise the alignment is unknown
4282 Set_Result (Default);
4285 -- If we got an alignment, see if it is acceptable
4287 if ExpA /= No_Uint and then ExpA < ObjA then
4288 Set_Result (Known_Incompatible);
4291 -- If Expr is not a piece of a larger object, see if size
4292 -- is given. If so, check that it is not too small for the
4293 -- required alignment.
4295 if Offs /= No_Uint then
4298 -- See if Expr is an object with known size
4300 elsif Is_Entity_Name (Expr)
4301 and then Known_Static_Esize (Entity (Expr))
4303 SizA := Esize (Entity (Expr));
4305 -- Otherwise, we check the object size of the Expr type
4307 elsif Known_Static_Esize (Etype (Expr)) then
4308 SizA := Esize (Etype (Expr));
4311 -- If we got a size, see if it is a multiple of the Obj
4312 -- alignment, if not, then the alignment cannot be
4313 -- acceptable, since the size is always a multiple of the
4316 if SizA /= No_Uint then
4317 if SizA mod (ObjA * Ttypes.System_Storage_Unit) /= 0 then
4318 Set_Result (Known_Incompatible);
4324 -- If we do not know required alignment, any non-zero offset is a
4325 -- potential problem (but certainly may be OK, so result is unknown).
4327 elsif Offs /= No_Uint then
4328 Set_Result (Unknown);
4330 -- If we can't find the result by direct comparison of alignment
4331 -- values, then there is still one case that we can determine known
4332 -- result, and that is when we can determine that the types are the
4333 -- same, and no alignments are specified. Then we known that the
4334 -- alignments are compatible, even if we don't know the alignment
4335 -- value in the front end.
4337 elsif Etype (Obj) = Etype (Expr) then
4339 -- Types are the same, but we have to check for possible size
4340 -- and alignments on the Expr object that may make the alignment
4341 -- different, even though the types are the same.
4343 if Is_Entity_Name (Expr) then
4345 -- First check alignment of the Expr object. Any alignment less
4346 -- than Maximum_Alignment is worrisome since this is the case
4347 -- where we do not know the alignment of Obj.
4349 if Known_Alignment (Entity (Expr))
4351 UI_To_Int (Alignment (Entity (Expr))) <
4352 Ttypes.Maximum_Alignment
4354 Set_Result (Unknown);
4356 -- Now check size of Expr object. Any size that is not an
4357 -- even multiple of Maximum_Alignment is also worrisome
4358 -- since it may cause the alignment of the object to be less
4359 -- than the alignment of the type.
4361 elsif Known_Static_Esize (Entity (Expr))
4363 (UI_To_Int (Esize (Entity (Expr))) mod
4364 (Ttypes.Maximum_Alignment * Ttypes.System_Storage_Unit))
4367 Set_Result (Unknown);
4369 -- Otherwise same type is decisive
4372 Set_Result (Known_Compatible);
4376 -- Another case to deal with is when there is an explicit size or
4377 -- alignment clause when the types are not the same. If so, then the
4378 -- result is Unknown. We don't need to do this test if the Default is
4379 -- Unknown, since that result will be set in any case.
4381 elsif Default /= Unknown
4382 and then (Has_Size_Clause (Etype (Expr))
4384 Has_Alignment_Clause (Etype (Expr)))
4386 Set_Result (Unknown);
4388 -- If no indication found, set default
4391 Set_Result (Default);
4394 -- Return worst result found
4397 end Has_Compatible_Alignment_Internal;
4399 -- Start of processing for Has_Compatible_Alignment
4402 -- If Obj has no specified alignment, then set alignment from the type
4403 -- alignment. Perhaps we should always do this, but for sure we should
4404 -- do it when there is an address clause since we can do more if the
4405 -- alignment is known.
4407 if Unknown_Alignment (Obj) then
4408 Set_Alignment (Obj, Alignment (Etype (Obj)));
4411 -- Now do the internal call that does all the work
4413 return Has_Compatible_Alignment_Internal (Obj, Expr, Unknown);
4414 end Has_Compatible_Alignment;
4416 ----------------------
4417 -- Has_Declarations --
4418 ----------------------
4420 function Has_Declarations (N : Node_Id) return Boolean is
4422 return Nkind_In (Nkind (N), N_Accept_Statement,
4424 N_Compilation_Unit_Aux,
4430 N_Package_Specification);
4431 end Has_Declarations;
4433 -------------------------------------------
4434 -- Has_Discriminant_Dependent_Constraint --
4435 -------------------------------------------
4437 function Has_Discriminant_Dependent_Constraint
4438 (Comp : Entity_Id) return Boolean
4440 Comp_Decl : constant Node_Id := Parent (Comp);
4441 Subt_Indic : constant Node_Id :=
4442 Subtype_Indication (Component_Definition (Comp_Decl));
4447 if Nkind (Subt_Indic) = N_Subtype_Indication then
4448 Constr := Constraint (Subt_Indic);
4450 if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
4451 Assn := First (Constraints (Constr));
4452 while Present (Assn) loop
4453 case Nkind (Assn) is
4454 when N_Subtype_Indication |
4458 if Depends_On_Discriminant (Assn) then
4462 when N_Discriminant_Association =>
4463 if Depends_On_Discriminant (Expression (Assn)) then
4478 end Has_Discriminant_Dependent_Constraint;
4480 --------------------
4481 -- Has_Infinities --
4482 --------------------
4484 function Has_Infinities (E : Entity_Id) return Boolean is
4487 Is_Floating_Point_Type (E)
4488 and then Nkind (Scalar_Range (E)) = N_Range
4489 and then Includes_Infinities (Scalar_Range (E));
4492 --------------------
4493 -- Has_Interfaces --
4494 --------------------
4496 function Has_Interfaces
4498 Use_Full_View : Boolean := True) return Boolean
4503 -- Handle concurrent types
4505 if Is_Concurrent_Type (T) then
4506 Typ := Corresponding_Record_Type (T);
4511 if not Present (Typ)
4512 or else not Is_Record_Type (Typ)
4513 or else not Is_Tagged_Type (Typ)
4518 -- Handle private types
4521 and then Present (Full_View (Typ))
4523 Typ := Full_View (Typ);
4526 -- Handle concurrent record types
4528 if Is_Concurrent_Record_Type (Typ)
4529 and then Is_Non_Empty_List (Abstract_Interface_List (Typ))
4535 if Is_Interface (Typ)
4537 (Is_Record_Type (Typ)
4538 and then Present (Interfaces (Typ))
4539 and then not Is_Empty_Elmt_List (Interfaces (Typ)))
4544 exit when Etype (Typ) = Typ
4546 -- Handle private types
4548 or else (Present (Full_View (Etype (Typ)))
4549 and then Full_View (Etype (Typ)) = Typ)
4551 -- Protect the frontend against wrong source with cyclic
4554 or else Etype (Typ) = T;
4556 -- Climb to the ancestor type handling private types
4558 if Present (Full_View (Etype (Typ))) then
4559 Typ := Full_View (Etype (Typ));
4568 ------------------------
4569 -- Has_Null_Exclusion --
4570 ------------------------
4572 function Has_Null_Exclusion (N : Node_Id) return Boolean is
4575 when N_Access_Definition |
4576 N_Access_Function_Definition |
4577 N_Access_Procedure_Definition |
4578 N_Access_To_Object_Definition |
4580 N_Derived_Type_Definition |
4581 N_Function_Specification |
4582 N_Subtype_Declaration =>
4583 return Null_Exclusion_Present (N);
4585 when N_Component_Definition |
4586 N_Formal_Object_Declaration |
4587 N_Object_Renaming_Declaration =>
4588 if Present (Subtype_Mark (N)) then
4589 return Null_Exclusion_Present (N);
4590 else pragma Assert (Present (Access_Definition (N)));
4591 return Null_Exclusion_Present (Access_Definition (N));
4594 when N_Discriminant_Specification =>
4595 if Nkind (Discriminant_Type (N)) = N_Access_Definition then
4596 return Null_Exclusion_Present (Discriminant_Type (N));
4598 return Null_Exclusion_Present (N);
4601 when N_Object_Declaration =>
4602 if Nkind (Object_Definition (N)) = N_Access_Definition then
4603 return Null_Exclusion_Present (Object_Definition (N));
4605 return Null_Exclusion_Present (N);
4608 when N_Parameter_Specification =>
4609 if Nkind (Parameter_Type (N)) = N_Access_Definition then
4610 return Null_Exclusion_Present (Parameter_Type (N));
4612 return Null_Exclusion_Present (N);
4619 end Has_Null_Exclusion;
4621 ------------------------
4622 -- Has_Null_Extension --
4623 ------------------------
4625 function Has_Null_Extension (T : Entity_Id) return Boolean is
4626 B : constant Entity_Id := Base_Type (T);
4631 if Nkind (Parent (B)) = N_Full_Type_Declaration
4632 and then Present (Record_Extension_Part (Type_Definition (Parent (B))))
4634 Ext := Record_Extension_Part (Type_Definition (Parent (B)));
4636 if Present (Ext) then
4637 if Null_Present (Ext) then
4640 Comps := Component_List (Ext);
4642 -- The null component list is rewritten during analysis to
4643 -- include the parent component. Any other component indicates
4644 -- that the extension was not originally null.
4646 return Null_Present (Comps)
4647 or else No (Next (First (Component_Items (Comps))));
4656 end Has_Null_Extension;
4658 -------------------------------
4659 -- Has_Overriding_Initialize --
4660 -------------------------------
4662 function Has_Overriding_Initialize (T : Entity_Id) return Boolean is
4663 BT : constant Entity_Id := Base_Type (T);
4668 if Is_Controlled (BT) then
4670 -- For derived types, check immediate ancestor, excluding
4671 -- Controlled itself.
4673 if Is_Derived_Type (BT)
4674 and then not In_Predefined_Unit (Etype (BT))
4675 and then Has_Overriding_Initialize (Etype (BT))
4679 elsif Present (Primitive_Operations (BT)) then
4680 P := First_Elmt (Primitive_Operations (BT));
4681 while Present (P) loop
4682 if Chars (Node (P)) = Name_Initialize
4683 and then Comes_From_Source (Node (P))
4694 elsif Has_Controlled_Component (BT) then
4695 Comp := First_Component (BT);
4696 while Present (Comp) loop
4697 if Has_Overriding_Initialize (Etype (Comp)) then
4701 Next_Component (Comp);
4709 end Has_Overriding_Initialize;
4711 --------------------------------------
4712 -- Has_Preelaborable_Initialization --
4713 --------------------------------------
4715 function Has_Preelaborable_Initialization (E : Entity_Id) return Boolean is
4718 procedure Check_Components (E : Entity_Id);
4719 -- Check component/discriminant chain, sets Has_PE False if a component
4720 -- or discriminant does not meet the preelaborable initialization rules.
4722 ----------------------
4723 -- Check_Components --
4724 ----------------------
4726 procedure Check_Components (E : Entity_Id) is
4730 function Is_Preelaborable_Expression (N : Node_Id) return Boolean;
4731 -- Returns True if and only if the expression denoted by N does not
4732 -- violate restrictions on preelaborable constructs (RM-10.2.1(5-9)).
4734 ---------------------------------
4735 -- Is_Preelaborable_Expression --
4736 ---------------------------------
4738 function Is_Preelaborable_Expression (N : Node_Id) return Boolean is
4742 Comp_Type : Entity_Id;
4743 Is_Array_Aggr : Boolean;
4746 if Is_Static_Expression (N) then
4749 elsif Nkind (N) = N_Null then
4752 -- Attributes are allowed in general, even if their prefix is a
4753 -- formal type. (It seems that certain attributes known not to be
4754 -- static might not be allowed, but there are no rules to prevent
4757 elsif Nkind (N) = N_Attribute_Reference then
4760 -- The name of a discriminant evaluated within its parent type is
4761 -- defined to be preelaborable (10.2.1(8)). Note that we test for
4762 -- names that denote discriminals as well as discriminants to
4763 -- catch references occurring within init procs.
4765 elsif Is_Entity_Name (N)
4767 (Ekind (Entity (N)) = E_Discriminant
4769 ((Ekind (Entity (N)) = E_Constant
4770 or else Ekind (Entity (N)) = E_In_Parameter)
4771 and then Present (Discriminal_Link (Entity (N)))))
4775 elsif Nkind (N) = N_Qualified_Expression then
4776 return Is_Preelaborable_Expression (Expression (N));
4778 -- For aggregates we have to check that each of the associations
4779 -- is preelaborable.
4781 elsif Nkind (N) = N_Aggregate
4782 or else Nkind (N) = N_Extension_Aggregate
4784 Is_Array_Aggr := Is_Array_Type (Etype (N));
4786 if Is_Array_Aggr then
4787 Comp_Type := Component_Type (Etype (N));
4790 -- Check the ancestor part of extension aggregates, which must
4791 -- be either the name of a type that has preelaborable init or
4792 -- an expression that is preelaborable.
4794 if Nkind (N) = N_Extension_Aggregate then
4796 Anc_Part : constant Node_Id := Ancestor_Part (N);
4799 if Is_Entity_Name (Anc_Part)
4800 and then Is_Type (Entity (Anc_Part))
4802 if not Has_Preelaborable_Initialization
4808 elsif not Is_Preelaborable_Expression (Anc_Part) then
4814 -- Check positional associations
4816 Exp := First (Expressions (N));
4817 while Present (Exp) loop
4818 if not Is_Preelaborable_Expression (Exp) then
4825 -- Check named associations
4827 Assn := First (Component_Associations (N));
4828 while Present (Assn) loop
4829 Choice := First (Choices (Assn));
4830 while Present (Choice) loop
4831 if Is_Array_Aggr then
4832 if Nkind (Choice) = N_Others_Choice then
4835 elsif Nkind (Choice) = N_Range then
4836 if not Is_Static_Range (Choice) then
4840 elsif not Is_Static_Expression (Choice) then
4845 Comp_Type := Etype (Choice);
4851 -- If the association has a <> at this point, then we have
4852 -- to check whether the component's type has preelaborable
4853 -- initialization. Note that this only occurs when the
4854 -- association's corresponding component does not have a
4855 -- default expression, the latter case having already been
4856 -- expanded as an expression for the association.
4858 if Box_Present (Assn) then
4859 if not Has_Preelaborable_Initialization (Comp_Type) then
4863 -- In the expression case we check whether the expression
4864 -- is preelaborable.
4867 not Is_Preelaborable_Expression (Expression (Assn))
4875 -- If we get here then aggregate as a whole is preelaborable
4879 -- All other cases are not preelaborable
4884 end Is_Preelaborable_Expression;
4886 -- Start of processing for Check_Components
4889 -- Loop through entities of record or protected type
4892 while Present (Ent) loop
4894 -- We are interested only in components and discriminants
4896 if Ekind_In (Ent, E_Component, E_Discriminant) then
4898 -- Get default expression if any. If there is no declaration
4899 -- node, it means we have an internal entity. The parent and
4900 -- tag fields are examples of such entities. For these cases,
4901 -- we just test the type of the entity.
4903 if Present (Declaration_Node (Ent)) then
4904 Exp := Expression (Declaration_Node (Ent));
4909 -- A component has PI if it has no default expression and the
4910 -- component type has PI.
4913 if not Has_Preelaborable_Initialization (Etype (Ent)) then
4918 -- Require the default expression to be preelaborable
4920 elsif not Is_Preelaborable_Expression (Exp) then
4928 end Check_Components;
4930 -- Start of processing for Has_Preelaborable_Initialization
4933 -- Immediate return if already marked as known preelaborable init. This
4934 -- covers types for which this function has already been called once
4935 -- and returned True (in which case the result is cached), and also
4936 -- types to which a pragma Preelaborable_Initialization applies.
4938 if Known_To_Have_Preelab_Init (E) then
4942 -- If the type is a subtype representing a generic actual type, then
4943 -- test whether its base type has preelaborable initialization since
4944 -- the subtype representing the actual does not inherit this attribute
4945 -- from the actual or formal. (but maybe it should???)
4947 if Is_Generic_Actual_Type (E) then
4948 return Has_Preelaborable_Initialization (Base_Type (E));
4951 -- All elementary types have preelaborable initialization
4953 if Is_Elementary_Type (E) then
4956 -- Array types have PI if the component type has PI
4958 elsif Is_Array_Type (E) then
4959 Has_PE := Has_Preelaborable_Initialization (Component_Type (E));
4961 -- A derived type has preelaborable initialization if its parent type
4962 -- has preelaborable initialization and (in the case of a derived record
4963 -- extension) if the non-inherited components all have preelaborable
4964 -- initialization. However, a user-defined controlled type with an
4965 -- overriding Initialize procedure does not have preelaborable
4968 elsif Is_Derived_Type (E) then
4970 -- If the derived type is a private extension then it doesn't have
4971 -- preelaborable initialization.
4973 if Ekind (Base_Type (E)) = E_Record_Type_With_Private then
4977 -- First check whether ancestor type has preelaborable initialization
4979 Has_PE := Has_Preelaborable_Initialization (Etype (Base_Type (E)));
4981 -- If OK, check extension components (if any)
4983 if Has_PE and then Is_Record_Type (E) then
4984 Check_Components (First_Entity (E));
4987 -- Check specifically for 10.2.1(11.4/2) exception: a controlled type
4988 -- with a user defined Initialize procedure does not have PI.
4991 and then Is_Controlled (E)
4992 and then Has_Overriding_Initialize (E)
4997 -- Private types not derived from a type having preelaborable init and
4998 -- that are not marked with pragma Preelaborable_Initialization do not
4999 -- have preelaborable initialization.
5001 elsif Is_Private_Type (E) then
5004 -- Record type has PI if it is non private and all components have PI
5006 elsif Is_Record_Type (E) then
5008 Check_Components (First_Entity (E));
5010 -- Protected types must not have entries, and components must meet
5011 -- same set of rules as for record components.
5013 elsif Is_Protected_Type (E) then
5014 if Has_Entries (E) then
5018 Check_Components (First_Entity (E));
5019 Check_Components (First_Private_Entity (E));
5022 -- Type System.Address always has preelaborable initialization
5024 elsif Is_RTE (E, RE_Address) then
5027 -- In all other cases, type does not have preelaborable initialization
5033 -- If type has preelaborable initialization, cache result
5036 Set_Known_To_Have_Preelab_Init (E);
5040 end Has_Preelaborable_Initialization;
5042 ---------------------------
5043 -- Has_Private_Component --
5044 ---------------------------
5046 function Has_Private_Component (Type_Id : Entity_Id) return Boolean is
5047 Btype : Entity_Id := Base_Type (Type_Id);
5048 Component : Entity_Id;
5051 if Error_Posted (Type_Id)
5052 or else Error_Posted (Btype)
5057 if Is_Class_Wide_Type (Btype) then
5058 Btype := Root_Type (Btype);
5061 if Is_Private_Type (Btype) then
5063 UT : constant Entity_Id := Underlying_Type (Btype);
5066 if No (Full_View (Btype)) then
5067 return not Is_Generic_Type (Btype)
5068 and then not Is_Generic_Type (Root_Type (Btype));
5070 return not Is_Generic_Type (Root_Type (Full_View (Btype)));
5073 return not Is_Frozen (UT) and then Has_Private_Component (UT);
5077 elsif Is_Array_Type (Btype) then
5078 return Has_Private_Component (Component_Type (Btype));
5080 elsif Is_Record_Type (Btype) then
5081 Component := First_Component (Btype);
5082 while Present (Component) loop
5083 if Has_Private_Component (Etype (Component)) then
5087 Next_Component (Component);
5092 elsif Is_Protected_Type (Btype)
5093 and then Present (Corresponding_Record_Type (Btype))
5095 return Has_Private_Component (Corresponding_Record_Type (Btype));
5100 end Has_Private_Component;
5106 function Has_Stream (T : Entity_Id) return Boolean is
5113 elsif Is_RTE (Root_Type (T), RE_Root_Stream_Type) then
5116 elsif Is_Array_Type (T) then
5117 return Has_Stream (Component_Type (T));
5119 elsif Is_Record_Type (T) then
5120 E := First_Component (T);
5121 while Present (E) loop
5122 if Has_Stream (Etype (E)) then
5131 elsif Is_Private_Type (T) then
5132 return Has_Stream (Underlying_Type (T));
5139 --------------------------
5140 -- Has_Tagged_Component --
5141 --------------------------
5143 function Has_Tagged_Component (Typ : Entity_Id) return Boolean is
5147 if Is_Private_Type (Typ)
5148 and then Present (Underlying_Type (Typ))
5150 return Has_Tagged_Component (Underlying_Type (Typ));
5152 elsif Is_Array_Type (Typ) then
5153 return Has_Tagged_Component (Component_Type (Typ));
5155 elsif Is_Tagged_Type (Typ) then
5158 elsif Is_Record_Type (Typ) then
5159 Comp := First_Component (Typ);
5160 while Present (Comp) loop
5161 if Has_Tagged_Component (Etype (Comp)) then
5165 Next_Component (Comp);
5173 end Has_Tagged_Component;
5175 --------------------------
5176 -- Implements_Interface --
5177 --------------------------
5179 function Implements_Interface
5180 (Typ_Ent : Entity_Id;
5181 Iface_Ent : Entity_Id;
5182 Exclude_Parents : Boolean := False) return Boolean
5184 Ifaces_List : Elist_Id;
5186 Iface : Entity_Id := Base_Type (Iface_Ent);
5187 Typ : Entity_Id := Base_Type (Typ_Ent);
5190 if Is_Class_Wide_Type (Typ) then
5191 Typ := Root_Type (Typ);
5194 if not Has_Interfaces (Typ) then
5198 if Is_Class_Wide_Type (Iface) then
5199 Iface := Root_Type (Iface);
5202 Collect_Interfaces (Typ, Ifaces_List);
5204 Elmt := First_Elmt (Ifaces_List);
5205 while Present (Elmt) loop
5206 if Is_Ancestor (Node (Elmt), Typ)
5207 and then Exclude_Parents
5211 elsif Node (Elmt) = Iface then
5219 end Implements_Interface;
5225 function In_Instance return Boolean is
5226 Curr_Unit : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
5232 and then S /= Standard_Standard
5234 if (Ekind (S) = E_Function
5235 or else Ekind (S) = E_Package
5236 or else Ekind (S) = E_Procedure)
5237 and then Is_Generic_Instance (S)
5239 -- A child instance is always compiled in the context of a parent
5240 -- instance. Nevertheless, the actuals are not analyzed in an
5241 -- instance context. We detect this case by examining the current
5242 -- compilation unit, which must be a child instance, and checking
5243 -- that it is not currently on the scope stack.
5245 if Is_Child_Unit (Curr_Unit)
5247 Nkind (Unit (Cunit (Current_Sem_Unit)))
5248 = N_Package_Instantiation
5249 and then not In_Open_Scopes (Curr_Unit)
5263 ----------------------
5264 -- In_Instance_Body --
5265 ----------------------
5267 function In_Instance_Body return Boolean is
5273 and then S /= Standard_Standard
5275 if (Ekind (S) = E_Function
5276 or else Ekind (S) = E_Procedure)
5277 and then Is_Generic_Instance (S)
5281 elsif Ekind (S) = E_Package
5282 and then In_Package_Body (S)
5283 and then Is_Generic_Instance (S)
5292 end In_Instance_Body;
5294 -----------------------------
5295 -- In_Instance_Not_Visible --
5296 -----------------------------
5298 function In_Instance_Not_Visible return Boolean is
5304 and then S /= Standard_Standard
5306 if (Ekind (S) = E_Function
5307 or else Ekind (S) = E_Procedure)
5308 and then Is_Generic_Instance (S)
5312 elsif Ekind (S) = E_Package
5313 and then (In_Package_Body (S) or else In_Private_Part (S))
5314 and then Is_Generic_Instance (S)
5323 end In_Instance_Not_Visible;
5325 ------------------------------
5326 -- In_Instance_Visible_Part --
5327 ------------------------------
5329 function In_Instance_Visible_Part return Boolean is
5335 and then S /= Standard_Standard
5337 if Ekind (S) = E_Package
5338 and then Is_Generic_Instance (S)
5339 and then not In_Package_Body (S)
5340 and then not In_Private_Part (S)
5349 end In_Instance_Visible_Part;
5351 ---------------------
5352 -- In_Package_Body --
5353 ---------------------
5355 function In_Package_Body return Boolean is
5361 and then S /= Standard_Standard
5363 if Ekind (S) = E_Package
5364 and then In_Package_Body (S)
5373 end In_Package_Body;
5375 --------------------------------
5376 -- In_Parameter_Specification --
5377 --------------------------------
5379 function In_Parameter_Specification (N : Node_Id) return Boolean is
5384 while Present (PN) loop
5385 if Nkind (PN) = N_Parameter_Specification then
5393 end In_Parameter_Specification;
5395 --------------------------------------
5396 -- In_Subprogram_Or_Concurrent_Unit --
5397 --------------------------------------
5399 function In_Subprogram_Or_Concurrent_Unit return Boolean is
5404 -- Use scope chain to check successively outer scopes
5410 if K in Subprogram_Kind
5411 or else K in Concurrent_Kind
5412 or else K in Generic_Subprogram_Kind
5416 elsif E = Standard_Standard then
5422 end In_Subprogram_Or_Concurrent_Unit;
5424 ---------------------
5425 -- In_Visible_Part --
5426 ---------------------
5428 function In_Visible_Part (Scope_Id : Entity_Id) return Boolean is
5431 Is_Package_Or_Generic_Package (Scope_Id)
5432 and then In_Open_Scopes (Scope_Id)
5433 and then not In_Package_Body (Scope_Id)
5434 and then not In_Private_Part (Scope_Id);
5435 end In_Visible_Part;
5437 ---------------------------------
5438 -- Insert_Explicit_Dereference --
5439 ---------------------------------
5441 procedure Insert_Explicit_Dereference (N : Node_Id) is
5442 New_Prefix : constant Node_Id := Relocate_Node (N);
5443 Ent : Entity_Id := Empty;
5450 Save_Interps (N, New_Prefix);
5452 -- Check if the node relocation requires readjustment of some SCIL
5453 -- dispatching node.
5456 and then Nkind (N) = N_Function_Call
5458 Adjust_SCIL_Node (N, New_Prefix);
5461 Rewrite (N, Make_Explicit_Dereference (Sloc (N), Prefix => New_Prefix));
5463 Set_Etype (N, Designated_Type (Etype (New_Prefix)));
5465 if Is_Overloaded (New_Prefix) then
5467 -- The dereference is also overloaded, and its interpretations are
5468 -- the designated types of the interpretations of the original node.
5470 Set_Etype (N, Any_Type);
5472 Get_First_Interp (New_Prefix, I, It);
5473 while Present (It.Nam) loop
5476 if Is_Access_Type (T) then
5477 Add_One_Interp (N, Designated_Type (T), Designated_Type (T));
5480 Get_Next_Interp (I, It);
5486 -- Prefix is unambiguous: mark the original prefix (which might
5487 -- Come_From_Source) as a reference, since the new (relocated) one
5488 -- won't be taken into account.
5490 if Is_Entity_Name (New_Prefix) then
5491 Ent := Entity (New_Prefix);
5493 -- For a retrieval of a subcomponent of some composite object,
5494 -- retrieve the ultimate entity if there is one.
5496 elsif Nkind (New_Prefix) = N_Selected_Component
5497 or else Nkind (New_Prefix) = N_Indexed_Component
5499 Pref := Prefix (New_Prefix);
5500 while Present (Pref)
5502 (Nkind (Pref) = N_Selected_Component
5503 or else Nkind (Pref) = N_Indexed_Component)
5505 Pref := Prefix (Pref);
5508 if Present (Pref) and then Is_Entity_Name (Pref) then
5509 Ent := Entity (Pref);
5513 if Present (Ent) then
5514 Generate_Reference (Ent, New_Prefix);
5517 end Insert_Explicit_Dereference;
5519 ------------------------------------------
5520 -- Inspect_Deferred_Constant_Completion --
5521 ------------------------------------------
5523 procedure Inspect_Deferred_Constant_Completion (Decls : List_Id) is
5527 Decl := First (Decls);
5528 while Present (Decl) loop
5530 -- Deferred constant signature
5532 if Nkind (Decl) = N_Object_Declaration
5533 and then Constant_Present (Decl)
5534 and then No (Expression (Decl))
5536 -- No need to check internally generated constants
5538 and then Comes_From_Source (Decl)
5540 -- The constant is not completed. A full object declaration
5541 -- or a pragma Import complete a deferred constant.
5543 and then not Has_Completion (Defining_Identifier (Decl))
5546 ("constant declaration requires initialization expression",
5547 Defining_Identifier (Decl));
5550 Decl := Next (Decl);
5552 end Inspect_Deferred_Constant_Completion;
5558 function Is_AAMP_Float (E : Entity_Id) return Boolean is
5559 pragma Assert (Is_Type (E));
5561 return AAMP_On_Target
5562 and then Is_Floating_Point_Type (E)
5563 and then E = Base_Type (E);
5566 -----------------------------
5567 -- Is_Actual_Out_Parameter --
5568 -----------------------------
5570 function Is_Actual_Out_Parameter (N : Node_Id) return Boolean is
5574 Find_Actual (N, Formal, Call);
5575 return Present (Formal)
5576 and then Ekind (Formal) = E_Out_Parameter;
5577 end Is_Actual_Out_Parameter;
5579 -------------------------
5580 -- Is_Actual_Parameter --
5581 -------------------------
5583 function Is_Actual_Parameter (N : Node_Id) return Boolean is
5584 PK : constant Node_Kind := Nkind (Parent (N));
5588 when N_Parameter_Association =>
5589 return N = Explicit_Actual_Parameter (Parent (N));
5591 when N_Function_Call | N_Procedure_Call_Statement =>
5592 return Is_List_Member (N)
5594 List_Containing (N) = Parameter_Associations (Parent (N));
5599 end Is_Actual_Parameter;
5601 ---------------------
5602 -- Is_Aliased_View --
5603 ---------------------
5605 function Is_Aliased_View (Obj : Node_Id) return Boolean is
5609 if Is_Entity_Name (Obj) then
5617 or else (Present (Renamed_Object (E))
5618 and then Is_Aliased_View (Renamed_Object (E)))))
5620 or else ((Is_Formal (E)
5621 or else Ekind (E) = E_Generic_In_Out_Parameter
5622 or else Ekind (E) = E_Generic_In_Parameter)
5623 and then Is_Tagged_Type (Etype (E)))
5625 or else (Is_Concurrent_Type (E)
5626 and then In_Open_Scopes (E))
5628 -- Current instance of type, either directly or as rewritten
5629 -- reference to the current object.
5631 or else (Is_Entity_Name (Original_Node (Obj))
5632 and then Present (Entity (Original_Node (Obj)))
5633 and then Is_Type (Entity (Original_Node (Obj))))
5635 or else (Is_Type (E) and then E = Current_Scope)
5637 or else (Is_Incomplete_Or_Private_Type (E)
5638 and then Full_View (E) = Current_Scope);
5640 elsif Nkind (Obj) = N_Selected_Component then
5641 return Is_Aliased (Entity (Selector_Name (Obj)));
5643 elsif Nkind (Obj) = N_Indexed_Component then
5644 return Has_Aliased_Components (Etype (Prefix (Obj)))
5646 (Is_Access_Type (Etype (Prefix (Obj)))
5648 Has_Aliased_Components
5649 (Designated_Type (Etype (Prefix (Obj)))));
5651 elsif Nkind (Obj) = N_Unchecked_Type_Conversion
5652 or else Nkind (Obj) = N_Type_Conversion
5654 return Is_Tagged_Type (Etype (Obj))
5655 and then Is_Aliased_View (Expression (Obj));
5657 elsif Nkind (Obj) = N_Explicit_Dereference then
5658 return Nkind (Original_Node (Obj)) /= N_Function_Call;
5663 end Is_Aliased_View;
5665 -------------------------
5666 -- Is_Ancestor_Package --
5667 -------------------------
5669 function Is_Ancestor_Package
5671 E2 : Entity_Id) return Boolean
5678 and then Par /= Standard_Standard
5688 end Is_Ancestor_Package;
5690 ----------------------
5691 -- Is_Atomic_Object --
5692 ----------------------
5694 function Is_Atomic_Object (N : Node_Id) return Boolean is
5696 function Object_Has_Atomic_Components (N : Node_Id) return Boolean;
5697 -- Determines if given object has atomic components
5699 function Is_Atomic_Prefix (N : Node_Id) return Boolean;
5700 -- If prefix is an implicit dereference, examine designated type
5702 ----------------------
5703 -- Is_Atomic_Prefix --
5704 ----------------------
5706 function Is_Atomic_Prefix (N : Node_Id) return Boolean is
5708 if Is_Access_Type (Etype (N)) then
5710 Has_Atomic_Components (Designated_Type (Etype (N)));
5712 return Object_Has_Atomic_Components (N);
5714 end Is_Atomic_Prefix;
5716 ----------------------------------
5717 -- Object_Has_Atomic_Components --
5718 ----------------------------------
5720 function Object_Has_Atomic_Components (N : Node_Id) return Boolean is
5722 if Has_Atomic_Components (Etype (N))
5723 or else Is_Atomic (Etype (N))
5727 elsif Is_Entity_Name (N)
5728 and then (Has_Atomic_Components (Entity (N))
5729 or else Is_Atomic (Entity (N)))
5733 elsif Nkind (N) = N_Indexed_Component
5734 or else Nkind (N) = N_Selected_Component
5736 return Is_Atomic_Prefix (Prefix (N));
5741 end Object_Has_Atomic_Components;
5743 -- Start of processing for Is_Atomic_Object
5746 -- Predicate is not relevant to subprograms
5748 if Is_Entity_Name (N)
5749 and then Is_Overloadable (Entity (N))
5753 elsif Is_Atomic (Etype (N))
5754 or else (Is_Entity_Name (N) and then Is_Atomic (Entity (N)))
5758 elsif Nkind (N) = N_Indexed_Component
5759 or else Nkind (N) = N_Selected_Component
5761 return Is_Atomic_Prefix (Prefix (N));
5766 end Is_Atomic_Object;
5768 -------------------------
5769 -- Is_Coextension_Root --
5770 -------------------------
5772 function Is_Coextension_Root (N : Node_Id) return Boolean is
5775 Nkind (N) = N_Allocator
5776 and then Present (Coextensions (N))
5778 -- Anonymous access discriminants carry a list of all nested
5779 -- controlled coextensions.
5781 and then not Is_Dynamic_Coextension (N)
5782 and then not Is_Static_Coextension (N);
5783 end Is_Coextension_Root;
5785 -----------------------------
5786 -- Is_Concurrent_Interface --
5787 -----------------------------
5789 function Is_Concurrent_Interface (T : Entity_Id) return Boolean is
5794 (Is_Protected_Interface (T)
5795 or else Is_Synchronized_Interface (T)
5796 or else Is_Task_Interface (T));
5797 end Is_Concurrent_Interface;
5799 --------------------------------------
5800 -- Is_Controlling_Limited_Procedure --
5801 --------------------------------------
5803 function Is_Controlling_Limited_Procedure
5804 (Proc_Nam : Entity_Id) return Boolean
5806 Param_Typ : Entity_Id := Empty;
5809 if Ekind (Proc_Nam) = E_Procedure
5810 and then Present (Parameter_Specifications (Parent (Proc_Nam)))
5812 Param_Typ := Etype (Parameter_Type (First (
5813 Parameter_Specifications (Parent (Proc_Nam)))));
5815 -- In this case where an Itype was created, the procedure call has been
5818 elsif Present (Associated_Node_For_Itype (Proc_Nam))
5819 and then Present (Original_Node (Associated_Node_For_Itype (Proc_Nam)))
5821 Present (Parameter_Associations
5822 (Associated_Node_For_Itype (Proc_Nam)))
5825 Etype (First (Parameter_Associations
5826 (Associated_Node_For_Itype (Proc_Nam))));
5829 if Present (Param_Typ) then
5831 Is_Interface (Param_Typ)
5832 and then Is_Limited_Record (Param_Typ);
5836 end Is_Controlling_Limited_Procedure;
5838 -----------------------------
5839 -- Is_CPP_Constructor_Call --
5840 -----------------------------
5842 function Is_CPP_Constructor_Call (N : Node_Id) return Boolean is
5844 return Nkind (N) = N_Function_Call
5845 and then Is_CPP_Class (Etype (Etype (N)))
5846 and then Is_Constructor (Entity (Name (N)))
5847 and then Is_Imported (Entity (Name (N)));
5848 end Is_CPP_Constructor_Call;
5850 ----------------------------------------------
5851 -- Is_Dependent_Component_Of_Mutable_Object --
5852 ----------------------------------------------
5854 function Is_Dependent_Component_Of_Mutable_Object
5855 (Object : Node_Id) return Boolean
5858 Prefix_Type : Entity_Id;
5859 P_Aliased : Boolean := False;
5862 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean;
5863 -- Returns True if and only if Comp is declared within a variant part
5865 --------------------------------
5866 -- Is_Declared_Within_Variant --
5867 --------------------------------
5869 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean is
5870 Comp_Decl : constant Node_Id := Parent (Comp);
5871 Comp_List : constant Node_Id := Parent (Comp_Decl);
5873 return Nkind (Parent (Comp_List)) = N_Variant;
5874 end Is_Declared_Within_Variant;
5876 -- Start of processing for Is_Dependent_Component_Of_Mutable_Object
5879 if Is_Variable (Object) then
5881 if Nkind (Object) = N_Selected_Component then
5882 P := Prefix (Object);
5883 Prefix_Type := Etype (P);
5885 if Is_Entity_Name (P) then
5887 if Ekind (Entity (P)) = E_Generic_In_Out_Parameter then
5888 Prefix_Type := Base_Type (Prefix_Type);
5891 if Is_Aliased (Entity (P)) then
5895 -- A discriminant check on a selected component may be
5896 -- expanded into a dereference when removing side-effects.
5897 -- Recover the original node and its type, which may be
5900 elsif Nkind (P) = N_Explicit_Dereference
5901 and then not (Comes_From_Source (P))
5903 P := Original_Node (P);
5904 Prefix_Type := Etype (P);
5907 -- Check for prefix being an aliased component ???
5912 -- A heap object is constrained by its initial value
5914 -- Ada 2005 (AI-363): Always assume the object could be mutable in
5915 -- the dereferenced case, since the access value might denote an
5916 -- unconstrained aliased object, whereas in Ada 95 the designated
5917 -- object is guaranteed to be constrained. A worst-case assumption
5918 -- has to apply in Ada 2005 because we can't tell at compile time
5919 -- whether the object is "constrained by its initial value"
5920 -- (despite the fact that 3.10.2(26/2) and 8.5.1(5/2) are
5921 -- semantic rules -- these rules are acknowledged to need fixing).
5923 if Ada_Version < Ada_05 then
5924 if Is_Access_Type (Prefix_Type)
5925 or else Nkind (P) = N_Explicit_Dereference
5930 elsif Ada_Version >= Ada_05 then
5931 if Is_Access_Type (Prefix_Type) then
5933 -- If the access type is pool-specific, and there is no
5934 -- constrained partial view of the designated type, then the
5935 -- designated object is known to be constrained.
5937 if Ekind (Prefix_Type) = E_Access_Type
5938 and then not Has_Constrained_Partial_View
5939 (Designated_Type (Prefix_Type))
5943 -- Otherwise (general access type, or there is a constrained
5944 -- partial view of the designated type), we need to check
5945 -- based on the designated type.
5948 Prefix_Type := Designated_Type (Prefix_Type);
5954 Original_Record_Component (Entity (Selector_Name (Object)));
5956 -- As per AI-0017, the renaming is illegal in a generic body,
5957 -- even if the subtype is indefinite.
5959 -- Ada 2005 (AI-363): In Ada 2005 an aliased object can be mutable
5961 if not Is_Constrained (Prefix_Type)
5962 and then (not Is_Indefinite_Subtype (Prefix_Type)
5964 (Is_Generic_Type (Prefix_Type)
5965 and then Ekind (Current_Scope) = E_Generic_Package
5966 and then In_Package_Body (Current_Scope)))
5968 and then (Is_Declared_Within_Variant (Comp)
5969 or else Has_Discriminant_Dependent_Constraint (Comp))
5970 and then (not P_Aliased or else Ada_Version >= Ada_05)
5976 Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
5980 elsif Nkind (Object) = N_Indexed_Component
5981 or else Nkind (Object) = N_Slice
5983 return Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
5985 -- A type conversion that Is_Variable is a view conversion:
5986 -- go back to the denoted object.
5988 elsif Nkind (Object) = N_Type_Conversion then
5990 Is_Dependent_Component_Of_Mutable_Object (Expression (Object));
5995 end Is_Dependent_Component_Of_Mutable_Object;
5997 ---------------------
5998 -- Is_Dereferenced --
5999 ---------------------
6001 function Is_Dereferenced (N : Node_Id) return Boolean is
6002 P : constant Node_Id := Parent (N);
6005 (Nkind (P) = N_Selected_Component
6007 Nkind (P) = N_Explicit_Dereference
6009 Nkind (P) = N_Indexed_Component
6011 Nkind (P) = N_Slice)
6012 and then Prefix (P) = N;
6013 end Is_Dereferenced;
6015 ----------------------
6016 -- Is_Descendent_Of --
6017 ----------------------
6019 function Is_Descendent_Of (T1 : Entity_Id; T2 : Entity_Id) return Boolean is
6024 pragma Assert (Nkind (T1) in N_Entity);
6025 pragma Assert (Nkind (T2) in N_Entity);
6027 T := Base_Type (T1);
6029 -- Immediate return if the types match
6034 -- Comment needed here ???
6036 elsif Ekind (T) = E_Class_Wide_Type then
6037 return Etype (T) = T2;
6045 -- Done if we found the type we are looking for
6050 -- Done if no more derivations to check
6057 -- Following test catches error cases resulting from prev errors
6059 elsif No (Etyp) then
6062 elsif Is_Private_Type (T) and then Etyp = Full_View (T) then
6065 elsif Is_Private_Type (Etyp) and then Full_View (Etyp) = T then
6069 T := Base_Type (Etyp);
6072 end Is_Descendent_Of;
6078 function Is_False (U : Uint) return Boolean is
6083 ---------------------------
6084 -- Is_Fixed_Model_Number --
6085 ---------------------------
6087 function Is_Fixed_Model_Number (U : Ureal; T : Entity_Id) return Boolean is
6088 S : constant Ureal := Small_Value (T);
6089 M : Urealp.Save_Mark;
6093 R := (U = UR_Trunc (U / S) * S);
6096 end Is_Fixed_Model_Number;
6098 -------------------------------
6099 -- Is_Fully_Initialized_Type --
6100 -------------------------------
6102 function Is_Fully_Initialized_Type (Typ : Entity_Id) return Boolean is
6104 if Is_Scalar_Type (Typ) then
6107 elsif Is_Access_Type (Typ) then
6110 elsif Is_Array_Type (Typ) then
6111 if Is_Fully_Initialized_Type (Component_Type (Typ)) then
6115 -- An interesting case, if we have a constrained type one of whose
6116 -- bounds is known to be null, then there are no elements to be
6117 -- initialized, so all the elements are initialized!
6119 if Is_Constrained (Typ) then
6122 Indx_Typ : Entity_Id;
6126 Indx := First_Index (Typ);
6127 while Present (Indx) loop
6128 if Etype (Indx) = Any_Type then
6131 -- If index is a range, use directly
6133 elsif Nkind (Indx) = N_Range then
6134 Lbd := Low_Bound (Indx);
6135 Hbd := High_Bound (Indx);
6138 Indx_Typ := Etype (Indx);
6140 if Is_Private_Type (Indx_Typ) then
6141 Indx_Typ := Full_View (Indx_Typ);
6144 if No (Indx_Typ) or else Etype (Indx_Typ) = Any_Type then
6147 Lbd := Type_Low_Bound (Indx_Typ);
6148 Hbd := Type_High_Bound (Indx_Typ);
6152 if Compile_Time_Known_Value (Lbd)
6153 and then Compile_Time_Known_Value (Hbd)
6155 if Expr_Value (Hbd) < Expr_Value (Lbd) then
6165 -- If no null indexes, then type is not fully initialized
6171 elsif Is_Record_Type (Typ) then
6172 if Has_Discriminants (Typ)
6174 Present (Discriminant_Default_Value (First_Discriminant (Typ)))
6175 and then Is_Fully_Initialized_Variant (Typ)
6180 -- Controlled records are considered to be fully initialized if
6181 -- there is a user defined Initialize routine. This may not be
6182 -- entirely correct, but as the spec notes, we are guessing here
6183 -- what is best from the point of view of issuing warnings.
6185 if Is_Controlled (Typ) then
6187 Utyp : constant Entity_Id := Underlying_Type (Typ);
6190 if Present (Utyp) then
6192 Init : constant Entity_Id :=
6194 (Underlying_Type (Typ), Name_Initialize));
6198 and then Comes_From_Source (Init)
6200 Is_Predefined_File_Name
6201 (File_Name (Get_Source_File_Index (Sloc (Init))))
6205 elsif Has_Null_Extension (Typ)
6207 Is_Fully_Initialized_Type
6208 (Etype (Base_Type (Typ)))
6217 -- Otherwise see if all record components are initialized
6223 Ent := First_Entity (Typ);
6224 while Present (Ent) loop
6225 if Chars (Ent) = Name_uController then
6228 elsif Ekind (Ent) = E_Component
6229 and then (No (Parent (Ent))
6230 or else No (Expression (Parent (Ent))))
6231 and then not Is_Fully_Initialized_Type (Etype (Ent))
6233 -- Special VM case for tag components, which need to be
6234 -- defined in this case, but are never initialized as VMs
6235 -- are using other dispatching mechanisms. Ignore this
6236 -- uninitialized case. Note that this applies both to the
6237 -- uTag entry and the main vtable pointer (CPP_Class case).
6239 and then (Tagged_Type_Expansion or else not Is_Tag (Ent))
6248 -- No uninitialized components, so type is fully initialized.
6249 -- Note that this catches the case of no components as well.
6253 elsif Is_Concurrent_Type (Typ) then
6256 elsif Is_Private_Type (Typ) then
6258 U : constant Entity_Id := Underlying_Type (Typ);
6264 return Is_Fully_Initialized_Type (U);
6271 end Is_Fully_Initialized_Type;
6273 ----------------------------------
6274 -- Is_Fully_Initialized_Variant --
6275 ----------------------------------
6277 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean is
6278 Loc : constant Source_Ptr := Sloc (Typ);
6279 Constraints : constant List_Id := New_List;
6280 Components : constant Elist_Id := New_Elmt_List;
6281 Comp_Elmt : Elmt_Id;
6283 Comp_List : Node_Id;
6285 Discr_Val : Node_Id;
6287 Report_Errors : Boolean;
6288 pragma Warnings (Off, Report_Errors);
6291 if Serious_Errors_Detected > 0 then
6295 if Is_Record_Type (Typ)
6296 and then Nkind (Parent (Typ)) = N_Full_Type_Declaration
6297 and then Nkind (Type_Definition (Parent (Typ))) = N_Record_Definition
6299 Comp_List := Component_List (Type_Definition (Parent (Typ)));
6301 Discr := First_Discriminant (Typ);
6302 while Present (Discr) loop
6303 if Nkind (Parent (Discr)) = N_Discriminant_Specification then
6304 Discr_Val := Expression (Parent (Discr));
6306 if Present (Discr_Val)
6307 and then Is_OK_Static_Expression (Discr_Val)
6309 Append_To (Constraints,
6310 Make_Component_Association (Loc,
6311 Choices => New_List (New_Occurrence_Of (Discr, Loc)),
6312 Expression => New_Copy (Discr_Val)));
6320 Next_Discriminant (Discr);
6325 Comp_List => Comp_List,
6326 Governed_By => Constraints,
6328 Report_Errors => Report_Errors);
6330 -- Check that each component present is fully initialized
6332 Comp_Elmt := First_Elmt (Components);
6333 while Present (Comp_Elmt) loop
6334 Comp_Id := Node (Comp_Elmt);
6336 if Ekind (Comp_Id) = E_Component
6337 and then (No (Parent (Comp_Id))
6338 or else No (Expression (Parent (Comp_Id))))
6339 and then not Is_Fully_Initialized_Type (Etype (Comp_Id))
6344 Next_Elmt (Comp_Elmt);
6349 elsif Is_Private_Type (Typ) then
6351 U : constant Entity_Id := Underlying_Type (Typ);
6357 return Is_Fully_Initialized_Variant (U);
6363 end Is_Fully_Initialized_Variant;
6369 -- We seem to have a lot of overlapping functions that do similar things
6370 -- (testing for left hand sides or lvalues???). Anyway, since this one is
6371 -- purely syntactic, it should be in Sem_Aux I would think???
6373 function Is_LHS (N : Node_Id) return Boolean is
6374 P : constant Node_Id := Parent (N);
6376 return Nkind (P) = N_Assignment_Statement
6377 and then Name (P) = N;
6380 ----------------------------
6381 -- Is_Inherited_Operation --
6382 ----------------------------
6384 function Is_Inherited_Operation (E : Entity_Id) return Boolean is
6385 Kind : constant Node_Kind := Nkind (Parent (E));
6387 pragma Assert (Is_Overloadable (E));
6388 return Kind = N_Full_Type_Declaration
6389 or else Kind = N_Private_Extension_Declaration
6390 or else Kind = N_Subtype_Declaration
6391 or else (Ekind (E) = E_Enumeration_Literal
6392 and then Is_Derived_Type (Etype (E)));
6393 end Is_Inherited_Operation;
6395 -----------------------------
6396 -- Is_Library_Level_Entity --
6397 -----------------------------
6399 function Is_Library_Level_Entity (E : Entity_Id) return Boolean is
6401 -- The following is a small optimization, and it also properly handles
6402 -- discriminals, which in task bodies might appear in expressions before
6403 -- the corresponding procedure has been created, and which therefore do
6404 -- not have an assigned scope.
6406 if Ekind (E) in Formal_Kind then
6410 -- Normal test is simply that the enclosing dynamic scope is Standard
6412 return Enclosing_Dynamic_Scope (E) = Standard_Standard;
6413 end Is_Library_Level_Entity;
6415 ---------------------------------
6416 -- Is_Local_Variable_Reference --
6417 ---------------------------------
6419 function Is_Local_Variable_Reference (Expr : Node_Id) return Boolean is
6421 if not Is_Entity_Name (Expr) then
6426 Ent : constant Entity_Id := Entity (Expr);
6427 Sub : constant Entity_Id := Enclosing_Subprogram (Ent);
6429 if not Ekind_In (Ent, E_Variable, E_In_Out_Parameter) then
6432 return Present (Sub) and then Sub = Current_Subprogram;
6436 end Is_Local_Variable_Reference;
6438 -------------------------
6439 -- Is_Object_Reference --
6440 -------------------------
6442 function Is_Object_Reference (N : Node_Id) return Boolean is
6444 if Is_Entity_Name (N) then
6445 return Present (Entity (N)) and then Is_Object (Entity (N));
6449 when N_Indexed_Component | N_Slice =>
6451 Is_Object_Reference (Prefix (N))
6452 or else Is_Access_Type (Etype (Prefix (N)));
6454 -- In Ada95, a function call is a constant object; a procedure
6457 when N_Function_Call =>
6458 return Etype (N) /= Standard_Void_Type;
6460 -- A reference to the stream attribute Input is a function call
6462 when N_Attribute_Reference =>
6463 return Attribute_Name (N) = Name_Input;
6465 when N_Selected_Component =>
6467 Is_Object_Reference (Selector_Name (N))
6469 (Is_Object_Reference (Prefix (N))
6470 or else Is_Access_Type (Etype (Prefix (N))));
6472 when N_Explicit_Dereference =>
6475 -- A view conversion of a tagged object is an object reference
6477 when N_Type_Conversion =>
6478 return Is_Tagged_Type (Etype (Subtype_Mark (N)))
6479 and then Is_Tagged_Type (Etype (Expression (N)))
6480 and then Is_Object_Reference (Expression (N));
6482 -- An unchecked type conversion is considered to be an object if
6483 -- the operand is an object (this construction arises only as a
6484 -- result of expansion activities).
6486 when N_Unchecked_Type_Conversion =>
6493 end Is_Object_Reference;
6495 -----------------------------------
6496 -- Is_OK_Variable_For_Out_Formal --
6497 -----------------------------------
6499 function Is_OK_Variable_For_Out_Formal (AV : Node_Id) return Boolean is
6501 Note_Possible_Modification (AV, Sure => True);
6503 -- We must reject parenthesized variable names. The check for
6504 -- Comes_From_Source is present because there are currently
6505 -- cases where the compiler violates this rule (e.g. passing
6506 -- a task object to its controlled Initialize routine).
6508 if Paren_Count (AV) > 0 and then Comes_From_Source (AV) then
6511 -- A variable is always allowed
6513 elsif Is_Variable (AV) then
6516 -- Unchecked conversions are allowed only if they come from the
6517 -- generated code, which sometimes uses unchecked conversions for out
6518 -- parameters in cases where code generation is unaffected. We tell
6519 -- source unchecked conversions by seeing if they are rewrites of an
6520 -- original Unchecked_Conversion function call, or of an explicit
6521 -- conversion of a function call.
6523 elsif Nkind (AV) = N_Unchecked_Type_Conversion then
6524 if Nkind (Original_Node (AV)) = N_Function_Call then
6527 elsif Comes_From_Source (AV)
6528 and then Nkind (Original_Node (Expression (AV))) = N_Function_Call
6532 elsif Nkind (Original_Node (AV)) = N_Type_Conversion then
6533 return Is_OK_Variable_For_Out_Formal (Expression (AV));
6539 -- Normal type conversions are allowed if argument is a variable
6541 elsif Nkind (AV) = N_Type_Conversion then
6542 if Is_Variable (Expression (AV))
6543 and then Paren_Count (Expression (AV)) = 0
6545 Note_Possible_Modification (Expression (AV), Sure => True);
6548 -- We also allow a non-parenthesized expression that raises
6549 -- constraint error if it rewrites what used to be a variable
6551 elsif Raises_Constraint_Error (Expression (AV))
6552 and then Paren_Count (Expression (AV)) = 0
6553 and then Is_Variable (Original_Node (Expression (AV)))
6557 -- Type conversion of something other than a variable
6563 -- If this node is rewritten, then test the original form, if that is
6564 -- OK, then we consider the rewritten node OK (for example, if the
6565 -- original node is a conversion, then Is_Variable will not be true
6566 -- but we still want to allow the conversion if it converts a variable).
6568 elsif Original_Node (AV) /= AV then
6569 return Is_OK_Variable_For_Out_Formal (Original_Node (AV));
6571 -- All other non-variables are rejected
6576 end Is_OK_Variable_For_Out_Formal;
6578 -----------------------------------
6579 -- Is_Partially_Initialized_Type --
6580 -----------------------------------
6582 function Is_Partially_Initialized_Type (Typ : Entity_Id) return Boolean is
6584 if Is_Scalar_Type (Typ) then
6587 elsif Is_Access_Type (Typ) then
6590 elsif Is_Array_Type (Typ) then
6592 -- If component type is partially initialized, so is array type
6594 if Is_Partially_Initialized_Type (Component_Type (Typ)) then
6597 -- Otherwise we are only partially initialized if we are fully
6598 -- initialized (this is the empty array case, no point in us
6599 -- duplicating that code here).
6602 return Is_Fully_Initialized_Type (Typ);
6605 elsif Is_Record_Type (Typ) then
6607 -- A discriminated type is always partially initialized
6609 if Has_Discriminants (Typ) then
6612 -- A tagged type is always partially initialized
6614 elsif Is_Tagged_Type (Typ) then
6617 -- Case of non-discriminated record
6623 Component_Present : Boolean := False;
6624 -- Set True if at least one component is present. If no
6625 -- components are present, then record type is fully
6626 -- initialized (another odd case, like the null array).
6629 -- Loop through components
6631 Ent := First_Entity (Typ);
6632 while Present (Ent) loop
6633 if Ekind (Ent) = E_Component then
6634 Component_Present := True;
6636 -- If a component has an initialization expression then
6637 -- the enclosing record type is partially initialized
6639 if Present (Parent (Ent))
6640 and then Present (Expression (Parent (Ent)))
6644 -- If a component is of a type which is itself partially
6645 -- initialized, then the enclosing record type is also.
6647 elsif Is_Partially_Initialized_Type (Etype (Ent)) then
6655 -- No initialized components found. If we found any components
6656 -- they were all uninitialized so the result is false.
6658 if Component_Present then
6661 -- But if we found no components, then all the components are
6662 -- initialized so we consider the type to be initialized.
6670 -- Concurrent types are always fully initialized
6672 elsif Is_Concurrent_Type (Typ) then
6675 -- For a private type, go to underlying type. If there is no underlying
6676 -- type then just assume this partially initialized. Not clear if this
6677 -- can happen in a non-error case, but no harm in testing for this.
6679 elsif Is_Private_Type (Typ) then
6681 U : constant Entity_Id := Underlying_Type (Typ);
6686 return Is_Partially_Initialized_Type (U);
6690 -- For any other type (are there any?) assume partially initialized
6695 end Is_Partially_Initialized_Type;
6697 ------------------------------------
6698 -- Is_Potentially_Persistent_Type --
6699 ------------------------------------
6701 function Is_Potentially_Persistent_Type (T : Entity_Id) return Boolean is
6706 -- For private type, test corresponding full type
6708 if Is_Private_Type (T) then
6709 return Is_Potentially_Persistent_Type (Full_View (T));
6711 -- Scalar types are potentially persistent
6713 elsif Is_Scalar_Type (T) then
6716 -- Record type is potentially persistent if not tagged and the types of
6717 -- all it components are potentially persistent, and no component has
6718 -- an initialization expression.
6720 elsif Is_Record_Type (T)
6721 and then not Is_Tagged_Type (T)
6722 and then not Is_Partially_Initialized_Type (T)
6724 Comp := First_Component (T);
6725 while Present (Comp) loop
6726 if not Is_Potentially_Persistent_Type (Etype (Comp)) then
6735 -- Array type is potentially persistent if its component type is
6736 -- potentially persistent and if all its constraints are static.
6738 elsif Is_Array_Type (T) then
6739 if not Is_Potentially_Persistent_Type (Component_Type (T)) then
6743 Indx := First_Index (T);
6744 while Present (Indx) loop
6745 if not Is_OK_Static_Subtype (Etype (Indx)) then
6754 -- All other types are not potentially persistent
6759 end Is_Potentially_Persistent_Type;
6761 ---------------------------------
6762 -- Is_Protected_Self_Reference --
6763 ---------------------------------
6765 function Is_Protected_Self_Reference (N : Node_Id) return Boolean is
6767 function In_Access_Definition (N : Node_Id) return Boolean;
6768 -- Returns true if N belongs to an access definition
6770 --------------------------
6771 -- In_Access_Definition --
6772 --------------------------
6774 function In_Access_Definition (N : Node_Id) return Boolean is
6779 while Present (P) loop
6780 if Nkind (P) = N_Access_Definition then
6788 end In_Access_Definition;
6790 -- Start of processing for Is_Protected_Self_Reference
6793 -- Verify that prefix is analyzed and has the proper form. Note that
6794 -- the attributes Elab_Spec, Elab_Body, and UET_Address, which also
6795 -- produce the address of an entity, do not analyze their prefix
6796 -- because they denote entities that are not necessarily visible.
6797 -- Neither of them can apply to a protected type.
6799 return Ada_Version >= Ada_05
6800 and then Is_Entity_Name (N)
6801 and then Present (Entity (N))
6802 and then Is_Protected_Type (Entity (N))
6803 and then In_Open_Scopes (Entity (N))
6804 and then not In_Access_Definition (N);
6805 end Is_Protected_Self_Reference;
6807 -----------------------------
6808 -- Is_RCI_Pkg_Spec_Or_Body --
6809 -----------------------------
6811 function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
6813 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
6814 -- Return True if the unit of Cunit is an RCI package declaration
6816 ---------------------------
6817 -- Is_RCI_Pkg_Decl_Cunit --
6818 ---------------------------
6820 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean is
6821 The_Unit : constant Node_Id := Unit (Cunit);
6824 if Nkind (The_Unit) /= N_Package_Declaration then
6828 return Is_Remote_Call_Interface (Defining_Entity (The_Unit));
6829 end Is_RCI_Pkg_Decl_Cunit;
6831 -- Start of processing for Is_RCI_Pkg_Spec_Or_Body
6834 return Is_RCI_Pkg_Decl_Cunit (Cunit)
6836 (Nkind (Unit (Cunit)) = N_Package_Body
6837 and then Is_RCI_Pkg_Decl_Cunit (Library_Unit (Cunit)));
6838 end Is_RCI_Pkg_Spec_Or_Body;
6840 -----------------------------------------
6841 -- Is_Remote_Access_To_Class_Wide_Type --
6842 -----------------------------------------
6844 function Is_Remote_Access_To_Class_Wide_Type
6845 (E : Entity_Id) return Boolean
6848 -- A remote access to class-wide type is a general access to object type
6849 -- declared in the visible part of a Remote_Types or Remote_Call_
6852 return Ekind (E) = E_General_Access_Type
6853 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
6854 end Is_Remote_Access_To_Class_Wide_Type;
6856 -----------------------------------------
6857 -- Is_Remote_Access_To_Subprogram_Type --
6858 -----------------------------------------
6860 function Is_Remote_Access_To_Subprogram_Type
6861 (E : Entity_Id) return Boolean
6864 return (Ekind (E) = E_Access_Subprogram_Type
6865 or else (Ekind (E) = E_Record_Type
6866 and then Present (Corresponding_Remote_Type (E))))
6867 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
6868 end Is_Remote_Access_To_Subprogram_Type;
6870 --------------------
6871 -- Is_Remote_Call --
6872 --------------------
6874 function Is_Remote_Call (N : Node_Id) return Boolean is
6876 if Nkind (N) /= N_Procedure_Call_Statement
6877 and then Nkind (N) /= N_Function_Call
6879 -- An entry call cannot be remote
6883 elsif Nkind (Name (N)) in N_Has_Entity
6884 and then Is_Remote_Call_Interface (Entity (Name (N)))
6886 -- A subprogram declared in the spec of a RCI package is remote
6890 elsif Nkind (Name (N)) = N_Explicit_Dereference
6891 and then Is_Remote_Access_To_Subprogram_Type
6892 (Etype (Prefix (Name (N))))
6894 -- The dereference of a RAS is a remote call
6898 elsif Present (Controlling_Argument (N))
6899 and then Is_Remote_Access_To_Class_Wide_Type
6900 (Etype (Controlling_Argument (N)))
6902 -- Any primitive operation call with a controlling argument of
6903 -- a RACW type is a remote call.
6908 -- All other calls are local calls
6913 ----------------------
6914 -- Is_Renamed_Entry --
6915 ----------------------
6917 function Is_Renamed_Entry (Proc_Nam : Entity_Id) return Boolean is
6918 Orig_Node : Node_Id := Empty;
6919 Subp_Decl : Node_Id := Parent (Parent (Proc_Nam));
6921 function Is_Entry (Nam : Node_Id) return Boolean;
6922 -- Determine whether Nam is an entry. Traverse selectors if there are
6923 -- nested selected components.
6929 function Is_Entry (Nam : Node_Id) return Boolean is
6931 if Nkind (Nam) = N_Selected_Component then
6932 return Is_Entry (Selector_Name (Nam));
6935 return Ekind (Entity (Nam)) = E_Entry;
6938 -- Start of processing for Is_Renamed_Entry
6941 if Present (Alias (Proc_Nam)) then
6942 Subp_Decl := Parent (Parent (Alias (Proc_Nam)));
6945 -- Look for a rewritten subprogram renaming declaration
6947 if Nkind (Subp_Decl) = N_Subprogram_Declaration
6948 and then Present (Original_Node (Subp_Decl))
6950 Orig_Node := Original_Node (Subp_Decl);
6953 -- The rewritten subprogram is actually an entry
6955 if Present (Orig_Node)
6956 and then Nkind (Orig_Node) = N_Subprogram_Renaming_Declaration
6957 and then Is_Entry (Name (Orig_Node))
6963 end Is_Renamed_Entry;
6965 ----------------------
6966 -- Is_Selector_Name --
6967 ----------------------
6969 function Is_Selector_Name (N : Node_Id) return Boolean is
6971 if not Is_List_Member (N) then
6973 P : constant Node_Id := Parent (N);
6974 K : constant Node_Kind := Nkind (P);
6977 (K = N_Expanded_Name or else
6978 K = N_Generic_Association or else
6979 K = N_Parameter_Association or else
6980 K = N_Selected_Component)
6981 and then Selector_Name (P) = N;
6986 L : constant List_Id := List_Containing (N);
6987 P : constant Node_Id := Parent (L);
6989 return (Nkind (P) = N_Discriminant_Association
6990 and then Selector_Names (P) = L)
6992 (Nkind (P) = N_Component_Association
6993 and then Choices (P) = L);
6996 end Is_Selector_Name;
7002 function Is_Statement (N : Node_Id) return Boolean is
7005 Nkind (N) in N_Statement_Other_Than_Procedure_Call
7006 or else Nkind (N) = N_Procedure_Call_Statement;
7009 ---------------------------------
7010 -- Is_Synchronized_Tagged_Type --
7011 ---------------------------------
7013 function Is_Synchronized_Tagged_Type (E : Entity_Id) return Boolean is
7014 Kind : constant Entity_Kind := Ekind (Base_Type (E));
7017 -- A task or protected type derived from an interface is a tagged type.
7018 -- Such a tagged type is called a synchronized tagged type, as are
7019 -- synchronized interfaces and private extensions whose declaration
7020 -- includes the reserved word synchronized.
7022 return (Is_Tagged_Type (E)
7023 and then (Kind = E_Task_Type
7024 or else Kind = E_Protected_Type))
7027 and then Is_Synchronized_Interface (E))
7029 (Ekind (E) = E_Record_Type_With_Private
7030 and then (Synchronized_Present (Parent (E))
7031 or else Is_Synchronized_Interface (Etype (E))));
7032 end Is_Synchronized_Tagged_Type;
7038 function Is_Transfer (N : Node_Id) return Boolean is
7039 Kind : constant Node_Kind := Nkind (N);
7042 if Kind = N_Simple_Return_Statement
7044 Kind = N_Extended_Return_Statement
7046 Kind = N_Goto_Statement
7048 Kind = N_Raise_Statement
7050 Kind = N_Requeue_Statement
7054 elsif (Kind = N_Exit_Statement or else Kind in N_Raise_xxx_Error)
7055 and then No (Condition (N))
7059 elsif Kind = N_Procedure_Call_Statement
7060 and then Is_Entity_Name (Name (N))
7061 and then Present (Entity (Name (N)))
7062 and then No_Return (Entity (Name (N)))
7066 elsif Nkind (Original_Node (N)) = N_Raise_Statement then
7078 function Is_True (U : Uint) return Boolean is
7087 function Is_Value_Type (T : Entity_Id) return Boolean is
7089 return VM_Target = CLI_Target
7090 and then Nkind (T) in N_Has_Chars
7091 and then Chars (T) /= No_Name
7092 and then Get_Name_String (Chars (T)) = "valuetype";
7095 ---------------------
7096 -- Is_VMS_Operator --
7097 ---------------------
7099 function Is_VMS_Operator (Op : Entity_Id) return Boolean is
7101 return Ekind (Op) = E_Function
7102 and then Is_Intrinsic_Subprogram (Op)
7103 and then Chars (Scope (Scope (Op))) = Name_System
7104 and then OpenVMS_On_Target;
7105 end Is_VMS_Operator;
7111 function Is_Delegate (T : Entity_Id) return Boolean is
7112 Desig_Type : Entity_Id;
7115 if VM_Target /= CLI_Target then
7119 -- Access-to-subprograms are delegates in CIL
7121 if Ekind (T) = E_Access_Subprogram_Type then
7125 if Ekind (T) not in Access_Kind then
7127 -- A delegate is a managed pointer. If no designated type is defined
7128 -- it means that it's not a delegate.
7133 Desig_Type := Etype (Directly_Designated_Type (T));
7135 if not Is_Tagged_Type (Desig_Type) then
7139 -- Test if the type is inherited from [mscorlib]System.Delegate
7141 while Etype (Desig_Type) /= Desig_Type loop
7142 if Chars (Scope (Desig_Type)) /= No_Name
7143 and then Is_Imported (Scope (Desig_Type))
7144 and then Get_Name_String (Chars (Scope (Desig_Type))) = "delegate"
7149 Desig_Type := Etype (Desig_Type);
7159 function Is_Variable (N : Node_Id) return Boolean is
7161 Orig_Node : constant Node_Id := Original_Node (N);
7162 -- We do the test on the original node, since this is basically a test
7163 -- of syntactic categories, so it must not be disturbed by whatever
7164 -- rewriting might have occurred. For example, an aggregate, which is
7165 -- certainly NOT a variable, could be turned into a variable by
7168 function In_Protected_Function (E : Entity_Id) return Boolean;
7169 -- Within a protected function, the private components of the
7170 -- enclosing protected type are constants. A function nested within
7171 -- a (protected) procedure is not itself protected.
7173 function Is_Variable_Prefix (P : Node_Id) return Boolean;
7174 -- Prefixes can involve implicit dereferences, in which case we
7175 -- must test for the case of a reference of a constant access
7176 -- type, which can never be a variable.
7178 ---------------------------
7179 -- In_Protected_Function --
7180 ---------------------------
7182 function In_Protected_Function (E : Entity_Id) return Boolean is
7183 Prot : constant Entity_Id := Scope (E);
7187 if not Is_Protected_Type (Prot) then
7191 while Present (S) and then S /= Prot loop
7192 if Ekind (S) = E_Function
7193 and then Scope (S) = Prot
7203 end In_Protected_Function;
7205 ------------------------
7206 -- Is_Variable_Prefix --
7207 ------------------------
7209 function Is_Variable_Prefix (P : Node_Id) return Boolean is
7211 if Is_Access_Type (Etype (P)) then
7212 return not Is_Access_Constant (Root_Type (Etype (P)));
7214 -- For the case of an indexed component whose prefix has a packed
7215 -- array type, the prefix has been rewritten into a type conversion.
7216 -- Determine variable-ness from the converted expression.
7218 elsif Nkind (P) = N_Type_Conversion
7219 and then not Comes_From_Source (P)
7220 and then Is_Array_Type (Etype (P))
7221 and then Is_Packed (Etype (P))
7223 return Is_Variable (Expression (P));
7226 return Is_Variable (P);
7228 end Is_Variable_Prefix;
7230 -- Start of processing for Is_Variable
7233 -- Definitely OK if Assignment_OK is set. Since this is something that
7234 -- only gets set for expanded nodes, the test is on N, not Orig_Node.
7236 if Nkind (N) in N_Subexpr and then Assignment_OK (N) then
7239 -- Normally we go to the original node, but there is one exception
7240 -- where we use the rewritten node, namely when it is an explicit
7241 -- dereference. The generated code may rewrite a prefix which is an
7242 -- access type with an explicit dereference. The dereference is a
7243 -- variable, even though the original node may not be (since it could
7244 -- be a constant of the access type).
7246 -- In Ada 2005 we have a further case to consider: the prefix may be
7247 -- a function call given in prefix notation. The original node appears
7248 -- to be a selected component, but we need to examine the call.
7250 elsif Nkind (N) = N_Explicit_Dereference
7251 and then Nkind (Orig_Node) /= N_Explicit_Dereference
7252 and then Present (Etype (Orig_Node))
7253 and then Is_Access_Type (Etype (Orig_Node))
7255 -- Note that if the prefix is an explicit dereference that does not
7256 -- come from source, we must check for a rewritten function call in
7257 -- prefixed notation before other forms of rewriting, to prevent a
7261 (Nkind (Orig_Node) = N_Function_Call
7262 and then not Is_Access_Constant (Etype (Prefix (N))))
7264 Is_Variable_Prefix (Original_Node (Prefix (N)));
7266 -- A function call is never a variable
7268 elsif Nkind (N) = N_Function_Call then
7271 -- All remaining checks use the original node
7273 elsif Is_Entity_Name (Orig_Node)
7274 and then Present (Entity (Orig_Node))
7277 E : constant Entity_Id := Entity (Orig_Node);
7278 K : constant Entity_Kind := Ekind (E);
7281 return (K = E_Variable
7282 and then Nkind (Parent (E)) /= N_Exception_Handler)
7283 or else (K = E_Component
7284 and then not In_Protected_Function (E))
7285 or else K = E_Out_Parameter
7286 or else K = E_In_Out_Parameter
7287 or else K = E_Generic_In_Out_Parameter
7289 -- Current instance of type:
7291 or else (Is_Type (E) and then In_Open_Scopes (E))
7292 or else (Is_Incomplete_Or_Private_Type (E)
7293 and then In_Open_Scopes (Full_View (E)));
7297 case Nkind (Orig_Node) is
7298 when N_Indexed_Component | N_Slice =>
7299 return Is_Variable_Prefix (Prefix (Orig_Node));
7301 when N_Selected_Component =>
7302 return Is_Variable_Prefix (Prefix (Orig_Node))
7303 and then Is_Variable (Selector_Name (Orig_Node));
7305 -- For an explicit dereference, the type of the prefix cannot
7306 -- be an access to constant or an access to subprogram.
7308 when N_Explicit_Dereference =>
7310 Typ : constant Entity_Id := Etype (Prefix (Orig_Node));
7312 return Is_Access_Type (Typ)
7313 and then not Is_Access_Constant (Root_Type (Typ))
7314 and then Ekind (Typ) /= E_Access_Subprogram_Type;
7317 -- The type conversion is the case where we do not deal with the
7318 -- context dependent special case of an actual parameter. Thus
7319 -- the type conversion is only considered a variable for the
7320 -- purposes of this routine if the target type is tagged. However,
7321 -- a type conversion is considered to be a variable if it does not
7322 -- come from source (this deals for example with the conversions
7323 -- of expressions to their actual subtypes).
7325 when N_Type_Conversion =>
7326 return Is_Variable (Expression (Orig_Node))
7328 (not Comes_From_Source (Orig_Node)
7330 (Is_Tagged_Type (Etype (Subtype_Mark (Orig_Node)))
7332 Is_Tagged_Type (Etype (Expression (Orig_Node)))));
7334 -- GNAT allows an unchecked type conversion as a variable. This
7335 -- only affects the generation of internal expanded code, since
7336 -- calls to instantiations of Unchecked_Conversion are never
7337 -- considered variables (since they are function calls).
7338 -- This is also true for expression actions.
7340 when N_Unchecked_Type_Conversion =>
7341 return Is_Variable (Expression (Orig_Node));
7349 ---------------------------
7350 -- Is_Visibly_Controlled --
7351 ---------------------------
7353 function Is_Visibly_Controlled (T : Entity_Id) return Boolean is
7354 Root : constant Entity_Id := Root_Type (T);
7356 return Chars (Scope (Root)) = Name_Finalization
7357 and then Chars (Scope (Scope (Root))) = Name_Ada
7358 and then Scope (Scope (Scope (Root))) = Standard_Standard;
7359 end Is_Visibly_Controlled;
7361 ------------------------
7362 -- Is_Volatile_Object --
7363 ------------------------
7365 function Is_Volatile_Object (N : Node_Id) return Boolean is
7367 function Object_Has_Volatile_Components (N : Node_Id) return Boolean;
7368 -- Determines if given object has volatile components
7370 function Is_Volatile_Prefix (N : Node_Id) return Boolean;
7371 -- If prefix is an implicit dereference, examine designated type
7373 ------------------------
7374 -- Is_Volatile_Prefix --
7375 ------------------------
7377 function Is_Volatile_Prefix (N : Node_Id) return Boolean is
7378 Typ : constant Entity_Id := Etype (N);
7381 if Is_Access_Type (Typ) then
7383 Dtyp : constant Entity_Id := Designated_Type (Typ);
7386 return Is_Volatile (Dtyp)
7387 or else Has_Volatile_Components (Dtyp);
7391 return Object_Has_Volatile_Components (N);
7393 end Is_Volatile_Prefix;
7395 ------------------------------------
7396 -- Object_Has_Volatile_Components --
7397 ------------------------------------
7399 function Object_Has_Volatile_Components (N : Node_Id) return Boolean is
7400 Typ : constant Entity_Id := Etype (N);
7403 if Is_Volatile (Typ)
7404 or else Has_Volatile_Components (Typ)
7408 elsif Is_Entity_Name (N)
7409 and then (Has_Volatile_Components (Entity (N))
7410 or else Is_Volatile (Entity (N)))
7414 elsif Nkind (N) = N_Indexed_Component
7415 or else Nkind (N) = N_Selected_Component
7417 return Is_Volatile_Prefix (Prefix (N));
7422 end Object_Has_Volatile_Components;
7424 -- Start of processing for Is_Volatile_Object
7427 if Is_Volatile (Etype (N))
7428 or else (Is_Entity_Name (N) and then Is_Volatile (Entity (N)))
7432 elsif Nkind (N) = N_Indexed_Component
7433 or else Nkind (N) = N_Selected_Component
7435 return Is_Volatile_Prefix (Prefix (N));
7440 end Is_Volatile_Object;
7442 -------------------------
7443 -- Kill_Current_Values --
7444 -------------------------
7446 procedure Kill_Current_Values
7448 Last_Assignment_Only : Boolean := False)
7451 -- ??? do we have to worry about clearing cached checks?
7453 if Is_Assignable (Ent) then
7454 Set_Last_Assignment (Ent, Empty);
7457 if Is_Object (Ent) then
7458 if not Last_Assignment_Only then
7460 Set_Current_Value (Ent, Empty);
7462 if not Can_Never_Be_Null (Ent) then
7463 Set_Is_Known_Non_Null (Ent, False);
7466 Set_Is_Known_Null (Ent, False);
7468 -- Reset Is_Known_Valid unless type is always valid, or if we have
7469 -- a loop parameter (loop parameters are always valid, since their
7470 -- bounds are defined by the bounds given in the loop header).
7472 if not Is_Known_Valid (Etype (Ent))
7473 and then Ekind (Ent) /= E_Loop_Parameter
7475 Set_Is_Known_Valid (Ent, False);
7479 end Kill_Current_Values;
7481 procedure Kill_Current_Values (Last_Assignment_Only : Boolean := False) is
7484 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id);
7485 -- Clear current value for entity E and all entities chained to E
7487 ------------------------------------------
7488 -- Kill_Current_Values_For_Entity_Chain --
7489 ------------------------------------------
7491 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id) is
7495 while Present (Ent) loop
7496 Kill_Current_Values (Ent, Last_Assignment_Only);
7499 end Kill_Current_Values_For_Entity_Chain;
7501 -- Start of processing for Kill_Current_Values
7504 -- Kill all saved checks, a special case of killing saved values
7506 if not Last_Assignment_Only then
7510 -- Loop through relevant scopes, which includes the current scope and
7511 -- any parent scopes if the current scope is a block or a package.
7516 -- Clear current values of all entities in current scope
7518 Kill_Current_Values_For_Entity_Chain (First_Entity (S));
7520 -- If scope is a package, also clear current values of all
7521 -- private entities in the scope.
7523 if Is_Package_Or_Generic_Package (S)
7524 or else Is_Concurrent_Type (S)
7526 Kill_Current_Values_For_Entity_Chain (First_Private_Entity (S));
7529 -- If this is a not a subprogram, deal with parents
7531 if not Is_Subprogram (S) then
7533 exit Scope_Loop when S = Standard_Standard;
7537 end loop Scope_Loop;
7538 end Kill_Current_Values;
7540 --------------------------
7541 -- Kill_Size_Check_Code --
7542 --------------------------
7544 procedure Kill_Size_Check_Code (E : Entity_Id) is
7546 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
7547 and then Present (Size_Check_Code (E))
7549 Remove (Size_Check_Code (E));
7550 Set_Size_Check_Code (E, Empty);
7552 end Kill_Size_Check_Code;
7554 --------------------------
7555 -- Known_To_Be_Assigned --
7556 --------------------------
7558 function Known_To_Be_Assigned (N : Node_Id) return Boolean is
7559 P : constant Node_Id := Parent (N);
7564 -- Test left side of assignment
7566 when N_Assignment_Statement =>
7567 return N = Name (P);
7569 -- Function call arguments are never lvalues
7571 when N_Function_Call =>
7574 -- Positional parameter for procedure or accept call
7576 when N_Procedure_Call_Statement |
7585 Proc := Get_Subprogram_Entity (P);
7591 -- If we are not a list member, something is strange, so
7592 -- be conservative and return False.
7594 if not Is_List_Member (N) then
7598 -- We are going to find the right formal by stepping forward
7599 -- through the formals, as we step backwards in the actuals.
7601 Form := First_Formal (Proc);
7604 -- If no formal, something is weird, so be conservative
7605 -- and return False.
7616 return Ekind (Form) /= E_In_Parameter;
7619 -- Named parameter for procedure or accept call
7621 when N_Parameter_Association =>
7627 Proc := Get_Subprogram_Entity (Parent (P));
7633 -- Loop through formals to find the one that matches
7635 Form := First_Formal (Proc);
7637 -- If no matching formal, that's peculiar, some kind of
7638 -- previous error, so return False to be conservative.
7644 -- Else test for match
7646 if Chars (Form) = Chars (Selector_Name (P)) then
7647 return Ekind (Form) /= E_In_Parameter;
7654 -- Test for appearing in a conversion that itself appears
7655 -- in an lvalue context, since this should be an lvalue.
7657 when N_Type_Conversion =>
7658 return Known_To_Be_Assigned (P);
7660 -- All other references are definitely not known to be modifications
7666 end Known_To_Be_Assigned;
7672 function May_Be_Lvalue (N : Node_Id) return Boolean is
7673 P : constant Node_Id := Parent (N);
7678 -- Test left side of assignment
7680 when N_Assignment_Statement =>
7681 return N = Name (P);
7683 -- Test prefix of component or attribute. Note that the prefix of an
7684 -- explicit or implicit dereference cannot be an l-value.
7686 when N_Attribute_Reference =>
7687 return N = Prefix (P)
7688 and then Name_Implies_Lvalue_Prefix (Attribute_Name (P));
7690 -- For an expanded name, the name is an lvalue if the expanded name
7691 -- is an lvalue, but the prefix is never an lvalue, since it is just
7692 -- the scope where the name is found.
7694 when N_Expanded_Name =>
7695 if N = Prefix (P) then
7696 return May_Be_Lvalue (P);
7701 -- For a selected component A.B, A is certainly an lvalue if A.B is.
7702 -- B is a little interesting, if we have A.B := 3, there is some
7703 -- discussion as to whether B is an lvalue or not, we choose to say
7704 -- it is. Note however that A is not an lvalue if it is of an access
7705 -- type since this is an implicit dereference.
7707 when N_Selected_Component =>
7709 and then Present (Etype (N))
7710 and then Is_Access_Type (Etype (N))
7714 return May_Be_Lvalue (P);
7717 -- For an indexed component or slice, the index or slice bounds is
7718 -- never an lvalue. The prefix is an lvalue if the indexed component
7719 -- or slice is an lvalue, except if it is an access type, where we
7720 -- have an implicit dereference.
7722 when N_Indexed_Component =>
7724 or else (Present (Etype (N)) and then Is_Access_Type (Etype (N)))
7728 return May_Be_Lvalue (P);
7731 -- Prefix of a reference is an lvalue if the reference is an lvalue
7734 return May_Be_Lvalue (P);
7736 -- Prefix of explicit dereference is never an lvalue
7738 when N_Explicit_Dereference =>
7741 -- Function call arguments are never lvalues
7743 when N_Function_Call =>
7746 -- Positional parameter for procedure, entry, or accept call
7748 when N_Procedure_Call_Statement |
7749 N_Entry_Call_Statement |
7758 Proc := Get_Subprogram_Entity (P);
7764 -- If we are not a list member, something is strange, so
7765 -- be conservative and return True.
7767 if not Is_List_Member (N) then
7771 -- We are going to find the right formal by stepping forward
7772 -- through the formals, as we step backwards in the actuals.
7774 Form := First_Formal (Proc);
7777 -- If no formal, something is weird, so be conservative
7789 return Ekind (Form) /= E_In_Parameter;
7792 -- Named parameter for procedure or accept call
7794 when N_Parameter_Association =>
7800 Proc := Get_Subprogram_Entity (Parent (P));
7806 -- Loop through formals to find the one that matches
7808 Form := First_Formal (Proc);
7810 -- If no matching formal, that's peculiar, some kind of
7811 -- previous error, so return True to be conservative.
7817 -- Else test for match
7819 if Chars (Form) = Chars (Selector_Name (P)) then
7820 return Ekind (Form) /= E_In_Parameter;
7827 -- Test for appearing in a conversion that itself appears in an
7828 -- lvalue context, since this should be an lvalue.
7830 when N_Type_Conversion =>
7831 return May_Be_Lvalue (P);
7833 -- Test for appearance in object renaming declaration
7835 when N_Object_Renaming_Declaration =>
7838 -- All other references are definitely not lvalues
7846 -----------------------
7847 -- Mark_Coextensions --
7848 -----------------------
7850 procedure Mark_Coextensions (Context_Nod : Node_Id; Root_Nod : Node_Id) is
7851 Is_Dynamic : Boolean;
7852 -- Indicates whether the context causes nested coextensions to be
7853 -- dynamic or static
7855 function Mark_Allocator (N : Node_Id) return Traverse_Result;
7856 -- Recognize an allocator node and label it as a dynamic coextension
7858 --------------------
7859 -- Mark_Allocator --
7860 --------------------
7862 function Mark_Allocator (N : Node_Id) return Traverse_Result is
7864 if Nkind (N) = N_Allocator then
7866 Set_Is_Dynamic_Coextension (N);
7868 Set_Is_Static_Coextension (N);
7875 procedure Mark_Allocators is new Traverse_Proc (Mark_Allocator);
7877 -- Start of processing Mark_Coextensions
7880 case Nkind (Context_Nod) is
7881 when N_Assignment_Statement |
7882 N_Simple_Return_Statement =>
7883 Is_Dynamic := Nkind (Expression (Context_Nod)) = N_Allocator;
7885 when N_Object_Declaration =>
7886 Is_Dynamic := Nkind (Root_Nod) = N_Allocator;
7888 -- This routine should not be called for constructs which may not
7889 -- contain coextensions.
7892 raise Program_Error;
7895 Mark_Allocators (Root_Nod);
7896 end Mark_Coextensions;
7898 ----------------------
7899 -- Needs_One_Actual --
7900 ----------------------
7902 function Needs_One_Actual (E : Entity_Id) return Boolean is
7906 if Ada_Version >= Ada_05
7907 and then Present (First_Formal (E))
7909 Formal := Next_Formal (First_Formal (E));
7910 while Present (Formal) loop
7911 if No (Default_Value (Formal)) then
7915 Next_Formal (Formal);
7923 end Needs_One_Actual;
7925 ------------------------
7926 -- New_Copy_List_Tree --
7927 ------------------------
7929 function New_Copy_List_Tree (List : List_Id) return List_Id is
7934 if List = No_List then
7941 while Present (E) loop
7942 Append (New_Copy_Tree (E), NL);
7948 end New_Copy_List_Tree;
7954 use Atree.Unchecked_Access;
7955 use Atree_Private_Part;
7957 -- Our approach here requires a two pass traversal of the tree. The
7958 -- first pass visits all nodes that eventually will be copied looking
7959 -- for defining Itypes. If any defining Itypes are found, then they are
7960 -- copied, and an entry is added to the replacement map. In the second
7961 -- phase, the tree is copied, using the replacement map to replace any
7962 -- Itype references within the copied tree.
7964 -- The following hash tables are used if the Map supplied has more
7965 -- than hash threshhold entries to speed up access to the map. If
7966 -- there are fewer entries, then the map is searched sequentially
7967 -- (because setting up a hash table for only a few entries takes
7968 -- more time than it saves.
7970 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
7971 -- Hash function used for hash operations
7977 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
7979 return Nat (E) mod (NCT_Header_Num'Last + 1);
7986 -- The hash table NCT_Assoc associates old entities in the table
7987 -- with their corresponding new entities (i.e. the pairs of entries
7988 -- presented in the original Map argument are Key-Element pairs).
7990 package NCT_Assoc is new Simple_HTable (
7991 Header_Num => NCT_Header_Num,
7992 Element => Entity_Id,
7993 No_Element => Empty,
7995 Hash => New_Copy_Hash,
7996 Equal => Types."=");
7998 ---------------------
7999 -- NCT_Itype_Assoc --
8000 ---------------------
8002 -- The hash table NCT_Itype_Assoc contains entries only for those
8003 -- old nodes which have a non-empty Associated_Node_For_Itype set.
8004 -- The key is the associated node, and the element is the new node
8005 -- itself (NOT the associated node for the new node).
8007 package NCT_Itype_Assoc is new Simple_HTable (
8008 Header_Num => NCT_Header_Num,
8009 Element => Entity_Id,
8010 No_Element => Empty,
8012 Hash => New_Copy_Hash,
8013 Equal => Types."=");
8015 -- Start of processing for New_Copy_Tree function
8017 function New_Copy_Tree
8019 Map : Elist_Id := No_Elist;
8020 New_Sloc : Source_Ptr := No_Location;
8021 New_Scope : Entity_Id := Empty) return Node_Id
8023 Actual_Map : Elist_Id := Map;
8024 -- This is the actual map for the copy. It is initialized with the
8025 -- given elements, and then enlarged as required for Itypes that are
8026 -- copied during the first phase of the copy operation. The visit
8027 -- procedures add elements to this map as Itypes are encountered.
8028 -- The reason we cannot use Map directly, is that it may well be
8029 -- (and normally is) initialized to No_Elist, and if we have mapped
8030 -- entities, we have to reset it to point to a real Elist.
8032 function Assoc (N : Node_Or_Entity_Id) return Node_Id;
8033 -- Called during second phase to map entities into their corresponding
8034 -- copies using Actual_Map. If the argument is not an entity, or is not
8035 -- in Actual_Map, then it is returned unchanged.
8037 procedure Build_NCT_Hash_Tables;
8038 -- Builds hash tables (number of elements >= threshold value)
8040 function Copy_Elist_With_Replacement
8041 (Old_Elist : Elist_Id) return Elist_Id;
8042 -- Called during second phase to copy element list doing replacements
8044 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
8045 -- Called during the second phase to process a copied Itype. The actual
8046 -- copy happened during the first phase (so that we could make the entry
8047 -- in the mapping), but we still have to deal with the descendents of
8048 -- the copied Itype and copy them where necessary.
8050 function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
8051 -- Called during second phase to copy list doing replacements
8053 function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
8054 -- Called during second phase to copy node doing replacements
8056 procedure Visit_Elist (E : Elist_Id);
8057 -- Called during first phase to visit all elements of an Elist
8059 procedure Visit_Field (F : Union_Id; N : Node_Id);
8060 -- Visit a single field, recursing to call Visit_Node or Visit_List
8061 -- if the field is a syntactic descendent of the current node (i.e.
8062 -- its parent is Node N).
8064 procedure Visit_Itype (Old_Itype : Entity_Id);
8065 -- Called during first phase to visit subsidiary fields of a defining
8066 -- Itype, and also create a copy and make an entry in the replacement
8067 -- map for the new copy.
8069 procedure Visit_List (L : List_Id);
8070 -- Called during first phase to visit all elements of a List
8072 procedure Visit_Node (N : Node_Or_Entity_Id);
8073 -- Called during first phase to visit a node and all its subtrees
8079 function Assoc (N : Node_Or_Entity_Id) return Node_Id is
8084 if not Has_Extension (N) or else No (Actual_Map) then
8087 elsif NCT_Hash_Tables_Used then
8088 Ent := NCT_Assoc.Get (Entity_Id (N));
8090 if Present (Ent) then
8096 -- No hash table used, do serial search
8099 E := First_Elmt (Actual_Map);
8100 while Present (E) loop
8101 if Node (E) = N then
8102 return Node (Next_Elmt (E));
8104 E := Next_Elmt (Next_Elmt (E));
8112 ---------------------------
8113 -- Build_NCT_Hash_Tables --
8114 ---------------------------
8116 procedure Build_NCT_Hash_Tables is
8120 if NCT_Hash_Table_Setup then
8122 NCT_Itype_Assoc.Reset;
8125 Elmt := First_Elmt (Actual_Map);
8126 while Present (Elmt) loop
8129 -- Get new entity, and associate old and new
8132 NCT_Assoc.Set (Ent, Node (Elmt));
8134 if Is_Type (Ent) then
8136 Anode : constant Entity_Id :=
8137 Associated_Node_For_Itype (Ent);
8140 if Present (Anode) then
8142 -- Enter a link between the associated node of the
8143 -- old Itype and the new Itype, for updating later
8144 -- when node is copied.
8146 NCT_Itype_Assoc.Set (Anode, Node (Elmt));
8154 NCT_Hash_Tables_Used := True;
8155 NCT_Hash_Table_Setup := True;
8156 end Build_NCT_Hash_Tables;
8158 ---------------------------------
8159 -- Copy_Elist_With_Replacement --
8160 ---------------------------------
8162 function Copy_Elist_With_Replacement
8163 (Old_Elist : Elist_Id) return Elist_Id
8166 New_Elist : Elist_Id;
8169 if No (Old_Elist) then
8173 New_Elist := New_Elmt_List;
8175 M := First_Elmt (Old_Elist);
8176 while Present (M) loop
8177 Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
8183 end Copy_Elist_With_Replacement;
8185 ---------------------------------
8186 -- Copy_Itype_With_Replacement --
8187 ---------------------------------
8189 -- This routine exactly parallels its phase one analog Visit_Itype,
8191 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
8193 -- Translate Next_Entity, Scope and Etype fields, in case they
8194 -- reference entities that have been mapped into copies.
8196 Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
8197 Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
8199 if Present (New_Scope) then
8200 Set_Scope (New_Itype, New_Scope);
8202 Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
8205 -- Copy referenced fields
8207 if Is_Discrete_Type (New_Itype) then
8208 Set_Scalar_Range (New_Itype,
8209 Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
8211 elsif Has_Discriminants (Base_Type (New_Itype)) then
8212 Set_Discriminant_Constraint (New_Itype,
8213 Copy_Elist_With_Replacement
8214 (Discriminant_Constraint (New_Itype)));
8216 elsif Is_Array_Type (New_Itype) then
8217 if Present (First_Index (New_Itype)) then
8218 Set_First_Index (New_Itype,
8219 First (Copy_List_With_Replacement
8220 (List_Containing (First_Index (New_Itype)))));
8223 if Is_Packed (New_Itype) then
8224 Set_Packed_Array_Type (New_Itype,
8225 Copy_Node_With_Replacement
8226 (Packed_Array_Type (New_Itype)));
8229 end Copy_Itype_With_Replacement;
8231 --------------------------------
8232 -- Copy_List_With_Replacement --
8233 --------------------------------
8235 function Copy_List_With_Replacement
8236 (Old_List : List_Id) return List_Id
8242 if Old_List = No_List then
8246 New_List := Empty_List;
8248 E := First (Old_List);
8249 while Present (E) loop
8250 Append (Copy_Node_With_Replacement (E), New_List);
8256 end Copy_List_With_Replacement;
8258 --------------------------------
8259 -- Copy_Node_With_Replacement --
8260 --------------------------------
8262 function Copy_Node_With_Replacement
8263 (Old_Node : Node_Id) return Node_Id
8267 procedure Adjust_Named_Associations
8268 (Old_Node : Node_Id;
8269 New_Node : Node_Id);
8270 -- If a call node has named associations, these are chained through
8271 -- the First_Named_Actual, Next_Named_Actual links. These must be
8272 -- propagated separately to the new parameter list, because these
8273 -- are not syntactic fields.
8275 function Copy_Field_With_Replacement
8276 (Field : Union_Id) return Union_Id;
8277 -- Given Field, which is a field of Old_Node, return a copy of it
8278 -- if it is a syntactic field (i.e. its parent is Node), setting
8279 -- the parent of the copy to poit to New_Node. Otherwise returns
8280 -- the field (possibly mapped if it is an entity).
8282 -------------------------------
8283 -- Adjust_Named_Associations --
8284 -------------------------------
8286 procedure Adjust_Named_Associations
8287 (Old_Node : Node_Id;
8297 Old_E := First (Parameter_Associations (Old_Node));
8298 New_E := First (Parameter_Associations (New_Node));
8299 while Present (Old_E) loop
8300 if Nkind (Old_E) = N_Parameter_Association
8301 and then Present (Next_Named_Actual (Old_E))
8303 if First_Named_Actual (Old_Node)
8304 = Explicit_Actual_Parameter (Old_E)
8306 Set_First_Named_Actual
8307 (New_Node, Explicit_Actual_Parameter (New_E));
8310 -- Now scan parameter list from the beginning,to locate
8311 -- next named actual, which can be out of order.
8313 Old_Next := First (Parameter_Associations (Old_Node));
8314 New_Next := First (Parameter_Associations (New_Node));
8316 while Nkind (Old_Next) /= N_Parameter_Association
8317 or else Explicit_Actual_Parameter (Old_Next)
8318 /= Next_Named_Actual (Old_E)
8324 Set_Next_Named_Actual
8325 (New_E, Explicit_Actual_Parameter (New_Next));
8331 end Adjust_Named_Associations;
8333 ---------------------------------
8334 -- Copy_Field_With_Replacement --
8335 ---------------------------------
8337 function Copy_Field_With_Replacement
8338 (Field : Union_Id) return Union_Id
8341 if Field = Union_Id (Empty) then
8344 elsif Field in Node_Range then
8346 Old_N : constant Node_Id := Node_Id (Field);
8350 -- If syntactic field, as indicated by the parent pointer
8351 -- being set, then copy the referenced node recursively.
8353 if Parent (Old_N) = Old_Node then
8354 New_N := Copy_Node_With_Replacement (Old_N);
8356 if New_N /= Old_N then
8357 Set_Parent (New_N, New_Node);
8360 -- For semantic fields, update possible entity reference
8361 -- from the replacement map.
8364 New_N := Assoc (Old_N);
8367 return Union_Id (New_N);
8370 elsif Field in List_Range then
8372 Old_L : constant List_Id := List_Id (Field);
8376 -- If syntactic field, as indicated by the parent pointer,
8377 -- then recursively copy the entire referenced list.
8379 if Parent (Old_L) = Old_Node then
8380 New_L := Copy_List_With_Replacement (Old_L);
8381 Set_Parent (New_L, New_Node);
8383 -- For semantic list, just returned unchanged
8389 return Union_Id (New_L);
8392 -- Anything other than a list or a node is returned unchanged
8397 end Copy_Field_With_Replacement;
8399 -- Start of processing for Copy_Node_With_Replacement
8402 if Old_Node <= Empty_Or_Error then
8405 elsif Has_Extension (Old_Node) then
8406 return Assoc (Old_Node);
8409 New_Node := New_Copy (Old_Node);
8411 -- If the node we are copying is the associated node of a
8412 -- previously copied Itype, then adjust the associated node
8413 -- of the copy of that Itype accordingly.
8415 if Present (Actual_Map) then
8421 -- Case of hash table used
8423 if NCT_Hash_Tables_Used then
8424 Ent := NCT_Itype_Assoc.Get (Old_Node);
8426 if Present (Ent) then
8427 Set_Associated_Node_For_Itype (Ent, New_Node);
8430 -- Case of no hash table used
8433 E := First_Elmt (Actual_Map);
8434 while Present (E) loop
8435 if Is_Itype (Node (E))
8437 Old_Node = Associated_Node_For_Itype (Node (E))
8439 Set_Associated_Node_For_Itype
8440 (Node (Next_Elmt (E)), New_Node);
8443 E := Next_Elmt (Next_Elmt (E));
8449 -- Recursively copy descendents
8452 (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
8454 (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
8456 (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
8458 (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
8460 (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
8462 -- Adjust Sloc of new node if necessary
8464 if New_Sloc /= No_Location then
8465 Set_Sloc (New_Node, New_Sloc);
8467 -- If we adjust the Sloc, then we are essentially making
8468 -- a completely new node, so the Comes_From_Source flag
8469 -- should be reset to the proper default value.
8471 Nodes.Table (New_Node).Comes_From_Source :=
8472 Default_Node.Comes_From_Source;
8475 -- If the node is call and has named associations,
8476 -- set the corresponding links in the copy.
8478 if (Nkind (Old_Node) = N_Function_Call
8479 or else Nkind (Old_Node) = N_Entry_Call_Statement
8481 Nkind (Old_Node) = N_Procedure_Call_Statement)
8482 and then Present (First_Named_Actual (Old_Node))
8484 Adjust_Named_Associations (Old_Node, New_Node);
8487 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
8488 -- The replacement mechanism applies to entities, and is not used
8489 -- here. Eventually we may need a more general graph-copying
8490 -- routine. For now, do a sequential search to find desired node.
8492 if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
8493 and then Present (First_Real_Statement (Old_Node))
8496 Old_F : constant Node_Id := First_Real_Statement (Old_Node);
8500 N1 := First (Statements (Old_Node));
8501 N2 := First (Statements (New_Node));
8503 while N1 /= Old_F loop
8508 Set_First_Real_Statement (New_Node, N2);
8513 -- All done, return copied node
8516 end Copy_Node_With_Replacement;
8522 procedure Visit_Elist (E : Elist_Id) is
8526 Elmt := First_Elmt (E);
8528 while Elmt /= No_Elmt loop
8529 Visit_Node (Node (Elmt));
8539 procedure Visit_Field (F : Union_Id; N : Node_Id) is
8541 if F = Union_Id (Empty) then
8544 elsif F in Node_Range then
8546 -- Copy node if it is syntactic, i.e. its parent pointer is
8547 -- set to point to the field that referenced it (certain
8548 -- Itypes will also meet this criterion, which is fine, since
8549 -- these are clearly Itypes that do need to be copied, since
8550 -- we are copying their parent.)
8552 if Parent (Node_Id (F)) = N then
8553 Visit_Node (Node_Id (F));
8556 -- Another case, if we are pointing to an Itype, then we want
8557 -- to copy it if its associated node is somewhere in the tree
8560 -- Note: the exclusion of self-referential copies is just an
8561 -- optimization, since the search of the already copied list
8562 -- would catch it, but it is a common case (Etype pointing
8563 -- to itself for an Itype that is a base type).
8565 elsif Has_Extension (Node_Id (F))
8566 and then Is_Itype (Entity_Id (F))
8567 and then Node_Id (F) /= N
8573 P := Associated_Node_For_Itype (Node_Id (F));
8574 while Present (P) loop
8576 Visit_Node (Node_Id (F));
8583 -- An Itype whose parent is not being copied definitely
8584 -- should NOT be copied, since it does not belong in any
8585 -- sense to the copied subtree.
8591 elsif F in List_Range
8592 and then Parent (List_Id (F)) = N
8594 Visit_List (List_Id (F));
8603 procedure Visit_Itype (Old_Itype : Entity_Id) is
8604 New_Itype : Entity_Id;
8609 -- Itypes that describe the designated type of access to subprograms
8610 -- have the structure of subprogram declarations, with signatures,
8611 -- etc. Either we duplicate the signatures completely, or choose to
8612 -- share such itypes, which is fine because their elaboration will
8613 -- have no side effects.
8615 if Ekind (Old_Itype) = E_Subprogram_Type then
8619 New_Itype := New_Copy (Old_Itype);
8621 -- The new Itype has all the attributes of the old one, and
8622 -- we just copy the contents of the entity. However, the back-end
8623 -- needs different names for debugging purposes, so we create a
8624 -- new internal name for it in all cases.
8626 Set_Chars (New_Itype, New_Internal_Name ('T'));
8628 -- If our associated node is an entity that has already been copied,
8629 -- then set the associated node of the copy to point to the right
8630 -- copy. If we have copied an Itype that is itself the associated
8631 -- node of some previously copied Itype, then we set the right
8632 -- pointer in the other direction.
8634 if Present (Actual_Map) then
8636 -- Case of hash tables used
8638 if NCT_Hash_Tables_Used then
8640 Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
8642 if Present (Ent) then
8643 Set_Associated_Node_For_Itype (New_Itype, Ent);
8646 Ent := NCT_Itype_Assoc.Get (Old_Itype);
8647 if Present (Ent) then
8648 Set_Associated_Node_For_Itype (Ent, New_Itype);
8650 -- If the hash table has no association for this Itype and
8651 -- its associated node, enter one now.
8655 (Associated_Node_For_Itype (Old_Itype), New_Itype);
8658 -- Case of hash tables not used
8661 E := First_Elmt (Actual_Map);
8662 while Present (E) loop
8663 if Associated_Node_For_Itype (Old_Itype) = Node (E) then
8664 Set_Associated_Node_For_Itype
8665 (New_Itype, Node (Next_Elmt (E)));
8668 if Is_Type (Node (E))
8670 Old_Itype = Associated_Node_For_Itype (Node (E))
8672 Set_Associated_Node_For_Itype
8673 (Node (Next_Elmt (E)), New_Itype);
8676 E := Next_Elmt (Next_Elmt (E));
8681 if Present (Freeze_Node (New_Itype)) then
8682 Set_Is_Frozen (New_Itype, False);
8683 Set_Freeze_Node (New_Itype, Empty);
8686 -- Add new association to map
8688 if No (Actual_Map) then
8689 Actual_Map := New_Elmt_List;
8692 Append_Elmt (Old_Itype, Actual_Map);
8693 Append_Elmt (New_Itype, Actual_Map);
8695 if NCT_Hash_Tables_Used then
8696 NCT_Assoc.Set (Old_Itype, New_Itype);
8699 NCT_Table_Entries := NCT_Table_Entries + 1;
8701 if NCT_Table_Entries > NCT_Hash_Threshhold then
8702 Build_NCT_Hash_Tables;
8706 -- If a record subtype is simply copied, the entity list will be
8707 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
8709 if Ekind_In (Old_Itype, E_Record_Subtype, E_Class_Wide_Subtype) then
8710 Set_Cloned_Subtype (New_Itype, Old_Itype);
8713 -- Visit descendents that eventually get copied
8715 Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
8717 if Is_Discrete_Type (Old_Itype) then
8718 Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
8720 elsif Has_Discriminants (Base_Type (Old_Itype)) then
8721 -- ??? This should involve call to Visit_Field
8722 Visit_Elist (Discriminant_Constraint (Old_Itype));
8724 elsif Is_Array_Type (Old_Itype) then
8725 if Present (First_Index (Old_Itype)) then
8726 Visit_Field (Union_Id (List_Containing
8727 (First_Index (Old_Itype))),
8731 if Is_Packed (Old_Itype) then
8732 Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)),
8742 procedure Visit_List (L : List_Id) is
8745 if L /= No_List then
8748 while Present (N) loop
8759 procedure Visit_Node (N : Node_Or_Entity_Id) is
8761 -- Start of processing for Visit_Node
8764 -- Handle case of an Itype, which must be copied
8766 if Has_Extension (N)
8767 and then Is_Itype (N)
8769 -- Nothing to do if already in the list. This can happen with an
8770 -- Itype entity that appears more than once in the tree.
8771 -- Note that we do not want to visit descendents in this case.
8773 -- Test for already in list when hash table is used
8775 if NCT_Hash_Tables_Used then
8776 if Present (NCT_Assoc.Get (Entity_Id (N))) then
8780 -- Test for already in list when hash table not used
8786 if Present (Actual_Map) then
8787 E := First_Elmt (Actual_Map);
8788 while Present (E) loop
8789 if Node (E) = N then
8792 E := Next_Elmt (Next_Elmt (E));
8802 -- Visit descendents
8804 Visit_Field (Field1 (N), N);
8805 Visit_Field (Field2 (N), N);
8806 Visit_Field (Field3 (N), N);
8807 Visit_Field (Field4 (N), N);
8808 Visit_Field (Field5 (N), N);
8811 -- Start of processing for New_Copy_Tree
8816 -- See if we should use hash table
8818 if No (Actual_Map) then
8819 NCT_Hash_Tables_Used := False;
8826 NCT_Table_Entries := 0;
8828 Elmt := First_Elmt (Actual_Map);
8829 while Present (Elmt) loop
8830 NCT_Table_Entries := NCT_Table_Entries + 1;
8835 if NCT_Table_Entries > NCT_Hash_Threshhold then
8836 Build_NCT_Hash_Tables;
8838 NCT_Hash_Tables_Used := False;
8843 -- Hash table set up if required, now start phase one by visiting
8844 -- top node (we will recursively visit the descendents).
8846 Visit_Node (Source);
8848 -- Now the second phase of the copy can start. First we process
8849 -- all the mapped entities, copying their descendents.
8851 if Present (Actual_Map) then
8854 New_Itype : Entity_Id;
8856 Elmt := First_Elmt (Actual_Map);
8857 while Present (Elmt) loop
8859 New_Itype := Node (Elmt);
8860 Copy_Itype_With_Replacement (New_Itype);
8866 -- Now we can copy the actual tree
8868 return Copy_Node_With_Replacement (Source);
8871 -------------------------
8872 -- New_External_Entity --
8873 -------------------------
8875 function New_External_Entity
8876 (Kind : Entity_Kind;
8877 Scope_Id : Entity_Id;
8878 Sloc_Value : Source_Ptr;
8879 Related_Id : Entity_Id;
8881 Suffix_Index : Nat := 0;
8882 Prefix : Character := ' ') return Entity_Id
8884 N : constant Entity_Id :=
8885 Make_Defining_Identifier (Sloc_Value,
8887 (Chars (Related_Id), Suffix, Suffix_Index, Prefix));
8890 Set_Ekind (N, Kind);
8891 Set_Is_Internal (N, True);
8892 Append_Entity (N, Scope_Id);
8893 Set_Public_Status (N);
8895 if Kind in Type_Kind then
8896 Init_Size_Align (N);
8900 end New_External_Entity;
8902 -------------------------
8903 -- New_Internal_Entity --
8904 -------------------------
8906 function New_Internal_Entity
8907 (Kind : Entity_Kind;
8908 Scope_Id : Entity_Id;
8909 Sloc_Value : Source_Ptr;
8910 Id_Char : Character) return Entity_Id
8912 N : constant Entity_Id := Make_Temporary (Sloc_Value, Id_Char);
8915 Set_Ekind (N, Kind);
8916 Set_Is_Internal (N, True);
8917 Append_Entity (N, Scope_Id);
8919 if Kind in Type_Kind then
8920 Init_Size_Align (N);
8924 end New_Internal_Entity;
8930 function Next_Actual (Actual_Id : Node_Id) return Node_Id is
8934 -- If we are pointing at a positional parameter, it is a member of a
8935 -- node list (the list of parameters), and the next parameter is the
8936 -- next node on the list, unless we hit a parameter association, then
8937 -- we shift to using the chain whose head is the First_Named_Actual in
8938 -- the parent, and then is threaded using the Next_Named_Actual of the
8939 -- Parameter_Association. All this fiddling is because the original node
8940 -- list is in the textual call order, and what we need is the
8941 -- declaration order.
8943 if Is_List_Member (Actual_Id) then
8944 N := Next (Actual_Id);
8946 if Nkind (N) = N_Parameter_Association then
8947 return First_Named_Actual (Parent (Actual_Id));
8953 return Next_Named_Actual (Parent (Actual_Id));
8957 procedure Next_Actual (Actual_Id : in out Node_Id) is
8959 Actual_Id := Next_Actual (Actual_Id);
8962 -----------------------
8963 -- Normalize_Actuals --
8964 -----------------------
8966 -- Chain actuals according to formals of subprogram. If there are no named
8967 -- associations, the chain is simply the list of Parameter Associations,
8968 -- since the order is the same as the declaration order. If there are named
8969 -- associations, then the First_Named_Actual field in the N_Function_Call
8970 -- or N_Procedure_Call_Statement node points to the Parameter_Association
8971 -- node for the parameter that comes first in declaration order. The
8972 -- remaining named parameters are then chained in declaration order using
8973 -- Next_Named_Actual.
8975 -- This routine also verifies that the number of actuals is compatible with
8976 -- the number and default values of formals, but performs no type checking
8977 -- (type checking is done by the caller).
8979 -- If the matching succeeds, Success is set to True and the caller proceeds
8980 -- with type-checking. If the match is unsuccessful, then Success is set to
8981 -- False, and the caller attempts a different interpretation, if there is
8984 -- If the flag Report is on, the call is not overloaded, and a failure to
8985 -- match can be reported here, rather than in the caller.
8987 procedure Normalize_Actuals
8991 Success : out Boolean)
8993 Actuals : constant List_Id := Parameter_Associations (N);
8994 Actual : Node_Id := Empty;
8996 Last : Node_Id := Empty;
8997 First_Named : Node_Id := Empty;
9000 Formals_To_Match : Integer := 0;
9001 Actuals_To_Match : Integer := 0;
9003 procedure Chain (A : Node_Id);
9004 -- Add named actual at the proper place in the list, using the
9005 -- Next_Named_Actual link.
9007 function Reporting return Boolean;
9008 -- Determines if an error is to be reported. To report an error, we
9009 -- need Report to be True, and also we do not report errors caused
9010 -- by calls to init procs that occur within other init procs. Such
9011 -- errors must always be cascaded errors, since if all the types are
9012 -- declared correctly, the compiler will certainly build decent calls!
9018 procedure Chain (A : Node_Id) is
9022 -- Call node points to first actual in list
9024 Set_First_Named_Actual (N, Explicit_Actual_Parameter (A));
9027 Set_Next_Named_Actual (Last, Explicit_Actual_Parameter (A));
9031 Set_Next_Named_Actual (Last, Empty);
9038 function Reporting return Boolean is
9043 elsif not Within_Init_Proc then
9046 elsif Is_Init_Proc (Entity (Name (N))) then
9054 -- Start of processing for Normalize_Actuals
9057 if Is_Access_Type (S) then
9059 -- The name in the call is a function call that returns an access
9060 -- to subprogram. The designated type has the list of formals.
9062 Formal := First_Formal (Designated_Type (S));
9064 Formal := First_Formal (S);
9067 while Present (Formal) loop
9068 Formals_To_Match := Formals_To_Match + 1;
9069 Next_Formal (Formal);
9072 -- Find if there is a named association, and verify that no positional
9073 -- associations appear after named ones.
9075 if Present (Actuals) then
9076 Actual := First (Actuals);
9079 while Present (Actual)
9080 and then Nkind (Actual) /= N_Parameter_Association
9082 Actuals_To_Match := Actuals_To_Match + 1;
9086 if No (Actual) and Actuals_To_Match = Formals_To_Match then
9088 -- Most common case: positional notation, no defaults
9093 elsif Actuals_To_Match > Formals_To_Match then
9095 -- Too many actuals: will not work
9098 if Is_Entity_Name (Name (N)) then
9099 Error_Msg_N ("too many arguments in call to&", Name (N));
9101 Error_Msg_N ("too many arguments in call", N);
9109 First_Named := Actual;
9111 while Present (Actual) loop
9112 if Nkind (Actual) /= N_Parameter_Association then
9114 ("positional parameters not allowed after named ones", Actual);
9119 Actuals_To_Match := Actuals_To_Match + 1;
9125 if Present (Actuals) then
9126 Actual := First (Actuals);
9129 Formal := First_Formal (S);
9130 while Present (Formal) loop
9132 -- Match the formals in order. If the corresponding actual is
9133 -- positional, nothing to do. Else scan the list of named actuals
9134 -- to find the one with the right name.
9137 and then Nkind (Actual) /= N_Parameter_Association
9140 Actuals_To_Match := Actuals_To_Match - 1;
9141 Formals_To_Match := Formals_To_Match - 1;
9144 -- For named parameters, search the list of actuals to find
9145 -- one that matches the next formal name.
9147 Actual := First_Named;
9149 while Present (Actual) loop
9150 if Chars (Selector_Name (Actual)) = Chars (Formal) then
9153 Actuals_To_Match := Actuals_To_Match - 1;
9154 Formals_To_Match := Formals_To_Match - 1;
9162 if Ekind (Formal) /= E_In_Parameter
9163 or else No (Default_Value (Formal))
9166 if (Comes_From_Source (S)
9167 or else Sloc (S) = Standard_Location)
9168 and then Is_Overloadable (S)
9172 (Nkind (Parent (N)) = N_Procedure_Call_Statement
9174 (Nkind (Parent (N)) = N_Function_Call
9176 Nkind (Parent (N)) = N_Parameter_Association))
9177 and then Ekind (S) /= E_Function
9179 Set_Etype (N, Etype (S));
9181 Error_Msg_Name_1 := Chars (S);
9182 Error_Msg_Sloc := Sloc (S);
9184 ("missing argument for parameter & " &
9185 "in call to % declared #", N, Formal);
9188 elsif Is_Overloadable (S) then
9189 Error_Msg_Name_1 := Chars (S);
9191 -- Point to type derivation that generated the
9194 Error_Msg_Sloc := Sloc (Parent (S));
9197 ("missing argument for parameter & " &
9198 "in call to % (inherited) #", N, Formal);
9202 ("missing argument for parameter &", N, Formal);
9210 Formals_To_Match := Formals_To_Match - 1;
9215 Next_Formal (Formal);
9218 if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
9225 -- Find some superfluous named actual that did not get
9226 -- attached to the list of associations.
9228 Actual := First (Actuals);
9229 while Present (Actual) loop
9230 if Nkind (Actual) = N_Parameter_Association
9231 and then Actual /= Last
9232 and then No (Next_Named_Actual (Actual))
9234 Error_Msg_N ("unmatched actual & in call",
9235 Selector_Name (Actual));
9246 end Normalize_Actuals;
9248 --------------------------------
9249 -- Note_Possible_Modification --
9250 --------------------------------
9252 procedure Note_Possible_Modification (N : Node_Id; Sure : Boolean) is
9253 Modification_Comes_From_Source : constant Boolean :=
9254 Comes_From_Source (Parent (N));
9260 -- Loop to find referenced entity, if there is one
9267 if Is_Entity_Name (Exp) then
9268 Ent := Entity (Exp);
9270 -- If the entity is missing, it is an undeclared identifier,
9271 -- and there is nothing to annotate.
9277 elsif Nkind (Exp) = N_Explicit_Dereference then
9279 P : constant Node_Id := Prefix (Exp);
9282 if Nkind (P) = N_Selected_Component
9284 Entry_Formal (Entity (Selector_Name (P))))
9286 -- Case of a reference to an entry formal
9288 Ent := Entry_Formal (Entity (Selector_Name (P)));
9290 elsif Nkind (P) = N_Identifier
9291 and then Nkind (Parent (Entity (P))) = N_Object_Declaration
9292 and then Present (Expression (Parent (Entity (P))))
9293 and then Nkind (Expression (Parent (Entity (P))))
9296 -- Case of a reference to a value on which side effects have
9299 Exp := Prefix (Expression (Parent (Entity (P))));
9308 elsif Nkind (Exp) = N_Type_Conversion
9309 or else Nkind (Exp) = N_Unchecked_Type_Conversion
9311 Exp := Expression (Exp);
9314 elsif Nkind (Exp) = N_Slice
9315 or else Nkind (Exp) = N_Indexed_Component
9316 or else Nkind (Exp) = N_Selected_Component
9318 Exp := Prefix (Exp);
9325 -- Now look for entity being referenced
9327 if Present (Ent) then
9328 if Is_Object (Ent) then
9329 if Comes_From_Source (Exp)
9330 or else Modification_Comes_From_Source
9332 if Has_Pragma_Unmodified (Ent) then
9333 Error_Msg_NE ("?pragma Unmodified given for &!", N, Ent);
9336 Set_Never_Set_In_Source (Ent, False);
9339 Set_Is_True_Constant (Ent, False);
9340 Set_Current_Value (Ent, Empty);
9341 Set_Is_Known_Null (Ent, False);
9343 if not Can_Never_Be_Null (Ent) then
9344 Set_Is_Known_Non_Null (Ent, False);
9347 -- Follow renaming chain
9349 if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
9350 and then Present (Renamed_Object (Ent))
9352 Exp := Renamed_Object (Ent);
9356 -- Generate a reference only if the assignment comes from
9357 -- source. This excludes, for example, calls to a dispatching
9358 -- assignment operation when the left-hand side is tagged.
9360 if Modification_Comes_From_Source then
9361 Generate_Reference (Ent, Exp, 'm');
9364 Check_Nested_Access (Ent);
9369 -- If we are sure this is a modification from source, and we know
9370 -- this modifies a constant, then give an appropriate warning.
9372 if Overlays_Constant (Ent)
9373 and then Modification_Comes_From_Source
9377 A : constant Node_Id := Address_Clause (Ent);
9381 Exp : constant Node_Id := Expression (A);
9383 if Nkind (Exp) = N_Attribute_Reference
9384 and then Attribute_Name (Exp) = Name_Address
9385 and then Is_Entity_Name (Prefix (Exp))
9387 Error_Msg_Sloc := Sloc (A);
9389 ("constant& may be modified via address clause#?",
9390 N, Entity (Prefix (Exp)));
9400 end Note_Possible_Modification;
9402 -------------------------
9403 -- Object_Access_Level --
9404 -------------------------
9406 function Object_Access_Level (Obj : Node_Id) return Uint is
9409 -- Returns the static accessibility level of the view denoted by Obj. Note
9410 -- that the value returned is the result of a call to Scope_Depth. Only
9411 -- scope depths associated with dynamic scopes can actually be returned.
9412 -- Since only relative levels matter for accessibility checking, the fact
9413 -- that the distance between successive levels of accessibility is not
9414 -- always one is immaterial (invariant: if level(E2) is deeper than
9415 -- level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
9417 function Reference_To (Obj : Node_Id) return Node_Id;
9418 -- An explicit dereference is created when removing side-effects from
9419 -- expressions for constraint checking purposes. In this case a local
9420 -- access type is created for it. The correct access level is that of
9421 -- the original source node. We detect this case by noting that the
9422 -- prefix of the dereference is created by an object declaration whose
9423 -- initial expression is a reference.
9429 function Reference_To (Obj : Node_Id) return Node_Id is
9430 Pref : constant Node_Id := Prefix (Obj);
9432 if Is_Entity_Name (Pref)
9433 and then Nkind (Parent (Entity (Pref))) = N_Object_Declaration
9434 and then Present (Expression (Parent (Entity (Pref))))
9435 and then Nkind (Expression (Parent (Entity (Pref)))) = N_Reference
9437 return (Prefix (Expression (Parent (Entity (Pref)))));
9443 -- Start of processing for Object_Access_Level
9446 if Is_Entity_Name (Obj) then
9449 if Is_Prival (E) then
9450 E := Prival_Link (E);
9453 -- If E is a type then it denotes a current instance. For this case
9454 -- we add one to the normal accessibility level of the type to ensure
9455 -- that current instances are treated as always being deeper than
9456 -- than the level of any visible named access type (see 3.10.2(21)).
9459 return Type_Access_Level (E) + 1;
9461 elsif Present (Renamed_Object (E)) then
9462 return Object_Access_Level (Renamed_Object (E));
9464 -- Similarly, if E is a component of the current instance of a
9465 -- protected type, any instance of it is assumed to be at a deeper
9466 -- level than the type. For a protected object (whose type is an
9467 -- anonymous protected type) its components are at the same level
9468 -- as the type itself.
9470 elsif not Is_Overloadable (E)
9471 and then Ekind (Scope (E)) = E_Protected_Type
9472 and then Comes_From_Source (Scope (E))
9474 return Type_Access_Level (Scope (E)) + 1;
9477 return Scope_Depth (Enclosing_Dynamic_Scope (E));
9480 elsif Nkind (Obj) = N_Selected_Component then
9481 if Is_Access_Type (Etype (Prefix (Obj))) then
9482 return Type_Access_Level (Etype (Prefix (Obj)));
9484 return Object_Access_Level (Prefix (Obj));
9487 elsif Nkind (Obj) = N_Indexed_Component then
9488 if Is_Access_Type (Etype (Prefix (Obj))) then
9489 return Type_Access_Level (Etype (Prefix (Obj)));
9491 return Object_Access_Level (Prefix (Obj));
9494 elsif Nkind (Obj) = N_Explicit_Dereference then
9496 -- If the prefix is a selected access discriminant then we make a
9497 -- recursive call on the prefix, which will in turn check the level
9498 -- of the prefix object of the selected discriminant.
9500 if Nkind (Prefix (Obj)) = N_Selected_Component
9501 and then Ekind (Etype (Prefix (Obj))) = E_Anonymous_Access_Type
9503 Ekind (Entity (Selector_Name (Prefix (Obj)))) = E_Discriminant
9505 return Object_Access_Level (Prefix (Obj));
9507 elsif not (Comes_From_Source (Obj)) then
9509 Ref : constant Node_Id := Reference_To (Obj);
9511 if Present (Ref) then
9512 return Object_Access_Level (Ref);
9514 return Type_Access_Level (Etype (Prefix (Obj)));
9519 return Type_Access_Level (Etype (Prefix (Obj)));
9522 elsif Nkind (Obj) = N_Type_Conversion
9523 or else Nkind (Obj) = N_Unchecked_Type_Conversion
9525 return Object_Access_Level (Expression (Obj));
9527 elsif Nkind (Obj) = N_Function_Call then
9529 -- Function results are objects, so we get either the access level of
9530 -- the function or, in the case of an indirect call, the level of the
9531 -- access-to-subprogram type. (This code is used for Ada 95, but it
9532 -- looks wrong, because it seems that we should be checking the level
9533 -- of the call itself, even for Ada 95. However, using the Ada 2005
9534 -- version of the code causes regressions in several tests that are
9535 -- compiled with -gnat95. ???)
9537 if Ada_Version < Ada_05 then
9538 if Is_Entity_Name (Name (Obj)) then
9539 return Subprogram_Access_Level (Entity (Name (Obj)));
9541 return Type_Access_Level (Etype (Prefix (Name (Obj))));
9544 -- For Ada 2005, the level of the result object of a function call is
9545 -- defined to be the level of the call's innermost enclosing master.
9546 -- We determine that by querying the depth of the innermost enclosing
9550 Return_Master_Scope_Depth_Of_Call : declare
9552 function Innermost_Master_Scope_Depth
9553 (N : Node_Id) return Uint;
9554 -- Returns the scope depth of the given node's innermost
9555 -- enclosing dynamic scope (effectively the accessibility
9556 -- level of the innermost enclosing master).
9558 ----------------------------------
9559 -- Innermost_Master_Scope_Depth --
9560 ----------------------------------
9562 function Innermost_Master_Scope_Depth
9563 (N : Node_Id) return Uint
9565 Node_Par : Node_Id := Parent (N);
9568 -- Locate the nearest enclosing node (by traversing Parents)
9569 -- that Defining_Entity can be applied to, and return the
9570 -- depth of that entity's nearest enclosing dynamic scope.
9572 while Present (Node_Par) loop
9573 case Nkind (Node_Par) is
9574 when N_Component_Declaration |
9575 N_Entry_Declaration |
9576 N_Formal_Object_Declaration |
9577 N_Formal_Type_Declaration |
9578 N_Full_Type_Declaration |
9579 N_Incomplete_Type_Declaration |
9580 N_Loop_Parameter_Specification |
9581 N_Object_Declaration |
9582 N_Protected_Type_Declaration |
9583 N_Private_Extension_Declaration |
9584 N_Private_Type_Declaration |
9585 N_Subtype_Declaration |
9586 N_Function_Specification |
9587 N_Procedure_Specification |
9588 N_Task_Type_Declaration |
9590 N_Generic_Instantiation |
9592 N_Implicit_Label_Declaration |
9593 N_Package_Declaration |
9594 N_Single_Task_Declaration |
9595 N_Subprogram_Declaration |
9596 N_Generic_Declaration |
9597 N_Renaming_Declaration |
9599 N_Formal_Subprogram_Declaration |
9600 N_Abstract_Subprogram_Declaration |
9602 N_Exception_Declaration |
9603 N_Formal_Package_Declaration |
9604 N_Number_Declaration |
9605 N_Package_Specification |
9606 N_Parameter_Specification |
9607 N_Single_Protected_Declaration |
9611 (Nearest_Dynamic_Scope
9612 (Defining_Entity (Node_Par)));
9618 Node_Par := Parent (Node_Par);
9621 pragma Assert (False);
9623 -- Should never reach the following return
9625 return Scope_Depth (Current_Scope) + 1;
9626 end Innermost_Master_Scope_Depth;
9628 -- Start of processing for Return_Master_Scope_Depth_Of_Call
9631 return Innermost_Master_Scope_Depth (Obj);
9632 end Return_Master_Scope_Depth_Of_Call;
9635 -- For convenience we handle qualified expressions, even though
9636 -- they aren't technically object names.
9638 elsif Nkind (Obj) = N_Qualified_Expression then
9639 return Object_Access_Level (Expression (Obj));
9641 -- Otherwise return the scope level of Standard.
9642 -- (If there are cases that fall through
9643 -- to this point they will be treated as
9644 -- having global accessibility for now. ???)
9647 return Scope_Depth (Standard_Standard);
9649 end Object_Access_Level;
9651 -----------------------
9652 -- Private_Component --
9653 -----------------------
9655 function Private_Component (Type_Id : Entity_Id) return Entity_Id is
9656 Ancestor : constant Entity_Id := Base_Type (Type_Id);
9658 function Trace_Components
9660 Check : Boolean) return Entity_Id;
9661 -- Recursive function that does the work, and checks against circular
9662 -- definition for each subcomponent type.
9664 ----------------------
9665 -- Trace_Components --
9666 ----------------------
9668 function Trace_Components
9670 Check : Boolean) return Entity_Id
9672 Btype : constant Entity_Id := Base_Type (T);
9673 Component : Entity_Id;
9675 Candidate : Entity_Id := Empty;
9678 if Check and then Btype = Ancestor then
9679 Error_Msg_N ("circular type definition", Type_Id);
9683 if Is_Private_Type (Btype)
9684 and then not Is_Generic_Type (Btype)
9686 if Present (Full_View (Btype))
9687 and then Is_Record_Type (Full_View (Btype))
9688 and then not Is_Frozen (Btype)
9690 -- To indicate that the ancestor depends on a private type, the
9691 -- current Btype is sufficient. However, to check for circular
9692 -- definition we must recurse on the full view.
9694 Candidate := Trace_Components (Full_View (Btype), True);
9696 if Candidate = Any_Type then
9706 elsif Is_Array_Type (Btype) then
9707 return Trace_Components (Component_Type (Btype), True);
9709 elsif Is_Record_Type (Btype) then
9710 Component := First_Entity (Btype);
9711 while Present (Component) loop
9713 -- Skip anonymous types generated by constrained components
9715 if not Is_Type (Component) then
9716 P := Trace_Components (Etype (Component), True);
9719 if P = Any_Type then
9727 Next_Entity (Component);
9735 end Trace_Components;
9737 -- Start of processing for Private_Component
9740 return Trace_Components (Type_Id, False);
9741 end Private_Component;
9743 ---------------------------
9744 -- Primitive_Names_Match --
9745 ---------------------------
9747 function Primitive_Names_Match (E1, E2 : Entity_Id) return Boolean is
9749 function Non_Internal_Name (E : Entity_Id) return Name_Id;
9750 -- Given an internal name, returns the corresponding non-internal name
9752 ------------------------
9753 -- Non_Internal_Name --
9754 ------------------------
9756 function Non_Internal_Name (E : Entity_Id) return Name_Id is
9758 Get_Name_String (Chars (E));
9759 Name_Len := Name_Len - 1;
9761 end Non_Internal_Name;
9763 -- Start of processing for Primitive_Names_Match
9766 pragma Assert (Present (E1) and then Present (E2));
9768 return Chars (E1) = Chars (E2)
9770 (not Is_Internal_Name (Chars (E1))
9771 and then Is_Internal_Name (Chars (E2))
9772 and then Non_Internal_Name (E2) = Chars (E1))
9774 (not Is_Internal_Name (Chars (E2))
9775 and then Is_Internal_Name (Chars (E1))
9776 and then Non_Internal_Name (E1) = Chars (E2))
9778 (Is_Predefined_Dispatching_Operation (E1)
9779 and then Is_Predefined_Dispatching_Operation (E2)
9780 and then Same_TSS (E1, E2))
9782 (Is_Init_Proc (E1) and then Is_Init_Proc (E2));
9783 end Primitive_Names_Match;
9785 -----------------------
9786 -- Process_End_Label --
9787 -----------------------
9789 procedure Process_End_Label
9798 Label_Ref : Boolean;
9799 -- Set True if reference to end label itself is required
9802 -- Gets set to the operator symbol or identifier that references the
9803 -- entity Ent. For the child unit case, this is the identifier from the
9804 -- designator. For other cases, this is simply Endl.
9806 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id);
9807 -- N is an identifier node that appears as a parent unit reference in
9808 -- the case where Ent is a child unit. This procedure generates an
9809 -- appropriate cross-reference entry. E is the corresponding entity.
9811 -------------------------
9812 -- Generate_Parent_Ref --
9813 -------------------------
9815 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id) is
9817 -- If names do not match, something weird, skip reference
9819 if Chars (E) = Chars (N) then
9821 -- Generate the reference. We do NOT consider this as a reference
9822 -- for unreferenced symbol purposes.
9824 Generate_Reference (E, N, 'r', Set_Ref => False, Force => True);
9827 Style.Check_Identifier (N, E);
9830 end Generate_Parent_Ref;
9832 -- Start of processing for Process_End_Label
9835 -- If no node, ignore. This happens in some error situations, and
9836 -- also for some internally generated structures where no end label
9837 -- references are required in any case.
9843 -- Nothing to do if no End_Label, happens for internally generated
9844 -- constructs where we don't want an end label reference anyway. Also
9845 -- nothing to do if Endl is a string literal, which means there was
9846 -- some prior error (bad operator symbol)
9848 Endl := End_Label (N);
9850 if No (Endl) or else Nkind (Endl) = N_String_Literal then
9854 -- Reference node is not in extended main source unit
9856 if not In_Extended_Main_Source_Unit (N) then
9858 -- Generally we do not collect references except for the extended
9859 -- main source unit. The one exception is the 'e' entry for a
9860 -- package spec, where it is useful for a client to have the
9861 -- ending information to define scopes.
9869 -- For this case, we can ignore any parent references, but we
9870 -- need the package name itself for the 'e' entry.
9872 if Nkind (Endl) = N_Designator then
9873 Endl := Identifier (Endl);
9877 -- Reference is in extended main source unit
9882 -- For designator, generate references for the parent entries
9884 if Nkind (Endl) = N_Designator then
9886 -- Generate references for the prefix if the END line comes from
9887 -- source (otherwise we do not need these references) We climb the
9888 -- scope stack to find the expected entities.
9890 if Comes_From_Source (Endl) then
9892 Scop := Current_Scope;
9893 while Nkind (Nam) = N_Selected_Component loop
9894 Scop := Scope (Scop);
9895 exit when No (Scop);
9896 Generate_Parent_Ref (Selector_Name (Nam), Scop);
9897 Nam := Prefix (Nam);
9900 if Present (Scop) then
9901 Generate_Parent_Ref (Nam, Scope (Scop));
9905 Endl := Identifier (Endl);
9909 -- If the end label is not for the given entity, then either we have
9910 -- some previous error, or this is a generic instantiation for which
9911 -- we do not need to make a cross-reference in this case anyway. In
9912 -- either case we simply ignore the call.
9914 if Chars (Ent) /= Chars (Endl) then
9918 -- If label was really there, then generate a normal reference and then
9919 -- adjust the location in the end label to point past the name (which
9920 -- should almost always be the semicolon).
9924 if Comes_From_Source (Endl) then
9926 -- If a label reference is required, then do the style check and
9927 -- generate an l-type cross-reference entry for the label
9931 Style.Check_Identifier (Endl, Ent);
9934 Generate_Reference (Ent, Endl, 'l', Set_Ref => False);
9937 -- Set the location to point past the label (normally this will
9938 -- mean the semicolon immediately following the label). This is
9939 -- done for the sake of the 'e' or 't' entry generated below.
9941 Get_Decoded_Name_String (Chars (Endl));
9942 Set_Sloc (Endl, Sloc (Endl) + Source_Ptr (Name_Len));
9945 -- Now generate the e/t reference
9947 Generate_Reference (Ent, Endl, Typ, Set_Ref => False, Force => True);
9949 -- Restore Sloc, in case modified above, since we have an identifier
9950 -- and the normal Sloc should be left set in the tree.
9952 Set_Sloc (Endl, Loc);
9953 end Process_End_Label;
9959 -- We do the conversion to get the value of the real string by using
9960 -- the scanner, see Sinput for details on use of the internal source
9961 -- buffer for scanning internal strings.
9963 function Real_Convert (S : String) return Node_Id is
9964 Save_Src : constant Source_Buffer_Ptr := Source;
9968 Source := Internal_Source_Ptr;
9971 for J in S'Range loop
9972 Source (Source_Ptr (J)) := S (J);
9975 Source (S'Length + 1) := EOF;
9977 if Source (Scan_Ptr) = '-' then
9979 Scan_Ptr := Scan_Ptr + 1;
9987 Set_Realval (Token_Node, UR_Negate (Realval (Token_Node)));
9994 ------------------------------------
9995 -- References_Generic_Formal_Type --
9996 ------------------------------------
9998 function References_Generic_Formal_Type (N : Node_Id) return Boolean is
10000 function Process (N : Node_Id) return Traverse_Result;
10001 -- Process one node in search for generic formal type
10007 function Process (N : Node_Id) return Traverse_Result is
10009 if Nkind (N) in N_Has_Entity then
10011 E : constant Entity_Id := Entity (N);
10013 if Present (E) then
10014 if Is_Generic_Type (E) then
10016 elsif Present (Etype (E))
10017 and then Is_Generic_Type (Etype (E))
10028 function Traverse is new Traverse_Func (Process);
10029 -- Traverse tree to look for generic type
10032 if Inside_A_Generic then
10033 return Traverse (N) = Abandon;
10037 end References_Generic_Formal_Type;
10039 --------------------
10040 -- Remove_Homonym --
10041 --------------------
10043 procedure Remove_Homonym (E : Entity_Id) is
10044 Prev : Entity_Id := Empty;
10048 if E = Current_Entity (E) then
10049 if Present (Homonym (E)) then
10050 Set_Current_Entity (Homonym (E));
10052 Set_Name_Entity_Id (Chars (E), Empty);
10055 H := Current_Entity (E);
10056 while Present (H) and then H /= E loop
10061 Set_Homonym (Prev, Homonym (E));
10063 end Remove_Homonym;
10065 ---------------------
10066 -- Rep_To_Pos_Flag --
10067 ---------------------
10069 function Rep_To_Pos_Flag (E : Entity_Id; Loc : Source_Ptr) return Node_Id is
10071 return New_Occurrence_Of
10072 (Boolean_Literals (not Range_Checks_Suppressed (E)), Loc);
10073 end Rep_To_Pos_Flag;
10075 --------------------
10076 -- Require_Entity --
10077 --------------------
10079 procedure Require_Entity (N : Node_Id) is
10081 if Is_Entity_Name (N) and then No (Entity (N)) then
10082 if Total_Errors_Detected /= 0 then
10083 Set_Entity (N, Any_Id);
10085 raise Program_Error;
10088 end Require_Entity;
10090 ------------------------------
10091 -- Requires_Transient_Scope --
10092 ------------------------------
10094 -- A transient scope is required when variable-sized temporaries are
10095 -- allocated in the primary or secondary stack, or when finalization
10096 -- actions must be generated before the next instruction.
10098 function Requires_Transient_Scope (Id : Entity_Id) return Boolean is
10099 Typ : constant Entity_Id := Underlying_Type (Id);
10101 -- Start of processing for Requires_Transient_Scope
10104 -- This is a private type which is not completed yet. This can only
10105 -- happen in a default expression (of a formal parameter or of a
10106 -- record component). Do not expand transient scope in this case
10111 -- Do not expand transient scope for non-existent procedure return
10113 elsif Typ = Standard_Void_Type then
10116 -- Elementary types do not require a transient scope
10118 elsif Is_Elementary_Type (Typ) then
10121 -- Generally, indefinite subtypes require a transient scope, since the
10122 -- back end cannot generate temporaries, since this is not a valid type
10123 -- for declaring an object. It might be possible to relax this in the
10124 -- future, e.g. by declaring the maximum possible space for the type.
10126 elsif Is_Indefinite_Subtype (Typ) then
10129 -- Functions returning tagged types may dispatch on result so their
10130 -- returned value is allocated on the secondary stack. Controlled
10131 -- type temporaries need finalization.
10133 elsif Is_Tagged_Type (Typ)
10134 or else Has_Controlled_Component (Typ)
10136 return not Is_Value_Type (Typ);
10140 elsif Is_Record_Type (Typ) then
10144 Comp := First_Entity (Typ);
10145 while Present (Comp) loop
10146 if Ekind (Comp) = E_Component
10147 and then Requires_Transient_Scope (Etype (Comp))
10151 Next_Entity (Comp);
10158 -- String literal types never require transient scope
10160 elsif Ekind (Typ) = E_String_Literal_Subtype then
10163 -- Array type. Note that we already know that this is a constrained
10164 -- array, since unconstrained arrays will fail the indefinite test.
10166 elsif Is_Array_Type (Typ) then
10168 -- If component type requires a transient scope, the array does too
10170 if Requires_Transient_Scope (Component_Type (Typ)) then
10173 -- Otherwise, we only need a transient scope if the size is not
10174 -- known at compile time.
10177 return not Size_Known_At_Compile_Time (Typ);
10180 -- All other cases do not require a transient scope
10185 end Requires_Transient_Scope;
10187 --------------------------
10188 -- Reset_Analyzed_Flags --
10189 --------------------------
10191 procedure Reset_Analyzed_Flags (N : Node_Id) is
10193 function Clear_Analyzed (N : Node_Id) return Traverse_Result;
10194 -- Function used to reset Analyzed flags in tree. Note that we do
10195 -- not reset Analyzed flags in entities, since there is no need to
10196 -- reanalyze entities, and indeed, it is wrong to do so, since it
10197 -- can result in generating auxiliary stuff more than once.
10199 --------------------
10200 -- Clear_Analyzed --
10201 --------------------
10203 function Clear_Analyzed (N : Node_Id) return Traverse_Result is
10205 if not Has_Extension (N) then
10206 Set_Analyzed (N, False);
10210 end Clear_Analyzed;
10212 procedure Reset_Analyzed is new Traverse_Proc (Clear_Analyzed);
10214 -- Start of processing for Reset_Analyzed_Flags
10217 Reset_Analyzed (N);
10218 end Reset_Analyzed_Flags;
10220 ---------------------------
10221 -- Safe_To_Capture_Value --
10222 ---------------------------
10224 function Safe_To_Capture_Value
10227 Cond : Boolean := False) return Boolean
10230 -- The only entities for which we track constant values are variables
10231 -- which are not renamings, constants, out parameters, and in out
10232 -- parameters, so check if we have this case.
10234 -- Note: it may seem odd to track constant values for constants, but in
10235 -- fact this routine is used for other purposes than simply capturing
10236 -- the value. In particular, the setting of Known[_Non]_Null.
10238 if (Ekind (Ent) = E_Variable and then No (Renamed_Object (Ent)))
10240 Ekind (Ent) = E_Constant
10242 Ekind (Ent) = E_Out_Parameter
10244 Ekind (Ent) = E_In_Out_Parameter
10248 -- For conditionals, we also allow loop parameters and all formals,
10249 -- including in parameters.
10253 (Ekind (Ent) = E_Loop_Parameter
10255 Ekind (Ent) = E_In_Parameter)
10259 -- For all other cases, not just unsafe, but impossible to capture
10260 -- Current_Value, since the above are the only entities which have
10261 -- Current_Value fields.
10267 -- Skip if volatile or aliased, since funny things might be going on in
10268 -- these cases which we cannot necessarily track. Also skip any variable
10269 -- for which an address clause is given, or whose address is taken. Also
10270 -- never capture value of library level variables (an attempt to do so
10271 -- can occur in the case of package elaboration code).
10273 if Treat_As_Volatile (Ent)
10274 or else Is_Aliased (Ent)
10275 or else Present (Address_Clause (Ent))
10276 or else Address_Taken (Ent)
10277 or else (Is_Library_Level_Entity (Ent)
10278 and then Ekind (Ent) = E_Variable)
10283 -- OK, all above conditions are met. We also require that the scope of
10284 -- the reference be the same as the scope of the entity, not counting
10285 -- packages and blocks and loops.
10288 E_Scope : constant Entity_Id := Scope (Ent);
10289 R_Scope : Entity_Id;
10292 R_Scope := Current_Scope;
10293 while R_Scope /= Standard_Standard loop
10294 exit when R_Scope = E_Scope;
10296 if not Ekind_In (R_Scope, E_Package, E_Block, E_Loop) then
10299 R_Scope := Scope (R_Scope);
10304 -- We also require that the reference does not appear in a context
10305 -- where it is not sure to be executed (i.e. a conditional context
10306 -- or an exception handler). We skip this if Cond is True, since the
10307 -- capturing of values from conditional tests handles this ok.
10321 while Present (P) loop
10322 if Nkind (P) = N_If_Statement
10323 or else Nkind (P) = N_Case_Statement
10324 or else (Nkind (P) in N_Short_Circuit
10325 and then Desc = Right_Opnd (P))
10326 or else (Nkind (P) = N_Conditional_Expression
10327 and then Desc /= First (Expressions (P)))
10328 or else Nkind (P) = N_Exception_Handler
10329 or else Nkind (P) = N_Selective_Accept
10330 or else Nkind (P) = N_Conditional_Entry_Call
10331 or else Nkind (P) = N_Timed_Entry_Call
10332 or else Nkind (P) = N_Asynchronous_Select
10342 -- OK, looks safe to set value
10345 end Safe_To_Capture_Value;
10351 function Same_Name (N1, N2 : Node_Id) return Boolean is
10352 K1 : constant Node_Kind := Nkind (N1);
10353 K2 : constant Node_Kind := Nkind (N2);
10356 if (K1 = N_Identifier or else K1 = N_Defining_Identifier)
10357 and then (K2 = N_Identifier or else K2 = N_Defining_Identifier)
10359 return Chars (N1) = Chars (N2);
10361 elsif (K1 = N_Selected_Component or else K1 = N_Expanded_Name)
10362 and then (K2 = N_Selected_Component or else K2 = N_Expanded_Name)
10364 return Same_Name (Selector_Name (N1), Selector_Name (N2))
10365 and then Same_Name (Prefix (N1), Prefix (N2));
10376 function Same_Object (Node1, Node2 : Node_Id) return Boolean is
10377 N1 : constant Node_Id := Original_Node (Node1);
10378 N2 : constant Node_Id := Original_Node (Node2);
10379 -- We do the tests on original nodes, since we are most interested
10380 -- in the original source, not any expansion that got in the way.
10382 K1 : constant Node_Kind := Nkind (N1);
10383 K2 : constant Node_Kind := Nkind (N2);
10386 -- First case, both are entities with same entity
10388 if K1 in N_Has_Entity
10389 and then K2 in N_Has_Entity
10390 and then Present (Entity (N1))
10391 and then Present (Entity (N2))
10392 and then (Ekind (Entity (N1)) = E_Variable
10394 Ekind (Entity (N1)) = E_Constant)
10395 and then Entity (N1) = Entity (N2)
10399 -- Second case, selected component with same selector, same record
10401 elsif K1 = N_Selected_Component
10402 and then K2 = N_Selected_Component
10403 and then Chars (Selector_Name (N1)) = Chars (Selector_Name (N2))
10405 return Same_Object (Prefix (N1), Prefix (N2));
10407 -- Third case, indexed component with same subscripts, same array
10409 elsif K1 = N_Indexed_Component
10410 and then K2 = N_Indexed_Component
10411 and then Same_Object (Prefix (N1), Prefix (N2))
10416 E1 := First (Expressions (N1));
10417 E2 := First (Expressions (N2));
10418 while Present (E1) loop
10419 if not Same_Value (E1, E2) then
10430 -- Fourth case, slice of same array with same bounds
10433 and then K2 = N_Slice
10434 and then Nkind (Discrete_Range (N1)) = N_Range
10435 and then Nkind (Discrete_Range (N2)) = N_Range
10436 and then Same_Value (Low_Bound (Discrete_Range (N1)),
10437 Low_Bound (Discrete_Range (N2)))
10438 and then Same_Value (High_Bound (Discrete_Range (N1)),
10439 High_Bound (Discrete_Range (N2)))
10441 return Same_Name (Prefix (N1), Prefix (N2));
10443 -- All other cases, not clearly the same object
10454 function Same_Type (T1, T2 : Entity_Id) return Boolean is
10459 elsif not Is_Constrained (T1)
10460 and then not Is_Constrained (T2)
10461 and then Base_Type (T1) = Base_Type (T2)
10465 -- For now don't bother with case of identical constraints, to be
10466 -- fiddled with later on perhaps (this is only used for optimization
10467 -- purposes, so it is not critical to do a best possible job)
10478 function Same_Value (Node1, Node2 : Node_Id) return Boolean is
10480 if Compile_Time_Known_Value (Node1)
10481 and then Compile_Time_Known_Value (Node2)
10482 and then Expr_Value (Node1) = Expr_Value (Node2)
10485 elsif Same_Object (Node1, Node2) then
10492 ------------------------
10493 -- Scope_Is_Transient --
10494 ------------------------
10496 function Scope_Is_Transient return Boolean is
10498 return Scope_Stack.Table (Scope_Stack.Last).Is_Transient;
10499 end Scope_Is_Transient;
10505 function Scope_Within (Scope1, Scope2 : Entity_Id) return Boolean is
10510 while Scop /= Standard_Standard loop
10511 Scop := Scope (Scop);
10513 if Scop = Scope2 then
10521 --------------------------
10522 -- Scope_Within_Or_Same --
10523 --------------------------
10525 function Scope_Within_Or_Same (Scope1, Scope2 : Entity_Id) return Boolean is
10530 while Scop /= Standard_Standard loop
10531 if Scop = Scope2 then
10534 Scop := Scope (Scop);
10539 end Scope_Within_Or_Same;
10541 --------------------
10542 -- Set_Convention --
10543 --------------------
10545 procedure Set_Convention (E : Entity_Id; Val : Snames.Convention_Id) is
10547 Basic_Set_Convention (E, Val);
10550 and then Is_Access_Subprogram_Type (Base_Type (E))
10551 and then Has_Foreign_Convention (E)
10553 Set_Can_Use_Internal_Rep (E, False);
10555 end Set_Convention;
10557 ------------------------
10558 -- Set_Current_Entity --
10559 ------------------------
10561 -- The given entity is to be set as the currently visible definition
10562 -- of its associated name (i.e. the Node_Id associated with its name).
10563 -- All we have to do is to get the name from the identifier, and
10564 -- then set the associated Node_Id to point to the given entity.
10566 procedure Set_Current_Entity (E : Entity_Id) is
10568 Set_Name_Entity_Id (Chars (E), E);
10569 end Set_Current_Entity;
10571 ---------------------------
10572 -- Set_Debug_Info_Needed --
10573 ---------------------------
10575 procedure Set_Debug_Info_Needed (T : Entity_Id) is
10577 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id);
10578 pragma Inline (Set_Debug_Info_Needed_If_Not_Set);
10579 -- Used to set debug info in a related node if not set already
10581 --------------------------------------
10582 -- Set_Debug_Info_Needed_If_Not_Set --
10583 --------------------------------------
10585 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id) is
10588 and then not Needs_Debug_Info (E)
10590 Set_Debug_Info_Needed (E);
10592 -- For a private type, indicate that the full view also needs
10593 -- debug information.
10596 and then Is_Private_Type (E)
10597 and then Present (Full_View (E))
10599 Set_Debug_Info_Needed (Full_View (E));
10602 end Set_Debug_Info_Needed_If_Not_Set;
10604 -- Start of processing for Set_Debug_Info_Needed
10607 -- Nothing to do if argument is Empty or has Debug_Info_Off set, which
10608 -- indicates that Debug_Info_Needed is never required for the entity.
10611 or else Debug_Info_Off (T)
10616 -- Set flag in entity itself. Note that we will go through the following
10617 -- circuitry even if the flag is already set on T. That's intentional,
10618 -- it makes sure that the flag will be set in subsidiary entities.
10620 Set_Needs_Debug_Info (T);
10622 -- Set flag on subsidiary entities if not set already
10624 if Is_Object (T) then
10625 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
10627 elsif Is_Type (T) then
10628 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
10630 if Is_Record_Type (T) then
10632 Ent : Entity_Id := First_Entity (T);
10634 while Present (Ent) loop
10635 Set_Debug_Info_Needed_If_Not_Set (Ent);
10640 -- For a class wide subtype, we also need debug information
10641 -- for the equivalent type.
10643 if Ekind (T) = E_Class_Wide_Subtype then
10644 Set_Debug_Info_Needed_If_Not_Set (Equivalent_Type (T));
10647 elsif Is_Array_Type (T) then
10648 Set_Debug_Info_Needed_If_Not_Set (Component_Type (T));
10651 Indx : Node_Id := First_Index (T);
10653 while Present (Indx) loop
10654 Set_Debug_Info_Needed_If_Not_Set (Etype (Indx));
10655 Indx := Next_Index (Indx);
10659 if Is_Packed (T) then
10660 Set_Debug_Info_Needed_If_Not_Set (Packed_Array_Type (T));
10663 elsif Is_Access_Type (T) then
10664 Set_Debug_Info_Needed_If_Not_Set (Directly_Designated_Type (T));
10666 elsif Is_Private_Type (T) then
10667 Set_Debug_Info_Needed_If_Not_Set (Full_View (T));
10669 elsif Is_Protected_Type (T) then
10670 Set_Debug_Info_Needed_If_Not_Set (Corresponding_Record_Type (T));
10673 end Set_Debug_Info_Needed;
10675 ---------------------------------
10676 -- Set_Entity_With_Style_Check --
10677 ---------------------------------
10679 procedure Set_Entity_With_Style_Check (N : Node_Id; Val : Entity_Id) is
10680 Val_Actual : Entity_Id;
10684 Set_Entity (N, Val);
10687 and then not Suppress_Style_Checks (Val)
10688 and then not In_Instance
10690 if Nkind (N) = N_Identifier then
10692 elsif Nkind (N) = N_Expanded_Name then
10693 Nod := Selector_Name (N);
10698 -- A special situation arises for derived operations, where we want
10699 -- to do the check against the parent (since the Sloc of the derived
10700 -- operation points to the derived type declaration itself).
10703 while not Comes_From_Source (Val_Actual)
10704 and then Nkind (Val_Actual) in N_Entity
10705 and then (Ekind (Val_Actual) = E_Enumeration_Literal
10706 or else Is_Subprogram (Val_Actual)
10707 or else Is_Generic_Subprogram (Val_Actual))
10708 and then Present (Alias (Val_Actual))
10710 Val_Actual := Alias (Val_Actual);
10713 -- Renaming declarations for generic actuals do not come from source,
10714 -- and have a different name from that of the entity they rename, so
10715 -- there is no style check to perform here.
10717 if Chars (Nod) = Chars (Val_Actual) then
10718 Style.Check_Identifier (Nod, Val_Actual);
10722 Set_Entity (N, Val);
10723 end Set_Entity_With_Style_Check;
10725 ------------------------
10726 -- Set_Name_Entity_Id --
10727 ------------------------
10729 procedure Set_Name_Entity_Id (Id : Name_Id; Val : Entity_Id) is
10731 Set_Name_Table_Info (Id, Int (Val));
10732 end Set_Name_Entity_Id;
10734 ---------------------
10735 -- Set_Next_Actual --
10736 ---------------------
10738 procedure Set_Next_Actual (Ass1_Id : Node_Id; Ass2_Id : Node_Id) is
10740 if Nkind (Parent (Ass1_Id)) = N_Parameter_Association then
10741 Set_First_Named_Actual (Parent (Ass1_Id), Ass2_Id);
10743 end Set_Next_Actual;
10745 ----------------------------------
10746 -- Set_Optimize_Alignment_Flags --
10747 ----------------------------------
10749 procedure Set_Optimize_Alignment_Flags (E : Entity_Id) is
10751 if Optimize_Alignment = 'S' then
10752 Set_Optimize_Alignment_Space (E);
10753 elsif Optimize_Alignment = 'T' then
10754 Set_Optimize_Alignment_Time (E);
10756 end Set_Optimize_Alignment_Flags;
10758 -----------------------
10759 -- Set_Public_Status --
10760 -----------------------
10762 procedure Set_Public_Status (Id : Entity_Id) is
10763 S : constant Entity_Id := Current_Scope;
10765 function Within_HSS_Or_If (E : Entity_Id) return Boolean;
10766 -- Determines if E is defined within handled statement sequence or
10767 -- an if statement, returns True if so, False otherwise.
10769 ----------------------
10770 -- Within_HSS_Or_If --
10771 ----------------------
10773 function Within_HSS_Or_If (E : Entity_Id) return Boolean is
10776 N := Declaration_Node (E);
10783 elsif Nkind_In (N, N_Handled_Sequence_Of_Statements,
10789 end Within_HSS_Or_If;
10791 -- Start of processing for Set_Public_Status
10794 -- Everything in the scope of Standard is public
10796 if S = Standard_Standard then
10797 Set_Is_Public (Id);
10799 -- Entity is definitely not public if enclosing scope is not public
10801 elsif not Is_Public (S) then
10804 -- An object or function declaration that occurs in a handled sequence
10805 -- of statements or within an if statement is the declaration for a
10806 -- temporary object or local subprogram generated by the expander. It
10807 -- never needs to be made public and furthermore, making it public can
10808 -- cause back end problems.
10810 elsif Nkind_In (Parent (Id), N_Object_Declaration,
10811 N_Function_Specification)
10812 and then Within_HSS_Or_If (Id)
10816 -- Entities in public packages or records are public
10818 elsif Ekind (S) = E_Package or Is_Record_Type (S) then
10819 Set_Is_Public (Id);
10821 -- The bounds of an entry family declaration can generate object
10822 -- declarations that are visible to the back-end, e.g. in the
10823 -- the declaration of a composite type that contains tasks.
10825 elsif Is_Concurrent_Type (S)
10826 and then not Has_Completion (S)
10827 and then Nkind (Parent (Id)) = N_Object_Declaration
10829 Set_Is_Public (Id);
10831 end Set_Public_Status;
10833 -----------------------------
10834 -- Set_Referenced_Modified --
10835 -----------------------------
10837 procedure Set_Referenced_Modified (N : Node_Id; Out_Param : Boolean) is
10841 -- Deal with indexed or selected component where prefix is modified
10843 if Nkind_In (N, N_Indexed_Component, N_Selected_Component) then
10844 Pref := Prefix (N);
10846 -- If prefix is access type, then it is the designated object that is
10847 -- being modified, which means we have no entity to set the flag on.
10849 if No (Etype (Pref)) or else Is_Access_Type (Etype (Pref)) then
10852 -- Otherwise chase the prefix
10855 Set_Referenced_Modified (Pref, Out_Param);
10858 -- Otherwise see if we have an entity name (only other case to process)
10860 elsif Is_Entity_Name (N) and then Present (Entity (N)) then
10861 Set_Referenced_As_LHS (Entity (N), not Out_Param);
10862 Set_Referenced_As_Out_Parameter (Entity (N), Out_Param);
10864 end Set_Referenced_Modified;
10866 ----------------------------
10867 -- Set_Scope_Is_Transient --
10868 ----------------------------
10870 procedure Set_Scope_Is_Transient (V : Boolean := True) is
10872 Scope_Stack.Table (Scope_Stack.Last).Is_Transient := V;
10873 end Set_Scope_Is_Transient;
10875 -------------------
10876 -- Set_Size_Info --
10877 -------------------
10879 procedure Set_Size_Info (T1, T2 : Entity_Id) is
10881 -- We copy Esize, but not RM_Size, since in general RM_Size is
10882 -- subtype specific and does not get inherited by all subtypes.
10884 Set_Esize (T1, Esize (T2));
10885 Set_Has_Biased_Representation (T1, Has_Biased_Representation (T2));
10887 if Is_Discrete_Or_Fixed_Point_Type (T1)
10889 Is_Discrete_Or_Fixed_Point_Type (T2)
10891 Set_Is_Unsigned_Type (T1, Is_Unsigned_Type (T2));
10894 Set_Alignment (T1, Alignment (T2));
10897 --------------------
10898 -- Static_Integer --
10899 --------------------
10901 function Static_Integer (N : Node_Id) return Uint is
10903 Analyze_And_Resolve (N, Any_Integer);
10906 or else Error_Posted (N)
10907 or else Etype (N) = Any_Type
10912 if Is_Static_Expression (N) then
10913 if not Raises_Constraint_Error (N) then
10914 return Expr_Value (N);
10919 elsif Etype (N) = Any_Type then
10923 Flag_Non_Static_Expr
10924 ("static integer expression required here", N);
10927 end Static_Integer;
10929 --------------------------
10930 -- Statically_Different --
10931 --------------------------
10933 function Statically_Different (E1, E2 : Node_Id) return Boolean is
10934 R1 : constant Node_Id := Get_Referenced_Object (E1);
10935 R2 : constant Node_Id := Get_Referenced_Object (E2);
10937 return Is_Entity_Name (R1)
10938 and then Is_Entity_Name (R2)
10939 and then Entity (R1) /= Entity (R2)
10940 and then not Is_Formal (Entity (R1))
10941 and then not Is_Formal (Entity (R2));
10942 end Statically_Different;
10944 -----------------------------
10945 -- Subprogram_Access_Level --
10946 -----------------------------
10948 function Subprogram_Access_Level (Subp : Entity_Id) return Uint is
10950 if Present (Alias (Subp)) then
10951 return Subprogram_Access_Level (Alias (Subp));
10953 return Scope_Depth (Enclosing_Dynamic_Scope (Subp));
10955 end Subprogram_Access_Level;
10961 procedure Trace_Scope (N : Node_Id; E : Entity_Id; Msg : String) is
10963 if Debug_Flag_W then
10964 for J in 0 .. Scope_Stack.Last loop
10969 Write_Name (Chars (E));
10970 Write_Str (" from ");
10971 Write_Location (Sloc (N));
10976 -----------------------
10977 -- Transfer_Entities --
10978 -----------------------
10980 procedure Transfer_Entities (From : Entity_Id; To : Entity_Id) is
10981 Ent : Entity_Id := First_Entity (From);
10988 if (Last_Entity (To)) = Empty then
10989 Set_First_Entity (To, Ent);
10991 Set_Next_Entity (Last_Entity (To), Ent);
10994 Set_Last_Entity (To, Last_Entity (From));
10996 while Present (Ent) loop
10997 Set_Scope (Ent, To);
10999 if not Is_Public (Ent) then
11000 Set_Public_Status (Ent);
11003 and then Ekind (Ent) = E_Record_Subtype
11006 -- The components of the propagated Itype must be public
11012 Comp := First_Entity (Ent);
11013 while Present (Comp) loop
11014 Set_Is_Public (Comp);
11015 Next_Entity (Comp);
11024 Set_First_Entity (From, Empty);
11025 Set_Last_Entity (From, Empty);
11026 end Transfer_Entities;
11028 -----------------------
11029 -- Type_Access_Level --
11030 -----------------------
11032 function Type_Access_Level (Typ : Entity_Id) return Uint is
11036 Btyp := Base_Type (Typ);
11038 -- Ada 2005 (AI-230): For most cases of anonymous access types, we
11039 -- simply use the level where the type is declared. This is true for
11040 -- stand-alone object declarations, and for anonymous access types
11041 -- associated with components the level is the same as that of the
11042 -- enclosing composite type. However, special treatment is needed for
11043 -- the cases of access parameters, return objects of an anonymous access
11044 -- type, and, in Ada 95, access discriminants of limited types.
11046 if Ekind (Btyp) in Access_Kind then
11047 if Ekind (Btyp) = E_Anonymous_Access_Type then
11049 -- If the type is a nonlocal anonymous access type (such as for
11050 -- an access parameter) we treat it as being declared at the
11051 -- library level to ensure that names such as X.all'access don't
11052 -- fail static accessibility checks.
11054 if not Is_Local_Anonymous_Access (Typ) then
11055 return Scope_Depth (Standard_Standard);
11057 -- If this is a return object, the accessibility level is that of
11058 -- the result subtype of the enclosing function. The test here is
11059 -- little complicated, because we have to account for extended
11060 -- return statements that have been rewritten as blocks, in which
11061 -- case we have to find and the Is_Return_Object attribute of the
11062 -- itype's associated object. It would be nice to find a way to
11063 -- simplify this test, but it doesn't seem worthwhile to add a new
11064 -- flag just for purposes of this test. ???
11066 elsif Ekind (Scope (Btyp)) = E_Return_Statement
11069 and then Nkind (Associated_Node_For_Itype (Btyp)) =
11070 N_Object_Declaration
11071 and then Is_Return_Object
11072 (Defining_Identifier
11073 (Associated_Node_For_Itype (Btyp))))
11079 Scop := Scope (Scope (Btyp));
11080 while Present (Scop) loop
11081 exit when Ekind (Scop) = E_Function;
11082 Scop := Scope (Scop);
11085 -- Treat the return object's type as having the level of the
11086 -- function's result subtype (as per RM05-6.5(5.3/2)).
11088 return Type_Access_Level (Etype (Scop));
11093 Btyp := Root_Type (Btyp);
11095 -- The accessibility level of anonymous access types associated with
11096 -- discriminants is that of the current instance of the type, and
11097 -- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
11099 -- AI-402: access discriminants have accessibility based on the
11100 -- object rather than the type in Ada 2005, so the above paragraph
11103 -- ??? Needs completion with rules from AI-416
11105 if Ada_Version <= Ada_95
11106 and then Ekind (Typ) = E_Anonymous_Access_Type
11107 and then Present (Associated_Node_For_Itype (Typ))
11108 and then Nkind (Associated_Node_For_Itype (Typ)) =
11109 N_Discriminant_Specification
11111 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp)) + 1;
11115 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
11116 end Type_Access_Level;
11118 --------------------
11119 -- Ultimate_Alias --
11120 --------------------
11121 -- To do: add occurrences calling this new subprogram
11123 function Ultimate_Alias (Prim : Entity_Id) return Entity_Id is
11124 E : Entity_Id := Prim;
11127 while Present (Alias (E)) loop
11132 end Ultimate_Alias;
11134 --------------------------
11135 -- Unit_Declaration_Node --
11136 --------------------------
11138 function Unit_Declaration_Node (Unit_Id : Entity_Id) return Node_Id is
11139 N : Node_Id := Parent (Unit_Id);
11142 -- Predefined operators do not have a full function declaration
11144 if Ekind (Unit_Id) = E_Operator then
11148 -- Isn't there some better way to express the following ???
11150 while Nkind (N) /= N_Abstract_Subprogram_Declaration
11151 and then Nkind (N) /= N_Formal_Package_Declaration
11152 and then Nkind (N) /= N_Function_Instantiation
11153 and then Nkind (N) /= N_Generic_Package_Declaration
11154 and then Nkind (N) /= N_Generic_Subprogram_Declaration
11155 and then Nkind (N) /= N_Package_Declaration
11156 and then Nkind (N) /= N_Package_Body
11157 and then Nkind (N) /= N_Package_Instantiation
11158 and then Nkind (N) /= N_Package_Renaming_Declaration
11159 and then Nkind (N) /= N_Procedure_Instantiation
11160 and then Nkind (N) /= N_Protected_Body
11161 and then Nkind (N) /= N_Subprogram_Declaration
11162 and then Nkind (N) /= N_Subprogram_Body
11163 and then Nkind (N) /= N_Subprogram_Body_Stub
11164 and then Nkind (N) /= N_Subprogram_Renaming_Declaration
11165 and then Nkind (N) /= N_Task_Body
11166 and then Nkind (N) /= N_Task_Type_Declaration
11167 and then Nkind (N) not in N_Formal_Subprogram_Declaration
11168 and then Nkind (N) not in N_Generic_Renaming_Declaration
11171 pragma Assert (Present (N));
11175 end Unit_Declaration_Node;
11177 ------------------------------
11178 -- Universal_Interpretation --
11179 ------------------------------
11181 function Universal_Interpretation (Opnd : Node_Id) return Entity_Id is
11182 Index : Interp_Index;
11186 -- The argument may be a formal parameter of an operator or subprogram
11187 -- with multiple interpretations, or else an expression for an actual.
11189 if Nkind (Opnd) = N_Defining_Identifier
11190 or else not Is_Overloaded (Opnd)
11192 if Etype (Opnd) = Universal_Integer
11193 or else Etype (Opnd) = Universal_Real
11195 return Etype (Opnd);
11201 Get_First_Interp (Opnd, Index, It);
11202 while Present (It.Typ) loop
11203 if It.Typ = Universal_Integer
11204 or else It.Typ = Universal_Real
11209 Get_Next_Interp (Index, It);
11214 end Universal_Interpretation;
11220 function Unqualify (Expr : Node_Id) return Node_Id is
11222 -- Recurse to handle unlikely case of multiple levels of qualification
11224 if Nkind (Expr) = N_Qualified_Expression then
11225 return Unqualify (Expression (Expr));
11227 -- Normal case, not a qualified expression
11234 ----------------------
11235 -- Within_Init_Proc --
11236 ----------------------
11238 function Within_Init_Proc return Boolean is
11242 S := Current_Scope;
11243 while not Is_Overloadable (S) loop
11244 if S = Standard_Standard then
11251 return Is_Init_Proc (S);
11252 end Within_Init_Proc;
11258 procedure Wrong_Type (Expr : Node_Id; Expected_Type : Entity_Id) is
11259 Found_Type : constant Entity_Id := First_Subtype (Etype (Expr));
11260 Expec_Type : constant Entity_Id := First_Subtype (Expected_Type);
11262 function Has_One_Matching_Field return Boolean;
11263 -- Determines if Expec_Type is a record type with a single component or
11264 -- discriminant whose type matches the found type or is one dimensional
11265 -- array whose component type matches the found type.
11267 ----------------------------
11268 -- Has_One_Matching_Field --
11269 ----------------------------
11271 function Has_One_Matching_Field return Boolean is
11275 if Is_Array_Type (Expec_Type)
11276 and then Number_Dimensions (Expec_Type) = 1
11278 Covers (Etype (Component_Type (Expec_Type)), Found_Type)
11282 elsif not Is_Record_Type (Expec_Type) then
11286 E := First_Entity (Expec_Type);
11291 elsif (Ekind (E) /= E_Discriminant
11292 and then Ekind (E) /= E_Component)
11293 or else (Chars (E) = Name_uTag
11294 or else Chars (E) = Name_uParent)
11303 if not Covers (Etype (E), Found_Type) then
11306 elsif Present (Next_Entity (E)) then
11313 end Has_One_Matching_Field;
11315 -- Start of processing for Wrong_Type
11318 -- Don't output message if either type is Any_Type, or if a message
11319 -- has already been posted for this node. We need to do the latter
11320 -- check explicitly (it is ordinarily done in Errout), because we
11321 -- are using ! to force the output of the error messages.
11323 if Expec_Type = Any_Type
11324 or else Found_Type = Any_Type
11325 or else Error_Posted (Expr)
11329 -- In an instance, there is an ongoing problem with completion of
11330 -- type derived from private types. Their structure is what Gigi
11331 -- expects, but the Etype is the parent type rather than the
11332 -- derived private type itself. Do not flag error in this case. The
11333 -- private completion is an entity without a parent, like an Itype.
11334 -- Similarly, full and partial views may be incorrect in the instance.
11335 -- There is no simple way to insure that it is consistent ???
11337 elsif In_Instance then
11338 if Etype (Etype (Expr)) = Etype (Expected_Type)
11340 (Has_Private_Declaration (Expected_Type)
11341 or else Has_Private_Declaration (Etype (Expr)))
11342 and then No (Parent (Expected_Type))
11348 -- An interesting special check. If the expression is parenthesized
11349 -- and its type corresponds to the type of the sole component of the
11350 -- expected record type, or to the component type of the expected one
11351 -- dimensional array type, then assume we have a bad aggregate attempt.
11353 if Nkind (Expr) in N_Subexpr
11354 and then Paren_Count (Expr) /= 0
11355 and then Has_One_Matching_Field
11357 Error_Msg_N ("positional aggregate cannot have one component", Expr);
11359 -- Another special check, if we are looking for a pool-specific access
11360 -- type and we found an E_Access_Attribute_Type, then we have the case
11361 -- of an Access attribute being used in a context which needs a pool-
11362 -- specific type, which is never allowed. The one extra check we make
11363 -- is that the expected designated type covers the Found_Type.
11365 elsif Is_Access_Type (Expec_Type)
11366 and then Ekind (Found_Type) = E_Access_Attribute_Type
11367 and then Ekind (Base_Type (Expec_Type)) /= E_General_Access_Type
11368 and then Ekind (Base_Type (Expec_Type)) /= E_Anonymous_Access_Type
11370 (Designated_Type (Expec_Type), Designated_Type (Found_Type))
11372 Error_Msg_N -- CODEFIX
11373 ("result must be general access type!", Expr);
11374 Error_Msg_NE -- CODEFIX
11375 ("add ALL to }!", Expr, Expec_Type);
11377 -- Another special check, if the expected type is an integer type,
11378 -- but the expression is of type System.Address, and the parent is
11379 -- an addition or subtraction operation whose left operand is the
11380 -- expression in question and whose right operand is of an integral
11381 -- type, then this is an attempt at address arithmetic, so give
11382 -- appropriate message.
11384 elsif Is_Integer_Type (Expec_Type)
11385 and then Is_RTE (Found_Type, RE_Address)
11386 and then (Nkind (Parent (Expr)) = N_Op_Add
11388 Nkind (Parent (Expr)) = N_Op_Subtract)
11389 and then Expr = Left_Opnd (Parent (Expr))
11390 and then Is_Integer_Type (Etype (Right_Opnd (Parent (Expr))))
11393 ("address arithmetic not predefined in package System",
11396 ("\possible missing with/use of System.Storage_Elements",
11400 -- If the expected type is an anonymous access type, as for access
11401 -- parameters and discriminants, the error is on the designated types.
11403 elsif Ekind (Expec_Type) = E_Anonymous_Access_Type then
11404 if Comes_From_Source (Expec_Type) then
11405 Error_Msg_NE ("expected}!", Expr, Expec_Type);
11408 ("expected an access type with designated}",
11409 Expr, Designated_Type (Expec_Type));
11412 if Is_Access_Type (Found_Type)
11413 and then not Comes_From_Source (Found_Type)
11416 ("\\found an access type with designated}!",
11417 Expr, Designated_Type (Found_Type));
11419 if From_With_Type (Found_Type) then
11420 Error_Msg_NE ("\\found incomplete}!", Expr, Found_Type);
11421 Error_Msg_Qual_Level := 99;
11422 Error_Msg_NE -- CODEFIX
11423 ("\\missing `WITH &;", Expr, Scope (Found_Type));
11424 Error_Msg_Qual_Level := 0;
11426 Error_Msg_NE ("found}!", Expr, Found_Type);
11430 -- Normal case of one type found, some other type expected
11433 -- If the names of the two types are the same, see if some number
11434 -- of levels of qualification will help. Don't try more than three
11435 -- levels, and if we get to standard, it's no use (and probably
11436 -- represents an error in the compiler) Also do not bother with
11437 -- internal scope names.
11440 Expec_Scope : Entity_Id;
11441 Found_Scope : Entity_Id;
11444 Expec_Scope := Expec_Type;
11445 Found_Scope := Found_Type;
11447 for Levels in Int range 0 .. 3 loop
11448 if Chars (Expec_Scope) /= Chars (Found_Scope) then
11449 Error_Msg_Qual_Level := Levels;
11453 Expec_Scope := Scope (Expec_Scope);
11454 Found_Scope := Scope (Found_Scope);
11456 exit when Expec_Scope = Standard_Standard
11457 or else Found_Scope = Standard_Standard
11458 or else not Comes_From_Source (Expec_Scope)
11459 or else not Comes_From_Source (Found_Scope);
11463 if Is_Record_Type (Expec_Type)
11464 and then Present (Corresponding_Remote_Type (Expec_Type))
11466 Error_Msg_NE ("expected}!", Expr,
11467 Corresponding_Remote_Type (Expec_Type));
11469 Error_Msg_NE ("expected}!", Expr, Expec_Type);
11472 if Is_Entity_Name (Expr)
11473 and then Is_Package_Or_Generic_Package (Entity (Expr))
11475 Error_Msg_N ("\\found package name!", Expr);
11477 elsif Is_Entity_Name (Expr)
11479 (Ekind (Entity (Expr)) = E_Procedure
11481 Ekind (Entity (Expr)) = E_Generic_Procedure)
11483 if Ekind (Expec_Type) = E_Access_Subprogram_Type then
11485 ("found procedure name, possibly missing Access attribute!",
11489 ("\\found procedure name instead of function!", Expr);
11492 elsif Nkind (Expr) = N_Function_Call
11493 and then Ekind (Expec_Type) = E_Access_Subprogram_Type
11494 and then Etype (Designated_Type (Expec_Type)) = Etype (Expr)
11495 and then No (Parameter_Associations (Expr))
11498 ("found function name, possibly missing Access attribute!",
11501 -- Catch common error: a prefix or infix operator which is not
11502 -- directly visible because the type isn't.
11504 elsif Nkind (Expr) in N_Op
11505 and then Is_Overloaded (Expr)
11506 and then not Is_Immediately_Visible (Expec_Type)
11507 and then not Is_Potentially_Use_Visible (Expec_Type)
11508 and then not In_Use (Expec_Type)
11509 and then Has_Compatible_Type (Right_Opnd (Expr), Expec_Type)
11512 ("operator of the type is not directly visible!", Expr);
11514 elsif Ekind (Found_Type) = E_Void
11515 and then Present (Parent (Found_Type))
11516 and then Nkind (Parent (Found_Type)) = N_Full_Type_Declaration
11518 Error_Msg_NE ("\\found premature usage of}!", Expr, Found_Type);
11521 Error_Msg_NE ("\\found}!", Expr, Found_Type);
11524 -- A special check for cases like M1 and M2 = 0 where M1 and M2 are
11525 -- of the same modular type, and (M1 and M2) = 0 was intended.
11527 if Expec_Type = Standard_Boolean
11528 and then Is_Modular_Integer_Type (Found_Type)
11529 and then Nkind_In (Parent (Expr), N_Op_And, N_Op_Or, N_Op_Xor)
11530 and then Nkind (Right_Opnd (Parent (Expr))) in N_Op_Compare
11533 Op : constant Node_Id := Right_Opnd (Parent (Expr));
11534 L : constant Node_Id := Left_Opnd (Op);
11535 R : constant Node_Id := Right_Opnd (Op);
11537 -- The case for the message is when the left operand of the
11538 -- comparison is the same modular type, or when it is an
11539 -- integer literal (or other universal integer expression),
11540 -- which would have been typed as the modular type if the
11541 -- parens had been there.
11543 if (Etype (L) = Found_Type
11545 Etype (L) = Universal_Integer)
11546 and then Is_Integer_Type (Etype (R))
11549 ("\\possible missing parens for modular operation", Expr);
11554 -- Reset error message qualification indication
11556 Error_Msg_Qual_Level := 0;