1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Casing; use Casing;
28 with Checks; use Checks;
29 with Debug; use Debug;
30 with Errout; use Errout;
31 with Elists; use Elists;
32 with Exp_Ch11; use Exp_Ch11;
33 with Exp_Disp; use Exp_Disp;
34 with Exp_Tss; use Exp_Tss;
35 with Exp_Util; use Exp_Util;
36 with Fname; use Fname;
37 with Freeze; use Freeze;
39 with Lib.Xref; use Lib.Xref;
40 with Nlists; use Nlists;
41 with Output; use Output;
43 with Rtsfind; use Rtsfind;
44 with Scans; use Scans;
47 with Sem_Aux; use Sem_Aux;
48 with Sem_Attr; use Sem_Attr;
49 with Sem_Ch8; use Sem_Ch8;
50 with Sem_Disp; use Sem_Disp;
51 with Sem_Eval; use Sem_Eval;
52 with Sem_Res; use Sem_Res;
53 with Sem_Type; use Sem_Type;
54 with Sinfo; use Sinfo;
55 with Sinput; use Sinput;
56 with Stand; use Stand;
58 with Stringt; use Stringt;
59 with Targparm; use Targparm;
60 with Tbuild; use Tbuild;
61 with Ttypes; use Ttypes;
62 with Uname; use Uname;
64 with GNAT.HTable; use GNAT.HTable;
65 package body Sem_Util is
67 ----------------------------------------
68 -- Global_Variables for New_Copy_Tree --
69 ----------------------------------------
71 -- These global variables are used by New_Copy_Tree. See description
72 -- of the body of this subprogram for details. Global variables can be
73 -- safely used by New_Copy_Tree, since there is no case of a recursive
74 -- call from the processing inside New_Copy_Tree.
76 NCT_Hash_Threshhold : constant := 20;
77 -- If there are more than this number of pairs of entries in the
78 -- map, then Hash_Tables_Used will be set, and the hash tables will
79 -- be initialized and used for the searches.
81 NCT_Hash_Tables_Used : Boolean := False;
82 -- Set to True if hash tables are in use
84 NCT_Table_Entries : Nat;
85 -- Count entries in table to see if threshhold is reached
87 NCT_Hash_Table_Setup : Boolean := False;
88 -- Set to True if hash table contains data. We set this True if we
89 -- setup the hash table with data, and leave it set permanently
90 -- from then on, this is a signal that second and subsequent users
91 -- of the hash table must clear the old entries before reuse.
93 subtype NCT_Header_Num is Int range 0 .. 511;
94 -- Defines range of headers in hash tables (512 headers)
96 -----------------------
97 -- Local Subprograms --
98 -----------------------
100 function Build_Component_Subtype
103 T : Entity_Id) return Node_Id;
104 -- This function builds the subtype for Build_Actual_Subtype_Of_Component
105 -- and Build_Discriminal_Subtype_Of_Component. C is a list of constraints,
106 -- Loc is the source location, T is the original subtype.
108 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean;
109 -- Subsidiary to Is_Fully_Initialized_Type. For an unconstrained type
110 -- with discriminants whose default values are static, examine only the
111 -- components in the selected variant to determine whether all of them
114 function Has_Null_Extension (T : Entity_Id) return Boolean;
115 -- T is a derived tagged type. Check whether the type extension is null.
116 -- If the parent type is fully initialized, T can be treated as such.
118 ------------------------------
119 -- Abstract_Interface_List --
120 ------------------------------
122 function Abstract_Interface_List (Typ : Entity_Id) return List_Id is
126 if Is_Concurrent_Type (Typ) then
128 -- If we are dealing with a synchronized subtype, go to the base
129 -- type, whose declaration has the interface list.
131 -- Shouldn't this be Declaration_Node???
133 Nod := Parent (Base_Type (Typ));
135 if Nkind (Nod) = N_Full_Type_Declaration then
139 elsif Ekind (Typ) = E_Record_Type_With_Private then
140 if Nkind (Parent (Typ)) = N_Full_Type_Declaration then
141 Nod := Type_Definition (Parent (Typ));
143 elsif Nkind (Parent (Typ)) = N_Private_Type_Declaration then
144 if Present (Full_View (Typ)) then
145 Nod := Type_Definition (Parent (Full_View (Typ)));
147 -- If the full-view is not available we cannot do anything else
148 -- here (the source has errors).
154 -- Support for generic formals with interfaces is still missing ???
156 elsif Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
161 (Nkind (Parent (Typ)) = N_Private_Extension_Declaration);
165 elsif Ekind (Typ) = E_Record_Subtype then
166 Nod := Type_Definition (Parent (Etype (Typ)));
168 elsif Ekind (Typ) = E_Record_Subtype_With_Private then
170 -- Recurse, because parent may still be a private extension. Also
171 -- note that the full view of the subtype or the full view of its
172 -- base type may (both) be unavailable.
174 return Abstract_Interface_List (Etype (Typ));
176 else pragma Assert ((Ekind (Typ)) = E_Record_Type);
177 if Nkind (Parent (Typ)) = N_Formal_Type_Declaration then
178 Nod := Formal_Type_Definition (Parent (Typ));
180 Nod := Type_Definition (Parent (Typ));
184 return Interface_List (Nod);
185 end Abstract_Interface_List;
187 --------------------------------
188 -- Add_Access_Type_To_Process --
189 --------------------------------
191 procedure Add_Access_Type_To_Process (E : Entity_Id; A : Entity_Id) is
195 Ensure_Freeze_Node (E);
196 L := Access_Types_To_Process (Freeze_Node (E));
200 Set_Access_Types_To_Process (Freeze_Node (E), L);
204 end Add_Access_Type_To_Process;
206 ----------------------------
207 -- Add_Global_Declaration --
208 ----------------------------
210 procedure Add_Global_Declaration (N : Node_Id) is
211 Aux_Node : constant Node_Id := Aux_Decls_Node (Cunit (Current_Sem_Unit));
214 if No (Declarations (Aux_Node)) then
215 Set_Declarations (Aux_Node, New_List);
218 Append_To (Declarations (Aux_Node), N);
220 end Add_Global_Declaration;
222 -----------------------
223 -- Alignment_In_Bits --
224 -----------------------
226 function Alignment_In_Bits (E : Entity_Id) return Uint is
228 return Alignment (E) * System_Storage_Unit;
229 end Alignment_In_Bits;
231 -----------------------------------------
232 -- Apply_Compile_Time_Constraint_Error --
233 -----------------------------------------
235 procedure Apply_Compile_Time_Constraint_Error
238 Reason : RT_Exception_Code;
239 Ent : Entity_Id := Empty;
240 Typ : Entity_Id := Empty;
241 Loc : Source_Ptr := No_Location;
242 Rep : Boolean := True;
243 Warn : Boolean := False)
245 Stat : constant Boolean := Is_Static_Expression (N);
246 R_Stat : constant Node_Id :=
247 Make_Raise_Constraint_Error (Sloc (N), Reason => Reason);
258 (Compile_Time_Constraint_Error (N, Msg, Ent, Loc, Warn => Warn));
264 -- Now we replace the node by an N_Raise_Constraint_Error node
265 -- This does not need reanalyzing, so set it as analyzed now.
268 Set_Analyzed (N, True);
271 Set_Raises_Constraint_Error (N);
273 -- Now deal with possible local raise handling
275 Possible_Local_Raise (N, Standard_Constraint_Error);
277 -- If the original expression was marked as static, the result is
278 -- still marked as static, but the Raises_Constraint_Error flag is
279 -- always set so that further static evaluation is not attempted.
282 Set_Is_Static_Expression (N);
284 end Apply_Compile_Time_Constraint_Error;
286 --------------------------
287 -- Build_Actual_Subtype --
288 --------------------------
290 function Build_Actual_Subtype
292 N : Node_Or_Entity_Id) return Node_Id
295 -- Normally Sloc (N), but may point to corresponding body in some cases
297 Constraints : List_Id;
303 Disc_Type : Entity_Id;
309 if Nkind (N) = N_Defining_Identifier then
310 Obj := New_Reference_To (N, Loc);
312 -- If this is a formal parameter of a subprogram declaration, and
313 -- we are compiling the body, we want the declaration for the
314 -- actual subtype to carry the source position of the body, to
315 -- prevent anomalies in gdb when stepping through the code.
317 if Is_Formal (N) then
319 Decl : constant Node_Id := Unit_Declaration_Node (Scope (N));
321 if Nkind (Decl) = N_Subprogram_Declaration
322 and then Present (Corresponding_Body (Decl))
324 Loc := Sloc (Corresponding_Body (Decl));
333 if Is_Array_Type (T) then
334 Constraints := New_List;
335 for J in 1 .. Number_Dimensions (T) loop
337 -- Build an array subtype declaration with the nominal subtype and
338 -- the bounds of the actual. Add the declaration in front of the
339 -- local declarations for the subprogram, for analysis before any
340 -- reference to the formal in the body.
343 Make_Attribute_Reference (Loc,
345 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
346 Attribute_Name => Name_First,
347 Expressions => New_List (
348 Make_Integer_Literal (Loc, J)));
351 Make_Attribute_Reference (Loc,
353 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
354 Attribute_Name => Name_Last,
355 Expressions => New_List (
356 Make_Integer_Literal (Loc, J)));
358 Append (Make_Range (Loc, Lo, Hi), Constraints);
361 -- If the type has unknown discriminants there is no constrained
362 -- subtype to build. This is never called for a formal or for a
363 -- lhs, so returning the type is ok ???
365 elsif Has_Unknown_Discriminants (T) then
369 Constraints := New_List;
371 -- Type T is a generic derived type, inherit the discriminants from
374 if Is_Private_Type (T)
375 and then No (Full_View (T))
377 -- T was flagged as an error if it was declared as a formal
378 -- derived type with known discriminants. In this case there
379 -- is no need to look at the parent type since T already carries
380 -- its own discriminants.
382 and then not Error_Posted (T)
384 Disc_Type := Etype (Base_Type (T));
389 Discr := First_Discriminant (Disc_Type);
390 while Present (Discr) loop
391 Append_To (Constraints,
392 Make_Selected_Component (Loc,
394 Duplicate_Subexpr_No_Checks (Obj),
395 Selector_Name => New_Occurrence_Of (Discr, Loc)));
396 Next_Discriminant (Discr);
401 Make_Defining_Identifier (Loc,
402 Chars => New_Internal_Name ('S'));
403 Set_Is_Internal (Subt);
406 Make_Subtype_Declaration (Loc,
407 Defining_Identifier => Subt,
408 Subtype_Indication =>
409 Make_Subtype_Indication (Loc,
410 Subtype_Mark => New_Reference_To (T, Loc),
412 Make_Index_Or_Discriminant_Constraint (Loc,
413 Constraints => Constraints)));
415 Mark_Rewrite_Insertion (Decl);
417 end Build_Actual_Subtype;
419 ---------------------------------------
420 -- Build_Actual_Subtype_Of_Component --
421 ---------------------------------------
423 function Build_Actual_Subtype_Of_Component
425 N : Node_Id) return Node_Id
427 Loc : constant Source_Ptr := Sloc (N);
428 P : constant Node_Id := Prefix (N);
431 Indx_Type : Entity_Id;
433 Deaccessed_T : Entity_Id;
434 -- This is either a copy of T, or if T is an access type, then it is
435 -- the directly designated type of this access type.
437 function Build_Actual_Array_Constraint return List_Id;
438 -- If one or more of the bounds of the component depends on
439 -- discriminants, build actual constraint using the discriminants
442 function Build_Actual_Record_Constraint return List_Id;
443 -- Similar to previous one, for discriminated components constrained
444 -- by the discriminant of the enclosing object.
446 -----------------------------------
447 -- Build_Actual_Array_Constraint --
448 -----------------------------------
450 function Build_Actual_Array_Constraint return List_Id is
451 Constraints : constant List_Id := New_List;
459 Indx := First_Index (Deaccessed_T);
460 while Present (Indx) loop
461 Old_Lo := Type_Low_Bound (Etype (Indx));
462 Old_Hi := Type_High_Bound (Etype (Indx));
464 if Denotes_Discriminant (Old_Lo) then
466 Make_Selected_Component (Loc,
467 Prefix => New_Copy_Tree (P),
468 Selector_Name => New_Occurrence_Of (Entity (Old_Lo), Loc));
471 Lo := New_Copy_Tree (Old_Lo);
473 -- The new bound will be reanalyzed in the enclosing
474 -- declaration. For literal bounds that come from a type
475 -- declaration, the type of the context must be imposed, so
476 -- insure that analysis will take place. For non-universal
477 -- types this is not strictly necessary.
479 Set_Analyzed (Lo, False);
482 if Denotes_Discriminant (Old_Hi) then
484 Make_Selected_Component (Loc,
485 Prefix => New_Copy_Tree (P),
486 Selector_Name => New_Occurrence_Of (Entity (Old_Hi), Loc));
489 Hi := New_Copy_Tree (Old_Hi);
490 Set_Analyzed (Hi, False);
493 Append (Make_Range (Loc, Lo, Hi), Constraints);
498 end Build_Actual_Array_Constraint;
500 ------------------------------------
501 -- Build_Actual_Record_Constraint --
502 ------------------------------------
504 function Build_Actual_Record_Constraint return List_Id is
505 Constraints : constant List_Id := New_List;
510 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
511 while Present (D) loop
512 if Denotes_Discriminant (Node (D)) then
513 D_Val := Make_Selected_Component (Loc,
514 Prefix => New_Copy_Tree (P),
515 Selector_Name => New_Occurrence_Of (Entity (Node (D)), Loc));
518 D_Val := New_Copy_Tree (Node (D));
521 Append (D_Val, Constraints);
526 end Build_Actual_Record_Constraint;
528 -- Start of processing for Build_Actual_Subtype_Of_Component
531 -- Why the test for Spec_Expression mode here???
533 if In_Spec_Expression then
536 -- More comments for the rest of this body would be good ???
538 elsif Nkind (N) = N_Explicit_Dereference then
539 if Is_Composite_Type (T)
540 and then not Is_Constrained (T)
541 and then not (Is_Class_Wide_Type (T)
542 and then Is_Constrained (Root_Type (T)))
543 and then not Has_Unknown_Discriminants (T)
545 -- If the type of the dereference is already constrained, it
546 -- is an actual subtype.
548 if Is_Array_Type (Etype (N))
549 and then Is_Constrained (Etype (N))
553 Remove_Side_Effects (P);
554 return Build_Actual_Subtype (T, N);
561 if Ekind (T) = E_Access_Subtype then
562 Deaccessed_T := Designated_Type (T);
567 if Ekind (Deaccessed_T) = E_Array_Subtype then
568 Id := First_Index (Deaccessed_T);
569 while Present (Id) loop
570 Indx_Type := Underlying_Type (Etype (Id));
572 if Denotes_Discriminant (Type_Low_Bound (Indx_Type))
574 Denotes_Discriminant (Type_High_Bound (Indx_Type))
576 Remove_Side_Effects (P);
578 Build_Component_Subtype
579 (Build_Actual_Array_Constraint, Loc, Base_Type (T));
585 elsif Is_Composite_Type (Deaccessed_T)
586 and then Has_Discriminants (Deaccessed_T)
587 and then not Has_Unknown_Discriminants (Deaccessed_T)
589 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
590 while Present (D) loop
591 if Denotes_Discriminant (Node (D)) then
592 Remove_Side_Effects (P);
594 Build_Component_Subtype (
595 Build_Actual_Record_Constraint, Loc, Base_Type (T));
602 -- If none of the above, the actual and nominal subtypes are the same
605 end Build_Actual_Subtype_Of_Component;
607 -----------------------------
608 -- Build_Component_Subtype --
609 -----------------------------
611 function Build_Component_Subtype
614 T : Entity_Id) return Node_Id
620 -- Unchecked_Union components do not require component subtypes
622 if Is_Unchecked_Union (T) then
627 Make_Defining_Identifier (Loc,
628 Chars => New_Internal_Name ('S'));
629 Set_Is_Internal (Subt);
632 Make_Subtype_Declaration (Loc,
633 Defining_Identifier => Subt,
634 Subtype_Indication =>
635 Make_Subtype_Indication (Loc,
636 Subtype_Mark => New_Reference_To (Base_Type (T), Loc),
638 Make_Index_Or_Discriminant_Constraint (Loc,
641 Mark_Rewrite_Insertion (Decl);
643 end Build_Component_Subtype;
645 ---------------------------
646 -- Build_Default_Subtype --
647 ---------------------------
649 function Build_Default_Subtype
651 N : Node_Id) return Entity_Id
653 Loc : constant Source_Ptr := Sloc (N);
657 if not Has_Discriminants (T) or else Is_Constrained (T) then
661 Disc := First_Discriminant (T);
663 if No (Discriminant_Default_Value (Disc)) then
668 Act : constant Entity_Id :=
669 Make_Defining_Identifier (Loc,
670 Chars => New_Internal_Name ('S'));
672 Constraints : constant List_Id := New_List;
676 while Present (Disc) loop
677 Append_To (Constraints,
678 New_Copy_Tree (Discriminant_Default_Value (Disc)));
679 Next_Discriminant (Disc);
683 Make_Subtype_Declaration (Loc,
684 Defining_Identifier => Act,
685 Subtype_Indication =>
686 Make_Subtype_Indication (Loc,
687 Subtype_Mark => New_Occurrence_Of (T, Loc),
689 Make_Index_Or_Discriminant_Constraint (Loc,
690 Constraints => Constraints)));
692 Insert_Action (N, Decl);
696 end Build_Default_Subtype;
698 --------------------------------------------
699 -- Build_Discriminal_Subtype_Of_Component --
700 --------------------------------------------
702 function Build_Discriminal_Subtype_Of_Component
703 (T : Entity_Id) return Node_Id
705 Loc : constant Source_Ptr := Sloc (T);
709 function Build_Discriminal_Array_Constraint return List_Id;
710 -- If one or more of the bounds of the component depends on
711 -- discriminants, build actual constraint using the discriminants
714 function Build_Discriminal_Record_Constraint return List_Id;
715 -- Similar to previous one, for discriminated components constrained
716 -- by the discriminant of the enclosing object.
718 ----------------------------------------
719 -- Build_Discriminal_Array_Constraint --
720 ----------------------------------------
722 function Build_Discriminal_Array_Constraint return List_Id is
723 Constraints : constant List_Id := New_List;
731 Indx := First_Index (T);
732 while Present (Indx) loop
733 Old_Lo := Type_Low_Bound (Etype (Indx));
734 Old_Hi := Type_High_Bound (Etype (Indx));
736 if Denotes_Discriminant (Old_Lo) then
737 Lo := New_Occurrence_Of (Discriminal (Entity (Old_Lo)), Loc);
740 Lo := New_Copy_Tree (Old_Lo);
743 if Denotes_Discriminant (Old_Hi) then
744 Hi := New_Occurrence_Of (Discriminal (Entity (Old_Hi)), Loc);
747 Hi := New_Copy_Tree (Old_Hi);
750 Append (Make_Range (Loc, Lo, Hi), Constraints);
755 end Build_Discriminal_Array_Constraint;
757 -----------------------------------------
758 -- Build_Discriminal_Record_Constraint --
759 -----------------------------------------
761 function Build_Discriminal_Record_Constraint return List_Id is
762 Constraints : constant List_Id := New_List;
767 D := First_Elmt (Discriminant_Constraint (T));
768 while Present (D) loop
769 if Denotes_Discriminant (Node (D)) then
771 New_Occurrence_Of (Discriminal (Entity (Node (D))), Loc);
774 D_Val := New_Copy_Tree (Node (D));
777 Append (D_Val, Constraints);
782 end Build_Discriminal_Record_Constraint;
784 -- Start of processing for Build_Discriminal_Subtype_Of_Component
787 if Ekind (T) = E_Array_Subtype then
788 Id := First_Index (T);
789 while Present (Id) loop
790 if Denotes_Discriminant (Type_Low_Bound (Etype (Id))) or else
791 Denotes_Discriminant (Type_High_Bound (Etype (Id)))
793 return Build_Component_Subtype
794 (Build_Discriminal_Array_Constraint, Loc, T);
800 elsif Ekind (T) = E_Record_Subtype
801 and then Has_Discriminants (T)
802 and then not Has_Unknown_Discriminants (T)
804 D := First_Elmt (Discriminant_Constraint (T));
805 while Present (D) loop
806 if Denotes_Discriminant (Node (D)) then
807 return Build_Component_Subtype
808 (Build_Discriminal_Record_Constraint, Loc, T);
815 -- If none of the above, the actual and nominal subtypes are the same
818 end Build_Discriminal_Subtype_Of_Component;
820 ------------------------------
821 -- Build_Elaboration_Entity --
822 ------------------------------
824 procedure Build_Elaboration_Entity (N : Node_Id; Spec_Id : Entity_Id) is
825 Loc : constant Source_Ptr := Sloc (N);
827 Elab_Ent : Entity_Id;
829 procedure Set_Package_Name (Ent : Entity_Id);
830 -- Given an entity, sets the fully qualified name of the entity in
831 -- Name_Buffer, with components separated by double underscores. This
832 -- is a recursive routine that climbs the scope chain to Standard.
834 ----------------------
835 -- Set_Package_Name --
836 ----------------------
838 procedure Set_Package_Name (Ent : Entity_Id) is
840 if Scope (Ent) /= Standard_Standard then
841 Set_Package_Name (Scope (Ent));
844 Nam : constant String := Get_Name_String (Chars (Ent));
846 Name_Buffer (Name_Len + 1) := '_';
847 Name_Buffer (Name_Len + 2) := '_';
848 Name_Buffer (Name_Len + 3 .. Name_Len + Nam'Length + 2) := Nam;
849 Name_Len := Name_Len + Nam'Length + 2;
853 Get_Name_String (Chars (Ent));
855 end Set_Package_Name;
857 -- Start of processing for Build_Elaboration_Entity
860 -- Ignore if already constructed
862 if Present (Elaboration_Entity (Spec_Id)) then
866 -- Construct name of elaboration entity as xxx_E, where xxx is the unit
867 -- name with dots replaced by double underscore. We have to manually
868 -- construct this name, since it will be elaborated in the outer scope,
869 -- and thus will not have the unit name automatically prepended.
871 Set_Package_Name (Spec_Id);
875 Name_Buffer (Name_Len + 1) := '_';
876 Name_Buffer (Name_Len + 2) := 'E';
877 Name_Len := Name_Len + 2;
879 -- Create elaboration flag
882 Make_Defining_Identifier (Loc, Chars => Name_Find);
883 Set_Elaboration_Entity (Spec_Id, Elab_Ent);
886 Make_Object_Declaration (Loc,
887 Defining_Identifier => Elab_Ent,
889 New_Occurrence_Of (Standard_Boolean, Loc),
891 New_Occurrence_Of (Standard_False, Loc));
893 Push_Scope (Standard_Standard);
894 Add_Global_Declaration (Decl);
897 -- Reset True_Constant indication, since we will indeed assign a value
898 -- to the variable in the binder main. We also kill the Current_Value
899 -- and Last_Assignment fields for the same reason.
901 Set_Is_True_Constant (Elab_Ent, False);
902 Set_Current_Value (Elab_Ent, Empty);
903 Set_Last_Assignment (Elab_Ent, Empty);
905 -- We do not want any further qualification of the name (if we did
906 -- not do this, we would pick up the name of the generic package
907 -- in the case of a library level generic instantiation).
909 Set_Has_Qualified_Name (Elab_Ent);
910 Set_Has_Fully_Qualified_Name (Elab_Ent);
911 end Build_Elaboration_Entity;
913 -----------------------------------
914 -- Cannot_Raise_Constraint_Error --
915 -----------------------------------
917 function Cannot_Raise_Constraint_Error (Expr : Node_Id) return Boolean is
919 if Compile_Time_Known_Value (Expr) then
922 elsif Do_Range_Check (Expr) then
925 elsif Raises_Constraint_Error (Expr) then
933 when N_Expanded_Name =>
936 when N_Selected_Component =>
937 return not Do_Discriminant_Check (Expr);
939 when N_Attribute_Reference =>
940 if Do_Overflow_Check (Expr) then
943 elsif No (Expressions (Expr)) then
951 N := First (Expressions (Expr));
952 while Present (N) loop
953 if Cannot_Raise_Constraint_Error (N) then
964 when N_Type_Conversion =>
965 if Do_Overflow_Check (Expr)
966 or else Do_Length_Check (Expr)
967 or else Do_Tag_Check (Expr)
972 Cannot_Raise_Constraint_Error (Expression (Expr));
975 when N_Unchecked_Type_Conversion =>
976 return Cannot_Raise_Constraint_Error (Expression (Expr));
979 if Do_Overflow_Check (Expr) then
983 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
990 if Do_Division_Check (Expr)
991 or else Do_Overflow_Check (Expr)
996 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
998 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1017 N_Op_Shift_Right_Arithmetic |
1021 if Do_Overflow_Check (Expr) then
1025 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
1027 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
1034 end Cannot_Raise_Constraint_Error;
1036 -----------------------------------------
1037 -- Check_Dynamically_Tagged_Expression --
1038 -----------------------------------------
1040 procedure Check_Dynamically_Tagged_Expression
1043 Related_Nod : Node_Id)
1046 pragma Assert (Is_Tagged_Type (Typ));
1048 -- In order to avoid spurious errors when analyzing the expanded code,
1049 -- this check is done only for nodes that come from source and for
1050 -- actuals of generic instantiations.
1052 if (Comes_From_Source (Related_Nod)
1053 or else In_Generic_Actual (Expr))
1054 and then (Is_Class_Wide_Type (Etype (Expr))
1055 or else Is_Dynamically_Tagged (Expr))
1056 and then Is_Tagged_Type (Typ)
1057 and then not Is_Class_Wide_Type (Typ)
1059 Error_Msg_N ("dynamically tagged expression not allowed!", Expr);
1061 end Check_Dynamically_Tagged_Expression;
1063 --------------------------
1064 -- Check_Fully_Declared --
1065 --------------------------
1067 procedure Check_Fully_Declared (T : Entity_Id; N : Node_Id) is
1069 if Ekind (T) = E_Incomplete_Type then
1071 -- Ada 2005 (AI-50217): If the type is available through a limited
1072 -- with_clause, verify that its full view has been analyzed.
1074 if From_With_Type (T)
1075 and then Present (Non_Limited_View (T))
1076 and then Ekind (Non_Limited_View (T)) /= E_Incomplete_Type
1078 -- The non-limited view is fully declared
1083 ("premature usage of incomplete}", N, First_Subtype (T));
1086 -- Need comments for these tests ???
1088 elsif Has_Private_Component (T)
1089 and then not Is_Generic_Type (Root_Type (T))
1090 and then not In_Spec_Expression
1092 -- Special case: if T is the anonymous type created for a single
1093 -- task or protected object, use the name of the source object.
1095 if Is_Concurrent_Type (T)
1096 and then not Comes_From_Source (T)
1097 and then Nkind (N) = N_Object_Declaration
1099 Error_Msg_NE ("type of& has incomplete component", N,
1100 Defining_Identifier (N));
1104 ("premature usage of incomplete}", N, First_Subtype (T));
1107 end Check_Fully_Declared;
1109 -------------------------
1110 -- Check_Nested_Access --
1111 -------------------------
1113 procedure Check_Nested_Access (Ent : Entity_Id) is
1114 Scop : constant Entity_Id := Current_Scope;
1115 Current_Subp : Entity_Id;
1116 Enclosing : Entity_Id;
1119 -- Currently only enabled for VM back-ends for efficiency, should we
1120 -- enable it more systematically ???
1122 -- Check for Is_Imported needs commenting below ???
1124 if VM_Target /= No_VM
1125 and then (Ekind (Ent) = E_Variable
1127 Ekind (Ent) = E_Constant
1129 Ekind (Ent) = E_Loop_Parameter)
1130 and then Scope (Ent) /= Empty
1131 and then not Is_Library_Level_Entity (Ent)
1132 and then not Is_Imported (Ent)
1134 if Is_Subprogram (Scop)
1135 or else Is_Generic_Subprogram (Scop)
1136 or else Is_Entry (Scop)
1138 Current_Subp := Scop;
1140 Current_Subp := Current_Subprogram;
1143 Enclosing := Enclosing_Subprogram (Ent);
1145 if Enclosing /= Empty
1146 and then Enclosing /= Current_Subp
1148 Set_Has_Up_Level_Access (Ent, True);
1151 end Check_Nested_Access;
1153 ------------------------------------------
1154 -- Check_Potentially_Blocking_Operation --
1155 ------------------------------------------
1157 procedure Check_Potentially_Blocking_Operation (N : Node_Id) is
1160 -- N is one of the potentially blocking operations listed in 9.5.1(8).
1161 -- When pragma Detect_Blocking is active, the run time will raise
1162 -- Program_Error. Here we only issue a warning, since we generally
1163 -- support the use of potentially blocking operations in the absence
1166 -- Indirect blocking through a subprogram call cannot be diagnosed
1167 -- statically without interprocedural analysis, so we do not attempt
1170 S := Scope (Current_Scope);
1171 while Present (S) and then S /= Standard_Standard loop
1172 if Is_Protected_Type (S) then
1174 ("potentially blocking operation in protected operation?", N);
1181 end Check_Potentially_Blocking_Operation;
1183 ------------------------------
1184 -- Check_Unprotected_Access --
1185 ------------------------------
1187 procedure Check_Unprotected_Access
1191 Cont_Encl_Typ : Entity_Id;
1192 Pref_Encl_Typ : Entity_Id;
1194 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id;
1195 -- Check whether Obj is a private component of a protected object.
1196 -- Return the protected type where the component resides, Empty
1199 function Is_Public_Operation return Boolean;
1200 -- Verify that the enclosing operation is callable from outside the
1201 -- protected object, to minimize false positives.
1203 ------------------------------
1204 -- Enclosing_Protected_Type --
1205 ------------------------------
1207 function Enclosing_Protected_Type (Obj : Node_Id) return Entity_Id is
1209 if Is_Entity_Name (Obj) then
1211 Ent : Entity_Id := Entity (Obj);
1214 -- The object can be a renaming of a private component, use
1215 -- the original record component.
1217 if Is_Prival (Ent) then
1218 Ent := Prival_Link (Ent);
1221 if Is_Protected_Type (Scope (Ent)) then
1227 -- For indexed and selected components, recursively check the prefix
1229 if Nkind_In (Obj, N_Indexed_Component, N_Selected_Component) then
1230 return Enclosing_Protected_Type (Prefix (Obj));
1232 -- The object does not denote a protected component
1237 end Enclosing_Protected_Type;
1239 -------------------------
1240 -- Is_Public_Operation --
1241 -------------------------
1243 function Is_Public_Operation return Boolean is
1250 and then S /= Pref_Encl_Typ
1252 if Scope (S) = Pref_Encl_Typ then
1253 E := First_Entity (Pref_Encl_Typ);
1255 and then E /= First_Private_Entity (Pref_Encl_Typ)
1268 end Is_Public_Operation;
1270 -- Start of processing for Check_Unprotected_Access
1273 if Nkind (Expr) = N_Attribute_Reference
1274 and then Attribute_Name (Expr) = Name_Unchecked_Access
1276 Cont_Encl_Typ := Enclosing_Protected_Type (Context);
1277 Pref_Encl_Typ := Enclosing_Protected_Type (Prefix (Expr));
1279 -- Check whether we are trying to export a protected component to a
1280 -- context with an equal or lower access level.
1282 if Present (Pref_Encl_Typ)
1283 and then No (Cont_Encl_Typ)
1284 and then Is_Public_Operation
1285 and then Scope_Depth (Pref_Encl_Typ) >=
1286 Object_Access_Level (Context)
1289 ("?possible unprotected access to protected data", Expr);
1292 end Check_Unprotected_Access;
1298 procedure Check_VMS (Construct : Node_Id) is
1300 if not OpenVMS_On_Target then
1302 ("this construct is allowed only in Open'V'M'S", Construct);
1306 ------------------------
1307 -- Collect_Interfaces --
1308 ------------------------
1310 procedure Collect_Interfaces
1312 Ifaces_List : out Elist_Id;
1313 Exclude_Parents : Boolean := False;
1314 Use_Full_View : Boolean := True)
1316 procedure Collect (Typ : Entity_Id);
1317 -- Subsidiary subprogram used to traverse the whole list
1318 -- of directly and indirectly implemented interfaces
1324 procedure Collect (Typ : Entity_Id) is
1325 Ancestor : Entity_Id;
1333 -- Handle private types
1336 and then Is_Private_Type (Typ)
1337 and then Present (Full_View (Typ))
1339 Full_T := Full_View (Typ);
1342 -- Include the ancestor if we are generating the whole list of
1343 -- abstract interfaces.
1345 if Etype (Full_T) /= Typ
1347 -- Protect the frontend against wrong sources. For example:
1350 -- type A is tagged null record;
1351 -- type B is new A with private;
1352 -- type C is new A with private;
1354 -- type B is new C with null record;
1355 -- type C is new B with null record;
1358 and then Etype (Full_T) /= T
1360 Ancestor := Etype (Full_T);
1363 if Is_Interface (Ancestor)
1364 and then not Exclude_Parents
1366 Append_Unique_Elmt (Ancestor, Ifaces_List);
1370 -- Traverse the graph of ancestor interfaces
1372 if Is_Non_Empty_List (Abstract_Interface_List (Full_T)) then
1373 Id := First (Abstract_Interface_List (Full_T));
1374 while Present (Id) loop
1375 Iface := Etype (Id);
1377 -- Protect against wrong uses. For example:
1378 -- type I is interface;
1379 -- type O is tagged null record;
1380 -- type Wrong is new I and O with null record; -- ERROR
1382 if Is_Interface (Iface) then
1384 and then Etype (T) /= T
1385 and then Interface_Present_In_Ancestor (Etype (T), Iface)
1390 Append_Unique_Elmt (Iface, Ifaces_List);
1399 -- Start of processing for Collect_Interfaces
1402 pragma Assert (Is_Tagged_Type (T) or else Is_Concurrent_Type (T));
1403 Ifaces_List := New_Elmt_List;
1405 end Collect_Interfaces;
1407 ----------------------------------
1408 -- Collect_Interface_Components --
1409 ----------------------------------
1411 procedure Collect_Interface_Components
1412 (Tagged_Type : Entity_Id;
1413 Components_List : out Elist_Id)
1415 procedure Collect (Typ : Entity_Id);
1416 -- Subsidiary subprogram used to climb to the parents
1422 procedure Collect (Typ : Entity_Id) is
1423 Tag_Comp : Entity_Id;
1424 Parent_Typ : Entity_Id;
1427 -- Handle private types
1429 if Present (Full_View (Etype (Typ))) then
1430 Parent_Typ := Full_View (Etype (Typ));
1432 Parent_Typ := Etype (Typ);
1435 if Parent_Typ /= Typ
1437 -- Protect the frontend against wrong sources. For example:
1440 -- type A is tagged null record;
1441 -- type B is new A with private;
1442 -- type C is new A with private;
1444 -- type B is new C with null record;
1445 -- type C is new B with null record;
1448 and then Parent_Typ /= Tagged_Type
1450 Collect (Parent_Typ);
1453 -- Collect the components containing tags of secondary dispatch
1456 Tag_Comp := Next_Tag_Component (First_Tag_Component (Typ));
1457 while Present (Tag_Comp) loop
1458 pragma Assert (Present (Related_Type (Tag_Comp)));
1459 Append_Elmt (Tag_Comp, Components_List);
1461 Tag_Comp := Next_Tag_Component (Tag_Comp);
1465 -- Start of processing for Collect_Interface_Components
1468 pragma Assert (Ekind (Tagged_Type) = E_Record_Type
1469 and then Is_Tagged_Type (Tagged_Type));
1471 Components_List := New_Elmt_List;
1472 Collect (Tagged_Type);
1473 end Collect_Interface_Components;
1475 -----------------------------
1476 -- Collect_Interfaces_Info --
1477 -----------------------------
1479 procedure Collect_Interfaces_Info
1481 Ifaces_List : out Elist_Id;
1482 Components_List : out Elist_Id;
1483 Tags_List : out Elist_Id)
1485 Comps_List : Elist_Id;
1486 Comp_Elmt : Elmt_Id;
1487 Comp_Iface : Entity_Id;
1488 Iface_Elmt : Elmt_Id;
1491 function Search_Tag (Iface : Entity_Id) return Entity_Id;
1492 -- Search for the secondary tag associated with the interface type
1493 -- Iface that is implemented by T.
1499 function Search_Tag (Iface : Entity_Id) return Entity_Id is
1503 ADT := Next_Elmt (Next_Elmt (First_Elmt (Access_Disp_Table (T))));
1505 and then Ekind (Node (ADT)) = E_Constant
1506 and then Related_Type (Node (ADT)) /= Iface
1508 -- Skip the secondary dispatch tables of Iface
1516 pragma Assert (Ekind (Node (ADT)) = E_Constant);
1520 -- Start of processing for Collect_Interfaces_Info
1523 Collect_Interfaces (T, Ifaces_List);
1524 Collect_Interface_Components (T, Comps_List);
1526 -- Search for the record component and tag associated with each
1527 -- interface type of T.
1529 Components_List := New_Elmt_List;
1530 Tags_List := New_Elmt_List;
1532 Iface_Elmt := First_Elmt (Ifaces_List);
1533 while Present (Iface_Elmt) loop
1534 Iface := Node (Iface_Elmt);
1536 -- Associate the primary tag component and the primary dispatch table
1537 -- with all the interfaces that are parents of T
1539 if Is_Ancestor (Iface, T) then
1540 Append_Elmt (First_Tag_Component (T), Components_List);
1541 Append_Elmt (Node (First_Elmt (Access_Disp_Table (T))), Tags_List);
1543 -- Otherwise search for the tag component and secondary dispatch
1547 Comp_Elmt := First_Elmt (Comps_List);
1548 while Present (Comp_Elmt) loop
1549 Comp_Iface := Related_Type (Node (Comp_Elmt));
1551 if Comp_Iface = Iface
1552 or else Is_Ancestor (Iface, Comp_Iface)
1554 Append_Elmt (Node (Comp_Elmt), Components_List);
1555 Append_Elmt (Search_Tag (Comp_Iface), Tags_List);
1559 Next_Elmt (Comp_Elmt);
1561 pragma Assert (Present (Comp_Elmt));
1564 Next_Elmt (Iface_Elmt);
1566 end Collect_Interfaces_Info;
1568 ----------------------------------
1569 -- Collect_Primitive_Operations --
1570 ----------------------------------
1572 function Collect_Primitive_Operations (T : Entity_Id) return Elist_Id is
1573 B_Type : constant Entity_Id := Base_Type (T);
1574 B_Decl : constant Node_Id := Original_Node (Parent (B_Type));
1575 B_Scope : Entity_Id := Scope (B_Type);
1579 Formal_Derived : Boolean := False;
1583 -- For tagged types, the primitive operations are collected as they
1584 -- are declared, and held in an explicit list which is simply returned.
1586 if Is_Tagged_Type (B_Type) then
1587 return Primitive_Operations (B_Type);
1589 -- An untagged generic type that is a derived type inherits the
1590 -- primitive operations of its parent type. Other formal types only
1591 -- have predefined operators, which are not explicitly represented.
1593 elsif Is_Generic_Type (B_Type) then
1594 if Nkind (B_Decl) = N_Formal_Type_Declaration
1595 and then Nkind (Formal_Type_Definition (B_Decl))
1596 = N_Formal_Derived_Type_Definition
1598 Formal_Derived := True;
1600 return New_Elmt_List;
1604 Op_List := New_Elmt_List;
1606 if B_Scope = Standard_Standard then
1607 if B_Type = Standard_String then
1608 Append_Elmt (Standard_Op_Concat, Op_List);
1610 elsif B_Type = Standard_Wide_String then
1611 Append_Elmt (Standard_Op_Concatw, Op_List);
1617 elsif (Is_Package_Or_Generic_Package (B_Scope)
1619 Nkind (Parent (Declaration_Node (First_Subtype (T)))) /=
1621 or else Is_Derived_Type (B_Type)
1623 -- The primitive operations appear after the base type, except
1624 -- if the derivation happens within the private part of B_Scope
1625 -- and the type is a private type, in which case both the type
1626 -- and some primitive operations may appear before the base
1627 -- type, and the list of candidates starts after the type.
1629 if In_Open_Scopes (B_Scope)
1630 and then Scope (T) = B_Scope
1631 and then In_Private_Part (B_Scope)
1633 Id := Next_Entity (T);
1635 Id := Next_Entity (B_Type);
1638 while Present (Id) loop
1640 -- Note that generic formal subprograms are not
1641 -- considered to be primitive operations and thus
1642 -- are never inherited.
1644 if Is_Overloadable (Id)
1645 and then Nkind (Parent (Parent (Id)))
1646 not in N_Formal_Subprogram_Declaration
1650 if Base_Type (Etype (Id)) = B_Type then
1653 Formal := First_Formal (Id);
1654 while Present (Formal) loop
1655 if Base_Type (Etype (Formal)) = B_Type then
1659 elsif Ekind (Etype (Formal)) = E_Anonymous_Access_Type
1661 (Designated_Type (Etype (Formal))) = B_Type
1667 Next_Formal (Formal);
1671 -- For a formal derived type, the only primitives are the
1672 -- ones inherited from the parent type. Operations appearing
1673 -- in the package declaration are not primitive for it.
1676 and then (not Formal_Derived
1677 or else Present (Alias (Id)))
1679 Append_Elmt (Id, Op_List);
1685 -- For a type declared in System, some of its operations
1686 -- may appear in the target-specific extension to System.
1689 and then Chars (B_Scope) = Name_System
1690 and then Scope (B_Scope) = Standard_Standard
1691 and then Present_System_Aux
1693 B_Scope := System_Aux_Id;
1694 Id := First_Entity (System_Aux_Id);
1700 end Collect_Primitive_Operations;
1702 -----------------------------------
1703 -- Compile_Time_Constraint_Error --
1704 -----------------------------------
1706 function Compile_Time_Constraint_Error
1709 Ent : Entity_Id := Empty;
1710 Loc : Source_Ptr := No_Location;
1711 Warn : Boolean := False) return Node_Id
1713 Msgc : String (1 .. Msg'Length + 2);
1714 -- Copy of message, with room for possible ? and ! at end
1724 -- A static constraint error in an instance body is not a fatal error.
1725 -- we choose to inhibit the message altogether, because there is no
1726 -- obvious node (for now) on which to post it. On the other hand the
1727 -- offending node must be replaced with a constraint_error in any case.
1729 -- No messages are generated if we already posted an error on this node
1731 if not Error_Posted (N) then
1732 if Loc /= No_Location then
1738 Msgc (1 .. Msg'Length) := Msg;
1741 -- Message is a warning, even in Ada 95 case
1743 if Msg (Msg'Last) = '?' then
1746 -- In Ada 83, all messages are warnings. In the private part and
1747 -- the body of an instance, constraint_checks are only warnings.
1748 -- We also make this a warning if the Warn parameter is set.
1751 or else (Ada_Version = Ada_83 and then Comes_From_Source (N))
1757 elsif In_Instance_Not_Visible then
1762 -- Otherwise we have a real error message (Ada 95 static case)
1763 -- and we make this an unconditional message. Note that in the
1764 -- warning case we do not make the message unconditional, it seems
1765 -- quite reasonable to delete messages like this (about exceptions
1766 -- that will be raised) in dead code.
1774 -- Should we generate a warning? The answer is not quite yes. The
1775 -- very annoying exception occurs in the case of a short circuit
1776 -- operator where the left operand is static and decisive. Climb
1777 -- parents to see if that is the case we have here. Conditional
1778 -- expressions with decisive conditions are a similar situation.
1786 -- And then with False as left operand
1788 if Nkind (P) = N_And_Then
1789 and then Compile_Time_Known_Value (Left_Opnd (P))
1790 and then Is_False (Expr_Value (Left_Opnd (P)))
1795 -- OR ELSE with True as left operand
1797 elsif Nkind (P) = N_Or_Else
1798 and then Compile_Time_Known_Value (Left_Opnd (P))
1799 and then Is_True (Expr_Value (Left_Opnd (P)))
1804 -- Conditional expression
1806 elsif Nkind (P) = N_Conditional_Expression then
1808 Cond : constant Node_Id := First (Expressions (P));
1809 Texp : constant Node_Id := Next (Cond);
1810 Fexp : constant Node_Id := Next (Texp);
1813 if Compile_Time_Known_Value (Cond) then
1815 -- Condition is True and we are in the right operand
1817 if Is_True (Expr_Value (Cond))
1818 and then OldP = Fexp
1823 -- Condition is False and we are in the left operand
1825 elsif Is_False (Expr_Value (Cond))
1826 and then OldP = Texp
1834 -- Special case for component association in aggregates, where
1835 -- we want to keep climbing up to the parent aggregate.
1837 elsif Nkind (P) = N_Component_Association
1838 and then Nkind (Parent (P)) = N_Aggregate
1842 -- Keep going if within subexpression
1845 exit when Nkind (P) not in N_Subexpr;
1850 if Present (Ent) then
1851 Error_Msg_NEL (Msgc (1 .. Msgl), N, Ent, Eloc);
1853 Error_Msg_NEL (Msgc (1 .. Msgl), N, Etype (N), Eloc);
1857 if Inside_Init_Proc then
1859 ("\?& will be raised for objects of this type",
1860 N, Standard_Constraint_Error, Eloc);
1863 ("\?& will be raised at run time",
1864 N, Standard_Constraint_Error, Eloc);
1869 ("\static expression fails Constraint_Check", Eloc);
1870 Set_Error_Posted (N);
1876 end Compile_Time_Constraint_Error;
1878 -----------------------
1879 -- Conditional_Delay --
1880 -----------------------
1882 procedure Conditional_Delay (New_Ent, Old_Ent : Entity_Id) is
1884 if Has_Delayed_Freeze (Old_Ent) and then not Is_Frozen (Old_Ent) then
1885 Set_Has_Delayed_Freeze (New_Ent);
1887 end Conditional_Delay;
1889 -------------------------
1890 -- Copy_Parameter_List --
1891 -------------------------
1893 function Copy_Parameter_List (Subp_Id : Entity_Id) return List_Id is
1894 Loc : constant Source_Ptr := Sloc (Subp_Id);
1899 if No (First_Formal (Subp_Id)) then
1903 Formal := First_Formal (Subp_Id);
1904 while Present (Formal) loop
1906 (Make_Parameter_Specification (Loc,
1907 Defining_Identifier =>
1908 Make_Defining_Identifier (Sloc (Formal),
1909 Chars => Chars (Formal)),
1910 In_Present => In_Present (Parent (Formal)),
1911 Out_Present => Out_Present (Parent (Formal)),
1913 New_Reference_To (Etype (Formal), Loc),
1915 New_Copy_Tree (Expression (Parent (Formal)))),
1918 Next_Formal (Formal);
1923 end Copy_Parameter_List;
1925 --------------------
1926 -- Current_Entity --
1927 --------------------
1929 -- The currently visible definition for a given identifier is the
1930 -- one most chained at the start of the visibility chain, i.e. the
1931 -- one that is referenced by the Node_Id value of the name of the
1932 -- given identifier.
1934 function Current_Entity (N : Node_Id) return Entity_Id is
1936 return Get_Name_Entity_Id (Chars (N));
1939 -----------------------------
1940 -- Current_Entity_In_Scope --
1941 -----------------------------
1943 function Current_Entity_In_Scope (N : Node_Id) return Entity_Id is
1945 CS : constant Entity_Id := Current_Scope;
1947 Transient_Case : constant Boolean := Scope_Is_Transient;
1950 E := Get_Name_Entity_Id (Chars (N));
1952 and then Scope (E) /= CS
1953 and then (not Transient_Case or else Scope (E) /= Scope (CS))
1959 end Current_Entity_In_Scope;
1965 function Current_Scope return Entity_Id is
1967 if Scope_Stack.Last = -1 then
1968 return Standard_Standard;
1971 C : constant Entity_Id :=
1972 Scope_Stack.Table (Scope_Stack.Last).Entity;
1977 return Standard_Standard;
1983 ------------------------
1984 -- Current_Subprogram --
1985 ------------------------
1987 function Current_Subprogram return Entity_Id is
1988 Scop : constant Entity_Id := Current_Scope;
1990 if Is_Subprogram (Scop) or else Is_Generic_Subprogram (Scop) then
1993 return Enclosing_Subprogram (Scop);
1995 end Current_Subprogram;
1997 ---------------------
1998 -- Defining_Entity --
1999 ---------------------
2001 function Defining_Entity (N : Node_Id) return Entity_Id is
2002 K : constant Node_Kind := Nkind (N);
2003 Err : Entity_Id := Empty;
2008 N_Subprogram_Declaration |
2009 N_Abstract_Subprogram_Declaration |
2011 N_Package_Declaration |
2012 N_Subprogram_Renaming_Declaration |
2013 N_Subprogram_Body_Stub |
2014 N_Generic_Subprogram_Declaration |
2015 N_Generic_Package_Declaration |
2016 N_Formal_Subprogram_Declaration
2018 return Defining_Entity (Specification (N));
2021 N_Component_Declaration |
2022 N_Defining_Program_Unit_Name |
2023 N_Discriminant_Specification |
2025 N_Entry_Declaration |
2026 N_Entry_Index_Specification |
2027 N_Exception_Declaration |
2028 N_Exception_Renaming_Declaration |
2029 N_Formal_Object_Declaration |
2030 N_Formal_Package_Declaration |
2031 N_Formal_Type_Declaration |
2032 N_Full_Type_Declaration |
2033 N_Implicit_Label_Declaration |
2034 N_Incomplete_Type_Declaration |
2035 N_Loop_Parameter_Specification |
2036 N_Number_Declaration |
2037 N_Object_Declaration |
2038 N_Object_Renaming_Declaration |
2039 N_Package_Body_Stub |
2040 N_Parameter_Specification |
2041 N_Private_Extension_Declaration |
2042 N_Private_Type_Declaration |
2044 N_Protected_Body_Stub |
2045 N_Protected_Type_Declaration |
2046 N_Single_Protected_Declaration |
2047 N_Single_Task_Declaration |
2048 N_Subtype_Declaration |
2051 N_Task_Type_Declaration
2053 return Defining_Identifier (N);
2056 return Defining_Entity (Proper_Body (N));
2059 N_Function_Instantiation |
2060 N_Function_Specification |
2061 N_Generic_Function_Renaming_Declaration |
2062 N_Generic_Package_Renaming_Declaration |
2063 N_Generic_Procedure_Renaming_Declaration |
2065 N_Package_Instantiation |
2066 N_Package_Renaming_Declaration |
2067 N_Package_Specification |
2068 N_Procedure_Instantiation |
2069 N_Procedure_Specification
2072 Nam : constant Node_Id := Defining_Unit_Name (N);
2075 if Nkind (Nam) in N_Entity then
2078 -- For Error, make up a name and attach to declaration
2079 -- so we can continue semantic analysis
2081 elsif Nam = Error then
2083 Make_Defining_Identifier (Sloc (N),
2084 Chars => New_Internal_Name ('T'));
2085 Set_Defining_Unit_Name (N, Err);
2088 -- If not an entity, get defining identifier
2091 return Defining_Identifier (Nam);
2095 when N_Block_Statement =>
2096 return Entity (Identifier (N));
2099 raise Program_Error;
2102 end Defining_Entity;
2104 --------------------------
2105 -- Denotes_Discriminant --
2106 --------------------------
2108 function Denotes_Discriminant
2110 Check_Concurrent : Boolean := False) return Boolean
2114 if not Is_Entity_Name (N)
2115 or else No (Entity (N))
2122 -- If we are checking for a protected type, the discriminant may have
2123 -- been rewritten as the corresponding discriminal of the original type
2124 -- or of the corresponding concurrent record, depending on whether we
2125 -- are in the spec or body of the protected type.
2127 return Ekind (E) = E_Discriminant
2130 and then Ekind (E) = E_In_Parameter
2131 and then Present (Discriminal_Link (E))
2133 (Is_Concurrent_Type (Scope (Discriminal_Link (E)))
2135 Is_Concurrent_Record_Type (Scope (Discriminal_Link (E)))));
2137 end Denotes_Discriminant;
2139 ----------------------
2140 -- Denotes_Variable --
2141 ----------------------
2143 function Denotes_Variable (N : Node_Id) return Boolean is
2145 return Is_Variable (N) and then Paren_Count (N) = 0;
2146 end Denotes_Variable;
2148 -----------------------------
2149 -- Depends_On_Discriminant --
2150 -----------------------------
2152 function Depends_On_Discriminant (N : Node_Id) return Boolean is
2157 Get_Index_Bounds (N, L, H);
2158 return Denotes_Discriminant (L) or else Denotes_Discriminant (H);
2159 end Depends_On_Discriminant;
2161 -------------------------
2162 -- Designate_Same_Unit --
2163 -------------------------
2165 function Designate_Same_Unit
2167 Name2 : Node_Id) return Boolean
2169 K1 : constant Node_Kind := Nkind (Name1);
2170 K2 : constant Node_Kind := Nkind (Name2);
2172 function Prefix_Node (N : Node_Id) return Node_Id;
2173 -- Returns the parent unit name node of a defining program unit name
2174 -- or the prefix if N is a selected component or an expanded name.
2176 function Select_Node (N : Node_Id) return Node_Id;
2177 -- Returns the defining identifier node of a defining program unit
2178 -- name or the selector node if N is a selected component or an
2185 function Prefix_Node (N : Node_Id) return Node_Id is
2187 if Nkind (N) = N_Defining_Program_Unit_Name then
2199 function Select_Node (N : Node_Id) return Node_Id is
2201 if Nkind (N) = N_Defining_Program_Unit_Name then
2202 return Defining_Identifier (N);
2205 return Selector_Name (N);
2209 -- Start of processing for Designate_Next_Unit
2212 if (K1 = N_Identifier or else
2213 K1 = N_Defining_Identifier)
2215 (K2 = N_Identifier or else
2216 K2 = N_Defining_Identifier)
2218 return Chars (Name1) = Chars (Name2);
2221 (K1 = N_Expanded_Name or else
2222 K1 = N_Selected_Component or else
2223 K1 = N_Defining_Program_Unit_Name)
2225 (K2 = N_Expanded_Name or else
2226 K2 = N_Selected_Component or else
2227 K2 = N_Defining_Program_Unit_Name)
2230 (Chars (Select_Node (Name1)) = Chars (Select_Node (Name2)))
2232 Designate_Same_Unit (Prefix_Node (Name1), Prefix_Node (Name2));
2237 end Designate_Same_Unit;
2239 ----------------------------
2240 -- Enclosing_Generic_Body --
2241 ----------------------------
2243 function Enclosing_Generic_Body
2244 (N : Node_Id) return Node_Id
2252 while Present (P) loop
2253 if Nkind (P) = N_Package_Body
2254 or else Nkind (P) = N_Subprogram_Body
2256 Spec := Corresponding_Spec (P);
2258 if Present (Spec) then
2259 Decl := Unit_Declaration_Node (Spec);
2261 if Nkind (Decl) = N_Generic_Package_Declaration
2262 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2273 end Enclosing_Generic_Body;
2275 ----------------------------
2276 -- Enclosing_Generic_Unit --
2277 ----------------------------
2279 function Enclosing_Generic_Unit
2280 (N : Node_Id) return Node_Id
2288 while Present (P) loop
2289 if Nkind (P) = N_Generic_Package_Declaration
2290 or else Nkind (P) = N_Generic_Subprogram_Declaration
2294 elsif Nkind (P) = N_Package_Body
2295 or else Nkind (P) = N_Subprogram_Body
2297 Spec := Corresponding_Spec (P);
2299 if Present (Spec) then
2300 Decl := Unit_Declaration_Node (Spec);
2302 if Nkind (Decl) = N_Generic_Package_Declaration
2303 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
2314 end Enclosing_Generic_Unit;
2316 -------------------------------
2317 -- Enclosing_Lib_Unit_Entity --
2318 -------------------------------
2320 function Enclosing_Lib_Unit_Entity return Entity_Id is
2321 Unit_Entity : Entity_Id;
2324 -- Look for enclosing library unit entity by following scope links.
2325 -- Equivalent to, but faster than indexing through the scope stack.
2327 Unit_Entity := Current_Scope;
2328 while (Present (Scope (Unit_Entity))
2329 and then Scope (Unit_Entity) /= Standard_Standard)
2330 and not Is_Child_Unit (Unit_Entity)
2332 Unit_Entity := Scope (Unit_Entity);
2336 end Enclosing_Lib_Unit_Entity;
2338 -----------------------------
2339 -- Enclosing_Lib_Unit_Node --
2340 -----------------------------
2342 function Enclosing_Lib_Unit_Node (N : Node_Id) return Node_Id is
2343 Current_Node : Node_Id;
2347 while Present (Current_Node)
2348 and then Nkind (Current_Node) /= N_Compilation_Unit
2350 Current_Node := Parent (Current_Node);
2353 if Nkind (Current_Node) /= N_Compilation_Unit then
2357 return Current_Node;
2358 end Enclosing_Lib_Unit_Node;
2360 --------------------------
2361 -- Enclosing_Subprogram --
2362 --------------------------
2364 function Enclosing_Subprogram (E : Entity_Id) return Entity_Id is
2365 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
2368 if Dynamic_Scope = Standard_Standard then
2371 elsif Dynamic_Scope = Empty then
2374 elsif Ekind (Dynamic_Scope) = E_Subprogram_Body then
2375 return Corresponding_Spec (Parent (Parent (Dynamic_Scope)));
2377 elsif Ekind (Dynamic_Scope) = E_Block
2378 or else Ekind (Dynamic_Scope) = E_Return_Statement
2380 return Enclosing_Subprogram (Dynamic_Scope);
2382 elsif Ekind (Dynamic_Scope) = E_Task_Type then
2383 return Get_Task_Body_Procedure (Dynamic_Scope);
2385 elsif Convention (Dynamic_Scope) = Convention_Protected then
2386 return Protected_Body_Subprogram (Dynamic_Scope);
2389 return Dynamic_Scope;
2391 end Enclosing_Subprogram;
2393 ------------------------
2394 -- Ensure_Freeze_Node --
2395 ------------------------
2397 procedure Ensure_Freeze_Node (E : Entity_Id) is
2401 if No (Freeze_Node (E)) then
2402 FN := Make_Freeze_Entity (Sloc (E));
2403 Set_Has_Delayed_Freeze (E);
2404 Set_Freeze_Node (E, FN);
2405 Set_Access_Types_To_Process (FN, No_Elist);
2406 Set_TSS_Elist (FN, No_Elist);
2409 end Ensure_Freeze_Node;
2415 procedure Enter_Name (Def_Id : Entity_Id) is
2416 C : constant Entity_Id := Current_Entity (Def_Id);
2417 E : constant Entity_Id := Current_Entity_In_Scope (Def_Id);
2418 S : constant Entity_Id := Current_Scope;
2421 Generate_Definition (Def_Id);
2423 -- Add new name to current scope declarations. Check for duplicate
2424 -- declaration, which may or may not be a genuine error.
2428 -- Case of previous entity entered because of a missing declaration
2429 -- or else a bad subtype indication. Best is to use the new entity,
2430 -- and make the previous one invisible.
2432 if Etype (E) = Any_Type then
2433 Set_Is_Immediately_Visible (E, False);
2435 -- Case of renaming declaration constructed for package instances.
2436 -- if there is an explicit declaration with the same identifier,
2437 -- the renaming is not immediately visible any longer, but remains
2438 -- visible through selected component notation.
2440 elsif Nkind (Parent (E)) = N_Package_Renaming_Declaration
2441 and then not Comes_From_Source (E)
2443 Set_Is_Immediately_Visible (E, False);
2445 -- The new entity may be the package renaming, which has the same
2446 -- same name as a generic formal which has been seen already.
2448 elsif Nkind (Parent (Def_Id)) = N_Package_Renaming_Declaration
2449 and then not Comes_From_Source (Def_Id)
2451 Set_Is_Immediately_Visible (E, False);
2453 -- For a fat pointer corresponding to a remote access to subprogram,
2454 -- we use the same identifier as the RAS type, so that the proper
2455 -- name appears in the stub. This type is only retrieved through
2456 -- the RAS type and never by visibility, and is not added to the
2457 -- visibility list (see below).
2459 elsif Nkind (Parent (Def_Id)) = N_Full_Type_Declaration
2460 and then Present (Corresponding_Remote_Type (Def_Id))
2464 -- A controller component for a type extension overrides the
2465 -- inherited component.
2467 elsif Chars (E) = Name_uController then
2470 -- Case of an implicit operation or derived literal. The new entity
2471 -- hides the implicit one, which is removed from all visibility,
2472 -- i.e. the entity list of its scope, and homonym chain of its name.
2474 elsif (Is_Overloadable (E) and then Is_Inherited_Operation (E))
2475 or else Is_Internal (E)
2479 Prev_Vis : Entity_Id;
2480 Decl : constant Node_Id := Parent (E);
2483 -- If E is an implicit declaration, it cannot be the first
2484 -- entity in the scope.
2486 Prev := First_Entity (Current_Scope);
2487 while Present (Prev)
2488 and then Next_Entity (Prev) /= E
2495 -- If E is not on the entity chain of the current scope,
2496 -- it is an implicit declaration in the generic formal
2497 -- part of a generic subprogram. When analyzing the body,
2498 -- the generic formals are visible but not on the entity
2499 -- chain of the subprogram. The new entity will become
2500 -- the visible one in the body.
2503 (Nkind (Parent (Decl)) = N_Generic_Subprogram_Declaration);
2507 Set_Next_Entity (Prev, Next_Entity (E));
2509 if No (Next_Entity (Prev)) then
2510 Set_Last_Entity (Current_Scope, Prev);
2513 if E = Current_Entity (E) then
2517 Prev_Vis := Current_Entity (E);
2518 while Homonym (Prev_Vis) /= E loop
2519 Prev_Vis := Homonym (Prev_Vis);
2523 if Present (Prev_Vis) then
2525 -- Skip E in the visibility chain
2527 Set_Homonym (Prev_Vis, Homonym (E));
2530 Set_Name_Entity_Id (Chars (E), Homonym (E));
2535 -- This section of code could use a comment ???
2537 elsif Present (Etype (E))
2538 and then Is_Concurrent_Type (Etype (E))
2543 -- If the homograph is a protected component renaming, it should not
2544 -- be hiding the current entity. Such renamings are treated as weak
2547 elsif Is_Prival (E) then
2548 Set_Is_Immediately_Visible (E, False);
2550 -- In this case the current entity is a protected component renaming.
2551 -- Perform minimal decoration by setting the scope and return since
2552 -- the prival should not be hiding other visible entities.
2554 elsif Is_Prival (Def_Id) then
2555 Set_Scope (Def_Id, Current_Scope);
2558 -- Analogous to privals, the discriminal generated for an entry
2559 -- index parameter acts as a weak declaration. Perform minimal
2560 -- decoration to avoid bogus errors.
2562 elsif Is_Discriminal (Def_Id)
2563 and then Ekind (Discriminal_Link (Def_Id)) = E_Entry_Index_Parameter
2565 Set_Scope (Def_Id, Current_Scope);
2568 -- In the body or private part of an instance, a type extension
2569 -- may introduce a component with the same name as that of an
2570 -- actual. The legality rule is not enforced, but the semantics
2571 -- of the full type with two components of the same name are not
2572 -- clear at this point ???
2574 elsif In_Instance_Not_Visible then
2577 -- When compiling a package body, some child units may have become
2578 -- visible. They cannot conflict with local entities that hide them.
2580 elsif Is_Child_Unit (E)
2581 and then In_Open_Scopes (Scope (E))
2582 and then not Is_Immediately_Visible (E)
2586 -- Conversely, with front-end inlining we may compile the parent
2587 -- body first, and a child unit subsequently. The context is now
2588 -- the parent spec, and body entities are not visible.
2590 elsif Is_Child_Unit (Def_Id)
2591 and then Is_Package_Body_Entity (E)
2592 and then not In_Package_Body (Current_Scope)
2596 -- Case of genuine duplicate declaration
2599 Error_Msg_Sloc := Sloc (E);
2601 -- If the previous declaration is an incomplete type declaration
2602 -- this may be an attempt to complete it with a private type.
2603 -- The following avoids confusing cascaded errors.
2605 if Nkind (Parent (E)) = N_Incomplete_Type_Declaration
2606 and then Nkind (Parent (Def_Id)) = N_Private_Type_Declaration
2609 ("incomplete type cannot be completed with a private " &
2610 "declaration", Parent (Def_Id));
2611 Set_Is_Immediately_Visible (E, False);
2612 Set_Full_View (E, Def_Id);
2614 -- An inherited component of a record conflicts with a new
2615 -- discriminant. The discriminant is inserted first in the scope,
2616 -- but the error should be posted on it, not on the component.
2618 elsif Ekind (E) = E_Discriminant
2619 and then Present (Scope (Def_Id))
2620 and then Scope (Def_Id) /= Current_Scope
2622 Error_Msg_Sloc := Sloc (Def_Id);
2623 Error_Msg_N ("& conflicts with declaration#", E);
2626 -- If the name of the unit appears in its own context clause,
2627 -- a dummy package with the name has already been created, and
2628 -- the error emitted. Try to continue quietly.
2630 elsif Error_Posted (E)
2631 and then Sloc (E) = No_Location
2632 and then Nkind (Parent (E)) = N_Package_Specification
2633 and then Current_Scope = Standard_Standard
2635 Set_Scope (Def_Id, Current_Scope);
2639 Error_Msg_N ("& conflicts with declaration#", Def_Id);
2641 -- Avoid cascaded messages with duplicate components in
2644 if Ekind (E) = E_Component
2645 or else Ekind (E) = E_Discriminant
2651 if Nkind (Parent (Parent (Def_Id))) =
2652 N_Generic_Subprogram_Declaration
2654 Defining_Entity (Specification (Parent (Parent (Def_Id))))
2656 Error_Msg_N ("\generic units cannot be overloaded", Def_Id);
2659 -- If entity is in standard, then we are in trouble, because
2660 -- it means that we have a library package with a duplicated
2661 -- name. That's hard to recover from, so abort!
2663 if S = Standard_Standard then
2664 raise Unrecoverable_Error;
2666 -- Otherwise we continue with the declaration. Having two
2667 -- identical declarations should not cause us too much trouble!
2675 -- If we fall through, declaration is OK , or OK enough to continue
2677 -- If Def_Id is a discriminant or a record component we are in the
2678 -- midst of inheriting components in a derived record definition.
2679 -- Preserve their Ekind and Etype.
2681 if Ekind (Def_Id) = E_Discriminant
2682 or else Ekind (Def_Id) = E_Component
2686 -- If a type is already set, leave it alone (happens whey a type
2687 -- declaration is reanalyzed following a call to the optimizer)
2689 elsif Present (Etype (Def_Id)) then
2692 -- Otherwise, the kind E_Void insures that premature uses of the entity
2693 -- will be detected. Any_Type insures that no cascaded errors will occur
2696 Set_Ekind (Def_Id, E_Void);
2697 Set_Etype (Def_Id, Any_Type);
2700 -- Inherited discriminants and components in derived record types are
2701 -- immediately visible. Itypes are not.
2703 if Ekind (Def_Id) = E_Discriminant
2704 or else Ekind (Def_Id) = E_Component
2705 or else (No (Corresponding_Remote_Type (Def_Id))
2706 and then not Is_Itype (Def_Id))
2708 Set_Is_Immediately_Visible (Def_Id);
2709 Set_Current_Entity (Def_Id);
2712 Set_Homonym (Def_Id, C);
2713 Append_Entity (Def_Id, S);
2714 Set_Public_Status (Def_Id);
2716 -- Warn if new entity hides an old one
2718 if Warn_On_Hiding and then Present (C)
2720 -- Don't warn for record components since they always have a well
2721 -- defined scope which does not confuse other uses. Note that in
2722 -- some cases, Ekind has not been set yet.
2724 and then Ekind (C) /= E_Component
2725 and then Ekind (C) /= E_Discriminant
2726 and then Nkind (Parent (C)) /= N_Component_Declaration
2727 and then Ekind (Def_Id) /= E_Component
2728 and then Ekind (Def_Id) /= E_Discriminant
2729 and then Nkind (Parent (Def_Id)) /= N_Component_Declaration
2731 -- Don't warn for one character variables. It is too common to use
2732 -- such variables as locals and will just cause too many false hits.
2734 and then Length_Of_Name (Chars (C)) /= 1
2736 -- Don't warn for non-source entities
2738 and then Comes_From_Source (C)
2739 and then Comes_From_Source (Def_Id)
2741 -- Don't warn unless entity in question is in extended main source
2743 and then In_Extended_Main_Source_Unit (Def_Id)
2745 -- Finally, the hidden entity must be either immediately visible
2746 -- or use visible (from a used package)
2749 (Is_Immediately_Visible (C)
2751 Is_Potentially_Use_Visible (C))
2753 Error_Msg_Sloc := Sloc (C);
2754 Error_Msg_N ("declaration hides &#?", Def_Id);
2758 --------------------------
2759 -- Explain_Limited_Type --
2760 --------------------------
2762 procedure Explain_Limited_Type (T : Entity_Id; N : Node_Id) is
2766 -- For array, component type must be limited
2768 if Is_Array_Type (T) then
2769 Error_Msg_Node_2 := T;
2771 ("\component type& of type& is limited", N, Component_Type (T));
2772 Explain_Limited_Type (Component_Type (T), N);
2774 elsif Is_Record_Type (T) then
2776 -- No need for extra messages if explicit limited record
2778 if Is_Limited_Record (Base_Type (T)) then
2782 -- Otherwise find a limited component. Check only components that
2783 -- come from source, or inherited components that appear in the
2784 -- source of the ancestor.
2786 C := First_Component (T);
2787 while Present (C) loop
2788 if Is_Limited_Type (Etype (C))
2790 (Comes_From_Source (C)
2792 (Present (Original_Record_Component (C))
2794 Comes_From_Source (Original_Record_Component (C))))
2796 Error_Msg_Node_2 := T;
2797 Error_Msg_NE ("\component& of type& has limited type", N, C);
2798 Explain_Limited_Type (Etype (C), N);
2805 -- The type may be declared explicitly limited, even if no component
2806 -- of it is limited, in which case we fall out of the loop.
2809 end Explain_Limited_Type;
2815 procedure Find_Actual
2817 Formal : out Entity_Id;
2820 Parnt : constant Node_Id := Parent (N);
2824 if (Nkind (Parnt) = N_Indexed_Component
2826 Nkind (Parnt) = N_Selected_Component)
2827 and then N = Prefix (Parnt)
2829 Find_Actual (Parnt, Formal, Call);
2832 elsif Nkind (Parnt) = N_Parameter_Association
2833 and then N = Explicit_Actual_Parameter (Parnt)
2835 Call := Parent (Parnt);
2837 elsif Nkind (Parnt) = N_Procedure_Call_Statement then
2846 -- If we have a call to a subprogram look for the parameter. Note that
2847 -- we exclude overloaded calls, since we don't know enough to be sure
2848 -- of giving the right answer in this case.
2850 if Is_Entity_Name (Name (Call))
2851 and then Present (Entity (Name (Call)))
2852 and then Is_Overloadable (Entity (Name (Call)))
2853 and then not Is_Overloaded (Name (Call))
2855 -- Fall here if we are definitely a parameter
2857 Actual := First_Actual (Call);
2858 Formal := First_Formal (Entity (Name (Call)));
2859 while Present (Formal) and then Present (Actual) loop
2863 Actual := Next_Actual (Actual);
2864 Formal := Next_Formal (Formal);
2869 -- Fall through here if we did not find matching actual
2875 -------------------------------------
2876 -- Find_Corresponding_Discriminant --
2877 -------------------------------------
2879 function Find_Corresponding_Discriminant
2881 Typ : Entity_Id) return Entity_Id
2883 Par_Disc : Entity_Id;
2884 Old_Disc : Entity_Id;
2885 New_Disc : Entity_Id;
2888 Par_Disc := Original_Record_Component (Original_Discriminant (Id));
2890 -- The original type may currently be private, and the discriminant
2891 -- only appear on its full view.
2893 if Is_Private_Type (Scope (Par_Disc))
2894 and then not Has_Discriminants (Scope (Par_Disc))
2895 and then Present (Full_View (Scope (Par_Disc)))
2897 Old_Disc := First_Discriminant (Full_View (Scope (Par_Disc)));
2899 Old_Disc := First_Discriminant (Scope (Par_Disc));
2902 if Is_Class_Wide_Type (Typ) then
2903 New_Disc := First_Discriminant (Root_Type (Typ));
2905 New_Disc := First_Discriminant (Typ);
2908 while Present (Old_Disc) and then Present (New_Disc) loop
2909 if Old_Disc = Par_Disc then
2912 Next_Discriminant (Old_Disc);
2913 Next_Discriminant (New_Disc);
2917 -- Should always find it
2919 raise Program_Error;
2920 end Find_Corresponding_Discriminant;
2922 --------------------------
2923 -- Find_Overlaid_Entity --
2924 --------------------------
2926 procedure Find_Overlaid_Entity
2928 Ent : out Entity_Id;
2934 -- We are looking for one of the two following forms:
2936 -- for X'Address use Y'Address
2940 -- Const : constant Address := expr;
2942 -- for X'Address use Const;
2944 -- In the second case, the expr is either Y'Address, or recursively a
2945 -- constant that eventually references Y'Address.
2950 if Nkind (N) = N_Attribute_Definition_Clause
2951 and then Chars (N) = Name_Address
2953 Expr := Expression (N);
2955 -- This loop checks the form of the expression for Y'Address,
2956 -- using recursion to deal with intermediate constants.
2959 -- Check for Y'Address
2961 if Nkind (Expr) = N_Attribute_Reference
2962 and then Attribute_Name (Expr) = Name_Address
2964 Expr := Prefix (Expr);
2967 -- Check for Const where Const is a constant entity
2969 elsif Is_Entity_Name (Expr)
2970 and then Ekind (Entity (Expr)) = E_Constant
2972 Expr := Constant_Value (Entity (Expr));
2974 -- Anything else does not need checking
2981 -- This loop checks the form of the prefix for an entity,
2982 -- using recursion to deal with intermediate components.
2985 -- Check for Y where Y is an entity
2987 if Is_Entity_Name (Expr) then
2988 Ent := Entity (Expr);
2991 -- Check for components
2994 Nkind_In (Expr, N_Selected_Component, N_Indexed_Component) then
2996 Expr := Prefix (Expr);
2999 -- Anything else does not need checking
3006 end Find_Overlaid_Entity;
3008 -------------------------
3009 -- Find_Parameter_Type --
3010 -------------------------
3012 function Find_Parameter_Type (Param : Node_Id) return Entity_Id is
3014 if Nkind (Param) /= N_Parameter_Specification then
3017 -- For an access parameter, obtain the type from the formal entity
3018 -- itself, because access to subprogram nodes do not carry a type.
3019 -- Shouldn't we always use the formal entity ???
3021 elsif Nkind (Parameter_Type (Param)) = N_Access_Definition then
3022 return Etype (Defining_Identifier (Param));
3025 return Etype (Parameter_Type (Param));
3027 end Find_Parameter_Type;
3029 -----------------------------
3030 -- Find_Static_Alternative --
3031 -----------------------------
3033 function Find_Static_Alternative (N : Node_Id) return Node_Id is
3034 Expr : constant Node_Id := Expression (N);
3035 Val : constant Uint := Expr_Value (Expr);
3040 Alt := First (Alternatives (N));
3043 if Nkind (Alt) /= N_Pragma then
3044 Choice := First (Discrete_Choices (Alt));
3045 while Present (Choice) loop
3047 -- Others choice, always matches
3049 if Nkind (Choice) = N_Others_Choice then
3052 -- Range, check if value is in the range
3054 elsif Nkind (Choice) = N_Range then
3056 Val >= Expr_Value (Low_Bound (Choice))
3058 Val <= Expr_Value (High_Bound (Choice));
3060 -- Choice is a subtype name. Note that we know it must
3061 -- be a static subtype, since otherwise it would have
3062 -- been diagnosed as illegal.
3064 elsif Is_Entity_Name (Choice)
3065 and then Is_Type (Entity (Choice))
3067 exit Search when Is_In_Range (Expr, Etype (Choice),
3068 Assume_Valid => False);
3070 -- Choice is a subtype indication
3072 elsif Nkind (Choice) = N_Subtype_Indication then
3074 C : constant Node_Id := Constraint (Choice);
3075 R : constant Node_Id := Range_Expression (C);
3079 Val >= Expr_Value (Low_Bound (R))
3081 Val <= Expr_Value (High_Bound (R));
3084 -- Choice is a simple expression
3087 exit Search when Val = Expr_Value (Choice);
3095 pragma Assert (Present (Alt));
3098 -- The above loop *must* terminate by finding a match, since
3099 -- we know the case statement is valid, and the value of the
3100 -- expression is known at compile time. When we fall out of
3101 -- the loop, Alt points to the alternative that we know will
3102 -- be selected at run time.
3105 end Find_Static_Alternative;
3111 function First_Actual (Node : Node_Id) return Node_Id is
3115 if No (Parameter_Associations (Node)) then
3119 N := First (Parameter_Associations (Node));
3121 if Nkind (N) = N_Parameter_Association then
3122 return First_Named_Actual (Node);
3128 -------------------------
3129 -- Full_Qualified_Name --
3130 -------------------------
3132 function Full_Qualified_Name (E : Entity_Id) return String_Id is
3134 pragma Warnings (Off, Res);
3136 function Internal_Full_Qualified_Name (E : Entity_Id) return String_Id;
3137 -- Compute recursively the qualified name without NUL at the end
3139 ----------------------------------
3140 -- Internal_Full_Qualified_Name --
3141 ----------------------------------
3143 function Internal_Full_Qualified_Name (E : Entity_Id) return String_Id is
3144 Ent : Entity_Id := E;
3145 Parent_Name : String_Id := No_String;
3148 -- Deals properly with child units
3150 if Nkind (Ent) = N_Defining_Program_Unit_Name then
3151 Ent := Defining_Identifier (Ent);
3154 -- Compute qualification recursively (only "Standard" has no scope)
3156 if Present (Scope (Scope (Ent))) then
3157 Parent_Name := Internal_Full_Qualified_Name (Scope (Ent));
3160 -- Every entity should have a name except some expanded blocks
3161 -- don't bother about those.
3163 if Chars (Ent) = No_Name then
3167 -- Add a period between Name and qualification
3169 if Parent_Name /= No_String then
3170 Start_String (Parent_Name);
3171 Store_String_Char (Get_Char_Code ('.'));
3177 -- Generates the entity name in upper case
3179 Get_Decoded_Name_String (Chars (Ent));
3181 Store_String_Chars (Name_Buffer (1 .. Name_Len));
3183 end Internal_Full_Qualified_Name;
3185 -- Start of processing for Full_Qualified_Name
3188 Res := Internal_Full_Qualified_Name (E);
3189 Store_String_Char (Get_Char_Code (ASCII.NUL));
3191 end Full_Qualified_Name;
3193 -----------------------
3194 -- Gather_Components --
3195 -----------------------
3197 procedure Gather_Components
3199 Comp_List : Node_Id;
3200 Governed_By : List_Id;
3202 Report_Errors : out Boolean)
3206 Discrete_Choice : Node_Id;
3207 Comp_Item : Node_Id;
3209 Discrim : Entity_Id;
3210 Discrim_Name : Node_Id;
3211 Discrim_Value : Node_Id;
3214 Report_Errors := False;
3216 if No (Comp_List) or else Null_Present (Comp_List) then
3219 elsif Present (Component_Items (Comp_List)) then
3220 Comp_Item := First (Component_Items (Comp_List));
3226 while Present (Comp_Item) loop
3228 -- Skip the tag of a tagged record, the interface tags, as well
3229 -- as all items that are not user components (anonymous types,
3230 -- rep clauses, Parent field, controller field).
3232 if Nkind (Comp_Item) = N_Component_Declaration then
3234 Comp : constant Entity_Id := Defining_Identifier (Comp_Item);
3236 if not Is_Tag (Comp)
3237 and then Chars (Comp) /= Name_uParent
3238 and then Chars (Comp) /= Name_uController
3240 Append_Elmt (Comp, Into);
3248 if No (Variant_Part (Comp_List)) then
3251 Discrim_Name := Name (Variant_Part (Comp_List));
3252 Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
3255 -- Look for the discriminant that governs this variant part.
3256 -- The discriminant *must* be in the Governed_By List
3258 Assoc := First (Governed_By);
3259 Find_Constraint : loop
3260 Discrim := First (Choices (Assoc));
3261 exit Find_Constraint when Chars (Discrim_Name) = Chars (Discrim)
3262 or else (Present (Corresponding_Discriminant (Entity (Discrim)))
3264 Chars (Corresponding_Discriminant (Entity (Discrim)))
3265 = Chars (Discrim_Name))
3266 or else Chars (Original_Record_Component (Entity (Discrim)))
3267 = Chars (Discrim_Name);
3269 if No (Next (Assoc)) then
3270 if not Is_Constrained (Typ)
3271 and then Is_Derived_Type (Typ)
3272 and then Present (Stored_Constraint (Typ))
3274 -- If the type is a tagged type with inherited discriminants,
3275 -- use the stored constraint on the parent in order to find
3276 -- the values of discriminants that are otherwise hidden by an
3277 -- explicit constraint. Renamed discriminants are handled in
3280 -- If several parent discriminants are renamed by a single
3281 -- discriminant of the derived type, the call to obtain the
3282 -- Corresponding_Discriminant field only retrieves the last
3283 -- of them. We recover the constraint on the others from the
3284 -- Stored_Constraint as well.
3291 D := First_Discriminant (Etype (Typ));
3292 C := First_Elmt (Stored_Constraint (Typ));
3293 while Present (D) and then Present (C) loop
3294 if Chars (Discrim_Name) = Chars (D) then
3295 if Is_Entity_Name (Node (C))
3296 and then Entity (Node (C)) = Entity (Discrim)
3298 -- D is renamed by Discrim, whose value is given in
3305 Make_Component_Association (Sloc (Typ),
3307 (New_Occurrence_Of (D, Sloc (Typ))),
3308 Duplicate_Subexpr_No_Checks (Node (C)));
3310 exit Find_Constraint;
3313 Next_Discriminant (D);
3320 if No (Next (Assoc)) then
3321 Error_Msg_NE (" missing value for discriminant&",
3322 First (Governed_By), Discrim_Name);
3323 Report_Errors := True;
3328 end loop Find_Constraint;
3330 Discrim_Value := Expression (Assoc);
3332 if not Is_OK_Static_Expression (Discrim_Value) then
3334 ("value for discriminant & must be static!",
3335 Discrim_Value, Discrim);
3336 Why_Not_Static (Discrim_Value);
3337 Report_Errors := True;
3341 Search_For_Discriminant_Value : declare
3347 UI_Discrim_Value : constant Uint := Expr_Value (Discrim_Value);
3350 Find_Discrete_Value : while Present (Variant) loop
3351 Discrete_Choice := First (Discrete_Choices (Variant));
3352 while Present (Discrete_Choice) loop
3354 exit Find_Discrete_Value when
3355 Nkind (Discrete_Choice) = N_Others_Choice;
3357 Get_Index_Bounds (Discrete_Choice, Low, High);
3359 UI_Low := Expr_Value (Low);
3360 UI_High := Expr_Value (High);
3362 exit Find_Discrete_Value when
3363 UI_Low <= UI_Discrim_Value
3365 UI_High >= UI_Discrim_Value;
3367 Next (Discrete_Choice);
3370 Next_Non_Pragma (Variant);
3371 end loop Find_Discrete_Value;
3372 end Search_For_Discriminant_Value;
3374 if No (Variant) then
3376 ("value of discriminant & is out of range", Discrim_Value, Discrim);
3377 Report_Errors := True;
3381 -- If we have found the corresponding choice, recursively add its
3382 -- components to the Into list.
3384 Gather_Components (Empty,
3385 Component_List (Variant), Governed_By, Into, Report_Errors);
3386 end Gather_Components;
3388 ------------------------
3389 -- Get_Actual_Subtype --
3390 ------------------------
3392 function Get_Actual_Subtype (N : Node_Id) return Entity_Id is
3393 Typ : constant Entity_Id := Etype (N);
3394 Utyp : Entity_Id := Underlying_Type (Typ);
3403 -- If what we have is an identifier that references a subprogram
3404 -- formal, or a variable or constant object, then we get the actual
3405 -- subtype from the referenced entity if one has been built.
3407 if Nkind (N) = N_Identifier
3409 (Is_Formal (Entity (N))
3410 or else Ekind (Entity (N)) = E_Constant
3411 or else Ekind (Entity (N)) = E_Variable)
3412 and then Present (Actual_Subtype (Entity (N)))
3414 return Actual_Subtype (Entity (N));
3416 -- Actual subtype of unchecked union is always itself. We never need
3417 -- the "real" actual subtype. If we did, we couldn't get it anyway
3418 -- because the discriminant is not available. The restrictions on
3419 -- Unchecked_Union are designed to make sure that this is OK.
3421 elsif Is_Unchecked_Union (Base_Type (Utyp)) then
3424 -- Here for the unconstrained case, we must find actual subtype
3425 -- No actual subtype is available, so we must build it on the fly.
3427 -- Checking the type, not the underlying type, for constrainedness
3428 -- seems to be necessary. Maybe all the tests should be on the type???
3430 elsif (not Is_Constrained (Typ))
3431 and then (Is_Array_Type (Utyp)
3432 or else (Is_Record_Type (Utyp)
3433 and then Has_Discriminants (Utyp)))
3434 and then not Has_Unknown_Discriminants (Utyp)
3435 and then not (Ekind (Utyp) = E_String_Literal_Subtype)
3437 -- Nothing to do if in spec expression (why not???)
3439 if In_Spec_Expression then
3442 elsif Is_Private_Type (Typ)
3443 and then not Has_Discriminants (Typ)
3445 -- If the type has no discriminants, there is no subtype to
3446 -- build, even if the underlying type is discriminated.
3450 -- Else build the actual subtype
3453 Decl := Build_Actual_Subtype (Typ, N);
3454 Atyp := Defining_Identifier (Decl);
3456 -- If Build_Actual_Subtype generated a new declaration then use it
3460 -- The actual subtype is an Itype, so analyze the declaration,
3461 -- but do not attach it to the tree, to get the type defined.
3463 Set_Parent (Decl, N);
3464 Set_Is_Itype (Atyp);
3465 Analyze (Decl, Suppress => All_Checks);
3466 Set_Associated_Node_For_Itype (Atyp, N);
3467 Set_Has_Delayed_Freeze (Atyp, False);
3469 -- We need to freeze the actual subtype immediately. This is
3470 -- needed, because otherwise this Itype will not get frozen
3471 -- at all, and it is always safe to freeze on creation because
3472 -- any associated types must be frozen at this point.
3474 Freeze_Itype (Atyp, N);
3477 -- Otherwise we did not build a declaration, so return original
3484 -- For all remaining cases, the actual subtype is the same as
3485 -- the nominal type.
3490 end Get_Actual_Subtype;
3492 -------------------------------------
3493 -- Get_Actual_Subtype_If_Available --
3494 -------------------------------------
3496 function Get_Actual_Subtype_If_Available (N : Node_Id) return Entity_Id is
3497 Typ : constant Entity_Id := Etype (N);
3500 -- If what we have is an identifier that references a subprogram
3501 -- formal, or a variable or constant object, then we get the actual
3502 -- subtype from the referenced entity if one has been built.
3504 if Nkind (N) = N_Identifier
3506 (Is_Formal (Entity (N))
3507 or else Ekind (Entity (N)) = E_Constant
3508 or else Ekind (Entity (N)) = E_Variable)
3509 and then Present (Actual_Subtype (Entity (N)))
3511 return Actual_Subtype (Entity (N));
3513 -- Otherwise the Etype of N is returned unchanged
3518 end Get_Actual_Subtype_If_Available;
3520 -------------------------------
3521 -- Get_Default_External_Name --
3522 -------------------------------
3524 function Get_Default_External_Name (E : Node_Or_Entity_Id) return Node_Id is
3526 Get_Decoded_Name_String (Chars (E));
3528 if Opt.External_Name_Imp_Casing = Uppercase then
3529 Set_Casing (All_Upper_Case);
3531 Set_Casing (All_Lower_Case);
3535 Make_String_Literal (Sloc (E),
3536 Strval => String_From_Name_Buffer);
3537 end Get_Default_External_Name;
3539 ---------------------------
3540 -- Get_Enum_Lit_From_Pos --
3541 ---------------------------
3543 function Get_Enum_Lit_From_Pos
3546 Loc : Source_Ptr) return Node_Id
3551 -- In the case where the literal is of type Character, Wide_Character
3552 -- or Wide_Wide_Character or of a type derived from them, there needs
3553 -- to be some special handling since there is no explicit chain of
3554 -- literals to search. Instead, an N_Character_Literal node is created
3555 -- with the appropriate Char_Code and Chars fields.
3557 if Is_Standard_Character_Type (T) then
3558 Set_Character_Literal_Name (UI_To_CC (Pos));
3560 Make_Character_Literal (Loc,
3562 Char_Literal_Value => Pos);
3564 -- For all other cases, we have a complete table of literals, and
3565 -- we simply iterate through the chain of literal until the one
3566 -- with the desired position value is found.
3570 Lit := First_Literal (Base_Type (T));
3571 for J in 1 .. UI_To_Int (Pos) loop
3575 return New_Occurrence_Of (Lit, Loc);
3577 end Get_Enum_Lit_From_Pos;
3579 ------------------------
3580 -- Get_Generic_Entity --
3581 ------------------------
3583 function Get_Generic_Entity (N : Node_Id) return Entity_Id is
3584 Ent : constant Entity_Id := Entity (Name (N));
3586 if Present (Renamed_Object (Ent)) then
3587 return Renamed_Object (Ent);
3591 end Get_Generic_Entity;
3593 ----------------------
3594 -- Get_Index_Bounds --
3595 ----------------------
3597 procedure Get_Index_Bounds (N : Node_Id; L, H : out Node_Id) is
3598 Kind : constant Node_Kind := Nkind (N);
3602 if Kind = N_Range then
3604 H := High_Bound (N);
3606 elsif Kind = N_Subtype_Indication then
3607 R := Range_Expression (Constraint (N));
3615 L := Low_Bound (Range_Expression (Constraint (N)));
3616 H := High_Bound (Range_Expression (Constraint (N)));
3619 elsif Is_Entity_Name (N) and then Is_Type (Entity (N)) then
3620 if Error_Posted (Scalar_Range (Entity (N))) then
3624 elsif Nkind (Scalar_Range (Entity (N))) = N_Subtype_Indication then
3625 Get_Index_Bounds (Scalar_Range (Entity (N)), L, H);
3628 L := Low_Bound (Scalar_Range (Entity (N)));
3629 H := High_Bound (Scalar_Range (Entity (N)));
3633 -- N is an expression, indicating a range with one value
3638 end Get_Index_Bounds;
3640 ----------------------------------
3641 -- Get_Library_Unit_Name_string --
3642 ----------------------------------
3644 procedure Get_Library_Unit_Name_String (Decl_Node : Node_Id) is
3645 Unit_Name_Id : constant Unit_Name_Type := Get_Unit_Name (Decl_Node);
3648 Get_Unit_Name_String (Unit_Name_Id);
3650 -- Remove seven last character (" (spec)" or " (body)")
3652 Name_Len := Name_Len - 7;
3653 pragma Assert (Name_Buffer (Name_Len + 1) = ' ');
3654 end Get_Library_Unit_Name_String;
3656 ------------------------
3657 -- Get_Name_Entity_Id --
3658 ------------------------
3660 function Get_Name_Entity_Id (Id : Name_Id) return Entity_Id is
3662 return Entity_Id (Get_Name_Table_Info (Id));
3663 end Get_Name_Entity_Id;
3669 function Get_Pragma_Id (N : Node_Id) return Pragma_Id is
3671 return Get_Pragma_Id (Pragma_Name (N));
3674 ---------------------------
3675 -- Get_Referenced_Object --
3676 ---------------------------
3678 function Get_Referenced_Object (N : Node_Id) return Node_Id is
3683 while Is_Entity_Name (R)
3684 and then Present (Renamed_Object (Entity (R)))
3686 R := Renamed_Object (Entity (R));
3690 end Get_Referenced_Object;
3692 ------------------------
3693 -- Get_Renamed_Entity --
3694 ------------------------
3696 function Get_Renamed_Entity (E : Entity_Id) return Entity_Id is
3701 while Present (Renamed_Entity (R)) loop
3702 R := Renamed_Entity (R);
3706 end Get_Renamed_Entity;
3708 -------------------------
3709 -- Get_Subprogram_Body --
3710 -------------------------
3712 function Get_Subprogram_Body (E : Entity_Id) return Node_Id is
3716 Decl := Unit_Declaration_Node (E);
3718 if Nkind (Decl) = N_Subprogram_Body then
3721 -- The below comment is bad, because it is possible for
3722 -- Nkind (Decl) to be an N_Subprogram_Body_Stub ???
3724 else -- Nkind (Decl) = N_Subprogram_Declaration
3726 if Present (Corresponding_Body (Decl)) then
3727 return Unit_Declaration_Node (Corresponding_Body (Decl));
3729 -- Imported subprogram case
3735 end Get_Subprogram_Body;
3737 ---------------------------
3738 -- Get_Subprogram_Entity --
3739 ---------------------------
3741 function Get_Subprogram_Entity (Nod : Node_Id) return Entity_Id is
3746 if Nkind (Nod) = N_Accept_Statement then
3747 Nam := Entry_Direct_Name (Nod);
3749 -- For an entry call, the prefix of the call is a selected component.
3750 -- Need additional code for internal calls ???
3752 elsif Nkind (Nod) = N_Entry_Call_Statement then
3753 if Nkind (Name (Nod)) = N_Selected_Component then
3754 Nam := Entity (Selector_Name (Name (Nod)));
3763 if Nkind (Nam) = N_Explicit_Dereference then
3764 Proc := Etype (Prefix (Nam));
3765 elsif Is_Entity_Name (Nam) then
3766 Proc := Entity (Nam);
3771 if Is_Object (Proc) then
3772 Proc := Etype (Proc);
3775 if Ekind (Proc) = E_Access_Subprogram_Type then
3776 Proc := Directly_Designated_Type (Proc);
3779 if not Is_Subprogram (Proc)
3780 and then Ekind (Proc) /= E_Subprogram_Type
3786 end Get_Subprogram_Entity;
3788 -----------------------------
3789 -- Get_Task_Body_Procedure --
3790 -----------------------------
3792 function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
3794 -- Note: A task type may be the completion of a private type with
3795 -- discriminants. When performing elaboration checks on a task
3796 -- declaration, the current view of the type may be the private one,
3797 -- and the procedure that holds the body of the task is held in its
3800 -- This is an odd function, why not have Task_Body_Procedure do
3801 -- the following digging???
3803 return Task_Body_Procedure (Underlying_Type (Root_Type (E)));
3804 end Get_Task_Body_Procedure;
3806 -----------------------
3807 -- Has_Access_Values --
3808 -----------------------
3810 function Has_Access_Values (T : Entity_Id) return Boolean is
3811 Typ : constant Entity_Id := Underlying_Type (T);
3814 -- Case of a private type which is not completed yet. This can only
3815 -- happen in the case of a generic format type appearing directly, or
3816 -- as a component of the type to which this function is being applied
3817 -- at the top level. Return False in this case, since we certainly do
3818 -- not know that the type contains access types.
3823 elsif Is_Access_Type (Typ) then
3826 elsif Is_Array_Type (Typ) then
3827 return Has_Access_Values (Component_Type (Typ));
3829 elsif Is_Record_Type (Typ) then
3834 -- Loop to Check components
3836 Comp := First_Component_Or_Discriminant (Typ);
3837 while Present (Comp) loop
3839 -- Check for access component, tag field does not count, even
3840 -- though it is implemented internally using an access type.
3842 if Has_Access_Values (Etype (Comp))
3843 and then Chars (Comp) /= Name_uTag
3848 Next_Component_Or_Discriminant (Comp);
3857 end Has_Access_Values;
3859 ------------------------------
3860 -- Has_Compatible_Alignment --
3861 ------------------------------
3863 function Has_Compatible_Alignment
3865 Expr : Node_Id) return Alignment_Result
3867 function Has_Compatible_Alignment_Internal
3870 Default : Alignment_Result) return Alignment_Result;
3871 -- This is the internal recursive function that actually does the work.
3872 -- There is one additional parameter, which says what the result should
3873 -- be if no alignment information is found, and there is no definite
3874 -- indication of compatible alignments. At the outer level, this is set
3875 -- to Unknown, but for internal recursive calls in the case where types
3876 -- are known to be correct, it is set to Known_Compatible.
3878 ---------------------------------------
3879 -- Has_Compatible_Alignment_Internal --
3880 ---------------------------------------
3882 function Has_Compatible_Alignment_Internal
3885 Default : Alignment_Result) return Alignment_Result
3887 Result : Alignment_Result := Known_Compatible;
3888 -- Holds the current status of the result. Note that once a value of
3889 -- Known_Incompatible is set, it is sticky and does not get changed
3890 -- to Unknown (the value in Result only gets worse as we go along,
3893 Offs : Uint := No_Uint;
3894 -- Set to a factor of the offset from the base object when Expr is a
3895 -- selected or indexed component, based on Component_Bit_Offset and
3896 -- Component_Size respectively. A negative value is used to represent
3897 -- a value which is not known at compile time.
3899 procedure Check_Prefix;
3900 -- Checks the prefix recursively in the case where the expression
3901 -- is an indexed or selected component.
3903 procedure Set_Result (R : Alignment_Result);
3904 -- If R represents a worse outcome (unknown instead of known
3905 -- compatible, or known incompatible), then set Result to R.
3911 procedure Check_Prefix is
3913 -- The subtlety here is that in doing a recursive call to check
3914 -- the prefix, we have to decide what to do in the case where we
3915 -- don't find any specific indication of an alignment problem.
3917 -- At the outer level, we normally set Unknown as the result in
3918 -- this case, since we can only set Known_Compatible if we really
3919 -- know that the alignment value is OK, but for the recursive
3920 -- call, in the case where the types match, and we have not
3921 -- specified a peculiar alignment for the object, we are only
3922 -- concerned about suspicious rep clauses, the default case does
3923 -- not affect us, since the compiler will, in the absence of such
3924 -- rep clauses, ensure that the alignment is correct.
3926 if Default = Known_Compatible
3928 (Etype (Obj) = Etype (Expr)
3929 and then (Unknown_Alignment (Obj)
3931 Alignment (Obj) = Alignment (Etype (Obj))))
3934 (Has_Compatible_Alignment_Internal
3935 (Obj, Prefix (Expr), Known_Compatible));
3937 -- In all other cases, we need a full check on the prefix
3941 (Has_Compatible_Alignment_Internal
3942 (Obj, Prefix (Expr), Unknown));
3950 procedure Set_Result (R : Alignment_Result) is
3957 -- Start of processing for Has_Compatible_Alignment_Internal
3960 -- If Expr is a selected component, we must make sure there is no
3961 -- potentially troublesome component clause, and that the record is
3964 if Nkind (Expr) = N_Selected_Component then
3966 -- Packed record always generate unknown alignment
3968 if Is_Packed (Etype (Prefix (Expr))) then
3969 Set_Result (Unknown);
3972 -- Check prefix and component offset
3975 Offs := Component_Bit_Offset (Entity (Selector_Name (Expr)));
3977 -- If Expr is an indexed component, we must make sure there is no
3978 -- potentially troublesome Component_Size clause and that the array
3979 -- is not bit-packed.
3981 elsif Nkind (Expr) = N_Indexed_Component then
3983 Typ : constant Entity_Id := Etype (Prefix (Expr));
3984 Ind : constant Node_Id := First_Index (Typ);
3987 -- Bit packed array always generates unknown alignment
3989 if Is_Bit_Packed_Array (Typ) then
3990 Set_Result (Unknown);
3993 -- Check prefix and component offset
3996 Offs := Component_Size (Typ);
3998 -- Small optimization: compute the full offset when possible
4001 and then Offs > Uint_0
4002 and then Present (Ind)
4003 and then Nkind (Ind) = N_Range
4004 and then Compile_Time_Known_Value (Low_Bound (Ind))
4005 and then Compile_Time_Known_Value (First (Expressions (Expr)))
4007 Offs := Offs * (Expr_Value (First (Expressions (Expr)))
4008 - Expr_Value (Low_Bound ((Ind))));
4013 -- If we have a null offset, the result is entirely determined by
4014 -- the base object and has already been computed recursively.
4016 if Offs = Uint_0 then
4019 -- Case where we know the alignment of the object
4021 elsif Known_Alignment (Obj) then
4023 ObjA : constant Uint := Alignment (Obj);
4024 ExpA : Uint := No_Uint;
4025 SizA : Uint := No_Uint;
4028 -- If alignment of Obj is 1, then we are always OK
4031 Set_Result (Known_Compatible);
4033 -- Alignment of Obj is greater than 1, so we need to check
4036 -- If we have an offset, see if it is compatible
4038 if Offs /= No_Uint and Offs > Uint_0 then
4039 if Offs mod (System_Storage_Unit * ObjA) /= 0 then
4040 Set_Result (Known_Incompatible);
4043 -- See if Expr is an object with known alignment
4045 elsif Is_Entity_Name (Expr)
4046 and then Known_Alignment (Entity (Expr))
4048 ExpA := Alignment (Entity (Expr));
4050 -- Otherwise, we can use the alignment of the type of
4051 -- Expr given that we already checked for
4052 -- discombobulating rep clauses for the cases of indexed
4053 -- and selected components above.
4055 elsif Known_Alignment (Etype (Expr)) then
4056 ExpA := Alignment (Etype (Expr));
4058 -- Otherwise the alignment is unknown
4061 Set_Result (Default);
4064 -- If we got an alignment, see if it is acceptable
4066 if ExpA /= No_Uint and then ExpA < ObjA then
4067 Set_Result (Known_Incompatible);
4070 -- If Expr is not a piece of a larger object, see if size
4071 -- is given. If so, check that it is not too small for the
4072 -- required alignment.
4074 if Offs /= No_Uint then
4077 -- See if Expr is an object with known size
4079 elsif Is_Entity_Name (Expr)
4080 and then Known_Static_Esize (Entity (Expr))
4082 SizA := Esize (Entity (Expr));
4084 -- Otherwise, we check the object size of the Expr type
4086 elsif Known_Static_Esize (Etype (Expr)) then
4087 SizA := Esize (Etype (Expr));
4090 -- If we got a size, see if it is a multiple of the Obj
4091 -- alignment, if not, then the alignment cannot be
4092 -- acceptable, since the size is always a multiple of the
4095 if SizA /= No_Uint then
4096 if SizA mod (ObjA * Ttypes.System_Storage_Unit) /= 0 then
4097 Set_Result (Known_Incompatible);
4103 -- If we do not know required alignment, any non-zero offset is a
4104 -- potential problem (but certainly may be OK, so result is unknown).
4106 elsif Offs /= No_Uint then
4107 Set_Result (Unknown);
4109 -- If we can't find the result by direct comparison of alignment
4110 -- values, then there is still one case that we can determine known
4111 -- result, and that is when we can determine that the types are the
4112 -- same, and no alignments are specified. Then we known that the
4113 -- alignments are compatible, even if we don't know the alignment
4114 -- value in the front end.
4116 elsif Etype (Obj) = Etype (Expr) then
4118 -- Types are the same, but we have to check for possible size
4119 -- and alignments on the Expr object that may make the alignment
4120 -- different, even though the types are the same.
4122 if Is_Entity_Name (Expr) then
4124 -- First check alignment of the Expr object. Any alignment less
4125 -- than Maximum_Alignment is worrisome since this is the case
4126 -- where we do not know the alignment of Obj.
4128 if Known_Alignment (Entity (Expr))
4130 UI_To_Int (Alignment (Entity (Expr))) <
4131 Ttypes.Maximum_Alignment
4133 Set_Result (Unknown);
4135 -- Now check size of Expr object. Any size that is not an
4136 -- even multiple of Maximum_Alignment is also worrisome
4137 -- since it may cause the alignment of the object to be less
4138 -- than the alignment of the type.
4140 elsif Known_Static_Esize (Entity (Expr))
4142 (UI_To_Int (Esize (Entity (Expr))) mod
4143 (Ttypes.Maximum_Alignment * Ttypes.System_Storage_Unit))
4146 Set_Result (Unknown);
4148 -- Otherwise same type is decisive
4151 Set_Result (Known_Compatible);
4155 -- Another case to deal with is when there is an explicit size or
4156 -- alignment clause when the types are not the same. If so, then the
4157 -- result is Unknown. We don't need to do this test if the Default is
4158 -- Unknown, since that result will be set in any case.
4160 elsif Default /= Unknown
4161 and then (Has_Size_Clause (Etype (Expr))
4163 Has_Alignment_Clause (Etype (Expr)))
4165 Set_Result (Unknown);
4167 -- If no indication found, set default
4170 Set_Result (Default);
4173 -- Return worst result found
4176 end Has_Compatible_Alignment_Internal;
4178 -- Start of processing for Has_Compatible_Alignment
4181 -- If Obj has no specified alignment, then set alignment from the type
4182 -- alignment. Perhaps we should always do this, but for sure we should
4183 -- do it when there is an address clause since we can do more if the
4184 -- alignment is known.
4186 if Unknown_Alignment (Obj) then
4187 Set_Alignment (Obj, Alignment (Etype (Obj)));
4190 -- Now do the internal call that does all the work
4192 return Has_Compatible_Alignment_Internal (Obj, Expr, Unknown);
4193 end Has_Compatible_Alignment;
4195 ----------------------
4196 -- Has_Declarations --
4197 ----------------------
4199 function Has_Declarations (N : Node_Id) return Boolean is
4201 return Nkind_In (Nkind (N), N_Accept_Statement,
4203 N_Compilation_Unit_Aux,
4209 N_Package_Specification);
4210 end Has_Declarations;
4212 -------------------------------------------
4213 -- Has_Discriminant_Dependent_Constraint --
4214 -------------------------------------------
4216 function Has_Discriminant_Dependent_Constraint
4217 (Comp : Entity_Id) return Boolean
4219 Comp_Decl : constant Node_Id := Parent (Comp);
4220 Subt_Indic : constant Node_Id :=
4221 Subtype_Indication (Component_Definition (Comp_Decl));
4226 if Nkind (Subt_Indic) = N_Subtype_Indication then
4227 Constr := Constraint (Subt_Indic);
4229 if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
4230 Assn := First (Constraints (Constr));
4231 while Present (Assn) loop
4232 case Nkind (Assn) is
4233 when N_Subtype_Indication |
4237 if Depends_On_Discriminant (Assn) then
4241 when N_Discriminant_Association =>
4242 if Depends_On_Discriminant (Expression (Assn)) then
4257 end Has_Discriminant_Dependent_Constraint;
4259 --------------------
4260 -- Has_Infinities --
4261 --------------------
4263 function Has_Infinities (E : Entity_Id) return Boolean is
4266 Is_Floating_Point_Type (E)
4267 and then Nkind (Scalar_Range (E)) = N_Range
4268 and then Includes_Infinities (Scalar_Range (E));
4271 --------------------
4272 -- Has_Interfaces --
4273 --------------------
4275 function Has_Interfaces
4277 Use_Full_View : Boolean := True) return Boolean
4282 -- Handle concurrent types
4284 if Is_Concurrent_Type (T) then
4285 Typ := Corresponding_Record_Type (T);
4290 if not Present (Typ)
4291 or else not Is_Record_Type (Typ)
4292 or else not Is_Tagged_Type (Typ)
4297 -- Handle private types
4300 and then Present (Full_View (Typ))
4302 Typ := Full_View (Typ);
4305 -- Handle concurrent record types
4307 if Is_Concurrent_Record_Type (Typ)
4308 and then Is_Non_Empty_List (Abstract_Interface_List (Typ))
4314 if Is_Interface (Typ)
4316 (Is_Record_Type (Typ)
4317 and then Present (Interfaces (Typ))
4318 and then not Is_Empty_Elmt_List (Interfaces (Typ)))
4323 exit when Etype (Typ) = Typ
4325 -- Handle private types
4327 or else (Present (Full_View (Etype (Typ)))
4328 and then Full_View (Etype (Typ)) = Typ)
4330 -- Protect the frontend against wrong source with cyclic
4333 or else Etype (Typ) = T;
4335 -- Climb to the ancestor type handling private types
4337 if Present (Full_View (Etype (Typ))) then
4338 Typ := Full_View (Etype (Typ));
4347 ------------------------
4348 -- Has_Null_Exclusion --
4349 ------------------------
4351 function Has_Null_Exclusion (N : Node_Id) return Boolean is
4354 when N_Access_Definition |
4355 N_Access_Function_Definition |
4356 N_Access_Procedure_Definition |
4357 N_Access_To_Object_Definition |
4359 N_Derived_Type_Definition |
4360 N_Function_Specification |
4361 N_Subtype_Declaration =>
4362 return Null_Exclusion_Present (N);
4364 when N_Component_Definition |
4365 N_Formal_Object_Declaration |
4366 N_Object_Renaming_Declaration =>
4367 if Present (Subtype_Mark (N)) then
4368 return Null_Exclusion_Present (N);
4369 else pragma Assert (Present (Access_Definition (N)));
4370 return Null_Exclusion_Present (Access_Definition (N));
4373 when N_Discriminant_Specification =>
4374 if Nkind (Discriminant_Type (N)) = N_Access_Definition then
4375 return Null_Exclusion_Present (Discriminant_Type (N));
4377 return Null_Exclusion_Present (N);
4380 when N_Object_Declaration =>
4381 if Nkind (Object_Definition (N)) = N_Access_Definition then
4382 return Null_Exclusion_Present (Object_Definition (N));
4384 return Null_Exclusion_Present (N);
4387 when N_Parameter_Specification =>
4388 if Nkind (Parameter_Type (N)) = N_Access_Definition then
4389 return Null_Exclusion_Present (Parameter_Type (N));
4391 return Null_Exclusion_Present (N);
4398 end Has_Null_Exclusion;
4400 ------------------------
4401 -- Has_Null_Extension --
4402 ------------------------
4404 function Has_Null_Extension (T : Entity_Id) return Boolean is
4405 B : constant Entity_Id := Base_Type (T);
4410 if Nkind (Parent (B)) = N_Full_Type_Declaration
4411 and then Present (Record_Extension_Part (Type_Definition (Parent (B))))
4413 Ext := Record_Extension_Part (Type_Definition (Parent (B)));
4415 if Present (Ext) then
4416 if Null_Present (Ext) then
4419 Comps := Component_List (Ext);
4421 -- The null component list is rewritten during analysis to
4422 -- include the parent component. Any other component indicates
4423 -- that the extension was not originally null.
4425 return Null_Present (Comps)
4426 or else No (Next (First (Component_Items (Comps))));
4435 end Has_Null_Extension;
4437 -------------------------------
4438 -- Has_Overriding_Initialize --
4439 -------------------------------
4441 function Has_Overriding_Initialize (T : Entity_Id) return Boolean is
4442 BT : constant Entity_Id := Base_Type (T);
4447 if Is_Controlled (BT) then
4449 -- For derived types, check immediate ancestor, excluding
4450 -- Controlled itself.
4452 if Is_Derived_Type (BT)
4453 and then not In_Predefined_Unit (Etype (BT))
4454 and then Has_Overriding_Initialize (Etype (BT))
4458 elsif Present (Primitive_Operations (BT)) then
4459 P := First_Elmt (Primitive_Operations (BT));
4460 while Present (P) loop
4461 if Chars (Node (P)) = Name_Initialize
4462 and then Comes_From_Source (Node (P))
4473 elsif Has_Controlled_Component (BT) then
4474 Comp := First_Component (BT);
4475 while Present (Comp) loop
4476 if Has_Overriding_Initialize (Etype (Comp)) then
4480 Next_Component (Comp);
4488 end Has_Overriding_Initialize;
4490 --------------------------------------
4491 -- Has_Preelaborable_Initialization --
4492 --------------------------------------
4494 function Has_Preelaborable_Initialization (E : Entity_Id) return Boolean is
4497 procedure Check_Components (E : Entity_Id);
4498 -- Check component/discriminant chain, sets Has_PE False if a component
4499 -- or discriminant does not meet the preelaborable initialization rules.
4501 ----------------------
4502 -- Check_Components --
4503 ----------------------
4505 procedure Check_Components (E : Entity_Id) is
4509 function Is_Preelaborable_Expression (N : Node_Id) return Boolean;
4510 -- Returns True if and only if the expression denoted by N does not
4511 -- violate restrictions on preelaborable constructs (RM-10.2.1(5-9)).
4513 ---------------------------------
4514 -- Is_Preelaborable_Expression --
4515 ---------------------------------
4517 function Is_Preelaborable_Expression (N : Node_Id) return Boolean is
4521 Comp_Type : Entity_Id;
4522 Is_Array_Aggr : Boolean;
4525 if Is_Static_Expression (N) then
4528 elsif Nkind (N) = N_Null then
4531 -- Attributes are allowed in general, even if their prefix is a
4532 -- formal type. (It seems that certain attributes known not to be
4533 -- static might not be allowed, but there are no rules to prevent
4536 elsif Nkind (N) = N_Attribute_Reference then
4539 -- The name of a discriminant evaluated within its parent type is
4540 -- defined to be preelaborable (10.2.1(8)). Note that we test for
4541 -- names that denote discriminals as well as discriminants to
4542 -- catch references occurring within init procs.
4544 elsif Is_Entity_Name (N)
4546 (Ekind (Entity (N)) = E_Discriminant
4548 ((Ekind (Entity (N)) = E_Constant
4549 or else Ekind (Entity (N)) = E_In_Parameter)
4550 and then Present (Discriminal_Link (Entity (N)))))
4554 elsif Nkind (N) = N_Qualified_Expression then
4555 return Is_Preelaborable_Expression (Expression (N));
4557 -- For aggregates we have to check that each of the associations
4558 -- is preelaborable.
4560 elsif Nkind (N) = N_Aggregate
4561 or else Nkind (N) = N_Extension_Aggregate
4563 Is_Array_Aggr := Is_Array_Type (Etype (N));
4565 if Is_Array_Aggr then
4566 Comp_Type := Component_Type (Etype (N));
4569 -- Check the ancestor part of extension aggregates, which must
4570 -- be either the name of a type that has preelaborable init or
4571 -- an expression that is preelaborable.
4573 if Nkind (N) = N_Extension_Aggregate then
4575 Anc_Part : constant Node_Id := Ancestor_Part (N);
4578 if Is_Entity_Name (Anc_Part)
4579 and then Is_Type (Entity (Anc_Part))
4581 if not Has_Preelaborable_Initialization
4587 elsif not Is_Preelaborable_Expression (Anc_Part) then
4593 -- Check positional associations
4595 Exp := First (Expressions (N));
4596 while Present (Exp) loop
4597 if not Is_Preelaborable_Expression (Exp) then
4604 -- Check named associations
4606 Assn := First (Component_Associations (N));
4607 while Present (Assn) loop
4608 Choice := First (Choices (Assn));
4609 while Present (Choice) loop
4610 if Is_Array_Aggr then
4611 if Nkind (Choice) = N_Others_Choice then
4614 elsif Nkind (Choice) = N_Range then
4615 if not Is_Static_Range (Choice) then
4619 elsif not Is_Static_Expression (Choice) then
4624 Comp_Type := Etype (Choice);
4630 -- If the association has a <> at this point, then we have
4631 -- to check whether the component's type has preelaborable
4632 -- initialization. Note that this only occurs when the
4633 -- association's corresponding component does not have a
4634 -- default expression, the latter case having already been
4635 -- expanded as an expression for the association.
4637 if Box_Present (Assn) then
4638 if not Has_Preelaborable_Initialization (Comp_Type) then
4642 -- In the expression case we check whether the expression
4643 -- is preelaborable.
4646 not Is_Preelaborable_Expression (Expression (Assn))
4654 -- If we get here then aggregate as a whole is preelaborable
4658 -- All other cases are not preelaborable
4663 end Is_Preelaborable_Expression;
4665 -- Start of processing for Check_Components
4668 -- Loop through entities of record or protected type
4671 while Present (Ent) loop
4673 -- We are interested only in components and discriminants
4675 if Ekind (Ent) = E_Component
4677 Ekind (Ent) = E_Discriminant
4679 -- Get default expression if any. If there is no declaration
4680 -- node, it means we have an internal entity. The parent and
4681 -- tag fields are examples of such entities. For these cases,
4682 -- we just test the type of the entity.
4684 if Present (Declaration_Node (Ent)) then
4685 Exp := Expression (Declaration_Node (Ent));
4690 -- A component has PI if it has no default expression and the
4691 -- component type has PI.
4694 if not Has_Preelaborable_Initialization (Etype (Ent)) then
4699 -- Require the default expression to be preelaborable
4701 elsif not Is_Preelaborable_Expression (Exp) then
4709 end Check_Components;
4711 -- Start of processing for Has_Preelaborable_Initialization
4714 -- Immediate return if already marked as known preelaborable init. This
4715 -- covers types for which this function has already been called once
4716 -- and returned True (in which case the result is cached), and also
4717 -- types to which a pragma Preelaborable_Initialization applies.
4719 if Known_To_Have_Preelab_Init (E) then
4723 -- If the type is a subtype representing a generic actual type, then
4724 -- test whether its base type has preelaborable initialization since
4725 -- the subtype representing the actual does not inherit this attribute
4726 -- from the actual or formal. (but maybe it should???)
4728 if Is_Generic_Actual_Type (E) then
4729 return Has_Preelaborable_Initialization (Base_Type (E));
4732 -- All elementary types have preelaborable initialization
4734 if Is_Elementary_Type (E) then
4737 -- Array types have PI if the component type has PI
4739 elsif Is_Array_Type (E) then
4740 Has_PE := Has_Preelaborable_Initialization (Component_Type (E));
4742 -- A derived type has preelaborable initialization if its parent type
4743 -- has preelaborable initialization and (in the case of a derived record
4744 -- extension) if the non-inherited components all have preelaborable
4745 -- initialization. However, a user-defined controlled type with an
4746 -- overriding Initialize procedure does not have preelaborable
4749 elsif Is_Derived_Type (E) then
4751 -- If the derived type is a private extension then it doesn't have
4752 -- preelaborable initialization.
4754 if Ekind (Base_Type (E)) = E_Record_Type_With_Private then
4758 -- First check whether ancestor type has preelaborable initialization
4760 Has_PE := Has_Preelaborable_Initialization (Etype (Base_Type (E)));
4762 -- If OK, check extension components (if any)
4764 if Has_PE and then Is_Record_Type (E) then
4765 Check_Components (First_Entity (E));
4768 -- Check specifically for 10.2.1(11.4/2) exception: a controlled type
4769 -- with a user defined Initialize procedure does not have PI.
4772 and then Is_Controlled (E)
4773 and then Has_Overriding_Initialize (E)
4778 -- Private types not derived from a type having preelaborable init and
4779 -- that are not marked with pragma Preelaborable_Initialization do not
4780 -- have preelaborable initialization.
4782 elsif Is_Private_Type (E) then
4785 -- Record type has PI if it is non private and all components have PI
4787 elsif Is_Record_Type (E) then
4789 Check_Components (First_Entity (E));
4791 -- Protected types must not have entries, and components must meet
4792 -- same set of rules as for record components.
4794 elsif Is_Protected_Type (E) then
4795 if Has_Entries (E) then
4799 Check_Components (First_Entity (E));
4800 Check_Components (First_Private_Entity (E));
4803 -- Type System.Address always has preelaborable initialization
4805 elsif Is_RTE (E, RE_Address) then
4808 -- In all other cases, type does not have preelaborable initialization
4814 -- If type has preelaborable initialization, cache result
4817 Set_Known_To_Have_Preelab_Init (E);
4821 end Has_Preelaborable_Initialization;
4823 ---------------------------
4824 -- Has_Private_Component --
4825 ---------------------------
4827 function Has_Private_Component (Type_Id : Entity_Id) return Boolean is
4828 Btype : Entity_Id := Base_Type (Type_Id);
4829 Component : Entity_Id;
4832 if Error_Posted (Type_Id)
4833 or else Error_Posted (Btype)
4838 if Is_Class_Wide_Type (Btype) then
4839 Btype := Root_Type (Btype);
4842 if Is_Private_Type (Btype) then
4844 UT : constant Entity_Id := Underlying_Type (Btype);
4847 if No (Full_View (Btype)) then
4848 return not Is_Generic_Type (Btype)
4849 and then not Is_Generic_Type (Root_Type (Btype));
4851 return not Is_Generic_Type (Root_Type (Full_View (Btype)));
4854 return not Is_Frozen (UT) and then Has_Private_Component (UT);
4858 elsif Is_Array_Type (Btype) then
4859 return Has_Private_Component (Component_Type (Btype));
4861 elsif Is_Record_Type (Btype) then
4862 Component := First_Component (Btype);
4863 while Present (Component) loop
4864 if Has_Private_Component (Etype (Component)) then
4868 Next_Component (Component);
4873 elsif Is_Protected_Type (Btype)
4874 and then Present (Corresponding_Record_Type (Btype))
4876 return Has_Private_Component (Corresponding_Record_Type (Btype));
4881 end Has_Private_Component;
4887 function Has_Stream (T : Entity_Id) return Boolean is
4894 elsif Is_RTE (Root_Type (T), RE_Root_Stream_Type) then
4897 elsif Is_Array_Type (T) then
4898 return Has_Stream (Component_Type (T));
4900 elsif Is_Record_Type (T) then
4901 E := First_Component (T);
4902 while Present (E) loop
4903 if Has_Stream (Etype (E)) then
4912 elsif Is_Private_Type (T) then
4913 return Has_Stream (Underlying_Type (T));
4920 --------------------------
4921 -- Has_Tagged_Component --
4922 --------------------------
4924 function Has_Tagged_Component (Typ : Entity_Id) return Boolean is
4928 if Is_Private_Type (Typ)
4929 and then Present (Underlying_Type (Typ))
4931 return Has_Tagged_Component (Underlying_Type (Typ));
4933 elsif Is_Array_Type (Typ) then
4934 return Has_Tagged_Component (Component_Type (Typ));
4936 elsif Is_Tagged_Type (Typ) then
4939 elsif Is_Record_Type (Typ) then
4940 Comp := First_Component (Typ);
4941 while Present (Comp) loop
4942 if Has_Tagged_Component (Etype (Comp)) then
4946 Next_Component (Comp);
4954 end Has_Tagged_Component;
4956 --------------------------
4957 -- Implements_Interface --
4958 --------------------------
4960 function Implements_Interface
4961 (Typ_Ent : Entity_Id;
4962 Iface_Ent : Entity_Id;
4963 Exclude_Parents : Boolean := False) return Boolean
4965 Ifaces_List : Elist_Id;
4967 Iface : Entity_Id := Base_Type (Iface_Ent);
4968 Typ : Entity_Id := Base_Type (Typ_Ent);
4971 if Is_Class_Wide_Type (Typ) then
4972 Typ := Root_Type (Typ);
4975 if not Has_Interfaces (Typ) then
4979 if Is_Class_Wide_Type (Iface) then
4980 Iface := Root_Type (Iface);
4983 Collect_Interfaces (Typ, Ifaces_List);
4985 Elmt := First_Elmt (Ifaces_List);
4986 while Present (Elmt) loop
4987 if Is_Ancestor (Node (Elmt), Typ)
4988 and then Exclude_Parents
4992 elsif Node (Elmt) = Iface then
5000 end Implements_Interface;
5006 function In_Instance return Boolean is
5007 Curr_Unit : constant Entity_Id := Cunit_Entity (Current_Sem_Unit);
5013 and then S /= Standard_Standard
5015 if (Ekind (S) = E_Function
5016 or else Ekind (S) = E_Package
5017 or else Ekind (S) = E_Procedure)
5018 and then Is_Generic_Instance (S)
5020 -- A child instance is always compiled in the context of a parent
5021 -- instance. Nevertheless, the actuals are not analyzed in an
5022 -- instance context. We detect this case by examining the current
5023 -- compilation unit, which must be a child instance, and checking
5024 -- that it is not currently on the scope stack.
5026 if Is_Child_Unit (Curr_Unit)
5028 Nkind (Unit (Cunit (Current_Sem_Unit)))
5029 = N_Package_Instantiation
5030 and then not In_Open_Scopes (Curr_Unit)
5044 ----------------------
5045 -- In_Instance_Body --
5046 ----------------------
5048 function In_Instance_Body return Boolean is
5054 and then S /= Standard_Standard
5056 if (Ekind (S) = E_Function
5057 or else Ekind (S) = E_Procedure)
5058 and then Is_Generic_Instance (S)
5062 elsif Ekind (S) = E_Package
5063 and then In_Package_Body (S)
5064 and then Is_Generic_Instance (S)
5073 end In_Instance_Body;
5075 -----------------------------
5076 -- In_Instance_Not_Visible --
5077 -----------------------------
5079 function In_Instance_Not_Visible return Boolean is
5085 and then S /= Standard_Standard
5087 if (Ekind (S) = E_Function
5088 or else Ekind (S) = E_Procedure)
5089 and then Is_Generic_Instance (S)
5093 elsif Ekind (S) = E_Package
5094 and then (In_Package_Body (S) or else In_Private_Part (S))
5095 and then Is_Generic_Instance (S)
5104 end In_Instance_Not_Visible;
5106 ------------------------------
5107 -- In_Instance_Visible_Part --
5108 ------------------------------
5110 function In_Instance_Visible_Part return Boolean is
5116 and then S /= Standard_Standard
5118 if Ekind (S) = E_Package
5119 and then Is_Generic_Instance (S)
5120 and then not In_Package_Body (S)
5121 and then not In_Private_Part (S)
5130 end In_Instance_Visible_Part;
5132 ---------------------
5133 -- In_Package_Body --
5134 ---------------------
5136 function In_Package_Body return Boolean is
5142 and then S /= Standard_Standard
5144 if Ekind (S) = E_Package
5145 and then In_Package_Body (S)
5154 end In_Package_Body;
5156 --------------------------------
5157 -- In_Parameter_Specification --
5158 --------------------------------
5160 function In_Parameter_Specification (N : Node_Id) return Boolean is
5165 while Present (PN) loop
5166 if Nkind (PN) = N_Parameter_Specification then
5174 end In_Parameter_Specification;
5176 --------------------------------------
5177 -- In_Subprogram_Or_Concurrent_Unit --
5178 --------------------------------------
5180 function In_Subprogram_Or_Concurrent_Unit return Boolean is
5185 -- Use scope chain to check successively outer scopes
5191 if K in Subprogram_Kind
5192 or else K in Concurrent_Kind
5193 or else K in Generic_Subprogram_Kind
5197 elsif E = Standard_Standard then
5203 end In_Subprogram_Or_Concurrent_Unit;
5205 ---------------------
5206 -- In_Visible_Part --
5207 ---------------------
5209 function In_Visible_Part (Scope_Id : Entity_Id) return Boolean is
5212 Is_Package_Or_Generic_Package (Scope_Id)
5213 and then In_Open_Scopes (Scope_Id)
5214 and then not In_Package_Body (Scope_Id)
5215 and then not In_Private_Part (Scope_Id);
5216 end In_Visible_Part;
5218 ---------------------------------
5219 -- Insert_Explicit_Dereference --
5220 ---------------------------------
5222 procedure Insert_Explicit_Dereference (N : Node_Id) is
5223 New_Prefix : constant Node_Id := Relocate_Node (N);
5224 Ent : Entity_Id := Empty;
5231 Save_Interps (N, New_Prefix);
5233 -- Check if the node relocation requires readjustment of some SCIL
5234 -- dispatching node.
5237 and then Nkind (N) = N_Function_Call
5239 Adjust_SCIL_Node (N, New_Prefix);
5242 Rewrite (N, Make_Explicit_Dereference (Sloc (N), Prefix => New_Prefix));
5244 Set_Etype (N, Designated_Type (Etype (New_Prefix)));
5246 if Is_Overloaded (New_Prefix) then
5248 -- The dereference is also overloaded, and its interpretations are
5249 -- the designated types of the interpretations of the original node.
5251 Set_Etype (N, Any_Type);
5253 Get_First_Interp (New_Prefix, I, It);
5254 while Present (It.Nam) loop
5257 if Is_Access_Type (T) then
5258 Add_One_Interp (N, Designated_Type (T), Designated_Type (T));
5261 Get_Next_Interp (I, It);
5267 -- Prefix is unambiguous: mark the original prefix (which might
5268 -- Come_From_Source) as a reference, since the new (relocated) one
5269 -- won't be taken into account.
5271 if Is_Entity_Name (New_Prefix) then
5272 Ent := Entity (New_Prefix);
5274 -- For a retrieval of a subcomponent of some composite object,
5275 -- retrieve the ultimate entity if there is one.
5277 elsif Nkind (New_Prefix) = N_Selected_Component
5278 or else Nkind (New_Prefix) = N_Indexed_Component
5280 Pref := Prefix (New_Prefix);
5281 while Present (Pref)
5283 (Nkind (Pref) = N_Selected_Component
5284 or else Nkind (Pref) = N_Indexed_Component)
5286 Pref := Prefix (Pref);
5289 if Present (Pref) and then Is_Entity_Name (Pref) then
5290 Ent := Entity (Pref);
5294 if Present (Ent) then
5295 Generate_Reference (Ent, New_Prefix);
5298 end Insert_Explicit_Dereference;
5300 ------------------------------------------
5301 -- Inspect_Deferred_Constant_Completion --
5302 ------------------------------------------
5304 procedure Inspect_Deferred_Constant_Completion (Decls : List_Id) is
5308 Decl := First (Decls);
5309 while Present (Decl) loop
5311 -- Deferred constant signature
5313 if Nkind (Decl) = N_Object_Declaration
5314 and then Constant_Present (Decl)
5315 and then No (Expression (Decl))
5317 -- No need to check internally generated constants
5319 and then Comes_From_Source (Decl)
5321 -- The constant is not completed. A full object declaration
5322 -- or a pragma Import complete a deferred constant.
5324 and then not Has_Completion (Defining_Identifier (Decl))
5327 ("constant declaration requires initialization expression",
5328 Defining_Identifier (Decl));
5331 Decl := Next (Decl);
5333 end Inspect_Deferred_Constant_Completion;
5339 function Is_AAMP_Float (E : Entity_Id) return Boolean is
5340 pragma Assert (Is_Type (E));
5342 return AAMP_On_Target
5343 and then Is_Floating_Point_Type (E)
5344 and then E = Base_Type (E);
5347 -----------------------------
5348 -- Is_Actual_Out_Parameter --
5349 -----------------------------
5351 function Is_Actual_Out_Parameter (N : Node_Id) return Boolean is
5355 Find_Actual (N, Formal, Call);
5356 return Present (Formal)
5357 and then Ekind (Formal) = E_Out_Parameter;
5358 end Is_Actual_Out_Parameter;
5360 -------------------------
5361 -- Is_Actual_Parameter --
5362 -------------------------
5364 function Is_Actual_Parameter (N : Node_Id) return Boolean is
5365 PK : constant Node_Kind := Nkind (Parent (N));
5369 when N_Parameter_Association =>
5370 return N = Explicit_Actual_Parameter (Parent (N));
5372 when N_Function_Call | N_Procedure_Call_Statement =>
5373 return Is_List_Member (N)
5375 List_Containing (N) = Parameter_Associations (Parent (N));
5380 end Is_Actual_Parameter;
5382 ---------------------
5383 -- Is_Aliased_View --
5384 ---------------------
5386 function Is_Aliased_View (Obj : Node_Id) return Boolean is
5390 if Is_Entity_Name (Obj) then
5398 or else (Present (Renamed_Object (E))
5399 and then Is_Aliased_View (Renamed_Object (E)))))
5401 or else ((Is_Formal (E)
5402 or else Ekind (E) = E_Generic_In_Out_Parameter
5403 or else Ekind (E) = E_Generic_In_Parameter)
5404 and then Is_Tagged_Type (Etype (E)))
5406 or else (Is_Concurrent_Type (E)
5407 and then In_Open_Scopes (E))
5409 -- Current instance of type, either directly or as rewritten
5410 -- reference to the current object.
5412 or else (Is_Entity_Name (Original_Node (Obj))
5413 and then Present (Entity (Original_Node (Obj)))
5414 and then Is_Type (Entity (Original_Node (Obj))))
5416 or else (Is_Type (E) and then E = Current_Scope)
5418 or else (Is_Incomplete_Or_Private_Type (E)
5419 and then Full_View (E) = Current_Scope);
5421 elsif Nkind (Obj) = N_Selected_Component then
5422 return Is_Aliased (Entity (Selector_Name (Obj)));
5424 elsif Nkind (Obj) = N_Indexed_Component then
5425 return Has_Aliased_Components (Etype (Prefix (Obj)))
5427 (Is_Access_Type (Etype (Prefix (Obj)))
5429 Has_Aliased_Components
5430 (Designated_Type (Etype (Prefix (Obj)))));
5432 elsif Nkind (Obj) = N_Unchecked_Type_Conversion
5433 or else Nkind (Obj) = N_Type_Conversion
5435 return Is_Tagged_Type (Etype (Obj))
5436 and then Is_Aliased_View (Expression (Obj));
5438 elsif Nkind (Obj) = N_Explicit_Dereference then
5439 return Nkind (Original_Node (Obj)) /= N_Function_Call;
5444 end Is_Aliased_View;
5446 -------------------------
5447 -- Is_Ancestor_Package --
5448 -------------------------
5450 function Is_Ancestor_Package
5452 E2 : Entity_Id) return Boolean
5459 and then Par /= Standard_Standard
5469 end Is_Ancestor_Package;
5471 ----------------------
5472 -- Is_Atomic_Object --
5473 ----------------------
5475 function Is_Atomic_Object (N : Node_Id) return Boolean is
5477 function Object_Has_Atomic_Components (N : Node_Id) return Boolean;
5478 -- Determines if given object has atomic components
5480 function Is_Atomic_Prefix (N : Node_Id) return Boolean;
5481 -- If prefix is an implicit dereference, examine designated type
5483 ----------------------
5484 -- Is_Atomic_Prefix --
5485 ----------------------
5487 function Is_Atomic_Prefix (N : Node_Id) return Boolean is
5489 if Is_Access_Type (Etype (N)) then
5491 Has_Atomic_Components (Designated_Type (Etype (N)));
5493 return Object_Has_Atomic_Components (N);
5495 end Is_Atomic_Prefix;
5497 ----------------------------------
5498 -- Object_Has_Atomic_Components --
5499 ----------------------------------
5501 function Object_Has_Atomic_Components (N : Node_Id) return Boolean is
5503 if Has_Atomic_Components (Etype (N))
5504 or else Is_Atomic (Etype (N))
5508 elsif Is_Entity_Name (N)
5509 and then (Has_Atomic_Components (Entity (N))
5510 or else Is_Atomic (Entity (N)))
5514 elsif Nkind (N) = N_Indexed_Component
5515 or else Nkind (N) = N_Selected_Component
5517 return Is_Atomic_Prefix (Prefix (N));
5522 end Object_Has_Atomic_Components;
5524 -- Start of processing for Is_Atomic_Object
5527 if Is_Atomic (Etype (N))
5528 or else (Is_Entity_Name (N) and then Is_Atomic (Entity (N)))
5532 elsif Nkind (N) = N_Indexed_Component
5533 or else Nkind (N) = N_Selected_Component
5535 return Is_Atomic_Prefix (Prefix (N));
5540 end Is_Atomic_Object;
5542 -------------------------
5543 -- Is_Coextension_Root --
5544 -------------------------
5546 function Is_Coextension_Root (N : Node_Id) return Boolean is
5549 Nkind (N) = N_Allocator
5550 and then Present (Coextensions (N))
5552 -- Anonymous access discriminants carry a list of all nested
5553 -- controlled coextensions.
5555 and then not Is_Dynamic_Coextension (N)
5556 and then not Is_Static_Coextension (N);
5557 end Is_Coextension_Root;
5559 -----------------------------
5560 -- Is_Concurrent_Interface --
5561 -----------------------------
5563 function Is_Concurrent_Interface (T : Entity_Id) return Boolean is
5568 (Is_Protected_Interface (T)
5569 or else Is_Synchronized_Interface (T)
5570 or else Is_Task_Interface (T));
5571 end Is_Concurrent_Interface;
5573 --------------------------------------
5574 -- Is_Controlling_Limited_Procedure --
5575 --------------------------------------
5577 function Is_Controlling_Limited_Procedure
5578 (Proc_Nam : Entity_Id) return Boolean
5580 Param_Typ : Entity_Id := Empty;
5583 if Ekind (Proc_Nam) = E_Procedure
5584 and then Present (Parameter_Specifications (Parent (Proc_Nam)))
5586 Param_Typ := Etype (Parameter_Type (First (
5587 Parameter_Specifications (Parent (Proc_Nam)))));
5589 -- In this case where an Itype was created, the procedure call has been
5592 elsif Present (Associated_Node_For_Itype (Proc_Nam))
5593 and then Present (Original_Node (Associated_Node_For_Itype (Proc_Nam)))
5595 Present (Parameter_Associations
5596 (Associated_Node_For_Itype (Proc_Nam)))
5599 Etype (First (Parameter_Associations
5600 (Associated_Node_For_Itype (Proc_Nam))));
5603 if Present (Param_Typ) then
5605 Is_Interface (Param_Typ)
5606 and then Is_Limited_Record (Param_Typ);
5610 end Is_Controlling_Limited_Procedure;
5612 -----------------------------
5613 -- Is_CPP_Constructor_Call --
5614 -----------------------------
5616 function Is_CPP_Constructor_Call (N : Node_Id) return Boolean is
5618 return Nkind (N) = N_Function_Call
5619 and then Is_CPP_Class (Etype (Etype (N)))
5620 and then Is_Constructor (Entity (Name (N)))
5621 and then Is_Imported (Entity (Name (N)));
5622 end Is_CPP_Constructor_Call;
5624 ----------------------------------------------
5625 -- Is_Dependent_Component_Of_Mutable_Object --
5626 ----------------------------------------------
5628 function Is_Dependent_Component_Of_Mutable_Object
5629 (Object : Node_Id) return Boolean
5632 Prefix_Type : Entity_Id;
5633 P_Aliased : Boolean := False;
5636 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean;
5637 -- Returns True if and only if Comp is declared within a variant part
5639 --------------------------------
5640 -- Is_Declared_Within_Variant --
5641 --------------------------------
5643 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean is
5644 Comp_Decl : constant Node_Id := Parent (Comp);
5645 Comp_List : constant Node_Id := Parent (Comp_Decl);
5647 return Nkind (Parent (Comp_List)) = N_Variant;
5648 end Is_Declared_Within_Variant;
5650 -- Start of processing for Is_Dependent_Component_Of_Mutable_Object
5653 if Is_Variable (Object) then
5655 if Nkind (Object) = N_Selected_Component then
5656 P := Prefix (Object);
5657 Prefix_Type := Etype (P);
5659 if Is_Entity_Name (P) then
5661 if Ekind (Entity (P)) = E_Generic_In_Out_Parameter then
5662 Prefix_Type := Base_Type (Prefix_Type);
5665 if Is_Aliased (Entity (P)) then
5669 -- A discriminant check on a selected component may be
5670 -- expanded into a dereference when removing side-effects.
5671 -- Recover the original node and its type, which may be
5674 elsif Nkind (P) = N_Explicit_Dereference
5675 and then not (Comes_From_Source (P))
5677 P := Original_Node (P);
5678 Prefix_Type := Etype (P);
5681 -- Check for prefix being an aliased component ???
5686 -- A heap object is constrained by its initial value
5688 -- Ada 2005 (AI-363): Always assume the object could be mutable in
5689 -- the dereferenced case, since the access value might denote an
5690 -- unconstrained aliased object, whereas in Ada 95 the designated
5691 -- object is guaranteed to be constrained. A worst-case assumption
5692 -- has to apply in Ada 2005 because we can't tell at compile time
5693 -- whether the object is "constrained by its initial value"
5694 -- (despite the fact that 3.10.2(26/2) and 8.5.1(5/2) are
5695 -- semantic rules -- these rules are acknowledged to need fixing).
5697 if Ada_Version < Ada_05 then
5698 if Is_Access_Type (Prefix_Type)
5699 or else Nkind (P) = N_Explicit_Dereference
5704 elsif Ada_Version >= Ada_05 then
5705 if Is_Access_Type (Prefix_Type) then
5707 -- If the access type is pool-specific, and there is no
5708 -- constrained partial view of the designated type, then the
5709 -- designated object is known to be constrained.
5711 if Ekind (Prefix_Type) = E_Access_Type
5712 and then not Has_Constrained_Partial_View
5713 (Designated_Type (Prefix_Type))
5717 -- Otherwise (general access type, or there is a constrained
5718 -- partial view of the designated type), we need to check
5719 -- based on the designated type.
5722 Prefix_Type := Designated_Type (Prefix_Type);
5728 Original_Record_Component (Entity (Selector_Name (Object)));
5730 -- As per AI-0017, the renaming is illegal in a generic body,
5731 -- even if the subtype is indefinite.
5733 -- Ada 2005 (AI-363): In Ada 2005 an aliased object can be mutable
5735 if not Is_Constrained (Prefix_Type)
5736 and then (not Is_Indefinite_Subtype (Prefix_Type)
5738 (Is_Generic_Type (Prefix_Type)
5739 and then Ekind (Current_Scope) = E_Generic_Package
5740 and then In_Package_Body (Current_Scope)))
5742 and then (Is_Declared_Within_Variant (Comp)
5743 or else Has_Discriminant_Dependent_Constraint (Comp))
5744 and then (not P_Aliased or else Ada_Version >= Ada_05)
5750 Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
5754 elsif Nkind (Object) = N_Indexed_Component
5755 or else Nkind (Object) = N_Slice
5757 return Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
5759 -- A type conversion that Is_Variable is a view conversion:
5760 -- go back to the denoted object.
5762 elsif Nkind (Object) = N_Type_Conversion then
5764 Is_Dependent_Component_Of_Mutable_Object (Expression (Object));
5769 end Is_Dependent_Component_Of_Mutable_Object;
5771 ---------------------
5772 -- Is_Dereferenced --
5773 ---------------------
5775 function Is_Dereferenced (N : Node_Id) return Boolean is
5776 P : constant Node_Id := Parent (N);
5779 (Nkind (P) = N_Selected_Component
5781 Nkind (P) = N_Explicit_Dereference
5783 Nkind (P) = N_Indexed_Component
5785 Nkind (P) = N_Slice)
5786 and then Prefix (P) = N;
5787 end Is_Dereferenced;
5789 ----------------------
5790 -- Is_Descendent_Of --
5791 ----------------------
5793 function Is_Descendent_Of (T1 : Entity_Id; T2 : Entity_Id) return Boolean is
5798 pragma Assert (Nkind (T1) in N_Entity);
5799 pragma Assert (Nkind (T2) in N_Entity);
5801 T := Base_Type (T1);
5803 -- Immediate return if the types match
5808 -- Comment needed here ???
5810 elsif Ekind (T) = E_Class_Wide_Type then
5811 return Etype (T) = T2;
5819 -- Done if we found the type we are looking for
5824 -- Done if no more derivations to check
5831 -- Following test catches error cases resulting from prev errors
5833 elsif No (Etyp) then
5836 elsif Is_Private_Type (T) and then Etyp = Full_View (T) then
5839 elsif Is_Private_Type (Etyp) and then Full_View (Etyp) = T then
5843 T := Base_Type (Etyp);
5846 end Is_Descendent_Of;
5852 function Is_False (U : Uint) return Boolean is
5857 ---------------------------
5858 -- Is_Fixed_Model_Number --
5859 ---------------------------
5861 function Is_Fixed_Model_Number (U : Ureal; T : Entity_Id) return Boolean is
5862 S : constant Ureal := Small_Value (T);
5863 M : Urealp.Save_Mark;
5867 R := (U = UR_Trunc (U / S) * S);
5870 end Is_Fixed_Model_Number;
5872 -------------------------------
5873 -- Is_Fully_Initialized_Type --
5874 -------------------------------
5876 function Is_Fully_Initialized_Type (Typ : Entity_Id) return Boolean is
5878 if Is_Scalar_Type (Typ) then
5881 elsif Is_Access_Type (Typ) then
5884 elsif Is_Array_Type (Typ) then
5885 if Is_Fully_Initialized_Type (Component_Type (Typ)) then
5889 -- An interesting case, if we have a constrained type one of whose
5890 -- bounds is known to be null, then there are no elements to be
5891 -- initialized, so all the elements are initialized!
5893 if Is_Constrained (Typ) then
5896 Indx_Typ : Entity_Id;
5900 Indx := First_Index (Typ);
5901 while Present (Indx) loop
5902 if Etype (Indx) = Any_Type then
5905 -- If index is a range, use directly
5907 elsif Nkind (Indx) = N_Range then
5908 Lbd := Low_Bound (Indx);
5909 Hbd := High_Bound (Indx);
5912 Indx_Typ := Etype (Indx);
5914 if Is_Private_Type (Indx_Typ) then
5915 Indx_Typ := Full_View (Indx_Typ);
5918 if No (Indx_Typ) or else Etype (Indx_Typ) = Any_Type then
5921 Lbd := Type_Low_Bound (Indx_Typ);
5922 Hbd := Type_High_Bound (Indx_Typ);
5926 if Compile_Time_Known_Value (Lbd)
5927 and then Compile_Time_Known_Value (Hbd)
5929 if Expr_Value (Hbd) < Expr_Value (Lbd) then
5939 -- If no null indexes, then type is not fully initialized
5945 elsif Is_Record_Type (Typ) then
5946 if Has_Discriminants (Typ)
5948 Present (Discriminant_Default_Value (First_Discriminant (Typ)))
5949 and then Is_Fully_Initialized_Variant (Typ)
5954 -- Controlled records are considered to be fully initialized if
5955 -- there is a user defined Initialize routine. This may not be
5956 -- entirely correct, but as the spec notes, we are guessing here
5957 -- what is best from the point of view of issuing warnings.
5959 if Is_Controlled (Typ) then
5961 Utyp : constant Entity_Id := Underlying_Type (Typ);
5964 if Present (Utyp) then
5966 Init : constant Entity_Id :=
5968 (Underlying_Type (Typ), Name_Initialize));
5972 and then Comes_From_Source (Init)
5974 Is_Predefined_File_Name
5975 (File_Name (Get_Source_File_Index (Sloc (Init))))
5979 elsif Has_Null_Extension (Typ)
5981 Is_Fully_Initialized_Type
5982 (Etype (Base_Type (Typ)))
5991 -- Otherwise see if all record components are initialized
5997 Ent := First_Entity (Typ);
5998 while Present (Ent) loop
5999 if Chars (Ent) = Name_uController then
6002 elsif Ekind (Ent) = E_Component
6003 and then (No (Parent (Ent))
6004 or else No (Expression (Parent (Ent))))
6005 and then not Is_Fully_Initialized_Type (Etype (Ent))
6007 -- Special VM case for tag components, which need to be
6008 -- defined in this case, but are never initialized as VMs
6009 -- are using other dispatching mechanisms. Ignore this
6010 -- uninitialized case. Note that this applies both to the
6011 -- uTag entry and the main vtable pointer (CPP_Class case).
6013 and then (Tagged_Type_Expansion or else not Is_Tag (Ent))
6022 -- No uninitialized components, so type is fully initialized.
6023 -- Note that this catches the case of no components as well.
6027 elsif Is_Concurrent_Type (Typ) then
6030 elsif Is_Private_Type (Typ) then
6032 U : constant Entity_Id := Underlying_Type (Typ);
6038 return Is_Fully_Initialized_Type (U);
6045 end Is_Fully_Initialized_Type;
6047 ----------------------------------
6048 -- Is_Fully_Initialized_Variant --
6049 ----------------------------------
6051 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean is
6052 Loc : constant Source_Ptr := Sloc (Typ);
6053 Constraints : constant List_Id := New_List;
6054 Components : constant Elist_Id := New_Elmt_List;
6055 Comp_Elmt : Elmt_Id;
6057 Comp_List : Node_Id;
6059 Discr_Val : Node_Id;
6061 Report_Errors : Boolean;
6062 pragma Warnings (Off, Report_Errors);
6065 if Serious_Errors_Detected > 0 then
6069 if Is_Record_Type (Typ)
6070 and then Nkind (Parent (Typ)) = N_Full_Type_Declaration
6071 and then Nkind (Type_Definition (Parent (Typ))) = N_Record_Definition
6073 Comp_List := Component_List (Type_Definition (Parent (Typ)));
6075 Discr := First_Discriminant (Typ);
6076 while Present (Discr) loop
6077 if Nkind (Parent (Discr)) = N_Discriminant_Specification then
6078 Discr_Val := Expression (Parent (Discr));
6080 if Present (Discr_Val)
6081 and then Is_OK_Static_Expression (Discr_Val)
6083 Append_To (Constraints,
6084 Make_Component_Association (Loc,
6085 Choices => New_List (New_Occurrence_Of (Discr, Loc)),
6086 Expression => New_Copy (Discr_Val)));
6094 Next_Discriminant (Discr);
6099 Comp_List => Comp_List,
6100 Governed_By => Constraints,
6102 Report_Errors => Report_Errors);
6104 -- Check that each component present is fully initialized
6106 Comp_Elmt := First_Elmt (Components);
6107 while Present (Comp_Elmt) loop
6108 Comp_Id := Node (Comp_Elmt);
6110 if Ekind (Comp_Id) = E_Component
6111 and then (No (Parent (Comp_Id))
6112 or else No (Expression (Parent (Comp_Id))))
6113 and then not Is_Fully_Initialized_Type (Etype (Comp_Id))
6118 Next_Elmt (Comp_Elmt);
6123 elsif Is_Private_Type (Typ) then
6125 U : constant Entity_Id := Underlying_Type (Typ);
6131 return Is_Fully_Initialized_Variant (U);
6137 end Is_Fully_Initialized_Variant;
6143 -- We seem to have a lot of overlapping functions that do similar things
6144 -- (testing for left hand sides or lvalues???). Anyway, since this one is
6145 -- purely syntactic, it should be in Sem_Aux I would think???
6147 function Is_LHS (N : Node_Id) return Boolean is
6148 P : constant Node_Id := Parent (N);
6150 return Nkind (P) = N_Assignment_Statement
6151 and then Name (P) = N;
6154 ----------------------------
6155 -- Is_Inherited_Operation --
6156 ----------------------------
6158 function Is_Inherited_Operation (E : Entity_Id) return Boolean is
6159 Kind : constant Node_Kind := Nkind (Parent (E));
6161 pragma Assert (Is_Overloadable (E));
6162 return Kind = N_Full_Type_Declaration
6163 or else Kind = N_Private_Extension_Declaration
6164 or else Kind = N_Subtype_Declaration
6165 or else (Ekind (E) = E_Enumeration_Literal
6166 and then Is_Derived_Type (Etype (E)));
6167 end Is_Inherited_Operation;
6169 -----------------------------
6170 -- Is_Library_Level_Entity --
6171 -----------------------------
6173 function Is_Library_Level_Entity (E : Entity_Id) return Boolean is
6175 -- The following is a small optimization, and it also properly handles
6176 -- discriminals, which in task bodies might appear in expressions before
6177 -- the corresponding procedure has been created, and which therefore do
6178 -- not have an assigned scope.
6180 if Ekind (E) in Formal_Kind then
6184 -- Normal test is simply that the enclosing dynamic scope is Standard
6186 return Enclosing_Dynamic_Scope (E) = Standard_Standard;
6187 end Is_Library_Level_Entity;
6189 ---------------------------------
6190 -- Is_Local_Variable_Reference --
6191 ---------------------------------
6193 function Is_Local_Variable_Reference (Expr : Node_Id) return Boolean is
6195 if not Is_Entity_Name (Expr) then
6200 Ent : constant Entity_Id := Entity (Expr);
6201 Sub : constant Entity_Id := Enclosing_Subprogram (Ent);
6203 if Ekind (Ent) /= E_Variable
6205 Ekind (Ent) /= E_In_Out_Parameter
6209 return Present (Sub) and then Sub = Current_Subprogram;
6213 end Is_Local_Variable_Reference;
6215 -------------------------
6216 -- Is_Object_Reference --
6217 -------------------------
6219 function Is_Object_Reference (N : Node_Id) return Boolean is
6221 if Is_Entity_Name (N) then
6222 return Present (Entity (N)) and then Is_Object (Entity (N));
6226 when N_Indexed_Component | N_Slice =>
6228 Is_Object_Reference (Prefix (N))
6229 or else Is_Access_Type (Etype (Prefix (N)));
6231 -- In Ada95, a function call is a constant object; a procedure
6234 when N_Function_Call =>
6235 return Etype (N) /= Standard_Void_Type;
6237 -- A reference to the stream attribute Input is a function call
6239 when N_Attribute_Reference =>
6240 return Attribute_Name (N) = Name_Input;
6242 when N_Selected_Component =>
6244 Is_Object_Reference (Selector_Name (N))
6246 (Is_Object_Reference (Prefix (N))
6247 or else Is_Access_Type (Etype (Prefix (N))));
6249 when N_Explicit_Dereference =>
6252 -- A view conversion of a tagged object is an object reference
6254 when N_Type_Conversion =>
6255 return Is_Tagged_Type (Etype (Subtype_Mark (N)))
6256 and then Is_Tagged_Type (Etype (Expression (N)))
6257 and then Is_Object_Reference (Expression (N));
6259 -- An unchecked type conversion is considered to be an object if
6260 -- the operand is an object (this construction arises only as a
6261 -- result of expansion activities).
6263 when N_Unchecked_Type_Conversion =>
6270 end Is_Object_Reference;
6272 -----------------------------------
6273 -- Is_OK_Variable_For_Out_Formal --
6274 -----------------------------------
6276 function Is_OK_Variable_For_Out_Formal (AV : Node_Id) return Boolean is
6278 Note_Possible_Modification (AV, Sure => True);
6280 -- We must reject parenthesized variable names. The check for
6281 -- Comes_From_Source is present because there are currently
6282 -- cases where the compiler violates this rule (e.g. passing
6283 -- a task object to its controlled Initialize routine).
6285 if Paren_Count (AV) > 0 and then Comes_From_Source (AV) then
6288 -- A variable is always allowed
6290 elsif Is_Variable (AV) then
6293 -- Unchecked conversions are allowed only if they come from the
6294 -- generated code, which sometimes uses unchecked conversions for out
6295 -- parameters in cases where code generation is unaffected. We tell
6296 -- source unchecked conversions by seeing if they are rewrites of an
6297 -- original Unchecked_Conversion function call, or of an explicit
6298 -- conversion of a function call.
6300 elsif Nkind (AV) = N_Unchecked_Type_Conversion then
6301 if Nkind (Original_Node (AV)) = N_Function_Call then
6304 elsif Comes_From_Source (AV)
6305 and then Nkind (Original_Node (Expression (AV))) = N_Function_Call
6309 elsif Nkind (Original_Node (AV)) = N_Type_Conversion then
6310 return Is_OK_Variable_For_Out_Formal (Expression (AV));
6316 -- Normal type conversions are allowed if argument is a variable
6318 elsif Nkind (AV) = N_Type_Conversion then
6319 if Is_Variable (Expression (AV))
6320 and then Paren_Count (Expression (AV)) = 0
6322 Note_Possible_Modification (Expression (AV), Sure => True);
6325 -- We also allow a non-parenthesized expression that raises
6326 -- constraint error if it rewrites what used to be a variable
6328 elsif Raises_Constraint_Error (Expression (AV))
6329 and then Paren_Count (Expression (AV)) = 0
6330 and then Is_Variable (Original_Node (Expression (AV)))
6334 -- Type conversion of something other than a variable
6340 -- If this node is rewritten, then test the original form, if that is
6341 -- OK, then we consider the rewritten node OK (for example, if the
6342 -- original node is a conversion, then Is_Variable will not be true
6343 -- but we still want to allow the conversion if it converts a variable).
6345 elsif Original_Node (AV) /= AV then
6346 return Is_OK_Variable_For_Out_Formal (Original_Node (AV));
6348 -- All other non-variables are rejected
6353 end Is_OK_Variable_For_Out_Formal;
6355 -----------------------------------
6356 -- Is_Partially_Initialized_Type --
6357 -----------------------------------
6359 function Is_Partially_Initialized_Type (Typ : Entity_Id) return Boolean is
6361 if Is_Scalar_Type (Typ) then
6364 elsif Is_Access_Type (Typ) then
6367 elsif Is_Array_Type (Typ) then
6369 -- If component type is partially initialized, so is array type
6371 if Is_Partially_Initialized_Type (Component_Type (Typ)) then
6374 -- Otherwise we are only partially initialized if we are fully
6375 -- initialized (this is the empty array case, no point in us
6376 -- duplicating that code here).
6379 return Is_Fully_Initialized_Type (Typ);
6382 elsif Is_Record_Type (Typ) then
6384 -- A discriminated type is always partially initialized
6386 if Has_Discriminants (Typ) then
6389 -- A tagged type is always partially initialized
6391 elsif Is_Tagged_Type (Typ) then
6394 -- Case of non-discriminated record
6400 Component_Present : Boolean := False;
6401 -- Set True if at least one component is present. If no
6402 -- components are present, then record type is fully
6403 -- initialized (another odd case, like the null array).
6406 -- Loop through components
6408 Ent := First_Entity (Typ);
6409 while Present (Ent) loop
6410 if Ekind (Ent) = E_Component then
6411 Component_Present := True;
6413 -- If a component has an initialization expression then
6414 -- the enclosing record type is partially initialized
6416 if Present (Parent (Ent))
6417 and then Present (Expression (Parent (Ent)))
6421 -- If a component is of a type which is itself partially
6422 -- initialized, then the enclosing record type is also.
6424 elsif Is_Partially_Initialized_Type (Etype (Ent)) then
6432 -- No initialized components found. If we found any components
6433 -- they were all uninitialized so the result is false.
6435 if Component_Present then
6438 -- But if we found no components, then all the components are
6439 -- initialized so we consider the type to be initialized.
6447 -- Concurrent types are always fully initialized
6449 elsif Is_Concurrent_Type (Typ) then
6452 -- For a private type, go to underlying type. If there is no underlying
6453 -- type then just assume this partially initialized. Not clear if this
6454 -- can happen in a non-error case, but no harm in testing for this.
6456 elsif Is_Private_Type (Typ) then
6458 U : constant Entity_Id := Underlying_Type (Typ);
6463 return Is_Partially_Initialized_Type (U);
6467 -- For any other type (are there any?) assume partially initialized
6472 end Is_Partially_Initialized_Type;
6474 ------------------------------------
6475 -- Is_Potentially_Persistent_Type --
6476 ------------------------------------
6478 function Is_Potentially_Persistent_Type (T : Entity_Id) return Boolean is
6483 -- For private type, test corresponding full type
6485 if Is_Private_Type (T) then
6486 return Is_Potentially_Persistent_Type (Full_View (T));
6488 -- Scalar types are potentially persistent
6490 elsif Is_Scalar_Type (T) then
6493 -- Record type is potentially persistent if not tagged and the types of
6494 -- all it components are potentially persistent, and no component has
6495 -- an initialization expression.
6497 elsif Is_Record_Type (T)
6498 and then not Is_Tagged_Type (T)
6499 and then not Is_Partially_Initialized_Type (T)
6501 Comp := First_Component (T);
6502 while Present (Comp) loop
6503 if not Is_Potentially_Persistent_Type (Etype (Comp)) then
6512 -- Array type is potentially persistent if its component type is
6513 -- potentially persistent and if all its constraints are static.
6515 elsif Is_Array_Type (T) then
6516 if not Is_Potentially_Persistent_Type (Component_Type (T)) then
6520 Indx := First_Index (T);
6521 while Present (Indx) loop
6522 if not Is_OK_Static_Subtype (Etype (Indx)) then
6531 -- All other types are not potentially persistent
6536 end Is_Potentially_Persistent_Type;
6538 ---------------------------------
6539 -- Is_Protected_Self_Reference --
6540 ---------------------------------
6542 function Is_Protected_Self_Reference (N : Node_Id) return Boolean is
6544 function In_Access_Definition (N : Node_Id) return Boolean;
6545 -- Returns true if N belongs to an access definition
6547 --------------------------
6548 -- In_Access_Definition --
6549 --------------------------
6551 function In_Access_Definition (N : Node_Id) return Boolean is
6556 while Present (P) loop
6557 if Nkind (P) = N_Access_Definition then
6565 end In_Access_Definition;
6567 -- Start of processing for Is_Protected_Self_Reference
6570 -- Verify that prefix is analyzed and has the proper form. Note that
6571 -- the attributes Elab_Spec, Elab_Body, and UET_Address, which also
6572 -- produce the address of an entity, do not analyze their prefix
6573 -- because they denote entities that are not necessarily visible.
6574 -- Neither of them can apply to a protected type.
6576 return Ada_Version >= Ada_05
6577 and then Is_Entity_Name (N)
6578 and then Present (Entity (N))
6579 and then Is_Protected_Type (Entity (N))
6580 and then In_Open_Scopes (Entity (N))
6581 and then not In_Access_Definition (N);
6582 end Is_Protected_Self_Reference;
6584 -----------------------------
6585 -- Is_RCI_Pkg_Spec_Or_Body --
6586 -----------------------------
6588 function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
6590 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
6591 -- Return True if the unit of Cunit is an RCI package declaration
6593 ---------------------------
6594 -- Is_RCI_Pkg_Decl_Cunit --
6595 ---------------------------
6597 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean is
6598 The_Unit : constant Node_Id := Unit (Cunit);
6601 if Nkind (The_Unit) /= N_Package_Declaration then
6605 return Is_Remote_Call_Interface (Defining_Entity (The_Unit));
6606 end Is_RCI_Pkg_Decl_Cunit;
6608 -- Start of processing for Is_RCI_Pkg_Spec_Or_Body
6611 return Is_RCI_Pkg_Decl_Cunit (Cunit)
6613 (Nkind (Unit (Cunit)) = N_Package_Body
6614 and then Is_RCI_Pkg_Decl_Cunit (Library_Unit (Cunit)));
6615 end Is_RCI_Pkg_Spec_Or_Body;
6617 -----------------------------------------
6618 -- Is_Remote_Access_To_Class_Wide_Type --
6619 -----------------------------------------
6621 function Is_Remote_Access_To_Class_Wide_Type
6622 (E : Entity_Id) return Boolean
6625 -- A remote access to class-wide type is a general access to object type
6626 -- declared in the visible part of a Remote_Types or Remote_Call_
6629 return Ekind (E) = E_General_Access_Type
6630 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
6631 end Is_Remote_Access_To_Class_Wide_Type;
6633 -----------------------------------------
6634 -- Is_Remote_Access_To_Subprogram_Type --
6635 -----------------------------------------
6637 function Is_Remote_Access_To_Subprogram_Type
6638 (E : Entity_Id) return Boolean
6641 return (Ekind (E) = E_Access_Subprogram_Type
6642 or else (Ekind (E) = E_Record_Type
6643 and then Present (Corresponding_Remote_Type (E))))
6644 and then (Is_Remote_Call_Interface (E) or else Is_Remote_Types (E));
6645 end Is_Remote_Access_To_Subprogram_Type;
6647 --------------------
6648 -- Is_Remote_Call --
6649 --------------------
6651 function Is_Remote_Call (N : Node_Id) return Boolean is
6653 if Nkind (N) /= N_Procedure_Call_Statement
6654 and then Nkind (N) /= N_Function_Call
6656 -- An entry call cannot be remote
6660 elsif Nkind (Name (N)) in N_Has_Entity
6661 and then Is_Remote_Call_Interface (Entity (Name (N)))
6663 -- A subprogram declared in the spec of a RCI package is remote
6667 elsif Nkind (Name (N)) = N_Explicit_Dereference
6668 and then Is_Remote_Access_To_Subprogram_Type
6669 (Etype (Prefix (Name (N))))
6671 -- The dereference of a RAS is a remote call
6675 elsif Present (Controlling_Argument (N))
6676 and then Is_Remote_Access_To_Class_Wide_Type
6677 (Etype (Controlling_Argument (N)))
6679 -- Any primitive operation call with a controlling argument of
6680 -- a RACW type is a remote call.
6685 -- All other calls are local calls
6690 ----------------------
6691 -- Is_Renamed_Entry --
6692 ----------------------
6694 function Is_Renamed_Entry (Proc_Nam : Entity_Id) return Boolean is
6695 Orig_Node : Node_Id := Empty;
6696 Subp_Decl : Node_Id := Parent (Parent (Proc_Nam));
6698 function Is_Entry (Nam : Node_Id) return Boolean;
6699 -- Determine whether Nam is an entry. Traverse selectors if there are
6700 -- nested selected components.
6706 function Is_Entry (Nam : Node_Id) return Boolean is
6708 if Nkind (Nam) = N_Selected_Component then
6709 return Is_Entry (Selector_Name (Nam));
6712 return Ekind (Entity (Nam)) = E_Entry;
6715 -- Start of processing for Is_Renamed_Entry
6718 if Present (Alias (Proc_Nam)) then
6719 Subp_Decl := Parent (Parent (Alias (Proc_Nam)));
6722 -- Look for a rewritten subprogram renaming declaration
6724 if Nkind (Subp_Decl) = N_Subprogram_Declaration
6725 and then Present (Original_Node (Subp_Decl))
6727 Orig_Node := Original_Node (Subp_Decl);
6730 -- The rewritten subprogram is actually an entry
6732 if Present (Orig_Node)
6733 and then Nkind (Orig_Node) = N_Subprogram_Renaming_Declaration
6734 and then Is_Entry (Name (Orig_Node))
6740 end Is_Renamed_Entry;
6742 ----------------------
6743 -- Is_Selector_Name --
6744 ----------------------
6746 function Is_Selector_Name (N : Node_Id) return Boolean is
6748 if not Is_List_Member (N) then
6750 P : constant Node_Id := Parent (N);
6751 K : constant Node_Kind := Nkind (P);
6754 (K = N_Expanded_Name or else
6755 K = N_Generic_Association or else
6756 K = N_Parameter_Association or else
6757 K = N_Selected_Component)
6758 and then Selector_Name (P) = N;
6763 L : constant List_Id := List_Containing (N);
6764 P : constant Node_Id := Parent (L);
6766 return (Nkind (P) = N_Discriminant_Association
6767 and then Selector_Names (P) = L)
6769 (Nkind (P) = N_Component_Association
6770 and then Choices (P) = L);
6773 end Is_Selector_Name;
6779 function Is_Statement (N : Node_Id) return Boolean is
6782 Nkind (N) in N_Statement_Other_Than_Procedure_Call
6783 or else Nkind (N) = N_Procedure_Call_Statement;
6786 ---------------------------------
6787 -- Is_Synchronized_Tagged_Type --
6788 ---------------------------------
6790 function Is_Synchronized_Tagged_Type (E : Entity_Id) return Boolean is
6791 Kind : constant Entity_Kind := Ekind (Base_Type (E));
6794 -- A task or protected type derived from an interface is a tagged type.
6795 -- Such a tagged type is called a synchronized tagged type, as are
6796 -- synchronized interfaces and private extensions whose declaration
6797 -- includes the reserved word synchronized.
6799 return (Is_Tagged_Type (E)
6800 and then (Kind = E_Task_Type
6801 or else Kind = E_Protected_Type))
6804 and then Is_Synchronized_Interface (E))
6806 (Ekind (E) = E_Record_Type_With_Private
6807 and then (Synchronized_Present (Parent (E))
6808 or else Is_Synchronized_Interface (Etype (E))));
6809 end Is_Synchronized_Tagged_Type;
6815 function Is_Transfer (N : Node_Id) return Boolean is
6816 Kind : constant Node_Kind := Nkind (N);
6819 if Kind = N_Simple_Return_Statement
6821 Kind = N_Extended_Return_Statement
6823 Kind = N_Goto_Statement
6825 Kind = N_Raise_Statement
6827 Kind = N_Requeue_Statement
6831 elsif (Kind = N_Exit_Statement or else Kind in N_Raise_xxx_Error)
6832 and then No (Condition (N))
6836 elsif Kind = N_Procedure_Call_Statement
6837 and then Is_Entity_Name (Name (N))
6838 and then Present (Entity (Name (N)))
6839 and then No_Return (Entity (Name (N)))
6843 elsif Nkind (Original_Node (N)) = N_Raise_Statement then
6855 function Is_True (U : Uint) return Boolean is
6864 function Is_Value_Type (T : Entity_Id) return Boolean is
6866 return VM_Target = CLI_Target
6867 and then Chars (T) /= No_Name
6868 and then Get_Name_String (Chars (T)) = "valuetype";
6875 function Is_Variable (N : Node_Id) return Boolean is
6877 Orig_Node : constant Node_Id := Original_Node (N);
6878 -- We do the test on the original node, since this is basically a
6879 -- test of syntactic categories, so it must not be disturbed by
6880 -- whatever rewriting might have occurred. For example, an aggregate,
6881 -- which is certainly NOT a variable, could be turned into a variable
6884 function In_Protected_Function (E : Entity_Id) return Boolean;
6885 -- Within a protected function, the private components of the
6886 -- enclosing protected type are constants. A function nested within
6887 -- a (protected) procedure is not itself protected.
6889 function Is_Variable_Prefix (P : Node_Id) return Boolean;
6890 -- Prefixes can involve implicit dereferences, in which case we
6891 -- must test for the case of a reference of a constant access
6892 -- type, which can never be a variable.
6894 ---------------------------
6895 -- In_Protected_Function --
6896 ---------------------------
6898 function In_Protected_Function (E : Entity_Id) return Boolean is
6899 Prot : constant Entity_Id := Scope (E);
6903 if not Is_Protected_Type (Prot) then
6907 while Present (S) and then S /= Prot loop
6908 if Ekind (S) = E_Function
6909 and then Scope (S) = Prot
6919 end In_Protected_Function;
6921 ------------------------
6922 -- Is_Variable_Prefix --
6923 ------------------------
6925 function Is_Variable_Prefix (P : Node_Id) return Boolean is
6927 if Is_Access_Type (Etype (P)) then
6928 return not Is_Access_Constant (Root_Type (Etype (P)));
6930 -- For the case of an indexed component whose prefix has a packed
6931 -- array type, the prefix has been rewritten into a type conversion.
6932 -- Determine variable-ness from the converted expression.
6934 elsif Nkind (P) = N_Type_Conversion
6935 and then not Comes_From_Source (P)
6936 and then Is_Array_Type (Etype (P))
6937 and then Is_Packed (Etype (P))
6939 return Is_Variable (Expression (P));
6942 return Is_Variable (P);
6944 end Is_Variable_Prefix;
6946 -- Start of processing for Is_Variable
6949 -- Definitely OK if Assignment_OK is set. Since this is something that
6950 -- only gets set for expanded nodes, the test is on N, not Orig_Node.
6952 if Nkind (N) in N_Subexpr and then Assignment_OK (N) then
6955 -- Normally we go to the original node, but there is one exception
6956 -- where we use the rewritten node, namely when it is an explicit
6957 -- dereference. The generated code may rewrite a prefix which is an
6958 -- access type with an explicit dereference. The dereference is a
6959 -- variable, even though the original node may not be (since it could
6960 -- be a constant of the access type).
6962 -- In Ada 2005 we have a further case to consider: the prefix may be
6963 -- a function call given in prefix notation. The original node appears
6964 -- to be a selected component, but we need to examine the call.
6966 elsif Nkind (N) = N_Explicit_Dereference
6967 and then Nkind (Orig_Node) /= N_Explicit_Dereference
6968 and then Present (Etype (Orig_Node))
6969 and then Is_Access_Type (Etype (Orig_Node))
6971 -- Note that if the prefix is an explicit dereference that does not
6972 -- come from source, we must check for a rewritten function call in
6973 -- prefixed notation before other forms of rewriting, to prevent a
6977 (Nkind (Orig_Node) = N_Function_Call
6978 and then not Is_Access_Constant (Etype (Prefix (N))))
6980 Is_Variable_Prefix (Original_Node (Prefix (N)));
6982 -- A function call is never a variable
6984 elsif Nkind (N) = N_Function_Call then
6987 -- All remaining checks use the original node
6989 elsif Is_Entity_Name (Orig_Node)
6990 and then Present (Entity (Orig_Node))
6993 E : constant Entity_Id := Entity (Orig_Node);
6994 K : constant Entity_Kind := Ekind (E);
6997 return (K = E_Variable
6998 and then Nkind (Parent (E)) /= N_Exception_Handler)
6999 or else (K = E_Component
7000 and then not In_Protected_Function (E))
7001 or else K = E_Out_Parameter
7002 or else K = E_In_Out_Parameter
7003 or else K = E_Generic_In_Out_Parameter
7005 -- Current instance of type:
7007 or else (Is_Type (E) and then In_Open_Scopes (E))
7008 or else (Is_Incomplete_Or_Private_Type (E)
7009 and then In_Open_Scopes (Full_View (E)));
7013 case Nkind (Orig_Node) is
7014 when N_Indexed_Component | N_Slice =>
7015 return Is_Variable_Prefix (Prefix (Orig_Node));
7017 when N_Selected_Component =>
7018 return Is_Variable_Prefix (Prefix (Orig_Node))
7019 and then Is_Variable (Selector_Name (Orig_Node));
7021 -- For an explicit dereference, the type of the prefix cannot
7022 -- be an access to constant or an access to subprogram.
7024 when N_Explicit_Dereference =>
7026 Typ : constant Entity_Id := Etype (Prefix (Orig_Node));
7028 return Is_Access_Type (Typ)
7029 and then not Is_Access_Constant (Root_Type (Typ))
7030 and then Ekind (Typ) /= E_Access_Subprogram_Type;
7033 -- The type conversion is the case where we do not deal with the
7034 -- context dependent special case of an actual parameter. Thus
7035 -- the type conversion is only considered a variable for the
7036 -- purposes of this routine if the target type is tagged. However,
7037 -- a type conversion is considered to be a variable if it does not
7038 -- come from source (this deals for example with the conversions
7039 -- of expressions to their actual subtypes).
7041 when N_Type_Conversion =>
7042 return Is_Variable (Expression (Orig_Node))
7044 (not Comes_From_Source (Orig_Node)
7046 (Is_Tagged_Type (Etype (Subtype_Mark (Orig_Node)))
7048 Is_Tagged_Type (Etype (Expression (Orig_Node)))));
7050 -- GNAT allows an unchecked type conversion as a variable. This
7051 -- only affects the generation of internal expanded code, since
7052 -- calls to instantiations of Unchecked_Conversion are never
7053 -- considered variables (since they are function calls).
7054 -- This is also true for expression actions.
7056 when N_Unchecked_Type_Conversion =>
7057 return Is_Variable (Expression (Orig_Node));
7065 ------------------------
7066 -- Is_Volatile_Object --
7067 ------------------------
7069 function Is_Volatile_Object (N : Node_Id) return Boolean is
7071 function Object_Has_Volatile_Components (N : Node_Id) return Boolean;
7072 -- Determines if given object has volatile components
7074 function Is_Volatile_Prefix (N : Node_Id) return Boolean;
7075 -- If prefix is an implicit dereference, examine designated type
7077 ------------------------
7078 -- Is_Volatile_Prefix --
7079 ------------------------
7081 function Is_Volatile_Prefix (N : Node_Id) return Boolean is
7082 Typ : constant Entity_Id := Etype (N);
7085 if Is_Access_Type (Typ) then
7087 Dtyp : constant Entity_Id := Designated_Type (Typ);
7090 return Is_Volatile (Dtyp)
7091 or else Has_Volatile_Components (Dtyp);
7095 return Object_Has_Volatile_Components (N);
7097 end Is_Volatile_Prefix;
7099 ------------------------------------
7100 -- Object_Has_Volatile_Components --
7101 ------------------------------------
7103 function Object_Has_Volatile_Components (N : Node_Id) return Boolean is
7104 Typ : constant Entity_Id := Etype (N);
7107 if Is_Volatile (Typ)
7108 or else Has_Volatile_Components (Typ)
7112 elsif Is_Entity_Name (N)
7113 and then (Has_Volatile_Components (Entity (N))
7114 or else Is_Volatile (Entity (N)))
7118 elsif Nkind (N) = N_Indexed_Component
7119 or else Nkind (N) = N_Selected_Component
7121 return Is_Volatile_Prefix (Prefix (N));
7126 end Object_Has_Volatile_Components;
7128 -- Start of processing for Is_Volatile_Object
7131 if Is_Volatile (Etype (N))
7132 or else (Is_Entity_Name (N) and then Is_Volatile (Entity (N)))
7136 elsif Nkind (N) = N_Indexed_Component
7137 or else Nkind (N) = N_Selected_Component
7139 return Is_Volatile_Prefix (Prefix (N));
7144 end Is_Volatile_Object;
7146 -------------------------
7147 -- Kill_Current_Values --
7148 -------------------------
7150 procedure Kill_Current_Values
7152 Last_Assignment_Only : Boolean := False)
7155 -- ??? do we have to worry about clearing cached checks?
7157 if Is_Assignable (Ent) then
7158 Set_Last_Assignment (Ent, Empty);
7161 if Is_Object (Ent) then
7162 if not Last_Assignment_Only then
7164 Set_Current_Value (Ent, Empty);
7166 if not Can_Never_Be_Null (Ent) then
7167 Set_Is_Known_Non_Null (Ent, False);
7170 Set_Is_Known_Null (Ent, False);
7172 -- Reset Is_Known_Valid unless type is always valid, or if we have
7173 -- a loop parameter (loop parameters are always valid, since their
7174 -- bounds are defined by the bounds given in the loop header).
7176 if not Is_Known_Valid (Etype (Ent))
7177 and then Ekind (Ent) /= E_Loop_Parameter
7179 Set_Is_Known_Valid (Ent, False);
7183 end Kill_Current_Values;
7185 procedure Kill_Current_Values (Last_Assignment_Only : Boolean := False) is
7188 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id);
7189 -- Clear current value for entity E and all entities chained to E
7191 ------------------------------------------
7192 -- Kill_Current_Values_For_Entity_Chain --
7193 ------------------------------------------
7195 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id) is
7199 while Present (Ent) loop
7200 Kill_Current_Values (Ent, Last_Assignment_Only);
7203 end Kill_Current_Values_For_Entity_Chain;
7205 -- Start of processing for Kill_Current_Values
7208 -- Kill all saved checks, a special case of killing saved values
7210 if not Last_Assignment_Only then
7214 -- Loop through relevant scopes, which includes the current scope and
7215 -- any parent scopes if the current scope is a block or a package.
7220 -- Clear current values of all entities in current scope
7222 Kill_Current_Values_For_Entity_Chain (First_Entity (S));
7224 -- If scope is a package, also clear current values of all
7225 -- private entities in the scope.
7227 if Is_Package_Or_Generic_Package (S)
7228 or else Is_Concurrent_Type (S)
7230 Kill_Current_Values_For_Entity_Chain (First_Private_Entity (S));
7233 -- If this is a not a subprogram, deal with parents
7235 if not Is_Subprogram (S) then
7237 exit Scope_Loop when S = Standard_Standard;
7241 end loop Scope_Loop;
7242 end Kill_Current_Values;
7244 --------------------------
7245 -- Kill_Size_Check_Code --
7246 --------------------------
7248 procedure Kill_Size_Check_Code (E : Entity_Id) is
7250 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
7251 and then Present (Size_Check_Code (E))
7253 Remove (Size_Check_Code (E));
7254 Set_Size_Check_Code (E, Empty);
7256 end Kill_Size_Check_Code;
7258 --------------------------
7259 -- Known_To_Be_Assigned --
7260 --------------------------
7262 function Known_To_Be_Assigned (N : Node_Id) return Boolean is
7263 P : constant Node_Id := Parent (N);
7268 -- Test left side of assignment
7270 when N_Assignment_Statement =>
7271 return N = Name (P);
7273 -- Function call arguments are never lvalues
7275 when N_Function_Call =>
7278 -- Positional parameter for procedure or accept call
7280 when N_Procedure_Call_Statement |
7289 Proc := Get_Subprogram_Entity (P);
7295 -- If we are not a list member, something is strange, so
7296 -- be conservative and return False.
7298 if not Is_List_Member (N) then
7302 -- We are going to find the right formal by stepping forward
7303 -- through the formals, as we step backwards in the actuals.
7305 Form := First_Formal (Proc);
7308 -- If no formal, something is weird, so be conservative
7309 -- and return False.
7320 return Ekind (Form) /= E_In_Parameter;
7323 -- Named parameter for procedure or accept call
7325 when N_Parameter_Association =>
7331 Proc := Get_Subprogram_Entity (Parent (P));
7337 -- Loop through formals to find the one that matches
7339 Form := First_Formal (Proc);
7341 -- If no matching formal, that's peculiar, some kind of
7342 -- previous error, so return False to be conservative.
7348 -- Else test for match
7350 if Chars (Form) = Chars (Selector_Name (P)) then
7351 return Ekind (Form) /= E_In_Parameter;
7358 -- Test for appearing in a conversion that itself appears
7359 -- in an lvalue context, since this should be an lvalue.
7361 when N_Type_Conversion =>
7362 return Known_To_Be_Assigned (P);
7364 -- All other references are definitely not known to be modifications
7370 end Known_To_Be_Assigned;
7376 function May_Be_Lvalue (N : Node_Id) return Boolean is
7377 P : constant Node_Id := Parent (N);
7382 -- Test left side of assignment
7384 when N_Assignment_Statement =>
7385 return N = Name (P);
7387 -- Test prefix of component or attribute. Note that the prefix of an
7388 -- explicit or implicit dereference cannot be an l-value.
7390 when N_Attribute_Reference =>
7391 return N = Prefix (P)
7392 and then Name_Implies_Lvalue_Prefix (Attribute_Name (P));
7394 -- For an expanded name, the name is an lvalue if the expanded name
7395 -- is an lvalue, but the prefix is never an lvalue, since it is just
7396 -- the scope where the name is found.
7398 when N_Expanded_Name =>
7399 if N = Prefix (P) then
7400 return May_Be_Lvalue (P);
7405 -- For a selected component A.B, A is certainly an lvalue if A.B is.
7406 -- B is a little interesting, if we have A.B := 3, there is some
7407 -- discussion as to whether B is an lvalue or not, we choose to say
7408 -- it is. Note however that A is not an lvalue if it is of an access
7409 -- type since this is an implicit dereference.
7411 when N_Selected_Component =>
7413 and then Present (Etype (N))
7414 and then Is_Access_Type (Etype (N))
7418 return May_Be_Lvalue (P);
7421 -- For an indexed component or slice, the index or slice bounds is
7422 -- never an lvalue. The prefix is an lvalue if the indexed component
7423 -- or slice is an lvalue, except if it is an access type, where we
7424 -- have an implicit dereference.
7426 when N_Indexed_Component =>
7428 or else (Present (Etype (N)) and then Is_Access_Type (Etype (N)))
7432 return May_Be_Lvalue (P);
7435 -- Prefix of a reference is an lvalue if the reference is an lvalue
7438 return May_Be_Lvalue (P);
7440 -- Prefix of explicit dereference is never an lvalue
7442 when N_Explicit_Dereference =>
7445 -- Function call arguments are never lvalues
7447 when N_Function_Call =>
7450 -- Positional parameter for procedure, entry, or accept call
7452 when N_Procedure_Call_Statement |
7453 N_Entry_Call_Statement |
7462 Proc := Get_Subprogram_Entity (P);
7468 -- If we are not a list member, something is strange, so
7469 -- be conservative and return True.
7471 if not Is_List_Member (N) then
7475 -- We are going to find the right formal by stepping forward
7476 -- through the formals, as we step backwards in the actuals.
7478 Form := First_Formal (Proc);
7481 -- If no formal, something is weird, so be conservative
7493 return Ekind (Form) /= E_In_Parameter;
7496 -- Named parameter for procedure or accept call
7498 when N_Parameter_Association =>
7504 Proc := Get_Subprogram_Entity (Parent (P));
7510 -- Loop through formals to find the one that matches
7512 Form := First_Formal (Proc);
7514 -- If no matching formal, that's peculiar, some kind of
7515 -- previous error, so return True to be conservative.
7521 -- Else test for match
7523 if Chars (Form) = Chars (Selector_Name (P)) then
7524 return Ekind (Form) /= E_In_Parameter;
7531 -- Test for appearing in a conversion that itself appears in an
7532 -- lvalue context, since this should be an lvalue.
7534 when N_Type_Conversion =>
7535 return May_Be_Lvalue (P);
7537 -- Test for appearance in object renaming declaration
7539 when N_Object_Renaming_Declaration =>
7542 -- All other references are definitely not lvalues
7550 -----------------------
7551 -- Mark_Coextensions --
7552 -----------------------
7554 procedure Mark_Coextensions (Context_Nod : Node_Id; Root_Nod : Node_Id) is
7555 Is_Dynamic : Boolean;
7556 -- Indicates whether the context causes nested coextensions to be
7557 -- dynamic or static
7559 function Mark_Allocator (N : Node_Id) return Traverse_Result;
7560 -- Recognize an allocator node and label it as a dynamic coextension
7562 --------------------
7563 -- Mark_Allocator --
7564 --------------------
7566 function Mark_Allocator (N : Node_Id) return Traverse_Result is
7568 if Nkind (N) = N_Allocator then
7570 Set_Is_Dynamic_Coextension (N);
7572 Set_Is_Static_Coextension (N);
7579 procedure Mark_Allocators is new Traverse_Proc (Mark_Allocator);
7581 -- Start of processing Mark_Coextensions
7584 case Nkind (Context_Nod) is
7585 when N_Assignment_Statement |
7586 N_Simple_Return_Statement =>
7587 Is_Dynamic := Nkind (Expression (Context_Nod)) = N_Allocator;
7589 when N_Object_Declaration =>
7590 Is_Dynamic := Nkind (Root_Nod) = N_Allocator;
7592 -- This routine should not be called for constructs which may not
7593 -- contain coextensions.
7596 raise Program_Error;
7599 Mark_Allocators (Root_Nod);
7600 end Mark_Coextensions;
7602 ----------------------
7603 -- Needs_One_Actual --
7604 ----------------------
7606 function Needs_One_Actual (E : Entity_Id) return Boolean is
7610 if Ada_Version >= Ada_05
7611 and then Present (First_Formal (E))
7613 Formal := Next_Formal (First_Formal (E));
7614 while Present (Formal) loop
7615 if No (Default_Value (Formal)) then
7619 Next_Formal (Formal);
7627 end Needs_One_Actual;
7629 ------------------------
7630 -- New_Copy_List_Tree --
7631 ------------------------
7633 function New_Copy_List_Tree (List : List_Id) return List_Id is
7638 if List = No_List then
7645 while Present (E) loop
7646 Append (New_Copy_Tree (E), NL);
7652 end New_Copy_List_Tree;
7658 use Atree.Unchecked_Access;
7659 use Atree_Private_Part;
7661 -- Our approach here requires a two pass traversal of the tree. The
7662 -- first pass visits all nodes that eventually will be copied looking
7663 -- for defining Itypes. If any defining Itypes are found, then they are
7664 -- copied, and an entry is added to the replacement map. In the second
7665 -- phase, the tree is copied, using the replacement map to replace any
7666 -- Itype references within the copied tree.
7668 -- The following hash tables are used if the Map supplied has more
7669 -- than hash threshhold entries to speed up access to the map. If
7670 -- there are fewer entries, then the map is searched sequentially
7671 -- (because setting up a hash table for only a few entries takes
7672 -- more time than it saves.
7674 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
7675 -- Hash function used for hash operations
7681 function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
7683 return Nat (E) mod (NCT_Header_Num'Last + 1);
7690 -- The hash table NCT_Assoc associates old entities in the table
7691 -- with their corresponding new entities (i.e. the pairs of entries
7692 -- presented in the original Map argument are Key-Element pairs).
7694 package NCT_Assoc is new Simple_HTable (
7695 Header_Num => NCT_Header_Num,
7696 Element => Entity_Id,
7697 No_Element => Empty,
7699 Hash => New_Copy_Hash,
7700 Equal => Types."=");
7702 ---------------------
7703 -- NCT_Itype_Assoc --
7704 ---------------------
7706 -- The hash table NCT_Itype_Assoc contains entries only for those
7707 -- old nodes which have a non-empty Associated_Node_For_Itype set.
7708 -- The key is the associated node, and the element is the new node
7709 -- itself (NOT the associated node for the new node).
7711 package NCT_Itype_Assoc is new Simple_HTable (
7712 Header_Num => NCT_Header_Num,
7713 Element => Entity_Id,
7714 No_Element => Empty,
7716 Hash => New_Copy_Hash,
7717 Equal => Types."=");
7719 -- Start of processing for New_Copy_Tree function
7721 function New_Copy_Tree
7723 Map : Elist_Id := No_Elist;
7724 New_Sloc : Source_Ptr := No_Location;
7725 New_Scope : Entity_Id := Empty) return Node_Id
7727 Actual_Map : Elist_Id := Map;
7728 -- This is the actual map for the copy. It is initialized with the
7729 -- given elements, and then enlarged as required for Itypes that are
7730 -- copied during the first phase of the copy operation. The visit
7731 -- procedures add elements to this map as Itypes are encountered.
7732 -- The reason we cannot use Map directly, is that it may well be
7733 -- (and normally is) initialized to No_Elist, and if we have mapped
7734 -- entities, we have to reset it to point to a real Elist.
7736 function Assoc (N : Node_Or_Entity_Id) return Node_Id;
7737 -- Called during second phase to map entities into their corresponding
7738 -- copies using Actual_Map. If the argument is not an entity, or is not
7739 -- in Actual_Map, then it is returned unchanged.
7741 procedure Build_NCT_Hash_Tables;
7742 -- Builds hash tables (number of elements >= threshold value)
7744 function Copy_Elist_With_Replacement
7745 (Old_Elist : Elist_Id) return Elist_Id;
7746 -- Called during second phase to copy element list doing replacements
7748 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
7749 -- Called during the second phase to process a copied Itype. The actual
7750 -- copy happened during the first phase (so that we could make the entry
7751 -- in the mapping), but we still have to deal with the descendents of
7752 -- the copied Itype and copy them where necessary.
7754 function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
7755 -- Called during second phase to copy list doing replacements
7757 function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
7758 -- Called during second phase to copy node doing replacements
7760 procedure Visit_Elist (E : Elist_Id);
7761 -- Called during first phase to visit all elements of an Elist
7763 procedure Visit_Field (F : Union_Id; N : Node_Id);
7764 -- Visit a single field, recursing to call Visit_Node or Visit_List
7765 -- if the field is a syntactic descendent of the current node (i.e.
7766 -- its parent is Node N).
7768 procedure Visit_Itype (Old_Itype : Entity_Id);
7769 -- Called during first phase to visit subsidiary fields of a defining
7770 -- Itype, and also create a copy and make an entry in the replacement
7771 -- map for the new copy.
7773 procedure Visit_List (L : List_Id);
7774 -- Called during first phase to visit all elements of a List
7776 procedure Visit_Node (N : Node_Or_Entity_Id);
7777 -- Called during first phase to visit a node and all its subtrees
7783 function Assoc (N : Node_Or_Entity_Id) return Node_Id is
7788 if not Has_Extension (N) or else No (Actual_Map) then
7791 elsif NCT_Hash_Tables_Used then
7792 Ent := NCT_Assoc.Get (Entity_Id (N));
7794 if Present (Ent) then
7800 -- No hash table used, do serial search
7803 E := First_Elmt (Actual_Map);
7804 while Present (E) loop
7805 if Node (E) = N then
7806 return Node (Next_Elmt (E));
7808 E := Next_Elmt (Next_Elmt (E));
7816 ---------------------------
7817 -- Build_NCT_Hash_Tables --
7818 ---------------------------
7820 procedure Build_NCT_Hash_Tables is
7824 if NCT_Hash_Table_Setup then
7826 NCT_Itype_Assoc.Reset;
7829 Elmt := First_Elmt (Actual_Map);
7830 while Present (Elmt) loop
7833 -- Get new entity, and associate old and new
7836 NCT_Assoc.Set (Ent, Node (Elmt));
7838 if Is_Type (Ent) then
7840 Anode : constant Entity_Id :=
7841 Associated_Node_For_Itype (Ent);
7844 if Present (Anode) then
7846 -- Enter a link between the associated node of the
7847 -- old Itype and the new Itype, for updating later
7848 -- when node is copied.
7850 NCT_Itype_Assoc.Set (Anode, Node (Elmt));
7858 NCT_Hash_Tables_Used := True;
7859 NCT_Hash_Table_Setup := True;
7860 end Build_NCT_Hash_Tables;
7862 ---------------------------------
7863 -- Copy_Elist_With_Replacement --
7864 ---------------------------------
7866 function Copy_Elist_With_Replacement
7867 (Old_Elist : Elist_Id) return Elist_Id
7870 New_Elist : Elist_Id;
7873 if No (Old_Elist) then
7877 New_Elist := New_Elmt_List;
7879 M := First_Elmt (Old_Elist);
7880 while Present (M) loop
7881 Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
7887 end Copy_Elist_With_Replacement;
7889 ---------------------------------
7890 -- Copy_Itype_With_Replacement --
7891 ---------------------------------
7893 -- This routine exactly parallels its phase one analog Visit_Itype,
7895 procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
7897 -- Translate Next_Entity, Scope and Etype fields, in case they
7898 -- reference entities that have been mapped into copies.
7900 Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
7901 Set_Etype (New_Itype, Assoc (Etype (New_Itype)));
7903 if Present (New_Scope) then
7904 Set_Scope (New_Itype, New_Scope);
7906 Set_Scope (New_Itype, Assoc (Scope (New_Itype)));
7909 -- Copy referenced fields
7911 if Is_Discrete_Type (New_Itype) then
7912 Set_Scalar_Range (New_Itype,
7913 Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
7915 elsif Has_Discriminants (Base_Type (New_Itype)) then
7916 Set_Discriminant_Constraint (New_Itype,
7917 Copy_Elist_With_Replacement
7918 (Discriminant_Constraint (New_Itype)));
7920 elsif Is_Array_Type (New_Itype) then
7921 if Present (First_Index (New_Itype)) then
7922 Set_First_Index (New_Itype,
7923 First (Copy_List_With_Replacement
7924 (List_Containing (First_Index (New_Itype)))));
7927 if Is_Packed (New_Itype) then
7928 Set_Packed_Array_Type (New_Itype,
7929 Copy_Node_With_Replacement
7930 (Packed_Array_Type (New_Itype)));
7933 end Copy_Itype_With_Replacement;
7935 --------------------------------
7936 -- Copy_List_With_Replacement --
7937 --------------------------------
7939 function Copy_List_With_Replacement
7940 (Old_List : List_Id) return List_Id
7946 if Old_List = No_List then
7950 New_List := Empty_List;
7952 E := First (Old_List);
7953 while Present (E) loop
7954 Append (Copy_Node_With_Replacement (E), New_List);
7960 end Copy_List_With_Replacement;
7962 --------------------------------
7963 -- Copy_Node_With_Replacement --
7964 --------------------------------
7966 function Copy_Node_With_Replacement
7967 (Old_Node : Node_Id) return Node_Id
7971 procedure Adjust_Named_Associations
7972 (Old_Node : Node_Id;
7973 New_Node : Node_Id);
7974 -- If a call node has named associations, these are chained through
7975 -- the First_Named_Actual, Next_Named_Actual links. These must be
7976 -- propagated separately to the new parameter list, because these
7977 -- are not syntactic fields.
7979 function Copy_Field_With_Replacement
7980 (Field : Union_Id) return Union_Id;
7981 -- Given Field, which is a field of Old_Node, return a copy of it
7982 -- if it is a syntactic field (i.e. its parent is Node), setting
7983 -- the parent of the copy to poit to New_Node. Otherwise returns
7984 -- the field (possibly mapped if it is an entity).
7986 -------------------------------
7987 -- Adjust_Named_Associations --
7988 -------------------------------
7990 procedure Adjust_Named_Associations
7991 (Old_Node : Node_Id;
8001 Old_E := First (Parameter_Associations (Old_Node));
8002 New_E := First (Parameter_Associations (New_Node));
8003 while Present (Old_E) loop
8004 if Nkind (Old_E) = N_Parameter_Association
8005 and then Present (Next_Named_Actual (Old_E))
8007 if First_Named_Actual (Old_Node)
8008 = Explicit_Actual_Parameter (Old_E)
8010 Set_First_Named_Actual
8011 (New_Node, Explicit_Actual_Parameter (New_E));
8014 -- Now scan parameter list from the beginning,to locate
8015 -- next named actual, which can be out of order.
8017 Old_Next := First (Parameter_Associations (Old_Node));
8018 New_Next := First (Parameter_Associations (New_Node));
8020 while Nkind (Old_Next) /= N_Parameter_Association
8021 or else Explicit_Actual_Parameter (Old_Next)
8022 /= Next_Named_Actual (Old_E)
8028 Set_Next_Named_Actual
8029 (New_E, Explicit_Actual_Parameter (New_Next));
8035 end Adjust_Named_Associations;
8037 ---------------------------------
8038 -- Copy_Field_With_Replacement --
8039 ---------------------------------
8041 function Copy_Field_With_Replacement
8042 (Field : Union_Id) return Union_Id
8045 if Field = Union_Id (Empty) then
8048 elsif Field in Node_Range then
8050 Old_N : constant Node_Id := Node_Id (Field);
8054 -- If syntactic field, as indicated by the parent pointer
8055 -- being set, then copy the referenced node recursively.
8057 if Parent (Old_N) = Old_Node then
8058 New_N := Copy_Node_With_Replacement (Old_N);
8060 if New_N /= Old_N then
8061 Set_Parent (New_N, New_Node);
8064 -- For semantic fields, update possible entity reference
8065 -- from the replacement map.
8068 New_N := Assoc (Old_N);
8071 return Union_Id (New_N);
8074 elsif Field in List_Range then
8076 Old_L : constant List_Id := List_Id (Field);
8080 -- If syntactic field, as indicated by the parent pointer,
8081 -- then recursively copy the entire referenced list.
8083 if Parent (Old_L) = Old_Node then
8084 New_L := Copy_List_With_Replacement (Old_L);
8085 Set_Parent (New_L, New_Node);
8087 -- For semantic list, just returned unchanged
8093 return Union_Id (New_L);
8096 -- Anything other than a list or a node is returned unchanged
8101 end Copy_Field_With_Replacement;
8103 -- Start of processing for Copy_Node_With_Replacement
8106 if Old_Node <= Empty_Or_Error then
8109 elsif Has_Extension (Old_Node) then
8110 return Assoc (Old_Node);
8113 New_Node := New_Copy (Old_Node);
8115 -- If the node we are copying is the associated node of a
8116 -- previously copied Itype, then adjust the associated node
8117 -- of the copy of that Itype accordingly.
8119 if Present (Actual_Map) then
8125 -- Case of hash table used
8127 if NCT_Hash_Tables_Used then
8128 Ent := NCT_Itype_Assoc.Get (Old_Node);
8130 if Present (Ent) then
8131 Set_Associated_Node_For_Itype (Ent, New_Node);
8134 -- Case of no hash table used
8137 E := First_Elmt (Actual_Map);
8138 while Present (E) loop
8139 if Is_Itype (Node (E))
8141 Old_Node = Associated_Node_For_Itype (Node (E))
8143 Set_Associated_Node_For_Itype
8144 (Node (Next_Elmt (E)), New_Node);
8147 E := Next_Elmt (Next_Elmt (E));
8153 -- Recursively copy descendents
8156 (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
8158 (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
8160 (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
8162 (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
8164 (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
8166 -- Adjust Sloc of new node if necessary
8168 if New_Sloc /= No_Location then
8169 Set_Sloc (New_Node, New_Sloc);
8171 -- If we adjust the Sloc, then we are essentially making
8172 -- a completely new node, so the Comes_From_Source flag
8173 -- should be reset to the proper default value.
8175 Nodes.Table (New_Node).Comes_From_Source :=
8176 Default_Node.Comes_From_Source;
8179 -- If the node is call and has named associations,
8180 -- set the corresponding links in the copy.
8182 if (Nkind (Old_Node) = N_Function_Call
8183 or else Nkind (Old_Node) = N_Entry_Call_Statement
8185 Nkind (Old_Node) = N_Procedure_Call_Statement)
8186 and then Present (First_Named_Actual (Old_Node))
8188 Adjust_Named_Associations (Old_Node, New_Node);
8191 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
8192 -- The replacement mechanism applies to entities, and is not used
8193 -- here. Eventually we may need a more general graph-copying
8194 -- routine. For now, do a sequential search to find desired node.
8196 if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
8197 and then Present (First_Real_Statement (Old_Node))
8200 Old_F : constant Node_Id := First_Real_Statement (Old_Node);
8204 N1 := First (Statements (Old_Node));
8205 N2 := First (Statements (New_Node));
8207 while N1 /= Old_F loop
8212 Set_First_Real_Statement (New_Node, N2);
8217 -- All done, return copied node
8220 end Copy_Node_With_Replacement;
8226 procedure Visit_Elist (E : Elist_Id) is
8230 Elmt := First_Elmt (E);
8232 while Elmt /= No_Elmt loop
8233 Visit_Node (Node (Elmt));
8243 procedure Visit_Field (F : Union_Id; N : Node_Id) is
8245 if F = Union_Id (Empty) then
8248 elsif F in Node_Range then
8250 -- Copy node if it is syntactic, i.e. its parent pointer is
8251 -- set to point to the field that referenced it (certain
8252 -- Itypes will also meet this criterion, which is fine, since
8253 -- these are clearly Itypes that do need to be copied, since
8254 -- we are copying their parent.)
8256 if Parent (Node_Id (F)) = N then
8257 Visit_Node (Node_Id (F));
8260 -- Another case, if we are pointing to an Itype, then we want
8261 -- to copy it if its associated node is somewhere in the tree
8264 -- Note: the exclusion of self-referential copies is just an
8265 -- optimization, since the search of the already copied list
8266 -- would catch it, but it is a common case (Etype pointing
8267 -- to itself for an Itype that is a base type).
8269 elsif Has_Extension (Node_Id (F))
8270 and then Is_Itype (Entity_Id (F))
8271 and then Node_Id (F) /= N
8277 P := Associated_Node_For_Itype (Node_Id (F));
8278 while Present (P) loop
8280 Visit_Node (Node_Id (F));
8287 -- An Itype whose parent is not being copied definitely
8288 -- should NOT be copied, since it does not belong in any
8289 -- sense to the copied subtree.
8295 elsif F in List_Range
8296 and then Parent (List_Id (F)) = N
8298 Visit_List (List_Id (F));
8307 procedure Visit_Itype (Old_Itype : Entity_Id) is
8308 New_Itype : Entity_Id;
8313 -- Itypes that describe the designated type of access to subprograms
8314 -- have the structure of subprogram declarations, with signatures,
8315 -- etc. Either we duplicate the signatures completely, or choose to
8316 -- share such itypes, which is fine because their elaboration will
8317 -- have no side effects.
8319 if Ekind (Old_Itype) = E_Subprogram_Type then
8323 New_Itype := New_Copy (Old_Itype);
8325 -- The new Itype has all the attributes of the old one, and
8326 -- we just copy the contents of the entity. However, the back-end
8327 -- needs different names for debugging purposes, so we create a
8328 -- new internal name for it in all cases.
8330 Set_Chars (New_Itype, New_Internal_Name ('T'));
8332 -- If our associated node is an entity that has already been copied,
8333 -- then set the associated node of the copy to point to the right
8334 -- copy. If we have copied an Itype that is itself the associated
8335 -- node of some previously copied Itype, then we set the right
8336 -- pointer in the other direction.
8338 if Present (Actual_Map) then
8340 -- Case of hash tables used
8342 if NCT_Hash_Tables_Used then
8344 Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
8346 if Present (Ent) then
8347 Set_Associated_Node_For_Itype (New_Itype, Ent);
8350 Ent := NCT_Itype_Assoc.Get (Old_Itype);
8351 if Present (Ent) then
8352 Set_Associated_Node_For_Itype (Ent, New_Itype);
8354 -- If the hash table has no association for this Itype and
8355 -- its associated node, enter one now.
8359 (Associated_Node_For_Itype (Old_Itype), New_Itype);
8362 -- Case of hash tables not used
8365 E := First_Elmt (Actual_Map);
8366 while Present (E) loop
8367 if Associated_Node_For_Itype (Old_Itype) = Node (E) then
8368 Set_Associated_Node_For_Itype
8369 (New_Itype, Node (Next_Elmt (E)));
8372 if Is_Type (Node (E))
8374 Old_Itype = Associated_Node_For_Itype (Node (E))
8376 Set_Associated_Node_For_Itype
8377 (Node (Next_Elmt (E)), New_Itype);
8380 E := Next_Elmt (Next_Elmt (E));
8385 if Present (Freeze_Node (New_Itype)) then
8386 Set_Is_Frozen (New_Itype, False);
8387 Set_Freeze_Node (New_Itype, Empty);
8390 -- Add new association to map
8392 if No (Actual_Map) then
8393 Actual_Map := New_Elmt_List;
8396 Append_Elmt (Old_Itype, Actual_Map);
8397 Append_Elmt (New_Itype, Actual_Map);
8399 if NCT_Hash_Tables_Used then
8400 NCT_Assoc.Set (Old_Itype, New_Itype);
8403 NCT_Table_Entries := NCT_Table_Entries + 1;
8405 if NCT_Table_Entries > NCT_Hash_Threshhold then
8406 Build_NCT_Hash_Tables;
8410 -- If a record subtype is simply copied, the entity list will be
8411 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
8413 if Ekind (Old_Itype) = E_Record_Subtype
8414 or else Ekind (Old_Itype) = E_Class_Wide_Subtype
8416 Set_Cloned_Subtype (New_Itype, Old_Itype);
8419 -- Visit descendents that eventually get copied
8421 Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
8423 if Is_Discrete_Type (Old_Itype) then
8424 Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
8426 elsif Has_Discriminants (Base_Type (Old_Itype)) then
8427 -- ??? This should involve call to Visit_Field
8428 Visit_Elist (Discriminant_Constraint (Old_Itype));
8430 elsif Is_Array_Type (Old_Itype) then
8431 if Present (First_Index (Old_Itype)) then
8432 Visit_Field (Union_Id (List_Containing
8433 (First_Index (Old_Itype))),
8437 if Is_Packed (Old_Itype) then
8438 Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)),
8448 procedure Visit_List (L : List_Id) is
8451 if L /= No_List then
8454 while Present (N) loop
8465 procedure Visit_Node (N : Node_Or_Entity_Id) is
8467 -- Start of processing for Visit_Node
8470 -- Handle case of an Itype, which must be copied
8472 if Has_Extension (N)
8473 and then Is_Itype (N)
8475 -- Nothing to do if already in the list. This can happen with an
8476 -- Itype entity that appears more than once in the tree.
8477 -- Note that we do not want to visit descendents in this case.
8479 -- Test for already in list when hash table is used
8481 if NCT_Hash_Tables_Used then
8482 if Present (NCT_Assoc.Get (Entity_Id (N))) then
8486 -- Test for already in list when hash table not used
8492 if Present (Actual_Map) then
8493 E := First_Elmt (Actual_Map);
8494 while Present (E) loop
8495 if Node (E) = N then
8498 E := Next_Elmt (Next_Elmt (E));
8508 -- Visit descendents
8510 Visit_Field (Field1 (N), N);
8511 Visit_Field (Field2 (N), N);
8512 Visit_Field (Field3 (N), N);
8513 Visit_Field (Field4 (N), N);
8514 Visit_Field (Field5 (N), N);
8517 -- Start of processing for New_Copy_Tree
8522 -- See if we should use hash table
8524 if No (Actual_Map) then
8525 NCT_Hash_Tables_Used := False;
8532 NCT_Table_Entries := 0;
8534 Elmt := First_Elmt (Actual_Map);
8535 while Present (Elmt) loop
8536 NCT_Table_Entries := NCT_Table_Entries + 1;
8541 if NCT_Table_Entries > NCT_Hash_Threshhold then
8542 Build_NCT_Hash_Tables;
8544 NCT_Hash_Tables_Used := False;
8549 -- Hash table set up if required, now start phase one by visiting
8550 -- top node (we will recursively visit the descendents).
8552 Visit_Node (Source);
8554 -- Now the second phase of the copy can start. First we process
8555 -- all the mapped entities, copying their descendents.
8557 if Present (Actual_Map) then
8560 New_Itype : Entity_Id;
8562 Elmt := First_Elmt (Actual_Map);
8563 while Present (Elmt) loop
8565 New_Itype := Node (Elmt);
8566 Copy_Itype_With_Replacement (New_Itype);
8572 -- Now we can copy the actual tree
8574 return Copy_Node_With_Replacement (Source);
8577 -------------------------
8578 -- New_External_Entity --
8579 -------------------------
8581 function New_External_Entity
8582 (Kind : Entity_Kind;
8583 Scope_Id : Entity_Id;
8584 Sloc_Value : Source_Ptr;
8585 Related_Id : Entity_Id;
8587 Suffix_Index : Nat := 0;
8588 Prefix : Character := ' ') return Entity_Id
8590 N : constant Entity_Id :=
8591 Make_Defining_Identifier (Sloc_Value,
8593 (Chars (Related_Id), Suffix, Suffix_Index, Prefix));
8596 Set_Ekind (N, Kind);
8597 Set_Is_Internal (N, True);
8598 Append_Entity (N, Scope_Id);
8599 Set_Public_Status (N);
8601 if Kind in Type_Kind then
8602 Init_Size_Align (N);
8606 end New_External_Entity;
8608 -------------------------
8609 -- New_Internal_Entity --
8610 -------------------------
8612 function New_Internal_Entity
8613 (Kind : Entity_Kind;
8614 Scope_Id : Entity_Id;
8615 Sloc_Value : Source_Ptr;
8616 Id_Char : Character) return Entity_Id
8618 N : constant Entity_Id :=
8619 Make_Defining_Identifier (Sloc_Value, New_Internal_Name (Id_Char));
8622 Set_Ekind (N, Kind);
8623 Set_Is_Internal (N, True);
8624 Append_Entity (N, Scope_Id);
8626 if Kind in Type_Kind then
8627 Init_Size_Align (N);
8631 end New_Internal_Entity;
8637 function Next_Actual (Actual_Id : Node_Id) return Node_Id is
8641 -- If we are pointing at a positional parameter, it is a member of a
8642 -- node list (the list of parameters), and the next parameter is the
8643 -- next node on the list, unless we hit a parameter association, then
8644 -- we shift to using the chain whose head is the First_Named_Actual in
8645 -- the parent, and then is threaded using the Next_Named_Actual of the
8646 -- Parameter_Association. All this fiddling is because the original node
8647 -- list is in the textual call order, and what we need is the
8648 -- declaration order.
8650 if Is_List_Member (Actual_Id) then
8651 N := Next (Actual_Id);
8653 if Nkind (N) = N_Parameter_Association then
8654 return First_Named_Actual (Parent (Actual_Id));
8660 return Next_Named_Actual (Parent (Actual_Id));
8664 procedure Next_Actual (Actual_Id : in out Node_Id) is
8666 Actual_Id := Next_Actual (Actual_Id);
8669 -----------------------
8670 -- Normalize_Actuals --
8671 -----------------------
8673 -- Chain actuals according to formals of subprogram. If there are no named
8674 -- associations, the chain is simply the list of Parameter Associations,
8675 -- since the order is the same as the declaration order. If there are named
8676 -- associations, then the First_Named_Actual field in the N_Function_Call
8677 -- or N_Procedure_Call_Statement node points to the Parameter_Association
8678 -- node for the parameter that comes first in declaration order. The
8679 -- remaining named parameters are then chained in declaration order using
8680 -- Next_Named_Actual.
8682 -- This routine also verifies that the number of actuals is compatible with
8683 -- the number and default values of formals, but performs no type checking
8684 -- (type checking is done by the caller).
8686 -- If the matching succeeds, Success is set to True and the caller proceeds
8687 -- with type-checking. If the match is unsuccessful, then Success is set to
8688 -- False, and the caller attempts a different interpretation, if there is
8691 -- If the flag Report is on, the call is not overloaded, and a failure to
8692 -- match can be reported here, rather than in the caller.
8694 procedure Normalize_Actuals
8698 Success : out Boolean)
8700 Actuals : constant List_Id := Parameter_Associations (N);
8701 Actual : Node_Id := Empty;
8703 Last : Node_Id := Empty;
8704 First_Named : Node_Id := Empty;
8707 Formals_To_Match : Integer := 0;
8708 Actuals_To_Match : Integer := 0;
8710 procedure Chain (A : Node_Id);
8711 -- Add named actual at the proper place in the list, using the
8712 -- Next_Named_Actual link.
8714 function Reporting return Boolean;
8715 -- Determines if an error is to be reported. To report an error, we
8716 -- need Report to be True, and also we do not report errors caused
8717 -- by calls to init procs that occur within other init procs. Such
8718 -- errors must always be cascaded errors, since if all the types are
8719 -- declared correctly, the compiler will certainly build decent calls!
8725 procedure Chain (A : Node_Id) is
8729 -- Call node points to first actual in list
8731 Set_First_Named_Actual (N, Explicit_Actual_Parameter (A));
8734 Set_Next_Named_Actual (Last, Explicit_Actual_Parameter (A));
8738 Set_Next_Named_Actual (Last, Empty);
8745 function Reporting return Boolean is
8750 elsif not Within_Init_Proc then
8753 elsif Is_Init_Proc (Entity (Name (N))) then
8761 -- Start of processing for Normalize_Actuals
8764 if Is_Access_Type (S) then
8766 -- The name in the call is a function call that returns an access
8767 -- to subprogram. The designated type has the list of formals.
8769 Formal := First_Formal (Designated_Type (S));
8771 Formal := First_Formal (S);
8774 while Present (Formal) loop
8775 Formals_To_Match := Formals_To_Match + 1;
8776 Next_Formal (Formal);
8779 -- Find if there is a named association, and verify that no positional
8780 -- associations appear after named ones.
8782 if Present (Actuals) then
8783 Actual := First (Actuals);
8786 while Present (Actual)
8787 and then Nkind (Actual) /= N_Parameter_Association
8789 Actuals_To_Match := Actuals_To_Match + 1;
8793 if No (Actual) and Actuals_To_Match = Formals_To_Match then
8795 -- Most common case: positional notation, no defaults
8800 elsif Actuals_To_Match > Formals_To_Match then
8802 -- Too many actuals: will not work
8805 if Is_Entity_Name (Name (N)) then
8806 Error_Msg_N ("too many arguments in call to&", Name (N));
8808 Error_Msg_N ("too many arguments in call", N);
8816 First_Named := Actual;
8818 while Present (Actual) loop
8819 if Nkind (Actual) /= N_Parameter_Association then
8821 ("positional parameters not allowed after named ones", Actual);
8826 Actuals_To_Match := Actuals_To_Match + 1;
8832 if Present (Actuals) then
8833 Actual := First (Actuals);
8836 Formal := First_Formal (S);
8837 while Present (Formal) loop
8839 -- Match the formals in order. If the corresponding actual is
8840 -- positional, nothing to do. Else scan the list of named actuals
8841 -- to find the one with the right name.
8844 and then Nkind (Actual) /= N_Parameter_Association
8847 Actuals_To_Match := Actuals_To_Match - 1;
8848 Formals_To_Match := Formals_To_Match - 1;
8851 -- For named parameters, search the list of actuals to find
8852 -- one that matches the next formal name.
8854 Actual := First_Named;
8856 while Present (Actual) loop
8857 if Chars (Selector_Name (Actual)) = Chars (Formal) then
8860 Actuals_To_Match := Actuals_To_Match - 1;
8861 Formals_To_Match := Formals_To_Match - 1;
8869 if Ekind (Formal) /= E_In_Parameter
8870 or else No (Default_Value (Formal))
8873 if (Comes_From_Source (S)
8874 or else Sloc (S) = Standard_Location)
8875 and then Is_Overloadable (S)
8879 (Nkind (Parent (N)) = N_Procedure_Call_Statement
8881 (Nkind (Parent (N)) = N_Function_Call
8883 Nkind (Parent (N)) = N_Parameter_Association))
8884 and then Ekind (S) /= E_Function
8886 Set_Etype (N, Etype (S));
8888 Error_Msg_Name_1 := Chars (S);
8889 Error_Msg_Sloc := Sloc (S);
8891 ("missing argument for parameter & " &
8892 "in call to % declared #", N, Formal);
8895 elsif Is_Overloadable (S) then
8896 Error_Msg_Name_1 := Chars (S);
8898 -- Point to type derivation that generated the
8901 Error_Msg_Sloc := Sloc (Parent (S));
8904 ("missing argument for parameter & " &
8905 "in call to % (inherited) #", N, Formal);
8909 ("missing argument for parameter &", N, Formal);
8917 Formals_To_Match := Formals_To_Match - 1;
8922 Next_Formal (Formal);
8925 if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
8932 -- Find some superfluous named actual that did not get
8933 -- attached to the list of associations.
8935 Actual := First (Actuals);
8936 while Present (Actual) loop
8937 if Nkind (Actual) = N_Parameter_Association
8938 and then Actual /= Last
8939 and then No (Next_Named_Actual (Actual))
8941 Error_Msg_N ("unmatched actual & in call",
8942 Selector_Name (Actual));
8953 end Normalize_Actuals;
8955 --------------------------------
8956 -- Note_Possible_Modification --
8957 --------------------------------
8959 procedure Note_Possible_Modification (N : Node_Id; Sure : Boolean) is
8960 Modification_Comes_From_Source : constant Boolean :=
8961 Comes_From_Source (Parent (N));
8967 -- Loop to find referenced entity, if there is one
8974 if Is_Entity_Name (Exp) then
8975 Ent := Entity (Exp);
8977 -- If the entity is missing, it is an undeclared identifier,
8978 -- and there is nothing to annotate.
8984 elsif Nkind (Exp) = N_Explicit_Dereference then
8986 P : constant Node_Id := Prefix (Exp);
8989 if Nkind (P) = N_Selected_Component
8991 Entry_Formal (Entity (Selector_Name (P))))
8993 -- Case of a reference to an entry formal
8995 Ent := Entry_Formal (Entity (Selector_Name (P)));
8997 elsif Nkind (P) = N_Identifier
8998 and then Nkind (Parent (Entity (P))) = N_Object_Declaration
8999 and then Present (Expression (Parent (Entity (P))))
9000 and then Nkind (Expression (Parent (Entity (P))))
9003 -- Case of a reference to a value on which side effects have
9006 Exp := Prefix (Expression (Parent (Entity (P))));
9015 elsif Nkind (Exp) = N_Type_Conversion
9016 or else Nkind (Exp) = N_Unchecked_Type_Conversion
9018 Exp := Expression (Exp);
9021 elsif Nkind (Exp) = N_Slice
9022 or else Nkind (Exp) = N_Indexed_Component
9023 or else Nkind (Exp) = N_Selected_Component
9025 Exp := Prefix (Exp);
9032 -- Now look for entity being referenced
9034 if Present (Ent) then
9035 if Is_Object (Ent) then
9036 if Comes_From_Source (Exp)
9037 or else Modification_Comes_From_Source
9039 if Has_Pragma_Unmodified (Ent) then
9040 Error_Msg_NE ("?pragma Unmodified given for &!", N, Ent);
9043 Set_Never_Set_In_Source (Ent, False);
9046 Set_Is_True_Constant (Ent, False);
9047 Set_Current_Value (Ent, Empty);
9048 Set_Is_Known_Null (Ent, False);
9050 if not Can_Never_Be_Null (Ent) then
9051 Set_Is_Known_Non_Null (Ent, False);
9054 -- Follow renaming chain
9056 if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
9057 and then Present (Renamed_Object (Ent))
9059 Exp := Renamed_Object (Ent);
9063 -- Generate a reference only if the assignment comes from
9064 -- source. This excludes, for example, calls to a dispatching
9065 -- assignment operation when the left-hand side is tagged.
9067 if Modification_Comes_From_Source then
9068 Generate_Reference (Ent, Exp, 'm');
9071 Check_Nested_Access (Ent);
9076 -- If we are sure this is a modification from source, and we know
9077 -- this modifies a constant, then give an appropriate warning.
9079 if Overlays_Constant (Ent)
9080 and then Modification_Comes_From_Source
9084 A : constant Node_Id := Address_Clause (Ent);
9088 Exp : constant Node_Id := Expression (A);
9090 if Nkind (Exp) = N_Attribute_Reference
9091 and then Attribute_Name (Exp) = Name_Address
9092 and then Is_Entity_Name (Prefix (Exp))
9094 Error_Msg_Sloc := Sloc (A);
9096 ("constant& may be modified via address clause#?",
9097 N, Entity (Prefix (Exp)));
9107 end Note_Possible_Modification;
9109 -------------------------
9110 -- Object_Access_Level --
9111 -------------------------
9113 function Object_Access_Level (Obj : Node_Id) return Uint is
9116 -- Returns the static accessibility level of the view denoted by Obj. Note
9117 -- that the value returned is the result of a call to Scope_Depth. Only
9118 -- scope depths associated with dynamic scopes can actually be returned.
9119 -- Since only relative levels matter for accessibility checking, the fact
9120 -- that the distance between successive levels of accessibility is not
9121 -- always one is immaterial (invariant: if level(E2) is deeper than
9122 -- level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
9124 function Reference_To (Obj : Node_Id) return Node_Id;
9125 -- An explicit dereference is created when removing side-effects from
9126 -- expressions for constraint checking purposes. In this case a local
9127 -- access type is created for it. The correct access level is that of
9128 -- the original source node. We detect this case by noting that the
9129 -- prefix of the dereference is created by an object declaration whose
9130 -- initial expression is a reference.
9136 function Reference_To (Obj : Node_Id) return Node_Id is
9137 Pref : constant Node_Id := Prefix (Obj);
9139 if Is_Entity_Name (Pref)
9140 and then Nkind (Parent (Entity (Pref))) = N_Object_Declaration
9141 and then Present (Expression (Parent (Entity (Pref))))
9142 and then Nkind (Expression (Parent (Entity (Pref)))) = N_Reference
9144 return (Prefix (Expression (Parent (Entity (Pref)))));
9150 -- Start of processing for Object_Access_Level
9153 if Is_Entity_Name (Obj) then
9156 if Is_Prival (E) then
9157 E := Prival_Link (E);
9160 -- If E is a type then it denotes a current instance. For this case
9161 -- we add one to the normal accessibility level of the type to ensure
9162 -- that current instances are treated as always being deeper than
9163 -- than the level of any visible named access type (see 3.10.2(21)).
9166 return Type_Access_Level (E) + 1;
9168 elsif Present (Renamed_Object (E)) then
9169 return Object_Access_Level (Renamed_Object (E));
9171 -- Similarly, if E is a component of the current instance of a
9172 -- protected type, any instance of it is assumed to be at a deeper
9173 -- level than the type. For a protected object (whose type is an
9174 -- anonymous protected type) its components are at the same level
9175 -- as the type itself.
9177 elsif not Is_Overloadable (E)
9178 and then Ekind (Scope (E)) = E_Protected_Type
9179 and then Comes_From_Source (Scope (E))
9181 return Type_Access_Level (Scope (E)) + 1;
9184 return Scope_Depth (Enclosing_Dynamic_Scope (E));
9187 elsif Nkind (Obj) = N_Selected_Component then
9188 if Is_Access_Type (Etype (Prefix (Obj))) then
9189 return Type_Access_Level (Etype (Prefix (Obj)));
9191 return Object_Access_Level (Prefix (Obj));
9194 elsif Nkind (Obj) = N_Indexed_Component then
9195 if Is_Access_Type (Etype (Prefix (Obj))) then
9196 return Type_Access_Level (Etype (Prefix (Obj)));
9198 return Object_Access_Level (Prefix (Obj));
9201 elsif Nkind (Obj) = N_Explicit_Dereference then
9203 -- If the prefix is a selected access discriminant then we make a
9204 -- recursive call on the prefix, which will in turn check the level
9205 -- of the prefix object of the selected discriminant.
9207 if Nkind (Prefix (Obj)) = N_Selected_Component
9208 and then Ekind (Etype (Prefix (Obj))) = E_Anonymous_Access_Type
9210 Ekind (Entity (Selector_Name (Prefix (Obj)))) = E_Discriminant
9212 return Object_Access_Level (Prefix (Obj));
9214 elsif not (Comes_From_Source (Obj)) then
9216 Ref : constant Node_Id := Reference_To (Obj);
9218 if Present (Ref) then
9219 return Object_Access_Level (Ref);
9221 return Type_Access_Level (Etype (Prefix (Obj)));
9226 return Type_Access_Level (Etype (Prefix (Obj)));
9229 elsif Nkind (Obj) = N_Type_Conversion
9230 or else Nkind (Obj) = N_Unchecked_Type_Conversion
9232 return Object_Access_Level (Expression (Obj));
9234 -- Function results are objects, so we get either the access level of
9235 -- the function or, in the case of an indirect call, the level of the
9236 -- access-to-subprogram type.
9238 elsif Nkind (Obj) = N_Function_Call then
9239 if Is_Entity_Name (Name (Obj)) then
9240 return Subprogram_Access_Level (Entity (Name (Obj)));
9242 return Type_Access_Level (Etype (Prefix (Name (Obj))));
9245 -- For convenience we handle qualified expressions, even though
9246 -- they aren't technically object names.
9248 elsif Nkind (Obj) = N_Qualified_Expression then
9249 return Object_Access_Level (Expression (Obj));
9251 -- Otherwise return the scope level of Standard.
9252 -- (If there are cases that fall through
9253 -- to this point they will be treated as
9254 -- having global accessibility for now. ???)
9257 return Scope_Depth (Standard_Standard);
9259 end Object_Access_Level;
9261 -----------------------
9262 -- Private_Component --
9263 -----------------------
9265 function Private_Component (Type_Id : Entity_Id) return Entity_Id is
9266 Ancestor : constant Entity_Id := Base_Type (Type_Id);
9268 function Trace_Components
9270 Check : Boolean) return Entity_Id;
9271 -- Recursive function that does the work, and checks against circular
9272 -- definition for each subcomponent type.
9274 ----------------------
9275 -- Trace_Components --
9276 ----------------------
9278 function Trace_Components
9280 Check : Boolean) return Entity_Id
9282 Btype : constant Entity_Id := Base_Type (T);
9283 Component : Entity_Id;
9285 Candidate : Entity_Id := Empty;
9288 if Check and then Btype = Ancestor then
9289 Error_Msg_N ("circular type definition", Type_Id);
9293 if Is_Private_Type (Btype)
9294 and then not Is_Generic_Type (Btype)
9296 if Present (Full_View (Btype))
9297 and then Is_Record_Type (Full_View (Btype))
9298 and then not Is_Frozen (Btype)
9300 -- To indicate that the ancestor depends on a private type, the
9301 -- current Btype is sufficient. However, to check for circular
9302 -- definition we must recurse on the full view.
9304 Candidate := Trace_Components (Full_View (Btype), True);
9306 if Candidate = Any_Type then
9316 elsif Is_Array_Type (Btype) then
9317 return Trace_Components (Component_Type (Btype), True);
9319 elsif Is_Record_Type (Btype) then
9320 Component := First_Entity (Btype);
9321 while Present (Component) loop
9323 -- Skip anonymous types generated by constrained components
9325 if not Is_Type (Component) then
9326 P := Trace_Components (Etype (Component), True);
9329 if P = Any_Type then
9337 Next_Entity (Component);
9345 end Trace_Components;
9347 -- Start of processing for Private_Component
9350 return Trace_Components (Type_Id, False);
9351 end Private_Component;
9353 ---------------------------
9354 -- Primitive_Names_Match --
9355 ---------------------------
9357 function Primitive_Names_Match (E1, E2 : Entity_Id) return Boolean is
9359 function Non_Internal_Name (E : Entity_Id) return Name_Id;
9360 -- Given an internal name, returns the corresponding non-internal name
9362 ------------------------
9363 -- Non_Internal_Name --
9364 ------------------------
9366 function Non_Internal_Name (E : Entity_Id) return Name_Id is
9368 Get_Name_String (Chars (E));
9369 Name_Len := Name_Len - 1;
9371 end Non_Internal_Name;
9373 -- Start of processing for Primitive_Names_Match
9376 pragma Assert (Present (E1) and then Present (E2));
9378 return Chars (E1) = Chars (E2)
9380 (not Is_Internal_Name (Chars (E1))
9381 and then Is_Internal_Name (Chars (E2))
9382 and then Non_Internal_Name (E2) = Chars (E1))
9384 (not Is_Internal_Name (Chars (E2))
9385 and then Is_Internal_Name (Chars (E1))
9386 and then Non_Internal_Name (E1) = Chars (E2))
9388 (Is_Predefined_Dispatching_Operation (E1)
9389 and then Is_Predefined_Dispatching_Operation (E2)
9390 and then Same_TSS (E1, E2))
9392 (Is_Init_Proc (E1) and then Is_Init_Proc (E2));
9393 end Primitive_Names_Match;
9395 -----------------------
9396 -- Process_End_Label --
9397 -----------------------
9399 procedure Process_End_Label
9408 Label_Ref : Boolean;
9409 -- Set True if reference to end label itself is required
9412 -- Gets set to the operator symbol or identifier that references the
9413 -- entity Ent. For the child unit case, this is the identifier from the
9414 -- designator. For other cases, this is simply Endl.
9416 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id);
9417 -- N is an identifier node that appears as a parent unit reference in
9418 -- the case where Ent is a child unit. This procedure generates an
9419 -- appropriate cross-reference entry. E is the corresponding entity.
9421 -------------------------
9422 -- Generate_Parent_Ref --
9423 -------------------------
9425 procedure Generate_Parent_Ref (N : Node_Id; E : Entity_Id) is
9427 -- If names do not match, something weird, skip reference
9429 if Chars (E) = Chars (N) then
9431 -- Generate the reference. We do NOT consider this as a reference
9432 -- for unreferenced symbol purposes.
9434 Generate_Reference (E, N, 'r', Set_Ref => False, Force => True);
9437 Style.Check_Identifier (N, E);
9440 end Generate_Parent_Ref;
9442 -- Start of processing for Process_End_Label
9445 -- If no node, ignore. This happens in some error situations, and
9446 -- also for some internally generated structures where no end label
9447 -- references are required in any case.
9453 -- Nothing to do if no End_Label, happens for internally generated
9454 -- constructs where we don't want an end label reference anyway. Also
9455 -- nothing to do if Endl is a string literal, which means there was
9456 -- some prior error (bad operator symbol)
9458 Endl := End_Label (N);
9460 if No (Endl) or else Nkind (Endl) = N_String_Literal then
9464 -- Reference node is not in extended main source unit
9466 if not In_Extended_Main_Source_Unit (N) then
9468 -- Generally we do not collect references except for the extended
9469 -- main source unit. The one exception is the 'e' entry for a
9470 -- package spec, where it is useful for a client to have the
9471 -- ending information to define scopes.
9479 -- For this case, we can ignore any parent references, but we
9480 -- need the package name itself for the 'e' entry.
9482 if Nkind (Endl) = N_Designator then
9483 Endl := Identifier (Endl);
9487 -- Reference is in extended main source unit
9492 -- For designator, generate references for the parent entries
9494 if Nkind (Endl) = N_Designator then
9496 -- Generate references for the prefix if the END line comes from
9497 -- source (otherwise we do not need these references) We climb the
9498 -- scope stack to find the expected entities.
9500 if Comes_From_Source (Endl) then
9502 Scop := Current_Scope;
9503 while Nkind (Nam) = N_Selected_Component loop
9504 Scop := Scope (Scop);
9505 exit when No (Scop);
9506 Generate_Parent_Ref (Selector_Name (Nam), Scop);
9507 Nam := Prefix (Nam);
9510 if Present (Scop) then
9511 Generate_Parent_Ref (Nam, Scope (Scop));
9515 Endl := Identifier (Endl);
9519 -- If the end label is not for the given entity, then either we have
9520 -- some previous error, or this is a generic instantiation for which
9521 -- we do not need to make a cross-reference in this case anyway. In
9522 -- either case we simply ignore the call.
9524 if Chars (Ent) /= Chars (Endl) then
9528 -- If label was really there, then generate a normal reference and then
9529 -- adjust the location in the end label to point past the name (which
9530 -- should almost always be the semicolon).
9534 if Comes_From_Source (Endl) then
9536 -- If a label reference is required, then do the style check and
9537 -- generate an l-type cross-reference entry for the label
9541 Style.Check_Identifier (Endl, Ent);
9544 Generate_Reference (Ent, Endl, 'l', Set_Ref => False);
9547 -- Set the location to point past the label (normally this will
9548 -- mean the semicolon immediately following the label). This is
9549 -- done for the sake of the 'e' or 't' entry generated below.
9551 Get_Decoded_Name_String (Chars (Endl));
9552 Set_Sloc (Endl, Sloc (Endl) + Source_Ptr (Name_Len));
9555 -- Now generate the e/t reference
9557 Generate_Reference (Ent, Endl, Typ, Set_Ref => False, Force => True);
9559 -- Restore Sloc, in case modified above, since we have an identifier
9560 -- and the normal Sloc should be left set in the tree.
9562 Set_Sloc (Endl, Loc);
9563 end Process_End_Label;
9569 -- We do the conversion to get the value of the real string by using
9570 -- the scanner, see Sinput for details on use of the internal source
9571 -- buffer for scanning internal strings.
9573 function Real_Convert (S : String) return Node_Id is
9574 Save_Src : constant Source_Buffer_Ptr := Source;
9578 Source := Internal_Source_Ptr;
9581 for J in S'Range loop
9582 Source (Source_Ptr (J)) := S (J);
9585 Source (S'Length + 1) := EOF;
9587 if Source (Scan_Ptr) = '-' then
9589 Scan_Ptr := Scan_Ptr + 1;
9597 Set_Realval (Token_Node, UR_Negate (Realval (Token_Node)));
9604 ------------------------------------
9605 -- References_Generic_Formal_Type --
9606 ------------------------------------
9608 function References_Generic_Formal_Type (N : Node_Id) return Boolean is
9610 function Process (N : Node_Id) return Traverse_Result;
9611 -- Process one node in search for generic formal type
9617 function Process (N : Node_Id) return Traverse_Result is
9619 if Nkind (N) in N_Has_Entity then
9621 E : constant Entity_Id := Entity (N);
9624 if Is_Generic_Type (E) then
9626 elsif Present (Etype (E))
9627 and then Is_Generic_Type (Etype (E))
9638 function Traverse is new Traverse_Func (Process);
9639 -- Traverse tree to look for generic type
9642 if Inside_A_Generic then
9643 return Traverse (N) = Abandon;
9647 end References_Generic_Formal_Type;
9649 --------------------
9650 -- Remove_Homonym --
9651 --------------------
9653 procedure Remove_Homonym (E : Entity_Id) is
9654 Prev : Entity_Id := Empty;
9658 if E = Current_Entity (E) then
9659 if Present (Homonym (E)) then
9660 Set_Current_Entity (Homonym (E));
9662 Set_Name_Entity_Id (Chars (E), Empty);
9665 H := Current_Entity (E);
9666 while Present (H) and then H /= E loop
9671 Set_Homonym (Prev, Homonym (E));
9675 ---------------------
9676 -- Rep_To_Pos_Flag --
9677 ---------------------
9679 function Rep_To_Pos_Flag (E : Entity_Id; Loc : Source_Ptr) return Node_Id is
9681 return New_Occurrence_Of
9682 (Boolean_Literals (not Range_Checks_Suppressed (E)), Loc);
9683 end Rep_To_Pos_Flag;
9685 --------------------
9686 -- Require_Entity --
9687 --------------------
9689 procedure Require_Entity (N : Node_Id) is
9691 if Is_Entity_Name (N) and then No (Entity (N)) then
9692 if Total_Errors_Detected /= 0 then
9693 Set_Entity (N, Any_Id);
9695 raise Program_Error;
9700 ------------------------------
9701 -- Requires_Transient_Scope --
9702 ------------------------------
9704 -- A transient scope is required when variable-sized temporaries are
9705 -- allocated in the primary or secondary stack, or when finalization
9706 -- actions must be generated before the next instruction.
9708 function Requires_Transient_Scope (Id : Entity_Id) return Boolean is
9709 Typ : constant Entity_Id := Underlying_Type (Id);
9711 -- Start of processing for Requires_Transient_Scope
9714 -- This is a private type which is not completed yet. This can only
9715 -- happen in a default expression (of a formal parameter or of a
9716 -- record component). Do not expand transient scope in this case
9721 -- Do not expand transient scope for non-existent procedure return
9723 elsif Typ = Standard_Void_Type then
9726 -- Elementary types do not require a transient scope
9728 elsif Is_Elementary_Type (Typ) then
9731 -- Generally, indefinite subtypes require a transient scope, since the
9732 -- back end cannot generate temporaries, since this is not a valid type
9733 -- for declaring an object. It might be possible to relax this in the
9734 -- future, e.g. by declaring the maximum possible space for the type.
9736 elsif Is_Indefinite_Subtype (Typ) then
9739 -- Functions returning tagged types may dispatch on result so their
9740 -- returned value is allocated on the secondary stack. Controlled
9741 -- type temporaries need finalization.
9743 elsif Is_Tagged_Type (Typ)
9744 or else Has_Controlled_Component (Typ)
9746 return not Is_Value_Type (Typ);
9750 elsif Is_Record_Type (Typ) then
9754 Comp := First_Entity (Typ);
9755 while Present (Comp) loop
9756 if Ekind (Comp) = E_Component
9757 and then Requires_Transient_Scope (Etype (Comp))
9768 -- String literal types never require transient scope
9770 elsif Ekind (Typ) = E_String_Literal_Subtype then
9773 -- Array type. Note that we already know that this is a constrained
9774 -- array, since unconstrained arrays will fail the indefinite test.
9776 elsif Is_Array_Type (Typ) then
9778 -- If component type requires a transient scope, the array does too
9780 if Requires_Transient_Scope (Component_Type (Typ)) then
9783 -- Otherwise, we only need a transient scope if the size is not
9784 -- known at compile time.
9787 return not Size_Known_At_Compile_Time (Typ);
9790 -- All other cases do not require a transient scope
9795 end Requires_Transient_Scope;
9797 --------------------------
9798 -- Reset_Analyzed_Flags --
9799 --------------------------
9801 procedure Reset_Analyzed_Flags (N : Node_Id) is
9803 function Clear_Analyzed (N : Node_Id) return Traverse_Result;
9804 -- Function used to reset Analyzed flags in tree. Note that we do
9805 -- not reset Analyzed flags in entities, since there is no need to
9806 -- reanalyze entities, and indeed, it is wrong to do so, since it
9807 -- can result in generating auxiliary stuff more than once.
9809 --------------------
9810 -- Clear_Analyzed --
9811 --------------------
9813 function Clear_Analyzed (N : Node_Id) return Traverse_Result is
9815 if not Has_Extension (N) then
9816 Set_Analyzed (N, False);
9822 procedure Reset_Analyzed is new Traverse_Proc (Clear_Analyzed);
9824 -- Start of processing for Reset_Analyzed_Flags
9828 end Reset_Analyzed_Flags;
9830 ---------------------------
9831 -- Safe_To_Capture_Value --
9832 ---------------------------
9834 function Safe_To_Capture_Value
9837 Cond : Boolean := False) return Boolean
9840 -- The only entities for which we track constant values are variables
9841 -- which are not renamings, constants, out parameters, and in out
9842 -- parameters, so check if we have this case.
9844 -- Note: it may seem odd to track constant values for constants, but in
9845 -- fact this routine is used for other purposes than simply capturing
9846 -- the value. In particular, the setting of Known[_Non]_Null.
9848 if (Ekind (Ent) = E_Variable and then No (Renamed_Object (Ent)))
9850 Ekind (Ent) = E_Constant
9852 Ekind (Ent) = E_Out_Parameter
9854 Ekind (Ent) = E_In_Out_Parameter
9858 -- For conditionals, we also allow loop parameters and all formals,
9859 -- including in parameters.
9863 (Ekind (Ent) = E_Loop_Parameter
9865 Ekind (Ent) = E_In_Parameter)
9869 -- For all other cases, not just unsafe, but impossible to capture
9870 -- Current_Value, since the above are the only entities which have
9871 -- Current_Value fields.
9877 -- Skip if volatile or aliased, since funny things might be going on in
9878 -- these cases which we cannot necessarily track. Also skip any variable
9879 -- for which an address clause is given, or whose address is taken. Also
9880 -- never capture value of library level variables (an attempt to do so
9881 -- can occur in the case of package elaboration code).
9883 if Treat_As_Volatile (Ent)
9884 or else Is_Aliased (Ent)
9885 or else Present (Address_Clause (Ent))
9886 or else Address_Taken (Ent)
9887 or else (Is_Library_Level_Entity (Ent)
9888 and then Ekind (Ent) = E_Variable)
9893 -- OK, all above conditions are met. We also require that the scope of
9894 -- the reference be the same as the scope of the entity, not counting
9895 -- packages and blocks and loops.
9898 E_Scope : constant Entity_Id := Scope (Ent);
9899 R_Scope : Entity_Id;
9902 R_Scope := Current_Scope;
9903 while R_Scope /= Standard_Standard loop
9904 exit when R_Scope = E_Scope;
9906 if Ekind (R_Scope) /= E_Package
9908 Ekind (R_Scope) /= E_Block
9910 Ekind (R_Scope) /= E_Loop
9914 R_Scope := Scope (R_Scope);
9919 -- We also require that the reference does not appear in a context
9920 -- where it is not sure to be executed (i.e. a conditional context
9921 -- or an exception handler). We skip this if Cond is True, since the
9922 -- capturing of values from conditional tests handles this ok.
9936 while Present (P) loop
9937 if Nkind (P) = N_If_Statement
9938 or else Nkind (P) = N_Case_Statement
9939 or else (Nkind (P) in N_Short_Circuit
9940 and then Desc = Right_Opnd (P))
9941 or else (Nkind (P) = N_Conditional_Expression
9942 and then Desc /= First (Expressions (P)))
9943 or else Nkind (P) = N_Exception_Handler
9944 or else Nkind (P) = N_Selective_Accept
9945 or else Nkind (P) = N_Conditional_Entry_Call
9946 or else Nkind (P) = N_Timed_Entry_Call
9947 or else Nkind (P) = N_Asynchronous_Select
9957 -- OK, looks safe to set value
9960 end Safe_To_Capture_Value;
9966 function Same_Name (N1, N2 : Node_Id) return Boolean is
9967 K1 : constant Node_Kind := Nkind (N1);
9968 K2 : constant Node_Kind := Nkind (N2);
9971 if (K1 = N_Identifier or else K1 = N_Defining_Identifier)
9972 and then (K2 = N_Identifier or else K2 = N_Defining_Identifier)
9974 return Chars (N1) = Chars (N2);
9976 elsif (K1 = N_Selected_Component or else K1 = N_Expanded_Name)
9977 and then (K2 = N_Selected_Component or else K2 = N_Expanded_Name)
9979 return Same_Name (Selector_Name (N1), Selector_Name (N2))
9980 and then Same_Name (Prefix (N1), Prefix (N2));
9991 function Same_Object (Node1, Node2 : Node_Id) return Boolean is
9992 N1 : constant Node_Id := Original_Node (Node1);
9993 N2 : constant Node_Id := Original_Node (Node2);
9994 -- We do the tests on original nodes, since we are most interested
9995 -- in the original source, not any expansion that got in the way.
9997 K1 : constant Node_Kind := Nkind (N1);
9998 K2 : constant Node_Kind := Nkind (N2);
10001 -- First case, both are entities with same entity
10003 if K1 in N_Has_Entity
10004 and then K2 in N_Has_Entity
10005 and then Present (Entity (N1))
10006 and then Present (Entity (N2))
10007 and then (Ekind (Entity (N1)) = E_Variable
10009 Ekind (Entity (N1)) = E_Constant)
10010 and then Entity (N1) = Entity (N2)
10014 -- Second case, selected component with same selector, same record
10016 elsif K1 = N_Selected_Component
10017 and then K2 = N_Selected_Component
10018 and then Chars (Selector_Name (N1)) = Chars (Selector_Name (N2))
10020 return Same_Object (Prefix (N1), Prefix (N2));
10022 -- Third case, indexed component with same subscripts, same array
10024 elsif K1 = N_Indexed_Component
10025 and then K2 = N_Indexed_Component
10026 and then Same_Object (Prefix (N1), Prefix (N2))
10031 E1 := First (Expressions (N1));
10032 E2 := First (Expressions (N2));
10033 while Present (E1) loop
10034 if not Same_Value (E1, E2) then
10045 -- Fourth case, slice of same array with same bounds
10048 and then K2 = N_Slice
10049 and then Nkind (Discrete_Range (N1)) = N_Range
10050 and then Nkind (Discrete_Range (N2)) = N_Range
10051 and then Same_Value (Low_Bound (Discrete_Range (N1)),
10052 Low_Bound (Discrete_Range (N2)))
10053 and then Same_Value (High_Bound (Discrete_Range (N1)),
10054 High_Bound (Discrete_Range (N2)))
10056 return Same_Name (Prefix (N1), Prefix (N2));
10058 -- All other cases, not clearly the same object
10069 function Same_Type (T1, T2 : Entity_Id) return Boolean is
10074 elsif not Is_Constrained (T1)
10075 and then not Is_Constrained (T2)
10076 and then Base_Type (T1) = Base_Type (T2)
10080 -- For now don't bother with case of identical constraints, to be
10081 -- fiddled with later on perhaps (this is only used for optimization
10082 -- purposes, so it is not critical to do a best possible job)
10093 function Same_Value (Node1, Node2 : Node_Id) return Boolean is
10095 if Compile_Time_Known_Value (Node1)
10096 and then Compile_Time_Known_Value (Node2)
10097 and then Expr_Value (Node1) = Expr_Value (Node2)
10100 elsif Same_Object (Node1, Node2) then
10107 ------------------------
10108 -- Scope_Is_Transient --
10109 ------------------------
10111 function Scope_Is_Transient return Boolean is
10113 return Scope_Stack.Table (Scope_Stack.Last).Is_Transient;
10114 end Scope_Is_Transient;
10120 function Scope_Within (Scope1, Scope2 : Entity_Id) return Boolean is
10125 while Scop /= Standard_Standard loop
10126 Scop := Scope (Scop);
10128 if Scop = Scope2 then
10136 --------------------------
10137 -- Scope_Within_Or_Same --
10138 --------------------------
10140 function Scope_Within_Or_Same (Scope1, Scope2 : Entity_Id) return Boolean is
10145 while Scop /= Standard_Standard loop
10146 if Scop = Scope2 then
10149 Scop := Scope (Scop);
10154 end Scope_Within_Or_Same;
10156 --------------------
10157 -- Set_Convention --
10158 --------------------
10160 procedure Set_Convention (E : Entity_Id; Val : Snames.Convention_Id) is
10162 Basic_Set_Convention (E, Val);
10165 and then Is_Access_Subprogram_Type (Base_Type (E))
10166 and then Has_Foreign_Convention (E)
10168 Set_Can_Use_Internal_Rep (E, False);
10170 end Set_Convention;
10172 ------------------------
10173 -- Set_Current_Entity --
10174 ------------------------
10176 -- The given entity is to be set as the currently visible definition
10177 -- of its associated name (i.e. the Node_Id associated with its name).
10178 -- All we have to do is to get the name from the identifier, and
10179 -- then set the associated Node_Id to point to the given entity.
10181 procedure Set_Current_Entity (E : Entity_Id) is
10183 Set_Name_Entity_Id (Chars (E), E);
10184 end Set_Current_Entity;
10186 ---------------------------
10187 -- Set_Debug_Info_Needed --
10188 ---------------------------
10190 procedure Set_Debug_Info_Needed (T : Entity_Id) is
10192 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id);
10193 pragma Inline (Set_Debug_Info_Needed_If_Not_Set);
10194 -- Used to set debug info in a related node if not set already
10196 --------------------------------------
10197 -- Set_Debug_Info_Needed_If_Not_Set --
10198 --------------------------------------
10200 procedure Set_Debug_Info_Needed_If_Not_Set (E : Entity_Id) is
10203 and then not Needs_Debug_Info (E)
10205 Set_Debug_Info_Needed (E);
10207 -- For a private type, indicate that the full view also needs
10208 -- debug information.
10211 and then Is_Private_Type (E)
10212 and then Present (Full_View (E))
10214 Set_Debug_Info_Needed (Full_View (E));
10217 end Set_Debug_Info_Needed_If_Not_Set;
10219 -- Start of processing for Set_Debug_Info_Needed
10222 -- Nothing to do if argument is Empty or has Debug_Info_Off set, which
10223 -- indicates that Debug_Info_Needed is never required for the entity.
10226 or else Debug_Info_Off (T)
10231 -- Set flag in entity itself. Note that we will go through the following
10232 -- circuitry even if the flag is already set on T. That's intentional,
10233 -- it makes sure that the flag will be set in subsidiary entities.
10235 Set_Needs_Debug_Info (T);
10237 -- Set flag on subsidiary entities if not set already
10239 if Is_Object (T) then
10240 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
10242 elsif Is_Type (T) then
10243 Set_Debug_Info_Needed_If_Not_Set (Etype (T));
10245 if Is_Record_Type (T) then
10247 Ent : Entity_Id := First_Entity (T);
10249 while Present (Ent) loop
10250 Set_Debug_Info_Needed_If_Not_Set (Ent);
10255 elsif Is_Array_Type (T) then
10256 Set_Debug_Info_Needed_If_Not_Set (Component_Type (T));
10259 Indx : Node_Id := First_Index (T);
10261 while Present (Indx) loop
10262 Set_Debug_Info_Needed_If_Not_Set (Etype (Indx));
10263 Indx := Next_Index (Indx);
10267 if Is_Packed (T) then
10268 Set_Debug_Info_Needed_If_Not_Set (Packed_Array_Type (T));
10271 elsif Is_Access_Type (T) then
10272 Set_Debug_Info_Needed_If_Not_Set (Directly_Designated_Type (T));
10274 elsif Is_Private_Type (T) then
10275 Set_Debug_Info_Needed_If_Not_Set (Full_View (T));
10277 elsif Is_Protected_Type (T) then
10278 Set_Debug_Info_Needed_If_Not_Set (Corresponding_Record_Type (T));
10281 end Set_Debug_Info_Needed;
10283 ---------------------------------
10284 -- Set_Entity_With_Style_Check --
10285 ---------------------------------
10287 procedure Set_Entity_With_Style_Check (N : Node_Id; Val : Entity_Id) is
10288 Val_Actual : Entity_Id;
10292 Set_Entity (N, Val);
10295 and then not Suppress_Style_Checks (Val)
10296 and then not In_Instance
10298 if Nkind (N) = N_Identifier then
10300 elsif Nkind (N) = N_Expanded_Name then
10301 Nod := Selector_Name (N);
10306 -- A special situation arises for derived operations, where we want
10307 -- to do the check against the parent (since the Sloc of the derived
10308 -- operation points to the derived type declaration itself).
10311 while not Comes_From_Source (Val_Actual)
10312 and then Nkind (Val_Actual) in N_Entity
10313 and then (Ekind (Val_Actual) = E_Enumeration_Literal
10314 or else Is_Subprogram (Val_Actual)
10315 or else Is_Generic_Subprogram (Val_Actual))
10316 and then Present (Alias (Val_Actual))
10318 Val_Actual := Alias (Val_Actual);
10321 -- Renaming declarations for generic actuals do not come from source,
10322 -- and have a different name from that of the entity they rename, so
10323 -- there is no style check to perform here.
10325 if Chars (Nod) = Chars (Val_Actual) then
10326 Style.Check_Identifier (Nod, Val_Actual);
10330 Set_Entity (N, Val);
10331 end Set_Entity_With_Style_Check;
10333 ------------------------
10334 -- Set_Name_Entity_Id --
10335 ------------------------
10337 procedure Set_Name_Entity_Id (Id : Name_Id; Val : Entity_Id) is
10339 Set_Name_Table_Info (Id, Int (Val));
10340 end Set_Name_Entity_Id;
10342 ---------------------
10343 -- Set_Next_Actual --
10344 ---------------------
10346 procedure Set_Next_Actual (Ass1_Id : Node_Id; Ass2_Id : Node_Id) is
10348 if Nkind (Parent (Ass1_Id)) = N_Parameter_Association then
10349 Set_First_Named_Actual (Parent (Ass1_Id), Ass2_Id);
10351 end Set_Next_Actual;
10353 ----------------------------------
10354 -- Set_Optimize_Alignment_Flags --
10355 ----------------------------------
10357 procedure Set_Optimize_Alignment_Flags (E : Entity_Id) is
10359 if Optimize_Alignment = 'S' then
10360 Set_Optimize_Alignment_Space (E);
10361 elsif Optimize_Alignment = 'T' then
10362 Set_Optimize_Alignment_Time (E);
10364 end Set_Optimize_Alignment_Flags;
10366 -----------------------
10367 -- Set_Public_Status --
10368 -----------------------
10370 procedure Set_Public_Status (Id : Entity_Id) is
10371 S : constant Entity_Id := Current_Scope;
10373 function Within_HSS_Or_If (E : Entity_Id) return Boolean;
10374 -- Determines if E is defined within handled statement sequence or
10375 -- an if statement, returns True if so, False otherwise.
10377 ----------------------
10378 -- Within_HSS_Or_If --
10379 ----------------------
10381 function Within_HSS_Or_If (E : Entity_Id) return Boolean is
10384 N := Declaration_Node (E);
10391 elsif Nkind_In (N, N_Handled_Sequence_Of_Statements,
10397 end Within_HSS_Or_If;
10399 -- Start of processing for Set_Public_Status
10402 -- Everything in the scope of Standard is public
10404 if S = Standard_Standard then
10405 Set_Is_Public (Id);
10407 -- Entity is definitely not public if enclosing scope is not public
10409 elsif not Is_Public (S) then
10412 -- An object or function declaration that occurs in a handled sequence
10413 -- of statements or within an if statement is the declaration for a
10414 -- temporary object or local subprogram generated by the expander. It
10415 -- never needs to be made public and furthermore, making it public can
10416 -- cause back end problems.
10418 elsif Nkind_In (Parent (Id), N_Object_Declaration,
10419 N_Function_Specification)
10420 and then Within_HSS_Or_If (Id)
10424 -- Entities in public packages or records are public
10426 elsif Ekind (S) = E_Package or Is_Record_Type (S) then
10427 Set_Is_Public (Id);
10429 -- The bounds of an entry family declaration can generate object
10430 -- declarations that are visible to the back-end, e.g. in the
10431 -- the declaration of a composite type that contains tasks.
10433 elsif Is_Concurrent_Type (S)
10434 and then not Has_Completion (S)
10435 and then Nkind (Parent (Id)) = N_Object_Declaration
10437 Set_Is_Public (Id);
10439 end Set_Public_Status;
10441 -----------------------------
10442 -- Set_Referenced_Modified --
10443 -----------------------------
10445 procedure Set_Referenced_Modified (N : Node_Id; Out_Param : Boolean) is
10449 -- Deal with indexed or selected component where prefix is modified
10451 if Nkind_In (N, N_Indexed_Component, N_Selected_Component) then
10452 Pref := Prefix (N);
10454 -- If prefix is access type, then it is the designated object that is
10455 -- being modified, which means we have no entity to set the flag on.
10457 if No (Etype (Pref)) or else Is_Access_Type (Etype (Pref)) then
10460 -- Otherwise chase the prefix
10463 Set_Referenced_Modified (Pref, Out_Param);
10466 -- Otherwise see if we have an entity name (only other case to process)
10468 elsif Is_Entity_Name (N) and then Present (Entity (N)) then
10469 Set_Referenced_As_LHS (Entity (N), not Out_Param);
10470 Set_Referenced_As_Out_Parameter (Entity (N), Out_Param);
10472 end Set_Referenced_Modified;
10474 ----------------------------
10475 -- Set_Scope_Is_Transient --
10476 ----------------------------
10478 procedure Set_Scope_Is_Transient (V : Boolean := True) is
10480 Scope_Stack.Table (Scope_Stack.Last).Is_Transient := V;
10481 end Set_Scope_Is_Transient;
10483 -------------------
10484 -- Set_Size_Info --
10485 -------------------
10487 procedure Set_Size_Info (T1, T2 : Entity_Id) is
10489 -- We copy Esize, but not RM_Size, since in general RM_Size is
10490 -- subtype specific and does not get inherited by all subtypes.
10492 Set_Esize (T1, Esize (T2));
10493 Set_Has_Biased_Representation (T1, Has_Biased_Representation (T2));
10495 if Is_Discrete_Or_Fixed_Point_Type (T1)
10497 Is_Discrete_Or_Fixed_Point_Type (T2)
10499 Set_Is_Unsigned_Type (T1, Is_Unsigned_Type (T2));
10502 Set_Alignment (T1, Alignment (T2));
10505 --------------------
10506 -- Static_Integer --
10507 --------------------
10509 function Static_Integer (N : Node_Id) return Uint is
10511 Analyze_And_Resolve (N, Any_Integer);
10514 or else Error_Posted (N)
10515 or else Etype (N) = Any_Type
10520 if Is_Static_Expression (N) then
10521 if not Raises_Constraint_Error (N) then
10522 return Expr_Value (N);
10527 elsif Etype (N) = Any_Type then
10531 Flag_Non_Static_Expr
10532 ("static integer expression required here", N);
10535 end Static_Integer;
10537 --------------------------
10538 -- Statically_Different --
10539 --------------------------
10541 function Statically_Different (E1, E2 : Node_Id) return Boolean is
10542 R1 : constant Node_Id := Get_Referenced_Object (E1);
10543 R2 : constant Node_Id := Get_Referenced_Object (E2);
10545 return Is_Entity_Name (R1)
10546 and then Is_Entity_Name (R2)
10547 and then Entity (R1) /= Entity (R2)
10548 and then not Is_Formal (Entity (R1))
10549 and then not Is_Formal (Entity (R2));
10550 end Statically_Different;
10552 -----------------------------
10553 -- Subprogram_Access_Level --
10554 -----------------------------
10556 function Subprogram_Access_Level (Subp : Entity_Id) return Uint is
10558 if Present (Alias (Subp)) then
10559 return Subprogram_Access_Level (Alias (Subp));
10561 return Scope_Depth (Enclosing_Dynamic_Scope (Subp));
10563 end Subprogram_Access_Level;
10569 procedure Trace_Scope (N : Node_Id; E : Entity_Id; Msg : String) is
10571 if Debug_Flag_W then
10572 for J in 0 .. Scope_Stack.Last loop
10577 Write_Name (Chars (E));
10578 Write_Str (" from ");
10579 Write_Location (Sloc (N));
10584 -----------------------
10585 -- Transfer_Entities --
10586 -----------------------
10588 procedure Transfer_Entities (From : Entity_Id; To : Entity_Id) is
10589 Ent : Entity_Id := First_Entity (From);
10596 if (Last_Entity (To)) = Empty then
10597 Set_First_Entity (To, Ent);
10599 Set_Next_Entity (Last_Entity (To), Ent);
10602 Set_Last_Entity (To, Last_Entity (From));
10604 while Present (Ent) loop
10605 Set_Scope (Ent, To);
10607 if not Is_Public (Ent) then
10608 Set_Public_Status (Ent);
10611 and then Ekind (Ent) = E_Record_Subtype
10614 -- The components of the propagated Itype must be public
10620 Comp := First_Entity (Ent);
10621 while Present (Comp) loop
10622 Set_Is_Public (Comp);
10623 Next_Entity (Comp);
10632 Set_First_Entity (From, Empty);
10633 Set_Last_Entity (From, Empty);
10634 end Transfer_Entities;
10636 -----------------------
10637 -- Type_Access_Level --
10638 -----------------------
10640 function Type_Access_Level (Typ : Entity_Id) return Uint is
10644 Btyp := Base_Type (Typ);
10646 -- Ada 2005 (AI-230): For most cases of anonymous access types, we
10647 -- simply use the level where the type is declared. This is true for
10648 -- stand-alone object declarations, and for anonymous access types
10649 -- associated with components the level is the same as that of the
10650 -- enclosing composite type. However, special treatment is needed for
10651 -- the cases of access parameters, return objects of an anonymous access
10652 -- type, and, in Ada 95, access discriminants of limited types.
10654 if Ekind (Btyp) in Access_Kind then
10655 if Ekind (Btyp) = E_Anonymous_Access_Type then
10657 -- If the type is a nonlocal anonymous access type (such as for
10658 -- an access parameter) we treat it as being declared at the
10659 -- library level to ensure that names such as X.all'access don't
10660 -- fail static accessibility checks.
10662 if not Is_Local_Anonymous_Access (Typ) then
10663 return Scope_Depth (Standard_Standard);
10665 -- If this is a return object, the accessibility level is that of
10666 -- the result subtype of the enclosing function. The test here is
10667 -- little complicated, because we have to account for extended
10668 -- return statements that have been rewritten as blocks, in which
10669 -- case we have to find and the Is_Return_Object attribute of the
10670 -- itype's associated object. It would be nice to find a way to
10671 -- simplify this test, but it doesn't seem worthwhile to add a new
10672 -- flag just for purposes of this test. ???
10674 elsif Ekind (Scope (Btyp)) = E_Return_Statement
10677 and then Nkind (Associated_Node_For_Itype (Btyp)) =
10678 N_Object_Declaration
10679 and then Is_Return_Object
10680 (Defining_Identifier
10681 (Associated_Node_For_Itype (Btyp))))
10687 Scop := Scope (Scope (Btyp));
10688 while Present (Scop) loop
10689 exit when Ekind (Scop) = E_Function;
10690 Scop := Scope (Scop);
10693 -- Treat the return object's type as having the level of the
10694 -- function's result subtype (as per RM05-6.5(5.3/2)).
10696 return Type_Access_Level (Etype (Scop));
10701 Btyp := Root_Type (Btyp);
10703 -- The accessibility level of anonymous access types associated with
10704 -- discriminants is that of the current instance of the type, and
10705 -- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
10707 -- AI-402: access discriminants have accessibility based on the
10708 -- object rather than the type in Ada 2005, so the above paragraph
10711 -- ??? Needs completion with rules from AI-416
10713 if Ada_Version <= Ada_95
10714 and then Ekind (Typ) = E_Anonymous_Access_Type
10715 and then Present (Associated_Node_For_Itype (Typ))
10716 and then Nkind (Associated_Node_For_Itype (Typ)) =
10717 N_Discriminant_Specification
10719 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp)) + 1;
10723 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
10724 end Type_Access_Level;
10726 --------------------
10727 -- Ultimate_Alias --
10728 --------------------
10729 -- To do: add occurrences calling this new subprogram
10731 function Ultimate_Alias (Prim : Entity_Id) return Entity_Id is
10732 E : Entity_Id := Prim;
10735 while Present (Alias (E)) loop
10740 end Ultimate_Alias;
10742 --------------------------
10743 -- Unit_Declaration_Node --
10744 --------------------------
10746 function Unit_Declaration_Node (Unit_Id : Entity_Id) return Node_Id is
10747 N : Node_Id := Parent (Unit_Id);
10750 -- Predefined operators do not have a full function declaration
10752 if Ekind (Unit_Id) = E_Operator then
10756 -- Isn't there some better way to express the following ???
10758 while Nkind (N) /= N_Abstract_Subprogram_Declaration
10759 and then Nkind (N) /= N_Formal_Package_Declaration
10760 and then Nkind (N) /= N_Function_Instantiation
10761 and then Nkind (N) /= N_Generic_Package_Declaration
10762 and then Nkind (N) /= N_Generic_Subprogram_Declaration
10763 and then Nkind (N) /= N_Package_Declaration
10764 and then Nkind (N) /= N_Package_Body
10765 and then Nkind (N) /= N_Package_Instantiation
10766 and then Nkind (N) /= N_Package_Renaming_Declaration
10767 and then Nkind (N) /= N_Procedure_Instantiation
10768 and then Nkind (N) /= N_Protected_Body
10769 and then Nkind (N) /= N_Subprogram_Declaration
10770 and then Nkind (N) /= N_Subprogram_Body
10771 and then Nkind (N) /= N_Subprogram_Body_Stub
10772 and then Nkind (N) /= N_Subprogram_Renaming_Declaration
10773 and then Nkind (N) /= N_Task_Body
10774 and then Nkind (N) /= N_Task_Type_Declaration
10775 and then Nkind (N) not in N_Formal_Subprogram_Declaration
10776 and then Nkind (N) not in N_Generic_Renaming_Declaration
10779 pragma Assert (Present (N));
10783 end Unit_Declaration_Node;
10785 ------------------------------
10786 -- Universal_Interpretation --
10787 ------------------------------
10789 function Universal_Interpretation (Opnd : Node_Id) return Entity_Id is
10790 Index : Interp_Index;
10794 -- The argument may be a formal parameter of an operator or subprogram
10795 -- with multiple interpretations, or else an expression for an actual.
10797 if Nkind (Opnd) = N_Defining_Identifier
10798 or else not Is_Overloaded (Opnd)
10800 if Etype (Opnd) = Universal_Integer
10801 or else Etype (Opnd) = Universal_Real
10803 return Etype (Opnd);
10809 Get_First_Interp (Opnd, Index, It);
10810 while Present (It.Typ) loop
10811 if It.Typ = Universal_Integer
10812 or else It.Typ = Universal_Real
10817 Get_Next_Interp (Index, It);
10822 end Universal_Interpretation;
10828 function Unqualify (Expr : Node_Id) return Node_Id is
10830 -- Recurse to handle unlikely case of multiple levels of qualification
10832 if Nkind (Expr) = N_Qualified_Expression then
10833 return Unqualify (Expression (Expr));
10835 -- Normal case, not a qualified expression
10842 ----------------------
10843 -- Within_Init_Proc --
10844 ----------------------
10846 function Within_Init_Proc return Boolean is
10850 S := Current_Scope;
10851 while not Is_Overloadable (S) loop
10852 if S = Standard_Standard then
10859 return Is_Init_Proc (S);
10860 end Within_Init_Proc;
10866 procedure Wrong_Type (Expr : Node_Id; Expected_Type : Entity_Id) is
10867 Found_Type : constant Entity_Id := First_Subtype (Etype (Expr));
10868 Expec_Type : constant Entity_Id := First_Subtype (Expected_Type);
10870 function Has_One_Matching_Field return Boolean;
10871 -- Determines if Expec_Type is a record type with a single component or
10872 -- discriminant whose type matches the found type or is one dimensional
10873 -- array whose component type matches the found type.
10875 ----------------------------
10876 -- Has_One_Matching_Field --
10877 ----------------------------
10879 function Has_One_Matching_Field return Boolean is
10883 if Is_Array_Type (Expec_Type)
10884 and then Number_Dimensions (Expec_Type) = 1
10886 Covers (Etype (Component_Type (Expec_Type)), Found_Type)
10890 elsif not Is_Record_Type (Expec_Type) then
10894 E := First_Entity (Expec_Type);
10899 elsif (Ekind (E) /= E_Discriminant
10900 and then Ekind (E) /= E_Component)
10901 or else (Chars (E) = Name_uTag
10902 or else Chars (E) = Name_uParent)
10911 if not Covers (Etype (E), Found_Type) then
10914 elsif Present (Next_Entity (E)) then
10921 end Has_One_Matching_Field;
10923 -- Start of processing for Wrong_Type
10926 -- Don't output message if either type is Any_Type, or if a message
10927 -- has already been posted for this node. We need to do the latter
10928 -- check explicitly (it is ordinarily done in Errout), because we
10929 -- are using ! to force the output of the error messages.
10931 if Expec_Type = Any_Type
10932 or else Found_Type = Any_Type
10933 or else Error_Posted (Expr)
10937 -- In an instance, there is an ongoing problem with completion of
10938 -- type derived from private types. Their structure is what Gigi
10939 -- expects, but the Etype is the parent type rather than the
10940 -- derived private type itself. Do not flag error in this case. The
10941 -- private completion is an entity without a parent, like an Itype.
10942 -- Similarly, full and partial views may be incorrect in the instance.
10943 -- There is no simple way to insure that it is consistent ???
10945 elsif In_Instance then
10946 if Etype (Etype (Expr)) = Etype (Expected_Type)
10948 (Has_Private_Declaration (Expected_Type)
10949 or else Has_Private_Declaration (Etype (Expr)))
10950 and then No (Parent (Expected_Type))
10956 -- An interesting special check. If the expression is parenthesized
10957 -- and its type corresponds to the type of the sole component of the
10958 -- expected record type, or to the component type of the expected one
10959 -- dimensional array type, then assume we have a bad aggregate attempt.
10961 if Nkind (Expr) in N_Subexpr
10962 and then Paren_Count (Expr) /= 0
10963 and then Has_One_Matching_Field
10965 Error_Msg_N ("positional aggregate cannot have one component", Expr);
10967 -- Another special check, if we are looking for a pool-specific access
10968 -- type and we found an E_Access_Attribute_Type, then we have the case
10969 -- of an Access attribute being used in a context which needs a pool-
10970 -- specific type, which is never allowed. The one extra check we make
10971 -- is that the expected designated type covers the Found_Type.
10973 elsif Is_Access_Type (Expec_Type)
10974 and then Ekind (Found_Type) = E_Access_Attribute_Type
10975 and then Ekind (Base_Type (Expec_Type)) /= E_General_Access_Type
10976 and then Ekind (Base_Type (Expec_Type)) /= E_Anonymous_Access_Type
10978 (Designated_Type (Expec_Type), Designated_Type (Found_Type))
10980 Error_Msg_N ("result must be general access type!", Expr);
10981 Error_Msg_NE ("add ALL to }!", Expr, Expec_Type);
10983 -- Another special check, if the expected type is an integer type,
10984 -- but the expression is of type System.Address, and the parent is
10985 -- an addition or subtraction operation whose left operand is the
10986 -- expression in question and whose right operand is of an integral
10987 -- type, then this is an attempt at address arithmetic, so give
10988 -- appropriate message.
10990 elsif Is_Integer_Type (Expec_Type)
10991 and then Is_RTE (Found_Type, RE_Address)
10992 and then (Nkind (Parent (Expr)) = N_Op_Add
10994 Nkind (Parent (Expr)) = N_Op_Subtract)
10995 and then Expr = Left_Opnd (Parent (Expr))
10996 and then Is_Integer_Type (Etype (Right_Opnd (Parent (Expr))))
10999 ("address arithmetic not predefined in package System",
11002 ("\possible missing with/use of System.Storage_Elements",
11006 -- If the expected type is an anonymous access type, as for access
11007 -- parameters and discriminants, the error is on the designated types.
11009 elsif Ekind (Expec_Type) = E_Anonymous_Access_Type then
11010 if Comes_From_Source (Expec_Type) then
11011 Error_Msg_NE ("expected}!", Expr, Expec_Type);
11014 ("expected an access type with designated}",
11015 Expr, Designated_Type (Expec_Type));
11018 if Is_Access_Type (Found_Type)
11019 and then not Comes_From_Source (Found_Type)
11022 ("\\found an access type with designated}!",
11023 Expr, Designated_Type (Found_Type));
11025 if From_With_Type (Found_Type) then
11026 Error_Msg_NE ("\\found incomplete}!", Expr, Found_Type);
11027 Error_Msg_Qual_Level := 99;
11028 Error_Msg_NE ("\\missing `WITH &;", Expr, Scope (Found_Type));
11029 Error_Msg_Qual_Level := 0;
11031 Error_Msg_NE ("found}!", Expr, Found_Type);
11035 -- Normal case of one type found, some other type expected
11038 -- If the names of the two types are the same, see if some number
11039 -- of levels of qualification will help. Don't try more than three
11040 -- levels, and if we get to standard, it's no use (and probably
11041 -- represents an error in the compiler) Also do not bother with
11042 -- internal scope names.
11045 Expec_Scope : Entity_Id;
11046 Found_Scope : Entity_Id;
11049 Expec_Scope := Expec_Type;
11050 Found_Scope := Found_Type;
11052 for Levels in Int range 0 .. 3 loop
11053 if Chars (Expec_Scope) /= Chars (Found_Scope) then
11054 Error_Msg_Qual_Level := Levels;
11058 Expec_Scope := Scope (Expec_Scope);
11059 Found_Scope := Scope (Found_Scope);
11061 exit when Expec_Scope = Standard_Standard
11062 or else Found_Scope = Standard_Standard
11063 or else not Comes_From_Source (Expec_Scope)
11064 or else not Comes_From_Source (Found_Scope);
11068 if Is_Record_Type (Expec_Type)
11069 and then Present (Corresponding_Remote_Type (Expec_Type))
11071 Error_Msg_NE ("expected}!", Expr,
11072 Corresponding_Remote_Type (Expec_Type));
11074 Error_Msg_NE ("expected}!", Expr, Expec_Type);
11077 if Is_Entity_Name (Expr)
11078 and then Is_Package_Or_Generic_Package (Entity (Expr))
11080 Error_Msg_N ("\\found package name!", Expr);
11082 elsif Is_Entity_Name (Expr)
11084 (Ekind (Entity (Expr)) = E_Procedure
11086 Ekind (Entity (Expr)) = E_Generic_Procedure)
11088 if Ekind (Expec_Type) = E_Access_Subprogram_Type then
11090 ("found procedure name, possibly missing Access attribute!",
11094 ("\\found procedure name instead of function!", Expr);
11097 elsif Nkind (Expr) = N_Function_Call
11098 and then Ekind (Expec_Type) = E_Access_Subprogram_Type
11099 and then Etype (Designated_Type (Expec_Type)) = Etype (Expr)
11100 and then No (Parameter_Associations (Expr))
11103 ("found function name, possibly missing Access attribute!",
11106 -- Catch common error: a prefix or infix operator which is not
11107 -- directly visible because the type isn't.
11109 elsif Nkind (Expr) in N_Op
11110 and then Is_Overloaded (Expr)
11111 and then not Is_Immediately_Visible (Expec_Type)
11112 and then not Is_Potentially_Use_Visible (Expec_Type)
11113 and then not In_Use (Expec_Type)
11114 and then Has_Compatible_Type (Right_Opnd (Expr), Expec_Type)
11117 ("operator of the type is not directly visible!", Expr);
11119 elsif Ekind (Found_Type) = E_Void
11120 and then Present (Parent (Found_Type))
11121 and then Nkind (Parent (Found_Type)) = N_Full_Type_Declaration
11123 Error_Msg_NE ("\\found premature usage of}!", Expr, Found_Type);
11126 Error_Msg_NE ("\\found}!", Expr, Found_Type);
11129 -- A special check for cases like M1 and M2 = 0 where M1 and M2 are
11130 -- of the same modular type, and (M1 and M2) = 0 was intended.
11132 if Expec_Type = Standard_Boolean
11133 and then Is_Modular_Integer_Type (Found_Type)
11134 and then Nkind_In (Parent (Expr), N_Op_And, N_Op_Or, N_Op_Xor)
11135 and then Nkind (Right_Opnd (Parent (Expr))) in N_Op_Compare
11138 Op : constant Node_Id := Right_Opnd (Parent (Expr));
11139 L : constant Node_Id := Left_Opnd (Op);
11140 R : constant Node_Id := Right_Opnd (Op);
11142 if Etype (L) = Found_Type
11143 and then Is_Integer_Type (Etype (R))
11146 ("\\possible missing parens for modular operation", Expr);
11151 -- Reset error message qualification indication
11153 Error_Msg_Qual_Level := 0;