1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2005, 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 2, 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 COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 with Atree; use Atree;
28 with Casing; use Casing;
29 with Checks; use Checks;
30 with Debug; use Debug;
31 with Errout; use Errout;
32 with Elists; use Elists;
33 with Exp_Tss; use Exp_Tss;
34 with Exp_Util; use Exp_Util;
35 with Fname; use Fname;
36 with Freeze; use Freeze;
38 with Lib.Xref; use Lib.Xref;
39 with Namet; use Namet;
40 with Nlists; use Nlists;
41 with Nmake; use Nmake;
42 with Output; use Output;
44 with Rtsfind; use Rtsfind;
45 with Scans; use Scans;
48 with Sem_Ch8; use Sem_Ch8;
49 with Sem_Eval; use Sem_Eval;
50 with Sem_Res; use Sem_Res;
51 with Sem_Type; use Sem_Type;
52 with Sinfo; use Sinfo;
53 with Sinput; use Sinput;
54 with Snames; use Snames;
55 with Stand; use Stand;
57 with Stringt; use Stringt;
58 with Targparm; use Targparm;
59 with Tbuild; use Tbuild;
60 with Ttypes; use Ttypes;
61 with Uname; use Uname;
63 package body Sem_Util is
65 -----------------------
66 -- Local Subprograms --
67 -----------------------
69 function Build_Component_Subtype
72 T : Entity_Id) return Node_Id;
73 -- This function builds the subtype for Build_Actual_Subtype_Of_Component
74 -- and Build_Discriminal_Subtype_Of_Component. C is a list of constraints,
75 -- Loc is the source location, T is the original subtype.
77 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean;
78 -- Subsidiary to Is_Fully_Initialized_Type. For an unconstrained type
79 -- with discriminants whose default values are static, examine only the
80 -- components in the selected variant to determine whether all of them
83 function Has_Null_Extension (T : Entity_Id) return Boolean;
84 -- T is a derived tagged type. Check whether the type extension is null.
85 -- If the parent type is fully initialized, T can be treated as such.
87 --------------------------------
88 -- Add_Access_Type_To_Process --
89 --------------------------------
91 procedure Add_Access_Type_To_Process (E : Entity_Id; A : Entity_Id) is
95 Ensure_Freeze_Node (E);
96 L := Access_Types_To_Process (Freeze_Node (E));
100 Set_Access_Types_To_Process (Freeze_Node (E), L);
104 end Add_Access_Type_To_Process;
106 -----------------------
107 -- Alignment_In_Bits --
108 -----------------------
110 function Alignment_In_Bits (E : Entity_Id) return Uint is
112 return Alignment (E) * System_Storage_Unit;
113 end Alignment_In_Bits;
115 -----------------------------------------
116 -- Apply_Compile_Time_Constraint_Error --
117 -----------------------------------------
119 procedure Apply_Compile_Time_Constraint_Error
122 Reason : RT_Exception_Code;
123 Ent : Entity_Id := Empty;
124 Typ : Entity_Id := Empty;
125 Loc : Source_Ptr := No_Location;
126 Rep : Boolean := True;
127 Warn : Boolean := False)
129 Stat : constant Boolean := Is_Static_Expression (N);
140 Compile_Time_Constraint_Error (N, Msg, Ent, Loc, Warn => Warn));
146 -- Now we replace the node by an N_Raise_Constraint_Error node
147 -- This does not need reanalyzing, so set it as analyzed now.
150 Make_Raise_Constraint_Error (Sloc (N),
152 Set_Analyzed (N, True);
154 Set_Raises_Constraint_Error (N);
156 -- If the original expression was marked as static, the result is
157 -- still marked as static, but the Raises_Constraint_Error flag is
158 -- always set so that further static evaluation is not attempted.
161 Set_Is_Static_Expression (N);
163 end Apply_Compile_Time_Constraint_Error;
165 --------------------------
166 -- Build_Actual_Subtype --
167 --------------------------
169 function Build_Actual_Subtype
171 N : Node_Or_Entity_Id) return Node_Id
175 Loc : constant Source_Ptr := Sloc (N);
176 Constraints : List_Id;
182 Disc_Type : Entity_Id;
185 if Nkind (N) = N_Defining_Identifier then
186 Obj := New_Reference_To (N, Loc);
191 if Is_Array_Type (T) then
192 Constraints := New_List;
194 for J in 1 .. Number_Dimensions (T) loop
196 -- Build an array subtype declaration with the nominal
197 -- subtype and the bounds of the actual. Add the declaration
198 -- in front of the local declarations for the subprogram, for
199 -- analysis before any reference to the formal in the body.
202 Make_Attribute_Reference (Loc,
204 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
205 Attribute_Name => Name_First,
206 Expressions => New_List (
207 Make_Integer_Literal (Loc, J)));
210 Make_Attribute_Reference (Loc,
212 Duplicate_Subexpr_No_Checks (Obj, Name_Req => True),
213 Attribute_Name => Name_Last,
214 Expressions => New_List (
215 Make_Integer_Literal (Loc, J)));
217 Append (Make_Range (Loc, Lo, Hi), Constraints);
220 -- If the type has unknown discriminants there is no constrained
221 -- subtype to build. This is never called for a formal or for a
222 -- lhs, so returning the type is ok ???
224 elsif Has_Unknown_Discriminants (T) then
228 Constraints := New_List;
230 if Is_Private_Type (T) and then No (Full_View (T)) then
232 -- Type is a generic derived type. Inherit discriminants from
235 Disc_Type := Etype (Base_Type (T));
240 Discr := First_Discriminant (Disc_Type);
242 while Present (Discr) loop
243 Append_To (Constraints,
244 Make_Selected_Component (Loc,
246 Duplicate_Subexpr_No_Checks (Obj),
247 Selector_Name => New_Occurrence_Of (Discr, Loc)));
248 Next_Discriminant (Discr);
253 Make_Defining_Identifier (Loc,
254 Chars => New_Internal_Name ('S'));
255 Set_Is_Internal (Subt);
258 Make_Subtype_Declaration (Loc,
259 Defining_Identifier => Subt,
260 Subtype_Indication =>
261 Make_Subtype_Indication (Loc,
262 Subtype_Mark => New_Reference_To (T, Loc),
264 Make_Index_Or_Discriminant_Constraint (Loc,
265 Constraints => Constraints)));
267 Mark_Rewrite_Insertion (Decl);
269 end Build_Actual_Subtype;
271 ---------------------------------------
272 -- Build_Actual_Subtype_Of_Component --
273 ---------------------------------------
275 function Build_Actual_Subtype_Of_Component
277 N : Node_Id) return Node_Id
279 Loc : constant Source_Ptr := Sloc (N);
280 P : constant Node_Id := Prefix (N);
283 Indx_Type : Entity_Id;
285 Deaccessed_T : Entity_Id;
286 -- This is either a copy of T, or if T is an access type, then it is
287 -- the directly designated type of this access type.
289 function Build_Actual_Array_Constraint return List_Id;
290 -- If one or more of the bounds of the component depends on
291 -- discriminants, build actual constraint using the discriminants
294 function Build_Actual_Record_Constraint return List_Id;
295 -- Similar to previous one, for discriminated components constrained
296 -- by the discriminant of the enclosing object.
298 -----------------------------------
299 -- Build_Actual_Array_Constraint --
300 -----------------------------------
302 function Build_Actual_Array_Constraint return List_Id is
303 Constraints : constant List_Id := New_List;
311 Indx := First_Index (Deaccessed_T);
312 while Present (Indx) loop
313 Old_Lo := Type_Low_Bound (Etype (Indx));
314 Old_Hi := Type_High_Bound (Etype (Indx));
316 if Denotes_Discriminant (Old_Lo) then
318 Make_Selected_Component (Loc,
319 Prefix => New_Copy_Tree (P),
320 Selector_Name => New_Occurrence_Of (Entity (Old_Lo), Loc));
323 Lo := New_Copy_Tree (Old_Lo);
325 -- The new bound will be reanalyzed in the enclosing
326 -- declaration. For literal bounds that come from a type
327 -- declaration, the type of the context must be imposed, so
328 -- insure that analysis will take place. For non-universal
329 -- types this is not strictly necessary.
331 Set_Analyzed (Lo, False);
334 if Denotes_Discriminant (Old_Hi) then
336 Make_Selected_Component (Loc,
337 Prefix => New_Copy_Tree (P),
338 Selector_Name => New_Occurrence_Of (Entity (Old_Hi), Loc));
341 Hi := New_Copy_Tree (Old_Hi);
342 Set_Analyzed (Hi, False);
345 Append (Make_Range (Loc, Lo, Hi), Constraints);
350 end Build_Actual_Array_Constraint;
352 ------------------------------------
353 -- Build_Actual_Record_Constraint --
354 ------------------------------------
356 function Build_Actual_Record_Constraint return List_Id is
357 Constraints : constant List_Id := New_List;
362 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
363 while Present (D) loop
365 if Denotes_Discriminant (Node (D)) then
366 D_Val := Make_Selected_Component (Loc,
367 Prefix => New_Copy_Tree (P),
368 Selector_Name => New_Occurrence_Of (Entity (Node (D)), Loc));
371 D_Val := New_Copy_Tree (Node (D));
374 Append (D_Val, Constraints);
379 end Build_Actual_Record_Constraint;
381 -- Start of processing for Build_Actual_Subtype_Of_Component
384 if In_Default_Expression then
387 elsif Nkind (N) = N_Explicit_Dereference then
388 if Is_Composite_Type (T)
389 and then not Is_Constrained (T)
390 and then not (Is_Class_Wide_Type (T)
391 and then Is_Constrained (Root_Type (T)))
392 and then not Has_Unknown_Discriminants (T)
394 -- If the type of the dereference is already constrained, it
395 -- is an actual subtype.
397 if Is_Array_Type (Etype (N))
398 and then Is_Constrained (Etype (N))
402 Remove_Side_Effects (P);
403 return Build_Actual_Subtype (T, N);
410 if Ekind (T) = E_Access_Subtype then
411 Deaccessed_T := Designated_Type (T);
416 if Ekind (Deaccessed_T) = E_Array_Subtype then
417 Id := First_Index (Deaccessed_T);
419 while Present (Id) loop
420 Indx_Type := Underlying_Type (Etype (Id));
422 if Denotes_Discriminant (Type_Low_Bound (Indx_Type)) or else
423 Denotes_Discriminant (Type_High_Bound (Indx_Type))
425 Remove_Side_Effects (P);
427 Build_Component_Subtype (
428 Build_Actual_Array_Constraint, Loc, Base_Type (T));
434 elsif Is_Composite_Type (Deaccessed_T)
435 and then Has_Discriminants (Deaccessed_T)
436 and then not Has_Unknown_Discriminants (Deaccessed_T)
438 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
439 while Present (D) loop
441 if Denotes_Discriminant (Node (D)) then
442 Remove_Side_Effects (P);
444 Build_Component_Subtype (
445 Build_Actual_Record_Constraint, Loc, Base_Type (T));
452 -- If none of the above, the actual and nominal subtypes are the same
455 end Build_Actual_Subtype_Of_Component;
457 -----------------------------
458 -- Build_Component_Subtype --
459 -----------------------------
461 function Build_Component_Subtype
464 T : Entity_Id) return Node_Id
470 -- Unchecked_Union components do not require component subtypes
472 if Is_Unchecked_Union (T) then
477 Make_Defining_Identifier (Loc,
478 Chars => New_Internal_Name ('S'));
479 Set_Is_Internal (Subt);
482 Make_Subtype_Declaration (Loc,
483 Defining_Identifier => Subt,
484 Subtype_Indication =>
485 Make_Subtype_Indication (Loc,
486 Subtype_Mark => New_Reference_To (Base_Type (T), Loc),
488 Make_Index_Or_Discriminant_Constraint (Loc,
491 Mark_Rewrite_Insertion (Decl);
493 end Build_Component_Subtype;
495 --------------------------------------------
496 -- Build_Discriminal_Subtype_Of_Component --
497 --------------------------------------------
499 function Build_Discriminal_Subtype_Of_Component
500 (T : Entity_Id) return Node_Id
502 Loc : constant Source_Ptr := Sloc (T);
506 function Build_Discriminal_Array_Constraint return List_Id;
507 -- If one or more of the bounds of the component depends on
508 -- discriminants, build actual constraint using the discriminants
511 function Build_Discriminal_Record_Constraint return List_Id;
512 -- Similar to previous one, for discriminated components constrained
513 -- by the discriminant of the enclosing object.
515 ----------------------------------------
516 -- Build_Discriminal_Array_Constraint --
517 ----------------------------------------
519 function Build_Discriminal_Array_Constraint return List_Id is
520 Constraints : constant List_Id := New_List;
528 Indx := First_Index (T);
529 while Present (Indx) loop
530 Old_Lo := Type_Low_Bound (Etype (Indx));
531 Old_Hi := Type_High_Bound (Etype (Indx));
533 if Denotes_Discriminant (Old_Lo) then
534 Lo := New_Occurrence_Of (Discriminal (Entity (Old_Lo)), Loc);
537 Lo := New_Copy_Tree (Old_Lo);
540 if Denotes_Discriminant (Old_Hi) then
541 Hi := New_Occurrence_Of (Discriminal (Entity (Old_Hi)), Loc);
544 Hi := New_Copy_Tree (Old_Hi);
547 Append (Make_Range (Loc, Lo, Hi), Constraints);
552 end Build_Discriminal_Array_Constraint;
554 -----------------------------------------
555 -- Build_Discriminal_Record_Constraint --
556 -----------------------------------------
558 function Build_Discriminal_Record_Constraint return List_Id is
559 Constraints : constant List_Id := New_List;
564 D := First_Elmt (Discriminant_Constraint (T));
565 while Present (D) loop
566 if Denotes_Discriminant (Node (D)) then
568 New_Occurrence_Of (Discriminal (Entity (Node (D))), Loc);
571 D_Val := New_Copy_Tree (Node (D));
574 Append (D_Val, Constraints);
579 end Build_Discriminal_Record_Constraint;
581 -- Start of processing for Build_Discriminal_Subtype_Of_Component
584 if Ekind (T) = E_Array_Subtype then
585 Id := First_Index (T);
587 while Present (Id) loop
588 if Denotes_Discriminant (Type_Low_Bound (Etype (Id))) or else
589 Denotes_Discriminant (Type_High_Bound (Etype (Id)))
591 return Build_Component_Subtype
592 (Build_Discriminal_Array_Constraint, Loc, T);
598 elsif Ekind (T) = E_Record_Subtype
599 and then Has_Discriminants (T)
600 and then not Has_Unknown_Discriminants (T)
602 D := First_Elmt (Discriminant_Constraint (T));
603 while Present (D) loop
604 if Denotes_Discriminant (Node (D)) then
605 return Build_Component_Subtype
606 (Build_Discriminal_Record_Constraint, Loc, T);
613 -- If none of the above, the actual and nominal subtypes are the same
616 end Build_Discriminal_Subtype_Of_Component;
618 ------------------------------
619 -- Build_Elaboration_Entity --
620 ------------------------------
622 procedure Build_Elaboration_Entity (N : Node_Id; Spec_Id : Entity_Id) is
623 Loc : constant Source_Ptr := Sloc (N);
624 Unum : constant Unit_Number_Type := Get_Source_Unit (Loc);
627 Elab_Ent : Entity_Id;
630 -- Ignore if already constructed
632 if Present (Elaboration_Entity (Spec_Id)) then
636 -- Construct name of elaboration entity as xxx_E, where xxx
637 -- is the unit name with dots replaced by double underscore.
638 -- We have to manually construct this name, since it will
639 -- be elaborated in the outer scope, and thus will not have
640 -- the unit name automatically prepended.
642 Get_Name_String (Unit_Name (Unum));
644 -- Replace the %s by _E
646 Name_Buffer (Name_Len - 1 .. Name_Len) := "_E";
648 -- Replace dots by double underscore
651 while P < Name_Len - 2 loop
652 if Name_Buffer (P) = '.' then
653 Name_Buffer (P + 2 .. Name_Len + 1) :=
654 Name_Buffer (P + 1 .. Name_Len);
655 Name_Len := Name_Len + 1;
656 Name_Buffer (P) := '_';
657 Name_Buffer (P + 1) := '_';
664 -- Create elaboration flag
667 Make_Defining_Identifier (Loc, Chars => Name_Find);
668 Set_Elaboration_Entity (Spec_Id, Elab_Ent);
670 if No (Declarations (Aux_Decls_Node (N))) then
671 Set_Declarations (Aux_Decls_Node (N), New_List);
675 Make_Object_Declaration (Loc,
676 Defining_Identifier => Elab_Ent,
678 New_Occurrence_Of (Standard_Boolean, Loc),
680 New_Occurrence_Of (Standard_False, Loc));
682 Append_To (Declarations (Aux_Decls_Node (N)), Decl);
685 -- Reset True_Constant indication, since we will indeed
686 -- assign a value to the variable in the binder main.
688 Set_Is_True_Constant (Elab_Ent, False);
689 Set_Current_Value (Elab_Ent, Empty);
691 -- We do not want any further qualification of the name (if we did
692 -- not do this, we would pick up the name of the generic package
693 -- in the case of a library level generic instantiation).
695 Set_Has_Qualified_Name (Elab_Ent);
696 Set_Has_Fully_Qualified_Name (Elab_Ent);
697 end Build_Elaboration_Entity;
699 -----------------------------------
700 -- Cannot_Raise_Constraint_Error --
701 -----------------------------------
703 function Cannot_Raise_Constraint_Error (Expr : Node_Id) return Boolean is
705 if Compile_Time_Known_Value (Expr) then
708 elsif Do_Range_Check (Expr) then
711 elsif Raises_Constraint_Error (Expr) then
719 when N_Expanded_Name =>
722 when N_Selected_Component =>
723 return not Do_Discriminant_Check (Expr);
725 when N_Attribute_Reference =>
726 if Do_Overflow_Check (Expr) then
729 elsif No (Expressions (Expr)) then
734 N : Node_Id := First (Expressions (Expr));
737 while Present (N) loop
738 if Cannot_Raise_Constraint_Error (N) then
749 when N_Type_Conversion =>
750 if Do_Overflow_Check (Expr)
751 or else Do_Length_Check (Expr)
752 or else Do_Tag_Check (Expr)
757 Cannot_Raise_Constraint_Error (Expression (Expr));
760 when N_Unchecked_Type_Conversion =>
761 return Cannot_Raise_Constraint_Error (Expression (Expr));
764 if Do_Overflow_Check (Expr) then
768 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
775 if Do_Division_Check (Expr)
776 or else Do_Overflow_Check (Expr)
781 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
783 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
802 N_Op_Shift_Right_Arithmetic |
806 if Do_Overflow_Check (Expr) then
810 Cannot_Raise_Constraint_Error (Left_Opnd (Expr))
812 Cannot_Raise_Constraint_Error (Right_Opnd (Expr));
819 end Cannot_Raise_Constraint_Error;
821 --------------------------
822 -- Check_Fully_Declared --
823 --------------------------
825 procedure Check_Fully_Declared (T : Entity_Id; N : Node_Id) is
827 if Ekind (T) = E_Incomplete_Type then
829 -- Ada 2005 (AI-50217): If the type is available through a limited
830 -- with_clause, verify that its full view has been analyzed.
832 if From_With_Type (T)
833 and then Present (Non_Limited_View (T))
834 and then Ekind (Non_Limited_View (T)) /= E_Incomplete_Type
836 -- The non-limited view is fully declared
841 ("premature usage of incomplete}", N, First_Subtype (T));
844 elsif Has_Private_Component (T)
845 and then not Is_Generic_Type (Root_Type (T))
846 and then not In_Default_Expression
849 -- Special case: if T is the anonymous type created for a single
850 -- task or protected object, use the name of the source object.
852 if Is_Concurrent_Type (T)
853 and then not Comes_From_Source (T)
854 and then Nkind (N) = N_Object_Declaration
856 Error_Msg_NE ("type of& has incomplete component", N,
857 Defining_Identifier (N));
861 ("premature usage of incomplete}", N, First_Subtype (T));
864 end Check_Fully_Declared;
866 ------------------------------------------
867 -- Check_Potentially_Blocking_Operation --
868 ------------------------------------------
870 procedure Check_Potentially_Blocking_Operation (N : Node_Id) is
874 -- N is one of the potentially blocking operations listed in 9.5.1(8).
875 -- When pragma Detect_Blocking is active, the run time will raise
876 -- Program_Error. Here we only issue a warning, since we generally
877 -- support the use of potentially blocking operations in the absence
880 -- Indirect blocking through a subprogram call cannot be diagnosed
881 -- statically without interprocedural analysis, so we do not attempt
884 S := Scope (Current_Scope);
885 while Present (S) and then S /= Standard_Standard loop
886 if Is_Protected_Type (S) then
888 ("potentially blocking operation in protected operation?", N);
895 end Check_Potentially_Blocking_Operation;
901 procedure Check_VMS (Construct : Node_Id) is
903 if not OpenVMS_On_Target then
905 ("this construct is allowed only in Open'V'M'S", Construct);
909 ----------------------------------
910 -- Collect_Primitive_Operations --
911 ----------------------------------
913 function Collect_Primitive_Operations (T : Entity_Id) return Elist_Id is
914 B_Type : constant Entity_Id := Base_Type (T);
915 B_Decl : constant Node_Id := Original_Node (Parent (B_Type));
916 B_Scope : Entity_Id := Scope (B_Type);
920 Formal_Derived : Boolean := False;
924 -- For tagged types, the primitive operations are collected as they
925 -- are declared, and held in an explicit list which is simply returned.
927 if Is_Tagged_Type (B_Type) then
928 return Primitive_Operations (B_Type);
930 -- An untagged generic type that is a derived type inherits the
931 -- primitive operations of its parent type. Other formal types only
932 -- have predefined operators, which are not explicitly represented.
934 elsif Is_Generic_Type (B_Type) then
935 if Nkind (B_Decl) = N_Formal_Type_Declaration
936 and then Nkind (Formal_Type_Definition (B_Decl))
937 = N_Formal_Derived_Type_Definition
939 Formal_Derived := True;
941 return New_Elmt_List;
945 Op_List := New_Elmt_List;
947 if B_Scope = Standard_Standard then
948 if B_Type = Standard_String then
949 Append_Elmt (Standard_Op_Concat, Op_List);
951 elsif B_Type = Standard_Wide_String then
952 Append_Elmt (Standard_Op_Concatw, Op_List);
958 elsif (Is_Package (B_Scope)
960 Parent (Declaration_Node (First_Subtype (T))))
963 or else Is_Derived_Type (B_Type)
965 -- The primitive operations appear after the base type, except
966 -- if the derivation happens within the private part of B_Scope
967 -- and the type is a private type, in which case both the type
968 -- and some primitive operations may appear before the base
969 -- type, and the list of candidates starts after the type.
971 if In_Open_Scopes (B_Scope)
972 and then Scope (T) = B_Scope
973 and then In_Private_Part (B_Scope)
975 Id := Next_Entity (T);
977 Id := Next_Entity (B_Type);
980 while Present (Id) loop
982 -- Note that generic formal subprograms are not
983 -- considered to be primitive operations and thus
984 -- are never inherited.
986 if Is_Overloadable (Id)
987 and then Nkind (Parent (Parent (Id)))
988 not in N_Formal_Subprogram_Declaration
992 if Base_Type (Etype (Id)) = B_Type then
995 Formal := First_Formal (Id);
996 while Present (Formal) loop
997 if Base_Type (Etype (Formal)) = B_Type then
1001 elsif Ekind (Etype (Formal)) = E_Anonymous_Access_Type
1003 (Designated_Type (Etype (Formal))) = B_Type
1009 Next_Formal (Formal);
1013 -- For a formal derived type, the only primitives are the
1014 -- ones inherited from the parent type. Operations appearing
1015 -- in the package declaration are not primitive for it.
1018 and then (not Formal_Derived
1019 or else Present (Alias (Id)))
1021 Append_Elmt (Id, Op_List);
1027 -- For a type declared in System, some of its operations
1028 -- may appear in the target-specific extension to System.
1031 and then Chars (B_Scope) = Name_System
1032 and then Scope (B_Scope) = Standard_Standard
1033 and then Present_System_Aux
1035 B_Scope := System_Aux_Id;
1036 Id := First_Entity (System_Aux_Id);
1042 end Collect_Primitive_Operations;
1044 -----------------------------------
1045 -- Compile_Time_Constraint_Error --
1046 -----------------------------------
1048 function Compile_Time_Constraint_Error
1051 Ent : Entity_Id := Empty;
1052 Loc : Source_Ptr := No_Location;
1053 Warn : Boolean := False) return Node_Id
1055 Msgc : String (1 .. Msg'Length + 2);
1063 -- A static constraint error in an instance body is not a fatal error.
1064 -- we choose to inhibit the message altogether, because there is no
1065 -- obvious node (for now) on which to post it. On the other hand the
1066 -- offending node must be replaced with a constraint_error in any case.
1068 -- No messages are generated if we already posted an error on this node
1070 if not Error_Posted (N) then
1071 if Loc /= No_Location then
1077 -- Make all such messages unconditional
1079 Msgc (1 .. Msg'Length) := Msg;
1080 Msgc (Msg'Length + 1) := '!';
1081 Msgl := Msg'Length + 1;
1083 -- Message is a warning, even in Ada 95 case
1085 if Msg (Msg'Length) = '?' then
1088 -- In Ada 83, all messages are warnings. In the private part and
1089 -- the body of an instance, constraint_checks are only warnings.
1090 -- We also make this a warning if the Warn parameter is set.
1093 or else (Ada_Version = Ada_83 and then Comes_From_Source (N))
1099 elsif In_Instance_Not_Visible then
1104 -- Otherwise we have a real error message (Ada 95 static case)
1110 -- Should we generate a warning? The answer is not quite yes. The
1111 -- very annoying exception occurs in the case of a short circuit
1112 -- operator where the left operand is static and decisive. Climb
1113 -- parents to see if that is the case we have here.
1121 if (Nkind (P) = N_And_Then
1122 and then Compile_Time_Known_Value (Left_Opnd (P))
1123 and then Is_False (Expr_Value (Left_Opnd (P))))
1124 or else (Nkind (P) = N_Or_Else
1125 and then Compile_Time_Known_Value (Left_Opnd (P))
1126 and then Is_True (Expr_Value (Left_Opnd (P))))
1131 elsif Nkind (P) = N_Component_Association
1132 and then Nkind (Parent (P)) = N_Aggregate
1134 null; -- Keep going.
1137 exit when Nkind (P) not in N_Subexpr;
1142 if Present (Ent) then
1143 Error_Msg_NEL (Msgc (1 .. Msgl), N, Ent, Eloc);
1145 Error_Msg_NEL (Msgc (1 .. Msgl), N, Etype (N), Eloc);
1149 if Inside_Init_Proc then
1151 ("\& will be raised for objects of this type!?",
1152 N, Standard_Constraint_Error, Eloc);
1155 ("\& will be raised at run time!?",
1156 N, Standard_Constraint_Error, Eloc);
1160 ("\static expression raises&!",
1161 N, Standard_Constraint_Error, Eloc);
1167 end Compile_Time_Constraint_Error;
1169 -----------------------
1170 -- Conditional_Delay --
1171 -----------------------
1173 procedure Conditional_Delay (New_Ent, Old_Ent : Entity_Id) is
1175 if Has_Delayed_Freeze (Old_Ent) and then not Is_Frozen (Old_Ent) then
1176 Set_Has_Delayed_Freeze (New_Ent);
1178 end Conditional_Delay;
1180 --------------------
1181 -- Current_Entity --
1182 --------------------
1184 -- The currently visible definition for a given identifier is the
1185 -- one most chained at the start of the visibility chain, i.e. the
1186 -- one that is referenced by the Node_Id value of the name of the
1187 -- given identifier.
1189 function Current_Entity (N : Node_Id) return Entity_Id is
1191 return Get_Name_Entity_Id (Chars (N));
1194 -----------------------------
1195 -- Current_Entity_In_Scope --
1196 -----------------------------
1198 function Current_Entity_In_Scope (N : Node_Id) return Entity_Id is
1200 CS : constant Entity_Id := Current_Scope;
1202 Transient_Case : constant Boolean := Scope_Is_Transient;
1205 E := Get_Name_Entity_Id (Chars (N));
1208 and then Scope (E) /= CS
1209 and then (not Transient_Case or else Scope (E) /= Scope (CS))
1215 end Current_Entity_In_Scope;
1221 function Current_Scope return Entity_Id is
1223 if Scope_Stack.Last = -1 then
1224 return Standard_Standard;
1227 C : constant Entity_Id :=
1228 Scope_Stack.Table (Scope_Stack.Last).Entity;
1233 return Standard_Standard;
1239 ------------------------
1240 -- Current_Subprogram --
1241 ------------------------
1243 function Current_Subprogram return Entity_Id is
1244 Scop : constant Entity_Id := Current_Scope;
1247 if Is_Subprogram (Scop) or else Is_Generic_Subprogram (Scop) then
1250 return Enclosing_Subprogram (Scop);
1252 end Current_Subprogram;
1254 ---------------------
1255 -- Defining_Entity --
1256 ---------------------
1258 function Defining_Entity (N : Node_Id) return Entity_Id is
1259 K : constant Node_Kind := Nkind (N);
1260 Err : Entity_Id := Empty;
1265 N_Subprogram_Declaration |
1266 N_Abstract_Subprogram_Declaration |
1268 N_Package_Declaration |
1269 N_Subprogram_Renaming_Declaration |
1270 N_Subprogram_Body_Stub |
1271 N_Generic_Subprogram_Declaration |
1272 N_Generic_Package_Declaration |
1273 N_Formal_Subprogram_Declaration
1275 return Defining_Entity (Specification (N));
1278 N_Component_Declaration |
1279 N_Defining_Program_Unit_Name |
1280 N_Discriminant_Specification |
1282 N_Entry_Declaration |
1283 N_Entry_Index_Specification |
1284 N_Exception_Declaration |
1285 N_Exception_Renaming_Declaration |
1286 N_Formal_Object_Declaration |
1287 N_Formal_Package_Declaration |
1288 N_Formal_Type_Declaration |
1289 N_Full_Type_Declaration |
1290 N_Implicit_Label_Declaration |
1291 N_Incomplete_Type_Declaration |
1292 N_Loop_Parameter_Specification |
1293 N_Number_Declaration |
1294 N_Object_Declaration |
1295 N_Object_Renaming_Declaration |
1296 N_Package_Body_Stub |
1297 N_Parameter_Specification |
1298 N_Private_Extension_Declaration |
1299 N_Private_Type_Declaration |
1301 N_Protected_Body_Stub |
1302 N_Protected_Type_Declaration |
1303 N_Single_Protected_Declaration |
1304 N_Single_Task_Declaration |
1305 N_Subtype_Declaration |
1308 N_Task_Type_Declaration
1310 return Defining_Identifier (N);
1313 return Defining_Entity (Proper_Body (N));
1316 N_Function_Instantiation |
1317 N_Function_Specification |
1318 N_Generic_Function_Renaming_Declaration |
1319 N_Generic_Package_Renaming_Declaration |
1320 N_Generic_Procedure_Renaming_Declaration |
1322 N_Package_Instantiation |
1323 N_Package_Renaming_Declaration |
1324 N_Package_Specification |
1325 N_Procedure_Instantiation |
1326 N_Procedure_Specification
1329 Nam : constant Node_Id := Defining_Unit_Name (N);
1332 if Nkind (Nam) in N_Entity then
1335 -- For Error, make up a name and attach to declaration
1336 -- so we can continue semantic analysis
1338 elsif Nam = Error then
1340 Make_Defining_Identifier (Sloc (N),
1341 Chars => New_Internal_Name ('T'));
1342 Set_Defining_Unit_Name (N, Err);
1345 -- If not an entity, get defining identifier
1348 return Defining_Identifier (Nam);
1352 when N_Block_Statement =>
1353 return Entity (Identifier (N));
1356 raise Program_Error;
1359 end Defining_Entity;
1361 --------------------------
1362 -- Denotes_Discriminant --
1363 --------------------------
1365 function Denotes_Discriminant
1367 Check_Protected : Boolean := False) return Boolean
1371 if not Is_Entity_Name (N)
1372 or else No (Entity (N))
1379 -- If we are checking for a protected type, the discriminant may have
1380 -- been rewritten as the corresponding discriminal of the original type
1381 -- or of the corresponding concurrent record, depending on whether we
1382 -- are in the spec or body of the protected type.
1384 return Ekind (E) = E_Discriminant
1387 and then Ekind (E) = E_In_Parameter
1388 and then Present (Discriminal_Link (E))
1390 (Is_Protected_Type (Scope (Discriminal_Link (E)))
1392 Is_Concurrent_Record_Type (Scope (Discriminal_Link (E)))));
1394 end Denotes_Discriminant;
1396 -----------------------------
1397 -- Depends_On_Discriminant --
1398 -----------------------------
1400 function Depends_On_Discriminant (N : Node_Id) return Boolean is
1405 Get_Index_Bounds (N, L, H);
1406 return Denotes_Discriminant (L) or else Denotes_Discriminant (H);
1407 end Depends_On_Discriminant;
1409 -------------------------
1410 -- Designate_Same_Unit --
1411 -------------------------
1413 function Designate_Same_Unit
1415 Name2 : Node_Id) return Boolean
1417 K1 : constant Node_Kind := Nkind (Name1);
1418 K2 : constant Node_Kind := Nkind (Name2);
1420 function Prefix_Node (N : Node_Id) return Node_Id;
1421 -- Returns the parent unit name node of a defining program unit name
1422 -- or the prefix if N is a selected component or an expanded name.
1424 function Select_Node (N : Node_Id) return Node_Id;
1425 -- Returns the defining identifier node of a defining program unit
1426 -- name or the selector node if N is a selected component or an
1433 function Prefix_Node (N : Node_Id) return Node_Id is
1435 if Nkind (N) = N_Defining_Program_Unit_Name then
1447 function Select_Node (N : Node_Id) return Node_Id is
1449 if Nkind (N) = N_Defining_Program_Unit_Name then
1450 return Defining_Identifier (N);
1453 return Selector_Name (N);
1457 -- Start of processing for Designate_Next_Unit
1460 if (K1 = N_Identifier or else
1461 K1 = N_Defining_Identifier)
1463 (K2 = N_Identifier or else
1464 K2 = N_Defining_Identifier)
1466 return Chars (Name1) = Chars (Name2);
1469 (K1 = N_Expanded_Name or else
1470 K1 = N_Selected_Component or else
1471 K1 = N_Defining_Program_Unit_Name)
1473 (K2 = N_Expanded_Name or else
1474 K2 = N_Selected_Component or else
1475 K2 = N_Defining_Program_Unit_Name)
1478 (Chars (Select_Node (Name1)) = Chars (Select_Node (Name2)))
1480 Designate_Same_Unit (Prefix_Node (Name1), Prefix_Node (Name2));
1485 end Designate_Same_Unit;
1487 ----------------------------
1488 -- Enclosing_Generic_Body --
1489 ----------------------------
1491 function Enclosing_Generic_Body
1492 (E : Entity_Id) return Node_Id
1501 while Present (P) loop
1502 if Nkind (P) = N_Package_Body
1503 or else Nkind (P) = N_Subprogram_Body
1505 Spec := Corresponding_Spec (P);
1507 if Present (Spec) then
1508 Decl := Unit_Declaration_Node (Spec);
1510 if Nkind (Decl) = N_Generic_Package_Declaration
1511 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
1522 end Enclosing_Generic_Body;
1524 -------------------------------
1525 -- Enclosing_Lib_Unit_Entity --
1526 -------------------------------
1528 function Enclosing_Lib_Unit_Entity return Entity_Id is
1529 Unit_Entity : Entity_Id := Current_Scope;
1532 -- Look for enclosing library unit entity by following scope links.
1533 -- Equivalent to, but faster than indexing through the scope stack.
1535 while (Present (Scope (Unit_Entity))
1536 and then Scope (Unit_Entity) /= Standard_Standard)
1537 and not Is_Child_Unit (Unit_Entity)
1539 Unit_Entity := Scope (Unit_Entity);
1543 end Enclosing_Lib_Unit_Entity;
1545 -----------------------------
1546 -- Enclosing_Lib_Unit_Node --
1547 -----------------------------
1549 function Enclosing_Lib_Unit_Node (N : Node_Id) return Node_Id is
1550 Current_Node : Node_Id := N;
1553 while Present (Current_Node)
1554 and then Nkind (Current_Node) /= N_Compilation_Unit
1556 Current_Node := Parent (Current_Node);
1559 if Nkind (Current_Node) /= N_Compilation_Unit then
1563 return Current_Node;
1564 end Enclosing_Lib_Unit_Node;
1566 --------------------------
1567 -- Enclosing_Subprogram --
1568 --------------------------
1570 function Enclosing_Subprogram (E : Entity_Id) return Entity_Id is
1571 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
1574 if Dynamic_Scope = Standard_Standard then
1577 elsif Ekind (Dynamic_Scope) = E_Subprogram_Body then
1578 return Corresponding_Spec (Parent (Parent (Dynamic_Scope)));
1580 elsif Ekind (Dynamic_Scope) = E_Block then
1581 return Enclosing_Subprogram (Dynamic_Scope);
1583 elsif Ekind (Dynamic_Scope) = E_Task_Type then
1584 return Get_Task_Body_Procedure (Dynamic_Scope);
1586 elsif Convention (Dynamic_Scope) = Convention_Protected then
1587 return Protected_Body_Subprogram (Dynamic_Scope);
1590 return Dynamic_Scope;
1592 end Enclosing_Subprogram;
1594 ------------------------
1595 -- Ensure_Freeze_Node --
1596 ------------------------
1598 procedure Ensure_Freeze_Node (E : Entity_Id) is
1602 if No (Freeze_Node (E)) then
1603 FN := Make_Freeze_Entity (Sloc (E));
1604 Set_Has_Delayed_Freeze (E);
1605 Set_Freeze_Node (E, FN);
1606 Set_Access_Types_To_Process (FN, No_Elist);
1607 Set_TSS_Elist (FN, No_Elist);
1610 end Ensure_Freeze_Node;
1616 procedure Enter_Name (Def_Id : Node_Id) is
1617 C : constant Entity_Id := Current_Entity (Def_Id);
1618 E : constant Entity_Id := Current_Entity_In_Scope (Def_Id);
1619 S : constant Entity_Id := Current_Scope;
1622 Generate_Definition (Def_Id);
1624 -- Add new name to current scope declarations. Check for duplicate
1625 -- declaration, which may or may not be a genuine error.
1629 -- Case of previous entity entered because of a missing declaration
1630 -- or else a bad subtype indication. Best is to use the new entity,
1631 -- and make the previous one invisible.
1633 if Etype (E) = Any_Type then
1634 Set_Is_Immediately_Visible (E, False);
1636 -- Case of renaming declaration constructed for package instances.
1637 -- if there is an explicit declaration with the same identifier,
1638 -- the renaming is not immediately visible any longer, but remains
1639 -- visible through selected component notation.
1641 elsif Nkind (Parent (E)) = N_Package_Renaming_Declaration
1642 and then not Comes_From_Source (E)
1644 Set_Is_Immediately_Visible (E, False);
1646 -- The new entity may be the package renaming, which has the same
1647 -- same name as a generic formal which has been seen already.
1649 elsif Nkind (Parent (Def_Id)) = N_Package_Renaming_Declaration
1650 and then not Comes_From_Source (Def_Id)
1652 Set_Is_Immediately_Visible (E, False);
1654 -- For a fat pointer corresponding to a remote access to subprogram,
1655 -- we use the same identifier as the RAS type, so that the proper
1656 -- name appears in the stub. This type is only retrieved through
1657 -- the RAS type and never by visibility, and is not added to the
1658 -- visibility list (see below).
1660 elsif Nkind (Parent (Def_Id)) = N_Full_Type_Declaration
1661 and then Present (Corresponding_Remote_Type (Def_Id))
1665 -- A controller component for a type extension overrides the
1666 -- inherited component.
1668 elsif Chars (E) = Name_uController then
1671 -- Case of an implicit operation or derived literal. The new entity
1672 -- hides the implicit one, which is removed from all visibility,
1673 -- i.e. the entity list of its scope, and homonym chain of its name.
1675 elsif (Is_Overloadable (E) and then Is_Inherited_Operation (E))
1676 or else Is_Internal (E)
1680 Prev_Vis : Entity_Id;
1681 Decl : constant Node_Id := Parent (E);
1684 -- If E is an implicit declaration, it cannot be the first
1685 -- entity in the scope.
1687 Prev := First_Entity (Current_Scope);
1689 while Present (Prev)
1690 and then Next_Entity (Prev) /= E
1697 -- If E is not on the entity chain of the current scope,
1698 -- it is an implicit declaration in the generic formal
1699 -- part of a generic subprogram. When analyzing the body,
1700 -- the generic formals are visible but not on the entity
1701 -- chain of the subprogram. The new entity will become
1702 -- the visible one in the body.
1705 (Nkind (Parent (Decl)) = N_Generic_Subprogram_Declaration);
1709 Set_Next_Entity (Prev, Next_Entity (E));
1711 if No (Next_Entity (Prev)) then
1712 Set_Last_Entity (Current_Scope, Prev);
1715 if E = Current_Entity (E) then
1719 Prev_Vis := Current_Entity (E);
1720 while Homonym (Prev_Vis) /= E loop
1721 Prev_Vis := Homonym (Prev_Vis);
1725 if Present (Prev_Vis) then
1727 -- Skip E in the visibility chain
1729 Set_Homonym (Prev_Vis, Homonym (E));
1732 Set_Name_Entity_Id (Chars (E), Homonym (E));
1737 -- This section of code could use a comment ???
1739 elsif Present (Etype (E))
1740 and then Is_Concurrent_Type (Etype (E))
1745 -- In the body or private part of an instance, a type extension
1746 -- may introduce a component with the same name as that of an
1747 -- actual. The legality rule is not enforced, but the semantics
1748 -- of the full type with two components of the same name are not
1749 -- clear at this point ???
1751 elsif In_Instance_Not_Visible then
1754 -- When compiling a package body, some child units may have become
1755 -- visible. They cannot conflict with local entities that hide them.
1757 elsif Is_Child_Unit (E)
1758 and then In_Open_Scopes (Scope (E))
1759 and then not Is_Immediately_Visible (E)
1763 -- Conversely, with front-end inlining we may compile the parent
1764 -- body first, and a child unit subsequently. The context is now
1765 -- the parent spec, and body entities are not visible.
1767 elsif Is_Child_Unit (Def_Id)
1768 and then Is_Package_Body_Entity (E)
1769 and then not In_Package_Body (Current_Scope)
1773 -- Case of genuine duplicate declaration
1776 Error_Msg_Sloc := Sloc (E);
1778 -- If the previous declaration is an incomplete type declaration
1779 -- this may be an attempt to complete it with a private type.
1780 -- The following avoids confusing cascaded errors.
1782 if Nkind (Parent (E)) = N_Incomplete_Type_Declaration
1783 and then Nkind (Parent (Def_Id)) = N_Private_Type_Declaration
1786 ("incomplete type cannot be completed" &
1787 " with a private declaration",
1789 Set_Is_Immediately_Visible (E, False);
1790 Set_Full_View (E, Def_Id);
1792 elsif Ekind (E) = E_Discriminant
1793 and then Present (Scope (Def_Id))
1794 and then Scope (Def_Id) /= Current_Scope
1796 -- An inherited component of a record conflicts with
1797 -- a new discriminant. The discriminant is inserted first
1798 -- in the scope, but the error should be posted on it, not
1799 -- on the component.
1801 Error_Msg_Sloc := Sloc (Def_Id);
1802 Error_Msg_N ("& conflicts with declaration#", E);
1805 -- If the name of the unit appears in its own context clause,
1806 -- a dummy package with the name has already been created, and
1807 -- the error emitted. Try to continue quietly.
1809 elsif Error_Posted (E)
1810 and then Sloc (E) = No_Location
1811 and then Nkind (Parent (E)) = N_Package_Specification
1812 and then Current_Scope = Standard_Standard
1814 Set_Scope (Def_Id, Current_Scope);
1818 Error_Msg_N ("& conflicts with declaration#", Def_Id);
1820 -- Avoid cascaded messages with duplicate components in
1823 if Ekind (E) = E_Component
1824 or else Ekind (E) = E_Discriminant
1830 if Nkind (Parent (Parent (Def_Id)))
1831 = N_Generic_Subprogram_Declaration
1833 Defining_Entity (Specification (Parent (Parent (Def_Id))))
1835 Error_Msg_N ("\generic units cannot be overloaded", Def_Id);
1838 -- If entity is in standard, then we are in trouble, because
1839 -- it means that we have a library package with a duplicated
1840 -- name. That's hard to recover from, so abort!
1842 if S = Standard_Standard then
1843 raise Unrecoverable_Error;
1845 -- Otherwise we continue with the declaration. Having two
1846 -- identical declarations should not cause us too much trouble!
1854 -- If we fall through, declaration is OK , or OK enough to continue
1856 -- If Def_Id is a discriminant or a record component we are in the
1857 -- midst of inheriting components in a derived record definition.
1858 -- Preserve their Ekind and Etype.
1860 if Ekind (Def_Id) = E_Discriminant
1861 or else Ekind (Def_Id) = E_Component
1865 -- If a type is already set, leave it alone (happens whey a type
1866 -- declaration is reanalyzed following a call to the optimizer)
1868 elsif Present (Etype (Def_Id)) then
1871 -- Otherwise, the kind E_Void insures that premature uses of the entity
1872 -- will be detected. Any_Type insures that no cascaded errors will occur
1875 Set_Ekind (Def_Id, E_Void);
1876 Set_Etype (Def_Id, Any_Type);
1879 -- Inherited discriminants and components in derived record types are
1880 -- immediately visible. Itypes are not.
1882 if Ekind (Def_Id) = E_Discriminant
1883 or else Ekind (Def_Id) = E_Component
1884 or else (No (Corresponding_Remote_Type (Def_Id))
1885 and then not Is_Itype (Def_Id))
1887 Set_Is_Immediately_Visible (Def_Id);
1888 Set_Current_Entity (Def_Id);
1891 Set_Homonym (Def_Id, C);
1892 Append_Entity (Def_Id, S);
1893 Set_Public_Status (Def_Id);
1895 -- Warn if new entity hides an old one
1898 and then Present (C)
1899 and then Length_Of_Name (Chars (C)) /= 1
1900 and then Comes_From_Source (C)
1901 and then Comes_From_Source (Def_Id)
1902 and then In_Extended_Main_Source_Unit (Def_Id)
1904 Error_Msg_Sloc := Sloc (C);
1905 Error_Msg_N ("declaration hides &#?", Def_Id);
1909 --------------------------
1910 -- Explain_Limited_Type --
1911 --------------------------
1913 procedure Explain_Limited_Type (T : Entity_Id; N : Node_Id) is
1917 -- For array, component type must be limited
1919 if Is_Array_Type (T) then
1920 Error_Msg_Node_2 := T;
1922 ("component type& of type& is limited", N, Component_Type (T));
1923 Explain_Limited_Type (Component_Type (T), N);
1925 elsif Is_Record_Type (T) then
1927 -- No need for extra messages if explicit limited record
1929 if Is_Limited_Record (Base_Type (T)) then
1933 -- Otherwise find a limited component. Check only components that
1934 -- come from source, or inherited components that appear in the
1935 -- source of the ancestor.
1937 C := First_Component (T);
1938 while Present (C) loop
1939 if Is_Limited_Type (Etype (C))
1941 (Comes_From_Source (C)
1943 (Present (Original_Record_Component (C))
1945 Comes_From_Source (Original_Record_Component (C))))
1947 Error_Msg_Node_2 := T;
1948 Error_Msg_NE ("\component& of type& has limited type", N, C);
1949 Explain_Limited_Type (Etype (C), N);
1956 -- The type may be declared explicitly limited, even if no component
1957 -- of it is limited, in which case we fall out of the loop.
1960 end Explain_Limited_Type;
1962 -------------------------------------
1963 -- Find_Corresponding_Discriminant --
1964 -------------------------------------
1966 function Find_Corresponding_Discriminant
1968 Typ : Entity_Id) return Entity_Id
1970 Par_Disc : Entity_Id;
1971 Old_Disc : Entity_Id;
1972 New_Disc : Entity_Id;
1975 Par_Disc := Original_Record_Component (Original_Discriminant (Id));
1977 -- The original type may currently be private, and the discriminant
1978 -- only appear on its full view.
1980 if Is_Private_Type (Scope (Par_Disc))
1981 and then not Has_Discriminants (Scope (Par_Disc))
1982 and then Present (Full_View (Scope (Par_Disc)))
1984 Old_Disc := First_Discriminant (Full_View (Scope (Par_Disc)));
1986 Old_Disc := First_Discriminant (Scope (Par_Disc));
1989 if Is_Class_Wide_Type (Typ) then
1990 New_Disc := First_Discriminant (Root_Type (Typ));
1992 New_Disc := First_Discriminant (Typ);
1995 while Present (Old_Disc) and then Present (New_Disc) loop
1996 if Old_Disc = Par_Disc then
1999 Next_Discriminant (Old_Disc);
2000 Next_Discriminant (New_Disc);
2004 -- Should always find it
2006 raise Program_Error;
2007 end Find_Corresponding_Discriminant;
2009 -----------------------------
2010 -- Find_Static_Alternative --
2011 -----------------------------
2013 function Find_Static_Alternative (N : Node_Id) return Node_Id is
2014 Expr : constant Node_Id := Expression (N);
2015 Val : constant Uint := Expr_Value (Expr);
2020 Alt := First (Alternatives (N));
2023 if Nkind (Alt) /= N_Pragma then
2024 Choice := First (Discrete_Choices (Alt));
2026 while Present (Choice) loop
2028 -- Others choice, always matches
2030 if Nkind (Choice) = N_Others_Choice then
2033 -- Range, check if value is in the range
2035 elsif Nkind (Choice) = N_Range then
2037 Val >= Expr_Value (Low_Bound (Choice))
2039 Val <= Expr_Value (High_Bound (Choice));
2041 -- Choice is a subtype name. Note that we know it must
2042 -- be a static subtype, since otherwise it would have
2043 -- been diagnosed as illegal.
2045 elsif Is_Entity_Name (Choice)
2046 and then Is_Type (Entity (Choice))
2048 exit Search when Is_In_Range (Expr, Etype (Choice));
2050 -- Choice is a subtype indication
2052 elsif Nkind (Choice) = N_Subtype_Indication then
2054 C : constant Node_Id := Constraint (Choice);
2055 R : constant Node_Id := Range_Expression (C);
2059 Val >= Expr_Value (Low_Bound (R))
2061 Val <= Expr_Value (High_Bound (R));
2064 -- Choice is a simple expression
2067 exit Search when Val = Expr_Value (Choice);
2075 pragma Assert (Present (Alt));
2078 -- The above loop *must* terminate by finding a match, since
2079 -- we know the case statement is valid, and the value of the
2080 -- expression is known at compile time. When we fall out of
2081 -- the loop, Alt points to the alternative that we know will
2082 -- be selected at run time.
2085 end Find_Static_Alternative;
2091 function First_Actual (Node : Node_Id) return Node_Id is
2095 if No (Parameter_Associations (Node)) then
2099 N := First (Parameter_Associations (Node));
2101 if Nkind (N) = N_Parameter_Association then
2102 return First_Named_Actual (Node);
2108 -------------------------
2109 -- Full_Qualified_Name --
2110 -------------------------
2112 function Full_Qualified_Name (E : Entity_Id) return String_Id is
2114 pragma Warnings (Off, Res);
2116 function Internal_Full_Qualified_Name (E : Entity_Id) return String_Id;
2117 -- Compute recursively the qualified name without NUL at the end
2119 ----------------------------------
2120 -- Internal_Full_Qualified_Name --
2121 ----------------------------------
2123 function Internal_Full_Qualified_Name (E : Entity_Id) return String_Id is
2124 Ent : Entity_Id := E;
2125 Parent_Name : String_Id := No_String;
2128 -- Deals properly with child units
2130 if Nkind (Ent) = N_Defining_Program_Unit_Name then
2131 Ent := Defining_Identifier (Ent);
2134 -- Compute recursively the qualification. Only "Standard" has no
2137 if Present (Scope (Scope (Ent))) then
2138 Parent_Name := Internal_Full_Qualified_Name (Scope (Ent));
2141 -- Every entity should have a name except some expanded blocks
2142 -- don't bother about those.
2144 if Chars (Ent) = No_Name then
2148 -- Add a period between Name and qualification
2150 if Parent_Name /= No_String then
2151 Start_String (Parent_Name);
2152 Store_String_Char (Get_Char_Code ('.'));
2158 -- Generates the entity name in upper case
2160 Get_Name_String (Chars (Ent));
2162 Store_String_Chars (Name_Buffer (1 .. Name_Len));
2164 end Internal_Full_Qualified_Name;
2166 -- Start of processing for Full_Qualified_Name
2169 Res := Internal_Full_Qualified_Name (E);
2170 Store_String_Char (Get_Char_Code (ASCII.nul));
2172 end Full_Qualified_Name;
2174 -----------------------
2175 -- Gather_Components --
2176 -----------------------
2178 procedure Gather_Components
2180 Comp_List : Node_Id;
2181 Governed_By : List_Id;
2183 Report_Errors : out Boolean)
2187 Discrete_Choice : Node_Id;
2188 Comp_Item : Node_Id;
2190 Discrim : Entity_Id;
2191 Discrim_Name : Node_Id;
2192 Discrim_Value : Node_Id;
2195 Report_Errors := False;
2197 if No (Comp_List) or else Null_Present (Comp_List) then
2200 elsif Present (Component_Items (Comp_List)) then
2201 Comp_Item := First (Component_Items (Comp_List));
2207 while Present (Comp_Item) loop
2209 -- Skip the tag of a tagged record, the interface tags, as well
2210 -- as all items that are not user components (anonymous types,
2211 -- rep clauses, Parent field, controller field).
2213 if Nkind (Comp_Item) = N_Component_Declaration then
2215 Comp : constant Entity_Id := Defining_Identifier (Comp_Item);
2217 if not Is_Tag (Comp)
2218 and then Chars (Comp) /= Name_uParent
2219 and then Chars (Comp) /= Name_uController
2221 Append_Elmt (Comp, Into);
2229 if No (Variant_Part (Comp_List)) then
2232 Discrim_Name := Name (Variant_Part (Comp_List));
2233 Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
2236 -- Look for the discriminant that governs this variant part.
2237 -- The discriminant *must* be in the Governed_By List
2239 Assoc := First (Governed_By);
2240 Find_Constraint : loop
2241 Discrim := First (Choices (Assoc));
2242 exit Find_Constraint when Chars (Discrim_Name) = Chars (Discrim)
2243 or else (Present (Corresponding_Discriminant (Entity (Discrim)))
2245 Chars (Corresponding_Discriminant (Entity (Discrim)))
2246 = Chars (Discrim_Name))
2247 or else Chars (Original_Record_Component (Entity (Discrim)))
2248 = Chars (Discrim_Name);
2250 if No (Next (Assoc)) then
2251 if not Is_Constrained (Typ)
2252 and then Is_Derived_Type (Typ)
2253 and then Present (Stored_Constraint (Typ))
2256 -- If the type is a tagged type with inherited discriminants,
2257 -- use the stored constraint on the parent in order to find
2258 -- the values of discriminants that are otherwise hidden by an
2259 -- explicit constraint. Renamed discriminants are handled in
2262 -- If several parent discriminants are renamed by a single
2263 -- discriminant of the derived type, the call to obtain the
2264 -- Corresponding_Discriminant field only retrieves the last
2265 -- of them. We recover the constraint on the others from the
2266 -- Stored_Constraint as well.
2273 D := First_Discriminant (Etype (Typ));
2274 C := First_Elmt (Stored_Constraint (Typ));
2277 and then Present (C)
2279 if Chars (Discrim_Name) = Chars (D) then
2280 if Is_Entity_Name (Node (C))
2281 and then Entity (Node (C)) = Entity (Discrim)
2283 -- D is renamed by Discrim, whose value is
2290 Make_Component_Association (Sloc (Typ),
2292 (New_Occurrence_Of (D, Sloc (Typ))),
2293 Duplicate_Subexpr_No_Checks (Node (C)));
2295 exit Find_Constraint;
2298 D := Next_Discriminant (D);
2305 if No (Next (Assoc)) then
2306 Error_Msg_NE (" missing value for discriminant&",
2307 First (Governed_By), Discrim_Name);
2308 Report_Errors := True;
2313 end loop Find_Constraint;
2315 Discrim_Value := Expression (Assoc);
2317 if not Is_OK_Static_Expression (Discrim_Value) then
2319 ("value for discriminant & must be static!",
2320 Discrim_Value, Discrim);
2321 Why_Not_Static (Discrim_Value);
2322 Report_Errors := True;
2326 Search_For_Discriminant_Value : declare
2332 UI_Discrim_Value : constant Uint := Expr_Value (Discrim_Value);
2335 Find_Discrete_Value : while Present (Variant) loop
2336 Discrete_Choice := First (Discrete_Choices (Variant));
2337 while Present (Discrete_Choice) loop
2339 exit Find_Discrete_Value when
2340 Nkind (Discrete_Choice) = N_Others_Choice;
2342 Get_Index_Bounds (Discrete_Choice, Low, High);
2344 UI_Low := Expr_Value (Low);
2345 UI_High := Expr_Value (High);
2347 exit Find_Discrete_Value when
2348 UI_Low <= UI_Discrim_Value
2350 UI_High >= UI_Discrim_Value;
2352 Next (Discrete_Choice);
2355 Next_Non_Pragma (Variant);
2356 end loop Find_Discrete_Value;
2357 end Search_For_Discriminant_Value;
2359 if No (Variant) then
2361 ("value of discriminant & is out of range", Discrim_Value, Discrim);
2362 Report_Errors := True;
2366 -- If we have found the corresponding choice, recursively add its
2367 -- components to the Into list.
2369 Gather_Components (Empty,
2370 Component_List (Variant), Governed_By, Into, Report_Errors);
2371 end Gather_Components;
2373 ------------------------
2374 -- Get_Actual_Subtype --
2375 ------------------------
2377 function Get_Actual_Subtype (N : Node_Id) return Entity_Id is
2378 Typ : constant Entity_Id := Etype (N);
2379 Utyp : Entity_Id := Underlying_Type (Typ);
2384 if not Present (Utyp) then
2388 -- If what we have is an identifier that references a subprogram
2389 -- formal, or a variable or constant object, then we get the actual
2390 -- subtype from the referenced entity if one has been built.
2392 if Nkind (N) = N_Identifier
2394 (Is_Formal (Entity (N))
2395 or else Ekind (Entity (N)) = E_Constant
2396 or else Ekind (Entity (N)) = E_Variable)
2397 and then Present (Actual_Subtype (Entity (N)))
2399 return Actual_Subtype (Entity (N));
2401 -- Actual subtype of unchecked union is always itself. We never need
2402 -- the "real" actual subtype. If we did, we couldn't get it anyway
2403 -- because the discriminant is not available. The restrictions on
2404 -- Unchecked_Union are designed to make sure that this is OK.
2406 elsif Is_Unchecked_Union (Base_Type (Utyp)) then
2409 -- Here for the unconstrained case, we must find actual subtype
2410 -- No actual subtype is available, so we must build it on the fly.
2412 -- Checking the type, not the underlying type, for constrainedness
2413 -- seems to be necessary. Maybe all the tests should be on the type???
2415 elsif (not Is_Constrained (Typ))
2416 and then (Is_Array_Type (Utyp)
2417 or else (Is_Record_Type (Utyp)
2418 and then Has_Discriminants (Utyp)))
2419 and then not Has_Unknown_Discriminants (Utyp)
2420 and then not (Ekind (Utyp) = E_String_Literal_Subtype)
2422 -- Nothing to do if in default expression
2424 if In_Default_Expression then
2427 elsif Is_Private_Type (Typ)
2428 and then not Has_Discriminants (Typ)
2430 -- If the type has no discriminants, there is no subtype to
2431 -- build, even if the underlying type is discriminated.
2435 -- Else build the actual subtype
2438 Decl := Build_Actual_Subtype (Typ, N);
2439 Atyp := Defining_Identifier (Decl);
2441 -- If Build_Actual_Subtype generated a new declaration then use it
2445 -- The actual subtype is an Itype, so analyze the declaration,
2446 -- but do not attach it to the tree, to get the type defined.
2448 Set_Parent (Decl, N);
2449 Set_Is_Itype (Atyp);
2450 Analyze (Decl, Suppress => All_Checks);
2451 Set_Associated_Node_For_Itype (Atyp, N);
2452 Set_Has_Delayed_Freeze (Atyp, False);
2454 -- We need to freeze the actual subtype immediately. This is
2455 -- needed, because otherwise this Itype will not get frozen
2456 -- at all, and it is always safe to freeze on creation because
2457 -- any associated types must be frozen at this point.
2459 Freeze_Itype (Atyp, N);
2462 -- Otherwise we did not build a declaration, so return original
2469 -- For all remaining cases, the actual subtype is the same as
2470 -- the nominal type.
2475 end Get_Actual_Subtype;
2477 -------------------------------------
2478 -- Get_Actual_Subtype_If_Available --
2479 -------------------------------------
2481 function Get_Actual_Subtype_If_Available (N : Node_Id) return Entity_Id is
2482 Typ : constant Entity_Id := Etype (N);
2485 -- If what we have is an identifier that references a subprogram
2486 -- formal, or a variable or constant object, then we get the actual
2487 -- subtype from the referenced entity if one has been built.
2489 if Nkind (N) = N_Identifier
2491 (Is_Formal (Entity (N))
2492 or else Ekind (Entity (N)) = E_Constant
2493 or else Ekind (Entity (N)) = E_Variable)
2494 and then Present (Actual_Subtype (Entity (N)))
2496 return Actual_Subtype (Entity (N));
2498 -- Otherwise the Etype of N is returned unchanged
2503 end Get_Actual_Subtype_If_Available;
2505 -------------------------------
2506 -- Get_Default_External_Name --
2507 -------------------------------
2509 function Get_Default_External_Name (E : Node_Or_Entity_Id) return Node_Id is
2511 Get_Decoded_Name_String (Chars (E));
2513 if Opt.External_Name_Imp_Casing = Uppercase then
2514 Set_Casing (All_Upper_Case);
2516 Set_Casing (All_Lower_Case);
2520 Make_String_Literal (Sloc (E),
2521 Strval => String_From_Name_Buffer);
2522 end Get_Default_External_Name;
2524 ---------------------------
2525 -- Get_Enum_Lit_From_Pos --
2526 ---------------------------
2528 function Get_Enum_Lit_From_Pos
2531 Loc : Source_Ptr) return Node_Id
2536 -- In the case where the literal is of type Character, Wide_Character
2537 -- or Wide_Wide_Character or of a type derived from them, there needs
2538 -- to be some special handling since there is no explicit chain of
2539 -- literals to search. Instead, an N_Character_Literal node is created
2540 -- with the appropriate Char_Code and Chars fields.
2542 if Root_Type (T) = Standard_Character
2543 or else Root_Type (T) = Standard_Wide_Character
2544 or else Root_Type (T) = Standard_Wide_Wide_Character
2546 Set_Character_Literal_Name (UI_To_CC (Pos));
2548 Make_Character_Literal (Loc,
2550 Char_Literal_Value => Pos);
2552 -- For all other cases, we have a complete table of literals, and
2553 -- we simply iterate through the chain of literal until the one
2554 -- with the desired position value is found.
2558 Lit := First_Literal (Base_Type (T));
2559 for J in 1 .. UI_To_Int (Pos) loop
2563 return New_Occurrence_Of (Lit, Loc);
2565 end Get_Enum_Lit_From_Pos;
2567 ------------------------
2568 -- Get_Generic_Entity --
2569 ------------------------
2571 function Get_Generic_Entity (N : Node_Id) return Entity_Id is
2572 Ent : constant Entity_Id := Entity (Name (N));
2574 if Present (Renamed_Object (Ent)) then
2575 return Renamed_Object (Ent);
2579 end Get_Generic_Entity;
2581 ----------------------
2582 -- Get_Index_Bounds --
2583 ----------------------
2585 procedure Get_Index_Bounds (N : Node_Id; L, H : out Node_Id) is
2586 Kind : constant Node_Kind := Nkind (N);
2590 if Kind = N_Range then
2592 H := High_Bound (N);
2594 elsif Kind = N_Subtype_Indication then
2595 R := Range_Expression (Constraint (N));
2603 L := Low_Bound (Range_Expression (Constraint (N)));
2604 H := High_Bound (Range_Expression (Constraint (N)));
2607 elsif Is_Entity_Name (N) and then Is_Type (Entity (N)) then
2608 if Error_Posted (Scalar_Range (Entity (N))) then
2612 elsif Nkind (Scalar_Range (Entity (N))) = N_Subtype_Indication then
2613 Get_Index_Bounds (Scalar_Range (Entity (N)), L, H);
2616 L := Low_Bound (Scalar_Range (Entity (N)));
2617 H := High_Bound (Scalar_Range (Entity (N)));
2621 -- N is an expression, indicating a range with one value
2626 end Get_Index_Bounds;
2628 ----------------------------------
2629 -- Get_Library_Unit_Name_string --
2630 ----------------------------------
2632 procedure Get_Library_Unit_Name_String (Decl_Node : Node_Id) is
2633 Unit_Name_Id : constant Unit_Name_Type := Get_Unit_Name (Decl_Node);
2636 Get_Unit_Name_String (Unit_Name_Id);
2638 -- Remove seven last character (" (spec)" or " (body)")
2640 Name_Len := Name_Len - 7;
2641 pragma Assert (Name_Buffer (Name_Len + 1) = ' ');
2642 end Get_Library_Unit_Name_String;
2644 ------------------------
2645 -- Get_Name_Entity_Id --
2646 ------------------------
2648 function Get_Name_Entity_Id (Id : Name_Id) return Entity_Id is
2650 return Entity_Id (Get_Name_Table_Info (Id));
2651 end Get_Name_Entity_Id;
2653 ---------------------------
2654 -- Get_Referenced_Object --
2655 ---------------------------
2657 function Get_Referenced_Object (N : Node_Id) return Node_Id is
2661 while Is_Entity_Name (R)
2662 and then Present (Renamed_Object (Entity (R)))
2664 R := Renamed_Object (Entity (R));
2668 end Get_Referenced_Object;
2670 -------------------------
2671 -- Get_Subprogram_Body --
2672 -------------------------
2674 function Get_Subprogram_Body (E : Entity_Id) return Node_Id is
2678 Decl := Unit_Declaration_Node (E);
2680 if Nkind (Decl) = N_Subprogram_Body then
2683 -- The below comment is bad, because it is possible for
2684 -- Nkind (Decl) to be an N_Subprogram_Body_Stub ???
2686 else -- Nkind (Decl) = N_Subprogram_Declaration
2688 if Present (Corresponding_Body (Decl)) then
2689 return Unit_Declaration_Node (Corresponding_Body (Decl));
2691 -- Imported subprogram case
2697 end Get_Subprogram_Body;
2699 -----------------------------
2700 -- Get_Task_Body_Procedure --
2701 -----------------------------
2703 function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
2705 -- Note: A task type may be the completion of a private type with
2706 -- discriminants. when performing elaboration checks on a task
2707 -- declaration, the current view of the type may be the private one,
2708 -- and the procedure that holds the body of the task is held in its
2711 return Task_Body_Procedure (Underlying_Type (Root_Type (E)));
2712 end Get_Task_Body_Procedure;
2714 -----------------------
2715 -- Has_Access_Values --
2716 -----------------------
2718 function Has_Access_Values (T : Entity_Id) return Boolean is
2719 Typ : constant Entity_Id := Underlying_Type (T);
2722 -- Case of a private type which is not completed yet. This can only
2723 -- happen in the case of a generic format type appearing directly, or
2724 -- as a component of the type to which this function is being applied
2725 -- at the top level. Return False in this case, since we certainly do
2726 -- not know that the type contains access types.
2731 elsif Is_Access_Type (Typ) then
2734 elsif Is_Array_Type (Typ) then
2735 return Has_Access_Values (Component_Type (Typ));
2737 elsif Is_Record_Type (Typ) then
2742 Comp := First_Entity (Typ);
2743 while Present (Comp) loop
2744 if (Ekind (Comp) = E_Component
2746 Ekind (Comp) = E_Discriminant)
2747 and then Has_Access_Values (Etype (Comp))
2761 end Has_Access_Values;
2763 ----------------------
2764 -- Has_Declarations --
2765 ----------------------
2767 function Has_Declarations (N : Node_Id) return Boolean is
2768 K : constant Node_Kind := Nkind (N);
2770 return K = N_Accept_Statement
2771 or else K = N_Block_Statement
2772 or else K = N_Compilation_Unit_Aux
2773 or else K = N_Entry_Body
2774 or else K = N_Package_Body
2775 or else K = N_Protected_Body
2776 or else K = N_Subprogram_Body
2777 or else K = N_Task_Body
2778 or else K = N_Package_Specification;
2779 end Has_Declarations;
2781 -------------------------------------------
2782 -- Has_Discriminant_Dependent_Constraint --
2783 -------------------------------------------
2785 function Has_Discriminant_Dependent_Constraint
2786 (Comp : Entity_Id) return Boolean
2788 Comp_Decl : constant Node_Id := Parent (Comp);
2789 Subt_Indic : constant Node_Id :=
2790 Subtype_Indication (Component_Definition (Comp_Decl));
2795 if Nkind (Subt_Indic) = N_Subtype_Indication then
2796 Constr := Constraint (Subt_Indic);
2798 if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
2799 Assn := First (Constraints (Constr));
2800 while Present (Assn) loop
2801 case Nkind (Assn) is
2802 when N_Subtype_Indication |
2806 if Depends_On_Discriminant (Assn) then
2810 when N_Discriminant_Association =>
2811 if Depends_On_Discriminant (Expression (Assn)) then
2826 end Has_Discriminant_Dependent_Constraint;
2828 --------------------
2829 -- Has_Infinities --
2830 --------------------
2832 function Has_Infinities (E : Entity_Id) return Boolean is
2835 Is_Floating_Point_Type (E)
2836 and then Nkind (Scalar_Range (E)) = N_Range
2837 and then Includes_Infinities (Scalar_Range (E));
2840 ------------------------
2841 -- Has_Null_Extension --
2842 ------------------------
2844 function Has_Null_Extension (T : Entity_Id) return Boolean is
2845 B : constant Entity_Id := Base_Type (T);
2850 if Nkind (Parent (B)) = N_Full_Type_Declaration
2851 and then Present (Record_Extension_Part (Type_Definition (Parent (B))))
2853 Ext := Record_Extension_Part (Type_Definition (Parent (B)));
2855 if Present (Ext) then
2856 if Null_Present (Ext) then
2859 Comps := Component_List (Ext);
2861 -- The null component list is rewritten during analysis to
2862 -- include the parent component. Any other component indicates
2863 -- that the extension was not originally null.
2865 return Null_Present (Comps)
2866 or else No (Next (First (Component_Items (Comps))));
2875 end Has_Null_Extension;
2877 ---------------------------
2878 -- Has_Private_Component --
2879 ---------------------------
2881 function Has_Private_Component (Type_Id : Entity_Id) return Boolean is
2882 Btype : Entity_Id := Base_Type (Type_Id);
2883 Component : Entity_Id;
2886 if Error_Posted (Type_Id)
2887 or else Error_Posted (Btype)
2892 if Is_Class_Wide_Type (Btype) then
2893 Btype := Root_Type (Btype);
2896 if Is_Private_Type (Btype) then
2898 UT : constant Entity_Id := Underlying_Type (Btype);
2902 if No (Full_View (Btype)) then
2903 return not Is_Generic_Type (Btype)
2904 and then not Is_Generic_Type (Root_Type (Btype));
2907 return not Is_Generic_Type (Root_Type (Full_View (Btype)));
2911 return not Is_Frozen (UT) and then Has_Private_Component (UT);
2914 elsif Is_Array_Type (Btype) then
2915 return Has_Private_Component (Component_Type (Btype));
2917 elsif Is_Record_Type (Btype) then
2919 Component := First_Component (Btype);
2920 while Present (Component) loop
2922 if Has_Private_Component (Etype (Component)) then
2926 Next_Component (Component);
2931 elsif Is_Protected_Type (Btype)
2932 and then Present (Corresponding_Record_Type (Btype))
2934 return Has_Private_Component (Corresponding_Record_Type (Btype));
2939 end Has_Private_Component;
2945 function Has_Stream (T : Entity_Id) return Boolean is
2952 elsif Is_RTE (Root_Type (T), RE_Root_Stream_Type) then
2955 elsif Is_Array_Type (T) then
2956 return Has_Stream (Component_Type (T));
2958 elsif Is_Record_Type (T) then
2959 E := First_Component (T);
2960 while Present (E) loop
2961 if Has_Stream (Etype (E)) then
2970 elsif Is_Private_Type (T) then
2971 return Has_Stream (Underlying_Type (T));
2978 --------------------------
2979 -- Has_Tagged_Component --
2980 --------------------------
2982 function Has_Tagged_Component (Typ : Entity_Id) return Boolean is
2986 if Is_Private_Type (Typ)
2987 and then Present (Underlying_Type (Typ))
2989 return Has_Tagged_Component (Underlying_Type (Typ));
2991 elsif Is_Array_Type (Typ) then
2992 return Has_Tagged_Component (Component_Type (Typ));
2994 elsif Is_Tagged_Type (Typ) then
2997 elsif Is_Record_Type (Typ) then
2998 Comp := First_Component (Typ);
3000 while Present (Comp) loop
3001 if Has_Tagged_Component (Etype (Comp)) then
3005 Comp := Next_Component (Typ);
3013 end Has_Tagged_Component;
3019 function In_Instance return Boolean is
3020 S : Entity_Id := Current_Scope;
3024 and then S /= Standard_Standard
3026 if (Ekind (S) = E_Function
3027 or else Ekind (S) = E_Package
3028 or else Ekind (S) = E_Procedure)
3029 and then Is_Generic_Instance (S)
3040 ----------------------
3041 -- In_Instance_Body --
3042 ----------------------
3044 function In_Instance_Body return Boolean is
3045 S : Entity_Id := Current_Scope;
3049 and then S /= Standard_Standard
3051 if (Ekind (S) = E_Function
3052 or else Ekind (S) = E_Procedure)
3053 and then Is_Generic_Instance (S)
3057 elsif Ekind (S) = E_Package
3058 and then In_Package_Body (S)
3059 and then Is_Generic_Instance (S)
3068 end In_Instance_Body;
3070 -----------------------------
3071 -- In_Instance_Not_Visible --
3072 -----------------------------
3074 function In_Instance_Not_Visible return Boolean is
3075 S : Entity_Id := Current_Scope;
3079 and then S /= Standard_Standard
3081 if (Ekind (S) = E_Function
3082 or else Ekind (S) = E_Procedure)
3083 and then Is_Generic_Instance (S)
3087 elsif Ekind (S) = E_Package
3088 and then (In_Package_Body (S) or else In_Private_Part (S))
3089 and then Is_Generic_Instance (S)
3098 end In_Instance_Not_Visible;
3100 ------------------------------
3101 -- In_Instance_Visible_Part --
3102 ------------------------------
3104 function In_Instance_Visible_Part return Boolean is
3105 S : Entity_Id := Current_Scope;
3109 and then S /= Standard_Standard
3111 if Ekind (S) = E_Package
3112 and then Is_Generic_Instance (S)
3113 and then not In_Package_Body (S)
3114 and then not In_Private_Part (S)
3123 end In_Instance_Visible_Part;
3125 ----------------------
3126 -- In_Packiage_Body --
3127 ----------------------
3129 function In_Package_Body return Boolean is
3130 S : Entity_Id := Current_Scope;
3134 and then S /= Standard_Standard
3136 if Ekind (S) = E_Package
3137 and then In_Package_Body (S)
3146 end In_Package_Body;
3148 --------------------------------------
3149 -- In_Subprogram_Or_Concurrent_Unit --
3150 --------------------------------------
3152 function In_Subprogram_Or_Concurrent_Unit return Boolean is
3157 -- Use scope chain to check successively outer scopes
3163 if K in Subprogram_Kind
3164 or else K in Concurrent_Kind
3165 or else K in Generic_Subprogram_Kind
3169 elsif E = Standard_Standard then
3175 end In_Subprogram_Or_Concurrent_Unit;
3177 ---------------------
3178 -- In_Visible_Part --
3179 ---------------------
3181 function In_Visible_Part (Scope_Id : Entity_Id) return Boolean is
3184 Is_Package (Scope_Id)
3185 and then In_Open_Scopes (Scope_Id)
3186 and then not In_Package_Body (Scope_Id)
3187 and then not In_Private_Part (Scope_Id);
3188 end In_Visible_Part;
3190 ---------------------------------
3191 -- Insert_Explicit_Dereference --
3192 ---------------------------------
3194 procedure Insert_Explicit_Dereference (N : Node_Id) is
3195 New_Prefix : constant Node_Id := Relocate_Node (N);
3196 Ent : Entity_Id := Empty;
3203 Save_Interps (N, New_Prefix);
3205 Make_Explicit_Dereference (Sloc (N), Prefix => New_Prefix));
3207 Set_Etype (N, Designated_Type (Etype (New_Prefix)));
3209 if Is_Overloaded (New_Prefix) then
3211 -- The deference is also overloaded, and its interpretations are the
3212 -- designated types of the interpretations of the original node.
3214 Set_Etype (N, Any_Type);
3215 Get_First_Interp (New_Prefix, I, It);
3217 while Present (It.Nam) loop
3220 if Is_Access_Type (T) then
3221 Add_One_Interp (N, Designated_Type (T), Designated_Type (T));
3224 Get_Next_Interp (I, It);
3230 -- Prefix is unambiguous: mark the original prefix (which might
3231 -- Come_From_Source) as a reference, since the new (relocated) one
3232 -- won't be taken into account.
3234 if Is_Entity_Name (New_Prefix) then
3235 Ent := Entity (New_Prefix);
3237 -- For a retrieval of a subcomponent of some composite object,
3238 -- retrieve the ultimate entity if there is one.
3240 elsif Nkind (New_Prefix) = N_Selected_Component
3241 or else Nkind (New_Prefix) = N_Indexed_Component
3243 Pref := Prefix (New_Prefix);
3245 while Present (Pref)
3247 (Nkind (Pref) = N_Selected_Component
3248 or else Nkind (Pref) = N_Indexed_Component)
3250 Pref := Prefix (Pref);
3253 if Present (Pref) and then Is_Entity_Name (Pref) then
3254 Ent := Entity (Pref);
3258 if Present (Ent) then
3259 Generate_Reference (Ent, New_Prefix);
3262 end Insert_Explicit_Dereference;
3268 function Is_AAMP_Float (E : Entity_Id) return Boolean is
3270 pragma Assert (Is_Type (E));
3272 return AAMP_On_Target
3273 and then Is_Floating_Point_Type (E)
3274 and then E = Base_Type (E);
3277 -------------------------
3278 -- Is_Actual_Parameter --
3279 -------------------------
3281 function Is_Actual_Parameter (N : Node_Id) return Boolean is
3282 PK : constant Node_Kind := Nkind (Parent (N));
3286 when N_Parameter_Association =>
3287 return N = Explicit_Actual_Parameter (Parent (N));
3289 when N_Function_Call | N_Procedure_Call_Statement =>
3290 return Is_List_Member (N)
3292 List_Containing (N) = Parameter_Associations (Parent (N));
3297 end Is_Actual_Parameter;
3299 ---------------------
3300 -- Is_Aliased_View --
3301 ---------------------
3303 function Is_Aliased_View (Obj : Node_Id) return Boolean is
3307 if Is_Entity_Name (Obj) then
3315 or else (Present (Renamed_Object (E))
3316 and then Is_Aliased_View (Renamed_Object (E)))))
3318 or else ((Is_Formal (E)
3319 or else Ekind (E) = E_Generic_In_Out_Parameter
3320 or else Ekind (E) = E_Generic_In_Parameter)
3321 and then Is_Tagged_Type (Etype (E)))
3323 or else ((Ekind (E) = E_Task_Type
3324 or else Ekind (E) = E_Protected_Type)
3325 and then In_Open_Scopes (E))
3327 -- Current instance of type
3329 or else (Is_Type (E) and then E = Current_Scope)
3330 or else (Is_Incomplete_Or_Private_Type (E)
3331 and then Full_View (E) = Current_Scope);
3333 elsif Nkind (Obj) = N_Selected_Component then
3334 return Is_Aliased (Entity (Selector_Name (Obj)));
3336 elsif Nkind (Obj) = N_Indexed_Component then
3337 return Has_Aliased_Components (Etype (Prefix (Obj)))
3339 (Is_Access_Type (Etype (Prefix (Obj)))
3341 Has_Aliased_Components
3342 (Designated_Type (Etype (Prefix (Obj)))));
3344 elsif Nkind (Obj) = N_Unchecked_Type_Conversion
3345 or else Nkind (Obj) = N_Type_Conversion
3347 return Is_Tagged_Type (Etype (Obj))
3348 and then Is_Aliased_View (Expression (Obj));
3350 elsif Nkind (Obj) = N_Explicit_Dereference then
3351 return Nkind (Original_Node (Obj)) /= N_Function_Call;
3356 end Is_Aliased_View;
3358 -------------------------
3359 -- Is_Ancestor_Package --
3360 -------------------------
3362 function Is_Ancestor_Package
3364 E2 : Entity_Id) return Boolean
3371 and then Par /= Standard_Standard
3381 end Is_Ancestor_Package;
3383 ----------------------
3384 -- Is_Atomic_Object --
3385 ----------------------
3387 function Is_Atomic_Object (N : Node_Id) return Boolean is
3389 function Object_Has_Atomic_Components (N : Node_Id) return Boolean;
3390 -- Determines if given object has atomic components
3392 function Is_Atomic_Prefix (N : Node_Id) return Boolean;
3393 -- If prefix is an implicit dereference, examine designated type
3395 function Is_Atomic_Prefix (N : Node_Id) return Boolean is
3397 if Is_Access_Type (Etype (N)) then
3399 Has_Atomic_Components (Designated_Type (Etype (N)));
3401 return Object_Has_Atomic_Components (N);
3403 end Is_Atomic_Prefix;
3405 function Object_Has_Atomic_Components (N : Node_Id) return Boolean is
3407 if Has_Atomic_Components (Etype (N))
3408 or else Is_Atomic (Etype (N))
3412 elsif Is_Entity_Name (N)
3413 and then (Has_Atomic_Components (Entity (N))
3414 or else Is_Atomic (Entity (N)))
3418 elsif Nkind (N) = N_Indexed_Component
3419 or else Nkind (N) = N_Selected_Component
3421 return Is_Atomic_Prefix (Prefix (N));
3426 end Object_Has_Atomic_Components;
3428 -- Start of processing for Is_Atomic_Object
3431 if Is_Atomic (Etype (N))
3432 or else (Is_Entity_Name (N) and then Is_Atomic (Entity (N)))
3436 elsif Nkind (N) = N_Indexed_Component
3437 or else Nkind (N) = N_Selected_Component
3439 return Is_Atomic_Prefix (Prefix (N));
3444 end Is_Atomic_Object;
3446 --------------------------------------
3447 -- Is_Controlling_Limited_Procedure --
3448 --------------------------------------
3450 function Is_Controlling_Limited_Procedure
3451 (Proc_Nam : Entity_Id) return Boolean
3453 Param_Typ : Entity_Id;
3456 -- Proc_Nam was found to be a primitive operation of a limited interface
3458 if Ekind (Proc_Nam) = E_Procedure then
3459 Param_Typ := Etype (Parameter_Type (First (Parameter_Specifications (
3460 Parent (Proc_Nam)))));
3462 Is_Interface (Param_Typ)
3463 and then Is_Limited_Record (Param_Typ);
3465 -- In this case where an Itype was created, the procedure call has been
3468 elsif Present (Associated_Node_For_Itype (Proc_Nam))
3469 and then Present (Original_Node (Associated_Node_For_Itype (Proc_Nam)))
3471 Param_Typ := Etype (First (Parameter_Associations (
3472 Associated_Node_For_Itype (Proc_Nam))));
3474 Is_Interface (Param_Typ)
3475 and then Is_Limited_Record (Param_Typ);
3479 end Is_Controlling_Limited_Procedure;
3481 ----------------------------------------------
3482 -- Is_Dependent_Component_Of_Mutable_Object --
3483 ----------------------------------------------
3485 function Is_Dependent_Component_Of_Mutable_Object
3486 (Object : Node_Id) return Boolean
3489 Prefix_Type : Entity_Id;
3490 P_Aliased : Boolean := False;
3493 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean;
3494 -- Returns True if and only if Comp is declared within a variant part
3496 --------------------------------
3497 -- Is_Declared_Within_Variant --
3498 --------------------------------
3500 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean is
3501 Comp_Decl : constant Node_Id := Parent (Comp);
3502 Comp_List : constant Node_Id := Parent (Comp_Decl);
3505 return Nkind (Parent (Comp_List)) = N_Variant;
3506 end Is_Declared_Within_Variant;
3508 -- Start of processing for Is_Dependent_Component_Of_Mutable_Object
3511 if Is_Variable (Object) then
3513 if Nkind (Object) = N_Selected_Component then
3514 P := Prefix (Object);
3515 Prefix_Type := Etype (P);
3517 if Is_Entity_Name (P) then
3519 if Ekind (Entity (P)) = E_Generic_In_Out_Parameter then
3520 Prefix_Type := Base_Type (Prefix_Type);
3523 if Is_Aliased (Entity (P)) then
3527 -- A discriminant check on a selected component may be
3528 -- expanded into a dereference when removing side-effects.
3529 -- Recover the original node and its type, which may be
3532 elsif Nkind (P) = N_Explicit_Dereference
3533 and then not (Comes_From_Source (P))
3535 P := Original_Node (P);
3536 Prefix_Type := Etype (P);
3539 -- Check for prefix being an aliased component ???
3544 -- A heap object is constrained by its initial value
3546 -- Ada 2005 AI-363:if the designated type is a type with a
3547 -- constrained partial view, the resulting heap object is not
3548 -- constrained, and a renaming of the component is now unsafe.
3550 if Is_Access_Type (Prefix_Type)
3552 not Has_Constrained_Partial_View
3553 (Designated_Type (Prefix_Type))
3557 elsif Nkind (P) = N_Explicit_Dereference
3558 and then not Has_Constrained_Partial_View (Prefix_Type)
3564 Original_Record_Component (Entity (Selector_Name (Object)));
3566 -- As per AI-0017, the renaming is illegal in a generic body,
3567 -- even if the subtype is indefinite.
3569 if not Is_Constrained (Prefix_Type)
3570 and then (not Is_Indefinite_Subtype (Prefix_Type)
3572 (Is_Generic_Type (Prefix_Type)
3573 and then Ekind (Current_Scope) = E_Generic_Package
3574 and then In_Package_Body (Current_Scope)))
3576 and then (Is_Declared_Within_Variant (Comp)
3577 or else Has_Discriminant_Dependent_Constraint (Comp))
3578 and then not P_Aliased
3584 Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
3588 elsif Nkind (Object) = N_Indexed_Component
3589 or else Nkind (Object) = N_Slice
3591 return Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
3593 -- A type conversion that Is_Variable is a view conversion:
3594 -- go back to the denoted object.
3596 elsif Nkind (Object) = N_Type_Conversion then
3598 Is_Dependent_Component_Of_Mutable_Object (Expression (Object));
3603 end Is_Dependent_Component_Of_Mutable_Object;
3605 ---------------------
3606 -- Is_Dereferenced --
3607 ---------------------
3609 function Is_Dereferenced (N : Node_Id) return Boolean is
3610 P : constant Node_Id := Parent (N);
3613 (Nkind (P) = N_Selected_Component
3615 Nkind (P) = N_Explicit_Dereference
3617 Nkind (P) = N_Indexed_Component
3619 Nkind (P) = N_Slice)
3620 and then Prefix (P) = N;
3621 end Is_Dereferenced;
3623 ----------------------
3624 -- Is_Descendent_Of --
3625 ----------------------
3627 function Is_Descendent_Of (T1 : Entity_Id; T2 : Entity_Id) return Boolean is
3632 pragma Assert (Nkind (T1) in N_Entity);
3633 pragma Assert (Nkind (T2) in N_Entity);
3635 T := Base_Type (T1);
3637 -- Immediate return if the types match
3642 -- Comment needed here ???
3644 elsif Ekind (T) = E_Class_Wide_Type then
3645 return Etype (T) = T2;
3653 -- Done if we found the type we are looking for
3658 -- Done if no more derivations to check
3665 -- Following test catches error cases resulting from prev errors
3667 elsif No (Etyp) then
3670 elsif Is_Private_Type (T) and then Etyp = Full_View (T) then
3673 elsif Is_Private_Type (Etyp) and then Full_View (Etyp) = T then
3677 T := Base_Type (Etyp);
3681 raise Program_Error;
3682 end Is_Descendent_Of;
3684 ------------------------------
3685 -- Is_Descendent_Of_Address --
3686 ------------------------------
3688 function Is_Descendent_Of_Address (T1 : Entity_Id) return Boolean is
3690 -- If Address has not been loaded, answer must be False
3692 if not RTU_Loaded (System) then
3695 -- Otherwise we can get the entity we are interested in without
3696 -- causing an unwanted dependency on System, and do the test.
3699 return Is_Descendent_Of (T1, Base_Type (RTE (RE_Address)));
3701 end Is_Descendent_Of_Address;
3707 function Is_False (U : Uint) return Boolean is
3712 ---------------------------
3713 -- Is_Fixed_Model_Number --
3714 ---------------------------
3716 function Is_Fixed_Model_Number (U : Ureal; T : Entity_Id) return Boolean is
3717 S : constant Ureal := Small_Value (T);
3718 M : Urealp.Save_Mark;
3723 R := (U = UR_Trunc (U / S) * S);
3726 end Is_Fixed_Model_Number;
3728 -------------------------------
3729 -- Is_Fully_Initialized_Type --
3730 -------------------------------
3732 function Is_Fully_Initialized_Type (Typ : Entity_Id) return Boolean is
3734 if Is_Scalar_Type (Typ) then
3737 elsif Is_Access_Type (Typ) then
3740 elsif Is_Array_Type (Typ) then
3741 if Is_Fully_Initialized_Type (Component_Type (Typ)) then
3745 -- An interesting case, if we have a constrained type one of whose
3746 -- bounds is known to be null, then there are no elements to be
3747 -- initialized, so all the elements are initialized!
3749 if Is_Constrained (Typ) then
3752 Indx_Typ : Entity_Id;
3756 Indx := First_Index (Typ);
3757 while Present (Indx) loop
3759 if Etype (Indx) = Any_Type then
3762 -- If index is a range, use directly
3764 elsif Nkind (Indx) = N_Range then
3765 Lbd := Low_Bound (Indx);
3766 Hbd := High_Bound (Indx);
3769 Indx_Typ := Etype (Indx);
3771 if Is_Private_Type (Indx_Typ) then
3772 Indx_Typ := Full_View (Indx_Typ);
3775 if No (Indx_Typ) then
3778 Lbd := Type_Low_Bound (Indx_Typ);
3779 Hbd := Type_High_Bound (Indx_Typ);
3783 if Compile_Time_Known_Value (Lbd)
3784 and then Compile_Time_Known_Value (Hbd)
3786 if Expr_Value (Hbd) < Expr_Value (Lbd) then
3796 -- If no null indexes, then type is not fully initialized
3802 elsif Is_Record_Type (Typ) then
3803 if Has_Discriminants (Typ)
3805 Present (Discriminant_Default_Value (First_Discriminant (Typ)))
3806 and then Is_Fully_Initialized_Variant (Typ)
3811 -- Controlled records are considered to be fully initialized if
3812 -- there is a user defined Initialize routine. This may not be
3813 -- entirely correct, but as the spec notes, we are guessing here
3814 -- what is best from the point of view of issuing warnings.
3816 if Is_Controlled (Typ) then
3818 Utyp : constant Entity_Id := Underlying_Type (Typ);
3821 if Present (Utyp) then
3823 Init : constant Entity_Id :=
3825 (Underlying_Type (Typ), Name_Initialize));
3829 and then Comes_From_Source (Init)
3831 Is_Predefined_File_Name
3832 (File_Name (Get_Source_File_Index (Sloc (Init))))
3836 elsif Has_Null_Extension (Typ)
3838 Is_Fully_Initialized_Type
3839 (Etype (Base_Type (Typ)))
3848 -- Otherwise see if all record components are initialized
3854 Ent := First_Entity (Typ);
3856 while Present (Ent) loop
3857 if Chars (Ent) = Name_uController then
3860 elsif Ekind (Ent) = E_Component
3861 and then (No (Parent (Ent))
3862 or else No (Expression (Parent (Ent))))
3863 and then not Is_Fully_Initialized_Type (Etype (Ent))
3872 -- No uninitialized components, so type is fully initialized.
3873 -- Note that this catches the case of no components as well.
3877 elsif Is_Concurrent_Type (Typ) then
3880 elsif Is_Private_Type (Typ) then
3882 U : constant Entity_Id := Underlying_Type (Typ);
3888 return Is_Fully_Initialized_Type (U);
3895 end Is_Fully_Initialized_Type;
3897 ----------------------------------
3898 -- Is_Fully_Initialized_Variant --
3899 ----------------------------------
3901 function Is_Fully_Initialized_Variant (Typ : Entity_Id) return Boolean is
3902 Loc : constant Source_Ptr := Sloc (Typ);
3903 Constraints : constant List_Id := New_List;
3904 Components : constant Elist_Id := New_Elmt_List;
3905 Comp_Elmt : Elmt_Id;
3907 Comp_List : Node_Id;
3909 Discr_Val : Node_Id;
3910 Report_Errors : Boolean;
3913 if Serious_Errors_Detected > 0 then
3917 if Is_Record_Type (Typ)
3918 and then Nkind (Parent (Typ)) = N_Full_Type_Declaration
3919 and then Nkind (Type_Definition (Parent (Typ))) = N_Record_Definition
3921 Comp_List := Component_List (Type_Definition (Parent (Typ)));
3922 Discr := First_Discriminant (Typ);
3924 while Present (Discr) loop
3925 if Nkind (Parent (Discr)) = N_Discriminant_Specification then
3926 Discr_Val := Expression (Parent (Discr));
3928 if Present (Discr_Val)
3929 and then Is_OK_Static_Expression (Discr_Val)
3931 Append_To (Constraints,
3932 Make_Component_Association (Loc,
3933 Choices => New_List (New_Occurrence_Of (Discr, Loc)),
3934 Expression => New_Copy (Discr_Val)));
3942 Next_Discriminant (Discr);
3947 Comp_List => Comp_List,
3948 Governed_By => Constraints,
3950 Report_Errors => Report_Errors);
3952 -- Check that each component present is fully initialized
3954 Comp_Elmt := First_Elmt (Components);
3956 while Present (Comp_Elmt) loop
3957 Comp_Id := Node (Comp_Elmt);
3959 if Ekind (Comp_Id) = E_Component
3960 and then (No (Parent (Comp_Id))
3961 or else No (Expression (Parent (Comp_Id))))
3962 and then not Is_Fully_Initialized_Type (Etype (Comp_Id))
3967 Next_Elmt (Comp_Elmt);
3972 elsif Is_Private_Type (Typ) then
3974 U : constant Entity_Id := Underlying_Type (Typ);
3980 return Is_Fully_Initialized_Variant (U);
3986 end Is_Fully_Initialized_Variant;
3988 ----------------------------
3989 -- Is_Inherited_Operation --
3990 ----------------------------
3992 function Is_Inherited_Operation (E : Entity_Id) return Boolean is
3993 Kind : constant Node_Kind := Nkind (Parent (E));
3995 pragma Assert (Is_Overloadable (E));
3996 return Kind = N_Full_Type_Declaration
3997 or else Kind = N_Private_Extension_Declaration
3998 or else Kind = N_Subtype_Declaration
3999 or else (Ekind (E) = E_Enumeration_Literal
4000 and then Is_Derived_Type (Etype (E)));
4001 end Is_Inherited_Operation;
4003 -----------------------------
4004 -- Is_Library_Level_Entity --
4005 -----------------------------
4007 function Is_Library_Level_Entity (E : Entity_Id) return Boolean is
4009 -- The following is a small optimization, and it also handles
4010 -- properly discriminals, which in task bodies might appear in
4011 -- expressions before the corresponding procedure has been
4012 -- created, and which therefore do not have an assigned scope.
4014 if Ekind (E) in Formal_Kind then
4018 -- Normal test is simply that the enclosing dynamic scope is Standard
4020 return Enclosing_Dynamic_Scope (E) = Standard_Standard;
4021 end Is_Library_Level_Entity;
4023 ---------------------------------
4024 -- Is_Local_Variable_Reference --
4025 ---------------------------------
4027 function Is_Local_Variable_Reference (Expr : Node_Id) return Boolean is
4029 if not Is_Entity_Name (Expr) then
4034 Ent : constant Entity_Id := Entity (Expr);
4035 Sub : constant Entity_Id := Enclosing_Subprogram (Ent);
4038 if Ekind (Ent) /= E_Variable
4040 Ekind (Ent) /= E_In_Out_Parameter
4045 return Present (Sub) and then Sub = Current_Subprogram;
4049 end Is_Local_Variable_Reference;
4055 function Is_Lvalue (N : Node_Id) return Boolean is
4056 P : constant Node_Id := Parent (N);
4061 -- Test left side of assignment
4063 when N_Assignment_Statement =>
4064 return N = Name (P);
4066 -- Test prefix of component or attribute
4068 when N_Attribute_Reference |
4070 N_Explicit_Dereference |
4071 N_Indexed_Component |
4073 N_Selected_Component |
4075 return N = Prefix (P);
4077 -- Test subprogram parameter (we really should check the
4078 -- parameter mode, but it is not worth the trouble)
4080 when N_Function_Call |
4081 N_Procedure_Call_Statement |
4082 N_Accept_Statement |
4083 N_Parameter_Association =>
4086 -- Test for appearing in a conversion that itself appears
4087 -- in an lvalue context, since this should be an lvalue.
4089 when N_Type_Conversion =>
4090 return Is_Lvalue (P);
4092 -- Test for appearence in object renaming declaration
4094 when N_Object_Renaming_Declaration =>
4097 -- All other references are definitely not Lvalues
4105 -------------------------
4106 -- Is_Object_Reference --
4107 -------------------------
4109 function Is_Object_Reference (N : Node_Id) return Boolean is
4111 if Is_Entity_Name (N) then
4112 return Is_Object (Entity (N));
4116 when N_Indexed_Component | N_Slice =>
4118 Is_Object_Reference (Prefix (N))
4119 or else Is_Access_Type (Etype (Prefix (N)));
4121 -- In Ada95, a function call is a constant object; a procedure
4124 when N_Function_Call =>
4125 return Etype (N) /= Standard_Void_Type;
4127 -- A reference to the stream attribute Input is a function call
4129 when N_Attribute_Reference =>
4130 return Attribute_Name (N) = Name_Input;
4132 when N_Selected_Component =>
4134 Is_Object_Reference (Selector_Name (N))
4136 (Is_Object_Reference (Prefix (N))
4137 or else Is_Access_Type (Etype (Prefix (N))));
4139 when N_Explicit_Dereference =>
4142 -- A view conversion of a tagged object is an object reference
4144 when N_Type_Conversion =>
4145 return Is_Tagged_Type (Etype (Subtype_Mark (N)))
4146 and then Is_Tagged_Type (Etype (Expression (N)))
4147 and then Is_Object_Reference (Expression (N));
4149 -- An unchecked type conversion is considered to be an object if
4150 -- the operand is an object (this construction arises only as a
4151 -- result of expansion activities).
4153 when N_Unchecked_Type_Conversion =>
4160 end Is_Object_Reference;
4162 -----------------------------------
4163 -- Is_OK_Variable_For_Out_Formal --
4164 -----------------------------------
4166 function Is_OK_Variable_For_Out_Formal (AV : Node_Id) return Boolean is
4168 Note_Possible_Modification (AV);
4170 -- We must reject parenthesized variable names. The check for
4171 -- Comes_From_Source is present because there are currently
4172 -- cases where the compiler violates this rule (e.g. passing
4173 -- a task object to its controlled Initialize routine).
4175 if Paren_Count (AV) > 0 and then Comes_From_Source (AV) then
4178 -- A variable is always allowed
4180 elsif Is_Variable (AV) then
4183 -- Unchecked conversions are allowed only if they come from the
4184 -- generated code, which sometimes uses unchecked conversions for
4185 -- out parameters in cases where code generation is unaffected.
4186 -- We tell source unchecked conversions by seeing if they are
4187 -- rewrites of an original UC function call, or of an explicit
4188 -- conversion of a function call.
4190 elsif Nkind (AV) = N_Unchecked_Type_Conversion then
4191 if Nkind (Original_Node (AV)) = N_Function_Call then
4194 elsif Comes_From_Source (AV)
4195 and then Nkind (Original_Node (Expression (AV))) = N_Function_Call
4199 elsif Nkind (Original_Node (AV)) = N_Type_Conversion then
4200 return Is_OK_Variable_For_Out_Formal (Expression (AV));
4206 -- Normal type conversions are allowed if argument is a variable
4208 elsif Nkind (AV) = N_Type_Conversion then
4209 if Is_Variable (Expression (AV))
4210 and then Paren_Count (Expression (AV)) = 0
4212 Note_Possible_Modification (Expression (AV));
4215 -- We also allow a non-parenthesized expression that raises
4216 -- constraint error if it rewrites what used to be a variable
4218 elsif Raises_Constraint_Error (Expression (AV))
4219 and then Paren_Count (Expression (AV)) = 0
4220 and then Is_Variable (Original_Node (Expression (AV)))
4224 -- Type conversion of something other than a variable
4230 -- If this node is rewritten, then test the original form, if that is
4231 -- OK, then we consider the rewritten node OK (for example, if the
4232 -- original node is a conversion, then Is_Variable will not be true
4233 -- but we still want to allow the conversion if it converts a variable).
4235 elsif Original_Node (AV) /= AV then
4236 return Is_OK_Variable_For_Out_Formal (Original_Node (AV));
4238 -- All other non-variables are rejected
4243 end Is_OK_Variable_For_Out_Formal;
4245 -----------------------------------
4246 -- Is_Partially_Initialized_Type --
4247 -----------------------------------
4249 function Is_Partially_Initialized_Type (Typ : Entity_Id) return Boolean is
4251 if Is_Scalar_Type (Typ) then
4254 elsif Is_Access_Type (Typ) then
4257 elsif Is_Array_Type (Typ) then
4259 -- If component type is partially initialized, so is array type
4261 if Is_Partially_Initialized_Type (Component_Type (Typ)) then
4264 -- Otherwise we are only partially initialized if we are fully
4265 -- initialized (this is the empty array case, no point in us
4266 -- duplicating that code here).
4269 return Is_Fully_Initialized_Type (Typ);
4272 elsif Is_Record_Type (Typ) then
4274 -- A discriminated type is always partially initialized
4276 if Has_Discriminants (Typ) then
4279 -- A tagged type is always partially initialized
4281 elsif Is_Tagged_Type (Typ) then
4284 -- Case of non-discriminated record
4290 Component_Present : Boolean := False;
4291 -- Set True if at least one component is present. If no
4292 -- components are present, then record type is fully
4293 -- initialized (another odd case, like the null array).
4296 -- Loop through components
4298 Ent := First_Entity (Typ);
4299 while Present (Ent) loop
4300 if Ekind (Ent) = E_Component then
4301 Component_Present := True;
4303 -- If a component has an initialization expression then
4304 -- the enclosing record type is partially initialized
4306 if Present (Parent (Ent))
4307 and then Present (Expression (Parent (Ent)))
4311 -- If a component is of a type which is itself partially
4312 -- initialized, then the enclosing record type is also.
4314 elsif Is_Partially_Initialized_Type (Etype (Ent)) then
4322 -- No initialized components found. If we found any components
4323 -- they were all uninitialized so the result is false.
4325 if Component_Present then
4328 -- But if we found no components, then all the components are
4329 -- initialized so we consider the type to be initialized.
4337 -- Concurrent types are always fully initialized
4339 elsif Is_Concurrent_Type (Typ) then
4342 -- For a private type, go to underlying type. If there is no underlying
4343 -- type then just assume this partially initialized. Not clear if this
4344 -- can happen in a non-error case, but no harm in testing for this.
4346 elsif Is_Private_Type (Typ) then
4348 U : constant Entity_Id := Underlying_Type (Typ);
4354 return Is_Partially_Initialized_Type (U);
4358 -- For any other type (are there any?) assume partially initialized
4363 end Is_Partially_Initialized_Type;
4365 ------------------------------------
4366 -- Is_Potentially_Persistent_Type --
4367 ------------------------------------
4369 function Is_Potentially_Persistent_Type (T : Entity_Id) return Boolean is
4374 -- For private type, test corrresponding full type
4376 if Is_Private_Type (T) then
4377 return Is_Potentially_Persistent_Type (Full_View (T));
4379 -- Scalar types are potentially persistent
4381 elsif Is_Scalar_Type (T) then
4384 -- Record type is potentially persistent if not tagged and the types of
4385 -- all it components are potentially persistent, and no component has
4386 -- an initialization expression.
4388 elsif Is_Record_Type (T)
4389 and then not Is_Tagged_Type (T)
4390 and then not Is_Partially_Initialized_Type (T)
4392 Comp := First_Component (T);
4393 while Present (Comp) loop
4394 if not Is_Potentially_Persistent_Type (Etype (Comp)) then
4403 -- Array type is potentially persistent if its component type is
4404 -- potentially persistent and if all its constraints are static.
4406 elsif Is_Array_Type (T) then
4407 if not Is_Potentially_Persistent_Type (Component_Type (T)) then
4411 Indx := First_Index (T);
4412 while Present (Indx) loop
4413 if not Is_OK_Static_Subtype (Etype (Indx)) then
4422 -- All other types are not potentially persistent
4427 end Is_Potentially_Persistent_Type;
4429 -----------------------------
4430 -- Is_RCI_Pkg_Spec_Or_Body --
4431 -----------------------------
4433 function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
4435 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
4436 -- Return True if the unit of Cunit is an RCI package declaration
4438 ---------------------------
4439 -- Is_RCI_Pkg_Decl_Cunit --
4440 ---------------------------
4442 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean is
4443 The_Unit : constant Node_Id := Unit (Cunit);
4446 if Nkind (The_Unit) /= N_Package_Declaration then
4449 return Is_Remote_Call_Interface (Defining_Entity (The_Unit));
4450 end Is_RCI_Pkg_Decl_Cunit;
4452 -- Start of processing for Is_RCI_Pkg_Spec_Or_Body
4455 return Is_RCI_Pkg_Decl_Cunit (Cunit)
4457 (Nkind (Unit (Cunit)) = N_Package_Body
4458 and then Is_RCI_Pkg_Decl_Cunit (Library_Unit (Cunit)));
4459 end Is_RCI_Pkg_Spec_Or_Body;
4461 -----------------------------------------
4462 -- Is_Remote_Access_To_Class_Wide_Type --
4463 -----------------------------------------
4465 function Is_Remote_Access_To_Class_Wide_Type
4466 (E : Entity_Id) return Boolean
4470 function Comes_From_Limited_Private_Type_Declaration
4471 (E : Entity_Id) return Boolean;
4472 -- Check that the type is declared by a limited type declaration,
4473 -- or else is derived from a Remote_Type ancestor through private
4476 -------------------------------------------------
4477 -- Comes_From_Limited_Private_Type_Declaration --
4478 -------------------------------------------------
4480 function Comes_From_Limited_Private_Type_Declaration
4481 (E : Entity_Id) return Boolean
4483 N : constant Node_Id := Declaration_Node (E);
4486 if Nkind (N) = N_Private_Type_Declaration
4487 and then Limited_Present (N)
4492 if Nkind (N) = N_Private_Extension_Declaration then
4494 Comes_From_Limited_Private_Type_Declaration (Etype (E))
4496 (Is_Remote_Types (Etype (E))
4497 and then Is_Limited_Record (Etype (E))
4498 and then Has_Private_Declaration (Etype (E)));
4502 end Comes_From_Limited_Private_Type_Declaration;
4504 -- Start of processing for Is_Remote_Access_To_Class_Wide_Type
4507 if not (Is_Remote_Call_Interface (E)
4508 or else Is_Remote_Types (E))
4509 or else Ekind (E) /= E_General_Access_Type
4514 D := Designated_Type (E);
4516 if Ekind (D) /= E_Class_Wide_Type then
4520 return Comes_From_Limited_Private_Type_Declaration
4521 (Defining_Identifier (Parent (D)));
4522 end Is_Remote_Access_To_Class_Wide_Type;
4524 -----------------------------------------
4525 -- Is_Remote_Access_To_Subprogram_Type --
4526 -----------------------------------------
4528 function Is_Remote_Access_To_Subprogram_Type
4529 (E : Entity_Id) return Boolean
4532 return (Ekind (E) = E_Access_Subprogram_Type
4533 or else (Ekind (E) = E_Record_Type
4534 and then Present (Corresponding_Remote_Type (E))))
4535 and then (Is_Remote_Call_Interface (E)
4536 or else Is_Remote_Types (E));
4537 end Is_Remote_Access_To_Subprogram_Type;
4539 --------------------
4540 -- Is_Remote_Call --
4541 --------------------
4543 function Is_Remote_Call (N : Node_Id) return Boolean is
4545 if Nkind (N) /= N_Procedure_Call_Statement
4546 and then Nkind (N) /= N_Function_Call
4548 -- An entry call cannot be remote
4552 elsif Nkind (Name (N)) in N_Has_Entity
4553 and then Is_Remote_Call_Interface (Entity (Name (N)))
4555 -- A subprogram declared in the spec of a RCI package is remote
4559 elsif Nkind (Name (N)) = N_Explicit_Dereference
4560 and then Is_Remote_Access_To_Subprogram_Type
4561 (Etype (Prefix (Name (N))))
4563 -- The dereference of a RAS is a remote call
4567 elsif Present (Controlling_Argument (N))
4568 and then Is_Remote_Access_To_Class_Wide_Type
4569 (Etype (Controlling_Argument (N)))
4571 -- Any primitive operation call with a controlling argument of
4572 -- a RACW type is a remote call.
4577 -- All other calls are local calls
4582 ----------------------
4583 -- Is_Renamed_Entry --
4584 ----------------------
4586 function Is_Renamed_Entry (Proc_Nam : Entity_Id) return Boolean is
4587 Orig_Node : Node_Id := Empty;
4588 Subp_Decl : Node_Id := Parent (Parent (Proc_Nam));
4590 function Is_Entry (Nam : Node_Id) return Boolean;
4591 -- Determine whether Nam is an entry. Traverse selectors
4592 -- if there are nested selected components.
4598 function Is_Entry (Nam : Node_Id) return Boolean is
4600 if Nkind (Nam) = N_Selected_Component then
4601 return Is_Entry (Selector_Name (Nam));
4604 return Ekind (Entity (Nam)) = E_Entry;
4607 -- Start of processing for Is_Renamed_Entry
4610 if Present (Alias (Proc_Nam)) then
4611 Subp_Decl := Parent (Parent (Alias (Proc_Nam)));
4614 -- Look for a rewritten subprogram renaming declaration
4616 if Nkind (Subp_Decl) = N_Subprogram_Declaration
4617 and then Present (Original_Node (Subp_Decl))
4619 Orig_Node := Original_Node (Subp_Decl);
4622 -- The rewritten subprogram is actually an entry
4624 if Present (Orig_Node)
4625 and then Nkind (Orig_Node) = N_Subprogram_Renaming_Declaration
4626 and then Is_Entry (Name (Orig_Node))
4632 end Is_Renamed_Entry;
4634 ----------------------
4635 -- Is_Selector_Name --
4636 ----------------------
4638 function Is_Selector_Name (N : Node_Id) return Boolean is
4640 if not Is_List_Member (N) then
4642 P : constant Node_Id := Parent (N);
4643 K : constant Node_Kind := Nkind (P);
4646 (K = N_Expanded_Name or else
4647 K = N_Generic_Association or else
4648 K = N_Parameter_Association or else
4649 K = N_Selected_Component)
4650 and then Selector_Name (P) = N;
4655 L : constant List_Id := List_Containing (N);
4656 P : constant Node_Id := Parent (L);
4658 return (Nkind (P) = N_Discriminant_Association
4659 and then Selector_Names (P) = L)
4661 (Nkind (P) = N_Component_Association
4662 and then Choices (P) = L);
4665 end Is_Selector_Name;
4671 function Is_Statement (N : Node_Id) return Boolean is
4674 Nkind (N) in N_Statement_Other_Than_Procedure_Call
4675 or else Nkind (N) = N_Procedure_Call_Statement;
4682 function Is_Transfer (N : Node_Id) return Boolean is
4683 Kind : constant Node_Kind := Nkind (N);
4686 if Kind = N_Return_Statement
4688 Kind = N_Goto_Statement
4690 Kind = N_Raise_Statement
4692 Kind = N_Requeue_Statement
4696 elsif (Kind = N_Exit_Statement or else Kind in N_Raise_xxx_Error)
4697 and then No (Condition (N))
4701 elsif Kind = N_Procedure_Call_Statement
4702 and then Is_Entity_Name (Name (N))
4703 and then Present (Entity (Name (N)))
4704 and then No_Return (Entity (Name (N)))
4708 elsif Nkind (Original_Node (N)) = N_Raise_Statement then
4720 function Is_True (U : Uint) return Boolean is
4729 function Is_Variable (N : Node_Id) return Boolean is
4731 Orig_Node : constant Node_Id := Original_Node (N);
4732 -- We do the test on the original node, since this is basically a
4733 -- test of syntactic categories, so it must not be disturbed by
4734 -- whatever rewriting might have occurred. For example, an aggregate,
4735 -- which is certainly NOT a variable, could be turned into a variable
4738 function In_Protected_Function (E : Entity_Id) return Boolean;
4739 -- Within a protected function, the private components of the
4740 -- enclosing protected type are constants. A function nested within
4741 -- a (protected) procedure is not itself protected.
4743 function Is_Variable_Prefix (P : Node_Id) return Boolean;
4744 -- Prefixes can involve implicit dereferences, in which case we
4745 -- must test for the case of a reference of a constant access
4746 -- type, which can never be a variable.
4748 ---------------------------
4749 -- In_Protected_Function --
4750 ---------------------------
4752 function In_Protected_Function (E : Entity_Id) return Boolean is
4753 Prot : constant Entity_Id := Scope (E);
4757 if not Is_Protected_Type (Prot) then
4761 while Present (S) and then S /= Prot loop
4762 if Ekind (S) = E_Function
4763 and then Scope (S) = Prot
4773 end In_Protected_Function;
4775 ------------------------
4776 -- Is_Variable_Prefix --
4777 ------------------------
4779 function Is_Variable_Prefix (P : Node_Id) return Boolean is
4781 if Is_Access_Type (Etype (P)) then
4782 return not Is_Access_Constant (Root_Type (Etype (P)));
4784 -- For the case of an indexed component whose prefix has a packed
4785 -- array type, the prefix has been rewritten into a type conversion.
4786 -- Determine variable-ness from the converted expression.
4788 elsif Nkind (P) = N_Type_Conversion
4789 and then not Comes_From_Source (P)
4790 and then Is_Array_Type (Etype (P))
4791 and then Is_Packed (Etype (P))
4793 return Is_Variable (Expression (P));
4796 return Is_Variable (P);
4798 end Is_Variable_Prefix;
4800 -- Start of processing for Is_Variable
4803 -- Definitely OK if Assignment_OK is set. Since this is something that
4804 -- only gets set for expanded nodes, the test is on N, not Orig_Node.
4806 if Nkind (N) in N_Subexpr and then Assignment_OK (N) then
4809 -- Normally we go to the original node, but there is one exception
4810 -- where we use the rewritten node, namely when it is an explicit
4811 -- dereference. The generated code may rewrite a prefix which is an
4812 -- access type with an explicit dereference. The dereference is a
4813 -- variable, even though the original node may not be (since it could
4814 -- be a constant of the access type).
4816 elsif Nkind (N) = N_Explicit_Dereference
4817 and then Nkind (Orig_Node) /= N_Explicit_Dereference
4818 and then Is_Access_Type (Etype (Orig_Node))
4820 return Is_Variable_Prefix (Original_Node (Prefix (N)));
4822 -- A function call is never a variable
4824 elsif Nkind (N) = N_Function_Call then
4827 -- All remaining checks use the original node
4829 elsif Is_Entity_Name (Orig_Node) then
4831 E : constant Entity_Id := Entity (Orig_Node);
4832 K : constant Entity_Kind := Ekind (E);
4835 return (K = E_Variable
4836 and then Nkind (Parent (E)) /= N_Exception_Handler)
4837 or else (K = E_Component
4838 and then not In_Protected_Function (E))
4839 or else K = E_Out_Parameter
4840 or else K = E_In_Out_Parameter
4841 or else K = E_Generic_In_Out_Parameter
4843 -- Current instance of type:
4845 or else (Is_Type (E) and then In_Open_Scopes (E))
4846 or else (Is_Incomplete_Or_Private_Type (E)
4847 and then In_Open_Scopes (Full_View (E)));
4851 case Nkind (Orig_Node) is
4852 when N_Indexed_Component | N_Slice =>
4853 return Is_Variable_Prefix (Prefix (Orig_Node));
4855 when N_Selected_Component =>
4856 return Is_Variable_Prefix (Prefix (Orig_Node))
4857 and then Is_Variable (Selector_Name (Orig_Node));
4859 -- For an explicit dereference, the type of the prefix cannot
4860 -- be an access to constant or an access to subprogram.
4862 when N_Explicit_Dereference =>
4864 Typ : constant Entity_Id := Etype (Prefix (Orig_Node));
4866 return Is_Access_Type (Typ)
4867 and then not Is_Access_Constant (Root_Type (Typ))
4868 and then Ekind (Typ) /= E_Access_Subprogram_Type;
4871 -- The type conversion is the case where we do not deal with the
4872 -- context dependent special case of an actual parameter. Thus
4873 -- the type conversion is only considered a variable for the
4874 -- purposes of this routine if the target type is tagged. However,
4875 -- a type conversion is considered to be a variable if it does not
4876 -- come from source (this deals for example with the conversions
4877 -- of expressions to their actual subtypes).
4879 when N_Type_Conversion =>
4880 return Is_Variable (Expression (Orig_Node))
4882 (not Comes_From_Source (Orig_Node)
4884 (Is_Tagged_Type (Etype (Subtype_Mark (Orig_Node)))
4886 Is_Tagged_Type (Etype (Expression (Orig_Node)))));
4888 -- GNAT allows an unchecked type conversion as a variable. This
4889 -- only affects the generation of internal expanded code, since
4890 -- calls to instantiations of Unchecked_Conversion are never
4891 -- considered variables (since they are function calls).
4892 -- This is also true for expression actions.
4894 when N_Unchecked_Type_Conversion =>
4895 return Is_Variable (Expression (Orig_Node));
4903 ------------------------
4904 -- Is_Volatile_Object --
4905 ------------------------
4907 function Is_Volatile_Object (N : Node_Id) return Boolean is
4909 function Object_Has_Volatile_Components (N : Node_Id) return Boolean;
4910 -- Determines if given object has volatile components
4912 function Is_Volatile_Prefix (N : Node_Id) return Boolean;
4913 -- If prefix is an implicit dereference, examine designated type
4915 ------------------------
4916 -- Is_Volatile_Prefix --
4917 ------------------------
4919 function Is_Volatile_Prefix (N : Node_Id) return Boolean is
4920 Typ : constant Entity_Id := Etype (N);
4923 if Is_Access_Type (Typ) then
4925 Dtyp : constant Entity_Id := Designated_Type (Typ);
4928 return Is_Volatile (Dtyp)
4929 or else Has_Volatile_Components (Dtyp);
4933 return Object_Has_Volatile_Components (N);
4935 end Is_Volatile_Prefix;
4937 ------------------------------------
4938 -- Object_Has_Volatile_Components --
4939 ------------------------------------
4941 function Object_Has_Volatile_Components (N : Node_Id) return Boolean is
4942 Typ : constant Entity_Id := Etype (N);
4945 if Is_Volatile (Typ)
4946 or else Has_Volatile_Components (Typ)
4950 elsif Is_Entity_Name (N)
4951 and then (Has_Volatile_Components (Entity (N))
4952 or else Is_Volatile (Entity (N)))
4956 elsif Nkind (N) = N_Indexed_Component
4957 or else Nkind (N) = N_Selected_Component
4959 return Is_Volatile_Prefix (Prefix (N));
4964 end Object_Has_Volatile_Components;
4966 -- Start of processing for Is_Volatile_Object
4969 if Is_Volatile (Etype (N))
4970 or else (Is_Entity_Name (N) and then Is_Volatile (Entity (N)))
4974 elsif Nkind (N) = N_Indexed_Component
4975 or else Nkind (N) = N_Selected_Component
4977 return Is_Volatile_Prefix (Prefix (N));
4982 end Is_Volatile_Object;
4984 -------------------------
4985 -- Kill_Current_Values --
4986 -------------------------
4988 procedure Kill_Current_Values is
4991 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id);
4992 -- Clear current value for entity E and all entities chained to E
4994 ------------------------------------------
4995 -- Kill_Current_Values_For_Entity_Chain --
4996 ------------------------------------------
4998 procedure Kill_Current_Values_For_Entity_Chain (E : Entity_Id) is
5003 while Present (Ent) loop
5004 if Is_Object (Ent) then
5005 Set_Current_Value (Ent, Empty);
5007 if not Can_Never_Be_Null (Ent) then
5008 Set_Is_Known_Non_Null (Ent, False);
5014 end Kill_Current_Values_For_Entity_Chain;
5016 -- Start of processing for Kill_Current_Values
5019 -- Kill all saved checks, a special case of killing saved values
5023 -- Loop through relevant scopes, which includes the current scope and
5024 -- any parent scopes if the current scope is a block or a package.
5029 -- Clear current values of all entities in current scope
5031 Kill_Current_Values_For_Entity_Chain (First_Entity (S));
5033 -- If scope is a package, also clear current values of all
5034 -- private entities in the scope.
5036 if Ekind (S) = E_Package
5038 Ekind (S) = E_Generic_Package
5040 Is_Concurrent_Type (S)
5042 Kill_Current_Values_For_Entity_Chain (First_Private_Entity (S));
5045 -- If this is a block or nested package, deal with parent
5047 if Ekind (S) = E_Block
5048 or else (Ekind (S) = E_Package
5049 and then not Is_Library_Level_Entity (S))
5055 end loop Scope_Loop;
5056 end Kill_Current_Values;
5058 --------------------------
5059 -- Kill_Size_Check_Code --
5060 --------------------------
5062 procedure Kill_Size_Check_Code (E : Entity_Id) is
5064 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
5065 and then Present (Size_Check_Code (E))
5067 Remove (Size_Check_Code (E));
5068 Set_Size_Check_Code (E, Empty);
5070 end Kill_Size_Check_Code;
5072 -------------------------
5073 -- New_External_Entity --
5074 -------------------------
5076 function New_External_Entity
5077 (Kind : Entity_Kind;
5078 Scope_Id : Entity_Id;
5079 Sloc_Value : Source_Ptr;
5080 Related_Id : Entity_Id;
5082 Suffix_Index : Nat := 0;
5083 Prefix : Character := ' ') return Entity_Id
5085 N : constant Entity_Id :=
5086 Make_Defining_Identifier (Sloc_Value,
5088 (Chars (Related_Id), Suffix, Suffix_Index, Prefix));
5091 Set_Ekind (N, Kind);
5092 Set_Is_Internal (N, True);
5093 Append_Entity (N, Scope_Id);
5094 Set_Public_Status (N);
5096 if Kind in Type_Kind then
5097 Init_Size_Align (N);
5101 end New_External_Entity;
5103 -------------------------
5104 -- New_Internal_Entity --
5105 -------------------------
5107 function New_Internal_Entity
5108 (Kind : Entity_Kind;
5109 Scope_Id : Entity_Id;
5110 Sloc_Value : Source_Ptr;
5111 Id_Char : Character) return Entity_Id
5113 N : constant Entity_Id :=
5114 Make_Defining_Identifier (Sloc_Value, New_Internal_Name (Id_Char));
5117 Set_Ekind (N, Kind);
5118 Set_Is_Internal (N, True);
5119 Append_Entity (N, Scope_Id);
5121 if Kind in Type_Kind then
5122 Init_Size_Align (N);
5126 end New_Internal_Entity;
5132 function Next_Actual (Actual_Id : Node_Id) return Node_Id is
5136 -- If we are pointing at a positional parameter, it is a member of
5137 -- a node list (the list of parameters), and the next parameter
5138 -- is the next node on the list, unless we hit a parameter
5139 -- association, in which case we shift to using the chain whose
5140 -- head is the First_Named_Actual in the parent, and then is
5141 -- threaded using the Next_Named_Actual of the Parameter_Association.
5142 -- All this fiddling is because the original node list is in the
5143 -- textual call order, and what we need is the declaration order.
5145 if Is_List_Member (Actual_Id) then
5146 N := Next (Actual_Id);
5148 if Nkind (N) = N_Parameter_Association then
5149 return First_Named_Actual (Parent (Actual_Id));
5155 return Next_Named_Actual (Parent (Actual_Id));
5159 procedure Next_Actual (Actual_Id : in out Node_Id) is
5161 Actual_Id := Next_Actual (Actual_Id);
5164 -----------------------
5165 -- Normalize_Actuals --
5166 -----------------------
5168 -- Chain actuals according to formals of subprogram. If there are
5169 -- no named associations, the chain is simply the list of Parameter
5170 -- Associations, since the order is the same as the declaration order.
5171 -- If there are named associations, then the First_Named_Actual field
5172 -- in the N_Procedure_Call_Statement node or N_Function_Call node
5173 -- points to the Parameter_Association node for the parameter that
5174 -- comes first in declaration order. The remaining named parameters
5175 -- are then chained in declaration order using Next_Named_Actual.
5177 -- This routine also verifies that the number of actuals is compatible
5178 -- with the number and default values of formals, but performs no type
5179 -- checking (type checking is done by the caller).
5181 -- If the matching succeeds, Success is set to True, and the caller
5182 -- proceeds with type-checking. If the match is unsuccessful, then
5183 -- Success is set to False, and the caller attempts a different
5184 -- interpretation, if there is one.
5186 -- If the flag Report is on, the call is not overloaded, and a failure
5187 -- to match can be reported here, rather than in the caller.
5189 procedure Normalize_Actuals
5193 Success : out Boolean)
5195 Actuals : constant List_Id := Parameter_Associations (N);
5196 Actual : Node_Id := Empty;
5198 Last : Node_Id := Empty;
5199 First_Named : Node_Id := Empty;
5202 Formals_To_Match : Integer := 0;
5203 Actuals_To_Match : Integer := 0;
5205 procedure Chain (A : Node_Id);
5206 -- Add named actual at the proper place in the list, using the
5207 -- Next_Named_Actual link.
5209 function Reporting return Boolean;
5210 -- Determines if an error is to be reported. To report an error, we
5211 -- need Report to be True, and also we do not report errors caused
5212 -- by calls to init procs that occur within other init procs. Such
5213 -- errors must always be cascaded errors, since if all the types are
5214 -- declared correctly, the compiler will certainly build decent calls!
5220 procedure Chain (A : Node_Id) is
5224 -- Call node points to first actual in list
5226 Set_First_Named_Actual (N, Explicit_Actual_Parameter (A));
5229 Set_Next_Named_Actual (Last, Explicit_Actual_Parameter (A));
5233 Set_Next_Named_Actual (Last, Empty);
5240 function Reporting return Boolean is
5245 elsif not Within_Init_Proc then
5248 elsif Is_Init_Proc (Entity (Name (N))) then
5256 -- Start of processing for Normalize_Actuals
5259 if Is_Access_Type (S) then
5261 -- The name in the call is a function call that returns an access
5262 -- to subprogram. The designated type has the list of formals.
5264 Formal := First_Formal (Designated_Type (S));
5266 Formal := First_Formal (S);
5269 while Present (Formal) loop
5270 Formals_To_Match := Formals_To_Match + 1;
5271 Next_Formal (Formal);
5274 -- Find if there is a named association, and verify that no positional
5275 -- associations appear after named ones.
5277 if Present (Actuals) then
5278 Actual := First (Actuals);
5281 while Present (Actual)
5282 and then Nkind (Actual) /= N_Parameter_Association
5284 Actuals_To_Match := Actuals_To_Match + 1;
5288 if No (Actual) and Actuals_To_Match = Formals_To_Match then
5290 -- Most common case: positional notation, no defaults
5295 elsif Actuals_To_Match > Formals_To_Match then
5297 -- Too many actuals: will not work
5300 if Is_Entity_Name (Name (N)) then
5301 Error_Msg_N ("too many arguments in call to&", Name (N));
5303 Error_Msg_N ("too many arguments in call", N);
5311 First_Named := Actual;
5313 while Present (Actual) loop
5314 if Nkind (Actual) /= N_Parameter_Association then
5316 ("positional parameters not allowed after named ones", Actual);
5321 Actuals_To_Match := Actuals_To_Match + 1;
5327 if Present (Actuals) then
5328 Actual := First (Actuals);
5331 Formal := First_Formal (S);
5332 while Present (Formal) loop
5334 -- Match the formals in order. If the corresponding actual
5335 -- is positional, nothing to do. Else scan the list of named
5336 -- actuals to find the one with the right name.
5339 and then Nkind (Actual) /= N_Parameter_Association
5342 Actuals_To_Match := Actuals_To_Match - 1;
5343 Formals_To_Match := Formals_To_Match - 1;
5346 -- For named parameters, search the list of actuals to find
5347 -- one that matches the next formal name.
5349 Actual := First_Named;
5352 while Present (Actual) loop
5353 if Chars (Selector_Name (Actual)) = Chars (Formal) then
5356 Actuals_To_Match := Actuals_To_Match - 1;
5357 Formals_To_Match := Formals_To_Match - 1;
5365 if Ekind (Formal) /= E_In_Parameter
5366 or else No (Default_Value (Formal))
5369 if (Comes_From_Source (S)
5370 or else Sloc (S) = Standard_Location)
5371 and then Is_Overloadable (S)
5375 (Nkind (Parent (N)) = N_Procedure_Call_Statement
5377 (Nkind (Parent (N)) = N_Function_Call
5379 Nkind (Parent (N)) = N_Parameter_Association))
5380 and then Ekind (S) /= E_Function
5382 Set_Etype (N, Etype (S));
5384 Error_Msg_Name_1 := Chars (S);
5385 Error_Msg_Sloc := Sloc (S);
5387 ("missing argument for parameter & " &
5388 "in call to % declared #", N, Formal);
5391 elsif Is_Overloadable (S) then
5392 Error_Msg_Name_1 := Chars (S);
5394 -- Point to type derivation that generated the
5397 Error_Msg_Sloc := Sloc (Parent (S));
5400 ("missing argument for parameter & " &
5401 "in call to % (inherited) #", N, Formal);
5405 ("missing argument for parameter &", N, Formal);
5413 Formals_To_Match := Formals_To_Match - 1;
5418 Next_Formal (Formal);
5421 if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
5428 -- Find some superfluous named actual that did not get
5429 -- attached to the list of associations.
5431 Actual := First (Actuals);
5433 while Present (Actual) loop
5434 if Nkind (Actual) = N_Parameter_Association
5435 and then Actual /= Last
5436 and then No (Next_Named_Actual (Actual))
5438 Error_Msg_N ("unmatched actual & in call",
5439 Selector_Name (Actual));
5450 end Normalize_Actuals;
5452 --------------------------------
5453 -- Note_Possible_Modification --
5454 --------------------------------
5456 procedure Note_Possible_Modification (N : Node_Id) is
5457 Modification_Comes_From_Source : constant Boolean :=
5458 Comes_From_Source (Parent (N));
5464 -- Loop to find referenced entity, if there is one
5471 if Is_Entity_Name (Exp) then
5472 Ent := Entity (Exp);
5474 -- If the entity is missing, it is an undeclared identifier,
5475 -- and there is nothing to annotate.
5481 elsif Nkind (Exp) = N_Explicit_Dereference then
5483 P : constant Node_Id := Prefix (Exp);
5486 if Nkind (P) = N_Selected_Component
5488 Entry_Formal (Entity (Selector_Name (P))))
5490 -- Case of a reference to an entry formal
5492 Ent := Entry_Formal (Entity (Selector_Name (P)));
5494 elsif Nkind (P) = N_Identifier
5495 and then Nkind (Parent (Entity (P))) = N_Object_Declaration
5496 and then Present (Expression (Parent (Entity (P))))
5497 and then Nkind (Expression (Parent (Entity (P))))
5500 -- Case of a reference to a value on which
5501 -- side effects have been removed.
5503 Exp := Prefix (Expression (Parent (Entity (P))));
5511 elsif Nkind (Exp) = N_Type_Conversion
5512 or else Nkind (Exp) = N_Unchecked_Type_Conversion
5514 Exp := Expression (Exp);
5516 elsif Nkind (Exp) = N_Slice
5517 or else Nkind (Exp) = N_Indexed_Component
5518 or else Nkind (Exp) = N_Selected_Component
5520 Exp := Prefix (Exp);
5527 -- Now look for entity being referenced
5529 if Present (Ent) then
5531 if Is_Object (Ent) then
5532 if Comes_From_Source (Exp)
5533 or else Modification_Comes_From_Source
5535 Set_Never_Set_In_Source (Ent, False);
5538 Set_Is_True_Constant (Ent, False);
5539 Set_Current_Value (Ent, Empty);
5541 if not Can_Never_Be_Null (Ent) then
5542 Set_Is_Known_Non_Null (Ent, False);
5545 if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
5546 and then Present (Renamed_Object (Ent))
5548 Exp := Renamed_Object (Ent);
5552 -- Generate a reference only if the assignment comes from
5553 -- source. This excludes, for example, calls to a dispatching
5554 -- assignment operation when the left-hand side is tagged.
5556 if Modification_Comes_From_Source then
5557 Generate_Reference (Ent, Exp, 'm');
5565 end Note_Possible_Modification;
5567 -------------------------
5568 -- Object_Access_Level --
5569 -------------------------
5571 function Object_Access_Level (Obj : Node_Id) return Uint is
5574 -- Returns the static accessibility level of the view denoted
5575 -- by Obj. Note that the value returned is the result of a
5576 -- call to Scope_Depth. Only scope depths associated with
5577 -- dynamic scopes can actually be returned. Since only
5578 -- relative levels matter for accessibility checking, the fact
5579 -- that the distance between successive levels of accessibility
5580 -- is not always one is immaterial (invariant: if level(E2) is
5581 -- deeper than level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
5584 if Is_Entity_Name (Obj) then
5587 -- If E is a type then it denotes a current instance.
5588 -- For this case we add one to the normal accessibility
5589 -- level of the type to ensure that current instances
5590 -- are treated as always being deeper than than the level
5591 -- of any visible named access type (see 3.10.2(21)).
5594 return Type_Access_Level (E) + 1;
5596 elsif Present (Renamed_Object (E)) then
5597 return Object_Access_Level (Renamed_Object (E));
5599 -- Similarly, if E is a component of the current instance of a
5600 -- protected type, any instance of it is assumed to be at a deeper
5601 -- level than the type. For a protected object (whose type is an
5602 -- anonymous protected type) its components are at the same level
5603 -- as the type itself.
5605 elsif not Is_Overloadable (E)
5606 and then Ekind (Scope (E)) = E_Protected_Type
5607 and then Comes_From_Source (Scope (E))
5609 return Type_Access_Level (Scope (E)) + 1;
5612 return Scope_Depth (Enclosing_Dynamic_Scope (E));
5615 elsif Nkind (Obj) = N_Selected_Component then
5616 if Is_Access_Type (Etype (Prefix (Obj))) then
5617 return Type_Access_Level (Etype (Prefix (Obj)));
5619 return Object_Access_Level (Prefix (Obj));
5622 elsif Nkind (Obj) = N_Indexed_Component then
5623 if Is_Access_Type (Etype (Prefix (Obj))) then
5624 return Type_Access_Level (Etype (Prefix (Obj)));
5626 return Object_Access_Level (Prefix (Obj));
5629 elsif Nkind (Obj) = N_Explicit_Dereference then
5631 -- If the prefix is a selected access discriminant then
5632 -- we make a recursive call on the prefix, which will
5633 -- in turn check the level of the prefix object of
5634 -- the selected discriminant.
5636 if Nkind (Prefix (Obj)) = N_Selected_Component
5637 and then Ekind (Etype (Prefix (Obj))) = E_Anonymous_Access_Type
5639 Ekind (Entity (Selector_Name (Prefix (Obj)))) = E_Discriminant
5641 return Object_Access_Level (Prefix (Obj));
5643 return Type_Access_Level (Etype (Prefix (Obj)));
5646 elsif Nkind (Obj) = N_Type_Conversion
5647 or else Nkind (Obj) = N_Unchecked_Type_Conversion
5649 return Object_Access_Level (Expression (Obj));
5651 -- Function results are objects, so we get either the access level
5652 -- of the function or, in the case of an indirect call, the level of
5653 -- of the access-to-subprogram type.
5655 elsif Nkind (Obj) = N_Function_Call then
5656 if Is_Entity_Name (Name (Obj)) then
5657 return Subprogram_Access_Level (Entity (Name (Obj)));
5659 return Type_Access_Level (Etype (Prefix (Name (Obj))));
5662 -- For convenience we handle qualified expressions, even though
5663 -- they aren't technically object names.
5665 elsif Nkind (Obj) = N_Qualified_Expression then
5666 return Object_Access_Level (Expression (Obj));
5668 -- Otherwise return the scope level of Standard.
5669 -- (If there are cases that fall through
5670 -- to this point they will be treated as
5671 -- having global accessibility for now. ???)
5674 return Scope_Depth (Standard_Standard);
5676 end Object_Access_Level;
5678 -----------------------
5679 -- Private_Component --
5680 -----------------------
5682 function Private_Component (Type_Id : Entity_Id) return Entity_Id is
5683 Ancestor : constant Entity_Id := Base_Type (Type_Id);
5685 function Trace_Components
5687 Check : Boolean) return Entity_Id;
5688 -- Recursive function that does the work, and checks against circular
5689 -- definition for each subcomponent type.
5691 ----------------------
5692 -- Trace_Components --
5693 ----------------------
5695 function Trace_Components
5697 Check : Boolean) return Entity_Id
5699 Btype : constant Entity_Id := Base_Type (T);
5700 Component : Entity_Id;
5702 Candidate : Entity_Id := Empty;
5705 if Check and then Btype = Ancestor then
5706 Error_Msg_N ("circular type definition", Type_Id);
5710 if Is_Private_Type (Btype)
5711 and then not Is_Generic_Type (Btype)
5713 if Present (Full_View (Btype))
5714 and then Is_Record_Type (Full_View (Btype))
5715 and then not Is_Frozen (Btype)
5717 -- To indicate that the ancestor depends on a private type,
5718 -- the current Btype is sufficient. However, to check for
5719 -- circular definition we must recurse on the full view.
5721 Candidate := Trace_Components (Full_View (Btype), True);
5723 if Candidate = Any_Type then
5733 elsif Is_Array_Type (Btype) then
5734 return Trace_Components (Component_Type (Btype), True);
5736 elsif Is_Record_Type (Btype) then
5737 Component := First_Entity (Btype);
5738 while Present (Component) loop
5740 -- Skip anonymous types generated by constrained components
5742 if not Is_Type (Component) then
5743 P := Trace_Components (Etype (Component), True);
5746 if P = Any_Type then
5754 Next_Entity (Component);
5762 end Trace_Components;
5764 -- Start of processing for Private_Component
5767 return Trace_Components (Type_Id, False);
5768 end Private_Component;
5770 -----------------------
5771 -- Process_End_Label --
5772 -----------------------
5774 procedure Process_End_Label
5782 Label_Ref : Boolean;
5783 -- Set True if reference to end label itself is required
5786 -- Gets set to the operator symbol or identifier that references
5787 -- the entity Ent. For the child unit case, this is the identifier
5788 -- from the designator. For other cases, this is simply Endl.
5790 procedure Generate_Parent_Ref (N : Node_Id);
5791 -- N is an identifier node that appears as a parent unit reference
5792 -- in the case where Ent is a child unit. This procedure generates
5793 -- an appropriate cross-reference entry.
5795 -------------------------
5796 -- Generate_Parent_Ref --
5797 -------------------------
5799 procedure Generate_Parent_Ref (N : Node_Id) is
5800 Parent_Ent : Entity_Id;
5803 -- Search up scope stack. The reason we do this is that normal
5804 -- visibility analysis would not work for two reasons. First in
5805 -- some subunit cases, the entry for the parent unit may not be
5806 -- visible, and in any case there can be a local entity that
5807 -- hides the scope entity.
5809 Parent_Ent := Current_Scope;
5810 while Present (Parent_Ent) loop
5811 if Chars (Parent_Ent) = Chars (N) then
5813 -- Generate the reference. We do NOT consider this as a
5814 -- reference for unreferenced symbol purposes, but we do
5815 -- force a cross-reference even if the end line does not
5816 -- come from source (the caller already generated the
5817 -- appropriate Typ for this situation).
5820 (Parent_Ent, N, 'r', Set_Ref => False, Force => True);
5821 Style.Check_Identifier (N, Parent_Ent);
5825 Parent_Ent := Scope (Parent_Ent);
5828 -- Fall through means entity was not found -- that's odd, but
5829 -- the appropriate thing is simply to ignore and not generate
5830 -- any cross-reference for this entry.
5833 end Generate_Parent_Ref;
5835 -- Start of processing for Process_End_Label
5838 -- If no node, ignore. This happens in some error situations,
5839 -- and also for some internally generated structures where no
5840 -- end label references are required in any case.
5846 -- Nothing to do if no End_Label, happens for internally generated
5847 -- constructs where we don't want an end label reference anyway.
5848 -- Also nothing to do if Endl is a string literal, which means
5849 -- there was some prior error (bad operator symbol)
5851 Endl := End_Label (N);
5853 if No (Endl) or else Nkind (Endl) = N_String_Literal then
5857 -- Reference node is not in extended main source unit
5859 if not In_Extended_Main_Source_Unit (N) then
5861 -- Generally we do not collect references except for the
5862 -- extended main source unit. The one exception is the 'e'
5863 -- entry for a package spec, where it is useful for a client
5864 -- to have the ending information to define scopes.
5872 -- For this case, we can ignore any parent references,
5873 -- but we need the package name itself for the 'e' entry.
5875 if Nkind (Endl) = N_Designator then
5876 Endl := Identifier (Endl);
5880 -- Reference is in extended main source unit
5885 -- For designator, generate references for the parent entries
5887 if Nkind (Endl) = N_Designator then
5889 -- Generate references for the prefix if the END line comes
5890 -- from source (otherwise we do not need these references)
5892 if Comes_From_Source (Endl) then
5894 while Nkind (Nam) = N_Selected_Component loop
5895 Generate_Parent_Ref (Selector_Name (Nam));
5896 Nam := Prefix (Nam);
5899 Generate_Parent_Ref (Nam);
5902 Endl := Identifier (Endl);
5906 -- If the end label is not for the given entity, then either we have
5907 -- some previous error, or this is a generic instantiation for which
5908 -- we do not need to make a cross-reference in this case anyway. In
5909 -- either case we simply ignore the call.
5911 if Chars (Ent) /= Chars (Endl) then
5915 -- If label was really there, then generate a normal reference
5916 -- and then adjust the location in the end label to point past
5917 -- the name (which should almost always be the semicolon).
5921 if Comes_From_Source (Endl) then
5923 -- If a label reference is required, then do the style check
5924 -- and generate an l-type cross-reference entry for the label
5928 Style.Check_Identifier (Endl, Ent);
5930 Generate_Reference (Ent, Endl, 'l', Set_Ref => False);
5933 -- Set the location to point past the label (normally this will
5934 -- mean the semicolon immediately following the label). This is
5935 -- done for the sake of the 'e' or 't' entry generated below.
5937 Get_Decoded_Name_String (Chars (Endl));
5938 Set_Sloc (Endl, Sloc (Endl) + Source_Ptr (Name_Len));
5941 -- Now generate the e/t reference
5943 Generate_Reference (Ent, Endl, Typ, Set_Ref => False, Force => True);
5945 -- Restore Sloc, in case modified above, since we have an identifier
5946 -- and the normal Sloc should be left set in the tree.
5948 Set_Sloc (Endl, Loc);
5949 end Process_End_Label;
5955 -- We do the conversion to get the value of the real string by using
5956 -- the scanner, see Sinput for details on use of the internal source
5957 -- buffer for scanning internal strings.
5959 function Real_Convert (S : String) return Node_Id is
5960 Save_Src : constant Source_Buffer_Ptr := Source;
5964 Source := Internal_Source_Ptr;
5967 for J in S'Range loop
5968 Source (Source_Ptr (J)) := S (J);
5971 Source (S'Length + 1) := EOF;
5973 if Source (Scan_Ptr) = '-' then
5975 Scan_Ptr := Scan_Ptr + 1;
5983 Set_Realval (Token_Node, UR_Negate (Realval (Token_Node)));
5990 ---------------------
5991 -- Rep_To_Pos_Flag --
5992 ---------------------
5994 function Rep_To_Pos_Flag (E : Entity_Id; Loc : Source_Ptr) return Node_Id is
5996 return New_Occurrence_Of
5997 (Boolean_Literals (not Range_Checks_Suppressed (E)), Loc);
5998 end Rep_To_Pos_Flag;
6000 --------------------
6001 -- Require_Entity --
6002 --------------------
6004 procedure Require_Entity (N : Node_Id) is
6006 if Is_Entity_Name (N) and then No (Entity (N)) then
6007 if Total_Errors_Detected /= 0 then
6008 Set_Entity (N, Any_Id);
6010 raise Program_Error;
6015 ------------------------------
6016 -- Requires_Transient_Scope --
6017 ------------------------------
6019 -- A transient scope is required when variable-sized temporaries are
6020 -- allocated in the primary or secondary stack, or when finalization
6021 -- actions must be generated before the next instruction.
6023 function Requires_Transient_Scope (Id : Entity_Id) return Boolean is
6024 Typ : constant Entity_Id := Underlying_Type (Id);
6026 -- Start of processing for Requires_Transient_Scope
6029 -- This is a private type which is not completed yet. This can only
6030 -- happen in a default expression (of a formal parameter or of a
6031 -- record component). Do not expand transient scope in this case
6036 -- Do not expand transient scope for non-existent procedure return
6038 elsif Typ = Standard_Void_Type then
6041 -- Elementary types do not require a transient scope
6043 elsif Is_Elementary_Type (Typ) then
6046 -- Generally, indefinite subtypes require a transient scope, since the
6047 -- back end cannot generate temporaries, since this is not a valid type
6048 -- for declaring an object. It might be possible to relax this in the
6049 -- future, e.g. by declaring the maximum possible space for the type.
6051 elsif Is_Indefinite_Subtype (Typ) then
6054 -- Functions returning tagged types may dispatch on result so their
6055 -- returned value is allocated on the secondary stack. Controlled
6056 -- type temporaries need finalization.
6058 elsif Is_Tagged_Type (Typ)
6059 or else Has_Controlled_Component (Typ)
6065 elsif Is_Record_Type (Typ) then
6067 -- In GCC 2, discriminated records always require a transient
6068 -- scope because the back end otherwise tries to allocate a
6069 -- variable length temporary for the particular variant.
6071 if Opt.GCC_Version = 2
6072 and then Has_Discriminants (Typ)
6076 -- For GCC 3, or for a non-discriminated record in GCC 2, we are
6077 -- OK if none of the component types requires a transient scope.
6078 -- Note that we already know that this is a definite type (i.e.
6079 -- has discriminant defaults if it is a discriminated record).
6085 Comp := First_Entity (Typ);
6086 while Present (Comp) loop
6087 if Ekind (Comp) = E_Component
6088 and then Requires_Transient_Scope (Etype (Comp))
6100 -- String literal types never require transient scope
6102 elsif Ekind (Typ) = E_String_Literal_Subtype then
6105 -- Array type. Note that we already know that this is a constrained
6106 -- array, since unconstrained arrays will fail the indefinite test.
6108 elsif Is_Array_Type (Typ) then
6110 -- If component type requires a transient scope, the array does too
6112 if Requires_Transient_Scope (Component_Type (Typ)) then
6115 -- Otherwise, we only need a transient scope if the size is not
6116 -- known at compile time.
6119 return not Size_Known_At_Compile_Time (Typ);
6122 -- All other cases do not require a transient scope
6127 end Requires_Transient_Scope;
6129 --------------------------
6130 -- Reset_Analyzed_Flags --
6131 --------------------------
6133 procedure Reset_Analyzed_Flags (N : Node_Id) is
6135 function Clear_Analyzed
6136 (N : Node_Id) return Traverse_Result;
6137 -- Function used to reset Analyzed flags in tree. Note that we do
6138 -- not reset Analyzed flags in entities, since there is no need to
6139 -- renalalyze entities, and indeed, it is wrong to do so, since it
6140 -- can result in generating auxiliary stuff more than once.
6142 --------------------
6143 -- Clear_Analyzed --
6144 --------------------
6146 function Clear_Analyzed
6147 (N : Node_Id) return Traverse_Result
6150 if not Has_Extension (N) then
6151 Set_Analyzed (N, False);
6157 function Reset_Analyzed is
6158 new Traverse_Func (Clear_Analyzed);
6160 Discard : Traverse_Result;
6161 pragma Warnings (Off, Discard);
6163 -- Start of processing for Reset_Analyzed_Flags
6166 Discard := Reset_Analyzed (N);
6167 end Reset_Analyzed_Flags;
6169 ---------------------------
6170 -- Safe_To_Capture_Value --
6171 ---------------------------
6173 function Safe_To_Capture_Value
6175 Ent : Entity_Id) return Boolean
6178 -- The only entities for which we track constant values are variables,
6179 -- out parameters and in out parameters, so check if we have this case.
6181 if Ekind (Ent) /= E_Variable
6183 Ekind (Ent) /= E_Out_Parameter
6185 Ekind (Ent) /= E_In_Out_Parameter
6190 -- Skip volatile and aliased variables, since funny things might
6191 -- be going on in these cases which we cannot necessarily track.
6192 -- Also skip any variable for which an address clause is given.
6194 -- Should we have a flag Has_Address_Clause ???
6196 if Treat_As_Volatile (Ent)
6197 or else Is_Aliased (Ent)
6198 or else Present (Address_Clause (Ent))
6203 -- OK, all above conditions are met. We also require that the scope
6204 -- of the reference be the same as the scope of the entity, not
6205 -- counting packages and blocks.
6208 E_Scope : constant Entity_Id := Scope (Ent);
6209 R_Scope : Entity_Id;
6212 R_Scope := Current_Scope;
6213 while R_Scope /= Standard_Standard loop
6214 exit when R_Scope = E_Scope;
6216 if Ekind (R_Scope) /= E_Package
6218 Ekind (R_Scope) /= E_Block
6222 R_Scope := Scope (R_Scope);
6227 -- We also require that the reference does not appear in a context
6228 -- where it is not sure to be executed (i.e. a conditional context
6229 -- or an exception handler).
6238 while Present (P) loop
6239 if Nkind (P) = N_If_Statement
6240 or else Nkind (P) = N_Case_Statement
6241 or else (Nkind (P) = N_And_Then and then Desc = Right_Opnd (P))
6242 or else (Nkind (P) = N_Or_Else and then Desc = Right_Opnd (P))
6243 or else Nkind (P) = N_Exception_Handler
6244 or else Nkind (P) = N_Selective_Accept
6245 or else Nkind (P) = N_Conditional_Entry_Call
6246 or else Nkind (P) = N_Timed_Entry_Call
6247 or else Nkind (P) = N_Asynchronous_Select
6257 -- OK, looks safe to set value
6260 end Safe_To_Capture_Value;
6266 function Same_Name (N1, N2 : Node_Id) return Boolean is
6267 K1 : constant Node_Kind := Nkind (N1);
6268 K2 : constant Node_Kind := Nkind (N2);
6271 if (K1 = N_Identifier or else K1 = N_Defining_Identifier)
6272 and then (K2 = N_Identifier or else K2 = N_Defining_Identifier)
6274 return Chars (N1) = Chars (N2);
6276 elsif (K1 = N_Selected_Component or else K1 = N_Expanded_Name)
6277 and then (K2 = N_Selected_Component or else K2 = N_Expanded_Name)
6279 return Same_Name (Selector_Name (N1), Selector_Name (N2))
6280 and then Same_Name (Prefix (N1), Prefix (N2));
6291 function Same_Type (T1, T2 : Entity_Id) return Boolean is
6296 elsif not Is_Constrained (T1)
6297 and then not Is_Constrained (T2)
6298 and then Base_Type (T1) = Base_Type (T2)
6302 -- For now don't bother with case of identical constraints, to be
6303 -- fiddled with later on perhaps (this is only used for optimization
6304 -- purposes, so it is not critical to do a best possible job)
6311 ------------------------
6312 -- Scope_Is_Transient --
6313 ------------------------
6315 function Scope_Is_Transient return Boolean is
6317 return Scope_Stack.Table (Scope_Stack.Last).Is_Transient;
6318 end Scope_Is_Transient;
6324 function Scope_Within (Scope1, Scope2 : Entity_Id) return Boolean is
6329 while Scop /= Standard_Standard loop
6330 Scop := Scope (Scop);
6332 if Scop = Scope2 then
6340 --------------------------
6341 -- Scope_Within_Or_Same --
6342 --------------------------
6344 function Scope_Within_Or_Same (Scope1, Scope2 : Entity_Id) return Boolean is
6349 while Scop /= Standard_Standard loop
6350 if Scop = Scope2 then
6353 Scop := Scope (Scop);
6358 end Scope_Within_Or_Same;
6360 ------------------------
6361 -- Set_Current_Entity --
6362 ------------------------
6364 -- The given entity is to be set as the currently visible definition
6365 -- of its associated name (i.e. the Node_Id associated with its name).
6366 -- All we have to do is to get the name from the identifier, and
6367 -- then set the associated Node_Id to point to the given entity.
6369 procedure Set_Current_Entity (E : Entity_Id) is
6371 Set_Name_Entity_Id (Chars (E), E);
6372 end Set_Current_Entity;
6374 ---------------------------------
6375 -- Set_Entity_With_Style_Check --
6376 ---------------------------------
6378 procedure Set_Entity_With_Style_Check (N : Node_Id; Val : Entity_Id) is
6379 Val_Actual : Entity_Id;
6383 Set_Entity (N, Val);
6386 and then not Suppress_Style_Checks (Val)
6387 and then not In_Instance
6389 if Nkind (N) = N_Identifier then
6392 elsif Nkind (N) = N_Expanded_Name then
6393 Nod := Selector_Name (N);
6399 -- A special situation arises for derived operations, where we want
6400 -- to do the check against the parent (since the Sloc of the derived
6401 -- operation points to the derived type declaration itself).
6404 while not Comes_From_Source (Val_Actual)
6405 and then Nkind (Val_Actual) in N_Entity
6406 and then (Ekind (Val_Actual) = E_Enumeration_Literal
6407 or else Is_Subprogram (Val_Actual)
6408 or else Is_Generic_Subprogram (Val_Actual))
6409 and then Present (Alias (Val_Actual))
6411 Val_Actual := Alias (Val_Actual);
6414 -- Renaming declarations for generic actuals do not come from source,
6415 -- and have a different name from that of the entity they rename, so
6416 -- there is no style check to perform here.
6418 if Chars (Nod) = Chars (Val_Actual) then
6419 Style.Check_Identifier (Nod, Val_Actual);
6423 Set_Entity (N, Val);
6424 end Set_Entity_With_Style_Check;
6426 ------------------------
6427 -- Set_Name_Entity_Id --
6428 ------------------------
6430 procedure Set_Name_Entity_Id (Id : Name_Id; Val : Entity_Id) is
6432 Set_Name_Table_Info (Id, Int (Val));
6433 end Set_Name_Entity_Id;
6435 ---------------------
6436 -- Set_Next_Actual --
6437 ---------------------
6439 procedure Set_Next_Actual (Ass1_Id : Node_Id; Ass2_Id : Node_Id) is
6441 if Nkind (Parent (Ass1_Id)) = N_Parameter_Association then
6442 Set_First_Named_Actual (Parent (Ass1_Id), Ass2_Id);
6444 end Set_Next_Actual;
6446 -----------------------
6447 -- Set_Public_Status --
6448 -----------------------
6450 procedure Set_Public_Status (Id : Entity_Id) is
6451 S : constant Entity_Id := Current_Scope;
6454 if S = Standard_Standard
6455 or else (Is_Public (S)
6456 and then (Ekind (S) = E_Package
6457 or else Is_Record_Type (S)
6458 or else Ekind (S) = E_Void))
6462 -- The bounds of an entry family declaration can generate object
6463 -- declarations that are visible to the back-end, e.g. in the
6464 -- the declaration of a composite type that contains tasks.
6467 and then Is_Concurrent_Type (S)
6468 and then not Has_Completion (S)
6469 and then Nkind (Parent (Id)) = N_Object_Declaration
6473 end Set_Public_Status;
6475 ----------------------------
6476 -- Set_Scope_Is_Transient --
6477 ----------------------------
6479 procedure Set_Scope_Is_Transient (V : Boolean := True) is
6481 Scope_Stack.Table (Scope_Stack.Last).Is_Transient := V;
6482 end Set_Scope_Is_Transient;
6488 procedure Set_Size_Info (T1, T2 : Entity_Id) is
6490 -- We copy Esize, but not RM_Size, since in general RM_Size is
6491 -- subtype specific and does not get inherited by all subtypes.
6493 Set_Esize (T1, Esize (T2));
6494 Set_Has_Biased_Representation (T1, Has_Biased_Representation (T2));
6496 if Is_Discrete_Or_Fixed_Point_Type (T1)
6498 Is_Discrete_Or_Fixed_Point_Type (T2)
6500 Set_Is_Unsigned_Type (T1, Is_Unsigned_Type (T2));
6502 Set_Alignment (T1, Alignment (T2));
6505 --------------------
6506 -- Static_Integer --
6507 --------------------
6509 function Static_Integer (N : Node_Id) return Uint is
6511 Analyze_And_Resolve (N, Any_Integer);
6514 or else Error_Posted (N)
6515 or else Etype (N) = Any_Type
6520 if Is_Static_Expression (N) then
6521 if not Raises_Constraint_Error (N) then
6522 return Expr_Value (N);
6527 elsif Etype (N) = Any_Type then
6531 Flag_Non_Static_Expr
6532 ("static integer expression required here", N);
6537 --------------------------
6538 -- Statically_Different --
6539 --------------------------
6541 function Statically_Different (E1, E2 : Node_Id) return Boolean is
6542 R1 : constant Node_Id := Get_Referenced_Object (E1);
6543 R2 : constant Node_Id := Get_Referenced_Object (E2);
6545 return Is_Entity_Name (R1)
6546 and then Is_Entity_Name (R2)
6547 and then Entity (R1) /= Entity (R2)
6548 and then not Is_Formal (Entity (R1))
6549 and then not Is_Formal (Entity (R2));
6550 end Statically_Different;
6552 -----------------------------
6553 -- Subprogram_Access_Level --
6554 -----------------------------
6556 function Subprogram_Access_Level (Subp : Entity_Id) return Uint is
6558 if Present (Alias (Subp)) then
6559 return Subprogram_Access_Level (Alias (Subp));
6561 return Scope_Depth (Enclosing_Dynamic_Scope (Subp));
6563 end Subprogram_Access_Level;
6569 procedure Trace_Scope (N : Node_Id; E : Entity_Id; Msg : String) is
6571 if Debug_Flag_W then
6572 for J in 0 .. Scope_Stack.Last loop
6577 Write_Name (Chars (E));
6578 Write_Str (" line ");
6579 Write_Int (Int (Get_Logical_Line_Number (Sloc (N))));
6584 -----------------------
6585 -- Transfer_Entities --
6586 -----------------------
6588 procedure Transfer_Entities (From : Entity_Id; To : Entity_Id) is
6589 Ent : Entity_Id := First_Entity (From);
6596 if (Last_Entity (To)) = Empty then
6597 Set_First_Entity (To, Ent);
6599 Set_Next_Entity (Last_Entity (To), Ent);
6602 Set_Last_Entity (To, Last_Entity (From));
6604 while Present (Ent) loop
6605 Set_Scope (Ent, To);
6607 if not Is_Public (Ent) then
6608 Set_Public_Status (Ent);
6611 and then Ekind (Ent) = E_Record_Subtype
6614 -- The components of the propagated Itype must be public
6621 Comp := First_Entity (Ent);
6622 while Present (Comp) loop
6623 Set_Is_Public (Comp);
6633 Set_First_Entity (From, Empty);
6634 Set_Last_Entity (From, Empty);
6635 end Transfer_Entities;
6637 -----------------------
6638 -- Type_Access_Level --
6639 -----------------------
6641 function Type_Access_Level (Typ : Entity_Id) return Uint is
6645 -- If the type is an anonymous access type we treat it as being
6646 -- declared at the library level to ensure that names such as
6647 -- X.all'access don't fail static accessibility checks.
6649 -- Ada 2005 (AI-230): In case of anonymous access types that are
6650 -- component_definition or discriminants of a nonlimited type,
6651 -- the level is the same as that of the enclosing component type.
6653 Btyp := Base_Type (Typ);
6655 if Ekind (Btyp) in Access_Kind then
6656 if Ekind (Btyp) = E_Anonymous_Access_Type
6657 and then not Is_Local_Anonymous_Access (Typ) -- Ada 2005 (AI-230)
6659 return Scope_Depth (Standard_Standard);
6662 Btyp := Root_Type (Btyp);
6665 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
6666 end Type_Access_Level;
6668 --------------------------
6669 -- Unit_Declaration_Node --
6670 --------------------------
6672 function Unit_Declaration_Node (Unit_Id : Entity_Id) return Node_Id is
6673 N : Node_Id := Parent (Unit_Id);
6676 -- Predefined operators do not have a full function declaration
6678 if Ekind (Unit_Id) = E_Operator then
6682 while Nkind (N) /= N_Abstract_Subprogram_Declaration
6683 and then Nkind (N) /= N_Formal_Package_Declaration
6684 and then Nkind (N) /= N_Function_Instantiation
6685 and then Nkind (N) /= N_Generic_Package_Declaration
6686 and then Nkind (N) /= N_Generic_Subprogram_Declaration
6687 and then Nkind (N) /= N_Package_Declaration
6688 and then Nkind (N) /= N_Package_Body
6689 and then Nkind (N) /= N_Package_Instantiation
6690 and then Nkind (N) /= N_Package_Renaming_Declaration
6691 and then Nkind (N) /= N_Procedure_Instantiation
6692 and then Nkind (N) /= N_Protected_Body
6693 and then Nkind (N) /= N_Subprogram_Declaration
6694 and then Nkind (N) /= N_Subprogram_Body
6695 and then Nkind (N) /= N_Subprogram_Body_Stub
6696 and then Nkind (N) /= N_Subprogram_Renaming_Declaration
6697 and then Nkind (N) /= N_Task_Body
6698 and then Nkind (N) /= N_Task_Type_Declaration
6699 and then Nkind (N) not in N_Formal_Subprogram_Declaration
6700 and then Nkind (N) not in N_Generic_Renaming_Declaration
6703 pragma Assert (Present (N));
6707 end Unit_Declaration_Node;
6709 ------------------------------
6710 -- Universal_Interpretation --
6711 ------------------------------
6713 function Universal_Interpretation (Opnd : Node_Id) return Entity_Id is
6714 Index : Interp_Index;
6718 -- The argument may be a formal parameter of an operator or subprogram
6719 -- with multiple interpretations, or else an expression for an actual.
6721 if Nkind (Opnd) = N_Defining_Identifier
6722 or else not Is_Overloaded (Opnd)
6724 if Etype (Opnd) = Universal_Integer
6725 or else Etype (Opnd) = Universal_Real
6727 return Etype (Opnd);
6733 Get_First_Interp (Opnd, Index, It);
6734 while Present (It.Typ) loop
6735 if It.Typ = Universal_Integer
6736 or else It.Typ = Universal_Real
6741 Get_Next_Interp (Index, It);
6746 end Universal_Interpretation;
6748 ----------------------
6749 -- Within_Init_Proc --
6750 ----------------------
6752 function Within_Init_Proc return Boolean is
6757 while not Is_Overloadable (S) loop
6758 if S = Standard_Standard then
6765 return Is_Init_Proc (S);
6766 end Within_Init_Proc;
6772 procedure Wrong_Type (Expr : Node_Id; Expected_Type : Entity_Id) is
6773 Found_Type : constant Entity_Id := First_Subtype (Etype (Expr));
6774 Expec_Type : constant Entity_Id := First_Subtype (Expected_Type);
6776 function Has_One_Matching_Field return Boolean;
6777 -- Determines if Expec_Type is a record type with a single component or
6778 -- discriminant whose type matches the found type or is one dimensional
6779 -- array whose component type matches the found type.
6781 ----------------------------
6782 -- Has_One_Matching_Field --
6783 ----------------------------
6785 function Has_One_Matching_Field return Boolean is
6789 if Is_Array_Type (Expec_Type)
6790 and then Number_Dimensions (Expec_Type) = 1
6792 Covers (Etype (Component_Type (Expec_Type)), Found_Type)
6796 elsif not Is_Record_Type (Expec_Type) then
6800 E := First_Entity (Expec_Type);
6805 elsif (Ekind (E) /= E_Discriminant
6806 and then Ekind (E) /= E_Component)
6807 or else (Chars (E) = Name_uTag
6808 or else Chars (E) = Name_uParent)
6817 if not Covers (Etype (E), Found_Type) then
6820 elsif Present (Next_Entity (E)) then
6827 end Has_One_Matching_Field;
6829 -- Start of processing for Wrong_Type
6832 -- Don't output message if either type is Any_Type, or if a message
6833 -- has already been posted for this node. We need to do the latter
6834 -- check explicitly (it is ordinarily done in Errout), because we
6835 -- are using ! to force the output of the error messages.
6837 if Expec_Type = Any_Type
6838 or else Found_Type = Any_Type
6839 or else Error_Posted (Expr)
6843 -- In an instance, there is an ongoing problem with completion of
6844 -- type derived from private types. Their structure is what Gigi
6845 -- expects, but the Etype is the parent type rather than the
6846 -- derived private type itself. Do not flag error in this case. The
6847 -- private completion is an entity without a parent, like an Itype.
6848 -- Similarly, full and partial views may be incorrect in the instance.
6849 -- There is no simple way to insure that it is consistent ???
6851 elsif In_Instance then
6853 if Etype (Etype (Expr)) = Etype (Expected_Type)
6855 (Has_Private_Declaration (Expected_Type)
6856 or else Has_Private_Declaration (Etype (Expr)))
6857 and then No (Parent (Expected_Type))
6863 -- An interesting special check. If the expression is parenthesized
6864 -- and its type corresponds to the type of the sole component of the
6865 -- expected record type, or to the component type of the expected one
6866 -- dimensional array type, then assume we have a bad aggregate attempt.
6868 if Nkind (Expr) in N_Subexpr
6869 and then Paren_Count (Expr) /= 0
6870 and then Has_One_Matching_Field
6872 Error_Msg_N ("positional aggregate cannot have one component", Expr);
6874 -- Another special check, if we are looking for a pool-specific access
6875 -- type and we found an E_Access_Attribute_Type, then we have the case
6876 -- of an Access attribute being used in a context which needs a pool-
6877 -- specific type, which is never allowed. The one extra check we make
6878 -- is that the expected designated type covers the Found_Type.
6880 elsif Is_Access_Type (Expec_Type)
6881 and then Ekind (Found_Type) = E_Access_Attribute_Type
6882 and then Ekind (Base_Type (Expec_Type)) /= E_General_Access_Type
6883 and then Ekind (Base_Type (Expec_Type)) /= E_Anonymous_Access_Type
6885 (Designated_Type (Expec_Type), Designated_Type (Found_Type))
6887 Error_Msg_N ("result must be general access type!", Expr);
6888 Error_Msg_NE ("add ALL to }!", Expr, Expec_Type);
6890 -- If the expected type is an anonymous access type, as for access
6891 -- parameters and discriminants, the error is on the designated types.
6893 elsif Ekind (Expec_Type) = E_Anonymous_Access_Type then
6894 if Comes_From_Source (Expec_Type) then
6895 Error_Msg_NE ("expected}!", Expr, Expec_Type);
6898 ("expected an access type with designated}",
6899 Expr, Designated_Type (Expec_Type));
6902 if Is_Access_Type (Found_Type)
6903 and then not Comes_From_Source (Found_Type)
6906 ("found an access type with designated}!",
6907 Expr, Designated_Type (Found_Type));
6909 if From_With_Type (Found_Type) then
6910 Error_Msg_NE ("found incomplete}!", Expr, Found_Type);
6912 ("\possibly missing with_clause on&", Expr,
6913 Scope (Found_Type));
6915 Error_Msg_NE ("found}!", Expr, Found_Type);
6919 -- Normal case of one type found, some other type expected
6922 -- If the names of the two types are the same, see if some
6923 -- number of levels of qualification will help. Don't try
6924 -- more than three levels, and if we get to standard, it's
6925 -- no use (and probably represents an error in the compiler)
6926 -- Also do not bother with internal scope names.
6929 Expec_Scope : Entity_Id;
6930 Found_Scope : Entity_Id;
6933 Expec_Scope := Expec_Type;
6934 Found_Scope := Found_Type;
6936 for Levels in Int range 0 .. 3 loop
6937 if Chars (Expec_Scope) /= Chars (Found_Scope) then
6938 Error_Msg_Qual_Level := Levels;
6942 Expec_Scope := Scope (Expec_Scope);
6943 Found_Scope := Scope (Found_Scope);
6945 exit when Expec_Scope = Standard_Standard
6946 or else Found_Scope = Standard_Standard
6947 or else not Comes_From_Source (Expec_Scope)
6948 or else not Comes_From_Source (Found_Scope);
6952 if Is_Record_Type (Expec_Type)
6953 and then Present (Corresponding_Remote_Type (Expec_Type))
6955 Error_Msg_NE ("expected}!", Expr,
6956 Corresponding_Remote_Type (Expec_Type));
6958 Error_Msg_NE ("expected}!", Expr, Expec_Type);
6961 if Is_Entity_Name (Expr)
6962 and then Is_Package (Entity (Expr))
6964 Error_Msg_N ("found package name!", Expr);
6966 elsif Is_Entity_Name (Expr)
6968 (Ekind (Entity (Expr)) = E_Procedure
6970 Ekind (Entity (Expr)) = E_Generic_Procedure)
6972 if Ekind (Expec_Type) = E_Access_Subprogram_Type then
6974 ("found procedure name, possibly missing Access attribute!",
6977 Error_Msg_N ("found procedure name instead of function!", Expr);
6980 elsif Nkind (Expr) = N_Function_Call
6981 and then Ekind (Expec_Type) = E_Access_Subprogram_Type
6982 and then Etype (Designated_Type (Expec_Type)) = Etype (Expr)
6983 and then No (Parameter_Associations (Expr))
6986 ("found function name, possibly missing Access attribute!",
6989 -- Catch common error: a prefix or infix operator which is not
6990 -- directly visible because the type isn't.
6992 elsif Nkind (Expr) in N_Op
6993 and then Is_Overloaded (Expr)
6994 and then not Is_Immediately_Visible (Expec_Type)
6995 and then not Is_Potentially_Use_Visible (Expec_Type)
6996 and then not In_Use (Expec_Type)
6997 and then Has_Compatible_Type (Right_Opnd (Expr), Expec_Type)
7000 ("operator of the type is not directly visible!", Expr);
7002 elsif Ekind (Found_Type) = E_Void
7003 and then Present (Parent (Found_Type))
7004 and then Nkind (Parent (Found_Type)) = N_Full_Type_Declaration
7006 Error_Msg_NE ("found premature usage of}!", Expr, Found_Type);
7009 Error_Msg_NE ("found}!", Expr, Found_Type);
7012 Error_Msg_Qual_Level := 0;