1 -----------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
11 -- Copyright (C) 1992-2001, Free Software Foundation, Inc. --
13 -- GNAT is free software; you can redistribute it and/or modify it under --
14 -- terms of the GNU General Public License as published by the Free Soft- --
15 -- ware Foundation; either version 2, or (at your option) any later ver- --
16 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
17 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
18 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
19 -- for more details. You should have received a copy of the GNU General --
20 -- Public License distributed with GNAT; see file COPYING. If not, write --
21 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
22 -- MA 02111-1307, USA. --
24 -- GNAT was originally developed by the GNAT team at New York University. --
25 -- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
27 ------------------------------------------------------------------------------
29 with Atree; use Atree;
30 with Casing; use Casing;
31 with Debug; use Debug;
32 with Errout; use Errout;
33 with Elists; use Elists;
34 with Exp_Util; use Exp_Util;
35 with Freeze; use Freeze;
37 with Lib.Xref; use Lib.Xref;
38 with Namet; use Namet;
39 with Nlists; use Nlists;
40 with Nmake; use Nmake;
41 with Output; use Output;
43 with Restrict; use Restrict;
44 with Scans; use Scans;
47 with Sem_Ch8; use Sem_Ch8;
48 with Sem_Eval; use Sem_Eval;
49 with Sem_Res; use Sem_Res;
50 with Sem_Type; use Sem_Type;
51 with Sinfo; use Sinfo;
52 with Sinput; use Sinput;
53 with Snames; use Snames;
54 with Stand; use Stand;
56 with Stringt; use Stringt;
57 with Targparm; use Targparm;
58 with Tbuild; use Tbuild;
59 with Ttypes; use Ttypes;
61 package body Sem_Util is
63 -----------------------
64 -- Local Subprograms --
65 -----------------------
67 function Build_Component_Subtype
72 -- This function builds the subtype for Build_Actual_Subtype_Of_Component
73 -- and Build_Discriminal_Subtype_Of_Component. C is a list of constraints,
74 -- Loc is the source location, T is the original subtype.
76 --------------------------------
77 -- Add_Access_Type_To_Process --
78 --------------------------------
80 procedure Add_Access_Type_To_Process (E : Entity_Id; A : Entity_Id)
84 Ensure_Freeze_Node (E);
85 L := Access_Types_To_Process (Freeze_Node (E));
89 Set_Access_Types_To_Process (Freeze_Node (E), L);
93 end Add_Access_Type_To_Process;
95 -----------------------
96 -- Alignment_In_Bits --
97 -----------------------
99 function Alignment_In_Bits (E : Entity_Id) return Uint is
101 return Alignment (E) * System_Storage_Unit;
102 end Alignment_In_Bits;
104 -----------------------------------------
105 -- Apply_Compile_Time_Constraint_Error --
106 -----------------------------------------
108 procedure Apply_Compile_Time_Constraint_Error
111 Ent : Entity_Id := Empty;
112 Typ : Entity_Id := Empty;
113 Loc : Source_Ptr := No_Location;
114 Rep : Boolean := True)
116 Stat : constant Boolean := Is_Static_Expression (N);
126 if No (Compile_Time_Constraint_Error (N, Msg, Ent, Loc))
132 -- Now we replace the node by an N_Raise_Constraint_Error node
133 -- This does not need reanalyzing, so set it as analyzed now.
135 Rewrite (N, Make_Raise_Constraint_Error (Sloc (N)));
136 Set_Analyzed (N, True);
138 Set_Raises_Constraint_Error (N);
140 -- If the original expression was marked as static, the result is
141 -- still marked as static, but the Raises_Constraint_Error flag is
142 -- always set so that further static evaluation is not attempted.
145 Set_Is_Static_Expression (N);
147 end Apply_Compile_Time_Constraint_Error;
149 --------------------------
150 -- Build_Actual_Subtype --
151 --------------------------
153 function Build_Actual_Subtype
155 N : Node_Or_Entity_Id)
160 Loc : constant Source_Ptr := Sloc (N);
161 Constraints : List_Id;
167 Disc_Type : Entity_Id;
170 if Nkind (N) = N_Defining_Identifier then
171 Obj := New_Reference_To (N, Loc);
176 if Is_Array_Type (T) then
177 Constraints := New_List;
179 for J in 1 .. Number_Dimensions (T) loop
181 -- Build an array subtype declaration with the nominal
182 -- subtype and the bounds of the actual. Add the declaration
183 -- in front of the local declarations for the subprogram,for
184 -- analysis before any reference to the formal in the body.
187 Make_Attribute_Reference (Loc,
188 Prefix => Duplicate_Subexpr (Obj, Name_Req => True),
189 Attribute_Name => Name_First,
190 Expressions => New_List (
191 Make_Integer_Literal (Loc, J)));
194 Make_Attribute_Reference (Loc,
195 Prefix => Duplicate_Subexpr (Obj, Name_Req => True),
196 Attribute_Name => Name_Last,
197 Expressions => New_List (
198 Make_Integer_Literal (Loc, J)));
200 Append (Make_Range (Loc, Lo, Hi), Constraints);
203 -- If the type has unknown discriminants there is no constrained
206 elsif Has_Unknown_Discriminants (T) then
210 Constraints := New_List;
212 if Is_Private_Type (T) and then No (Full_View (T)) then
214 -- Type is a generic derived type. Inherit discriminants from
217 Disc_Type := Etype (Base_Type (T));
222 Discr := First_Discriminant (Disc_Type);
224 while Present (Discr) loop
225 Append_To (Constraints,
226 Make_Selected_Component (Loc,
227 Prefix => Duplicate_Subexpr (Obj),
228 Selector_Name => New_Occurrence_Of (Discr, Loc)));
229 Next_Discriminant (Discr);
234 Make_Defining_Identifier (Loc,
235 Chars => New_Internal_Name ('S'));
236 Set_Is_Internal (Subt);
239 Make_Subtype_Declaration (Loc,
240 Defining_Identifier => Subt,
241 Subtype_Indication =>
242 Make_Subtype_Indication (Loc,
243 Subtype_Mark => New_Reference_To (T, Loc),
245 Make_Index_Or_Discriminant_Constraint (Loc,
246 Constraints => Constraints)));
248 Mark_Rewrite_Insertion (Decl);
250 end Build_Actual_Subtype;
252 ---------------------------------------
253 -- Build_Actual_Subtype_Of_Component --
254 ---------------------------------------
256 function Build_Actual_Subtype_Of_Component
261 Loc : constant Source_Ptr := Sloc (N);
262 P : constant Node_Id := Prefix (N);
265 Indx_Type : Entity_Id;
267 Deaccessed_T : Entity_Id;
268 -- This is either a copy of T, or if T is an access type, then it is
269 -- the directly designated type of this access type.
271 function Build_Actual_Array_Constraint return List_Id;
272 -- If one or more of the bounds of the component depends on
273 -- discriminants, build actual constraint using the discriminants
276 function Build_Actual_Record_Constraint return List_Id;
277 -- Similar to previous one, for discriminated components constrained
278 -- by the discriminant of the enclosing object.
280 -----------------------------------
281 -- Build_Actual_Array_Constraint --
282 -----------------------------------
284 function Build_Actual_Array_Constraint return List_Id is
285 Constraints : List_Id := New_List;
293 Indx := First_Index (Deaccessed_T);
294 while Present (Indx) loop
295 Old_Lo := Type_Low_Bound (Etype (Indx));
296 Old_Hi := Type_High_Bound (Etype (Indx));
298 if Denotes_Discriminant (Old_Lo) then
300 Make_Selected_Component (Loc,
301 Prefix => New_Copy_Tree (P),
302 Selector_Name => New_Occurrence_Of (Entity (Old_Lo), Loc));
305 Lo := New_Copy_Tree (Old_Lo);
307 -- The new bound will be reanalyzed in the enclosing
308 -- declaration. For literal bounds that come from a type
309 -- declaration, the type of the context must be imposed, so
310 -- insure that analysis will take place. For non-universal
311 -- types this is not strictly necessary.
313 Set_Analyzed (Lo, False);
316 if Denotes_Discriminant (Old_Hi) then
318 Make_Selected_Component (Loc,
319 Prefix => New_Copy_Tree (P),
320 Selector_Name => New_Occurrence_Of (Entity (Old_Hi), Loc));
323 Hi := New_Copy_Tree (Old_Hi);
324 Set_Analyzed (Hi, False);
327 Append (Make_Range (Loc, Lo, Hi), Constraints);
332 end Build_Actual_Array_Constraint;
334 ------------------------------------
335 -- Build_Actual_Record_Constraint --
336 ------------------------------------
338 function Build_Actual_Record_Constraint return List_Id is
339 Constraints : List_Id := New_List;
344 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
345 while Present (D) loop
347 if Denotes_Discriminant (Node (D)) then
348 D_Val := Make_Selected_Component (Loc,
349 Prefix => New_Copy_Tree (P),
350 Selector_Name => New_Occurrence_Of (Entity (Node (D)), Loc));
353 D_Val := New_Copy_Tree (Node (D));
356 Append (D_Val, Constraints);
361 end Build_Actual_Record_Constraint;
363 -- Start of processing for Build_Actual_Subtype_Of_Component
366 if Nkind (N) = N_Explicit_Dereference then
367 if Is_Composite_Type (T)
368 and then not Is_Constrained (T)
369 and then not (Is_Class_Wide_Type (T)
370 and then Is_Constrained (Root_Type (T)))
371 and then not Has_Unknown_Discriminants (T)
373 -- If the type of the dereference is already constrained, it
374 -- is an actual subtype.
376 if Is_Array_Type (Etype (N))
377 and then Is_Constrained (Etype (N))
381 Remove_Side_Effects (P);
382 return Build_Actual_Subtype (T, N);
389 if Ekind (T) = E_Access_Subtype then
390 Deaccessed_T := Designated_Type (T);
395 if Ekind (Deaccessed_T) = E_Array_Subtype then
397 Id := First_Index (Deaccessed_T);
398 Indx_Type := Underlying_Type (Etype (Id));
400 while Present (Id) loop
402 if Denotes_Discriminant (Type_Low_Bound (Indx_Type)) or else
403 Denotes_Discriminant (Type_High_Bound (Indx_Type))
405 Remove_Side_Effects (P);
407 Build_Component_Subtype (
408 Build_Actual_Array_Constraint, Loc, Base_Type (T));
414 elsif Is_Composite_Type (Deaccessed_T)
415 and then Has_Discriminants (Deaccessed_T)
416 and then not Has_Unknown_Discriminants (Deaccessed_T)
418 D := First_Elmt (Discriminant_Constraint (Deaccessed_T));
419 while Present (D) loop
421 if Denotes_Discriminant (Node (D)) then
422 Remove_Side_Effects (P);
424 Build_Component_Subtype (
425 Build_Actual_Record_Constraint, Loc, Base_Type (T));
432 -- If none of the above, the actual and nominal subtypes are the same.
436 end Build_Actual_Subtype_Of_Component;
438 -----------------------------
439 -- Build_Component_Subtype --
440 -----------------------------
442 function Build_Component_Subtype
453 Make_Defining_Identifier (Loc,
454 Chars => New_Internal_Name ('S'));
455 Set_Is_Internal (Subt);
458 Make_Subtype_Declaration (Loc,
459 Defining_Identifier => Subt,
460 Subtype_Indication =>
461 Make_Subtype_Indication (Loc,
462 Subtype_Mark => New_Reference_To (Base_Type (T), Loc),
464 Make_Index_Or_Discriminant_Constraint (Loc,
467 Mark_Rewrite_Insertion (Decl);
469 end Build_Component_Subtype;
471 --------------------------------------------
472 -- Build_Discriminal_Subtype_Of_Component --
473 --------------------------------------------
475 function Build_Discriminal_Subtype_Of_Component
479 Loc : constant Source_Ptr := Sloc (T);
483 function Build_Discriminal_Array_Constraint return List_Id;
484 -- If one or more of the bounds of the component depends on
485 -- discriminants, build actual constraint using the discriminants
488 function Build_Discriminal_Record_Constraint return List_Id;
489 -- Similar to previous one, for discriminated components constrained
490 -- by the discriminant of the enclosing object.
492 ----------------------------------------
493 -- Build_Discriminal_Array_Constraint --
494 ----------------------------------------
496 function Build_Discriminal_Array_Constraint return List_Id is
497 Constraints : List_Id := New_List;
505 Indx := First_Index (T);
506 while Present (Indx) loop
507 Old_Lo := Type_Low_Bound (Etype (Indx));
508 Old_Hi := Type_High_Bound (Etype (Indx));
510 if Denotes_Discriminant (Old_Lo) then
511 Lo := New_Occurrence_Of (Discriminal (Entity (Old_Lo)), Loc);
514 Lo := New_Copy_Tree (Old_Lo);
517 if Denotes_Discriminant (Old_Hi) then
518 Hi := New_Occurrence_Of (Discriminal (Entity (Old_Hi)), Loc);
521 Hi := New_Copy_Tree (Old_Hi);
524 Append (Make_Range (Loc, Lo, Hi), Constraints);
529 end Build_Discriminal_Array_Constraint;
531 -----------------------------------------
532 -- Build_Discriminal_Record_Constraint --
533 -----------------------------------------
535 function Build_Discriminal_Record_Constraint return List_Id is
536 Constraints : List_Id := New_List;
541 D := First_Elmt (Discriminant_Constraint (T));
542 while Present (D) loop
544 if Denotes_Discriminant (Node (D)) then
546 New_Occurrence_Of (Discriminal (Entity (Node (D))), Loc);
549 D_Val := New_Copy_Tree (Node (D));
552 Append (D_Val, Constraints);
557 end Build_Discriminal_Record_Constraint;
559 -- Start of processing for Build_Discriminal_Subtype_Of_Component
562 if Ekind (T) = E_Array_Subtype then
564 Id := First_Index (T);
566 while Present (Id) loop
568 if Denotes_Discriminant (Type_Low_Bound (Etype (Id))) or else
569 Denotes_Discriminant (Type_High_Bound (Etype (Id)))
571 return Build_Component_Subtype
572 (Build_Discriminal_Array_Constraint, Loc, T);
578 elsif Ekind (T) = E_Record_Subtype
579 and then Has_Discriminants (T)
580 and then not Has_Unknown_Discriminants (T)
582 D := First_Elmt (Discriminant_Constraint (T));
583 while Present (D) loop
585 if Denotes_Discriminant (Node (D)) then
586 return Build_Component_Subtype
587 (Build_Discriminal_Record_Constraint, Loc, T);
594 -- If none of the above, the actual and nominal subtypes are the same.
598 end Build_Discriminal_Subtype_Of_Component;
600 ------------------------------
601 -- Build_Elaboration_Entity --
602 ------------------------------
604 procedure Build_Elaboration_Entity (N : Node_Id; Spec_Id : Entity_Id) is
605 Loc : constant Source_Ptr := Sloc (N);
606 Unum : constant Unit_Number_Type := Get_Source_Unit (Loc);
609 Elab_Ent : Entity_Id;
612 -- Ignore if already constructed
614 if Present (Elaboration_Entity (Spec_Id)) then
618 -- Construct name of elaboration entity as xxx_E, where xxx
619 -- is the unit name with dots replaced by double underscore.
620 -- We have to manually construct this name, since it will
621 -- be elaborated in the outer scope, and thus will not have
622 -- the unit name automatically prepended.
624 Get_Name_String (Unit_Name (Unum));
626 -- Replace the %s by _E
628 Name_Buffer (Name_Len - 1 .. Name_Len) := "_E";
630 -- Replace dots by double underscore
633 while P < Name_Len - 2 loop
634 if Name_Buffer (P) = '.' then
635 Name_Buffer (P + 2 .. Name_Len + 1) :=
636 Name_Buffer (P + 1 .. Name_Len);
637 Name_Len := Name_Len + 1;
638 Name_Buffer (P) := '_';
639 Name_Buffer (P + 1) := '_';
646 -- Create elaboration flag
649 Make_Defining_Identifier (Loc, Chars => Name_Find);
650 Set_Elaboration_Entity (Spec_Id, Elab_Ent);
652 if No (Declarations (Aux_Decls_Node (N))) then
653 Set_Declarations (Aux_Decls_Node (N), New_List);
657 Make_Object_Declaration (Loc,
658 Defining_Identifier => Elab_Ent,
660 New_Occurrence_Of (Standard_Boolean, Loc),
662 New_Occurrence_Of (Standard_False, Loc));
664 Append_To (Declarations (Aux_Decls_Node (N)), Decl);
667 -- Reset True_Constant indication, since we will indeed
668 -- assign a value to the variable in the binder main.
670 Set_Is_True_Constant (Elab_Ent, False);
672 -- We do not want any further qualification of the name (if we did
673 -- not do this, we would pick up the name of the generic package
674 -- in the case of a library level generic instantiation).
676 Set_Has_Qualified_Name (Elab_Ent);
677 Set_Has_Fully_Qualified_Name (Elab_Ent);
678 end Build_Elaboration_Entity;
680 --------------------------
681 -- Check_Fully_Declared --
682 --------------------------
684 procedure Check_Fully_Declared (T : Entity_Id; N : Node_Id) is
686 if Ekind (T) = E_Incomplete_Type then
688 ("premature usage of incomplete}", N, First_Subtype (T));
690 elsif Has_Private_Component (T)
691 and then not Is_Generic_Type (Root_Type (T))
692 and then not In_Default_Expression
695 ("premature usage of incomplete}", N, First_Subtype (T));
697 end Check_Fully_Declared;
699 ------------------------------------------
700 -- Check_Potentially_Blocking_Operation --
701 ------------------------------------------
703 procedure Check_Potentially_Blocking_Operation (N : Node_Id) is
705 Loc : constant Source_Ptr := Sloc (N);
708 -- N is one of the potentially blocking operations listed in
709 -- 9.5.1 (8). When using the Ravenscar profile, raise Program_Error
710 -- before N if the context is a protected action. Otherwise, only issue
711 -- a warning, since some users are relying on blocking operations
712 -- inside protected objects.
713 -- Indirect blocking through a subprogram call
714 -- cannot be diagnosed statically without interprocedural analysis,
715 -- so we do not attempt to do it here.
717 S := Scope (Current_Scope);
719 while Present (S) and then S /= Standard_Standard loop
720 if Is_Protected_Type (S) then
721 if Restricted_Profile then
723 Make_Raise_Program_Error (Loc));
724 Error_Msg_N ("potentially blocking operation, " &
725 " Program Error will be raised at run time?", N);
729 ("potentially blocking operation in protected operation?", N);
737 end Check_Potentially_Blocking_Operation;
743 procedure Check_VMS (Construct : Node_Id) is
745 if not OpenVMS_On_Target then
747 ("this construct is allowed only in Open'V'M'S", Construct);
751 ----------------------------------
752 -- Collect_Primitive_Operations --
753 ----------------------------------
755 function Collect_Primitive_Operations (T : Entity_Id) return Elist_Id is
756 B_Type : constant Entity_Id := Base_Type (T);
757 B_Decl : constant Node_Id := Original_Node (Parent (B_Type));
758 B_Scope : Entity_Id := Scope (B_Type);
762 Formal_Derived : Boolean := False;
766 -- For tagged types, the primitive operations are collected as they
767 -- are declared, and held in an explicit list which is simply returned.
769 if Is_Tagged_Type (B_Type) then
770 return Primitive_Operations (B_Type);
772 -- An untagged generic type that is a derived type inherits the
773 -- primitive operations of its parent type. Other formal types only
774 -- have predefined operators, which are not explicitly represented.
776 elsif Is_Generic_Type (B_Type) then
777 if Nkind (B_Decl) = N_Formal_Type_Declaration
778 and then Nkind (Formal_Type_Definition (B_Decl))
779 = N_Formal_Derived_Type_Definition
781 Formal_Derived := True;
783 return New_Elmt_List;
787 Op_List := New_Elmt_List;
789 if B_Scope = Standard_Standard then
790 if B_Type = Standard_String then
791 Append_Elmt (Standard_Op_Concat, Op_List);
793 elsif B_Type = Standard_Wide_String then
794 Append_Elmt (Standard_Op_Concatw, Op_List);
800 elsif (Is_Package (B_Scope)
802 Parent (Declaration_Node (First_Subtype (T))))
805 or else Is_Derived_Type (B_Type)
807 -- The primitive operations appear after the base type, except
808 -- if the derivation happens within the private part of B_Scope
809 -- and the type is a private type, in which case both the type
810 -- and some primitive operations may appear before the base
811 -- type, and the list of candidates starts after the type.
813 if In_Open_Scopes (B_Scope)
814 and then Scope (T) = B_Scope
815 and then In_Private_Part (B_Scope)
817 Id := Next_Entity (T);
819 Id := Next_Entity (B_Type);
822 while Present (Id) loop
824 -- Note that generic formal subprograms are not
825 -- considered to be primitive operations and thus
826 -- are never inherited.
828 if Is_Overloadable (Id)
829 and then Nkind (Parent (Parent (Id)))
830 /= N_Formal_Subprogram_Declaration
834 if Base_Type (Etype (Id)) = B_Type then
837 Formal := First_Formal (Id);
838 while Present (Formal) loop
839 if Base_Type (Etype (Formal)) = B_Type then
843 elsif Ekind (Etype (Formal)) = E_Anonymous_Access_Type
845 (Designated_Type (Etype (Formal))) = B_Type
851 Next_Formal (Formal);
855 -- For a formal derived type, the only primitives are the
856 -- ones inherited from the parent type. Operations appearing
857 -- in the package declaration are not primitive for it.
860 and then (not Formal_Derived
861 or else Present (Alias (Id)))
863 Append_Elmt (Id, Op_List);
869 -- For a type declared in System, some of its operations
870 -- may appear in the target-specific extension to System.
873 and then Chars (B_Scope) = Name_System
874 and then Scope (B_Scope) = Standard_Standard
875 and then Present_System_Aux
877 B_Scope := System_Aux_Id;
878 Id := First_Entity (System_Aux_Id);
886 end Collect_Primitive_Operations;
888 -----------------------------------
889 -- Compile_Time_Constraint_Error --
890 -----------------------------------
892 function Compile_Time_Constraint_Error
895 Ent : Entity_Id := Empty;
896 Loc : Source_Ptr := No_Location)
899 Msgc : String (1 .. Msg'Length + 2);
906 -- A static constraint error in an instance body is not a fatal error.
907 -- we choose to inhibit the message altogether, because there is no
908 -- obvious node (for now) on which to post it. On the other hand the
909 -- offending node must be replaced with a constraint_error in any case.
911 -- No messages are generated if we already posted an error on this node
913 if not Error_Posted (N) then
915 -- Make all such messages unconditional
917 Msgc (1 .. Msg'Length) := Msg;
918 Msgc (Msg'Length + 1) := '!';
919 Msgl := Msg'Length + 1;
921 -- Message is a warning, even in Ada 95 case
923 if Msg (Msg'Length) = '?' then
926 -- In Ada 83, all messages are warnings. In the private part and
927 -- the body of an instance, constraint_checks are only warnings.
929 elsif Ada_83 and then Comes_From_Source (N) then
935 elsif In_Instance_Not_Visible then
940 Warn_On_Instance := True;
942 -- Otherwise we have a real error message (Ada 95 static case)
948 -- Should we generate a warning? The answer is not quite yes. The
949 -- very annoying exception occurs in the case of a short circuit
950 -- operator where the left operand is static and decisive. Climb
951 -- parents to see if that is the case we have here.
959 if (Nkind (P) = N_And_Then
960 and then Compile_Time_Known_Value (Left_Opnd (P))
961 and then Is_False (Expr_Value (Left_Opnd (P))))
962 or else (Nkind (P) = N_Or_Else
963 and then Compile_Time_Known_Value (Left_Opnd (P))
964 and then Is_True (Expr_Value (Left_Opnd (P))))
969 elsif Nkind (P) = N_Component_Association
970 and then Nkind (Parent (P)) = N_Aggregate
975 exit when Nkind (P) not in N_Subexpr;
980 if Present (Ent) then
981 Error_Msg_NE (Msgc (1 .. Msgl), N, Ent);
983 Error_Msg_NE (Msgc (1 .. Msgl), N, Etype (N));
987 if Inside_Init_Proc then
989 ("\& will be raised for objects of this type!?",
990 N, Standard_Constraint_Error);
993 ("\& will be raised at run time!?",
994 N, Standard_Constraint_Error);
998 ("\static expression raises&!",
999 N, Standard_Constraint_Error);
1005 end Compile_Time_Constraint_Error;
1007 -----------------------
1008 -- Conditional_Delay --
1009 -----------------------
1011 procedure Conditional_Delay (New_Ent, Old_Ent : Entity_Id) is
1013 if Has_Delayed_Freeze (Old_Ent) and then not Is_Frozen (Old_Ent) then
1014 Set_Has_Delayed_Freeze (New_Ent);
1016 end Conditional_Delay;
1018 --------------------
1019 -- Current_Entity --
1020 --------------------
1022 -- The currently visible definition for a given identifier is the
1023 -- one most chained at the start of the visibility chain, i.e. the
1024 -- one that is referenced by the Node_Id value of the name of the
1025 -- given identifier.
1027 function Current_Entity (N : Node_Id) return Entity_Id is
1029 return Get_Name_Entity_Id (Chars (N));
1032 -----------------------------
1033 -- Current_Entity_In_Scope --
1034 -----------------------------
1036 function Current_Entity_In_Scope (N : Node_Id) return Entity_Id is
1038 CS : constant Entity_Id := Current_Scope;
1040 Transient_Case : constant Boolean := Scope_Is_Transient;
1043 E := Get_Name_Entity_Id (Chars (N));
1046 and then Scope (E) /= CS
1047 and then (not Transient_Case or else Scope (E) /= Scope (CS))
1053 end Current_Entity_In_Scope;
1059 function Current_Scope return Entity_Id is
1061 if Scope_Stack.Last = -1 then
1062 return Standard_Standard;
1065 C : constant Entity_Id :=
1066 Scope_Stack.Table (Scope_Stack.Last).Entity;
1071 return Standard_Standard;
1077 ------------------------
1078 -- Current_Subprogram --
1079 ------------------------
1081 function Current_Subprogram return Entity_Id is
1082 Scop : constant Entity_Id := Current_Scope;
1085 if Ekind (Scop) = E_Function
1087 Ekind (Scop) = E_Procedure
1089 Ekind (Scop) = E_Generic_Function
1091 Ekind (Scop) = E_Generic_Procedure
1096 return Enclosing_Subprogram (Scop);
1098 end Current_Subprogram;
1100 ---------------------
1101 -- Defining_Entity --
1102 ---------------------
1104 function Defining_Entity (N : Node_Id) return Entity_Id is
1105 K : constant Node_Kind := Nkind (N);
1106 Err : Entity_Id := Empty;
1111 N_Subprogram_Declaration |
1112 N_Abstract_Subprogram_Declaration |
1114 N_Package_Declaration |
1115 N_Subprogram_Renaming_Declaration |
1116 N_Subprogram_Body_Stub |
1117 N_Generic_Subprogram_Declaration |
1118 N_Generic_Package_Declaration |
1119 N_Formal_Subprogram_Declaration
1121 return Defining_Entity (Specification (N));
1124 N_Component_Declaration |
1125 N_Defining_Program_Unit_Name |
1126 N_Discriminant_Specification |
1128 N_Entry_Declaration |
1129 N_Entry_Index_Specification |
1130 N_Exception_Declaration |
1131 N_Exception_Renaming_Declaration |
1132 N_Formal_Object_Declaration |
1133 N_Formal_Package_Declaration |
1134 N_Formal_Type_Declaration |
1135 N_Full_Type_Declaration |
1136 N_Implicit_Label_Declaration |
1137 N_Incomplete_Type_Declaration |
1138 N_Loop_Parameter_Specification |
1139 N_Number_Declaration |
1140 N_Object_Declaration |
1141 N_Object_Renaming_Declaration |
1142 N_Package_Body_Stub |
1143 N_Parameter_Specification |
1144 N_Private_Extension_Declaration |
1145 N_Private_Type_Declaration |
1147 N_Protected_Body_Stub |
1148 N_Protected_Type_Declaration |
1149 N_Single_Protected_Declaration |
1150 N_Single_Task_Declaration |
1151 N_Subtype_Declaration |
1154 N_Task_Type_Declaration
1156 return Defining_Identifier (N);
1159 return Defining_Entity (Proper_Body (N));
1162 N_Function_Instantiation |
1163 N_Function_Specification |
1164 N_Generic_Function_Renaming_Declaration |
1165 N_Generic_Package_Renaming_Declaration |
1166 N_Generic_Procedure_Renaming_Declaration |
1168 N_Package_Instantiation |
1169 N_Package_Renaming_Declaration |
1170 N_Package_Specification |
1171 N_Procedure_Instantiation |
1172 N_Procedure_Specification
1175 Nam : constant Node_Id := Defining_Unit_Name (N);
1178 if Nkind (Nam) in N_Entity then
1181 -- For Error, make up a name and attach to declaration
1182 -- so we can continue semantic analysis
1184 elsif Nam = Error then
1186 Make_Defining_Identifier (Sloc (N),
1187 Chars => New_Internal_Name ('T'));
1188 Set_Defining_Unit_Name (N, Err);
1191 -- If not an entity, get defining identifier
1194 return Defining_Identifier (Nam);
1198 when N_Block_Statement =>
1199 return Entity (Identifier (N));
1202 raise Program_Error;
1205 end Defining_Entity;
1207 --------------------------
1208 -- Denotes_Discriminant --
1209 --------------------------
1211 function Denotes_Discriminant (N : Node_Id) return Boolean is
1213 return Is_Entity_Name (N)
1214 and then Present (Entity (N))
1215 and then Ekind (Entity (N)) = E_Discriminant;
1216 end Denotes_Discriminant;
1218 -----------------------------
1219 -- Depends_On_Discriminant --
1220 -----------------------------
1222 function Depends_On_Discriminant (N : Node_Id) return Boolean is
1227 Get_Index_Bounds (N, L, H);
1228 return Denotes_Discriminant (L) or else Denotes_Discriminant (H);
1229 end Depends_On_Discriminant;
1231 -------------------------
1232 -- Designate_Same_Unit --
1233 -------------------------
1235 function Designate_Same_Unit
1240 K1 : Node_Kind := Nkind (Name1);
1241 K2 : Node_Kind := Nkind (Name2);
1243 function Prefix_Node (N : Node_Id) return Node_Id;
1244 -- Returns the parent unit name node of a defining program unit name
1245 -- or the prefix if N is a selected component or an expanded name.
1247 function Select_Node (N : Node_Id) return Node_Id;
1248 -- Returns the defining identifier node of a defining program unit
1249 -- name or the selector node if N is a selected component or an
1252 function Prefix_Node (N : Node_Id) return Node_Id is
1254 if Nkind (N) = N_Defining_Program_Unit_Name then
1262 function Select_Node (N : Node_Id) return Node_Id is
1264 if Nkind (N) = N_Defining_Program_Unit_Name then
1265 return Defining_Identifier (N);
1268 return Selector_Name (N);
1272 -- Start of processing for Designate_Next_Unit
1275 if (K1 = N_Identifier or else
1276 K1 = N_Defining_Identifier)
1278 (K2 = N_Identifier or else
1279 K2 = N_Defining_Identifier)
1281 return Chars (Name1) = Chars (Name2);
1284 (K1 = N_Expanded_Name or else
1285 K1 = N_Selected_Component or else
1286 K1 = N_Defining_Program_Unit_Name)
1288 (K2 = N_Expanded_Name or else
1289 K2 = N_Selected_Component or else
1290 K2 = N_Defining_Program_Unit_Name)
1293 (Chars (Select_Node (Name1)) = Chars (Select_Node (Name2)))
1295 Designate_Same_Unit (Prefix_Node (Name1), Prefix_Node (Name2));
1300 end Designate_Same_Unit;
1302 ----------------------------
1303 -- Enclosing_Generic_Body --
1304 ----------------------------
1306 function Enclosing_Generic_Body
1317 while Present (P) loop
1318 if Nkind (P) = N_Package_Body
1319 or else Nkind (P) = N_Subprogram_Body
1321 Spec := Corresponding_Spec (P);
1323 if Present (Spec) then
1324 Decl := Unit_Declaration_Node (Spec);
1326 if Nkind (Decl) = N_Generic_Package_Declaration
1327 or else Nkind (Decl) = N_Generic_Subprogram_Declaration
1338 end Enclosing_Generic_Body;
1340 -------------------------------
1341 -- Enclosing_Lib_Unit_Entity --
1342 -------------------------------
1344 function Enclosing_Lib_Unit_Entity return Entity_Id is
1345 Unit_Entity : Entity_Id := Current_Scope;
1348 -- Look for enclosing library unit entity by following scope links.
1349 -- Equivalent to, but faster than indexing through the scope stack.
1351 while (Present (Scope (Unit_Entity))
1352 and then Scope (Unit_Entity) /= Standard_Standard)
1353 and not Is_Child_Unit (Unit_Entity)
1355 Unit_Entity := Scope (Unit_Entity);
1359 end Enclosing_Lib_Unit_Entity;
1361 -----------------------------
1362 -- Enclosing_Lib_Unit_Node --
1363 -----------------------------
1365 function Enclosing_Lib_Unit_Node (N : Node_Id) return Node_Id is
1366 Current_Node : Node_Id := N;
1369 while Present (Current_Node)
1370 and then Nkind (Current_Node) /= N_Compilation_Unit
1372 Current_Node := Parent (Current_Node);
1375 if Nkind (Current_Node) /= N_Compilation_Unit then
1379 return Current_Node;
1380 end Enclosing_Lib_Unit_Node;
1382 --------------------------
1383 -- Enclosing_Subprogram --
1384 --------------------------
1386 function Enclosing_Subprogram (E : Entity_Id) return Entity_Id is
1387 Dynamic_Scope : constant Entity_Id := Enclosing_Dynamic_Scope (E);
1390 if Dynamic_Scope = Standard_Standard then
1393 elsif Ekind (Dynamic_Scope) = E_Subprogram_Body then
1394 return Corresponding_Spec (Parent (Parent (Dynamic_Scope)));
1396 elsif Ekind (Dynamic_Scope) = E_Block then
1397 return Enclosing_Subprogram (Dynamic_Scope);
1399 elsif Ekind (Dynamic_Scope) = E_Task_Type then
1400 return Get_Task_Body_Procedure (Dynamic_Scope);
1402 elsif Convention (Dynamic_Scope) = Convention_Protected then
1403 return Protected_Body_Subprogram (Dynamic_Scope);
1406 return Dynamic_Scope;
1408 end Enclosing_Subprogram;
1410 ------------------------
1411 -- Ensure_Freeze_Node --
1412 ------------------------
1414 procedure Ensure_Freeze_Node (E : Entity_Id) is
1418 if No (Freeze_Node (E)) then
1419 FN := Make_Freeze_Entity (Sloc (E));
1420 Set_Has_Delayed_Freeze (E);
1421 Set_Freeze_Node (E, FN);
1422 Set_Access_Types_To_Process (FN, No_Elist);
1423 Set_TSS_Elist (FN, No_Elist);
1426 end Ensure_Freeze_Node;
1432 procedure Enter_Name (Def_Id : Node_Id) is
1433 C : constant Entity_Id := Current_Entity (Def_Id);
1434 E : constant Entity_Id := Current_Entity_In_Scope (Def_Id);
1435 S : constant Entity_Id := Current_Scope;
1438 Generate_Definition (Def_Id);
1440 -- Add new name to current scope declarations. Check for duplicate
1441 -- declaration, which may or may not be a genuine error.
1445 -- Case of previous entity entered because of a missing declaration
1446 -- or else a bad subtype indication. Best is to use the new entity,
1447 -- and make the previous one invisible.
1449 if Etype (E) = Any_Type then
1450 Set_Is_Immediately_Visible (E, False);
1452 -- Case of renaming declaration constructed for package instances.
1453 -- if there is an explicit declaration with the same identifier,
1454 -- the renaming is not immediately visible any longer, but remains
1455 -- visible through selected component notation.
1457 elsif Nkind (Parent (E)) = N_Package_Renaming_Declaration
1458 and then not Comes_From_Source (E)
1460 Set_Is_Immediately_Visible (E, False);
1462 -- The new entity may be the package renaming, which has the same
1463 -- same name as a generic formal which has been seen already.
1465 elsif Nkind (Parent (Def_Id)) = N_Package_Renaming_Declaration
1466 and then not Comes_From_Source (Def_Id)
1468 Set_Is_Immediately_Visible (E, False);
1470 -- For a fat pointer corresponding to a remote access to subprogram,
1471 -- we use the same identifier as the RAS type, so that the proper
1472 -- name appears in the stub. This type is only retrieved through
1473 -- the RAS type and never by visibility, and is not added to the
1474 -- visibility list (see below).
1476 elsif Nkind (Parent (Def_Id)) = N_Full_Type_Declaration
1477 and then Present (Corresponding_Remote_Type (Def_Id))
1481 -- A controller component for a type extension overrides the
1482 -- inherited component.
1484 elsif Chars (E) = Name_uController then
1487 -- Case of an implicit operation or derived literal. The new entity
1488 -- hides the implicit one, which is removed from all visibility,
1489 -- i.e. the entity list of its scope, and homonym chain of its name.
1491 elsif (Is_Overloadable (E) and then Present (Alias (E)))
1492 or else Is_Internal (E)
1493 or else (Ekind (E) = E_Enumeration_Literal
1494 and then Is_Derived_Type (Etype (E)))
1498 Prev_Vis : Entity_Id;
1501 -- If E is an implicit declaration, it cannot be the first
1502 -- entity in the scope.
1504 Prev := First_Entity (Current_Scope);
1506 while Next_Entity (Prev) /= E loop
1510 Set_Next_Entity (Prev, Next_Entity (E));
1512 if No (Next_Entity (Prev)) then
1513 Set_Last_Entity (Current_Scope, Prev);
1516 if E = Current_Entity (E) then
1519 Prev_Vis := Current_Entity (E);
1520 while Homonym (Prev_Vis) /= E loop
1521 Prev_Vis := Homonym (Prev_Vis);
1525 if Present (Prev_Vis) then
1527 -- Skip E in the visibility chain
1529 Set_Homonym (Prev_Vis, Homonym (E));
1532 Set_Name_Entity_Id (Chars (E), Homonym (E));
1536 -- This section of code could use a comment ???
1538 elsif Present (Etype (E))
1539 and then Is_Concurrent_Type (Etype (E))
1544 -- In the body or private part of an instance, a type extension
1545 -- may introduce a component with the same name as that of an
1546 -- actual. The legality rule is not enforced, but the semantics
1547 -- of the full type with two components of the same name are not
1548 -- clear at this point ???
1550 elsif In_Instance_Not_Visible then
1553 -- When compiling a package body, some child units may have become
1554 -- visible. They cannot conflict with local entities that hide them.
1556 elsif Is_Child_Unit (E)
1557 and then In_Open_Scopes (Scope (E))
1558 and then not Is_Immediately_Visible (E)
1562 -- Conversely, with front-end inlining we may compile the parent
1563 -- body first, and a child unit subsequently. The context is now
1564 -- the parent spec, and body entities are not visible.
1566 elsif Is_Child_Unit (Def_Id)
1567 and then Is_Package_Body_Entity (E)
1568 and then not In_Package_Body (Current_Scope)
1572 -- Case of genuine duplicate declaration
1575 Error_Msg_Sloc := Sloc (E);
1577 -- If the previous declaration is an incomplete type declaration
1578 -- this may be an attempt to complete it with a private type.
1579 -- The following avoids confusing cascaded errors.
1581 if Nkind (Parent (E)) = N_Incomplete_Type_Declaration
1582 and then Nkind (Parent (Def_Id)) = N_Private_Type_Declaration
1585 ("incomplete type cannot be completed" &
1586 " with a private declaration",
1588 Set_Is_Immediately_Visible (E, False);
1589 Set_Full_View (E, Def_Id);
1591 elsif Ekind (E) = E_Discriminant
1592 and then Present (Scope (Def_Id))
1593 and then Scope (Def_Id) /= Current_Scope
1595 -- An inherited component of a record conflicts with
1596 -- a new discriminant. The discriminant is inserted first
1597 -- in the scope, but the error should be posted on it, not
1598 -- on the component.
1600 Error_Msg_Sloc := Sloc (Def_Id);
1601 Error_Msg_N ("& conflicts with declaration#", E);
1604 -- If the name of the unit appears in its own context clause,
1605 -- a dummy package with the name has already been created, and
1606 -- the error emitted. Try to continue quietly.
1608 elsif Error_Posted (E)
1609 and then Sloc (E) = No_Location
1610 and then Nkind (Parent (E)) = N_Package_Specification
1611 and then Current_Scope = Standard_Standard
1613 Set_Scope (Def_Id, Current_Scope);
1617 Error_Msg_N ("& conflicts with declaration#", Def_Id);
1619 -- Avoid cascaded messages with duplicate components in
1622 if Ekind (E) = E_Component
1623 or else Ekind (E) = E_Discriminant
1629 if Nkind (Parent (Parent (Def_Id)))
1630 = N_Generic_Subprogram_Declaration
1632 Defining_Entity (Specification (Parent (Parent (Def_Id))))
1634 Error_Msg_N ("\generic units cannot be overloaded", Def_Id);
1637 -- If entity is in standard, then we are in trouble, because
1638 -- it means that we have a library package with a duplicated
1639 -- name. That's hard to recover from, so abort!
1641 if S = Standard_Standard then
1642 raise Unrecoverable_Error;
1644 -- Otherwise we continue with the declaration. Having two
1645 -- identical declarations should not cause us too much trouble!
1653 -- If we fall through, declaration is OK , or OK enough to continue
1655 -- If Def_Id is a discriminant or a record component we are in the
1656 -- midst of inheriting components in a derived record definition.
1657 -- Preserve their Ekind and Etype.
1659 if Ekind (Def_Id) = E_Discriminant
1660 or else Ekind (Def_Id) = E_Component
1664 -- If a type is already set, leave it alone (happens whey a type
1665 -- declaration is reanalyzed following a call to the optimizer)
1667 elsif Present (Etype (Def_Id)) then
1670 -- Otherwise, the kind E_Void insures that premature uses of the entity
1671 -- will be detected. Any_Type insures that no cascaded errors will occur
1674 Set_Ekind (Def_Id, E_Void);
1675 Set_Etype (Def_Id, Any_Type);
1678 -- Inherited discriminants and components in derived record types are
1679 -- immediately visible. Itypes are not.
1681 if Ekind (Def_Id) = E_Discriminant
1682 or else Ekind (Def_Id) = E_Component
1683 or else (No (Corresponding_Remote_Type (Def_Id))
1684 and then not Is_Itype (Def_Id))
1686 Set_Is_Immediately_Visible (Def_Id);
1687 Set_Current_Entity (Def_Id);
1690 Set_Homonym (Def_Id, C);
1691 Append_Entity (Def_Id, S);
1692 Set_Public_Status (Def_Id);
1694 -- Warn if new entity hides an old one
1697 and then Length_Of_Name (Chars (C)) /= 1
1698 and then Present (C)
1699 and then Comes_From_Source (C)
1700 and then Comes_From_Source (Def_Id)
1701 and then In_Extended_Main_Source_Unit (Def_Id)
1703 Error_Msg_Sloc := Sloc (C);
1704 Error_Msg_N ("declaration hides &#?", Def_Id);
1709 -------------------------------------
1710 -- Find_Corresponding_Discriminant --
1711 -------------------------------------
1713 function Find_Corresponding_Discriminant
1718 Par_Disc : Entity_Id;
1719 Old_Disc : Entity_Id;
1720 New_Disc : Entity_Id;
1723 Par_Disc := Original_Record_Component (Original_Discriminant (Id));
1724 Old_Disc := First_Discriminant (Scope (Par_Disc));
1726 if Is_Class_Wide_Type (Typ) then
1727 New_Disc := First_Discriminant (Root_Type (Typ));
1729 New_Disc := First_Discriminant (Typ);
1732 while Present (Old_Disc) and then Present (New_Disc) loop
1733 if Old_Disc = Par_Disc then
1736 Next_Discriminant (Old_Disc);
1737 Next_Discriminant (New_Disc);
1741 -- Should always find it
1743 raise Program_Error;
1744 end Find_Corresponding_Discriminant;
1750 function First_Actual (Node : Node_Id) return Node_Id is
1754 if No (Parameter_Associations (Node)) then
1758 N := First (Parameter_Associations (Node));
1760 if Nkind (N) = N_Parameter_Association then
1761 return First_Named_Actual (Node);
1767 -------------------------
1768 -- Full_Qualified_Name --
1769 -------------------------
1771 function Full_Qualified_Name (E : Entity_Id) return String_Id is
1775 function Internal_Full_Qualified_Name (E : Entity_Id) return String_Id;
1776 -- Compute recursively the qualified name without NUL at the end.
1778 function Internal_Full_Qualified_Name (E : Entity_Id) return String_Id is
1779 Ent : Entity_Id := E;
1780 Parent_Name : String_Id := No_String;
1783 -- Deals properly with child units
1785 if Nkind (Ent) = N_Defining_Program_Unit_Name then
1786 Ent := Defining_Identifier (Ent);
1789 -- Compute recursively the qualification. Only "Standard" has no
1792 if Present (Scope (Scope (Ent))) then
1793 Parent_Name := Internal_Full_Qualified_Name (Scope (Ent));
1796 -- Every entity should have a name except some expanded blocks
1797 -- don't bother about those.
1799 if Chars (Ent) = No_Name then
1803 -- Add a period between Name and qualification
1805 if Parent_Name /= No_String then
1806 Start_String (Parent_Name);
1807 Store_String_Char (Get_Char_Code ('.'));
1813 -- Generates the entity name in upper case
1815 Get_Name_String (Chars (Ent));
1817 Store_String_Chars (Name_Buffer (1 .. Name_Len));
1819 end Internal_Full_Qualified_Name;
1822 Res := Internal_Full_Qualified_Name (E);
1823 Store_String_Char (Get_Char_Code (ASCII.nul));
1825 end Full_Qualified_Name;
1827 -----------------------
1828 -- Gather_Components --
1829 -----------------------
1831 procedure Gather_Components
1833 Comp_List : Node_Id;
1834 Governed_By : List_Id;
1836 Report_Errors : out Boolean)
1840 Discrete_Choice : Node_Id;
1841 Comp_Item : Node_Id;
1843 Discrim : Entity_Id;
1844 Discrim_Name : Node_Id;
1845 Discrim_Value : Node_Id;
1848 Report_Errors := False;
1850 if No (Comp_List) or else Null_Present (Comp_List) then
1853 elsif Present (Component_Items (Comp_List)) then
1854 Comp_Item := First (Component_Items (Comp_List));
1860 while Present (Comp_Item) loop
1862 -- Skip the tag of a tagged record, as well as all items
1863 -- that are not user components (anonymous types, rep clauses,
1864 -- Parent field, controller field).
1866 if Nkind (Comp_Item) = N_Component_Declaration
1867 and then Chars (Defining_Identifier (Comp_Item)) /= Name_uTag
1868 and then Chars (Defining_Identifier (Comp_Item)) /= Name_uParent
1869 and then Chars (Defining_Identifier (Comp_Item)) /= Name_uController
1871 Append_Elmt (Defining_Identifier (Comp_Item), Into);
1877 if No (Variant_Part (Comp_List)) then
1880 Discrim_Name := Name (Variant_Part (Comp_List));
1881 Variant := First_Non_Pragma (Variants (Variant_Part (Comp_List)));
1884 -- Look for the discriminant that governs this variant part.
1885 -- The discriminant *must* be in the Governed_By List
1887 Assoc := First (Governed_By);
1888 Find_Constraint : loop
1889 Discrim := First (Choices (Assoc));
1890 exit Find_Constraint when Chars (Discrim_Name) = Chars (Discrim)
1891 or else (Present (Corresponding_Discriminant (Entity (Discrim)))
1893 Chars (Corresponding_Discriminant (Entity (Discrim)))
1894 = Chars (Discrim_Name))
1895 or else Chars (Original_Record_Component (Entity (Discrim)))
1896 = Chars (Discrim_Name);
1898 if No (Next (Assoc)) then
1899 if not Is_Constrained (Typ)
1900 and then Is_Derived_Type (Typ)
1901 and then Present (Girder_Constraint (Typ))
1904 -- If the type is a tagged type with inherited discriminants,
1905 -- use the girder constraint on the parent in order to find
1906 -- the values of discriminants that are otherwise hidden by an
1907 -- explicit constraint. Renamed discriminants are handled in
1915 D := First_Discriminant (Etype (Typ));
1916 C := First_Elmt (Girder_Constraint (Typ));
1919 and then Present (C)
1921 if Chars (Discrim_Name) = Chars (D) then
1923 Make_Component_Association (Sloc (Typ),
1925 (New_Occurrence_Of (D, Sloc (Typ))),
1926 Duplicate_Subexpr (Node (C)));
1927 exit Find_Constraint;
1930 D := Next_Discriminant (D);
1937 if No (Next (Assoc)) then
1938 Error_Msg_NE (" missing value for discriminant&",
1939 First (Governed_By), Discrim_Name);
1940 Report_Errors := True;
1945 end loop Find_Constraint;
1947 Discrim_Value := Expression (Assoc);
1949 if not Is_OK_Static_Expression (Discrim_Value) then
1951 ("value for discriminant & must be static", Discrim_Value, Discrim);
1952 Report_Errors := True;
1956 Search_For_Discriminant_Value : declare
1962 UI_Discrim_Value : constant Uint := Expr_Value (Discrim_Value);
1965 Find_Discrete_Value : while Present (Variant) loop
1966 Discrete_Choice := First (Discrete_Choices (Variant));
1967 while Present (Discrete_Choice) loop
1969 exit Find_Discrete_Value when
1970 Nkind (Discrete_Choice) = N_Others_Choice;
1972 Get_Index_Bounds (Discrete_Choice, Low, High);
1974 UI_Low := Expr_Value (Low);
1975 UI_High := Expr_Value (High);
1977 exit Find_Discrete_Value when
1978 UI_Low <= UI_Discrim_Value
1980 UI_High >= UI_Discrim_Value;
1982 Next (Discrete_Choice);
1985 Next_Non_Pragma (Variant);
1986 end loop Find_Discrete_Value;
1987 end Search_For_Discriminant_Value;
1989 if No (Variant) then
1991 ("value of discriminant & is out of range", Discrim_Value, Discrim);
1992 Report_Errors := True;
1996 -- If we have found the corresponding choice, recursively add its
1997 -- components to the Into list.
1999 Gather_Components (Empty,
2000 Component_List (Variant), Governed_By, Into, Report_Errors);
2001 end Gather_Components;
2003 ------------------------
2004 -- Get_Actual_Subtype --
2005 ------------------------
2007 function Get_Actual_Subtype (N : Node_Id) return Entity_Id is
2008 Typ : constant Entity_Id := Etype (N);
2009 Utyp : Entity_Id := Underlying_Type (Typ);
2014 if not Present (Utyp) then
2018 -- If what we have is an identifier that references a subprogram
2019 -- formal, or a variable or constant object, then we get the actual
2020 -- subtype from the referenced entity if one has been built.
2022 if Nkind (N) = N_Identifier
2024 (Is_Formal (Entity (N))
2025 or else Ekind (Entity (N)) = E_Constant
2026 or else Ekind (Entity (N)) = E_Variable)
2027 and then Present (Actual_Subtype (Entity (N)))
2029 return Actual_Subtype (Entity (N));
2031 -- Actual subtype of unchecked union is always itself. We never need
2032 -- the "real" actual subtype. If we did, we couldn't get it anyway
2033 -- because the discriminant is not available. The restrictions on
2034 -- Unchecked_Union are designed to make sure that this is OK.
2036 elsif Is_Unchecked_Union (Utyp) then
2039 -- Here for the unconstrained case, we must find actual subtype
2040 -- No actual subtype is available, so we must build it on the fly.
2042 -- Checking the type, not the underlying type, for constrainedness
2043 -- seems to be necessary. Maybe all the tests should be on the type???
2045 elsif (not Is_Constrained (Typ))
2046 and then (Is_Array_Type (Utyp)
2047 or else (Is_Record_Type (Utyp)
2048 and then Has_Discriminants (Utyp)))
2049 and then not Has_Unknown_Discriminants (Utyp)
2050 and then not (Ekind (Utyp) = E_String_Literal_Subtype)
2052 -- Nothing to do if in default expression
2054 if In_Default_Expression then
2057 -- Else build the actual subtype
2060 Decl := Build_Actual_Subtype (Typ, N);
2061 Atyp := Defining_Identifier (Decl);
2063 -- If Build_Actual_Subtype generated a new declaration then use it
2067 -- The actual subtype is an Itype, so analyze the declaration,
2068 -- but do not attach it to the tree, to get the type defined.
2070 Set_Parent (Decl, N);
2071 Set_Is_Itype (Atyp);
2072 Analyze (Decl, Suppress => All_Checks);
2073 Set_Associated_Node_For_Itype (Atyp, N);
2074 Set_Has_Delayed_Freeze (Atyp, False);
2076 -- We need to freeze the actual subtype immediately. This is
2077 -- needed, because otherwise this Itype will not get frozen
2078 -- at all, and it is always safe to freeze on creation because
2079 -- any associated types must be frozen at this point.
2081 Freeze_Itype (Atyp, N);
2084 -- Otherwise we did not build a declaration, so return original
2091 -- For all remaining cases, the actual subtype is the same as
2092 -- the nominal type.
2097 end Get_Actual_Subtype;
2099 -------------------------------------
2100 -- Get_Actual_Subtype_If_Available --
2101 -------------------------------------
2103 function Get_Actual_Subtype_If_Available (N : Node_Id) return Entity_Id is
2104 Typ : constant Entity_Id := Etype (N);
2107 -- If what we have is an identifier that references a subprogram
2108 -- formal, or a variable or constant object, then we get the actual
2109 -- subtype from the referenced entity if one has been built.
2111 if Nkind (N) = N_Identifier
2113 (Is_Formal (Entity (N))
2114 or else Ekind (Entity (N)) = E_Constant
2115 or else Ekind (Entity (N)) = E_Variable)
2116 and then Present (Actual_Subtype (Entity (N)))
2118 return Actual_Subtype (Entity (N));
2120 -- Otherwise the Etype of N is returned unchanged
2125 end Get_Actual_Subtype_If_Available;
2127 -------------------------------
2128 -- Get_Default_External_Name --
2129 -------------------------------
2131 function Get_Default_External_Name (E : Node_Or_Entity_Id) return Node_Id is
2133 Get_Decoded_Name_String (Chars (E));
2135 if Opt.External_Name_Imp_Casing = Uppercase then
2136 Set_Casing (All_Upper_Case);
2138 Set_Casing (All_Lower_Case);
2142 Make_String_Literal (Sloc (E),
2143 Strval => String_From_Name_Buffer);
2145 end Get_Default_External_Name;
2147 ---------------------------
2148 -- Get_Enum_Lit_From_Pos --
2149 ---------------------------
2151 function Get_Enum_Lit_From_Pos
2158 P : constant Nat := UI_To_Int (Pos);
2161 -- In the case where the literal is either of type Wide_Character
2162 -- or Character or of a type derived from them, there needs to be
2163 -- some special handling since there is no explicit chain of
2164 -- literals to search. Instead, an N_Character_Literal node is
2165 -- created with the appropriate Char_Code and Chars fields.
2167 if Root_Type (T) = Standard_Character
2168 or else Root_Type (T) = Standard_Wide_Character
2170 Set_Character_Literal_Name (Char_Code (P));
2172 Make_Character_Literal (Loc,
2174 Char_Literal_Value => Char_Code (P));
2176 -- For all other cases, we have a complete table of literals, and
2177 -- we simply iterate through the chain of literal until the one
2178 -- with the desired position value is found.
2182 Lit := First_Literal (Base_Type (T));
2183 for J in 1 .. P loop
2187 return New_Occurrence_Of (Lit, Loc);
2189 end Get_Enum_Lit_From_Pos;
2191 ----------------------
2192 -- Get_Index_Bounds --
2193 ----------------------
2195 procedure Get_Index_Bounds (N : Node_Id; L, H : out Node_Id) is
2196 Kind : constant Node_Kind := Nkind (N);
2200 if Kind = N_Range then
2202 H := High_Bound (N);
2204 elsif Kind = N_Subtype_Indication then
2205 R := Range_Expression (Constraint (N));
2213 L := Low_Bound (Range_Expression (Constraint (N)));
2214 H := High_Bound (Range_Expression (Constraint (N)));
2217 elsif Is_Entity_Name (N) and then Is_Type (Entity (N)) then
2218 if Error_Posted (Scalar_Range (Entity (N))) then
2222 elsif Nkind (Scalar_Range (Entity (N))) = N_Subtype_Indication then
2223 Get_Index_Bounds (Scalar_Range (Entity (N)), L, H);
2226 L := Low_Bound (Scalar_Range (Entity (N)));
2227 H := High_Bound (Scalar_Range (Entity (N)));
2231 -- N is an expression, indicating a range with one value.
2236 end Get_Index_Bounds;
2238 ------------------------
2239 -- Get_Name_Entity_Id --
2240 ------------------------
2242 function Get_Name_Entity_Id (Id : Name_Id) return Entity_Id is
2244 return Entity_Id (Get_Name_Table_Info (Id));
2245 end Get_Name_Entity_Id;
2247 ---------------------------
2248 -- Get_Referenced_Object --
2249 ---------------------------
2251 function Get_Referenced_Object (N : Node_Id) return Node_Id is
2255 while Is_Entity_Name (R)
2256 and then Present (Renamed_Object (Entity (R)))
2258 R := Renamed_Object (Entity (R));
2262 end Get_Referenced_Object;
2264 -------------------------
2265 -- Get_Subprogram_Body --
2266 -------------------------
2268 function Get_Subprogram_Body (E : Entity_Id) return Node_Id is
2272 Decl := Unit_Declaration_Node (E);
2274 if Nkind (Decl) = N_Subprogram_Body then
2277 else -- Nkind (Decl) = N_Subprogram_Declaration
2279 if Present (Corresponding_Body (Decl)) then
2280 return Unit_Declaration_Node (Corresponding_Body (Decl));
2282 else -- imported subprogram.
2286 end Get_Subprogram_Body;
2288 -----------------------------
2289 -- Get_Task_Body_Procedure --
2290 -----------------------------
2292 function Get_Task_Body_Procedure (E : Entity_Id) return Node_Id is
2294 return Task_Body_Procedure (Declaration_Node (Root_Type (E)));
2295 end Get_Task_Body_Procedure;
2297 --------------------
2298 -- Has_Infinities --
2299 --------------------
2301 function Has_Infinities (E : Entity_Id) return Boolean is
2304 Is_Floating_Point_Type (E)
2305 and then Nkind (Scalar_Range (E)) = N_Range
2306 and then Includes_Infinities (Scalar_Range (E));
2309 ---------------------------
2310 -- Has_Private_Component --
2311 ---------------------------
2313 function Has_Private_Component (Type_Id : Entity_Id) return Boolean is
2314 Btype : Entity_Id := Base_Type (Type_Id);
2315 Component : Entity_Id;
2318 if Error_Posted (Type_Id)
2319 or else Error_Posted (Btype)
2324 if Is_Class_Wide_Type (Btype) then
2325 Btype := Root_Type (Btype);
2328 if Is_Private_Type (Btype) then
2330 UT : constant Entity_Id := Underlying_Type (Btype);
2334 if No (Full_View (Btype)) then
2335 return not Is_Generic_Type (Btype)
2336 and then not Is_Generic_Type (Root_Type (Btype));
2339 return not Is_Generic_Type (Root_Type (Full_View (Btype)));
2343 return not Is_Frozen (UT) and then Has_Private_Component (UT);
2346 elsif Is_Array_Type (Btype) then
2347 return Has_Private_Component (Component_Type (Btype));
2349 elsif Is_Record_Type (Btype) then
2351 Component := First_Component (Btype);
2352 while Present (Component) loop
2354 if Has_Private_Component (Etype (Component)) then
2358 Next_Component (Component);
2363 elsif Is_Protected_Type (Btype)
2364 and then Present (Corresponding_Record_Type (Btype))
2366 return Has_Private_Component (Corresponding_Record_Type (Btype));
2371 end Has_Private_Component;
2373 --------------------------
2374 -- Has_Tagged_Component --
2375 --------------------------
2377 function Has_Tagged_Component (Typ : Entity_Id) return Boolean is
2381 if Is_Private_Type (Typ)
2382 and then Present (Underlying_Type (Typ))
2384 return Has_Tagged_Component (Underlying_Type (Typ));
2386 elsif Is_Array_Type (Typ) then
2387 return Has_Tagged_Component (Component_Type (Typ));
2389 elsif Is_Tagged_Type (Typ) then
2392 elsif Is_Record_Type (Typ) then
2393 Comp := First_Component (Typ);
2395 while Present (Comp) loop
2396 if Has_Tagged_Component (Etype (Comp)) then
2400 Comp := Next_Component (Typ);
2408 end Has_Tagged_Component;
2414 function In_Instance return Boolean is
2415 S : Entity_Id := Current_Scope;
2419 and then S /= Standard_Standard
2421 if (Ekind (S) = E_Function
2422 or else Ekind (S) = E_Package
2423 or else Ekind (S) = E_Procedure)
2424 and then Is_Generic_Instance (S)
2435 ----------------------
2436 -- In_Instance_Body --
2437 ----------------------
2439 function In_Instance_Body return Boolean is
2440 S : Entity_Id := Current_Scope;
2444 and then S /= Standard_Standard
2446 if (Ekind (S) = E_Function
2447 or else Ekind (S) = E_Procedure)
2448 and then Is_Generic_Instance (S)
2452 elsif Ekind (S) = E_Package
2453 and then In_Package_Body (S)
2454 and then Is_Generic_Instance (S)
2463 end In_Instance_Body;
2465 -----------------------------
2466 -- In_Instance_Not_Visible --
2467 -----------------------------
2469 function In_Instance_Not_Visible return Boolean is
2470 S : Entity_Id := Current_Scope;
2474 and then S /= Standard_Standard
2476 if (Ekind (S) = E_Function
2477 or else Ekind (S) = E_Procedure)
2478 and then Is_Generic_Instance (S)
2482 elsif Ekind (S) = E_Package
2483 and then (In_Package_Body (S) or else In_Private_Part (S))
2484 and then Is_Generic_Instance (S)
2493 end In_Instance_Not_Visible;
2495 ------------------------------
2496 -- In_Instance_Visible_Part --
2497 ------------------------------
2499 function In_Instance_Visible_Part return Boolean is
2500 S : Entity_Id := Current_Scope;
2504 and then S /= Standard_Standard
2506 if Ekind (S) = E_Package
2507 and then Is_Generic_Instance (S)
2508 and then not In_Package_Body (S)
2509 and then not In_Private_Part (S)
2518 end In_Instance_Visible_Part;
2520 --------------------------------------
2521 -- In_Subprogram_Or_Concurrent_Unit --
2522 --------------------------------------
2524 function In_Subprogram_Or_Concurrent_Unit return Boolean is
2529 -- Use scope chain to check successively outer scopes
2535 if K in Subprogram_Kind
2536 or else K in Concurrent_Kind
2537 or else K = E_Generic_Procedure
2538 or else K = E_Generic_Function
2542 elsif E = Standard_Standard then
2549 end In_Subprogram_Or_Concurrent_Unit;
2551 ---------------------
2552 -- In_Visible_Part --
2553 ---------------------
2555 function In_Visible_Part (Scope_Id : Entity_Id) return Boolean is
2558 Is_Package (Scope_Id)
2559 and then In_Open_Scopes (Scope_Id)
2560 and then not In_Package_Body (Scope_Id)
2561 and then not In_Private_Part (Scope_Id);
2562 end In_Visible_Part;
2568 function Is_AAMP_Float (E : Entity_Id) return Boolean is
2570 pragma Assert (Is_Type (E));
2572 return AAMP_On_Target
2573 and then Is_Floating_Point_Type (E)
2574 and then E = Base_Type (E);
2577 -------------------------
2578 -- Is_Actual_Parameter --
2579 -------------------------
2581 function Is_Actual_Parameter (N : Node_Id) return Boolean is
2582 PK : constant Node_Kind := Nkind (Parent (N));
2586 when N_Parameter_Association =>
2587 return N = Explicit_Actual_Parameter (Parent (N));
2589 when N_Function_Call | N_Procedure_Call_Statement =>
2590 return Is_List_Member (N)
2592 List_Containing (N) = Parameter_Associations (Parent (N));
2597 end Is_Actual_Parameter;
2599 ---------------------
2600 -- Is_Aliased_View --
2601 ---------------------
2603 function Is_Aliased_View (Obj : Node_Id) return Boolean is
2607 if Is_Entity_Name (Obj) then
2609 -- Shouldn't we check that we really have an object here?
2610 -- If we do, then a-caldel.adb blows up mysteriously ???
2614 return Is_Aliased (E)
2615 or else (Present (Renamed_Object (E))
2616 and then Is_Aliased_View (Renamed_Object (E)))
2618 or else ((Is_Formal (E)
2619 or else Ekind (E) = E_Generic_In_Out_Parameter
2620 or else Ekind (E) = E_Generic_In_Parameter)
2621 and then Is_Tagged_Type (Etype (E)))
2623 or else ((Ekind (E) = E_Task_Type or else
2624 Ekind (E) = E_Protected_Type)
2625 and then In_Open_Scopes (E))
2627 -- Current instance of type
2629 or else (Is_Type (E) and then E = Current_Scope)
2630 or else (Is_Incomplete_Or_Private_Type (E)
2631 and then Full_View (E) = Current_Scope);
2633 elsif Nkind (Obj) = N_Selected_Component then
2634 return Is_Aliased (Entity (Selector_Name (Obj)));
2636 elsif Nkind (Obj) = N_Indexed_Component then
2637 return Has_Aliased_Components (Etype (Prefix (Obj)))
2639 (Is_Access_Type (Etype (Prefix (Obj)))
2641 Has_Aliased_Components
2642 (Designated_Type (Etype (Prefix (Obj)))));
2644 elsif Nkind (Obj) = N_Unchecked_Type_Conversion
2645 or else Nkind (Obj) = N_Type_Conversion
2647 return Is_Tagged_Type (Etype (Obj))
2648 or else Is_Aliased_View (Expression (Obj));
2650 elsif Nkind (Obj) = N_Explicit_Dereference then
2651 return Nkind (Original_Node (Obj)) /= N_Function_Call;
2656 end Is_Aliased_View;
2658 ----------------------
2659 -- Is_Atomic_Object --
2660 ----------------------
2662 function Is_Atomic_Object (N : Node_Id) return Boolean is
2664 function Object_Has_Atomic_Components (N : Node_Id) return Boolean;
2665 -- Determines if given object has atomic components
2667 function Is_Atomic_Prefix (N : Node_Id) return Boolean;
2668 -- If prefix is an implicit dereference, examine designated type.
2670 function Is_Atomic_Prefix (N : Node_Id) return Boolean is
2672 if Is_Access_Type (Etype (N)) then
2674 Has_Atomic_Components (Designated_Type (Etype (N)));
2676 return Object_Has_Atomic_Components (N);
2678 end Is_Atomic_Prefix;
2680 function Object_Has_Atomic_Components (N : Node_Id) return Boolean is
2682 if Has_Atomic_Components (Etype (N))
2683 or else Is_Atomic (Etype (N))
2687 elsif Is_Entity_Name (N)
2688 and then (Has_Atomic_Components (Entity (N))
2689 or else Is_Atomic (Entity (N)))
2693 elsif Nkind (N) = N_Indexed_Component
2694 or else Nkind (N) = N_Selected_Component
2696 return Is_Atomic_Prefix (Prefix (N));
2701 end Object_Has_Atomic_Components;
2703 -- Start of processing for Is_Atomic_Object
2706 if Is_Atomic (Etype (N))
2707 or else (Is_Entity_Name (N) and then Is_Atomic (Entity (N)))
2711 elsif Nkind (N) = N_Indexed_Component
2712 or else Nkind (N) = N_Selected_Component
2714 return Is_Atomic_Prefix (Prefix (N));
2719 end Is_Atomic_Object;
2721 ----------------------------------------------
2722 -- Is_Dependent_Component_Of_Mutable_Object --
2723 ----------------------------------------------
2725 function Is_Dependent_Component_Of_Mutable_Object
2730 Prefix_Type : Entity_Id;
2731 P_Aliased : Boolean := False;
2734 function Has_Dependent_Constraint (Comp : Entity_Id) return Boolean;
2735 -- Returns True if and only if Comp has a constrained subtype
2736 -- that depends on a discriminant.
2738 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean;
2739 -- Returns True if and only if Comp is declared within a variant part.
2741 ------------------------------
2742 -- Has_Dependent_Constraint --
2743 ------------------------------
2745 function Has_Dependent_Constraint (Comp : Entity_Id) return Boolean is
2746 Comp_Decl : constant Node_Id := Parent (Comp);
2747 Subt_Indic : constant Node_Id := Subtype_Indication (Comp_Decl);
2752 if Nkind (Subt_Indic) = N_Subtype_Indication then
2753 Constr := Constraint (Subt_Indic);
2755 if Nkind (Constr) = N_Index_Or_Discriminant_Constraint then
2756 Assn := First (Constraints (Constr));
2757 while Present (Assn) loop
2758 case Nkind (Assn) is
2759 when N_Subtype_Indication |
2763 if Depends_On_Discriminant (Assn) then
2767 when N_Discriminant_Association =>
2768 if Depends_On_Discriminant (Expression (Assn)) then
2783 end Has_Dependent_Constraint;
2785 --------------------------------
2786 -- Is_Declared_Within_Variant --
2787 --------------------------------
2789 function Is_Declared_Within_Variant (Comp : Entity_Id) return Boolean is
2790 Comp_Decl : constant Node_Id := Parent (Comp);
2791 Comp_List : constant Node_Id := Parent (Comp_Decl);
2794 return Nkind (Parent (Comp_List)) = N_Variant;
2795 end Is_Declared_Within_Variant;
2797 -- Start of processing for Is_Dependent_Component_Of_Mutable_Object
2800 if Is_Variable (Object) then
2802 if Nkind (Object) = N_Selected_Component then
2803 P := Prefix (Object);
2804 Prefix_Type := Etype (P);
2806 if Is_Entity_Name (P) then
2808 if Ekind (Entity (P)) = E_Generic_In_Out_Parameter then
2809 Prefix_Type := Base_Type (Prefix_Type);
2812 if Is_Aliased (Entity (P)) then
2817 -- Check for prefix being an aliased component ???
2821 if Is_Access_Type (Prefix_Type)
2822 or else Nkind (P) = N_Explicit_Dereference
2828 Original_Record_Component (Entity (Selector_Name (Object)));
2830 if not Is_Constrained (Prefix_Type)
2831 and then not Is_Indefinite_Subtype (Prefix_Type)
2832 and then (Is_Declared_Within_Variant (Comp)
2833 or else Has_Dependent_Constraint (Comp))
2834 and then not P_Aliased
2840 Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
2844 elsif Nkind (Object) = N_Indexed_Component
2845 or else Nkind (Object) = N_Slice
2847 return Is_Dependent_Component_Of_Mutable_Object (Prefix (Object));
2852 end Is_Dependent_Component_Of_Mutable_Object;
2858 function Is_False (U : Uint) return Boolean is
2863 ---------------------------
2864 -- Is_Fixed_Model_Number --
2865 ---------------------------
2867 function Is_Fixed_Model_Number (U : Ureal; T : Entity_Id) return Boolean is
2868 S : constant Ureal := Small_Value (T);
2869 M : Urealp.Save_Mark;
2874 R := (U = UR_Trunc (U / S) * S);
2877 end Is_Fixed_Model_Number;
2879 -------------------------------
2880 -- Is_Fully_Initialized_Type --
2881 -------------------------------
2883 function Is_Fully_Initialized_Type (Typ : Entity_Id) return Boolean is
2885 if Is_Scalar_Type (Typ) then
2888 elsif Is_Access_Type (Typ) then
2891 elsif Is_Array_Type (Typ) then
2892 if Is_Fully_Initialized_Type (Component_Type (Typ)) then
2896 -- An interesting case, if we have a constrained type one of whose
2897 -- bounds is known to be null, then there are no elements to be
2898 -- initialized, so all the elements are initialized!
2900 if Is_Constrained (Typ) then
2903 Indx_Typ : Entity_Id;
2907 Indx := First_Index (Typ);
2908 while Present (Indx) loop
2910 if Etype (Indx) = Any_Type then
2913 -- If index is a range, use directly.
2915 elsif Nkind (Indx) = N_Range then
2916 Lbd := Low_Bound (Indx);
2917 Hbd := High_Bound (Indx);
2920 Indx_Typ := Etype (Indx);
2922 if Is_Private_Type (Indx_Typ) then
2923 Indx_Typ := Full_View (Indx_Typ);
2926 if No (Indx_Typ) then
2929 Lbd := Type_Low_Bound (Indx_Typ);
2930 Hbd := Type_High_Bound (Indx_Typ);
2934 if Compile_Time_Known_Value (Lbd)
2935 and then Compile_Time_Known_Value (Hbd)
2937 if Expr_Value (Hbd) < Expr_Value (Lbd) then
2949 elsif Is_Record_Type (Typ) then
2954 Ent := First_Entity (Typ);
2956 while Present (Ent) loop
2957 if Ekind (Ent) = E_Component
2958 and then (No (Parent (Ent))
2959 or else No (Expression (Parent (Ent))))
2960 and then not Is_Fully_Initialized_Type (Etype (Ent))
2971 elsif Is_Concurrent_Type (Typ) then
2974 elsif Is_Private_Type (Typ) then
2976 U : constant Entity_Id := Underlying_Type (Typ);
2982 return Is_Fully_Initialized_Type (U);
2989 end Is_Fully_Initialized_Type;
2991 ----------------------------
2992 -- Is_Inherited_Operation --
2993 ----------------------------
2995 function Is_Inherited_Operation (E : Entity_Id) return Boolean is
2996 Kind : constant Node_Kind := Nkind (Parent (E));
2999 pragma Assert (Is_Overloadable (E));
3000 return Kind = N_Full_Type_Declaration
3001 or else Kind = N_Private_Extension_Declaration
3002 or else Kind = N_Subtype_Declaration
3003 or else (Ekind (E) = E_Enumeration_Literal
3004 and then Is_Derived_Type (Etype (E)));
3005 end Is_Inherited_Operation;
3007 -----------------------------
3008 -- Is_Library_Level_Entity --
3009 -----------------------------
3011 function Is_Library_Level_Entity (E : Entity_Id) return Boolean is
3013 return Enclosing_Dynamic_Scope (E) = Standard_Standard;
3014 end Is_Library_Level_Entity;
3016 ---------------------------------
3017 -- Is_Local_Variable_Reference --
3018 ---------------------------------
3020 function Is_Local_Variable_Reference (Expr : Node_Id) return Boolean is
3022 if not Is_Entity_Name (Expr) then
3027 Ent : constant Entity_Id := Entity (Expr);
3028 Sub : constant Entity_Id := Enclosing_Subprogram (Ent);
3031 if Ekind (Ent) /= E_Variable
3033 Ekind (Ent) /= E_In_Out_Parameter
3038 return Present (Sub) and then Sub = Current_Subprogram;
3042 end Is_Local_Variable_Reference;
3044 -------------------------
3045 -- Is_Object_Reference --
3046 -------------------------
3048 function Is_Object_Reference (N : Node_Id) return Boolean is
3050 if Is_Entity_Name (N) then
3051 return Is_Object (Entity (N));
3055 when N_Indexed_Component | N_Slice =>
3058 -- In Ada95, a function call is a constant object.
3060 when N_Function_Call =>
3063 when N_Selected_Component =>
3064 return Is_Object_Reference (Selector_Name (N));
3066 when N_Explicit_Dereference =>
3069 -- An unchecked type conversion is considered to be an object if
3070 -- the operand is an object (this construction arises only as a
3071 -- result of expansion activities).
3073 when N_Unchecked_Type_Conversion =>
3080 end Is_Object_Reference;
3082 -----------------------------------
3083 -- Is_OK_Variable_For_Out_Formal --
3084 -----------------------------------
3086 function Is_OK_Variable_For_Out_Formal (AV : Node_Id) return Boolean is
3088 Note_Possible_Modification (AV);
3090 -- We must reject parenthesized variable names. The check for
3091 -- Comes_From_Source is present because there are currently
3092 -- cases where the compiler violates this rule (e.g. passing
3093 -- a task object to its controlled Initialize routine).
3095 if Paren_Count (AV) > 0 and then Comes_From_Source (AV) then
3098 -- A variable is always allowed
3100 elsif Is_Variable (AV) then
3103 -- Unchecked conversions are allowed only if they come from the
3104 -- generated code, which sometimes uses unchecked conversions for
3105 -- out parameters in cases where code generation is unaffected.
3106 -- We tell source unchecked conversions by seeing if they are
3107 -- rewrites of an original UC function call, or of an explicit
3108 -- conversion of a function call.
3110 elsif Nkind (AV) = N_Unchecked_Type_Conversion then
3111 if Nkind (Original_Node (AV)) = N_Function_Call then
3114 elsif Comes_From_Source (AV)
3115 and then Nkind (Original_Node (Expression (AV))) = N_Function_Call
3123 -- Normal type conversions are allowed if argument is a variable
3125 elsif Nkind (AV) = N_Type_Conversion then
3126 if Is_Variable (Expression (AV))
3127 and then Paren_Count (Expression (AV)) = 0
3129 Note_Possible_Modification (Expression (AV));
3132 -- We also allow a non-parenthesized expression that raises
3133 -- constraint error if it rewrites what used to be a variable
3135 elsif Raises_Constraint_Error (Expression (AV))
3136 and then Paren_Count (Expression (AV)) = 0
3137 and then Is_Variable (Original_Node (Expression (AV)))
3141 -- Type conversion of something other than a variable
3147 -- If this node is rewritten, then test the original form, if that is
3148 -- OK, then we consider the rewritten node OK (for example, if the
3149 -- original node is a conversion, then Is_Variable will not be true
3150 -- but we still want to allow the conversion if it converts a variable.
3152 elsif Original_Node (AV) /= AV then
3153 return Is_OK_Variable_For_Out_Formal (Original_Node (AV));
3155 -- All other non-variables are rejected
3160 end Is_OK_Variable_For_Out_Formal;
3162 -----------------------------
3163 -- Is_RCI_Pkg_Spec_Or_Body --
3164 -----------------------------
3166 function Is_RCI_Pkg_Spec_Or_Body (Cunit : Node_Id) return Boolean is
3168 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean;
3169 -- Return True if the unit of Cunit is an RCI package declaration
3171 ---------------------------
3172 -- Is_RCI_Pkg_Decl_Cunit --
3173 ---------------------------
3175 function Is_RCI_Pkg_Decl_Cunit (Cunit : Node_Id) return Boolean is
3176 The_Unit : constant Node_Id := Unit (Cunit);
3179 if Nkind (The_Unit) /= N_Package_Declaration then
3182 return Is_Remote_Call_Interface (Defining_Entity (The_Unit));
3183 end Is_RCI_Pkg_Decl_Cunit;
3185 -- Start of processing for Is_RCI_Pkg_Spec_Or_Body
3188 return Is_RCI_Pkg_Decl_Cunit (Cunit)
3190 (Nkind (Unit (Cunit)) = N_Package_Body
3191 and then Is_RCI_Pkg_Decl_Cunit (Library_Unit (Cunit)));
3192 end Is_RCI_Pkg_Spec_Or_Body;
3194 -----------------------------------------
3195 -- Is_Remote_Access_To_Class_Wide_Type --
3196 -----------------------------------------
3198 function Is_Remote_Access_To_Class_Wide_Type
3204 function Comes_From_Limited_Private_Type_Declaration
3207 -- Check if the original declaration is a limited private one and
3208 -- if all the derivations have been using private extensions.
3210 -------------------------------------------------
3211 -- Comes_From_Limited_Private_Type_Declaration --
3212 -------------------------------------------------
3214 function Comes_From_Limited_Private_Type_Declaration (E : in Entity_Id)
3217 N : constant Node_Id := Declaration_Node (E);
3219 if Nkind (N) = N_Private_Type_Declaration
3220 and then Limited_Present (N)
3225 if Nkind (N) = N_Private_Extension_Declaration then
3226 return Comes_From_Limited_Private_Type_Declaration (Etype (E));
3230 end Comes_From_Limited_Private_Type_Declaration;
3232 -- Start of processing for Is_Remote_Access_To_Class_Wide_Type
3235 if not (Is_Remote_Call_Interface (E)
3236 or else Is_Remote_Types (E))
3237 or else Ekind (E) /= E_General_Access_Type
3242 D := Designated_Type (E);
3244 if Ekind (D) /= E_Class_Wide_Type then
3248 return Comes_From_Limited_Private_Type_Declaration
3249 (Defining_Identifier (Parent (D)));
3250 end Is_Remote_Access_To_Class_Wide_Type;
3252 -----------------------------------------
3253 -- Is_Remote_Access_To_Subprogram_Type --
3254 -----------------------------------------
3256 function Is_Remote_Access_To_Subprogram_Type
3261 return (Ekind (E) = E_Access_Subprogram_Type
3262 or else (Ekind (E) = E_Record_Type
3263 and then Present (Corresponding_Remote_Type (E))))
3264 and then (Is_Remote_Call_Interface (E)
3265 or else Is_Remote_Types (E));
3266 end Is_Remote_Access_To_Subprogram_Type;
3268 --------------------
3269 -- Is_Remote_Call --
3270 --------------------
3272 function Is_Remote_Call (N : Node_Id) return Boolean is
3274 if Nkind (N) /= N_Procedure_Call_Statement
3275 and then Nkind (N) /= N_Function_Call
3277 -- An entry call cannot be remote
3281 elsif Nkind (Name (N)) in N_Has_Entity
3282 and then Is_Remote_Call_Interface (Entity (Name (N)))
3284 -- A subprogram declared in the spec of a RCI package is remote
3288 elsif Nkind (Name (N)) = N_Explicit_Dereference
3289 and then Is_Remote_Access_To_Subprogram_Type
3290 (Etype (Prefix (Name (N))))
3292 -- The dereference of a RAS is a remote call
3296 elsif Present (Controlling_Argument (N))
3297 and then Is_Remote_Access_To_Class_Wide_Type
3298 (Etype (Controlling_Argument (N)))
3300 -- Any primitive operation call with a controlling argument of
3301 -- a RACW type is a remote call.
3306 -- All other calls are local calls
3311 ----------------------
3312 -- Is_Selector_Name --
3313 ----------------------
3315 function Is_Selector_Name (N : Node_Id) return Boolean is
3318 if not Is_List_Member (N) then
3320 P : constant Node_Id := Parent (N);
3321 K : constant Node_Kind := Nkind (P);
3325 (K = N_Expanded_Name or else
3326 K = N_Generic_Association or else
3327 K = N_Parameter_Association or else
3328 K = N_Selected_Component)
3329 and then Selector_Name (P) = N;
3334 L : constant List_Id := List_Containing (N);
3335 P : constant Node_Id := Parent (L);
3338 return (Nkind (P) = N_Discriminant_Association
3339 and then Selector_Names (P) = L)
3341 (Nkind (P) = N_Component_Association
3342 and then Choices (P) = L);
3345 end Is_Selector_Name;
3351 function Is_Statement (N : Node_Id) return Boolean is
3354 Nkind (N) in N_Statement_Other_Than_Procedure_Call
3355 or else Nkind (N) = N_Procedure_Call_Statement;
3362 function Is_Transfer (N : Node_Id) return Boolean is
3363 Kind : constant Node_Kind := Nkind (N);
3366 if Kind = N_Return_Statement
3368 Kind = N_Goto_Statement
3370 Kind = N_Raise_Statement
3372 Kind = N_Requeue_Statement
3376 elsif (Kind = N_Exit_Statement or else Kind in N_Raise_xxx_Error)
3377 and then No (Condition (N))
3381 elsif Kind = N_Procedure_Call_Statement
3382 and then Is_Entity_Name (Name (N))
3383 and then Present (Entity (Name (N)))
3384 and then No_Return (Entity (Name (N)))
3388 elsif Nkind (Original_Node (N)) = N_Raise_Statement then
3400 function Is_True (U : Uint) return Boolean is
3409 function Is_Variable (N : Node_Id) return Boolean is
3411 Orig_Node : constant Node_Id := Original_Node (N);
3412 -- We do the test on the original node, since this is basically a
3413 -- test of syntactic categories, so it must not be disturbed by
3414 -- whatever rewriting might have occurred. For example, an aggregate,
3415 -- which is certainly NOT a variable, could be turned into a variable
3418 function In_Protected_Function (E : Entity_Id) return Boolean;
3419 -- Within a protected function, the private components of the
3420 -- enclosing protected type are constants. A function nested within
3421 -- a (protected) procedure is not itself protected.
3423 function Is_Variable_Prefix (P : Node_Id) return Boolean;
3424 -- Prefixes can involve implicit dereferences, in which case we
3425 -- must test for the case of a reference of a constant access
3426 -- type, which can never be a variable.
3428 function In_Protected_Function (E : Entity_Id) return Boolean is
3429 Prot : constant Entity_Id := Scope (E);
3433 if not Is_Protected_Type (Prot) then
3438 while Present (S) and then S /= Prot loop
3440 if Ekind (S) = E_Function
3441 and then Scope (S) = Prot
3451 end In_Protected_Function;
3453 function Is_Variable_Prefix (P : Node_Id) return Boolean is
3455 if Is_Access_Type (Etype (P)) then
3456 return not Is_Access_Constant (Root_Type (Etype (P)));
3458 return Is_Variable (P);
3460 end Is_Variable_Prefix;
3462 -- Start of processing for Is_Variable
3465 -- Definitely OK if Assignment_OK is set. Since this is something that
3466 -- only gets set for expanded nodes, the test is on N, not Orig_Node.
3468 if Nkind (N) in N_Subexpr and then Assignment_OK (N) then
3471 -- Normally we go to the original node, but there is one exception
3472 -- where we use the rewritten node, namely when it is an explicit
3473 -- dereference. The generated code may rewrite a prefix which is an
3474 -- access type with an explicit dereference. The dereference is a
3475 -- variable, even though the original node may not be (since it could
3476 -- be a constant of the access type).
3478 elsif Nkind (N) = N_Explicit_Dereference
3479 and then Nkind (Orig_Node) /= N_Explicit_Dereference
3480 and then Is_Access_Type (Etype (Orig_Node))
3482 return Is_Variable_Prefix (Original_Node (Prefix (N)));
3484 -- All remaining checks use the original node
3486 elsif Is_Entity_Name (Orig_Node) then
3488 E : constant Entity_Id := Entity (Orig_Node);
3489 K : constant Entity_Kind := Ekind (E);
3492 return (K = E_Variable
3493 and then Nkind (Parent (E)) /= N_Exception_Handler)
3494 or else (K = E_Component
3495 and then not In_Protected_Function (E))
3496 or else K = E_Out_Parameter
3497 or else K = E_In_Out_Parameter
3498 or else K = E_Generic_In_Out_Parameter
3500 -- Current instance of type:
3502 or else (Is_Type (E) and then In_Open_Scopes (E))
3503 or else (Is_Incomplete_Or_Private_Type (E)
3504 and then In_Open_Scopes (Full_View (E)));
3508 case Nkind (Orig_Node) is
3509 when N_Indexed_Component | N_Slice =>
3510 return Is_Variable_Prefix (Prefix (Orig_Node));
3512 when N_Selected_Component =>
3513 return Is_Variable_Prefix (Prefix (Orig_Node))
3514 and then Is_Variable (Selector_Name (Orig_Node));
3516 -- For an explicit dereference, we must check whether the type
3517 -- is ACCESS CONSTANT, since if it is, then it is not a variable.
3519 when N_Explicit_Dereference =>
3520 return Is_Access_Type (Etype (Prefix (Orig_Node)))
3522 Is_Access_Constant (Root_Type (Etype (Prefix (Orig_Node))));
3524 -- The type conversion is the case where we do not deal with the
3525 -- context dependent special case of an actual parameter. Thus
3526 -- the type conversion is only considered a variable for the
3527 -- purposes of this routine if the target type is tagged. However,
3528 -- a type conversion is considered to be a variable if it does not
3529 -- come from source (this deals for example with the conversions
3530 -- of expressions to their actual subtypes).
3532 when N_Type_Conversion =>
3533 return Is_Variable (Expression (Orig_Node))
3535 (not Comes_From_Source (Orig_Node)
3537 (Is_Tagged_Type (Etype (Subtype_Mark (Orig_Node)))
3539 Is_Tagged_Type (Etype (Expression (Orig_Node)))));
3541 -- GNAT allows an unchecked type conversion as a variable. This
3542 -- only affects the generation of internal expanded code, since
3543 -- calls to instantiations of Unchecked_Conversion are never
3544 -- considered variables (since they are function calls).
3545 -- This is also true for expression actions.
3547 when N_Unchecked_Type_Conversion =>
3548 return Is_Variable (Expression (Orig_Node));
3556 ------------------------
3557 -- Is_Volatile_Object --
3558 ------------------------
3560 function Is_Volatile_Object (N : Node_Id) return Boolean is
3562 function Object_Has_Volatile_Components (N : Node_Id) return Boolean;
3563 -- Determines if given object has volatile components
3565 function Is_Volatile_Prefix (N : Node_Id) return Boolean;
3566 -- If prefix is an implicit dereference, examine designated type.
3568 function Is_Volatile_Prefix (N : Node_Id) return Boolean is
3570 if Is_Access_Type (Etype (N)) then
3571 return Has_Volatile_Components (Designated_Type (Etype (N)));
3573 return Object_Has_Volatile_Components (N);
3575 end Is_Volatile_Prefix;
3577 function Object_Has_Volatile_Components (N : Node_Id) return Boolean is
3579 if Is_Volatile (Etype (N))
3580 or else Has_Volatile_Components (Etype (N))
3584 elsif Is_Entity_Name (N)
3585 and then (Has_Volatile_Components (Entity (N))
3586 or else Is_Volatile (Entity (N)))
3590 elsif Nkind (N) = N_Indexed_Component
3591 or else Nkind (N) = N_Selected_Component
3593 return Is_Volatile_Prefix (Prefix (N));
3598 end Object_Has_Volatile_Components;
3600 -- Start of processing for Is_Volatile_Object
3603 if Is_Volatile (Etype (N))
3604 or else (Is_Entity_Name (N) and then Is_Volatile (Entity (N)))
3608 elsif Nkind (N) = N_Indexed_Component
3609 or else Nkind (N) = N_Selected_Component
3611 return Is_Volatile_Prefix (Prefix (N));
3616 end Is_Volatile_Object;
3618 --------------------------
3619 -- Kill_Size_Check_Code --
3620 --------------------------
3622 procedure Kill_Size_Check_Code (E : Entity_Id) is
3624 if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
3625 and then Present (Size_Check_Code (E))
3627 Remove (Size_Check_Code (E));
3628 Set_Size_Check_Code (E, Empty);
3630 end Kill_Size_Check_Code;
3632 -------------------------
3633 -- New_External_Entity --
3634 -------------------------
3636 function New_External_Entity
3637 (Kind : Entity_Kind;
3638 Scope_Id : Entity_Id;
3639 Sloc_Value : Source_Ptr;
3640 Related_Id : Entity_Id;
3642 Suffix_Index : Nat := 0;
3643 Prefix : Character := ' ')
3646 N : constant Entity_Id :=
3647 Make_Defining_Identifier (Sloc_Value,
3649 (Chars (Related_Id), Suffix, Suffix_Index, Prefix));
3652 Set_Ekind (N, Kind);
3653 Set_Is_Internal (N, True);
3654 Append_Entity (N, Scope_Id);
3655 Set_Public_Status (N);
3657 if Kind in Type_Kind then
3658 Init_Size_Align (N);
3662 end New_External_Entity;
3664 -------------------------
3665 -- New_Internal_Entity --
3666 -------------------------
3668 function New_Internal_Entity
3669 (Kind : Entity_Kind;
3670 Scope_Id : Entity_Id;
3671 Sloc_Value : Source_Ptr;
3672 Id_Char : Character)
3675 N : constant Entity_Id :=
3676 Make_Defining_Identifier (Sloc_Value, New_Internal_Name (Id_Char));
3679 Set_Ekind (N, Kind);
3680 Set_Is_Internal (N, True);
3681 Append_Entity (N, Scope_Id);
3683 if Kind in Type_Kind then
3684 Init_Size_Align (N);
3688 end New_Internal_Entity;
3694 function Next_Actual (Actual_Id : Node_Id) return Node_Id is
3698 -- If we are pointing at a positional parameter, it is a member of
3699 -- a node list (the list of parameters), and the next parameter
3700 -- is the next node on the list, unless we hit a parameter
3701 -- association, in which case we shift to using the chain whose
3702 -- head is the First_Named_Actual in the parent, and then is
3703 -- threaded using the Next_Named_Actual of the Parameter_Association.
3704 -- All this fiddling is because the original node list is in the
3705 -- textual call order, and what we need is the declaration order.
3707 if Is_List_Member (Actual_Id) then
3708 N := Next (Actual_Id);
3710 if Nkind (N) = N_Parameter_Association then
3711 return First_Named_Actual (Parent (Actual_Id));
3717 return Next_Named_Actual (Parent (Actual_Id));
3721 procedure Next_Actual (Actual_Id : in out Node_Id) is
3723 Actual_Id := Next_Actual (Actual_Id);
3726 -----------------------
3727 -- Normalize_Actuals --
3728 -----------------------
3730 -- Chain actuals according to formals of subprogram. If there are
3731 -- no named associations, the chain is simply the list of Parameter
3732 -- Associations, since the order is the same as the declaration order.
3733 -- If there are named associations, then the First_Named_Actual field
3734 -- in the N_Procedure_Call_Statement node or N_Function_Call node
3735 -- points to the Parameter_Association node for the parameter that
3736 -- comes first in declaration order. The remaining named parameters
3737 -- are then chained in declaration order using Next_Named_Actual.
3739 -- This routine also verifies that the number of actuals is compatible
3740 -- with the number and default values of formals, but performs no type
3741 -- checking (type checking is done by the caller).
3743 -- If the matching succeeds, Success is set to True, and the caller
3744 -- proceeds with type-checking. If the match is unsuccessful, then
3745 -- Success is set to False, and the caller attempts a different
3746 -- interpretation, if there is one.
3748 -- If the flag Report is on, the call is not overloaded, and a failure
3749 -- to match can be reported here, rather than in the caller.
3751 procedure Normalize_Actuals
3755 Success : out Boolean)
3757 Actuals : constant List_Id := Parameter_Associations (N);
3758 Actual : Node_Id := Empty;
3760 Last : Node_Id := Empty;
3761 First_Named : Node_Id := Empty;
3764 Formals_To_Match : Integer := 0;
3765 Actuals_To_Match : Integer := 0;
3767 procedure Chain (A : Node_Id);
3768 -- Add named actual at the proper place in the list, using the
3769 -- Next_Named_Actual link.
3771 function Reporting return Boolean;
3772 -- Determines if an error is to be reported. To report an error, we
3773 -- need Report to be True, and also we do not report errors caused
3774 -- by calls to Init_Proc's that occur within other Init_Proc's. Such
3775 -- errors must always be cascaded errors, since if all the types are
3776 -- declared correctly, the compiler will certainly build decent calls!
3778 procedure Chain (A : Node_Id) is
3782 -- Call node points to first actual in list.
3784 Set_First_Named_Actual (N, Explicit_Actual_Parameter (A));
3787 Set_Next_Named_Actual (Last, Explicit_Actual_Parameter (A));
3791 Set_Next_Named_Actual (Last, Empty);
3794 function Reporting return Boolean is
3799 elsif not Within_Init_Proc then
3802 elsif Chars (Entity (Name (N))) = Name_uInit_Proc then
3810 -- Start of processing for Normalize_Actuals
3813 if Is_Access_Type (S) then
3815 -- The name in the call is a function call that returns an access
3816 -- to subprogram. The designated type has the list of formals.
3818 Formal := First_Formal (Designated_Type (S));
3820 Formal := First_Formal (S);
3823 while Present (Formal) loop
3824 Formals_To_Match := Formals_To_Match + 1;
3825 Next_Formal (Formal);
3828 -- Find if there is a named association, and verify that no positional
3829 -- associations appear after named ones.
3831 if Present (Actuals) then
3832 Actual := First (Actuals);
3835 while Present (Actual)
3836 and then Nkind (Actual) /= N_Parameter_Association
3838 Actuals_To_Match := Actuals_To_Match + 1;
3842 if No (Actual) and Actuals_To_Match = Formals_To_Match then
3844 -- Most common case: positional notation, no defaults
3849 elsif Actuals_To_Match > Formals_To_Match then
3851 -- Too many actuals: will not work.
3854 Error_Msg_N ("too many arguments in call", N);
3861 First_Named := Actual;
3863 while Present (Actual) loop
3864 if Nkind (Actual) /= N_Parameter_Association then
3866 ("positional parameters not allowed after named ones", Actual);
3871 Actuals_To_Match := Actuals_To_Match + 1;
3877 if Present (Actuals) then
3878 Actual := First (Actuals);
3881 Formal := First_Formal (S);
3883 while Present (Formal) loop
3885 -- Match the formals in order. If the corresponding actual
3886 -- is positional, nothing to do. Else scan the list of named
3887 -- actuals to find the one with the right name.
3890 and then Nkind (Actual) /= N_Parameter_Association
3893 Actuals_To_Match := Actuals_To_Match - 1;
3894 Formals_To_Match := Formals_To_Match - 1;
3897 -- For named parameters, search the list of actuals to find
3898 -- one that matches the next formal name.
3900 Actual := First_Named;
3903 while Present (Actual) loop
3904 if Chars (Selector_Name (Actual)) = Chars (Formal) then
3907 Actuals_To_Match := Actuals_To_Match - 1;
3908 Formals_To_Match := Formals_To_Match - 1;
3916 if Ekind (Formal) /= E_In_Parameter
3917 or else No (Default_Value (Formal))
3920 if Comes_From_Source (S)
3921 and then Is_Overloadable (S)
3923 Error_Msg_Name_1 := Chars (S);
3924 Error_Msg_Sloc := Sloc (S);
3926 ("missing argument for parameter & " &
3927 "in call to % declared #", N, Formal);
3930 ("missing argument for parameter &", N, Formal);
3938 Formals_To_Match := Formals_To_Match - 1;
3943 Next_Formal (Formal);
3946 if Formals_To_Match = 0 and then Actuals_To_Match = 0 then
3953 -- Find some superfluous named actual that did not get
3954 -- attached to the list of associations.
3956 Actual := First (Actuals);
3958 while Present (Actual) loop
3960 if Nkind (Actual) = N_Parameter_Association
3961 and then Actual /= Last
3962 and then No (Next_Named_Actual (Actual))
3964 Error_Msg_N ("Unmatched actual in call", Actual);
3975 end Normalize_Actuals;
3977 --------------------------------
3978 -- Note_Possible_Modification --
3979 --------------------------------
3981 procedure Note_Possible_Modification (N : Node_Id) is
3985 procedure Set_Ref (E : Entity_Id; N : Node_Id);
3986 -- Internal routine to note modification on entity E by node N
3988 procedure Set_Ref (E : Entity_Id; N : Node_Id) is
3990 Set_Not_Source_Assigned (E, False);
3991 Set_Is_True_Constant (E, False);
3992 Generate_Reference (E, N, 'm');
3995 -- Start of processing for Note_Possible_Modification
3998 -- Loop to find referenced entity, if there is one
4002 -- Test for node rewritten as dereference (e.g. accept parameter)
4004 if Nkind (Exp) = N_Explicit_Dereference
4005 and then Is_Entity_Name (Original_Node (Exp))
4007 Set_Ref (Entity (Original_Node (Exp)), Original_Node (Exp));
4010 elsif Is_Entity_Name (Exp) then
4011 Ent := Entity (Exp);
4013 if (Ekind (Ent) = E_Variable or else Ekind (Ent) = E_Constant)
4014 and then Present (Renamed_Object (Ent))
4016 Exp := Renamed_Object (Ent);
4023 elsif Nkind (Exp) = N_Type_Conversion
4024 or else Nkind (Exp) = N_Unchecked_Type_Conversion
4026 Exp := Expression (Exp);
4028 elsif Nkind (Exp) = N_Slice
4029 or else Nkind (Exp) = N_Indexed_Component
4030 or else Nkind (Exp) = N_Selected_Component
4032 Exp := Prefix (Exp);
4038 end Note_Possible_Modification;
4040 -------------------------
4041 -- Object_Access_Level --
4042 -------------------------
4044 function Object_Access_Level (Obj : Node_Id) return Uint is
4047 -- Returns the static accessibility level of the view denoted
4048 -- by Obj. Note that the value returned is the result of a
4049 -- call to Scope_Depth. Only scope depths associated with
4050 -- dynamic scopes can actually be returned. Since only
4051 -- relative levels matter for accessibility checking, the fact
4052 -- that the distance between successive levels of accessibility
4053 -- is not always one is immaterial (invariant: if level(E2) is
4054 -- deeper than level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
4057 if Is_Entity_Name (Obj) then
4060 -- If E is a type then it denotes a current instance.
4061 -- For this case we add one to the normal accessibility
4062 -- level of the type to ensure that current instances
4063 -- are treated as always being deeper than than the level
4064 -- of any visible named access type (see 3.10.2(21)).
4067 return Type_Access_Level (E) + 1;
4069 elsif Present (Renamed_Object (E)) then
4070 return Object_Access_Level (Renamed_Object (E));
4072 -- Similarly, if E is a component of the current instance of a
4073 -- protected type, any instance of it is assumed to be at a deeper
4074 -- level than the type. For a protected object (whose type is an
4075 -- anonymous protected type) its components are at the same level
4076 -- as the type itself.
4078 elsif not Is_Overloadable (E)
4079 and then Ekind (Scope (E)) = E_Protected_Type
4080 and then Comes_From_Source (Scope (E))
4082 return Type_Access_Level (Scope (E)) + 1;
4085 return Scope_Depth (Enclosing_Dynamic_Scope (E));
4088 elsif Nkind (Obj) = N_Selected_Component then
4089 if Is_Access_Type (Etype (Prefix (Obj))) then
4090 return Type_Access_Level (Etype (Prefix (Obj)));
4092 return Object_Access_Level (Prefix (Obj));
4095 elsif Nkind (Obj) = N_Indexed_Component then
4096 if Is_Access_Type (Etype (Prefix (Obj))) then
4097 return Type_Access_Level (Etype (Prefix (Obj)));
4099 return Object_Access_Level (Prefix (Obj));
4102 elsif Nkind (Obj) = N_Explicit_Dereference then
4104 -- If the prefix is a selected access discriminant then
4105 -- we make a recursive call on the prefix, which will
4106 -- in turn check the level of the prefix object of
4107 -- the selected discriminant.
4109 if Nkind (Prefix (Obj)) = N_Selected_Component
4110 and then Ekind (Etype (Prefix (Obj))) = E_Anonymous_Access_Type
4112 Ekind (Entity (Selector_Name (Prefix (Obj)))) = E_Discriminant
4114 return Object_Access_Level (Prefix (Obj));
4116 return Type_Access_Level (Etype (Prefix (Obj)));
4119 elsif Nkind (Obj) = N_Type_Conversion then
4120 return Object_Access_Level (Expression (Obj));
4122 -- Function results are objects, so we get either the access level
4123 -- of the function or, in the case of an indirect call, the level of
4124 -- of the access-to-subprogram type.
4126 elsif Nkind (Obj) = N_Function_Call then
4127 if Is_Entity_Name (Name (Obj)) then
4128 return Subprogram_Access_Level (Entity (Name (Obj)));
4130 return Type_Access_Level (Etype (Prefix (Name (Obj))));
4133 -- For convenience we handle qualified expressions, even though
4134 -- they aren't technically object names.
4136 elsif Nkind (Obj) = N_Qualified_Expression then
4137 return Object_Access_Level (Expression (Obj));
4139 -- Otherwise return the scope level of Standard.
4140 -- (If there are cases that fall through
4141 -- to this point they will be treated as
4142 -- having global accessibility for now. ???)
4145 return Scope_Depth (Standard_Standard);
4147 end Object_Access_Level;
4149 -----------------------
4150 -- Private_Component --
4151 -----------------------
4153 function Private_Component (Type_Id : Entity_Id) return Entity_Id is
4154 Ancestor : constant Entity_Id := Base_Type (Type_Id);
4156 function Trace_Components
4160 -- Recursive function that does the work, and checks against circular
4161 -- definition for each subcomponent type.
4163 ----------------------
4164 -- Trace_Components --
4165 ----------------------
4167 function Trace_Components
4169 Check : Boolean) return Entity_Id
4171 Btype : constant Entity_Id := Base_Type (T);
4172 Component : Entity_Id;
4174 Candidate : Entity_Id := Empty;
4177 if Check and then Btype = Ancestor then
4178 Error_Msg_N ("circular type definition", Type_Id);
4182 if Is_Private_Type (Btype)
4183 and then not Is_Generic_Type (Btype)
4187 elsif Is_Array_Type (Btype) then
4188 return Trace_Components (Component_Type (Btype), True);
4190 elsif Is_Record_Type (Btype) then
4191 Component := First_Entity (Btype);
4192 while Present (Component) loop
4194 -- skip anonymous types generated by constrained components.
4196 if not Is_Type (Component) then
4197 P := Trace_Components (Etype (Component), True);
4200 if P = Any_Type then
4208 Next_Entity (Component);
4216 end Trace_Components;
4218 -- Start of processing for Private_Component
4221 return Trace_Components (Type_Id, False);
4222 end Private_Component;
4224 -----------------------
4225 -- Process_End_Label --
4226 -----------------------
4228 procedure Process_End_Label (N : Node_Id; Typ : Character) is
4233 Label_Ref : Boolean;
4234 -- Set True if reference to end label itself is required
4237 -- Gets set to the operator symbol or identifier that references
4238 -- the entity Ent. For the child unit case, this is the identifier
4239 -- from the designator. For other cases, this is simply Endl.
4242 -- This is the entity for the construct to which the End_Label applies
4244 procedure Generate_Parent_Ref (N : Node_Id);
4245 -- N is an identifier node that appears as a parent unit reference
4246 -- in the case where Ent is a child unit. This procedure generates
4247 -- an appropriate cross-reference entry.
4249 procedure Generate_Parent_Ref (N : Node_Id) is
4250 Parent_Ent : Entity_Id;
4253 -- Search up scope stack. The reason we do this is that normal
4254 -- visibility analysis would not work for two reasons. First in
4255 -- some subunit cases, the entry for the parent unit may not be
4256 -- visible, and in any case there can be a local entity that
4257 -- hides the scope entity.
4259 Parent_Ent := Current_Scope;
4260 while Present (Parent_Ent) loop
4261 if Chars (Parent_Ent) = Chars (N) then
4263 -- Generate the reference. We do NOT consider this as a
4264 -- reference for unreferenced symbol purposes, but we do
4265 -- force a cross-reference even if the end line does not
4266 -- come from source (the caller already generated the
4267 -- appropriate Typ for this situation).
4270 (Parent_Ent, N, 'r', Set_Ref => False, Force => True);
4271 Style.Check_Identifier (N, Parent_Ent);
4275 Parent_Ent := Scope (Parent_Ent);
4278 -- Fall through means entity was not found -- that's odd, but
4279 -- the appropriate thing is simply to ignore and not generate
4280 -- any cross-reference for this entry.
4283 end Generate_Parent_Ref;
4285 -- Start of processing for Process_End_Label
4288 -- If no node, ignore. This happens in some error situations,
4289 -- and also for some internally generated structures where no
4290 -- end label references are required in any case.
4296 -- Nothing to do if no End_Label, happens for internally generated
4297 -- constructs where we don't want an end label reference anyway.
4298 -- Also nothing to do if Endl is a string literal, which means
4299 -- there was some prior error (bad operator symbol)
4301 Endl := End_Label (N);
4303 if No (Endl) or else Nkind (Endl) = N_String_Literal then
4307 -- Reference node is not in extended main source unit
4309 if not In_Extended_Main_Source_Unit (N) then
4311 -- Generally we do not collect references except for the
4312 -- extended main source unit. The one exception is the 'e'
4313 -- entry for a package spec, where it is useful for a client
4314 -- to have the ending information to define scopes.
4322 -- For this case, we can ignore any parent references,
4323 -- but we need the package name itself for the 'e' entry.
4325 if Nkind (Endl) = N_Designator then
4326 Endl := Identifier (Endl);
4330 -- Reference is in extended main source unit
4335 -- For designator, generate references for the parent entries
4337 if Nkind (Endl) = N_Designator then
4339 -- Generate references for the prefix if the END line comes
4340 -- from source (otherwise we do not need these references)
4342 if Comes_From_Source (Endl) then
4344 while Nkind (Nam) = N_Selected_Component loop
4345 Generate_Parent_Ref (Selector_Name (Nam));
4346 Nam := Prefix (Nam);
4349 Generate_Parent_Ref (Nam);
4352 Endl := Identifier (Endl);
4356 -- Locate the entity to which the end label applies. Most of the
4357 -- time this is simply the current scope containing the construct.
4359 Ent := Current_Scope;
4361 if Chars (Ent) = Chars (Endl) then
4364 -- But in the case of single tasks and single protected objects,
4365 -- the current scope is the anonymous task or protected type and
4366 -- what we want is the object. There is no direct link so what we
4367 -- do is search ahead in the entity chain for the object with the
4368 -- matching type and name. In practice it is almost certain to be
4369 -- the very next entity on the chain, so this is not inefficient.
4372 Ctyp := Etype (Ent);
4376 -- If we don't find the entry we are looking for, that's
4377 -- odd, perhaps results from some error condition? Anyway
4378 -- the appropriate thing is just to abandon the attempt.
4383 -- Exit if we find the entity we are looking for
4385 elsif Etype (Ent) = Ctyp
4386 and then Chars (Ent) = Chars (Endl)
4393 -- If label was really there, then generate a normal reference
4394 -- and then adjust the location in the end label to point past
4395 -- the name (which should almost always be the semicolon).
4399 if Comes_From_Source (Endl) then
4401 -- If a label reference is required, then do the style check
4402 -- and generate a normal cross-reference entry for the label
4405 Style.Check_Identifier (Endl, Ent);
4406 Generate_Reference (Ent, Endl, 'r', Set_Ref => False);
4409 -- Set the location to point past the label (normally this will
4410 -- mean the semicolon immediately following the label). This is
4411 -- done for the sake of the 'e' or 't' entry generated below.
4413 Get_Decoded_Name_String (Chars (Endl));
4414 Set_Sloc (Endl, Sloc (Endl) + Source_Ptr (Name_Len));
4417 -- Now generate the e/t reference
4419 Generate_Reference (Ent, Endl, Typ, Set_Ref => False, Force => True);
4421 -- Restore Sloc, in case modified above, since we have an identifier
4422 -- and the normal Sloc should be left set in the tree.
4424 Set_Sloc (Endl, Loc);
4425 end Process_End_Label;
4431 -- We do the conversion to get the value of the real string by using
4432 -- the scanner, see Sinput for details on use of the internal source
4433 -- buffer for scanning internal strings.
4435 function Real_Convert (S : String) return Node_Id is
4436 Save_Src : constant Source_Buffer_Ptr := Source;
4440 Source := Internal_Source_Ptr;
4443 for J in S'Range loop
4444 Source (Source_Ptr (J)) := S (J);
4447 Source (S'Length + 1) := EOF;
4449 if Source (Scan_Ptr) = '-' then
4451 Scan_Ptr := Scan_Ptr + 1;
4459 Set_Realval (Token_Node, UR_Negate (Realval (Token_Node)));
4466 ------------------------------
4467 -- Requires_Transient_Scope --
4468 ------------------------------
4470 -- A transient scope is required when variable-sized temporaries are
4471 -- allocated in the primary or secondary stack, or when finalization
4472 -- actions must be generated before the next instruction
4474 function Requires_Transient_Scope (Id : Entity_Id) return Boolean is
4475 Typ : constant Entity_Id := Underlying_Type (Id);
4478 -- This is a private type which is not completed yet. This can only
4479 -- happen in a default expression (of a formal parameter or of a
4480 -- record component). Do not expand transient scope in this case
4485 elsif Typ = Standard_Void_Type then
4488 -- The back-end has trouble allocating variable-size temporaries so
4489 -- we generate them in the front-end and need a transient scope to
4490 -- reclaim them properly
4492 elsif not Size_Known_At_Compile_Time (Typ) then
4495 -- Unconstrained discriminated records always require a variable
4496 -- length temporary, since the length may depend on the variant.
4498 elsif Is_Record_Type (Typ)
4499 and then Has_Discriminants (Typ)
4500 and then not Is_Constrained (Typ)
4504 -- Functions returning tagged types may dispatch on result so their
4505 -- returned value is allocated on the secondary stack. Controlled
4506 -- type temporaries need finalization.
4508 elsif Is_Tagged_Type (Typ)
4509 or else Has_Controlled_Component (Typ)
4513 -- Unconstrained array types are returned on the secondary stack
4515 elsif Is_Array_Type (Typ) then
4516 return not Is_Constrained (Typ);
4520 end Requires_Transient_Scope;
4522 --------------------------
4523 -- Reset_Analyzed_Flags --
4524 --------------------------
4526 procedure Reset_Analyzed_Flags (N : Node_Id) is
4528 function Clear_Analyzed
4530 return Traverse_Result;
4531 -- Function used to reset Analyzed flags in tree. Note that we do
4532 -- not reset Analyzed flags in entities, since there is no need to
4533 -- renalalyze entities, and indeed, it is wrong to do so, since it
4534 -- can result in generating auxiliary stuff more than once.
4536 function Clear_Analyzed
4538 return Traverse_Result
4541 if not Has_Extension (N) then
4542 Set_Analyzed (N, False);
4548 function Reset_Analyzed is
4549 new Traverse_Func (Clear_Analyzed);
4551 Discard : Traverse_Result;
4553 -- Start of processing for Reset_Analyzed_Flags
4556 Discard := Reset_Analyzed (N);
4557 end Reset_Analyzed_Flags;
4563 function Same_Name (N1, N2 : Node_Id) return Boolean is
4564 K1 : constant Node_Kind := Nkind (N1);
4565 K2 : constant Node_Kind := Nkind (N2);
4568 if (K1 = N_Identifier or else K1 = N_Defining_Identifier)
4569 and then (K2 = N_Identifier or else K2 = N_Defining_Identifier)
4571 return Chars (N1) = Chars (N2);
4573 elsif (K1 = N_Selected_Component or else K1 = N_Expanded_Name)
4574 and then (K2 = N_Selected_Component or else K2 = N_Expanded_Name)
4576 return Same_Name (Selector_Name (N1), Selector_Name (N2))
4577 and then Same_Name (Prefix (N1), Prefix (N2));
4588 function Same_Type (T1, T2 : Entity_Id) return Boolean is
4593 elsif not Is_Constrained (T1)
4594 and then not Is_Constrained (T2)
4595 and then Base_Type (T1) = Base_Type (T2)
4599 -- For now don't bother with case of identical constraints, to be
4600 -- fiddled with later on perhaps (this is only used for optimization
4601 -- purposes, so it is not critical to do a best possible job)
4608 ------------------------
4609 -- Scope_Is_Transient --
4610 ------------------------
4612 function Scope_Is_Transient return Boolean is
4614 return Scope_Stack.Table (Scope_Stack.Last).Is_Transient;
4615 end Scope_Is_Transient;
4621 function Scope_Within (Scope1, Scope2 : Entity_Id) return Boolean is
4626 while Scop /= Standard_Standard loop
4627 Scop := Scope (Scop);
4629 if Scop = Scope2 then
4637 --------------------------
4638 -- Scope_Within_Or_Same --
4639 --------------------------
4641 function Scope_Within_Or_Same (Scope1, Scope2 : Entity_Id) return Boolean is
4646 while Scop /= Standard_Standard loop
4647 if Scop = Scope2 then
4650 Scop := Scope (Scop);
4655 end Scope_Within_Or_Same;
4657 ------------------------
4658 -- Set_Current_Entity --
4659 ------------------------
4661 -- The given entity is to be set as the currently visible definition
4662 -- of its associated name (i.e. the Node_Id associated with its name).
4663 -- All we have to do is to get the name from the identifier, and
4664 -- then set the associated Node_Id to point to the given entity.
4666 procedure Set_Current_Entity (E : Entity_Id) is
4668 Set_Name_Entity_Id (Chars (E), E);
4669 end Set_Current_Entity;
4671 ---------------------------------
4672 -- Set_Entity_With_Style_Check --
4673 ---------------------------------
4675 procedure Set_Entity_With_Style_Check (N : Node_Id; Val : Entity_Id) is
4676 Val_Actual : Entity_Id;
4680 Set_Entity (N, Val);
4683 and then not Suppress_Style_Checks (Val)
4684 and then not In_Instance
4686 if Nkind (N) = N_Identifier then
4689 elsif Nkind (N) = N_Expanded_Name then
4690 Nod := Selector_Name (N);
4698 -- A special situation arises for derived operations, where we want
4699 -- to do the check against the parent (since the Sloc of the derived
4700 -- operation points to the derived type declaration itself).
4702 while not Comes_From_Source (Val_Actual)
4703 and then Nkind (Val_Actual) in N_Entity
4704 and then (Ekind (Val_Actual) = E_Enumeration_Literal
4705 or else Ekind (Val_Actual) = E_Function
4706 or else Ekind (Val_Actual) = E_Generic_Function
4707 or else Ekind (Val_Actual) = E_Procedure
4708 or else Ekind (Val_Actual) = E_Generic_Procedure)
4709 and then Present (Alias (Val_Actual))
4711 Val_Actual := Alias (Val_Actual);
4714 -- Renaming declarations for generic actuals do not come from source,
4715 -- and have a different name from that of the entity they rename, so
4716 -- there is no style check to perform here.
4718 if Chars (Nod) = Chars (Val_Actual) then
4719 Style.Check_Identifier (Nod, Val_Actual);
4724 Set_Entity (N, Val);
4725 end Set_Entity_With_Style_Check;
4727 ------------------------
4728 -- Set_Name_Entity_Id --
4729 ------------------------
4731 procedure Set_Name_Entity_Id (Id : Name_Id; Val : Entity_Id) is
4733 Set_Name_Table_Info (Id, Int (Val));
4734 end Set_Name_Entity_Id;
4736 ---------------------
4737 -- Set_Next_Actual --
4738 ---------------------
4740 procedure Set_Next_Actual (Ass1_Id : Node_Id; Ass2_Id : Node_Id) is
4742 if Nkind (Parent (Ass1_Id)) = N_Parameter_Association then
4743 Set_First_Named_Actual (Parent (Ass1_Id), Ass2_Id);
4745 end Set_Next_Actual;
4747 -----------------------
4748 -- Set_Public_Status --
4749 -----------------------
4751 procedure Set_Public_Status (Id : Entity_Id) is
4752 S : constant Entity_Id := Current_Scope;
4755 if S = Standard_Standard
4756 or else (Is_Public (S)
4757 and then (Ekind (S) = E_Package
4758 or else Is_Record_Type (S)
4759 or else Ekind (S) = E_Void))
4763 -- The bounds of an entry family declaration can generate object
4764 -- declarations that are visible to the back-end, e.g. in the
4765 -- the declaration of a composite type that contains tasks.
4768 and then Is_Concurrent_Type (S)
4769 and then not Has_Completion (S)
4770 and then Nkind (Parent (Id)) = N_Object_Declaration
4774 end Set_Public_Status;
4776 ----------------------------
4777 -- Set_Scope_Is_Transient --
4778 ----------------------------
4780 procedure Set_Scope_Is_Transient (V : Boolean := True) is
4782 Scope_Stack.Table (Scope_Stack.Last).Is_Transient := V;
4783 end Set_Scope_Is_Transient;
4789 procedure Set_Size_Info (T1, T2 : Entity_Id) is
4791 -- We copy Esize, but not RM_Size, since in general RM_Size is
4792 -- subtype specific and does not get inherited by all subtypes.
4794 Set_Esize (T1, Esize (T2));
4795 Set_Has_Biased_Representation (T1, Has_Biased_Representation (T2));
4797 if Is_Discrete_Or_Fixed_Point_Type (T1)
4799 Is_Discrete_Or_Fixed_Point_Type (T2)
4801 Set_Is_Unsigned_Type (T1, Is_Unsigned_Type (T2));
4804 Set_Alignment (T1, Alignment (T2));
4807 --------------------
4808 -- Static_Integer --
4809 --------------------
4811 function Static_Integer (N : Node_Id) return Uint is
4813 Analyze_And_Resolve (N, Any_Integer);
4816 or else Error_Posted (N)
4817 or else Etype (N) = Any_Type
4822 if Is_Static_Expression (N) then
4823 if not Raises_Constraint_Error (N) then
4824 return Expr_Value (N);
4829 elsif Etype (N) = Any_Type then
4833 Error_Msg_N ("static integer expression required here", N);
4838 --------------------------
4839 -- Statically_Different --
4840 --------------------------
4842 function Statically_Different (E1, E2 : Node_Id) return Boolean is
4843 R1 : constant Node_Id := Get_Referenced_Object (E1);
4844 R2 : constant Node_Id := Get_Referenced_Object (E2);
4847 return Is_Entity_Name (R1)
4848 and then Is_Entity_Name (R2)
4849 and then Entity (R1) /= Entity (R2)
4850 and then not Is_Formal (Entity (R1))
4851 and then not Is_Formal (Entity (R2));
4852 end Statically_Different;
4854 -----------------------------
4855 -- Subprogram_Access_Level --
4856 -----------------------------
4858 function Subprogram_Access_Level (Subp : Entity_Id) return Uint is
4860 if Present (Alias (Subp)) then
4861 return Subprogram_Access_Level (Alias (Subp));
4863 return Scope_Depth (Enclosing_Dynamic_Scope (Subp));
4865 end Subprogram_Access_Level;
4871 procedure Trace_Scope (N : Node_Id; E : Entity_Id; Msg : String) is
4873 if Debug_Flag_W then
4874 for J in 0 .. Scope_Stack.Last loop
4879 Write_Name (Chars (E));
4880 Write_Str (" line ");
4881 Write_Int (Int (Get_Logical_Line_Number (Sloc (N))));
4886 -----------------------
4887 -- Transfer_Entities --
4888 -----------------------
4890 procedure Transfer_Entities (From : Entity_Id; To : Entity_Id) is
4891 Ent : Entity_Id := First_Entity (From);
4898 if (Last_Entity (To)) = Empty then
4899 Set_First_Entity (To, Ent);
4901 Set_Next_Entity (Last_Entity (To), Ent);
4904 Set_Last_Entity (To, Last_Entity (From));
4906 while Present (Ent) loop
4907 Set_Scope (Ent, To);
4909 if not Is_Public (Ent) then
4910 Set_Public_Status (Ent);
4913 and then Ekind (Ent) = E_Record_Subtype
4916 -- The components of the propagated Itype must be public
4923 Comp := First_Entity (Ent);
4925 while Present (Comp) loop
4926 Set_Is_Public (Comp);
4936 Set_First_Entity (From, Empty);
4937 Set_Last_Entity (From, Empty);
4938 end Transfer_Entities;
4940 -----------------------
4941 -- Type_Access_Level --
4942 -----------------------
4944 function Type_Access_Level (Typ : Entity_Id) return Uint is
4945 Btyp : Entity_Id := Base_Type (Typ);
4948 -- If the type is an anonymous access type we treat it as being
4949 -- declared at the library level to ensure that names such as
4950 -- X.all'access don't fail static accessibility checks.
4952 if Ekind (Btyp) in Access_Kind then
4953 if Ekind (Btyp) = E_Anonymous_Access_Type then
4954 return Scope_Depth (Standard_Standard);
4957 Btyp := Root_Type (Btyp);
4960 return Scope_Depth (Enclosing_Dynamic_Scope (Btyp));
4961 end Type_Access_Level;
4963 --------------------------
4964 -- Unit_Declaration_Node --
4965 --------------------------
4967 function Unit_Declaration_Node (Unit_Id : Entity_Id) return Node_Id is
4968 N : Node_Id := Parent (Unit_Id);
4971 -- Predefined operators do not have a full function declaration.
4973 if Ekind (Unit_Id) = E_Operator then
4977 while Nkind (N) /= N_Abstract_Subprogram_Declaration
4978 and then Nkind (N) /= N_Formal_Package_Declaration
4979 and then Nkind (N) /= N_Formal_Subprogram_Declaration
4980 and then Nkind (N) /= N_Function_Instantiation
4981 and then Nkind (N) /= N_Generic_Package_Declaration
4982 and then Nkind (N) /= N_Generic_Subprogram_Declaration
4983 and then Nkind (N) /= N_Package_Declaration
4984 and then Nkind (N) /= N_Package_Body
4985 and then Nkind (N) /= N_Package_Instantiation
4986 and then Nkind (N) /= N_Package_Renaming_Declaration
4987 and then Nkind (N) /= N_Procedure_Instantiation
4988 and then Nkind (N) /= N_Subprogram_Declaration
4989 and then Nkind (N) /= N_Subprogram_Body
4990 and then Nkind (N) /= N_Subprogram_Body_Stub
4991 and then Nkind (N) /= N_Subprogram_Renaming_Declaration
4992 and then Nkind (N) /= N_Task_Body
4993 and then Nkind (N) /= N_Task_Type_Declaration
4994 and then Nkind (N) not in N_Generic_Renaming_Declaration
4997 pragma Assert (Present (N));
5001 end Unit_Declaration_Node;
5003 ----------------------
5004 -- Within_Init_Proc --
5005 ----------------------
5007 function Within_Init_Proc return Boolean is
5012 while not Is_Overloadable (S) loop
5013 if S = Standard_Standard then
5020 return Chars (S) = Name_uInit_Proc;
5021 end Within_Init_Proc;
5027 procedure Wrong_Type (Expr : Node_Id; Expected_Type : Entity_Id) is
5028 Found_Type : constant Entity_Id := First_Subtype (Etype (Expr));
5029 Expec_Type : constant Entity_Id := First_Subtype (Expected_Type);
5031 function Has_One_Matching_Field return Boolean;
5032 -- Determines whether Expec_Type is a record type with a single
5033 -- component or discriminant whose type matches the found type or
5034 -- is a one dimensional array whose component type matches the
5037 function Has_One_Matching_Field return Boolean is
5041 if Is_Array_Type (Expec_Type)
5042 and then Number_Dimensions (Expec_Type) = 1
5044 Covers (Etype (Component_Type (Expec_Type)), Found_Type)
5048 elsif not Is_Record_Type (Expec_Type) then
5052 E := First_Entity (Expec_Type);
5058 elsif (Ekind (E) /= E_Discriminant
5059 and then Ekind (E) /= E_Component)
5060 or else (Chars (E) = Name_uTag
5061 or else Chars (E) = Name_uParent)
5070 if not Covers (Etype (E), Found_Type) then
5073 elsif Present (Next_Entity (E)) then
5080 end Has_One_Matching_Field;
5082 -- Start of processing for Wrong_Type
5085 -- Don't output message if either type is Any_Type, or if a message
5086 -- has already been posted for this node. We need to do the latter
5087 -- check explicitly (it is ordinarily done in Errout), because we
5088 -- are using ! to force the output of the error messages.
5090 if Expec_Type = Any_Type
5091 or else Found_Type = Any_Type
5092 or else Error_Posted (Expr)
5096 -- In an instance, there is an ongoing problem with completion of
5097 -- type derived from private types. Their structure is what Gigi
5098 -- expects, but the Etype is the parent type rather than the
5099 -- derived private type itself. Do not flag error in this case. The
5100 -- private completion is an entity without a parent, like an Itype.
5101 -- Similarly, full and partial views may be incorrect in the instance.
5102 -- There is no simple way to insure that it is consistent ???
5104 elsif In_Instance then
5106 if Etype (Etype (Expr)) = Etype (Expected_Type)
5107 and then No (Parent (Expected_Type))
5113 -- An interesting special check. If the expression is parenthesized
5114 -- and its type corresponds to the type of the sole component of the
5115 -- expected record type, or to the component type of the expected one
5116 -- dimensional array type, then assume we have a bad aggregate attempt.
5118 if Nkind (Expr) in N_Subexpr
5119 and then Paren_Count (Expr) /= 0
5120 and then Has_One_Matching_Field
5122 Error_Msg_N ("positional aggregate cannot have one component", Expr);
5124 -- Another special check, if we are looking for a pool-specific access
5125 -- type and we found an E_Access_Attribute_Type, then we have the case
5126 -- of an Access attribute being used in a context which needs a pool-
5127 -- specific type, which is never allowed. The one extra check we make
5128 -- is that the expected designated type covers the Found_Type.
5130 elsif Is_Access_Type (Expec_Type)
5131 and then Ekind (Found_Type) = E_Access_Attribute_Type
5132 and then Ekind (Base_Type (Expec_Type)) /= E_General_Access_Type
5133 and then Ekind (Base_Type (Expec_Type)) /= E_Anonymous_Access_Type
5135 (Designated_Type (Expec_Type), Designated_Type (Found_Type))
5137 Error_Msg_N ("result must be general access type!", Expr);
5138 Error_Msg_NE ("add ALL to }!", Expr, Expec_Type);
5140 -- If the expected type is an anonymous access type, as for access
5141 -- parameters and discriminants, the error is on the designated types.
5143 elsif Ekind (Expec_Type) = E_Anonymous_Access_Type then
5144 if Comes_From_Source (Expec_Type) then
5145 Error_Msg_NE ("expected}!", Expr, Expec_Type);
5148 ("expected an access type with designated}",
5149 Expr, Designated_Type (Expec_Type));
5152 if Is_Access_Type (Found_Type)
5153 and then not Comes_From_Source (Found_Type)
5156 ("found an access type with designated}!",
5157 Expr, Designated_Type (Found_Type));
5159 if From_With_Type (Found_Type) then
5160 Error_Msg_NE ("found incomplete}!", Expr, Found_Type);
5162 ("\possibly missing with_clause on&", Expr,
5163 Scope (Found_Type));
5165 Error_Msg_NE ("found}!", Expr, Found_Type);
5169 -- Normal case of one type found, some other type expected
5172 -- If the names of the two types are the same, see if some
5173 -- number of levels of qualification will help. Don't try
5174 -- more than three levels, and if we get to standard, it's
5175 -- no use (and probably represents an error in the compiler)
5176 -- Also do not bother with internal scope names.
5179 Expec_Scope : Entity_Id;
5180 Found_Scope : Entity_Id;
5183 Expec_Scope := Expec_Type;
5184 Found_Scope := Found_Type;
5186 for Levels in Int range 0 .. 3 loop
5187 if Chars (Expec_Scope) /= Chars (Found_Scope) then
5188 Error_Msg_Qual_Level := Levels;
5192 Expec_Scope := Scope (Expec_Scope);
5193 Found_Scope := Scope (Found_Scope);
5195 exit when Expec_Scope = Standard_Standard
5197 Found_Scope = Standard_Standard
5199 not Comes_From_Source (Expec_Scope)
5201 not Comes_From_Source (Found_Scope);
5205 Error_Msg_NE ("expected}!", Expr, Expec_Type);
5207 if Is_Entity_Name (Expr)
5208 and then Is_Package (Entity (Expr))
5210 Error_Msg_N ("found package name!", Expr);
5212 elsif Is_Entity_Name (Expr)
5214 (Ekind (Entity (Expr)) = E_Procedure
5216 Ekind (Entity (Expr)) = E_Generic_Procedure)
5218 Error_Msg_N ("found procedure name instead of function!", Expr);
5220 -- catch common error: a prefix or infix operator which is not
5221 -- directly visible because the type isn't.
5223 elsif Nkind (Expr) in N_Op
5224 and then Is_Overloaded (Expr)
5225 and then not Is_Immediately_Visible (Expec_Type)
5226 and then not Is_Potentially_Use_Visible (Expec_Type)
5227 and then not In_Use (Expec_Type)
5228 and then Has_Compatible_Type (Right_Opnd (Expr), Expec_Type)
5231 "operator of the type is not directly visible!", Expr);
5234 Error_Msg_NE ("found}!", Expr, Found_Type);
5237 Error_Msg_Qual_Level := 0;