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;
248 -----------------------
249 -- Alignment_In_Bits --
250 -----------------------
252 function Alignment_In_Bits (E : Entity_Id) return Uint is
254 return Alignment (E) * System_Storage_Unit;
255 end Alignment_In_Bits;
257 -----------------------------------------
258 -- Apply_Compile_Time_Constraint_Error --
259 -----------------------------------------
261 procedure Apply_Compile_Time_Constraint_Error
264 Reason : RT_Exception_Code;
265 Ent : Entity_Id := Empty;
266 Typ : Entity_Id := Empty;
267 Loc : Source_Ptr := No_Location;
268 Rep : Boolean := True;
269 Warn : Boolean := False)
271 Stat : constant Boolean := Is_Static_Expression (N);
272 R_Stat : constant Node_Id :=
273 Make_Raise_Constraint_Error (Sloc (N), Reason => Reason);
284 (Compile_Time_Constraint_Error (N, Msg, Ent, Loc, Warn => Warn));
290 -- Now we replace the node by an N_Raise_Constraint_Error node
291 -- This does not need reanalyzing, so set it as analyzed now.
294 Set_Analyzed (N, True);
297 Set_Raises_Constraint_Error (N);
299 -- Now deal with possible local raise handling
301 Possible_Local_Raise (N, Standard_Constraint_Error);
303 -- If the original expression was marked as static, the result is
304 -- still marked as static, but the Raises_Constraint_Error flag is
305 -- always set so that further static evaluation is not attempted.
308 Set_Is_Static_Expression (N);
310 end Apply_Compile_Time_Constraint_Error;
312 --------------------------
313 -- Build_Actual_Subtype --
314 --------------------------
316 function Build_Actual_Subtype
318 N : Node_Or_Entity_Id) return Node_Id
321 -- Normally Sloc (N), but may point to corresponding body in some cases
323 Constraints : List_Id;
329 Disc_Type : Entity_Id;
335 if Nkind (N) = N_Defining_Identifier then
336 Obj := New_Reference_To (N, Loc);
338 -- If this is a formal parameter of a subprogram declaration, and
339 -- we are compiling the body, we want the declaration for the
340 -- actual subtype to carry the source position of the body, to
341 -- prevent anomalies in gdb when stepping through the code.
343 if Is_Formal (N) then
345 Decl : constant Node_Id := Unit_Declaration_Node (Scope (N));
347 if Nkind (Decl) = N_Subprogram_Declaration
348 and then Present (Corresponding_Body (Decl))
350 Loc := Sloc (Corresponding_Body (Decl));
359 if Is_Array_Type (T) then
360 Constraints := New_List;
361 for J in 1 .. Number_Dimensions (T) loop
363 -- Build an array subtype declaration with the nominal subtype and
364 -- the bounds of the actual. Add the declaration in front of the
365 -- local declarations for the subprogram, for analysis before any
366 -- reference to the formal in the body.
369 Make_Attribute_Reference (Loc,
371 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
372 Attribute_Name => Name_First,
373 Expressions => New_List (
374 Make_Integer_Literal (Loc, J)));
377 Make_Attribute_Reference (Loc,
379 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
380 Attribute_Name => Name_Last,
381 Expressions => New_List (
382 Make_Integer_Literal (Loc, J)));
384 Append (Make_Range (Loc, Lo, Hi), Constraints);
387 -- If the type has unknown discriminants there is no constrained
388 -- subtype to build. This is never called for a formal or for a
389 -- lhs, so returning the type is ok ???
391 elsif Has_Unknown_Discriminants (T) then
395 Constraints := New_List;
397 -- Type T is a generic derived type, inherit the discriminants from
400 if Is_Private_Type (T)
401 and then No (Full_View (T))
403 -- T was flagged as an error if it was declared as a formal
404 -- derived type with known discriminants. In this case there
405 -- is no need to look at the parent type since T already carries
406 -- its own discriminants.
408 and then not Error_Posted (T)
410 Disc_Type := Etype (Base_Type (T));
415 Discr := First_Discriminant (Disc_Type);
416 while Present (Discr) loop
417 Append_To (Constraints,
418 Make_Selected_Component (Loc,
420 Duplicate_Subexpr_No_Checks (Obj),
421 Selector_Name => New_Occurrence_Of (Discr, Loc)));
422 Next_Discriminant (Discr);
426 Subt := Make_Temporary (Loc, 'S', Related_Node => N);
427 Set_Is_Internal (Subt);
430 Make_Subtype_Declaration (Loc,
431 Defining_Identifier => Subt,
432 Subtype_Indication =>
433 Make_Subtype_Indication (Loc,
434 Subtype_Mark => New_Reference_To (T, Loc),
436 Make_Index_Or_Discriminant_Constraint (Loc,
437 Constraints => Constraints)));
439 Mark_Rewrite_Insertion (Decl);
441 end Build_Actual_Subtype;
443 ---------------------------------------
444 -- Build_Actual_Subtype_Of_Component --
445 ---------------------------------------
447 function Build_Actual_Subtype_Of_Component
449 N : Node_Id) return Node_Id
451 Loc : constant Source_Ptr := Sloc (N);
452 P : constant Node_Id := Prefix (N);
455 Indx_Type : Entity_Id;
457 Deaccessed_T : Entity_Id;
458 -- This is either a copy of T, or if T is an access type, then it is
459 -- the directly designated type of this access type.
461 function Build_Actual_Array_Constraint return List_Id;
462 -- If one or more of the bounds of the component depends on
463 -- discriminants, build actual constraint using the discriminants
466 function Build_Actual_Record_Constraint return List_Id;
467 -- Similar to previous one, for discriminated components constrained
468 -- by the discriminant of the enclosing object.
470 -----------------------------------
471 -- Build_Actual_Array_Constraint --
472 -----------------------------------
474 function Build_Actual_Array_Constraint return List_Id is
475 Constraints : constant List_Id := New_List;
483 Indx := First_Index (Deaccessed_T);
484 while Present (Indx) loop
485 Old_Lo := Type_Low_Bound (Etype (Indx));
486 Old_Hi := Type_High_Bound (Etype (Indx));
488 if Denotes_Discriminant (Old_Lo) then
490 Make_Selected_Component (Loc,
491 Prefix => New_Copy_Tree (P),
492 Selector_Name => New_Occurrence_Of (Entity (Old_Lo), Loc));
495 Lo := New_Copy_Tree (Old_Lo);
497 -- The new bound will be reanalyzed in the enclosing
498 -- declaration. For literal bounds that come from a type
499 -- declaration, the type of the context must be imposed, so
500 -- insure that analysis will take place. For non-universal
501 -- types this is not strictly necessary.
503 Set_Analyzed (Lo, False);
506 if Denotes_Discriminant (Old_Hi) then
508 Make_Selected_Component (Loc,
509 Prefix => New_Copy_Tree (P),
510 Selector_Name => New_Occurrence_Of (Entity (Old_Hi), Loc));
513 Hi := New_Copy_Tree (Old_Hi);
514 Set_Analyzed (Hi, False);
517 Append (Make_Range (Loc, Lo, Hi), Constraints);
522 end Build_Actual_Array_Constraint;
524 ------------------------------------
525 -- Build_Actual_Record_Constraint --
526 ------------------------------------
528 function Build_Actual_Record_Constraint return List_Id is
529 Constraints : constant List_Id := New_List;
534 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
535 while Present (D) loop
536 if Denotes_Discriminant (Node (D)) then
537 D_Val := Make_Selected_Component (Loc,
538 Prefix => New_Copy_Tree (P),
539 Selector_Name => New_Occurrence_Of (Entity (Node (D)), Loc));
542 D_Val := New_Copy_Tree (Node (D));
545 Append (D_Val, Constraints);
550 end Build_Actual_Record_Constraint;
552 -- Start of processing for Build_Actual_Subtype_Of_Component
555 -- Why the test for Spec_Expression mode here???
557 if In_Spec_Expression then
560 -- More comments for the rest of this body would be good ???
562 elsif Nkind (N) = N_Explicit_Dereference then
563 if Is_Composite_Type (T)
564 and then not Is_Constrained (T)
565 and then not (Is_Class_Wide_Type (T)
566 and then Is_Constrained (Root_Type (T)))
567 and then not Has_Unknown_Discriminants (T)
569 -- If the type of the dereference is already constrained, it is an
572 if Is_Array_Type (Etype (N))
573 and then Is_Constrained (Etype (N))
577 Remove_Side_Effects (P);
578 return Build_Actual_Subtype (T, N);
585 if Ekind (T) = E_Access_Subtype then
586 Deaccessed_T := Designated_Type (T);
591 if Ekind (Deaccessed_T) = E_Array_Subtype then
592 Id := First_Index (Deaccessed_T);
593 while Present (Id) loop
594 Indx_Type := Underlying_Type (Etype (Id));
596 if Denotes_Discriminant (Type_Low_Bound (Indx_Type))
598 Denotes_Discriminant (Type_High_Bound (Indx_Type))
600 Remove_Side_Effects (P);
602 Build_Component_Subtype
603 (Build_Actual_Array_Constraint, Loc, Base_Type (T));
609 elsif Is_Composite_Type (Deaccessed_T)
610 and then Has_Discriminants (Deaccessed_T)
611 and then not Has_Unknown_Discriminants (Deaccessed_T)
613 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
614 while Present (D) loop
615 if Denotes_Discriminant (Node (D)) then
616 Remove_Side_Effects (P);
618 Build_Component_Subtype (
619 Build_Actual_Record_Constraint, Loc, Base_Type (T));
626 -- If none of the above, the actual and nominal subtypes are the same
629 end Build_Actual_Subtype_Of_Component;
631 -----------------------------
632 -- Build_Component_Subtype --
633 -----------------------------
635 function Build_Component_Subtype
638 T : Entity_Id) return Node_Id
644 -- Unchecked_Union components do not require component subtypes
646 if Is_Unchecked_Union (T) then
650 Subt := Make_Temporary (Loc, 'S');
651 Set_Is_Internal (Subt);
654 Make_Subtype_Declaration (Loc,
655 Defining_Identifier => Subt,
656 Subtype_Indication =>
657 Make_Subtype_Indication (Loc,
658 Subtype_Mark => New_Reference_To (Base_Type (T), Loc),
660 Make_Index_Or_Discriminant_Constraint (Loc,
663 Mark_Rewrite_Insertion (Decl);
665 end Build_Component_Subtype;
667 ---------------------------
668 -- Build_Default_Subtype --
669 ---------------------------
671 function Build_Default_Subtype
673 N : Node_Id) return Entity_Id
675 Loc : constant Source_Ptr := Sloc (N);
679 if not Has_Discriminants (T) or else Is_Constrained (T) then
683 Disc := First_Discriminant (T);
685 if No (Discriminant_Default_Value (Disc)) then
690 Act : constant Entity_Id := Make_Temporary (Loc, 'S');
691 Constraints : constant List_Id := New_List;
695 while Present (Disc) loop
696 Append_To (Constraints,
697 New_Copy_Tree (Discriminant_Default_Value (Disc)));
698 Next_Discriminant (Disc);
702 Make_Subtype_Declaration (Loc,
703 Defining_Identifier => Act,
704 Subtype_Indication =>
705 Make_Subtype_Indication (Loc,
706 Subtype_Mark => New_Occurrence_Of (T, Loc),
708 Make_Index_Or_Discriminant_Constraint (Loc,
709 Constraints => Constraints)));
711 Insert_Action (N, Decl);
715 end Build_Default_Subtype;
717 --------------------------------------------
718 -- Build_Discriminal_Subtype_Of_Component --
719 --------------------------------------------
721 function Build_Discriminal_Subtype_Of_Component
722 (T : Entity_Id) return Node_Id
724 Loc : constant Source_Ptr := Sloc (T);
728 function Build_Discriminal_Array_Constraint return List_Id;
729 -- If one or more of the bounds of the component depends on
730 -- discriminants, build actual constraint using the discriminants
733 function Build_Discriminal_Record_Constraint return List_Id;
734 -- Similar to previous one, for discriminated components constrained
735 -- by the discriminant of the enclosing object.
737 ----------------------------------------
738 -- Build_Discriminal_Array_Constraint --
739 ----------------------------------------
741 function Build_Discriminal_Array_Constraint return List_Id is
742 Constraints : constant List_Id := New_List;
750 Indx := First_Index (T);
751 while Present (Indx) loop
752 Old_Lo := Type_Low_Bound (Etype (Indx));
753 Old_Hi := Type_High_Bound (Etype (Indx));
755 if Denotes_Discriminant (Old_Lo) then
756 Lo := New_Occurrence_Of (Discriminal (Entity (Old_Lo)), Loc);
759 Lo := New_Copy_Tree (Old_Lo);
762 if Denotes_Discriminant (Old_Hi) then
763 Hi := New_Occurrence_Of (Discriminal (Entity (Old_Hi)), Loc);
766 Hi := New_Copy_Tree (Old_Hi);
769 Append (Make_Range (Loc, Lo, Hi), Constraints);
774 end Build_Discriminal_Array_Constraint;
776 -----------------------------------------
777 -- Build_Discriminal_Record_Constraint --
778 -----------------------------------------
780 function Build_Discriminal_Record_Constraint return List_Id is
781 Constraints : constant List_Id := New_List;
786 D := First_Elmt (Discriminant_Constraint (T));
787 while Present (D) loop
788 if Denotes_Discriminant (Node (D)) then
790 New_Occurrence_Of (Discriminal (Entity (Node (D))), Loc);
793 D_Val := New_Copy_Tree (Node (D));
796 Append (D_Val, Constraints);
801 end Build_Discriminal_Record_Constraint;
803 -- Start of processing for Build_Discriminal_Subtype_Of_Component
806 if Ekind (T) = E_Array_Subtype then
807 Id := First_Index (T);
808 while Present (Id) loop
809 if Denotes_Discriminant (Type_Low_Bound (Etype (Id))) or else
810 Denotes_Discriminant (Type_High_Bound (Etype (Id)))
812 return Build_Component_Subtype
813 (Build_Discriminal_Array_Constraint, Loc, T);
819 elsif Ekind (T) = E_Record_Subtype
820 and then Has_Discriminants (T)
821 and then not Has_Unknown_Discriminants (T)
823 D := First_Elmt (Discriminant_Constraint (T));
824 while Present (D) loop
825 if Denotes_Discriminant (Node (D)) then
826 return Build_Component_Subtype
827 (Build_Discriminal_Record_Constraint, Loc, T);
834 -- If none of the above, the actual and nominal subtypes are the same
837 end Build_Discriminal_Subtype_Of_Component;
839 ------------------------------
840 -- Build_Elaboration_Entity --
841 ------------------------------
843 procedure Build_Elaboration_Entity (N : Node_Id; Spec_Id : Entity_Id) is
844 Loc : constant Source_Ptr := Sloc (N);
846 Elab_Ent : Entity_Id;
848 procedure Set_Package_Name (Ent : Entity_Id);
849 -- Given an entity, sets the fully qualified name of the entity in
850 -- Name_Buffer, with components separated by double underscores. This
851 -- is a recursive routine that climbs the scope chain to Standard.
853 ----------------------
854 -- Set_Package_Name --
855 ----------------------
857 procedure Set_Package_Name (Ent : Entity_Id) is
859 if Scope (Ent) /= Standard_Standard then
860 Set_Package_Name (Scope (Ent));
863 Nam : constant String := Get_Name_String (Chars (Ent));
865 Name_Buffer (Name_Len + 1) := '_';
866 Name_Buffer (Name_Len + 2) := '_';
867 Name_Buffer (Name_Len + 3 .. Name_Len + Nam'Length + 2) := Nam;
868 Name_Len := Name_Len + Nam'Length + 2;
872 Get_Name_String (Chars (Ent));
874 end Set_Package_Name;
876 -- Start of processing for Build_Elaboration_Entity
879 -- Ignore if already constructed
881 if Present (Elaboration_Entity (Spec_Id)) then
885 -- Construct name of elaboration entity as xxx_E, where xxx is the unit
886 -- name with dots replaced by double underscore. We have to manually
887 -- construct this name, since it will be elaborated in the outer scope,
888 -- and thus will not have the unit name automatically prepended.
890 Set_Package_Name (Spec_Id);
894 Name_Buffer (Name_Len + 1) := '_';
895 Name_Buffer (Name_Len + 2) := 'E';
896 Name_Len := Name_Len + 2;
898 -- Create elaboration flag
901 Make_Defining_Identifier (Loc, Chars => Name_Find);
902 Set_Elaboration_Entity (Spec_Id, Elab_Ent);
905 Make_Object_Declaration (Loc,
906 Defining_Identifier => Elab_Ent,
908 New_Occurrence_Of (Standard_Boolean, Loc),
910 New_Occurrence_Of (Standard_False, Loc));
912 Push_Scope (Standard_Standard);
913 Add_Global_Declaration (Decl);
916 -- Reset True_Constant indication, since we will indeed assign a value
917 -- to the variable in the binder main. We also kill the Current_Value
918 -- and Last_Assignment fields for the same reason.
920 Set_Is_True_Constant (Elab_Ent, False);
921 Set_Current_Value (Elab_Ent, Empty);
922 Set_Last_Assignment (Elab_Ent, Empty);
924 -- We do not want any further qualification of the name (if we did
925 -- not do this, we would pick up the name of the generic package
926 -- in the case of a library level generic instantiation).
928 Set_Has_Qualified_Name (Elab_Ent);
929 Set_Has_Fully_Qualified_Name (Elab_Ent);
930 end Build_Elaboration_Entity;
932 -----------------------------------
933 -- Cannot_Raise_Constraint_Error --
934 -----------------------------------
936 function Cannot_Raise_Constraint_Error (Expr : Node_Id) return Boolean is
938 if Compile_Time_Known_Value (Expr) then
941 elsif Do_Range_Check (Expr) then
944 elsif Raises_Constraint_Error (Expr) then
952 when N_Expanded_Name =>
955 when N_Selected_Component =>
956 return not Do_Discriminant_Check (Expr);
958 when N_Attribute_Reference =>
959 if Do_Overflow_Check (Expr) then
962 elsif No (Expressions (Expr)) then
970 N := First (Expressions (Expr));
971 while Present (N) loop
972 if Cannot_Raise_Constraint_Error (N) then
983 when N_Type_Conversion =>
984 if Do_Overflow_Check (Expr)
985 or else Do_Length_Check (Expr)
986 or else Do_Tag_Check (Expr)
991 Cannot_Raise_Constraint_Error (Expression (Expr));
994 when N_Unchecked_Type_Conversion =>
995 return Cannot_Raise_Constraint_Error (Expression (Expr));
998 if Do_Overflow_Check (Expr) then
1002 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1009 if Do_Division_Check (Expr)
1010 or else Do_Overflow_Check (Expr)
1015 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
1017 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1036 N_Op_Shift_Right_Arithmetic |
1040 if Do_Overflow_Check (Expr) then
1044 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
1046 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1053 end Cannot_Raise_Constraint_Error;
1055 -----------------------------------------
1056 -- Check_Dynamically_Tagged_Expression --
1057 -----------------------------------------
1059 procedure Check_Dynamically_Tagged_Expression
1062 Related_Nod : Node_Id)
1065 pragma Assert (Is_Tagged_Type (Typ));
1067 -- In order to avoid spurious errors when analyzing the expanded code,
1068 -- this check is done only for nodes that come from source and for
1069 -- actuals of generic instantiations.
1071 if (Comes_From_Source (Related_Nod)
1072 or else In_Generic_Actual (Expr))
1073 and then (Is_Class_Wide_Type (Etype (Expr))
1074 or else Is_Dynamically_Tagged (Expr))
1075 and then Is_Tagged_Type (Typ)
1076 and then not Is_Class_Wide_Type (Typ)
1078 Error_Msg_N ("dynamically tagged expression not allowed!", Expr);
1080 end Check_Dynamically_Tagged_Expression;
1082 --------------------------
1083 -- Check_Fully_Declared --
1084 --------------------------
1086 procedure Check_Fully_Declared (T : Entity_Id; N : Node_Id) is
1088 if Ekind (T) = E_Incomplete_Type then
1090 -- Ada 2005 (AI-50217): If the type is available through a limited
1091 -- with_clause, verify that its full view has been analyzed.
1093 if From_With_Type (T)
1094 and then Present (Non_Limited_View (T))
1095 and then Ekind (Non_Limited_View (T)) /= E_Incomplete_Type
1097 -- The non-limited view is fully declared
1102 ("premature usage of incomplete}", N, First_Subtype (T));
1105 -- Need comments for these tests ???
1107 elsif Has_Private_Component (T)
1108 and then not Is_Generic_Type (Root_Type (T))
1109 and then not In_Spec_Expression
1111 -- Special case: if T is the anonymous type created for a single
1112 -- task or protected object, use the name of the source object.
1114 if Is_Concurrent_Type (T)
1115 and then not Comes_From_Source (T)
1116 and then Nkind (N) = N_Object_Declaration
1118 Error_Msg_NE ("type of& has incomplete component", N,
1119 Defining_Identifier (N));
1123 ("premature usage of incomplete}", N, First_Subtype (T));
1126 end Check_Fully_Declared;
1128 -------------------------
1129 -- Check_Nested_Access --
1130 -------------------------
1132 procedure Check_Nested_Access (Ent : Entity_Id) is
1133 Scop : constant Entity_Id := Current_Scope;
1134 Current_Subp : Entity_Id;
1135 Enclosing : Entity_Id;
1138 -- Currently only enabled for VM back-ends for efficiency, should we
1139 -- enable it more systematically ???
1141 -- Check for Is_Imported needs commenting below ???
1143 if VM_Target /= No_VM
1144 and then (Ekind (Ent) = E_Variable
1146 Ekind (Ent) = E_Constant
1148 Ekind (Ent) = E_Loop_Parameter)
1149 and then Scope (Ent) /= Empty
1150 and then not Is_Library_Level_Entity (Ent)
1151 and then not Is_Imported (Ent)
1153 if Is_Subprogram (Scop)
1154 or else Is_Generic_Subprogram (Scop)
1155 or else Is_Entry (Scop)
1157 Current_Subp := Scop;
1159 Current_Subp := Current_Subprogram;
1162 Enclosing := Enclosing_Subprogram (Ent);
1164 if Enclosing /= Empty
1165 and then Enclosing /= Current_Subp
1167 Set_Has_Up_Level_Access (Ent, True);
1170 end Check_Nested_Access;
1172 ----------------------------
1173 -- Check_Order_Dependence --
1174 ----------------------------
1176 procedure Check_Order_Dependence is
1181 -- This could use comments ???
1183 for J in 0 .. Actuals_In_Call.Last loop
1184 if Actuals_In_Call.Table (J).Is_Writable then
1185 Act1 := Actuals_In_Call.Table (J).Act;
1187 if Nkind (Act1) = N_Attribute_Reference then
1188 Act1 := Prefix (Act1);
1191 for K in 0 .. Actuals_In_Call.Last loop
1193 Act2 := Actuals_In_Call.Table (K).Act;
1195 if Nkind (Act2) = N_Attribute_Reference then
1196 Act2 := Prefix (Act2);
1199 if Actuals_In_Call.Table (K).Is_Writable
1206 elsif Denotes_Same_Object (Act1, Act2)
1209 Error_Msg_N ("?,mighty suspicious!!!", Act1);
1216 Actuals_In_Call.Set_Last (0);
1217 end Check_Order_Dependence;
1219 ------------------------------------------
1220 -- Check_Potentially_Blocking_Operation --
1221 ------------------------------------------
1223 procedure Check_Potentially_Blocking_Operation (N : Node_Id) is
1226 -- N is one of the potentially blocking operations listed in 9.5.1(8).
1227 -- When pragma Detect_Blocking is active, the run time will raise
1228 -- Program_Error. Here we only issue a warning, since we generally
1229 -- support the use of potentially blocking operations in the absence
1232 -- Indirect blocking through a subprogram call cannot be diagnosed
1233 -- statically without interprocedural analysis, so we do not attempt
1236 S := Scope (Current_Scope);
1237 while Present (S) and then S /= Standard_Standard loop
1238 if Is_Protected_Type (S) then
1240 ("potentially blocking operation in protected operation?", N);
1247 end Check_Potentially_Blocking_Operation;
1249 ------------------------------
1250 -- Check_Unprotected_Access --
1251 ------------------------------
1253 procedure Check_Unprotected_Access
1257 Cont_Encl_Typ : Entity_Id;
1258 Pref_Encl_Typ : Entity_Id;
1260 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id;
1261 -- Check whether Obj is a private component of a protected object.
1262 -- Return the protected type where the component resides, Empty
1265 function Is_Public_Operation return Boolean;
1266 -- Verify that the enclosing operation is callable from outside the
1267 -- protected object, to minimize false positives.
1269 ------------------------------
1270 -- Enclosing_Protected_Type --
1271 ------------------------------
1273 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id is
1275 if Is_Entity_Name (Obj) then
1277 Ent : Entity_Id := Entity (Obj);
1280 -- The object can be a renaming of a private component, use
1281 -- the original record component.
1283 if Is_Prival (Ent) then
1284 Ent := Prival_Link (Ent);
1287 if Is_Protected_Type (Scope (Ent)) then
1293 -- For indexed and selected components, recursively check the prefix
1295 if Nkind_In (Obj, N_Indexed_Component, N_Selected_Component) then
1296 return Enclosing_Protected_Type (Prefix (Obj));
1298 -- The object does not denote a protected component
1303 end Enclosing_Protected_Type;
1305 -------------------------
1306 -- Is_Public_Operation --
1307 -------------------------
1309 function Is_Public_Operation return Boolean is
1316 and then S /= Pref_Encl_Typ
1318 if Scope (S) = Pref_Encl_Typ then
1319 E := First_Entity (Pref_Encl_Typ);
1321 and then E /= First_Private_Entity (Pref_Encl_Typ)
1334 end Is_Public_Operation;
1336 -- Start of processing for Check_Unprotected_Access
1339 if Nkind (Expr) = N_Attribute_Reference
1340 and then Attribute_Name (Expr) = Name_Unchecked_Access
1342 Cont_Encl_Typ := Enclosing_Protected_Type (Context);
1343 Pref_Encl_Typ := Enclosing_Protected_Type (Prefix (Expr));
1345 -- Check whether we are trying to export a protected component to a
1346 -- context with an equal or lower access level.
1348 if Present (Pref_Encl_Typ)
1349 and then No (Cont_Encl_Typ)
1350 and then Is_Public_Operation
1351 and then Scope_Depth (Pref_Encl_Typ) >=
1352 Object_Access_Level (Context)
1355 ("?possible unprotected access to protected data", Expr);
1358 end Check_Unprotected_Access;
1364 procedure Check_VMS (Construct : Node_Id) is
1366 if not OpenVMS_On_Target then
1368 ("this construct is allowed only in Open'V'M'S", Construct);
1372 ------------------------
1373 -- Collect_Interfaces --
1374 ------------------------
1376 procedure Collect_Interfaces
1378 Ifaces_List : out Elist_Id;
1379 Exclude_Parents : Boolean := False;
1380 Use_Full_View : Boolean := True)
1382 procedure Collect (Typ : Entity_Id);
1383 -- Subsidiary subprogram used to traverse the whole list
1384 -- of directly and indirectly implemented interfaces
1390 procedure Collect (Typ : Entity_Id) is
1391 Ancestor : Entity_Id;
1399 -- Handle private types
1402 and then Is_Private_Type (Typ)
1403 and then Present (Full_View (Typ))
1405 Full_T := Full_View (Typ);
1408 -- Include the ancestor if we are generating the whole list of
1409 -- abstract interfaces.
1411 if Etype (Full_T) /= Typ
1413 -- Protect the frontend against wrong sources. For example:
1416 -- type A is tagged null record;
1417 -- type B is new A with private;
1418 -- type C is new A with private;
1420 -- type B is new C with null record;
1421 -- type C is new B with null record;
1424 and then Etype (Full_T) /= T
1426 Ancestor := Etype (Full_T);
1429 if Is_Interface (Ancestor)
1430 and then not Exclude_Parents
1432 Append_Unique_Elmt (Ancestor, Ifaces_List);
1436 -- Traverse the graph of ancestor interfaces
1438 if Is_Non_Empty_List (Abstract_Interface_List (Full_T)) then
1439 Id := First (Abstract_Interface_List (Full_T));
1440 while Present (Id) loop
1441 Iface := Etype (Id);
1443 -- Protect against wrong uses. For example:
1444 -- type I is interface;
1445 -- type O is tagged null record;
1446 -- type Wrong is new I and O with null record; -- ERROR
1448 if Is_Interface (Iface) then
1450 and then Etype (T) /= T
1451 and then Interface_Present_In_Ancestor (Etype (T), Iface)
1456 Append_Unique_Elmt (Iface, Ifaces_List);
1465 -- Start of processing for Collect_Interfaces
1468 pragma Assert (Is_Tagged_Type (T) or else Is_Concurrent_Type (T));
1469 Ifaces_List := New_Elmt_List;
1471 end Collect_Interfaces;
1473 ----------------------------------
1474 -- Collect_Interface_Components --
1475 ----------------------------------
1477 procedure Collect_Interface_Components
1478 (Tagged_Type : Entity_Id;
1479 Components_List : out Elist_Id)
1481 procedure Collect (Typ : Entity_Id);
1482 -- Subsidiary subprogram used to climb to the parents
1488 procedure Collect (Typ : Entity_Id) is
1489 Tag_Comp : Entity_Id;
1490 Parent_Typ : Entity_Id;
1493 -- Handle private types
1495 if Present (Full_View (Etype (Typ))) then
1496 Parent_Typ := Full_View (Etype (Typ));
1498 Parent_Typ := Etype (Typ);
1501 if Parent_Typ /= Typ
1503 -- Protect the frontend against wrong sources. For example:
1506 -- type A is tagged null record;
1507 -- type B is new A with private;
1508 -- type C is new A with private;
1510 -- type B is new C with null record;
1511 -- type C is new B with null record;
1514 and then Parent_Typ /= Tagged_Type
1516 Collect (Parent_Typ);
1519 -- Collect the components containing tags of secondary dispatch
1522 Tag_Comp := Next_Tag_Component (First_Tag_Component (Typ));
1523 while Present (Tag_Comp) loop
1524 pragma Assert (Present (Related_Type (Tag_Comp)));
1525 Append_Elmt (Tag_Comp, Components_List);
1527 Tag_Comp := Next_Tag_Component (Tag_Comp);
1531 -- Start of processing for Collect_Interface_Components
1534 pragma Assert (Ekind (Tagged_Type) = E_Record_Type
1535 and then Is_Tagged_Type (Tagged_Type));
1537 Components_List := New_Elmt_List;
1538 Collect (Tagged_Type);
1539 end Collect_Interface_Components;
1541 -----------------------------
1542 -- Collect_Interfaces_Info --
1543 -----------------------------
1545 procedure Collect_Interfaces_Info
1547 Ifaces_List : out Elist_Id;
1548 Components_List : out Elist_Id;
1549 Tags_List : out Elist_Id)
1551 Comps_List : Elist_Id;
1552 Comp_Elmt : Elmt_Id;
1553 Comp_Iface : Entity_Id;
1554 Iface_Elmt : Elmt_Id;
1557 function Search_Tag (Iface : Entity_Id) return Entity_Id;
1558 -- Search for the secondary tag associated with the interface type
1559 -- Iface that is implemented by T.
1565 function Search_Tag (Iface : Entity_Id) return Entity_Id is
1568 if not Is_CPP_Class (T) then
1569 ADT := Next_Elmt (Next_Elmt (First_Elmt (Access_Disp_Table (T))));
1571 ADT := Next_Elmt (First_Elmt (Access_Disp_Table (T)));
1575 and then Is_Tag (Node (ADT))
1576 and then Related_Type (Node (ADT)) /= Iface
1578 -- Skip secondary dispatch table referencing thunks to user
1579 -- defined primitives covered by this interface.
1581 pragma Assert (Has_Suffix (Node (ADT), 'P'));
1584 -- Skip secondary dispatch tables of Ada types
1586 if not Is_CPP_Class (T) then
1588 -- Skip secondary dispatch table referencing thunks to
1589 -- predefined primitives.
1591 pragma Assert (Has_Suffix (Node (ADT), 'Y'));
1594 -- Skip secondary dispatch table referencing user-defined
1595 -- primitives covered by this interface.
1597 pragma Assert (Has_Suffix (Node (ADT), 'D'));
1600 -- Skip secondary dispatch table referencing predefined
1603 pragma Assert (Has_Suffix (Node (ADT), 'Z'));
1608 pragma Assert (Is_Tag (Node (ADT)));
1612 -- Start of processing for Collect_Interfaces_Info
1615 Collect_Interfaces (T, Ifaces_List);
1616 Collect_Interface_Components (T, Comps_List);
1618 -- Search for the record component and tag associated with each
1619 -- interface type of T.
1621 Components_List := New_Elmt_List;
1622 Tags_List := New_Elmt_List;
1624 Iface_Elmt := First_Elmt (Ifaces_List);
1625 while Present (Iface_Elmt) loop
1626 Iface := Node (Iface_Elmt);
1628 -- Associate the primary tag component and the primary dispatch table
1629 -- with all the interfaces that are parents of T
1631 if Is_Ancestor (Iface, T) then
1632 Append_Elmt (First_Tag_Component (T), Components_List);
1633 Append_Elmt (Node (First_Elmt (Access_Disp_Table (T))), Tags_List);
1635 -- Otherwise search for the tag component and secondary dispatch
1639 Comp_Elmt := First_Elmt (Comps_List);
1640 while Present (Comp_Elmt) loop
1641 Comp_Iface := Related_Type (Node (Comp_Elmt));
1643 if Comp_Iface = Iface
1644 or else Is_Ancestor (Iface, Comp_Iface)
1646 Append_Elmt (Node (Comp_Elmt), Components_List);
1647 Append_Elmt (Search_Tag (Comp_Iface), Tags_List);
1651 Next_Elmt (Comp_Elmt);
1653 pragma Assert (Present (Comp_Elmt));
1656 Next_Elmt (Iface_Elmt);
1658 end Collect_Interfaces_Info;
1660 ----------------------------------
1661 -- Collect_Primitive_Operations --
1662 ----------------------------------
1664 function Collect_Primitive_Operations (T : Entity_Id) return Elist_Id is
1665 B_Type : constant Entity_Id := Base_Type (T);
1666 B_Decl : constant Node_Id := Original_Node (Parent (B_Type));
1667 B_Scope : Entity_Id := Scope (B_Type);
1671 Formal_Derived : Boolean := False;
1675 -- For tagged types, the primitive operations are collected as they
1676 -- are declared, and held in an explicit list which is simply returned.
1678 if Is_Tagged_Type (B_Type) then
1679 return Primitive_Operations (B_Type);
1681 -- An untagged generic type that is a derived type inherits the
1682 -- primitive operations of its parent type. Other formal types only
1683 -- have predefined operators, which are not explicitly represented.
1685 elsif Is_Generic_Type (B_Type) then
1686 if Nkind (B_Decl) = N_Formal_Type_Declaration
1687 and then Nkind (Formal_Type_Definition (B_Decl))
1688 = N_Formal_Derived_Type_Definition
1690 Formal_Derived := True;
1692 return New_Elmt_List;
1696 Op_List := New_Elmt_List;
1698 if B_Scope = Standard_Standard then
1699 if B_Type = Standard_String then
1700 Append_Elmt (Standard_Op_Concat, Op_List);
1702 elsif B_Type = Standard_Wide_String then
1703 Append_Elmt (Standard_Op_Concatw, Op_List);
1709 elsif (Is_Package_Or_Generic_Package (B_Scope)
1711 Nkind (Parent (Declaration_Node (First_Subtype (T)))) /=
1713 or else Is_Derived_Type (B_Type)
1715 -- The primitive operations appear after the base type, except
1716 -- if the derivation happens within the private part of B_Scope
1717 -- and the type is a private type, in which case both the type
1718 -- and some primitive operations may appear before the base
1719 -- type, and the list of candidates starts after the type.
1721 if In_Open_Scopes (B_Scope)
1722 and then Scope (T) = B_Scope
1723 and then In_Private_Part (B_Scope)
1725 Id := Next_Entity (T);
1727 Id := Next_Entity (B_Type);
1730 while Present (Id) loop
1732 -- Note that generic formal subprograms are not
1733 -- considered to be primitive operations and thus
1734 -- are never inherited.
1736 if Is_Overloadable (Id)
1737 and then Nkind (Parent (Parent (Id)))
1738 not in N_Formal_Subprogram_Declaration
1742 if Base_Type (Etype (Id)) = B_Type then
1745 Formal := First_Formal (Id);
1746 while Present (Formal) loop
1747 if Base_Type (Etype (Formal)) = B_Type then
1751 elsif Ekind (Etype (Formal)) = E_Anonymous_Access_Type
1753 (Designated_Type (Etype (Formal))) = B_Type
1759 Next_Formal (Formal);
1763 -- For a formal derived type, the only primitives are the
1764 -- ones inherited from the parent type. Operations appearing
1765 -- in the package declaration are not primitive for it.
1768 and then (not Formal_Derived
1769 or else Present (Alias (Id)))
1771 -- In the special case of an equality operator aliased to
1772 -- an overriding dispatching equality belonging to the same
1773 -- type, we don't include it in the list of primitives.
1774 -- This avoids inheriting multiple equality operators when
1775 -- deriving from untagged private types whose full type is
1776 -- tagged, which can otherwise cause ambiguities. Note that
1777 -- this should only happen for this kind of untagged parent
1778 -- type, since normally dispatching operations are inherited
1779 -- using the type's Primitive_Operations list.
1781 if Chars (Id) = Name_Op_Eq
1782 and then Is_Dispatching_Operation (Id)
1783 and then Present (Alias (Id))
1784 and then Is_Overriding_Operation (Alias (Id))
1785 and then Base_Type (Etype (First_Entity (Id))) =
1786 Base_Type (Etype (First_Entity (Alias (Id))))
1790 -- Include the subprogram in the list of primitives
1793 Append_Elmt (Id, Op_List);
1800 -- For a type declared in System, some of its operations may
1801 -- appear in the target-specific extension to System.
1804 and then B_Scope = RTU_Entity (System)
1805 and then Present_System_Aux
1807 B_Scope := System_Aux_Id;
1808 Id := First_Entity (System_Aux_Id);
1814 end Collect_Primitive_Operations;
1816 -----------------------------------
1817 -- Compile_Time_Constraint_Error --
1818 -----------------------------------
1820 function Compile_Time_Constraint_Error
1823 Ent : Entity_Id := Empty;
1824 Loc : Source_Ptr := No_Location;
1825 Warn : Boolean := False) return Node_Id
1827 Msgc : String (1 .. Msg'Length + 2);
1828 -- Copy of message, with room for possible ? and ! at end
1838 -- A static constraint error in an instance body is not a fatal error.
1839 -- we choose to inhibit the message altogether, because there is no
1840 -- obvious node (for now) on which to post it. On the other hand the
1841 -- offending node must be replaced with a constraint_error in any case.
1843 -- No messages are generated if we already posted an error on this node
1845 if not Error_Posted (N) then
1846 if Loc /= No_Location then
1852 Msgc (1 .. Msg'Length) := Msg;
1855 -- Message is a warning, even in Ada 95 case
1857 if Msg (Msg'Last) = '?' then
1860 -- In Ada 83, all messages are warnings. In the private part and
1861 -- the body of an instance, constraint_checks are only warnings.
1862 -- We also make this a warning if the Warn parameter is set.
1865 or else (Ada_Version = Ada_83 and then Comes_From_Source (N))
1871 elsif In_Instance_Not_Visible then
1876 -- Otherwise we have a real error message (Ada 95 static case)
1877 -- and we make this an unconditional message. Note that in the
1878 -- warning case we do not make the message unconditional, it seems
1879 -- quite reasonable to delete messages like this (about exceptions
1880 -- that will be raised) in dead code.
1888 -- Should we generate a warning? The answer is not quite yes. The
1889 -- very annoying exception occurs in the case of a short circuit
1890 -- operator where the left operand is static and decisive. Climb
1891 -- parents to see if that is the case we have here. Conditional
1892 -- expressions with decisive conditions are a similar situation.
1900 -- And then with False as left operand
1902 if Nkind (P) = N_And_Then
1903 and then Compile_Time_Known_Value (Left_Opnd (P))
1904 and then Is_False (Expr_Value (Left_Opnd (P)))
1909 -- OR ELSE with True as left operand
1911 elsif Nkind (P) = N_Or_Else
1912 and then Compile_Time_Known_Value (Left_Opnd (P))
1913 and then Is_True (Expr_Value (Left_Opnd (P)))
1918 -- Conditional expression
1920 elsif Nkind (P) = N_Conditional_Expression then
1922 Cond : constant Node_Id := First (Expressions (P));
1923 Texp : constant Node_Id := Next (Cond);
1924 Fexp : constant Node_Id := Next (Texp);
1927 if Compile_Time_Known_Value (Cond) then
1929 -- Condition is True and we are in the right operand
1931 if Is_True (Expr_Value (Cond))
1932 and then OldP = Fexp
1937 -- Condition is False and we are in the left operand
1939 elsif Is_False (Expr_Value (Cond))
1940 and then OldP = Texp
1948 -- Special case for component association in aggregates, where
1949 -- we want to keep climbing up to the parent aggregate.
1951 elsif Nkind (P) = N_Component_Association
1952 and then Nkind (Parent (P)) = N_Aggregate
1956 -- Keep going if within subexpression
1959 exit when Nkind (P) not in N_Subexpr;
1964 if Present (Ent) then
1965 Error_Msg_NEL (Msgc (1 .. Msgl), N, Ent, Eloc);
1967 Error_Msg_NEL (Msgc (1 .. Msgl), N, Etype (N), Eloc);
1971 if Inside_Init_Proc then
1973 ("\?& will be raised for objects of this type",
1974 N, Standard_Constraint_Error, Eloc);
1977 ("\?& will be raised at run time",
1978 N, Standard_Constraint_Error, Eloc);
1983 ("\static expression fails Constraint_Check", Eloc);
1984 Set_Error_Posted (N);
1990 end Compile_Time_Constraint_Error;
1992 -----------------------
1993 -- Conditional_Delay --
1994 -----------------------
1996 procedure Conditional_Delay (New_Ent, Old_Ent : Entity_Id) is
1998 if Has_Delayed_Freeze (Old_Ent) and then not Is_Frozen (Old_Ent) then
1999 Set_Has_Delayed_Freeze (New_Ent);
2001 end Conditional_Delay;
2003 -------------------------
2004 -- Copy_Parameter_List --
2005 -------------------------
2007 function Copy_Parameter_List (Subp_Id : Entity_Id) return List_Id is
2008 Loc : constant Source_Ptr := Sloc (Subp_Id);
2013 if No (First_Formal (Subp_Id)) then
2017 Formal := First_Formal (Subp_Id);
2018 while Present (Formal) loop
2020 (Make_Parameter_Specification (Loc,
2021 Defining_Identifier =>
2022 Make_Defining_Identifier (Sloc (Formal),
2023 Chars => Chars (Formal)),
2024 In_Present => In_Present (Parent (Formal)),
2025 Out_Present => Out_Present (Parent (Formal)),
2027 New_Reference_To (Etype (Formal), Loc),
2029 New_Copy_Tree (Expression (Parent (Formal)))),
2032 Next_Formal (Formal);
2037 end Copy_Parameter_List;
2039 --------------------
2040 -- Current_Entity --
2041 --------------------
2043 -- The currently visible definition for a given identifier is the
2044 -- one most chained at the start of the visibility chain, i.e. the
2045 -- one that is referenced by the Node_Id value of the name of the
2046 -- given identifier.
2048 function Current_Entity (N : Node_Id) return Entity_Id is
2050 return Get_Name_Entity_Id (Chars (N));
2053 -----------------------------
2054 -- Current_Entity_In_Scope --
2055 -----------------------------
2057 function Current_Entity_In_Scope (N : Node_Id) return Entity_Id is
2059 CS : constant Entity_Id := Current_Scope;
2061 Transient_Case : constant Boolean := Scope_Is_Transient;
2064 E := Get_Name_Entity_Id (Chars (N));
2066 and then Scope (E) /= CS
2067 and then (not Transient_Case or else Scope (E) /= Scope (CS))
2073 end Current_Entity_In_Scope;
2079 function Current_Scope return Entity_Id is
2081 if Scope_Stack.Last = -1 then
2082 return Standard_Standard;
2085 C : constant Entity_Id :=
2086 Scope_Stack.Table (Scope_Stack.Last).Entity;
2091 return Standard_Standard;
2097 ------------------------
2098 -- Current_Subprogram --
2099 ------------------------
2101 function Current_Subprogram return Entity_Id is
2102 Scop : constant Entity_Id := Current_Scope;
2104 if Is_Subprogram (Scop) or else Is_Generic_Subprogram (Scop) then
2107 return Enclosing_Subprogram (Scop);
2109 end Current_Subprogram;
2111 ---------------------
2112 -- Defining_Entity --
2113 ---------------------
2115 function Defining_Entity (N : Node_Id) return Entity_Id is
2116 K : constant Node_Kind := Nkind (N);
2117 Err : Entity_Id := Empty;
2122 N_Subprogram_Declaration |
2123 N_Abstract_Subprogram_Declaration |
2125 N_Package_Declaration |
2126 N_Subprogram_Renaming_Declaration |
2127 N_Subprogram_Body_Stub |
2128 N_Generic_Subprogram_Declaration |
2129 N_Generic_Package_Declaration |
2130 N_Formal_Subprogram_Declaration
2132 return Defining_Entity (Specification (N));
2135 N_Component_Declaration |
2136 N_Defining_Program_Unit_Name |
2137 N_Discriminant_Specification |
2139 N_Entry_Declaration |
2140 N_Entry_Index_Specification |
2141 N_Exception_Declaration |
2142 N_Exception_Renaming_Declaration |
2143 N_Formal_Object_Declaration |
2144 N_Formal_Package_Declaration |
2145 N_Formal_Type_Declaration |
2146 N_Full_Type_Declaration |
2147 N_Implicit_Label_Declaration |
2148 N_Incomplete_Type_Declaration |
2149 N_Loop_Parameter_Specification |
2150 N_Number_Declaration |
2151 N_Object_Declaration |
2152 N_Object_Renaming_Declaration |
2153 N_Package_Body_Stub |
2154 N_Parameter_Specification |
2155 N_Private_Extension_Declaration |
2156 N_Private_Type_Declaration |
2158 N_Protected_Body_Stub |
2159 N_Protected_Type_Declaration |
2160 N_Single_Protected_Declaration |
2161 N_Single_Task_Declaration |
2162 N_Subtype_Declaration |
2165 N_Task_Type_Declaration
2167 return Defining_Identifier (N);
2170 return Defining_Entity (Proper_Body (N));
2173 N_Function_Instantiation |
2174 N_Function_Specification |
2175 N_Generic_Function_Renaming_Declaration |
2176 N_Generic_Package_Renaming_Declaration |
2177 N_Generic_Procedure_Renaming_Declaration |
2179 N_Package_Instantiation |
2180 N_Package_Renaming_Declaration |
2181 N_Package_Specification |
2182 N_Procedure_Instantiation |
2183 N_Procedure_Specification
2186 Nam : constant Node_Id := Defining_Unit_Name (N);
2189 if Nkind (Nam) in N_Entity then
2192 -- For Error, make up a name and attach to declaration
2193 -- so we can continue semantic analysis
2195 elsif Nam = Error then
2196 Err := Make_Temporary (Sloc (N), 'T');
2197 Set_Defining_Unit_Name (N, Err);
2200 -- If not an entity, get defining identifier
2203 return Defining_Identifier (Nam);
2207 when N_Block_Statement =>
2208 return Entity (Identifier (N));
2211 raise Program_Error;
2214 end Defining_Entity;
2216 --------------------------
2217 -- Denotes_Discriminant --
2218 --------------------------
2220 function Denotes_Discriminant
2222 Check_Concurrent : Boolean := False) return Boolean
2226 if not Is_Entity_Name (N)
2227 or else No (Entity (N))
2234 -- If we are checking for a protected type, the discriminant may have
2235 -- been rewritten as the corresponding discriminal of the original type
2236 -- or of the corresponding concurrent record, depending on whether we
2237 -- are in the spec or body of the protected type.
2239 return Ekind (E) = E_Discriminant
2242 and then Ekind (E) = E_In_Parameter
2243 and then Present (Discriminal_Link (E))
2245 (Is_Concurrent_Type (Scope (Discriminal_Link (E)))
2247 Is_Concurrent_Record_Type (Scope (Discriminal_Link (E)))));
2249 end Denotes_Discriminant;
2251 -------------------------
2252 -- Denotes_Same_Object --
2253 -------------------------
2255 function Denotes_Same_Object (A1, A2 : Node_Id) return Boolean is
2257 -- If we have entity names, then must be same entity
2259 if Is_Entity_Name (A1) then
2260 if Is_Entity_Name (A2) then
2261 return Entity (A1) = Entity (A2);
2266 -- No match if not same node kind
2268 elsif Nkind (A1) /= Nkind (A2) then
2271 -- For selected components, must have same prefix and selector
2273 elsif Nkind (A1) = N_Selected_Component then
2274 return Denotes_Same_Object (Prefix (A1), Prefix (A2))
2276 Entity (Selector_Name (A1)) = Entity (Selector_Name (A2));
2278 -- For explicit dereferences, prefixes must be same
2280 elsif Nkind (A1) = N_Explicit_Dereference then
2281 return Denotes_Same_Object (Prefix (A1), Prefix (A2));
2283 -- For indexed components, prefixes and all subscripts must be the same
2285 elsif Nkind (A1) = N_Indexed_Component then
2286 if Denotes_Same_Object (Prefix (A1), Prefix (A2)) then
2292 Indx1 := First (Expressions (A1));
2293 Indx2 := First (Expressions (A2));
2294 while Present (Indx1) loop
2296 -- Shouldn't we be checking that values are the same???
2298 if not Denotes_Same_Object (Indx1, Indx2) then
2312 -- For slices, prefixes must match and bounds must match
2314 elsif Nkind (A1) = N_Slice
2315 and then Denotes_Same_Object (Prefix (A1), Prefix (A2))
2318 Lo1, Lo2, Hi1, Hi2 : Node_Id;
2321 Get_Index_Bounds (Etype (A1), Lo1, Hi1);
2322 Get_Index_Bounds (Etype (A2), Lo2, Hi2);
2324 -- Check whether bounds are statically identical. There is no
2325 -- attempt to detect partial overlap of slices.
2327 -- What about an array and a slice of an array???
2329 return Denotes_Same_Object (Lo1, Lo2)
2330 and then Denotes_Same_Object (Hi1, Hi2);
2333 -- Literals will appear as indices. Isn't this where we should check
2334 -- Known_At_Compile_Time at least if we are generating warnings ???
2336 elsif Nkind (A1) = N_Integer_Literal then
2337 return Intval (A1) = Intval (A2);
2342 end Denotes_Same_Object;
2344 -------------------------
2345 -- Denotes_Same_Prefix --
2346 -------------------------
2348 function Denotes_Same_Prefix (A1, A2 : Node_Id) return Boolean is
2351 if Is_Entity_Name (A1) then
2352 if Nkind_In (A2, N_Selected_Component, N_Indexed_Component)
2353 and then not Is_Access_Type (Etype (A1))
2355 return Denotes_Same_Object (A1, Prefix (A2))
2356 or else Denotes_Same_Prefix (A1, Prefix (A2));
2361 elsif Is_Entity_Name (A2) then
2362 return Denotes_Same_Prefix (A2, A1);
2364 elsif Nkind_In (A1, N_Selected_Component, N_Indexed_Component, N_Slice)
2366 Nkind_In (A2, N_Selected_Component, N_Indexed_Component, N_Slice)
2369 Root1, Root2 : Node_Id;
2370 Depth1, Depth2 : Int := 0;
2373 Root1 := Prefix (A1);
2374 while not Is_Entity_Name (Root1) loop
2376 (Root1, N_Selected_Component, N_Indexed_Component)
2380 Root1 := Prefix (Root1);
2383 Depth1 := Depth1 + 1;
2386 Root2 := Prefix (A2);
2387 while not Is_Entity_Name (Root2) loop
2389 (Root2, N_Selected_Component, N_Indexed_Component)
2393 Root2 := Prefix (Root2);
2396 Depth2 := Depth2 + 1;
2399 -- If both have the same depth and they do not denote the same
2400 -- object, they are disjoint and not warning is needed.
2402 if Depth1 = Depth2 then
2405 elsif Depth1 > Depth2 then
2406 Root1 := Prefix (A1);
2407 for I in 1 .. Depth1 - Depth2 - 1 loop
2408 Root1 := Prefix (Root1);
2411 return Denotes_Same_Object (Root1, A2);
2414 Root2 := Prefix (A2);
2415 for I in 1 .. Depth2 - Depth1 - 1 loop
2416 Root2 := Prefix (Root2);
2419 return Denotes_Same_Object (A1, Root2);
2426 end Denotes_Same_Prefix;
2428 ----------------------
2429 -- Denotes_Variable --
2430 ----------------------
2432 function Denotes_Variable (N : Node_Id) return Boolean is
2434 return Is_Variable (N) and then Paren_Count (N) = 0;
2435 end Denotes_Variable;
2437 -----------------------------
2438 -- Depends_On_Discriminant --
2439 -----------------------------
2441 function Depends_On_Discriminant (N : Node_Id) return Boolean is
2446 Get_Index_Bounds (N, L, H);
2447 return Denotes_Discriminant (L) or else Denotes_Discriminant (H);
2448 end Depends_On_Discriminant;
2450 -------------------------
2451 -- Designate_Same_Unit --
2452 -------------------------
2454 function Designate_Same_Unit
2456 Name2 : Node_Id) return Boolean
2458 K1 : constant Node_Kind := Nkind (Name1);
2459 K2 : constant Node_Kind := Nkind (Name2);
2461 function Prefix_Node (N : Node_Id) return Node_Id;
2462 -- Returns the parent unit name node of a defining program unit name
2463 -- or the prefix if N is a selected component or an expanded name.
2465 function Select_Node (N : Node_Id) return Node_Id;
2466 -- Returns the defining identifier node of a defining program unit
2467 -- name or the selector node if N is a selected component or an
2474 function Prefix_Node (N : Node_Id) return Node_Id is
2476 if Nkind (N) = N_Defining_Program_Unit_Name then
2488 function Select_Node (N : Node_Id) return Node_Id is
2490 if Nkind (N) = N_Defining_Program_Unit_Name then
2491 return Defining_Identifier (N);
2494 return Selector_Name (N);
2498 -- Start of processing for Designate_Next_Unit
2501 if (K1 = N_Identifier or else
2502 K1 = N_Defining_Identifier)
2504 (K2 = N_Identifier or else
2505 K2 = N_Defining_Identifier)
2507 return Chars (Name1) = Chars (Name2);
2510 (K1 = N_Expanded_Name or else
2511 K1 = N_Selected_Component or else
2512 K1 = N_Defining_Program_Unit_Name)
2514 (K2 = N_Expanded_Name or else
2515 K2 = N_Selected_Component or else
2516 K2 = N_Defining_Program_Unit_Name)
2519 (Chars (Select_Node (Name1)) = Chars (Select_Node (Name2)))
2521 Designate_Same_Unit (Prefix_Node (Name1), Prefix_Node (Name2));
2526 end Designate_Same_Unit;
2528 --------------------------
2529 -- Enclosing_CPP_Parent --
2530 --------------------------
2532 function Enclosing_CPP_Parent (Typ : Entity_Id) return Entity_Id is
2533 Parent_Typ : Entity_Id := Typ;
2536 while not Is_CPP_Class (Parent_Typ)
2537 and then Etype (Parent_Typ) /= Parent_Typ
2539 Parent_Typ := Etype (Parent_Typ);
2541 if Is_Private_Type (Parent_Typ) then
2542 Parent_Typ := Full_View (Base_Type (Parent_Typ));
2546 pragma Assert (Is_CPP_Class (Parent_Typ));
2548 end Enclosing_CPP_Parent;
2550 ----------------------------
2551 -- Enclosing_Generic_Body --
2552 ----------------------------
2554 function Enclosing_Generic_Body
2555 (N : Node_Id) return Node_Id
2563 while Present (P) loop
2564 if Nkind (P) = N_Package_Body
2565 or else Nkind (P) = N_Subprogram_Body
2567 Spec := Corresponding_Spec (P);
2569 if Present (Spec) then
2570 Decl := Unit_Declaration_Node (Spec);
2572 if Nkind (Decl) = N_Generic_Package_Declaration
2573 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2584 end Enclosing_Generic_Body;
2586 ----------------------------
2587 -- Enclosing_Generic_Unit --
2588 ----------------------------
2590 function Enclosing_Generic_Unit
2591 (N : Node_Id) return Node_Id
2599 while Present (P) loop
2600 if Nkind (P) = N_Generic_Package_Declaration
2601 or else Nkind (P) = N_Generic_Subprogram_Declaration
2605 elsif Nkind (P) = N_Package_Body
2606 or else Nkind (P) = N_Subprogram_Body
2608 Spec := Corresponding_Spec (P);
2610 if Present (Spec) then
2611 Decl := Unit_Declaration_Node (Spec);
2613 if Nkind (Decl) = N_Generic_Package_Declaration
2614 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2625 end Enclosing_Generic_Unit;
2627 -------------------------------
2628 -- Enclosing_Lib_Unit_Entity --
2629 -------------------------------
2631 function Enclosing_Lib_Unit_Entity return Entity_Id is
2632 Unit_Entity : Entity_Id;
2635 -- Look for enclosing library unit entity by following scope links.
2636 -- Equivalent to, but faster than indexing through the scope stack.
2638 Unit_Entity := Current_Scope;
2639 while (Present (Scope (Unit_Entity))
2640 and then Scope (Unit_Entity) /= Standard_Standard)
2641 and not Is_Child_Unit (Unit_Entity)
2643 Unit_Entity := Scope (Unit_Entity);
2647 end Enclosing_Lib_Unit_Entity;
2649 -----------------------------
2650 -- Enclosing_Lib_Unit_Node --
2651 -----------------------------
2653 function Enclosing_Lib_Unit_Node (N : Node_Id) return Node_Id is
2654 Current_Node : Node_Id;
2658 while Present (Current_Node)
2659 and then Nkind (Current_Node) /= N_Compilation_Unit
2661 Current_Node := Parent (Current_Node);
2664 if Nkind (Current_Node) /= N_Compilation_Unit then
2668 return Current_Node;
2669 end Enclosing_Lib_Unit_Node;
2671 --------------------------
2672 -- Enclosing_Subprogram --
2673 --------------------------
2675 function Enclosing_Subprogram (E : Entity_Id) return Entity_Id is
2676 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
2679 if Dynamic_Scope = Standard_Standard then
2682 elsif Dynamic_Scope = Empty then
2685 elsif Ekind (Dynamic_Scope) = E_Subprogram_Body then
2686 return Corresponding_Spec (Parent (Parent (Dynamic_Scope)));
2688 elsif Ekind (Dynamic_Scope) = E_Block
2689 or else Ekind (Dynamic_Scope) = E_Return_Statement
2691 return Enclosing_Subprogram (Dynamic_Scope);
2693 elsif Ekind (Dynamic_Scope) = E_Task_Type then
2694 return Get_Task_Body_Procedure (Dynamic_Scope);
2696 -- No body is generated if the protected operation is eliminated
2698 elsif Convention (Dynamic_Scope) = Convention_Protected
2699 and then not Is_Eliminated (Dynamic_Scope)
2700 and then Present (Protected_Body_Subprogram (Dynamic_Scope))
2702 return Protected_Body_Subprogram (Dynamic_Scope);
2705 return Dynamic_Scope;
2707 end Enclosing_Subprogram;
2709 ------------------------
2710 -- Ensure_Freeze_Node --
2711 ------------------------
2713 procedure Ensure_Freeze_Node (E : Entity_Id) is
2717 if No (Freeze_Node (E)) then
2718 FN := Make_Freeze_Entity (Sloc (E));
2719 Set_Has_Delayed_Freeze (E);
2720 Set_Freeze_Node (E, FN);
2721 Set_Access_Types_To_Process (FN, No_Elist);
2722 Set_TSS_Elist (FN, No_Elist);
2725 end Ensure_Freeze_Node;
2731 procedure Enter_Name (Def_Id : Entity_Id) is
2732 C : constant Entity_Id := Current_Entity (Def_Id);
2733 E : constant Entity_Id := Current_Entity_In_Scope (Def_Id);
2734 S : constant Entity_Id := Current_Scope;
2737 Generate_Definition (Def_Id);
2739 -- Add new name to current scope declarations. Check for duplicate
2740 -- declaration, which may or may not be a genuine error.
2744 -- Case of previous entity entered because of a missing declaration
2745 -- or else a bad subtype indication. Best is to use the new entity,
2746 -- and make the previous one invisible.
2748 if Etype (E) = Any_Type then
2749 Set_Is_Immediately_Visible (E, False);
2751 -- Case of renaming declaration constructed for package instances.
2752 -- if there is an explicit declaration with the same identifier,
2753 -- the renaming is not immediately visible any longer, but remains
2754 -- visible through selected component notation.
2756 elsif Nkind (Parent (E)) = N_Package_Renaming_Declaration
2757 and then not Comes_From_Source (E)
2759 Set_Is_Immediately_Visible (E, False);
2761 -- The new entity may be the package renaming, which has the same
2762 -- same name as a generic formal which has been seen already.
2764 elsif Nkind (Parent (Def_Id)) = N_Package_Renaming_Declaration
2765 and then not Comes_From_Source (Def_Id)
2767 Set_Is_Immediately_Visible (E, False);
2769 -- For a fat pointer corresponding to a remote access to subprogram,
2770 -- we use the same identifier as the RAS type, so that the proper
2771 -- name appears in the stub. This type is only retrieved through
2772 -- the RAS type and never by visibility, and is not added to the
2773 -- visibility list (see below).
2775 elsif Nkind (Parent (Def_Id)) = N_Full_Type_Declaration
2776 and then Present (Corresponding_Remote_Type (Def_Id))
2780 -- A controller component for a type extension overrides the
2781 -- inherited component.
2783 elsif Chars (E) = Name_uController then
2786 -- Case of an implicit operation or derived literal. The new entity
2787 -- hides the implicit one, which is removed from all visibility,
2788 -- i.e. the entity list of its scope, and homonym chain of its name.
2790 elsif (Is_Overloadable (E) and then Is_Inherited_Operation (E))
2791 or else Is_Internal (E)
2795 Prev_Vis : Entity_Id;
2796 Decl : constant Node_Id := Parent (E);
2799 -- If E is an implicit declaration, it cannot be the first
2800 -- entity in the scope.
2802 Prev := First_Entity (Current_Scope);
2803 while Present (Prev)
2804 and then Next_Entity (Prev) /= E
2811 -- If E is not on the entity chain of the current scope,
2812 -- it is an implicit declaration in the generic formal
2813 -- part of a generic subprogram. When analyzing the body,
2814 -- the generic formals are visible but not on the entity
2815 -- chain of the subprogram. The new entity will become
2816 -- the visible one in the body.
2819 (Nkind (Parent (Decl)) = N_Generic_Subprogram_Declaration);
2823 Set_Next_Entity (Prev, Next_Entity (E));
2825 if No (Next_Entity (Prev)) then
2826 Set_Last_Entity (Current_Scope, Prev);
2829 if E = Current_Entity (E) then
2833 Prev_Vis := Current_Entity (E);
2834 while Homonym (Prev_Vis) /= E loop
2835 Prev_Vis := Homonym (Prev_Vis);
2839 if Present (Prev_Vis) then
2841 -- Skip E in the visibility chain
2843 Set_Homonym (Prev_Vis, Homonym (E));
2846 Set_Name_Entity_Id (Chars (E), Homonym (E));
2851 -- This section of code could use a comment ???
2853 elsif Present (Etype (E))
2854 and then Is_Concurrent_Type (Etype (E))
2859 -- If the homograph is a protected component renaming, it should not
2860 -- be hiding the current entity. Such renamings are treated as weak
2863 elsif Is_Prival (E) then
2864 Set_Is_Immediately_Visible (E, False);
2866 -- In this case the current entity is a protected component renaming.
2867 -- Perform minimal decoration by setting the scope and return since
2868 -- the prival should not be hiding other visible entities.
2870 elsif Is_Prival (Def_Id) then
2871 Set_Scope (Def_Id, Current_Scope);
2874 -- Analogous to privals, the discriminal generated for an entry
2875 -- index parameter acts as a weak declaration. Perform minimal
2876 -- decoration to avoid bogus errors.
2878 elsif Is_Discriminal (Def_Id)
2879 and then Ekind (Discriminal_Link (Def_Id)) = E_Entry_Index_Parameter
2881 Set_Scope (Def_Id, Current_Scope);
2884 -- In the body or private part of an instance, a type extension
2885 -- may introduce a component with the same name as that of an
2886 -- actual. The legality rule is not enforced, but the semantics
2887 -- of the full type with two components of the same name are not
2888 -- clear at this point ???
2890 elsif In_Instance_Not_Visible then
2893 -- When compiling a package body, some child units may have become
2894 -- visible. They cannot conflict with local entities that hide them.
2896 elsif Is_Child_Unit (E)
2897 and then In_Open_Scopes (Scope (E))
2898 and then not Is_Immediately_Visible (E)
2902 -- Conversely, with front-end inlining we may compile the parent
2903 -- body first, and a child unit subsequently. The context is now
2904 -- the parent spec, and body entities are not visible.
2906 elsif Is_Child_Unit (Def_Id)
2907 and then Is_Package_Body_Entity (E)
2908 and then not In_Package_Body (Current_Scope)
2912 -- Case of genuine duplicate declaration
2915 Error_Msg_Sloc := Sloc (E);
2917 -- If the previous declaration is an incomplete type declaration
2918 -- this may be an attempt to complete it with a private type.
2919 -- The following avoids confusing cascaded errors.
2921 if Nkind (Parent (E)) = N_Incomplete_Type_Declaration
2922 and then Nkind (Parent (Def_Id)) = N_Private_Type_Declaration
2925 ("incomplete type cannot be completed with a private " &
2926 "declaration", Parent (Def_Id));
2927 Set_Is_Immediately_Visible (E, False);
2928 Set_Full_View (E, Def_Id);
2930 -- An inherited component of a record conflicts with a new
2931 -- discriminant. The discriminant is inserted first in the scope,
2932 -- but the error should be posted on it, not on the component.
2934 elsif Ekind (E) = E_Discriminant
2935 and then Present (Scope (Def_Id))
2936 and then Scope (Def_Id) /= Current_Scope
2938 Error_Msg_Sloc := Sloc (Def_Id);
2939 Error_Msg_N ("& conflicts with declaration#", E);
2942 -- If the name of the unit appears in its own context clause,
2943 -- a dummy package with the name has already been created, and
2944 -- the error emitted. Try to continue quietly.
2946 elsif Error_Posted (E)
2947 and then Sloc (E) = No_Location
2948 and then Nkind (Parent (E)) = N_Package_Specification
2949 and then Current_Scope = Standard_Standard
2951 Set_Scope (Def_Id, Current_Scope);
2955 Error_Msg_N ("& conflicts with declaration#", Def_Id);
2957 -- Avoid cascaded messages with duplicate components in
2960 if Ekind_In (E, E_Component, E_Discriminant) then
2965 if Nkind (Parent (Parent (Def_Id))) =
2966 N_Generic_Subprogram_Declaration
2968 Defining_Entity (Specification (Parent (Parent (Def_Id))))
2970 Error_Msg_N ("\generic units cannot be overloaded", Def_Id);
2973 -- If entity is in standard, then we are in trouble, because
2974 -- it means that we have a library package with a duplicated
2975 -- name. That's hard to recover from, so abort!
2977 if S = Standard_Standard then
2978 raise Unrecoverable_Error;
2980 -- Otherwise we continue with the declaration. Having two
2981 -- identical declarations should not cause us too much trouble!
2989 -- If we fall through, declaration is OK , or OK enough to continue
2991 -- If Def_Id is a discriminant or a record component we are in the
2992 -- midst of inheriting components in a derived record definition.
2993 -- Preserve their Ekind and Etype.
2995 if Ekind_In (Def_Id, E_Discriminant, E_Component) then
2998 -- If a type is already set, leave it alone (happens whey a type
2999 -- declaration is reanalyzed following a call to the optimizer)
3001 elsif Present (Etype (Def_Id)) then
3004 -- Otherwise, the kind E_Void insures that premature uses of the entity
3005 -- will be detected. Any_Type insures that no cascaded errors will occur
3008 Set_Ekind (Def_Id, E_Void);
3009 Set_Etype (Def_Id, Any_Type);
3012 -- Inherited discriminants and components in derived record types are
3013 -- immediately visible. Itypes are not.
3015 if Ekind_In (Def_Id, E_Discriminant, E_Component)
3016 or else (No (Corresponding_Remote_Type (Def_Id))
3017 and then not Is_Itype (Def_Id))
3019 Set_Is_Immediately_Visible (Def_Id);
3020 Set_Current_Entity (Def_Id);
3023 Set_Homonym (Def_Id, C);
3024 Append_Entity (Def_Id, S);
3025 Set_Public_Status (Def_Id);
3027 -- Warn if new entity hides an old one
3029 if Warn_On_Hiding and then Present (C)
3031 -- Don't warn for record components since they always have a well
3032 -- defined scope which does not confuse other uses. Note that in
3033 -- some cases, Ekind has not been set yet.
3035 and then Ekind (C) /= E_Component
3036 and then Ekind (C) /= E_Discriminant
3037 and then Nkind (Parent (C)) /= N_Component_Declaration
3038 and then Ekind (Def_Id) /= E_Component
3039 and then Ekind (Def_Id) /= E_Discriminant
3040 and then Nkind (Parent (Def_Id)) /= N_Component_Declaration
3042 -- Don't warn for one character variables. It is too common to use
3043 -- such variables as locals and will just cause too many false hits.
3045 and then Length_Of_Name (Chars (C)) /= 1
3047 -- Don't warn for non-source entities
3049 and then Comes_From_Source (C)
3050 and then Comes_From_Source (Def_Id)
3052 -- Don't warn unless entity in question is in extended main source
3054 and then In_Extended_Main_Source_Unit (Def_Id)
3056 -- Finally, the hidden entity must be either immediately visible
3057 -- or use visible (from a used package)
3060 (Is_Immediately_Visible (C)
3062 Is_Potentially_Use_Visible (C))
3064 Error_Msg_Sloc := Sloc (C);
3065 Error_Msg_N ("declaration hides &#?", Def_Id);
3069 --------------------------
3070 -- Explain_Limited_Type --
3071 --------------------------
3073 procedure Explain_Limited_Type (T : Entity_Id; N : Node_Id) is
3077 -- For array, component type must be limited
3079 if Is_Array_Type (T) then
3080 Error_Msg_Node_2 := T;
3082 ("\component type& of type& is limited", N, Component_Type (T));
3083 Explain_Limited_Type (Component_Type (T), N);
3085 elsif Is_Record_Type (T) then
3087 -- No need for extra messages if explicit limited record
3089 if Is_Limited_Record (Base_Type (T)) then
3093 -- Otherwise find a limited component. Check only components that
3094 -- come from source, or inherited components that appear in the
3095 -- source of the ancestor.
3097 C := First_Component (T);
3098 while Present (C) loop
3099 if Is_Limited_Type (Etype (C))
3101 (Comes_From_Source (C)
3103 (Present (Original_Record_Component (C))
3105 Comes_From_Source (Original_Record_Component (C))))
3107 Error_Msg_Node_2 := T;
3108 Error_Msg_NE ("\component& of type& has limited type", N, C);
3109 Explain_Limited_Type (Etype (C), N);
3116 -- The type may be declared explicitly limited, even if no component
3117 -- of it is limited, in which case we fall out of the loop.
3120 end Explain_Limited_Type;
3126 procedure Find_Actual
3128 Formal : out Entity_Id;
3131 Parnt : constant Node_Id := Parent (N);
3135 if (Nkind (Parnt) = N_Indexed_Component
3137 Nkind (Parnt) = N_Selected_Component)
3138 and then N = Prefix (Parnt)
3140 Find_Actual (Parnt, Formal, Call);
3143 elsif Nkind (Parnt) = N_Parameter_Association
3144 and then N = Explicit_Actual_Parameter (Parnt)
3146 Call := Parent (Parnt);
3148 elsif Nkind (Parnt) = N_Procedure_Call_Statement then
3157 -- If we have a call to a subprogram look for the parameter. Note that
3158 -- we exclude overloaded calls, since we don't know enough to be sure
3159 -- of giving the right answer in this case.
3161 if Is_Entity_Name (Name (Call))
3162 and then Present (Entity (Name (Call)))
3163 and then Is_Overloadable (Entity (Name (Call)))
3164 and then not Is_Overloaded (Name (Call))
3166 -- Fall here if we are definitely a parameter
3168 Actual := First_Actual (Call);
3169 Formal := First_Formal (Entity (Name (Call)));
3170 while Present (Formal) and then Present (Actual) loop
3174 Actual := Next_Actual (Actual);
3175 Formal := Next_Formal (Formal);
3180 -- Fall through here if we did not find matching actual
3186 ---------------------------
3187 -- Find_Body_Discriminal --
3188 ---------------------------
3190 function Find_Body_Discriminal
3191 (Spec_Discriminant : Entity_Id) return Entity_Id
3193 pragma Assert (Is_Concurrent_Record_Type (Scope (Spec_Discriminant)));
3195 Tsk : constant Entity_Id :=
3196 Corresponding_Concurrent_Type (Scope (Spec_Discriminant));
3200 -- Find discriminant of original concurrent type, and use its current
3201 -- discriminal, which is the renaming within the task/protected body.
3203 Disc := First_Discriminant (Tsk);
3204 while Present (Disc) loop
3205 if Chars (Disc) = Chars (Spec_Discriminant) then
3206 return Discriminal (Disc);
3209 Next_Discriminant (Disc);
3212 -- That loop should always succeed in finding a matching entry and
3213 -- returning. Fatal error if not.
3215 raise Program_Error;
3216 end Find_Body_Discriminal;
3218 -------------------------------------
3219 -- Find_Corresponding_Discriminant --
3220 -------------------------------------
3222 function Find_Corresponding_Discriminant
3224 Typ : Entity_Id) return Entity_Id
3226 Par_Disc : Entity_Id;
3227 Old_Disc : Entity_Id;
3228 New_Disc : Entity_Id;
3231 Par_Disc := Original_Record_Component (Original_Discriminant (Id));
3233 -- The original type may currently be private, and the discriminant
3234 -- only appear on its full view.
3236 if Is_Private_Type (Scope (Par_Disc))
3237 and then not Has_Discriminants (Scope (Par_Disc))
3238 and then Present (Full_View (Scope (Par_Disc)))
3240 Old_Disc := First_Discriminant (Full_View (Scope (Par_Disc)));
3242 Old_Disc := First_Discriminant (Scope (Par_Disc));
3245 if Is_Class_Wide_Type (Typ) then
3246 New_Disc := First_Discriminant (Root_Type (Typ));
3248 New_Disc := First_Discriminant (Typ);
3251 while Present (Old_Disc) and then Present (New_Disc) loop
3252 if Old_Disc = Par_Disc then
3255 Next_Discriminant (Old_Disc);
3256 Next_Discriminant (New_Disc);
3260 -- Should always find it
3262 raise Program_Error;
3263 end Find_Corresponding_Discriminant;
3265 --------------------------
3266 -- Find_Overlaid_Entity --
3267 --------------------------
3269 procedure Find_Overlaid_Entity
3271 Ent : out Entity_Id;
3277 -- We are looking for one of the two following forms:
3279 -- for X'Address use Y'Address
3283 -- Const : constant Address := expr;
3285 -- for X'Address use Const;
3287 -- In the second case, the expr is either Y'Address, or recursively a
3288 -- constant that eventually references Y'Address.
3293 if Nkind (N) = N_Attribute_Definition_Clause
3294 and then Chars (N) = Name_Address
3296 Expr := Expression (N);
3298 -- This loop checks the form of the expression for Y'Address,
3299 -- using recursion to deal with intermediate constants.
3302 -- Check for Y'Address
3304 if Nkind (Expr) = N_Attribute_Reference
3305 and then Attribute_Name (Expr) = Name_Address
3307 Expr := Prefix (Expr);
3310 -- Check for Const where Const is a constant entity
3312 elsif Is_Entity_Name (Expr)
3313 and then Ekind (Entity (Expr)) = E_Constant
3315 Expr := Constant_Value (Entity (Expr));
3317 -- Anything else does not need checking
3324 -- This loop checks the form of the prefix for an entity,
3325 -- using recursion to deal with intermediate components.
3328 -- Check for Y where Y is an entity
3330 if Is_Entity_Name (Expr) then
3331 Ent := Entity (Expr);
3334 -- Check for components
3337 Nkind_In (Expr, N_Selected_Component, N_Indexed_Component) then
3339 Expr := Prefix (Expr);
3342 -- Anything else does not need checking
3349 end Find_Overlaid_Entity;
3351 -------------------------
3352 -- Find_Parameter_Type --
3353 -------------------------
3355 function Find_Parameter_Type (Param : Node_Id) return Entity_Id is
3357 if Nkind (Param) /= N_Parameter_Specification then
3360 -- For an access parameter, obtain the type from the formal entity
3361 -- itself, because access to subprogram nodes do not carry a type.
3362 -- Shouldn't we always use the formal entity ???
3364 elsif Nkind (Parameter_Type (Param)) = N_Access_Definition then
3365 return Etype (Defining_Identifier (Param));
3368 return Etype (Parameter_Type (Param));
3370 end Find_Parameter_Type;
3372 -----------------------------
3373 -- Find_Static_Alternative --
3374 -----------------------------
3376 function Find_Static_Alternative (N : Node_Id) return Node_Id is
3377 Expr : constant Node_Id := Expression (N);
3378 Val : constant Uint := Expr_Value (Expr);
3383 Alt := First (Alternatives (N));
3386 if Nkind (Alt) /= N_Pragma then
3387 Choice := First (Discrete_Choices (Alt));
3388 while Present (Choice) loop
3390 -- Others choice, always matches
3392 if Nkind (Choice) = N_Others_Choice then
3395 -- Range, check if value is in the range
3397 elsif Nkind (Choice) = N_Range then
3399 Val >= Expr_Value (Low_Bound (Choice))
3401 Val <= Expr_Value (High_Bound (Choice));
3403 -- Choice is a subtype name. Note that we know it must
3404 -- be a static subtype, since otherwise it would have
3405 -- been diagnosed as illegal.
3407 elsif Is_Entity_Name (Choice)
3408 and then Is_Type (Entity (Choice))
3410 exit Search when Is_In_Range (Expr, Etype (Choice),
3411 Assume_Valid => False);
3413 -- Choice is a subtype indication
3415 elsif Nkind (Choice) = N_Subtype_Indication then
3417 C : constant Node_Id := Constraint (Choice);
3418 R : constant Node_Id := Range_Expression (C);
3422 Val >= Expr_Value (Low_Bound (R))
3424 Val <= Expr_Value (High_Bound (R));
3427 -- Choice is a simple expression
3430 exit Search when Val = Expr_Value (Choice);
3438 pragma Assert (Present (Alt));
3441 -- The above loop *must* terminate by finding a match, since
3442 -- we know the case statement is valid, and the value of the
3443 -- expression is known at compile time. When we fall out of
3444 -- the loop, Alt points to the alternative that we know will
3445 -- be selected at run time.
3448 end Find_Static_Alternative;
3454 function First_Actual (Node : Node_Id) return Node_Id is
3458 if No (Parameter_Associations (Node)) then
3462 N := First (Parameter_Associations (Node));
3464 if Nkind (N) = N_Parameter_Association then
3465 return First_Named_Actual (Node);
3471 -----------------------
3472 -- Gather_Components --
3473 -----------------------
3475 procedure Gather_Components
3477 Comp_List : Node_Id;
3478 Governed_By : List_Id;
3480 Report_Errors : out Boolean)
3484 Discrete_Choice : Node_Id;
3485 Comp_Item : Node_Id;
3487 Discrim : Entity_Id;
3488 Discrim_Name : Node_Id;
3489 Discrim_Value : Node_Id;
3492 Report_Errors := False;
3494 if No (Comp_List) or else Null_Present (Comp_List) then
3497 elsif Present (Component_Items (Comp_List)) then
3498 Comp_Item := First (Component_Items (Comp_List));
3504 while Present (Comp_Item) loop
3506 -- Skip the tag of a tagged record, the interface tags, as well
3507 -- as all items that are not user components (anonymous types,
3508 -- rep clauses, Parent field, controller field).
3510 if Nkind (Comp_Item) = N_Component_Declaration then
3512 Comp : constant Entity_Id := Defining_Identifier (Comp_Item);
3514 if not Is_Tag (Comp)
3515 and then Chars (Comp) /= Name_uParent
3516 and then Chars (Comp) /= Name_uController
3518 Append_Elmt (Comp, Into);
3526 if No (Variant_Part (Comp_List)) then
3529 Discrim_Name := Name (Variant_Part (Comp_List));
3530 Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
3533 -- Look for the discriminant that governs this variant part.
3534 -- The discriminant *must* be in the Governed_By List
3536 Assoc := First (Governed_By);
3537 Find_Constraint : loop
3538 Discrim := First (Choices (Assoc));
3539 exit Find_Constraint when Chars (Discrim_Name) = Chars (Discrim)
3540 or else (Present (Corresponding_Discriminant (Entity (Discrim)))
3542 Chars (Corresponding_Discriminant (Entity (Discrim)))
3543 = Chars (Discrim_Name))
3544 or else Chars (Original_Record_Component (Entity (Discrim)))
3545 = Chars (Discrim_Name);
3547 if No (Next (Assoc)) then
3548 if not Is_Constrained (Typ)
3549 and then Is_Derived_Type (Typ)
3550 and then Present (Stored_Constraint (Typ))
3552 -- If the type is a tagged type with inherited discriminants,
3553 -- use the stored constraint on the parent in order to find
3554 -- the values of discriminants that are otherwise hidden by an
3555 -- explicit constraint. Renamed discriminants are handled in
3558 -- If several parent discriminants are renamed by a single
3559 -- discriminant of the derived type, the call to obtain the
3560 -- Corresponding_Discriminant field only retrieves the last
3561 -- of them. We recover the constraint on the others from the
3562 -- Stored_Constraint as well.
3569 D := First_Discriminant (Etype (Typ));
3570 C := First_Elmt (Stored_Constraint (Typ));
3571 while Present (D) and then Present (C) loop
3572 if Chars (Discrim_Name) = Chars (D) then
3573 if Is_Entity_Name (Node (C))
3574 and then Entity (Node (C)) = Entity (Discrim)
3576 -- D is renamed by Discrim, whose value is given in
3583 Make_Component_Association (Sloc (Typ),
3585 (New_Occurrence_Of (D, Sloc (Typ))),
3586 Duplicate_Subexpr_No_Checks (Node (C)));
3588 exit Find_Constraint;
3591 Next_Discriminant (D);
3598 if No (Next (Assoc)) then
3599 Error_Msg_NE (" missing value for discriminant&",
3600 First (Governed_By), Discrim_Name);
3601 Report_Errors := True;
3606 end loop Find_Constraint;
3608 Discrim_Value := Expression (Assoc);
3610 if not Is_OK_Static_Expression (Discrim_Value) then
3612 ("value for discriminant & must be static!",
3613 Discrim_Value, Discrim);
3614 Why_Not_Static (Discrim_Value);
3615 Report_Errors := True;
3619 Search_For_Discriminant_Value : declare
3625 UI_Discrim_Value : constant Uint := Expr_Value (Discrim_Value);
3628 Find_Discrete_Value : while Present (Variant) loop
3629 Discrete_Choice := First (Discrete_Choices (Variant));
3630 while Present (Discrete_Choice) loop
3632 exit Find_Discrete_Value when
3633 Nkind (Discrete_Choice) = N_Others_Choice;
3635 Get_Index_Bounds (Discrete_Choice, Low, High);
3637 UI_Low := Expr_Value (Low);
3638 UI_High := Expr_Value (High);
3640 exit Find_Discrete_Value when
3641 UI_Low <= UI_Discrim_Value
3643 UI_High >= UI_Discrim_Value;
3645 Next (Discrete_Choice);
3648 Next_Non_Pragma (Variant);
3649 end loop Find_Discrete_Value;
3650 end Search_For_Discriminant_Value;
3652 if No (Variant) then
3654 ("value of discriminant & is out of range", Discrim_Value, Discrim);
3655 Report_Errors := True;
3659 -- If we have found the corresponding choice, recursively add its
3660 -- components to the Into list.
3662 Gather_Components (Empty,
3663 Component_List (Variant), Governed_By, Into, Report_Errors);
3664 end Gather_Components;
3666 ------------------------
3667 -- Get_Actual_Subtype --
3668 ------------------------
3670 function Get_Actual_Subtype (N : Node_Id) return Entity_Id is
3671 Typ : constant Entity_Id := Etype (N);
3672 Utyp : Entity_Id := Underlying_Type (Typ);
3681 -- If what we have is an identifier that references a subprogram
3682 -- formal, or a variable or constant object, then we get the actual
3683 -- subtype from the referenced entity if one has been built.
3685 if Nkind (N) = N_Identifier
3687 (Is_Formal (Entity (N))
3688 or else Ekind (Entity (N)) = E_Constant
3689 or else Ekind (Entity (N)) = E_Variable)
3690 and then Present (Actual_Subtype (Entity (N)))
3692 return Actual_Subtype (Entity (N));
3694 -- Actual subtype of unchecked union is always itself. We never need
3695 -- the "real" actual subtype. If we did, we couldn't get it anyway
3696 -- because the discriminant is not available. The restrictions on
3697 -- Unchecked_Union are designed to make sure that this is OK.
3699 elsif Is_Unchecked_Union (Base_Type (Utyp)) then
3702 -- Here for the unconstrained case, we must find actual subtype
3703 -- No actual subtype is available, so we must build it on the fly.
3705 -- Checking the type, not the underlying type, for constrainedness
3706 -- seems to be necessary. Maybe all the tests should be on the type???
3708 elsif (not Is_Constrained (Typ))
3709 and then (Is_Array_Type (Utyp)
3710 or else (Is_Record_Type (Utyp)
3711 and then Has_Discriminants (Utyp)))
3712 and then not Has_Unknown_Discriminants (Utyp)
3713 and then not (Ekind (Utyp) = E_String_Literal_Subtype)
3715 -- Nothing to do if in spec expression (why not???)
3717 if In_Spec_Expression then
3720 elsif Is_Private_Type (Typ)
3721 and then not Has_Discriminants (Typ)
3723 -- If the type has no discriminants, there is no subtype to
3724 -- build, even if the underlying type is discriminated.
3728 -- Else build the actual subtype
3731 Decl := Build_Actual_Subtype (Typ, N);
3732 Atyp := Defining_Identifier (Decl);
3734 -- If Build_Actual_Subtype generated a new declaration then use it
3738 -- The actual subtype is an Itype, so analyze the declaration,
3739 -- but do not attach it to the tree, to get the type defined.
3741 Set_Parent (Decl, N);
3742 Set_Is_Itype (Atyp);
3743 Analyze (Decl, Suppress => All_Checks);
3744 Set_Associated_Node_For_Itype (Atyp, N);
3745 Set_Has_Delayed_Freeze (Atyp, False);
3747 -- We need to freeze the actual subtype immediately. This is
3748 -- needed, because otherwise this Itype will not get frozen
3749 -- at all, and it is always safe to freeze on creation because
3750 -- any associated types must be frozen at this point.
3752 Freeze_Itype (Atyp, N);
3755 -- Otherwise we did not build a declaration, so return original
3762 -- For all remaining cases, the actual subtype is the same as
3763 -- the nominal type.
3768 end Get_Actual_Subtype;
3770 -------------------------------------
3771 -- Get_Actual_Subtype_If_Available --
3772 -------------------------------------
3774 function Get_Actual_Subtype_If_Available (N : Node_Id) return Entity_Id is
3775 Typ : constant Entity_Id := Etype (N);
3778 -- If what we have is an identifier that references a subprogram
3779 -- formal, or a variable or constant object, then we get the actual
3780 -- subtype from the referenced entity if one has been built.
3782 if Nkind (N) = N_Identifier
3784 (Is_Formal (Entity (N))
3785 or else Ekind (Entity (N)) = E_Constant
3786 or else Ekind (Entity (N)) = E_Variable)
3787 and then Present (Actual_Subtype (Entity (N)))
3789 return Actual_Subtype (Entity (N));
3791 -- Otherwise the Etype of N is returned unchanged
3796 end Get_Actual_Subtype_If_Available;
3798 -------------------------------
3799 -- Get_Default_External_Name --
3800 -------------------------------
3802 function Get_Default_External_Name (E : Node_Or_Entity_Id) return Node_Id is
3804 Get_Decoded_Name_String (Chars (E));
3806 if Opt.External_Name_Imp_Casing = Uppercase then
3807 Set_Casing (All_Upper_Case);
3809 Set_Casing (All_Lower_Case);
3813 Make_String_Literal (Sloc (E),
3814 Strval => String_From_Name_Buffer);
3815 end Get_Default_External_Name;
3817 ---------------------------
3818 -- Get_Enum_Lit_From_Pos --
3819 ---------------------------
3821 function Get_Enum_Lit_From_Pos
3824 Loc : Source_Ptr) return Node_Id
3829 -- In the case where the literal is of type Character, Wide_Character
3830 -- or Wide_Wide_Character or of a type derived from them, there needs
3831 -- to be some special handling since there is no explicit chain of
3832 -- literals to search. Instead, an N_Character_Literal node is created
3833 -- with the appropriate Char_Code and Chars fields.
3835 if Is_Standard_Character_Type (T) then
3836 Set_Character_Literal_Name (UI_To_CC (Pos));
3838 Make_Character_Literal (Loc,
3840 Char_Literal_Value => Pos);
3842 -- For all other cases, we have a complete table of literals, and
3843 -- we simply iterate through the chain of literal until the one
3844 -- with the desired position value is found.
3848 Lit := First_Literal (Base_Type (T));
3849 for J in 1 .. UI_To_Int (Pos) loop
3853 return New_Occurrence_Of (Lit, Loc);
3855 end Get_Enum_Lit_From_Pos;
3857 ------------------------
3858 -- Get_Generic_Entity --
3859 ------------------------
3861 function Get_Generic_Entity (N : Node_Id) return Entity_Id is
3862 Ent : constant Entity_Id := Entity (Name (N));
3864 if Present (Renamed_Object (Ent)) then
3865 return Renamed_Object (Ent);
3869 end Get_Generic_Entity;
3871 ----------------------
3872 -- Get_Index_Bounds --
3873 ----------------------
3875 procedure Get_Index_Bounds (N : Node_Id; L, H : out Node_Id) is
3876 Kind : constant Node_Kind := Nkind (N);
3880 if Kind = N_Range then
3882 H := High_Bound (N);
3884 elsif Kind = N_Subtype_Indication then
3885 R := Range_Expression (Constraint (N));
3893 L := Low_Bound (Range_Expression (Constraint (N)));
3894 H := High_Bound (Range_Expression (Constraint (N)));
3897 elsif Is_Entity_Name (N) and then Is_Type (Entity (N)) then
3898 if Error_Posted (Scalar_Range (Entity (N))) then
3902 elsif Nkind (Scalar_Range (Entity (N))) = N_Subtype_Indication then
3903 Get_Index_Bounds (Scalar_Range (Entity (N)), L, H);
3906 L := Low_Bound (Scalar_Range (Entity (N)));
3907 H := High_Bound (Scalar_Range (Entity (N)));
3911 -- N is an expression, indicating a range with one value
3916 end Get_Index_Bounds;
3918 ----------------------------------
3919 -- Get_Library_Unit_Name_string --
3920 ----------------------------------
3922 procedure Get_Library_Unit_Name_String (Decl_Node : Node_Id) is
3923 Unit_Name_Id : constant Unit_Name_Type := Get_Unit_Name (Decl_Node);
3926 Get_Unit_Name_String (Unit_Name_Id);
3928 -- Remove seven last character (" (spec)" or " (body)")
3930 Name_Len := Name_Len - 7;
3931 pragma Assert (Name_Buffer (Name_Len + 1) = ' ');
3932 end Get_Library_Unit_Name_String;
3934 ------------------------
3935 -- Get_Name_Entity_Id --
3936 ------------------------
3938 function Get_Name_Entity_Id (Id : Name_Id) return Entity_Id is
3940 return Entity_Id (Get_Name_Table_Info (Id));
3941 end Get_Name_Entity_Id;
3947 function Get_Pragma_Id (N : Node_Id) return Pragma_Id is
3949 return Get_Pragma_Id (Pragma_Name (N));
3952 ---------------------------
3953 -- Get_Referenced_Object --
3954 ---------------------------
3956 function Get_Referenced_Object (N : Node_Id) return Node_Id is
3961 while Is_Entity_Name (R)
3962 and then Present (Renamed_Object (Entity (R)))
3964 R := Renamed_Object (Entity (R));
3968 end Get_Referenced_Object;
3970 ------------------------
3971 -- Get_Renamed_Entity --
3972 ------------------------
3974 function Get_Renamed_Entity (E : Entity_Id) return Entity_Id is
3979 while Present (Renamed_Entity (R)) loop
3980 R := Renamed_Entity (R);
3984 end Get_Renamed_Entity;
3986 -------------------------
3987 -- Get_Subprogram_Body --
3988 -------------------------
3990 function Get_Subprogram_Body (E : Entity_Id) return Node_Id is
3994 Decl := Unit_Declaration_Node (E);
3996 if Nkind (Decl) = N_Subprogram_Body then
3999 -- The below comment is bad, because it is possible for
4000 -- Nkind (Decl) to be an N_Subprogram_Body_Stub ???
4002 else -- Nkind (Decl) = N_Subprogram_Declaration
4004 if Present (Corresponding_Body (Decl)) then
4005 return Unit_Declaration_Node (Corresponding_Body (Decl));
4007 -- Imported subprogram case
4013 end Get_Subprogram_Body;
4015 ---------------------------
4016 -- Get_Subprogram_Entity --
4017 ---------------------------
4019 function Get_Subprogram_Entity (Nod : Node_Id) return Entity_Id is
4024 if Nkind (Nod) = N_Accept_Statement then
4025 Nam := Entry_Direct_Name (Nod);
4027 -- For an entry call, the prefix of the call is a selected component.
4028 -- Need additional code for internal calls ???
4030 elsif Nkind (Nod) = N_Entry_Call_Statement then
4031 if Nkind (Name (Nod)) = N_Selected_Component then
4032 Nam := Entity (Selector_Name (Name (Nod)));
4041 if Nkind (Nam) = N_Explicit_Dereference then
4042 Proc := Etype (Prefix (Nam));
4043 elsif Is_Entity_Name (Nam) then
4044 Proc := Entity (Nam);
4049 if Is_Object (Proc) then
4050 Proc := Etype (Proc);
4053 if Ekind (Proc) = E_Access_Subprogram_Type then
4054 Proc := Directly_Designated_Type (Proc);
4057 if not Is_Subprogram (Proc)
4058 and then Ekind (Proc) /= E_Subprogram_Type
4064 end Get_Subprogram_Entity;
4066 -----------------------------
4067 -- Get_Task_Body_Procedure --
4068 -----------------------------
4070 function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
4072 -- Note: A task type may be the completion of a private type with
4073 -- discriminants. When performing elaboration checks on a task
4074 -- declaration, the current view of the type may be the private one,
4075 -- and the procedure that holds the body of the task is held in its
4078 -- This is an odd function, why not have Task_Body_Procedure do
4079 -- the following digging???
4081 return Task_Body_Procedure (Underlying_Type (Root_Type (E)));
4082 end Get_Task_Body_Procedure;
4084 -----------------------
4085 -- Has_Access_Values --
4086 -----------------------
4088 function Has_Access_Values (T : Entity_Id) return Boolean is
4089 Typ : constant Entity_Id := Underlying_Type (T);
4092 -- Case of a private type which is not completed yet. This can only
4093 -- happen in the case of a generic format type appearing directly, or
4094 -- as a component of the type to which this function is being applied
4095 -- at the top level. Return False in this case, since we certainly do
4096 -- not know that the type contains access types.
4101 elsif Is_Access_Type (Typ) then
4104 elsif Is_Array_Type (Typ) then
4105 return Has_Access_Values (Component_Type (Typ));
4107 elsif Is_Record_Type (Typ) then
4112 -- Loop to Check components
4114 Comp := First_Component_Or_Discriminant (Typ);
4115 while Present (Comp) loop
4117 -- Check for access component, tag field does not count, even
4118 -- though it is implemented internally using an access type.
4120 if Has_Access_Values (Etype (Comp))
4121 and then Chars (Comp) /= Name_uTag
4126 Next_Component_Or_Discriminant (Comp);
4135 end Has_Access_Values;
4137 ------------------------------
4138 -- Has_Compatible_Alignment --
4139 ------------------------------
4141 function Has_Compatible_Alignment
4143 Expr : Node_Id) return Alignment_Result
4145 function Has_Compatible_Alignment_Internal
4148 Default : Alignment_Result) return Alignment_Result;
4149 -- This is the internal recursive function that actually does the work.
4150 -- There is one additional parameter, which says what the result should
4151 -- be if no alignment information is found, and there is no definite
4152 -- indication of compatible alignments. At the outer level, this is set
4153 -- to Unknown, but for internal recursive calls in the case where types
4154 -- are known to be correct, it is set to Known_Compatible.
4156 ---------------------------------------
4157 -- Has_Compatible_Alignment_Internal --
4158 ---------------------------------------
4160 function Has_Compatible_Alignment_Internal
4163 Default : Alignment_Result) return Alignment_Result
4165 Result : Alignment_Result := Known_Compatible;
4166 -- Holds the current status of the result. Note that once a value of
4167 -- Known_Incompatible is set, it is sticky and does not get changed
4168 -- to Unknown (the value in Result only gets worse as we go along,
4171 Offs : Uint := No_Uint;
4172 -- Set to a factor of the offset from the base object when Expr is a
4173 -- selected or indexed component, based on Component_Bit_Offset and
4174 -- Component_Size respectively. A negative value is used to represent
4175 -- a value which is not known at compile time.
4177 procedure Check_Prefix;
4178 -- Checks the prefix recursively in the case where the expression
4179 -- is an indexed or selected component.
4181 procedure Set_Result (R : Alignment_Result);
4182 -- If R represents a worse outcome (unknown instead of known
4183 -- compatible, or known incompatible), then set Result to R.
4189 procedure Check_Prefix is
4191 -- The subtlety here is that in doing a recursive call to check
4192 -- the prefix, we have to decide what to do in the case where we
4193 -- don't find any specific indication of an alignment problem.
4195 -- At the outer level, we normally set Unknown as the result in
4196 -- this case, since we can only set Known_Compatible if we really
4197 -- know that the alignment value is OK, but for the recursive
4198 -- call, in the case where the types match, and we have not
4199 -- specified a peculiar alignment for the object, we are only
4200 -- concerned about suspicious rep clauses, the default case does
4201 -- not affect us, since the compiler will, in the absence of such
4202 -- rep clauses, ensure that the alignment is correct.
4204 if Default = Known_Compatible
4206 (Etype (Obj) = Etype (Expr)
4207 and then (Unknown_Alignment (Obj)
4209 Alignment (Obj) = Alignment (Etype (Obj))))
4212 (Has_Compatible_Alignment_Internal
4213 (Obj, Prefix (Expr), Known_Compatible));
4215 -- In all other cases, we need a full check on the prefix
4219 (Has_Compatible_Alignment_Internal
4220 (Obj, Prefix (Expr), Unknown));
4228 procedure Set_Result (R : Alignment_Result) is
4235 -- Start of processing for Has_Compatible_Alignment_Internal
4238 -- If Expr is a selected component, we must make sure there is no
4239 -- potentially troublesome component clause, and that the record is
4242 if Nkind (Expr) = N_Selected_Component then
4244 -- Packed record always generate unknown alignment
4246 if Is_Packed (Etype (Prefix (Expr))) then
4247 Set_Result (Unknown);
4250 -- Check prefix and component offset
4253 Offs := Component_Bit_Offset (Entity (Selector_Name (Expr)));
4255 -- If Expr is an indexed component, we must make sure there is no
4256 -- potentially troublesome Component_Size clause and that the array
4257 -- is not bit-packed.
4259 elsif Nkind (Expr) = N_Indexed_Component then
4261 Typ : constant Entity_Id := Etype (Prefix (Expr));
4262 Ind : constant Node_Id := First_Index (Typ);
4265 -- Bit packed array always generates unknown alignment
4267 if Is_Bit_Packed_Array (Typ) then
4268 Set_Result (Unknown);
4271 -- Check prefix and component offset
4274 Offs := Component_Size (Typ);
4276 -- Small optimization: compute the full offset when possible
4279 and then Offs > Uint_0
4280 and then Present (Ind)
4281 and then Nkind (Ind) = N_Range
4282 and then Compile_Time_Known_Value (Low_Bound (Ind))
4283 and then Compile_Time_Known_Value (First (Expressions (Expr)))
4285 Offs := Offs * (Expr_Value (First (Expressions (Expr)))
4286 - Expr_Value (Low_Bound ((Ind))));
4291 -- If we have a null offset, the result is entirely determined by
4292 -- the base object and has already been computed recursively.
4294 if Offs = Uint_0 then
4297 -- Case where we know the alignment of the object
4299 elsif Known_Alignment (Obj) then
4301 ObjA : constant Uint := Alignment (Obj);
4302 ExpA : Uint := No_Uint;
4303 SizA : Uint := No_Uint;
4306 -- If alignment of Obj is 1, then we are always OK
4309 Set_Result (Known_Compatible);
4311 -- Alignment of Obj is greater than 1, so we need to check
4314 -- If we have an offset, see if it is compatible
4316 if Offs /= No_Uint and Offs > Uint_0 then
4317 if Offs mod (System_Storage_Unit * ObjA) /= 0 then
4318 Set_Result (Known_Incompatible);
4321 -- See if Expr is an object with known alignment
4323 elsif Is_Entity_Name (Expr)
4324 and then Known_Alignment (Entity (Expr))
4326 ExpA := Alignment (Entity (Expr));
4328 -- Otherwise, we can use the alignment of the type of
4329 -- Expr given that we already checked for
4330 -- discombobulating rep clauses for the cases of indexed
4331 -- and selected components above.
4333 elsif Known_Alignment (Etype (Expr)) then
4334 ExpA := Alignment (Etype (Expr));
4336 -- Otherwise the alignment is unknown
4339 Set_Result (Default);
4342 -- If we got an alignment, see if it is acceptable
4344 if ExpA /= No_Uint and then ExpA < ObjA then
4345 Set_Result (Known_Incompatible);
4348 -- If Expr is not a piece of a larger object, see if size
4349 -- is given. If so, check that it is not too small for the
4350 -- required alignment.
4352 if Offs /= No_Uint then
4355 -- See if Expr is an object with known size
4357 elsif Is_Entity_Name (Expr)
4358 and then Known_Static_Esize (Entity (Expr))
4360 SizA := Esize (Entity (Expr));
4362 -- Otherwise, we check the object size of the Expr type
4364 elsif Known_Static_Esize (Etype (Expr)) then
4365 SizA := Esize (Etype (Expr));
4368 -- If we got a size, see if it is a multiple of the Obj
4369 -- alignment, if not, then the alignment cannot be
4370 -- acceptable, since the size is always a multiple of the
4373 if SizA /= No_Uint then
4374 if SizA mod (ObjA * Ttypes.System_Storage_Unit) /= 0 then
4375 Set_Result (Known_Incompatible);
4381 -- If we do not know required alignment, any non-zero offset is a
4382 -- potential problem (but certainly may be OK, so result is unknown).
4384 elsif Offs /= No_Uint then
4385 Set_Result (Unknown);
4387 -- If we can't find the result by direct comparison of alignment
4388 -- values, then there is still one case that we can determine known
4389 -- result, and that is when we can determine that the types are the
4390 -- same, and no alignments are specified. Then we known that the
4391 -- alignments are compatible, even if we don't know the alignment
4392 -- value in the front end.
4394 elsif Etype (Obj) = Etype (Expr) then
4396 -- Types are the same, but we have to check for possible size
4397 -- and alignments on the Expr object that may make the alignment
4398 -- different, even though the types are the same.
4400 if Is_Entity_Name (Expr) then
4402 -- First check alignment of the Expr object. Any alignment less
4403 -- than Maximum_Alignment is worrisome since this is the case
4404 -- where we do not know the alignment of Obj.
4406 if Known_Alignment (Entity (Expr))
4408 UI_To_Int (Alignment (Entity (Expr))) <
4409 Ttypes.Maximum_Alignment
4411 Set_Result (Unknown);
4413 -- Now check size of Expr object. Any size that is not an
4414 -- even multiple of Maximum_Alignment is also worrisome
4415 -- since it may cause the alignment of the object to be less
4416 -- than the alignment of the type.
4418 elsif Known_Static_Esize (Entity (Expr))
4420 (UI_To_Int (Esize (Entity (Expr))) mod
4421 (Ttypes.Maximum_Alignment * Ttypes.System_Storage_Unit))
4424 Set_Result (Unknown);
4426 -- Otherwise same type is decisive
4429 Set_Result (Known_Compatible);
4433 -- Another case to deal with is when there is an explicit size or
4434 -- alignment clause when the types are not the same. If so, then the
4435 -- result is Unknown. We don't need to do this test if the Default is
4436 -- Unknown, since that result will be set in any case.
4438 elsif Default /= Unknown
4439 and then (Has_Size_Clause (Etype (Expr))
4441 Has_Alignment_Clause (Etype (Expr)))
4443 Set_Result (Unknown);
4445 -- If no indication found, set default
4448 Set_Result (Default);
4451 -- Return worst result found
4454 end Has_Compatible_Alignment_Internal;
4456 -- Start of processing for Has_Compatible_Alignment
4459 -- If Obj has no specified alignment, then set alignment from the type
4460 -- alignment. Perhaps we should always do this, but for sure we should
4461 -- do it when there is an address clause since we can do more if the
4462 -- alignment is known.
4464 if Unknown_Alignment (Obj) then
4465 Set_Alignment (Obj, Alignment (Etype (Obj)));
4468 -- Now do the internal call that does all the work
4470 return Has_Compatible_Alignment_Internal (Obj, Expr, Unknown);
4471 end Has_Compatible_Alignment;
4473 ----------------------
4474 -- Has_Declarations --
4475 ----------------------
4477 function Has_Declarations (N : Node_Id) return Boolean is
4479 return Nkind_In (Nkind (N), N_Accept_Statement,
4481 N_Compilation_Unit_Aux,
4487 N_Package_Specification);
4488 end Has_Declarations;
4490 -------------------------------------------
4491 -- Has_Discriminant_Dependent_Constraint --
4492 -------------------------------------------
4494 function Has_Discriminant_Dependent_Constraint
4495 (Comp : Entity_Id) return Boolean
4497 Comp_Decl : constant Node_Id := Parent (Comp);
4498 Subt_Indic : constant Node_Id :=
4499 Subtype_Indication (Component_Definition (Comp_Decl));
4504 if Nkind (Subt_Indic) = N_Subtype_Indication then
4505 Constr := Constraint (Subt_Indic);
4507 if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
4508 Assn := First (Constraints (Constr));
4509 while Present (Assn) loop
4510 case Nkind (Assn) is
4511 when N_Subtype_Indication |
4515 if Depends_On_Discriminant (Assn) then
4519 when N_Discriminant_Association =>
4520 if Depends_On_Discriminant (Expression (Assn)) then
4535 end Has_Discriminant_Dependent_Constraint;
4537 --------------------
4538 -- Has_Infinities --
4539 --------------------
4541 function Has_Infinities (E : Entity_Id) return Boolean is
4544 Is_Floating_Point_Type (E)
4545 and then Nkind (Scalar_Range (E)) = N_Range
4546 and then Includes_Infinities (Scalar_Range (E));
4549 --------------------
4550 -- Has_Interfaces --
4551 --------------------
4553 function Has_Interfaces
4555 Use_Full_View : Boolean := True) return Boolean
4557 Typ : Entity_Id := Base_Type (T);
4560 -- Handle concurrent types
4562 if Is_Concurrent_Type (Typ) then
4563 Typ := Corresponding_Record_Type (Typ);
4566 if not Present (Typ)
4567 or else not Is_Record_Type (Typ)
4568 or else not Is_Tagged_Type (Typ)
4573 -- Handle private types
4576 and then Present (Full_View (Typ))
4578 Typ := Full_View (Typ);
4581 -- Handle concurrent record types
4583 if Is_Concurrent_Record_Type (Typ)
4584 and then Is_Non_Empty_List (Abstract_Interface_List (Typ))
4590 if Is_Interface (Typ)
4592 (Is_Record_Type (Typ)
4593 and then Present (Interfaces (Typ))
4594 and then not Is_Empty_Elmt_List (Interfaces (Typ)))
4599 exit when Etype (Typ) = Typ
4601 -- Handle private types
4603 or else (Present (Full_View (Etype (Typ)))
4604 and then Full_View (Etype (Typ)) = Typ)
4606 -- Protect the frontend against wrong source with cyclic
4609 or else Etype (Typ) = T;
4611 -- Climb to the ancestor type handling private types
4613 if Present (Full_View (Etype (Typ))) then
4614 Typ := Full_View (Etype (Typ));
4623 ------------------------
4624 -- Has_Null_Exclusion --
4625 ------------------------
4627 function Has_Null_Exclusion (N : Node_Id) return Boolean is
4630 when N_Access_Definition |
4631 N_Access_Function_Definition |
4632 N_Access_Procedure_Definition |
4633 N_Access_To_Object_Definition |
4635 N_Derived_Type_Definition |
4636 N_Function_Specification |
4637 N_Subtype_Declaration =>
4638 return Null_Exclusion_Present (N);
4640 when N_Component_Definition |
4641 N_Formal_Object_Declaration |
4642 N_Object_Renaming_Declaration =>
4643 if Present (Subtype_Mark (N)) then
4644 return Null_Exclusion_Present (N);
4645 else pragma Assert (Present (Access_Definition (N)));
4646 return Null_Exclusion_Present (Access_Definition (N));
4649 when N_Discriminant_Specification =>
4650 if Nkind (Discriminant_Type (N)) = N_Access_Definition then
4651 return Null_Exclusion_Present (Discriminant_Type (N));
4653 return Null_Exclusion_Present (N);
4656 when N_Object_Declaration =>
4657 if Nkind (Object_Definition (N)) = N_Access_Definition then
4658 return Null_Exclusion_Present (Object_Definition (N));
4660 return Null_Exclusion_Present (N);
4663 when N_Parameter_Specification =>
4664 if Nkind (Parameter_Type (N)) = N_Access_Definition then
4665 return Null_Exclusion_Present (Parameter_Type (N));
4667 return Null_Exclusion_Present (N);
4674 end Has_Null_Exclusion;
4676 ------------------------
4677 -- Has_Null_Extension --
4678 ------------------------
4680 function Has_Null_Extension (T : Entity_Id) return Boolean is
4681 B : constant Entity_Id := Base_Type (T);
4686 if Nkind (Parent (B)) = N_Full_Type_Declaration
4687 and then Present (Record_Extension_Part (Type_Definition (Parent (B))))
4689 Ext := Record_Extension_Part (Type_Definition (Parent (B)));
4691 if Present (Ext) then
4692 if Null_Present (Ext) then
4695 Comps := Component_List (Ext);
4697 -- The null component list is rewritten during analysis to
4698 -- include the parent component. Any other component indicates
4699 -- that the extension was not originally null.
4701 return Null_Present (Comps)
4702 or else No (Next (First (Component_Items (Comps))));
4711 end Has_Null_Extension;
4713 -------------------------------
4714 -- Has_Overriding_Initialize --
4715 -------------------------------
4717 function Has_Overriding_Initialize (T : Entity_Id) return Boolean is
4718 BT : constant Entity_Id := Base_Type (T);
4723 if Is_Controlled (BT) then
4725 -- For derived types, check immediate ancestor, excluding
4726 -- Controlled itself.
4728 if Is_Derived_Type (BT)
4729 and then not In_Predefined_Unit (Etype (BT))
4730 and then Has_Overriding_Initialize (Etype (BT))
4734 elsif Present (Primitive_Operations (BT)) then
4735 P := First_Elmt (Primitive_Operations (BT));
4736 while Present (P) loop
4737 if Chars (Node (P)) = Name_Initialize
4738 and then Comes_From_Source (Node (P))
4749 elsif Has_Controlled_Component (BT) then
4750 Comp := First_Component (BT);
4751 while Present (Comp) loop
4752 if Has_Overriding_Initialize (Etype (Comp)) then
4756 Next_Component (Comp);
4764 end Has_Overriding_Initialize;
4766 --------------------------------------
4767 -- Has_Preelaborable_Initialization --
4768 --------------------------------------
4770 function Has_Preelaborable_Initialization (E : Entity_Id) return Boolean is
4773 procedure Check_Components (E : Entity_Id);
4774 -- Check component/discriminant chain, sets Has_PE False if a component
4775 -- or discriminant does not meet the preelaborable initialization rules.
4777 ----------------------
4778 -- Check_Components --
4779 ----------------------
4781 procedure Check_Components (E : Entity_Id) is
4785 function Is_Preelaborable_Expression (N : Node_Id) return Boolean;
4786 -- Returns True if and only if the expression denoted by N does not
4787 -- violate restrictions on preelaborable constructs (RM-10.2.1(5-9)).
4789 ---------------------------------
4790 -- Is_Preelaborable_Expression --
4791 ---------------------------------
4793 function Is_Preelaborable_Expression (N : Node_Id) return Boolean is
4797 Comp_Type : Entity_Id;
4798 Is_Array_Aggr : Boolean;
4801 if Is_Static_Expression (N) then
4804 elsif Nkind (N) = N_Null then
4807 -- Attributes are allowed in general, even if their prefix is a
4808 -- formal type. (It seems that certain attributes known not to be
4809 -- static might not be allowed, but there are no rules to prevent
4812 elsif Nkind (N) = N_Attribute_Reference then
4815 -- The name of a discriminant evaluated within its parent type is
4816 -- defined to be preelaborable (10.2.1(8)). Note that we test for
4817 -- names that denote discriminals as well as discriminants to
4818 -- catch references occurring within init procs.
4820 elsif Is_Entity_Name (N)
4822 (Ekind (Entity (N)) = E_Discriminant
4824 ((Ekind (Entity (N)) = E_Constant
4825 or else Ekind (Entity (N)) = E_In_Parameter)
4826 and then Present (Discriminal_Link (Entity (N)))))
4830 elsif Nkind (N) = N_Qualified_Expression then
4831 return Is_Preelaborable_Expression (Expression (N));
4833 -- For aggregates we have to check that each of the associations
4834 -- is preelaborable.
4836 elsif Nkind (N) = N_Aggregate
4837 or else Nkind (N) = N_Extension_Aggregate
4839 Is_Array_Aggr := Is_Array_Type (Etype (N));
4841 if Is_Array_Aggr then
4842 Comp_Type := Component_Type (Etype (N));
4845 -- Check the ancestor part of extension aggregates, which must
4846 -- be either the name of a type that has preelaborable init or
4847 -- an expression that is preelaborable.
4849 if Nkind (N) = N_Extension_Aggregate then
4851 Anc_Part : constant Node_Id := Ancestor_Part (N);
4854 if Is_Entity_Name (Anc_Part)
4855 and then Is_Type (Entity (Anc_Part))
4857 if not Has_Preelaborable_Initialization
4863 elsif not Is_Preelaborable_Expression (Anc_Part) then
4869 -- Check positional associations
4871 Exp := First (Expressions (N));
4872 while Present (Exp) loop
4873 if not Is_Preelaborable_Expression (Exp) then
4880 -- Check named associations
4882 Assn := First (Component_Associations (N));
4883 while Present (Assn) loop
4884 Choice := First (Choices (Assn));
4885 while Present (Choice) loop
4886 if Is_Array_Aggr then
4887 if Nkind (Choice) = N_Others_Choice then
4890 elsif Nkind (Choice) = N_Range then
4891 if not Is_Static_Range (Choice) then
4895 elsif not Is_Static_Expression (Choice) then
4900 Comp_Type := Etype (Choice);
4906 -- If the association has a <> at this point, then we have
4907 -- to check whether the component's type has preelaborable
4908 -- initialization. Note that this only occurs when the
4909 -- association's corresponding component does not have a
4910 -- default expression, the latter case having already been
4911 -- expanded as an expression for the association.
4913 if Box_Present (Assn) then
4914 if not Has_Preelaborable_Initialization (Comp_Type) then
4918 -- In the expression case we check whether the expression
4919 -- is preelaborable.
4922 not Is_Preelaborable_Expression (Expression (Assn))
4930 -- If we get here then aggregate as a whole is preelaborable
4934 -- All other cases are not preelaborable
4939 end Is_Preelaborable_Expression;
4941 -- Start of processing for Check_Components
4944 -- Loop through entities of record or protected type
4947 while Present (Ent) loop
4949 -- We are interested only in components and discriminants
4951 if Ekind_In (Ent, E_Component, E_Discriminant) then
4953 -- Get default expression if any. If there is no declaration
4954 -- node, it means we have an internal entity. The parent and
4955 -- tag fields are examples of such entities. For these cases,
4956 -- we just test the type of the entity.
4958 if Present (Declaration_Node (Ent)) then
4959 Exp := Expression (Declaration_Node (Ent));
4964 -- A component has PI if it has no default expression and the
4965 -- component type has PI.
4968 if not Has_Preelaborable_Initialization (Etype (Ent)) then
4973 -- Require the default expression to be preelaborable
4975 elsif not Is_Preelaborable_Expression (Exp) then
4983 end Check_Components;
4985 -- Start of processing for Has_Preelaborable_Initialization
4988 -- Immediate return if already marked as known preelaborable init. This
4989 -- covers types for which this function has already been called once
4990 -- and returned True (in which case the result is cached), and also
4991 -- types to which a pragma Preelaborable_Initialization applies.
4993 if Known_To_Have_Preelab_Init (E) then
4997 -- If the type is a subtype representing a generic actual type, then
4998 -- test whether its base type has preelaborable initialization since
4999 -- the subtype representing the actual does not inherit this attribute
5000 -- from the actual or formal. (but maybe it should???)
5002 if Is_Generic_Actual_Type (E) then
5003 return Has_Preelaborable_Initialization (Base_Type (E));
5006 -- All elementary types have preelaborable initialization
5008 if Is_Elementary_Type (E) then
5011 -- Array types have PI if the component type has PI
5013 elsif Is_Array_Type (E) then
5014 Has_PE := Has_Preelaborable_Initialization (Component_Type (E));
5016 -- A derived type has preelaborable initialization if its parent type
5017 -- has preelaborable initialization and (in the case of a derived record
5018 -- extension) if the non-inherited components all have preelaborable
5019 -- initialization. However, a user-defined controlled type with an
5020 -- overriding Initialize procedure does not have preelaborable
5023 elsif Is_Derived_Type (E) then
5025 -- If the derived type is a private extension then it doesn't have
5026 -- preelaborable initialization.
5028 if Ekind (Base_Type (E)) = E_Record_Type_With_Private then
5032 -- First check whether ancestor type has preelaborable initialization
5034 Has_PE := Has_Preelaborable_Initialization (Etype (Base_Type (E)));
5036 -- If OK, check extension components (if any)
5038 if Has_PE and then Is_Record_Type (E) then
5039 Check_Components (First_Entity (E));
5042 -- Check specifically for 10.2.1(11.4/2) exception: a controlled type
5043 -- with a user defined Initialize procedure does not have PI.
5046 and then Is_Controlled (E)
5047 and then Has_Overriding_Initialize (E)
5052 -- Private types not derived from a type having preelaborable init and
5053 -- that are not marked with pragma Preelaborable_Initialization do not
5054 -- have preelaborable initialization.
5056 elsif Is_Private_Type (E) then
5059 -- Record type has PI if it is non private and all components have PI
5061 elsif Is_Record_Type (E) then
5063 Check_Components (First_Entity (E));
5065 -- Protected types must not have entries, and components must meet
5066 -- same set of rules as for record components.
5068 elsif Is_Protected_Type (E) then
5069 if Has_Entries (E) then
5073 Check_Components (First_Entity (E));
5074 Check_Components (First_Private_Entity (E));
5077 -- Type System.Address always has preelaborable initialization
5079 elsif Is_RTE (E, RE_Address) then
5082 -- In all other cases, type does not have preelaborable initialization
5088 -- If type has preelaborable initialization, cache result
5091 Set_Known_To_Have_Preelab_Init (E);
5095 end Has_Preelaborable_Initialization;
5097 ---------------------------
5098 -- Has_Private_Component --
5099 ---------------------------
5101 function Has_Private_Component (Type_Id : Entity_Id) return Boolean is
5102 Btype : Entity_Id := Base_Type (Type_Id);
5103 Component : Entity_Id;
5106 if Error_Posted (Type_Id)
5107 or else Error_Posted (Btype)
5112 if Is_Class_Wide_Type (Btype) then
5113 Btype := Root_Type (Btype);
5116 if Is_Private_Type (Btype) then
5118 UT : constant Entity_Id := Underlying_Type (Btype);
5121 if No (Full_View (Btype)) then
5122 return not Is_Generic_Type (Btype)
5123 and then not Is_Generic_Type (Root_Type (Btype));
5125 return not Is_Generic_Type (Root_Type (Full_View (Btype)));
5128 return not Is_Frozen (UT) and then Has_Private_Component (UT);
5132 elsif Is_Array_Type (Btype) then
5133 return Has_Private_Component (Component_Type (Btype));
5135 elsif Is_Record_Type (Btype) then
5136 Component := First_Component (Btype);
5137 while Present (Component) loop
5138 if Has_Private_Component (Etype (Component)) then
5142 Next_Component (Component);
5147 elsif Is_Protected_Type (Btype)
5148 and then Present (Corresponding_Record_Type (Btype))
5150 return Has_Private_Component (Corresponding_Record_Type (Btype));
5155 end Has_Private_Component;
5161 function Has_Stream (T : Entity_Id) return Boolean is
5168 elsif Is_RTE (Root_Type (T), RE_Root_Stream_Type) then
5171 elsif Is_Array_Type (T) then
5172 return Has_Stream (Component_Type (T));
5174 elsif Is_Record_Type (T) then
5175 E := First_Component (T);
5176 while Present (E) loop
5177 if Has_Stream (Etype (E)) then
5186 elsif Is_Private_Type (T) then
5187 return Has_Stream (Underlying_Type (T));
5198 function Has_Suffix (E : Entity_Id; Suffix : Character) return Boolean is
5200 Get_Name_String (Chars (E));
5201 return Name_Buffer (Name_Len) = Suffix;
5204 --------------------------
5205 -- Has_Tagged_Component --
5206 --------------------------
5208 function Has_Tagged_Component (Typ : Entity_Id) return Boolean is
5212 if Is_Private_Type (Typ)
5213 and then Present (Underlying_Type (Typ))
5215 return Has_Tagged_Component (Underlying_Type (Typ));
5217 elsif Is_Array_Type (Typ) then
5218 return Has_Tagged_Component (Component_Type (Typ));
5220 elsif Is_Tagged_Type (Typ) then
5223 elsif Is_Record_Type (Typ) then
5224 Comp := First_Component (Typ);
5225 while Present (Comp) loop
5226 if Has_Tagged_Component (Etype (Comp)) then
5230 Next_Component (Comp);
5238 end Has_Tagged_Component;
5240 --------------------------
5241 -- Implements_Interface --
5242 --------------------------
5244 function Implements_Interface
5245 (Typ_Ent : Entity_Id;
5246 Iface_Ent : Entity_Id;
5247 Exclude_Parents : Boolean := False) return Boolean
5249 Ifaces_List : Elist_Id;
5251 Iface : Entity_Id := Base_Type (Iface_Ent);
5252 Typ : Entity_Id := Base_Type (Typ_Ent);
5255 if Is_Class_Wide_Type (Typ) then
5256 Typ := Root_Type (Typ);
5259 if not Has_Interfaces (Typ) then
5263 if Is_Class_Wide_Type (Iface) then
5264 Iface := Root_Type (Iface);
5267 Collect_Interfaces (Typ, Ifaces_List);
5269 Elmt := First_Elmt (Ifaces_List);
5270 while Present (Elmt) loop
5271 if Is_Ancestor (Node (Elmt), Typ)
5272 and then Exclude_Parents
5276 elsif Node (Elmt) = Iface then
5284 end Implements_Interface;
5290 function In_Instance return Boolean is
5291 Curr_Unit : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
5297 and then S /= Standard_Standard
5299 if (Ekind (S) = E_Function
5300 or else Ekind (S) = E_Package
5301 or else Ekind (S) = E_Procedure)
5302 and then Is_Generic_Instance (S)
5304 -- A child instance is always compiled in the context of a parent
5305 -- instance. Nevertheless, the actuals are not analyzed in an
5306 -- instance context. We detect this case by examining the current
5307 -- compilation unit, which must be a child instance, and checking
5308 -- that it is not currently on the scope stack.
5310 if Is_Child_Unit (Curr_Unit)
5312 Nkind (Unit (Cunit (Current_Sem_Unit)))
5313 = N_Package_Instantiation
5314 and then not In_Open_Scopes (Curr_Unit)
5328 ----------------------
5329 -- In_Instance_Body --
5330 ----------------------
5332 function In_Instance_Body return Boolean is
5338 and then S /= Standard_Standard
5340 if (Ekind (S) = E_Function
5341 or else Ekind (S) = E_Procedure)
5342 and then Is_Generic_Instance (S)
5346 elsif Ekind (S) = E_Package
5347 and then In_Package_Body (S)
5348 and then Is_Generic_Instance (S)
5357 end In_Instance_Body;
5359 -----------------------------
5360 -- In_Instance_Not_Visible --
5361 -----------------------------
5363 function In_Instance_Not_Visible return Boolean is
5369 and then S /= Standard_Standard
5371 if (Ekind (S) = E_Function
5372 or else Ekind (S) = E_Procedure)
5373 and then Is_Generic_Instance (S)
5377 elsif Ekind (S) = E_Package
5378 and then (In_Package_Body (S) or else In_Private_Part (S))
5379 and then Is_Generic_Instance (S)
5388 end In_Instance_Not_Visible;
5390 ------------------------------
5391 -- In_Instance_Visible_Part --
5392 ------------------------------
5394 function In_Instance_Visible_Part return Boolean is
5400 and then S /= Standard_Standard
5402 if Ekind (S) = E_Package
5403 and then Is_Generic_Instance (S)
5404 and then not In_Package_Body (S)
5405 and then not In_Private_Part (S)
5414 end In_Instance_Visible_Part;
5416 ---------------------
5417 -- In_Package_Body --
5418 ---------------------
5420 function In_Package_Body return Boolean is
5426 and then S /= Standard_Standard
5428 if Ekind (S) = E_Package
5429 and then In_Package_Body (S)
5438 end In_Package_Body;
5440 --------------------------------
5441 -- In_Parameter_Specification --
5442 --------------------------------
5444 function In_Parameter_Specification (N : Node_Id) return Boolean is
5449 while Present (PN) loop
5450 if Nkind (PN) = N_Parameter_Specification then
5458 end In_Parameter_Specification;
5460 --------------------------------------
5461 -- In_Subprogram_Or_Concurrent_Unit --
5462 --------------------------------------
5464 function In_Subprogram_Or_Concurrent_Unit return Boolean is
5469 -- Use scope chain to check successively outer scopes
5475 if K in Subprogram_Kind
5476 or else K in Concurrent_Kind
5477 or else K in Generic_Subprogram_Kind
5481 elsif E = Standard_Standard then
5487 end In_Subprogram_Or_Concurrent_Unit;
5489 ---------------------
5490 -- In_Visible_Part --
5491 ---------------------
5493 function In_Visible_Part (Scope_Id : Entity_Id) return Boolean is
5496 Is_Package_Or_Generic_Package (Scope_Id)
5497 and then In_Open_Scopes (Scope_Id)
5498 and then not In_Package_Body (Scope_Id)
5499 and then not In_Private_Part (Scope_Id);
5500 end In_Visible_Part;
5502 ---------------------------------
5503 -- Insert_Explicit_Dereference --
5504 ---------------------------------
5506 procedure Insert_Explicit_Dereference (N : Node_Id) is
5507 New_Prefix : constant Node_Id := Relocate_Node (N);
5508 Ent : Entity_Id := Empty;
5515 Save_Interps (N, New_Prefix);
5517 Rewrite (N, Make_Explicit_Dereference (Sloc (N), Prefix => New_Prefix));
5519 Set_Etype (N, Designated_Type (Etype (New_Prefix)));
5521 if Is_Overloaded (New_Prefix) then
5523 -- The dereference is also overloaded, and its interpretations are
5524 -- the designated types of the interpretations of the original node.
5526 Set_Etype (N, Any_Type);
5528 Get_First_Interp (New_Prefix, I, It);
5529 while Present (It.Nam) loop
5532 if Is_Access_Type (T) then
5533 Add_One_Interp (N, Designated_Type (T), Designated_Type (T));
5536 Get_Next_Interp (I, It);
5542 -- Prefix is unambiguous: mark the original prefix (which might
5543 -- Come_From_Source) as a reference, since the new (relocated) one
5544 -- won't be taken into account.
5546 if Is_Entity_Name (New_Prefix) then
5547 Ent := Entity (New_Prefix);
5549 -- For a retrieval of a subcomponent of some composite object,
5550 -- retrieve the ultimate entity if there is one.
5552 elsif Nkind (New_Prefix) = N_Selected_Component
5553 or else Nkind (New_Prefix) = N_Indexed_Component
5555 Pref := Prefix (New_Prefix);
5556 while Present (Pref)
5558 (Nkind (Pref) = N_Selected_Component
5559 or else Nkind (Pref) = N_Indexed_Component)
5561 Pref := Prefix (Pref);
5564 if Present (Pref) and then Is_Entity_Name (Pref) then
5565 Ent := Entity (Pref);
5569 if Present (Ent) then
5570 Generate_Reference (Ent, New_Prefix);
5573 end Insert_Explicit_Dereference;
5575 ------------------------------------------
5576 -- Inspect_Deferred_Constant_Completion --
5577 ------------------------------------------
5579 procedure Inspect_Deferred_Constant_Completion (Decls : List_Id) is
5583 Decl := First (Decls);
5584 while Present (Decl) loop
5586 -- Deferred constant signature
5588 if Nkind (Decl) = N_Object_Declaration
5589 and then Constant_Present (Decl)
5590 and then No (Expression (Decl))
5592 -- No need to check internally generated constants
5594 and then Comes_From_Source (Decl)
5596 -- The constant is not completed. A full object declaration
5597 -- or a pragma Import complete a deferred constant.
5599 and then not Has_Completion (Defining_Identifier (Decl))
5602 ("constant declaration requires initialization expression",
5603 Defining_Identifier (Decl));
5606 Decl := Next (Decl);
5608 end Inspect_Deferred_Constant_Completion;
5614 function Is_AAMP_Float (E : Entity_Id) return Boolean is
5615 pragma Assert (Is_Type (E));
5617 return AAMP_On_Target
5618 and then Is_Floating_Point_Type (E)
5619 and then E = Base_Type (E);
5622 -----------------------------
5623 -- Is_Actual_Out_Parameter --
5624 -----------------------------
5626 function Is_Actual_Out_Parameter (N : Node_Id) return Boolean is
5630 Find_Actual (N, Formal, Call);
5631 return Present (Formal)
5632 and then Ekind (Formal) = E_Out_Parameter;
5633 end Is_Actual_Out_Parameter;
5635 -------------------------
5636 -- Is_Actual_Parameter --
5637 -------------------------
5639 function Is_Actual_Parameter (N : Node_Id) return Boolean is
5640 PK : constant Node_Kind := Nkind (Parent (N));
5644 when N_Parameter_Association =>
5645 return N = Explicit_Actual_Parameter (Parent (N));
5647 when N_Function_Call | N_Procedure_Call_Statement =>
5648 return Is_List_Member (N)
5650 List_Containing (N) = Parameter_Associations (Parent (N));
5655 end Is_Actual_Parameter;
5657 ---------------------
5658 -- Is_Aliased_View --
5659 ---------------------
5661 function Is_Aliased_View (Obj : Node_Id) return Boolean is
5665 if Is_Entity_Name (Obj) then
5673 or else (Present (Renamed_Object (E))
5674 and then Is_Aliased_View (Renamed_Object (E)))))
5676 or else ((Is_Formal (E)
5677 or else Ekind (E) = E_Generic_In_Out_Parameter
5678 or else Ekind (E) = E_Generic_In_Parameter)
5679 and then Is_Tagged_Type (Etype (E)))
5681 or else (Is_Concurrent_Type (E)
5682 and then In_Open_Scopes (E))
5684 -- Current instance of type, either directly or as rewritten
5685 -- reference to the current object.
5687 or else (Is_Entity_Name (Original_Node (Obj))
5688 and then Present (Entity (Original_Node (Obj)))
5689 and then Is_Type (Entity (Original_Node (Obj))))
5691 or else (Is_Type (E) and then E = Current_Scope)
5693 or else (Is_Incomplete_Or_Private_Type (E)
5694 and then Full_View (E) = Current_Scope);
5696 elsif Nkind (Obj) = N_Selected_Component then
5697 return Is_Aliased (Entity (Selector_Name (Obj)));
5699 elsif Nkind (Obj) = N_Indexed_Component then
5700 return Has_Aliased_Components (Etype (Prefix (Obj)))
5702 (Is_Access_Type (Etype (Prefix (Obj)))
5704 Has_Aliased_Components
5705 (Designated_Type (Etype (Prefix (Obj)))));
5707 elsif Nkind (Obj) = N_Unchecked_Type_Conversion
5708 or else Nkind (Obj) = N_Type_Conversion
5710 return Is_Tagged_Type (Etype (Obj))
5711 and then Is_Aliased_View (Expression (Obj));
5713 elsif Nkind (Obj) = N_Explicit_Dereference then
5714 return Nkind (Original_Node (Obj)) /= N_Function_Call;
5719 end Is_Aliased_View;
5721 -------------------------
5722 -- Is_Ancestor_Package --
5723 -------------------------
5725 function Is_Ancestor_Package
5727 E2 : Entity_Id) return Boolean
5734 and then Par /= Standard_Standard
5744 end Is_Ancestor_Package;
5746 ----------------------
5747 -- Is_Atomic_Object --
5748 ----------------------
5750 function Is_Atomic_Object (N : Node_Id) return Boolean is
5752 function Object_Has_Atomic_Components (N : Node_Id) return Boolean;
5753 -- Determines if given object has atomic components
5755 function Is_Atomic_Prefix (N : Node_Id) return Boolean;
5756 -- If prefix is an implicit dereference, examine designated type
5758 ----------------------
5759 -- Is_Atomic_Prefix --
5760 ----------------------
5762 function Is_Atomic_Prefix (N : Node_Id) return Boolean is
5764 if Is_Access_Type (Etype (N)) then
5766 Has_Atomic_Components (Designated_Type (Etype (N)));
5768 return Object_Has_Atomic_Components (N);
5770 end Is_Atomic_Prefix;
5772 ----------------------------------
5773 -- Object_Has_Atomic_Components --
5774 ----------------------------------
5776 function Object_Has_Atomic_Components (N : Node_Id) return Boolean is
5778 if Has_Atomic_Components (Etype (N))
5779 or else Is_Atomic (Etype (N))
5783 elsif Is_Entity_Name (N)
5784 and then (Has_Atomic_Components (Entity (N))
5785 or else Is_Atomic (Entity (N)))
5789 elsif Nkind (N) = N_Indexed_Component
5790 or else Nkind (N) = N_Selected_Component
5792 return Is_Atomic_Prefix (Prefix (N));
5797 end Object_Has_Atomic_Components;
5799 -- Start of processing for Is_Atomic_Object
5802 -- Predicate is not relevant to subprograms
5804 if Is_Entity_Name (N)
5805 and then Is_Overloadable (Entity (N))
5809 elsif Is_Atomic (Etype (N))
5810 or else (Is_Entity_Name (N) and then Is_Atomic (Entity (N)))
5814 elsif Nkind (N) = N_Indexed_Component
5815 or else Nkind (N) = N_Selected_Component
5817 return Is_Atomic_Prefix (Prefix (N));
5822 end Is_Atomic_Object;
5824 -------------------------
5825 -- Is_Coextension_Root --
5826 -------------------------
5828 function Is_Coextension_Root (N : Node_Id) return Boolean is
5831 Nkind (N) = N_Allocator
5832 and then Present (Coextensions (N))
5834 -- Anonymous access discriminants carry a list of all nested
5835 -- controlled coextensions.
5837 and then not Is_Dynamic_Coextension (N)
5838 and then not Is_Static_Coextension (N);
5839 end Is_Coextension_Root;
5841 -----------------------------
5842 -- Is_Concurrent_Interface --
5843 -----------------------------
5845 function Is_Concurrent_Interface (T : Entity_Id) return Boolean is
5850 (Is_Protected_Interface (T)
5851 or else Is_Synchronized_Interface (T)
5852 or else Is_Task_Interface (T));
5853 end Is_Concurrent_Interface;
5855 --------------------------------------
5856 -- Is_Controlling_Limited_Procedure --
5857 --------------------------------------
5859 function Is_Controlling_Limited_Procedure
5860 (Proc_Nam : Entity_Id) return Boolean
5862 Param_Typ : Entity_Id := Empty;
5865 if Ekind (Proc_Nam) = E_Procedure
5866 and then Present (Parameter_Specifications (Parent (Proc_Nam)))
5868 Param_Typ := Etype (Parameter_Type (First (
5869 Parameter_Specifications (Parent (Proc_Nam)))));
5871 -- In this case where an Itype was created, the procedure call has been
5874 elsif Present (Associated_Node_For_Itype (Proc_Nam))
5875 and then Present (Original_Node (Associated_Node_For_Itype (Proc_Nam)))
5877 Present (Parameter_Associations
5878 (Associated_Node_For_Itype (Proc_Nam)))
5881 Etype (First (Parameter_Associations
5882 (Associated_Node_For_Itype (Proc_Nam))));
5885 if Present (Param_Typ) then
5887 Is_Interface (Param_Typ)
5888 and then Is_Limited_Record (Param_Typ);
5892 end Is_Controlling_Limited_Procedure;
5894 -----------------------------
5895 -- Is_CPP_Constructor_Call --
5896 -----------------------------
5898 function Is_CPP_Constructor_Call (N : Node_Id) return Boolean is
5900 return Nkind (N) = N_Function_Call
5901 and then Is_CPP_Class (Etype (Etype (N)))
5902 and then Is_Constructor (Entity (Name (N)))
5903 and then Is_Imported (Entity (Name (N)));
5904 end Is_CPP_Constructor_Call;
5910 function Is_Delegate (T : Entity_Id) return Boolean is
5911 Desig_Type : Entity_Id;
5914 if VM_Target /= CLI_Target then
5918 -- Access-to-subprograms are delegates in CIL
5920 if Ekind (T) = E_Access_Subprogram_Type then
5924 if Ekind (T) not in Access_Kind then
5926 -- A delegate is a managed pointer. If no designated type is defined
5927 -- it means that it's not a delegate.
5932 Desig_Type := Etype (Directly_Designated_Type (T));
5934 if not Is_Tagged_Type (Desig_Type) then
5938 -- Test if the type is inherited from [mscorlib]System.Delegate
5940 while Etype (Desig_Type) /= Desig_Type loop
5941 if Chars (Scope (Desig_Type)) /= No_Name
5942 and then Is_Imported (Scope (Desig_Type))
5943 and then Get_Name_String (Chars (Scope (Desig_Type))) = "delegate"
5948 Desig_Type := Etype (Desig_Type);
5954 ----------------------------------------------
5955 -- Is_Dependent_Component_Of_Mutable_Object --
5956 ----------------------------------------------
5958 function Is_Dependent_Component_Of_Mutable_Object
5959 (Object : Node_Id) return Boolean
5962 Prefix_Type : Entity_Id;
5963 P_Aliased : Boolean := False;
5966 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean;
5967 -- Returns True if and only if Comp is declared within a variant part
5969 --------------------------------
5970 -- Is_Declared_Within_Variant --
5971 --------------------------------
5973 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean is
5974 Comp_Decl : constant Node_Id := Parent (Comp);
5975 Comp_List : constant Node_Id := Parent (Comp_Decl);
5977 return Nkind (Parent (Comp_List)) = N_Variant;
5978 end Is_Declared_Within_Variant;
5980 -- Start of processing for Is_Dependent_Component_Of_Mutable_Object
5983 if Is_Variable (Object) then
5985 if Nkind (Object) = N_Selected_Component then
5986 P := Prefix (Object);
5987 Prefix_Type := Etype (P);
5989 if Is_Entity_Name (P) then
5991 if Ekind (Entity (P)) = E_Generic_In_Out_Parameter then
5992 Prefix_Type := Base_Type (Prefix_Type);
5995 if Is_Aliased (Entity (P)) then
5999 -- A discriminant check on a selected component may be
6000 -- expanded into a dereference when removing side-effects.
6001 -- Recover the original node and its type, which may be
6004 elsif Nkind (P) = N_Explicit_Dereference
6005 and then not (Comes_From_Source (P))
6007 P := Original_Node (P);
6008 Prefix_Type := Etype (P);
6011 -- Check for prefix being an aliased component ???
6016 -- A heap object is constrained by its initial value
6018 -- Ada 2005 (AI-363): Always assume the object could be mutable in
6019 -- the dereferenced case, since the access value might denote an
6020 -- unconstrained aliased object, whereas in Ada 95 the designated
6021 -- object is guaranteed to be constrained. A worst-case assumption
6022 -- has to apply in Ada 2005 because we can't tell at compile time
6023 -- whether the object is "constrained by its initial value"
6024 -- (despite the fact that 3.10.2(26/2) and 8.5.1(5/2) are
6025 -- semantic rules -- these rules are acknowledged to need fixing).
6027 if Ada_Version < Ada_05 then
6028 if Is_Access_Type (Prefix_Type)
6029 or else Nkind (P) = N_Explicit_Dereference
6034 elsif Ada_Version >= Ada_05 then
6035 if Is_Access_Type (Prefix_Type) then
6037 -- If the access type is pool-specific, and there is no
6038 -- constrained partial view of the designated type, then the
6039 -- designated object is known to be constrained.
6041 if Ekind (Prefix_Type) = E_Access_Type
6042 and then not Has_Constrained_Partial_View
6043 (Designated_Type (Prefix_Type))
6047 -- Otherwise (general access type, or there is a constrained
6048 -- partial view of the designated type), we need to check
6049 -- based on the designated type.
6052 Prefix_Type := Designated_Type (Prefix_Type);
6058 Original_Record_Component (Entity (Selector_Name (Object)));
6060 -- As per AI-0017, the renaming is illegal in a generic body,
6061 -- even if the subtype is indefinite.
6063 -- Ada 2005 (AI-363): In Ada 2005 an aliased object can be mutable
6065 if not Is_Constrained (Prefix_Type)
6066 and then (not Is_Indefinite_Subtype (Prefix_Type)
6068 (Is_Generic_Type (Prefix_Type)
6069 and then Ekind (Current_Scope) = E_Generic_Package
6070 and then In_Package_Body (Current_Scope)))
6072 and then (Is_Declared_Within_Variant (Comp)
6073 or else Has_Discriminant_Dependent_Constraint (Comp))
6074 and then (not P_Aliased or else Ada_Version >= Ada_05)
6080 Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
6084 elsif Nkind (Object) = N_Indexed_Component
6085 or else Nkind (Object) = N_Slice
6087 return Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
6089 -- A type conversion that Is_Variable is a view conversion:
6090 -- go back to the denoted object.
6092 elsif Nkind (Object) = N_Type_Conversion then
6094 Is_Dependent_Component_Of_Mutable_Object (Expression (Object));
6099 end Is_Dependent_Component_Of_Mutable_Object;
6101 ---------------------
6102 -- Is_Dereferenced --
6103 ---------------------
6105 function Is_Dereferenced (N : Node_Id) return Boolean is
6106 P : constant Node_Id := Parent (N);
6109 (Nkind (P) = N_Selected_Component
6111 Nkind (P) = N_Explicit_Dereference
6113 Nkind (P) = N_Indexed_Component
6115 Nkind (P) = N_Slice)
6116 and then Prefix (P) = N;
6117 end Is_Dereferenced;
6119 ----------------------
6120 -- Is_Descendent_Of --
6121 ----------------------
6123 function Is_Descendent_Of (T1 : Entity_Id; T2 : Entity_Id) return Boolean is
6128 pragma Assert (Nkind (T1) in N_Entity);
6129 pragma Assert (Nkind (T2) in N_Entity);
6131 T := Base_Type (T1);
6133 -- Immediate return if the types match
6138 -- Comment needed here ???
6140 elsif Ekind (T) = E_Class_Wide_Type then
6141 return Etype (T) = T2;
6149 -- Done if we found the type we are looking for
6154 -- Done if no more derivations to check
6161 -- Following test catches error cases resulting from prev errors
6163 elsif No (Etyp) then
6166 elsif Is_Private_Type (T) and then Etyp = Full_View (T) then
6169 elsif Is_Private_Type (Etyp) and then Full_View (Etyp) = T then
6173 T := Base_Type (Etyp);
6176 end Is_Descendent_Of;
6182 function Is_False (U : Uint) return Boolean is
6187 ---------------------------
6188 -- Is_Fixed_Model_Number --
6189 ---------------------------
6191 function Is_Fixed_Model_Number (U : Ureal; T : Entity_Id) return Boolean is
6192 S : constant Ureal := Small_Value (T);
6193 M : Urealp.Save_Mark;
6197 R := (U = UR_Trunc (U / S) * S);
6200 end Is_Fixed_Model_Number;
6202 -------------------------------
6203 -- Is_Fully_Initialized_Type --
6204 -------------------------------
6206 function Is_Fully_Initialized_Type (Typ : Entity_Id) return Boolean is
6208 if Is_Scalar_Type (Typ) then
6211 elsif Is_Access_Type (Typ) then
6214 elsif Is_Array_Type (Typ) then
6215 if Is_Fully_Initialized_Type (Component_Type (Typ)) then
6219 -- An interesting case, if we have a constrained type one of whose
6220 -- bounds is known to be null, then there are no elements to be
6221 -- initialized, so all the elements are initialized!
6223 if Is_Constrained (Typ) then
6226 Indx_Typ : Entity_Id;
6230 Indx := First_Index (Typ);
6231 while Present (Indx) loop
6232 if Etype (Indx) = Any_Type then
6235 -- If index is a range, use directly
6237 elsif Nkind (Indx) = N_Range then
6238 Lbd := Low_Bound (Indx);
6239 Hbd := High_Bound (Indx);
6242 Indx_Typ := Etype (Indx);
6244 if Is_Private_Type (Indx_Typ) then
6245 Indx_Typ := Full_View (Indx_Typ);
6248 if No (Indx_Typ) or else Etype (Indx_Typ) = Any_Type then
6251 Lbd := Type_Low_Bound (Indx_Typ);
6252 Hbd := Type_High_Bound (Indx_Typ);
6256 if Compile_Time_Known_Value (Lbd)
6257 and then Compile_Time_Known_Value (Hbd)
6259 if Expr_Value (Hbd) < Expr_Value (Lbd) then
6269 -- If no null indexes, then type is not fully initialized
6275 elsif Is_Record_Type (Typ) then
6276 if Has_Discriminants (Typ)
6278 Present (Discriminant_Default_Value (First_Discriminant (Typ)))
6279 and then Is_Fully_Initialized_Variant (Typ)
6284 -- Controlled records are considered to be fully initialized if
6285 -- there is a user defined Initialize routine. This may not be
6286 -- entirely correct, but as the spec notes, we are guessing here
6287 -- what is best from the point of view of issuing warnings.
6289 if Is_Controlled (Typ) then
6291 Utyp : constant Entity_Id := Underlying_Type (Typ);
6294 if Present (Utyp) then
6296 Init : constant Entity_Id :=
6298 (Underlying_Type (Typ), Name_Initialize));
6302 and then Comes_From_Source (Init)
6304 Is_Predefined_File_Name
6305 (File_Name (Get_Source_File_Index (Sloc (Init))))
6309 elsif Has_Null_Extension (Typ)
6311 Is_Fully_Initialized_Type
6312 (Etype (Base_Type (Typ)))
6321 -- Otherwise see if all record components are initialized
6327 Ent := First_Entity (Typ);
6328 while Present (Ent) loop
6329 if Chars (Ent) = Name_uController then
6332 elsif Ekind (Ent) = E_Component
6333 and then (No (Parent (Ent))
6334 or else No (Expression (Parent (Ent))))
6335 and then not Is_Fully_Initialized_Type (Etype (Ent))
6337 -- Special VM case for tag components, which need to be
6338 -- defined in this case, but are never initialized as VMs
6339 -- are using other dispatching mechanisms. Ignore this
6340 -- uninitialized case. Note that this applies both to the
6341 -- uTag entry and the main vtable pointer (CPP_Class case).
6343 and then (Tagged_Type_Expansion or else not Is_Tag (Ent))
6352 -- No uninitialized components, so type is fully initialized.
6353 -- Note that this catches the case of no components as well.
6357 elsif Is_Concurrent_Type (Typ) then
6360 elsif Is_Private_Type (Typ) then
6362 U : constant Entity_Id := Underlying_Type (Typ);
6368 return Is_Fully_Initialized_Type (U);
6375 end Is_Fully_Initialized_Type;
6377 ----------------------------------
6378 -- Is_Fully_Initialized_Variant --
6379 ----------------------------------
6381 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean is
6382 Loc : constant Source_Ptr := Sloc (Typ);
6383 Constraints : constant List_Id := New_List;
6384 Components : constant Elist_Id := New_Elmt_List;
6385 Comp_Elmt : Elmt_Id;
6387 Comp_List : Node_Id;
6389 Discr_Val : Node_Id;
6391 Report_Errors : Boolean;
6392 pragma Warnings (Off, Report_Errors);
6395 if Serious_Errors_Detected > 0 then
6399 if Is_Record_Type (Typ)
6400 and then Nkind (Parent (Typ)) = N_Full_Type_Declaration
6401 and then Nkind (Type_Definition (Parent (Typ))) = N_Record_Definition
6403 Comp_List := Component_List (Type_Definition (Parent (Typ)));
6405 Discr := First_Discriminant (Typ);
6406 while Present (Discr) loop
6407 if Nkind (Parent (Discr)) = N_Discriminant_Specification then
6408 Discr_Val := Expression (Parent (Discr));
6410 if Present (Discr_Val)
6411 and then Is_OK_Static_Expression (Discr_Val)
6413 Append_To (Constraints,
6414 Make_Component_Association (Loc,
6415 Choices => New_List (New_Occurrence_Of (Discr, Loc)),
6416 Expression => New_Copy (Discr_Val)));
6424 Next_Discriminant (Discr);
6429 Comp_List => Comp_List,
6430 Governed_By => Constraints,
6432 Report_Errors => Report_Errors);
6434 -- Check that each component present is fully initialized
6436 Comp_Elmt := First_Elmt (Components);
6437 while Present (Comp_Elmt) loop
6438 Comp_Id := Node (Comp_Elmt);
6440 if Ekind (Comp_Id) = E_Component
6441 and then (No (Parent (Comp_Id))
6442 or else No (Expression (Parent (Comp_Id))))
6443 and then not Is_Fully_Initialized_Type (Etype (Comp_Id))
6448 Next_Elmt (Comp_Elmt);
6453 elsif Is_Private_Type (Typ) then
6455 U : constant Entity_Id := Underlying_Type (Typ);
6461 return Is_Fully_Initialized_Variant (U);
6467 end Is_Fully_Initialized_Variant;
6473 -- We seem to have a lot of overlapping functions that do similar things
6474 -- (testing for left hand sides or lvalues???). Anyway, since this one is
6475 -- purely syntactic, it should be in Sem_Aux I would think???
6477 function Is_LHS (N : Node_Id) return Boolean is
6478 P : constant Node_Id := Parent (N);
6480 return Nkind (P) = N_Assignment_Statement
6481 and then Name (P) = N;
6484 ----------------------------
6485 -- Is_Inherited_Operation --
6486 ----------------------------
6488 function Is_Inherited_Operation (E : Entity_Id) return Boolean is
6489 Kind : constant Node_Kind := Nkind (Parent (E));
6491 pragma Assert (Is_Overloadable (E));
6492 return Kind = N_Full_Type_Declaration
6493 or else Kind = N_Private_Extension_Declaration
6494 or else Kind = N_Subtype_Declaration
6495 or else (Ekind (E) = E_Enumeration_Literal
6496 and then Is_Derived_Type (Etype (E)));
6497 end Is_Inherited_Operation;
6499 -----------------------------
6500 -- Is_Library_Level_Entity --
6501 -----------------------------
6503 function Is_Library_Level_Entity (E : Entity_Id) return Boolean is
6505 -- The following is a small optimization, and it also properly handles
6506 -- discriminals, which in task bodies might appear in expressions before
6507 -- the corresponding procedure has been created, and which therefore do
6508 -- not have an assigned scope.
6510 if Is_Formal (E) then
6514 -- Normal test is simply that the enclosing dynamic scope is Standard
6516 return Enclosing_Dynamic_Scope (E) = Standard_Standard;
6517 end Is_Library_Level_Entity;
6519 ---------------------------------
6520 -- Is_Local_Variable_Reference --
6521 ---------------------------------
6523 function Is_Local_Variable_Reference (Expr : Node_Id) return Boolean is
6525 if not Is_Entity_Name (Expr) then
6530 Ent : constant Entity_Id := Entity (Expr);
6531 Sub : constant Entity_Id := Enclosing_Subprogram (Ent);
6533 if not Ekind_In (Ent, E_Variable, E_In_Out_Parameter) then
6536 return Present (Sub) and then Sub = Current_Subprogram;
6540 end Is_Local_Variable_Reference;
6542 -------------------------
6543 -- Is_Object_Reference --
6544 -------------------------
6546 function Is_Object_Reference (N : Node_Id) return Boolean is
6548 if Is_Entity_Name (N) then
6549 return Present (Entity (N)) and then Is_Object (Entity (N));
6553 when N_Indexed_Component | N_Slice =>
6555 Is_Object_Reference (Prefix (N))
6556 or else Is_Access_Type (Etype (Prefix (N)));
6558 -- In Ada95, a function call is a constant object; a procedure
6561 when N_Function_Call =>
6562 return Etype (N) /= Standard_Void_Type;
6564 -- A reference to the stream attribute Input is a function call
6566 when N_Attribute_Reference =>
6567 return Attribute_Name (N) = Name_Input;
6569 when N_Selected_Component =>
6571 Is_Object_Reference (Selector_Name (N))
6573 (Is_Object_Reference (Prefix (N))
6574 or else Is_Access_Type (Etype (Prefix (N))));
6576 when N_Explicit_Dereference =>
6579 -- A view conversion of a tagged object is an object reference
6581 when N_Type_Conversion =>
6582 return Is_Tagged_Type (Etype (Subtype_Mark (N)))
6583 and then Is_Tagged_Type (Etype (Expression (N)))
6584 and then Is_Object_Reference (Expression (N));
6586 -- An unchecked type conversion is considered to be an object if
6587 -- the operand is an object (this construction arises only as a
6588 -- result of expansion activities).
6590 when N_Unchecked_Type_Conversion =>
6597 end Is_Object_Reference;
6599 -----------------------------------
6600 -- Is_OK_Variable_For_Out_Formal --
6601 -----------------------------------
6603 function Is_OK_Variable_For_Out_Formal (AV : Node_Id) return Boolean is
6605 Note_Possible_Modification (AV, Sure => True);
6607 -- We must reject parenthesized variable names. The check for
6608 -- Comes_From_Source is present because there are currently
6609 -- cases where the compiler violates this rule (e.g. passing
6610 -- a task object to its controlled Initialize routine).
6612 if Paren_Count (AV) > 0 and then Comes_From_Source (AV) then
6615 -- A variable is always allowed
6617 elsif Is_Variable (AV) then
6620 -- Unchecked conversions are allowed only if they come from the
6621 -- generated code, which sometimes uses unchecked conversions for out
6622 -- parameters in cases where code generation is unaffected. We tell
6623 -- source unchecked conversions by seeing if they are rewrites of an
6624 -- original Unchecked_Conversion function call, or of an explicit
6625 -- conversion of a function call.
6627 elsif Nkind (AV) = N_Unchecked_Type_Conversion then
6628 if Nkind (Original_Node (AV)) = N_Function_Call then
6631 elsif Comes_From_Source (AV)
6632 and then Nkind (Original_Node (Expression (AV))) = N_Function_Call
6636 elsif Nkind (Original_Node (AV)) = N_Type_Conversion then
6637 return Is_OK_Variable_For_Out_Formal (Expression (AV));
6643 -- Normal type conversions are allowed if argument is a variable
6645 elsif Nkind (AV) = N_Type_Conversion then
6646 if Is_Variable (Expression (AV))
6647 and then Paren_Count (Expression (AV)) = 0
6649 Note_Possible_Modification (Expression (AV), Sure => True);
6652 -- We also allow a non-parenthesized expression that raises
6653 -- constraint error if it rewrites what used to be a variable
6655 elsif Raises_Constraint_Error (Expression (AV))
6656 and then Paren_Count (Expression (AV)) = 0
6657 and then Is_Variable (Original_Node (Expression (AV)))
6661 -- Type conversion of something other than a variable
6667 -- If this node is rewritten, then test the original form, if that is
6668 -- OK, then we consider the rewritten node OK (for example, if the
6669 -- original node is a conversion, then Is_Variable will not be true
6670 -- but we still want to allow the conversion if it converts a variable).
6672 elsif Original_Node (AV) /= AV then
6673 return Is_OK_Variable_For_Out_Formal (Original_Node (AV));
6675 -- All other non-variables are rejected
6680 end Is_OK_Variable_For_Out_Formal;
6682 -----------------------------------
6683 -- Is_Partially_Initialized_Type --
6684 -----------------------------------
6686 function Is_Partially_Initialized_Type (Typ : Entity_Id) return Boolean is
6688 if Is_Scalar_Type (Typ) then
6691 elsif Is_Access_Type (Typ) then
6694 elsif Is_Array_Type (Typ) then
6696 -- If component type is partially initialized, so is array type
6698 if Is_Partially_Initialized_Type (Component_Type (Typ)) then
6701 -- Otherwise we are only partially initialized if we are fully
6702 -- initialized (this is the empty array case, no point in us
6703 -- duplicating that code here).
6706 return Is_Fully_Initialized_Type (Typ);
6709 elsif Is_Record_Type (Typ) then
6711 -- A discriminated type is always partially initialized
6713 if Has_Discriminants (Typ) then
6716 -- A tagged type is always partially initialized
6718 elsif Is_Tagged_Type (Typ) then
6721 -- Case of non-discriminated record
6727 Component_Present : Boolean := False;
6728 -- Set True if at least one component is present. If no
6729 -- components are present, then record type is fully
6730 -- initialized (another odd case, like the null array).
6733 -- Loop through components
6735 Ent := First_Entity (Typ);
6736 while Present (Ent) loop
6737 if Ekind (Ent) = E_Component then
6738 Component_Present := True;
6740 -- If a component has an initialization expression then
6741 -- the enclosing record type is partially initialized
6743 if Present (Parent (Ent))
6744 and then Present (Expression (Parent (Ent)))
6748 -- If a component is of a type which is itself partially
6749 -- initialized, then the enclosing record type is also.
6751 elsif Is_Partially_Initialized_Type (Etype (Ent)) then
6759 -- No initialized components found. If we found any components
6760 -- they were all uninitialized so the result is false.
6762 if Component_Present then
6765 -- But if we found no components, then all the components are
6766 -- initialized so we consider the type to be initialized.
6774 -- Concurrent types are always fully initialized
6776 elsif Is_Concurrent_Type (Typ) then
6779 -- For a private type, go to underlying type. If there is no underlying
6780 -- type then just assume this partially initialized. Not clear if this
6781 -- can happen in a non-error case, but no harm in testing for this.
6783 elsif Is_Private_Type (Typ) then
6785 U : constant Entity_Id := Underlying_Type (Typ);
6790 return Is_Partially_Initialized_Type (U);
6794 -- For any other type (are there any?) assume partially initialized
6799 end Is_Partially_Initialized_Type;
6801 ------------------------------------
6802 -- Is_Potentially_Persistent_Type --
6803 ------------------------------------
6805 function Is_Potentially_Persistent_Type (T : Entity_Id) return Boolean is
6810 -- For private type, test corresponding full type
6812 if Is_Private_Type (T) then
6813 return Is_Potentially_Persistent_Type (Full_View (T));
6815 -- Scalar types are potentially persistent
6817 elsif Is_Scalar_Type (T) then
6820 -- Record type is potentially persistent if not tagged and the types of
6821 -- all it components are potentially persistent, and no component has
6822 -- an initialization expression.
6824 elsif Is_Record_Type (T)
6825 and then not Is_Tagged_Type (T)
6826 and then not Is_Partially_Initialized_Type (T)
6828 Comp := First_Component (T);
6829 while Present (Comp) loop
6830 if not Is_Potentially_Persistent_Type (Etype (Comp)) then
6839 -- Array type is potentially persistent if its component type is
6840 -- potentially persistent and if all its constraints are static.
6842 elsif Is_Array_Type (T) then
6843 if not Is_Potentially_Persistent_Type (Component_Type (T)) then
6847 Indx := First_Index (T);
6848 while Present (Indx) loop
6849 if not Is_OK_Static_Subtype (Etype (Indx)) then
6858 -- All other types are not potentially persistent
6863 end Is_Potentially_Persistent_Type;
6865 ---------------------------------
6866 -- Is_Protected_Self_Reference --
6867 ---------------------------------
6869 function Is_Protected_Self_Reference (N : Node_Id) return Boolean is
6871 function In_Access_Definition (N : Node_Id) return Boolean;
6872 -- Returns true if N belongs to an access definition
6874 --------------------------
6875 -- In_Access_Definition --
6876 --------------------------
6878 function In_Access_Definition (N : Node_Id) return Boolean is
6883 while Present (P) loop
6884 if Nkind (P) = N_Access_Definition then
6892 end In_Access_Definition;
6894 -- Start of processing for Is_Protected_Self_Reference
6897 -- Verify that prefix is analyzed and has the proper form. Note that
6898 -- the attributes Elab_Spec, Elab_Body, and UET_Address, which also
6899 -- produce the address of an entity, do not analyze their prefix
6900 -- because they denote entities that are not necessarily visible.
6901 -- Neither of them can apply to a protected type.
6903 return Ada_Version >= Ada_05
6904 and then Is_Entity_Name (N)
6905 and then Present (Entity (N))
6906 and then Is_Protected_Type (Entity (N))
6907 and then In_Open_Scopes (Entity (N))
6908 and then not In_Access_Definition (N);
6909 end Is_Protected_Self_Reference;
6911 -----------------------------
6912 -- Is_RCI_Pkg_Spec_Or_Body --
6913 -----------------------------
6915 function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
6917 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
6918 -- Return True if the unit of Cunit is an RCI package declaration
6920 ---------------------------
6921 -- Is_RCI_Pkg_Decl_Cunit --
6922 ---------------------------
6924 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean is
6925 The_Unit : constant Node_Id := Unit (Cunit);
6928 if Nkind (The_Unit) /= N_Package_Declaration then
6932 return Is_Remote_Call_Interface (Defining_Entity (The_Unit));
6933 end Is_RCI_Pkg_Decl_Cunit;
6935 -- Start of processing for Is_RCI_Pkg_Spec_Or_Body
6938 return Is_RCI_Pkg_Decl_Cunit (Cunit)
6940 (Nkind (Unit (Cunit)) = N_Package_Body
6941 and then Is_RCI_Pkg_Decl_Cunit (Library_Unit (Cunit)));
6942 end Is_RCI_Pkg_Spec_Or_Body;
6944 -----------------------------------------
6945 -- Is_Remote_Access_To_Class_Wide_Type --
6946 -----------------------------------------
6948 function Is_Remote_Access_To_Class_Wide_Type
6949 (E : Entity_Id) return Boolean
6952 -- A remote access to class-wide type is a general access to object type
6953 -- declared in the visible part of a Remote_Types or Remote_Call_
6956 return Ekind (E) = E_General_Access_Type
6957 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
6958 end Is_Remote_Access_To_Class_Wide_Type;
6960 -----------------------------------------
6961 -- Is_Remote_Access_To_Subprogram_Type --
6962 -----------------------------------------
6964 function Is_Remote_Access_To_Subprogram_Type
6965 (E : Entity_Id) return Boolean
6968 return (Ekind (E) = E_Access_Subprogram_Type
6969 or else (Ekind (E) = E_Record_Type
6970 and then Present (Corresponding_Remote_Type (E))))
6971 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
6972 end Is_Remote_Access_To_Subprogram_Type;
6974 --------------------
6975 -- Is_Remote_Call --
6976 --------------------
6978 function Is_Remote_Call (N : Node_Id) return Boolean is
6980 if Nkind (N) /= N_Procedure_Call_Statement
6981 and then Nkind (N) /= N_Function_Call
6983 -- An entry call cannot be remote
6987 elsif Nkind (Name (N)) in N_Has_Entity
6988 and then Is_Remote_Call_Interface (Entity (Name (N)))
6990 -- A subprogram declared in the spec of a RCI package is remote
6994 elsif Nkind (Name (N)) = N_Explicit_Dereference
6995 and then Is_Remote_Access_To_Subprogram_Type
6996 (Etype (Prefix (Name (N))))
6998 -- The dereference of a RAS is a remote call
7002 elsif Present (Controlling_Argument (N))
7003 and then Is_Remote_Access_To_Class_Wide_Type
7004 (Etype (Controlling_Argument (N)))
7006 -- Any primitive operation call with a controlling argument of
7007 -- a RACW type is a remote call.
7012 -- All other calls are local calls
7017 ----------------------
7018 -- Is_Renamed_Entry --
7019 ----------------------
7021 function Is_Renamed_Entry (Proc_Nam : Entity_Id) return Boolean is
7022 Orig_Node : Node_Id := Empty;
7023 Subp_Decl : Node_Id := Parent (Parent (Proc_Nam));
7025 function Is_Entry (Nam : Node_Id) return Boolean;
7026 -- Determine whether Nam is an entry. Traverse selectors if there are
7027 -- nested selected components.
7033 function Is_Entry (Nam : Node_Id) return Boolean is
7035 if Nkind (Nam) = N_Selected_Component then
7036 return Is_Entry (Selector_Name (Nam));
7039 return Ekind (Entity (Nam)) = E_Entry;
7042 -- Start of processing for Is_Renamed_Entry
7045 if Present (Alias (Proc_Nam)) then
7046 Subp_Decl := Parent (Parent (Alias (Proc_Nam)));
7049 -- Look for a rewritten subprogram renaming declaration
7051 if Nkind (Subp_Decl) = N_Subprogram_Declaration
7052 and then Present (Original_Node (Subp_Decl))
7054 Orig_Node := Original_Node (Subp_Decl);
7057 -- The rewritten subprogram is actually an entry
7059 if Present (Orig_Node)
7060 and then Nkind (Orig_Node) = N_Subprogram_Renaming_Declaration
7061 and then Is_Entry (Name (Orig_Node))
7067 end Is_Renamed_Entry;
7069 ----------------------
7070 -- Is_Selector_Name --
7071 ----------------------
7073 function Is_Selector_Name (N : Node_Id) return Boolean is
7075 if not Is_List_Member (N) then
7077 P : constant Node_Id := Parent (N);
7078 K : constant Node_Kind := Nkind (P);
7081 (K = N_Expanded_Name or else
7082 K = N_Generic_Association or else
7083 K = N_Parameter_Association or else
7084 K = N_Selected_Component)
7085 and then Selector_Name (P) = N;
7090 L : constant List_Id := List_Containing (N);
7091 P : constant Node_Id := Parent (L);
7093 return (Nkind (P) = N_Discriminant_Association
7094 and then Selector_Names (P) = L)
7096 (Nkind (P) = N_Component_Association
7097 and then Choices (P) = L);
7100 end Is_Selector_Name;
7106 function Is_Statement (N : Node_Id) return Boolean is
7109 Nkind (N) in N_Statement_Other_Than_Procedure_Call
7110 or else Nkind (N) = N_Procedure_Call_Statement;
7113 ---------------------------------
7114 -- Is_Synchronized_Tagged_Type --
7115 ---------------------------------
7117 function Is_Synchronized_Tagged_Type (E : Entity_Id) return Boolean is
7118 Kind : constant Entity_Kind := Ekind (Base_Type (E));
7121 -- A task or protected type derived from an interface is a tagged type.
7122 -- Such a tagged type is called a synchronized tagged type, as are
7123 -- synchronized interfaces and private extensions whose declaration
7124 -- includes the reserved word synchronized.
7126 return (Is_Tagged_Type (E)
7127 and then (Kind = E_Task_Type
7128 or else Kind = E_Protected_Type))
7131 and then Is_Synchronized_Interface (E))
7133 (Ekind (E) = E_Record_Type_With_Private
7134 and then (Synchronized_Present (Parent (E))
7135 or else Is_Synchronized_Interface (Etype (E))));
7136 end Is_Synchronized_Tagged_Type;
7142 function Is_Transfer (N : Node_Id) return Boolean is
7143 Kind : constant Node_Kind := Nkind (N);
7146 if Kind = N_Simple_Return_Statement
7148 Kind = N_Extended_Return_Statement
7150 Kind = N_Goto_Statement
7152 Kind = N_Raise_Statement
7154 Kind = N_Requeue_Statement
7158 elsif (Kind = N_Exit_Statement or else Kind in N_Raise_xxx_Error)
7159 and then No (Condition (N))
7163 elsif Kind = N_Procedure_Call_Statement
7164 and then Is_Entity_Name (Name (N))
7165 and then Present (Entity (Name (N)))
7166 and then No_Return (Entity (Name (N)))
7170 elsif Nkind (Original_Node (N)) = N_Raise_Statement then
7182 function Is_True (U : Uint) return Boolean is
7187 -------------------------------
7188 -- Is_Universal_Numeric_Type --
7189 -------------------------------
7191 function Is_Universal_Numeric_Type (T : Entity_Id) return Boolean is
7193 return T = Universal_Integer or else T = Universal_Real;
7194 end Is_Universal_Numeric_Type;
7200 function Is_Value_Type (T : Entity_Id) return Boolean is
7202 return VM_Target = CLI_Target
7203 and then Nkind (T) in N_Has_Chars
7204 and then Chars (T) /= No_Name
7205 and then Get_Name_String (Chars (T)) = "valuetype";
7208 ---------------------
7209 -- Is_VMS_Operator --
7210 ---------------------
7212 function Is_VMS_Operator (Op : Entity_Id) return Boolean is
7214 -- The VMS operators are declared in a child of System that is loaded
7215 -- through pragma Extend_System. In some rare cases a program is run
7216 -- with this extension but without indicating that the target is VMS.
7218 return Ekind (Op) = E_Function
7219 and then Is_Intrinsic_Subprogram (Op)
7221 ((Present_System_Aux
7222 and then Scope (Op) = System_Aux_Id)
7225 and then Scope (Scope (Op)) = RTU_Entity (System)));
7226 end Is_VMS_Operator;
7232 function Is_Variable (N : Node_Id) return Boolean is
7234 Orig_Node : constant Node_Id := Original_Node (N);
7235 -- We do the test on the original node, since this is basically a test
7236 -- of syntactic categories, so it must not be disturbed by whatever
7237 -- rewriting might have occurred. For example, an aggregate, which is
7238 -- certainly NOT a variable, could be turned into a variable by
7241 function In_Protected_Function (E : Entity_Id) return Boolean;
7242 -- Within a protected function, the private components of the enclosing
7243 -- protected type are constants. A function nested within a (protected)
7244 -- procedure is not itself protected.
7246 function Is_Variable_Prefix (P : Node_Id) return Boolean;
7247 -- Prefixes can involve implicit dereferences, in which case we must
7248 -- test for the case of a reference of a constant access type, which can
7249 -- can never be a variable.
7251 ---------------------------
7252 -- In_Protected_Function --
7253 ---------------------------
7255 function In_Protected_Function (E : Entity_Id) return Boolean is
7256 Prot : constant Entity_Id := Scope (E);
7260 if not Is_Protected_Type (Prot) then
7264 while Present (S) and then S /= Prot loop
7265 if Ekind (S) = E_Function and then Scope (S) = Prot then
7274 end In_Protected_Function;
7276 ------------------------
7277 -- Is_Variable_Prefix --
7278 ------------------------
7280 function Is_Variable_Prefix (P : Node_Id) return Boolean is
7282 if Is_Access_Type (Etype (P)) then
7283 return not Is_Access_Constant (Root_Type (Etype (P)));
7285 -- For the case of an indexed component whose prefix has a packed
7286 -- array type, the prefix has been rewritten into a type conversion.
7287 -- Determine variable-ness from the converted expression.
7289 elsif Nkind (P) = N_Type_Conversion
7290 and then not Comes_From_Source (P)
7291 and then Is_Array_Type (Etype (P))
7292 and then Is_Packed (Etype (P))
7294 return Is_Variable (Expression (P));
7297 return Is_Variable (P);
7299 end Is_Variable_Prefix;
7301 -- Start of processing for Is_Variable
7304 -- Definitely OK if Assignment_OK is set. Since this is something that
7305 -- only gets set for expanded nodes, the test is on N, not Orig_Node.
7307 if Nkind (N) in N_Subexpr and then Assignment_OK (N) then
7310 -- Normally we go to the original node, but there is one exception where
7311 -- we use the rewritten node, namely when it is an explicit dereference.
7312 -- The generated code may rewrite a prefix which is an access type with
7313 -- an explicit dereference. The dereference is a variable, even though
7314 -- the original node may not be (since it could be a constant of the
7317 -- In Ada 2005 we have a further case to consider: the prefix may be a
7318 -- function call given in prefix notation. The original node appears to
7319 -- be a selected component, but we need to examine the call.
7321 elsif Nkind (N) = N_Explicit_Dereference
7322 and then Nkind (Orig_Node) /= N_Explicit_Dereference
7323 and then Present (Etype (Orig_Node))
7324 and then Is_Access_Type (Etype (Orig_Node))
7326 -- Note that if the prefix is an explicit dereference that does not
7327 -- come from source, we must check for a rewritten function call in
7328 -- prefixed notation before other forms of rewriting, to prevent a
7332 (Nkind (Orig_Node) = N_Function_Call
7333 and then not Is_Access_Constant (Etype (Prefix (N))))
7335 Is_Variable_Prefix (Original_Node (Prefix (N)));
7337 -- A function call is never a variable
7339 elsif Nkind (N) = N_Function_Call then
7342 -- All remaining checks use the original node
7344 elsif Is_Entity_Name (Orig_Node)
7345 and then Present (Entity (Orig_Node))
7348 E : constant Entity_Id := Entity (Orig_Node);
7349 K : constant Entity_Kind := Ekind (E);
7352 return (K = E_Variable
7353 and then Nkind (Parent (E)) /= N_Exception_Handler)
7354 or else (K = E_Component
7355 and then not In_Protected_Function (E))
7356 or else K = E_Out_Parameter
7357 or else K = E_In_Out_Parameter
7358 or else K = E_Generic_In_Out_Parameter
7360 -- Current instance of type:
7362 or else (Is_Type (E) and then In_Open_Scopes (E))
7363 or else (Is_Incomplete_Or_Private_Type (E)
7364 and then In_Open_Scopes (Full_View (E)));
7368 case Nkind (Orig_Node) is
7369 when N_Indexed_Component | N_Slice =>
7370 return Is_Variable_Prefix (Prefix (Orig_Node));
7372 when N_Selected_Component =>
7373 return Is_Variable_Prefix (Prefix (Orig_Node))
7374 and then Is_Variable (Selector_Name (Orig_Node));
7376 -- For an explicit dereference, the type of the prefix cannot
7377 -- be an access to constant or an access to subprogram.
7379 when N_Explicit_Dereference =>
7381 Typ : constant Entity_Id := Etype (Prefix (Orig_Node));
7383 return Is_Access_Type (Typ)
7384 and then not Is_Access_Constant (Root_Type (Typ))
7385 and then Ekind (Typ) /= E_Access_Subprogram_Type;
7388 -- The type conversion is the case where we do not deal with the
7389 -- context dependent special case of an actual parameter. Thus
7390 -- the type conversion is only considered a variable for the
7391 -- purposes of this routine if the target type is tagged. However,
7392 -- a type conversion is considered to be a variable if it does not
7393 -- come from source (this deals for example with the conversions
7394 -- of expressions to their actual subtypes).
7396 when N_Type_Conversion =>
7397 return Is_Variable (Expression (Orig_Node))
7399 (not Comes_From_Source (Orig_Node)
7401 (Is_Tagged_Type (Etype (Subtype_Mark (Orig_Node)))
7403 Is_Tagged_Type (Etype (Expression (Orig_Node)))));
7405 -- GNAT allows an unchecked type conversion as a variable. This
7406 -- only affects the generation of internal expanded code, since
7407 -- calls to instantiations of Unchecked_Conversion are never
7408 -- considered variables (since they are function calls).
7409 -- This is also true for expression actions.
7411 when N_Unchecked_Type_Conversion =>
7412 return Is_Variable (Expression (Orig_Node));
7420 ---------------------------
7421 -- Is_Visibly_Controlled --
7422 ---------------------------
7424 function Is_Visibly_Controlled (T : Entity_Id) return Boolean is
7425 Root : constant Entity_Id := Root_Type (T);
7427 return Chars (Scope (Root)) = Name_Finalization
7428 and then Chars (Scope (Scope (Root))) = Name_Ada
7429 and then Scope (Scope (Scope (Root))) = Standard_Standard;
7430 end Is_Visibly_Controlled;
7432 ------------------------
7433 -- Is_Volatile_Object --
7434 ------------------------
7436 function Is_Volatile_Object (N : Node_Id) return Boolean is
7438 function Object_Has_Volatile_Components (N : Node_Id) return Boolean;
7439 -- Determines if given object has volatile components
7441 function Is_Volatile_Prefix (N : Node_Id) return Boolean;
7442 -- If prefix is an implicit dereference, examine designated type
7444 ------------------------
7445 -- Is_Volatile_Prefix --
7446 ------------------------
7448 function Is_Volatile_Prefix (N : Node_Id) return Boolean is
7449 Typ : constant Entity_Id := Etype (N);
7452 if Is_Access_Type (Typ) then
7454 Dtyp : constant Entity_Id := Designated_Type (Typ);
7457 return Is_Volatile (Dtyp)
7458 or else Has_Volatile_Components (Dtyp);
7462 return Object_Has_Volatile_Components (N);
7464 end Is_Volatile_Prefix;
7466 ------------------------------------
7467 -- Object_Has_Volatile_Components --
7468 ------------------------------------
7470 function Object_Has_Volatile_Components (N : Node_Id) return Boolean is
7471 Typ : constant Entity_Id := Etype (N);
7474 if Is_Volatile (Typ)
7475 or else Has_Volatile_Components (Typ)
7479 elsif Is_Entity_Name (N)
7480 and then (Has_Volatile_Components (Entity (N))
7481 or else Is_Volatile (Entity (N)))
7485 elsif Nkind (N) = N_Indexed_Component
7486 or else Nkind (N) = N_Selected_Component
7488 return Is_Volatile_Prefix (Prefix (N));
7493 end Object_Has_Volatile_Components;
7495 -- Start of processing for Is_Volatile_Object
7498 if Is_Volatile (Etype (N))
7499 or else (Is_Entity_Name (N) and then Is_Volatile (Entity (N)))
7503 elsif Nkind (N) = N_Indexed_Component
7504 or else Nkind (N) = N_Selected_Component
7506 return Is_Volatile_Prefix (Prefix (N));
7511 end Is_Volatile_Object;
7513 -------------------------
7514 -- Kill_Current_Values --
7515 -------------------------
7517 procedure Kill_Current_Values
7519 Last_Assignment_Only : Boolean := False)
7522 -- ??? do we have to worry about clearing cached checks?
7524 if Is_Assignable (Ent) then
7525 Set_Last_Assignment (Ent, Empty);
7528 if Is_Object (Ent) then
7529 if not Last_Assignment_Only then
7531 Set_Current_Value (Ent, Empty);
7533 if not Can_Never_Be_Null (Ent) then
7534 Set_Is_Known_Non_Null (Ent, False);
7537 Set_Is_Known_Null (Ent, False);
7539 -- Reset Is_Known_Valid unless type is always valid, or if we have
7540 -- a loop parameter (loop parameters are always valid, since their
7541 -- bounds are defined by the bounds given in the loop header).
7543 if not Is_Known_Valid (Etype (Ent))
7544 and then Ekind (Ent) /= E_Loop_Parameter
7546 Set_Is_Known_Valid (Ent, False);
7550 end Kill_Current_Values;
7552 procedure Kill_Current_Values (Last_Assignment_Only : Boolean := False) is
7555 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id);
7556 -- Clear current value for entity E and all entities chained to E
7558 ------------------------------------------
7559 -- Kill_Current_Values_For_Entity_Chain --
7560 ------------------------------------------
7562 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id) is
7566 while Present (Ent) loop
7567 Kill_Current_Values (Ent, Last_Assignment_Only);
7570 end Kill_Current_Values_For_Entity_Chain;
7572 -- Start of processing for Kill_Current_Values
7575 -- Kill all saved checks, a special case of killing saved values
7577 if not Last_Assignment_Only then
7581 -- Loop through relevant scopes, which includes the current scope and
7582 -- any parent scopes if the current scope is a block or a package.
7587 -- Clear current values of all entities in current scope
7589 Kill_Current_Values_For_Entity_Chain (First_Entity (S));
7591 -- If scope is a package, also clear current values of all
7592 -- private entities in the scope.
7594 if Is_Package_Or_Generic_Package (S)
7595 or else Is_Concurrent_Type (S)
7597 Kill_Current_Values_For_Entity_Chain (First_Private_Entity (S));
7600 -- If this is a not a subprogram, deal with parents
7602 if not Is_Subprogram (S) then
7604 exit Scope_Loop when S = Standard_Standard;
7608 end loop Scope_Loop;
7609 end Kill_Current_Values;
7611 --------------------------
7612 -- Kill_Size_Check_Code --
7613 --------------------------
7615 procedure Kill_Size_Check_Code (E : Entity_Id) is
7617 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
7618 and then Present (Size_Check_Code (E))
7620 Remove (Size_Check_Code (E));
7621 Set_Size_Check_Code (E, Empty);
7623 end Kill_Size_Check_Code;
7625 --------------------------
7626 -- Known_To_Be_Assigned --
7627 --------------------------
7629 function Known_To_Be_Assigned (N : Node_Id) return Boolean is
7630 P : constant Node_Id := Parent (N);
7635 -- Test left side of assignment
7637 when N_Assignment_Statement =>
7638 return N = Name (P);
7640 -- Function call arguments are never lvalues
7642 when N_Function_Call =>
7645 -- Positional parameter for procedure or accept call
7647 when N_Procedure_Call_Statement |
7656 Proc := Get_Subprogram_Entity (P);
7662 -- If we are not a list member, something is strange, so
7663 -- be conservative and return False.
7665 if not Is_List_Member (N) then
7669 -- We are going to find the right formal by stepping forward
7670 -- through the formals, as we step backwards in the actuals.
7672 Form := First_Formal (Proc);
7675 -- If no formal, something is weird, so be conservative
7676 -- and return False.
7687 return Ekind (Form) /= E_In_Parameter;
7690 -- Named parameter for procedure or accept call
7692 when N_Parameter_Association =>
7698 Proc := Get_Subprogram_Entity (Parent (P));
7704 -- Loop through formals to find the one that matches
7706 Form := First_Formal (Proc);
7708 -- If no matching formal, that's peculiar, some kind of
7709 -- previous error, so return False to be conservative.
7715 -- Else test for match
7717 if Chars (Form) = Chars (Selector_Name (P)) then
7718 return Ekind (Form) /= E_In_Parameter;
7725 -- Test for appearing in a conversion that itself appears
7726 -- in an lvalue context, since this should be an lvalue.
7728 when N_Type_Conversion =>
7729 return Known_To_Be_Assigned (P);
7731 -- All other references are definitely not known to be modifications
7737 end Known_To_Be_Assigned;
7743 function May_Be_Lvalue (N : Node_Id) return Boolean is
7744 P : constant Node_Id := Parent (N);
7749 -- Test left side of assignment
7751 when N_Assignment_Statement =>
7752 return N = Name (P);
7754 -- Test prefix of component or attribute. Note that the prefix of an
7755 -- explicit or implicit dereference cannot be an l-value.
7757 when N_Attribute_Reference =>
7758 return N = Prefix (P)
7759 and then Name_Implies_Lvalue_Prefix (Attribute_Name (P));
7761 -- For an expanded name, the name is an lvalue if the expanded name
7762 -- is an lvalue, but the prefix is never an lvalue, since it is just
7763 -- the scope where the name is found.
7765 when N_Expanded_Name =>
7766 if N = Prefix (P) then
7767 return May_Be_Lvalue (P);
7772 -- For a selected component A.B, A is certainly an lvalue if A.B is.
7773 -- B is a little interesting, if we have A.B := 3, there is some
7774 -- discussion as to whether B is an lvalue or not, we choose to say
7775 -- it is. Note however that A is not an lvalue if it is of an access
7776 -- type since this is an implicit dereference.
7778 when N_Selected_Component =>
7780 and then Present (Etype (N))
7781 and then Is_Access_Type (Etype (N))
7785 return May_Be_Lvalue (P);
7788 -- For an indexed component or slice, the index or slice bounds is
7789 -- never an lvalue. The prefix is an lvalue if the indexed component
7790 -- or slice is an lvalue, except if it is an access type, where we
7791 -- have an implicit dereference.
7793 when N_Indexed_Component =>
7795 or else (Present (Etype (N)) and then Is_Access_Type (Etype (N)))
7799 return May_Be_Lvalue (P);
7802 -- Prefix of a reference is an lvalue if the reference is an lvalue
7805 return May_Be_Lvalue (P);
7807 -- Prefix of explicit dereference is never an lvalue
7809 when N_Explicit_Dereference =>
7812 -- Function call arguments are never lvalues
7814 when N_Function_Call =>
7817 -- Positional parameter for procedure, entry, or accept call
7819 when N_Procedure_Call_Statement |
7820 N_Entry_Call_Statement |
7829 Proc := Get_Subprogram_Entity (P);
7835 -- If we are not a list member, something is strange, so
7836 -- be conservative and return True.
7838 if not Is_List_Member (N) then
7842 -- We are going to find the right formal by stepping forward
7843 -- through the formals, as we step backwards in the actuals.
7845 Form := First_Formal (Proc);
7848 -- If no formal, something is weird, so be conservative
7860 return Ekind (Form) /= E_In_Parameter;
7863 -- Named parameter for procedure or accept call
7865 when N_Parameter_Association =>
7871 Proc := Get_Subprogram_Entity (Parent (P));
7877 -- Loop through formals to find the one that matches
7879 Form := First_Formal (Proc);
7881 -- If no matching formal, that's peculiar, some kind of
7882 -- previous error, so return True to be conservative.
7888 -- Else test for match
7890 if Chars (Form) = Chars (Selector_Name (P)) then
7891 return Ekind (Form) /= E_In_Parameter;
7898 -- Test for appearing in a conversion that itself appears in an
7899 -- lvalue context, since this should be an lvalue.
7901 when N_Type_Conversion =>
7902 return May_Be_Lvalue (P);
7904 -- Test for appearance in object renaming declaration
7906 when N_Object_Renaming_Declaration =>
7909 -- All other references are definitely not lvalues
7917 -----------------------
7918 -- Mark_Coextensions --
7919 -----------------------
7921 procedure Mark_Coextensions (Context_Nod : Node_Id; Root_Nod : Node_Id) is
7922 Is_Dynamic : Boolean;
7923 -- Indicates whether the context causes nested coextensions to be
7924 -- dynamic or static
7926 function Mark_Allocator (N : Node_Id) return Traverse_Result;
7927 -- Recognize an allocator node and label it as a dynamic coextension
7929 --------------------
7930 -- Mark_Allocator --
7931 --------------------
7933 function Mark_Allocator (N : Node_Id) return Traverse_Result is
7935 if Nkind (N) = N_Allocator then
7937 Set_Is_Dynamic_Coextension (N);
7939 -- If the allocator expression is potentially dynamic, it may
7940 -- be expanded out of order and require dynamic allocation
7941 -- anyway, so we treat the coextension itself as dynamic.
7942 -- Potential optimization ???
7944 elsif Nkind (Expression (N)) = N_Qualified_Expression
7945 and then Nkind (Expression (Expression (N))) = N_Op_Concat
7947 Set_Is_Dynamic_Coextension (N);
7950 Set_Is_Static_Coextension (N);
7957 procedure Mark_Allocators is new Traverse_Proc (Mark_Allocator);
7959 -- Start of processing Mark_Coextensions
7962 case Nkind (Context_Nod) is
7963 when N_Assignment_Statement |
7964 N_Simple_Return_Statement =>
7965 Is_Dynamic := Nkind (Expression (Context_Nod)) = N_Allocator;
7967 when N_Object_Declaration =>
7968 Is_Dynamic := Nkind (Root_Nod) = N_Allocator;
7970 -- This routine should not be called for constructs which may not
7971 -- contain coextensions.
7974 raise Program_Error;
7977 Mark_Allocators (Root_Nod);
7978 end Mark_Coextensions;
7980 ----------------------
7981 -- Needs_One_Actual --
7982 ----------------------
7984 function Needs_One_Actual (E : Entity_Id) return Boolean is
7988 if Ada_Version >= Ada_05
7989 and then Present (First_Formal (E))
7991 Formal := Next_Formal (First_Formal (E));
7992 while Present (Formal) loop
7993 if No (Default_Value (Formal)) then
7997 Next_Formal (Formal);
8005 end Needs_One_Actual;
8007 ------------------------
8008 -- New_Copy_List_Tree --
8009 ------------------------
8011 function New_Copy_List_Tree (List : List_Id) return List_Id is
8016 if List = No_List then
8023 while Present (E) loop
8024 Append (New_Copy_Tree (E), NL);
8030 end New_Copy_List_Tree;
8036 use Atree.Unchecked_Access;
8037 use Atree_Private_Part;
8039 -- Our approach here requires a two pass traversal of the tree. The
8040 -- first pass visits all nodes that eventually will be copied looking
8041 -- for defining Itypes. If any defining Itypes are found, then they are
8042 -- copied, and an entry is added to the replacement map. In the second
8043 -- phase, the tree is copied, using the replacement map to replace any
8044 -- Itype references within the copied tree.
8046 -- The following hash tables are used if the Map supplied has more
8047 -- than hash threshhold entries to speed up access to the map. If
8048 -- there are fewer entries, then the map is searched sequentially
8049 -- (because setting up a hash table for only a few entries takes
8050 -- more time than it saves.
8052 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
8053 -- Hash function used for hash operations
8059 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
8061 return Nat (E) mod (NCT_Header_Num'Last + 1);
8068 -- The hash table NCT_Assoc associates old entities in the table
8069 -- with their corresponding new entities (i.e. the pairs of entries
8070 -- presented in the original Map argument are Key-Element pairs).
8072 package NCT_Assoc is new Simple_HTable (
8073 Header_Num => NCT_Header_Num,
8074 Element => Entity_Id,
8075 No_Element => Empty,
8077 Hash => New_Copy_Hash,
8078 Equal => Types."=");
8080 ---------------------
8081 -- NCT_Itype_Assoc --
8082 ---------------------
8084 -- The hash table NCT_Itype_Assoc contains entries only for those
8085 -- old nodes which have a non-empty Associated_Node_For_Itype set.
8086 -- The key is the associated node, and the element is the new node
8087 -- itself (NOT the associated node for the new node).
8089 package NCT_Itype_Assoc is new Simple_HTable (
8090 Header_Num => NCT_Header_Num,
8091 Element => Entity_Id,
8092 No_Element => Empty,
8094 Hash => New_Copy_Hash,
8095 Equal => Types."=");
8097 -- Start of processing for New_Copy_Tree function
8099 function New_Copy_Tree
8101 Map : Elist_Id := No_Elist;
8102 New_Sloc : Source_Ptr := No_Location;
8103 New_Scope : Entity_Id := Empty) return Node_Id
8105 Actual_Map : Elist_Id := Map;
8106 -- This is the actual map for the copy. It is initialized with the
8107 -- given elements, and then enlarged as required for Itypes that are
8108 -- copied during the first phase of the copy operation. The visit
8109 -- procedures add elements to this map as Itypes are encountered.
8110 -- The reason we cannot use Map directly, is that it may well be
8111 -- (and normally is) initialized to No_Elist, and if we have mapped
8112 -- entities, we have to reset it to point to a real Elist.
8114 function Assoc (N : Node_Or_Entity_Id) return Node_Id;
8115 -- Called during second phase to map entities into their corresponding
8116 -- copies using Actual_Map. If the argument is not an entity, or is not
8117 -- in Actual_Map, then it is returned unchanged.
8119 procedure Build_NCT_Hash_Tables;
8120 -- Builds hash tables (number of elements >= threshold value)
8122 function Copy_Elist_With_Replacement
8123 (Old_Elist : Elist_Id) return Elist_Id;
8124 -- Called during second phase to copy element list doing replacements
8126 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
8127 -- Called during the second phase to process a copied Itype. The actual
8128 -- copy happened during the first phase (so that we could make the entry
8129 -- in the mapping), but we still have to deal with the descendents of
8130 -- the copied Itype and copy them where necessary.
8132 function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
8133 -- Called during second phase to copy list doing replacements
8135 function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
8136 -- Called during second phase to copy node doing replacements
8138 procedure Visit_Elist (E : Elist_Id);
8139 -- Called during first phase to visit all elements of an Elist
8141 procedure Visit_Field (F : Union_Id; N : Node_Id);
8142 -- Visit a single field, recursing to call Visit_Node or Visit_List
8143 -- if the field is a syntactic descendent of the current node (i.e.
8144 -- its parent is Node N).
8146 procedure Visit_Itype (Old_Itype : Entity_Id);
8147 -- Called during first phase to visit subsidiary fields of a defining
8148 -- Itype, and also create a copy and make an entry in the replacement
8149 -- map for the new copy.
8151 procedure Visit_List (L : List_Id);
8152 -- Called during first phase to visit all elements of a List
8154 procedure Visit_Node (N : Node_Or_Entity_Id);
8155 -- Called during first phase to visit a node and all its subtrees
8161 function Assoc (N : Node_Or_Entity_Id) return Node_Id is
8166 if not Has_Extension (N) or else No (Actual_Map) then
8169 elsif NCT_Hash_Tables_Used then
8170 Ent := NCT_Assoc.Get (Entity_Id (N));
8172 if Present (Ent) then
8178 -- No hash table used, do serial search
8181 E := First_Elmt (Actual_Map);
8182 while Present (E) loop
8183 if Node (E) = N then
8184 return Node (Next_Elmt (E));
8186 E := Next_Elmt (Next_Elmt (E));
8194 ---------------------------
8195 -- Build_NCT_Hash_Tables --
8196 ---------------------------
8198 procedure Build_NCT_Hash_Tables is
8202 if NCT_Hash_Table_Setup then
8204 NCT_Itype_Assoc.Reset;
8207 Elmt := First_Elmt (Actual_Map);
8208 while Present (Elmt) loop
8211 -- Get new entity, and associate old and new
8214 NCT_Assoc.Set (Ent, Node (Elmt));
8216 if Is_Type (Ent) then
8218 Anode : constant Entity_Id :=
8219 Associated_Node_For_Itype (Ent);
8222 if Present (Anode) then
8224 -- Enter a link between the associated node of the
8225 -- old Itype and the new Itype, for updating later
8226 -- when node is copied.
8228 NCT_Itype_Assoc.Set (Anode, Node (Elmt));
8236 NCT_Hash_Tables_Used := True;
8237 NCT_Hash_Table_Setup := True;
8238 end Build_NCT_Hash_Tables;
8240 ---------------------------------
8241 -- Copy_Elist_With_Replacement --
8242 ---------------------------------
8244 function Copy_Elist_With_Replacement
8245 (Old_Elist : Elist_Id) return Elist_Id
8248 New_Elist : Elist_Id;
8251 if No (Old_Elist) then
8255 New_Elist := New_Elmt_List;
8257 M := First_Elmt (Old_Elist);
8258 while Present (M) loop
8259 Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
8265 end Copy_Elist_With_Replacement;
8267 ---------------------------------
8268 -- Copy_Itype_With_Replacement --
8269 ---------------------------------
8271 -- This routine exactly parallels its phase one analog Visit_Itype,
8273 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
8275 -- Translate Next_Entity, Scope and Etype fields, in case they
8276 -- reference entities that have been mapped into copies.
8278 Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
8279 Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
8281 if Present (New_Scope) then
8282 Set_Scope (New_Itype, New_Scope);
8284 Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
8287 -- Copy referenced fields
8289 if Is_Discrete_Type (New_Itype) then
8290 Set_Scalar_Range (New_Itype,
8291 Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
8293 elsif Has_Discriminants (Base_Type (New_Itype)) then
8294 Set_Discriminant_Constraint (New_Itype,
8295 Copy_Elist_With_Replacement
8296 (Discriminant_Constraint (New_Itype)));
8298 elsif Is_Array_Type (New_Itype) then
8299 if Present (First_Index (New_Itype)) then
8300 Set_First_Index (New_Itype,
8301 First (Copy_List_With_Replacement
8302 (List_Containing (First_Index (New_Itype)))));
8305 if Is_Packed (New_Itype) then
8306 Set_Packed_Array_Type (New_Itype,
8307 Copy_Node_With_Replacement
8308 (Packed_Array_Type (New_Itype)));
8311 end Copy_Itype_With_Replacement;
8313 --------------------------------
8314 -- Copy_List_With_Replacement --
8315 --------------------------------
8317 function Copy_List_With_Replacement
8318 (Old_List : List_Id) return List_Id
8324 if Old_List = No_List then
8328 New_List := Empty_List;
8330 E := First (Old_List);
8331 while Present (E) loop
8332 Append (Copy_Node_With_Replacement (E), New_List);
8338 end Copy_List_With_Replacement;
8340 --------------------------------
8341 -- Copy_Node_With_Replacement --
8342 --------------------------------
8344 function Copy_Node_With_Replacement
8345 (Old_Node : Node_Id) return Node_Id
8349 procedure Adjust_Named_Associations
8350 (Old_Node : Node_Id;
8351 New_Node : Node_Id);
8352 -- If a call node has named associations, these are chained through
8353 -- the First_Named_Actual, Next_Named_Actual links. These must be
8354 -- propagated separately to the new parameter list, because these
8355 -- are not syntactic fields.
8357 function Copy_Field_With_Replacement
8358 (Field : Union_Id) return Union_Id;
8359 -- Given Field, which is a field of Old_Node, return a copy of it
8360 -- if it is a syntactic field (i.e. its parent is Node), setting
8361 -- the parent of the copy to poit to New_Node. Otherwise returns
8362 -- the field (possibly mapped if it is an entity).
8364 -------------------------------
8365 -- Adjust_Named_Associations --
8366 -------------------------------
8368 procedure Adjust_Named_Associations
8369 (Old_Node : Node_Id;
8379 Old_E := First (Parameter_Associations (Old_Node));
8380 New_E := First (Parameter_Associations (New_Node));
8381 while Present (Old_E) loop
8382 if Nkind (Old_E) = N_Parameter_Association
8383 and then Present (Next_Named_Actual (Old_E))
8385 if First_Named_Actual (Old_Node)
8386 = Explicit_Actual_Parameter (Old_E)
8388 Set_First_Named_Actual
8389 (New_Node, Explicit_Actual_Parameter (New_E));
8392 -- Now scan parameter list from the beginning,to locate
8393 -- next named actual, which can be out of order.
8395 Old_Next := First (Parameter_Associations (Old_Node));
8396 New_Next := First (Parameter_Associations (New_Node));
8398 while Nkind (Old_Next) /= N_Parameter_Association
8399 or else Explicit_Actual_Parameter (Old_Next)
8400 /= Next_Named_Actual (Old_E)
8406 Set_Next_Named_Actual
8407 (New_E, Explicit_Actual_Parameter (New_Next));
8413 end Adjust_Named_Associations;
8415 ---------------------------------
8416 -- Copy_Field_With_Replacement --
8417 ---------------------------------
8419 function Copy_Field_With_Replacement
8420 (Field : Union_Id) return Union_Id
8423 if Field = Union_Id (Empty) then
8426 elsif Field in Node_Range then
8428 Old_N : constant Node_Id := Node_Id (Field);
8432 -- If syntactic field, as indicated by the parent pointer
8433 -- being set, then copy the referenced node recursively.
8435 if Parent (Old_N) = Old_Node then
8436 New_N := Copy_Node_With_Replacement (Old_N);
8438 if New_N /= Old_N then
8439 Set_Parent (New_N, New_Node);
8442 -- For semantic fields, update possible entity reference
8443 -- from the replacement map.
8446 New_N := Assoc (Old_N);
8449 return Union_Id (New_N);
8452 elsif Field in List_Range then
8454 Old_L : constant List_Id := List_Id (Field);
8458 -- If syntactic field, as indicated by the parent pointer,
8459 -- then recursively copy the entire referenced list.
8461 if Parent (Old_L) = Old_Node then
8462 New_L := Copy_List_With_Replacement (Old_L);
8463 Set_Parent (New_L, New_Node);
8465 -- For semantic list, just returned unchanged
8471 return Union_Id (New_L);
8474 -- Anything other than a list or a node is returned unchanged
8479 end Copy_Field_With_Replacement;
8481 -- Start of processing for Copy_Node_With_Replacement
8484 if Old_Node <= Empty_Or_Error then
8487 elsif Has_Extension (Old_Node) then
8488 return Assoc (Old_Node);
8491 New_Node := New_Copy (Old_Node);
8493 -- If the node we are copying is the associated node of a
8494 -- previously copied Itype, then adjust the associated node
8495 -- of the copy of that Itype accordingly.
8497 if Present (Actual_Map) then
8503 -- Case of hash table used
8505 if NCT_Hash_Tables_Used then
8506 Ent := NCT_Itype_Assoc.Get (Old_Node);
8508 if Present (Ent) then
8509 Set_Associated_Node_For_Itype (Ent, New_Node);
8512 -- Case of no hash table used
8515 E := First_Elmt (Actual_Map);
8516 while Present (E) loop
8517 if Is_Itype (Node (E))
8519 Old_Node = Associated_Node_For_Itype (Node (E))
8521 Set_Associated_Node_For_Itype
8522 (Node (Next_Elmt (E)), New_Node);
8525 E := Next_Elmt (Next_Elmt (E));
8531 -- Recursively copy descendents
8534 (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
8536 (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
8538 (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
8540 (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
8542 (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
8544 -- Adjust Sloc of new node if necessary
8546 if New_Sloc /= No_Location then
8547 Set_Sloc (New_Node, New_Sloc);
8549 -- If we adjust the Sloc, then we are essentially making
8550 -- a completely new node, so the Comes_From_Source flag
8551 -- should be reset to the proper default value.
8553 Nodes.Table (New_Node).Comes_From_Source :=
8554 Default_Node.Comes_From_Source;
8557 -- If the node is call and has named associations,
8558 -- set the corresponding links in the copy.
8560 if (Nkind (Old_Node) = N_Function_Call
8561 or else Nkind (Old_Node) = N_Entry_Call_Statement
8563 Nkind (Old_Node) = N_Procedure_Call_Statement)
8564 and then Present (First_Named_Actual (Old_Node))
8566 Adjust_Named_Associations (Old_Node, New_Node);
8569 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
8570 -- The replacement mechanism applies to entities, and is not used
8571 -- here. Eventually we may need a more general graph-copying
8572 -- routine. For now, do a sequential search to find desired node.
8574 if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
8575 and then Present (First_Real_Statement (Old_Node))
8578 Old_F : constant Node_Id := First_Real_Statement (Old_Node);
8582 N1 := First (Statements (Old_Node));
8583 N2 := First (Statements (New_Node));
8585 while N1 /= Old_F loop
8590 Set_First_Real_Statement (New_Node, N2);
8595 -- All done, return copied node
8598 end Copy_Node_With_Replacement;
8604 procedure Visit_Elist (E : Elist_Id) is
8608 Elmt := First_Elmt (E);
8610 while Elmt /= No_Elmt loop
8611 Visit_Node (Node (Elmt));
8621 procedure Visit_Field (F : Union_Id; N : Node_Id) is
8623 if F = Union_Id (Empty) then
8626 elsif F in Node_Range then
8628 -- Copy node if it is syntactic, i.e. its parent pointer is
8629 -- set to point to the field that referenced it (certain
8630 -- Itypes will also meet this criterion, which is fine, since
8631 -- these are clearly Itypes that do need to be copied, since
8632 -- we are copying their parent.)
8634 if Parent (Node_Id (F)) = N then
8635 Visit_Node (Node_Id (F));
8638 -- Another case, if we are pointing to an Itype, then we want
8639 -- to copy it if its associated node is somewhere in the tree
8642 -- Note: the exclusion of self-referential copies is just an
8643 -- optimization, since the search of the already copied list
8644 -- would catch it, but it is a common case (Etype pointing
8645 -- to itself for an Itype that is a base type).
8647 elsif Has_Extension (Node_Id (F))
8648 and then Is_Itype (Entity_Id (F))
8649 and then Node_Id (F) /= N
8655 P := Associated_Node_For_Itype (Node_Id (F));
8656 while Present (P) loop
8658 Visit_Node (Node_Id (F));
8665 -- An Itype whose parent is not being copied definitely
8666 -- should NOT be copied, since it does not belong in any
8667 -- sense to the copied subtree.
8673 elsif F in List_Range
8674 and then Parent (List_Id (F)) = N
8676 Visit_List (List_Id (F));
8685 procedure Visit_Itype (Old_Itype : Entity_Id) is
8686 New_Itype : Entity_Id;
8691 -- Itypes that describe the designated type of access to subprograms
8692 -- have the structure of subprogram declarations, with signatures,
8693 -- etc. Either we duplicate the signatures completely, or choose to
8694 -- share such itypes, which is fine because their elaboration will
8695 -- have no side effects.
8697 if Ekind (Old_Itype) = E_Subprogram_Type then
8701 New_Itype := New_Copy (Old_Itype);
8703 -- The new Itype has all the attributes of the old one, and
8704 -- we just copy the contents of the entity. However, the back-end
8705 -- needs different names for debugging purposes, so we create a
8706 -- new internal name for it in all cases.
8708 Set_Chars (New_Itype, New_Internal_Name ('T'));
8710 -- If our associated node is an entity that has already been copied,
8711 -- then set the associated node of the copy to point to the right
8712 -- copy. If we have copied an Itype that is itself the associated
8713 -- node of some previously copied Itype, then we set the right
8714 -- pointer in the other direction.
8716 if Present (Actual_Map) then
8718 -- Case of hash tables used
8720 if NCT_Hash_Tables_Used then
8722 Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
8724 if Present (Ent) then
8725 Set_Associated_Node_For_Itype (New_Itype, Ent);
8728 Ent := NCT_Itype_Assoc.Get (Old_Itype);
8729 if Present (Ent) then
8730 Set_Associated_Node_For_Itype (Ent, New_Itype);
8732 -- If the hash table has no association for this Itype and
8733 -- its associated node, enter one now.
8737 (Associated_Node_For_Itype (Old_Itype), New_Itype);
8740 -- Case of hash tables not used
8743 E := First_Elmt (Actual_Map);
8744 while Present (E) loop
8745 if Associated_Node_For_Itype (Old_Itype) = Node (E) then
8746 Set_Associated_Node_For_Itype
8747 (New_Itype, Node (Next_Elmt (E)));
8750 if Is_Type (Node (E))
8752 Old_Itype = Associated_Node_For_Itype (Node (E))
8754 Set_Associated_Node_For_Itype
8755 (Node (Next_Elmt (E)), New_Itype);
8758 E := Next_Elmt (Next_Elmt (E));
8763 if Present (Freeze_Node (New_Itype)) then
8764 Set_Is_Frozen (New_Itype, False);
8765 Set_Freeze_Node (New_Itype, Empty);
8768 -- Add new association to map
8770 if No (Actual_Map) then
8771 Actual_Map := New_Elmt_List;
8774 Append_Elmt (Old_Itype, Actual_Map);
8775 Append_Elmt (New_Itype, Actual_Map);
8777 if NCT_Hash_Tables_Used then
8778 NCT_Assoc.Set (Old_Itype, New_Itype);
8781 NCT_Table_Entries := NCT_Table_Entries + 1;
8783 if NCT_Table_Entries > NCT_Hash_Threshhold then
8784 Build_NCT_Hash_Tables;
8788 -- If a record subtype is simply copied, the entity list will be
8789 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
8791 if Ekind_In (Old_Itype, E_Record_Subtype, E_Class_Wide_Subtype) then
8792 Set_Cloned_Subtype (New_Itype, Old_Itype);
8795 -- Visit descendents that eventually get copied
8797 Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
8799 if Is_Discrete_Type (Old_Itype) then
8800 Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
8802 elsif Has_Discriminants (Base_Type (Old_Itype)) then
8803 -- ??? This should involve call to Visit_Field
8804 Visit_Elist (Discriminant_Constraint (Old_Itype));
8806 elsif Is_Array_Type (Old_Itype) then
8807 if Present (First_Index (Old_Itype)) then
8808 Visit_Field (Union_Id (List_Containing
8809 (First_Index (Old_Itype))),
8813 if Is_Packed (Old_Itype) then
8814 Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)),
8824 procedure Visit_List (L : List_Id) is
8827 if L /= No_List then
8830 while Present (N) loop
8841 procedure Visit_Node (N : Node_Or_Entity_Id) is
8843 -- Start of processing for Visit_Node
8846 -- Handle case of an Itype, which must be copied
8848 if Has_Extension (N)
8849 and then Is_Itype (N)
8851 -- Nothing to do if already in the list. This can happen with an
8852 -- Itype entity that appears more than once in the tree.
8853 -- Note that we do not want to visit descendents in this case.
8855 -- Test for already in list when hash table is used
8857 if NCT_Hash_Tables_Used then
8858 if Present (NCT_Assoc.Get (Entity_Id (N))) then
8862 -- Test for already in list when hash table not used
8868 if Present (Actual_Map) then
8869 E := First_Elmt (Actual_Map);
8870 while Present (E) loop
8871 if Node (E) = N then
8874 E := Next_Elmt (Next_Elmt (E));
8884 -- Visit descendents
8886 Visit_Field (Field1 (N), N);
8887 Visit_Field (Field2 (N), N);
8888 Visit_Field (Field3 (N), N);
8889 Visit_Field (Field4 (N), N);
8890 Visit_Field (Field5 (N), N);
8893 -- Start of processing for New_Copy_Tree
8898 -- See if we should use hash table
8900 if No (Actual_Map) then
8901 NCT_Hash_Tables_Used := False;
8908 NCT_Table_Entries := 0;
8910 Elmt := First_Elmt (Actual_Map);
8911 while Present (Elmt) loop
8912 NCT_Table_Entries := NCT_Table_Entries + 1;
8917 if NCT_Table_Entries > NCT_Hash_Threshhold then
8918 Build_NCT_Hash_Tables;
8920 NCT_Hash_Tables_Used := False;
8925 -- Hash table set up if required, now start phase one by visiting
8926 -- top node (we will recursively visit the descendents).
8928 Visit_Node (Source);
8930 -- Now the second phase of the copy can start. First we process
8931 -- all the mapped entities, copying their descendents.
8933 if Present (Actual_Map) then
8936 New_Itype : Entity_Id;
8938 Elmt := First_Elmt (Actual_Map);
8939 while Present (Elmt) loop
8941 New_Itype := Node (Elmt);
8942 Copy_Itype_With_Replacement (New_Itype);
8948 -- Now we can copy the actual tree
8950 return Copy_Node_With_Replacement (Source);
8953 -------------------------
8954 -- New_External_Entity --
8955 -------------------------
8957 function New_External_Entity
8958 (Kind : Entity_Kind;
8959 Scope_Id : Entity_Id;
8960 Sloc_Value : Source_Ptr;
8961 Related_Id : Entity_Id;
8963 Suffix_Index : Nat := 0;
8964 Prefix : Character := ' ') return Entity_Id
8966 N : constant Entity_Id :=
8967 Make_Defining_Identifier (Sloc_Value,
8969 (Chars (Related_Id), Suffix, Suffix_Index, Prefix));
8972 Set_Ekind (N, Kind);
8973 Set_Is_Internal (N, True);
8974 Append_Entity (N, Scope_Id);
8975 Set_Public_Status (N);
8977 if Kind in Type_Kind then
8978 Init_Size_Align (N);
8982 end New_External_Entity;
8984 -------------------------
8985 -- New_Internal_Entity --
8986 -------------------------
8988 function New_Internal_Entity
8989 (Kind : Entity_Kind;
8990 Scope_Id : Entity_Id;
8991 Sloc_Value : Source_Ptr;
8992 Id_Char : Character) return Entity_Id
8994 N : constant Entity_Id := Make_Temporary (Sloc_Value, Id_Char);
8997 Set_Ekind (N, Kind);
8998 Set_Is_Internal (N, True);
8999 Append_Entity (N, Scope_Id);
9001 if Kind in Type_Kind then
9002 Init_Size_Align (N);
9006 end New_Internal_Entity;
9012 function Next_Actual (Actual_Id : Node_Id) return Node_Id is
9016 -- If we are pointing at a positional parameter, it is a member of a
9017 -- node list (the list of parameters), and the next parameter is the
9018 -- next node on the list, unless we hit a parameter association, then
9019 -- we shift to using the chain whose head is the First_Named_Actual in
9020 -- the parent, and then is threaded using the Next_Named_Actual of the
9021 -- Parameter_Association. All this fiddling is because the original node
9022 -- list is in the textual call order, and what we need is the
9023 -- declaration order.
9025 if Is_List_Member (Actual_Id) then
9026 N := Next (Actual_Id);
9028 if Nkind (N) = N_Parameter_Association then
9029 return First_Named_Actual (Parent (Actual_Id));
9035 return Next_Named_Actual (Parent (Actual_Id));
9039 procedure Next_Actual (Actual_Id : in out Node_Id) is
9041 Actual_Id := Next_Actual (Actual_Id);
9044 -----------------------
9045 -- Normalize_Actuals --
9046 -----------------------
9048 -- Chain actuals according to formals of subprogram. If there are no named
9049 -- associations, the chain is simply the list of Parameter Associations,
9050 -- since the order is the same as the declaration order. If there are named
9051 -- associations, then the First_Named_Actual field in the N_Function_Call
9052 -- or N_Procedure_Call_Statement node points to the Parameter_Association
9053 -- node for the parameter that comes first in declaration order. The
9054 -- remaining named parameters are then chained in declaration order using
9055 -- Next_Named_Actual.
9057 -- This routine also verifies that the number of actuals is compatible with
9058 -- the number and default values of formals, but performs no type checking
9059 -- (type checking is done by the caller).
9061 -- If the matching succeeds, Success is set to True and the caller proceeds
9062 -- with type-checking. If the match is unsuccessful, then Success is set to
9063 -- False, and the caller attempts a different interpretation, if there is
9066 -- If the flag Report is on, the call is not overloaded, and a failure to
9067 -- match can be reported here, rather than in the caller.
9069 procedure Normalize_Actuals
9073 Success : out Boolean)
9075 Actuals : constant List_Id := Parameter_Associations (N);
9076 Actual : Node_Id := Empty;
9078 Last : Node_Id := Empty;
9079 First_Named : Node_Id := Empty;
9082 Formals_To_Match : Integer := 0;
9083 Actuals_To_Match : Integer := 0;
9085 procedure Chain (A : Node_Id);
9086 -- Add named actual at the proper place in the list, using the
9087 -- Next_Named_Actual link.
9089 function Reporting return Boolean;
9090 -- Determines if an error is to be reported. To report an error, we
9091 -- need Report to be True, and also we do not report errors caused
9092 -- by calls to init procs that occur within other init procs. Such
9093 -- errors must always be cascaded errors, since if all the types are
9094 -- declared correctly, the compiler will certainly build decent calls!
9100 procedure Chain (A : Node_Id) is
9104 -- Call node points to first actual in list
9106 Set_First_Named_Actual (N, Explicit_Actual_Parameter (A));
9109 Set_Next_Named_Actual (Last, Explicit_Actual_Parameter (A));
9113 Set_Next_Named_Actual (Last, Empty);
9120 function Reporting return Boolean is
9125 elsif not Within_Init_Proc then
9128 elsif Is_Init_Proc (Entity (Name (N))) then
9136 -- Start of processing for Normalize_Actuals
9139 if Is_Access_Type (S) then
9141 -- The name in the call is a function call that returns an access
9142 -- to subprogram. The designated type has the list of formals.
9144 Formal := First_Formal (Designated_Type (S));
9146 Formal := First_Formal (S);
9149 while Present (Formal) loop
9150 Formals_To_Match := Formals_To_Match + 1;
9151 Next_Formal (Formal);
9154 -- Find if there is a named association, and verify that no positional
9155 -- associations appear after named ones.
9157 if Present (Actuals) then
9158 Actual := First (Actuals);
9161 while Present (Actual)
9162 and then Nkind (Actual) /= N_Parameter_Association
9164 Actuals_To_Match := Actuals_To_Match + 1;
9168 if No (Actual) and Actuals_To_Match = Formals_To_Match then
9170 -- Most common case: positional notation, no defaults
9175 elsif Actuals_To_Match > Formals_To_Match then
9177 -- Too many actuals: will not work
9180 if Is_Entity_Name (Name (N)) then
9181 Error_Msg_N ("too many arguments in call to&", Name (N));
9183 Error_Msg_N ("too many arguments in call", N);
9191 First_Named := Actual;
9193 while Present (Actual) loop
9194 if Nkind (Actual) /= N_Parameter_Association then
9196 ("positional parameters not allowed after named ones", Actual);
9201 Actuals_To_Match := Actuals_To_Match + 1;
9207 if Present (Actuals) then
9208 Actual := First (Actuals);
9211 Formal := First_Formal (S);
9212 while Present (Formal) loop
9214 -- Match the formals in order. If the corresponding actual is
9215 -- positional, nothing to do. Else scan the list of named actuals
9216 -- to find the one with the right name.
9219 and then Nkind (Actual) /= N_Parameter_Association
9222 Actuals_To_Match := Actuals_To_Match - 1;
9223 Formals_To_Match := Formals_To_Match - 1;
9226 -- For named parameters, search the list of actuals to find
9227 -- one that matches the next formal name.
9229 Actual := First_Named;
9231 while Present (Actual) loop
9232 if Chars (Selector_Name (Actual)) = Chars (Formal) then
9235 Actuals_To_Match := Actuals_To_Match - 1;
9236 Formals_To_Match := Formals_To_Match - 1;
9244 if Ekind (Formal) /= E_In_Parameter
9245 or else No (Default_Value (Formal))
9248 if (Comes_From_Source (S)
9249 or else Sloc (S) = Standard_Location)
9250 and then Is_Overloadable (S)
9254 (Nkind (Parent (N)) = N_Procedure_Call_Statement
9256 (Nkind (Parent (N)) = N_Function_Call
9258 Nkind (Parent (N)) = N_Parameter_Association))
9259 and then Ekind (S) /= E_Function
9261 Set_Etype (N, Etype (S));
9263 Error_Msg_Name_1 := Chars (S);
9264 Error_Msg_Sloc := Sloc (S);
9266 ("missing argument for parameter & " &
9267 "in call to % declared #", N, Formal);
9270 elsif Is_Overloadable (S) then
9271 Error_Msg_Name_1 := Chars (S);
9273 -- Point to type derivation that generated the
9276 Error_Msg_Sloc := Sloc (Parent (S));
9279 ("missing argument for parameter & " &
9280 "in call to % (inherited) #", N, Formal);
9284 ("missing argument for parameter &", N, Formal);
9292 Formals_To_Match := Formals_To_Match - 1;
9297 Next_Formal (Formal);
9300 if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
9307 -- Find some superfluous named actual that did not get
9308 -- attached to the list of associations.
9310 Actual := First (Actuals);
9311 while Present (Actual) loop
9312 if Nkind (Actual) = N_Parameter_Association
9313 and then Actual /= Last
9314 and then No (Next_Named_Actual (Actual))
9316 Error_Msg_N ("unmatched actual & in call",
9317 Selector_Name (Actual));
9328 end Normalize_Actuals;
9330 --------------------------------
9331 -- Note_Possible_Modification --
9332 --------------------------------
9334 procedure Note_Possible_Modification (N : Node_Id; Sure : Boolean) is
9335 Modification_Comes_From_Source : constant Boolean :=
9336 Comes_From_Source (Parent (N));
9342 -- Loop to find referenced entity, if there is one
9349 if Is_Entity_Name (Exp) then
9350 Ent := Entity (Exp);
9352 -- If the entity is missing, it is an undeclared identifier,
9353 -- and there is nothing to annotate.
9359 elsif Nkind (Exp) = N_Explicit_Dereference then
9361 P : constant Node_Id := Prefix (Exp);
9364 if Nkind (P) = N_Selected_Component
9366 Entry_Formal (Entity (Selector_Name (P))))
9368 -- Case of a reference to an entry formal
9370 Ent := Entry_Formal (Entity (Selector_Name (P)));
9372 elsif Nkind (P) = N_Identifier
9373 and then Nkind (Parent (Entity (P))) = N_Object_Declaration
9374 and then Present (Expression (Parent (Entity (P))))
9375 and then Nkind (Expression (Parent (Entity (P))))
9378 -- Case of a reference to a value on which side effects have
9381 Exp := Prefix (Expression (Parent (Entity (P))));
9390 elsif Nkind (Exp) = N_Type_Conversion
9391 or else Nkind (Exp) = N_Unchecked_Type_Conversion
9393 Exp := Expression (Exp);
9396 elsif Nkind (Exp) = N_Slice
9397 or else Nkind (Exp) = N_Indexed_Component
9398 or else Nkind (Exp) = N_Selected_Component
9400 Exp := Prefix (Exp);
9407 -- Now look for entity being referenced
9409 if Present (Ent) then
9410 if Is_Object (Ent) then
9411 if Comes_From_Source (Exp)
9412 or else Modification_Comes_From_Source
9414 if Has_Pragma_Unmodified (Ent) then
9415 Error_Msg_NE ("?pragma Unmodified given for &!", N, Ent);
9418 Set_Never_Set_In_Source (Ent, False);
9421 Set_Is_True_Constant (Ent, False);
9422 Set_Current_Value (Ent, Empty);
9423 Set_Is_Known_Null (Ent, False);
9425 if not Can_Never_Be_Null (Ent) then
9426 Set_Is_Known_Non_Null (Ent, False);
9429 -- Follow renaming chain
9431 if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
9432 and then Present (Renamed_Object (Ent))
9434 Exp := Renamed_Object (Ent);
9438 -- Generate a reference only if the assignment comes from
9439 -- source. This excludes, for example, calls to a dispatching
9440 -- assignment operation when the left-hand side is tagged.
9442 if Modification_Comes_From_Source then
9443 Generate_Reference (Ent, Exp, 'm');
9446 Check_Nested_Access (Ent);
9451 -- If we are sure this is a modification from source, and we know
9452 -- this modifies a constant, then give an appropriate warning.
9454 if Overlays_Constant (Ent)
9455 and then Modification_Comes_From_Source
9459 A : constant Node_Id := Address_Clause (Ent);
9463 Exp : constant Node_Id := Expression (A);
9465 if Nkind (Exp) = N_Attribute_Reference
9466 and then Attribute_Name (Exp) = Name_Address
9467 and then Is_Entity_Name (Prefix (Exp))
9469 Error_Msg_Sloc := Sloc (A);
9471 ("constant& may be modified via address clause#?",
9472 N, Entity (Prefix (Exp)));
9482 end Note_Possible_Modification;
9484 -------------------------
9485 -- Object_Access_Level --
9486 -------------------------
9488 function Object_Access_Level (Obj : Node_Id) return Uint is
9491 -- Returns the static accessibility level of the view denoted by Obj. Note
9492 -- that the value returned is the result of a call to Scope_Depth. Only
9493 -- scope depths associated with dynamic scopes can actually be returned.
9494 -- Since only relative levels matter for accessibility checking, the fact
9495 -- that the distance between successive levels of accessibility is not
9496 -- always one is immaterial (invariant: if level(E2) is deeper than
9497 -- level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
9499 function Reference_To (Obj : Node_Id) return Node_Id;
9500 -- An explicit dereference is created when removing side-effects from
9501 -- expressions for constraint checking purposes. In this case a local
9502 -- access type is created for it. The correct access level is that of
9503 -- the original source node. We detect this case by noting that the
9504 -- prefix of the dereference is created by an object declaration whose
9505 -- initial expression is a reference.
9511 function Reference_To (Obj : Node_Id) return Node_Id is
9512 Pref : constant Node_Id := Prefix (Obj);
9514 if Is_Entity_Name (Pref)
9515 and then Nkind (Parent (Entity (Pref))) = N_Object_Declaration
9516 and then Present (Expression (Parent (Entity (Pref))))
9517 and then Nkind (Expression (Parent (Entity (Pref)))) = N_Reference
9519 return (Prefix (Expression (Parent (Entity (Pref)))));
9525 -- Start of processing for Object_Access_Level
9528 if Is_Entity_Name (Obj) then
9531 if Is_Prival (E) then
9532 E := Prival_Link (E);
9535 -- If E is a type then it denotes a current instance. For this case
9536 -- we add one to the normal accessibility level of the type to ensure
9537 -- that current instances are treated as always being deeper than
9538 -- than the level of any visible named access type (see 3.10.2(21)).
9541 return Type_Access_Level (E) + 1;
9543 elsif Present (Renamed_Object (E)) then
9544 return Object_Access_Level (Renamed_Object (E));
9546 -- Similarly, if E is a component of the current instance of a
9547 -- protected type, any instance of it is assumed to be at a deeper
9548 -- level than the type. For a protected object (whose type is an
9549 -- anonymous protected type) its components are at the same level
9550 -- as the type itself.
9552 elsif not Is_Overloadable (E)
9553 and then Ekind (Scope (E)) = E_Protected_Type
9554 and then Comes_From_Source (Scope (E))
9556 return Type_Access_Level (Scope (E)) + 1;
9559 return Scope_Depth (Enclosing_Dynamic_Scope (E));
9562 elsif Nkind (Obj) = N_Selected_Component then
9563 if Is_Access_Type (Etype (Prefix (Obj))) then
9564 return Type_Access_Level (Etype (Prefix (Obj)));
9566 return Object_Access_Level (Prefix (Obj));
9569 elsif Nkind (Obj) = N_Indexed_Component then
9570 if Is_Access_Type (Etype (Prefix (Obj))) then
9571 return Type_Access_Level (Etype (Prefix (Obj)));
9573 return Object_Access_Level (Prefix (Obj));
9576 elsif Nkind (Obj) = N_Explicit_Dereference then
9578 -- If the prefix is a selected access discriminant then we make a
9579 -- recursive call on the prefix, which will in turn check the level
9580 -- of the prefix object of the selected discriminant.
9582 if Nkind (Prefix (Obj)) = N_Selected_Component
9583 and then Ekind (Etype (Prefix (Obj))) = E_Anonymous_Access_Type
9585 Ekind (Entity (Selector_Name (Prefix (Obj)))) = E_Discriminant
9587 return Object_Access_Level (Prefix (Obj));
9589 elsif not (Comes_From_Source (Obj)) then
9591 Ref : constant Node_Id := Reference_To (Obj);
9593 if Present (Ref) then
9594 return Object_Access_Level (Ref);
9596 return Type_Access_Level (Etype (Prefix (Obj)));
9601 return Type_Access_Level (Etype (Prefix (Obj)));
9604 elsif Nkind (Obj) = N_Type_Conversion
9605 or else Nkind (Obj) = N_Unchecked_Type_Conversion
9607 return Object_Access_Level (Expression (Obj));
9609 elsif Nkind (Obj) = N_Function_Call then
9611 -- Function results are objects, so we get either the access level of
9612 -- the function or, in the case of an indirect call, the level of the
9613 -- access-to-subprogram type. (This code is used for Ada 95, but it
9614 -- looks wrong, because it seems that we should be checking the level
9615 -- of the call itself, even for Ada 95. However, using the Ada 2005
9616 -- version of the code causes regressions in several tests that are
9617 -- compiled with -gnat95. ???)
9619 if Ada_Version < Ada_05 then
9620 if Is_Entity_Name (Name (Obj)) then
9621 return Subprogram_Access_Level (Entity (Name (Obj)));
9623 return Type_Access_Level (Etype (Prefix (Name (Obj))));
9626 -- For Ada 2005, the level of the result object of a function call is
9627 -- defined to be the level of the call's innermost enclosing master.
9628 -- We determine that by querying the depth of the innermost enclosing
9632 Return_Master_Scope_Depth_Of_Call : declare
9634 function Innermost_Master_Scope_Depth
9635 (N : Node_Id) return Uint;
9636 -- Returns the scope depth of the given node's innermost
9637 -- enclosing dynamic scope (effectively the accessibility
9638 -- level of the innermost enclosing master).
9640 ----------------------------------
9641 -- Innermost_Master_Scope_Depth --
9642 ----------------------------------
9644 function Innermost_Master_Scope_Depth
9645 (N : Node_Id) return Uint
9647 Node_Par : Node_Id := Parent (N);
9650 -- Locate the nearest enclosing node (by traversing Parents)
9651 -- that Defining_Entity can be applied to, and return the
9652 -- depth of that entity's nearest enclosing dynamic scope.
9654 while Present (Node_Par) loop
9655 case Nkind (Node_Par) is
9656 when N_Component_Declaration |
9657 N_Entry_Declaration |
9658 N_Formal_Object_Declaration |
9659 N_Formal_Type_Declaration |
9660 N_Full_Type_Declaration |
9661 N_Incomplete_Type_Declaration |
9662 N_Loop_Parameter_Specification |
9663 N_Object_Declaration |
9664 N_Protected_Type_Declaration |
9665 N_Private_Extension_Declaration |
9666 N_Private_Type_Declaration |
9667 N_Subtype_Declaration |
9668 N_Function_Specification |
9669 N_Procedure_Specification |
9670 N_Task_Type_Declaration |
9672 N_Generic_Instantiation |
9674 N_Implicit_Label_Declaration |
9675 N_Package_Declaration |
9676 N_Single_Task_Declaration |
9677 N_Subprogram_Declaration |
9678 N_Generic_Declaration |
9679 N_Renaming_Declaration |
9681 N_Formal_Subprogram_Declaration |
9682 N_Abstract_Subprogram_Declaration |
9684 N_Exception_Declaration |
9685 N_Formal_Package_Declaration |
9686 N_Number_Declaration |
9687 N_Package_Specification |
9688 N_Parameter_Specification |
9689 N_Single_Protected_Declaration |
9693 (Nearest_Dynamic_Scope
9694 (Defining_Entity (Node_Par)));
9700 Node_Par := Parent (Node_Par);
9703 pragma Assert (False);
9705 -- Should never reach the following return
9707 return Scope_Depth (Current_Scope) + 1;
9708 end Innermost_Master_Scope_Depth;
9710 -- Start of processing for Return_Master_Scope_Depth_Of_Call
9713 return Innermost_Master_Scope_Depth (Obj);
9714 end Return_Master_Scope_Depth_Of_Call;
9717 -- For convenience we handle qualified expressions, even though
9718 -- they aren't technically object names.
9720 elsif Nkind (Obj) = N_Qualified_Expression then
9721 return Object_Access_Level (Expression (Obj));
9723 -- Otherwise return the scope level of Standard.
9724 -- (If there are cases that fall through
9725 -- to this point they will be treated as
9726 -- having global accessibility for now. ???)
9729 return Scope_Depth (Standard_Standard);
9731 end Object_Access_Level;
9733 -----------------------
9734 -- Private_Component --
9735 -----------------------
9737 function Private_Component (Type_Id : Entity_Id) return Entity_Id is
9738 Ancestor : constant Entity_Id := Base_Type (Type_Id);
9740 function Trace_Components
9742 Check : Boolean) return Entity_Id;
9743 -- Recursive function that does the work, and checks against circular
9744 -- definition for each subcomponent type.
9746 ----------------------
9747 -- Trace_Components --
9748 ----------------------
9750 function Trace_Components
9752 Check : Boolean) return Entity_Id
9754 Btype : constant Entity_Id := Base_Type (T);
9755 Component : Entity_Id;
9757 Candidate : Entity_Id := Empty;
9760 if Check and then Btype = Ancestor then
9761 Error_Msg_N ("circular type definition", Type_Id);
9765 if Is_Private_Type (Btype)
9766 and then not Is_Generic_Type (Btype)
9768 if Present (Full_View (Btype))
9769 and then Is_Record_Type (Full_View (Btype))
9770 and then not Is_Frozen (Btype)
9772 -- To indicate that the ancestor depends on a private type, the
9773 -- current Btype is sufficient. However, to check for circular
9774 -- definition we must recurse on the full view.
9776 Candidate := Trace_Components (Full_View (Btype), True);
9778 if Candidate = Any_Type then
9788 elsif Is_Array_Type (Btype) then
9789 return Trace_Components (Component_Type (Btype), True);
9791 elsif Is_Record_Type (Btype) then
9792 Component := First_Entity (Btype);
9793 while Present (Component) loop
9795 -- Skip anonymous types generated by constrained components
9797 if not Is_Type (Component) then
9798 P := Trace_Components (Etype (Component), True);
9801 if P = Any_Type then
9809 Next_Entity (Component);
9817 end Trace_Components;
9819 -- Start of processing for Private_Component
9822 return Trace_Components (Type_Id, False);
9823 end Private_Component;
9825 ---------------------------
9826 -- Primitive_Names_Match --
9827 ---------------------------
9829 function Primitive_Names_Match (E1, E2 : Entity_Id) return Boolean is
9831 function Non_Internal_Name (E : Entity_Id) return Name_Id;
9832 -- Given an internal name, returns the corresponding non-internal name
9834 ------------------------
9835 -- Non_Internal_Name --
9836 ------------------------
9838 function Non_Internal_Name (E : Entity_Id) return Name_Id is
9840 Get_Name_String (Chars (E));
9841 Name_Len := Name_Len - 1;
9843 end Non_Internal_Name;
9845 -- Start of processing for Primitive_Names_Match
9848 pragma Assert (Present (E1) and then Present (E2));
9850 return Chars (E1) = Chars (E2)
9852 (not Is_Internal_Name (Chars (E1))
9853 and then Is_Internal_Name (Chars (E2))
9854 and then Non_Internal_Name (E2) = Chars (E1))
9856 (not Is_Internal_Name (Chars (E2))
9857 and then Is_Internal_Name (Chars (E1))
9858 and then Non_Internal_Name (E1) = Chars (E2))
9860 (Is_Predefined_Dispatching_Operation (E1)
9861 and then Is_Predefined_Dispatching_Operation (E2)
9862 and then Same_TSS (E1, E2))
9864 (Is_Init_Proc (E1) and then Is_Init_Proc (E2));
9865 end Primitive_Names_Match;
9867 -----------------------
9868 -- Process_End_Label --
9869 -----------------------
9871 procedure Process_End_Label
9880 Label_Ref : Boolean;
9881 -- Set True if reference to end label itself is required
9884 -- Gets set to the operator symbol or identifier that references the
9885 -- entity Ent. For the child unit case, this is the identifier from the
9886 -- designator. For other cases, this is simply Endl.
9888 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id);
9889 -- N is an identifier node that appears as a parent unit reference in
9890 -- the case where Ent is a child unit. This procedure generates an
9891 -- appropriate cross-reference entry. E is the corresponding entity.
9893 -------------------------
9894 -- Generate_Parent_Ref --
9895 -------------------------
9897 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id) is
9899 -- If names do not match, something weird, skip reference
9901 if Chars (E) = Chars (N) then
9903 -- Generate the reference. We do NOT consider this as a reference
9904 -- for unreferenced symbol purposes.
9906 Generate_Reference (E, N, 'r', Set_Ref => False, Force => True);
9909 Style.Check_Identifier (N, E);
9912 end Generate_Parent_Ref;
9914 -- Start of processing for Process_End_Label
9917 -- If no node, ignore. This happens in some error situations, and
9918 -- also for some internally generated structures where no end label
9919 -- references are required in any case.
9925 -- Nothing to do if no End_Label, happens for internally generated
9926 -- constructs where we don't want an end label reference anyway. Also
9927 -- nothing to do if Endl is a string literal, which means there was
9928 -- some prior error (bad operator symbol)
9930 Endl := End_Label (N);
9932 if No (Endl) or else Nkind (Endl) = N_String_Literal then
9936 -- Reference node is not in extended main source unit
9938 if not In_Extended_Main_Source_Unit (N) then
9940 -- Generally we do not collect references except for the extended
9941 -- main source unit. The one exception is the 'e' entry for a
9942 -- package spec, where it is useful for a client to have the
9943 -- ending information to define scopes.
9951 -- For this case, we can ignore any parent references, but we
9952 -- need the package name itself for the 'e' entry.
9954 if Nkind (Endl) = N_Designator then
9955 Endl := Identifier (Endl);
9959 -- Reference is in extended main source unit
9964 -- For designator, generate references for the parent entries
9966 if Nkind (Endl) = N_Designator then
9968 -- Generate references for the prefix if the END line comes from
9969 -- source (otherwise we do not need these references) We climb the
9970 -- scope stack to find the expected entities.
9972 if Comes_From_Source (Endl) then
9974 Scop := Current_Scope;
9975 while Nkind (Nam) = N_Selected_Component loop
9976 Scop := Scope (Scop);
9977 exit when No (Scop);
9978 Generate_Parent_Ref (Selector_Name (Nam), Scop);
9979 Nam := Prefix (Nam);
9982 if Present (Scop) then
9983 Generate_Parent_Ref (Nam, Scope (Scop));
9987 Endl := Identifier (Endl);
9991 -- If the end label is not for the given entity, then either we have
9992 -- some previous error, or this is a generic instantiation for which
9993 -- we do not need to make a cross-reference in this case anyway. In
9994 -- either case we simply ignore the call.
9996 if Chars (Ent) /= Chars (Endl) then
10000 -- If label was really there, then generate a normal reference and then
10001 -- adjust the location in the end label to point past the name (which
10002 -- should almost always be the semicolon).
10004 Loc := Sloc (Endl);
10006 if Comes_From_Source (Endl) then
10008 -- If a label reference is required, then do the style check and
10009 -- generate an l-type cross-reference entry for the label
10012 if Style_Check then
10013 Style.Check_Identifier (Endl, Ent);
10016 Generate_Reference (Ent, Endl, 'l', Set_Ref => False);
10019 -- Set the location to point past the label (normally this will
10020 -- mean the semicolon immediately following the label). This is
10021 -- done for the sake of the 'e' or 't' entry generated below.
10023 Get_Decoded_Name_String (Chars (Endl));
10024 Set_Sloc (Endl, Sloc (Endl) + Source_Ptr (Name_Len));
10027 -- Now generate the e/t reference
10029 Generate_Reference (Ent, Endl, Typ, Set_Ref => False, Force => True);
10031 -- Restore Sloc, in case modified above, since we have an identifier
10032 -- and the normal Sloc should be left set in the tree.
10034 Set_Sloc (Endl, Loc);
10035 end Process_End_Label;
10041 -- We do the conversion to get the value of the real string by using
10042 -- the scanner, see Sinput for details on use of the internal source
10043 -- buffer for scanning internal strings.
10045 function Real_Convert (S : String) return Node_Id is
10046 Save_Src : constant Source_Buffer_Ptr := Source;
10047 Negative : Boolean;
10050 Source := Internal_Source_Ptr;
10053 for J in S'Range loop
10054 Source (Source_Ptr (J)) := S (J);
10057 Source (S'Length + 1) := EOF;
10059 if Source (Scan_Ptr) = '-' then
10061 Scan_Ptr := Scan_Ptr + 1;
10069 Set_Realval (Token_Node, UR_Negate (Realval (Token_Node)));
10072 Source := Save_Src;
10076 ------------------------------------
10077 -- References_Generic_Formal_Type --
10078 ------------------------------------
10080 function References_Generic_Formal_Type (N : Node_Id) return Boolean is
10082 function Process (N : Node_Id) return Traverse_Result;
10083 -- Process one node in search for generic formal type
10089 function Process (N : Node_Id) return Traverse_Result is
10091 if Nkind (N) in N_Has_Entity then
10093 E : constant Entity_Id := Entity (N);
10095 if Present (E) then
10096 if Is_Generic_Type (E) then
10098 elsif Present (Etype (E))
10099 and then Is_Generic_Type (Etype (E))
10110 function Traverse is new Traverse_Func (Process);
10111 -- Traverse tree to look for generic type
10114 if Inside_A_Generic then
10115 return Traverse (N) = Abandon;
10119 end References_Generic_Formal_Type;
10121 --------------------
10122 -- Remove_Homonym --
10123 --------------------
10125 procedure Remove_Homonym (E : Entity_Id) is
10126 Prev : Entity_Id := Empty;
10130 if E = Current_Entity (E) then
10131 if Present (Homonym (E)) then
10132 Set_Current_Entity (Homonym (E));
10134 Set_Name_Entity_Id (Chars (E), Empty);
10137 H := Current_Entity (E);
10138 while Present (H) and then H /= E loop
10143 Set_Homonym (Prev, Homonym (E));
10145 end Remove_Homonym;
10147 ---------------------
10148 -- Rep_To_Pos_Flag --
10149 ---------------------
10151 function Rep_To_Pos_Flag (E : Entity_Id; Loc : Source_Ptr) return Node_Id is
10153 return New_Occurrence_Of
10154 (Boolean_Literals (not Range_Checks_Suppressed (E)), Loc);
10155 end Rep_To_Pos_Flag;
10157 --------------------
10158 -- Require_Entity --
10159 --------------------
10161 procedure Require_Entity (N : Node_Id) is
10163 if Is_Entity_Name (N) and then No (Entity (N)) then
10164 if Total_Errors_Detected /= 0 then
10165 Set_Entity (N, Any_Id);
10167 raise Program_Error;
10170 end Require_Entity;
10172 ------------------------------
10173 -- Requires_Transient_Scope --
10174 ------------------------------
10176 -- A transient scope is required when variable-sized temporaries are
10177 -- allocated in the primary or secondary stack, or when finalization
10178 -- actions must be generated before the next instruction.
10180 function Requires_Transient_Scope (Id : Entity_Id) return Boolean is
10181 Typ : constant Entity_Id := Underlying_Type (Id);
10183 -- Start of processing for Requires_Transient_Scope
10186 -- This is a private type which is not completed yet. This can only
10187 -- happen in a default expression (of a formal parameter or of a
10188 -- record component). Do not expand transient scope in this case
10193 -- Do not expand transient scope for non-existent procedure return
10195 elsif Typ = Standard_Void_Type then
10198 -- Elementary types do not require a transient scope
10200 elsif Is_Elementary_Type (Typ) then
10203 -- Generally, indefinite subtypes require a transient scope, since the
10204 -- back end cannot generate temporaries, since this is not a valid type
10205 -- for declaring an object. It might be possible to relax this in the
10206 -- future, e.g. by declaring the maximum possible space for the type.
10208 elsif Is_Indefinite_Subtype (Typ) then
10211 -- Functions returning tagged types may dispatch on result so their
10212 -- returned value is allocated on the secondary stack. Controlled
10213 -- type temporaries need finalization.
10215 elsif Is_Tagged_Type (Typ)
10216 or else Has_Controlled_Component (Typ)
10218 return not Is_Value_Type (Typ);
10222 elsif Is_Record_Type (Typ) then
10226 Comp := First_Entity (Typ);
10227 while Present (Comp) loop
10228 if Ekind (Comp) = E_Component
10229 and then Requires_Transient_Scope (Etype (Comp))
10233 Next_Entity (Comp);
10240 -- String literal types never require transient scope
10242 elsif Ekind (Typ) = E_String_Literal_Subtype then
10245 -- Array type. Note that we already know that this is a constrained
10246 -- array, since unconstrained arrays will fail the indefinite test.
10248 elsif Is_Array_Type (Typ) then
10250 -- If component type requires a transient scope, the array does too
10252 if Requires_Transient_Scope (Component_Type (Typ)) then
10255 -- Otherwise, we only need a transient scope if the size is not
10256 -- known at compile time.
10259 return not Size_Known_At_Compile_Time (Typ);
10262 -- All other cases do not require a transient scope
10267 end Requires_Transient_Scope;
10269 --------------------------
10270 -- Reset_Analyzed_Flags --
10271 --------------------------
10273 procedure Reset_Analyzed_Flags (N : Node_Id) is
10275 function Clear_Analyzed (N : Node_Id) return Traverse_Result;
10276 -- Function used to reset Analyzed flags in tree. Note that we do
10277 -- not reset Analyzed flags in entities, since there is no need to
10278 -- reanalyze entities, and indeed, it is wrong to do so, since it
10279 -- can result in generating auxiliary stuff more than once.
10281 --------------------
10282 -- Clear_Analyzed --
10283 --------------------
10285 function Clear_Analyzed (N : Node_Id) return Traverse_Result is
10287 if not Has_Extension (N) then
10288 Set_Analyzed (N, False);
10292 end Clear_Analyzed;
10294 procedure Reset_Analyzed is new Traverse_Proc (Clear_Analyzed);
10296 -- Start of processing for Reset_Analyzed_Flags
10299 Reset_Analyzed (N);
10300 end Reset_Analyzed_Flags;
10302 ---------------------------
10303 -- Safe_To_Capture_Value --
10304 ---------------------------
10306 function Safe_To_Capture_Value
10309 Cond : Boolean := False) return Boolean
10312 -- The only entities for which we track constant values are variables
10313 -- which are not renamings, constants, out parameters, and in out
10314 -- parameters, so check if we have this case.
10316 -- Note: it may seem odd to track constant values for constants, but in
10317 -- fact this routine is used for other purposes than simply capturing
10318 -- the value. In particular, the setting of Known[_Non]_Null.
10320 if (Ekind (Ent) = E_Variable and then No (Renamed_Object (Ent)))
10322 Ekind (Ent) = E_Constant
10324 Ekind (Ent) = E_Out_Parameter
10326 Ekind (Ent) = E_In_Out_Parameter
10330 -- For conditionals, we also allow loop parameters and all formals,
10331 -- including in parameters.
10335 (Ekind (Ent) = E_Loop_Parameter
10337 Ekind (Ent) = E_In_Parameter)
10341 -- For all other cases, not just unsafe, but impossible to capture
10342 -- Current_Value, since the above are the only entities which have
10343 -- Current_Value fields.
10349 -- Skip if volatile or aliased, since funny things might be going on in
10350 -- these cases which we cannot necessarily track. Also skip any variable
10351 -- for which an address clause is given, or whose address is taken. Also
10352 -- never capture value of library level variables (an attempt to do so
10353 -- can occur in the case of package elaboration code).
10355 if Treat_As_Volatile (Ent)
10356 or else Is_Aliased (Ent)
10357 or else Present (Address_Clause (Ent))
10358 or else Address_Taken (Ent)
10359 or else (Is_Library_Level_Entity (Ent)
10360 and then Ekind (Ent) = E_Variable)
10365 -- OK, all above conditions are met. We also require that the scope of
10366 -- the reference be the same as the scope of the entity, not counting
10367 -- packages and blocks and loops.
10370 E_Scope : constant Entity_Id := Scope (Ent);
10371 R_Scope : Entity_Id;
10374 R_Scope := Current_Scope;
10375 while R_Scope /= Standard_Standard loop
10376 exit when R_Scope = E_Scope;
10378 if not Ekind_In (R_Scope, E_Package, E_Block, E_Loop) then
10381 R_Scope := Scope (R_Scope);
10386 -- We also require that the reference does not appear in a context
10387 -- where it is not sure to be executed (i.e. a conditional context
10388 -- or an exception handler). We skip this if Cond is True, since the
10389 -- capturing of values from conditional tests handles this ok.
10403 while Present (P) loop
10404 if Nkind (P) = N_If_Statement
10405 or else Nkind (P) = N_Case_Statement
10406 or else (Nkind (P) in N_Short_Circuit
10407 and then Desc = Right_Opnd (P))
10408 or else (Nkind (P) = N_Conditional_Expression
10409 and then Desc /= First (Expressions (P)))
10410 or else Nkind (P) = N_Exception_Handler
10411 or else Nkind (P) = N_Selective_Accept
10412 or else Nkind (P) = N_Conditional_Entry_Call
10413 or else Nkind (P) = N_Timed_Entry_Call
10414 or else Nkind (P) = N_Asynchronous_Select
10424 -- OK, looks safe to set value
10427 end Safe_To_Capture_Value;
10433 function Same_Name (N1, N2 : Node_Id) return Boolean is
10434 K1 : constant Node_Kind := Nkind (N1);
10435 K2 : constant Node_Kind := Nkind (N2);
10438 if (K1 = N_Identifier or else K1 = N_Defining_Identifier)
10439 and then (K2 = N_Identifier or else K2 = N_Defining_Identifier)
10441 return Chars (N1) = Chars (N2);
10443 elsif (K1 = N_Selected_Component or else K1 = N_Expanded_Name)
10444 and then (K2 = N_Selected_Component or else K2 = N_Expanded_Name)
10446 return Same_Name (Selector_Name (N1), Selector_Name (N2))
10447 and then Same_Name (Prefix (N1), Prefix (N2));
10458 function Same_Object (Node1, Node2 : Node_Id) return Boolean is
10459 N1 : constant Node_Id := Original_Node (Node1);
10460 N2 : constant Node_Id := Original_Node (Node2);
10461 -- We do the tests on original nodes, since we are most interested
10462 -- in the original source, not any expansion that got in the way.
10464 K1 : constant Node_Kind := Nkind (N1);
10465 K2 : constant Node_Kind := Nkind (N2);
10468 -- First case, both are entities with same entity
10470 if K1 in N_Has_Entity and then K2 in N_Has_Entity then
10472 EN1 : constant Entity_Id := Entity (N1);
10473 EN2 : constant Entity_Id := Entity (N2);
10475 if Present (EN1) and then Present (EN2)
10476 and then (Ekind_In (EN1, E_Variable, E_Constant)
10477 or else Is_Formal (EN1))
10485 -- Second case, selected component with same selector, same record
10487 if K1 = N_Selected_Component
10488 and then K2 = N_Selected_Component
10489 and then Chars (Selector_Name (N1)) = Chars (Selector_Name (N2))
10491 return Same_Object (Prefix (N1), Prefix (N2));
10493 -- Third case, indexed component with same subscripts, same array
10495 elsif K1 = N_Indexed_Component
10496 and then K2 = N_Indexed_Component
10497 and then Same_Object (Prefix (N1), Prefix (N2))
10502 E1 := First (Expressions (N1));
10503 E2 := First (Expressions (N2));
10504 while Present (E1) loop
10505 if not Same_Value (E1, E2) then
10516 -- Fourth case, slice of same array with same bounds
10519 and then K2 = N_Slice
10520 and then Nkind (Discrete_Range (N1)) = N_Range
10521 and then Nkind (Discrete_Range (N2)) = N_Range
10522 and then Same_Value (Low_Bound (Discrete_Range (N1)),
10523 Low_Bound (Discrete_Range (N2)))
10524 and then Same_Value (High_Bound (Discrete_Range (N1)),
10525 High_Bound (Discrete_Range (N2)))
10527 return Same_Name (Prefix (N1), Prefix (N2));
10529 -- All other cases, not clearly the same object
10540 function Same_Type (T1, T2 : Entity_Id) return Boolean is
10545 elsif not Is_Constrained (T1)
10546 and then not Is_Constrained (T2)
10547 and then Base_Type (T1) = Base_Type (T2)
10551 -- For now don't bother with case of identical constraints, to be
10552 -- fiddled with later on perhaps (this is only used for optimization
10553 -- purposes, so it is not critical to do a best possible job)
10564 function Same_Value (Node1, Node2 : Node_Id) return Boolean is
10566 if Compile_Time_Known_Value (Node1)
10567 and then Compile_Time_Known_Value (Node2)
10568 and then Expr_Value (Node1) = Expr_Value (Node2)
10571 elsif Same_Object (Node1, Node2) then
10582 procedure Save_Actual (N : Node_Id; Writable : Boolean := False) is
10584 if Is_Entity_Name (N)
10586 Nkind_In (N, N_Indexed_Component, N_Selected_Component, N_Slice)
10588 (Nkind (N) = N_Attribute_Reference
10589 and then Attribute_Name (N) = Name_Access)
10592 -- We are only interested in IN OUT parameters of inner calls
10595 or else Nkind (Parent (N)) = N_Function_Call
10596 or else Nkind (Parent (N)) in N_Op
10598 Actuals_In_Call.Increment_Last;
10599 Actuals_In_Call.Table (Actuals_In_Call.Last) := (N, Writable);
10604 ------------------------
10605 -- Scope_Is_Transient --
10606 ------------------------
10608 function Scope_Is_Transient return Boolean is
10610 return Scope_Stack.Table (Scope_Stack.Last).Is_Transient;
10611 end Scope_Is_Transient;
10617 function Scope_Within (Scope1, Scope2 : Entity_Id) return Boolean is
10622 while Scop /= Standard_Standard loop
10623 Scop := Scope (Scop);
10625 if Scop = Scope2 then
10633 --------------------------
10634 -- Scope_Within_Or_Same --
10635 --------------------------
10637 function Scope_Within_Or_Same (Scope1, Scope2 : Entity_Id) return Boolean is
10642 while Scop /= Standard_Standard loop
10643 if Scop = Scope2 then
10646 Scop := Scope (Scop);
10651 end Scope_Within_Or_Same;
10653 --------------------
10654 -- Set_Convention --
10655 --------------------
10657 procedure Set_Convention (E : Entity_Id; Val : Snames.Convention_Id) is
10659 Basic_Set_Convention (E, Val);
10662 and then Is_Access_Subprogram_Type (Base_Type (E))
10663 and then Has_Foreign_Convention (E)
10665 Set_Can_Use_Internal_Rep (E, False);
10667 end Set_Convention;
10669 ------------------------
10670 -- Set_Current_Entity --
10671 ------------------------
10673 -- The given entity is to be set as the currently visible definition
10674 -- of its associated name (i.e. the Node_Id associated with its name).
10675 -- All we have to do is to get the name from the identifier, and
10676 -- then set the associated Node_Id to point to the given entity.
10678 procedure Set_Current_Entity (E : Entity_Id) is
10680 Set_Name_Entity_Id (Chars (E), E);
10681 end Set_Current_Entity;
10683 ---------------------------
10684 -- Set_Debug_Info_Needed --
10685 ---------------------------
10687 procedure Set_Debug_Info_Needed (T : Entity_Id) is
10689 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id);
10690 pragma Inline (Set_Debug_Info_Needed_If_Not_Set);
10691 -- Used to set debug info in a related node if not set already
10693 --------------------------------------
10694 -- Set_Debug_Info_Needed_If_Not_Set --
10695 --------------------------------------
10697 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id) is
10700 and then not Needs_Debug_Info (E)
10702 Set_Debug_Info_Needed (E);
10704 -- For a private type, indicate that the full view also needs
10705 -- debug information.
10708 and then Is_Private_Type (E)
10709 and then Present (Full_View (E))
10711 Set_Debug_Info_Needed (Full_View (E));
10714 end Set_Debug_Info_Needed_If_Not_Set;
10716 -- Start of processing for Set_Debug_Info_Needed
10719 -- Nothing to do if argument is Empty or has Debug_Info_Off set, which
10720 -- indicates that Debug_Info_Needed is never required for the entity.
10723 or else Debug_Info_Off (T)
10728 -- Set flag in entity itself. Note that we will go through the following
10729 -- circuitry even if the flag is already set on T. That's intentional,
10730 -- it makes sure that the flag will be set in subsidiary entities.
10732 Set_Needs_Debug_Info (T);
10734 -- Set flag on subsidiary entities if not set already
10736 if Is_Object (T) then
10737 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
10739 elsif Is_Type (T) then
10740 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
10742 if Is_Record_Type (T) then
10744 Ent : Entity_Id := First_Entity (T);
10746 while Present (Ent) loop
10747 Set_Debug_Info_Needed_If_Not_Set (Ent);
10752 -- For a class wide subtype, we also need debug information
10753 -- for the equivalent type.
10755 if Ekind (T) = E_Class_Wide_Subtype then
10756 Set_Debug_Info_Needed_If_Not_Set (Equivalent_Type (T));
10759 elsif Is_Array_Type (T) then
10760 Set_Debug_Info_Needed_If_Not_Set (Component_Type (T));
10763 Indx : Node_Id := First_Index (T);
10765 while Present (Indx) loop
10766 Set_Debug_Info_Needed_If_Not_Set (Etype (Indx));
10767 Indx := Next_Index (Indx);
10771 if Is_Packed (T) then
10772 Set_Debug_Info_Needed_If_Not_Set (Packed_Array_Type (T));
10775 elsif Is_Access_Type (T) then
10776 Set_Debug_Info_Needed_If_Not_Set (Directly_Designated_Type (T));
10778 elsif Is_Private_Type (T) then
10779 Set_Debug_Info_Needed_If_Not_Set (Full_View (T));
10781 elsif Is_Protected_Type (T) then
10782 Set_Debug_Info_Needed_If_Not_Set (Corresponding_Record_Type (T));
10785 end Set_Debug_Info_Needed;
10787 ---------------------------------
10788 -- Set_Entity_With_Style_Check --
10789 ---------------------------------
10791 procedure Set_Entity_With_Style_Check (N : Node_Id; Val : Entity_Id) is
10792 Val_Actual : Entity_Id;
10796 Set_Entity (N, Val);
10799 and then not Suppress_Style_Checks (Val)
10800 and then not In_Instance
10802 if Nkind (N) = N_Identifier then
10804 elsif Nkind (N) = N_Expanded_Name then
10805 Nod := Selector_Name (N);
10810 -- A special situation arises for derived operations, where we want
10811 -- to do the check against the parent (since the Sloc of the derived
10812 -- operation points to the derived type declaration itself).
10815 while not Comes_From_Source (Val_Actual)
10816 and then Nkind (Val_Actual) in N_Entity
10817 and then (Ekind (Val_Actual) = E_Enumeration_Literal
10818 or else Is_Subprogram (Val_Actual)
10819 or else Is_Generic_Subprogram (Val_Actual))
10820 and then Present (Alias (Val_Actual))
10822 Val_Actual := Alias (Val_Actual);
10825 -- Renaming declarations for generic actuals do not come from source,
10826 -- and have a different name from that of the entity they rename, so
10827 -- there is no style check to perform here.
10829 if Chars (Nod) = Chars (Val_Actual) then
10830 Style.Check_Identifier (Nod, Val_Actual);
10834 Set_Entity (N, Val);
10835 end Set_Entity_With_Style_Check;
10837 ------------------------
10838 -- Set_Name_Entity_Id --
10839 ------------------------
10841 procedure Set_Name_Entity_Id (Id : Name_Id; Val : Entity_Id) is
10843 Set_Name_Table_Info (Id, Int (Val));
10844 end Set_Name_Entity_Id;
10846 ---------------------
10847 -- Set_Next_Actual --
10848 ---------------------
10850 procedure Set_Next_Actual (Ass1_Id : Node_Id; Ass2_Id : Node_Id) is
10852 if Nkind (Parent (Ass1_Id)) = N_Parameter_Association then
10853 Set_First_Named_Actual (Parent (Ass1_Id), Ass2_Id);
10855 end Set_Next_Actual;
10857 ----------------------------------
10858 -- Set_Optimize_Alignment_Flags --
10859 ----------------------------------
10861 procedure Set_Optimize_Alignment_Flags (E : Entity_Id) is
10863 if Optimize_Alignment = 'S' then
10864 Set_Optimize_Alignment_Space (E);
10865 elsif Optimize_Alignment = 'T' then
10866 Set_Optimize_Alignment_Time (E);
10868 end Set_Optimize_Alignment_Flags;
10870 -----------------------
10871 -- Set_Public_Status --
10872 -----------------------
10874 procedure Set_Public_Status (Id : Entity_Id) is
10875 S : constant Entity_Id := Current_Scope;
10877 function Within_HSS_Or_If (E : Entity_Id) return Boolean;
10878 -- Determines if E is defined within handled statement sequence or
10879 -- an if statement, returns True if so, False otherwise.
10881 ----------------------
10882 -- Within_HSS_Or_If --
10883 ----------------------
10885 function Within_HSS_Or_If (E : Entity_Id) return Boolean is
10888 N := Declaration_Node (E);
10895 elsif Nkind_In (N, N_Handled_Sequence_Of_Statements,
10901 end Within_HSS_Or_If;
10903 -- Start of processing for Set_Public_Status
10906 -- Everything in the scope of Standard is public
10908 if S = Standard_Standard then
10909 Set_Is_Public (Id);
10911 -- Entity is definitely not public if enclosing scope is not public
10913 elsif not Is_Public (S) then
10916 -- An object or function declaration that occurs in a handled sequence
10917 -- of statements or within an if statement is the declaration for a
10918 -- temporary object or local subprogram generated by the expander. It
10919 -- never needs to be made public and furthermore, making it public can
10920 -- cause back end problems.
10922 elsif Nkind_In (Parent (Id), N_Object_Declaration,
10923 N_Function_Specification)
10924 and then Within_HSS_Or_If (Id)
10928 -- Entities in public packages or records are public
10930 elsif Ekind (S) = E_Package or Is_Record_Type (S) then
10931 Set_Is_Public (Id);
10933 -- The bounds of an entry family declaration can generate object
10934 -- declarations that are visible to the back-end, e.g. in the
10935 -- the declaration of a composite type that contains tasks.
10937 elsif Is_Concurrent_Type (S)
10938 and then not Has_Completion (S)
10939 and then Nkind (Parent (Id)) = N_Object_Declaration
10941 Set_Is_Public (Id);
10943 end Set_Public_Status;
10945 -----------------------------
10946 -- Set_Referenced_Modified --
10947 -----------------------------
10949 procedure Set_Referenced_Modified (N : Node_Id; Out_Param : Boolean) is
10953 -- Deal with indexed or selected component where prefix is modified
10955 if Nkind_In (N, N_Indexed_Component, N_Selected_Component) then
10956 Pref := Prefix (N);
10958 -- If prefix is access type, then it is the designated object that is
10959 -- being modified, which means we have no entity to set the flag on.
10961 if No (Etype (Pref)) or else Is_Access_Type (Etype (Pref)) then
10964 -- Otherwise chase the prefix
10967 Set_Referenced_Modified (Pref, Out_Param);
10970 -- Otherwise see if we have an entity name (only other case to process)
10972 elsif Is_Entity_Name (N) and then Present (Entity (N)) then
10973 Set_Referenced_As_LHS (Entity (N), not Out_Param);
10974 Set_Referenced_As_Out_Parameter (Entity (N), Out_Param);
10976 end Set_Referenced_Modified;
10978 ----------------------------
10979 -- Set_Scope_Is_Transient --
10980 ----------------------------
10982 procedure Set_Scope_Is_Transient (V : Boolean := True) is
10984 Scope_Stack.Table (Scope_Stack.Last).Is_Transient := V;
10985 end Set_Scope_Is_Transient;
10987 -------------------
10988 -- Set_Size_Info --
10989 -------------------
10991 procedure Set_Size_Info (T1, T2 : Entity_Id) is
10993 -- We copy Esize, but not RM_Size, since in general RM_Size is
10994 -- subtype specific and does not get inherited by all subtypes.
10996 Set_Esize (T1, Esize (T2));
10997 Set_Has_Biased_Representation (T1, Has_Biased_Representation (T2));
10999 if Is_Discrete_Or_Fixed_Point_Type (T1)
11001 Is_Discrete_Or_Fixed_Point_Type (T2)
11003 Set_Is_Unsigned_Type (T1, Is_Unsigned_Type (T2));
11006 Set_Alignment (T1, Alignment (T2));
11009 --------------------
11010 -- Static_Integer --
11011 --------------------
11013 function Static_Integer (N : Node_Id) return Uint is
11015 Analyze_And_Resolve (N, Any_Integer);
11018 or else Error_Posted (N)
11019 or else Etype (N) = Any_Type
11024 if Is_Static_Expression (N) then
11025 if not Raises_Constraint_Error (N) then
11026 return Expr_Value (N);
11031 elsif Etype (N) = Any_Type then
11035 Flag_Non_Static_Expr
11036 ("static integer expression required here", N);
11039 end Static_Integer;
11041 --------------------------
11042 -- Statically_Different --
11043 --------------------------
11045 function Statically_Different (E1, E2 : Node_Id) return Boolean is
11046 R1 : constant Node_Id := Get_Referenced_Object (E1);
11047 R2 : constant Node_Id := Get_Referenced_Object (E2);
11049 return Is_Entity_Name (R1)
11050 and then Is_Entity_Name (R2)
11051 and then Entity (R1) /= Entity (R2)
11052 and then not Is_Formal (Entity (R1))
11053 and then not Is_Formal (Entity (R2));
11054 end Statically_Different;
11056 -----------------------------
11057 -- Subprogram_Access_Level --
11058 -----------------------------
11060 function Subprogram_Access_Level (Subp : Entity_Id) return Uint is
11062 if Present (Alias (Subp)) then
11063 return Subprogram_Access_Level (Alias (Subp));
11065 return Scope_Depth (Enclosing_Dynamic_Scope (Subp));
11067 end Subprogram_Access_Level;
11073 procedure Trace_Scope (N : Node_Id; E : Entity_Id; Msg : String) is
11075 if Debug_Flag_W then
11076 for J in 0 .. Scope_Stack.Last loop
11081 Write_Name (Chars (E));
11082 Write_Str (" from ");
11083 Write_Location (Sloc (N));
11088 -----------------------
11089 -- Transfer_Entities --
11090 -----------------------
11092 procedure Transfer_Entities (From : Entity_Id; To : Entity_Id) is
11093 Ent : Entity_Id := First_Entity (From);
11100 if (Last_Entity (To)) = Empty then
11101 Set_First_Entity (To, Ent);
11103 Set_Next_Entity (Last_Entity (To), Ent);
11106 Set_Last_Entity (To, Last_Entity (From));
11108 while Present (Ent) loop
11109 Set_Scope (Ent, To);
11111 if not Is_Public (Ent) then
11112 Set_Public_Status (Ent);
11115 and then Ekind (Ent) = E_Record_Subtype
11118 -- The components of the propagated Itype must be public
11124 Comp := First_Entity (Ent);
11125 while Present (Comp) loop
11126 Set_Is_Public (Comp);
11127 Next_Entity (Comp);
11136 Set_First_Entity (From, Empty);
11137 Set_Last_Entity (From, Empty);
11138 end Transfer_Entities;
11140 -----------------------
11141 -- Type_Access_Level --
11142 -----------------------
11144 function Type_Access_Level (Typ : Entity_Id) return Uint is
11148 Btyp := Base_Type (Typ);
11150 -- Ada 2005 (AI-230): For most cases of anonymous access types, we
11151 -- simply use the level where the type is declared. This is true for
11152 -- stand-alone object declarations, and for anonymous access types
11153 -- associated with components the level is the same as that of the
11154 -- enclosing composite type. However, special treatment is needed for
11155 -- the cases of access parameters, return objects of an anonymous access
11156 -- type, and, in Ada 95, access discriminants of limited types.
11158 if Ekind (Btyp) in Access_Kind then
11159 if Ekind (Btyp) = E_Anonymous_Access_Type then
11161 -- If the type is a nonlocal anonymous access type (such as for
11162 -- an access parameter) we treat it as being declared at the
11163 -- library level to ensure that names such as X.all'access don't
11164 -- fail static accessibility checks.
11166 if not Is_Local_Anonymous_Access (Typ) then
11167 return Scope_Depth (Standard_Standard);
11169 -- If this is a return object, the accessibility level is that of
11170 -- the result subtype of the enclosing function. The test here is
11171 -- little complicated, because we have to account for extended
11172 -- return statements that have been rewritten as blocks, in which
11173 -- case we have to find and the Is_Return_Object attribute of the
11174 -- itype's associated object. It would be nice to find a way to
11175 -- simplify this test, but it doesn't seem worthwhile to add a new
11176 -- flag just for purposes of this test. ???
11178 elsif Ekind (Scope (Btyp)) = E_Return_Statement
11181 and then Nkind (Associated_Node_For_Itype (Btyp)) =
11182 N_Object_Declaration
11183 and then Is_Return_Object
11184 (Defining_Identifier
11185 (Associated_Node_For_Itype (Btyp))))
11191 Scop := Scope (Scope (Btyp));
11192 while Present (Scop) loop
11193 exit when Ekind (Scop) = E_Function;
11194 Scop := Scope (Scop);
11197 -- Treat the return object's type as having the level of the
11198 -- function's result subtype (as per RM05-6.5(5.3/2)).
11200 return Type_Access_Level (Etype (Scop));
11205 Btyp := Root_Type (Btyp);
11207 -- The accessibility level of anonymous access types associated with
11208 -- discriminants is that of the current instance of the type, and
11209 -- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
11211 -- AI-402: access discriminants have accessibility based on the
11212 -- object rather than the type in Ada 2005, so the above paragraph
11215 -- ??? Needs completion with rules from AI-416
11217 if Ada_Version <= Ada_95
11218 and then Ekind (Typ) = E_Anonymous_Access_Type
11219 and then Present (Associated_Node_For_Itype (Typ))
11220 and then Nkind (Associated_Node_For_Itype (Typ)) =
11221 N_Discriminant_Specification
11223 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp)) + 1;
11227 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
11228 end Type_Access_Level;
11230 --------------------------
11231 -- Unit_Declaration_Node --
11232 --------------------------
11234 function Unit_Declaration_Node (Unit_Id : Entity_Id) return Node_Id is
11235 N : Node_Id := Parent (Unit_Id);
11238 -- Predefined operators do not have a full function declaration
11240 if Ekind (Unit_Id) = E_Operator then
11244 -- Isn't there some better way to express the following ???
11246 while Nkind (N) /= N_Abstract_Subprogram_Declaration
11247 and then Nkind (N) /= N_Formal_Package_Declaration
11248 and then Nkind (N) /= N_Function_Instantiation
11249 and then Nkind (N) /= N_Generic_Package_Declaration
11250 and then Nkind (N) /= N_Generic_Subprogram_Declaration
11251 and then Nkind (N) /= N_Package_Declaration
11252 and then Nkind (N) /= N_Package_Body
11253 and then Nkind (N) /= N_Package_Instantiation
11254 and then Nkind (N) /= N_Package_Renaming_Declaration
11255 and then Nkind (N) /= N_Procedure_Instantiation
11256 and then Nkind (N) /= N_Protected_Body
11257 and then Nkind (N) /= N_Subprogram_Declaration
11258 and then Nkind (N) /= N_Subprogram_Body
11259 and then Nkind (N) /= N_Subprogram_Body_Stub
11260 and then Nkind (N) /= N_Subprogram_Renaming_Declaration
11261 and then Nkind (N) /= N_Task_Body
11262 and then Nkind (N) /= N_Task_Type_Declaration
11263 and then Nkind (N) not in N_Formal_Subprogram_Declaration
11264 and then Nkind (N) not in N_Generic_Renaming_Declaration
11267 pragma Assert (Present (N));
11271 end Unit_Declaration_Node;
11273 ------------------------------
11274 -- Universal_Interpretation --
11275 ------------------------------
11277 function Universal_Interpretation (Opnd : Node_Id) return Entity_Id is
11278 Index : Interp_Index;
11282 -- The argument may be a formal parameter of an operator or subprogram
11283 -- with multiple interpretations, or else an expression for an actual.
11285 if Nkind (Opnd) = N_Defining_Identifier
11286 or else not Is_Overloaded (Opnd)
11288 if Etype (Opnd) = Universal_Integer
11289 or else Etype (Opnd) = Universal_Real
11291 return Etype (Opnd);
11297 Get_First_Interp (Opnd, Index, It);
11298 while Present (It.Typ) loop
11299 if It.Typ = Universal_Integer
11300 or else It.Typ = Universal_Real
11305 Get_Next_Interp (Index, It);
11310 end Universal_Interpretation;
11316 function Unqualify (Expr : Node_Id) return Node_Id is
11318 -- Recurse to handle unlikely case of multiple levels of qualification
11320 if Nkind (Expr) = N_Qualified_Expression then
11321 return Unqualify (Expression (Expr));
11323 -- Normal case, not a qualified expression
11330 ----------------------
11331 -- Within_Init_Proc --
11332 ----------------------
11334 function Within_Init_Proc return Boolean is
11338 S := Current_Scope;
11339 while not Is_Overloadable (S) loop
11340 if S = Standard_Standard then
11347 return Is_Init_Proc (S);
11348 end Within_Init_Proc;
11354 procedure Wrong_Type (Expr : Node_Id; Expected_Type : Entity_Id) is
11355 Found_Type : constant Entity_Id := First_Subtype (Etype (Expr));
11356 Expec_Type : constant Entity_Id := First_Subtype (Expected_Type);
11358 function Has_One_Matching_Field return Boolean;
11359 -- Determines if Expec_Type is a record type with a single component or
11360 -- discriminant whose type matches the found type or is one dimensional
11361 -- array whose component type matches the found type.
11363 ----------------------------
11364 -- Has_One_Matching_Field --
11365 ----------------------------
11367 function Has_One_Matching_Field return Boolean is
11371 if Is_Array_Type (Expec_Type)
11372 and then Number_Dimensions (Expec_Type) = 1
11374 Covers (Etype (Component_Type (Expec_Type)), Found_Type)
11378 elsif not Is_Record_Type (Expec_Type) then
11382 E := First_Entity (Expec_Type);
11387 elsif (Ekind (E) /= E_Discriminant
11388 and then Ekind (E) /= E_Component)
11389 or else (Chars (E) = Name_uTag
11390 or else Chars (E) = Name_uParent)
11399 if not Covers (Etype (E), Found_Type) then
11402 elsif Present (Next_Entity (E)) then
11409 end Has_One_Matching_Field;
11411 -- Start of processing for Wrong_Type
11414 -- Don't output message if either type is Any_Type, or if a message
11415 -- has already been posted for this node. We need to do the latter
11416 -- check explicitly (it is ordinarily done in Errout), because we
11417 -- are using ! to force the output of the error messages.
11419 if Expec_Type = Any_Type
11420 or else Found_Type = Any_Type
11421 or else Error_Posted (Expr)
11425 -- In an instance, there is an ongoing problem with completion of
11426 -- type derived from private types. Their structure is what Gigi
11427 -- expects, but the Etype is the parent type rather than the
11428 -- derived private type itself. Do not flag error in this case. The
11429 -- private completion is an entity without a parent, like an Itype.
11430 -- Similarly, full and partial views may be incorrect in the instance.
11431 -- There is no simple way to insure that it is consistent ???
11433 elsif In_Instance then
11434 if Etype (Etype (Expr)) = Etype (Expected_Type)
11436 (Has_Private_Declaration (Expected_Type)
11437 or else Has_Private_Declaration (Etype (Expr)))
11438 and then No (Parent (Expected_Type))
11444 -- An interesting special check. If the expression is parenthesized
11445 -- and its type corresponds to the type of the sole component of the
11446 -- expected record type, or to the component type of the expected one
11447 -- dimensional array type, then assume we have a bad aggregate attempt.
11449 if Nkind (Expr) in N_Subexpr
11450 and then Paren_Count (Expr) /= 0
11451 and then Has_One_Matching_Field
11453 Error_Msg_N ("positional aggregate cannot have one component", Expr);
11455 -- Another special check, if we are looking for a pool-specific access
11456 -- type and we found an E_Access_Attribute_Type, then we have the case
11457 -- of an Access attribute being used in a context which needs a pool-
11458 -- specific type, which is never allowed. The one extra check we make
11459 -- is that the expected designated type covers the Found_Type.
11461 elsif Is_Access_Type (Expec_Type)
11462 and then Ekind (Found_Type) = E_Access_Attribute_Type
11463 and then Ekind (Base_Type (Expec_Type)) /= E_General_Access_Type
11464 and then Ekind (Base_Type (Expec_Type)) /= E_Anonymous_Access_Type
11466 (Designated_Type (Expec_Type), Designated_Type (Found_Type))
11468 Error_Msg_N -- CODEFIX
11469 ("result must be general access type!", Expr);
11470 Error_Msg_NE -- CODEFIX
11471 ("add ALL to }!", Expr, Expec_Type);
11473 -- Another special check, if the expected type is an integer type,
11474 -- but the expression is of type System.Address, and the parent is
11475 -- an addition or subtraction operation whose left operand is the
11476 -- expression in question and whose right operand is of an integral
11477 -- type, then this is an attempt at address arithmetic, so give
11478 -- appropriate message.
11480 elsif Is_Integer_Type (Expec_Type)
11481 and then Is_RTE (Found_Type, RE_Address)
11482 and then (Nkind (Parent (Expr)) = N_Op_Add
11484 Nkind (Parent (Expr)) = N_Op_Subtract)
11485 and then Expr = Left_Opnd (Parent (Expr))
11486 and then Is_Integer_Type (Etype (Right_Opnd (Parent (Expr))))
11489 ("address arithmetic not predefined in package System",
11492 ("\possible missing with/use of System.Storage_Elements",
11496 -- If the expected type is an anonymous access type, as for access
11497 -- parameters and discriminants, the error is on the designated types.
11499 elsif Ekind (Expec_Type) = E_Anonymous_Access_Type then
11500 if Comes_From_Source (Expec_Type) then
11501 Error_Msg_NE ("expected}!", Expr, Expec_Type);
11504 ("expected an access type with designated}",
11505 Expr, Designated_Type (Expec_Type));
11508 if Is_Access_Type (Found_Type)
11509 and then not Comes_From_Source (Found_Type)
11512 ("\\found an access type with designated}!",
11513 Expr, Designated_Type (Found_Type));
11515 if From_With_Type (Found_Type) then
11516 Error_Msg_NE ("\\found incomplete}!", Expr, Found_Type);
11517 Error_Msg_Qual_Level := 99;
11518 Error_Msg_NE -- CODEFIX
11519 ("\\missing `WITH &;", Expr, Scope (Found_Type));
11520 Error_Msg_Qual_Level := 0;
11522 Error_Msg_NE ("found}!", Expr, Found_Type);
11526 -- Normal case of one type found, some other type expected
11529 -- If the names of the two types are the same, see if some number
11530 -- of levels of qualification will help. Don't try more than three
11531 -- levels, and if we get to standard, it's no use (and probably
11532 -- represents an error in the compiler) Also do not bother with
11533 -- internal scope names.
11536 Expec_Scope : Entity_Id;
11537 Found_Scope : Entity_Id;
11540 Expec_Scope := Expec_Type;
11541 Found_Scope := Found_Type;
11543 for Levels in Int range 0 .. 3 loop
11544 if Chars (Expec_Scope) /= Chars (Found_Scope) then
11545 Error_Msg_Qual_Level := Levels;
11549 Expec_Scope := Scope (Expec_Scope);
11550 Found_Scope := Scope (Found_Scope);
11552 exit when Expec_Scope = Standard_Standard
11553 or else Found_Scope = Standard_Standard
11554 or else not Comes_From_Source (Expec_Scope)
11555 or else not Comes_From_Source (Found_Scope);
11559 if Is_Record_Type (Expec_Type)
11560 and then Present (Corresponding_Remote_Type (Expec_Type))
11562 Error_Msg_NE ("expected}!", Expr,
11563 Corresponding_Remote_Type (Expec_Type));
11565 Error_Msg_NE ("expected}!", Expr, Expec_Type);
11568 if Is_Entity_Name (Expr)
11569 and then Is_Package_Or_Generic_Package (Entity (Expr))
11571 Error_Msg_N ("\\found package name!", Expr);
11573 elsif Is_Entity_Name (Expr)
11575 (Ekind (Entity (Expr)) = E_Procedure
11577 Ekind (Entity (Expr)) = E_Generic_Procedure)
11579 if Ekind (Expec_Type) = E_Access_Subprogram_Type then
11581 ("found procedure name, possibly missing Access attribute!",
11585 ("\\found procedure name instead of function!", Expr);
11588 elsif Nkind (Expr) = N_Function_Call
11589 and then Ekind (Expec_Type) = E_Access_Subprogram_Type
11590 and then Etype (Designated_Type (Expec_Type)) = Etype (Expr)
11591 and then No (Parameter_Associations (Expr))
11594 ("found function name, possibly missing Access attribute!",
11597 -- Catch common error: a prefix or infix operator which is not
11598 -- directly visible because the type isn't.
11600 elsif Nkind (Expr) in N_Op
11601 and then Is_Overloaded (Expr)
11602 and then not Is_Immediately_Visible (Expec_Type)
11603 and then not Is_Potentially_Use_Visible (Expec_Type)
11604 and then not In_Use (Expec_Type)
11605 and then Has_Compatible_Type (Right_Opnd (Expr), Expec_Type)
11608 ("operator of the type is not directly visible!", Expr);
11610 elsif Ekind (Found_Type) = E_Void
11611 and then Present (Parent (Found_Type))
11612 and then Nkind (Parent (Found_Type)) = N_Full_Type_Declaration
11614 Error_Msg_NE ("\\found premature usage of}!", Expr, Found_Type);
11617 Error_Msg_NE ("\\found}!", Expr, Found_Type);
11620 -- A special check for cases like M1 and M2 = 0 where M1 and M2 are
11621 -- of the same modular type, and (M1 and M2) = 0 was intended.
11623 if Expec_Type = Standard_Boolean
11624 and then Is_Modular_Integer_Type (Found_Type)
11625 and then Nkind_In (Parent (Expr), N_Op_And, N_Op_Or, N_Op_Xor)
11626 and then Nkind (Right_Opnd (Parent (Expr))) in N_Op_Compare
11629 Op : constant Node_Id := Right_Opnd (Parent (Expr));
11630 L : constant Node_Id := Left_Opnd (Op);
11631 R : constant Node_Id := Right_Opnd (Op);
11633 -- The case for the message is when the left operand of the
11634 -- comparison is the same modular type, or when it is an
11635 -- integer literal (or other universal integer expression),
11636 -- which would have been typed as the modular type if the
11637 -- parens had been there.
11639 if (Etype (L) = Found_Type
11641 Etype (L) = Universal_Integer)
11642 and then Is_Integer_Type (Etype (R))
11645 ("\\possible missing parens for modular operation", Expr);
11650 -- Reset error message qualification indication
11652 Error_Msg_Qual_Level := 0;