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_Type; use Sem_Type;
54 with Sinfo; use Sinfo;
55 with Sinput; use Sinput;
56 with Stand; use Stand;
58 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;
67 package body Sem_Util is
69 ----------------------------------------
70 -- Global_Variables for New_Copy_Tree --
71 ----------------------------------------
73 -- These global variables are used by New_Copy_Tree. See description
74 -- of the body of this subprogram for details. Global variables can be
75 -- safely used by New_Copy_Tree, since there is no case of a recursive
76 -- call from the processing inside New_Copy_Tree.
78 NCT_Hash_Threshhold : constant := 20;
79 -- If there are more than this number of pairs of entries in the
80 -- map, then Hash_Tables_Used will be set, and the hash tables will
81 -- be initialized and used for the searches.
83 NCT_Hash_Tables_Used : Boolean := False;
84 -- Set to True if hash tables are in use
86 NCT_Table_Entries : Nat;
87 -- Count entries in table to see if threshhold is reached
89 NCT_Hash_Table_Setup : Boolean := False;
90 -- Set to True if hash table contains data. We set this True if we
91 -- setup the hash table with data, and leave it set permanently
92 -- from then on, this is a signal that second and subsequent users
93 -- of the hash table must clear the old entries before reuse.
95 subtype NCT_Header_Num is Int range 0 .. 511;
96 -- Defines range of headers in hash tables (512 headers)
98 ----------------------------------
99 -- Order Dependence (AI05-0144) --
100 ----------------------------------
102 -- Each actual in a call is entered into the table below. A flag indicates
103 -- whether the corresponding formal is OUT or IN OUT. Each top-level call
104 -- (procedure call, condition, assignment) examines all the actuals for a
105 -- possible order dependence. The table is reset after each such check.
107 type Actual_Name is record
109 Is_Writable : Boolean;
110 -- Comments needed???
114 package Actuals_In_Call is new Table.Table (
115 Table_Component_Type => Actual_Name,
116 Table_Index_Type => Int,
117 Table_Low_Bound => 0,
119 Table_Increment => 100,
120 Table_Name => "Actuals");
122 -----------------------
123 -- Local Subprograms --
124 -----------------------
126 function Build_Component_Subtype
129 T : Entity_Id) return Node_Id;
130 -- This function builds the subtype for Build_Actual_Subtype_Of_Component
131 -- and Build_Discriminal_Subtype_Of_Component. C is a list of constraints,
132 -- Loc is the source location, T is the original subtype.
134 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean;
135 -- Subsidiary to Is_Fully_Initialized_Type. For an unconstrained type
136 -- with discriminants whose default values are static, examine only the
137 -- components in the selected variant to determine whether all of them
140 function Has_Null_Extension (T : Entity_Id) return Boolean;
141 -- T is a derived tagged type. Check whether the type extension is null.
142 -- If the parent type is fully initialized, T can be treated as such.
144 ------------------------------
145 -- Abstract_Interface_List --
146 ------------------------------
148 function Abstract_Interface_List (Typ : Entity_Id) return List_Id is
152 if Is_Concurrent_Type (Typ) then
154 -- If we are dealing with a synchronized subtype, go to the base
155 -- type, whose declaration has the interface list.
157 -- Shouldn't this be Declaration_Node???
159 Nod := Parent (Base_Type (Typ));
161 if Nkind (Nod) = N_Full_Type_Declaration then
165 elsif Ekind (Typ) = E_Record_Type_With_Private then
166 if Nkind (Parent (Typ)) = N_Full_Type_Declaration then
167 Nod := Type_Definition (Parent (Typ));
169 elsif Nkind (Parent (Typ)) = N_Private_Type_Declaration then
170 if Present (Full_View (Typ)) then
171 Nod := Type_Definition (Parent (Full_View (Typ)));
173 -- If the full-view is not available we cannot do anything else
174 -- here (the source has errors).
180 -- Support for generic formals with interfaces is still missing ???
182 elsif Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
187 (Nkind (Parent (Typ)) = N_Private_Extension_Declaration);
191 elsif Ekind (Typ) = E_Record_Subtype then
192 Nod := Type_Definition (Parent (Etype (Typ)));
194 elsif Ekind (Typ) = E_Record_Subtype_With_Private then
196 -- Recurse, because parent may still be a private extension. Also
197 -- note that the full view of the subtype or the full view of its
198 -- base type may (both) be unavailable.
200 return Abstract_Interface_List (Etype (Typ));
202 else pragma Assert ((Ekind (Typ)) = E_Record_Type);
203 if Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
204 Nod := Formal_Type_Definition (Parent (Typ));
206 Nod := Type_Definition (Parent (Typ));
210 return Interface_List (Nod);
211 end Abstract_Interface_List;
213 --------------------------------
214 -- Add_Access_Type_To_Process --
215 --------------------------------
217 procedure Add_Access_Type_To_Process (E : Entity_Id; A : Entity_Id) is
221 Ensure_Freeze_Node (E);
222 L := Access_Types_To_Process (Freeze_Node (E));
226 Set_Access_Types_To_Process (Freeze_Node (E), L);
230 end Add_Access_Type_To_Process;
232 ----------------------------
233 -- Add_Global_Declaration --
234 ----------------------------
236 procedure Add_Global_Declaration (N : Node_Id) is
237 Aux_Node : constant Node_Id := Aux_Decls_Node (Cunit (Current_Sem_Unit));
240 if No (Declarations (Aux_Node)) then
241 Set_Declarations (Aux_Node, New_List);
244 Append_To (Declarations (Aux_Node), N);
246 end Add_Global_Declaration;
252 -- For now, just 8/16/32/64. but analyze later if AAMP is special???
254 function Addressable (V : Uint) return Boolean is
256 return V = Uint_8 or else
262 function Addressable (V : Int) return Boolean is
270 -----------------------
271 -- Alignment_In_Bits --
272 -----------------------
274 function Alignment_In_Bits (E : Entity_Id) return Uint is
276 return Alignment (E) * System_Storage_Unit;
277 end Alignment_In_Bits;
279 -----------------------------------------
280 -- Apply_Compile_Time_Constraint_Error --
281 -----------------------------------------
283 procedure Apply_Compile_Time_Constraint_Error
286 Reason : RT_Exception_Code;
287 Ent : Entity_Id := Empty;
288 Typ : Entity_Id := Empty;
289 Loc : Source_Ptr := No_Location;
290 Rep : Boolean := True;
291 Warn : Boolean := False)
293 Stat : constant Boolean := Is_Static_Expression (N);
294 R_Stat : constant Node_Id :=
295 Make_Raise_Constraint_Error (Sloc (N), Reason => Reason);
306 (Compile_Time_Constraint_Error (N, Msg, Ent, Loc, Warn => Warn));
312 -- Now we replace the node by an N_Raise_Constraint_Error node
313 -- This does not need reanalyzing, so set it as analyzed now.
316 Set_Analyzed (N, True);
319 Set_Raises_Constraint_Error (N);
321 -- Now deal with possible local raise handling
323 Possible_Local_Raise (N, Standard_Constraint_Error);
325 -- If the original expression was marked as static, the result is
326 -- still marked as static, but the Raises_Constraint_Error flag is
327 -- always set so that further static evaluation is not attempted.
330 Set_Is_Static_Expression (N);
332 end Apply_Compile_Time_Constraint_Error;
334 --------------------------
335 -- Build_Actual_Subtype --
336 --------------------------
338 function Build_Actual_Subtype
340 N : Node_Or_Entity_Id) return Node_Id
343 -- Normally Sloc (N), but may point to corresponding body in some cases
345 Constraints : List_Id;
351 Disc_Type : Entity_Id;
357 if Nkind (N) = N_Defining_Identifier then
358 Obj := New_Reference_To (N, Loc);
360 -- If this is a formal parameter of a subprogram declaration, and
361 -- we are compiling the body, we want the declaration for the
362 -- actual subtype to carry the source position of the body, to
363 -- prevent anomalies in gdb when stepping through the code.
365 if Is_Formal (N) then
367 Decl : constant Node_Id := Unit_Declaration_Node (Scope (N));
369 if Nkind (Decl) = N_Subprogram_Declaration
370 and then Present (Corresponding_Body (Decl))
372 Loc := Sloc (Corresponding_Body (Decl));
381 if Is_Array_Type (T) then
382 Constraints := New_List;
383 for J in 1 .. Number_Dimensions (T) loop
385 -- Build an array subtype declaration with the nominal subtype and
386 -- the bounds of the actual. Add the declaration in front of the
387 -- local declarations for the subprogram, for analysis before any
388 -- reference to the formal in the body.
391 Make_Attribute_Reference (Loc,
393 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
394 Attribute_Name => Name_First,
395 Expressions => New_List (
396 Make_Integer_Literal (Loc, J)));
399 Make_Attribute_Reference (Loc,
401 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
402 Attribute_Name => Name_Last,
403 Expressions => New_List (
404 Make_Integer_Literal (Loc, J)));
406 Append (Make_Range (Loc, Lo, Hi), Constraints);
409 -- If the type has unknown discriminants there is no constrained
410 -- subtype to build. This is never called for a formal or for a
411 -- lhs, so returning the type is ok ???
413 elsif Has_Unknown_Discriminants (T) then
417 Constraints := New_List;
419 -- Type T is a generic derived type, inherit the discriminants from
422 if Is_Private_Type (T)
423 and then No (Full_View (T))
425 -- T was flagged as an error if it was declared as a formal
426 -- derived type with known discriminants. In this case there
427 -- is no need to look at the parent type since T already carries
428 -- its own discriminants.
430 and then not Error_Posted (T)
432 Disc_Type := Etype (Base_Type (T));
437 Discr := First_Discriminant (Disc_Type);
438 while Present (Discr) loop
439 Append_To (Constraints,
440 Make_Selected_Component (Loc,
442 Duplicate_Subexpr_No_Checks (Obj),
443 Selector_Name => New_Occurrence_Of (Discr, Loc)));
444 Next_Discriminant (Discr);
448 Subt := Make_Temporary (Loc, 'S', Related_Node => N);
449 Set_Is_Internal (Subt);
452 Make_Subtype_Declaration (Loc,
453 Defining_Identifier => Subt,
454 Subtype_Indication =>
455 Make_Subtype_Indication (Loc,
456 Subtype_Mark => New_Reference_To (T, Loc),
458 Make_Index_Or_Discriminant_Constraint (Loc,
459 Constraints => Constraints)));
461 Mark_Rewrite_Insertion (Decl);
463 end Build_Actual_Subtype;
465 ---------------------------------------
466 -- Build_Actual_Subtype_Of_Component --
467 ---------------------------------------
469 function Build_Actual_Subtype_Of_Component
471 N : Node_Id) return Node_Id
473 Loc : constant Source_Ptr := Sloc (N);
474 P : constant Node_Id := Prefix (N);
477 Indx_Type : Entity_Id;
479 Deaccessed_T : Entity_Id;
480 -- This is either a copy of T, or if T is an access type, then it is
481 -- the directly designated type of this access type.
483 function Build_Actual_Array_Constraint return List_Id;
484 -- If one or more of the bounds of the component depends on
485 -- discriminants, build actual constraint using the discriminants
488 function Build_Actual_Record_Constraint return List_Id;
489 -- Similar to previous one, for discriminated components constrained
490 -- by the discriminant of the enclosing object.
492 -----------------------------------
493 -- Build_Actual_Array_Constraint --
494 -----------------------------------
496 function Build_Actual_Array_Constraint return List_Id is
497 Constraints : constant List_Id := New_List;
505 Indx := First_Index (Deaccessed_T);
506 while Present (Indx) loop
507 Old_Lo := Type_Low_Bound (Etype (Indx));
508 Old_Hi := Type_High_Bound (Etype (Indx));
510 if Denotes_Discriminant (Old_Lo) then
512 Make_Selected_Component (Loc,
513 Prefix => New_Copy_Tree (P),
514 Selector_Name => New_Occurrence_Of (Entity (Old_Lo), Loc));
517 Lo := New_Copy_Tree (Old_Lo);
519 -- The new bound will be reanalyzed in the enclosing
520 -- declaration. For literal bounds that come from a type
521 -- declaration, the type of the context must be imposed, so
522 -- insure that analysis will take place. For non-universal
523 -- types this is not strictly necessary.
525 Set_Analyzed (Lo, False);
528 if Denotes_Discriminant (Old_Hi) then
530 Make_Selected_Component (Loc,
531 Prefix => New_Copy_Tree (P),
532 Selector_Name => New_Occurrence_Of (Entity (Old_Hi), Loc));
535 Hi := New_Copy_Tree (Old_Hi);
536 Set_Analyzed (Hi, False);
539 Append (Make_Range (Loc, Lo, Hi), Constraints);
544 end Build_Actual_Array_Constraint;
546 ------------------------------------
547 -- Build_Actual_Record_Constraint --
548 ------------------------------------
550 function Build_Actual_Record_Constraint return List_Id is
551 Constraints : constant List_Id := New_List;
556 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
557 while Present (D) loop
558 if Denotes_Discriminant (Node (D)) then
559 D_Val := Make_Selected_Component (Loc,
560 Prefix => New_Copy_Tree (P),
561 Selector_Name => New_Occurrence_Of (Entity (Node (D)), Loc));
564 D_Val := New_Copy_Tree (Node (D));
567 Append (D_Val, Constraints);
572 end Build_Actual_Record_Constraint;
574 -- Start of processing for Build_Actual_Subtype_Of_Component
577 -- Why the test for Spec_Expression mode here???
579 if In_Spec_Expression then
582 -- More comments for the rest of this body would be good ???
584 elsif Nkind (N) = N_Explicit_Dereference then
585 if Is_Composite_Type (T)
586 and then not Is_Constrained (T)
587 and then not (Is_Class_Wide_Type (T)
588 and then Is_Constrained (Root_Type (T)))
589 and then not Has_Unknown_Discriminants (T)
591 -- If the type of the dereference is already constrained, it is an
594 if Is_Array_Type (Etype (N))
595 and then Is_Constrained (Etype (N))
599 Remove_Side_Effects (P);
600 return Build_Actual_Subtype (T, N);
607 if Ekind (T) = E_Access_Subtype then
608 Deaccessed_T := Designated_Type (T);
613 if Ekind (Deaccessed_T) = E_Array_Subtype then
614 Id := First_Index (Deaccessed_T);
615 while Present (Id) loop
616 Indx_Type := Underlying_Type (Etype (Id));
618 if Denotes_Discriminant (Type_Low_Bound (Indx_Type))
620 Denotes_Discriminant (Type_High_Bound (Indx_Type))
622 Remove_Side_Effects (P);
624 Build_Component_Subtype
625 (Build_Actual_Array_Constraint, Loc, Base_Type (T));
631 elsif Is_Composite_Type (Deaccessed_T)
632 and then Has_Discriminants (Deaccessed_T)
633 and then not Has_Unknown_Discriminants (Deaccessed_T)
635 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
636 while Present (D) loop
637 if Denotes_Discriminant (Node (D)) then
638 Remove_Side_Effects (P);
640 Build_Component_Subtype (
641 Build_Actual_Record_Constraint, Loc, Base_Type (T));
648 -- If none of the above, the actual and nominal subtypes are the same
651 end Build_Actual_Subtype_Of_Component;
653 -----------------------------
654 -- Build_Component_Subtype --
655 -----------------------------
657 function Build_Component_Subtype
660 T : Entity_Id) return Node_Id
666 -- Unchecked_Union components do not require component subtypes
668 if Is_Unchecked_Union (T) then
672 Subt := Make_Temporary (Loc, 'S');
673 Set_Is_Internal (Subt);
676 Make_Subtype_Declaration (Loc,
677 Defining_Identifier => Subt,
678 Subtype_Indication =>
679 Make_Subtype_Indication (Loc,
680 Subtype_Mark => New_Reference_To (Base_Type (T), Loc),
682 Make_Index_Or_Discriminant_Constraint (Loc,
685 Mark_Rewrite_Insertion (Decl);
687 end Build_Component_Subtype;
689 ---------------------------
690 -- Build_Default_Subtype --
691 ---------------------------
693 function Build_Default_Subtype
695 N : Node_Id) return Entity_Id
697 Loc : constant Source_Ptr := Sloc (N);
701 if not Has_Discriminants (T) or else Is_Constrained (T) then
705 Disc := First_Discriminant (T);
707 if No (Discriminant_Default_Value (Disc)) then
712 Act : constant Entity_Id := Make_Temporary (Loc, 'S');
713 Constraints : constant List_Id := New_List;
717 while Present (Disc) loop
718 Append_To (Constraints,
719 New_Copy_Tree (Discriminant_Default_Value (Disc)));
720 Next_Discriminant (Disc);
724 Make_Subtype_Declaration (Loc,
725 Defining_Identifier => Act,
726 Subtype_Indication =>
727 Make_Subtype_Indication (Loc,
728 Subtype_Mark => New_Occurrence_Of (T, Loc),
730 Make_Index_Or_Discriminant_Constraint (Loc,
731 Constraints => Constraints)));
733 Insert_Action (N, Decl);
737 end Build_Default_Subtype;
739 --------------------------------------------
740 -- Build_Discriminal_Subtype_Of_Component --
741 --------------------------------------------
743 function Build_Discriminal_Subtype_Of_Component
744 (T : Entity_Id) return Node_Id
746 Loc : constant Source_Ptr := Sloc (T);
750 function Build_Discriminal_Array_Constraint return List_Id;
751 -- If one or more of the bounds of the component depends on
752 -- discriminants, build actual constraint using the discriminants
755 function Build_Discriminal_Record_Constraint return List_Id;
756 -- Similar to previous one, for discriminated components constrained
757 -- by the discriminant of the enclosing object.
759 ----------------------------------------
760 -- Build_Discriminal_Array_Constraint --
761 ----------------------------------------
763 function Build_Discriminal_Array_Constraint return List_Id is
764 Constraints : constant List_Id := New_List;
772 Indx := First_Index (T);
773 while Present (Indx) loop
774 Old_Lo := Type_Low_Bound (Etype (Indx));
775 Old_Hi := Type_High_Bound (Etype (Indx));
777 if Denotes_Discriminant (Old_Lo) then
778 Lo := New_Occurrence_Of (Discriminal (Entity (Old_Lo)), Loc);
781 Lo := New_Copy_Tree (Old_Lo);
784 if Denotes_Discriminant (Old_Hi) then
785 Hi := New_Occurrence_Of (Discriminal (Entity (Old_Hi)), Loc);
788 Hi := New_Copy_Tree (Old_Hi);
791 Append (Make_Range (Loc, Lo, Hi), Constraints);
796 end Build_Discriminal_Array_Constraint;
798 -----------------------------------------
799 -- Build_Discriminal_Record_Constraint --
800 -----------------------------------------
802 function Build_Discriminal_Record_Constraint return List_Id is
803 Constraints : constant List_Id := New_List;
808 D := First_Elmt (Discriminant_Constraint (T));
809 while Present (D) loop
810 if Denotes_Discriminant (Node (D)) then
812 New_Occurrence_Of (Discriminal (Entity (Node (D))), Loc);
815 D_Val := New_Copy_Tree (Node (D));
818 Append (D_Val, Constraints);
823 end Build_Discriminal_Record_Constraint;
825 -- Start of processing for Build_Discriminal_Subtype_Of_Component
828 if Ekind (T) = E_Array_Subtype then
829 Id := First_Index (T);
830 while Present (Id) loop
831 if Denotes_Discriminant (Type_Low_Bound (Etype (Id))) or else
832 Denotes_Discriminant (Type_High_Bound (Etype (Id)))
834 return Build_Component_Subtype
835 (Build_Discriminal_Array_Constraint, Loc, T);
841 elsif Ekind (T) = E_Record_Subtype
842 and then Has_Discriminants (T)
843 and then not Has_Unknown_Discriminants (T)
845 D := First_Elmt (Discriminant_Constraint (T));
846 while Present (D) loop
847 if Denotes_Discriminant (Node (D)) then
848 return Build_Component_Subtype
849 (Build_Discriminal_Record_Constraint, Loc, T);
856 -- If none of the above, the actual and nominal subtypes are the same
859 end Build_Discriminal_Subtype_Of_Component;
861 ------------------------------
862 -- Build_Elaboration_Entity --
863 ------------------------------
865 procedure Build_Elaboration_Entity (N : Node_Id; Spec_Id : Entity_Id) is
866 Loc : constant Source_Ptr := Sloc (N);
868 Elab_Ent : Entity_Id;
870 procedure Set_Package_Name (Ent : Entity_Id);
871 -- Given an entity, sets the fully qualified name of the entity in
872 -- Name_Buffer, with components separated by double underscores. This
873 -- is a recursive routine that climbs the scope chain to Standard.
875 ----------------------
876 -- Set_Package_Name --
877 ----------------------
879 procedure Set_Package_Name (Ent : Entity_Id) is
881 if Scope (Ent) /= Standard_Standard then
882 Set_Package_Name (Scope (Ent));
885 Nam : constant String := Get_Name_String (Chars (Ent));
887 Name_Buffer (Name_Len + 1) := '_';
888 Name_Buffer (Name_Len + 2) := '_';
889 Name_Buffer (Name_Len + 3 .. Name_Len + Nam'Length + 2) := Nam;
890 Name_Len := Name_Len + Nam'Length + 2;
894 Get_Name_String (Chars (Ent));
896 end Set_Package_Name;
898 -- Start of processing for Build_Elaboration_Entity
901 -- Ignore if already constructed
903 if Present (Elaboration_Entity (Spec_Id)) then
907 -- Construct name of elaboration entity as xxx_E, where xxx is the unit
908 -- name with dots replaced by double underscore. We have to manually
909 -- construct this name, since it will be elaborated in the outer scope,
910 -- and thus will not have the unit name automatically prepended.
912 Set_Package_Name (Spec_Id);
916 Name_Buffer (Name_Len + 1) := '_';
917 Name_Buffer (Name_Len + 2) := 'E';
918 Name_Len := Name_Len + 2;
920 -- Create elaboration flag
923 Make_Defining_Identifier (Loc, Chars => Name_Find);
924 Set_Elaboration_Entity (Spec_Id, Elab_Ent);
927 Make_Object_Declaration (Loc,
928 Defining_Identifier => Elab_Ent,
930 New_Occurrence_Of (Standard_Boolean, Loc),
932 New_Occurrence_Of (Standard_False, Loc));
934 Push_Scope (Standard_Standard);
935 Add_Global_Declaration (Decl);
938 -- Reset True_Constant indication, since we will indeed assign a value
939 -- to the variable in the binder main. We also kill the Current_Value
940 -- and Last_Assignment fields for the same reason.
942 Set_Is_True_Constant (Elab_Ent, False);
943 Set_Current_Value (Elab_Ent, Empty);
944 Set_Last_Assignment (Elab_Ent, Empty);
946 -- We do not want any further qualification of the name (if we did
947 -- not do this, we would pick up the name of the generic package
948 -- in the case of a library level generic instantiation).
950 Set_Has_Qualified_Name (Elab_Ent);
951 Set_Has_Fully_Qualified_Name (Elab_Ent);
952 end Build_Elaboration_Entity;
954 -----------------------------------
955 -- Cannot_Raise_Constraint_Error --
956 -----------------------------------
958 function Cannot_Raise_Constraint_Error (Expr : Node_Id) return Boolean is
960 if Compile_Time_Known_Value (Expr) then
963 elsif Do_Range_Check (Expr) then
966 elsif Raises_Constraint_Error (Expr) then
974 when N_Expanded_Name =>
977 when N_Selected_Component =>
978 return not Do_Discriminant_Check (Expr);
980 when N_Attribute_Reference =>
981 if Do_Overflow_Check (Expr) then
984 elsif No (Expressions (Expr)) then
992 N := First (Expressions (Expr));
993 while Present (N) loop
994 if Cannot_Raise_Constraint_Error (N) then
1005 when N_Type_Conversion =>
1006 if Do_Overflow_Check (Expr)
1007 or else Do_Length_Check (Expr)
1008 or else Do_Tag_Check (Expr)
1013 Cannot_Raise_Constraint_Error (Expression (Expr));
1016 when N_Unchecked_Type_Conversion =>
1017 return Cannot_Raise_Constraint_Error (Expression (Expr));
1020 if Do_Overflow_Check (Expr) then
1024 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1031 if Do_Division_Check (Expr)
1032 or else Do_Overflow_Check (Expr)
1037 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
1039 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1058 N_Op_Shift_Right_Arithmetic |
1062 if Do_Overflow_Check (Expr) then
1066 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
1068 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1075 end Cannot_Raise_Constraint_Error;
1077 -----------------------------------------
1078 -- Check_Dynamically_Tagged_Expression --
1079 -----------------------------------------
1081 procedure Check_Dynamically_Tagged_Expression
1084 Related_Nod : Node_Id)
1087 pragma Assert (Is_Tagged_Type (Typ));
1089 -- In order to avoid spurious errors when analyzing the expanded code,
1090 -- this check is done only for nodes that come from source and for
1091 -- actuals of generic instantiations.
1093 if (Comes_From_Source (Related_Nod)
1094 or else In_Generic_Actual (Expr))
1095 and then (Is_Class_Wide_Type (Etype (Expr))
1096 or else Is_Dynamically_Tagged (Expr))
1097 and then Is_Tagged_Type (Typ)
1098 and then not Is_Class_Wide_Type (Typ)
1100 Error_Msg_N ("dynamically tagged expression not allowed!", Expr);
1102 end Check_Dynamically_Tagged_Expression;
1104 --------------------------
1105 -- Check_Fully_Declared --
1106 --------------------------
1108 procedure Check_Fully_Declared (T : Entity_Id; N : Node_Id) is
1110 if Ekind (T) = E_Incomplete_Type then
1112 -- Ada 2005 (AI-50217): If the type is available through a limited
1113 -- with_clause, verify that its full view has been analyzed.
1115 if From_With_Type (T)
1116 and then Present (Non_Limited_View (T))
1117 and then Ekind (Non_Limited_View (T)) /= E_Incomplete_Type
1119 -- The non-limited view is fully declared
1124 ("premature usage of incomplete}", N, First_Subtype (T));
1127 -- Need comments for these tests ???
1129 elsif Has_Private_Component (T)
1130 and then not Is_Generic_Type (Root_Type (T))
1131 and then not In_Spec_Expression
1133 -- Special case: if T is the anonymous type created for a single
1134 -- task or protected object, use the name of the source object.
1136 if Is_Concurrent_Type (T)
1137 and then not Comes_From_Source (T)
1138 and then Nkind (N) = N_Object_Declaration
1140 Error_Msg_NE ("type of& has incomplete component", N,
1141 Defining_Identifier (N));
1145 ("premature usage of incomplete}", N, First_Subtype (T));
1148 end Check_Fully_Declared;
1150 -------------------------
1151 -- Check_Nested_Access --
1152 -------------------------
1154 procedure Check_Nested_Access (Ent : Entity_Id) is
1155 Scop : constant Entity_Id := Current_Scope;
1156 Current_Subp : Entity_Id;
1157 Enclosing : Entity_Id;
1160 -- Currently only enabled for VM back-ends for efficiency, should we
1161 -- enable it more systematically ???
1163 -- Check for Is_Imported needs commenting below ???
1165 if VM_Target /= No_VM
1166 and then (Ekind (Ent) = E_Variable
1168 Ekind (Ent) = E_Constant
1170 Ekind (Ent) = E_Loop_Parameter)
1171 and then Scope (Ent) /= Empty
1172 and then not Is_Library_Level_Entity (Ent)
1173 and then not Is_Imported (Ent)
1175 if Is_Subprogram (Scop)
1176 or else Is_Generic_Subprogram (Scop)
1177 or else Is_Entry (Scop)
1179 Current_Subp := Scop;
1181 Current_Subp := Current_Subprogram;
1184 Enclosing := Enclosing_Subprogram (Ent);
1186 if Enclosing /= Empty
1187 and then Enclosing /= Current_Subp
1189 Set_Has_Up_Level_Access (Ent, True);
1192 end Check_Nested_Access;
1194 ----------------------------
1195 -- Check_Order_Dependence --
1196 ----------------------------
1198 procedure Check_Order_Dependence is
1203 -- This could use comments ???
1205 for J in 0 .. Actuals_In_Call.Last loop
1206 if Actuals_In_Call.Table (J).Is_Writable then
1207 Act1 := Actuals_In_Call.Table (J).Act;
1209 if Nkind (Act1) = N_Attribute_Reference then
1210 Act1 := Prefix (Act1);
1213 for K in 0 .. Actuals_In_Call.Last loop
1215 Act2 := Actuals_In_Call.Table (K).Act;
1217 if Nkind (Act2) = N_Attribute_Reference then
1218 Act2 := Prefix (Act2);
1221 if Actuals_In_Call.Table (K).Is_Writable
1228 elsif Denotes_Same_Object (Act1, Act2)
1231 Error_Msg_N ("?,mighty suspicious!!!", Act1);
1238 Actuals_In_Call.Set_Last (0);
1239 end Check_Order_Dependence;
1241 ------------------------------------------
1242 -- Check_Potentially_Blocking_Operation --
1243 ------------------------------------------
1245 procedure Check_Potentially_Blocking_Operation (N : Node_Id) is
1248 -- N is one of the potentially blocking operations listed in 9.5.1(8).
1249 -- When pragma Detect_Blocking is active, the run time will raise
1250 -- Program_Error. Here we only issue a warning, since we generally
1251 -- support the use of potentially blocking operations in the absence
1254 -- Indirect blocking through a subprogram call cannot be diagnosed
1255 -- statically without interprocedural analysis, so we do not attempt
1258 S := Scope (Current_Scope);
1259 while Present (S) and then S /= Standard_Standard loop
1260 if Is_Protected_Type (S) then
1262 ("potentially blocking operation in protected operation?", N);
1269 end Check_Potentially_Blocking_Operation;
1271 ------------------------------
1272 -- Check_Unprotected_Access --
1273 ------------------------------
1275 procedure Check_Unprotected_Access
1279 Cont_Encl_Typ : Entity_Id;
1280 Pref_Encl_Typ : Entity_Id;
1282 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id;
1283 -- Check whether Obj is a private component of a protected object.
1284 -- Return the protected type where the component resides, Empty
1287 function Is_Public_Operation return Boolean;
1288 -- Verify that the enclosing operation is callable from outside the
1289 -- protected object, to minimize false positives.
1291 ------------------------------
1292 -- Enclosing_Protected_Type --
1293 ------------------------------
1295 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id is
1297 if Is_Entity_Name (Obj) then
1299 Ent : Entity_Id := Entity (Obj);
1302 -- The object can be a renaming of a private component, use
1303 -- the original record component.
1305 if Is_Prival (Ent) then
1306 Ent := Prival_Link (Ent);
1309 if Is_Protected_Type (Scope (Ent)) then
1315 -- For indexed and selected components, recursively check the prefix
1317 if Nkind_In (Obj, N_Indexed_Component, N_Selected_Component) then
1318 return Enclosing_Protected_Type (Prefix (Obj));
1320 -- The object does not denote a protected component
1325 end Enclosing_Protected_Type;
1327 -------------------------
1328 -- Is_Public_Operation --
1329 -------------------------
1331 function Is_Public_Operation return Boolean is
1338 and then S /= Pref_Encl_Typ
1340 if Scope (S) = Pref_Encl_Typ then
1341 E := First_Entity (Pref_Encl_Typ);
1343 and then E /= First_Private_Entity (Pref_Encl_Typ)
1356 end Is_Public_Operation;
1358 -- Start of processing for Check_Unprotected_Access
1361 if Nkind (Expr) = N_Attribute_Reference
1362 and then Attribute_Name (Expr) = Name_Unchecked_Access
1364 Cont_Encl_Typ := Enclosing_Protected_Type (Context);
1365 Pref_Encl_Typ := Enclosing_Protected_Type (Prefix (Expr));
1367 -- Check whether we are trying to export a protected component to a
1368 -- context with an equal or lower access level.
1370 if Present (Pref_Encl_Typ)
1371 and then No (Cont_Encl_Typ)
1372 and then Is_Public_Operation
1373 and then Scope_Depth (Pref_Encl_Typ) >=
1374 Object_Access_Level (Context)
1377 ("?possible unprotected access to protected data", Expr);
1380 end Check_Unprotected_Access;
1386 procedure Check_VMS (Construct : Node_Id) is
1388 if not OpenVMS_On_Target then
1390 ("this construct is allowed only in Open'V'M'S", Construct);
1394 ------------------------
1395 -- Collect_Interfaces --
1396 ------------------------
1398 procedure Collect_Interfaces
1400 Ifaces_List : out Elist_Id;
1401 Exclude_Parents : Boolean := False;
1402 Use_Full_View : Boolean := True)
1404 procedure Collect (Typ : Entity_Id);
1405 -- Subsidiary subprogram used to traverse the whole list
1406 -- of directly and indirectly implemented interfaces
1412 procedure Collect (Typ : Entity_Id) is
1413 Ancestor : Entity_Id;
1421 -- Handle private types
1424 and then Is_Private_Type (Typ)
1425 and then Present (Full_View (Typ))
1427 Full_T := Full_View (Typ);
1430 -- Include the ancestor if we are generating the whole list of
1431 -- abstract interfaces.
1433 if Etype (Full_T) /= Typ
1435 -- Protect the frontend against wrong sources. For example:
1438 -- type A is tagged null record;
1439 -- type B is new A with private;
1440 -- type C is new A with private;
1442 -- type B is new C with null record;
1443 -- type C is new B with null record;
1446 and then Etype (Full_T) /= T
1448 Ancestor := Etype (Full_T);
1451 if Is_Interface (Ancestor)
1452 and then not Exclude_Parents
1454 Append_Unique_Elmt (Ancestor, Ifaces_List);
1458 -- Traverse the graph of ancestor interfaces
1460 if Is_Non_Empty_List (Abstract_Interface_List (Full_T)) then
1461 Id := First (Abstract_Interface_List (Full_T));
1462 while Present (Id) loop
1463 Iface := Etype (Id);
1465 -- Protect against wrong uses. For example:
1466 -- type I is interface;
1467 -- type O is tagged null record;
1468 -- type Wrong is new I and O with null record; -- ERROR
1470 if Is_Interface (Iface) then
1472 and then Etype (T) /= T
1473 and then Interface_Present_In_Ancestor (Etype (T), Iface)
1478 Append_Unique_Elmt (Iface, Ifaces_List);
1487 -- Start of processing for Collect_Interfaces
1490 pragma Assert (Is_Tagged_Type (T) or else Is_Concurrent_Type (T));
1491 Ifaces_List := New_Elmt_List;
1493 end Collect_Interfaces;
1495 ----------------------------------
1496 -- Collect_Interface_Components --
1497 ----------------------------------
1499 procedure Collect_Interface_Components
1500 (Tagged_Type : Entity_Id;
1501 Components_List : out Elist_Id)
1503 procedure Collect (Typ : Entity_Id);
1504 -- Subsidiary subprogram used to climb to the parents
1510 procedure Collect (Typ : Entity_Id) is
1511 Tag_Comp : Entity_Id;
1512 Parent_Typ : Entity_Id;
1515 -- Handle private types
1517 if Present (Full_View (Etype (Typ))) then
1518 Parent_Typ := Full_View (Etype (Typ));
1520 Parent_Typ := Etype (Typ);
1523 if Parent_Typ /= Typ
1525 -- Protect the frontend against wrong sources. For example:
1528 -- type A is tagged null record;
1529 -- type B is new A with private;
1530 -- type C is new A with private;
1532 -- type B is new C with null record;
1533 -- type C is new B with null record;
1536 and then Parent_Typ /= Tagged_Type
1538 Collect (Parent_Typ);
1541 -- Collect the components containing tags of secondary dispatch
1544 Tag_Comp := Next_Tag_Component (First_Tag_Component (Typ));
1545 while Present (Tag_Comp) loop
1546 pragma Assert (Present (Related_Type (Tag_Comp)));
1547 Append_Elmt (Tag_Comp, Components_List);
1549 Tag_Comp := Next_Tag_Component (Tag_Comp);
1553 -- Start of processing for Collect_Interface_Components
1556 pragma Assert (Ekind (Tagged_Type) = E_Record_Type
1557 and then Is_Tagged_Type (Tagged_Type));
1559 Components_List := New_Elmt_List;
1560 Collect (Tagged_Type);
1561 end Collect_Interface_Components;
1563 -----------------------------
1564 -- Collect_Interfaces_Info --
1565 -----------------------------
1567 procedure Collect_Interfaces_Info
1569 Ifaces_List : out Elist_Id;
1570 Components_List : out Elist_Id;
1571 Tags_List : out Elist_Id)
1573 Comps_List : Elist_Id;
1574 Comp_Elmt : Elmt_Id;
1575 Comp_Iface : Entity_Id;
1576 Iface_Elmt : Elmt_Id;
1579 function Search_Tag (Iface : Entity_Id) return Entity_Id;
1580 -- Search for the secondary tag associated with the interface type
1581 -- Iface that is implemented by T.
1587 function Search_Tag (Iface : Entity_Id) return Entity_Id is
1590 if not Is_CPP_Class (T) then
1591 ADT := Next_Elmt (Next_Elmt (First_Elmt (Access_Disp_Table (T))));
1593 ADT := Next_Elmt (First_Elmt (Access_Disp_Table (T)));
1597 and then Is_Tag (Node (ADT))
1598 and then Related_Type (Node (ADT)) /= Iface
1600 -- Skip secondary dispatch table referencing thunks to user
1601 -- defined primitives covered by this interface.
1603 pragma Assert (Has_Suffix (Node (ADT), 'P'));
1606 -- Skip secondary dispatch tables of Ada types
1608 if not Is_CPP_Class (T) then
1610 -- Skip secondary dispatch table referencing thunks to
1611 -- predefined primitives.
1613 pragma Assert (Has_Suffix (Node (ADT), 'Y'));
1616 -- Skip secondary dispatch table referencing user-defined
1617 -- primitives covered by this interface.
1619 pragma Assert (Has_Suffix (Node (ADT), 'D'));
1622 -- Skip secondary dispatch table referencing predefined
1625 pragma Assert (Has_Suffix (Node (ADT), 'Z'));
1630 pragma Assert (Is_Tag (Node (ADT)));
1634 -- Start of processing for Collect_Interfaces_Info
1637 Collect_Interfaces (T, Ifaces_List);
1638 Collect_Interface_Components (T, Comps_List);
1640 -- Search for the record component and tag associated with each
1641 -- interface type of T.
1643 Components_List := New_Elmt_List;
1644 Tags_List := New_Elmt_List;
1646 Iface_Elmt := First_Elmt (Ifaces_List);
1647 while Present (Iface_Elmt) loop
1648 Iface := Node (Iface_Elmt);
1650 -- Associate the primary tag component and the primary dispatch table
1651 -- with all the interfaces that are parents of T
1653 if Is_Ancestor (Iface, T) then
1654 Append_Elmt (First_Tag_Component (T), Components_List);
1655 Append_Elmt (Node (First_Elmt (Access_Disp_Table (T))), Tags_List);
1657 -- Otherwise search for the tag component and secondary dispatch
1661 Comp_Elmt := First_Elmt (Comps_List);
1662 while Present (Comp_Elmt) loop
1663 Comp_Iface := Related_Type (Node (Comp_Elmt));
1665 if Comp_Iface = Iface
1666 or else Is_Ancestor (Iface, Comp_Iface)
1668 Append_Elmt (Node (Comp_Elmt), Components_List);
1669 Append_Elmt (Search_Tag (Comp_Iface), Tags_List);
1673 Next_Elmt (Comp_Elmt);
1675 pragma Assert (Present (Comp_Elmt));
1678 Next_Elmt (Iface_Elmt);
1680 end Collect_Interfaces_Info;
1682 ----------------------------------
1683 -- Collect_Primitive_Operations --
1684 ----------------------------------
1686 function Collect_Primitive_Operations (T : Entity_Id) return Elist_Id is
1687 B_Type : constant Entity_Id := Base_Type (T);
1688 B_Decl : constant Node_Id := Original_Node (Parent (B_Type));
1689 B_Scope : Entity_Id := Scope (B_Type);
1693 Formal_Derived : Boolean := False;
1696 function Match (E : Entity_Id) return Boolean;
1697 -- True if E's base type is B_Type, or E is of an anonymous access type
1698 -- and the base type of its designated type is B_Type.
1704 function Match (E : Entity_Id) return Boolean is
1705 Etyp : Entity_Id := Etype (E);
1708 if Ekind (Etyp) = E_Anonymous_Access_Type then
1709 Etyp := Designated_Type (Etyp);
1712 return Base_Type (Etyp) = B_Type;
1715 -- Start of processing for Collect_Primitive_Operations
1718 -- For tagged types, the primitive operations are collected as they
1719 -- are declared, and held in an explicit list which is simply returned.
1721 if Is_Tagged_Type (B_Type) then
1722 return Primitive_Operations (B_Type);
1724 -- An untagged generic type that is a derived type inherits the
1725 -- primitive operations of its parent type. Other formal types only
1726 -- have predefined operators, which are not explicitly represented.
1728 elsif Is_Generic_Type (B_Type) then
1729 if Nkind (B_Decl) = N_Formal_Type_Declaration
1730 and then Nkind (Formal_Type_Definition (B_Decl))
1731 = N_Formal_Derived_Type_Definition
1733 Formal_Derived := True;
1735 return New_Elmt_List;
1739 Op_List := New_Elmt_List;
1741 if B_Scope = Standard_Standard then
1742 if B_Type = Standard_String then
1743 Append_Elmt (Standard_Op_Concat, Op_List);
1745 elsif B_Type = Standard_Wide_String then
1746 Append_Elmt (Standard_Op_Concatw, Op_List);
1752 elsif (Is_Package_Or_Generic_Package (B_Scope)
1754 Nkind (Parent (Declaration_Node (First_Subtype (T)))) /=
1756 or else Is_Derived_Type (B_Type)
1758 -- The primitive operations appear after the base type, except
1759 -- if the derivation happens within the private part of B_Scope
1760 -- and the type is a private type, in which case both the type
1761 -- and some primitive operations may appear before the base
1762 -- type, and the list of candidates starts after the type.
1764 if In_Open_Scopes (B_Scope)
1765 and then Scope (T) = B_Scope
1766 and then In_Private_Part (B_Scope)
1768 Id := Next_Entity (T);
1770 Id := Next_Entity (B_Type);
1773 while Present (Id) loop
1775 -- Note that generic formal subprograms are not
1776 -- considered to be primitive operations and thus
1777 -- are never inherited.
1779 if Is_Overloadable (Id)
1780 and then Nkind (Parent (Parent (Id)))
1781 not in N_Formal_Subprogram_Declaration
1789 Formal := First_Formal (Id);
1790 while Present (Formal) loop
1791 if Match (Formal) then
1796 Next_Formal (Formal);
1800 -- For a formal derived type, the only primitives are the
1801 -- ones inherited from the parent type. Operations appearing
1802 -- in the package declaration are not primitive for it.
1805 and then (not Formal_Derived
1806 or else Present (Alias (Id)))
1808 -- In the special case of an equality operator aliased to
1809 -- an overriding dispatching equality belonging to the same
1810 -- type, we don't include it in the list of primitives.
1811 -- This avoids inheriting multiple equality operators when
1812 -- deriving from untagged private types whose full type is
1813 -- tagged, which can otherwise cause ambiguities. Note that
1814 -- this should only happen for this kind of untagged parent
1815 -- type, since normally dispatching operations are inherited
1816 -- using the type's Primitive_Operations list.
1818 if Chars (Id) = Name_Op_Eq
1819 and then Is_Dispatching_Operation (Id)
1820 and then Present (Alias (Id))
1821 and then Is_Overriding_Operation (Alias (Id))
1822 and then Base_Type (Etype (First_Entity (Id))) =
1823 Base_Type (Etype (First_Entity (Alias (Id))))
1827 -- Include the subprogram in the list of primitives
1830 Append_Elmt (Id, Op_List);
1837 -- For a type declared in System, some of its operations may
1838 -- appear in the target-specific extension to System.
1841 and then B_Scope = RTU_Entity (System)
1842 and then Present_System_Aux
1844 B_Scope := System_Aux_Id;
1845 Id := First_Entity (System_Aux_Id);
1851 end Collect_Primitive_Operations;
1853 -----------------------------------
1854 -- Compile_Time_Constraint_Error --
1855 -----------------------------------
1857 function Compile_Time_Constraint_Error
1860 Ent : Entity_Id := Empty;
1861 Loc : Source_Ptr := No_Location;
1862 Warn : Boolean := False) return Node_Id
1864 Msgc : String (1 .. Msg'Length + 2);
1865 -- Copy of message, with room for possible ? and ! at end
1875 -- A static constraint error in an instance body is not a fatal error.
1876 -- we choose to inhibit the message altogether, because there is no
1877 -- obvious node (for now) on which to post it. On the other hand the
1878 -- offending node must be replaced with a constraint_error in any case.
1880 -- No messages are generated if we already posted an error on this node
1882 if not Error_Posted (N) then
1883 if Loc /= No_Location then
1889 Msgc (1 .. Msg'Length) := Msg;
1892 -- Message is a warning, even in Ada 95 case
1894 if Msg (Msg'Last) = '?' then
1897 -- In Ada 83, all messages are warnings. In the private part and
1898 -- the body of an instance, constraint_checks are only warnings.
1899 -- We also make this a warning if the Warn parameter is set.
1902 or else (Ada_Version = Ada_83 and then Comes_From_Source (N))
1908 elsif In_Instance_Not_Visible then
1913 -- Otherwise we have a real error message (Ada 95 static case)
1914 -- and we make this an unconditional message. Note that in the
1915 -- warning case we do not make the message unconditional, it seems
1916 -- quite reasonable to delete messages like this (about exceptions
1917 -- that will be raised) in dead code.
1925 -- Should we generate a warning? The answer is not quite yes. The
1926 -- very annoying exception occurs in the case of a short circuit
1927 -- operator where the left operand is static and decisive. Climb
1928 -- parents to see if that is the case we have here. Conditional
1929 -- expressions with decisive conditions are a similar situation.
1937 -- And then with False as left operand
1939 if Nkind (P) = N_And_Then
1940 and then Compile_Time_Known_Value (Left_Opnd (P))
1941 and then Is_False (Expr_Value (Left_Opnd (P)))
1946 -- OR ELSE with True as left operand
1948 elsif Nkind (P) = N_Or_Else
1949 and then Compile_Time_Known_Value (Left_Opnd (P))
1950 and then Is_True (Expr_Value (Left_Opnd (P)))
1955 -- Conditional expression
1957 elsif Nkind (P) = N_Conditional_Expression then
1959 Cond : constant Node_Id := First (Expressions (P));
1960 Texp : constant Node_Id := Next (Cond);
1961 Fexp : constant Node_Id := Next (Texp);
1964 if Compile_Time_Known_Value (Cond) then
1966 -- Condition is True and we are in the right operand
1968 if Is_True (Expr_Value (Cond))
1969 and then OldP = Fexp
1974 -- Condition is False and we are in the left operand
1976 elsif Is_False (Expr_Value (Cond))
1977 and then OldP = Texp
1985 -- Special case for component association in aggregates, where
1986 -- we want to keep climbing up to the parent aggregate.
1988 elsif Nkind (P) = N_Component_Association
1989 and then Nkind (Parent (P)) = N_Aggregate
1993 -- Keep going if within subexpression
1996 exit when Nkind (P) not in N_Subexpr;
2001 if Present (Ent) then
2002 Error_Msg_NEL (Msgc (1 .. Msgl), N, Ent, Eloc);
2004 Error_Msg_NEL (Msgc (1 .. Msgl), N, Etype (N), Eloc);
2008 if Inside_Init_Proc then
2010 ("\?& will be raised for objects of this type",
2011 N, Standard_Constraint_Error, Eloc);
2014 ("\?& will be raised at run time",
2015 N, Standard_Constraint_Error, Eloc);
2020 ("\static expression fails Constraint_Check", Eloc);
2021 Set_Error_Posted (N);
2027 end Compile_Time_Constraint_Error;
2029 -----------------------
2030 -- Conditional_Delay --
2031 -----------------------
2033 procedure Conditional_Delay (New_Ent, Old_Ent : Entity_Id) is
2035 if Has_Delayed_Freeze (Old_Ent) and then not Is_Frozen (Old_Ent) then
2036 Set_Has_Delayed_Freeze (New_Ent);
2038 end Conditional_Delay;
2040 -------------------------
2041 -- Copy_Parameter_List --
2042 -------------------------
2044 function Copy_Parameter_List (Subp_Id : Entity_Id) return List_Id is
2045 Loc : constant Source_Ptr := Sloc (Subp_Id);
2050 if No (First_Formal (Subp_Id)) then
2054 Formal := First_Formal (Subp_Id);
2055 while Present (Formal) loop
2057 (Make_Parameter_Specification (Loc,
2058 Defining_Identifier =>
2059 Make_Defining_Identifier (Sloc (Formal),
2060 Chars => Chars (Formal)),
2061 In_Present => In_Present (Parent (Formal)),
2062 Out_Present => Out_Present (Parent (Formal)),
2064 New_Reference_To (Etype (Formal), Loc),
2066 New_Copy_Tree (Expression (Parent (Formal)))),
2069 Next_Formal (Formal);
2074 end Copy_Parameter_List;
2076 --------------------
2077 -- Current_Entity --
2078 --------------------
2080 -- The currently visible definition for a given identifier is the
2081 -- one most chained at the start of the visibility chain, i.e. the
2082 -- one that is referenced by the Node_Id value of the name of the
2083 -- given identifier.
2085 function Current_Entity (N : Node_Id) return Entity_Id is
2087 return Get_Name_Entity_Id (Chars (N));
2090 -----------------------------
2091 -- Current_Entity_In_Scope --
2092 -----------------------------
2094 function Current_Entity_In_Scope (N : Node_Id) return Entity_Id is
2096 CS : constant Entity_Id := Current_Scope;
2098 Transient_Case : constant Boolean := Scope_Is_Transient;
2101 E := Get_Name_Entity_Id (Chars (N));
2103 and then Scope (E) /= CS
2104 and then (not Transient_Case or else Scope (E) /= Scope (CS))
2110 end Current_Entity_In_Scope;
2116 function Current_Scope return Entity_Id is
2118 if Scope_Stack.Last = -1 then
2119 return Standard_Standard;
2122 C : constant Entity_Id :=
2123 Scope_Stack.Table (Scope_Stack.Last).Entity;
2128 return Standard_Standard;
2134 ------------------------
2135 -- Current_Subprogram --
2136 ------------------------
2138 function Current_Subprogram return Entity_Id is
2139 Scop : constant Entity_Id := Current_Scope;
2141 if Is_Subprogram (Scop) or else Is_Generic_Subprogram (Scop) then
2144 return Enclosing_Subprogram (Scop);
2146 end Current_Subprogram;
2148 ---------------------
2149 -- Defining_Entity --
2150 ---------------------
2152 function Defining_Entity (N : Node_Id) return Entity_Id is
2153 K : constant Node_Kind := Nkind (N);
2154 Err : Entity_Id := Empty;
2159 N_Subprogram_Declaration |
2160 N_Abstract_Subprogram_Declaration |
2162 N_Package_Declaration |
2163 N_Subprogram_Renaming_Declaration |
2164 N_Subprogram_Body_Stub |
2165 N_Generic_Subprogram_Declaration |
2166 N_Generic_Package_Declaration |
2167 N_Formal_Subprogram_Declaration
2169 return Defining_Entity (Specification (N));
2172 N_Component_Declaration |
2173 N_Defining_Program_Unit_Name |
2174 N_Discriminant_Specification |
2176 N_Entry_Declaration |
2177 N_Entry_Index_Specification |
2178 N_Exception_Declaration |
2179 N_Exception_Renaming_Declaration |
2180 N_Formal_Object_Declaration |
2181 N_Formal_Package_Declaration |
2182 N_Formal_Type_Declaration |
2183 N_Full_Type_Declaration |
2184 N_Implicit_Label_Declaration |
2185 N_Incomplete_Type_Declaration |
2186 N_Loop_Parameter_Specification |
2187 N_Number_Declaration |
2188 N_Object_Declaration |
2189 N_Object_Renaming_Declaration |
2190 N_Package_Body_Stub |
2191 N_Parameter_Specification |
2192 N_Private_Extension_Declaration |
2193 N_Private_Type_Declaration |
2195 N_Protected_Body_Stub |
2196 N_Protected_Type_Declaration |
2197 N_Single_Protected_Declaration |
2198 N_Single_Task_Declaration |
2199 N_Subtype_Declaration |
2202 N_Task_Type_Declaration
2204 return Defining_Identifier (N);
2207 return Defining_Entity (Proper_Body (N));
2210 N_Function_Instantiation |
2211 N_Function_Specification |
2212 N_Generic_Function_Renaming_Declaration |
2213 N_Generic_Package_Renaming_Declaration |
2214 N_Generic_Procedure_Renaming_Declaration |
2216 N_Package_Instantiation |
2217 N_Package_Renaming_Declaration |
2218 N_Package_Specification |
2219 N_Procedure_Instantiation |
2220 N_Procedure_Specification
2223 Nam : constant Node_Id := Defining_Unit_Name (N);
2226 if Nkind (Nam) in N_Entity then
2229 -- For Error, make up a name and attach to declaration
2230 -- so we can continue semantic analysis
2232 elsif Nam = Error then
2233 Err := Make_Temporary (Sloc (N), 'T');
2234 Set_Defining_Unit_Name (N, Err);
2237 -- If not an entity, get defining identifier
2240 return Defining_Identifier (Nam);
2244 when N_Block_Statement =>
2245 return Entity (Identifier (N));
2248 raise Program_Error;
2251 end Defining_Entity;
2253 --------------------------
2254 -- Denotes_Discriminant --
2255 --------------------------
2257 function Denotes_Discriminant
2259 Check_Concurrent : Boolean := False) return Boolean
2263 if not Is_Entity_Name (N)
2264 or else No (Entity (N))
2271 -- If we are checking for a protected type, the discriminant may have
2272 -- been rewritten as the corresponding discriminal of the original type
2273 -- or of the corresponding concurrent record, depending on whether we
2274 -- are in the spec or body of the protected type.
2276 return Ekind (E) = E_Discriminant
2279 and then Ekind (E) = E_In_Parameter
2280 and then Present (Discriminal_Link (E))
2282 (Is_Concurrent_Type (Scope (Discriminal_Link (E)))
2284 Is_Concurrent_Record_Type (Scope (Discriminal_Link (E)))));
2286 end Denotes_Discriminant;
2288 -------------------------
2289 -- Denotes_Same_Object --
2290 -------------------------
2292 function Denotes_Same_Object (A1, A2 : Node_Id) return Boolean is
2294 -- If we have entity names, then must be same entity
2296 if Is_Entity_Name (A1) then
2297 if Is_Entity_Name (A2) then
2298 return Entity (A1) = Entity (A2);
2303 -- No match if not same node kind
2305 elsif Nkind (A1) /= Nkind (A2) then
2308 -- For selected components, must have same prefix and selector
2310 elsif Nkind (A1) = N_Selected_Component then
2311 return Denotes_Same_Object (Prefix (A1), Prefix (A2))
2313 Entity (Selector_Name (A1)) = Entity (Selector_Name (A2));
2315 -- For explicit dereferences, prefixes must be same
2317 elsif Nkind (A1) = N_Explicit_Dereference then
2318 return Denotes_Same_Object (Prefix (A1), Prefix (A2));
2320 -- For indexed components, prefixes and all subscripts must be the same
2322 elsif Nkind (A1) = N_Indexed_Component then
2323 if Denotes_Same_Object (Prefix (A1), Prefix (A2)) then
2329 Indx1 := First (Expressions (A1));
2330 Indx2 := First (Expressions (A2));
2331 while Present (Indx1) loop
2333 -- Shouldn't we be checking that values are the same???
2335 if not Denotes_Same_Object (Indx1, Indx2) then
2349 -- For slices, prefixes must match and bounds must match
2351 elsif Nkind (A1) = N_Slice
2352 and then Denotes_Same_Object (Prefix (A1), Prefix (A2))
2355 Lo1, Lo2, Hi1, Hi2 : Node_Id;
2358 Get_Index_Bounds (Etype (A1), Lo1, Hi1);
2359 Get_Index_Bounds (Etype (A2), Lo2, Hi2);
2361 -- Check whether bounds are statically identical. There is no
2362 -- attempt to detect partial overlap of slices.
2364 -- What about an array and a slice of an array???
2366 return Denotes_Same_Object (Lo1, Lo2)
2367 and then Denotes_Same_Object (Hi1, Hi2);
2370 -- Literals will appear as indexes. Isn't this where we should check
2371 -- Known_At_Compile_Time at least if we are generating warnings ???
2373 elsif Nkind (A1) = N_Integer_Literal then
2374 return Intval (A1) = Intval (A2);
2379 end Denotes_Same_Object;
2381 -------------------------
2382 -- Denotes_Same_Prefix --
2383 -------------------------
2385 function Denotes_Same_Prefix (A1, A2 : Node_Id) return Boolean is
2388 if Is_Entity_Name (A1) then
2389 if Nkind_In (A2, N_Selected_Component, N_Indexed_Component)
2390 and then not Is_Access_Type (Etype (A1))
2392 return Denotes_Same_Object (A1, Prefix (A2))
2393 or else Denotes_Same_Prefix (A1, Prefix (A2));
2398 elsif Is_Entity_Name (A2) then
2399 return Denotes_Same_Prefix (A2, A1);
2401 elsif Nkind_In (A1, N_Selected_Component, N_Indexed_Component, N_Slice)
2403 Nkind_In (A2, N_Selected_Component, N_Indexed_Component, N_Slice)
2406 Root1, Root2 : Node_Id;
2407 Depth1, Depth2 : Int := 0;
2410 Root1 := Prefix (A1);
2411 while not Is_Entity_Name (Root1) loop
2413 (Root1, N_Selected_Component, N_Indexed_Component)
2417 Root1 := Prefix (Root1);
2420 Depth1 := Depth1 + 1;
2423 Root2 := Prefix (A2);
2424 while not Is_Entity_Name (Root2) loop
2426 (Root2, N_Selected_Component, N_Indexed_Component)
2430 Root2 := Prefix (Root2);
2433 Depth2 := Depth2 + 1;
2436 -- If both have the same depth and they do not denote the same
2437 -- object, they are disjoint and not warning is needed.
2439 if Depth1 = Depth2 then
2442 elsif Depth1 > Depth2 then
2443 Root1 := Prefix (A1);
2444 for I in 1 .. Depth1 - Depth2 - 1 loop
2445 Root1 := Prefix (Root1);
2448 return Denotes_Same_Object (Root1, A2);
2451 Root2 := Prefix (A2);
2452 for I in 1 .. Depth2 - Depth1 - 1 loop
2453 Root2 := Prefix (Root2);
2456 return Denotes_Same_Object (A1, Root2);
2463 end Denotes_Same_Prefix;
2465 ----------------------
2466 -- Denotes_Variable --
2467 ----------------------
2469 function Denotes_Variable (N : Node_Id) return Boolean is
2471 return Is_Variable (N) and then Paren_Count (N) = 0;
2472 end Denotes_Variable;
2474 -----------------------------
2475 -- Depends_On_Discriminant --
2476 -----------------------------
2478 function Depends_On_Discriminant (N : Node_Id) return Boolean is
2483 Get_Index_Bounds (N, L, H);
2484 return Denotes_Discriminant (L) or else Denotes_Discriminant (H);
2485 end Depends_On_Discriminant;
2487 -------------------------
2488 -- Designate_Same_Unit --
2489 -------------------------
2491 function Designate_Same_Unit
2493 Name2 : Node_Id) return Boolean
2495 K1 : constant Node_Kind := Nkind (Name1);
2496 K2 : constant Node_Kind := Nkind (Name2);
2498 function Prefix_Node (N : Node_Id) return Node_Id;
2499 -- Returns the parent unit name node of a defining program unit name
2500 -- or the prefix if N is a selected component or an expanded name.
2502 function Select_Node (N : Node_Id) return Node_Id;
2503 -- Returns the defining identifier node of a defining program unit
2504 -- name or the selector node if N is a selected component or an
2511 function Prefix_Node (N : Node_Id) return Node_Id is
2513 if Nkind (N) = N_Defining_Program_Unit_Name then
2525 function Select_Node (N : Node_Id) return Node_Id is
2527 if Nkind (N) = N_Defining_Program_Unit_Name then
2528 return Defining_Identifier (N);
2531 return Selector_Name (N);
2535 -- Start of processing for Designate_Next_Unit
2538 if (K1 = N_Identifier or else
2539 K1 = N_Defining_Identifier)
2541 (K2 = N_Identifier or else
2542 K2 = N_Defining_Identifier)
2544 return Chars (Name1) = Chars (Name2);
2547 (K1 = N_Expanded_Name or else
2548 K1 = N_Selected_Component or else
2549 K1 = N_Defining_Program_Unit_Name)
2551 (K2 = N_Expanded_Name or else
2552 K2 = N_Selected_Component or else
2553 K2 = N_Defining_Program_Unit_Name)
2556 (Chars (Select_Node (Name1)) = Chars (Select_Node (Name2)))
2558 Designate_Same_Unit (Prefix_Node (Name1), Prefix_Node (Name2));
2563 end Designate_Same_Unit;
2565 --------------------------
2566 -- Enclosing_CPP_Parent --
2567 --------------------------
2569 function Enclosing_CPP_Parent (Typ : Entity_Id) return Entity_Id is
2570 Parent_Typ : Entity_Id := Typ;
2573 while not Is_CPP_Class (Parent_Typ)
2574 and then Etype (Parent_Typ) /= Parent_Typ
2576 Parent_Typ := Etype (Parent_Typ);
2578 if Is_Private_Type (Parent_Typ) then
2579 Parent_Typ := Full_View (Base_Type (Parent_Typ));
2583 pragma Assert (Is_CPP_Class (Parent_Typ));
2585 end Enclosing_CPP_Parent;
2587 ----------------------------
2588 -- Enclosing_Generic_Body --
2589 ----------------------------
2591 function Enclosing_Generic_Body
2592 (N : Node_Id) return Node_Id
2600 while Present (P) loop
2601 if Nkind (P) = N_Package_Body
2602 or else Nkind (P) = N_Subprogram_Body
2604 Spec := Corresponding_Spec (P);
2606 if Present (Spec) then
2607 Decl := Unit_Declaration_Node (Spec);
2609 if Nkind (Decl) = N_Generic_Package_Declaration
2610 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2621 end Enclosing_Generic_Body;
2623 ----------------------------
2624 -- Enclosing_Generic_Unit --
2625 ----------------------------
2627 function Enclosing_Generic_Unit
2628 (N : Node_Id) return Node_Id
2636 while Present (P) loop
2637 if Nkind (P) = N_Generic_Package_Declaration
2638 or else Nkind (P) = N_Generic_Subprogram_Declaration
2642 elsif Nkind (P) = N_Package_Body
2643 or else Nkind (P) = N_Subprogram_Body
2645 Spec := Corresponding_Spec (P);
2647 if Present (Spec) then
2648 Decl := Unit_Declaration_Node (Spec);
2650 if Nkind (Decl) = N_Generic_Package_Declaration
2651 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2662 end Enclosing_Generic_Unit;
2664 -------------------------------
2665 -- Enclosing_Lib_Unit_Entity --
2666 -------------------------------
2668 function Enclosing_Lib_Unit_Entity return Entity_Id is
2669 Unit_Entity : Entity_Id;
2672 -- Look for enclosing library unit entity by following scope links.
2673 -- Equivalent to, but faster than indexing through the scope stack.
2675 Unit_Entity := Current_Scope;
2676 while (Present (Scope (Unit_Entity))
2677 and then Scope (Unit_Entity) /= Standard_Standard)
2678 and not Is_Child_Unit (Unit_Entity)
2680 Unit_Entity := Scope (Unit_Entity);
2684 end Enclosing_Lib_Unit_Entity;
2686 -----------------------------
2687 -- Enclosing_Lib_Unit_Node --
2688 -----------------------------
2690 function Enclosing_Lib_Unit_Node (N : Node_Id) return Node_Id is
2691 Current_Node : Node_Id;
2695 while Present (Current_Node)
2696 and then Nkind (Current_Node) /= N_Compilation_Unit
2698 Current_Node := Parent (Current_Node);
2701 if Nkind (Current_Node) /= N_Compilation_Unit then
2705 return Current_Node;
2706 end Enclosing_Lib_Unit_Node;
2708 --------------------------
2709 -- Enclosing_Subprogram --
2710 --------------------------
2712 function Enclosing_Subprogram (E : Entity_Id) return Entity_Id is
2713 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
2716 if Dynamic_Scope = Standard_Standard then
2719 elsif Dynamic_Scope = Empty then
2722 elsif Ekind (Dynamic_Scope) = E_Subprogram_Body then
2723 return Corresponding_Spec (Parent (Parent (Dynamic_Scope)));
2725 elsif Ekind (Dynamic_Scope) = E_Block
2726 or else Ekind (Dynamic_Scope) = E_Return_Statement
2728 return Enclosing_Subprogram (Dynamic_Scope);
2730 elsif Ekind (Dynamic_Scope) = E_Task_Type then
2731 return Get_Task_Body_Procedure (Dynamic_Scope);
2733 elsif Ekind (Dynamic_Scope) = E_Limited_Private_Type
2734 and then Present (Full_View (Dynamic_Scope))
2735 and then Ekind (Full_View (Dynamic_Scope)) = E_Task_Type
2737 return Get_Task_Body_Procedure (Full_View (Dynamic_Scope));
2739 -- No body is generated if the protected operation is eliminated
2741 elsif Convention (Dynamic_Scope) = Convention_Protected
2742 and then not Is_Eliminated (Dynamic_Scope)
2743 and then Present (Protected_Body_Subprogram (Dynamic_Scope))
2745 return Protected_Body_Subprogram (Dynamic_Scope);
2748 return Dynamic_Scope;
2750 end Enclosing_Subprogram;
2752 ------------------------
2753 -- Ensure_Freeze_Node --
2754 ------------------------
2756 procedure Ensure_Freeze_Node (E : Entity_Id) is
2760 if No (Freeze_Node (E)) then
2761 FN := Make_Freeze_Entity (Sloc (E));
2762 Set_Has_Delayed_Freeze (E);
2763 Set_Freeze_Node (E, FN);
2764 Set_Access_Types_To_Process (FN, No_Elist);
2765 Set_TSS_Elist (FN, No_Elist);
2768 end Ensure_Freeze_Node;
2774 procedure Enter_Name (Def_Id : Entity_Id) is
2775 C : constant Entity_Id := Current_Entity (Def_Id);
2776 E : constant Entity_Id := Current_Entity_In_Scope (Def_Id);
2777 S : constant Entity_Id := Current_Scope;
2780 Generate_Definition (Def_Id);
2782 -- Add new name to current scope declarations. Check for duplicate
2783 -- declaration, which may or may not be a genuine error.
2787 -- Case of previous entity entered because of a missing declaration
2788 -- or else a bad subtype indication. Best is to use the new entity,
2789 -- and make the previous one invisible.
2791 if Etype (E) = Any_Type then
2792 Set_Is_Immediately_Visible (E, False);
2794 -- Case of renaming declaration constructed for package instances.
2795 -- if there is an explicit declaration with the same identifier,
2796 -- the renaming is not immediately visible any longer, but remains
2797 -- visible through selected component notation.
2799 elsif Nkind (Parent (E)) = N_Package_Renaming_Declaration
2800 and then not Comes_From_Source (E)
2802 Set_Is_Immediately_Visible (E, False);
2804 -- The new entity may be the package renaming, which has the same
2805 -- same name as a generic formal which has been seen already.
2807 elsif Nkind (Parent (Def_Id)) = N_Package_Renaming_Declaration
2808 and then not Comes_From_Source (Def_Id)
2810 Set_Is_Immediately_Visible (E, False);
2812 -- For a fat pointer corresponding to a remote access to subprogram,
2813 -- we use the same identifier as the RAS type, so that the proper
2814 -- name appears in the stub. This type is only retrieved through
2815 -- the RAS type and never by visibility, and is not added to the
2816 -- visibility list (see below).
2818 elsif Nkind (Parent (Def_Id)) = N_Full_Type_Declaration
2819 and then Present (Corresponding_Remote_Type (Def_Id))
2823 -- A controller component for a type extension overrides the
2824 -- inherited component.
2826 elsif Chars (E) = Name_uController then
2829 -- Case of an implicit operation or derived literal. The new entity
2830 -- hides the implicit one, which is removed from all visibility,
2831 -- i.e. the entity list of its scope, and homonym chain of its name.
2833 elsif (Is_Overloadable (E) and then Is_Inherited_Operation (E))
2834 or else Is_Internal (E)
2838 Prev_Vis : Entity_Id;
2839 Decl : constant Node_Id := Parent (E);
2842 -- If E is an implicit declaration, it cannot be the first
2843 -- entity in the scope.
2845 Prev := First_Entity (Current_Scope);
2846 while Present (Prev)
2847 and then Next_Entity (Prev) /= E
2854 -- If E is not on the entity chain of the current scope,
2855 -- it is an implicit declaration in the generic formal
2856 -- part of a generic subprogram. When analyzing the body,
2857 -- the generic formals are visible but not on the entity
2858 -- chain of the subprogram. The new entity will become
2859 -- the visible one in the body.
2862 (Nkind (Parent (Decl)) = N_Generic_Subprogram_Declaration);
2866 Set_Next_Entity (Prev, Next_Entity (E));
2868 if No (Next_Entity (Prev)) then
2869 Set_Last_Entity (Current_Scope, Prev);
2872 if E = Current_Entity (E) then
2876 Prev_Vis := Current_Entity (E);
2877 while Homonym (Prev_Vis) /= E loop
2878 Prev_Vis := Homonym (Prev_Vis);
2882 if Present (Prev_Vis) then
2884 -- Skip E in the visibility chain
2886 Set_Homonym (Prev_Vis, Homonym (E));
2889 Set_Name_Entity_Id (Chars (E), Homonym (E));
2894 -- This section of code could use a comment ???
2896 elsif Present (Etype (E))
2897 and then Is_Concurrent_Type (Etype (E))
2902 -- If the homograph is a protected component renaming, it should not
2903 -- be hiding the current entity. Such renamings are treated as weak
2906 elsif Is_Prival (E) then
2907 Set_Is_Immediately_Visible (E, False);
2909 -- In this case the current entity is a protected component renaming.
2910 -- Perform minimal decoration by setting the scope and return since
2911 -- the prival should not be hiding other visible entities.
2913 elsif Is_Prival (Def_Id) then
2914 Set_Scope (Def_Id, Current_Scope);
2917 -- Analogous to privals, the discriminal generated for an entry
2918 -- index parameter acts as a weak declaration. Perform minimal
2919 -- decoration to avoid bogus errors.
2921 elsif Is_Discriminal (Def_Id)
2922 and then Ekind (Discriminal_Link (Def_Id)) = E_Entry_Index_Parameter
2924 Set_Scope (Def_Id, Current_Scope);
2927 -- In the body or private part of an instance, a type extension
2928 -- may introduce a component with the same name as that of an
2929 -- actual. The legality rule is not enforced, but the semantics
2930 -- of the full type with two components of the same name are not
2931 -- clear at this point ???
2933 elsif In_Instance_Not_Visible then
2936 -- When compiling a package body, some child units may have become
2937 -- visible. They cannot conflict with local entities that hide them.
2939 elsif Is_Child_Unit (E)
2940 and then In_Open_Scopes (Scope (E))
2941 and then not Is_Immediately_Visible (E)
2945 -- Conversely, with front-end inlining we may compile the parent
2946 -- body first, and a child unit subsequently. The context is now
2947 -- the parent spec, and body entities are not visible.
2949 elsif Is_Child_Unit (Def_Id)
2950 and then Is_Package_Body_Entity (E)
2951 and then not In_Package_Body (Current_Scope)
2955 -- Case of genuine duplicate declaration
2958 Error_Msg_Sloc := Sloc (E);
2960 -- If the previous declaration is an incomplete type declaration
2961 -- this may be an attempt to complete it with a private type.
2962 -- The following avoids confusing cascaded errors.
2964 if Nkind (Parent (E)) = N_Incomplete_Type_Declaration
2965 and then Nkind (Parent (Def_Id)) = N_Private_Type_Declaration
2968 ("incomplete type cannot be completed with a private " &
2969 "declaration", Parent (Def_Id));
2970 Set_Is_Immediately_Visible (E, False);
2971 Set_Full_View (E, Def_Id);
2973 -- An inherited component of a record conflicts with a new
2974 -- discriminant. The discriminant is inserted first in the scope,
2975 -- but the error should be posted on it, not on the component.
2977 elsif Ekind (E) = E_Discriminant
2978 and then Present (Scope (Def_Id))
2979 and then Scope (Def_Id) /= Current_Scope
2981 Error_Msg_Sloc := Sloc (Def_Id);
2982 Error_Msg_N ("& conflicts with declaration#", E);
2985 -- If the name of the unit appears in its own context clause,
2986 -- a dummy package with the name has already been created, and
2987 -- the error emitted. Try to continue quietly.
2989 elsif Error_Posted (E)
2990 and then Sloc (E) = No_Location
2991 and then Nkind (Parent (E)) = N_Package_Specification
2992 and then Current_Scope = Standard_Standard
2994 Set_Scope (Def_Id, Current_Scope);
2998 Error_Msg_N ("& conflicts with declaration#", Def_Id);
3000 -- Avoid cascaded messages with duplicate components in
3003 if Ekind_In (E, E_Component, E_Discriminant) then
3008 if Nkind (Parent (Parent (Def_Id))) =
3009 N_Generic_Subprogram_Declaration
3011 Defining_Entity (Specification (Parent (Parent (Def_Id))))
3013 Error_Msg_N ("\generic units cannot be overloaded", Def_Id);
3016 -- If entity is in standard, then we are in trouble, because
3017 -- it means that we have a library package with a duplicated
3018 -- name. That's hard to recover from, so abort!
3020 if S = Standard_Standard then
3021 raise Unrecoverable_Error;
3023 -- Otherwise we continue with the declaration. Having two
3024 -- identical declarations should not cause us too much trouble!
3032 -- If we fall through, declaration is OK , or OK enough to continue
3034 -- If Def_Id is a discriminant or a record component we are in the
3035 -- midst of inheriting components in a derived record definition.
3036 -- Preserve their Ekind and Etype.
3038 if Ekind_In (Def_Id, E_Discriminant, E_Component) then
3041 -- If a type is already set, leave it alone (happens whey a type
3042 -- declaration is reanalyzed following a call to the optimizer)
3044 elsif Present (Etype (Def_Id)) then
3047 -- Otherwise, the kind E_Void insures that premature uses of the entity
3048 -- will be detected. Any_Type insures that no cascaded errors will occur
3051 Set_Ekind (Def_Id, E_Void);
3052 Set_Etype (Def_Id, Any_Type);
3055 -- Inherited discriminants and components in derived record types are
3056 -- immediately visible. Itypes are not.
3058 if Ekind_In (Def_Id, E_Discriminant, E_Component)
3059 or else (No (Corresponding_Remote_Type (Def_Id))
3060 and then not Is_Itype (Def_Id))
3062 Set_Is_Immediately_Visible (Def_Id);
3063 Set_Current_Entity (Def_Id);
3066 Set_Homonym (Def_Id, C);
3067 Append_Entity (Def_Id, S);
3068 Set_Public_Status (Def_Id);
3070 -- Warn if new entity hides an old one
3072 if Warn_On_Hiding and then Present (C)
3074 -- Don't warn for record components since they always have a well
3075 -- defined scope which does not confuse other uses. Note that in
3076 -- some cases, Ekind has not been set yet.
3078 and then Ekind (C) /= E_Component
3079 and then Ekind (C) /= E_Discriminant
3080 and then Nkind (Parent (C)) /= N_Component_Declaration
3081 and then Ekind (Def_Id) /= E_Component
3082 and then Ekind (Def_Id) /= E_Discriminant
3083 and then Nkind (Parent (Def_Id)) /= N_Component_Declaration
3085 -- Don't warn for one character variables. It is too common to use
3086 -- such variables as locals and will just cause too many false hits.
3088 and then Length_Of_Name (Chars (C)) /= 1
3090 -- Don't warn for non-source entities
3092 and then Comes_From_Source (C)
3093 and then Comes_From_Source (Def_Id)
3095 -- Don't warn unless entity in question is in extended main source
3097 and then In_Extended_Main_Source_Unit (Def_Id)
3099 -- Finally, the hidden entity must be either immediately visible
3100 -- or use visible (from a used package)
3103 (Is_Immediately_Visible (C)
3105 Is_Potentially_Use_Visible (C))
3107 Error_Msg_Sloc := Sloc (C);
3108 Error_Msg_N ("declaration hides &#?", Def_Id);
3112 --------------------------
3113 -- Explain_Limited_Type --
3114 --------------------------
3116 procedure Explain_Limited_Type (T : Entity_Id; N : Node_Id) is
3120 -- For array, component type must be limited
3122 if Is_Array_Type (T) then
3123 Error_Msg_Node_2 := T;
3125 ("\component type& of type& is limited", N, Component_Type (T));
3126 Explain_Limited_Type (Component_Type (T), N);
3128 elsif Is_Record_Type (T) then
3130 -- No need for extra messages if explicit limited record
3132 if Is_Limited_Record (Base_Type (T)) then
3136 -- Otherwise find a limited component. Check only components that
3137 -- come from source, or inherited components that appear in the
3138 -- source of the ancestor.
3140 C := First_Component (T);
3141 while Present (C) loop
3142 if Is_Limited_Type (Etype (C))
3144 (Comes_From_Source (C)
3146 (Present (Original_Record_Component (C))
3148 Comes_From_Source (Original_Record_Component (C))))
3150 Error_Msg_Node_2 := T;
3151 Error_Msg_NE ("\component& of type& has limited type", N, C);
3152 Explain_Limited_Type (Etype (C), N);
3159 -- The type may be declared explicitly limited, even if no component
3160 -- of it is limited, in which case we fall out of the loop.
3163 end Explain_Limited_Type;
3169 procedure Find_Actual
3171 Formal : out Entity_Id;
3174 Parnt : constant Node_Id := Parent (N);
3178 if (Nkind (Parnt) = N_Indexed_Component
3180 Nkind (Parnt) = N_Selected_Component)
3181 and then N = Prefix (Parnt)
3183 Find_Actual (Parnt, Formal, Call);
3186 elsif Nkind (Parnt) = N_Parameter_Association
3187 and then N = Explicit_Actual_Parameter (Parnt)
3189 Call := Parent (Parnt);
3191 elsif Nkind (Parnt) = N_Procedure_Call_Statement then
3200 -- If we have a call to a subprogram look for the parameter. Note that
3201 -- we exclude overloaded calls, since we don't know enough to be sure
3202 -- of giving the right answer in this case.
3204 if Is_Entity_Name (Name (Call))
3205 and then Present (Entity (Name (Call)))
3206 and then Is_Overloadable (Entity (Name (Call)))
3207 and then not Is_Overloaded (Name (Call))
3209 -- Fall here if we are definitely a parameter
3211 Actual := First_Actual (Call);
3212 Formal := First_Formal (Entity (Name (Call)));
3213 while Present (Formal) and then Present (Actual) loop
3217 Actual := Next_Actual (Actual);
3218 Formal := Next_Formal (Formal);
3223 -- Fall through here if we did not find matching actual
3229 ---------------------------
3230 -- Find_Body_Discriminal --
3231 ---------------------------
3233 function Find_Body_Discriminal
3234 (Spec_Discriminant : Entity_Id) return Entity_Id
3236 pragma Assert (Is_Concurrent_Record_Type (Scope (Spec_Discriminant)));
3238 Tsk : constant Entity_Id :=
3239 Corresponding_Concurrent_Type (Scope (Spec_Discriminant));
3243 -- Find discriminant of original concurrent type, and use its current
3244 -- discriminal, which is the renaming within the task/protected body.
3246 Disc := First_Discriminant (Tsk);
3247 while Present (Disc) loop
3248 if Chars (Disc) = Chars (Spec_Discriminant) then
3249 return Discriminal (Disc);
3252 Next_Discriminant (Disc);
3255 -- That loop should always succeed in finding a matching entry and
3256 -- returning. Fatal error if not.
3258 raise Program_Error;
3259 end Find_Body_Discriminal;
3261 -------------------------------------
3262 -- Find_Corresponding_Discriminant --
3263 -------------------------------------
3265 function Find_Corresponding_Discriminant
3267 Typ : Entity_Id) return Entity_Id
3269 Par_Disc : Entity_Id;
3270 Old_Disc : Entity_Id;
3271 New_Disc : Entity_Id;
3274 Par_Disc := Original_Record_Component (Original_Discriminant (Id));
3276 -- The original type may currently be private, and the discriminant
3277 -- only appear on its full view.
3279 if Is_Private_Type (Scope (Par_Disc))
3280 and then not Has_Discriminants (Scope (Par_Disc))
3281 and then Present (Full_View (Scope (Par_Disc)))
3283 Old_Disc := First_Discriminant (Full_View (Scope (Par_Disc)));
3285 Old_Disc := First_Discriminant (Scope (Par_Disc));
3288 if Is_Class_Wide_Type (Typ) then
3289 New_Disc := First_Discriminant (Root_Type (Typ));
3291 New_Disc := First_Discriminant (Typ);
3294 while Present (Old_Disc) and then Present (New_Disc) loop
3295 if Old_Disc = Par_Disc then
3298 Next_Discriminant (Old_Disc);
3299 Next_Discriminant (New_Disc);
3303 -- Should always find it
3305 raise Program_Error;
3306 end Find_Corresponding_Discriminant;
3308 --------------------------
3309 -- Find_Overlaid_Entity --
3310 --------------------------
3312 procedure Find_Overlaid_Entity
3314 Ent : out Entity_Id;
3320 -- We are looking for one of the two following forms:
3322 -- for X'Address use Y'Address
3326 -- Const : constant Address := expr;
3328 -- for X'Address use Const;
3330 -- In the second case, the expr is either Y'Address, or recursively a
3331 -- constant that eventually references Y'Address.
3336 if Nkind (N) = N_Attribute_Definition_Clause
3337 and then Chars (N) = Name_Address
3339 Expr := Expression (N);
3341 -- This loop checks the form of the expression for Y'Address,
3342 -- using recursion to deal with intermediate constants.
3345 -- Check for Y'Address
3347 if Nkind (Expr) = N_Attribute_Reference
3348 and then Attribute_Name (Expr) = Name_Address
3350 Expr := Prefix (Expr);
3353 -- Check for Const where Const is a constant entity
3355 elsif Is_Entity_Name (Expr)
3356 and then Ekind (Entity (Expr)) = E_Constant
3358 Expr := Constant_Value (Entity (Expr));
3360 -- Anything else does not need checking
3367 -- This loop checks the form of the prefix for an entity,
3368 -- using recursion to deal with intermediate components.
3371 -- Check for Y where Y is an entity
3373 if Is_Entity_Name (Expr) then
3374 Ent := Entity (Expr);
3377 -- Check for components
3380 Nkind_In (Expr, N_Selected_Component, N_Indexed_Component) then
3382 Expr := Prefix (Expr);
3385 -- Anything else does not need checking
3392 end Find_Overlaid_Entity;
3394 -------------------------
3395 -- Find_Parameter_Type --
3396 -------------------------
3398 function Find_Parameter_Type (Param : Node_Id) return Entity_Id is
3400 if Nkind (Param) /= N_Parameter_Specification then
3403 -- For an access parameter, obtain the type from the formal entity
3404 -- itself, because access to subprogram nodes do not carry a type.
3405 -- Shouldn't we always use the formal entity ???
3407 elsif Nkind (Parameter_Type (Param)) = N_Access_Definition then
3408 return Etype (Defining_Identifier (Param));
3411 return Etype (Parameter_Type (Param));
3413 end Find_Parameter_Type;
3415 -----------------------------
3416 -- Find_Static_Alternative --
3417 -----------------------------
3419 function Find_Static_Alternative (N : Node_Id) return Node_Id is
3420 Expr : constant Node_Id := Expression (N);
3421 Val : constant Uint := Expr_Value (Expr);
3426 Alt := First (Alternatives (N));
3429 if Nkind (Alt) /= N_Pragma then
3430 Choice := First (Discrete_Choices (Alt));
3431 while Present (Choice) loop
3433 -- Others choice, always matches
3435 if Nkind (Choice) = N_Others_Choice then
3438 -- Range, check if value is in the range
3440 elsif Nkind (Choice) = N_Range then
3442 Val >= Expr_Value (Low_Bound (Choice))
3444 Val <= Expr_Value (High_Bound (Choice));
3446 -- Choice is a subtype name. Note that we know it must
3447 -- be a static subtype, since otherwise it would have
3448 -- been diagnosed as illegal.
3450 elsif Is_Entity_Name (Choice)
3451 and then Is_Type (Entity (Choice))
3453 exit Search when Is_In_Range (Expr, Etype (Choice),
3454 Assume_Valid => False);
3456 -- Choice is a subtype indication
3458 elsif Nkind (Choice) = N_Subtype_Indication then
3460 C : constant Node_Id := Constraint (Choice);
3461 R : constant Node_Id := Range_Expression (C);
3465 Val >= Expr_Value (Low_Bound (R))
3467 Val <= Expr_Value (High_Bound (R));
3470 -- Choice is a simple expression
3473 exit Search when Val = Expr_Value (Choice);
3481 pragma Assert (Present (Alt));
3484 -- The above loop *must* terminate by finding a match, since
3485 -- we know the case statement is valid, and the value of the
3486 -- expression is known at compile time. When we fall out of
3487 -- the loop, Alt points to the alternative that we know will
3488 -- be selected at run time.
3491 end Find_Static_Alternative;
3497 function First_Actual (Node : Node_Id) return Node_Id is
3501 if No (Parameter_Associations (Node)) then
3505 N := First (Parameter_Associations (Node));
3507 if Nkind (N) = N_Parameter_Association then
3508 return First_Named_Actual (Node);
3514 -----------------------
3515 -- Gather_Components --
3516 -----------------------
3518 procedure Gather_Components
3520 Comp_List : Node_Id;
3521 Governed_By : List_Id;
3523 Report_Errors : out Boolean)
3527 Discrete_Choice : Node_Id;
3528 Comp_Item : Node_Id;
3530 Discrim : Entity_Id;
3531 Discrim_Name : Node_Id;
3532 Discrim_Value : Node_Id;
3535 Report_Errors := False;
3537 if No (Comp_List) or else Null_Present (Comp_List) then
3540 elsif Present (Component_Items (Comp_List)) then
3541 Comp_Item := First (Component_Items (Comp_List));
3547 while Present (Comp_Item) loop
3549 -- Skip the tag of a tagged record, the interface tags, as well
3550 -- as all items that are not user components (anonymous types,
3551 -- rep clauses, Parent field, controller field).
3553 if Nkind (Comp_Item) = N_Component_Declaration then
3555 Comp : constant Entity_Id := Defining_Identifier (Comp_Item);
3557 if not Is_Tag (Comp)
3558 and then Chars (Comp) /= Name_uParent
3559 and then Chars (Comp) /= Name_uController
3561 Append_Elmt (Comp, Into);
3569 if No (Variant_Part (Comp_List)) then
3572 Discrim_Name := Name (Variant_Part (Comp_List));
3573 Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
3576 -- Look for the discriminant that governs this variant part.
3577 -- The discriminant *must* be in the Governed_By List
3579 Assoc := First (Governed_By);
3580 Find_Constraint : loop
3581 Discrim := First (Choices (Assoc));
3582 exit Find_Constraint when Chars (Discrim_Name) = Chars (Discrim)
3583 or else (Present (Corresponding_Discriminant (Entity (Discrim)))
3585 Chars (Corresponding_Discriminant (Entity (Discrim)))
3586 = Chars (Discrim_Name))
3587 or else Chars (Original_Record_Component (Entity (Discrim)))
3588 = Chars (Discrim_Name);
3590 if No (Next (Assoc)) then
3591 if not Is_Constrained (Typ)
3592 and then Is_Derived_Type (Typ)
3593 and then Present (Stored_Constraint (Typ))
3595 -- If the type is a tagged type with inherited discriminants,
3596 -- use the stored constraint on the parent in order to find
3597 -- the values of discriminants that are otherwise hidden by an
3598 -- explicit constraint. Renamed discriminants are handled in
3601 -- If several parent discriminants are renamed by a single
3602 -- discriminant of the derived type, the call to obtain the
3603 -- Corresponding_Discriminant field only retrieves the last
3604 -- of them. We recover the constraint on the others from the
3605 -- Stored_Constraint as well.
3612 D := First_Discriminant (Etype (Typ));
3613 C := First_Elmt (Stored_Constraint (Typ));
3614 while Present (D) and then Present (C) loop
3615 if Chars (Discrim_Name) = Chars (D) then
3616 if Is_Entity_Name (Node (C))
3617 and then Entity (Node (C)) = Entity (Discrim)
3619 -- D is renamed by Discrim, whose value is given in
3626 Make_Component_Association (Sloc (Typ),
3628 (New_Occurrence_Of (D, Sloc (Typ))),
3629 Duplicate_Subexpr_No_Checks (Node (C)));
3631 exit Find_Constraint;
3634 Next_Discriminant (D);
3641 if No (Next (Assoc)) then
3642 Error_Msg_NE (" missing value for discriminant&",
3643 First (Governed_By), Discrim_Name);
3644 Report_Errors := True;
3649 end loop Find_Constraint;
3651 Discrim_Value := Expression (Assoc);
3653 if not Is_OK_Static_Expression (Discrim_Value) then
3655 ("value for discriminant & must be static!",
3656 Discrim_Value, Discrim);
3657 Why_Not_Static (Discrim_Value);
3658 Report_Errors := True;
3662 Search_For_Discriminant_Value : declare
3668 UI_Discrim_Value : constant Uint := Expr_Value (Discrim_Value);
3671 Find_Discrete_Value : while Present (Variant) loop
3672 Discrete_Choice := First (Discrete_Choices (Variant));
3673 while Present (Discrete_Choice) loop
3675 exit Find_Discrete_Value when
3676 Nkind (Discrete_Choice) = N_Others_Choice;
3678 Get_Index_Bounds (Discrete_Choice, Low, High);
3680 UI_Low := Expr_Value (Low);
3681 UI_High := Expr_Value (High);
3683 exit Find_Discrete_Value when
3684 UI_Low <= UI_Discrim_Value
3686 UI_High >= UI_Discrim_Value;
3688 Next (Discrete_Choice);
3691 Next_Non_Pragma (Variant);
3692 end loop Find_Discrete_Value;
3693 end Search_For_Discriminant_Value;
3695 if No (Variant) then
3697 ("value of discriminant & is out of range", Discrim_Value, Discrim);
3698 Report_Errors := True;
3702 -- If we have found the corresponding choice, recursively add its
3703 -- components to the Into list.
3705 Gather_Components (Empty,
3706 Component_List (Variant), Governed_By, Into, Report_Errors);
3707 end Gather_Components;
3709 ------------------------
3710 -- Get_Actual_Subtype --
3711 ------------------------
3713 function Get_Actual_Subtype (N : Node_Id) return Entity_Id is
3714 Typ : constant Entity_Id := Etype (N);
3715 Utyp : Entity_Id := Underlying_Type (Typ);
3724 -- If what we have is an identifier that references a subprogram
3725 -- formal, or a variable or constant object, then we get the actual
3726 -- subtype from the referenced entity if one has been built.
3728 if Nkind (N) = N_Identifier
3730 (Is_Formal (Entity (N))
3731 or else Ekind (Entity (N)) = E_Constant
3732 or else Ekind (Entity (N)) = E_Variable)
3733 and then Present (Actual_Subtype (Entity (N)))
3735 return Actual_Subtype (Entity (N));
3737 -- Actual subtype of unchecked union is always itself. We never need
3738 -- the "real" actual subtype. If we did, we couldn't get it anyway
3739 -- because the discriminant is not available. The restrictions on
3740 -- Unchecked_Union are designed to make sure that this is OK.
3742 elsif Is_Unchecked_Union (Base_Type (Utyp)) then
3745 -- Here for the unconstrained case, we must find actual subtype
3746 -- No actual subtype is available, so we must build it on the fly.
3748 -- Checking the type, not the underlying type, for constrainedness
3749 -- seems to be necessary. Maybe all the tests should be on the type???
3751 elsif (not Is_Constrained (Typ))
3752 and then (Is_Array_Type (Utyp)
3753 or else (Is_Record_Type (Utyp)
3754 and then Has_Discriminants (Utyp)))
3755 and then not Has_Unknown_Discriminants (Utyp)
3756 and then not (Ekind (Utyp) = E_String_Literal_Subtype)
3758 -- Nothing to do if in spec expression (why not???)
3760 if In_Spec_Expression then
3763 elsif Is_Private_Type (Typ)
3764 and then not Has_Discriminants (Typ)
3766 -- If the type has no discriminants, there is no subtype to
3767 -- build, even if the underlying type is discriminated.
3771 -- Else build the actual subtype
3774 Decl := Build_Actual_Subtype (Typ, N);
3775 Atyp := Defining_Identifier (Decl);
3777 -- If Build_Actual_Subtype generated a new declaration then use it
3781 -- The actual subtype is an Itype, so analyze the declaration,
3782 -- but do not attach it to the tree, to get the type defined.
3784 Set_Parent (Decl, N);
3785 Set_Is_Itype (Atyp);
3786 Analyze (Decl, Suppress => All_Checks);
3787 Set_Associated_Node_For_Itype (Atyp, N);
3788 Set_Has_Delayed_Freeze (Atyp, False);
3790 -- We need to freeze the actual subtype immediately. This is
3791 -- needed, because otherwise this Itype will not get frozen
3792 -- at all, and it is always safe to freeze on creation because
3793 -- any associated types must be frozen at this point.
3795 Freeze_Itype (Atyp, N);
3798 -- Otherwise we did not build a declaration, so return original
3805 -- For all remaining cases, the actual subtype is the same as
3806 -- the nominal type.
3811 end Get_Actual_Subtype;
3813 -------------------------------------
3814 -- Get_Actual_Subtype_If_Available --
3815 -------------------------------------
3817 function Get_Actual_Subtype_If_Available (N : Node_Id) return Entity_Id is
3818 Typ : constant Entity_Id := Etype (N);
3821 -- If what we have is an identifier that references a subprogram
3822 -- formal, or a variable or constant object, then we get the actual
3823 -- subtype from the referenced entity if one has been built.
3825 if Nkind (N) = N_Identifier
3827 (Is_Formal (Entity (N))
3828 or else Ekind (Entity (N)) = E_Constant
3829 or else Ekind (Entity (N)) = E_Variable)
3830 and then Present (Actual_Subtype (Entity (N)))
3832 return Actual_Subtype (Entity (N));
3834 -- Otherwise the Etype of N is returned unchanged
3839 end Get_Actual_Subtype_If_Available;
3841 -------------------------------
3842 -- Get_Default_External_Name --
3843 -------------------------------
3845 function Get_Default_External_Name (E : Node_Or_Entity_Id) return Node_Id is
3847 Get_Decoded_Name_String (Chars (E));
3849 if Opt.External_Name_Imp_Casing = Uppercase then
3850 Set_Casing (All_Upper_Case);
3852 Set_Casing (All_Lower_Case);
3856 Make_String_Literal (Sloc (E),
3857 Strval => String_From_Name_Buffer);
3858 end Get_Default_External_Name;
3860 ---------------------------
3861 -- Get_Enum_Lit_From_Pos --
3862 ---------------------------
3864 function Get_Enum_Lit_From_Pos
3867 Loc : Source_Ptr) return Node_Id
3872 -- In the case where the literal is of type Character, Wide_Character
3873 -- or Wide_Wide_Character or of a type derived from them, there needs
3874 -- to be some special handling since there is no explicit chain of
3875 -- literals to search. Instead, an N_Character_Literal node is created
3876 -- with the appropriate Char_Code and Chars fields.
3878 if Is_Standard_Character_Type (T) then
3879 Set_Character_Literal_Name (UI_To_CC (Pos));
3881 Make_Character_Literal (Loc,
3883 Char_Literal_Value => Pos);
3885 -- For all other cases, we have a complete table of literals, and
3886 -- we simply iterate through the chain of literal until the one
3887 -- with the desired position value is found.
3891 Lit := First_Literal (Base_Type (T));
3892 for J in 1 .. UI_To_Int (Pos) loop
3896 return New_Occurrence_Of (Lit, Loc);
3898 end Get_Enum_Lit_From_Pos;
3900 ------------------------
3901 -- Get_Generic_Entity --
3902 ------------------------
3904 function Get_Generic_Entity (N : Node_Id) return Entity_Id is
3905 Ent : constant Entity_Id := Entity (Name (N));
3907 if Present (Renamed_Object (Ent)) then
3908 return Renamed_Object (Ent);
3912 end Get_Generic_Entity;
3914 ----------------------
3915 -- Get_Index_Bounds --
3916 ----------------------
3918 procedure Get_Index_Bounds (N : Node_Id; L, H : out Node_Id) is
3919 Kind : constant Node_Kind := Nkind (N);
3923 if Kind = N_Range then
3925 H := High_Bound (N);
3927 elsif Kind = N_Subtype_Indication then
3928 R := Range_Expression (Constraint (N));
3936 L := Low_Bound (Range_Expression (Constraint (N)));
3937 H := High_Bound (Range_Expression (Constraint (N)));
3940 elsif Is_Entity_Name (N) and then Is_Type (Entity (N)) then
3941 if Error_Posted (Scalar_Range (Entity (N))) then
3945 elsif Nkind (Scalar_Range (Entity (N))) = N_Subtype_Indication then
3946 Get_Index_Bounds (Scalar_Range (Entity (N)), L, H);
3949 L := Low_Bound (Scalar_Range (Entity (N)));
3950 H := High_Bound (Scalar_Range (Entity (N)));
3954 -- N is an expression, indicating a range with one value
3959 end Get_Index_Bounds;
3961 ----------------------------------
3962 -- Get_Library_Unit_Name_string --
3963 ----------------------------------
3965 procedure Get_Library_Unit_Name_String (Decl_Node : Node_Id) is
3966 Unit_Name_Id : constant Unit_Name_Type := Get_Unit_Name (Decl_Node);
3969 Get_Unit_Name_String (Unit_Name_Id);
3971 -- Remove seven last character (" (spec)" or " (body)")
3973 Name_Len := Name_Len - 7;
3974 pragma Assert (Name_Buffer (Name_Len + 1) = ' ');
3975 end Get_Library_Unit_Name_String;
3977 ------------------------
3978 -- Get_Name_Entity_Id --
3979 ------------------------
3981 function Get_Name_Entity_Id (Id : Name_Id) return Entity_Id is
3983 return Entity_Id (Get_Name_Table_Info (Id));
3984 end Get_Name_Entity_Id;
3990 function Get_Pragma_Id (N : Node_Id) return Pragma_Id is
3992 return Get_Pragma_Id (Pragma_Name (N));
3995 ---------------------------
3996 -- Get_Referenced_Object --
3997 ---------------------------
3999 function Get_Referenced_Object (N : Node_Id) return Node_Id is
4004 while Is_Entity_Name (R)
4005 and then Present (Renamed_Object (Entity (R)))
4007 R := Renamed_Object (Entity (R));
4011 end Get_Referenced_Object;
4013 ------------------------
4014 -- Get_Renamed_Entity --
4015 ------------------------
4017 function Get_Renamed_Entity (E : Entity_Id) return Entity_Id is
4022 while Present (Renamed_Entity (R)) loop
4023 R := Renamed_Entity (R);
4027 end Get_Renamed_Entity;
4029 -------------------------
4030 -- Get_Subprogram_Body --
4031 -------------------------
4033 function Get_Subprogram_Body (E : Entity_Id) return Node_Id is
4037 Decl := Unit_Declaration_Node (E);
4039 if Nkind (Decl) = N_Subprogram_Body then
4042 -- The below comment is bad, because it is possible for
4043 -- Nkind (Decl) to be an N_Subprogram_Body_Stub ???
4045 else -- Nkind (Decl) = N_Subprogram_Declaration
4047 if Present (Corresponding_Body (Decl)) then
4048 return Unit_Declaration_Node (Corresponding_Body (Decl));
4050 -- Imported subprogram case
4056 end Get_Subprogram_Body;
4058 ---------------------------
4059 -- Get_Subprogram_Entity --
4060 ---------------------------
4062 function Get_Subprogram_Entity (Nod : Node_Id) return Entity_Id is
4067 if Nkind (Nod) = N_Accept_Statement then
4068 Nam := Entry_Direct_Name (Nod);
4070 -- For an entry call, the prefix of the call is a selected component.
4071 -- Need additional code for internal calls ???
4073 elsif Nkind (Nod) = N_Entry_Call_Statement then
4074 if Nkind (Name (Nod)) = N_Selected_Component then
4075 Nam := Entity (Selector_Name (Name (Nod)));
4084 if Nkind (Nam) = N_Explicit_Dereference then
4085 Proc := Etype (Prefix (Nam));
4086 elsif Is_Entity_Name (Nam) then
4087 Proc := Entity (Nam);
4092 if Is_Object (Proc) then
4093 Proc := Etype (Proc);
4096 if Ekind (Proc) = E_Access_Subprogram_Type then
4097 Proc := Directly_Designated_Type (Proc);
4100 if not Is_Subprogram (Proc)
4101 and then Ekind (Proc) /= E_Subprogram_Type
4107 end Get_Subprogram_Entity;
4109 -----------------------------
4110 -- Get_Task_Body_Procedure --
4111 -----------------------------
4113 function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
4115 -- Note: A task type may be the completion of a private type with
4116 -- discriminants. When performing elaboration checks on a task
4117 -- declaration, the current view of the type may be the private one,
4118 -- and the procedure that holds the body of the task is held in its
4121 -- This is an odd function, why not have Task_Body_Procedure do
4122 -- the following digging???
4124 return Task_Body_Procedure (Underlying_Type (Root_Type (E)));
4125 end Get_Task_Body_Procedure;
4127 -----------------------
4128 -- Has_Access_Values --
4129 -----------------------
4131 function Has_Access_Values (T : Entity_Id) return Boolean is
4132 Typ : constant Entity_Id := Underlying_Type (T);
4135 -- Case of a private type which is not completed yet. This can only
4136 -- happen in the case of a generic format type appearing directly, or
4137 -- as a component of the type to which this function is being applied
4138 -- at the top level. Return False in this case, since we certainly do
4139 -- not know that the type contains access types.
4144 elsif Is_Access_Type (Typ) then
4147 elsif Is_Array_Type (Typ) then
4148 return Has_Access_Values (Component_Type (Typ));
4150 elsif Is_Record_Type (Typ) then
4155 -- Loop to Check components
4157 Comp := First_Component_Or_Discriminant (Typ);
4158 while Present (Comp) loop
4160 -- Check for access component, tag field does not count, even
4161 -- though it is implemented internally using an access type.
4163 if Has_Access_Values (Etype (Comp))
4164 and then Chars (Comp) /= Name_uTag
4169 Next_Component_Or_Discriminant (Comp);
4178 end Has_Access_Values;
4180 ------------------------------
4181 -- Has_Compatible_Alignment --
4182 ------------------------------
4184 function Has_Compatible_Alignment
4186 Expr : Node_Id) return Alignment_Result
4188 function Has_Compatible_Alignment_Internal
4191 Default : Alignment_Result) return Alignment_Result;
4192 -- This is the internal recursive function that actually does the work.
4193 -- There is one additional parameter, which says what the result should
4194 -- be if no alignment information is found, and there is no definite
4195 -- indication of compatible alignments. At the outer level, this is set
4196 -- to Unknown, but for internal recursive calls in the case where types
4197 -- are known to be correct, it is set to Known_Compatible.
4199 ---------------------------------------
4200 -- Has_Compatible_Alignment_Internal --
4201 ---------------------------------------
4203 function Has_Compatible_Alignment_Internal
4206 Default : Alignment_Result) return Alignment_Result
4208 Result : Alignment_Result := Known_Compatible;
4209 -- Holds the current status of the result. Note that once a value of
4210 -- Known_Incompatible is set, it is sticky and does not get changed
4211 -- to Unknown (the value in Result only gets worse as we go along,
4214 Offs : Uint := No_Uint;
4215 -- Set to a factor of the offset from the base object when Expr is a
4216 -- selected or indexed component, based on Component_Bit_Offset and
4217 -- Component_Size respectively. A negative value is used to represent
4218 -- a value which is not known at compile time.
4220 procedure Check_Prefix;
4221 -- Checks the prefix recursively in the case where the expression
4222 -- is an indexed or selected component.
4224 procedure Set_Result (R : Alignment_Result);
4225 -- If R represents a worse outcome (unknown instead of known
4226 -- compatible, or known incompatible), then set Result to R.
4232 procedure Check_Prefix is
4234 -- The subtlety here is that in doing a recursive call to check
4235 -- the prefix, we have to decide what to do in the case where we
4236 -- don't find any specific indication of an alignment problem.
4238 -- At the outer level, we normally set Unknown as the result in
4239 -- this case, since we can only set Known_Compatible if we really
4240 -- know that the alignment value is OK, but for the recursive
4241 -- call, in the case where the types match, and we have not
4242 -- specified a peculiar alignment for the object, we are only
4243 -- concerned about suspicious rep clauses, the default case does
4244 -- not affect us, since the compiler will, in the absence of such
4245 -- rep clauses, ensure that the alignment is correct.
4247 if Default = Known_Compatible
4249 (Etype (Obj) = Etype (Expr)
4250 and then (Unknown_Alignment (Obj)
4252 Alignment (Obj) = Alignment (Etype (Obj))))
4255 (Has_Compatible_Alignment_Internal
4256 (Obj, Prefix (Expr), Known_Compatible));
4258 -- In all other cases, we need a full check on the prefix
4262 (Has_Compatible_Alignment_Internal
4263 (Obj, Prefix (Expr), Unknown));
4271 procedure Set_Result (R : Alignment_Result) is
4278 -- Start of processing for Has_Compatible_Alignment_Internal
4281 -- If Expr is a selected component, we must make sure there is no
4282 -- potentially troublesome component clause, and that the record is
4285 if Nkind (Expr) = N_Selected_Component then
4287 -- Packed record always generate unknown alignment
4289 if Is_Packed (Etype (Prefix (Expr))) then
4290 Set_Result (Unknown);
4293 -- Check prefix and component offset
4296 Offs := Component_Bit_Offset (Entity (Selector_Name (Expr)));
4298 -- If Expr is an indexed component, we must make sure there is no
4299 -- potentially troublesome Component_Size clause and that the array
4300 -- is not bit-packed.
4302 elsif Nkind (Expr) = N_Indexed_Component then
4304 Typ : constant Entity_Id := Etype (Prefix (Expr));
4305 Ind : constant Node_Id := First_Index (Typ);
4308 -- Bit packed array always generates unknown alignment
4310 if Is_Bit_Packed_Array (Typ) then
4311 Set_Result (Unknown);
4314 -- Check prefix and component offset
4317 Offs := Component_Size (Typ);
4319 -- Small optimization: compute the full offset when possible
4322 and then Offs > Uint_0
4323 and then Present (Ind)
4324 and then Nkind (Ind) = N_Range
4325 and then Compile_Time_Known_Value (Low_Bound (Ind))
4326 and then Compile_Time_Known_Value (First (Expressions (Expr)))
4328 Offs := Offs * (Expr_Value (First (Expressions (Expr)))
4329 - Expr_Value (Low_Bound ((Ind))));
4334 -- If we have a null offset, the result is entirely determined by
4335 -- the base object and has already been computed recursively.
4337 if Offs = Uint_0 then
4340 -- Case where we know the alignment of the object
4342 elsif Known_Alignment (Obj) then
4344 ObjA : constant Uint := Alignment (Obj);
4345 ExpA : Uint := No_Uint;
4346 SizA : Uint := No_Uint;
4349 -- If alignment of Obj is 1, then we are always OK
4352 Set_Result (Known_Compatible);
4354 -- Alignment of Obj is greater than 1, so we need to check
4357 -- If we have an offset, see if it is compatible
4359 if Offs /= No_Uint and Offs > Uint_0 then
4360 if Offs mod (System_Storage_Unit * ObjA) /= 0 then
4361 Set_Result (Known_Incompatible);
4364 -- See if Expr is an object with known alignment
4366 elsif Is_Entity_Name (Expr)
4367 and then Known_Alignment (Entity (Expr))
4369 ExpA := Alignment (Entity (Expr));
4371 -- Otherwise, we can use the alignment of the type of
4372 -- Expr given that we already checked for
4373 -- discombobulating rep clauses for the cases of indexed
4374 -- and selected components above.
4376 elsif Known_Alignment (Etype (Expr)) then
4377 ExpA := Alignment (Etype (Expr));
4379 -- Otherwise the alignment is unknown
4382 Set_Result (Default);
4385 -- If we got an alignment, see if it is acceptable
4387 if ExpA /= No_Uint and then ExpA < ObjA then
4388 Set_Result (Known_Incompatible);
4391 -- If Expr is not a piece of a larger object, see if size
4392 -- is given. If so, check that it is not too small for the
4393 -- required alignment.
4395 if Offs /= No_Uint then
4398 -- See if Expr is an object with known size
4400 elsif Is_Entity_Name (Expr)
4401 and then Known_Static_Esize (Entity (Expr))
4403 SizA := Esize (Entity (Expr));
4405 -- Otherwise, we check the object size of the Expr type
4407 elsif Known_Static_Esize (Etype (Expr)) then
4408 SizA := Esize (Etype (Expr));
4411 -- If we got a size, see if it is a multiple of the Obj
4412 -- alignment, if not, then the alignment cannot be
4413 -- acceptable, since the size is always a multiple of the
4416 if SizA /= No_Uint then
4417 if SizA mod (ObjA * Ttypes.System_Storage_Unit) /= 0 then
4418 Set_Result (Known_Incompatible);
4424 -- If we do not know required alignment, any non-zero offset is a
4425 -- potential problem (but certainly may be OK, so result is unknown).
4427 elsif Offs /= No_Uint then
4428 Set_Result (Unknown);
4430 -- If we can't find the result by direct comparison of alignment
4431 -- values, then there is still one case that we can determine known
4432 -- result, and that is when we can determine that the types are the
4433 -- same, and no alignments are specified. Then we known that the
4434 -- alignments are compatible, even if we don't know the alignment
4435 -- value in the front end.
4437 elsif Etype (Obj) = Etype (Expr) then
4439 -- Types are the same, but we have to check for possible size
4440 -- and alignments on the Expr object that may make the alignment
4441 -- different, even though the types are the same.
4443 if Is_Entity_Name (Expr) then
4445 -- First check alignment of the Expr object. Any alignment less
4446 -- than Maximum_Alignment is worrisome since this is the case
4447 -- where we do not know the alignment of Obj.
4449 if Known_Alignment (Entity (Expr))
4451 UI_To_Int (Alignment (Entity (Expr))) <
4452 Ttypes.Maximum_Alignment
4454 Set_Result (Unknown);
4456 -- Now check size of Expr object. Any size that is not an
4457 -- even multiple of Maximum_Alignment is also worrisome
4458 -- since it may cause the alignment of the object to be less
4459 -- than the alignment of the type.
4461 elsif Known_Static_Esize (Entity (Expr))
4463 (UI_To_Int (Esize (Entity (Expr))) mod
4464 (Ttypes.Maximum_Alignment * Ttypes.System_Storage_Unit))
4467 Set_Result (Unknown);
4469 -- Otherwise same type is decisive
4472 Set_Result (Known_Compatible);
4476 -- Another case to deal with is when there is an explicit size or
4477 -- alignment clause when the types are not the same. If so, then the
4478 -- result is Unknown. We don't need to do this test if the Default is
4479 -- Unknown, since that result will be set in any case.
4481 elsif Default /= Unknown
4482 and then (Has_Size_Clause (Etype (Expr))
4484 Has_Alignment_Clause (Etype (Expr)))
4486 Set_Result (Unknown);
4488 -- If no indication found, set default
4491 Set_Result (Default);
4494 -- Return worst result found
4497 end Has_Compatible_Alignment_Internal;
4499 -- Start of processing for Has_Compatible_Alignment
4502 -- If Obj has no specified alignment, then set alignment from the type
4503 -- alignment. Perhaps we should always do this, but for sure we should
4504 -- do it when there is an address clause since we can do more if the
4505 -- alignment is known.
4507 if Unknown_Alignment (Obj) then
4508 Set_Alignment (Obj, Alignment (Etype (Obj)));
4511 -- Now do the internal call that does all the work
4513 return Has_Compatible_Alignment_Internal (Obj, Expr, Unknown);
4514 end Has_Compatible_Alignment;
4516 ----------------------
4517 -- Has_Declarations --
4518 ----------------------
4520 function Has_Declarations (N : Node_Id) return Boolean is
4522 return Nkind_In (Nkind (N), N_Accept_Statement,
4524 N_Compilation_Unit_Aux,
4530 N_Package_Specification);
4531 end Has_Declarations;
4533 -------------------------------------------
4534 -- Has_Discriminant_Dependent_Constraint --
4535 -------------------------------------------
4537 function Has_Discriminant_Dependent_Constraint
4538 (Comp : Entity_Id) return Boolean
4540 Comp_Decl : constant Node_Id := Parent (Comp);
4541 Subt_Indic : constant Node_Id :=
4542 Subtype_Indication (Component_Definition (Comp_Decl));
4547 if Nkind (Subt_Indic) = N_Subtype_Indication then
4548 Constr := Constraint (Subt_Indic);
4550 if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
4551 Assn := First (Constraints (Constr));
4552 while Present (Assn) loop
4553 case Nkind (Assn) is
4554 when N_Subtype_Indication |
4558 if Depends_On_Discriminant (Assn) then
4562 when N_Discriminant_Association =>
4563 if Depends_On_Discriminant (Expression (Assn)) then
4578 end Has_Discriminant_Dependent_Constraint;
4580 --------------------
4581 -- Has_Infinities --
4582 --------------------
4584 function Has_Infinities (E : Entity_Id) return Boolean is
4587 Is_Floating_Point_Type (E)
4588 and then Nkind (Scalar_Range (E)) = N_Range
4589 and then Includes_Infinities (Scalar_Range (E));
4592 --------------------
4593 -- Has_Interfaces --
4594 --------------------
4596 function Has_Interfaces
4598 Use_Full_View : Boolean := True) return Boolean
4600 Typ : Entity_Id := Base_Type (T);
4603 -- Handle concurrent types
4605 if Is_Concurrent_Type (Typ) then
4606 Typ := Corresponding_Record_Type (Typ);
4609 if not Present (Typ)
4610 or else not Is_Record_Type (Typ)
4611 or else not Is_Tagged_Type (Typ)
4616 -- Handle private types
4619 and then Present (Full_View (Typ))
4621 Typ := Full_View (Typ);
4624 -- Handle concurrent record types
4626 if Is_Concurrent_Record_Type (Typ)
4627 and then Is_Non_Empty_List (Abstract_Interface_List (Typ))
4633 if Is_Interface (Typ)
4635 (Is_Record_Type (Typ)
4636 and then Present (Interfaces (Typ))
4637 and then not Is_Empty_Elmt_List (Interfaces (Typ)))
4642 exit when Etype (Typ) = Typ
4644 -- Handle private types
4646 or else (Present (Full_View (Etype (Typ)))
4647 and then Full_View (Etype (Typ)) = Typ)
4649 -- Protect the frontend against wrong source with cyclic
4652 or else Etype (Typ) = T;
4654 -- Climb to the ancestor type handling private types
4656 if Present (Full_View (Etype (Typ))) then
4657 Typ := Full_View (Etype (Typ));
4666 ------------------------
4667 -- Has_Null_Exclusion --
4668 ------------------------
4670 function Has_Null_Exclusion (N : Node_Id) return Boolean is
4673 when N_Access_Definition |
4674 N_Access_Function_Definition |
4675 N_Access_Procedure_Definition |
4676 N_Access_To_Object_Definition |
4678 N_Derived_Type_Definition |
4679 N_Function_Specification |
4680 N_Subtype_Declaration =>
4681 return Null_Exclusion_Present (N);
4683 when N_Component_Definition |
4684 N_Formal_Object_Declaration |
4685 N_Object_Renaming_Declaration =>
4686 if Present (Subtype_Mark (N)) then
4687 return Null_Exclusion_Present (N);
4688 else pragma Assert (Present (Access_Definition (N)));
4689 return Null_Exclusion_Present (Access_Definition (N));
4692 when N_Discriminant_Specification =>
4693 if Nkind (Discriminant_Type (N)) = N_Access_Definition then
4694 return Null_Exclusion_Present (Discriminant_Type (N));
4696 return Null_Exclusion_Present (N);
4699 when N_Object_Declaration =>
4700 if Nkind (Object_Definition (N)) = N_Access_Definition then
4701 return Null_Exclusion_Present (Object_Definition (N));
4703 return Null_Exclusion_Present (N);
4706 when N_Parameter_Specification =>
4707 if Nkind (Parameter_Type (N)) = N_Access_Definition then
4708 return Null_Exclusion_Present (Parameter_Type (N));
4710 return Null_Exclusion_Present (N);
4717 end Has_Null_Exclusion;
4719 ------------------------
4720 -- Has_Null_Extension --
4721 ------------------------
4723 function Has_Null_Extension (T : Entity_Id) return Boolean is
4724 B : constant Entity_Id := Base_Type (T);
4729 if Nkind (Parent (B)) = N_Full_Type_Declaration
4730 and then Present (Record_Extension_Part (Type_Definition (Parent (B))))
4732 Ext := Record_Extension_Part (Type_Definition (Parent (B)));
4734 if Present (Ext) then
4735 if Null_Present (Ext) then
4738 Comps := Component_List (Ext);
4740 -- The null component list is rewritten during analysis to
4741 -- include the parent component. Any other component indicates
4742 -- that the extension was not originally null.
4744 return Null_Present (Comps)
4745 or else No (Next (First (Component_Items (Comps))));
4754 end Has_Null_Extension;
4756 -------------------------------
4757 -- Has_Overriding_Initialize --
4758 -------------------------------
4760 function Has_Overriding_Initialize (T : Entity_Id) return Boolean is
4761 BT : constant Entity_Id := Base_Type (T);
4766 if Is_Controlled (BT) then
4768 -- For derived types, check immediate ancestor, excluding
4769 -- Controlled itself.
4771 if Is_Derived_Type (BT)
4772 and then not In_Predefined_Unit (Etype (BT))
4773 and then Has_Overriding_Initialize (Etype (BT))
4777 elsif Present (Primitive_Operations (BT)) then
4778 P := First_Elmt (Primitive_Operations (BT));
4779 while Present (P) loop
4780 if Chars (Node (P)) = Name_Initialize
4781 and then Comes_From_Source (Node (P))
4792 elsif Has_Controlled_Component (BT) then
4793 Comp := First_Component (BT);
4794 while Present (Comp) loop
4795 if Has_Overriding_Initialize (Etype (Comp)) then
4799 Next_Component (Comp);
4807 end Has_Overriding_Initialize;
4809 --------------------------------------
4810 -- Has_Preelaborable_Initialization --
4811 --------------------------------------
4813 function Has_Preelaborable_Initialization (E : Entity_Id) return Boolean is
4816 procedure Check_Components (E : Entity_Id);
4817 -- Check component/discriminant chain, sets Has_PE False if a component
4818 -- or discriminant does not meet the preelaborable initialization rules.
4820 ----------------------
4821 -- Check_Components --
4822 ----------------------
4824 procedure Check_Components (E : Entity_Id) is
4828 function Is_Preelaborable_Expression (N : Node_Id) return Boolean;
4829 -- Returns True if and only if the expression denoted by N does not
4830 -- violate restrictions on preelaborable constructs (RM-10.2.1(5-9)).
4832 ---------------------------------
4833 -- Is_Preelaborable_Expression --
4834 ---------------------------------
4836 function Is_Preelaborable_Expression (N : Node_Id) return Boolean is
4840 Comp_Type : Entity_Id;
4841 Is_Array_Aggr : Boolean;
4844 if Is_Static_Expression (N) then
4847 elsif Nkind (N) = N_Null then
4850 -- Attributes are allowed in general, even if their prefix is a
4851 -- formal type. (It seems that certain attributes known not to be
4852 -- static might not be allowed, but there are no rules to prevent
4855 elsif Nkind (N) = N_Attribute_Reference then
4858 -- The name of a discriminant evaluated within its parent type is
4859 -- defined to be preelaborable (10.2.1(8)). Note that we test for
4860 -- names that denote discriminals as well as discriminants to
4861 -- catch references occurring within init procs.
4863 elsif Is_Entity_Name (N)
4865 (Ekind (Entity (N)) = E_Discriminant
4867 ((Ekind (Entity (N)) = E_Constant
4868 or else Ekind (Entity (N)) = E_In_Parameter)
4869 and then Present (Discriminal_Link (Entity (N)))))
4873 elsif Nkind (N) = N_Qualified_Expression then
4874 return Is_Preelaborable_Expression (Expression (N));
4876 -- For aggregates we have to check that each of the associations
4877 -- is preelaborable.
4879 elsif Nkind (N) = N_Aggregate
4880 or else Nkind (N) = N_Extension_Aggregate
4882 Is_Array_Aggr := Is_Array_Type (Etype (N));
4884 if Is_Array_Aggr then
4885 Comp_Type := Component_Type (Etype (N));
4888 -- Check the ancestor part of extension aggregates, which must
4889 -- be either the name of a type that has preelaborable init or
4890 -- an expression that is preelaborable.
4892 if Nkind (N) = N_Extension_Aggregate then
4894 Anc_Part : constant Node_Id := Ancestor_Part (N);
4897 if Is_Entity_Name (Anc_Part)
4898 and then Is_Type (Entity (Anc_Part))
4900 if not Has_Preelaborable_Initialization
4906 elsif not Is_Preelaborable_Expression (Anc_Part) then
4912 -- Check positional associations
4914 Exp := First (Expressions (N));
4915 while Present (Exp) loop
4916 if not Is_Preelaborable_Expression (Exp) then
4923 -- Check named associations
4925 Assn := First (Component_Associations (N));
4926 while Present (Assn) loop
4927 Choice := First (Choices (Assn));
4928 while Present (Choice) loop
4929 if Is_Array_Aggr then
4930 if Nkind (Choice) = N_Others_Choice then
4933 elsif Nkind (Choice) = N_Range then
4934 if not Is_Static_Range (Choice) then
4938 elsif not Is_Static_Expression (Choice) then
4943 Comp_Type := Etype (Choice);
4949 -- If the association has a <> at this point, then we have
4950 -- to check whether the component's type has preelaborable
4951 -- initialization. Note that this only occurs when the
4952 -- association's corresponding component does not have a
4953 -- default expression, the latter case having already been
4954 -- expanded as an expression for the association.
4956 if Box_Present (Assn) then
4957 if not Has_Preelaborable_Initialization (Comp_Type) then
4961 -- In the expression case we check whether the expression
4962 -- is preelaborable.
4965 not Is_Preelaborable_Expression (Expression (Assn))
4973 -- If we get here then aggregate as a whole is preelaborable
4977 -- All other cases are not preelaborable
4982 end Is_Preelaborable_Expression;
4984 -- Start of processing for Check_Components
4987 -- Loop through entities of record or protected type
4990 while Present (Ent) loop
4992 -- We are interested only in components and discriminants
4994 if Ekind_In (Ent, E_Component, E_Discriminant) then
4996 -- Get default expression if any. If there is no declaration
4997 -- node, it means we have an internal entity. The parent and
4998 -- tag fields are examples of such entities. For these cases,
4999 -- we just test the type of the entity.
5001 if Present (Declaration_Node (Ent)) then
5002 Exp := Expression (Declaration_Node (Ent));
5007 -- A component has PI if it has no default expression and the
5008 -- component type has PI.
5011 if not Has_Preelaborable_Initialization (Etype (Ent)) then
5016 -- Require the default expression to be preelaborable
5018 elsif not Is_Preelaborable_Expression (Exp) then
5026 end Check_Components;
5028 -- Start of processing for Has_Preelaborable_Initialization
5031 -- Immediate return if already marked as known preelaborable init. This
5032 -- covers types for which this function has already been called once
5033 -- and returned True (in which case the result is cached), and also
5034 -- types to which a pragma Preelaborable_Initialization applies.
5036 if Known_To_Have_Preelab_Init (E) then
5040 -- If the type is a subtype representing a generic actual type, then
5041 -- test whether its base type has preelaborable initialization since
5042 -- the subtype representing the actual does not inherit this attribute
5043 -- from the actual or formal. (but maybe it should???)
5045 if Is_Generic_Actual_Type (E) then
5046 return Has_Preelaborable_Initialization (Base_Type (E));
5049 -- All elementary types have preelaborable initialization
5051 if Is_Elementary_Type (E) then
5054 -- Array types have PI if the component type has PI
5056 elsif Is_Array_Type (E) then
5057 Has_PE := Has_Preelaborable_Initialization (Component_Type (E));
5059 -- A derived type has preelaborable initialization if its parent type
5060 -- has preelaborable initialization and (in the case of a derived record
5061 -- extension) if the non-inherited components all have preelaborable
5062 -- initialization. However, a user-defined controlled type with an
5063 -- overriding Initialize procedure does not have preelaborable
5066 elsif Is_Derived_Type (E) then
5068 -- If the derived type is a private extension then it doesn't have
5069 -- preelaborable initialization.
5071 if Ekind (Base_Type (E)) = E_Record_Type_With_Private then
5075 -- First check whether ancestor type has preelaborable initialization
5077 Has_PE := Has_Preelaborable_Initialization (Etype (Base_Type (E)));
5079 -- If OK, check extension components (if any)
5081 if Has_PE and then Is_Record_Type (E) then
5082 Check_Components (First_Entity (E));
5085 -- Check specifically for 10.2.1(11.4/2) exception: a controlled type
5086 -- with a user defined Initialize procedure does not have PI.
5089 and then Is_Controlled (E)
5090 and then Has_Overriding_Initialize (E)
5095 -- Private types not derived from a type having preelaborable init and
5096 -- that are not marked with pragma Preelaborable_Initialization do not
5097 -- have preelaborable initialization.
5099 elsif Is_Private_Type (E) then
5102 -- Record type has PI if it is non private and all components have PI
5104 elsif Is_Record_Type (E) then
5106 Check_Components (First_Entity (E));
5108 -- Protected types must not have entries, and components must meet
5109 -- same set of rules as for record components.
5111 elsif Is_Protected_Type (E) then
5112 if Has_Entries (E) then
5116 Check_Components (First_Entity (E));
5117 Check_Components (First_Private_Entity (E));
5120 -- Type System.Address always has preelaborable initialization
5122 elsif Is_RTE (E, RE_Address) then
5125 -- In all other cases, type does not have preelaborable initialization
5131 -- If type has preelaborable initialization, cache result
5134 Set_Known_To_Have_Preelab_Init (E);
5138 end Has_Preelaborable_Initialization;
5140 ---------------------------
5141 -- Has_Private_Component --
5142 ---------------------------
5144 function Has_Private_Component (Type_Id : Entity_Id) return Boolean is
5145 Btype : Entity_Id := Base_Type (Type_Id);
5146 Component : Entity_Id;
5149 if Error_Posted (Type_Id)
5150 or else Error_Posted (Btype)
5155 if Is_Class_Wide_Type (Btype) then
5156 Btype := Root_Type (Btype);
5159 if Is_Private_Type (Btype) then
5161 UT : constant Entity_Id := Underlying_Type (Btype);
5164 if No (Full_View (Btype)) then
5165 return not Is_Generic_Type (Btype)
5166 and then not Is_Generic_Type (Root_Type (Btype));
5168 return not Is_Generic_Type (Root_Type (Full_View (Btype)));
5171 return not Is_Frozen (UT) and then Has_Private_Component (UT);
5175 elsif Is_Array_Type (Btype) then
5176 return Has_Private_Component (Component_Type (Btype));
5178 elsif Is_Record_Type (Btype) then
5179 Component := First_Component (Btype);
5180 while Present (Component) loop
5181 if Has_Private_Component (Etype (Component)) then
5185 Next_Component (Component);
5190 elsif Is_Protected_Type (Btype)
5191 and then Present (Corresponding_Record_Type (Btype))
5193 return Has_Private_Component (Corresponding_Record_Type (Btype));
5198 end Has_Private_Component;
5204 function Has_Stream (T : Entity_Id) return Boolean is
5211 elsif Is_RTE (Root_Type (T), RE_Root_Stream_Type) then
5214 elsif Is_Array_Type (T) then
5215 return Has_Stream (Component_Type (T));
5217 elsif Is_Record_Type (T) then
5218 E := First_Component (T);
5219 while Present (E) loop
5220 if Has_Stream (Etype (E)) then
5229 elsif Is_Private_Type (T) then
5230 return Has_Stream (Underlying_Type (T));
5241 function Has_Suffix (E : Entity_Id; Suffix : Character) return Boolean is
5243 Get_Name_String (Chars (E));
5244 return Name_Buffer (Name_Len) = Suffix;
5247 --------------------------
5248 -- Has_Tagged_Component --
5249 --------------------------
5251 function Has_Tagged_Component (Typ : Entity_Id) return Boolean is
5255 if Is_Private_Type (Typ)
5256 and then Present (Underlying_Type (Typ))
5258 return Has_Tagged_Component (Underlying_Type (Typ));
5260 elsif Is_Array_Type (Typ) then
5261 return Has_Tagged_Component (Component_Type (Typ));
5263 elsif Is_Tagged_Type (Typ) then
5266 elsif Is_Record_Type (Typ) then
5267 Comp := First_Component (Typ);
5268 while Present (Comp) loop
5269 if Has_Tagged_Component (Etype (Comp)) then
5273 Next_Component (Comp);
5281 end Has_Tagged_Component;
5283 -------------------------
5284 -- Implementation_Kind --
5285 -------------------------
5287 function Implementation_Kind (Subp : Entity_Id) return Name_Id is
5288 Impl_Prag : constant Node_Id := Get_Rep_Pragma (Subp, Name_Implemented);
5290 pragma Assert (Present (Impl_Prag));
5292 Chars (Expression (Last (Pragma_Argument_Associations (Impl_Prag))));
5293 end Implementation_Kind;
5295 --------------------------
5296 -- Implements_Interface --
5297 --------------------------
5299 function Implements_Interface
5300 (Typ_Ent : Entity_Id;
5301 Iface_Ent : Entity_Id;
5302 Exclude_Parents : Boolean := False) return Boolean
5304 Ifaces_List : Elist_Id;
5306 Iface : Entity_Id := Base_Type (Iface_Ent);
5307 Typ : Entity_Id := Base_Type (Typ_Ent);
5310 if Is_Class_Wide_Type (Typ) then
5311 Typ := Root_Type (Typ);
5314 if not Has_Interfaces (Typ) then
5318 if Is_Class_Wide_Type (Iface) then
5319 Iface := Root_Type (Iface);
5322 Collect_Interfaces (Typ, Ifaces_List);
5324 Elmt := First_Elmt (Ifaces_List);
5325 while Present (Elmt) loop
5326 if Is_Ancestor (Node (Elmt), Typ)
5327 and then Exclude_Parents
5331 elsif Node (Elmt) = Iface then
5339 end Implements_Interface;
5345 function In_Instance return Boolean is
5346 Curr_Unit : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
5352 and then S /= Standard_Standard
5354 if (Ekind (S) = E_Function
5355 or else Ekind (S) = E_Package
5356 or else Ekind (S) = E_Procedure)
5357 and then Is_Generic_Instance (S)
5359 -- A child instance is always compiled in the context of a parent
5360 -- instance. Nevertheless, the actuals are not analyzed in an
5361 -- instance context. We detect this case by examining the current
5362 -- compilation unit, which must be a child instance, and checking
5363 -- that it is not currently on the scope stack.
5365 if Is_Child_Unit (Curr_Unit)
5367 Nkind (Unit (Cunit (Current_Sem_Unit)))
5368 = N_Package_Instantiation
5369 and then not In_Open_Scopes (Curr_Unit)
5383 ----------------------
5384 -- In_Instance_Body --
5385 ----------------------
5387 function In_Instance_Body return Boolean is
5393 and then S /= Standard_Standard
5395 if (Ekind (S) = E_Function
5396 or else Ekind (S) = E_Procedure)
5397 and then Is_Generic_Instance (S)
5401 elsif Ekind (S) = E_Package
5402 and then In_Package_Body (S)
5403 and then Is_Generic_Instance (S)
5412 end In_Instance_Body;
5414 -----------------------------
5415 -- In_Instance_Not_Visible --
5416 -----------------------------
5418 function In_Instance_Not_Visible return Boolean is
5424 and then S /= Standard_Standard
5426 if (Ekind (S) = E_Function
5427 or else Ekind (S) = E_Procedure)
5428 and then Is_Generic_Instance (S)
5432 elsif Ekind (S) = E_Package
5433 and then (In_Package_Body (S) or else In_Private_Part (S))
5434 and then Is_Generic_Instance (S)
5443 end In_Instance_Not_Visible;
5445 ------------------------------
5446 -- In_Instance_Visible_Part --
5447 ------------------------------
5449 function In_Instance_Visible_Part return Boolean is
5455 and then S /= Standard_Standard
5457 if Ekind (S) = E_Package
5458 and then Is_Generic_Instance (S)
5459 and then not In_Package_Body (S)
5460 and then not In_Private_Part (S)
5469 end In_Instance_Visible_Part;
5471 ---------------------
5472 -- In_Package_Body --
5473 ---------------------
5475 function In_Package_Body return Boolean is
5481 and then S /= Standard_Standard
5483 if Ekind (S) = E_Package
5484 and then In_Package_Body (S)
5493 end In_Package_Body;
5495 --------------------------------
5496 -- In_Parameter_Specification --
5497 --------------------------------
5499 function In_Parameter_Specification (N : Node_Id) return Boolean is
5504 while Present (PN) loop
5505 if Nkind (PN) = N_Parameter_Specification then
5513 end In_Parameter_Specification;
5515 --------------------------------------
5516 -- In_Subprogram_Or_Concurrent_Unit --
5517 --------------------------------------
5519 function In_Subprogram_Or_Concurrent_Unit return Boolean is
5524 -- Use scope chain to check successively outer scopes
5530 if K in Subprogram_Kind
5531 or else K in Concurrent_Kind
5532 or else K in Generic_Subprogram_Kind
5536 elsif E = Standard_Standard then
5542 end In_Subprogram_Or_Concurrent_Unit;
5544 ---------------------
5545 -- In_Visible_Part --
5546 ---------------------
5548 function In_Visible_Part (Scope_Id : Entity_Id) return Boolean is
5551 Is_Package_Or_Generic_Package (Scope_Id)
5552 and then In_Open_Scopes (Scope_Id)
5553 and then not In_Package_Body (Scope_Id)
5554 and then not In_Private_Part (Scope_Id);
5555 end In_Visible_Part;
5557 ---------------------------------
5558 -- Insert_Explicit_Dereference --
5559 ---------------------------------
5561 procedure Insert_Explicit_Dereference (N : Node_Id) is
5562 New_Prefix : constant Node_Id := Relocate_Node (N);
5563 Ent : Entity_Id := Empty;
5570 Save_Interps (N, New_Prefix);
5573 Make_Explicit_Dereference (Sloc (Parent (N)),
5574 Prefix => New_Prefix));
5576 Set_Etype (N, Designated_Type (Etype (New_Prefix)));
5578 if Is_Overloaded (New_Prefix) then
5580 -- The dereference is also overloaded, and its interpretations are
5581 -- the designated types of the interpretations of the original node.
5583 Set_Etype (N, Any_Type);
5585 Get_First_Interp (New_Prefix, I, It);
5586 while Present (It.Nam) loop
5589 if Is_Access_Type (T) then
5590 Add_One_Interp (N, Designated_Type (T), Designated_Type (T));
5593 Get_Next_Interp (I, It);
5599 -- Prefix is unambiguous: mark the original prefix (which might
5600 -- Come_From_Source) as a reference, since the new (relocated) one
5601 -- won't be taken into account.
5603 if Is_Entity_Name (New_Prefix) then
5604 Ent := Entity (New_Prefix);
5607 -- For a retrieval of a subcomponent of some composite object,
5608 -- retrieve the ultimate entity if there is one.
5610 elsif Nkind (New_Prefix) = N_Selected_Component
5611 or else Nkind (New_Prefix) = N_Indexed_Component
5613 Pref := Prefix (New_Prefix);
5614 while Present (Pref)
5616 (Nkind (Pref) = N_Selected_Component
5617 or else Nkind (Pref) = N_Indexed_Component)
5619 Pref := Prefix (Pref);
5622 if Present (Pref) and then Is_Entity_Name (Pref) then
5623 Ent := Entity (Pref);
5627 -- Place the reference on the entity node
5629 if Present (Ent) then
5630 Generate_Reference (Ent, Pref);
5633 end Insert_Explicit_Dereference;
5635 ------------------------------------------
5636 -- Inspect_Deferred_Constant_Completion --
5637 ------------------------------------------
5639 procedure Inspect_Deferred_Constant_Completion (Decls : List_Id) is
5643 Decl := First (Decls);
5644 while Present (Decl) loop
5646 -- Deferred constant signature
5648 if Nkind (Decl) = N_Object_Declaration
5649 and then Constant_Present (Decl)
5650 and then No (Expression (Decl))
5652 -- No need to check internally generated constants
5654 and then Comes_From_Source (Decl)
5656 -- The constant is not completed. A full object declaration or a
5657 -- pragma Import complete a deferred constant.
5659 and then not Has_Completion (Defining_Identifier (Decl))
5662 ("constant declaration requires initialization expression",
5663 Defining_Identifier (Decl));
5666 Decl := Next (Decl);
5668 end Inspect_Deferred_Constant_Completion;
5674 function Is_AAMP_Float (E : Entity_Id) return Boolean is
5675 pragma Assert (Is_Type (E));
5677 return AAMP_On_Target
5678 and then Is_Floating_Point_Type (E)
5679 and then E = Base_Type (E);
5682 -----------------------------
5683 -- Is_Actual_Out_Parameter --
5684 -----------------------------
5686 function Is_Actual_Out_Parameter (N : Node_Id) return Boolean is
5690 Find_Actual (N, Formal, Call);
5691 return Present (Formal) and then Ekind (Formal) = E_Out_Parameter;
5692 end Is_Actual_Out_Parameter;
5694 -------------------------
5695 -- Is_Actual_Parameter --
5696 -------------------------
5698 function Is_Actual_Parameter (N : Node_Id) return Boolean is
5699 PK : constant Node_Kind := Nkind (Parent (N));
5703 when N_Parameter_Association =>
5704 return N = Explicit_Actual_Parameter (Parent (N));
5706 when N_Function_Call | N_Procedure_Call_Statement =>
5707 return Is_List_Member (N)
5709 List_Containing (N) = Parameter_Associations (Parent (N));
5714 end Is_Actual_Parameter;
5716 ---------------------
5717 -- Is_Aliased_View --
5718 ---------------------
5720 function Is_Aliased_View (Obj : Node_Id) return Boolean is
5724 if Is_Entity_Name (Obj) then
5732 or else (Present (Renamed_Object (E))
5733 and then Is_Aliased_View (Renamed_Object (E)))))
5735 or else ((Is_Formal (E)
5736 or else Ekind (E) = E_Generic_In_Out_Parameter
5737 or else Ekind (E) = E_Generic_In_Parameter)
5738 and then Is_Tagged_Type (Etype (E)))
5740 or else (Is_Concurrent_Type (E)
5741 and then In_Open_Scopes (E))
5743 -- Current instance of type, either directly or as rewritten
5744 -- reference to the current object.
5746 or else (Is_Entity_Name (Original_Node (Obj))
5747 and then Present (Entity (Original_Node (Obj)))
5748 and then Is_Type (Entity (Original_Node (Obj))))
5750 or else (Is_Type (E) and then E = Current_Scope)
5752 or else (Is_Incomplete_Or_Private_Type (E)
5753 and then Full_View (E) = Current_Scope);
5755 elsif Nkind (Obj) = N_Selected_Component then
5756 return Is_Aliased (Entity (Selector_Name (Obj)));
5758 elsif Nkind (Obj) = N_Indexed_Component then
5759 return Has_Aliased_Components (Etype (Prefix (Obj)))
5761 (Is_Access_Type (Etype (Prefix (Obj)))
5763 Has_Aliased_Components
5764 (Designated_Type (Etype (Prefix (Obj)))));
5766 elsif Nkind (Obj) = N_Unchecked_Type_Conversion
5767 or else Nkind (Obj) = N_Type_Conversion
5769 return Is_Tagged_Type (Etype (Obj))
5770 and then Is_Aliased_View (Expression (Obj));
5772 elsif Nkind (Obj) = N_Explicit_Dereference then
5773 return Nkind (Original_Node (Obj)) /= N_Function_Call;
5778 end Is_Aliased_View;
5780 -------------------------
5781 -- Is_Ancestor_Package --
5782 -------------------------
5784 function Is_Ancestor_Package
5786 E2 : Entity_Id) return Boolean
5793 and then Par /= Standard_Standard
5803 end Is_Ancestor_Package;
5805 ----------------------
5806 -- Is_Atomic_Object --
5807 ----------------------
5809 function Is_Atomic_Object (N : Node_Id) return Boolean is
5811 function Object_Has_Atomic_Components (N : Node_Id) return Boolean;
5812 -- Determines if given object has atomic components
5814 function Is_Atomic_Prefix (N : Node_Id) return Boolean;
5815 -- If prefix is an implicit dereference, examine designated type
5817 ----------------------
5818 -- Is_Atomic_Prefix --
5819 ----------------------
5821 function Is_Atomic_Prefix (N : Node_Id) return Boolean is
5823 if Is_Access_Type (Etype (N)) then
5825 Has_Atomic_Components (Designated_Type (Etype (N)));
5827 return Object_Has_Atomic_Components (N);
5829 end Is_Atomic_Prefix;
5831 ----------------------------------
5832 -- Object_Has_Atomic_Components --
5833 ----------------------------------
5835 function Object_Has_Atomic_Components (N : Node_Id) return Boolean is
5837 if Has_Atomic_Components (Etype (N))
5838 or else Is_Atomic (Etype (N))
5842 elsif Is_Entity_Name (N)
5843 and then (Has_Atomic_Components (Entity (N))
5844 or else Is_Atomic (Entity (N)))
5848 elsif Nkind (N) = N_Indexed_Component
5849 or else Nkind (N) = N_Selected_Component
5851 return Is_Atomic_Prefix (Prefix (N));
5856 end Object_Has_Atomic_Components;
5858 -- Start of processing for Is_Atomic_Object
5861 -- Predicate is not relevant to subprograms
5863 if Is_Entity_Name (N) and then Is_Overloadable (Entity (N)) then
5866 elsif Is_Atomic (Etype (N))
5867 or else (Is_Entity_Name (N) and then Is_Atomic (Entity (N)))
5871 elsif Nkind (N) = N_Indexed_Component
5872 or else Nkind (N) = N_Selected_Component
5874 return Is_Atomic_Prefix (Prefix (N));
5879 end Is_Atomic_Object;
5881 -------------------------
5882 -- Is_Coextension_Root --
5883 -------------------------
5885 function Is_Coextension_Root (N : Node_Id) return Boolean is
5888 Nkind (N) = N_Allocator
5889 and then Present (Coextensions (N))
5891 -- Anonymous access discriminants carry a list of all nested
5892 -- controlled coextensions.
5894 and then not Is_Dynamic_Coextension (N)
5895 and then not Is_Static_Coextension (N);
5896 end Is_Coextension_Root;
5898 -----------------------------
5899 -- Is_Concurrent_Interface --
5900 -----------------------------
5902 function Is_Concurrent_Interface (T : Entity_Id) return Boolean is
5907 (Is_Protected_Interface (T)
5908 or else Is_Synchronized_Interface (T)
5909 or else Is_Task_Interface (T));
5910 end Is_Concurrent_Interface;
5912 --------------------------------------
5913 -- Is_Controlling_Limited_Procedure --
5914 --------------------------------------
5916 function Is_Controlling_Limited_Procedure
5917 (Proc_Nam : Entity_Id) return Boolean
5919 Param_Typ : Entity_Id := Empty;
5922 if Ekind (Proc_Nam) = E_Procedure
5923 and then Present (Parameter_Specifications (Parent (Proc_Nam)))
5925 Param_Typ := Etype (Parameter_Type (First (
5926 Parameter_Specifications (Parent (Proc_Nam)))));
5928 -- In this case where an Itype was created, the procedure call has been
5931 elsif Present (Associated_Node_For_Itype (Proc_Nam))
5932 and then Present (Original_Node (Associated_Node_For_Itype (Proc_Nam)))
5934 Present (Parameter_Associations
5935 (Associated_Node_For_Itype (Proc_Nam)))
5938 Etype (First (Parameter_Associations
5939 (Associated_Node_For_Itype (Proc_Nam))));
5942 if Present (Param_Typ) then
5944 Is_Interface (Param_Typ)
5945 and then Is_Limited_Record (Param_Typ);
5949 end Is_Controlling_Limited_Procedure;
5951 -----------------------------
5952 -- Is_CPP_Constructor_Call --
5953 -----------------------------
5955 function Is_CPP_Constructor_Call (N : Node_Id) return Boolean is
5957 return Nkind (N) = N_Function_Call
5958 and then Is_CPP_Class (Etype (Etype (N)))
5959 and then Is_Constructor (Entity (Name (N)))
5960 and then Is_Imported (Entity (Name (N)));
5961 end Is_CPP_Constructor_Call;
5967 function Is_Delegate (T : Entity_Id) return Boolean is
5968 Desig_Type : Entity_Id;
5971 if VM_Target /= CLI_Target then
5975 -- Access-to-subprograms are delegates in CIL
5977 if Ekind (T) = E_Access_Subprogram_Type then
5981 if Ekind (T) not in Access_Kind then
5983 -- A delegate is a managed pointer. If no designated type is defined
5984 -- it means that it's not a delegate.
5989 Desig_Type := Etype (Directly_Designated_Type (T));
5991 if not Is_Tagged_Type (Desig_Type) then
5995 -- Test if the type is inherited from [mscorlib]System.Delegate
5997 while Etype (Desig_Type) /= Desig_Type loop
5998 if Chars (Scope (Desig_Type)) /= No_Name
5999 and then Is_Imported (Scope (Desig_Type))
6000 and then Get_Name_String (Chars (Scope (Desig_Type))) = "delegate"
6005 Desig_Type := Etype (Desig_Type);
6011 ----------------------------------------------
6012 -- Is_Dependent_Component_Of_Mutable_Object --
6013 ----------------------------------------------
6015 function Is_Dependent_Component_Of_Mutable_Object
6016 (Object : Node_Id) return Boolean
6019 Prefix_Type : Entity_Id;
6020 P_Aliased : Boolean := False;
6023 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean;
6024 -- Returns True if and only if Comp is declared within a variant part
6026 --------------------------------
6027 -- Is_Declared_Within_Variant --
6028 --------------------------------
6030 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean is
6031 Comp_Decl : constant Node_Id := Parent (Comp);
6032 Comp_List : constant Node_Id := Parent (Comp_Decl);
6034 return Nkind (Parent (Comp_List)) = N_Variant;
6035 end Is_Declared_Within_Variant;
6037 -- Start of processing for Is_Dependent_Component_Of_Mutable_Object
6040 if Is_Variable (Object) then
6042 if Nkind (Object) = N_Selected_Component then
6043 P := Prefix (Object);
6044 Prefix_Type := Etype (P);
6046 if Is_Entity_Name (P) then
6048 if Ekind (Entity (P)) = E_Generic_In_Out_Parameter then
6049 Prefix_Type := Base_Type (Prefix_Type);
6052 if Is_Aliased (Entity (P)) then
6056 -- A discriminant check on a selected component may be expanded
6057 -- into a dereference when removing side-effects. Recover the
6058 -- original node and its type, which may be unconstrained.
6060 elsif Nkind (P) = N_Explicit_Dereference
6061 and then not (Comes_From_Source (P))
6063 P := Original_Node (P);
6064 Prefix_Type := Etype (P);
6067 -- Check for prefix being an aliased component???
6073 -- A heap object is constrained by its initial value
6075 -- Ada 2005 (AI-363): Always assume the object could be mutable in
6076 -- the dereferenced case, since the access value might denote an
6077 -- unconstrained aliased object, whereas in Ada 95 the designated
6078 -- object is guaranteed to be constrained. A worst-case assumption
6079 -- has to apply in Ada 2005 because we can't tell at compile time
6080 -- whether the object is "constrained by its initial value"
6081 -- (despite the fact that 3.10.2(26/2) and 8.5.1(5/2) are
6082 -- semantic rules -- these rules are acknowledged to need fixing).
6084 if Ada_Version < Ada_2005 then
6085 if Is_Access_Type (Prefix_Type)
6086 or else Nkind (P) = N_Explicit_Dereference
6091 elsif Ada_Version >= Ada_2005 then
6092 if Is_Access_Type (Prefix_Type) then
6094 -- If the access type is pool-specific, and there is no
6095 -- constrained partial view of the designated type, then the
6096 -- designated object is known to be constrained.
6098 if Ekind (Prefix_Type) = E_Access_Type
6099 and then not Has_Constrained_Partial_View
6100 (Designated_Type (Prefix_Type))
6104 -- Otherwise (general access type, or there is a constrained
6105 -- partial view of the designated type), we need to check
6106 -- based on the designated type.
6109 Prefix_Type := Designated_Type (Prefix_Type);
6115 Original_Record_Component (Entity (Selector_Name (Object)));
6117 -- As per AI-0017, the renaming is illegal in a generic body, even
6118 -- if the subtype is indefinite.
6120 -- Ada 2005 (AI-363): In Ada 2005 an aliased object can be mutable
6122 if not Is_Constrained (Prefix_Type)
6123 and then (not Is_Indefinite_Subtype (Prefix_Type)
6125 (Is_Generic_Type (Prefix_Type)
6126 and then Ekind (Current_Scope) = E_Generic_Package
6127 and then In_Package_Body (Current_Scope)))
6129 and then (Is_Declared_Within_Variant (Comp)
6130 or else Has_Discriminant_Dependent_Constraint (Comp))
6131 and then (not P_Aliased or else Ada_Version >= Ada_2005)
6137 Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
6141 elsif Nkind (Object) = N_Indexed_Component
6142 or else Nkind (Object) = N_Slice
6144 return Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
6146 -- A type conversion that Is_Variable is a view conversion:
6147 -- go back to the denoted object.
6149 elsif Nkind (Object) = N_Type_Conversion then
6151 Is_Dependent_Component_Of_Mutable_Object (Expression (Object));
6156 end Is_Dependent_Component_Of_Mutable_Object;
6158 ---------------------
6159 -- Is_Dereferenced --
6160 ---------------------
6162 function Is_Dereferenced (N : Node_Id) return Boolean is
6163 P : constant Node_Id := Parent (N);
6166 (Nkind (P) = N_Selected_Component
6168 Nkind (P) = N_Explicit_Dereference
6170 Nkind (P) = N_Indexed_Component
6172 Nkind (P) = N_Slice)
6173 and then Prefix (P) = N;
6174 end Is_Dereferenced;
6176 ----------------------
6177 -- Is_Descendent_Of --
6178 ----------------------
6180 function Is_Descendent_Of (T1 : Entity_Id; T2 : Entity_Id) return Boolean is
6185 pragma Assert (Nkind (T1) in N_Entity);
6186 pragma Assert (Nkind (T2) in N_Entity);
6188 T := Base_Type (T1);
6190 -- Immediate return if the types match
6195 -- Comment needed here ???
6197 elsif Ekind (T) = E_Class_Wide_Type then
6198 return Etype (T) = T2;
6206 -- Done if we found the type we are looking for
6211 -- Done if no more derivations to check
6218 -- Following test catches error cases resulting from prev errors
6220 elsif No (Etyp) then
6223 elsif Is_Private_Type (T) and then Etyp = Full_View (T) then
6226 elsif Is_Private_Type (Etyp) and then Full_View (Etyp) = T then
6230 T := Base_Type (Etyp);
6233 end Is_Descendent_Of;
6239 function Is_False (U : Uint) return Boolean is
6244 ---------------------------
6245 -- Is_Fixed_Model_Number --
6246 ---------------------------
6248 function Is_Fixed_Model_Number (U : Ureal; T : Entity_Id) return Boolean is
6249 S : constant Ureal := Small_Value (T);
6250 M : Urealp.Save_Mark;
6254 R := (U = UR_Trunc (U / S) * S);
6257 end Is_Fixed_Model_Number;
6259 -------------------------------
6260 -- Is_Fully_Initialized_Type --
6261 -------------------------------
6263 function Is_Fully_Initialized_Type (Typ : Entity_Id) return Boolean is
6265 if Is_Scalar_Type (Typ) then
6268 elsif Is_Access_Type (Typ) then
6271 elsif Is_Array_Type (Typ) then
6272 if Is_Fully_Initialized_Type (Component_Type (Typ)) then
6276 -- An interesting case, if we have a constrained type one of whose
6277 -- bounds is known to be null, then there are no elements to be
6278 -- initialized, so all the elements are initialized!
6280 if Is_Constrained (Typ) then
6283 Indx_Typ : Entity_Id;
6287 Indx := First_Index (Typ);
6288 while Present (Indx) loop
6289 if Etype (Indx) = Any_Type then
6292 -- If index is a range, use directly
6294 elsif Nkind (Indx) = N_Range then
6295 Lbd := Low_Bound (Indx);
6296 Hbd := High_Bound (Indx);
6299 Indx_Typ := Etype (Indx);
6301 if Is_Private_Type (Indx_Typ) then
6302 Indx_Typ := Full_View (Indx_Typ);
6305 if No (Indx_Typ) or else Etype (Indx_Typ) = Any_Type then
6308 Lbd := Type_Low_Bound (Indx_Typ);
6309 Hbd := Type_High_Bound (Indx_Typ);
6313 if Compile_Time_Known_Value (Lbd)
6314 and then Compile_Time_Known_Value (Hbd)
6316 if Expr_Value (Hbd) < Expr_Value (Lbd) then
6326 -- If no null indexes, then type is not fully initialized
6332 elsif Is_Record_Type (Typ) then
6333 if Has_Discriminants (Typ)
6335 Present (Discriminant_Default_Value (First_Discriminant (Typ)))
6336 and then Is_Fully_Initialized_Variant (Typ)
6341 -- Controlled records are considered to be fully initialized if
6342 -- there is a user defined Initialize routine. This may not be
6343 -- entirely correct, but as the spec notes, we are guessing here
6344 -- what is best from the point of view of issuing warnings.
6346 if Is_Controlled (Typ) then
6348 Utyp : constant Entity_Id := Underlying_Type (Typ);
6351 if Present (Utyp) then
6353 Init : constant Entity_Id :=
6355 (Underlying_Type (Typ), Name_Initialize));
6359 and then Comes_From_Source (Init)
6361 Is_Predefined_File_Name
6362 (File_Name (Get_Source_File_Index (Sloc (Init))))
6366 elsif Has_Null_Extension (Typ)
6368 Is_Fully_Initialized_Type
6369 (Etype (Base_Type (Typ)))
6378 -- Otherwise see if all record components are initialized
6384 Ent := First_Entity (Typ);
6385 while Present (Ent) loop
6386 if Chars (Ent) = Name_uController then
6389 elsif Ekind (Ent) = E_Component
6390 and then (No (Parent (Ent))
6391 or else No (Expression (Parent (Ent))))
6392 and then not Is_Fully_Initialized_Type (Etype (Ent))
6394 -- Special VM case for tag components, which need to be
6395 -- defined in this case, but are never initialized as VMs
6396 -- are using other dispatching mechanisms. Ignore this
6397 -- uninitialized case. Note that this applies both to the
6398 -- uTag entry and the main vtable pointer (CPP_Class case).
6400 and then (Tagged_Type_Expansion or else not Is_Tag (Ent))
6409 -- No uninitialized components, so type is fully initialized.
6410 -- Note that this catches the case of no components as well.
6414 elsif Is_Concurrent_Type (Typ) then
6417 elsif Is_Private_Type (Typ) then
6419 U : constant Entity_Id := Underlying_Type (Typ);
6425 return Is_Fully_Initialized_Type (U);
6432 end Is_Fully_Initialized_Type;
6434 ----------------------------------
6435 -- Is_Fully_Initialized_Variant --
6436 ----------------------------------
6438 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean is
6439 Loc : constant Source_Ptr := Sloc (Typ);
6440 Constraints : constant List_Id := New_List;
6441 Components : constant Elist_Id := New_Elmt_List;
6442 Comp_Elmt : Elmt_Id;
6444 Comp_List : Node_Id;
6446 Discr_Val : Node_Id;
6448 Report_Errors : Boolean;
6449 pragma Warnings (Off, Report_Errors);
6452 if Serious_Errors_Detected > 0 then
6456 if Is_Record_Type (Typ)
6457 and then Nkind (Parent (Typ)) = N_Full_Type_Declaration
6458 and then Nkind (Type_Definition (Parent (Typ))) = N_Record_Definition
6460 Comp_List := Component_List (Type_Definition (Parent (Typ)));
6462 Discr := First_Discriminant (Typ);
6463 while Present (Discr) loop
6464 if Nkind (Parent (Discr)) = N_Discriminant_Specification then
6465 Discr_Val := Expression (Parent (Discr));
6467 if Present (Discr_Val)
6468 and then Is_OK_Static_Expression (Discr_Val)
6470 Append_To (Constraints,
6471 Make_Component_Association (Loc,
6472 Choices => New_List (New_Occurrence_Of (Discr, Loc)),
6473 Expression => New_Copy (Discr_Val)));
6481 Next_Discriminant (Discr);
6486 Comp_List => Comp_List,
6487 Governed_By => Constraints,
6489 Report_Errors => Report_Errors);
6491 -- Check that each component present is fully initialized
6493 Comp_Elmt := First_Elmt (Components);
6494 while Present (Comp_Elmt) loop
6495 Comp_Id := Node (Comp_Elmt);
6497 if Ekind (Comp_Id) = E_Component
6498 and then (No (Parent (Comp_Id))
6499 or else No (Expression (Parent (Comp_Id))))
6500 and then not Is_Fully_Initialized_Type (Etype (Comp_Id))
6505 Next_Elmt (Comp_Elmt);
6510 elsif Is_Private_Type (Typ) then
6512 U : constant Entity_Id := Underlying_Type (Typ);
6518 return Is_Fully_Initialized_Variant (U);
6524 end Is_Fully_Initialized_Variant;
6530 -- We seem to have a lot of overlapping functions that do similar things
6531 -- (testing for left hand sides or lvalues???). Anyway, since this one is
6532 -- purely syntactic, it should be in Sem_Aux I would think???
6534 function Is_LHS (N : Node_Id) return Boolean is
6535 P : constant Node_Id := Parent (N);
6537 return Nkind (P) = N_Assignment_Statement
6538 and then Name (P) = N;
6541 ----------------------------
6542 -- Is_Inherited_Operation --
6543 ----------------------------
6545 function Is_Inherited_Operation (E : Entity_Id) return Boolean is
6546 Kind : constant Node_Kind := Nkind (Parent (E));
6548 pragma Assert (Is_Overloadable (E));
6549 return Kind = N_Full_Type_Declaration
6550 or else Kind = N_Private_Extension_Declaration
6551 or else Kind = N_Subtype_Declaration
6552 or else (Ekind (E) = E_Enumeration_Literal
6553 and then Is_Derived_Type (Etype (E)));
6554 end Is_Inherited_Operation;
6556 -----------------------------
6557 -- Is_Library_Level_Entity --
6558 -----------------------------
6560 function Is_Library_Level_Entity (E : Entity_Id) return Boolean is
6562 -- The following is a small optimization, and it also properly handles
6563 -- discriminals, which in task bodies might appear in expressions before
6564 -- the corresponding procedure has been created, and which therefore do
6565 -- not have an assigned scope.
6567 if Is_Formal (E) then
6571 -- Normal test is simply that the enclosing dynamic scope is Standard
6573 return Enclosing_Dynamic_Scope (E) = Standard_Standard;
6574 end Is_Library_Level_Entity;
6576 ---------------------------------
6577 -- Is_Local_Variable_Reference --
6578 ---------------------------------
6580 function Is_Local_Variable_Reference (Expr : Node_Id) return Boolean is
6582 if not Is_Entity_Name (Expr) then
6587 Ent : constant Entity_Id := Entity (Expr);
6588 Sub : constant Entity_Id := Enclosing_Subprogram (Ent);
6590 if not Ekind_In (Ent, E_Variable, E_In_Out_Parameter) then
6593 return Present (Sub) and then Sub = Current_Subprogram;
6597 end Is_Local_Variable_Reference;
6599 -------------------------
6600 -- Is_Object_Reference --
6601 -------------------------
6603 function Is_Object_Reference (N : Node_Id) return Boolean is
6605 if Is_Entity_Name (N) then
6606 return Present (Entity (N)) and then Is_Object (Entity (N));
6610 when N_Indexed_Component | N_Slice =>
6612 Is_Object_Reference (Prefix (N))
6613 or else Is_Access_Type (Etype (Prefix (N)));
6615 -- In Ada95, a function call is a constant object; a procedure
6618 when N_Function_Call =>
6619 return Etype (N) /= Standard_Void_Type;
6621 -- A reference to the stream attribute Input is a function call
6623 when N_Attribute_Reference =>
6624 return Attribute_Name (N) = Name_Input;
6626 when N_Selected_Component =>
6628 Is_Object_Reference (Selector_Name (N))
6630 (Is_Object_Reference (Prefix (N))
6631 or else Is_Access_Type (Etype (Prefix (N))));
6633 when N_Explicit_Dereference =>
6636 -- A view conversion of a tagged object is an object reference
6638 when N_Type_Conversion =>
6639 return Is_Tagged_Type (Etype (Subtype_Mark (N)))
6640 and then Is_Tagged_Type (Etype (Expression (N)))
6641 and then Is_Object_Reference (Expression (N));
6643 -- An unchecked type conversion is considered to be an object if
6644 -- the operand is an object (this construction arises only as a
6645 -- result of expansion activities).
6647 when N_Unchecked_Type_Conversion =>
6654 end Is_Object_Reference;
6656 -----------------------------------
6657 -- Is_OK_Variable_For_Out_Formal --
6658 -----------------------------------
6660 function Is_OK_Variable_For_Out_Formal (AV : Node_Id) return Boolean is
6662 Note_Possible_Modification (AV, Sure => True);
6664 -- We must reject parenthesized variable names. The check for
6665 -- Comes_From_Source is present because there are currently
6666 -- cases where the compiler violates this rule (e.g. passing
6667 -- a task object to its controlled Initialize routine).
6669 if Paren_Count (AV) > 0 and then Comes_From_Source (AV) then
6672 -- A variable is always allowed
6674 elsif Is_Variable (AV) then
6677 -- Unchecked conversions are allowed only if they come from the
6678 -- generated code, which sometimes uses unchecked conversions for out
6679 -- parameters in cases where code generation is unaffected. We tell
6680 -- source unchecked conversions by seeing if they are rewrites of an
6681 -- original Unchecked_Conversion function call, or of an explicit
6682 -- conversion of a function call.
6684 elsif Nkind (AV) = N_Unchecked_Type_Conversion then
6685 if Nkind (Original_Node (AV)) = N_Function_Call then
6688 elsif Comes_From_Source (AV)
6689 and then Nkind (Original_Node (Expression (AV))) = N_Function_Call
6693 elsif Nkind (Original_Node (AV)) = N_Type_Conversion then
6694 return Is_OK_Variable_For_Out_Formal (Expression (AV));
6700 -- Normal type conversions are allowed if argument is a variable
6702 elsif Nkind (AV) = N_Type_Conversion then
6703 if Is_Variable (Expression (AV))
6704 and then Paren_Count (Expression (AV)) = 0
6706 Note_Possible_Modification (Expression (AV), Sure => True);
6709 -- We also allow a non-parenthesized expression that raises
6710 -- constraint error if it rewrites what used to be a variable
6712 elsif Raises_Constraint_Error (Expression (AV))
6713 and then Paren_Count (Expression (AV)) = 0
6714 and then Is_Variable (Original_Node (Expression (AV)))
6718 -- Type conversion of something other than a variable
6724 -- If this node is rewritten, then test the original form, if that is
6725 -- OK, then we consider the rewritten node OK (for example, if the
6726 -- original node is a conversion, then Is_Variable will not be true
6727 -- but we still want to allow the conversion if it converts a variable).
6729 elsif Original_Node (AV) /= AV then
6730 return Is_OK_Variable_For_Out_Formal (Original_Node (AV));
6732 -- All other non-variables are rejected
6737 end Is_OK_Variable_For_Out_Formal;
6739 -----------------------------------
6740 -- Is_Partially_Initialized_Type --
6741 -----------------------------------
6743 function Is_Partially_Initialized_Type (Typ : Entity_Id) return Boolean is
6745 if Is_Scalar_Type (Typ) then
6748 elsif Is_Access_Type (Typ) then
6751 elsif Is_Array_Type (Typ) then
6753 -- If component type is partially initialized, so is array type
6755 if Is_Partially_Initialized_Type (Component_Type (Typ)) then
6758 -- Otherwise we are only partially initialized if we are fully
6759 -- initialized (this is the empty array case, no point in us
6760 -- duplicating that code here).
6763 return Is_Fully_Initialized_Type (Typ);
6766 elsif Is_Record_Type (Typ) then
6768 -- A discriminated type is always partially initialized
6770 if Has_Discriminants (Typ) then
6773 -- A tagged type is always partially initialized
6775 elsif Is_Tagged_Type (Typ) then
6778 -- Case of non-discriminated record
6784 Component_Present : Boolean := False;
6785 -- Set True if at least one component is present. If no
6786 -- components are present, then record type is fully
6787 -- initialized (another odd case, like the null array).
6790 -- Loop through components
6792 Ent := First_Entity (Typ);
6793 while Present (Ent) loop
6794 if Ekind (Ent) = E_Component then
6795 Component_Present := True;
6797 -- If a component has an initialization expression then
6798 -- the enclosing record type is partially initialized
6800 if Present (Parent (Ent))
6801 and then Present (Expression (Parent (Ent)))
6805 -- If a component is of a type which is itself partially
6806 -- initialized, then the enclosing record type is also.
6808 elsif Is_Partially_Initialized_Type (Etype (Ent)) then
6816 -- No initialized components found. If we found any components
6817 -- they were all uninitialized so the result is false.
6819 if Component_Present then
6822 -- But if we found no components, then all the components are
6823 -- initialized so we consider the type to be initialized.
6831 -- Concurrent types are always fully initialized
6833 elsif Is_Concurrent_Type (Typ) then
6836 -- For a private type, go to underlying type. If there is no underlying
6837 -- type then just assume this partially initialized. Not clear if this
6838 -- can happen in a non-error case, but no harm in testing for this.
6840 elsif Is_Private_Type (Typ) then
6842 U : constant Entity_Id := Underlying_Type (Typ);
6847 return Is_Partially_Initialized_Type (U);
6851 -- For any other type (are there any?) assume partially initialized
6856 end Is_Partially_Initialized_Type;
6858 ------------------------------------
6859 -- Is_Potentially_Persistent_Type --
6860 ------------------------------------
6862 function Is_Potentially_Persistent_Type (T : Entity_Id) return Boolean is
6867 -- For private type, test corresponding full type
6869 if Is_Private_Type (T) then
6870 return Is_Potentially_Persistent_Type (Full_View (T));
6872 -- Scalar types are potentially persistent
6874 elsif Is_Scalar_Type (T) then
6877 -- Record type is potentially persistent if not tagged and the types of
6878 -- all it components are potentially persistent, and no component has
6879 -- an initialization expression.
6881 elsif Is_Record_Type (T)
6882 and then not Is_Tagged_Type (T)
6883 and then not Is_Partially_Initialized_Type (T)
6885 Comp := First_Component (T);
6886 while Present (Comp) loop
6887 if not Is_Potentially_Persistent_Type (Etype (Comp)) then
6896 -- Array type is potentially persistent if its component type is
6897 -- potentially persistent and if all its constraints are static.
6899 elsif Is_Array_Type (T) then
6900 if not Is_Potentially_Persistent_Type (Component_Type (T)) then
6904 Indx := First_Index (T);
6905 while Present (Indx) loop
6906 if not Is_OK_Static_Subtype (Etype (Indx)) then
6915 -- All other types are not potentially persistent
6920 end Is_Potentially_Persistent_Type;
6922 ---------------------------------
6923 -- Is_Protected_Self_Reference --
6924 ---------------------------------
6926 function Is_Protected_Self_Reference (N : Node_Id) return Boolean is
6928 function In_Access_Definition (N : Node_Id) return Boolean;
6929 -- Returns true if N belongs to an access definition
6931 --------------------------
6932 -- In_Access_Definition --
6933 --------------------------
6935 function In_Access_Definition (N : Node_Id) return Boolean is
6940 while Present (P) loop
6941 if Nkind (P) = N_Access_Definition then
6949 end In_Access_Definition;
6951 -- Start of processing for Is_Protected_Self_Reference
6954 -- Verify that prefix is analyzed and has the proper form. Note that
6955 -- the attributes Elab_Spec, Elab_Body, and UET_Address, which also
6956 -- produce the address of an entity, do not analyze their prefix
6957 -- because they denote entities that are not necessarily visible.
6958 -- Neither of them can apply to a protected type.
6960 return Ada_Version >= Ada_2005
6961 and then Is_Entity_Name (N)
6962 and then Present (Entity (N))
6963 and then Is_Protected_Type (Entity (N))
6964 and then In_Open_Scopes (Entity (N))
6965 and then not In_Access_Definition (N);
6966 end Is_Protected_Self_Reference;
6968 -----------------------------
6969 -- Is_RCI_Pkg_Spec_Or_Body --
6970 -----------------------------
6972 function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
6974 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
6975 -- Return True if the unit of Cunit is an RCI package declaration
6977 ---------------------------
6978 -- Is_RCI_Pkg_Decl_Cunit --
6979 ---------------------------
6981 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean is
6982 The_Unit : constant Node_Id := Unit (Cunit);
6985 if Nkind (The_Unit) /= N_Package_Declaration then
6989 return Is_Remote_Call_Interface (Defining_Entity (The_Unit));
6990 end Is_RCI_Pkg_Decl_Cunit;
6992 -- Start of processing for Is_RCI_Pkg_Spec_Or_Body
6995 return Is_RCI_Pkg_Decl_Cunit (Cunit)
6997 (Nkind (Unit (Cunit)) = N_Package_Body
6998 and then Is_RCI_Pkg_Decl_Cunit (Library_Unit (Cunit)));
6999 end Is_RCI_Pkg_Spec_Or_Body;
7001 -----------------------------------------
7002 -- Is_Remote_Access_To_Class_Wide_Type --
7003 -----------------------------------------
7005 function Is_Remote_Access_To_Class_Wide_Type
7006 (E : Entity_Id) return Boolean
7009 -- A remote access to class-wide type is a general access to object type
7010 -- declared in the visible part of a Remote_Types or Remote_Call_
7013 return Ekind (E) = E_General_Access_Type
7014 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
7015 end Is_Remote_Access_To_Class_Wide_Type;
7017 -----------------------------------------
7018 -- Is_Remote_Access_To_Subprogram_Type --
7019 -----------------------------------------
7021 function Is_Remote_Access_To_Subprogram_Type
7022 (E : Entity_Id) return Boolean
7025 return (Ekind (E) = E_Access_Subprogram_Type
7026 or else (Ekind (E) = E_Record_Type
7027 and then Present (Corresponding_Remote_Type (E))))
7028 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
7029 end Is_Remote_Access_To_Subprogram_Type;
7031 --------------------
7032 -- Is_Remote_Call --
7033 --------------------
7035 function Is_Remote_Call (N : Node_Id) return Boolean is
7037 if Nkind (N) /= N_Procedure_Call_Statement
7038 and then Nkind (N) /= N_Function_Call
7040 -- An entry call cannot be remote
7044 elsif Nkind (Name (N)) in N_Has_Entity
7045 and then Is_Remote_Call_Interface (Entity (Name (N)))
7047 -- A subprogram declared in the spec of a RCI package is remote
7051 elsif Nkind (Name (N)) = N_Explicit_Dereference
7052 and then Is_Remote_Access_To_Subprogram_Type
7053 (Etype (Prefix (Name (N))))
7055 -- The dereference of a RAS is a remote call
7059 elsif Present (Controlling_Argument (N))
7060 and then Is_Remote_Access_To_Class_Wide_Type
7061 (Etype (Controlling_Argument (N)))
7063 -- Any primitive operation call with a controlling argument of
7064 -- a RACW type is a remote call.
7069 -- All other calls are local calls
7074 ----------------------
7075 -- Is_Renamed_Entry --
7076 ----------------------
7078 function Is_Renamed_Entry (Proc_Nam : Entity_Id) return Boolean is
7079 Orig_Node : Node_Id := Empty;
7080 Subp_Decl : Node_Id := Parent (Parent (Proc_Nam));
7082 function Is_Entry (Nam : Node_Id) return Boolean;
7083 -- Determine whether Nam is an entry. Traverse selectors if there are
7084 -- nested selected components.
7090 function Is_Entry (Nam : Node_Id) return Boolean is
7092 if Nkind (Nam) = N_Selected_Component then
7093 return Is_Entry (Selector_Name (Nam));
7096 return Ekind (Entity (Nam)) = E_Entry;
7099 -- Start of processing for Is_Renamed_Entry
7102 if Present (Alias (Proc_Nam)) then
7103 Subp_Decl := Parent (Parent (Alias (Proc_Nam)));
7106 -- Look for a rewritten subprogram renaming declaration
7108 if Nkind (Subp_Decl) = N_Subprogram_Declaration
7109 and then Present (Original_Node (Subp_Decl))
7111 Orig_Node := Original_Node (Subp_Decl);
7114 -- The rewritten subprogram is actually an entry
7116 if Present (Orig_Node)
7117 and then Nkind (Orig_Node) = N_Subprogram_Renaming_Declaration
7118 and then Is_Entry (Name (Orig_Node))
7124 end Is_Renamed_Entry;
7126 ----------------------
7127 -- Is_Selector_Name --
7128 ----------------------
7130 function Is_Selector_Name (N : Node_Id) return Boolean is
7132 if not Is_List_Member (N) then
7134 P : constant Node_Id := Parent (N);
7135 K : constant Node_Kind := Nkind (P);
7138 (K = N_Expanded_Name or else
7139 K = N_Generic_Association or else
7140 K = N_Parameter_Association or else
7141 K = N_Selected_Component)
7142 and then Selector_Name (P) = N;
7147 L : constant List_Id := List_Containing (N);
7148 P : constant Node_Id := Parent (L);
7150 return (Nkind (P) = N_Discriminant_Association
7151 and then Selector_Names (P) = L)
7153 (Nkind (P) = N_Component_Association
7154 and then Choices (P) = L);
7157 end Is_Selector_Name;
7163 function Is_Statement (N : Node_Id) return Boolean is
7166 Nkind (N) in N_Statement_Other_Than_Procedure_Call
7167 or else Nkind (N) = N_Procedure_Call_Statement;
7170 ---------------------------------
7171 -- Is_Synchronized_Tagged_Type --
7172 ---------------------------------
7174 function Is_Synchronized_Tagged_Type (E : Entity_Id) return Boolean is
7175 Kind : constant Entity_Kind := Ekind (Base_Type (E));
7178 -- A task or protected type derived from an interface is a tagged type.
7179 -- Such a tagged type is called a synchronized tagged type, as are
7180 -- synchronized interfaces and private extensions whose declaration
7181 -- includes the reserved word synchronized.
7183 return (Is_Tagged_Type (E)
7184 and then (Kind = E_Task_Type
7185 or else Kind = E_Protected_Type))
7188 and then Is_Synchronized_Interface (E))
7190 (Ekind (E) = E_Record_Type_With_Private
7191 and then (Synchronized_Present (Parent (E))
7192 or else Is_Synchronized_Interface (Etype (E))));
7193 end Is_Synchronized_Tagged_Type;
7199 function Is_Transfer (N : Node_Id) return Boolean is
7200 Kind : constant Node_Kind := Nkind (N);
7203 if Kind = N_Simple_Return_Statement
7205 Kind = N_Extended_Return_Statement
7207 Kind = N_Goto_Statement
7209 Kind = N_Raise_Statement
7211 Kind = N_Requeue_Statement
7215 elsif (Kind = N_Exit_Statement or else Kind in N_Raise_xxx_Error)
7216 and then No (Condition (N))
7220 elsif Kind = N_Procedure_Call_Statement
7221 and then Is_Entity_Name (Name (N))
7222 and then Present (Entity (Name (N)))
7223 and then No_Return (Entity (Name (N)))
7227 elsif Nkind (Original_Node (N)) = N_Raise_Statement then
7239 function Is_True (U : Uint) return Boolean is
7244 -------------------------------
7245 -- Is_Universal_Numeric_Type --
7246 -------------------------------
7248 function Is_Universal_Numeric_Type (T : Entity_Id) return Boolean is
7250 return T = Universal_Integer or else T = Universal_Real;
7251 end Is_Universal_Numeric_Type;
7257 function Is_Value_Type (T : Entity_Id) return Boolean is
7259 return VM_Target = CLI_Target
7260 and then Nkind (T) in N_Has_Chars
7261 and then Chars (T) /= No_Name
7262 and then Get_Name_String (Chars (T)) = "valuetype";
7265 ---------------------
7266 -- Is_VMS_Operator --
7267 ---------------------
7269 function Is_VMS_Operator (Op : Entity_Id) return Boolean is
7271 -- The VMS operators are declared in a child of System that is loaded
7272 -- through pragma Extend_System. In some rare cases a program is run
7273 -- with this extension but without indicating that the target is VMS.
7275 return Ekind (Op) = E_Function
7276 and then Is_Intrinsic_Subprogram (Op)
7278 ((Present_System_Aux
7279 and then Scope (Op) = System_Aux_Id)
7282 and then Scope (Scope (Op)) = RTU_Entity (System)));
7283 end Is_VMS_Operator;
7289 function Is_Variable (N : Node_Id) return Boolean is
7291 Orig_Node : constant Node_Id := Original_Node (N);
7292 -- We do the test on the original node, since this is basically a test
7293 -- of syntactic categories, so it must not be disturbed by whatever
7294 -- rewriting might have occurred. For example, an aggregate, which is
7295 -- certainly NOT a variable, could be turned into a variable by
7298 function In_Protected_Function (E : Entity_Id) return Boolean;
7299 -- Within a protected function, the private components of the enclosing
7300 -- protected type are constants. A function nested within a (protected)
7301 -- procedure is not itself protected.
7303 function Is_Variable_Prefix (P : Node_Id) return Boolean;
7304 -- Prefixes can involve implicit dereferences, in which case we must
7305 -- test for the case of a reference of a constant access type, which can
7306 -- can never be a variable.
7308 ---------------------------
7309 -- In_Protected_Function --
7310 ---------------------------
7312 function In_Protected_Function (E : Entity_Id) return Boolean is
7313 Prot : constant Entity_Id := Scope (E);
7317 if not Is_Protected_Type (Prot) then
7321 while Present (S) and then S /= Prot loop
7322 if Ekind (S) = E_Function and then Scope (S) = Prot then
7331 end In_Protected_Function;
7333 ------------------------
7334 -- Is_Variable_Prefix --
7335 ------------------------
7337 function Is_Variable_Prefix (P : Node_Id) return Boolean is
7339 if Is_Access_Type (Etype (P)) then
7340 return not Is_Access_Constant (Root_Type (Etype (P)));
7342 -- For the case of an indexed component whose prefix has a packed
7343 -- array type, the prefix has been rewritten into a type conversion.
7344 -- Determine variable-ness from the converted expression.
7346 elsif Nkind (P) = N_Type_Conversion
7347 and then not Comes_From_Source (P)
7348 and then Is_Array_Type (Etype (P))
7349 and then Is_Packed (Etype (P))
7351 return Is_Variable (Expression (P));
7354 return Is_Variable (P);
7356 end Is_Variable_Prefix;
7358 -- Start of processing for Is_Variable
7361 -- Definitely OK if Assignment_OK is set. Since this is something that
7362 -- only gets set for expanded nodes, the test is on N, not Orig_Node.
7364 if Nkind (N) in N_Subexpr and then Assignment_OK (N) then
7367 -- Normally we go to the original node, but there is one exception where
7368 -- we use the rewritten node, namely when it is an explicit dereference.
7369 -- The generated code may rewrite a prefix which is an access type with
7370 -- an explicit dereference. The dereference is a variable, even though
7371 -- the original node may not be (since it could be a constant of the
7374 -- In Ada 2005 we have a further case to consider: the prefix may be a
7375 -- function call given in prefix notation. The original node appears to
7376 -- be a selected component, but we need to examine the call.
7378 elsif Nkind (N) = N_Explicit_Dereference
7379 and then Nkind (Orig_Node) /= N_Explicit_Dereference
7380 and then Present (Etype (Orig_Node))
7381 and then Is_Access_Type (Etype (Orig_Node))
7383 -- Note that if the prefix is an explicit dereference that does not
7384 -- come from source, we must check for a rewritten function call in
7385 -- prefixed notation before other forms of rewriting, to prevent a
7389 (Nkind (Orig_Node) = N_Function_Call
7390 and then not Is_Access_Constant (Etype (Prefix (N))))
7392 Is_Variable_Prefix (Original_Node (Prefix (N)));
7394 -- A function call is never a variable
7396 elsif Nkind (N) = N_Function_Call then
7399 -- All remaining checks use the original node
7401 elsif Is_Entity_Name (Orig_Node)
7402 and then Present (Entity (Orig_Node))
7405 E : constant Entity_Id := Entity (Orig_Node);
7406 K : constant Entity_Kind := Ekind (E);
7409 return (K = E_Variable
7410 and then Nkind (Parent (E)) /= N_Exception_Handler)
7411 or else (K = E_Component
7412 and then not In_Protected_Function (E))
7413 or else K = E_Out_Parameter
7414 or else K = E_In_Out_Parameter
7415 or else K = E_Generic_In_Out_Parameter
7417 -- Current instance of type:
7419 or else (Is_Type (E) and then In_Open_Scopes (E))
7420 or else (Is_Incomplete_Or_Private_Type (E)
7421 and then In_Open_Scopes (Full_View (E)));
7425 case Nkind (Orig_Node) is
7426 when N_Indexed_Component | N_Slice =>
7427 return Is_Variable_Prefix (Prefix (Orig_Node));
7429 when N_Selected_Component =>
7430 return Is_Variable_Prefix (Prefix (Orig_Node))
7431 and then Is_Variable (Selector_Name (Orig_Node));
7433 -- For an explicit dereference, the type of the prefix cannot
7434 -- be an access to constant or an access to subprogram.
7436 when N_Explicit_Dereference =>
7438 Typ : constant Entity_Id := Etype (Prefix (Orig_Node));
7440 return Is_Access_Type (Typ)
7441 and then not Is_Access_Constant (Root_Type (Typ))
7442 and then Ekind (Typ) /= E_Access_Subprogram_Type;
7445 -- The type conversion is the case where we do not deal with the
7446 -- context dependent special case of an actual parameter. Thus
7447 -- the type conversion is only considered a variable for the
7448 -- purposes of this routine if the target type is tagged. However,
7449 -- a type conversion is considered to be a variable if it does not
7450 -- come from source (this deals for example with the conversions
7451 -- of expressions to their actual subtypes).
7453 when N_Type_Conversion =>
7454 return Is_Variable (Expression (Orig_Node))
7456 (not Comes_From_Source (Orig_Node)
7458 (Is_Tagged_Type (Etype (Subtype_Mark (Orig_Node)))
7460 Is_Tagged_Type (Etype (Expression (Orig_Node)))));
7462 -- GNAT allows an unchecked type conversion as a variable. This
7463 -- only affects the generation of internal expanded code, since
7464 -- calls to instantiations of Unchecked_Conversion are never
7465 -- considered variables (since they are function calls).
7466 -- This is also true for expression actions.
7468 when N_Unchecked_Type_Conversion =>
7469 return Is_Variable (Expression (Orig_Node));
7477 ---------------------------
7478 -- Is_Visibly_Controlled --
7479 ---------------------------
7481 function Is_Visibly_Controlled (T : Entity_Id) return Boolean is
7482 Root : constant Entity_Id := Root_Type (T);
7484 return Chars (Scope (Root)) = Name_Finalization
7485 and then Chars (Scope (Scope (Root))) = Name_Ada
7486 and then Scope (Scope (Scope (Root))) = Standard_Standard;
7487 end Is_Visibly_Controlled;
7489 ------------------------
7490 -- Is_Volatile_Object --
7491 ------------------------
7493 function Is_Volatile_Object (N : Node_Id) return Boolean is
7495 function Object_Has_Volatile_Components (N : Node_Id) return Boolean;
7496 -- Determines if given object has volatile components
7498 function Is_Volatile_Prefix (N : Node_Id) return Boolean;
7499 -- If prefix is an implicit dereference, examine designated type
7501 ------------------------
7502 -- Is_Volatile_Prefix --
7503 ------------------------
7505 function Is_Volatile_Prefix (N : Node_Id) return Boolean is
7506 Typ : constant Entity_Id := Etype (N);
7509 if Is_Access_Type (Typ) then
7511 Dtyp : constant Entity_Id := Designated_Type (Typ);
7514 return Is_Volatile (Dtyp)
7515 or else Has_Volatile_Components (Dtyp);
7519 return Object_Has_Volatile_Components (N);
7521 end Is_Volatile_Prefix;
7523 ------------------------------------
7524 -- Object_Has_Volatile_Components --
7525 ------------------------------------
7527 function Object_Has_Volatile_Components (N : Node_Id) return Boolean is
7528 Typ : constant Entity_Id := Etype (N);
7531 if Is_Volatile (Typ)
7532 or else Has_Volatile_Components (Typ)
7536 elsif Is_Entity_Name (N)
7537 and then (Has_Volatile_Components (Entity (N))
7538 or else Is_Volatile (Entity (N)))
7542 elsif Nkind (N) = N_Indexed_Component
7543 or else Nkind (N) = N_Selected_Component
7545 return Is_Volatile_Prefix (Prefix (N));
7550 end Object_Has_Volatile_Components;
7552 -- Start of processing for Is_Volatile_Object
7555 if Is_Volatile (Etype (N))
7556 or else (Is_Entity_Name (N) and then Is_Volatile (Entity (N)))
7560 elsif Nkind (N) = N_Indexed_Component
7561 or else Nkind (N) = N_Selected_Component
7563 return Is_Volatile_Prefix (Prefix (N));
7568 end Is_Volatile_Object;
7570 -------------------------
7571 -- Kill_Current_Values --
7572 -------------------------
7574 procedure Kill_Current_Values
7576 Last_Assignment_Only : Boolean := False)
7579 -- ??? do we have to worry about clearing cached checks?
7581 if Is_Assignable (Ent) then
7582 Set_Last_Assignment (Ent, Empty);
7585 if Is_Object (Ent) then
7586 if not Last_Assignment_Only then
7588 Set_Current_Value (Ent, Empty);
7590 if not Can_Never_Be_Null (Ent) then
7591 Set_Is_Known_Non_Null (Ent, False);
7594 Set_Is_Known_Null (Ent, False);
7596 -- Reset Is_Known_Valid unless type is always valid, or if we have
7597 -- a loop parameter (loop parameters are always valid, since their
7598 -- bounds are defined by the bounds given in the loop header).
7600 if not Is_Known_Valid (Etype (Ent))
7601 and then Ekind (Ent) /= E_Loop_Parameter
7603 Set_Is_Known_Valid (Ent, False);
7607 end Kill_Current_Values;
7609 procedure Kill_Current_Values (Last_Assignment_Only : Boolean := False) is
7612 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id);
7613 -- Clear current value for entity E and all entities chained to E
7615 ------------------------------------------
7616 -- Kill_Current_Values_For_Entity_Chain --
7617 ------------------------------------------
7619 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id) is
7623 while Present (Ent) loop
7624 Kill_Current_Values (Ent, Last_Assignment_Only);
7627 end Kill_Current_Values_For_Entity_Chain;
7629 -- Start of processing for Kill_Current_Values
7632 -- Kill all saved checks, a special case of killing saved values
7634 if not Last_Assignment_Only then
7638 -- Loop through relevant scopes, which includes the current scope and
7639 -- any parent scopes if the current scope is a block or a package.
7644 -- Clear current values of all entities in current scope
7646 Kill_Current_Values_For_Entity_Chain (First_Entity (S));
7648 -- If scope is a package, also clear current values of all
7649 -- private entities in the scope.
7651 if Is_Package_Or_Generic_Package (S)
7652 or else Is_Concurrent_Type (S)
7654 Kill_Current_Values_For_Entity_Chain (First_Private_Entity (S));
7657 -- If this is a not a subprogram, deal with parents
7659 if not Is_Subprogram (S) then
7661 exit Scope_Loop when S = Standard_Standard;
7665 end loop Scope_Loop;
7666 end Kill_Current_Values;
7668 --------------------------
7669 -- Kill_Size_Check_Code --
7670 --------------------------
7672 procedure Kill_Size_Check_Code (E : Entity_Id) is
7674 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
7675 and then Present (Size_Check_Code (E))
7677 Remove (Size_Check_Code (E));
7678 Set_Size_Check_Code (E, Empty);
7680 end Kill_Size_Check_Code;
7682 --------------------------
7683 -- Known_To_Be_Assigned --
7684 --------------------------
7686 function Known_To_Be_Assigned (N : Node_Id) return Boolean is
7687 P : constant Node_Id := Parent (N);
7692 -- Test left side of assignment
7694 when N_Assignment_Statement =>
7695 return N = Name (P);
7697 -- Function call arguments are never lvalues
7699 when N_Function_Call =>
7702 -- Positional parameter for procedure or accept call
7704 when N_Procedure_Call_Statement |
7713 Proc := Get_Subprogram_Entity (P);
7719 -- If we are not a list member, something is strange, so
7720 -- be conservative and return False.
7722 if not Is_List_Member (N) then
7726 -- We are going to find the right formal by stepping forward
7727 -- through the formals, as we step backwards in the actuals.
7729 Form := First_Formal (Proc);
7732 -- If no formal, something is weird, so be conservative
7733 -- and return False.
7744 return Ekind (Form) /= E_In_Parameter;
7747 -- Named parameter for procedure or accept call
7749 when N_Parameter_Association =>
7755 Proc := Get_Subprogram_Entity (Parent (P));
7761 -- Loop through formals to find the one that matches
7763 Form := First_Formal (Proc);
7765 -- If no matching formal, that's peculiar, some kind of
7766 -- previous error, so return False to be conservative.
7772 -- Else test for match
7774 if Chars (Form) = Chars (Selector_Name (P)) then
7775 return Ekind (Form) /= E_In_Parameter;
7782 -- Test for appearing in a conversion that itself appears
7783 -- in an lvalue context, since this should be an lvalue.
7785 when N_Type_Conversion =>
7786 return Known_To_Be_Assigned (P);
7788 -- All other references are definitely not known to be modifications
7794 end Known_To_Be_Assigned;
7800 function May_Be_Lvalue (N : Node_Id) return Boolean is
7801 P : constant Node_Id := Parent (N);
7806 -- Test left side of assignment
7808 when N_Assignment_Statement =>
7809 return N = Name (P);
7811 -- Test prefix of component or attribute. Note that the prefix of an
7812 -- explicit or implicit dereference cannot be an l-value.
7814 when N_Attribute_Reference =>
7815 return N = Prefix (P)
7816 and then Name_Implies_Lvalue_Prefix (Attribute_Name (P));
7818 -- For an expanded name, the name is an lvalue if the expanded name
7819 -- is an lvalue, but the prefix is never an lvalue, since it is just
7820 -- the scope where the name is found.
7822 when N_Expanded_Name =>
7823 if N = Prefix (P) then
7824 return May_Be_Lvalue (P);
7829 -- For a selected component A.B, A is certainly an lvalue if A.B is.
7830 -- B is a little interesting, if we have A.B := 3, there is some
7831 -- discussion as to whether B is an lvalue or not, we choose to say
7832 -- it is. Note however that A is not an lvalue if it is of an access
7833 -- type since this is an implicit dereference.
7835 when N_Selected_Component =>
7837 and then Present (Etype (N))
7838 and then Is_Access_Type (Etype (N))
7842 return May_Be_Lvalue (P);
7845 -- For an indexed component or slice, the index or slice bounds is
7846 -- never an lvalue. The prefix is an lvalue if the indexed component
7847 -- or slice is an lvalue, except if it is an access type, where we
7848 -- have an implicit dereference.
7850 when N_Indexed_Component =>
7852 or else (Present (Etype (N)) and then Is_Access_Type (Etype (N)))
7856 return May_Be_Lvalue (P);
7859 -- Prefix of a reference is an lvalue if the reference is an lvalue
7862 return May_Be_Lvalue (P);
7864 -- Prefix of explicit dereference is never an lvalue
7866 when N_Explicit_Dereference =>
7869 -- Function call arguments are never lvalues
7871 when N_Function_Call =>
7874 -- Positional parameter for procedure, entry, or accept call
7876 when N_Procedure_Call_Statement |
7877 N_Entry_Call_Statement |
7886 Proc := Get_Subprogram_Entity (P);
7892 -- If we are not a list member, something is strange, so
7893 -- be conservative and return True.
7895 if not Is_List_Member (N) then
7899 -- We are going to find the right formal by stepping forward
7900 -- through the formals, as we step backwards in the actuals.
7902 Form := First_Formal (Proc);
7905 -- If no formal, something is weird, so be conservative
7917 return Ekind (Form) /= E_In_Parameter;
7920 -- Named parameter for procedure or accept call
7922 when N_Parameter_Association =>
7928 Proc := Get_Subprogram_Entity (Parent (P));
7934 -- Loop through formals to find the one that matches
7936 Form := First_Formal (Proc);
7938 -- If no matching formal, that's peculiar, some kind of
7939 -- previous error, so return True to be conservative.
7945 -- Else test for match
7947 if Chars (Form) = Chars (Selector_Name (P)) then
7948 return Ekind (Form) /= E_In_Parameter;
7955 -- Test for appearing in a conversion that itself appears in an
7956 -- lvalue context, since this should be an lvalue.
7958 when N_Type_Conversion =>
7959 return May_Be_Lvalue (P);
7961 -- Test for appearance in object renaming declaration
7963 when N_Object_Renaming_Declaration =>
7966 -- All other references are definitely not lvalues
7974 -----------------------
7975 -- Mark_Coextensions --
7976 -----------------------
7978 procedure Mark_Coextensions (Context_Nod : Node_Id; Root_Nod : Node_Id) is
7979 Is_Dynamic : Boolean;
7980 -- Indicates whether the context causes nested coextensions to be
7981 -- dynamic or static
7983 function Mark_Allocator (N : Node_Id) return Traverse_Result;
7984 -- Recognize an allocator node and label it as a dynamic coextension
7986 --------------------
7987 -- Mark_Allocator --
7988 --------------------
7990 function Mark_Allocator (N : Node_Id) return Traverse_Result is
7992 if Nkind (N) = N_Allocator then
7994 Set_Is_Dynamic_Coextension (N);
7996 -- If the allocator expression is potentially dynamic, it may
7997 -- be expanded out of order and require dynamic allocation
7998 -- anyway, so we treat the coextension itself as dynamic.
7999 -- Potential optimization ???
8001 elsif Nkind (Expression (N)) = N_Qualified_Expression
8002 and then Nkind (Expression (Expression (N))) = N_Op_Concat
8004 Set_Is_Dynamic_Coextension (N);
8007 Set_Is_Static_Coextension (N);
8014 procedure Mark_Allocators is new Traverse_Proc (Mark_Allocator);
8016 -- Start of processing Mark_Coextensions
8019 case Nkind (Context_Nod) is
8020 when N_Assignment_Statement |
8021 N_Simple_Return_Statement =>
8022 Is_Dynamic := Nkind (Expression (Context_Nod)) = N_Allocator;
8024 when N_Object_Declaration =>
8025 Is_Dynamic := Nkind (Root_Nod) = N_Allocator;
8027 -- This routine should not be called for constructs which may not
8028 -- contain coextensions.
8031 raise Program_Error;
8034 Mark_Allocators (Root_Nod);
8035 end Mark_Coextensions;
8037 ----------------------
8038 -- Needs_One_Actual --
8039 ----------------------
8041 function Needs_One_Actual (E : Entity_Id) return Boolean is
8045 if Ada_Version >= Ada_2005
8046 and then Present (First_Formal (E))
8048 Formal := Next_Formal (First_Formal (E));
8049 while Present (Formal) loop
8050 if No (Default_Value (Formal)) then
8054 Next_Formal (Formal);
8062 end Needs_One_Actual;
8064 ------------------------
8065 -- New_Copy_List_Tree --
8066 ------------------------
8068 function New_Copy_List_Tree (List : List_Id) return List_Id is
8073 if List = No_List then
8080 while Present (E) loop
8081 Append (New_Copy_Tree (E), NL);
8087 end New_Copy_List_Tree;
8093 use Atree.Unchecked_Access;
8094 use Atree_Private_Part;
8096 -- Our approach here requires a two pass traversal of the tree. The
8097 -- first pass visits all nodes that eventually will be copied looking
8098 -- for defining Itypes. If any defining Itypes are found, then they are
8099 -- copied, and an entry is added to the replacement map. In the second
8100 -- phase, the tree is copied, using the replacement map to replace any
8101 -- Itype references within the copied tree.
8103 -- The following hash tables are used if the Map supplied has more
8104 -- than hash threshhold entries to speed up access to the map. If
8105 -- there are fewer entries, then the map is searched sequentially
8106 -- (because setting up a hash table for only a few entries takes
8107 -- more time than it saves.
8109 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
8110 -- Hash function used for hash operations
8116 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
8118 return Nat (E) mod (NCT_Header_Num'Last + 1);
8125 -- The hash table NCT_Assoc associates old entities in the table
8126 -- with their corresponding new entities (i.e. the pairs of entries
8127 -- presented in the original Map argument are Key-Element pairs).
8129 package NCT_Assoc is new Simple_HTable (
8130 Header_Num => NCT_Header_Num,
8131 Element => Entity_Id,
8132 No_Element => Empty,
8134 Hash => New_Copy_Hash,
8135 Equal => Types."=");
8137 ---------------------
8138 -- NCT_Itype_Assoc --
8139 ---------------------
8141 -- The hash table NCT_Itype_Assoc contains entries only for those
8142 -- old nodes which have a non-empty Associated_Node_For_Itype set.
8143 -- The key is the associated node, and the element is the new node
8144 -- itself (NOT the associated node for the new node).
8146 package NCT_Itype_Assoc is new Simple_HTable (
8147 Header_Num => NCT_Header_Num,
8148 Element => Entity_Id,
8149 No_Element => Empty,
8151 Hash => New_Copy_Hash,
8152 Equal => Types."=");
8154 -- Start of processing for New_Copy_Tree function
8156 function New_Copy_Tree
8158 Map : Elist_Id := No_Elist;
8159 New_Sloc : Source_Ptr := No_Location;
8160 New_Scope : Entity_Id := Empty) return Node_Id
8162 Actual_Map : Elist_Id := Map;
8163 -- This is the actual map for the copy. It is initialized with the
8164 -- given elements, and then enlarged as required for Itypes that are
8165 -- copied during the first phase of the copy operation. The visit
8166 -- procedures add elements to this map as Itypes are encountered.
8167 -- The reason we cannot use Map directly, is that it may well be
8168 -- (and normally is) initialized to No_Elist, and if we have mapped
8169 -- entities, we have to reset it to point to a real Elist.
8171 function Assoc (N : Node_Or_Entity_Id) return Node_Id;
8172 -- Called during second phase to map entities into their corresponding
8173 -- copies using Actual_Map. If the argument is not an entity, or is not
8174 -- in Actual_Map, then it is returned unchanged.
8176 procedure Build_NCT_Hash_Tables;
8177 -- Builds hash tables (number of elements >= threshold value)
8179 function Copy_Elist_With_Replacement
8180 (Old_Elist : Elist_Id) return Elist_Id;
8181 -- Called during second phase to copy element list doing replacements
8183 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
8184 -- Called during the second phase to process a copied Itype. The actual
8185 -- copy happened during the first phase (so that we could make the entry
8186 -- in the mapping), but we still have to deal with the descendents of
8187 -- the copied Itype and copy them where necessary.
8189 function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
8190 -- Called during second phase to copy list doing replacements
8192 function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
8193 -- Called during second phase to copy node doing replacements
8195 procedure Visit_Elist (E : Elist_Id);
8196 -- Called during first phase to visit all elements of an Elist
8198 procedure Visit_Field (F : Union_Id; N : Node_Id);
8199 -- Visit a single field, recursing to call Visit_Node or Visit_List
8200 -- if the field is a syntactic descendent of the current node (i.e.
8201 -- its parent is Node N).
8203 procedure Visit_Itype (Old_Itype : Entity_Id);
8204 -- Called during first phase to visit subsidiary fields of a defining
8205 -- Itype, and also create a copy and make an entry in the replacement
8206 -- map for the new copy.
8208 procedure Visit_List (L : List_Id);
8209 -- Called during first phase to visit all elements of a List
8211 procedure Visit_Node (N : Node_Or_Entity_Id);
8212 -- Called during first phase to visit a node and all its subtrees
8218 function Assoc (N : Node_Or_Entity_Id) return Node_Id is
8223 if not Has_Extension (N) or else No (Actual_Map) then
8226 elsif NCT_Hash_Tables_Used then
8227 Ent := NCT_Assoc.Get (Entity_Id (N));
8229 if Present (Ent) then
8235 -- No hash table used, do serial search
8238 E := First_Elmt (Actual_Map);
8239 while Present (E) loop
8240 if Node (E) = N then
8241 return Node (Next_Elmt (E));
8243 E := Next_Elmt (Next_Elmt (E));
8251 ---------------------------
8252 -- Build_NCT_Hash_Tables --
8253 ---------------------------
8255 procedure Build_NCT_Hash_Tables is
8259 if NCT_Hash_Table_Setup then
8261 NCT_Itype_Assoc.Reset;
8264 Elmt := First_Elmt (Actual_Map);
8265 while Present (Elmt) loop
8268 -- Get new entity, and associate old and new
8271 NCT_Assoc.Set (Ent, Node (Elmt));
8273 if Is_Type (Ent) then
8275 Anode : constant Entity_Id :=
8276 Associated_Node_For_Itype (Ent);
8279 if Present (Anode) then
8281 -- Enter a link between the associated node of the
8282 -- old Itype and the new Itype, for updating later
8283 -- when node is copied.
8285 NCT_Itype_Assoc.Set (Anode, Node (Elmt));
8293 NCT_Hash_Tables_Used := True;
8294 NCT_Hash_Table_Setup := True;
8295 end Build_NCT_Hash_Tables;
8297 ---------------------------------
8298 -- Copy_Elist_With_Replacement --
8299 ---------------------------------
8301 function Copy_Elist_With_Replacement
8302 (Old_Elist : Elist_Id) return Elist_Id
8305 New_Elist : Elist_Id;
8308 if No (Old_Elist) then
8312 New_Elist := New_Elmt_List;
8314 M := First_Elmt (Old_Elist);
8315 while Present (M) loop
8316 Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
8322 end Copy_Elist_With_Replacement;
8324 ---------------------------------
8325 -- Copy_Itype_With_Replacement --
8326 ---------------------------------
8328 -- This routine exactly parallels its phase one analog Visit_Itype,
8330 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
8332 -- Translate Next_Entity, Scope and Etype fields, in case they
8333 -- reference entities that have been mapped into copies.
8335 Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
8336 Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
8338 if Present (New_Scope) then
8339 Set_Scope (New_Itype, New_Scope);
8341 Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
8344 -- Copy referenced fields
8346 if Is_Discrete_Type (New_Itype) then
8347 Set_Scalar_Range (New_Itype,
8348 Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
8350 elsif Has_Discriminants (Base_Type (New_Itype)) then
8351 Set_Discriminant_Constraint (New_Itype,
8352 Copy_Elist_With_Replacement
8353 (Discriminant_Constraint (New_Itype)));
8355 elsif Is_Array_Type (New_Itype) then
8356 if Present (First_Index (New_Itype)) then
8357 Set_First_Index (New_Itype,
8358 First (Copy_List_With_Replacement
8359 (List_Containing (First_Index (New_Itype)))));
8362 if Is_Packed (New_Itype) then
8363 Set_Packed_Array_Type (New_Itype,
8364 Copy_Node_With_Replacement
8365 (Packed_Array_Type (New_Itype)));
8368 end Copy_Itype_With_Replacement;
8370 --------------------------------
8371 -- Copy_List_With_Replacement --
8372 --------------------------------
8374 function Copy_List_With_Replacement
8375 (Old_List : List_Id) return List_Id
8381 if Old_List = No_List then
8385 New_List := Empty_List;
8387 E := First (Old_List);
8388 while Present (E) loop
8389 Append (Copy_Node_With_Replacement (E), New_List);
8395 end Copy_List_With_Replacement;
8397 --------------------------------
8398 -- Copy_Node_With_Replacement --
8399 --------------------------------
8401 function Copy_Node_With_Replacement
8402 (Old_Node : Node_Id) return Node_Id
8406 procedure Adjust_Named_Associations
8407 (Old_Node : Node_Id;
8408 New_Node : Node_Id);
8409 -- If a call node has named associations, these are chained through
8410 -- the First_Named_Actual, Next_Named_Actual links. These must be
8411 -- propagated separately to the new parameter list, because these
8412 -- are not syntactic fields.
8414 function Copy_Field_With_Replacement
8415 (Field : Union_Id) return Union_Id;
8416 -- Given Field, which is a field of Old_Node, return a copy of it
8417 -- if it is a syntactic field (i.e. its parent is Node), setting
8418 -- the parent of the copy to poit to New_Node. Otherwise returns
8419 -- the field (possibly mapped if it is an entity).
8421 -------------------------------
8422 -- Adjust_Named_Associations --
8423 -------------------------------
8425 procedure Adjust_Named_Associations
8426 (Old_Node : Node_Id;
8436 Old_E := First (Parameter_Associations (Old_Node));
8437 New_E := First (Parameter_Associations (New_Node));
8438 while Present (Old_E) loop
8439 if Nkind (Old_E) = N_Parameter_Association
8440 and then Present (Next_Named_Actual (Old_E))
8442 if First_Named_Actual (Old_Node)
8443 = Explicit_Actual_Parameter (Old_E)
8445 Set_First_Named_Actual
8446 (New_Node, Explicit_Actual_Parameter (New_E));
8449 -- Now scan parameter list from the beginning,to locate
8450 -- next named actual, which can be out of order.
8452 Old_Next := First (Parameter_Associations (Old_Node));
8453 New_Next := First (Parameter_Associations (New_Node));
8455 while Nkind (Old_Next) /= N_Parameter_Association
8456 or else Explicit_Actual_Parameter (Old_Next)
8457 /= Next_Named_Actual (Old_E)
8463 Set_Next_Named_Actual
8464 (New_E, Explicit_Actual_Parameter (New_Next));
8470 end Adjust_Named_Associations;
8472 ---------------------------------
8473 -- Copy_Field_With_Replacement --
8474 ---------------------------------
8476 function Copy_Field_With_Replacement
8477 (Field : Union_Id) return Union_Id
8480 if Field = Union_Id (Empty) then
8483 elsif Field in Node_Range then
8485 Old_N : constant Node_Id := Node_Id (Field);
8489 -- If syntactic field, as indicated by the parent pointer
8490 -- being set, then copy the referenced node recursively.
8492 if Parent (Old_N) = Old_Node then
8493 New_N := Copy_Node_With_Replacement (Old_N);
8495 if New_N /= Old_N then
8496 Set_Parent (New_N, New_Node);
8499 -- For semantic fields, update possible entity reference
8500 -- from the replacement map.
8503 New_N := Assoc (Old_N);
8506 return Union_Id (New_N);
8509 elsif Field in List_Range then
8511 Old_L : constant List_Id := List_Id (Field);
8515 -- If syntactic field, as indicated by the parent pointer,
8516 -- then recursively copy the entire referenced list.
8518 if Parent (Old_L) = Old_Node then
8519 New_L := Copy_List_With_Replacement (Old_L);
8520 Set_Parent (New_L, New_Node);
8522 -- For semantic list, just returned unchanged
8528 return Union_Id (New_L);
8531 -- Anything other than a list or a node is returned unchanged
8536 end Copy_Field_With_Replacement;
8538 -- Start of processing for Copy_Node_With_Replacement
8541 if Old_Node <= Empty_Or_Error then
8544 elsif Has_Extension (Old_Node) then
8545 return Assoc (Old_Node);
8548 New_Node := New_Copy (Old_Node);
8550 -- If the node we are copying is the associated node of a
8551 -- previously copied Itype, then adjust the associated node
8552 -- of the copy of that Itype accordingly.
8554 if Present (Actual_Map) then
8560 -- Case of hash table used
8562 if NCT_Hash_Tables_Used then
8563 Ent := NCT_Itype_Assoc.Get (Old_Node);
8565 if Present (Ent) then
8566 Set_Associated_Node_For_Itype (Ent, New_Node);
8569 -- Case of no hash table used
8572 E := First_Elmt (Actual_Map);
8573 while Present (E) loop
8574 if Is_Itype (Node (E))
8576 Old_Node = Associated_Node_For_Itype (Node (E))
8578 Set_Associated_Node_For_Itype
8579 (Node (Next_Elmt (E)), New_Node);
8582 E := Next_Elmt (Next_Elmt (E));
8588 -- Recursively copy descendents
8591 (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
8593 (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
8595 (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
8597 (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
8599 (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
8601 -- Adjust Sloc of new node if necessary
8603 if New_Sloc /= No_Location then
8604 Set_Sloc (New_Node, New_Sloc);
8606 -- If we adjust the Sloc, then we are essentially making
8607 -- a completely new node, so the Comes_From_Source flag
8608 -- should be reset to the proper default value.
8610 Nodes.Table (New_Node).Comes_From_Source :=
8611 Default_Node.Comes_From_Source;
8614 -- If the node is call and has named associations,
8615 -- set the corresponding links in the copy.
8617 if (Nkind (Old_Node) = N_Function_Call
8618 or else Nkind (Old_Node) = N_Entry_Call_Statement
8620 Nkind (Old_Node) = N_Procedure_Call_Statement)
8621 and then Present (First_Named_Actual (Old_Node))
8623 Adjust_Named_Associations (Old_Node, New_Node);
8626 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
8627 -- The replacement mechanism applies to entities, and is not used
8628 -- here. Eventually we may need a more general graph-copying
8629 -- routine. For now, do a sequential search to find desired node.
8631 if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
8632 and then Present (First_Real_Statement (Old_Node))
8635 Old_F : constant Node_Id := First_Real_Statement (Old_Node);
8639 N1 := First (Statements (Old_Node));
8640 N2 := First (Statements (New_Node));
8642 while N1 /= Old_F loop
8647 Set_First_Real_Statement (New_Node, N2);
8652 -- All done, return copied node
8655 end Copy_Node_With_Replacement;
8661 procedure Visit_Elist (E : Elist_Id) is
8665 Elmt := First_Elmt (E);
8667 while Elmt /= No_Elmt loop
8668 Visit_Node (Node (Elmt));
8678 procedure Visit_Field (F : Union_Id; N : Node_Id) is
8680 if F = Union_Id (Empty) then
8683 elsif F in Node_Range then
8685 -- Copy node if it is syntactic, i.e. its parent pointer is
8686 -- set to point to the field that referenced it (certain
8687 -- Itypes will also meet this criterion, which is fine, since
8688 -- these are clearly Itypes that do need to be copied, since
8689 -- we are copying their parent.)
8691 if Parent (Node_Id (F)) = N then
8692 Visit_Node (Node_Id (F));
8695 -- Another case, if we are pointing to an Itype, then we want
8696 -- to copy it if its associated node is somewhere in the tree
8699 -- Note: the exclusion of self-referential copies is just an
8700 -- optimization, since the search of the already copied list
8701 -- would catch it, but it is a common case (Etype pointing
8702 -- to itself for an Itype that is a base type).
8704 elsif Has_Extension (Node_Id (F))
8705 and then Is_Itype (Entity_Id (F))
8706 and then Node_Id (F) /= N
8712 P := Associated_Node_For_Itype (Node_Id (F));
8713 while Present (P) loop
8715 Visit_Node (Node_Id (F));
8722 -- An Itype whose parent is not being copied definitely
8723 -- should NOT be copied, since it does not belong in any
8724 -- sense to the copied subtree.
8730 elsif F in List_Range
8731 and then Parent (List_Id (F)) = N
8733 Visit_List (List_Id (F));
8742 procedure Visit_Itype (Old_Itype : Entity_Id) is
8743 New_Itype : Entity_Id;
8748 -- Itypes that describe the designated type of access to subprograms
8749 -- have the structure of subprogram declarations, with signatures,
8750 -- etc. Either we duplicate the signatures completely, or choose to
8751 -- share such itypes, which is fine because their elaboration will
8752 -- have no side effects.
8754 if Ekind (Old_Itype) = E_Subprogram_Type then
8758 New_Itype := New_Copy (Old_Itype);
8760 -- The new Itype has all the attributes of the old one, and
8761 -- we just copy the contents of the entity. However, the back-end
8762 -- needs different names for debugging purposes, so we create a
8763 -- new internal name for it in all cases.
8765 Set_Chars (New_Itype, New_Internal_Name ('T'));
8767 -- If our associated node is an entity that has already been copied,
8768 -- then set the associated node of the copy to point to the right
8769 -- copy. If we have copied an Itype that is itself the associated
8770 -- node of some previously copied Itype, then we set the right
8771 -- pointer in the other direction.
8773 if Present (Actual_Map) then
8775 -- Case of hash tables used
8777 if NCT_Hash_Tables_Used then
8779 Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
8781 if Present (Ent) then
8782 Set_Associated_Node_For_Itype (New_Itype, Ent);
8785 Ent := NCT_Itype_Assoc.Get (Old_Itype);
8786 if Present (Ent) then
8787 Set_Associated_Node_For_Itype (Ent, New_Itype);
8789 -- If the hash table has no association for this Itype and
8790 -- its associated node, enter one now.
8794 (Associated_Node_For_Itype (Old_Itype), New_Itype);
8797 -- Case of hash tables not used
8800 E := First_Elmt (Actual_Map);
8801 while Present (E) loop
8802 if Associated_Node_For_Itype (Old_Itype) = Node (E) then
8803 Set_Associated_Node_For_Itype
8804 (New_Itype, Node (Next_Elmt (E)));
8807 if Is_Type (Node (E))
8809 Old_Itype = Associated_Node_For_Itype (Node (E))
8811 Set_Associated_Node_For_Itype
8812 (Node (Next_Elmt (E)), New_Itype);
8815 E := Next_Elmt (Next_Elmt (E));
8820 if Present (Freeze_Node (New_Itype)) then
8821 Set_Is_Frozen (New_Itype, False);
8822 Set_Freeze_Node (New_Itype, Empty);
8825 -- Add new association to map
8827 if No (Actual_Map) then
8828 Actual_Map := New_Elmt_List;
8831 Append_Elmt (Old_Itype, Actual_Map);
8832 Append_Elmt (New_Itype, Actual_Map);
8834 if NCT_Hash_Tables_Used then
8835 NCT_Assoc.Set (Old_Itype, New_Itype);
8838 NCT_Table_Entries := NCT_Table_Entries + 1;
8840 if NCT_Table_Entries > NCT_Hash_Threshhold then
8841 Build_NCT_Hash_Tables;
8845 -- If a record subtype is simply copied, the entity list will be
8846 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
8848 if Ekind_In (Old_Itype, E_Record_Subtype, E_Class_Wide_Subtype) then
8849 Set_Cloned_Subtype (New_Itype, Old_Itype);
8852 -- Visit descendents that eventually get copied
8854 Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
8856 if Is_Discrete_Type (Old_Itype) then
8857 Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
8859 elsif Has_Discriminants (Base_Type (Old_Itype)) then
8860 -- ??? This should involve call to Visit_Field
8861 Visit_Elist (Discriminant_Constraint (Old_Itype));
8863 elsif Is_Array_Type (Old_Itype) then
8864 if Present (First_Index (Old_Itype)) then
8865 Visit_Field (Union_Id (List_Containing
8866 (First_Index (Old_Itype))),
8870 if Is_Packed (Old_Itype) then
8871 Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)),
8881 procedure Visit_List (L : List_Id) is
8884 if L /= No_List then
8887 while Present (N) loop
8898 procedure Visit_Node (N : Node_Or_Entity_Id) is
8900 -- Start of processing for Visit_Node
8903 -- Handle case of an Itype, which must be copied
8905 if Has_Extension (N)
8906 and then Is_Itype (N)
8908 -- Nothing to do if already in the list. This can happen with an
8909 -- Itype entity that appears more than once in the tree.
8910 -- Note that we do not want to visit descendents in this case.
8912 -- Test for already in list when hash table is used
8914 if NCT_Hash_Tables_Used then
8915 if Present (NCT_Assoc.Get (Entity_Id (N))) then
8919 -- Test for already in list when hash table not used
8925 if Present (Actual_Map) then
8926 E := First_Elmt (Actual_Map);
8927 while Present (E) loop
8928 if Node (E) = N then
8931 E := Next_Elmt (Next_Elmt (E));
8941 -- Visit descendents
8943 Visit_Field (Field1 (N), N);
8944 Visit_Field (Field2 (N), N);
8945 Visit_Field (Field3 (N), N);
8946 Visit_Field (Field4 (N), N);
8947 Visit_Field (Field5 (N), N);
8950 -- Start of processing for New_Copy_Tree
8955 -- See if we should use hash table
8957 if No (Actual_Map) then
8958 NCT_Hash_Tables_Used := False;
8965 NCT_Table_Entries := 0;
8967 Elmt := First_Elmt (Actual_Map);
8968 while Present (Elmt) loop
8969 NCT_Table_Entries := NCT_Table_Entries + 1;
8974 if NCT_Table_Entries > NCT_Hash_Threshhold then
8975 Build_NCT_Hash_Tables;
8977 NCT_Hash_Tables_Used := False;
8982 -- Hash table set up if required, now start phase one by visiting
8983 -- top node (we will recursively visit the descendents).
8985 Visit_Node (Source);
8987 -- Now the second phase of the copy can start. First we process
8988 -- all the mapped entities, copying their descendents.
8990 if Present (Actual_Map) then
8993 New_Itype : Entity_Id;
8995 Elmt := First_Elmt (Actual_Map);
8996 while Present (Elmt) loop
8998 New_Itype := Node (Elmt);
8999 Copy_Itype_With_Replacement (New_Itype);
9005 -- Now we can copy the actual tree
9007 return Copy_Node_With_Replacement (Source);
9010 -------------------------
9011 -- New_External_Entity --
9012 -------------------------
9014 function New_External_Entity
9015 (Kind : Entity_Kind;
9016 Scope_Id : Entity_Id;
9017 Sloc_Value : Source_Ptr;
9018 Related_Id : Entity_Id;
9020 Suffix_Index : Nat := 0;
9021 Prefix : Character := ' ') return Entity_Id
9023 N : constant Entity_Id :=
9024 Make_Defining_Identifier (Sloc_Value,
9026 (Chars (Related_Id), Suffix, Suffix_Index, Prefix));
9029 Set_Ekind (N, Kind);
9030 Set_Is_Internal (N, True);
9031 Append_Entity (N, Scope_Id);
9032 Set_Public_Status (N);
9034 if Kind in Type_Kind then
9035 Init_Size_Align (N);
9039 end New_External_Entity;
9041 -------------------------
9042 -- New_Internal_Entity --
9043 -------------------------
9045 function New_Internal_Entity
9046 (Kind : Entity_Kind;
9047 Scope_Id : Entity_Id;
9048 Sloc_Value : Source_Ptr;
9049 Id_Char : Character) return Entity_Id
9051 N : constant Entity_Id := Make_Temporary (Sloc_Value, Id_Char);
9054 Set_Ekind (N, Kind);
9055 Set_Is_Internal (N, True);
9056 Append_Entity (N, Scope_Id);
9058 if Kind in Type_Kind then
9059 Init_Size_Align (N);
9063 end New_Internal_Entity;
9069 function Next_Actual (Actual_Id : Node_Id) return Node_Id is
9073 -- If we are pointing at a positional parameter, it is a member of a
9074 -- node list (the list of parameters), and the next parameter is the
9075 -- next node on the list, unless we hit a parameter association, then
9076 -- we shift to using the chain whose head is the First_Named_Actual in
9077 -- the parent, and then is threaded using the Next_Named_Actual of the
9078 -- Parameter_Association. All this fiddling is because the original node
9079 -- list is in the textual call order, and what we need is the
9080 -- declaration order.
9082 if Is_List_Member (Actual_Id) then
9083 N := Next (Actual_Id);
9085 if Nkind (N) = N_Parameter_Association then
9086 return First_Named_Actual (Parent (Actual_Id));
9092 return Next_Named_Actual (Parent (Actual_Id));
9096 procedure Next_Actual (Actual_Id : in out Node_Id) is
9098 Actual_Id := Next_Actual (Actual_Id);
9101 -----------------------
9102 -- Normalize_Actuals --
9103 -----------------------
9105 -- Chain actuals according to formals of subprogram. If there are no named
9106 -- associations, the chain is simply the list of Parameter Associations,
9107 -- since the order is the same as the declaration order. If there are named
9108 -- associations, then the First_Named_Actual field in the N_Function_Call
9109 -- or N_Procedure_Call_Statement node points to the Parameter_Association
9110 -- node for the parameter that comes first in declaration order. The
9111 -- remaining named parameters are then chained in declaration order using
9112 -- Next_Named_Actual.
9114 -- This routine also verifies that the number of actuals is compatible with
9115 -- the number and default values of formals, but performs no type checking
9116 -- (type checking is done by the caller).
9118 -- If the matching succeeds, Success is set to True and the caller proceeds
9119 -- with type-checking. If the match is unsuccessful, then Success is set to
9120 -- False, and the caller attempts a different interpretation, if there is
9123 -- If the flag Report is on, the call is not overloaded, and a failure to
9124 -- match can be reported here, rather than in the caller.
9126 procedure Normalize_Actuals
9130 Success : out Boolean)
9132 Actuals : constant List_Id := Parameter_Associations (N);
9133 Actual : Node_Id := Empty;
9135 Last : Node_Id := Empty;
9136 First_Named : Node_Id := Empty;
9139 Formals_To_Match : Integer := 0;
9140 Actuals_To_Match : Integer := 0;
9142 procedure Chain (A : Node_Id);
9143 -- Add named actual at the proper place in the list, using the
9144 -- Next_Named_Actual link.
9146 function Reporting return Boolean;
9147 -- Determines if an error is to be reported. To report an error, we
9148 -- need Report to be True, and also we do not report errors caused
9149 -- by calls to init procs that occur within other init procs. Such
9150 -- errors must always be cascaded errors, since if all the types are
9151 -- declared correctly, the compiler will certainly build decent calls!
9157 procedure Chain (A : Node_Id) is
9161 -- Call node points to first actual in list
9163 Set_First_Named_Actual (N, Explicit_Actual_Parameter (A));
9166 Set_Next_Named_Actual (Last, Explicit_Actual_Parameter (A));
9170 Set_Next_Named_Actual (Last, Empty);
9177 function Reporting return Boolean is
9182 elsif not Within_Init_Proc then
9185 elsif Is_Init_Proc (Entity (Name (N))) then
9193 -- Start of processing for Normalize_Actuals
9196 if Is_Access_Type (S) then
9198 -- The name in the call is a function call that returns an access
9199 -- to subprogram. The designated type has the list of formals.
9201 Formal := First_Formal (Designated_Type (S));
9203 Formal := First_Formal (S);
9206 while Present (Formal) loop
9207 Formals_To_Match := Formals_To_Match + 1;
9208 Next_Formal (Formal);
9211 -- Find if there is a named association, and verify that no positional
9212 -- associations appear after named ones.
9214 if Present (Actuals) then
9215 Actual := First (Actuals);
9218 while Present (Actual)
9219 and then Nkind (Actual) /= N_Parameter_Association
9221 Actuals_To_Match := Actuals_To_Match + 1;
9225 if No (Actual) and Actuals_To_Match = Formals_To_Match then
9227 -- Most common case: positional notation, no defaults
9232 elsif Actuals_To_Match > Formals_To_Match then
9234 -- Too many actuals: will not work
9237 if Is_Entity_Name (Name (N)) then
9238 Error_Msg_N ("too many arguments in call to&", Name (N));
9240 Error_Msg_N ("too many arguments in call", N);
9248 First_Named := Actual;
9250 while Present (Actual) loop
9251 if Nkind (Actual) /= N_Parameter_Association then
9253 ("positional parameters not allowed after named ones", Actual);
9258 Actuals_To_Match := Actuals_To_Match + 1;
9264 if Present (Actuals) then
9265 Actual := First (Actuals);
9268 Formal := First_Formal (S);
9269 while Present (Formal) loop
9271 -- Match the formals in order. If the corresponding actual is
9272 -- positional, nothing to do. Else scan the list of named actuals
9273 -- to find the one with the right name.
9276 and then Nkind (Actual) /= N_Parameter_Association
9279 Actuals_To_Match := Actuals_To_Match - 1;
9280 Formals_To_Match := Formals_To_Match - 1;
9283 -- For named parameters, search the list of actuals to find
9284 -- one that matches the next formal name.
9286 Actual := First_Named;
9288 while Present (Actual) loop
9289 if Chars (Selector_Name (Actual)) = Chars (Formal) then
9292 Actuals_To_Match := Actuals_To_Match - 1;
9293 Formals_To_Match := Formals_To_Match - 1;
9301 if Ekind (Formal) /= E_In_Parameter
9302 or else No (Default_Value (Formal))
9305 if (Comes_From_Source (S)
9306 or else Sloc (S) = Standard_Location)
9307 and then Is_Overloadable (S)
9311 (Nkind (Parent (N)) = N_Procedure_Call_Statement
9313 (Nkind (Parent (N)) = N_Function_Call
9315 Nkind (Parent (N)) = N_Parameter_Association))
9316 and then Ekind (S) /= E_Function
9318 Set_Etype (N, Etype (S));
9320 Error_Msg_Name_1 := Chars (S);
9321 Error_Msg_Sloc := Sloc (S);
9323 ("missing argument for parameter & " &
9324 "in call to % declared #", N, Formal);
9327 elsif Is_Overloadable (S) then
9328 Error_Msg_Name_1 := Chars (S);
9330 -- Point to type derivation that generated the
9333 Error_Msg_Sloc := Sloc (Parent (S));
9336 ("missing argument for parameter & " &
9337 "in call to % (inherited) #", N, Formal);
9341 ("missing argument for parameter &", N, Formal);
9349 Formals_To_Match := Formals_To_Match - 1;
9354 Next_Formal (Formal);
9357 if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
9364 -- Find some superfluous named actual that did not get
9365 -- attached to the list of associations.
9367 Actual := First (Actuals);
9368 while Present (Actual) loop
9369 if Nkind (Actual) = N_Parameter_Association
9370 and then Actual /= Last
9371 and then No (Next_Named_Actual (Actual))
9373 Error_Msg_N ("unmatched actual & in call",
9374 Selector_Name (Actual));
9385 end Normalize_Actuals;
9387 --------------------------------
9388 -- Note_Possible_Modification --
9389 --------------------------------
9391 procedure Note_Possible_Modification (N : Node_Id; Sure : Boolean) is
9392 Modification_Comes_From_Source : constant Boolean :=
9393 Comes_From_Source (Parent (N));
9399 -- Loop to find referenced entity, if there is one
9406 if Is_Entity_Name (Exp) then
9407 Ent := Entity (Exp);
9409 -- If the entity is missing, it is an undeclared identifier,
9410 -- and there is nothing to annotate.
9416 elsif Nkind (Exp) = N_Explicit_Dereference then
9418 P : constant Node_Id := Prefix (Exp);
9421 if Nkind (P) = N_Selected_Component
9423 Entry_Formal (Entity (Selector_Name (P))))
9425 -- Case of a reference to an entry formal
9427 Ent := Entry_Formal (Entity (Selector_Name (P)));
9429 elsif Nkind (P) = N_Identifier
9430 and then Nkind (Parent (Entity (P))) = N_Object_Declaration
9431 and then Present (Expression (Parent (Entity (P))))
9432 and then Nkind (Expression (Parent (Entity (P))))
9435 -- Case of a reference to a value on which side effects have
9438 Exp := Prefix (Expression (Parent (Entity (P))));
9447 elsif Nkind (Exp) = N_Type_Conversion
9448 or else Nkind (Exp) = N_Unchecked_Type_Conversion
9450 Exp := Expression (Exp);
9453 elsif Nkind (Exp) = N_Slice
9454 or else Nkind (Exp) = N_Indexed_Component
9455 or else Nkind (Exp) = N_Selected_Component
9457 Exp := Prefix (Exp);
9464 -- Now look for entity being referenced
9466 if Present (Ent) then
9467 if Is_Object (Ent) then
9468 if Comes_From_Source (Exp)
9469 or else Modification_Comes_From_Source
9471 -- Give warning if pragma unmodified given and we are
9472 -- sure this is a modification.
9474 if Has_Pragma_Unmodified (Ent) and then Sure then
9475 Error_Msg_NE ("?pragma Unmodified given for &!", N, Ent);
9478 Set_Never_Set_In_Source (Ent, False);
9481 Set_Is_True_Constant (Ent, False);
9482 Set_Current_Value (Ent, Empty);
9483 Set_Is_Known_Null (Ent, False);
9485 if not Can_Never_Be_Null (Ent) then
9486 Set_Is_Known_Non_Null (Ent, False);
9489 -- Follow renaming chain
9491 if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
9492 and then Present (Renamed_Object (Ent))
9494 Exp := Renamed_Object (Ent);
9498 -- Generate a reference only if the assignment comes from
9499 -- source. This excludes, for example, calls to a dispatching
9500 -- assignment operation when the left-hand side is tagged.
9502 if Modification_Comes_From_Source then
9503 Generate_Reference (Ent, Exp, 'm');
9506 Check_Nested_Access (Ent);
9511 -- If we are sure this is a modification from source, and we know
9512 -- this modifies a constant, then give an appropriate warning.
9514 if Overlays_Constant (Ent)
9515 and then Modification_Comes_From_Source
9519 A : constant Node_Id := Address_Clause (Ent);
9523 Exp : constant Node_Id := Expression (A);
9525 if Nkind (Exp) = N_Attribute_Reference
9526 and then Attribute_Name (Exp) = Name_Address
9527 and then Is_Entity_Name (Prefix (Exp))
9529 Error_Msg_Sloc := Sloc (A);
9531 ("constant& may be modified via address clause#?",
9532 N, Entity (Prefix (Exp)));
9542 end Note_Possible_Modification;
9544 -------------------------
9545 -- Object_Access_Level --
9546 -------------------------
9548 function Object_Access_Level (Obj : Node_Id) return Uint is
9551 -- Returns the static accessibility level of the view denoted by Obj. Note
9552 -- that the value returned is the result of a call to Scope_Depth. Only
9553 -- scope depths associated with dynamic scopes can actually be returned.
9554 -- Since only relative levels matter for accessibility checking, the fact
9555 -- that the distance between successive levels of accessibility is not
9556 -- always one is immaterial (invariant: if level(E2) is deeper than
9557 -- level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
9559 function Reference_To (Obj : Node_Id) return Node_Id;
9560 -- An explicit dereference is created when removing side-effects from
9561 -- expressions for constraint checking purposes. In this case a local
9562 -- access type is created for it. The correct access level is that of
9563 -- the original source node. We detect this case by noting that the
9564 -- prefix of the dereference is created by an object declaration whose
9565 -- initial expression is a reference.
9571 function Reference_To (Obj : Node_Id) return Node_Id is
9572 Pref : constant Node_Id := Prefix (Obj);
9574 if Is_Entity_Name (Pref)
9575 and then Nkind (Parent (Entity (Pref))) = N_Object_Declaration
9576 and then Present (Expression (Parent (Entity (Pref))))
9577 and then Nkind (Expression (Parent (Entity (Pref)))) = N_Reference
9579 return (Prefix (Expression (Parent (Entity (Pref)))));
9585 -- Start of processing for Object_Access_Level
9588 if Is_Entity_Name (Obj) then
9591 if Is_Prival (E) then
9592 E := Prival_Link (E);
9595 -- If E is a type then it denotes a current instance. For this case
9596 -- we add one to the normal accessibility level of the type to ensure
9597 -- that current instances are treated as always being deeper than
9598 -- than the level of any visible named access type (see 3.10.2(21)).
9601 return Type_Access_Level (E) + 1;
9603 elsif Present (Renamed_Object (E)) then
9604 return Object_Access_Level (Renamed_Object (E));
9606 -- Similarly, if E is a component of the current instance of a
9607 -- protected type, any instance of it is assumed to be at a deeper
9608 -- level than the type. For a protected object (whose type is an
9609 -- anonymous protected type) its components are at the same level
9610 -- as the type itself.
9612 elsif not Is_Overloadable (E)
9613 and then Ekind (Scope (E)) = E_Protected_Type
9614 and then Comes_From_Source (Scope (E))
9616 return Type_Access_Level (Scope (E)) + 1;
9619 return Scope_Depth (Enclosing_Dynamic_Scope (E));
9622 elsif Nkind (Obj) = N_Selected_Component then
9623 if Is_Access_Type (Etype (Prefix (Obj))) then
9624 return Type_Access_Level (Etype (Prefix (Obj)));
9626 return Object_Access_Level (Prefix (Obj));
9629 elsif Nkind (Obj) = N_Indexed_Component then
9630 if Is_Access_Type (Etype (Prefix (Obj))) then
9631 return Type_Access_Level (Etype (Prefix (Obj)));
9633 return Object_Access_Level (Prefix (Obj));
9636 elsif Nkind (Obj) = N_Explicit_Dereference then
9638 -- If the prefix is a selected access discriminant then we make a
9639 -- recursive call on the prefix, which will in turn check the level
9640 -- of the prefix object of the selected discriminant.
9642 if Nkind (Prefix (Obj)) = N_Selected_Component
9643 and then Ekind (Etype (Prefix (Obj))) = E_Anonymous_Access_Type
9645 Ekind (Entity (Selector_Name (Prefix (Obj)))) = E_Discriminant
9647 return Object_Access_Level (Prefix (Obj));
9649 elsif not (Comes_From_Source (Obj)) then
9651 Ref : constant Node_Id := Reference_To (Obj);
9653 if Present (Ref) then
9654 return Object_Access_Level (Ref);
9656 return Type_Access_Level (Etype (Prefix (Obj)));
9661 return Type_Access_Level (Etype (Prefix (Obj)));
9664 elsif Nkind (Obj) = N_Type_Conversion
9665 or else Nkind (Obj) = N_Unchecked_Type_Conversion
9667 return Object_Access_Level (Expression (Obj));
9669 elsif Nkind (Obj) = N_Function_Call then
9671 -- Function results are objects, so we get either the access level of
9672 -- the function or, in the case of an indirect call, the level of the
9673 -- access-to-subprogram type. (This code is used for Ada 95, but it
9674 -- looks wrong, because it seems that we should be checking the level
9675 -- of the call itself, even for Ada 95. However, using the Ada 2005
9676 -- version of the code causes regressions in several tests that are
9677 -- compiled with -gnat95. ???)
9679 if Ada_Version < Ada_2005 then
9680 if Is_Entity_Name (Name (Obj)) then
9681 return Subprogram_Access_Level (Entity (Name (Obj)));
9683 return Type_Access_Level (Etype (Prefix (Name (Obj))));
9686 -- For Ada 2005, the level of the result object of a function call is
9687 -- defined to be the level of the call's innermost enclosing master.
9688 -- We determine that by querying the depth of the innermost enclosing
9692 Return_Master_Scope_Depth_Of_Call : declare
9694 function Innermost_Master_Scope_Depth
9695 (N : Node_Id) return Uint;
9696 -- Returns the scope depth of the given node's innermost
9697 -- enclosing dynamic scope (effectively the accessibility
9698 -- level of the innermost enclosing master).
9700 ----------------------------------
9701 -- Innermost_Master_Scope_Depth --
9702 ----------------------------------
9704 function Innermost_Master_Scope_Depth
9705 (N : Node_Id) return Uint
9707 Node_Par : Node_Id := Parent (N);
9710 -- Locate the nearest enclosing node (by traversing Parents)
9711 -- that Defining_Entity can be applied to, and return the
9712 -- depth of that entity's nearest enclosing dynamic scope.
9714 while Present (Node_Par) loop
9715 case Nkind (Node_Par) is
9716 when N_Component_Declaration |
9717 N_Entry_Declaration |
9718 N_Formal_Object_Declaration |
9719 N_Formal_Type_Declaration |
9720 N_Full_Type_Declaration |
9721 N_Incomplete_Type_Declaration |
9722 N_Loop_Parameter_Specification |
9723 N_Object_Declaration |
9724 N_Protected_Type_Declaration |
9725 N_Private_Extension_Declaration |
9726 N_Private_Type_Declaration |
9727 N_Subtype_Declaration |
9728 N_Function_Specification |
9729 N_Procedure_Specification |
9730 N_Task_Type_Declaration |
9732 N_Generic_Instantiation |
9734 N_Implicit_Label_Declaration |
9735 N_Package_Declaration |
9736 N_Single_Task_Declaration |
9737 N_Subprogram_Declaration |
9738 N_Generic_Declaration |
9739 N_Renaming_Declaration |
9741 N_Formal_Subprogram_Declaration |
9742 N_Abstract_Subprogram_Declaration |
9744 N_Exception_Declaration |
9745 N_Formal_Package_Declaration |
9746 N_Number_Declaration |
9747 N_Package_Specification |
9748 N_Parameter_Specification |
9749 N_Single_Protected_Declaration |
9753 (Nearest_Dynamic_Scope
9754 (Defining_Entity (Node_Par)));
9760 Node_Par := Parent (Node_Par);
9763 pragma Assert (False);
9765 -- Should never reach the following return
9767 return Scope_Depth (Current_Scope) + 1;
9768 end Innermost_Master_Scope_Depth;
9770 -- Start of processing for Return_Master_Scope_Depth_Of_Call
9773 return Innermost_Master_Scope_Depth (Obj);
9774 end Return_Master_Scope_Depth_Of_Call;
9777 -- For convenience we handle qualified expressions, even though
9778 -- they aren't technically object names.
9780 elsif Nkind (Obj) = N_Qualified_Expression then
9781 return Object_Access_Level (Expression (Obj));
9783 -- Otherwise return the scope level of Standard.
9784 -- (If there are cases that fall through
9785 -- to this point they will be treated as
9786 -- having global accessibility for now. ???)
9789 return Scope_Depth (Standard_Standard);
9791 end Object_Access_Level;
9793 -----------------------
9794 -- Private_Component --
9795 -----------------------
9797 function Private_Component (Type_Id : Entity_Id) return Entity_Id is
9798 Ancestor : constant Entity_Id := Base_Type (Type_Id);
9800 function Trace_Components
9802 Check : Boolean) return Entity_Id;
9803 -- Recursive function that does the work, and checks against circular
9804 -- definition for each subcomponent type.
9806 ----------------------
9807 -- Trace_Components --
9808 ----------------------
9810 function Trace_Components
9812 Check : Boolean) return Entity_Id
9814 Btype : constant Entity_Id := Base_Type (T);
9815 Component : Entity_Id;
9817 Candidate : Entity_Id := Empty;
9820 if Check and then Btype = Ancestor then
9821 Error_Msg_N ("circular type definition", Type_Id);
9825 if Is_Private_Type (Btype)
9826 and then not Is_Generic_Type (Btype)
9828 if Present (Full_View (Btype))
9829 and then Is_Record_Type (Full_View (Btype))
9830 and then not Is_Frozen (Btype)
9832 -- To indicate that the ancestor depends on a private type, the
9833 -- current Btype is sufficient. However, to check for circular
9834 -- definition we must recurse on the full view.
9836 Candidate := Trace_Components (Full_View (Btype), True);
9838 if Candidate = Any_Type then
9848 elsif Is_Array_Type (Btype) then
9849 return Trace_Components (Component_Type (Btype), True);
9851 elsif Is_Record_Type (Btype) then
9852 Component := First_Entity (Btype);
9853 while Present (Component) loop
9855 -- Skip anonymous types generated by constrained components
9857 if not Is_Type (Component) then
9858 P := Trace_Components (Etype (Component), True);
9861 if P = Any_Type then
9869 Next_Entity (Component);
9877 end Trace_Components;
9879 -- Start of processing for Private_Component
9882 return Trace_Components (Type_Id, False);
9883 end Private_Component;
9885 ---------------------------
9886 -- Primitive_Names_Match --
9887 ---------------------------
9889 function Primitive_Names_Match (E1, E2 : Entity_Id) return Boolean is
9891 function Non_Internal_Name (E : Entity_Id) return Name_Id;
9892 -- Given an internal name, returns the corresponding non-internal name
9894 ------------------------
9895 -- Non_Internal_Name --
9896 ------------------------
9898 function Non_Internal_Name (E : Entity_Id) return Name_Id is
9900 Get_Name_String (Chars (E));
9901 Name_Len := Name_Len - 1;
9903 end Non_Internal_Name;
9905 -- Start of processing for Primitive_Names_Match
9908 pragma Assert (Present (E1) and then Present (E2));
9910 return Chars (E1) = Chars (E2)
9912 (not Is_Internal_Name (Chars (E1))
9913 and then Is_Internal_Name (Chars (E2))
9914 and then Non_Internal_Name (E2) = Chars (E1))
9916 (not Is_Internal_Name (Chars (E2))
9917 and then Is_Internal_Name (Chars (E1))
9918 and then Non_Internal_Name (E1) = Chars (E2))
9920 (Is_Predefined_Dispatching_Operation (E1)
9921 and then Is_Predefined_Dispatching_Operation (E2)
9922 and then Same_TSS (E1, E2))
9924 (Is_Init_Proc (E1) and then Is_Init_Proc (E2));
9925 end Primitive_Names_Match;
9927 -----------------------
9928 -- Process_End_Label --
9929 -----------------------
9931 procedure Process_End_Label
9940 Label_Ref : Boolean;
9941 -- Set True if reference to end label itself is required
9944 -- Gets set to the operator symbol or identifier that references the
9945 -- entity Ent. For the child unit case, this is the identifier from the
9946 -- designator. For other cases, this is simply Endl.
9948 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id);
9949 -- N is an identifier node that appears as a parent unit reference in
9950 -- the case where Ent is a child unit. This procedure generates an
9951 -- appropriate cross-reference entry. E is the corresponding entity.
9953 -------------------------
9954 -- Generate_Parent_Ref --
9955 -------------------------
9957 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id) is
9959 -- If names do not match, something weird, skip reference
9961 if Chars (E) = Chars (N) then
9963 -- Generate the reference. We do NOT consider this as a reference
9964 -- for unreferenced symbol purposes.
9966 Generate_Reference (E, N, 'r', Set_Ref => False, Force => True);
9969 Style.Check_Identifier (N, E);
9972 end Generate_Parent_Ref;
9974 -- Start of processing for Process_End_Label
9977 -- If no node, ignore. This happens in some error situations, and
9978 -- also for some internally generated structures where no end label
9979 -- references are required in any case.
9985 -- Nothing to do if no End_Label, happens for internally generated
9986 -- constructs where we don't want an end label reference anyway. Also
9987 -- nothing to do if Endl is a string literal, which means there was
9988 -- some prior error (bad operator symbol)
9990 Endl := End_Label (N);
9992 if No (Endl) or else Nkind (Endl) = N_String_Literal then
9996 -- Reference node is not in extended main source unit
9998 if not In_Extended_Main_Source_Unit (N) then
10000 -- Generally we do not collect references except for the extended
10001 -- main source unit. The one exception is the 'e' entry for a
10002 -- package spec, where it is useful for a client to have the
10003 -- ending information to define scopes.
10009 Label_Ref := False;
10011 -- For this case, we can ignore any parent references, but we
10012 -- need the package name itself for the 'e' entry.
10014 if Nkind (Endl) = N_Designator then
10015 Endl := Identifier (Endl);
10019 -- Reference is in extended main source unit
10024 -- For designator, generate references for the parent entries
10026 if Nkind (Endl) = N_Designator then
10028 -- Generate references for the prefix if the END line comes from
10029 -- source (otherwise we do not need these references) We climb the
10030 -- scope stack to find the expected entities.
10032 if Comes_From_Source (Endl) then
10033 Nam := Name (Endl);
10034 Scop := Current_Scope;
10035 while Nkind (Nam) = N_Selected_Component loop
10036 Scop := Scope (Scop);
10037 exit when No (Scop);
10038 Generate_Parent_Ref (Selector_Name (Nam), Scop);
10039 Nam := Prefix (Nam);
10042 if Present (Scop) then
10043 Generate_Parent_Ref (Nam, Scope (Scop));
10047 Endl := Identifier (Endl);
10051 -- If the end label is not for the given entity, then either we have
10052 -- some previous error, or this is a generic instantiation for which
10053 -- we do not need to make a cross-reference in this case anyway. In
10054 -- either case we simply ignore the call.
10056 if Chars (Ent) /= Chars (Endl) then
10060 -- If label was really there, then generate a normal reference and then
10061 -- adjust the location in the end label to point past the name (which
10062 -- should almost always be the semicolon).
10064 Loc := Sloc (Endl);
10066 if Comes_From_Source (Endl) then
10068 -- If a label reference is required, then do the style check and
10069 -- generate an l-type cross-reference entry for the label
10072 if Style_Check then
10073 Style.Check_Identifier (Endl, Ent);
10076 Generate_Reference (Ent, Endl, 'l', Set_Ref => False);
10079 -- Set the location to point past the label (normally this will
10080 -- mean the semicolon immediately following the label). This is
10081 -- done for the sake of the 'e' or 't' entry generated below.
10083 Get_Decoded_Name_String (Chars (Endl));
10084 Set_Sloc (Endl, Sloc (Endl) + Source_Ptr (Name_Len));
10087 -- Now generate the e/t reference
10089 Generate_Reference (Ent, Endl, Typ, Set_Ref => False, Force => True);
10091 -- Restore Sloc, in case modified above, since we have an identifier
10092 -- and the normal Sloc should be left set in the tree.
10094 Set_Sloc (Endl, Loc);
10095 end Process_End_Label;
10101 -- We do the conversion to get the value of the real string by using
10102 -- the scanner, see Sinput for details on use of the internal source
10103 -- buffer for scanning internal strings.
10105 function Real_Convert (S : String) return Node_Id is
10106 Save_Src : constant Source_Buffer_Ptr := Source;
10107 Negative : Boolean;
10110 Source := Internal_Source_Ptr;
10113 for J in S'Range loop
10114 Source (Source_Ptr (J)) := S (J);
10117 Source (S'Length + 1) := EOF;
10119 if Source (Scan_Ptr) = '-' then
10121 Scan_Ptr := Scan_Ptr + 1;
10129 Set_Realval (Token_Node, UR_Negate (Realval (Token_Node)));
10132 Source := Save_Src;
10136 ------------------------------------
10137 -- References_Generic_Formal_Type --
10138 ------------------------------------
10140 function References_Generic_Formal_Type (N : Node_Id) return Boolean is
10142 function Process (N : Node_Id) return Traverse_Result;
10143 -- Process one node in search for generic formal type
10149 function Process (N : Node_Id) return Traverse_Result is
10151 if Nkind (N) in N_Has_Entity then
10153 E : constant Entity_Id := Entity (N);
10155 if Present (E) then
10156 if Is_Generic_Type (E) then
10158 elsif Present (Etype (E))
10159 and then Is_Generic_Type (Etype (E))
10170 function Traverse is new Traverse_Func (Process);
10171 -- Traverse tree to look for generic type
10174 if Inside_A_Generic then
10175 return Traverse (N) = Abandon;
10179 end References_Generic_Formal_Type;
10181 --------------------
10182 -- Remove_Homonym --
10183 --------------------
10185 procedure Remove_Homonym (E : Entity_Id) is
10186 Prev : Entity_Id := Empty;
10190 if E = Current_Entity (E) then
10191 if Present (Homonym (E)) then
10192 Set_Current_Entity (Homonym (E));
10194 Set_Name_Entity_Id (Chars (E), Empty);
10197 H := Current_Entity (E);
10198 while Present (H) and then H /= E loop
10203 Set_Homonym (Prev, Homonym (E));
10205 end Remove_Homonym;
10207 ---------------------
10208 -- Rep_To_Pos_Flag --
10209 ---------------------
10211 function Rep_To_Pos_Flag (E : Entity_Id; Loc : Source_Ptr) return Node_Id is
10213 return New_Occurrence_Of
10214 (Boolean_Literals (not Range_Checks_Suppressed (E)), Loc);
10215 end Rep_To_Pos_Flag;
10217 --------------------
10218 -- Require_Entity --
10219 --------------------
10221 procedure Require_Entity (N : Node_Id) is
10223 if Is_Entity_Name (N) and then No (Entity (N)) then
10224 if Total_Errors_Detected /= 0 then
10225 Set_Entity (N, Any_Id);
10227 raise Program_Error;
10230 end Require_Entity;
10232 ------------------------------
10233 -- Requires_Transient_Scope --
10234 ------------------------------
10236 -- A transient scope is required when variable-sized temporaries are
10237 -- allocated in the primary or secondary stack, or when finalization
10238 -- actions must be generated before the next instruction.
10240 function Requires_Transient_Scope (Id : Entity_Id) return Boolean is
10241 Typ : constant Entity_Id := Underlying_Type (Id);
10243 -- Start of processing for Requires_Transient_Scope
10246 -- This is a private type which is not completed yet. This can only
10247 -- happen in a default expression (of a formal parameter or of a
10248 -- record component). Do not expand transient scope in this case
10253 -- Do not expand transient scope for non-existent procedure return
10255 elsif Typ = Standard_Void_Type then
10258 -- Elementary types do not require a transient scope
10260 elsif Is_Elementary_Type (Typ) then
10263 -- Generally, indefinite subtypes require a transient scope, since the
10264 -- back end cannot generate temporaries, since this is not a valid type
10265 -- for declaring an object. It might be possible to relax this in the
10266 -- future, e.g. by declaring the maximum possible space for the type.
10268 elsif Is_Indefinite_Subtype (Typ) then
10271 -- Functions returning tagged types may dispatch on result so their
10272 -- returned value is allocated on the secondary stack. Controlled
10273 -- type temporaries need finalization.
10275 elsif Is_Tagged_Type (Typ)
10276 or else Has_Controlled_Component (Typ)
10278 return not Is_Value_Type (Typ);
10282 elsif Is_Record_Type (Typ) then
10286 Comp := First_Entity (Typ);
10287 while Present (Comp) loop
10288 if Ekind (Comp) = E_Component
10289 and then Requires_Transient_Scope (Etype (Comp))
10293 Next_Entity (Comp);
10300 -- String literal types never require transient scope
10302 elsif Ekind (Typ) = E_String_Literal_Subtype then
10305 -- Array type. Note that we already know that this is a constrained
10306 -- array, since unconstrained arrays will fail the indefinite test.
10308 elsif Is_Array_Type (Typ) then
10310 -- If component type requires a transient scope, the array does too
10312 if Requires_Transient_Scope (Component_Type (Typ)) then
10315 -- Otherwise, we only need a transient scope if the size is not
10316 -- known at compile time.
10319 return not Size_Known_At_Compile_Time (Typ);
10322 -- All other cases do not require a transient scope
10327 end Requires_Transient_Scope;
10329 --------------------------
10330 -- Reset_Analyzed_Flags --
10331 --------------------------
10333 procedure Reset_Analyzed_Flags (N : Node_Id) is
10335 function Clear_Analyzed (N : Node_Id) return Traverse_Result;
10336 -- Function used to reset Analyzed flags in tree. Note that we do
10337 -- not reset Analyzed flags in entities, since there is no need to
10338 -- reanalyze entities, and indeed, it is wrong to do so, since it
10339 -- can result in generating auxiliary stuff more than once.
10341 --------------------
10342 -- Clear_Analyzed --
10343 --------------------
10345 function Clear_Analyzed (N : Node_Id) return Traverse_Result is
10347 if not Has_Extension (N) then
10348 Set_Analyzed (N, False);
10352 end Clear_Analyzed;
10354 procedure Reset_Analyzed is new Traverse_Proc (Clear_Analyzed);
10356 -- Start of processing for Reset_Analyzed_Flags
10359 Reset_Analyzed (N);
10360 end Reset_Analyzed_Flags;
10362 ---------------------------
10363 -- Safe_To_Capture_Value --
10364 ---------------------------
10366 function Safe_To_Capture_Value
10369 Cond : Boolean := False) return Boolean
10372 -- The only entities for which we track constant values are variables
10373 -- which are not renamings, constants, out parameters, and in out
10374 -- parameters, so check if we have this case.
10376 -- Note: it may seem odd to track constant values for constants, but in
10377 -- fact this routine is used for other purposes than simply capturing
10378 -- the value. In particular, the setting of Known[_Non]_Null.
10380 if (Ekind (Ent) = E_Variable and then No (Renamed_Object (Ent)))
10382 Ekind (Ent) = E_Constant
10384 Ekind (Ent) = E_Out_Parameter
10386 Ekind (Ent) = E_In_Out_Parameter
10390 -- For conditionals, we also allow loop parameters and all formals,
10391 -- including in parameters.
10395 (Ekind (Ent) = E_Loop_Parameter
10397 Ekind (Ent) = E_In_Parameter)
10401 -- For all other cases, not just unsafe, but impossible to capture
10402 -- Current_Value, since the above are the only entities which have
10403 -- Current_Value fields.
10409 -- Skip if volatile or aliased, since funny things might be going on in
10410 -- these cases which we cannot necessarily track. Also skip any variable
10411 -- for which an address clause is given, or whose address is taken. Also
10412 -- never capture value of library level variables (an attempt to do so
10413 -- can occur in the case of package elaboration code).
10415 if Treat_As_Volatile (Ent)
10416 or else Is_Aliased (Ent)
10417 or else Present (Address_Clause (Ent))
10418 or else Address_Taken (Ent)
10419 or else (Is_Library_Level_Entity (Ent)
10420 and then Ekind (Ent) = E_Variable)
10425 -- OK, all above conditions are met. We also require that the scope of
10426 -- the reference be the same as the scope of the entity, not counting
10427 -- packages and blocks and loops.
10430 E_Scope : constant Entity_Id := Scope (Ent);
10431 R_Scope : Entity_Id;
10434 R_Scope := Current_Scope;
10435 while R_Scope /= Standard_Standard loop
10436 exit when R_Scope = E_Scope;
10438 if not Ekind_In (R_Scope, E_Package, E_Block, E_Loop) then
10441 R_Scope := Scope (R_Scope);
10446 -- We also require that the reference does not appear in a context
10447 -- where it is not sure to be executed (i.e. a conditional context
10448 -- or an exception handler). We skip this if Cond is True, since the
10449 -- capturing of values from conditional tests handles this ok.
10463 while Present (P) loop
10464 if Nkind (P) = N_If_Statement
10465 or else Nkind (P) = N_Case_Statement
10466 or else (Nkind (P) in N_Short_Circuit
10467 and then Desc = Right_Opnd (P))
10468 or else (Nkind (P) = N_Conditional_Expression
10469 and then Desc /= First (Expressions (P)))
10470 or else Nkind (P) = N_Exception_Handler
10471 or else Nkind (P) = N_Selective_Accept
10472 or else Nkind (P) = N_Conditional_Entry_Call
10473 or else Nkind (P) = N_Timed_Entry_Call
10474 or else Nkind (P) = N_Asynchronous_Select
10484 -- OK, looks safe to set value
10487 end Safe_To_Capture_Value;
10493 function Same_Name (N1, N2 : Node_Id) return Boolean is
10494 K1 : constant Node_Kind := Nkind (N1);
10495 K2 : constant Node_Kind := Nkind (N2);
10498 if (K1 = N_Identifier or else K1 = N_Defining_Identifier)
10499 and then (K2 = N_Identifier or else K2 = N_Defining_Identifier)
10501 return Chars (N1) = Chars (N2);
10503 elsif (K1 = N_Selected_Component or else K1 = N_Expanded_Name)
10504 and then (K2 = N_Selected_Component or else K2 = N_Expanded_Name)
10506 return Same_Name (Selector_Name (N1), Selector_Name (N2))
10507 and then Same_Name (Prefix (N1), Prefix (N2));
10518 function Same_Object (Node1, Node2 : Node_Id) return Boolean is
10519 N1 : constant Node_Id := Original_Node (Node1);
10520 N2 : constant Node_Id := Original_Node (Node2);
10521 -- We do the tests on original nodes, since we are most interested
10522 -- in the original source, not any expansion that got in the way.
10524 K1 : constant Node_Kind := Nkind (N1);
10525 K2 : constant Node_Kind := Nkind (N2);
10528 -- First case, both are entities with same entity
10530 if K1 in N_Has_Entity and then K2 in N_Has_Entity then
10532 EN1 : constant Entity_Id := Entity (N1);
10533 EN2 : constant Entity_Id := Entity (N2);
10535 if Present (EN1) and then Present (EN2)
10536 and then (Ekind_In (EN1, E_Variable, E_Constant)
10537 or else Is_Formal (EN1))
10545 -- Second case, selected component with same selector, same record
10547 if K1 = N_Selected_Component
10548 and then K2 = N_Selected_Component
10549 and then Chars (Selector_Name (N1)) = Chars (Selector_Name (N2))
10551 return Same_Object (Prefix (N1), Prefix (N2));
10553 -- Third case, indexed component with same subscripts, same array
10555 elsif K1 = N_Indexed_Component
10556 and then K2 = N_Indexed_Component
10557 and then Same_Object (Prefix (N1), Prefix (N2))
10562 E1 := First (Expressions (N1));
10563 E2 := First (Expressions (N2));
10564 while Present (E1) loop
10565 if not Same_Value (E1, E2) then
10576 -- Fourth case, slice of same array with same bounds
10579 and then K2 = N_Slice
10580 and then Nkind (Discrete_Range (N1)) = N_Range
10581 and then Nkind (Discrete_Range (N2)) = N_Range
10582 and then Same_Value (Low_Bound (Discrete_Range (N1)),
10583 Low_Bound (Discrete_Range (N2)))
10584 and then Same_Value (High_Bound (Discrete_Range (N1)),
10585 High_Bound (Discrete_Range (N2)))
10587 return Same_Name (Prefix (N1), Prefix (N2));
10589 -- All other cases, not clearly the same object
10600 function Same_Type (T1, T2 : Entity_Id) return Boolean is
10605 elsif not Is_Constrained (T1)
10606 and then not Is_Constrained (T2)
10607 and then Base_Type (T1) = Base_Type (T2)
10611 -- For now don't bother with case of identical constraints, to be
10612 -- fiddled with later on perhaps (this is only used for optimization
10613 -- purposes, so it is not critical to do a best possible job)
10624 function Same_Value (Node1, Node2 : Node_Id) return Boolean is
10626 if Compile_Time_Known_Value (Node1)
10627 and then Compile_Time_Known_Value (Node2)
10628 and then Expr_Value (Node1) = Expr_Value (Node2)
10631 elsif Same_Object (Node1, Node2) then
10642 procedure Save_Actual (N : Node_Id; Writable : Boolean := False) is
10644 if Is_Entity_Name (N)
10646 Nkind_In (N, N_Indexed_Component, N_Selected_Component, N_Slice)
10648 (Nkind (N) = N_Attribute_Reference
10649 and then Attribute_Name (N) = Name_Access)
10652 -- We are only interested in IN OUT parameters of inner calls
10655 or else Nkind (Parent (N)) = N_Function_Call
10656 or else Nkind (Parent (N)) in N_Op
10658 Actuals_In_Call.Increment_Last;
10659 Actuals_In_Call.Table (Actuals_In_Call.Last) := (N, Writable);
10664 ------------------------
10665 -- Scope_Is_Transient --
10666 ------------------------
10668 function Scope_Is_Transient return Boolean is
10670 return Scope_Stack.Table (Scope_Stack.Last).Is_Transient;
10671 end Scope_Is_Transient;
10677 function Scope_Within (Scope1, Scope2 : Entity_Id) return Boolean is
10682 while Scop /= Standard_Standard loop
10683 Scop := Scope (Scop);
10685 if Scop = Scope2 then
10693 --------------------------
10694 -- Scope_Within_Or_Same --
10695 --------------------------
10697 function Scope_Within_Or_Same (Scope1, Scope2 : Entity_Id) return Boolean is
10702 while Scop /= Standard_Standard loop
10703 if Scop = Scope2 then
10706 Scop := Scope (Scop);
10711 end Scope_Within_Or_Same;
10713 --------------------
10714 -- Set_Convention --
10715 --------------------
10717 procedure Set_Convention (E : Entity_Id; Val : Snames.Convention_Id) is
10719 Basic_Set_Convention (E, Val);
10722 and then Is_Access_Subprogram_Type (Base_Type (E))
10723 and then Has_Foreign_Convention (E)
10725 Set_Can_Use_Internal_Rep (E, False);
10727 end Set_Convention;
10729 ------------------------
10730 -- Set_Current_Entity --
10731 ------------------------
10733 -- The given entity is to be set as the currently visible definition
10734 -- of its associated name (i.e. the Node_Id associated with its name).
10735 -- All we have to do is to get the name from the identifier, and
10736 -- then set the associated Node_Id to point to the given entity.
10738 procedure Set_Current_Entity (E : Entity_Id) is
10740 Set_Name_Entity_Id (Chars (E), E);
10741 end Set_Current_Entity;
10743 ---------------------------
10744 -- Set_Debug_Info_Needed --
10745 ---------------------------
10747 procedure Set_Debug_Info_Needed (T : Entity_Id) is
10749 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id);
10750 pragma Inline (Set_Debug_Info_Needed_If_Not_Set);
10751 -- Used to set debug info in a related node if not set already
10753 --------------------------------------
10754 -- Set_Debug_Info_Needed_If_Not_Set --
10755 --------------------------------------
10757 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id) is
10760 and then not Needs_Debug_Info (E)
10762 Set_Debug_Info_Needed (E);
10764 -- For a private type, indicate that the full view also needs
10765 -- debug information.
10768 and then Is_Private_Type (E)
10769 and then Present (Full_View (E))
10771 Set_Debug_Info_Needed (Full_View (E));
10774 end Set_Debug_Info_Needed_If_Not_Set;
10776 -- Start of processing for Set_Debug_Info_Needed
10779 -- Nothing to do if argument is Empty or has Debug_Info_Off set, which
10780 -- indicates that Debug_Info_Needed is never required for the entity.
10783 or else Debug_Info_Off (T)
10788 -- Set flag in entity itself. Note that we will go through the following
10789 -- circuitry even if the flag is already set on T. That's intentional,
10790 -- it makes sure that the flag will be set in subsidiary entities.
10792 Set_Needs_Debug_Info (T);
10794 -- Set flag on subsidiary entities if not set already
10796 if Is_Object (T) then
10797 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
10799 elsif Is_Type (T) then
10800 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
10802 if Is_Record_Type (T) then
10804 Ent : Entity_Id := First_Entity (T);
10806 while Present (Ent) loop
10807 Set_Debug_Info_Needed_If_Not_Set (Ent);
10812 -- For a class wide subtype, we also need debug information
10813 -- for the equivalent type.
10815 if Ekind (T) = E_Class_Wide_Subtype then
10816 Set_Debug_Info_Needed_If_Not_Set (Equivalent_Type (T));
10819 elsif Is_Array_Type (T) then
10820 Set_Debug_Info_Needed_If_Not_Set (Component_Type (T));
10823 Indx : Node_Id := First_Index (T);
10825 while Present (Indx) loop
10826 Set_Debug_Info_Needed_If_Not_Set (Etype (Indx));
10827 Indx := Next_Index (Indx);
10831 if Is_Packed (T) then
10832 Set_Debug_Info_Needed_If_Not_Set (Packed_Array_Type (T));
10835 elsif Is_Access_Type (T) then
10836 Set_Debug_Info_Needed_If_Not_Set (Directly_Designated_Type (T));
10838 elsif Is_Private_Type (T) then
10839 Set_Debug_Info_Needed_If_Not_Set (Full_View (T));
10841 elsif Is_Protected_Type (T) then
10842 Set_Debug_Info_Needed_If_Not_Set (Corresponding_Record_Type (T));
10845 end Set_Debug_Info_Needed;
10847 ---------------------------------
10848 -- Set_Entity_With_Style_Check --
10849 ---------------------------------
10851 procedure Set_Entity_With_Style_Check (N : Node_Id; Val : Entity_Id) is
10852 Val_Actual : Entity_Id;
10856 Set_Entity (N, Val);
10859 and then not Suppress_Style_Checks (Val)
10860 and then not In_Instance
10862 if Nkind (N) = N_Identifier then
10864 elsif Nkind (N) = N_Expanded_Name then
10865 Nod := Selector_Name (N);
10870 -- A special situation arises for derived operations, where we want
10871 -- to do the check against the parent (since the Sloc of the derived
10872 -- operation points to the derived type declaration itself).
10875 while not Comes_From_Source (Val_Actual)
10876 and then Nkind (Val_Actual) in N_Entity
10877 and then (Ekind (Val_Actual) = E_Enumeration_Literal
10878 or else Is_Subprogram (Val_Actual)
10879 or else Is_Generic_Subprogram (Val_Actual))
10880 and then Present (Alias (Val_Actual))
10882 Val_Actual := Alias (Val_Actual);
10885 -- Renaming declarations for generic actuals do not come from source,
10886 -- and have a different name from that of the entity they rename, so
10887 -- there is no style check to perform here.
10889 if Chars (Nod) = Chars (Val_Actual) then
10890 Style.Check_Identifier (Nod, Val_Actual);
10894 Set_Entity (N, Val);
10895 end Set_Entity_With_Style_Check;
10897 ------------------------
10898 -- Set_Name_Entity_Id --
10899 ------------------------
10901 procedure Set_Name_Entity_Id (Id : Name_Id; Val : Entity_Id) is
10903 Set_Name_Table_Info (Id, Int (Val));
10904 end Set_Name_Entity_Id;
10906 ---------------------
10907 -- Set_Next_Actual --
10908 ---------------------
10910 procedure Set_Next_Actual (Ass1_Id : Node_Id; Ass2_Id : Node_Id) is
10912 if Nkind (Parent (Ass1_Id)) = N_Parameter_Association then
10913 Set_First_Named_Actual (Parent (Ass1_Id), Ass2_Id);
10915 end Set_Next_Actual;
10917 ----------------------------------
10918 -- Set_Optimize_Alignment_Flags --
10919 ----------------------------------
10921 procedure Set_Optimize_Alignment_Flags (E : Entity_Id) is
10923 if Optimize_Alignment = 'S' then
10924 Set_Optimize_Alignment_Space (E);
10925 elsif Optimize_Alignment = 'T' then
10926 Set_Optimize_Alignment_Time (E);
10928 end Set_Optimize_Alignment_Flags;
10930 -----------------------
10931 -- Set_Public_Status --
10932 -----------------------
10934 procedure Set_Public_Status (Id : Entity_Id) is
10935 S : constant Entity_Id := Current_Scope;
10937 function Within_HSS_Or_If (E : Entity_Id) return Boolean;
10938 -- Determines if E is defined within handled statement sequence or
10939 -- an if statement, returns True if so, False otherwise.
10941 ----------------------
10942 -- Within_HSS_Or_If --
10943 ----------------------
10945 function Within_HSS_Or_If (E : Entity_Id) return Boolean is
10948 N := Declaration_Node (E);
10955 elsif Nkind_In (N, N_Handled_Sequence_Of_Statements,
10961 end Within_HSS_Or_If;
10963 -- Start of processing for Set_Public_Status
10966 -- Everything in the scope of Standard is public
10968 if S = Standard_Standard then
10969 Set_Is_Public (Id);
10971 -- Entity is definitely not public if enclosing scope is not public
10973 elsif not Is_Public (S) then
10976 -- An object or function declaration that occurs in a handled sequence
10977 -- of statements or within an if statement is the declaration for a
10978 -- temporary object or local subprogram generated by the expander. It
10979 -- never needs to be made public and furthermore, making it public can
10980 -- cause back end problems.
10982 elsif Nkind_In (Parent (Id), N_Object_Declaration,
10983 N_Function_Specification)
10984 and then Within_HSS_Or_If (Id)
10988 -- Entities in public packages or records are public
10990 elsif Ekind (S) = E_Package or Is_Record_Type (S) then
10991 Set_Is_Public (Id);
10993 -- The bounds of an entry family declaration can generate object
10994 -- declarations that are visible to the back-end, e.g. in the
10995 -- the declaration of a composite type that contains tasks.
10997 elsif Is_Concurrent_Type (S)
10998 and then not Has_Completion (S)
10999 and then Nkind (Parent (Id)) = N_Object_Declaration
11001 Set_Is_Public (Id);
11003 end Set_Public_Status;
11005 -----------------------------
11006 -- Set_Referenced_Modified --
11007 -----------------------------
11009 procedure Set_Referenced_Modified (N : Node_Id; Out_Param : Boolean) is
11013 -- Deal with indexed or selected component where prefix is modified
11015 if Nkind_In (N, N_Indexed_Component, N_Selected_Component) then
11016 Pref := Prefix (N);
11018 -- If prefix is access type, then it is the designated object that is
11019 -- being modified, which means we have no entity to set the flag on.
11021 if No (Etype (Pref)) or else Is_Access_Type (Etype (Pref)) then
11024 -- Otherwise chase the prefix
11027 Set_Referenced_Modified (Pref, Out_Param);
11030 -- Otherwise see if we have an entity name (only other case to process)
11032 elsif Is_Entity_Name (N) and then Present (Entity (N)) then
11033 Set_Referenced_As_LHS (Entity (N), not Out_Param);
11034 Set_Referenced_As_Out_Parameter (Entity (N), Out_Param);
11036 end Set_Referenced_Modified;
11038 ----------------------------
11039 -- Set_Scope_Is_Transient --
11040 ----------------------------
11042 procedure Set_Scope_Is_Transient (V : Boolean := True) is
11044 Scope_Stack.Table (Scope_Stack.Last).Is_Transient := V;
11045 end Set_Scope_Is_Transient;
11047 -------------------
11048 -- Set_Size_Info --
11049 -------------------
11051 procedure Set_Size_Info (T1, T2 : Entity_Id) is
11053 -- We copy Esize, but not RM_Size, since in general RM_Size is
11054 -- subtype specific and does not get inherited by all subtypes.
11056 Set_Esize (T1, Esize (T2));
11057 Set_Has_Biased_Representation (T1, Has_Biased_Representation (T2));
11059 if Is_Discrete_Or_Fixed_Point_Type (T1)
11061 Is_Discrete_Or_Fixed_Point_Type (T2)
11063 Set_Is_Unsigned_Type (T1, Is_Unsigned_Type (T2));
11066 Set_Alignment (T1, Alignment (T2));
11069 --------------------
11070 -- Static_Integer --
11071 --------------------
11073 function Static_Integer (N : Node_Id) return Uint is
11075 Analyze_And_Resolve (N, Any_Integer);
11078 or else Error_Posted (N)
11079 or else Etype (N) = Any_Type
11084 if Is_Static_Expression (N) then
11085 if not Raises_Constraint_Error (N) then
11086 return Expr_Value (N);
11091 elsif Etype (N) = Any_Type then
11095 Flag_Non_Static_Expr
11096 ("static integer expression required here", N);
11099 end Static_Integer;
11101 --------------------------
11102 -- Statically_Different --
11103 --------------------------
11105 function Statically_Different (E1, E2 : Node_Id) return Boolean is
11106 R1 : constant Node_Id := Get_Referenced_Object (E1);
11107 R2 : constant Node_Id := Get_Referenced_Object (E2);
11109 return Is_Entity_Name (R1)
11110 and then Is_Entity_Name (R2)
11111 and then Entity (R1) /= Entity (R2)
11112 and then not Is_Formal (Entity (R1))
11113 and then not Is_Formal (Entity (R2));
11114 end Statically_Different;
11116 -----------------------------
11117 -- Subprogram_Access_Level --
11118 -----------------------------
11120 function Subprogram_Access_Level (Subp : Entity_Id) return Uint is
11122 if Present (Alias (Subp)) then
11123 return Subprogram_Access_Level (Alias (Subp));
11125 return Scope_Depth (Enclosing_Dynamic_Scope (Subp));
11127 end Subprogram_Access_Level;
11133 procedure Trace_Scope (N : Node_Id; E : Entity_Id; Msg : String) is
11135 if Debug_Flag_W then
11136 for J in 0 .. Scope_Stack.Last loop
11141 Write_Name (Chars (E));
11142 Write_Str (" from ");
11143 Write_Location (Sloc (N));
11148 -----------------------
11149 -- Transfer_Entities --
11150 -----------------------
11152 procedure Transfer_Entities (From : Entity_Id; To : Entity_Id) is
11153 Ent : Entity_Id := First_Entity (From);
11160 if (Last_Entity (To)) = Empty then
11161 Set_First_Entity (To, Ent);
11163 Set_Next_Entity (Last_Entity (To), Ent);
11166 Set_Last_Entity (To, Last_Entity (From));
11168 while Present (Ent) loop
11169 Set_Scope (Ent, To);
11171 if not Is_Public (Ent) then
11172 Set_Public_Status (Ent);
11175 and then Ekind (Ent) = E_Record_Subtype
11178 -- The components of the propagated Itype must be public
11184 Comp := First_Entity (Ent);
11185 while Present (Comp) loop
11186 Set_Is_Public (Comp);
11187 Next_Entity (Comp);
11196 Set_First_Entity (From, Empty);
11197 Set_Last_Entity (From, Empty);
11198 end Transfer_Entities;
11200 -----------------------
11201 -- Type_Access_Level --
11202 -----------------------
11204 function Type_Access_Level (Typ : Entity_Id) return Uint is
11208 Btyp := Base_Type (Typ);
11210 -- Ada 2005 (AI-230): For most cases of anonymous access types, we
11211 -- simply use the level where the type is declared. This is true for
11212 -- stand-alone object declarations, and for anonymous access types
11213 -- associated with components the level is the same as that of the
11214 -- enclosing composite type. However, special treatment is needed for
11215 -- the cases of access parameters, return objects of an anonymous access
11216 -- type, and, in Ada 95, access discriminants of limited types.
11218 if Ekind (Btyp) in Access_Kind then
11219 if Ekind (Btyp) = E_Anonymous_Access_Type then
11221 -- If the type is a nonlocal anonymous access type (such as for
11222 -- an access parameter) we treat it as being declared at the
11223 -- library level to ensure that names such as X.all'access don't
11224 -- fail static accessibility checks.
11226 if not Is_Local_Anonymous_Access (Typ) then
11227 return Scope_Depth (Standard_Standard);
11229 -- If this is a return object, the accessibility level is that of
11230 -- the result subtype of the enclosing function. The test here is
11231 -- little complicated, because we have to account for extended
11232 -- return statements that have been rewritten as blocks, in which
11233 -- case we have to find and the Is_Return_Object attribute of the
11234 -- itype's associated object. It would be nice to find a way to
11235 -- simplify this test, but it doesn't seem worthwhile to add a new
11236 -- flag just for purposes of this test. ???
11238 elsif Ekind (Scope (Btyp)) = E_Return_Statement
11241 and then Nkind (Associated_Node_For_Itype (Btyp)) =
11242 N_Object_Declaration
11243 and then Is_Return_Object
11244 (Defining_Identifier
11245 (Associated_Node_For_Itype (Btyp))))
11251 Scop := Scope (Scope (Btyp));
11252 while Present (Scop) loop
11253 exit when Ekind (Scop) = E_Function;
11254 Scop := Scope (Scop);
11257 -- Treat the return object's type as having the level of the
11258 -- function's result subtype (as per RM05-6.5(5.3/2)).
11260 return Type_Access_Level (Etype (Scop));
11265 Btyp := Root_Type (Btyp);
11267 -- The accessibility level of anonymous access types associated with
11268 -- discriminants is that of the current instance of the type, and
11269 -- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
11271 -- AI-402: access discriminants have accessibility based on the
11272 -- object rather than the type in Ada 2005, so the above paragraph
11275 -- ??? Needs completion with rules from AI-416
11277 if Ada_Version <= Ada_95
11278 and then Ekind (Typ) = E_Anonymous_Access_Type
11279 and then Present (Associated_Node_For_Itype (Typ))
11280 and then Nkind (Associated_Node_For_Itype (Typ)) =
11281 N_Discriminant_Specification
11283 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp)) + 1;
11287 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
11288 end Type_Access_Level;
11290 --------------------------
11291 -- Unit_Declaration_Node --
11292 --------------------------
11294 function Unit_Declaration_Node (Unit_Id : Entity_Id) return Node_Id is
11295 N : Node_Id := Parent (Unit_Id);
11298 -- Predefined operators do not have a full function declaration
11300 if Ekind (Unit_Id) = E_Operator then
11304 -- Isn't there some better way to express the following ???
11306 while Nkind (N) /= N_Abstract_Subprogram_Declaration
11307 and then Nkind (N) /= N_Formal_Package_Declaration
11308 and then Nkind (N) /= N_Function_Instantiation
11309 and then Nkind (N) /= N_Generic_Package_Declaration
11310 and then Nkind (N) /= N_Generic_Subprogram_Declaration
11311 and then Nkind (N) /= N_Package_Declaration
11312 and then Nkind (N) /= N_Package_Body
11313 and then Nkind (N) /= N_Package_Instantiation
11314 and then Nkind (N) /= N_Package_Renaming_Declaration
11315 and then Nkind (N) /= N_Procedure_Instantiation
11316 and then Nkind (N) /= N_Protected_Body
11317 and then Nkind (N) /= N_Subprogram_Declaration
11318 and then Nkind (N) /= N_Subprogram_Body
11319 and then Nkind (N) /= N_Subprogram_Body_Stub
11320 and then Nkind (N) /= N_Subprogram_Renaming_Declaration
11321 and then Nkind (N) /= N_Task_Body
11322 and then Nkind (N) /= N_Task_Type_Declaration
11323 and then Nkind (N) not in N_Formal_Subprogram_Declaration
11324 and then Nkind (N) not in N_Generic_Renaming_Declaration
11327 pragma Assert (Present (N));
11331 end Unit_Declaration_Node;
11333 ------------------------------
11334 -- Universal_Interpretation --
11335 ------------------------------
11337 function Universal_Interpretation (Opnd : Node_Id) return Entity_Id is
11338 Index : Interp_Index;
11342 -- The argument may be a formal parameter of an operator or subprogram
11343 -- with multiple interpretations, or else an expression for an actual.
11345 if Nkind (Opnd) = N_Defining_Identifier
11346 or else not Is_Overloaded (Opnd)
11348 if Etype (Opnd) = Universal_Integer
11349 or else Etype (Opnd) = Universal_Real
11351 return Etype (Opnd);
11357 Get_First_Interp (Opnd, Index, It);
11358 while Present (It.Typ) loop
11359 if It.Typ = Universal_Integer
11360 or else It.Typ = Universal_Real
11365 Get_Next_Interp (Index, It);
11370 end Universal_Interpretation;
11376 function Unqualify (Expr : Node_Id) return Node_Id is
11378 -- Recurse to handle unlikely case of multiple levels of qualification
11380 if Nkind (Expr) = N_Qualified_Expression then
11381 return Unqualify (Expression (Expr));
11383 -- Normal case, not a qualified expression
11390 ----------------------
11391 -- Within_Init_Proc --
11392 ----------------------
11394 function Within_Init_Proc return Boolean is
11398 S := Current_Scope;
11399 while not Is_Overloadable (S) loop
11400 if S = Standard_Standard then
11407 return Is_Init_Proc (S);
11408 end Within_Init_Proc;
11414 procedure Wrong_Type (Expr : Node_Id; Expected_Type : Entity_Id) is
11415 Found_Type : constant Entity_Id := First_Subtype (Etype (Expr));
11416 Expec_Type : constant Entity_Id := First_Subtype (Expected_Type);
11418 function Has_One_Matching_Field return Boolean;
11419 -- Determines if Expec_Type is a record type with a single component or
11420 -- discriminant whose type matches the found type or is one dimensional
11421 -- array whose component type matches the found type.
11423 ----------------------------
11424 -- Has_One_Matching_Field --
11425 ----------------------------
11427 function Has_One_Matching_Field return Boolean is
11431 if Is_Array_Type (Expec_Type)
11432 and then Number_Dimensions (Expec_Type) = 1
11434 Covers (Etype (Component_Type (Expec_Type)), Found_Type)
11438 elsif not Is_Record_Type (Expec_Type) then
11442 E := First_Entity (Expec_Type);
11447 elsif (Ekind (E) /= E_Discriminant
11448 and then Ekind (E) /= E_Component)
11449 or else (Chars (E) = Name_uTag
11450 or else Chars (E) = Name_uParent)
11459 if not Covers (Etype (E), Found_Type) then
11462 elsif Present (Next_Entity (E)) then
11469 end Has_One_Matching_Field;
11471 -- Start of processing for Wrong_Type
11474 -- Don't output message if either type is Any_Type, or if a message
11475 -- has already been posted for this node. We need to do the latter
11476 -- check explicitly (it is ordinarily done in Errout), because we
11477 -- are using ! to force the output of the error messages.
11479 if Expec_Type = Any_Type
11480 or else Found_Type = Any_Type
11481 or else Error_Posted (Expr)
11485 -- In an instance, there is an ongoing problem with completion of
11486 -- type derived from private types. Their structure is what Gigi
11487 -- expects, but the Etype is the parent type rather than the
11488 -- derived private type itself. Do not flag error in this case. The
11489 -- private completion is an entity without a parent, like an Itype.
11490 -- Similarly, full and partial views may be incorrect in the instance.
11491 -- There is no simple way to insure that it is consistent ???
11493 elsif In_Instance then
11494 if Etype (Etype (Expr)) = Etype (Expected_Type)
11496 (Has_Private_Declaration (Expected_Type)
11497 or else Has_Private_Declaration (Etype (Expr)))
11498 and then No (Parent (Expected_Type))
11504 -- An interesting special check. If the expression is parenthesized
11505 -- and its type corresponds to the type of the sole component of the
11506 -- expected record type, or to the component type of the expected one
11507 -- dimensional array type, then assume we have a bad aggregate attempt.
11509 if Nkind (Expr) in N_Subexpr
11510 and then Paren_Count (Expr) /= 0
11511 and then Has_One_Matching_Field
11513 Error_Msg_N ("positional aggregate cannot have one component", Expr);
11515 -- Another special check, if we are looking for a pool-specific access
11516 -- type and we found an E_Access_Attribute_Type, then we have the case
11517 -- of an Access attribute being used in a context which needs a pool-
11518 -- specific type, which is never allowed. The one extra check we make
11519 -- is that the expected designated type covers the Found_Type.
11521 elsif Is_Access_Type (Expec_Type)
11522 and then Ekind (Found_Type) = E_Access_Attribute_Type
11523 and then Ekind (Base_Type (Expec_Type)) /= E_General_Access_Type
11524 and then Ekind (Base_Type (Expec_Type)) /= E_Anonymous_Access_Type
11526 (Designated_Type (Expec_Type), Designated_Type (Found_Type))
11528 Error_Msg_N -- CODEFIX
11529 ("result must be general access type!", Expr);
11530 Error_Msg_NE -- CODEFIX
11531 ("add ALL to }!", Expr, Expec_Type);
11533 -- Another special check, if the expected type is an integer type,
11534 -- but the expression is of type System.Address, and the parent is
11535 -- an addition or subtraction operation whose left operand is the
11536 -- expression in question and whose right operand is of an integral
11537 -- type, then this is an attempt at address arithmetic, so give
11538 -- appropriate message.
11540 elsif Is_Integer_Type (Expec_Type)
11541 and then Is_RTE (Found_Type, RE_Address)
11542 and then (Nkind (Parent (Expr)) = N_Op_Add
11544 Nkind (Parent (Expr)) = N_Op_Subtract)
11545 and then Expr = Left_Opnd (Parent (Expr))
11546 and then Is_Integer_Type (Etype (Right_Opnd (Parent (Expr))))
11549 ("address arithmetic not predefined in package System",
11552 ("\possible missing with/use of System.Storage_Elements",
11556 -- If the expected type is an anonymous access type, as for access
11557 -- parameters and discriminants, the error is on the designated types.
11559 elsif Ekind (Expec_Type) = E_Anonymous_Access_Type then
11560 if Comes_From_Source (Expec_Type) then
11561 Error_Msg_NE ("expected}!", Expr, Expec_Type);
11564 ("expected an access type with designated}",
11565 Expr, Designated_Type (Expec_Type));
11568 if Is_Access_Type (Found_Type)
11569 and then not Comes_From_Source (Found_Type)
11572 ("\\found an access type with designated}!",
11573 Expr, Designated_Type (Found_Type));
11575 if From_With_Type (Found_Type) then
11576 Error_Msg_NE ("\\found incomplete}!", Expr, Found_Type);
11577 Error_Msg_Qual_Level := 99;
11578 Error_Msg_NE -- CODEFIX
11579 ("\\missing `WITH &;", Expr, Scope (Found_Type));
11580 Error_Msg_Qual_Level := 0;
11582 Error_Msg_NE ("found}!", Expr, Found_Type);
11586 -- Normal case of one type found, some other type expected
11589 -- If the names of the two types are the same, see if some number
11590 -- of levels of qualification will help. Don't try more than three
11591 -- levels, and if we get to standard, it's no use (and probably
11592 -- represents an error in the compiler) Also do not bother with
11593 -- internal scope names.
11596 Expec_Scope : Entity_Id;
11597 Found_Scope : Entity_Id;
11600 Expec_Scope := Expec_Type;
11601 Found_Scope := Found_Type;
11603 for Levels in Int range 0 .. 3 loop
11604 if Chars (Expec_Scope) /= Chars (Found_Scope) then
11605 Error_Msg_Qual_Level := Levels;
11609 Expec_Scope := Scope (Expec_Scope);
11610 Found_Scope := Scope (Found_Scope);
11612 exit when Expec_Scope = Standard_Standard
11613 or else Found_Scope = Standard_Standard
11614 or else not Comes_From_Source (Expec_Scope)
11615 or else not Comes_From_Source (Found_Scope);
11619 if Is_Record_Type (Expec_Type)
11620 and then Present (Corresponding_Remote_Type (Expec_Type))
11622 Error_Msg_NE ("expected}!", Expr,
11623 Corresponding_Remote_Type (Expec_Type));
11625 Error_Msg_NE ("expected}!", Expr, Expec_Type);
11628 if Is_Entity_Name (Expr)
11629 and then Is_Package_Or_Generic_Package (Entity (Expr))
11631 Error_Msg_N ("\\found package name!", Expr);
11633 elsif Is_Entity_Name (Expr)
11635 (Ekind (Entity (Expr)) = E_Procedure
11637 Ekind (Entity (Expr)) = E_Generic_Procedure)
11639 if Ekind (Expec_Type) = E_Access_Subprogram_Type then
11641 ("found procedure name, possibly missing Access attribute!",
11645 ("\\found procedure name instead of function!", Expr);
11648 elsif Nkind (Expr) = N_Function_Call
11649 and then Ekind (Expec_Type) = E_Access_Subprogram_Type
11650 and then Etype (Designated_Type (Expec_Type)) = Etype (Expr)
11651 and then No (Parameter_Associations (Expr))
11654 ("found function name, possibly missing Access attribute!",
11657 -- Catch common error: a prefix or infix operator which is not
11658 -- directly visible because the type isn't.
11660 elsif Nkind (Expr) in N_Op
11661 and then Is_Overloaded (Expr)
11662 and then not Is_Immediately_Visible (Expec_Type)
11663 and then not Is_Potentially_Use_Visible (Expec_Type)
11664 and then not In_Use (Expec_Type)
11665 and then Has_Compatible_Type (Right_Opnd (Expr), Expec_Type)
11668 ("operator of the type is not directly visible!", Expr);
11670 elsif Ekind (Found_Type) = E_Void
11671 and then Present (Parent (Found_Type))
11672 and then Nkind (Parent (Found_Type)) = N_Full_Type_Declaration
11674 Error_Msg_NE ("\\found premature usage of}!", Expr, Found_Type);
11677 Error_Msg_NE ("\\found}!", Expr, Found_Type);
11680 -- A special check for cases like M1 and M2 = 0 where M1 and M2 are
11681 -- of the same modular type, and (M1 and M2) = 0 was intended.
11683 if Expec_Type = Standard_Boolean
11684 and then Is_Modular_Integer_Type (Found_Type)
11685 and then Nkind_In (Parent (Expr), N_Op_And, N_Op_Or, N_Op_Xor)
11686 and then Nkind (Right_Opnd (Parent (Expr))) in N_Op_Compare
11689 Op : constant Node_Id := Right_Opnd (Parent (Expr));
11690 L : constant Node_Id := Left_Opnd (Op);
11691 R : constant Node_Id := Right_Opnd (Op);
11693 -- The case for the message is when the left operand of the
11694 -- comparison is the same modular type, or when it is an
11695 -- integer literal (or other universal integer expression),
11696 -- which would have been typed as the modular type if the
11697 -- parens had been there.
11699 if (Etype (L) = Found_Type
11701 Etype (L) = Universal_Integer)
11702 and then Is_Integer_Type (Etype (R))
11705 ("\\possible missing parens for modular operation", Expr);
11710 -- Reset error message qualification indication
11712 Error_Msg_Qual_Level := 0;